F@1@1960@217-224@@@"Switching function canonical forms based on commutative and associative binary operations"@Calingaert,P. F@1@1960@225-245@@@"Truth functions realizable by single threshold organs"@Elgot,C.C. F@1@1960@246-249@@@"A method for factoring the action of asynchronous circuits"@Frazer,W.D.@Muller,D.E. F@1@1960@250-265@@@"A four-megacycle, 24-bit checked binary adder"@Homan,M.E. F@1@1960@266-272@@@"Boolean matrices applied to sequential circuit theory and threshold logics"@Ledley,R.S. F@1@1960@273-291@@@"Forcing circuitry \(en Sequential building blocks for logical design"@Meade,R.M. F@1@1960@292-308@@@"Current-operated diode logic gates"@Reinecke,H.,Jr. F@1@1960@309-320@@@"The decision and synthesis problems in semimodular switching theory"@Shelly,J.H. F@1@1960@321-332@@@"Single stage threshold logic"@Winder,R.O. F@2@1961@3-9@@@"An application of linear programming to the minimization of Boolean functions"@Cobham,A.@Fridshal,R.@North,J.H. F@2@1961@10-17@@@"Minimal sums for Boolean functions having many unspecified fundamental products"@McCluskey,E.J.,Jr. F@2@1961@18-24@@@"Use of a list processing language in programming simplification procedures"@Petrick,S.R. F@2@1961@27-33@@@"Threshold logic and two-person, zero-sum games"@Akers,S.B.,Jr. F@2@1961@34-38@@@"On the characterization of threshold functions"@Chow,C.K. F@2@1961@39-46@@@"Functional forms of majority functions and a necessary and sufficient condition for their realizability"@Muroga,S. F@2@1961@47-54@@@"The profile technique for the design of threshold device logic"@Stram,O.B. F@2@1961@55-64@@@"More about threshold logic"@Winder,R.O. F@2@1961@67-69@@@"The integrative properties of neurons"@Kennedy,D. F@2@1961@70-76@@@"Mathematical models of neurone interaction"@Landahl,H.D. F@2@1961@77-82@@@"Multivalued logic devices for simulating threshold neurons"@Boyle,D.R.@Ledley,R.S. F@2@1961@83-84@@@"Many-valued logics and reliable homeostatic mechanisms"@Cowan,J.D. F@2@1961@87-93@@@"An introduction to speed independent circuit theory"@Miller,R.E. F@2@1961@94-105@@@"One method for designing speed independent logic for a control"@Swartwout,R.E. F@2@1961@106-108@@@"Problems in the physical realization of speed independent circuits"@Robertson,J.E. F@2@1961@109-110@@@"A flow chart notation for the description of a speed-independent control"@Gillies,D.B. F@2@1961@114-128@@@"Transient behavior in iterative combinatorial switching networks"@Kilmer,W.L. F@2@1961@129-132@@@"Operations of finite automata"@Elgot,C.C.@Rutledge,J.D. F@2@1961@133-151@@@"Delayed-logic and finite-state machines"@Arden,D.N. F@2@1961@152-160@@@"Techniques for the diagnosis of switching circuit failures"@Galey,J.M.@Norby,R.E.@Roth,J.P. F@2@1961@163-165@@@"Some unsolved problems in switching theory"@Kautz,W.H. F@2@1961@166@@@"Two problems on threshold functions"@Elgot,C.C.@Muroga,S. F@2@1961@169-177@@@"Canonical forms of functions in P-valued logics"@Cohn,M. F@2@1961@178-181@@@"Boolean two-terminal analysis and synthesis"@Okada,S.@Rajappan,K.P.@Young,K.P. F@2@1961@182-194@@@"A computer program for the synthesis of combinational switching circuits"@Karp,R.M.@McFarlin,F.E.@Roth,J.P.@Wilts,J.R. F@2@1961@195-214@@@"Automatic fault detection in combinational switching networks"@Kautz,W.H. F@3@1962@5-24@@@"On the minimal third order expression of a Boolean function"@Meo,A.R. F@3@1962@25-32@@@"Research and algorithms in the theory of Boolean formulas"@Samson,E.W.@Calabi,L. F@3@1962@33-47@@@"The algebra of Boolean formulas: Some criteria for minimality"@Calabi,L.@Riley,J.A. F@3@1962@49-59@@@"Minimal Boolean expressions with more than two levels of sums and products"@Lawler,E.L. F@3@1962@61-70@@@"Machine properties preserved under state minimization"@Elgot,C.C.@Rutledge,J.D. F@3@1962@71-79@@@"A procedure for obtaining an economical asynchronous sequential circuit directly from a set of regular expressions"@Hazeltine,B. F@3@1962@81-89@@@"States of sequential machines whose logical elements involve delay"@Hohn,F.E. F@3@1962@91-102@@@"Reduction of feedback loops in sequential circuits and carry leads in iterative networks"@McCluskey,E.J. F@3@1962@103-121@@@"The synthesis of cascade switching circuits"@Levien,R.E. F@3@1962@123-136@@@"Some theorems for incompletely specified sequential machines with applications to state minimization"@Beatty,J.C.@Miller,R.E. F@3@1962@137-141@@@"Bounded-transient automata"@Winograd,S. F@3@1962@143-147@@@"Generalized automata and their information losslessness"@Even,S. F@3@1962@149-157@@@"Synthesis of combinational logic using three-input majority gates"@Akers,S.B.,Jr. F@3@1962@159-168@@@"A realization procedure for threshold gate networks"@Lewis,P.M.,II@Coates,C.L. F@3@1962@169-184@@@"Generation of self-dual threshold functions and lower bounds of the number of threshold functions and a maximum weight"@Muroga,S. F@3@1962@185-199@@@"On some transformation theorems in many-valued logical systems"@Tung,C.K. F@4@1963@3-16@@@"Infinite sequences and finite machines"@Muller,D.E. F@4@1963@17-22@@@"Two-sided finite-state transductions"@Elgot,C.C.@Mezei,J.E. F@4@1963@23-32@@@"On computability by certain classes of restricted Turing machines"@Fischer,P.C. F@4@1963@33-39@@@"Bilateral threshold nets"@Frazer,W.D. F@4@1963@41-52@@@"Threshold gate realizations of logical functions with don't cares"@Coates,C.L.@Lewis,P.M.,II F@4@1963@53-62@@@"On the analysis of functional symmetry"@Arnold,R.F.@Lawler,E.L. F@4@1963@63-82@@@"The minimal synthesis of tree structures"@Lawler,E.L. F@4@1963@83-104@@@"Determining the best ordering of variables in cascade switching circuits"@Levien,R.E. F@4@1963@105-116@@@"Sequential circuit synthesis using input delays"@Eichelberger,E.B. F@4@1963@117-130@@@"Finite automata and badly timed elements"@McNaughton,R. F@4@1963@131-136@@@"Demonstrating hazards in sequential relay circuits"@Booth,T.M. F@4@1963@137-148@@@"Logical design theory of NOR gate networks with no complemented inputs"@McCluskey,E.J. F@4@1963@149-152@@@"A survey of asynchronous logic: Comparing various definitions and models for asynchronous switching circuits"@Miller,R.E. F@5@1964@4-11@@@"Ideas on asynchronous feedback networks"@Hammel,D. F@5@1964@12-29@@@"New techniques for designing speed independent control logic"@Swartwout,R.E. F@5@1964@30-43@@@"Antiparallel control logic"@Goldberg,J.@Short,R.A. F@5@1964@44-46@@@"A census of finite automata"@Harrison,M.A. F@5@1964@47-56@@@"Turing machine recognizers for general rewriting systems"@Griffiths,T.V. F@5@1964@57-67@@@"Mappings of languages by two-tape devices"@Ginsburg,S.@Spanier,E.H. F@5@1964@68-75@@@"On formalisms for Turing machines"@Fischer,P.C. F@5@1964@76-81@@@"On $n$-tape finite state acceptors"@Rosenberg,A.L. F@5@1964@82-90@@@"Computational complexity of recursive sequences"@Hartmanis,J.@Stearns,R.E. F@5@1964@91-94@@@"A lower bound on Rado's sigma function for binary Turing machines"@Green,M.W. F@5@1964@95-110@@@"Fault detecting experiments for sequential circuits"@Hennie,F.C. F@5@1964@111-120@@@"Hazard detection in combinational and sequential switching circuits"@Eichelberger,E.B. F@5@1964@121-132@@@"Derivation of optimum test sequences for sequential machines"@Poage,J.F.@McCluskey,E.J.,Jr. F@5@1964@133-137@@@"Topological constraints on interconnection-limited logic"@Elspas,B. F@5@1964@138-148@@@"Some new results on the analysis and reliability of large polyfunctional nets"@Urbano,R.H. F@5@1964@149-155@@@"On the minimum stage realization of switching functions using logic gates with limited fan-in"@Hicks,G.L.@Bernstein,A.J. F@5@1964@156-164@@@"Reducing variable dependency in combinational circuits"@Bernstein,A.J. F@5@1964@165-173@@@"A diagrammatic approach to multi-level logic synthesis"@Akers,S.B.,Jr. F@5@1964@174-182@@@"Implication techniques for Boolean functions"@Gaines,R.S. F@5@1964@183-191@@@"A reduction technique for prime implicant tables"@Gimpel,J.F. F@5@1964@192-196@@@"On the application of pair algebra to automata theory"@Stearns,R.E.@Hartmanis,J. F@5@1964@197-208@@@"On the linearity of sequential machines"@Davis,W.A.@Brzozowski,J.A. F@5@1964@209-227@@@"Sequential-machine realization using feedback shift registers"@Liu,C.L. F@5@1964@228-233@@@"On state assignments and sequential machine decompositions from S. P. partitions"@Epley,D.L.@Wang,P.T. F@5@1964@234-248@@@"On the total length of an experiment, I"@Bavel,Z. F@6@1965@5-11@@@"Threshold gate network synthesis"@Stabler,E.P. F@6@1965@12-24@@@"On maximum stability realizations of linearly separable Boolean functions"@Coates,C.L.@Supornpaibul,V. F@6@1965@25-35@@@"Synthesis of counters with threshold elements"@Gustafson,C.H.@Haring,D.R.@Susskind,A.K.@Wills-Sanford,T.G. F@6@1965@36-40@@@"Minimal linear decompositions of switching functions"@Hu,S.-T. F@6@1965@41-44@@@"Two-level threshold minimization"@Gonzalez,R.@Lawler,E.L. F@6@1965@45-51@@@"Cascade synthesis of finite-state machines"@Zeiger,H.P. F@6@1965@52-61@@@"Decomposition of sequential machines"@Kohavi,Z.@Smith,E.J. F@6@1965@62-70@@@"Modular synthesis of sequential machines"@Nichols,A.J.,III F@6@1965@71-83@@@"On shift register realizations for sequential machines"@Davis,W.A. F@6@1965@84-93@@@"On single-loop realizations of automata"@Brzozowski,J.A. F@6@1965@94-104@@@"Feedback in asynchronous sequential circuits"@Friedman,A.D. F@6@1965@105-125@@@"The synthesis of TANT networks"@Gimpel,J.F. F@6@1965@126-142@@@"Reliability and fault-masking in $n$-variable NOR trees"@Dunning,M.@Kolman,B. F@6@1965@143-149@@@"Procedures for minimization of `exclusive-OR' and `logical-equivalence' switching circuits"@Ramamoorthy,C.V. F@6@1965@150-161@@@"A theory of high-speed clocked logic"@Loomis,H.H.,Jr.@McCoy,M.R. F@6@1965@162-167@@@"A proof concerning infinite nets of logic elements without feedback"@Veitch,E.W. F@6@1965@168-172@@@"Crossing sequences and off-line Turing machine computations"@Hennie,F.C. F@6@1965@173-178@@@"Translational methods and computational complexity"@Ruby,S.S.@Fischer,P.C. F@6@1965@179-190@@@"Hierarchies of memory limited computations"@Stearns,R.E.@Hartmanis,J.@Lewis,P.M.,II F@6@1965@191-202@@@"Memory bounds for recognition of context-free and context-sensitive languages"@Lewis,P.M.,II@Stearns,R.E.@Hartmanis,J. F@6@1965@203-220@@@"Deterministic context free languages"@Ginsburg,S.@Greibach,S. F@6@1965@221-228@@@"On multi-head finite automata"@Rosenberg,A.L. F@6@1965@229-234@@@"Partially ordered classes of finite automata"@Nievergelt,J. F@6@1965@235-241@@@"Transparent categories and categories of transition systems"@Give'on,Y. F@6@1965@242-247@@@"Reversibility in monadic algebras and automata"@Bavel,Z.@Muller,D.E. F@6@1965@248-257@@@"On connecting modules together uniformly to form a modular computer"@Wagner,E.G. F@6@1965@258-263@@@"State-calculable stochastic sequential machines, equivalences, and events"@Carlyle,J.W. F@6@1965@264-278@@@"Investigation and simulation of a self-repairing digital computer"@Terris,I.@Melkanoff,M.A. F@6@1965@279-288@@@"The controls automation system"@Buckingham,B.R.S.@Carter,W.C.@Crawford,W.R.@Nowell,G.A. F@6@1965@289-302@@@"An integrated approach to automated computer maintenance"@Hackl,F.J.@Shirk,R.W. F@6@1965@303-309@@@"Synthesis of switching circuits to yield prescribed probability relations"@Warfield,J.N. F@6@1965@310-326@@@"Holiac \(en A family of student-constructed logic teaching aids"@Snapp,P.W. F@7@1966@1-20@@@"Context-free language processing in time $ n sup 3 $"@Younger,D.H. F@7@1966@21-35@@@"Syntax directed transduction"@Lewis,P.M.,II@Stearns,R.E. F@7@1966@36-46@@@"Simple deterministic languages"@Korenjak,A.J.@Hopcroft,J.E. F@7@1966@47-52@@@"One-way stack automata"@Ginsburg,S.@Greibach,S.A.@Harrison,M.A. F@7@1966@53-77@@@"Real-time computation by $n$-dimensional iterative arrays of finite-state machines"@Cole,S.N. F@7@1966@78-87@@@"The recognition problem for the set of perfect squares"@Cobham,A. F@7@1966@88-95@@@"Roots of star events"@Brzozowski,J.A. F@7@1966@96-102@@@"Subdirect decompositions of transformation graphs"@Yoeli,M.@Ablow,C.M. F@7@1966@103-112@@@"Pair algebra and its application"@Liu,C.L. F@7@1966@113-126@@@"Generalized decomposition of incomplete finite automata"@Pu,A.T. F@7@1966@127-135@@@"Graphs of affine transformations, with applications to sequential circuits"@Gill,A. F@7@1966@136-147@@@"A method for the combined row-column reduction of flow tables"@Grasselli,A.@Luccio,F. F@7@1966@148-153@@@"Standard minimum transition time secondary assignments for asynchronous circuits"@Epley,D.L. F@7@1966@154-159@@@"A row assignment for delay-free realizations of flow tables without essential hazards"@Unger,S.H. F@7@1966@160-171@@@"Synthesis of multiple sequential machines"@Smith,E.J.@Kohavi,Z. F@7@1966@172-183@@@"Realization of sequential machines with threshold elements"@Hadlock,F.O.@Coates,C.L. F@7@1966@184-194@@@"The application of threshold logic to the design of sequential machines"@Masters,G.M.@Mattson,R.L. F@7@1966@195-200@@@"Minimization and convexity in threshold logic"@Dertouzos,M.L.@Fluhr,Z.C. F@7@1966@201-206@@@"On minimal modulo 2 sums of products for switching functions"@Even,S.@Kohavi,I.@Paz,A. F@7@1966@207-214@@@"Conjunctive encoding of Boolean matrices"@Stover,D.R.@Epley,D.L. F@7@1966@215-226@@@"Asynchronous propagation-limited logic"@Goldberg,J.@Stone,H.S. F@7@1966@227-235@@@"The synthesis of multipurpose logic devices"@King,W.F.,III F@7@1966@236-250@@@"The universal logic block (ULB) and its application to logic design"@Forslund,D.C.@Waxman,R. F@7@1966@251-261@@@"Statistical properties of random digital sequences"@Booth,T.L. F@7@1966@262-266@@@"Realization of stochastic systems"@Arbib,M.A. F@7@1966@267-273@@@"Reconsider the state minimization problem for stochastic finite state systems"@Ott,G.H. F@7@1966@274-281@@@"An application of coding algebra to the design of a digital multiplexing system using linear sequential circuits"@Helm,H.A. F@7@1966@282-297@@@"Automorphism groups and quotients of strongly connected automata and monadic algebras"@Bayer,R. F@7@1966@298-304@@@"On the automorphism group of a reduced automation"@Paul,M. F@8@1967@7-13@@@"Structural equivalence of context-free grammars"@Paull,M.C.@Unger,S.H. F@8@1967@14-20@@@"Programmed grammars: A new device for generating formal languages"@Rosenkrantz,D.J. F@8@1967@21-31@@@"Indexed grammars \(en An extension of context free grammars"@Aho,A.V. F@8@1967@32-36@@@"An infinite hierarchy of context-free languages"@Greibach,S.A. F@8@1967@37-44@@@"Two results on one-way stack automata"@Hopcroft,J.E.@Ullman,J.D. F@8@1967@45-54@@@"On the structure of programming languages, or, six languages for Turing machines"@Wagner,E.G. F@8@1967@55-61@@@"Parallel program schemata: A mathematical model for parallel computation"@Karp,R.M.@Miller,R.E. F@8@1967@62-70@@@"Completely functional asynchronous computational structures"@Luconi,F.L. F@8@1967@71-82@@@"The general synthesis problem for asynchronous digital networks"@Muller,D.E. F@8@1967@83-94@@@"A parallel-acting iterative automaton"@Amoroso,S.M. F@8@1967@95-105@@@"Synthesis of asynchronous sequential circuits with minimum number of delay elements"@Armstrong,D.B.@Friedman,A.D.@Menon,P.R. F@8@1967@106-111@@@"Universal single transition time asynchronous state assignments"@Friedman,A.D. F@8@1967@112-116@@@"On the complexity of undecidable problems in automata theory"@Hartmanis,J. F@8@1967@117-127@@@"Turing machines with several read-write heads"@Meyer,A.R.@Rosenberg,A.L.@Fischer,P.C. F@8@1967@128-139@@@"Abstract families of languages"@Ginsburg,S.@Greibach,S. F@8@1967@140-147@@@"An approach to a unified theory of automata"@Hopcroft,J.E.@Ullman,J.D. F@8@1967@148-154@@@"Real time counter machines"@Fischer,P.C.@Meyer,A.R.@Rosenberg,A.L. F@8@1967@155-160@@@"Automata on a 2-dimensional tape"@Blum,M.@Hewitt,C. F@8@1967@161-174@@@"Testing for faults in combinational cellular logic arrays"@Kautz,W.H. F@8@1967@175-183@@@"Two contributions to redundancy theory"@Klaschka,T.F. F@8@1967@184-196@@@"Decomposition of group functions and the synthesis of multirail cascades"@Elspas,B.@Stone,H.S. F@8@1967@197-209@@@"Generalization of self-dual and self-complementary dual functions"@Mow,W.C.W.@Fu,K.S. F@8@1967@210-225@@@"A cellular structure for sequential networks"@Ferrari,D.@Grasselli,A. F@8@1967@226-232@@@"Inverse problems in coding, automata, and continuous systems"@Massey,J.L.@Sain,M.K. F@8@1967@233-239@@@"Modular decomposition of synchronous sequential machines"@Weiner,P.@Hopcroft,J.E. F@8@1967@240-251@@@"Memory-span concepts and the synthesis of sequential machines in feedback shift-register form"@Martin,R.L. F@8@1967@252-254@@@"Generalized state identification problems"@Lawler,E.L.@Piatkowski,T.F. F@8@1967@255-264@@@"On decompositions of regular events"@Brzozowski,J.A.@Cohen,R. F@8@1967@265-279@@@"On the star height of regular events"@Cohen,R.@Brzozowski,J.A. F@8@1967@280-290@@@"Fuzzy star functions, probabilistic automata and their approximation by nonprobabilistic automata"@Paz,A. F@8@1967@291-295@@@"Computation times for finite groups, semigroups and automata"@Spira,P.M.@Arbib,M.A. F@8@1967@296-306@@@"Classes of automata and transitive closure"@Jones,N.D. F@8@1967@307-313@@@"Irreducible decompositions of transformation graphs by assignment techniques"@Ablow,C.M.@Yoeli,M.@Turner,J. F@8@1967@314-321@@@"On endomorphisms and congruences of automata"@Bayer,R. F@8@1967@322-335@@@"On the decomposability of monadic algebras and automata"@Bavel,Z.@Thomas,J.W. F@9@1968@7-19@@@"Structural simplification and decomposition of asynchronous sequential circuits"@Tan,C.J.@Menon,P.R.@Friedman,A.D. F@9@1968@20-27@@@"A characterization of some asynchronous state assignments"@Kinney,L.L. F@9@1968@28-33@@@"An algorithm for minimizing read only memories for machine control"@Schwartz,S.J. F@9@1968@34-41@@@"On a measure of complexity for stochastic sequential machines"@Nieh,T.T.@Carlyle,J.W. F@9@1968@42-50@@@"Infinite state probabilistic transition tables and chains ergodic properties"@Paz,A. F@9@1968@51-60@@@"On the Hartmanis-Stearns problem for class of TAG machines"@Cobham,A. F@9@1968@61-68@@@"`Tapeless' bounded action machines"@Wagner,E.G. F@9@1968@69-75@@@"On the computation time of finite functions"@Spira,P.M. F@9@1968@76-84@@@"Output functional computational structures"@Luconi,F.L. F@9@1968@85-98@@@"Some formal properties of a class of non-deterministic program schemata"@Ito,T. F@9@1968@99-105@@@"Transformation of program schemes to standard forms"@Basu,S.K. F@9@1968@106-119@@@"Property grammars and table machines"@Stearns,R.E.@Lewis,P.M.,II F@9@1968@120-130@@@"The position of table languages within the hierarchy of nondeterministic on-line tape-bounded Turing machine languages"@Whitney,G. F@9@1968@131-142@@@"Grammars with macro-like productions"@Fischer,M.J. F@9@1968@143-159@@@"Automaton analogs of syntax directed translation schemata"@Aho,A.V.@Ullman,J.D. F@9@1968@160-175@@@"Syntax directed mappings of context-free languages"@Petrone,L. F@9@1968@176-186@@@"Structural equivalence and LL-k grammars"@Paull,M.C.@Unger,S.H. F@9@1968@187-212@@@"Optimal synthesis of arbitrary switching functions with regular arrays of 2-input, 1-output switching elements"@Weiss,C.D. F@9@1968@213-234@@@"A transform approach to logic design"@Lechner,R.J. F@9@1968@235-243@@@"Fault detection in a linear cascade of identical machines"@Breuer,M.A. F@9@1968@244-256@@@"Lupanov decoding networks"@Mukhopadhyay,A. F@9@1968@257-268@@@"Universal connecting networks and the synthesis of canonical sequential circuits"@Kautz,W.H.@Turner,J. F@9@1968@269-277@@@"Simple computation-universal cellular spaces and self-reproduction"@Smith,A.R.,III F@9@1968@278-286@@@"Regular-like expressions for some irregular languages"@Brzozowski,J.A. F@9@1968@287-291@@@"Checking automata and one-way stack languages"@Greibach,S. F@9@1968@292-297@@@"Two-way balloon automata and AFL"@Ginsburg,S.@Hopcroft,J. F@9@1968@298-305@@@"Grammars with linear time functions"@Book,R.V. F@9@1968@306-314@@@"Derivation-bounded languages"@Ginsburg,S.@Spanier,E.H. F@9@1968@315-326@@@"Two-type bracketed grammars"@Schkolnick,M. F@9@1968@327-333@@@"Structure of undecidable problems in automata theory"@Hartmanis,J.@Hopcroft,J.E. F@9@1968@334-350@@@"Toward a theory of enumerations"@Young,P.R. F@9@1968@351-355@@@"On computational speed-up"@Meyer,A.@Fischer,P.C. F@9@1968@356-367@@@"Limited random access Turing machines"@Fischer,M.J.@Rosenberg,A.L. F@9@1968@368-372@@@"The uniform halting problem for generalized one state Turing machines"@Herman,G.T. F@9@1968@373-382@@@"Tape reversal complexity hierarchies"@Fischer,P.C.@Hartmanis,J.@Blum,M. F@9@1968@383-394@@@"Transition graphs and the star height problem"@Cohen,R.S. F@9@1968@395-404@@@"Use of multiple index matrices in generalized automata theory"@Muller,D.E. F@9@1968@405-412@@@"Structural equivalence of automata"@Yeh,R.T. F@9@1968@413-426@@@"Universal two state machines: Characterization theorems and decomposition schemes"@Ullman,J.D.@Weiner,P. F@9@1968@427-430@@@"The linearity of sequential machines: A critical review"@Davis,W.A. F@9@1968@431-448@@@"Iteratively realized sequential circuits"@Arnold,T.F.@Tan,C.-J.@Newborn,M.M. S@1@1969@1-8@@@"Context-sensitive immediate constituent analysis \(en Context-free languages revisited"@Peters,P.S.@Ritchie,R.W. S@1@1969@9-14@@@"Abstract families of processors"@Rose,G.F. S@1@1969@15-18@@@"Quasi-realtime languages"@Book,R.V.@Greibach,S.A. S@1@1969@19-20@@@"The inherent ambiguity partial algorithm problem for context free languages"@Ullian,J.S. S@1@1969@21-30@@@"Abstract families of deterministic languages"@Chandler,W.J. S@1@1969@31-42@@@"Intercalation theorems for stack languages"@Ogden,W.F. S@1@1969@43-54@@@"On effective procedures for speeding up algorithms"@Blum,M. S@1@1969@55-59@@@"On classes of computable functions"@Basu,S.K. S@1@1969@61-66@@@"On minimal-program complexity measures"@Loveland,D.W. S@1@1969@67-78@@@"Complexity classes of recursive functions and the existence of complexity gaps"@Borodin,A. S@1@1969@79-88@@@"Classes of computable functions defined by bounds on computation"@McCreight,E.M.@Meyer,A.R. S@1@1969@89-92@@@"Speed-ups by changing the order in which sets are enumerated"@Young,P.R. S@1@1969@93-112@@@"Translations on a context free grammar"@Aho,A.V.@Ullman,J.D. S@1@1969@113-128@@@"Free groups and regular expressions"@Johansen,P. S@1@1969@129-142@@@"Transformations and translations from the point of view of generalized finite automata theory"@Thatcher,J.W. S@1@1969@143-148@@@"Context-free grammars on trees"@Rounds,W.C. S@1@1969@149-154@@@"Computability over arbitrary fields"@Herman,G.T.@Isard,S.D. S@1@1969@155-164@@@"Languages in general algebras"@Shepard,C.D. S@1@1969@165-180@@@"Properties of deterministic top down grammars"@Rosenkrantz,D.J.@Stearns,R.E. S@1@1969@181-190@@@"Some properties of precedence languages"@Fischer,M.J. S@1@1969@191-200@@@"Efficient LR(1) processor construction"@Korenjak,A.J. S@1@1969@201-210@@@"Formalization of properties of recursively defined functions"@Manna,Z.@Pnueli,A. S@1@1969@211-216@@@"Formal models for some features of programming languages"@Zeiger,H.P. S@1@1969@217-228@@@"Towards a theory of semantics and compilers for programming languages"@Blum,E.K. S@1@1969@229-232@@@"Variations on pushdown machines"@Cook,S.A. S@1@1969@233-246@@@"Pushdown store machines and real-time computation"@Cole,S.N. S@1@1969@247-248@@@"Deterministic simulation of non-deterministic Turing machines"@Savitch,W.J. S@1@1969@249-254@@@"The logical complexity of geometric properties in the plane"@Hodes,L. S@1@1969@255-258@@@"On the problem of computational time and complexity of arithmetic functions"@Avizienis,A. S@1@1969@259-270@@@"A unifying framework for the theory of iterative arrays of machines"@Amoroso,S.@Liebein,E.@Yamada,H. S@1@1969@271-272@@@"On the computation time of certain classes of Boolean functions"@Spira,P.M. F@10@1969@7-19@@@"Dense and non-dense families of complexity classes"@Borodin,A.@Constable,R.L.@Hopcroft,J.E. F@10@1969@20-26@@@"The operator gap"@Constable,R.L. F@10@1969@27-35@@@"Iterative procedures"@Tsichritzis,D. F@10@1969@36-45@@@"Some techniques for proving certain simple programs optimal"@Hopcroft,J.E.@Kerr,L.R. F@10@1969@46-60@@@"Storage interference in asynchronous computations"@Logrippo,L. F@10@1969@61-73@@@"Asynchronous control networks"@Bruno,J.@Altman,S.M. F@10@1969@74-81@@@"Probabilistic representation of formal languages"@Booth,T.L. F@10@1969@82-89@@@"The incompletely-specified finite-state stochastic sequential machine equivalence and reduction"@Lovell,B.W. F@10@1969@90-99@@@"On probabilistic automata with structural restrictions"@Gelenbe,S.E. F@10@1969@100-105@@@"Definite stochastic sequential machines and definite stochastic matrices"@Kfoury,D.J.@Liu,C.L. F@10@1969@106-117@@@"Single pass precedence analysis"@Gray,J.N.@Harrison,M.A. F@10@1969@118-128@@@"Table machine simulation"@Stearns,R.E.@Rosenkrantz,D.J. F@10@1969@129-132@@@"Recognition of context-free and stack languages"@Kosaraju,S.R. F@10@1969@133-148@@@"Deterministic context-sensitive languages"@Walters,D.A. F@10@1969@149-156@@@"Two characterizations of the context-sensitive languages"@Fischer,M.J. F@10@1969@157-165@@@"On the representation of formal languages using automata on networks"@Fischer,G.A.@Raney,G.N. F@10@1969@166-173@@@"Fault diagnosis of logical circuits"@Kohavi,I. F@10@1969@174-181@@@"Machine identification concepts of path sensitizing fault diagnosis"@Kriz,T.A. F@10@1969@182-193@@@"Threshold logic: A simplified synthesis by a recursive method"@Sha,R.T.@Sze,T.W. F@10@1969@194-212@@@"Iteratively realized sequential circuits: Further considerations"@Arnold,T.F.@Newborn,M.M. F@10@1969@213-221@@@"On the modular decomposition of autonomous sequential machines"@King,W.F.,III@Weiner,P. F@10@1969@222-230@@@"Full AFL'S and nested iterated substitution"@Greibach,S.A. F@10@1969@231-239@@@"A characterization of two-way deterministic classes of languages"@Aho,A.V.@Ullman,J.D. F@10@1969@240-244@@@"Semi-Thue systems and representations of trees"@Brainerd,W.S. F@10@1969@245-262@@@"String adjunct grammars"@Joshi,A.K.@Kosaraju,S.R.@Yameda,H. F@10@1969@263-276@@@"Parallel leveled grammars"@Nash,B.O.@Cohen,R.S. S@2@1970@1-9@@@"On the size of programs in subrecursive formalisms"@Constable,R.L. S@2@1970@10-21@@@"The degree hierarchy of undecidable problems of formal grammars"@Cudia,D.F. S@2@1970@22-30@@@"Decision problems for complexity classes of computable functions"@Lewis,F.D. S@2@1970@31-36@@@"Recursive properties of abstract complexity classes"@Landweber,L.H.@Robertson,E.L. S@2@1970@37-40@@@"Hierarchies based on computational complexity and irregularities of class determined measured sets"@Bass,L.J.@Young,P.R. S@2@1970@41-47@@@"On bounds on the number of steps to compute functions"@Ausiello,G. S@2@1970@48-61@@@"Data graphs and addressing schemes"@Rosenberg,A.L. S@2@1970@62-69@@@"Complexity problems in real time computations"@Burkhard,W.A. S@2@1970@70-72@@@"Path systems and language recognition"@Cook,S.A. S@2@1970@73-80@@@"A result on the relationship between simple precedence languages and reducing transition languages"@Morris,J.B. S@2@1970@81-91@@@"The design of parsers for incremental language processors"@Lindstrom,G. S@2@1970@92-99@@@"Tape- and time-bounded Turing acceptors and AFLs"@Book,R.V.@Greibach,S.A.@Wegbreit,B. S@2@1970@100-108@@@"Closure of families of languages under substitution operators"@Lewis,D.J. S@2@1970@109-116@@@"Tree-oriented proofs of some theorems on context-free and indexed languages"@Rounds,W.C. S@2@1970@117-128@@@"Tree-manipulating systems and Church-Rosser theorems"@Rosen,B.K. S@2@1970@129-135@@@"On syntax-directed transduction and tree transducers"@Martin,D.F.@Vere,S.A. S@2@1970@136-148@@@"Transformations on straight line programs"@Aho,A.V.@Ullman,J.D. S@2@1970@149-157@@@"The corrections of a modified SECD machine"@McGowan,C.L. S@2@1970@158-168@@@"Second-order mathematical theory of computation"@Manna,Z. S@2@1970@169-179@@@"An interpretation oriented theorem prover over integers"@King,J.C.@Floyd,R.W. S@2@1970@180-183@@@"The predicate elimination strategy in theorem proving"@Reiter,R. S@2@1970@184-197@@@"Translating recursion equations into flow charts"@Strong,H.R.,Jr. S@2@1970@198-205@@@"Probabilistic tree automata"@Ellis,C.A. S@2@1970@206-216@@@"The analysis of two-dimensional patterns using picture processing grammars"@Chang,S.-K. S@2@1970@217-220@@@"On the relationship between finite automata, finite monoids, and prefix codes"@Perrot,J.-F. S@2@1970@221-225@@@"On some families of languages related to the Dyck language"@Nivat,M. S@2@1970@226-230@@@"Three theorems on abstract families of languages"@Ullian,J.S. F@11@1970@7-24@@@"Program schemata as automata, part I"@Rutledge,J.D. F@11@1970@25-31@@@"Equivalence of programs with structured variables"@Aho,A.V.@Ullman,J.D. F@11@1970@32-50@@@"On maximally parallel schemata"@Keller,R.M. F@11@1970@51-59@@@"A phenomenon in the theory of sorting"@Gale,D.@Karp,R.M. F@11@1970@60-67@@@"On the efficiency of programs in subrecursive formalisms"@Constable,R.L.@Borodin,A. F@11@1970@68-71@@@"On the optimality of some set and vector algorithms"@Reingold,E.M. F@11@1970@72@@@"On the computational power of some machines with pushdown-like storage"@Kameda,T. F@11@1970@73-75@@@"Tape-bounds for time-bounded Turing machines"@Paterson,M.S. F@11@1970@76-80@@@"On star-free events"@Zalcstein,Y. F@11@1970@81-87@@@"Deux applications de la representation matricielle d'une serie rationnelle non commutative"@Fliess,M. F@11@1970@88-96@@@"Fault detection experiments for asynchronous sequential machines"@Ashkinazy,A. F@11@1970@97-103@@@"Synchronizing and representation problems for sequential machines with masked outputs"@Fischler,M.A.@Tannenbaum,M. F@11@1970@104-108@@@"Elimination of static and dynamic hazards in combinatorial switching circuits"@Bredeson,J.G.@Hulina,P.T. F@11@1970@109-113@@@"Asynchronous sequential circuits with (2,1) type state assignments"@Mago,G. F@11@1970@114-121@@@"Asynchronous sequential switching circuits with unrestricted input changes"@Unger,S.H. F@11@1970@122-132@@@"The synthesis of finite state syntax directed top-down and bottom-up transducers"@Bjorner,D. F@11@1970@133-138@@@"Syntactic clues"@Benson,D.B. F@11@1970@139-152@@@"Deterministic left corner parsing"@Rosenkrantz,D.J.@Lewis,P.M.,II F@11@1970@153-174@@@"Parsing algorithms with backtrack"@Birman,A.@Ullman,J.D. F@11@1970@175-180@@@"Extended precedence languages, bounded right context languages, and deterministic languages"@Graham,S.L. F@11@1970@181-193@@@"Writing stack acceptors"@Giuliano,J.A. F@11@1970@194-215@@@"Universality in cellular automata"@Banks,E.R. F@11@1970@216-224@@@"Cellular automata and formal languages"@Smith,A.R.,III F@11@1970@225-235@@@"Sequencing tasks in multiprocess systems to avoid deadlocks"@Shoshani,A.@Coffman,E.G. F@11@1970@236-239@@@"Series-parallel irreducibility: Machine oriented definitions and proofs"@Zeigler,B.P. S@3@1971@1-11@@@"Formal languages and power series"@Stanat,D.F. S@3@1971@12-23@@@"An algebraic theory of recursive definitions and recursive languages"@Wagner,E.G. S@3@1971@24-39@@@"Loop schemata"@Constable,R.L. S@3@1971@40-44@@@"Some results concerning efficient and optimal algorithms"@Munro,I. S@3@1971@45-49@@@"Fast matrix multiplication"@Fiduccia,C.M. S@3@1971@50-62@@@"Linear representation of tree structure"@Meyers,W.J. S@3@1971@63-77@@@"On generalized finite automata and unrestricted generative grammars"@Buttelmann,H.W. S@3@1971@78-85@@@"Some results in tree automata"@Levy,L.S.@Joshi,A.K. S@3@1971@86-100@@@"Block structure: Retention or deletion?"@Berry,D.M. S@3@1971@101-115@@@"On the parallel computation of local operations"@Chang,S.-K. S@3@1971@116-120@@@"An iteration theorem for one-counter languages"@Boasson,L. S@3@1971@121-131@@@"Intersection-closed full AFL and the recursively enumerable languages"@Ginsburg,S.@Goldstine,J. S@3@1971@132-137@@@"Absolutely parallel grammars and two-way deterministic finite-state transducers"@Rajlich,V. S@3@1971@138-150@@@"Addressable data graphs"@Rosenberg,A.L. S@3@1971@151-158@@@"The complexity of theorem-proving procedures"@Cook,S.A. S@3@1971@159-170@@@"The care and feeding of LR(k) grammars"@Aho,A.V.@Ullman,J.D. S@3@1971@171-184@@@"Domolki's algorithm applied to generalized overlap resolvable grammars"@Wise,D.S. S@3@1971@185-205@@@"An algorithm generating the decision table of a deterministic bottom up parser for a subset of context free grammars"@Terrine,G. S@3@1971@206-218@@@"A decision procedure for generalized sequential mapability-onto of regular sets"@McNaughton,R. S@3@1971@219-243@@@"Algebraic structure theory of stochastic machines"@Santos,E.S. S@3@1971@244-250@@@"Complexity of formal translations and speed-up results"@Constable,R.L.@Hartmanis,J. S@3@1971@251-257@@@"Classification of computable functions by primitive recursive classes"@Machtey,M. S@3@1971@258-266@@@"Complexity classes of partial recursive functions"@Robertson,E.L. F@12@1971@1-4@@@"High level languages of maximum power"@Strong,H.R. F@12@1971@5-19@@@"On classes of program schemata"@Constable,R.L.@Gries,D. F@12@1971@20-23@@@"On the composition of parallel program schemata"@Brinsfield,W.A.@Miller,R.E. F@12@1971@24-32@@@"Toward a weakly invariant complexity theory"@Burkhard,W.A.@Kroon,F.W. F@12@1971@33-37@@@"Effective computation over the real numbers"@Abramson,F.G. F@12@1971@38-42@@@"On the design of easily testable sequential machines"@Kane,J.R.@Yau,S.S. F@12@1971@43-59@@@"Universal base functions and modules for realizing arbitrary switching functions"@Osman,M.Y.@Weiss,C.D. F@12@1971@60-78@@@"Synthesis of asynchronous sequential circuits with master-slave subcircuits"@Frosini,G.@Gerace,G.B. F@12@1971@79-90@@@"A rectangular logic array"@Akers,S.B.,Jr. F@12@1971@91-104@@@"Nand cellular arrays"@Stern,D.A.@Torng,H.C. F@12@1971@105-113@@@"Computation by multi-head finite automata"@Sudborough,I.H. F@12@1971@114-121@@@"Depth-first search and linear graph algorithms"@Tarjan,R. F@12@1971@122-125@@@"A $ n sup 5/2 $ algorithm for maximum matchings in bipartite graphs"@Hopcroft,J.E.@Karp,R.M. F@12@1971@126-128@@@"On decreasing the computing time for modular arithmetic"@Heindel,L.E.@Horowitz,E. F@12@1971@129-131@@@"Boolean matrix multiplication and transitive closure"@Fischer,M.J.@Meyer,A.R. F@12@1971@132-139@@@"Optimal algorithms for parallel polynomial evaluation"@Munro,I.@Paterson,M. F@12@1971@140-143@@@"Bounds on the evaluation time for rational polynomials"@Paterson,M.@Stockmeyer,L. F@12@1971@144-152@@@"Two-dimensional formal languages and pattern recognition by cellular automata"@Smith,A.R.,III F@12@1971@153-165@@@"LR-regular grammars \(en An extension of LR(k) grammars"@Cohen,R.@Culik,K.,II F@12@1971@166-176@@@"Characterizations of locally testable events"@Brzozowski,J.A.@Simon,Imre F@12@1971@177-181@@@"Priority paging algorithms and the extension problem"@Coffman,E.G.,Jr.@Jones,N.D. F@12@1971@182-187@@@"Time bounds on space computations"@Dertouzos,M.L. F@12@1971@188-191@@@"Economy of description by automata, grammars, and formal systems"@Meyer,A.R.@Fischer,M.J. F@12@1971@192-201@@@"Languages for defining sets in arbitrary algebras"@Wagner,E.G. F@12@1971@202-206@@@"Complete linear proofs of systems of linear inequalities"@Spira,P.M. F@12@1971@207-215@@@"Analysis of sorting algorithms"@Liu,C.L. F@12@1971@216-218@@@"Computing the maximum and the median"@Reingold,E.M. S@4@1972@1-17@@@"Subrecursive program schemata I & II", I. Undecidable equivalence problems, II. Decidable equivalence problems@Constable,R.L.@Muchnick,S.S. S@4@1972@18-34@@@"Characterization of flowchartable recursions"@Walker,S.A.@Strong,H.R. S@4@1972@35-43@@@"Recursion schemes with lists"@Morris,J.H.,Jr. S@4@1972@44-51@@@"Flowchart schemata with counters"@Plaisted,D.A. S@4@1972@52-64@@@"Program schemas with equality"@Chandra,A.K.@Manna,Z. S@4@1972@65-72@@@"On the equivalence of schemes"@Garland,S.J.@Luckham,D.C. S@4@1972@73-80@@@"Time-bounded random access machines"@Cook,S.A.@Reckhow,R.A. S@4@1972@81-87@@@"Predecessor machines and regressing functions"@Warkentin,J.C.@Fischer,P.C. S@4@1972@88-93@@@"Polynomial evaluation via the division algorithm: The fast Fourier transform revisited"@Fiduccia,C.M. S@4@1972@94-101@@@"On the additions necessary to compute certain functions"@Kirkpatrick,D. S@4@1972@102-107@@@"A bound on the multiplication efficiency of iteration"@Kung,H.T. S@4@1972@108-118@@@"Algorithms for rational function arithmetic operations"@Horowitz,E. S@4@1972@119-124@@@"Linear time bounds for median computations"@Blum,M.@Floyd,R.W.@Pratt,V.@Rivest,R.L.@Tarjan,R.E. S@4@1972@125-136@@@"Rapid identification of repeated patterns in strings, trees and arrays"@Karp,R.M.@Miller,R.E.@Rosenberg,A.L. S@4@1972@137-142@@@"Binary search trees of bounded balance"@Nievergelt,J.@Reingold,E.M. S@4@1972@143-150@@@"Worst-case analysis of memory allocation algorithms"@Garey,M.R.@Graham,R.L.@Ullman,J.D. S@4@1972@151-156@@@"Maze recognizing automata"@Savitch,W.J. S@4@1972@157-167@@@"Turing machines and the spectra of first-order formulas with equality"@Jones,N.D.@Selman,A.L. S@4@1972@168-176@@@"The process complexity and effective random tests"@Schnorr,C.P. S@4@1972@177-182@@@"The computation of finite functions"@Symes,D.M. S@4@1972@183-186@@@"Program size and economy of descriptions"@Meyer,A.R.@Bagchi,A. S@4@1972@187-192@@@"A hierarchy for nondeterministic time complexity"@Cook,S.A. S@4@1972@193-197@@@"A patent problem for abstract programming languages: Machine-independent computations"@Hamlet,R.G. S@4@1972@198-206@@@"Compositions of $n$ tree transducers"@Ogden,W.F.@Rounds,W.C. S@4@1972@207-213@@@"Uniformly erasable AFL"@Carlyle-Greibach,S.@Ginsburg,S.@Goldstine,J. S@4@1972@214-221@@@"Developmental systems and languages"@Lindenmayer,A.@Rozenberg,G. S@4@1972@222-237@@@"Validating register allocations for straight line programs"@Sethi,R. S@4@1972@238-250@@@"Flow graph reducibility"@Hecht,M.S.@Ullman,J.D. S@4@1972@251-263@@@"A technique for speeding up LR(k) parsers"@Aho,A.V.@Ullman,J.D. F@13@1972@7-18@@@"Program equivalence and context-free grammars"@Rosen,B.K. F@13@1972@19-26@@@"Effective computability in algebraic structures" (A schematology approach)@Kfoury,D.J. F@13@1972@27-39@@@"Representing program schemes in logic"@Cherniavsky,J.C.@Constable,R.L. F@13@1972@40-51@@@"Some results in computational topology"@Tourlakis,G.@Mylopoulos,J. F@13@1972@52-60@@@"On homomorphisms, simulations, correctness and subroutines for programs and program schemes"@Goguen,J.A.,Jr. F@13@1972@61-66@@@"Honest bounds for complexity classes of recursive functions"@Meyer,A.R.@Moll,R. F@13@1972@67-70@@@"Renamings in program schemas"@Logrippo,L. F@13@1972@71-77@@@"Consistency of synchronization nets using P and V operations"@Bruno,J.L.@Coffman,E.G.@Hosken,W.H. F@13@1972@78-89@@@"On the decomposition of asynchronous systems"@Keller,R.M. F@13@1972@90-96@@@"Fast modular transforms via division"@Moenck,R.@Borodin,A. F@13@1972@97-104@@@"The efficient calculation of powers of polynomials"@Horowitz,E. F@13@1972@105-107@@@"On the number of multiplications for the evaluation of a polynomial and all its derivatives"@Shaw,M.@Traub,J.F. F@13@1972@108-120@@@"On the relation of graph grammars and graph automata"@Mylopoulos,J. F@13@1972@121-124@@@"The emptiness problem for automata on infinite trees"@Hossley,R.@Rackoff,C. F@13@1972@125-129@@@"The equivalence problem for regular expressions with squaring requires exponential space"@Meyer,A.R.@Stockmeyer,L.J. F@13@1972@130-138@@@"Some related problems from network flows, game theory and integer programming"@Sahni,S. F@13@1972@139-143@@@"Some results on the effect of arithmetics on comparison problems"@Friedman,N. F@13@1972@144-154@@@"Fast allocation algorithms"@Johnson,D.S. F@13@1972@155-160@@@"Optimal scheduling on multi-processor computing systems"@Liu,C.L. F@13@1972@161-176@@@"A fast algorithm for the elimination of common subexpressions"@Ullman,J.D. F@13@1972@177-184@@@"Universal test sets for logic networks"@Akers,S.B.,Jr. F@13@1972@185-191@@@"Multiple faults in Reed-Muller canonic networks"@Saluja,K.K.@Reddy,S.M. F@13@1972@192-199@@@"Output sufficient modules for uniform decomposition of synchronous sequential circuits"@Huang,C.C.@Kain,R.Y.@Kinney,L.L. F@13@1972@200-206@@@"On sets of numbers recognized by push-down automata"@Berstel,J. F@13@1972@207-211@@@"Reversal-bounded multi-pushdown machines"@Baker,B.S.@Book,R.V. F@13@1972@212-223@@@"On the equivalence of asynchronous control structures"@Jump,J.R.@Thiagarajan,P.S. F@13@1972@224-230@@@"The characterization of the derivation trees of context free sets of terms as regular sets"@Maibaum,T.S.E. S@5@1973@1-9@@@"Word problems requiring exponential time"@Stockmeyer,L.J.@Meyer,A.R. S@5@1973@10-19@@@"On the time and tape complexity of languages I"@Hunt,H.B.,III S@5@1973@20-28@@@"Jump PDA's, deterministic context-free languages principal AFDLs and polynomial time recognition"@Greibach,S.A. S@5@1973@29-33@@@"An observation on time-storage trade off"@Cook,S.A. S@5@1973@34-37@@@"Elementary bounds for Presburger arithmetic"@Oppen,D.C. S@5@1973@38-49@@@"Approximation algorithms for combinatorial problems"@Johnson,D.S. S@5@1973@50-58@@@"Toward mechanical verification of properties of roundoff error propagation"@Miller,W. S@5@1973@59-66@@@"An unusual application of program-proving"@Wand,M. S@5@1973@67-72@@@"Fast on-line integer multiplication"@Fischer,M.J.@Stockmeyer,L.J. S@5@1973@73-87@@@"Duality applied to the complexity of matrix multiplications and other bilinear forms"@Hopcroft,J.@Musinski,J. S@5@1973@88-95@@@"On the optimal evaluation of a set of bilinear forms"@Brockett,R.W.@Dobkin,D. S@5@1973@96-107@@@"Testing flow graph reducibility"@Tarjan,R. S@5@1973@108-121@@@"Type two computational complexity"@Constable,R.L. S@5@1973@122-129@@@"Polynomial time reducibility"@Ladner,R.E. S@5@1973@130-134@@@"Sets that don't help"@Lynch,N.@Meyer,A.@Fischer,M. S@5@1973@135-141@@@"Analysis of algorithms, a case study: Determinants of polynomials"@Gentleman,W.M.@Johnson,S.C. S@5@1973@142-151@@@"Fast computation of GCDs"@Moenck,R.T. S@5@1973@152-159@@@"The computational complexity of algebraic numbers"@Kung,H.T. S@5@1973@160-171@@@"Attributed translations"@Lewis,P.M.@Rosenkrantz,D.J.@Stearns,R.E. S@5@1973@172-181@@@"The lane tracing algorithm for constructing LR(k) parsers"@Pager,D. S@5@1973@182-195@@@"Complete register allocation problems"@Sethi,R. S@5@1973@196-199@@@"Context-free error analysis by evaluation of algebraic power series"@Teitelbaum,R. S@5@1973@200-206@@@"Tree transductions and families of tree languges"@Baker,B.S. S@5@1973@207-213@@@"Neighborhood search algorithms for finding optimal traveling salesman tours must be inefficient"@Weiner,P.@Savage,S.L.@Bagchi,A. S@5@1973@214-223@@@"From algebras to programming languages"@Wagner,E.G. S@5@1973@224-239@@@"Correct and optimal implementations of recursion in a simple programming language"@Vuillemin,J. S@5@1973@240-252@@@"Analysis of structured programs"@Kosaraju,S.R. S@5@1973@253-265@@@"On finding lowest common ancestors in trees"@Aho,A.V.@Hopcroft,J.E.@Ullman,J.D. S@5@1973@266-267@@@"Classes of semigroups and classes of sets"@Eilenberg,S. S@5@1973@268-277@@@"Computing permutations with double-ended queues, parallel stacks and parallel queues"@Pratt,V.R. F@14@1973@1-11@@@"Linear pattern matching algorithms"@Weiner,P. F@14@1973@12-15@@@"Efficient algorithms for determining an extremal tree of a graph"@Kameda,T.@Toida,S. F@14@1973@16-25@@@"Efficient compilation of linear recursive programs"@Chandra,A.K. F@14@1973@26-33@@@"Equivalence problems in monadic recursion schemes"@Friedman,E.P. F@14@1973@34-48@@@"Mechanizable proofs about parallel processes"@Cadiou,J.M.@Levy,J.J. F@14@1973@49-55@@@"Chow parameters in pseudothreshold logic"@Baugh,C.R. F@14@1973@56-63@@@"On multiple input change hazard-free combinatorial switching circuits without feedback"@Bredeson,J.G. F@14@1973@64-69@@@"Multiple-input change asynchronous machines using controlled excitation and flip-flops"@Chuang,H.Y.H.@Das,S. F@14@1973@70-81@@@"On lower bounds for computing the $i$-th largest element"@Pratt,V.R.@Yao,F.F. F@14@1973@82-84@@@"On finding and updating shortest paths and spanning trees"@Spira,P.M.@Pan,A. F@14@1973@85-91@@@"Statistical indicators of optimality"@Savage,S. F@14@1973@92-102@@@"On the optimal evaluation of a set of n-linear forms"@Dobkin,D. F@14@1973@103-108@@@"Characterizations of LR(0) languages"@Geller,M.M.@Harrison,M.A. F@14@1973@109-121@@@"On the ability to cover LR(k) grammars with LR(1), SLR(1), and (1,1) bounded-context grammars"@Mickunas,M.D.@Schneider,V.B. F@14@1973@122-129@@@"Non-canonical parsing"@Szymanski,T.G.@Williams,J.H. F@14@1973@130-137@@@"Refinements of the nondeterministic time and space hierarchies"@Seiferas,J.I.@Fischer,M.J.@Meyer,A.R. F@14@1973@138-144@@@"On tape-bounded complexity classes and multi-head finite automata"@Sudborough,I.H. F@14@1973@145-158@@@"Complexity of recognition in intermediate-level languages"@Rounds,W.C. F@14@1973@159-166@@@"Automatic theorem-proving and the decision problem"@Joyner,W.H.,Jr. F@14@1973@167-180@@@"Graph-grammars: An algebraic approach"@Ehrig,H.@Pfender,M.@Schneider,H.J. F@14@1973@181-189@@@"A notion of helping and pseudo-complementation in lattices of honest subrecursive classes"@Machtey,M. F@14@1973@190-196@@@"On the size of sets of computable functions"@Mehlhorn,K. F@14@1973@197-199@@@"Optimization among provably equivalent programs"@Young,P. F@14@1973@200-208@@@"Inductive inference: A recursion theoretic approach"@Blum,L.@Blum,M. F@14@1973@209-213@@@"The complexity of some non-classical logics"@Cherniavsky,J. S@6@1974@1-12@@@"Degrees of translatability and canonical forms in program schemas: Part I"@Chandra,A.K. S@6@1974@13-26@@@"Semantics and axiomatics of a simple recursive language"@Courcelle,B.@Vuillemin,J. S@6@1974@27-32@@@"The decidability of equivalence for deterministic finite-turn pushdown automata"@Valiant,L.G. S@6@1974@33-39@@@"Storage requirements for deterministic polynomial time recognizable languages"@Cook,S.@Sethi,R. S@6@1974@40-46@@@"Complete problems for deterministic polynomial time"@Jones,N.D.@Laaser,W.T. S@6@1974@47-63@@@"Some simplified NP-complete problems"@Garey,M.R.@Johnson,D.S.@Stockmeyer,L. S@6@1974@64-74@@@"Computational parallels between the regular and context-free languages"@Hunt,H.B.,III@Rosenkrantz,D.J. S@6@1974@75-79@@@"Complexity measures for regular expressions"@Ehrenfeucht,A.@Zeiger,P. S@6@1974@80-83@@@"The power of negative thinking in multiplying Boolean matrices"@Pratt,V.R. S@6@1974@84-90@@@"Determining graph properties from matrix representations"@Kirkpatrick,D. S@6@1974@91-95@@@"Computational complexity of probabilistic Turing machines"@Gill,J.T.,III S@6@1974@96-109@@@"Polynomial and abstract subrecursive classes"@Mehlhorn,K. S@6@1974@110-121@@@"Comparisons of polynomial-time reducibilities"@Ladner,R.@Lynch,N.@Selman,A. S@6@1974@122-134@@@"A characterization of the power of vector machines"@Pratt,V.R.@Rabin,M.O.@Stockmeyer,L.J. S@6@1974@135-148@@@"On the lengths of proofs in the propositional calculus"@Cook,S.@Reckhow,R. S@6@1974@149-160@@@"On the complexity of the theories of weak direct products"@Rackoff,C. S@6@1974@161-171@@@"Structure of complexity in the weak monadic second-order theories of the natural numbers"@Robertson,E.L. S@6@1974@172-184@@@"Linear time algorithm for isomorphism of planar graphs"@Hopcroft,J.E.@Wong,J.K. S@6@1974@185-193@@@"Testing graph connectivity"@Tarjan,R.E. S@6@1974@194-215@@@"Efficient stable sorting with minimal extra space"@Horvath,E.C. S@6@1974@216-229@@@"An efficient algorithm for computing optimal desk merge patterns"@Hyafil,L.@Prusker,F.@Vuillemin,J. S@6@1974@230-241@@@"Limitations of synchronization primitives with conditional branching and global variables"@Lipton,R.J. S@6@1974@242-247@@@"Construction with parallel derivatives of the closure of a parallel program schema"@Millen,J.K. S@6@1974@248-255@@@"Parallel scheduling of programs in a restricted model of computation"@Vairavan,K.@DeMillo,R.A. S@6@1974@256-265@@@"Some restrictions on W-grammars"@Greibach,S.A. S@6@1974@266-275@@@"A new grammatical transformation into LL(k) form"@Hammer,M. S@6@1974@276-289@@@"Observations on nondeterministic multidimensional iterative arrays"@Seiferas,J.I. S@6@1974@290-296@@@"Intersections of linear context-free languages and reversal-bounded multipushdown machines"@Book,R.@Nivat,M.@Paterson,M. S@6@1974@297-302@@@"Managing storage for extendible arrays"@Rosenberg,A.L. S@6@1974@303-309@@@"A partial solution to the reachability-problem for vector-addition systems"@VanLeeuwen,J. S@6@1974@310-316@@@"On some generalizations of binary search"@Dobkin,D.@Lipton,R.J. S@6@1974@317-322@@@"Computational complexity and numerical stability"@Miller,W. S@6@1974@323-333@@@"New algorithms and lower bounds for the parallel evaluation of certain rational expressions"@Kung,H.T. S@6@1974@334-341@@@"Combining dimensionality and rate of growth arguments for establishing lower bounds on the number of multiplications"@Kedem,Z.M. S@6@1974@342-347@@@"On the number of additions to compute specific polynomials"@Borodin,A.@Cook,S. F@15@1974@1-12@@@"A two-dimensional generating system modeling growth by binary cell division"@Carlyle,J.W.@Greibach,S.A.@Paz,A. F@15@1974@13-23@@@"On the power of multiplication in random access machines"@Hartmanis,J.@Simon,J. F@15@1974@24-27@@@"The equivalence problem for regular expressions over one letter is elementary"@Rangel,J.L. F@15@1974@28-32@@@"P-complete problems and approximate solutions"@Sahni,S.@Gonzales,T. F@15@1974@33-42@@@"Approximate algorithms for the traveling salesperson problem"@Rosenkrantz,D.J.@Stearns,R.E.@Lewis,P.M. F@15@1974@43-51@@@"Relationships between monadic recursion schemes and deterministic context-free languages"@Friedman,E.P. F@15@1974@52-62@@@"Recursive schemes, algebraic trees and deterministic languages"@Courcelle,B. F@15@1974@63-77@@@"Initial algebra semantics"@Goguen,J.A.@Thatcher,J.W. F@15@1974@78-83@@@"Axiomatic equivalence of programs with structured variables"@Hoffmann,C.M.@Landweber,L.H. F@15@1974@84-94@@@"Ianov schemas augmented by a pushdown memory"@Tokura,N.@Kasami,T.@Furuta,S. F@15@1974@95-103@@@"On hash-coding algorithms for partial-match retrieval"@Rivest,R.L. F@15@1974@104-109@@@"Bounds on the complexity of the longest common subsequence problem"@Aho,A.V.@Hirschberg,D.S.@Ullman,J.D. F@15@1974@110-116@@@"Bounds on selection networks"@Yao,A.C.-C. F@15@1974@117-121@@@"On the computational complexity of finding the maxima of a set of vectors"@Kung,H.T. F@15@1974@122-126@@@"On self-organizing sequential search heuristics"@Rivest,R.L. F@15@1974@127-132@@@"Operations on sparse relations and efficient algorithms for grammar problems"@Hunt,H.B.,III@Szymanski,T.G.@Ullman,J.D. F@15@1974@133-139@@@"Minimization of fanout in switching networks"@Hayes,J.P. F@15@1974@140-144@@@"Combinational complexity of some monotone functions"@Lamagna,E.A.@Savage,J.E. F@15@1974@145-155@@@"A comparative study of models of parallel computation"@Lipton,R.J.@Snyder,L.@Zalcstein,Y. F@15@1974@156-164@@@"The recursive equivalence of the reachability problem and the liveness problem for Petri nets and vector addition systems"@Hack,M. F@15@1974@165-169@@@"Non-complex sequences: Characterizations and examples"@Daley,R.P. F@15@1974@170-177@@@"Two way deterministic pushdown automation languages and some open problems in the theory of computation"@Galil,Z. F@15@1974@178-184@@@"`Natural' properties of Flowchart complexity measures"@Baker,T.P. F@15@1974@185-198@@@"Skeletal LR parsing"@Demers,A.J. F@15@1974@199-204@@@"Characterization of context-free grammatical families"@Cremers,A.@Ginsburg,S. F@15@1974@205-211@@@"On Boolean functions having maximal number of subfunction classes"@Kerntopf,P. S@7@1975@1-5@@@"Complexity measures and hierarchies for the evaluation of integers, polynomials, and n-linear forms"@Lipton,R.J.@Dobkin,D. S@7@1975@6-11@@@"A generalization and proof of the Aanderaa-Rosenberg conjecture"@Rivest,R.L.@Vuillemin,J. S@7@1975@12-22@@@"The complexity of parallel evaluation of linear recurrence"@Hyafil,L.@Kung,H.T. S@7@1975@23-26@@@"On computing the minima of quadratic forms"@Yao,A.C.-C. S@7@1975@27-36@@@"A $2.5 n$-lower bound on the combinatorial complexity of Boolean functions"@Paul,W.J. S@7@1975@37-44@@@"Lower bounds on the size of Boolean formulas"@Fischer,M.J.@Meyer,A.R.@Paterson,M.S. S@7@1975@45-53@@@"On non-linear lower bounds in computational complexity"@Valiant,L.G. S@7@1975@54-65@@@"On the complexity of grammar and related problems"@Hunt,H.B.,III@Szymanski,T.G. S@7@1975@66-71@@@"A combinatorial problem which is complete in polynomial space"@Even,S.@Tarjan,R.E. S@7@1975@72-82@@@"On the validity and complexity of bounded resolution"@Galil,Z. S@7@1975@83-97@@@"Feasibly constructive proofs and the propositional calculus"@Cook,S.A. S@7@1975@98-106@@@"Computability concepts for programming language semantics"@Egli,H.@Constable,R.L. S@7@1975@107-116@@@"Proving assertions about programs that manipulate data structures"@Oppen,D.C.@Cook,S.A. S@7@1975@117-120@@@"On (un)predictability of formal languages"@Ehrenfeucht,A.@Rozenberg,G. S@7@1975@121-125@@@"On decomposing languages defined by parallel devices"@Skyum,S. S@7@1975@126-136@@@"Intercalation theorems for tree transducer languages"@Perrault,C.R. S@7@1975@137-144@@@"On the (combinatorial) structure of L languages without interactions"@Ehrenfeucht,A.@Rozenberg,G. S@7@1975@145-152@@@"Degree-languages, polynomial time recognition, and the LBA problem"@Wotschke,D. S@7@1975@153-158@@@"Comparative complexity of grammar forms"@Ginsburg,S.@Lynch,N. S@7@1975@159-166@@@"Hashing schemes for extendible arrays"@Rosenberg,A.L.@Stockmeyer,L.J. S@7@1975@167-176@@@"Four models for the analysis of optimization of program control structures"@Pratt,T. S@7@1975@177-185@@@"Node listings for reducible flow graphs"@Aho,A.V.@Ullman,J.D. S@7@1975@186-193@@@"The complexity of control structures and data structures"@Lipton,R.J.@Eisenstat,S.C.@DeMillo,R.A. S@7@1975@194-206@@@"The optimal fixedpoint of recursive programs"@Manna,Z.@Shamir,A. S@7@1975@207-217@@@"Optimal code generation for expression trees"@Aho,A.V.@Johnson,S.C. S@7@1975@218-223@@@"On the complexity of the extended string-to-string correction problem"@Wagner,R.A. S@7@1975@224-233@@@"Geometric complexity"@Shamos,M.I. S@7@1975@234-239@@@"Riemann's hypothesis and tests for primality"@Miller,G.L. S@7@1975@240-244@@@"Two applications of a probabilistic search technique: Sorting $x^+^y$ and building balanced search trees"@Fredman,M.L. S@7@1975@245-254@@@"Algorithmic aspects of vertex elimination"@Rose,D.J.@Tarjan,R.E. S@7@1975@255-265@@@"Linear algorithms to recognize interval graphs and test for consecutive ones property"@Booth,K.S.@Lueker,G.S. F@16@1975@1-2@@@"The effect of the field of constants on the number of multiplication"@Winograd,S. F@16@1975@3-5@@@"The exact time required to perform generalized addition"@Floyd,R.W. F@16@1975@6-10@@@"Polynomials with 0-1 coefficients that are hard to evaluate"@Lipton,R.J. F@16@1975@11-12@@@"Fast parallel matrix inversion algorithms"@Csanky,L. F@16@1975@13-18@@@"Parallel computations in graph theory"@Arjomandi,E.@Corneil,D.G. F@16@1975@19-28@@@"Synchronization and computing capabilities of linear asynchronous structures"@Lipton,R.J.@Miller,R.E.@Snyder,L. F@16@1975@29-33@@@"Flow of control in the proof theory of structured programming"@DeBakker,J.W. F@16@1975@34-47@@@"Bases for chain-complete posets"@Markowsky,G.@Rosen,B.K. F@16@1975@48-56@@@"Correct computation rules for recursive languages"@Downey,P.J.@Sethi,R. F@16@1975@57-64@@@"On time versus space and related problems"@Hopcroft,J.@Paul,W.@Valiant,L. F@16@1975@65-70@@@"A note on tape bounds for SLA language processing"@Hartmanis,J.@Berman,L. F@16@1975@71-74@@@"Minimean optimality in sorting algorithms"@Pohl,I. F@16@1975@75-84@@@"Preserving order in a forest in less than logarithmic time"@VanEmdeBoas,P. F@16@1975@85-89@@@"On the complexity of comparison problems using linear functions"@Yao,A.C.-C. F@16@1975@90-97@@@"Evaluating relational expressions with dense and sparse arguments"@Szymanski,T.G.@Ullman,J.D. F@16@1975@98-99@@@"On the decision tree complexity of the shortest path problems"@Fredman,M.L. F@16@1975@100-112@@@"An $ 0(N sup 2.5 ) $ algorithm for maximum matching in general graphs"@Even,S.@Kariv,O. F@16@1975@113-118@@@"Information theory and the complexity of switching networks"@Pippenger,N. F@16@1975@119-121@@@"The effect of basis on size of Boolean expressions"@Pratt,V.R. F@16@1975@122-127@@@"Economy of descriptions by parsers, DPDA's, and PDA's"@Geller,M.M.@Hunt,H.B.,III@Szymanski,T.G.@Ullman,J.D. F@16@1975@128-134@@@"An improvement of Valiant's decision procedure for equivalence of deterministic finite-turn pushdown automata"@Beeri,C. F@16@1975@135-143@@@"A grammatical characterization of exponential-time languages"@Rounds,W.C. F@16@1975@144-150@@@"Decidability of equivalence, containment, intersection, and separability of context-free languages"@Hunt,H.B.,III@Rangel,J.L. F@16@1975@151-162@@@"Closest-point problems"@Shamos,M.I.@Hoey,D. F@16@1975@163-168@@@"An optimal bound for two dimensional bin packing"@Kleitman,D.J.@Krieger,M.M. F@16@1975@169-177@@@"Computational complexity of decision procedures for polynomials"@Adleman,L.@Manders,K. F@16@1975@178-183@@@"An application of graph coloring to printed circuit testing"@Garey,M.R.@Johnson,D.S.@So,H.C. F@16@1975@184-193@@@"On the complexity of timetable and multi-commodity flow problems"@Even,S.@Itai,A.@Shamir,A. S@8@1976@1-9@@@"Some complexity results for the traveling salesman problem"@Papadimitriou,C.H.@Steiglitz,K. S@8@1976@10-22@@@"Some NP-complete geometric problems"@Garey,M.R.@Graham,R.L.@Johnson,D.S. S@8@1976@23-29@@@"NP-complete decision problems for quadratic polynomials"@Manders,K.@Adleman,L. S@8@1976@30-40@@@"On isomorphism and density of NP and other complete sets"@Hartmanis,J.@Berman,L. S@8@1976@41-49@@@"Complexity of decision problems based on finite two-person perfect-information games"@Schaefer,T.J. S@8@1976@50-54@@@"Exponential space complete problems for Petri nets and commutative semigroups"@Cardoza,E.@Lipton,R.@Meyer,A.R. S@8@1976@55-57@@@"Parallel algorithms for the transitive closure and the connected component problems"@Hirschberg,D.S. S@8@1976@58-64@@@"Sorting on a mesh-connected parallel computer"@Thompson,C.D.@Kung,H.T. S@8@1976@65-72@@@"On abstractions of parallel programs"@Doeppner,T.W.,Jr. S@8@1976@73-86@@@"A consistent and complete deductive system for the verification of parallel programs"@Owicki,S. S@8@1976@87-91@@@"A new incompleteness result for Hoare's system"@Wand,M. S@8@1976@92-100@@@"An algebraic system for process structuring and interprocess communication"@Kimura,T. S@8@1976@101-111@@@"On structuring flowcharts"@Kosaraju,S.R. S@8@1976@112-120@@@"On line context free language recognition in less than cubic time"@Graham,S.L.@Harrison,M.A.@Ruzzo,W.L. S@8@1976@121-125@@@"Finding the depth of a flow graph"@Fong,A.C.@Ullman,J.D. S@8@1976@126-134@@@"Dichotomization, reachability, and the forbidden subgraph problem"@Hunt,H.B.,III@Szymanski,T.G. S@8@1976@135-140@@@"A useful device for showing the solvability of some decision problems"@Ibarra,O.H.@Kim,C.E. S@8@1976@141-148@@@"On deterministic context-free languages, multihead automata, and the power of an auxiliary pushdown store"@Sudborough,I.H. S@8@1976@149-160@@@"Space bounds for a game of graphs"@Paul,W.J.@Tarjan,R.E.@Celoni,J.R. S@8@1976@161-173@@@"Real-time algorithms for string-matching and palindrome recognition"@Galil,Z. S@8@1976@174-180@@@"Evaluation of polynomials with super-preconditioning"@Lipton,R.J.@Stockmeyer,L.J. S@8@1976@181-186@@@"Linear unification"@Paterson,M.S.@Wegman,M.N. S@8@1976@187-191@@@"The analysis of double hashing"@Guibas,L.J.@Szemeredi,E. S@8@1976@192-195@@@"On the average behavior of set merging algorithms"@Yao,A.C.-C. S@8@1976@196-203@@@"Universal circuits"@Valiant,L.G. S@8@1976@204-210@@@"The realization of monotone Boolean functions"@Pippenger,N. S@8@1976@211-219@@@"Associative retrieval trie hash-coding"@Burkhard,W.A. S@8@1976@220-230@@@"Divide-and-conquer in multidimensional space"@Bentley,J.L.@Shamos,M.I. S@8@1976@231-235@@@"Location of a point in a planar subdivision and its applications"@Lee,D.T.@Preparata,F.P. S@8@1976@236-243@@@"Simple G\*:odel numberings, translations, and the P-hierarchy"@Machtey,M.@Young,P. F@17@1976@1-8@@@"The mutual exclusion problem for unreliable processes"@Rivest,R.L.@Pratt,V.R. F@17@1976@9-18@@@"Characterization of the synchronization languages for PV systems"@Henderson,P.B.@Zalcstein,Y. F@17@1976@19-32@@@"Concurrency control for database systems"@Stearns,R.E.@Lewis,P.M.,II@Rosenkrantz,D.J. F@17@1976@33-41@@@"A linear time algorithm for deciding security"@Jones,A.K.@Lipton,R.J.@Snyder,L. F@17@1976@42-56@@@"Graph grammars and global program data flow analysis"@Farrow,R.@Kennedy,K.@Zucconi,L. F@17@1976@57-66@@@"Assignment commands and array structures"@Downey,P.J.@Sethi,R. F@17@1976@67-70@@@"$K^+^1$ heads are better than $K$"@Yao,A.C.@Rivest,R.L. F@17@1976@71-75@@@"A second step toward the polynomial hierarchy"@Baker,T.P.@Selman,A.L. F@17@1976@76-80@@@"On the structure of complete sets: Almost everywhere complexity and infinitely often speedup"@Berman,L. F@17@1976@81-88@@@"Diophantine complexity"@Adleman,L.@Manders,K. F@17@1976@89-97@@@"On parallelism in Turing machines"@Kozen,D. F@17@1976@98-108@@@"Alternation"@Chandra,A.K.@Stockmeyer,L.J. F@17@1976@109-121@@@"Semantical considerations on Floyd-Hoare logic"@Pratt,V.R. F@17@1976@122-126@@@"Categories for fixpoint-semantics"@Lehmann,D.J. F@17@1976@127-136@@@"An algebraic formulation of Knuthian semantics"@Chirica,L.M. F@17@1976@137-146@@@"Algebraic families of interpretations"@Courcelle,B.@Nivat,M. F@17@1976@147-158@@@"Rational algebraic theories and fixed-point solutions"@Wright,J.B.@Thatcher,J.W.@Wagner,E.G.@Goguen,J.A. F@17@1976@159-165@@@"Simple languages and free schemes"@Friedman,E.P. F@17@1976@166-172@@@"Self-organizing binary search trees"@Allen,B.@Munro,I. F@17@1976@173-177@@@"The complexity of searching an ordered random table"@Yao,A.C.@Yao,F.F. F@17@1976@178-182@@@"Using comparison trees to derive lower bounds for selection problems"@Fussenegger,F.@Gabow,H.N. F@17@1976@183-196@@@"The analysis of hashing algorithms that exhibit k-ary clustering"@Guibas,L.J. F@17@1976@197-207@@@"Complexity of trie index construction"@Comer,D.@Sethi,R. F@17@1976@208-215@@@"Geometric intersection problems"@Shamos,M.I.@Hoey,D. F@17@1976@216-227@@@"Approximation algorithms for some routing problems"@Frederickson,G.N.@Hecht,M.S.@Kim,C.E. F@17@1976@228-235@@@"Variations of a new machine model"@VanLeeuwen,J. F@17@1976@236-252@@@"Recognizing certain repetitions and reversals within strings"@Galil,Z.@Seiferas,J. F@17@1976@253-257@@@"Parenthesis generators"@Boasson,L.@Nivat,M. F@17@1976@258-263@@@"On the evaluation of powers and related problems"@Pippenger,N. F@17@1976@264-267@@@"Some polynomial and integer divisibility problems are NP-hard"@Plaisted,D.A. F@17@1976@268-273@@@"Lower bounds from complex function theory"@Shamos,M.I.@Yuval,G. S@9@1977@1-10@@@"Finding a minimum circuit in a graph"@Itai,A. S@9@1977@11-17@@@"An $ OMEGA (n sup 2 log n) $ lower bound to the shortest paths problem"@Yao,A.C.@Avis,D.M.@Rivest,R.L. S@9@1977@18-29@@@"Reference machines require non-linear time to maintain disjoint sets"@Tarjan,R.E. S@9@1977@30-41@@@"Fast probabilistic algorithms for Hamiltonian circuits and matchings"@Angluin,D.@Valiant,L.G. S@9@1977@42-48@@@"The complexity of priority queue maintenance"@Brown,M.R. S@9@1977@49-60@@@"A new representation for linear lists"@Guibas,L.J.@McCreight,E.M.@Plass,M.F.@Roberts,J.R. S@9@1977@61-76@@@"The decidability of the reachability problem for vector addition systems"@Sacerdote,G.S.@Tenney,R.L. S@9@1977@77-90@@@"Optimal implementation of conjunctive queries in relational data bases"@Chandra,A.K.@Merlin,P.M. S@9@1977@91-97@@@"Economical solutions for the critical section problem in a distributed system"@Peterson,G.L.@Fischer,M.J. S@9@1977@98-105@@@"Nonserial dynamic programming is optimal"@Rosenthal,A. S@9@1977@106-112@@@"Universal classes of hash functions"@Carter,J.L.@Wegman,M.N. S@9@1977@113-121@@@"The analysis of an improved hashing technique"@Gonnet,G.@Munro,I. S@9@1977@122-131@@@"Iteration theorems for LL($k$) languages"@Beatty,J.C. S@9@1977@132-142@@@"A comparison of instruction sets for stack machines"@Prabhala,B.@Sethi,R. S@9@1977@143-150@@@"Graph isomorphism, general remarks"@Miller,G.L. S@9@1977@151-163@@@"Reducibility, randomness, and intractability"@Adleman,L.@Manders,K. S@9@1977@164-177@@@"Complexity of finitely presented algebras"@Kozen,D. S@9@1977@178-185@@@"Computations with a restricted number of nondeterministic steps"@Kintala,C.M.R.@Fischer,P.C. S@9@1977@186-194@@@"Polynomial reducibilities and upward diagonalizations"@Simon,Istvan@Gill,J. S@9@1977@195-207@@@"On feasible numbers"@Simon,J. S@9@1977@208-217@@@"Separating tape bounded auxiliary pushdown automata classes"@Sudborough,I.H. S@9@1977@218-222@@@"On time hierarchies"@Paul,W.J. S@9@1977@223-227@@@"Relations between diagonalization, proof systems, and complexity gaps"@Hartmanis,J. S@9@1977@228-238@@@"Efficient reducibility between programming systems"@Lynch,N.A.@Blum,E.K. S@9@1977@239-248@@@"New real-time simulations of multihead tape units"@Leong,B.@Seiferas,J. S@9@1977@249-260@@@"A complete axiomatic system for proving deductions about recursive programs"@Harel,D.@Pnueli,A.@Stavi,J. S@9@1977@261-268@@@"Computability and completeness in logics of programs"@Harel,D.@Meyer,A.R.@Pratt,V.R. S@9@1977@269-285@@@"On the theory of programming logics"@Constable,R.L. S@9@1977@286-294@@@"Propositional modal logic of programs"@Fischer,M.J.@Ladner,R.E. S@9@1977@295-305@@@"Subtree replacement systems: A unifying theory for recursive equations, LISP, lucid and combinatory logic"@O'Donnell,M. S@9@1977@306-311@@@"Parameter-passing mechanisms and nondeterminism"@Hennessy,M.C.B.@Ashcroft,E.A. F@18@1977@1-6@@@"A necessary and sufficient condition for the existence of Hoare logics"@Lipton,R. F@18@1977@7-12@@@"Data types"@Lehmann,D.J.@Smyth,M.B. F@18@1977@13-17@@@"The category-theoretic solution of recursive domain equations"@Smyth,M.B.@Plotkin,G.D. F@18@1977@18-29@@@"Program invariants as fixed points"@Clarke,E.M.,Jr. F@18@1977@30-45@@@"Confluent reductions: Abstract properties and applications to term rewriting systems"@Huet,G. F@18@1977@46-57@@@"The temporal logic of programs"@Pnueli,A. F@18@1977@58-61@@@"Language representation theorems: How to generate the R. E. sets from the regular sets"@Book,R.V. F@18@1977@62-73@@@"A new decidable problem, with applications"@Lewis,H.R. F@18@1977@74-81@@@"The unsolvability of the equivalence problem for $epsilon$-free NGSM's with unary input (output) alphabet and applications"@Ibarra,O.H. F@18@1977@82-89@@@"Several results in program size complexity"@Katseff,H.P.@Sipser,M. F@18@1977@90-94@@@"The typed $lambda$-calculus is not elementary recursive"@Statman,R. F@18@1977@95-99@@@"Precise bounds for Presburger arithmetic and the reals with addition"@Berman,L. F@18@1977@100-106@@@"Recursion theoretic characterizations of complexity theoretic properties"@Bennison,V.L.@Soare,R.I. F@18@1977@107-113@@@"The theory of joins in relational data bases"@Aho,A.V.@Beeri,C.@Ullman,J.D. F@18@1977@114-119@@@"Fast decision algorithms based on union and find"@Nelson,G.@Oppen,D.C. F@18@1977@120-131@@@"An efficient parallel garbage collection system and its correctness proof"@Kung,H.T.@Song,S.W. F@18@1977@132-141@@@"A space efficient method for the lowest common ancestor problem and an application to finding negative cycles"@Maier,D. F@18@1977@142-146@@@"On uniquely represented data structures"@Snyder,L. F@18@1977@147-161@@@"On the capability of finite automata in 2 and 3 dimensional space"@Blum,M.@Sakoda,W.J. F@18@1977@162-170@@@"Application of a planar separator theorem"@Lipton,R.J.@Tarjan,R.E. F@18@1977@171-174@@@"The power of commutativity"@Hyafil,L. F@18@1977@175-178@@@"On taking roots in finite fields"@Adleman,L.@Manders,K.@Miller,G. F@18@1977@179-188@@@"Saving space in fast string-matching"@Galil,Z.@Seiferas,J. F@18@1977@189-195@@@"A new proof of the linearity of the Boyer-Moore string searching algorithm"@Guibas,L.J.@Odlyzko,A.M. F@18@1977@196-205@@@"On the average number of registers required for evaluating arithmetic expressions"@Flajolet,P.@Raoult,J.C.@Vuillemin,J. F@18@1977@206-213@@@"Fast approximation algorithms for knapsack problems"@Lawler,E.L. F@18@1977@214-221@@@"Combinatorial analysis of an efficient algorithm for processor and storage allocation"@Coffman,E.G.,Jr.@Leung,J.Y.-T. F@18@1977@222-227@@@"Probabilistic computations: Toward a unified measure of complexity"@Yao,A.C.-C. F@18@1977@228-240@@@"On triangulations of a set of points in the plane"@Lloyd,E.L. F@18@1977@241-253@@@"New NP-hard and NP-complete polynomial and integer divisibility problems"@Plaisted,D.A. F@18@1977@254-266@@@"Lower bounds for natural proof systems"@Kozen,D. S@10@1978@1-12@@@"Combinatorial optimization with rational objective functions"@Megiddo,N. S@10@1978@13-18@@@"Maximization problems on graphs with edge weights chosen from a normal distribution"@Lueker,G.S. S@10@1978@19-29@@@"A representation for linear lists with movable fingers"@Brown,M.R.@Tarjan,R.E. S@10@1978@30-39@@@"The macro model for data compression"@Storer,J.A.@Szymanski,T.G. S@10@1978@40-50@@@"The subgraph homeomorphism problem"@Lapaugh,A.S.@Rivest,R.L. S@10@1978@51-58@@@"On the $ n sup {log~n} $ isomorphism technique"@Miller,G.L. S@10@1978@59-65@@@"Exact and approximate membership testers"@Carter,L.@Floyd,R.@Gill,J.@Markowsky,G.@Wegman,M. S@10@1978@66-74@@@"Tree transducers, L systems and two-way machines"@Engelfriet,J.@Rozenberg,G.@Slutzki,G. S@10@1978@75-85@@@"Operational and semantic equivalence between recursive programs"@Raoult,J.-C.@Vuillemin,J. S@10@1978@86-88@@@"A new solution to the critical section problem"@Katseff,H.P. S@10@1978@89-94@@@"A unified approach to models of synchronous parallel machines"@Goldschlager,L.M. S@10@1978@95-104@@@"Computability theory in admissible domains"@Sciore,E.@Tang,A. S@10@1978@105-113@@@"On formulating simultaneity for studying parallelism and synchronization"@Miller,R.E.@Yap,C.K. S@10@1978@114-118@@@"Parallelism in random access machines"@Fortune,S.@Wyllie,J. S@10@1978@119-132@@@"Data type specification: Parameterization and the power of specification techniques"@Thatcher,J.W.@Wagner,E.G.@Wright,J.B. S@10@1978@133-142@@@"An efficient algorithm for determining whether a cubic graph is toroidal"@Filotti,I.S. S@10@1978@143-149@@@"Switching functions whose monotone complexity is nearly quadratic"@Wegener,I. S@10@1978@150-161@@@"Straight-line program length as a parameter for complexity measures"@Lynch,N.A. S@10@1978@162-172@@@"Computational complexity of computing polynomials over the fields of real and complex numbers"@Pan,V.Y. S@10@1978@173-183@@@"Optimal evaluation of pairs of bilinear forms"@Ja'Ja',J. S@10@1978@184-192@@@"Algorithms for edge coloring bipartite graphs"@Gabow,H.N.@Kariv,O. S@10@1978@193-195@@@"On the parallel evaluation of multivariate polynomials"@Hyafil,L. S@10@1978@196-204@@@"Time-space tradeoffs for computing functions, using connectivity properties of their circuits"@Tompa,M. S@10@1978@205-215@@@"An NP-complete number-theoretic problem"@Gurari,E.M.@Ibarra,O.H. S@10@1978@216-226@@@"The complexity of satisfiability problems"@Schaefer,T.J. S@10@1978@227-232@@@"Coping with errors in binary search procedures"@Rivest,R.L.@Meyer,A.R.@Kleitman,D.J.@Winklmann,K.@Spencer,J. S@10@1978@233-239@@@"On time-space classes and their relation to the theory of real addition"@Bruss,A.R.@Meyer,A.R. S@10@1978@240-245@@@"On the completeness of a generalized matching problem"@Kirkpatrick,D.G.@Hell,P. S@10@1978@246-252@@@"Propositional representation of arithmetic proofs"@Dowd,M. S@10@1978@253-264@@@"Node- and edge-deletion NP-complete problems"@Yannakakis,M. S@10@1978@265-274@@@"On the complexity of the maximum subgraph problem"@Lewis,J.M. S@10@1978@275-286@@@"Nondeterminism and the size of two way finite automata"@Sakoda,W.J.@Sipser,M. S@10@1978@287-295@@@"Indexing of subrecursive classes"@Kozen,D. S@10@1978@296-313@@@"An analysis of the full alpha-beta pruning algorithm"@Baudet,G.M. S@10@1978@314-319@@@"Anomaly hierarchies of mechanized inductive inference"@Case,J.@Smith,C. S@10@1978@320-325@@@"Presburger arithmetic with bounded quantifier alternation"@Reddy,C.R.@Loveland,D.W. S@10@1978@326-337@@@"A practical decision method for propositional dynamic logic"@Pratt,V.R. S@10@1978@338-342@@@"Relativized questions involving probabilistic algorithms"@Rackoff,C. F@19@1978@1-7@@@"Description and analysis of an efficient priority queue representation"@Francon,J.@Viennot,G.@Vuillemin,J. F@19@1978@8-21@@@"A dichromatic framework for balanced trees"@Guibas,L.J.@Sedgewick,R. F@19@1978@22-27@@@"Should tables be sorted?"@Yao,A.C. F@19@1978@28-34@@@"A data structure for orthogonal range queries"@Lueker,G.S. F@19@1978@35-47@@@"Complexity of solvable cases of the decision problem for the predicate calculus"@Lewis,H.R. F@19@1978@48-54@@@"GO is PSPACE hard"@Lichtenstein,D.@Sipser,M. F@19@1978@55-64@@@"The complexity of checkers on an N x N board"@Fraenkel,A.S.@Garey,M.R.@Johnson,D.S.@Schaefer,T.@Yesha,Y. F@19@1978@65-72@@@"One-way log-tape reductions"@Hartmanis,J.@Immerman,N.@Mahaney,S. F@19@1978@73-74@@@"Halting space-bounded computations"@Sipser,M. F@19@1978@75-83@@@"Two theorems on random polynomial time"@Adleman,L. F@19@1978@84-91@@@"Improved bounds on the problem of time-space trade-off in the pebble game"@Reischuk,R. F@19@1978@92-106@@@"Alternating pushdown automata"@Ladner,R.E.@Lipton,R.J.@Stockmeyer,L.J. F@19@1978@107-112@@@"On tape-bounded probabilistic Turing machine transducers"@Simon,J.@Gill,J.@Hunt,J. F@19@1978@113-122@@@"On alternation"@Paul,W.J.@Prauss,E.J.@Reischuk,R. F@19@1978@123-126@@@"Equality languages, fixed point languages and representations of recursively enumerable languages"@Engelfriet,J.@Rozenberg,G. F@19@1978@127-131@@@"Computable nondeterministic functions"@Chandra,A.K. F@19@1978@132-142@@@"On the power of the compass (or, Why mazes are easier to search than graphs)"@Blum,M.@Kozen,D. F@19@1978@143-150@@@"Limited subsets of a free monoid"@Simon,Imre F@19@1978@151-158@@@"Lower bounds on information transfer in distributed computations"@Abelson,H. F@19@1978@159-165@@@"An optimal lower bound on the number of total operations to compute 0-1 polynomials over the field of complex numbers"@VandeWiele,J.-P. F@19@1978@166-176@@@"Strassen's algorithm is not optimal: Trililnear technique of aggregating, uniting and canceling for constructing fast algorithms for matrix operations"@Pan,V.Y. F@19@1978@177-183@@@"A decidability result for a second order process logic"@Parikh,R. F@19@1978@184-192@@@"Consistent and complete proof rules for the total correctness of parallel programs"@Flon,L.@Suzuki,N. F@19@1978@193-200@@@"Model theoretic aspects of computational complexity"@Lipton,R.J. F@19@1978@201-213@@@"On recursive equations having a unique solution"@Courcelle,B. F@19@1978@214-220@@@"On the algebra of order"@Lehmann,D.J. F@19@1978@221-230@@@"Data types as initial algebras: A unification of Scottery and ADJery"@Kanda,A. F@19@1978@231-245@@@"A new algorithm for the maximal flow problem"@Galil,Z. F@19@1978@246-252@@@"A fast algorithm for single processor scheduling"@Simons,B. F@19@1978@253-258@@@"Selection and sorting with limited storage"@Munro,J.I.@Paterson,M.S. F@19@1978@259-266@@@"Improving the bounds on optimal merging"@Christen,C. F@19@1978@267-279@@@"On lifted problems"@Yap,C.K. F@19@1978@280-289@@@"On the average-case complexity of selecting $k$-th best"@Yao,A.C.@Yao,F.F. S@11@1979@1-12@@@"The recognition of series parallel digraphs"@Valdes,J.@Tarjan,R.E.@Lawler,E.L. S@11@1979@13-26@@@"Network flow and generalized path compression"@Galil,Z.@Naamad,A. S@11@1979@27-37@@@"On determining the genus of a graph in $ O(v sup O(g) ) $ steps"@Filotti,I.S.@Miller,G.L.@Reif,J.H. S@11@1979@38-48@@@"Decomposing a polygon into its convex parts"@Chazelle,B.@Dobkin,D. S@11@1979@49-61@@@"Computing integrated costs of sequences of operations with application to dictionaries"@Flajolet,P.@Francon,J.@Vuillemin,J. S@11@1979@62-66@@@"A near optimal data structure for a type of range query problem"@Fredman,M.L. S@11@1979@67-73@@@"On a multidimensional search problem"@Kosaraju,S.R. S@11@1979@74-80@@@"The complexity of finding periods"@Sedgewick,R.@Szymanski,T.G. S@11@1979@81-88@@@"Area-time complexity for VLSI"@Thompson,C.D. S@11@1979@89-98@@@"Deadlock-free packet switching networks"@Toueg,S.@Ullman,J.D. S@11@1979@99-107@@@"Storage representations for tree-like data structures"@Rosenberg,A.L.@Wood,D.@Galil,Z. S@11@1979@108-117@@@"Implicit data structures"@Munro,J.I.@Suwanda,H. S@11@1979@118-129@@@"On the cryptocomplexity of knapsack systems"@Shamir,A. S@11@1979@130-141@@@"Finding patterns common to a set of strings"@Angluin,D. S@11@1979@142-152@@@"The complexity of the equivalence problem for counter machines, semilinear sets, and simple programs"@Gurari,E.M.@Ibarra,O.H. S@11@1979@153-159@@@"Some connections between mathematical logic and complexity theory"@DeMillo,R.A.@Lipton,R.J. S@11@1979@160-166@@@"A completeness technique for d-axiomatizable semantics"@Berman,F. S@11@1979@167-175@@@"On the expressive power of dynamic logic"@Meyer,A.R.@Winklmann,K. S@11@1979@176-188@@@"A programming language theorem which is independent of Peano arithmetic"@O'Donnell,M. S@11@1979@189-196@@@"Negation can be exponentially powerful"@Valiant,L.G. S@11@1979@197-208@@@"On the complexity of bilinear forms with commutativity"@Ja'Ja',J. S@11@1979@209-213@@@"Some complexity questions related to distributive computing"@Yao,A.C.-C. S@11@1979@214-223@@@"The complexity of problems in systems of communicating sequential processes"@Ladner,R.E. S@11@1979@224-230@@@"Time-space trade-offs for asynchronous parallel models \(en Reducibilities and equivalences"@Peterson,G.L. S@11@1979@231-236@@@"Fast parallel processing array algorithms for some graph problems"@Kosaraju,S.R. S@11@1979@237-248@@@"The pebbling problem is complete in polynomial space"@Gilbert,J.R.@Lengauer,T.@Tarjan,R.E. S@11@1979@249-261@@@"Completeness classes in algebra"@Valiant,L.G. S@11@1979@262-277@@@"Upper and lower bounds on time-space tradeoffs"@Lengauer,T.@Tarjan,R.E. S@11@1979@278-287@@@"On $gamma$-reducibility versus polynomial time many-one reducibility"@Long,T.J. S@11@1979@288-308@@@"Universal games of incomplete information"@Reif,J.H. S@11@1979@309-318@@@"Computable queries for relational data bases"@Chandra,A.K.@Harel,D. S@11@1979@319-329@@@"Equivalence of relational database schemes"@Beeri,C.@Mendelzon,A.O.@Sagiv,Y.@Ullman,J.D. S@11@1979@330-337@@@"Minimum covers in the relational database model"@Maier,D. S@11@1979@338-345@@@"Deterministic CFL's are accepted simultaneously in polynomial time and log squared space"@Cook,S.A. S@11@1979@346-351@@@"Real-time simulation of concatenable double-ended queues by double-ended queues"@Kosaraju,S.R. S@11@1979@352-359@@@"Tree-size bounded alternation"@Ruzzo,W.L. S@11@1979@360-364@@@"Lower bounds on the size of sweeping automata"@Sipser,M. F@20@1979@1-8@@@"Some theoretical aspects of position-location problems"@Yemini,Y. F@20@1979@9-17@@@"On a general method for maximizing and minimizing among certain geometric problems"@Dobkin,D.P.@Snyder,L. F@20@1979@18-27@@@"Efficient computation of continuous skeletons"@Kirkpatrick,D.G. F@20@1979@28-38@@@"Field extension and triangular aggregating, uniting and canceling for the acceleration of matrix multiplications"@Pan,V.Y. F@20@1979@39-46@@@"Canonical labelling of graphs in linear average time"@Babai,L.@Kucera,L. F@20@1979@47-54@@@"Succinct certificates for the solvability of binary quadratic Diophantine equations"@Lagarias,J.C. F@20@1979@55-60@@@"A subexponential algorithm for the discrete logarithm problem with applications to cryptography"@Adleman,L. F@20@1979@61-65@@@"Computational complexity in algebraic function fields"@Pippenger,N. F@20@1979@66-90@@@"Formal languages: Origins and directions"@Greibach,S.A. F@20@1979@91-96@@@"The decidability of the equivalence of context-free grammar forms"@Blattner,M. F@20@1979@97-100@@@"Bijective A-transducers"@Maurer,H.A.@Nivat,M. F@20@1979@101-114@@@"Semantics of probabilistic programs"@Kozen,D. F@20@1979@115-122@@@"Models of program logics"@Pratt,V.R. F@20@1979@123-131@@@"Orderings for term-rewriting systems"@Dershowitz,N. F@20@1979@132-139@@@"Complexity of partial satisfaction"@Lieberherr,K.@Specker,E. F@20@1979@140-147@@@"The cube-connected-cycles: A versatile network for parallel computation"@Preparata,F.P.@Vuillemin,J. F@20@1979@148-168@@@"Transforming static data structures to dynamic structures"@Saxe,J.B.@Bentley,J.L. F@20@1979@169-174@@@"Toward self-organizing linear search"@Gonnet,G.H.@Munro,J.I.@Suwanda,H. F@20@1979@175-182@@@"New classes and applications of hash functions"@Wegman,M.N.@Carter,J.L. F@20@1979@183-195@@@"Towards analysing sequences of operations for dynamic data structures"@Flajolet,P.@Francon,J.@Vuillemin,J. F@20@1979@196-204@@@"Efficient algorithms for simple matroid intersection problems"@Gabow,H.N.@Tarjan,R.E. F@20@1979@205-217@@@"A polynomial time algorithm for solving systems of linear inequalities with two variables per inequality"@Aspvall,B.@Shiloach,Y. F@20@1979@218-223@@@"Random walks, universal traversal sequences, and the complexity of maze problems"@Aleliunas,R.@Karp,R.M.@Lipton,R.J.@Lovasz,L.@Rackoff,C. F@20@1979@224-233@@@"Observations about the development of theoretical computer science"@Hartmanis,J. F@20@1979@234-254@@@"Resource allocation with immunity to limited process failure"@Fischer,M.J.@Lynch,N.A.@Burns,J.E.@Borodin,A. F@20@1979@255-266@@@"Approximate algorithms for optimization of busy waiting in parallel programs"@Clarke,E.M.@Liu,L. F@20@1979@267-273@@@"Modeling communications protocols by automata"@Aho,A.V.@Ullman,J.D.@Yannakakis,M. F@20@1979@274-285@@@"Controlling concurrency using locking protocols"@Kedem,Z.@Silberschatz,A. F@20@1979@286-297@@@"Locking policies: Safety and freedom from deadlock"@Yannakakis,M.@Papadimitriou,C.H.@Kung,H.T. F@20@1979@298-306@@@"On time versus space II"@Paul,W.J.@Reischuk,R. F@20@1979@307-311@@@"On simultaneous resource bounds"@Pippenger,N. F@20@1979@312-318@@@"On uniform circuit complexity"@Ruzzo,W.L. F@20@1979@319-327@@@"A time-space tradeoff for sorting on non-oblivious machines"@Borodin,A.@Fischer,M.J.@Kirkpatrick,D.G.@Lynch,N.A.@Tompa,M. F@20@1979@328-336@@@"A $ T cdot S sup 2 = O(2 sup n ) $ time/space tradeoff for certain NP-complete problems"@Schroeppel,R.@Shamir,A. F@20@1979@337-347@@@"Length of predicate calculus formulas as a new complexity measure"@Immerman,N. F@20@1979@348-363@@@"Multiple-person alternation"@Peterson,G.L.@Reif,J.H. F@20@1979@364-370@@@"Explicit constructions of linear size superconcentrators"@Gabber,O.@Galil,Z. F@20@1979@371-382@@@"Origins of recursive function theory"@Kleene,S.C. F@20@1979@383-391@@@"Relativized cryptography"@Brassard,G. F@20@1979@392-396@@@"Succinctness, verifiability and determinism in representations of polynomial-time languages"@Baker,T.P.@Hartmanis,J. F@20@1979@397-410@@@"Reductions that lie"@Adleman,L.M.@Manders,K. F@20@1979@411-420@@@"Division is good"@Simon,J. F@20@1979@421-427@@@"Complexity of the mover's problem and generalizations"@Reif,J.H. S@12@1980@1-7@@@"Definability in dynamic logic"@Meyer,A.R.@Parikh,R. S@12@1980@8-13@@@"Logics for probabilistic programming"@Reif,J.H. S@12@1980@14-21@@@"Complete axiomatization of algorithmic properties of program schemes with bounded nondeterministic interpretations"@Mirkowska,G. S@12@1980@22-28@@@"Dynamic algebras and the nature of induction"@Pratt,V.R. S@12@1980@29-38@@@"A decision method for the equivalence of some non-real-time deterministic pushdown automata"@Ukkonen,E. S@12@1980@39-44@@@"On the distribution of independent formulae of number theory"@Plaisted,D.A. S@12@1980@45-57@@@"The consistency of `P = NP' and related problems with fragments of number theory"@DeMillo,R.A.@Lipton,R.J. S@12@1980@58-69@@@"Independence results in computer science?"@Joseph,D.@Young,P. S@12@1980@70-81@@@"Fast allocation of nearby resources in a distributed system"@Lynch,N.A. S@12@1980@82-93@@@"Local and global properties in networks of processors"@Angluin,D. S@12@1980@94-99@@@"Deadlock- and livelock-free packet switching networks"@Toueg,S. S@12@1980@100-107@@@"Kraft storage and access for list implementations"@Brown,D.J. S@12@1980@108-116@@@"Vector execution of flow graphs"@Strong,H.R. S@12@1980@117-122@@@"A complete axiomatization for a large class of dependencies in relational databases"@Sadri,F.@Ullman,J.D. S@12@1980@123-134@@@"Horn clauses and database dependencies"@Fagin,R. S@12@1980@135-145@@@"Dynamically maintaining configurations in the plane"@Overmars,M.H.@VanLeeuwen,J. S@12@1980@146-153@@@"Detection is easier than computation"@Chazelle,B.@Dobkin,D.P. S@12@1980@154-160@@@"On translating a set of rectangles"@Guibas,L.J.@Yao,F.F. S@12@1980@161-176@@@"An optimal solution to a wire-routing problem"@Tompa,M. S@12@1980@177-189@@@"Optimal tree layout"@Fischer,M.J.@Paterson,M.S. S@12@1980@190-200@@@"The chip complexity of binary arithmetic"@Brent,R.P.@Kung,H.T. S@12@1980@201-210@@@"The node cost measure for embedding graphs on the planar grid"@Storer,J.A. S@12@1980@211-217@@@"An approach to the K paths problem"@Cypher,A. S@12@1980@218-224@@@"Isomorphism for graphs embeddable on the projective plane"@Lichtenstein,D. S@12@1980@225-235@@@"Isomorphism testing for graphs of bounded genus"@Miller,G. S@12@1980@236-243@@@"A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus"@Filotti,I.S.@Mayer,J.N. S@12@1980@244-251@@@"Testing isomorphism on cone graphs"@Hoffmann,C.M. S@12@1980@252-261@@@"The orbit problem is decidable"@Kannan,R.@Lipton,R.J. S@12@1980@262-272@@@"Testing polynomials which are easy to compute"@Heintz,J.@Schnorr,C.P. S@12@1980@273-280@@@"The complexity of the equivalence problem for straight-line programs"@Ibarra,O.H.@Leininger,B.S. S@12@1980@281-293@@@"Complexity of implementations on the level of algebraic specifications"@Ehrig,H.@Mahr,B. S@12@1980@294-301@@@"A time-space tradeoff for sorting on a general sequential model of computation"@Borodin,A.@Cook,S. S@12@1980@302-309@@@"Some connections between nonuniform and uniform complexity classes"@Karp,R.M.@Lipton,R.J. S@12@1980@310-317@@@"On some deterministic space complexity problems"@Hong,J.-W. S@12@1980@318-325@@@"Space-time tradeoffs and first order problems in a model of programs"@Yap,C.K. S@12@1980@326-332@@@"Graph pebbling with many free pebbles can be difficult"@Carlson,D.A.@Savage,J.E. S@12@1980@333-338@@@"Two familiar transitive closure algorithms which admit no polynomial time, sublinear space implementations"@Tompa,M. S@12@1980@339-350@@@"Time-space tradeoffs for some algebraic problems"@Ja'Ja',J. S@12@1980@351-356@@@"Comparative schematology and pebbling with auxiliary pushdowns"@Pippenger,N. S@12@1980@357-367@@@"An information-theoretic approach to time bounds for on-line computation"@Paul,W.J.@Seiferas,J.I.@Simon,J. S@12@1980@368-377@@@"Linear expected-time algorithms for connectivity problems"@Karp,R.M.@Tarjan,R.E. S@12@1980@378-384@@@"A shortest-path algorithm with expected time $ O(n sup 2 log~n~log sup * n) $"@Bloniarz,P. S@12@1980@385-397@@@"Random matroids"@Reif,J.H.@Spirakis,P.G. S@12@1980@398-419@@@"Heuristics for weighted perfect matching"@Supowit,K.J.@Plaisted,D.A.@Reingold,E.M. S@12@1980@420-428@@@"Generalized selection and ranking"@Frederickson,G.N.@Johnson,D.B. S@12@1980@429-435@@@"Efficient dynamic programming using quadrangle inequalities"@Yao,F.F. S@12@1980@436-446@@@"Critical path scheduling of task systems with resource and processor constraints"@Lloyd,E.L. F@21@1980@1-9@@@"On linear characterizations of combinatorial optimization problems"@Karp,R.M.@Papadimitriou,C.H. F@21@1980@10-16@@@"On a class of totally unimodular matrices"@Yannakakis,M. F@21@1980@17-27@@@"An $ O( sqrt { |v|} cdot |E|) $ algorithm for finding maximum matching in general graphs"@Micali,S.@Vazirani,V.V. F@21@1980@28-35@@@"Some theorems about matrix multiplication"@Hu,T.C.@Shing,M.T. F@21@1980@36-41@@@"Polynomial-time algorithms for permutation groups"@Furst,M.@Hopcroft,J.@Luks,E. F@21@1980@42-49@@@"Isomorphism of graphs of bounded valence can be tested in polynomial time"@Luks,E.M. F@21@1980@50-53@@@"A fast algorithm for multiprocessor scheduling"@Simons,B. F@21@1980@54-60@@@"Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis"@Mahaney,S.R. F@21@1980@62-73@@@"Efficient algorithms for path system problems and applications to alternating and time-space complexity classes"@Sudborough,I.H. F@21@1980@74-82@@@"Upper and lower bounds for first order expressibility"@Immerman,N. F@21@1980@83-85@@@"The equivalence problem for deterministic two-way sequential transducers is decidable"@Gurari,E.M. F@21@1980@86-95@@@"Succinct representation, random strings, and complexity classes"@Peterson,G.L. F@21@1980@96-107@@@"Proofs by induction in equational theories with constructors"@Huet,G.@Hullot,J.-M. F@21@1980@108-117@@@"An improved algorithm for computing with equations"@Chew,P. F@21@1980@118-128@@@"Programs and types"@Constable,R.L. F@21@1980@129-142@@@"Process logic: Expressiveness, decidability, completeness"@Harel,D.@Kozen,D.@Parikh,R. F@21@1980@143-151@@@"A linear history semantics for distributed languages"@Francez,N.@Lehmann,D.@Pnueli,A. F@21@1980@152-160@@@"The complexity of recursion schemes and recursive programming languages"@Hunt,H.B.,III@Rosenkrantz,D.J. F@21@1980@161-172@@@"On the expressive power of attributed grammars"@Courcelle,B.@Franchi-Zannettacci,P. F@21@1980@173-184@@@"Loop elimination and loop reduction \(en A model-theoretic analysis of programs" (partial report)@Kfoury,A.J. F@21@1980@185-190@@@"Complexity of flow analysis, inductive assertion synthesis and a language due to Dijkstra"@Jones,N.D.@Muchnick,S.S. F@21@1980@191-199@@@"The inherent complexity of dynamic data structures which accommodate range queries"@Fredman,M.L. F@21@1980@200-206@@@"Efficient uses of the past"@Dobkin,D.P.@Munro,J.I. F@21@1980@207-216@@@"Exploring binary trees and other simple trees"@Flajolet,P.@Odlyzko,A. F@21@1980@217-228@@@"A general class of resource tradeoffs"@Bentley,J.L.@Brown,D.J. F@21@1980@229-237@@@"Some observations on the average behavior of heapsort"@Doberkat,E.-E. F@21@1980@238-247@@@"Tuning the coalesced hashing method to obtain optimum performance"@Vitter,J.S. F@21@1980@248-254@@@"Biased 2-3 trees"@Bent,S.W.@Sleator,D.D.@Tarjan,R.E. F@21@1980@255-259@@@"Implicit data structures with fast update"@Frederickson,G.N. F@21@1980@260-269@@@"The compilation of regular expressions into integrated circuits"@Floyd,R.W.@Ullman,J.D. F@21@1980@270-281@@@"Area-efficient graph layouts (for VLSI)"@Leiserson,C.E. F@21@1980@282-293@@@"A polynomial time algorithm for optimal routing around a rectangle"@Lapaugh,A.S. F@21@1980@294-300@@@"A combinatorial limit to the computing power of V.L.S.I. circuits"@Vuillemin,J. F@21@1980@301-307@@@"On the priority approach to hidden-surface algorithms"@Yao,F.F. F@21@1980@308-319@@@"A linear time algorithm for the lowest common ancestor problem"@Harel,D. F@21@1980@320-327@@@"Parsing for structural editors"@Wegman,M. F@21@1980@328-332@@@"Algebraic dependencies"@Yannakakis,M.@Papadimitriou,C.H. F@21@1980@333-347@@@"Structure and complexity of relational queries"@Chandra,A.K.@Harel,D. F@21@1980@348-359@@@"On similarity and duality of computation"@Hong,J.-W. F@21@1980@360-372@@@"Hardware complexity and parallel computation"@Dymond,P.W.@Cook,S.A. F@21@1980@373-379@@@"A distributed abstract data type implemented by a probabilistic communication scheme"@Francez,N.@Rodeh,M. F@21@1980@380-386@@@"A time-luck tradeoff in cryptography"@Brassard,G. F@21@1980@387-406@@@"On distinguishing prime numbers from composite numbers"@Adleman,L.M. F@21@1980@407-410@@@"$N$-process synchronization by $ 4 cdot log sub 2 N$-valued shared variables"@Rabin,M.O. F@21@1980@411-420@@@"A recognition algorithm for deterministic CFLs optimal in time and space"@VonBraunmuhl,R.@Verbeek,R. S@13@1981@1-6@@@"The $ omega $-sequence equivalence problem for DOL systems is decidable"@Culik,K.,II@Harju,T. S@13@1981@7-18@@@"Unique normal forms in term rewriting systems with repeated variables"@Chew,P. S@13@1981@19-27@@@"Classes of functions for computing on binary trees"@Hawrusik,F.@Venkataraman,K.N.@Yasuhara,A. S@13@1981@28-37@@@"Examples of hard tautologies in the propositional calculus"@Krishnamurthy,B.@Moll,R.N. S@13@1981@38-45@@@"The complexity of parameter passing in polymorphic procedures"@Leivant,D. S@13@1981@46-54@@@"Pushdown automata, graphs, ends, second-order logic, and reachability problems"@Muller,D.E.@Schupp,P.E. S@13@1981@55-61@@@"Fast programs for initial segments and polynomial time computation in weak models of arithmetic"@Joseph,D.@Young,P. S@13@1981@62-69@@@"Localized search in sorted lists"@Kosaraju,S.R. S@13@1981@70-79@@@"Convex decompositions of polyhedra"@Chazelle,B.M. S@13@1981@80-89@@@"Digital straightness and convexity"@Kim,C.E.@Rosenfeld,A. S@13@1981@90-95@@@"A linear probing sort and its analysis")@Gonnet,G.H.@Munro,J.I. S@13@1981@96-105@@@"Lower bounds for the cycle detection problem"@Fich,F.E. S@13@1981@106-113@@@"Time-space-optimal string matching"@Galil,Z.@Seiferas,J. S@13@1981@114-122@@@"A data structure for dynamic trees"@Sleator,D.D.@Tarjan,R.E. S@13@1981@123-127@@@"On the parallel computation for the knapsack problem"@Yao,A.C.-C. S@13@1981@128-132@@@"A difference in efficiency between synchronous and asynchronous systems"@Arjomandi,E.@Fischer,M.J.@Lynch,N.A. S@13@1981@133-145@@@"Distributed algorithms for synchronizing interprocess communication within real time"@Reif,J.@Spirakis,P. S@13@1981@146-157@@@"Reversal complexity of counter machines"@Chan,T.-H. S@13@1981@158-167@@@"Space-bounded probabilistic Turing machine complexity classes are closed under complement"@Simon,J. S@13@1981@168-176@@@"A characterization of the class of functions computable in polynomial time on random access machines"@Bertoni,A.@Mauri,G.@Sabadini,N. S@13@1981@177-188@@@"Fooling a two-way automaton or one pushdown store is better than one counter for two way machines"@Duris,P.@Galil,Z. S@13@1981@189-201@@@"Measures of parallelism in alternating computation trees"@King,K.N. S@13@1981@202-206@@@"LALR(k) testing is PSPACE-complete"@Ukkonen,E.@Soisalon-Soininen,E. S@13@1981@207-217@@@"Bandwidth constrained NP-complete problems"@Monien,B.@Sudborough,I.H. S@13@1981@218-227@@@"The complexity of dynamic languages and dynamic optimization problems"@Orlin,J.B. S@13@1981@228-237@@@"Low level complexity for combinatorial games"@Adachi,A.@Iwata,S.@Kasai,T. S@13@1981@238-246@@@"An algorithm for the general Petri net reachability problem"@Mayr,E.W. S@13@1981@247-262@@@"An efficient general purpose parallel computer"@Galil,Z.@Paul,W.J. S@13@1981@263-277@@@"Universal schemes for parallel communication"@Valiant,L.G.@Brebner,G.J. S@13@1981@278-292@@@"New layouts for the shuffle-exchange graph"@Kleitman,D.@Leighton,F.T.@Lepley,M.@Miller,G.L. S@13@1981@293-299@@@"Bounds on minimax edge length for complete binary trees"@Paterson,M.S.@Ruzzo,W.L.@Snyder,L. S@13@1981@300-307@@@"Lower bounds for VLSI"@Lipton,R.J.@Sedgewick,R. S@13@1981@308-311@@@"The entropic limitations on VLSI computations"@Yao,A.C. S@13@1981@312-317@@@"Optimal wiring between rectangles"@Dolev,D.@Karplus,K.@Siegel,A.@Strong,A.@Ullman,J.D. S@13@1981@318-325@@@"A model of computation for VLSI with related complexity results"@Chazelle,B.@Monier,L. S@13@1981@326-333@@@"I/O complexity: The red-blue pebble game"@Hong,J.-W.@Kung,H.T. S@13@1981@334-341@@@"Graphs that are almost binary trees"@Hong,J.-W.@Rosenberg,A.L. S@13@1981@342-354@@@"Embedded implicational dependencies and their inference problem"@Chandra,A.K.@Lewis,H.R.@Makowsky,J.A. S@13@1981@355-362@@@"Properties of acyclic database schemes"@Beeri,C.@Fagin,R.@Maier,D.@Mendelzon,A.@Ullman,J.D.@Yannakakis,M. S@13@1981@363-367@@@"Issues of correctness in database concurrency control by locking"@Yannakakis,M. S@13@1981@368-374@@@"On the faithful regular extensions of iterative algebras"@Parisi-Presicce,F. S@13@1981@375-383@@@"Propositional dynamic logic of looping and converse"@Streett,R.B. S@13@1981@384-390@@@"Equations between regular terms and an application to process logic"@Chandra,A.@Halpern,J.@Meyer,A.@Parikh,R. F@22@1981@1-12@@@"New lower bound techniques for VLSI"@Leighton,F.T. F@22@1981@13-22@@@"Census functions: An approach to VLSI upper bounds"@Lipton,R.J.@Valdes,J. F@22@1981@23-36@@@"Optimizing synchronous systems"@Leiserson,C.E.@Saxe,J.B. F@22@1981@37-44@@@"On relations between input and communication/Computation in VLSI"@Kedem,Z.M.@Zorat,A. F@22@1981@45-52@@@"Two-way counter machines and Diophantine equations"@Gurari,E.M.@Ibarra,O.H. F@22@1981@53-57@@@"A time-space tradeoff for language recognition"@Duris,P.@Galil,Z. F@22@1981@58-67@@@"Simulations among multidimensional Turing machines"@Loui,M.C. F@22@1981@68-73@@@"On heads versus tapes"@Paul,W. F@22@1981@74-81@@@"On the equivalence and containment problems for unambiguous regular expressions, grammars, and automata"@Stearns,R.E.@Hunt,H.B.,III F@22@1981@82-90@@@"On the asymptotic complexity of matrix multiplication"@Coppersmith,D.@Winograd,S. F@22@1981@91-94@@@"On the direct sum conjecture"@Feig,E.@Winograd,S. F@22@1981@95-100@@@"Computation of algebraic functions with root extractions"@Ja'Ja',J. F@22@1981@101-108@@@"An $ OMEGA (N sup 4/3 ) $ lower bound on the monotone network complexity of N-TH degree convolution"@Blum,N. F@22@1981@109-114@@@"Non-existence of one-dimensional expanding graphs"@Klawe,M. F@22@1981@115-122@@@"A minimum spanning ellipse algorithm"@Post,M.J. F@22@1981@123-126@@@"A direct dynamic solution to range search and related problems for product regions"@Aviad,Z.@Shamir,E. F@22@1981@127-132@@@"Deletion algorithms for hashing that preserve randomness"@Vitter,J.S. F@22@1981@133-139@@@"Implicit data structures for the weighted dictionary problem"@Frederickson,G.N. F@22@1981@140-149@@@"Possible futures, acceptances, refusals, and communication processes"@Rounds,W.C.@Brookes,S.D. F@22@1981@150-158@@@"Symmetry breaking in distributive networks"@Itai,A.@Rodeh,M. F@22@1981@159-168@@@"Unanimity in an unknown and unreliable environment"@Dolev,D. F@22@1981@169-174@@@"Symmetry in systems of asynchronous processes"@Burns,J.E. F@22@1981@175-184@@@"A model of concurrent database transactions"@Sethi,R. F@22@1981@185-197@@@"The complexity of distributed concurrency control"@Kanellakis,P.C.@Papadimitriou,C.H. F@22@1981@198-202@@@"Global decision problems for relational databases"@Vardi,M.Y. F@22@1981@203-211@@@"Optimizing conjunctive queries when attribute domains are not disjoint"@Johnson,D.S.@Klug,A. F@22@1981@212-219@@@"A fast probabilistic parallel sorting algorithm"@Reischuk,R. F@22@1981@220-227@@@"The effect of number of Hamiltonian paths on the complexity of a vertex-coloring problem"@Manber,U.@Tompa,M. F@22@1981@228-234@@@"Time-space trade-offs for general recursion"@Verbeek,R. F@22@1981@235-243@@@"Towards separating nondeterministic time from deterministic time"@Kannan,R. F@22@1981@244-253@@@"A complexity theory based on Boolean algebra"@Skyum,S.@Valiant,L.G. F@22@1981@254-259@@@"Relativizing time and space"@Book,R.V.@Wilson,C.B.@Xu,M.-R. F@22@1981@260-270@@@"Parity, circuits, and the polynomial-time hierarchy"@Furst,M.@Saxe,J.B.@Sipser,M. F@22@1981@271-278@@@"On the number of P-isomorphism classes of NP-complete sets"@Mahaney,S.R. F@22@1981@279-282@@@"Number theoretic functions computable by polymorphic programs"@Statman,R. F@22@1981@283-295@@@"The power of parallelism for automatic program synthesis"@Smith,C.H. F@22@1981@296-303@@@"On the relation between descriptional complexity and algorithmic probability"@Gacs,P. F@22@1981@304-309@@@"A circuit-size lower bound"@Kannan,R. F@22@1981@310-321@@@"Propositional dynamic logic of context-free programs"@Harel,D.@Pnueli,A.@Stavi,J. F@22@1981@322-334@@@"The propositional dynamic logic of deterministic, well-structured programs"@Halpern,J.Y.@Reif,J.H. F@22@1981@335-339@@@"Unbounded program memory adds to the expressive power of first-order dynamic logic"@Tiuryn,J. F@22@1981@340-348@@@"Temporal logic can be more expressive"@Wolper,P. F@22@1981@350-357@@@"On the security of public key protocols"@Dolev,D.@Yao,A.C. F@22@1981@358-363@@@"Worst-case ratios for planar graphs and the method of induction on faces"@Papadimitriou,C.H.@Yannakakis,M. F@22@1981@364-375@@@"Maximum matchings in sparse random graphs"@Karp,R.M.@Sipser,M. F@22@1981@376-385@@@"The complexity of searching a graph"@Megiddo,N.@Hakimi,S.L.@Garey,M.R.@Johnson,D.S.@Papadimitriou,C.H. F@22@1981@386-393@@@"A complexity calculus for classes of recursive search programs over tree structures"@Flajolet,P.@Steyaert,J.-M. F@22@1981@394-408@@@"Probabilistic algorithms in finite fields"@Ben-Or,M. F@22@1981@409-418@@@"Irreducibility testing and factorization of polynomials"@Adleman,L.M.@Odlyzko,A.M. F@22@1981@421-427@@@"A decidable MU-calculus"@Pratt,V.R. S@14@1982@1-7@@@"Two tapes are better than one for nondeterministic machines"@Duris,P.@Galil,Z. S@14@1982@8-16@@@"The tight deterministic time hierarchy"@Furer,M. S@14@1982@17-26@@@"Probabilistic simulations"@Pippenger,N. S@14@1982@27-36@@@"Real-time simulation of multicounters by oblivious one-tape Turing machines"@Vitanyi,P.M.B. S@14@1982@37-46@@@"Two-dimensional alternating Turing machines"@Inoue,K.@Takanami,I.@Taniguchi,H. S@14@1982@47-59@@@"Ensembles reconnaissables de mots biinfinis"@Nivat,M.@Perrin,D. S@14@1982@60-65@@@"Trees, automata, and games"@Gurevich,Y.@Harrington,L. S@14@1982@66-76@@@"The theory of signature testing for VLSI"@Carter,J.L. S@14@1982@77-84@@@"How to assemble tree machines"@Bhatt,S.N.@Leiserson,C.E. S@14@1982@85-98@@@"A layout strategy for VLSI which is provably good"@Leighton,F.T. S@14@1982@99-104@@@"Measuring energy consumption in VLSI circuits: A foundation"@Kissin,G. S@14@1982@105-113@@@"How to reuse a `write-once' memory"@Rivest,R.L.@Shamir,A. S@14@1982@114-121@@@"Maintaining dense sequential files in a dynamic environment"@Willard,D.E. S@14@1982@122-127@@@"Maintaining order in a linked list"@Dietz,P.F. S@14@1982@128-136@@@"Space-time tradeoff for answering range queries"@Yao,A.C. S@14@1982@137-146@@@"The complexity of relational query languages"@Vardi,M.Y. S@14@1982@147-152@@@"Relational queries computable in polynomial time"@Immerman,N. S@14@1982@153-158@@@"Denotational semantics of concurrency"@DeBakker,J.W.@Zucker,J.I. S@14@1982@159-168@@@"The complexity of propositional linear temporal logics"@Sistla,A.P.@Clarke,E.M. S@14@1982@169-180@@@"Decision procedures and expressiveness in the temporal logic of branching time"@Emerson,E.A.@Halpern,J.Y. S@14@1982@181-195@@@"A probabilistic dynamic logic"@Feldman,Y.A.@Harel,D. S@14@1982@196-200@@@"Communication complexity"@Papadimitriou,C.H.@Sipser,M. S@14@1982@201-214@@@"Symmetric complementation"@Reif,J.H. S@14@1982@215-223@@@"Space-bounded hierarchies and probabilistic computations"@Ruzzo,W.L.@Simon,J.@Tompa,M. S@14@1982@224-230@@@"On the random oracle hypothesis"@Kurtz,S.A. S@14@1982@231-233@@@"Bounds on the time for parallel RAM's to compute simple functions"@Cook,S.@Dwork,C. S@14@1982@234-244@@@"Probabilistic, nondeterministic, and alternating decision trees"@Manber,U.@Tompa,M. S@14@1982@245-254@@@"Edge-deletion and edge-contraction problems"@Asano,Takao@Hirata,T. S@14@1982@255-260@@@"The complexity of facets (and some facets of complexity)"@Papadimitriou,C.H.@Yannakakis,M. S@14@1982@261-266@@@"A polynomial reduction from multivariate to bivariate integral polynomial factorization"@Kaltofen,E. S@14@1982@267-281@@@"Decidability of reachability in vector addition systems"@Kosaraju,S.R. S@14@1982@282-289@@@"Finding extremal polygons"@Boyce,J.E.@Dobkin,D.P.@Drysdale,R.L.,III@Guibas,L.J. S@14@1982@290-295@@@"Fast algorithms under the extended Riemann hypothesis: A concrete estimate"@Bach,E. S@14@1982@296-302@@@"Notes on merging networks"@Hong,Z.@Sedgewick,R. S@14@1982@303-309@@@"On approximating a vertex cover for planar graphs"@Bar-Yehuda,R.@Even,S. S@14@1982@310-324@@@"Isomorphism of graphs with bounded eigenvalue multiplicity"@Babai,L.@Grigoryev,D.Yu.@Mount,D.M. S@14@1982@325-329@@@"A new approximate graph coloring algorithm"@Wigderson,A. S@14@1982@330-337@@@"Las Vegas is better than determinism in VLSI and distributed computing"@Mehlhorn,K.@Schmidt,E.M. S@14@1982@338-344@@@"Routing, merging and sorting on parallel models of computation"@Borodin,A.@Hopcroft,J.E. S@14@1982@345-353@@@"Graph problems on a mesh-connected processor array"@Atallah,M.J.@Kosaraju,S.R. S@14@1982@354-364@@@"On the time complexity of broadcast communication schemes"@Greenberg,A.G. S@14@1982@365-377@@@"Probabilistic encryption & how to play mental poker keeping secret all partial information"@Goldwasser,S.@Micali,S. S@14@1982@378-382@@@"A technique for proving lower bounds for distributed maximum-finding algorithms"@Pachl,J.@Korach,E.@Rotem,D. S@14@1982@383-400@@@"Cryptographic protocols"@DeMillo,R.A.@Lynch,N.A.@Merritt,M.J. S@14@1982@401-407@@@"Polynomial algorithms for multiple processor agreement"@Dolev,D.@Strong,H.R. F@23@1982@1-13@@@"A complexity theory for unbounded fan-in parallelism"@Chandra,A.K.@Stockmeyer,L.J.@Vishkin,U. F@23@1982@14-20@@@"On the complexity of unique solutions"@Papadimitriou,C.H. F@23@1982@21-31@@@"Deciding the inequivalence of context-free grammars with 1-letter terminal alphabet is $SIGMA sub 2 sup P$-complete"@Huynh,T.-D. F@23@1982@32-39@@@"The computational complexity of simultaneous Diophantine approximation problems"@Lagarias,J.C. F@23@1982@40-44@@@"A natural encoding scheme proved probabilistic polynomial complete"@Vazirani,U.V.@Vazirani,V.V. F@23@1982@45-52@@@"Three applications of Kolmogorov-complexity"@Reisch,S.@Schnitger,G. F@23@1982@53-56@@@"On-line simulation of $k+1$ tapes by $k$ tapes requires nonlinear time"@Paul,W. F@23@1982@57-64@@@"A polynomial-time reduction from bivariate to univariate integral polynomial factorization"@Kaltofen,E. F@23@1982@65-71@@@"Fast parallel matrix and GCD computations"@Borodin,A.@VonzurGathen,J.@Hopcroft,J. F@23@1982@72-79@@@"Generalised symmetries of polynomials in algebraic complexity"@Sturtivant,C. F@23@1982@80-91@@@"Theory and applications of trapdoor functions"@Yao,A.C. F@23@1982@92-99@@@"An application of number theory to the organization of raster-graphics memory"@Chor,B.@Leiserson,C.E.@Rivest,R.L. F@23@1982@100-106@@@"An application of higher reciprocity to computational number theory"@Adleman,L.M.@McDonnell,R. F@23@1982@107-111@@@"Probabilistic analysis of some bin-packing problems"@Karmarkar,N. F@23@1982@112-117@@@"How to generate cryptographically strong sequences of pseudo random bits"@Blum,M.@Micali,S. F@23@1982@118-125@@@"An $ O(n sup 3 log~n) $ deterministic and an $ O(n sup 3 ) $ probabilistic isomorphism test for trivalent graphs"@Galil,Z.@Hoffmann,C.M.@Luks,E.M.@Schnorr,C.P.@Weber,A. F@23@1982@126-133@@@"A compact representation for permutation groups"@Jerrum,M. F@23@1982@134-144@@@"Why and how to establish a private code on a public network"@Goldwasser,S.@Micali,S.@Tong,P. F@23@1982@145-152@@@"A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem"@Shamir,A. F@23@1982@153-159@@@"Inferring a sequence generated by a linear congruence"@Plumstead,J.B. F@23@1982@160-164@@@"Protocols for secure computations"@Yao,A.C. F@23@1982@165-169@@@"Storing a sparse table with $O(1)$ worst case access time"@Fredman,M.L.@Komlos,J.@Szemeredi,E. F@23@1982@170-175@@@"On the program size of perfect and universal hash functions"@Mehlhorn,K. F@23@1982@176-185@@@"On decomposition of relational databases"@Vardi,M.Y. F@23@1982@186-195@@@"Generic transformation of data structures"@O'Dunlaing,C.@Yap,C.K. F@23@1982@196-203@@@"`Eventual' is earlier than `Immediate'"@Dolev,D.@Reischuk,R.@Strong,H.R. F@23@1982@204-216@@@"Deterministic process logic is elementary"@Halpern,J.Y. F@23@1982@217-225@@@"A temporal logic to deal with fairness in transition systems"@Queille,J.P.@Sifakis,J. F@23@1982@226-235@@@"On equations including string variables"@Iwama,K. F@23@1982@236-243@@@"Substitution of bounded rational cone"@Beauquier,J.@Latteux,M. F@23@1982@244-254@@@"Parallel algorithms for minimum cuts and maximum flows in planar networks"@Johnson,D.B.@Venkatesan,S.M. F@23@1982@255-261@@@"Priority queues with variable priority and an $O(EV log V)$ algorithm for finding a maximal weighted matching in general graphs"@Galil,Z.@Micali,S.@Gabow,H. F@23@1982@262-271@@@"Polynomial time algorithms for the min cut problem on degree restricted trees"@Chung,M.-J.@Makedon,F.@Sudborough,I.H.@Turner,J. F@23@1982@272-279@@@"Using clerks in parallel processing"@Stout,Q.F. F@23@1982@280-289@@@"On the movement of robot arms in 2-dimensional bounded regions"@Hopcroft,J.@Joseph,D.@Whitesides,S. F@23@1982@290-296@@@"Parallel time $O( log N)$ acceptance of deterministic CFLs"@Reif,J. F@23@1982@297-311@@@"Wafer-scale integration of systolic arrays"@Leighton,F.T.@Leiserson,C.E. F@23@1982@312-320@@@"An efficient approximation scheme for the one-dimensional bin-packing problem"@Karmarkar,N.@Karp,R.M. F@23@1982@321-326@@@"The ellipsoid algorithm for linear inequalities in exact arithmetic"@Ursic,S. F@23@1982@327-328@@@"An old linear programming algorithm runs in polynomial time"@Yamnitsky,B.@Levin,L. F@23@1982@329-338@@@"Linear-time algorithms for linear programming in $ R sup 3 $ and related problems"@Megiddo,N. F@23@1982@339-349@@@"A theorem on polygon cutting with applications"@Chazelle,B. F@23@1982@350-357@@@"Three layers are enough"@Preparata,F.P.@Lipski,W.,Jr. F@23@1982@358-368@@@"The complexity of compacting hierarchically specified layouts of integrated circuits"@Lengauer,T. F@23@1982@369-378@@@"On driving many long lines in a VLSI layout"@Ramachandran,V. F@23@1982@379-385@@@"Optimal allocation of computational resources in VLSI"@Kedem,Z.M. S@15@1983@1-9@@@"An $O(n log n)$ sorting network"@Ajtai,M.@Komlos,J.@Szemeredi,E. S@15@1983@10-16@@@"A logarithmic time sort for linear size networks"@Reif,J.H.@Valiant,L.G. S@15@1983@17-23@@@"Parallel algorithms for algebraic problems"@VonzurGathen,J. S@15@1983@24-31@@@"Topological matching"@Stout,Q.F. S@15@1983@32-41@@@"Reliable computation with cellular automata"@Gacs,P. S@15@1983@42-51@@@"Superconcentrators, generalizers and generalized connectors with limited depth"@Dolev,D.@Dwork,C.@Pippenger,N.@Wigderson,A. S@15@1983@52-60@@@"Unbounded fan-in circuits and associative functions"@Chandra,A.K.@Fortune,S.@Lipton,R. S@15@1983@61-69@@@"Borel sets and circuit complexity"@Sipser,M. S@15@1983@70-79@@@"A polynomial linear search algorithm for the N-dimensional knapsack problem"@MeyeraufderHeide,F. S@15@1983@80-86@@@"Lower bounds for algebraic computation trees"@Ben-Or,M. S@15@1983@87-93@@@"Bounds for width two branching programs"@Borodin,A.@Dolev,D.@Fich,F.E.@Paul,W. S@15@1983@94-99@@@"Multi-party protocols"@Chandra,A.K.@Furst,M.L.@Lipton,R.J. S@15@1983@100-109@@@"New bounds for parallel prefix circuits"@Fich,F.E. S@15@1983@110-117@@@"Exponential lower bounds for restricted monotone circuits"@Valiant,L.G. S@15@1983@118-126@@@"The complexity of approximate counting"@Stockmeyer,L. S@15@1983@127-132@@@"Two nonlinear lower bounds"@Duris,P.@Galil,Z.@Paul,W.@Reischuk,R. S@15@1983@133-139@@@"On notions of information transfer in VLSI circuits"@Aho,A.V.@Ullman,J.D.@Yannakakis,M. S@15@1983@140-151@@@"Solvability by radicals is in polynomial time"@Landau,S.@Miller,G.L. S@15@1983@152-160@@@"On the diameter of permutation groups"@Driscoll,J.R.@Furst,M.L. S@15@1983@161-170@@@"Normal forms for trivalent graphs and graphs of bounded valence"@Furer,M.@Schnyder,W.@Specker,E. S@15@1983@171-183@@@"Canonical labeling of graphs"@Babai,L.@Luks,E.M. S@15@1983@184-188@@@"How to generate random integers with known factorization"@Bach,E. S@15@1983@189-192@@@"Factoring multivariate polynomials over finite fields"@Lenstra,A.K. S@15@1983@193-206@@@"Improved algorithms for integer programming and related lattice problems"@Kannan,R. S@15@1983@207-220@@@"Retraction: A new approach to motion-planning"@O'Dunlaing,C.@Sharir,M.@Yap,C.K. S@15@1983@221-234@@@"Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams"@Guibas,L.J.@Stolfi,J. S@15@1983@235-245@@@"Self-adjusting binary trees"@Sleator,D.D.@Tarjan,R.E. S@15@1983@246-251@@@"A linear-time algorithm for a special case of disjoint set union"@Gabow,H.N.@Tarjan,R.E. S@15@1983@252-257@@@"Data structures for on-line updating of minimum spanning trees"@Frederickson,G.N. S@15@1983@258-263@@@"A 3-space partition and its applications"@Yao,F.F. S@15@1983@264-277@@@"Unary inclusion dependencies have polynomial time inference problems"@Kanellakis,P.C.@Cosmadakis,S.S.@Vardi,M.Y. S@15@1983@278-290@@@"On the extremely fair treatment of probabilistic algorithms"@Pnueli,A. S@15@1983@291-297@@@"A probabilistic PDL"@Kozen,D. S@15@1983@298-309@@@"A decidable propositional probabilistic dynamic logic"@Feldman,Y.A. S@15@1983@310-319@@@"A logic to reason about likelihood"@Halpern,J.Y.@Rabin,M.O. S@15@1983@320-329@@@"A characterization of Hoare's logic for programs with Pascal-like procedures"@Olderog,E.-R. S@15@1983@330-335@@@"A complexity theoretic approach to randomness"@Sipser,M. S@15@1983@336-343@@@"Speedups of deterministic machines by synchronous parallel machines"@Dymond,P.W.@Tompa,M. S@15@1983@344-346@@@"Alternation and the power of nondeterminism"@Kannan,R. S@15@1983@347-354@@@"Languages which capture complexity classes"@Immerman,N. S@15@1983@355-364@@@"The random access hierarchy"@Myers,D. S@15@1983@365-373@@@"Iterated pushdown automata and complexity classes"@Engelfriet,J. S@15@1983@374-381@@@"Unique decomposability of shuffled strings: A formal treatment of asynchronous time-multiplexed communication"@Iwama,K. S@15@1983@382-391@@@"Sparse sets in NP$-$P: EXPTIME versus NEXPTIME"@Hartmanis,J.@Sewelson,V.@Immerman,N. S@15@1983@392-401@@@"Some structural properties of polynomial reducibilities and sets in NP"@Young,P. S@15@1983@402-412@@@"On breaking generalized knapsack public key cryptosystems"@Adleman,L.M. S@15@1983@413-420@@@"How discreet is the discrete log?"@Long,D.L.@Wigderson,A. S@15@1983@421-430@@@"On the cryptographic security of single RSA bits"@Ben-Or,M.@Chor,B.@Shamir,A. S@15@1983@431-439@@@"Strong signature schemes"@Goldwasser,S.@Micali,S.@Yao,A. S@15@1983@440-447@@@"How to exchange (secret) keys"@Blum,M. S@15@1983@448-456@@@"An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems"@Gabow,H.N. S@15@1983@457-466@@@"Transitive orientation in $ O(n sup 2 ) $ time"@Spinrad,J. S@15@1983@467-476@@@"Probabilistic analysis of bandwidth minimization algorithms"@Turner,J. S@15@1983@477-486@@@"An approximation algorithm for Manhattan routing"@Baker,B.S.@Bhatt,S.N.@Leighton,F.T. F@24@1983@1-10@@@"Solving low-density subset sum problems"@Lagarias,J.C.@Odlyzko,A.M. F@24@1983@11-22@@@"How to simultaneously exchange a secret bit by flipping a symmetrically-biased coin"@Luby,M.@Micali,S.@Rackoff,C. F@24@1983@23-30@@@"Trapdoor pseudo-random number generators, with applications to protocol design"@Vazirani,U.V.@Vazirani,V.V. F@24@1983@31-33@@@"A topological approach to evasiveness"@Kahn,J.@Saks,M.@Sturtevant,D. F@24@1983@34-39@@@"On the security of multi-party ping-pong protocols"@Even,S.@Goldreich,O. F@24@1983@40-47@@@"The program complexity of searching a table"@Mairson,H.G. F@24@1983@48-55@@@"Improved upper bounds on shellsort"@Incerpi,J.@Sedgewick,R. F@24@1983@56-64@@@"Monte-Carlo algorithms for enumeration and reliability problems"@Karp,R.M.@Luby,M. F@24@1983@65-75@@@"Optimum algorithms for two random sampling problems"@Vitter,J.S. F@24@1983@76-82@@@"Probabilistic counting"@Flajolet,P.@Martin,G.N. F@24@1983@83-91@@@"Constructing arrangements of lines and hyperplanes with applications"@Edelsbrunner,H.@O'Rourke,J.@Seidel,R. F@24@1983@92-99@@@"Dynamic computational geometry"@Atallah,M.J. F@24@1983@100-111@@@"A kinetic framework for computational geometry"@Guibas,L.@Ramshaw,L.@Stolfi,J. F@24@1983@112-121@@@"Geometric retrieval problems"@Cole,R.@Yap,C.K. F@24@1983@122-132@@@"Filtering search: A new approach to query-answering"@Chazelle,B. F@24@1983@133-137@@@"Representations of rational functions"@VonzurGathen,J. F@24@1983@138-145@@@"Logarithmic depth circuits for algebraic functions"@Reif,J. F@24@1983@146-153@@@"Trade-offs between depth and width in parallel computation"@Vishkin,U.@Wigderson,A. F@24@1983@154-161@@@"The parallel complexity of the Abelian permutation group membership problem"@McKenzie,P.@Cook,S.A. F@24@1983@162-171@@@"Computational complexity and the classification of finite simple groups"@Babai,L.@Kantor,W.M.@Luks,E.M. F@24@1983@172-179@@@"Factoring sparse multivariate polynomials"@VonzurGathen,J. F@24@1983@180-184@@@"Some relationships between logics of programs and complexity theory"@Tiuryn,J.@Urzyczyn,P. F@24@1983@185-194@@@"Reasoning about infinite computation paths"@Wolper,P.@Vardi,M.Y.@Sistla,A.P. F@24@1983@195-200@@@"Propositional game logic"@Parikh,R. F@24@1983@202-209@@@"Decision procedures for time and chance"@Kraus,S.@Lehmann,D. F@24@1983@210-214@@@"Algebras of feasible functions"@Gurevich,Y. F@24@1983@215@@@"On context-free generators (abstract only)"@Beauquier,J.@Gire,F. F@24@1983@217-225@@@"The power of geometric duality"@Chazelle,B.@Guibas,L.J.@Lee,D.T. F@24@1983@226-232@@@"Fast algorithms for the all nearest neighbors problem"@Clarkson,K.L. F@24@1983@233-241@@@"Minimum partition of polygonal regions into trapezoids"@Asano,Takao@Asano,Tetsuo F@24@1983@242-247@@@"Shortest path problems in planar graphs"@Frederickson,G.N. F@24@1983@248-257@@@"Scaling algorithms for network problems"@Gabow,H.N. F@24@1983@259-264@@@"Partition of planar flow networks"@Johnson,D.B.@Venkatesan,S.M. F@24@1983@265-273@@@"Approximation algorithms for NP-complete problems on planar graphs"@Baker,B.S. F@24@1983@274-281@@@"A polynomial algorithm for the min cut linear arrangement of trees"@Yannakakis,M. F@24@1983@282-288@@@"Tree structures for partial match retrieval"@Flajolet,P.@Puech,C. F@24@1983@289-297@@@"Bin packing with items uniformly distributed over intervals [$a,b$]"@Lueker,G.S. F@24@1983@299-303@@@"Hash functions for priority queues"@Ajtai,M.@Fredman,M.@Komlos,J. F@24@1983@304-311@@@"Lower bounds on graph threading by probabilistic machines"@Berman,P.@Simon,J. F@24@1983@312-319@@@"On the computational complexity of the permanent"@Ja'Ja',J. F@24@1983@320-322@@@"Multiplication is the easiest nontrivial arithmetic function"@Alt,H. F@24@1983@323-328@@@"On depth-reduction and grates"@Schnitger,G. F@24@1983@329-334@@@"Relativized circuit complexity"@Wilson,C.B. F@24@1983@335-342@@@"Randomness and the density of hard problems"@Wilber,R.E. F@24@1983@343-350@@@"Lower bounds on the time of probabilistic on-line simulations"@Paturi,R.@Simon,J. F@24@1983@351-359@@@"Techniques for solving graph problems in parallel environments"@Hochschild,P.H.@Mayr,E.W.@Siegel,A.R. F@24@1983@360-370@@@"An algorithm for the optimal placement and routing of a circuit within a ring of pads"@Baker,B.S.@Pinter,R.Y. F@24@1983@372-382@@@"Period-time tradeoffs for VLSI models with delay"@Aggarwal,A. F@24@1983@383-392@@@"Estimating the multiplicities of conflicts in multiple access channels"@Greenberg,A.G.@Ladner,R.E. F@24@1983@393-402@@@"On the minimal synchronism needed for distributed consensus"@Dolev,D.@Dwork,C.@Stockmeyer,L. F@24@1983@403-409@@@"Randomized Byzantine generals"@Rabin,M.O. F@24@1983@410-419@@@"A tight bound for black and white pebbles on the pyramid"@Klawe,M.M. F@24@1983@420-428@@@"Lower bounds by probabilistic arguments"@Yao,A.C. F@24@1983@429-438@@@"On determinism versus non-determinism and related problems"@Paul,W.J.@Pippenger,N.@Szemeredi,E.@Trotter,W.T. F@24@1983@439-445@@@"Generalized Kolmogorov complexity and the structure of feasible computations"@Hartmanis,J. F@24@1983@446-450@@@"Games against nature"@Papadimitriou,C.H. F@24@1983@453-459@@@"Global wire routing in two-dimensional arrays"@Karp,R.M.@Leighton,F.T.@Rivest,R.L.@Thompson,C.D.@Vazirani,U.@Vazirani,V. F@24@1983@460-469@@@"Reasoning about functional programs and complexity classes associated with type disciplines"@Leivant,D. F@24@1983@470-472@@@"Legal coloring of graphs"@Linial,N. F@24@1983@473-475@@@"Information bounds are good for search problems on ordered data structures"@Linial,N.@Saks,M.E. S@16@1984@1-13@@@"Probabilistic temporal logics for finite and bounded models"@Hart,S.@Sharir,M. S@16@1984@14-24@@@"Deciding branching time logic"@Emerson,E.A.@Sistla,A.P. S@16@1984@25-30@@@"Modelling fair processes"@Hennessy,M. S@16@1984@31-38@@@"Liveness properties as convergence in metric spaces"@Degano,P.@Montanari,U. S@16@1984@39-50@@@"Transition logic"@Gerth,R. S@16@1984@51-63@@@"Now you may compose temporal logic specifications"@Barringer,H.@Kuiper,R.@Pnueli,A. S@16@1984@64-70@@@"A minimum area VLSI network for $O( log n)$ time sorting"@Bilardi,G.@Preparata,F.P. S@16@1984@71-80@@@"Tight bounds on the complexity of parallel sorting"@Leighton,T. S@16@1984@81-91@@@"Lower bounds on communication complexity"@Duris,P.@Galil,Z.@Schnitger,G. S@16@1984@92-97@@@"An area-maximum edge length tradeoff for VLSI layout"@Blum,N. S@16@1984@98-100@@@"On the pagenumber of planar graphs"@Buss,J.F.@Shor,P.W. S@16@1984@101-107@@@"Channel routing in VLSI"@Mirzaian,A. S@16@1984@108-116@@@"Minimum spanning ellipsoids"@Post,M.J. S@16@1984@117-124@@@"Digital disks and a digital compactness measure"@Kim,C.E.@Anderson,T.A. S@16@1984@125-134@@@"Intersecting is easier than sorting"@Chazelle,B. S@16@1984@135-143@@@"Scaling and related techniques for geometry problems"@Gabow,H.N.@Bentley,J.L.@Tarjan,R.E. S@16@1984@144-153@@@"On shortest paths in polyhedral spaces"@Sharir,M.@Schorr,A. S@16@1984@154-166@@@"On $k$-hulls and related problems"@Cole,R.@Sharir,M.@Yap,C.K. S@16@1984@167-174@@@"An algorithm for constructing regions with rectangles: Independence and minimum generating sets for collections of intervals"@Franzblau,D.S.@Kleitman,D.J. S@16@1984@175-182@@@"Factorization of polynomials over finite fields and factorization of primes in algebraic number fields"@Huang,M.-D.A. S@16@1984@183-190@@@"Sums of divisors, perfect numbers, and factoring"@Bach,E.@Miller,G.@Shallit,J. S@16@1984@191-200@@@"Polynomial factorization and nonrandomness of bits of algebraic and some transcendental numbers"@Kannan,R.@Lenstra,A.K.@Lovasz,L. S@16@1984@201-207@@@"Evaluating logarithms in $ GF(2 sup n ) $"@Coppersmith,D. S@16@1984@208-216@@@"An efficient signature scheme based on quadratic equations"@Ong,H.@Schnorr,C.P.@Shamir,A. S@16@1984@217-224@@@"Communication with secrecy constraints"@Orlitsky,A.@ElGamal,A. S@16@1984@225-229@@@"Correcting faults in write-once memory"@Dolev,D.@Maier,D.@Mairson,H.@Ullman,J. S@16@1984@230-239@@@"Randomized speed-ups in parallel computation"@Vishkin,U. S@16@1984@240-248@@@"Optimal parallel algorithms for string matching"@Galil,Z. S@16@1984@249-257@@@"Finding Euler circuits in logarithmic parallel time"@Awerbuch,B.@Israeli,A.@Shiloach,Y. S@16@1984@258-265@@@"A probabilistic relation between desirable and feasible models of parallel computation"@Upfal,E. S@16@1984@266-272@@@"A fast parallel algorithm for the maximal independent set problem"@Karp,R.M.@Wigderson,A. S@16@1984@273-278@@@"On maintaining dynamic information in a concurrent environment"@Manber,U. S@16@1984@279-288@@@"Some unexpected expected behavior results for bin packing"@Bentley,J.L.@Johnson,D.S.@Leighton,F.T.@McGeoch,C.C.@McGeoch,L.A. S@16@1984@289-298@@@"A probabilistic analysis of multidimensional bin packing problems"@Karp,R.M.@Luby,M.@Marchetti-Spaccamela,A. S@16@1984@299-301@@@"Every poset has a good comparison"@Kahn,J.@Saks,M. S@16@1984@302-311@@@"A new polynomial-time algorithm for linear programming"@Karmarkar,N. S@16@1984@312-323@@@"A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension"@Adler,I.@Megiddo,N. S@16@1984@324-333@@@"Powers of graphs: A powerful approximation technique for bottleneck problems"@Hochbaum,D.S.@Shmoys,D.B. S@16@1984@334-341@@@"Determining equivalence of expressions in random polynomial time"@Gonnet,G.H. S@16@1984@342-348@@@"Fast expected-time and approximation algorithms for geometric minimum spanning trees"@Clarkson,K.L. S@16@1984@349-358@@@"Building a complete inverted file for a set of text files in linear time"@Blumer,A.@Blumer,J.@Ehrenfeucht,A.@Haussler,D.@McConnell,R. S@16@1984@359-368@@@"On finding the exact solution of a zero-one knapsack problem"@Goldberg,A.V.@Marchetti-Spaccamela,A. S@16@1984@369-375@@@"Average case selection"@Cunto,W.@Munro,J.I. S@16@1984@376-382@@@"Finding small simple cycle separators for 2-connected planar graphs"@Miller,G.L. S@16@1984@383-390@@@"Data structures for on-line updating of matroid intersection solutions"@Frederickson,G.N.@Srinivas,M.A. S@16@1984@391-400@@@"On tape versus core; an application of space efficient perfect hash functions to the invariance of space"@Slot,C.@VanEmdeBoas,P. S@16@1984@401-408@@@"Quadratic lower bounds for deterministic and nondeterministic one-tape Turing machines"@Maass,W. S@16@1984@409-417@@@"Uniform definability on finite structures with successor"@DeRougemont,M. S@16@1984@418-427@@@"A general result on infinite trees and its applications"@Harel,D. S@16@1984@428-435@@@"Pebblings, edgings, and equational logic"@Kozen,D. S@16@1984@436-445@@@"A theory of the learnable"@Valiant,L.G. S@16@1984@446-456@@@"Automata theoretic techniques for modal logics of programs"@Vardi,M.Y.@Wolper,P. S@16@1984@457-464@@@"The complexity of elementary algebra and geometry"@Ben-Or,M.@Kozen,D.@Reif,J. S@16@1984@465@@@"Problems, complete in `average' instance"@Levin,L.A. S@16@1984@466-470@@@"Comparison of arithmetic functions with respect to Boolean circuit depth"@Alt,H. S@16@1984@471-474@@@"A theorem on probabilistic constant depth computations"@Ajtai,M.@Ben-Or,M. S@16@1984@475-479@@@"Threshold functions and bounded depth monotone circuits"@Boppana,R.B. S@16@1984@480-487@@@"On monotone formulae with restricted depth"@Klawe,M.@Paul,W.J.@Pippenger,N.@Yannakakis,M. S@16@1984@488-492@@@"Amortized efficiency of list update rules"@Sleator,D.D.@Tarjan,R.E. S@16@1984@493-503@@@"The impact of synchronous communication on the problem of electing a leader in a ring"@Frederickson,G.N.@Lynch,N.A. S@16@1984@504-511@@@"On the possibility and impossibility of achieving clock synchronization"@Dolev,D.@Halpern,J.@Strong,R. S@16@1984@512-521@@@"Log-logarithmic protocols for resolving ethernet and semaphore conflicts"@Willard,D.E. S@16@1984@522-525@@@"An efficient network synchronization protocol"@Awerbuch,B. S@16@1984@526-535@@@"A new look at fault tolerant network routing"@Dolev,D.@Halpern,J.@Simons,B.@Strong,R. S@16@1984@536-541@@@"Efficient fault tolerant routings in networks"@Broder,A.@Dolev,D.@Fischer,M.@Simons,B. S@16@1984@542-547@@@"Distributed elections in an Archimedean ring of processors"@Vitanyi,P.M.B. F@25@1984@1-6@@@"Log depth circuits for division and related problems"@Beame,P.W.@Cook,S.A.@Hoover,H.J. F@25@1984@7-11@@@"Sublinear parallel algorithm for computing the greatest common divisor of two integers"@Kannan,R.@Miller,G.@Rudolph,L. F@25@1984@12-20@@@"Finding biconnected components and computing tree functions in logarithmic parallel time"@Tarjan,R.E.@Vishkin,U. F@25@1984@21-30@@@"Very fast parallel matrix and polynomial arithmetic"@Eberly,W. F@25@1984@31-36@@@"Parallel powering"@VonzurGathen,J. F@25@1984@37-45@@@"Polymorphic arrays: A novel VLSI layout for systolic computers"@Fiat,A.@Shamir,A. F@25@1984@46-55@@@"Designing systolic algorithms using sequential machines"@Ibarra,O.H.@Palis,M.A.@Kim,S.M. F@25@1984@56-64@@@"On the limits to speed up parallel machines by large hardware and unbounded communication"@MeyeraufderHeide,F.@Reischuk,R. F@25@1984@65-73@@@"River routing every which way, but loose"@Cole,R.@Siegel,A. F@25@1984@74-83@@@"Embedding planar graphs in seven pages"@Heath,L. F@25@1984@84-88@@@"A communication-time tradeoff"@Papadimitriou,C.H.@Ullman,J.D. F@25@1984@89-99@@@"A comparative study of X-tree, pyramid and related machines"@Aggarwal,A. F@25@1984@100-108@@@"Interactive data comparison"@ElGamal,A.@Orlitsky,A. F@25@1984@109-117@@@"Lower bounds on communication complexity in distributed computer networks"@Tiwari,P. F@25@1984@118-126@@@"Probabilistic communication complexity"@Paturi,R.@Simon,J. F@25@1984@127-136@@@"Parallel communication with limited buffers"@Pippenger,N. F@25@1984@137-147@@@"The multi-tree approach to reliability in distributed networks"@Itai,A.@Rodeh,M. F@25@1984@148-156@@@"A polynomial time algorithm for fault diagnosability"@Sullivan,G. F@25@1984@157-170@@@"Flipping coins in many pockets (Byzantine agreement on uniformly random values)"@Broder,A.Z.@Dolev,D. F@25@1984@171-180@@@"How to share memory in a distributed system"@Upfal,E.@Wigderson,A. F@25@1984@181-192@@@"Graph bisection algorithms with good average case behavior"@Bui,T.@Chaudhuri,S.@Leighton,T.@Sipser,M. F@25@1984@193-200@@@"The average-case analysis of some on-line algorithms for bin packing"@Shor,P.W. F@25@1984@201-206@@@"Linear verification for spanning trees"@Komlos,J. F@25@1984@207-216@@@"An efficient algorithm to find all 'Bidirectional' edges of an undirected graph"@Mishra,B. F@25@1984@217-228@@@"An augmenting path algorithm for the parity problem on linear matroids"@Stallmann,M.@Gabow,H.N. F@25@1984@229-240@@@"On the complexity of matrix group problems I"@Babai,L.@Szemeredi,E. F@25@1984@241-250@@@"Coordinating pebble motion on graphs, the diameter of permutation groups, and applications"@Kornhauser,D.@Miller,G.@Spirakis,P. F@25@1984@251-254@@@"Mulltiplication of polynomials over the ring of integers"@Kaminski,M. F@25@1984@255-260@@@"Slowing down sorting networks to obtain faster sorting algorithms"@Cole,R. F@25@1984@261-267@@@"Evaluating rational functions: Infinite precision is finite cost and tractable on average"@Blum,L.@Shub,M. F@25@1984@268-278@@@"A model-theoretic analysis of knowledge"@Fagin,R.@Halpern,J.Y.@Vardi,M.Y. F@25@1984@279-288@@@"A semantic characterization of full abstraction for typed lambda calculi"@Mulmuley,K. F@25@1984@289-299@@@"Semantic models for second-order lambda calculus"@Mitchell,J.C. F@25@1984@300-307@@@"Minimal degrees for honest polynomial reducibilities"@Homer,S. F@25@1984@308-311@@@"Sparse oracles and uniform complexity classes"@Balcazar,J.@Book,R.@Long,T.@Schoning,U.@Selman,A. F@25@1984@313-319@@@"Nonlinearity of Davenport-Schinzel sequences and of a generalized path compression scheme"@Hart,S.@Sharir,M. F@25@1984@320-322@@@"Eigenvalues, expanders and superconcentrators"@Alon,N.@Milman,V.D. F@25@1984@323-331@@@"A lower bound for probabilistic algorithms for finite state machines"@Greenberg,A.G.@Weiss,A. F@25@1984@332-337@@@"Applications of Ramsey's theorem to decision trees complexity"@Moran,S.@Snir,M.@Manber,U. F@25@1984@338-346@@@"Fibonacci heaps and their uses in improved network optimization algorithms"@Fredman,M.L.@Tarjan,R.E. F@25@1984@347-357@@@"Efficient implementation of graph algorithms using contraction"@Gabow,H.N.@Galil,Z.@Spencer,T.H. F@25@1984@358-368@@@"Computing on a free tree via complexity-preserving mappings"@Chazelle,B. F@25@1984@369-374@@@"An implicit data structure for the dictionary problem that runs in polylog time"@Munro,J.I. F@25@1984@375-386@@@"Fishspear: A priority queue algorithm"@Fischer,M.J.@Paterson,M.S. F@25@1984@387-392@@@"Space searching for intersecting objects"@Dobkin,D.P.@Edelsbrunner,H. F@25@1984@393-402@@@"Dynamic segment intersection search with applications"@Imai,H.@Asano,Takao F@25@1984@403-407@@@"A fast approximation for minimum spanning trees in $k$-dimensional space"@Vaidya,P.M. F@25@1984@408-416@@@"A polynomial solution for potato-peeling and other polygon inclusion and enclosure problems"@Chang,J.S.@Yap,C.K. F@25@1984@417-424@@@"Shortest paths in Euclidean graphs"@Sedgewick,R.@Vitter,J.S. F@25@1984@425-433@@@"Independent unbiased coin flips from a correlated biased source: A finite state Markov chain"@Blum,M. F@25@1984@434-440@@@"Generating quasi-random sequences from slightly-random sources"@Santha,M.@Vazirani,U.V. F@25@1984@441-448@@@"A `paradoxical' solution to the signature problem"@Goldwasser,S.@Micali,S.@Rivest,R.L. F@25@1984@449-457@@@"RSA/Rabin bits are $ 1/2~+~1/ roman poly ( log N) $ secure"@Alexi,W.@Chor,B.@Goldreich,O.@Schnorr,C.P. F@25@1984@458-463@@@"Efficient and secure pseudo-random number generation"@Vazirani,U.V.@Vazirani,V.V. F@25@1984@464-479@@@"How to construct random functions"@Goldreich,O.@Goldwasser,S.@Micali,S. F@25@1984@480-484@@@"Linear congruential generators do not produce random sequences"@Frieze,A.M.@Kannan,R.@Lagarias,J.C. F@25@1984@485-494@@@"A characterization of probabilistic inference"@Pitt,L. F@25@1984@495-503@@@"Complexity measures for public-key cryptosystems"@Grollmann,J.@Selman,A.L. F@25@1984@506-515@@@"Constructing $O(n^log^n)$ size monotone formulae for the $k$-th elementary symmetric polynomial of $n$ Boolean variables"@Friedman,J. S@17@1985@1-10@@@"A simple parallel algorithm for the maximal independent set problem"@Luby,M. S@17@1985@11-21@@@"The two-processor scheduling problem is in R-NC"@Vazirani,U.V.@Vazirani,V.V. S@17@1985@22-32@@@"Constructing a perfect matching is in random NC"@Karp,R.M.@Upfal,E.@Wigderson,A. S@17@1985@33-37@@@"A parallel algorithm for the maximal path problem"@Anderson,R. S@17@1985@38-47@@@"The parallel complexity of exponentiating polynomials over finite fields"@Fich,F.E.@Tompa,M. S@17@1985@48-58@@@"One, two, three ... infinity: Lower bounds for parallel computation"@Fich,F.E.@MeyeraufderHeide,F.@Ragde,P.@Wigderson,A. S@17@1985@59-68@@@"Tradeoffs for VLSI models with subpolynomial delay"@Aggarwal,A. S@17@1985@69-78@@@"Algorithms for routing and testing routability of planar VLSI layouts"@Leiserson,C.E.@Maley,F.M. S@17@1985@79-87@@@"Provably good routing in graphs: Regular arrays"@Raghavan,P.@Thompson,C.D. S@17@1985@88-97@@@"Expanders obtained from affine transformations"@Jimbo,S.@Maruoka,A. S@17@1985@98-102@@@"Expanders, sorting in rounds and superconcentrators of limited depth"@Alon,N. S@17@1985@103-112@@@"White pebbles help"@Wilber,R. S@17@1985@114-120@@@"Stable prehension with three fingers"@Baker,B.S.@Fortune,S.@Grosse,E. S@17@1985@121-130@@@"Riemann hypothesis and finding roots over finite fields"@Huang,M.-D.A. S@17@1985@131-142@@@"Computing with polynomials given by straight-line programs I: Greatest common divisors"@Kaltofen,E. S@17@1985@143-152@@@"Efficient parallel solution of linear systems"@Pan,V.@Reif,J. S@17@1985@153-162@@@"Polynomial time solutions of some problems in computational algebra"@Friedl,K.@Ronyai,L. S@17@1985@163-168@@@"A general approach to $d$-dimensional geometric queries"@Yao,A.C.@Yao,F.F. S@17@1985@169-174@@@"Space-time tradeoffs for orthogonal range queries"@Vaidya,P.M. S@17@1985@175-184@@@"A probabilistic algorithm for the post office problem"@Clarkson,K.L. S@17@1985@185-194@@@"A linear time algorithm for finding dominators in flow graphs and related problems"@Harel,D. S@17@1985@195-204@@@"Multicommodity flows in planar undirected graphs and shortest paths"@Suzuki,H.@Nishizeki,T.@Saito,N. S@17@1985@205-212@@@"The effect of updates in binary search trees"@Culberson,J. S@17@1985@213-216@@@"Finding the median requires $2n$ comparisons"@Bent,S.W.@John,J.W. S@17@1985@217-223@@@"Self-organizing sequential search and Hilbert's inequalities"@Chung,F.R.K.@Hajela,D.J.@Seymour,P.D. S@17@1985@224-231@@@"On the expected behaviour of disjoint set union algorithms"@Bollobas,B.@Simon,Istvan S@17@1985@232-239@@@"Concurrent dynamic logic"@Peleg,D. S@17@1985@240-251@@@"Improved upper and lower bounds for modal logics of programs"@Vardi,M.Y.@Stockmeyer,L. S@17@1985@252-262@@@"Transition systems, infinitary languages and the semantics of uniform concurrency"@DeBakker,J.W.@Meyer,J.-J.Ch.@Olderog,E.-R.@Zucker,J.I. S@17@1985@263-272@@@"Provable isomorphisms and domain equations in models of typed languages"@Bruce,K.B.@Longo,G. S@17@1985@273-284@@@"Equational theories and database constraints"@Cosmadakis,S.S.@Kanellakis,P.C. S@17@1985@285-290@@@"The polynomial hierarchy and fragments of bounded arithmetic"@Buss,S.R. S@17@1985@291-304@@@"The knowledge complexity of interactive proof-systems"@Goldwasser,S.@Micali,S.@Rackoff,C. S@17@1985@305-315@@@"An internal semantics for modal logic"@Fagin,R.@Vardi,M.Y. S@17@1985@316-326@@@"An $O( lg n)$ expected rounds randomized Byzantine generals protocol"@Bracha,G. S@17@1985@327-334@@@"Fault tolerance of minimal path routings in a network"@Feldman,P. S@17@1985@335-345@@@"The distributed firing squad problem"@Coan,B.A.@Dolev,D.@Dwork,C.@Stockmeyer,L. S@17@1985@346-355@@@"Optimal precision in the presence of uncertainty"@Halpern,J.Y.@Megiddo,N.@Munshi,A.A. S@17@1985@356-362@@@"The cryptographic security of truncated linearly related variables"@Hastad,J.@Shamir,A. S@17@1985@363-365@@@"One-way functions and pseudorandom generators"@Levin,L.A. S@17@1985@366-378@@@"Towards a strong communication complexity theory or generating quasi-random sequences from two communicating slightly-random sources"@Vazirani,U.V. S@17@1985@379-387@@@"On the stability of the ethernet"@Goodman,J.@Greenberg,A.G.@Madras,N.@March,P. S@17@1985@388-395@@@"A simple three-dimensional real-time reliable cellular array"@Gacs,P.@Reif,J.H. S@17@1985@396-404@@@"Doubly lexical orderings of matrices"@Lubiw,A. S@17@1985@405-412@@@"The complexity of the equivalence problem for commutative semigroups and symmetric vector addition systems"@Huynh,D.T. S@17@1985@413-420@@@"Fast algorithms for N-dimensional restrictions of hard problems"@MeyeraufderHeide,F. S@17@1985@421-429@@@"Trading group theory for randomness"@Babai,L. S@17@1985@430-439@@@"An algorithm for finding Hamilton cycles in a random graph"@Bollobas,B.@Fenner,T.I.@Frieze,A.M. S@17@1985@440-448@@@"Compression and ranking"@Goldberg,A.V.@Sipser,M. S@17@1985@449-457@@@"The complexity of backtrack searches"@Carter,L.@Stockmeyer,L.@Wegman,M. S@17@1985@458-463@@@"NP is as easy as detecting unique solutions"@Valiant,L.G.@Vazirani,V.V. S@17@1985@464-475@@@"Are search and decision problems computationally equivalent?"@Karp,R.M.@Upfal,E.@Wigderson,A. S@17@1985@476-483@@@"Dual Integer Linear Programs and the Relationship Between Their Optima"@Aharoni,R.@Erdos,P.@Linial,N. F@26@1985@1-10@@@"Separating the polynomial-time hierarchy by oracles"@Yao,A.C.-C. F@26@1985@11-19@@@"Deterministic simulation of probabilistic constant depth circuits"@Ajtai,M.@Wigderson,A. F@26@1985@20-29@@@"Amplification of probabilistic Boolean formulas"@Boppana,R.B. F@26@1985@30-38@@@"On networks of noisy gates"@Pippenger,N. F@26@1985@39-42@@@"How easy is local search"@Johnson,D.S.@Papadimitriou,C.H.@Yannakakis,M. F@26@1985@43-50@@@"Identification is easier than decoding"@Ja'Ja',J. F@26@1985@51-55@@@"Three theorems on polynomial degrees of NP-sets"@Ambos-Spies,K. F@26@1985@56-64@@@"Simulating two pushdown stores by one tape in $ O(n sup 1.5 sqrt {log n} ) $ time"@Li,M. F@26@1985@65-73@@@"Nondeterministic versus probabilistic linear search algorithms"@MeyeraufderHeide,F. F@26@1985@74-78@@@"The complexity of facets resolved"@Papadimitriou,C.H.@Wolfe,D. F@26@1985@79-89@@@"Using dual approximation algorithms for scheduling problems: Theoretical and practical results"@Hochbaum,D.S.@Shmoys,D.B. F@26@1985@90-100@@@"A scaling algorithm for weighted matching on general graphs"@Gabow,H.N. F@26@1985@101-105@@@"An all pairs shortest path algorithm with expected running time $ O(n sup 2 log n) $"@Moffat,A.@Takaoka,T. F@26@1985@106-116@@@"Recognizing circle graphs in polynomial time"@Gabor,C.P.@Hsu,W.-L.@Supowit,K.J. F@26@1985@117-125@@@"Why certain subgraph computations require only linear time"@Bern,M.W.@Lawler,E.L.@Wong,A.L. F@26@1985@126-136@@@"Efficient string matching in the presence of errors"@Landau,G.M.@Vishkin,U. F@26@1985@137-143@@@"The least weight subsequence problem"@Hirschberg,D.S.@Larmore,L.L. F@26@1985@144-154@@@"Motion planning in the presence of moving obstacles"@Reif,J.@Sharir,M. F@26@1985@155-164@@@"Visibility-polygon search and Euclidean shortest paths"@Asano,Takao@Asano,Tetsuo@Guibas,L.@Hershberger,J.@Imai,H. F@26@1985@165-174@@@"Slimming down search structures: A functional approach to algorithm design"@Chazelle,B. F@26@1985@175-185@@@"The complexity of recognizing polyhedral scenes"@Kirousis,L.M.@Papadimitriou,C.H. F@26@1985@186-196@@@"Multi-layer grid embeddings"@Aggarwal,A.@Klawe,M.@Lichtenstein,D.@Linial,N.@Wigderson,A. F@26@1985@197-207@@@"Area penalty for sublinear signal propagation delay on chip"@Vitanyi,P.M.B. F@26@1985@208-221@@@"On information flow and sorting: New upper and lower bounds for VLSI circuits"@Cole,R.@Siegel,A. F@26@1985@222-231@@@"Solving tree problems on a mesh-connected processor array"@Atallah,M.J.@Hambrusch,S.E. F@26@1985@232-240@@@"Solving some graph problems with optimal or near-optimal speedup on mesh-of-trees networks"@Huang,M.-D.A. F@26@1985@241-249@@@"Randomized routing on fat-trees"@Greenberg,R.I.@Leiserson,C.E. F@26@1985@250-256@@@"Distributed BFS algorithms"@Awerbuch,B.@Gallager,R.G. F@26@1985@257-266@@@"An almost linear time and $ O(n log n+e) $ messages distributed algorithm for minimum-weight spanning trees"@Chin,F.@Ting,H.F. F@26@1985@267-276@@@"Byzantine agreement in constant expected time (and trusting no one)"@Feldman,P.@Micali,S. F@26@1985@277-280@@@"Geometrical realization of set systems and probabilistic communication complexity"@Alon,N.@Frankl,P.@Rodl,V. F@26@1985@281-288@@@"Robin Hood hashing"@Celis,P.@Larson,P.-A.@Munro,J.I. F@26@1985@289-292@@@"Dynamic monotone priorities on planar sets"@Fischer,M.J.@Paterson,M.S. F@26@1985@293-302@@@"Design and analysis of dynamic Huffman coding"@Vitter,J.S. F@26@1985@303-311@@@"Average case lower bounds on the construction and searching of partial orders"@Mairson,H.G. F@26@1985@312-320@@@"On minima of functions, intersection patterns of curves, and Davenport-Schinzel sequences"@Sharir,M.@Livne,R. F@26@1985@321-326@@@"Inferring the structure of a Markov chain from its output"@Rudich,S. F@26@1985@327-338@@@"Automatic verification of probabilistic concurrent finite-state programs"@Vardi,M.Y. F@26@1985@339-345@@@"Partial polymorphic type inference is undecidable"@Boehm,H.-J. F@26@1985@346-353@@@"Fixed-point extensions of first-order logic"@Gurevich,Y.@Shelah,S. F@26@1985@354-359@@@"Equivalences and transformations of recursive definitions"@Courcelle,B. F@26@1985@360-371@@@"A private interactive test of a Boolean predicate and minimum-knowledge public-key cryptosystems"@Galil,Z.@Haber,S.@Yung,M. F@26@1985@372-382@@@"A robust and verifiable cryptographically secure election scheme"@Cohen,J.D.@Fischer,M.J. F@26@1985@383-395@@@"Verifiable secret sharing and achieving simultaneity in the presence of faults"@Chor,B.@Goldwasser,S.@Micali,S.@Awerbuch,B. F@26@1985@396-407@@@"The bit extraction problem of t-resilient functions"@Chor,B.@Goldreich,O.@Hastad,J.@Friedman,J.@Rudich,S.@Smolensky,R. F@26@1985@408-416@@@"Collective coin flipping, robust voting schemes and minima of Banzhaf values"@Ben-Or,M.@Linial,N. F@26@1985@417-428@@@"Random polynomial time is equal to slightly-random polynomial time"@Vazirani,U.V.@Vazirani,V.V. F@26@1985@429-442@@@"Unbiased bits from sources of weak randomness and probabilistic communication complexity"@Chor,B.@Goldreich,O. F@26@1985@443-450@@@"Factoring with cyclotomic polynomials"@Bach,E.@Shallit,J. F@26@1985@451-458@@@"Computing with polynomials given by straight-line programs II sparse factorization"@Kaltofen,E. F@26@1985@459-463@@@"An application of simultaneous approximation in combinatorial optimization"@Frank,A.@Tardos,E. F@26@1985@464-467@@@"Computing ears and branchings in parallel"@Lovasz,L. F@26@1985@468-477@@@"Parallel computational geometry"@Aggarwal,A.@Chazelle,B.@Guibas,L.@O'Dunlaing,C.@Yap,C. F@26@1985@478-489@@@"Parallel tree contraction and its application"@Miller,G.L.@Reif,J.H. F@26@1985@490-495@@@"Improved processor bounds for algebraic and combinatorial problems in RNC"@Galil,Z.@Pan,V. F@26@1985@496-504@@@"An optimal parallel algorithm for integer sorting"@Reif,J.H. F@26@1985@505-514@@@"Fast parallel computation with permutation groups"@Luks,E.M.@McKenzie,P. F@26@1985@515-521@@@"Algebraic cell decomposition in NC"@Kozen,D.@Yap,C.-K. F@26@1985@522-531@@@"Fast and efficient algorithms for sequential and parallel evaluation of polynomial zeros and of matrix polynomials"@Pan,V. F@26@1985@532-540@@@"The complexity of parallel sorting"@MeyeraufderHeide,F.@Wigderson,A. F@26@1985@541-550@@@"The complexity of parallel computation on matroids"@Karp,R.M.@Upfal,E.@Wigderson,A. S@18@1986@1-5@@@"Bounded-width polynomial-size branching programs recognize exactly those languages in $roman NC sup 1$"@Barrington,D. S@18@1986@6-20@@@"Almost optimal lower bounds for small depth circuits"@Hastad,J. S@18@1986@21-29@@@"With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy"@Cai,J. S@18@1986@30-38@@@"Two lower bounds for branching programs"@Ajtai,M.@Babai,L.@Hajnal,P.@Komlos,J.@Pudlak,P.@Rodl,V.@Szemeredi,E.@Turan,Gy. S@18@1986@39-49@@@"On nontrivial separators for $ k $-page graphs and simulations by nondeterministic one tape Turing machines"@Galil,Z.@Kannan,R.@Szemeredi,E. S@18@1986@50-58@@@"How hard is to marry at random? (on the approximation of the permanent)"@Broder,A.Z. S@18@1986@59-68@@@"Private coins versus public coins in interactive proof systems"@Goldwasser,S.@Sipser,M. S@18@1986@69-76@@@"The complexity of optimization problems"@Krentel,M.W. S@18@1986@77-90@@@"A provably efficient algorithm for dynamic storage allocation"@Coffman,E.G.,Jr.@Leighton,F.T. S@18@1986@91-103@@@"Tight bounds for minimax grid matching, with applications to the average case analysis of algorithms"@Leighton,T.@Shor,P. S@18@1986@104-108@@@"Four pages are necessary and sufficient for planar graphs"@Yannakakis,M. S@18@1986@109-121@@@"Making data structures persistent"@Driscoll,J.R.@Sarnak,N.@Sleator,D.D.@Tarjan,R.E. S@18@1986@122-135@@@"Rotation distance, triangulations, and hyperbolic geometry"@Sleator,D.D.@Tarjan,R.E.@Thurston,W.P. S@18@1986@136-146@@@"A new approach to the maximum flow problem"@Goldberg,A.V.@Tarjan,R.E. S@18@1986@147-159@@@"Fast algorithms for convex quadratic programming and multicommodity flows"@Kapoor,S.@Vaidya,P.M. S@18@1986@160-168@@@"Parallel hashing \(en An efficient implementation of shared memory"@Karlin,A.R.@Upfal,E. S@18@1986@169-176@@@"Limits on the power of concurrent-write parallel machines"@Beame,P. S@18@1986@177-187@@@"New lower bounds for parallel computation"@Li,M.@Yesha,Y. S@18@1986@188-195@@@"Deterministic selection in $O( log log N)$ parallel time"@Ajtai,M.@Komlos,J.@Steiger,W.L.@Szemeredi,E. S@18@1986@196-205@@@"Linear programming with two variables per inequality in poly-log time"@Lueker,G.S.@Megiddo,N.@Ramachandran,V. S@18@1986@206-219@@@"Deterministic coin tossing and accelerating cascades: Micro and macro techniques for designing parallel algorithms"@Cole,R.@Vishkin,U. S@18@1986@220-230@@@"Introducing efficient parallelism into approximate string matching and a new serial algorithm"@Landau,G.M.@Vishkin,U. S@18@1986@231-239@@@"Parallel evaluation of division-free arithmetic expressions"@Kosaraju,S.R. S@18@1986@240-246@@@"Explicit expanders and the Ramanujan conjectures"@Lubotzky,A.@Phillips,R.@Sarnak,P. S@18@1986@247-254@@@"Non-blocking networks"@Feldman,P.@Friedman,J.@Pippenger,N. S@18@1986@255-263@@@"An optimal sorting algorithm for mesh connected computers"@Schnorr,C.P.@Shamir,A. S@18@1986@264-272@@@"Optimal simulations between mesh-connected arrays of processors"@Kosaraju,S.R.@Atallah,M.J. S@18@1986@273-282@@@"Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension"@Blumer,A.@Ehrenfeucht,A.@Haussler,D.@Warmuth,M. S@18@1986@283-294@@@"Reasoning about fair concurrent programs"@Courcoubetis,C.@Vardi,M.Y.@Wolper,P. S@18@1986@295-303@@@"A note on one-way functions and polynomial-time isomorphisms"@Ko,K.-I.@Long,T.J.@Du,D.-Z. S@18@1986@304-315@@@"The complexity of reasoning about knowledge and time"@Halpern,J.Y.@Vardi,M.Y. S@18@1986@316-329@@@"Almost all primes can be quickly certified"@Goldwasser,S.@Kilian,J. S@18@1986@330-337@@@"Uniform closure properties of P-computable functions"@Kaltofen,E. S@18@1986@338-339@@@"A fast parallel algorithm to compute the rank of a matrix over an arbitrary field"@Mulmuley,K. S@18@1986@340-349@@@"A fast parallel algorithm for determining all roots of a polynomial with real roots"@Ben-Or,M.@Feig,E.@Kozen,D.@Tiwari,P. S@18@1986@350-355@@@"Finding irreducible polynomials over finite fields"@Adleman,L.M.@Lenstra,H.W.,Jr. S@18@1986@356-363@@@"Pseudo-random permutation generators and cryptographic composition"@Luby,M.@Rackoff,C. S@18@1986@364-369@@@"Limits on the security of coin flips when half the processors are faulty"@Cleve,R. S@18@1986@370-379@@@"Fault tolerance in networks of bounded degree"@Dwork,C.@Peleg,D.@Pippenger,N.@Upfal,E. S@18@1986@380-388@@@"A linear-time algorithm for triangulating simple polygons"@Tarjan,R.E.@VanWyk,C.J. S@18@1986@389-403@@@"Topologically sweeping an arrangement"@Edelsbrunner,H.@Guibas,L.J. S@18@1986@404-413@@@"Constructing higher-dimensional convex hulls at logarithmic cost per face"@Seidel,R. S@18@1986@414-423@@@"Further applications of random sampling to computational geometry"@Clarkson,K.L. S@18@1986@424-432@@@"Probing convex polytopes"@Dobkin,D.@Edelsbrunner,H.@Yap,C.K. S@18@1986@433-441@@@"Two probabilistic results on rectilinear Steiner trees"@Bern,M.W. S@18@1986@442-447@@@"Computing the volume is difficult"@Barany,I.@Furedi,Z. S@18@1986@448-459@@@"Aspects of information flow in VLSI circuits"@Siegel,A. F@27@1986@1-9@@@"An $ O(n sup 2 (m^+^n^log^n)^log^n) $ min-cost flow algorithm"@Galil,Z.@Tardos,E. F@27@1986@10-18@@@"Probabilistic construction of deterministic algorithms: Approximating packing integer programs"@Raghavan,P. F@27@1986@19-28@@@"On a search problem related to branch-and-bound procedures"@Karp,R.M.@Saks,M.@Wigderson,A. F@27@1986@29-38@@@"Probabilistic Boolean decision trees and the complexity of evaluating game trees"@Saks,M.@Wigderson,A. F@27@1986@39-48@@@"A physical interpretation of graph connectivity, and its algorithmic applications"@Linial,N.@Lovasz,L.@Wigderson,A. F@27@1986@49-54@@@"The asymptotic spectrum of tensors and the exponent of matrix multiplication"@Strassen,V. F@27@1986@55-60@@@"Storing a dynamic sparse table"@Aho,A.V.@Lee,D. F@27@1986@61-70@@@"Lower bounds for accessing binary search trees with rotations"@Wilber,R.E. F@27@1986@71-76@@@"What search algorithm gives optimal average-case performance when search resources are highly limited?"@Mutchler,D. F@27@1986@77-86@@@"Geometric applications of Davenport-Schinzel sequences"@Sharir,M.@Cole,R.@Kedem,K.@Leven,D.@Pollack,R.@Sifrony,S. F@27@1986@87-96@@@"Lower bounds on the complexity of multidimensional searching"@Chazelle,B. F@27@1986@97-106@@@"Planar realizations of nonlinear Davenport-Schinzel sequences by segments"@Wiernik,A. F@27@1986@107-116@@@"Proving by example and gap theorems"@Hong,J. F@27@1986@117-122@@@"An optimal algorithm for the all-nearest-neighbors problem"@Vaidya,P.M. F@27@1986@123-131@@@"An algorithm for constructing the aspect graph"@Plantinga,W.H.@Dyer,C.R. F@27@1986@132-142@@@"An algorithmic approach to the automated design of parts orienters"@Natarajan,B.K. F@27@1986@143-152@@@"Finite-resolution computational geometry"@Greene,D.H.@Yao,F.F. F@27@1986@153-161@@@"On Newton's method for polynomials"@Friedman,J. F@27@1986@162-167@@@"How to generate and exchange secrets"@Yao,A.C.-C. F@27@1986@168-173@@@"Information theoretic reductions among disclosure problems"@Brassard,G.@Crepeau,C.@Robert,J.-M. F@27@1986@174-187@@@"Proofs that yield nothing but their validity and a methodology of cryptographic protocol design"@Goldreich,O.@Micali,S.@Wigderson,A. F@27@1986@188-195@@@"Non-transitive transfer of confidence: A \fIperfect\fR zero-knowledge interactive protocol for SAT and beyond"@Brassard,G.@Crepeau,C. F@27@1986@196-207@@@"Dynamic deadlock resolution protocols"@Awerbuch,B.@Micali,S. F@27@1986@208-221@@@"Programming simultaneous actions using common knowledge"@Moses,Y.@Tuttle,M.R. F@27@1986@222-232@@@"Flipping persuasively in constant expected time"@Dwork,C.@Shmoys,D.@Stockmeyer,L. F@27@1986@233-243@@@"Atomic shared register access by asynchronous hardware"@Vitanyi,P.M.B.@Awerbuch,B. F@27@1986@244-254@@@"Competitive snoopy caching"@Karlin,A.R.@Manasse,M.S.@Rudolph,L.@Sleator,D.D. F@27@1986@255-263@@@"The distance bound for sorting on mesh-connected processor arrays is tight"@Ma,Y.@Sen,S.@Scherson,I.D. F@27@1986@264-273@@@"Meshes with multiple buses"@Stout,Q.F. F@27@1986@274-282@@@"Optimal simulations of tree machines"@Bhatt,S.@Chung,F.@Leighton,T.@Rosenberg,A. F@27@1986@283-291@@@"How robust is the n-cube?"@Becker,B.@Simon,H.-U. F@27@1986@292-302@@@"Parallel algorithms for permutation groups and graph isomorphism"@Luks,E.M. F@27@1986@303-312@@@"A Las Vegas-NC algorithm for isomorphism of graphs with bounded multiplicity of eigenvalues"@Babai,L. F@27@1986@313-321@@@"The complexity of isomorphism testing"@Garzon,M.@Zalcstein,Y. F@27@1986@322-330@@@"FFD bin packing for item sizes with distributions on [0,1/2]"@Floyd,S.@Karp,R. F@27@1986@331-336@@@"Fast solution of some random NP-hard problems"@Dyer,M.E.@Frieze,A.M. F@27@1986@337-347@@@"Complexity classes in communication complexity theory"@Babai,L.@Frankl,P.@Simon,J. F@27@1986@348-360@@@"A new pebble game that characterizes parallel complexity classes"@Venkateswaran,H.@Tompa,M. F@27@1986@361-367@@@"$ k+1 $ heads are better than $ k $ for PDA's"@Chrobak,M.@Li,M. F@27@1986@368-379@@@"On the power of interaction"@Aiello,W.@Goldwasser,S.@Hastad,J. F@27@1986@380-389@@@"Collapsing degrees"@Kurtz,S.A.@Mahaney,S.R.@Royer,J.S. F@27@1986@390-397@@@"Three results on the polynomial isomorphism of complete sets"@Goldsmith,J.@Joseph,D. F@27@1986@398-401@@@"Permanent and determinant"@VonzurGathen,J. F@27@1986@402-409@@@"Time-space tradeoffs for branching programs contrasted with those for straight-line programs"@Abrahamson,K. F@27@1986@410-417@@@"Meanders, Ramsey theory and lower bounds for branching programs"@Alon,N.@Maass,W. F@27@1986@418-427@@@"The token distribution problem"@Peleg,D.@Upfal,E. F@27@1986@428-437@@@"Separator-based strategies for efficient message routing"@Frederickson,G.N.@Janardan,R. F@27@1986@438-454@@@"Parallel complexity of logical query programs"@Ullman,J.D.@VanGelder,A. F@27@1986@455-464@@@"On the power of one-way communication"@Chang,J.H.@Ibarra,O.H.@Vergis,A. F@27@1986@465-477@@@"An efficient parallel algorithm for planarity"@Klein,P.N.@Reif,J.H. F@27@1986@478-491@@@"Approximate and exact parallel scheduling with applications to list, tree and graph problems"@Cole,R.@Vishkin,U. F@27@1986@492-501@@@"An optimal randomized parallel algorithm for finding connected components in a graph"@Gazit,H. F@27@1986@502-510@@@"Tight complexity bounds for parallel comparison sorting"@Alon,N.@Azar,Y.@Vishkin,U. F@27@1986@511-516@@@"Parallel merge sort"@Cole,R. S@19@1987@1-6@@@Matrix multiplication via arithmetic progressions@Coppersmith,D.@Winograd,S. S@19@1987@7-18@@@Solving minimum-cost flow problems by successive approximation@Goldberg,A.V.@Tarjan,R.E. S@19@1987@19-28@@@A new approach to all pairs shortest paths in planar graphs@Frederickson,G.N. S@19@1987@29-38@@@An algorithm for linear programming which requires $ O(((m+n)n sup 2 ^+^(m+n) sup 1.5 n)L) $ arithmetic operations@Vaidya,P.M. S@19@1987@39-45@@@A linear time algorithm for computing the Voronoi diagram of a convex polygon@Aggarwal,A.@Guibas,L.J.@Saxe,J.@Shor,P.W. S@19@1987@46-55@@@Testing for cycles in infinite graphs with periodic structure@Iwano,K.@Steiglitz,K. S@19@1987@56-65@@@Approximation algorithms for shortest path motion planning@Clarkson,K.L. S@19@1987@66-76@@@The complexity of cutting convex polytopes@Chazelle,B.@Edelsbrunner,H.@Guibas,L.J. S@19@1987@77-82@@@Algebraic methods in the theory of lower bounds for Boolean circuit complexity@Smolensky,R. S@19@1987@83-93@@@Optimal bounds for decision problems on the CRCW PRAM@Beame,P.@Hastad,J. S@19@1987@94-100@@@Two tapes are better than one for off-line Turing machines@Maass,W.@Schnitger,G.@Szemeredi,E. S@19@1987@101-109@@@Finite monoids and the fine structure of $roman NC sup 1$@Barrington,D.@Therien,D. S@19@1987@110-122@@@The strong exponential hierarchy collapses@Hemachandra,L.A. S@19@1987@123-131@@@The Boolean formula value problem is in ALOGTIME@Buss,S.R. S@19@1987@132-140@@@Deterministic simulation in LOGSPACE@Ajtai,M.@Komlos,J.@Szemeredi,E. S@19@1987@141-150@@@Properties that characterize LOGCFL@Venkateswaran,H. S@19@1987@151-159@@@Some consequences of the existence of pseudorandom generators@Allender,E.W. S@19@1987@160-168@@@Efficiency considerations in using semi-random sources@Vazirani,U.V. S@19@1987@169-177@@@Imperfect random sources and discrete controlled processes@Lichtenstein,D.@Linial,N.@Saks,M. S@19@1987@178-181@@@The power of randomness for communication complexity@Furer,M. S@19@1987@182-194@@@Towards a theory of software protection and simulation by oblivious RAMs@Goldreich,O. S@19@1987@195-203@@@On hiding information from an oracle@Abadi,M.@Feigenbaum,J.@Kilian,J. S@19@1987@204-209@@@The complexity of perfect zero-knowledge@Fortnow,L. S@19@1987@210-217@@@Zero knowledge proofs of identity@Feige,U.@Fiat,A.@Shamir,A. S@19@1987@218-229@@@How to play any mental game or A completeness theorem for protocols with honest majority@Goldreich,O.@Micali,S.@Wigderson,A. S@19@1987@230-240@@@Optimal distributed algorithms for minimum weight spanning tree, counting, leader election and related problems@Awerbuch,B. S@19@1987@241-253@@@Analysis of backoff protocols for multiple access channels@Hastad,J.@Leighton,T.@Rogoff,B. S@19@1987@254-263@@@Dynamic parallel complexity of computational circuits@Miller,G.L.@Teng,S.-H. S@19@1987@264-273@@@Constructing disjoint paths on expander graphs@Peleg,D.@Upfal,E. S@19@1987@274-284@@@Reconfiguring a hypercube in the presence of faults@Hastad,J.@Leighton,T.@Newman,M. S@19@1987@285-295@@@On the learnability of Boolean formulae@Kearns,M.@Li,M.@Pitt,L.@Valiant,L. S@19@1987@296-304@@@On learning Boolean functions@Natarajan,B.K. S@19@1987@305-314@@@A model for hierarchical memory@Aggarwal,A.@Alpern,B.@Chandra,A.K.@Snir,M. S@19@1987@315-324@@@Parallel symmetry-breaking in sparse graphs@Goldberg,A.V.@Plotkin,S.A.@Shannon,G.E. S@19@1987@325-334@@@A random NC algorithm for depth first search@Aggarwal,A.@Anderson,R.J. S@19@1987@335-344@@@A new graph triconnectivity algorithm and its parallelization@Miller,G.L.@Ramachandran,V. S@19@1987@345-354@@@Matching is as easy as matrix inversion@Mulmuley,K.@Vazirani,U.V.@Vazirani,V.V. S@19@1987@355-364@@@Fast parallel algorithms for chordal graphs@Naor,J.@Naor,M.@Schaffer,A.A. S@19@1987@365-372@@@Two algorithms for maintaining order in a list@Dietz,P.F.@Sleator,D.D. S@19@1987@373-382@@@An optimal online algorithm for metrical task systems@Borodin,A.@Linial,N.@Saks,M. S@19@1987@383-387@@@Searching a two key table under a single key@Munro,J.I. S@19@1987@388-397@@@The pagenumber of genus $g$ graphs is $O(g)$@Heath,L.S.@Istrail,S. S@19@1987@398-408@@@Simple algebras are difficult@Ronyai,L. S@19@1987@409-420@@@Permutation groups in NC@Babai,L.@Luks,E.M.@Seress,A. S@19@1987@421-424@@@Threshold spectra for random graphs@Shelah,S.@Spencer,J. S@19@1987@425-435@@@The decision problem for the probabilities of higher-order properties@Kolaitis,P.G.@Vardi,M.Y. S@19@1987@436-442@@@Size-time complexity of Boolean networks for prefix computations@Bilardi,G.@Preparata,F.P. S@19@1987@443-452@@@Single-factor Hensel lifting and its application to the straight-line complexity of certain polynomials@Kaltofen,E. S@19@1987@453-461@@@Realistic analysis of some randomized algorithms@Bach,E. S@19@1987@462-469@@@Recognizing primes in random polynomial time@Adleman,L.@Huang,M.-D.A. F@28@1987@1-10@@@"Polytope range searching and integral geometry"@Chazelle,B. F@28@1987@11-19@@@"An output sensitive algorithm for computing visibility graphs"@Ghosh,S.K.@Mount,D.M. F@28@1987@20-26@@@"Delaunay graphs are almost as good as complete graphs"@Dobkin,D.P.@Friedman,S.J.@Supowit,K.J. F@28@1987@27-37@@@"On the lower envelope of bivariate functions and its applications"@Edelsbrunner,H.@Pach,J.@Schwartz,J.T.@Sharir,M. F@28@1987@39-48@@@"A new algebraic method for robot motion planning and real geometry"@Canny,J. F@28@1987@49-60@@@"New lower bound techniques for robot motion planning problems"@Canny,J.@Reif,J. F@28@1987@61-67@@@"Learning one-counter languages in polynomial time"@Berman,P.@Roos,R. F@28@1987@68-77@@@"Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm"@Littlestone,N. F@28@1987@78-87@@@"Diversity-based inference of finite automata"@Rivest,R.L.@Schapire,R.E. F@28@1987@89-98@@@"Incomparability in parallel computation"@Grolmusz,V.@Ragde,P. F@28@1987@99-110@@@"Threshold circuits of bounded depth"@Hajnal,A.@Maass,W.@Pudlak,P.@Szegedy,M.@Turan,Gy. F@28@1987@111-117@@@"Complete and incomplete randomized NP problems"@Gurevich,Y. F@28@1987@118-126@@@"Generic oracles and oracle classes"@Blum,M.@Impagliazzo,R. F@28@1987@127-131@@@"Functional decomposition of polynomials"@VonzurGathen,J.@Kozen,D.@Landau,S. F@28@1987@132-137@@@"Factoring polynomials over finite fields"@Ronyai,L. F@28@1987@138-140@@@"Multiplicative complexity of polynomial multiplication over finite fields"@Kaminski,M.@Bshouty,N.H. F@28@1987@141-150@@@"The multiplicative complexity of quadratic Boolean forms"@Mirwald,R.@Schnorr,C.P. F@28@1987@151-160@@@"Cascading divide-and-conquer: A technique for designing parallel algorithms"@Atallah,M.J.@Cole,R.@Goodrich,M.T. F@28@1987@161-165@@@"A new parallel algorithm for the maximal independent set problem"@Goldberg,M.@Spencer,T. F@28@1987@166-172@@@"The matching problem for bipartite graphs with polynomially bounded permanents is in NC"@Grigoriev,D.Yu.@Karpinski,M. F@28@1987@173-184@@@"Some polynomial and Toeplitz matrix computations"@Pan,V.@Reif,J. F@28@1987@185-194@@@"How to emulate shared memory"@Ranade,A.G. F@28@1987@195-201@@@"The complexity of parallel comparison merging"@Gereb-Graus,M.@Krizanc,D. F@28@1987@204-216@@@"Hierarchical memory with block transfer"@Aggarwal,A.@Chandra,A.K.@Snir,M. F@28@1987@217-224@@@"Approximation algorithms for scheduling unrelated parallel machines"@Lenstra,J.K.@Shmoys,D.B.@Tardos,E. F@28@1987@225-237@@@"Finding near optimal separators in planar graphs"@Rao,S. F@28@1987@238-248@@@"A parallel algorithm for finding a separator in planar graphs"@Gazit,H.@Miller,G.L. F@28@1987@249-251@@@"Determining edge connectivity in $ O(nm) $"@Matula,D.W. F@28@1987@252-259@@@"Improved algorithms for graph four-connectivity"@Kanevsky,A.@Ramachandran,V. F@28@1987@260-269@@@"Parallel graph algorithms that are efficient on average"@Coppersmith,D.@Raghavan,P.@Tompa,M. F@28@1987@271-279@@@"Canonical labeling of regular graphs in linear average time"@Kucera,L. F@28@1987@280-285@@@"Eigenvalues and graph bisection: An average-case analysis"@Boppana,R.B. F@28@1987@286-294@@@"On the second eigenvalue of random regular graphs"@Broder,A.@Shamir,E. F@28@1987@295-304@@@"Recursive construction for 3-regular expanders"@Ajtai,M. F@28@1987@305-315@@@"The organization of permutation architectures with bussed interconnections"@Kilian,J.@Kipnis,S.@Leiserson,C.E. F@28@1987@316-325@@@"Channel routing of multiterminal nets"@Gao,S.@Kaufmann,M. F@28@1987@326-330@@@"Two lower bounds in asynchronous distributed computation"@Duris,P.@Galil,Z. F@28@1987@331-335@@@"Distributive graph algorithms \(en Global solutions from local data"@Linial,N. F@28@1987@337-346@@@"Achievable cases in an asynchronous environment"@Attiya,H.@Bar-Noy,A.@Dolev,D.@Koller,D.@Peleg,D.@Reischuk,R. F@28@1987@347-357@@@"Local management of a global resource in a communication network"@Afek,Y.@Awerbuch,B.@Plotkin,S.A.@Saks,M. F@28@1987@358-370@@@"Applying static network protocols to dynamic networks"@Afek,Y.@Awerbuch,B.@Gafni,E. F@28@1987@371-382@@@"Bounded time-stamps"@Israeli,A.@Li,M. F@28@1987@383-392@@@"Concurrent reading while writing II: The multi-writer case"@Peterson,G.L.@Burns,J.E. F@28@1987@393-400@@@"Lower bounds to randomized algorithms for graph properties"@Yao,A.C.-C. F@28@1987@401-410@@@"Exponential lower bounds for finding Brouwer fixed points"@Hirsch,M.D.@Vavasis,S. F@28@1987@411-420@@@"Database theory and cylindric lattices"@Cosmadakis,S.S. F@28@1987@421-426@@@"Secret linear congruential generators are not cryptographically secure"@Stern,J. F@28@1987@427-437@@@"A practical scheme for non-interactive verifiable secret sharing"@Feldman,P. F@28@1987@439-448@@@"Perfect zero-knowledge languages can be recognized in two rounds"@Aiello,W.@Hastad,J. F@28@1987@449-461@@@"Interactive proof systems: Provers that never fail and random selection"@Goldreich,O.@Mansour,Y.@Sipser,M. F@28@1987@462-471@@@"On the cunning power of cheating verifiers: Some observations about zero knowledge proofs"@Oren,Y. F@28@1987@472-482@@@"Random self-reducibility and zero knowledge interactive proofs of possession of information"@Tompa,M.@Woll,H. F@28@1987@489-498@@@"The average complexity of deterministic and randomized parallel comparison sorting algorithms"@Alon,N.@Azar,Y. S@20@1988@1-10@@@"Completeness theorems for non-cryptographic fault-tolerant distributed computation"@Ben-Or,M.@Goldwasser,S.@Wigderson,A. S@20@1988@11-19@@@"Multiparty unconditionally secure protocols"@Chaum,D.@Crepeau,C.@Damgaard,I. S@20@1988@20-31@@@"Founding cryptography on oblivious transfer"@Kilian,J. S@20@1988@32-42@@@"How to sign given any trapdoor function"@Bellare,M.@Micali,S. S@20@1988@43-52@@@"A tradeoff between space and efficiency for routing tables"@Peleg,D.@Upfal,E. S@20@1988@53-65@@@"Reasoning about knowledge and time in asynchronous systems"@Halpern,J.Y.@Vardi,M.Y. S@20@1988@66-77@@@"Investigations of fault-tolerant networks of computers"@Berman,P.@Simon,J. S@20@1988@78-92@@@"Toward a non-atomic era: $l$-exclusion as a test case"@Dolev,D.@Gafni,E.@Shavit,N. S@20@1988@93-102@@@"A time-randomness tradeoff for oblivious routing"@Krizanc,D.@Peleg,D.@Upfal,E. S@20@1988@103-112@@@"Non-interactive zero-knowledge and its applications"@Blum,M.@Feldman,P.@Micali,S. S@20@1988@113-131@@@"Multi-prover interactive proofs: How to remove intractability assumptions"@Ben-Or,M.@Goldwasser,S.@Kilian,J.@Wigderson,A. S@20@1988@132-147@@@"A knowledge-based analysis of zero knowledge"@Halpern,J.Y.@Moses,Y.@Tuttle,M.R. S@20@1988@148-161@@@"Optimal algorithms for Byzantine agreement"@Feldman,P.@Micali,S. S@20@1988@162-172@@@"On different modes of communication"@Halstenberg,B.@Reischuk,R. S@20@1988@173-185@@@"Virtual memory algorithms"@Aggarwal,A.@Chandra,A.K. S@20@1988@186-191@@@"On the communication complexity of graph properties"@Hajnal,A.@Maass,W.@Turan,Gy. S@20@1988@192-204@@@"Optimal simulations by butterfly networks"@Bhatt,S.N.@Chung,F.R.K.@Hong,J.-W.@Leighton,F.T.@Rosenberg,A.L. S@20@1988@205-216@@@"Energy consumption in VLSI circuits"@Aggarwal,A.@Chandra,A.K.@Raghavan,P. S@20@1988@217-222@@@"Random instances of a graph coloring problem are hard"@Venkatesan,R.@Levin,L.A. S@20@1988@223-228@@@"Expressing combinatorial optimization problems by linear programs"@Yannakakis,M. S@20@1988@229-234@@@"Optimization, approximation, and complexity classes"@Papadimitriou,C.H.@Yannakakis,M. S@20@1988@235-244@@@"Conductance and the rapid mixing property for Markov chains: The approximation of the permanent resolved"@Jerrum,M.@Sinclair,A. S@20@1988@245-253@@@"Relativized polynominal time hierarchies having exactly $k$ levels"@Ko,K.-I. S@20@1988@254-257@@@"Computing algebraic formulas using a constant number of registers"@Ben-Or,M.@Cleve,R. S@20@1988@258-266@@@"On the power of white pebbles"@Kalyanasundaram,B.@Schnitger,G. S@20@1988@267-280@@@"Learning in the presence of malicious errors"@Kearns,M.@Li,M. S@20@1988@281-289@@@"Nondeterministic linear-time tasks may require substantially nonlinear deterministic time in the case of sublinear work space"@Gurevich,Y.@Shelah,S. S@20@1988@290-300@@@"A randomized parallel branch-and-bound procedure"@Karp,R.M.@Zhang,Y. S@20@1988@301-309@@@"A deterministic algorithm for sparse multivariate polynominal interpolation"@Ben-Or,M.@Tiwari,P. S@20@1988@310-321@@@"Randomized algorithms and pseudorandom numbers"@Karloff,H.J.@Raghavan,P. S@20@1988@322-333@@@"Competitive algorithms for on-line problems"@Manasse,M.S.@McGeoch,L.A.@Sleator,D.D. S@20@1988@334-343@@@"Implicit representation of graphs"@Kannan,S.@Naor,M.@Rudich,S. S@20@1988@344-353@@@"Storing and searching a multikey table"@Fiat,A.@Naor,M.@Schaffer,A.A.@Schmidt,J.P.@Siegel,A. S@20@1988@354-359@@@"More analysis of double hashing"@Lueker,G.S.@Molodowitch,M. S@20@1988@360-366@@@"Linearity and unprovability of set union problem strategies"@Loebl,M.@Nesetril,J. S@20@1988@367-376@@@"Non-oblivious hashing"@Fiat,A.@Naor,M.@Schmidt,J.P.@Siegel,A. S@20@1988@377-387@@@"A faster strongly polynominal minimum cost flow algorithm"@Orlin,J.B. S@20@1988@388-397@@@"Finding minimum-cost circulations by canceling negative cycles"@Goldberg,A.V.@Tarjan,R.E. S@20@1988@398-406@@@"Detecting cycles in dynamic graphs in polynomial time"@Kosaraju,S.R.@Sullivan,G.F. S@20@1988@407-421@@@"Forests, frames and games: Algorithms for matroid sums and applications"@Gabow,H.N.@Westermann,H.H. S@20@1988@422-425@@@"Geometry helps in matching"@Vaidya,P.M. S@20@1988@426-433@@@"Small sets supporting F\*'ary embeddings of planar graphs"@DeFraysseix,H.@Pach,J.@Pollack,R. S@20@1988@434-444@@@"Optimal algorithms for appropriate clustering"@Feder,T.@Greene,D.H. S@20@1988@445-459@@@"Planning constrained motion"@Fortune,S.@Wilfong,G. S@20@1988@460-467@@@"Some algebraic and geometric computations in PSPACE"@Canny,J. S@20@1988@468-476@@@"Lower bounds on the complexity of graph properties"@King,V. S@20@1988@477-490@@@"Decidable optimization problems for database logic programs"@Cosmadakis,S.S.@Gaifman,H.@Kanellakis,P.C.@Vardi,M.Y. S@20@1988@491-503@@@"Polynomial universal traversing sequences for cycles are constructible"@Istrail,S. S@20@1988@504-509@@@"Two infinite sets of primes with fast primality tests"@Pintz,J.@Steiger,W.L.@Szemeredi,E. S@20@1988@510-513@@@"Towards an architecture-independent analysis of parallel algorithms"@Papadimitriou,C.H.@Yannakakis,M. S@20@1988@514-527@@@"Almost-optimum speed-ups of algorithms for bipartite matching and Related Problems"@Gabow,H.N.@Tarjan,R.E. S@20@1988@528-538@@@"Using smoothness to achieve parallelism"@Adleman,L.M.@Kompella,K. S@20@1988@539-550@@@"Monotone circuits for connectivity require super-logarithmic depth"@Karchmer,M.@Wigderson,A. F@29@1988@2-11@@@"Hardness vs. randomness"@Nisan,N.@Wigderson,A. F@29@1988@12-24@@@"On the existence of pseudorandom generators"@Goldreich,O.@Krawczyk,H.@Luby,M. F@29@1988@25-35@@@"Zero-knowledge with log-space verifiers"@Kilian,J. F@29@1988@36-41@@@"Homogeneous measures and polynomial time invariants"@Levin,L.A. F@29@1988@42-52@@@"Achieving oblivious transfer using weakened security assumptions"@Crepeau,C.@Kilian,J. F@29@1988@54-63@@@"Lower bounds for integer greatest common divisor computations"@Mansour,Y.@Schieber,B.@Tiwari,P. F@29@1988@64-67@@@"A lower bound for matrix multiplication"@Bshouty,N.H. F@29@1988@68-80@@@"The influence of variables on boolean functions"@Kahn,J.@Kalai,G.@Linial,N. F@29@1988@81-90@@@"Lattices, M\*:obius functions and communication complexity"@Lovasz,L.@Saks,M. F@29@1988@91-97@@@"Near-optimal time-space tradeoff for element distinctness"@Yao,A.C.-C. F@29@1988@100-109@@@"Predicting {0,1}-functions on randomly drawn points"@Haussler,D.@Littlestone,N.@Warmuth,M.K. F@29@1988@110-119@@@"Learning probabilistic prediction functions"@DeSantis,A.@Markowsky,G.@Wegman,M.N. F@29@1988@120-129@@@"Results on learnability and the Vapnik-Chervonenkis dimension"@Linial,N.@Mansour,Y.@Rivest,R.L. F@29@1988@130-137@@@"Learning via queries"@Gasarch,W.I.@Smith,C.H. F@29@1988@138-147@@@"Effect of connectivity in associative memory models"@Komlos,J.@Paturi,R. F@29@1988@150-161@@@"Efficient parallel algorithms for chordal graphs"@Klein,P.N. F@29@1988@162-173@@@"Removing randomness in parallel computation without a processor penalty"@Luby,M. F@29@1988@174-185@@@"Sublinear-time parallel algorithms for matching and related problems"@Goldberg,A.V.@Plotkin,S.A.@Vaidya,P.M. F@29@1988@186-193@@@"Optimal parallel algorithm for the Hamiltonian cycle problem on dense graphs"@Dahlhaus,E.@Hajnal,P.@Karpinski,M. F@29@1988@194-203@@@"Parallel comparison algorithms for approximation problems"@Alon,N.@Azar,Y. F@29@1988@206-220@@@"Dynamic networks are as fast as static networks"@Awerbuch,B.@Sipser,M. F@29@1988@221-230@@@"Increasing the size of a network by a constant factor can increase performance by more than a constant factor"@Koch,R.A. F@29@1988@231-245@@@"On the effects of feedback in dynamic network protocols"@Awerbuch,B. F@29@1988@246-255@@@"Coordinated traversal: $(t + 1)$-round Byzantine agreement in polynomial time"@Moses,Y.@Waarts,O. F@29@1988@256-269@@@"Universal packet routing algorithms"@Leighton,T.@Maggs,B.@Rao,S. F@29@1988@272-282@@@"Fast management of permutation groups"@Babai,L.@Luks,E.M.@Seress,A. F@29@1988@283-290@@@"New algorithms for finding irreducible polynomials over finite fields"@Shoup,V. F@29@1988@291-295@@@"A faster PSPACE algorithm for deciding the existential theory of the reals"@Renegar,J. F@29@1988@296-305@@@"Computing with polynomials given by black boxes for their evaluation: Greatest common divisors, factorization, separation of numerators and denominators"@Kaltofen,E.@Trager,B. F@29@1988@306-316@@@"On the complexity of kinodynamic planning"@Canny,J.@Donald,B.@Reif,J.@Xavier,P. F@29@1988@319-327@@@"On the complexity of $omega$-automata"@Safra,S. F@29@1988@328-337@@@"The complexity of tree automata and logics of programs"@Emerson,E.A.@Jutla,C.S. F@29@1988@338-345@@@"Verifying temporal properties of finite-state probabilistic programs"@Courcoubetis,C.@Yannakakis,M. F@29@1988@346-355@@@"The complexity of the pigeonhole principle"@Ajtai,M. F@29@1988@358-367@@@"Reachability is harder for directed than for undirected finite graphs"@Ajtai,M.@Fagin,R. F@29@1988@368-376@@@"Fully abstract models of the lazy lambda calculus"@Ong,C.-H.L. F@29@1988@377-386@@@"Nonexpressibility of fairness and signaling"@McAllester,D.A@Panangaden,P.@Shanbhogue,V. F@29@1988@387-397@@@"On a theory of completeness, recursive functions and universal machines"@Blum,L.@Shub,M.@Smale,S. F@29@1988@398-409@@@"Constructive results from graph minors: Linkless embeddings"@Motwani,R.@Raghunathan,A.@Saran,H. F@29@1988@412-421@@@"Polytopes, permanents and graphs with large factors"@Dagum,P.@Luby,M.@Mihail,M.@Vazirani,U. F@29@1988@422-431@@@"An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms"@Leighton,T.@Rao,S. F@29@1988@432-443@@@"Combinatorial algorithms for the generalized circulation problem"@Goldberg,A.V.@Plotkin,S.A.@Tardos,E. F@29@1988@444-451@@@"Polynomial algorithm for the k-cut problem"@Goldschmidt,O.@Hochbaum,D.S. F@29@1988@452-456@@@"A Las Vegas algorithm for linear programming when the dimension is small"@Clarkson,K.L. F@29@1988@458-468@@@"Genus g graphs have pagenumber $O( sqrt g )$"@Malitz,S.M. F@29@1988@469-478@@@"Take a walk, grow a tree"@Bhatt,S.@Cai,J.-Y. F@29@1988@479-487@@@"Bounds on the cover time"@Broder,A.Z.@Karlin,A.R. F@29@1988@488-496@@@"Speeding up dynamic programming"@Eppstein,D.@Galil,Z.@Giancarlo,R. F@29@1988@497-512@@@"Notes on searching in multidimensional monotone arrays"@Aggarwal,A.@Park,J. F@29@1988@514-523@@@"Three stacks"@Fredman,M.L.@Goldsmith,D.L. F@29@1988@524-531@@@"Dynamic perfect hashing: Upper and lower bounds"@Dietzfelbinger,M.@Karlin,A.@Mehlhorn,K.@MeyeraufderHeide,F.@Rohnert,H.@Tarjan,R.E. F@29@1988@532-538@@@"On pointers versus addresses"@Ben-Amram,A.M.@Galil,Z. F@29@1988@539-549@@@"A deterministic view of random sampling and its use in geometry"@Chazelle,B.@Friedman,J. F@29@1988@550-556@@@"New upper bounds in Klee's measure problem"@Overmars,M.H.@Yap,C.-K. F@29@1988@558-567@@@"Fully dynamic techniques for point location and transitive closure in planar structures"@Preparata,F.P.@Tamassia,R. F@29@1988@568-579@@@"Combinatorial complexity bounds for arrangements of curves and surfaces"@Clarkson,K.L.@Edelsbrunner,H.@Guibas,L.J.@Sharir,M.@Welzl,E. F@29@1988@580-589@@@"A fast planar partition algorithm, I"@Mulmuley,K. F@29@1988@590-600@@@"An optimal algorithm for intersecting line segments in the plane"@Chazelle,B.@Edelsbrunner,H. F@29@1988@601-611@@@"Covering polygons is hard"@Culberson,J.C.@Reckhow,R.A. S@21@1989@1-11@@@"Multiparty protocols and Logspace-hard pseudorandom sequences"@Babai,L.@Nisan,N.@Szegedy,M. S@21@1989@12-24@@@"Pseudo-random generation from one-way functions"@Impagliazzo,R.@Levin,L.A.@Luby,M. S@21@1989@25-32@@@"A hard-core predicate for all one-way functions"@Goldreich,O.@Levin,L.A. S@21@1989@33-43@@@"Universal one-way hash functions and their cryptographic applications"@Naor,M.@Yung,M. S@21@1989@44-61@@@"Limits on the provable consequences of one-way permutations"@Impagliazzo,R.@Rudich,S. S@21@1989@62-72@@@"A zero-one law for Boolean privacy"@Chor,B.@Kushilevitz,E. S@21@1989@73-85@@@"Verifiable secret sharing and multiparty protocols with honest majority"@Rabin,T.@Ben-Or,M. S@21@1989@86-97@@@"Designing programs that check their work"@Blum,M.@Kannan,S. S@21@1989@98-106@@@"Provably fast integer factoring with quasi-uniform small quadratic residues"@Vallee,B. S@21@1989@107-112@@@"Functional interpretations of feasibly constructive arithmetic"@Cook,S.@Urquhart,A. S@21@1989@113-126@@@"Expressiveness of restricted recursive queries"@Afrati,F.@Cosmadakis,S.S. S@21@1989@127-137@@@"On $omega$-automata and temporal logic"@Safra,S.@Vardi,M.Y. S@21@1989@138-147@@@"Quantifier elimination in the theory of an algebraically-closed field"@Ierardi,D. S@21@1989@148-156@@@"Probabilistic computation and linear time"@Fortnow,L.@Sipser,M. S@21@1989@157-166@@@"The isomorphism conjecture fails relative to a random oracle"@Kurtz,S.A.@Mahaney,S.R.@Royer,J.S. S@21@1989@167-176@@@"On the method of approximations"@Razborov,A.A. S@21@1989@177-185@@@"On the extended direct sum conjecture"@Bshouty,N.H. S@21@1989@186-196@@@"Circuits and local computation"@Yao,A.C.-C. S@21@1989@197-203@@@"A general sequential time-space tradeoff for finding unique elements"@Beame,P. S@21@1989@204-216@@@"On the theory of average case complexity"@Ben-David,S.@Chor,B.@Goldreich,O.@Luby,M. S@21@1989@217-226@@@"Tradeoffs between communication and space"@Lam,T.@Tiwari,P.@Tompa,M. S@21@1989@227-240@@@"Work-preserving emulations of fixed-connection networks"@Koch,R.@Leighton,T.@Maggs,B.@Rao,S.@Rosenberg,A. S@21@1989@241-250@@@"An $O( log N)$ deterministic packet routing scheme"@Upfal,E. S@21@1989@251-263@@@"Fast computation using faulty hypercubes"@Hastad,J.@Leighton,T.@Newman,M. S@21@1989@264-273@@@"Optimal size integer division circuits"@Reif,J.H.@Tate,S.R. S@21@1989@274-285@@@"On the complexity of radio communication"@Alon,N.@Bar-Noy,A.@Linial,N.@Peleg,D. S@21@1989@286-296@@@"Local reorientation, global order, and planar topology"@Kao,M.-Y.@Shannon,G.E. S@21@1989@297-308@@@"Parallel depth-first search in general directed graphs"@Aggarwal,A.@Anderson,R.J.@Kao,M.-Y. S@21@1989@309-319@@@"Highly parallelizable problems"@Berkman,O.@Breslauer,D.@Galil,Z.@Schieber,B.@Vishkin,U. S@21@1989@320-326@@@"Optimal separations between concurrent-write parallel machines"@Boppana,R.B. S@21@1989@327-335@@@"CREW PRAMs and decision trees"@Nisan,N. S@21@1989@336-344@@@"Implicit $O(1)$ probe search"@Fiat,A.@Naor,M. S@21@1989@345-354@@@"The cell probe complexity of dynamic data structures"@Fredman,M.L.@Saks,M.E. S@21@1989@355-366@@@"On aspects of universality and performance for closed hashing"@Schmidt,J.P.@Siegel,A. S@21@1989@367-374@@@"Verifying partial orders"@Kenyon-Mathieu,C.@King,V. S@21@1989@375-381@@@"A random polynomial time algorithm for approximating the volume of convex bodies"@Dyer,M.@Frieze,A.@Kannan,R. S@21@1989@382-393@@@"Lines in space \(en Combinatorics, algorithms and applications"@Chazelle,B.@Edelsbrunner,H.@Guibas,L.J.@Sharir,M. S@21@1989@394-404@@@"Polling: A new randomized sampling technique for computational geometry"@Reif,J.H.@Sen,S. S@21@1989@405-410@@@"Coordinate representation of order types requires exponential storage"@Goodman,J.E.@Pollack,R.@Sturmfels,B. S@21@1989@411-420@@@"Inference of finite automata using homing sequences"@Rivest,R.L.@Schapire,R.E. S@21@1989@421-432@@@"The minimum consistent DFA problem cannot be approximated within any polynomial"@Pitt,L.@Warmuth,M.K. S@21@1989@433-444@@@"Cryptographic limitations on learning boolean formulae and finite automata"@Kearns,M.@Valiant,L.G. S@21@1989@445-453@@@"Proof of a conjecture of R. Kannan"@Birget,J.-C. S@21@1989@454-466@@@"Bounded concurrent time-stamp systems are constructible"@Dolev,D.@Shavit,N. S@21@1989@467-478@@@"On the improbability of reaching Byzantine agreements"@Graham,R.L.@Yao,A.C. S@21@1989@479-489@@@"Compact distributed data structures for adaptive routing"@Awerbuch,B.@Bar-Noy,A.@Linial,N.@Peleg,D. S@21@1989@490-500@@@"Distributed shortest paths algorithms"@Awerbuch,B. S@21@1989@501-512@@@"On search, decision and the efficiency of polynomial-time algorithms"@Fellows,M.R.@Langston,M.A. S@21@1989@513-522@@@"A new fixed point approach for stable networks and stable marriages"@Feder,T. S@21@1989@523-534@@@"Strongly polynomial-time and NC algorithms for detecting cycles in dynamic graphs"@Cohen,E.@Megiddo,N. S@21@1989@535-542@@@"An $O(n sup 0.4 )$-approximation algorithm for 3-coloring (and improved approximation algorithm for k-coloring)"@Blum,A. S@21@1989@543-549@@@"Trading space for time in undirected $s$-$t$ connectivity"@Broder,A.Z.@Karlin,A.R.@Raghavan,P.@Upfal,E. S@21@1989@550-561@@@"Expanding graphs and the average-case analysis of algorithms for matchings and related problems"@Motwani,R. S@21@1989@562-574@@@"Lower bounds on the length of universal traversal sequences"@Borodin,A.@Ruzzo,W.L.@Tompa,M. S@21@1989@574-586@@@"The electrical resistance of a graph captures its commute and cover times"@Chandra,A.K.@Raghavan,P.@Ruzzo,W.L.@Smolensky,R.@Tiwari,P. S@21@1989@587-598@@@"On the second eigenvalue in random regular graphs"@Friedman,J.@Kahn,J.@Szemeredi,E. F@30@1989@2-7@@@"Simulating $(log sup c n)$-wise independence in NC"@Berger,B.@Rompel,J. F@30@1989@8-13@@@"The probabilistic method yields deterministic parallel algorithms"@Motwani,R.@Naor,J.@Naor,M. F@30@1989@14-19@@@"Dispersers, deterministic amplification, and weak random sources"@Cohen,A@Wigderson,A. F@30@1989@20-25@@@"On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications"@Siegel,A. F@30@1989@28-33@@@"The strength of weak learnability"@Schapire,R.E. F@30@1989@34-39@@@"A theory of learning simple concepts under simple distributions and average case complexity for the universal distribution"@Li,M.@Vitanyi,P.M.B. F@30@1989@40-45@@@"Generalizing the PAC model: Sample size bounds from metric dimension-based uniform convergence results"@Haussler,D. F@30@1989@46-51@@@"Learning binary relations and total orders"@Goldman,S.A.@Rivest,R.L.@Schapire,R.E. F@30@1989@54-60@@@"Efficient NC algorithms for set cover with applications to learning and geometry"@Berger,B.@Rompel,J.@Shor,P.W. F@30@1989@60-65@@@"Fast matching algorithms for points on a polygon"@Marcotte,O.@Suri,S. F@30@1989@66-71@@@"Ensemble motion planning in trees"@Frederickson,G.N.@Guan,D.J. F@30@1989@72-79@@@"An upper bound on the number of planar k-sets"@Pach,J.@Steiger,W.@Szemeredi,E. F@30@1989@82-87@@@"The inverse of an automorphism in polynomial time"@Dickerson,M. F@30@1989@88-92@@@"Testing permutation polynomials"@VonzurGathen,J. F@30@1989@93-98@@@"Computing irreducible representations of finite groups"@Babai,L.@Ronyai,L. F@30@1989@99-104@@@"Galois groups and factoring polynomials over finite fields"@Ronyai,L. F@30@1989@106-111@@@"Efficient algorithms for independent assignments on graphic and linear matroids"@Gabow,H.N.@Xu,Y. F@30@1989@112-117@@@"Flow in planar graphs with multiple sources and sinks"@Miller,G.L.@Naor,J. F@30@1989@118-123@@@"A randomized maximum-flow algorithm"@Cheriyan,J.@Hagerup,T. F@30@1989@124-128@@@"Graph products and chromatic numbers"@Linial,N.@Vazirani,U. F@30@1989@129-133@@@"Lower bounds for the stable marriage problem and its variants"@Ng,C. F@30@1989@134-139@@@"Approximation schemes for constrained scheduling problems"@Hall,L.A.@Shmoys,D.B. F@30@1989@142-147@@@"Datalog vs. first-order logic"@Ajtai,M.@Gurevich,Y. F@30@1989@148-153@@@"Decidability and expressiveness for first-order logics of probability"@Abadi,M.@Halpern,J.Y. F@30@1989@154-159@@@"Characterizations of the basic feasible functionals of finite type"@Cook,S.A.@Kapron,B.M. F@30@1989@160-163@@@"The 0-1 law fails for the class of existential second order G\*:odel sentences with equality"@Pacholski,L.@Szwast,W. F@30@1989@164-169@@@"A really temporal logic"@Alur,R.@Henzinger,T.A. F@30@1989@170-175@@@"Full abstraction for nondeterministic dataflow networks"@Russell,J.R. F@30@1989@178-183@@@"Efficient tree pattern matching"@Kosaraju,S.R. F@30@1989@184-189@@@"Pipelining computations in a tree of processors"@Kosaraju,S.R. F@30@1989@190-196@@@"Sorting on a parallel pointer machine with applications to set expression evaluation"@Goodrich,M.T.@Kosaraju,S.R. F@30@1989@196-202@@@"Recursive *-tree parallel data-structure"@Berkman,O.@Vishkin,U. F@30@1989@204-209@@@"Computational complexity of roots of real functions"@Ko,K. F@30@1989@210-215@@@"On the complexity of fixed parameter problems"@Abrahamson,K.R.@Ellis,J.A.@Fellows,M.R.@Mata,M.E. F@30@1989@216-221@@@"Structure in locally optimal solutions"@Krentel,M.W. F@30@1989@222-227@@@"Decision versus search problems in super-polynomial time"@Impagliazzo,R.@Tardos,G. F@30@1989@230-235@@@"One-way functions are essential for complexity based cryptography"@Impagliazzo,R.@Luby,M. F@30@1989@236-243@@@"Efficient cryptographic schemes provably as secure as subset sum"@Impagliazzo,R.@Naor,M. F@30@1989@242-247@@@"Lower bounds for pseudorandom number generators"@Kharitonov,M.@Goldberg,A.V.@Yung,M. F@30@1989@248-253@@@"How to recycle random bits"@Impagliazzo,R.@Zuckerman,D. F@30@1989@256-261@@@"The weighted majority algorithm"@Littlestone,N.@Warmuth,M.K. F@30@1989@262-267@@@"On the complexity of learning from counterexamples"@Maass,W.@Turan,Gy. F@30@1989@268-273@@@"The equivalence and learning of probabilistic automata"@Tzeng,W. F@30@1989@274-279@@@"Planning and learning in permutation groups"@Fiat,A.@Moses,S.@Shamir,A.@Shimshoni,I.@Tardos,G. F@30@1989@282-287@@@"An optimal parallel algorithm for graph planarity"@Ramachandran,V.@Reif,J. F@30@1989@288-293@@@"Efficient parallel algorithms for testing connectivity and finding disjoint s-t paths in graphs"@Khuller,S.@Schieber,B. F@30@1989@294-299@@@"The parallel complexity of the subgraph connectivity problem"@Kirousis,L.@Serna,M.@Spirakis,P. F@30@1989@300-305@@@"Processor efficient parallel algorithms for the two disjoint paths problem, and for finding a Kuratowski homeomorph"@Khuller,S.@Mitchell,S.G.@Vazirani,V.V. F@30@1989@308-313@@@"Lower bounds for algebraic computation trees with integer inputs"@Yao,A.C. F@30@1989@314-319@@@"Simplification of nested radicals"@Landau,S. F@30@1989@320-324@@@"Generalizing the continued fraction algorithm to arbitrary dimensions"@Just,B. F@30@1989@325-330@@@"The complexity of approximating the square root"@Mansour,Y.@Schieber,B.@Tiwari,P. F@30@1989@332-337@@@"Speeding-up linear programming using fast matrix multiplication"@Vaidya,P.M. F@30@1989@338-343@@@"A new algorithm for minimizing convex functions over convex sets"@Vaidya,P.M. F@30@1989@344-349@@@"Asymptotically fast algorithms for spherical and related transforms"@Driscoll,J.R.@Healy,D.M,Jr. F@30@1989@350-355@@@"Interior-point methods in parallel computation"@Goldberg,A.V.@Plotkin,S.A.@Shmoys,D.B.@Tardos,E. F@30@1989@358-363@@@"Polynomial end-to-end communication"@Awerbuch,B.@Mansour,Y.@Shavit,N. F@30@1989@364-369@@@"Network decomposition and locality in distributed computation"@Awerbuch,B.@Goldberg,A.V.@Luby,M.@Plotkin,S.A. F@30@1989@370-375@@@"Upper and lower bounds for routing schemes in dynamic networks"@Afek,Y.@Gafni,E.@Ricklin,M. F@30@1989@376-381@@@"The synchronization of nonuniform networks of finite automata"@Jiang,T. F@30@1989@384-389@@@"Expanders might be practical: Fast algorithms for routing around faults on multibutterflies"@Leighton,T.@Maggs,B. F@30@1989@390-395@@@"Efficient simulations of small shared memories on bounded degree networks"@Herley,K.T. F@30@1989@396-401@@@"On the network complexity of selection"@Plaxton,C.G. F@30@1989@402-407@@@"Power of fast VLSI models is insensitive to wires' thinness"@Itkis,G.@Levin,L.A. F@30@1989@410-415@@@"Towards optimal distributed consensus"@Berman,P.@Garay,J.A.@Perry,K.J. F@30@1989@416-421@@@"Privacy and communication complexity"@Kushilevitz,E. F@30@1989@422-427@@@"Solvability in asynchronous environments"@Chor,B.@Moscovici,L. F@30@1989@428-433@@@"Multiparty Communication Complexity"@Dolev,D.@Feder,T. F@30@1989@436-441@@@"Incremental planarity testing"@DiBattista,G.@Tamassia,R. F@30@1989@442-447@@@"Generating random spanning trees"@Broder,A. F@30@1989@448-453@@@"Using cellular graph embeddings in solving all pairs shortest paths problems"@Frederickson,G.N. F@30@1989@454-459@@@"An efficient parallel algorithm for the minimal elimination ordering (meo) of an arbitrary graph"@Dahlhaus,E.@Karpinski,M. F@30@1989@462-467@@@"On the complexity of space bounded interactive proofs"@Condon,A.@Lipton,R.J. F@30@1989@468-473@@@"Multiparty computation with faulty majority"@Beaver,D.@Goldwasser,S. F@30@1989@474-479@@@"Minimum resource zero-knowledge proofs"@Kilian,J.@Micali,S.@Ostrovsky,R. F@30@1989@480-485@@@"On the power of 2-way probabilistic finite state automata"@Dwork,C.@Stockmeyer,L. F@30@1989@488-494@@@"Dynamically computing the maxima of decomposable functions, with applications"@Dobkin,D.@Suri,S. F@30@1989@494-499@@@"Stable maintenance of point set triangulations in two dimensions"@Fortune,S. F@30@1989@500-505@@@"Double precision geometry: A general technique for calculating line and segment intersections using rounded arithmetic"@Milenkovic,V. F@30@1989@506-511@@@"Area-optimal three-layer channel routing"@Kuchem,R.@Wagner,D.@Wagner,F. F@30@1989@514-519@@@"On the computational power of PP and \(O+P"@Toda,S. F@30@1989@520-525@@@"An analogue of the Myhill-Nerode theorem and its use in computing finite-basis characterizations"@Fellows,M.R.@Langston,M.A. F@30@1989@526-531@@@"Conductance and convergence of Markov chains \(en A combinatorial treatment of expanders"@Mihail,M. F@30@1989@532-537@@@"Lower bounds for constant depth circuits in the presence of help bits"@Cai,J. F@30@1989@540-545@@@"Randomized search trees"@Aragon,C.R.@Seidel,R.G. F@30@1989@546-548@@@"On the complexity of a game related to the dictionary problem"@Mehlhorn,K.@Naher,S.@Rauch,M. F@30@1989@549-554@@@"Space-efficient static trees and graphs"@Jacobson,G. F@30@1989@555-559@@@"Twists, turns, cascades, deque conjecture, and scanning theorem"@Sundar,R. F@30@1989@562-567@@@"Probabilistic communication complexity of Boolean relations"@Raz,R.@Wigderson,A. F@30@1989@568-573@@@"Subquadratic simulations of circuits by branching programs"@Cai,J.@Lipton,R.J. F@30@1989@574-579@@@"Constant depth circuits, Fourier transform, and learnability"@Linial,N.@Mansour,Y.@Nisan,N. F@30@1989@580-584@@@"A note on the power of threshold circuits"@Allender,E. F@30@1989@586-591@@@"An optimal algorithm for intersecting three-dimensional convex polyhedra"@Chazelle,B. F@30@1989@592-597@@@"On obstructions in relation to a fixed viewpoint"@Mulmuley,K. F@30@1989@598-603@@@"Output-sensitive hidden surface removal"@Overmars,M.@Sharir,M. F@30@1989@604-609@@@"Approximation algorithms for geometric embeddings in the plane with applications to parallel processing problems"@Hansen,M.D. F@30@1989@612-617@@@"An optimal lower bound on the number of variables for graph identification"@Cai,J.@Furer,M.@Immerman,N. F@30@1989@618-623@@@"On reversal complexity for alternating Turing machines"@Liskiewicz,M.@Lorys,K. F@30@1989@624-629@@@"Every polynomial-time 1-degree collapses iff P = PSPACE"@Fenner,S.A.@Kurtz,S.A.@Royer,J.S. S@22@1990@1-7@@@"BLASTING through the information theoretic barrier with FUSION TREES"@Fredman,M.L.@Willard,D.E. S@22@1990@8-17@@@"On the dynamic finger conjecture for splay trees"@Cole,R. S@22@1990@18-25@@@"Unique binary search tree representations and equality-testing of sets and sequences"@Sundar,R.@Tarjan,R.E. S@22@1990@26-33@@@"The information theory bound is tight for selection in a heap"@Frederickson,G.N. S@22@1990@34-44@@@"Lower bounds for the union-find and the split-find problem on pointer machines"@LaPoutre,J.A. S@22@1990@45-53@@@"Optimal randomized algorithms for local sorting and set-maxima"@Goddard,W.@King,V.@Schulman,L. S@22@1990@54-63@@@"On the necessity of Occam algorithms"@Board,R.@Pitt,L. S@22@1990@64-72@@@"Learning Boolean functions in an infinite atribute space"@Blum,A. S@22@1990@73-83@@@"Self-testing/correcting with applications to numerical problems"@Blum,M.@Luby,M.@Rubinfeld,R. S@22@1990@84-94@@@"Coherent functions and program checkers"@Yao,A.C.-C. S@22@1990@95-105@@@"The use of a synchronizer yields maximum computation rate in distributed networks"@Even,S.@Rajsbaum,S. S@22@1990@106-116@@@"The wakeup problem"@Fischer,M.J.@Moran,S.@Rudich,S.@Taubenfeld,G. S@22@1990@117-127@@@"How to distribute a dictionary in a complete network"@Dietzfelbinger,M.@MeyeraufderHeide,F. S@22@1990@128-137@@@"Computing with unreliable information"@Feige,U.@Peleg,D.@Raghavan,P.@Upfal,E. S@22@1990@138-148@@@"Efficient robust parallel computations"@Kedem,Z.M.@Palem,K.V.@Spirakis,P.G. S@22@1990@149-158@@@"On-line algorithms for path selection in a nonblocking network"@Arora,S.@Leighton,T.@Maggs,B. S@22@1990@159-169@@@"Optimal disk I/O with parallel block transfer"@Vitter,J.S.@Shriver,E.A.M. S@22@1990@170-180@@@"Deterministic sampling \(em A new technique for fast pattern matching"@Vishkin,U. S@22@1990@181-192@@@"Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs"@Kao,M.-Y.@Klein,P.N. S@22@1990@193-203@@@"Deterministic sorting in nearly logarithmic time on the hypercube and related computers"@Cypher,R.@Plaxton,C.G. S@22@1990@204-212@@@"Psuedorandom generators for space-bounded computation"@Nisan,N. S@22@1990@213-223@@@"Small-bias probability spaces: Efficient constructions and applications"@Naor,J.@Naor,M. S@22@1990@224-234@@@"The analysis of closed hashing under limited randomness"@Schmidt,J.P.@Siegel,A. S@22@1990@235-243@@@"The computational complexity of universal hashing"@Mansour,Y.@Nisan,N.@Tiwari,P. S@22@1990@244-253@@@"Not all keys can be hashed in constant time"@Gil,J.@MeyeraufderHeide,F.@Wigderson,A. S@22@1990@254-259@@@"A technique for lower bounding the cover time"@Zuckerman,D. S@22@1990@260-270@@@"Approximate inclusion-exclusion"@Linial,N.@Nisan,N. S@22@1990@271-277@@@"Towards optimal simulations of formulas by bounded-width programs"@Cleve,R. S@22@1990@278-286@@@"Functions with bounded symmetric communication complexity and circuits with mod m gates"@Szegedy,M. S@22@1990@287-292@@@"Monotone circuits for matching require linear depth"@Raz,R.@Wigderson,A. S@22@1990@293-299@@@"A separator theorem for graphs with an excluded minor and its applications"@Alon,N.@Seymour,P.@Thomas,R. S@22@1990@300-309@@@"Separators in two and three dimensions"@Miller,G.L.@Thurston,W. S@22@1990@310-321@@@"Leighton-Rao might be practical: Faster approximation algorithms for concurrent flow with uniform capacities"@Klein,P.@Stein,C.@Tardos,E. S@22@1990@322-330@@@"Output sensitive construction of levels and Voronoi diagrams in $R sup d$ of order 1 to $k$"@Mulmuley,K. S@22@1990@331-340@@@"Solving query-retrieval problems by compacting Voronoi diagrams"@Aggarwal,A.@Hansen,M.@Leighton,T. S@22@1990@341-351@@@"Quantitative Steinitz's theorems with applications to multifingered grasping"@Kirkpatrick,D.G.@Mishra,B.@Yap,C.K. S@22@1990@352-358@@@"An optimal algorithm for on-line bipartite matching"@Karp,R.M.@Vazirani,U.V.@Vazirani,V.V. S@22@1990@359-368@@@"Online algorithms for locating checkpoints"@Bern,M.@Greene,D.H.@Raghunathan,A.@Sudan,M. S@22@1990@369-378@@@"Random walks on weighted graphs, and applications to on-line algorithms"@Coppersmith,D.@Doyle,P.@Raghavan,P.@Snir,M. S@22@1990@379-386@@@"On the power of randomization in online algorithms"@Ben-David,S.@Borodin,A.@Karp,R.@Tardos,G.@Wigderson,A. S@22@1990@387-394@@@"One-way functions are necessary and sufficient for secure signatures"@Rompel,J. S@22@1990@395-404@@@"Pseudo-random generators under uniform assumptions"@Hastad,J. S@22@1990@405-415@@@"The discrete log is very discreet"@Schrift,A.W.@Shamir,A. S@22@1990@416-426@@@"Witness indistinguishable and witness hiding protocols"@Feige,U.@Shamir,A. S@22@1990@427-437@@@"Public-key cryptosystems provably secure against chosen ciphertext attacks"@Naor,M.@Yung,M. S@22@1990@438-445@@@"On the complexity of local search"@Papadimitriou,C.H.@Schaffer,A.A.@Yannakakis,M. S@22@1990@446-456@@@"Quantifiers and approximation"@Panconesi,A.@Ranjan,D. S@22@1990@457-467@@@"On polynomial time bounded truth-table reducibility of NP sets to sparse sets"@Ogiwara,M.@Watanabe,O. S@22@1990@468-476@@@"The undecidability of the semi-unification problem"@Kfoury,A.J.@Tiuryn,J.@Urzyczyn,P. S@22@1990@477-481@@@"Decidability of the multiplicity equivalence of multitape finite automata"@Harju,T.@Karhumaki,J. S@22@1990@482-493@@@"Perfect zero-knowledge in constant rounds"@Bellare,M.@Micali,S.@Ostrovsky,R. S@22@1990@494-502@@@"The (true) complexity of statistical zero knowledge"@Bellare,M.@Micali,S.@Ostrovsky,R. S@22@1990@503-513@@@"The round complexity of secure protocols"@Beaver,D.@Micali,S.@Rogaway,P. S@22@1990@514-523@@@"Efficient computation on oblivious RAMs"@Ostrovsky,R. S@22@1990@524-534@@@"Computing in quotient groups"@Kantor,W.M.@Luks,E.M. S@22@1990@535-545@@@"On the decidability of sparse univariate polynomial interpolation"@Borodin,A.@Tiwari,P. S@22@1990@546-554@@@"Searching for primitive roots in finite fields"@Shoup,V. S@22@1990@555-563@@@"On the complexity of computing a Gr\*:obner basis for the radical of a zero dimensional ideal"@Lakshman,Y.N. S@22@1990@564-572@@@"The number field sieve"@Lenstra,A.K.@Lenstra,H.W.,Jr.@Manasse,M.S.@Pollard,J.M. F@31@1990@2-10@@@"Algebraic methods for interactive proof systems"@Lund,C.@Fortnow,L.@Karloff,H.@Nisan,N. F@31@1990@11-15@@@"IP = PSPACE"@Shamir,A. F@31@1990@16-25@@@"Non-deterministic exponential time has two-prover interactive protocols"@Babai,L.@Fortnow,L.@Lund,C. F@31@1990@26-34@@@"A characterization of #P arithmetic straight line programs"@Babai,L.@Fortnow,L. F@31@1990@36-45@@@"Perfectly secure message transmission"@Dolev,D.@Dwork,C.@Waarts,O.@Yung,M. F@31@1990@46-54@@@"Coin-flipping games immune against linear-sized coalitions"@Alon,N.@Naor,M. F@31@1990@55-64@@@"Are wait-free algorithms fast?"@Attiya,H.@Lynch,N.@Shavit,N. F@31@1990@65-74@@@"A dining philosophers algorithm with polynomial response time"@Awerbuch,B.@Saks,M. F@31@1990@76-85@@@"An approach for proving lower bounds: Solution of Gilbert-Pollak's conjecture on Steiner ratio"@Du,D.-Z.@Hwang,F.K. F@31@1990@86-95@@@"Drawing graphs in the plane with high resolution"@Formann,M.@Hagerup,T.@Haralambides,J.@Kaufmann,M.@Leighton,F.T.@Simvonis,A.@Welzl,E.@Woeginger,G. F@31@1990@96-105@@@"New results on dynamic planar point location"@Cheng,S.W.@Janardan,R. F@31@1990@106-114@@@"The computability and complexity of optical beam tracing"@Reif,J.H.@Tygar,J.D.@Yoshida,A. F@31@1990@116-124@@@"Approximate string matching in sublinear expected time"@Chang,W.I.@Lawler,E.L. F@31@1990@125-134@@@"Towards a DNA sequencing theory (Learning a string)"@Li,M. F@31@1990@135-144@@@"On the exact complexity of string matching"@Colussi,L.@Galil,Z.@Giancarlo,R. F@31@1990@145-150@@@"Faster tree pattern matching"@Dubiner,M.@Galil,Z.@Magen,E. F@31@1990@152-162@@@"Specified precision polynomial root isolation is in NC"@Neff,C.A. F@31@1990@163-172@@@"A tree-partitioning technique with applications to expression evaluation and term matching"@Kosaraju,S.R.@Delcher,A.L. F@31@1990@173-182@@@"Efficient parallel algorithms for tree-decomposition and related problems"@Lagergren,J. F@31@1990@186-192@@@"Learning comjunctions of Horn clauses"@Angluin,D.@Frazier,M.@Pitt,L. F@31@1990@193-202@@@"Exact identification of circuits using fixed points of amplification functions"@Goldman,S.A.@Kearns,M.J.@Schapire,R.E. F@31@1990@203-210@@@"On the complexity of learning from counterexamples and membership queries"@Maass,W.@Turan,Gy. F@31@1990@211-218@@@"Separating distribution-free and mistake-bound learning models over the Boolean domain"@Blum,A. F@31@1990@220-230@@@"Triangulating a simple polygon in linear time"@Chazelle,B. F@31@1990@231-241@@@"Provably good mesh generation"@Bern,M.@Eppstein,D.@Gilbert,J. F@31@1990@242-251@@@"Counting and cutting cycles of lines and rods in space"@Chazelle,B.@Edelsbrunner,H.@Guibas,L.J.@Pollack,R.@Seidel,R.@Sharir,M.@Snoeyink,J. F@31@1990@252-261@@@"Hidden surface removal for axis-parallel polyhedra"@deBerg,M.@Overmars,M.H. F@31@1990@264-274@@@"A (fairly) simple circuit that (usually) sorts"@Leighton,T.@Plaxton,C.G. F@31@1990@275-284@@@"Fault tolerant sorting network"@Assaf,S.@Upfal,E. F@31@1990@285-296@@@"Asymptotically tight bounds for computing with faulty arrays of processors"@Kaklamanis,C.@Karlin,A.R.@Leighton,F.T.@Milenkovic,V.@Raghavan,P.@Rao,S.@Thomborson,C.@Tsantilas,A. F@31@1990@297-306@@@"Deterministic on-line routing on area-universal networks"@Bay,P.@Bilardi,G. F@31@1990@308-317@@@"Multiple non-interactive zero knowledge proofs based on a single random string"@Feige,U.@Lapidot,D.@Shamir,A. F@31@1990@318-326@@@"Security preserving amplification of hardness"@Goldreich,O.@Impagliazzo,R.@Levin,L.@Venkatesan,R.@Zuckerman,D. F@31@1990@327-334@@@"Efficiently inverting bijections given by straight line programs"@Sturtivant,C.@Zhang,Z.-L. F@31@1990@335-344@@@"Private computations over the integers"@Chor,B.@Gereb-Graus,M.@Kushilevitz,E. F@31@1990@346-354@@@"The mixing rate of Markov chains, an isoperimetric inequality, and computing the volume"@Lovasz,L.@Simonovits,M. F@31@1990@355-361@@@"Exploring an unknown graph"@Deng,X.@Papadimitriou,C.H. F@31@1990@362-371@@@"Inferring evolutionary history from DNA sequences"@Kannan,S.@Warnow,T. F@31@1990@372-379@@@"Permuting"@Fich,F.E.@Munro,J.I.@Poblete,P.V. F@31@1990@382-391@@@"Efficient distribution-free learning of probabilistic concepts"@Kearns,M.J.@Schapire,R.E. F@31@1990@392-396@@@"A Markovian extension of Valiant's learning model"@Aldous,D.@Vazirani,U. F@31@1990@397-404@@@"On threshold circuits for parity"@Paturi,R.@Saks,M.E. F@31@1990@405-410@@@"Robust separations in inductive inference"@Fulk,M.A. F@31@1990@412-419@@@"A time-space tradeoff for Boolean matrix multiplication"@Abrahamson,K. F@31@1990@420-428@@@"Communication-space tradeoffs for unrestricted protocols"@Beame,P.@Tompa,M.@Yan,P. F@31@1990@429-438@@@"Time-space tradeoffs for undirected graph traversal"@Beame,P.@Borodin,A.@Raghavan,P.@Ruzzo,W.L.@Tompa,M. F@31@1990@439-448@@@"Constructing generalized universal traversing sequences of polynomial size for graphs with small diameter"@Istrail,S. F@31@1990@454-463@@@"Competitive $k$-server algorithms"@Fiat,A.@Rabani,Y.@Ravid,Y. F@31@1990@464-469@@@"Randomized online graph coloring"@Vishwanathan,S. F@31@1990@470-479@@@"Coloring inductive graphs on-line"@Irani,S. F@31@1990@480-489@@@"Online algorithms for finger searching"@Cole,R.@Raghunathan,A. F@31@1990@492-502@@@"Communication-optimal maintenance of replicated information"@Awerbuch,B.@Cidon,I.@Kutten,S. F@31@1990@503-513@@@"Sparse partitions"@Awerbuch,B.@Peleg,D. F@31@1990@514-522@@@"Network synchronization with polylogarithmic overhead"@Awerbuch,B.@Peleg,D. F@31@1990@534-543@@@"General weak random sources"@Zuckerman,D. F@31@1990@544-553@@@"Simple constructions of almost $k$-wise independent random variables"@Alon,N.@Goldreich,O.@Hastad,J.@Peralta,R. F@31@1990@554-562@@@"Some tools for approximate 3-coloring"@Blum,A. F@31@1990@563-572@@@"Randomness in interactive proofs"@Bellare,M.@Goldreich,O.@Goldwasser,S. F@31@1990@574-582@@@"Parallel linear programming in fixed dimension almost surely in constant time"@Alon,N.@Megiddo,N. F@31@1990@583-589@@@"Reducing the parallel complexity of certain linear programming problems"@Vaidya,P.M. F@31@1990@590-599@@@"Asynchronous PRAMs are (almost) as good as synchronous PRAMs"@Martel,C.@Subramonian,R.@Park,A. F@31@1990@600-608@@@"Uniform memory hierarchies"@Alpern,B.@Carter,L.@Feig,E. F@31@1990@610-618@@@"On the power of small-depth threshold circuits"@Hastad,J.@Goldmann,M. F@31@1990@619-627@@@"On ACC and threshold circuits"@Yao,A.C.-C. F@31@1990@628-631@@@"On interpolation by analytic functions with special properties and some weak lower bounds on the size of circuits with symmetric gates"@Smolensky,R. F@31@1990@632-641@@@"Polynomial threshold functions, $AC sup 0$ functions and spectral norms"@Bruck,J.@Smolensky,R. F@31@1990@642-650@@@"Faster circuits and shorter formulae for multiple addition, multiplication and symmetric Boolean functions"@Paterson,M.S.@Pippenger,N.@Zwick,U. F@31@1990@652-661@@@"Deciding properties of nonregular programs"@Harel,D.@Raz,D. F@31@1990@662-671@@@"Decision problems for propositional linear logic"@Lincoln,P.@Michell,J.@Scedrov,A.@Shankar,N. F@31@1990@672-682@@@"Tight bounds on the complexity of cascaded decomposition of automata"@Maler,O.@Pnueli,A. F@31@1990@683-688@@@"Finite-memory automata"@Kaminski,M.@Francez,N. F@31@1990@689-696@@@"Probabilities of sentences about very sparse random graphs"@Lynch,J.F. F@31@1990@698-707@@@"A fast algorithm for optimally increasing the edge-connectivity"@Naor,D.@Gusfield,D.@Martel,C. F@31@1990@708-718@@@"Augmenting graphs to meet edge-connectivity requirements"@Frank,A. F@31@1990@719-725@@@"Trans-dichotomous algorithms for minimum spanning trees and shortest paths"@Fredman,M.L.@Willard,D.E. F@31@1990@726-737@@@"Approximation through multicommodity flow"@Klein,P.@Agrawal,A.@Ravi,R.@Rao,S. F@31@1990@740-745@@@"Computing with snakes in directed networks of automata"@Even,S.@Litman,A.@Winkler,P. F@31@1990@746-757@@@"Distributed reactive systems are hard to synthesize"@Pnueli,A.@Rosner,R. F@31@1990@758-765@@@"Communication complexity of algebraic computation"@Luo,Z.-Q.@Tsitsiklis,J.N. F@31@1990@766-775@@@"Bounds on tradeoffs between randomness and communication complexity"@Canetti,R.@Goldreich,O. F@31@1990@778-787@@@"The complexity of finding medians"@Toda,S. F@31@1990@788-793@@@"On the predictability of coupled automata: An allegory about chaos"@Buss,S.@Papadimitriou,C.H.@Tsitsiklis,J.N. F@31@1990@794-801@@@"On graph-theoretic lemmata and complexity classes"@Papadimitriou,C.H. F@31@1990@802-811@@@"Matrix decomposition problem is complete for the average case"@Gurevich,Y. F@31@1990@812-821@@@"No better ways to generate hard NP instances than picking uniformly at random"@Impagliazzo,R.@Levin,L.A. F@31@1990@824-829@@@"Complexity of unification in free groups and free semi-groups"@Koscielski,A.@Pacholski,L. F@31@1990@830-839@@@"The lattice reduction algorithm of Gauss: An average case analysis"@Vallee,B.@Flajolet,P. F@31@1990@840-846@@@"Interpolation of sparse rational functions without knowing bounds on exponents"@Grigoriev,D.Yu.@Karpinski,M.@Singer,M.F. F@31@1990@847-856@@@"Simplifying nested radicals and solving polynomials by radicals in minimum depth"@Horng,G.@Huang,M.-D.A. F@31@1990@857-865@@@"On the diameter of finite groups"@Babai,L.@Hetyei,G.@Kantor,W.M.@Lubotzky,A.@Seress,A. F@31@1990@871-881@@@"Some triply-logarithmic parallel algorithms"@Berkman,O.@Ja'Ja',J.@Krishnamurthy,S.@Thurimella,R.@Vishkin,U. S@23@1991@1-9@@@"PP is closed under intersection"@Beigel,R.@Reingold,N.@Spielman,D. S@23@1991@10-20@@@"Integral equations, systems of quadratic equations, and exponential-time completeness"@Ko,K. S@23@1991@21-31@@@"Checking computations in polylogarithmic time"@Babai,L.@Fortnow,L.@Levin,L.A.@Szegedy,M. S@23@1991@32-42@@@"Self-testing/correcting for polynomials and for approximate functions"@Gemmell,P.@Lipton,R.@Rubinfeld,R.@Sudan,M.@Wigderson,A. S@23@1991@43-53@@@"Deterministic algorithms for undirected s-t connectivity using polynomial time and sublinear space"@Barnes,G.@Ruzzo,W.L. S@23@1991@54-63@@@"Effective Noether irreducibility forms and applications"@Kaltofen,E. S@23@1991@64-71@@@"Factoring numbers using singular integers"@Adleman,L. S@23@1991@72-79@@@"Constructing nonresidues in finite fields and the extended Riemann hypothesis"@Buchmann,J.@Shoup,V. S@23@1991@80-89@@@"Reducing elliptic curve logarithms to logarithms in a finite field"@Menezes,A.@Vanstone,S.@Okamoto,T. S@23@1991@90-100@@@"Fast Monte Carlo algorithms for permutation groups"@Babai,L.@Cooperman,G.@Finkelstein,L.@Luks,E.@Seress,A. S@23@1991@101-111@@@"Fast approximation algorithms for multicommodity flow problems"@Leighton,T.@Makedon,F.@Plotkin,S.@Stein,C.@Tardos,E.@Tragoudas,S. S@23@1991@112-122@@@"A matroid approach to finding edge connectivity and packing arborescences"@Gabow,H.N. S@23@1991@123-133@@@"Clique partitions, graph compression, and speeding-up algorithms"@Feder,T.@Motwani,R. S@23@1991@134-144@@@"When trees collide: An approximation algorithm for the generalized Steiner problem on networks"@Agrawal,A.@Klein,P.@Ravi,R. S@23@1991@145-155@@@"Improved algorithms for linear inequalities with two variables per inequality"@Cohen,E.@Megiddo,N. S@23@1991@156-163@@@"Sampling and integration of near log-concave functions"@Applegate,D.@Kannan,R. S@23@1991@164-174@@@"Local expansion of vertex-transitive graphs and random generation in finite groups"@Babai,L. S@23@1991@175-181@@@"Counting linear extensions is #P-complete"@Brightwell,G.@Winkler,P. S@23@1991@182-189@@@"Finding hidden Hamiltonian cycles"@Broder,A.Z.@Frieze,A.M.@Shamir,E. S@23@1991@190-197@@@"Probabilistic recurrence relations"@Karp,R.M. S@23@1991@198-208@@@"Separating concurrent languages with categories of language embeddings"@Shapiro,E. S@23@1991@209-219@@@"Generic computation and its complexity"@Abiteboul,S.@Vianu,V. S@23@1991@220-229@@@"Hamiltonian paths in infinite graphs"@Harel,D. S@23@1991@230-240@@@"Fundamental discrepancies between average-case analyses under discrete and continuous distributions: A bin packing case study"@Coffman,E.G.,Jr.@Courcoubetis,C.A.@Garey,M.R.@Johnson,D.S.@McGeoch,L.A.@Shor,P.W.@Weber,R.R.@Yannakakis,M. S@23@1991@241-248@@@"Proof of the 4/3 conjecture for preemptive vs. nonpreemptive two-processor scheduling"@Coffman,E.G.,Jr.@Garey,M.R. S@23@1991@249-259@@@"Competitive paging with locality of reference"@Borodin,A.@Irani,S.@Raghavan,P.@Schieber,B. S@23@1991@260-266@@@"The harmonic online $K$-server algorithm is competitive"@Grove,E. S@23@1991@267-277@@@"A model for data in motion"@Kahan,S. S@23@1991@278-288@@@"Lower bounds for randomized $k$-server and motion planning algorithms"@Karloff,H.@Rabani,Y.@Ravid,Y. S@23@1991@289-298@@@"Infinite games, randomization, computability, and applications to online problems"@Deng,X.@Mahajan,S. S@23@1991@299-306@@@"Constant-time parallel integer sorting"@Hagerup,T. S@23@1991@307-316@@@"Converting high probability into nearly-constant time, with applications to parallel hashing"@Matias,Y.@Vishkin,U. S@23@1991@317-327@@@"Fully dynamic algorithms for edge-connectivity problems"@Galil,Z.@Italiano,G.F. S@23@1991@328-336@@@"Linear approximation of shortest superstrings"@Blum,A.@Jiang,T.@Li,M.@Tromp,J.@Yannakakis,M. S@23@1991@337-347@@@"An efficient algorithm for the genus problem with explicit construction of forbidden subgraphs"@Djidjev,H.@Reif,J. S@23@1991@348-358@@@"Counting networks and multi-processor coordination"@Aspnes,J.@Herlihy,M.@Shavit,N. S@23@1991@359-369@@@"Bounds on the time to reach agreement in the presence of timing uncertainty"@Attiya,H.@Dwork,C.@Lynch,N.@Stockmeyer,L. S@23@1991@370-380@@@"Wait-free parallel algorithms for the union-find problem"@Anderson,R.J.@Woll,H. S@23@1991@381-390@@@"Combining tentative and definite executions for very fast dependable parallel computing"@Kedem,Z.M.@Palem,K.V.@Raghunathan,A.@Spirakis,P.G. S@23@1991@391-401@@@"Algorithms for parallel $k$-vertex connectivity and sparse certificates"@Cheriyan,J.@Thurimella,R. S@23@1991@402-409@@@"The expressive power of voting polynomials"@Aspnes,J.@Beigel,R.@Furst,M.@Rudich,S. S@23@1991@410-418@@@"Lower bounds for non-commutative computation"@Nisan,N. S@23@1991@419-429@@@"Rounds in communication complexity revisited"@Nisan,N.@Wigderson,A. S@23@1991@430-438@@@"On deterministic approximation of DNF"@Luby,M.@Velickovic,B. S@23@1991@439-443@@@"A lower bound for parallel string matching"@Breslauer,D.@Galil,Z. S@23@1991@444-454@@@"When won't membership queries help"@Angluin,D.@Kharitonov,M. S@23@1991@455-464@@@"Learning decision trees using the Fourier sprectrum"@Kushilevitz,E.@Mansour,Y. S@23@1991@465-475@@@"On-line learning of linear functions"@Littlestone,N.@Long,P.M.@Warmuth,M.K. S@23@1991@476-485@@@"Testing finite state machines"@Yannakakis,M.@Lee,D. S@23@1991@486-493@@@"Searching in the presence of linearly bounded errors"@Aslam,J.A.@Dhagat,A. S@23@1991@494-504@@@"Navigating in unfamiliar geometric terrain"@Blum,A.@Raghavan,P.@Schieber,B. S@23@1991@505-511@@@"Approximations and optimal geometric divide-and-conquer"@Matousek,J. S@23@1991@512-522@@@"Hidden surface removal with respect to a moving view point"@Mulmuley,K. S@23@1991@523-533@@@"Dynamic trees and dynamic point location"@Goodrich,M.T.@Tamassia,R. S@23@1991@534-541@@@"Rigorous time/space tradeoffs for inverting functions"@Fiat,A.@Naor,M. S@23@1991@542-552@@@"Non-malleable cryptography"@Dolev,D.@Dwork,C.@Naor,M. S@23@1991@553-560@@@"A general completeness theorems for 2-party games"@Kilian,J. S@23@1991@561-571@@@"Perfect cryptographic security from partially independent channels"@Maurer,U.M. F@32@1991@2-12@@@"Approximating clique is almost NP-Complete"@Feige,U.@Goldwasser,S.@Lovasz,L.@Safra,S.@Szegedy,M. F@32@1991@13-18@@@"Fully parallelized multi prover protocols for NEXP-time"@Lapidot,D.@Shamir,A. F@32@1991@19-28@@@"Languages that are easier than their proofs"@Beigel,R.@Bellare,M.@Feigenbaum,J.@Goldwasser,S. F@32@1991@29-38@@@"An optimal convex hull algorithm and new results on cuttings"@Chazelle,B. F@32@1991@39-48@@@"The art gallery theorem for polygons with holes"@Hoffman,F.@Kaufmann,M.@Kriegel,K. F@32@1991@49-58@@@"Fat triangles determine linearly many holes"@Matousek,J.@Miller,N.@Pach,J.@Sharir,M.@Sifrony,S.@Welzl,E. F@32@1991@59-68@@@"Quantifying knowledge complexity"@Goldreich,O.@Petrank,E. F@32@1991@69-78@@@"Subquadratic zero-knowledge"@Boyar,J.@Brassard,G.@Peralta,R. F@32@1991@79-89@@@"Simulating BPP using a general weak random source"@Zuckerman,D. F@32@1991@90-99@@@"Checking the correctness of memories"@Blum,M@Evans,W.@Gemmell,P.@Kannan,S.@Naor,M. F@32@1991@100-110@@@"On-line scheduling in the presence of overload"@Baruah,S.@Koren,G.@Mishra,B.@Raghunathan,A.@Rosier,L.@Shasha,D. F@32@1991@111-120@@@"Dynamic scheduling on parallel machines"@Feldmann,A.@Sgall,J.@Teng,S.-H. F@32@1991@121-130@@@"Optimal prefetching via data compression"@Vitter,J.S.@Krishnan,P. F@32@1991@131-140@@@"Scheduling parallel machines on-line"@Shmoys,D.B.@Wein,J.@Williamson,D.P. F@32@1991@141-150@@@"Concentrated regular data streams on grids: sorting and routing near to the bisection bound"@Kunde,M. F@32@1991@151-162@@@"Communication complexity for parallel divide-and-conquer"@Wu,I.-C.@Kung,H.T. F@32@1991@163-169@@@"On selecting a satisfying truth assignment"@Papadimitriou,C.H. F@32@1991@170-179@@@"Exact learning of read-twice DNF formulas"@Aizenstein,H.@Pitt,L. F@32@1991@180-196@@@"Randomized multidimensional search trees: lazy balancing and dynamic shuffling"@Mulmuley,K. F@32@1991@197-206@@@"Dynamic maintenance of geometric structures made easy"@Schwarzkopf,O. F@32@1991@207-215@@@"Reporting points in halfspaces"@Matousek,J. F@32@1991@216-227@@@"Randomized multidimensional search trees: further results in dynamic sampling"@Mulmuley,K. F@32@1991@228-238@@@"Interactive communication: balanced distributions, correlated files, and average-case complexity"@Orlitsky,A. F@32@1991@239-248@@@"Amortized communication complexity"@Feder,T.@Kushilevitz,E.@Naor,M. F@32@1991@249-257@@@"Communication complexity towards lower bounds on circuit depth"@Edmonds,J.@Rudich,S.@Impagliazzo,R.@Sgall,J. F@32@1991@258-267@@@"Distributed program checking: a paradigm for building self-stabilizing distributed protocols"@Awerbuch,B.@Varghese,G. F@32@1991@268-277@@@"Self-stabilization by local checking and correction"@Awerbuch,B.@Patt-Shamir,B.@Varghese,G. F@32@1991@278-285@@@"An asynchronous two-dimensional self-correcting cellular automaton"@Wang,W. F@32@1991@288-297@@@"Competitive algorithms for layered graph traversal"@Fiat,A.@Foster,D.P.@Karloff,H.@Rabani,Y.@Ravid,Y.@Vishwanathan,S. F@32@1991@298-303@@@"How to learn an unknown environment"@Deng,X.@Kameda,T.@Papadimitriou,C.H. F@32@1991@304-313@@@"Walking an unknown street with bounded detour"@Klein,R. F@32@1991@314-323@@@"Better bounds for threshold formulas"@Radhakrishnan,J. F@32@1991@324-333@@@"Shrinkage of de Morgan formulae under restriction"@Paterson,M.S.@Zwick,U. F@32@1991@334-341@@@"Size-depth tradeoffs for algebraic formulae"@Bshouty,N.H.@Cleve,R.@Eberly,W. F@32@1991@342-347@@@"A new characterization of Mehlhorn's polynomial time functionals"@Kapron,B.@Cook,S.A. F@32@1991@348-357@@@"A theory of using history for equational systems with applications"@Verma,R.M. F@32@1991@358-367@@@"Progress measures for complementation of $ omega $-automata with applications to temporal logic"@Klarlund,N. F@32@1991@368-377@@@"Tree automata, mu-calculus and determinacy"@Emerson,E.A.@Jutla,C.S. F@32@1991@378-383@@@"Lower bounds for polynomial evaluation and interpolation problems"@Shoup,V.@Smolensky,R. F@32@1991@384-391@@@"Efficient exponentiation in finite fields"@von zur Gathen,J. F@32@1991@392-397@@@"Explicit construction of natural bounded concentrators"@Morgenstern,M. F@32@1991@398-404@@@"Better expansion for Ramanujsn graphs"@Kahale,N. F@32@1991@405-413@@@"A general approach to removing degeneracies"@Emiris,I.@Canny,J. F@32@1991@414-423@@@"A quadratic time algorithm for the minmax length triangulation"@Edelsbrunner,H.@Tan,T.S. F@32@1991@424-430@@@"Discrepancy and $ epsilon $-approximations for bounded VC-dimension"@Matousek,J.@Welzl,E.@Wernisch,L. F@32@1991@431-439@@@"On better heuristic for Euclidean Steiner minimum trees"@Du,D.-Z.@Zhang,Y.@Feng,Q. F@32@1991@440-446@@@"Asymptotically optimal PRAM emulation on faulty hypercubes"@Aumann,Y.@Ben-Or,M. F@32@1991@447-457@@@"Fault-tolerant computation in the full information model"@Goldreich,O.@Goldwasser,S.@Linial,N. F@32@1991@458-469@@@"Highly fault-tolerant sorting circuits"@Leighton,T.@Ma,Y.@Plaxton,C.G. F@32@1991@470-479@@@"Efficient algorithms for dynamic allocation of distributed memory"@Leighton,T.@Schwabe,E.J. F@32@1991@480-487@@@"Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices"@Adler,I.@Beling,P.A. F@32@1991@488-494@@@"Dynamic three-dimensional linear programming"@Eppstein,D. F@32@1991@495-504@@@"Fast approximation algorithms for fractional packing and covering problems"@Plotkin,S.A.@Shmoys,D.B.@Tardos,E. F@32@1991@505-514@@@"The maintenance of common data in a distributed system"@Awerbuch,B.@Schulman,L.J. F@32@1991@515-525@@@"Optimal file sharing in distributed networks"@Naor,M.@Roth,R.M. F@32@1991@526-535@@@"Low contention linearizable counting"@Herlihy,M.@Shavit,N.@Waarts,O. F@32@1991@538-547@@@"A unified geometric approach to graph separators"@Miller,G.L.@Teng,S.-H.@Vavasis,S.A. F@32@1991@548-559@@@"A linear time algorithm for triconnectivity augmentation"@Hsu,T.-S.@Ramachandran,V. F@32@1991@560-568@@@"Finding the hidden path: time bounds for all-pairs shortest paths"@Karger,D.R.@Koller,D.@Phillips,S.J. F@32@1991@569-575@@@"On the exponent of the all pairs shortest path problem"@Alon,N.@Galil,Z.@Margalit,O. F@32@1991@576-585@@@"Search problems in the decision tree model"@Lovasz,L.@Naor,M.@Newman,I.@Wigderson,A. F@32@1991@586-593@@@"A parallel algorithmic version of the local lemma"@Alon,N. F@32@1991@594-601@@@"Lower bounds for the complexity of reliable Boolean circuits with noisy gates"@Gal,A. F@32@1991@602-611@@@"Reliable computation with noisy circuits and decision trees: A general $n$ log $n$ lower bound"@Reischuk,R.@Schmeltz,B. F@32@1991@612-621@@@"A lower bound for the dictionary problem under a hashing model"@Sundar,R. F@32@1991@622-631@@@"Lower bounds for data structure problems on RAMs"@Ben-Amram,A.M.@Galil,Z. F@32@1991@632-641@@@"Ambivalent data structures for dynamic 2-edge-connectivity and $k$ smallest spanning trees"@Frederickson,G.N. F@32@1991@642-649@@@"Faster uniquely represented dictionaries"@Andersson,A.@Ottmann,R. F@32@1991@650-661@@@"On the complexity of computing the homology type of a triangulation"@Donald,B.R.@Chang,D.R. F@32@1991@662-669@@@"An approximation algorithm for the number of zeros of arbitrary polynomials over $GF[q]$"@Grigoriev,D.@Karpinski,M. F@32@1991@670-677@@@"Computing sums of radicals in polynomial time"@Blomer,J. F@32@1991@678-687@@@"Efficient algorithms for the Riemann-Roch problem and for addition in the Jacobian of a curve"@Huang,M.-D.@Ierardi,D. F@32@1991@688-697@@@"Connected components in $0(lg sup 3/2 |V|)$ parallel time for the CREW PRAM"@Johnson,D.B.@Metaxas,P. F@32@1991@698-710@@@"Towards a theory of nearly constant time parallel algorithms"@Gil,J.@Matias,Y.@Vishkin,U. F@32@1991@711-722@@@"Using approximation algorithms to design parallel algorithms that may ignore processor allocation"@Goodrich,M.T. F@32@1991@723-732@@@"A deterministic parallel algorithm for planar graphs isomorphism"@Gazit,H. F@32@1991@733-742@@@"Approximate representation theory of finite groups@Babai,L.@Friedl,K. F@32@1991@743-751@@@"Finding k-cuts within twice the optimal"@Saran,H.@Vazirani,V.V. F@32@1991@752-759@@@"How to pack better than best fit: tight bounds for average-case on-line bin packing"@Shor,P.W. F@32@1991@760-766@@@"Adaptive dictionary matching"@Amir,A.@Farach,M. F@32@1991@767-776@@@"On the computational power of sigmoid versus Boolean threshold circuits"@Maass,W.@Schnitger,G.@Sontag,E.D. F@32@1991@777-782@@@"Variation ranks of communication matrices and lower bounds for depth two circuits having symmetric gates with unbounded fan-in"@Krause,M.@Waack,S. F@32@1991@783-792@@@"On ACC"@Beigel,R.@Tarui,J. F@32@1991@793-801@@@"On-line maintenance of the four-connected components of a graph"@Kanevsky,A.@Tamassia,R.@DiBattsita,G.@Chen,J. F@32@1991@802-811@@@"Computing planar intertwines"@Gupta,A.@Impagliazzo,R. F@32@1991@812-821@@@"Applications of a poset representation to edge connectivity and graph rigidity"@Gabow,H.N. S@24@1992@1-9@@@"Biased random walks"@Azar,Y.@Broder,A.Z.@Karlin,A.R.@Linial,N.@Phillips,S. S@24@1992@10-16@@@"Approximations of general independent distributions"@Even,G.@Goldreich,O.@Luby,M.@Nisan,N.@Velickovic,B. S@24@1992@17-25@@@"Sample spaces uniform on neighborhoods"@Schulman,L.J. S@24@1992@26-38@@@"Balanced matroids"@Feder,T.@Mihail,M. S@24@1992@39-50@@@"Competitive algorithms for distributed data management"@Bartal,Y.@Fiat,A.@Rabani,Y. S@24@1992@51-58@@@"New algorithms for an ancient scheduling problem"@Bartal,Y.@Fiat,A.@Karloff,H.@Vohra,R. S@24@1992@59-68@@@"Alphabet independent two dimensional matching"@Amir,A.@Benson,G.@Farach,M. S@24@1992@69-76@@@"A constant-time optimal parallel string-matching algorithm"@Galil,Z. S@24@1992@77-96@@@"Methods for message routing in parallel machines"@Leighton,T. S@24@1992@97-105@@@"Computing Frobenius maps and factoring polynomials"@von zur Gathen,J.@Shoup,V. S@24@1992@106-115@@@"Parallel computation over hyperbolic groups"@ Cai,J.-Y. S@24@1992@116-125@@@"Structure forest and composition factors for small base groups in nearly linear time"@Beals,R.@Seress,A. S@24@1992@126-132@@@"Feasibility testing for systems of real quadratic equations"@Barvinok,A.I. S@24@1992@133-139@@@"Fault tolerant planar communication networks"@Lin,G. S@24@1992@140-149@@@"Existence and construction of edge disjoint paths on expander graphs"@Broder,A.Z.@Frieze,A.M.@Upfal,E. S@24@1992@150-161@@@"Simple algorithms for routing on butterfly networks with bounded queues"@Maggs,B.M.@Sitaraman,R.K. S@24@1992@162-169@@@"Computing with faulty arrays"@Aumann,Y.@Ben-Or,M. S@24@1992@170-177@@@"Linear decision trees: volume estimates and topological bounds"@Bjorner,A.@Lovasz,L.@Yao,A.C.C. S@24@1992@178-187@@@"Entropy and sorting"@Kahn,J.@Kim,J.H. S@24@1992@188-199@@@"Randomized versus nondeterministic communication complexity"@Beame,P.@Lawry,J. S@24@1992@200-220@@@"Exponential lower bounds for the pigeonhole principle"@Beame,P.@Impagliazzo,R.@Krajicek,J.@Pitassi,T.@Pudlak,P.@Woods,A. S@24@1992@221-228@@@"Finding approximate separators and computing tree width quickly"@Reed,B.A. S@24@1992@229-240@@@"Faster algorithms for finding small edge cuts in planar graphs"@Rao,S.B. S@24@1992@241-251@@@"The complexity of multiway cuts"@Dahlhaus,E.@Johnson,D.S.@Papadimitriou,C.H.@Seymour,P.D.@Yannakakis,M. S@24@1992@252-263@@@"Graph decomposition is NPC - A complete proof of Holyer's conjecture"@Dor,D.@Tarsi,M. S@24@1992@264-274@@@"Online minimization of transition systems"@Lee,D.@Yannakakis,M. S@24@1992@275-282@@@"Exponential determinization for $omega$-automata with strong-fairness acceptance condition"@Safra,S. S@24@1992@283-293@@@"A new recursion-theoretic characterization of the polytime functions"@Bellantoni,S.@Cook,S. S@24@1992@294-305@@@"Asymptotic conditional probabilities for first-order logic"@Grove,A.J.@Halpern,J.Y.@Koller,D. S@24@1992@306-317@@@"Efficient program transformations for resilient parallel computation via randomization"@Kedem,Z.M.@Palem,K.V.@Rabin,M.O.@Raghunathan,A. S@24@1992@318-326@@@"Efficient PRAM simulation on a distributed memory machine"@Karp,R.M.@Luby,M. S@24@1992@327-338@@@"A deterministic poly(log log $N$)-time $N$-processor algorithm for linear programming in fixed dimension"@Ajtai,M.@Megiddo,N. S@24@1992@339-350@@@"On the parallel complexity of computing a maximal independent set in a hypergraph"@Kelsen,P. S@24@1992@351-369@@@"Computational learning theory: Survey and selected bibliography"@Angluin,D. S@24@1992@370-381@@@"Learning arithmetic read-once formulas"@Bshouty,N.H.@Hancock,T.R.@Hellerstein,L. S@24@1992@382-389@@@"Fast learning of $k$-term DNF formulas with queries"@Blum,A.@Rudich,S. S@24@1992@390-399@@@"Can finite samples detect singularities of real-valued functions"@Ben-David,S. S@24@1992@400-404@@@"A logspace algorithm for tree canonization"@Lindell,S. S@24@1992@405-416@@@"A hypercubic sorting network with nearly logarithmic depth"@Plaxton,C.G. S@24@1992@417-428@@@"Small-depth counting networks"@Klugerman,M.@Plaxton,C.G. S@24@1992@429-437@@@"Shallow multiplication circuits and wise financial investments"@Paterson,M.S.@Zwick,U. S@24@1992@438-449@@@"Symmetry and complexity"@Babai,L.@Beals,R.@Takacsi-Nagy,P. S@24@1992@450-454@@@"When do extra majority gates help? Polylog($n$) majority gates are equivalent to one"@Beigel,R. S@24@1992@455-461@@@"Representing Boolean functions as polynomials modulo composite numbers"@Barrington,D.A.M.@Beigel,R.@Rudich,S. S@24@1992@462-467@@@"On the degree of Boolean functions as real polynomials"@Nisan,N.@Szegedy,M. S@24@1992@468-474@@@"On the degree of polynomials that approximate symmetric Boolean functions"@Paturi,R. S@24@1992@475-482@@@"A subexponential randomized simplex algorithm"@Kalai,G. S@24@1992@483-494@@@"Polynomial algorithms for linear programming over the algebraic numbers"@Adler,I.@Beling,P.A. S@24@1992@495-506@@@"Fully dynamic planarity testing"@Galil,Z.@Italiano,G.F.@Sarnak,N. S@24@1992@507-516@@@"Planar separators and parallel polygon triangulation"@Goodrich,M.T. S@24@1992@517-526@@@"Ray shooting and parametric search"@Agarwal,P.K.@Matousek,J. S@24@1992@527-538@@@"On the angular resolution of planar graphs"@Malitz,S.@Papakostas,A. S@24@1992@539-545@@@"Ham-sandwich cuts in $R sup d$"@Lo,C-Y.@Matousek,J.@Steiger,W. S@24@1992@546-556@@@"A decomposition of multi-dimensional point-sets with applications to $k$-nearest-neighbors and $n$-body potential fields"@Callahan,P.B.@Kosaraju,S.R. S@24@1992@557-570@@@"Adapting to asynchronous dynamic networks"@Awerbuch,B.@Patt-Shamir,B.@Peleg,D.@Saks,M. S@24@1992@571-580@@@"Competitive distributed job scheduling"@Awerbuch,B.@Kutten,S.@Peleg,D. S@24@1992@581-592@@@"Improved distributed algorithms for coloring and network decomposition problems"@Panconesi,A.@Srinivasan,A. S@24@1992@593-602@@@"Efficient fault tolerant algorithms for resource allocation in distributed systems"@Choy,M.@Singh,A.K. S@24@1992@603-618@@@"The history and status of the P versus NP question"@Sipser,M. S@24@1992@619-623@@@"RL \(ib SC"@Nisan,N. S@24@1992@624-631@@@"On the complexity of RAM with various operation sets"@Simon,J.@Szegedy,M. S@24@1992@632-642@@@"Average case intractability of matrix and diophantine problems"@Venkatesan,R.@Rajagopalan,S. S@24@1992@643-654@@@"On the hardness of computing the permanent of random matrices"@Feige,U.@Lund,C. S@24@1992@655-666@@@"Simple and efficient bounded concurrent timestamping or Bounded concurrent timestamp systems are comprehensible!"@Dwork,C.@Waarts,O. S@24@1992@667-678@@@"Self-stabilizing symmetry breaking in constant-space"@Mayer,A.@Ofek,Y.@Ostrovsky,R.@Yung,M. S@24@1992@679-690@@@"A correctness condition for high-performance multiprocessors"@Attiya,H.@Friedman,R. S@24@1992@691-698@@@"Target shooting with programmed random variables"@Brightwell,G.@Ott,T.J.@Winkler,P. S@24@1992@699-710@@@"Communication complexity of secure computation"@Franklin,M.@Yung,M. S@24@1992@711-722@@@"Making zero-knowledge provers efficient"@Bellare,M.@Petrank,E. S@24@1992@723-732@@@"A note on efficient zero-knowledge proofs and arguments"@Kilian,J. S@24@1992@733-744@@@"Two-prover one-round proof systems: Their power and their problems"@Feige,U.@Lovasz,L. S@24@1992@745-749@@@"On the all-pairs-shortest-path problem"@Seidel,R. S@24@1992@750-758@@@"A parallel randomized approximation scheme for shortest paths"@Klein,P.N.@Sairam,S. S@24@1992@759-770@@@"Biconnectivity approximations and graph carvings"@Khuller,S.@Vishkin,U. S@24@1992@771-782@@@"\(*e-Approximations with minimum packing constraint violation"@Lin,J-H.@Vitter,J.S. F@33@1992@2-13@@@"Probabilistic checking of proofs; A new characterization of NP"@Arora,S.@Safra,S. F@33@1992@14-23@@@"Proof verification and hardness of approximation problems"@Arora,S.@Lund,C.@Motwani,R.@Sudan,M.@Szegedy,M. F@33@1992@24-29@@@"Undirected connectivity in $O ( log sup 1.5 n)$ space"@Nisan,N.@Szemeredi,E.@Wigderson,A. F@33@1992@30-39@@@"The isomorphism conjecture holds relative to an oracle"@Fenner,S.@Fortnow,L.@Kurtz,S. F@33@1992@40-49@@@"Data structural bootstrapping, linear path compression, and catenable heap ordered double ended queues"@Buchsbaum,A.L.@Sundar,R.@Tarjan,R.E. F@33@1992@50-59@@@"Fully dynamic biconnectivity in graphs"@Rauch,M. F@33@1992@60-69@@@"Sparsification - a technique for speeding up dynamic graph algorithms"@Eppstein,D.@Galil,Z.@Italiano,G.F.@Nissenzweig,A. F@33@1992@70-79@@@"On four-connecting a triconnected graph"@Hsu.T.-S. F@33@1992@80-89@@@"Dynamic half-space reporting, geometric optimization, and minimum spanning trees"@Agarwal,P.K.@Eppstein,D.@Matousek,J. F@33@1992@90-100@@@"Randomized geometric algorithms and pseudo-random generators"@Mulmuley,K. F@33@1992@101-110@@@"Drawing planar graphs using the $lmc$-ordering"@Kant,G. F@33@1992@111-120@@@"Computing in solvable matrix groups"@Luks,E.M. F@33@1992@121-130@@@"Fast algorithms for matrix normal forms"@Giesbrecht,M. F@33@1992@131-136@@@"Improved parallel polynomial division and its extensions"@Bini,D.@Pan,V. F@33@1992@137-146@@@"Randomized consensus in expected $O (n log sup 2 n)$ operations per processor"@Aspnes,J.@Waarts,O. F@33@1992@147-156@@@"Clock construction in fully asynchronous parallel systems and PRAM simulation"@Aumann,Y.@Rabin,M.O. F@33@1992@157-166@@@"Fault-tolerant wait-free shared objects"@Jayanti,P.@Chandra,T.D.@Toueg,S. F@33@1992@167-176@@@"Hierarchies in transitive closure logic, stratified datalog and infinitary logic"@Gradel,E.@McColm,G.L. F@33@1992@177-186@@@"Back to the future: Towards a theory of timed regular languages"@Alur,R.@Henzinger,T.A. F@33@1992@187-196@@@"The complexity of the Haj\*'os calculus"@Pitassi,T.@Urquhart,A. F@33@1992@197-207@@@"A decomposition theorem and bounds for randomized server problems"@Blum,A.@Karloff,H.@Rabani,Y.@Saks,M. F@33@1992@208-217@@@"Markov paging"@Karlin,A.R.@Phillips,S.J.@Raghavan,P. F@33@1992@218-225@@@"On-line load balancing"@Azar,Y.@Broder,A.Z.@Karlin,A.R. F@33@1992@226-235@@@"Improved lower bounds for shellsort"@Plaxton,C.G.@Poonen,B.@Suel,T. F@33@1992@236-246@@@"The asymptotic complexity of merging networks"@Miltersen,P.B.@Paterson,M.@Tarui,J. F@33@1992@247-256@@@"Truly alphabet-independent two-dimensional pattern matching"@Galil,Z.@Park.K. F@33@1992@258-267@@@"Amplification and percolation"@Dubiner,M.@Zwick,U. F@33@1992@268-277@@@"Algebraic decision trees and Euler characteristics"@Yao,A.C.-C. F@33@1992@278-287@@@"Separating the communication complexities of MOD m and MOD p circuits"@Grolmusz,V. F@33@1992@288-295@@@"Lower bounds on the depth of monotone arithmetic computations"@Coppersmith,D.@Schieber,B. F@33@1992@296-303@@@"On the second eigenvalue and linear expansion of regular graphs"@Kahale,N. F@33@1992@304-313@@@"Quadratic dynamical systems"@Rabinovich,Y.@Sinclair,A.@Wigderson,A. F@33@1992@314-319@@@"On the bit extraction problem"@Friedman,J. F@33@1992@320-326@@@"A mildly exponential approximation algorithm for the permanent"@Jerrum,M.@Vazirani,U. F@33@1992@327-333@@@"Competitive analysis of financial games"@El-Yaniv,R.@Fiat,A.@Karp,R.@Turpin,G. F@33@1992@334-343@@@"Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling"@Alon,N.@Kalai,G.@Ricklin,M.@Stockmeyer,L. F@33@1992@344-353@@@"The distributed $k$-server problem \(en A competitive distributed translator for $k$-server algorithms"@Bartal,Y.@Rosen,A. F@33@1992@354-362@@@"Undecidability of the Horn-clause implication problem"@Marcinkowski,J.@Pacholski,L. F@33@1992@363-371@@@"Efficient inference of partial types"@Kozen,D.@Palsberg,J.@Schwartzbach,M.I. F@33@1992@372-379@@@"On the completeness of object-creating query languages"@VandenBussche,J.@VanGucht,D.@Andries,M.@Gyssens,M. F@33@1992@380-386@@@"Enumerating the $k$ closest pairs optimally"@Lenhof,H.-P.@Smid,M. F@33@1992@387-395@@@"Safe and effective determinant evaluation"@Clarkson,K.L. F@33@1992@396-405@@@"On minimum and maximum spanning trees of linearly moving points"@Katoh,N.@Tokuyama,T.@Iwano,K. F@33@1992@406-416@@@"Towards a computational theory of statistical tests"@Blum,M.@Goldreich,O. F@33@1992@417-426@@@"Witnesses for Boolean matrix multiplication and for shortest paths"@Alon,N.@Galil,Z.@Margalit,O.@Naor,M. F@33@1992@427-436@@@"Zero-knowledge proofs of knowledge without interaction"@DeSantis,A.@Persiano,G. F@33@1992@437-446@@@"Fast unimodular reduction: Planar integer lattices"@Yap,C.K. F@33@1992@447-456@@@"How to denest Ramanujan's nested radicals"@Blomer,J. F@33@1992@457-463@@@"On efficient band matrix arithmetic"@Eberly,W. F@33@1992@464-472@@@"A subexponential algorithm for abstract optimization problems"@Gartner,B. F@33@1992@473-481@@@"The algorithmic aspects of the regularity lemma"@Alon,N.@Duke,R.A.@Lefmann,H.@Rodl,V.@Yuster,R. F@33@1992@482-491@@@"On the randomized complexity of volume and diameter"@Lovasz,L.@Simonovits,M. F@33@1992@493-502@@@"Apple tasting and nearly one-sided learning"@Helmbold,D.P.@Littlestone,N.@Long,P.M. F@33@1992@503-512@@@"Reconstructing algebraic functions from mixed data"@Ar,S.@Lipton,R.J.@Rubinfeld,R.@Sudan,M. F@33@1992@513-522@@@"On the exact learning of formulas in parallel"@Bshouty,N.H.@Cleve,R. F@33@1992@523-532@@@"Read-thrice DNF is hard to learn with membership and equivalence queries"@Aizenstein,H.@Hellerstein,L.@Pitt,L. F@33@1992@533-541@@@"Efficient self-embedding of butterfly networks with random faults"@Tamaki,H. F@33@1992@542-552@@@"On the fault tolerance of some popular bounded-degree networks"@Leighton,T.@Maggs,B.@Sitaraman,R. F@33@1992@553-562@@@"Exact analysis of hot-potato routing"@Feige,U.@Raghavan,P. F@33@1992@563-572@@@"A theory of wormhole routing in parallel computers"@Felperin,S.@Raghavan,P.@Upfal,E. F@33@1992@573-582@@@"Computing a shortest $k$-link path in a polygon"@Mitchell,J.S.B.@Piatko,C.@Arkin,E.M. F@33@1992@583-592@@@"Efficient minimum cost matching using quadrangle inequality"@Aggarwal,A.@Bar-Noy,A.@Khuller,S.@Kravets,D.@Schieber,B. F@33@1992@593-599@@@"Optimal parallel hull construction for simple polygons in $O ( log log n)$ time"@Wagener,H. F@33@1992@600-609@@@"Tighter bounds on the exact complexity of string matching"@Cole,R.@Hariharan,R. F@33@1992@610-619@@@"Tiling a polygon with rectangles"@Kenyon,C.@Kenyon,R. F@33@1992@620-627@@@"Mick gets some (the odds are on his side)"@Chvatal,V.@Reed,B. F@33@1992@628-637@@@"Waste makes haste: Tight bounds for loose parallel sorting"@Hagerup,T.@Raman,R. F@33@1992@638-647@@@"The complexity of parallel prefix problems on small domains"@Chaudhuri,S.@Radhakrishnan,J. F@33@1992@648-658@@@"Approximate max flow on small depth networks"@Cohen,E. F@33@1992@659-669@@@"Newton's method for fractional combinatorial optimization"@Radzik,T. F@33@1992@670-675@@@"A class of logic problems solvable by linear programming"@Conforti,M.@Cornuejols,G. F@33@1992@676-685@@@"Maximizing non-linear concave functions in fixed dimension"@Toledo,S. F@33@1992@686-692@@@"Halvers and expanders"@Ajtai,M.@Komlos,J.@Szemeredi,E. F@33@1992@693-702@@@"Fault tolerant graphs, perfect hash functions and disjoint paths"@Ajtai,M.@Alon,N.@Bruck,J.@Cypher,R.@Ho,C.@Naor,M.@Szemeredi,E. F@33@1992@703-713@@@"The power of combining the techiques of algebraic and numerical computing: Improved approximate multipoint polynomial evaluation and improved multipole algorithms"@Pan,V.Y.@Reif,J.H.@Tate,S.R. F@33@1992@714-723@@@"Processor-efficient parallel solution of linear systems II: The positive characteristic and singular cases"@Kaltofen,E.@Pan,V. F@33@1992@724-733@@@"Communication on noisy channels: A coding theorem for computation"@Schulman,L.J. S@25@1993@1-10@@@"Some complexity issues on the simply connected regions of the two-dimensional plane"@Chou,A.W.@Ko,K. S@25@1993@11-20@@@"Quantum complexity theory"@Bernstein,E.@Vazirani,U. S@25@1993@21-30@@@"Thermodynamics of computation and information distance"@Bennett,C.H.@Gacs,P.@Li,M.@Vitanyi,P.M.B.@Zurek,W.H. S@25@1993@31-41@@@"Fully polynomial byzantine agreement in $t+1$ rounds"@Garay,J.@Moses,Y. S@25@1993@42-51@@@"Fast asynchronous byzantine agreement with optimal resilience"@Canetti,R.@Rabin,T. S@25@1993@52-61@@@"Asynchronous secure computation"@Ben-Or,M.@Canetti,R.@Goldreich,O. S@25@1993@62-70@@@"$k$ one-way heads cannot do string-matching"@Jiang,T.@Li,M. S@25@1993@71-80@@@"A theory of parameterized pattern matching: Algorithms and applications"@Baker,B.S. S@25@1993@81-90@@@"Multiple matching of rectangular patterns"@Idury,R.M.@Schaffer,A.A. S@25@1993@91-100@@@"Generalized FLP impossibility result for t-resilient asynchronous computations"@Borowsky,E.@Gafni,E. S@25@1993@101-110@@@"Wait-free $k$-set agreement is impossible: The topology of public knowledge"@Saks,M.@Zaharoglou,F. S@25@1993@111-120@@@"The asynchronous computability theorem for $t$-resilient tasks"@Herlihy,M.@Shavit,N. S@25@1993@121-129@@@"Linear programming without the matrix"@Papadimitriou,C.H.@Yannakakis,M. S@25@1993@130-136@@@"Comparison-based search in the presence of errors"@Borgstrom,R.S.@Kosaraju,S.R. S@25@1993@137-145@@@"A robust model for finding optimal evolutionary trees"@Farach,M.@Kannan,S.@Warnow,T. S@25@1993@146-153@@@"Maximum $k$-chains in planar point sets: Combinatorial structure and algorithms"@Felsner,S.@Wernisch,L. S@25@1993@154-163@@@"Lower bounds for randomized mutual exclusion"@Kushilevitz,E.@Mansour,Y.@Rabin,M.O.@Zuckerman,D. S@25@1993@164-173@@@"Competitve distributed file allocation"@Awerbuch,B.@Bartal,Y.@Fiat,A. S@25@1993@174-183@@@"Contention in shared memory algorithms"@Dwork,C.@Herlihy,M.@Waarts,O. S@25@1993@184-193@@@"What can be computed locally?"@Naor,M.@Stockmeyer,L. S@25@1993@194-200@@@"Reinventing the wheel: An optimal data structure for connectivity queries"@Cohen,R.F.@DiBattista,G.@Kanevsky,A.@Tamassia,R. S@25@1993@201-207@@@"Locality based graph coloring"@Szegedy,M.@Vishwanathan,S. S@25@1993@208-217@@@"Separator based sparsification for dynamic planar graph algorithms"@Eppstein,D.@Galil,Z.@Italiano,G.F.@Spencer,T.H. S@25@1993@218-225@@@"Polynomial space polynomial delay algorithms for listing families of graphs"@Goldberg,L.A. S@25@1993@226-234@@@"A linear time algorithm for finding tree-decompositions of small treewidth"@Bodlaender,H.L. S@25@1993@235-244@@@"More deterministic simulation in logspace"@Nisan,N.@Zuckerman,D. S@25@1993@245-251@@@"Expanders that beat the eigenvalue bound: Explicit construction and applications"@Wigderson,A.@Zuckerman,D. S@25@1993@252-257@@@"The biased coin problem"@Boppana,R.B.@Narayanan,B. S@25@1993@258-267@@@"Efficient construction of a small hitting set for combinatorial rectangles in high dimension"@Linial,N.@Luby,M.@Saks,M.@Zuckerman,D. S@25@1993@268-277@@@"Constructing small sample spaces satisfying given constraints"@Koller,D.@Megiddo,N. S@25@1993@278-285@@@"Mapping the genome: Some combinatorial problems arising in molecular biology"@Karp,R.M. S@25@1993@286-293@@@"On the hardness of approximating minimization problems"@Lund,C.@Yannakakis,M. S@25@1993@294-304@@@"Efficient probabilistically checkable proofs and applications to approximation"@Bellare,M.@Goldwasser,S.@Lund,C.@Russell,A. S@25@1993@305-314@@@"Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions"@Condon,A.@Feigenbaum,J.@Lund,C.@Shor,P. S@25@1993@315-324@@@"Efficient learning of typical finite automata from random walks"@Freund,Y.@Kearns,M.@Ron,D.@Rubinfeld,R.@Schapire,R.E.@Sellie,L. S@25@1993@325-334@@@"Finiteness results for sigmoidal ``neural'' networks"@Macintyre,A.@Sontag,E.D. S@25@1993@335-344@@@"Bounds for the computational power and learning complexity of analog neural nets"@Maas,W. S@25@1993@345-354@@@"Proportionate progress: A notion of fairness in resource allocation"@Baruah,S.K.@Cohen,N.K.@Plaxton,C.G.@Varvel,D.A. S@25@1993@355-361@@@"Self-routing superconcentrators"@Pippenger,N. S@25@1993@362-371@@@"Space-efficient scheduling of multithreaded computations"@Blumofe,R.D.@Leiserson,C.E. S@25@1993@372-381@@@"Cryptographic hardness of distribution-specific learning"@Kharitonov,M. S@25@1993@382-391@@@"How to use expert advice"@Cesa-Bianchi,N.@Freund,Y.@Helmbold,D.P.@Haussler,D.@Schapire,R.E.@Warmuth,M.K. S@25@1993@392-401@@@"Efficient noise-tolerant learning from statistical queries"@Kearns,M. S@25@1993@402-411@@@"Online load balancing and network flow"@Phillips,S.@Westbrook,J. S@25@1993@412-421@@@"Markov chains, computer proofs, and average-case analysis of best fit bin packing"@Coffman,E.G.@Johnson,D.S.@Shor,P.W.@Weber,R.R. S@25@1993@422-430@@@"On-line algorithms for cache sharing"@Bern,M.@Greene,D.@Raghunathan,A. S@25@1993@431-437@@@"Angles of planar triangular graphs"@DiBattista,G.@Vismara,L. S@25@1993@438-447@@@"Many birds with one stone: Multi-objective approximation algorithms"@Ravi,R.@Marathe,M.V.@Ravi,S.S.@Rosenkrantz,D.J.@Hunt,H.B. S@25@1993@448-457@@@"A parallel approximation algorithm for positive linear programming"@Luby,M.@Nisan,N. S@25@1993@458-467@@@"Randomness-optimal unique element isolation, with applications to perfect matching and related problems"@Chari,S.@Rohatgi,P.@Srinivasan,A. S@25@1993@468-477@@@"Decision trees: Old and new results"@Fleischer,R. S@25@1993@478-484@@@"A deterministic algorithm for the three-dimensional diameter problem"@Matousek,J.@Schwarzkopf,O. S@25@1993@485-494@@@"Matrix searching with the shortest path metric"@Hershberger,J.@Suri,S. S@25@1993@495-504@@@"Improved bounds on weak $epsilon$-nets for convex sets"@Chazelle,B.@Edelsbrunner,H.@Grigni,M.@Guibas,L.@Sharir,M.@Welzl,E. S@25@1993@505-514@@@"Piecewise linear paths among convex obstacles"@deBerg,M.@Matousek,J.@Schwarzkopf,O. S@25@1993@515-522@@@"Depth reduction for noncommutative arithmetic circuits"@Allender,E.@Jiao,J. S@25@1993@523-531@@@"Modified ranks of tensors and the size of circuits"@Pudlak,P.@Rodl,V. S@25@1993@532-540@@@"Characterizing non-deterministic circuit size"@Karchmer,M.@Wigderson,A. S@25@1993@541-550@@@"Size-depth trade-offs for threshold circuits"@Impagliazzo,R.@Paturi,R.@Saks,M.E. S@25@1993@551-560@@@"Simulating threshold circuits by majority circuits"@Goldmann,M.@Karpinski,M. S@25@1993@561-572@@@"Multi-scale self-stimulation: A technique for reconfiguring arrays with faults"@Cole,R.@Maggs,B.@Sitaraman,R. S@25@1993@573-582@@@"How much can hardware help routing?"@Borodin,A.@Raghavan,P.@Schieber,B.@Upfal,E. S@25@1993@583-591@@@"Routing permutations on graphs via matchings"@Alon,N.@Chung,F.R.K.@Graham,R.L. S@25@1993@592-601@@@"Parametric real-time reasoning"@Alur,R.@Henzinger,T.A.@Vardi,M.Y. S@25@1993@602-611@@@"Constant time factors do matter"@Jones,N.D. S@25@1993@612-622@@@"Monotone monadic SNP and constraint satisfaction"@Feder,T.@Vardi,M.Y. S@25@1993@623-631@@@"On-line load balancing with applications to machine scheduling and virtual circuit routing"@Aspnes,J.@Azar,Y.@Fiat,A.@Plotkin,S.@Waarts,O. S@25@1993@632-641@@@"Approximate load balancing on dynamic and asynchronous networks"@Aiello,W.@Awerbuch,B.@Maggs,B.@Rao,S. S@25@1993@642-651@@@"Optimal online scheduling of parallel jobs with dependencies"@Feldmann,A.@Kao,M.@Sgall,J.@Teng,S. S@25@1993@652-661@@@"Time optimal self-stabilizing synchronization"@Awerbuch,B.@Kutten,S.@Mansour,Y.@Patt-Shamir,B.@Varghese,G. S@25@1993@662-671@@@"Fast perfect-information leader-election protocol with linear immunity"@Cooper,J.@Linial,N. S@25@1993@672-681@@@"Cryptographic defense against traffic analysis"@Rackoff,C.@Simon,D.R. S@25@1993@682-690@@@"Excluded minors, network decomposition, and multicommodity flow"@Klein,P.@Plotkin,S.A.@Rao,S. S@25@1993@691-697@@@"Improved bounds on the max-flow min-cut ratio for multicommodity flows"@Plotkin,S.A.@Tardos,E. S@25@1993@698-707@@@"Approximate max-flow min-(multi) cut theorems and their applications"@Garg,N.@Vazirani,V.V.@Yannakakis,M. S@25@1993@708-717@@@"A primal-dual approximation algorithm for generalized Steiner network problems"@Williamson,D.P.@Goemans,M.X.@Mihail,M.@Vazirani,V.V. S@25@1993@718-727@@@"Time-space trade-offs for undirected $ST$-Connectivity on a JAG"@Edmonds,J. S@25@1993@728-737@@@"Short random walks on graphs"@Barnes,G.@Feige,U. S@25@1993@738-746@@@"Matchings in lattice graphs"@Kenyon,C.@Randall,D.@Sinclair,A. S@25@1993@747-756@@@"Deterministic coding for interactive communication"@Schulman,L.J. S@25@1993@757-765@@@"An $O tilde (n sup 2 )$ algorithm for minimum cuts"@Karger,D.R.@Stein,C. S@25@1993@766-775@@@"Finding minimum-quotient cuts in planar graphs"@Park,J.K.@Phillips,C.A. S@25@1993@776-785@@@"The network inhibition problem"@Phillips,C.A. S@25@1993@786-795@@@"Checking approximate computations over the reals"@Ar,S.@Blum,M.@Codenotti,B.@Gemmell,P. S@25@1993@796-804@@@"On the generation of multivariate polynomials which are hard to factor"@Shamir,A. S@25@1993@805-812@@@"Counting curves and their projections"@vonzurGathen,J.@Karpinski,M.@Shparlinski,I.