Imagen de Portada

Notes on Randomized Algorithms

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Aspnes, James
Formato:	Preprint
Publicado:	2020
Materias:	Data Structures and Algorithms 68-01
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Algorithms Transcending the SAT-Symmetry Interface
por: Anders, Markus, et al.
Publicado: (2023)

satsuma: Structure-based Symmetry Breaking in SAT
por: Anders, Markus, et al.
Publicado: (2024)

A Space-Efficient Algorithm for Longest Common Almost Increasing Subsequence of Two Sequences
por: Rahat, Md Tanzeem, et al.
Publicado: (2025)

Euclidean Affine Functions and Applications to Calendar Algorithms
por: Neri, Cassio, et al.
Publicado: (2021)

New Theoretical Insights and Algorithmic Solutions for Reconstructing Score Sequences from Tournament Score Sets
por: Liu, Bowen
Publicado: (2025)

Independent Set Reconfiguration Under Bounded-Hop Token
por: Hatano, Hiroki, et al.
Publicado: (2024)

Towards a Unified Theory of Time-Varying Data
por: Bumpus, Benjamin Merlin, et al.
Publicado: (2024)

Robust Algorithms for Finding Cliques in Random Intersection Graphs via Sum-of-Squares
por: Göbel, Andreas, et al.
Publicado: (2025)

Computing and Enumerating Minimal Common Supersequences Between Two Strings
por: Sopp, Braeden, et al.
Publicado: (2026)

Optimal Discretization is Fixed-parameter Tractable
por: Kratsch, Stefan, et al.
Publicado: (2020)

On Distributed Colouring of Hyperbolic Random Graphs
por: Maus, Yannic, et al.
Publicado: (2025)

Deterministically Simulating Barely Random Algorithms in the Random-Order Arrival Model
por: Borodin, Allan, et al.
Publicado: (2025)

Compact enumeration for scheduling one machine
por: Vakhania, Nodari
Publicado: (2021)

Orientability of Undirected Phylogenetic Networks to a Desired Class: Practical Algorithms and Application to Tree-Child Orientation
por: Urata, Tsuyoshi, et al.
Publicado: (2024)

Computing Maximal Repeating Subsequences in a String
por: Gong, Mingyang, et al.
Publicado: (2026)

Improved Approximation Algorithms for the Expanding Search Problem
por: Griesbach, Svenja M., et al.
Publicado: (2023)

Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means
por: Friggstad, Zachary, et al.
Publicado: (2018)

A Polynomial-Time Deterministic Algorithm for an NP-Complete Problem
por: Jiang, Xinwen, et al.
Publicado: (2021)

A Polynomial-time Algorithm to Solve the Airplane Refueling Problem: the Sequential Search Algorithm
por: Cui, Jinchuan, et al.
Publicado: (2022)

Tight bounds on adjacency labels for monotone graph classes
por: Bonnet, Édouard, et al.
Publicado: (2023)

Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes
por: Bonnet, Édouard, et al.
Publicado: (2023)

Algorithms for Massive Data -- Lecture Notes
por: Prezza, Nicola
Publicado: (2023)

Using Single-Neuron Representations for Hierarchical Concepts as Abstractions of Multi-Neuron Representations
por: Lynch, Nancy
Publicado: (2024)

On the Advice Complexity of Online Unit Clustering
por: Nagy-György, Judit
Publicado: (2023)

Near-Optimal Relative Error Streaming Quantile Estimation via Elastic Compactors
por: Gribelyuk, Elena, et al.
Publicado: (2024)

Parameterized Complexity of Directed Traveling Salesman Problem
por: Blažej, Václav, et al.
Publicado: (2025)

The Telephone $k$-Multicast Problem
por: Hathcock, Daniel, et al.
Publicado: (2024)

Efficient Processing of Subsequent Densest Subgraph Query
por: Hung, Chia-Yang, et al.
Publicado: (2024)

Cardinality-Constrained Continuous Knapsack Problem with Concave Piecewise-Linear Utilities
por: Bai, Miao, et al.
Publicado: (2023)

A Bad Example for Jain's Iterative Rounding Theorem for the Cover Small Cuts Problem
por: Simmons, Miles, et al.
Publicado: (2025)

The Even-Path Problem in Directed Single-Crossing-Minor-Free Graphs
por: Chauhan, Archit, et al.
Publicado: (2024)

Strongly Sublinear Algorithms for Testing Pattern Freeness
por: Newman, Ilan, et al.
Publicado: (2021)

Computational Lower Bounds for Correlated Random Graphs via Algorithmic Contiguity
por: Li, Zhangsong
Publicado: (2025)

A Note on the Conditional Optimality of Chiba and Nishizeki's Algorithms
por: Kirkpatrick, Yael, et al.
Publicado: (2024)

Adjacency Labeling Schemes for Small Classes
por: Bonnet, Édouard, et al.
Publicado: (2024)

A Faster Algorithm for Independent Cut
por: Chernyshev, Vsevolod, et al.
Publicado: (2025)

Building a Nest by an Automaton
por: Czyzowicz, Jurek, et al.
Publicado: (2019)

Optimizing Exact String Matching via Statistical Anchoring
por: Garraoui, Omar
Publicado: (2025)

Fast FPT Algorithms for Grundy Number on Dense Graphs
por: Nezhad, Sina Ghasemi, et al.
Publicado: (2024)

Online Algorithms with Randomly Infused Advice
por: Emek, Yuval, et al.
Publicado: (2023)