focs83.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>24. FOCS 1983: Tucson, Arizona</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">FOCS</a> 1983: Tucson, Arizona</h1> 24th Annual Symposium on Foundations of Computer Science, Tucson, Arizona, 7-9 November 1983. IEEE Computer Society <ul> <li><a name="LagariasO83" href="../../indices/a-tree/l/Lagarias:J=_C=.html">J. C. Lagarias</a>, <a href="../../indices/a-tree/o/Odlyzko:Andrew_M=.html">Andrew M. Odlyzko</a>: Solving Low-Density Subset Sum Problems. 1-10 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/LagariasO83">BibTeX</a></font> <li><a name="LubyMR83" href="../../indices/a-tree/l/Luby:Michael.html">Michael Luby</a>, <a href="../../indices/a-tree/m/Micali:Silvio.html">Silvio Micali</a>, <a href="../../indices/a-tree/r/Rackoff:Charles.html">Charles Rackoff</a>: How to Simultaneously Exchange a Secret Bit by Flipping a Symmetrically-Biased Coin. 11-21 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/LubyMR83">BibTeX</a></font> <li><a name="VaziraniV83" href="../../indices/a-tree/v/Vazirani:Umesh_V=.html">Umesh V. Vazirani</a>, <a href="../../indices/a-tree/v/Vazirani:Vijay_V=.html">Vijay V. Vazirani</a>: Trapdoor Pseudo-random Number Generators, with Applications to Protocol Design. 23-30 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/VaziraniV83">BibTeX</a></font> <li><a name="KahnSS83" href="../../indices/a-tree/k/Kahn:Jeff.html">Jeff Kahn</a>, <a href="../../indices/a-tree/s/Saks:Michael_E=.html">Michael E. Saks</a>, <a href="../../indices/a-tree/s/Sturtevant:Dean.html">Dean Sturtevant</a>: A Topological Approach to Evasiveness. 31-33 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KahnSS83">BibTeX</a></font> <li><a name="EvenG83" href="../../indices/a-tree/e/Even:Shimon.html">Shimon Even</a>, <a href="../../indices/a-tree/g/Goldreich:Oded.html">Oded Goldreich</a>: On the Security of Multi-Party Ping-Pong Protocols. 34-39 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/EvenG83">BibTeX</a></font> <li><a name="Mairson83" href="../../indices/a-tree/m/Mairson:Harry_G=.html">Harry G. Mairson</a>: The Program Complexity of Searching a Table. 40-47 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Mairson83">BibTeX</a></font> <li><a name="IncerpiS83" href="../../indices/a-tree/i/Incerpi:Janet.html">Janet Incerpi</a>, <a href="../../indices/a-tree/s/Sedgewick:Robert.html">Robert Sedgewick</a>: Improved Upper Bounds on Shellsort. 48-55 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/IncerpiS83">BibTeX</a></font> <li><a name="KarpL83" 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>: Monte-Carlo Algorithms for Enumeration and Reliability Problems. 56-64 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KarpL83">BibTeX</a></font> <li><a name="Vitter83" href="../../indices/a-tree/v/Vitter:Jeffrey_Scott.html">Jeffrey Scott Vitter</a>: Optimum Algorithms for Two Random Sampling Problems (Extended Abstract). 65-75 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Vitter83">BibTeX</a></font> <li><a name="FlajoletM83" href="../../indices/a-tree/f/Flajolet:Philippe.html">Philippe Flajolet</a>, <a href="../../indices/a-tree/m/Martin:G=_Nigel.html">G. Nigel Martin</a>: Probabilistic Counting. 76-82 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/FlajoletM83">BibTeX</a></font> <li><a name="EdelsbrunnerOS83" href="../../indices/a-tree/e/Edelsbrunner:Herbert.html">Herbert Edelsbrunner</a>, <a href="../../indices/a-tree/o/O=Rourke:Joseph.html">Joseph O'Rourke</a>, <a href="../../indices/a-tree/s/Seidel:Raimund.html">Raimund Seidel</a>: Constructing Arrangements of Lines and Hyperplanes with Applications. 83-91 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/EdelsbrunnerOS83">BibTeX</a></font> <li><a name="Atallah83" href="../../indices/a-tree/a/Atallah:Mikhail_J=.html">Mikhail J. Atallah</a>: Dynamic Computational Geometry (Preliminary Version). 92-99 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Atallah83">BibTeX</a></font> <li><a name="GuibasRS83" href="../../indices/a-tree/g/Guibas:Leonidas_J=.html">Leonidas J. Guibas</a>, <a href="../../indices/a-tree/r/Ramshaw:Lyle.html">Lyle Ramshaw</a>, <a href="../../indices/a-tree/s/Stolfi:Jorge.html">Jorge Stolfi</a>: A Kinetic Framework for Computational Geometry. 100-111 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GuibasRS83">BibTeX</a></font> <li><a name="ColeY83" href="../../indices/a-tree/c/Cole:Richard.html">Richard Cole</a>, <a href="../../indices/a-tree/y/Yap:Chee=Keng.html">Chee-Keng Yap</a>: Geometric Retrieval Problems. 112-121 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ColeY83">BibTeX</a></font> <li><a name="Chazelle83" href="../../indices/a-tree/c/Chazelle:Bernard.html">Bernard Chazelle</a>: Filtering Search: A New Approach to Query-Answering. 122-132 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Chazelle83">BibTeX</a></font> <li><a name="Reif83" href="../../indices/a-tree/r/Reif:John_H=.html">John H. Reif</a>: Logarithmic Depth Circuits for Algebraic Functions. 138-145 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Reif83">BibTeX</a></font> <li><a name="VishkinW83" href="../../indices/a-tree/v/Vishkin:Uzi.html">Uzi Vishkin</a>, <a href="../../indices/a-tree/w/Wigderson:Avi.html">Avi Wigderson</a>: Trade-Offs between Depth and Width in Parallel Computation (Preliminary Version). 146-153 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/VishkinW83">BibTeX</a></font> <li><a name="McKenzieC83" href="../../indices/a-tree/m/McKenzie:Pierre.html">Pierre McKenzie</a>, <a href="../../indices/a-tree/c/Cook:Stephen_A=.html">Stephen A. Cook</a>: The Parallel Complexity of the Abelian Permutation Group Membership Problem. 154-161 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/McKenzieC83">BibTeX</a></font> <li><a name="BabaiKL83" href="../../indices/a-tree/b/Babai:L=aacute=szl=oacute=.html">László Babai</a>, <a href="../../indices/a-tree/k/Kantor:William_M=.html">William M. Kantor</a>, <a href="../../indices/a-tree/l/Luks:Eugene_M=.html">Eugene M. Luks</a>: Computational Complexity and the Classification of Finite Simple Groups. 162-171 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BabaiKL83">BibTeX</a></font> <li><a name="TiurynU83" href="../../indices/a-tree/t/Tiuryn:Jerzy.html">Jerzy Tiuryn</a>, <a href="../../indices/a-tree/u/Urzyczyn:Pawel.html">Pawel Urzyczyn</a>: Some Relationships between Logics of Programs and Complexity Theory (Extended Abstract). 180-184 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/TiurynU83">BibTeX</a></font> <li><a name="WolperVS83" href="../../indices/a-tree/w/Wolper:Pierre.html">Pierre Wolper</a>, <a href="../../indices/a-tree/v/Vardi:Moshe_Y=.html">Moshe Y. Vardi</a>, <a href="../../indices/a-tree/s/Sistla:A=_Prasad.html">A. Prasad Sistla</a>: Reasoning about Infinite Computation Paths (Extended Abstract). 185-194 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/WolperVS83">BibTeX</a></font> <li><a name="Parikh83" href="../../indices/a-tree/p/Parikh:Rohit.html">Rohit Parikh</a>: Propositional Game Logic. 195-200 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Parikh83">BibTeX</a></font> <li><a name="KrausL83" href="../../indices/a-tree/k/Kraus:Sarit.html">Sarit Kraus</a>, <a href="../../indices/a-tree/l/Lehmann:Daniel_J=.html">Daniel J. Lehmann</a>: Decision Procedures for Time and Chance (Extended Abstract). 202-209 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KrausL83">BibTeX</a></font> <li><a name="Gurevich83" href="../../indices/a-tree/g/Gurevich:Yuri.html">Yuri Gurevich</a>: Algebras of Feasible Functions. 210-214 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Gurevich83">BibTeX</a></font> <li><a name="BeauquierG83" href="../../indices/a-tree/b/Beauquier:Joffroy.html">Joffroy Beauquier</a>, <a href="../../indices/a-tree/g/Gire:Fran=ccedil=oise.html">Françoise Gire</a>: On Context-Free Generators. 215 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BeauquierG83">BibTeX</a></font> <li><a name="ChazelleGL83" href="../../indices/a-tree/c/Chazelle:Bernard.html">Bernard Chazelle</a>, <a href="../../indices/a-tree/g/Guibas:Leonidas_J=.html">Leonidas J. Guibas</a>, <a href="../../indices/a-tree/l/Lee:D=_T=.html">D. T. Lee</a>: The Power of Geometric Duality. 217-225 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ChazelleGL83">BibTeX</a></font> <li><a name="Clarkson83" href="../../indices/a-tree/c/Clarkson:Kenneth_L=.html">Kenneth L. Clarkson</a>: Fast Algorithms for the All Nearest Neighbors Problem. 226-232 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Clarkson83">BibTeX</a></font> <li><a name="AsanoA83" href="../../indices/a-tree/a/Asano:Tetsuo.html">Tetsuo Asano</a>, <a href="../../indices/a-tree/a/Asano:Takao.html">Takao Asano</a>: Minimum Partition of Polygonal Regions into Trapezoids. 233-241 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AsanoA83">BibTeX</a></font> <li><a name="Frederickson83" href="../../indices/a-tree/f/Frederickson:Greg_N=.html">Greg N. Frederickson</a>: Shortest Path Problems in Planar Graphs (Preliminary Version). 242-247 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Frederickson83">BibTeX</a></font> <li><a name="Gabow83" href="../../indices/a-tree/g/Gabow:Harold_N=.html">Harold N. Gabow</a>: Scaling Algorithms for Network Problems. 248-257 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Gabow83">BibTeX</a></font> <li><a name="JohnsonV83" href="../../indices/a-tree/j/Johnson:Donald_B=.html">Donald B. Johnson</a>, <a href="../../indices/a-tree/v/Venkatesan:Shankar_M=.html">Shankar M. Venkatesan</a>: Partition of Planar Flow Networks (Preliminary Version). 259-263 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/JohnsonV83">BibTeX</a></font> <li><a name="Baker83" href="../../indices/a-tree/b/Baker:Brenda_S=.html">Brenda S. Baker</a>: Approximation Algorithms for NP-Complete Problems on Planar Graphs (Preliminary Version). 265-273 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Baker83">BibTeX</a></font> <li><a name="Yannakakis83" href="../../indices/a-tree/y/Yannakakis:Mihalis.html">Mihalis Yannakakis</a>: A Polynomial Algorithm for the Min Cut Linear Arrangement of Trees (Extended Abstract). 274-281 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Yannakakis83">BibTeX</a></font> <li><a name="FlajoletP83" href="../../indices/a-tree/f/Flajolet:Philippe.html">Philippe Flajolet</a>, <a href="../../indices/a-tree/p/Puech:Claude.html">Claude Puech</a>: Tree Structures for Partial Match Retrieval. 282-288 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/FlajoletP83">BibTeX</a></font> <li><a name="Lueker83" href="../../indices/a-tree/l/Lueker:George_S=.html">George S. Lueker</a>: Bin Packing with Items Uniformly Distributed over Intervals [a,b]. 289-297 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Lueker83">BibTeX</a></font> <li><a name="AjtaiFK83" href="../../indices/a-tree/a/Ajtai:Mikl=oacute=s.html">Miklós Ajtai</a>, <a href="../../indices/a-tree/f/Fredman:Michael_L=.html">Michael L. Fredman</a>, <a href="../../indices/a-tree/k/Koml=oacute=s:J=aacute=nos.html">János Komlós</a>: Hash Functions for Priority Queues. 299-303 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AjtaiFK83">BibTeX</a></font> <li><a name="BermanS83" href="../../indices/a-tree/b/Berman:Piotr.html">Piotr Berman</a>, <a href="../../indices/a-tree/s/Simon:Janos.html">Janos Simon</a>: Lower Bounds on Graph Threading by Probabilistic Machines (Preliminary Version). 304-311 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BermanS83">BibTeX</a></font> <li><a name="JaJa83" href="../../indices/a-tree/j/J=aacute=J=aacute=:Joseph.html">Joseph JáJá</a>: On the Computational Complexity of the Permanent (Extended Abstract). 312-319 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/JaJa83">BibTeX</a></font> <li><a name="Alt83" href="../../indices/a-tree/a/Alt:Helmut.html">Helmut Alt</a>: Multiplication Is the Easiest Nontrivial Arithmetic Function. 320-322 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Alt83">BibTeX</a></font> <li><a name="Schnitger83" href="../../indices/a-tree/s/Schnitger:Georg.html">Georg Schnitger</a>: On Depth-Reduction and Grates. 323-328 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Schnitger83">BibTeX</a></font> <li><a name="Wilson83" href="../../indices/a-tree/w/Wilson:Christopher_B=.html">Christopher B. Wilson</a>: Relativized Circuit Complexity. 329-334 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Wilson83">BibTeX</a></font> <li><a name="Wilber83" href="../../indices/a-tree/w/Wilber:Robert_E=.html">Robert E. Wilber</a>: Randomness and the Density of Hard Problems. 335-342 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Wilber83">BibTeX</a></font> <li><a name="PaturiS83" href="../../indices/a-tree/p/Paturi:Ramamohan.html">Ramamohan Paturi</a>, <a href="../../indices/a-tree/s/Simon:Janos.html">Janos Simon</a>: Lower Bounds on the Time of Probabilistic On-Line Simulations (Preliminary Version). 343-350 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/PaturiS83">BibTeX</a></font> <li><a name="HochschildMS83" href="../../indices/a-tree/h/Hochschild:Peter_H=.html">Peter H. Hochschild</a>, <a href="../../indices/a-tree/m/Mayr:Ernst_W=.html">Ernst W. Mayr</a>, <a href="../../indices/a-tree/s/Siegel:Alan_R=.html">Alan R. Siegel</a>: Techniques for Solving Graph Problems in Parallel Environments. 351-359 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/HochschildMS83">BibTeX</a></font> <li><a name="BakerP83" href="../../indices/a-tree/b/Baker:Brenda_S=.html">Brenda S. Baker</a>, <a href="../../indices/a-tree/p/Pinter:Ron_Y=.html">Ron Y. Pinter</a>: An Algorithm for the Optimal Placement and Routing of a Circuit within a Ring of Pads (Extended Abstract). 360-370 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BakerP83">BibTeX</a></font> <li><a name="Aggarwal83" href="../../indices/a-tree/a/Aggarwal:Alok.html">Alok Aggarwal</a>: Period-Time Tradeoffs for VLSI Models with Delay (Preliminary Version). 372-382 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Aggarwal83">BibTeX</a></font> <li><a name="GreenbergL83" href="../../indices/a-tree/g/Greenberg:Albert_G=.html">Albert G. Greenberg</a>, <a href="../../indices/a-tree/l/Ladner:Richard_E=.html">Richard E. Ladner</a>: Estimating the Multiplicities of Conflicts in Multiple Access Channels (Preliminary Report). 383-392 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GreenbergL83">BibTeX</a></font> <li><a name="DolevDS83" href="../../indices/a-tree/d/Dolev:Danny.html">Danny Dolev</a>, <a href="../../indices/a-tree/d/Dwork:Cynthia.html">Cynthia Dwork</a>, <a href="../../indices/a-tree/s/Stockmeyer:Larry_J=.html">Larry J. Stockmeyer</a>: On the Minimal Synchronism Needed for Distributed Consensus. 393-402 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/DolevDS83">BibTeX</a></font> <li><a name="Rabin83" href="../../indices/a-tree/r/Rabin:Michael_O=.html">Michael O. Rabin</a>: Randomized Byzantine Generals. 403-409 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Rabin83">BibTeX</a></font> <li><a name="Klawe83" href="../../indices/a-tree/k/Klawe:Maria_M=.html">Maria M. Klawe</a>: A Tight Bound for Black and White Pebbles on the Pyramid. 410-419 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Klawe83">BibTeX</a></font> <li><a name="Yao83" href="../../indices/a-tree/y/Yao:Andrew_Chi=Chih.html">Andrew Chi-Chih Yao</a>: Lower Bounds by Probabilistic Arguments (Extended Abstract). 420-428 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Yao83">BibTeX</a></font> <li><a name="PaulPST83" href="../../indices/a-tree/p/Paul:Wolfgang_J=.html">Wolfgang J. Paul</a>, <a href="../../indices/a-tree/p/Pippenger:Nicholas.html">Nicholas Pippenger</a>, <a href="../../indices/a-tree/s/Szemer=eacute=di:Endre.html">Endre Szemerédi</a>, <a href="../../indices/a-tree/t/Trotter:William_T=.html">William T. Trotter</a>: On Determinism versus Non-Determinism and Related Problems (Preliminary Version). 429-438 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/PaulPST83">BibTeX</a></font> <li><a name="Hartmanis83" href="../../indices/a-tree/h/Hartmanis:Juris.html">Juris Hartmanis</a>: Generalized Kolmogorov Complexity and the Structure of Feasible Computations (Preliminary Report). 439-445 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Hartmanis83">BibTeX</a></font> <li><a name="Papadimitriou83" href="../../indices/a-tree/p/Papadimitriou:Christos_H=.html">Christos H. Papadimitriou</a>: Games Against Nature (Extended Abstract). 446-450 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Papadimitriou83">BibTeX</a></font> <li><a name="KarpLRTVV83" href="../../indices/a-tree/k/Karp:Richard_M=.html">Richard M. Karp</a>, <a href="../../indices/a-tree/l/Leighton:Frank_Thomson.html">Frank Thomson Leighton</a>, <a href="../../indices/a-tree/r/Rivest:Ronald_L=.html">Ronald L. Rivest</a>, <a href="../../indices/a-tree/t/Thompson:Clark_D=.html">Clark D. Thompson</a>, <a href="../../indices/a-tree/v/Vazirani:Umesh_V=.html">Umesh V. Vazirani</a>, <a href="../../indices/a-tree/v/Vazirani:Vijay_V=.html">Vijay V. Vazirani</a>: Global Wire Routing in Two-Dimensional Arrays (Extended Abstract). 453-459 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KarpLRTVV83">BibTeX</a></font> <li><a name="Leivant83" href="../../indices/a-tree/l/Leivant:Daniel.html">Daniel Leivant</a>: Reasoning about Functional Programs and Complexity Classes Associated with Type Disciplines. 460-469 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Leivant83">BibTeX</a></font> <li><a name="Linial83" href="../../indices/a-tree/l/Linial:Nathan.html">Nathan Linial</a>: Legal Coloring of Graphs. 470-472 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Linial83">BibTeX</a></font> <li><a name="LinialS83" href="../../indices/a-tree/l/Linial:Nathan.html">Nathan Linial</a>, <a href="../../indices/a-tree/s/Saks:Michael_E=.html">Michael E. Saks</a>: Information Bounds Are Good for Search Problems on Ordered Data Structures. 473-475 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/LinialS83">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:24 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
