%%% -*-BibTeX-*- %%% ==================================================================== %%% BibTeX-file{ %%% author = "Nelson H. F. Beebe", %%% version = "2.05", %%% date = "08 August 2024", %%% time = "09:05:11 MDT", %%% filename = "focs1990.bib", %%% address = "University of Utah %%% Department of Mathematics, 110 LCB %%% 155 S 1400 E RM 233 %%% Salt Lake City, UT 84112-0090 %%% USA", %%% telephone = "+1 801 581 5254", %%% FAX = "+1 801 581 4148", %%% URL = "https://www.math.utah.edu/~beebe", %%% checksum = "48102 9125 33568 324694", %%% email = "beebe at math.utah.edu, beebe at acm.org, %%% beebe at computer.org (Internet)", %%% codetable = "ISO/ASCII", %%% keywords = "bibliography; BibTeX; Foundations of Computer %%% Science (FOCS)", %%% license = "public domain", %%% supported = "yes", %%% docstring = "This is a COMPLETE bibliography of %%% publications in the annual IEEE symposia on %%% the Foundations of Computer Science (CODEN %%% ASFPDV, ISSN 0272-5428) for the decade %%% 1990--1999. %%% %%% At version 2.05, the year coverage looked like %%% this: %%% %%% 1990 ( 91) 1994 ( 73) 1998 ( 80) %%% 1991 ( 85) 1995 ( 74) 1999 ( 68) %%% 1992 ( 77) 1996 ( 66) %%% 1993 ( 74) 1997 ( 64) %%% %%% InProceedings: 742 %%% Proceedings: 10 %%% %%% Total entries: 752 %%% %%% The checksum field above contains a CRC-16 %%% checksum as the first value, followed by the %%% equivalent of the standard UNIX wc (word %%% count) utility output of lines, words, and %%% characters. This is produced by Robert %%% Solovay's checksum utility.", %%% } %%% ====================================================================

%%% ==================================================================== %%% Acknowledgement abbreviations:

@String{ack-nhfb= "Nelson H. F. Beebe, University of Utah, Department of Mathematics, 110 LCB, 155 S 1400 E RM 233, Salt Lake City, UT 84112-0090, USA, Tel: +1 801 581 5254, FAX: +1 801 581 4148, e-mail: \path|beebe@math.utah.edu|, \path|beebe@acm.org|, \path|beebe@computer.org| (Internet), URL: \path|https://www.math.utah.edu/~beebe/|"}

%%% ==================================================================== %%% Publisher abbreviations:

@String{pub-IEEE= "IEEE Computer Society Press"} @String{pub-IEEE:adr= "1109 Spring Street, Suite 300, Silver Spring, MD 20910, USA"}

%%% ==================================================================== %%% Bibliography entries:

@InProceedings{Lund:1990:AMI, author = "C. Lund and L. Fortnow and H. Karloff and N. Nisan", title = "Algebraic methods for interactive proof systems", crossref = "IEEE:1990:PAS", volume = "1", pages = "2--10", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Shamir:1990:IIP, author = "A. Shamir", title = "{IP}={PSPACE} (interactive proof=polynomial space)", crossref = "IEEE:1990:PAS", volume = "1", pages = "11--15", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Babai:1990:NET, author = "L. Babai and L. Fortnow and C. Lund", title = "Nondeterministic exponential time has two-prover interactive protocols", crossref = "IEEE:1990:PAS", volume = "1", pages = "16--25", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Babai:1990:CHP, author = "L. Babai and L. Fortnow", title = "A characterization of {Hash P} by arithmetic straight line programs", crossref = "IEEE:1990:PAS", volume = "1", pages = "26--34", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Dolev:1990:PSM, author = "D. Dolev and C. Dwork and O. Waarts and M. Yung", title = "Perfectly secure message transmission", crossref = "IEEE:1990:PAS", volume = "1", pages = "36--45", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Alon:1990:CFG, author = "N. Alon and M. Naor", title = "Coin-flipping games immune against linear-sized coalitions", crossref = "IEEE:1990:PAS", volume = "1", pages = "46--54", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Attiya:1990:WFA, author = "H. Attiya and N. Lynch and N. Shavit", title = "Are wait-free algorithms fast?", crossref = "IEEE:1990:PAS", volume = "1", pages = "55--64", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Awerbuch:1990:DPA, author = "B. Awerbuch and M. Saks", title = "A dining philosophers algorithm with polynomial response time", crossref = "IEEE:1990:PAS", volume = "1", pages = "65--74", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Du:1990:APL, author = "D.-Z. Du and F. K. Hwang", title = "An approach for proving lower bounds: solution of {Gilbert--Pollak}'s conjecture on {Steiner} ratio", crossref = "IEEE:1990:PAS", volume = "1", pages = "76--85", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Formann:1990:DGP, author = "M. Formann and T. Hagerup and J. Haralambides and M. Kaufmann and F. T. Leighton and A. Simvonis and E. Welzl and G. Woeginger", title = "Drawing graphs in the plane with high resolution", crossref = "IEEE:1990:PAS", volume = "1", pages = "86--95", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Cheng:1990:NRD, author = "S. W. Cheng and R. Janardan", title = "New results on dynamic planar point location", crossref = "IEEE:1990:PAS", volume = "1", pages = "96--105", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Reif:1990:CCO, author = "J. H. Reif and J. D. Tygar and A. Yoshida", title = "The computability and complexity of optical beam tracing", crossref = "IEEE:1990:PAS", volume = "1", pages = "106--114", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Chang:1990:ASM, author = "W. I. Chang and E. L. Lawler", title = "Approximate string matching in sublinear expected time", crossref = "IEEE:1990:PAS", volume = "1", pages = "116--124", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Li:1990:TDS, author = "M. Li", title = "Towards a {DNA} sequencing theory (learning a string)", crossref = "IEEE:1990:PAS", volume = "1", pages = "125--134", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Colussi:1990:ECS, author = "L. Colussi and Z. Galil and R. Giancarlo", title = "On the exact complexity of string matching", crossref = "IEEE:1990:PAS", volume = "1", pages = "135--144", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Dubiner:1990:FTP, author = "M. Dubiner and Z. Galil and E. Magen", title = "Faster tree pattern matching", crossref = "IEEE:1990:PAS", volume = "1", pages = "145--150", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Neff:1990:SPP, author = "C. A. Neff", title = "Specified precision polynomial root isolation is in {NC}", crossref = "IEEE:1990:PAS", volume = "1", pages = "152--162", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kosaraju:1990:TPT, author = "S. R. Kosaraju and A. L. Delcher", title = "A tree-partitioning technique with applications to expression evaluation and term matching", crossref = "IEEE:1990:PAS", volume = "1", pages = "163--172", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Lagergren:1990:EPA, author = "J. Lagergren", title = "Efficient parallel algorithms for tree-decomposition and related problems", crossref = "IEEE:1990:PAS", volume = "1", pages = "173--182", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Angluin:1990:LCH, author = "D. Angluin and M. Frazier and L. Pitt", title = "Learning conjunctions of {Horn} clauses", crossref = "IEEE:1990:PAS", volume = "1", pages = "186--192", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Goldman:1990:EIC, author = "S. A. Goldman and M. J. Kearns and R. E. Schapire", title = "Exact identification of circuits using fixed points of amplification functions", crossref = "IEEE:1990:PAS", volume = "1", pages = "193--202", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Maass:1990:CLC, author = "W. Maass and G. Turan", title = "On the complexity of learning from counterexamples and membership queries", crossref = "IEEE:1990:PAS", volume = "1", pages = "203--210", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Blum:1990:SDF, author = "A. Blum", title = "Separating distribution-free and mistake-bound learning models over the {Boolean} domain", crossref = "IEEE:1990:PAS", volume = "1", pages = "211--218", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Chazelle:1990:TSP, author = "B. Chazelle", title = "Triangulating a simple polygon in linear time", crossref = "IEEE:1990:PAS", volume = "1", pages = "220--230", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Bern:1990:PGM, author = "M. Bern and D. Eppstein and J. Gilbert", title = "Provably good mesh generation", crossref = "IEEE:1990:PAS", volume = "1", pages = "231--241", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Chazelle:1990:CCC, author = "B. Chazelle and H. Edelsbrunner and L. J. Guibas and R. Pollack and R. Seidel and M. Sharir and J. Snoeyink", title = "Counting and cutting cycles of lines and rods in space", crossref = "IEEE:1990:PAS", volume = "1", pages = "242--251", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{deBerg:1990:HSR, author = "M. de Berg and M. H. Overmars", title = "Hidden surface removal for axis-parallel polyhedra", crossref = "IEEE:1990:PAS", volume = "1", pages = "252--261", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Leighton:1990:FSC, author = "T. Leighton and C. G. Plaxton", title = "A (fairly) simple circuit that (usually) sorts", crossref = "IEEE:1990:PAS", volume = "1", pages = "264--274", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Assaf:1990:FTS, author = "S. Assaf and E. Upfal", title = "Fault tolerant sorting network", crossref = "IEEE:1990:PAS", volume = "1", pages = "275--284", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kaklamanis:1990:ATB, author = "C. Kaklamanis and A. R. Karlin and F. T. Leighton and V. Milenkovic and P. Raghavan and S. Rao and C. Thomborson and A. Tsantilas", title = "Asymptotically tight bounds for computing with faulty arrays of processors", crossref = "IEEE:1990:PAS", volume = "1", pages = "285--296", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Bay:1990:DLR, author = "P. Bay and G. Bilardi", title = "Deterministic on-line routing on area-universal networks", crossref = "IEEE:1990:PAS", volume = "1", pages = "297--306", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Feige:1990:MNI, author = "U. Feige and D. Lapidot and A. Shamir", title = "Multiple non-interactive zero knowledge proofs based on a single random string", crossref = "IEEE:1990:PAS", volume = "1", pages = "308--317", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Goldreich:1990:SPA, author = "O. Goldreich and R. Impagliazzo and L. Levin and R. Venkatesan and D. Zuckerman", title = "Security preserving amplification of hardness", crossref = "IEEE:1990:PAS", volume = "1", pages = "318--326", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Sturtivant:1990:EIB, author = "C. Sturtivant and Z.-L. Zhang", title = "Efficiently inverting bijections given by straight line programs", crossref = "IEEE:1990:PAS", volume = "1", pages = "327--334", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Chor:1990:PCI, author = "B. Chor and M. Gereb-Graus and E. Kushilevitz", title = "Private computations over the integers", crossref = "IEEE:1990:PAS", volume = "1", pages = "335--344", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Lovasz:1990:MRM, author = "L. Lovasz and M. Simonovits", title = "The mixing rate of {Markov} chains, an isoperimetric inequality, and computing the volume", crossref = "IEEE:1990:PAS", volume = "1", pages = "346--354", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Deng:1990:EUG, author = "X. Deng and C. H. Papadimitriou", title = "Exploring an unknown graph", crossref = "IEEE:1990:PAS", volume = "1", pages = "355--361", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kannan:1990:IEH, author = "S. Kannan and T. Warnow", title = "Inferring evolutionary history from {DNA} sequences", crossref = "IEEE:1990:PAS", volume = "1", pages = "362--371", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Fich:1990:P, author = "F. E. Fich and J. I. Munro and P. V. Poblete", title = "Permuting", crossref = "IEEE:1990:PAS", volume = "1", pages = "372--379", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kearns:1990:EDF, author = "M. J. Kearns and R. E. Schapire", title = "Efficient distribution-free learning of probabilistic concepts", crossref = "IEEE:1990:PAS", volume = "1", pages = "382--391", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Aldous:1990:MEV, author = "D. Aldous and U. Vazirani", title = "A {Markovian} extension of {Valiant}'s learning model", crossref = "IEEE:1990:PAS", volume = "1", pages = "392--396", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Paturi:1990:TCP, author = "R. Paturi and M. E. Saks", title = "On threshold circuits for parity", crossref = "IEEE:1990:PAS", volume = "1", pages = "397--404", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Fulk:1990:RSI, author = "M. A. Fulk", title = "Robust separations in inductive inference", crossref = "IEEE:1990:PAS", volume = "1", pages = "405--410", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Abrahamson:1990:TST, author = "K. Abrahamson", title = "A time-space tradeoff for {Boolean} matrix multiplication", crossref = "IEEE:1990:PAS", volume = "1", pages = "412--419", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Beame:1990:CST, author = "P. Beame and M. Tompa and P. Yan", title = "Communication-space tradeoffs for unrestricted protocols", crossref = "IEEE:1990:PAS", volume = "1", pages = "420--428", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Beame:1990:TST, author = "P. Beame and A. Borodin and P. Raghavan and W. L. Ruzzo and M. Tompa", title = "Time-space tradeoffs for undirected graph traversal", crossref = "IEEE:1990:PAS", volume = "1", pages = "429--438", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Istrail:1990:CGU, author = "S. Istrail", title = "Constructing generalized universal traversing sequences of polynomial size for graphs with small diameter", crossref = "IEEE:1990:PAS", volume = "1", pages = "439--448", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Fiat:1990:CSA, author = "A. Fiat and Y. Rabani and Y. Ravid", title = "Competitive $k$-server algorithms", crossref = "IEEE:1990:PAS", volume = "2", pages = "454--463", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Vishwanathan:1990:ROG, author = "S. Vishwanathan", title = "Randomized online graph coloring", crossref = "IEEE:1990:PAS", volume = "2", pages = "464--469", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Irani:1990:CIG, author = "S. Irani", title = "Coloring inductive graphs on-line", crossref = "IEEE:1990:PAS", volume = "2", pages = "470--479", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Cole:1990:OAF, author = "R. Cole and A. Raghunathan", title = "Online algorithms for finger searching", crossref = "IEEE:1990:PAS", volume = "2", pages = "480--489", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Awerbuch:1990:COM, author = "B. Awerbuch and I. Cidon and S. Kutten", title = "Communication-optimal maintenance of replicated information", crossref = "IEEE:1990:PAS", volume = "2", pages = "492--502", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Awerbuch:1990:SP, author = "B. Awerbuch and D. Peleg", title = "Sparse partitions", crossref = "IEEE:1990:PAS", volume = "2", pages = "503--513", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Awerbuch:1990:NSP, author = "B. Awerbuch and D. Peleg", title = "Network synchronization with polylogarithmic overhead", crossref = "IEEE:1990:PAS", volume = "2", pages = "514--522", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Zuckerman:1990:GWR, author = "D. Zuckerman", title = "General weak random sources", crossref = "IEEE:1990:PAS", volume = "2", pages = "534--543", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Alon:1990:SCA, author = "N. Alon and O. Goldreich and J. H{\aa}stad and R. Peralta", title = "Simple construction of almost $k$-wise independent random variables", crossref = "IEEE:1990:PAS", volume = "2", pages = "544--553", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Blum:1990:STA, author = "A. Blum", title = "Some tools for approximate $3$-coloring", crossref = "IEEE:1990:PAS", volume = "2", pages = "554--562", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Bellare:1990:RIP, author = "M. Bellare and O. Goldreich and S. Goldwasser", title = "Randomness in interactive proofs", crossref = "IEEE:1990:PAS", volume = "2", pages = "563--572", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Alon:1990:PLP, author = "N. Alon and N. Megiddo", title = "Parallel linear programming in fixed dimension almost surely in constant time", crossref = "IEEE:1990:PAS", volume = "2", pages = "574--582", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Vaidya:1990:RPC, author = "P. M. Vaidya", title = "Reducing the parallel complexity of certain linear programming problems", crossref = "IEEE:1990:PAS", volume = "2", pages = "583--589", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Martel:1990:APA, author = "C. Martel and R. Subramonian and A. Part", title = "Asynchronous {PRAM}s are (almost) as good as synchronous {PRAM}s", crossref = "IEEE:1990:PAS", volume = "2", pages = "590--599", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Alpern:1990:UMH, author = "B. Alpern and L. Carter and E. Feig", title = "Uniform memory hierarchies", crossref = "IEEE:1990:PAS", volume = "2", pages = "600--608", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Haastad:1990:PSD, author = "J. H{\aa}stad and M. Goldmann", title = "On the power of small-depth threshold circuits", crossref = "IEEE:1990:PAS", volume = "2", pages = "610--618", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Yao:1990:ATC, author = "A. C.-C. Yao", title = "{ON} {ACC} and threshold circuits", crossref = "IEEE:1990:PAS", volume = "2", pages = "619--627", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Smolensky:1990:IAF, author = "R. Smolensky", title = "On interpolation by analytic functions with special properties and some weak lower bounds on the size of circuits with symmetric gates", crossref = "IEEE:1990:PAS", volume = "2", pages = "628--631", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Bruck:1990:PTF, author = "J. Bruck and R. Smolensky", title = "Polynomial threshold functions, {AC} functions and spectrum norms", crossref = "IEEE:1990:PAS", volume = "2", pages = "632--641", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Paterson:1990:FCS, author = "M. S. Paterson and N. Pippenger and U. Zwick", title = "Faster circuits and shorter formulae for multiple addition, multiplication and symmetric {Boolean} functions", crossref = "IEEE:1990:PAS", volume = "2", pages = "642--650", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Harel:1990:DPN, author = "D. Harel and D. Raz", title = "Deciding properties of nonregular programs", crossref = "IEEE:1990:PAS", volume = "2", pages = "652--661", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Lincoln:1990:DPP, author = "P. Lincoln and J. Michell and A. Scedrov and N. Shankar", title = "Decision problems for propositional linear logic", crossref = "IEEE:1990:PAS", volume = "2", pages = "662--671", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Maler:1990:TBC, author = "O. Maler and A. Pnueli", title = "Tight bounds on the complexity of cascaded decomposition of automata", crossref = "IEEE:1990:PAS", volume = "2", pages = "672--682", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kaminski:1990:FMA, author = "M. Kaminski and N. Francez", title = "Finite-memory automata", crossref = "IEEE:1990:PAS", volume = "2", pages = "683--688", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Lynch:1990:PSA, author = "J. F. Lynch", title = "Probabilities of sentences about very sparse random graphs", crossref = "IEEE:1990:PAS", volume = "2", pages = "689--696", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Naor:1990:FAO, author = "D. Naor and D. Gusfield and C. Martel", title = "A fast algorithm for optimally increasing the edge-connectivity", crossref = "IEEE:1990:PAS", volume = "2", pages = "698--707", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Frank:1990:AGM, author = "A. Frank", title = "Augmenting graphs to meet edge-connectivity requirements", crossref = "IEEE:1990:PAS", volume = "2", pages = "708--718", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Fredman:1990:TDA, author = "M. L. Fredman and D. E. Willard", title = "Trans-dichotomous algorithms for minimum spanning trees and shortest paths", crossref = "IEEE:1990:PAS", volume = "2", pages = "719--725", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Klein:1990:ATM, author = "P. Klein and A. Agrawal and R. Ravi and S. Rao", title = "Approximation through multicommodity flow", crossref = "IEEE:1990:PAS", volume = "2", pages = "726--737", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Even:1990:CSD, author = "S. Even and A. Litman and P. Winkler", title = "Computing with snakes in directed networks of automata", crossref = "IEEE:1990:PAS", volume = "2", pages = "740--745", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Pneuli:1990:DRS, author = "A. Pneuli and R. Rosner", title = "Distributed reactive systems are hard to synthesize", crossref = "IEEE:1990:PAS", volume = "2", pages = "746--757", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Luo:1990:CCA, author = "Z.-Q. Luo and J. N. Tsitsiklis", title = "Communication complexity of algebraic computation", crossref = "IEEE:1990:PAS", volume = "2", pages = "758--765", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Canetti:1990:BTB, author = "R. Canetti and O. Goldreich", title = "Bounds on tradeoffs between randomness and communication complexity", crossref = "IEEE:1990:PAS", volume = "2", pages = "766--775", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Toda:1990:CFM, author = "S. Toda", title = "The complexity of finding medians", crossref = "IEEE:1990:PAS", volume = "2", pages = "778--787", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Buss:1990:PCA, author = "S. Buss and C. H. Papadimitriou and N. J. Tsitsiklis", title = "On the predictability of coupled automata: an allegory about chaos", crossref = "IEEE:1990:PAS", volume = "2", pages = "788--793", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Papadimitriou:1990:GTL, author = "C. H. Papadimitriou", title = "On graph-theoretic lemmata and complexity classes", crossref = "IEEE:1990:PAS", volume = "2", pages = "794--801", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Gurevich:1990:MDP, author = "Y. Gurevich", title = "Matrix decomposition problem is complete for the average case", crossref = "IEEE:1990:PAS", volume = "2", pages = "802--811", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Impagliazzo:1990:NBW, author = "R. Impagliazzo", title = "No better ways to generate hard {NP} instances than picking uniformly at random", crossref = "IEEE:1990:PAS", volume = "2", pages = "812--821", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Koscielski:1990:CUF, author = "A. Koscielski and L. Pacholski", title = "Complexity of unification in free groups and free semi-groups", crossref = "IEEE:1990:PAS", volume = "2", pages = "824--829", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Vallee:1990:LRA, author = "B. Vallee and P. Flajolet", title = "The lattice reduction algorithm of {Gauss}: an average case analysis", crossref = "IEEE:1990:PAS", volume = "2", pages = "830--839", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Horng:1990:SNR, author = "G. Horng and M.-D. A. Huang", title = "Simplifying nested radicals and solving polynomials by radicals in minimum depth", crossref = "IEEE:1990:PAS", volume = "2", pages = "847--856", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Babai:1990:DFG, author = "L. Babai and G. Hetyei and W. M. Kantor and A. Lubotzky and A. Seress", title = "On the diameter of finite groups", crossref = "IEEE:1990:PAS", volume = "2", pages = "857--865", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Berkman:1990:STL, author = "O. Berkman and J. Jaja and S. Krishnamurthy and R. Thurimella and U. Vishkin", title = "Some triply-logarithmic parallel algorithms", crossref = "IEEE:1990:PAS", volume = "2", pages = "871--881", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Feige:1991:ACA, author = "U. Feige and S. Goldwasser and L. Lovasz and S. Safra and M. Szegedy", title = "Approximating clique is almost {NP}-complete", crossref = "IEEE:1991:PAS", pages = "2--12", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Lapidot:1991:FPM, author = "D. Lapidot and A. Shamir", title = "Fully parallelized multi prover protocols for {NEXP}-time", crossref = "IEEE:1991:PAS", pages = "13--18", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Beigel:1991:LET, author = "R. Beigel and M. Bellare and J. Feigenbaum and S. Goldwasser", title = "Languages that are easier than their proofs", crossref = "IEEE:1991:PAS", pages = "19--28", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Chazelle:1991:OCH, author = "B. Chazelle", title = "An optimal convex hull algorithm and new results on cuttings", crossref = "IEEE:1991:PAS", pages = "29--38", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Hoffmann:1991:AGT, author = "F. Hoffmann and M. Kaufmann and K. Kriegel", title = "The art gallery theorem for polygons with holes", crossref = "IEEE:1991:PAS", pages = "39--48", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Matousek:1991:FTD, author = "J. Matousek and N. Miller and J. Pach and M. Sharir and S. Sifrony and E. Welzl", title = "Fat triangles determine linearly many holes (computational geometry)", crossref = "IEEE:1991:PAS", pages = "49--58", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Goldreich:1991:QKC, author = "O. Goldreich and E. Petrank", title = "Quantifying knowledge complexity", crossref = "IEEE:1991:PAS", pages = "59--68", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Boyar:1991:SZK, author = "J. Boyar and G. Brassard and R. Peralta", title = "Subquadratic zero-knowledge", crossref = "IEEE:1991:PAS", pages = "69--78", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Zuckerman:1991:SBU, author = "D. Zuckerman", title = "Simulating {BPP} using a general weak random source", crossref = "IEEE:1991:PAS", pages = "79--89", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Blum:1991:CCM, author = "M. Blum and W. Evans and P. Gemmell and S. Kannan and M. Naor", title = "Checking the correctness of memories", crossref = "IEEE:1991:PAS", pages = "90--99", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Baruah:1991:LSP, author = "S. Baruah and G. Koren and B. Mishra and A. Raghunathan and L. Rosier and D. Shasha", title = "On-line scheduling in the presence of overload", crossref = "IEEE:1991:PAS", pages = "100--110", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Feldmann:1991:DSP, author = "S. Feldmann and J. Sgall and S.-H. Teng", title = "Dynamic scheduling on parallel machines", crossref = "IEEE:1991:PAS", pages = "111--120", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Vitter:1991:OPD, author = "J. S. Vitter and P. Krishnan", title = "Optimal prefetching via data compression", crossref = "IEEE:1991:PAS", pages = "121--130", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Shmoys:1991:SPM, author = "D. B. Shmoys and J. Wein and D. P. Williamson", title = "Scheduling parallel machines on-line", crossref = "IEEE:1991:PAS", pages = "131--140", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kunde:1991:CRD, author = "M. Kunde", title = "Concentrated regular data streams on grids: sorting and routing near to the bisection bound", crossref = "IEEE:1991:PAS", pages = "141--150", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Wu:1991:CCP, author = "I.-C. Wu and H. T. Kung", title = "Communication complexity for parallel divide-and-conquer", crossref = "IEEE:1991:PAS", pages = "151--162", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Papadimitriou:1991:SST, author = "C. H. Papadimitriou", title = "On selecting a satisfying truth assignment", crossref = "IEEE:1991:PAS", pages = "163--169", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Aizenstein:1991:ELR, author = "H. Aizenstein and L. Pitt", title = "Exact learning of read-twice {DNF} formulas", crossref = "IEEE:1991:PAS", pages = "170--179", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Mulmuley:1991:RMSa, author = "K. Mulmuley", title = "Randomized multidimensional search trees: lazy balancing and dynamic shuffling", crossref = "IEEE:1991:PAS", pages = "180--196", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Schwarzkopf:1991:DMG, author = "O. Schwarzkopf", title = "Dynamic maintenance of geometric structures made easy", crossref = "IEEE:1991:PAS", pages = "197--206", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Matousek:1991:RPH, author = "J. Matousek", title = "Reporting points in halfspaces", crossref = "IEEE:1991:PAS", pages = "207--215", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Mulmuley:1991:RMSb, author = "K. Mulmuley", title = "Randomized multidimensional search trees: further results in dynamic sampling", crossref = "IEEE:1991:PAS", pages = "216--227", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Orlitsky:1991:ICB, author = "A. Orlitsky", title = "Interactive communication: balanced distributions, correlated files, and average-case complexity", crossref = "IEEE:1991:PAS", pages = "228--238", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Feder:1991:ACC, author = "T. Feder and E. Kushilevitz and M. Naor", title = "Amortized communication complexity", crossref = "IEEE:1991:PAS", pages = "239--248", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Edmonds:1991:CCT, author = "J. Edmonds and R. Impagliazzo and S. Rudich and J. Sgall", title = "Communication complexity towards lower bounds on circuit depth", crossref = "IEEE:1991:PAS", pages = "249--257", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Awerbuch:1991:DPC, author = "B. Awerbuch and G. Varghese", title = "Distributed program checking: a paradigm for building self-stabilizing distributed protocols", crossref = "IEEE:1991:PAS", pages = "258--267", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Awerbuch:1991:SSL, author = "B. Awerbuch and B. Patt-Shamir and G. Varghese", title = "Self-stabilization by local checking and correction", crossref = "IEEE:1991:PAS", pages = "268--277", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Wang:1991:ATD, author = "W. Wang", title = "An asynchronous two-dimensional self-correcting cellular automaton", crossref = "IEEE:1991:PAS", pages = "278--285", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Fiat:1991:CAL, author = "A. Fiat and D. P. Foster and H. Karloff and Y. Rabani and Y. Ravid and S. Viswanathan", title = "Competitive algorithms for layered graph traversal", crossref = "IEEE:1991:PAS", pages = "288--297", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Deng:1991:HLU, author = "X. Deng and T. Kameda and C. Papadimitriou", title = "How to learn an unknown environment", crossref = "IEEE:1991:PAS", pages = "298--303", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Klein:1991:WUS, author = "R. Klein", title = "Walking an unknown street with bounded detour", crossref = "IEEE:1991:PAS", pages = "304--313", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Radhakrishnan:1991:BBT, author = "J. Radhakrishnan", title = "Better bounds for threshold formulas", crossref = "IEEE:1991:PAS", pages = "314--323", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Paterson:1991:SMF, author = "M. S. Paterson and U. Zwick", title = "Shrinkage of {de Morgan} formulae under restriction", crossref = "IEEE:1991:PAS", pages = "324--333", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Bshouty:1991:SDT, author = "N. H. Bshouty and R. Cleve and W. Eberly", title = "Size-depth tradeoffs for algebraic formulae", crossref = "IEEE:1991:PAS", pages = "334--341", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kapron:1991:NCM, author = "B. Kapron and S. A. Cook", title = "A new characterization of {Mehlhorn}'s polynomial time functionals", crossref = "IEEE:1991:PAS", pages = "342--347", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Verma:1991:TUH, author = "R. M. Verma", title = "A theory of using history for equational systems with applications", crossref = "IEEE:1991:PAS", pages = "348--357", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Klarlund:1991:PMC, author = "N. Klarlund", title = "Progress measures for complementation $\omega$-automata with applications to temporal logic", crossref = "IEEE:1991:PAS", pages = "358--367", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Emerson:1991:TAM, author = "E. A. Emerson and C. S. Jutla", title = "Tree automata, mu-calculus and determinacy", crossref = "IEEE:1991:PAS", pages = "368--377", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Shoup:1991:LBP, author = "V. Shoup and R. Smolensky", title = "Lower bounds for polynomial evaluation and interpolation problems", crossref = "IEEE:1991:PAS", pages = "378--383", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{vonzurGathen:1991:EEF, author = "J. von zur Gathen", title = "Efficient exponentiation in finite field", crossref = "IEEE:1991:PAS", pages = "384--391", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Morgenstern:1991:ECN, author = "M. Morgenstern", title = "Explicit construction of natural bounded concentrators", crossref = "IEEE:1991:PAS", pages = "392--397", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kahale:1991:BER, author = "N. Kahale", title = "Better expansion for {Ramanujan} graphs", crossref = "IEEE:1991:PAS", pages = "398--404", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Emiris:1991:GAR, author = "I. Emiris and J. Canny", title = "A general approach to removing degeneracies", crossref = "IEEE:1991:PAS", pages = "405--413", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Edelsbrunner:1991:QTA, author = "H. Edelsbrunner and T. S. Tan", title = "A quadratic time algorithm for the minmax length triangulation", crossref = "IEEE:1991:PAS", pages = "414--423", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Matousek:1991:DAB, author = "J. Matousek and E. Welzl and L. Wernisch", title = "Discrepancy and in-approximations for bounded {VC}-dimension", crossref = "IEEE:1991:PAS", pages = "424--430", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Du:1991:BHE, author = "D.-Z. Du and Y. Zhang and Q. Feng", title = "On better heuristic for {Euclidean Steiner} minimum trees", crossref = "IEEE:1991:PAS", pages = "431--439", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Anumann:1991:AOP, author = "Y. Anumann and M. Ben-Or", title = "Asymptotically optimal {PRAM} emulation on faulty hypercubes", crossref = "IEEE:1991:PAS", pages = "440--446", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Goldreich:1991:FTC, author = "O. Goldreich and S. Goldwasser and N. Linial", title = "Fault-tolerant computation in the full information model", crossref = "IEEE:1991:PAS", pages = "447--457", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Leighton:1991:HFT, author = "T. Leighton and Y. Ma and C. G. Plaxton", title = "Highly fault-tolerant sorting circuits", crossref = "IEEE:1991:PAS", pages = "458--469", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Leighton:1991:EAD, author = "T. Leighton and E. J. Schwabe", title = "Efficient algorithms for dynamic allocation of distributed memory", crossref = "IEEE:1991:PAS", pages = "470--479", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Adler:1991:PAL, author = "I. Adler and P. A. Beling", title = "Polynomial algorithms for {LP} over a subring of the algebraic integers with applications to {LP} with circulant matrices", crossref = "IEEE:1991:PAS", pages = "480--487", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Eppstein:1991:DTD, author = "D. Eppstein", title = "Dynamic three-dimensional linear programming", crossref = "IEEE:1991:PAS", pages = "488--494", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Plotkin:1991:FAA, author = "S. A. Plotkin and D. B. Shmoys and E. Tardos", title = "Fast approximation algorithms for fractional packing and covering problems", crossref = "IEEE:1991:PAS", pages = "495--504", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Awerbuch:1991:MCD, author = "B. Awerbuch and L. J. Schulman", title = "The maintenance of common data in a distributed system", crossref = "IEEE:1991:PAS", pages = "505--514", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Naor:1991:OFS, author = "M. Naor and R. M. Roth", title = "Optimal file sharing in distributed networks", crossref = "IEEE:1991:PAS", pages = "515--525", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Herlihy:1991:LCL, author = "M. Herlihy and N. Shavit and O. Waarts", title = "Low contention linearizable counting", crossref = "IEEE:1991:PAS", pages = "526--535", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Miller:1991:UGA, author = "G. L. Miller and S.-H. Teng and S. A. Vavasis", title = "A unified geometric approach to graph separators", crossref = "IEEE:1991:PAS", pages = "538--547", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Hsu:1991:LTA, author = "T.-S. Hsu and V. Ramachandran", title = "A linear time algorithm for triconnectivity augmentation", crossref = "IEEE:1991:PAS", pages = "548--559", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Karger:1991:FHP, author = "D. R. Karger and D. Koller and S. J. Phillips", title = "Finding the hidden path: time bounds for all-pairs shortest paths", crossref = "IEEE:1991:PAS", pages = "560--568", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Lovasz:1991:SPD, author = "L. Lovasz and M. Naor and I. Newman and A. Wigderson", title = "Search problems in the decision tree model", crossref = "IEEE:1991:PAS", pages = "576--585", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Alon:1991:PAV, author = "N. Alon", title = "A parallel algorithmic version of the local lemma", crossref = "IEEE:1991:PAS", pages = "586--593", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Gal:1991:LBC, author = "A. Gal", title = "Lower bounds for the complexity of reliable {Boolean} circuits with noisy gates", crossref = "IEEE:1991:PAS", pages = "594--601", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Reischuk:1991:RCN, author = "R. Reischuk and B. Schmeltz", title = "Reliable computation with noisy circuits and decision trees --- a general $n \log n$ lower bound", crossref = "IEEE:1991:PAS", pages = "602--611", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Sundar:1991:LBD, author = "R. Sundar", title = "A lower bound for the dictionary problem under a hashing model", crossref = "IEEE:1991:PAS", pages = "612--621", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Ben-Amram:1991:LBD, author = "A. M. Ben-Amram and Z. Galil", title = "Lower bounds for data structure problems on {RAMs}", crossref = "IEEE:1991:PAS", pages = "622--631", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Frederickson:1991:ADS, author = "G. N. Frederickson", title = "Ambivalent data structures for dynamic $2$-edge-connectivity and $k$ smallest spanning trees", crossref = "IEEE:1991:PAS", pages = "632--641", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Andersson:1991:FUR, author = "A. Andersson and T. Ottmann", title = "Faster uniquely represented dictionaries", crossref = "IEEE:1991:PAS", pages = "642--649", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Donald:1991:CCH, author = "B. R. Donald and D. R. Chang", title = "On the complexity of computing the homology type of a triangulation", crossref = "IEEE:1991:PAS", pages = "650--661", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Grigoriev:1991:AAN, author = "D. Grigoriev and M. Karpinski", title = "An approximation algorithm for the number of zeros or arbitrary polynomials over {GF$(q)$}", crossref = "IEEE:1991:PAS", pages = "662--669", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Blomer:1991:CSR, author = "J. Blomer", title = "Computing sums of radicals in polynomial time", crossref = "IEEE:1991:PAS", pages = "670--677", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Huang:1991:EAR, author = "M.-D. Huang and D. Ierardi", title = "Efficient algorithms for the {Riemann--Roch} problem and for addition in the {Jacobian} of a curve", crossref = "IEEE:1991:PAS", pages = "678--687", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Johnson:1991:CCP, author = "D. B. Johnson and P. Metaxas", title = "Connected components in {$O(\lg^{3/2 \bmod V} \bmod)$} parallel time for the {CREW PRAM}", crossref = "IEEE:1991:PAS", pages = "688--697", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Gil:1991:TTN, author = "J. Gil and Y. Matias and U. Vishkin", title = "Towards a theory of nearly constant time parallel algorithms", crossref = "IEEE:1991:PAS", pages = "698--710", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Goodrich:1991:UAA, author = "M. T. Goodrich", title = "Using approximation algorithms to design parallel algorithms that may ignore processor allocation", crossref = "IEEE:1991:PAS", pages = "711--722", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Gazit:1991:DPA, author = "H. Gazit", title = "A deterministic parallel algorithm for planar graphs isomorphism", crossref = "IEEE:1991:PAS", pages = "723--732", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Babai:1991:ART, author = "L. Babai and K. Friedl", title = "Approximate representation theory of finite groups", crossref = "IEEE:1991:PAS", pages = "733--742", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Saran:1991:FCW, author = "H. Saran and V. V. Vazirani", title = "Finding $k$-cuts within twice the optimal", crossref = "IEEE:1991:PAS", pages = "743--751", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Shor:1991:HPB, author = "P. W. Shor", title = "How to pack better than best fit: tight bounds for average-case online bin packing", crossref = "IEEE:1991:PAS", pages = "752--759", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Amir:1991:ADM, author = "A. Amir and M. Farach", title = "Adaptive dictionary matching", crossref = "IEEE:1991:PAS", pages = "760--766", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Maass:1991:CPS, author = "W. Maass and G. Schnitger and E. D. Sontag", title = "On the computational power of sigmoid versus {Boolean} threshold circuits", crossref = "IEEE:1991:PAS", pages = "767--776", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Krause:1991:VRC, author = "M. Krause and S. Waack", title = "Variation ranks of communication matrices and lower bounds for depth two circuits having symmetric gates with unbounded fan-in", crossref = "IEEE:1991:PAS", pages = "777--782", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Beigel:1991:ACC, author = "R. Beigel and J. Tarui", title = "On {ACC} (circuit complexity)", crossref = "IEEE:1991:PAS", pages = "783--792", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kanevsky:1991:LMF, author = "A. Kanevsky and R. Tamassia and G. {Di Battista} and J. Chen", title = "On-line maintenance of the four-connected components of a graph", crossref = "IEEE:1991:PAS", pages = "793--801", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Gupta:1991:CPI, author = "A. Gupta and R. Impagliazzo", title = "Computing planar intertwines", crossref = "IEEE:1991:PAS", pages = "802--811", year = "1991", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Arora:1992:PCP, author = "S. Arora and S. Safra", title = "Probabilistic checking of proofs; a new characterization of {NP}", crossref = "IEEE:1992:ASF", pages = "2--13", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Arora:1992:PVH, author = "S. Arora and C. Lund and R. Motwani and M. Sudan and Mario Szegedy", title = "Proof verification and hardness of approximation problems", crossref = "IEEE:1992:ASF", pages = "14--23", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Nisan:1992:UCS, author = "N. Nisan and E. Szemeredi and A. Wigderson", title = "Undirected connectivity in {$O(\log^{1.5}n)$} space", crossref = "IEEE:1992:ASF", pages = "24--29", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Fenner:1992:ICH, author = "S. Fenner and L. Fortnow and S. A. Kurtz", title = "The isomorphism conjecture holds relative to an oracle", crossref = "IEEE:1992:ASF", pages = "30--39", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Buchsbaum:1992:DSB, author = "A. L. Buchsbaum and R. Sundar and R. E. Tarjan", title = "Data structural bootstrapping, linear path compression, and catenable heap ordered double ended queues", crossref = "IEEE:1992:ASF", pages = "40--49", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Rauch:1992:FDB, author = "M. Rauch", title = "Fully dynamic biconnectivity in graphs", crossref = "IEEE:1992:ASF", pages = "50--59", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Eppstein:1992:STS, author = "D. Eppstein", title = "Sparsification --- a technique for speeding up dynamic graph algorithms", crossref = "IEEE:1992:ASF", pages = "60--69", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Hsu:1992:FCT, author = "T. Hsu", title = "On four-connecting a triconnected graph", crossref = "IEEE:1992:ASF", pages = "70--79", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Agarwal:1992:DHS, author = "P. K. Agarwal and D. Eppstein and J. Matousek", title = "Dynamic half-space reporting, geometric optimization, and minimum spanning trees", crossref = "IEEE:1992:ASF", pages = "80--89", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Mulmuley:1992:RGA, author = "K. Mulmuley", title = "Randomized geometric algorithms and pseudo-random generators", crossref = "IEEE:1992:ASF", pages = "90--100", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kant:1992:DPG, author = "G. Kant", title = "Drawing planar graphs using the lmc-ordering", crossref = "IEEE:1992:ASF", pages = "101--110", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Luks:1992:CSM, author = "E. M. Luks", title = "Computing in solvable matrix groups", crossref = "IEEE:1992:ASF", pages = "111--120", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Giesbrecht:1992:FAM, author = "M. Giesbrecht", title = "Fast algorithms for matrix normal forms", crossref = "IEEE:1992:ASF", pages = "121--130", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Bini:1992:IPP, author = "D. Bini and V. Pan", title = "Improved parallel polynomial division and its extensions", crossref = "IEEE:1992:ASF", pages = "131--136", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Aspnes:1992:RCE, author = "J. Aspnes and O. Waarts", title = "Randomized consensus in expected {$O(n \log^2 n)$} operations per processor", crossref = "IEEE:1992:ASF", pages = "137--146", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Aumann:1992:CCF, author = "Y. Aumann and M. O. Rabin", title = "Clock construction in fully asynchronous parallel systems and {PRAM} simulation", crossref = "IEEE:1992:ASF", pages = "147--156", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Jayanti:1992:FTW, author = "P. Jayanti and T. D. Chandra and S. Toueg", title = "Fault-tolerant wait-free shared objects", crossref = "IEEE:1992:ASF", pages = "157--166", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Gradel:1992:HTC, author = "E. Gradel and G. L. McColm", title = "Hierarchies in transitive closure logic, stratified {Datalog} and infinitary logic", crossref = "IEEE:1992:ASF", pages = "167--176", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Alur:1992:BFT, author = "R. Alur and T. A. Henzinger", title = "Back to the future: towards a theory of timed regular languages", crossref = "IEEE:1992:ASF", pages = "177--186", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Pitassi:1992:CHC, author = "T. Pitassi and A. Urquhart", title = "The complexity of the {Hajos} calculus", crossref = "IEEE:1992:ASF", pages = "187--196", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Blum:1992:DTB, author = "A. Blum and H. Karloff and Y. Rabani and M. Saks", title = "A decomposition theorem and bounds for randomized server problems", crossref = "IEEE:1992:ASF", pages = "197--207", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Karlin:1992:MP, author = "A. R. Karlin and S. J. Phillips and P. Raghavan", title = "{Markov} paging", crossref = "IEEE:1992:ASF", pages = "208--217", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Azar:1992:LLB, author = "Y. Azar and A. Z. Broder and A. R. Karlin", title = "On-line load balancing", crossref = "IEEE:1992:ASF", pages = "218--225", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Plaxton:1992:ILB, author = "C. G. Plaxton and B. Poonen and T. Suel", title = "Improved lower bounds for {Shellsort}", crossref = "IEEE:1992:ASF", pages = "226--235", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Miltersen:1992:ACM, author = "P. B. Miltersen and M. Paterson and J. Tarui", title = "The asymptotic complexity of merging networks", crossref = "IEEE:1992:ASF", pages = "236--246", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Galil:1992:TAI, author = "Z. Galil and K. Park", title = "Truly alphabet-independent two-dimensional pattern matching", crossref = "IEEE:1992:ASF", pages = "247--256", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Dubiner:1992:APP, author = "M. Dubiner and U. Zwick", title = "Amplification and percolation (probabilistic {Boolean} functions)", crossref = "IEEE:1992:ASF", pages = "258--267", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Yao:1992:ADT, author = "A. Chi-Chih Yao", title = "Algebraic decision trees and {Euler} characteristics", crossref = "IEEE:1992:ASF", pages = "268--277", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Grolmusz:1992:SCC, author = "V. Grolmusz", title = "Separating the communication complexities of {MOD} $m$ and {MOD} $p$ circuits", crossref = "IEEE:1992:ASF", pages = "278--287", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Coppersmith:1992:LBD, author = "D. Coppersmith and B. Schieber", title = "Lower bounds on the depth of monotone arithmetic computations", crossref = "IEEE:1992:ASF", pages = "288--295", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kahale:1992:SEL, author = "N. Kahale", title = "On the second eigenvalue and linear expansion of regular graphs", crossref = "IEEE:1992:ASF", pages = "296--303", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Rabinovich:1992:QDS, author = "Y. Rabinovich and A. Sinclair and A. Wigderson", title = "Quadratic dynamical systems", crossref = "IEEE:1992:ASF", pages = "304--313", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Friedman:1992:BEP, author = "J. Friedman", title = "On the bit extraction problem", crossref = "IEEE:1992:ASF", pages = "314--319", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Jerrum:1992:MEA, author = "M. Jerrum and U. Vazirani", title = "A mildly exponential approximation algorithm for the permanent", crossref = "IEEE:1992:ASF", pages = "320--326", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{El-Yaniv:1992:CAF, author = "R. El-Yaniv and A. Fiat and R. Karp and G. Turpin", title = "Competitive analysis of financial games", crossref = "IEEE:1992:ASF", pages = "327--333", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Alon:1992:LBC, author = "N. Alon and G. Kalai and M. Ricklin and L. Stockmeyer", title = "Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling", crossref = "IEEE:1992:ASF", pages = "334--343", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Bartal:1992:DSP, author = "Y. Bartal and A. Rosen", title = "The distributed $k$-server problem --- a competitive distributed translator for $k$-server algorithms", crossref = "IEEE:1992:ASF", pages = "344--353", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Marcinkowski:1992:UHC, author = "J. Marcinkowski and L. Pacholski", title = "Undecidability of the {Horn}-clause implication problem", crossref = "IEEE:1992:ASF", pages = "354--362", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kozen:1992:EIP, author = "D. Kozen and J. Palsberg and M. I. Schwartzbach", title = "Efficient inference of partial types", crossref = "IEEE:1992:ASF", pages = "363--371", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{VandenBussche:1992:COC, author = "J. {Van den Bussche} and D. {Van Gucht} and M. Andries and M. Gyssens", title = "On the completeness of object-creating query languages", crossref = "IEEE:1992:ASF", pages = "372--379", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Lenhof:1992:EKC, author = "H.-P. Lenhof and M. Smid", title = "Enumerating the $k$ closest pairs optimally", crossref = "IEEE:1992:ASF", pages = "380--386", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Clarkson:1992:SED, author = "K. L. Clarkson", title = "Safe and effective determinant evaluation", crossref = "IEEE:1992:ASF", pages = "387--395", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Katoh:1992:MMS, author = "N. Katoh and T. Tokuyama and K. Iwano", title = "On minimum and maximum spanning trees of linearly moving points", crossref = "IEEE:1992:ASF", pages = "396--405", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Blum:1992:TCT, author = "M. Blum and O. Goldreich", title = "Towards a computational theory of statistical tests", crossref = "IEEE:1992:ASF", pages = "406--416", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Alon:1992:WBM, author = "N. Alon and Z. Galil and O. Margalit and M. Naor", title = "Witnesses for {Boolean} matrix multiplication and for shortest paths", crossref = "IEEE:1992:ASF", pages = "417--426", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{DeSantis:1992:ZKP, author = "A. {De Santis} and G. Persiano", title = "Zero-knowledge proofs of knowledge without interaction", crossref = "IEEE:1992:ASF", pages = "427--436", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Yap:1992:FUR, author = "C. K. Yap", title = "Fast unimodular reduction: planar integer lattices", crossref = "IEEE:1992:ASF", pages = "437--446", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Blomer:1992:HDR, author = "J. Blomer", title = "How to denest {Ramanujan}'s nested radicals", crossref = "IEEE:1992:ASF", pages = "447--456", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Eberly:1992:EBM, author = "W. Eberly", title = "On efficient band matrix arithmetic", crossref = "IEEE:1992:ASF", pages = "457--463", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Gartner:1992:SAA, author = "B. Gartner", title = "A subexponential algorithm for abstract optimization problems", crossref = "IEEE:1992:ASF", pages = "464--472", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Alon:1992:AAR, author = "N. Alon", title = "The algorithmic aspects of the regularity lemma", crossref = "IEEE:1992:ASF", pages = "473--481", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Lovasz:1992:RCV, author = "L. Lovasz and M. Simonovits", title = "On the randomized complexity of volume and diameter", crossref = "IEEE:1992:ASF", pages = "482--492", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Helmbold:1992:ATN, author = "D. P. Helmbold and N. Littlestone and P. M. Long", title = "Apple tasting and nearly one-sided learning", crossref = "IEEE:1992:ASF", pages = "493--502", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Ar:1992:RAF, author = "S. Ar and R. J. Lipton and R. Rubinfeld and M. Sudan", title = "Reconstructing algebraic functions from mixed data", crossref = "IEEE:1992:ASF", pages = "503--512", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Bshouty:1992:ELF, author = "N. H. Bshouty and R. Cleve", title = "On the exact learning of formulas in parallel", crossref = "IEEE:1992:ASF", pages = "513--522", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Aizenstein:1992:RTD, author = "H. Aizenstein and L. Hellerstein and L. Pitt", title = "Read-thrice {DNF} is hard to learn with membership and equivalence queries", crossref = "IEEE:1992:ASF", pages = "523--532", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Tamaki:1992:ESE, author = "H. Tamaki", title = "Efficient self-embedding of butterfly networks with random faults", crossref = "IEEE:1992:ASF", pages = "533--541", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Leighton:1992:FTS, author = "T. Leighton and B. Maggs and R. Sitaraman", title = "On the fault tolerance of some popular bounded-degree networks", crossref = "IEEE:1992:ASF", pages = "542--552", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Feige:1992:EAH, author = "U. Feige and P. Raghavan", title = "Exact analysis of hot-potato routing", crossref = "IEEE:1992:ASF", pages = "553--562", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Felperin:1992:TWR, author = "S. Felperin and P. Raghavan and E. Upfal", title = "A theory of wormhole routing in parallel computers", crossref = "IEEE:1992:ASF", pages = "563--572", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Mitchell:1992:CSL, author = "J. S. B. Mitchell and C. Piatko and E. M. Arkin", title = "Computing a shortest $k$-link path in a polygon", crossref = "IEEE:1992:ASF", pages = "573--582", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Aggarwal:1992:EMC, author = "A. Aggarwal and A. Bar-Noy and S. Khuller and D. Kravets and B. Schieber", title = "Efficient minimum cost matching using quadrangle inequality", crossref = "IEEE:1992:ASF", pages = "583--592", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Wagener:1992:OPH, author = "H. Wagener", title = "Optimal parallel hull construction for simple polygons in {O}(log log n) time", crossref = "IEEE:1992:ASF", pages = "593--599", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Cole:1992:TBE, author = "R. Cole and R. Hariharan", title = "Tighter bounds on the exact complexity of string matching", crossref = "IEEE:1992:ASF", pages = "600--609", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kenyon:1992:TPR, author = "C. Kenyon and R. Kenyon", title = "Tiling a polygon with rectangles", crossref = "IEEE:1992:ASF", pages = "610--619", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Chvatal:1992:MGS, author = "V. Chvatal and B. Reed", title = "Mick gets some (the odds are on his side) (satisfiability)", crossref = "IEEE:1992:ASF", pages = "620--627", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Hagerup:1992:WMH, author = "T. Hagerup and R. Raman", title = "Waste makes haste: tight bounds for loose parallel sorting", crossref = "IEEE:1992:ASF", pages = "628--637", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Chaudhuri:1992:CPP, author = "S. Chaudhuri and J. Radhakrishnan", title = "The complexity of parallel prefix problems on small domains", crossref = "IEEE:1992:ASF", pages = "638--647", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Cohen:1992:AMF, author = "E. Cohen", title = "Approximate max flow on small depth networks", crossref = "IEEE:1992:ASF", pages = "648--658", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Radzik:1992:NMF, author = "T. Radzik", title = "{Newton}'s method for fractional combinatorial optimization", crossref = "IEEE:1992:ASF", pages = "659--669", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Conforti:1992:CLP, author = "M. Conforti and G. Cornuejols", title = "A class of logic problems solvable by linear programming", crossref = "IEEE:1992:ASF", pages = "670--675", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Toledo:1992:MNL, author = "S. Toledo", title = "Maximizing non-linear concave functions in fixed dimension", crossref = "IEEE:1992:ASF", pages = "676--685", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Ajtai:1992:HES, author = "M. Ajtai and J. Komlos and E. Szemeredi", title = "Halvers and expanders (switching)", crossref = "IEEE:1992:ASF", pages = "686--692", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Ajtai:1992:FTG, author = "M. Ajtai and N. Alon and J. Bruck and R. Cypher and C. T. Ho and M. Naor and E. Szemeredi", title = "Fault tolerant graphs, perfect hash functions and disjoint paths", crossref = "IEEE:1992:ASF", pages = "693--702", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Pan:1992:PCT, author = "V. Y. Pan and J. H. Reif and S. R. Tate", title = "The power of combining the techniques of algebraic and numerical computing: improved approximate multipoint polynomial evaluation and improved multipole algorithms", crossref = "IEEE:1992:ASF", pages = "703--713", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kaltofen:1992:PEP, author = "E. Kaltofen and V. Pan", title = "Processor-efficient parallel solution of linear systems. {II}. {The} positive characteristic and singular cases", crossref = "IEEE:1992:ASF", pages = "714--723", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Blum:1993:LAI, author = "A. Blum and P. Chalasani", title = "An on-line algorithm for improving performance in navigation", crossref = "IEEE:1993:ASF", pages = "2--11", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Irani:1993:VIC, author = "S. Irani and Y. Rabani", title = "On the value of information in coordination games", crossref = "IEEE:1993:ASF", pages = "12--21", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Awerbuch:1993:HDC, author = "B. Awerbuch and Y. Bartal and A. Fiat", title = "{Heat and Dump}: competitive distributed paging", crossref = "IEEE:1993:ASF", pages = "22--31", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Awerbuch:1993:TCL, author = "B. Awerbuch and Y. Azar and S. Plotkin", title = "Throughput-competitive on-line routing", crossref = "IEEE:1993:ASF", pages = "32--40", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Gottlob:1993:NTC, author = "G. Gottlob", title = "{NP} trees and {Carnap}'s modal logic", crossref = "IEEE:1993:ASF", pages = "42--51", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Cosmadakis:1993:LRM, author = "S. S. Cosmadakis", title = "Logical reducibility and monadic {NP}", crossref = "IEEE:1993:ASF", pages = "52--61", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Gupta:1993:GAC, author = "V. Gupta and V. Pratt", title = "Gates accept concurrent behavior", crossref = "IEEE:1993:ASF", pages = "62--71", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Clote:1993:PCH, author = "P. Clote and A. Ignjatovic and B. Kapron", title = "Parallel computable higher type functionals", crossref = "IEEE:1993:ASF", pages = "72--81", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Karker:1993:RSM, author = "D. R. Karker", title = "Random sampling in matroids, with applications to graph connectivity and minimum spanning trees", crossref = "IEEE:1993:ASF", pages = "84--93", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Jerrum:1993:SAG, author = "M. Jerrum and G. B. Sorkin", title = "Simulated annealing for graph bisection", crossref = "IEEE:1993:ASF", pages = "94--103", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Chen:1993:UDP, author = "S. Chen and J. H. Reif", title = "Using difficulty of prediction to decrease computation: fast sort, priority queue and convex hull on entropy bounded inputs", crossref = "IEEE:1993:ASF", pages = "104--112", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Haastad:1993:SE, author = "J. H{\aa}stad", title = "The shrinkage exponent is $2$", crossref = "IEEE:1993:ASF", pages = "114--123", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Haastad:1993:TLB, author = "J. H{\aa}stad and S. Jukna and P. Pudlak", title = "Top-down lower bounds for depth $3$ circuits", crossref = "IEEE:1993:ASF", pages = "124--129", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Smolensky:1993:RLD, author = "R. Smolensky", title = "On representations by low-degree polynomials", crossref = "IEEE:1993:ASF", pages = "130--138", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Agarwala:1993:PTA, author = "R. Agarwala and D. Fernandez-Baca", title = "A polynomial-time algorithm for the perfect phylogeny problem when the number of character states is fixed", crossref = "IEEE:1993:ASF", pages = "140--147", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Bafna:1993:GRS, author = "V. Bafna and P. A. Pevzner", title = "Genome rearrangements and sorting by reversals", crossref = "IEEE:1993:ASF", pages = "148--157", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Teng:1993:ASS, author = "Shang-Hua Teng and F. Yao", title = "Approximating shortest superstrings", crossref = "IEEE:1993:ASF", pages = "158--165", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Raz:1993:LRC, author = "R. Raz and B. Spieker", title = "On the ``log rank''-conjecture in communication complexity", crossref = "IEEE:1993:ASF", pages = "168--176", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Juedes:1993:CDH, author = "D. W. Juedes and J. H. Lutz", title = "The complexity and distribution of hard problems", crossref = "IEEE:1993:ASF", pages = "177--185", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Chaudhuri:1993:SFA, author = "S. Chaudhuri", title = "Sensitive functions and approximate problems", crossref = "IEEE:1993:ASF", pages = "186--193", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Aiek:1993:SPD, author = "Y. Aiek and G. Stupp", title = "Synchronization power depends on the register size", crossref = "IEEE:1993:ASF", pages = "196--205", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Chaudhuri:1993:TLB, author = "S. Chaudhuri and M. Herlihy and N. A. Lynch and M. R. Tuttle", title = "A tight lower bound for $k$-set agreement", crossref = "IEEE:1993:ASF", pages = "206--215", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Poon:1993:SBG, author = "C. K. Poon", title = "Space bounds for graph connectivity problems on node-named {JAG}s and node-ordered {JAG}s", crossref = "IEEE:1993:ASF", pages = "218--227", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Barnes:1993:TSL, author = "G. Barnes and J. A. Edmonds", title = "Time-space lower bounds for directed $s$--$t$ connectivity on {JAG} models", crossref = "IEEE:1993:ASF", pages = "228--237", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Feige:1993:RTS, author = "U. Feige", title = "A randomized time-space tradeoff of {$O\tilde(mR\circ)$} for {USTCON}", crossref = "IEEE:1993:ASF", pages = "238--246", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Cole:1993:OFP, author = "R. Cole and M. Crochemore and Z. Galil and L. Gasieniec and R. Eariharan and S. Muthukrishnan and K. Park and W. Rytter", title = "Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions", crossref = "IEEE:1993:ASF", pages = "248--258", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Klein:1993:LPP, author = "P. N. Klein and S. Subramanian", title = "A linear-processor polylog-time algorithm for shortest paths in planar graphs", crossref = "IEEE:1993:ASF", pages = "259--270", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Aumann:1993:HEA, author = "Y. Aumann and Z. M. Kedum and K. V. Palem and M. O. Rabin", title = "Highly efficient asynchronous execution of large-grained parallel programs", crossref = "IEEE:1993:ASF", pages = "271--280", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Aslam:1993:GBS, author = "J. A. Aslam and S. E. Decatur", title = "General bounds on statistical query learning and {PAC} learning with noise via hypothesis boosting", crossref = "IEEE:1993:ASF", pages = "282--291", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Alon:1993:SSD, author = "N. Alon and S. Ben-David and N. Cesa-Bianchi and D. Haussler", title = "Scale-sensitive dimensions, uniform convergence, and learnability", crossref = "IEEE:1993:ASF", pages = "292--301", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Bshouty:1993:ELM, author = "N. H. Bshouty", title = "Exact learning via the {Monotone} theory", crossref = "IEEE:1993:ASF", pages = "302--311", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Blum:1993:LIK, author = "A. Blum and R. Kannan", title = "Learning an intersection of $k$ halfspaces over a uniform distribution", crossref = "IEEE:1993:ASF", pages = "312--320", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Rajagopalan:1993:PDR, author = "S. Rajagopalan and V. V. Vazirani", title = "Primal-dual {RNC} approximation algorithms for (multi)-set (multi)-cover and covering integer programs", crossref = "IEEE:1993:ASF", pages = "322--331", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Callahan:1993:OPA, author = "P. B. Callahan", title = "Optimal parallel all-nearest-neighbors using the well-separated pair decomposition", crossref = "IEEE:1993:ASF", pages = "332--340", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kaklamanis:1993:UES, author = "C. Kaklamanis and D. Krizanc and S. Rao", title = "Universal emulations with sublogarithmic slowdown", crossref = "IEEE:1993:ASF", pages = "341--350", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Yao:1993:QCC, author = "A. Chi-Chih Yao", title = "Quantum circuit complexity", crossref = "IEEE:1993:ASF", pages = "352--361", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Brassard:1993:QBC, author = "G. Brassard and C. Crepeau and R. Jozsa and D. Langlois", title = "A quantum bit commitment scheme provably unbreakable by both parties", crossref = "IEEE:1993:ASF", pages = "362--371", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Gilleron:1993:SSS, author = "R. Gilleron and S. Tison and M. Tommasi", title = "Solving systems of set constraints with negated subset relationships", crossref = "IEEE:1993:ASF", pages = "372--380", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Halperin:1993:NQB, author = "D. Halperin and M. Sharir", title = "Near-quadratic bounds for the motion planning problem for a polygon in a polygonal environment", crossref = "IEEE:1993:ASF", pages = "382--391", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Chazelle:1993:GDR, author = "B. Chazelle", title = "Geometric discrepancy revisited", crossref = "IEEE:1993:ASF", pages = "392--399", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Bronnimann:1993:PRS, author = "H. Bronnimann and B. Chazelle and J. Matousek", title = "Product range spaces, sensitive sampling, and derandomization", crossref = "IEEE:1993:ASF", pages = "400--409", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Egidi:1993:CTA, author = "L. Egidi", title = "The complexity of the theory of $p$-adic numbers", crossref = "IEEE:1993:ASF", pages = "412--421", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Ge:1993:TEM, author = "Guoqiang Ge", title = "Testing equalities of multiplicative representations in polynomial time", crossref = "IEEE:1993:ASF", pages = "422--426", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Beals:1993:VAM, author = "R. Beals and L. Babai", title = "{Las Vegas} algorithms for matrix groups", crossref = "IEEE:1993:ASF", pages = "427--436", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Radzik:1993:FAG, author = "T. Radzik", title = "Faster algorithms for the generalized network flow problem", crossref = "IEEE:1993:ASF", pages = "438--448", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Gabow:1993:FCS, author = "H. N. Gabow", title = "A framework for cost-scaling algorithms for submodular flow problems", crossref = "IEEE:1993:ASF", pages = "449--458", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Awerbuch:1993:SLC, author = "B. Awerbuch and T. Leighton", title = "A simple local-control approximation algorithm for multicommodity flow", crossref = "IEEE:1993:ASF", pages = "459--468", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Frandsen:1993:DWP, author = "G. S. Frandsen and P. B. Miltersen and S. Skyum", title = "Dynamic word problems", crossref = "IEEE:1993:ASF", pages = "470--479", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Hampapuram:1993:OBW, author = "H. Hampapuram and M. L. Fredman", title = "Optimal bi-weighted binary trees and the complexity of maintaining partial sums", crossref = "IEEE:1993:ASF", pages = "480--485", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Koiran:1993:WVB, author = "P. Koiran", title = "A weak version of the {Blum}, {Shub} and {Smale} model", crossref = "IEEE:1993:ASF", pages = "486--495", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Sharir:1993:ATU, author = "M. Sharir", title = "Almost tight upper bounds for lower envelopes in higher dimensions", crossref = "IEEE:1993:ASF", pages = "498--507", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Hershberger:1993:ECE, author = "J. Hershberger and S. Suri", title = "Efficient computation of {Euclidean} shortest paths in the plane", crossref = "IEEE:1993:ASF", pages = "508--517", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Aronov:1993:UCP, author = "B. Aronov and M. Sharir", title = "The union of convex polyhedra in three dimensions", crossref = "IEEE:1993:ASF", pages = "518--527", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Erickson:1993:BLB, author = "J. Erickson and R. Seidel", title = "Better lower bounds on detecting affine and spherical degeneracies", crossref = "IEEE:1993:ASF", pages = "528--536", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Ben-Amram:1993:WCW, author = "A. M. Ben-Amram and Z. Galil", title = "What can we sort in $o(n \log n)$ time?", crossref = "IEEE:1993:ASF", pages = "538--546", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Chang:1993:BQA, author = "R. Chang and W. I. Gasarch", title = "On bounded queries and approximation", crossref = "IEEE:1993:ASF", pages = "547--556", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Shallcross:1993:NEP, author = "D. Shallcross and V. Pan and Yu Lin-Kriz", title = "The {NC} equivalence of planar integer linear programming and {Euclidean} {GCD}", crossref = "IEEE:1993:ASF", pages = "557--564", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Barvinok:1993:PTA, author = "A. I. Barvinok", title = "A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed", crossref = "IEEE:1993:ASF", pages = "566--572", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{McAllister:1993:CPL, author = "M. McAllister and D. Kirkpatrick and J. Snoeyink", title = "A compact piecewise-linear {Voronoi} diagram for convex sites in the plane", crossref = "IEEE:1993:ASF", pages = "573--582", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Mitchell:1993:RTP, author = "S. A. Mitchell", title = "Refining a triangulation of a planar straight-line graph to eliminate large angles", crossref = "IEEE:1993:ASF", pages = "583--592", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Evans:1993:SPA, author = "W. Evans and L. J. Schulman", title = "Signal propagation, with application to a lower bound on the depth of noisy formulas", crossref = "IEEE:1993:ASF", pages = "594--603", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Halldorsson:1993:DVU, author = "M. M. Halldorsson and J. Radhakrishnan and K. V. Subrahmanyam", title = "Directed vs. undirected monotone contact networks for threshold functions", crossref = "IEEE:1993:ASF", pages = "604--613", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Huang:1993:CRP, author = "Ming-Deh Huang and D. Ierardi", title = "Counting rational points on curves over finite fields", crossref = "IEEE:1993:ASF", pages = "616--625", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Reif:1993:ARR, author = "J. H. Reif", title = "An {$O(n \log^3 n)$} algorithm for the real root problem", crossref = "IEEE:1993:ASF", pages = "626--635", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Awerbuch:1993:NLC, author = "B. Awerbuch and B. Berger and L. Cowen and D. Peleg", title = "Near-linear cost sequential and distributed constructions of sparse neighborhood covers", crossref = "IEEE:1993:ASF", pages = "638--647", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Cohen:1993:FAC, author = "E. Cohen", title = "Fast algorithms for constructing $t$-spanners and paths with stretch $t$", crossref = "IEEE:1993:ASF", pages = "648--658", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Garay:1993:SLT, author = "J. A. Garay and S. Kutten and D. Peleg", title = "A sub-linear time distributed algorithm for minimum-weight spanning trees", crossref = "IEEE:1993:ASF", pages = "659--668", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Franklin:1993:EGG, author = "M. Franklin and Z. Galil and M. Yung", title = "Eavesdropping games: a graph-theoretic approach to privacy in distributed systems", crossref = "IEEE:1993:ASF", pages = "670--679", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Gillman:1993:CBR, author = "D. Gillman", title = "A {Chernoff} bound for random walks on expander graphs", crossref = "IEEE:1993:ASF", pages = "680--691", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kortsarz:1993:CDS, author = "G. Kortsarz and D. Peleg", title = "On choosing a dense subgraph", crossref = "IEEE:1993:ASF", pages = "692--701", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Leiserson:1993:ECA, author = "C. E. Leiserson and S. Rao and S. Toledo", title = "Efficient out-of-core algorithms for linear relaxation using blocking covers", crossref = "IEEE:1993:ASF", pages = "704--713", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Goodrich:1993:EMC, author = "M. T. Goodrich and Jyh-Jong Tsay and D. E. Vengroff and J. S. Vitter", title = "External-memory computational geometry", crossref = "IEEE:1993:ASF", pages = "714--723", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Arora:1993:HAO, author = "S. Arora and L. Babai and J. Stern and Z. Sweedyk", title = "The hardness of approximate optima in lattices, codes, and systems of linear equations", crossref = "IEEE:1993:ASF", pages = "724--733", year = "1993", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Karger:1994:AGC, author = "D. Karger and R. Motwani and M. Sudan", title = "Approximate graph coloring by semidefinite programming", crossref = "Goldwasser:1994:P", pages = "2--13", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Garg:1994:FSC, author = "N. Garg and H. Saran and V. V. Vazirani", title = "Finding separator cuts in planar graphs within twice the optimal", crossref = "Goldwasser:1994:P", pages = "14--23", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Alon:1994:PTR, author = "N. Alon and A. Frieze and D. Welsh", title = "Polynomial time randomised approximation schemes for the {Tutte} polynomial of dense graphs", crossref = "Goldwasser:1994:P", pages = "24--35", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Szegedy:1994:NNL, author = "M. Szegedy", title = "A note on the $\theta$ number of {Lovasz} and the generalized {Delsarte} bound", crossref = "Goldwasser:1994:P", pages = "36--39", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Jackson:1994:EMQ, author = "J. Jackson", title = "An efficient membership-query algorithm for learning {DNF} with respect to the uniform distribution", crossref = "Goldwasser:1994:P", pages = "42--53", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Bshouty:1994:LDG, author = "N. H. Bshouty and Zhixiang Chen and S. Homer", title = "On learning discretized geometric concepts", crossref = "Goldwasser:1994:P", pages = "54--63", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Dhagat:1994:PLI, author = "A. Dhagat and L. Hellerstein", title = "{PAC} learning with irrelevant attributes", crossref = "Goldwasser:1994:P", pages = "64--74", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Bender:1994:PTE, author = "M. A. Bender and D. K. Slonim", title = "The power of team exploration: two robots can learn unlabeled directed graphs", crossref = "Goldwasser:1994:P", pages = "75--85", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Adleman:1994:ANT, author = "L. M. Adleman", title = "Algorithmic number theory-the complexity contribution", crossref = "Goldwasser:1994:P", pages = "88--113", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Simon:1994:PQC, author = "D. R. Simon", title = "On the power of quantum computation", crossref = "Goldwasser:1994:P", pages = "116--123", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Shor:1994:AQC, author = "P. W. Shor", title = "Algorithms for quantum computation: discrete logarithms and factoring", crossref = "Goldwasser:1994:P", pages = "124--134", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Cai:1994:CMP, author = "Jin-yi Cai and R. J. Lipton and Y. Zalcstein", title = "The complexity of the membership problem for $2$-generated commutative semigroups of rational matrices", crossref = "Goldwasser:1994:P", pages = "135--142", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Cai:1994:EAC, author = "Jin-Yi Cai and W. H. Fuchs and D. Kozen and Zicheng Lui", title = "Efficient average-case algorithms for the modular group", crossref = "Goldwasser:1994:P", pages = "143--152", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Eppstein:1994:FKS, author = "D. Eppstein", title = "Finding the $k$ shortest paths", crossref = "Goldwasser:1994:P", pages = "154--165", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kosaraju:1994:LTS, author = "S. R. Kosaraju and J. K. Park and C. Stein", title = "Long tours and short superstrings", crossref = "Goldwasser:1994:P", pages = "166--177", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Weihe:1994:MFP, author = "K. Weihe", title = "Maximum (s,t)-flows in planar networks in {O}(|{V}|log|{V}|) time", crossref = "Goldwasser:1994:P", pages = "178--189", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Cohen:1994:EST, author = "E. Cohen", title = "Estimating the size of the transitive closure in linear time", crossref = "Goldwasser:1994:P", pages = "190--200", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Ravi:1994:RRR, author = "R. Ravi", title = "Rapid rumor ramification: approximating the minimum broadcast time", crossref = "Goldwasser:1994:P", pages = "202--213", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Naor:1994:LCA, author = "M. Naor and A. Wool", title = "The load, capacity and availability of quorum systems", crossref = "Goldwasser:1994:P", pages = "214--225", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Itkis:1994:FLS, author = "G. Itkis and L. Levin", title = "Fast and lean self-stabilizing asynchronous protocols", crossref = "Goldwasser:1994:P", pages = "226--239", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Awerbuch:1994:LOG, author = "B. Awerbuch and Y. Azar", title = "Local optimization of global objectives: competitive distributed deadlock resolution and resource allocation", crossref = "Goldwasser:1994:P", pages = "240--249", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Karger:1994:RCS, author = "D. R. Karger and D. Koller", title = "(De)randomized construction of small sample spaces in {$\cal NC$}", crossref = "Goldwasser:1994:P", pages = "252--263", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Srinivasan:1994:CVW, author = "A. Srinivasan and D. Zuckerman", title = "Computing with very weak random sources", crossref = "Goldwasser:1994:P", pages = "264--275", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Bellare:1994:REO, author = "M. Bellare and J. Rompel", title = "Randomness-efficient oblivious sampling", crossref = "Goldwasser:1994:P", pages = "276--287", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Rubinfeld:1994:RFE, author = "R. Rubinfeld", title = "On the robustness of functional equations", crossref = "Goldwasser:1994:P", pages = "288--299", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Yao:1994:LBM, author = "A. C.-C. Yao", title = "A lower bound for the monotone depth of connectivity", crossref = "Goldwasser:1994:P", pages = "302--308", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Sinha:1994:EOB, author = "R. K. Sinha and J. S. Thathachar", title = "Efficient oblivious branching programs for threshold functions", crossref = "Goldwasser:1994:P", pages = "309--317", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Nisan:1994:PHB, author = "N. Nisan and S. Rudich and M. Saks", title = "Products and help bits in decision trees", crossref = "Goldwasser:1994:P", pages = "318--329", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kleitman:1994:DRB, author = "D. Kleitman and T. Leighton and Y. Ma", title = "On the design of reliable {Boolean} circuits that contain partially unreliable gates", crossref = "Goldwasser:1994:P", pages = "332--346", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Ranade:1994:NTB, author = "A. Ranade and S. Schleimer and D. S. Wilkerson", title = "Nearly tight bounds for wormhole routing", crossref = "Goldwasser:1994:P", pages = "347--355", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Blumofe:1994:SMC, author = "R. D. Blumofe and C. E. Leiserson", title = "Scheduling multithreaded computations by work stealing", crossref = "Goldwasser:1994:P", pages = "356--368", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kutylowski:1994:FFP, author = "M. Kutylowski and K. Lorys and B. Oesterdiekhoff and R. Wanka", title = "Fast and feasible periodic sorting networks of constant depth", crossref = "Goldwasser:1994:P", pages = "369--380", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Blum:1994:PRC, author = "M. Blum and H. Wasserman", title = "Program result-checking: a theory of testing meets a test of theory", crossref = "Goldwasser:1994:P", pages = "382--392", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Koutsoupias:1994:BCA, author = "E. Koutsoupias and C. H. Papadimitriou", title = "Beyond competitive analysis [on-line algorithms]", crossref = "Goldwasser:1994:P", pages = "394--400", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Ajtai:1994:TCA, author = "M. Ajtai and J. Aspnes and C. Dwork and O. Waarts", title = "A theory of competitive analysis for distributed algorithms", crossref = "Goldwasser:1994:P", pages = "401--411", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Awerbuch:1994:LAC, author = "B. Awerbuch and R. Gawlick and T. Leighton and Y. Rabani", title = "On-line admission control and circuit routing for high performance computing and communication", crossref = "Goldwasser:1994:P", pages = "412--423", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Lund:1994:ICO, author = "C. Lund and S. Phillips and N. Reingold", title = "{IP} over connection-oriented networks and distributional paging", crossref = "Goldwasser:1994:P", pages = "424--434", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Micali:1994:CP, author = "S. Micali", title = "{CS} proofs", crossref = "Goldwasser:1994:P", pages = "436--453", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{DeSantis:1994:MFC, author = "A. {De Santis} and G. {Di Crescenzo} and G. Persiano and M. Yung", title = "On monotone formula closure of {SZK}", crossref = "Goldwasser:1994:P", pages = "454--465", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kilian:1994:CBI, author = "J. Kilian", title = "On the complexity of bounded-interaction and noninteractive zero-knowledge proofs", crossref = "Goldwasser:1994:P", pages = "466--477", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kushilevitz:1994:RCM, author = "E. Kushilevitz and S. Micali and R. Ostrovsky", title = "Reducibility and completeness in multi-party private computations", crossref = "Goldwasser:1994:P", pages = "478--489", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Aldous:1994:SWA, author = "D. Aldous and U. Vazirani", title = "``Go with the winners'' algorithms", crossref = "Goldwasser:1994:P", pages = "492--501", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Gartner:1994:RSA, author = "B. Gartner and G. M. Ziegler", title = "Randomized simplex algorithms on {Klee-Minty} cubes", crossref = "Goldwasser:1994:P", pages = "502--510", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Papadimitriou:1994:MPG, author = "C. H. Papadimitriou and P. Raghavan and M. Sudan and H. Tamaki", title = "Motion planning on a graph", crossref = "Goldwasser:1994:P", pages = "511--520", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kleinberg:1994:LPM, author = "J. M. Kleinberg", title = "The localization problem for mobile robots", crossref = "Goldwasser:1994:P", pages = "521--531", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Ben-Or:1994:ACT, author = "M. Ben-Or", title = "Algebraic computation trees in characteristic $p < 0$", crossref = "Goldwasser:1994:P", pages = "534--539", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Neff:1994:ACR, author = "C. A. Neff and J. H. Reif", title = "An {$O(n^{1+\epsilon} \log b)$} algorithm for the complex roots problem", crossref = "Goldwasser:1994:P", pages = "540--547", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Grigoriev:1994:CLB, author = "D. Grigoriev and N. Vorobjov", title = "Complexity lower bounds for computation trees with elementary transcendental function gates", crossref = "Goldwasser:1994:P", pages = "548--552", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Turan:1994:CBF, author = "G. Turan and F. Vatan", title = "On the computation of {Boolean} functions by analog circuits of bounded fan-in", crossref = "Goldwasser:1994:P", pages = "553--564", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Sipser:1994:EC, author = "M. Sipser and D. A. Spielman", title = "Expander codes", crossref = "Goldwasser:1994:P", pages = "566--576", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Linial:1994:GGS, author = "N. Linial and E. London and Y. Rabinovich", title = "The geometry of graphs and some of its algorithmic applications", crossref = "Goldwasser:1994:P", pages = "577--591", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kamath:1994:TBO, author = "A. Kamath and R. Motwani and K. Palem and P. Spirakis", title = "Tail bounds for occupancy and the satisfiability threshold conjecture", crossref = "Goldwasser:1994:P", pages = "592--603", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Albanese:1994:PET, author = "A. Albanese and J. Blomer and J. Edmonds and M. Luby and M. Sudan", title = "Priority encoding transmission", crossref = "Goldwasser:1994:P", pages = "604--612", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Schwentick:1994:GCM, author = "T. Schwentick", title = "Graph connectivity and monadic {NP}", crossref = "Goldwasser:1994:P", pages = "614--622", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Hirshfeld:1994:PTA, author = "Y. Hirshfeld and M. Jerrum and F. Moller", title = "A polynomial-time algorithm for deciding equivalence of normed context-free processes", crossref = "Goldwasser:1994:P", pages = "623--631", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Basu:1994:CAC, author = "S. Basu and R. Pollack and M.-F. Roy", title = "On the combinatorial and algebraic complexity of quantifier elimination", crossref = "Goldwasser:1994:P", pages = "632--641", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Charatonik:1994:SCP, author = "W. Charatonik and L. Pacholski", title = "Set constraints with projections are in {NEXPTIME}", crossref = "Goldwasser:1994:P", pages = "642--653", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kannan:1994:MCP, author = "R. Kannan", title = "{Markov} chains and polynomial time algorithms", crossref = "Goldwasser:1994:P", pages = "656--671", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Chazelle:1994:SAL, author = "B. Chazelle", title = "A spectral approach to lower bounds", crossref = "Goldwasser:1994:P", pages = "674--682", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Amato:1994:PAH, author = "N. M. Amato and M. T. Goodrich and E. A. Ramos", title = "Parallel algorithms for higher-dimensional convex hulls", crossref = "Goldwasser:1994:P", pages = "683--694", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Clarkson:1994:MOS, author = "K. L. Clarkson", title = "More output-sensitive geometric algorithms", crossref = "Goldwasser:1994:P", pages = "695--702", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Arya:1994:RDA, author = "S. Arya and D. M. Mount and M. Smid", title = "Randomized and deterministic algorithms for geometric spanners of small diameter", crossref = "Goldwasser:1994:P", pages = "703--712", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Andersson:1994:NER, author = "A. Andersson and S. Nilsson", title = "A new efficient radix sort", crossref = "Goldwasser:1994:P", pages = "714--721", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Greene:1994:MIH, author = "D. Greene and M. Parnas and F. Yao", title = "Multi-index hashing for information retrieval", crossref = "Goldwasser:1994:P", pages = "722--731", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Erickson:1994:OSC, author = "K. B. Erickson and R. E. Ladner and A. LaMarca", title = "Optimizing static calendar queues", crossref = "Goldwasser:1994:P", pages = "732--743", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Henzinger:1994:FDC, author = "M. R. Henzinger", title = "Fully dynamic cycle-equivalence in graphs", crossref = "Goldwasser:1994:P", pages = "744--755", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Keselman:1994:MAS, author = "D. Keselman and A. Amir", title = "Maximum agreement subtree in a set of evolutionary trees-metrics and efficient algorithms", crossref = "Goldwasser:1994:P", pages = "758--769", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Farach:1994:OET, author = "M. Farach and M. Thorup", title = "Optimal evolutionary tree comparison by sparse dynamic programming", crossref = "Goldwasser:1994:P", pages = "770--779", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kaplan:1994:TPC, author = "H. Kaplan and R. Shamir and R. E. Tarjan", title = "Tractability of parameterized completion problems on chordal and interval graphs: minimum fill-in and physical mapping", crossref = "Goldwasser:1994:P", pages = "780--791", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Beame:1994:LBH, author = "P. Beame and R. Impagliazzo and J. Krajicek and T. Pitassi and P. Pudlak", title = "Lower bounds on {Hilbert}'s {Nullstellensatz} and propositional proofs", crossref = "Goldwasser:1994:P", pages = "794--806", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Allender:1994:MSC, author = "E. Allender and M. Strauss", title = "Measure on small complexity classes, with applications for {BPP}", crossref = "Goldwasser:1994:P", pages = "807--818", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Khanna:1994:SVC, author = "S. Khanna and R. Motwani and M. Sudan and U. Vazirani", title = "On syntactic versus computational views of approximability", crossref = "Goldwasser:1994:P", pages = "819--830", year = "1994", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Valiant:1995:CC, author = "L. G. Valiant", title = "Cognitive computation", crossref = "IEEE:1995:ASF", pages = "2--3", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Lokam:1995:SMM, author = "S. V. Lokam", title = "Spectral methods for matrix rigidity with applications to size-depth tradeoffs and communication complexity", crossref = "IEEE:1995:ASF", pages = "6--15", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Nisan:1995:LBA, author = "N. Nisan and A. Wigderson", title = "Lower bounds on arithmetic circuits via partial derivatives", crossref = "IEEE:1995:ASF", pages = "16--25", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Regan:1995:PGM, author = "K. W. Regan and D. Sivakumar and Jin-Yi Cai", title = "Pseudorandom generators, measure theory, and natural proofs", crossref = "IEEE:1995:ASF", pages = "26--35", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Haken:1995:CBS, author = "A. Haken", title = "Counting bottlenecks to show monotone {P $\neq$ NP}", crossref = "IEEE:1995:ASF", pages = "36--40", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Chor:1995:PIR, author = "B. Chor and O. Goldreich and E. Kushilevitz and M. Sudan", title = "Private information retrieval", crossref = "IEEE:1995:ASF", pages = "41--50", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kzeinberg:1995:DPD, author = "J. Kzeinberg and E. Tardos", title = "Disjoint paths in densely embedded graphs", crossref = "IEEE:1995:ASF", pages = "52--61", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Even:1995:DCA, author = "G. Even and J. Naor and S. Rao and B. Schieber", title = "Divide-and-conquer approximation algorithms via spreading metrics", crossref = "IEEE:1995:ASF", pages = "62--71", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Bhatia:1995:LTS, author = "R. Bhatia and S. Khuller and J. Naor", title = "The loading time scheduling problem", crossref = "IEEE:1995:ASF", pages = "72--81", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Hall:1995:AFS, author = "L. A. Hall", title = "Approximability of flow shop scheduling", crossref = "IEEE:1995:ASF", pages = "82--91", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Benczur:1995:RCW, author = "A. A. Benczur", title = "A representation of cuts within $6/5$ times the edge connectivity with applications", crossref = "IEEE:1995:ASF", pages = "92--102", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Paterson:1995:CRB, author = "M. Paterson and A. Srinivasan", title = "Contention resolution with bounded delay", crossref = "IEEE:1995:ASF", pages = "104--113", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Plaxton:1995:TBD, author = "C. G. Plaxton", title = "Tight bounds for a distributed selection game with applications to fixed-connection machines", crossref = "IEEE:1995:ASF", pages = "114--122", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Reif:1995:EPS, author = "J. H. Reif", title = "Efficient parallel solution of sparse eigenvalue and eigenvector problems", crossref = "IEEE:1995:ASF", pages = "123--132", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Koiran:1995:AVD, author = "P. Koiran", title = "Approximating the volume of definable sets", crossref = "IEEE:1995:ASF", pages = "134--141", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Dagum:1995:OAM, author = "P. Dagum and R. Karp and M. Luby and S. Ross", title = "An optimal algorithm for {Monte Carlo} estimation", crossref = "IEEE:1995:ASF", pages = "142--149", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Luby:1995:MCA, author = "M. Luby and D. Randall and A. Sinclair", title = "{Markov} chain algorithms for planar lattice structures", crossref = "IEEE:1995:ASF", pages = "150--159", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Mahajan:1995:DSP, author = "S. Mahajan and H. Ramesh", title = "Derandomizing semidefinite programming based approximation algorithms", crossref = "IEEE:1995:ASF", pages = "162--169", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Naor:1995:STA, author = "M. Naor and O. Reingold", title = "Synthesizers and their application to the parallel construction of pseudo-random functions", crossref = "IEEE:1995:ASF", pages = "170--181", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Naor:1995:SNO, author = "M. Naor and L. J. Schulman and A. Srinivasan", title = "Splitters and near-optimal derandomization", crossref = "IEEE:1995:ASF", pages = "182--191", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Torng:1995:UAP, author = "E. Torng", title = "A unified analysis of paging and caching", crossref = "IEEE:1995:ASF", pages = "194--203", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Barve:1995:ACP, author = "R. D. Barve and E. F. Grove and J. S. Vitter", title = "Application-controlled paging for a shared cache", crossref = "IEEE:1995:ASF", pages = "204--213", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kalyanasundaram:1995:SPC, author = "B. Kalyanasundaram and K. Pruhs", title = "Speed is as powerful as clairvoyance [scheduling problems]", crossref = "IEEE:1995:ASF", pages = "214--221", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Yannakakis:1995:PDT, author = "M. Yannakakis", title = "Perspectives on database theory", crossref = "IEEE:1995:ASF", pages = "224--246", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Edelsbrunner:1995:ADN, author = "H. Edelsbrunner", title = "Algebraic decomposition of non-convex polyhedra", crossref = "IEEE:1995:ASF", pages = "248--257", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Grigoriev:1995:ILB, author = "D. Grigoriev and M. Karpinski and N. Vorobjov", title = "Improved lower bound on testing membership to a polyhedron by algebraic decision trees", crossref = "IEEE:1995:ASF", pages = "258--265", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Dey:1995:OAC, author = "T. K. Dey and S. Guha", title = "Optimal algorithms for curves on surfaces", crossref = "IEEE:1995:ASF", pages = "266--274", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Barvinok:1995:IGH, author = "A. I. Barvinok", title = "Integral geometry of higher-dimensional polytopes and the average case in combinatorial optimization", crossref = "IEEE:1995:ASF", pages = "275--283", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{vonzurGathen:1995:FPC, author = "J. von zur Gathen and I. Shparlinski", title = "Finding points on curves over finite fields", crossref = "IEEE:1995:ASF", pages = "284--292", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Goldreich:1995:LPQ, author = "O. Goldreich and R. Rubinfeld and M. Sudan", title = "Learning polynomials with queries: {The} highly noisy case", crossref = "IEEE:1995:ASF", pages = "294--303", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Bshouty:1995:SLA, author = "N. H. Bshouty and Y. Mansour", title = "Simple learning algorithms for decision trees and multivariate polynomials", crossref = "IEEE:1995:ASF", pages = "304--311", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Auer:1995:TBD, author = "P. Auer and M. K. Warmuth", title = "Tracking the best disjunction", crossref = "IEEE:1995:ASF", pages = "312--321", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Auer:1995:GRC, author = "P. Auer and N. Cesa-Bianchi and Y. Freund and R. E. Schapire", title = "Gambling in a rigged casino: {The} adversarial multi-armed bandit problem", crossref = "IEEE:1995:ASF", pages = "322--331", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Freund:1995:EAL, author = "Y. Freund and M. Kearns and Y. Mansour and D. Ron and R. Rubinfeld and R. E. Schapire", title = "Efficient algorithms for learning to play repeated games against computationally bounded adversaries", crossref = "IEEE:1995:ASF", pages = "332--341", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Saks:1995:RD, author = "M. Saks and S. Zhou", title = "{RSPACE(S)$_e$ DSPACE(S$^{3/2}$)}", crossref = "IEEE:1995:ASF", pages = "344--353", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Ogihara:1995:SPH, author = "M. Ogihara", title = "Sparse {P}-hard sets yield space-efficient algorithms", crossref = "IEEE:1995:ASF", pages = "354--361", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Cai:1995:RHC, author = "Jin-Yi Cai and D. Sivakumar", title = "The resolution of a {Hartmanis} conjecture", crossref = "IEEE:1995:ASF", pages = "362--371", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Yao:1995:SMR, author = "F. Yao and A. Demers and S. Shenker", title = "A scheduling model for reduced {CPU} energy", crossref = "IEEE:1995:ASF", pages = "374--382", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Awerbuch:1995:LBN, author = "B. Awerbuch and Y. Azar and E. F. Grove and Ming-Yang Kao and P. Krishnan and J. S. Vitter", title = "Load balancing in the {$L_p$} norm", crossref = "IEEE:1995:ASF", pages = "383--391", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Fiat:1995:CAT, author = "A. Fiat and Y. Mansour and A. Rosen and O. Waarts", title = "Competitive access time via dynamic storage rearrangement", crossref = "IEEE:1995:ASF", pages = "392--401", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Arora:1995:RCP, author = "S. Arora", title = "Reductions, codes, {PCP}s, and inapproximability", crossref = "IEEE:1995:ASF", pages = "404--413", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Furer:1995:IHR, author = "M. Furer", title = "Improved hardness results for approximating the chromatic number", crossref = "IEEE:1995:ASF", pages = "414--421", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Bellare:1995:FBP, author = "M. Bellare and O. Goldreich and M. Sudan", title = "Free bits, {PCP}s and non-approximability-towards tight results", crossref = "IEEE:1995:ASF", pages = "422--431", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Bellare:1995:LTC, author = "M. Bellare and D. Coppersmith and J. H{\aa}stad and M. Kiwi and M. Sudan", title = "Linearity testing in characteristic two", crossref = "IEEE:1995:ASF", pages = "432--441", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Beigel:1995:CTN, author = "R. Beigel and D. Eppstein", title = "$3$-coloring in time ${O}(1.3446^n)$: a no-{MIS} algorithm", crossref = "IEEE:1995:ASF", pages = "444--452", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Henzinger:1995:CSF, author = "M. R. Henzinger and T. A. Henzinger and P. W. Kopke", title = "Computing simulations on finite and infinite graphs", crossref = "IEEE:1995:ASF", pages = "453--462", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Subramanian:1995:MCR, author = "C. R. Subramanian", title = "Minimum coloring random and semi-random graphs in polynomial expected time", crossref = "IEEE:1995:ASF", pages = "463--472", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Ajtai:1995:IAA, author = "M. Ajtai and N. Megiddo and O. Waarts", title = "Improved algorithms and analysis for secretary problems and generalizations", crossref = "IEEE:1995:ASF", pages = "473--482", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Latombe:1995:CRC, author = "J.-C. Latombe", title = "Controllability, recognizability, and complexity issues in robot motion planning", crossref = "IEEE:1995:ASF", pages = "484--500", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Orlitsky:1995:CC, author = "A. Orlitsky and J. R. Roche", title = "Coding for computing", crossref = "IEEE:1995:ASF", pages = "502--511", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Alon:1995:LTE, author = "N. Alon and J. Edmonds and M. Luby", title = "Linear time erasure codes with nearly optimal recovery", crossref = "IEEE:1995:ASF", pages = "512--519", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Buhrman:1995:UAS, author = "H. Buhrman and L. Fortnow and L. Torenvliet", title = "Using autoreducibility to separate complexity classes", crossref = "IEEE:1995:ASF", pages = "520--527", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Watrous:1995:ODQ, author = "J. Watrous", title = "On one-dimensional quantum cellular automata", crossref = "IEEE:1995:ASF", pages = "528--537", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Impagliazzo:1995:HCD, author = "R. Impagliazzo", title = "Hard-core distributions for somewhat hard problems", crossref = "IEEE:1995:ASF", pages = "538--545", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Mihail:1995:EAO, author = "M. Mihail and C. Kaklamanis and Satish Rao", title = "Efficient access to optical bandwidth wavelength routing on directed fiber trees, rings, and trees of rings", crossref = "IEEE:1995:ASF", pages = "548--557", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Cole:1995:RBN, author = "R. Cole and B. Maggs and R. Sitaraman", title = "Routing on butterfly networks with random faults", crossref = "IEEE:1995:ASF", pages = "558--570", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Beigel:1995:FDF, author = "R. Beigel and W. Hurwood and N. Kahale", title = "Fault diagnosis in a flash", crossref = "IEEE:1995:ASF", pages = "571--580", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Hannenhalli:1995:TMM, author = "S. Hannenhalli and P. A. Pevzner", title = "Transforming men into mice (polynomial algorithm for genomic distance problem)", crossref = "IEEE:1995:ASF", pages = "581--592", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Beals:1995:AMG, author = "R. Beals", title = "Algorithms for matrix groups and the {Tits} alternative", crossref = "IEEE:1995:ASF", pages = "593--602", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Ferragina:1995:OLS, author = "P. Ferragina and R. Grossi", title = "Optimal on-line search and sublinear time update in string matching", crossref = "IEEE:1995:ASF", pages = "604--612", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Margaritis:1995:RSS, author = "D. Margaritis and S. S. Skiena", title = "Reconstructing strings from substrings in rounds", crossref = "IEEE:1995:ASF", pages = "613--620", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Karp:1995:BVI, author = "R. M. Karp and O. Waarts and G. Zweig", title = "The bit vector intersection problem", crossref = "IEEE:1995:ASF", pages = "621--630", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kosaraju:1995:FAC, author = "S. Rao Kosaraju", title = "Faster algorithms for the construction of parameterized suffix trees", crossref = "IEEE:1995:ASF", pages = "631--638", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Grigni:1995:ASP, author = "M. Grigni and E. Koutsoupias and C. Papadimitriou", title = "An approximation scheme for planar graph {TSP}", crossref = "IEEE:1995:ASF", pages = "640--645", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Okasaki:1995:ALE, author = "C. Okasaki", title = "Amortization, lazy evaluation, and persistence: lists with catenation via lazy linking", crossref = "IEEE:1995:ASF", pages = "646--654", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Andersson:1995:SSM, author = "A. Andersson", title = "Sublogarithmic searching without multiplications", crossref = "IEEE:1995:ASF", pages = "655--663", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Henzinger:1995:FDB, author = "M. R. Henzinger and V. King", title = "Fully dynamic biconnectivity and transitive closure", crossref = "IEEE:1995:ASF", pages = "664--672", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Beimel:1995:LBM, author = "A. Beimel and A. Gal and M. Paterson", title = "Lower bounds for monotone span programs", crossref = "IEEE:1995:ASF", pages = "674--681", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Krause:1995:CBF, author = "M. Krause and P. Pudlak", title = "On computing {Boolean} functions by sparse real polynomials", crossref = "IEEE:1995:ASF", pages = "682--691", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Beame:1995:IDL, author = "P. Beame and R. Impagliazzo and T. Pitassi", title = "Improved depth lower bounds for small distance connectivity", crossref = "IEEE:1995:ASF", pages = "692--701", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kutten:1995:TFL, author = "S. Kutten and D. Peleg", title = "Tight fault locality", crossref = "IEEE:1995:ASF", pages = "704--713", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Schenk:1995:FAA, author = "E. Schenk", title = "Faster approximate agreement with multi-writer registers", crossref = "IEEE:1995:ASF", pages = "714--723", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Galil:1995:RMC, author = "Z. Galil and A. Mayer and Moti Yung", title = "Resolving message complexity of {Byzantine Agreement} and beyond", crossref = "IEEE:1995:ASF", pages = "724--733", year = "1995", bibdate = "Thu Apr 5 06:13:51 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Arora:1996:PTA, author = "S. Arora", title = "Polynomial time approximation schemes for {Euclidean} {TSP} and other geometric problems", crossref = "IEEE:1996:ASF", pages = "2--11", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Frieze:1996:RLA, author = "A. Frieze and R. Kannan", title = "The regularity lemma and approximation schemes for dense problems", crossref = "IEEE:1996:ASF", pages = "12--20", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Arora:1996:NRP, author = "S. Arora and A. Frieze and H. Kaplan", title = "A new rounding procedure for the assignment problem with applications to dense graph arrangement problems", crossref = "IEEE:1996:ASF", pages = "21--30", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kenyon:1996:ASP, author = "C. Kenyon and E. Remila", title = "Approximate strip packing", crossref = "IEEE:1996:ASF", pages = "31--36", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Durr:1996:DPU, author = "C. Durr and M. Santha", title = "A decision procedure for unitary linear quantum cellular automata", crossref = "IEEE:1996:ASF", pages = "38--45", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Aharonov:1996:PSD, author = "D. Aharonov and M. Ben-Or", title = "Polynomial simulations of decohered quantum computers", crossref = "IEEE:1996:ASF", pages = "46--55", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Shor:1996:FTQ, author = "P. W. Shor", title = "Fault-tolerant quantum computation", crossref = "IEEE:1996:ASF", pages = "56--65", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kleinberg:1996:SSU, author = "J. M. Kleinberg", title = "Single-source unsplittable flow", crossref = "IEEE:1996:ASF", pages = "68--77", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Cunningham:1996:OPM, author = "W. H. Cunningham and J. F. Geelen", title = "The optimal path-matching problem", crossref = "IEEE:1996:ASF", pages = "78--85", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kleinberg:1996:SPE, author = "J. Kleinberg and R. Rubinfeld", title = "Short paths in expander graphs", crossref = "IEEE:1996:ASF", pages = "86--95", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Spielmat:1996:SPW, author = "D. A. Spielmat and Shang-Hua Teng", title = "Spectral partitioning works: planar graphs and finite element meshes", crossref = "IEEE:1996:ASF", pages = "96--105", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kogan:1996:CPF, author = "G. Kogan", title = "Computing permanents over fields of characteristic $3$: where and why it becomes difficult", crossref = "IEEE:1996:ASF", pages = "108--114", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Huang:1996:SSP, author = "Ming-Deh Huang and Yiu-Chung Wong", title = "Solving systems of polynomial congruences modulo a large prime", crossref = "IEEE:1996:ASF", pages = "115--124", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Dor:1996:MSR, author = "D. Dor and U. Zwick", title = "Median selection requires $(2+\epsilon)n$ comparisons", crossref = "IEEE:1996:ASF", pages = "125--134", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Andersson:1996:FDS, author = "A. Andersson", title = "Faster deterministic sorting and searching in linear space", crossref = "IEEE:1996:ASF", pages = "135--141", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Vazirani:1996:EAC, author = "V. V. Vazirani and H. Saran and B. S. Rajan", title = "An efficient algorithm for constructing minimal trellises for codes over finite {Abelian} groups", crossref = "IEEE:1996:ASF", pages = "144--153", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Spielman:1996:HFT, author = "D. A. Spielman", title = "Highly fault-tolerant parallel computation", crossref = "IEEE:1996:ASF", pages = "154--163", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Sudan:1996:MLD, author = "M. Sudan", title = "Maximum likelihood decoding of {Reed Solomon} codes", crossref = "IEEE:1996:ASF", pages = "164--172", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Adler:1996:NCT, author = "M. Adler", title = "New coding techniques for improved bandwidth utilization", crossref = "IEEE:1996:ASF", pages = "173--182", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Bartal:1996:PAM, author = "Y. Bartal", title = "Probabilistic approximation of metric spaces and its algorithmic applications", crossref = "IEEE:1996:ASF", pages = "184--193", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Madras:1996:FGB, author = "N. Madras and D. Randall", title = "Factoring graphs to bound mixing rates", crossref = "IEEE:1996:ASF", pages = "194--203", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kannan:1996:SAM, author = "R. Kannan and Guangxing Li", title = "Sampling according to the multivariate normal density", crossref = "IEEE:1996:ASF", pages = "204--212", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Mitzenmacher:1996:LBD, author = "M. Mitzenmacher", title = "Load balancing and density dependent jump {Markov} processes", crossref = "IEEE:1996:ASF", pages = "213--222", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Anderson:1996:TDS, author = "R. J. Anderson", title = "Tree data structures for {N}-body simulation", crossref = "IEEE:1996:ASF", pages = "224--233", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Etzioni:1996:EIG, author = "O. Etzioni and S. Hanks and T. Jiang and R. M. Karp and O. Madani and O. Waarts", title = "Efficient information gathering on the {Internet}", crossref = "IEEE:1996:ASF", pages = "234--243", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Chalasani:1996:AOP, author = "P. Chalasani and S. Jha and I. Saias", title = "Approximate option pricing", crossref = "IEEE:1996:ASF", pages = "244--253", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Therien:1996:TLS, author = "D. Therien and T. Wilke", title = "Temporal logic and semidirect products: an effective characterization of the until hierarchy", crossref = "IEEE:1996:ASF", pages = "256--263", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Grohe:1996:EFV, author = "M. Grohe", title = "Equivalence in finite-variable logics is complete for polynomial time", crossref = "IEEE:1996:ASF", pages = "264--273", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Beame:1996:SIR, author = "P. Beame and T. Pitassi", title = "Simplified and improved resolution lower bounds", crossref = "IEEE:1996:ASF", pages = "274--282", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Rabin:1996:CHA, author = "M. O. Rabin", title = "Computationally hard algebraic problems", crossref = "IEEE:1996:ASF", pages = "284--289", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Cheriyan:1996:AMS, author = "J. Cheriyan and R. Thurimella", title = "Approximating minimum-size $k$-connected spanning subgraphs via matching", crossref = "IEEE:1996:ASF", pages = "292--301", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Garg:1996:AMT, author = "N. Garg", title = "A $3$-approximation for the minimum tree spanning $k$ vertices", crossref = "IEEE:1996:ASF", pages = "302--309", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Even:1996:AAS, author = "G. Even and J. S. Naor and L. Zosin", title = "An $8$-approximation algorithm for the subset feedback vertex set problem", crossref = "IEEE:1996:ASF", pages = "310--319", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Sahinalp:1996:EAD, author = "S. C. Sahinalp and U. Vishkin", title = "Efficient approximate and dynamic matching of patterns using a labeling paradigm", crossref = "IEEE:1996:ASF", pages = "320--328", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Blum:1996:PTA, author = "A. Blum and A. Frieze and R. Kannan and S. Vempala", title = "A polynomial-time algorithm for learning noisy linear threshold functions", crossref = "IEEE:1996:ASF", pages = "330--338", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Goldreich:1996:PTC, author = "O. Goldreich and S. Goldwasser and D. Ron", title = "Property testing and its connection to learning and approximation", crossref = "IEEE:1996:ASF", pages = "339--348", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Beimel:1996:AMA, author = "A. Beimel and F. Bergadano and N. H. Bshouty and E. Kushilevitz and S. Varricchio", title = "On the applications of multiplicity automata in learning", crossref = "IEEE:1996:ASF", pages = "349--358", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Frieze:1996:LLT, author = "A. Frieze and M. Jerrum and R. Kannan", title = "Learning linear transformations", crossref = "IEEE:1996:ASF", pages = "359--368", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{aufderHeide:1996:DRB, author = "F. Meyer auf der Heide and C. Scheideler", title = "Deterministic routing with bounded buffers: turning offline into online protocols", crossref = "IEEE:1996:ASF", pages = "370--379", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Andrews:1996:USR, author = "M. Andrews and B. Awerbuch and A. Fernandez and J. Kleinberg and T. Leighton and Zhiyong Liu", title = "Universal stability results for greedy contention-resolution protocols", crossref = "IEEE:1996:ASF", pages = "380--389", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Broder:1996:GAD, author = "A. Z. Broder and A. M. Frieze and E. Upfal", title = "A general approach to dynamic packet routing with bounded buffers", crossref = "IEEE:1996:ASF", pages = "390--399", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Rabani:1996:PCM, author = "Y. Rabani", title = "Path coloring on the mesh", crossref = "IEEE:1996:ASF", pages = "400--409", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Armoni:1996:DSP, author = "R. Armoni and M. Saks and A. Wigderson and Shiyu Zhou", title = "Discrepancy sets and pseudorandom generators for combinatorial rectangles", crossref = "IEEE:1996:ASF", pages = "412--421", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Agrawal:1996:BIP, author = "M. Agrawal and T. Thierauf", title = "The {Boolean} isomorphism problem", crossref = "IEEE:1996:ASF", pages = "422--430", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Amano:1996:PAM, author = "K. Amano and A. Maruoka", title = "Potential of the approximation method", crossref = "IEEE:1996:ASF", pages = "431--440", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Andersson:1996:SDA, author = "A. Andersson and P. B. Miltersen and S. Riis and M. Thorup", title = "Static dictionaries on {AC}$^0$ {RAMs}: query time $\theta(\sqrt{\log n \log \log n})$ is necessary and sufficient", crossref = "IEEE:1996:ASF", pages = "441--450", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Dor:1996:APA, author = "D. Dor and S. Halperin and U. Zwick", title = "All pairs almost shortest paths", crossref = "IEEE:1996:ASF", pages = "452--461", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Henzinffer:1996:CVC, author = "M. R. Henzinffer and S. Rao and H. N. Gabow", title = "Computing vertex connectivity: new bounds from old techniques", crossref = "IEEE:1996:ASF", pages = "462--471", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Erickson:1996:NLB, author = "J. Erickson", title = "New lower bounds for halfspace emptiness", crossref = "IEEE:1996:ASF", pages = "472--481", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Agarwal:1996:BSP, author = "P. K. Agarwal and E. F. Grove and T. M. Murali and J. S. Vitter", title = "Binary space partitions for fat rectangles", crossref = "IEEE:1996:ASF", pages = "482--491", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Petrank:1996:KC, author = "E. Petrank and G. Tardos", title = "On the knowledge complexity of {$\cal NP$}", crossref = "IEEE:1996:ASF", pages = "494--503", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Canetti:1996:IMC, author = "R. Canetti and R. Gennaro", title = "Incoercible multiparty computation", crossref = "IEEE:1996:ASF", pages = "504--513", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Bellare:1996:PFR, author = "M. Bellare and R. Canetti and H. Krawczyk", title = "Pseudorandom functions revisited: the cascade construction and its concrete security", crossref = "IEEE:1996:ASF", pages = "514--523", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib; https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Alon:1996:GCW, author = "N. Alon and D. N. Kozlov and V. H. Vu", title = "The geometry of coin-weighing problems", crossref = "IEEE:1996:ASF", pages = "524--532", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Cover:1996:UDC, author = "T. M. Cover", title = "Universal data compression and portfolio selection", crossref = "IEEE:1996:ASF", pages = "534--538", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kimbrel:1996:NOP, author = "T. Kimbrel and A. R. Karlin", title = "Near-optimal parallel prefetching and caching", crossref = "IEEE:1996:ASF", pages = "540--549", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Andrews:1996:NAD, author = "M. Andrews and M. A. Bender and L. Zhang", title = "New algorithms for the disk scheduling problem", crossref = "IEEE:1996:ASF", pages = "550--559", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Arge:1996:ODI, author = "L. Arge and J. S. Vitter", title = "Optimal dynamic interval management in external memory", crossref = "IEEE:1996:ASF", pages = "560--569", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Plaxton:1996:FFT, author = "C. G. Plaxton and R. Rajaraman", title = "Fast fault-tolerant concurrent access to shared objects", crossref = "IEEE:1996:ASF", pages = "570--579", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Aumann:1996:FTD, author = "Y. Aumann and M. A. Bender", title = "Fault tolerant data structures", crossref = "IEEE:1996:ASF", pages = "580--589", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Ergun:1996:ACP, author = "F. Ergun and S. R. Kumar and R. Rubinfeld", title = "Approximate checking of polynomials and functional equations", crossref = "IEEE:1996:ASF", pages = "592--601", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kumar:1996:EST, author = "S. R. Kumar and D. Sivakumar", title = "Efficient self-testing\slash self-correction of linear recurrences", crossref = "IEEE:1996:ASF", pages = "602--611", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Rajagopalan:1996:VI, author = "S. Rajagopalan and L. J. Schulman", title = "Verifying identities", crossref = "IEEE:1996:ASF", pages = "612--616", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Trevisan:1996:GAL, author = "L. Trevisan and G. B. Sorkin and M. Sudan and D. P. Williamson", title = "Gadgets, approximation, and linear programming", crossref = "IEEE:1996:ASF", pages = "617--626", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Haastad:1996:CHA, author = "J. H{\aa}stad", title = "Clique is hard to approximate within $n^{1-\epsilon}$", crossref = "IEEE:1996:ASF", pages = "627--636", year = "1996", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Goldberg:1997:BFD, author = "A. V. Goldberg and S. Rao", title = "Beyond the flow decomposition barrier", crossref = "IEEE:1997:ASF", pages = "2--11", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Thorup:1997:USS, author = "M. Thorup", title = "Undirected single source shortest paths in linear time", crossref = "IEEE:1997:ASF", pages = "12--21", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Chazelle:1997:FDA, author = "B. Chazelle", title = "A faster deterministic algorithm for minimum spanning trees", crossref = "IEEE:1997:ASF", pages = "22--31", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Goldberg:1997:FUU, author = "A. V. Goldberg and S. Rao", title = "Flows in undirected unit capacity networks", crossref = "IEEE:1997:ASF", pages = "32--34", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Koiran:1997:RDA, author = "P. Koiran", title = "Randomized and deterministic algorithms for the dimension of algebraic varieties", crossref = "IEEE:1997:ASF", pages = "36--45", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Sander:1997:DPP, author = "T. Sander and M. A. Shokrollahi", title = "Deciding properties of polynomials without factoring", crossref = "IEEE:1997:ASF", pages = "46--55", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Basu:1997:IAQ, author = "S. Basu", title = "An improved algorithm for quantifier elimination over real closed fields", crossref = "IEEE:1997:ASF", pages = "56--65", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kondacs:1997:PQF, author = "A. Kondacs and J. Watrous", title = "On the power of quantum finite state automata", crossref = "IEEE:1997:ASF", pages = "66--75", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Pnueli:1997:TDT, author = "A. Pnueli", title = "Two Decades of Temporal Logic: {Achievements} and Challenges", crossref = "IEEE:1997:ASF", pages = "78--78", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Havlicek:1997:COW, author = "J. Havlicek", title = "Computable obstructions to wait-free computability", crossref = "IEEE:1997:ASF", pages = "80--89", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Gacs:1997:RCA, author = "P. Gacs", title = "Reliable cellular automata with self-organization", crossref = "IEEE:1997:ASF", pages = "90--99", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Alur:1997:ATT, author = "R. Alur and T. A. Henzinger and O. Kupferman", title = "Alternating-time temporal logic", crossref = "IEEE:1997:ASF", pages = "100--109", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Lipton:1997:CSU, author = "R. J. Lipton and P. J. Martino and A. Neitzke", title = "On the complexity of a set-union problem", crossref = "IEEE:1997:ASF", pages = "110--115", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Munro:1997:SRB, author = "J. I. Munro and V. Raman", title = "Succinct representation of balanced parentheses, static trees and planar graphs", crossref = "IEEE:1997:ASF", pages = "118--126", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Indyk:1997:DSC, author = "P. Indyk", title = "Deterministic superimposed coding with applications to pattern matching", crossref = "IEEE:1997:ASF", pages = "127--136", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Farach:1997:OST, author = "M. Farach", title = "Optimal suffix tree construction with large alphabets", crossref = "IEEE:1997:ASF", pages = "137--143", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Amir:1997:PMS, author = "A. Amir and Y. Aumann and G. M. Landau and M. Lewenstein and N. Lewenstein", title = "Pattern matching with swaps", crossref = "IEEE:1997:ASF", pages = "144--153", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Dey:1997:IBP, author = "T. K. Dey", title = "Improved bounds on planar $k$-sets and $k$-levels", crossref = "IEEE:1997:ASF", pages = "156--161", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Khachiyan:1997:CIP, author = "L. Khachiyan and L. Porkolab", title = "Computing integral points in convex semi-algebraic sets", crossref = "IEEE:1997:ASF", pages = "162--171", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Hass:1997:CCK, author = "J. Hass and J. C. Lagarias and N. Pippenger", title = "The computational complexity of knot and link problems", crossref = "IEEE:1997:ASF", pages = "172--181", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Varadarajan:1997:ASP, author = "K. R. Varadarajan and P. K. Agarwal", title = "Approximating shortest paths on a nonconvex polyhedron", crossref = "IEEE:1997:ASF", pages = "182--191", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Czumaj:1997:RAP, author = "A. Czumaj and V. Stemann", title = "Randomized allocation processes", crossref = "IEEE:1997:ASF", pages = "194--203", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Achlioptas:1997:ALC, author = "D. Achlioptas and M. Molloy", title = "The analysis of a list-coloring algorithm on a random graph", crossref = "IEEE:1997:ASF", pages = "204--212", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Goldberg:1997:CRG, author = "L. A. Goldberg and P. D. MacKenzie", title = "Contention resolution with guaranteed constant expected delay", crossref = "IEEE:1997:ASF", pages = "213--222", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Bubley:1997:PCT, author = "R. Bubley and M. Dyer", title = "Path coupling: {A} technique for proving rapid mixing in {Markov} chains", crossref = "IEEE:1997:ASF", pages = "223--231", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Raz:1997:SMN, author = "R. Raz and P. McKenzie", title = "Separation of the monotone {NC} hierarchy", crossref = "IEEE:1997:ASF", pages = "234--243", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Reinhardt:1997:MNU, author = "K. Reinhardt and E. Allender", title = "Making nondeterminism unambiguous", crossref = "IEEE:1997:ASF", pages = "244--253", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Bonet:1997:NFI, author = "M. L. Bonet and T. Pitassi and R. Raz", title = "No feasible interpolation for {TC$^0$-Frege} proofs", crossref = "IEEE:1997:ASF", pages = "254--263", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Andreev:1997:WRS, author = "A. E. Andreev and A. E. F. Clementi and J. D. P. Rolim and L. Trevisan", title = "Weak random sources, hitting sets, and {BPP} simulations", crossref = "IEEE:1997:ASF", pages = "264--272", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Bornstein:1997:PEO, author = "C. Bornstein and B. Maggs and G. Miller and R. Ravi", title = "Parallelizing elimination orders with linear fill", crossref = "IEEE:1997:ASF", pages = "274--283", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Maggs:1997:ELD, author = "B. M. Maggs and F. Meyer auf der Heide and B. Vocking and M. Westermann", title = "Exploiting locality for data management in systems of limited bandwidth", crossref = "IEEE:1997:ASF", pages = "284--293", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Andrews:1997:GDR, author = "M. Andrews and A. Fernandez and M. Harchol-Balter and T. Leighton and L. Zhang", title = "General dynamic routing with per-packet delay guarantees of {$O({\rm distance} + 1/{\rm session rate})$}", crossref = "IEEE:1997:ASF", pages = "294--302", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Bartal:1997:GOU, author = "Y. Bartal and J. W. Byers and D. Raz", title = "Global optimization using local information with applications to flow control", crossref = "IEEE:1997:ASF", pages = "303--312", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Goldwasser:1997:NDC, author = "S. Goldwasser", title = "New directions in cryptography: twenty some years later (or cryptography and complexity theory: a match made in heaven)", crossref = "IEEE:1997:ASF", pages = "314--324", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Fiat:1997:TOP, author = "A. Fiat and M. Mendel", title = "Truly online paging with locality of reference", crossref = "IEEE:1997:ASF", pages = "326--335", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Al-Binali:1997:CAR, author = "S. Al-Binali", title = "The competitive analysis of risk taking with applications to online trading", crossref = "IEEE:1997:ASF", pages = "336--344", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kalyanasundaram:1997:MFT, author = "B. Kalyanasundaram and K. R. Pruhs", title = "Minimizing flow time nonclairvoyantly", crossref = "IEEE:1997:ASF", pages = "345--352", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kleinberg:1997:SME, author = "J. Kleinberg and R. Motwani and P. Raghavan and S. Venkatasubramanian", title = "Storage management for evolving databases", crossref = "IEEE:1997:ASF", pages = "353--362", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kushilevitz:1997:RNS, author = "E. Kushilevitz and R. Ostrovsky", title = "Replication is not needed: single database, computationally-private information retrieval", crossref = "IEEE:1997:ASF", pages = "364--373", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Bellare:1997:DPR, author = "M. Bellare and R. Impagliazzo and M. Naor", title = "Does parallel repetition lower the error in computationally sound protocols?", crossref = "IEEE:1997:ASF", pages = "374--383", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Frankel:1997:ORP, author = "Y. Frankel and P. Gemmell and P. D. MacKenzie and Moti Yung", title = "Optimal-resilience proactive public-key cryptosystems", crossref = "IEEE:1997:ASF", pages = "384--393", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Bellare:1997:CST, author = "M. Bellare and A. Desai and E. Jokipii and P. Rogaway", title = "A concrete security treatment of symmetric encryption", crossref = "IEEE:1997:ASF", pages = "394--403", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib; https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Karloff:1997:AAM, author = "H. Karloff and U. Zwick", title = "A $7/8$-approximation algorithm for {MAX 3SAT}?", crossref = "IEEE:1997:ASF", pages = "406--415", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Srinivasan:1997:IAE, author = "A. Srinivasan", title = "Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems", crossref = "IEEE:1997:ASF", pages = "416--425", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kolliopoulos:1997:IAA, author = "S. G. Kolliopoulos and C. Stein", title = "Improved approximation algorithms for unsplittable flow problems", crossref = "IEEE:1997:ASF", pages = "426--436", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Fischlin:1997:LBS, author = "M. Fischlin", title = "Lower bounds for the signature size of incremental schemes", crossref = "IEEE:1997:ASF", pages = "438--447", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Sahai:1997:CPP, author = "A. Sahai and S. P. Vadhan", title = "A complete promise problem for statistical zero-knowledge", crossref = "IEEE:1997:ASF", pages = "448--457", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Naor:1997:NTC, author = "M. Naor and O. Reingold", title = "Number-theoretic constructions of efficient pseudo-random functions", crossref = "IEEE:1997:ASF", pages = "458--467", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Cai:1997:IWC, author = "Jin-Yi Cai and A. P. Nerurkar", title = "An improved worst-case to average-case connection for lattice problems", crossref = "IEEE:1997:ASF", pages = "468--477", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Conforti:1997:FEH, author = "M. Conforti and G. Cornuejols and A. Kapoor and K. Vuskovic", title = "Finding an even hole in a graph", crossref = "IEEE:1997:ASF", pages = "480--485", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Bang-Jensen:1997:ECA, author = "J. Bang-Jensen and T. Jordan", title = "Edge-connectivity augmentation preserving simplicity", crossref = "IEEE:1997:ASF", pages = "486--495", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Umans:1997:HCS, author = "C. Umans and W. Lenhart", title = "{Hamiltonian} cycles in solid grid graphs", crossref = "IEEE:1997:ASF", pages = "496--505", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Vempala:1997:RSB, author = "S. Vempala", title = "A random sampling based algorithm for learning the intersection of half-spaces", crossref = "IEEE:1997:ASF", pages = "508--513", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Cohen:1997:LNP, author = "E. Cohen", title = "Learning noisy perceptrons by a perceptron in polynomial time", crossref = "IEEE:1997:ASF", pages = "514--523", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Ambainis:1997:NTB, author = "A. Ambainis and R. Desper and M. Farach and S. Kannan", title = "Nearly tight bounds on the learnability of evolution", crossref = "IEEE:1997:ASF", pages = "524--533", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Naor:1997:IAS, author = "J. Naor and B. Schieber", title = "Improved approximations for shallow-light spanning trees", crossref = "IEEE:1997:ASF", pages = "536--541", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Awerbuch:1997:BBN, author = "B. Awerbuch and Y. Azar", title = "Buy-at-bulk network design", crossref = "IEEE:1997:ASF", pages = "542--547", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Naor:1997:AAD, author = "J. Naor and L. Zosin", title = "A $2$-approximation algorithm for the directed multiway cut problem", crossref = "IEEE:1997:ASF", pages = "548--553", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Arora:1997:NLT, author = "S. Arora", title = "Nearly linear time approximation schemes for {Euclidean} {TSP} and other geometric problems", crossref = "IEEE:1997:ASF", pages = "554--563", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Paturi:1997:SCL, author = "R. Paturi and P. Pudlak and F. Zane", title = "Satisfiability Coding Lemma", crossref = "IEEE:1997:ASF", pages = "566--574", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Hemaspaandra:1997:MPB, author = "E. Hemaspaandra and G. Wechsung", title = "The minimization problem for {Boolean} formulas", crossref = "IEEE:1997:ASF", pages = "575--584", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Radhakrishnan:1997:TBD, author = "J. Radhakrishnan and A. Ta-Shma", title = "Tight bounds for depth-two superconcentrators", crossref = "IEEE:1997:ASF", pages = "585--594", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Cai:1997:CDC, author = "Jin-Yi Cai and D. Sivakumar and M. Strauss", title = "Constant depth circuits and the {Lutz} hypothesis", crossref = "IEEE:1997:ASF", pages = "595--604", year = "1997", bibdate = "Thu Apr 5 06:13:52 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Matousek:1998:GCA, author = "J. Matousek", title = "Geometric Computation And The Art Of Sampling (tutorial)", crossref = "IEEE:1998:ASF", pages = "2--2", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kearns:1998:TTI, author = "M. Kearns", title = "A Tutorial On Theoretical Issues In Probabilistic Artificial Intelligence", crossref = "IEEE:1998:ASF", pages = "4--4", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Broder:1998:IRW, author = "A. Broder and M. R. Henzinger", title = "Information Retrieval on the {Web}", crossref = "IEEE:1998:ASF", pages = "6--6", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Guruswami:1998:TCN, author = "V. Guruswami and D. Lewin and M. Sudan and L. Trevisan", title = "A tight characterization of {NP} with $3$ query {PCP}s", crossref = "IEEE:1998:ASF", pages = "8--17", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Sudan:1998:PCP, author = "M. Sudan and L. Trevisan", title = "Probabilistically checkable proofs with low amortized query complexity", crossref = "IEEE:1998:ASF", pages = "18--27", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Guruswami:1998:IDR, author = "V. Guruswami and M. Sudan", title = "Improved decoding of {Reed--Solomon} and algebraic-geometric codes", crossref = "IEEE:1998:ASF", pages = "28--37", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Andrews:1998:AND, author = "M. Andrews and L. Zhang", title = "The access network design problem", crossref = "IEEE:1998:ASF", pages = "40--49", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Mansour:1998:JCQ, author = "Y. Mansour and B. Patt-Shamir", title = "Jitter control in {QoS} networks", crossref = "IEEE:1998:ASF", pages = "50--59", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Gamarnik:1998:SAQ, author = "D. Gamarnik", title = "Stability of adversarial queues via fluid models", crossref = "IEEE:1998:ASF", pages = "60--70", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Albers:1998:DIA, author = "S. Albers and M. Charikar and M. Mitzenmacher", title = "Delayed information and action in on-line algorithms", crossref = "IEEE:1998:ASF", pages = "71--80", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Unger:1998:CAB, author = "W. Unger", title = "The complexity of the approximation of the bandwidth problem", crossref = "IEEE:1998:ASF", pages = "82--91", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Micciancio:1998:SVL, author = "D. Micciancio", title = "The shortest vector in a lattice is hard to approximate to within some constant", crossref = "IEEE:1998:ASF", pages = "92--98", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Dinur:1998:ACW, author = "I. Dinur and G. Kindler and S. Safra", title = "Approximating-{CVP} to within almost-polynomial factors is {NP}-hard", crossref = "IEEE:1998:ASF", pages = "99--109", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Gutierrez:1998:SWE, author = "C. Gutierrez", title = "Satisfiability of word equations with constants is in exponential space", crossref = "IEEE:1998:ASF", pages = "112--119", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Senizergues:1998:DBE, author = "G. Senizergues", title = "Decidability of bisimulation equivalence for equational graphs of finite out-degree", crossref = "IEEE:1998:ASF", pages = "120--129", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Bouziane:1998:PRA, author = "Z. Bouziane", title = "A primitive recursive algorithm for the general {Petri} net reachability problem", crossref = "IEEE:1998:ASF", pages = "130--136", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Szegedy:1998:ATI, author = "M. Szegedy", title = "Algorithms to tile the infinite grid with finite clusters", crossref = "IEEE:1998:ASF", pages = "137--145", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Indyk:1998:ANN, author = "P. Indyk", title = "On approximate nearest neighbors in non-{Euclidean} spaces", crossref = "IEEE:1998:ASF", pages = "148--155", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Cardoze:1998:PMS, author = "D. E. Cardoze and L. J. Schulman", title = "Pattern matching for spatial point sets", crossref = "IEEE:1998:ASF", pages = "156--165", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Indyk:1998:FAS, author = "P. Indyk", title = "Faster algorithms for string matching problems: matching the convolution bound", crossref = "IEEE:1998:ASF", pages = "166--173", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Farach:1998:OMB, author = "M. Farach and P. Ferragina and S. Muthukrishnan", title = "Overcoming the memory bottleneck in suffix tree construction", crossref = "IEEE:1998:ASF", pages = "174--183", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Blaser:1998:BPM, author = "M. Blaser", title = "Bivariate polynomial multiplication", crossref = "IEEE:1998:ASF", pages = "186--191", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Olshevsky:1998:USA, author = "V. Olshevsky and V. Pan", title = "A unified superfast algorithm for boundary rational tangential interpolation problems and for inversion and factorization of dense structured matrices", crossref = "IEEE:1998:ASF", pages = "192--201", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Woods:1998:USE, author = "A. R. Woods", title = "Unsatisfiable systems of equations, over a finite field", crossref = "IEEE:1998:ASF", pages = "202--211", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Schonhage:1998:MCT, author = "A. Schonhage", title = "Multiplicative complexity of {Taylor} shifts and a new twist of the substitution method", crossref = "IEEE:1998:ASF", pages = "212--215", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kannan:1998:LSS, author = "R. Kannan and A. Nolte", title = "Local search in smooth convex sets", crossref = "IEEE:1998:ASF", pages = "218--226", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Cai:1998:TSA, author = "Mao-Cheng Cai and Xiaotie Deng and Wenan Zang", title = "A {TDI} system and its application to approximation algorithms", crossref = "IEEE:1998:ASF", pages = "227--231", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Smith:1998:GST, author = "W. D. Smith and N. C. Wormald", title = "Geometric separator theorems and applications", crossref = "IEEE:1998:ASF", pages = "232--243", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Brieden:1998:ADR, author = "A. Brieden and P. Gritzmann and R. Kannan and V. Klee and L. Lovasz and M. Simonovits", title = "Approximation of diameters: randomization doesn't help", crossref = "IEEE:1998:ASF", pages = "244--251", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Beame:1998:TST, author = "P. Beame and M. Saks and J. S. Thathachar", title = "Time-space tradeoffs for branching programs", crossref = "IEEE:1998:ASF", pages = "254--263", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Pagter:1998:OTS, author = "J. Pagter and T. Rauhe", title = "Optimal time-space trade-offs for sorting", crossref = "IEEE:1998:ASF", pages = "264--268", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Grigoriev:1998:ECL, author = "D. Grigoriev and A. A. Razborov", title = "Exponential complexity lower bounds for depth $3$ arithmetic circuits in algebras of functions over finite fields", crossref = "IEEE:1998:ASF", pages = "269--278", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Grolmusz:1998:LBM, author = "V. Grolmusz and G. Tardos", title = "Lower bounds for ({MOD $p$--MOD $m$}) circuits", crossref = "IEEE:1998:ASF", pages = "279--288", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Dinitz:1998:SSU, author = "Y. Dinitz and N. Garg and M. X. Goemans", title = "On the single-source unsplittable flow problem", crossref = "IEEE:1998:ASF", pages = "290--299", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Garg:1998:FSA, author = "N. Garg and J. Konemann", title = "Faster and simpler algorithms for multicommodity flow and other fractional packing problems", crossref = "IEEE:1998:ASF", pages = "300--309", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Zwick:1998:APS, author = "U. Zwick", title = "All pairs shortest paths in weighted directed graphs-exact and almost exact algorithms", crossref = "IEEE:1998:ASF", pages = "310--319", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Varadarajan:1998:DCA, author = "K. R. Varadarajan", title = "A divide-and-conquer algorithm for min-cost perfect matching in the plane", crossref = "IEEE:1998:ASF", pages = "320--329", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Ambainis:1998:WQF, author = "A. Ambainis and R. Freivalds", title = "$1$-way quantum finite automata: strengths, weaknesses and generalizations", crossref = "IEEE:1998:ASF", pages = "332--341", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Ambainis:1998:QCC, author = "A. Ambainis and L. J. Schulman and A. Ta-Shma and U. Vazirani and A. Wigderson", title = "The quantum communication complexity of sampling", crossref = "IEEE:1998:ASF", pages = "342--351", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Beals:1998:QLB, author = "R. Beals and H. Buhrman and R. Cleve and M. Mosca and R. de Wolf", title = "Quantum lower bounds by polynomials", crossref = "IEEE:1998:ASF", pages = "352--361", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{vanDam:1998:QOI, author = "W. van Dam", title = "Quantum oracle interrogation: getting all information for almost half the price", crossref = "IEEE:1998:ASF", pages = "362--367", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Frieze:1998:FMC, author = "A. Frieze and R. Kannan and S. Vempala", title = "Fast {Monte-Carlo} algorithms for finding low-rank approximations", crossref = "IEEE:1998:ASF", pages = "370--378", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Charikar:1998:AFM, author = "M. Charikar and C. Chekuri and A. Goel and S. Guha and S. Plotkin", title = "Approximating a finite metric by a small number of tree metrics", crossref = "IEEE:1998:ASF", pages = "379--388", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Vempala:1998:RPN, author = "S. Vempala", title = "Random projection: a new approach to {VLSI} layout", crossref = "IEEE:1998:ASF", pages = "389--395", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Thorup:1998:MGP, author = "M. Thorup", title = "Map graphs in polynomial time", crossref = "IEEE:1998:ASF", pages = "396--405", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Blum:1998:LMB, author = "A. Blum and C. Burcht and J. Langford", title = "On learning monotone {Boolean} functions", crossref = "IEEE:1998:ASF", pages = "408--415", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Jiang:1998:OQA, author = "Tao Jiang and P. Kearney and Ming Li", title = "Orchestrating quartets: approximation and data correction", crossref = "IEEE:1998:ASF", pages = "416--425", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Goldreich:1998:TM, author = "O. Goldreich and S. Goldwassert and E. Lehman and D. Ron", title = "Testing monotonicity", crossref = "IEEE:1998:ASF", pages = "426--435", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Cryan:1998:ETC, author = "M. Cryan and L. A. Goldberg and P. W. Goldberg", title = "Evolutionary trees can be learned in polynomial time in the two-state general {Markov} model", crossref = "IEEE:1998:ASF", pages = "436--445", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Jain:1998:FAA, author = "K. Jain", title = "A factor $2$ approximation algorithm for the generalized {Steiner} network problem", crossref = "IEEE:1998:ASF", pages = "448--457", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Charikar:1998:FCD, author = "M. Charikar and B. Raghavachari", title = "The finite capacity dial-a-ride problem", crossref = "IEEE:1998:ASF", pages = "458--467", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{delaVega:1998:RAS, author = "W. Fernandez de la Vega and C. Kenyon", title = "A randomized approximation scheme for metric {MAX}-{CUT}", crossref = "IEEE:1998:ASF", pages = "468--471", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Skutella:1998:SRP, author = "M. Skutella", title = "Semidefinite relaxations for parallel machine scheduling", crossref = "IEEE:1998:ASF", pages = "472--481", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kilian:1998:LBZ, author = "J. Kilian and E. Petrank and C. Rackoff", title = "Lower bounds for zero knowledge on the {Internet}", crossref = "IEEE:1998:ASF", pages = "484--492", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Cachin:1998:OTM, author = "C. Cachin and C. Crepeau and J. Marcil", title = "Oblivious transfer with a memory-bounded receiver", crossref = "IEEE:1998:ASF", pages = "493--502", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Mayers:1998:QCI, author = "D. Mayers and A. Yao", title = "Quantum cryptography with imperfect apparatus", crossref = "IEEE:1998:ASF", pages = "503--509", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Haastad:1998:SIR, author = "J. H{\aa}stad and M. Naslund", title = "The security of individual {RSA} bits", crossref = "IEEE:1998:ASF", pages = "510--519", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Adler:1998:PAC, author = "M. Adler and B. M. Maggs", title = "Protocols for asymmetric communication channels", crossref = "IEEE:1998:ASF", pages = "522--533", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Alstrup:1998:MAP, author = "S. Alstrup and T. Husfeldt and T. Rauhe", title = "Marked ancestor problems", crossref = "IEEE:1998:ASF", pages = "534--543", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Carter:1998:TOB, author = "L. Carter and K. S. Gatlin", title = "Towards an optimal bit-reversal permutation program", crossref = "IEEE:1998:ASF", pages = "544--553", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Umans:1998:MED, author = "C. Umans", title = "The minimum equivalent {DNF} problem and shortest implicants", crossref = "IEEE:1998:ASF", pages = "556--563", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{deAlfaro:1998:CRG, author = "L. de Alfaro and T. A. Henzinger and O. Kupferman", title = "Concurrent reachability games", crossref = "IEEE:1998:ASF", pages = "564--575", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Russell:1998:PIL, author = "A. Russell and D. Zuckerman", title = "Perfect information leader election in {$\log n + O(1)$} rounds", crossref = "IEEE:1998:ASF", pages = "576--583", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Chan:1998:RSH, author = "T. M. Chan", title = "Random sampling, halfspace range reporting, and construction of ($\leq k$)-levels in three dimensions", crossref = "IEEE:1998:ASF", pages = "586--595", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Agarwal:1998:PKM, author = "P. K. Agarwal and D. Eppstein and L. J. Guibas and M. R. Henzinger", title = "Parametric and kinetic minimum spanning trees", crossref = "IEEE:1998:ASF", pages = "596--605", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Basu:1998:CTC, author = "S. Basu", title = "On the combinatorial and topological complexity of a single cell", crossref = "IEEE:1998:ASF", pages = "606--616", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Pach:1998:WCN, author = "J. Pach and G. Toth", title = "Which crossing number is it, anyway? [computational geometry]", crossref = "IEEE:1998:ASF", pages = "617--626", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Paturi:1998:IET, author = "R. Paturi and P. Pudlik and M. E. Saks and F. Zane", title = "An improved exponential-time algorithm for $k$-{SAT}", crossref = "IEEE:1998:ASF", pages = "628--637", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Bonet:1998:ESB, author = "M. L. Bonet and J. L. Esteban and N. Galesi and J. Johannsen", title = "Exponential separations between restricted resolution and cutting planes proof systems", crossref = "IEEE:1998:ASF", pages = "638--647", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Grigoriev:1998:TTL, author = "D. Grigoriev", title = "{Tseitin}'s tautologies and lower bounds for {Nullstellensatz} proofs", crossref = "IEEE:1998:ASF", pages = "648--652", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Impagliazzo:1998:WPS, author = "R. Impagliazzo and R. Paturi and F. Zane", title = "Which problems have strongly exponential complexity?", crossref = "IEEE:1998:ASF", pages = "653--662", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kumar:1998:RSP, author = "R. Kumar and P. Raghavan and S. Rajagopalan and A. Tomkins", title = "Recommendation systems: a probabilistic analysis", crossref = "IEEE:1998:ASF", pages = "664--673", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Feige:1998:HFL, author = "U. Feige and J. Kilian", title = "Heuristics for finding large independent sets, with applications to coloring semi-random graphs", crossref = "IEEE:1998:ASF", pages = "674--683", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Radhakrishnan:1998:IBA, author = "J. Radhakrishnan and A. Srinivasan", title = "Improved bounds and algorithms for hypergraph two-coloring", crossref = "IEEE:1998:ASF", pages = "684--693", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Rabani:1998:LDM, author = "Y. Rabani and A. Sinclair and R. Wanka", title = "Local divergence of {Markov} chains and the analysis of iterative load-balancing schemes", crossref = "IEEE:1998:ASF", pages = "694--703", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Gottlob:1998:CAC, author = "G. Gottlob and N. Leone and F. Scarcello", title = "The complexity of acyclic conjunctive queries", crossref = "IEEE:1998:ASF", pages = "706--715", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Leivant:1998:CNT, author = "D. Leivant", title = "A characterization of {NC} by tree recurrence", crossref = "IEEE:1998:ASF", pages = "716--724", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Mitchell:1998:LCB, author = "J. Mitchell and M. Mitchell and A. Scedrov", title = "A linguistic characterization of bounded oracle computation and probabilistic polynomial time", crossref = "IEEE:1998:ASF", pages = "725--733", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Impagliazzo:1998:RVT, author = "R. Impagliazzo and A. Wigderson", title = "Randomness vs. time: de-randomization under a uniform assumption", crossref = "IEEE:1998:ASF", pages = "734--743", year = "1998", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Jain:1999:PDA, author = "K. Jain and V. V. Vazirani", title = "Primal-dual approximation algorithms for metric facility location and $k$-median problems", crossref = "IEEE:1999:ASF", pages = "2--13", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kleinberg:1999:AAC, author = "J. Kleinberg and E. Tardos", title = "Approximation algorithms for classification problems with pairwise relationships: metric labeling and {Markov} random fields", crossref = "IEEE:1999:ASF", pages = "14--23", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Fleischer:1999:AFM, author = "L. K. Fleischer", title = "Approximating fractional multicommodity flow independent of the number of commodities", crossref = "IEEE:1999:ASF", pages = "24--31", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Afrati:1999:ASM, author = "F. Afrati and E. Bampis and C. Chekuri and D. Karger and C. Kenyon and S. Khanna and I. Milis and M. Queyranne and M. Skutella and C. Stein and M. Sviridenko", title = "Approximation schemes for minimizing average weighted completion time with release dates", crossref = "IEEE:1999:ASF", pages = "32--43", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Blaser:1999:LBR, author = "M. Blaser", title = "A $5/2n^2$-lower bound for the rank of $n \times n$-matrix multiplication over arbitrary fields", crossref = "IEEE:1999:ASF", pages = "45--50", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Vigoda:1999:IBS, author = "E. Vigoda", title = "Improved bounds for sampling colorings", crossref = "IEEE:1999:ASF", pages = "51--59", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Ajtai:1999:NLT, author = "M. Ajtai", title = "A non-linear time lower bound for {Boolean} branching programs", crossref = "IEEE:1999:ASF", pages = "60--70", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Miltersen:1999:DAM, author = "P. B. Miltersen and N. V. Vinodchandran", title = "Derandomizing {Arthur--Merlin} games using hitting sets", crossref = "IEEE:1999:ASF", pages = "71--80", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{King:1999:FDA, author = "V. King", title = "Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs", crossref = "IEEE:1999:ASF", pages = "81--89", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Chan:1999:DPC, author = "T. M. Chan", title = "Dynamic planar convex hull operations in near-logarithmic amortized time", crossref = "IEEE:1999:ASF", pages = "92--99", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Har-Peled:1999:TWP, author = "S. Har-Peled", title = "Taking a walk in a planar arrangement", crossref = "IEEE:1999:ASF", pages = "100--110", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Watrous:1999:PCR, author = "J. Watrous", title = "{PSPACE} has constant-round quantum interactive proof systems", crossref = "IEEE:1999:ASF", pages = "112--119", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Micali:1999:VRF, author = "S. Micali and M. Rabin and S. Vadhan", title = "Verifiable random functions", crossref = "IEEE:1999:ASF", pages = "120--130", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Vocking:1999:HAH, author = "B. Vocking", title = "How asymmetry helps load balancing", crossref = "IEEE:1999:ASF", pages = "131--141", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Feige:1999:NSP, author = "U. Feige", title = "Noncryptographic selection protocols", crossref = "IEEE:1999:ASF", pages = "142--152", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Indyk:1999:STA, author = "P. Indyk", title = "A sublinear time approximation scheme for clustering in metric spaces", crossref = "IEEE:1999:ASF", pages = "154--159", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Amir:1999:ERD, author = "A. Amir and A. Efrat and P. Indyk and H. Samet", title = "Efficient regular data structures and algorithms for location and proximity problems", crossref = "IEEE:1999:ASF", pages = "160--170", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Farach-Colton:1999:ANN, author = "M. Farach-Colton and P. Indyk", title = "Approximate nearest neighbor algorithms for {Hausdorff} metrics via embeddings", crossref = "IEEE:1999:ASF", pages = "171--179", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Impagliazzo:1999:NOC, author = "R. Impagliazzo and R. Shaltiel and A. Wigderson", title = "Near-optimal conversion of hardness into pseudo-randomness", crossref = "IEEE:1999:ASF", pages = "181--190", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Raz:1999:ERE, author = "R. Raz and O. Reingold and S. Vadhan", title = "Error reduction for extractors", crossref = "IEEE:1999:ASF", pages = "191--201", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Agrawal:1999:PIT, author = "M. Agrawal and S. Biswas", title = "Primality and identity testing via {Chinese} remaindering", crossref = "IEEE:1999:ASF", pages = "202--208", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Dyer:1999:CIS, author = "M. Dyer and A. Frieze and M. Jerrum", title = "On counting independent sets in sparse graphs", crossref = "IEEE:1999:ASF", pages = "210--217", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Borgs:1999:TMS, author = "C. Borgs and J. T. Chayes and A. Frieze and Jeong Han Kim and P. Tetali and E. Vigoda and Van Ha Vu", title = "Torpid mixing of some {Monte Carlo Markov} chain algorithms in statistical physics", crossref = "IEEE:1999:ASF", pages = "218--229", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Morris:1999:RWT, author = "B. Morris and A. Sinclair", title = "Random walks on truncated cubes and sampling $0$--$1$ knapsack solutions", crossref = "IEEE:1999:ASF", pages = "230--240", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kumar:1999:MCV, author = "V. S. Anil Kumar and H. Ramesh", title = "{Markovian} coupling vs. conductance for the {Jerrum-Sinclair} chain", crossref = "IEEE:1999:ASF", pages = "241--251", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Peleg:1999:NTL, author = "D. Peleg and V. Rubinovich", title = "A near-tight lower bound on the time complexity of distributed {MST} construction", crossref = "IEEE:1999:ASF", pages = "253--261", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Afek:1999:LLA, author = "Y. Afek and G. Stupp and D. Touitou", title = "Long-lived adaptive collect with applications", crossref = "IEEE:1999:ASF", pages = "262--272", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Barve:1999:TFM, author = "R. D. Barve and J. S. Vitter", title = "A theoretical framework for memory-adaptive algorithms", crossref = "IEEE:1999:ASF", pages = "273--284", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Frigo:1999:COA, author = "M. Frigo and C. E. Leiserson and H. Prokop and S. Ramachandran", title = "Cache-oblivious algorithms", crossref = "IEEE:1999:ASF", pages = "285--297", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Feldman:1999:DSN, author = "J. Feldman and M. Ruhl", title = "The {Directed Steiner Network} problem is tractable for a constant number of terminals", crossref = "IEEE:1999:ASF", pages = "299--308", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Eppstein:1999:SPE, author = "D. Eppstein", title = "Setting parameters by example", crossref = "IEEE:1999:ASF", pages = "309--318", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Chen:1999:FDE, author = "Zhi-Zhong Chen and Xin He and Chun-Hsi Huang", title = "Finding double {Euler} trails of planar graphs in linear time [{CMOS VLSI} circuit design]", crossref = "IEEE:1999:ASF", pages = "319--329", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Weihe:1999:EDR, author = "K. Weihe", title = "Edge-disjoint routing in plane switch graphs in linear time", crossref = "IEEE:1999:ASF", pages = "330--339", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Watrous:1999:QCS, author = "J. Watrous", title = "On quantum and classical space-bounded processes with algebraic transition amplitudes", crossref = "IEEE:1999:ASF", pages = "341--351", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Ambainis:1999:BLB, author = "A. Ambainis", title = "A better lower bound for quantum algorithms searching an ordered list", crossref = "IEEE:1999:ASF", pages = "352--357", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Buhrman:1999:BSE, author = "H. Buhrman and R. Cleve and R. {De Wolf} and C. Zalka", title = "Bounds for small-error and zero-error quantum algorithms", crossref = "IEEE:1999:ASF", pages = "358--368", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Nayak:1999:OLB, author = "A. Nayak", title = "Optimal lower bounds for quantum automata and random access codes", crossref = "IEEE:1999:ASF", pages = "369--376", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Charikar:1999:ICA, author = "M. Charikar and S. Guha", title = "Improved combinatorial algorithms for the facility location and $k$-median problems", crossref = "IEEE:1999:ASF", pages = "378--388", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Katoh:1999:LLT, author = "N. Katoh and T. Tokuyama", title = "{Lovasz}'s lemma for the three-dimensional {$K$}-level of concave surfaces and its applications", crossref = "IEEE:1999:ASF", pages = "389--398", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Gupta:1999:CTE, author = "A. Gupta and I. Newman and Y. Rabinovich and A. Sinclair", title = "Cuts, trees and $l_1$-embeddings of graphs", crossref = "IEEE:1999:ASF", pages = "399--408", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Schoning:1999:PAK, author = "T. Schoning", title = "A probabilistic algorithm for $k$-{SAT} and constraint satisfaction problems", crossref = "IEEE:1999:ASF", pages = "410--414", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Ben-Sasson:1999:RCH, author = "E. Ben-Sasson and R. Impagliazzo", title = "Random {CNF}s are hard for the polynomial calculus", crossref = "IEEE:1999:ASF", pages = "415--421", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Bonet:1999:SPS, author = "M. L. Bonet and N. Galesi", title = "A study of proof search algorithms for resolution and polynomial calculus", crossref = "IEEE:1999:ASF", pages = "422--431", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Muthukrishnan:1999:OSM, author = "S. Muthukrishnan and R. Rajaraman and A. Shaheen and J. E. Gehrke", title = "Online scheduling to minimize average stretch", crossref = "IEEE:1999:ASF", pages = "433--443", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Koutsoupias:1999:WAK, author = "E. Koutsoupias", title = "Weak adversaries for the $k$-server problem", crossref = "IEEE:1999:ASF", pages = "444--449", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Blum:1999:FCP, author = "A. Blum and C. Burch and A. Kalai", title = "Finely-competitive paging", crossref = "IEEE:1999:ASF", pages = "450--457", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Lipton:1999:CS, author = "R. J. Lipton and A. Viglas", title = "On the complexity of {SAT}", crossref = "IEEE:1999:ASF", pages = "459--464", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Umans:1999:HAM, author = "C. Umans", title = "Hardness of approximating {$\Sigma_2^p$} minimization problems", crossref = "IEEE:1999:ASF", pages = "465--474", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Dumer:1999:HAM, author = "I. Dumer and D. Micciancio and M. Sudan", title = "Hardness of approximating the minimum distance of a linear code", crossref = "IEEE:1999:ASF", pages = "475--484", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Boykin:1999:UFT, author = "P. O. Boykin and T. Mor and M. Pulver and V. Roychowdhury and F. Vatan", title = "On universal and fault-tolerant quantum computing: a novel basis and a new constructive proof of universality for {Shor}'s basis", crossref = "IEEE:1999:ASF", pages = "486--494", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Plandowski:1999:SWE, author = "W. Plandowski", title = "Satisfiability of word equations with constants is in {PSPACE}", crossref = "IEEE:1999:ASF", pages = "495--500", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Feigenbaum:1999:ADA, author = "J. Feigenbaum and S. Kannan and M. Strauss and M. Viswanathan", title = "An approximate {$L^1$}-difference algorithm for massive data streams", crossref = "IEEE:1999:ASF", pages = "501--511", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Goldman:1999:AAP, author = "D. Goldman and S. Istrail and C. H. Papadimitriou", title = "Algorithmic aspects of protein structure similarity", crossref = "IEEE:1999:ASF", pages = "512--521", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Dwork:1999:MF, author = "C. Dwork and M. Naor and O. Reingold and L. Stockmeyer", title = "Magic functions", crossref = "IEEE:1999:ASF", pages = "523--534", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kim:1999:LEO, author = "Jeong Han Kim and D. R. Simon and P. Tetali", title = "Limits on the efficiency of one-way permutation-based hash functions", crossref = "IEEE:1999:ASF", pages = "535--542", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Sahai:1999:NMN, author = "A. Sahai", title = "Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security", crossref = "IEEE:1999:ASF", pages = "543--553", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Sander:1999:NIC, author = "T. Sander and A. Young and Moti Yung", title = "Non-interactive cryptocomputing for {NC}$^1$", crossref = "IEEE:1999:ASF", pages = "554--566", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kleinberg:1999:FRL, author = "J. Kleinberg and Y. Rabani and E. Tardos", title = "Fairness in routing and load balancing", crossref = "IEEE:1999:ASF", pages = "568--578", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Goel:1999:SLB, author = "A. Goel and P. Indyk", title = "Stochastic load balancing and related problems", crossref = "IEEE:1999:ASF", pages = "579--586", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Luczak:1999:RNC, author = "M. J. Luczak and E. Upfal", title = "Reducing network congestion and blocking probability through balanced allocation", crossref = "IEEE:1999:ASF", pages = "587--595", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Kolpakov:1999:FMR, author = "R. Kolpakov and G. Kucherov", title = "Finding maximal repetitions in a word in linear time", crossref = "IEEE:1999:ASF", pages = "596--604", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Shoshan:1999:APS, author = "A. Shoshan and U. Zwick", title = "All pairs shortest paths in undirected graphs with integer weights", crossref = "IEEE:1999:ASF", pages = "605--614", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Arriaga:1999:ATL, author = "R. I. Arriaga and S. Vempala", title = "An algorithmic theory of learning: robust concepts and random projection", crossref = "IEEE:1999:ASF", pages = "616--623", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Klivans:1999:BHC, author = "A. R. Klivans and R. A. Servedio", title = "Boosting and hard-core sets", crossref = "IEEE:1999:ASF", pages = "624--633", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Dasgupta:1999:LMG, author = "S. Dasgupta", title = "Learning mixtures of {Gaussians}", crossref = "IEEE:1999:ASF", pages = "634--644", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Alon:1999:RLT, author = "N. Alon and I. Newman and M. Krivelevich and M. Szegedy", title = "Regular languages are testable with a constant number of queries", crossref = "IEEE:1999:ASF", pages = "645--655", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, } @InProceedings{Alon:1999:ETL, author = "N. Alon and M. Krivelevich and E. Fischer and M. Szegedy", title = "Efficient testing of large graphs", crossref = "IEEE:1999:ASF", pages = "656--666", year = "1999", bibdate = "Thu Apr 5 06:13:53 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", acknowledgement = ack-nhfb, }

%%% ==================================================================== %%% Cross-referenced entries must come last:

@Proceedings{IEEE:1990:PAS, editor = "{IEEE}", booktitle = "Proceedings: 31st Annual Symposium on Foundations of Computer Science: October 22--24, 1990, St. Louis, Missouri", title = "Proceedings: 31st Annual Symposium on Foundations of Computer Science: October 22--24, 1990, St. Louis, Missouri", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "??", year = "1990", CODEN = "ASFPDV", ISBN = "0-8186-2082-X (paperback), 0-8186-6082-1 (microfiche)", ISBN-13 = "978-0-8186-2082-9 (paperback), 978-0-8186-6082-5 (microfiche)", ISSN = "0272-5428", LCCN = "TK7885.A1 S92 1990", bibdate = "Thu Dec 3 07:11:18 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", note = "Formerly called the Annual Symposium on Switching and Automata Theory. IEEE catalog number 90CH29256. Computer Society order no. 2082.", acknowledgement = ack-nhfb, keywords = "computational complexity --- congresses; electronic data processing --- congresses; machine theory --- congresses", } @Proceedings{IEEE:1991:PAS, editor = "{IEEE}", booktitle = "Proceedings: 32nd annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, October 1--4, 1991", title = "Proceedings: 32nd annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, October 1--4, 1991", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "xi + 824", year = "1991", CODEN = "ASFPDV", ISBN = "0-8186-2445-0", ISBN-13 = "978-0-8186-2445-2", ISSN = "0272-5428", LCCN = "TK7885.A1 S92 1991", bibdate = "Thu Dec 3 07:11:18 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", note = "IEEE Catalog no. 91CH3062-7. Computer Society order no. 2445.", acknowledgement = ack-nhfb, keywords = "switching theory --- congresses; machine theory --- congresses; electronic data processing --- congresses", } @Proceedings{IEEE:1992:ASF, editor = "{IEEE}", booktitle = "33rd Annual Symposium on Foundations of Computer Science: October 24--27, 1992, Pittsburgh, Pennsylvania: proceedings [papers]", title = "33rd Annual Symposium on Foundations of Computer Science: October 24--27, 1992, Pittsburgh, Pennsylvania: proceedings [papers]", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "xi + 734", year = "1992", CODEN = "ASFPDV", ISBN = "0-8186-2901-0 (microfiche), 0-8186-2900-2 (paperback)", ISBN-13 = "978-0-8186-2901-3 (microfiche), 978-0-8186-2900-6 (paperback)", ISSN = "0272-5428", LCCN = "QA 76 S979 1992", bibdate = "Thu Dec 3 07:11:18 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", note = "IEEE Catalog Number 92CH3188-0. IEEE Computer Society Press Order Number 2900.", acknowledgement = ack-nhfb, keywords = "electronic data processing --- congresses", } @Proceedings{IEEE:1993:ASF, editor = "{IEEE}", booktitle = "34th Annual Symposium on Foundations of Computer Science: November 3--5, 1993, Palo Alto, California: proceedings [papers]", title = "34th Annual Symposium on Foundations of Computer Science: November 3--5, 1993, Palo Alto, California: proceedings [papers]", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "xiii + 745", year = "1993", CODEN = "ASFPDV", ISBN = "0-8186-4370-6 (paperback), 0-8186-4371-4 (microfiche)", ISBN-13 = "978-0-8186-4370-5 (paperback), 978-0-8186-4371-2 (microfiche)", ISSN = "0272-5428", LCCN = "TK7885.A1 S92 1993", bibdate = "Thu Dec 3 07:11:18 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", note = "IEEE Catalog Number 93CH3368-8. IEEE Computer Society Press Order Number 4372-02.", acknowledgement = ack-nhfb, keywords = "electronic data processing --- congresses; machine theory --- congresses", } @Proceedings{Goldwasser:1994:P, editor = "Shafi Goldwasser", booktitle = "Proceedings: 35th Annual Symposium on Foundations of Computer Science, November 20--22, 1994, Santa Fe, New Mexico", title = "Proceedings: 35th Annual Symposium on Foundations of Computer Science, November 20--22, 1994, Santa Fe, New Mexico", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "xiii + 837", year = "1994", CODEN = "ASFPDV", ISBN = "0-8186-6582-3", ISBN-13 = "978-0-8186-6582-0", ISSN = "0272-5428", LCCN = "QA 76 S979 1994", bibdate = "Thu Dec 3 07:11:18 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", note = "IEEE catalog number 94CH35717. IEEE Computer Society Press Order Number 6580-02.", acknowledgement = ack-nhfb, keywords = "electronic data processing --- congresses", } @Proceedings{IEEE:1995:ASF, editor = "{IEEE}", booktitle = "36th Annual Symposium on Foundations of Computer Science: October 23--25, 1995, Milwaukee, Wisconsin", title = "36th Annual Symposium on Foundations of Computer Science: October 23--25, 1995, Milwaukee, Wisconsin", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "xiii + 735", year = "1995", CODEN = "ASFPDV", ISBN = "0-7803-3121-4 (casebound), 0-8186-7183-1 (softbound), 0-8186-7184-X (microfiche)", ISBN-13 = "978-0-7803-3121-1 (casebound), 978-0-8186-7183-8 (softbound), 978-0-8186-7184-5 (microfiche)", ISSN = "0272-5428", LCCN = "TK7885.A1 S92 1995", bibdate = "Thu Dec 3 07:11:18 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", note = "IEEE catalog number 95CB35834.", acknowledgement = ack-nhfb, keywords = "electronic data processing --- congresses; machine theory --- congresses", } @Proceedings{IEEE:1996:ASF, editor = "{IEEE}", booktitle = "37th Annual Symposium on Foundations of Computer Science: October 14--16, 1996, Burlington, Vermont", title = "37th Annual Symposium on Foundations of Computer Science: October 14--16, 1996, Burlington, Vermont", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "xii + 638", year = "1996", CODEN = "ASFPDV", ISBN = "0-7803-3762-X (casebound), 0-8186-7594-2 (softbound), 0-8186-7596-9 (microfiche)", ISBN-13 = "978-0-7803-3762-6 (casebound), 978-0-8186-7594-2 (softbound), 978-0-8186-7596-6 (microfiche)", ISSN = "0272-5428", LCCN = "TK7885.A1 S92 1996", bibdate = "Thu Dec 3 07:11:18 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib; https://www.math.utah.edu/pub/tex/bib/focs1990.bib", note = "IEEE catalog number 96CH35973. IEEE Computer Society Press order number PR07594.", acknowledgement = ack-nhfb, keywords = "electronic data processing --- congresses; machine theory --- congresses", } @Proceedings{IEEE:1997:ASF, editor = "{IEEE}", key = "IEEE-FOCS'97", booktitle = "38th Annual Symposium on Foundations of Computer Science: October 20--22, 1997, Miami Beach, Florida", title = "38th Annual Symposium on Foundations of Computer Science: October 20--22, 1997, Miami Beach, Florida", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "xiii + 606", year = "1997", CODEN = "ASFPDV", ISBN = "0-8186-8197-7 (paperback), 0-8186-8198-5 (casebound), 0-8186-8199-3 (microfiche)", ISBN-13 = "978-0-8186-8197-4 (paperback), 978-0-8186-8198-1 (casebound), 978-0-8186-8199-8 (microfiche)", ISSN = "0272-5428", LCCN = "TK7885.A1 .S92 1997", bibdate = "Thu Dec 3 07:11:18 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib; https://www.math.utah.edu/pub/tex/bib/focs1990.bib", note = "IEEE catalog number 97CB36150. IEEE Computer Society Press order number PR08197.", acknowledgement = ack-nhfb, keywords = "electronic data processing --- congresses; machine theory --- congresses", } @Proceedings{IEEE:1998:ASF, editor = "{IEEE}", booktitle = "39th Annual Symposium on Foundations of Computer Science: proceedings: November 8--11, 1998, Palo Alto, California", title = "39th Annual Symposium on Foundations of Computer Science: proceedings: November 8--11, 1998, Palo Alto, California", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "xiv + 745", year = "1998", CODEN = "ASFPDV", ISBN = "0-8186-9172-7 (softbound), 0-7803-5229-7 (casebound), 0-8186-9174-3 (microfiche)", ISBN-13 = "978-0-8186-9172-0 (softbound), 978-0-7803-5229-2 (casebound), 978-0-8186-9174-4 (microfiche)", ISSN = "0272-5428", LCCN = "QA267 .S95 1998 Sci-Eng", bibdate = "Sat Oct 28 16:10:32 MDT 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", note = "IEEE Catalog Number 98CB36280. IEEE Computer Society Press Order Number PR9172.", acknowledgement = ack-nhfb, keywords = "electronic data processing -- congresses; machine theory -- congresses", } @Proceedings{IEEE:1999:ASF, editor = "{IEEE}", booktitle = "40th Annual Symposium on Foundations of Computer Science: October 17--19, 1999, New York City, New York", title = "40th Annual Symposium on Foundations of Computer Science: October 17--19, 1999, New York City, New York", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "xiv + 668", year = "1999", CODEN = "ASFPDV", ISBN = "0-7695-0409-4 (softbound), 0-7803-5955-0 (casebound), 0-7695-0411-6 (microfiche)", ISBN-13 = "978-0-7695-0409-4 (softbound), 978-0-7803-5955-0 (casebound), 978-0-7695-0411-7 (microfiche)", ISSN = "0272-5428", LCCN = "TK7885.A1 S92 1999", bibdate = "Sat Oct 28 16:10:32 MDT 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/focs1990.bib", note = "IEEE Catalog Number 99CB37039.", acknowledgement = ack-nhfb, keywords = "electronic data processing -- congresses; machine theory -- congresses", }