Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic Scholar27th FOCS 1986: Toronto, Canada
27th Annual Symposium on Foundations of Computer Science, Toronto, Canada, 27-29 October 1986. IEEE Computer Society 1986, ISBN 0-8186-0740-8- Prabhakar Raghavan:
Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs. 10-18 - Richard M. Karp, Michael E. Saks, Avi Wigderson:
On a Search Problem Related to Branch-and-Bound Procedures. 19-28 - Michael E. Saks, Avi Wigderson:
Probabilistic Boolean Decision Trees and the Complexity of Evaluating Game Trees. 29-38 - Nathan Linial, László Lovász, Avi Wigderson:
A Physical Interpretation of Graph Connectivity, and Its Algorithmic Applications. 39-48 - Volker Strassen:
The Asymptotic Spectrum of Tensors and the Exponent of Matrix Multiplication. 49-54 - Robert E. Wilber:
Lower Bounds for Accessing Binary Search Trees With Rotations (Preliminary Version). 61-70 - David Mutchler:
What search algorithm gives optimal average-case performance when search resources are highly limited? 71-76 - Micha Sharir, Richard Cole, Klara Kedem, Daniel Leven, Richard Pollack, Shmuel Sifrony:
Geometric Applications of Davenport-Schinzel Sequences. 77-86 - Bernard Chazelle:
Lower Bounds on the Complexity of Multidimensional Searching (Extended Abstract). 87-96 - Gilles Brassard, Claude Crépeau, Jean-Marc Robert:
Information Theoretic Reductions among Disclosure Problems. 168-173 - Oded Goldreich, Silvio Micali, Avi Wigderson:
Proofs that Yield Nothing But their Validity and a Methodology of Cryptographic Protocol Design (Extended Abstract). 174-187 - Gilles Brassard, Claude Crépeau:
Non-Transitive Transfer of Confidence: A Perfect Zero-Knowledge Interactive Protocol for SAT and Beyond. 188-195 - Yoram Moses, Mark R. Tuttle:
Programming Simultaneous Actions Using Common Knowledge: Preliminary Version. 208-221 - Cynthia Dwork, David B. Shmoys, Larry J. Stockmeyer:
Flipping Persuasively in Constant Expected Time (Preliminary Version). 222-232 - Paul M. B. Vitányi, Baruch Awerbuch:
Atomic Shared Register Access by Asynchronous Hardware (Detailed Abstract). 233-243 - Anna R. Karlin, Mark S. Manasse, Larry Rudolph, Daniel Dominic Sleator:
Competitive Snoopy Caching. 244-254 - Yiming Ma, Sandeep Sen, Isaac D. Scherson:
The Distance Bound for Sorting on Mesh-Connected Processor Arrays Is Tight (Preliminary Report). 255-263 - Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg:
Optimal Simulations of Tree Machines (Preliminary Version). 274-282 - László Babai:
A Las Vegas-NC Algorithm for isomorphism of graphs with bounded multiplicity of eigenvalues. 303-312 - László Babai, Peter Frankl, Janos Simon:
Complexity classes in communication complexity theory (preliminary version). 337-347 - H. Venkateswaran, Martin Tompa:
A New Pebble Game that Characterizes Parallel Complexity Classes. 348-360 - Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer:
Collapsing Degrees (Extended Abstract). 380-389 - Judy Goldsmith, Deborah Joseph:
Three Results on the Polynomial Isomorphism of Complete Sets. 390-397 - Karl R. Abrahamson:
Time-Space Tradeoffs for Branching Programs Contrasted with those for Straight-Line Programs. 402-409 - Greg N. Frederickson, Ravi Janardan:
Separator-Based Strategies for Efficient Message Routing (Preliminary Version). 428-437 - Richard Cole, Uzi Vishkin:
Approximate and Exact Parallel Scheduling with Applications to List, Tree and Graph Problems. 478-491 - Hillel Gazit:
An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph. 492-501 - Noga Alon, Yossi Azar, Uzi Vishkin:
Tight Complexity Bounds for Parallel Comparison Sorting. 502-510
maintained by 
at 
at 
last updated on 2018-11-19 22:57 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint