focs94.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>35. FOCS 1994: Santa Fe, New Mexico</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>35. <a href="index.html">FOCS</a> 1994: Santa Fe, New Mexico</h1> 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, 20-22 November 1994. IEEE Computer Society <ul> <li><a name="KargerMS94" href="../../indices/a-tree/k/Karger:David_R=.html">David R. Karger</a>, <a href="../../indices/a-tree/m/Motwani:Rajeev.html">Rajeev Motwani</a>, <a href="../../indices/a-tree/s/Sudan:Madhu.html">Madhu Sudan</a>: Approximate Graph Coloring by Semidefinite Programming. 2-13 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KargerMS94">BibTeX</a></font> <li><a name="GargSV94" href="../../indices/a-tree/g/Garg:Naveen.html">Naveen Garg</a>, <a href="../../indices/a-tree/s/Saran:Huzur.html">Huzur Saran</a>, <a href="../../indices/a-tree/v/Vazirani:Vijay_V=.html">Vijay V. Vazirani</a>: Finding separator cuts in planar graphs within twice the optimal. 14-23 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GargSV94">BibTeX</a></font> <li><a name="AlonFW94" href="../../indices/a-tree/a/Alon:Noga.html">Noga Alon</a>, <a href="../../indices/a-tree/f/Frieze:Alan_M=.html">Alan M. Frieze</a>, <a href="../../indices/a-tree/w/Welsh:Dominic.html">Dominic Welsh</a>: Polynomial time randomised approxmiation schemes for the Tutte polynomial of dense graphs. 24-35 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AlonFW94">BibTeX</a></font> <li><a name="Szegedy94" href="../../indices/a-tree/s/Szegedy:Mario.html">Mario Szegedy</a>: A note on the Theta number of Lovász and the generalized Delsarte bound. 36-39 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Szegedy94">BibTeX</a></font> <li><a name="Jackson94" href="../../indices/a-tree/j/Jackson:Jeffrey_C=.html">Jeffrey C. Jackson</a>: An Efficient Membership-Query Algorithm for Learning DNF with Respect to the Uniform Distribution. 42-53 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Jackson94">BibTeX</a></font> <li><a name="BshoutyCH94" href="../../indices/a-tree/b/Bshouty:Nader_H=.html">Nader H. Bshouty</a>, <a href="../../indices/a-tree/c/Chen:Zhixiang.html">Zhixiang Chen</a>, <a href="../../indices/a-tree/h/Homer:Steven.html">Steven Homer</a>: On Learning Discretized Geometric Concepts (Extended Abstract). 54-63 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BshoutyCH94">BibTeX</a></font> <li><a name="DhagatH94" href="../../indices/a-tree/d/Dhagat:Aditi.html">Aditi Dhagat</a>, <a href="../../indices/a-tree/h/Hellerstein:Lisa.html">Lisa Hellerstein</a>: PAC Learning with Irrelevant Attributes. 64-74 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/DhagatH94">BibTeX</a></font> <li><a name="BenderS94" href="../../indices/a-tree/b/Bender:Michael_A=.html">Michael A. Bender</a>, <a href="../../indices/a-tree/s/Slonim:Donna_K=.html">Donna K. Slonim</a>: The Power of Team Exploration: Two Robots Can Learn Unlabeled Directed Graphs. 75-85 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BenderS94">BibTeX</a></font> <li><a name="Adleman94" href="../../indices/a-tree/a/Adleman:Leonard_M=.html">Leonard M. Adleman</a>: Algorithmic Number Theory-The Complexity Contribution. 88-113 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Adleman94">BibTeX</a></font> <li><a name="Simon94" href="../../indices/a-tree/s/Simon:Daniel_R=.html">Daniel R. Simon</a>: On the Power of Quantum Cryptography. 116-123 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Simon94">BibTeX</a></font> <li><a name="Shor94" href="../../indices/a-tree/s/Shor:Peter_W=.html">Peter W. Shor</a>: Algorithms for Quantum Computation: Discrete Logarithms and Factoring. 124-134 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Shor94">BibTeX</a></font> <li><a name="CaiLZ94" href="../../indices/a-tree/c/Cai:Jin=yi.html">Jin-yi Cai</a>, <a href="../../indices/a-tree/l/Lipton:Richard_J=.html">Richard J. Lipton</a>, <a href="../../indices/a-tree/z/Zalcstein:Yechezkel.html">Yechezkel Zalcstein</a>: The Complexity of the Membership Problem for 2-generated Commutative Semigroups of Rational Matrices. 135-142 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/CaiLZ94">BibTeX</a></font> <li><a name="CaiFKL94" href="../../indices/a-tree/c/Cai:Jin=yi.html">Jin-yi Cai</a>, <a href="../../indices/a-tree/f/Fuchs:Wolfgang_H=_J=.html">Wolfgang H. J. Fuchs</a>, <a href="../../indices/a-tree/k/Kozen:Dexter.html">Dexter Kozen</a>, <a href="../../indices/a-tree/l/Liu:Zicheng.html">Zicheng Liu</a>: Efficient Average-Case Algorithms for the Modular Group. 143-152 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/CaiFKL94">BibTeX</a></font> <li><a name="Eppstein94" href="../../indices/a-tree/e/Eppstein:David.html">David Eppstein</a>: Finding the k Shortest Paths. 154-165 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Eppstein94">BibTeX</a></font> <li><a name="KosarajuPS94" href="../../indices/a-tree/k/Kosaraju:S=_Rao.html">S. Rao Kosaraju</a>, <a href="../../indices/a-tree/p/Park:James_K=.html">James K. Park</a>, <a href="../../indices/a-tree/s/Stein:Clifford.html">Clifford Stein</a>: Long Tours and Short Superstrings (Preliminary Version). 166-177 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KosarajuPS94">BibTeX</a></font> <li><a name="Weihe94" href="../../indices/a-tree/w/Weihe:Karsten.html">Karsten Weihe</a>: Maximum (s, t)-Flows in Planar Networks in O(|V| log |V|) Time. 178-189 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Weihe94">BibTeX</a></font> <li><a name="Cohen94" href="../../indices/a-tree/c/Cohen:Edith.html">Edith Cohen</a>: Estimating the Size of the Transitive Closure in Linear Time. 190-200 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Cohen94">BibTeX</a></font> <li><a name="Ravi94" href="../../indices/a-tree/r/Ravi:R=.html">R. Ravi</a>: Rapid Rumor Ramification: Approximating the minimum broadcast time (Extended Abstract). 202-213 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Ravi94">BibTeX</a></font> <li><a name="NaorW94" href="../../indices/a-tree/n/Naor:Moni.html">Moni Naor</a>, <a href="../../indices/a-tree/w/Wool:Avishai.html">Avishai Wool</a>: The Load, Capacity and Availability of Quorum Systems. 214-225 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/NaorW94">BibTeX</a></font> <li><a name="ItkisL94" href="../../indices/a-tree/i/Itkis:Gene.html">Gene Itkis</a>, <a href="../../indices/a-tree/l/Levin:Leonid_A=.html">Leonid A. Levin</a>: Fast and Lean Self-Stabilizing Asynchronous Protocols. 226-239 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ItkisL94">BibTeX</a></font> <li><a name="AwerbuchA94" href="../../indices/a-tree/a/Awerbuch:Baruch.html">Baruch Awerbuch</a>, <a href="../../indices/a-tree/a/Azar:Yossi.html">Yossi Azar</a>: Local Optimization of Global Objectives: Competitive Distributed Deadlock Resolution and Resource Allocation. 240-249 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AwerbuchA94">BibTeX</a></font> <li><a name="KargerK94" href="../../indices/a-tree/k/Karger:David_R=.html">David R. Karger</a>, <a href="../../indices/a-tree/k/Koller:Daphne.html">Daphne Koller</a>: (De)randomized Construction of Small Sample Spaces in \calNC. 252-263 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KargerK94">BibTeX</a></font> <li><a name="SrinivasanZ94" href="../../indices/a-tree/s/Srinivasan:Aravind.html">Aravind Srinivasan</a>, <a href="../../indices/a-tree/z/Zuckerman:David.html">David Zuckerman</a>: Computing with Very Weak Random Sources. 264-275 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/SrinivasanZ94">BibTeX</a></font> <li><a name="BellareR94" href="../../indices/a-tree/b/Bellare:Mihir.html">Mihir Bellare</a>, <a href="../../indices/a-tree/r/Rompel:John.html">John Rompel</a>: Randomness-Efficient Oblivious Sampling. 276-287 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BellareR94">BibTeX</a></font> <li><a name="Rubinfeld94" href="../../indices/a-tree/r/Rubinfeld:Ronitt.html">Ronitt Rubinfeld</a>: On the robustness of functional equations. 288-299 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Rubinfeld94">BibTeX</a></font> <li><a name="Yao94" href="../../indices/a-tree/y/Yao:Andrew_Chi=Chih.html">Andrew Chi-Chih Yao</a>: A Lower Bound for the Monotone Depth of Connectivity. 302-308 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Yao94">BibTeX</a></font> <li><a name="SinhaT94" href="../../indices/a-tree/s/Sinha:Rakesh_K=.html">Rakesh K. Sinha</a>, <a href="../../indices/a-tree/t/Thathachar:Jayram_S=.html">Jayram S. Thathachar</a>: Efficient Oblivious Branching Programs for Threshold Functions. 309-317 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/SinhaT94">BibTeX</a></font> <li><a name="NisanRS94" href="../../indices/a-tree/n/Nisan:Noam.html">Noam Nisan</a>, <a href="../../indices/a-tree/r/Rudich:Steven.html">Steven Rudich</a>, <a href="../../indices/a-tree/s/Saks:Michael_E=.html">Michael E. Saks</a>: Products and Help Bits in Decision Trees. 318-329 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/NisanRS94">BibTeX</a></font> <li><a name="KleitmanLM94" href="../../indices/a-tree/k/Kleitman:Daniel_J=.html">Daniel J. Kleitman</a>, <a href="../../indices/a-tree/l/Leighton:Frank_Thomson.html">Frank Thomson Leighton</a>, <a href="../../indices/a-tree/m/Ma:Yuan.html">Yuan Ma</a>: On the Design of Reliable Boolean Circuits that Contain Partially Unreliable Gates. 332-346 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KleitmanLM94">BibTeX</a></font> <li><a name="RanadeSW94" href="../../indices/a-tree/r/Ranade:Abhiram_G=.html">Abhiram G. Ranade</a>, <a href="../../indices/a-tree/s/Schleimer:Saul.html">Saul Schleimer</a>, <a href="../../indices/a-tree/w/Wilkerson:Daniel_Shawcross.html">Daniel Shawcross Wilkerson</a>: Nearly Tight Bounds for Wormhole Routing. 347-355 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/RanadeSW94">BibTeX</a></font> <li><a name="Blumofe94" href="../../indices/a-tree/b/Blumofe:Robert_D=.html">Robert D. Blumofe</a>: Scheduling Multithreaded Computations by Work Stealing. 356-368 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Blumofe94">BibTeX</a></font> <li><a name="KutylowskiLOW94" href="../../indices/a-tree/k/Kutylowski:Miroslaw.html">Miroslaw Kutylowski</a>, <a href="../../indices/a-tree/l/Lorys:Krzysztof.html">Krzysztof Lorys</a>, <a href="../../indices/a-tree/o/Oesterdiekhoff:Brigitte.html">Brigitte Oesterdiekhoff</a>, <a href="../../indices/a-tree/w/Wanka:Rolf.html">Rolf Wanka</a>: Fast and Feasible Periodic Sorting Networks of Constant Depth. 369-380 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KutylowskiLOW94">BibTeX</a></font> <li><a name="BlumW94" href="../../indices/a-tree/b/Blum:Manuel.html">Manuel Blum</a>, <a href="../../indices/a-tree/w/Wasserman:Hal.html">Hal Wasserman</a>: Program Result-Checking: A Theory of Testing Meets a Test of Theory. 382-392 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BlumW94">BibTeX</a></font> <li><a name="KoutsoupiasP94" href="../../indices/a-tree/k/Koutsoupias:Elias.html">Elias Koutsoupias</a>, <a href="../../indices/a-tree/p/Papadimitriou:Christos_H=.html">Christos H. Papadimitriou</a>: Beyond Competitive Analysis. 394-400 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KoutsoupiasP94">BibTeX</a></font> <li><a name="AjtaiADW94" href="../../indices/a-tree/a/Ajtai:Mikl=oacute=s.html">Miklós Ajtai</a>, <a href="../../indices/a-tree/a/Aspnes:James.html">James Aspnes</a>, <a href="../../indices/a-tree/d/Dwork:Cynthia.html">Cynthia Dwork</a>, <a href="../../indices/a-tree/w/Waarts:Orli.html">Orli Waarts</a>: A Theory of Competitive Analysis for Distributed Algorithms. 401-411 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AjtaiADW94">BibTeX</a></font> <li><a name="AwerbuchGLR94" href="../../indices/a-tree/a/Awerbuch:Baruch.html">Baruch Awerbuch</a>, <a href="../../indices/a-tree/g/Gawlick:Rainer.html">Rainer Gawlick</a>, <a href="../../indices/a-tree/l/Leighton:Frank_Thomson.html">Frank Thomson Leighton</a>, <a href="../../indices/a-tree/r/Rabani:Yuval.html">Yuval Rabani</a>: On-line Admission Control and Circuit Routing for High Performance Computing and Communication. 412-423 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AwerbuchGLR94">BibTeX</a></font> <li><a name="LundPR94" href="../../indices/a-tree/l/Lund:Carsten.html">Carsten Lund</a>, <a href="../../indices/a-tree/p/Phillips:Steven.html">Steven Phillips</a>, <a href="../../indices/a-tree/r/Reingold:Nick.html">Nick Reingold</a>: IP over connection-oriented networks and distributional paging. 424-434 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/LundPR94">BibTeX</a></font> <li><a name="Micali94" href="../../indices/a-tree/m/Micali:Silvio.html">Silvio Micali</a>: CS Proofs (Extended Abstracts). 436-453 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Micali94">BibTeX</a></font> <li><a name="SantisCPY94" href="../../indices/a-tree/s/Santis:Alfredo_De.html">Alfredo De Santis</a>, <a href="../../indices/a-tree/c/Crescenzo:Giovanni_Di.html">Giovanni Di Crescenzo</a>, <a href="../../indices/a-tree/p/Persiano:Giuseppe.html">Giuseppe Persiano</a>, <a href="../../indices/a-tree/y/Yung:Moti.html">Moti Yung</a>: On Monotone Formula Closure of SZK. 454-465 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/SantisCPY94">BibTeX</a></font> <li><a name="Kilian94" href="../../indices/a-tree/k/Kilian:Joe.html">Joe Kilian</a>: On the complexity of Bounded-Interaction and Noninteractive Zero-Knowledge Proofs. 466-477 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Kilian94">BibTeX</a></font> <li><a name="KushilevitzMO94" href="../../indices/a-tree/k/Kushilevitz:Eyal.html">Eyal Kushilevitz</a>, <a href="../../indices/a-tree/m/Micali:Silvio.html">Silvio Micali</a>, <a href="../../indices/a-tree/o/Ostrovsky:Rafail.html">Rafail Ostrovsky</a>: Reducibility and Completeness in Multi-Party Private Computations. 478-489 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KushilevitzMO94">BibTeX</a></font> <li><a name="AldousV94" href="../../indices/a-tree/a/Aldous:David.html">David Aldous</a>, <a href="../../indices/a-tree/v/Vazirani:Umesh_V=.html">Umesh V. Vazirani</a>: ``Go With the Winners'' Algorithms. 492-501 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AldousV94">BibTeX</a></font> <li><a name="GartnerZ94" href="../../indices/a-tree/g/G=auml=rtner:Bernd.html">Bernd Gärtner</a>, <a href="../../indices/a-tree/z/Ziegler:G=uuml=nter_M=.html">Günter M. Ziegler</a>: Randomized Simplex Algorithms on Klee-Mintny Cubes. 502-510 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GartnerZ94">BibTeX</a></font> <li><a name="PapadimitriouRST94" href="../../indices/a-tree/p/Papadimitriou:Christos_H=.html">Christos H. Papadimitriou</a>, <a href="../../indices/a-tree/r/Raghavan:Prabhakar.html">Prabhakar Raghavan</a>, <a href="../../indices/a-tree/s/Sudan:Madhu.html">Madhu Sudan</a>, <a href="../../indices/a-tree/t/Tamaki:Hisao.html">Hisao Tamaki</a>: Motion Planning on a Graph (Extended Abstract). 511-520 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/PapadimitriouRST94">BibTeX</a></font> <li><a name="Kleinberg94" href="../../indices/a-tree/k/Kleinberg:Jon_M=.html">Jon M. Kleinberg</a>: The Localization Problem for Mobile Robots. 521-531 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Kleinberg94">BibTeX</a></font> <li><a name="Ben-Or94" href="../../indices/a-tree/b/Ben=Or:Michael.html">Michael Ben-Or</a>: Algebraic Computation Trees in Characteristi p>0 (Extended Abstract). 534-539 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Ben-Or94">BibTeX</a></font> <li><a name="NeffR94" href="../../indices/a-tree/n/Neff:C=_Andrew.html">C. Andrew Neff</a>, <a href="../../indices/a-tree/r/Reif:John_H=.html">John H. Reif</a>: An O(n^1+epsilon log b) Algorithm for the Complex Roots Problem. 540-547 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/NeffR94">BibTeX</a></font> <li><a name="GrigorievV94" href="../../indices/a-tree/g/Grigoriev:Dima.html">Dima Grigoriev</a>, <a href="../../indices/a-tree/v/Vorobjov:Nicolai.html">Nicolai Vorobjov</a>: Complexity Lower Bounds for Computation Trees with Elementary Transcendental Function Gates. 548-552 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GrigorievV94">BibTeX</a></font> <li><a name="TuranV94" href="../../indices/a-tree/t/Tur=aacute=n:Gy=ouml=rgy.html">György Turán</a>, <a href="../../indices/a-tree/v/Vatan:Farrokh.html">Farrokh Vatan</a>: On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-in (Extended Abstract). 553-564 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/TuranV94">BibTeX</a></font> <li><a name="SipserS94" href="../../indices/a-tree/s/Sipser:Michael.html">Michael Sipser</a>, <a href="../../indices/a-tree/s/Spielman:Daniel_A=.html">Daniel A. Spielman</a>: Expander Codes. 566-576 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/SipserS94">BibTeX</a></font> <li><a name="LinialLR94" href="../../indices/a-tree/l/Linial:Nathan.html">Nathan Linial</a>, <a href="../../indices/a-tree/l/London:Eran.html">Eran London</a>, <a href="../../indices/a-tree/r/Rabinovich:Yuri.html">Yuri Rabinovich</a>: The geometry of graphs and some of its algorithmic applications. 577-591 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/LinialLR94">BibTeX</a></font> <li><a name="KamathMPS94" href="../../indices/a-tree/k/Kamath:Anil.html">Anil Kamath</a>, <a href="../../indices/a-tree/m/Motwani:Rajeev.html">Rajeev Motwani</a>, <a href="../../indices/a-tree/p/Palem:Krishna_V=.html">Krishna V. Palem</a>, <a href="../../indices/a-tree/s/Spirakis:Paul_G=.html">Paul G. Spirakis</a>: Tail Bounds for Occupancy and the Satisfiability Threshold Conjecture. 592-603 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KamathMPS94">BibTeX</a></font> <li><a name="AlbaneseBELS94" href="../../indices/a-tree/a/Albanese:Andres.html">Andres Albanese</a>, <a href="../../indices/a-tree/b/Bl=ouml=mer:Johannes.html">Johannes Blömer</a>, <a href="../../indices/a-tree/e/Edmonds:Jeff.html">Jeff Edmonds</a>, <a href="../../indices/a-tree/l/Luby:Michael.html">Michael Luby</a>, <a href="../../indices/a-tree/s/Sudan:Madhu.html">Madhu Sudan</a>: Priority Encoding Transmission. 604-612 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AlbaneseBELS94">BibTeX</a></font> <li><a name="Schwentick94" href="../../indices/a-tree/s/Schwentick:Thomas.html">Thomas Schwentick</a>: Graph Connectivity and Monadic NP. 614-622 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Schwentick94">BibTeX</a></font> <li><a name="HirshfeldJM94" href="../../indices/a-tree/h/Hirshfeld:Yoram.html">Yoram Hirshfeld</a>, <a href="../../indices/a-tree/j/Jerrum:Mark.html">Mark Jerrum</a>, <a href="../../indices/a-tree/m/Moller:Faron.html">Faron Moller</a>: A Polynomial-time Algorithm for Deciding Equivalence of Normed Context-free Processes. 623-631 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/HirshfeldJM94">BibTeX</a></font> <li><a name="BasuPR94" href="../../indices/a-tree/b/Basu:Saugata.html">Saugata Basu</a>, <a href="../../indices/a-tree/p/Pollack:Richard.html">Richard Pollack</a>, <a href="../../indices/a-tree/r/Roy:Marie=Fran=ccedil=oise.html">Marie-Françoise Roy</a>: On the Combinatorial and Algebraic Complexity of Quantifier Elimination. 632-641 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BasuPR94">BibTeX</a></font> <li><a name="CharatonikP94" href="../../indices/a-tree/c/Charatonik:Witold.html">Witold Charatonik</a>, <a href="../../indices/a-tree/p/Pacholski:Leszek.html">Leszek Pacholski</a>: Set constraints with projections are in NEXPTIME. 642-653 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/CharatonikP94">BibTeX</a></font> <li><a name="Kannan94" href="../../indices/a-tree/k/Kannan:Ravi.html">Ravi Kannan</a>: Markov Chains and Polynomial Time Algorithms. 656-671 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Kannan94">BibTeX</a></font> <li><a name="Chazelle94" href="../../indices/a-tree/c/Chazelle:Bernard.html">Bernard Chazelle</a>: A Spectral Approach to Lower Bounds. 674-682 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Chazelle94">BibTeX</a></font> <li><a name="AmatoGR94" href="../../indices/a-tree/a/Amato:Nancy_M=.html">Nancy M. Amato</a>, <a href="../../indices/a-tree/g/Goodrich:Michael_T=.html">Michael T. Goodrich</a>, <a href="../../indices/a-tree/r/Ramos:Edgar_A=.html">Edgar A. Ramos</a>: Parallel Algorithms for Higher-Dimensional Convex Hulls. 683-694 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AmatoGR94">BibTeX</a></font> <li><a name="Clarkson94" href="../../indices/a-tree/c/Clarkson:Kenneth_L=.html">Kenneth L. Clarkson</a>: More Output-Sensitive Geometric Algorithms (Extended Abstract). 695-702 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Clarkson94">BibTeX</a></font> <li><a name="AryaMS94" href="../../indices/a-tree/a/Arya:Sunil.html">Sunil Arya</a>, <a href="../../indices/a-tree/m/Mount:David_M=.html">David M. Mount</a>, <a href="../../indices/a-tree/s/Smid:Michiel_H=_M=.html">Michiel H. M. Smid</a>: Randomized and deterministic algorithms for geometric spanners of small diameter. 703-712 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AryaMS94">BibTeX</a></font> <li><a name="AnderssonN94" href="../../indices/a-tree/a/Andersson:Arne.html">Arne Andersson</a>, <a href="../../indices/a-tree/n/Nilsson:Stefan.html">Stefan Nilsson</a>: A New Efficient Radix Sort. 714-721 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AnderssonN94">BibTeX</a></font> <li><a name="GreenePY94" href="../../indices/a-tree/g/Greene:Daniel_H=.html">Daniel H. Greene</a>, <a href="../../indices/a-tree/p/Parnas:Michal.html">Michal Parnas</a>, <a href="../../indices/a-tree/y/Yao:F=_Frances.html">F. Frances Yao</a>: Multi-Index Hashing for Information Retrieval. 722-731 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GreenePY94">BibTeX</a></font> <li><a name="EricksonLL94" href="../../indices/a-tree/e/Erickson:K=_Bruce.html">K. Bruce Erickson</a>, <a href="../../indices/a-tree/l/Ladner:Richard_E=.html">Richard E. Ladner</a>, <a href="../../indices/a-tree/l/LaMarca:Anthony.html">Anthony LaMarca</a>: Optimizing Static Calendar Queues. 732-743 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/EricksonLL94">BibTeX</a></font> <li><a name="Henzinger94" href="../../indices/a-tree/h/Henzinger:Monika_Rauch.html">Monika Rauch Henzinger</a>: Fully Dynamic Cycle-Equivalence in Graphs. 744-755 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Henzinger94">BibTeX</a></font> <li><a name="KeselmanA94" href="../../indices/a-tree/k/Keselman:Dmitry.html">Dmitry Keselman</a>, <a href="../../indices/a-tree/a/Amir:Amihood.html">Amihood Amir</a>: Maximum Agreement Subtree in a Set of Evolutionary Trees-Metrics and Efficient Algorithms. 758-769 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KeselmanA94">BibTeX</a></font> <li><a name="FarachT94" href="../../indices/a-tree/f/Farach:Martin.html">Martin Farach</a>, <a href="../../indices/a-tree/t/Thorup:Mikkel.html">Mikkel Thorup</a>: Optimal Evolutionary Tree Comparison by Sparse Dynamic Programming (Extended Abstract). 770-779 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/FarachT94">BibTeX</a></font> <li><a name="KaplanST94" href="../../indices/a-tree/k/Kaplan:Haim.html">Haim Kaplan</a>, <a href="../../indices/a-tree/s/Shamir:Ron.html">Ron Shamir</a>, <a href="../../indices/a-tree/t/Tarjan:Robert_Endre.html">Robert Endre Tarjan</a>: Tractability of parameterized completion problems on chordal and interval graphs: Minimum Fill-in and Physical Mapping. 780-791 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KaplanST94">BibTeX</a></font> <li><a name="BeameIKPP94" 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>: Lower Bound on Hilbert's Nullstellensatz and propositional proofs. 794-806 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BeameIKPP94">BibTeX</a></font> <li><a name="AllenderS94" href="../../indices/a-tree/a/Allender:Eric.html">Eric Allender</a>, <a href="../../indices/a-tree/s/Strauss:Martin.html">Martin Strauss</a>: Measure on Small Complexity Classes, with Applications for BPP. 807-818 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AllenderS94">BibTeX</a></font> <li><a name="KhannaMSV94" href="../../indices/a-tree/k/Khanna:Sanjeev.html">Sanjeev Khanna</a>, <a href="../../indices/a-tree/m/Motwani:Rajeev.html">Rajeev Motwani</a>, <a href="../../indices/a-tree/s/Sudan:Madhu.html">Madhu Sudan</a>, <a href="../../indices/a-tree/v/Vazirani:Umesh_V=.html">Umesh V. Vazirani</a>: On Syntactic versus Computational Views of Approximability. 819-830 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KhannaMSV94">BibTeX</a></font> <li><a name="NisanW94" href="../../indices/a-tree/n/Nisan:Noam.html">Noam Nisan</a>, <a href="../../indices/a-tree/w/Wigderson:Avi.html">Avi Wigderson</a>: On Rank vs. Communication Complexity. 831-836 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/NisanW94">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:12:26 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
