share record
persistent URL:
Matteo Frigo , Charles E. Leiserson , Harald Prokop , Sridhar Ramachandran : Cache-Oblivious Algorithms. FOCS 1999 : 285-298 share record
persistent URL:
Ashish Goel , Piotr Indyk : Stochastic Load Balancing and Related Problems. FOCS 1999 : 579-586 share record
persistent URL:
Deborah Goldman , Sorin Istrail , Christos H. Papadimitriou : Algorithmic Aspects of Protein Structure Similarity. FOCS 1999 : 512-522 share record
persistent URL:
Anupam Gupta , Ilan Newman , Yuri Rabinovich , Alistair Sinclair : Cuts, Trees and l1 -Embeddings of Graphs. FOCS 1999 : 399-409 share record
persistent URL:
Sariel Har-Peled : Taking a Walk in a Planar Arrangement. FOCS 1999 : 100-111 export record
dblp key:
conf/focs/ImpagliazzoSW99 share record
persistent URL:
Russell Impagliazzo , Ronen Shaltiel , Avi Wigderson : Near-Optimal Conversion of Hardness into Pseudo-Randomness. FOCS 1999 : 181-190 share record
persistent URL:
Piotr Indyk : A Sublinear Time Approximation Scheme for Clustering in Metric Spaces. FOCS 1999 : 154-159 share record
persistent URL:
Kamal Jain , Vijay V. Vazirani : Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems. FOCS 1999 : 2-13 share record
persistent URL:
Naoki Katoh , Takeshi Tokuyama : Lovász's Lemma for the Three-Dimensional K-Level of Concave Surfaces and its Applications. FOCS 1999 : 389-398 share record
persistent URL:
Jeong Han Kim , Daniel R. Simon , Prasad Tetali : Limits on the Efficiency of One-Way Permutation-Based Hash Functions. FOCS 1999 : 535-542 share record
persistent URL:
Valerie King : Fully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure in Digraphs. FOCS 1999 : 81-91 share record
persistent URL:
Jon M. Kleinberg , Yuval Rabani , Éva Tardos : Fairness in Routing and Load Balancing. FOCS 1999 : 568-578 share record
persistent URL:
Jon M. Kleinberg , Éva Tardos : Approximation Algorithms for Classification Problems with Pairwise Relationships: Metric Labeling and Markov Random Fields. FOCS 1999 : 14-23 share record
persistent URL:
Adam R. Klivans , Rocco A. Servedio : Boosting and Hard-Core Sets. FOCS 1999 : 624-633 share record
persistent URL:
Roman M. Kolpakov , Gregory Kucherov : Finding Maximal Repetitions in a Word in Linear Time. FOCS 1999 : 596-604 share record
persistent URL:
Elias Koutsoupias : Weak Adversaries for the k-Server Problem. FOCS 1999 : 444-449 share record
persistent URL:
V. S. Anil Kumar , H. Ramesh : Markovian Coupling vs. Conductance for the Jerrum-Sinclair Chain. FOCS 1999 : 241-252 share record
persistent URL:
Richard J. Lipton , Anastasios Viglas : On the Complexity of SAT. FOCS 1999 : 459-464 share record
persistent URL:
Malwina J. Luczak , Eli Upfal : Reducing Network Congestion and Blocking Probability Through Balanced Allocation. FOCS 1999 : 587-595 share record
persistent URL:
Silvio Micali , Michael O. Rabin , Salil P. Vadhan : Verifiable Random Functions. FOCS 1999 : 120-130 share record
persistent URL:
Peter Bro Miltersen , N. V. Vinodchandran : Derandomizing Arthur-Merlin Games Using Hitting Sets. FOCS 1999 : 71-80 share record
persistent URL:
Ben Morris , Alistair Sinclair : Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions. FOCS 1999 : 230-240 export record
dblp key:
conf/focs/MuthukrishnanRSG99 share record
persistent URL:
S. Muthukrishnan , Rajmohan Rajaraman , Anthony Shaheen , Johannes Gehrke : Online Scheduling to Minimize Average Stretch. FOCS 1999 : 433-442 share record
persistent URL:
Ashwin Nayak : Optimal Lower Bounds for Quantum Automata and Random Access Codes. FOCS 1999 : 369-377 share record
persistent URL:
David Peleg , Vitaly Rubinovich : A Near-Tight Lower Bound on the Time Complexity of Distributed MST Construction. FOCS 1999 : 253-261 share record
persistent URL:
Wojciech Plandowski : Satisfiability of Word Equations with Constants is in PSPACE. FOCS 1999 : 495-500 share record
persistent URL:
Ran Raz , Omer Reingold , Salil P. Vadhan : Error Reduction for Extractors. FOCS 1999 : 191-201 share record
persistent URL:
Amit Sahai : Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security. FOCS 1999 : 543-553 share record
persistent URL:
Tomas Sander , Adam L. Young , Moti Yung : Non-Interactive CryptoComputing For NC1 . FOCS 1999 : 554-567 share record
persistent URL:
Uwe Schöning : A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems. FOCS 1999 : 410-414