stoc92.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>STOC 1992</title><link href="../../../dblp.css" rel="stylesheet" type="text/css" /></head> <body> <table width="100%"><tr><td align="left"><a href="../../index.html"><img alt="dblp.uni-trier.de" src="../../Logo.gif" border=0 height=60 width=170></a></td> <td align="right"><a href="http://www.uni-trier.de"><img alt="www.uni-trier.de" src="../../logo_universitaet-trier.gif" border=0 height=48 width=215></a></td></tr></table> <h1>24. <a href="index.html">STOC</a> 1992</h1> Proceedings of the 24th Annual ACM Symposium on Theory of Computing, May 4-6, 1992, Victoria, British Columbia, Canada. ACM 1992 <ul> <li><a name="AzarBKLP92" href="../../indices/a-tree/a/Azar:Yossi.html">Yossi Azar</a>, <a href="../../indices/a-tree/b/Broder:Andrei_Z=.html">Andrei Z. Broder</a>, <a href="../../indices/a-tree/k/Karlin:Anna_R=.html">Anna R. Karlin</a>, <a href="../../indices/a-tree/l/Linial:Nathan.html">Nathan Linial</a>, <a href="../../indices/a-tree/p/Phillips:Steven.html">Steven Phillips</a>: Biased Random Walks. 1-9 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AzarBKLP92">BibTeX</a></font> <li><a name="EvenGLNV92" href="../../indices/a-tree/e/Even:Guy.html">Guy Even</a>, <a href="../../indices/a-tree/g/Goldreich:Oded.html">Oded Goldreich</a>, <a href="../../indices/a-tree/l/Luby:Michael.html">Michael Luby</a>, <a href="../../indices/a-tree/n/Nisan:Noam.html">Noam Nisan</a>, <a href="../../indices/a-tree/v/Velickovic:Boban.html">Boban Velickovic</a>: Approximations of General Independent Distributions. 10-16 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/EvenGLNV92">BibTeX</a></font> <li><a name="Schulman92" href="../../indices/a-tree/s/Schulman:Leonard_J=.html">Leonard J. Schulman</a>: Sample Spaces Uniform on Neighborhoods. 17-25 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Schulman92">BibTeX</a></font> <li><a name="FederM92" href="../../indices/a-tree/f/Feder:Tom=aacute=s.html">Tomás Feder</a>, <a href="../../indices/a-tree/m/Mihail:Milena.html">Milena Mihail</a>: Balanced Matroids. 26-38 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/FederM92">BibTeX</a></font> <li><a name="BartalFR92" href="../../indices/a-tree/b/Bartal:Yair.html">Yair Bartal</a>, <a href="../../indices/a-tree/f/Fiat:Amos.html">Amos Fiat</a>, <a href="../../indices/a-tree/r/Rabani:Yuval.html">Yuval Rabani</a>: Competitive Algorithms for Distributed Data Management (Extended Abstract). 39-50 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BartalFR92">BibTeX</a></font> <li><a name="BartalFKV92" href="../../indices/a-tree/b/Bartal:Yair.html">Yair Bartal</a>, <a href="../../indices/a-tree/f/Fiat:Amos.html">Amos Fiat</a>, <a href="../../indices/a-tree/k/Karloff:Howard_J=.html">Howard J. Karloff</a>, <a href="../../indices/a-tree/v/Vohra:Rakesh.html">Rakesh Vohra</a>: New Algorithms for an Ancient Scheduling Problem. 51-58 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BartalFKV92">BibTeX</a></font> <li><a name="AmirBF92" href="../../indices/a-tree/a/Amir:Amihood.html">Amihood Amir</a>, <a href="../../indices/a-tree/b/Benson:Gary.html">Gary Benson</a>, <a href="../../indices/a-tree/f/Farach:Martin.html">Martin Farach</a>: Alphabet Independent Two Dimensional Matching. 59-68 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AmirBF92">BibTeX</a></font> <li><a name="Galil92" href="../../indices/a-tree/g/Galil:Zvi.html">Zvi Galil</a>: A Constant-Time Optimal Parallel String-Matching Algorithm. 69-76 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Galil92">BibTeX</a></font> <li><a name="Leighton92" href="../../indices/a-tree/l/Leighton:Frank_Thomson.html">Frank Thomson Leighton</a>: Methods for Message Routing in Parallel Machines. 77-96 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Leighton92">BibTeX</a></font> <li><a name="GathenS92" href="../../indices/a-tree/g/Gathen:Joachim_von_zur.html">Joachim von zur Gathen</a>, <a href="../../indices/a-tree/s/Shoup:Victor.html">Victor Shoup</a>: Computing Frobenius Maps and Factoring Polynomials (Extended Abstract). 97-105 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GathenS92">BibTeX</a></font> <li><a name="Cai92" href="../../indices/a-tree/c/Cai:Jin=yi.html">Jin-yi Cai</a>: Parallel Computation Over Hyperbolic Groups. 106-115 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Cai92">BibTeX</a></font> <li><a name="BealsS92" href="../../indices/a-tree/b/Beals:Robert.html">Robert Beals</a>, <a href="../../indices/a-tree/s/Seress:=Aacute=kos.html">Ákos Seress</a>: Structure Forest and Composition Factors for Small Base Groups in Nearly Linear Time. 116-125 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BealsS92">BibTeX</a></font> <li><a name="Barvinok92" href="../../indices/a-tree/b/Barvinok:Alexander_I=.html">Alexander I. Barvinok</a>: Feasibility Testing for Systems of Real Quadratic Equations. 126-132 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Barvinok92">BibTeX</a></font> <li><a name="Lin92" href="../../indices/a-tree/l/Lin:Geng.html">Geng Lin</a>: Fault Tolerant Planar Communication Networks. 133-139 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Lin92">BibTeX</a></font> <li><a name="BroderFU92" href="../../indices/a-tree/b/Broder:Andrei_Z=.html">Andrei Z. Broder</a>, <a href="../../indices/a-tree/f/Frieze:Alan_M=.html">Alan M. Frieze</a>, <a href="../../indices/a-tree/u/Upfal:Eli.html">Eli Upfal</a>: Existence and Construction of Edge Disjoint Paths on Expander Graphs. 140-149 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BroderFU92">BibTeX</a></font> <li><a name="MaggsS92" href="../../indices/a-tree/m/Maggs:Bruce_M=.html">Bruce M. Maggs</a>, <a href="../../indices/a-tree/s/Sitaraman:Ramesh_K=.html">Ramesh K. Sitaraman</a>: Simple Algorithms for Routing on Butterfly Networks with Bounded Queues (Extended Abstract). 150-161 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/MaggsS92">BibTeX</a></font> <li><a name="AumannB92" href="../../indices/a-tree/a/Aumann:Yonatan.html">Yonatan Aumann</a>, <a href="../../indices/a-tree/b/Ben=Or:Michael.html">Michael Ben-Or</a>: Computing with Faulty Arrays. 162-169 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AumannB92">BibTeX</a></font> <li><a name="BjornerLY92" href="../../indices/a-tree/b/Bj=ouml=rner:Anders.html">Anders Björner</a>, <a href="../../indices/a-tree/l/Lov=aacute=sz:L=aacute=szl=oacute=.html">László Lovász</a>, <a href="../../indices/a-tree/y/Yao:Andrew_Chi=Chih.html">Andrew Chi-Chih Yao</a>: Linear Decision Trees: Volume Estimates and Topological Bounds. 170-177 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BjornerLY92">BibTeX</a></font> <li><a name="KahnK92" href="../../indices/a-tree/k/Kahn:Jeff.html">Jeff Kahn</a>, <a href="../../indices/a-tree/k/Kim:Jeong_Han.html">Jeong Han Kim</a>: Entropy and Sorting. 178-187 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KahnK92">BibTeX</a></font> <li><a name="BeameL92" href="../../indices/a-tree/b/Beame:Paul.html">Paul Beame</a>, <a href="../../indices/a-tree/l/Lawry:Joan.html">Joan Lawry</a>: Randomized versus Nondeterministic Communication Complexity. 188-199 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BeameL92">BibTeX</a></font> <li><a name="BeameIKPPW92" href="../../indices/a-tree/b/Beame:Paul.html">Paul Beame</a>, <a href="../../indices/a-tree/i/Impagliazzo:Russell.html">Russell Impagliazzo</a>, <a href="../../indices/a-tree/k/Kraj=iacute=cek:Jan.html">Jan Krajícek</a>, <a href="../../indices/a-tree/p/Pitassi:Toniann.html">Toniann Pitassi</a>, <a href="../../indices/a-tree/p/Pudl=aacute=k:Pavel.html">Pavel Pudlák</a>, <a href="../../indices/a-tree/w/Woods:Alan_R=.html">Alan R. Woods</a>: Exponential Lower Bounds for the Pigeonhole Principle. 200-220 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BeameIKPPW92">BibTeX</a></font> <li><a name="Reed92" href="../../indices/a-tree/r/Reed:Bruce_A=.html">Bruce A. Reed</a>: Finding Approximate Separators and Computing Tree Width Quickly. 221-228 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Reed92">BibTeX</a></font> <li><a name="Rao92" href="../../indices/a-tree/r/Rao:Satish.html">Satish Rao</a>: Faster Algorithms for Finding Small Edge Cuts in Planar Graphs (Extended Abstract). 229-240 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Rao92">BibTeX</a></font> <li><a name="DahlhausJPSY92" href="../../indices/a-tree/d/Dahlhaus:Elias.html">Elias Dahlhaus</a>, <a href="../../indices/a-tree/j/Johnson:David_S=.html">David S. Johnson</a>, <a href="../../indices/a-tree/p/Papadimitriou:Christos_H=.html">Christos H. Papadimitriou</a>, <a href="../../indices/a-tree/s/Seymour:Paul_D=.html">Paul D. Seymour</a>, <a href="../../indices/a-tree/y/Yannakakis:Mihalis.html">Mihalis Yannakakis</a>: The Complexity of Multiway Cuts (Extended Abstract). 241-251 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/DahlhausJPSY92">BibTeX</a></font> <li><a name="DorT92" href="../../indices/a-tree/d/Dor:Dorit.html">Dorit Dor</a>, <a href="../../indices/a-tree/t/Tarsi:Michael.html">Michael Tarsi</a>: Graph Decomposition Is NPC-A Complete Proof of Holyer's Conjecture. 252-263 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/DorT92">BibTeX</a></font> <li><a name="LeeY92" href="../../indices/a-tree/l/Lee:David.html">David Lee</a>, <a href="../../indices/a-tree/y/Yannakakis:Mihalis.html">Mihalis Yannakakis</a>: Online Minimization of Transition Systems (Extended Abstract). 264-274 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/LeeY92">BibTeX</a></font> <li><a name="Safra92" href="../../indices/a-tree/s/Safra:Shmuel.html">Shmuel Safra</a>: Exponential Determinization for omega-Automata with Strong-Fairness Acceptance Condition (Extended Abstract). 275-282 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Safra92">BibTeX</a></font> <li><a name="BellantoniC92" href="../../indices/a-tree/b/Bellantoni:Stephen.html">Stephen Bellantoni</a>, <a href="../../indices/a-tree/c/Cook:Stephen_A=.html">Stephen A. Cook</a>: A New Recursion-Theoretic Characterization of the Polytime Functions (Extended Abstract). 283-293 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BellantoniC92">BibTeX</a></font> <li><a name="GroveHK92" href="../../indices/a-tree/g/Grove:Adam_J=.html">Adam J. Grove</a>, <a href="../../indices/a-tree/h/Halpern:Joseph_Y=.html">Joseph Y. Halpern</a>, <a href="../../indices/a-tree/k/Koller:Daphne.html">Daphne Koller</a>: Asymptotic Conditional Probabilities for First-Order Logic. 294-305 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GroveHK92">BibTeX</a></font> <li><a name="KedemPRR92" href="../../indices/a-tree/k/Kedem:Zvi_M=.html">Zvi M. Kedem</a>, <a href="../../indices/a-tree/p/Palem:Krishna_V=.html">Krishna V. Palem</a>, <a href="../../indices/a-tree/r/Rabin:Michael_O=.html">Michael O. Rabin</a>, <a href="../../indices/a-tree/r/Raghunathan:A=.html">A. Raghunathan</a>: Efficient Program Transformations for Resilient Parallel Computation via Randomization (Preliminary Version). 306-317 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KedemPRR92">BibTeX</a></font> <li><a name="KarpLH92" href="../../indices/a-tree/k/Karp:Richard_M=.html">Richard M. Karp</a>, <a href="../../indices/a-tree/l/Luby:Michael.html">Michael Luby</a>, <a href="../../indices/a-tree/h/Heide:Friedhelm_Meyer_auf_der.html">Friedhelm Meyer auf der Heide</a>: Efficient PRAM Simulation on a Distributed Memory Machine. 318-326 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KarpLH92">BibTeX</a></font> <li><a name="AjtaiM92" href="../../indices/a-tree/a/Ajtai:Mikl=oacute=s.html">Miklós Ajtai</a>, <a href="../../indices/a-tree/m/Megiddo:Nimrod.html">Nimrod Megiddo</a>: A Deterministic Poly(log log N)-Time N-Processor Algorithm for Linear Programming in Fixed Dimension. 327-338 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AjtaiM92">BibTeX</a></font> <li><a name="Kelsen92" href="../../indices/a-tree/k/Kelsen:Pierre.html">Pierre Kelsen</a>: On the Parallel Complexity of Computing a Maximal Independent Set in a Hypergraph. 339-350 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Kelsen92">BibTeX</a></font> <li><a name="Angluin92" href="../../indices/a-tree/a/Angluin:Dana.html">Dana Angluin</a>: Computational Learning Theory: Survey and Selected Bibliography. 351-369 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Angluin92">BibTeX</a></font> <li><a name="BshoutyHH92" href="../../indices/a-tree/b/Bshouty:Nader_H=.html">Nader H. Bshouty</a>, <a href="../../indices/a-tree/h/Hancock:Thomas_R=.html">Thomas R. Hancock</a>, <a href="../../indices/a-tree/h/Hellerstein:Lisa.html">Lisa Hellerstein</a>: Learning Arithmetic Read-Once Formulas. 370-381 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BshoutyHH92">BibTeX</a></font> <li><a name="BlumR92" href="../../indices/a-tree/b/Blum:Avrim.html">Avrim Blum</a>, <a href="../../indices/a-tree/r/Rudich:Steven.html">Steven Rudich</a>: Fast Learning of k-Term DNF Formulas with Queries. 382-389 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BlumR92">BibTeX</a></font> <li><a name="Ben-David92" href="../../indices/a-tree/b/Ben=David:Shai.html">Shai Ben-David</a>: Can Finite Samples Detect Singularities of Real-Valued Functions? 390-399 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Ben-David92">BibTeX</a></font> <li><a name="Lindell92" href="../../indices/a-tree/l/Lindell:Steven.html">Steven Lindell</a>: A Logspace Algorithm for Tree Canonization (Extended Abstract). 400-404 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Lindell92">BibTeX</a></font> <li><a name="Plaxton92" href="../../indices/a-tree/p/Plaxton:C=_Greg.html">C. Greg Plaxton</a>: A Hypercubic Sorting Network with Nearly Logarithmic Depth. 405-416 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Plaxton92">BibTeX</a></font> <li><a name="KlugermanP92" href="../../indices/a-tree/k/Klugerman:Michael.html">Michael Klugerman</a>, <a href="../../indices/a-tree/p/Plaxton:C=_Greg.html">C. Greg Plaxton</a>: Small-Depth Counting Networks. 417-428 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KlugermanP92">BibTeX</a></font> <li><a name="PatersonZ92" href="../../indices/a-tree/p/Paterson:Mike.html">Mike Paterson</a>, <a href="../../indices/a-tree/z/Zwick:Uri.html">Uri Zwick</a>: Shallow Multiplication Circuits and Wise Financial Investments. 429-437 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/PatersonZ92">BibTeX</a></font> <li><a name="BabaiBT92" href="../../indices/a-tree/b/Babai:L=aacute=szl=oacute=.html">László Babai</a>, <a href="../../indices/a-tree/b/Beals:Robert.html">Robert Beals</a>, <a href="../../indices/a-tree/t/Tak=aacute=csi=Nagy:P=aacute=l.html">Pál Takácsi-Nagy</a>: Symmetry and Complexity. 438-449 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BabaiBT92">BibTeX</a></font> <li><a name="Beigel92" href="../../indices/a-tree/b/Beigel:Richard.html">Richard Beigel</a>: When Do Extra Majority Gates Help? Polylog(n) Majority Gates Are Equivalent to One. 450-454 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Beigel92">BibTeX</a></font> <li><a name="BarringtonBR92" href="../../indices/a-tree/b/Barrington:David_A=_Mix.html">David A. Mix Barrington</a>, <a href="../../indices/a-tree/b/Beigel:Richard.html">Richard Beigel</a>, <a href="../../indices/a-tree/r/Rudich:Steven.html">Steven Rudich</a>: Representing Boolean Functions as Polynomials Modulo Composite Numbers (Extended Abstract). 455-461 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BarringtonBR92">BibTeX</a></font> <li><a name="NisanS92" href="../../indices/a-tree/n/Nisan:Noam.html">Noam Nisan</a>, <a href="../../indices/a-tree/s/Szegedy:Mario.html">Mario Szegedy</a>: On the Degree of Boolean Functions as Real Polynomials. 462-467 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/NisanS92">BibTeX</a></font> <li><a name="Paturi92" href="../../indices/a-tree/p/Paturi:Ramamohan.html">Ramamohan Paturi</a>: On the Degree of Polynomials that Approximate Symmetric Boolean Functions (Preliminary Version). 468-474 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Paturi92">BibTeX</a></font> <li><a name="Kalai92" href="../../indices/a-tree/k/Kalai:Gil.html">Gil Kalai</a>: A Subexponential Randomized Simplex Algorithm (Extended Abstract). 475-482 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Kalai92">BibTeX</a></font> <li><a name="AdlerB92" href="../../indices/a-tree/a/Adler:Ilan.html">Ilan Adler</a>, <a href="../../indices/a-tree/b/Beling:Peter_A=.html">Peter A. Beling</a>: Polynomial Algorithms for Linear Programming over the Algebraic Numbers. 483-494 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AdlerB92">BibTeX</a></font> <li><a name="GalilIS92" href="../../indices/a-tree/g/Galil:Zvi.html">Zvi Galil</a>, <a href="../../indices/a-tree/i/Italiano:Giuseppe_F=.html">Giuseppe F. Italiano</a>, <a href="../../indices/a-tree/s/Sarnak:Neil.html">Neil Sarnak</a>: Fully Dynamic Planarity Testing (Extended Abstract). 495-506 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GalilIS92">BibTeX</a></font> <li><a name="Goodrich92" href="../../indices/a-tree/g/Goodrich:Michael_T=.html">Michael T. Goodrich</a>: Planar Separators and Parallel Polygon Triangulation (Preliminary Version). 507-516 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Goodrich92">BibTeX</a></font> <li><a name="AgarwalM92" href="../../indices/a-tree/a/Agarwal:Pankaj_K=.html">Pankaj K. Agarwal</a>, <a href="../../indices/a-tree/m/Matousek:Jir=iacute=.html">Jirí Matousek</a>: Ray Shooting and Parametric Search. 517-526 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AgarwalM92">BibTeX</a></font> <li><a name="MalitzP92" href="../../indices/a-tree/m/Malitz:Seth_M=.html">Seth M. Malitz</a>, <a href="../../indices/a-tree/p/Papakostas:Achilleas.html">Achilleas Papakostas</a>: On the Angular Resolution of Planar Graphs. 527-538 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/MalitzP92">BibTeX</a></font> <li><a name="LoMS92" href="../../indices/a-tree/l/Lo:Chi=Yuan.html">Chi-Yuan Lo</a>, <a href="../../indices/a-tree/m/Matousek:Jir=iacute=.html">Jirí Matousek</a>, <a href="../../indices/a-tree/s/Steiger:William_L=.html">William L. Steiger</a>: Ham-Sandwich Cuts in R^d. 539-545 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/LoMS92">BibTeX</a></font> <li><a name="CallahanK92" href="../../indices/a-tree/c/Callahan:Paul_B=.html">Paul B. Callahan</a>, <a href="../../indices/a-tree/k/Kosaraju:S=_Rao.html">S. Rao Kosaraju</a>: A Decomposition of Multi-Dimensional Point-Sets with Applications to k-Nearest-Neighbors and n-Body Potential Fields (Preliminary Version). 546-556 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/CallahanK92">BibTeX</a></font> <li><a name="AwerbuchPPS92" href="../../indices/a-tree/a/Awerbuch:Baruch.html">Baruch Awerbuch</a>, <a href="../../indices/a-tree/p/Patt=Shamir:Boaz.html">Boaz Patt-Shamir</a>, <a href="../../indices/a-tree/p/Peleg:David.html">David Peleg</a>, <a href="../../indices/a-tree/s/Saks:Michael_E=.html">Michael E. Saks</a>: Adapting to Asynchronous Dynamic Networks (Extended Abstract). 557-570 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AwerbuchPPS92">BibTeX</a></font> <li><a name="AwerbuchKP92" href="../../indices/a-tree/a/Awerbuch:Baruch.html">Baruch Awerbuch</a>, <a href="../../indices/a-tree/k/Kutten:Shay.html">Shay Kutten</a>, <a href="../../indices/a-tree/p/Peleg:David.html">David Peleg</a>: Competitive Distributed Job Scheduling (Extended Abstract). 571-580 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AwerbuchKP92">BibTeX</a></font> <li><a name="PanconesiS92" href="../../indices/a-tree/p/Panconesi:Alessandro.html">Alessandro Panconesi</a>, <a href="../../indices/a-tree/s/Srinivasan:Aravind.html">Aravind Srinivasan</a>: Improved Distributed Algorithms for Coloring and Network Decomposition Problems. 581-592 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/PanconesiS92">BibTeX</a></font> <li><a name="ChoyS92" href="../../indices/a-tree/c/Choy:Manhoi.html">Manhoi Choy</a>, <a href="../../indices/a-tree/s/Singh:Ambuj_K=.html">Ambuj K. Singh</a>: Efficient Fault Tolerant Algorithms for Resource Allocation in Distributed Systems. 593-602 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/ChoyS92">BibTeX</a></font> <li><a name="Sipser92" href="../../indices/a-tree/s/Sipser:Michael.html">Michael Sipser</a>: The History and Status of the P versus NP Question. 603-618 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Sipser92">BibTeX</a></font> <li><a name="Nisan92" href="../../indices/a-tree/n/Nisan:Noam.html">Noam Nisan</a>: RL\subseteqSC. 619-623 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Nisan92">BibTeX</a></font> <li><a name="SimonS92" href="../../indices/a-tree/s/Simon:Janos.html">Janos Simon</a>, <a href="../../indices/a-tree/s/Szegedy:Mario.html">Mario Szegedy</a>: On the Complexity of RAM with Various Operation Sets. 624-631 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/SimonS92">BibTeX</a></font> <li><a name="VenkatesanR92" href="../../indices/a-tree/v/Venkatesan:Ramarathnam.html">Ramarathnam Venkatesan</a>, <a href="../../indices/a-tree/r/Rajagopalan:Sivaramakrishnan.html">Sivaramakrishnan Rajagopalan</a>: Average Case Intractability of Matrix and Diophantine Problems (Extended Abstract). 632-642 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/VenkatesanR92">BibTeX</a></font> <li><a name="FeigeL92" href="../../indices/a-tree/f/Feige:Uriel.html">Uriel Feige</a>, <a href="../../indices/a-tree/l/Lund:Carsten.html">Carsten Lund</a>: On the Hardness of Computing the Permanent of Random Matrices (Extended Abstract). 643-654 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/FeigeL92">BibTeX</a></font> <li><a name="DworkW92" href="../../indices/a-tree/d/Dwork:Cynthia.html">Cynthia Dwork</a>, <a href="../../indices/a-tree/w/Waarts:Orli.html">Orli Waarts</a>: Simple and Efficient Bounded Concurrent Timestamping or Bounded Concurrent Timestamp Systems are Comprehensible! 655-666 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/DworkW92">BibTeX</a></font> <li><a name="MayerOOY92" href="../../indices/a-tree/m/Mayer:Alain_J=.html">Alain J. Mayer</a>, <a href="../../indices/a-tree/o/Ofek:Yoram.html">Yoram Ofek</a>, <a href="../../indices/a-tree/o/Ostrovsky:Rafail.html">Rafail Ostrovsky</a>, <a href="../../indices/a-tree/y/Yung:Moti.html">Moti Yung</a>: Self-Stabilizing Symmetry Breaking in Constant-Space (Extended Abstract). 667-678 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/MayerOOY92">BibTeX</a></font> <li><a name="AttiyaF92" href="../../indices/a-tree/a/Attiya:Hagit.html">Hagit Attiya</a>, <a href="../../indices/a-tree/f/Friedman:Roy.html">Roy Friedman</a>: A Correctness Condition for High-Performance Multiprocessors (Extended Abstract). 679-690 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AttiyaF92">BibTeX</a></font> <li><a name="BrightwellOW92" href="../../indices/a-tree/b/Brightwell:Graham.html">Graham Brightwell</a>, <a href="../../indices/a-tree/o/Ott:Teunis_J=.html">Teunis J. Ott</a>, <a href="../../indices/a-tree/w/Winkler:Peter.html">Peter Winkler</a>: Target Shooting with Programmed Random Variables. 691-698 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BrightwellOW92">BibTeX</a></font> <li><a name="FranklinY92" href="../../indices/a-tree/f/Franklin:Matthew_K=.html">Matthew K. Franklin</a>, <a href="../../indices/a-tree/y/Yung:Moti.html">Moti Yung</a>: Communication Complexity of Secure Computation (Extended Abstract). 699-710 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/FranklinY92">BibTeX</a></font> <li><a name="BellareP92" href="../../indices/a-tree/b/Bellare:Mihir.html">Mihir Bellare</a>, <a href="../../indices/a-tree/p/Petrank:Erez.html">Erez Petrank</a>: Making Zero-Knowledge Provers Efficient. 711-722 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BellareP92">BibTeX</a></font> <li><a name="Kilian92" href="../../indices/a-tree/k/Kilian:Joe.html">Joe Kilian</a>: A Note on Efficient Zero-Knowledge Proofs and Arguments (Extended Abstract). 723-732 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Kilian92">BibTeX</a></font> <li><a name="Seidel92" href="../../indices/a-tree/s/Seidel:Raimund.html">Raimund Seidel</a>: On the All-Pairs-Shortest-Path Problem. 745-749 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Seidel92">BibTeX</a></font> <li><a name="KleinS92" href="../../indices/a-tree/k/Klein:Philip_N=.html">Philip N. Klein</a>, <a href="../../indices/a-tree/s/Sairam:Sairam.html">Sairam Sairam</a>: A Parallel Randomized Approximation Scheme for Shortest Paths. 750-758 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KleinS92">BibTeX</a></font> <li><a name="KhullerV92" href="../../indices/a-tree/k/Khuller:Samir.html">Samir Khuller</a>, <a href="../../indices/a-tree/v/Vishkin:Uzi.html">Uzi Vishkin</a>: Biconnectivity Approximations and Graph Carvings. 759-770 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KhullerV92">BibTeX</a></font> <li><a name="LinV92" href="../../indices/a-tree/l/Lin:Jyh=Han.html">Jyh-Han Lin</a>, <a href="../../indices/a-tree/v/Vitter:Jeffrey_Scott.html">Jeffrey Scott Vitter</a>: epsilon-Approximations with Minimum Packing Constraint Violation (Extended Abstract). 771-782 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/LinV92">BibTeX</a></font> </ul><p><div class="footer"> <a href="../../index.html">Home</a> | <a href="../indexa.html">Conferences</a> | <a href="../../journals/index.html">Journals</a> | <a href="../../series/index.html">Series</a> | <a href="../../about/faq.html">FAQ</a> — Search: <a href="http://dblp.l3s.de">Faceted</a> | <a href="http://dblp.mpi-inf.mpg.de/dblp-mirror/index.php">Complete</a> | <a href="../../indices/a-tree/index.html">Author</a></div> <small><a href="../../copyright.html">Copyright ©</a> Sat May 16 23:43:11 2009 by <a href="http://www.informatik.uni-trier.de/~ley/addr.html">Michael Ley</a> (<a href="mailto:ley@uni-trier.de">ley@uni-trier.de</a>)</small></p></body></html>
SIGMOD News
