Conferences in DBLP
Shafi Goldwasser Efficient Interactive Proofs and Applications to Approximation. [Citation Graph (0, 0)][DBLP ] Conf ] Rafail Ostrovsky , Avi Wigderson One-Way Fuctions are Essential for Non-Trivial Zero-Knowledge. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Luby , Boban Velickovic , Avi Wigderson Deterministic Approximate Counting of Depth-2 Circuits. [Citation Graph (0, 0)][DBLP ] Conf ] Shiva Chaudhuri A Lower Bound for Linear Approximate Compaction. [Citation Graph (0, 0)][DBLP ] Conf ] Danny Dolev , Yuval Harari , Michal Parnas Finding the Neighborhood of a Query in a Dictionary. [Citation Graph (0, 0)][DBLP ] Conf ] Nimrod Megiddo , Moni Naor , David P. Anderson The Minimum Reservation Rate Problem in Digital Audio/Video Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Alon Efrat , Craig Gotsman Subpixel Image Registration Using Circular Fiducials. [Citation Graph (0, 0)][DBLP ] Conf ] Richard Cole , Ramesh Hariharan , Mike Paterson , Uri Zwick Which Patterns are Hard to Find? [Citation Graph (0, 0)][DBLP ] Conf ] David Peleg , Gideon Schechtman , Avishai Wool Approximating Bounded 0-1 Integer Linear Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Edith Cohen Using Selective Path-Doubling for Parallel Shortest-Path Computations. [Citation Graph (0, 0)][DBLP ] Conf ] Yefim Dinitz Maintaining the 4-Edge-Connected Components of a Graph On-Line. [Citation Graph (0, 0)][DBLP ] Conf ] Hava T. Siegelmann , Eduardo D. Sontag Analog Computation Via Neural Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Amir Ben-Dor , Shai Halevi Zero-One Permanent is #P -Complete, A Simpler Proof. [Citation Graph (0, 0)][DBLP ] Conf ] Liming Cai , Jianer Chen On Fixed-Parameter Tractability and Approximability of NP -Hard Optimization Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Adi Shamir Practical Cryptography - Recent Trends and Results. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Luby , Alistair Sinclair , David Zuckerman Optimal Speedup of Las Vegas Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Anne Condon , Diane Hernek Random Walks on Colored Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Nathan Linial , David Peleg , Yuri Rabinovich , Michael E. Saks Sphere Packing and Local Majorities in Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Shay Kutten , Rafail Ostrovsky , Boaz Patt-Shamir The Las-Vegas Processor Identity Problem (How and When to Be Unique). [Citation Graph (0, 0)][DBLP ] Conf ] Yehuda Afek , Danny Hendler On the Complexity of Global Computation in the Presence of Link Failures: The General Case. [Citation Graph (0, 0)][DBLP ] Conf ] Frank A. Stomp Structured Design of Self-Stabilizing Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Lengauer Algorithmic Research Problems in Molecular Bioinformatics. [Citation Graph (0, 0)][DBLP ] Conf ] Ronald I. Greenberg , Jau-Der Shih Feasible Offset an Optimal Offset for Single-Layer Channel Routing. [Citation Graph (0, 0)][DBLP ] Conf ] Ilan Newman , Assaf Schuster Hot-Potato Worm Routing is Almost as Easy as Store-and-Forward Packet Routing. [Citation Graph (0, 0)][DBLP ] Conf ] Alon Itai , Hadas Shachnai Adaptive Source Routing in High-Speed Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Kaisa Sere A Formalization of Superposition Refinement. [Citation Graph (0, 0)][DBLP ] Conf ] Joost N. Kok , Peter M. W. Knijnenburg Divergence Models for Atomized Statements and Parallel Choice. [Citation Graph (0, 0)][DBLP ] Conf ] Zurab Khasidashvili On the Equivalence of Persistent Term Rewriting Systems and Recursive Program Schemes. [Citation Graph (0, 0)][DBLP ] Conf ] Sanjeev Khanna , Nathan Linial , Shmuel Safra On the Hardness of Approximating the Chromatic Number. [Citation Graph (0, 0)][DBLP ] Conf ] Johan Håstad , Steven Phillips , Shmuel Safra A Well-Characterized Approximation Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Mihir Bellare Interactive Proofs and Approximation: Reduction from Two Provers in One Round. [Citation Graph (0, 0)][DBLP ] Conf ] Erez Petrank The Hardness of Approximation: Gap Location. [Citation Graph (0, 0)][DBLP ] Conf ] Juan A. Garay , Inder S. Gopal , Shay Kutten , Yishay Mansour , Moti Yung Efficient On-Line Call Control Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Amos Fiat , Moty Ricklin Competitive Algorithms for the Weighted Server Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Ran El-Yaniv , Richard M. Karp The Mortgage Problem. [Citation Graph (0, 0)][DBLP ] Conf ] 