Sign in
RANDOM
1997
1999
2000
2002
1997
2002
Keyphrases
Publications
2002
Martin E. Dyer
,
Mark Jerrum
,
Eric Vigoda
Rapidly Mixing Markov Chains for Dismantleable Constraint Graphs.
RANDOM
(2002)
Cristopher Moore
,
Alexander Russell
Quantum Walks on the Hypercube.
RANDOM
(2002)
Milena Mihail
,
Christos H. Papadimitriou
On the Eigenvalue Power Law.
RANDOM
(2002)
Oded Goldreich
,
Avi Wigderson
Derandomization That Is Rarely Wrong from Short Advice That Is Typically Good.
RANDOM
(2002)
Alfredo De Santis
,
Giovanni Di Crescenzo
,
Giuseppe Persiano
Randomness-Optimal Characterization of Two NP Proof Systems.
RANDOM
(2002)
Martin E. Dyer
,
Leslie Ann Goldberg
,
Mark Jerrum
Counting and Sampling H-Colourings.
RANDOM
(2002)
Michal Parnas
,
Dana Ron
,
Ronitt Rubinfeld
On Testing Convexity and Submodularity.
RANDOM
(2002)
Josep Díaz
,
Norman Do
,
Maria J. Serna
,
Nicholas C. Wormald
Bisection of Random Cubic Graphs.
RANDOM
(2002)
Ziv Bar-Yossef
,
T. S. Jayram
,
Ravi Kumar
,
D. Sivakumar
,
Luca Trevisan
Counting Distinct Elements in a Data Stream.
RANDOM
(2002)
Amin Coja-Oghlan
Finding Sparse Induced Subgraphs of Semirandom Graphs.
RANDOM
(2002)
Martin E. Dyer
,
Alistair Sinclair
,
Eric Vigoda
,
Dror Weitz
Mixing in Time and Space for Lattice Spin Systems: A Combinatorial View.
RANDOM
(2002)
Lars Engebretsen
,
Venkatesan Guruswami
Is Constraint Satisfaction Over Two Variables Always Easy?
RANDOM
(2002)
Boaz Barak
A Probabilistic-Time Hierarchy Theorem for "Slightly Non-uniform" Algorithms.
RANDOM
(2002)
Kenji Obata
Optimal Lower Bounds for 2-Query Locally Decodable Linear Codes.
RANDOM
(2002)
Avner Magen
Dimensionality Reductions That Preserve Volumes and Distance to Affine Spaces, and Their Algorithmic Applications.
RANDOM
(2002)
William Duckworth
,
Bernard Mans
Small k-Dominating Sets of Regular Graphs.
RANDOM
(2002)
Hana Chockler
,
Orna Kupferman
omega-Regular Languages Are Testable with a Constant Number of Queries.
RANDOM
(2002)
Colin Cooper
Classifying Special Interest Groups in Web Graphs.
RANDOM
(2002)
Christopher Malon
,
Igor Pak
Percolation on Finite Cayley Graphs.
RANDOM
(2002)
Dimitris Achlioptas
,
Cristopher Moore
On the 2-Colorability of Random Hypergraphs.
RANDOM
(2002)
Ehud Friedgut
,
Jeff Kahn
,
Avi Wigderson
Computing Graph Properties by Randomized Subcube Partitions.
RANDOM
(2002)
volume 2483, 2002
Randomization and Approximation Techniques, 6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002, Proceedings
RANDOM
2483 (2002)
1998
Yossi Azar
,
Oded Regev
On-Line Bin-Stretching.
RANDOM
(1998)
Vojtech Rödl
,
Andrzej Rucinski
,
Michelle Wagner
An Algorithmic Embedding of Graphs via Perfect Matchings.
RANDOM
(1998)
Mike Burmester
,
Yvo Desmedt
,
Yongge Wang
Using Approximation Hardness to Achieve Dependable Computation.
RANDOM
(1998)
Devdatt P. Dubhashi
Talagrand's Inequality and Locality in Distributed Computing.
RANDOM
(1998)
Martin Raab
,
Angelika Steger
"Balls into Bins" - A Simple and Tight Analysis.
RANDOM
(1998)
Vicente Cerverón
,
Ariadna Fuertes
Parallel Random Search and Tabu Search for the Minimal Consistent Subset Selection Problem.
RANDOM
(1998)
Pere Guitart
,
Josep M. Basart
A High Performance Approximate Algorithm for the Steiner Problem in Graphs.
RANDOM
(1998)
Roy Armoni
On the Derandomization of Space-Bounded Computations.
RANDOM
(1998)
Bernd Gärtner
Combinatorial Linear Programming: Geometry Can Help.
RANDOM
(1998)
Israel A. Wagner
,
Michael Lindenbaum
,
Alfred M. Bruckstein
Robotic Exploration, Brownian Motion and Electrical Resistance.
RANDOM
(1998)
Don Coppersmith
,
Gregory B. Sorkin
Constructive Bounds and Exact Expectations for the Random Assignment Problem.
RANDOM
(1998)
Carlos Domingo
,
Osamu Watanabe
,
Tadashi Yamazaki
A Role of Constraint in Self-Organization.
RANDOM
(1998)
Yael Gertner
,
Shafi Goldwasser
,
Tal Malkin
A Random Server Model for Private Information Retrieval or How to Achieve Information Theoretic PIR Avoiding Database Replication.
RANDOM
(1998)
Claus-Peter Schnorr
,
C. R. Subramanian
Almost Optimal (on the average) Combinatorial Algorithms for Boolean Matrix Product Witnesses, Computing the Diameter (Extended Abstract).
RANDOM
(1998)
Michael Luby
Tornado Codes: Practical Erasure Codes Based on Random Irregular Graphs.
RANDOM
(1998)
Richard Cole
,
Alan M. Frieze
,
Bruce M. Maggs
,
Michael Mitzenmacher
,
Andréa W. Richa
,
Ramesh K. Sitaraman
,
Eli Upfal
On Balls and Bins with Deletions.
RANDOM
(1998)
Abraham Sharell
A Note on Bounding the Mixing Time by Linear Programming.
RANDOM
(1998)
Charles Knessl
,
Wojciech Szpankowski
Quicksort Again Revisited.
RANDOM
(1998)
Andrei Z. Broder
,
Moses Charikar
,
Michael Mitzenmacher
A Derandomization Using Min-Wise Independent Permutations.
RANDOM
(1998)
Stefano Leonardi
,
Andrea Vitaletti
Randomized Lower Bounds for Online Path Coloring.
RANDOM
(1998)
Chi-Jen Lu
Deterministic Hypergraph Coloring and Its Applications.
RANDOM
(1998)
Kathleen Steinhöfel
,
Andreas Alexander Albrecht
,
C. K. Wong
On Various Cooling Schedules for Simulated Annealing Applied to the Job Shop Problem.
RANDOM
(1998)
Ricardo A. Baeza-Yates
,
Joaquim Gabarró
,
Xavier Messeguer
Fringe Analysis of Synchronized Parallel Algorithms on 2-3 Trees.
RANDOM
(1998)
Gunnar Andersson
,
Lars Engebretsen
Sampling Methods Applied to Dense Instances of Non-Boolean Optimization Problems.
RANDOM
(1998)
Leslie Ann Goldberg
,
Mark Jerrum
The "Burnside Process" Converges Slowly.
RANDOM
(1998)
S. Muthukrishnan
,
Torsten Suel
Second-Order Methods for Distributed Approximate Single- and Multicommodity Flow.
RANDOM
(1998)
Josep Díaz
,
Jordi Petit
,
Maria J. Serna
Random Geometric Problems on [0, 1]².
RANDOM
(1998)
volume 1518, 1998
Randomization and Approximation Techniques in Computer Science, Second International Workshop, RANDOM'98, Barcelona, Spain, October 8-10, 1998, Proceedings
RANDOM
1518 (1998)