Advanced Search
Author|Conference|Journal|Year
Look for results that meet for the following criteria:
Top-ranked Papers in "Algorithms and Theory"
Filter: All Years| Last 10 Years| Last 5 Years
 Paper TitleIndomain-CitationsCitations
1Computers and Intractability: A Guide to the Theory of NP-Completeness (1979)7386419
2Amortized efficiency of list update and paging rules (1985)375902
3A theory of the learnable (1984)3591463
4The Design and Analysis of Computer Algorithms (1974)3511983
5Introduction to Algorithms (1990)3293722
6Comunication and concurrency (1989)3242195
7Elements of information theory (1991)3134436
8The Probabilistic Method (1992)291770
9Computational complezity (1994)2901578
10The art of computer programming (1979)2752775
11Randomized Algorithms (1995)2711218
12Algorithms in combinatorial geometry (1987)266704
13Computational Geometry - An Introduction (1985)2651333
14Communicating Sequential Processes (1985)2543104
15Algorithmic graph theory and perfect graphs (1980)240884
16Application of Random Sampling in Computational Geometry, II (1989)222486
17Introduction to automata theory (1979)2201556
18Optimization, Approximation, and Complexity Classes (1991)220462
19A Theory of Timed Automata (1994)2051466
20Computers and Interactability: A Guide to the Theory of NP - Compeltenesa (1979)1951464
21On-line computation and competitive analysis (1998)194524
22A structural approach to operational semantics (2004)1881222
23Reducibility among combinatorial problems (1975)181975
24Fast Algorithms for Finding Nearest Common Ancestors (1984)181401
25Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming (1995)180705
26Theory of recursive functions and effective computability (1967)177639
27A Threshold of ln n for Approximating Set Cover (1998)176475
28Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms (1984)176542
29Queries and Concept Learning (1987)176534
30Language Identification in the Limit (1967)174903
31The Knowledge Complexity of Interactive Proof Systems (1989)172823
32Matrix Multiplication via Arithmetic Progressions (1990)172485
33Information theory and reliable communication (1968)1681107
34A Calculus of Mobile Processes, I (1992)164768
35Introduction to Automata Theory, Languages and Computation (1979)1631419
36Reducibility among combinational problems (1972)163707
37The complexity of theorem-proving procedures (1971)161935
38Graph-Based Algorithms for Boolean Function Manipulation (1986)1593199
39Rewrite Systems (1990)159788
40A separator theorem for planar graphs (1977)156336
41Proof Verification and Hardness of Approximation Problems (1992)153394
42Graph theory with applications (1979)1511018
43Probability inequalities for sum of bounded random variables (1963)151772
44Applying Parallel Computation Algorithms in the Design of Serial Algorithms (1983)148253
45The theory of error-correcting codes (1978)147857
46Theoretical computer science (1987)145676
47Approximation Algorithms for Combinatorial Problems (1974)144493
48Automata on Infinite Objects (1990)142537
49Concurrency and Automata on Infinite Sequences (1981)142661
50Communication Complexity (1997)141363
51Proof verification and the hardness of approximation problems (1998)140302
52Property testing and its connection to learning and approximation (1998)140256
53Theory of linear and integer programming (1998)1361240
54Data structures and network algorithms (1983)135606
55An introduction to probability theory and its applications (1970)1343173
56The theory of error correcting codes (1977)133687
57Davenport-Schinzel Sequences and Their Geometric Applications (1995)133311
58Optimal Point Location in a Monotone Subdivision (1986)132246
59The Input/Output Complexity of Sorting and Related Problems (1988)132343
60Learnability and the Vapnik-Chervonenkis dimension (1989)131368
61Fast Probabilistic Algorithms for Verification of Polynomial Identities (1980)128357
62How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits (1984)127450
63A Calculus of Communicating Systems (1980)127846
64A guide to the theory of np-completeness (1979)126890
65Automatic verification of finite-state concurrent systems using temporal logic specifications (1986)1261255
66The Complexity of Computing the Permanent (1979)125397
67Learning Quickly When Irrelevant Attributes Abound: A New Linear-threshold Algorithm (1987)125474
68Term rewriting and all that (1998)124721
69Universal coalgebra: a theory of systems (2000)122329
70A Space-Economical Suffix Tree Construction Algorithm (1976)121456
71The Weighted Majority Algorithm (1994)121531
72Art of computer programming (1973)120827
73A measure of the asymptotic efficiency for tests of a hypothesis based on the sum of observations120468
74Quantum computation and quantum information (2000)1201651
75Fast Pattern Matching in Strings (1977)120586
76Worst-case Equilibria (1999)120407
77Primitives for the Manipulation of General Subdivisions and Computation of Voronoi Diagrams (1985)119468
78Linear Logic (1987)119379
79Universal Classes of Hash Functions (1979)119492
80Parallel Merge Sort (1988)118383
81Graph Drawing: Algorithms for the Visualization of Graphs (1999)118478
82Categories for the working mathematician (1971)118723
83Optimal Search in Planar Subdivisions (1983)116255
84Notions of Computation and Monads (1991)115487
85Theory and application of trapdoor functions (1982)115341
86The Temporal Logic of Programs (1977)114927
87Probabilistic Approximations of Metric Spaces and Its Algorithmic Applications (1996)114252
88A Data Structure for Dynamic Trees (1983)114272
89Robust Characterizations of Polynomials with Applications to Program Testing (1996)113198
90Self-Testing/Correcting with Applications to Numerical Problems (1990)113248
91Temporal and Modal Logic (1990)1131074
92Bisimulation Through Probabilistic Testing (1989)113384
93Planar Point Location Using Persistent Search Trees (1986)112245
94Probabilistic Encryption (1984)112898
95Probabilistic computation: towards a unified measure of complexity (1977)111208
96Mobile Ambients (1998)111529
97The Geometry of Graphs and Some of its Algorithmic Applications (1995)111279
98On the uniform convergence of relative frequencies of events to their probabilities (1971)109476
99Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints (1977)1091407
100On the security of public key protocols (1983)109838
101A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth (1996)107307
102A General Approximation Technique for Constrained Forest Problems (1995)107229
103Non-Deterministic Exponential Time has Two-Prover Interactive Protocols (1991)107264
104Probabilistic Checking of Proofs: A New Characterization of NP (1998)106222
105Linear Pattern Matching Algorithms (1973)106389
106Learning Regular Sets from Queries and Counterexamples (1987)105415
107Competitive Snoopy Caching (1988)105264
108Space-Time Codes for High Data Rate Wireless Communications : Performance criterion and Code Construction (1998)1051081
109On Approximating Arbitrary Metrices by Tree Metrics (1998)105194
110Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs (1988)104213
111A Framework for Defining Logics (1993)104440
112Mobile ambients (2000)104447
113Random Generation of Combinatorial Structures from a Uniform Distribution (1986)103247
114Algorithms, Games, and the Internet (2001)103383
115Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer (1997)103532
116Algebraic Laws for Nondeterminism and Concurrency (1985)103461
117Computational geometry: algorithms and applications (1997)103484
118Suffix Arrays: A New Method for On-Line String Searches (1993)103349
119Hardness vs Randomness (1994)101202
120Foundations of logic probramming (1985)1011773
121How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority (1987)101630
122A Parallel Repetition Theorem (1998)100203
123A Calculus for Cryptographic Protocols: The Spi Calculus (1997)100611
124An Efficient Parallel Biconnectivity Algorithm (1985)100233
125Lambda calculus: its syntax and semantics (1984)99486
126Nondeterministic Space is Closed Under Complementation (1988)99256
127The mathematical theory of communication992943
128Results on the Propositional mu-Calculus (1983)99518
129On the hardness of approximating minimization problems (1993)98261
130A bridging model for parallel computation (1990)981082
131Introduction to al - gorithms (1990)971484
132Fast Approximation Algorithms for Fractional Packing and Covering Problems (1991)97211
133Communicating and mobile systems: the pi-calculus (1999)96748
134Decision Theoretic Generalizations of the PAC Model for Neural Net and Other Learning Applications (1992)96341
135Network flows: theory algorithms and applications (1993)961042
136Depth-First Search and Linear Graph Algorithms (1972)96833
137A tight bound on approximating arbitrary metrics by tree metrics (2003)95181
138An introduction to the theory of numbers (1960)951009
139Parity, Circuits, and the Polynomial-Time Hierarchy (1984)95258
140Small-Bias Probability Spaces: Efficient Constructions and Applications (1993)94203
141On Finding Lowest Common Ancestors: Simplification and Parallelization (1988)93199
142Introduction to probability theory and its applications (1968)931068
143Toward a Mathematical Theory of Inductive Inference (1975)93213
144NP is as Easy as Detecting Unique Solutions (1986)93235
145The Chemical Abstract Machine (1990)93429
146Implementing Mathematics with The Nuprl Proof Development System (1986)93630
147Decidability of second order theories and automata on infinite trees (1969)93314
148The Complexity of Satisfiability Problems (1978)92349
149Self-Adjusting Binary Search Trees (1985)92326
150Bounds for certain multiprocessing anomalies (1966)92277
151Easy Problems for Tree-Decomposable Graphs (1991)91196
152Languages that Capture Complexity Classes (1987)91282
153Maintenance of Configurations in the Plane (1981)91180
154Competitive Paging Algorithms (1991)91206
155Some complexity questions related to distributed computing (1979)91221
156How to construct random functions (1986)90484
157On Embedding a Graph in the Grid with the Minimum Number of Bends (1987)90172
158A no$e on two problems in connection with graphs901054
159Probabilistic algorithms for sparse polynomials (1979)89204
160A Sub-Constant Error-Probability Low-Degree Test, and a Sub-Constant Error-Probability PCP Characterization of NP (1997)89198
161New Applications of random Sampling in Computational Geometry (1987)89192
162Quantum Complexity Theory (1997)88265
163New Directions in Cryptography (1976)882118
164An axiomatic basis for computer programming (1969)871347
165A Universal Algorithm for Sequential Data Compression (1977)87869
166Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality (1998)87417
167Almost Everywhere High Nonuniform Complexity (1992)87169
168A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem (1986)86183
169A Machine-Independent Theory of the Complexity of Recursive Functions (1967)86195
170A Partial k-Arboretum of Graphs with Bounded Treewidth (1998)85170
171Comparison of Identification Criteria for Machine Inductive Inference (1983)85151
172A Fast Quantum Mechanical Algorithm for Database Search (1996)85490
173On the Union of Jordan Regions and Collision-Free Translational Motion Amidst Polygonal Obstacles (1986)84149
174Capacity of Multi-antenna Gaussian Channels (1999)841420
175Algebraic Methods in the Theory of Lower Bounds for Boolean Circuit Complexity (1987)84232
176Algorithms for Reporting and Counting Geometric Intersections (1979)84274
177Low density parity check codes (1963)841092
178An introduction to Kolmogorov Complexity and its Applications: Preface to the First Edition (1997)84392
179Proofs that Yield Nothing But Their Validity for All Languages in NP Have Zero-Knowledge Proof Systems (1991)84340
180A New Approach to the Maximum Flow Problem (1986)84398
181A Discipline of Programming (1976)841508
182Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic (1981)83673
183Randomized rounding: a technique for provably good algorithms and algorithmic proofs (1987)83200
184LCF Considered as a Programming Language (1977)83351
185Combinatorial Optimization: Algorithms and Complexity (1982)831038
186Making Data Structures Persistent (1989)83258
187An introduction to kolmogorov complexity and its applications (1997)83355
188Introduction to graph theory (1996)82774
189A Hard-Core Predicate for all One-Way Functions (1989)82233
190Polynomial Time Approximation Schemes for Euclidean TSP and Other Geometric Problems (1996)82217
191Some Complexity Questions Related to Distributive Computing (Preliminary Report) (1979)82170
192Triangulating a Simple Polygon in Linear Time (1991)82235
193The theory of error-correcting codes (north-holland (1977)82277
194Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms (1999)81188
195A Decomposition of Multidimensional Point Sets with Applications to k-Nearest-Neighbors and n-Body Potential Fields (1995)81159
196A method for obtaining digital signatures and public-key cryptosystems (1978)812741
197A Simple Parallel Algorithm for the Maximal Independent Set Problem (1986)81254
198Conditional rewriting logic as a unified model of concurrency (1992)81393
199Symbolic Model Checking for Real-time Systems (1992)80533
200Approximation Algorithms for NP-Complete Problems on Planar Graphs (1994)80173
201Linear-Time Algorithms for Visibility and Shortest Path Problems Inside Triangulated Simple Polygons (1987)80174
202Invitation to Fixed-Parameter Algorithms (2002)79168
203Bounded-Width Polynomial-Size Branching Programs Recognize Exactly Those Languages in NC¹ (1986)79163
204Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity (1988)79179
205When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks (1991)79146
206Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms (1990)79198
207computational geometry: algorithms and applications (2000)79415
208A Linear-Time Algorithm for a Special Case of Disjoint Set Union (1985)78177
209Introduction to parallel algorithms and architectures: arrays trees hypercubes (1992)78442
210A Sweepline Algorithm for Voronoi Diagrams (1987)78287
211Distributed Algorithms (1996)781051
212LEDA: A Platform for Combinatorial and Geometric Computing (1999)78255
213Approximating the Permanent (1989)78198
214Modern computer algebra (1999)78299
215Ramanujan graphs (1988)77228
216Efficiency of a Good But Not Linear Set Union Algorithm (1975)77310
217Aggregating Strategies (1990)77205
218Multipart pricing of public goods (1971)77666
219Graph Minors. II. Algorithmic Aspects of Tree-Width (1986)77280
220Molecular Computation Of Solutions To Combinatorial Problems (1994)76534
221The Space Complexity of Approximating the Frequency Moments (1999)76192
222A Fast String Searching Algorithm (1977)76441
223PP is as Hard as the Polynomial-Time Hierarchy (1991)76199
224Ullmanr introduction to automata theory (1979)76520
225A mathematical theory of communication (2001)762665
226An Object Calculus for Asynchronous Communication (1991)75326
227Some optimal inapproximability results (2001)75124
228A Taxonomy of Problems with Fast Parallel Algorithms (1985)75190
229Reachability Analysis of Pushdown Automata: Application to Model-Checking (1997)75208
230Impossibility of Distributed Consensus with One Faulty Process (1983)741250
231Testing Equivalences for Processes (1984)74354
232Termination of Rewriting (1987)74366
233Sorting Networks and Their Applications (1968)74487
234A Theory of Communicating Sequential Processes (1984)74336
235Relationships Between Nondeterministic and Deterministic Tape Complexities (1970)74188
236Reasoning About Infinite Computations (1994)74296
237Efficient Planarity Testing (1974)74211
238Linear Programming in Linear Time When the Dimension Is Fixed (1984)74176
239Approximation Algorithms for Facility Location Problems (1997)73174
240Process Algebra for Synchronous Communication (1984)73334
241Algebraic theory of processes (1988)73362
242Competitive Algorithms for Server Problems (1990)73159
243The Strength of Weak Learnability (1990)73640
244Statistical learning theory (1998)733543
245Inductive Inference of Formal Languages from Positive Data (1980)73220
246Proof-Carrying Code (1997)73850
247Algebraic Methods for Interactive Proof Systems (1992)73184
248Checking Computations in Polylogarithmic Time (1991)73161
249Algebra of Communicating Processes with Abstraction (1985)72282
250A decision-theoretic generalization of on-line learning and an application to boosting (1995)721672
251Algorithmic Aspects of Vertex Elimination on Graphs (1976)72254
252Voronoi Diagrams - A Survey of a Fundamental Geometric Data Structure (1991)72498
253Languages, Automata, and Logic (1997)72191
254The Complexity of Enumeration and Reliability Problems (1979)72324
255Average Case Complete Problems (1986)72177
256Barbed Bisimulation (1992)72199
257An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms (1988)72168
258The capacity of low-density parity-check codes under message-passing decoding (2001)71443
259The |D-calculus: a theory of mobile processes (2001)71298
260An automata-theoretic approach to automatic program ~verification (1986)71372
261A Computing Procedure for Quantification Theory (1960)71911
262Computation: finite and infinite machines (1962)71361
263Capacity of a Mobile Multiple-Antenna Communication Link in Rayleigh Flat Fading (1999)71360
264epsilon-Nets and Simplex Range Queries (1987)71188
265Trading Group Theory for Randomness (1985)71195
266Strengths and Weaknesses of Quantum Computing (1997)71213
267Three Partition Refinement Algorithms (1987)71331
268On the Power of Quantum Computation (1997)71244
269Arthur-Merlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes (1988)70174
270Randomness is Linear in Space (1996)70153
271Lambda Calculi with Types (1992)70369
272Separation Logic: A Logic for Shared Mutable Data Structures (2002)70457
273Completeness theorems for non-cryptographic fault-tolerant distributed computation (1988)70426
274formal languages and their relation to automata (1969)70317
275Matching Is as Easy as Matrix Inversion (1987)69161
276Approximation Algorithms for Scheduling Unrelated Parallel Machines (1987)69165
277Design and Implementation of an Efficient Priority Queue (1977)69173
278Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR (1996)69615
279Pseudorandom generators without the XOR Lemma (1998)69127
280The Complexity of Propositional Linear Temporal Logics (1985)69354
281Cryptographic Limitations on Learning Boolean Formulae and Finite Automata (1989)69183
282Eigenvalues and expanders (1986)68209
283The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory (1998)68192
284Estimation of dependences based on empirical data (1982)68671
285The Relative Efficiency of Propositional Proof Systems (1979)68226
286The Relative Efficiency of Propositional Proof Systems (1979)68149
287Extensions of lipschitz mappings into a hilbert space (1982)68258
288A Compositional Approach to Performance Modelling (1996)68523
289A Formulation of the Simple Theory of Types (1940)68562
290A Complexity Theoretic Approach to Randomness (1983)68141
291Recursively enumerable sets and degrees (1987)68380
292Probabilistic Checking of Proofs; A New Characterization of NP (1992)67164
293Applications of a Planar Separator Theorem (1980)67151
294Computational limitations on learning from examples (1988)67179
295Efficient probabilistically checkable proofs and applications to approximations (1993)67148
296Geometric algorithms and combinatorial optimization (1988)67224
297Preserving Order in a Forest in Less Than Logarithmic Time and Linear Space (1977)67145
298How to draw a planar graph on a grid (1990)67140
299Fast Text Searching Allowing Errors (1992)67316
300Quantifier elimination for real closed fields by cylindrical algebraic decomposition (1975)67283
301On Uniformity within NC¹ (1990)67172
302The Intractability of Resolution (1985)67241
303an introduction to computational learning theory (1994)67426
304Computational geometry: an introduction through randomized algorithms (1993)66169
305Simple word problems in universal algebras (1969)66406
306Time Bounds for Selection (1973)66239
307The travelling salesman problem with distances one and two (1993)66137
308Constant Depth Reducibility (1984)66150
309Algorithms on strings, trees, and sequences (1997)66436
310Property Testing in Bounded Degree Graphs (1997)66117
311The temporal logic o] reactive and concurrent systems (1992)66816
312The Definition of Standard ML (1990)66972
313A note on two problem in connexion with graphs65899
314An Optimal Algorithm for Approximate Nearest Neighbor Searching in Fixed Dimensions (1994)65214
315A General Approximation Technique for Constrained Forest Problems (1992)65138
316Boosting a Weak Learning Algorithm by Majority (1995)65355
317A heuristic for graph drawing (1984)65345
318Text Algorithms (1994)65201
319The NP-Completeness Column: An Ongoing Guide (1981)65186
320Mesh Generation And Optimal Triangulation (1992)65208
321Symbolic Boolean Manipulation with Ordered Binary-Decision Diagrams (1992)65854
322Embedding Planar Graphs on the Grid (1990)65145
323Surpassing the Information Theoretic Bound with Fusion Trees (1993)65137
324Storing a Sparse Table with 0(1) Worst Case Access Time (1984)64134
325A class of games possessing pure-strategy nash equilibria (1973)64300
326Throughput-Competitive On-Line Routing (1993)64175
327Symbolic Model Checking: 10^20 States and Beyond (1990)64806
328Slowing down sorting networks to obtain faster sorting algorithms (1987)64106
329Improved Combinatorial Algorithms for the Facility Location and k-Median Problems (1999)64167
330Matrix multiplication via arithmetic progressions (1987)64217
331Simple Construction of Almost k-wise Independent Random Variables (1992)64145
332Skip Lists: A Probabilistic Alternative to Balanced Trees (1990)63315
333A Framework for Defining Logics (1987)63321
334Fast Algorithms for Shortest Paths in Planar Graphs, with Applications (1987)63121
335Efficient Distribution-Free Learning of Probabilistic Concepts (1994)63181
336Integer and combhtatorial optimization (1988)631021
337How to draw a graph (1963)63236
338Complexity Measures for Public-Key Cryptosystems (1988)63126
339Finding Patterns Common to a Set of Strings (1980)63169
340A machine program for theorem-proving (1962)62854
341Lower bounds for algebraic computation trees (1983)62120
342Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms (1976)62220
343Polynomial Time Approximation Schemes for Euclidean Traveling Salesman and other Geometric Problems (1998)62144
344Pattern classification and scene analysis (1972)623571
345On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems (1982)62176
346Finding Approximate Patterns in Strings (1985)62165
347Relational Queries Computable in Polynomial Time (1986)62267
348Almost optimal lower bounds for small depth circuits (1986)62134
349An introduction to the general theory of algorithms (1978)62125
350Full Abstraction for PCF (2000)61168
351Uniform Proofs as a Foundation for Logic Programming (1991)61327
352The complexity of Boolean functions (1987)61261
353Representation of events in nerve nets and finite automata61321
354Parallel Prefix Computation (1980)61354
355Bounds on Multiprocessing Timing Anomalies (1969)61360
356Categories for the working mathematician (1971)61403
357Introduction to higher order categorical logic (1986)61341
358Graph Drawing by Force-directed Placement (1991)60449
359On Isomorphisms and Density of NP and Other Complete Sets (1977)60116
360Model-Checking in Dense Real-time (1993)60314
361Tense logic and the theory of linear order (1968)60230
362On the Power of Unique 2-Prover 1-Round Games (2002)60109
363Fast Parallel and Serial Approximate String Matching (1989)60127
364The Complexity of Optimization Problems (1988)60194
365Lov¨￠sz factoring polynomials with rational coefficients (1982)60242
366A theory o/ objects (1996)60484
367Proof verification and the intractability of approximation problems (1992)60150
368External-Memory Graph Algorithms (1995)60183
369Compression of Individual Sequences via Variable-Rate Coding (1978)59495
370An n5/2 Algorithm for Maximum Matchings in Bipartite Graphs (1973)59273
371Structured Operational Semantics and Bisimulation as a Congruence (1992)59180
372Convergence of stochastic processes (1984)59530
373A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies (1989)59182
374Computational Lambda-Calculus and Monads (1989)59362
375Cache-Oblivious Algorithms (1999)59253
376Methods for visual understanding of hierarchical system structures (1981)59268
377A decision method for elementary algebra and geometry59438
378Efficient noise-tolerant learning from statistical queries (1993)59137
379An Introduction to Parallel Algorithms (1992)59368
380Typing and Subtyping for Mobile Processes (1996)59240
381Lower Bounds for Algebraic Computation Trees (Preliminary Report) (1983)58130
382Drawing Planar Graphs Using the Canonical Ordering (1996)58114
383Optimization and approximation in deterministic sequencing and scheduling: a survey (1979)58390
384The Art of Computer Programming, Volume III: Sorting and Searching (1973)58668
385Singularity Analysis of Generating Functions (1990)58245
386Tree automata techniques and applications (1997)58265
387Approximation Schemes for Covering and Packing Problems in Image Processing and VLSI (1985)58165
388Computing on Data Streams (1998)58160
389Multiparty unconditionally secure protocols (1988)58246
390Cutting Hyperplanes for Divide-and-Conquer (1993)58103
391Space-Time block codes from orthogonal designs (1999)58898
392Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems (2001)58294
393Modeling and verification of randomized distributed real-time systems (1995)58185
394A Machine-Oriented Logic Based on the Resolution Principle (1965)58825
395The Model Checker SPIN (1997)571131
396The Theory of Ends, Pushdown Automata, and Second-Order Logic (1985)57108
397Pushdown Processes: Games and Model Checking (1996)57134
398Hiding Instances in Multioracle Queries (1990)57129
399Generalized Finite Automata Theory with an Application to a Decision Problem of Second-Order Logic (1968)57222
400On the method of bounded differences (1989)57216
401Approximation algorithms for np-hard problems (1997)57255
402Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation (2001)57126
403A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks (1988)57800
404A Dichromatic Framework for Balanced Trees (1978)57206
405A Randomized Algorithm for Closest-Point Queries (1988)57119
406Introduction to formal language theory (1978)57286
407The Complexity of Relational Query Languages (Extended Abstract) (1982)57330
408A Block-Sorting Lossless Data Compression Algorithm (1994)56356
409Games and Full Completeness for Multiplicative Linear Logic (1994)56173
410Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems (1999)56110
411Complexity of ~nding embeddings in a k-tree (1987)56234
412Further Applications of Random Sampling to Computational Geometry (1986)5667
413Some Connections between Nonuniform and Uniform Complexity Classes (1980)56156
414Using encryption for authentication in large networks of computers (1978)56884
415Decoding of Reed Solomon Codes beyond the Error-Correction Bound (1997)56152
416Clustering to Minimize the Maximum Intercluster Distance (1985)56200
417How to Share a Secret (1979)561343
418The Space Complexity of Approximating the Frequency Moments (1996)56249
419Designing Programs That Check Their Work (1989)56203
420Good Error-Correcting Codes Based on Very Sparse Matrices (1999)56404
421An approximation algorithm for the generalized assignment problem (1993)56129
422How to Recycle Random Bits (1989)56146
423On lipschitz embedding of finite metric spaces in hilbert space (1985)56171
424The Inductive Approach to Verifying Cryptographic Protocols (1998)56435
425Should Tables Be Sorted? (1981)55109
426Organization and Maintenance of Large Ordered Indexes (1970)55435
427A course in game theory (1994)551011
428Fulkerson flows in networks (1962)55249
429Some Simplified NP-Complete Graph Problems (1976)55275
430Petri Nets Are Monoids (1990)55124
431Institutions: Abstract Model Theory for Specification and Programming (1992)55261
432Design of capacity-approaching irregular low-density parity-check codes (2001)55363
433Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes (1986)55173
434Design Patterns: Elements of Reusable Object-Oriented Software (1995)556201
435Toward Efficient Agnostic Learning (1994)55137
436Modelling Concurrency with Partial Orders* (1986)55261
437Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs (1984)55221
438On data structures and asymmetric communication complexity (1995)5583
439A Final Coalgebra Theorem (1989)55117
440Multidimensional Binary Search Trees Used for Associative Searching (1975)55878
441Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces (1998)55112
442Scaling and Related Techniques for Geometry Problems (1984)55133
443Geometric Applications of a Matrix-Searching Algorithm (1987)55131
444Separating the polynomialtime hierarchy by oracles (1985)55118
445A Strongly Competitive Randomized Paging Algorithm (1991)55106
446Elements of algebraic topology (1984)54379
447The Stable Model Semantics for Logic Programming (1988)541262
448Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings (1979)54165
449A Calculus of Mobile Agents (1996)54261
450Logic Programming with Focusing Proofs in Linear Logic (1992)54226
451Counterspeculation auctions and competitive sealed tenders (1961)541142
452Learning From Noisy Examples (1987)54160
453Functions as Processes (1992)54183
454Geometric Range Searching and Its Relatives (1999)54113
455On the temporal analysis of fairness (1980)54255
456Notes on Finite Asynchronous Automata (1987)54110
457Competitive Algorithms for On-line Problems (1988)54114
458External Memory Algorithms and Data Structures: Dealing with MASSIVE DATA (2000)54184
459An Algorithm for Drawing General Undirected Graphs (1989)54387
460The Power of Geometric Duality (1985)54109
461Foundations for programming languages (1996)54276
462Closest-Point Problems (1975)54155
463A Linear-Time Algorithm for Finding a Sparse k-Connected Spanning Subgraph of a k-Connected Graph (1992)54109
464Quantum Circuit Complexity (1993)54157
465Surface Reconstruction by Voronoi Filtering (1999)54182
466Parallel Algorithms for Shared-Memory Machines (1990)54214
467Data streams: algorithms and applications (2003)53231
468How to use expert advice (1997)53165
469Sparsification - a technique for speeding up dynamic graph algorithms (1997)5397
470The Cell Probe Complexity of Dynamic Data Structures (1989)53110
471An automata-theoretic approach to branching-time model checking (2000)53185
472Gap-Definable Counting Classes (1991)53125
473The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space (1972)53134
474Maximal flow through a network53233
475Free Bits, PCPs, and Nonapproximability-Towards Tight Results (1998)53108
476Network information flow (2000)53693
477Vertex Cover: Further Observations and Further Improvements (2001)53108
478Communicating sequential processes (1978)531362
479LEDA: A Platform for Combinatorial and Geometric Computing (1995)53122
480Logic Programming in a Fragment of Intuitionistic Linear Logic (1994)53281
481Constant Depth Circuits, Fourier Transform, and Learnability (1993)53119
482A probabilistic theory of pattern recognition (1996)53487
483Speed is as powerful as clairvoyance (2000)53108
484A Linear Recognition Algorithm for Cographs (1985)53151
485Statecharts: A Visual Formalism for Complex Systems (1987)521906
486The Parallel Evaluation of General Arithmetic Expressions (1974)52242
487The price of selfish routing (2001)52119
488Introduction to parallel algorithms and architectures: arrays (1993)52416
489How Easy is Local Search? (1988)52175
490Computational Complexity of Probabilistic Turing Machines (1977)52169
491On Reduction-Based Process Semantics (1995)52138
492Interactive Proofs and the Hardness of Approximating Cliques (1996)52108
493On Power-law Relationships of the Internet Topology (1999)521060
494Linear-Time Algorithms for Linear Programming in R³ and Related Problems (1983)52161
495Improved Steiner tree approximation in graphs (2000)52162
496Ten lectures on the probabilistic method (1987)52124
497Combinatorial optimization: networks and matroids (1976)52275
498A Theory of Type Polymorphism in Programming (1978)52936
499Priority Search Trees (1985)52204
500On Limits of Wireless Communications in a Fading Environment when Using Multiple Antennas (1998)521497
501Optimal decoding of linear codes for minimizing symbol error rate (1974)521193
502A New Polynomial-Time Algorithm for Linear Programming (1984)52527
503Approximation algorithms for disjoint paths problems (1996)52118
504Resource Access Control in Systems of Mobile Agents (2002)51172
505Complexity of Network Synchronization (1985)51203
506Planar Formulae and Their Uses (1982)51130
507A Complete Inference System for a Class of Regular Behaviours (1984)51142
508Algorithms for Maximum Independent Sets (1986)5194
509Mellin Transforms and Asymptotics: Harmonic Sums (1995)51137
510Approximate Graph Coloring by Semidefinite Programming (1994)51153
511A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation (1995)51148
512College admissions and the stability of marriage (1962)51615
513How to generate and exchange secrets (1986)51364
514A local-ratio theorem for approximating the weighted vertex cover problem (1985)51120
515Efficient Randomized Pattern-Matching Algorithms (1987)51229
516Bit Commitment Using Pseudo-Randomness (1989)51195
517Optimization by Simmulated Annealing (1983)503877
518Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees (1997)5094
519On the Synthesis of a Reactive Module (1989)50207
520Hierarchical Correctness Proofs for Distributed Algorithms (1987)50385
521Data Structures for Mobile Data (1997)50136
522Expressing mobility in process algebras: first-order and higher-order paradigms (1992)50165
523On the Synthesis of Strategies in Infinite Games (1995)50137
524Optimal Suffix Tree Construction with Large Alphabets (1997)50100
525The Design of Dynamic Data Structures (1983)50121
526Efficient routing in all-optical networks (1994)50133
527Simplification by Cooperating Decision Procedures (1979)50353
528New directions in testing (1991)50105
529The Complexity of Multiterminal Cuts (1994)50134
530Systems that learn: an introduction to learnin theory for cognitive and computer scientists (1986)50106
531Distributed computing: a locality-sensitive approach (2000)50181
532Johnson: computers and intractability: a guide to the theory of np- completeness (freeman (1979)50483
533Two Algorithms for Maintaining Order in a List (1987)50142
534Dividing a Graph into Triconnected Components (1973)50171
535The Influence of Variables on Boolean Functions (1989)49118
536A deterministic view of random sampling and its use in geometry (1990)4998
537Theory and Applications of Trapdoor Functions (Extended Abstract) (1982)49180
538A Linear-Time Algorithm for Computing the Voronoi Diagram of a Convex Polygon (1989)49101
539Parallelism in Random Access Machines (1978)49300
540A Comparison of Polynomial Time Reducibilities (1975)49119
541Shortest Paths Without a Map (1991)49114
542Using dual approximation algorithms for scheduling problems theoretical and practical results (1987)49136
543Worst-case analysis of a new heuristic for the traveling salesman problem (1975)49183
544Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems (1999)49121
545Probability inequalities for sums of bounded random variables (1963)49191
546Lower bounds by probabilistic arguments (1983)4988
547The Complexity of Finite Functions (1990)49156
548The Polynomial-Time Hierarchy (1976)49201
549Small-bias Probability Spaces: Efficient Constructions and Applications (1990)4992
550Vector quantization and signal compression (1992)491326
551Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology (1997)49418
552Word problems requiring exponential time (1973)49168
553Universal Schemes for Parallel Communication (1981)49210
554Expander codes (1996)49158
555Expander flows, geometric embeddings and graph partitioning (2004)48100
556The String-to-String Correction Problem (1974)48577
557Learning in the Presence of Malicious Errors (1993)48126
558Explicit Constructions of Linear-Sized Superconcentrators (1981)48115
559Sharing the Cost of Multicast Transmissions (2001)48196
560Faster Scaling Algorithms for Network Problems (1989)48123
561Simulating Physics with Computers (1982)48371
562An introduction to probability theory and its applications volume ii (1966)48617
563Short proofs are narrow - resolution made simple (2001)48125
564Domain Theory in Logical Form (1987)48139
565Combinatorial algorithms for integrated circuit layout (1990)48363
566How bad is selfish routing? (2002)48240
567Gaussian elimination is not optimal (1969)48318
568How to Emulate Shared Memory (1991)48231
569Generalized String Matching (1987)4893
570Spanning Trees and Spanners (1996)48109
571Computational Interpretations of Linear Logic (1993)47226
572Authoritative sources in a hyperlinked environment (1999)472100
573Propositional Dynamic Logic of Regular Programs (1979)47328
574Bisimulation from Open Maps (1996)4791
575Routing, Merging, and Sorting on Parallel Models of Computation (1985)47150
576The capacity of wireless networks (2000)471696
577Visibility and Intersection Problems in Plane Geometry (1989)4780
578Learning Conjunctions of Horn Clauses (1992)47113
579Improved decoding of Reed-Solomon and algebraic-geometry codes (1999)47178
580A lattice-theoretical ~xpoint theorem and its applications47460
581Reversal-Bounded Multicounter Machines and Their Decision Problems (1978)4790
582Efficient String Matching: An Aid to Bibliographic Search (1975)47405
583Evolution of random search trees (1992)47158
584Towards a Mathematical Operational Semantics (1997)47100
585An introduction to kolmogorov complexity and its applications (1993)47284
586Automata-Theoretic Techniques for Modal Logics of Programs (1986)47189
587Wegman "universal classes of hash functions (1979)47130
588Probability inequalities for sums of bounded random variables (1963)47145
589Property Testing and Its Connection to Learning and Approximation (1996)4786
590KLAIM: A Kernel Language for Agents Interaction and Mobility (1998)47227
591Zero Knowledge and the Chromatic Number (1998)47102
592A Separator Theorem for Graphs of Bounded Genus (1984)4779
593Space-efficient Static Trees and Graphs (1989)4796
594A General Lower Bound on the Number of Examples Needed for Learning (1989)47151
595The Algorithmic Analysis of Hybrid Systems (1995)47584
596Near shannon limit error-correcting coding and decoding: turbo-codes (1993)461071
597Proving theorems by pattern recognition (1961)46125
598Layered space-time architec-ture for wireless communication in a fading environment when using multi-element anten-nas (1996)46846
599How to exchange secrets by oblivious transfer (1981)46274
600A Study of Replacement Algorithms for Virtual-Storage Computer (1966)46455
601The System F of Variable Types, Fifteen Years Later (1986)46111
602Handbook of mathematical functions (1965)463454
603A Powerdomain Construction (1976)46162
604Symmetric Functions and Hall Polynomials (1995)46891
605A Tourist Guide through Treewidth (1993)46151
606The Ultimate Planar Convex Hull Algorithm? (1986)46115
607Reaching Agreement in the Presence of Faults (1980)46504
608Cryptographic Limitations on Learning Boolean Formulae and Finite Automata (1994)46137
609Full Abstraction in the Lazy Lambda Calculus (1993)46118
610Data structures and algorithms 3: multi-dimensional searching and computational geometry (1984)46114
611Computers and Intractability-a Guide to NP-completeness (1979)46328
612Checking That Finite State Concurrent Programs Satisfy Their Linear Specification (1985)46298
613The reexive chemical abstract machine and the joincalculus (1996)46158
614An Efficient Approximation Scheme for the One-Dimensional Bin-Packing Problem (1982)4694
615The Complexity of Combinatorial Problems with Succinct Input Representation (1986)46135
616Improved non-approximability results (1994)4695
617Average-Case Analysis of Algorithms on Sequences (2001)46159
618Trans-Dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths (1994)4686
619A Filter Lambda Model and the Completeness of Type Assignment (1983)46163
620A Very Simple Algorithm for Estimating the Number of k-Colorings of a Low-Degree Graph (1995)4687
621Opportunistic Data Structures with Applications (2000)45117
622Small Distortion and Volume Preserving Embeddings for Planar and Euclidean Metrics (1999)4571
623A Randomized Protocol for Signing Contracts (1982)45340
624Weakly learning DNF and characterizing statistical query learning using Fourier analysis (1994)4592
625Equilibrium points in n-person games45609
626Towards a theory of type structure (1974)45323
627The tempoml logic of reactive and concurrent sgstems: specification (1991)45340
628Regular algebra and finite machines (1971)45173
629Generalized first-order spectra, and polynomial. time recognizable sets (1974)45182
630Combinatorial optimization: polyhedra and efficiency (2003)45187
631On Uniform Circuit Complexity (1981)45135
632Hard examples for resolution (1987)45155
633An Optimal Algorithm for Intersecting Line Segments in the Plane (1992)45110
634A unified approach to approximating resource allocation and scheduling (2000)4581
635Transductions and context-free languages (1979)45198
636Exact Learning Boolean Functions via the Monotone Theory (1995)4586
637The Benefits of Relaxing Punctuality (1991)45168
638Fading Channels: Information-Theoretic and Communication Aspects (1998)45265
639Automatic Verification of Probabilistic Concurrent Finite-State Programs (1985)45159
640Convergence of probability measures (1971)451720
641Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems (1999)45103
642Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees (1991)4573
643Petri Nets, Event Structures and Domains, Part I (1981)45104
644Randomized Incremental Construction of Delaunay and Voronoi Diagrams (1992)45126
645The theory of partitions (1976)45477
646An Introduction to Symbolic Dynamics and Coding (1995)44350
647Improved Bounds for Planar k -Sets and Related Problems (1998)4484
648Godel Numberings of Partial Recursive Functions (1958)4471
649Algorithms for Parallel Memory I: Two-Level Memories (1994)44179
650Factor graphs and the sum-product algorithm (2001)44692
651Complexity of relational query languages (1982)44226
652The complexity of robot motion planning (1988)44421
653Universal codeword sets and representations of the integers (1975)44238
654Succinct indexable dictionaries with applications to encoding k-ary trees and multisets (2002)4491
655Data Structures and Algorithms (1983)44729
656Finding Small Simple Cycle Separators for 2-Connected Planar Graphs (1986)4482
657Topologically Sweeping an Arrangement (1989)4494
658A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach (1988)4495
659A Framework for Solving VLSI Graph Layout Problems (1984)44144
660Universally Composable Security: A New Paradigm for Cryptographic Protocols (2001)44373
661Expanders that beat the eigenvalue bound: explicit construction and applications (1993)4480
662Outline of a mathematical theory of computation (1970)44192
663The Design and Analysis of Spatial Data Structures (1990)44880
664Computability in analysis and physics (1989)44175
665Finite-State Transducers in Language and Speech Processing (1997)44275
666Handbook of Applied Cryptography (1996)442426
667External-Memory Computational Geometry44130
668On the Composition of Zero-Knowledge Proof Systems (1990)44167
669Introduction to lattices and order (1990)44641
670Quick Approximation to Matrices and Applications (1999)4492
671Labelling and Implicit Routing in Networks (1985)44149
672A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification (1991)44241
673A Simple Parallel Tree Contraction Algorithm (1989)44141
674How to Go Beyond the Black-Box Simulation Barrier (2001)44125
675The Quantitative Structure of Exponential Time (1993)4379
676A Linear Algorithm for Embedding Planar Graphs Using PQ-Trees (1985)43112
677A Combinatorial Approach to Planar Non-colliding Robot Arm Motion Planning (2000)4376
678Greedy Strikes Back: Improved Facility Location Algorithms (1998)43100
679Linear Multiuser Receivers: Effective Interference, Effective Bandwidth and User Capacity (1999)43287
680On the Learnability of Boolean Formulae (1987)4385
681Grhbner basis: an algorithmic method in polynomial ideal theory (1985)43214
682Three approaches to the quantitative definition of information (1965)43367
683Finite automata and their decision problems43209
684Voronoi Diagrams and Arrangements (1986)4398
685Inductive Inference: Theory and Methods (1983)43181
686Algorithmic Applications of Low-Distortion Geometric Embeddings (2001)4370
687On Computing the Determinant in Small Parallel Time Using a Small Number of Processors (1984)43110
688Local search heuristic for k-median and facility location problems (2001)43130
689Truthful Mechanisms for One-Parameter Agents (2001)43110
690On the Density of Families of Sets (1972)43152
691A Packing Problem with Applications to Lettering of Maps (1991)4394
692Tetrahedral Mesh Generation by Delaunay Refinement (1998)43106
693Fast Detection of Polyhedral Intersections (1982)43102
694Private Coins versus Public Coins in Interactive Proof Systems (1986)43116
695Rational series and their languages (1988)43165
696Learning Read-Once Formulas with Queries (1993)4395
697Algorithms for Quantum Computation: Discrete Logarithms and Factoring (1994)43394
698Graph minors. X. Obstructions to tree-decomposition (1991)43114
699Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications (1996)4382
700The Probabilistic Communication Complexity of Set Intersection (1992)4399
701A Syntactic Approach to Type Soundness (1994)43434
702Universal one-way hash functions and their cryptographic applications (1989)43300
703An Algorithm for the General Petri Net Reachability Problem (1984)43120
704A New Approach to Abstract Syntax with Variable Binding (2002)42151
705A Combinatorial Bound for Linear Programming and Related Problems (1992)4282
706The art of uninformed decisions: A primer to property testing (2001)4268
707Optimal Time-Critical Scheduling via Resource Augmentation (2002)42114
708The Lazy Lambda Calculus (1990)42177
709An Optimal Algorithm for Approximate Nearest Neighbor Searching (1994)42172
710Competitive auctions and digital goods (2001)4292
711Alternation (1981)42118
712Noiseless coding of correlated information sources (1973)42670
713Incidence matrices and interval graphs (1965)42170
714An introduction to the analysis of algorithms (1996)42174
715PVS: A Prototype Verification System (1992)42409
716A compendium of continuous lattices (1980)42324
717Combinatorial Complexity Bounds for Arrangement of Curves and Spheres (1990)42109
718Bisimulation Can't be Traced (1995)42107
719Compressed Su x Arrays and Su x Trees with Applications to Text Indexing and String Matching (2000)4298
720Probabilistic Methods in Combinatorics (1974)42104
721A Functional Approach to Data Structures and Its Use in Multidimensional Searching (1988)42108
722Approximation Schemes for Euclidean k-Medians and Related Problems (1998)42104
723Transducers and Repetitions (1986)4293
724Symbolic logic and mechanical theorem proving (1973)42509
725An Algebraic Definition of Simulation Between Programs (1971)42205
726Small-Dimensional Linear Programming and Convex Hulls Made Easy (1991)4280
727Controlling Interference in Ambients (2000)42146
728Foundations of cryptography: basic tools (2001)42199
729Bounded Query Classes (1990)42139
730A survey of parallel algorithms for shared memory machines (1990)42174
731Unitary space-time modulation for multiple-antenna communications in Rayleigh flat fading (2000)42248
732Learning Decision Lists (1987)42311
733How to Generate and Exchange Secrets (Extended Abstract) (1986)42193
734A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem (2001)4295
735Optimal Packing and Covering in the Plane are NP-Complete (1981)42106
736An Improved Algorithm for Approximate String Matching (1990)42102
737Some Algebraic and Geometric Computations in PSPACE (1988)42122
738P = BPP if E Requires Exponential Circuits: Derandomizing the XOR Lemma (1997)4275
739Buy-at-Bulk Network Design (1997)4167
740Two Algorithms for Nearest-Neighbor Search in High Dimensions (1997)41151
741A guided tour to approximate string matching (2001)41308
742A tutorial on (co)algebras and (co)induction (1997)41134
743Rectilinear Planar Layouts and Bipolar Orientations of Planar Graphs (1986)4180
744Parallelism in Comparison Problems (1975)41106
745High-order entropy-compressed text indexes (2003)41103
746Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation (2000)41109
747Isabelle/HOL - A Proof Assistant for Higher-Order Logic (2002)41178
748UPPAAL in a Nutshell (1997)41468
749Classes of Graphs Which Approximate the Complete Euclidean Graph (1992)41111
750On Syntactic versus Computational Views of Approximability (1994)41104
751Branching Time and Abstraction in Bisimulation Semantics (1996)41184
752Geometry of cuts and metrics (1997)41172
753Generative Communication in Linda (1985)41791
754Polynomial algorithm in linear programming (1980)41234
755A Logic for Reasoning about Time and Reliability (1994)41243
756An Optimal Online Algorithm for Metrical Task Systems (1987)4173
757On Shortest Paths in Polyhedral Spaces (1984)41110
758A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events (1994)41140
759Ordering by divisibility in abstract algebras41178
760Multidimensional Divide-and-Conquer (1980)41153
761Compact routing schemes (2001)41139
762Multi-Prover Interactive Proofs: How to Remove Intractability Assumptions (1988)41106
763On the computational complexity of algorithms (1965)41154
764Algebraic Combinatorics on Words (2002)41183
765Packet Routing and Job-Shop Scheduling in O(Congestion + Dilation) Steps (1994)40100
766Aproximating the Value of Two Prover Proof Systems, With Applications to MAX 2SAT and MAX DICUT (1995)40114
767Graph Expressions and Graph Rewritings (1987)4094
768Learning decision trees using the Fourier spectrum (1991)40102
769Stochastic Models for the Web Graph (2000)40194
770Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems (1975)40168
771Lower bounds for the monotone complexity of some boolean funtions (1985)4096
772A Probabilistic Powerdomain of Evaluations (1989)40104
773On Bisimulations for the Asynchronous pi-Calculus (1996)40124
774Approximating a Finite Metric by a Small Number of Tree Metrics (1998)4074
775Designing Programs that Check Their Work (1995)40151
776The nature of statistical learning theory (2000)404399
777A Theory of Program Size Formally Identical to Information Theory (1975)40225
778Algorithms for computer algebra (1992)40190
779Data Structures for Mobile Data (1999)4095
780Emergence of scaling in random networks (1999)401103
781Introduction to Coding Theory (1992)40202
782The Anatomy of a Large-Scale Hypertextual Web Search Engine (1998)402463
783Algorithms for Drawing Graphs: an Annotated Bibliography (1994)40182
784Constraint logic programming (1987)40744
785Excluded minors, network decomposition, and multicommodity flow (1993)4072
786The Maximum Concurrent Flow Problem (1990)40116
787Clique is hard to approximate within n~-~ in 37th annual symposium on foundations of computer science (1996)4088
788Ray Shooting in Polygons Using Geodesic Triangulations (1994)4068
789Provably Good Mesh Generation (1990)40110
790The Use of Explicit Plans to Guide Inductive Proofs (1988)40242
791Optimal Algorithms for Approximate Clustering (1988)40127
792Paths trees and flowers (1965)40209
793Constructing Arrangements of Lines and Hyperplanes with Applications (1986)40100
794BPP Has Subexponential Time Simulations Unless EXPTIME has Publishable Proofs (1993)4071
795Generating Quasi-random Sequences from Semi-random Sources (1986)4070
796Pict: a programming language based on the Pi-Calculus (2000)40253
797Temporal Logic Can Be More Expressive (1981)40258
798Logical reversibility of computation (1973)40329
799Designing Networks with Compact Routing Tables (1988)4098
800Crossing number is np-complete (1983)40134
801Models of random regular graphs (1999)4097
802Introduction to hol: a theorem proving environment for higher-order logic (1993)40368
803An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm (1998)4088
804A Model for Hierarchical Memory (1987)40117
805Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces (1988)4083
806The complexity of pure Nash equilibria (2004)39110
807Branching Processes of Petri Nets (1991)39116
808An Automata-Theoretic Approach to Linear Temporal Logic (1995)39185
809A mathematical introduction to logic (1972)39563
810Deterministic Simulation in LOGSPACE (1987)3973
811On the complexity of wautomata (1988)39112
812Almost Tight Upper Bounds for Lower Envelopes in Higher Dimensions (1994)3980
813Probabilistic Simulations for Probabilistic Processes (1994)39128
814Constrained Delaunay Triangulations (1989)39128
815Prediction-Preserving Reducibility (1990)3983
816Approximation to bayes risk in repeated play39148
817Parallel Tree Contraction and Its Application (1985)39134
818On Range Searching with Semialgebraic Sets (1994)3983
819On-Line Construction of Suffix Trees (1995)39258
820A Domain Equation for Bisimulation (1991)39104
821A Fast Parametric Maximum Flow Algorithm and Applications (1989)39112
822A Really Temporal Logic (1989)39153
823Undirected Single-Source Shortest Paths with Positive Integer Weights in Linear Time (1999)3988
824Graph Rewriting: An Algebraic and Logic Approach (1990)39123
825Learning Disjunction of Conjunctions (1985)39114
826Graph Minors .XIII. The Disjoint Paths Problem (1995)39104
827The Directed Subgraph Homeomorphism Problem (1980)39126
828The Discrete Geodesic Problem (1987)39135
829On visible surface generation by a priori tree structures (1980)39328
830Inequalities: Theory of Majorization and Its Application (1979)39622
831Types and programming languages (2002)39436
832The LCA Problem Revisited (2000)39115
833The Semantics of Simple Language for Parallel Programming (1974)39677
834Prudence and Other Conditions on Formal Language Learning (1990)3976
835Partial evaluation and automatic program generation (1993)39834
836The undecidability of the domino problem (1966)39152
837Completeness Classes in Algebra (1979)3992
838Applications of Path Compression on Balanced Trees (1979)39113
839Solving sparse linear equations over finite fields (1986)39153
840An O(n log n) Algorithm for Finding All Repetitions in a String (1984)3975
841Faster Shortest-Path Algorithms for Planar Graphs (1997)3983
842Self-Testing/Correcting for Polynomials and for Approximate Functions (1991)3958
843An algorithm for planarity testing of graphs (1966)39109
844Bounded Geometries, Fractals, and Low-Distortion Embeddings (2003)3999
845Closure properties of constraints (1997)39123
846Voronoi diagrams based on convex distance functions (1985)3966
847The Buffer Tree: A New Technique for Optimal I/O Algorithms (1995)39100
848Graph-based algorithms for boolean function manipulation (1986)39861
849Scheduling to Minimize Average Completion Time: Off-line and On-line Algorithms (1996)38105
850On Fast Multiplication of Polynomials over Arbitrary Algebras (1991)3896
851Topologically Sweeping an Arrangement (1986)3866
852Integer programming with a fixed number of vaxiables (1983)38169
853Algorithms on strings (1997)38328
854Parallel Computational Geometry (1988)3890
855Spectral Efficiency of CDMA with Random Spreading (1999)38130
856Wait-free synchronization (1991)38523
857The complexity of perfect zero-knowledge (1987)3895
858Bisimulation Equivalence is Decidable for All Context-Free Processes (1995)3873
859Studies in the economics of transportation38285
860Complexity Theory of Real Functions (1991)38111
861A Fast Planar Partition Algorithm, I (1990)3872
862A deterministic algorithm for sparse multivariate polynomial interpolation (1988)3862
863The Steiner Problem with Edge Lengths 1 and 2 (1989)3894
864The Calculus of Constructions (1988)38182
865Competitive Paging with Locality of Reference (1995)3869
866Identifying the Minimal Transversals of a Hypergraph and Related Problems (1995)38139
867On the Regular Structure of Prefix Rewriting (1992)3871
868Recursive unsolvability of post's problem of 'tag' and other topics in the theory of turing machines (1961)3896
869Verifying Programs with Unreliable Channels (1993)3879
870The neighbor-joining method: a new method for reconstructing phylogenetic trees (1987)383609
871Many Hard Examples for Resolution (1988)38106
872The mathematical theory of context-free languages (1966)38136
873Disjoint Paths in Densely Embedded Graphs (1995)3874
874Las Vegas Algorithms for Linear and Integer Programming when the Dimension is Small (1995)3881
875An Optimal Algorithm for Approximate Nearest Neighbor Searching Fixed Dimensions (1998)38296
876The Structure and Complexity of Nash Equilibria for a Selfish Routing Game (2002)3874
877Recent Developments in Explicit Constructions of Extractors (2002)3883
878The Markov Chain Monte Carlo Method: An Approach To Approximate Counting And Integration (1996)38168
879A New Data Structure for Representing Sorted Lists (1982)3884
880Abstract Syntax and Variable Binding (1999)38128
881A logic of authentication (1990)38599
882Competitive Algorithms for Distributed Data Management (1995)38117
883Protocols for secure computations (1982)38427
884Types, Abstraction and Parametric Polymorphism (1983)38206
885Visibility Problems for Polyhedral Terrains (1989)3875
886Symbolic Model Checking without BDDs (1999)38649
887Tree Acceptors and Some of Their Applications (1970)38143
888Approximation Algorithms for Directed Steiner Problems (1998)38115
889Symbolic model checking: an approach to the state explosion problem (1993)38601
890Termination of term rewriting using dependency pairs (2000)38171
891Verifiable Implementations of Geometric Algorithms Using Finite Precision Arithmetic (1988)3885
892Design and self-assembly of two-dimensional dna crystals (1998)38151
893Dill: A Theory of Timed Automata (1994)38116
894Undirected ST-connectivity in log-space (2005)3876
895Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels (2003)38440
896Negative Results for Equivalence Queries (1990)3882
897On Generating All Maximal Independent Sets (1988)38154
898A Constant-Factor Approximation Algorithm for the k-Median Problem (2002)3896
899Drawing Graphs Nicely Using Simulated Annealing (1996)37186
900Hard-Core Distributions for Somewhat Hard Problems (1995)3787
901Automata For Modeling Real-Time Systems (1990)37297
902A New Approach to the Minimum Cut Problem (1996)3794
903Interaction Nets (1990)37133
904Private vs. Common Random Bits in Communication Complexity (1991)3776
905Bounds for certain multiprocessor anomalies (1966)3789
906The price of anarchy of finite congestion games (2005)3779
907An Optimal Synchronizer for the Hypercube (1989)3773
908Security and Composition of Multiparty Cryptographic Protocols (2000)37289
909Systematic Design of Program Analysis Frameworks (1979)37487
910Theory of Traces (1988)3768
911Counterexamples to Termination for the Direct Sum of Term Rewriting Systems (1987)37104
912Provably Good Mesh Generation (1994)3784
913Network Flow and Testing Graph Connectivity (1975)37110
914Arrangements and Their Applications (1998)3777
915Towards Exact Geometric Computation (1997)3792
916Rapid solution of problems by quantum computation (1992)37209
917Efficient dispersal of information for security, load balancing, and fault tolerance (1989)37388
918Exact stochastic simulation of coupled chemical reactions (1977)37560
919Visibility and intersectin problems in plane geometry (1985)3749
920An O(n log n) Sorting Network (1983)37103
921Natural Proofs (1997)3798
922Subtyping Recursive Types (1993)37211
923CCS Expressions, Finite State Processes, and Three Problems of Equivalence (1990)37130
924On the Complexity of Dualization of Monotone Disjunctive Normal Forms (1996)37118
925String-matching and other products (1974)3790
926On Some Tighter Inapproximability Results (1998)3783
927The traveling salesman problem (1985)37285
928Well-structured transition systems everywhere! (2001)37124
929An Optimal On-Line Algorithm for Metrical Task System (1992)3793
930A Scheme for Fast Parallel Communication (1982)37199
931On Context-Free Languages (1966)37115
932Probabilistic reasoning in intelligent systems: networks of plausible inference (1988)372953
933Combinatorial Optimization with Rational Objective Functions (1978)37112
934Combinatorial Optimization with Rational Objective Functions (1978)37243
935Analysis of Two Simple Heuristics on a Random Instance of k-SAT (1996)37108
936Competitive Non-Preemptive Call Control (1994)3791
937A decomposition theorem for partially ordered sets37173
938A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees (1995)37101
939Defining Liveness (1985)37309
940Reverse Search for Enumeration (1996)37124
941The Complexity of Probabilistic Verification (1995)37143
942The Complexity of Stochastic Games (1992)37106
943On computable numbers with an application to the entscheidungsproblem37626
944Euclidean shortest path in the presence of rectilinear barriers (1984)3774
945Concurrent Zero-Knowledge (1998)37156
946Binary codes capable of correcting deletions, inser-tions and reversals (1966)37685
947Approximate distance oracles (2001)3798
948The complexity of searching a graph (1988)37117
949Expected Time Bounds for Selection (1975)37138
950A Linear Algorithm for Determining the Separation of Convex Polyhedra (1985)36104
951BPP has Subexponential Time Simulations unless EXPTIME has Publishable Proofs (Extended Abstract) (1993)3663
952Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph (1992)3667
953The Smallest Automaton Recognizing the Subwords of a Text (1985)3685
954Random Oracles are Practical: A Paradigm for Designing Efficient Protocols (1993)361025
955Large deviation techniques and applications (1992)36734
956Analysis of a Local Search Heuristic for Facility Location Problems (1998)3689
957An Algorithmic Approach to the Lovász Local Lemma. I (1991)3663
958Applications of Random Sampling in Computational Geometry, II (1988)3659
959Private Information Retrieval (1998)36185
960Probability and Plurality for Aggregations of Learning Machines (1988)3661
961New Lower Bound Techniques for Robot Motion Planning Problems (1987)36143
962Arboricity and Subgraph Listing Algorithms (1985)3682
963A new greedy approach for facility location problems (2002)3680
964Algebraic Methods for Interactive Proof Systems (1990)3688
965Multidimensional Searching Problems (1976)3693
966An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set (1972)36171
967John hopkins university press (1996)36950
968Divide-and-conquer approximation algorithms via spreading metrics (2000)3665
969The Asymptotic Number of Labeled Graphs with Given Degree Sequences (1978)3694
970Machine Inductive Inference and Language Identification (1982)3669
971Turing machines that take advice (1982)3691
972A recursive approach to low complexity codes (1981)36290
973The essence of algol (1981)36147
974Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems (1998)36132
975Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width (2000)3696
976The logic of bunched implications (1999)36129
977Reasoning about The Past with Two-Way Automata (1998)36102
978A course in computational algebraic number theory (1993)36564
979Concurrent program schemes and their interpretations (1977)36103
980Fast String Matching with k Differences (1988)3673
981Investigations in logical deduction (1969)36181
982The Byzantine Generals Problem (1982)36932
983Fundamental Properties of Infinite Trees (1983)36143
984Probability and Random Processes (1992)36426
985Lower bounds on the size of bounded depth networks over a complete basis with logical addition (1987)3681
986Geometric shortest paths and network optimization (2000)36111
987Applications of approximation algorithms to cooperative games (2001)36103
988Kinetic Data Structures - A State of the Art Report (1998)3671
989Fat Triangles Determine Linearly Many Holes (1994)3662
990Algorithms for random generation and counting: a markov chain approach (1993)36103
991Probability: theory and examples (1996)36548
992Approximation and complexity classes (1988)3686
993Sequencing and scheduling: algorithms and complexity (1993)36174
994A Theorem on Polygon Cutting with Applications (1982)3675
995Linear-time encodable and decodable error-correcting codes (1996)3689
996Efficient Testing of Large Graphs (1999)3654
997How to play ANY mental game (1987)36282
998Calculi for Synchrony and Asynchrony (1983)36183
999Log Depth Circuits for Division and Related Problems (1986)36109
1000Dispersers, Deterministic Amplification, and Weak Random Sources. (1989)3662
    1  2  3  4  5  6  7  8  9  Next
Microsoft Research Asia | Help | Feedback | Specific Terms
©2009 Microsoft Corporation. All rights reserved. Contact Us | Terms of Use | Trademarks | Privacy Statement