Conferences in DBLP
Uriel Feige , Shafi Goldwasser , László Lovász , Shmuel Safra , Mario Szegedy Approximating Clique is Almost NP-Complete (Preliminary Version) [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:2-12 [Conf ] Dror Lapidot , Adi Shamir Fully Parallelized Multi Prover Protocols for NEXP-Time (Extended Abstract) [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:13-18 [Conf ] Richard Beigel , Mihir Bellare , Joan Feigenbaum , Shafi Goldwasser Languages that Are Easier than their Proofs [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:19-28 [Conf ] Bernard Chazelle An Optimal Convex Hull Algorithm and New Results on Cuttings (Extended Abstract) [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:29-38 [Conf ] Frank Hoffmann , Michael Kaufmann , Klaus Kriegel The Art Gallery Theorem for Polygons With Holes [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:39-48 [Conf ] Jirí Matousek , Nathaly Miller , János Pach , Micha Sharir , Shmuel Sifrony , Emo Welzl Fat Triangles Determine Linearly Many Holes [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:49-58 [Conf ] Oded Goldreich , Erez Petrank Quantifying Knowledge Complexity [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:59-68 [Conf ] Joan Boyar , Gilles Brassard , René Peralta Subquadratic Zero-Knowledge [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:69-78 [Conf ] David Zuckerman Simulating BPP Using a General Weak Random Source [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:79-89 [Conf ] Manuel Blum , William S. Evans , Peter Gemmell , Sampath Kannan , Moni Naor Checking the Correctness of Memories [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:90-99 [Conf ] Sanjoy K. Baruah , Gilad Koren , Bhubaneswar Mishra , Arvind Raghunathan , Louis E. Rosier , Dennis Shasha On-line Scheduling in the Presence of Overload [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:100-110 [Conf ] Anja Feldmann , Jiri Sgall , Shang-Hua Teng Dynamic Scheduling on Parallel Machines [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:111-120 [Conf ] Jeffrey Scott Vitter , P. Krishnan Optimal Prefetching via Data Compression (Extended Abstract) [Citation Graph (1, 0)][DBLP ] FOCS, 1991, pp:121-130 [Conf ] David B. Shmoys , Joel Wein , David P. Williamson Scheduling Parallel Machines On-Line [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:131-140 [Conf ] Manfred Kunde Concentrated Regular Data Streams on Grids: Sorting and Routing Near to the Bisection Bound [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:141-150 [Conf ] I-Chen Wu , H. T. Kung Communication Complexity for Parallel Divide-and-Conquer [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:151-162 [Conf ] Christos H. Papadimitriou On Selecting a Satisfying Truth Assignment (Extended Abstract) [Citation Graph (1, 0)][DBLP ] FOCS, 1991, pp:163-169 [Conf ] Howard Aizenstein , Leonard Pitt Exact Learning of Read-Twice DNF Formulas (Extended Abstract) [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:170-179 [Conf ] Ketan Mulmuley Randomized Multidimensional Search Trees: Lazy Balancing and Dynamic Shuffling (Extended Abstract) [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:180-196 [Conf ] Otfried Schwarzkopf Dynamic Maintenance of Geometric Structures Made Easy [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:197-206 [Conf ] Jirí Matousek Reporting Points in Halfspaces [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:207-215 [Conf ] Ketan Mulmuley Randomized Multidimensional Search Trees: Further Results in Dynamic Sampling (Extended Abstract) [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:216-227 [Conf ] Alon Orlitsky Interactive Communication: Balanced Distributions, Correlated Files, and Average-Case Complexity [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:228-238 [Conf ] Tomás Feder , Eyal Kushilevitz , Moni Naor Amortized Communication Complexity (Preliminary Version) [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:239-248 [Conf ] Jeff Edmonds , Steven Rudich , Russell Impagliazzo , Jiri Sgall Communication Complexity Towards Lower Bounds on Circuit Depth [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:249-257 [Conf ] Baruch Awerbuch , George Varghese Distributed Program Checking: a Paradigm for Building Self-stabilizing Distributed Protocols (Extended Abstract) [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:258-267 [Conf ] Baruch Awerbuch , Boaz Patt-Shamir , George Varghese Self-Stabilization By Local Checking and Correction (Extended Abstract) [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:268-277 [Conf ] Weiguo Wang An Asynchronous Two-Dimensional Self-Correcting Cellular Automaton [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:278-285 [Conf ] Amos Fiat , Dean P. Foster , Howard J. Karloff , Yuval Rabani , Yiftach Ravid , Sundar Vishwanathan Competitive Algorithms for Layered Graph Traversal [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:288-297 [Conf ] Xiaotie Deng , Tiko Kameda , Christos H. Papadimitriou How to Learn an Unknown Environment (Extended Abstract) [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:298-303 [Conf ] Rolf Klein Walking an Unknown Street with Bounded Detour [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:304-313 [Conf ] Jaikumar Radhakrishnan Better Bounds for Threshold Formulas [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:314-323 [Conf ] Mike Paterson , Uri Zwick Shrinkage of de~Morgan formulae under restriction [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:324-333 [Conf ] Nader H. Bshouty , Richard Cleve , Wayne Eberly Size-Depth Tradeoffs for Algebraic Formulae [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:334-341 [Conf ] Bruce M. Kapron , Stephen A. Cook A New Characterization of Mehlhorn's Polynomial Time Functionals (Extended Abstract) [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:342-347 [Conf ] Rakesh M. Verma A Theory of Using History for Equational Systems with Applications (Extended Abstract) [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:348-357 [Conf ] Nils Klarlund Progress Measures for Complementation of omega-Automata with Applications to Temporal Logic [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:358-367 [Conf ] E. Allen Emerson , Charanjit S. Jutla Tree Automata, Mu-Calculus and Determinacy (Extended Abstract) [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:368-377 [Conf ] Victor Shoup , Roman Smolensky Lower Bounds for Polynomial Evaluation and Interpolation Problems [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:378-383 [Conf ] Joachim von zur Gathen Efficient Exponentiation in Finite Fields (Extended Abstract) [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:384-391 [Conf ] Moshe Morgenstern Explicit Construction of Natural Bounded Concentrators [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:392-397 [Conf ] Nabil Kahale Better Expansion for Ramanujan Graphs [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:398-404 [Conf ] Ioannis Z. Emiris , John F. Canny A General Approach to Removing Degeneracies [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:405-413 [Conf ] Herbert Edelsbrunner , Tiow Seng Tan A Quadratic Time Algorithm for The MinMax Length Triangulation (Extended Abstract) [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:414-423 [Conf ] Jirí Matousek , Emo Welzl , Lorenz Wernisch Discrepancy and epsilon-approximations for bounded VC-dimension [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:424-430 [Conf ] Ding-Zhu Du , Yanjun Zhang , Qing Feng On Better Heuristic for Euclidean Steiner Minimum Trees (Extended Abstract) [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:431-439 [Conf ] Yonatan Aumann , Michael Ben-Or Asymptotically Optimal PRAM Emulation on Faulty Hypercubes (Extended Abstract) [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:440-446 [Conf ] Oded Goldreich , Shafi Goldwasser , Nathan Linial Fault-tolerant Computation in the Full Information Model (Extended Abstract) [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:447-457 [Conf ] Frank Thomson Leighton , Yuan Ma , C. Greg Plaxton Highly Fault-Tolerant Sorting Circuits [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:458-469 [Conf ] Frank Thomson Leighton , Eric J. Schwabe Efficient Algorithms for Dynamic Allocation of Distributed Memory [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:470-479 [Conf ] Ilan Adler , Peter A. Beling Polynomial Algorithms for LP over a Subring of the Algebraic Integers with Applications to LP with Circulant Matrices [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:480-487 [Conf ] David Eppstein Dynamic Three-Dimensional Linear Programming [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:488-494 [Conf ] Serge A. Plotkin , David B. Shmoys , Éva Tardos Fast Approximation Algorithms for Fractional Packing and Covering Problems [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:495-504 [Conf ] Baruch Awerbuch , Leonard J. Schulman The Maintenance of Common Data in a Distributed System [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:505-514 [Conf ] Moni Naor , Ron M. Roth Optimal File Sharing in Distributed Networks (Preliminary Version) [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:515-525 [Conf ] Maurice Herlihy , Nir Shavit , Orli Waarts Low Contention Linearizable Counting [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:526-535 [Conf ] Gary L. Miller , Shang-Hua Teng , Stephen A. Vavasis A Unified Geometric Approach to Graph Separators [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:538-547 [Conf ] Tsan-sheng Hsu , Vijaya Ramachandran A Linear Time Algorithm for Triconnectivity Augmentation (Extended Abstract) [Citation Graph (1, 0)][DBLP ] FOCS, 1991, pp:548-559 [Conf ] David R. Karger , Daphne Koller , Steven J. Phillips Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:560-568 [Conf ] Noga Alon , Zvi Galil , Oded Margalit On the Exponent of the All Pairs Shortest Path Problem [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:569-575 [Conf ] László Lovász , Moni Naor , Ilan Newman , Avi Wigderson Search Problems in the Decision Tree Model (Preliminary Version) [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:576-585 [Conf ] Noga Alon A parallel algorithmic version of the Local Lemma [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:586-593 [Conf ] Anna Gál Lower Bounds for the Complexity of Reliable Boolean Circuits with Noisy Gates [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:594-601 [Conf ] Rüdiger Reischuk , Bernd Schmeltz Reliable Computation with Noisy Circuits and Decision Trees-A General n log n Lower Bound [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:602-611 [Conf ] Rajamani Sundar A Lower Bound for the Dictionary Problem under a Hashing Model [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:612-621 [Conf ] Amir M. Ben-Amram , Zvi Galil Lower Bounds for Data Structure Problems on RAMs (Extended Abstract) [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:622-631 [Conf ] Greg N. Frederickson Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees [Citation Graph (1, 0)][DBLP ] FOCS, 1991, pp:632-641 [Conf ] Arne Andersson , Thomas Ottmann Faster Uniquely Represented Dictionaries [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:642-649 [Conf ] Bruce Randall Donald , Davied Renpan Chang On the Complexity of Computing the Homology Type of a Triangulation [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:650-661 [Conf ] Dima Grigoriev , Marek Karpinski An Approximation Algorithm for the Number of Zeros of Arbitrary Polynomials over GF[q] [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:662-669 [Conf ] Johannes Blömer Computing Sums of Radicals in Polynomial Time [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:670-677 [Conf ] Ming-Deh A. Huang , Doug Ierardi Efficient Algorithms for the Riemann-Roch Problem and for Addition in the Jacobian of a Curve (Extended Abstract) [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:678-687 [Conf ] Donald B. Johnson , Panagiotis Takis Metaxas Connected Components in O(\lg^3/2 |V|) Parallel Time for the CREW PRAM [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:688-697 [Conf ] Joseph Gil , Yossi Matias , Uzi Vishkin Towards a Theory of Nearly Constant Time Parallel Algorithms [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:698-710 [Conf ] Michael T. Goodrich Using Approximation Algorithms to Design Parallel Algorithms that May Ignore Processor Allocation (Preliminary Version) [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:711-722 [Conf ] Hillel Gazit A Deterministic Parallel Algorithm for Planar Graphs Isomorphism [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:723-732 [Conf ] László Babai , Katalin Friedl Approximate Representation Theory of Finite Groups [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:733-742 [Conf ] Huzur Saran , Vijay V. Vazirani Finding k-cuts within Twice the Optimal [Citation Graph (1, 0)][DBLP ] FOCS, 1991, pp:743-751 [Conf ] Peter W. Shor How to Pack Better than Best Fit: Tight Bounds for Average-Case On-Line Bin Packing [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:752-759 [Conf ] Amihood Amir , Martin Farach Adaptive Dictionary Matching [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:760-766 [Conf ] Wolfgang Maass , Georg Schnitger , Eduardo D. Sontag On the Computational Power of Sigmoid versus Boolean Threshold Circuits [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:767-776 [Conf ] Matthias Krause , Stephan Waack Variation Ranks of Communication Matrices and Lower Bounds for Depth Two Circuits Having Symmetric Gates with Unbounded Fan-In [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:777-782 [Conf ] Richard Beigel , Jun Tarui On ACC [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:783-792 [Conf ] Arkady Kanevsky , Roberto Tamassia , Giuseppe Di Battista , Jianer Chen On-Line Maintenance of the Four-Connected Components of a Graph (Extended Abstract) [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:793-801 [Conf ] Arvind Gupta , Russell Impagliazzo Computing Planar Intertwines [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:802-811 [Conf ] Harold N. Gabow Applications of a Poset Representation to Edge Connectivity and Graph Rigidity [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:812-821 [Conf ]