Conferences in DBLP
Alan M. Frieze Disjoint Paths in Expander Graphs via Random Walks: A Short Survey. [Citation Graph (0, 0)][DBLP ] Conf ] Andrei Z. Broder , Moses Charikar , Michael Mitzenmacher A Derandomization Using Min-Wise Independent Permutations. [Citation Graph (0, 0)][DBLP ] Conf ] Vojtech Rödl , Andrzej Rucinski , Michelle Wagner An Algorithmic Embedding of Graphs via Perfect Matchings. [Citation Graph (0, 0)][DBLP ] Conf ] Chi-Jen Lu Deterministic Hypergraph Coloring and Its Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Roy Armoni On the Derandomization of Space-Bounded Computations. [Citation Graph (0, 0)][DBLP ] Conf ] Devdatt P. Dubhashi Talagrand's Inequality and Locality in Distributed Computing. [Citation Graph (0, 0)][DBLP ] Conf ] Yossi Azar , Oded Regev On-Line Bin-Stretching. [Citation Graph (0, 0)][DBLP ] Conf ] Bernd Gärtner Combinatorial Linear Programming: Geometry Can Help. [Citation Graph (0, 0)][DBLP ] Conf ] Abraham Sharell A Note on Bounding the Mixing Time by Linear Programming. [Citation Graph (0, 0)][DBLP ] Conf ] Israel A. Wagner , Michael Lindenbaum , Alfred M. Bruckstein Robotic Exploration, Brownian Motion and Electrical Resistance. [Citation Graph (0, 0)][DBLP ] Conf ] Ricardo A. Baeza-Yates , Joaquim Gabarró , Xavier Messeguer Fringe Analysis of Synchronized Parallel Algorithms on 2-3 Trees. [Citation Graph (0, 0)][DBLP ] Conf ] 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. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Raab , Angelika Steger "Balls into Bins" - A Simple and Tight Analysis. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Luby Tornado Codes: Practical Erasure Codes Based on Random Irregular Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Mike Burmester , Yvo Desmedt , Yongge Wang Using Approximation Hardness to Achieve Dependable Computation. [Citation Graph (0, 0)][DBLP ] Conf ] Mireille Régnier , Wojciech Szpankowski Complexity of Sequential Pattern Matching Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Yael Gertner , Shafi Goldwasser , Tal Malkin A Random Server Model for Private Information Retrieval or How to Achieve Information Theoretic PIR Avoiding Database Replication. [Citation Graph (0, 0)][DBLP ] Conf ] Claus-Peter Schnorr , C. R. Subramanian Almost Optimal (on the average) Combinatorial Algorithms for Boolean Matrix Product Witnesses, Computing the Diameter (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Stefano Leonardi , Andrea Vitaletti Randomized Lower Bounds for Online Path Coloring. [Citation Graph (0, 0)][DBLP ] Conf ] Vicente Cerverón , Ariadna Fuertes Parallel Random Search and Tabu Search for the Minimal Consistent Subset Selection Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Kathleen Steinhöfel , Andreas Alexander Albrecht , C. K. Wong On Various Cooling Schedules for Simulated Annealing Applied to the Job Shop Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Pere Guitart , Josep M. Basart A High Performance Approximate Algorithm for the Steiner Problem in Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Josep Díaz , Jordi Petit , Maria J. Serna Random Geometric Problems on [0, 1]². [Citation Graph (0, 0)][DBLP ] Conf ] Carlos Domingo , Osamu Watanabe , Tadashi Yamazaki A Role of Constraint in Self-Organization. [Citation Graph (0, 0)][DBLP ] Conf ] Don Coppersmith , Gregory B. Sorkin Constructive Bounds and Exact Expectations for the Random Assignment Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Leslie Ann Goldberg , Mark Jerrum The "Burnside Process" Converges Slowly. [Citation Graph (0, 0)][DBLP ] Conf ] Charles Knessl , Wojciech Szpankowski Quicksort Again Revisited. [Citation Graph (0, 0)][DBLP ] Conf ] Gunnar Andersson , Lars Engebretsen Sampling Methods Applied to Dense Instances of Non-Boolean Optimization Problems. [Citation Graph (0, 0)][DBLP ] Conf ] S. Muthukrishnan , Torsten Suel Second-Order Methods for Distributed Approximate Single- and Multicommodity Flow. [Citation Graph (0, 0)][DBLP ] Conf ] 