Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/conf/stoc/stoc1995.bht:"
@inproceedings{DBLP:conf/stoc/AdlerCMR95, author = {Micah Adler and Soumen Chakrabarti and Michael Mitzenmacher and Lars Eilstrup Rasmussen}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Parallel randomized load balancing (Preliminary Version)}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {238--247}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225131}, doi = {10.1145/225058.225131}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/AdlerCMR95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AfekDT95, author = {Yehuda Afek and Dalia Dauber and Dan Touitou}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Wait-free made fast (Extended Abstract)}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {538--547}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225271}, doi = {10.1145/225058.225271}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/AfekDT95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AgarwalRT95, author = {Pankaj K. Agarwal and Prabhakar Raghavan and Hisao Tamaki}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Motion planning for a steering-constrained robot through moderate obstacles}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {343--352}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225158}, doi = {10.1145/225058.225158}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/AgarwalRT95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AielloBV95, author = {William Aiello and Mihir Bellare and Ramarathnam Venkatesan}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Knowledge on the average-perfect, statistical and logarithmic}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {469--478}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225186}, doi = {10.1145/225058.225186}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/AielloBV95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AlurCY95, author = {Rajeev Alur and Costas Courcoubetis and Mihalis Yannakakis}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Distinguishing tests for nondeterministic and probabilistic machines}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {363--372}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225161}, doi = {10.1145/225058.225161}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/AlurCY95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AmatoGR95, author = {Nancy M. Amato and Michael T. Goodrich and Edgar A. Ramos}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Computing faces in segment and simplex arrangements (Preliminary Version)}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {672--682}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225285}, doi = {10.1145/225058.225285}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/AmatoGR95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AnderssonHNR95, author = {Arne Andersson and Torben Hagerup and Stefan Nilsson and Rajeev Raman}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Sorting in linear time?}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {427--436}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225173}, doi = {10.1145/225058.225173}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/AnderssonHNR95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AnderssonHP95, author = {Arne Andersson and Johan H{\aa}stad and Ola Petersson}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {A tight lower bound for searching a sorted array}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {417--426}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225171}, doi = {10.1145/225058.225171}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/AnderssonHP95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AroraKK95, author = {Sanjeev Arora and David R. Karger and Marek Karpinski}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Polynomial time approximation schemes for dense instances of \emph{NP}-hard problems}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {284--293}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225140}, doi = {10.1145/225058.225140}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/AroraKK95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AryaDMSS95, author = {Sunil Arya and Gautam Das and David M. Mount and Jeffrey S. Salowe and Michiel H. M. Smid}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Euclidean spanners: short, thin, and lanky}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {489--498}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225191}, doi = {10.1145/225058.225191}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/AryaDMSS95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AwerbuchABV95, author = {Baruch Awerbuch and Yossi Azar and Avrim Blum and Santosh S. Vempala}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Improved approximation guarantees for minimum-weight \emph{k}-trees and prize-collecting salesmen}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {277--283}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225139}, doi = {10.1145/225058.225139}, timestamp = {Thu, 24 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/AwerbuchABV95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Bar-NoyCKMS95, author = {Amotz Bar{-}Noy and Ran Canetti and Shay Kutten and Yishay Mansour and Baruch Schieber}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Bandwidth allocation with preemption}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {616--625}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225279}, doi = {10.1145/225058.225279}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Bar-NoyCKMS95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BealsNT95, author = {Robert Beals and Tetsuro Nishino and Keisuke Tanaka}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {More on the complexity of negation-limited circuits}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {585--595}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225276}, doi = {10.1145/225058.225276}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/BealsNT95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BeameCEIP95, author = {Paul Beame and Stephen A. Cook and Jeff Edmonds and Russell Impagliazzo and Toniann Pitassi}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {The relative complexity of {NP} search problems}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {303--314}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225147}, doi = {10.1145/225058.225147}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/BeameCEIP95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BellareGG95, author = {Mihir Bellare and Oded Goldreich and Shafi Goldwasser}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Incremental cryptography and application to virus protection}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {45--56}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225080}, doi = {10.1145/225058.225080}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/BellareGG95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BellareR95, author = {Mihir Bellare and Phillip Rogaway}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Provably secure session key distribution: the three party case}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {57--66}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225084}, doi = {10.1145/225058.225084}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/BellareR95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BlumCV95, author = {Avrim Blum and Prasad Chalasani and Santosh S. Vempala}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {A constant-factor approximation for the \emph{k}-MST problem in the plane}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {294--302}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225143}, doi = {10.1145/225058.225143}, timestamp = {Thu, 24 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/BlumCV95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BonetPR95, author = {Maria Luisa Bonet and Toniann Pitassi and Ran Raz}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Lower bounds for cutting planes proofs with small coefficients}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {575--584}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225275}, doi = {10.1145/225058.225275}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/BonetPR95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BorchersD95, author = {Al Borchers and Ding{-}Zhu Du}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {The k-Steiner ratio in graphs}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {641--649}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225282}, doi = {10.1145/225058.225282}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/BorchersD95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BshoutyT95, author = {Nader H. Bshouty and Christino Tamon}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {On the Fourier spectrum of monotone functions (Extended Abstract)}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {219--228}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225125}, doi = {10.1145/225058.225125}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/BshoutyT95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/CanettiI95, author = {Ran Canetti and Sandy Irani}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Bounding the power of preemption in randomized scheduling}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {606--615}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225278}, doi = {10.1145/225058.225278}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/CanettiI95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Chazelle95, author = {Bernard Chazelle}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Lower bounds for off-line range searching}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {733--740}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225291}, doi = {10.1145/225058.225291}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Chazelle95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/CuckerKKLW95, author = {Felipe Cucker and Marek Karpinski and Pascal Koiran and Thomas Lickteig and Kai Werther}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {On real Turing machines that toss coins}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {335--342}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225155}, doi = {10.1145/225058.225155}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/CuckerKKLW95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/CzumajGGPP95, author = {Artur Czumaj and Zvi Galil and Leszek Gasieniec and Kunsoo Park and Wojciech Plandowski}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Work-time-optimal parallel algorithms for string problems}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {713--722}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225289}, doi = {10.1145/225058.225289}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/CzumajGGPP95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/DiaconisS95, author = {Persi Diaconis and Laurent Saloff{-}Coste}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {What do we know about the Metropolis algorithm?}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {112--129}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225095}, doi = {10.1145/225058.225095}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/DiaconisS95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/DinitzN95, author = {Yefim Dinitz and Zeev Nutov}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {A 2-level cactus model for the system of minimum and minimum+1 edge-cuts in a graph and its incremental maintenance}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {509--518}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225268}, doi = {10.1145/225058.225268}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/DinitzN95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/DolevKKP95, author = {Shlomi Dolev and Evangelos Kranakis and Danny Krizanc and David Peleg}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Bubbles: adaptive routing scheme for high-speed dynamic networks (Extended Abstract)}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {528--537}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225270}, doi = {10.1145/225058.225270}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/DolevKKP95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/EdmondsP95, author = {Jeff Edmonds and Chung Keung Poon}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {A nearly optimal time-space lower bound for directed \emph{st}-connectivity on the {NNJAG} model}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {147--156}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225103}, doi = {10.1145/225058.225103}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/EdmondsP95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Eppstein95, author = {David Eppstein}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Geometric lower bounds for parametric matroid optimization}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {662--671}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225284}, doi = {10.1145/225058.225284}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Eppstein95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Ergun95, author = {Funda Erg{\"{u}}n}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Testing multivariate linear functions: overcoming the generator bottleneck}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {407--416}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225167}, doi = {10.1145/225058.225167}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Ergun95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/FarachT95, author = {Martin Farach and Mikkel Thorup}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {String matching in Lempel-Ziv compressed strings}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {703--712}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225288}, doi = {10.1145/225058.225288}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/FarachT95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Feige95, author = {Uriel Feige}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Randomized graph products, chromatic numbers, and Lovasz theta-function}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {635--640}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225281}, doi = {10.1145/225058.225281}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Feige95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/FeigeK95, author = {Uriel Feige and Joe Kilian}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Impossibility results for recycling random bits in two-prover proof systems}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {457--468}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225183}, doi = {10.1145/225058.225183}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/FeigeK95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/FerraginaG95, author = {Paolo Ferragina and Roberto Grossi}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {A fully-dynamic data structure for external substring search (Extended Abstract)}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {693--702}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225287}, doi = {10.1145/225058.225287}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/FerraginaG95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/FiatK95, author = {Amos Fiat and Anna R. Karlin}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Randomized and multipointer paging with locality of reference}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {626--634}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225280}, doi = {10.1145/225058.225280}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/FiatK95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/FranklinY95, author = {Matthew K. Franklin and Moti Yung}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Secure hypergraphs: privacy from partial broadcast (Extended Abstract)}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {36--44}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225077}, doi = {10.1145/225058.225077}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/FranklinY95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/GalilY95, author = {Zvi Galil and Xiangdong Yu}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Short length versions of Menger's theorem (Extended Abstract)}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {499--508}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225267}, doi = {10.1145/225058.225267}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/GalilY95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/GhoshLMMPRRTZ95, author = {Bhaskar Ghosh and Frank Thomson Leighton and Bruce M. Maggs and S. Muthukrishnan and C. Greg Plaxton and Rajmohan Rajaraman and Andr{\'{e}}a W. Richa and Robert Endre Tarjan and David Zuckerman}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Tight analyses of two local load balancing algorithms}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {548--558}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225272}, doi = {10.1145/225058.225272}, timestamp = {Mon, 10 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/GhoshLMMPRRTZ95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/GoldmannH95, author = {Mikael Goldmann and Johan H{\aa}stad}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Monotone circuits for connectivity have depth (log n)\({}^{\mbox{2-o(1)}}\) (Extended Abstract)}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {569--574}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225274}, doi = {10.1145/225058.225274}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/GoldmannH95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/GradelM95, author = {Erich Gr{\"{a}}del and Klaus Meer}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Descriptive complexity theory over the real numbers}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {315--324}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225151}, doi = {10.1145/225058.225151}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/GradelM95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/HannenhalliP95, author = {Sridhar Hannenhalli and Pavel A. Pevzner}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {178--189}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225112}, doi = {10.1145/225058.225112}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/HannenhalliP95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Harchol-BalterW95, author = {Mor Harchol{-}Balter and David Wolfe}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Bounding delays in packet-routing networks}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {248--257}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225133}, doi = {10.1145/225058.225133}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Harchol-BalterW95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/HartI95, author = {William E. Hart and Sorin Istrail}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Fast protein folding in the hydrophobic-hydrophilic model within three-eights of optimal (Extended Abstract)}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {157--168}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225106}, doi = {10.1145/225058.225106}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/HartI95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/HellersteinPRW95, author = {Lisa Hellerstein and Krishnan Pillaipakkamnatt and Vijay Raghavan and Dawn Wilkins}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {How many queries are needed to learn?}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {190--199}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225114}, doi = {10.1145/225058.225114}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/HellersteinPRW95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/HenzingerK95, author = {Monika Rauch Henzinger and Valerie King}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Randomized dynamic graph algorithms with polylogarithmic time per operation}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {519--527}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225269}, doi = {10.1145/225058.225269}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/HenzingerK95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/HenzingerKPV95, author = {Thomas A. Henzinger and Peter W. Kopke and Anuj Puri and Pravin Varaiya}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {What's decidable about hybrid automata?}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {373--382}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225162}, doi = {10.1145/225058.225162}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/HenzingerKPV95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KahaleLMPSS95, author = {Nabil Kahal{\'{e}} and Frank Thomson Leighton and Yuan Ma and C. Greg Plaxton and Torsten Suel and Endre Szemer{\'{e}}di}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Lower bounds for sorting networks}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {437--446}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225178}, doi = {10.1145/225058.225178}, timestamp = {Wed, 31 Mar 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/KahaleLMPSS95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KaltofenS95, author = {Erich L. Kaltofen and Victor Shoup}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Subquadratic-time factoring of polynomials over finite fields}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {398--406}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225166}, doi = {10.1145/225058.225166}, timestamp = {Mon, 03 Apr 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/KaltofenS95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KaplanT95, author = {Haim Kaplan and Robert Endre Tarjan}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Persistent lists with catenation via recursive slow-down}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {93--102}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225090}, doi = {10.1145/225058.225090}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/KaplanT95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Karger95, author = {David R. Karger}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {A randomized fully polynomial time approximation scheme for the all terminal network reliability problem}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {11--17}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225069}, doi = {10.1145/225058.225069}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/Karger95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KargerP95, author = {David R. Karger and Serge A. Plotkin}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Adding multiple cost constraints to combinatorial optimization problems, with applications to multicommodity flows}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {18--25}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225073}, doi = {10.1145/225058.225073}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/KargerP95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KarpinskiM95, author = {Marek Karpinski and Angus Macintyre}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Polynomial bounds for {VC} dimension of sigmoidal neural networks}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {200--208}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225118}, doi = {10.1145/225058.225118}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/KarpinskiM95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KavrakiLMR95, author = {Lydia E. Kavraki and Jean{-}Claude Latombe and Rajeev Motwani and Prabhakar Raghavan}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Randomized query processing in robot path planning (Extended Abstract)}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {353--362}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225159}, doi = {10.1145/225058.225159}, timestamp = {Thu, 02 Jan 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/KavrakiLMR95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KhullerR95, author = {Samir Khuller and Balaji Raghavachari}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Improved approximation algorithms for uniform connectivity problems}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {1--10}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225066}, doi = {10.1145/225058.225066}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/KhullerR95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KivinenW95, author = {Jyrki Kivinen and Manfred K. Warmuth}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Additive versus exponentiated gradient updates for linear prediction}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {209--218}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225121}, doi = {10.1145/225058.225121}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/KivinenW95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KleinbergT95, author = {Jon M. Kleinberg and {\'{E}}va Tardos}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Approximations for the disjoint paths problem in high-diameter planar networks}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {26--35}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225075}, doi = {10.1145/225058.225075}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/KleinbergT95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KosarajuD95, author = {S. Rao Kosaraju and Arthur L. Delcher}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Large-scale assembly of {DNA} strings and space-efficient construction of suffix trees}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {169--177}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225108}, doi = {10.1145/225058.225108}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/KosarajuD95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KremerNR95, author = {Ilan Kremer and Noam Nisan and Dana Ron}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {On randomized one-round communication complexity}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {596--605}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225277}, doi = {10.1145/225058.225277}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/KremerNR95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KushilevitzOR95, author = {Eyal Kushilevitz and Rafail Ostrovsky and Adi Ros{\'{e}}n}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Log-space polynomial end-to-end communication}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {559--568}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225273}, doi = {10.1145/225058.225273}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/KushilevitzOR95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/LovaszW95, author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and Peter Winkler}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Efficient stopping rules for Markov chains}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {76--82}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225086}, doi = {10.1145/225058.225086}, timestamp = {Tue, 06 Aug 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/LovaszW95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/MansourP95, author = {Yishay Mansour and Boaz Patt{-}Shamir}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Many-to-one packet routing on grids (Extended Abstract)}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {258--267}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225136}, doi = {10.1145/225058.225136}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/MansourP95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/MillerTTW95, author = {Gary L. Miller and Dafna Talmor and Shang{-}Hua Teng and Noel Walkington}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {A Delaunay based numerical method for three dimensions: generation, formulation, and partition}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {683--692}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225286}, doi = {10.1145/225058.225286}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/MillerTTW95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/MiltersenNSW95, author = {Peter Bro Miltersen and Noam Nisan and Shmuel Safra and Avi Wigderson}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {On data structures and asymmetric communication complexity}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {103--111}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225093}, doi = {10.1145/225058.225093}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/MiltersenNSW95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/NisanT95, author = {Noam Nisan and Amnon Ta{-}Shma}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Symmetric logspace is closed under complement}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {140--146}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225101}, doi = {10.1145/225058.225101}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/NisanT95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/NisanW95, author = {Noam Nisan and Avi Wigderson}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {On the complexity of bilinear forms: dedicated to the memory of Jacques Morgenstern}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {723--732}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225290}, doi = {10.1145/225058.225290}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/NisanW95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Pan95, author = {Victor Y. Pan}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Optimal (up to polylog factors) sequential and parallel algorithms for approximating complex polynomial zeros}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {741--750}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225292}, doi = {10.1145/225058.225292}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Pan95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Ponzio95, author = {Stephen Ponzio}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {A lower bound for integer multiplication with read-once branching programs}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {130--139}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225098}, doi = {10.1145/225058.225098}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Ponzio95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Pulleyblank95, author = {William R. Pulleyblank}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Two Steiner tree packing problems (Extended Abstract)}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {383--387}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225163}, doi = {10.1145/225058.225163}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Pulleyblank95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/RabaniRS95, author = {Yuval Rabani and Yuri Rabinovich and Alistair Sinclair}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {A computational view of population genetics}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {83--92}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225088}, doi = {10.1145/225058.225088}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/RabaniRS95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/RaghavanU95, author = {Prabhakar Raghavan and Eli Upfal}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Stochastic contention resolution with short delays}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {229--237}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225129}, doi = {10.1145/225058.225129}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/RaghavanU95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/RaschleS95, author = {Thomas Raschle and Klaus Simon}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Recognition of graphs with threshold dimension two}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {650--661}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225283}, doi = {10.1145/225058.225283}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/RaschleS95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Raz95, author = {Ran Raz}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {A parallel repetition theorem}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {447--456}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225181}, doi = {10.1145/225058.225181}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/Raz95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Reif95, author = {John H. Reif}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Work efficient parallel solution of Toeplitz systems and polynomial {GCD}}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {751--761}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225293}, doi = {10.1145/225058.225293}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Reif95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/SaksSZ95, author = {Michael E. Saks and Aravind Srinivasan and Shiyu Zhou}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Explicit dispersers with polylog degree}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {479--488}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225188}, doi = {10.1145/225058.225188}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/SaksSZ95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Spielman95, author = {Daniel A. Spielman}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Linear-time encodable and decodable error-correcting codes}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {388--397}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225165}, doi = {10.1145/225058.225165}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Spielman95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Srinivasan95, author = {Aravind Srinivasan}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Improved approximations of packing and covering problems}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {268--276}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225138}, doi = {10.1145/225058.225138}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Srinivasan95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Wang95, author = {Jie Wang}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Average-case completeness of a word problem for groups}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {325--334}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225153}, doi = {10.1145/225058.225153}, timestamp = {Mon, 03 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/Wang95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Yao95, author = {Andrew Chi{-}Chih Yao}, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Security of quantum protocols against coherent measurements}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, pages = {67--75}, publisher = {{ACM}}, year = {1995}, url = {https://doi.org/10.1145/225058.225085}, doi = {10.1145/225058.225085}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Yao95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/stoc/STOC27, editor = {Frank Thomson Leighton and Allan Borodin}, title = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}}, publisher = {{ACM}}, year = {1995}, isbn = {0-89791-718-9}, timestamp = {Mon, 17 Oct 2011 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/STOC27.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.