Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic Scholar27. STOC 1995: Las Vegas, NV, USA
Frank Thomson Leighton, Allan Borodin:
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, USA. ACM 1995, ISBN 0-89791-718-9- Samir Khuller, Balaji Raghavachari:
Improved approximation algorithms for uniform connectivity problems. 1-10 - David R. Karger:
A randomized fully polynomial time approximation scheme for the all terminal network reliability problem. 11-17 - David R. Karger, Serge A. Plotkin:
Adding multiple cost constraints to combinatorial optimization problems, with applications to multicommodity flows. 18-25 - Jon M. Kleinberg, Éva Tardos:
Approximations for the disjoint paths problem in high-diameter planar networks. 26-35 - Matthew K. Franklin, Moti Yung:
Secure hypergraphs: privacy from partial broadcast (Extended Abstract). 36-44 - Mihir Bellare, Oded Goldreich, Shafi Goldwasser:
Incremental cryptography and application to virus protection. 45-56 - Mihir Bellare, Phillip Rogaway:
Provably secure session key distribution: the three party case. 57-66 - Yuval Rabani, Yuri Rabinovich, Alistair Sinclair:
A computational view of population genetics. 83-92 - Peter Bro Miltersen, Noam Nisan, Shmuel Safra, Avi Wigderson:
On data structures and asymmetric communication complexity. 103-111 - Jeff Edmonds, Chung Keung Poon:
A nearly optimal time-space lower bound for directed st-connectivity on the NNJAG model. 147-156 - William E. Hart, Sorin Istrail:
Fast protein folding in the hydrophobic-hydrophilic model within three-eights of optimal (Extended Abstract). 157-168 - S. Rao Kosaraju, Arthur L. Delcher:
Large-scale assembly of DNA strings and space-efficient construction of suffix trees. 169-177 - Sridhar Hannenhalli, Pavel A. Pevzner:
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. 178-189 - Lisa Hellerstein, Krishnan Pillaipakkamnatt, Vijay Raghavan, Dawn Wilkins:
How many queries are needed to learn? 190-199 - Marek Karpinski, Angus Macintyre:
Polynomial bounds for VC dimension of sigmoidal neural networks. 200-208 - Jyrki Kivinen, Manfred K. Warmuth:
Additive versus exponentiated gradient updates for linear prediction. 209-218 - Nader H. Bshouty, Christino Tamon:
On the Fourier spectrum of monotone functions (Extended Abstract). 219-228 - Micah Adler, Soumen Chakrabarti, Michael Mitzenmacher, Lars Eilstrup Rasmussen:
Parallel randomized load balancing (Preliminary Version). 238-247 - Baruch Awerbuch, Yossi Azar, Avrim Blum, Santosh Vempala:
Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen. 277-283 - Sanjeev Arora, David R. Karger, Marek Karpinski:
Polynomial time approximation schemes for dense instances of NP-hard problems. 284-293 - Avrim Blum, Prasad Chalasani, Santosh Vempala:
A constant-factor approximation for the k-MST problem in the plane. 294-302 - Paul Beame, Stephen A. Cook, Jeff Edmonds, Russell Impagliazzo, Toniann Pitassi:
The relative complexity of NP search problems. 303-314 - Felipe Cucker, Marek Karpinski, Pascal Koiran, Thomas Lickteig, Kai Werther:
On real Turing machines that toss coins. 335-342 - Pankaj K. Agarwal, Prabhakar Raghavan, Hisao Tamaki:
Motion planning for a steering-constrained robot through moderate obstacles. 343-352 - Lydia E. Kavraki, Jean-Claude Latombe, Rajeev Motwani, Prabhakar Raghavan:
Randomized query processing in robot path planning (Extended Abstract). 353-362 - Rajeev Alur, Costas Courcoubetis, Mihalis Yannakakis:
Distinguishing tests for nondeterministic and probabilistic machines. 363-372 - Thomas A. Henzinger, Peter W. Kopke, Anuj Puri, Pravin Varaiya:
What's decidable about hybrid automata? 373-382 - Erich Kaltofen, Victor Shoup:
Subquadratic-time factoring of polynomials over finite fields. 398-406 - Arne Andersson, Johan Håstad, Ola Petersson:
A tight lower bound for searching a sorted array. 417-426 - Nabil Kahale, Frank Thomson Leighton, Yuan Ma, C. Greg Plaxton, Torsten Suel, Endre Szemerédi:
Lower bounds for sorting networks. 437-446 - Uriel Feige, Joe Kilian:
Impossibility results for recycling random bits in two-prover proof systems. 457-468 - William Aiello, Mihir Bellare, Ramarathnam Venkatesan:
Knowledge on the average-perfect, statistical and logarithmic. 469-478 - Sunil Arya, Gautam Das, David M. Mount, Jeffrey S. Salowe, Michiel H. M. Smid:
Euclidean spanners: short, thin, and lanky. 489-498 - Yefim Dinitz, Zeev Nutov:
A 2-level cactus model for the system of minimum and minimum+1 edge-cuts in a graph and its incremental maintenance. 509-518 - Monika Rauch Henzinger, Valerie King:
Randomized dynamic graph algorithms with polylogarithmic time per operation. 519-527 - Shlomi Dolev, Evangelos Kranakis, Danny Krizanc, David Peleg:
Bubbles: adaptive routing scheme for high-speed dynamic networks (Extended Abstract). 528-537 - Bhaskar Ghosh, Frank Thomson Leighton, Bruce M. Maggs, S. Muthukrishnan, C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa, Robert Endre Tarjan, David Zuckerman:
Tight analyses of two local load balancing algorithms. 548-558 - Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén:
Log-space polynomial end-to-end communication. 559-568 - Mikael Goldmann, Johan Håstad:
Monotone circuits for connectivity have depth (log n)2-o(1) (Extended Abstract). 569-574 - Maria Luisa Bonet, Toniann Pitassi, Ran Raz:
Lower bounds for cutting planes proofs with small coefficients. 575-584 - Robert Beals, Tetsuro Nishino, Keisuke Tanaka:
More on the complexity of negation-limited circuits. 585-595 - Amotz Bar-Noy, Ran Canetti, Shay Kutten, Yishay Mansour, Baruch Schieber:
Bandwidth allocation with preemption. 616-625 - Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos:
Computing faces in segment and simplex arrangements (Preliminary Version). 672-682 - Gary L. Miller, Dafna Talmor, Shang-Hua Teng, Noel Walkington:
A Delaunay based numerical method for three dimensions: generation, formulation, and partition. 683-692 - Paolo Ferragina, Roberto Grossi:
A fully-dynamic data structure for external substring search (Extended Abstract). 693-702 - Artur Czumaj, Zvi Galil, Leszek Gasieniec, Kunsoo Park, Wojciech Plandowski:
Work-time-optimal parallel algorithms for string problems. 713-722 - Noam Nisan, Avi Wigderson:
On the complexity of bilinear forms: dedicated to the memory of Jacques Morgenstern. 723-732 - Victor Y. Pan:
Optimal (up to polylog factors) sequential and parallel algorithms for approximating complex polynomial zeros. 741-750
maintained by 
at 
at 
last updated on 2018-10-17 19:53 CEST by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint