% source(93/09/28): ftp dimacs.rutgers.edu:/pub/dsj/stocfocs % % then converted with stocfocs2bib to bibtex format % @InProceedings{Calingaert60, author = "P. Calingaert", title = "Switching function canonical forms based on commutative and associative binary operations", booktitle = "Proc.\ 1st IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1960", pages = "217--224", } @InProceedings{Elgot60, author = "C. C. Elgot", title = "Truth functions realizable by single threshold organs", booktitle = "Proc.\ 1st IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1960", pages = "225--245", } @InProceedings{FraMul60, author = "W. D. Frazer and D. E. Muller", title = "A method for factoring the action of asynchronous circuits", booktitle = "Proc.\ 1st IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1960", pages = "246--249", } @InProceedings{Homan60, author = "M. E. Homan", title = "A four-megacycle, 24-bit checked binary adder", booktitle = "Proc.\ 1st IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1960", pages = "250--265", } @InProceedings{Ledley60, author = "R. S. Ledley", title = "Boolean matrices applied to sequential circuit theory and threshold logics", booktitle = "Proc.\ 1st IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1960", pages = "266--272", } @InProceedings{Meade60, author = "R. M. Meade", title = "Forcing circuitry --- Sequential building blocks for logical design", booktitle = "Proc.\ 1st IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1960", pages = "273--291", } @InProceedings{Reinecke60, author = "Jr. H. Reinecke", title = "Current-operated diode logic gates", booktitle = "Proc.\ 1st IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1960", pages = "292--308", } @InProceedings{Shelly60, author = "J. H. Shelly", title = "The decision and synthesis problems in semimodular switching theory", booktitle = "Proc.\ 1st IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1960", pages = "309--320", } @InProceedings{Winder60, author = "R. O. Winder", title = "Single stage threshold logic", booktitle = "Proc.\ 1st IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1960", pages = "321--332", } @InProceedings{CobFriNor61, author = "A. Cobham and R. Fridshal and J. H. North", title = "An application of linear programming to the minimization of Boolean functions", booktitle = "Proc.\ 2nd IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1961", pages = "3--9", } @InProceedings{McCluskey61, author = "Jr. E. J. McCluskey", title = "Minimal sums for Boolean functions having many unspecified fundamental products", booktitle = "Proc.\ 2nd IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1961", pages = "10--17", } @InProceedings{Petrick61, author = "S. R. Petrick", title = "Use of a list processing language in programming simplification procedures", booktitle = "Proc.\ 2nd IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1961", pages = "18--24", } @InProceedings{Akers61, author = "Jr. S. B. Akers", title = "Threshold logic and two-person, zero-sum games", booktitle = "Proc.\ 2nd IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1961", pages = "27--33", } @InProceedings{Chow61, author = "C. K. Chow", title = "On the characterization of threshold functions", booktitle = "Proc.\ 2nd IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1961", pages = "34--38", } @InProceedings{Muroga61, author = "S. Muroga", title = "Functional forms of majority functions and a necessary and sufficient condition for their realizability", booktitle = "Proc.\ 2nd IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1961", pages = "39--46", } @InProceedings{Stram61, author = "O. B. Stram", title = "The profile technique for the design of threshold device logic", booktitle = "Proc.\ 2nd IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1961", pages = "47--54", } @InProceedings{Winder61, author = "R. O. Winder", title = "More about threshold logic", booktitle = "Proc.\ 2nd IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1961", pages = "55--64", } @InProceedings{Kennedy61, author = "D. Kennedy", title = "The integrative properties of neurons", booktitle = "Proc.\ 2nd IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1961", pages = "67--69", } @InProceedings{Landahl61, author = "H. D. Landahl", title = "Mathematical models of neurone interaction", booktitle = "Proc.\ 2nd IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1961", pages = "70--76", } @InProceedings{BoyLed61, author = "D. R. Boyle and R. S. Ledley", title = "Multivalued logic devices for simulating threshold neurons", booktitle = "Proc.\ 2nd IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1961", pages = "77--82", } @InProceedings{Cowan61, author = "J. D. Cowan", title = "Many-valued logics and reliable homeostatic mechanisms", booktitle = "Proc.\ 2nd IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1961", pages = "83--84", } @InProceedings{Miller61, author = "R. E. Miller", title = "An introduction to speed independent circuit theory", booktitle = "Proc.\ 2nd IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1961", pages = "87--93", } @InProceedings{Swartwout61, author = "R. E. Swartwout", title = "One method for designing speed independent logic for a control", booktitle = "Proc.\ 2nd IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1961", pages = "94--105", } @InProceedings{Robertson61, author = "J. E. Robertson", title = "Problems in the physical realization of speed independent circuits", booktitle = "Proc.\ 2nd IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1961", pages = "106--108", } @InProceedings{Gillies61, author = "D. B. Gillies", title = "A flow chart notation for the description of a speed-independent control", booktitle = "Proc.\ 2nd IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1961", pages = "109--110", } @InProceedings{Kilmer61, author = "W. L. Kilmer", title = "Transient behavior in iterative combinatorial switching networks", booktitle = "Proc.\ 2nd IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1961", pages = "114--128", } @InProceedings{ElgRut61, author = "C. C. Elgot and J. D. Rutledge", title = "Operations of finite automata", booktitle = "Proc.\ 2nd IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1961", pages = "129--132", } @InProceedings{Arden61, author = "D. N. Arden", title = "Delayed-logic and finite-state machines", booktitle = "Proc.\ 2nd IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1961", pages = "133--151", } @InProceedings{GalNorRot61, author = "J. M. Galey and R. E. Norby and J. P. Roth", title = "Techniques for the diagnosis of switching circuit failures", booktitle = "Proc.\ 2nd IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1961", pages = "152--160", } @InProceedings{Kautz61, author = "W. H. Kautz", title = "Some unsolved problems in switching theory", booktitle = "Proc.\ 2nd IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1961", pages = "163--165", } @InProceedings{ElgMur61, author = "C. C. Elgot and S. Muroga", title = "Two problems on threshold functions", booktitle = "Proc.\ 2nd IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1961", pages = "166", } @InProceedings{Cohn61, author = "M. Cohn", title = "Canonical forms of functions in {P}-valued logics", booktitle = "Proc.\ 2nd IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1961", pages = "169--177", } @InProceedings{OkaRajYou61, author = "S. Okada and K. P. Rajappan and K. P. Young", title = "Boolean two-terminal analysis and synthesis", booktitle = "Proc.\ 2nd IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1961", pages = "178--181", } @InProceedings{KarpEtAl61, author = "R. M. Karp and F. E. McFarlin and J. P. Roth and J. R. Wilts", title = "A computer program for the synthesis of combinational switching circuits", booktitle = "Proc.\ 2nd IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1961", pages = "182--194", } @InProceedings{Kautz61, author = "W. H. Kautz", title = "Automatic fault detection in combinational switching networks", booktitle = "Proc.\ 2nd IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1961", pages = "195--214", } @InProceedings{Meo62, author = "A. R. Meo", title = "On the minimal third order expression of a Boolean function", booktitle = "Proc.\ 3rd IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1962", pages = "5--24", } @InProceedings{SamCal62, author = "E. W. Samson and L. Calabi", title = "Research and algorithms in the theory of Boolean formulas", booktitle = "Proc.\ 3rd IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1962", pages = "25--32", } @InProceedings{CalRil62, author = "L. Calabi and J. A. Riley", title = "The algebra of Boolean formulas: Some criteria for minimality", booktitle = "Proc.\ 3rd IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1962", pages = "33--47", } @InProceedings{Lawler62, author = "E. L. Lawler", title = "Minimal Boolean expressions with more than two levels of sums and products", booktitle = "Proc.\ 3rd IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1962", pages = "49--59", } @InProceedings{ElgRut62, author = "C. C. Elgot and J. D. Rutledge", title = "Machine properties preserved under state minimization", booktitle = "Proc.\ 3rd IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1962", pages = "61--70", } @InProceedings{Hazeltine62, author = "B. Hazeltine", title = "A procedure for obtaining an economical asynchronous sequential circuit directly from a set of regular expressions", booktitle = "Proc.\ 3rd IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1962", pages = "71--79", } @InProceedings{Hohn62, author = "F. E. Hohn", title = "States of sequential machines whose logical elements involve delay", booktitle = "Proc.\ 3rd IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1962", pages = "81--89", } @InProceedings{McCluskey62, author = "E. J. McCluskey", title = "Reduction of feedback loops in sequential circuits and carry leads in iterative networks", booktitle = "Proc.\ 3rd IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1962", pages = "91--102", } @InProceedings{Levien62, author = "R. E. Levien", title = "The synthesis of cascade switching circuits", booktitle = "Proc.\ 3rd IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1962", pages = "103--121", } @InProceedings{BeaMil62, author = "J. C. Beatty and R. E. Miller", title = "Some theorems for incompletely specified sequential machines with applications to state minimization", booktitle = "Proc.\ 3rd IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1962", pages = "123--136", } @InProceedings{Winograd62, author = "S. Winograd", title = "Bounded-transient automata", booktitle = "Proc.\ 3rd IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1962", pages = "137--141", } @InProceedings{Even62, author = "S. Even", title = "Generalized automata and their information losslessness", booktitle = "Proc.\ 3rd IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1962", pages = "143--147", } @InProceedings{Akers62, author = "Jr. S. B. Akers", title = "Synthesis of combinational logic using three-input majority gates", booktitle = "Proc.\ 3rd IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1962", pages = "149--157", } @InProceedings{LewCoa62, author = "II P. M. Lewis and C. L. Coates", title = "A realization procedure for threshold gate networks", booktitle = "Proc.\ 3rd IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1962", pages = "159--168", } @InProceedings{Muroga62, author = "S. Muroga", title = "Generation of self-dual threshold functions and lower bounds of the number of threshold functions and a maximum weight", booktitle = "Proc.\ 3rd IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1962", pages = "169--184", } @InProceedings{Tung62, author = "C. K. Tung", title = "On some transformation theorems in many-valued logical systems", booktitle = "Proc.\ 3rd IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1962", pages = "185--199", } @InProceedings{Muller63, author = "D. E. Muller", title = "Infinite sequences and finite machines", booktitle = "Proc.\ 4th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1963", pages = "3--16", } @InProceedings{ElgMez63, author = "C. C. Elgot and J. E. Mezei", title = "Two-sided finite-state transductions", booktitle = "Proc.\ 4th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1963", pages = "17--22", } @InProceedings{Fischer63, author = "P. C. Fischer", title = "On computability by certain classes of restricted Turing machines", booktitle = "Proc.\ 4th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1963", pages = "23--32", } @InProceedings{Frazer63, author = "W. D. Frazer", title = "Bilateral threshold nets", booktitle = "Proc.\ 4th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1963", pages = "33--39", } @InProceedings{CoaLew63, author = "C. L. Coates and II P. M. Lewis", title = "Threshold gate realizations of logical functions with don't cares", booktitle = "Proc.\ 4th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1963", pages = "41--52", } @InProceedings{ArnLaw63, author = "R. F. Arnold and E. L. Lawler", title = "On the analysis of functional symmetry", booktitle = "Proc.\ 4th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1963", pages = "53--62", } @InProceedings{Lawler63, author = "E. L. Lawler", title = "The minimal synthesis of tree structures", booktitle = "Proc.\ 4th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1963", pages = "63--82", } @InProceedings{Levien63, author = "R. E. Levien", title = "Determining the best ordering of variables in cascade switching circuits", booktitle = "Proc.\ 4th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1963", pages = "83--104", } @InProceedings{Eichelberger63, author = "E. B. Eichelberger", title = "Sequential circuit synthesis using input delays", booktitle = "Proc.\ 4th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1963", pages = "105--116", } @InProceedings{McNaughton63, author = "R. McNaughton", title = "Finite automata and badly timed elements", booktitle = "Proc.\ 4th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1963", pages = "117--130", } @InProceedings{Booth63, author = "T. M. Booth", title = "Demonstrating hazards in sequential relay circuits", booktitle = "Proc.\ 4th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1963", pages = "131--136", } @InProceedings{McCluskey63, author = "E. J. McCluskey", title = "Logical design theory of {NOR} gate networks with no complemented inputs", booktitle = "Proc.\ 4th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1963", pages = "137--148", } @InProceedings{Miller63, author = "R. E. Miller", title = "A survey of asynchronous logic: Comparing various definitions and models for asynchronous switching circuits", booktitle = "Proc.\ 4th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1963", pages = "149--152", } @InProceedings{Hammel64, author = "D. Hammel", title = "Ideas on asynchronous feedback networks", booktitle = "Proc.\ 5th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1964", pages = "4--11", } @InProceedings{Swartwout64, author = "R. E. Swartwout", title = "New techniques for designing speed independent control logic", booktitle = "Proc.\ 5th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1964", pages = "12--29", } @InProceedings{GolSho64, author = "J. Goldberg and R. A. Short", title = "Antiparallel control logic", booktitle = "Proc.\ 5th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1964", pages = "30--43", } @InProceedings{Harrison64, author = "M. A. Harrison", title = "A census of finite automata", booktitle = "Proc.\ 5th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1964", pages = "44--46", } @InProceedings{Griffiths64, author = "T. V. Griffiths", title = "Turing machine recognizers for general rewriting systems", booktitle = "Proc.\ 5th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1964", pages = "47--56", } @InProceedings{GinSpa64, author = "S. Ginsburg and E. H. Spanier", title = "Mappings of languages by two-tape devices", booktitle = "Proc.\ 5th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1964", pages = "57--67", } @InProceedings{Fischer64, author = "P. C. Fischer", title = "On formalisms for Turing machines", booktitle = "Proc.\ 5th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1964", pages = "68--75", } @InProceedings{Rosenberg64, author = "A. L. Rosenberg", title = "On $n$-tape finite state acceptors", booktitle = "Proc.\ 5th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1964", pages = "76--81", } @InProceedings{HarSte64, author = "J. Hartmanis and R. E. Stearns", title = "Computational complexity of recursive sequences", booktitle = "Proc.\ 5th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1964", pages = "82--90", } @InProceedings{Green64, author = "M. W. Green", title = "A lower bound on Rado's sigma function for binary Turing machines", booktitle = "Proc.\ 5th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1964", pages = "91--94", } @InProceedings{Hennie64, author = "F. C. Hennie", title = "Fault detecting experiments for sequential circuits", booktitle = "Proc.\ 5th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1964", pages = "95--110", } @InProceedings{Eichelberger64, author = "E. B. Eichelberger", title = "Hazard detection in combinational and sequential switching circuits", booktitle = "Proc.\ 5th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1964", pages = "111--120", } @InProceedings{PoaMcC64, author = "J. F. Poage and Jr. E. J. McCluskey", title = "Derivation of optimum test sequences for sequential machines", booktitle = "Proc.\ 5th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1964", pages = "121--132", } @InProceedings{Elspas64, author = "B. Elspas", title = "Topological constraints on interconnection-limited logic", booktitle = "Proc.\ 5th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1964", pages = "133--137", } @InProceedings{Urbano64, author = "R. H. Urbano", title = "Some new results on the analysis and reliability of large polyfunctional nets", booktitle = "Proc.\ 5th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1964", pages = "138--148", } @InProceedings{HicBer64, author = "G. L. Hicks and A. J. Bernstein", title = "On the minimum stage realization of switching functions using logic gates with limited fan-in", booktitle = "Proc.\ 5th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1964", pages = "149--155", } @InProceedings{Bernstein64, author = "A. J. Bernstein", title = "Reducing variable dependency in combinational circuits", booktitle = "Proc.\ 5th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1964", pages = "156--164", } @InProceedings{Akers64, author = "Jr. S. B. Akers", title = "A diagrammatic approach to multi-level logic synthesis", booktitle = "Proc.\ 5th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1964", pages = "165--173", } @InProceedings{Gaines64, author = "R. S. Gaines", title = "Implication techniques for Boolean functions", booktitle = "Proc.\ 5th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1964", pages = "174--182", } @InProceedings{Gimpel64, author = "J. F. Gimpel", title = "A reduction technique for prime implicant tables", booktitle = "Proc.\ 5th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1964", pages = "183--191", } @InProceedings{SteHar64, author = "R. E. Stearns and J. Hartmanis", title = "On the application of pair algebra to automata theory", booktitle = "Proc.\ 5th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1964", pages = "192--196", } @InProceedings{DavBrz64, author = "W. A. Davis and J. A. Brzozowski", title = "On the linearity of sequential machines", booktitle = "Proc.\ 5th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1964", pages = "197--208", } @InProceedings{Liu64, author = "C. L. Liu", title = "Sequential-machine realization using feedback shift registers", booktitle = "Proc.\ 5th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1964", pages = "209--227", } @InProceedings{EplWan64, author = "D. L. Epley and P. T. Wang", title = "On state assignments and sequential machine decompositions from {S}. {P}. partitions", booktitle = "Proc.\ 5th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1964", pages = "228--233", } @InProceedings{Bavel64, author = "Z. Bavel", title = "On the total length of an experiment, {I}", booktitle = "Proc.\ 5th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1964", pages = "234--248", } @InProceedings{Stabler65, author = "E. P. Stabler", title = "Threshold gate network synthesis", booktitle = "Proc.\ 6th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1965", pages = "5--11", } @InProceedings{CoaSup65, author = "C. L. Coates and V. Supornpaibul", title = "On maximum stability realizations of linearly separable Boolean functions", booktitle = "Proc.\ 6th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1965", pages = "12--24", } @InProceedings{GustafsonEtAl65, author = "C. H. Gustafson and D. R. Haring and A. K. Susskind and T. G. Wills-Sanford", title = "Synthesis of counters with threshold elements", booktitle = "Proc.\ 6th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1965", pages = "25--35", } @InProceedings{Hu65, author = "S. -T. Hu", title = "Minimal linear decompositions of switching functions", booktitle = "Proc.\ 6th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1965", pages = "36--40", } @InProceedings{GonLaw65, author = "R. Gonzalez and E. L. Lawler", title = "Two-level threshold minimization", booktitle = "Proc.\ 6th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1965", pages = "41--44", } @InProceedings{Zeiger65, author = "H. P. Zeiger", title = "Cascade synthesis of finite-state machines", booktitle = "Proc.\ 6th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1965", pages = "45--51", } @InProceedings{KohSmi65, author = "Z. Kohavi and E. J. Smith", title = "Decomposition of sequential machines", booktitle = "Proc.\ 6th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1965", pages = "52--61", } @InProceedings{Nichols65, author = "III A. J. Nichols", title = "Modular synthesis of sequential machines", booktitle = "Proc.\ 6th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1965", pages = "62--70", } @InProceedings{Davis65, author = "W. A. Davis", title = "On shift register realizations for sequential machines", booktitle = "Proc.\ 6th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1965", pages = "71--83", } @InProceedings{Brzozowski65, author = "J. A. Brzozowski", title = "On single-loop realizations of automata", booktitle = "Proc.\ 6th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1965", pages = "84--93", } @InProceedings{Friedman65, author = "A. D. Friedman", title = "Feedback in asynchronous sequential circuits", booktitle = "Proc.\ 6th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1965", pages = "94--104", } @InProceedings{Gimpel65, author = "J. F. Gimpel", title = "The synthesis of {TANT} networks", booktitle = "Proc.\ 6th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1965", pages = "105--125", } @InProceedings{DunKol65, author = "M. Dunning and B. Kolman", title = "Reliability and fault-masking in $n$-variable {NOR} trees", booktitle = "Proc.\ 6th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1965", pages = "126--142", } @InProceedings{Ramamoorthy65, author = "C. V. Ramamoorthy", title = "Procedures for minimization of `exclusive-{OR}' and `logical-equivalence' switching circuits", booktitle = "Proc.\ 6th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1965", pages = "143--149", } @InProceedings{LooMcC65, author = "Jr. H. H. Loomis and M. R. McCoy", title = "A theory of high-speed clocked logic", booktitle = "Proc.\ 6th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1965", pages = "150--161", } @InProceedings{Veitch65, author = "E. W. Veitch", title = "A proof concerning infinite nets of logic elements without feedback", booktitle = "Proc.\ 6th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1965", pages = "162--167", } @InProceedings{Hennie65, author = "F. C. Hennie", title = "Crossing sequences and off-line Turing machine computations", booktitle = "Proc.\ 6th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1965", pages = "168--172", } @InProceedings{RubFis65, author = "S. S. Ruby and P. C. Fischer", title = "Translational methods and computational complexity", booktitle = "Proc.\ 6th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1965", pages = "173--178", } @InProceedings{SteHarLew65, author = "R. E. Stearns and J. Hartmanis and II P. M. Lewis", title = "Hierarchies of memory limited computations", booktitle = "Proc.\ 6th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1965", pages = "179--190", } @InProceedings{LewSteHar65, author = "II P. M. Lewis and R. E. Stearns and J. Hartmanis", title = "Memory bounds for recognition of context-free and context-sensitive languages", booktitle = "Proc.\ 6th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1965", pages = "191--202", } @InProceedings{GinGre65, author = "S. Ginsburg and S. Greibach", title = "Deterministic context free languages", booktitle = "Proc.\ 6th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1965", pages = "203--220", } @InProceedings{Rosenberg65, author = "A. L. Rosenberg", title = "On multi-head finite automata", booktitle = "Proc.\ 6th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1965", pages = "221--228", } @InProceedings{Nievergelt65, author = "J. Nievergelt", title = "Partially ordered classes of finite automata", booktitle = "Proc.\ 6th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1965", pages = "229--234", } @InProceedings{Give'on65, author = "Y. Give'on", title = "Transparent categories and categories of transition systems", booktitle = "Proc.\ 6th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1965", pages = "235--241", } @InProceedings{BavMul65, author = "Z. Bavel and D. E. Muller", title = "Reversibility in monadic algebras and automata", booktitle = "Proc.\ 6th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1965", pages = "242--247", } @InProceedings{Wagner65, author = "E. G. Wagner", title = "On connecting modules together uniformly to form a modular computer", booktitle = "Proc.\ 6th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1965", pages = "248--257", } @InProceedings{Carlyle65, author = "J. W. Carlyle", title = "State-calculable stochastic sequential machines, equivalences, and events", booktitle = "Proc.\ 6th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1965", pages = "258--263", } @InProceedings{TerMel65, author = "I. Terris and M. A. Melkanoff", title = "Investigation and simulation of a self-repairing digital computer", booktitle = "Proc.\ 6th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1965", pages = "264--278", } @InProceedings{BuckinghamEtAl65, author = "B. R. S. Buckingham and W. C. Carter and W. R. Crawford and G. A. Nowell", title = "The controls automation system", booktitle = "Proc.\ 6th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1965", pages = "279--288", } @InProceedings{HacShi65, author = "F. J. Hackl and R. W. Shirk", title = "An integrated approach to automated computer maintenance", booktitle = "Proc.\ 6th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1965", pages = "289--302", } @InProceedings{Warfield65, author = "J. N. Warfield", title = "Synthesis of switching circuits to yield prescribed probability relations", booktitle = "Proc.\ 6th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1965", pages = "303--309", } @InProceedings{Snapp65, author = "P. W. Snapp", title = "Holiac --- {A} family of student-constructed logic teaching aids", booktitle = "Proc.\ 6th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1965", pages = "310--326", } @InProceedings{Younger66, author = "D. H. Younger", title = "Context-free language processing in time $ n^3 $", booktitle = "Proc.\ 7th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1966", pages = "1--20", } @InProceedings{LewSte66, author = "II P. M. Lewis and R. E. Stearns", title = "Syntax directed transduction", booktitle = "Proc.\ 7th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1966", pages = "21--35", } @InProceedings{KorHop66, author = "A. J. Korenjak and J. E. Hopcroft", title = "Simple deterministic languages", booktitle = "Proc.\ 7th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1966", pages = "36--46", } @InProceedings{GinGreHar66, author = "S. Ginsburg and S. A. Greibach and M. A. Harrison", title = "One-way stack automata", booktitle = "Proc.\ 7th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1966", pages = "47--52", } @InProceedings{Cole66, author = "S. N. Cole", title = "Real-time computation by $n$-dimensional iterative arrays of finite-state machines", booktitle = "Proc.\ 7th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1966", pages = "53--77", } @InProceedings{Cobham66, author = "A. Cobham", title = "The recognition problem for the set of perfect squares", booktitle = "Proc.\ 7th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1966", pages = "78--87", } @InProceedings{Brzozowski66, author = "J. A. Brzozowski", title = "Roots of star events", booktitle = "Proc.\ 7th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1966", pages = "88--95", } @InProceedings{YoeAbl66, author = "M. Yoeli and C. M. Ablow", title = "Subdirect decompositions of transformation graphs", booktitle = "Proc.\ 7th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1966", pages = "96--102", } @InProceedings{Liu66, author = "C. L. Liu", title = "Pair algebra and its application", booktitle = "Proc.\ 7th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1966", pages = "103--112", } @InProceedings{Pu66, author = "A. T. Pu", title = "Generalized decomposition of incomplete finite automata", booktitle = "Proc.\ 7th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1966", pages = "113--126", } @InProceedings{Gill66, author = "A. Gill", title = "Graphs of affine transformations, with applications to sequential circuits", booktitle = "Proc.\ 7th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1966", pages = "127--135", } @InProceedings{GraLuc66, author = "A. Grasselli and F. Luccio", title = "A method for the combined row-column reduction of flow tables", booktitle = "Proc.\ 7th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1966", pages = "136--147", } @InProceedings{Epley66, author = "D. L. Epley", title = "Standard minimum transition time secondary assignments for asynchronous circuits", booktitle = "Proc.\ 7th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1966", pages = "148--153", } @InProceedings{Unger66, author = "S. H. Unger", title = "A row assignment for delay-free realizations of flow tables without essential hazards", booktitle = "Proc.\ 7th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1966", pages = "154--159", } @InProceedings{SmiKoh66, author = "E. J. Smith and Z. Kohavi", title = "Synthesis of multiple sequential machines", booktitle = "Proc.\ 7th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1966", pages = "160--171", } @InProceedings{HadCoa66, author = "F. O. Hadlock and C. L. Coates", title = "Realization of sequential machines with threshold elements", booktitle = "Proc.\ 7th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1966", pages = "172--183", } @InProceedings{MasMat66, author = "G. M. Masters and R. L. Mattson", title = "The application of threshold logic to the design of sequential machines", booktitle = "Proc.\ 7th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1966", pages = "184--194", } @InProceedings{DerFlu66, author = "M. L. Dertouzos and Z. C. Fluhr", title = "Minimization and convexity in threshold logic", booktitle = "Proc.\ 7th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1966", pages = "195--200", } @InProceedings{EveKohPaz66, author = "S. Even and I. Kohavi and A. Paz", title = "On minimal modulo 2 sums of products for switching functions", booktitle = "Proc.\ 7th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1966", pages = "201--206", } @InProceedings{StoEpl66, author = "D. R. Stover and D. L. Epley", title = "Conjunctive encoding of Boolean matrices", booktitle = "Proc.\ 7th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1966", pages = "207--214", } @InProceedings{GolSto66, author = "J. Goldberg and H. S. Stone", title = "Asynchronous propagation-limited logic", booktitle = "Proc.\ 7th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1966", pages = "215--226", } @InProceedings{King66, author = "III W. F. King", title = "The synthesis of multipurpose logic devices", booktitle = "Proc.\ 7th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1966", pages = "227--235", } @InProceedings{ForWax66, author = "D. C. Forslund and R. Waxman", title = "The universal logic block ({ULB}) and its application to logic design", booktitle = "Proc.\ 7th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1966", pages = "236--250", } @InProceedings{Booth66, author = "T. L. Booth", title = "Statistical properties of random digital sequences", booktitle = "Proc.\ 7th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1966", pages = "251--261", } @InProceedings{Arbib66, author = "M. A. Arbib", title = "Realization of stochastic systems", booktitle = "Proc.\ 7th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1966", pages = "262--266", } @InProceedings{Ott66, author = "G. H. Ott", title = "Reconsider the state minimization problem for stochastic finite state systems", booktitle = "Proc.\ 7th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1966", pages = "267--273", } @InProceedings{Helm66, author = "H. A. Helm", title = "An application of coding algebra to the design of a digital multiplexing system using linear sequential circuits", booktitle = "Proc.\ 7th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1966", pages = "274--281", } @InProceedings{Bayer66, author = "R. Bayer", title = "Automorphism groups and quotients of strongly connected automata and monadic algebras", booktitle = "Proc.\ 7th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1966", pages = "282--297", } @InProceedings{Paul66, author = "M. Paul", title = "On the automorphism group of a reduced automation", booktitle = "Proc.\ 7th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1966", pages = "298--304", } @InProceedings{PauUng67, author = "M. C. Paull and S. H. Unger", title = "Structural equivalence of context-free grammars", booktitle = "Proc.\ 8th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1967", pages = "7--13", } @InProceedings{Rosenkrantz67, author = "D. J. Rosenkrantz", title = "Programmed grammars: {A} new device for generating formal languages", booktitle = "Proc.\ 8th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1967", pages = "14--20", } @InProceedings{Aho67, author = "A. V. Aho", title = "Indexed grammars --- An extension of context free grammars", booktitle = "Proc.\ 8th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1967", pages = "21--31", } @InProceedings{Greibach67, author = "S. A. Greibach", title = "An infinite hierarchy of context-free languages", booktitle = "Proc.\ 8th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1967", pages = "32--36", } @InProceedings{HopUll67, author = "J. E. Hopcroft and J. D. Ullman", title = "Two results on one-way stack automata", booktitle = "Proc.\ 8th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1967", pages = "37--44", } @InProceedings{Wagner67, author = "E. G. Wagner", title = "On the structure of programming languages, or, six languages for Turing machines", booktitle = "Proc.\ 8th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1967", pages = "45--54", } @InProceedings{KarMil67, author = "R. M. Karp and R. E. Miller", title = "Parallel program schemata: {A} mathematical model for parallel computation", booktitle = "Proc.\ 8th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1967", pages = "55--61", } @InProceedings{Luconi67, author = "F. L. Luconi", title = "Completely functional asynchronous computational structures", booktitle = "Proc.\ 8th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1967", pages = "62--70", } @InProceedings{Muller67, author = "D. E. Muller", title = "The general synthesis problem for asynchronous digital networks", booktitle = "Proc.\ 8th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1967", pages = "71--82", } @InProceedings{Amoroso67, author = "S. M. Amoroso", title = "A parallel-acting iterative automaton", booktitle = "Proc.\ 8th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1967", pages = "83--94", } @InProceedings{ArmFriMen67, author = "D. B. Armstrong and A. D. Friedman and P. R. Menon", title = "Synthesis of asynchronous sequential circuits with minimum number of delay elements", booktitle = "Proc.\ 8th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1967", pages = "95--105", } @InProceedings{Friedman67, author = "A. D. Friedman", title = "Universal single transition time asynchronous state assignments", booktitle = "Proc.\ 8th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1967", pages = "106--111", } @InProceedings{Hartmanis67, author = "J. Hartmanis", title = "On the complexity of undecidable problems in automata theory", booktitle = "Proc.\ 8th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1967", pages = "112--116", } @InProceedings{MeyRosFis67, author = "A. R. Meyer and A. L. Rosenberg and P. C. Fischer", title = "Turing machines with several read-write heads", booktitle = "Proc.\ 8th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1967", pages = "117--127", } @InProceedings{GinGre67, author = "S. Ginsburg and S. Greibach", title = "Abstract families of languages", booktitle = "Proc.\ 8th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1967", pages = "128--139", } @InProceedings{HopUll67, author = "J. E. Hopcroft and J. D. Ullman", title = "An approach to a unified theory of automata", booktitle = "Proc.\ 8th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1967", pages = "140--147", } @InProceedings{FisMeyRos67, author = "P. C. Fischer and A. R. Meyer and A. L. Rosenberg", title = "Real time counter machines", booktitle = "Proc.\ 8th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1967", pages = "148--154", } @InProceedings{BluHew67, author = "M. Blum and C. Hewitt", title = "Automata on a 2-dimensional tape", booktitle = "Proc.\ 8th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1967", pages = "155--160", } @InProceedings{Kautz67, author = "W. H. Kautz", title = "Testing for faults in combinational cellular logic arrays", booktitle = "Proc.\ 8th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1967", pages = "161--174", } @InProceedings{Klaschka67, author = "T. F. Klaschka", title = "Two contributions to redundancy theory", booktitle = "Proc.\ 8th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1967", pages = "175--183", } @InProceedings{ElsSto67, author = "B. Elspas and H. S. Stone", title = "Decomposition of group functions and the synthesis of multirail cascades", booktitle = "Proc.\ 8th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1967", pages = "184--196", } @InProceedings{MowFu67, author = "W. C. W. Mow and K. S. Fu", title = "Generalization of self-dual and self-complementary dual functions", booktitle = "Proc.\ 8th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1967", pages = "197--209", } @InProceedings{FerGra67, author = "D. Ferrari and A. Grasselli", title = "A cellular structure for sequential networks", booktitle = "Proc.\ 8th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1967", pages = "210--225", } @InProceedings{MasSai67, author = "J. L. Massey and M. K. Sain", title = "Inverse problems in coding, automata, and continuous systems", booktitle = "Proc.\ 8th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1967", pages = "226--232", } @InProceedings{WeiHop67, author = "P. Weiner and J. E. Hopcroft", title = "Modular decomposition of synchronous sequential machines", booktitle = "Proc.\ 8th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1967", pages = "233--239", } @InProceedings{Martin67, author = "R. L. Martin", title = "Memory-span concepts and the synthesis of sequential machines in feedback shift-register form", booktitle = "Proc.\ 8th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1967", pages = "240--251", } @InProceedings{LawPia67, author = "E. L. Lawler and T. F. Piatkowski", title = "Generalized state identification problems", booktitle = "Proc.\ 8th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1967", pages = "252--254", } @InProceedings{BrzCoh67, author = "J. A. Brzozowski and R. Cohen", title = "On decompositions of regular events", booktitle = "Proc.\ 8th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1967", pages = "255--264", } @InProceedings{CohBrz67, author = "R. Cohen and J. A. Brzozowski", title = "On the star height of regular events", booktitle = "Proc.\ 8th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1967", pages = "265--279", } @InProceedings{Paz67, author = "A. Paz", title = "Fuzzy star functions, probabilistic automata and their approximation by nonprobabilistic automata", booktitle = "Proc.\ 8th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1967", pages = "280--290", } @InProceedings{SpiArb67, author = "P. M. Spira and M. A. Arbib", title = "Computation times for finite groups, semigroups and automata", booktitle = "Proc.\ 8th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1967", pages = "291--295", } @InProceedings{Jones67, author = "N. D. Jones", title = "Classes of automata and transitive closure", booktitle = "Proc.\ 8th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1967", pages = "296--306", } @InProceedings{AblYoeTur67, author = "C. M. Ablow and M. Yoeli and J. Turner", title = "Irreducible decompositions of transformation graphs by assignment techniques", booktitle = "Proc.\ 8th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1967", pages = "307--313", } @InProceedings{Bayer67, author = "R. Bayer", title = "On endomorphisms and congruences of automata", booktitle = "Proc.\ 8th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1967", pages = "314--321", } @InProceedings{BavTho67, author = "Z. Bavel and J. W. Thomas", title = "On the decomposability of monadic algebras and automata", booktitle = "Proc.\ 8th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1967", pages = "322--335", } @InProceedings{TanMenFri68, author = "C. J. Tan and P. R. Menon and A. D. Friedman", title = "Structural simplification and decomposition of asynchronous sequential circuits", booktitle = "Proc.\ 9th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1968", pages = "7--19", } @InProceedings{Kinney68, author = "L. L. Kinney", title = "A characterization of some asynchronous state assignments", booktitle = "Proc.\ 9th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1968", pages = "20--27", } @InProceedings{Schwartz68, author = "S. J. Schwartz", title = "An algorithm for minimizing read only memories for machine control", booktitle = "Proc.\ 9th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1968", pages = "28--33", } @InProceedings{NieCar68, author = "T. T. Nieh and J. W. Carlyle", title = "On a measure of complexity for stochastic sequential machines", booktitle = "Proc.\ 9th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1968", pages = "34--41", } @InProceedings{Paz68, author = "A. Paz", title = "Infinite state probabilistic transition tables and chains ergodic properties", booktitle = "Proc.\ 9th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1968", pages = "42--50", } @InProceedings{Cobham68, author = "A. Cobham", title = "On the Hartmanis-Stearns problem for class of {TAG} machines", booktitle = "Proc.\ 9th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1968", pages = "51--60", } @InProceedings{Wagner68, author = "E. G. Wagner", title = "`Tapeless' bounded action machines", booktitle = "Proc.\ 9th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1968", pages = "61--68", } @InProceedings{Spira68, author = "P. M. Spira", title = "On the computation time of finite functions", booktitle = "Proc.\ 9th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1968", pages = "69--75", } @InProceedings{Luconi68, author = "F. L. Luconi", title = "Output functional computational structures", booktitle = "Proc.\ 9th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1968", pages = "76--84", } @InProceedings{Ito68, author = "T. Ito", title = "Some formal properties of a class of non-deterministic program schemata", booktitle = "Proc.\ 9th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1968", pages = "85--98", } @InProceedings{Basu68, author = "S. K. Basu", title = "Transformation of program schemes to standard forms", booktitle = "Proc.\ 9th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1968", pages = "99--105", } @InProceedings{SteLew68, author = "R. E. Stearns and II P. M. Lewis", title = "Property grammars and table machines", booktitle = "Proc.\ 9th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1968", pages = "106--119", } @InProceedings{Whitney68, author = "G. Whitney", title = "The position of table languages within the hierarchy of nondeterministic on-line tape-bounded Turing machine languages", booktitle = "Proc.\ 9th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1968", pages = "120--130", } @InProceedings{Fischer68, author = "M. J. Fischer", title = "Grammars with macro-like productions", booktitle = "Proc.\ 9th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1968", pages = "131--142", } @InProceedings{AhoUll68, author = "A. V. Aho and J. D. Ullman", title = "Automaton analogs of syntax directed translation schemata", booktitle = "Proc.\ 9th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1968", pages = "143--159", } @InProceedings{Petrone68, author = "L. Petrone", title = "Syntax directed mappings of context-free languages", booktitle = "Proc.\ 9th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1968", pages = "160--175", } @InProceedings{PauUng68, author = "M. C. Paull and S. H. Unger", title = "Structural equivalence and {LL}-k grammars", booktitle = "Proc.\ 9th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1968", pages = "176--186", } @InProceedings{Weiss68, author = "C. D. Weiss", title = "Optimal synthesis of arbitrary switching functions with regular arrays of 2-input, 1-output switching elements", booktitle = "Proc.\ 9th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1968", pages = "187--212", } @InProceedings{Lechner68, author = "R. J. Lechner", title = "A transform approach to logic design", booktitle = "Proc.\ 9th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1968", pages = "213--234", } @InProceedings{Breuer68, author = "M. A. Breuer", title = "Fault detection in a linear cascade of identical machines", booktitle = "Proc.\ 9th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1968", pages = "235--243", } @InProceedings{Mukhopadhyay68, author = "A. Mukhopadhyay", title = "Lupanov decoding networks", booktitle = "Proc.\ 9th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1968", pages = "244--256", } @InProceedings{KauTur68, author = "W. H. Kautz and J. Turner", title = "Universal connecting networks and the synthesis of canonical sequential circuits", booktitle = "Proc.\ 9th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1968", pages = "257--268", } @InProceedings{Smith68, author = "III A. R. Smith", title = "Simple computation-universal cellular spaces and self-reproduction", booktitle = "Proc.\ 9th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1968", pages = "269--277", } @InProceedings{Brzozowski68, author = "J. A. Brzozowski", title = "Regular-like expressions for some irregular languages", booktitle = "Proc.\ 9th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1968", pages = "278--286", } @InProceedings{Greibach68, author = "S. Greibach", title = "Checking automata and one-way stack languages", booktitle = "Proc.\ 9th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1968", pages = "287--291", } @InProceedings{GinHop68, author = "S. Ginsburg and J. Hopcroft", title = "Two-way balloon automata and {AFL}", booktitle = "Proc.\ 9th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1968", pages = "292--297", } @InProceedings{Book68, author = "R. V. Book", title = "Grammars with linear time functions", booktitle = "Proc.\ 9th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1968", pages = "298--305", } @InProceedings{GinSpa68, author = "S. Ginsburg and E. H. Spanier", title = "Derivation-bounded languages", booktitle = "Proc.\ 9th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1968", pages = "306--314", } @InProceedings{Schkolnick68, author = "M. Schkolnick", title = "Two-type bracketed grammars", booktitle = "Proc.\ 9th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1968", pages = "315--326", } @InProceedings{HarHop68, author = "J. Hartmanis and J. E. Hopcroft", title = "Structure of undecidable problems in automata theory", booktitle = "Proc.\ 9th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1968", pages = "327--333", } @InProceedings{Young68, author = "P. R. Young", title = "Toward a theory of enumerations", booktitle = "Proc.\ 9th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1968", pages = "334--350", } @InProceedings{MeyFis68, author = "A. Meyer and P. C. Fischer", title = "On computational speed-up", booktitle = "Proc.\ 9th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1968", pages = "351--355", } @InProceedings{FisRos68, author = "M. J. Fischer and A. L. Rosenberg", title = "Limited random access Turing machines", booktitle = "Proc.\ 9th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1968", pages = "356--367", } @InProceedings{Herman68, author = "G. T. Herman", title = "The uniform halting problem for generalized one state Turing machines", booktitle = "Proc.\ 9th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1968", pages = "368--372", } @InProceedings{FisHarBlu68, author = "P. C. Fischer and J. Hartmanis and M. Blum", title = "Tape reversal complexity hierarchies", booktitle = "Proc.\ 9th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1968", pages = "373--382", } @InProceedings{Cohen68, author = "R. S. Cohen", title = "Transition graphs and the star height problem", booktitle = "Proc.\ 9th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1968", pages = "383--394", } @InProceedings{Muller68, author = "D. E. Muller", title = "Use of multiple index matrices in generalized automata theory", booktitle = "Proc.\ 9th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1968", pages = "395--404", } @InProceedings{Yeh68, author = "R. T. Yeh", title = "Structural equivalence of automata", booktitle = "Proc.\ 9th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1968", pages = "405--412", } @InProceedings{UllWei68, author = "J. D. Ullman and P. Weiner", title = "Universal two state machines: Characterization theorems and decomposition schemes", booktitle = "Proc.\ 9th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1968", pages = "413--426", } @InProceedings{Davis68, author = "W. A. Davis", title = "The linearity of sequential machines: {A} critical review", booktitle = "Proc.\ 9th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1968", pages = "427--430", } @InProceedings{ArnTanNew68, author = "T. F. Arnold and C. -J. Tan and M. M. Newborn", title = "Iteratively realized sequential circuits", booktitle = "Proc.\ 9th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1968", pages = "431--448", } @InProceedings{PetRit69, author = "P. S. Peters and R. W. Ritchie", title = "Context-sensitive immediate constituent analysis --- Context-free languages revisited", booktitle = "Proc.\ 1st ACM Symposium on Theory of Computing (STOC)", year = "1969", pages = "1--8", } @InProceedings{Rose69, author = "G. F. Rose", title = "Abstract families of processors", booktitle = "Proc.\ 1st ACM Symposium on Theory of Computing (STOC)", year = "1969", pages = "9--14", } @InProceedings{BooGre69, author = "R. V. Book and S. A. Greibach", title = "Quasi-realtime languages", booktitle = "Proc.\ 1st ACM Symposium on Theory of Computing (STOC)", year = "1969", pages = "15--18", } @InProceedings{Ullian69, author = "J. S. Ullian", title = "The inherent ambiguity partial algorithm problem for context free languages", booktitle = "Proc.\ 1st ACM Symposium on Theory of Computing (STOC)", year = "1969", pages = "19--20", } @InProceedings{Chandler69, author = "W. J. Chandler", title = "Abstract families of deterministic languages", booktitle = "Proc.\ 1st ACM Symposium on Theory of Computing (STOC)", year = "1969", pages = "21--30", } @InProceedings{Ogden69, author = "W. F. Ogden", title = "Intercalation theorems for stack languages", booktitle = "Proc.\ 1st ACM Symposium on Theory of Computing (STOC)", year = "1969", pages = "31--42", } @InProceedings{Blum69, author = "M. Blum", title = "On effective procedures for speeding up algorithms", booktitle = "Proc.\ 1st ACM Symposium on Theory of Computing (STOC)", year = "1969", pages = "43--54", } @InProceedings{Basu69, author = "S. K. Basu", title = "On classes of computable functions", booktitle = "Proc.\ 1st ACM Symposium on Theory of Computing (STOC)", year = "1969", pages = "55--59", } @InProceedings{Loveland69, author = "D. W. Loveland", title = "On minimal-program complexity measures", booktitle = "Proc.\ 1st ACM Symposium on Theory of Computing (STOC)", year = "1969", pages = "61--66", } @InProceedings{Borodin69, author = "A. Borodin", title = "Complexity classes of recursive functions and the existence of complexity gaps", booktitle = "Proc.\ 1st ACM Symposium on Theory of Computing (STOC)", year = "1969", pages = "67--78", } @InProceedings{McCMey69, author = "E. M. McCreight and A. R. Meyer", title = "Classes of computable functions defined by bounds on computation", booktitle = "Proc.\ 1st ACM Symposium on Theory of Computing (STOC)", year = "1969", pages = "79--88", } @InProceedings{Young69, author = "P. R. Young", title = "Speed-ups by changing the order in which sets are enumerated", booktitle = "Proc.\ 1st ACM Symposium on Theory of Computing (STOC)", year = "1969", pages = "89--92", } @InProceedings{AhoUll69, author = "A. V. Aho and J. D. Ullman", title = "Translations on a context free grammar", booktitle = "Proc.\ 1st ACM Symposium on Theory of Computing (STOC)", year = "1969", pages = "93--112", } @InProceedings{Johansen69, author = "P. Johansen", title = "Free groups and regular expressions", booktitle = "Proc.\ 1st ACM Symposium on Theory of Computing (STOC)", year = "1969", pages = "113--128", } @InProceedings{Thatcher69, author = "J. W. Thatcher", title = "Transformations and translations from the point of view of generalized finite automata theory", booktitle = "Proc.\ 1st ACM Symposium on Theory of Computing (STOC)", year = "1969", pages = "129--142", } @InProceedings{Rounds69, author = "W. C. Rounds", title = "Context-free grammars on trees", booktitle = "Proc.\ 1st ACM Symposium on Theory of Computing (STOC)", year = "1969", pages = "143--148", } @InProceedings{HerIsa69, author = "G. T. Herman and S. D. Isard", title = "Computability over arbitrary fields", booktitle = "Proc.\ 1st ACM Symposium on Theory of Computing (STOC)", year = "1969", pages = "149--154", } @InProceedings{Shepard69, author = "C. D. Shepard", title = "Languages in general algebras", booktitle = "Proc.\ 1st ACM Symposium on Theory of Computing (STOC)", year = "1969", pages = "155--164", } @InProceedings{RosSte69, author = "D. J. Rosenkrantz and R. E. Stearns", title = "Properties of deterministic top down grammars", booktitle = "Proc.\ 1st ACM Symposium on Theory of Computing (STOC)", year = "1969", pages = "165--180", } @InProceedings{Fischer69, author = "M. J. Fischer", title = "Some properties of precedence languages", booktitle = "Proc.\ 1st ACM Symposium on Theory of Computing (STOC)", year = "1969", pages = "181--190", } @InProceedings{Korenjak69, author = "A. J. Korenjak", title = "Efficient {LR}(1) processor construction", booktitle = "Proc.\ 1st ACM Symposium on Theory of Computing (STOC)", year = "1969", pages = "191--200", } @InProceedings{ManPnu69, author = "Z. Manna and A. Pnueli", title = "Formalization of properties of recursively defined functions", booktitle = "Proc.\ 1st ACM Symposium on Theory of Computing (STOC)", year = "1969", pages = "201--210", } @InProceedings{Zeiger69, author = "H. P. Zeiger", title = "Formal models for some features of programming languages", booktitle = "Proc.\ 1st ACM Symposium on Theory of Computing (STOC)", year = "1969", pages = "211--216", } @InProceedings{Blum69, author = "E. K. Blum", title = "Towards a theory of semantics and compilers for programming languages", booktitle = "Proc.\ 1st ACM Symposium on Theory of Computing (STOC)", year = "1969", pages = "217--228", } @InProceedings{Cook69, author = "S. A. Cook", title = "Variations on pushdown machines", booktitle = "Proc.\ 1st ACM Symposium on Theory of Computing (STOC)", year = "1969", pages = "229--232", } @InProceedings{Cole69, author = "S. N. Cole", title = "Pushdown store machines and real-time computation", booktitle = "Proc.\ 1st ACM Symposium on Theory of Computing (STOC)", year = "1969", pages = "233--246", } @InProceedings{Savitch69, author = "W. J. Savitch", title = "Deterministic simulation of non-deterministic Turing machines", booktitle = "Proc.\ 1st ACM Symposium on Theory of Computing (STOC)", year = "1969", pages = "247--248", } @InProceedings{Hodes69, author = "L. Hodes", title = "The logical complexity of geometric properties in the plane", booktitle = "Proc.\ 1st ACM Symposium on Theory of Computing (STOC)", year = "1969", pages = "249--254", } @InProceedings{Avizienis69, author = "A. Avizienis", title = "On the problem of computational time and complexity of arithmetic functions", booktitle = "Proc.\ 1st ACM Symposium on Theory of Computing (STOC)", year = "1969", pages = "255--258", } @InProceedings{AmoLieYam69, author = "S. Amoroso and E. Liebein and H. Yamada", title = "A unifying framework for the theory of iterative arrays of machines", booktitle = "Proc.\ 1st ACM Symposium on Theory of Computing (STOC)", year = "1969", pages = "259--270", } @InProceedings{Spira69, author = "P. M. Spira", title = "On the computation time of certain classes of Boolean functions", booktitle = "Proc.\ 1st ACM Symposium on Theory of Computing (STOC)", year = "1969", pages = "271--272", } @InProceedings{BorConHop69, author = "A. Borodin and R. L. Constable and J. E. Hopcroft", title = "Dense and non-dense families of complexity classes", booktitle = "Proc.\ 10th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1969", pages = "7--19", } @InProceedings{Constable69, author = "R. L. Constable", title = "The operator gap", booktitle = "Proc.\ 10th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1969", pages = "20--26", } @InProceedings{Tsichritzis69, author = "D. Tsichritzis", title = "Iterative procedures", booktitle = "Proc.\ 10th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1969", pages = "27--35", } @InProceedings{HopKer69, author = "J. E. Hopcroft and L. R. Kerr", title = "Some techniques for proving certain simple programs optimal", booktitle = "Proc.\ 10th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1969", pages = "36--45", } @InProceedings{Logrippo69, author = "L. Logrippo", title = "Storage interference in asynchronous computations", booktitle = "Proc.\ 10th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1969", pages = "46--60", } @InProceedings{BruAlt69, author = "J. Bruno and S. M. Altman", title = "Asynchronous control networks", booktitle = "Proc.\ 10th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1969", pages = "61--73", } @InProceedings{Booth69, author = "T. L. Booth", title = "Probabilistic representation of formal languages", booktitle = "Proc.\ 10th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1969", pages = "74--81", } @InProceedings{Lovell69, author = "B. W. Lovell", title = "The incompletely-specified finite-state stochastic sequential machine equivalence and reduction", booktitle = "Proc.\ 10th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1969", pages = "82--89", } @InProceedings{Gelenbe69, author = "S. E. Gelenbe", title = "On probabilistic automata with structural restrictions", booktitle = "Proc.\ 10th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1969", pages = "90--99", } @InProceedings{KfoLiu69, author = "D. J. Kfoury and C. L. Liu", title = "Definite stochastic sequential machines and definite stochastic matrices", booktitle = "Proc.\ 10th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1969", pages = "100--105", } @InProceedings{GraHar69, author = "J. N. Gray and M. A. Harrison", title = "Single pass precedence analysis", booktitle = "Proc.\ 10th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1969", pages = "106--117", } @InProceedings{SteRos69, author = "R. E. Stearns and D. J. Rosenkrantz", title = "Table machine simulation", booktitle = "Proc.\ 10th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1969", pages = "118--128", } @InProceedings{Kosaraju69, author = "S. R. Kosaraju", title = "Recognition of context-free and stack languages", booktitle = "Proc.\ 10th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1969", pages = "129--132", } @InProceedings{Walters69, author = "D. A. Walters", title = "Deterministic context-sensitive languages", booktitle = "Proc.\ 10th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1969", pages = "133--148", } @InProceedings{Fischer69, author = "M. J. Fischer", title = "Two characterizations of the context-sensitive languages", booktitle = "Proc.\ 10th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1969", pages = "149--156", } @InProceedings{FisRan69, author = "G. A. Fischer and G. N. Raney", title = "On the representation of formal languages using automata on networks", booktitle = "Proc.\ 10th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1969", pages = "157--165", } @InProceedings{Kohavi69, author = "I. Kohavi", title = "Fault diagnosis of logical circuits", booktitle = "Proc.\ 10th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1969", pages = "166--173", } @InProceedings{Kriz69, author = "T. A. Kriz", title = "Machine identification concepts of path sensitizing fault diagnosis", booktitle = "Proc.\ 10th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1969", pages = "174--181", } @InProceedings{ShaSze69, author = "R. T. Sha and T. W. Sze", title = "Threshold logic: {A} simplified synthesis by a recursive method", booktitle = "Proc.\ 10th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1969", pages = "182--193", } @InProceedings{ArnNew69, author = "T. F. Arnold and M. M. Newborn", title = "Iteratively realized sequential circuits: Further considerations", booktitle = "Proc.\ 10th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1969", pages = "194--212", } @InProceedings{KinWei69, author = "III W. F. King and P. Weiner", title = "On the modular decomposition of autonomous sequential machines", booktitle = "Proc.\ 10th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1969", pages = "213--221", } @InProceedings{Greibach69, author = "S. A. Greibach", title = "Full {AFL}'{S} and nested iterated substitution", booktitle = "Proc.\ 10th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1969", pages = "222--230", } @InProceedings{AhoUll69, author = "A. V. Aho and J. D. Ullman", title = "A characterization of two-way deterministic classes of languages", booktitle = "Proc.\ 10th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1969", pages = "231--239", } @InProceedings{Brainerd69, author = "W. S. Brainerd", title = "Semi-Thue systems and representations of trees", booktitle = "Proc.\ 10th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1969", pages = "240--244", } @InProceedings{JosKosYam69, author = "A. K. Joshi and S. R. Kosaraju and H. Yameda", title = "String adjunct grammars", booktitle = "Proc.\ 10th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1969", pages = "245--262", } @InProceedings{NasCoh69, author = "B. O. Nash and R. S. Cohen", title = "Parallel leveled grammars", booktitle = "Proc.\ 10th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1969", pages = "263--276", } @InProceedings{Constable70, author = "R. L. Constable", title = "On the size of programs in subrecursive formalisms", booktitle = "Proc.\ 2nd ACM Symposium on Theory of Computing (STOC)", year = "1970", pages = "1--9", } @InProceedings{Cudia70, author = "D. F. Cudia", title = "The degree hierarchy of undecidable problems of formal grammars", booktitle = "Proc.\ 2nd ACM Symposium on Theory of Computing (STOC)", year = "1970", pages = "10--21", } @InProceedings{Lewis70, author = "F. D. Lewis", title = "Decision problems for complexity classes of computable functions", booktitle = "Proc.\ 2nd ACM Symposium on Theory of Computing (STOC)", year = "1970", pages = "22--30", } @InProceedings{LanRob70, author = "L. H. Landweber and E. L. Robertson", title = "Recursive properties of abstract complexity classes", booktitle = "Proc.\ 2nd ACM Symposium on Theory of Computing (STOC)", year = "1970", pages = "31--36", } @InProceedings{BasYou70, author = "L. J. Bass and P. R. Young", title = "Hierarchies based on computational complexity and irregularities of class determined measured sets", booktitle = "Proc.\ 2nd ACM Symposium on Theory of Computing (STOC)", year = "1970", pages = "37--40", } @InProceedings{Ausiello70, author = "G. Ausiello", title = "On bounds on the number of steps to compute functions", booktitle = "Proc.\ 2nd ACM Symposium on Theory of Computing (STOC)", year = "1970", pages = "41--47", } @InProceedings{Rosenberg70, author = "A. L. Rosenberg", title = "Data graphs and addressing schemes", booktitle = "Proc.\ 2nd ACM Symposium on Theory of Computing (STOC)", year = "1970", pages = "48--61", } @InProceedings{Burkhard70, author = "W. A. Burkhard", title = "Complexity problems in real time computations", booktitle = "Proc.\ 2nd ACM Symposium on Theory of Computing (STOC)", year = "1970", pages = "62--69", } @InProceedings{Cook70, author = "S. A. Cook", title = "Path systems and language recognition", booktitle = "Proc.\ 2nd ACM Symposium on Theory of Computing (STOC)", year = "1970", pages = "70--72", } @InProceedings{Morris70, author = "J. B. Morris", title = "A result on the relationship between simple precedence languages and reducing transition languages", booktitle = "Proc.\ 2nd ACM Symposium on Theory of Computing (STOC)", year = "1970", pages = "73--80", } @InProceedings{Lindstrom70, author = "G. Lindstrom", title = "The design of parsers for incremental language processors", booktitle = "Proc.\ 2nd ACM Symposium on Theory of Computing (STOC)", year = "1970", pages = "81--91", } @InProceedings{BooGreWeg70, author = "R. V. Book and S. A. Greibach and B. Wegbreit", title = "Tape- and time-bounded Turing acceptors and {AFL}s", booktitle = "Proc.\ 2nd ACM Symposium on Theory of Computing (STOC)", year = "1970", pages = "92--99", } @InProceedings{Lewis70, author = "D. J. Lewis", title = "Closure of families of languages under substitution operators", booktitle = "Proc.\ 2nd ACM Symposium on Theory of Computing (STOC)", year = "1970", pages = "100--108", } @InProceedings{Rounds70, author = "W. C. Rounds", title = "Tree-oriented proofs of some theorems on context-free and indexed languages", booktitle = "Proc.\ 2nd ACM Symposium on Theory of Computing (STOC)", year = "1970", pages = "109--116", } @InProceedings{Rosen70, author = "B. K. Rosen", title = "Tree-manipulating systems and Church-Rosser theorems", booktitle = "Proc.\ 2nd ACM Symposium on Theory of Computing (STOC)", year = "1970", pages = "117--128", } @InProceedings{MarVer70, author = "D. F. Martin and S. A. Vere", title = "On syntax-directed transduction and tree transducers", booktitle = "Proc.\ 2nd ACM Symposium on Theory of Computing (STOC)", year = "1970", pages = "129--135", } @InProceedings{AhoUll70, author = "A. V. Aho and J. D. Ullman", title = "Transformations on straight line programs", booktitle = "Proc.\ 2nd ACM Symposium on Theory of Computing (STOC)", year = "1970", pages = "136--148", } @InProceedings{McGowan70, author = "C. L. McGowan", title = "The corrections of a modified {SECD} machine", booktitle = "Proc.\ 2nd ACM Symposium on Theory of Computing (STOC)", year = "1970", pages = "149--157", } @InProceedings{Manna70, author = "Z. Manna", title = "Second-order mathematical theory of computation", booktitle = "Proc.\ 2nd ACM Symposium on Theory of Computing (STOC)", year = "1970", pages = "158--168", } @InProceedings{KinFlo70, author = "J. C. King and R. W. Floyd", title = "An interpretation oriented theorem prover over integers", booktitle = "Proc.\ 2nd ACM Symposium on Theory of Computing (STOC)", year = "1970", pages = "169--179", } @InProceedings{Reiter70, author = "R. Reiter", title = "The predicate elimination strategy in theorem proving", booktitle = "Proc.\ 2nd ACM Symposium on Theory of Computing (STOC)", year = "1970", pages = "180--183", } @InProceedings{Strong70, author = "Jr. H. R. Strong", title = "Translating recursion equations into flow charts", booktitle = "Proc.\ 2nd ACM Symposium on Theory of Computing (STOC)", year = "1970", pages = "184--197", } @InProceedings{Ellis70, author = "C. A. Ellis", title = "Probabilistic tree automata", booktitle = "Proc.\ 2nd ACM Symposium on Theory of Computing (STOC)", year = "1970", pages = "198--205", } @InProceedings{Chang70, author = "S. -K. Chang", title = "The analysis of two-dimensional patterns using picture processing grammars", booktitle = "Proc.\ 2nd ACM Symposium on Theory of Computing (STOC)", year = "1970", pages = "206--216", } @InProceedings{Perrot70, author = "J. -F. Perrot", title = "On the relationship between finite automata, finite monoids, and prefix codes", booktitle = "Proc.\ 2nd ACM Symposium on Theory of Computing (STOC)", year = "1970", pages = "217--220", } @InProceedings{Nivat70, author = "M. Nivat", title = "On some families of languages related to the Dyck language", booktitle = "Proc.\ 2nd ACM Symposium on Theory of Computing (STOC)", year = "1970", pages = "221--225", } @InProceedings{Ullian70, author = "J. S. Ullian", title = "Three theorems on abstract families of languages", booktitle = "Proc.\ 2nd ACM Symposium on Theory of Computing (STOC)", year = "1970", pages = "226--230", } @InProceedings{Rutledge70, author = "J. D. Rutledge", title = "Program schemata as automata, part {I}", booktitle = "Proc.\ 11th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1970", pages = "7--24", } @InProceedings{AhoUll70, author = "A. V. Aho and J. D. Ullman", title = "Equivalence of programs with structured variables", booktitle = "Proc.\ 11th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1970", pages = "25--31", } @InProceedings{Keller70, author = "R. M. Keller", title = "On maximally parallel schemata", booktitle = "Proc.\ 11th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1970", pages = "32--50", } @InProceedings{GalKar70, author = "D. Gale and R. M. Karp", title = "A phenomenon in the theory of sorting", booktitle = "Proc.\ 11th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1970", pages = "51--59", } @InProceedings{ConBor70, author = "R. L. Constable and A. Borodin", title = "On the efficiency of programs in subrecursive formalisms", booktitle = "Proc.\ 11th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1970", pages = "60--67", } @InProceedings{Reingold70, author = "E. M. Reingold", title = "On the optimality of some set and vector algorithms", booktitle = "Proc.\ 11th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1970", pages = "68--71", } @InProceedings{Kameda70, author = "T. Kameda", title = "On the computational power of some machines with pushdown-like storage", booktitle = "Proc.\ 11th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1970", pages = "72", } @InProceedings{Paterson70, author = "M. S. Paterson", title = "Tape-bounds for time-bounded Turing machines", booktitle = "Proc.\ 11th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1970", pages = "73--75", } @InProceedings{Zalcstein70, author = "Y. Zalcstein", title = "On star-free events", booktitle = "Proc.\ 11th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1970", pages = "76--80", } @InProceedings{Fliess70, author = "M. Fliess", title = "Deux applications de la representation matricielle d'une serie rationnelle non commutative", booktitle = "Proc.\ 11th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1970", pages = "81--87", } @InProceedings{Ashkinazy70, author = "A. Ashkinazy", title = "Fault detection experiments for asynchronous sequential machines", booktitle = "Proc.\ 11th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1970", pages = "88--96", } @InProceedings{FisTan70, author = "M. A. Fischler and M. Tannenbaum", title = "Synchronizing and representation problems for sequential machines with masked outputs", booktitle = "Proc.\ 11th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1970", pages = "97--103", } @InProceedings{BreHul70, author = "J. G. Bredeson and P. T. Hulina", title = "Elimination of static and dynamic hazards in combinatorial switching circuits", booktitle = "Proc.\ 11th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1970", pages = "104--108", } @InProceedings{Mago70, author = "G. Mago", title = "Asynchronous sequential circuits with (2,1) type state assignments", booktitle = "Proc.\ 11th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1970", pages = "109--113", } @InProceedings{Unger70, author = "S. H. Unger", title = "Asynchronous sequential switching circuits with unrestricted input changes", booktitle = "Proc.\ 11th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1970", pages = "114--121", } @InProceedings{Bjorner70, author = "D. Bjorner", title = "The synthesis of finite state syntax directed top-down and bottom-up transducers", booktitle = "Proc.\ 11th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1970", pages = "122--132", } @InProceedings{Benson70, author = "D. B. Benson", title = "Syntactic clues", booktitle = "Proc.\ 11th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1970", pages = "133--138", } @InProceedings{RosLew70, author = "D. J. Rosenkrantz and II P. M. Lewis", title = "Deterministic left corner parsing", booktitle = "Proc.\ 11th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1970", pages = "139--152", } @InProceedings{BirUll70, author = "A. Birman and J. D. Ullman", title = "Parsing algorithms with backtrack", booktitle = "Proc.\ 11th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1970", pages = "153--174", } @InProceedings{Graham70, author = "S. L. Graham", title = "Extended precedence languages, bounded right context languages, and deterministic languages", booktitle = "Proc.\ 11th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1970", pages = "175--180", } @InProceedings{Giuliano70, author = "J. A. Giuliano", title = "Writing stack acceptors", booktitle = "Proc.\ 11th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1970", pages = "181--193", } @InProceedings{Banks70, author = "E. R. Banks", title = "Universality in cellular automata", booktitle = "Proc.\ 11th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1970", pages = "194--215", } @InProceedings{Smith70, author = "III A. R. Smith", title = "Cellular automata and formal languages", booktitle = "Proc.\ 11th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1970", pages = "216--224", } @InProceedings{ShoCof70, author = "A. Shoshani and E. G. Coffman", title = "Sequencing tasks in multiprocess systems to avoid deadlocks", booktitle = "Proc.\ 11th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1970", pages = "225--235", } @InProceedings{Zeigler70, author = "B. P. Zeigler", title = "Series-parallel irreducibility: Machine oriented definitions and proofs", booktitle = "Proc.\ 11th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1970", pages = "236--239", } @InProceedings{Stanat71, author = "D. F. Stanat", title = "Formal languages and power series", booktitle = "Proc.\ 3rd ACM Symposium on Theory of Computing (STOC)", year = "1971", pages = "1--11", } @InProceedings{Wagner71, author = "E. G. Wagner", title = "An algebraic theory of recursive definitions and recursive languages", booktitle = "Proc.\ 3rd ACM Symposium on Theory of Computing (STOC)", year = "1971", pages = "12--23", } @InProceedings{Constable71, author = "R. L. Constable", title = "Loop schemata", booktitle = "Proc.\ 3rd ACM Symposium on Theory of Computing (STOC)", year = "1971", pages = "24--39", } @InProceedings{Munro71, author = "I. Munro", title = "Some results concerning efficient and optimal algorithms", booktitle = "Proc.\ 3rd ACM Symposium on Theory of Computing (STOC)", year = "1971", pages = "40--44", } @InProceedings{Fiduccia71, author = "C. M. Fiduccia", title = "Fast matrix multiplication", booktitle = "Proc.\ 3rd ACM Symposium on Theory of Computing (STOC)", year = "1971", pages = "45--49", } @InProceedings{Meyers71, author = "W. J. Meyers", title = "Linear representation of tree structure", booktitle = "Proc.\ 3rd ACM Symposium on Theory of Computing (STOC)", year = "1971", pages = "50--62", } @InProceedings{Buttelmann71, author = "H. W. Buttelmann", title = "On generalized finite automata and unrestricted generative grammars", booktitle = "Proc.\ 3rd ACM Symposium on Theory of Computing (STOC)", year = "1971", pages = "63--77", } @InProceedings{LevJos71, author = "L. S. Levy and A. K. Joshi", title = "Some results in tree automata", booktitle = "Proc.\ 3rd ACM Symposium on Theory of Computing (STOC)", year = "1971", pages = "78--85", } @InProceedings{Berry71, author = "D. M. Berry", title = "Block structure: Retention or deletion?", booktitle = "Proc.\ 3rd ACM Symposium on Theory of Computing (STOC)", year = "1971", pages = "86--100", } @InProceedings{Chang71, author = "S. -K. Chang", title = "On the parallel computation of local operations", booktitle = "Proc.\ 3rd ACM Symposium on Theory of Computing (STOC)", year = "1971", pages = "101--115", } @InProceedings{Boasson71, author = "L. Boasson", title = "An iteration theorem for one-counter languages", booktitle = "Proc.\ 3rd ACM Symposium on Theory of Computing (STOC)", year = "1971", pages = "116--120", } @InProceedings{GinGol71, author = "S. Ginsburg and J. Goldstine", title = "Intersection-closed full {AFL} and the recursively enumerable languages", booktitle = "Proc.\ 3rd ACM Symposium on Theory of Computing (STOC)", year = "1971", pages = "121--131", } @InProceedings{Rajlich71, author = "V. Rajlich", title = "Absolutely parallel grammars and two-way deterministic finite-state transducers", booktitle = "Proc.\ 3rd ACM Symposium on Theory of Computing (STOC)", year = "1971", pages = "132--137", } @InProceedings{Rosenberg71, author = "A. L. Rosenberg", title = "Addressable data graphs", booktitle = "Proc.\ 3rd ACM Symposium on Theory of Computing (STOC)", year = "1971", pages = "138--150", } @InProceedings{Cook71, author = "S. A. Cook", title = "The complexity of theorem-proving procedures", booktitle = "Proc.\ 3rd ACM Symposium on Theory of Computing (STOC)", year = "1971", pages = "151--158", } @InProceedings{AhoUll71, author = "A. V. Aho and J. D. Ullman", title = "The care and feeding of {LR}(k) grammars", booktitle = "Proc.\ 3rd ACM Symposium on Theory of Computing (STOC)", year = "1971", pages = "159--170", } @InProceedings{Wise71, author = "D. S. Wise", title = "Domolki's algorithm applied to generalized overlap resolvable grammars", booktitle = "Proc.\ 3rd ACM Symposium on Theory of Computing (STOC)", year = "1971", pages = "171--184", } @InProceedings{Terrine71, author = "G. Terrine", title = "An algorithm generating the decision table of a deterministic bottom up parser for a subset of context free grammars", booktitle = "Proc.\ 3rd ACM Symposium on Theory of Computing (STOC)", year = "1971", pages = "185--205", } @InProceedings{McNaughton71, author = "R. McNaughton", title = "A decision procedure for generalized sequential mapability-onto of regular sets", booktitle = "Proc.\ 3rd ACM Symposium on Theory of Computing (STOC)", year = "1971", pages = "206--218", } @InProceedings{Santos71, author = "E. S. Santos", title = "Algebraic structure theory of stochastic machines", booktitle = "Proc.\ 3rd ACM Symposium on Theory of Computing (STOC)", year = "1971", pages = "219--243", } @InProceedings{ConHar71, author = "R. L. Constable and J. Hartmanis", title = "Complexity of formal translations and speed-up results", booktitle = "Proc.\ 3rd ACM Symposium on Theory of Computing (STOC)", year = "1971", pages = "244--250", } @InProceedings{Machtey71, author = "M. Machtey", title = "Classification of computable functions by primitive recursive classes", booktitle = "Proc.\ 3rd ACM Symposium on Theory of Computing (STOC)", year = "1971", pages = "251--257", } @InProceedings{Robertson71, author = "E. L. Robertson", title = "Complexity classes of partial recursive functions", booktitle = "Proc.\ 3rd ACM Symposium on Theory of Computing (STOC)", year = "1971", pages = "258--266", } @InProceedings{Strong71, author = "H. R. Strong", title = "High level languages of maximum power", booktitle = "Proc.\ 12th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1971", pages = "1--4", } @InProceedings{ConGri71, author = "R. L. Constable and D. Gries", title = "On classes of program schemata", booktitle = "Proc.\ 12th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1971", pages = "5--19", } @InProceedings{BriMil71, author = "W. A. Brinsfield and R. E. Miller", title = "On the composition of parallel program schemata", booktitle = "Proc.\ 12th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1971", pages = "20--23", } @InProceedings{BurKro71, author = "W. A. Burkhard and F. W. Kroon", title = "Toward a weakly invariant complexity theory", booktitle = "Proc.\ 12th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1971", pages = "24--32", } @InProceedings{Abramson71, author = "F. G. Abramson", title = "Effective computation over the real numbers", booktitle = "Proc.\ 12th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1971", pages = "33--37", } @InProceedings{KanYau71, author = "J. R. Kane and S. S. Yau", title = "On the design of easily testable sequential machines", booktitle = "Proc.\ 12th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1971", pages = "38--42", } @InProceedings{OsmWei71, author = "M. Y. Osman and C. D. Weiss", title = "Universal base functions and modules for realizing arbitrary switching functions", booktitle = "Proc.\ 12th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1971", pages = "43--59", } @InProceedings{FroGer71, author = "G. Frosini and G. B. Gerace", title = "Synthesis of asynchronous sequential circuits with master-slave subcircuits", booktitle = "Proc.\ 12th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1971", pages = "60--78", } @InProceedings{Akers71, author = "Jr. S. B. Akers", title = "A rectangular logic array", booktitle = "Proc.\ 12th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1971", pages = "79--90", } @InProceedings{SteTor71, author = "D. A. Stern and H. C. Torng", title = "Nand cellular arrays", booktitle = "Proc.\ 12th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1971", pages = "91--104", } @InProceedings{Sudborough71, author = "I. H. Sudborough", title = "Computation by multi-head finite automata", booktitle = "Proc.\ 12th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1971", pages = "105--113", } @InProceedings{Tarjan71, author = "R. Tarjan", title = "Depth-first search and linear graph algorithms", booktitle = "Proc.\ 12th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1971", pages = "114--121", } @InProceedings{HopKar71, author = "J. E. Hopcroft and R. M. Karp", title = "A $ n^{5/2} $ algorithm for maximum matchings in bipartite graphs", booktitle = "Proc.\ 12th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1971", pages = "122--125", } @InProceedings{HeiHor71, author = "L. E. Heindel and E. Horowitz", title = "On decreasing the computing time for modular arithmetic", booktitle = "Proc.\ 12th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1971", pages = "126--128", } @InProceedings{FisMey71, author = "M. J. Fischer and A. R. Meyer", title = "Boolean matrix multiplication and transitive closure", booktitle = "Proc.\ 12th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1971", pages = "129--131", } @InProceedings{MunPat71, author = "I. Munro and M. Paterson", title = "Optimal algorithms for parallel polynomial evaluation", booktitle = "Proc.\ 12th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1971", pages = "132--139", } @InProceedings{PatSto71, author = "M. Paterson and L. Stockmeyer", title = "Bounds on the evaluation time for rational polynomials", booktitle = "Proc.\ 12th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1971", pages = "140--143", } @InProceedings{Smith71, author = "III A. R. Smith", title = "Two-dimensional formal languages and pattern recognition by cellular automata", booktitle = "Proc.\ 12th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1971", pages = "144--152", } @InProceedings{CohCul71, author = "R. Cohen and II K. Culik", title = "{LR}-regular grammars --- An extension of {LR}(k) grammars", booktitle = "Proc.\ 12th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1971", pages = "153--165", } @InProceedings{BrzSim71, author = "J. A. Brzozowski and ImreSimon", title = "Characterizations of locally testable events", booktitle = "Proc.\ 12th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1971", pages = "166--176", } @InProceedings{CofJon71, author = "Jr. E. G. Coffman and N. D. Jones", title = "Priority paging algorithms and the extension problem", booktitle = "Proc.\ 12th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1971", pages = "177--181", } @InProceedings{Dertouzos71, author = "M. L. Dertouzos", title = "Time bounds on space computations", booktitle = "Proc.\ 12th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1971", pages = "182--187", } @InProceedings{MeyFis71, author = "A. R. Meyer and M. J. Fischer", title = "Economy of description by automata, grammars, and formal systems", booktitle = "Proc.\ 12th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1971", pages = "188--191", } @InProceedings{Wagner71, author = "E. G. Wagner", title = "Languages for defining sets in arbitrary algebras", booktitle = "Proc.\ 12th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1971", pages = "192--201", } @InProceedings{Spira71, author = "P. M. Spira", title = "Complete linear proofs of systems of linear inequalities", booktitle = "Proc.\ 12th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1971", pages = "202--206", } @InProceedings{Liu71, author = "C. L. Liu", title = "Analysis of sorting algorithms", booktitle = "Proc.\ 12th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1971", pages = "207--215", } @InProceedings{Reingold71, author = "E. M. Reingold", title = "Computing the maximum and the median", booktitle = "Proc.\ 12th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1971", pages = "216--218", } @InProceedings{71, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{WalStr72, author = "S. A. Walker and H. R. Strong", title = "Characterization of flowchartable recursions", booktitle = "Proc.\ 4th ACM Symposium on Theory of Computing (STOC)", year = "1972", pages = "18--34", } @InProceedings{Morris72, author = "Jr. J. H. Morris", title = "Recursion schemes with lists", booktitle = "Proc.\ 4th ACM Symposium on Theory of Computing (STOC)", year = "1972", pages = "35--43", } @InProceedings{Plaisted72, author = "D. A. Plaisted", title = "Flowchart schemata with counters", booktitle = "Proc.\ 4th ACM Symposium on Theory of Computing (STOC)", year = "1972", pages = "44--51", } @InProceedings{ChaMan72, author = "A. K. Chandra and Z. Manna", title = "Program schemas with equality", booktitle = "Proc.\ 4th ACM Symposium on Theory of Computing (STOC)", year = "1972", pages = "52--64", } @InProceedings{GarLuc72, author = "S. J. Garland and D. C. Luckham", title = "On the equivalence of schemes", booktitle = "Proc.\ 4th ACM Symposium on Theory of Computing (STOC)", year = "1972", pages = "65--72", } @InProceedings{CooRec72, author = "S. A. Cook and R. A. Reckhow", title = "Time-bounded random access machines", booktitle = "Proc.\ 4th ACM Symposium on Theory of Computing (STOC)", year = "1972", pages = "73--80", } @InProceedings{WarFis72, author = "J. C. Warkentin and P. C. Fischer", title = "Predecessor machines and regressing functions", booktitle = "Proc.\ 4th ACM Symposium on Theory of Computing (STOC)", year = "1972", pages = "81--87", } @InProceedings{Fiduccia72, author = "C. M. Fiduccia", title = "Polynomial evaluation via the division algorithm: The fast Fourier transform revisited", booktitle = "Proc.\ 4th ACM Symposium on Theory of Computing (STOC)", year = "1972", pages = "88--93", } @InProceedings{Kirkpatrick72, author = "D. Kirkpatrick", title = "On the additions necessary to compute certain functions", booktitle = "Proc.\ 4th ACM Symposium on Theory of Computing (STOC)", year = "1972", pages = "94--101", } @InProceedings{Kung72, author = "H. T. Kung", title = "A bound on the multiplication efficiency of iteration", booktitle = "Proc.\ 4th ACM Symposium on Theory of Computing (STOC)", year = "1972", pages = "102--107", } @InProceedings{Horowitz72, author = "E. Horowitz", title = "Algorithms for rational function arithmetic operations", booktitle = "Proc.\ 4th ACM Symposium on Theory of Computing (STOC)", year = "1972", pages = "108--118", } @InProceedings{BlumEtAl72, author = "M. Blum and R. W. Floyd and V. Pratt and R. L. Rivest and R. E. Tarjan", title = "Linear time bounds for median computations", booktitle = "Proc.\ 4th ACM Symposium on Theory of Computing (STOC)", year = "1972", pages = "119--124", } @InProceedings{KarMilRos72, author = "R. M. Karp and R. E. Miller and A. L. Rosenberg", title = "Rapid identification of repeated patterns in strings, trees and arrays", booktitle = "Proc.\ 4th ACM Symposium on Theory of Computing (STOC)", year = "1972", pages = "125--136", } @InProceedings{NieRei72, author = "J. Nievergelt and E. M. Reingold", title = "Binary search trees of bounded balance", booktitle = "Proc.\ 4th ACM Symposium on Theory of Computing (STOC)", year = "1972", pages = "137--142", } @InProceedings{GarGraUll72, author = "M. R. Garey and R. L. Graham and J. D. Ullman", title = "Worst-case analysis of memory allocation algorithms", booktitle = "Proc.\ 4th ACM Symposium on Theory of Computing (STOC)", year = "1972", pages = "143--150", } @InProceedings{Savitch72, author = "W. J. Savitch", title = "Maze recognizing automata", booktitle = "Proc.\ 4th ACM Symposium on Theory of Computing (STOC)", year = "1972", pages = "151--156", } @InProceedings{JonSel72, author = "N. D. Jones and A. L. Selman", title = "Turing machines and the spectra of first-order formulas with equality", booktitle = "Proc.\ 4th ACM Symposium on Theory of Computing (STOC)", year = "1972", pages = "157--167", } @InProceedings{Schnorr72, author = "C. P. Schnorr", title = "The process complexity and effective random tests", booktitle = "Proc.\ 4th ACM Symposium on Theory of Computing (STOC)", year = "1972", pages = "168--176", } @InProceedings{Symes72, author = "D. M. Symes", title = "The computation of finite functions", booktitle = "Proc.\ 4th ACM Symposium on Theory of Computing (STOC)", year = "1972", pages = "177--182", } @InProceedings{MeyBag72, author = "A. R. Meyer and A. Bagchi", title = "Program size and economy of descriptions", booktitle = "Proc.\ 4th ACM Symposium on Theory of Computing (STOC)", year = "1972", pages = "183--186", } @InProceedings{Cook72, author = "S. A. Cook", title = "A hierarchy for nondeterministic time complexity", booktitle = "Proc.\ 4th ACM Symposium on Theory of Computing (STOC)", year = "1972", pages = "187--192", } @InProceedings{Hamlet72, author = "R. G. Hamlet", title = "A patent problem for abstract programming languages: Machine-independent computations", booktitle = "Proc.\ 4th ACM Symposium on Theory of Computing (STOC)", year = "1972", pages = "193--197", } @InProceedings{OgdRou72, author = "W. F. Ogden and W. C. Rounds", title = "Compositions of $n$ tree transducers", booktitle = "Proc.\ 4th ACM Symposium on Theory of Computing (STOC)", year = "1972", pages = "198--206", } @InProceedings{CarGinGol72, author = "S. Carlyle-Greibach and S. Ginsburg and J. Goldstine", title = "Uniformly erasable {AFL}", booktitle = "Proc.\ 4th ACM Symposium on Theory of Computing (STOC)", year = "1972", pages = "207--213", } @InProceedings{LinRoz72, author = "A. Lindenmayer and G. Rozenberg", title = "Developmental systems and languages", booktitle = "Proc.\ 4th ACM Symposium on Theory of Computing (STOC)", year = "1972", pages = "214--221", } @InProceedings{Sethi72, author = "R. Sethi", title = "Validating register allocations for straight line programs", booktitle = "Proc.\ 4th ACM Symposium on Theory of Computing (STOC)", year = "1972", pages = "222--237", } @InProceedings{HecUll72, author = "M. S. Hecht and J. D. Ullman", title = "Flow graph reducibility", booktitle = "Proc.\ 4th ACM Symposium on Theory of Computing (STOC)", year = "1972", pages = "238--250", } @InProceedings{AhoUll72, author = "A. V. Aho and J. D. Ullman", title = "A technique for speeding up {LR}(k) parsers", booktitle = "Proc.\ 4th ACM Symposium on Theory of Computing (STOC)", year = "1972", pages = "251--263", } @InProceedings{Rosen72, author = "B. K. Rosen", title = "Program equivalence and context-free grammars", booktitle = "Proc.\ 13th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1972", pages = "7--18", } @InProceedings{72, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{CheCon72, author = "J. C. Cherniavsky and R. L. Constable", title = "Representing program schemes in logic", booktitle = "Proc.\ 13th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1972", pages = "27--39", } @InProceedings{TouMyl72, author = "G. Tourlakis and J. Mylopoulos", title = "Some results in computational topology", booktitle = "Proc.\ 13th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1972", pages = "40--51", } @InProceedings{Goguen72, author = "Jr. J. A. Goguen", title = "On homomorphisms, simulations, correctness and subroutines for programs and program schemes", booktitle = "Proc.\ 13th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1972", pages = "52--60", } @InProceedings{MeyMol72, author = "A. R. Meyer and R. Moll", title = "Honest bounds for complexity classes of recursive functions", booktitle = "Proc.\ 13th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1972", pages = "61--66", } @InProceedings{Logrippo72, author = "L. Logrippo", title = "Renamings in program schemas", booktitle = "Proc.\ 13th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1972", pages = "67--70", } @InProceedings{BruCofHos72, author = "J. L. Bruno and E. G. Coffman and W. H. Hosken", title = "Consistency of synchronization nets using {P} and {V} operations", booktitle = "Proc.\ 13th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1972", pages = "71--77", } @InProceedings{Keller72, author = "R. M. Keller", title = "On the decomposition of asynchronous systems", booktitle = "Proc.\ 13th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1972", pages = "78--89", } @InProceedings{MoeBor72, author = "R. Moenck and A. Borodin", title = "Fast modular transforms via division", booktitle = "Proc.\ 13th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1972", pages = "90--96", } @InProceedings{Horowitz72, author = "E. Horowitz", title = "The efficient calculation of powers of polynomials", booktitle = "Proc.\ 13th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1972", pages = "97--104", } @InProceedings{ShaTra72, author = "M. Shaw and J. F. Traub", title = "On the number of multiplications for the evaluation of a polynomial and all its derivatives", booktitle = "Proc.\ 13th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1972", pages = "105--107", } @InProceedings{Mylopoulos72, author = "J. Mylopoulos", title = "On the relation of graph grammars and graph automata", booktitle = "Proc.\ 13th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1972", pages = "108--120", } @InProceedings{HosRac72, author = "R. Hossley and C. Rackoff", title = "The emptiness problem for automata on infinite trees", booktitle = "Proc.\ 13th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1972", pages = "121--124", } @InProceedings{MeySto72, author = "A. R. Meyer and L. J. Stockmeyer", title = "The equivalence problem for regular expressions with squaring requires exponential space", booktitle = "Proc.\ 13th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1972", pages = "125--129", } @InProceedings{Sahni72, author = "S. Sahni", title = "Some related problems from network flows, game theory and integer programming", booktitle = "Proc.\ 13th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1972", pages = "130--138", } @InProceedings{Friedman72, author = "N. Friedman", title = "Some results on the effect of arithmetics on comparison problems", booktitle = "Proc.\ 13th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1972", pages = "139--143", } @InProceedings{Johnson72, author = "D. S. Johnson", title = "Fast allocation algorithms", booktitle = "Proc.\ 13th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1972", pages = "144--154", } @InProceedings{Liu72, author = "C. L. Liu", title = "Optimal scheduling on multi-processor computing systems", booktitle = "Proc.\ 13th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1972", pages = "155--160", } @InProceedings{Ullman72, author = "J. D. Ullman", title = "A fast algorithm for the elimination of common subexpressions", booktitle = "Proc.\ 13th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1972", pages = "161--176", } @InProceedings{Akers72, author = "Jr. S. B. Akers", title = "Universal test sets for logic networks", booktitle = "Proc.\ 13th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1972", pages = "177--184", } @InProceedings{SalRed72, author = "K. K. Saluja and S. M. Reddy", title = "Multiple faults in Reed-Muller canonic networks", booktitle = "Proc.\ 13th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1972", pages = "185--191", } @InProceedings{HuaKaiKin72, author = "C. C. Huang and R. Y. Kain and L. L. Kinney", title = "Output sufficient modules for uniform decomposition of synchronous sequential circuits", booktitle = "Proc.\ 13th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1972", pages = "192--199", } @InProceedings{Berstel72, author = "J. Berstel", title = "On sets of numbers recognized by push-down automata", booktitle = "Proc.\ 13th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1972", pages = "200--206", } @InProceedings{BakBoo72, author = "B. S. Baker and R. V. Book", title = "Reversal-bounded multi-pushdown machines", booktitle = "Proc.\ 13th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1972", pages = "207--211", } @InProceedings{JumThi72, author = "J. R. Jump and P. S. Thiagarajan", title = "On the equivalence of asynchronous control structures", booktitle = "Proc.\ 13th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1972", pages = "212--223", } @InProceedings{Maibaum72, author = "T. S. E. Maibaum", title = "The characterization of the derivation trees of context free sets of terms as regular sets", booktitle = "Proc.\ 13th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1972", pages = "224--230", } @InProceedings{StoMey73, author = "L. J. Stockmeyer and A. R. Meyer", title = "Word problems requiring exponential time", booktitle = "Proc.\ 5th ACM Symposium on Theory of Computing (STOC)", year = "1973", pages = "1--9", } @InProceedings{Hunt73, author = "III H. B. Hunt", title = "On the time and tape complexity of languages {I}", booktitle = "Proc.\ 5th ACM Symposium on Theory of Computing (STOC)", year = "1973", pages = "10--19", } @InProceedings{Greibach73, author = "S. A. Greibach", title = "Jump {PDA}'s, deterministic context-free languages principal {AFDL}s and polynomial time recognition", booktitle = "Proc.\ 5th ACM Symposium on Theory of Computing (STOC)", year = "1973", pages = "20--28", } @InProceedings{Cook73, author = "S. A. Cook", title = "An observation on time-storage trade off", booktitle = "Proc.\ 5th ACM Symposium on Theory of Computing (STOC)", year = "1973", pages = "29--33", } @InProceedings{Oppen73, author = "D. C. Oppen", title = "Elementary bounds for Presburger arithmetic", booktitle = "Proc.\ 5th ACM Symposium on Theory of Computing (STOC)", year = "1973", pages = "34--37", } @InProceedings{Johnson73, author = "D. S. Johnson", title = "Approximation algorithms for combinatorial problems", booktitle = "Proc.\ 5th ACM Symposium on Theory of Computing (STOC)", year = "1973", pages = "38--49", } @InProceedings{Miller73, author = "W. Miller", title = "Toward mechanical verification of properties of roundoff error propagation", booktitle = "Proc.\ 5th ACM Symposium on Theory of Computing (STOC)", year = "1973", pages = "50--58", } @InProceedings{Wand73, author = "M. Wand", title = "An unusual application of program-proving", booktitle = "Proc.\ 5th ACM Symposium on Theory of Computing (STOC)", year = "1973", pages = "59--66", } @InProceedings{FisSto73, author = "M. J. Fischer and L. J. Stockmeyer", title = "Fast on-line integer multiplication", booktitle = "Proc.\ 5th ACM Symposium on Theory of Computing (STOC)", year = "1973", pages = "67--72", } @InProceedings{HopMus73, author = "J. Hopcroft and J. Musinski", title = "Duality applied to the complexity of matrix multiplications and other bilinear forms", booktitle = "Proc.\ 5th ACM Symposium on Theory of Computing (STOC)", year = "1973", pages = "73--87", } @InProceedings{BroDob73, author = "R. W. Brockett and D. Dobkin", title = "On the optimal evaluation of a set of bilinear forms", booktitle = "Proc.\ 5th ACM Symposium on Theory of Computing (STOC)", year = "1973", pages = "88--95", } @InProceedings{Tarjan73, author = "R. Tarjan", title = "Testing flow graph reducibility", booktitle = "Proc.\ 5th ACM Symposium on Theory of Computing (STOC)", year = "1973", pages = "96--107", } @InProceedings{Constable73, author = "R. L. Constable", title = "Type two computational complexity", booktitle = "Proc.\ 5th ACM Symposium on Theory of Computing (STOC)", year = "1973", pages = "108--121", } @InProceedings{Ladner73, author = "R. E. Ladner", title = "Polynomial time reducibility", booktitle = "Proc.\ 5th ACM Symposium on Theory of Computing (STOC)", year = "1973", pages = "122--129", } @InProceedings{LynMeyFis73, author = "N. Lynch and A. Meyer and M. Fischer", title = "Sets that don't help", booktitle = "Proc.\ 5th ACM Symposium on Theory of Computing (STOC)", year = "1973", pages = "130--134", } @InProceedings{GenJoh73, author = "W. M. Gentleman and S. C. Johnson", title = "Analysis of algorithms, a case study: Determinants of polynomials", booktitle = "Proc.\ 5th ACM Symposium on Theory of Computing (STOC)", year = "1973", pages = "135--141", } @InProceedings{Moenck73, author = "R. T. Moenck", title = "Fast computation of {GCD}s", booktitle = "Proc.\ 5th ACM Symposium on Theory of Computing (STOC)", year = "1973", pages = "142--151", } @InProceedings{Kung73, author = "H. T. Kung", title = "The computational complexity of algebraic numbers", booktitle = "Proc.\ 5th ACM Symposium on Theory of Computing (STOC)", year = "1973", pages = "152--159", } @InProceedings{LewRosSte73, author = "P. M. Lewis and D. J. Rosenkrantz and R. E. Stearns", title = "Attributed translations", booktitle = "Proc.\ 5th ACM Symposium on Theory of Computing (STOC)", year = "1973", pages = "160--171", } @InProceedings{Pager73, author = "D. Pager", title = "The lane tracing algorithm for constructing {LR}(k) parsers", booktitle = "Proc.\ 5th ACM Symposium on Theory of Computing (STOC)", year = "1973", pages = "172--181", } @InProceedings{Sethi73, author = "R. Sethi", title = "Complete register allocation problems", booktitle = "Proc.\ 5th ACM Symposium on Theory of Computing (STOC)", year = "1973", pages = "182--195", } @InProceedings{Teitelbaum73, author = "R. Teitelbaum", title = "Context-free error analysis by evaluation of algebraic power series", booktitle = "Proc.\ 5th ACM Symposium on Theory of Computing (STOC)", year = "1973", pages = "196--199", } @InProceedings{Baker73, author = "B. S. Baker", title = "Tree transductions and families of tree languges", booktitle = "Proc.\ 5th ACM Symposium on Theory of Computing (STOC)", year = "1973", pages = "200--206", } @InProceedings{WeiSavBag73, author = "P. Weiner and S. L. Savage and A. Bagchi", title = "Neighborhood search algorithms for finding optimal traveling salesman tours must be inefficient", booktitle = "Proc.\ 5th ACM Symposium on Theory of Computing (STOC)", year = "1973", pages = "207--213", } @InProceedings{Wagner73, author = "E. G. Wagner", title = "From algebras to programming languages", booktitle = "Proc.\ 5th ACM Symposium on Theory of Computing (STOC)", year = "1973", pages = "214--223", } @InProceedings{Vuillemin73, author = "J. Vuillemin", title = "Correct and optimal implementations of recursion in a simple programming language", booktitle = "Proc.\ 5th ACM Symposium on Theory of Computing (STOC)", year = "1973", pages = "224--239", } @InProceedings{Kosaraju73, author = "S. R. Kosaraju", title = "Analysis of structured programs", booktitle = "Proc.\ 5th ACM Symposium on Theory of Computing (STOC)", year = "1973", pages = "240--252", } @InProceedings{AhoHopUll73, author = "A. V. Aho and J. E. Hopcroft and J. D. Ullman", title = "On finding lowest common ancestors in trees", booktitle = "Proc.\ 5th ACM Symposium on Theory of Computing (STOC)", year = "1973", pages = "253--265", } @InProceedings{Eilenberg73, author = "S. Eilenberg", title = "Classes of semigroups and classes of sets", booktitle = "Proc.\ 5th ACM Symposium on Theory of Computing (STOC)", year = "1973", pages = "266--267", } @InProceedings{Pratt73, author = "V. R. Pratt", title = "Computing permutations with double-ended queues, parallel stacks and parallel queues", booktitle = "Proc.\ 5th ACM Symposium on Theory of Computing (STOC)", year = "1973", pages = "268--277", } @InProceedings{Weiner73, author = "P. Weiner", title = "Linear pattern matching algorithms", booktitle = "Proc.\ 14th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1973", pages = "1--11", } @InProceedings{KamToi73, author = "T. Kameda and S. Toida", title = "Efficient algorithms for determining an extremal tree of a graph", booktitle = "Proc.\ 14th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1973", pages = "12--15", } @InProceedings{Chandra73, author = "A. K. Chandra", title = "Efficient compilation of linear recursive programs", booktitle = "Proc.\ 14th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1973", pages = "16--25", } @InProceedings{Friedman73, author = "E. P. Friedman", title = "Equivalence problems in monadic recursion schemes", booktitle = "Proc.\ 14th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1973", pages = "26--33", } @InProceedings{CadLev73, author = "J. M. Cadiou and J. J. Levy", title = "Mechanizable proofs about parallel processes", booktitle = "Proc.\ 14th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1973", pages = "34--48", } @InProceedings{Baugh73, author = "C. R. Baugh", title = "Chow parameters in pseudothreshold logic", booktitle = "Proc.\ 14th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1973", pages = "49--55", } @InProceedings{Bredeson73, author = "J. G. Bredeson", title = "On multiple input change hazard-free combinatorial switching circuits without feedback", booktitle = "Proc.\ 14th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1973", pages = "56--63", } @InProceedings{ChuDas73, author = "H. Y. H. Chuang and S. Das", title = "Multiple-input change asynchronous machines using controlled excitation and flip-flops", booktitle = "Proc.\ 14th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1973", pages = "64--69", } @InProceedings{PraYao73, author = "V. R. Pratt and F. F. Yao", title = "On lower bounds for computing the $i$-th largest element", booktitle = "Proc.\ 14th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1973", pages = "70--81", } @InProceedings{SpiPan73, author = "P. M. Spira and A. Pan", title = "On finding and updating shortest paths and spanning trees", booktitle = "Proc.\ 14th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1973", pages = "82--84", } @InProceedings{Savage73, author = "S. Savage", title = "Statistical indicators of optimality", booktitle = "Proc.\ 14th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1973", pages = "85--91", } @InProceedings{Dobkin73, author = "D. Dobkin", title = "On the optimal evaluation of a set of n-linear forms", booktitle = "Proc.\ 14th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1973", pages = "92--102", } @InProceedings{GelHar73, author = "M. M. Geller and M. A. Harrison", title = "Characterizations of {LR}(0) languages", booktitle = "Proc.\ 14th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1973", pages = "103--108", } @InProceedings{MicSch73, author = "M. D. Mickunas and V. B. Schneider", title = "On the ability to cover {LR}(k) grammars with {LR}(1), {SLR}(1), and (1,1) bounded-context grammars", booktitle = "Proc.\ 14th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1973", pages = "109--121", } @InProceedings{SzyWil73, author = "T. G. Szymanski and J. H. Williams", title = "Non-canonical parsing", booktitle = "Proc.\ 14th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1973", pages = "122--129", } @InProceedings{SeiFisMey73, author = "J. I. Seiferas and M. J. Fischer and A. R. Meyer", title = "Refinements of the nondeterministic time and space hierarchies", booktitle = "Proc.\ 14th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1973", pages = "130--137", } @InProceedings{Sudborough73, author = "I. H. Sudborough", title = "On tape-bounded complexity classes and multi-head finite automata", booktitle = "Proc.\ 14th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1973", pages = "138--144", } @InProceedings{Rounds73, author = "W. C. Rounds", title = "Complexity of recognition in intermediate-level languages", booktitle = "Proc.\ 14th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1973", pages = "145--158", } @InProceedings{Joyner73, author = "Jr. W. H. Joyner", title = "Automatic theorem-proving and the decision problem", booktitle = "Proc.\ 14th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1973", pages = "159--166", } @InProceedings{EhrPfeSch73, author = "H. Ehrig and M. Pfender and H. J. Schneider", title = "Graph-grammars: An algebraic approach", booktitle = "Proc.\ 14th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1973", pages = "167--180", } @InProceedings{Machtey73, author = "M. Machtey", title = "A notion of helping and pseudo-complementation in lattices of honest subrecursive classes", booktitle = "Proc.\ 14th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1973", pages = "181--189", } @InProceedings{Mehlhorn73, author = "K. Mehlhorn", title = "On the size of sets of computable functions", booktitle = "Proc.\ 14th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1973", pages = "190--196", } @InProceedings{Young73, author = "P. Young", title = "Optimization among provably equivalent programs", booktitle = "Proc.\ 14th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1973", pages = "197--199", } @InProceedings{BluBlu73, author = "L. Blum and M. Blum", title = "Inductive inference: {A} recursion theoretic approach", booktitle = "Proc.\ 14th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1973", pages = "200--208", } @InProceedings{Cherniavsky73, author = "J. Cherniavsky", title = "The complexity of some non-classical logics", booktitle = "Proc.\ 14th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1973", pages = "209--213", } @InProceedings{Chandra74, author = "A. K. Chandra", title = "Degrees of translatability and canonical forms in program schemas: Part {I}", booktitle = "Proc.\ 6th ACM Symposium on Theory of Computing (STOC)", year = "1974", pages = "1--12", } @InProceedings{CouVui74, author = "B. Courcelle and J. Vuillemin", title = "Semantics and axiomatics of a simple recursive language", booktitle = "Proc.\ 6th ACM Symposium on Theory of Computing (STOC)", year = "1974", pages = "13--26", } @InProceedings{Valiant74, author = "L. G. Valiant", title = "The decidability of equivalence for deterministic finite-turn pushdown automata", booktitle = "Proc.\ 6th ACM Symposium on Theory of Computing (STOC)", year = "1974", pages = "27--32", } @InProceedings{CooSet74, author = "S. Cook and R. Sethi", title = "Storage requirements for deterministic polynomial time recognizable languages", booktitle = "Proc.\ 6th ACM Symposium on Theory of Computing (STOC)", year = "1974", pages = "33--39", } @InProceedings{JonLaa74, author = "N. D. Jones and W. T. Laaser", title = "Complete problems for deterministic polynomial time", booktitle = "Proc.\ 6th ACM Symposium on Theory of Computing (STOC)", year = "1974", pages = "40--46", } @InProceedings{GarJohSto74, author = "M. R. Garey and D. S. Johnson and L. Stockmeyer", title = "Some simplified {NP}-complete problems", booktitle = "Proc.\ 6th ACM Symposium on Theory of Computing (STOC)", year = "1974", pages = "47--63", } @InProceedings{HunRos74, author = "III H. B. Hunt and D. J. Rosenkrantz", title = "Computational parallels between the regular and context-free languages", booktitle = "Proc.\ 6th ACM Symposium on Theory of Computing (STOC)", year = "1974", pages = "64--74", } @InProceedings{EhrZei74, author = "A. Ehrenfeucht and P. Zeiger", title = "Complexity measures for regular expressions", booktitle = "Proc.\ 6th ACM Symposium on Theory of Computing (STOC)", year = "1974", pages = "75--79", } @InProceedings{Pratt74, author = "V. R. Pratt", title = "The power of negative thinking in multiplying Boolean matrices", booktitle = "Proc.\ 6th ACM Symposium on Theory of Computing (STOC)", year = "1974", pages = "80--83", } @InProceedings{Kirkpatrick74, author = "D. Kirkpatrick", title = "Determining graph properties from matrix representations", booktitle = "Proc.\ 6th ACM Symposium on Theory of Computing (STOC)", year = "1974", pages = "84--90", } @InProceedings{Gill74, author = "III J. T. Gill", title = "Computational complexity of probabilistic Turing machines", booktitle = "Proc.\ 6th ACM Symposium on Theory of Computing (STOC)", year = "1974", pages = "91--95", } @InProceedings{Mehlhorn74, author = "K. Mehlhorn", title = "Polynomial and abstract subrecursive classes", booktitle = "Proc.\ 6th ACM Symposium on Theory of Computing (STOC)", year = "1974", pages = "96--109", } @InProceedings{LadLynSel74, author = "R. Ladner and N. Lynch and A. Selman", title = "Comparisons of polynomial-time reducibilities", booktitle = "Proc.\ 6th ACM Symposium on Theory of Computing (STOC)", year = "1974", pages = "110--121", } @InProceedings{PraRabSto74, author = "V. R. Pratt and M. O. Rabin and L. J. Stockmeyer", title = "A characterization of the power of vector machines", booktitle = "Proc.\ 6th ACM Symposium on Theory of Computing (STOC)", year = "1974", pages = "122--134", } @InProceedings{CooRec74, author = "S. Cook and R. Reckhow", title = "On the lengths of proofs in the propositional calculus", booktitle = "Proc.\ 6th ACM Symposium on Theory of Computing (STOC)", year = "1974", pages = "135--148", } @InProceedings{Rackoff74, author = "C. Rackoff", title = "On the complexity of the theories of weak direct products", booktitle = "Proc.\ 6th ACM Symposium on Theory of Computing (STOC)", year = "1974", pages = "149--160", } @InProceedings{Robertson74, author = "E. L. Robertson", title = "Structure of complexity in the weak monadic second-order theories of the natural numbers", booktitle = "Proc.\ 6th ACM Symposium on Theory of Computing (STOC)", year = "1974", pages = "161--171", } @InProceedings{HopWon74, author = "J. E. Hopcroft and J. K. Wong", title = "Linear time algorithm for isomorphism of planar graphs", booktitle = "Proc.\ 6th ACM Symposium on Theory of Computing (STOC)", year = "1974", pages = "172--184", } @InProceedings{Tarjan74, author = "R. E. Tarjan", title = "Testing graph connectivity", booktitle = "Proc.\ 6th ACM Symposium on Theory of Computing (STOC)", year = "1974", pages = "185--193", } @InProceedings{Horvath74, author = "E. C. Horvath", title = "Efficient stable sorting with minimal extra space", booktitle = "Proc.\ 6th ACM Symposium on Theory of Computing (STOC)", year = "1974", pages = "194--215", } @InProceedings{HyaPruVui74, author = "L. Hyafil and F. Prusker and J. Vuillemin", title = "An efficient algorithm for computing optimal desk merge patterns", booktitle = "Proc.\ 6th ACM Symposium on Theory of Computing (STOC)", year = "1974", pages = "216--229", } @InProceedings{Lipton74, author = "R. J. Lipton", title = "Limitations of synchronization primitives with conditional branching and global variables", booktitle = "Proc.\ 6th ACM Symposium on Theory of Computing (STOC)", year = "1974", pages = "230--241", } @InProceedings{Millen74, author = "J. K. Millen", title = "Construction with parallel derivatives of the closure of a parallel program schema", booktitle = "Proc.\ 6th ACM Symposium on Theory of Computing (STOC)", year = "1974", pages = "242--247", } @InProceedings{VaiDeM74, author = "K. Vairavan and R. A. DeMillo", title = "Parallel scheduling of programs in a restricted model of computation", booktitle = "Proc.\ 6th ACM Symposium on Theory of Computing (STOC)", year = "1974", pages = "248--255", } @InProceedings{Greibach74, author = "S. A. Greibach", title = "Some restrictions on {W}-grammars", booktitle = "Proc.\ 6th ACM Symposium on Theory of Computing (STOC)", year = "1974", pages = "256--265", } @InProceedings{Hammer74, author = "M. Hammer", title = "A new grammatical transformation into {LL}(k) form", booktitle = "Proc.\ 6th ACM Symposium on Theory of Computing (STOC)", year = "1974", pages = "266--275", } @InProceedings{Seiferas74, author = "J. I. Seiferas", title = "Observations on nondeterministic multidimensional iterative arrays", booktitle = "Proc.\ 6th ACM Symposium on Theory of Computing (STOC)", year = "1974", pages = "276--289", } @InProceedings{BooNivPat74, author = "R. Book and M. Nivat and M. Paterson", title = "Intersections of linear context-free languages and reversal-bounded multipushdown machines", booktitle = "Proc.\ 6th ACM Symposium on Theory of Computing (STOC)", year = "1974", pages = "290--296", } @InProceedings{Rosenberg74, author = "A. L. Rosenberg", title = "Managing storage for extendible arrays", booktitle = "Proc.\ 6th ACM Symposium on Theory of Computing (STOC)", year = "1974", pages = "297--302", } @InProceedings{VanLeeuwen74, author = "J. VanLeeuwen", title = "A partial solution to the reachability-problem for vector-addition systems", booktitle = "Proc.\ 6th ACM Symposium on Theory of Computing (STOC)", year = "1974", pages = "303--309", } @InProceedings{DobLip74, author = "D. Dobkin and R. J. Lipton", title = "On some generalizations of binary search", booktitle = "Proc.\ 6th ACM Symposium on Theory of Computing (STOC)", year = "1974", pages = "310--316", } @InProceedings{Miller74, author = "W. Miller", title = "Computational complexity and numerical stability", booktitle = "Proc.\ 6th ACM Symposium on Theory of Computing (STOC)", year = "1974", pages = "317--322", } @InProceedings{Kung74, author = "H. T. Kung", title = "New algorithms and lower bounds for the parallel evaluation of certain rational expressions", booktitle = "Proc.\ 6th ACM Symposium on Theory of Computing (STOC)", year = "1974", pages = "323--333", } @InProceedings{Kedem74, author = "Z. M. Kedem", title = "Combining dimensionality and rate of growth arguments for establishing lower bounds on the number of multiplications", booktitle = "Proc.\ 6th ACM Symposium on Theory of Computing (STOC)", year = "1974", pages = "334--341", } @InProceedings{BorCoo74, author = "A. Borodin and S. Cook", title = "On the number of additions to compute specific polynomials", booktitle = "Proc.\ 6th ACM Symposium on Theory of Computing (STOC)", year = "1974", pages = "342--347", } @InProceedings{CarGrePaz74, author = "J. W. Carlyle and S. A. Greibach and A. Paz", title = "A two-dimensional generating system modeling growth by binary cell division", booktitle = "Proc.\ 15th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1974", pages = "1--12", } @InProceedings{HarSim74, author = "J. Hartmanis and J. Simon", title = "On the power of multiplication in random access machines", booktitle = "Proc.\ 15th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1974", pages = "13--23", } @InProceedings{Rangel74, author = "J. L. Rangel", title = "The equivalence problem for regular expressions over one letter is elementary", booktitle = "Proc.\ 15th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1974", pages = "24--27", } @InProceedings{SahGon74, author = "S. Sahni and T. Gonzales", title = "{P}-complete problems and approximate solutions", booktitle = "Proc.\ 15th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1974", pages = "28--32", } @InProceedings{RosSteLew74, author = "D. J. Rosenkrantz and R. E. Stearns and P. M. Lewis", title = "Approximate algorithms for the traveling salesperson problem", booktitle = "Proc.\ 15th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1974", pages = "33--42", } @InProceedings{Friedman74, author = "E. P. Friedman", title = "Relationships between monadic recursion schemes and deterministic context-free languages", booktitle = "Proc.\ 15th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1974", pages = "43--51", } @InProceedings{Courcelle74, author = "B. Courcelle", title = "Recursive schemes, algebraic trees and deterministic languages", booktitle = "Proc.\ 15th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1974", pages = "52--62", } @InProceedings{GogTha74, author = "J. A. Goguen and J. W. Thatcher", title = "Initial algebra semantics", booktitle = "Proc.\ 15th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1974", pages = "63--77", } @InProceedings{HofLan74, author = "C. M. Hoffmann and L. H. Landweber", title = "Axiomatic equivalence of programs with structured variables", booktitle = "Proc.\ 15th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1974", pages = "78--83", } @InProceedings{TokKasFur74, author = "N. Tokura and T. Kasami and S. Furuta", title = "Ianov schemas augmented by a pushdown memory", booktitle = "Proc.\ 15th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1974", pages = "84--94", } @InProceedings{Rivest74, author = "R. L. Rivest", title = "On hash-coding algorithms for partial-match retrieval", booktitle = "Proc.\ 15th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1974", pages = "95--103", } @InProceedings{AhoHirUll74, author = "A. V. Aho and D. S. Hirschberg and J. D. Ullman", title = "Bounds on the complexity of the longest common subsequence problem", booktitle = "Proc.\ 15th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1974", pages = "104--109", } @InProceedings{Yao74, author = "A. C. -C. Yao", title = "Bounds on selection networks", booktitle = "Proc.\ 15th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1974", pages = "110--116", } @InProceedings{Kung74, author = "H. T. Kung", title = "On the computational complexity of finding the maxima of a set of vectors", booktitle = "Proc.\ 15th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1974", pages = "117--121", } @InProceedings{Rivest74, author = "R. L. Rivest", title = "On self-organizing sequential search heuristics", booktitle = "Proc.\ 15th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1974", pages = "122--126", } @InProceedings{HunSzyUll74, author = "III H. B. Hunt and T. G. Szymanski and J. D. Ullman", title = "Operations on sparse relations and efficient algorithms for grammar problems", booktitle = "Proc.\ 15th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1974", pages = "127--132", } @InProceedings{Hayes74, author = "J. P. Hayes", title = "Minimization of fanout in switching networks", booktitle = "Proc.\ 15th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1974", pages = "133--139", } @InProceedings{LamSav74, author = "E. A. Lamagna and J. E. Savage", title = "Combinational complexity of some monotone functions", booktitle = "Proc.\ 15th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1974", pages = "140--144", } @InProceedings{LipSnyZal74, author = "R. J. Lipton and L. Snyder and Y. Zalcstein", title = "A comparative study of models of parallel computation", booktitle = "Proc.\ 15th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1974", pages = "145--155", } @InProceedings{Hack74, author = "M. Hack", title = "The recursive equivalence of the reachability problem and the liveness problem for Petri nets and vector addition systems", booktitle = "Proc.\ 15th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1974", pages = "156--164", } @InProceedings{Daley74, author = "R. P. Daley", title = "Non-complex sequences: Characterizations and examples", booktitle = "Proc.\ 15th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1974", pages = "165--169", } @InProceedings{Galil74, author = "Z. Galil", title = "Two way deterministic pushdown automation languages and some open problems in the theory of computation", booktitle = "Proc.\ 15th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1974", pages = "170--177", } @InProceedings{Baker74, author = "T. P. Baker", title = "`Natural' properties of Flowchart complexity measures", booktitle = "Proc.\ 15th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1974", pages = "178--184", } @InProceedings{Demers74, author = "A. J. Demers", title = "Skeletal {LR} parsing", booktitle = "Proc.\ 15th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1974", pages = "185--198", } @InProceedings{CreGin74, author = "A. Cremers and S. Ginsburg", title = "Characterization of context-free grammatical families", booktitle = "Proc.\ 15th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1974", pages = "199--204", } @InProceedings{Kerntopf74, author = "P. Kerntopf", title = "On Boolean functions having maximal number of subfunction classes", booktitle = "Proc.\ 15th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1974", pages = "205--211", } @InProceedings{LipDob75, author = "R. J. Lipton and D. Dobkin", title = "Complexity measures and hierarchies for the evaluation of integers, polynomials, and n-linear forms", booktitle = "Proc.\ 7th ACM Symposium on Theory of Computing (STOC)", year = "1975", pages = "1--5", } @InProceedings{RivVui75, author = "R. L. Rivest and J. Vuillemin", title = "A generalization and proof of the Aanderaa-Rosenberg conjecture", booktitle = "Proc.\ 7th ACM Symposium on Theory of Computing (STOC)", year = "1975", pages = "6--11", } @InProceedings{HyaKun75, author = "L. Hyafil and H. T. Kung", title = "The complexity of parallel evaluation of linear recurrence", booktitle = "Proc.\ 7th ACM Symposium on Theory of Computing (STOC)", year = "1975", pages = "12--22", } @InProceedings{Yao75, author = "A. C. -C. Yao", title = "On computing the minima of quadratic forms", booktitle = "Proc.\ 7th ACM Symposium on Theory of Computing (STOC)", year = "1975", pages = "23--26", } @InProceedings{Paul75, author = "W. J. Paul", title = "A $2.5 n$-lower bound on the combinatorial complexity of Boolean functions", booktitle = "Proc.\ 7th ACM Symposium on Theory of Computing (STOC)", year = "1975", pages = "27--36", } @InProceedings{FisMeyPat75, author = "M. J. Fischer and A. R. Meyer and M. S. Paterson", title = "Lower bounds on the size of Boolean formulas", booktitle = "Proc.\ 7th ACM Symposium on Theory of Computing (STOC)", year = "1975", pages = "37--44", } @InProceedings{Valiant75, author = "L. G. Valiant", title = "On non-linear lower bounds in computational complexity", booktitle = "Proc.\ 7th ACM Symposium on Theory of Computing (STOC)", year = "1975", pages = "45--53", } @InProceedings{HunSzy75, author = "III H. B. Hunt and T. G. Szymanski", title = "On the complexity of grammar and related problems", booktitle = "Proc.\ 7th ACM Symposium on Theory of Computing (STOC)", year = "1975", pages = "54--65", } @InProceedings{EveTar75, author = "S. Even and R. E. Tarjan", title = "A combinatorial problem which is complete in polynomial space", booktitle = "Proc.\ 7th ACM Symposium on Theory of Computing (STOC)", year = "1975", pages = "66--71", } @InProceedings{Galil75, author = "Z. Galil", title = "On the validity and complexity of bounded resolution", booktitle = "Proc.\ 7th ACM Symposium on Theory of Computing (STOC)", year = "1975", pages = "72--82", } @InProceedings{Cook75, author = "S. A. Cook", title = "Feasibly constructive proofs and the propositional calculus", booktitle = "Proc.\ 7th ACM Symposium on Theory of Computing (STOC)", year = "1975", pages = "83--97", } @InProceedings{EglCon75, author = "H. Egli and R. L. Constable", title = "Computability concepts for programming language semantics", booktitle = "Proc.\ 7th ACM Symposium on Theory of Computing (STOC)", year = "1975", pages = "98--106", } @InProceedings{OppCoo75, author = "D. C. Oppen and S. A. Cook", title = "Proving assertions about programs that manipulate data structures", booktitle = "Proc.\ 7th ACM Symposium on Theory of Computing (STOC)", year = "1975", pages = "107--116", } @InProceedings{EhrRoz75, author = "A. Ehrenfeucht and G. Rozenberg", title = "On (un)predictability of formal languages", booktitle = "Proc.\ 7th ACM Symposium on Theory of Computing (STOC)", year = "1975", pages = "117--120", } @InProceedings{Skyum75, author = "S. Skyum", title = "On decomposing languages defined by parallel devices", booktitle = "Proc.\ 7th ACM Symposium on Theory of Computing (STOC)", year = "1975", pages = "121--125", } @InProceedings{Perrault75, author = "C. R. Perrault", title = "Intercalation theorems for tree transducer languages", booktitle = "Proc.\ 7th ACM Symposium on Theory of Computing (STOC)", year = "1975", pages = "126--136", } @InProceedings{EhrRoz75, author = "A. Ehrenfeucht and G. Rozenberg", title = "On the (combinatorial) structure of {L} languages without interactions", booktitle = "Proc.\ 7th ACM Symposium on Theory of Computing (STOC)", year = "1975", pages = "137--144", } @InProceedings{Wotschke75, author = "D. Wotschke", title = "Degree-languages, polynomial time recognition, and the {LBA} problem", booktitle = "Proc.\ 7th ACM Symposium on Theory of Computing (STOC)", year = "1975", pages = "145--152", } @InProceedings{GinLyn75, author = "S. Ginsburg and N. Lynch", title = "Comparative complexity of grammar forms", booktitle = "Proc.\ 7th ACM Symposium on Theory of Computing (STOC)", year = "1975", pages = "153--158", } @InProceedings{RosSto75, author = "A. L. Rosenberg and L. J. Stockmeyer", title = "Hashing schemes for extendible arrays", booktitle = "Proc.\ 7th ACM Symposium on Theory of Computing (STOC)", year = "1975", pages = "159--166", } @InProceedings{Pratt75, author = "T. Pratt", title = "Four models for the analysis of optimization of program control structures", booktitle = "Proc.\ 7th ACM Symposium on Theory of Computing (STOC)", year = "1975", pages = "167--176", } @InProceedings{AhoUll75, author = "A. V. Aho and J. D. Ullman", title = "Node listings for reducible flow graphs", booktitle = "Proc.\ 7th ACM Symposium on Theory of Computing (STOC)", year = "1975", pages = "177--185", } @InProceedings{LipEisDeM75, author = "R. J. Lipton and S. C. Eisenstat and R. A. DeMillo", title = "The complexity of control structures and data structures", booktitle = "Proc.\ 7th ACM Symposium on Theory of Computing (STOC)", year = "1975", pages = "186--193", } @InProceedings{ManSha75, author = "Z. Manna and A. Shamir", title = "The optimal fixedpoint of recursive programs", booktitle = "Proc.\ 7th ACM Symposium on Theory of Computing (STOC)", year = "1975", pages = "194--206", } @InProceedings{AhoJoh75, author = "A. V. Aho and S. C. Johnson", title = "Optimal code generation for expression trees", booktitle = "Proc.\ 7th ACM Symposium on Theory of Computing (STOC)", year = "1975", pages = "207--217", } @InProceedings{Wagner75, author = "R. A. Wagner", title = "On the complexity of the extended string-to-string correction problem", booktitle = "Proc.\ 7th ACM Symposium on Theory of Computing (STOC)", year = "1975", pages = "218--223", } @InProceedings{Shamos75, author = "M. I. Shamos", title = "Geometric complexity", booktitle = "Proc.\ 7th ACM Symposium on Theory of Computing (STOC)", year = "1975", pages = "224--233", } @InProceedings{Miller75, author = "G. L. Miller", title = "Riemann's hypothesis and tests for primality", booktitle = "Proc.\ 7th ACM Symposium on Theory of Computing (STOC)", year = "1975", pages = "234--239", } @InProceedings{Fredman75, author = "M. L. Fredman", title = "Two applications of a probabilistic search technique: Sorting $x+y$ and building balanced search trees", booktitle = "Proc.\ 7th ACM Symposium on Theory of Computing (STOC)", year = "1975", pages = "240--244", } @InProceedings{RosTar75, author = "D. J. Rose and R. E. Tarjan", title = "Algorithmic aspects of vertex elimination", booktitle = "Proc.\ 7th ACM Symposium on Theory of Computing (STOC)", year = "1975", pages = "245--254", } @InProceedings{BooLue75, author = "K. S. Booth and G. S. Lueker", title = "Linear algorithms to recognize interval graphs and test for consecutive ones property", booktitle = "Proc.\ 7th ACM Symposium on Theory of Computing (STOC)", year = "1975", pages = "255--265", } @InProceedings{Winograd75, author = "S. Winograd", title = "The effect of the field of constants on the number of multiplication", booktitle = "Proc.\ 16th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1975", pages = "1--2", } @InProceedings{Floyd75, author = "R. W. Floyd", title = "The exact time required to perform generalized addition", booktitle = "Proc.\ 16th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1975", pages = "3--5", } @InProceedings{Lipton75, author = "R. J. Lipton", title = "Polynomials with 0-1 coefficients that are hard to evaluate", booktitle = "Proc.\ 16th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1975", pages = "6--10", } @InProceedings{Csanky75, author = "L. Csanky", title = "Fast parallel matrix inversion algorithms", booktitle = "Proc.\ 16th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1975", pages = "11--12", } @InProceedings{ArjCor75, author = "E. Arjomandi and D. G. Corneil", title = "Parallel computations in graph theory", booktitle = "Proc.\ 16th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1975", pages = "13--18", } @InProceedings{LipMilSny75, author = "R. J. Lipton and R. E. Miller and L. Snyder", title = "Synchronization and computing capabilities of linear asynchronous structures", booktitle = "Proc.\ 16th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1975", pages = "19--28", } @InProceedings{DeBakker75, author = "J. W. DeBakker", title = "Flow of control in the proof theory of structured programming", booktitle = "Proc.\ 16th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1975", pages = "29--33", } @InProceedings{MarRos75, author = "G. Markowsky and B. K. Rosen", title = "Bases for chain-complete posets", booktitle = "Proc.\ 16th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1975", pages = "34--47", } @InProceedings{DowSet75, author = "P. J. Downey and R. Sethi", title = "Correct computation rules for recursive languages", booktitle = "Proc.\ 16th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1975", pages = "48--56", } @InProceedings{HopPauVal75, author = "J. Hopcroft and W. Paul and L. Valiant", title = "On time versus space and related problems", booktitle = "Proc.\ 16th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1975", pages = "57--64", } @InProceedings{HarBer75, author = "J. Hartmanis and L. Berman", title = "A note on tape bounds for {SLA} language processing", booktitle = "Proc.\ 16th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1975", pages = "65--70", } @InProceedings{Pohl75, author = "I. Pohl", title = "Minimean optimality in sorting algorithms", booktitle = "Proc.\ 16th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1975", pages = "71--74", } @InProceedings{VanEmdeBoas75, author = "P. VanEmdeBoas", title = "Preserving order in a forest in less than logarithmic time", booktitle = "Proc.\ 16th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1975", pages = "75--84", } @InProceedings{Yao75, author = "A. C. -C. Yao", title = "On the complexity of comparison problems using linear functions", booktitle = "Proc.\ 16th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1975", pages = "85--89", } @InProceedings{SzyUll75, author = "T. G. Szymanski and J. D. Ullman", title = "Evaluating relational expressions with dense and sparse arguments", booktitle = "Proc.\ 16th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1975", pages = "90--97", } @InProceedings{Fredman75, author = "M. L. Fredman", title = "On the decision tree complexity of the shortest path problems", booktitle = "Proc.\ 16th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1975", pages = "98--99", } @InProceedings{EveKar75, author = "S. Even and O. Kariv", title = "An $0({N}^{2.5})$ algorithm for maximum matching in general graphs", booktitle = "Proc.\ 16th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1975", pages = "100--112", } @InProceedings{Pippenger75, author = "N. Pippenger", title = "Information theory and the complexity of switching networks", booktitle = "Proc.\ 16th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1975", pages = "113--118", } @InProceedings{Pratt75, author = "V. R. Pratt", title = "The effect of basis on size of Boolean expressions", booktitle = "Proc.\ 16th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1975", pages = "119--121", } @InProceedings{GellerEtAl75, author = "M. M. Geller and III H. B. Hunt and T. G. Szymanski and J. D. Ullman", title = "Economy of descriptions by parsers, {DPDA}'s, and {PDA}'s", booktitle = "Proc.\ 16th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1975", pages = "122--127", } @InProceedings{Beeri75, author = "C. Beeri", title = "An improvement of Valiant's decision procedure for equivalence of deterministic finite-turn pushdown automata", booktitle = "Proc.\ 16th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1975", pages = "128--134", } @InProceedings{Rounds75, author = "W. C. Rounds", title = "A grammatical characterization of exponential-time languages", booktitle = "Proc.\ 16th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1975", pages = "135--143", } @InProceedings{HunRan75, author = "III H. B. Hunt and J. L. Rangel", title = "Decidability of equivalence, containment, intersection, and separability of context-free languages", booktitle = "Proc.\ 16th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1975", pages = "144--150", } @InProceedings{ShaHoe75, author = "M. I. Shamos and D. Hoey", title = "Closest-point problems", booktitle = "Proc.\ 16th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1975", pages = "151--162", } @InProceedings{KleKri75, author = "D. J. Kleitman and M. M. Krieger", title = "An optimal bound for two dimensional bin packing", booktitle = "Proc.\ 16th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1975", pages = "163--168", } @InProceedings{AdlMan75, author = "L. Adleman and K. Manders", title = "Computational complexity of decision procedures for polynomials", booktitle = "Proc.\ 16th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1975", pages = "169--177", } @InProceedings{GarJohSo75, author = "M. R. Garey and D. S. Johnson and H. C. So", title = "An application of graph coloring to printed circuit testing", booktitle = "Proc.\ 16th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1975", pages = "178--183", } @InProceedings{EveItaSha75, author = "S. Even and A. Itai and A. Shamir", title = "On the complexity of timetable and multi-commodity flow problems", booktitle = "Proc.\ 16th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1975", pages = "184--193", } @InProceedings{PapSte76, author = "C. H. Papadimitriou and K. Steiglitz", title = "Some complexity results for the traveling salesman problem", booktitle = "Proc.\ 8th ACM Symposium on Theory of Computing (STOC)", year = "1976", pages = "1--9", } @InProceedings{GarGraJoh76, author = "M. R. Garey and R. L. Graham and D. S. Johnson", title = "Some {NP}-complete geometric problems", booktitle = "Proc.\ 8th ACM Symposium on Theory of Computing (STOC)", year = "1976", pages = "10--22", } @InProceedings{ManAdl76, author = "K. Manders and L. Adleman", title = "{NP}-complete decision problems for quadratic polynomials", booktitle = "Proc.\ 8th ACM Symposium on Theory of Computing (STOC)", year = "1976", pages = "23--29", } @InProceedings{HarBer76, author = "J. Hartmanis and L. Berman", title = "On isomorphism and density of {NP} and other complete sets", booktitle = "Proc.\ 8th ACM Symposium on Theory of Computing (STOC)", year = "1976", pages = "30--40", } @InProceedings{Schaefer76, author = "T. J. Schaefer", title = "Complexity of decision problems based on finite two-person perfect-information games", booktitle = "Proc.\ 8th ACM Symposium on Theory of Computing (STOC)", year = "1976", pages = "41--49", } @InProceedings{CarLipMey76, author = "E. Cardoza and R. Lipton and A. R. Meyer", title = "Exponential space complete problems for Petri nets and commutative semigroups", booktitle = "Proc.\ 8th ACM Symposium on Theory of Computing (STOC)", year = "1976", pages = "50--54", } @InProceedings{Hirschberg76, author = "D. S. Hirschberg", title = "Parallel algorithms for the transitive closure and the connected component problems", booktitle = "Proc.\ 8th ACM Symposium on Theory of Computing (STOC)", year = "1976", pages = "55--57", } @InProceedings{ThoKun76, author = "C. D. Thompson and H. T. Kung", title = "Sorting on a mesh-connected parallel computer", booktitle = "Proc.\ 8th ACM Symposium on Theory of Computing (STOC)", year = "1976", pages = "58--64", } @InProceedings{Doeppner76, author = "Jr. T. W. Doeppner", title = "On abstractions of parallel programs", booktitle = "Proc.\ 8th ACM Symposium on Theory of Computing (STOC)", year = "1976", pages = "65--72", } @InProceedings{Owicki76, author = "S. Owicki", title = "A consistent and complete deductive system for the verification of parallel programs", booktitle = "Proc.\ 8th ACM Symposium on Theory of Computing (STOC)", year = "1976", pages = "73--86", } @InProceedings{Wand76, author = "M. Wand", title = "A new incompleteness result for Hoare's system", booktitle = "Proc.\ 8th ACM Symposium on Theory of Computing (STOC)", year = "1976", pages = "87--91", } @InProceedings{Kimura76, author = "T. Kimura", title = "An algebraic system for process structuring and interprocess communication", booktitle = "Proc.\ 8th ACM Symposium on Theory of Computing (STOC)", year = "1976", pages = "92--100", } @InProceedings{Kosaraju76, author = "S. R. Kosaraju", title = "On structuring flowcharts", booktitle = "Proc.\ 8th ACM Symposium on Theory of Computing (STOC)", year = "1976", pages = "101--111", } @InProceedings{GraHarRuz76, author = "S. L. Graham and M. A. Harrison and W. L. Ruzzo", title = "On line context free language recognition in less than cubic time", booktitle = "Proc.\ 8th ACM Symposium on Theory of Computing (STOC)", year = "1976", pages = "112--120", } @InProceedings{FonUll76, author = "A. C. Fong and J. D. Ullman", title = "Finding the depth of a flow graph", booktitle = "Proc.\ 8th ACM Symposium on Theory of Computing (STOC)", year = "1976", pages = "121--125", } @InProceedings{HunSzy76, author = "III H. B. Hunt and T. G. Szymanski", title = "Dichotomization, reachability, and the forbidden subgraph problem", booktitle = "Proc.\ 8th ACM Symposium on Theory of Computing (STOC)", year = "1976", pages = "126--134", } @InProceedings{IbaKim76, author = "O. H. Ibarra and C. E. Kim", title = "A useful device for showing the solvability of some decision problems", booktitle = "Proc.\ 8th ACM Symposium on Theory of Computing (STOC)", year = "1976", pages = "135--140", } @InProceedings{Sudborough76, author = "I. H. Sudborough", title = "On deterministic context-free languages, multihead automata, and the power of an auxiliary pushdown store", booktitle = "Proc.\ 8th ACM Symposium on Theory of Computing (STOC)", year = "1976", pages = "141--148", } @InProceedings{PauTarCel76, author = "W. J. Paul and R. E. Tarjan and J. R. Celoni", title = "Space bounds for a game of graphs", booktitle = "Proc.\ 8th ACM Symposium on Theory of Computing (STOC)", year = "1976", pages = "149--160", } @InProceedings{Galil76, author = "Z. Galil", title = "Real-time algorithms for string-matching and palindrome recognition", booktitle = "Proc.\ 8th ACM Symposium on Theory of Computing (STOC)", year = "1976", pages = "161--173", } @InProceedings{LipSto76, author = "R. J. Lipton and L. J. Stockmeyer", title = "Evaluation of polynomials with super-preconditioning", booktitle = "Proc.\ 8th ACM Symposium on Theory of Computing (STOC)", year = "1976", pages = "174--180", } @InProceedings{PatWeg76, author = "M. S. Paterson and M. N. Wegman", title = "Linear unification", booktitle = "Proc.\ 8th ACM Symposium on Theory of Computing (STOC)", year = "1976", pages = "181--186", } @InProceedings{GuiSze76, author = "L. J. Guibas and E. Szemeredi", title = "The analysis of double hashing", booktitle = "Proc.\ 8th ACM Symposium on Theory of Computing (STOC)", year = "1976", pages = "187--191", } @InProceedings{Yao76, author = "A. C. -C. Yao", title = "On the average behavior of set merging algorithms", booktitle = "Proc.\ 8th ACM Symposium on Theory of Computing (STOC)", year = "1976", pages = "192--195", } @InProceedings{Valiant76, author = "L. G. Valiant", title = "Universal circuits", booktitle = "Proc.\ 8th ACM Symposium on Theory of Computing (STOC)", year = "1976", pages = "196--203", } @InProceedings{Pippenger76, author = "N. Pippenger", title = "The realization of monotone Boolean functions", booktitle = "Proc.\ 8th ACM Symposium on Theory of Computing (STOC)", year = "1976", pages = "204--210", } @InProceedings{Burkhard76, author = "W. A. Burkhard", title = "Associative retrieval trie hash-coding", booktitle = "Proc.\ 8th ACM Symposium on Theory of Computing (STOC)", year = "1976", pages = "211--219", } @InProceedings{BenSha76, author = "J. L. Bentley and M. I. Shamos", title = "Divide-and-conquer in multidimensional space", booktitle = "Proc.\ 8th ACM Symposium on Theory of Computing (STOC)", year = "1976", pages = "220--230", } @InProceedings{LeePre76, author = "D. T. Lee and F. P. Preparata", title = "Location of a point in a planar subdivision and its applications", booktitle = "Proc.\ 8th ACM Symposium on Theory of Computing (STOC)", year = "1976", pages = "231--235", } @InProceedings{MacYou76, author = "M. Machtey and P. Young", title = "Simple {G}{\"o}del numberings, translations, and the {P}-hierarchy", booktitle = "Proc.\ 8th ACM Symposium on Theory of Computing (STOC)", year = "1976", pages = "236--243", } @InProceedings{RivPra76, author = "R. L. Rivest and V. R. Pratt", title = "The mutual exclusion problem for unreliable processes", booktitle = "Proc.\ 17th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1976", pages = "1--8", } @InProceedings{HenZal76, author = "P. B. Henderson and Y. Zalcstein", title = "Characterization of the synchronization languages for {PV} systems", booktitle = "Proc.\ 17th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1976", pages = "9--18", } @InProceedings{SteLewRos76, author = "R. E. Stearns and II P. M. Lewis and D. J. Rosenkrantz", title = "Concurrency control for database systems", booktitle = "Proc.\ 17th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1976", pages = "19--32", } @InProceedings{JonLipSny76, author = "A. K. Jones and R. J. Lipton and L. Snyder", title = "A linear time algorithm for deciding security", booktitle = "Proc.\ 17th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1976", pages = "33--41", } @InProceedings{FarKenZuc76, author = "R. Farrow and K. Kennedy and L. Zucconi", title = "Graph grammars and global program data flow analysis", booktitle = "Proc.\ 17th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1976", pages = "42--56", } @InProceedings{DowSet76, author = "P. J. Downey and R. Sethi", title = "Assignment commands and array structures", booktitle = "Proc.\ 17th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1976", pages = "57--66", } @InProceedings{YaoRiv76, author = "A. C. Yao and R. L. Rivest", title = "${K}+1$ heads are better than ${K}$", booktitle = "Proc.\ 17th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1976", pages = "67--70", } @InProceedings{BakSel76, author = "T. P. Baker and A. L. Selman", title = "A second step toward the polynomial hierarchy", booktitle = "Proc.\ 17th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1976", pages = "71--75", } @InProceedings{Berman76, author = "L. Berman", title = "On the structure of complete sets: Almost everywhere complexity and infinitely often speedup", booktitle = "Proc.\ 17th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1976", pages = "76--80", } @InProceedings{AdlMan76, author = "L. Adleman and K. Manders", title = "Diophantine complexity", booktitle = "Proc.\ 17th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1976", pages = "81--88", } @InProceedings{Kozen76, author = "D. Kozen", title = "On parallelism in Turing machines", booktitle = "Proc.\ 17th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1976", pages = "89--97", } @InProceedings{ChaSto76, author = "A. K. Chandra and L. J. Stockmeyer", title = "Alternation", booktitle = "Proc.\ 17th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1976", pages = "98--108", } @InProceedings{Pratt76, author = "V. R. Pratt", title = "Semantical considerations on Floyd-Hoare logic", booktitle = "Proc.\ 17th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1976", pages = "109--121", } @InProceedings{Lehmann76, author = "D. J. Lehmann", title = "Categories for fixpoint-semantics", booktitle = "Proc.\ 17th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1976", pages = "122--126", } @InProceedings{Chirica76, author = "L. M. Chirica", title = "An algebraic formulation of Knuthian semantics", booktitle = "Proc.\ 17th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1976", pages = "127--136", } @InProceedings{CouNiv76, author = "B. Courcelle and M. Nivat", title = "Algebraic families of interpretations", booktitle = "Proc.\ 17th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1976", pages = "137--146", } @InProceedings{WrightEtAl76, author = "J. B. Wright and J. W. Thatcher and E. G. Wagner and J. A. Goguen", title = "Rational algebraic theories and fixed-point solutions", booktitle = "Proc.\ 17th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1976", pages = "147--158", } @InProceedings{Friedman76, author = "E. P. Friedman", title = "Simple languages and free schemes", booktitle = "Proc.\ 17th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1976", pages = "159--165", } @InProceedings{AllMun76, author = "B. Allen and I. Munro", title = "Self-organizing binary search trees", booktitle = "Proc.\ 17th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1976", pages = "166--172", } @InProceedings{YaoYao76, author = "A. C. Yao and F. F. Yao", title = "The complexity of searching an ordered random table", booktitle = "Proc.\ 17th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1976", pages = "173--177", } @InProceedings{FusGab76, author = "F. Fussenegger and H. N. Gabow", title = "Using comparison trees to derive lower bounds for selection problems", booktitle = "Proc.\ 17th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1976", pages = "178--182", } @InProceedings{Guibas76, author = "L. J. Guibas", title = "The analysis of hashing algorithms that exhibit k-ary clustering", booktitle = "Proc.\ 17th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1976", pages = "183--196", } @InProceedings{ComSet76, author = "D. Comer and R. Sethi", title = "Complexity of trie index construction", booktitle = "Proc.\ 17th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1976", pages = "197--207", } @InProceedings{ShaHoe76, author = "M. I. Shamos and D. Hoey", title = "Geometric intersection problems", booktitle = "Proc.\ 17th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1976", pages = "208--215", } @InProceedings{FreHecKim76, author = "G. N. Frederickson and M. S. Hecht and C. E. Kim", title = "Approximation algorithms for some routing problems", booktitle = "Proc.\ 17th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1976", pages = "216--227", } @InProceedings{VanLeeuwen76, author = "J. VanLeeuwen", title = "Variations of a new machine model", booktitle = "Proc.\ 17th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1976", pages = "228--235", } @InProceedings{GalSei76, author = "Z. Galil and J. Seiferas", title = "Recognizing certain repetitions and reversals within strings", booktitle = "Proc.\ 17th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1976", pages = "236--252", } @InProceedings{BoaNiv76, author = "L. Boasson and M. Nivat", title = "Parenthesis generators", booktitle = "Proc.\ 17th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1976", pages = "253--257", } @InProceedings{Pippenger76, author = "N. Pippenger", title = "On the evaluation of powers and related problems", booktitle = "Proc.\ 17th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1976", pages = "258--263", } @InProceedings{Plaisted76, author = "D. A. Plaisted", title = "Some polynomial and integer divisibility problems are {NP}-hard", booktitle = "Proc.\ 17th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1976", pages = "264--267", } @InProceedings{ShaYuv76, author = "M. I. Shamos and G. Yuval", title = "Lower bounds from complex function theory", booktitle = "Proc.\ 17th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1976", pages = "268--273", } @InProceedings{Itai77, author = "A. Itai", title = "Finding a minimum circuit in a graph", booktitle = "Proc.\ 9th ACM Symposium on Theory of Computing (STOC)", year = "1977", pages = "1--10", } @InProceedings{YaoAviRiv77, author = "A. C. Yao and D. M. Avis and R. L. Rivest", title = "An $\Omega (n^2 \log n)$ lower bound to the shortest paths problem", booktitle = "Proc.\ 9th ACM Symposium on Theory of Computing (STOC)", year = "1977", pages = "11--17", } @InProceedings{Tarjan77, author = "R. E. Tarjan", title = "Reference machines require non-linear time to maintain disjoint sets", booktitle = "Proc.\ 9th ACM Symposium on Theory of Computing (STOC)", year = "1977", pages = "18--29", } @InProceedings{AngVal77, author = "D. Angluin and L. G. Valiant", title = "Fast probabilistic algorithms for Hamiltonian circuits and matchings", booktitle = "Proc.\ 9th ACM Symposium on Theory of Computing (STOC)", year = "1977", pages = "30--41", } @InProceedings{Brown77, author = "M. R. Brown", title = "The complexity of priority queue maintenance", booktitle = "Proc.\ 9th ACM Symposium on Theory of Computing (STOC)", year = "1977", pages = "42--48", } @InProceedings{GuibasEtAl77, author = "L. J. Guibas and E. M. McCreight and M. F. Plass and J. R. Roberts", title = "A new representation for linear lists", booktitle = "Proc.\ 9th ACM Symposium on Theory of Computing (STOC)", year = "1977", pages = "49--60", } @InProceedings{SacTen77, author = "G. S. Sacerdote and R. L. Tenney", title = "The decidability of the reachability problem for vector addition systems", booktitle = "Proc.\ 9th ACM Symposium on Theory of Computing (STOC)", year = "1977", pages = "61--76", } @InProceedings{ChaMer77, author = "A. K. Chandra and P. M. Merlin", title = "Optimal implementation of conjunctive queries in relational data bases", booktitle = "Proc.\ 9th ACM Symposium on Theory of Computing (STOC)", year = "1977", pages = "77--90", } @InProceedings{PetFis77, author = "G. L. Peterson and M. J. Fischer", title = "Economical solutions for the critical section problem in a distributed system", booktitle = "Proc.\ 9th ACM Symposium on Theory of Computing (STOC)", year = "1977", pages = "91--97", } @InProceedings{Rosenthal77, author = "A. Rosenthal", title = "Nonserial dynamic programming is optimal", booktitle = "Proc.\ 9th ACM Symposium on Theory of Computing (STOC)", year = "1977", pages = "98--105", } @InProceedings{CarWeg77, author = "J. L. Carter and M. N. Wegman", title = "Universal classes of hash functions", booktitle = "Proc.\ 9th ACM Symposium on Theory of Computing (STOC)", year = "1977", pages = "106--112", } @InProceedings{GonMun77, author = "G. Gonnet and I. Munro", title = "The analysis of an improved hashing technique", booktitle = "Proc.\ 9th ACM Symposium on Theory of Computing (STOC)", year = "1977", pages = "113--121", } @InProceedings{Beatty77, author = "J. C. Beatty", title = "Iteration theorems for {LL}($k$) languages", booktitle = "Proc.\ 9th ACM Symposium on Theory of Computing (STOC)", year = "1977", pages = "122--131", } @InProceedings{PraSet77, author = "B. Prabhala and R. Sethi", title = "A comparison of instruction sets for stack machines", booktitle = "Proc.\ 9th ACM Symposium on Theory of Computing (STOC)", year = "1977", pages = "132--142", } @InProceedings{Miller77, author = "G. L. Miller", title = "Graph isomorphism, general remarks", booktitle = "Proc.\ 9th ACM Symposium on Theory of Computing (STOC)", year = "1977", pages = "143--150", } @InProceedings{AdlMan77, author = "L. Adleman and K. Manders", title = "Reducibility, randomness, and intractability", booktitle = "Proc.\ 9th ACM Symposium on Theory of Computing (STOC)", year = "1977", pages = "151--163", } @InProceedings{Kozen77, author = "D. Kozen", title = "Complexity of finitely presented algebras", booktitle = "Proc.\ 9th ACM Symposium on Theory of Computing (STOC)", year = "1977", pages = "164--177", } @InProceedings{KinFis77, author = "C. M. R. Kintala and P. C. Fischer", title = "Computations with a restricted number of nondeterministic steps", booktitle = "Proc.\ 9th ACM Symposium on Theory of Computing (STOC)", year = "1977", pages = "178--185", } @InProceedings{SimGil77, author = "IstvanSimon and J. Gill", title = "Polynomial reducibilities and upward diagonalizations", booktitle = "Proc.\ 9th ACM Symposium on Theory of Computing (STOC)", year = "1977", pages = "186--194", } @InProceedings{Simon77, author = "J. Simon", title = "On feasible numbers", booktitle = "Proc.\ 9th ACM Symposium on Theory of Computing (STOC)", year = "1977", pages = "195--207", } @InProceedings{Sudborough77, author = "I. H. Sudborough", title = "Separating tape bounded auxiliary pushdown automata classes", booktitle = "Proc.\ 9th ACM Symposium on Theory of Computing (STOC)", year = "1977", pages = "208--217", } @InProceedings{Paul77, author = "W. J. Paul", title = "On time hierarchies", booktitle = "Proc.\ 9th ACM Symposium on Theory of Computing (STOC)", year = "1977", pages = "218--222", } @InProceedings{Hartmanis77, author = "J. Hartmanis", title = "Relations between diagonalization, proof systems, and complexity gaps", booktitle = "Proc.\ 9th ACM Symposium on Theory of Computing (STOC)", year = "1977", pages = "223--227", } @InProceedings{LynBlu77, author = "N. A. Lynch and E. K. Blum", title = "Efficient reducibility between programming systems", booktitle = "Proc.\ 9th ACM Symposium on Theory of Computing (STOC)", year = "1977", pages = "228--238", } @InProceedings{LeoSei77, author = "B. Leong and J. Seiferas", title = "New real-time simulations of multihead tape units", booktitle = "Proc.\ 9th ACM Symposium on Theory of Computing (STOC)", year = "1977", pages = "239--248", } @InProceedings{HarPnuSta77, author = "D. Harel and A. Pnueli and J. Stavi", title = "A complete axiomatic system for proving deductions about recursive programs", booktitle = "Proc.\ 9th ACM Symposium on Theory of Computing (STOC)", year = "1977", pages = "249--260", } @InProceedings{HarMeyPra77, author = "D. Harel and A. R. Meyer and V. R. Pratt", title = "Computability and completeness in logics of programs", booktitle = "Proc.\ 9th ACM Symposium on Theory of Computing (STOC)", year = "1977", pages = "261--268", } @InProceedings{Constable77, author = "R. L. Constable", title = "On the theory of programming logics", booktitle = "Proc.\ 9th ACM Symposium on Theory of Computing (STOC)", year = "1977", pages = "269--285", } @InProceedings{FisLad77, author = "M. J. Fischer and R. E. Ladner", title = "Propositional modal logic of programs", booktitle = "Proc.\ 9th ACM Symposium on Theory of Computing (STOC)", year = "1977", pages = "286--294", } @InProceedings{O'Donnell77, author = "M. O'Donnell", title = "Subtree replacement systems: {A} unifying theory for recursive equations, {LISP}, lucid and combinatory logic", booktitle = "Proc.\ 9th ACM Symposium on Theory of Computing (STOC)", year = "1977", pages = "295--305", } @InProceedings{HenAsh77, author = "M. C. B. Hennessy and E. A. Ashcroft", title = "Parameter-passing mechanisms and nondeterminism", booktitle = "Proc.\ 9th ACM Symposium on Theory of Computing (STOC)", year = "1977", pages = "306--311", } @InProceedings{Lipton77, author = "R. Lipton", title = "A necessary and sufficient condition for the existence of Hoare logics", booktitle = "Proc.\ 18th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1977", pages = "1--6", } @InProceedings{LehSmy77, author = "D. J. Lehmann and M. B. Smyth", title = "Data types", booktitle = "Proc.\ 18th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1977", pages = "7--12", } @InProceedings{SmyPlo77, author = "M. B. Smyth and G. D. Plotkin", title = "The category-theoretic solution of recursive domain equations", booktitle = "Proc.\ 18th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1977", pages = "13--17", } @InProceedings{Clarke77, author = "Jr. E. M. Clarke", title = "Program invariants as fixed points", booktitle = "Proc.\ 18th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1977", pages = "18--29", } @InProceedings{Huet77, author = "G. Huet", title = "Confluent reductions: Abstract properties and applications to term rewriting systems", booktitle = "Proc.\ 18th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1977", pages = "30--45", } @InProceedings{Pnueli77, author = "A. Pnueli", title = "The temporal logic of programs", booktitle = "Proc.\ 18th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1977", pages = "46--57", } @InProceedings{Book77, author = "R. V. Book", title = "Language representation theorems: How to generate the {R}. {E}. sets from the regular sets", booktitle = "Proc.\ 18th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1977", pages = "58--61", } @InProceedings{Lewis77, author = "H. R. Lewis", title = "A new decidable problem, with applications", booktitle = "Proc.\ 18th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1977", pages = "62--73", } @InProceedings{Ibarra77, author = "O. H. Ibarra", title = "The unsolvability of the equivalence problem for $\epsilon$-free {NGSM}'s with unary input (output) alphabet and applications", booktitle = "Proc.\ 18th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1977", pages = "74--81", } @InProceedings{KatSip77, author = "H. P. Katseff and M. Sipser", title = "Several results in program size complexity", booktitle = "Proc.\ 18th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1977", pages = "82--89", } @InProceedings{Statman77, author = "R. Statman", title = "The typed $\lambda$-calculus is not elementary recursive", booktitle = "Proc.\ 18th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1977", pages = "90--94", } @InProceedings{Berman77, author = "L. Berman", title = "Precise bounds for Presburger arithmetic and the reals with addition", booktitle = "Proc.\ 18th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1977", pages = "95--99", } @InProceedings{BenSoa77, author = "V. L. Bennison and R. I. Soare", title = "Recursion theoretic characterizations of complexity theoretic properties", booktitle = "Proc.\ 18th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1977", pages = "100--106", } @InProceedings{AhoBeeUll77, author = "A. V. Aho and C. Beeri and J. D. Ullman", title = "The theory of joins in relational data bases", booktitle = "Proc.\ 18th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1977", pages = "107--113", } @InProceedings{NelOpp77, author = "G. Nelson and D. C. Oppen", title = "Fast decision algorithms based on union and find", booktitle = "Proc.\ 18th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1977", pages = "114--119", } @InProceedings{KunSon77, author = "H. T. Kung and S. W. Song", title = "An efficient parallel garbage collection system and its correctness proof", booktitle = "Proc.\ 18th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1977", pages = "120--131", } @InProceedings{Maier77, author = "D. Maier", title = "A space efficient method for the lowest common ancestor problem and an application to finding negative cycles", booktitle = "Proc.\ 18th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1977", pages = "132--141", } @InProceedings{Snyder77, author = "L. Snyder", title = "On uniquely represented data structures", booktitle = "Proc.\ 18th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1977", pages = "142--146", } @InProceedings{BluSak77, author = "M. Blum and W. J. Sakoda", title = "On the capability of finite automata in 2 and 3 dimensional space", booktitle = "Proc.\ 18th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1977", pages = "147--161", } @InProceedings{LipTar77, author = "R. J. Lipton and R. E. Tarjan", title = "Application of a planar separator theorem", booktitle = "Proc.\ 18th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1977", pages = "162--170", } @InProceedings{Hyafil77, author = "L. Hyafil", title = "The power of commutativity", booktitle = "Proc.\ 18th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1977", pages = "171--174", } @InProceedings{AdlManMil77, author = "L. Adleman and K. Manders and G. Miller", title = "On taking roots in finite fields", booktitle = "Proc.\ 18th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1977", pages = "175--178", } @InProceedings{GalSei77, author = "Z. Galil and J. Seiferas", title = "Saving space in fast string-matching", booktitle = "Proc.\ 18th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1977", pages = "179--188", } @InProceedings{GuiOdl77, author = "L. J. Guibas and A. M. Odlyzko", title = "A new proof of the linearity of the Boyer-Moore string searching algorithm", booktitle = "Proc.\ 18th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1977", pages = "189--195", } @InProceedings{FlaRaoVui77, author = "P. Flajolet and J. C. Raoult and J. Vuillemin", title = "On the average number of registers required for evaluating arithmetic expressions", booktitle = "Proc.\ 18th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1977", pages = "196--205", } @InProceedings{Lawler77, author = "E. L. Lawler", title = "Fast approximation algorithms for knapsack problems", booktitle = "Proc.\ 18th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1977", pages = "206--213", } @InProceedings{CofLeu77, author = "Jr. E. G. Coffman and J. Y. -T. Leung", title = "Combinatorial analysis of an efficient algorithm for processor and storage allocation", booktitle = "Proc.\ 18th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1977", pages = "214--221", } @InProceedings{Yao77, author = "A. C. -C. Yao", title = "Probabilistic computations: Toward a unified measure of complexity", booktitle = "Proc.\ 18th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1977", pages = "222--227", } @InProceedings{Lloyd77, author = "E. L. Lloyd", title = "On triangulations of a set of points in the plane", booktitle = "Proc.\ 18th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1977", pages = "228--240", } @InProceedings{Plaisted77, author = "D. A. Plaisted", title = "New {NP}-hard and {NP}-complete polynomial and integer divisibility problems", booktitle = "Proc.\ 18th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1977", pages = "241--253", } @InProceedings{Kozen77, author = "D. Kozen", title = "Lower bounds for natural proof systems", booktitle = "Proc.\ 18th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1977", pages = "254--266", } @InProceedings{Megiddo78, author = "N. Megiddo", title = "Combinatorial optimization with rational objective functions", booktitle = "Proc.\ 10th ACM Symposium on Theory of Computing (STOC)", year = "1978", pages = "1--12", } @InProceedings{Lueker78, author = "G. S. Lueker", title = "Maximization problems on graphs with edge weights chosen from a normal distribution", booktitle = "Proc.\ 10th ACM Symposium on Theory of Computing (STOC)", year = "1978", pages = "13--18", } @InProceedings{BroTar78, author = "M. R. Brown and R. E. Tarjan", title = "A representation for linear lists with movable fingers", booktitle = "Proc.\ 10th ACM Symposium on Theory of Computing (STOC)", year = "1978", pages = "19--29", } @InProceedings{StoSzy78, author = "J. A. Storer and T. G. Szymanski", title = "The macro model for data compression", booktitle = "Proc.\ 10th ACM Symposium on Theory of Computing (STOC)", year = "1978", pages = "30--39", } @InProceedings{LapRiv78, author = "A. S. Lapaugh and R. L. Rivest", title = "The subgraph homeomorphism problem", booktitle = "Proc.\ 10th ACM Symposium on Theory of Computing (STOC)", year = "1978", pages = "40--50", } @InProceedings{Miller78, author = "G. L. Miller", title = "On the $ n^{\log n} $ isomorphism technique", booktitle = "Proc.\ 10th ACM Symposium on Theory of Computing (STOC)", year = "1978", pages = "51--58", } @InProceedings{CarterEtAl78, author = "L. Carter and R. Floyd and J. Gill and G. Markowsky and M. Wegman", title = "Exact and approximate membership testers", booktitle = "Proc.\ 10th ACM Symposium on Theory of Computing (STOC)", year = "1978", pages = "59--65", } @InProceedings{EngRozSlu78, author = "J. Engelfriet and G. Rozenberg and G. Slutzki", title = "Tree transducers, {L} systems and two-way machines", booktitle = "Proc.\ 10th ACM Symposium on Theory of Computing (STOC)", year = "1978", pages = "66--74", } @InProceedings{RaoVui78, author = "J. -C. Raoult and J. Vuillemin", title = "Operational and semantic equivalence between recursive programs", booktitle = "Proc.\ 10th ACM Symposium on Theory of Computing (STOC)", year = "1978", pages = "75--85", } @InProceedings{Katseff78, author = "H. P. Katseff", title = "A new solution to the critical section problem", booktitle = "Proc.\ 10th ACM Symposium on Theory of Computing (STOC)", year = "1978", pages = "86--88", } @InProceedings{Goldschlager78, author = "L. M. Goldschlager", title = "A unified approach to models of synchronous parallel machines", booktitle = "Proc.\ 10th ACM Symposium on Theory of Computing (STOC)", year = "1978", pages = "89--94", } @InProceedings{SciTan78, author = "E. Sciore and A. Tang", title = "Computability theory in admissible domains", booktitle = "Proc.\ 10th ACM Symposium on Theory of Computing (STOC)", year = "1978", pages = "95--104", } @InProceedings{MilYap78, author = "R. E. Miller and C. K. Yap", title = "On formulating simultaneity for studying parallelism and synchronization", booktitle = "Proc.\ 10th ACM Symposium on Theory of Computing (STOC)", year = "1978", pages = "105--113", } @InProceedings{ForWyl78, author = "S. Fortune and J. Wyllie", title = "Parallelism in random access machines", booktitle = "Proc.\ 10th ACM Symposium on Theory of Computing (STOC)", year = "1978", pages = "114--118", } @InProceedings{ThaWagWri78, author = "J. W. Thatcher and E. G. Wagner and J. B. Wright", title = "Data type specification: Parameterization and the power of specification techniques", booktitle = "Proc.\ 10th ACM Symposium on Theory of Computing (STOC)", year = "1978", pages = "119--132", } @InProceedings{Filotti78, author = "I. S. Filotti", title = "An efficient algorithm for determining whether a cubic graph is toroidal", booktitle = "Proc.\ 10th ACM Symposium on Theory of Computing (STOC)", year = "1978", pages = "133--142", } @InProceedings{Wegener78, author = "I. Wegener", title = "Switching functions whose monotone complexity is nearly quadratic", booktitle = "Proc.\ 10th ACM Symposium on Theory of Computing (STOC)", year = "1978", pages = "143--149", } @InProceedings{Lynch78, author = "N. A. Lynch", title = "Straight-line program length as a parameter for complexity measures", booktitle = "Proc.\ 10th ACM Symposium on Theory of Computing (STOC)", year = "1978", pages = "150--161", } @InProceedings{Pan78, author = "V. Y. Pan", title = "Computational complexity of computing polynomials over the fields of real and complex numbers", booktitle = "Proc.\ 10th ACM Symposium on Theory of Computing (STOC)", year = "1978", pages = "162--172", } @InProceedings{Ja'Ja'78, author = "J. Ja'Ja'", title = "Optimal evaluation of pairs of bilinear forms", booktitle = "Proc.\ 10th ACM Symposium on Theory of Computing (STOC)", year = "1978", pages = "173--183", } @InProceedings{GabKar78, author = "H. N. Gabow and O. Kariv", title = "Algorithms for edge coloring bipartite graphs", booktitle = "Proc.\ 10th ACM Symposium on Theory of Computing (STOC)", year = "1978", pages = "184--192", } @InProceedings{Hyafil78, author = "L. Hyafil", title = "On the parallel evaluation of multivariate polynomials", booktitle = "Proc.\ 10th ACM Symposium on Theory of Computing (STOC)", year = "1978", pages = "193--195", } @InProceedings{Tompa78, author = "M. Tompa", title = "Time-space tradeoffs for computing functions, using connectivity properties of their circuits", booktitle = "Proc.\ 10th ACM Symposium on Theory of Computing (STOC)", year = "1978", pages = "196--204", } @InProceedings{GurIba78, author = "E. M. Gurari and O. H. Ibarra", title = "An {NP}-complete number-theoretic problem", booktitle = "Proc.\ 10th ACM Symposium on Theory of Computing (STOC)", year = "1978", pages = "205--215", } @InProceedings{Schaefer78, author = "T. J. Schaefer", title = "The complexity of satisfiability problems", booktitle = "Proc.\ 10th ACM Symposium on Theory of Computing (STOC)", year = "1978", pages = "216--226", } @InProceedings{RivestEtAl78, author = "R. L. Rivest and A. R. Meyer and D. J. Kleitman and K. Winklmann and J. Spencer", title = "Coping with errors in binary search procedures", booktitle = "Proc.\ 10th ACM Symposium on Theory of Computing (STOC)", year = "1978", pages = "227--232", } @InProceedings{BruMey78, author = "A. R. Bruss and A. R. Meyer", title = "On time-space classes and their relation to the theory of real addition", booktitle = "Proc.\ 10th ACM Symposium on Theory of Computing (STOC)", year = "1978", pages = "233--239", } @InProceedings{KirHel78, author = "D. G. Kirkpatrick and P. Hell", title = "On the completeness of a generalized matching problem", booktitle = "Proc.\ 10th ACM Symposium on Theory of Computing (STOC)", year = "1978", pages = "240--245", } @InProceedings{Dowd78, author = "M. Dowd", title = "Propositional representation of arithmetic proofs", booktitle = "Proc.\ 10th ACM Symposium on Theory of Computing (STOC)", year = "1978", pages = "246--252", } @InProceedings{Yannakakis78, author = "M. Yannakakis", title = "Node- and edge-deletion {NP}-complete problems", booktitle = "Proc.\ 10th ACM Symposium on Theory of Computing (STOC)", year = "1978", pages = "253--264", } @InProceedings{Lewis78, author = "J. M. Lewis", title = "On the complexity of the maximum subgraph problem", booktitle = "Proc.\ 10th ACM Symposium on Theory of Computing (STOC)", year = "1978", pages = "265--274", } @InProceedings{SakSip78, author = "W. J. Sakoda and M. Sipser", title = "Nondeterminism and the size of two way finite automata", booktitle = "Proc.\ 10th ACM Symposium on Theory of Computing (STOC)", year = "1978", pages = "275--286", } @InProceedings{Kozen78, author = "D. Kozen", title = "Indexing of subrecursive classes", booktitle = "Proc.\ 10th ACM Symposium on Theory of Computing (STOC)", year = "1978", pages = "287--295", } @InProceedings{Baudet78, author = "G. M. Baudet", title = "An analysis of the full alpha-beta pruning algorithm", booktitle = "Proc.\ 10th ACM Symposium on Theory of Computing (STOC)", year = "1978", pages = "296--313", } @InProceedings{CasSmi78, author = "J. Case and C. Smith", title = "Anomaly hierarchies of mechanized inductive inference", booktitle = "Proc.\ 10th ACM Symposium on Theory of Computing (STOC)", year = "1978", pages = "314--319", } @InProceedings{RedLov78, author = "C. R. Reddy and D. W. Loveland", title = "Presburger arithmetic with bounded quantifier alternation", booktitle = "Proc.\ 10th ACM Symposium on Theory of Computing (STOC)", year = "1978", pages = "320--325", } @InProceedings{Pratt78, author = "V. R. Pratt", title = "A practical decision method for propositional dynamic logic", booktitle = "Proc.\ 10th ACM Symposium on Theory of Computing (STOC)", year = "1978", pages = "326--337", } @InProceedings{Rackoff78, author = "C. Rackoff", title = "Relativized questions involving probabilistic algorithms", booktitle = "Proc.\ 10th ACM Symposium on Theory of Computing (STOC)", year = "1978", pages = "338--342", } @InProceedings{FraVieVui78, author = "J. Francon and G. Viennot and J. Vuillemin", title = "Description and analysis of an efficient priority queue representation", booktitle = "Proc.\ 19th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1978", pages = "1--7", } @InProceedings{GuiSed78, author = "L. J. Guibas and R. Sedgewick", title = "A dichromatic framework for balanced trees", booktitle = "Proc.\ 19th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1978", pages = "8--21", } @InProceedings{Yao78, author = "A. C. Yao", title = "Should tables be sorted?", booktitle = "Proc.\ 19th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1978", pages = "22--27", } @InProceedings{Lueker78, author = "G. S. Lueker", title = "A data structure for orthogonal range queries", booktitle = "Proc.\ 19th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1978", pages = "28--34", } @InProceedings{Lewis78, author = "H. R. Lewis", title = "Complexity of solvable cases of the decision problem for the predicate calculus", booktitle = "Proc.\ 19th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1978", pages = "35--47", } @InProceedings{LicSip78, author = "D. Lichtenstein and M. Sipser", title = "{GO} is {PSPACE} hard", booktitle = "Proc.\ 19th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1978", pages = "48--54", } @InProceedings{FraenkelEtAl78, author = "A. S. Fraenkel and M. R. Garey and D. S. Johnson and T. Schaefer and Y. Yesha", title = "The complexity of checkers on an {N} x {N} board", booktitle = "Proc.\ 19th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1978", pages = "55--64", } @InProceedings{HarImmMah78, author = "J. Hartmanis and N. Immerman and S. Mahaney", title = "One-way log-tape reductions", booktitle = "Proc.\ 19th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1978", pages = "65--72", } @InProceedings{Sipser78, author = "M. Sipser", title = "Halting space-bounded computations", booktitle = "Proc.\ 19th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1978", pages = "73--74", } @InProceedings{Adleman78, author = "L. Adleman", title = "Two theorems on random polynomial time", booktitle = "Proc.\ 19th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1978", pages = "75--83", } @InProceedings{Reischuk78, author = "R. Reischuk", title = "Improved bounds on the problem of time-space trade-off in the pebble game", booktitle = "Proc.\ 19th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1978", pages = "84--91", } @InProceedings{LadLipSto78, author = "R. E. Ladner and R. J. Lipton and L. J. Stockmeyer", title = "Alternating pushdown automata", booktitle = "Proc.\ 19th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1978", pages = "92--106", } @InProceedings{SimGilHun78, author = "J. Simon and J. Gill and J. Hunt", title = "On tape-bounded probabilistic Turing machine transducers", booktitle = "Proc.\ 19th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1978", pages = "107--112", } @InProceedings{PauPraRei78, author = "W. J. Paul and E. J. Prauss and R. Reischuk", title = "On alternation", booktitle = "Proc.\ 19th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1978", pages = "113--122", } @InProceedings{EngRoz78, author = "J. Engelfriet and G. Rozenberg", title = "Equality languages, fixed point languages and representations of recursively enumerable languages", booktitle = "Proc.\ 19th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1978", pages = "123--126", } @InProceedings{Chandra78, author = "A. K. Chandra", title = "Computable nondeterministic functions", booktitle = "Proc.\ 19th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1978", pages = "127--131", } @InProceedings{BluKoz78, author = "M. Blum and D. Kozen", title = "On the power of the compass (or, Why mazes are easier to search than graphs)", booktitle = "Proc.\ 19th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1978", pages = "132--142", } @InProceedings{Simon78, author = "ImreSimon", title = "Limited subsets of a free monoid", booktitle = "Proc.\ 19th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1978", pages = "143--150", } @InProceedings{Abelson78, author = "H. Abelson", title = "Lower bounds on information transfer in distributed computations", booktitle = "Proc.\ 19th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1978", pages = "151--158", } @InProceedings{VandeWiele78, author = "J. -P. VandeWiele", title = "An optimal lower bound on the number of total operations to compute 0-1 polynomials over the field of complex numbers", booktitle = "Proc.\ 19th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1978", pages = "159--165", } @InProceedings{Pan78, author = "V. Y. Pan", title = "Strassen's algorithm is not optimal: Trililnear technique of aggregating, uniting and canceling for constructing fast algorithms for matrix operations", booktitle = "Proc.\ 19th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1978", pages = "166--176", } @InProceedings{Parikh78, author = "R. Parikh", title = "A decidability result for a second order process logic", booktitle = "Proc.\ 19th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1978", pages = "177--183", } @InProceedings{FloSuz78, author = "L. Flon and N. Suzuki", title = "Consistent and complete proof rules for the total correctness of parallel programs", booktitle = "Proc.\ 19th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1978", pages = "184--192", } @InProceedings{Lipton78, author = "R. J. Lipton", title = "Model theoretic aspects of computational complexity", booktitle = "Proc.\ 19th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1978", pages = "193--200", } @InProceedings{Courcelle78, author = "B. Courcelle", title = "On recursive equations having a unique solution", booktitle = "Proc.\ 19th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1978", pages = "201--213", } @InProceedings{Lehmann78, author = "D. J. Lehmann", title = "On the algebra of order", booktitle = "Proc.\ 19th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1978", pages = "214--220", } @InProceedings{Kanda78, author = "A. Kanda", title = "Data types as initial algebras: {A} unification of Scottery and {ADJ}ery", booktitle = "Proc.\ 19th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1978", pages = "221--230", } @InProceedings{Galil78, author = "Z. Galil", title = "A new algorithm for the maximal flow problem", booktitle = "Proc.\ 19th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1978", pages = "231--245", } @InProceedings{Simons78, author = "B. Simons", title = "A fast algorithm for single processor scheduling", booktitle = "Proc.\ 19th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1978", pages = "246--252", } @InProceedings{MunPat78, author = "J. I. Munro and M. S. Paterson", title = "Selection and sorting with limited storage", booktitle = "Proc.\ 19th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1978", pages = "253--258", } @InProceedings{Christen78, author = "C. Christen", title = "Improving the bounds on optimal merging", booktitle = "Proc.\ 19th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1978", pages = "259--266", } @InProceedings{Yap78, author = "C. K. Yap", title = "On lifted problems", booktitle = "Proc.\ 19th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1978", pages = "267--279", } @InProceedings{YaoYao78, author = "A. C. Yao and F. F. Yao", title = "On the average-case complexity of selecting $k$-th best", booktitle = "Proc.\ 19th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1978", pages = "280--289", } @InProceedings{ValTarLaw79, author = "J. Valdes and R. E. Tarjan and E. L. Lawler", title = "The recognition of series parallel digraphs", booktitle = "Proc.\ 11th ACM Symposium on Theory of Computing (STOC)", year = "1979", pages = "1--12", } @InProceedings{GalNaa79, author = "Z. Galil and A. Naamad", title = "Network flow and generalized path compression", booktitle = "Proc.\ 11th ACM Symposium on Theory of Computing (STOC)", year = "1979", pages = "13--26", } @InProceedings{FilMilRei79, author = "I. S. Filotti and G. L. Miller and J. H. Reif", title = "On determining the genus of a graph in $ {O}(v^{O}(g) ) $ steps", booktitle = "Proc.\ 11th ACM Symposium on Theory of Computing (STOC)", year = "1979", pages = "27--37", } @InProceedings{ChaDob79, author = "B. Chazelle and D. Dobkin", title = "Decomposing a polygon into its convex parts", booktitle = "Proc.\ 11th ACM Symposium on Theory of Computing (STOC)", year = "1979", pages = "38--48", } @InProceedings{FlaFraVui79, author = "P. Flajolet and J. Francon and J. Vuillemin", title = "Computing integrated costs of sequences of operations with application to dictionaries", booktitle = "Proc.\ 11th ACM Symposium on Theory of Computing (STOC)", year = "1979", pages = "49--61", } @InProceedings{Fredman79, author = "M. L. Fredman", title = "A near optimal data structure for a type of range query problem", booktitle = "Proc.\ 11th ACM Symposium on Theory of Computing (STOC)", year = "1979", pages = "62--66", } @InProceedings{Kosaraju79, author = "S. R. Kosaraju", title = "On a multidimensional search problem", booktitle = "Proc.\ 11th ACM Symposium on Theory of Computing (STOC)", year = "1979", pages = "67--73", } @InProceedings{SedSzy79, author = "R. Sedgewick and T. G. Szymanski", title = "The complexity of finding periods", booktitle = "Proc.\ 11th ACM Symposium on Theory of Computing (STOC)", year = "1979", pages = "74--80", } @InProceedings{Thompson79, author = "C. D. Thompson", title = "Area-time complexity for {VLSI}", booktitle = "Proc.\ 11th ACM Symposium on Theory of Computing (STOC)", year = "1979", pages = "81--88", } @InProceedings{TouUll79, author = "S. Toueg and J. D. Ullman", title = "Deadlock-free packet switching networks", booktitle = "Proc.\ 11th ACM Symposium on Theory of Computing (STOC)", year = "1979", pages = "89--98", } @InProceedings{RosWooGal79, author = "A. L. Rosenberg and D. Wood and Z. Galil", title = "Storage representations for tree-like data structures", booktitle = "Proc.\ 11th ACM Symposium on Theory of Computing (STOC)", year = "1979", pages = "99--107", } @InProceedings{MunSuw79, author = "J. I. Munro and H. Suwanda", title = "Implicit data structures", booktitle = "Proc.\ 11th ACM Symposium on Theory of Computing (STOC)", year = "1979", pages = "108--117", } @InProceedings{Shamir79, author = "A. Shamir", title = "On the cryptocomplexity of knapsack systems", booktitle = "Proc.\ 11th ACM Symposium on Theory of Computing (STOC)", year = "1979", pages = "118--129", } @InProceedings{Angluin79, author = "D. Angluin", title = "Finding patterns common to a set of strings", booktitle = "Proc.\ 11th ACM Symposium on Theory of Computing (STOC)", year = "1979", pages = "130--141", } @InProceedings{GurIba79, author = "E. M. Gurari and O. H. Ibarra", title = "The complexity of the equivalence problem for counter machines, semilinear sets, and simple programs", booktitle = "Proc.\ 11th ACM Symposium on Theory of Computing (STOC)", year = "1979", pages = "142--152", } @InProceedings{DeMLip79, author = "R. A. DeMillo and R. J. Lipton", title = "Some connections between mathematical logic and complexity theory", booktitle = "Proc.\ 11th ACM Symposium on Theory of Computing (STOC)", year = "1979", pages = "153--159", } @InProceedings{Berman79, author = "F. Berman", title = "A completeness technique for d-axiomatizable semantics", booktitle = "Proc.\ 11th ACM Symposium on Theory of Computing (STOC)", year = "1979", pages = "160--166", } @InProceedings{MeyWin79, author = "A. R. Meyer and K. Winklmann", title = "On the expressive power of dynamic logic", booktitle = "Proc.\ 11th ACM Symposium on Theory of Computing (STOC)", year = "1979", pages = "167--175", } @InProceedings{O'Donnell79, author = "M. O'Donnell", title = "A programming language theorem which is independent of Peano arithmetic", booktitle = "Proc.\ 11th ACM Symposium on Theory of Computing (STOC)", year = "1979", pages = "176--188", } @InProceedings{Valiant79, author = "L. G. Valiant", title = "Negation can be exponentially powerful", booktitle = "Proc.\ 11th ACM Symposium on Theory of Computing (STOC)", year = "1979", pages = "189--196", } @InProceedings{Ja'Ja'79, author = "J. Ja'Ja'", title = "On the complexity of bilinear forms with commutativity", booktitle = "Proc.\ 11th ACM Symposium on Theory of Computing (STOC)", year = "1979", pages = "197--208", } @InProceedings{Yao79, author = "A. C. -C. Yao", title = "Some complexity questions related to distributive computing", booktitle = "Proc.\ 11th ACM Symposium on Theory of Computing (STOC)", year = "1979", pages = "209--213", } @InProceedings{Ladner79, author = "R. E. Ladner", title = "The complexity of problems in systems of communicating sequential processes", booktitle = "Proc.\ 11th ACM Symposium on Theory of Computing (STOC)", year = "1979", pages = "214--223", } @InProceedings{Peterson79, author = "G. L. Peterson", title = "Time-space trade-offs for asynchronous parallel models --- Reducibilities and equivalences", booktitle = "Proc.\ 11th ACM Symposium on Theory of Computing (STOC)", year = "1979", pages = "224--230", } @InProceedings{Kosaraju79, author = "S. R. Kosaraju", title = "Fast parallel processing array algorithms for some graph problems", booktitle = "Proc.\ 11th ACM Symposium on Theory of Computing (STOC)", year = "1979", pages = "231--236", } @InProceedings{GilLenTar79, author = "J. R. Gilbert and T. Lengauer and R. E. Tarjan", title = "The pebbling problem is complete in polynomial space", booktitle = "Proc.\ 11th ACM Symposium on Theory of Computing (STOC)", year = "1979", pages = "237--248", } @InProceedings{Valiant79, author = "L. G. Valiant", title = "Completeness classes in algebra", booktitle = "Proc.\ 11th ACM Symposium on Theory of Computing (STOC)", year = "1979", pages = "249--261", } @InProceedings{LenTar79, author = "T. Lengauer and R. E. Tarjan", title = "Upper and lower bounds on time-space tradeoffs", booktitle = "Proc.\ 11th ACM Symposium on Theory of Computing (STOC)", year = "1979", pages = "262--277", } @InProceedings{Long79, author = "T. J. Long", title = "On $\gamma$-reducibility versus polynomial time many-one reducibility", booktitle = "Proc.\ 11th ACM Symposium on Theory of Computing (STOC)", year = "1979", pages = "278--287", } @InProceedings{Reif79, author = "J. H. Reif", title = "Universal games of incomplete information", booktitle = "Proc.\ 11th ACM Symposium on Theory of Computing (STOC)", year = "1979", pages = "288--308", } @InProceedings{ChaHar79, author = "A. K. Chandra and D. Harel", title = "Computable queries for relational data bases", booktitle = "Proc.\ 11th ACM Symposium on Theory of Computing (STOC)", year = "1979", pages = "309--318", } @InProceedings{BeeriEtAl79, author = "C. Beeri and A. O. Mendelzon and Y. Sagiv and J. D. Ullman", title = "Equivalence of relational database schemes", booktitle = "Proc.\ 11th ACM Symposium on Theory of Computing (STOC)", year = "1979", pages = "319--329", } @InProceedings{Maier79, author = "D. Maier", title = "Minimum covers in the relational database model", booktitle = "Proc.\ 11th ACM Symposium on Theory of Computing (STOC)", year = "1979", pages = "330--337", } @InProceedings{Cook79, author = "S. A. Cook", title = "Deterministic {CFL}'s are accepted simultaneously in polynomial time and log squared space", booktitle = "Proc.\ 11th ACM Symposium on Theory of Computing (STOC)", year = "1979", pages = "338--345", } @InProceedings{Kosaraju79, author = "S. R. Kosaraju", title = "Real-time simulation of concatenable double-ended queues by double-ended queues", booktitle = "Proc.\ 11th ACM Symposium on Theory of Computing (STOC)", year = "1979", pages = "346--351", } @InProceedings{Ruzzo79, author = "W. L. Ruzzo", title = "Tree-size bounded alternation", booktitle = "Proc.\ 11th ACM Symposium on Theory of Computing (STOC)", year = "1979", pages = "352--359", } @InProceedings{Sipser79, author = "M. Sipser", title = "Lower bounds on the size of sweeping automata", booktitle = "Proc.\ 11th ACM Symposium on Theory of Computing (STOC)", year = "1979", pages = "360--364", } @InProceedings{Yemini79, author = "Y. Yemini", title = "Some theoretical aspects of position-location problems", booktitle = "Proc.\ 20th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1979", pages = "1--8", } @InProceedings{DobSny79, author = "D. P. Dobkin and L. Snyder", title = "On a general method for maximizing and minimizing among certain geometric problems", booktitle = "Proc.\ 20th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1979", pages = "9--17", } @InProceedings{Kirkpatrick79, author = "D. G. Kirkpatrick", title = "Efficient computation of continuous skeletons", booktitle = "Proc.\ 20th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1979", pages = "18--27", } @InProceedings{Pan79, author = "V. Y. Pan", title = "Field extension and triangular aggregating, uniting and canceling for the acceleration of matrix multiplications", booktitle = "Proc.\ 20th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1979", pages = "28--38", } @InProceedings{BabKuc79, author = "L. Babai and L. Kucera", title = "Canonical labelling of graphs in linear average time", booktitle = "Proc.\ 20th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1979", pages = "39--46", } @InProceedings{Lagarias79, author = "J. C. Lagarias", title = "Succinct certificates for the solvability of binary quadratic Diophantine equations", booktitle = "Proc.\ 20th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1979", pages = "47--54", } @InProceedings{Adleman79, author = "L. Adleman", title = "A subexponential algorithm for the discrete logarithm problem with applications to cryptography", booktitle = "Proc.\ 20th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1979", pages = "55--60", } @InProceedings{Pippenger79, author = "N. Pippenger", title = "Computational complexity in algebraic function fields", booktitle = "Proc.\ 20th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1979", pages = "61--65", } @InProceedings{Greibach79, author = "S. A. Greibach", title = "Formal languages: Origins and directions", booktitle = "Proc.\ 20th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1979", pages = "66--90", } @InProceedings{Blattner79, author = "M. Blattner", title = "The decidability of the equivalence of context-free grammar forms", booktitle = "Proc.\ 20th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1979", pages = "91--96", } @InProceedings{MauNiv79, author = "H. A. Maurer and M. Nivat", title = "Bijective {A}-transducers", booktitle = "Proc.\ 20th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1979", pages = "97--100", } @InProceedings{Kozen79, author = "D. Kozen", title = "Semantics of probabilistic programs", booktitle = "Proc.\ 20th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1979", pages = "101--114", } @InProceedings{Pratt79, author = "V. R. Pratt", title = "Models of program logics", booktitle = "Proc.\ 20th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1979", pages = "115--122", } @InProceedings{Dershowitz79, author = "N. Dershowitz", title = "Orderings for term-rewriting systems", booktitle = "Proc.\ 20th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1979", pages = "123--131", } @InProceedings{LieSpe79, author = "K. Lieberherr and E. Specker", title = "Complexity of partial satisfaction", booktitle = "Proc.\ 20th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1979", pages = "132--139", } @InProceedings{PreVui79, author = "F. P. Preparata and J. Vuillemin", title = "The cube-connected-cycles: {A} versatile network for parallel computation", booktitle = "Proc.\ 20th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1979", pages = "140--147", } @InProceedings{SaxBen79, author = "J. B. Saxe and J. L. Bentley", title = "Transforming static data structures to dynamic structures", booktitle = "Proc.\ 20th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1979", pages = "148--168", } @InProceedings{GonMunSuw79, author = "G. H. Gonnet and J. I. Munro and H. Suwanda", title = "Toward self-organizing linear search", booktitle = "Proc.\ 20th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1979", pages = "169--174", } @InProceedings{WegCar79, author = "M. N. Wegman and J. L. Carter", title = "New classes and applications of hash functions", booktitle = "Proc.\ 20th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1979", pages = "175--182", } @InProceedings{FlaFraVui79, author = "P. Flajolet and J. Francon and J. Vuillemin", title = "Towards analysing sequences of operations for dynamic data structures", booktitle = "Proc.\ 20th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1979", pages = "183--195", } @InProceedings{GabTar79, author = "H. N. Gabow and R. E. Tarjan", title = "Efficient algorithms for simple matroid intersection problems", booktitle = "Proc.\ 20th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1979", pages = "196--204", } @InProceedings{AspShi79, author = "B. Aspvall and Y. Shiloach", title = "A polynomial time algorithm for solving systems of linear inequalities with two variables per inequality", booktitle = "Proc.\ 20th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1979", pages = "205--217", } @InProceedings{AleliunasEtAl79, author = "R. Aleliunas and R. M. Karp and R. J. Lipton and L. Lovasz and C. Rackoff", title = "Random walks, universal traversal sequences, and the complexity of maze problems", booktitle = "Proc.\ 20th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1979", pages = "218--223", } @InProceedings{Hartmanis79, author = "J. Hartmanis", title = "Observations about the development of theoretical computer science", booktitle = "Proc.\ 20th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1979", pages = "224--233", } @InProceedings{FischerEtAl79, author = "M. J. Fischer and N. A. Lynch and J. E. Burns and A. Borodin", title = "Resource allocation with immunity to limited process failure", booktitle = "Proc.\ 20th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1979", pages = "234--254", } @InProceedings{ClaLiu79, author = "E. M. Clarke and L. Liu", title = "Approximate algorithms for optimization of busy waiting in parallel programs", booktitle = "Proc.\ 20th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1979", pages = "255--266", } @InProceedings{AhoUllYan79, author = "A. V. Aho and J. D. Ullman and M. Yannakakis", title = "Modeling communications protocols by automata", booktitle = "Proc.\ 20th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1979", pages = "267--273", } @InProceedings{KedSil79, author = "Z. Kedem and A. Silberschatz", title = "Controlling concurrency using locking protocols", booktitle = "Proc.\ 20th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1979", pages = "274--285", } @InProceedings{YanPapKun79, author = "M. Yannakakis and C. H. Papadimitriou and H. T. Kung", title = "Locking policies: Safety and freedom from deadlock", booktitle = "Proc.\ 20th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1979", pages = "286--297", } @InProceedings{PauRei79, author = "W. J. Paul and R. Reischuk", title = "On time versus space {II}", booktitle = "Proc.\ 20th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1979", pages = "298--306", } @InProceedings{Pippenger79, author = "N. Pippenger", title = "On simultaneous resource bounds", booktitle = "Proc.\ 20th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1979", pages = "307--311", } @InProceedings{Ruzzo79, author = "W. L. Ruzzo", title = "On uniform circuit complexity", booktitle = "Proc.\ 20th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1979", pages = "312--318", } @InProceedings{BorodinEtAl79, author = "A. Borodin and M. J. Fischer and D. G. Kirkpatrick and N. A. Lynch and M. Tompa", title = "A time-space tradeoff for sorting on non-oblivious machines", booktitle = "Proc.\ 20th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1979", pages = "319--327", } @InProceedings{SchSha79, author = "R. Schroeppel and A. Shamir", title = "A $ {T} \cdot {S}^2 = {O}(2^n ) $ time/space tradeoff for certain {NP}-complete problems", booktitle = "Proc.\ 20th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1979", pages = "328--336", } @InProceedings{Immerman79, author = "N. Immerman", title = "Length of predicate calculus formulas as a new complexity measure", booktitle = "Proc.\ 20th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1979", pages = "337--347", } @InProceedings{PetRei79, author = "G. L. Peterson and J. H. Reif", title = "Multiple-person alternation", booktitle = "Proc.\ 20th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1979", pages = "348--363", } @InProceedings{GabGal79, author = "O. Gabber and Z. Galil", title = "Explicit constructions of linear size superconcentrators", booktitle = "Proc.\ 20th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1979", pages = "364--370", } @InProceedings{Kleene79, author = "S. C. Kleene", title = "Origins of recursive function theory", booktitle = "Proc.\ 20th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1979", pages = "371--382", } @InProceedings{Brassard79, author = "G. Brassard", title = "Relativized cryptography", booktitle = "Proc.\ 20th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1979", pages = "383--391", } @InProceedings{BakHar79, author = "T. P. Baker and J. Hartmanis", title = "Succinctness, verifiability and determinism in representations of polynomial-time languages", booktitle = "Proc.\ 20th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1979", pages = "392--396", } @InProceedings{AdlMan79, author = "L. M. Adleman and K. Manders", title = "Reductions that lie", booktitle = "Proc.\ 20th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1979", pages = "397--410", } @InProceedings{Simon79, author = "J. Simon", title = "Division is good", booktitle = "Proc.\ 20th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1979", pages = "411--420", } @InProceedings{Reif79, author = "J. H. Reif", title = "Complexity of the mover's problem and generalizations", booktitle = "Proc.\ 20th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1979", pages = "421--427", } @InProceedings{MeyPar80, author = "A. R. Meyer and R. Parikh", title = "Definability in dynamic logic", booktitle = "Proc.\ 12th ACM Symposium on Theory of Computing (STOC)", year = "1980", pages = "1--7", } @InProceedings{Reif80, author = "J. H. Reif", title = "Logics for probabilistic programming", booktitle = "Proc.\ 12th ACM Symposium on Theory of Computing (STOC)", year = "1980", pages = "8--13", } @InProceedings{Mirkowska80, author = "G. Mirkowska", title = "Complete axiomatization of algorithmic properties of program schemes with bounded nondeterministic interpretations", booktitle = "Proc.\ 12th ACM Symposium on Theory of Computing (STOC)", year = "1980", pages = "14--21", } @InProceedings{Pratt80, author = "V. R. Pratt", title = "Dynamic algebras and the nature of induction", booktitle = "Proc.\ 12th ACM Symposium on Theory of Computing (STOC)", year = "1980", pages = "22--28", } @InProceedings{Ukkonen80, author = "E. Ukkonen", title = "A decision method for the equivalence of some non-real-time deterministic pushdown automata", booktitle = "Proc.\ 12th ACM Symposium on Theory of Computing (STOC)", year = "1980", pages = "29--38", } @InProceedings{Plaisted80, author = "D. A. Plaisted", title = "On the distribution of independent formulae of number theory", booktitle = "Proc.\ 12th ACM Symposium on Theory of Computing (STOC)", year = "1980", pages = "39--44", } @InProceedings{DeMLip80, author = "R. A. DeMillo and R. J. Lipton", title = "The consistency of `{P} = {NP}' and related problems with fragments of number theory", booktitle = "Proc.\ 12th ACM Symposium on Theory of Computing (STOC)", year = "1980", pages = "45--57", } @InProceedings{JosYou80, author = "D. Joseph and P. Young", title = "Independence results in computer science?", booktitle = "Proc.\ 12th ACM Symposium on Theory of Computing (STOC)", year = "1980", pages = "58--69", } @InProceedings{Lynch80, author = "N. A. Lynch", title = "Fast allocation of nearby resources in a distributed system", booktitle = "Proc.\ 12th ACM Symposium on Theory of Computing (STOC)", year = "1980", pages = "70--81", } @InProceedings{Angluin80, author = "D. Angluin", title = "Local and global properties in networks of processors", booktitle = "Proc.\ 12th ACM Symposium on Theory of Computing (STOC)", year = "1980", pages = "82--93", } @InProceedings{Toueg80, author = "S. Toueg", title = "Deadlock- and livelock-free packet switching networks", booktitle = "Proc.\ 12th ACM Symposium on Theory of Computing (STOC)", year = "1980", pages = "94--99", } @InProceedings{Brown80, author = "D. J. Brown", title = "Kraft storage and access for list implementations", booktitle = "Proc.\ 12th ACM Symposium on Theory of Computing (STOC)", year = "1980", pages = "100--107", } @InProceedings{Strong80, author = "H. R. Strong", title = "Vector execution of flow graphs", booktitle = "Proc.\ 12th ACM Symposium on Theory of Computing (STOC)", year = "1980", pages = "108--116", } @InProceedings{SadUll80, author = "F. Sadri and J. D. Ullman", title = "A complete axiomatization for a large class of dependencies in relational databases", booktitle = "Proc.\ 12th ACM Symposium on Theory of Computing (STOC)", year = "1980", pages = "117--122", } @InProceedings{Fagin80, author = "R. Fagin", title = "Horn clauses and database dependencies", booktitle = "Proc.\ 12th ACM Symposium on Theory of Computing (STOC)", year = "1980", pages = "123--134", } @InProceedings{OveVan80, author = "M. H. Overmars and J. VanLeeuwen", title = "Dynamically maintaining configurations in the plane", booktitle = "Proc.\ 12th ACM Symposium on Theory of Computing (STOC)", year = "1980", pages = "135--145", } @InProceedings{ChaDob80, author = "B. Chazelle and D. P. Dobkin", title = "Detection is easier than computation", booktitle = "Proc.\ 12th ACM Symposium on Theory of Computing (STOC)", year = "1980", pages = "146--153", } @InProceedings{GuiYao80, author = "L. J. Guibas and F. F. Yao", title = "On translating a set of rectangles", booktitle = "Proc.\ 12th ACM Symposium on Theory of Computing (STOC)", year = "1980", pages = "154--160", } @InProceedings{Tompa80, author = "M. Tompa", title = "An optimal solution to a wire-routing problem", booktitle = "Proc.\ 12th ACM Symposium on Theory of Computing (STOC)", year = "1980", pages = "161--176", } @InProceedings{FisPat80, author = "M. J. Fischer and M. S. Paterson", title = "Optimal tree layout", booktitle = "Proc.\ 12th ACM Symposium on Theory of Computing (STOC)", year = "1980", pages = "177--189", } @InProceedings{BreKun80, author = "R. P. Brent and H. T. Kung", title = "The chip complexity of binary arithmetic", booktitle = "Proc.\ 12th ACM Symposium on Theory of Computing (STOC)", year = "1980", pages = "190--200", } @InProceedings{Storer80, author = "J. A. Storer", title = "The node cost measure for embedding graphs on the planar grid", booktitle = "Proc.\ 12th ACM Symposium on Theory of Computing (STOC)", year = "1980", pages = "201--210", } @InProceedings{Cypher80, author = "A. Cypher", title = "An approach to the {K} paths problem", booktitle = "Proc.\ 12th ACM Symposium on Theory of Computing (STOC)", year = "1980", pages = "211--217", } @InProceedings{Lichtenstein80, author = "D. Lichtenstein", title = "Isomorphism for graphs embeddable on the projective plane", booktitle = "Proc.\ 12th ACM Symposium on Theory of Computing (STOC)", year = "1980", pages = "218--224", } @InProceedings{Miller80, author = "G. Miller", title = "Isomorphism testing for graphs of bounded genus", booktitle = "Proc.\ 12th ACM Symposium on Theory of Computing (STOC)", year = "1980", pages = "225--235", } @InProceedings{FilMay80, author = "I. S. Filotti and J. N. Mayer", title = "A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus", booktitle = "Proc.\ 12th ACM Symposium on Theory of Computing (STOC)", year = "1980", pages = "236--243", } @InProceedings{Hoffmann80, author = "C. M. Hoffmann", title = "Testing isomorphism on cone graphs", booktitle = "Proc.\ 12th ACM Symposium on Theory of Computing (STOC)", year = "1980", pages = "244--251", } @InProceedings{KanLip80, author = "R. Kannan and R. J. Lipton", title = "The orbit problem is decidable", booktitle = "Proc.\ 12th ACM Symposium on Theory of Computing (STOC)", year = "1980", pages = "252--261", } @InProceedings{HeiSch80, author = "J. Heintz and C. P. Schnorr", title = "Testing polynomials which are easy to compute", booktitle = "Proc.\ 12th ACM Symposium on Theory of Computing (STOC)", year = "1980", pages = "262--272", } @InProceedings{IbaLei80, author = "O. H. Ibarra and B. S. Leininger", title = "The complexity of the equivalence problem for straight-line programs", booktitle = "Proc.\ 12th ACM Symposium on Theory of Computing (STOC)", year = "1980", pages = "273--280", } @InProceedings{EhrMah80, author = "H. Ehrig and B. Mahr", title = "Complexity of implementations on the level of algebraic specifications", booktitle = "Proc.\ 12th ACM Symposium on Theory of Computing (STOC)", year = "1980", pages = "281--293", } @InProceedings{BorCoo80, author = "A. Borodin and S. Cook", title = "A time-space tradeoff for sorting on a general sequential model of computation", booktitle = "Proc.\ 12th ACM Symposium on Theory of Computing (STOC)", year = "1980", pages = "294--301", } @InProceedings{KarLip80, author = "R. M. Karp and R. J. Lipton", title = "Some connections between nonuniform and uniform complexity classes", booktitle = "Proc.\ 12th ACM Symposium on Theory of Computing (STOC)", year = "1980", pages = "302--309", } @InProceedings{Hong80, author = "J. -W. Hong", title = "On some deterministic space complexity problems", booktitle = "Proc.\ 12th ACM Symposium on Theory of Computing (STOC)", year = "1980", pages = "310--317", } @InProceedings{Yap80, author = "C. K. Yap", title = "Space-time tradeoffs and first order problems in a model of programs", booktitle = "Proc.\ 12th ACM Symposium on Theory of Computing (STOC)", year = "1980", pages = "318--325", } @InProceedings{CarSav80, author = "D. A. Carlson and J. E. Savage", title = "Graph pebbling with many free pebbles can be difficult", booktitle = "Proc.\ 12th ACM Symposium on Theory of Computing (STOC)", year = "1980", pages = "326--332", } @InProceedings{Tompa80, author = "M. Tompa", title = "Two familiar transitive closure algorithms which admit no polynomial time, sublinear space implementations", booktitle = "Proc.\ 12th ACM Symposium on Theory of Computing (STOC)", year = "1980", pages = "333--338", } @InProceedings{Ja'Ja'80, author = "J. Ja'Ja'", title = "Time-space tradeoffs for some algebraic problems", booktitle = "Proc.\ 12th ACM Symposium on Theory of Computing (STOC)", year = "1980", pages = "339--350", } @InProceedings{Pippenger80, author = "N. Pippenger", title = "Comparative schematology and pebbling with auxiliary pushdowns", booktitle = "Proc.\ 12th ACM Symposium on Theory of Computing (STOC)", year = "1980", pages = "351--356", } @InProceedings{PauSeiSim80, author = "W. J. Paul and J. I. Seiferas and J. Simon", title = "An information-theoretic approach to time bounds for on-line computation", booktitle = "Proc.\ 12th ACM Symposium on Theory of Computing (STOC)", year = "1980", pages = "357--367", } @InProceedings{KarTar80, author = "R. M. Karp and R. E. Tarjan", title = "Linear expected-time algorithms for connectivity problems", booktitle = "Proc.\ 12th ACM Symposium on Theory of Computing (STOC)", year = "1980", pages = "368--377", } @InProceedings{Bloniarz80, author = "P. Bloniarz", title = "A shortest-path algorithm with expected time $ {O}(n^2 \log n\log^* n) $", booktitle = "Proc.\ 12th ACM Symposium on Theory of Computing (STOC)", year = "1980", pages = "378--384", } @InProceedings{ReiSpi80, author = "J. H. Reif and P. G. Spirakis", title = "Random matroids", booktitle = "Proc.\ 12th ACM Symposium on Theory of Computing (STOC)", year = "1980", pages = "385--397", } @InProceedings{SupPlaRei80, author = "K. J. Supowit and D. A. Plaisted and E. M. Reingold", title = "Heuristics for weighted perfect matching", booktitle = "Proc.\ 12th ACM Symposium on Theory of Computing (STOC)", year = "1980", pages = "398--419", } @InProceedings{FreJoh80, author = "G. N. Frederickson and D. B. Johnson", title = "Generalized selection and ranking", booktitle = "Proc.\ 12th ACM Symposium on Theory of Computing (STOC)", year = "1980", pages = "420--428", } @InProceedings{Yao80, author = "F. F. Yao", title = "Efficient dynamic programming using quadrangle inequalities", booktitle = "Proc.\ 12th ACM Symposium on Theory of Computing (STOC)", year = "1980", pages = "429--435", } @InProceedings{Lloyd80, author = "E. L. Lloyd", title = "Critical path scheduling of task systems with resource and processor constraints", booktitle = "Proc.\ 12th ACM Symposium on Theory of Computing (STOC)", year = "1980", pages = "436--446", } @InProceedings{KarPap80, author = "R. M. Karp and C. H. Papadimitriou", title = "On linear characterizations of combinatorial optimization problems", booktitle = "Proc.\ 21th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1980", pages = "1--9", } @InProceedings{Yannakakis80, author = "M. Yannakakis", title = "On a class of totally unimodular matrices", booktitle = "Proc.\ 21th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1980", pages = "10--16", } @InProceedings{MicVaz80, author = "S. Micali and V. V. Vazirani", title = "An $ {O}( \sqrt{ |v|} \cdot |{E}|) $ algorithm for finding maximum matching in general graphs", booktitle = "Proc.\ 21th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1980", pages = "17--27", } @InProceedings{HuShi80, author = "T. C. Hu and M. T. Shing", title = "Some theorems about matrix multiplication", booktitle = "Proc.\ 21th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1980", pages = "28--35", } @InProceedings{FurHopLuk80, author = "M. Furst and J. Hopcroft and E. Luks", title = "Polynomial-time algorithms for permutation groups", booktitle = "Proc.\ 21th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1980", pages = "36--41", } @InProceedings{Luks80, author = "E. M. Luks", title = "Isomorphism of graphs of bounded valence can be tested in polynomial time", booktitle = "Proc.\ 21th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1980", pages = "42--49", } @InProceedings{Simons80, author = "B. Simons", title = "A fast algorithm for multiprocessor scheduling", booktitle = "Proc.\ 21th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1980", pages = "50--53", } @InProceedings{Mahaney80, author = "S. R. Mahaney", title = "Sparse complete sets for {NP}: Solution of a conjecture of Berman and Hartmanis", booktitle = "Proc.\ 21th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1980", pages = "54--60", } @InProceedings{Sudborough80, author = "I. H. Sudborough", title = "Efficient algorithms for path system problems and applications to alternating and time-space complexity classes", booktitle = "Proc.\ 21th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1980", pages = "62--73", } @InProceedings{Immerman80, author = "N. Immerman", title = "Upper and lower bounds for first order expressibility", booktitle = "Proc.\ 21th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1980", pages = "74--82", } @InProceedings{Gurari80, author = "E. M. Gurari", title = "The equivalence problem for deterministic two-way sequential transducers is decidable", booktitle = "Proc.\ 21th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1980", pages = "83--85", } @InProceedings{Peterson80, author = "G. L. Peterson", title = "Succinct representation, random strings, and complexity classes", booktitle = "Proc.\ 21th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1980", pages = "86--95", } @InProceedings{HueHul80, author = "G. Huet and J. -M. Hullot", title = "Proofs by induction in equational theories with constructors", booktitle = "Proc.\ 21th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1980", pages = "96--107", } @InProceedings{Chew80, author = "P. Chew", title = "An improved algorithm for computing with equations", booktitle = "Proc.\ 21th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1980", pages = "108--117", } @InProceedings{Constable80, author = "R. L. Constable", title = "Programs and types", booktitle = "Proc.\ 21th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1980", pages = "118--128", } @InProceedings{HarKozPar80, author = "D. Harel and D. Kozen and R. Parikh", title = "Process logic: Expressiveness, decidability, completeness", booktitle = "Proc.\ 21th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1980", pages = "129--142", } @InProceedings{FraLehPnu80, author = "N. Francez and D. Lehmann and A. Pnueli", title = "A linear history semantics for distributed languages", booktitle = "Proc.\ 21th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1980", pages = "143--151", } @InProceedings{HunRos80, author = "III H. B. Hunt and D. J. Rosenkrantz", title = "The complexity of recursion schemes and recursive programming languages", booktitle = "Proc.\ 21th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1980", pages = "152--160", } @InProceedings{CouFra80, author = "B. Courcelle and P. Franchi-Zannettacci", title = "On the expressive power of attributed grammars", booktitle = "Proc.\ 21th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1980", pages = "161--172", } @InProceedings{80, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{JonMuc80, author = "N. D. Jones and S. S. Muchnick", title = "Complexity of flow analysis, inductive assertion synthesis and a language due to Dijkstra", booktitle = "Proc.\ 21th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1980", pages = "185--190", } @InProceedings{Fredman80, author = "M. L. Fredman", title = "The inherent complexity of dynamic data structures which accommodate range queries", booktitle = "Proc.\ 21th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1980", pages = "191--199", } @InProceedings{DobMun80, author = "D. P. Dobkin and J. I. Munro", title = "Efficient uses of the past", booktitle = "Proc.\ 21th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1980", pages = "200--206", } @InProceedings{FlaOdl80, author = "P. Flajolet and A. Odlyzko", title = "Exploring binary trees and other simple trees", booktitle = "Proc.\ 21th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1980", pages = "207--216", } @InProceedings{BenBro80, author = "J. L. Bentley and D. J. Brown", title = "A general class of resource tradeoffs", booktitle = "Proc.\ 21th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1980", pages = "217--228", } @InProceedings{Doberkat80, author = "E. -E. Doberkat", title = "Some observations on the average behavior of heapsort", booktitle = "Proc.\ 21th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1980", pages = "229--237", } @InProceedings{Vitter80, author = "J. S. Vitter", title = "Tuning the coalesced hashing method to obtain optimum performance", booktitle = "Proc.\ 21th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1980", pages = "238--247", } @InProceedings{BenSleTar80, author = "S. W. Bent and D. D. Sleator and R. E. Tarjan", title = "Biased 2-3 trees", booktitle = "Proc.\ 21th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1980", pages = "248--254", } @InProceedings{Frederickson80, author = "G. N. Frederickson", title = "Implicit data structures with fast update", booktitle = "Proc.\ 21th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1980", pages = "255--259", } @InProceedings{FloUll80, author = "R. W. Floyd and J. D. Ullman", title = "The compilation of regular expressions into integrated circuits", booktitle = "Proc.\ 21th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1980", pages = "260--269", } @InProceedings{Leiserson80, author = "C. E. Leiserson", title = "Area-efficient graph layouts (for {VLSI})", booktitle = "Proc.\ 21th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1980", pages = "270--281", } @InProceedings{Lapaugh80, author = "A. S. Lapaugh", title = "A polynomial time algorithm for optimal routing around a rectangle", booktitle = "Proc.\ 21th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1980", pages = "282--293", } @InProceedings{Vuillemin80, author = "J. Vuillemin", title = "A combinatorial limit to the computing power of {V}.{L}.{S}.{I}. circuits", booktitle = "Proc.\ 21th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1980", pages = "294--300", } @InProceedings{Yao80, author = "F. F. Yao", title = "On the priority approach to hidden-surface algorithms", booktitle = "Proc.\ 21th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1980", pages = "301--307", } @InProceedings{Harel80, author = "D. Harel", title = "A linear time algorithm for the lowest common ancestor problem", booktitle = "Proc.\ 21th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1980", pages = "308--319", } @InProceedings{Wegman80, author = "M. Wegman", title = "Parsing for structural editors", booktitle = "Proc.\ 21th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1980", pages = "320--327", } @InProceedings{YanPap80, author = "M. Yannakakis and C. H. Papadimitriou", title = "Algebraic dependencies", booktitle = "Proc.\ 21th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1980", pages = "328--332", } @InProceedings{ChaHar80, author = "A. K. Chandra and D. Harel", title = "Structure and complexity of relational queries", booktitle = "Proc.\ 21th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1980", pages = "333--347", } @InProceedings{Hong80, author = "J. -W. Hong", title = "On similarity and duality of computation", booktitle = "Proc.\ 21th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1980", pages = "348--359", } @InProceedings{DymCoo80, author = "P. W. Dymond and S. A. Cook", title = "Hardware complexity and parallel computation", booktitle = "Proc.\ 21th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1980", pages = "360--372", } @InProceedings{FraRod80, author = "N. Francez and M. Rodeh", title = "A distributed abstract data type implemented by a probabilistic communication scheme", booktitle = "Proc.\ 21th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1980", pages = "373--379", } @InProceedings{Brassard80, author = "G. Brassard", title = "A time-luck tradeoff in cryptography", booktitle = "Proc.\ 21th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1980", pages = "380--386", } @InProceedings{Adleman80, author = "L. M. Adleman", title = "On distinguishing prime numbers from composite numbers", booktitle = "Proc.\ 21th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1980", pages = "387--406", } @InProceedings{Rabin80, author = "M. O. Rabin", title = "${N}$-process synchronization by $ 4 \cdot \log_2 {N}$-valued shared variables", booktitle = "Proc.\ 21th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1980", pages = "407--410", } @InProceedings{VonVer80, author = "R. VonBraunmuhl and R. Verbeek", title = "A recognition algorithm for deterministic {CFL}s optimal in time and space", booktitle = "Proc.\ 21th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1980", pages = "411--420", } @InProceedings{CulHar81, author = "II K. Culik and T. Harju", title = "The $ \omega $-sequence equivalence problem for {DOL} systems is decidable", booktitle = "Proc.\ 13th ACM Symposium on Theory of Computing (STOC)", year = "1981", pages = "1--6", } @InProceedings{Chew81, author = "P. Chew", title = "Unique normal forms in term rewriting systems with repeated variables", booktitle = "Proc.\ 13th ACM Symposium on Theory of Computing (STOC)", year = "1981", pages = "7--18", } @InProceedings{HawVenYas81, author = "F. Hawrusik and K. N. Venkataraman and A. Yasuhara", title = "Classes of functions for computing on binary trees", booktitle = "Proc.\ 13th ACM Symposium on Theory of Computing (STOC)", year = "1981", pages = "19--27", } @InProceedings{KriMol81, author = "B. Krishnamurthy and R. N. Moll", title = "Examples of hard tautologies in the propositional calculus", booktitle = "Proc.\ 13th ACM Symposium on Theory of Computing (STOC)", year = "1981", pages = "28--37", } @InProceedings{Leivant81, author = "D. Leivant", title = "The complexity of parameter passing in polymorphic procedures", booktitle = "Proc.\ 13th ACM Symposium on Theory of Computing (STOC)", year = "1981", pages = "38--45", } @InProceedings{MulSch81, author = "D. E. Muller and P. E. Schupp", title = "Pushdown automata, graphs, ends, second-order logic, and reachability problems", booktitle = "Proc.\ 13th ACM Symposium on Theory of Computing (STOC)", year = "1981", pages = "46--54", } @InProceedings{JosYou81, author = "D. Joseph and P. Young", title = "Fast programs for initial segments and polynomial time computation in weak models of arithmetic", booktitle = "Proc.\ 13th ACM Symposium on Theory of Computing (STOC)", year = "1981", pages = "55--61", } @InProceedings{Kosaraju81, author = "S. R. Kosaraju", title = "Localized search in sorted lists", booktitle = "Proc.\ 13th ACM Symposium on Theory of Computing (STOC)", year = "1981", pages = "62--69", } @InProceedings{Chazelle81, author = "B. M. Chazelle", title = "Convex decompositions of polyhedra", booktitle = "Proc.\ 13th ACM Symposium on Theory of Computing (STOC)", year = "1981", pages = "70--79", } @InProceedings{KimRos81, author = "C. E. Kim and A. Rosenfeld", title = "Digital straightness and convexity", booktitle = "Proc.\ 13th ACM Symposium on Theory of Computing (STOC)", year = "1981", pages = "80--89", } @InProceedings{81, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{Fich81, author = "F. E. Fich", title = "Lower bounds for the cycle detection problem", booktitle = "Proc.\ 13th ACM Symposium on Theory of Computing (STOC)", year = "1981", pages = "96--105", } @InProceedings{GalSei81, author = "Z. Galil and J. Seiferas", title = "Time-space-optimal string matching", booktitle = "Proc.\ 13th ACM Symposium on Theory of Computing (STOC)", year = "1981", pages = "106--113", } @InProceedings{SleTar81, author = "D. D. Sleator and R. E. Tarjan", title = "A data structure for dynamic trees", booktitle = "Proc.\ 13th ACM Symposium on Theory of Computing (STOC)", year = "1981", pages = "114--122", } @InProceedings{Yao81, author = "A. C. -C. Yao", title = "On the parallel computation for the knapsack problem", booktitle = "Proc.\ 13th ACM Symposium on Theory of Computing (STOC)", year = "1981", pages = "123--127", } @InProceedings{ArjFisLyn81, author = "E. Arjomandi and M. J. Fischer and N. A. Lynch", title = "A difference in efficiency between synchronous and asynchronous systems", booktitle = "Proc.\ 13th ACM Symposium on Theory of Computing (STOC)", year = "1981", pages = "128--132", } @InProceedings{ReiSpi81, author = "J. Reif and P. Spirakis", title = "Distributed algorithms for synchronizing interprocess communication within real time", booktitle = "Proc.\ 13th ACM Symposium on Theory of Computing (STOC)", year = "1981", pages = "133--145", } @InProceedings{Chan81, author = "T. -H. Chan", title = "Reversal complexity of counter machines", booktitle = "Proc.\ 13th ACM Symposium on Theory of Computing (STOC)", year = "1981", pages = "146--157", } @InProceedings{Simon81, author = "J. Simon", title = "Space-bounded probabilistic Turing machine complexity classes are closed under complement", booktitle = "Proc.\ 13th ACM Symposium on Theory of Computing (STOC)", year = "1981", pages = "158--167", } @InProceedings{BerMauSab81, author = "A. Bertoni and G. Mauri and N. Sabadini", title = "A characterization of the class of functions computable in polynomial time on random access machines", booktitle = "Proc.\ 13th ACM Symposium on Theory of Computing (STOC)", year = "1981", pages = "168--176", } @InProceedings{DurGal81, author = "P. Duris and Z. Galil", title = "Fooling a two-way automaton or one pushdown store is better than one counter for two way machines", booktitle = "Proc.\ 13th ACM Symposium on Theory of Computing (STOC)", year = "1981", pages = "177--188", } @InProceedings{King81, author = "K. N. King", title = "Measures of parallelism in alternating computation trees", booktitle = "Proc.\ 13th ACM Symposium on Theory of Computing (STOC)", year = "1981", pages = "189--201", } @InProceedings{UkkSoi81, author = "E. Ukkonen and E. Soisalon-Soininen", title = "{LALR}(k) testing is {PSPACE}-complete", booktitle = "Proc.\ 13th ACM Symposium on Theory of Computing (STOC)", year = "1981", pages = "202--206", } @InProceedings{MonSud81, author = "B. Monien and I. H. Sudborough", title = "Bandwidth constrained {NP}-complete problems", booktitle = "Proc.\ 13th ACM Symposium on Theory of Computing (STOC)", year = "1981", pages = "207--217", } @InProceedings{Orlin81, author = "J. B. Orlin", title = "The complexity of dynamic languages and dynamic optimization problems", booktitle = "Proc.\ 13th ACM Symposium on Theory of Computing (STOC)", year = "1981", pages = "218--227", } @InProceedings{AdaIwaKas81, author = "A. Adachi and S. Iwata and T. Kasai", title = "Low level complexity for combinatorial games", booktitle = "Proc.\ 13th ACM Symposium on Theory of Computing (STOC)", year = "1981", pages = "228--237", } @InProceedings{Mayr81, author = "E. W. Mayr", title = "An algorithm for the general Petri net reachability problem", booktitle = "Proc.\ 13th ACM Symposium on Theory of Computing (STOC)", year = "1981", pages = "238--246", } @InProceedings{GalPau81, author = "Z. Galil and W. J. Paul", title = "An efficient general purpose parallel computer", booktitle = "Proc.\ 13th ACM Symposium on Theory of Computing (STOC)", year = "1981", pages = "247--262", } @InProceedings{ValBre81, author = "L. G. Valiant and G. J. Brebner", title = "Universal schemes for parallel communication", booktitle = "Proc.\ 13th ACM Symposium on Theory of Computing (STOC)", year = "1981", pages = "263--277", } @InProceedings{KleitmanEtAl81, author = "D. Kleitman and F. T. Leighton and M. Lepley and G. L. Miller", title = "New layouts for the shuffle-exchange graph", booktitle = "Proc.\ 13th ACM Symposium on Theory of Computing (STOC)", year = "1981", pages = "278--292", } @InProceedings{PatRuzSny81, author = "M. S. Paterson and W. L. Ruzzo and L. Snyder", title = "Bounds on minimax edge length for complete binary trees", booktitle = "Proc.\ 13th ACM Symposium on Theory of Computing (STOC)", year = "1981", pages = "293--299", } @InProceedings{LipSed81, author = "R. J. Lipton and R. Sedgewick", title = "Lower bounds for {VLSI}", booktitle = "Proc.\ 13th ACM Symposium on Theory of Computing (STOC)", year = "1981", pages = "300--307", } @InProceedings{Yao81, author = "A. C. Yao", title = "The entropic limitations on {VLSI} computations", booktitle = "Proc.\ 13th ACM Symposium on Theory of Computing (STOC)", year = "1981", pages = "308--311", } @InProceedings{DolevEtAl81, author = "D. Dolev and K. Karplus and A. Siegel and A. Strong and J. D. Ullman", title = "Optimal wiring between rectangles", booktitle = "Proc.\ 13th ACM Symposium on Theory of Computing (STOC)", year = "1981", pages = "312--317", } @InProceedings{ChaMon81, author = "B. Chazelle and L. Monier", title = "A model of computation for {VLSI} with related complexity results", booktitle = "Proc.\ 13th ACM Symposium on Theory of Computing (STOC)", year = "1981", pages = "318--325", } @InProceedings{HonKun81, author = "J. -W. Hong and H. T. Kung", title = "{I}/{O} complexity: The red-blue pebble game", booktitle = "Proc.\ 13th ACM Symposium on Theory of Computing (STOC)", year = "1981", pages = "326--333", } @InProceedings{HonRos81, author = "J. -W. Hong and A. L. Rosenberg", title = "Graphs that are almost binary trees", booktitle = "Proc.\ 13th ACM Symposium on Theory of Computing (STOC)", year = "1981", pages = "334--341", } @InProceedings{ChaLewMak81, author = "A. K. Chandra and H. R. Lewis and J. A. Makowsky", title = "Embedded implicational dependencies and their inference problem", booktitle = "Proc.\ 13th ACM Symposium on Theory of Computing (STOC)", year = "1981", pages = "342--354", } @InProceedings{BeeriEtAl81, author = "C. Beeri and R. Fagin and D. Maier and A. Mendelzon and J. D. Ullman and M. Yannakakis", title = "Properties of acyclic database schemes", booktitle = "Proc.\ 13th ACM Symposium on Theory of Computing (STOC)", year = "1981", pages = "355--362", } @InProceedings{Yannakakis81, author = "M. Yannakakis", title = "Issues of correctness in database concurrency control by locking", booktitle = "Proc.\ 13th ACM Symposium on Theory of Computing (STOC)", year = "1981", pages = "363--367", } @InProceedings{Parisi-Presicce81, author = "F. Parisi-Presicce", title = "On the faithful regular extensions of iterative algebras", booktitle = "Proc.\ 13th ACM Symposium on Theory of Computing (STOC)", year = "1981", pages = "368--374", } @InProceedings{Streett81, author = "R. B. Streett", title = "Propositional dynamic logic of looping and converse", booktitle = "Proc.\ 13th ACM Symposium on Theory of Computing (STOC)", year = "1981", pages = "375--383", } @InProceedings{ChandraEtAl81, author = "A. Chandra and J. Halpern and A. Meyer and R. Parikh", title = "Equations between regular terms and an application to process logic", booktitle = "Proc.\ 13th ACM Symposium on Theory of Computing (STOC)", year = "1981", pages = "384--390", } @InProceedings{Leighton81, author = "F. T. Leighton", title = "New lower bound techniques for {VLSI}", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "1--12", } @InProceedings{LipVal81, author = "R. J. Lipton and J. Valdes", title = "Census functions: An approach to {VLSI} upper bounds", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "13--22", } @InProceedings{LeiSax81, author = "C. E. Leiserson and J. B. Saxe", title = "Optimizing synchronous systems", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "23--36", } @InProceedings{KedZor81, author = "Z. M. Kedem and A. Zorat", title = "On relations between input and communication/Computation in {VLSI}", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "37--44", } @InProceedings{GurIba81, author = "E. M. Gurari and O. H. Ibarra", title = "Two-way counter machines and Diophantine equations", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "45--52", } @InProceedings{DurGal81, author = "P. Duris and Z. Galil", title = "A time-space tradeoff for language recognition", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "53--57", } @InProceedings{Loui81, author = "M. C. Loui", title = "Simulations among multidimensional Turing machines", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "58--67", } @InProceedings{Paul81, author = "W. Paul", title = "On heads versus tapes", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "68--73", } @InProceedings{SteHun81, author = "R. E. Stearns and III H. B. Hunt", title = "On the equivalence and containment problems for unambiguous regular expressions, grammars, and automata", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "74--81", } @InProceedings{CopWin81, author = "D. Coppersmith and S. Winograd", title = "On the asymptotic complexity of matrix multiplication", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "82--90", } @InProceedings{FeiWin81, author = "E. Feig and S. Winograd", title = "On the direct sum conjecture", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "91--94", } @InProceedings{Ja'Ja'81, author = "J. Ja'Ja'", title = "Computation of algebraic functions with root extractions", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "95--100", } @InProceedings{Blum81, author = "N. Blum", title = "An $ \Omega ({N}^{4/3} ) $ lower bound on the monotone network complexity of {N}-{TH} degree convolution", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "101--108", } @InProceedings{Klawe81, author = "M. Klawe", title = "Non-existence of one-dimensional expanding graphs", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "109--114", } @InProceedings{Post81, author = "M. J. Post", title = "A minimum spanning ellipse algorithm", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "115--122", } @InProceedings{AviSha81, author = "Z. Aviad and E. Shamir", title = "A direct dynamic solution to range search and related problems for product regions", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "123--126", } @InProceedings{Vitter81, author = "J. S. Vitter", title = "Deletion algorithms for hashing that preserve randomness", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "127--132", } @InProceedings{Frederickson81, author = "G. N. Frederickson", title = "Implicit data structures for the weighted dictionary problem", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "133--139", } @InProceedings{RouBro81, author = "W. C. Rounds and S. D. Brookes", title = "Possible futures, acceptances, refusals, and communication processes", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "140--149", } @InProceedings{ItaRod81, author = "A. Itai and M. Rodeh", title = "Symmetry breaking in distributive networks", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "150--158", } @InProceedings{Dolev81, author = "D. Dolev", title = "Unanimity in an unknown and unreliable environment", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "159--168", } @InProceedings{Burns81, author = "J. E. Burns", title = "Symmetry in systems of asynchronous processes", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "169--174", } @InProceedings{Sethi81, author = "R. Sethi", title = "A model of concurrent database transactions", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "175--184", } @InProceedings{KanPap81, author = "P. C. Kanellakis and C. H. Papadimitriou", title = "The complexity of distributed concurrency control", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "185--197", } @InProceedings{Vardi81, author = "M. Y. Vardi", title = "Global decision problems for relational databases", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "198--202", } @InProceedings{JohKlu81, author = "D. S. Johnson and A. Klug", title = "Optimizing conjunctive queries when attribute domains are not disjoint", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "203--211", } @InProceedings{Reischuk81, author = "R. Reischuk", title = "A fast probabilistic parallel sorting algorithm", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "212--219", } @InProceedings{ManTom81, author = "U. Manber and M. Tompa", title = "The effect of number of Hamiltonian paths on the complexity of a vertex-coloring problem", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "220--227", } @InProceedings{Verbeek81, author = "R. Verbeek", title = "Time-space trade-offs for general recursion", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "228--234", } @InProceedings{Kannan81, author = "R. Kannan", title = "Towards separating nondeterministic time from deterministic time", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "235--243", } @InProceedings{SkyVal81, author = "S. Skyum and L. G. Valiant", title = "A complexity theory based on Boolean algebra", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "244--253", } @InProceedings{BooWilXu81, author = "R. V. Book and C. B. Wilson and M. -R. Xu", title = "Relativizing time and space", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "254--259", } @InProceedings{FurSaxSip81, author = "M. Furst and J. B. Saxe and M. Sipser", title = "Parity, circuits, and the polynomial-time hierarchy", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "260--270", } @InProceedings{Mahaney81, author = "S. R. Mahaney", title = "On the number of {P}-isomorphism classes of {NP}-complete sets", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "271--278", } @InProceedings{Statman81, author = "R. Statman", title = "Number theoretic functions computable by polymorphic programs", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "279--282", } @InProceedings{Smith81, author = "C. H. Smith", title = "The power of parallelism for automatic program synthesis", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "283--295", } @InProceedings{Gacs81, author = "P. Gacs", title = "On the relation between descriptional complexity and algorithmic probability", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "296--303", } @InProceedings{Kannan81, author = "R. Kannan", title = "A circuit-size lower bound", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "304--309", } @InProceedings{HarPnuSta81, author = "D. Harel and A. Pnueli and J. Stavi", title = "Propositional dynamic logic of context-free programs", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "310--321", } @InProceedings{HalRei81, author = "J. Y. Halpern and J. H. Reif", title = "The propositional dynamic logic of deterministic, well-structured programs", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "322--334", } @InProceedings{Tiuryn81, author = "J. Tiuryn", title = "Unbounded program memory adds to the expressive power of first-order dynamic logic", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "335--339", } @InProceedings{Wolper81, author = "P. Wolper", title = "Temporal logic can be more expressive", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "340--348", } @InProceedings{DolYao81, author = "D. Dolev and A. C. Yao", title = "On the security of public key protocols", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "350--357", } @InProceedings{PapYan81, author = "C. H. Papadimitriou and M. Yannakakis", title = "Worst-case ratios for planar graphs and the method of induction on faces", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "358--363", } @InProceedings{KarSip81, author = "R. M. Karp and M. Sipser", title = "Maximum matchings in sparse random graphs", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "364--375", } @InProceedings{MegiddoEtAl81, author = "N. Megiddo and S. L. Hakimi and M. R. Garey and D. S. Johnson and C. H. Papadimitriou", title = "The complexity of searching a graph", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "376--385", } @InProceedings{FlaSte81, author = "P. Flajolet and J. -M. Steyaert", title = "A complexity calculus for classes of recursive search programs over tree structures", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "386--393", } @InProceedings{Ben-Or81, author = "M. Ben-Or", title = "Probabilistic algorithms in finite fields", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "394--408", } @InProceedings{AdlOdl81, author = "L. M. Adleman and A. M. Odlyzko", title = "Irreducibility testing and factorization of polynomials", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "409--418", } @InProceedings{Pratt81, author = "V. R. Pratt", title = "A decidable {MU}-calculus", booktitle = "Proc.\ 22th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1981", pages = "421--427", } @InProceedings{DurGal82, author = "P. Duris and Z. Galil", title = "Two tapes are better than one for nondeterministic machines", booktitle = "Proc.\ 14th ACM Symposium on Theory of Computing (STOC)", year = "1982", pages = "1--7", } @InProceedings{Furer82, author = "M. Furer", title = "The tight deterministic time hierarchy", booktitle = "Proc.\ 14th ACM Symposium on Theory of Computing (STOC)", year = "1982", pages = "8--16", } @InProceedings{Pippenger82, author = "N. Pippenger", title = "Probabilistic simulations", booktitle = "Proc.\ 14th ACM Symposium on Theory of Computing (STOC)", year = "1982", pages = "17--26", } @InProceedings{Vitanyi82, author = "P. M. B. Vitanyi", title = "Real-time simulation of multicounters by oblivious one-tape Turing machines", booktitle = "Proc.\ 14th ACM Symposium on Theory of Computing (STOC)", year = "1982", pages = "27--36", } @InProceedings{InoTakTan82, author = "K. Inoue and I. Takanami and H. Taniguchi", title = "Two-dimensional alternating Turing machines", booktitle = "Proc.\ 14th ACM Symposium on Theory of Computing (STOC)", year = "1982", pages = "37--46", } @InProceedings{NivPer82, author = "M. Nivat and D. Perrin", title = "Ensembles reconnaissables de mots biinfinis", booktitle = "Proc.\ 14th ACM Symposium on Theory of Computing (STOC)", year = "1982", pages = "47--59", } @InProceedings{GurHar82, author = "Y. Gurevich and L. Harrington", title = "Trees, automata, and games", booktitle = "Proc.\ 14th ACM Symposium on Theory of Computing (STOC)", year = "1982", pages = "60--65", } @InProceedings{Carter82, author = "J. L. Carter", title = "The theory of signature testing for {VLSI}", booktitle = "Proc.\ 14th ACM Symposium on Theory of Computing (STOC)", year = "1982", pages = "66--76", } @InProceedings{BhaLei82, author = "S. N. Bhatt and C. E. Leiserson", title = "How to assemble tree machines", booktitle = "Proc.\ 14th ACM Symposium on Theory of Computing (STOC)", year = "1982", pages = "77--84", } @InProceedings{Leighton82, author = "F. T. Leighton", title = "A layout strategy for {VLSI} which is provably good", booktitle = "Proc.\ 14th ACM Symposium on Theory of Computing (STOC)", year = "1982", pages = "85--98", } @InProceedings{Kissin82, author = "G. Kissin", title = "Measuring energy consumption in {VLSI} circuits: {A} foundation", booktitle = "Proc.\ 14th ACM Symposium on Theory of Computing (STOC)", year = "1982", pages = "99--104", } @InProceedings{RivSha82, author = "R. L. Rivest and A. Shamir", title = "How to reuse a `write-once' memory", booktitle = "Proc.\ 14th ACM Symposium on Theory of Computing (STOC)", year = "1982", pages = "105--113", } @InProceedings{Willard82, author = "D. E. Willard", title = "Maintaining dense sequential files in a dynamic environment", booktitle = "Proc.\ 14th ACM Symposium on Theory of Computing (STOC)", year = "1982", pages = "114--121", } @InProceedings{Dietz82, author = "P. F. Dietz", title = "Maintaining order in a linked list", booktitle = "Proc.\ 14th ACM Symposium on Theory of Computing (STOC)", year = "1982", pages = "122--127", } @InProceedings{Yao82, author = "A. C. Yao", title = "Space-time tradeoff for answering range queries", booktitle = "Proc.\ 14th ACM Symposium on Theory of Computing (STOC)", year = "1982", pages = "128--136", } @InProceedings{Vardi82, author = "M. Y. Vardi", title = "The complexity of relational query languages", booktitle = "Proc.\ 14th ACM Symposium on Theory of Computing (STOC)", year = "1982", pages = "137--146", } @InProceedings{Immerman82, author = "N. Immerman", title = "Relational queries computable in polynomial time", booktitle = "Proc.\ 14th ACM Symposium on Theory of Computing (STOC)", year = "1982", pages = "147--152", } @InProceedings{DeBZuc82, author = "J. W. DeBakker and J. I. Zucker", title = "Denotational semantics of concurrency", booktitle = "Proc.\ 14th ACM Symposium on Theory of Computing (STOC)", year = "1982", pages = "153--158", } @InProceedings{SisCla82, author = "A. P. Sistla and E. M. Clarke", title = "The complexity of propositional linear temporal logics", booktitle = "Proc.\ 14th ACM Symposium on Theory of Computing (STOC)", year = "1982", pages = "159--168", } @InProceedings{EmeHal82, author = "E. A. Emerson and J. Y. Halpern", title = "Decision procedures and expressiveness in the temporal logic of branching time", booktitle = "Proc.\ 14th ACM Symposium on Theory of Computing (STOC)", year = "1982", pages = "169--180", } @InProceedings{FelHar82, author = "Y. A. Feldman and D. Harel", title = "A probabilistic dynamic logic", booktitle = "Proc.\ 14th ACM Symposium on Theory of Computing (STOC)", year = "1982", pages = "181--195", } @InProceedings{PapSip82, author = "C. H. Papadimitriou and M. Sipser", title = "Communication complexity", booktitle = "Proc.\ 14th ACM Symposium on Theory of Computing (STOC)", year = "1982", pages = "196--200", } @InProceedings{Reif82, author = "J. H. Reif", title = "Symmetric complementation", booktitle = "Proc.\ 14th ACM Symposium on Theory of Computing (STOC)", year = "1982", pages = "201--214", } @InProceedings{RuzSimTom82, author = "W. L. Ruzzo and J. Simon and M. Tompa", title = "Space-bounded hierarchies and probabilistic computations", booktitle = "Proc.\ 14th ACM Symposium on Theory of Computing (STOC)", year = "1982", pages = "215--223", } @InProceedings{Kurtz82, author = "S. A. Kurtz", title = "On the random oracle hypothesis", booktitle = "Proc.\ 14th ACM Symposium on Theory of Computing (STOC)", year = "1982", pages = "224--230", } @InProceedings{CooDwo82, author = "S. Cook and C. Dwork", title = "Bounds on the time for parallel {RAM}'s to compute simple functions", booktitle = "Proc.\ 14th ACM Symposium on Theory of Computing (STOC)", year = "1982", pages = "231--233", } @InProceedings{ManTom82, author = "U. Manber and M. Tompa", title = "Probabilistic, nondeterministic, and alternating decision trees", booktitle = "Proc.\ 14th ACM Symposium on Theory of Computing (STOC)", year = "1982", pages = "234--244", } @InProceedings{AsaHir82, author = "TakaoAsano and T. Hirata", title = "Edge-deletion and edge-contraction problems", booktitle = "Proc.\ 14th ACM Symposium on Theory of Computing (STOC)", year = "1982", pages = "245--254", } @InProceedings{PapYan82, author = "C. H. Papadimitriou and M. Yannakakis", title = "The complexity of facets (and some facets of complexity)", booktitle = "Proc.\ 14th ACM Symposium on Theory of Computing (STOC)", year = "1982", pages = "255--260", } @InProceedings{Kaltofen82, author = "E. Kaltofen", title = "A polynomial reduction from multivariate to bivariate integral polynomial factorization", booktitle = "Proc.\ 14th ACM Symposium on Theory of Computing (STOC)", year = "1982", pages = "261--266", } @InProceedings{Kosaraju82, author = "S. R. Kosaraju", title = "Decidability of reachability in vector addition systems", booktitle = "Proc.\ 14th ACM Symposium on Theory of Computing (STOC)", year = "1982", pages = "267--281", } @InProceedings{BoyceEtAl82, author = "J. E. Boyce and D. P. Dobkin and III R. L. Drysdale and L. J. Guibas", title = "Finding extremal polygons", booktitle = "Proc.\ 14th ACM Symposium on Theory of Computing (STOC)", year = "1982", pages = "282--289", } @InProceedings{Bach82, author = "E. Bach", title = "Fast algorithms under the extended Riemann hypothesis: {A} concrete estimate", booktitle = "Proc.\ 14th ACM Symposium on Theory of Computing (STOC)", year = "1982", pages = "290--295", } @InProceedings{HonSed82, author = "Z. Hong and R. Sedgewick", title = "Notes on merging networks", booktitle = "Proc.\ 14th ACM Symposium on Theory of Computing (STOC)", year = "1982", pages = "296--302", } @InProceedings{BarEve82, author = "R. Bar-Yehuda and S. Even", title = "On approximating a vertex cover for planar graphs", booktitle = "Proc.\ 14th ACM Symposium on Theory of Computing (STOC)", year = "1982", pages = "303--309", } @InProceedings{BabGriMou82, author = "L. Babai and D. Yu. Grigoryev and D. M. Mount", title = "Isomorphism of graphs with bounded eigenvalue multiplicity", booktitle = "Proc.\ 14th ACM Symposium on Theory of Computing (STOC)", year = "1982", pages = "310--324", } @InProceedings{Wigderson82, author = "A. Wigderson", title = "A new approximate graph coloring algorithm", booktitle = "Proc.\ 14th ACM Symposium on Theory of Computing (STOC)", year = "1982", pages = "325--329", } @InProceedings{MehSch82, author = "K. Mehlhorn and E. M. Schmidt", title = "Las Vegas is better than determinism in {VLSI} and distributed computing", booktitle = "Proc.\ 14th ACM Symposium on Theory of Computing (STOC)", year = "1982", pages = "330--337", } @InProceedings{BorHop82, author = "A. Borodin and J. E. Hopcroft", title = "Routing, merging and sorting on parallel models of computation", booktitle = "Proc.\ 14th ACM Symposium on Theory of Computing (STOC)", year = "1982", pages = "338--344", } @InProceedings{AtaKos82, author = "M. J. Atallah and S. R. Kosaraju", title = "Graph problems on a mesh-connected processor array", booktitle = "Proc.\ 14th ACM Symposium on Theory of Computing (STOC)", year = "1982", pages = "345--353", } @InProceedings{Greenberg82, author = "A. G. Greenberg", title = "On the time complexity of broadcast communication schemes", booktitle = "Proc.\ 14th ACM Symposium on Theory of Computing (STOC)", year = "1982", pages = "354--364", } @InProceedings{GolMic82, author = "S. Goldwasser and S. Micali", title = "Probabilistic encryption & how to play mental poker keeping secret all partial information", booktitle = "Proc.\ 14th ACM Symposium on Theory of Computing (STOC)", year = "1982", pages = "365--377", } @InProceedings{PacKorRot82, author = "J. Pachl and E. Korach and D. Rotem", title = "A technique for proving lower bounds for distributed maximum-finding algorithms", booktitle = "Proc.\ 14th ACM Symposium on Theory of Computing (STOC)", year = "1982", pages = "378--382", } @InProceedings{DeMLynMer82, author = "R. A. DeMillo and N. A. Lynch and M. J. Merritt", title = "Cryptographic protocols", booktitle = "Proc.\ 14th ACM Symposium on Theory of Computing (STOC)", year = "1982", pages = "383--400", } @InProceedings{DolStr82, author = "D. Dolev and H. R. Strong", title = "Polynomial algorithms for multiple processor agreement", booktitle = "Proc.\ 14th ACM Symposium on Theory of Computing (STOC)", year = "1982", pages = "401--407", } @InProceedings{ChaStoVis82, author = "A. K. Chandra and L. J. Stockmeyer and U. Vishkin", title = "A complexity theory for unbounded fan-in parallelism", booktitle = "Proc.\ 23th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1982", pages = "1--13", } @InProceedings{Papadimitriou82, author = "C. H. Papadimitriou", title = "On the complexity of unique solutions", booktitle = "Proc.\ 23th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1982", pages = "14--20", } @InProceedings{Huynh82, author = "T. -D. Huynh", title = "Deciding the inequivalence of context-free grammars with 1-letter terminal alphabet is $\Sigma_2^{P}$-complete", booktitle = "Proc.\ 23th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1982", pages = "21--31", } @InProceedings{Lagarias82, author = "J. C. Lagarias", title = "The computational complexity of simultaneous Diophantine approximation problems", booktitle = "Proc.\ 23th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1982", pages = "32--39", } @InProceedings{VazVaz82, author = "U. V. Vazirani and V. V. Vazirani", title = "A natural encoding scheme proved probabilistic polynomial complete", booktitle = "Proc.\ 23th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1982", pages = "40--44", } @InProceedings{ReiSch82, author = "S. Reisch and G. Schnitger", title = "Three applications of Kolmogorov-complexity", booktitle = "Proc.\ 23th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1982", pages = "45--52", } @InProceedings{Paul82, author = "W. Paul", title = "On-line simulation of $k+1$ tapes by $k$ tapes requires nonlinear time", booktitle = "Proc.\ 23th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1982", pages = "53--56", } @InProceedings{Kaltofen82, author = "E. Kaltofen", title = "A polynomial-time reduction from bivariate to univariate integral polynomial factorization", booktitle = "Proc.\ 23th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1982", pages = "57--64", } @InProceedings{BorVonHop82, author = "A. Borodin and J. VonzurGathen and J. Hopcroft", title = "Fast parallel matrix and {GCD} computations", booktitle = "Proc.\ 23th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1982", pages = "65--71", } @InProceedings{Sturtivant82, author = "C. Sturtivant", title = "Generalised symmetries of polynomials in algebraic complexity", booktitle = "Proc.\ 23th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1982", pages = "72--79", } @InProceedings{Yao82, author = "A. C. Yao", title = "Theory and applications of trapdoor functions", booktitle = "Proc.\ 23th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1982", pages = "80--91", } @InProceedings{ChoLeiRiv82, author = "B. Chor and C. E. Leiserson and R. L. Rivest", title = "An application of number theory to the organization of raster-graphics memory", booktitle = "Proc.\ 23th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1982", pages = "92--99", } @InProceedings{AdlMcD82, author = "L. M. Adleman and R. McDonnell", title = "An application of higher reciprocity to computational number theory", booktitle = "Proc.\ 23th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1982", pages = "100--106", } @InProceedings{Karmarkar82, author = "N. Karmarkar", title = "Probabilistic analysis of some bin-packing problems", booktitle = "Proc.\ 23th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1982", pages = "107--111", } @InProceedings{BluMic82, author = "M. Blum and S. Micali", title = "How to generate cryptographically strong sequences of pseudo random bits", booktitle = "Proc.\ 23th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1982", pages = "112--117", } @InProceedings{GalilEtAl82, author = "Z. Galil and C. M. Hoffmann and E. M. Luks and C. P. Schnorr and A. Weber", title = "An $ {O}(n^3 \log n) $ deterministic and an $ {O}(n^3 ) $ probabilistic isomorphism test for trivalent graphs", booktitle = "Proc.\ 23th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1982", pages = "118--125", } @InProceedings{Jerrum82, author = "M. Jerrum", title = "A compact representation for permutation groups", booktitle = "Proc.\ 23th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1982", pages = "126--133", } @InProceedings{GolMicTon82, author = "S. Goldwasser and S. Micali and P. Tong", title = "Why and how to establish a private code on a public network", booktitle = "Proc.\ 23th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1982", pages = "134--144", } @InProceedings{Shamir82, author = "A. Shamir", title = "A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem", booktitle = "Proc.\ 23th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1982", pages = "145--152", } @InProceedings{Plumstead82, author = "J. B. Plumstead", title = "Inferring a sequence generated by a linear congruence", booktitle = "Proc.\ 23th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1982", pages = "153--159", } @InProceedings{Yao82, author = "A. C. Yao", title = "Protocols for secure computations", booktitle = "Proc.\ 23th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1982", pages = "160--164", } @InProceedings{FreKomSze82, author = "M. L. Fredman and J. Komlos and E. Szemeredi", title = "Storing a sparse table with ${O}(1)$ worst case access time", booktitle = "Proc.\ 23th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1982", pages = "165--169", } @InProceedings{Mehlhorn82, author = "K. Mehlhorn", title = "On the program size of perfect and universal hash functions", booktitle = "Proc.\ 23th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1982", pages = "170--175", } @InProceedings{Vardi82, author = "M. Y. Vardi", title = "On decomposition of relational databases", booktitle = "Proc.\ 23th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1982", pages = "176--185", } @InProceedings{O'DYap82, author = "C. O'Dunlaing and C. K. Yap", title = "Generic transformation of data structures", booktitle = "Proc.\ 23th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1982", pages = "186--195", } @InProceedings{DolReiStr82, author = "D. Dolev and R. Reischuk and H. R. Strong", title = "`Eventual' is earlier than `Immediate'", booktitle = "Proc.\ 23th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1982", pages = "196--203", } @InProceedings{Halpern82, author = "J. Y. Halpern", title = "Deterministic process logic is elementary", booktitle = "Proc.\ 23th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1982", pages = "204--216", } @InProceedings{QueSif82, author = "J. P. Queille and J. Sifakis", title = "A temporal logic to deal with fairness in transition systems", booktitle = "Proc.\ 23th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1982", pages = "217--225", } @InProceedings{Iwama82, author = "K. Iwama", title = "On equations including string variables", booktitle = "Proc.\ 23th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1982", pages = "226--235", } @InProceedings{BeaLat82, author = "J. Beauquier and M. Latteux", title = "Substitution of bounded rational cone", booktitle = "Proc.\ 23th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1982", pages = "236--243", } @InProceedings{JohVen82, author = "D. B. Johnson and S. M. Venkatesan", title = "Parallel algorithms for minimum cuts and maximum flows in planar networks", booktitle = "Proc.\ 23th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1982", pages = "244--254", } @InProceedings{GalMicGab82, author = "Z. Galil and S. Micali and H. Gabow", title = "Priority queues with variable priority and an ${O}({EV} \log {V})$ algorithm for finding a maximal weighted matching in general graphs", booktitle = "Proc.\ 23th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1982", pages = "255--261", } @InProceedings{ChungEtAl82, author = "M. -J. Chung and F. Makedon and I. H. Sudborough and J. Turner", title = "Polynomial time algorithms for the min cut problem on degree restricted trees", booktitle = "Proc.\ 23th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1982", pages = "262--271", } @InProceedings{Stout82, author = "Q. F. Stout", title = "Using clerks in parallel processing", booktitle = "Proc.\ 23th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1982", pages = "272--279", } @InProceedings{HopJosWhi82, author = "J. Hopcroft and D. Joseph and S. Whitesides", title = "On the movement of robot arms in 2-dimensional bounded regions", booktitle = "Proc.\ 23th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1982", pages = "280--289", } @InProceedings{Reif82, author = "J. Reif", title = "Parallel time ${O}( \log {N})$ acceptance of deterministic {CFL}s", booktitle = "Proc.\ 23th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1982", pages = "290--296", } @InProceedings{LeiLei82, author = "F. T. Leighton and C. E. Leiserson", title = "Wafer-scale integration of systolic arrays", booktitle = "Proc.\ 23th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1982", pages = "297--311", } @InProceedings{KarKar82, author = "N. Karmarkar and R. M. Karp", title = "An efficient approximation scheme for the one-dimensional bin-packing problem", booktitle = "Proc.\ 23th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1982", pages = "312--320", } @InProceedings{Ursic82, author = "S. Ursic", title = "The ellipsoid algorithm for linear inequalities in exact arithmetic", booktitle = "Proc.\ 23th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1982", pages = "321--326", } @InProceedings{YamLev82, author = "B. Yamnitsky and L. Levin", title = "An old linear programming algorithm runs in polynomial time", booktitle = "Proc.\ 23th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1982", pages = "327--328", } @InProceedings{Megiddo82, author = "N. Megiddo", title = "Linear-time algorithms for linear programming in $ {R}^3 $ and related problems", booktitle = "Proc.\ 23th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1982", pages = "329--338", } @InProceedings{Chazelle82, author = "B. Chazelle", title = "A theorem on polygon cutting with applications", booktitle = "Proc.\ 23th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1982", pages = "339--349", } @InProceedings{PreLip82, author = "F. P. Preparata and Jr. W. Lipski", title = "Three layers are enough", booktitle = "Proc.\ 23th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1982", pages = "350--357", } @InProceedings{Lengauer82, author = "T. Lengauer", title = "The complexity of compacting hierarchically specified layouts of integrated circuits", booktitle = "Proc.\ 23th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1982", pages = "358--368", } @InProceedings{Ramachandran82, author = "V. Ramachandran", title = "On driving many long lines in a {VLSI} layout", booktitle = "Proc.\ 23th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1982", pages = "369--378", } @InProceedings{Kedem82, author = "Z. M. Kedem", title = "Optimal allocation of computational resources in {VLSI}", booktitle = "Proc.\ 23th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1982", pages = "379--385", } @InProceedings{AjtKomSze83, author = "M. Ajtai and J. Komlos and E. Szemeredi", title = "An ${O}(n \log n)$ sorting network", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "1--9", } @InProceedings{ReiVal83, author = "J. H. Reif and L. G. Valiant", title = "A logarithmic time sort for linear size networks", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "10--16", } @InProceedings{VonzurGathen83, author = "J. VonzurGathen", title = "Parallel algorithms for algebraic problems", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "17--23", } @InProceedings{Stout83, author = "Q. F. Stout", title = "Topological matching", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "24--31", } @InProceedings{Gacs83, author = "P. Gacs", title = "Reliable computation with cellular automata", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "32--41", } @InProceedings{DolevEtAl83, author = "D. Dolev and C. Dwork and N. Pippenger and A. Wigderson", title = "Superconcentrators, generalizers and generalized connectors with limited depth", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "42--51", } @InProceedings{ChaForLip83, author = "A. K. Chandra and S. Fortune and R. Lipton", title = "Unbounded fan-in circuits and associative functions", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "52--60", } @InProceedings{Sipser83, author = "M. Sipser", title = "Borel sets and circuit complexity", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "61--69", } @InProceedings{MeyeraufderHeide83, author = "F. MeyeraufderHeide", title = "A polynomial linear search algorithm for the {N}-dimensional knapsack problem", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "70--79", } @InProceedings{Ben-Or83, author = "M. Ben-Or", title = "Lower bounds for algebraic computation trees", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "80--86", } @InProceedings{BorodinEtAl83, author = "A. Borodin and D. Dolev and F. E. Fich and W. Paul", title = "Bounds for width two branching programs", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "87--93", } @InProceedings{ChaFurLip83, author = "A. K. Chandra and M. L. Furst and R. J. Lipton", title = "Multi-party protocols", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "94--99", } @InProceedings{Fich83, author = "F. E. Fich", title = "New bounds for parallel prefix circuits", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "100--109", } @InProceedings{Valiant83, author = "L. G. Valiant", title = "Exponential lower bounds for restricted monotone circuits", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "110--117", } @InProceedings{Stockmeyer83, author = "L. Stockmeyer", title = "The complexity of approximate counting", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "118--126", } @InProceedings{DurisEtAl83, author = "P. Duris and Z. Galil and W. Paul and R. Reischuk", title = "Two nonlinear lower bounds", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "127--132", } @InProceedings{AhoUllYan83, author = "A. V. Aho and J. D. Ullman and M. Yannakakis", title = "On notions of information transfer in {VLSI} circuits", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "133--139", } @InProceedings{LanMil83, author = "S. Landau and G. L. Miller", title = "Solvability by radicals is in polynomial time", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "140--151", } @InProceedings{DriFur83, author = "J. R. Driscoll and M. L. Furst", title = "On the diameter of permutation groups", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "152--160", } @InProceedings{FurSchSpe83, author = "M. Furer and W. Schnyder and E. Specker", title = "Normal forms for trivalent graphs and graphs of bounded valence", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "161--170", } @InProceedings{BabLuk83, author = "L. Babai and E. M. Luks", title = "Canonical labeling of graphs", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "171--183", } @InProceedings{Bach83, author = "E. Bach", title = "How to generate random integers with known factorization", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "184--188", } @InProceedings{Lenstra83, author = "A. K. Lenstra", title = "Factoring multivariate polynomials over finite fields", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "189--192", } @InProceedings{Kannan83, author = "R. Kannan", title = "Improved algorithms for integer programming and related lattice problems", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "193--206", } @InProceedings{O'DShaYap83, author = "C. O'Dunlaing and M. Sharir and C. K. Yap", title = "Retraction: {A} new approach to motion-planning", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "207--220", } @InProceedings{GuiSto83, author = "L. J. Guibas and J. Stolfi", title = "Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "221--234", } @InProceedings{SleTar83, author = "D. D. Sleator and R. E. Tarjan", title = "Self-adjusting binary trees", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "235--245", } @InProceedings{GabTar83, author = "H. N. Gabow and R. E. Tarjan", title = "A linear-time algorithm for a special case of disjoint set union", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "246--251", } @InProceedings{Frederickson83, author = "G. N. Frederickson", title = "Data structures for on-line updating of minimum spanning trees", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "252--257", } @InProceedings{Yao83, author = "F. F. Yao", title = "A 3-space partition and its applications", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "258--263", } @InProceedings{KanCosVar83, author = "P. C. Kanellakis and S. S. Cosmadakis and M. Y. Vardi", title = "Unary inclusion dependencies have polynomial time inference problems", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "264--277", } @InProceedings{Pnueli83, author = "A. Pnueli", title = "On the extremely fair treatment of probabilistic algorithms", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "278--290", } @InProceedings{Kozen83, author = "D. Kozen", title = "A probabilistic {PDL}", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "291--297", } @InProceedings{Feldman83, author = "Y. A. Feldman", title = "A decidable propositional probabilistic dynamic logic", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "298--309", } @InProceedings{HalRab83, author = "J. Y. Halpern and M. O. Rabin", title = "A logic to reason about likelihood", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "310--319", } @InProceedings{Olderog83, author = "E. -R. Olderog", title = "A characterization of Hoare's logic for programs with Pascal-like procedures", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "320--329", } @InProceedings{Sipser83, author = "M. Sipser", title = "A complexity theoretic approach to randomness", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "330--335", } @InProceedings{DymTom83, author = "P. W. Dymond and M. Tompa", title = "Speedups of deterministic machines by synchronous parallel machines", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "336--343", } @InProceedings{Kannan83, author = "R. Kannan", title = "Alternation and the power of nondeterminism", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "344--346", } @InProceedings{Immerman83, author = "N. Immerman", title = "Languages which capture complexity classes", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "347--354", } @InProceedings{Myers83, author = "D. Myers", title = "The random access hierarchy", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "355--364", } @InProceedings{Engelfriet83, author = "J. Engelfriet", title = "Iterated pushdown automata and complexity classes", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "365--373", } @InProceedings{Iwama83, author = "K. Iwama", title = "Unique decomposability of shuffled strings: {A} formal treatment of asynchronous time-multiplexed communication", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "374--381", } @InProceedings{HarSewImm83, author = "J. Hartmanis and V. Sewelson and N. Immerman", title = "Sparse sets in {NP}$-${P}: {EXPTIME} versus {NEXPTIME}", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "382--391", } @InProceedings{Young83, author = "P. Young", title = "Some structural properties of polynomial reducibilities and sets in {NP}", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "392--401", } @InProceedings{Adleman83, author = "L. M. Adleman", title = "On breaking generalized knapsack public key cryptosystems", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "402--412", } @InProceedings{LonWig83, author = "D. L. Long and A. Wigderson", title = "How discreet is the discrete log?", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "413--420", } @InProceedings{BenChoSha83, author = "M. Ben-Or and B. Chor and A. Shamir", title = "On the cryptographic security of single {RSA} bits", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "421--430", } @InProceedings{GolMicYao83, author = "S. Goldwasser and S. Micali and A. Yao", title = "Strong signature schemes", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "431--439", } @InProceedings{Blum83, author = "M. Blum", title = "How to exchange (secret) keys", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "440--447", } @InProceedings{Gabow83, author = "H. N. Gabow", title = "An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "448--456", } @InProceedings{Spinrad83, author = "J. Spinrad", title = "Transitive orientation in $ {O}(n^2 ) $ time", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "457--466", } @InProceedings{Turner83, author = "J. Turner", title = "Probabilistic analysis of bandwidth minimization algorithms", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "467--476", } @InProceedings{BakBhaLei83, author = "B. S. Baker and S. N. Bhatt and F. T. Leighton", title = "An approximation algorithm for Manhattan routing", booktitle = "Proc.\ 15th ACM Symposium on Theory of Computing (STOC)", year = "1983", pages = "477--486", } @InProceedings{LagOdl83, author = "J. C. Lagarias and A. M. Odlyzko", title = "Solving low-density subset sum problems", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "1--10", } @InProceedings{LubMicRac83, author = "M. Luby and S. Micali and C. Rackoff", title = "How to simultaneously exchange a secret bit by flipping a symmetrically-biased coin", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "11--22", } @InProceedings{VazVaz83, author = "U. V. Vazirani and V. V. Vazirani", title = "Trapdoor pseudo-random number generators, with applications to protocol design", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "23--30", } @InProceedings{KahSakStu83, author = "J. Kahn and M. Saks and D. Sturtevant", title = "A topological approach to evasiveness", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "31--33", } @InProceedings{EveGol83, author = "S. Even and O. Goldreich", title = "On the security of multi-party ping-pong protocols", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "34--39", } @InProceedings{Mairson83, author = "H. G. Mairson", title = "The program complexity of searching a table", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "40--47", } @InProceedings{IncSed83, author = "J. Incerpi and R. Sedgewick", title = "Improved upper bounds on shellsort", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "48--55", } @InProceedings{KarLub83, author = "R. M. Karp and M. Luby", title = "Monte-Carlo algorithms for enumeration and reliability problems", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "56--64", } @InProceedings{Vitter83, author = "J. S. Vitter", title = "Optimum algorithms for two random sampling problems", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "65--75", } @InProceedings{FlaMar83, author = "P. Flajolet and G. N. Martin", title = "Probabilistic counting", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "76--82", } @InProceedings{EdeO'RSei83, author = "H. Edelsbrunner and J. O'Rourke and R. Seidel", title = "Constructing arrangements of lines and hyperplanes with applications", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "83--91", } @InProceedings{Atallah83, author = "M. J. Atallah", title = "Dynamic computational geometry", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "92--99", } @InProceedings{GuiRamSto83, author = "L. Guibas and L. Ramshaw and J. Stolfi", title = "A kinetic framework for computational geometry", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "100--111", } @InProceedings{ColYap83, author = "R. Cole and C. K. Yap", title = "Geometric retrieval problems", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "112--121", } @InProceedings{Chazelle83, author = "B. Chazelle", title = "Filtering search: {A} new approach to query-answering", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "122--132", } @InProceedings{VonzurGathen83, author = "J. VonzurGathen", title = "Representations of rational functions", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "133--137", } @InProceedings{Reif83, author = "J. Reif", title = "Logarithmic depth circuits for algebraic functions", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "138--145", } @InProceedings{VisWig83, author = "U. Vishkin and A. Wigderson", title = "Trade-offs between depth and width in parallel computation", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "146--153", } @InProceedings{McKCoo83, author = "P. McKenzie and S. A. Cook", title = "The parallel complexity of the Abelian permutation group membership problem", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "154--161", } @InProceedings{BabKanLuk83, author = "L. Babai and W. M. Kantor and E. M. Luks", title = "Computational complexity and the classification of finite simple groups", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "162--171", } @InProceedings{VonzurGathen83, author = "J. VonzurGathen", title = "Factoring sparse multivariate polynomials", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "172--179", } @InProceedings{TiuUrz83, author = "J. Tiuryn and P. Urzyczyn", title = "Some relationships between logics of programs and complexity theory", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "180--184", } @InProceedings{WolVarSis83, author = "P. Wolper and M. Y. Vardi and A. P. Sistla", title = "Reasoning about infinite computation paths", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "185--194", } @InProceedings{Parikh83, author = "R. Parikh", title = "Propositional game logic", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "195--200", } @InProceedings{KraLeh83, author = "S. Kraus and D. Lehmann", title = "Decision procedures for time and chance", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "202--209", } @InProceedings{Gurevich83, author = "Y. Gurevich", title = "Algebras of feasible functions", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "210--214", } @InProceedings{BeaGir83, author = "J. Beauquier and F. Gire", title = "On context-free generators (abstract only)", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "215", } @InProceedings{ChaGuiLee83, author = "B. Chazelle and L. J. Guibas and D. T. Lee", title = "The power of geometric duality", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "217--225", } @InProceedings{Clarkson83, author = "K. L. Clarkson", title = "Fast algorithms for the all nearest neighbors problem", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "226--232", } @InProceedings{AsaAsa83, author = "TakaoAsano and TetsuoAsano", title = "Minimum partition of polygonal regions into trapezoids", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "233--241", } @InProceedings{Frederickson83, author = "G. N. Frederickson", title = "Shortest path problems in planar graphs", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "242--247", } @InProceedings{Gabow83, author = "H. N. Gabow", title = "Scaling algorithms for network problems", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "248--257", } @InProceedings{JohVen83, author = "D. B. Johnson and S. M. Venkatesan", title = "Partition of planar flow networks", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "259--264", } @InProceedings{Baker83, author = "B. S. Baker", title = "Approximation algorithms for {NP}-complete problems on planar graphs", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "265--273", } @InProceedings{Yannakakis83, author = "M. Yannakakis", title = "A polynomial algorithm for the min cut linear arrangement of trees", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "274--281", } @InProceedings{FlaPue83, author = "P. Flajolet and C. Puech", title = "Tree structures for partial match retrieval", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "282--288", } @InProceedings{Lueker83, author = "G. S. Lueker", title = "Bin packing with items uniformly distributed over intervals [$a,b$]", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "289--297", } @InProceedings{AjtFreKom83, author = "M. Ajtai and M. Fredman and J. Komlos", title = "Hash functions for priority queues", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "299--303", } @InProceedings{BerSim83, author = "P. Berman and J. Simon", title = "Lower bounds on graph threading by probabilistic machines", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "304--311", } @InProceedings{Ja'Ja'83, author = "J. Ja'Ja'", title = "On the computational complexity of the permanent", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "312--319", } @InProceedings{Alt83, author = "H. Alt", title = "Multiplication is the easiest nontrivial arithmetic function", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "320--322", } @InProceedings{Schnitger83, author = "G. Schnitger", title = "On depth-reduction and grates", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "323--328", } @InProceedings{Wilson83, author = "C. B. Wilson", title = "Relativized circuit complexity", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "329--334", } @InProceedings{Wilber83, author = "R. E. Wilber", title = "Randomness and the density of hard problems", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "335--342", } @InProceedings{PatSim83, author = "R. Paturi and J. Simon", title = "Lower bounds on the time of probabilistic on-line simulations", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "343--350", } @InProceedings{HocMaySie83, author = "P. H. Hochschild and E. W. Mayr and A. R. Siegel", title = "Techniques for solving graph problems in parallel environments", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "351--359", } @InProceedings{BakPin83, author = "B. S. Baker and R. Y. Pinter", title = "An algorithm for the optimal placement and routing of a circuit within a ring of pads", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "360--370", } @InProceedings{Aggarwal83, author = "A. Aggarwal", title = "Period-time tradeoffs for {VLSI} models with delay", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "372--382", } @InProceedings{GreLad83, author = "A. G. Greenberg and R. E. Ladner", title = "Estimating the multiplicities of conflicts in multiple access channels", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "383--392", } @InProceedings{DolDwoSto83, author = "D. Dolev and C. Dwork and L. Stockmeyer", title = "On the minimal synchronism needed for distributed consensus", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "393--402", } @InProceedings{Rabin83, author = "M. O. Rabin", title = "Randomized Byzantine generals", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "403--409", } @InProceedings{Klawe83, author = "M. M. Klawe", title = "A tight bound for black and white pebbles on the pyramid", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "410--419", } @InProceedings{Yao83, author = "A. C. Yao", title = "Lower bounds by probabilistic arguments", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "420--428", } @InProceedings{PaulEtAl83, author = "W. J. Paul and N. Pippenger and E. Szemeredi and W. T. Trotter", title = "On determinism versus non-determinism and related problems", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "429--438", } @InProceedings{Hartmanis83, author = "J. Hartmanis", title = "Generalized Kolmogorov complexity and the structure of feasible computations", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "439--445", } @InProceedings{Papadimitriou83, author = "C. H. Papadimitriou", title = "Games against nature", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "446--450", } @InProceedings{KarpEtAl83, author = "R. M. Karp and F. T. Leighton and R. L. Rivest and C. D. Thompson and U. Vazirani and V. Vazirani", title = "Global wire routing in two-dimensional arrays", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "453--459", } @InProceedings{Leivant83, author = "D. Leivant", title = "Reasoning about functional programs and complexity classes associated with type disciplines", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "460--469", } @InProceedings{Linial83, author = "N. Linial", title = "Legal coloring of graphs", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "470--472", } @InProceedings{LinSak83, author = "N. Linial and M. E. Saks", title = "Information bounds are good for search problems on ordered data structures", booktitle = "Proc.\ 24th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1983", pages = "473--475", } @InProceedings{HarSha84, author = "S. Hart and M. Sharir", title = "Probabilistic temporal logics for finite and bounded models", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "1--13", } @InProceedings{EmeSis84, author = "E. A. Emerson and A. P. Sistla", title = "Deciding branching time logic", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "14--24", } @InProceedings{Hennessy84, author = "M. Hennessy", title = "Modelling fair processes", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "25--30", } @InProceedings{DegMon84, author = "P. Degano and U. Montanari", title = "Liveness properties as convergence in metric spaces", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "31--38", } @InProceedings{Gerth84, author = "R. Gerth", title = "Transition logic", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "39--50", } @InProceedings{BarKuiPnu84, author = "H. Barringer and R. Kuiper and A. Pnueli", title = "Now you may compose temporal logic specifications", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "51--63", } @InProceedings{BilPre84, author = "G. Bilardi and F. P. Preparata", title = "A minimum area {VLSI} network for ${O}(\log n)$ time sorting", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "64--70", } @InProceedings{Leighton84, author = "T. Leighton", title = "Tight bounds on the complexity of parallel sorting", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "71--80", } @InProceedings{DurGalSch84, author = "P. Duris and Z. Galil and G. Schnitger", title = "Lower bounds on communication complexity", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "81--91", } @InProceedings{Blum84, author = "N. Blum", title = "An area-maximum edge length tradeoff for {VLSI} layout", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "92--97", } @InProceedings{BusSho84, author = "J. F. Buss and P. W. Shor", title = "On the pagenumber of planar graphs", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "98--100", } @InProceedings{Mirzaian84, author = "A. Mirzaian", title = "Channel routing in {VLSI}", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "101--107", } @InProceedings{Post84, author = "M. J. Post", title = "Minimum spanning ellipsoids", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "108--116", } @InProceedings{KimAnd84, author = "C. E. Kim and T. A. Anderson", title = "Digital disks and a digital compactness measure", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "117--124", } @InProceedings{Chazelle84, author = "B. Chazelle", title = "Intersecting is easier than sorting", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "125--134", } @InProceedings{GabBenTar84, author = "H. N. Gabow and J. L. Bentley and R. E. Tarjan", title = "Scaling and related techniques for geometry problems", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "135--143", } @InProceedings{ShaSch84, author = "M. Sharir and A. Schorr", title = "On shortest paths in polyhedral spaces", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "144--153", } @InProceedings{ColShaYap84, author = "R. Cole and M. Sharir and C. K. Yap", title = "On $k$-hulls and related problems", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "154--166", } @InProceedings{FraKle84, author = "D. S. Franzblau and D. J. Kleitman", title = "An algorithm for constructing regions with rectangles: Independence and minimum generating sets for collections of intervals", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "167--174", } @InProceedings{Huang84, author = "M. -D. A. Huang", title = "Factorization of polynomials over finite fields and factorization of primes in algebraic number fields", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "175--182", } @InProceedings{BacMilSha84, author = "E. Bach and G. Miller and J. Shallit", title = "Sums of divisors, perfect numbers, and factoring", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "183--190", } @InProceedings{KanLenLov84, author = "R. Kannan and A. K. Lenstra and L. Lovasz", title = "Polynomial factorization and nonrandomness of bits of algebraic and some transcendental numbers", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "191--200", } @InProceedings{Coppersmith84, author = "D. Coppersmith", title = "Evaluating logarithms in $ {GF}(2^n ) $", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "201--207", } @InProceedings{OngSchSha84, author = "H. Ong and C. P. Schnorr and A. Shamir", title = "An efficient signature scheme based on quadratic equations", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "208--216", } @InProceedings{OrlElG84, author = "A. Orlitsky and A. ElGamal", title = "Communication with secrecy constraints", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "217--224", } @InProceedings{DolevEtAl84, author = "D. Dolev and D. Maier and H. Mairson and J. Ullman", title = "Correcting faults in write-once memory", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "225--229", } @InProceedings{Vishkin84, author = "U. Vishkin", title = "Randomized speed-ups in parallel computation", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "230--239", } @InProceedings{Galil84, author = "Z. Galil", title = "Optimal parallel algorithms for string matching", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "240--248", } @InProceedings{AweIsrShi84, author = "B. Awerbuch and A. Israeli and Y. Shiloach", title = "Finding Euler circuits in logarithmic parallel time", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "249--257", } @InProceedings{Upfal84, author = "E. Upfal", title = "A probabilistic relation between desirable and feasible models of parallel computation", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "258--265", } @InProceedings{KarWig84, author = "R. M. Karp and A. Wigderson", title = "A fast parallel algorithm for the maximal independent set problem", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "266--272", } @InProceedings{Manber84, author = "U. Manber", title = "On maintaining dynamic information in a concurrent environment", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "273--278", } @InProceedings{BentleyEtAl84, author = "J. L. Bentley and D. S. Johnson and F. T. Leighton and C. C. McGeoch and L. A. McGeoch", title = "Some unexpected expected behavior results for bin packing", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "279--288", } @InProceedings{KarLubMar84, author = "R. M. Karp and M. Luby and A. Marchetti-Spaccamela", title = "A probabilistic analysis of multidimensional bin packing problems", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "289--298", } @InProceedings{KahSak84, author = "J. Kahn and M. Saks", title = "Every poset has a good comparison", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "299--301", } @InProceedings{Karmarkar84, author = "N. Karmarkar", title = "A new polynomial-time algorithm for linear programming", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "302--311", } @InProceedings{AdlMeg84, author = "I. Adler and N. Megiddo", title = "A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "312--323", } @InProceedings{HocShm84, author = "D. S. Hochbaum and D. B. Shmoys", title = "Powers of graphs: {A} powerful approximation technique for bottleneck problems", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "324--333", } @InProceedings{Gonnet84, author = "G. H. Gonnet", title = "Determining equivalence of expressions in random polynomial time", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "334--341", } @InProceedings{Clarkson84, author = "K. L. Clarkson", title = "Fast expected-time and approximation algorithms for geometric minimum spanning trees", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "342--348", } @InProceedings{BlumerEtAl84, author = "A. Blumer and J. Blumer and A. Ehrenfeucht and D. Haussler and R. McConnell", title = "Building a complete inverted file for a set of text files in linear time", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "349--358", } @InProceedings{GolMar84, author = "A. V. Goldberg and A. Marchetti-Spaccamela", title = "On finding the exact solution of a zero-one knapsack problem", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "359--368", } @InProceedings{CunMun84, author = "W. Cunto and J. I. Munro", title = "Average case selection", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "369--375", } @InProceedings{Miller84, author = "G. L. Miller", title = "Finding small simple cycle separators for 2-connected planar graphs", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "376--382", } @InProceedings{FreSri84, author = "G. N. Frederickson and M. A. Srinivas", title = "Data structures for on-line updating of matroid intersection solutions", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "383--390", } @InProceedings{SloVan84, author = "C. Slot and P. VanEmdeBoas", title = "On tape versus core; an application of space efficient perfect hash functions to the invariance of space", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "391--400", } @InProceedings{Maass84, author = "W. Maass", title = "Quadratic lower bounds for deterministic and nondeterministic one-tape Turing machines", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "401--408", } @InProceedings{DeRougemont84, author = "M. DeRougemont", title = "Uniform definability on finite structures with successor", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "409--417", } @InProceedings{Harel84, author = "D. Harel", title = "A general result on infinite trees and its applications", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "418--427", } @InProceedings{Kozen84, author = "D. Kozen", title = "Pebblings, edgings, and equational logic", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "428--435", } @InProceedings{Valiant84, author = "L. G. Valiant", title = "A theory of the learnable", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "436--445", } @InProceedings{VarWol84, author = "M. Y. Vardi and P. Wolper", title = "Automata theoretic techniques for modal logics of programs", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "446--456", } @InProceedings{BenKozRei84, author = "M. Ben-Or and D. Kozen and J. Reif", title = "The complexity of elementary algebra and geometry", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "457--464", } @InProceedings{Levin84, author = "L. A. Levin", title = "Problems, complete in `average' instance", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "465", } @InProceedings{Alt84, author = "H. Alt", title = "Comparison of arithmetic functions with respect to Boolean circuit depth", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "466--470", } @InProceedings{AjtBen84, author = "M. Ajtai and M. Ben-Or", title = "A theorem on probabilistic constant depth computations", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "471--474", } @InProceedings{Boppana84, author = "R. B. Boppana", title = "Threshold functions and bounded depth monotone circuits", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "475--479", } @InProceedings{KlaweEtAl84, author = "M. Klawe and W. J. Paul and N. Pippenger and M. Yannakakis", title = "On monotone formulae with restricted depth", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "480--487", } @InProceedings{SleTar84, author = "D. D. Sleator and R. E. Tarjan", title = "Amortized efficiency of list update rules", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "488--492", } @InProceedings{FreLyn84, author = "G. N. Frederickson and N. A. Lynch", title = "The impact of synchronous communication on the problem of electing a leader in a ring", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "493--503", } @InProceedings{DolHalStr84, author = "D. Dolev and J. Halpern and R. Strong", title = "On the possibility and impossibility of achieving clock synchronization", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "504--511", } @InProceedings{Willard84, author = "D. E. Willard", title = "Log-logarithmic protocols for resolving ethernet and semaphore conflicts", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "512--521", } @InProceedings{Awerbuch84, author = "B. Awerbuch", title = "An efficient network synchronization protocol", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "522--525", } @InProceedings{DolevEtAl84, author = "D. Dolev and J. Halpern and B. Simons and R. Strong", title = "A new look at fault tolerant network routing", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "526--535", } @InProceedings{BroderEtAl84, author = "A. Broder and D. Dolev and M. Fischer and B. Simons", title = "Efficient fault tolerant routings in networks", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "536--541", } @InProceedings{Vitanyi84, author = "P. M. B. Vitanyi", title = "Distributed elections in an Archimedean ring of processors", booktitle = "Proc.\ 16th ACM Symposium on Theory of Computing (STOC)", year = "1984", pages = "542--547", } @InProceedings{BeaCooHoo84, author = "P. W. Beame and S. A. Cook and H. J. Hoover", title = "Log depth circuits for division and related problems", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "1--6", } @InProceedings{KanMilRud84, author = "R. Kannan and G. Miller and L. Rudolph", title = "Sublinear parallel algorithm for computing the greatest common divisor of two integers", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "7--11", } @InProceedings{TarVis84, author = "R. E. Tarjan and U. Vishkin", title = "Finding biconnected components and computing tree functions in logarithmic parallel time", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "12--20", } @InProceedings{Eberly84, author = "W. Eberly", title = "Very fast parallel matrix and polynomial arithmetic", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "21--30", } @InProceedings{VonzurGathen84, author = "J. VonzurGathen", title = "Parallel powering", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "31--36", } @InProceedings{FiaSha84, author = "A. Fiat and A. Shamir", title = "Polymorphic arrays: {A} novel {VLSI} layout for systolic computers", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "37--45", } @InProceedings{IbaPalKim84, author = "O. H. Ibarra and M. A. Palis and S. M. Kim", title = "Designing systolic algorithms using sequential machines", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "46--55", } @InProceedings{MeyRei84, author = "F. MeyeraufderHeide and R. Reischuk", title = "On the limits to speed up parallel machines by large hardware and unbounded communication", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "56--64", } @InProceedings{ColSie84, author = "R. Cole and A. Siegel", title = "River routing every which way, but loose", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "65--73", } @InProceedings{Heath84, author = "L. Heath", title = "Embedding planar graphs in seven pages", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "74--83", } @InProceedings{PapUll84, author = "C. H. Papadimitriou and J. D. Ullman", title = "A communication-time tradeoff", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "84--88", } @InProceedings{Aggarwal84, author = "A. Aggarwal", title = "A comparative study of {X}-tree, pyramid and related machines", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "89--99", } @InProceedings{ElGOrl84, author = "A. ElGamal and A. Orlitsky", title = "Interactive data comparison", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "100--108", } @InProceedings{Tiwari84, author = "P. Tiwari", title = "Lower bounds on communication complexity in distributed computer networks", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "109--117", } @InProceedings{PatSim84, author = "R. Paturi and J. Simon", title = "Probabilistic communication complexity", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "118--126", } @InProceedings{Pippenger84, author = "N. Pippenger", title = "Parallel communication with limited buffers", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "127--136", } @InProceedings{ItaRod84, author = "A. Itai and M. Rodeh", title = "The multi-tree approach to reliability in distributed networks", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "137--147", } @InProceedings{Sullivan84, author = "G. Sullivan", title = "A polynomial time algorithm for fault diagnosability", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "148--156", } @InProceedings{BroDol84, author = "A. Z. Broder and D. Dolev", title = "Flipping coins in many pockets (Byzantine agreement on uniformly random values)", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "157--170", } @InProceedings{UpfWig84, author = "E. Upfal and A. Wigderson", title = "How to share memory in a distributed system", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "171--180", } @InProceedings{BuiEtAl84, author = "T. Bui and S. Chaudhuri and T. Leighton and M. Sipser", title = "Graph bisection algorithms with good average case behavior", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "181--192", } @InProceedings{Shor84, author = "P. W. Shor", title = "The average-case analysis of some on-line algorithms for bin packing", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "193--200", } @InProceedings{Komlos84, author = "J. Komlos", title = "Linear verification for spanning trees", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "201--206", } @InProceedings{Mishra84, author = "B. Mishra", title = "An efficient algorithm to find all 'Bidirectional' edges of an undirected graph", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "207--216", } @InProceedings{StaGab84, author = "M. Stallmann and H. N. Gabow", title = "An augmenting path algorithm for the parity problem on linear matroids", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "217--228", } @InProceedings{BabSze84, author = "L. Babai and E. Szemeredi", title = "On the complexity of matrix group problems {I}", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "229--240", } @InProceedings{KorMilSpi84, author = "D. Kornhauser and G. Miller and P. Spirakis", title = "Coordinating pebble motion on graphs, the diameter of permutation groups, and applications", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "241--250", } @InProceedings{Kaminski84, author = "M. Kaminski", title = "Mulltiplication of polynomials over the ring of integers", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "251--254", } @InProceedings{Cole84, author = "R. Cole", title = "Slowing down sorting networks to obtain faster sorting algorithms", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "255--260", } @InProceedings{BluShu84, author = "L. Blum and M. Shub", title = "Evaluating rational functions: Infinite precision is finite cost and tractable on average", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "261--267", } @InProceedings{FagHalVar84, author = "R. Fagin and J. Y. Halpern and M. Y. Vardi", title = "A model-theoretic analysis of knowledge", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "268--278", } @InProceedings{Mulmuley84, author = "K. Mulmuley", title = "A semantic characterization of full abstraction for typed lambda calculi", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "279--288", } @InProceedings{Mitchell84, author = "J. C. Mitchell", title = "Semantic models for second-order lambda calculus", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "289--299", } @InProceedings{Homer84, author = "S. Homer", title = "Minimal degrees for honest polynomial reducibilities", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "300--307", } @InProceedings{BalcazarEtAl84, author = "J. Balcazar and R. Book and T. Long and U. Schoning and A. Selman", title = "Sparse oracles and uniform complexity classes", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "308--311", } @InProceedings{HarSha84, author = "S. Hart and M. Sharir", title = "Nonlinearity of Davenport-Schinzel sequences and of a generalized path compression scheme", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "313--319", } @InProceedings{AloMil84, author = "N. Alon and V. D. Milman", title = "Eigenvalues, expanders and superconcentrators", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "320--322", } @InProceedings{GreWei84, author = "A. G. Greenberg and A. Weiss", title = "A lower bound for probabilistic algorithms for finite state machines", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "323--331", } @InProceedings{MorSniMan84, author = "S. Moran and M. Snir and U. Manber", title = "Applications of Ramsey's theorem to decision trees complexity", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "332--337", } @InProceedings{FreTar84, author = "M. L. Fredman and R. E. Tarjan", title = "Fibonacci heaps and their uses in improved network optimization algorithms", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "338--346", } @InProceedings{GabGalSpe84, author = "H. N. Gabow and Z. Galil and T. H. Spencer", title = "Efficient implementation of graph algorithms using contraction", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "347--357", } @InProceedings{Chazelle84, author = "B. Chazelle", title = "Computing on a free tree via complexity-preserving mappings", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "358--368", } @InProceedings{Munro84, author = "J. I. Munro", title = "An implicit data structure for the dictionary problem that runs in polylog time", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "369--374", } @InProceedings{FisPat84, author = "M. J. Fischer and M. S. Paterson", title = "Fishspear: {A} priority queue algorithm", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "375--386", } @InProceedings{DobEde84, author = "D. P. Dobkin and H. Edelsbrunner", title = "Space searching for intersecting objects", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "387--392", } @InProceedings{ImaAsa84, author = "H. Imai and TakaoAsano", title = "Dynamic segment intersection search with applications", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "393--402", } @InProceedings{Vaidya84, author = "P. M. Vaidya", title = "A fast approximation for minimum spanning trees in $k$-dimensional space", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "403--407", } @InProceedings{ChaYap84, author = "J. S. Chang and C. K. Yap", title = "A polynomial solution for potato-peeling and other polygon inclusion and enclosure problems", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "408--416", } @InProceedings{SedVit84, author = "R. Sedgewick and J. S. Vitter", title = "Shortest paths in Euclidean graphs", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "417--424", } @InProceedings{Blum84, author = "M. Blum", title = "Independent unbiased coin flips from a correlated biased source: {A} finite state Markov chain", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "425--433", } @InProceedings{SanVaz84, author = "M. Santha and U. V. Vazirani", title = "Generating quasi-random sequences from slightly-random sources", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "434--440", } @InProceedings{GolMicRiv84, author = "S. Goldwasser and S. Micali and R. L. Rivest", title = "A `paradoxical' solution to the signature problem", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "441--448", } @InProceedings{AlexiEtAl84, author = "W. Alexi and B. Chor and O. Goldreich and C. P. Schnorr", title = "{RSA}/Rabin bits are $ 1/2+1/ \mbox{poly}(\log{N}) $ secure", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "449--457", } @InProceedings{VazVaz84, author = "U. V. Vazirani and V. V. Vazirani", title = "Efficient and secure pseudo-random number generation", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "458--463", } @InProceedings{GolGolMic84, author = "O. Goldreich and S. Goldwasser and S. Micali", title = "How to construct random functions", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "464--479", } @InProceedings{FriKanLag84, author = "A. M. Frieze and R. Kannan and J. C. Lagarias", title = "Linear congruential generators do not produce random sequences", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "480--484", } @InProceedings{Pitt84, author = "L. Pitt", title = "A characterization of probabilistic inference", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "485--494", } @InProceedings{GroSel84, author = "J. Grollmann and A. L. Selman", title = "Complexity measures for public-key cryptosystems", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "495--503", } @InProceedings{Friedman84, author = "J. Friedman", title = "Constructing ${O}(n\log n)$ size monotone formulae for the $k$-th elementary symmetric polynomial of $n$ Boolean variables", booktitle = "Proc.\ 25th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1984", pages = "506--515", } @InProceedings{Luby85, author = "M. Luby", title = "A simple parallel algorithm for the maximal independent set problem", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "1--10", } @InProceedings{VazVaz85, author = "U. V. Vazirani and V. V. Vazirani", title = "The two-processor scheduling problem is in {R}-{NC}", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "11--21", } @InProceedings{KarUpfWig85, author = "R. M. Karp and E. Upfal and A. Wigderson", title = "Constructing a perfect matching is in random {NC}", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "22--32", } @InProceedings{Anderson85, author = "R. Anderson", title = "A parallel algorithm for the maximal path problem", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "33--37", } @InProceedings{FicTom85, author = "F. E. Fich and M. Tompa", title = "The parallel complexity of exponentiating polynomials over finite fields", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "38--47", } @InProceedings{FichEtAl85, author = "F. E. Fich and F. MeyeraufderHeide and P. Ragde and A. Wigderson", title = "One, two, three ... infinity: Lower bounds for parallel computation", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "48--58", } @InProceedings{Aggarwal85, author = "A. Aggarwal", title = "Tradeoffs for {VLSI} models with subpolynomial delay", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "59--68", } @InProceedings{LeiMal85, author = "C. E. Leiserson and F. M. Maley", title = "Algorithms for routing and testing routability of planar {VLSI} layouts", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "69--78", } @InProceedings{RagTho85, author = "P. Raghavan and C. D. Thompson", title = "Provably good routing in graphs: Regular arrays", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "79--87", } @InProceedings{JimMar85, author = "S. Jimbo and A. Maruoka", title = "Expanders obtained from affine transformations", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "88--97", } @InProceedings{Alon85, author = "N. Alon", title = "Expanders, sorting in rounds and superconcentrators of limited depth", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "98--102", } @InProceedings{Wilber85, author = "R. Wilber", title = "White pebbles help", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "103--112", } @InProceedings{BakForGro85, author = "B. S. Baker and S. Fortune and E. Grosse", title = "Stable prehension with three fingers", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "114--120", } @InProceedings{Huang85, author = "M. -D. A. Huang", title = "Riemann hypothesis and finding roots over finite fields", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "121--130", } @InProceedings{Kaltofen85, author = "E. Kaltofen", title = "Computing with polynomials given by straight-line programs {I}: Greatest common divisors", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "131--142", } @InProceedings{PanRei85, author = "V. Pan and J. Reif", title = "Efficient parallel solution of linear systems", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "143--152", } @InProceedings{FriRon85, author = "K. Friedl and L. Ronyai", title = "Polynomial time solutions of some problems in computational algebra", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "153--162", } @InProceedings{YaoYao85, author = "A. C. Yao and F. F. Yao", title = "A general approach to $d$-dimensional geometric queries", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "163--168", } @InProceedings{Vaidya85, author = "P. M. Vaidya", title = "Space-time tradeoffs for orthogonal range queries", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "169--174", } @InProceedings{Clarkson85, author = "K. L. Clarkson", title = "A probabilistic algorithm for the post office problem", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "175--184", } @InProceedings{Harel85, author = "D. Harel", title = "A linear time algorithm for finding dominators in flow graphs and related problems", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "185--194", } @InProceedings{SuzNisSai85, author = "H. Suzuki and T. Nishizeki and N. Saito", title = "Multicommodity flows in planar undirected graphs and shortest paths", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "195--204", } @InProceedings{Culberson85, author = "J. Culberson", title = "The effect of updates in binary search trees", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "205--212", } @InProceedings{BenJoh85, author = "S. W. Bent and J. W. John", title = "Finding the median requires $2n$ comparisons", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "213--216", } @InProceedings{ChuHajSey85, author = "F. R. K. Chung and D. J. Hajela and P. D. Seymour", title = "Self-organizing sequential search and Hilbert's inequalities", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "217--223", } @InProceedings{BolSim85, author = "B. Bollobas and IstvanSimon", title = "On the expected behaviour of disjoint set union algorithms", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "224--231", } @InProceedings{Peleg85, author = "D. Peleg", title = "Concurrent dynamic logic", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "232--239", } @InProceedings{VarSto85, author = "M. Y. Vardi and L. Stockmeyer", title = "Improved upper and lower bounds for modal logics of programs", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "240--251", } @InProceedings{DeBakkerEtAl85, author = "J. W. DeBakker and J. -J. Ch. Meyer and E. -R. Olderog and J. I. Zucker", title = "Transition systems, infinitary languages and the semantics of uniform concurrency", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "252--262", } @InProceedings{BruLon85, author = "K. B. Bruce and G. Longo", title = "Provable isomorphisms and domain equations in models of typed languages", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "263--272", } @InProceedings{CosKan85, author = "S. S. Cosmadakis and P. C. Kanellakis", title = "Equational theories and database constraints", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "273--284", } @InProceedings{Buss85, author = "S. R. Buss", title = "The polynomial hierarchy and fragments of bounded arithmetic", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "285--290", } @InProceedings{GolMicRac85, author = "S. Goldwasser and S. Micali and C. Rackoff", title = "The knowledge complexity of interactive proof-systems", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "291--304", } @InProceedings{FagVar85, author = "R. Fagin and M. Y. Vardi", title = "An internal semantics for modal logic", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "305--315", } @InProceedings{Bracha85, author = "G. Bracha", title = "An ${O}( \lg n)$ expected rounds randomized Byzantine generals protocol", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "316--326", } @InProceedings{Feldman85, author = "P. Feldman", title = "Fault tolerance of minimal path routings in a network", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "327--334", } @InProceedings{CoanEtAl85, author = "B. A. Coan and D. Dolev and C. Dwork and L. Stockmeyer", title = "The distributed firing squad problem", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "335--345", } @InProceedings{HalMegMun85, author = "J. Y. Halpern and N. Megiddo and A. A. Munshi", title = "Optimal precision in the presence of uncertainty", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "346--355", } @InProceedings{HasSha85, author = "J. Hastad and A. Shamir", title = "The cryptographic security of truncated linearly related variables", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "356--362", } @InProceedings{Levin85, author = "L. A. Levin", title = "One-way functions and pseudorandom generators", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "363--365", } @InProceedings{Vazirani85, author = "U. V. Vazirani", title = "Towards a strong communication complexity theory or generating quasi-random sequences from two communicating slightly-random sources", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "366--378", } @InProceedings{GoodmanEtAl85, author = "J. Goodman and A. G. Greenberg and N. Madras and P. March", title = "On the stability of the ethernet", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "379--387", } @InProceedings{GacRei85, author = "P. Gacs and J. H. Reif", title = "A simple three-dimensional real-time reliable cellular array", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "388--395", } @InProceedings{Lubiw85, author = "A. Lubiw", title = "Doubly lexical orderings of matrices", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "396--404", } @InProceedings{Huynh85, author = "D. T. Huynh", title = "The complexity of the equivalence problem for commutative semigroups and symmetric vector addition systems", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "405--412", } @InProceedings{MeyeraufderHeide85, author = "F. MeyeraufderHeide", title = "Fast algorithms for {N}-dimensional restrictions of hard problems", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "413--420", } @InProceedings{Babai85, author = "L. Babai", title = "Trading group theory for randomness", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "421--429", } @InProceedings{BolFenFri85, author = "B. Bollobas and T. I. Fenner and A. M. Frieze", title = "An algorithm for finding Hamilton cycles in a random graph", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "430--439", } @InProceedings{GolSip85, author = "A. V. Goldberg and M. Sipser", title = "Compression and ranking", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "440--448", } @InProceedings{CarStoWeg85, author = "L. Carter and L. Stockmeyer and M. Wegman", title = "The complexity of backtrack searches", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "449--457", } @InProceedings{ValVaz85, author = "L. G. Valiant and V. V. Vazirani", title = "{NP} is as easy as detecting unique solutions", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "458--463", } @InProceedings{KarUpfWig85, author = "R. M. Karp and E. Upfal and A. Wigderson", title = "Are search and decision problems computationally equivalent?", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "464--475", } @InProceedings{AhaErdLin85, author = "R. Aharoni and P. Erdos and N. Linial", title = "Dual Integer Linear Programs and the Relationship Between Their Optima", booktitle = "Proc.\ 17th ACM Symposium on Theory of Computing (STOC)", year = "1985", pages = "476--483", } @InProceedings{Yao85, author = "A. C. -C. Yao", title = "Separating the polynomial-time hierarchy by oracles", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "1--10", } @InProceedings{AjtWig85, author = "M. Ajtai and A. Wigderson", title = "Deterministic simulation of probabilistic constant depth circuits", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "11--19", } @InProceedings{Boppana85, author = "R. B. Boppana", title = "Amplification of probabilistic Boolean formulas", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "20--29", } @InProceedings{Pippenger85, author = "N. Pippenger", title = "On networks of noisy gates", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "30--38", } @InProceedings{JohPapYan85, author = "D. S. Johnson and C. H. Papadimitriou and M. Yannakakis", title = "How easy is local search", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "39--42", } @InProceedings{Ja'Ja'85, author = "J. Ja'Ja'", title = "Identification is easier than decoding", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "43--50", } @InProceedings{Ambos-Spies85, author = "K. Ambos-Spies", title = "Three theorems on polynomial degrees of {NP}-sets", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "51--55", } @InProceedings{Li85, author = "M. Li", title = "Simulating two pushdown stores by one tape in $ {O}(n^{1.5} \sqrt{\log n} ) $ time", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "56--64", } @InProceedings{MeyeraufderHeide85, author = "F. MeyeraufderHeide", title = "Nondeterministic versus probabilistic linear search algorithms", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "65--73", } @InProceedings{PapWol85, author = "C. H. Papadimitriou and D. Wolfe", title = "The complexity of facets resolved", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "74--78", } @InProceedings{HocShm85, author = "D. S. Hochbaum and D. B. Shmoys", title = "Using dual approximation algorithms for scheduling problems: Theoretical and practical results", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "79--89", } @InProceedings{Gabow85, author = "H. N. Gabow", title = "A scaling algorithm for weighted matching on general graphs", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "90--100", } @InProceedings{MofTak85, author = "A. Moffat and T. Takaoka", title = "An all pairs shortest path algorithm with expected running time $ {O}(n^2 \log n) $", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "101--105", } @InProceedings{GabHsuSup85, author = "C. P. Gabor and W. -L. Hsu and K. J. Supowit", title = "Recognizing circle graphs in polynomial time", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "106--116", } @InProceedings{BerLawWon85, author = "M. W. Bern and E. L. Lawler and A. L. Wong", title = "Why certain subgraph computations require only linear time", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "117--125", } @InProceedings{LanVis85, author = "G. M. Landau and U. Vishkin", title = "Efficient string matching in the presence of errors", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "126--136", } @InProceedings{HirLar85, author = "D. S. Hirschberg and L. L. Larmore", title = "The least weight subsequence problem", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "137--143", } @InProceedings{ReiSha85, author = "J. Reif and M. Sharir", title = "Motion planning in the presence of moving obstacles", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "144--154", } @InProceedings{AsanoEtAl85, author = "TakaoAsano and TetsuoAsano and L. Guibas and J. Hershberger and H. Imai", title = "Visibility-polygon search and Euclidean shortest paths", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "155--164", } @InProceedings{Chazelle85, author = "B. Chazelle", title = "Slimming down search structures: {A} functional approach to algorithm design", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "165--174", } @InProceedings{KirPap85, author = "L. M. Kirousis and C. H. Papadimitriou", title = "The complexity of recognizing polyhedral scenes", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "175--185", } @InProceedings{AggarwalEtAl85, author = "A. Aggarwal and M. Klawe and D. Lichtenstein and N. Linial and A. Wigderson", title = "Multi-layer grid embeddings", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "186--196", } @InProceedings{Vitanyi85, author = "P. M. B. Vitanyi", title = "Area penalty for sublinear signal propagation delay on chip", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "197--207", } @InProceedings{ColSie85, author = "R. Cole and A. Siegel", title = "On information flow and sorting: New upper and lower bounds for {VLSI} circuits", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "208--221", } @InProceedings{AtaHam85, author = "M. J. Atallah and S. E. Hambrusch", title = "Solving tree problems on a mesh-connected processor array", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "222--231", } @InProceedings{Huang85, author = "M. -D. A. Huang", title = "Solving some graph problems with optimal or near-optimal speedup on mesh-of-trees networks", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "232--240", } @InProceedings{GreLei85, author = "R. I. Greenberg and C. E. Leiserson", title = "Randomized routing on fat-trees", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "241--249", } @InProceedings{AweGal85, author = "B. Awerbuch and R. G. Gallager", title = "Distributed {BFS} algorithms", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "250--256", } @InProceedings{ChiTin85, author = "F. Chin and H. F. Ting", title = "An almost linear time and $ {O}(n \log n+e) $ messages distributed algorithm for minimum-weight spanning trees", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "257--266", } @InProceedings{FelMic85, author = "P. Feldman and S. Micali", title = "Byzantine agreement in constant expected time (and trusting no one)", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "267--276", } @InProceedings{AloFraRod85, author = "N. Alon and P. Frankl and V. Rodl", title = "Geometrical realization of set systems and probabilistic communication complexity", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "277--280", } @InProceedings{CelLarMun85, author = "P. Celis and P. -A. Larson and J. I. Munro", title = "Robin Hood hashing", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "281--288", } @InProceedings{FisPat85, author = "M. J. Fischer and M. S. Paterson", title = "Dynamic monotone priorities on planar sets", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "289--292", } @InProceedings{Vitter85, author = "J. S. Vitter", title = "Design and analysis of dynamic Huffman coding", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "293--302", } @InProceedings{Mairson85, author = "H. G. Mairson", title = "Average case lower bounds on the construction and searching of partial orders", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "303--311", } @InProceedings{ShaLiv85, author = "M. Sharir and R. Livne", title = "On minima of functions, intersection patterns of curves, and Davenport-Schinzel sequences", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "312--320", } @InProceedings{Rudich85, author = "S. Rudich", title = "Inferring the structure of a Markov chain from its output", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "321--326", } @InProceedings{Vardi85, author = "M. Y. Vardi", title = "Automatic verification of probabilistic concurrent finite-state programs", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "327--338", } @InProceedings{Boehm85, author = "H. -J. Boehm", title = "Partial polymorphic type inference is undecidable", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "339--345", } @InProceedings{GurShe85, author = "Y. Gurevich and S. Shelah", title = "Fixed-point extensions of first-order logic", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "346--353", } @InProceedings{Courcelle85, author = "B. Courcelle", title = "Equivalences and transformations of recursive definitions", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "354--359", } @InProceedings{GalHabYun85, author = "Z. Galil and S. Haber and M. Yung", title = "A private interactive test of a Boolean predicate and minimum-knowledge public-key cryptosystems", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "360--371", } @InProceedings{CohFis85, author = "J. D. Cohen and M. J. Fischer", title = "A robust and verifiable cryptographically secure election scheme", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "372--382", } @InProceedings{ChorEtAl85, author = "B. Chor and S. Goldwasser and S. Micali and B. Awerbuch", title = "Verifiable secret sharing and achieving simultaneity in the presence of faults", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "383--395", } @InProceedings{ChorEtAl85, author = "B. Chor and O. Goldreich and J. Hastad and J. Friedman and S. Rudich and R. Smolensky", title = "The bit extraction problem of t-resilient functions", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "396--407", } @InProceedings{BenLin85, author = "M. Ben-Or and N. Linial", title = "Collective coin flipping, robust voting schemes and minima of Banzhaf values", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "408--416", } @InProceedings{VazVaz85, author = "U. V. Vazirani and V. V. Vazirani", title = "Random polynomial time is equal to slightly-random polynomial time", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "417--428", } @InProceedings{ChoGol85, author = "B. Chor and O. Goldreich", title = "Unbiased bits from sources of weak randomness and probabilistic communication complexity", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "429--442", } @InProceedings{BacSha85, author = "E. Bach and J. Shallit", title = "Factoring with cyclotomic polynomials", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "443--450", } @InProceedings{Kaltofen85, author = "E. Kaltofen", title = "Computing with polynomials given by straight-line programs {II} sparse factorization", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "451--458", } @InProceedings{FraTar85, author = "A. Frank and E. Tardos", title = "An application of simultaneous approximation in combinatorial optimization", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "459--463", } @InProceedings{Lovasz85, author = "L. Lovasz", title = "Computing ears and branchings in parallel", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "464--467", } @InProceedings{AggarwalEtAl85, author = "A. Aggarwal and B. Chazelle and L. Guibas and C. O'Dunlaing and C. Yap", title = "Parallel computational geometry", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "468--477", } @InProceedings{MilRei85, author = "G. L. Miller and J. H. Reif", title = "Parallel tree contraction and its application", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "478--489", } @InProceedings{GalPan85, author = "Z. Galil and V. Pan", title = "Improved processor bounds for algebraic and combinatorial problems in {RNC}", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "490--495", } @InProceedings{Reif85, author = "J. H. Reif", title = "An optimal parallel algorithm for integer sorting", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "496--504", } @InProceedings{LukMcK85, author = "E. M. Luks and P. McKenzie", title = "Fast parallel computation with permutation groups", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "505--514", } @InProceedings{KozYap85, author = "D. Kozen and C. -K. Yap", title = "Algebraic cell decomposition in {NC}", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "515--521", } @InProceedings{Pan85, author = "V. Pan", title = "Fast and efficient algorithms for sequential and parallel evaluation of polynomial zeros and of matrix polynomials", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "522--531", } @InProceedings{MeyWig85, author = "F. MeyeraufderHeide and A. Wigderson", title = "The complexity of parallel sorting", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "532--540", } @InProceedings{KarUpfWig85, author = "R. M. Karp and E. Upfal and A. Wigderson", title = "The complexity of parallel computation on matroids", booktitle = "Proc.\ 26th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1985", pages = "541--550", } @InProceedings{Barrington86, author = "D. Barrington", title = "Bounded-width polynomial-size branching programs recognize exactly those languages in $\mbox{NC}^1$", booktitle = "Proc.\ 18th ACM Symposium on Theory of Computing (STOC)", year = "1986", pages = "1--5", } @InProceedings{Hastad86, author = "J. Hastad", title = "Almost optimal lower bounds for small depth circuits", booktitle = "Proc.\ 18th ACM Symposium on Theory of Computing (STOC)", year = "1986", pages = "6--20", } @InProceedings{Cai86, author = "J. Cai", title = "With probability one, a random oracle separates {PSPACE} from the polynomial-time hierarchy", booktitle = "Proc.\ 18th ACM Symposium on Theory of Computing (STOC)", year = "1986", pages = "21--29", } @InProceedings{AjtaiEtAl86, author = "M. Ajtai and L. Babai and P. Hajnal and J. Komlos and P. Pudlak and V. Rodl and E. Szemeredi and Gy. Turan", title = "Two lower bounds for branching programs", booktitle = "Proc.\ 18th ACM Symposium on Theory of Computing (STOC)", year = "1986", pages = "30--38", } @InProceedings{GalKanSze86, author = "Z. Galil and R. Kannan and E. Szemeredi", title = "On nontrivial separators for $ k $-page graphs and simulations by nondeterministic one tape Turing machines", booktitle = "Proc.\ 18th ACM Symposium on Theory of Computing (STOC)", year = "1986", pages = "39--49", } @InProceedings{Broder86, author = "A. Z. Broder", title = "How hard is to marry at random? (on the approximation of the permanent)", booktitle = "Proc.\ 18th ACM Symposium on Theory of Computing (STOC)", year = "1986", pages = "50--58", } @InProceedings{GolSip86, author = "S. Goldwasser and M. Sipser", title = "Private coins versus public coins in interactive proof systems", booktitle = "Proc.\ 18th ACM Symposium on Theory of Computing (STOC)", year = "1986", pages = "59--68", } @InProceedings{Krentel86, author = "M. W. Krentel", title = "The complexity of optimization problems", booktitle = "Proc.\ 18th ACM Symposium on Theory of Computing (STOC)", year = "1986", pages = "69--76", } @InProceedings{CofLei86, author = "Jr. E. G. Coffman and F. T. Leighton", title = "A provably efficient algorithm for dynamic storage allocation", booktitle = "Proc.\ 18th ACM Symposium on Theory of Computing (STOC)", year = "1986", pages = "77--90", } @InProceedings{LeiSho86, author = "T. Leighton and P. Shor", title = "Tight bounds for minimax grid matching, with applications to the average case analysis of algorithms", booktitle = "Proc.\ 18th ACM Symposium on Theory of Computing (STOC)", year = "1986", pages = "91--103", } @InProceedings{Yannakakis86, author = "M. Yannakakis", title = "Four pages are necessary and sufficient for planar graphs", booktitle = "Proc.\ 18th ACM Symposium on Theory of Computing (STOC)", year = "1986", pages = "104--108", } @InProceedings{DriscollEtAl86, author = "J. R. Driscoll and N. Sarnak and D. D. Sleator and R. E. Tarjan", title = "Making data structures persistent", booktitle = "Proc.\ 18th ACM Symposium on Theory of Computing (STOC)", year = "1986", pages = "109--121", } @InProceedings{SleTarThu86, author = "D. D. Sleator and R. E. Tarjan and W. P. Thurston", title = "Rotation distance, triangulations, and hyperbolic geometry", booktitle = "Proc.\ 18th ACM Symposium on Theory of Computing (STOC)", year = "1986", pages = "122--135", } @InProceedings{GolTar86, author = "A. V. Goldberg and R. E. Tarjan", title = "A new approach to the maximum flow problem", booktitle = "Proc.\ 18th ACM Symposium on Theory of Computing (STOC)", year = "1986", pages = "136--146", } @InProceedings{KapVai86, author = "S. Kapoor and P. M. Vaidya", title = "Fast algorithms for convex quadratic programming and multicommodity flows", booktitle = "Proc.\ 18th ACM Symposium on Theory of Computing (STOC)", year = "1986", pages = "147--159", } @InProceedings{KarUpf86, author = "A. R. Karlin and E. Upfal", title = "Parallel hashing --- An efficient implementation of shared memory", booktitle = "Proc.\ 18th ACM Symposium on Theory of Computing (STOC)", year = "1986", pages = "160--168", } @InProceedings{Beame86, author = "P. Beame", title = "Limits on the power of concurrent-write parallel machines", booktitle = "Proc.\ 18th ACM Symposium on Theory of Computing (STOC)", year = "1986", pages = "169--176", } @InProceedings{LiYes86, author = "M. Li and Y. Yesha", title = "New lower bounds for parallel computation", booktitle = "Proc.\ 18th ACM Symposium on Theory of Computing (STOC)", year = "1986", pages = "177--187", } @InProceedings{AjtaiEtAl86, author = "M. Ajtai and J. Komlos and W. L. Steiger and E. Szemeredi", title = "Deterministic selection in ${O}(\log\log {N})$ parallel time", booktitle = "Proc.\ 18th ACM Symposium on Theory of Computing (STOC)", year = "1986", pages = "188--195", } @InProceedings{LueMegRam86, author = "G. S. Lueker and N. Megiddo and V. Ramachandran", title = "Linear programming with two variables per inequality in poly-log time", booktitle = "Proc.\ 18th ACM Symposium on Theory of Computing (STOC)", year = "1986", pages = "196--205", } @InProceedings{ColVis86, author = "R. Cole and U. Vishkin", title = "Deterministic coin tossing and accelerating cascades: Micro and macro techniques for designing parallel algorithms", booktitle = "Proc.\ 18th ACM Symposium on Theory of Computing (STOC)", year = "1986", pages = "206--219", } @InProceedings{LanVis86, author = "G. M. Landau and U. Vishkin", title = "Introducing efficient parallelism into approximate string matching and a new serial algorithm", booktitle = "Proc.\ 18th ACM Symposium on Theory of Computing (STOC)", year = "1986", pages = "220--230", } @InProceedings{Kosaraju86, author = "S. R. Kosaraju", title = "Parallel evaluation of division-free arithmetic expressions", booktitle = "Proc.\ 18th ACM Symposium on Theory of Computing (STOC)", year = "1986", pages = "231--239", } @InProceedings{LubPhiSar86, author = "A. Lubotzky and R. Phillips and P. Sarnak", title = "Explicit expanders and the Ramanujan conjectures", booktitle = "Proc.\ 18th ACM Symposium on Theory of Computing (STOC)", year = "1986", pages = "240--246", } @InProceedings{FelFriPip86, author = "P. Feldman and J. Friedman and N. Pippenger", title = "Non-blocking networks", booktitle = "Proc.\ 18th ACM Symposium on Theory of Computing (STOC)", year = "1986", pages = "247--254", } @InProceedings{SchSha86, author = "C. P. Schnorr and A. Shamir", title = "An optimal sorting algorithm for mesh connected computers", booktitle = "Proc.\ 18th ACM Symposium on Theory of Computing (STOC)", year = "1986", pages = "255--263", } @InProceedings{KosAta86, author = "S. R. Kosaraju and M. J. Atallah", title = "Optimal simulations between mesh-connected arrays of processors", booktitle = "Proc.\ 18th ACM Symposium on Theory of Computing (STOC)", year = "1986", pages = "264--272", } @InProceedings{BlumerEtAl86, author = "A. Blumer and A. Ehrenfeucht and D. Haussler and M. Warmuth", title = "Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension", booktitle = "Proc.\ 18th ACM Symposium on Theory of Computing (STOC)", year = "1986", pages = "273--282", } @InProceedings{CouVarWol86, author = "C. Courcoubetis and M. Y. Vardi and P. Wolper", title = "Reasoning about fair concurrent programs", booktitle = "Proc.\ 18th ACM Symposium on Theory of Computing (STOC)", year = "1986", pages = "283--294", } @InProceedings{KoLonDu86, author = "K. -I. Ko and T. J. Long and D. -Z. Du", title = "A note on one-way functions and polynomial-time isomorphisms", booktitle = "Proc.\ 18th ACM Symposium on Theory of Computing (STOC)", year = "1986", pages = "295--303", } @InProceedings{HalVar86, author = "J. Y. Halpern and M. Y. Vardi", title = "The complexity of reasoning about knowledge and time", booktitle = "Proc.\ 18th ACM Symposium on Theory of Computing (STOC)", year = "1986", pages = "304--315", } @InProceedings{GolKil86, author = "S. Goldwasser and J. Kilian", title = "Almost all primes can be quickly certified", booktitle = "Proc.\ 18th ACM Symposium on Theory of Computing (STOC)", year = "1986", pages = "316--329", } @InProceedings{Kaltofen86, author = "E. Kaltofen", title = "Uniform closure properties of {P}-computable functions", booktitle = "Proc.\ 18th ACM Symposium on Theory of Computing (STOC)", year = "1986", pages = "330--337", } @InProceedings{Mulmuley86, author = "K. Mulmuley", title = "A fast parallel algorithm to compute the rank of a matrix over an arbitrary field", booktitle = "Proc.\ 18th ACM Symposium on Theory of Computing (STOC)", year = "1986", pages = "338--339", } @InProceedings{Ben-OrEtAl86, author = "M. Ben-Or and E. Feig and D. Kozen and P. Tiwari", title = "A fast parallel algorithm for determining all roots of a polynomial with real roots", booktitle = "Proc.\ 18th ACM Symposium on Theory of Computing (STOC)", year = "1986", pages = "340--349", } @InProceedings{AdlLen86, author = "L. M. Adleman and Jr. H. W. Lenstra", title = "Finding irreducible polynomials over finite fields", booktitle = "Proc.\ 18th ACM Symposium on Theory of Computing (STOC)", year = "1986", pages = "350--355", } @InProceedings{LubRac86, author = "M. Luby and C. Rackoff", title = "Pseudo-random permutation generators and cryptographic composition", booktitle = "Proc.\ 18th ACM Symposium on Theory of Computing (STOC)", year = "1986", pages = "356--363", } @InProceedings{Cleve86, author = "R. Cleve", title = "Limits on the security of coin flips when half the processors are faulty", booktitle = "Proc.\ 18th ACM Symposium on Theory of Computing (STOC)", year = "1986", pages = "364--369", } @InProceedings{DworkEtAl86, author = "C. Dwork and D. Peleg and N. Pippenger and E. Upfal", title = "Fault tolerance in networks of bounded degree", booktitle = "Proc.\ 18th ACM Symposium on Theory of Computing (STOC)", year = "1986", pages = "370--379", } @InProceedings{TarVan86, author = "R. E. Tarjan and C. J. VanWyk", title = "A linear-time algorithm for triangulating simple polygons", booktitle = "Proc.\ 18th ACM Symposium on Theory of Computing (STOC)", year = "1986", pages = "380--388", } @InProceedings{EdeGui86, author = "H. Edelsbrunner and L. J. Guibas", title = "Topologically sweeping an arrangement", booktitle = "Proc.\ 18th ACM Symposium on Theory of Computing (STOC)", year = "1986", pages = "389--403", } @InProceedings{Seidel86, author = "R. Seidel", title = "Constructing higher-dimensional convex hulls at logarithmic cost per face", booktitle = "Proc.\ 18th ACM Symposium on Theory of Computing (STOC)", year = "1986", pages = "404--413", } @InProceedings{Clarkson86, author = "K. L. Clarkson", title = "Further applications of random sampling to computational geometry", booktitle = "Proc.\ 18th ACM Symposium on Theory of Computing (STOC)", year = "1986", pages = "414--423", } @InProceedings{DobEdeYap86, author = "D. Dobkin and H. Edelsbrunner and C. K. Yap", title = "Probing convex polytopes", booktitle = "Proc.\ 18th ACM Symposium on Theory of Computing (STOC)", year = "1986", pages = "424--432", } @InProceedings{Bern86, author = "M. W. Bern", title = "Two probabilistic results on rectilinear Steiner trees", booktitle = "Proc.\ 18th ACM Symposium on Theory of Computing (STOC)", year = "1986", pages = "433--441", } @InProceedings{BarFur86, author = "I. Barany and Z. Furedi", title = "Computing the volume is difficult", booktitle = "Proc.\ 18th ACM Symposium on Theory of Computing (STOC)", year = "1986", pages = "442--447", } @InProceedings{Siegel86, author = "A. Siegel", title = "Aspects of information flow in {VLSI} circuits", booktitle = "Proc.\ 18th ACM Symposium on Theory of Computing (STOC)", year = "1986", pages = "448--459", } @InProceedings{GalTar86, author = "Z. Galil and E. Tardos", title = "An $ {O}(n^2 (m+n\log n)\log n) $ min-cost flow algorithm", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "1--9", } @InProceedings{Raghavan86, author = "P. Raghavan", title = "Probabilistic construction of deterministic algorithms: Approximating packing integer programs", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "10--18", } @InProceedings{KarSakWig86, author = "R. M. Karp and M. Saks and A. Wigderson", title = "On a search problem related to branch-and-bound procedures", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "19--28", } @InProceedings{SakWig86, author = "M. Saks and A. Wigderson", title = "Probabilistic Boolean decision trees and the complexity of evaluating game trees", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "29--38", } @InProceedings{LinLovWig86, author = "N. Linial and L. Lovasz and A. Wigderson", title = "A physical interpretation of graph connectivity, and its algorithmic applications", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "39--48", } @InProceedings{Strassen86, author = "V. Strassen", title = "The asymptotic spectrum of tensors and the exponent of matrix multiplication", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "49--54", } @InProceedings{AhoLee86, author = "A. V. Aho and D. Lee", title = "Storing a dynamic sparse table", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "55--60", } @InProceedings{Wilber86, author = "R. E. Wilber", title = "Lower bounds for accessing binary search trees with rotations", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "61--70", } @InProceedings{Mutchler86, author = "D. Mutchler", title = "What search algorithm gives optimal average-case performance when search resources are highly limited?", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "71--76", } @InProceedings{SharirEtAl86, author = "M. Sharir and R. Cole and K. Kedem and D. Leven and R. Pollack and S. Sifrony", title = "Geometric applications of Davenport-Schinzel sequences", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "77--86", } @InProceedings{Chazelle86, author = "B. Chazelle", title = "Lower bounds on the complexity of multidimensional searching", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "87--96", } @InProceedings{Wiernik86, author = "A. Wiernik", title = "Planar realizations of nonlinear Davenport-Schinzel sequences by segments", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "97--106", } @InProceedings{Hong86, author = "J. Hong", title = "Proving by example and gap theorems", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "107--116", } @InProceedings{Vaidya86, author = "P. M. Vaidya", title = "An optimal algorithm for the all-nearest-neighbors problem", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "117--122", } @InProceedings{PlaDye86, author = "W. H. Plantinga and C. R. Dyer", title = "An algorithm for constructing the aspect graph", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "123--131", } @InProceedings{Natarajan86, author = "B. K. Natarajan", title = "An algorithmic approach to the automated design of parts orienters", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "132--142", } @InProceedings{GreYao86, author = "D. H. Greene and F. F. Yao", title = "Finite-resolution computational geometry", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "143--152", } @InProceedings{Friedman86, author = "J. Friedman", title = "On Newton's method for polynomials", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "153--161", } @InProceedings{Yao86, author = "A. C. -C. Yao", title = "How to generate and exchange secrets", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "162--167", } @InProceedings{BraCreRob86, author = "G. Brassard and C. Crepeau and J. -M. Robert", title = "Information theoretic reductions among disclosure problems", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "168--173", } @InProceedings{GolMicWig86, author = "O. Goldreich and S. Micali and A. Wigderson", title = "Proofs that yield nothing but their validity and a methodology of cryptographic protocol design", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "174--187", } @InProceedings{BraCre86, author = "G. Brassard and C. Crepeau", title = "Non-transitive transfer of confidence: {A} {\em perfect} zero-knowledge interactive protocol for {SAT} and beyond", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "188--195", } @InProceedings{AweMic86, author = "B. Awerbuch and S. Micali", title = "Dynamic deadlock resolution protocols", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "196--207", } @InProceedings{MosTut86, author = "Y. Moses and M. R. Tuttle", title = "Programming simultaneous actions using common knowledge", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "208--221", } @InProceedings{DwoShmSto86, author = "C. Dwork and D. Shmoys and L. Stockmeyer", title = "Flipping persuasively in constant expected time", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "222--232", } @InProceedings{VitAwe86, author = "P. M. B. Vitanyi and B. Awerbuch", title = "Atomic shared register access by asynchronous hardware", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "233--243", } @InProceedings{KarlinEtAl86, author = "A. R. Karlin and M. S. Manasse and L. Rudolph and D. D. Sleator", title = "Competitive snoopy caching", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "244--254", } @InProceedings{MaSenSch86, author = "Y. Ma and S. Sen and I. D. Scherson", title = "The distance bound for sorting on mesh-connected processor arrays is tight", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "255--263", } @InProceedings{Stout86, author = "Q. F. Stout", title = "Meshes with multiple buses", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "264--273", } @InProceedings{BhattEtAl86, author = "S. Bhatt and F. Chung and T. Leighton and A. Rosenberg", title = "Optimal simulations of tree machines", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "274--282", } @InProceedings{BecSim86, author = "B. Becker and H. -U. Simon", title = "How robust is the n-cube?", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "283--291", } @InProceedings{Luks86, author = "E. M. Luks", title = "Parallel algorithms for permutation groups and graph isomorphism", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "292--302", } @InProceedings{Babai86, author = "L. Babai", title = "A Las Vegas-{NC} algorithm for isomorphism of graphs with bounded multiplicity of eigenvalues", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "303--312", } @InProceedings{GarZal86, author = "M. Garzon and Y. Zalcstein", title = "The complexity of isomorphism testing", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "313--321", } @InProceedings{FloKar86, author = "S. Floyd and R. Karp", title = "{FFD} bin packing for item sizes with distributions on [0,1/2]", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "322--330", } @InProceedings{DyeFri86, author = "M. E. Dyer and A. M. Frieze", title = "Fast solution of some random {NP}-hard problems", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "331--336", } @InProceedings{BabFraSim86, author = "L. Babai and P. Frankl and J. Simon", title = "Complexity classes in communication complexity theory", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "337--347", } @InProceedings{VenTom86, author = "H. Venkateswaran and M. Tompa", title = "A new pebble game that characterizes parallel complexity classes", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "348--360", } @InProceedings{ChrLi86, author = "M. Chrobak and M. Li", title = "$ k+1 $ heads are better than $ k $ for {PDA}'s", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "361--367", } @InProceedings{AieGolHas86, author = "W. Aiello and S. Goldwasser and J. Hastad", title = "On the power of interaction", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "368--379", } @InProceedings{KurMahRoy86, author = "S. A. Kurtz and S. R. Mahaney and J. S. Royer", title = "Collapsing degrees", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "380--389", } @InProceedings{GolJos86, author = "J. Goldsmith and D. Joseph", title = "Three results on the polynomial isomorphism of complete sets", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "390--397", } @InProceedings{VonzurGathen86, author = "J. VonzurGathen", title = "Permanent and determinant", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "398--401", } @InProceedings{Abrahamson86, author = "K. Abrahamson", title = "Time-space tradeoffs for branching programs contrasted with those for straight-line programs", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "402--409", } @InProceedings{AloMaa86, author = "N. Alon and W. Maass", title = "Meanders, Ramsey theory and lower bounds for branching programs", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "410--417", } @InProceedings{PelUpf86, author = "D. Peleg and E. Upfal", title = "The token distribution problem", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "418--427", } @InProceedings{FreJan86, author = "G. N. Frederickson and R. Janardan", title = "Separator-based strategies for efficient message routing", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "428--437", } @InProceedings{UllVan86, author = "J. D. Ullman and A. VanGelder", title = "Parallel complexity of logical query programs", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "438--454", } @InProceedings{ChaIbaVer86, author = "J. H. Chang and O. H. Ibarra and A. Vergis", title = "On the power of one-way communication", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "455--464", } @InProceedings{KleRei86, author = "P. N. Klein and J. H. Reif", title = "An efficient parallel algorithm for planarity", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "465--477", } @InProceedings{ColVis86, author = "R. Cole and U. Vishkin", title = "Approximate and exact parallel scheduling with applications to list, tree and graph problems", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "478--491", } @InProceedings{Gazit86, author = "H. Gazit", title = "An optimal randomized parallel algorithm for finding connected components in a graph", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "492--501", } @InProceedings{AloAzaVis86, author = "N. Alon and Y. Azar and U. Vishkin", title = "Tight complexity bounds for parallel comparison sorting", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "502--510", } @InProceedings{Cole86, author = "R. Cole", title = "Parallel merge sort", booktitle = "Proc.\ 27th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1986", pages = "511--516", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{86, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{Chazelle87, author = "B. Chazelle", title = "Polytope range searching and integral geometry", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "1--10", } @InProceedings{GhoMou87, author = "S. K. Ghosh and D. M. Mount", title = "An output sensitive algorithm for computing visibility graphs", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "11--19", } @InProceedings{DobFriSup87, author = "D. P. Dobkin and S. J. Friedman and K. J. Supowit", title = "Delaunay graphs are almost as good as complete graphs", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "20--26", } @InProceedings{EdelsbrunnerEtAl87, author = "H. Edelsbrunner and J. Pach and J. T. Schwartz and M. Sharir", title = "On the lower envelope of bivariate functions and its applications", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "27--37", } @InProceedings{Canny87, author = "J. Canny", title = "A new algebraic method for robot motion planning and real geometry", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "39--48", } @InProceedings{CanRei87, author = "J. Canny and J. Reif", title = "New lower bound techniques for robot motion planning problems", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "49--60", } @InProceedings{BerRoo87, author = "P. Berman and R. Roos", title = "Learning one-counter languages in polynomial time", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "61--67", } @InProceedings{Littlestone87, author = "N. Littlestone", title = "Learning quickly when irrelevant attributes abound: {A} new linear-threshold algorithm", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "68--77", } @InProceedings{RivSch87, author = "R. L. Rivest and R. E. Schapire", title = "Diversity-based inference of finite automata", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "78--87", } @InProceedings{GroRag87, author = "V. Grolmusz and P. Ragde", title = "Incomparability in parallel computation", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "89--98", } @InProceedings{HajnalEtAl87, author = "A. Hajnal and W. Maass and P. Pudlak and M. Szegedy and Gy. Turan", title = "Threshold circuits of bounded depth", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "99--110", } @InProceedings{Gurevich87, author = "Y. Gurevich", title = "Complete and incomplete randomized {NP} problems", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "111--117", } @InProceedings{BluImp87, author = "M. Blum and R. Impagliazzo", title = "Generic oracles and oracle classes", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "118--126", } @InProceedings{VonKozLan87, author = "J. VonzurGathen and D. Kozen and S. Landau", title = "Functional decomposition of polynomials", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "127--131", } @InProceedings{Ronyai87, author = "L. Ronyai", title = "Factoring polynomials over finite fields", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "132--137", } @InProceedings{KamBsh87, author = "M. Kaminski and N. H. Bshouty", title = "Multiplicative complexity of polynomial multiplication over finite fields", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "138--140", } @InProceedings{MirSch87, author = "R. Mirwald and C. P. Schnorr", title = "The multiplicative complexity of quadratic Boolean forms", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "141--150", } @InProceedings{AtaColGoo87, author = "M. J. Atallah and R. Cole and M. T. Goodrich", title = "Cascading divide-and-conquer: {A} technique for designing parallel algorithms", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "151--160", } @InProceedings{GolSpe87, author = "M. Goldberg and T. Spencer", title = "A new parallel algorithm for the maximal independent set problem", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "161--165", } @InProceedings{GriKar87, author = "D. Yu. Grigoriev and M. Karpinski", title = "The matching problem for bipartite graphs with polynomially bounded permanents is in {NC}", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "166--172", } @InProceedings{PanRei87, author = "V. Pan and J. Reif", title = "Some polynomial and Toeplitz matrix computations", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "173--184", } @InProceedings{Ranade87, author = "A. G. Ranade", title = "How to emulate shared memory", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "185--194", } @InProceedings{GerKri87, author = "M. Gereb-Graus and D. Krizanc", title = "The complexity of parallel comparison merging", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "195--201", } @InProceedings{AggChaSni87, author = "A. Aggarwal and A. K. Chandra and M. Snir", title = "Hierarchical memory with block transfer", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "204--216", } @InProceedings{LenShmTar87, author = "J. K. Lenstra and D. B. Shmoys and E. Tardos", title = "Approximation algorithms for scheduling unrelated parallel machines", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "217--224", } @InProceedings{Rao87, author = "S. Rao", title = "Finding near optimal separators in planar graphs", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "225--237", } @InProceedings{GazMil87, author = "H. Gazit and G. L. Miller", title = "A parallel algorithm for finding a separator in planar graphs", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "238--248", } @InProceedings{Matula87, author = "D. W. Matula", title = "Determining edge connectivity in $ {O}(nm) $", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "249--251", } @InProceedings{KanRam87, author = "A. Kanevsky and V. Ramachandran", title = "Improved algorithms for graph four-connectivity", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "252--259", } @InProceedings{CopRagTom87, author = "D. Coppersmith and P. Raghavan and M. Tompa", title = "Parallel graph algorithms that are efficient on average", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "260--269", } @InProceedings{Kucera87, author = "L. Kucera", title = "Canonical labeling of regular graphs in linear average time", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "271--279", } @InProceedings{Boppana87, author = "R. B. Boppana", title = "Eigenvalues and graph bisection: An average-case analysis", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "280--285", } @InProceedings{BroSha87, author = "A. Broder and E. Shamir", title = "On the second eigenvalue of random regular graphs", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "286--294", } @InProceedings{Ajtai87, author = "M. Ajtai", title = "Recursive construction for 3-regular expanders", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "295--304", } @InProceedings{KilKipLei87, author = "J. Kilian and S. Kipnis and C. E. Leiserson", title = "The organization of permutation architectures with bussed interconnections", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "305--315", } @InProceedings{GaoKau87, author = "S. Gao and M. Kaufmann", title = "Channel routing of multiterminal nets", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "316--325", } @InProceedings{DurGal87, author = "P. Duris and Z. Galil", title = "Two lower bounds in asynchronous distributed computation", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "326--330", } @InProceedings{Linial87, author = "N. Linial", title = "Distributive graph algorithms --- Global solutions from local data", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "331--335", } @InProceedings{AttiyaEtAl87, author = "H. Attiya and A. Bar-Noy and D. Dolev and D. Koller and D. Peleg and R. Reischuk", title = "Achievable cases in an asynchronous environment", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "337--346", } @InProceedings{AfekEtAl87, author = "Y. Afek and B. Awerbuch and S. A. Plotkin and M. Saks", title = "Local management of a global resource in a communication network", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "347--357", } @InProceedings{AfeAweGaf87, author = "Y. Afek and B. Awerbuch and E. Gafni", title = "Applying static network protocols to dynamic networks", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "358--370", } @InProceedings{IsrLi87, author = "A. Israeli and M. Li", title = "Bounded time-stamps", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "371--382", } @InProceedings{PetBur87, author = "G. L. Peterson and J. E. Burns", title = "Concurrent reading while writing {II}: The multi-writer case", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "383--392", } @InProceedings{Yao87, author = "A. C. -C. Yao", title = "Lower bounds to randomized algorithms for graph properties", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "393--400", } @InProceedings{HirVav87, author = "M. D. Hirsch and S. Vavasis", title = "Exponential lower bounds for finding Brouwer fixed points", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "401--410", } @InProceedings{Cosmadakis87, author = "S. S. Cosmadakis", title = "Database theory and cylindric lattices", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "411--420", } @InProceedings{Stern87, author = "J. Stern", title = "Secret linear congruential generators are not cryptographically secure", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "421--426", } @InProceedings{Feldman87, author = "P. Feldman", title = "A practical scheme for non-interactive verifiable secret sharing", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "427--437", } @InProceedings{AieHas87, author = "W. Aiello and J. Hastad", title = "Perfect zero-knowledge languages can be recognized in two rounds", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "439--448", } @InProceedings{GolManSip87, author = "O. Goldreich and Y. Mansour and M. Sipser", title = "Interactive proof systems: Provers that never fail and random selection", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "449--461", } @InProceedings{Oren87, author = "Y. Oren", title = "On the cunning power of cheating verifiers: Some observations about zero knowledge proofs", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "462--471", } @InProceedings{TomWol87, author = "M. Tompa and H. Woll", title = "Random self-reducibility and zero knowledge interactive proofs of possession of information", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "472--482", } @InProceedings{AloAza87, author = "N. Alon and Y. Azar", title = "The average complexity of deterministic and randomized parallel comparison sorting algorithms", booktitle = "Proc.\ 28th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1987", pages = "489--498", } @InProceedings{BenGolWig88, author = "M. Ben-Or and S. Goldwasser and A. Wigderson", title = "Completeness theorems for non-cryptographic fault-tolerant distributed computation", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "1--10", } @InProceedings{ChaCreDam88, author = "D. Chaum and C. Crepeau and I. Damgaard", title = "Multiparty unconditionally secure protocols", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "11--19", } @InProceedings{Kilian88, author = "J. Kilian", title = "Founding cryptography on oblivious transfer", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "20--31", } @InProceedings{BelMic88, author = "M. Bellare and S. Micali", title = "How to sign given any trapdoor function", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "32--42", } @InProceedings{PelUpf88, author = "D. Peleg and E. Upfal", title = "A tradeoff between space and efficiency for routing tables", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "43--52", } @InProceedings{HalVar88, author = "J. Y. Halpern and M. Y. Vardi", title = "Reasoning about knowledge and time in asynchronous systems", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "53--65", } @InProceedings{BerSim88, author = "P. Berman and J. Simon", title = "Investigations of fault-tolerant networks of computers", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "66--77", } @InProceedings{DolGafSha88, author = "D. Dolev and E. Gafni and N. Shavit", title = "Toward a non-atomic era: $l$-exclusion as a test case", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "78--92", } @InProceedings{KriPelUpf88, author = "D. Krizanc and D. Peleg and E. Upfal", title = "A time-randomness tradeoff for oblivious routing", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "93--102", } @InProceedings{BluFelMic88, author = "M. Blum and P. Feldman and S. Micali", title = "Non-interactive zero-knowledge and its applications", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "103--112", } @InProceedings{Ben-OrEtAl88, author = "M. Ben-Or and S. Goldwasser and J. Kilian and A. Wigderson", title = "Multi-prover interactive proofs: How to remove intractability assumptions", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "113--131", } @InProceedings{HalMosTut88, author = "J. Y. Halpern and Y. Moses and M. R. Tuttle", title = "A knowledge-based analysis of zero knowledge", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "132--147", } @InProceedings{FelMic88, author = "P. Feldman and S. Micali", title = "Optimal algorithms for Byzantine agreement", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "148--161", } @InProceedings{HalRei88, author = "B. Halstenberg and R. Reischuk", title = "On different modes of communication", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "162--172", } @InProceedings{AggCha88, author = "A. Aggarwal and A. K. Chandra", title = "Virtual memory algorithms", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "173--185", } @InProceedings{HajMaaTur88, author = "A. Hajnal and W. Maass and Gy. Turan", title = "On the communication complexity of graph properties", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "186--191", } @InProceedings{BhattEtAl88, author = "S. N. Bhatt and F. R. K. Chung and J. -W. Hong and F. T. Leighton and A. L. Rosenberg", title = "Optimal simulations by butterfly networks", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "192--204", } @InProceedings{AggChaRag88, author = "A. Aggarwal and A. K. Chandra and P. Raghavan", title = "Energy consumption in {VLSI} circuits", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "205--216", } @InProceedings{VenLev88, author = "R. Venkatesan and L. A. Levin", title = "Random instances of a graph coloring problem are hard", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "217--222", } @InProceedings{Yannakakis88, author = "M. Yannakakis", title = "Expressing combinatorial optimization problems by linear programs", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "223--228", } @InProceedings{PapYan88, author = "C. H. Papadimitriou and M. Yannakakis", title = "Optimization, approximation, and complexity classes", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "229--234", } @InProceedings{JerSin88, author = "M. Jerrum and A. Sinclair", title = "Conductance and the rapid mixing property for Markov chains: The approximation of the permanent resolved", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "235--244", } @InProceedings{Ko88, author = "K. -I. Ko", title = "Relativized polynominal time hierarchies having exactly $k$ levels", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "245--253", } @InProceedings{BenCle88, author = "M. Ben-Or and R. Cleve", title = "Computing algebraic formulas using a constant number of registers", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "254--257", } @InProceedings{KalSch88, author = "B. Kalyanasundaram and G. Schnitger", title = "On the power of white pebbles", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "258--266", } @InProceedings{KeaLi88, author = "M. Kearns and M. Li", title = "Learning in the presence of malicious errors", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "267--280", } @InProceedings{GurShe88, author = "Y. Gurevich and S. Shelah", title = "Nondeterministic linear-time tasks may require substantially nonlinear deterministic time in the case of sublinear work space", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "281--289", } @InProceedings{KarZha88, author = "R. M. Karp and Y. Zhang", title = "A randomized parallel branch-and-bound procedure", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "290--300", } @InProceedings{BenTiw88, author = "M. Ben-Or and P. Tiwari", title = "A deterministic algorithm for sparse multivariate polynominal interpolation", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "301--309", } @InProceedings{KarRag88, author = "H. J. Karloff and P. Raghavan", title = "Randomized algorithms and pseudorandom numbers", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "310--321", } @InProceedings{ManMcGSle88, author = "M. S. Manasse and L. A. McGeoch and D. D. Sleator", title = "Competitive algorithms for on-line problems", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "322--333", } @InProceedings{KanNaoRud88, author = "S. Kannan and M. Naor and S. Rudich", title = "Implicit representation of graphs", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "334--343", } @InProceedings{FiatEtAl88, author = "A. Fiat and M. Naor and A. A. Schaffer and J. P. Schmidt and A. Siegel", title = "Storing and searching a multikey table", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "344--353", } @InProceedings{LueMol88, author = "G. S. Lueker and M. Molodowitch", title = "More analysis of double hashing", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "354--359", } @InProceedings{LoeNes88, author = "M. Loebl and J. Nesetril", title = "Linearity and unprovability of set union problem strategies", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "360--366", } @InProceedings{FiatEtAl88, author = "A. Fiat and M. Naor and J. P. Schmidt and A. Siegel", title = "Non-oblivious hashing", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "367--376", } @InProceedings{Orlin88, author = "J. B. Orlin", title = "A faster strongly polynominal minimum cost flow algorithm", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "377--387", } @InProceedings{GolTar88, author = "A. V. Goldberg and R. E. Tarjan", title = "Finding minimum-cost circulations by canceling negative cycles", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "388--397", } @InProceedings{KosSul88, author = "S. R. Kosaraju and G. F. Sullivan", title = "Detecting cycles in dynamic graphs in polynomial time", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "398--406", } @InProceedings{GabWes88, author = "H. N. Gabow and H. H. Westermann", title = "Forests, frames and games: Algorithms for matroid sums and applications", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "407--421", } @InProceedings{Vaidya88, author = "P. M. Vaidya", title = "Geometry helps in matching", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "422--425", } @InProceedings{DeFPacPol88, author = "H. DeFraysseix and J. Pach and R. Pollack", title = "Small sets supporting {\'F}ary embeddings of planar graphs", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "426--433", } @InProceedings{FedGre88, author = "T. Feder and D. H. Greene", title = "Optimal algorithms for appropriate clustering", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "434--444", } @InProceedings{ForWil88, author = "S. Fortune and G. Wilfong", title = "Planning constrained motion", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "445--459", } @InProceedings{Canny88, author = "J. Canny", title = "Some algebraic and geometric computations in {PSPACE}", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "460--467", } @InProceedings{King88, author = "V. King", title = "Lower bounds on the complexity of graph properties", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "468--476", } @InProceedings{CosmadakisEtAl88, author = "S. S. Cosmadakis and H. Gaifman and P. C. Kanellakis and M. Y. Vardi", title = "Decidable optimization problems for database logic programs", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "477--490", } @InProceedings{Istrail88, author = "S. Istrail", title = "Polynomial universal traversing sequences for cycles are constructible", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "491--503", } @InProceedings{PinSteSze88, author = "J. Pintz and W. L. Steiger and E. Szemeredi", title = "Two infinite sets of primes with fast primality tests", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "504--509", } @InProceedings{PapYan88, author = "C. H. Papadimitriou and M. Yannakakis", title = "Towards an architecture-independent analysis of parallel algorithms", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "510--513", } @InProceedings{GabTar88, author = "H. N. Gabow and R. E. Tarjan", title = "Almost-optimum speed-ups of algorithms for bipartite matching and Related Problems", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "514--527", } @InProceedings{AdlKom88, author = "L. M. Adleman and K. Kompella", title = "Using smoothness to achieve parallelism", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "528--538", } @InProceedings{KarWig88, author = "M. Karchmer and A. Wigderson", title = "Monotone circuits for connectivity require super-logarithmic depth", booktitle = "Proc.\ 20th ACM Symposium on Theory of Computing (STOC)", year = "1988", pages = "539--550", } @InProceedings{NisWig88, author = "N. Nisan and A. Wigderson", title = "Hardness vs. randomness", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "2--11", } @InProceedings{GolKraLub88, author = "O. Goldreich and H. Krawczyk and M. Luby", title = "On the existence of pseudorandom generators", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "12--24", } @InProceedings{Kilian88, author = "J. Kilian", title = "Zero-knowledge with log-space verifiers", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "25--35", } @InProceedings{Levin88, author = "L. A. Levin", title = "Homogeneous measures and polynomial time invariants", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "36--41", } @InProceedings{CreKil88, author = "C. Crepeau and J. Kilian", title = "Achieving oblivious transfer using weakened security assumptions", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "42--52", } @InProceedings{ManSchTiw88, author = "Y. Mansour and B. Schieber and P. Tiwari", title = "Lower bounds for integer greatest common divisor computations", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "54--63", } @InProceedings{Bshouty88, author = "N. H. Bshouty", title = "A lower bound for matrix multiplication", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "64--67", } @InProceedings{KahKalLin88, author = "J. Kahn and G. Kalai and N. Linial", title = "The influence of variables on boolean functions", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "68--80", } @InProceedings{LovSak88, author = "L. Lovasz and M. Saks", title = "Lattices, {M}{\"o}bius functions and communication complexity", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "81--90", } @InProceedings{Yao88, author = "A. C. -C. Yao", title = "Near-optimal time-space tradeoff for element distinctness", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "91--97", } @InProceedings{HauLitWar88, author = "D. Haussler and N. Littlestone and M. K. Warmuth", title = "Predicting {0,1}-functions on randomly drawn points", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "100--109", } @InProceedings{DeSMarWeg88, author = "A. DeSantis and G. Markowsky and M. N. Wegman", title = "Learning probabilistic prediction functions", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "110--119", } @InProceedings{LinManRiv88, author = "N. Linial and Y. Mansour and R. L. Rivest", title = "Results on learnability and the Vapnik-Chervonenkis dimension", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "120--129", } @InProceedings{GasSmi88, author = "W. I. Gasarch and C. H. Smith", title = "Learning via queries", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "130--137", } @InProceedings{KomPat88, author = "J. Komlos and R. Paturi", title = "Effect of connectivity in associative memory models", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "138--147", } @InProceedings{Klein88, author = "P. N. Klein", title = "Efficient parallel algorithms for chordal graphs", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "150--161", } @InProceedings{Luby88, author = "M. Luby", title = "Removing randomness in parallel computation without a processor penalty", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "162--173", } @InProceedings{GolPloVai88, author = "A. V. Goldberg and S. A. Plotkin and P. M. Vaidya", title = "Sublinear-time parallel algorithms for matching and related problems", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "174--185", } @InProceedings{DahHajKar88, author = "E. Dahlhaus and P. Hajnal and M. Karpinski", title = "Optimal parallel algorithm for the Hamiltonian cycle problem on dense graphs", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "186--193", } @InProceedings{AloAza88, author = "N. Alon and Y. Azar", title = "Parallel comparison algorithms for approximation problems", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "194--203", } @InProceedings{AweSip88, author = "B. Awerbuch and M. Sipser", title = "Dynamic networks are as fast as static networks", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "206--220", } @InProceedings{Koch88, author = "R. A. Koch", title = "Increasing the size of a network by a constant factor can increase performance by more than a constant factor", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "221--230", } @InProceedings{Awerbuch88, author = "B. Awerbuch", title = "On the effects of feedback in dynamic network protocols", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "231--245", } @InProceedings{MosWaa88, author = "Y. Moses and O. Waarts", title = "Coordinated traversal: $(t + 1)$-round Byzantine agreement in polynomial time", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "246--255", } @InProceedings{LeiMagRao88, author = "T. Leighton and B. Maggs and S. Rao", title = "Universal packet routing algorithms", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "256--269", } @InProceedings{BabLukSer88, author = "L. Babai and E. M. Luks and A. Seress", title = "Fast management of permutation groups", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "272--282", } @InProceedings{Shoup88, author = "V. Shoup", title = "New algorithms for finding irreducible polynomials over finite fields", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "283--290", } @InProceedings{Renegar88, author = "J. Renegar", title = "A faster {PSPACE} algorithm for deciding the existential theory of the reals", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "291--295", } @InProceedings{KalTra88, author = "E. Kaltofen and B. Trager", title = "Computing with polynomials given by black boxes for their evaluation: Greatest common divisors, factorization, separation of numerators and denominators", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "296--305", } @InProceedings{CannyEtAl88, author = "J. Canny and B. Donald and J. Reif and P. Xavier", title = "On the complexity of kinodynamic planning", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "306--316", } @InProceedings{Safra88, author = "S. Safra", title = "On the complexity of $\omega$-automata", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "319--327", } @InProceedings{EmeJut88, author = "E. A. Emerson and C. S. Jutla", title = "The complexity of tree automata and logics of programs", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "328--337", } @InProceedings{CouYan88, author = "C. Courcoubetis and M. Yannakakis", title = "Verifying temporal properties of finite-state probabilistic programs", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "338--345", } @InProceedings{Ajtai88, author = "M. Ajtai", title = "The complexity of the pigeonhole principle", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "346--355", } @InProceedings{AjtFag88, author = "M. Ajtai and R. Fagin", title = "Reachability is harder for directed than for undirected finite graphs", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "358--367", } @InProceedings{Ong88, author = "C. -H. L. Ong", title = "Fully abstract models of the lazy lambda calculus", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "368--376", } @InProceedings{McAPanSha88, author = "D. AMcAllester and P. Panangaden and V. Shanbhogue", title = "Nonexpressibility of fairness and signaling", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "377--386", } @InProceedings{BluShuSma88, author = "L. Blum and M. Shub and S. Smale", title = "On a theory of completeness, recursive functions and universal machines", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "387--397", } @InProceedings{MotRagSar88, author = "R. Motwani and A. Raghunathan and H. Saran", title = "Constructive results from graph minors: Linkless embeddings", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "398--409", } @InProceedings{DagumEtAl88, author = "P. Dagum and M. Luby and M. Mihail and U. Vazirani", title = "Polytopes, permanents and graphs with large factors", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "412--421", } @InProceedings{LeiRao88, author = "T. Leighton and S. Rao", title = "An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "422--431", } @InProceedings{GolPloTar88, author = "A. V. Goldberg and S. A. Plotkin and E. Tardos", title = "Combinatorial algorithms for the generalized circulation problem", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "432--443", } @InProceedings{GolHoc88, author = "O. Goldschmidt and D. S. Hochbaum", title = "Polynomial algorithm for the k-cut problem", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "444--451", } @InProceedings{Clarkson88, author = "K. L. Clarkson", title = "A Las Vegas algorithm for linear programming when the dimension is small", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "452--456", } @InProceedings{Malitz88, author = "S. M. Malitz", title = "Genus g graphs have pagenumber ${O}( \sqrt{g} )$", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "458--468", } @InProceedings{BhaCai88, author = "S. Bhatt and J. -Y. Cai", title = "Take a walk, grow a tree", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "469--478", } @InProceedings{BroKar88, author = "A. Z. Broder and A. R. Karlin", title = "Bounds on the cover time", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "479--487", } @InProceedings{EppGalGia88, author = "D. Eppstein and Z. Galil and R. Giancarlo", title = "Speeding up dynamic programming", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "488--496", } @InProceedings{AggPar88, author = "A. Aggarwal and J. Park", title = "Notes on searching in multidimensional monotone arrays", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "497--512", } @InProceedings{FreGol88, author = "M. L. Fredman and D. L. Goldsmith", title = "Three stacks", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "514--523", } @InProceedings{DietzfelbingerEtAl88, author = "M. Dietzfelbinger and A. Karlin and K. Mehlhorn and F. MeyeraufderHeide and H. Rohnert and R. E. Tarjan", title = "Dynamic perfect hashing: Upper and lower bounds", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "524--531", } @InProceedings{BenGal88, author = "A. M. Ben-Amram and Z. Galil", title = "On pointers versus addresses", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "532--538", } @InProceedings{ChaFri88, author = "B. Chazelle and J. Friedman", title = "A deterministic view of random sampling and its use in geometry", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "539--549", } @InProceedings{OveYap88, author = "M. H. Overmars and C. -K. Yap", title = "New upper bounds in Klee's measure problem", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "550--556", } @InProceedings{PreTam88, author = "F. P. Preparata and R. Tamassia", title = "Fully dynamic techniques for point location and transitive closure in planar structures", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "558--567", } @InProceedings{ClarksonEtAl88, author = "K. L. Clarkson and H. Edelsbrunner and L. J. Guibas and M. Sharir and E. Welzl", title = "Combinatorial complexity bounds for arrangements of curves and surfaces", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "568--579", } @InProceedings{Mulmuley88, author = "K. Mulmuley", title = "A fast planar partition algorithm, {I}", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "580--589", } @InProceedings{ChaEde88, author = "B. Chazelle and H. Edelsbrunner", title = "An optimal algorithm for intersecting line segments in the plane", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "590--600", } @InProceedings{CulRec88, author = "J. C. Culberson and R. A. Reckhow", title = "Covering polygons is hard", booktitle = "Proc.\ 29th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1988", pages = "601--611", } @InProceedings{BabNisSze89, author = "L. Babai and N. Nisan and M. Szegedy", title = "Multiparty protocols and Logspace-hard pseudorandom sequences", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "1--11", } @InProceedings{ImpLevLub89, author = "R. Impagliazzo and L. A. Levin and M. Luby", title = "Pseudo-random generation from one-way functions", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "12--24", } @InProceedings{GolLev89, author = "O. Goldreich and L. A. Levin", title = "A hard-core predicate for all one-way functions", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "25--32", } @InProceedings{NaoYun89, author = "M. Naor and M. Yung", title = "Universal one-way hash functions and their cryptographic applications", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "33--43", } @InProceedings{ImpRud89, author = "R. Impagliazzo and S. Rudich", title = "Limits on the provable consequences of one-way permutations", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "44--61", } @InProceedings{ChoKus89, author = "B. Chor and E. Kushilevitz", title = "A zero-one law for Boolean privacy", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "62--72", } @InProceedings{RabBen89, author = "T. Rabin and M. Ben-Or", title = "Verifiable secret sharing and multiparty protocols with honest majority", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "73--85", } @InProceedings{BluKan89, author = "M. Blum and S. Kannan", title = "Designing programs that check their work", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "86--97", } @InProceedings{Vallee89, author = "B. Vallee", title = "Provably fast integer factoring with quasi-uniform small quadratic residues", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "98--106", } @InProceedings{CooUrq89, author = "S. Cook and A. Urquhart", title = "Functional interpretations of feasibly constructive arithmetic", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "107--112", } @InProceedings{AfrCos89, author = "F. Afrati and S. S. Cosmadakis", title = "Expressiveness of restricted recursive queries", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "113--126", } @InProceedings{SafVar89, author = "S. Safra and M. Y. Vardi", title = "On $\omega$-automata and temporal logic", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "127--137", } @InProceedings{Ierardi89, author = "D. Ierardi", title = "Quantifier elimination in the theory of an algebraically-closed field", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "138--147", } @InProceedings{ForSip89, author = "L. Fortnow and M. Sipser", title = "Probabilistic computation and linear time", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "148--156", } @InProceedings{KurMahRoy89, author = "S. A. Kurtz and S. R. Mahaney and J. S. Royer", title = "The isomorphism conjecture fails relative to a random oracle", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "157--166", } @InProceedings{Razborov89, author = "A. A. Razborov", title = "On the method of approximations", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "167--176", } @InProceedings{Bshouty89, author = "N. H. Bshouty", title = "On the extended direct sum conjecture", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "177--185", } @InProceedings{Yao89, author = "A. C. -C. Yao", title = "Circuits and local computation", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "186--196", } @InProceedings{Beame89, author = "P. Beame", title = "A general sequential time-space tradeoff for finding unique elements", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "197--203", } @InProceedings{Ben-DavidEtAl89, author = "S. Ben-David and B. Chor and O. Goldreich and M. Luby", title = "On the theory of average case complexity", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "204--216", } @InProceedings{LamTiwTom89, author = "T. Lam and P. Tiwari and M. Tompa", title = "Tradeoffs between communication and space", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "217--226", } @InProceedings{KochEtAl89, author = "R. Koch and T. Leighton and B. Maggs and S. Rao and A. Rosenberg", title = "Work-preserving emulations of fixed-connection networks", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "227--240", } @InProceedings{Upfal89, author = "E. Upfal", title = "An ${O}( \log {N})$ deterministic packet routing scheme", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "241--250", } @InProceedings{HasLeiNew89, author = "J. Hastad and T. Leighton and M. Newman", title = "Fast computation using faulty hypercubes", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "251--263", } @InProceedings{ReiTat89, author = "J. H. Reif and S. R. Tate", title = "Optimal size integer division circuits", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "264--273", } @InProceedings{AlonEtAl89, author = "N. Alon and A. Bar-Noy and N. Linial and D. Peleg", title = "On the complexity of radio communication", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "274--285", } @InProceedings{KaoSha89, author = "M. -Y. Kao and G. E. Shannon", title = "Local reorientation, global order, and planar topology", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "286--296", } @InProceedings{AggAndKao89, author = "A. Aggarwal and R. J. Anderson and M. -Y. Kao", title = "Parallel depth-first search in general directed graphs", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "297--308", } @InProceedings{BerkmanEtAl89, author = "O. Berkman and D. Breslauer and Z. Galil and B. Schieber and U. Vishkin", title = "Highly parallelizable problems", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "309--319", } @InProceedings{Boppana89, author = "R. B. Boppana", title = "Optimal separations between concurrent-write parallel machines", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "320--326", } @InProceedings{Nisan89, author = "N. Nisan", title = "{CREW} {PRAM}s and decision trees", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "327--335", } @InProceedings{FiaNao89, author = "A. Fiat and M. Naor", title = "Implicit ${O}(1)$ probe search", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "336--344", } @InProceedings{FreSak89, author = "M. L. Fredman and M. E. Saks", title = "The cell probe complexity of dynamic data structures", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "345--354", } @InProceedings{SchSie89, author = "J. P. Schmidt and A. Siegel", title = "On aspects of universality and performance for closed hashing", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "355--366", } @InProceedings{KenKin89, author = "C. Kenyon-Mathieu and V. King", title = "Verifying partial orders", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "367--374", } @InProceedings{DyeFriKan89, author = "M. Dyer and A. Frieze and R. Kannan", title = "A random polynomial time algorithm for approximating the volume of convex bodies", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "375--381", } @InProceedings{ChazelleEtAl89, author = "B. Chazelle and H. Edelsbrunner and L. J. Guibas and M. Sharir", title = "Lines in space --- Combinatorics, algorithms and applications", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "382--393", } @InProceedings{ReiSen89, author = "J. H. Reif and S. Sen", title = "Polling: {A} new randomized sampling technique for computational geometry", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "394--404", } @InProceedings{GooPolStu89, author = "J. E. Goodman and R. Pollack and B. Sturmfels", title = "Coordinate representation of order types requires exponential storage", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "405--410", } @InProceedings{RivSch89, author = "R. L. Rivest and R. E. Schapire", title = "Inference of finite automata using homing sequences", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "411--420", } @InProceedings{PitWar89, author = "L. Pitt and M. K. Warmuth", title = "The minimum consistent {DFA} problem cannot be approximated within any polynomial", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "421--432", } @InProceedings{KeaVal89, author = "M. Kearns and L. G. Valiant", title = "Cryptographic limitations on learning boolean formulae and finite automata", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "433--444", } @InProceedings{Birget89, author = "J. -C. Birget", title = "Proof of a conjecture of {R}. Kannan", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "445--453", } @InProceedings{DolSha89, author = "D. Dolev and N. Shavit", title = "Bounded concurrent time-stamp systems are constructible", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "454--466", } @InProceedings{GraYao89, author = "R. L. Graham and A. C. Yao", title = "On the improbability of reaching Byzantine agreements", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "467--478", } @InProceedings{AwerbuchEtAl89, author = "B. Awerbuch and A. Bar-Noy and N. Linial and D. Peleg", title = "Compact distributed data structures for adaptive routing", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "479--489", } @InProceedings{Awerbuch89, author = "B. Awerbuch", title = "Distributed shortest paths algorithms", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "490--500", } @InProceedings{FelLan89, author = "M. R. Fellows and M. A. Langston", title = "On search, decision and the efficiency of polynomial-time algorithms", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "501--512", } @InProceedings{Feder89, author = "T. Feder", title = "A new fixed point approach for stable networks and stable marriages", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "513--522", } @InProceedings{CohMeg89, author = "E. Cohen and N. Megiddo", title = "Strongly polynomial-time and {NC} algorithms for detecting cycles in dynamic graphs", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "523--534", } @InProceedings{Blum89, author = "A. Blum", title = "An ${O}(n^{0.4} )$-approximation algorithm for 3-coloring (and improved approximation algorithm for k-coloring)", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "535--542", } @InProceedings{BroderEtAl89, author = "A. Z. Broder and A. R. Karlin and P. Raghavan and E. Upfal", title = "Trading space for time in undirected $s$-$t$ connectivity", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "543--549", } @InProceedings{Motwani89, author = "R. Motwani", title = "Expanding graphs and the average-case analysis of algorithms for matchings and related problems", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "550--561", } @InProceedings{BorRuzTom89, author = "A. Borodin and W. L. Ruzzo and M. Tompa", title = "Lower bounds on the length of universal traversal sequences", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "562--574", } @InProceedings{ChandraEtAl89, author = "A. K. Chandra and P. Raghavan and W. L. Ruzzo and R. Smolensky and P. Tiwari", title = "The electrical resistance of a graph captures its commute and cover times", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "574--586", } @InProceedings{FriKahSze89, author = "J. Friedman and J. Kahn and E. Szemeredi", title = "On the second eigenvalue in random regular graphs", booktitle = "Proc.\ 21th ACM Symposium on Theory of Computing (STOC)", year = "1989", pages = "587--598", } @InProceedings{BerRom89, author = "B. Berger and J. Rompel", title = "Simulating $(\log^c n)$-wise independence in {NC}", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "2--7", } @InProceedings{MotNaoNao89, author = "R. Motwani and J. Naor and M. Naor", title = "The probabilistic method yields deterministic parallel algorithms", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "8--13", } @InProceedings{CohWig89, author = "ACohen and A. Wigderson", title = "Dispersers, deterministic amplification, and weak random sources", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "14--19", } @InProceedings{Siegel89, author = "A. Siegel", title = "On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "20--25", } @InProceedings{Schapire89, author = "R. E. Schapire", title = "The strength of weak learnability", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "28--33", } @InProceedings{LiVit89, author = "M. Li and P. M. B. Vitanyi", title = "A theory of learning simple concepts under simple distributions and average case complexity for the universal distribution", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "34--39", } @InProceedings{Haussler89, author = "D. Haussler", title = "Generalizing the {PAC} model: Sample size bounds from metric dimension-based uniform convergence results", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "40--45", } @InProceedings{GolRivSch89, author = "S. A. Goldman and R. L. Rivest and R. E. Schapire", title = "Learning binary relations and total orders", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "46--51", } @InProceedings{BerRomSho89, author = "B. Berger and J. Rompel and P. W. Shor", title = "Efficient {NC} algorithms for set cover with applications to learning and geometry", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "54--60", } @InProceedings{MarSur89, author = "O. Marcotte and S. Suri", title = "Fast matching algorithms for points on a polygon", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "60--65", } @InProceedings{FreGua89, author = "G. N. Frederickson and D. J. Guan", title = "Ensemble motion planning in trees", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "66--71", } @InProceedings{PacSteSze89, author = "J. Pach and W. Steiger and E. Szemeredi", title = "An upper bound on the number of planar k-sets", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "72--79", } @InProceedings{Dickerson89, author = "M. Dickerson", title = "The inverse of an automorphism in polynomial time", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "82--87", } @InProceedings{VonzurGathen89, author = "J. VonzurGathen", title = "Testing permutation polynomials", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "88--92", } @InProceedings{BabRon89, author = "L. Babai and L. Ronyai", title = "Computing irreducible representations of finite groups", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "93--98", } @InProceedings{Ronyai89, author = "L. Ronyai", title = "Galois groups and factoring polynomials over finite fields", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "99--104", } @InProceedings{GabXu89, author = "H. N. Gabow and Y. Xu", title = "Efficient algorithms for independent assignments on graphic and linear matroids", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "106--111", } @InProceedings{MilNao89, author = "G. L. Miller and J. Naor", title = "Flow in planar graphs with multiple sources and sinks", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "112--117", } @InProceedings{CheHag89, author = "J. Cheriyan and T. Hagerup", title = "A randomized maximum-flow algorithm", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "118--123", } @InProceedings{LinVaz89, author = "N. Linial and U. Vazirani", title = "Graph products and chromatic numbers", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "124--128", } @InProceedings{Ng89, author = "C. Ng", title = "Lower bounds for the stable marriage problem and its variants", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "129--133", } @InProceedings{HalShm89, author = "L. A. Hall and D. B. Shmoys", title = "Approximation schemes for constrained scheduling problems", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "134--139", } @InProceedings{AjtGur89, author = "M. Ajtai and Y. Gurevich", title = "Datalog vs. first-order logic", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "142--147", } @InProceedings{AbaHal89, author = "M. Abadi and J. Y. Halpern", title = "Decidability and expressiveness for first-order logics of probability", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "148--153", } @InProceedings{CooKap89, author = "S. A. Cook and B. M. Kapron", title = "Characterizations of the basic feasible functionals of finite type", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "154--159", } @InProceedings{PacSzw89, author = "L. Pacholski and W. Szwast", title = "The 0-1 law fails for the class of existential second order {G}{\"o}del sentences with equality", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "160--163", } @InProceedings{AluHen89, author = "R. Alur and T. A. Henzinger", title = "A really temporal logic", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "164--169", } @InProceedings{Russell89, author = "J. R. Russell", title = "Full abstraction for nondeterministic dataflow networks", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "170--175", } @InProceedings{Kosaraju89, author = "S. R. Kosaraju", title = "Efficient tree pattern matching", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "178--183", } @InProceedings{Kosaraju89, author = "S. R. Kosaraju", title = "Pipelining computations in a tree of processors", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "184--189", } @InProceedings{GooKos89, author = "M. T. Goodrich and S. R. Kosaraju", title = "Sorting on a parallel pointer machine with applications to set expression evaluation", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "190--196", } @InProceedings{BerVis89, author = "O. Berkman and U. Vishkin", title = "Recursive *-tree parallel data-structure", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "196--202", } @InProceedings{Ko89, author = "K. Ko", title = "Computational complexity of roots of real functions", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "204--209", } @InProceedings{AbrahamsonEtAl89, author = "K. R. Abrahamson and J. A. Ellis and M. R. Fellows and M. E. Mata", title = "On the complexity of fixed parameter problems", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "210--215", } @InProceedings{Krentel89, author = "M. W. Krentel", title = "Structure in locally optimal solutions", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "216--221", } @InProceedings{ImpTar89, author = "R. Impagliazzo and G. Tardos", title = "Decision versus search problems in super-polynomial time", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "222--227", } @InProceedings{ImpLub89, author = "R. Impagliazzo and M. Luby", title = "One-way functions are essential for complexity based cryptography", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "230--235", } @InProceedings{ImpNao89, author = "R. Impagliazzo and M. Naor", title = "Efficient cryptographic schemes provably as secure as subset sum", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "236--243", } @InProceedings{KhaGolYun89, author = "M. Kharitonov and A. V. Goldberg and M. Yung", title = "Lower bounds for pseudorandom number generators", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "242--247", } @InProceedings{ImpZuc89, author = "R. Impagliazzo and D. Zuckerman", title = "How to recycle random bits", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "248--253", } @InProceedings{LitWar89, author = "N. Littlestone and M. K. Warmuth", title = "The weighted majority algorithm", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "256--261", } @InProceedings{MaaTur89, author = "W. Maass and Gy. Turan", title = "On the complexity of learning from counterexamples", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "262--267", } @InProceedings{Tzeng89, author = "W. Tzeng", title = "The equivalence and learning of probabilistic automata", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "268--273", } @InProceedings{FiatEtAl89, author = "A. Fiat and S. Moses and A. Shamir and I. Shimshoni and G. Tardos", title = "Planning and learning in permutation groups", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "274--279", } @InProceedings{RamRei89, author = "V. Ramachandran and J. Reif", title = "An optimal parallel algorithm for graph planarity", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "282--287", } @InProceedings{KhuSch89, author = "S. Khuller and B. Schieber", title = "Efficient parallel algorithms for testing connectivity and finding disjoint s-t paths in graphs", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "288--293", } @InProceedings{KirSerSpi89, author = "L. Kirousis and M. Serna and P. Spirakis", title = "The parallel complexity of the subgraph connectivity problem", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "294--299", } @InProceedings{KhuMitVaz89, author = "S. Khuller and S. G. Mitchell and V. V. Vazirani", title = "Processor efficient parallel algorithms for the two disjoint paths problem, and for finding a Kuratowski homeomorph", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "300--305", } @InProceedings{Yao89, author = "A. C. Yao", title = "Lower bounds for algebraic computation trees with integer inputs", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "308--313", } @InProceedings{Landau89, author = "S. Landau", title = "Simplification of nested radicals", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "314--319", } @InProceedings{Just89, author = "B. Just", title = "Generalizing the continued fraction algorithm to arbitrary dimensions", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "320--324", } @InProceedings{ManSchTiw89, author = "Y. Mansour and B. Schieber and P. Tiwari", title = "The complexity of approximating the square root", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "325--330", } @InProceedings{Vaidya89, author = "P. M. Vaidya", title = "Speeding-up linear programming using fast matrix multiplication", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "332--337", } @InProceedings{Vaidya89, author = "P. M. Vaidya", title = "A new algorithm for minimizing convex functions over convex sets", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "338--343", } @InProceedings{DriHea89, author = "J. R. Driscoll and Jr. D. MHealy", title = "Asymptotically fast algorithms for spherical and related transforms", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "344--349", } @InProceedings{GoldbergEtAl89, author = "A. V. Goldberg and S. A. Plotkin and D. B. Shmoys and E. Tardos", title = "Interior-point methods in parallel computation", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "350--355", } @InProceedings{AweManSha89, author = "B. Awerbuch and Y. Mansour and N. Shavit", title = "Polynomial end-to-end communication", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "358--363", } @InProceedings{AwerbuchEtAl89, author = "B. Awerbuch and A. V. Goldberg and M. Luby and S. A. Plotkin", title = "Network decomposition and locality in distributed computation", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "364--369", } @InProceedings{AfeGafRic89, author = "Y. Afek and E. Gafni and M. Ricklin", title = "Upper and lower bounds for routing schemes in dynamic networks", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "370--375", } @InProceedings{Jiang89, author = "T. Jiang", title = "The synchronization of nonuniform networks of finite automata", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "376--381", } @InProceedings{LeiMag89, author = "T. Leighton and B. Maggs", title = "Expanders might be practical: Fast algorithms for routing around faults on multibutterflies", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "384--389", } @InProceedings{Herley89, author = "K. T. Herley", title = "Efficient simulations of small shared memories on bounded degree networks", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "390--395", } @InProceedings{Plaxton89, author = "C. G. Plaxton", title = "On the network complexity of selection", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "396--401", } @InProceedings{ItkLev89, author = "G. Itkis and L. A. Levin", title = "Power of fast {VLSI} models is insensitive to wires' thinness", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "402--407", } @InProceedings{BerGarPer89, author = "P. Berman and J. A. Garay and K. J. Perry", title = "Towards optimal distributed consensus", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "410--415", } @InProceedings{Kushilevitz89, author = "E. Kushilevitz", title = "Privacy and communication complexity", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "416--421", } @InProceedings{ChoMos89, author = "B. Chor and L. Moscovici", title = "Solvability in asynchronous environments", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "422--427", } @InProceedings{DolFed89, author = "D. Dolev and T. Feder", title = "Multiparty Communication Complexity", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "428--433", } @InProceedings{DiBTam89, author = "G. DiBattista and R. Tamassia", title = "Incremental planarity testing", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "436--441", } @InProceedings{Broder89, author = "A. Broder", title = "Generating random spanning trees", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "442--447", } @InProceedings{Frederickson89, author = "G. N. Frederickson", title = "Using cellular graph embeddings in solving all pairs shortest paths problems", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "448--453", } @InProceedings{DahKar89, author = "E. Dahlhaus and M. Karpinski", title = "An efficient parallel algorithm for the minimal elimination ordering (meo) of an arbitrary graph", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "454--459", } @InProceedings{ConLip89, author = "A. Condon and R. J. Lipton", title = "On the complexity of space bounded interactive proofs", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "462--467", } @InProceedings{BeaGol89, author = "D. Beaver and S. Goldwasser", title = "Multiparty computation with faulty majority", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "468--473", } @InProceedings{KilMicOst89, author = "J. Kilian and S. Micali and R. Ostrovsky", title = "Minimum resource zero-knowledge proofs", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "474--479", } @InProceedings{DwoSto89, author = "C. Dwork and L. Stockmeyer", title = "On the power of 2-way probabilistic finite state automata", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "480--485", } @InProceedings{DobSur89, author = "D. Dobkin and S. Suri", title = "Dynamically computing the maxima of decomposable functions, with applications", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "488--494", } @InProceedings{Fortune89, author = "S. Fortune", title = "Stable maintenance of point set triangulations in two dimensions", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "494--499", } @InProceedings{Milenkovic89, author = "V. Milenkovic", title = "Double precision geometry: {A} general technique for calculating line and segment intersections using rounded arithmetic", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "500--505", } @InProceedings{KucWagWag89, author = "R. Kuchem and D. Wagner and F. Wagner", title = "Area-optimal three-layer channel routing", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "506--511", } @InProceedings{Toda89, author = "S. Toda", title = "On the computational power of {PP} and \({O}+{P}", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "514--519", } @InProceedings{FelLan89, author = "M. R. Fellows and M. A. Langston", title = "An analogue of the Myhill-Nerode theorem and its use in computing finite-basis characterizations", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "520--525", } @InProceedings{Mihail89, author = "M. Mihail", title = "Conductance and convergence of Markov chains --- {A} combinatorial treatment of expanders", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "526--531", } @InProceedings{Cai89, author = "J. Cai", title = "Lower bounds for constant depth circuits in the presence of help bits", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "532--537", } @InProceedings{AraSei89, author = "C. R. Aragon and R. G. Seidel", title = "Randomized search trees", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "540--545", } @InProceedings{MehNahRau89, author = "K. Mehlhorn and S. Naher and M. Rauch", title = "On the complexity of a game related to the dictionary problem", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "546--548", } @InProceedings{Jacobson89, author = "G. Jacobson", title = "Space-efficient static trees and graphs", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "549--554", } @InProceedings{Sundar89, author = "R. Sundar", title = "Twists, turns, cascades, deque conjecture, and scanning theorem", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "555--559", } @InProceedings{RazWig89, author = "R. Raz and A. Wigderson", title = "Probabilistic communication complexity of Boolean relations", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "562--567", } @InProceedings{CaiLip89, author = "J. Cai and R. J. Lipton", title = "Subquadratic simulations of circuits by branching programs", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "568--573", } @InProceedings{LinManNis89, author = "N. Linial and Y. Mansour and N. Nisan", title = "Constant depth circuits, Fourier transform, and learnability", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "574--579", } @InProceedings{Allender89, author = "E. Allender", title = "A note on the power of threshold circuits", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "580--584", } @InProceedings{Chazelle89, author = "B. Chazelle", title = "An optimal algorithm for intersecting three-dimensional convex polyhedra", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "586--591", } @InProceedings{Mulmuley89, author = "K. Mulmuley", title = "On obstructions in relation to a fixed viewpoint", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "592--597", } @InProceedings{OveSha89, author = "M. Overmars and M. Sharir", title = "Output-sensitive hidden surface removal", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "598--603", } @InProceedings{Hansen89, author = "M. D. Hansen", title = "Approximation algorithms for geometric embeddings in the plane with applications to parallel processing problems", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "604--609", } @InProceedings{CaiFurImm89, author = "J. Cai and M. Furer and N. Immerman", title = "An optimal lower bound on the number of variables for graph identification", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "612--617", } @InProceedings{LisLor89, author = "M. Liskiewicz and K. Lorys", title = "On reversal complexity for alternating Turing machines", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "618--623", } @InProceedings{FenKurRoy89, author = "S. A. Fenner and S. A. Kurtz and J. S. Royer", title = "Every polynomial-time 1-degree collapses iff {P} = {PSPACE}", booktitle = "Proc.\ 30th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1989", pages = "624--629", } @InProceedings{FreWil90, author = "M. L. Fredman and D. E. Willard", title = "{BLASTING} through the information theoretic barrier with {FUSION} {TREES}", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "1--7", } @InProceedings{Cole90, author = "R. Cole", title = "On the dynamic finger conjecture for splay trees", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "8--17", } @InProceedings{SunTar90, author = "R. Sundar and R. E. Tarjan", title = "Unique binary search tree representations and equality-testing of sets and sequences", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "18--25", } @InProceedings{Frederickson90, author = "G. N. Frederickson", title = "The information theory bound is tight for selection in a heap", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "26--33", } @InProceedings{LaPoutre90, author = "J. A. LaPoutre", title = "Lower bounds for the union-find and the split-find problem on pointer machines", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "34--44", } @InProceedings{GodKinSch90, author = "W. Goddard and V. King and L. Schulman", title = "Optimal randomized algorithms for local sorting and set-maxima", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "45--53", } @InProceedings{BoaPit90, author = "R. Board and L. Pitt", title = "On the necessity of Occam algorithms", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "54--63", } @InProceedings{Blum90, author = "A. Blum", title = "Learning Boolean functions in an infinite atribute space", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "64--72", } @InProceedings{BluLubRub90, author = "M. Blum and M. Luby and R. Rubinfeld", title = "Self-testing/correcting with applications to numerical problems", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "73--83", } @InProceedings{Yao90, author = "A. C. -C. Yao", title = "Coherent functions and program checkers", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "84--94", } @InProceedings{EveRaj90, author = "S. Even and S. Rajsbaum", title = "The use of a synchronizer yields maximum computation rate in distributed networks", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "95--105", } @InProceedings{FischerEtAl90, author = "M. J. Fischer and S. Moran and S. Rudich and G. Taubenfeld", title = "The wakeup problem", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "106--116", } @InProceedings{DieMey90, author = "M. Dietzfelbinger and F. MeyeraufderHeide", title = "How to distribute a dictionary in a complete network", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "117--127", } @InProceedings{FeigeEtAl90, author = "U. Feige and D. Peleg and P. Raghavan and E. Upfal", title = "Computing with unreliable information", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "128--137", } @InProceedings{KedPalSpi90, author = "Z. M. Kedem and K. V. Palem and P. G. Spirakis", title = "Efficient robust parallel computations", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "138--148", } @InProceedings{AroLeiMag90, author = "S. Arora and T. Leighton and B. Maggs", title = "On-line algorithms for path selection in a nonblocking network", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "149--158", } @InProceedings{VitShr90, author = "J. S. Vitter and E. A. M. Shriver", title = "Optimal disk {I}/{O} with parallel block transfer", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "159--169", } @InProceedings{Vishkin90, author = "U. Vishkin", title = "Deterministic sampling --- {A} new technique for fast pattern matching", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "170--180", } @InProceedings{KaoKle90, author = "M. -Y. Kao and P. N. Klein", title = "Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "181--192", } @InProceedings{CypPla90, author = "R. Cypher and C. G. Plaxton", title = "Deterministic sorting in nearly logarithmic time on the hypercube and related computers", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "193--203", } @InProceedings{Nisan90, author = "N. Nisan", title = "Psuedorandom generators for space-bounded computation", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "204--212", } @InProceedings{NaoNao90, author = "J. Naor and M. Naor", title = "Small-bias probability spaces: Efficient constructions and applications", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "213--223", } @InProceedings{SchSie90, author = "J. P. Schmidt and A. Siegel", title = "The analysis of closed hashing under limited randomness", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "224--234", } @InProceedings{ManNisTiw90, author = "Y. Mansour and N. Nisan and P. Tiwari", title = "The computational complexity of universal hashing", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "235--243", } @InProceedings{GilMeyWig90, author = "J. Gil and F. MeyeraufderHeide and A. Wigderson", title = "Not all keys can be hashed in constant time", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "244--253", } @InProceedings{Zuckerman90, author = "D. Zuckerman", title = "A technique for lower bounding the cover time", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "254--259", } @InProceedings{LinNis90, author = "N. Linial and N. Nisan", title = "Approximate inclusion-exclusion", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "260--270", } @InProceedings{Cleve90, author = "R. Cleve", title = "Towards optimal simulations of formulas by bounded-width programs", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "271--277", } @InProceedings{Szegedy90, author = "M. Szegedy", title = "Functions with bounded symmetric communication complexity and circuits with mod m gates", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "278--286", } @InProceedings{RazWig90, author = "R. Raz and A. Wigderson", title = "Monotone circuits for matching require linear depth", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "287--292", } @InProceedings{AloSeyTho90, author = "N. Alon and P. Seymour and R. Thomas", title = "A separator theorem for graphs with an excluded minor and its applications", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "293--299", } @InProceedings{MilThu90, author = "G. L. Miller and W. Thurston", title = "Separators in two and three dimensions", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "300--309", } @InProceedings{KleSteTar90, author = "P. Klein and C. Stein and E. Tardos", title = "Leighton-Rao might be practical: Faster approximation algorithms for concurrent flow with uniform capacities", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "310--321", } @InProceedings{Mulmuley90, author = "K. Mulmuley", title = "Output sensitive construction of levels and Voronoi diagrams in ${R}^d$ of order 1 to $k$", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "322--330", } @InProceedings{AggHanLei90, author = "A. Aggarwal and M. Hansen and T. Leighton", title = "Solving query-retrieval problems by compacting Voronoi diagrams", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "331--340", } @InProceedings{KirMisYap90, author = "D. G. Kirkpatrick and B. Mishra and C. K. Yap", title = "Quantitative Steinitz's theorems with applications to multifingered grasping", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "341--351", } @InProceedings{KarVazVaz90, author = "R. M. Karp and U. V. Vazirani and V. V. Vazirani", title = "An optimal algorithm for on-line bipartite matching", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "352--358", } @InProceedings{BernEtAl90, author = "M. Bern and D. H. Greene and A. Raghunathan and M. Sudan", title = "Online algorithms for locating checkpoints", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "359--368", } @InProceedings{CoppersmithEtAl90, author = "D. Coppersmith and P. Doyle and P. Raghavan and M. Snir", title = "Random walks on weighted graphs, and applications to on-line algorithms", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "369--378", } @InProceedings{Ben-DavidEtAl90, author = "S. Ben-David and A. Borodin and R. Karp and G. Tardos and A. Wigderson", title = "On the power of randomization in online algorithms", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "379--386", } @InProceedings{Rompel90, author = "J. Rompel", title = "One-way functions are necessary and sufficient for secure signatures", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "387--394", } @InProceedings{Hastad90, author = "J. Hastad", title = "Pseudo-random generators under uniform assumptions", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "395--404", } @InProceedings{SchSha90, author = "A. W. Schrift and A. Shamir", title = "The discrete log is very discreet", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "405--415", } @InProceedings{FeiSha90, author = "U. Feige and A. Shamir", title = "Witness indistinguishable and witness hiding protocols", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "416--426", } @InProceedings{NaoYun90, author = "M. Naor and M. Yung", title = "Public-key cryptosystems provably secure against chosen ciphertext attacks", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "427--437", } @InProceedings{PapSchYan90, author = "C. H. Papadimitriou and A. A. Schaffer and M. Yannakakis", title = "On the complexity of local search", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "438--445", } @InProceedings{PanRan90, author = "A. Panconesi and D. Ranjan", title = "Quantifiers and approximation", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "446--456", } @InProceedings{OgiWat90, author = "M. Ogiwara and O. Watanabe", title = "On polynomial time bounded truth-table reducibility of {NP} sets to sparse sets", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "457--467", } @InProceedings{KfoTiuUrz90, author = "A. J. Kfoury and J. Tiuryn and P. Urzyczyn", title = "The undecidability of the semi-unification problem", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "468--476", } @InProceedings{HarKar90, author = "T. Harju and J. Karhumaki", title = "Decidability of the multiplicity equivalence of multitape finite automata", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "477--481", } @InProceedings{BelMicOst90, author = "M. Bellare and S. Micali and R. Ostrovsky", title = "Perfect zero-knowledge in constant rounds", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "482--493", } @InProceedings{BelMicOst90, author = "M. Bellare and S. Micali and R. Ostrovsky", title = "The (true) complexity of statistical zero knowledge", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "494--502", } @InProceedings{BeaMicRog90, author = "D. Beaver and S. Micali and P. Rogaway", title = "The round complexity of secure protocols", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "503--513", } @InProceedings{Ostrovsky90, author = "R. Ostrovsky", title = "Efficient computation on oblivious {RAM}s", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "514--523", } @InProceedings{KanLuk90, author = "W. M. Kantor and E. M. Luks", title = "Computing in quotient groups", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "524--534", } @InProceedings{BorTiw90, author = "A. Borodin and P. Tiwari", title = "On the decidability of sparse univariate polynomial interpolation", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "535--545", } @InProceedings{Shoup90, author = "V. Shoup", title = "Searching for primitive roots in finite fields", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "546--554", } @InProceedings{Lakshman90, author = "Y. N. Lakshman", title = "On the complexity of computing a Gr{\"o}bner basis for the radical of a zero dimensional ideal", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "555--563", } @InProceedings{LenstraEtAl90, author = "A. K. Lenstra and Jr. H. W. Lenstra and M. S. Manasse and J. M. Pollard", title = "The number field sieve", booktitle = "Proc.\ 22th ACM Symposium on Theory of Computing (STOC)", year = "1990", pages = "564--572", } @InProceedings{LundEtAl90, author = "C. Lund and L. Fortnow and H. Karloff and N. Nisan", title = "Algebraic methods for interactive proof systems", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "2--10", } @InProceedings{Shamir90, author = "A. Shamir", title = "{IP} = {PSPACE}", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "11--15", } @InProceedings{BabForLun90, author = "L. Babai and L. Fortnow and C. Lund", title = "Non-deterministic exponential time has two-prover interactive protocols", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "16--25", } @InProceedings{BabFor90, author = "L. Babai and L. Fortnow", title = "A characterization of #{P} arithmetic straight line programs", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "26--34", } @InProceedings{DolevEtAl90, author = "D. Dolev and C. Dwork and O. Waarts and M. Yung", title = "Perfectly secure message transmission", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "36--45", } @InProceedings{AloNao90, author = "N. Alon and M. Naor", title = "Coin-flipping games immune against linear-sized coalitions", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "46--54", } @InProceedings{AttLynSha90, author = "H. Attiya and N. Lynch and N. Shavit", title = "Are wait-free algorithms fast?", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "55--64", } @InProceedings{AweSak90, author = "B. Awerbuch and M. Saks", title = "A dining philosophers algorithm with polynomial response time", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "65--74", } @InProceedings{DuHwa90, author = "D. -Z. Du and F. K. Hwang", title = "An approach for proving lower bounds: Solution of Gilbert-Pollak's conjecture on Steiner ratio", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "76--85", } @InProceedings{FormannEtAl90, 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", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "86--95", } @InProceedings{CheJan90, author = "S. W. Cheng and R. Janardan", title = "New results on dynamic planar point location", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "96--105", } @InProceedings{ReiTygYos90, author = "J. H. Reif and J. D. Tygar and A. Yoshida", title = "The computability and complexity of optical beam tracing", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "106--114", } @InProceedings{ChaLaw90, author = "W. I. Chang and E. L. Lawler", title = "Approximate string matching in sublinear expected time", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "116--124", } @InProceedings{Li90, author = "M. Li", title = "Towards a {DNA} sequencing theory (Learning a string)", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "125--134", } @InProceedings{ColGalGia90, author = "L. Colussi and Z. Galil and R. Giancarlo", title = "On the exact complexity of string matching", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "135--144", } @InProceedings{DubGalMag90, author = "M. Dubiner and Z. Galil and E. Magen", title = "Faster tree pattern matching", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "145--150", } @InProceedings{Neff90, author = "C. A. Neff", title = "Specified precision polynomial root isolation is in {NC}", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "152--162", } @InProceedings{KosDel90, author = "S. R. Kosaraju and A. L. Delcher", title = "A tree-partitioning technique with applications to expression evaluation and term matching", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "163--172", } @InProceedings{Lagergren90, author = "J. Lagergren", title = "Efficient parallel algorithms for tree-decomposition and related problems", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "173--182", } @InProceedings{AngFraPit90, author = "D. Angluin and M. Frazier and L. Pitt", title = "Learning comjunctions of Horn clauses", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "186--192", } @InProceedings{GolKeaSch90, author = "S. A. Goldman and M. J. Kearns and R. E. Schapire", title = "Exact identification of circuits using fixed points of amplification functions", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "193--202", } @InProceedings{MaaTur90, author = "W. Maass and Gy. Turan", title = "On the complexity of learning from counterexamples and membership queries", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "203--210", } @InProceedings{Blum90, author = "A. Blum", title = "Separating distribution-free and mistake-bound learning models over the Boolean domain", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "211--218", } @InProceedings{Chazelle90, author = "B. Chazelle", title = "Triangulating a simple polygon in linear time", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "220--230", } @InProceedings{BerEppGil90, author = "M. Bern and D. Eppstein and J. Gilbert", title = "Provably good mesh generation", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "231--241", } @InProceedings{ChazelleEtAl90, 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", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "242--251", } @InProceedings{BerOve90, author = "M. deBerg and M. H. Overmars", title = "Hidden surface removal for axis-parallel polyhedra", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "252--261", } @InProceedings{LeiPla90, author = "T. Leighton and C. G. Plaxton", title = "A (fairly) simple circuit that (usually) sorts", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "264--274", } @InProceedings{AssUpf90, author = "S. Assaf and E. Upfal", title = "Fault tolerant sorting network", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "275--284", } @InProceedings{KaklamanisEtAl90, 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", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "285--296", } @InProceedings{BayBil90, author = "P. Bay and G. Bilardi", title = "Deterministic on-line routing on area-universal networks", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "297--306", } @InProceedings{FeiLapSha90, author = "U. Feige and D. Lapidot and A. Shamir", title = "Multiple non-interactive zero knowledge proofs based on a single random string", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "308--317", } @InProceedings{GoldreichEtAl90, author = "O. Goldreich and R. Impagliazzo and L. Levin and R. Venkatesan and D. Zuckerman", title = "Security preserving amplification of hardness", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "318--326", } @InProceedings{StuZha90, author = "C. Sturtivant and Z. -L. Zhang", title = "Efficiently inverting bijections given by straight line programs", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "327--334", } @InProceedings{ChoGerKus90, author = "B. Chor and M. Gereb-Graus and E. Kushilevitz", title = "Private computations over the integers", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "335--344", } @InProceedings{LovSim90, author = "L. Lovasz and M. Simonovits", title = "The mixing rate of Markov chains, an isoperimetric inequality, and computing the volume", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "346--354", } @InProceedings{DenPap90, author = "X. Deng and C. H. Papadimitriou", title = "Exploring an unknown graph", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "355--361", } @InProceedings{KanWar90, author = "S. Kannan and T. Warnow", title = "Inferring evolutionary history from {DNA} sequences", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "362--371", } @InProceedings{FicMunPob90, author = "F. E. Fich and J. I. Munro and P. V. Poblete", title = "Permuting", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "372--379", } @InProceedings{KeaSch90, author = "M. J. Kearns and R. E. Schapire", title = "Efficient distribution-free learning of probabilistic concepts", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "382--391", } @InProceedings{AldVaz90, author = "D. Aldous and U. Vazirani", title = "A Markovian extension of Valiant's learning model", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "392--396", } @InProceedings{PatSak90, author = "R. Paturi and M. E. Saks", title = "On threshold circuits for parity", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "397--404", } @InProceedings{Fulk90, author = "M. A. Fulk", title = "Robust separations in inductive inference", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "405--410", } @InProceedings{Abrahamson90, author = "K. Abrahamson", title = "A time-space tradeoff for Boolean matrix multiplication", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "412--419", } @InProceedings{BeaTomYan90, author = "P. Beame and M. Tompa and P. Yan", title = "Communication-space tradeoffs for unrestricted protocols", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "420--428", } @InProceedings{BeameEtAl90, author = "P. Beame and A. Borodin and P. Raghavan and W. L. Ruzzo and M. Tompa", title = "Time-space tradeoffs for undirected graph traversal", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "429--438", } @InProceedings{Istrail90, author = "S. Istrail", title = "Constructing generalized universal traversing sequences of polynomial size for graphs with small diameter", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "439--448", } @InProceedings{FiaRabRav90, author = "A. Fiat and Y. Rabani and Y. Ravid", title = "Competitive $k$-server algorithms", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "454--463", } @InProceedings{Vishwanathan90, author = "S. Vishwanathan", title = "Randomized online graph coloring", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "464--469", } @InProceedings{Irani90, author = "S. Irani", title = "Coloring inductive graphs on-line", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "470--479", } @InProceedings{ColRag90, author = "R. Cole and A. Raghunathan", title = "Online algorithms for finger searching", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "480--489", } @InProceedings{AweCidKut90, author = "B. Awerbuch and I. Cidon and S. Kutten", title = "Communication-optimal maintenance of replicated information", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "492--502", } @InProceedings{AwePel90, author = "B. Awerbuch and D. Peleg", title = "Sparse partitions", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "503--513", } @InProceedings{AwePel90, author = "B. Awerbuch and D. Peleg", title = "Network synchronization with polylogarithmic overhead", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "514--522", } @InProceedings{Zuckerman90, author = "D. Zuckerman", title = "General weak random sources", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "534--543", } @InProceedings{AlonEtAl90, author = "N. Alon and O. Goldreich and J. Hastad and R. Peralta", title = "Simple constructions of almost $k$-wise independent random variables", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "544--553", } @InProceedings{Blum90, author = "A. Blum", title = "Some tools for approximate 3-coloring", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "554--562", } @InProceedings{BelGolGol90, author = "M. Bellare and O. Goldreich and S. Goldwasser", title = "Randomness in interactive proofs", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "563--572", } @InProceedings{AloMeg90, author = "N. Alon and N. Megiddo", title = "Parallel linear programming in fixed dimension almost surely in constant time", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "574--582", } @InProceedings{Vaidya90, author = "P. M. Vaidya", title = "Reducing the parallel complexity of certain linear programming problems", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "583--589", } @InProceedings{MarSubPar90, author = "C. Martel and R. Subramonian and A. Park", title = "Asynchronous {PRAM}s are (almost) as good as synchronous {PRAM}s", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "590--599", } @InProceedings{AlpCarFei90, author = "B. Alpern and L. Carter and E. Feig", title = "Uniform memory hierarchies", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "600--608", } @InProceedings{HasGol90, author = "J. Hastad and M. Goldmann", title = "On the power of small-depth threshold circuits", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "610--618", } @InProceedings{Yao90, author = "A. C. -C. Yao", title = "On {ACC} and threshold circuits", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "619--627", } @InProceedings{Smolensky90, 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", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "628--631", } @InProceedings{BruSmo90, author = "J. Bruck and R. Smolensky", title = "Polynomial threshold functions, ${AC}^0$ functions and spectral norms", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "632--641", } @InProceedings{PatPipZwi90, author = "M. S. Paterson and N. Pippenger and U. Zwick", title = "Faster circuits and shorter formulae for multiple addition, multiplication and symmetric Boolean functions", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "642--650", } @InProceedings{HarRaz90, author = "D. Harel and D. Raz", title = "Deciding properties of nonregular programs", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "652--661", } @InProceedings{LincolnEtAl90, author = "P. Lincoln and J. Michell and A. Scedrov and N. Shankar", title = "Decision problems for propositional linear logic", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "662--671", } @InProceedings{MalPnu90, author = "O. Maler and A. Pnueli", title = "Tight bounds on the complexity of cascaded decomposition of automata", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "672--682", } @InProceedings{KamFra90, author = "M. Kaminski and N. Francez", title = "Finite-memory automata", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "683--688", } @InProceedings{Lynch90, author = "J. F. Lynch", title = "Probabilities of sentences about very sparse random graphs", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "689--696", } @InProceedings{NaoGusMar90, author = "D. Naor and D. Gusfield and C. Martel", title = "A fast algorithm for optimally increasing the edge-connectivity", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "698--707", } @InProceedings{Frank90, author = "A. Frank", title = "Augmenting graphs to meet edge-connectivity requirements", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "708--718", } @InProceedings{FreWil90, author = "M. L. Fredman and D. E. Willard", title = "Trans-dichotomous algorithms for minimum spanning trees and shortest paths", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "719--725", } @InProceedings{KleinEtAl90, author = "P. Klein and A. Agrawal and R. Ravi and S. Rao", title = "Approximation through multicommodity flow", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "726--737", } @InProceedings{EveLitWin90, author = "S. Even and A. Litman and P. Winkler", title = "Computing with snakes in directed networks of automata", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "740--745", } @InProceedings{PnuRos90, author = "A. Pnueli and R. Rosner", title = "Distributed reactive systems are hard to synthesize", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "746--757", } @InProceedings{LuoTsi90, author = "Z. -Q. Luo and J. N. Tsitsiklis", title = "Communication complexity of algebraic computation", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "758--765", } @InProceedings{CanGol90, author = "R. Canetti and O. Goldreich", title = "Bounds on tradeoffs between randomness and communication complexity", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "766--775", } @InProceedings{Toda90, author = "S. Toda", title = "The complexity of finding medians", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "778--787", } @InProceedings{BusPapTsi90, author = "S. Buss and C. H. Papadimitriou and J. N. Tsitsiklis", title = "On the predictability of coupled automata: An allegory about chaos", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "788--793", } @InProceedings{Papadimitriou90, author = "C. H. Papadimitriou", title = "On graph-theoretic lemmata and complexity classes", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "794--801", } @InProceedings{Gurevich90, author = "Y. Gurevich", title = "Matrix decomposition problem is complete for the average case", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "802--811", } @InProceedings{ImpLev90, author = "R. Impagliazzo and L. A. Levin", title = "No better ways to generate hard {NP} instances than picking uniformly at random", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "812--821", } @InProceedings{KosPac90, author = "A. Koscielski and L. Pacholski", title = "Complexity of unification in free groups and free semi-groups", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "824--829", } @InProceedings{ValFla90, author = "B. Vallee and P. Flajolet", title = "The lattice reduction algorithm of Gauss: An average case analysis", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "830--839", } @InProceedings{GriKarSin90, author = "D. Yu. Grigoriev and M. Karpinski and M. F. Singer", title = "Interpolation of sparse rational functions without knowing bounds on exponents", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "840--846", } @InProceedings{HorHua90, author = "G. Horng and M. -D. A. Huang", title = "Simplifying nested radicals and solving polynomials by radicals in minimum depth", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "847--856", } @InProceedings{BabaiEtAl90, author = "L. Babai and G. Hetyei and W. M. Kantor and A. Lubotzky and A. Seress", title = "On the diameter of finite groups", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "857--865", } @InProceedings{BerkmanEtAl90, author = "O. Berkman and J. Ja'Ja' and S. Krishnamurthy and R. Thurimella and U. Vishkin", title = "Some triply-logarithmic parallel algorithms", booktitle = "Proc.\ 31th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1990", pages = "871--881", } @InProceedings{BeiReiSpi91, author = "R. Beigel and N. Reingold and D. Spielman", title = "{PP} is closed under intersection", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "1--9", } @InProceedings{Ko91, author = "K. Ko", title = "Integral equations, systems of quadratic equations, and exponential-time completeness", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "10--20", } @InProceedings{BabaiEtAl91, author = "L. Babai and L. Fortnow and L. A. Levin and M. Szegedy", title = "Checking computations in polylogarithmic time", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "21--31", } @InProceedings{GemmellEtAl91, author = "P. Gemmell and R. Lipton and R. Rubinfeld and M. Sudan and A. Wigderson", title = "Self-testing/correcting for polynomials and for approximate functions", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "32--42", } @InProceedings{BarRuz91, author = "G. Barnes and W. L. Ruzzo", title = "Deterministic algorithms for undirected s-t connectivity using polynomial time and sublinear space", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "43--53", } @InProceedings{Kaltofen91, author = "E. Kaltofen", title = "Effective Noether irreducibility forms and applications", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "54--63", } @InProceedings{Adleman91, author = "L. Adleman", title = "Factoring numbers using singular integers", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "64--71", } @InProceedings{BucSho91, author = "J. Buchmann and V. Shoup", title = "Constructing nonresidues in finite fields and the extended Riemann hypothesis", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "72--79", } @InProceedings{MenVanOka91, author = "A. Menezes and S. Vanstone and T. Okamoto", title = "Reducing elliptic curve logarithms to logarithms in a finite field", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "80--89", } @InProceedings{BabaiEtAl91, author = "L. Babai and G. Cooperman and L. Finkelstein and E. Luks and A. Seress", title = "Fast Monte Carlo algorithms for permutation groups", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "90--100", } @InProceedings{LeightonEtAl91, author = "T. Leighton and F. Makedon and S. Plotkin and C. Stein and E. Tardos and S. Tragoudas", title = "Fast approximation algorithms for multicommodity flow problems", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "101--111", } @InProceedings{Gabow91, author = "H. N. Gabow", title = "A matroid approach to finding edge connectivity and packing arborescences", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "112--122", } @InProceedings{FedMot91, author = "T. Feder and R. Motwani", title = "Clique partitions, graph compression, and speeding-up algorithms", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "123--133", } @InProceedings{AgrKleRav91, author = "A. Agrawal and P. Klein and R. Ravi", title = "When trees collide: An approximation algorithm for the generalized Steiner problem on networks", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "134--144", } @InProceedings{CohMeg91, author = "E. Cohen and N. Megiddo", title = "Improved algorithms for linear inequalities with two variables per inequality", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "145--155", } @InProceedings{AppKan91, author = "D. Applegate and R. Kannan", title = "Sampling and integration of near log-concave functions", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "156--163", } @InProceedings{Babai91, author = "L. Babai", title = "Local expansion of vertex-transitive graphs and random generation in finite groups", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "164--174", } @InProceedings{BriWin91, author = "G. Brightwell and P. Winkler", title = "Counting linear extensions is #{P}-complete", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "175--181", } @InProceedings{BroFriSha91, author = "A. Z. Broder and A. M. Frieze and E. Shamir", title = "Finding hidden Hamiltonian cycles", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "182--189", } @InProceedings{Karp91, author = "R. M. Karp", title = "Probabilistic recurrence relations", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "190--197", } @InProceedings{Shapiro91, author = "E. Shapiro", title = "Separating concurrent languages with categories of language embeddings", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "198--208", } @InProceedings{AbiVia91, author = "S. Abiteboul and V. Vianu", title = "Generic computation and its complexity", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "209--219", } @InProceedings{Harel91, author = "D. Harel", title = "Hamiltonian paths in infinite graphs", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "220--229", } @InProceedings{CoffmanEtAl91, author = "Jr. E. G. Coffman and C. A. Courcoubetis and M. R. Garey and D. S. Johnson and L. A. McGeoch and P. W. Shor and R. R. Weber and M. Yannakakis", title = "Fundamental discrepancies between average-case analyses under discrete and continuous distributions: {A} bin packing case study", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "230--240", } @InProceedings{CofGar91, author = "Jr. E. G. Coffman and M. R. Garey", title = "Proof of the 4/3 conjecture for preemptive vs. nonpreemptive two-processor scheduling", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "241--248", } @InProceedings{BorodinEtAl91, author = "A. Borodin and S. Irani and P. Raghavan and B. Schieber", title = "Competitive paging with locality of reference", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "249--259", } @InProceedings{Grove91, author = "E. Grove", title = "The harmonic online ${K}$-server algorithm is competitive", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "260--266", } @InProceedings{Kahan91, author = "S. Kahan", title = "A model for data in motion", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "267--277", } @InProceedings{KarRabRav91, author = "H. Karloff and Y. Rabani and Y. Ravid", title = "Lower bounds for randomized $k$-server and motion planning algorithms", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "278--288", } @InProceedings{DenMah91, author = "X. Deng and S. Mahajan", title = "Infinite games, randomization, computability, and applications to online problems", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "289--298", } @InProceedings{Hagerup91, author = "T. Hagerup", title = "Constant-time parallel integer sorting", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "299--306", } @InProceedings{MatVis91, author = "Y. Matias and U. Vishkin", title = "Converting high probability into nearly-constant time, with applications to parallel hashing", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "307--316", } @InProceedings{GalIta91, author = "Z. Galil and G. F. Italiano", title = "Fully dynamic algorithms for edge-connectivity problems", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "317--327", } @InProceedings{BlumEtAl91, author = "A. Blum and T. Jiang and M. Li and J. Tromp and M. Yannakakis", title = "Linear approximation of shortest superstrings", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "328--336", } @InProceedings{DjiRei91, author = "H. Djidjev and J. Reif", title = "An efficient algorithm for the genus problem with explicit construction of forbidden subgraphs", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "337--347", } @InProceedings{AspHerSha91, author = "J. Aspnes and M. Herlihy and N. Shavit", title = "Counting networks and multi-processor coordination", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "348--358", } @InProceedings{AttiyaEtAl91, author = "H. Attiya and C. Dwork and N. Lynch and L. Stockmeyer", title = "Bounds on the time to reach agreement in the presence of timing uncertainty", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "359--369", } @InProceedings{AndWol91, author = "R. J. Anderson and H. Woll", title = "Wait-free parallel algorithms for the union-find problem", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "370--380", } @InProceedings{KedemEtAl91, author = "Z. M. Kedem and K. V. Palem and A. Raghunathan and P. G. Spirakis", title = "Combining tentative and definite executions for very fast dependable parallel computing", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "381--390", } @InProceedings{CheThu91, author = "J. Cheriyan and R. Thurimella", title = "Algorithms for parallel $k$-vertex connectivity and sparse certificates", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "391--401", } @InProceedings{AspnesEtAl91, author = "J. Aspnes and R. Beigel and M. Furst and S. Rudich", title = "The expressive power of voting polynomials", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "402--409", } @InProceedings{Nisan91, author = "N. Nisan", title = "Lower bounds for non-commutative computation", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "410--418", } @InProceedings{NisWig91, author = "N. Nisan and A. Wigderson", title = "Rounds in communication complexity revisited", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "419--429", } @InProceedings{LubVel91, author = "M. Luby and B. Velickovic", title = "On deterministic approximation of {DNF}", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "430--438", } @InProceedings{BreGal91, author = "D. Breslauer and Z. Galil", title = "A lower bound for parallel string matching", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "439--443", } @InProceedings{AngKha91, author = "D. Angluin and M. Kharitonov", title = "When won't membership queries help", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "444--454", } @InProceedings{KusMan91, author = "E. Kushilevitz and Y. Mansour", title = "Learning decision trees using the Fourier sprectrum", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "455--464", } @InProceedings{LitLonWar91, author = "N. Littlestone and P. M. Long and M. K. Warmuth", title = "On-line learning of linear functions", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "465--475", } @InProceedings{YanLee91, author = "M. Yannakakis and D. Lee", title = "Testing finite state machines", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "476--485", } @InProceedings{AslDha91, author = "J. A. Aslam and A. Dhagat", title = "Searching in the presence of linearly bounded errors", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "486--493", } @InProceedings{BluRagSch91, author = "A. Blum and P. Raghavan and B. Schieber", title = "Navigating in unfamiliar geometric terrain", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "494--504", } @InProceedings{Matousek91, author = "J. Matousek", title = "Approximations and optimal geometric divide-and-conquer", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "505--511", } @InProceedings{Mulmuley91, author = "K. Mulmuley", title = "Hidden surface removal with respect to a moving view point", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "512--522", } @InProceedings{GooTam91, author = "M. T. Goodrich and R. Tamassia", title = "Dynamic trees and dynamic point location", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "523--533", } @InProceedings{FiaNao91, author = "A. Fiat and M. Naor", title = "Rigorous time/space tradeoffs for inverting functions", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "534--541", } @InProceedings{DolDwoNao91, author = "D. Dolev and C. Dwork and M. Naor", title = "Non-malleable cryptography", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "542--552", } @InProceedings{Kilian91, author = "J. Kilian", title = "A general completeness theorems for 2-party games", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "553--560", } @InProceedings{Maurer91, author = "U. M. Maurer", title = "Perfect cryptographic security from partially independent channels", booktitle = "Proc.\ 23th ACM Symposium on Theory of Computing (STOC)", year = "1991", pages = "561--571", } @InProceedings{FeigeEtAl91, author = "U. Feige and S. Goldwasser and L. Lovasz and S. Safra and M. Szegedy", title = "Approximating clique is almost {NP}-Complete", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "2--12", } @InProceedings{LapSha91, author = "D. Lapidot and A. Shamir", title = "Fully parallelized multi prover protocols for {NEXP}-time", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "13--18", } @InProceedings{BeigelEtAl91, author = "R. Beigel and M. Bellare and J. Feigenbaum and S. Goldwasser", title = "Languages that are easier than their proofs", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "19--28", } @InProceedings{Chazelle91, author = "B. Chazelle", title = "An optimal convex hull algorithm and new results on cuttings", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "29--38", } @InProceedings{HofKauKri91, author = "F. Hoffman and M. Kaufmann and K. Kriegel", title = "The art gallery theorem for polygons with holes", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "39--48", } @InProceedings{MatousekEtAl91, 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", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "49--58", } @InProceedings{GolPet91, author = "O. Goldreich and E. Petrank", title = "Quantifying knowledge complexity", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "59--68", } @InProceedings{BoyBraPer91, author = "J. Boyar and G. Brassard and R. Peralta", title = "Subquadratic zero-knowledge", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "69--78", } @InProceedings{Zuckerman91, author = "D. Zuckerman", title = "Simulating {BPP} using a general weak random source", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "79--89", } @InProceedings{BlumEtAl91, author = "MBlum and W. Evans and P. Gemmell and S. Kannan and M. Naor", title = "Checking the correctness of memories", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "90--99", } @InProceedings{BaruahEtAl91, 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", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "100--110", } @InProceedings{FelSgaTen91, author = "A. Feldmann and J. Sgall and S. -H. Teng", title = "Dynamic scheduling on parallel machines", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "111--120", } @InProceedings{VitKri91, author = "J. S. Vitter and P. Krishnan", title = "Optimal prefetching via data compression", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "121--130", } @InProceedings{ShmWeiWil91, author = "D. B. Shmoys and J. Wein and D. P. Williamson", title = "Scheduling parallel machines on-line", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "131--140", } @InProceedings{Kunde91, author = "M. Kunde", title = "Concentrated regular data streams on grids: sorting and routing near to the bisection bound", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "141--150", } @InProceedings{WuKun91, author = "I. -C. Wu and H. T. Kung", title = "Communication complexity for parallel divide-and-conquer", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "151--162", } @InProceedings{Papadimitriou91, author = "C. H. Papadimitriou", title = "On selecting a satisfying truth assignment", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "163--169", } @InProceedings{AizPit91, author = "H. Aizenstein and L. Pitt", title = "Exact learning of read-twice {DNF} formulas", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "170--179", } @InProceedings{Mulmuley91, author = "K. Mulmuley", title = "Randomized multidimensional search trees: lazy balancing and dynamic shuffling", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "180--196", } @InProceedings{Schwarzkopf91, author = "O. Schwarzkopf", title = "Dynamic maintenance of geometric structures made easy", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "197--206", } @InProceedings{Matousek91, author = "J. Matousek", title = "Reporting points in halfspaces", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "207--215", } @InProceedings{Mulmuley91, author = "K. Mulmuley", title = "Randomized multidimensional search trees: further results in dynamic sampling", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "216--227", } @InProceedings{Orlitsky91, author = "A. Orlitsky", title = "Interactive communication: balanced distributions, correlated files, and average-case complexity", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "228--238", } @InProceedings{FedKusNao91, author = "T. Feder and E. Kushilevitz and M. Naor", title = "Amortized communication complexity", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "239--248", } @InProceedings{EdmondsEtAl91, author = "J. Edmonds and S. Rudich and R. Impagliazzo and J. Sgall", title = "Communication complexity towards lower bounds on circuit depth", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "249--257", } @InProceedings{AweVar91, author = "B. Awerbuch and G. Varghese", title = "Distributed program checking: a paradigm for building self-stabilizing distributed protocols", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "258--267", } @InProceedings{AwePatVar91, author = "B. Awerbuch and B. Patt-Shamir and G. Varghese", title = "Self-stabilization by local checking and correction", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "268--277", } @InProceedings{Wang91, author = "W. Wang", title = "An asynchronous two-dimensional self-correcting cellular automaton", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "278--285", } @InProceedings{FiatEtAl91, author = "A. Fiat and D. P. Foster and H. Karloff and Y. Rabani and Y. Ravid and S. Vishwanathan", title = "Competitive algorithms for layered graph traversal", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "288--297", } @InProceedings{DenKamPap91, author = "X. Deng and T. Kameda and C. H. Papadimitriou", title = "How to learn an unknown environment", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "298--303", } @InProceedings{Klein91, author = "R. Klein", title = "Walking an unknown street with bounded detour", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "304--313", } @InProceedings{Radhakrishnan91, author = "J. Radhakrishnan", title = "Better bounds for threshold formulas", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "314--323", } @InProceedings{PatZwi91, author = "M. S. Paterson and U. Zwick", title = "Shrinkage of de Morgan formulae under restriction", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "324--333", } @InProceedings{BshCleEbe91, author = "N. H. Bshouty and R. Cleve and W. Eberly", title = "Size-depth tradeoffs for algebraic formulae", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "334--341", } @InProceedings{KapCoo91, author = "B. Kapron and S. A. Cook", title = "A new characterization of Mehlhorn's polynomial time functionals", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "342--347", } @InProceedings{Verma91, author = "R. M. Verma", title = "A theory of using history for equational systems with applications", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "348--357", } @InProceedings{Klarlund91, author = "N. Klarlund", title = "Progress measures for complementation of $ \omega $-automata with applications to temporal logic", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "358--367", } @InProceedings{EmeJut91, author = "E. A. Emerson and C. S. Jutla", title = "Tree automata, mu-calculus and determinacy", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "368--377", } @InProceedings{ShoSmo91, author = "V. Shoup and R. Smolensky", title = "Lower bounds for polynomial evaluation and interpolation problems", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "378--383", } @InProceedings{Gathen91, author = "J. von zur Gathen", title = "Efficient exponentiation in finite fields", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "384--391", } @InProceedings{Morgenstern91, author = "M. Morgenstern", title = "Explicit construction of natural bounded concentrators", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "392--397", } @InProceedings{Kahale91, author = "N. Kahale", title = "Better expansion for Ramanujsn graphs", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "398--404", } @InProceedings{EmiCan91, author = "I. Emiris and J. Canny", title = "A general approach to removing degeneracies", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "405--413", } @InProceedings{EdeTan91, author = "H. Edelsbrunner and T. S. Tan", title = "A quadratic time algorithm for the minmax length triangulation", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "414--423", } @InProceedings{MatWelWer91, author = "J. Matousek and E. Welzl and L. Wernisch", title = "Discrepancy and $ \epsilon $-approximations for bounded {VC}-dimension", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "424--430", } @InProceedings{DuZhaFen91, author = "D. -Z. Du and Y. Zhang and Q. Feng", title = "On better heuristic for Euclidean Steiner minimum trees", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "431--439", } @InProceedings{AumBen91, author = "Y. Aumann and M. Ben-Or", title = "Asymptotically optimal {PRAM} emulation on faulty hypercubes", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "440--446", } @InProceedings{GolGolLin91, author = "O. Goldreich and S. Goldwasser and N. Linial", title = "Fault-tolerant computation in the full information model", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "447--457", } @InProceedings{LeiMaPla91, author = "T. Leighton and Y. Ma and C. G. Plaxton", title = "Highly fault-tolerant sorting circuits", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "458--469", } @InProceedings{LeiSch91, author = "T. Leighton and E. J. Schwabe", title = "Efficient algorithms for dynamic allocation of distributed memory", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "470--479", } @InProceedings{AdlBel91, 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", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "480--487", } @InProceedings{Eppstein91, author = "D. Eppstein", title = "Dynamic three-dimensional linear programming", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "488--494", } @InProceedings{PloShmTar91, author = "S. A. Plotkin and D. B. Shmoys and E. Tardos", title = "Fast approximation algorithms for fractional packing and covering problems", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "495--504", } @InProceedings{AweSch91, author = "B. Awerbuch and L. J. Schulman", title = "The maintenance of common data in a distributed system", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "505--514", } @InProceedings{NaoRot91, author = "M. Naor and R. M. Roth", title = "Optimal file sharing in distributed networks", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "515--525", } @InProceedings{HerShaWaa91, author = "M. Herlihy and N. Shavit and O. Waarts", title = "Low contention linearizable counting", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "526--535", } @InProceedings{MilTenVav91, author = "G. L. Miller and S. -H. Teng and S. A. Vavasis", title = "A unified geometric approach to graph separators", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "538--547", } @InProceedings{HsuRam91, author = "T. -S. Hsu and V. Ramachandran", title = "A linear time algorithm for triconnectivity augmentation", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "548--559", } @InProceedings{KarKolPhi91, author = "D. R. Karger and D. Koller and S. J. Phillips", title = "Finding the hidden path: time bounds for all-pairs shortest paths", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "560--568", } @InProceedings{AloGalMar91, author = "N. Alon and Z. Galil and O. Margalit", title = "On the exponent of the all pairs shortest path problem", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "569--575", } @InProceedings{LovaszEtAl91, author = "L. Lovasz and M. Naor and I. Newman and A. Wigderson", title = "Search problems in the decision tree model", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "576--585", } @InProceedings{Alon91, author = "N. Alon", title = "A parallel algorithmic version of the local lemma", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "586--593", } @InProceedings{Gal91, author = "A. Gal", title = "Lower bounds for the complexity of reliable Boolean circuits with noisy gates", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "594--601", } @InProceedings{ReiSch91, author = "R. Reischuk and B. Schmeltz", title = "Reliable computation with noisy circuits and decision trees: {A} general $n \log n$ lower bound", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "602--611", } @InProceedings{Sundar91, author = "R. Sundar", title = "A lower bound for the dictionary problem under a hashing model", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "612--621", } @InProceedings{BenGal91, author = "A. M. Ben-Amram and Z. Galil", title = "Lower bounds for data structure problems on {RAM}s", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "622--631", } @InProceedings{Frederickson91, author = "G. N. Frederickson", title = "Ambivalent data structures for dynamic 2-edge-connectivity and $k$ smallest spanning trees", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "632--641", } @InProceedings{AndOtt91, author = "A. Andersson and R. Ottmann", title = "Faster uniquely represented dictionaries", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "642--649", } @InProceedings{DonCha91, author = "B. R. Donald and D. R. Chang", title = "On the complexity of computing the homology type of a triangulation", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "650--661", } @InProceedings{GriKar91, author = "D. Grigoriev and M. Karpinski", title = "An approximation algorithm for the number of zeros of arbitrary polynomials over ${GF}\[q\]$", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "662--669", } @InProceedings{Blomer91, author = "J. Blomer", title = "Computing sums of radicals in polynomial time", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "670--677", } @InProceedings{HuaIer91, author = "M. -D. Huang and D. Ierardi", title = "Efficient algorithms for the Riemann-Roch problem and for addition in the Jacobian of a curve", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "678--687", } @InProceedings{JohMet91, author = "D. B. Johnson and P. Metaxas", title = "Connected components in ${O}(\lg^{3/2} \|{V}\|)$ parallel time for the {CREW} {PRAM}", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "688--697", } @InProceedings{GilMatVis91, author = "J. Gil and Y. Matias and U. Vishkin", title = "Towards a theory of nearly constant time parallel algorithms", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "698--710", } @InProceedings{Goodrich91, author = "M. T. Goodrich", title = "Using approximation algorithms to design parallel algorithms that may ignore processor allocation", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "711--722", } @InProceedings{Gazit91, author = "H. Gazit", title = "A deterministic parallel algorithm for planar graphs isomorphism", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "723--732", } @InProceedings{91, author = "", title = "", booktitle = "Proc.\ 0th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "", pages = "", } @InProceedings{SarVaz91, author = "H. Saran and V. V. Vazirani", title = "Finding k-cuts within twice the optimal", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "743--751", } @InProceedings{Shor91, author = "P. W. Shor", title = "How to pack better than best fit: tight bounds for average-case on-line bin packing", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "752--759", } @InProceedings{AmiFar91, author = "A. Amir and M. Farach", title = "Adaptive dictionary matching", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "760--766", } @InProceedings{MaaSchSon91, author = "W. Maass and G. Schnitger and E. D. Sontag", title = "On the computational power of sigmoid versus Boolean threshold circuits", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "767--776", } @InProceedings{KraWaa91, 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", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "777--782", } @InProceedings{BeiTar91, author = "R. Beigel and J. Tarui", title = "On {ACC}", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "783--792", } @InProceedings{KanevskyEtAl91, author = "A. Kanevsky and R. Tamassia and G. DiBattsita and J. Chen", title = "On-line maintenance of the four-connected components of a graph", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "793--801", } @InProceedings{GupImp91, author = "A. Gupta and R. Impagliazzo", title = "Computing planar intertwines", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "802--811", } @InProceedings{Gabow91, author = "H. N. Gabow", title = "Applications of a poset representation to edge connectivity and graph rigidity", booktitle = "Proc.\ 32th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1991", pages = "812--821", } @InProceedings{AzarEtAl92, author = "Y. Azar and A. Z. Broder and A. R. Karlin and N. Linial and S. Phillips", title = "Biased random walks", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "1--9", } @InProceedings{EvenEtAl92, author = "G. Even and O. Goldreich and M. Luby and N. Nisan and B. Velickovic", title = "Approximations of general independent distributions", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "10--16", } @InProceedings{Schulman92, author = "L. J. Schulman", title = "Sample spaces uniform on neighborhoods", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "17--25", } @InProceedings{FedMih92, author = "T. Feder and M. Mihail", title = "Balanced matroids", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "26--38", } @InProceedings{BarFiaRab92, author = "Y. Bartal and A. Fiat and Y. Rabani", title = "Competitive algorithms for distributed data management", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "39--50", } @InProceedings{BartalEtAl92, author = "Y. Bartal and A. Fiat and H. Karloff and R. Vohra", title = "New algorithms for an ancient scheduling problem", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "51--58", } @InProceedings{AmiBenFar92, author = "A. Amir and G. Benson and M. Farach", title = "Alphabet independent two dimensional matching", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "59--68", } @InProceedings{Galil92, author = "Z. Galil", title = "A constant-time optimal parallel string-matching algorithm", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "69--76", } @InProceedings{Leighton92, author = "T. Leighton", title = "Methods for message routing in parallel machines", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "77--96", } @InProceedings{GatSho92, author = "J. von zur Gathen and V. Shoup", title = "Computing Frobenius maps and factoring polynomials", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "97--105", } @InProceedings{Cai92, author = "J. -Y. Cai", title = "Parallel computation over hyperbolic groups", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "106--115", } @InProceedings{BeaSer92, author = "R. Beals and A. Seress", title = "Structure forest and composition factors for small base groups in nearly linear time", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "116--125", } @InProceedings{Barvinok92, author = "A. I. Barvinok", title = "Feasibility testing for systems of real quadratic equations", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "126--132", } @InProceedings{Lin92, author = "G. Lin", title = "Fault tolerant planar communication networks", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "133--139", } @InProceedings{BroFriUpf92, author = "A. Z. Broder and A. M. Frieze and E. Upfal", title = "Existence and construction of edge disjoint paths on expander graphs", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "140--149", } @InProceedings{MagSit92, author = "B. M. Maggs and R. K. Sitaraman", title = "Simple algorithms for routing on butterfly networks with bounded queues", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "150--161", } @InProceedings{AumBen92, author = "Y. Aumann and M. Ben-Or", title = "Computing with faulty arrays", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "162--169", } @InProceedings{BjoLovYao92, author = "A. Bjorner and L. Lovasz and A. C. C. Yao", title = "Linear decision trees: volume estimates and topological bounds", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "170--177", } @InProceedings{KahKim92, author = "J. Kahn and J. H. Kim", title = "Entropy and sorting", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "178--187", } @InProceedings{BeaLaw92, author = "P. Beame and J. Lawry", title = "Randomized versus nondeterministic communication complexity", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "188--199", } @InProceedings{BeameEtAl92, author = "P. Beame and R. Impagliazzo and J. Krajicek and T. Pitassi and P. Pudlak and A. Woods", title = "Exponential lower bounds for the pigeonhole principle", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "200--220", } @InProceedings{Reed92, author = "B. A. Reed", title = "Finding approximate separators and computing tree width quickly", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "221--228", } @InProceedings{Rao92, author = "S. B. Rao", title = "Faster algorithms for finding small edge cuts in planar graphs", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "229--240", } @InProceedings{DahlhausEtAl92, author = "E. Dahlhaus and D. S. Johnson and C. H. Papadimitriou and P. D. Seymour and M. Yannakakis", title = "The complexity of multiway cuts", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "241--251", } @InProceedings{DorTar92, author = "D. Dor and M. Tarsi", title = "Graph decomposition is {NPC} - {A} complete proof of Holyer's conjecture", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "252--263", } @InProceedings{LeeYan92, author = "D. Lee and M. Yannakakis", title = "Online minimization of transition systems", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "264--274", } @InProceedings{Safra92, author = "S. Safra", title = "Exponential determinization for $\omega$-automata with strong-fairness acceptance condition", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "275--282", } @InProceedings{BelCoo92, author = "S. Bellantoni and S. Cook", title = "A new recursion-theoretic characterization of the polytime functions", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "283--293", } @InProceedings{GroHalKol92, author = "A. J. Grove and J. Y. Halpern and D. Koller", title = "Asymptotic conditional probabilities for first-order logic", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "294--305", } @InProceedings{KedemEtAl92, author = "Z. M. Kedem and K. V. Palem and M. O. Rabin and A. Raghunathan", title = "Efficient program transformations for resilient parallel computation via randomization", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "306--317", } @InProceedings{KarLub92, author = "R. M. Karp and M. Luby", title = "Efficient {PRAM} simulation on a distributed memory machine", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "318--326", } @InProceedings{AjtMeg92, author = "M. Ajtai and N. Megiddo", title = "A deterministic poly($\log\log {N}$)-time ${N}$-processor algorithm for linear programming in fixed dimension", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "327--338", } @InProceedings{Kelsen92, author = "P. Kelsen", title = "On the parallel complexity of computing a maximal independent set in a hypergraph", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "339--350", } @InProceedings{Angluin92, author = "D. Angluin", title = "Computational learning theory: Survey and selected bibliography", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "351--369", } @InProceedings{BshHanHel92, author = "N. H. Bshouty and T. R. Hancock and L. Hellerstein", title = "Learning arithmetic read-once formulas", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "370--381", } @InProceedings{BluRud92, author = "A. Blum and S. Rudich", title = "Fast learning of $k$-term {DNF} formulas with queries", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "382--389", } @InProceedings{Ben-David92, author = "S. Ben-David", title = "Can finite samples detect singularities of real-valued functions", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "390--399", } @InProceedings{Lindell92, author = "S. Lindell", title = "A logspace algorithm for tree canonization", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "400--404", } @InProceedings{Plaxton92, author = "C. G. Plaxton", title = "A hypercubic sorting network with nearly logarithmic depth", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "405--416", } @InProceedings{KluPla92, author = "M. Klugerman and C. G. Plaxton", title = "Small-depth counting networks", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "417--428", } @InProceedings{PatZwi92, author = "M. S. Paterson and U. Zwick", title = "Shallow multiplication circuits and wise financial investments", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "429--437", } @InProceedings{BabBeaTak92, author = "L. Babai and R. Beals and P. Takacsi-Nagy", title = "Symmetry and complexity", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "438--449", } @InProceedings{Beigel92, author = "R. Beigel", title = "When do extra majority gates help? Polylog($n$) majority gates are equivalent to one", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "450--454", } @InProceedings{BarBeiRud92, author = "D. A. M. Barrington and R. Beigel and S. Rudich", title = "Representing Boolean functions as polynomials modulo composite numbers", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "455--461", } @InProceedings{NisSze92, author = "N. Nisan and M. Szegedy", title = "On the degree of Boolean functions as real polynomials", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "462--467", } @InProceedings{Paturi92, author = "R. Paturi", title = "On the degree of polynomials that approximate symmetric Boolean functions", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "468--474", } @InProceedings{Kalai92, author = "G. Kalai", title = "A subexponential randomized simplex algorithm", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "475--482", } @InProceedings{AdlBel92, author = "I. Adler and P. A. Beling", title = "Polynomial algorithms for linear programming over the algebraic numbers", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "483--494", } @InProceedings{GalItaSar92, author = "Z. Galil and G. F. Italiano and N. Sarnak", title = "Fully dynamic planarity testing", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "495--506", } @InProceedings{Goodrich92, author = "M. T. Goodrich", title = "Planar separators and parallel polygon triangulation", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "507--516", } @InProceedings{AgaMat92, author = "P. K. Agarwal and J. Matousek", title = "Ray shooting and parametric search", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "517--526", } @InProceedings{MalPap92, author = "S. Malitz and A. Papakostas", title = "On the angular resolution of planar graphs", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "527--538", } @InProceedings{LoMatSte92, author = "C-Y. Lo and J. Matousek and W. Steiger", title = "Ham-sandwich cuts in ${R}^d$", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "539--545", } @InProceedings{CalKos92, author = "P. B. Callahan and S. R. Kosaraju", title = "A decomposition of multi-dimensional point-sets with applications to $k$-nearest-neighbors and $n$-body potential fields", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "546--556", } @InProceedings{AwerbuchEtAl92, author = "B. Awerbuch and B. Patt-Shamir and D. Peleg and M. Saks", title = "Adapting to asynchronous dynamic networks", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "557--570", } @InProceedings{AweKutPel92, author = "B. Awerbuch and S. Kutten and D. Peleg", title = "Competitive distributed job scheduling", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "571--580", } @InProceedings{PanSri92, author = "A. Panconesi and A. Srinivasan", title = "Improved distributed algorithms for coloring and network decomposition problems", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "581--592", } @InProceedings{ChoSin92, author = "M. Choy and A. K. Singh", title = "Efficient fault tolerant algorithms for resource allocation in distributed systems", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "593--602", } @InProceedings{Sipser92, author = "M. Sipser", title = "The history and status of the {P} versus {NP} question", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "603--618", } @InProceedings{Nisan92, author = "N. Nisan", title = "{RL} $\subseteq$ {SC}", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "619--623", } @InProceedings{SimSze92, author = "J. Simon and M. Szegedy", title = "On the complexity of {RAM} with various operation sets", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "624--631", } @InProceedings{VenRaj92, author = "R. Venkatesan and S. Rajagopalan", title = "Average case intractability of matrix and diophantine problems", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "632--642", } @InProceedings{FeiLun92, author = "U. Feige and C. Lund", title = "On the hardness of computing the permanent of random matrices", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "643--654", } @InProceedings{DwoWaa92, author = "C. Dwork and O. Waarts", title = "Simple and efficient bounded concurrent timestamping or Bounded concurrent timestamp systems are comprehensible!", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "655--666", } @InProceedings{MayerEtAl92, author = "A. Mayer and Y. Ofek and R. Ostrovsky and M. Yung", title = "Self-stabilizing symmetry breaking in constant-space", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "667--678", } @InProceedings{AttFri92, author = "H. Attiya and R. Friedman", title = "A correctness condition for high-performance multiprocessors", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "679--690", } @InProceedings{BriOttWin92, author = "G. Brightwell and T. J. Ott and P. Winkler", title = "Target shooting with programmed random variables", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "691--698", } @InProceedings{FraYun92, author = "M. Franklin and M. Yung", title = "Communication complexity of secure computation", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "699--710", } @InProceedings{BelPet92, author = "M. Bellare and E. Petrank", title = "Making zero-knowledge provers efficient", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "711--722", } @InProceedings{Kilian92, author = "J. Kilian", title = "A note on efficient zero-knowledge proofs and arguments", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "723--732", } @InProceedings{FeiLov92, author = "U. Feige and L. Lovasz", title = "Two-prover one-round proof systems: Their power and their problems", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "733--744", } @InProceedings{Seidel92, author = "R. Seidel", title = "On the all-pairs-shortest-path problem", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "745--749", } @InProceedings{KleSai92, author = "P. N. Klein and S. Sairam", title = "A parallel randomized approximation scheme for shortest paths", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "750--758", } @InProceedings{KhuVis92, author = "S. Khuller and U. Vishkin", title = "Biconnectivity approximations and graph carvings", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "759--770", } @InProceedings{LinVit92, author = "J-H. Lin and J. S. Vitter", title = "$\varepsilon$-Approximations with minimum packing constraint violation", booktitle = "Proc.\ 24th ACM Symposium on Theory of Computing (STOC)", year = "1992", pages = "771--782", } @InProceedings{AroSaf92, author = "S. Arora and S. Safra", title = "Probabilistic checking of proofs; {A} new characterization of {NP}", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "2--13", } @InProceedings{AroraEtAl92, author = "S. Arora and C. Lund and R. Motwani and M. Sudan and M. Szegedy", title = "Proof verification and hardness of approximation problems", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "14--23", } @InProceedings{NisSzeWig92, author = "N. Nisan and E. Szemeredi and A. Wigderson", title = "Undirected connectivity in ${O} ( log^{1.5} n)$ space", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "24--29", } @InProceedings{FenForKur92, author = "S. Fenner and L. Fortnow and S. Kurtz", title = "The isomorphism conjecture holds relative to an oracle", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "30--39", } @InProceedings{BucSunTar92, 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", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "40--49", } @InProceedings{Rauch92, author = "M. Rauch", title = "Fully dynamic biconnectivity in graphs", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "50--59", } @InProceedings{EppsteinEtAl92, author = "D. Eppstein and Z. Galil and G. F. Italiano and A. Nissenzweig", title = "Sparsification - a technique for speeding up dynamic graph algorithms", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "60--69", } @InProceedings{Hsu.T.-S.92, author = "Hsu.T.-S.", title = "On four-connecting a triconnected graph", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "70--79", } @InProceedings{AgaEppMat92, author = "P. K. Agarwal and D. Eppstein and J. Matousek", title = "Dynamic half-space reporting, geometric optimization, and minimum spanning trees", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "80--89", } @InProceedings{Mulmuley92, author = "K. Mulmuley", title = "Randomized geometric algorithms and pseudo-random generators", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "90--100", } @InProceedings{Kant92, author = "G. Kant", title = "Drawing planar graphs using the $lmc$-ordering", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "101--110", } @InProceedings{Luks92, author = "E. M. Luks", title = "Computing in solvable matrix groups", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "111--120", } @InProceedings{Giesbrecht92, author = "M. Giesbrecht", title = "Fast algorithms for matrix normal forms", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "121--130", } @InProceedings{BinPan92, author = "D. Bini and V. Pan", title = "Improved parallel polynomial division and its extensions", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "131--136", } @InProceedings{AspWaa92, author = "J. Aspnes and O. Waarts", title = "Randomized consensus in expected ${O} (n \log^2 n)$ operations per processor", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "137--146", } @InProceedings{AumRab92, author = "Y. Aumann and M. O. Rabin", title = "Clock construction in fully asynchronous parallel systems and {PRAM} simulation", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "147--156", } @InProceedings{JayChaTou92, author = "P. Jayanti and T. D. Chandra and S. Toueg", title = "Fault-tolerant wait-free shared objects", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "157--166", } @InProceedings{GraMcC92, author = "E. Gradel and G. L. McColm", title = "Hierarchies in transitive closure logic, stratified datalog and infinitary logic", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "167--176", } @InProceedings{AluHen92, author = "R. Alur and T. A. Henzinger", title = "Back to the future: Towards a theory of timed regular languages", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "177--186", } @InProceedings{PitUrq92, author = "T. Pitassi and A. Urquhart", title = "The complexity of the Haj{\'o}s calculus", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "187--196", } @InProceedings{BlumEtAl92, author = "A. Blum and H. Karloff and Y. Rabani and M. Saks", title = "A decomposition theorem and bounds for randomized server problems", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "197--207", } @InProceedings{KarPhiRag92, author = "A. R. Karlin and S. J. Phillips and P. Raghavan", title = "Markov paging", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "208--217", } @InProceedings{AzaBroKar92, author = "Y. Azar and A. Z. Broder and A. R. Karlin", title = "On-line load balancing", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "218--225", } @InProceedings{PlaPooSue92, author = "C. G. Plaxton and B. Poonen and T. Suel", title = "Improved lower bounds for shellsort", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "226--235", } @InProceedings{MilPatTar92, author = "P. B. Miltersen and M. Paterson and J. Tarui", title = "The asymptotic complexity of merging networks", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "236--246", } @InProceedings{GalPar92, author = "Z. Galil and Park.K.", title = "Truly alphabet-independent two-dimensional pattern matching", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "247--256", } @InProceedings{DubZwi92, author = "M. Dubiner and U. Zwick", title = "Amplification and percolation", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "258--267", } @InProceedings{Yao92, author = "A. C. -C. Yao", title = "Algebraic decision trees and Euler characteristics", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "268--277", } @InProceedings{Grolmusz92, author = "V. Grolmusz", title = "Separating the communication complexities of {MOD} m and {MOD} p circuits", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "278--287", } @InProceedings{CopSch92, author = "D. Coppersmith and B. Schieber", title = "Lower bounds on the depth of monotone arithmetic computations", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "288--295", } @InProceedings{Kahale92, author = "N. Kahale", title = "On the second eigenvalue and linear expansion of regular graphs", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "296--303", } @InProceedings{RabSinWig92, author = "Y. Rabinovich and A. Sinclair and A. Wigderson", title = "Quadratic dynamical systems", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "304--313", } @InProceedings{Friedman92, author = "J. Friedman", title = "On the bit extraction problem", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "314--319", } @InProceedings{JerVaz92, author = "M. Jerrum and U. Vazirani", title = "A mildly exponential approximation algorithm for the permanent", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "320--326", } @InProceedings{El-YanivEtAl92, author = "R. El-Yaniv and A. Fiat and R. Karp and G. Turpin", title = "Competitive analysis of financial games", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "327--333", } @InProceedings{AlonEtAl92, 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", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "334--343", } @InProceedings{BarRos92, author = "Y. Bartal and A. Rosen", title = "The distributed $k$-server problem --- {A} competitive distributed translator for $k$-server algorithms", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "344--353", } @InProceedings{MarPac92, author = "J. Marcinkowski and L. Pacholski", title = "Undecidability of the Horn-clause implication problem", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "354--362", } @InProceedings{KozPalSch92, author = "D. Kozen and J. Palsberg and M. I. Schwartzbach", title = "Efficient inference of partial types", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "363--371", } @InProceedings{VandenBusscheEtAl92, author = "J. VandenBussche and D. VanGucht and M. Andries and M. Gyssens", title = "On the completeness of object-creating query languages", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "372--379", } @InProceedings{LenSmi92, author = "H. -P. Lenhof and M. Smid", title = "Enumerating the $k$ closest pairs optimally", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "380--386", } @InProceedings{Clarkson92, author = "K. L. Clarkson", title = "Safe and effective determinant evaluation", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "387--395", } @InProceedings{KatTokIwa92, author = "N. Katoh and T. Tokuyama and K. Iwano", title = "On minimum and maximum spanning trees of linearly moving points", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "396--405", } @InProceedings{BluGol92, author = "M. Blum and O. Goldreich", title = "Towards a computational theory of statistical tests", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "406--416", } @InProceedings{AlonEtAl92, author = "N. Alon and Z. Galil and O. Margalit and M. Naor", title = "Witnesses for Boolean matrix multiplication and for shortest paths", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "417--426", } @InProceedings{DeSPer92, author = "A. DeSantis and G. Persiano", title = "Zero-knowledge proofs of knowledge without interaction", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "427--436", } @InProceedings{Yap92, author = "C. K. Yap", title = "Fast unimodular reduction: Planar integer lattices", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "437--446", } @InProceedings{Blomer92, author = "J. Blomer", title = "How to denest Ramanujan's nested radicals", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "447--456", } @InProceedings{Eberly92, author = "W. Eberly", title = "On efficient band matrix arithmetic", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "457--463", } @InProceedings{Gartner92, author = "B. Gartner", title = "A subexponential algorithm for abstract optimization problems", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "464--472", } @InProceedings{AlonEtAl92, author = "N. Alon and R. A. Duke and H. Lefmann and V. Rodl and R. Yuster", title = "The algorithmic aspects of the regularity lemma", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "473--481", } @InProceedings{LovSim92, author = "L. Lovasz and M. Simonovits", title = "On the randomized complexity of volume and diameter", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "482--491", } @InProceedings{HelLitLon92, author = "D. P. Helmbold and N. Littlestone and P. M. Long", title = "Apple tasting and nearly one-sided learning", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "493--502", } @InProceedings{ArEtAl92, author = "S. Ar and R. J. Lipton and R. Rubinfeld and M. Sudan", title = "Reconstructing algebraic functions from mixed data", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "503--512", } @InProceedings{BshCle92, author = "N. H. Bshouty and R. Cleve", title = "On the exact learning of formulas in parallel", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "513--522", } @InProceedings{AizHelPit92, author = "H. Aizenstein and L. Hellerstein and L. Pitt", title = "Read-thrice {DNF} is hard to learn with membership and equivalence queries", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "523--532", } @InProceedings{Tamaki92, author = "H. Tamaki", title = "Efficient self-embedding of butterfly networks with random faults", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "533--541", } @InProceedings{LeiMagSit92, author = "T. Leighton and B. Maggs and R. Sitaraman", title = "On the fault tolerance of some popular bounded-degree networks", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "542--552", } @InProceedings{FeiRag92, author = "U. Feige and P. Raghavan", title = "Exact analysis of hot-potato routing", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "553--562", } @InProceedings{FelRagUpf92, author = "S. Felperin and P. Raghavan and E. Upfal", title = "A theory of wormhole routing in parallel computers", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "563--572", } @InProceedings{MitPiaArk92, author = "J. S. B. Mitchell and C. Piatko and E. M. Arkin", title = "Computing a shortest $k$-link path in a polygon", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "573--582", } @InProceedings{AggarwalEtAl92, author = "A. Aggarwal and A. Bar-Noy and S. Khuller and D. Kravets and B. Schieber", title = "Efficient minimum cost matching using quadrangle inequality", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "583--592", } @InProceedings{Wagener92, author = "H. Wagener", title = "Optimal parallel hull construction for simple polygons in ${O} ( \log\log n)$ time", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "593--599", } @InProceedings{ColHar92, author = "R. Cole and R. Hariharan", title = "Tighter bounds on the exact complexity of string matching", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "600--609", } @InProceedings{KenKen92, author = "C. Kenyon and R. Kenyon", title = "Tiling a polygon with rectangles", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "610--619", } @InProceedings{ChvRee92, author = "V. Chvatal and B. Reed", title = "Mick gets some (the odds are on his side)", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "620--627", } @InProceedings{HagRam92, author = "T. Hagerup and R. Raman", title = "Waste makes haste: Tight bounds for loose parallel sorting", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "628--637", } @InProceedings{ChaRad92, author = "S. Chaudhuri and J. Radhakrishnan", title = "The complexity of parallel prefix problems on small domains", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "638--647", } @InProceedings{Cohen92, author = "E. Cohen", title = "Approximate max flow on small depth networks", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "648--658", } @InProceedings{Radzik92, author = "T. Radzik", title = "Newton's method for fractional combinatorial optimization", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "659--669", } @InProceedings{ConCor92, author = "M. Conforti and G. Cornuejols", title = "A class of logic problems solvable by linear programming", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "670--675", } @InProceedings{Toledo92, author = "S. Toledo", title = "Maximizing non-linear concave functions in fixed dimension", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "676--685", } @InProceedings{AjtKomSze92, author = "M. Ajtai and J. Komlos and E. Szemeredi", title = "Halvers and expanders", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "686--692", } @InProceedings{AjtaiEtAl92, author = "M. Ajtai and N. Alon and J. Bruck and R. Cypher and C. Ho and M. Naor and E. Szemeredi", title = "Fault tolerant graphs, perfect hash functions and disjoint paths", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "693--702", } @InProceedings{PanReiTat92, author = "V. Y. Pan and J. H. Reif and S. R. Tate", title = "The power of combining the techiques of algebraic and numerical computing: Improved approximate multipoint polynomial evaluation and improved multipole algorithms", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "703--713", } @InProceedings{KalPan92, author = "E. Kaltofen and V. Pan", title = "Processor-efficient parallel solution of linear systems {II}: The positive characteristic and singular cases", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "714--723", } @InProceedings{Schulman92, author = "L. J. Schulman", title = "Communication on noisy channels: {A} coding theorem for computation", booktitle = "Proc.\ 33th IEEE Symposium on Foundations of Computer Science (FOCS)", year = "1992", pages = "724--733", } @InProceedings{ChoKo93, author = "A. W. Chou and K. Ko", title = "Some complexity issues on the simply connected regions of the two-dimensional plane", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "1--10", } @InProceedings{BerVaz93, author = "E. Bernstein and U. Vazirani", title = "Quantum complexity theory", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "11--20", } @InProceedings{BennettEtAl93, author = "C. H. Bennett and P. Gacs and M. Li and P. M. B. Vitanyi and W. H. Zurek", title = "Thermodynamics of computation and information distance", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "21--30", } @InProceedings{GarMos93, author = "J. Garay and Y. Moses", title = "Fully polynomial byzantine agreement in $t+1$ rounds", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "31--41", } @InProceedings{CanRab93, author = "R. Canetti and T. Rabin", title = "Fast asynchronous byzantine agreement with optimal resilience", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "42--51", } @InProceedings{BenCanGol93, author = "M. Ben-Or and R. Canetti and O. Goldreich", title = "Asynchronous secure computation", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "52--61", } @InProceedings{JiaLi93, author = "T. Jiang and M. Li", title = "$k$ one-way heads cannot do string-matching", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "62--70", } @InProceedings{Baker93, author = "B. S. Baker", title = "A theory of parameterized pattern matching: Algorithms and applications", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "71--80", } @InProceedings{IduSch93, author = "R. M. Idury and A. A. Schaffer", title = "Multiple matching of rectangular patterns", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "81--90", } @InProceedings{BorGaf93, author = "E. Borowsky and E. Gafni", title = "Generalized {FLP} impossibility result for t-resilient asynchronous computations", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "91--100", } @InProceedings{SakZah93, author = "M. Saks and F. Zaharoglou", title = "Wait-free $k$-set agreement is impossible: The topology of public knowledge", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "101--110", } @InProceedings{HerSha93, author = "M. Herlihy and N. Shavit", title = "The asynchronous computability theorem for $t$-resilient tasks", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "111--120", } @InProceedings{PapYan93, author = "C. H. Papadimitriou and M. Yannakakis", title = "Linear programming without the matrix", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "121--129", } @InProceedings{BorKos93, author = "R. S. Borgstrom and S. R. Kosaraju", title = "Comparison-based search in the presence of errors", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "130--136", } @InProceedings{FarKanWar93, author = "M. Farach and S. Kannan and T. Warnow", title = "A robust model for finding optimal evolutionary trees", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "137--145", } @InProceedings{FelWer93, author = "S. Felsner and L. Wernisch", title = "Maximum $k$-chains in planar point sets: Combinatorial structure and algorithms", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "146--153", } @InProceedings{KushilevitzEtAl93, author = "E. Kushilevitz and Y. Mansour and M. O. Rabin and D. Zuckerman", title = "Lower bounds for randomized mutual exclusion", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "154--163", } @InProceedings{AweBarFia93, author = "B. Awerbuch and Y. Bartal and A. Fiat", title = "Competitve distributed file allocation", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "164--173", } @InProceedings{DwoHerWaa93, author = "C. Dwork and M. Herlihy and O. Waarts", title = "Contention in shared memory algorithms", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "174--183", } @InProceedings{NaoSto93, author = "M. Naor and L. Stockmeyer", title = "What can be computed locally?", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "184--193", } @InProceedings{CohenEtAl93, author = "R. F. Cohen and G. DiBattista and A. Kanevsky and R. Tamassia", title = "Reinventing the wheel: An optimal data structure for connectivity queries", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "194--200", } @InProceedings{SzeVis93, author = "M. Szegedy and S. Vishwanathan", title = "Locality based graph coloring", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "201--207", } @InProceedings{EppsteinEtAl93, author = "D. Eppstein and Z. Galil and G. F. Italiano and T. H. Spencer", title = "Separator based sparsification for dynamic planar graph algorithms", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "208--217", } @InProceedings{Goldberg93, author = "L. A. Goldberg", title = "Polynomial space polynomial delay algorithms for listing families of graphs", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "218--225", } @InProceedings{Bodlaender93, author = "H. L. Bodlaender", title = "A linear time algorithm for finding tree-decompositions of small treewidth", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "226--234", } @InProceedings{NisZuc93, author = "N. Nisan and D. Zuckerman", title = "More deterministic simulation in logspace", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "235--244", } @InProceedings{WigZuc93, author = "A. Wigderson and D. Zuckerman", title = "Expanders that beat the eigenvalue bound: Explicit construction and applications", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "245--251", } @InProceedings{BopNar93, author = "R. B. Boppana and B. Narayanan", title = "The biased coin problem", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "252--257", } @InProceedings{LinialEtAl93, author = "N. Linial and M. Luby and M. Saks and D. Zuckerman", title = "Efficient construction of a small hitting set for combinatorial rectangles in high dimension", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "258--267", } @InProceedings{KolMeg93, author = "D. Koller and N. Megiddo", title = "Constructing small sample spaces satisfying given constraints", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "268--277", } @InProceedings{Karp93, author = "R. M. Karp", title = "Mapping the genome: Some combinatorial problems arising in molecular biology", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "278--285", } @InProceedings{LunYan93, author = "C. Lund and M. Yannakakis", title = "On the hardness of approximating minimization problems", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "286--293", } @InProceedings{BellareEtAl93, author = "M. Bellare and S. Goldwasser and C. Lund and A. Russell", title = "Efficient probabilistically checkable proofs and applications to approximation", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "294--304", } @InProceedings{CondonEtAl93, author = "A. Condon and J. Feigenbaum and C. Lund and P. Shor", title = "Probabilistically checkable debate systems and approximation algorithms for {PSPACE}-hard functions", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "305--314", } @InProceedings{FreundEtAl93, author = "Y. Freund and M. Kearns and D. Ron and R. Rubinfeld and R. E. Schapire and L. Sellie", title = "Efficient learning of typical finite automata from random walks", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "315--324", } @InProceedings{MacSon93, author = "A. Macintyre and E. D. Sontag", title = "Finiteness results for sigmoidal ``neural'' networks", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "325--334", } @InProceedings{Maas93, author = "W. Maas", title = "Bounds for the computational power and learning complexity of analog neural nets", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "335--344", } @InProceedings{BaruahEtAl93, author = "S. K. Baruah and N. K. Cohen and C. G. Plaxton and D. A. Varvel", title = "Proportionate progress: {A} notion of fairness in resource allocation", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "345--354", } @InProceedings{Pippenger93, author = "N. Pippenger", title = "Self-routing superconcentrators", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "355--361", } @InProceedings{BluLei93, author = "R. D. Blumofe and C. E. Leiserson", title = "Space-efficient scheduling of multithreaded computations", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "362--371", } @InProceedings{Kharitonov93, author = "M. Kharitonov", title = "Cryptographic hardness of distribution-specific learning", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "372--381", } @InProceedings{Cesa-BianchiEtAl93, author = "N. Cesa-Bianchi and Y. Freund and D. P. Helmbold and D. Haussler and R. E. Schapire and M. K. Warmuth", title = "How to use expert advice", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "382--391", } @InProceedings{Kearns93, author = "M. Kearns", title = "Efficient noise-tolerant learning from statistical queries", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "392--401", } @InProceedings{PhiWes93, author = "S. Phillips and J. Westbrook", title = "Online load balancing and network flow", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "402--411", } @InProceedings{CoffmanEtAl93, author = "E. G. Coffman and D. S. Johnson and P. W. Shor and R. R. Weber", title = "Markov chains, computer proofs, and average-case analysis of best fit bin packing", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "412--421", } @InProceedings{BerGreRag93, author = "M. Bern and D. Greene and A. Raghunathan", title = "On-line algorithms for cache sharing", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "422--430", } @InProceedings{DiBVis93, author = "G. DiBattista and L. Vismara", title = "Angles of planar triangular graphs", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "431--437", } @InProceedings{RaviEtAl93, author = "R. Ravi and M. V. Marathe and S. S. Ravi and D. J. Rosenkrantz and H. B. Hunt", title = "Many birds with one stone: Multi-objective approximation algorithms", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "438--447", } @InProceedings{LubNis93, author = "M. Luby and N. Nisan", title = "A parallel approximation algorithm for positive linear programming", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "448--457", } @InProceedings{ChaRohSri93, author = "S. Chari and P. Rohatgi and A. Srinivasan", title = "Randomness-optimal unique element isolation, with applications to perfect matching and related problems", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "458--467", } @InProceedings{Fleischer93, author = "R. Fleischer", title = "Decision trees: Old and new results", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "468--477", } @InProceedings{MatSch93, author = "J. Matousek and O. Schwarzkopf", title = "A deterministic algorithm for the three-dimensional diameter problem", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "478--484", } @InProceedings{HerSur93, author = "J. Hershberger and S. Suri", title = "Matrix searching with the shortest path metric", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "485--494", } @InProceedings{ChazelleEtAl93, author = "B. Chazelle and H. Edelsbrunner and M. Grigni and L. Guibas and M. Sharir and E. Welzl", title = "Improved bounds on weak $\epsilon$-nets for convex sets", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "495--504", } @InProceedings{BerMatSch93, author = "M. deBerg and J. Matousek and O. Schwarzkopf", title = "Piecewise linear paths among convex obstacles", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "505--514", } @InProceedings{AllJia93, author = "E. Allender and J. Jiao", title = "Depth reduction for noncommutative arithmetic circuits", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "515--522", } @InProceedings{PudRod93, author = "P. Pudlak and V. Rodl", title = "Modified ranks of tensors and the size of circuits", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "523--531", } @InProceedings{KarWig93, author = "M. Karchmer and A. Wigderson", title = "Characterizing non-deterministic circuit size", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "532--540", } @InProceedings{ImpPatSak93, author = "R. Impagliazzo and R. Paturi and M. E. Saks", title = "Size-depth trade-offs for threshold circuits", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "541--550", } @InProceedings{GolKar93, author = "M. Goldmann and M. Karpinski", title = "Simulating threshold circuits by majority circuits", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "551--560", } @InProceedings{ColMagSit93, author = "R. Cole and B. Maggs and R. Sitaraman", title = "Multi-scale self-stimulation: {A} technique for reconfiguring arrays with faults", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "561--572", } @InProceedings{BorodinEtAl93, author = "A. Borodin and P. Raghavan and B. Schieber and E. Upfal", title = "How much can hardware help routing?", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "573--582", } @InProceedings{AloChuGra93, author = "N. Alon and F. R. K. Chung and R. L. Graham", title = "Routing permutations on graphs via matchings", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "583--591", } @InProceedings{AluHenVar93, author = "R. Alur and T. A. Henzinger and M. Y. Vardi", title = "Parametric real-time reasoning", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "592--601", } @InProceedings{Jones93, author = "N. D. Jones", title = "Constant time factors do matter", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "602--611", } @InProceedings{FedVar93, author = "T. Feder and M. Y. Vardi", title = "Monotone monadic {SNP} and constraint satisfaction", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "612--622", } @InProceedings{AspnesEtAl93, author = "J. Aspnes and Y. Azar and A. Fiat and S. Plotkin and O. Waarts", title = "On-line load balancing with applications to machine scheduling and virtual circuit routing", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "623--631", } @InProceedings{AielloEtAl93, author = "W. Aiello and B. Awerbuch and B. Maggs and S. Rao", title = "Approximate load balancing on dynamic and asynchronous networks", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "632--641", } @InProceedings{FeldmannEtAl93, author = "A. Feldmann and M. Kao and J. Sgall and S. Teng", title = "Optimal online scheduling of parallel jobs with dependencies", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "642--651", } @InProceedings{AwerbuchEtAl93, author = "B. Awerbuch and S. Kutten and Y. Mansour and B. Patt-Shamir and G. Varghese", title = "Time optimal self-stabilizing synchronization", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "652--661", } @InProceedings{CooLin93, author = "J. Cooper and N. Linial", title = "Fast perfect-information leader-election protocol with linear immunity", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "662--671", } @InProceedings{RacSim93, author = "C. Rackoff and D. R. Simon", title = "Cryptographic defense against traffic analysis", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "672--681", } @InProceedings{KlePloRao93, author = "P. Klein and S. A. Plotkin and S. Rao", title = "Excluded minors, network decomposition, and multicommodity flow", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "682--690", } @InProceedings{PloTar93, author = "S. A. Plotkin and E. Tardos", title = "Improved bounds on the max-flow min-cut ratio for multicommodity flows", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "691--697", } @InProceedings{GarVazYan93, author = "N. Garg and V. V. Vazirani and M. Yannakakis", title = "Approximate max-flow min-(multi) cut theorems and their applications", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "698--707", } @InProceedings{WilliamsonEtAl93, author = "D. P. Williamson and M. X. Goemans and M. Mihail and V. V. Vazirani", title = "A primal-dual approximation algorithm for generalized Steiner network problems", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "708--717", } @InProceedings{Edmonds93, author = "J. Edmonds", title = "Time-space trade-offs for undirected ${ST}$-Connectivity on a {JAG}", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "718--727", } @InProceedings{BarFei93, author = "G. Barnes and U. Feige", title = "Short random walks on graphs", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "728--737", } @InProceedings{KenRanSin93, author = "C. Kenyon and D. Randall and A. Sinclair", title = "Matchings in lattice graphs", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "738--746", } @InProceedings{Schulman93, author = "L. J. Schulman", title = "Deterministic coding for interactive communication", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "747--756", } @InProceedings{KarSte93, author = "D. R. Karger and C. Stein", title = "An ${O}\tilde (n^2 )$ algorithm for minimum cuts", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "757--765", } @InProceedings{ParPhi93, author = "J. K. Park and C. A. Phillips", title = "Finding minimum-quotient cuts in planar graphs", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "766--775", } @InProceedings{Phillips93, author = "C. A. Phillips", title = "The network inhibition problem", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "776--785", } @InProceedings{ArEtAl93, author = "S. Ar and M. Blum and B. Codenotti and P. Gemmell", title = "Checking approximate computations over the reals", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "786--795", } @InProceedings{Shamir93, author = "A. Shamir", title = "On the generation of multivariate polynomials which are hard to factor", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "796--804", } @InProceedings{GatKarShp93, author = "J. vonzurGathen and M. Karpinski and I. Shparlinski", title = "Counting curves and their projections", booktitle = "Proc.\ 25th ACM Symposium on Theory of Computing (STOC)", year = "1993", pages = "805--812", }