focs96.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>37. FOCS 1996: Burlington, Vermont</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>37. <a href="index.html">FOCS</a> 1996: Burlington, Vermont, USA</h1> 37th Annual Symposium on Foundations of Computer Science, FOCS '96, Burlington, Vermont, USA, 14-16 October 1996. IEEE Computer Society <ul> <li><a name="Arora96" href="../../indices/a-tree/a/Arora:Sanjeev.html">Sanjeev Arora</a>: Polynomial Time Approximation Schemes for Euclidean TSP and Other Geometric Problems. 2-11 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Arora96">BibTeX</a></font> <li><a name="FriezeK96" href="../../indices/a-tree/f/Frieze:Alan_M=.html">Alan M. Frieze</a>, <a href="../../indices/a-tree/k/Kannan:Ravi.html">Ravi Kannan</a>: The Regularity Lemma and Approximation Schemes for Dense Problems. 12-20 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/FriezeK96">BibTeX</a></font> <li><a name="AroraFK96" href="../../indices/a-tree/a/Arora:Sanjeev.html">Sanjeev Arora</a>, <a href="../../indices/a-tree/f/Frieze:Alan_M=.html">Alan M. Frieze</a>, <a href="../../indices/a-tree/k/Kaplan:Haim.html">Haim Kaplan</a>: A New Rounding Procedure for the Assignment Problem with Applications to Dense Graph Arrangement Problems. 21-30 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AroraFK96">BibTeX</a></font> <li><a name="KenyonR96" href="../../indices/a-tree/k/Kenyon:Claire.html">Claire Kenyon</a>, <a href="../../indices/a-tree/r/R=eacute=mila:Eric.html">Eric Rémila</a>: Approximate Strip Packing. 31-36 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KenyonR96">BibTeX</a></font> <li><a name="DurrS96" href="../../indices/a-tree/d/D=uuml=rr:Christoph.html">Christoph Dürr</a>, <a href="../../indices/a-tree/s/Santha:Miklos.html">Miklos Santha</a>: A Decision Procedure for Unitary Linear Quantum Cellular Automata. 38-45 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/DurrS96">BibTeX</a></font> <li><a name="AharonovB96" href="../../indices/a-tree/a/Aharonov:Dorit.html">Dorit Aharonov</a>, <a href="../../indices/a-tree/b/Ben=Or:Michael.html">Michael Ben-Or</a>: Polynomial Simulations of Decohered Quantum Computers. 46-55 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AharonovB96">BibTeX</a></font> <li><a name="Shor96" href="../../indices/a-tree/s/Shor:Peter_W=.html">Peter W. Shor</a>: Fault-Tolerant Quantum Computation. 56-65 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Shor96">BibTeX</a></font> <li><a name="Kleinberg96" href="../../indices/a-tree/k/Kleinberg:Jon_M=.html">Jon M. Kleinberg</a>: Single-Source Unsplittable Flow. 68-77 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Kleinberg96">BibTeX</a></font> <li><a name="CunninghamG96" href="../../indices/a-tree/c/Cunningham:William_H=.html">William H. Cunningham</a>, <a href="../../indices/a-tree/g/Geelen:James_F=.html">James F. Geelen</a>: The Optimal Path-Matching Problem. 78-85 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/CunninghamG96">BibTeX</a></font> <li><a name="KleinbergR96" href="../../indices/a-tree/k/Kleinberg:Jon_M=.html">Jon M. Kleinberg</a>, <a href="../../indices/a-tree/r/Rubinfeld:Ronitt.html">Ronitt Rubinfeld</a>: Short Paths in Expander Graphs. 86-95 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KleinbergR96">BibTeX</a></font> <li><a name="SpielmanT96" href="../../indices/a-tree/s/Spielman:Daniel_A=.html">Daniel A. Spielman</a>, <a href="../../indices/a-tree/t/Teng:Shang=Hua.html">Shang-Hua Teng</a>: Spectral Partitioning Works: Planar Graphs and Finite Element Meshes. 96-105 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/SpielmanT96">BibTeX</a></font> <li><a name="Kogan96" href="../../indices/a-tree/k/Kogan:Grigory.html">Grigory Kogan</a>: Computing Permanents over Fields of Characteristic 3: Where and Why It Becomes Difficult (extended abstract). 108-114 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Kogan96">BibTeX</a></font> <li><a name="HuangW96" href="../../indices/a-tree/h/Huang:Ming=Deh_A=.html">Ming-Deh A. Huang</a>, <a href="../../indices/a-tree/w/Wong:Yiu=Chung.html">Yiu-Chung Wong</a>: Solving Systems of Polynomial Congruences Modulo a Large Prime (extended abstract). 115-124 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/HuangW96">BibTeX</a></font> <li><a name="DorZ96" href="../../indices/a-tree/d/Dor:Dorit.html">Dorit Dor</a>, <a href="../../indices/a-tree/z/Zwick:Uri.html">Uri Zwick</a>: Median Selection Requires (2+epsilon)n Comparisons. 125-134 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/DorZ96">BibTeX</a></font> <li><a name="Andersson96" href="../../indices/a-tree/a/Andersson:Arne.html">Arne Andersson</a>: Faster Deterministic Sorting and Searching in Linear Space. 135-141 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Andersson96">BibTeX</a></font> <li><a name="VaziraniSR96" href="../../indices/a-tree/v/Vazirani:Vijay_V=.html">Vijay V. Vazirani</a>, <a href="../../indices/a-tree/s/Saran:Huzur.html">Huzur Saran</a>, <a href="../../indices/a-tree/r/Rajan:B=_Sundar.html">B. Sundar Rajan</a>: An Efficient Algorithm for Constructing Minimal Trellises for Codes over Finite Abelian Groups. 144-153 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/VaziraniSR96">BibTeX</a></font> <li><a name="Spielman96" href="../../indices/a-tree/s/Spielman:Daniel_A=.html">Daniel A. Spielman</a>: Highly Fault-Tolerant Parallel Computation (extended abstract). 154-163 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Spielman96">BibTeX</a></font> <li><a name="Sudan96" href="../../indices/a-tree/s/Sudan:Madhu.html">Madhu Sudan</a>: Maximum Likelihood Decoding of Reed Solomon Codes. 164-172 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Sudan96">BibTeX</a></font> <li><a name="Adler96" href="../../indices/a-tree/a/Adler:Micah.html">Micah Adler</a>: New Coding Techniques for Improved Bandwidth Utilization. 173-182 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Adler96">BibTeX</a></font> <li><a name="Bartal96" href="../../indices/a-tree/b/Bartal:Yair.html">Yair Bartal</a>: Probabilistic Approximations of Metric Spaces and Its Algorithmic Applications. 184-193 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Bartal96">BibTeX</a></font> <li><a name="MadrasR96" href="../../indices/a-tree/m/Madras:Neal.html">Neal Madras</a>, <a href="../../indices/a-tree/r/Randall:Dana.html">Dana Randall</a>: Factoring Graphs to Bound Mixing Rates. 194-203 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/MadrasR96">BibTeX</a></font> <li><a name="KannanL96" href="../../indices/a-tree/k/Kannan:Ravi.html">Ravi Kannan</a>, <a href="../../indices/a-tree/l/Li:Guangxing.html">Guangxing Li</a>: Sampling According to the Multivariate Normal Density. 204-212 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KannanL96">BibTeX</a></font> <li><a name="Mitzenmacher96" href="../../indices/a-tree/m/Mitzenmacher:Michael.html">Michael Mitzenmacher</a>: Load Balancing and Density Dependent Jump Markov Processes (extended abstract). 213-222 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Mitzenmacher96">BibTeX</a></font> <li><a name="Anderson96" href="../../indices/a-tree/a/Anderson:Richard_J=.html">Richard J. Anderson</a>: Tree Data Structures for N-Body Simulation. 224-233 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Anderson96">BibTeX</a></font> <li><a name="EtzioniHJKMW96" href="../../indices/a-tree/e/Etzioni:Oren.html">Oren Etzioni</a>, <a href="../../indices/a-tree/h/Hanks:Steve.html">Steve Hanks</a>, <a href="../../indices/a-tree/j/Jiang:Tao.html">Tao Jiang</a>, <a href="../../indices/a-tree/k/Karp:Richard_M=.html">Richard M. Karp</a>, <a href="../../indices/a-tree/m/Madani:Omid.html">Omid Madani</a>, <a href="../../indices/a-tree/w/Waarts:Orli.html">Orli Waarts</a>: Efficient Information Gathering on the Internet (extended abstract). 234-243 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/EtzioniHJKMW96">BibTeX</a></font> <li><a name="ChalasaniJS96" href="../../indices/a-tree/c/Chalasani:Prasad.html">Prasad Chalasani</a>, <a href="../../indices/a-tree/j/Jha:Somesh.html">Somesh Jha</a>, <a href="../../indices/a-tree/s/Saias:Isaac.html">Isaac Saias</a>: Approximate Option Pricing. 244-253 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ChalasaniJS96">BibTeX</a></font> <li><a name="TherienW96" href="../../indices/a-tree/t/Th=eacute=rien:Denis.html">Denis Thérien</a>, <a href="../../indices/a-tree/w/Wilke:Thomas.html">Thomas Wilke</a>: Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy. 256-263 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/TherienW96">BibTeX</a></font> <li><a name="Grohe96" href="../../indices/a-tree/g/Grohe:Martin.html">Martin Grohe</a>: Equivalence in Finite-Variable Logics is Complete for Polynomial Time. 264-273 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Grohe96">BibTeX</a></font> <li><a name="BeameP96" href="../../indices/a-tree/b/Beame:Paul.html">Paul Beame</a>, <a href="../../indices/a-tree/p/Pitassi:Toniann.html">Toniann Pitassi</a>: Simplified and Improved Resolution Lower Bounds. 274-282 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BeameP96">BibTeX</a></font> <li><a name="Rabin96" href="../../indices/a-tree/r/Rabin:Michael_O=.html">Michael O. Rabin</a>: Computationally Hard Algebraic Problems (extended abstract). 284-289 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Rabin96">BibTeX</a></font> <li><a name="CheriyanT96" href="../../indices/a-tree/c/Cheriyan:Joseph.html">Joseph Cheriyan</a>, <a href="../../indices/a-tree/t/Thurimella:Ramakrishna.html">Ramakrishna Thurimella</a>: Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching (extended abstract). 292-301 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/CheriyanT96">BibTeX</a></font> <li><a name="Garg96" href="../../indices/a-tree/g/Garg:Naveen.html">Naveen Garg</a>: A 3-Approximation for the Minimum Tree Spanning k Vertices. 302-309 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Garg96">BibTeX</a></font> <li><a name="EvenNZ96" href="../../indices/a-tree/e/Even:Guy.html">Guy Even</a>, <a href="../../indices/a-tree/n/Naor:Joseph.html">Joseph Naor</a>, <a href="../../indices/a-tree/z/Zosin:Leonid.html">Leonid Zosin</a>: An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem. 310-319 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/EvenNZ96">BibTeX</a></font> <li><a name="SahinalpV96" href="../../indices/a-tree/s/Sahinalp:S=uuml=leyman_Cenk.html">Süleyman Cenk Sahinalp</a>, <a href="../../indices/a-tree/v/Vishkin:Uzi.html">Uzi Vishkin</a>: Efficient Approximate and Dynamic Matching of Patterns Using a Labeling Paradigm (extended abstract). 320-328 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/SahinalpV96">BibTeX</a></font> <li><a name="BlumFKV96" href="../../indices/a-tree/b/Blum:Avrim.html">Avrim Blum</a>, <a href="../../indices/a-tree/f/Frieze:Alan_M=.html">Alan M. Frieze</a>, <a href="../../indices/a-tree/k/Kannan:Ravi.html">Ravi Kannan</a>, <a href="../../indices/a-tree/v/Vempala:Santosh.html">Santosh Vempala</a>: A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions. 330-338 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BlumFKV96">BibTeX</a></font> <li><a name="GoldreichGR96" href="../../indices/a-tree/g/Goldreich:Oded.html">Oded Goldreich</a>, <a href="../../indices/a-tree/g/Goldwasser:Shafi.html">Shafi Goldwasser</a>, <a href="../../indices/a-tree/r/Ron:Dana.html">Dana Ron</a>: Property Testing and Its Connection to Learning and Approximation. 339-348 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GoldreichGR96">BibTeX</a></font> <li><a name="BeimelBBKV96" href="../../indices/a-tree/b/Beimel:Amos.html">Amos Beimel</a>, <a href="../../indices/a-tree/b/Bergadano:Francesco.html">Francesco Bergadano</a>, <a href="../../indices/a-tree/b/Bshouty:Nader_H=.html">Nader H. Bshouty</a>, <a href="../../indices/a-tree/k/Kushilevitz:Eyal.html">Eyal Kushilevitz</a>, <a href="../../indices/a-tree/v/Varricchio:Stefano.html">Stefano Varricchio</a>: On the Applications of Multiplicity Automata in Learning. 349-358 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BeimelBBKV96">BibTeX</a></font> <li><a name="FriezeJK96" href="../../indices/a-tree/f/Frieze:Alan_M=.html">Alan M. Frieze</a>, <a href="../../indices/a-tree/j/Jerrum:Mark.html">Mark Jerrum</a>, <a href="../../indices/a-tree/k/Kannan:Ravi.html">Ravi Kannan</a>: Learning Linear Transformations. 359-368 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/FriezeJK96">BibTeX</a></font> <li><a name="HeideS96" href="../../indices/a-tree/h/Heide:Friedhelm_Meyer_auf_der.html">Friedhelm Meyer auf der Heide</a>, <a href="../../indices/a-tree/s/Scheideler:Christian.html">Christian Scheideler</a>: Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols. 370-379 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/HeideS96">BibTeX</a></font> <li><a name="AndrewsAFKLL96" href="../../indices/a-tree/a/Andrews:Matthew.html">Matthew Andrews</a>, <a href="../../indices/a-tree/a/Awerbuch:Baruch.html">Baruch Awerbuch</a>, <a href="../../indices/a-tree/f/Fern=aacute=ndez:Antonio.html">Antonio Fernández</a>, <a href="../../indices/a-tree/k/Kleinberg:Jon_M=.html">Jon M. Kleinberg</a>, <a href="../../indices/a-tree/l/Leighton:Frank_Thomson.html">Frank Thomson Leighton</a>, <a href="../../indices/a-tree/l/Liu:Zhiyong.html">Zhiyong Liu</a>: Universal Stability Results for Greedy Contention-Resolution Protocols. 380-389 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AndrewsAFKLL96">BibTeX</a></font> <li><a name="BroderFU96" 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>: A General Approach to Dynamic Packet Routing with Bounded Buffers (extended abstract). 390-399 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BroderFU96">BibTeX</a></font> <li><a name="Rabani96" href="../../indices/a-tree/r/Rabani:Yuval.html">Yuval Rabani</a>: Path Coloring on the Mesh. 400-409 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Rabani96">BibTeX</a></font> <li><a name="ArmoniSWZ96" href="../../indices/a-tree/a/Armoni:Roy.html">Roy Armoni</a>, <a href="../../indices/a-tree/s/Saks:Michael_E=.html">Michael E. Saks</a>, <a href="../../indices/a-tree/w/Wigderson:Avi.html">Avi Wigderson</a>, <a href="../../indices/a-tree/z/Zhou:Shiyu.html">Shiyu Zhou</a>: Discrepancy Sets and Pseudorandom Generators for Combinatorial Rectangles. 412-421 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ArmoniSWZ96">BibTeX</a></font> <li><a name="AgrawalT96" href="../../indices/a-tree/a/Agrawal:Manindra.html">Manindra Agrawal</a>, <a href="../../indices/a-tree/t/Thierauf:Thomas.html">Thomas Thierauf</a>: The Boolean Isomorphism Problem. 422-430 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AgrawalT96">BibTeX</a></font> <li><a name="AmanoM96" href="../../indices/a-tree/a/Amano:Kazuyuki.html">Kazuyuki Amano</a>, <a href="../../indices/a-tree/m/Maruoka:Akira.html">Akira Maruoka</a>: Potential of the Approximation Method (extended abstract). 431-440 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AmanoM96">BibTeX</a></font> <li><a name="AnderssonMRT96" href="../../indices/a-tree/a/Andersson:Arne.html">Arne Andersson</a>, <a href="../../indices/a-tree/m/Miltersen:Peter_Bro.html">Peter Bro Miltersen</a>, <a href="../../indices/a-tree/r/Riis:S=oslash=ren.html">Søren Riis</a>, <a href="../../indices/a-tree/t/Thorup:Mikkel.html">Mikkel Thorup</a>: Static Dictionaries on AC<sup>0</sup> RAMs: Query Time Theta(sqrt(log n/log log n)) is Necessary and Sufficient. 441-450 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AnderssonMRT96">BibTeX</a></font> <li><a name="DorHZ96" href="../../indices/a-tree/d/Dor:Dorit.html">Dorit Dor</a>, <a href="../../indices/a-tree/h/Halperin:Shay.html">Shay Halperin</a>, <a href="../../indices/a-tree/z/Zwick:Uri.html">Uri Zwick</a>: All Pairs Almost Shortest Paths. 452-461 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/DorHZ96">BibTeX</a></font> <li><a name="HenzingerRG96" href="../../indices/a-tree/h/Henzinger:Monika_Rauch.html">Monika Rauch Henzinger</a>, <a href="../../indices/a-tree/r/Rao:Satish.html">Satish Rao</a>, <a href="../../indices/a-tree/g/Gabow:Harold_N=.html">Harold N. Gabow</a>: Computing Vertex Connectivity: New Bounds from Old Techniques. 462-471 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/HenzingerRG96">BibTeX</a></font> <li><a name="Erickson96" href="../../indices/a-tree/e/Erickson:Jeff.html">Jeff Erickson</a>: Better Lower Bounds for Halfspace Emptiness. 472-481 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Erickson96">BibTeX</a></font> <li><a name="AgarwalGMV96" href="../../indices/a-tree/a/Agarwal:Pankaj_K=.html">Pankaj K. Agarwal</a>, <a href="../../indices/a-tree/g/Grove:Edward_F=.html">Edward F. Grove</a>, <a href="../../indices/a-tree/m/Murali:T=_M=.html">T. M. Murali</a>, <a href="../../indices/a-tree/v/Vitter:Jeffrey_Scott.html">Jeffrey Scott Vitter</a>: Binary Search Partitions for Fat Rectangles. 482-491 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AgarwalGMV96">BibTeX</a></font> <li><a name="PetrankT96" href="../../indices/a-tree/p/Petrank:Erez.html">Erez Petrank</a>, <a href="../../indices/a-tree/t/Tardos:G=aacute=bor.html">Gábor Tardos</a>: On the Knowledge Complexity of NP. 494-503 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/PetrankT96">BibTeX</a></font> <li><a name="CanettiG96" href="../../indices/a-tree/c/Canetti:Ran.html">Ran Canetti</a>, <a href="../../indices/a-tree/g/Gennaro:Rosario.html">Rosario Gennaro</a>: Incoercible Multiparty Computation (extended abstract). 504-513 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/CanettiG96">BibTeX</a></font> <li><a name="BellareCK96" href="../../indices/a-tree/b/Bellare:Mihir.html">Mihir Bellare</a>, <a href="../../indices/a-tree/c/Canetti:Ran.html">Ran Canetti</a>, <a href="../../indices/a-tree/k/Krawczyk:Hugo.html">Hugo Krawczyk</a>: Pseudorandom Functions Revisited: The Cascade Construction and Its Concrete Security. 514-523 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BellareCK96">BibTeX</a></font> <li><a name="AlonKV96" href="../../indices/a-tree/a/Alon:Noga.html">Noga Alon</a>, <a href="../../indices/a-tree/k/Kozlov:Dmitry_N=.html">Dmitry N. Kozlov</a>, <a href="../../indices/a-tree/v/Vu:Van_H=.html">Van H. Vu</a>: The Geometry of Coin-Weighing Problems. 524-532 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AlonKV96">BibTeX</a></font> <li><a name="Cover96" href="../../indices/a-tree/c/Cover:Thomas_M=.html">Thomas M. Cover</a>: Universal Data Compression and Portfolio Selection. 534-538 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Cover96">BibTeX</a></font> <li><a name="KimbrelK96" href="../../indices/a-tree/k/Kimbrel:Tracy.html">Tracy Kimbrel</a>, <a href="../../indices/a-tree/k/Karlin:Anna_R=.html">Anna R. Karlin</a>: Near-Optimal Parallel Prefetching and Caching. 540-549 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KimbrelK96">BibTeX</a></font> <li><a name="AndrewsBZ96" href="../../indices/a-tree/a/Andrews:Matthew.html">Matthew Andrews</a>, <a href="../../indices/a-tree/b/Bender:Michael_A=.html">Michael A. Bender</a>, <a href="../../indices/a-tree/z/Zhang:Lisa.html">Lisa Zhang</a>: New Algorithms for the Disk Scheduling Problem. 550-559 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AndrewsBZ96">BibTeX</a></font> <li><a name="ArgeV96" href="../../indices/a-tree/a/Arge:Lars.html">Lars Arge</a>, <a href="../../indices/a-tree/v/Vitter:Jeffrey_Scott.html">Jeffrey Scott Vitter</a>: Optimal Dynamic Interval Management in External Memory (extended abstract). 560-569 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ArgeV96">BibTeX</a></font> <li><a name="PlaxtonR96" href="../../indices/a-tree/p/Plaxton:C=_Greg.html">C. Greg Plaxton</a>, <a href="../../indices/a-tree/r/Rajaraman:Rajmohan.html">Rajmohan Rajaraman</a>: Fast Fault-Tolerant Concurrent Access to Shared Objects. 570-579 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/PlaxtonR96">BibTeX</a></font> <li><a name="AumannB96" href="../../indices/a-tree/a/Aumann:Yonatan.html">Yonatan Aumann</a>, <a href="../../indices/a-tree/b/Bender:Michael_A=.html">Michael A. Bender</a>: Fault Tolerant Data Structures. 580-589 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AumannB96">BibTeX</a></font> <li><a name="ErgunKR96" href="../../indices/a-tree/e/Erg=uuml=n:Funda.html">Funda Ergün</a>, <a href="../../indices/a-tree/k/Kumar:Ravi.html">Ravi Kumar</a>, <a href="../../indices/a-tree/r/Rubinfeld:Ronitt.html">Ronitt Rubinfeld</a>: Approximate Checking of Polynomials and Functional Equations (extended abstract). 592-601 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ErgunKR96">BibTeX</a></font> <li><a name="KumarS96" href="../../indices/a-tree/k/Kumar:Ravi.html">Ravi Kumar</a>, <a href="../../indices/a-tree/s/Sivakumar:D=.html">D. Sivakumar</a>: Efficient Self-Testing/Self-Correction of Linear Recurrences. 602-611 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KumarS96">BibTeX</a></font> <li><a name="RajagopalanS96" href="../../indices/a-tree/r/Rajagopalan:Sridhar.html">Sridhar Rajagopalan</a>, <a href="../../indices/a-tree/s/Schulman:Leonard_J=.html">Leonard J. Schulman</a>: Verifying Identities (extended abstract). 612-616 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/RajagopalanS96">BibTeX</a></font> <li><a name="TrevisanSSW96" href="../../indices/a-tree/t/Trevisan:Luca.html">Luca Trevisan</a>, <a href="../../indices/a-tree/s/Sorkin:Gregory_B=.html">Gregory B. Sorkin</a>, <a href="../../indices/a-tree/s/Sudan:Madhu.html">Madhu Sudan</a>, <a href="../../indices/a-tree/w/Williamson:David_P=.html">David P. Williamson</a>: Gadgets, Approximation, and Linear Programming (extended abstract). 617-626 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/TrevisanSSW96">BibTeX</a></font> <li><a name="Hastad96" href="../../indices/a-tree/h/H=aring=stad:Johan.html">Johan Håstad</a>: Clique is Hard to Approximate Within n<sup>1-epsilon</sup>. 627-636 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Hastad96">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
