Search results for "RANDOM"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Kenji Obata	Optimal Lower Bounds for 2-Query Locally Decodable Linear Codes.	RANDOM	2002	DBLP DOI BibTeX RDF
1	Cristopher Moore, Alexander Russell	Quantum Walks on the Hypercube.	RANDOM	2002	DBLP DOI BibTeX RDF
1	Colin Cooper	Classifying Special Interest Groups in Web Graphs.	RANDOM	2002	DBLP DOI BibTeX RDF
1	Avner Magen	Dimensionality Reductions That Preserve Volumes and Distance to Affine Spaces, and Their Algorithmic Applications.	RANDOM	2002	DBLP DOI BibTeX RDF
1	Ehud Friedgut, Jeff Kahn 0001, Avi Wigderson	Computing Graph Properties by Randomized Subcube Partitions.	RANDOM	2002	DBLP DOI BibTeX RDF
1	Oded Goldreich 0001, Avi Wigderson	Derandomization That Is Rarely Wrong from Short Advice That Is Typically Good.	RANDOM	2002	DBLP DOI BibTeX RDF
1	Lars Engebretsen, Venkatesan Guruswami	Is Constraint Satisfaction Over Two Variables Always Easy?	RANDOM	2002	DBLP DOI BibTeX RDF
1	Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum	Counting and Sampling H-Colourings.	RANDOM	2002	DBLP DOI BibTeX RDF
1	Martin E. Dyer, Mark Jerrum, Eric Vigoda	Rapidly Mixing Markov Chains for Dismantleable Constraint Graphs.	RANDOM	2002	DBLP DOI BibTeX RDF
1	Martin E. Dyer, Alistair Sinclair, Eric Vigoda, Dror Weitz	Mixing in Time and Space for Lattice Spin Systems: A Combinatorial View.	RANDOM	2002	DBLP DOI BibTeX RDF
1	Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar 0001, D. Sivakumar 0001, Luca Trevisan	Counting Distinct Elements in a Data Stream.	RANDOM	2002	DBLP DOI BibTeX RDF
1	Christopher Malon, Igor Pak	Percolation on Finite Cayley Graphs.	RANDOM	2002	DBLP DOI BibTeX RDF
1	José D. P. Rolim, Salil P. Vadhan (eds.)	Randomization and Approximation Techniques, 6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002, Proceedings	RANDOM	2002	DBLP DOI BibTeX RDF
1	Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano	Randomness-Optimal Characterization of Two NP Proof Systems.	RANDOM	2002	DBLP DOI BibTeX RDF
1	Amin Coja-Oghlan	Finding Sparse Induced Subgraphs of Semirandom Graphs.	RANDOM	2002	DBLP DOI BibTeX RDF
1	Boaz Barak	A Probabilistic-Time Hierarchy Theorem for "Slightly Non-uniform" Algorithms.	RANDOM	2002	DBLP DOI BibTeX RDF
1	Michal Parnas, Dana Ron, Ronitt Rubinfeld	On Testing Convexity and Submodularity.	RANDOM	2002	DBLP DOI BibTeX RDF
1	Josep Díaz, Norman Do, Maria J. Serna, Nicholas C. Wormald	Bisection of Random Cubic Graphs.	RANDOM	2002	DBLP DOI BibTeX RDF
1	William Duckworth, Bernard Mans	Small k-Dominating Sets of Regular Graphs.	RANDOM	2002	DBLP DOI BibTeX RDF
1	Milena Mihail, Christos H. Papadimitriou	On the Eigenvalue Power Law.	RANDOM	2002	DBLP DOI BibTeX RDF
1	Hana Chockler, Orna Kupferman	omega-Regular Languages Are Testable with a Constant Number of Queries.	RANDOM	2002	DBLP DOI BibTeX RDF
1	Dimitris Achlioptas, Cristopher Moore	On the 2-Colorability of Random Hypergraphs.	RANDOM	2002	DBLP DOI BibTeX RDF
1	Devdatt P. Dubhashi	Talagrand's Inequality and Locality in Distributed Computing.	RANDOM	1998	DBLP DOI BibTeX RDF
1	Chi-Jen Lu	Deterministic Hypergraph Coloring and Its Applications.	RANDOM	1998	DBLP DOI BibTeX RDF
1	Josep Díaz, Jordi Petit, Maria J. Serna	Random Geometric Problems on [0, 1]².	RANDOM	1998	DBLP DOI BibTeX RDF
1	Pere Guitart, Josep M. Basart	A High Performance Approximate Algorithm for the Steiner Problem in Graphs.	RANDOM	1998	DBLP DOI BibTeX RDF
1	Michael Luby, José D. P. Rolim, Maria J. Serna (eds.)	Randomization and Approximation Techniques in Computer Science, Second International Workshop, RANDOM'98, Barcelona, Spain, October 8-10, 1998, Proceedings	RANDOM	1998	DBLP DOI BibTeX RDF
1	Abraham Sharell	A Note on Bounding the Mixing Time by Linear Programming.	RANDOM	1998	DBLP DOI BibTeX RDF
1	Stefano Leonardi 0001, Andrea Vitaletti	Randomized Lower Bounds for Online Path Coloring.	RANDOM	1998	DBLP DOI BibTeX RDF
1	Ricardo A. Baeza-Yates, Joaquim Gabarró, Xavier Messeguer	Fringe Analysis of Synchronized Parallel Algorithms on 2-3 Trees.	RANDOM	1998	DBLP DOI BibTeX RDF	Fringe analysis, 2-3 trees, Binomial trans- form, Parallel algorithms
1	S. Muthukrishnan 0001, Torsten Suel	Second-Order Methods for Distributed Approximate Single- and Multicommodity Flow.	RANDOM	1998	DBLP DOI BibTeX RDF
1	Vojtech Rödl, Andrzej Rucinski 0001, Michelle Wagner	An Algorithmic Embedding of Graphs via Perfect Matchings.	RANDOM	1998	DBLP DOI BibTeX RDF
1	Roy Armoni	On the Derandomization of Space-Bounded Computations.	RANDOM	1998	DBLP DOI BibTeX RDF
1	Israel A. Wagner, Michael Lindenbaum, Alfred M. Bruckstein	Robotic Exploration, Brownian Motion and Electrical Resistance.	RANDOM	1998	DBLP DOI BibTeX RDF
1	Don Coppersmith, Gregory B. Sorkin	Constructive Bounds and Exact Expectations for the Random Assignment Problem.	RANDOM	1998	DBLP DOI BibTeX RDF
1	Michael Luby	Tornado Codes: Practical Erasure Codes Based on Random Irregular Graphs.	RANDOM	1998	DBLP DOI BibTeX RDF
1	Andrei Z. Broder, Moses Charikar, Michael Mitzenmacher	A Derandomization Using Min-Wise Independent Permutations.	RANDOM	1998	DBLP DOI BibTeX RDF
1	Kathleen Steinhöfel, Andreas Alexander Albrecht, C. K. Wong	On Various Cooling Schedules for Simulated Annealing Applied to the Job Shop Problem.	RANDOM	1998	DBLP DOI BibTeX RDF
1	Mireille Régnier, Wojciech Szpankowski	Complexity of Sequential Pattern Matching Algorithms.	RANDOM	1998	DBLP DOI BibTeX RDF
1	Yossi Azar, Oded Regev 0001	On-Line Bin-Stretching.	RANDOM	1998	DBLP DOI BibTeX RDF	bin-stretching, scheduling, approximation algorithms, load balancing, On-line algorithms, bin-packing
1	Mike Burmester, Yvo Desmedt, Yongge Wang	Using Approximation Hardness to Achieve Dependable Computation.	RANDOM	1998	DBLP DOI BibTeX RDF
1	Martin Raab, Angelika Steger	"Balls into Bins" - A Simple and Tight Analysis.	RANDOM	1998	DBLP DOI BibTeX RDF
1	Vicente Cerverón, Ariadna Fuertes	Parallel Random Search and Tabu Search for the Minimal Consistent Subset Selection Problem.	RANDOM	1998	DBLP DOI BibTeX RDF
1	Carlos Domingo, Osamu Watanabe 0001, Tadashi Yamazaki	A Role of Constraint in Self-Organization.	RANDOM	1998	DBLP DOI BibTeX RDF
1	Claus-Peter Schnorr, C. R. Subramanian 0001	Almost Optimal (on the average) Combinatorial Algorithms for Boolean Matrix Product Witnesses, Computing the Diameter (Extended Abstract).	RANDOM	1998	DBLP DOI BibTeX RDF
1	Richard Cole 0001, 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	DBLP DOI BibTeX RDF
1	Charles Knessl, Wojciech Szpankowski	Quicksort Again Revisited.	RANDOM	1998	DBLP DOI BibTeX RDF
1	Bernd Gärtner	Combinatorial Linear Programming: Geometry Can Help.	RANDOM	1998	DBLP DOI BibTeX RDF
1	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	DBLP DOI BibTeX RDF
1	Leslie Ann Goldberg, Mark Jerrum	The "Burnside Process" Converges Slowly.	RANDOM	1998	DBLP DOI BibTeX RDF
1	Gunnar Andersson, Lars Engebretsen	Sampling Methods Applied to Dense Instances of Non-Boolean Optimization Problems.	RANDOM	1998	DBLP DOI BibTeX RDF
1	Alan M. Frieze	Disjoint Paths in Expander Graphs via Random Walks: A Short Survey.	RANDOM	1998	DBLP DOI BibTeX RDF
1	Oded Goldreich 0001, Shmuel Safra	A Combinatorial Consistency Lemma with Application to Proving the PCP Theorem.	RANDOM	1997	DBLP DOI BibTeX RDF
1	Michael E. Saks, Shiyu Zhou	Sample Spaces with Small Bias on Neighborhoods and Error-Correcting Communication Protocols.	RANDOM	1997	DBLP DOI BibTeX RDF
1	Andreas S. Schulz, Martin Skutella	Random-Based Scheduling: New Approximations and LP Lower Bounds.	RANDOM	1997	DBLP DOI BibTeX RDF
1	Russell Impagliazzo	Using Hard Problems to Derandomize Algorithms: An Incomplete Survey.	RANDOM	1997	DBLP DOI BibTeX RDF
1	Bernd Kreuter, Till Nierhoff	Greedily Approximating the r-independent Set and k-center Problems on Random Instances.	RANDOM	1997	DBLP DOI BibTeX RDF
1	Steven M. Kautz	Resource-Bounded Randomness and Compressibility with Respect to Nonuniform Measures.	RANDOM	1997	DBLP DOI BibTeX RDF
1	Yongge Wang	Randomness, Stochasticity and Approximations.	RANDOM	1997	DBLP DOI BibTeX RDF
1	Janis Kaneps, Dainis Geidmanis, Rusins Freivalds	Tally Languages Accepted by Monte Carlo Pushdown Automata.	RANDOM	1997	DBLP DOI BibTeX RDF
1	José D. P. Rolim (eds.)	Randomization and Approximation Techniques in Computer Science, International Workshop, RANDOM'97, Bolognna, Italy, July 11-12. 1997, Proceedings	RANDOM	1997	DBLP DOI BibTeX RDF
1	Dawei Hong, Jean-Camille Birget	Probabilistic Approximation of Some NP Optimization Problems by Finite-State Machines.	RANDOM	1997	DBLP DOI BibTeX RDF
1	Pierluigi Crescenzi, Viggo Kann	Approximation on the Web: A Compendium of NP Optimization Problems.	RANDOM	1997	DBLP DOI BibTeX RDF
1	Andris Ambainis, Rusins Freivalds, Marek Karpinski	Weak and Strong Recognition by 2-way Randomized Automata.	RANDOM	1997	DBLP DOI BibTeX RDF
1	Marek Karpinski	Polynominal Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems.	RANDOM	1997	DBLP DOI BibTeX RDF
1	Marcus Peinado, Thomas Lengauer	'Go with the winners' Generators with Applications to Molecular Modeling.	RANDOM	1997	DBLP DOI BibTeX RDF
1	Christos Levcopoulos, Joachim Gudmundsson	Approximation Algorithms for Covering Polygons with Squares and Similar Problems.	RANDOM	1997	DBLP DOI BibTeX RDF
1	Sanjeev Arora	Nearly Linear Time Approximation Schemes for Euclidean TSP and Other Geometric Problems.	RANDOM	1997	DBLP DOI BibTeX RDF
1	Steven Rudich	Super-bits, Demi-bits, and NP/qpoly-natural Proofs.	RANDOM	1997	DBLP DOI BibTeX RDF
1	Prasad Tetali, Santosh S. Vempala	Random Sampling of Euler Tours.	RANDOM	1997	DBLP DOI BibTeX RDF
1	Colin Cooper, Alan M. Frieze, Kurt Mehlhorn, Volker Priebe	Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model.	RANDOM	1997	DBLP DOI BibTeX RDF

Publications at "RANDOM"( http://dblp.L3S.de/Venues/RANDOM )