1996 3 3CONLINE Shene, A Comparative Study of Linked List Sorting Algorithms 1994 1 3CONLINE Janik, Textbooks for Teaching C++ 1992 10 AAAI Dean & Basye & Kaelbling & Kokkevis & Maron & Angluin & Engelson, Inferring Finite Automata with Stochastic Output Functions and an Application to Map Learning 1992 10 AAAI Kearns, Oblivious PAC Learning of Concept Hierarchies 1992 10 AAAI Langley & Iba & Thompson, An Analysis of Bayesian Classifiers 1992 10 AAAI Tadepalli, A theory of Unsupervised Speedup Learning 1995 11 AAECC Bassalygo, Supports of a Code 1995 11 AAECC Benecke & Grund & Hohberger & Kerber & Laue & Wieland, Chemical Isomerism, a Challenge for Algebraic Combinatorics and for Computer Science 1995 11 AAECC Honkala & Litsyn & Tietavainen, On Algebraic Methods in Covering Radius Problems 1995 11 AAECC Pardo, How Lower and Upper Complexity Bounds Meet in Elimination Theory 1995 11 AAECC Schonhage, Bivariate Polynomial Multiplication Patterns 1995 11 AAECC Ashikhmin & Barg & Cohen & Huguet, Variations on Minimal Codewords in Linear Codes 1995 11 AAECC Bocharova & Kudryashov, Fast Exponentiation in Cryptography 1995 11 AAECC Boyvalenkov & Landgev, On Maximal Spherical Codes I 1995 11 AAECC Conti & Traverso, A Case of Automatic Theorem Proving in Euclidean Geometry: the Maclane 8_3 Theorem 1995 11 AAECC Giusti & Heintz & Morais & Pardo, When Polynomial Equation Systems Can Be ``Solved'' Fast? 1995 11 AAECC Koseleff, About Approximations of Exponentials 1995 11 AAECC Matera, Integration of Multivariate Rational Functions Given by Straight-Line Programs 1995 11 AAECC Maza & Rioboo, Polynomial Gcd Computations over Towers of Algebraic Extensions 1995 11 AAECC Nguyen & Wood, Displacements of Matrix Products 1995 11 AAECC Sakata & Kurihara, A Fast Parallel Implementation of the Berlekamp-Massey Algorithm with a One-D Systolic Array Architecture 1995 11 AAECC Schapira, Tomography of Constructible Functions 1993 10 AAECC Calderbank & Fishburn & Rabinovich, Sequence Based Methods for Data Transmission and Source Compression 1993 10 AAECC Hammons & Kumar & Calderbank & Sloane & Sole, On the Apparent Duality of the Kerdock and Preparata Codes 1993 10 AAECC Levenshtein, Bounds for Codes as Solutions of Extremum Problems for Systems of Orthogonal Polynomials 1993 10 AAECC Sweedler, Using Groebner Bases to Determine the Algebraic and Transcendental Nature of Field Extensions: Return of the Killer Tag Variables 1993 10 AAECC Bigatti & Conti & Robbiano & Traverso, A ``Divide and Conquer'' Algorithm for Hilbert-Poincare Series, Multiplicity and Dimension of Monomial Ideals 1993 10 AAECC Canny & Emiris, An Efficient Algorithm for the Sparse Mixed Resultant 1993 10 AAECC Fang & van Tilborg & Sun & Honkala, Some Features of Binary Block Codes for Correcting Asymmetric Errors 1993 10 AAECC Fellows & Koblitz, Fixed-Parameter Complexity and Cryptography 1993 10 AAECC Feng & Rao, A Class of Algebraic Geometric Codes from Curves in High-Dimensional Projective Spaces 1993 10 AAECC Gong, A New Class of Sequences: Mapping Sequences 1993 10 AAECC Grigoriev & Karpinski, A Zero-Test and an Interpolation Algorithm for the Shifted Sparse Polynomials 1993 10 AAECC Kaltofen, Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems 1993 10 AAECC Lempel & Seroussi, Application of Finite Fields to Memory Interleaving 1993 10 AAECC Renteria & Tapia-Recillas, Energy Functions Associated with Error-Correcting Codes 1993 10 AAECC Stern, Approximating the Number of Error Locations within a Constant Ratio is NP-complete 1993 10 AAECC van Tilburg, Two Chosen Plaintext Attacks on the Li-Wang Joint Authentication and Encryption Scheme 1993 10 AAECC Vardy & Etzion, Some Constructions of Perfect Binary Codes 1991 9 AAECC Cellini & Gianni & Traverso, Algorithms for the Shape of Semialgebraic Sets. A New Approach 1991 9 AAECC Litsyn, Fast Algorithms for Decoding Orthogonal and Related Codes 1991 9 AAECC Canny, An Improved Sign Determination Algorithm 1991 9 AAECC Diab, New Systolic Architectures for Cyclic Code Encoding 1991 9 AAECC Dinneen & Fellows & Faber, Algebraic Constructions of Efficient Broadcast Networks 1991 9 AAECC Li & Wang, A Joint Authentication and Encryption Scheme Based on Algebraic Coding Theory 1991 9 AAECC Lobstein & Sole, Arithmetic Codes - Survey, Recent and New Results 1991 9 AAECC Otto, Some Undecidability Results for Weakly Confluent Monadic String-Rewriting Systems 1991 9 AAECC Rifa & Borrell, Improving the Time Complexity of the Computation of Irreducible and Primitive Polynomials in Finite Fields 1990 8 AAECC Cohen, Covering Radius and Writing on Memories 1990 8 AAECC Heintz & Krick & Roy & Solerno, Geometric Problems Solvable in Single Exponential Time 1990 8 AAECC Sinaki, Error-Coded Algorithms for On-Line Arithmetic 1990 8 AAECC Langemyr, An Asymptotically Fast Probabilistic Algorithm for Computing Polynomial GCD's over an Algebraic Number Field 1990 8 AAECC Diab, Systolic Architectures for Multiplication over Finite Field GF(2^m) 1990 8 AAECC Cooperman & Finkelstein & Sarawagi, Applications of Cayley Graphs 1990 8 AAECC Zheng & Matsumoto & Imai, Duality between Two Cryptographic Primitives 1989 6 AAECC Assmus, The Coding Theory of Finite Geometries and Designs 1989 6 AAECC van Lint, Recent Results on Covering Problems 1989 6 AAECC Michon, Codes and Curves 1989 6 AAECC Robbiano, Computer and Commutative Algebra 1989 6 AAECC Schnorr, The Multiplicative Complexity of Boolean Functions 1989 6 AAECC Brown & Finkelstein & Purdom, Backtrack Searching in the Presence of Symmetry 1989 6 AAECC Bucci & Di Porto, Fast Serial-Parallel Multipliers 1989 6 AAECC Buchmann & Pohst, On the Complexity of Computing Class Groups of Algebraic Number Fields 1989 6 AAECC Caniglia & Galligo & Heintz, Some New Effectivity Bounds in Computational Geometry 1989 6 AAECC Ferre, Fast Integer Multiplication by Block Recursive, Number Theoretical Transforms 1989 6 AAECC Flajolet & Salvy & Zimmermann, Lambda - Upsilon - Omega: An Assistant Algorithms Analyzer 1989 6 AAECC Hunt & Stearns, On the Complexity of Satisfiability Problems for Algebraic Structures (Preliminary Report) 1989 6 AAECC Mihailescu, A Primality Test Using Cyclotomic Extensions 1989 6 AAECC Toran, Succinct Representations of Counting Problems 1989 6 AAECC Vallee & Girault & Toffin, How to Guess l-th Roots Modulo n by Reducing Lattice Bases 1989 5 AAECC Astie-Vidal & Matteo, Non Simple Tournaments: Theoretical Properties and a Polynomial Algorithm 1989 5 AAECC Bauderon & Laubie, Searching for Weakly Autocorrelated Binary Sequences 1989 5 AAECC Bertoni & Goldwurm, On the Prefixes of a Random Trace and the Membership Problem for Context-Free Trace Languages 1989 5 AAECC Camion, An Iterative Euclidean Algorithm 1989 5 AAECC Dur, On Generalized Minimum Distance Decoding 1989 5 AAECC Fiol & Serra, An Algebraic Model for the Storage of Data in Parallel Memories 1989 5 AAECC Grieco & Zucchetti, How to Decide Whether a Polynomial Ideal is Primary or Not 1989 5 AAECC Heintz, On the Computational Complexity of Polynomials and Bilinear Mappings: A Survey 1989 5 AAECC Jensen & Hoholdt, Binary Sequences with Good Correlation Properties 1989 5 AAECC Narendran & Otto, It is Decidable in Polynomial Time Whether a Monoid Presented by a Finite Weight-Reducing and Confluent Thue System is Torsion-Free 1989 5 AAECC Norton, A Shift-Remainder GCD Algorithm 1984 2 AAECC Camion, Can a Fast Signature Scheme Without Secret Key Be Secure 1989 1 AAIR Hadlock, A Parallel Heuristic Search Technique for String Comparison 1993 AAPT Swartz, Used Math, for the First Two Years of College Science, Second edition 1969 439 AASFENNIC Turakainen, On Languages Representable in Rational Probabilistic Automata 1988 5 ABACUS Sadler & Greene, Computer Applications for Writing: The Computer-Assisted Composition Movement 1988 5 ABACUS Yudken & Simons, Computer Science Research Funding: Issues and Trends 1988 5 ABACUS Celko, The Ups and Downs of Elevator Management 1987 5 ABACUS Weiss, MIT Starts with Lisp 1987 4 ABACUS Lamagna, Infeasible Computation: NP-Complete Problems 1987 4 ABACUS Hamblen, U. S. Computer Science Students: A Declining Population 1996 ABLEX Briscoe & Caelli, A Compendium of Machine Learning, Volume 1: Symbolic Machine Learning 1996 ABLEX Borasi, Reconceiving Mathematics Instruction: A Focus on Errors 1994 ABLEX Tyrer (Ed.), Advances in Distributed and Parallel Processing, Volume One: System Paradigms and Methods 1994 ABLEX Advances in Distributed and Parallel Processing, Volume Two: Applications in Optimization, Fluid Dynamics, and VLSI 1994 ABLEX Lorentz, Recursive Algorithms 1992 ABLEX Duffy & Palmer & Mehlenbacher, Online Help: Design and Evaluation 1991 ABLEX Partridge, A New Guide to Artificial Intelligence 1988 2 ACADCOMP Young & Thearling & Skiena & Robison & Omohundro & Mel & Wolfram, Academic Computing in the Year 2000 1988 2 ACADCOMP Kemeny, How Computers Have Changed the Way I Teach 1988 2 ACADCOMP Black, Computer-Augmented Teaching: The Computer Screen Versus the Chalkboard 1996 ACADEMIC Boden (Ed.), Artificial Intelligence 1996 ACADEMIC Wayner, Disappearing Cryptography: Being and Nothingness on the Net 1996 ACADEMIC Casavant & Tvrdik & Plasil (Eds.), Parallel Computers: Theory and Practice 1995 ACADEMIC Heller, Efficient C/C++ Programming: Smaller, Faster, Better, 2nd Edition 1995 ACADEMIC Owen, Game Theory, Third Edition 1995 ACADEMIC Leach, Object-Oriented Design and Programming with C++ 1995 ACADEMIC Gilbert & Gilbert, Linear Algebra and Matrix Theory 1995 ACADEMIC Simovici & Tenney, Relational Database Systems 1995 ACADEMIC Sloane & Plouffe, The Encyclopedia of Integer Sequences 1994 ACADEMIC Maeder, The Mathematica Programmer 1994 ACADEMIC Hartsfield & Ringel, Pearls in Graph Theory: A Comprehensive Introduction, Revised and Augmented 1994 ACADEMIC Wilf, Generatingfunctionology, Second Edition 1994 ACADEMIC Davis & Sigal & Weyuker, Second Edition, Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science 1994 ACADEMIC Jahns & Lee (Eds.), Optical Computing Hardware 1993 ACADEMIC Borde, Mathematical TeX by Example 1992 ACADEMIC Foster, Algorithms, Abstraction and Implementation: Levels of Detail in Cognitive Science 1992 ACADEMIC Borde, TeX by Example: A Beginner's Guide 1992 ACADEMIC Anzai, Pattern Recognition and Machine Learning 1992 ACADEMIC Truemper, Matroid Decomposition 1992 ACADEMIC Abell & Braselton, The Mathematica Handbook 1992 ACADEMIC King, Dynamic Data Structures: Theory and Applications 1992 ACADEMIC Abell & Braselton, Mathematica by Example 1992 ACADEMIC Ullman (Ed.), Theoretical Studies in Computer Science 1991 ACADEMIC Stolfi, Oriented Projective Geometry: A Framework for Geometric Computations 1991 ACADEMIC Lifschitz (Ed.), Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy 1991 ACADEMIC Sengupta & Edwards, Data Structures in ANSI C 1990 ACADEMIC Allen, Probability, Statistics, and Queueing Theory, With Computer Science Applications, Second Edition 1990 ACADEMIC Eberhart & Dobbins (Eds.), Neural Network PC Tools: A Practical Guide 1990 ACADEMIC Hartsfield & Ringel, Pearls in Graph Theory, A Comprehensive Introduction 1990 ACADEMIC Wilf, Generatingfunctionology 1989 ACADEMIC Su & Liu, Computational Geometry: Curve and Surface Modeling 1988 ACADEMIC Barnsley, Fractals Everywhere 1988 ACADEMIC Traub & Wasilkowski & Wozniakowski, Information-Based Complexity 1986 ACADEMIC Andrews, An Introduction to Mathematical Logic and Type Theory: To Truth through Proof 1985 ACADEMIC Akl, Parallel Sorting Algorithms 1976 ACADEMIC Welsh, Matroid Theory 1991 25 ACCS Gladshtein, A Method of Designing a Decimal Arithmetic Processor 1991 25 ACCS Lobanov, Mutual Authentificated Information Agreement with Identification of Faults 1991 25 ACCS Adamatskii, Identification of Fuzzy Cellular Automata 1991 25 ACCS Evtushenko & Lebedev & Petrenko, On Checking Experiments with Nondeterministic Automata 1991 25 ACCS Baev, Complexity of Solving N-Reachability Problems in SP Sets 1990 24 ACCS Kostin, Deterministic Algorithm for Determining Reachability of Marking in a Petri Net 1990 24 ACCS P'yavchenko & Romm, Switching Network for Interprocessor Interchange and Sorting 1989 23 ACCS Khoreev, Routing of Finite Flows in Networks 1989 23 ACCS Kustov, Parallel Sorting in Switching Networks 1994 ACM Vishkin (Ed.), Developing a Computer Science Agenda for High-Performance Computing 1992 ACM , The No-Nonsense Guide To Computing Careers 1991 ACM Seitz, Resources in Parallel and Concurrent Systems, with an introduction by Charles L. Seitz 1991 ACM Johnson (Ed.), STOC/FOCS Bibliography (preliminary version) 1990 ACM ISSAC '90: Proceedings of the International Symposium on Symbolic and Algebraic Computation 1985 ACM Bach, Analytic Methods in the Analysis and Design of Number-Theoretic Algorithms 1981 ACM , ACM Recommended Curricula for Computer Science and Information Processing Programs in Colleges and Universities, 1968-1981 1978 ACMANNCONF Schwartz, The Interplay between Mathematics and Computer Science 1996 26 ACMCCR Coffey & Saidha, Non-Repudiation with Mandatory Proof of Receipt 1990 20 ACMCCR Gong, A Note on Redundancy in Encrypted Messages 1995 23 ACMCSC Liang & Rhee, An Optimal Algorithm for Finding Biconnected Components Problem in Permutation Graphs 1995 23 ACMCSC Kooshesh & Moret, Folding a Simple Polygon: A Paradigm for Computational Geometry 1993 ACMCSC Frazier, An Incremental Algorithm for Building Temporal Quadtrees 1993 ACMCSC Chaabouni & Chung, The Point-Range Tree: A Data Structure for Indexing Intervals 1993 ACMCSC Smith & Graham, A Simple Balanced Search Tree 1993 ACMCSC Tharp & Furlani, The CD-ROM Fosters a New Data Structure: The B3-Tree 1993 ACMCSC Brewer, Distribution Driven Binary Tree Balancing with R-Trees 1991 ACMCSC Olariu & Schwing & Wen & Zhang, Optimal Parallel Encoding and Decoding Algorithms for Trees 1991 ACMCSC Zhang & Wen, Efficient Parallel Algorithms for Some Integer Problems 1991 ACMCSC Yen, Massively Parallel Hash Algorithms and Performance 1991 ACMCSC Lin & Olariu, Optimal Parallel Coloring Algorithms for a Family of Tree-Representable Graphs 1991 ACMCSC Chang & Cheng & Tang & Lee, A Unified Approach for Solving Bottleneck k-Bipartition Problems 1991 ACMCSC Liang & Dhall & Lakshmivarahan, Efficient Parallel Algorithms for Finding Biconnected Components of Some Intersection Graphs 1991 ACMCSC Baird & Wilkerson, Termination via Conditional Reductions 1991 ACMCSC Abuali & Wainwright, Fringe Analysis of Binary Search Trees with Minimal Internal Path Length 1991 ACMCSC Coleman, Aspects of Computation 1991 ACMCSC Maegawa, Memory Organization and Management for Linked Data Structures 1991 ACMCSC Denman & Rowell, A Toroidal Systolic Array for Warshall's Algorithm 1991 ACMCSC Makedon & Simvonis, Many-to-One Packet Routing on the Mesh 1991 ACMCSC Markenscoff & Li, An Optimal Algorithm for Scheduling a Computational Tree on a Parallel System 1991 ACMCSC Woo & Block, A Synchronization Algorithm for Distributed Systems 1991 ACMCSC Moser & Melliar-Smith & Agrawala, Total Ordering Algorithms 1989 17 ACMCSC Oommen & Ng, On Generating Random Permutations with Arbitrary Distributions 1989 17 ACMCSC Martin & Orr, A Random Binary Tree Generator 1989 17 ACMCSC Han, An Optimal Linked List Prefix Algorithm on a Local Memory Computer 1989 17 ACMCSC Sharma & Mandyam & Iyengar, An Optimal Distributed Depth-First-Search Algorithm 1987 15 ACMCSC Varman & Doshi, Improved Parallel Algorithms for the Depth-First Search and Monotone Circuit Value Problems 1987 15 ACMCSC Wainwright, Quicksort Algorithms with an Early Exit for Sorted Subfiles 1987 15 ACMCSC Li & Marsland, A Parallel Algorithm for Finding Maximum Flow in 0-1-Networks 1987 15 ACMCSC Park & Balasubramanian, Improved Sorting Algorithms for Parallel Computers 1988 ACMLFP Sussman & Halfant, Tutorial: Abstraction in Numerical Methods 1988 ACMLFP Roylance, Expressing Mathematical Subroutines Constructively 1988 ACMLFP Vuillemin, Exact Real Computer Arithmetic with Continued Fractions 1988 ACMLFP Meyer & Riecke, Continuations May Be Unreasonable 1988 ACMLFP Pfenning, Partial Polymorphic Type Inference and Higher-Order Unification 1988 ACMLFP Martini, Bounded Quantifiers Have Interval Models 1988 ACMLFP Henglein, Type Inference and Semi-Unification 1988 ACMLFP Adams & Rees, Object-oriented Programming in Scheme 1988 ACMLFP Lamping, A Unified System of Parameterization for Programming Languages 1994 16 ACMLPLS Yu & Rosenkrantz, A Linear-Time Scheme for Version Reconstruction 1994 16 ACMLPLS Rao, Reasoning about Probabilistic Parallel Programs 1994 16 ACMLPLS Lamport, The Temporal Logic of Actions 1994 16 ACMLPLS Broy & Nelson, Adding Fair Choice to Dijkstra's Calculus 1994 16 ACMLPLS Afek & Dolev & Gafni & Merritt & Shavit, A Bounded First-In, First-Enabled Solution to the l-Exclusion Problem 1994 16 ACMLPLS Joung & Smolka, Coordinating First-Order Multiparty Interactions 1994 16 ACMLPLS Reiter & Birman, How to Securely Replicate Services 1994 16 ACMLPLS Thorup, Controlled Grammatic Ambiguity 1994 16 ACMLPLS Bates & Lavie, Recognizing Substrings of LR(k) Languages in Linear Time 1993 2 ACMLPLS Boehm & Demers & Uhler, Implementing Multiple Locks Using Lamport's Mutual Exclusion Algorithm 1993 2 ACMLPLS Cameron, Extending Context-Free Grammars with Permutation Phrases 1993 2 ACMLPLS Kaser & Ramakrishnan & Pawagi, On the Conversion of Indirect to Direct Recursion 1992 1 ACMLPLS Asuru, Optimization of Array Subscript Range Checks 1992 1 ACMLPLS Dietrich, Shortest Path by Approximation in Logic Programs 1992 1 ACMLPLS Briggs & Cooper & Torczon, Coloring Register Pairs 1992 1 ACMLPLS Dornic & Jouvelot & Gifford, Polymorphic Time Systems for Estimating Program Complexity 1992 1 ACMLPLS Netzer & Miller, What Are Race Conditions? Some Issues and Formalizations 1992 1 ACMLPLS Singh, On Reasoning With the Global Time Assumption 1967 22 ACMNATCONF Meyer & Ritchie, The Complexity of Loop Programs 1994 28 ACMOSR Bouabdallah, On Mutual Exclusion in Faulty Distributed Systems 1993 27 ACMOSR Syverson, On Key Distribution Protocols for Repeated Authentication 1993 27 ACMOSR Liebl, Authentication in Distributed Systems: A Bibliography 1993 27 ACMOSR Romanovsky, Fault Tolerance: Synchronization of Redundancy 1992 26 ACMOSR Gantenbein, An Annotated Bibliography of Dependable Distributed Computing 1992 26 ACMOSR Raynal, About Logical Clocks for Distributed Systems 1992 26 ACMOSR Gong, A Security Risk of Depending on Synchronized Clocks 1991 25 ACMOSR Dunstan, Sepaphores for Fair Scheduling Monitor Conditions 1990 24 ACMOSR Davis & Swick, Network Security via Private-Key Certificates 1990 24 ACMOSR Woo, A Note on Lamport's Mutual Exclusion Algorithm 1990 24 ACMOSR Hofri, Proof of a Mutual Exclusion Algorithm -- A `Class'ic Example 1989 23 ACMOSR Hemmendinger, Comments on ``A Correct and Unrestrictive Implementation of General Semaphores'' 1989 23 ACMOSR Hsieh, Further Comments on Implementation of General Semaphores 1988 22 ACMOSR Kotulski, Comments on Implementation of P and V Primitives with Help of Binary Semaphores 1988 22 ACMOSR Haldar & Subramanian, An Efficient Solution to the Mutual Exclusion Problem Using Unfair and Weak Semaphore 1987 21 ACMOSR Tanenbaum, A UNIX Clone with Source Code for Operating Systems Courses 1986 20 ACMOSR Lamport & Melliar-Smith, Byzantine Clock Synchronization 1986 20 ACMOSR Brumfield, A Guide to Operating Systems Literature 1986 20 ACMOSR Mullender & Vitanyi, Distributed Match-Making for Processes in Computer Networks (preliminary version) 1996 14 ACMTCS Shavit & Zemach, Diffracting Trees 1995 13 ACMTCS Herlihy & Lim & Shavit, Scalable Concurrent Counting 1994 12 ACMTCS Attiya & Welch, Sequential Consistency versus Linearizability 1993 11 ACMTCS Ammann & Jajodia, Distributed Timestamp Generation in Planar Lattice Networks 1992 10 ACMTCS Lampson & Abadi & Burrows & Wobber, Authentication in Distributed Systems: Theory and Practice 1991 9 ACMTCS LaRowe & Ellis, Experimental Comparison of Memory Management Policies for NUMA Multiprocessors 1991 9 ACMTCS Ahamad & Ammar & Cheung, Multidimensional Voting 1991 9 ACMTCS Greenberg & Lubachevsky & Mitrani, Algorithms for Unboundedly Parallel Simulations 1991 9 ACMTCS Zhang, Virtual Clock: A New Traffic Control Algorithm for Packet Switching Networks 1991 9 ACMTCS Liskov & Shrira & Wroclawski, Efficient At-Most-Once Messages Based on Synchronized Clocks 1991 9 ACMTCS Agrawal & El Abbadi, An Efficient and Fault-Tolerant Solution for Distributed Mutual Exclusion 1991 9 ACMTCS Mellor-Crummey & Scott, Algorithms for Scalable Synchronization on Shared-Memory Multiprocessors 1990 8 ACMTCS Lamport, Concurrent Reading and Writing of Clocks 1990 8 ACMTCS Burrows & Abadi & Needham, A Logic of Authentication 1989 7 ACMTCS Li & Hudak, Memory Coherence in Shared Virtual Memory Systems 1989 7 ACMTCS Barbara & Garcia-Molina & Spauster, Increasing Availability Under Mutual Exclusion Constraints with Dynamic Vote Reassignment 1989 7 ACMTCS Raymond, A Tree-Based Algorithm for Distributed Mutual Exclusion 1988 6 ACMTCS Okamoto, A Digital Multisignature Scheme Using Bijective Public-Key Cryptosystems 1987 5 ACMTCS Sanders, The Information Structure of Distributed Mutual Exclusion Algorithms 1987 5 ACMTCS Lamport, A Fast Mutual Exclusion Algorithm 1984 2 ACMTCS Tichy, The String-to-String Correction Problem with Block Moves 1983 1 ACMTCS Blum, How to Exchange (Secret) Keys 1983 1 ACMTCS Shamir, On the Generation of Cryptographically Strong Pseudorandom Sequences 1994 19 ACMTDS Goldman & Lynch, Quorum Consensus in Nested-Transaction Systems 1993 18 ACMTDS Kuper & Vardi, The Logical Data Model 1993 18 ACMTDS Sagiv & Shmueli, Solving Queries by Tree Projections 1993 18 ACMTDS Ioannidis & Ramakrishnan & Winger, Transitive Closure Algorithms Based on Graph Traversal 1993 18 ACMTDS Agrawal & Abbadi, The Generalized Tree Quorum Protocol: An Efficient Approach for Managing Replicated Data (Corrigenda) 1991 16 ACMTDS Cesarini & Soda, A Dynamic Hash Method with Signature 1990 15 ACMTDS Lomet & Salzberg, The hB-Tree: A Multiattribute Indexing Method with Good Guaranteed Performance 1990 15 ACMTDS Agrawal & Dar & Jagadish, Direct Transitive Closure Algorithms: Design and Performance Evaluation 1990 15 ACMTDS Whang & Vander-Zanden & Taylor, A Linear-Time Probabilistic Counting Algorithm for Database Applications 1988 13 ACMTDS Lomet, A Simple Bounded Disorder File Organization with Good Performance 1988 13 ACMTDS Diederich & Milton, New Methods and Fast Algorithms for Database Normalization 1988 13 ACMTDS Larson, Linear Hashing with Separators--A Dynamic Hashing Scheme Achieving One-Access Retrieval 1988 13 ACMTDS Shasha & Goodman, Concurrent Search Structure Algorithms 1987 12 ACMTDS Faloutsos & Christodoulakis, Optimal Signature Extraction and Information Loss 1987 12 ACMTDS Wolfson, The Overhead of Locking (and Commit) Protocols in Distributed Databases 1996 15 ACMTG Davidson & Harel, Drawing Graphs Nicely Using Simulated Annealing 1996 15 ACMTG Dobkin & Eppstein & Mitchell, Computing the Discrepancy with Applications to Supersampling Patterns 1994 13 ACMTG Baker, Corrigenda: Intersection Algorithms for Lines and Circles 1994 13 ACMTG Edelsbrunner & Mucke, Three-Dimensional Alpha Shapes 1992 11 ACMTG Sharir & Overmars, A Simple OUtput-Sensitive Algorithm for Hidden Surface Removal 1992 11 ACMTG Cameron & Yap, Refinement Methods for Geometric Bounds in Constructive Solid Geometry 1991 10 ACMTG Klassen, Drawing Antialiased Cubic Spline Curves 1991 10 ACMTG Karasick & Lieber & Nackman, Efficient Delaunay Triangulation Using Rational Arithmetic 1990 9 ACMTG Preparata & Vitter & Yvinec, Computation of the Axial View of a Set of Isothetic Parallelepipeds 1990 9 ACMTG Edelsbrunner & Mucke, Simulation of Simplicity: A Technique to Cope with Degenerate Cases in Geometric Algorithms 1990 9 ACMTG Day, The Implementation of an Algorithm to Find the Convex Hull of a Set of Three-Dimensional Points 1995 5 ACMTMCS Percus & Whitlock, Theory and Application of Marsaglia's Monkey Test for Pseudorandom Number Generators 1994 4 ACMTMCS Epstein & Sack, Generating Triangulations at Random 1993 3 ACMTMCS L'Ecuyer & Blouin & Couture, A Search for Good Multiple Recursive Random Number Generators 1993 3 ACMTMCS Tezuka, Polynomial Arithmetic Analogue of Halton Sequences 1992 2 ACMTMCS Eichenauer-Herrmann & Grothe, A New Inversive Congruential Pseudorandom Number Generator with Power of Two Modulus 1996 22 ACMTMS Barber & Dobkin & Huhdanpaa, The Quickhull Algorithm for Convex Hulls 1995 21 ACMTMS Weber, The Accelerated Integer GCD Algorithm 1990 16 ACMTMS Nair, An Improved Algorithm for Ordered Sequential Random Sampling 1990 16 ACMTMS Palacios-Velez & Renaud, A Dynamic Hierarchical Subdivision Algorithm for Computing Delaunay Triangulations and Other Closest-Point Problems 1990 16 ACMTMS Hansen & Patrick & Wang, Polynomial Evaluation with Scaling 1989 15 ACMTMS Liu, A Graph Partitioning Algorithm by Node Separators 1989 15 ACMTMS Vitter, ALGORITHM 673: Dynamic Huffman Coding 1996 14 ACMTOIS Moffat & Zobel, Self-Indexing Inverted Files for Fast Text Retrieval 1996 14 ACMTOIS Berghel & Roach, An Extension of Ukkonen's Enhanced Dynamic Programming ASM Algorithm 1995 13 ACMTOIS Koike, Fractal Views: A Fractal-Based Method for Controlling Information Display 1991 9 ACMTOIS Mak & Lee & Frieder, Exploiting Parallelism in Pattern Matching: An Information Retrieval Application 1990 8 ACMTOIS Shasha & Wang, New Techniques for Best-Match Retrieval 1990 8 ACMTOIS Bookstein & Klein, Compression, Information Theory, and Grammars: A Unified Approach 1989 7 ACMTOIS Olson, Work at Home for Computer Professionals: Current Attitudes and Future Prospects 1988 6 ACMTOIS Holt, Diplans: A New Language for the Study and Implementation of Coordination 1983 1 ACMTOIS Mack & Lewis & Carroll, Learning to Use Word Processors: Problems and Prospects 1982 1 ACMTOIS Srihari & Hull & Choudhari, Integrating Diverse Knowledge Sources in Text Recognition 1997 19 ACMTOPLAS Horwitz, Precise Flow-Insensitive May-Alias Analysis is NP-Hard 1996 18 ACMTOPLAS Sreedhar & Gao & Lee, Identifying Loops Using DJ Graphs 1996 18 ACMTOPLAS Dawson & Ramakrishnan & Skiena & Swift, Principles and Practice of Unification Factoring 1995 17 ACMTOPLAS Choy & Singh, Efficient Fault-Tolerant Algorithms for Distributed Resource Allocation 1995 17 ACMTOPLAS Larcheveque, Optimal Incremental Parsing 1994 16 ACMTOPLAS Ramalingam, The Undecidability of Aliasing 1994 16 ACMTOPLAS Abadi & Lamport, An Old-Fashioned Recipe for Real Time 1993 15 ACMTOPLAS Abadi & Burrows & Lampson & Plotkin, A Calculus for Access Control in Distributed Systems 1993 15 ACMTOPLAS Ghosh, An Alternative Solution to a Problem on Self-Stabilization 1993 15 ACMTOPLAS Huang, Leader Election in Uniform Rings 1993 15 ACMTOPLAS Tel & Mattern, The Derivation of Distributed Termination Detection Algorithms from Garbage Collection Schemes 1993 15 ACMTOPLAS Abadi & Lamport, Composing Specifications 1993 15 ACMTOPLAS Afek & Brown & Merritt, Lazy Caching 1991 13 ACMTOPLAS Lyckfama & Hadzilacos, A First-Come-First-Served Mutual Exclusion Algorithm with Small Communication Variables 1991 13 ACMTOPLAS Borstler & Moncke & Wilhelm, Table Compression for Tree Automata 1991 13 ACMTOPLAS Peng & Puroshothaman, Data Flow Analysis of Communicating Finite State Machines 1990 12 ACMTOPLAS Leiss, On Kilbury's Modification of Earley's Algorithm 1990 12 ACMTOPLAS Burke, An Interval-Based Approach to Exhaustive and Incremental Interprocedural Data-Flow Analysis 1990 12 ACMTOPLAS Lamport, win and sin: Predicate Transformers for Concurrency 1990 12 ACMTOPLAS Jones, Efficient Evaluation of Circular Attribute Grammars 1990 12 ACMTOPLAS Knapp, An Exercise in the Formal Derivation of Parallel Programs: Maximum Flows in Graphs 1990 12 ACMTOPLAS Korach & Kutten & Moran, A Modular Technique for the Design of Efficient Distributed Leader Finding Algorithms 1991 11 ACMTOPLAS Herlihy, Wait-Free Synchronization 1989 11 ACMTOPLAS Aho & Ganapathi & Tjiang, Code Generation Using Tree Matching and Dynamic Programming 1989 11 ACMTOPLAS Nelson, A Generalization of Dijkstra's Calculus 1989 11 ACMTOPLAS Brent, Efficient Implementation of the First-Fit Strategy for Dynamic Storage Allocation 1989 11 ACMTOPLAS Anger, On Lamport's Interprocessor Communication Model 1989 11 ACMTOPLAS Burns & Pachl, Uniform Self-Stabilizing Rings 1989 11 ACMTOPLAS Myers & Miller, Row Replacement Algorithms for Screen Editors 1989 11 ACMTOPLAS Alpern & Schneider, Verifying Temporal Properties without Temporal Logic 1988 10 ACMTOPLAS Kruskal & Rudolph & Snir, Efficient Synchronization on Multiprocessors with Shared Memory 1988 10 ACMTOPLAS Olderog & Apt, Fairness in Parallel Programs: The Transformational Approach 1988 10 ACMTOPLAS Lamport, Control Predicates are Better than Dummy Variables for Reasoning about Program Control 1988 10 ACMTOPLAS Shasha & Snir, Efficient and Correct Execution of Parallel Programs that Share Memory 1988 10 ACMTOPLAS Greenberg & Lubachevsky & Odlyzko, Simple, Efficient Asynchronous Parallel Algorithms for Maximization 1988 10 ACMTOPLAS Bermudez & Schimpf, Technical Correspondence: On the (non-) Relationship between SLR(1) and NQLALR(1) Grammars 1988 10 ACMTOPLAS Murphy & Shankar, A Note on the Drinking Philosophers Problem 1982 4 ACMTOPLAS Hoffman & O'Donnell, Programming with Equations 1981 3 ACMTOPLAS Apt, Ten Years of Hoare's Logic: A Survey--Part I 1981 3 ACMTOPLAS Greif & Meyer, Specifying the Semantics of while Programs: A Tutorial and Critique of a Paper by Hoare and Lauer 1981 3 ACMTOPLAS Anderson & Backhouse, Locally Least-Cost Error Recovery in Earley's Algorithm 1981 3 ACMTOPLAS Schonberg & Schwartz & Sharir, An Automatic Technique for Selection of Data Representations in SETL Programs 1980 2 ACMTOPLAS Oppen, Prettyprinting 1980 2 ACMTOPLAS Schwartz, Ultracomputers 1980 2 ACMTOPLAS Gries & Levin, Assignment and Procedure Call Proof Rules 1980 2 ACMTOPLAS Apt & Francez & de Roever, A Proof System for Communicating Sequential Processes 1980 2 ACMTOPLAS Graham & Harrison & Ruzzo, An Improved Context-Free Recognizer 1980 2 ACMTOPLAS Franzez, Corrigendum: Distributed Termination 1980 2 ACMTOPLAS Griswold & Hanson, An Alternative to the Use of Patterns in String Processing 1980 2 ACMTOPLAS Luckham & Polak, Ada Exception Handling: An Axiomatic Approach 1980 2 ACMTOPLAS Bernstein, Output Guards and Nondeterminism in ``Communicating Sequential Processes'' 1980 2 ACMTOPLAS Harel, And/Or Programs: A New Approach to Structured Programming 1980 2 ACMTOPLAS Pai & Kieburtz, Global Context Recovery: A New Strategy for Syntactic Error Recovery by Table-Driven Parsers 1980 2 ACMTOPLAS Francez, Distributed Termination 1980 2 ACMTOPLAS Andrews & Reitman, An Axiomatic Approach to Information Flow in Programs 1980 2 ACMTOPLAS Papadimitriou & Bernstein, On the Performance of Balanced Hashing Functions When the Keys Are Not Equiprobable 1980 2 ACMTOPLAS Manna & Waldinger, A Deductive Approach to Program Synthesis 1980 2 ACMTOPLAS Arnold & Sleep, Uniform Random Generation of Balanced Parenthesis Strings 1980 2 ACMTOPLAS Comer, A Note on Median Split Trees 1980 2 ACMTOPLAS Lamport, Corrigendum: A New Approach to Proving the Correctness of Multiprocess Programs 1979 1 ACMTOPLAS Iverson, Operators 1979 1 ACMTOPLAS Kieburtz & Silberschatz, Comments on ``Communicating Sequential Processes'' 1979 1 ACMTOPLAS Nelson & Oppen, Simplification by Cooperating Decision Procedures 1979 1 ACMTOPLAS Gries, Is Sometime Ever Better Than Alway? 1979 1 ACMTOPLAS Bobrow & Clark, Compact Encodings of List Structure 1979 1 ACMTOPLAS Beyer & Buneman, A Space Efficient Dynamic Allocation Algorithm for Queueing Messages 1979 1 ACMTOPLAS Lindstron, Backtracking in a Generalized Control Setting 1979 1 ACMTOPLAS Dewar & Grand & Liu & Schwartz & Schonberg, Program by Refinement, as Exemplified by the SETL Representation Sublanguage 1979 1 ACMTOPLAS Ghezzi & Mandrioli, Incremental Parsing 1979 1 ACMTOPLAS Robertson, Code Generation and Storage Allocation for Machines with Span-Dependent Instructions 1979 1 ACMTOPLAS Lamport, A New Approach to Proving the Correctness of Multiprocess Programs 1979 1 ACMTOPLAS Wise, Morris's Garbage Compaction Algorithm Restores Reference Counts 1979 1 ACMTOPLAS Lengauer & Tarjan, A Fast Algorithm for Finding Dominators in a Flowgraph 1992 1 ACMTSEM Harel & Kahana, On Statecharts with Overlapping 1996 3 ACPC Brunner & Uhl, Parallel Computation of Optimal Parameters for Pseudo Random Number Generation 1996 3 ACPC Aguilar, Heuristics to Optimize the Speed-Up of Parallel Programs 1993 2 ACPC ElGindy, Pipelining Computations on Processor Arrays with Reconfigurable Bus Systems 1993 2 ACPC Lucka, An Effective Algorithm for Computation of Two-Dimensional Fourier Transform for N x M Matrices 1993 2 ACPC Limongelli & Loidl, Rational Number Arithmetic by Parallel P-adic Algorithms 1993 2 ACPC Snyder, Foundations of Practical Parallel Programming Languages 1993 2 ACPC Kessler & Paul, Automatic Parallelization by Pattern-Matching 1992 1 ACPC Makedon & Simvonis, Multipacket Routing on Rings 1992 1 ACPC Lippitsch & Posch & Posch, Multiplication as Parallel as Possible 1992 1 ACPC Zerovnik, On the Existence of an Efficient Parallel Algorithm for a Graph Theoretic Problem 1992 1 ACPC Kuchlin, On the Multi-Threaded Computation of Modular Polynomial Greatest Common Divisors 1992 1 ACPC Schulten, Computational Biology on Massively Parallel Machines 1995 ACSC Albacca, Leapfrogging Samplesort 1995 ACSC Cai, Spanning 2-Trees 1995 ACSC Kao, Minimal Linear Invariants 1995 ACSC Baffi & Petreschi, Parallel Maximal Matching on Minimal Vertex Series Parallel Digraphs 1995 ACSC Lam & Lee, Efficient Equality-Testing and Updating of Sets 1995 ACSC Nguyen & Widmayer, Binary Space Partitions for Sets of Hyperrectangles 1996 12 ACTACYB Ehrenfeucht & Mateescu & Paun & Rozenberg & Salomaa, On Representing RE Languages by One-sided Internal Contextual Languages 1996 12 ACTACYB Mihalache & Salomaa, Growth Functions and Length Sets of Replicating Systems 1996 12 ACTACYB Danyi, On Domain and Range Tree Languages of Superlinear Deterministic Top-down Tree Transformations 1996 12 ACTACYB Balzsik & Imreh, A Note on Connection between PNS and Set Covering Problems 1996 12 ACTACYB Burkard & Dudas, Steiner Minimum Trees for Equidistant Points on Two Sides of an Angle 1995 12 ACTACYB Babcsanyi & Nagy, Right Group-type Automata 1995 12 ACTACYB Rystsov, Quasioptimal Bound for the Length of Reset Words for Regular Automata 1995 12 ACTACYB Bartalos & Dudas & Imreh, On a Tour Construction Heuristic for the Asymmetric TSP 1995 12 ACTACYB Kari & Rozenberg & Salomaa, Generalised D0L Trees 1995 12 ACTACYB Imreh, On Isomorphic Representation of Nondeterministic Tree Automata 1995 12 ACTACYB Imreh & Steinby, Some Remarks on Directable Automata 1995 12 ACTACYB Horvath, Parallel Asynchronous Computation of the Values of an Associative Function 1994 11 ACTACYB Devolder & Latteux & Litovsky & Staiger, Codes and Infinite Words 1994 11 ACTACYB Imreh & Ito, A Note on Regular Strongly Shuffle-closed Languages 1994 11 ACTACYB Kuhnemann & Vogler, A Pumping Lemma for Output Languages of Attributed Tree Transducers 1994 11 ACTACYB Meduna & Gopalaratnam, On Semi-Conditional Grammars with Productions Having either Forbidding or Permitting Conditions 1994 11 ACTACYB Vardanian, On the Complexity of Dynamic Tests for Logic Functions 1994 11 ACTACYB Babcsanyi & Nagy, Mealy-Automata in which the Output-Equivalence is a Congruence 1994 11 ACTACYB Lam & Van, Measure of Infinitary Codes 1994 11 ACTACYB Fassbender & Vogler, A Universal Unification Algorithm Based on Unification-Driven Leftmost Outermost Narrowing 1994 11 ACTACYB Mitrana & Paun & Rozenberg, Structuring Grammar Systems by Priorities and Hierarchies 1994 11 ACTACYB Pferschy & Woeginger & Yao, Partitioning Graphs into Two Trees 1993 11 ACTACYB Bodlaender, A Tourist Guide through Treewidth 1993 11 ACTACYB Galambos & Kellerer & Woginger, A Lower Bound for On-Line Vector-Packing Algorithms 1993 11 ACTACYB Long Van & Houng Lam & Trung Huy, On Codes Concerning Bi-infinite Words 1992 10 ACTACYB Adam, A Criterion for the Simplicity of Finite Moore Automata 1992 10 ACTACYB Imreh, On a Special Composition of Tree Automata 1992 10 ACTACYB Dassow & Mateescu & Paun & Salomaa, Regularizing Context-free Languages by AFL Operations: Concatenation and Kleene Closure 1992 10 ACTACYB Jurvanen, The Boolean Closure of DR-Recognizable Tree Languages 1992 10 ACTACYB Makjamroen, The Self-organizing List and Processor Problems under Randomized Policies 1992 10 ACTACYB Woeginger, Computing Maximum Valued Regions 1992 10 ACTACYB Dombi & Lencses, On the Boolean Structure of Fuzzy Logical Systems: A Counter Example 1992 10 ACTACYB Szabo, On Minimal and Maximal Clones 1992 10 ACTACYB Dietmar, On the Randomized Complexity of Monotone Graph Properties 1992 10 ACTACYB Demetrovics & Hencsey & Libkin & Muchnik, On the Interaction between Closure Operations and Choice Functions with Applications to Relational Databases 1992 10 ACTACYB Meduna, Symbiotic E0L Systems 1992 10 ACTACYB Salomaa, Alternation Bounds for Tree Automata 1991 10 ACTACYB Csirik & Frenk & Labbe & Zhang, Heuristic for the 0-1 Min-Knapsack Problem 1991 10 ACTACYB Galambos, A 1.6 Lower-bound for the Two-dimensional On-line Rectangle Bin-packing 1991 10 ACTACYB Mateescu, Special Families of Matrix Languages and Decidable Problems 1991 10 ACTACYB Nagy, Boolean-type Retractable Automata with Traps 1990 9 ACTACYB Arnold, Recognizable Sets of Finite Bilabelled Transition Systems 1990 9 ACTACYB Cazanescu & Stefanescu, A Note on Axiomatizing Flowchart Schemes 1990 9 ACTACYB Csirik & Frenk & Labbe & Zhang, On the Multidimensional Vector Bin Packing 1990 9 ACTACYB Domosi & Esik, Product Hierarchies of Automata and Homomorphic Simulation 1990 9 ACTACYB Esik, A Note on the Axiomatization of Iteration Theories 1990 9 ACTACYB Gottlob & Libkin, Investigations on Armstrong Relations, Dependency Inference, and Excluded Functional Dependencies 1990 9 ACTACYB Rich & Slutzki, The Complexity of a Counting Finite-state Automaton 1990 9 ACTACYB Salomaa, Decision Problems Arising from Knapsack Transformations 1990 9 ACTACYB Thalheim & Al-Fedhagi, Preserving Two-tuple Dependencies under Projection 1989 9 ACTACYB Csirik & Imreh, On the Worst-Case Performance of the NkF Bin-Packing Heuristic 1989 9 ACTACYB Faigle & Kern & Turan, On the Performance of On-line Algorithms for Partition Problems 1989 9 ACTACYB Gil & Makay, Parallel Programming Structures and Attribute Grammars 1989 9 ACTACYB Mateescu & Paun, Further Remarks on Fully Initial Grammars 1989 9 ACTACYB Balanescu & Gheorghe & Paun, On Fully Initial Grammars with Regulated Rewriting 1989 9 ACTACYB Gecseg & Imreh, On Star-Products of Automata 1989 9 ACTACYB Tanaka, On Characteristic Semigroups of Mealy Automata 1989 9 ACTACYB Tucci, A Decomposition Theorem for a Class of Infinite Transformation Semigroups 1989 9 ACTACYB Gombas & Bartha, Two Transformations on Attribute Grammars Improving the Complexity of their Evaluation 1989 9 ACTACYB Van Bao & Thuan, Key and Superkey for a Closure Function 1987 8 ACTACYB Csirik & Galambos, On the Expected Behaviour of the NF Algorithm for a Dual Bin-Packing Problem 1987 8 ACTACYB Berard, Formal Properties of Literal Shuffle 1986 7 ACTACYB Bloom, The Alternation Number and a Dot Hierarchy of Regular Sets 1997 34 ACTAINF Orman, Relational Database Constraints as Counterexamples 1997 34 ACTAINF Rus & Pemmaraju, Using Graph Coloring in an Algebraic Compiler 1997 34 ACTAINF Shapiro, A Generalized Distribution Model for Random Recursive Trees 1997 34 ACTAINF Hakala & Kortelainen, On the System of Word Equations x_1^i x_2^i ... x_m^i = y_1^i y_2^i ... y_n^i (i = 1, 2, ...) in a Free Monoid 1997 34 ACTAINF Djidjev & Venkatesan, Reduced Constants for Simple Cycle Graph Separation 1997 34 ACTAINF Esparza, Decidability of Model Checking for Infinite-State Concurrent Systems 1997 34 ACTAINF Eiter & Mannila, Distance Measures for Point Sets and their Computation 1997 34 ACTAINF Levene & Loizou, The Additivity Problem for Functional Dependencies in Incomplete Relations 1997 34 ACTAINF Culik & Kari, Computational Fractal Geometry with WFA 1997 34 ACTAINF Wang & Zhang & Chau, Weakly Independent Database Schemes 1997 34 ACTAINF Keesmaat & Kleijn, Net-based Control versus Rational Control. The Relation between ITNC Vector Languages and Rational Relations 1997 34 ACTAINF Fulop & Vagvolgyi, Minimal Equational Representations of Recognizable Tree Languages 1996 33 ACTAINF Milner, Calculi for Interaction 1996 33 ACTAINF Reps, On the Sequential Nature of Interprocedural Program-Analysis Problems 1996 33 ACTAINF Biela & Borowczyk, RETRPROV. A System That Looks for Axioms 1996 33 ACTAINF Heilbrunner, A Direct Complement Construction for LR(1) Grammars 1996 33 ACTAINF Saxena, Parallel Integer Sorting and Simulation amongst CRCW Models 1996 33 ACTAINF Ameur & Fischer & Hoffgen & Meyer auf der Heide, Trial and Error. A New Approach to Space-bounded Learning 1996 33 ACTAINF Bertsch, An Observation on Suffix Redundancy in LL(1) Error Repair 1996 33 ACTAINF Degano & Meseguer &Montanari, Axiomatizing the Algebra of Net Computations and Processes 1996 33 ACTAINF Bause, On the Analysis of Petri Nets with Static Priorities 1996 33 ACTAINF Sloan & Buy, Reduction Rules for Time Petri Nets 1996 33 ACTAINF Thorup, Disambiguating Grammars by Exclusion of Sub-parse Trees 1996 33 ACTAINF Maggiolo-Schettini & Winkowski, A Kernel Language for Programmed Rewriting of (Hyper)graphs 1996 33 ACTAINF Nurmi & Soisalon-Soininen, Chromatic Binary Search Trees. A Structure for Concurrent Rebalancing 1996 33 ACTAINF Deineko & Rudolf & Woeginger, On the Recognition of Permuted Supnick and Incomplete Monge Matrices 1996 33 ACTAINF Ehrenfeucht & Paun & Rozenberg, The Linear Landscape of External Contextual Languages 1996 33 ACTAINF Krishna Rao, Relating Confluence, Innermost-Confluence and Outermost-Confluence Properties of Term Rewriting Systems 1996 33 ACTAINF Jancar & Mraz & Platek, Forgetting Automata and Context-Free Languages 1996 33 ACTAINF Harman & Tucker, Algebraic Models of Microprocessors. Architecture and Organisation 1996 33 ACTAINF Meduna, Syntactic Complexity of Context-Free Grammars over Word Monoids 1996 33 ACTAINF Wanke, Undecidability of Restricted Uniform Recurrence Equations 1996 33 ACTAINF Diaconescu, Category-based Modularisation for Equational Logic Programming 1996 33 ACTAINF Desel & Reisig, The Synthesis Problem of Petri Nets 1996 33 ACTAINF Aceto & Murphy, Timing and Causality in Process Algebra 1996 33 ACTAINF O'Neil & Cheng & Gawlick & O'Neil, The log-Structured Merge-Tree (LSM-Tree) 1996 33 ACTAINF Diaz & Serna & Toran, Parallel Approximation Schemes for Problems on Planar Graphs 1996 33 ACTAINF Tuzhilin & Kedem, Modeling Data-intensive Reactive Systems with Relational Transition Systems 1996 33 ACTAINF Hesselink, Bounded Delay for a Free Address 1996 33 ACTAINF Kumar & Malik, Optimizing the Costs of Hierarchical Quorum Consensus 1996 33 ACTAINF Stalmarck, Short Resolution Proofs for a Sequence of Tricky Formulas 1996 33 ACTAINF Senizergues, On the Rational Subsets of the Free Group 1996 33 ACTAINF Matsumoto & Han & Tsuda, Alias Analysis of Pointers in Pascal and Fortran 90: Dependence Analysis between Pointer References 1996 33 ACTAINF Lee & Fekete, Multi-granularity Locking for Nested Transactions. A Proof Using a Possibilities Mapping 1996 33 ACTAINF Cau & Collette, Parallel Composition of Assumption-Commitment Specifications. A Unifying Approach for Shared Variable and Distributed Message Passing Concurrency 1996 33 ACTAINF Haldar & Vidyasankar, Simple Extensions of 1-Writer Atomic Variable Constructions to Multiwriter Ones 1996 33 ACTAINF Taubenfeld & Moran, Possibility and Impossibility Results in a Shared Memory Environment 1996 33 ACTAINF Duggan & Cormack & Ophel, Kinded Type Inference for Parametric Overloading 1996 33 ACTAINF Sangiorgi, A Theory of Bisimulation for the pi-Calculus 1995 32 ACTAINF Leavens & Weihl, Specification and Verification of Object-Oriented Programs Using Supertype Abstraction 1995 32 ACTAINF Rhee & Liang, Finding a Maximum Matching in a Permutation Graph 1995 32 ACTAINF Hennessy, Concurrent Testing of Processes 1995 32 ACTAINF Montanari & Rossi, Contextual Nets 1995 32 ACTAINF Sur & Srimani, IEH Graphs. A Novel Generalization of Hypercube Graphs 1995 32 ACTAINF Peterson, Variance of Storage Requirements for B+-trees 1995 32 ACTAINF Gold, A Compositional Dataflow Semantics for Petri Nets 1995 32 ACTAINF Badouel & Darondeau, Trace Nets and Process Automata 1995 32 ACTAINF Culik & Rajcani, Iterative Weighted Finite Transductions 1995 32 ACTAINF Chen & Montangero, Compositional Refinements in Multiple Blackboard Systems 1995 32 ACTAINF Yang, On the Look-ahead Problem in Lexical Analysis 1995 32 ACTAINF Neraud, Detecting Morphic Images of a Word on the Rank of a Pattern 1995 32 ACTAINF Jurgensen & Staiger, Local Hausdorff Dimension 1995 32 ACTAINF Kindler, Invariants, Composition, and Substitution 1995 32 ACTAINF Devillers, S-invariant Analysis of General Recursive Petri Boxes 1995 32 ACTAINF Bernardeschi & De Francesco & Vaglini, A Petri Nets Semantics for Data Flow Networks 1995 32 ACTAINF Nennessy & Liu, A Modal Logic for Message Passing Processes 1995 32 ACTAINF Tomita & Seino, The Extended Equivalence Problem for a Class of Non-real-time Deterministic Pushdown Automata 1995 32 ACTAINF Cherkasova & Howell & Rosier, Bounded Self-stabilizing Petri Nets 1995 32 ACTAINF Le Charlier & Van Hentenryck, Reexecution in Abstract Interpretation of Prolog 1995 32 ACTAINF Buchsbaum & Sundar & Tarjan, Lazy Structure Sharing for Query Optimization 1995 32 ACTAINF Krishnaswamy & Bruno, On the Complexity of Concurrency Control Using Semantic Information 1995 32 ACTAINF Meduna, Syntactic Complexity of Scattered Context Grammars 1995 32 ACTAINF Chin & Hagiya, A Transformation Method for Dynamic-Sized Tabulation 1995 32 ACTAINF Walz & Johnson, Inductive Attribute Grammars. A Basis for Incremental Program Execution 1995 32 ACTAINF Hsu & Page, Parallel Tree Contraction and Prefix Computations on a Large Family of Interconnection Topologies 1995 32 ACTAINF Kirousis & Veneris, Efficient Algorithms for Checking the Atomicity of a Run of Read and Write Operations 1995 32 ACTAINF Eiter, Generating Boolean mu-Expressions 1995 32 ACTAINF Biskup & Dublish & Sagiv, Optimization of a Subclass of Conjunctive Queries 1995 32 ACTAINF Drabent, What is Failure? An Approach to Constructive Negation 1995 32 ACTAINF de Guzman & Ojeda & Valverde, A Formal Identification between Tuples and Lists with an Application to List-Arithmetic Categories 1995 32 ACTAINF Vaidyanathan & Hartmann & Varshney, Parallel Integer Sorting Using Small Operations 1994 31 ACTAINF Kiehn, Comparing Locality and Causality Based Equivalences 1994 31 ACTAINF Hauschildt & Jantzen, Petri Net Algorithms in the Theory of Matrix Grammars 1994 31 ACTAINF Spuler, Optimal Search Trees Using Two-way Key Comparisons 1994 31 ACTAINF Ferdinand & Seidl & Wilhelm, Tree Automata for Code Selection 1994 31 ACTAINF Culik & Kari, On the Power of L-Systems in Image Generation 1994 31 ACTAINF Kirschenhofer & Prodinger, The Path Length of Random Skip Lists 1994 31 ACTAINF Kastens & Waite, Modularity and Reusability in Attribute Grammars 1994 31 ACTAINF Ruhl, On Bounds of Response Time Performance Achievable by Multiclass Single-Server Queues 1994 31 ACTAINF Bernot & Bidoit & Knapik, Behavioural Approaches to Algebraic Specifications. A Comparative Study 1994 31 ACTAINF Flajolet & Golin, Mellin Transforms and Asymptotics. The Mergesort Recurrence 1994 31 ACTAINF Woeginger, Heuristics for Parallel Machine Scheduling with Delivery Times 1994 31 ACTAINF Hull & Su, Domain Independence and the Relational Calculus 1994 31 ACTAINF Paun & Rozenberg, Prescribed Teams of Grammars 1994 31 ACTAINF de Luca & Varricchio, Well Quasi-Orders and Regular Languages 1994 31 ACTAINF Falin & Diaz & Artalejo, Information Theoretic Approximations for the M/G/1 Retrial Queue 1994 31 ACTAINF Torlone, Update Operations in Deductive Databases with Functional Dependencies 1994 31 ACTAINF Jones & Middelburg, A Typed Logic of Partial Functions Reconstructed Classically 1994 31 ACTAINF Kuhnemann & Vogler, Synthesized and Inherited Functions. A New Computational Model for Syntax-directed Semantics 1994 31 ACTAINF Farr, On Problems with Short Certificates 1994 31 ACTAINF Katajainen & Pasanen, Sorting Multisets Stably in Minimum Space 1994 31 ACTAINF Ibarra & Tran, On Communication-bounded Synchronized Alternating Finite Automata 1994 31 ACTAINF Meinke, A Recursive Second Order Initial Algebra Specification of Primitive Recursion 1994 31 ACTAINF Engelfriet & Heyker & Leih, Context-free Graph Languages of Bounded Degree are Generated by Apex Graph Grammars 1994 31 ACTAINF Diekert & Muscholl, Deterministic Asynchronous Automata for Infinite Traces 1994 31 ACTAINF Grassi, Dependability Evaluation of Hierarchical Systems 1994 31 ACTAINF Bozapalidis & Rahonis, On Two Families of Forests 1994 31 ACTAINF Lee & Choe, Boundedly LR(k)-Conflictable Grammars 1994 31 ACTAINF Wu, On n-Column 0,1-Matrices with All k-Projections Surjective 1994 31 ACTAINF von Wright, The Lattice of Data Refinement 1994 31 ACTAINF Mongenet & Clauss & Perrin, Geometrical Tools to Map Systems of Affine Recurrence Equations on Regular Arrays 1994 31 ACTAINF Ehrenfeucht & ten Pas & Rozenberg, Context-free Text Grammars 1994 31 ACTAINF Costa & Sernadas & Sernadas, Object Inheritance beyond Subtyping 1994 31 ACTAINF Su, Dependency Preservation in Semantic Databases 1994 31 ACTAINF De Francesco & Inverardi, Proving Finiteness of CCS Processes by Non-standard Semantics 1994 31 ACTAINF Baier & Majster-Cederbaum, The Connection between an Event Structure Semantics and an Operational Semantics for TCSP 1993 30 ACTAINF Manna & Pnueli, Models for Reactivity 1993 30 ACTAINF Tuzhilin, Querying Datalog Programs with Temporal Logic 1993 30 ACTAINF Hoare & He & Sampaio, Normal Form Approach to Compiler Design 1993 30 ACTAINF Hernandez, Extended Nested Relations 1993 30 ACTAINF Buckle, A Characterisation of Meet and Join Respecting Pre-orders and Congruences on Finite Lattices 1993 30 ACTAINF Singh, Program Refinement in Fair Transition Systems 1993 30 ACTAINF Bevers & Lewi, Proving Termination of (Conditional) Rewrite Systems. A Semantic Approach 1993 30 ACTAINF Qian, An Algebraic Semantics of Higher-order Types with Subtypes 1993 30 ACTAINF Spuler, The Optimal Binary Search Tree for Andersson's Search Algorithm 1993 30 ACTAINF Coffman & Flatto & Kreinin, Scheduling Saves in Fault-tolerant Computations 1993 30 ACTAINF Aref & Samet, Decomposing a Window into Maximal Quadtree Blocks 1993 30 ACTAINF Mateescu & Salomaa, On Simplest Possible Solutions for Post Correspondence Problems 1993 30 ACTAINF Devroye, On the Expected Height of Fringe-balanced Trees 1993 30 ACTAINF Kumar & Pandya, Infinitary Parallelism without Unbounded Nondeterminism in CSP 1993 30 ACTAINF Van den Bussche, On Minimizing the forall-not Degree of a Connective-free Formula 1993 30 ACTAINF Lehmann & Loeckx, OBSCURE. A Specification Language for Abstract Data Types 1993 30 ACTAINF Paun, On the Synchronization in Parallel Communicating Grammar Systems 1993 30 ACTAINF Yellin, Speeding Up Dynamic Transitive Closure for Bounded Degree Graphs 1993 30 ACTAINF Cassaigne, Unavoidable Binary Patterns 1993 30 ACTAINF Kratochvil & Krivanek, Satisfiability of Co-Nested Formulas 1993 30 ACTAINF Amerins & Baeza-Yates & Wood, On Efficient Entreeings 1993 30 ACTAINF Ding & Weiss, The Relaxed Min-Max Heap. A Mergeable Double-ended Priority Queue 1993 30 ACTAINF Poblete, The Analysis of Heuristics for Search Trees 1993 30 ACTAINF Anderson, A Fine-grained Solution to the Mutual Exclusion Problem 1993 30 ACTAINF Iwata & Kasai & Moriya, Relations Among Simultaneous Complexity Classes of Non-deterministic and Alternating Turing Machines 1993 30 ACTAINF Culik & Dube, L-Systems and Mutually Recursive Function Systems 1993 30 ACTAINF Marriott, Frameworks for Abstract Interpretation 1993 30 ACTAINF Hac, Performance and Reliability Improvement by Using Asynchronous Algorithms in Disk Buffer Cache Memory 1993 30 ACTAINF Navarro & Orejas & Remy, Contextual Rewriting as a Sound and Complete Proof Method for Conditional LOG-Specifications 1993 30 ACTAINF Nicollin & Sifakis & Yovine, From ATP to Timed Graphs and Hybrid Systems 1993 30 ACTAINF Thomsen, Plain CHOCS. A Second Generation Calculus for Higher Order Processes 1993 30 ACTAINF Stewart, Logical and Schematic Characterization of Complexity Classes 1993 30 ACTAINF Petit, Recognizable Trace Languages, Distributed Automata and the Distribution Problem 1992 29 ACTAINF Sannella & Sokolowski & Tarlecki, Toward Formal Development of Programs from Algebraic Specifications: Parameterisation Revisited 1992 29 ACTAINF Arun-Kumar & Hennessy, An Efficiency Preorder for Processes 1992 29 ACTAINF Fachini & Monti & Napoli & Parente, Languages Accepted by Systolic Y-Tree Automata: Structural Characterizations 1992 29 ACTAINF Atanasiu, A Class of Coders Based on gsm 1992 29 ACTAINF Peng & Purushothaman, Analysis of a Class of Communicating Finite State Machines 1992 29 ACTAINF Halbwachs & Lagnier & Ratel, An Experience in Proving Regular Networks of Processes by Modular Model Checking 1992 29 ACTAINF Harju & Kleijn & Latteux, Deterministic Sequential Functions 1992 29 ACTAINF Nielsen & Rozenberg & Thiagarajan, Elementary Transition Systems and Refinement 1992 29 ACTAINF Rego, Naive Asymptotics for Hitting Time Bounds in Markov Chains 1992 29 ACTAINF Schoett, Two Impossibility Theorems on Behaviour Specification of Abstract Data Types 1992 29 ACTAINF Fachini & Maggiolo-Schettini & Sangiorgi, Classes of Systolic Y-Tree Automata and a Comparison with Systolic Trellis Automata 1992 29 ACTAINF Marcus & Menas, Expressibility of Output Equals Input. Negative and Positive Results 1992 29 ACTAINF Weber, On the Lengths of Values in a Finite Transducer 1992 29 ACTAINF Richards & Salowe, Stacks, Queues, and Deques with Order-Statistic Operations 1992 29 ACTAINF Tcha & Lee & Lee, Processors Selection and Traffic Splitting in a Parallel Processors System 1992 29 ACTAINF Slobodova, Communication for Alternating Machines 1992 29 ACTAINF Baeza-Yates & Cunto, Unbalanced Multiway Trees Improved by Partial Expansions 1992 29 ACTAINF Fisher, A ``Yo-Yo'' Parsing Algorithm for a Large Class of van Wijngaarden Grammars 1992 29 ACTAINF de Luca & Varricchio, On Finitely Recognizable Semigroups 1992 29 ACTAINF Baeten & Vaandrager, An Algebra for Process Creation 1992 29 ACTAINF Ouksel & Mayer, A Robust and Efficient Spatial Data Structure. The Nested Interpolation-Based Grid File 1992 29 ACTAINF Lee & Danusaputro Liman, Single Machine Flow-Time Scheduling with Scheduled Maintenance 1992 29 ACTAINF Hinrichs & Nievergelt & Schorn, An All-Round Sweep Algorithm for 2-Dimensional Nearest-Neighbor Problems 1992 29 ACTAINF Harrison & Khoshnevisan, On the Synthesis of Function Inverses 1992 29 ACTAINF O'Neil, The SB-Tree. An Index-Sequential Structure for High-Performance Sequential Access 1992 29 ACTAINF Carlsson & Chen, On Partitions and Presortedness of Sequences 1992 29 ACTAINF Du & Chang, A Model and a Fast Algorithm for Multiple Errors Spelling Correction 1992 29 ACTAINF Fischer & Mauney, A Simple, Fast, and Effective LL(1) Error Repair Algorithm 1992 29 ACTAINF Xu, On-line Multiversion Database Concurrency Control 1992 29 ACTAINF Engelfriet & Heyker, Context-free Hypergraph Grammars Have the Same Term-generating Power as Attribute Grammars 1992 29 ACTAINF Rajasekaran & Sen, On Parallel Integer Sorting 1992 29 ACTAINF Josephs, Receptive Process Theory 1992 29 ACTAINF Hayes, Multi-Relations in Z. A Cross between Multi-Sets and Binary Relations 1992 29 ACTAINF Hinz, A Run-time Load Balancing Strategy for Highly Parallel Systems 1992 29 ACTAINF Roth, Every Binary Pattern of Length Six is Avoidable on the Two-letter Alphabet 1991 28 ACTAINF Horwitz & Reps, Efficient Comparison of Program Slices 1991 28 ACTAINF Pritchard, Opportunistic Algorithms for Eliminating Supersets 1991 28 ACTAINF Gillies & Liu, Greed in Resource Scheduling 1991 28 ACTAINF Atzeni & Chan, Independent Database Schemes under Functional and Inclusion Dependencies 1991 28 ACTAINF Alfa & Chen, Approximating Queue Lengths in M(t)/G/1 Queue Using the Maximum Entropy Principle 1991 28 ACTAINF Pohlmann, A Fixed Point Approach to Parallel Discrete Event Simulation 1991 28 ACTAINF Qian, The Expressive Power of the Bounded-Iteration Construct 1991 28 ACTAINF Bernabeu-Auban & Ahamad & Ammar, Resource Finding in Store-and-Forward Networks 1991 28 ACTAINF Yen, Priority Systems with Many Identical Processes 1991 28 ACTAINF Cantor & Kaltofen, On Fast Multiplication of Polynomials over Arbitrary Algebras 1991 28 ACTAINF Whaley, Postorder Trees and Eulerian Numbers 1991 28 ACTAINF van den Bos & Laffra, PROCOL. A Concurrent Object-oriented Language with Protocols Delegation and Constraints 1991 28 ACTAINF Kastens & Waite, An Abstract Data Type for Name Analysis 1991 28 ACTAINF Harrison, On the Expansion of Non-linear Functions 1991 28 ACTAINF Engelfriet, Branching Processes of Petri Nets 1991 28 ACTAINF Faigle & Kern, Some Order Dimension Bounds for Communication Complexity Problems 1991 28 ACTAINF Levene & Loizou, Correction to ``Null Values in Nested Relational Databases'' by M. A. Roth, H. F. Korth, and A. Silberschatz 1991 28 ACTAINF Roth & Korth & Silberschatz, Addendum to ``Null Values in Nested Relational Databases 1991 28 ACTAINF Anderson & Gouda, A New Explanation of the Glitch Phenomenon 1991 28 ACTAINF Kapur & Narendran & Rosenkrantz & Zhang, Sufficient-Completeness, Ground-Reducibility and Their Complexity 1991 28 ACTAINF Bozapalidis, Effective Construction of the Syntactic Algebra of a Recognizable Series on Trees 1991 28 ACTAINF Hulsmann & Saake, Theoretical Foundations of Handling Large Substitution Sets in Temporal Integrity Monitoring 1991 28 ACTAINF Habermann, Alan J. Perlis 1922-1990 1991 28 ACTAINF Snelting, The Calculus of Context Relations 1991 28 ACTAINF Critchlow & Panangaden, The Expressive Power of Delay Operators in SCCS 1991 28 ACTAINF Bovet & Crescenzi, Minimum-Delay Schedules in Layered Networks 1991 28 ACTAINF Kolla & Serf, The Virtual Feedback Problem in Hierarchical Representations of Combinational Circuits 1991 28 ACTAINF Otto & Zhang, Decision Problems for Finite Special String-Rewriting Systems that are Confluent on Some Congruence Class 1991 28 ACTAINF Hennicker, Observational Implementation of Algebraic Specifications 1991 28 ACTAINF Best & Devillers & Kiehn & Pomello, Concurrent Bisimulations in Petri Nets 1991 28 ACTAINF Tomaras & Kouvatsos, MRE Hierarchical Decomposition of General Queueing Network Models 1990 28 ACTAINF Dick & Kalmus & Martin, Automating the Knuth Bendix Ordering 1990 28 ACTAINF Marlowe & Ryder, Properties of Data Flow Frameworks. A Unified Model 1990 28 ACTAINF Andersson & Icking & Klein & Ottmann, Binary Search Trees of Almost Optimal Height 1990 28 ACTAINF Latteux & Turakainen, On Characterizations of Recursively Enumerable Languages 1990 28 ACTAINF Knuth, Nested Satisfiability 1990 28 ACTAINF Lodaya & Shyamasundar, Proof Theory for Exception Handling in a Tasking Environment 1990 28 ACTAINF Khoshnevisan, Efficient Memo-Table Management Strategies 1990 28 ACTAINF Ehrenfeucht & Rozenberg, A Characterization of Set Representable Labeled Partial 2-Structures through Decompositions 1990 27 ACTAINF Turski, On Specification of Multiprocessor Computing 1990 27 ACTAINF Gouda & Howell & Rosier, The Instability of Self-Stabilization 1990 27 ACTAINF Cleaveland, Tableau-Based Model Checking in the Propositional Mu-Calculus 1990 27 ACTAINF Weber, On the Valuedness of Finite Transducers 1990 27 ACTAINF Meduna, Context Free Derivations on Word Monoids 1990 27 ACTAINF Back & von Wright, Duality in Specification Languages: A Lattice-theoretical Approach 1990 27 ACTAINF Yu & Rosenkrantz, Minimizing Time-Space Cost for Database Version Control 1990 27 ACTAINF Berman & Paull & Ryder, Proving Relative Lower Bounds for Incremental Algorithms 1990 27 ACTAINF Morgan & Gardiner, Data Refinement by Calculation 1990 27 ACTAINF Sondergaard & Sestoft, Referential Transparency, Definiteness and Unfoldability 1990 27 ACTAINF Gelenbe & Hernandez, Optimum Checkpoints with Age Dependent Failures 1990 27 ACTAINF Taubner, Representing CCS Programs by Finite Predicate/Transition Nets 1990 27 ACTAINF Engelfriet & de Jong, Attribute Storage Optimization by Stacks 1990 27 ACTAINF Meyer & Olderog, Hiding in Stream Semantics of Uniform Concurrency 1990 27 ACTAINF Lautemann, The Complexity of Graphs Languages Generated by Hyperedge Replacement 1990 27 ACTAINF Overmars & Smid & de Berg & van Kreveld, Maintaining Range Trees in Secondary Memory. Part I: Partitions 1990 27 ACTAINF Smid & Overmars, Maintaining Range Trees in Secondary Memory. Part II: Lower Bounds 1990 27 ACTAINF Morris, Temporal Predicate Transformers and Fair Termination 1990 27 ACTAINF Ehrenfeucht & Rozenberg, Partial (Set) 2-Structures. Part I: Basic Notions and the Representation Problem 1990 27 ACTAINF Ehrenfeucht & Rozenberg, Partial (Set) 2-Structures. Part II: State Spaces of Concurrent Systems 1990 27 ACTAINF Kou, On Efficient Implementation of an Approximation Algorithm for the Steiner Tree Problem 1989 27 ACTAINF Salzberg, Merging Sorted Runs Using Large Main Memory 1989 27 ACTAINF Schmidt & Berghammer & Zierer, Describing Semantic Domains with Sprouts 1989 27 ACTAINF Kouvatsos & Tabet-Aouel, A Maximum Entropy Priority Approximation for a Stable G/G/1 Queue 1989 27 ACTAINF Huang & Lengauer, An Incremental Mechanical Development of Systolic Solutions to the Algebraic Path Problem 1989 27 ACTAINF Taubner & Vogler, Step Failures Semantics and a Complete Proof System 1989 27 ACTAINF Rego, Some Efficient Computational Algorithms Related to Phase Models 1989 27 ACTAINF Culik & Karhumaki, HDT0L Matching of Computations of Multitape Automata 1989 27 ACTAINF Alblas, Iteration of Transformation Passes over Attributed Program Trees 1989 27 ACTAINF Langenhop & Wright, A Model of the Dynamic Behavior of B-trees 1989 27 ACTAINF Ruzicka & Privara, An Almost Linear Robinson Unification Algorithm 1989 27 ACTAINF Lau, A Note on Synthesis and Classification of Sorting Algorithms 1989 27 ACTAINF Gonczarowski & Warmuth, Scattered Versus Context-Sensitive Rewriting 1989 26 ACTAINF Kouvatsos & Almond, Erratum: Maximum Entropy Two-Station Cyclic Queues with Multiple General Servers 1989 26 ACTAINF Kemp, The Expected Additive Weight of Trees 1989 26 ACTAINF Sen, Supercube: An Optimally Fault Tolerant Network Architecture 1989 26 ACTAINF Autebert & Gabarro, Iterated GSMs and Co-CFL 1989 26 ACTAINF Simon, Continuous Reductions Among Combinatorial Optimization Problems 1989 26 ACTAINF Litwin & Sagiv & Vidyasankar, Concurrency and Trie Hashing 1989 26 ACTAINF Roth & Korth & Silberschatz, Null Values in Nested Relational Databases 1989 26 ACTAINF Han & Igarashi, Time Lower Bounds for Parallel Sorting on a Mesh-Connected Processor Array 1989 26 ACTAINF Habel & Kreowski & Vogler, Metatheorems for Decision Problems on Hyperedge Replacement Graph Languages 1989 26 ACTAINF Adiri & Bruno & Frostig & Rinnooy Kan, Single Machine Flow-Time Scheduling With a Single Breakdown 1989 26 ACTAINF Pierre & Schwer, Rational Index of Vector Addition Systems Languages 1989 26 ACTAINF Seidl, On the Finite Degree of Ambiguity of Finite Tree Automata 1989 26 ACTAINF Huang & Jalote, Analytic Models for the Primary Site Approach to Fault-Tolerance 1989 26 ACTAINF Akyildiz & von Brand, Computational Algorithms for Networks of Queues with Rejection Blocking 1989 26 ACTAINF Ramarao, Complexity of Distributed Commit Protocols 1989 26 ACTAINF Bijlsma & Matthews & Wiltink, A Sharp Proof Rule for Procedures in wp Semantics 1989 26 ACTAINF Zhang & Hsu, Unsafe Operations in B-trees 1989 26 ACTAINF Baeza-Yates, Expected Behaviour of B+-trees under Random Insertions 1989 26 ACTAINF Huang & Langston, Stable Duplicate-Key Extraction with Optimal Time and Space Bounds 1989 26 ACTAINF Helman, A Family of NP-Complete Data Aggregation Problems 1989 26 ACTAINF Kouvatsos & Almond, Erratum: Maximum Entropy Two-Station Cyclic Queues with Multiple General Servers 1989 26 ACTAINF Morris, Laws of Data Refinement 1989 26 ACTAINF Hesselink, Predicate-Transformer Semantics of General Recursion 1989 26 ACTAINF Vogler, Failures Semantics and Deadlocking of Modular Petri Nets 1989 26 ACTAINF Baeza-Yates, Modeling Splits in File Structures 1989 26 ACTAINF Kobler & Schoening & Toran, On Counting and Approximation 1989 26 ACTAINF Belaga, Through the Mincing Machine with a Boolean Layer Cake. Nonstandard Computations over Boolean Circuits in the Lower-Bounds-to-Circuit-Size Complexity Proving 1988 26 ACTAINF Cunto & Poblete, Transforming Unbalanced Multiway Trees into a Practical External Data Structure 1988 26 ACTAINF Lipps & Moncke & Olk & Wilhelm, Attribute (Re)evaluation in OPTRAN 1988 26 ACTAINF Kouvatsos & Almond, Maximum Entropy Two-Station Cyclic Queues with Multiple General Servers 1988 26 ACTAINF Levcopoulos & Overmars, A Balanced Search Tree with O(1) Worst-case Update Time 1988 26 ACTAINF Szelepcsenyi, The Method of Forced Enumeration for Nondeterministic Automata 1988 26 ACTAINF Hehner & Gupta & Malton, Erratum: Predicative Methodology 1988 26 ACTAINF van de Vorst, The Formal Development of a Parallel Program Performing LU-Decomposition 1988 26 ACTAINF Jacobs & Feather, Corrections to ``A Synthesis of Several Sorting Algorithms'' by J. Darlington 1988 26 ACTAINF Bertino & Musto, Correctness of Semantic Integrity Checking in Database Management Systems 1988 26 ACTAINF Degano & De Nicola & Montanari, A Distributed Operational Semantics for CCS Based on Condition/Event Systems 1988 26 ACTAINF Sutner & Maass, Motion Planning Among Time Dependent Obstacles 1988 26 ACTAINF Devroye, Applications of the Theory of Records in the Study of Random Trees 1988 26 ACTAINF Engelfriet & Vogler, High Level Tree Transducers and Iterated Pushdown Tree Transducers 1988 25 ACTAINF Back, A Calculus of Refinements for Program Derivations 1988 25 ACTAINF Fiadeiro & Sernadas, Specification and Verification of Database Dynamics 1988 25 ACTAINF Shen, Cooperative Distributed Dynamic Load Balancing 1988 25 ACTAINF Tripathi & Finkel & Gelenbe, Load Sharing in Distributed Systems with Failures 1988 25 ACTAINF Levi & Palamidessi, Contributions to the Semantics of Logic Perpetual Processes 1988 25 ACTAINF Chan & Hernandez, On Generating Database Schemes Bounded or Constant-Time-Maintainable by Extensibility 1988 25 ACTAINF Mitchell, Inductive Completion with Retracts 1988 25 ACTAINF Pudlak & Rodl & Savicky, Graph Complexity 1988 25 ACTAINF Engelfriet & Leih & Rozenberg, Apex Graph Grammars and Attribute Grammars 1988 25 ACTAINF Narendran & Otto, Elements of Finite Order for Finite Weight-Reducing and Confluent Thue Systems 1988 25 ACTAINF Hehner & Malton, Termination Conventions and Comparative Semantics 1988 25 ACTAINF Finkel & Choquet, Fifo Nets Without Order Deadlock 1988 25 ACTAINF Tsakalidis, The Nearest Common Ancestor in a Dynamic Tree 1988 25 ACTAINF Vianu, Database Survivability Under Dynamic Constraints 1988 25 ACTAINF Ganapathi & Fischer, Integrating Code Generation and Peephole Optimization 1988 25 ACTAINF Giegerich, Composition and Evaluation of Attribute Coupled Grammars 1988 25 ACTAINF Schmerl, Resolution on Formula-Trees 1988 25 ACTAINF Biela, Program-Substitution and Admissibility of Rules in Algorithmic Logic 1988 25 ACTAINF Sannella & Tarlecki, Toward Formal Development of Programs from Algebraic Specifications: Implementations Revisited 1988 25 ACTAINF Ming-Hua, A Second Order Theory of Data Types 1988 25 ACTAINF Sobel & Soundararajan, A Proof System for Distributed Processes 1988 25 ACTAINF Reif & Smolka, The Complexity of Reachability in Distributed Communicating Processes 1988 25 ACTAINF Bauer & Wirsing, Crypt-Equivalent Algebraic Specifications 1988 25 ACTAINF Reps, Incremental Evaluation for Attribute Grammars with Unrestricted Movement Between Tree Modifications 1988 25 ACTAINF Bouge, On the Existence of Symmetric Algorithms to Find Leaders in Networks of Communicating Sequential Processes 1988 25 ACTAINF Ehrenfeucht & Hoogeboom & Rozenberg, Recording the Use of Memory in Right-Boundary Grammars and Push-Down Automata 1987 24 ACTAINF Huang & Lengauer, The Derivation of Systolic Implementations of Programs 1987 24 ACTAINF Kastens, Lifetime Analysis for Attributes 1987 24 ACTAINF Lao, Combinator-Based Compilation of Recursive Functions with Different Parameter Passing Modes 1987 24 ACTAINF Horwitz & Demers & Teitelbaum, An Efficient General Iterative Algorithm for Dataflow Analysis 1987 24 ACTAINF Kamin, The Expressive Theory of Stacks 1987 24 ACTAINF de Bakker & Meyer, Order and Metric in the Stream Semantics of Elemental Concurrency 1987 24 ACTAINF Blazewicz & Kubiak & Rock & Szwarcfiter, Minimizing Mean Flow-Time with Parallel Processors and Resource Constraints 1987 24 ACTAINF Duda & Czachorski, Performance Evaluation of Fork and Join Synchronization Primitives 1987 24 ACTAINF Chowdhury & Srimani, Worst Case Performance of Weighted Buddy Systems 1987 24 ACTAINF Chazelle, Some Techniques for Geometric Searching with Implicit Set Representations 1987 24 ACTAINF Cunto & Gascon, Improving Time and Space Efficiency in Generalized Binary Search Trees 1987 24 ACTAINF Becker, An Easily Testable Optimal-Time VLSI Multiplier 1987 24 ACTAINF Hoogewijs, Partial-Predicate Logic in Computer Science 1987 24 ACTAINF Kapur & Narendran & Zhang, On Sufficient-Completeness and Related Properties of Term Rewriting Systems 1987 24 ACTAINF Peters & Rudolph, Parallel Approximation Schemes for Subset Sum and Knapsack Problems 1987 24 ACTAINF Schmidt, Long Unavoidable Patterns 1987 24 ACTAINF Dunne, A Result on k-Valent Graphs and Its Application to a Graph Embedding Problem 1987 24 ACTAINF Kempf & Bayer & Guntzer, Time Optimal Left to Right Construction of Position Trees 1987 24 ACTAINF Bender & Praeger & Wormald, Optimal Worst Case Trees 1987 24 ACTAINF Mill & Desharnals & Mill, Relational Heuristics for the Design of Deterministic Programs 1987 24 ACTAINF Devroye, Branching Processes in the Analysis of the Heights of Trees 1987 24 ACTAINF Alblas, One-Pass Transformations of Attributed Program Trees 1987 24 ACTAINF Kumar & Rangan, A Linear Space Algorithm for the LCS Problem 1987 24 ACTAINF Kunde, Lower Bounds for Sorting on Mesh-Connected Architectures 1987 24 ACTAINF Loizou & Thanisch, Losslessness and Project-Join Constructibility in Relational Databases 1987 24 ACTAINF Murtagh, Redundant Proofs of Non-Interference in Levin-Gries CSP Program Proofs 1987 24 ACTAINF Heilbrunner & Holldobler, The Undecidability of the Unification and Matching Problem for Canonical Theories 1987 24 ACTAINF Szpankowski, An Analysis of a Contention Resolution Algorithm. Another Approach 1987 24 ACTAINF Harris, SLR(1) and LALR(1) Parsing for Unrestricted Grammars 1987 24 ACTAINF DeNicola, Extensional Equivalences for Transition Systems 1987 24 ACTAINF Cousot & Cousot, Sometime = Always + Recursion == Always on the Equivalence of the Intermittent and Invariant Assertions Methods for Proving Inevitability Properties of Programs 1987 24 ACTAINF Janicki, A Formal Semantics for Concurrent Systems with a Priority Relation 1987 24 ACTAINF Takeichi, Partial Parametrization Eliminates Multiple Traversals of Data Structures 1987 24 ACTAINF Goldreich & Shrira, Electing a Leader in a Ring with Link Failures 1987 24 ACTAINF Leung, Analysis of Space Allocation in a Generally Fragmented Linear Store 1987 24 ACTAINF Vidyasankar, Generalized Theory of Serializability 1986 23 ACTAINF Hehner & Gupta & Malton, Predicative Methodology 1986 23 ACTAINF Graf & Sifakis, A Logic for the Specification and Proof of Regular Controllable Processes of CCS 1986 23 ACTAINF Lee & Lee & Wong, Generating Binary Trees of Bounded Height 1986 23 ACTAINF Kouvatsos, Maximum Entropy and the G/G/1/N Queue 1986 23 ACTAINF Reichardt, Deterministic Grammars and Grammar Morphisms 1986 23 ACTAINF Maon, On the Equivalence of Some Transductions Involving Letter to Letter Morphisms on Regular Languages 1986 23 ACTAINF Culik & Karhumaki, Synchronizable Deterministic Pushdown Automata and the Decidability of their Equivalence 1986 23 ACTAINF Becker & Mehlhorn, Algorithms for Routing in Planar Graphs 1986 23 ACTAINF Bengelloun, An Incremental Primal Sieve 1986 23 ACTAINF Bijlsma & Wiltink & Matthews, Equivalence of the Gries and Martin Proof Rules for Procedure Calls 1986 23 ACTAINF Bucher, A Regularity Test for Dual Bordered OS Systems 1986 23 ACTAINF Calzarossa & Italiani & Serazzi, A Workload Model Representative of Static and Dynamic Characteristics 1986 23 ACTAINF Dijkstra & van Gasteren, A Simple Fixpoint Argument Without the Restriction to Continuity 1986 23 ACTAINF Duponcheel & Duponcheel, Acceptable Functional Programming Systems 1986 23 ACTAINF Farrow & Yellin, A Comparison of Storage Optimizations in Automatically-Generated Attribute Evaluators 1986 23 ACTAINF Heckmann, An Efficient ELL(1)-Parser Generator 1986 23 ACTAINF Koutny, The Merlin-Randell Problem of Train Journeys 1986 23 ACTAINF Krivanek & Moravek, NP-Hard Problems in Hierarchical-Tree Clustering 1986 23 ACTAINF Mahmoud, On the Average Internal Path Length of m-ary Search Trees 1986 23 ACTAINF Makowsky & Vardi, On the Expressive Power of Data Dependencies 1986 23 ACTAINF Nakata & Sassa, Generation of Efficient LALR Parsers for Regular Right Part Grammars 1986 23 ACTAINF Nicola, A Single Server Queue with Mixed Types of Interruptions 1986 23 ACTAINF Olderog & Hoare, Specification-Oriented Semantics for Communicating Processes 1986 23 ACTAINF Otto, On Deciding Whether a Monoid is a Free Monoid or is a Group 1986 23 ACTAINF Paterson & Wegener, Nearly Optimal Hierarchies for Network and Formula Size 1986 23 ACTAINF Rosenberg, Exponential Queueing Systems with Non-Stationary Parameters 1986 23 ACTAINF Rozenberg & Welzl, Graph Theoretic Closure Properties of the Family of boundary NLC Graph Languages 1986 23 ACTAINF Soundararajan, Total Correctness of CSP Programs 1986 23 ACTAINF Tamminen & Luk & Sipala & Woo & Wong, Constructing Maximal Slicings from Geometry 1986 23 ACTAINF Wagner, The Complexity of Combinatorial Problems with Succinct Input Representation 1986 23 ACTAINF Wu & Widmayer & Wong, A Faster Approximation Algorithm for the Steiner Problem in Graphs 1986 23 ACTAINF Wyrostek, Precedence Technique is not Worse than SLR(1) 1986 22 ACTAINF Caspi & Halbwachs, A Functional Model for Describing and Reasoning About Time Behaviour of Computing Systems 1986 22 ACTAINF Diekert, Investigations on Hotz Groups for Arbitrary Grammars 1986 22 ACTAINF Nipkow, Non-deterministic Data Types: Models and Implementations 1986 22 ACTAINF Reusch & Merzenich, Minimal Coverings for Incompletely Specified Sequential Machines 1986 22 ACTAINF Rudnicki & Drabent, Erratum: Proving Properties of Pascal Programs in MIZAR2 1985 22 ACTAINF Bechtold & Pujolle & Spaniol, Throughput of a Satellite Channel Communication 1985 22 ACTAINF Beynon, Replaceability and Computational Equivalence for Monotone Boolean Functions 1985 22 ACTAINF Bruno & Downey, Probabilistic Bounds for Dual Bin-Packing 1985 22 ACTAINF Bruno, On Scheduling Tasks with Exponential Service Times and In-Tree Precedence Constraints 1985 22 ACTAINF Chiba & Onoguchi & Nishizeki, Drawing Plane Graphs Nicely 1985 22 ACTAINF Chung & Evangelist & Sudborough, Complete Problems for Space Bounded Subclasses of NP 1985 22 ACTAINF Cunningham & Dick, Rewrite Systems on a Lattice of Types 1985 22 ACTAINF Dunne, A 2.5n Lower bound on the Monotone Network Complexity of T_3^n 1985 22 ACTAINF Gonczarowski, Decidable Properties of Monadic Recursive Schemas with a Depth Parameter 1985 22 ACTAINF Heilbrunner, Truly Prefix-Correct Chain-Free LR(1) Parsers 1985 22 ACTAINF Hromkovic, Fooling a Two-Way Nondeterministic Multihead Automaton with Reversal Number Restriction 1985 22 ACTAINF Huynh, Complexity of the Word Problem for Commutative Semigroups of Fixed Dimension 1985 22 ACTAINF Jacobs & Gries, General Correctness: A Unification of Partial and Total Correctness 1985 22 ACTAINF Kamimura, An Effectively Given Initial Semigroup 1985 22 ACTAINF Kfoury & Urzyczyn, Necessary and Sufficient Conditions for the Universality of Programming Formalisms 1985 22 ACTAINF Kingston, Analysis of Tree Algorithms for the Simulation Event List 1985 22 ACTAINF Krishnamurthy, Short Proofs for Tricky Formulas 1985 22 ACTAINF Latteux & Leguy & Ratoandromanana, The Family of One-Counter Languages is Closed Under Quotient 1985 22 ACTAINF Lloyd & Loui, On the Worst Case Performance of Buddy Systems 1985 22 ACTAINF Loveland, Performance Bounds for Binary Testing with Arbitrary Weights 1985 22 ACTAINF Meghini & Thanos, Querying Fragmented Relations in a Distributed Database 1985 22 ACTAINF Mili & Desharnais & Gagne, Strongest Invariant Functions: Their Use in the Systematic Analysis of While Statements 1985 22 ACTAINF Miyakawa, Optimum Decision Trees--An Optimal Variable Theorem and its Related Applications 1985 22 ACTAINF Moller, On the Algebraic Specification of Infinite Objects--Ordered and Continuous Models of Algebraic Types 1985 22 ACTAINF Monien & Speckenmeyer, Ramsey Numbers and an Approximation Algorithm for the Vertex Cover Problem 1985 22 ACTAINF Ottmann & Schrapp & Wood, Purely Top-Down Updating Algorithms for Stratified Search Trees 1985 22 ACTAINF Rembowski, A Priority Queue with Interruptions of Service Permitted After a Time Quantum 1985 22 ACTAINF Rudnicki & Drabent, Proving Properties of Pascal Programs in MIZAR 2 1985 22 ACTAINF Sack & Strothotte, An Algorithm for Merging Heaps 1985 22 ACTAINF Schneider & Conway & Skeen, Thrifty Execution of Task Pipelines 1985 22 ACTAINF Sonnenschein, Global Storage Cells for Attributes in an Attribute Grammar 1985 21 ACTAINF Berry, A Denotational Semantics for Shared-Memory Parallelism and Nondeterminism 1985 21 ACTAINF Chen & Rem, Deadlock-Freedom in Resource Contentions 1985 21 ACTAINF Fisher, Practical LL(1)-Based Parsing of van Wijngaarden Grammars 1985 21 ACTAINF Lenfant & Tahe, Permuting Data with the Omega Network 1985 21 ACTAINF Valk & Jantzen, The Residue of Vector Sets with Applications to Decidability Problems in Petri Nets 1985 21 ACTAINF Wright, Some Average Performance Measures for the B-tree 1984 21 ACTAINF Autebert & Beauquier & Boasson & Gire, Bicenters of Context-Free Languages 1984 21 ACTAINF Barringer & Cheng & Jones, A Logic Covering Undefinedness in Program Proofs 1984 21 ACTAINF Bauer & Otto, Finite Complete Rewriting Systems and the Complexity of the Word Problem 1984 21 ACTAINF Bayer & Schlichtiger, Data Management Support for Database Management 1984 21 ACTAINF Bergstra & Tucker, The Axiomatic Semantics of Programs Based on Hoare's Logic 1984 21 ACTAINF Best & Voss, Free Choice Systems Have Home States 1984 21 ACTAINF Bird, Using Circular Programs to Eliminate Mutliple Traversals of Data 1984 21 ACTAINF Blum & Seysen, Characterization of All Optimal Networks for a Simultaneous Computation of AND and NOR 1984 21 ACTAINF Bulyonkov, Polyvariant Mixed Computation for Analyzer Programs 1984 21 ACTAINF Chapman, LALR(1,1) Parser Generation for Regular Right Part Grammars 1984 21 ACTAINF Choffrut & Culik, On Real-Time Cellular Automata and Trellis Automata 1984 21 ACTAINF Coffman & Langston, A Performance Guarantee for the Greedy Set-Partitioning Algorithm 1984 21 ACTAINF Costa & Stirling, A Fair Calculus of Communicating Systems 1984 21 ACTAINF Deransart & Jourdan & Lorho, Speeding Up Circularity Tests for Attribute Grammars 1984 21 ACTAINF Devroye, A Probabilistic Analysis of the Height of Tries and the Complexity of Triesort 1984 21 ACTAINF Gillett, On Binary Tree Encodements 1984 21 ACTAINF Guting, Optimal Divide-and-Conquer to Compute Measure and Contour for a Set of Iso-Rectangles 1984 21 ACTAINF Hennessy, Axiomatising Finite Delay Operators 1984 21 ACTAINF Hertel & Mantyla & Mehlhorn & Nievergelt, Space Sweep Solves Intersection of Convex Polyhedra 1984 21 ACTAINF Huang & Wong, Generalized Binary Split Trees 1984 21 ACTAINF Ibarra & Kim, A Characterization of Systolic Binary Tree Automata and Applications 1984 21 ACTAINF Iglehart & Shedler, Simulation Output Analysis for Local Area Computer Networks 1984 21 ACTAINF Leung & Choo, The Paging Drum Queue: A Uniform Perspective and Further Results 1984 21 ACTAINF Lubachevsky, An Approach to Automating the Verification of Compact Parallel Coordination Programs. I 1984 21 ACTAINF Mehlhorn & Vishkin, Randomized and Deterministic Simulations of PRAMs by Parallel Machines with Restricted Granularity of Parallel Memories 1984 21 ACTAINF Sannella, A Set-Theoretic Semantics for Clear 1984 21 ACTAINF Szwarcfiter, Optimal Multiway Search Trees for Variable Size Keys 1984 21 ACTAINF Tsakalidis, Maintaining Order in a Generalized Linked List 1983 20 ACTAINF Akdag, Performances of an Algorithm Constructing a Nearly Optimal Binary Tree 1983 20 ACTAINF Bannister & Trivedi, Task Allocation in Fault-Tolerant Distributed Systems 1983 20 ACTAINF Ben-Ari & Pnueli & Manna, The Temporal Logic of Branching Time 1983 20 ACTAINF Bucher, Two-Symbol DOS Systems Generating Regular Languages 1983 20 ACTAINF Chandra & Kou & Markowsky & Zaks, On Sets of Boolean n-Vectors With All k-Projections Surjective 1983 20 ACTAINF Coppo, On the Semantics of Polymorphism 1983 20 ACTAINF Damm & Josko, A Sound and Relatively * Complete Hoare-Logic for a Language With Higher Type Procedures 1983 20 ACTAINF Flajolet, On the Performance Evaluation of Extendible Hashing and Trie Searching 1983 20 ACTAINF Fraenkel & Mor & Perl, Is Text Compression by Prefixes and Suffixes Practical? 1983 20 ACTAINF Francez, Product Properties and Their Direct Verification 1983 20 ACTAINF Goodman & Shmueli, NP-complete Problems Simplified on Tree Schemas 1983 20 ACTAINF He, General Predicate Transformer and the Semantics of a Programming Language With Go To Statement 1983 20 ACTAINF Kameda, A Note on Multi-Queue Scheduling of Two Tasks 1983 20 ACTAINF Kleijn & Rozenberg, On the Generative Power of Regular Pattern Grammars 1983 20 ACTAINF Mannila & Raiha, On the Relationship of Minimum and Optimum Covers for a Set of Functional Dependencies 1983 20 ACTAINF Marque-Pucheu, Rational Set of Trees and the Algebraic Semantics of Logic Programming 1983 20 ACTAINF Martin, A General Proof Rule for Procedures in Predicate Transformer Semantics 1983 20 ACTAINF Mill, A Relational Approach to the Design of Deterministic Programs 1983 20 ACTAINF Pansiot, Hierarchie et Fermeture de Certaines Classes de Tag-Systemes 1983 20 ACTAINF Pohlmann, LR Parsing for Affix Grammars 1983 20 ACTAINF Ronse, A Three-Stage Construction for Multiconnection Networks 1983 20 ACTAINF Simon, Pattern Matching in Trees and Nets 1983 20 ACTAINF Wirsing & Pepper & Partsch & Dosch & Broy, On Hierarchies of Abstract Data Types 1983 19 ACTAINF Agrawal & Detro, An Efficient Incremental LR Parser for Grammars With Epsilon Productions 1983 19 ACTAINF Bergstra & Terlouw, Standard Model Semantics for DSL--A Data Type Specification Language 1983 19 ACTAINF El-Affendi & Kouvatsos, A Maximum Entropy Analysis of the M/G/1 and G/M/1 Queueing Systems at Equilibrium 1983 19 ACTAINF Engels & Pletat & Ehrich, An Operational Semantics for Specifications of Abstract Data Types with Error Handling 1983 19 ACTAINF File, Interpretation and Reduction of Attribute Grammars 1983 19 ACTAINF Hromkovic, One-Way Multihead Deterministic Finite Automata 1983 19 ACTAINF Iwama, The Universe Problem for Unrestricted Flow Languages 1983 19 ACTAINF Kearns & Soffa, The Implementation of Retention in a Coroutine Environment 1983 19 ACTAINF Klein & Meyer auf der Heide, A Lower Time Bound for the Knapsack Problem on Random Access Machines 1983 19 ACTAINF Kung & Papadimitriou, An Optimality Theory of Concurrency Control for Databases 1983 19 ACTAINF Kuspert, Storage Utilization in B*-Trees with a Generalized Overflow Technique 1983 19 ACTAINF Meyer auf der Heide, Efficiency of Universal Parallel Computers 1983 19 ACTAINF Nielson, Computation Sequences: A Way to Characterize Classes of Attribute Grammars 1983 19 ACTAINF Pfaff, The Construction of Operator Interfaces Based on Logical Input Devices 1983 19 ACTAINF Queille & Sifakis, Fairness and Related Properties in Transition Systems--A Temporal Logic to Deal with Fairness 1983 19 ACTAINF Ruohonen, On Some Variants of Post's Correspondence Problem 1983 19 ACTAINF Schmitt, On the Number of Relational Operators Necessary to Compute Certain Functions of Real Variables 1983 19 ACTAINF Schurfeld, New Lower Bounds on the Formula Size of Boolean Functions 1983 19 ACTAINF Sommerhaider & van Westrhenen, Parallel Language Recognition in Constant Time by Cellular Automata 1983 19 ACTAINF Suzuki & Kasami, Three Measures for Synchronic Dependence in Petri Nets 1983 19 ACTAINF Taylor, Complexity of Analyzing the Synchronization Structure of Concurrent Programs 1983 19 ACTAINF Tsuda & Sato, Transposition of Large Tabular Data Structures with Applications to Physical Database Organization. I. Transposition of Tabular Data Structures 1983 19 ACTAINF Tsuda & Urano & Sato, Transposition of Large Tabular Data Structures with Applications to Physical Database Organization. II. Applications to Physical Database Organization 1983 19 ACTAINF Vardi, Inferring Multivalued Dependencies From Functional and Join Dependencies 1983 18 ACTAINF Banatre & Frison & Quinton, A Network for the Detection of Words in Continuous Speech 1983 18 ACTAINF Culik & Gruska & Salomaa, Systolic Automata for VLSI on Balanced Trees 1983 18 ACTAINF Eriksen & Staunstrup, Concurrent Algorithms for Root Searching 1983 18 ACTAINF Nain, Task Scheduling Between Two Homogeneous Processors 1983 18 ACTAINF Slutzki, Finite State Relational Programs 1983 18 ACTAINF Supowit & Reingold, The Complexity of Drawing Trees Nicely 1983 18 ACTAINF van Leeuwen & Overmars, Stratified Balanced Search Trees 1983 18 ACTAINF Winklmann, On the Complexity of Some Problems Concerning the Use of Procedures. II. 1982 18 ACTAINF Agrawala & Tripathi, On an Exponential Server with General Cyclic Arrivals 1982 18 ACTAINF Allen, On the Costs of Optimal and Near-Optimal Binary Search Trees 1982 18 ACTAINF Anderson & Backhouse, An Alternative Implementation of an Insertion-Only Recovery Technique 1982 18 ACTAINF Brown & Baker & Katseff, Lower Bounds for On-Line Two-Dimensional Packing Algorithms 1982 18 ACTAINF Broy & Wirsing, Partial Abstract Types 1982 18 ACTAINF Budd & Angluin, Two Notions of Correctness and Their Relation to Testing 1982 18 ACTAINF Carter, Further Analysis of Code Generation for a Single Register Machine 1982 18 ACTAINF Dewar & Merritt & Sharir, Some Modified Algorithms for Dijkstra's Longest Upsequence Problem 1982 18 ACTAINF Ernst & Navlakha & Ogden, Verification of Programs with Procedure-Type Parameters 1982 18 ACTAINF Frougny & Sakarovitch & Valkema, On the Hotz Group of a Context-Free Grammar 1982 18 ACTAINF Langmaack, On Termination Problems for Finitely Interpreted ALGOL-like Programs 1982 18 ACTAINF Leguy, Saturated Languages and Decreasing Cones. Bifaithful Languages and Bifaithful Cones 1982 18 ACTAINF Nakatsu & Kambayashi & Yajima, A Longest Common Subsequence Algorithm Suitable for Similar Text Strings 1982 18 ACTAINF Nicolas, Logic for Improving Integrity Checking in Relational Data Bases 1982 18 ACTAINF Nielson, A Denotational Framework for Data Flow Analysis 1982 18 ACTAINF Pettorossi & Burstall, Deriving Very Efficient Algorithms for Evaluating Linear Recurrence Relations Using the Program Transformation Technique 1982 18 ACTAINF Ramirez & Tompa & Munro, Optimum Reorganization Points for Arbitrary Database Costs 1982 18 ACTAINF Reisig, Deterministic Buffer Synchronization of Sequential Processes 1982 18 ACTAINF Winklmann, On the Complexity of Some Problems Concerning the Use of Procedures. I. 1982 17 ACTAINF Arnold, Synchronized Behaviours of Processes and Rational Relations 1982 17 ACTAINF Asveld & Tucker, Complexity Theory and the Operational Structure of Algebraic Programming Systems 1982 17 ACTAINF Autebert & Beauquier & Boasson, Grammars and Language Forms 1982 17 ACTAINF Baccelli & Fleury, On Parsing Arithmetic Expressions in a Multiprocessing Environment 1982 17 ACTAINF Blum, On the Power of Chain Rules in Context-Free Grammars 1982 17 ACTAINF Cristian, Robust Data Types 1982 17 ACTAINF Demers & Keleman & Reusch, On Some Decidable Properties of Finite State Translations 1982 17 ACTAINF Doberkat, Deleting the Root of a Heap 1982 17 ACTAINF Gergely & Ury, A Theory of Interactive Programming 1982 17 ACTAINF Huddleston & Mehlhorn, A New Data Structure for Representing Sorted Lists 1982 17 ACTAINF Huwig, A Model of the P=NP-Problem with a Positive Solution 1982 17 ACTAINF Huynh, Remarks on the Complexity of an Invariant of Context-Free Grammars 1982 17 ACTAINF Itai & Rodeh, Representation of Graphs 1982 17 ACTAINF Ja'Ja' & Simon, Space Efficient Algorithms for Some Graph Theoretical Problems 1982 17 ACTAINF Kessels, Arbitration Without Common Modifiable Variables 1982 17 ACTAINF Leung & Choo, The Effect of Fixed-Length Record Implementation on File System Response 1982 17 ACTAINF Liu & Liu & Liestman, Scheduling with Slack Time 1982 17 ACTAINF Martinez, Program Behavior Prediction and Prepaging 1982 17 ACTAINF Miyano, A Hierarchy Theorem for Multihead Stack-Counter Automata 1982 17 ACTAINF Overmars & van Leeuwen, Dynamic Multi-Dimensional Data Structures Based on Quad- and K-D Trees 1982 17 ACTAINF Pritchard, Explaining the Wheel Sieve 1982 17 ACTAINF Rabin, The Choice Coordination Problem 1982 17 ACTAINF Raiha & Saarinen, Testing Attribute Grammars for Circularity 1982 17 ACTAINF Rozenberg & Verraedt, Completeness of E0L Forms is Decidable 1982 17 ACTAINF Shore, Information Theoretic Approximations for M/G/1 and G/G/1 Queuing Systems 1982 17 ACTAINF Snyder, Recognition and Selection of Idioms for Code Optimization 1982 17 ACTAINF Soisalon-Soininen & Wood, On a Covering Relation for Context-Free Grammars 1982 17 ACTAINF Staphylopatis, Performance Considerations in the Parallel Execution of Numerical Algorithms on Two Processors 1982 17 ACTAINF Vasudevan, Inner Loops in Flowgraphs and Code Optimization 1981 16 ACTAINF Alblas, A Characterization of Attribute Evaluation in Passes 1981 16 ACTAINF Best & Randell, A Formal Model of Atomicity in Asynchronous Systems 1981 16 ACTAINF Blikle, The Clean Termination of Iterative Programs 1981 16 ACTAINF Claus, The (n,k)-Bounded Emptiness-Problem for Probabilistic Acceptors and Related Problems 1981 16 ACTAINF Clint, On the Use of History Variables 1981 16 ACTAINF Engelfriet & File, The Formal Power of One-Visit Attribute Grammars 1981 16 ACTAINF Fenner & Loizou, An Analysis of Two Related Loop-free Algorithms for Generating Integer Partitions 1981 16 ACTAINF Goldschlager, epsilon-Productions in Context-Free Grammars 1981 16 ACTAINF Hamlet, Reliability Theory of Program Testing 1981 16 ACTAINF Hennessy & Kieburtz, The Formal Definition of a Real-Time Language 1981 16 ACTAINF Janssens & Rozenberg, A Characterization of Context-free String Languages by Directed Node-label Controlled Graph Grammars 1981 16 ACTAINF Kedem & Silberschatz, A Characterization of Database Graphs Admitting a Simple Locking Protocol 1981 16 ACTAINF Klingler & Reisch, A Gap Between the Actual Complexity of Permutations and Their Entropy Defined by Stoss 1981 16 ACTAINF Lengauer, Black-White Pebbles and Graph Separation 1981 16 ACTAINF Manna & Waldinger, Problematic Features of Programming Languages: A Situational-Calculus Approach 1981 16 ACTAINF Markowsky, Best Huffman Trees 1981 16 ACTAINF Martin, An Axiomatic Definition of Synchronization Primitives 1981 16 ACTAINF Olderog, Sound and Complete Hoare-like Calculi Based on Copy Rules 1981 16 ACTAINF Ostrand & Paull & Weyuker, Parsing Regular Grammars with Finite Lookahead 1981 16 ACTAINF Pritchard, Another Look at the ``Longest Ascending Subsequence'' Problem 1981 16 ACTAINF Ramanathan & Kennedy, Pathlistings Applied to Data Flow Analysis 1981 16 ACTAINF Schassberger, On the Response Time Distribution in a Discrete Round-Robin Queue 1981 16 ACTAINF Stadel, Handling Different INTEGER Representations by Optimizing Compilers 1981 15 ACTAINF Aanderaa & Borger, The Equivalence of Horn and Network Complexity for Boolean Functions 1981 15 ACTAINF Apt, Recursive Assertions and Parallel Programs 1981 15 ACTAINF Araki & Tokura, Flow Languages Equal Recursively Enumerable Languages 1981 15 ACTAINF Baccelli, Analysis of a Service Facility with Periodic Checkpointing 1981 15 ACTAINF Back, Proving Total Correctness of Nondeterministic Programs in Infinitary Logic 1981 15 ACTAINF Berry, Remarks on R. D. Tennent's Language Design Methods Based on Semantic Principles: Algol 68, A Language Designed Using Semantic Principles 1981 15 ACTAINF Booth & Lipton, Computing Extremal and Approximate Distances in Graphs Having Unit Cost Edges 1981 15 ACTAINF Boxma & Konheim, Approximate Analysis of Exponential Queueing Systems with Blocking 1981 15 ACTAINF Cartwright & Oppen, The Logic of Aliasing 1981 15 ACTAINF Casanova & Bernstein, Erratum: General Purpose Schedulers for Database Systems 1981 15 ACTAINF Daduna & Schassberger, A Discrete-Time Round-Robin Queue with Bernoulli Input and General Arithmetic Service Time Distributions 1981 15 ACTAINF de Bruin, Goto Statements: Semantics and Deduction Systems 1981 15 ACTAINF Iglehart & Shedler, Regenerative Simulation of Response Times in Networks of Queues: Statistical Efficiency 1981 15 ACTAINF Kemp, LR(0) Grammars Generated by LR(0) Parsers 1981 15 ACTAINF Kou & Markowsky & Berman, A Fast Algorithm for Steiner Trees 1981 15 ACTAINF Kuich, The Characterization of Parallel Ultralinear Grammars by Rational Power Series 1981 15 ACTAINF Levin & Gries, A Proof Technique for Communicating Sequential Processes 1981 15 ACTAINF Lipski & Preparata, Efficient Algorithms for Finding Maximum Matchings in Convex Bipartite Graphs and Related Problems 1981 15 ACTAINF Mayr, Persistence of Vector Replacement Systems is Decidable 1981 15 ACTAINF Moore & Russell, Axiomatic Data Type Specifications: A First Order Theory of Linear Lists 1981 15 ACTAINF Purdom & Brown & Robertson, Backtracking with Multi-Level Dynamic Search Rearrangement 1981 15 ACTAINF Purdom & Brown, Parsing Extended LR(k) Grammars 1981 15 ACTAINF Reisch, Hex is PSPACE-Complete 1981 15 ACTAINF Rodriguez, Strong Independence of Certain Operations 1981 15 ACTAINF Tokuda, Eliminating Unit Reduction from LR(k) Parsers Using Minimum Contexts 1981 15 ACTAINF Wegener, An Improved Complexity Hierarchy on the Depth of Boolean Functions 1981 15 ACTAINF Wright, Binary Search Trees in Secondary Memory 1981 15 ACTAINF Wurges, A Specification Technique Based on Predicate Transformers 1980 14 ACTAINF Bromley, Memory Fragmentation in Buddy Methods for Dynamic Storage Allocation 1980 14 ACTAINF Casanova & Bernstein, General Purpose Schedulers for Database Systems 1980 14 ACTAINF Commentz-Walter & Sattler, Size-depth Tradeoff in Non-monotone Boolean Formulae 1980 14 ACTAINF Galil, An O(V^{5/3} E^{2/3}) Algorithm for the Maximal Flow Problem 1980 14 ACTAINF Kemp, A Note on the Density of Inherently Ambiguous Context-free Languages 1980 14 ACTAINF Kroger, Infinite Proof Rules for Loops 1980 14 ACTAINF Lamport, The `Hoare Logic' of Concurrent Programs 1980 14 ACTAINF Moll, Left Context Precedence Grammars 1980 14 ACTAINF Nakajima & Honda & Nakahara, Hierarchical Program Specification and Verification--a Many-sorted Logical Approach 1980 14 ACTAINF Nijholt, A Survey of Normal Form Covers for Context-free Grammars 1980 14 ACTAINF Nishimura, Descriptively Complete Process Logic 1980 14 ACTAINF Paul & Prauss & Reischuk, On Alternation 1980 14 ACTAINF Paul & Reischuk, On Alternation II. A Graph Theoretic Approach to Determinism Versus Nondeterminism 1980 14 ACTAINF Philipp & Prauss, Separators in Planar Graphs 1980 14 ACTAINF Plateau, Performance Evaluation of a Concurrency Control for a Distributed Database 1980 14 ACTAINF Purdom & Brown, Semantic Routines and LR(k) Parsers 1980 14 ACTAINF Russell, Correctness of the Compiling Process Based on Axiomatic Semantics 1980 14 ACTAINF Schlatter Ellis, Concurrent Search and Insertion in 2-3 Trees 1980 14 ACTAINF Soisalon-Soininen, On the Space Optimizing Effect of Eliminating Single Productions from LR Parsers 1980 14 ACTAINF Vaishnavi & Kriegel & Wood, Optimum Multiway Search Trees 1980 14 ACTAINF Wand, First-Order Identities as a Defining Language 1980 14 ACTAINF Wegner, On Parsing Two-Level Grammars 1980 13 ACTAINF Barstow, Remarks on ``A Synthesis of Several Sorting Algorithms'' by John Darlington 1980 13 ACTAINF Bentley & Maurer, Efficient Worst-Case Data Structures for Range Searching 1980 13 ACTAINF Berztiss, Depth-First K-Trees and Critical Path Analysis 1980 13 ACTAINF Clarke, Proving Correctness of Coroutines Without History Variables 1980 13 ACTAINF Dijkstra, Some Beautiful Arguments Using Mathematical Induction 1980 13 ACTAINF Fischer & Milton & Quiring, Efficient LL(1) Error Correction and Recovery Using Only Insertions 1980 13 ACTAINF Franta & Bilodeau, Analysis of a Prioritized CSMA Protocol Based on Staggered Delays 1980 13 ACTAINF Galil, Application of Efficient Mergeable Heaps for Optimization Problems on Trees 1980 13 ACTAINF Gonnet & Rogers & George, An Algorithmic and Complexity Analysis of Interpolation Search 1980 13 ACTAINF Heidelberger, Variance Reduction Techniques for the Simulation of Markov Process. II. Matrix Iterative Methods 1980 13 ACTAINF Hoffmann, Semantic Properties of Lucid's Compute Clause and Its Compilation 1980 13 ACTAINF Kastens, Ordered Attribute Grammars 1980 13 ACTAINF Kintala & Wotschke, Amounts of Nondeterminism in Finite Automata 1980 13 ACTAINF Kleine Buning & Priese, Universal Asynchronous Iterative Arrays of Mealy Automata 1980 13 ACTAINF Latteux, Algebraic and Linear Generators 1980 13 ACTAINF Maurer & Nivat, Rational Bijection of Rational Sets 1980 13 ACTAINF Maurer & Salomaa & Wood, On Generators and Generative Capacity of E0L Forms 1980 13 ACTAINF Mescheder, On the Number of Active *-Operations Needed to Compute the Discrete Fourier Transform 1980 13 ACTAINF Morito & Salkin, Using the Blankinship Algorithm to Find the General Solution of a Linear Diophantine Equation 1980 13 ACTAINF Reisch, Gobang is PSPACE-Complete 1980 13 ACTAINF Reutenauer, An Ogden-Like Iteration Lemma for Rational Power Series 1980 13 ACTAINF Rohrich, Methods for the Automatic Construction of Error Correcting Parsers 1980 13 ACTAINF Rollik, Automata in Planar Graphs 1980 13 ACTAINF Rozenberg & Wood, Context-Free Grammars With Selective Rewriting 1980 13 ACTAINF Siekmann & Wrightson, Paramodulated Connection Graphs 1980 13 ACTAINF Tompa, A Practical Example of the Specification of Abstract Data Types 1980 13 ACTAINF Wegener, A New Lower Bound on the Monotone Network Complexity of Boolean Sums 1979 12 ACTAINF Alt, Lower Bounds on Space Complexity for Contextfree Recognition 1979 12 ACTAINF Book, On Languages Accepted by Space-Bounded Oracle Machines 1979 12 ACTAINF Burton, Generalized Recursive Data Structures 1979 12 ACTAINF Cohen, The Mutliple Phase Service Network with Generalized Processor Sharing 1979 12 ACTAINF Commentz-Walter, Size-Depth Tradeoff in Monotone Boolean Formulae 1979 12 ACTAINF Gelenbe, Probabilistic Models of Computer Systems. Part II: Diffusion Approximations, Waiting Times and Batch Arrivals 1979 12 ACTAINF Hikita, On a Class of Recursive Procedures and Equivalent Iterative Ones 1979 12 ACTAINF Horibe & Nemetz, On the Max-Entropy Rule for a Binary Search Tree 1979 12 ACTAINF Iglehart & Shedler, Regenerative Simulation of Response Times in Networks of Queues with Mutliple Job Types 1979 12 ACTAINF Lauer & Torrigiani & Shields, COSY--A System Specification Language Based on Paths and Processes 1979 12 ACTAINF Mehlhorn, Some Remarks on Boolean Sums 1979 12 ACTAINF Mikou & Tucci, Optimal Recovery in a System for the Management of Centralized Data 1979 12 ACTAINF Nishimura, Sequential Method in Propositional Dynamic Logic 1979 12 ACTAINF Soisalon-Soininen & Ukkonen, A Method for Transforming Grammars into LL(k) Form 1979 12 ACTAINF Steensgaard-Madsen, Pascal--Clarifications and Recommended Extensions 1979 12 ACTAINF Turnbull & Lee, Generalized Deterministic Left to Right Parsing 1979 12 ACTAINF van Lamsweerde & Sintzoff, Formal Derivation of Strongly Correct Concurrent Programs 1979 12 ACTAINF Wilhelm, Computation and Use of Data Flow Information in Optimizing Compilers 1979 11 ACTAINF Adams & Gelenbe & Vicard, An Experimentally Validated Model of the Paging Drum 1979 11 ACTAINF Arbib & Alagic, Proof Rules for Gotos 1979 11 ACTAINF Asveld & Engelfriet, Extended Linear Macro Grammars, Iteration Grammars, and Register Programs 1979 11 ACTAINF Autebert, Operations de Cylindre et Applications Sequentielles Gauches Inverses 1979 11 ACTAINF Bouchet, Recovery Techniques for Distributed Database Management System 1979 11 ACTAINF Coleman & Hughes, The Clean Termination of Pascal Programs 1979 11 ACTAINF Gries, The Schorr-Waite Graph Marking Algorithm 1979 11 ACTAINF Hehner, do Considered od: A Contribution to the Programming Calculus 1979 11 ACTAINF Heilbrunner, On the Definition of ELR(k) and ELL(k) Grammars 1979 11 ACTAINF Jones, Constructing a Theory of a Data Structure as an Aid to Program Development 1979 11 ACTAINF Kemp, The Average Number of Registers Needed to Evaluate a Binary Tree Optimally 1979 11 ACTAINF LaLonde, Constructing LR Parsers for Regular Right Part Grammars 1979 11 ACTAINF Latteux, Intersections of Bounded Algebraic Languages 1979 11 ACTAINF Merzenich, A Binary Operation on Trees and an Initial Algebra Characterization for Finite Tree Types 1979 11 ACTAINF Topor, The Correctness of the Schorr-Waite List Marking Algorithm 1979 11 ACTAINF Unterauer, Dynamic Weighted Binary Search Trees 1979 11 ACTAINF van Leeuwen, A Useful Lemma for Context-Free Programmed Grammars 1978 11 ACTAINF Adleman & Booth & Preparata & Ruzzo, Improved Time and Space Bounds for Boolean Matrix Mutliplication 1978 11 ACTAINF Darlington, A Synthesis of Several Sorting Algorithms 1978 11 ACTAINF Ginsburg & Wood, Precedence Relations in Grammar Forms 1978 11 ACTAINF Greibach, Hierarchy Theorems for Two-Way Finite State Transducers 1978 11 ACTAINF Huet & Lang, Proving and Applying Program Transformations Expressed with Second-Order Patterns 1978 11 ACTAINF McColl, Complexity Hierarchies for Boolean Functions 1978 11 ACTAINF Silberschatz & Johnson, Remarks on ``Some Comments on Concurrent Readers and Writers'' by Reidar Conradi 1978 10 ACTAINF Babich & Jazayeri, The Method of Attributes for Data Flow Analysis. Part I. Exhaustive Analysis 1978 10 ACTAINF Babich & Jazayeri, The Method of Attributes for Data Flow Analysis. Part II. Demand Analysis 1978 10 ACTAINF Bartsch & Bolch, A Conservation Law for G/G/m Queueing Systems 1978 10 ACTAINF Ben-Ari, Ianov Pushdown Schemes Are Contained in Boolean Recursive Schemes 1978 10 ACTAINF Biskup, On the Complementation Rule for Multivalued Dependencies in Database Relations 1978 10 ACTAINF Celentano, Incremental LR Parsers 1978 10 ACTAINF Choy & Wong, Optimal alpha-beta Trees with Capacity Constraint 1978 10 ACTAINF Culik, The Ultimate Equivalence Problem for D0L Systems 1978 10 ACTAINF Eichner, The Semigroups of Linearly Realizable Finite Automata. II 1978 10 ACTAINF Eichner, The Semigroups of Linearly Realizable Finite Automata. I 1978 10 ACTAINF Franck, A Class of Linearly Parsable Graph Grammars 1978 10 ACTAINF Guttag & Horning, The Algebraic Specification of Abstract Data Types 1978 10 ACTAINF Hehner, On Removing the Machine from the Language 1978 10 ACTAINF Howden, Algebraic Program Testing 1978 10 ACTAINF Laurinolli, Bounded Quantification and Relations Recognizable by Finite Automata 1978 10 ACTAINF Lewi & De Vlaminck & Huens & Huybrechts, The ELL(1) Parser Generator and the Error Recovery Mechanism 1978 10 ACTAINF Liu & Liu, Performance Analysis of Multiprocessor Systems Containing Functionally Dedicated Processors 1978 10 ACTAINF London & Guttag & Horning & Lampson & Mitchell & Popek, Proof Rules for the Programming Language Euclid 1978 10 ACTAINF Maxson, Linear Regular Sets 1978 10 ACTAINF Meersmann & Rozenberg, Two-Level Meta-Controlled Substitution Grammars 1978 10 ACTAINF Montangero & Pacini & Simi & Turini, Information Management in Context Trees 1978 10 ACTAINF Paul & Tarjan, Time-Space Trade-Offs in a Pebble Game 1978 10 ACTAINF Sabelfeld, Equivalence Transformations of Program Schemes 1978 10 ACTAINF Wallis, The Design of a Portable Programming Language 1978 10 ACTAINF Wotschke & Wrathall, A Note on Classes of Complements and the LBA Problem 1978 9 ACTAINF Avenhaus & Madlener, Subrecursive Complexities on Groups. II. Higman's Embedding Theorem for Decidable Groups 1978 9 ACTAINF Book, On the Complexity of Formal Grammars 1978 9 ACTAINF Coffman & Leung & Ting, Bin-Packing: Maximizing the Number of Pieces Packed 1978 9 ACTAINF Correll, Proving Programs Correct through Refinement 1978 9 ACTAINF Cremers & Hibbard, Functional Behavior in Data Spaces 1978 9 ACTAINF Cremers & Hibbard, Orthogonality of Information Structures 1978 9 ACTAINF Deussen, A Unified Approach to the Generation and the Acception of Formal Languages 1978 9 ACTAINF Francez & Pnueli, A Proof Method for Cyclic Programs 1978 9 ACTAINF Hansen & Boom, The Report on the Standard Hardware Representation for ALGOL 68 1978 9 ACTAINF Hoffmann, Design and Correctness of a Compiler for a Non-Procedural Language 1978 9 ACTAINF Hule & Maurer & Ottmann, Good 0L Forms 1978 9 ACTAINF Krzesinski & Teunissen, A Multiclass Network Model of a Demand Paging Computer System 1978 9 ACTAINF Pratt, Program Analysis and Optimization through Kernel-Control Decomposition 1978 9 ACTAINF Rosenberg, Data Encodings and Their Costs 1978 9 ACTAINF Stadel, The Time Complexity of the Normalization Problem of Context Sensitive Grammars 1978 9 ACTAINF Warren, Static Main Storage Packing Problems 1978 9 ACTAINF Yao, On Random 2-3 Trees 1977 9 ACTAINF Avenhaus & Madlener, Subrecursive Complexities on Groups. I. Groups of Given Complexity 1977 9 ACTAINF Bayer & Schkolnick, Concurrency of Operations on B-Trees 1977 9 ACTAINF Lee & Wong, Worst-Case Analysis for Region and Partial Region Searches in Multidimensional Binary Search Trees and Balanced Quad Trees 1977 9 ACTAINF Pager, Eliminating Unit Productions from LR Parsers 1977 9 ACTAINF Paredaens & Vyncke, A Class of Measures on Formal Languages 1977 9 ACTAINF Sokolowski, Axioms for Total Correctness 1977 8 ACTAINF Agerwala, Some Extended Semaphore Primitives 1977 8 ACTAINF Asveld & Engelfriet, Iterated Deterministic Substitution 1977 8 ACTAINF Conradi, Some Comments on ``Concurrent Readers and Writers'' 1977 8 ACTAINF Deussen & Mehlhorn, Van Wijngarden Grammars and Space Complexity Class EXSPACE 1977 8 ACTAINF Donahue, Locations Considered Unnecessary 1977 8 ACTAINF Ernst, Rules of Inference for Procedure Calls 1977 8 ACTAINF Eve & Kurki-Suonio, On Computing the Transitive Closure of a Relation 1977 8 ACTAINF Francez & Klebansky & Pnueli, Backtracking in Recursive Computations 1977 8 ACTAINF Igarashi, General Properties of Derivational Complexity 1977 8 ACTAINF Kameda & Gotlieb, A Feedback-Coupled Resource Allocation Policy for Multiprogrammed Computer Systems 1977 8 ACTAINF Kroeger, LAR: A Logic of Algorithmic Reasoning 1977 8 ACTAINF Luckham & Suzuki, Proof of Termination within a Weak Logic of Programs 1977 8 ACTAINF Majster, Extended Directed Graphs, a Formalism for Structured Data and Data Structures 1977 8 ACTAINF Maurer & Salomaa & Wood, E0L Forms 1977 8 ACTAINF Mitrani & Hine, Complete Parameterized Families of Job Scheduling Strategies 1977 8 ACTAINF Monien, Corrigenda. Transformational Methods and Their Application to Complexity Problems 1977 8 ACTAINF Monien, The LBA-Problem and the Deterministic Tape Complexity of Two-Way One-Counter Languages over a One-Letter Alphabet 1977 8 ACTAINF Munch-Andersen & Zahle, Scheduling According to Job Priority with Prevention of Deadlock and Permanent Blocking 1977 8 ACTAINF Parent & Potier, A Note on the Influence of Program Loading on the Page Fault Rate 1977 8 ACTAINF Ramsperger, Concurrent Access to Data 1977 8 ACTAINF Russell, On an Equivalence between Continuation and Stack Semantics 1977 8 ACTAINF Seiferas, Iterative Arrays with Direct Central Control 1977 8 ACTAINF Tennent, Language Design Methods Based on Semantic Principles 1977 8 ACTAINF Tennent, On a New Approach to Representation Independent Data Classes 1977 8 ACTAINF Watt, The Parsing Problem for Affix Grammars 1977 7 ACTAINF Kam & Ullman, Monotone Data Flow Analysis Frameworks 1977 7 ACTAINF Kern, Storage Optimal Formula Translation 1977 7 ACTAINF Kowaltowski, Axiomatic Approach to Side Effects and General Jumps 1977 7 ACTAINF Lauer & Campbell, Addenda and Corrigenda: Formal Semantics of a Class of High-Level Primitives for Coordinating Concurrent Processes 1977 7 ACTAINF MacVeigh, Effect of Data Representation on Cost of Sparse Matrix Operations 1977 7 ACTAINF Pager, A Practical General Method for Constructing LR(k) Parsers 1977 7 ACTAINF Perrot, Syntactic Monoids of Algebraic Languages 1977 7 ACTAINF Rosenberg & Stockmeyer, Storage Schemes for Boundedly Extendible Arrays 1977 7 ACTAINF Schoenhage, Fast Mutliplication of Polynomials over Fields of Characteristic 2 1977 7 ACTAINF Sedgewick, The Analysis of Quicksort Programs 1977 7 ACTAINF Shostak, On the Role of Unification in Mechanical Theorem Proving 1976 7 ACTAINF Buzen, Fundamental Operational Laws of Computer System Performance 1976 7 ACTAINF Denning & Kahn & Leroudier & Potier & Suri, Optimal Multiprogramming 1976 7 ACTAINF Gaver & Humfeld, Multitype Multiprogramming Models 1976 7 ACTAINF Gelenbe & Muntz, Probabilistic Models of Computer Systems--Part I (Exact Results) 1976 7 ACTAINF Gelenbe & Pujolle, The Behaviour of a Single Queue in a General Queueing Network 1976 7 ACTAINF Giammo, Validation of a Computer Performance Model of the Exponential Queuing Network Family 1976 7 ACTAINF Labetoulle & Pujolle, A Study of Queueing Networks with Deterministic Service and Application to Computer Networks 1976 7 ACTAINF Lamport, The Synchronization of Independent Processes 1976 7 ACTAINF Landwehr, An Endogenous Priority Model for Load Control in Combined Batch-Interactive Computer Systems 1976 7 ACTAINF Madsen & Kristensen, LR-Parsing of Extended Context Free Grammars 1976 7 ACTAINF Schnorr, The Network Complexity and the Turing Machine Complexity of Finite Functions 1976 7 ACTAINF Spirn, Multi-Queue Scheduling of Two Tasks 1976 7 ACTAINF Walter, Grammarforms and Grammarhomomorphisms 1976 7 ACTAINF Welch, On the Self Contained Modelling of DB/DC Systems 1976 7 ACTAINF Zuczek, A New Approach to Parallel Computing 1976 6 ACTAINF Anderson & Belz & Blum, SEMANOL (73) A Metalanguage for Programming the Semantics of Programming Languages 1976 6 ACTAINF Ashcroft & Clint & Hoare, Remarks on ``Program Proving: Jumps and Funcitons by M. Clint and C. A. R. Hoare'' 1976 6 ACTAINF Backhouse, An Alternative Approach to the Improvement of LR(k) Parsers 1976 6 ACTAINF Book & Chandra, Inherently Nonplanar Automata 1976 6 ACTAINF Brandwajn, A Model of a Virtual Memory System 1976 6 ACTAINF Coffman & Sethi, Algorithms Minimizing Mean Flow Time: Schedule-Length Properties 1976 6 ACTAINF Cohen & Roth, On the Implementation of Strassen's Fast Mutliplication Algorithm 1976 6 ACTAINF Courtois & Vantilborgh, A Decomposable Model of Program Paging Behavior 1976 6 ACTAINF Darlington & Burstall, A System which Automatically Improves Programs 1976 6 ACTAINF Dijkstra, On a Gauntlet Thrown by David Gries 1976 6 ACTAINF Ehrenfeucht & Rozenberg, On Proving that Certain Languages are not ET0L 1976 6 ACTAINF Ershov, Axiomatics for Memory Allocation 1976 6 ACTAINF Franta, The Mathematical Analysis of the Computer System Modeled as a Two Stage Cyclic Queue 1976 6 ACTAINF Galil, Hierarchies of Complete Problems 1976 6 ACTAINF Heise, Optimal Codes, n-Arcs and Laguerre Geometry 1976 6 ACTAINF Karr, Affine Relationship Among Variables of a Program 1976 6 ACTAINF Maurer & Wood, On Grammar Forms with Terminal Context 1976 6 ACTAINF Moenck, Another Polynomial Homomorphism 1976 6 ACTAINF Monien, Transformational Methods and their Application to Complexity Problems 1976 6 ACTAINF Neuhold & Weller, Specification and Proving of Command Programs 1976 6 ACTAINF Nutt, Some Resource Allocation Policies in a Multi Associative Processor 1976 6 ACTAINF Owicki & Gries, An Axiomatic Proof Technique for Parallel Programs I 1976 6 ACTAINF Schmid, On the Efficient Implementation of Conditional Critical Regions and the Construction of Monitors 1976 6 ACTAINF Schneider & Ehrig, Grammars on Partial Graphs 1976 6 ACTAINF Taniguchi & Kasami, An O(n) Algorithm for Computing the Set of Available Expressions of D-Charts 1976 6 ACTAINF Tarjan, Edge-Disjoint Spanning Trees and Depth-First Search 1976 6 ACTAINF Wharton, Resolution of Ambiguity in Parsing 1975 4 ACTAINF Ibarra & Kim, On 3-Head Versus 2-Head Finite Automata 1973 3 ACTAINF Habermann, Critical Comments on the Programming Language Pascal 1973 2 ACTAINF Savitch, A Note on Multihead Automata and Context-Sensitive Languages 1972 1 ACTAINF Hartmanis, On Non-Determinancy in Simple Computing Devices 1995 69 ACTAMHUNG Kindler, Minimax Theorems with One-Sided Randomization 1995 68 ACTAMHUNG Gecseg & Imreh, On Completeness of Nondeterministic Automata 1989 54 ACTAMHUNG Adam, On Simplicity-Critical Moore Automata. II 1988 52 ACTAMHUNG Thieu, A Finite Method for Globally Minimizing a Concave Function over an Unbounded Polyhedral Convex Set and Its Applications 1984 2 ADCM Diffie & Hellman, An Introduction to Cryptography 1988 ADM Brickell, The Cryptanalysis of Knapsack Cryptosystems 1988 ADM Coppersmith, Methods and Results in Cryptography 1988 ADM Erdos, Some Old and New Problems in Combinatorial Geometry 1988 ADM Trotter, Interval Graphs, Interval Orders, and Their Generalizations 1988 ADM Shier, Algebraic Aspects of Computing Network Reliability 1991 25 ADML Kuznetsov, Complexity of Learning and Classification Based on a Search for Set Intersection 1990 24 ADML Farber, The Problem of Minimal Admissible Flow in a Network 1989 23 ADML Smirnov, Adaptive Affix-based Text Compression Algorithm 1994 2 ADPP Ja'Ja' & Krishnamurthy, Parallel Algorithms for VLSI Layout 1994 1 ADPP Aguilar & Datta & Ghosh, Concurrent Reading and Writing and the Design of Atomic Registers 1994 1 ADPP Abonamah & Elmagarmid, A Survey of Deadlock Detection Algorithms in Distributed Database Systems 1997 18 ADVAM Barvinok & Fomin, Sparse Interpolation of Symmetric Polynomials 1997 18 ADVAM Beyer & Louck, Transfinite Function Iteration and Surreal Numbers 1997 18 ADVAM Xiong & Waterman, A Phase Transition for the Minimum Free Energy of Secondary Structures of a Random RNA 1997 18 ADVAM Louck, Conway Numbers and Iteration Theory 1997 18 ADVAM Traldi, Clutters and Circuits 1995 16 ADVAM Coquereaux, Triangular Dissections, Aperiodic Tilings, and Jones Algebras 1995 16 ADVAM Chamayou, Examples of Random Recurrences in Closed Form 1995 16 ADVAM Dress & Terhalle, Rewarding Maps: On Greedy Optimization of Set Functions 1995 16 ADVAM Tsujishita, On Triple Mutual Information 1995 16 ADVAM Rosenthal, On Generalizing the Cut-off Phenomenon for Random Walks on Groups 1994 15 ADVAM Golumbic & Kaplan & Shamir, On the Complexity of DNA Physical Mapping 1994 15 ADVAM Kuttler, On the 3x + 1 Problem 1993 14 ADVAM Chavez & Harper, Duality Theorems for a Continuous Analog of Ford-Fulkerson Flows in Networks 1993 14 ADVAM Berarducci & Intrigila, On the Cop Number of a Graph 1993 14 ADVAM Baryshnikov, Unifying Impossibility Theorems: A Topological Approach 1993 14 ADVAM Stein & Zemach, Symmetric Function Algebra on a Computer 1993 14 ADVAM Pevzner & Waterman, Generalized Sequence Alignment and Duality 1993 14 ADVAM Newberg & Naor, A Lower Bound on the Number of Solutions to the Probed Partial Digest Problem 1993 14 ADVAM Rubel, The Extended Analog Computer 1992 13 ADVAM Erdos & Szekely, Evolutionary Trees: An Integer Multicommodity Max-Flow-Min-Cut Theorem 1992 13 ADVAM Negro & Sereno, Ulam's Searching Game with Three Lies 1992 13 ADVAM Feig & Linzer, The Multiplicative Complexity of Discrete Cosine Transforms 1992 13 ADVAM Golomb, ``Periods'' of de Bruijn Sequences 1992 13 ADVAM Goldman & Homer, Doubly-Periodic Sequences and a Class of Two-Dimensional Cyclic Codes 1991 12 ADVAM Schmitt & Waterman, Multiple Solutions of DNA Restriction Mapping Problems 1991 12 ADVAM Bar-Hillel & Wagenaar, The Perception of Randomness 1991 12 ADVAM Mundici, Solution of Rota's Problem on the Order of Series-Parallel Networks 1991 12 ADVAM Huang & Miller, A Time-Efficient, Linear-Space Local Similarity Algorithm 1990 11 ADVAM Friedman & Flagg, A Framework for Measuring the Complexity of Mathematical Concepts 1989 10 ADVAM Ahlswede & Cai & Zhang, A General 4-Words Inequality with Consequences for 2-Way Communication Complexity 1989 10 ADVAM Golomb, Distributions of Periods and Frequencies of Runs in Random Binary Sequences 1989 10 ADVAM Venturini, On the 3x + 1 Problem 1988 9 ADVAM Mycielski & Swierczkowski, A Model of the Neocortex 1988 9 ADVAM Perlwitz & Burks & Waterman, Pattern Analysis of the Genetic code 1988 9 ADVAM Rubel, Some Mathematical Limitations of the General-Purpose Analog Computer 1988 9 ADVAM Goldstein, Mean Square Rates of Convergence in the Continuous Time Simulated Annealing Algorithm on R^d 1988 9 ADVAM Ko & Friedman, Computing Power Series in Polynomial time 1987 8 ADVAM Chaitin, Incompleteness Theorems for Random Reals 1987 8 ADVAM Goldstein & Waterman, Mapping DNA by Stochastic Relaxation 1987 8 ADVAM Mauldin & Ulam, Mathematical Problems and Games 1989 5 ADVCR Boppana & Hirschfeld, Pseudorandom Generators and Complexity Classes 1989 5 ADVCR Boppana & Hirschfeld, Pseudorandom Generators and Complexity Classes 1989 5 ADVCR Boppana, Amplification of Probabilistic Boolean Formulas 1989 5 ADVCR Miller & Reif, Parallel Tree Contraction Part 1: Fundamentals 1989 5 ADVCR Goldwasser & Sipser, Private Coins Versus Public Coins in Interactive Proof Systems 1989 5 ADVCR Ben Or & Linial, Collective Coin Flipping 1989 5 ADVCR Ajtai & Komlos & Steiger & Szemeredi, Almost Sorting in One Round 1989 5 ADVCR Shamir, Chromatic Numbers of Random Hypergraphs and Associated Graphs 1989 5 ADVCR Hastad, Almost Optimal Lower Bounds for Small Depth Circuits 1989 5 ADVCR Pippenger, Analysis of Error Correction by Majority Voting 1989 5 ADVCR Ajtai & Wigderson, Deterministic Simulation of Probabilistic Constant Depth Circuits 1989 5 ADVCR Gacs, Self-Correcting Two-Dimensional Arrays 1989 5 ADVCR Fortnow, The Complexity of Perfect Zero-Knowledge 1989 5 ADVCR Greenberg & Leiserson, Randomized Routing on Fat-Trees 1989 5 ADVCR Kaltofen, Factorization of Polynomials Given by Straight-Line Programs 1989 5 ADVCR Bentley & Leighton & Lepley & Stanat & Steele, A Randomized Data Structure for Ordered Sets 1989 5 ADVCR Furer & Goldreich & Mansour & Sipser & Zachos, On Completeness and Soundness in Interactive Proof Systems 1989 5 ADVCR Chor & Dwork, Randomization in Byzantine Agreement 1989 5 ADVCR Alon & Rabin, Biased Coins and Randomized Algorithms 1987 4 ADVCR Fich & Meyer auf der Heide & Wigderson, Lower Bounds for Parallel Random-Access Machines with Unbounded Shared Memory 1987 4 ADVCR Anderson & Mayr, Parallelism and Greedy Algorithms 1987 4 ADVCR Helmbold & Mayr, Fast Scheduling Algorithms on Parallel Computers 1987 4 ADVCR Awerbuch & Israeli & Shiloach, Finding Euler Circuits in Logarithmic Parallel Time 1987 4 ADVCR Vishkin, An Optimal Parallel Algorithm for Selection 1987 4 ADVCR Bilardi & Sarrafzadeh, Optimal VLSI Circuits for the Discrete Fourier Transform 1987 4 ADVCR Ja'Ja' & Owens, Optimal Algorithms for Mesh-Connected Parallel Processors with Serial Memories 1987 4 ADVCR Savage & Vitter, Parallelism in Space-Time Trade-Offs 1987 4 ADVCR Burns & Lynch, The Byzantine Firing Squad Problem 1987 4 ADVCR Loui & Abu-Amara, Memory Requirements for Agreement among Unreliable Asynchronous Processes 1993 101 ADVMATH Penner & Waterman, Spaces of RNA Secondary Structures 1993 101 ADVMATH Waterman, Mobius Transformations in Several Dimensions 1992 96 ADVMATH Alon & Kleitman, Piercing Convex Sets and the Hadwiger-Debrunner (p,q)-Problem 1992 91 ADVMATH Dress & Wenzel, Perfect Matroids 1990 83 ADVMATH Billera & Filliman & Sturmfels, Constructions and Complexity of Secondary Polytopes 1987 65 ADVMATH Compton, A Logical Approach to Asymptotic Combinatorics. I. First Order Properties 1987 63 ADVMATH Alon, Splitting Necklaces 1978 27 ADVMATH Dieudonne, Present Trends in Pure Mathematics 1972 9 ADVMATH Harper & Savage, On the Complexity of the Marriage Problem 1997 ADWES Sudkamp, Languages and Machines: An Introduction to the Theory of Computer Science, Second Edition 1996 ADWES Sebesta, Concepts of Programming Languages, Third Edition 1996 ADWES Feiler & Meadow, Essential OpenDoc: Cross-Platform Development for OS/2, Macintosh, and Windows Programmers 1996 ADWES Finkel, Advanced Programming Language Design 1996 ADWES Hanly & Koffman, Problem Solving and Program Design in C, Second Edition 1996 ADWES Sethi, Programming Languages: Concepts and Constructs, Second Edition 1996 ADWES Weiss, Algorithms, Data Structures, and Problem Solving with C++ 1996 ADWES Sedgewick & Flajolet, An Introduction to the Analysis of Algorithms 1996 ADWES Barnes, Programming in Ada 95 1996 ADWES Savitch, Problem Solving with C++: The Object of Programming 1995 ADWES Schumacher, Chapter Zero: Fundamental Notions of Abstract Mathematics 1995 ADWES Wilhelm & Maurer, Compiler Design 1995 ADWES Nadel & Stein (Eds.), 1993 Lectures in Complex Systems 1995 ADWES Wolpert (Ed.), The Mathematics of Generalization: The Proceedings of the SFI/CNLS Workshop on Formal Approaches to Supervised Learning, Proceedings Volume XX, Santa Fe Institute Studies in the Sciences of Complexity 1995 ADWES Standish, Data Structures, Algorithms, and Software Principles in C 1995 ADWES Foster, Designing and Building Parallel Programs: Concepts and Tools for Parallel Software Engineering 1995 ADWES Pfaffenberger, The USENET Book: Finding, Using, and Surviving Newsgroups on the Internet 1994 ADWES Skansholm, Ada from the Beginning 1994 ADWES Strogatz, Nonlinear Dynamics and Chaos, With Applications to Physics, Biology, Chemistry, and Engineering 1994 ADWES Wolfram, Cellular Automata and Complexity: Collected Papers 1994 ADWES Scheurer, Foundations of Computing: System Development with Set Theory and Logic 1994 ADWES Winston, On to C 1994 ADWES Stroustrup, The Design and Evolution of C++ 1994 ADWES Winston, On To C++ 1994 ADWES Papadimitriou, Computational Complexity 1993 ADWES Feibelman, A Ph.D. Is Not Enough: A Guide to Survival in Science 1993 ADWES Manna & Waldinger, The Deductive Foundations of Computer Programming: A One-Volume Version of ``The Logical Basis for Computer Programming'' 1993 ADWES Davis, C++ Programmer's Companion: Designing, Testing, and Debugging 1993 ADWES Burns & Davies, Concurrent Programming 1993 ADWES Nadel & Stein (Eds.), 1992 Lectures in Complex Systems; Lecture Volume V, Santa Fe Institute Studies in the Sciences of Complexity 1993 ADWES Andreasson & Skansholm, Getting Started with UNIX and X 1993 ADWES Lynch & Rose (Eds.), Internet System Handbook 1992 ADWES Cargill, C++ Programming Style 1992 ADWES Wirth & Gutknecht, Project Oberon: The Design of an Operating System and Compiler 1992 ADWES Coplien, Advanced C++ Programming Styles and Idioms 1992 ADWES Wuensche & Lesser, The Global Dynamics of Cellular Automata: An Atlas of Basin of Attraction Fields of One-Dimensional Cellular Automata 1992 ADWES Francez, Program Verification 1992 ADWES Abrahams & Larson, UNIX for the Impatient 1992 ADWES Ja'Ja', An Introduction to Parallel Algorithms 1992 ADWES Devaney, A First Course in Chaotic Dynamical Systems: Theory and Experiment 1992 ADWES Sedgewick, Algorithms in C++ 1992 ADWES Schoonover & Bowie & Arnold, GNU Emacs: UNIX Text Editing and Programming 1992 ADWES Winston, Artificial Intelligence, Third Edition 1992 ADWES Harel, Algorithmics: The Spirit of Computing, Second Edition 1991 ADWES Lippman, C++ Primer, 2nd Edition 1991 ADWES Budd, An Introduction to Object-Oriented Programming 1991 ADWES Cox & Novobilski, Object-Oriented Programming: An Evolutionary Approach, Second Edition 1991 ADWES Freeman & Skapura, Neural Networks: Algorithms, Applications, and Programming Techniques 1991 ADWES Gonnet & Baeza-Yates, Handbook of Algorithms and Data Structures, In Pascal and C, Second Edition 1991 ADWES Banachowski & Kreczmar & Rytter, Analysis of Algorithms and Data Structures 1991 ADWES Hertz & Krogh & Palmer, Introduction to the Theory of Neural Computation 1990 ADWES Devaney, Chaos, Fractals, and Dynamics: Computer Experiments in Mathematics 1990 ADWES Ellis & Stroustrup, The Annotated C++ Reference Manual 1990 ADWES Skiena, Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica 1990 ADWES Samet, Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS 1990 ADWES Samet, The Design and Analysis of Spatial Data Structures 1990 ADWES Buckley & Harary, Distance in Graphs 1990 ADWES Sedgewick, Algorithms in C 1989 ADWES Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning 1989 ADWES Grimaldi, Discrete and Combinatorial Mathematics: An Applied Introduction 1989 ADWES Mead, Analog VLSI and Neural Systems 1989 ADWES Mullender (Ed.), Distributed Systems 1989 ADWES Needham, Using Cryptography for Authentication (in Mullender) 1989 ADWES Graham & Knuth & Patashnik, Concrete Mathematics 1989 ADWES Manber, Introduction to Algorithms: A Creative Approach 1988 ADWES Aho & Kernighan & Weinberger, The AWK Programming Language 1988 ADWES Niguidula & van Dam, Pascal on the Macintosh: A Graphical Approach 1988 ADWES Rubinstein, Digital Typography: An Introduction to Type and Compositioin for Computer System Design 1988 ADWES Coulouris & Dollimore, Distributed Systems: Concepts and Design 1988 ADWES Van Wyk, Data Structures and C Programs 1988 ADWES Muldner & Steele, C as a Second Language: For Native Speakers of Pascal 1988 ADWES Wolfram, Mathematica: A System for Doing Mathematics by Computer 1988 ADWES Sommerhalder & van Westrhenen, The Theory of Computability: Programs, Machines, Effectiveness and Feasibility 1988 ADWES Baase, Computer Algorithms: Introduction to Design and Analysis, Second Edition 1987 ADWES Harel, Algorithmics: The Spirit of Computing 1983 ADWES Lothaire, Combinatorics on Words 1983 ADWES Traub & Wasilkowski & Wozniakowski, Information, Uncertainty, Complexity 1982 ADWES Kernighan & Plauger, Software Tools in PASCAL 1988 AEMC Alon, Some Recent Combinatorial Applications of Borsuk-Type Theorems 1988 AEMC Frankl, Intersection and Containment Problems without Size Restrictions 1988 AEMC Lam & Thiel & Swiercz, A Computer Search for a Projective Plane of Order 10 1988 AEMC Lindstrom, Matroids, Algebraic and Non Algebraic 1987 9 AES Correc & Chapuis, Fast Computation of Delaunay Triangulations 1991 AFLPS Berkling, Arrays and the Lambda Calculus 1991 AFLPS Jenkins & Mullin, A Comparison of Array Theory and A Mathematics of Arrays 1991 AFLPS Gains, Matrix Inversion in 3 Dimensions 1987 1 AGAROBOTICS Hopcroft & Krafft, The Challenge of Robotics for Computer Science 1987 1 AGAROBOTICS Dobkin & Souvaine, Computational Geometry--A User's Guide 1987 1 AGAROBOTICS Yap, Algorithmic Motion Planning 1987 1 AGAROBOTICS Chazelle, Approximation and Decomposition of Shapes 1987 1 AGAROBOTICS Leven & Sharir, Intersection and Proximity Problems and Voronoi Diagrams 1987 1 AGAROBOTICS Markowsky & Wesley, Fleshing Out Wire Frames: Reconstruction of Objects, Part I 1987 1 AGAROBOTICS Wesley & Markowsky, Fleshing Out Projections: Reconstruction of Objects, Part II 1994 4 AII Barzdins, Towards Efficient Inductive Synthesis from Input/Output Examples 1994 4 AII Dershowitz, From Specifications to Programs: Induction in the Service of Synthesis 1994 4 AII Zeugmann, Average Case Analysis of Pattern Language Learning Algorithms 1994 4 AII Ambainis & Smotrovs, Enumerable Classes of Total Recursive Functions: Complexity of Inductive Inference 1994 4 AII Baliga & Case, Learning with Higher Order Additional Information 1994 4 AII Brazma & Cerans, Efficient Learning of Regular Expressions from Good Examples 1994 4 AII Freivalds & Botuscharov & Wiehagen, Identifying Nearly Minimal Godel Numbers from Additional Information 1994 4 AII Freivalds & Gobleja & Karpinski & Smith, Co-Learnability and FIN-Identifiability of Enumerable Classes of Total Recursive Functions 1994 4 AII Mofizur & Numao, Constructive Induction for Recursive Programs 1994 4 AII Tu & Smith, Training Digraphs 1992 AII Case & Rajan & Shende, Representing the Spatial / Kinematic Domain and Lattice Computers 1992 AII Chen & Maass, A Solution of the Credit Assignment Problem in the Case of Learning Rectangles 1992 AII Wiehagen & Zeugmann, Too Much Information Can be Too Much for Learning Efficiently 1992 AII Apsitis & Freivalds & Krikis & Simanovskis & Smotrovs, Unions of Identifiable Classes of Total Recursive Functions 1992 AII Baliga & Jain & Sharma, Learning from Multiple Sources of Inaccurate Data 1992 AII Case & Chen & Jain, Strong Separation of Learning Classes 1992 AII Daley & Kalyanasundaram & Velauthapillai, The Power of Probabilism in Popperian FINite Learning 1992 AII Freivalds & Hoffmann, An Inductive Inference Approach to Classification 1992 AII Gasarch & Velauthapillai, Asking Questions Versus Verifiability 1992 AII Kinber, Learning a Class of Regular Expressions via Restricted Subset Queries 1992 AII Mukouchi, Characterization of Finite Identification 1992 AII Takada & Siromoney, On Identifying DNA Splicing Systems from Examples 1989 AII Freivalds & Kinber & Wiehagen, Inductive Inference from Good Examples 1989 AII Pitt, Inductive Inference, DFAs, and Computational Complexity 1989 AII Kodratoff & Franova & Partridge, Why and How Program Synthesis? 1989 AII Bruynooghe & De Schreye, Some Thoughts on the Role of Examples in Program Transformation and its Relevance for Explanation-based Learning 1989 AII Warmuth, Towards Representation Independence in PAC Learning 1989 AII Yokomori, Learning Context-free Languages Efficiently 1989 AII Gasarch & Sitaraman & Smith & Velauthapillai, Learning Programs With an Easy to Calculate Set of Errors 1989 AII Freivalds & Viksna, Inductive Inference up to Immune Sets 1989 AII Kinber & Zeugmann, Refined Query Inference 1989 AII Maler & Pnueli, Learning omega-Regular Languages from Queries and Counter-Examples 1989 AII Kurtz & Smith, A Refutation of Barzdins' Conjecture 1989 AII Greitane, Probabilistic Inductive Inference of Indices in Enumerable Classes of Total Recursive Functions 1989 AII Thomas & Jantke, Inductive Inference for Solving Divergence in Knuth-Bendix Completion 1989 AII Lange, Towards a Set of Inference Rules for Solving Divergence in Knuth-Bendix Completion 1989 AII Chuzhanova, Inductive Synthesis of Programs for Symbolic Sequences Processing 1989 AII Barzdins, Inductive Synthesis of Encoding for Algebraic Abstract Data Types 1986 AII Daley, Towards the Development of an Analysis of Learning Algorithms 1986 AII Bauche, Using the Algorithm of Analogy for Generation of Robot Programs 1986 AII Gasarch & Smith, On the Inference of Sequences of Functions 1986 AII Gergely & Szabo, Fixed Point Equations as Hypotheses in Inductive Reasoning 1986 AII Grabowski, Inductive Inference of Functions from Noised Observations 1986 AII Haraguchi & Arikawa, Reasoning by Analogy as a Partial Identity between Models 1986 AII Juhos, Can Missing Information be also Useful? 1986 AII Lange, A Decidability Problem of Church-Rosser Specifications for Program Synthesis 1986 AII Melis & Melis, Some Considerations about Formalization of Analogical Reasoning 1986 AII Potschke, Analogical Reasoning Using Graph Transformations 1986 AII Selbig, Knowledge Acquisition by Inductive Learning from Examples 1986 AII Smith & Velauthapillai, On the Inference of Programs Approximately Computing the Desired Function 1986 AII Szabo, Stratefied Inductive Hypothesis Generation 1986 AII Thiele, A Model Theoretic Oriented Approach to Analogy 1986 AII Wiehagen, On the Complexity of Effective Program Synthesis 1986 AII Zeugmann, On Barzdin's Conjecture 1996 88 AIJ Cadoli & Donini & Schaerf, Is Intractability of Nonmonotonic Reasoning a Real Drawback? 1996 87 AIJ Ephrati & Rosenschein, Deriving Consensus in Multiagent Systems 1996 87 AIJ Bacchus & Grove & Halpern & Koller, From Statistical Knowledge Bases to Degrees of Belief 1996 86 AIJ Balcazar, The Complexity of Searching Implicit Graphs 1996 84 AIJ Ben-Eliyahu & Dechter, Default Reasoning Using Classical Logic 1996 82 AIJ Roth, On the Hardness of Approximate Reasoning 1996 82 AIJ Borgida, On the Relative Expressiveness of Description Logics and Predicate Logics 1996 81 AIJ Hogg & Huberman & Williams, Phase Transitions and the Searhc Problem (Editorial) 1996 81 AIJ Selman & Mitchell & Levesque, Generating Hard Satisfiability Problems 1996 81 AIJ Crawford & Auton, Experimental Results on the Crossover Point in Random 3-SAT 1996 81 AIJ Gent & Walsh, The Satisfiability Constraint Gap 1996 81 AIJ Prosser, An Empirical Study of Phase Transitions in Binary Constraint Satisfaction Problems 1996 81 AIJ Mitchell & Levesque, Some Pitfalls for Experimenters with Random SAT 1996 81 AIJ Hogg, Refining the Phase Transition in Combinatorial Search 1996 81 AIJ Smith & Dyer, Locating the Phase Transition in Binary Constraint Satisfaction Problems 1996 81 AIJ Freeman, Hard Random 3-SAT Problems and the Davis-Putnam Procedure 1996 81 AIJ Schrag & Crawford, Implicates and Prime Implicates in Random 3-SAT 1996 81 AIJ Zhang & Korf, A Study of Complexity Transitions on the Asymmetric Traveling Salesman Problem 1996 81 AIJ Bylander, A Probabilistic Analysis of Propositional STRIPS Planning 1996 81 AIJ Selman & Kirkpatrick, Critical Behavior in the Computational Cost of Satisfiability Testing 1996 81 AIJ Pemberton & Zhang, Epsilon-Transformation: Exploiting Phase Transitions to Solve Combinatorial Optimization Problems 1996 81 AIJ Clearwater & Hogg, Problem Structure Heuristics and Scaling Behavior for Genetic Algorithms 1995 79 AIJ Fagin & Halpern & Vardi, A Nonstandard Approach to the Logical Omniscience Problem 1995 79 AIJ Cohen, Pac-Learning Non-recursive Prolog Clauses 1995 77 AIJ Simon, Artificial Intelligence: An Empirical Science 1995 77 AIJ Dasgupta & Chakrabarti & DeSarkar, A Correction to ``Agent Searching in a Tree and the Optimality of Iterative Deepening'' 1995 75 AIJ Halpern, The Effect of Bounding the Number of Primitive Propositions and the Depth of Nesting on the Complexity of Modal Logic 1995 74 AIJ Halpern & Lakemeyer, Levesque's Axiomatization of Only Knowing is Incomplete 1994 69 AIJ Satta & Stock, Bidirectional Context-free Grammar Parsing for Natural Language Processing 1994 69 AIJ Bylander, The Computational Complexity of Propositional STRIPS Planning 1994 69 AIJ Lee & Plaisted, Problem Solving by Searching for Models with a Theorem Prover 1994 69 AIJ Almuallim & Dietterich, Learning Boolean Concepts in the Presence of Many Irrelevant Features 1994 69 AIJ Gottlob & Mingyi, Cumulative Default Logic: Finite Characterization, Algorithms, and Complexity 1994 69 AIJ Papadimitriou & Sideri, Default Theories that Always Have Extensions 1994 68 AIJ Shimony, Finding MAPs for Belief Networks is NP-Hard 1994 66 AIJ Nebel & Backstrom, On the Computational Complexity of Temporal Projection, Planning, and Plan Validation 1993 64 AIJ Mutchler, The Multi-Player Version of Minimax Displays Game-Tree Pathology 1993 60 AIJ Dagum & Luby, Approximating Probabilistic Inference in Bayesian Belief Networks is NP-Hard 1993 59 AIJ Bobrow, Artificial Intelligence in Perspective: A Retrospective on Fifty Volumes of the Artificial Intelligence Journal 1992 56 AIJ Gupta & Nau, On the Complexity of Blocks-World Planning 1992 56 AIJ Sloman, The Emperor's Real Mind: Review of Roger Penrose's The Emperor's New Mind: Concerning Computers, Minds and the Laws of Physics 1992 55 AIJ Nie & Plaisted, A Semantic Backward Chaining Proof System 1992 54 AIJ Halpern & Moses, A Guide to Completeness and Complexity for Modal Logics of Knowledge and Belief 1992 53 AIJ Simari & Loui, A Mathematical Treatment of Defeasible Reasoning and its Implementation 1991 52 AIJ Smoliar, Gerald M. Edelman, (review) The Remembered Present: A Biological Theory of Consciousness (Basic Books, 1989) 1991 49 AIJ Bylander & Allemang & Tanner & Josephson, The Computational Complexity of Abduction 1991 49 AIJ Kautz & Selman, Hard Problems for Simple Default Logics 1991 48 AIJ Dyer, A Society of Ideas on Cognition: Review of Marvin Minsky's The Society of Mind (1986) 1991 48 AIJ Ginsberg, Book Review of The Society of Mind (Minsky, 1986) 1991 48 AIJ Reeke, Book Review of The Society of Mind (Minsky, 1986) 1991 48 AIJ Smoliar, Book Review of The Society of Mind (Minsky, 1986) 1991 48 AIJ Minsky, Society of Mind: A Response to Four Reviews 1991 48 AIJ Ballard, Animate Vision 1991 48 AIJ Korf, Multi-Player Alpha-Beta Pruning 1991 47 AIJ Kirsh, Foundations of AI: The Big Issues 1991 47 AIJ Nilsson, Logic and Artificial Intelligence 1991 47 AIJ Birnbaum, rigor Mortis: A Response to Nilsson's ``Logic and Artificial Intelligence'' 1991 47 AIJ Brooks, Intelligence without Representation 1991 47 AIJ Lenat & Feigenbaum, On the Thresholds of Knowledge 1991 47 AIJ Smith, The Owl and the Electric Encyclopedia 1991 47 AIJ Norman, Approaches to the Study of Intelligence 1990 46 AIJ Halpern, An Analysis of First-Order Logics of Probability 1990 44 AIJ Orponen, Dempster's Rule of Combination is #P-Complete 1990 42 AIJ Galton, A Critical Examination of Allen's Theory of Action and Time 1989 39 AIJ Perlis, Truth and Meaning 1989 38 AIJ Pastre & Muscadet, An Automatic Theorem Proving System Using Knowledge and Metaknowledge in Mathematics 1988 37 AIJ Kapur & Mundy, Geometric Reasoning and Artificial Intelligence: Introduction to the Special Volume 1988 37 AIJ Kapur & Mundy, Wu's Method and Its Application to Perspective Viewing 1988 37 AIJ Arnon, Geometric Reasoning with Logic and Algebra 1988 37 AIJ Kapur, A Refutational Approach to Geometry Theorem Proving 1988 37 AIJ Ko, Geometry Theorem Proving by Decomposition of Quasi-Algebraic Sets: An Application of the Ritt-Wu Principle 1988 37 AIJ Goguen, Modular Algebraic Specification of Some Basic Geometrical Constructions 1988 37 AIJ Schwartz & Sharir, A Survey of Motion Planning and Related Geometric Algorithms 1988 37 AIJ Mitchell, An Algorithmic Approach to Some Problems in Terrain Navigation 1988 37 AIJ Canny, Constructing Roadmaps of Semi-Algebraic Sets I: Completeness 1988 37 AIJ Donald, A Geometric Approach to Error Detection and Recovery for Robot Motion Planning with Uncertainty 1988 37 AIJ Walker & Herman, Geometric Reasoning for Constructing 3D Scene Descriptions from Images 1988 37 AIJ Barry & Cyrluk & Kapur & Mundy & Nguyen, A Multi-Level Geometric Reasoning System for Vision 1988 37 AIJ Horaud & Brady, On the Geometric Interpretation of Image Contours 1988 37 AIJ Hoffmann & Hopcroft, The Geometry of Projective Blending Surfaces 1988 37 AIJ Milenkovic, Verifiable Implementations of Geometric Algorithms Using Finite Precision Arithmetic 1988 37 AIJ Fleming, Geometric Relationships between Toleranced Features 1987 34 AIJ Dechter & Pearl, Network-based Heuristics for Constraint-Satisfaction Problems 1987 34 AIJ Fagin & Halpern, Belief, Awareness, and Limited Reasoning 1987 34 AIJ Rivest, Game Tree Searching by Min/Max Approximation 1994 15 AIMAG Hayes & Ford & Agnew, On Babies and Bathwater: A Cautionary Tale 1987 8 AIMAG Schank, What Is AI, Anyway? 1991 AIMTC Israel, A Short Sketch of the Life and Career of John McCarthy 1991 AIMTC Boyer & Goldschlag & Kaufmann & Moore, Functional Instantiation in First-Order Logic 1991 AIMTC Cartwright, Lambda: The Ultimate Combinator 1991 AIMTC Feferman, Proofs of Termination and the ``91'' Function 1991 AIMTC Feldman, Robots with Common Sense? 1991 AIMTC Filman, Ascribing Artificial Intelligence to (Simpler) Machines, or When AI Meets the Real World 1991 AIMTC Gabriel, The Design of Parallel Programming Languages 1991 AIMTC Goad, Metaprogramming at Work in Automated Manufacturing 1991 AIMTC Gosper, LISP + Calculus = Identities 1991 AIMTC Halpern & Vardi, Model Checking vs. Theorem Proving: A Manifesto 1991 AIMTC Hearn, Algebraic Computation: The Quiet Revolution 1991 AIMTC Ito, LISP and Parallelism 1991 AIMTC Knuth, Textbook Examples of Recursion 1991 AIMTC Kowalski & Kim, A Metalogic Programming Approach to Multi-Agent Knowledge and Belief 1991 AIMTC Levesque, Belief and Introspection 1991 AIMTC Manna & Stickel & Waldinger, Monotonicity Properties in Automated Deduction 1991 AIMTC Minker & Lobo & Rajasekar, Circumscription and Disjunctive Logic Programming 1991 AIMTC Mitchell, On the Equivalence of Data Representations 1991 AIMTC Moravec, Caution! Robot Vehicle! 1991 AIMTC Rathmann & Wiederhold, Circumscription and Authority 1991 AIMTC Reiter, The Frame Problem in the Situation Calculus: A Simple Solution (Sometimes) and a Completeness Result for Goal Regression 1991 AIMTC Sato, An Abstraction Mechanism for Symbolic Expressions 1991 AIMTC Shoham, Varieties of Context 1991 AIMTC Stoyan, The Influence of the Designer on the Design -- J. McCarthy and LISP 1991 AIMTC Talcott, Binding Structures 1991 AIMTC Thomason, Logicism, AI, and Common Sense: John McCarthy's Program in Philosophical Perspective 1991 AIMTC Weyhrauch, The Incorrectness of the Bisection Algorithm 1994 AIPPRESS Information, Entropy, and Progress: A New Evolutionary Paradigm 1996 3 AISMC Scott, Symbolic Computation and Teaching 1996 3 AISMC Cohn, Calculi for Qualitative Spatial Reasoning 1996 3 AISMC Rodosek, A New Approach on Solving 3-Satisfiability 1996 3 AISMC Wang, Geometry Machines: From Artificial Intelligence to Symbolic Mathematical Computation 1996 3 AISMC Ueberberg, Interactive Theorem Proving and Finite Projective Planes 1994 2 AISMC Rege & Canny, A Practical Algorithm for Geometric Theorem Proving 1992 1 AISMC Calmet & Campbell, Artificial Intelligence and Symbolic Mathematical Computations 1992 1 AISMC Sellen, On the Topological Structure of Configuration Spaces 1992 1 AISMC Pfalzgraf, On Mathematical Modeling in Robotics 1992 1 AISMC Monfroy, Grobner Bases: Strategies and Applications 1992 1 AISMC Hahnle, A New Translation from Deduction into Integer Programming 1992 1 AISMC Golumbic, Reasoning About Time 1995 1 AIZU Lengauer & Griebl, On the Parallelization of Loop Nests Containing while Loops 1995 1 AIZU Hsu & Grammatikakis & Kraetzl, A Journey into Multicomputer Routing Algorithms 1995 1 AIZU Varshavsky & Marakhovsky & Chu, Logical Timing (Global Synchronization of Asynchronous Arrays) 1995 1 AIZU Gu & Peng, Fault Tolerant Routing in Toroidal Networks 1995 1 AIZU Chen & He, Parallel Algorithms for Maximal Acyclic Sets 1995 1 AIZU Hu & Yang, Fault Tolerance on Star Graphs 1995 1 AIZU Chern & Tuan & Jwo, Hamiltonicity, Vertex Symmetry, and Broadcasting of Uni-Directional Hypercubes 1995 1 AIZU Heywood & Leopold, Dynamic Randomized Simulation of Hierarchical PRAMs on Meshes 1995 1 AIZU Sarnath, Efficient Scalable Mesh Algorithms for Merging, Sorting and Selection 1997 15 AJC McKay, Small Graphs are Reconstructible 1996 13 AJC Dawson & Donovan & Offer, Quasigroups, Isotopisms and Authentication Schemes 1996 13 AJC Ramsay & Roberts, Minimal Completely Separating Systems of Sets 1996 13 AJC Koukouvinos & Mitrouli & Seberry & Karabelas, On Sufficient Conditions for some Orthogonal Designs and Sequences with Zero Autocorrelation Function 1996 13 AJC Hoffman & Johnson & Wantland, Thwart Numbers of some Bipartite Graphs 1995 12 AJC Hattingh & Henning & Slater, The Algorithmic Complexity of Signed Domination in Graphs 1995 12 AJC Galvin, Single-Machine Scheduling to Minimize Absolute Lateness for a Specified Number of Tardy Jobs 1994 10 AJC Koukouvinos & Kounias & Seberry & Yang & Yang, Multiplication of Sequences with Zero Autocorrelation 1994 10 AJC Ananchuen & Caccetta, On Constructing Graphs with a Prescribed Adjacency Property 1994 10 AJC El Maftouhi & Gordones, The Maximum Order of a Strong Matching in a Random Graph 1994 10 AJC Gustafson & Pettitt & Dawson & O'Connor, Linear Dependencies in Product Ciphers 1994 10 AJC Seberry & Zhang & Zheng, Cryptographic Boolean Functions via Group Hadamard Matrices 1994 10 AJC Gutin, Polynomial Algorithms for Finding Paths and Cycles in Quasi-transitive Digraphs 1994 9 AJC Donovan, Some Interesting Constructions for Secret Sharing Schemes 1993 8 AJC Achuthan & Caccetta, Addendum to: Minimum Weight Spanning Trees with Bounded Diameter 1993 7 AJC Hoffman, Linear Codes and Weights 1993 7 AJC Hattingh & Henning & Walters, On the Computational Complexity of Upper Distance Fractional Domination 1993 7 AJC Lynch, Convergence Laws for Random Words 1993 7 AJC O'Keefe, Applications of Finite Geometries to Information Security 1991 4 AJC Clark & Entringer & McCanna & Szekely, Extremal Problems for Local Properties of Graphs 1991 4 AJC Forbes & Holt & Kilby & Watts, A Matching Algorithm with Application to Bus Operations 1991 4 AJC Abello & Fellows & Stillwell, On the Complexity and Combinatorics of Covering Finite Complexes 1990 2 AJC Sved & Clarke, King's Walk on the Infinite Chessboard 1990 2 AJC Tamassia, Drawing Algorithms for Planar st-Graphs 1990 2 AJC Wallis, Not All Perfect Extrinsic Secret Sharing Schemes are Ideal 1990 1 AJC Chen & Stinson, Recent Results on Combinatorial Constructions for Threshold Schemes 1990 1 AJC Wang,New Results on the Costs of Huffman Trees 1994 7 AJCAI Webb, Generality is More Significant than Complexity: Toward an Alternative to Occam's Razor 1981 49 AJPHYSICS Mermin, Bringing Home the Atomic World: Quantum Mysteries for Anybody 1992 2 ALCOM Devillers & Teillaud & Yvinec, Dynamic Location in an Arrangement of Line Segments in the Plane 1992 2 ALCOM Fraysseix & Kuntz, Pagination of Large-scale Networks 1992 2 ALCOM Balcazar & Lozano & Toran, The Complexity of Algorithmic Problems on Succinct Instances 1992 2 ALCOM Schmidt, Counting and Generating Circular Sequences of Finite Planar Point Sets 1991 2 ALCOM Bakker & van Leeuwen & Tan, Linear Interval Routing 1991 2 ALCOM Schobel, A New Parsing Strategy for Context-free Grammars 1991 2 ALCOM Smid, Range Trees with Slack Parameter 1991 2 ALCOM Bruschi & Joseph & Young, A Structural Overview of NP Optimization Problems 1991 2 ALCOM Snoeyink, The Number of Views of Axis-Parallel Objects 1991 2 ALCOM Smid, Maintaining the Minimal Distance of a Point Set in Less than Linear Time 1990 1 ALCOM Ericson & O Dunlaing, Enumeration of Tree Properties by Naive Methods 1990 1 ALCOM Vegter, Kink-free Deformation of Polygons 1990 1 ALCOM Jones & O'Rourke, A Note on Moving a Chair through a Doorway 1990 1 ALCOM Alt & Yap, Algorithmic Aspects of Motion Planning: A Tutorial, Part 2 1990 1 ALCOM de Berg & Overmars & van Kreveld, Finding Complete Bipartite Subgraphs in Bipartite Graphs 1990 1 ALCOM Csirik & Frenk, A Dual Version of Bin Packing 1990 1 ALCOM Veldhorst, A Bibliography on Network Flow Problems 1990 1 ALCOM Smid, A Data Structure for the Union-Find Problem Having Good Single-Operation Complexity 1990 1 ALCOM Tel, Total Algorithms 1990 1 ALCOM Alt & Yap, Algorithmic Aspects of Motion Planning: A Tutorial, Part 1 1995 34 ALGLOGIC Peryazev, Complexity of Boolean Functions in the Class of Polarized Polynomial Forms 1995 33 ALGLOGIC Ventsov, Constructive Models of Regularly Infinite Algorithmic Dimension 1995 33 ALGLOGIC Kummer & Wehner & Yi, Discrete Families of Recursive Functions and Index Sets 1994 32 ALGLOGIC Ganova, Generalized Computations with Binary Oracles 1994 32 ALGLOGIC Mardaev, Least Fixed Points in Grzegorczyk's Logic and in the Intuitionistic Propositional Logic 1994 32 ALGLOGIC Ashaev & Belyaev & Myasnikov, Toward a Generalized Computability Theory 1991 29 ALGLOGIC Gamova, Effective Oracles 1991 29 ALGLOGIC Ershov, Forcing in Admissible Sets 1991 29 ALGLOGIC Belyakin, Effective Hierarchies 1988 27 ALGLOGIC Gamova, Generalized Computations with Oracles 1987 26 ALGLOGIC Andreev, A Method for Obtaining Efficient Lower Bounds for Monotone Complexity 1997 23 ALGORITHMS Ramachandran, Parallel Algorithms for Reducible Flow Graphs 1997 23 ALGORITHMS Kranakis & Krizanc, Distributed Computing on Anonymous Hypercube Networks 1997 23 ALGORITHMS Goodrich & Tamassia, Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations 1997 23 ALGORITHMS Czumaj & Gasieniec & Piotrow & Rytter, Sequential and Parallel Approximation of Shortest Superstrings 1997 23 ALGORITHMS Ben Aroya & Newman & Schuster, Randomized Single-Target Hot-Potato Routing 1997 23 ALGORITHMS Weihe, Edge-Disjoint (s,t)-Paths in Undirected Planar Graphs in Linear Time 1997 23 ALGORITHMS Thorup, Parallel Shortcutting of Rooted Trees 1997 23 ALGORITHMS Thurimella, Sub-linear Distributed Algorithms for Sparse Certificates and Biconnected Components 1997 23 ALGORITHMS Garay & Gopal & Kutten & Mansour & Yung, Efficient On-Line Call Control Algorithms 1997 23 ALGORITHMS Pittel & Weishaar, On-Line Coloring of Sparse Random Graphs and Random Trees 1997 22 ALGORITHMS Berman & Diks & Pelc, Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures 1997 22 ALGORITHMS Fernandez-Baca & Slutzki, Optimal Parametric Search on Graphs of Bounded Tree-Width 1997 22 ALGORITHMS Klein & Plotkin & Rao & Tardos, Approximation Algorithms for Steiner and Directed Multicuts 1997 22 ALGORITHMS de la Torre & Kao, A Uniform Approach to the Analysis of Trie Structures That Store Prefixing-Keys 1997 22 ALGORITHMS Ferragina, Dynamic Text Indexing under String Updates 1997 22 ALGORITHMS Rub, On the Average Running Time of Odd-Even Merge Sort 1997 22 ALGORITHMS Reif & Tate, On Dynamic Algorithms for Algebraic Problems 1997 22 ALGORITHMS Fu, Directed Graph Pattern Matching and Topological Embedding 1997 22 ALGORITHMS Goldberg, An Efficient Implementation of a Scaling Minimum-Cost Flow Algorithm 1997 22 ALGORITHMS Cohen, Using Selective Path-Doubling for Parallel Shortest-Path Computations 1997 22 ALGORITHMS Palios, Connecting the Maximum Number of Nodes in the Grid to the Boundary with Nonintersecting Line Segments 1997 22 ALGORITHMS Azar & Kalyanasundaram & Plotkin & Pruhs & Waarts, On-Line Load Balancing of Temporary Tasks 1997 22 ALGORITHMS Sibeyn & Chlebus & Kaufmann, Deterministic Permutation Routing on Meshes 1997 22 ALGORITHMS Gupta & Wenger, Constructing Piecewise Linear Homeomorphisms of Simple Polygons 1997 22 ALGORITHMS Afek & Awerbuch & Gafni & Mansour & Rosen & Shavit, Slide--The Key to Polynomial End-to-End Communication 1997 22 ALGORITHMS Penn & Shasha-Krupnik, Improved Approximation Algorithms for Weighted 2- and 3-Vertex Connectivity Augmentation Problems 1996 21 ALGORITHMS Hershberger & Suri, Off-Line Maintenance of Planar Configurations 1996 21 ALGORITHMS McDiarmid & Hayward, Large Deviations for Quicksort 1996 21 ALGORITHMS Agarwal & Sharir, Ray Shooting Amidst Convex Polygons in 2D 1996 21 ALGORITHMS Becker & Franciosa & Gschwind & Leonardi & Ohler & Widmayer, Enclosing a Set of Objects by Two Minimum Area Rectangles 1996 21 ALGORITHMS Babel & Ponomarenko & Tinhofer, The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs 1996 21 ALGORITHMS Kaib & Schnorr, The Generalized Gauss Reduction Algorithm 1996 21 ALGORITHMS Chazelle & Matousek, On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension 1996 21 ALGORITHMS Zhou & Nakano & Nishizeki, Edge-Coloring Partial k-Trees 1996 21 ALGORITHMS Fredman & Khachiyan, On the Complexity of Dualization of Monotone Disjunctive Normal Forms 1996 21 ALGORITHMS Overmars & van der Stappen, Range Searching and Point Location among Fat Objects 1996 21 ALGORITHMS Ghosh, Corrigendum: A Note on Computing the Visibility Polygon from a Convex Chain 1996 21 ALGORITHMS Tamassia, On-line Planar Graph Embedding 1996 21 ALGORITHMS Tseng & Luo, On Computing the Nested Sums and Infimal Convolutions of Convex Piecewise-Linear Functions 1996 21 ALGORITHMS Ramalingam & Reps, An Incremental Algorithm for a Generalization of the Shortest-Path Problem 1996 21 ALGORITHMS Narayanan & Roy & Patkar, Approximation Algorithms for Min-k-Overlap Problems Using the Principal Lattice of Partitions Approach 1996 21 ALGORITHMS Cohen, Efficient Parallel Shortest-Paths in Digraphs with a Separator Decomposition 1996 21 ALGORITHMS Bodlaender & Kloks, Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs 1996 21 ALGORITHMS Hochbaum & Naor, Approximation Algorithms for Network Design Problems on Bounded Subsets 1996 21 ALGORITHMS Hoogeveen, Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria 1996 21 ALGORITHMS Khuller & Raghavachari, Improved Approximation Algorithms for Uniform Connectivity Problems 1996 21 ALGORITHMS Kant, Augmenting Outerplanar Graphs 1996 21 ALGORITHMS Kannan & Lawler & Warnow, Determining the Evolutionary Tree Using Experiments 1996 21 ALGORITHMS Galluccio & Loebl, Cycles of Prescribed Modularity in Planar Digraphs 1996 21 ALGORITHMS Czumaj, Very Fast Approximation of the Matrix Chain Product Problem 1996 21 ALGORITHMS Pellegrini, Repetitive Hidden Surface Removal for Polyhedra 1996 21 ALGORITHMS Hvalica, Best First Search Algorithm in AND/OR Graphs with Cycles 1996 21 ALGORITHMS Eu & Guevremont & Toussaint, On Envelopes of Arrangements of Lines 1996 21 ALGORITHMS Sgall, Randomized On-line Scheduling of Parallel Jobs 1996 21 ALGORITHMS Frieze & Jerrum & Molloy & Robinson & Wormald, Generating and Counting Hamilton Cycles in Random Regular Graphs 1996 20 ALGORITHMS Peng & Lo, Efficient Algorithms for Finding a Core of a Tree with a Specified Length 1996 20 ALGORITHMS Chen, Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon 1996 20 ALGORITHMS Burley, Traversing Layered Graphs Using the Work Function Algorithm 1996 20 ALGORITHMS Subramanian, An Explanation of Splaying 1996 20 ALGORITHMS Iwama & Iwamoto, alpha-Connectivity: A Gradually Nonparallel Graph Problem 1996 20 ALGORITHMS Matousek, Derandomization in Computational Geometry 1996 20 ALGORITHMS Agarwal & Sen, Selection in Monotone Matrices and Computing kth Nearest Neighbors 1996 20 ALGORITHMS Thorup, Efficient Preprocessing of Simple Binary Pattern Forests 1996 20 ALGORITHMS Iwama & Miyano & Kambayashi, Routing Problems on the Mesh of Buses 1996 20 ALGORITHMS Bollobas & Fenner & Frieze, On the Best Case of Heapsort 1996 20 ALGORITHMS Itai & Shachnai, Adaptive Source Routing in High-Speed Networks 1996 20 ALGORITHMS Jadhav & Mukhopadhyay & Bhattacharya, An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons 1996 20 ALGORITHMS Colbourn & Myrvold & Neufeld, Two Algorithms for Unranking Arborescences 1996 20 ALGORITHMS Dasgupta & Chakrabarti & DeSarkar, Multiobjective Heuristic Search in AND/OR Graphs 1996 20 ALGORITHMS Frieze & Suen, Analysis of Two Simple Heuristics on a Random Instance of k-SAT 1996 20 ALGORITHMS Panconesi & Srinivasan, On the Complexity of Distributed Network Decomposition 1996 20 ALGORITHMS Huen & Mayr, A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube 1996 20 ALGORITHMS Karger & Phillips & Torng, A Better Algorithm for an Ancient Scheduling Problem 1996 20 ALGORITHMS Knuth, An Exact Analysis of Stable Allocation 1996 20 ALGORITHMS Krizanc, Time-Randomness Trade-offs in Parallel Computation 1996 20 ALGORITHMS Lagergren, Efficient Parallel Algorithms for Graphs of Bounded Tree-Width 1996 20 ALGORITHMS Buss & Kanellakis & Ragde & Shvartsman, Parallel Algorithms with Processor Failures and Delays 1996 20 ALGORITHMS Cohen & Fredman, Weighted Binary Trees for Concurrent Searching 1996 20 ALGORITHMS van Vliet, On the Asymptotic Worst Case Behavior of Harmonic Fit 1996 20 ALGORITHMS Caro & Sebo & Tarsi, Recognizing Greedy Structures 1996 20 ALGORITHMS Lenstra & Veldhorst & Veltman, The Complexity of Scheduling Trees with Communication Delays 1996 20 ALGORITHMS Zhou & Suzuki & Nishizeki, A Linear Algorithm for Edge-Coloring Series-Parallel Multigraphs 1995 19 ALGORITHMS Zhu, A Polynomial Algorithm for Homomorphisms to Oriented Cycles 1995 19 ALGORITHMS Wu & Manber & Myers, A Subquadratic Algorithm for Approximate Regular Expression Matching 1995 19 ALGORITHMS Rajasekaran, k-k Routing, k-k Sorting, and Cut-Through Routing on the Mesh 1995 19 ALGORITHMS Johnson & Metaxas, A Parallel Algorithm for Computing Minimum Spanning Trees 1995 19 ALGORITHMS Eddy & Schervish, How Many Comparisons Does Quicksort Use? 1995 19 ALGORITHMS Bampis & El Haddad & Manoussakis & Santha, A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments 1995 19 ALGORITHMS Engel, An Algorithm for the Determination of the Variance of a Partially Ordered Set 1995 19 ALGORITHMS Golumbic & Kaplan & Shamir, Graph Sandwich Problems 1995 19 ALGORITHMS Datta & Lenhof & Schwarz & Smid, Static and Dynamic Algorithms for k-Point Clustering Problems 1995 19 ALGORITHMS de la Torre & Kruskal, Fast Parallel Algorithms for All-Sources Lexicographic Search and Path-Algebra Problems 1995 19 ALGORITHMS Sherk, Self-Adjusting k-ary Search Trees 1995 19 ALGORITHMS Frederickson, Using Cellular Graph Embeddings in Solving All Pairs Shortest Paths Problems 1995 19 ALGORITHMS Bose & Toussaint, Growing a Tree from Its Branches 1995 19 ALGORITHMS Klein & Ravi, A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees 1995 19 ALGORITHMS Aggarwal & Bar-Noy & Khuller & Kravets & Schieber, Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality 1995 18 ALGORITHMS Chong & Lam, Finding Connected Components in O(log n log log n) Time on the EREW PRAM 1995 18 ALGORITHMS Hershberger & Suri, A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk 1995 18 ALGORITHMS Fredman & Johnson & McGeoch & Ostheimer, Data Structures for Traveling Salesmen 1995 18 ALGORITHMS Ramesh, On Traversing Layered Graphs On-Line 1995 18 ALGORITHMS Buchsbaum & Tarjan, Confluently Persistent Deques via Data-Structural Bootstrapping 1995 18 ALGORITHMS Ruppert, A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation 1995 18 ALGORITHMS Gabow, Centroids, Representations, and Submodular Flows 1995 18 ALGORITHMS Hagerup, Fast Deterministic Processor Allocation 1995 18 ALGORITHMS Furer & Raghavachari, An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs 1995 18 ALGORITHMS Azar & Naor & Rom, The Competitiveness of On-Line Assignments 1995 18 ALGORITHMS Bodlaender & Gilbert & Hafsteinsson & Kloks, Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree 1995 18 ALGORITHMS de Berg & van Kreveld & Snoeyink, Two- and Three-Dimensional Point Location in Rectangular Subdivisions 1995 18 ALGORITHMS Breslauer, Dictionary-Matching on Unbounded Alphabets: Uniform Length Dictionaries 1995 18 ALGORITHMS Caspi & Dekel, Edge Coloring Series Parallel Graphs 1995 18 ALGORITHMS Ben-Asher & Schuster, The Complexity of Data Reduction on a Reconfigurable Linear Array 1995 18 ALGORITHMS Lai & Wei, Algorithms for Page Retrieval and Hamiltonian Paths on Forward-Convex Line Graphs 1995 18 ALGORITHMS Kelsen & Ramachandran, On Finding Minimal Two-Connected Subgraphs 1995 18 ALGORITHMS Cole & Zajicek, An Asynchronous Parallel Algorithm for Undirected Graph Connectivity 1995 18 ALGORITHMS Berger & Cowen, Scheduling with Concurrency-Based Constraints 1995 18 ALGORITHMS Schmid & Blieberger, On Nonpreemptive LCFS Scheduling with Deadlines 1995 18 ALGORITHMS Chandra & Vishwanathan, Constructing Reliable Communication Networks of Small Weight Online 1995 18 ALGORITHMS Gupta & Nishimura, The Parallel Complexity of Tree Embedding Problems 1994 17 ALGORITHMS Agarwal & Sharir & Toledo, Applications of Parametric Searching in Geometric Optimization 1994 17 ALGORITHMS Bar-Eli & Berman & Fiat & Yan, Online Navigation in a Room 1994 17 ALGORITHMS Baumgarten & Jung & Mehlhorn, Dynamic Point Location in General Subdivisions 1994 17 ALGORITHMS Berman & Ramaiyer, Improved Approximations for the Steiner Tree Problem 1994 17 ALGORITHMS Furer & Raghavachari, Approximating the Minimum-Degree Steiner Tree to within One of Optimal 1994 17 ALGORITHMS Hao & Orlin, A Faster Algorithm for Finding the Minimum Cut in a Directed Graph 1994 17 ALGORITHMS King & Rao & Tarjan, A Faster Deterministic Maximum Flow Algorithm 1994 17 ALGORITHMS Yannakakis, On the Approximation of Maximum Satisfiability 1994 17 ALGORITHMS Gavril & Toledano Laredo & de Werra, Chordless Paths, Odd Holes, and Kernels in Graphs without m-Obstructions 1994 17 ALGORITHMS Kortsarz & Peleg, Generating Sparse 2-Spanners 1994 17 ALGORITHMS Eppstein, Offline Algorithms for Dynamic Minimum Spanning Tree Problems 1994 17 ALGORITHMS Ma & Spinrad, On the 2-Chain Subgraph Cover and Related Problems 1994 17 ALGORITHMS Kofler & Leondes, Algorithmic Modifications to the Theory of Evidential Reasoning 1994 17 ALGORITHMS Khuller & Vishkin & Young, A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Covers 1994 17 ALGORITHMS Culberson & Reckhow, Covering Polygons Is Hard 1994 17 ALGORITHMS Fredman & Goldsmith, Three Stacks 1994 17 ALGORITHMS Malitz, Graphs with E Edges Have Pagenumber O(sqrt(E)) 1994 17 ALGORITHMS Malitz, Genus g Graphs Have Pagenumber O(sqrt(g)) 1994 17 ALGORITHMS Moses & Waarts, Coordinated Traversal: (t+1)-Round Byzantine Agreement in Polynomial Time 1994 17 ALGORITHMS Leighton & Maggs & Ranade & Rao, Randomized Routing and Sorting on Fixed-Connection Networks 1994 16 ALGORITHMS Eberly, Logarithmic Depth Circuits for Hermite Interpolation 1994 16 ALGORITHMS Martel & Subramonian, On the Complexity of Certified Write-All Algorithms 1994 16 ALGORITHMS Warnow, Tree Compatibility and Inferring Evolutionary History 1994 16 ALGORITHMS Fernandez-Baca & Slutzki, Parametric Problems on Graphs of Bounded Tree-Width 1994 16 ALGORITHMS Ho & Leung & Wei, Minimizing Maximum Weighted Error for Imprecise Computation Tasks 1994 16 ALGORITHMS Ibarra & Zheng, Some Efficient Algorithms for Permutation Graphs 1994 16 ALGORITHMS Wanke, Bounded Tree-Width and LOGCFL 1994 16 ALGORITHMS Colussi, Fastest Pattern Matching in Strings 1994 16 ALGORITHMS Iwama & Kambayashi, A Simpler Parallel Algorithm for Graph Connectivity 1994 16 ALGORITHMS Doignon & Falmagne, A Polynomial Time Algorithm for Unidimensioinal Unfolding Representations 1994 16 ALGORITHMS Chrobak & Larmore, Generosity Helps or an 11-Competitive Algorithm for Three Servers 1994 16 ALGORITHMS Spinrad, Recognition of Circle Graphs 1994 16 ALGORITHMS Ehrenfeucht & Gabow & McConnell & Sullivan, An O(n^2) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs 1994 16 ALGORITHMS Goldberg & Zwick, Faster Parallel String Matching via Larger Deterministic Samples 1994 16 ALGORITHMS Filaseta & Robinson & Wheeler, The Minimal Euclidean Norm of an Algebraic Number Is Effectively Computable 1994 16 ALGORITHMS Sarkar & Chakrabarti & Ghose & DeSarkar, Improving Greedy Algorithms by Lookahead-Search 1994 16 ALGORITHMS Ronyai, A Deterministic Method for Computing Splitting Elements in Simple Algebras over Q 1994 16 ALGORITHMS Zhang & Shasha & Wang, Approximate Tree Matching in the Presence of Variable Length Don't Cares 1994 16 ALGORITHMS Verma, A General Method and a Master Theorem for Divide-and-Conquer Recurrences with Applications 1994 16 ALGORITHMS Alon & Duke & Lefmann & Rodl & Yuster, The Algorithmic Aspects of the Regularity Lemma 1994 16 ALGORITHMS Sorenson, Two Fast GCD Algorithms 1994 16 ALGORITHMS Ma & Spinrad, An O(n^2) Algorithm for Undirected Split Decomposition 1993 15 ALGORITHMS Lucas & van Baronaigien & Ruskey, On Rotations and the Generation of Binary Trees 1993 15 ALGORITHMS Dahlhaus & Hajnal & Karpinski, On the Parallel Complexity of Hamiltonian Cycle and Matching Problem on Dense Graphs 1993 15 ALGORITHMS Bar-Ilan & Kortsarz & Peleg, How to Allocate Network Centers 1993 15 ALGORITHMS Booth & Tarjan, Finding the Minimum-Cost Maximum Flow in a Series-Parallel Network 1993 15 ALGORITHMS Hui & Martel, Unsuccessful Search in Self-Adjusting Data Structures 1993 15 ALGORITHMS Mohar, Projective Planarity in Linear Time 1993 15 ALGORITHMS Althofer, A Parallel Game Tree Search Algorithm with a Linear Speedup 1993 15 ALGORITHMS Bach & Driscoll & Shallit, Factor Refinement 1993 15 ALGORITHMS Joichi & Stanton, An Algorithmic Involution for p(n) 1993 15 ALGORITHMS Agarwal & van Kreveld & Overmars, Intersection Queries in Curved Objects 1993 15 ALGORITHMS Formann & Wagner & Wagner, Routing through a Dense Channel with Minimum Total Wire Length 1993 15 ALGORITHMS He, Parallel Algorithm for Cograph Recognition with Applications 1993 15 ALGORITHMS Agarwal & Efrat & Sharir & Toledo, Computing a Segment Center for a Planar Point Set 1993 15 ALGORITHMS Koda & Ruskey, A Gray Code for the Ideals of a Forest Poset 1993 15 ALGORITHMS Csirik, The Parametric Behavior of the First-Fit Decreasing Bin Packing Algorithm 1993 15 ALGORITHMS Frederickson & Guan, Nonpreemptive Ensemble Motion Planning on a Tree 1993 15 ALGORITHMS Thomassen, The Even Cycle Problem for Planar Digraphs 1993 15 ALGORITHMS Schaffer & Sedgewick, The Analysis of Heapsort 1993 15 ALGORITHMS Poonen, The Worst Case in Shellsort and Related Algorithms 1993 15 ALGORITHMS Hartvigsen, Minimum Path Bases 1993 15 ALGORITHMS Peng & Stephens & Yesha, Algorithms for a Core and k-Tree Core of a Tree 1993 15 ALGORITHMS Bodlaender & Kloks, A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs 1993 15 ALGORITHMS Eppstein & Italiano & Tamassio & Tarjan & Westbrook & Yung, Corrigendum: Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph 1993 14 ALGORITHMS Klein, Parallelism, Preprocessing, and Reachability: A Hybrid Algorithm for Directed Graphs 1993 14 ALGORITHMS Berkman & Schieber & Vishkin, Optimal Doubly Logarithmic Parallel Algorithms Based on Finding All Nearest Smaller Values 1993 14 ALGORITHMS Ragde, The Parallel Simplicity of Compaction and Chaining 1993 14 ALGORITHMS Devroye & Toussaint, Convex Hulls for Random Lines 1993 14 ALGORITHMS Levcopoulos & Petersson, Adaptive Heapsort 1993 14 ALGORITHMS Aspnes, Time- and Space-Efficient Randomized Consensus 1993 14 ALGORITHMS Matousek, Linear Optimization Queries 1993 14 ALGORITHMS Mansour & Patt-Shamir, Greedy Packet Scheduling on Shortest Paths 1993 14 ALGORITHMS Wang & Chen & Park, On the Set LCS and Set-Set LCS Problems 1993 14 ALGORITHMS Kalyanasundaram & Pruhs, Online Weighted Matching 1993 14 ALGORITHMS Pearson & Vazirani, Efficient Sequential and Parallel Algorithms for Maximal Bipartite Sets 1993 14 ALGORITHMS Goldberg & Plotkin & Vaidya, Sublinear-Time Parallel Algorithms for Matching and Related Problems 1993 14 ALGORITHMS Khuller & Thurimella, Approximation Algorithms for Graph Augmentation 1993 14 ALGORITHMS Zerovnik & Pisanski, Computing the Diameter in Multiple-Loop Networks 1993 14 ALGORITHMS Ibarra & Wang & Jiang, On Efficient Parallel Algorithms for Solving Set Recurrence Equations 1993 14 ALGORITHMS Diks & Djidjev & Sykora & Vrto, Edge Separators of Planar and Outerplanar Graphs with Applications 1993 14 ALGORITHMS Karpinski & Luby, Approximating the Number of Zeroes of a GF[2] Polynomial 1993 14 ALGORITHMS Bitan & Zaks, Optimal Linear Broadcast 1993 14 ALGORITHMS Afek & Ricklin, Sparser: A Paradigm for Running Distributed Algorithms 1993 14 ALGORITHMS Bodlaender, On Linear Time Minor Tests with Depth-First Search 1993 14 ALGORITHMS Du & Leung, Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops 1993 14 ALGORITHMS Du & Leung, Minimizing Mean Flow Time with Release Time and Deadline Constraints 1993 14 ALGORITHMS Agarwal & Sharir, Circle Shooting in a Simple Polygon 1993 14 ALGORITHMS Valiveti & Oommen, Self-Organizing Doubly-Linked Lists 1993 14 ALGORITHMS Hell & Kirkpatrick, Algorithms for Degree Constrained Graph Factors of Minimum Deficiency 1993 14 ALGORITHMS Doh & Chwa, An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment 1992 13 ALGORITHMS Krawczyk, How to Predict Congruential Generators 1992 13 ALGORITHMS Fischer & Gilboa & Shpitalni, A Polynomial Algorithm for Minimal Interval Representation 1992 13 ALGORITHMS Lotti, Fast Solution of Linear Systems with Polynomial Coefficients over the Ring of Integers 1992 13 ALGORITHMS Averbuch & Bshouty & Kaminski, A Classification of Algorithms for Multiplying Polynomials of Small Degree over Finite Fields 1992 13 ALGORITHMS Li & Cheng, Heuristic Algorithms for On-Line Packing in Three Dimensions 1992 13 ALGORITHMS Suzuki & Ishiguro & Nishizeki, Variable-Priority Queue and Doughnut Routing 1992 13 ALGORITHMS Birk & Lotspiech, On Finding Non-intersecting Straightline Connections of Grid Points to the Boundary 1992 13 ALGORITHMS Vishwanathan, Randomized Online Graph Coloring 1992 13 ALGORITHMS Cheng & Janardan, Algorithms for Ray-Shooting and Intersection Searching 1992 13 ALGORITHMS Chu, Optimal Algorithm for the Nearest Common Dominator Problem 1992 13 ALGORITHMS Yellin, Representing Sets with Constant Time Equality Testing 1992 13 ALGORITHMS Munro & Raman, Sorting with Minimum Data Movement 1992 13 ALGORITHMS Atallah & Kosaraju, An Efficient Parallel Algorithm for the Row Minima of a Totally Monotone Matrix 1992 13 ALGORITHMS Ruskey & Savage & Wang, Generating Necklaces 1992 13 ALGORITHMS Fillebrown, Faster Computation of Bernoulli Numbers 1992 13 ALGORITHMS Apostolico & Szpankowski, Self-Alignments in Words and Their Applications 1992 13 ALGORITHMS Hwang & Weng, The Shortest Network under a Given Topology 1992 13 ALGORITHMS Vishkin, A Parallel Blocking Flow Algorithm for Acyclic Networks 1992 13 ALGORITHMS Johnson, Johnson, The NP-Completeness Column: An Ongoing Guide: The Story So Far: The Tale of the Second Prover 1992 13 ALGORITHMS Chakrabarti & Ghose, A General Best First Search Algorithm in AND/OR Graphs 1992 13 ALGORITHMS Alon & Bar-Noy & Linial & Peleg, Single Round Simulation on Radio Networks 1992 13 ALGORITHMS Cypher & Sanz, Cubesort: A Parallel Algorithm for Sorting N Data Items with S-Sorters 1992 13 ALGORITHMS Ramarao & Venkatesan, On Finding and Updating Shortest Paths Distributively 1992 13 ALGORITHMS Camerini & Galbiati & Maffioli, Random Pseudo-Polynomial Algorithms for Exact Matroid Problems 1992 13 ALGORITHMS de Berg & Carlsson & Overmars, A General Approach to Dominance in the Plane 1992 13 ALGORITHMS Blaha, Minimum Bases for Permutation Groups: The Greedy Approximation 1992 13 ALGORITHMS Matousek & Welzl, Good Splitters for Counting Points in Triangles 1992 13 ALGORITHMS Lendenbaum & Bruckstein, Parallel Strategies for Geometric Probing 1992 13 ALGORITHMS Amir & Landau & Vishkin, Efficient Pattern Matching with Scaling 1992 13 ALGORITHMS Eppstein & Italiano & Tamassia & Tarjan & Westbrook & Yung, Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph 1992 13 ALGORITHMS Klawe, Superlinear Bounds for Matrix Searching Problems 1992 13 ALGORITHMS Norton & Plotkin & Tardos, Using Separation Algorithms in Fixed Dimension 1992 13 ALGORITHMS Paterson & Yao, Optimal Binary Space Partitions for Orthogonal Objects 1992 13 ALGORITHMS Bang-Jensen & Manoussakis & Thomassen, A Polynomial Algorithm for Hamiltonian-Connectedness in Semicomplete Digraphs 1992 13 ALGORITHMS Goldberg, Efficient Algorithms for Listing Unlabeled Graphs 1992 13 ALGORITHMS Avery, An Algorithmic Proof that Semiorders Are Representable 1992 13 ALGORITHMS Hirschberg & Larmore, The Traveler's Problem 1992 13 ALGORITHMS Kashiwabara & Masuda & Nakajima & Fujisawa, Generation of Maximum Independent Sets of a Bipartite Graph and Maximum Cliques of a Circular-Arc Graph 1991 12 ALGORITHMS Hofri & Shachnai, Self-Organizing Lists and Independent References: A Statistical Synergy 1991 12 ALGORITHMS Vallee, Gauss' Algorithm Revisited 1991 12 ALGORITHMS Matias & Vishkin, On Parallel Hashing and Integer Sorting 1991 12 ALGORITHMS Chrobak & Larmore, On Fast Algorithms for Two Servers 1991 12 ALGORITHMS Ausiello & Italiano & Spaccamela & Nanni, Incremental Algorithms for Minimal Length Paths 1991 12 ALGORITHMS Bergen & Shvaytser (Schweitzer), A Probabilistic Algorithm for Computing Hough Transforms 1991 12 ALGORITHMS Zhu & Goddard, An Algorithm for Outerplanar Graphs with Parameter 1991 12 ALGORITHMS Wu, Optimal Quantization by Matrix Searching 1991 12 ALGORITHMS Kucera, The Greedy Coloring Is a Bad Probabilistic Algorithm 1991 12 ALGORITHMS Fiat & Karp & Luby & McGeoch & Sleator & Young, Competitive Paging Algorithms 1991 12 ALGORITHMS Skiena, Probing Convex Polygons with Half-Planes 1991 12 ALGORITHMS Chen & Yesha, Parallel Recognition of the Consecutive Ones Property with Applications 1991 12 ALGORITHMS Paterson & Razborov, The Set of Minimal Braids is Co-NP-complete 1991 12 ALGORITHMS He, Efficient Parallel Algorithms for Series Parallel Graphs 1991 12 ALGORITHMS Hershberger & Suri, Finding Tailored Partitions 1991 12 ALGORITHMS Huang, Generalized Riemann Hypothesis and Factoring Polynomials over Finite Fields 1991 12 ALGORITHMS Huang, Factorization of Polynomials over Finite Fields and Decomposition of Primes in Algebraic Number Fields 1991 12 ALGORITHMS Larmore & Schieber, On-line Dynamic Programming with Applications to the Prediction of RNA Secondary Structure 1991 12 ALGORITHMS Bruck & Roychowdhury, How to Play Bowling in Parallel on the Grid 1991 12 ALGORITHMS Csirik & Frenk & Galambos & Kan, Probabilistic Analysis of Algorithms for Dual Bin Packing Problems 1991 12 ALGORITHMS Attiya & Snir, Better Computing on the Anonymous Ring 1991 12 ALGORITHMS Bienstock & Seymour, Monotonicity in Graph Searching 1991 12 ALGORITHMS Kim & Lai, The Complexity of Congestion-1 Embedding in a Hypercube 1991 12 ALGORITHMS Zantema, Minimizing Sums of Addition Chains 1991 12 ALGORITHMS Arnborg & Lagergren & Seese, Easy Problems for Tree-Decomposable Graphs 1991 12 ALGORITHMS Capoyleas & Rote & Woeginger, Geometric Clusterings 1991 12 ALGORITHMS Matousek & Thomas, Algorithms Finding Tree-Decompositions of Graphs 1991 12 ALGORITHMS He, An Improved Algorithm for the Planar 3-Cut Problem 1991 12 ALGORITHMS Aggarwal & Imai & Katoh & Suri, Finding k Points with Minimum Diameter and Related Problems 1991 12 ALGORITHMS Cheng & Janardan, Efficient Maintenance of the Union of Intervals on a Line, with Applications 1991 12 ALGORITHMS Ghosh, Computing the Visibility Polygon from a Convex Set and Related Problems 1991 12 ALGORITHMS Przytycka & Corneil, Parallel Algorithms for Parity Graphs 1991 12 ALGORITHMS Gibbons & Karp & Ramachandran & Soroker & Tarjan, Transitive Compaction in Parallel via Branchings 1991 12 ALGORITHMS Hayward & McDiarmid, Average Case Analysis of Heap Building by Repeated Insertion 1991 12 ALGORITHMS Tan, A Necessary and Sufficient Condition for the Existence of a Complete Stable Matching 1991 12 ALGORITHMS Wilf, Two Algorithms for the Sieve Method 1990 11 ALGORITHMS Kantor, Finding Sylow Normalizers in Polynomial Time 1990 11 ALGORITHMS Mount & Silverman, Packing and Covering the Plane with Translates of a Convex Polygon 1990 11 ALGORITHMS Shasha & Zhang, Fast Algorithms for the Unit Cost Editing Distance between Trees 1990 11 ALGORITHMS Mansour & Schulman, Sorting on a Ring of Processors 1990 11 ALGORITHMS Bodlaender, Polynomial Algorithms for Graph Isomorphism and Chromatic Index on Partial k-Trees 1990 11 ALGORITHMS Hastad, Tensor Rank Is NP-Complete 1990 11 ALGORITHMS Awerbuch & Bar-Noy & Linial & Peleg, Improved Routing Strategies with Succinct Tables 1990 11 ALGORITHMS Awerbuch, On the Effects of Feedback in Dynamic Network Protocols 1990 11 ALGORITHMS Neiger & Toueg, Automatically Increasing the Fault-Tolerance of Distributed Algorithms 1990 11 ALGORITHMS Biran & Moran & Zaks, A Combinatorial Characterization of the Distributed 1-Solvable Tasks 1990 11 ALGORITHMS Aspnes & Herlihy, Fast Randomized Consensus Using Shared Memory 1990 11 ALGORITHMS Johnson & Zwaenepoel, Recovery in Distributed Systems Using Optimistic Message Logging and Checkpointing 1990 11 ALGORITHMS Huang & Teng, Security, Verifiability, and Universality in Distributed Computing 1990 11 ALGORITHMS Berman & Johnson & Leighton & Shor & Snyder, Generalized Planar Matching 1990 11 ALGORITHMS Kulkarni, Generating Random Combinatorial Objects 1990 11 ALGORITHMS Manasse & McGeoch & Sleator, Competitive Algorithms for Server Problems 1990 11 ALGORITHMS Schmeichel & Hakimi & Otsuka & Sullivan, A Parallel Fault Identification Algorithm 1990 11 ALGORITHMS Weiss & Sedgewick, Tight Lower Bounds for Shellsort 1990 11 ALGORITHMS Adhar & Peng, Parallel Algorithms for Cographs and Parity Graphs with Applications 1990 11 ALGORITHMS Ronn, NP-Complete Stable Matching Problems 1990 11 ALGORITHMS Everett & Corneil, Recognizing Visibility Graphs of Spiral Polygons 1990 11 ALGORITHMS Li & Marsland, Probability-Based Game Tree Pruning 1990 11 ALGORITHMS Huang, A New Algorithm for the Generation of Binary de Bruijn Sequences 1990 11 ALGORITHMS McKay & Wormald, Uniform Generation of Random Regular Graphs of Moderate Degree 1990 11 ALGORITHMS Ruskey & Proskurowski, Generating Binary Trees by Transpositions 1990 11 ALGORITHMS Eppstein, Sequence Comparison with Mixed Convex and Concave Costs 1990 11 ALGORITHMS Chrobak & Nishizeki, Improved Edge-Coloring Algorithms for Planar Graphs 1990 11 ALGORITHMS Morton & Short, Calculating the 2-Variable Polynomial for Knots Presented as Closed Braids 1990 11 ALGORITHMS Naor & Novick, An Efficient Reconstruction of a Graph from Its Line Graph in Parallel 1990 11 ALGORITHMS Johnson, The NP-Completeness Column: An Ongoing Guide: The Story So Far 1989 10 ALGORITHMS Dyer & Frieze, The Solution of Some Random NP-Hard Problems in Polynomial Expected Time 1989 10 ALGORITHMS Chou & Gopal, Linear Broadcast Routing 1989 10 ALGORITHMS Wachs, On an Efficient Dynamic Programming Technique of F. F. Yao 1989 10 ALGORITHMS Hafner & McCurley, On the Distribution of Running Times of Certain Integer Factoring Algorithms 1989 10 ALGORITHMS Rabin & Vazirani, Maximum Matchings in General Graphs through Randomization 1989 10 ALGORITHMS Thomassen, The Graph Genus Problem Is NP-Complete 1989 10 ALGORITHMS Savage, Gray Code Sequences of Partitions 1989 10 ALGORITHMS Ramanan & Brown & Lee & Lee, On-Line Bin Packing in Linear Time 1989 10 ALGORITHMS Goodrich, Triangulating a Polygon in Parallel 1989 10 ALGORITHMS McDiarmid & Reed, Building Heaps Fast 1989 10 ALGORITHMS Sprugnoli, The Analysis of a Simple In-Place Merging Algorithm 1989 10 ALGORITHMS Fernandez-Baca & Slutzki, Solving Parametric Problems on Trees 1989 10 ALGORITHMS Bergeron & Berstel & Brlek & Duboc, Addition Chains Using Continued Fractions 1989 10 ALGORITHMS Amato & Blum & Irani & Rubinfeld, Reversing Trains: A Turn of the Century Sorting Problem 1989 10 ALGORITHMS Karp & Luby & Madras, Monte-Carlo Approximation Algorithms for Enumeration Problems 1989 10 ALGORITHMS Landau & Vishkin, Fast Parallel and Serial Approximate String Matching 1989 10 ALGORITHMS Guting & Nurmi & Ottmann, Fast Algorithms for Direct Enclosures and Direct Dominances 1989 10 ALGORITHMS Chiba & Nishizeki, The Hamiltonian Cycle Problem Is Linear-Time Solvable for 4-Connected Planar Graphs 1989 10 ALGORITHMS Heusinger & Noltemeier, On Separable Clusterings 1989 10 ALGORITHMS Poblete & Munro, Last-Come-First-Served Hashing 1989 10 ALGORITHMS Kindervater & Lenstra & Shmoys, The Parallel Complexity of TSP Heuristics 1989 10 ALGORITHMS Colbourn & Day & Nel, Unranking and Ranking Spanning Trees of a Graph 1989 10 ALGORITHMS Abrahamson & Dadoun & Kirkpatrick & Przytycka, A Simple Parallel Tree Contraction Algorithm 1989 10 ALGORITHMS Minsker, The Towers of Hanoi Rainbow Problem: Coloring the Rings 1989 10 ALGORITHMS Knott & de la Torre, Hash Table Collision Resolution with Direct Chaining 1989 10 ALGORITHMS Chrobak & Yung, Fast Algorithms for Edge-Coloring Planar Graphs 1989 10 ALGORITHMS Mahmoud & Pittel, Analysis of the Space of Search Trees under the Random Insertion Algorithm 1989 10 ALGORITHMS Mansour & Schieber, Finding the Edge Connectivity of Directed Graphs 1989 10 ALGORITHMS Chang & Hambrusch & Simon, On the Computational Complexity of Continuous Routing 1989 10 ALGORITHMS Feinberg & Papadimitriou, Finding Feasible Paths for a Two-Point Body 1989 10 ALGORITHMS Bernstein & Rodeh & Gertner, Approximation Algorithms for Scheduling Arithmetic Expressions on Pipelined Machines 1989 10 ALGORITHMS Cypher & Sanz & Snyder, Hypercube and Shuffle-Exchange Algorithms for Image Component Labeling 1989 10 ALGORITHMS Hamidoune & Roeder & Janke & Feil & Koo, The Probability of Splitters in a List 1988 9 ALGORITHMS Bhattacharya & Zorbas, Solving the Two-Dimensional Findpath Problem Using a Line-Triangle Representation of the Robot 1988 9 ALGORITHMS Levy & Low, A Contraction Agorithm for Finding Small Cycle Cutsets 1988 9 ALGORITHMS Ronyai, Zero Divisors in Quaternion Algebras 1988 9 ALGORITHMS Cheriyan & Maheshwari, Finding Nonseparating Induced Cycles and Independent Spanning Trees in 3-Connected Graphs 1988 9 ALGORITHMS Althofer, On the Complexity of Searching Game Trees and Other Recursion Trees 1988 9 ALGORITHMS Bar-Yehuda & Kutten, Fault Tolerant Distributed Majority Commitment 1988 9 ALGORITHMS Maimon, An Algorithm for the Lorenz Measure in Locational Decisions on Trees 1988 9 ALGORITHMS Olariu & Toida & Zubair, On a Conjecture by Plaisted and Hong 1988 9 ALGORITHMS Ramachandran, Finding a Minimum Feedback Arc Set in Reducible Flow Graphs 1988 9 ALGORITHMS Golumbic & Hammer, Stability in Circular Arc Graphs 1988 9 ALGORITHMS Schaffer, A Tighter Upper Bound on the Worst Case Behavior of Conway's Parallel Sorting Algorithm 1988 9 ALGORITHMS Greenberg, Solution to a Linear Diophantine Equation for Nonnegative Integers 1988 9 ALGORITHMS Kaminski & Kirkpatrick & Bshouty, Addition Requirements for Matrix and Transposed Matrix Products 1988 9 ALGORITHMS Schoenhage, Probabilistic Computation of Integer Polynomial GCDs 1988 9 ALGORITHMS Overmars & Wood, On Rectangular Visibility 1988 9 ALGORITHMS Ronyai, Factoring Polynomials over Finite Fields 1988 9 ALGORITHMS Cheng & Hwang, Diameters of Weighted Double Loop Networks 1988 9 ALGORITHMS Gabow & Tarjan, Algorithms for Two Bottleneck Optimization Problems 1988 9 ALGORITHMS Wilber, The Concave Least-Weight Subsequence Problem Revisited 1988 9 ALGORITHMS Johnson, The NP-Completeness Column: Interactive Proof Systems for Fun and Profit 1988 9 ALGORITHMS Aurenhammer, Improved Algorithms for Discs and Balls Using Power Diagrams 1988 9 ALGORITHMS Ruskey, Adjacent Interchange Generation of Combinations 1988 9 ALGORITHMS Frieze, An Algorithm for Finding Hamilton Cycles in Random Directed Graphs 1988 9 ALGORITHMS Soroker, Fast Parallel Strong Orientation of Mixed Graphs and Related Augmentation Problems 1988 9 ALGORITHMS Szpankowski, Some Results on V-ary Asymmetric Tries 1988 9 ALGORITHMS Hester & Hirschberg & Larmore, Construction of Optimal Binary Split Trees in the Presence of Bounded Access Probabilities 1988 9 ALGORITHMS Overmars, Efficient Data Structures for Range Searching on a Grid 1988 9 ALGORITHMS Soroker, Fast Parallel Algorithms for Finding Hamiltonian Paths and Cycles in a Tournament 1988 9 ALGORITHMS Kunde & Langston & Liu, On a Special Case of Uniform Processor Scheduling 1988 9 ALGORITHMS Kantor & Taylor, Polynomial-Time Versions of Sylow's Theorem 1988 9 ALGORITHMS Hershberger & Guibas, An O(n^2) Shortest Path Algorithm for a Non-rotating Convex Body 1988 9 ALGORITHMS Schnorr, A More Efficient Algorithm for Lattice Basis Reduction 1988 9 ALGORITHMS Turner, Almost All k-Colorable Graphs Are Easy to Color 1988 9 ALGORITHMS Karchmer & Naor, A Fast Parallel Algorithm to Color a Graph with Delta Colors 1988 9 ALGORITHMS He & Yesha, Binary Tree Algebraic Computation and Parallel Algorithms for Simple Graphs 1988 9 ALGORITHMS Leiserson & Saxe, A Mixed-Integer Linear Programming Problem Which Is Efficiently Solvable 1988 9 ALGORITHMS Kingston, A New Proof of the Garsia-Wachs Algorithm 1988 9 ALGORITHMS Kaminski, An Algorithm for Polynomial Multiplication That Does Not Depend on the Ring Constants 1987 8 ALGORITHMS Blumer, How Much Is That DAWG in the Window? A Moving Window Algorithm for the Directed Acyclic Word Graph 1987 8 ALGORITHMS Boyar & Karloff, Coloring Planar Graphs in Parallel 1987 8 ALGORITHMS Atallah & Hambrusch, On Bipartite Matchings of Minimum Density 1987 8 ALGORITHMS Lucas, The Rotation Graph of Binary Trees Is Hamiltonian 1987 8 ALGORITHMS Wolfson, The Virtues of Locking by Symbolic Names 1987 8 ALGORITHMS Salowe & Steiger, Simplified Stable Merging Tasks 1987 8 ALGORITHMS Venkatesan, Improved Constants for Some Separator Theorems 1987 8 ALGORITHMS Larmore, A Subquadratic Algorithm for Constructing Approximately Optimal Binary Search Trees 1987 8 ALGORITHMS Gavril, Generating the Maximum Spanning Trees of a Weighted Graph 1987 8 ALGORITHMS Hochbaum & Maass, Fast Approximation Algorithms for a Nonconvex Covering Problem 1987 8 ALGORITHMS Tung, Computational Complexities of Diophantine Equations with Parameters 1987 8 ALGORITHMS Alon & Galil & Milman, Better Expanders and Superconcentrators 1987 8 ALGORITHMS Dobkin & Edelsbrunner, Space Searching for Intersecting Objects 1987 8 ALGORITHMS Loveland, Finding Critical Sets 1987 8 ALGORITHMS Lai & Sprague, On the Routability of a Convex Grid 1987 8 ALGORITHMS Cook & McKenzie, Problems Complete for Deterministic Logarithmic Space 1987 8 ALGORITHMS Bridgland, Universal Traversal Sequences for Paths and Cycles 1987 8 ALGORITHMS Plaisted & Hong, A Heuristic Triangulation Algorithm 1987 8 ALGORITHMS Johnson, The NP-Completeness Column: An Ongoing Guide--Announcements, Updates, and Greatest Hits 1987 8 ALGORITHMS Atkinson, An Optimal Algorithm for Geometrical Congruence 1987 8 ALGORITHMS Lagarias & Odlyzko, Computing pi(x): An Analytic Method 1987 8 ALGORITHMS Leven & Sharir, An Efficient and Simple Motion Planning Algorithm for a Ladder amidst Polygonal Barriers 1987 8 ALGORITHMS Bern & Lawler & Wong, Linear-Time Computation of Optimal Subgraphs of Decomposable Graphs 1987 8 ALGORITHMS Pittel, Linear Probing: The Probable Largest Search Time Grows Logarithmically with the Number of Records 1987 8 ALGORITHMS Rodl & Tovey, Multiple Optima in Local Search 1987 8 ALGORITHMS Lengauer, Efficient Algorithms for Finding Minimum Spanning Forests of Hierarchically Defined Graphs 1987 8 ALGORITHMS Johnson, The NP-Completeness Column: An Ongoing Guide--The Many Faces of Polynomial Time 1987 8 ALGORITHMS Imai & Asano, Dynamic Orthogonal Segment Intersection Search 1987 8 ALGORITHMS Cole & Yap, Shape from Probing 1987 8 ALGORITHMS Karloff & Shmoys, Efficient Parallel Algorithms for Edge Coloring Problems 1987 8 ALGORITHMS Pachl, A Lower bound for Probabilistic Distributed Algorithms 1987 8 ALGORITHMS Schaffer & Van Wyk, Convex Hulls of Piecewise-Smooth Jordan Curves 1987 8 ALGORITHMS Steiner, Searching in 2-Dimensional Partial Orders 1987 8 ALGORITHMS Chung, O(n^2.55) Time Algorithms for the Subgraph Homeomorphism Problem on Trees 1987 8 ALGORITHMS Mohammed & Subi, An Improved Block-Interchange Algorithm 1987 8 ALGORITHMS Georgakopoulos & Papadimitriou, The 1-Steiner Tree Problem 1987 8 ALGORITHMS Ferguson, A Noninductive GL(n,Z) Algorithm That Constructs Integral Linear Relations for n Z-Linearly Dependent Real Numbers 1987 8 ALGORITHMS Huang, Optimal Multiway Split Trees 1986 7 ALGORITHMS Ko & Teng, On the Number of Queries Necessary to Identify a Permutation 1986 7 ALGORITHMS Flajolet & Saheb, The Complexity of Generating an Exponentially Distributed Variate 1986 7 ALGORITHMS Hofri & Kamhi, A Stochastic Analysis of the NFD Bin-Packing Algorithm 1986 7 ALGORITHMS Kaufmann & Mehlhorn, Routing through a Generalized Switchbox 1986 7 ALGORITHMS Baker & Fortune & Mahaney, Polygon Containment under Translation 1986 7 ALGORITHMS Winter, Generalized Steiner Problem in Series-Parallel Networks 1986 7 ALGORITHMS Alon & Babai & Itai, A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem 1986 7 ALGORITHMS Johnson, The NP-Completeness Column: An Ongoing Guide--Computing in the Math Department: Part I 1986 7 ALGORITHMS Robertson & Seymour, Graph Minors. II. Algorithmic Aspects of Tree-Width 1986 7 ALGORITHMS Lewandowski & Liu & Liu, An Algorithmic Proof of a Generalization of the Birkhoff-Von Neumann Theorem 1986 7 ALGORITHMS Etzion, An Algorithm for Constructing m-ary de Bruijn Sequences 1986 7 ALGORITHMS Thanh & Alagar & Bui, Optimal Expected-Time Algorithms for Merging 1986 7 ALGORITHMS Megiddo & Zemel, An O(n log n) Randomizing Algorithm for the Weighted Euclidean 1-Center Problem 1986 7 ALGORITHMS Aggarwal & Melville, Fast Computation of the Modality of Polygons 1986 7 ALGORITHMS Richards, Finding Short Cycles in Planar Graphs Using Separators 1986 7 ALGORITHMS Brinck, On Deletion in Threaded Binary Trees 1986 7 ALGORITHMS Hester & Hirschberg & Huang & Wong, Faster Construction of Optimal Binary Split Trees 1986 7 ALGORITHMS Robson, Algorithms for Maximum Independent Sets 1986 7 ALGORITHMS Paterson & Yao, Point Retrieval for Polygons 1986 ALGORITHMS Arkin & Papadimitriou, On the Complexity of Circulations 1986 ALGORITHMS Asano & Asano & Pinter, Polygon Triangulation: Efficiency and Minimality 1986 ALGORITHMS Atallah, Computing the Convex Hull of Line Intersections 1986 ALGORITHMS Cole, Searching and Storing Similar Lists 1986 ALGORITHMS Dyer & Frieze, Planar 3DM Is NP-Complete 1986 ALGORITHMS Friesen & Langston, Evaluation of a MULTIFIT-Based Scheduling Algorithm 1986 ALGORITHMS Hochbaum & Nishizeki & Shmoys, A Better than ``Best Possible'' Algorithm to Edge Color Multigraphs 1986 ALGORITHMS Jerrum, A Compact Representation for Permutation Groups 1986 ALGORITHMS O'Rourke & Aggarwal & Maddila & Baldwin, An Optimal Algorithm for Finding Minimal Enclosing Triangles 1986 ALGORITHMS Raghavan & Cohoon & Sahni, Single Bend Wiring 1986 ALGORITHMS Sedgewick, A New Upper Bound for Shellsort 1986 ALGORITHMS Skowronska & Syslo & Zamfirescu, An Algorithmic Characterization of Total Digraphs 1986 ALGORITHMS Snir, Depth-Size Trade-offs for Parallel Prefix Computation 1986 ALGORITHMS Tiwari, An Efficient Parallel Algorithm for Shifting the Root of a Depth First Spanning Tree 1986 ALGORITHMS Veldhorst, The Optimal Representation of Disjoint Iso-oriented Rectangles in Two-Dimensional Trees 1986 ALGORITHMS Warshauer, Conway's Parallel Sorting Algorithm 1986 ALGORITHMS Werman & Peleg & Melter & Kong, Bipartite Graph Matching for Points on a Line or a Circle 1986 ALGORITHMS Wolfson, An Algorithm for Early Unlocking of Entities in Database Transactions 1985 ALGORITHMS Alekseyev, On the Complexity of Some Algorithms of Matrix Multiplication 1985 ALGORITHMS Anstee, An Algorithmic Proof of Tutte's f-Factor Theorem 1985 ALGORITHMS Bagchi & Srimani, Weighted Heuristic Search in Networks 1985 ALGORITHMS Baker, A New Proof for the First-Fit Decreasing Bin-Packing Algorithm 1985 ALGORITHMS Bender & Wilf, A Theoretical Analysis of Backtracking in the Graph Coloring Problem 1985 ALGORITHMS Bollobas & Simon, Repeated Random Insertion into a Priority Queue 1985 ALGORITHMS Borwein, On the Complexity of Calculating Factorials 1985 ALGORITHMS Devroye, The Expected Length of the Longest Probe Sequence for Bucket Searching When the Distribution Is Not Uniform 1985 ALGORITHMS Dobkin & Kirkpatrick, A Linear Algorithm for Determining the Separation of Convex Polyhedra 1985 ALGORITHMS Dobkin & Munro, Efficient Uses of the Past 1985 ALGORITHMS Domanski & Anshel, The Complexity of Dehn's Algorithm for Word Problems in Groups 1985 ALGORITHMS Edelsbrunner & Overmars, Batched Dynamic Solutions to Decomposable Searching Problems 1985 ALGORITHMS Edelsbrunner, Computing the Extreme Distances between Two Convex Polygons 1985 ALGORITHMS Er, The Complexity of the Generalised Cyclic Towers of Hanoi Problem 1985 ALGORITHMS Farber & Keil, Domination in Permutation Graphs 1985 ALGORITHMS Gavril & Schoenheim, Constructing Trees with Prescribed Cardinalities for the Components of Their Vertex Deleted Subgraphs 1985 ALGORITHMS Hassin & Megiddo, An Optimal Algorithm for Finding All the Jumps of a Monotone Step-Function 1985 ALGORITHMS Irving, An Efficient Algorithm for the ``Stable Roommates'' Problem 1985 ALGORITHMS Itai & Rodeh, Scheduling Transmissions in a Network 1985 ALGORITHMS Kantor, Polynomial-Time Algorithms for Finding Elements of Prime Order and Sylow Subgroups 1985 ALGORITHMS Klee & Laskowski, Finding the Smallest Triangles Containing a Given Convex Polygon 1985 ALGORITHMS Knuth, An Analysis of Optimum Caching 1985 ALGORITHMS Knuth, Dynamic Huffman Coding 1985 ALGORITHMS Linial & Saks, Searching Ordered Structures 1985 ALGORITHMS Megiddo, Partitioning with Two Lines in the Plane 1985 ALGORITHMS Miller & Orlin, NP-Completeness for Minimizing Maximum Edge Length in Grid Embeddings 1985 ALGORITHMS Nakayama & Nishizeki & Saito, Lower Bounds for Combinatorial Problems on Graphs 1985 ALGORITHMS Noshita, A Theorem on the Expected Complexity of Dijkstra's Shortest Path Algorithm 1985 ALGORITHMS O'Dunlaing & Yap, A ``Retraction'' Method for Planning the Motion of a Disc 1985 ALGORITHMS Poblete & Munro, The Analysis of a Fringe Heuristic for Binary Search Trees 1985 ALGORITHMS Proskurowski & Ruskey, Binary Tree Gray Codes 1985 ALGORITHMS Stout, Pyramid Computer Solutions of the Closest Pair Problem 1985 ALGORITHMS Swart, Finding the Convex Hull Facet by Facet 1985 ALGORITHMS Szymanski, Hash Table Reorganization 1985 ALGORITHMS Tamminen, Two Levels Are as Good as Any 1985 ALGORITHMS Ukkonen, Finding Approximate Patterns in Strings 1985 ALGORITHMS Yao, On Optimal Arrangements of Keys with Double Hashing 1984 ALGORITHMS Anstee & Farber, Characterizations of Totally Balanced Matrices 1984 ALGORITHMS Assmann & Johnson & Kleitman & Leung, On a Dual Version of the One-Dimensional Bin Packing Problem 1984 ALGORITHMS Boshernitzan & Fraenkel, A Linear Algorithm for Nonhomogeneous Spectra of Numbers 1984 ALGORITHMS Corneil & Goldberg, A Non-factorial Algorithm for Canonical Numbering of a Graph 1984 ALGORITHMS Dolev & Warmuth, Scheduling Precedence Graphs of Bounded Height 1984 ALGORITHMS Gabow & Tarjan, Efficient Algorithms for a Family of Matroid Intersection Problems 1984 ALGORITHMS Gilbert & Hutchinson & Tarjan, A Separator Theorem for Graphs of Bounded Genus 1984 ALGORITHMS Gonnet & Munro, The Analysis of Linear Probing Sort by the Use of a New Mathematical Transform 1984 ALGORITHMS Gurari & Sudborough, Improved Dynamic Programming Algorithms for Bandwidth Minimization and the MinCut Linear Arrangement Problem 1984 ALGORITHMS Gusfield, Bounds for Naive Multiple Machine Scheduling with Release Times and Deadlines 1984 ALGORITHMS Guting, An Optimal Contour Algorithm for Iso-oriented Rectangles 1984 ALGORITHMS Hakimi & Schmeichel, An Adaptive Algorithm for System Level Diagnosis 1984 ALGORITHMS Hofri, A Probabilistic Analysis of the Next-Fit Bin Packing Algorithm 1984 ALGORITHMS Huang & Wong, Optimal Binary Split Trees 1984 ALGORITHMS Knott, Direct-Chaining with Coalescing Lists 1984 ALGORITHMS Larson, Analysis of Hashing with Chaining in the Prime Area 1984 ALGORITHMS Lengauer, On the Solution of Inequality Systems Relevant to IC-Layout 1984 ALGORITHMS Leung, Fast Algorithms for Generating All Maximal Independent Sets of Interval, Circular-Arc and Chordal Graphs 1984 ALGORITHMS Main & Lorentz, An O(n log n) Algorithm for Finding All Repetitions in a String 1984 ALGORITHMS Papadimitriou & Vazirani, On Two Geometric Problems Related to the Traveling Salesman Problem 1984 ALGORITHMS Perl, Optimum Split Trees 1984 ALGORITHMS Plaisted, Heuristic Matching for Graphs Satisfying the Triangle Inequality 1984 ALGORITHMS Ramanan & Deogun & Liu, A Personnel Assignment Problem 1984 ALGORITHMS Ramanan & Hyafil, New Algorithms for Selection 1984 ALGORITHMS Remmel & Whitney, Multiplying Schur Functions 1984 ALGORITHMS Rosentiehl & Tarjan, Gauss Codes, Planar Hamiltonian Graphs, and Stack-Sortable Permutations 1984 ALGORITHMS Semba, An Efficient Algorithm for Generating All k-Subsets (1 <= k <= m <= n) of the Set {1, 2,..., n} in Lexicographical Order 1984 ALGORITHMS Seroussi & Lempel, On Symmetric Algorithms for Bilinear Forms over Finite Fields 1984 ALGORITHMS Shamir & Upfal, Sequential and Distributed Graph Coloring Algorithms with Performance Analysis in Random Graph Spaces 1984 ALGORITHMS Soisalon-Soininen & Wood, Optimal Algorithms to Compute the Closure of a Set of Iso-rectangles 1984 ALGORITHMS Tucker & Wilson, An O(N^2) Algorithm for Coloring Perfect Planar Graphs 1984 ALGORITHMS Valiant, Short Monotone Formulae for the Majority Function 1984 ALGORITHMS Weinberger, Finding the Number of Factors of a Polynomial 1984 ALGORITHMS Wormald, Generating Random Regular Graphs 1983 ALGORITHMS Becker & Perl, Shifting Algorithms for Tree Partitioning with General Weighting Functions 1983 ALGORITHMS Beynon, A Formal Account of Some Elementary Continued Fraction Algorithms 1983 ALGORITHMS Bhattacharya & Toussaint, Efficient Algorithms for Computing the Maximum Distance between Two Finite Planar Sets 1983 ALGORITHMS Butler, Computing Normalizers in Permutation Groups 1983 ALGORITHMS Dixon & Wilf, The Random Selection of Unlabeled Graphs 1983 ALGORITHMS Duval, Factorizing Words over an Ordered Alphabet 1983 ALGORITHMS Feig, Certain Systems of Bilinear Forms Whose Minimal Algorithms Are All Quadratic 1983 ALGORITHMS Feig, Minimal Algorithms for Bilinear Forms May Have Divisions 1983 ALGORITHMS Frederickson & Johnson, Finding kth Paths and p-Centers by Generating and Searching Good Data Structures 1983 ALGORITHMS Graham & Yao, Finding the Convex Hull of a Simple Polygon 1983 ALGORITHMS Guenoche, Random Spanning Tree 1983 ALGORITHMS Gupta & Lee & Wong, Ranking and Unranking of B-Trees 1983 ALGORITHMS Hell & Rosenfeld, The Complexity of Finding Generalized Paths in Tournaments 1983 ALGORITHMS Hu & Shing, Multiterminal Flows in Outerplanar Networks 1983 ALGORITHMS Imai & Asano, Finding the Connected Components and a Maximum Clique of an Intersection Graph of Rectangles in the Plane 1983 ALGORITHMS Kalvin & Varol, On the Generation of All Topological Sortings 1983 ALGORITHMS Lai & Sahni, Nearly On-Line Scheduling of Multiprocessor Systems with Memories 1983 ALGORITHMS Leven & Galil, NP Completeness of Finding the Chromatic Index of Regular Graphs 1983 ALGORITHMS Lloyd, An O(n log m) Algorithm for the Josephus Problem 1983 ALGORITHMS Lozinskii, An Algorithm for Parallel Evaluation of Functions 1983 ALGORITHMS Minieka & Patel, On Finding the Core of a Tree with a Specified Length 1983 ALGORITHMS Overmars, Corrigendum: Dynamization of Order Decomposable Set Problems 1983 ALGORITHMS Pan, The Additive and Logical Complexities of Linear and Bilinear Arithmetic Algorithms 1983 ALGORITHMS Pritchard, Fast Compact Prime Number Sieves (Among Others) 1983 ALGORITHMS Rangan, On the Minimum Number of Additions Required to Compute a Quadratic Form 1983 ALGORITHMS Vishkin, Implementation of Simultaneous Memory Address Access in Models That Forbid It 1982 ALGORITHMS Aigner, Parallel Complexity of Sorting Problems 1982 ALGORITHMS Akl & Meijer, On the Average-Case Complexity of ``Bucketing'' Algorithms 1982 ALGORITHMS Baker & Coffman, A Two-Dimensional Bin-Packing Model of Preemptive, FIFO Storage Allocation 1982 ALGORITHMS Dolev & Klawe & Rodeh, An O(n log n) Unidirectional Distributed Algorithm for Extrema Finding in a Circle 1982 ALGORITHMS Dolev, The Byzantine Generals Strike Again 1982 ALGORITHMS Franzblau & Zeilberger, A Bijective Proof of the Hook-Length Formula 1982 ALGORITHMS Fredman & Volper, The Complexity of Partial Match Retrieval in a Dynamic Setting 1982 ALGORITHMS Goldberg, Minimal String Difference Encodings 1982 ALGORITHMS Ibarra & Moran & Hui, A Generalization of the Fast LUP Matrix Decomposition Algorithm and Applications 1982 ALGORITHMS Iliopoulos, Analysis of an Algorithm for Composition of Binary Quadratic Forms 1982 ALGORITHMS Klingsberg, A Gray Code for Compositions 1982 ALGORITHMS Knott, Fixed-Bucket Binary Storage Trees 1982 ALGORITHMS Lee & Preparata, An Improved Algorithm for the Rectangle Enclosure Problem 1982 ALGORITHMS Leiberherr, Algorithmic Extremal Problems in Combinatorial Optimization 1982 ALGORITHMS Lipski & Preparata, Corrigendum: Finding the Contour of a Union of Iso-Oriented Rectangles 1982 ALGORITHMS Mignotte, Identification of Algebraic Numbers 1982 ALGORITHMS Nakajima & Hakimi, Complexity Results for Scheduling Tasks with Discrete Starting Times 1982 ALGORITHMS Rosen, Robust Linear Algorithms for Cutsets 1982 ALGORITHMS Schnorr, Refined Analysis and Improvements on Some Factoring Algorithms 1982 ALGORITHMS Shiloach & Vishkin, An O(log n) Parallel Connectivity Algorithm 1982 ALGORITHMS Shiloach & Vishkin, An O(n^2 log n) Parallel MAX-FLOW Algorithm 1982 ALGORITHMS Steele & Yao, Lower Bounds for Algebraic Decision Trees 1982 ALGORITHMS Tolimieri, A Nonquadratic Minimal Algorithm for a System of Quadratic Forms 1982 ALGORITHMS Vaishnavi & Wood, Rectilinear Line Segment Intersection, Layered Segment Trees, and Dynamization 1982 ALGORITHMS Vitter, Deletion Algorithms for Hashing That Preserve Randomness 1981 ALGORITHMS Allison, Generating Coset Representatives for Permutation Groups 1981 ALGORITHMS Baker & Brown & Katseff, A 5/4 Algorithm for Two-Dimensional Packing 1981 ALGORITHMS Bar-Yehuda & Even, A Linear-Time Approximation Algorithm for the Weighted Vertex Cover Problem 1981 ALGORITHMS Burge, Stacks in a Two-Level Store 1981 ALGORITHMS Cantor, Irreducible Polynomials with Integral Coefficients Have Succinct Certificates 1981 ALGORITHMS Chiba & Nishizeki & Saito, A Linear 5-Coloring Algorithm of Planar Graphs 1981 ALGORITHMS Eades & Staples, On Optimal Trees 1981 ALGORITHMS Ehrlich, Searching and Sorting Real Numbers 1981 ALGORITHMS Even & Goldreich, The Minimum-Length Generator Sequence Problem Is NP-Hard 1981 ALGORITHMS Feig, On Systems of Bilinear Forms Whose Minimal Division-Free Algorithms Are All Bilinear 1981 ALGORITHMS Frank, A Weighted Matroid Intersection Algorithm 1981 ALGORITHMS Fredman, The Spanning Bound as a Measure of Range Query Complexity 1981 ALGORITHMS Gindy & Avis, A Linear Algorithm for Computing the Visibility Polygon from a Point 1981 ALGORITHMS Hentzel & Hogben, Exhaustive Checking of Sparse Algebras 1981 ALGORITHMS Hu & Shing, An O(n) Algorithm to Find a Near-Optimum Partition of a Convex Polygon 1981 ALGORITHMS Klarner, An Algorithm to Determine When Certain Sets Have 0-Density 1981 ALGORITHMS Lee & Wong, Finding Intersection of Rectangles by Range Search 1981 ALGORITHMS Lipski & Papadimitriou, A Fast Algorithm for Testing for Safety and Detecting Deadlocks in Locked Transaction 1981 ALGORITHMS Lipski & Preparata, Erratum: Finding the Contour of a Union of Iso-Oriented Rectangles 1981 ALGORITHMS Lipski & Preparata, Segments, Rectangles, Contours 1981 ALGORITHMS Melville, A Time/Space Tradeoff for In-Place Array Permutation 1981 ALGORITHMS Moran & Perl, The Complexity of Identifying Redundant and Essential Elements 1981 ALGORITHMS Olivos, On Vectorial Addition Chains 1981 ALGORITHMS Overmars, Dynamization of Order Decomposable Set Problems 1981 ALGORITHMS Pan, A Unified Approach to the Analysis of Bilinear Algorithms 1981 ALGORITHMS Pan, The Bit-Complexity of Arithmetic Algorithms 1981 ALGORITHMS Pearl, A Space-Efficient On-Line Method of Computing Quantile Estimates 1981 ALGORITHMS Ralston, A New Memoryless Algorithm for De Bruijn Sequences 1981 ALGORITHMS Shiloach & Vishkin, Finding the Maximum, Merging, and Sorting in a Parallel Computation Model 1981 ALGORITHMS Shiloach, Fast Canonization of Circular Strings 1981 ALGORITHMS van Leeuwen & Wood, The Measure Problem for Rectangular Ranges in d-Space 1981 ALGORITHMS Wilf, The Uniform Selection of Free Trees 1980 ALGORITHMS Aspvall & Stone, Khachiyan's Linear Programming Algorithm 1980 ALGORITHMS Aspvall, Recognizing Disguised NR(1) Instances of the Satisfiability Problem 1980 ALGORITHMS Bentley & Saxe, Decomposable Searching Problems. I. Static-to-Dynamic Transformation 1980 ALGORITHMS Bentley, A Parallel Algorithm for Constructing Minimum Spanning Trees 1980 ALGORITHMS Brent & Gustavson & Yun, Fast Solution of Toeplitz Systems of Equations and Computation of Pade Approximants 1980 ALGORITHMS Diaconis, Average Running Time of the Fast Fourier Transform 1980 ALGORITHMS Flajolet & Francon & Vuillemin, Sequence of Operations Analysis for Dynamic Data Structures 1980 ALGORITHMS Johnson, Subadditive Lifting Methods for Partitioning and Knapsack Problems 1980 ALGORITHMS Karp & Tarjan, Linear Expected-Time Algorithms for Connectivity Problems 1980 ALGORITHMS Klingsberg, A Combinatorial Family of Labeled Trees 1980 ALGORITHMS Lagarias, Worst-Case Complexity Bounds for Algorithms in the Theory of Integral Quadratic Forms 1980 ALGORITHMS Lipski & Preparata, Finding the Contour of a Union of Iso-Oriented Rectangles 1980 ALGORITHMS Monier, Combinatorial Solutions of Multidimensional Divide-and-Conquer Recurrences 1980 ALGORITHMS Morgan & Slater, A Linear Algorithm for a Core of a Tree 1980 ALGORITHMS Pan, Convolution of Vectors over the Real Field of Constants by Evaluation--Interpolation Algorithms 1980 ALGORITHMS Sagan, On Selecting a Random Shifted Young Tableau 1980 ALGORITHMS Sellers, The Theory and Computation of Evolutionary Distances: Pattern Recognition 1980 ALGORITHMS Yao, An Analysis of (h,k,1)-Shellsort 1997 17 ALGRTHMICA Berman & DasGupta, Complexities of Efficient Solutions of Rectilinear Polygon Cover Problems 1997 17 ALGRTHMICA Rimon, Construction of C-Space Roadmaps from Local Sensory Data. What Should the Sensors Look For? 1997 17 ALGRTHMICA Pellegrini, On Counting Pairs of Intersecting Segments and Off-Line Triangle Range Searching 1997 17 ALGRTHMICA Han & Pan & Reif, Efficient Parallel Algorithms for Computing All Pair Shortest Paths in Directed Graphs 1997 17 ALGRTHMICA De Agostino & Petreschi & Sterbini, An O(n^3) Recognition Algorithm for Bithreshold Graphs 1997 17 ALGRTHMICA Hambrusch & Tu, New Algorithms for Minimizing the Longest Wire Length During Circuit Compaction 1997 17 ALGRTHMICA Alon & Srinivasan, Improved Parallel Approximation of a Class of Integer Programming Problems 1997 17 ALGRTHMICA Alon & Yuster & Zwick, Finding and Counting Given Length Cycles 1997 17 ALGRTHMICA Kaufmann & Sibeyn, Randomized Multipacket Routing and Sorting on Meshes 1997 17 ALGRTHMICA Chazelle & Palios, Decomposing the Boundary of a Nonconvex Polyhedron 1997 17 ALGRTHMICA Chen, Efficient Parallel Recognition of Some Circular Arc Graphs, II 1997 17 ALGRTHMICA Guha & Suzuki, Proximity Problems for Points on a Rectilinear Plane with Rectangular Obstacles 1997 17 ALGRTHMICA Bazzi & Neiger, The Complexity of Almost-Optimal Simultaneous Coordination 1997 17 ALGRTHMICA Wenger, Randomized Quickhull 1997 17 ALGRTHMICA Greenberg & Shih, Minimizing Channel Density with Movable Terminals 1997 17 ALGRTHMICA Granot & Skorin-Kapov & Tamir, Using Quadratic Programming to Solve High Multiplicity Scheduling Problems on Parallel Machines 1997 17 ALGRTHMICA Avnaim & Boissonnat & Devillers & Preparata & Yvinec, Evaluating Signs of Determinants Using Single-Precision Arithmetic 1997 17 ALGRTHMICA Bhuyan & Deogun & Raghavan, Algorithms for the Boundary Selection Problem 1997 17 ALGRTHMICA Alonso & Remy & Schott, A Linear-Time Algorithm for the Generation of Trees 1997 17 ALGRTHMICA Mehlhorn & Sundar & Uhrig, Maintaining Dynamic Sequences under Equality Tests in Polylogarithmic Time 1997 17 ALGRTHMICA Cohen & Eades & Lin & Ruskey, Three-Dimensional Graph Drawing 1997 17 ALGRTHMICA Romer & Rosier, An Algorithm Reminiscent of Euclidean-gcd for Computing a Function Related to Pinwheel Scheduling 1997 17 ALGRTHMICA Dixon & Tarjan, Optimal Parallel Verification of Minimum Spanning Trees in Logarithmic Time 1997 17 ALGRTHMICA Dehne & Klein, ``The Big Sweep'': On the Power of the Wavefront Approach to Voronoi Diagrams 1997 17 ALGRTHMICA Arya & Smid, Efficient Construction of a Bounded-Degree Spanner with Low Weight 1997 17 ALGRTHMICA Hagerup & Kutylowski, Fast Integer Merging on the EREW PRAM 1997 17 ALGRTHMICA Bang-Jensen & El Haddad & Manoussakis & Przytycka, Parallel Algorithms for the Hamiltonian Cycle and Hamiltonian Path Problems in Semicomplete Bipartite Digraphs 1996 16 ALGRTHMICA Flammini & Gambosi & Salomone, Interval Routing Schemes 1996 16 ALGRTHMICA Cole & Goodrich & O Dunlaing, A Nearly Optimal Deterministic Parallel Voronoi Diagram Algorithm 1996 16 ALGRTHMICA Avis, Generating Rooted Triangulations Without Repetitions 1996 16 ALGRTHMICA Johnson & Metaxas, Optimal Algorithms for the Single and Multiple Vertex Updating Problems of a Minimum Spanning Tree 1996 16 ALGRTHMICA Weiss, Shellsort with a Constant Number of Increments 1996 16 ALGRTHMICA Luby, Introduction to Special Issue on Randomized and Derandomized Algorithms 1996 16 ALGRTHMICA Zuckerman, Simulating BPP Using a General Weak Random Source 1996 16 ALGRTHMICA Jerrum & Vazirani, A Mildly Exponential Approximation Algorithm for the Permanent 1996 16 ALGRTHMICA Mihail & Winkler, On the Number of Eulerian Orientations of a Graph 1996 16 ALGRTHMICA Luby & Velickovic, On Deterministic Approximation of DNF 1996 16 ALGRTHMICA Alon & Naor, Derandomization, Witnesses for Boolean Matrix Multiplication and Construction of Perfect Hash Functions 1996 16 ALGRTHMICA Mulmuley, Randomized Geometric Algorithms and Pseudorandom Generators 1996 16 ALGRTHMICA Seidel & Aragon, Randomized Search Trees 1996 16 ALGRTHMICA Matousek & Sharir & Welzl, A Subexponential Bound for Linear Programming 1996 16 ALGRTHMICA Karp & Luby & Meyer auf der Heide, Efficient PRAM Simulation on a Distributed Memory Machine 1996 16 ALGRTHMICA Alt & Guibas & Mehlhorn & Karp & Wigderson, A Method for Obtaining Randomized Algorithms with Small Tail Probabilities 1996 16 ALGRTHMICA Sunder & He, An NC Algorithm for Finding a Minimum Weighted Completion Time Schedule on Series Parallel Graphs 1996 16 ALGRTHMICA Giammarresi & Italiano, Decremental 2- and 3-Connectivity on Planar Graphs 1996 16 ALGRTHMICA Iliopoulos & Moore & Park, Covering a String 1996 16 ALGRTHMICA Ambainis, Communication Complexity in a 3-Computer Model 1996 16 ALGRTHMICA Wang & Jiang & Lawler, Approximation Algorithms for Tree Alignment with a Given Phylogeny 1996 16 ALGRTHMICA Edahiro, Equispreading Tree in Manhattan Distance 1996 16 ALGRTHMICA Takahashi & Suzuki & Nishizeki, Shortest Noncrossing Paths in Plan Graphs 1996 16 ALGRTHMICA Deng & Papadimitriou, Competitive Distributed Decision-Making 1996 16 ALGRTHMICA Munro & Raman, Fast Stable In-Place Sorting with O(n) Data Moves 1996 16 ALGRTHMICA Huang & Liu & Verma, A New Combinatorial Approach to Optimal Embeddings of Rectangles 1996 16 ALGRTHMICA Nodine & Goodrich & Vitter, Blocking for External Graph Searching 1996 16 ALGRTHMICA Choy & Fagin & Stockmeyer, Efficiently Extendible Mappings for Balanced Data Distribution 1996 16 ALGRTHMICA Mehlhorn & Mutzel, On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm 1996 16 ALGRTHMICA Kant, Drawing Planar Graphs Using the Canonical Ordering 1996 16 ALGRTHMICA Junger & Mutzel, Maximum Planar Subgraphs and Nice Embeddings: Practical Layout Tools 1996 16 ALGRTHMICA Eades & Whitesides, The Realization Problem for Euclidean Minimum Spanning Trees is NP-Hard 1996 16 ALGRTHMICA Bose & Lenhart & Liotta, Characterizing Proximity Trees 1996 16 ALGRTHMICA Pach & Shahrokhi & Szegedy, Applications of the Crossing Number 1996 16 ALGRTHMICA Shahrokhi & Szekely & Sykora & Vrt'o, Drawings of Graphs on Surfaces with Few Crossings 1996 15 ALGRTHMICA Cheriyan & Mehlhorn, Algorithms for Dense Graphs and Networks on the Random Access Computer 1996 15 ALGRTHMICA Pan & Shi & Liu, Area Minimization for Hierarchical Floorplans 1996 15 ALGRTHMICA Cai & Kong, Nonpreemptive Scheduling of Periodic Tasks in Uni- and Multiprocessor Systems 1996 15 ALGRTHMICA Baruah & Cohen & Plaxton & Varvel, Proportionate Progress: A Notion of Fairness in Resource Allocation 1996 15 ALGRTHMICA Agarwal & van Kreveld, Connected Component and Simple Polygon Intersection Searching 1996 15 ALGRTHMICA Balas & Xue, Weighted and Unweighted Maximum Clique Algorithms with Upper Bounds from Fractional Coloring 1996 15 ALGRTHMICA Meyer auf der Heide & Oesterdiekhoff & Wanka, Strongly Adaptive Token Distribution 1996 15 ALGRTHMICA Chazelle & Edelsbrunner & Guibas & Sharir & Stolfi, Lines in Space: Combinatorics and Algorithms 1996 15 ALGRTHMICA Frederickson, Searching Among Intervals and Compact Routing Tables 1996 15 ALGRTHMICA Sprugnoli, Recurrence Relations on Heaps 1996 15 ALGRTHMICA Apostolico & Preparata, Data Structures and Algorithms for the String Statistics Problem 1996 15 ALGRTHMICA Kuchem & Wagner & Wagner, Optimizing Area for Three-Layer Knock-Knee Channel Routing 1996 15 ALGRTHMICA Rubinfeld, Designing Checkers for Programs that Run in Parallel 1996 15 ALGRTHMICA Di Battista & Tamassia, On-Line Maintenance of Triconnected Components with SPQR-Trees 1996 15 ALGRTHMICA Krizanc & Narayanan & Raman, Fast Deterministic Selection on Mesh-Connected Processor Arrays 1996 15 ALGRTHMICA Nazareth, The Implementation of Linear Programming Algorithms 1996 15 ALGRTHMICA Provan & Shier, A Paradigm for Listing (s,t)-Cuts in Graphs 1996 15 ALGRTHMICA Kalpakis & Yesha, Scheduling Tree dags on Parallel Architectures 1996 15 ALGRTHMICA Zhang, A Constrained Edit Distance Between Unordered Labeled Trees 1996 15 ALGRTHMICA Edelsbrunner & Shah, Incremental Topological Flipping Works for Regular Triangulations 1996 15 ALGRTHMICA Easwarakumar & Krishnan & Rangan & Seshadri, Optimal Parallel Algorithm for Finding st-Ambitus of a Planar Biconnected Graph 1996 15 ALGRTHMICA Mishra, Bidirectional Edges Problem: Part I--A Simple Algorithm 1996 15 ALGRTHMICA Anderson & Beame & Brisson, Parallel Algorithms for Arrangements 1996 15 ALGRTHMICA Goodrich & Ghouse & Bright, Sweep Methods for Parallel Computational Geometry 1996 15 ALGRTHMICA Tamassia & Vitter, Optimal Cooperative Search in Fractional Cascaded Data Structures 1996 15 ALGRTHMICA Kirkpatrick & Przytycka, Parallel Construction of Binary Trees with Near Optiimal Weighted Path Length 1996 15 ALGRTHMICA Lisper, Preconditioning Index Set Transformtions for Time-Optimal Affine Scheduling 1996 15 ALGRTHMICA Maley, Testing Homotopic Routability Under Polygonal Wiring Rules 1996 15 ALGRTHMICA Prasanna & Musicus, The Optimal Control Approach to Generalized Multiprocessor Scheduling 1996 15 ALGRTHMICA Wu & Manber & Myers, A Subquadratic Algorithm for Approximate Limited Expression Matching 1996 15 ALGRTHMICA Tang & Zhang & Wu, Fast Algorithms for Minimum Matrix Norm with Application in Computer Graphics 1996 15 ALGRTHMICA Dillencourt & Samet, Using Topological Sweep to Extract the Boundaries of Regions in Maps Represented by Region Quadtrees 1995 14 ALGRTHMICA Donald & Xavier, Provably Good Approximation Algorithms for Optimal Kinodynamic Planning: Robots with Decoupled Dynamics Bounds 1995 14 ALGRTHMICA Donald & Xavier, Provably Good Approximation Algorithms for Optimal Kinodynamic Planning for Cartesian Robots and Open-Chain Manipulators 1995 14 ALGRTHMICA Chen & Ierardi, The Complexity of Oblivious Plans for Orienting and Distinguishing Polygonal Parts 1995 14 ALGRTHMICA Kao & Teng & Toyama, An Optimal Parallel Algorithm for Planar Cycle Separators 1995 14 ALGRTHMICA Yao, Minimean Optimal Key Arrangements in Hash Tables 1995 14 ALGRTHMICA Atallah & Chen & Lee, An Optimal Algorithm for Shortest Paths on Weighted Interval and Circular-Arc Graphs, with Applications 1995 14 ALGRTHMICA Leighton & Makedon & Tollis, A 2n-2 Step Algorithm for Routing in an n x n Array with Constant-Size Queues 1995 14 ALGRTHMICA Khuller & Raghavachari & Young, Balancing Minimum Spanning Trees and Shortest-Path Trees 1995 14 ALGRTHMICA Subramanian & Tamassia & Vitter, An Efficient Parallel Algorithm for Shortest Paths in Planar Layered Digraphs 1995 14 ALGRTHMICA Panny & Prodinger, Bottom-Up Mergesort--a Detailed Analysis 1995 14 ALGRTHMICA Breslauer & Galil, Finding All Periods and Initial Palindromes of a String in Parallel 1995 14 ALGRTHMICA Chou & Woo, A Linear-Time Algorithm for Constructing a Circular Visibility Diagram 1995 14 ALGRTHMICA McConnell, An O(n^2) Incremental Algorithm for Modular Decomposition of Graphs and 2-Structures 1995 14 ALGRTHMICA Ukkonen, On-Line Construction of Suffix Trees 1995 14 ALGRTHMICA Lingas & Maheshwari & Sack, Optimal Parallel Algorithms for Rectilinear Link-Distance Problems 1995 14 ALGRTHMICA Borie, Generation of Polynomial-Time Algorithms for Some Optimization Problems on Tree-Decomposable Graphs 1995 14 ALGRTHMICA Cai & Corneil, Isomorphic Tree Spanner Problems 1995 14 ALGRTHMICA Dietz & Mehlhorn & Raman & Uhrig, Lower Bounds for Set Intersection Queries 1995 14 ALGRTHMICA Amato & Preparata, A Time-Optimal Parallel Algorithm for Three-Dimensional Convex Hulls 1995 14 ALGRTHMICA Amato, Finding a Closest Visible Vertex Pair Between Two Polygons 1995 14 ALGRTHMICA Schuierer & Wood, Staircase Visibility and Computation of Kernels 1995 14 ALGRTHMICA Choi & Shin & Chwa, Characterizing and Recognizing the Visibility Graph of a Funnel-Shaped Polygon 1995 14 ALGRTHMICA Chlebus & Diks & Kowaluk, O(log log n)-Time Integer Geometry on the CRCW PRAM 1995 14 ALGRTHMICA Goldman & Sloan, Can PAC Learning Algorithms Tolerate Random Attribute Noise? 1995 14 ALGRTHMICA Knight & Myers, Approximate Regular Expression Pattern Matching with Concave Gap Penalties 1995 13 ALGRTHMICA Henzinger, Fully Dynamic Biconnectivity in Graphs 1995 13 ALGRTHMICA Schweikard & Wilson, Assembly Sequences for Polyhedra 1995 13 ALGRTHMICA He, An Efficient Parallel Algorithm for Finding Rectangular Duals of Plane Triangular Graphs 1995 13 ALGRTHMICA Habib & Huchard & Spinrad, A Linear Algorithm To Decompose Inheritance Graphs Into Modules 1995 13 ALGRTHMICA de la Torre & Greenlaw & Schaffer, Optimal Edge Ranking of Trees in Polynomial Time 1995 13 ALGRTHMICA Crochemore & Rytter, Squares, Cubes, and Time-Space Efficient String Searching 1995 13 ALGRTHMICA McGeoch, All-Pairs Shortest Paths and the Essential Subgraph 1995 13 ALGRTHMICA Atkinson & Vaidya, Using Geometry To Solve the Transportation Problem in the Plane 1995 13 ALGRTHMICA Eppstein, Asymptotic Speed-Ups in Constructive Solid Geometry 1995 13 ALGRTHMICA Lazanas & Latombe, Landmark-Based Robot Navigation 1995 13 ALGRTHMICA Agarwal & Matousek, Dynamic Half-Space Range Reporting and Its Applications 1995 13 ALGRTHMICA Bruschi & Ravasio, Random Parallel Algorithms for Finding Exact Branchings, Perfect Matchings, and Cycles 1995 13 ALGRTHMICA Junger & Pulleyblank, New Primal and Dual Matching Heuristics 1995 13 ALGRTHMICA Du, On Greedy Heuristics for Steiner Minimum Trees 1995 13 ALGRTHMICA de Rezende & Lee, Point Set Pattern Matching in d-Dimensions 1995 13 ALGRTHMICA Cohen & Tamassia, Dynamic Expression Trees 1995 13 ALGRTHMICA Fellows & Kratochvil & Middendorf & Pfeiffer, The Complexity of Induced Minors and Related Problems 1995 13 ALGRTHMICA Humenik & Matthews & Stephens & Yesha, A Lower Bound on the Probability of Conflict Under Nonuniform Access in Database Systems 1995 13 ALGRTHMICA Lenhof & Smid, Maintaining the Visibility Map of Spheres While Moving the Viewpoint on a Circle at Infinity 1995 13 ALGRTHMICA Mahmoud, The Joint Distribution of the Three Types of Nodes in Uniform Binary Trees 1995 13 ALGRTHMICA Kececioglu & Myers, Combinatorial Algorithms for DNA Sequence Assembly 1995 13 ALGRTHMICA Alizadeh & karp & Newberg & Weisser, Physical Mapping of Chromosomes: A Combinatorial Problem in Molecular Biology 1995 13 ALGRTHMICA Pevzner, DNA Physical Mapping and Alternating Eulerian Cycles in Colored Graphs 1995 13 ALGRTHMICA Chao & Miller, Linear-Space Algorithms that Build Local Alignments from Fragments 1995 13 ALGRTHMICA Pevzner & Waterman, Multiple Filtration and Approximate Pattern Matching 1995 13 ALGRTHMICA Farach & Kannan & Warnow, A Robust Model for Finding Optimal Evolutionary Trees 1995 13 ALGRTHMICA Kececioglu & Sankoff, Exact and Approximation Algorithms for Sorting by Reversals, with Application to Genome Rearrangement 1995 13 ALGRTHMICA Knight & Myers, Super-Pattern Matching 1994 12 ALGRTHMICA Wee & Chainken & Ravi, Rectilinear Steiner Tree Heuristics and Minimum Spanning Tree Algorithms Using Geographic Nearest Neighbors 1994 12 ALGRTHMICA Adler & Beling, Polynomial Algorithms for Linear Programming over the Algebraic Numbers 1994 12 ALGRTHMICA Chen, Heuristic Sampling on DAGs 1994 12 ALGRTHMICA Bertolazzi & Di Battista & Liotta & Mannino, Upward Drawings of Triconnected Digraphs 1994 12 ALGRTHMICA Blankenagel & Guting, External Segment Trees 1994 12 ALGRTHMICA Heath & Pemmaraju, New Results for the Minimum Weight Triangulation Problem 1994 12 ALGRTHMICA Crochemore & Czumaj & Gasieniec & Jarominek & Lecroq & Plandowski & Rytter, Speeding Up Two String-Matching Algorithms 1994 12 ALGRTHMICA Baeza-Yates & Choffrut & Gonnet, On Boyer-Moore Automata 1994 12 ALGRTHMICA Chin & Poon, Performance Analysis of Some Simple Heuristics for Computing Longest Common Subsequences 1994 12 ALGRTHMICA Gusfield & Balasubramanian & Naor, Parametric Optimization of Sequence Alignment 1994 12 ALGRTHMICA Chang & Lawler, Sublinear Approximate String Matching and Biological Applications 1994 12 ALGRTHMICA Myers, A Sublinear Algorithm for Approximate Keyword Searching 1994 12 ALGRTHMICA Landau & Vishkin, Pattern Matching in a Digitized Image 1994 12 ALGRTHMICA Fraenkel & Klein, Complexity Aspects of Guessing Prefix Codes 1994 12 ALGRTHMICA Alpern & Carter & Feig & Selker, The Uniform Memory Hierarchy Model of Computation 1994 12 ALGRTHMICA Vitter & Shriver, Algorithms for Parallel Memory, I: Two-Level Memories 1994 12 ALGRTHMICA Vitter & Shriver, Algorithms for Parallel Memory, II: Hierarchical Multilevel Memories 1994 12 ALGRTHMICA Chin, Locality-Preserving Hash Functions for General Purpose Parallel Computation 1994 12 ALGRTHMICA Hellerstein & Gibson & Karp & Katz & Patterson, Coding Techniques for Handling Failures in Large Disk Arrays 1994 12 ALGRTHMICA Newberg & Wolfe, String Layouts for a Redundant Array of Inexpensive Disks 1994 12 ALGRTHMICA Blum & Evans & Gemmell & Kannan & Naor, Checking the Correctness of Memories 1994 12 ALGRTHMICA Nackman & Srinivasan, Point Placement Algorithms for Delaunay Triangulation of Polygonal Domains 1994 12 ALGRTHMICA Schwarz & Smid & Snoeyink, An Optimal Algorithm for the On-Line Closest-Pair Problem 1994 12 ALGRTHMICA de Berg & Halperin & Overmars & Snoeyink & van Kreveld, Efficient Ray Shooting and Hidden Surface Removal 1994 12 ALGRTHMICA Chazelle & Edelsbrunner & Grigni & Guibas & Hershberger & Sharir & Snoeyink, Ray Shooting in Polygons Using Geodesic Triangulations 1994 11 ALGRTHMICA Golin, A Provably Fast Linear-Expected-Time Maxima-Finding Algorithm 1994 11 ALGRTHMICA Young, The k-Server Dual and Loose Competitiveness for Paging 1994 11 ALGRTHMICA Karlin & Manasse & McGeoch & Owicki, Competitive Randomized Algorithms for Nonuniform Problems 1994 11 ALGRTHMICA Fiat & Rabani & Ravid & Schieber, A Deterministic O(k^3)-Competitive k-Server Algorithm for the Circle 1994 11 ALGRTHMICA Spencer, Provably Good Pattern Generators for a Random Pattern Test 1994 11 ALGRTHMICA Ramachandran & Yang, Finding the Closed Partition of a Planar Graph 1994 11 ALGRTHMICA Overmars & Sharir, An Improved Technique for Output-Sensitive Hidden Surface Removal 1994 11 ALGRTHMICA Papadimitriou & Rangan & Sideri, Designing Secure Communication Protocols from Trust Specifications 1994 11 ALGRTHMICA Booth & Westbrook, A Linear Algorithm for Analysis of Minimum Spanning and Shortest-Path Trees of Planar Graphs 1994 11 ALGRTHMICA Tuncel, On the Complexity of Preflow-Push Algorithms for Maximum-Flow Problems 1994 11 ALGRTHMICA Bern & Dobkin & Eppstein & Grossman, Visibility with a Moving Point of View 1994 11 ALGRTHMICA Eades & Wormald, Edge Crossings in Drawings of Bipartite Graphs 1994 11 ALGRTHMICA Epstein & Kavanagh & Knight & May & Nguyen & Sack, A Workbench for Computational Geometry 1994 11 ALGRTHMICA Khuller & Naor, Flow in Planar Graphs with Vertex Capacities 1994 11 ALGRTHMICA Radzik & Goldberg, Tight Bounds on the Number of Minimum-Mean Cycle Cancellations and Related Results 1994 11 ALGRTHMICA Iwano & Misono & Tezuka & Fujishige, A New Scaling Algorithm for the Maximum Mean Cut Problem 1994 11 ALGRTHMICA Pinto & Shamir, Efficient Algorithms for Minimum-Cost Flow Problems with Piecewise-Linear Convex Costs 1994 11 ALGRTHMICA Gusfield & Tardos, A Faster Parametric Minimum-Cut Algorithm 1994 11 ALGRTHMICA Feder, Network Flow and 2-Satisfiability 1994 11 ALGRTHMICA Cohen & Megiddo, Algorithms and Complexity Analysis for Some Flow Problems 1994 11 ALGRTHMICA Batagelj & Korenjak-Cerne & Klavzar, Dynamic Programming and Convex Clustering 1994 11 ALGRTHMICA Fleischer, A Tight Lower Bound for the Worst Case of Bottom-Up-Heapsort 1994 11 ALGRTHMICA Chazelle & Edelsbrunner & Guibas & Sharir, Algorithms for Bichromatic Line-Segment Problems and Polyhedral Terrains 1994 11 ALGRTHMICA Bar-Yehuda & Fogel, Variations on Ray Shooting 1994 11 ALGRTHMICA Jeuring, The Derivation of On-Line Algorithms, with an Application To Finding Palindromes 1994 11 ALGRTHMICA Agarwal & Sharir, Planar Geometric Location Problems 1994 11 ALGRTHMICA Ben-David & Borodin & Karp & Tardos & Wigderson, On the Power of Randomization in On-Line Algorithms 1994 11 ALGRTHMICA Reingold & Westbrook & Sleator, Randomized Competitive Algorithms for the List Update Problem 1994 11 ALGRTHMICA Bern & Greene & Raghunathan & Sudan, On-Line Algorithms for Locating Checkpoints 1994 11 ALGRTHMICA Irani, Coloring Inductive Graphs On-Line 1994 11 ALGRTHMICA Ben-David & Borodin, A New Measure for the Study of On-Line Algorithms 1993 10 ALGRTHMICA Sun & Sarrafzadeh, Floorplanning by Graph Dualization: L-shaped Modules 1993 10 ALGRTHMICA Jaromczyk & Wasilkowski, Numerical Stability of a Convex Hull Algorithm for Simple Polygons 1993 10 ALGRTHMICA Flajolet & Gonnet & Puech & Robson, Analytic Variations on Quadtrees 1993 10 ALGRTHMICA Mantzaris, On ``An Improved Algorithm for Finding the Median Distributively'' 1993 10 ALGRTHMICA Ukkonen & Wood, Approximate String Matching with Suffix Automata 1993 10 ALGRTHMICA Anstreicher & den Hertog & Roos & Terlaky, A Long-Step Barrier Method for Convex Quadratic Programming 1993 10 ALGRTHMICA Malka & Moran & Zaks, A Lower Bound on the Period Length of a Distributed Scheduler 1993 10 ALGRTHMICA Arkin & Khuller & Mitchell, Geometric Knapsack Problems 1993 10 ALGRTHMICA Canny & Lin, An Opportunistic Global Path Planner 1993 10 ALGRTHMICA Barraquand & Latombe, Nonholonomic Multibody Mobile Robots: Controllability and Motion Planning in the Presence of Obstacles 1993 10 ALGRTHMICA Reif & Tate, Continuous Alternation: The Complexity of Pursuit in Continuous Domains 1993 10 ALGRTHMICA Icking & Rote & Welzl & Yap, Shortest Paths for Line Segments 1993 10 ALGRTHMICA Goldberg, Orienting Polygonal Parts Without Sensors 1993 10 ALGRTHMICA Erdmann & Mason & Vanecek, Mechanical Parts Orienting: The Case of a Polyhedron on a Table 1993 10 ALGRTHMICA Erdmann, Randomization for Robot Tasks: Using Dynamic Programming in the Space of Knowledge States 1993 10 ALGRTHMICA Baraff, Issues in Computing Contact Forces for Non-Penetrating Rigid Bodies 1993 10 ALGRTHMICA Dobkin & Guibas & Hershberger & Snoeyink, An Efficient Algorithm for Finding the CSG Representation of a Simple Polygon 1993 10 ALGRTHMICA Hromkovic & Jeschke & Monien, Optimal Algorithms for Dissemination of Information in Some Interconnection Networks 1993 10 ALGRTHMICA Fujimura & Samet, Planning a Time-Minimal Motion Among Moving Obstacles 1993 10 ALGRTHMICA Gusfield & Naor, Extracting Maximal Information About Sets of Minimum Cuts 1993 9 ALGRTHMICA Dobkin & Hershberger & Kirkpatrick & Suri, Computing the Intersection-Depth of Polyhedra 1993 9 ALGRTHMICA Guibas & Salesin & Stolfi, Constructing Strongly convex Approximate Hulls with Inaccurate Primitives 1993 9 ALGRTHMICA Pach & Pollack & Welzl, Weaving Patterns of Lines and Line Segments in Space 1993 9 ALGRTHMICA Asano & Tokuyama, Algorithms for Projecting Points To Give the Most Uniform Distribution with Applications to Hashing 1993 9 ALGRTHMICA Gao & Guibas & Kirkpatrick & Laaser & Saxe, Finding Extrema with Unary Predicates 1993 9 ALGRTHMICA Tsai & Hsu, Fast Algorithms for the Dominating Set Problem on Permutation Graphs 1993 9 ALGRTHMICA Lam & Chan, Finding Least-Weight Subsequences with Fewer Processors 1993 9 ALGRTHMICA Carlsson & Levcopoulos & Petersson, Sublinear Merging and Natural Mergesort 1993 9 ALGRTHMICA Numata & Tokuyama, Splitting a Configuration in a Simplex 1993 9 ALGRTHMICA Chan & Chin, Schedulers for Larger Classes of Pinwheel Instances 1993 9 ALGRTHMICA Zelikovsky, An 11/6-Approximation Algorithm for the Network Steiner Problem 1993 9 ALGRTHMICA Pellegrini, Ray Shooting on Triangles in 3-Space 1993 9 ALGRTHMICA Agarwal & Aronov & Sharir & Suri, Selecting Distances in the Plane 1993 9 ALGRTHMICA Goodrich & Shauck & Guha, An Addendum to Parallel Methods for Visibility and Shortest-Path Problems in Simple Polygons 1993 9 ALGRTHMICA Bach & Sorenson, Sieve Algorithms for Perfect Power Testing 1993 9 ALGRTHMICA Boissonnat & Devillers & Teillaud, A Semidynamic Construction of Higher-Order Voronoi Diagrams and Its Randomized Analysis 1993 9 ALGRTHMICA Pawagi & Kaser, Optimal Parallel Algorithms for Multiple Updates of Minimum Spanning Trees 1993 9 ALGRTHMICA Kenyon, Tiling a Polygon with Parallelograms 1993 9 ALGRTHMICA Hwang & Chang & Lee, The Searching over Separators Strategy To Solve Some NP-Hard Problems in Subexponential Time 1993 9 ALGRTHMICA Ramprasad & Rangan, A Linear Algorithm for the All-Bidirectional-Edges Problem on Planar Graphs 1993 9 ALGRTHMICA Chen, Efficient Parallel Recognition of Some Circular Arc Graphs, I 1993 9 ALGRTHMICA Lipton & Naughton, Clocked Adversaries for Hashing 1993 9 ALGRTHMICA Coffman & Shor, Packings in Two Dimensions: Asymptotic Average-Case Analysis of Algorithms 1993 9 ALGRTHMICA Meyer, Seven Fingers Allow Force-Torque Closure Grasps on Any Convex Polyhedron 1993 9 ALGRTHMICA Anderson & Kahan & Schlag, Single-Layer Cylindrical Compaction 1993 9 ALGRTHMICA Berger & Hekstra & Orlitsky, Asymptotic Component Densities in Programmable Gate Arrays Realizing All Circuits of a Given Size 1993 9 ALGRTHMICA Goodrich & O'Dunlaing & Yap, Constructing the Voronoi Diagram of a Set of Line Segments in Parallel 1993 9 ALGRTHMICA Joe & An Wang, Duality of Constrained Voronoi Diagrams and Delaunay Triangulations 1993 9 ALGRTHMICA Atallah, A Faster Parallel Algorithm for a Matrix Searching Problem 1993 9 ALGRTHMICA Bentley & Clarkson & Levine, Fast Linear Expected-Time Algorithms for Computing Maxima and Convex Hulls 1993 9 ALGRTHMICA Bosch & Anstreicher, On Partial Updating in a Potential Reduction Linear Programming Algorithm of Kojima, Mizuno, and Yoshise 1993 9 ALGRTHMICA Hwang & Lee & Chang, The Slab Dividing Approach To Solve the Euclidean P-Center Problem 1993 9 ALGRTHMICA Klein & Stein, A Parallel Algorithm for Approximating the Minimum Cycle Cover 1993 9 ALGRTHMICA Kunde, Packet Routing on Grids of Processors 1993 9 ALGRTHMICA Kaufmann & Maley, Parity Conditions in Homotopic Knock-Knee Routing 1993 9 ALGRTHMICA Todd & Wang, On Combined Phase 1 - Phase 2 Projective Methods for Linear Programming 1993 9 ALGRTHMICA Sarrafzadeh & Lou, Maximum k-Covering of Weighted Transitive Graphs with Applications 1992 8 ALGRTHMICA Li & Milenkovic, Constructing Strongly Convex Hulls Using Exact or Rounded Arithmetic 1992 8 ALGRTHMICA Fleischer & Mehlhorn & Rote & Welzl & Yap, Simultaneous Inner and Outer Approximation of Shapes 1992 8 ALGRTHMICA Alt & Fleischer & Kaufmann & Mehlhorn & Naher & Schirra & Uhrig, Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures 1992 8 ALGRTHMICA Chazelle & Sharir & Welzl, Quasi-Optimal Upper Bounds for Simplex Range Searching and New Zone Theorems 1992 8 ALGRTHMICA Mitchell & Rote & Woeginger, Minimum-Link Paths Among Obstacles in the Plane 1992 8 ALGRTHMICA Goodrich & Shauck & Guha, Parallel Methods for Visibility and Shortest-Path Problems in Simple Polygons 1992 8 ALGRTHMICA Preparata & Vitter & Yvinec, Output-Sensitive Generation of the Perspective View of Isothetic Parallelepipeds 1992 8 ALGRTHMICA Apostolico, Optimal Parallel Detection of Squares in Strings 1992 8 ALGRTHMICA Boissonnat & Yvinec, Probing a Scene of Nonconvex Polyhedra 1992 8 ALGRTHMICA Chang & Tang & Lee, Solving the Euclidean Bottleneck Matching Problem by k-Relative Neighborhood Graphs 1992 8 ALGRTHMICA Briggs, An Efficient Algorithm for One-Step Planar Compliant Motion Planning with Uncertainty 1992 8 ALGRTHMICA Atallah & Tsay, On the Parallel-Decomposability of Geometric Problems 1992 8 ALGRTHMICA Cheng & Hu, Maximum Concurrent Flows and Minimum Cuts 1992 8 ALGRTHMICA Levcopoulos & Lingas, There Are Planar Graphs Almost as Good as the Complete Graphs and Almost as Cheap as Minimum Spanning Trees 1992 8 ALGRTHMICA Wu & Manber, Path-Matching Problems 1992 8 ALGRTHMICA Gusfield & Pitt, A Bounded Approximation for the Minimum Cost 2-Sat Problem 1992 8 ALGRTHMICA Rub, Line-Segment Intersection Reporting in Parallel 1992 8 ALGRTHMICA Goldfarb & Hao, Polynomial-Time Primal Simplex Algorithms for the Minimum Cost Network Flow Problem 1992 8 ALGRTHMICA Adler & Monteiro, A Geometric View of Parametric Linear Programming 1992 8 ALGRTHMICA Schwartz & Sharir, Finding Effective ``Force Targets'' for Two-Dimensional, Multifinger Frictional Grips 1992 8 ALGRTHMICA Rajasekaran & Tsantilas, Optimal Routing Algorithms for Mesh-Connected Processor Arrays 1992 8 ALGRTHMICA Webber & Samet, Linear-Time Border-Tracing Algorithms for Quadtrees 1992 8 ALGRTHMICA Mitchell, L_1 Shortest Paths Among Polygonal Obstacles in the Plane 1992 7 ALGRTHMICA Westbrook & Tarjan, Maintaining Bridge-Connected and Biconnected Components On-Line 1992 7 ALGRTHMICA Gabow & Westermann, Forests, Frames, and Games: Algorithms for Matroid Sums and Applications 1992 7 ALGRTHMICA Gusfield & Martel, A Fast Algorithm for the Generalized Parametric Minimum Cut Problem and Applications 1992 7 ALGRTHMICA Mishra & Tarjan, A Linear-Time Algorithm for Finding an Ambitus 1992 7 ALGRTHMICA Borie & Parker & Tovey, Automatic Generation of Linear-Time Algorithms from Predicate Calculus Descriptions of Problems on Recursively Constructed Graph Families 1992 7 ALGRTHMICA Nagamochi & Ibaraki, A Linear-Time Algorithm for Finding a Sparse k-Connected Spanning Subgraph of a k-Connected Graph 1992 7 ALGRTHMICA Reif & Spirakis, Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems 1992 7 ALGRTHMICA Lucas & Sackrowitz, Efficient Parallel Algorithms for Path Problems in Directed Graphs 1992 7 ALGRTHMICA Hopcroft & Kahn, A Paradigm for Robust Geometric Algorithms 1992 7 ALGRTHMICA Guibas & Knuth & Sharir, Randomized Incremental Construction of Delaunay and Voronoi Diagrams 1992 7 ALGRTHMICA Liao, Three Priority Queue Applications Revisited 1992 7 ALGRTHMICA Cole & Goodrich, Optimal Parallel Algorithms for Point-Set and Polygon Problems 1992 7 ALGRTHMICA Chandran & Kim & Mount, Parallel Computational Geometry of Rectangles 1992 7 ALGRTHMICA Cohen & Miller & Sarraf & Stout, Efficient Convexity and Domination Algorithms for Fine- and Medium-Grain Hypercube Computers 1992 7 ALGRTHMICA Sanz & Cypher, Data Reduction and Fast Routing: A Strategy for Efficient Algorithms for Message-Passing Parallel Computers 1992 7 ALGRTHMICA Reif & Sen, Optimal Randomized Parallel Algorithms for Computational Geometry 1992 7 ALGRTHMICA Du & Hwang, A Proof of the Gilbert-Pollak Conjecture on the Steiner Ratio 1992 7 ALGRTHMICA Smith, How To Find Steiner Minimal Trees in Euclidean d-Space 1992 7 ALGRTHMICA Liu & Du, On Steiner Minimal Trees with L_p Distance 1992 7 ALGRTHMICA Rubinstein & Thomas, Graham's Problem on Shortest Networks for Points on a Circle 1992 7 ALGRTHMICA Cockayne & Hewgill, Improved Computation of Plane Steiner Minimal Trees 1992 7 ALGRTHMICA Booth & Weng, Steiner Minimal Trees for a Class of Zigzag Lines 1992 7 ALGRTHMICA Richards & Salowe, A Linear-Time Algorithm To Construct a Rectilinear Steiner Minimal Tree for k-Extremal Point Sets 1992 7 ALGRTHMICA Rao & Sadayappan & Hwang & Shor, The Rectilinear Steiner Arborescence Problem 1992 7 ALGRTHMICA Provan, Two New Criteria for Finding Steiner Hulls in Steiner Tree Problems 1992 7 ALGRTHMICA Colbourn, A Note on Bounding k-Terminal Reliability 1992 7 ALGRTHMICA Winter & Smith, Path-Distance Heuristics for the Steiner-Problem in Undirected Networks 1992 7 ALGRTHMICA Smith & Shor, Steiner Tree Problems 1992 7 ALGRTHMICA Voss, Problems with Generalized Steiner Problems 1992 7 ALGRTHMICA Schwarzkopf, Parallel Computation of Distance Transforms (Erratum) 1991 6 ALGRTHMICA Liu & Ntafos, On Partitioning Rectilinear Polygons into Star-Shaped Polygons 1991 6 ALGRTHMICA Chrobak & Naor, An Efficient Parallel Algorithm for Computing a Large Independent Set in a Planar Graph 1991 6 ALGRTHMICA McGeoch & Sleator, A Strongly Competitive Randomized Paging Algorithm 1991 6 ALGRTHMICA Masuyama & Ibaraki, Chain Packing in Graphs 1991 6 ALGRTHMICA van Kreveld & Overmars, Divided k-d Trees 1991 6 ALGRTHMICA Anderson & Miller, Deterministic Parallel List Ranking 1991 6 ALGRTHMICA Morgenstern & Shapiro, Heuristics for Rapidly Four-Coloring Large Planar Graphs 1991 6 ALGRTHMICA Moitra, Finding a Minimal Cover for Binary Images: An Optimal Parallel Algorithm 1991 6 ALGRTHMICA Miller & Stout, Computing Convexity Properties of Images on a Pyramid Computer 1991 6 ALGRTHMICA Schwarzkopf, Parallel Computation of Distance Transforms 1991 6 ALGRTHMICA Alnuweiri & Prasanna Kumar, Processor-Time Optimal Parallel Algorithms for Digitized Images on Mesh-Connected Processor Arrays 1991 6 ALGRTHMICA Dehne & Hassenklover & Sack & Santoro, Computational Geometry Algorithms for the Systolic Screen 1991 6 ALGRTHMICA Atallah & Hambrusch & TeWinkel, Topological Numbering of Features on a Mesh 1991 6 ALGRTHMICA Grolmusz, Large Parallel Machines Can Be Extremely Slow for Small Problems 1991 6 ALGRTHMICA Rosenberger, Order-k Voronoi Diagrams of Sites with Additive Weights in the Plane 1991 6 ALGRTHMICA De Floriani & Falcidieno & Nagy & Pienovi, On Sorting Triangles in a Delaunay Tessellation 1991 6 ALGRTHMICA Bajaj & Kim, Convex Hulls of Objects Bounded by Algebraic Curves 1991 6 ALGRTHMICA Gordon, Parallel Sorting on Cayley Graphs 1991 6 ALGRTHMICA Wu & Ja'Ja', Optimal Algorithms for Adjacent Side Routing 1991 6 ALGRTHMICA Sproull, Refinements to Nearest-Neighbor Searching in k-Dimensional Trees 1991 6 ALGRTHMICA Kruskal & Greenberg, A Flexible Way of Counting Large Numbers Approximately in Small Registers 1991 6 ALGRTHMICA Kenyon & Vitter, Maximum Queue Size and Hashing with Lazy Deletion 1991 6 ALGRTHMICA Sangiovanni-Vincentelli, Editor's Foreward (Special Issue on Simulated Annealing) 1991 6 ALGRTHMICA Romeo & Sangiovanni-Vincentelli, A Theoretical Framework for Simulated Annealing 1991 6 ALGRTHMICA Strenski & Kirkpatrick, Analysis of Finite Length Annealing Schedules 1991 6 ALGRTHMICA Sorkin, Efficient Simulated Annealing on Fractal Energy Landscapes 1991 6 ALGRTHMICA Gelfand & Mitter, Simulated Annealing Type Algorithms for Multivariate Optimization 1991 6 ALGRTHMICA Aarts & Korst, Boltzmann Machines as a Model for Parallel Annealing 1991 6 ALGRTHMICA Wong, Stochastic Neural Networks 1991 6 ALGRTHMICA Gonzaga, Search Directions for Interior Linear-Programming Methods 1991 6 ALGRTHMICA Rohnert, Moving a Disc Between Polygons 1991 6 ALGRTHMICA Wong & Reingold, Probabilistic Analysis of a Grouping Algorithm 1991 6 ALGRTHMICA Shute & Deneen & Thomborson/Thompson, An O(n log n) Plane-Sweep Algorithm for L_1 and L_infty Delaunay Triangulations 1991 6 ALGRTHMICA Floyd & Karp, FFD Bin Packing for Item Sizes with Uniform Distributions on [0,1/2] 1991 6 ALGRTHMICA Aggarwal & Klawe & Lichtenstein & Linial & Wigderson, A Lower Bound on the Area of Permutation Layouts 1991 6 ALGRTHMICA Szpankowski, On the Height of Digital Trees and Related Problems 1991 6 ALGRTHMICA Kapoor & Reingold, Stochastic Rearrangement Rules for Self-Organizing Data Structures 1991 6 ALGRTHMICA Alevizos & Boissonnat & Preparata, An Optimal Algorithm for the Boundary of a Cell in a Union of Rays--Corrigendum 1990 6 ALGRTHMICA Leiserson & Saxe, Retiming Synchronous Circuitry 1990 6 ALGRTHMICA Bhatt & Chung & Rosenberg, Partitioning Circuits for Improved Testability 1990 6 ALGRTHMICA Aggarwal & Carter & Kosaraju, Optimal Tradeoffs for Addition on Systolic Arrays 1990 6 ALGRTHMICA Raghavan & Thompson, Multiterminal Global Routing: A Deterministic Approximation Scheme 1990 6 ALGRTHMICA Brady & Brown, Optimal Multilayer Channel Routing with Overlap 1990 6 ALGRTHMICA Maley, A Generic Algorithm for One-Dimensional Homotopic Compaction 1990 6 ALGRTHMICA Aggarwal & Klawe & Shor, Multilayer Grid Embeddings for VLSI 1990 5 ALGRTHMICA Berger & Rompel, A Better Performance Guarantee for Approximate Graph Coloring 1990 5 ALGRTHMICA Lai & Leinwand, A Theory of Rectangular Dual Graphs 1990 5 ALGRTHMICA Lee & Chwa, Some Chain Visibility Problems in a Simple Polygon 1990 5 ALGRTHMICA Tamassia & Preparata, Dynamic Maintenance of Planar Digraphs, with Applications 1990 5 ALGRTHMICA Luccio & Pietracaprina & Pucci, A New Scheme for the Deterministic Simulation of PRAMs in VLSI 1990 5 ALGRTHMICA He, Efficient Parallel and Sequential Algorithms for 4-Coloring Perfect Planar Graphs 1990 5 ALGRTHMICA Dobkin & Edelsbrunner & Overmars, Searching for Empty Convex Polygons 1990 5 ALGRTHMICA Alevizos & Boissonnat & Preparata, An Optimal Algorithm for the Boundary of a Cell in a Union of Rays 1990 5 ALGRTHMICA Hwang & Yao, Comments on Bern's Probabilistic Results on Rectilinear Steiner Trees 1990 5 ALGRTHMICA Culberson & Munro, Analysis of the Standard Deletion Algorithm in Exact Fit Domain Binary Search Trees 1990 5 ALGRTHMICA Ukkonen, A Linear-Time Algorithm for Finding Approximate Shortest Common Superstrings 1990 5 ALGRTHMICA Mattern, Asynchronous Distributed Termination--Parallel and Symmetric Solutions with Echo Algorithms 1990 5 ALGRTHMICA Ko & Lee & Chang, An Optimal Approximation Algorithm for the Rectilinear m-Center Problem 1990 5 ALGRTHMICA Donald, The Complexity of Planar Compliant Motion Planning Under Uncertainty 1990 5 ALGRTHMICA Wu & Loui, An Efficient Distributed Algorithm for Maximum Matching in General Graphs 1990 5 ALGRTHMICA Monma & Paterson & Suri & Yao, Computing Euclidean Maximum Spanning Trees 1990 5 ALGRTHMICA Dobkin & Souvaine, Computational Geometry in a Curved World 1990 5 ALGRTHMICA Chou & Schelter & Yang, An Algorithm for Constructing Grobner Bases from Characteristic Sets and Its Application to Geometry 1990 5 ALGRTHMICA Jeong & Lee, Parallel Geometric Algorithms on a Mesh-Connected Computer 1990 5 ALGRTHMICA Savage & Stallman & Perry, Solving Some Combinatorial Problems on Arrays with One-Way Dataflow 1990 5 ALGRTHMICA Sudarshan & Rangan, A Fast Algorithm for Computing Sparse Visibility Graphs 1990 5 ALGRTHMICA Mehlhorn & Naher, Dynamic Fractional Cascading 1990 5 ALGRTHMICA Parberry, An Optimal Time Bound for Oblivious Routing 1990 5 ALGRTHMICA Blankenagel & Guting, Internal and External Algorithms for the Points-in-Regions Problem--the INSIDE Join of Geo-Relational Algebra 1990 5 ALGRTHMICA Cidon & Gopal, Dynamic Detection of Subgraphs in Computer Networks 1990 5 ALGRTHMICA Chor & Goldreich, An Improved Parallel Algorithm for Integer GCD 1990 5 ALGRTHMICA Gonzalez & Zheng, Approximation Algorithms for Partitioning a Rectangle with Interior Points 1990 5 ALGRTHMICA Kruskal & Rudolph & Snir, Efficient Parallel Algorithms for Graph Problems 1990 5 ALGRTHMICA Orlowski, A New Algorithm for the Largest Empty Rectangle Problem 1990 5 ALGRTHMICA Paterson, Improved Sorting Networks with O(log N) Depth 1990 5 ALGRTHMICA Bienstock & Monma, On the Complexity of Embedding Planar Graphs To Minimize Certain Distance Measures 1990 5 ALGRTHMICA Du & Zhang, On Heuristics for Minimum Length Rectilinear Partitions 1990 5 ALGRTHMICA He & Yesha, Efficient Parallel Algorithms for r-Dominating Set and p-Center Problems on Trees 1989 4 ALGRTHMICA Kapoor & Ramanan, Lower Bounds for Maximal and Convex Layers Problems 1989 4 ALGRTHMICA Clarkson, An Algorithm for Geometric Minimum Spanning Trees Requiring Nearly Linear Expected Time 1989 4 ALGRTHMICA Suzuki & Nishizeki & Saito, Algorithms for Multicommodity Flows in Planar Graphs 1989 4 ALGRTHMICA Hirschberg & Larmore, The Set-Set LCS Problem 1989 4 ALGRTHMICA Megiddo, Extending NC and RNC Algorithms 1989 4 ALGRTHMICA Ramanan & Tsuga, Average-Case Analysis of the Modified Harmonic Algorithm 1989 4 ALGRTHMICA Klein & Nurmi & Ottmann & Wood, A Dynamic Fixed Windowing Problem 1989 4 ALGRTHMICA Luby & Ragde, A Bidirectional Shortest-Path Algorithm with Good Average-Case Behavior 1989 4 ALGRTHMICA Vaidya, Approximate Minimum Weight Matching on Points in k-Dimensional Space 1989 4 ALGRTHMICA Lodi & Luccio & Pagli, A Preliminary Study of a Diagonal Channel-Routing Model 1989 4 ALGRTHMICA Skiena, Problems in Geometric Probing 1989 4 ALGRTHMICA Verdu, Computational Complexity of Optimum Multiuser Detection 1989 4 ALGRTHMICA Paterakis & Georgiadis & Papantoni-Kazakos, A Full Sensing Window Random-Access Algorithm for Messages with Strict Delay Constraints 1989 4 ALGRTHMICA Gold & Moran, A Correction Algorithm for Token-Passing Sequences in Mobile Communication Networks 1989 4 ALGRTHMICA Jaffe & Rosberg, Maximal Selection in Tandem Networks with Symmetric Hearing Range 1989 4 ALGRTHMICA Post & Kershenbaum & Sarachik, Scheduling Multihop CDMA Networks in the Presence of Secondary Conflicts 1989 4 ALGRTHMICA Wang & Silvester, Optimizing Responses to Broadcast Messages in Radio Networks 1989 4 ALGRTHMICA Jaffe & Sidi, Distributed Deadlock Resolution in Store-and-Forward Networks 1989 4 ALGRTHMICA Attiya & van Leeuwen & Santoro & Zaks, Efficient Elections in Chordal Ring Networks 1989 4 ALGRTHMICA Bajaj & Kim, Generation of Configuration Space Obstacles: The Case of Moving Algebraic Curves 1989 4 ALGRTHMICA Fernandez-Baca & Martel, On the Efficiency of Maximum-Flow Algorithms on Networks with Small Integer Capacities 1989 4 ALGRTHMICA Richards, Fast Heuristic Algorithms for Rectilinear Steiner Trees 1989 4 ALGRTHMICA Leung, A New Algorithm for Scheduling Periodic, Real-Time Tasks 1989 4 ALGRTHMICA Atallah & Kosaraju, An Efficient Algorithm for Maxdominance, with Applications 1989 4 ALGRTHMICA Chou & Yang, On the Algebraic Formulation of Certain Geometry Statements and Mechanical Geometry Theorem Proving 1989 4 ALGRTHMICA Wong & Liu, Floorplan Design of VLSI Circuits 1989 4 ALGRTHMICA Yao, On Selecting the k Largest with Median Tests 1989 4 ALGRTHMICA Dobkin & Laszlo, Primitives for the Manipulation of Three-Dimensional Subdivisions 1989 4 ALGRTHMICA Drysdale & Jerard & Schaudt & Hauck, Discrete Simulation of NC Machining 1989 4 ALGRTHMICA Edahiro & Tanaka & Hoshino & Asano, A Bucketing Algorithm for the Orthogonal Segment Intersection Search Problem and Its Practical Efficiency 1989 4 ALGRTHMICA Imai & Kato & Yamamoto, A Linear-Time Algorithm for Linear L_1 Approximation of Points 1989 4 ALGRTHMICA Chew, Constrained Delaunay Triangulations 1989 4 ALGRTHMICA Aronov, On the Geodesic Voronoi Diagram of Point Sites in a Simple Polygon 1989 4 ALGRTHMICA Hershberger, An Optimal Visibility Graph Algorithm for Triangulated Simple Polygons 1988 3 ALGRTHMICA Dobkin & Souvaine & Van Wyk, Decomposition and Intersection of Simple Splinegons 1988 3 ALGRTHMICA Czerwinski & Ramachandran, Optimal VLSI Graph Embeddings in Variable Aspect Ratio Rectangles 1988 3 ALGRTHMICA Peterson & Loui, The General Maximum Matching Algorithm of Micali and Vazirani 1988 3 ALGRTHMICA Atallah & Goodrich, Parallel Algorithms for Some Functions of Two Convex Polygons 1988 3 ALGRTHMICA Fellows & Friesen & Langston, On Finding Optimal and Near-Optimal Lineal Spanning Trees 1988 3 ALGRTHMICA Marberg & Gafni, Sorting in Constant Number of Row and Column Phases on a Mesh 1988 3 ALGRTHMICA Aggarwal & Chazelle & Guibas & O'Dunlaing & Yap, Parallel Computational Geometry 1988 3 ALGRTHMICA Cole & Vishkin, The Accelerated Centroid Decomposition Technique for Optimal Parallel Tree Evaluation in Logarithmic Time 1988 3 ALGRTHMICA Apostolico & Iliopoulos & Landau & Schieber & Vishkin, Parallel Construction of a Suffix Tree with Applications 1988 3 ALGRTHMICA Mullender & Vitanyi, Distributed Match-Making 1988 3 ALGRTHMICA Ladin & Liskov & Shrira, A Technique for Constructing Highly Available Services 1988 3 ALGRTHMICA Kanellakis & Smolka, On the Analysis of Cooperation and Antagonism in Networks of Communicating Processes 1988 3 ALGRTHMICA Afrati & Papadimitriou & Papageorgiou, The Synthesis of Communication Protocols 1988 3 ALGRTHMICA Bern, Two Probabilistic Results on Rectilinear Steiner Trees 1988 3 ALGRTHMICA Chazelle, An Algorithm for Segment-Dragging and Its Implementation 1988 3 ALGRTHMICA Choi & Hakimi, Data Transfers in Networks 1988 3 ALGRTHMICA Bhasker & Sahni, A Linear Algorithm to Find a Rectangular Dual of a Planar Triangulated Graph 1988 3 ALGRTHMICA Yap, Parallel Triangulation of a Polygon in Two Calls to the Trapezoidal Map 1988 3 ALGRTHMICA Ullman & Van Gelder, Parallel Complexity of Logical Query Programs 1988 3 ALGRTHMICA Fich & Ragde & Wigderson, Simulations Among Concurrent-Write PRAMs 1988 3 ALGRTHMICA Leiserson & Maggs, Communication-Efficient Parallel Algorithms for Distributed Random-Access Machines 1988 3 ALGRTHMICA Karlin & Manasse & Rudolph & Sleator, Competitive Snoopy Caching 1988 3 ALGRTHMICA Moses & Tuttle, Programming Simultaneous Actions Using Common Knowledge 1988 3 ALGRTHMICA Frederickson & Janardan, Designing Networks with Compact Routing Tables 1987 2 ALGRTHMICA Yap, Preface: Special Issue on Robotics 1987 2 ALGRTHMICA Sifrony & Sharir, A New Efficient Motion-Planning Algorithm for a Rod in Two-Dimensional Polygonal Space 1987 2 ALGRTHMICA Lumelsky & Stepanov, Path-Planning Strategies for a Point Mobile Automaton Moving Amidst Unknown Obstacles of Arbitrary Shape 1987 2 ALGRTHMICA O'Dunlaing, Motion Planning with Inertial Constraints 1987 2 ALGRTHMICA Erdmann & Lozano-Perez, On Multiple Moving Objects 1987 2 ALGRTHMICA Papadimitriou & Silverberg, Optimal Piecewise Linear Motion of an Object Among Obstacles 1987 2 ALGRTHMICA Mishra & Schwartz & Sharir, On the Existence and Synthesis of Multifinger Positive Grips 1987 2 ALGRTHMICA Blair & Kapoor & Lloyd & Supowit, Minimizing Channel Density in Standard Cell Layout 1987 2 ALGRTHMICA Karlin & Trickey & Ullman, Algorithms for the Compilation of Regular Expressions into PLAs 1987 2 ALGRTHMICA Apostolico & Guerra, The Longest Common Subsequence Problem Revisited 1987 2 ALGRTHMICA Chazelle, Computing on a Free Tree via Complexity-Preserving Mappings 1987 2 ALGRTHMICA Dwyer, A Faster Divide-and-Conquer Algorithm for Constructing Delaunay Triangulations 1987 2 ALGRTHMICA Fortune, A Sweepline Algorithm for Voronoi Diagrams 1987 2 ALGRTHMICA Levcopoulos & Lingas, On Approximation Behavior of the Greedy Triangulation for Convex Polygons 1987 2 ALGRTHMICA Aggarwal & Klawe & Moran & Shor & Wilber, Geometric Applications of a Matrix-Searching Algorithm 1987 2 ALGRTHMICA Guibas & Hershberger & Leven & Sharir & Tarjan, Linear-Time Algorithms for Visibility and Shortest Path Problems Inside Triangulated Simple Polygons 1987 2 ALGRTHMICA Chin & Ting, An Improved Algorithm for Finding the Median Distributively 1987 2 ALGRTHMICA Duris & Sykora & Thompson & Vrto, A Minimum-Area Circuit for l-Selection 1987 2 ALGRTHMICA Katoh & Kameda & Ibaraki, A Cautious Scheduler for Multistep Transactions 1987 2 ALGRTHMICA O'Dunlaing & Sharir & Yap, Generalized Voronoi Diagrams for a Ladder: II. Efficient Construction of the Diagram 1987 2 ALGRTHMICA Shand, Algorithms for Corner Stitched Data-Structures 1987 2 ALGRTHMICA Zemel, A Linear Time Randomizing Algorithm for Searching Ranked Functions 1987 2 ALGRTHMICA Hirschberg & Larmore, The Set LCS Problem 1987 2 ALGRTHMICA Hornick & Sarrafzadeh, On Problem Transformability in VLSI 1987 2 ALGRTHMICA Karp & Leighton & Rivest & Thompson & Vazirani & Vazirani, Global Wire Routing in Two-Dimensional Arrays 1987 2 ALGRTHMICA Mathieu, Some Problems in Computational Geometry 1986 1 ALGRTHMICA Megiddo, Introduction: New Approaches to Linear Programming 1986 1 ALGRTHMICA Vanderbei & Meketon & Freedman, A Modification of Karmarkar's Linear Programming Algorithm 1986 1 ALGRTHMICA Todd & Burrell, An Extension of Karmarkar's Algorithm for Linear Programming Using Dual Variables 1986 1 ALGRTHMICA de Ghellinck & Vial, A Polynomial Newton Method for Linear Programming 1986 1 ALGRTHMICA Iri & Imai, A Multiplicative Barrier Function Method for Linear Programming 1986 1 ALGRTHMICA Anstreicher, A Monotonic Projective Algorithm for Fractional Linear Programming 1986 1 ALGRTHMICA Kojima, Determining Basic Variables of Optimal Solutions in Karmarkar's New LP Algorithm 1986 1 ALGRTHMICA Rinaldi, A Projective Method for Linear Programming with Box-Type Constraints 1986 1 ALGRTHMICA Nazareth, Homotopy Techniques in Linear Programming 1986 1 ALGRTHMICA Blair, The Iterative Step in the Linear Programming Algorithm of N. Karmarkar 1986 1 ALGRTHMICA Pu, On-the-Fly, Incremental, Consistent Reading of Entire Databases 1986 1 ALGRTHMICA Wong & Li & Olken & Rotem & Wong, Bit Transposition for Very Large Scientific and Statistical Databases 1986 1 ALGRTHMICA Chou & DeWitt, An Evaluation of Buffer Management Strategies for Relational Database Systems 1986 1 ALGRTHMICA Medeiros & Tompa, Understanding the Implications of View Update Policies 1986 1 ALGRTHMICA Ioannidis, A Time Bound on the Materialization of Some Recursively Defined Views 1986 1 ALGRTHMICA Chazelle & Guibas, Fractional Cascading: I. A Data Structuring Technique 1986 1 ALGRTHMICA Chazelle & Guibas, Fractional Cascading: II. Applications 1986 1 ALGRTHMICA Lee & Wu, Geometric Complexity of Some Location Problems 1986 1 ALGRTHMICA Mehlhorn & Preparata & Sarrafzadeh, Channel Routing in Knock-Knee Mode: Simplified Algorithms and Proofs 1986 1 ALGRTHMICA Gao & Hambrusch, Two-Layer Channel Routing with Vertical Unit-Length Overlap 1986 1 ALGRTHMICA Games, Optimal Book Embeddings of the FFT, Benes, and Barrel Shifter Networks 1986 1 ALGRTHMICA Myers, An O(ND) Difference Algorithm and Its Variations 1986 ALGRTHMICA Asano & Asano & Guibas & Hershberger & Imai, Visibility of Disjoint Polygons 1986 ALGRTHMICA Bilardi & Preparata, Area-Time Lower-Bound Techniques with Applications to Sorting 1986 ALGRTHMICA Coppersmith & Odlyzko & Schroeppel, Discrete Logarithms in GF(p) 1986 ALGRTHMICA Edelsbrunner, Edge-Skeletons in Arrangements with Applications 1986 ALGRTHMICA Fredman & Sedgewick & Sleator & Tarjan, The Pairing Heap: A New Form of Self-Adjusting Heap 1986 ALGRTHMICA Sedgewick & Vitter, Shortest Paths in Euclidean Graphs 1986 ALGRTHMICA Van Wyk & Vitter, The Complexity of Hashing with Lazy Deletion 1988 26 ALLERTON Ramanan, Two Techniques for Creating Extra Components 1984 22 ALLERTON Chazelle, Criticality Considerations in the Design of Geometric Algorithms 1984 22 ALLERTON DePano & Aggarwal, Finding Restricted k-Envelopes for Convex Polygons 1984 22 ALLERTON Baker & Fortune & Mahaney, Inspection by Polygon Containment 1984 22 ALLERTON Atallah, Detecting Symmetry in a Planar Figure 1984 22 ALLERTON Franklin & Akman, Shortest Paths between Source and Goal Points Located on/around a Convex Polyhedron 1984 22 ALLERTON Atallah, Drawing Nonintersecting Segments between Two Planar Sets 1984 22 ALLERTON Bhattacharya, An Algorithm for Computing Order k Voronoi Diagrams in the Plane 1984 22 ALLERTON Bentley & Sleater & Tarjan & Wei, A Locally Adaptive Data Compression Scheme 1984 22 ALLERTON Oommen, On the Use of Smoothsort and Stochastic Move-to-Front Operations for Optimal List Organization 1984 22 ALLERTON Otoo, Managing Storage for Extendible Arrays of Varying Dimensions 1984 22 ALLERTON Karlsson, Dictionaries on Bounded Domains 1984 22 ALLERTON Frederickson & Srinivas, On-line Updating of Degree-Constrained Minimum Spanning Trees 1984 22 ALLERTON Turner, On the Probable Performance of Graph Coloring Algorithms 1984 22 ALLERTON Lloyd & Soffa & Wang, Feedback Vertex Sets in Polynomial Time--A New Class 1984 22 ALLERTON Larmore & Hirschberg, Breaking a Paragraph into Lines in Linear Time 1984 22 ALLERTON Cohoon, A Fast Line Intersection Routing Method for Optimal Wirings 1984 22 ALLERTON Gonzalez & Lee, A 1.6 Approximation Algorithm for Routing Multiterminal Nets around a Rectangle 1984 22 ALLERTON Hirschberg & Larmore, Average Case Analysis of Marking Algorithms 1984 22 ALLERTON Cunto & Munro, The Closest Neighbor Problem 1984 22 ALLERTON Murgolo, A Fully-Polynomial Approximation Scheme for Variable Sized Bin Packing 1984 22 ALLERTON Lindstrom & Vitter, The Design and Analysis of Bucketsort 1984 22 ALLERTON Frieze & Rudolph, A Parallel Algorithm for All Pairs Shortest Paths in a Random Graph 1984 22 ALLERTON Peters & Rudolph, Parallel Approximation Schemes for Subset Sum and Knapsack Problems 1984 22 ALLERTON Ramarao, O(log N) Parallel Algorithms for Binary Tree Traversals 1984 22 ALLERTON Afek & Gafni, Simple and Efficient Distributed Algorithms for Election in Complete Networks 1984 22 ALLERTON Gafni & Korfhage, Distributed Election in Unidirectional Eulerian Networks 1984 22 ALLERTON Richards & Liestman, Problems in Broadcasting and Gossiping 1984 22 ALLERTON Dunne, Lower Bounds on the Monotone Network Complexity of Threshold Functions 1984 22 ALLERTON Berman & Shannon, Edge Grammars: Decidability Results and Formal Language Issues 1984 22 ALLERTON Chang & Gouda & Rosier, Deciding Liveness for Special Classes of Communicating Finite State Machines 1978 16 ALLERTON Johnson & Gonzalez, Sorting Numbers in Linear Expected Time and Constant Extra Space 1977 15 ALLERTON Gabow, Finding Smallest Spanning Forests and Trees Subject to Many Degree Constraints 1977 15 ALLERTON Ibarra, Counter Machines and Number-Theoretic Problems 1977 15 ALLERTON Johnson, Efficient Special Purpose Priority Queues 1977 15 ALLERTON DeMillo & Dobkin & Lipton, Combinatorial Inference (Extended Abstract) 1977 15 ALLERTON Manacher, The Ford-Johnson Sorting Algorithm Is Not Optimal (Extended Abstract) 1977 15 ALLERTON Papadimitriou, The Probabilistic Analysis of Matching Heuristics 1977 15 ALLERTON Pippenger, Fast Simulations of Combinational Logic Networks by machines without Random-Access Storage 1977 15 ALLERTON Rivest & Meyer & Kleitman & Spencer, Binary Search Using Unreliable Comparisons 1977 15 ALLERTON Savage & Swamy, Space-Time Tradeoffs on the FFT Algorithm (Extended Abstract) 1977 15 ALLERTON Yao, Fast Algorithms for Finding Minimum Spanning Trees in k Dimensions (extended abstract) 1996 7 ALT Valiant, Managing Complexity in Neuroidal Circuits 1996 7 ALT Takimoto & Sakai & Maruoka, Learnability of Exclusive-Or Expansion Based on Monotone DNF Formulas 1996 7 ALT Long, Improved Bounds about On-line Learning of Smooth Functions of a Single Variable 1996 7 ALT Nakamura, Query Learning of Bounded-Width OBDDs 1996 7 ALT Kleine Buning & Lettmann, Learning a Representation of Optimizable Formulas 1996 7 ALT Oliveira & Edwards, Limits of Exact Algorithms for Inference of Minimum Size Finite State Machines 1996 7 ALT Vitanyi, Genetic Fitness Optimization Using Rapidly Mixing Markov Chains 1996 7 ALT Baxter & Oliver, The Kindest Cut: Minimum Message Length Segmentation 1996 7 ALT Pearson & Smith, Reducing Complexity of Decision Trees with Two Variable Tests 1996 7 ALT Arvind & Vinodchandran, The Complexity of Exactly Learning Algebraic Concepts 1996 7 ALT Fahmy & Roos, Efficient Learning of Real Time Two-counter Automata 1996 7 ALT Quinlan, Boosting First-order Learning 1996 7 ALT Barzdins & Sarkans, Incorporating Hypothetical Knowledge into the Process of Inductive Synthesis 1996 7 ALT Sugimoto & Hirata & Ishizaka, Constructive Learning of Translations Based on Dictionaries 1996 7 ALT Lange & Wiehagen & Zeugmann, Learning by Erasing 1996 7 ALT Jain & Kinber & Wiehagen, On Learning and Co-learning of Minimal Programs 1996 7 ALT Shinohara & Arimura, Inductive Inference of Unbounded Unions of Pattern Languages from Positive Data 1996 7 ALT Case & Jain & Stephan, Vacillatory and BC Learning on Noisy Data 1996 7 ALT Ambainis & Freivalds, Transformations that Preserve Learnability 1996 7 ALT Viksna, Probabilistic Limit Identification Up To ``Small'' Sets 1996 7 ALT Grieser, Reflecting Inductive Inference Machines and Its Improvement by Therapy 1995 6 ALT Sakakibara, Grammatical Inference: An Old and New Paradigm 1995 6 ALT Fahmy & Roos, Efficient Learning of Real Time One-Counter Automata 1995 6 ALT Koshiba & Makinen & Takada, Learning Strongly Deterministic Even Linear Languages from Positive Examples 1995 6 ALT Sakamoto, Language Learning from Membership Queries and Characteristic Examples 1995 6 ALT Arimura & Ishizaka & Shinohara, Learning Unions of Tree Patterns Using Queries 1995 6 ALT De Raedt & Van Laer, Inductive Constraint Logic 1995 6 ALT Rao, Incremental Learning of Logic Programs 1995 6 ALT Miyashiro & Takimoto & Sakai & Maruoka, Learning Orthogonal F-Horn Formulas 1995 6 ALT Auer, Learning Nested Differences in the Presence of Malicious Noise 1995 6 ALT Nakamura & Miura, Learning Sparse Linear Combinations of Basis Functions over a Finite Domain 1995 6 ALT Kececioglu & Li & Tromp, Inferring a DNA Sequence from Erroneous Copies 1995 6 ALT Case & Jain & Sharma, Machine Induction without Revolutionary Paradigm Shifts 1995 6 ALT Meyer, Probabilistic Language Learning under Monotonicity Constraints 1995 6 ALT Stephan, Noisy Inference and Oracles 1995 6 ALT Kalyanasundaram & Velauthapillai, Simulating Teams with Many Conjectures 1995 6 ALT Pinter, Complexity of Network Training for Classes of Neural Networks 1995 6 ALT Gavalda & Guijarro, Learning Ordered Binary Decision Diagrams 1995 6 ALT Castro & Balcazar, Simple PAC Learning of Simple Decision Lists 1995 6 ALT Domingo & Shawe-Taylor, The Complexity of Learning Minor Closed Graph Classes 1995 6 ALT Kodratoff, Technical and Scientific Issues of KDD 1995 6 ALT Sadohara & Haraguchi, Analogical Logic Program Synthesis Algorithm that Can Refute Inappropriate Similarities 1995 6 ALT Jantke, Reflecting and Self-confident Inductive Inference Machines 1995 6 ALT Kobayashi & Yokomori, On Approximately Identifying Concept Classes in the Limit 1995 6 ALT Ambainis, Application of Kolmogorov Complexity to Inductive Inference with Limited Memory 1994 5 ALT Abe, Towards Realistic Theories of Learning 1994 5 ALT Richter, A Unified Approach to Inductive Logic and Case-Based Reasoning 1994 5 ALT Smith, Three Decades of Team Learning 1994 5 ALT Auer & Cesa-Bianchi, On-line Learning with Malicious Noise and the Closure Algorithm 1994 5 ALT Ben-David & Dichterman, Learnability with Restricted Focus of Attention Guarantees Noise-Tolerance 1994 5 ALT Brazma, Efficient Algorithm for Learning Simple Regular Expressions from Noisy Examples 1994 5 ALT Chen, A Note on Learning DNF Formulas Using Equivalence and Incomplete Membership Queries 1994 5 ALT Ferretti & Mauri, Identifying Regular Languages over Partially-Commutative Monoids 1994 5 ALT Gasarch & Pleszkoch & Velauthapillai, Classification Using Information 1994 5 ALT Ishino & Yamamoto, Learning from Examples with Typed Equational Programming 1994 5 ALT Ishizaka & Arimura & Shinohara, Finding Tree Patterns Consistent with Positive and Negative Examples Using Queries 1994 5 ALT Jain, Program Synthesis in the Presence of Infinite Number of Inaccuracies 1994 5 ALT Jain & Sharma, On Monotonic Strategies for Learning r.e. Languages 1994 5 ALT Kapur, Language Learning under Various Types of Constraint Combinations 1994 5 ALT Kimura & Togashi & Shiratori, Synthesis Algorithm for Recursive Processes by mu-Calculus 1994 5 ALT Kinber, Monotonicity versus Efficiency for Learning Languages from Texts 1994 5 ALT Kobayashi & Yokomori, Learning Concatenations of Locally Testable Languages from Positive Data 1994 5 ALT Lange & Nessel & Wiehagen, Language Learning from Good Examples 1994 5 ALT Lange & Watson, Machine Discovery in the Presence of Incomplete or Ambiguous Data 1994 5 ALT Lange & Zeugmann, Set-Driven and Rearrangement-Independent Learning of Recursive Languages 1994 5 ALT Matsumoto & Shinohara, Refutably Probably Approximately Correct Learning 1994 5 ALT Mukouchi, Inductive Inference of an Approximate Concept from Positive Data 1994 5 ALT Nakamura & Abe & Takeuchi, Efficient Distribution-Free Population Learning of Simple Concepts 1994 5 ALT Okubo & Haraguchi, Constructing Predicate Mappings for Goal-Dependent Abstraction 1994 5 ALT Sakakibara & Jantke & Lange, Learning Languages by Collecting Cases and Tuning Parameters 1994 5 ALT Takimoto & Tajika & Maruoka, Mutual Information Gaining Algorithm and Its Relation to PAC-Learning Algorithm 1994 5 ALT Tanida & Yokomori, Inductive Inference of Monogenic Pure Context-Free Languages 1993 4 ALT Laird, Identifying and Using Patterns in Sequential Data 1993 4 ALT Miyano, Learning Theory Toward Genome Informatics 1993 4 ALT Muggleton, Optimal Layered Learning: A PAC Approach to Incremental Sampling 1993 4 ALT Arima & Sawamura, Reformulation of Explanation by Linear Logic -- Toward Logic for Explanation 1993 4 ALT Barzdins & Barzdins & Apsitis & Sarkans, Towards Efficient Inductive Synthesis of Expressions from Input/Output Examples 1993 4 ALT Hagiya, A Typed lambda-Calculus for Proving-by-Example and Bottom-up Generalization Procedure 1993 4 ALT Jantke & Lange, Case-Based Representation and Learning of Pattern Languages 1993 4 ALT Sato & Akiba, Inductive Resolution 1993 4 ALT Yamamoto, Generalized Unification as Background Knowledge in Learning Logic Programs 1993 4 ALT Mukouchi & Arikawa, Inductive Inference Machines That Can Refute Hypothesis Spaces 1993 4 ALT Freivalds & Smith, On the Duality Between Mechanistic Learners and What it is They Learn 1993 4 ALT Jain & Sharma, On Aggregating Teams of Learning Machines 1993 4 ALT Viksna, Learning with Growing Quality 1993 4 ALT Daley & Kalyanasundaram, Use of Reduction Arguments in Determining Popperian FIN-Type Learning Capabilities 1993 4 ALT Moriyama & Sato, Properties of Language Classes with Finite Elasticity 1993 4 ALT Kapur, Uniform Characterizations of Various Kinds of Language Learning 1993 4 ALT Knuutila, How to Invent Characterizable Inference Methods for Regular Languages 1993 4 ALT Cuellar & Simon, Neural Discriminant Analysis 1993 4 ALT Iwayama & Indurkhya & Motoda, A New Algorithm for Automatic Configuration of Hidden Markov Models 1993 4 ALT Sakurai, On the VC-Dimension of Depth Four Threshold Circuits and the Complexity of Boolean-valued Functions 1993 4 ALT Takimoto & Maruoka, On the Sample Complexity of Consistent Learning with One-Sided Error 1993 4 ALT Shinohara, Complexity of Computing Vapnik-Chervonenkis Dimension 1993 4 ALT Hasegawa & Imai & Ishiguro, epsilon-Approximations of k-Lable Spaces 1993 4 ALT Nakamura & Abe, Exact Learning of Linear Combinations of Monotone Terms from Function Value Queries 1993 4 ALT Siromoney & Thomas & Subramanian & Dare, Thue Systems and DNA -- A Learning Algorithm for a Subclass 1993 4 ALT Ishigami & Tani, The VC-Dimensions of Finite Automata with n States 1993 4 ALT Yoshida & Motoda & Indurkhya, Unifying Learning Methods by Colored Digraphs 1993 4 ALT Suwa & Motoda, A Perceptual Criterion for Visually Controlling Learning 1993 4 ALT Kobayashi, Learning Strategies Using Decision Lists 1993 4 ALT Zhong & Ohsuga, A Decomposition Based Induction Model for Discovering Concept Clusters from Databases 1993 4 ALT Ganascia, Algebraic Structure of Some Learning Systems 1993 4 ALT Tsumoto & Tanaka, Induction of Probabilistic Rules Based on Rough Set Theory 1992 3 ALT Otsuki, Discovery Learning in Intelligent Tutoring Systems 1992 3 ALT Wiehagen, From Inductive Inference to Algorithmic Learning Theory 1992 3 ALT Konagaya, A Stochastic Approach to Genetic Information Processing 1992 3 ALT Yokomori, On Learning Systolic Languages 1992 3 ALT Balcazar & Diaz & Gavalda & Watanabe, A Note on the Query Complexity of Learning DFA 1992 3 ALT Ito & Yamamoto, Polynomial-Time MAT Learning of Multilinear Logic Programs 1992 3 ALT Kurita, Iterative Weighted Least Squares Algorithms for Neural Networks Classifiers 1992 3 ALT Niijima, Domains of Attraction in Autoassociative Memory Networks for Character Pattern Recognition 1992 3 ALT Akaho, Regularization Learning of Neural Networks for Generalization 1992 3 ALT Kamimura, Competitive Learning by Entropy Minimization 1992 3 ALT Mukouchi, Inductive Inference with Bounded Mind Changes 1992 3 ALT Ishizaka & Arimura & Shinohara, Efficient Inductive Inference of Primitive Prologs from Positive Data 1992 3 ALT Kapur, Monotonic Language Learning 1992 3 ALT Jain & Sharma, Prudence in Vacillatory Language Identification 1992 3 ALT Ueda & Nagano, Implementation of Heuristic Problem Solving Process Including Analogical Reasoning 1992 3 ALT Okubo & Haraguchi, Planning with Abstraction Based on Partial Predicate Mappings 1992 3 ALT Sakai & Maruoka, Learning k-Term Monotone Boolean Formulae 1992 3 ALT Takeuchi, Some Improved Sample Complexity Bounds in the Probabilistic PAC Learning Model 1992 3 ALT Matsuoka, An Application of Bernstein Polynomials in PAC Model 1992 3 ALT Akutsu & Takasu, On PAC Learnability of Functional Dependencies 1992 3 ALT Mamitsuka & Yamanishi, Protein Secondary Structure Prediction Based on Stochastic-Rule Learning 1992 3 ALT Kakihara & Imai, Notes on the PAC Learning of Geometric Concepts with Additional Information 1995 4 AMAST Gries, Equational Logic as a Tool 1995 4 AMAST Wing, Teaching Mathematics to Software Engineers 1994 66 AMC Calude & Jurgensen & Zimand, Is Independence an Exception? 1992 52 AMC Chaitin, Information-Theoretic Incompleteness 1992 52 AMC Chaitin, LISP Program-Size Complexity II 1992 52 AMC Chaitin, LISP Program-Size Complexity III 1992 52 AMC Chaitin, LISP Program-Size Complexity IV 1992 49 AMC Chaitin, LISP Program-Size Complexity 1992 47 AMC Mitra, A C Version of Minimal Boolean Sum-of-Product Forms 1992 47 AMC Fa-Long & Zheng, Neural Network Approach to Computing Matrix Inversion 1991 46 AMC Warren, Tours for the Traveling Salesman 1991 44 AMC Pesamosca, A Fixed Point Algorithm for Solving the Euclidean Multifacility Location Problem in a Tree 1991 44 AMC Chankong, Optimality Tests for Partitioning and Sectional Search Algorithms 1991 44 AMC Kubica & Kuczera, The Effect of the Alkyl Chain Length of Modifier Molecules on Membrane Structure Studied by the Cellular-Automaton Method 1991 43 AMC Gunji & Kon-no, Artificial Life with Autonomously Emerging Boundaries 1991 42 AMC Goel & Goodwin, Symbolic Computation Using L-Systems 1990 37 AMC Waissi, A New O(n^2) Shortest Chain Algorithm 1990 35 AMC Dror, Cost Allocation: The Traveling Salesman, Binpacking, and the Knapsack 1989 30 AMC Nowak & Sigmund, Game-Dynamical Aspects of the Prisoner's Dilemma 1988 27 AMC Hogeweg, Cellular Automata as a Paradigm for Ecological Modeling 1980 6 AMC Iyengar & Alia, A String Searching Algorithm 1993 3 AMCS Kisilewicz, Inverse Polynomial Matrix Approximation 1993 3 AMCS Wyrzykowski & Piech & Kanevski & Lepecha, New Algorithms for the Multiplication of Series of Rectangular Matrices and their Parallel Implementations 1996 68 AMIT Well, Cyber-Rattling: The Computer Revolution & Computer Resistance 1996 36 AML Beckmann & Weierman, A Term Rewriting Characterization of the Polytime Functions and Related Complexity Classes 1996 36 AML Kohlenbach, Mathematically Strong Subsystems of Analysis with Low Rate of Growth of Provably Recursive Functionals 1996 35 AML Buss & Clote, Cutting Planes, Connectivity, and Threshold Logic 1995 34 AML Buss, Some Remarks on Lengths of Propositional Proofs 1995 34 AML Weiermann, Investigations on Slow versus Fast Growing: How to Majorize Slow Growing Functions Nontrivially by Fast Growing Ones 1995 34 AML Cooper & Yi, The Discontinuity of Splitting in the Recursively Enumerable Degrees 1993 32 AML Yuasa, Adding a Cohen Real Adds an Entangled Linear Order 1992 32 AML Pe, Polynomial-Time Martin-Lof Type Theory 1990 30 AML Kummer, Some Applications of Computable One-One Numberings 1990 30 AML Judah & Shelah, Around Random Algebra 1990 30 AML Yukami, A Theorem on Generalizations of Proofs 1990 30 AML Yu & Simpson, Measure Theory and Weak Koenig's Lemma 1990 30 AML Amiot, The Undecidability of the Second Order Predicate Unification Problem 1990 29 AML Gradel, Satisfiability of Formulae with One forall Is Decidable in Exponential Time 1989 29 AML Beigel & Gasarch & Hay, Bounded Query Classes and the Difference Hierarchy 1988 27 AML Simmons, the Realm of Primitive Recursion 1997 10 AMLETS Fuchssteiner & Morisse, Flows in INfinite Networks Represented by Vector Lattices 1997 10 AMLETS Stoye & Perrey & Dress, Improving the Divide-and-Conquer Approach to Sum-of-Pairs Multiple Sequence Alignment 1997 10 AMLETS Han, A Fast Algorithm for the Minimax Flow Problem with 0/1 Weights 1996 9 AMLETS Dietrich & Osborne, O(n log^2 n) Determinant Computation of a Toeplitz Matrix and Fast Variance Estimation 1996 9 AMLETS Hamel & Steel, Finding a Maximum Compatible Tree is NP-Hard for Sequences and Trees 1996 9 AMLETS Goertzel & Bowman, Walks on Random Digraphs 1996 9 AMLETS Fuchssteiner & Morisse, Infinite Networks: Minimal Cost Flows 1995 8 AMLETS Nambiar, Ackerman Functions and Transfinite Ordinals 1995 8 AMLETS Jacobson & Lipman & McMorris, Trees That Are Sphere-of-Influence Graphs 1994 7 AMLETS Kubota, Matrix Inversion Algorithms by Means of Automatic Differentiation 1994 7 AMLETS Tamm, Still Another Rank Determination of Set Intersection Matrices with an Application in Communication Complexity 1994 7 AMLETS Panik, The Fundamental Theorem of Game Theory Revisited 1994 7 AMLETS Fukuda & Matsui, Finding All the Perfect Matchings in Bipartite Graphs 1994 7 AMLETS Tanaka & Kuroiwa, Another Observation on Conditions Assuring intA + B = int(A+B) 1994 7 AMLETS Abe, Tree Representation of Positive Integers 1994 7 AMLETS Hassard & Zhang & Hastings & Troy, A Computer Proof that the Lorenz Equations Have ``Chaotic'' Solutions 1993 6 AMLETS Wild, Axiomatizing Simple Binary Matroids by their Closed Circuits 1993 6 AMLETS Ahlswede & Cai & Tamm, Communication Complexity in Lattices 1993 6 AMLETS Delgrande & Gupta, Two Results in Negation-free Logic 1993 6 AMLETS Blokhuis & Metsch & Moorhouse & Ahlswede & Bezrukov, Partitioning the n-Cube into Sets with Mutual Distance 1 1993 6 AMLETS Goldberg & Radzik, A Heuristic Improvement of the Bellman-Ford Algorithm 1993 6 AMLETS Sundaram & Skiena, An Anomaly Concerning Ties in Lotto-like Games 1993 6 AMLETS Philpott & Mees, A Finite-Time Algorithm for Shortest Path Problems with Time-varying Costs 1993 6 AMLETS Tanaka & Kuroiwa, The Convexity of A and B Assures intA + B = int(A+B) 1992 5 AMLETS Pan, Improving the Solution of the Symmetric Eigenvalue Problem and an Extension 1992 5 AMLETS Nambiar & Varma & Saroch, An Axiomatic Definition of Shannon's Entropy 1992 5 AMLETS Codenotti & Margara, Traveling Salesman Problem and Local Search 1991 4 AMLETS Siegelmann & Sontag, Turing Computability with Neural Nets 1991 4 AMLETS Waissi, Worst Case Behavior of the Dinic Algorithm 1991 4 AMLETS Uhlmann, Metric Trees 1991 4 AMLETS Boland & Goh & Mees, An Algorithm for Solving Quadratic Network Flow Problems 1991 4 AMLETS Golenko-Ginzberg, Metrics in the Permutation Space 1991 4 AMLETS Alidaee, Optimal Assignment of Slack Due-date and Sequencing in a Single Machine Shop 1991 4 AMLETS Donegan & Dodd, An Analytical Approach to consensus 1991 4 AMLETS Uhlmann, Aesthetic sorting 1991 4 AMLETS Huang & Johnson & Johnson, A Report on the Performance of an Implementation of Strassen's Algorithm 1990 3 AMLETS Bernhard & Shinar, On Finite Approximation of a Game Solution with Mixed Strategies 1990 3 AMLETS Kitahara, A Note on Approximation by Step Functions 1990 3 AMLETS McCrosky & Dutta, A Type-theoretic Semantics of Arrays 1990 3 AMLETS Strzalkowski, An Algorithm for Inversing a Unification Parser into an Efficient Unification Generator 1997 104 AMM Tucker, Rethinking Rigor in Calculus: The Role of the Mean Value Theorem 1997 104 AMM Swann, Commentary on Rethinking Rigor in the Calculus: The Role of the Mean Value Theorem 1997 104 AMM Burger & Morgan, Fermat's Last Theorem, The Four Color Conjecture, and Bill Clinton for April Fools' Day 1996 103 AMM Kossak, What Are Infinitesimals and Why They Cannot Be Seen 1996 103 AMM Codenotti & Margara, Transitive Cellular Automata Are Sensitive 1996 103 AMM Hart & Kunen, review of Moschovakis, Notes on Set Theory (Springer-Verlag, 1994) 1995 102 AMM Tokarsky, Polygonal Rooms Not Illuminated from Every Point 1995 102 AMM Blecksmith & Laud, Some Exact Number Theory Computations via Probability Mechanisms 1995 102 AMM Aigner, Turan's Graph Theorem 1995 102 AMM Ondich, Off to the Races 1995 102 AMM Stillwell, Elliptic Curves 1995 102 AMM Gries & Schneider, Teaching Math More Effectively, Through Calculational Proofs 1995 102 AMM Schay, How to Add Fast--on Average 1995 102 AMM Morton, Fibonacci-like Sequences and Greatest Common Divisors 1995 102 AMM Moschovakis, review of Bridges, Computability (Springer-Verlag, 1994) 1995 102 AMM Hersh, Fresh Breezes in the Philosophy of Mathematics 1995 102 AMM Lamport, How to Write a Proof 1995 102 AMM Geyler, One More Construction Which Is Impossible 1995 102 AMM Ranum, On Some Applications of Fibonacci Numbers 1995 102 AMM Wells, Communicating Mathematics: Useful Ideas from Computer Science 1995 102 AMM McGeoch, Veni, Divisi, Vici 1995 102 AMM Chalice, How to Teach a Class by the Modified Moore Method 1995 102 AMM Davis, review of Matiyasevich, Hilbert's Tenth Problem (MIT Press, 1993) 1995 102 AMM Haimo, Experimentation and Conjecture Are Not Enough 1995 102 AMM Chung & Graham & Morrison & Odlyzko, Pebbling a Chessboard 1995 102 AMM Axler, Down With Determinants! 1995 102 AMM Guy & Nowakowski, Coin-Weighing Problems 1995 102 AMM Brams & Taylor, An Envy-Free Cake Division Protocol 1995 102 AMM Libeskind-Hadas, Approximation Algorithms: Good Solutions to Hard Problems 1994 101 AMM Percus & Percus, String Matching for the Novice 1994 101 AMM Rawlings, Bernoulli Trials and Number Theory 1994 101 AMM Kleiner & Movshovitz-Hadar, The Role of Paradoxes in the Evolution of Mathematics 1994 101 AMM Cray, Georg Cantor and Transcendental Numbers 1994 101 AMM Halmos, What Is Teaching? 1994 101 AMM Thurston, What Is Wrong with the Definition of dy/dx? 1994 101 AMM Goodman & Pollack & Wenger & Zamfirescu, Arrangements and Topological Planes 1994 101 AMM McGeoch, How to Stay Competitive 1994 101 AMM Bullock, Literacy in the Language of Mathematics 1994 101 AMM Rivin & Vardi & Zimmermann, The n-Queens Problem 1994 101 AMM Kraft, What's the Difference Between Cantor Sets? 1994 101 AMM Allouche & Astoorian & Randall & Shallit, Morphisms, Squarefree Strings, and the Tower of Hanoi Puzzle 1994 101 AMM Ondich, Do You Know the Way to Vertex A? 1994 101 AMM Buhler & Eisenbud & Graham & Wright, Juggling Drops and Descents 1994 101 AMM Bronstein & Fraenkel, On a Curious Property of Counting Sequences 1994 101 AMM Knudsen, Chaos Without Nonperiodicity 1994 101 AMM Callan, A Possible Permanent Formula 1994 101 AMM Turner, Square Roots mod p 1994 101 AMM McGeoch, Does Anybody Really Know What Time It Is? 1994 101 AMM Galvin, A Proof of Dilworth's Chain Decomposition Theorem 1994 101 AMM Gouvea, A Marvelous Proof 1994 101 AMM Feigenbaum & Reingold, Universal Traversal Sequences 1994 101 AMM Stillwell, What Are Algebraic Integers and What Are They For? 1994 101 AMM Cox, Introduction to Fermat's Last Theorem 1994 101 AMM Hungerford, Future Elementary Teachers: The Neglected Constituency 1994 101 AMM Stillwell, Galois Theory for Beginners 1994 101 AMM Marion, Turing Machines and Computational Complexity 1993 100 AMM Anshel & Anshel, From the Post-Markov Theorem Through Decision Problems to Public-Key Cryptography 1993 100 AMM Strang, The Fundamental Theorem of Linear Algebra 1993 100 AMM Hegyvari, On Some Irrational Decimal Fractions 1993 100 AMM McGeoch, Zero-Knowledge Proofs 1992 99 AMM Smorynski, review of Shanker, Goedel's Theorem in Focus (Routledge, 1990) 1992 99 AMM Bressoud, Why *Do* We Teach Calculus? 1992 99 AMM Roth, Tape Counters 1992 99 AMM Finch, Are 0-Additive Sequences Always Regular? 1992 99 AMM Knuth, Two Notes on Notation 1992 99 AMM Growney, Are Mathematics and Poetry Fundamentally Similar? 1992 99 AMM Gillman, The Car and the Goats 1991 98 AMM Hutchinson, review of Hartsfield & Ringel, Pearls in Graph Theory, a Comprehensive Introduction (1990) 1991 98 AMM Jones & Matijasevic, Proof of Recursive Unsolvability of Hilbert's Tenth Problem 1991 98 AMM Berger & Felzenbaum & Fraenkel & Holzman, On Infinite and Finite Covering Systems 1991 98 AMM Bender, review of Graham & Knuth & Patashnik, Concrete Mathematics: A Foundation for Computer Science (1989) 1991 98 AMM Cowen, Teaching and Testing Mathematics Reading 1990 97 AMM Justicz & Scheinerman & Winkler, Random Intervals 1990 97 AMM Schwarz, The Dark Side of the Moebius Strip 1990 97 AMM Barr, review of Penrose, The Emperor's New Mind 1990 97 AMM Berger, Convexity 1990 97 AMM Chern, What is Geometry? 1990 97 AMM Graham & Yao, A Whirlwind Tour of Computational Geometry 1990 97 AMM Halmos, Has Progress in Mathematics Slowed Down? 1990 97 AMM Gorni, A Geometric Approach to l'Hopital's Rule 1990 97 AMM Fetzer, The Final Word on Program Verification (letter) 1990 97 AMM Bridger, review of Dewdney, The Turing Omnibus: 61 Excursions in Computer Science (1989) 1990 97 AMM Wagon, The Euclidean Algorithm Strikes Again 1990 97 AMM Gallian, Open Problems in Grid Labeling 1990 97 AMM Zagier, A One-Sentence Proof That Every Prime p congruent 1 (mod 4) 1990 97 AMM Sutner, The sigma-Game and Cellular Automata 1990 97 AMM Santa Coloma & Tucci, A Decomposition Theorem for Finite Automata 1990 97 AMM Newton, A Simple Algorithm for Finding Eigenvalues and Eigenvectors for 2 x 2 Matrices 1989 96 AMM Bogart, A Fresh(man) Treatment of Determinants 1989 96 AMM Rushanan, On the Vandermonde Matrix 1989 96 AMM Dowling, There Are No Safe Virus Tests 1989 96 AMM Wilf, The White Screen Problem 1989 96 AMM Edelsbrunner & Skiena, On the Number of Furthest Neighbor Pairs in a Point Set 1989 96 AMM Anderson & Lovasz & Shor & Spencer & Tardos & Winograd, Disks, Balls, and Walls: Analysis of a Combinatorial Game 1989 96 AMM Goodman & Pach & Yap, Mountain Climbing, Ladder Moving, and the Ring-Width of a Polygon 1989 96 AMM Coxeter, review of Conway & Sloane, Sphere Packings, Lattices and Groups (1988) 1989 96 AMM Konheim, review of Patterson, Mathematical Cryptology for Computer Scientists and Mathematicians, Rowman & Littlefield, 1987 1989 96 AMM Konheim, review of Koblitz, A Course in Number Theory and Cryptography, Springer-Verlag, 1987 1989 96 AMM Seltzer, review of Carberry & Cohen & Khalil, Principles of Computer Science, Computer Science Press, 1986 1989 96 AMM Lax, review of Gillman, Writing Mathematics Well, The Mathematical Association of America, 1988 1989 96 AMM Borwein & Borwein & Bailey, Ramanujan, Modular Equations, and Approximations to Pi or How to Compute One Billion Digits of Pi 1989 96 AMM Baldwin, On Markov Processes in Elementary Mathematics Courses 1989 96 AMM Smorynski, review of Smullyan, Forever Undecided: A Puzzle Guide to Godel, Knopf, 1987 1989 96 AMM Patin, A Very Short Proof of Stirling's Formula 1989 96 AMM Galovich, review of Schoenfeld (Mathematical Problem Solving, 1985) 1988 95 AMM Book, Dehn's Algorithm and the Complexity of Word Problems 1988 95 AMM Hamming, review of Hill (1986) 1988 95 AMM Sagher, What Pythagoras Could Have Done 1987 94 AMM Wagon, Fourteen Proofs of a Result About Tiling a Rectangle 1987 94 AMM Althoen & McLaughlin, Gauss-Jordan Reduction: A Brief History 1987 94 AMM Wilf, The Editor's Corner: A Greeting; and a View of Riemann's Hypothesis 1986 93 AMM Diaconis & Freedman, An Elementary Proof of Stirling's Formula 1985 92 AMM Cull & Ecklund, Towers of Hanoi and Analysis of Algorithms 1985 92 AMM Knuth, Algorithmic Thinking and Mathematical Thinking 1985 92 AMM Friske, Teaching Proofs: A Lesson from Software Engineering 1984 91 AMM Brinn, Algebraic Coding Theory in the Undergraduate Curriculum 1984 91 AMM Ward, review of van Lint (1982) 1984 91 AMM Boolos, The Logic of Provability 1984 91 AMM Krantz, letter on mathematics vs. computer science 1984 91 AMM Dubinsky, review of Gersting, Mathematical Structures for Computer Science (1982), etc. 1982 89 AMM Wilf, What is an Answer? 1982 89 AMM Reisel, How to Construct and Analyze Proofs--A Seminar Course 1982 89 AMM Cohen, A Modified Moore Method for Teaching Undergraduate Mathematics 1976 83 AMM Abhyankar, Historical Ramblings in Algebraic Geometry and Related Algebra 1975 82 AMM Halmos & Moise & Piranian, The Problem of Learning to Teach 1974 81 AMM Knuth, Computer Science and its Relation to Mathematics 1972 79 AMM Knuth, Sequences with Precisely k+1 k-Blocks (problem solution) 1995 AMMHPC Heywood & Leopold, Models of Parallelism 1995 AMMHPC Gurd & Snelling, A Terminology for (Parallel) SuperComputing 1995 AMMHPC McColl, Bulk Synchronous Parallel Computing 1995 AMMHPC Natvig, General-Purpose Parallel Programming on the PRAM Model 1995 AMMHPC Nash & Dew & Dyer & Davy, Parallel Algorithm Design on the WPRAM Model 1995 AMMHPC Kumar & Gupta & Winter, CTDNet III -- An Eager Reduction Model with Laziness Features 1995 AMMHPC Rabhi, Exploiting Parallelism in Functional Languages: a `Paradigm-Oriented' Approach 1995 AMMHPC Darlington & To, Building Parallel Applications Without Programming 1995 AMMHPC Skillicorn, Categorical Data Types 1995 AMMHPC Shafarenko, RETRAN: a Recurrent Paradigm for Data-Parallel Computing 1995 AMMHPC Sheffler, Writing Portable Parallel Programs with Match and Move 1995 AMMHPC Lake, ANDF -- Sequential to Parallel 1995 AMMHPC MacDonald, A Framework for Portable Parallel Applications 1995 AMMHPC Muller & Hartel & Hertzberger, Using a Functional Notation to Specify Abstract Simulation Models 1995 AMMHPC Candlin & Phillips, Statistical Modelling as a Tool for Studying the Performance of Parallel Systems 1995 AMMHPC Barrett, Reschedulable Communications 1995 AMMHPC Livesey & Allison, Some Practical Considerations for Object-Oriented Programming on Distributed Memory Parallel Computers 1995 AMMHPC Cornu & Vialle, A Framework for Implementing Highly Parallel Applications on Distributed Memory Architectures 1992 26 AMOPT Jarre, Interior-Point Methods for Convex Programming 1995 AMS Cholak, Automorphisms of the Lattice of Recursively Enumerable Sets 1994 AMS Ballard, Foundational Aspects of ``Non''standard Mathematics 1994 AMS Barcelo & Kalai (Eds.), Jerusalem Combinatorics '93: An International Conference in Combinatorics, May 9-17, 1993, Jerusalem, Israel, Contemporary Mathematics 178 1993 AMS Graver & Servatius & Servatius, Combinatorial Rigidity 1993 AMS Orevkov, Complexity of Proofs and Their Transformations in Axiomatic Theories 1992 AMS Burr (Ed.), The Unreasonable Effectiveness of Number Theory, Proceedings of Symposia in Applied Mathematics, Volume 46 1989 AMS Appel & Haken, Every Planar Map is Four Colorable 1982 AMS Burr, The Mathematics of Networks 1974 AMS Swanson, Mathematics into Type 1973 AMS Steenrod & Halmos & Schiffer & Dieudonne, How to Write Mathematics 1993 81 AMSCI Denning, The Clipper Encryption System 1990 78 AMSCI Gopen & Swan, The Science of Scientific Writing 1987 75 AMSCI Denning, Security of Data in Networks 1992 53 ANNALSDM Hwang & Richards & Winter, The Steiner Tree Problem 1984 87 ANNALSDM Erdos, Some Old and New Problems in Combinatorial Geometry 1984 87 ANNALSDM Fraenkel & Hammer, Pseudo-Boolean Functions and Their Graphs 1984 87 ANNALSDM Moran, Parity in the Realm of Infinite Permutations 1988 35 ANNALSDM Calude, Theories of Computational Complexity 1987 31 ANNALSDM Martello & Laporte & Minoux & Ribeiro, Surveys in Combinatorial Optimization 1987 31 ANNALSDM Blazewicz, Selected Topics in Scheduling Theory 1987 31 ANNALSDM Finke & Burkard & Rendl, Quadratic Assignment Problems 1987 31 ANNALSDM Hammer & Simeone, Order Relations of Variables in 0-1 Programming 1987 31 ANNALSDM Hansen & Labbe & Peeters & Thisse, Single Facility Location on Networks 1987 31 ANNALSDM Laporte & Nobert, Exact Algorithms for the Vehicle Routing Problem 1987 31 ANNALSDM Maculan, The Steiner Problem in Graphs 1987 31 ANNALSDM Martello & Toth, Algorithms for Knapsack Problems 1987 31 ANNALSDM Martello & Toth, Linear Assignment Problems 1987 31 ANNALSDM Minoux, Network Synthesis and Dynamic Network Optimization 1987 31 ANNALSDM Ribeiro, Parallel computer Models and Combinatorial Algorithms 1987 31 ANNALSDM Rinnooy Kan, Probabilistic Analysis of Algorithms 1985 27 ANNALSDM Alspach & Godsil, Cycles in Graphs 1985 27 ANNALSDM Ajtai & Komlos & Szemeredi, First Occurrence of Hamilton Cycles in Random Graphs 1985 24 ANNALSDM Braunmuehl & Verbeek, Input-driven Languages are Recognized in log n Space 1985 24 ANNALSDM Constable, Constructive Mathematics as a Programming Logic I: Some Principles of Theory 1985 24 ANNALSDM Freivalds, Space and Reversal Complexity of Probabilistic One-way Turing Machines 1985 24 ANNALSDM Harel, Recurring Dominoes: Making the Highly Undecidable Highly Understandable 1985 24 ANNALSDM Langmaack, A New Transformational Approach to Partial Correctness Proof Calculi for Algol 68-like Programs with Finite Modes and Simple Side Effects 1985 24 ANNALSDM Macintyre, Effective Determination of the Zeros of p-adic Exponential Functions 1985 24 ANNALSDM Parikh, The Logic of Games and Its Applications 1985 24 ANNALSDM Shamir & Upfal, A Fast Parallel Construction for Classes of Ianov-Schemes 1995 17 ANNALSHC Mackenzie, The Automation of Proof: A Historical and Sociological Exploration 1994 16 ANNALSHC Metcalfe, How Ethernet Was Invented 1993 15 ANNALSHC Hyman, review of Penrose, The Emperor's New Mind: Concerning Computers, Minds, and the Laws of Physics (Oxford, 1989) 1989 11 ANNALSHC Aspray & Horvath & Nagy & Teller & Vonneuman & Wigner, Discussion: John von Neumann--A Case Study of Scientific Creativity 1989 11 ANNALSHC Aspray, John von Neumann's Contributions to Computing and Computer Science 1989 11 ANNALSHC Schwartz, The Invention of Linear Programming 1984 6 ANNALSHC Trakhtenbrot, A Survey of Russian Approaches to Perebor (Brute-Force Search) Algorithms 1981 3 ANNALSHC Greibach, Formal Languages: Origins and Directions 1981 3 ANNALSHC Hartmanis, Observations About the Development of Theoretical Computer Science 1981 3 ANNALSHC Kleene, Origins of Recursive Function Theory 1990 1 ANNALSMAI Kleinberg, Stochastic Discrimination 1981 21 ANNALSML Maass, Recursively Invariant beta-Recursion Theory 1979 16 ANNALSML Maass, On alpha- and beta-Recursively Enumerable Degrees 1978 13 ANNALSML Maass, Inadmissibility, Tame R. E. Sets and the Admissible Collapse 1997 84 ANNALSPAL Jain & Sharma, Characterizing Language Identification in Terms of Computable Numberings 1997 84 ANNALSPAL Shinoda, Strong Polynomial-Time Reducibility 1997 84 ANNALSPAL Cai & Chen & Downey & Fellows, Advice Classes of Parameterized Tractability 1997 84 ANNALSPAL Haught & Slaman, Automorphisms in the PTIME-Turing Degrees of Recursive Sets 1997 83 ANNALSPAL Carbone, Interpolants, Cut Elimination and Flow Graphs for the Propositional Calculus 1996 81 ANNALSPAL Mac Lane, Stephen Cole Kleene -- A Reminiscence 1996 81 ANNALSPAL Moschovakis, A Classical View of the Intuitionistic Continuum 1996 81 ANNALSPAL Vesley, Realizing Brouwer's Sequences 1996 81 ANNALSPAL Feferman, Computation on Abstract Data Types. The Extensional Approach, with an Application to Streams 1996 81 ANNALSPAL Shoenfield, Priority Constructions 1996 81 ANNALSPAL Nerode & Remmel, On the Lattices of NP-Subspaces of a Polynomial Time Vector Space over a Finite Field 1996 81 ANNALSPAL Sacks, Effective Forcing versus Proper Forcing 1996 81 ANNALSPAL Lipton & O'Donnell, Some Intuitions behind Realizability Semantics for Constructive Logic: Tableaux and Lauchli Countermodels 1996 80 ANNALSPAL Beame & Pitassi, An Exponential Separation between the Parity Principle and the Pigeonhole Principle 1996 80 ANNALSPAL Yamakami, Polynomial Games and Determinacy 1996 79 ANNALSPAL Barendsen & Bezem, Polymorphic Extensions of Simple Type Structures. With an Application to a Bar Recursive Minimization 1996 79 ANNALSPAL Schwentick, On Winning Ehrenfeucht Games and Monadic NP 1996 78 ANNALSPAL Archangelsky & Dekhtyar & Taitslin, Linear Logic for Nets with Bounded Resources 1996 78 ANNALSPAL Arslanov & Lempp & Shore, Interpolating d-r.e. and REA Degrees between r.e. Degrees 1996 78 ANNALSPAL Artemov & Krupski, Data Storage Interpretation of Labeled Modal Logic 1996 78 ANNALSPAL Dabrowski & Moss & Parikh, Topological Reasoning and the Logic of Knowledge 1996 78 ANNALSPAL Eiter & Gottlob & Gurevich, Normal Forms for Second-order Logic over Finite Structures, and Classification of NP Optimization Problems 1996 78 ANNALSPAL Ge & Nerode, Effective Content of the Calculus of Variations I: Semi-continuity and the Chattering Lemma 1996 78 ANNALSPAL Kanovich, Linear Logic Automata 1996 78 ANNALSPAL Makowsky & Pnueli, Arity and Alternation in Second-order Logic 1996 78 ANNALSPAL Nerode & Remmell & Yakhnis, McNaughton Games and Extracting Strategies for Concurrent Programs 1996 78 ANNALSPAL Selivanov, On Recursively Enumerable Structures 1996 78 ANNALSPAL Shelah, Was Sierpinski Right? III, Can Continuum-c.c. Times c.c.c. be Continuum-c.c.? 1996 77 ANNALSPAL Ehrhard, Projecting Sequential Algorithms on Strongly Stable Functions 1996 77 ANNALSPAL Michaux & Villemaire, Presburger Arithmetic and Recognizability of Sets of Natural Numbers by Automata: New Proofs of Cobham's and Semenov's Theorems 1996 77 ANNALSPAL Chen & Homer, The Bounded Injury Priority Method and the Learnability of Unions of Rectangles 1996 77 ANNALSPAL Gradel & McColm, Hierarchies in Transitive Closure Logic, Stratified Datalog and Infinitary Logic 1995 76 ANNALSPAL Huuskonen, Observations about Scott and Karp Trees 1995 76 ANNALSPAL Sommer, Transfinite Induction within Peano Arithmetic 1995 76 ANNALSPAL Zapletal, More on the Cut and Choose Game 1995 76 ANNALSPAL von Plato, The Axioms of Constructive Geometry 1995 75 ANNALSPAL Buchholz, Proof-theoretic Analysis of Termination Proofs 1995 75 ANNALSPAL Buss, Relating the Bounded Arithmetic and Polynomial Time Hierarchies 1995 75 ANNALSPAL Kanovich, Petri Nets, Horn Programs, Linear Logic and Vector Games 1995 75 ANNALSPAL Kopylov, On NP-completeness in Linear Logic 1995 75 ANNALSPAL Niggl, Towards the Computational Complexity of PR^infinity-Terms 1995 74 ANNALSPAL Buss & Ignjatovic, Unprovability of Consistency Statements in Fragments of Bounded Arithmetic 1995 74 ANNALSPAL Kolaitis & Vaananen, Generalized Quantifiers and Pebble Games on Finite Structures 1995 73 ANNALSPAL Abrahamson & Downey & Fellows, Fixed-Parameter Tractability and Completeness IV: On Completeness for W[P] and PSPACE Analogues 1995 73 ANNALSPAL Banach, Sequent Reconstruction in LLM--A Sweepline Proof 1995 73 ANNALSPAL Palmgren, A Constructive Approach to Nonstandard Analysis 1995 73 ANNALSPAL Seiferas & Meyer, Characterizations of Realizable Space Complexities 1994 70 ANNALSPAL Paris & Vencovska & Wilmers, A Natural Prior Probability Distribution Derived from the Propositional Calculus 1994 70 ANNALSPAL Handley & Wainer, Equational Derivation vs. Computation 1994 70 ANNALSPAL Downey & Gasarch & Moses, The Structure of the Honest Polynomial m-Degrees 1994 69 ANNALSPAL Dowek, Third Order Matching is Decidable 1994 69 ANNALSPAL Halpern & Kapron, Zero-One Laws for Modal Logic 1994 69 ANNALSPAL Kanovich, The Complexity of Horn Fragments of Linear Logic 1994 69 ANNALSPAL Klarlund, Progress Measures, Immediate Determinacy, and a Subset Construction for Tree Automata 1994 69 ANNALSPAL Nakano, A Constructive Logic behind the Catch and Throw Mechanism 1994 67 ANNALSPAL Archangelsky & Taitslin, Linear Logic with Fixed Resources 1994 67 ANNALSPAL Bauerle & Remmel, On Speedable and Levelable Vector Spaces 1994 67 ANNALSPAL Kagan & Nerode & Subrahmanian, Computing Definite Logic Programs by Partial Instantiation 1994 67 ANNALSPAL Kanovich, Linear Logic as a Logic of Computations 1994 67 ANNALSPAL Marek & Nerode & Remmel, A Context for Belief Revision: Forward Chaining Normal Nonmonotonic Rule Systems 1994 67 ANNALSPAL Matiyasevich, A Direct Method for Simulating Partial Recursive Functions by Diophantine Equations 1994 66 ANNALSPAL Fortnow & Gasarch & Jain & Kinber & Kummer & Kurtz & Pleszkovich & Slaman & Solovay & Stephan, Extremes in the Degrees of Inferability 1994 66 ANNALSPAL Stewart, Context-sensitive Transitive Closure Operators 1993 65 ANNALSPAL Oikkonen & Vaananen, Game-theoretic Inductive Definability 1993 65 ANNALSPAL McNaughton, Infinite Games Played on Finite Graphs 1993 63 ANNALSPAL Downey & Stob, Splitting Theorems in Recursion Theory 1993 63 ANNALSPAL Cook & Urquhart, Functional Interpretations of Feasibly Constructive Arithmetic 1993 63 ANNALSPAL Biro & Sain, Peano Arithmetic as Axiomatization of the Time Frame in Logics of Programs and in Dynamic Logics 1993 63 ANNALSPAL Louveau & Shelah & Velickovic, Borel Partitions of Infinite Subtrees of a Perfect Tree 1993 63 ANNALSPAL Ambos-Spies & Shore, Undecidability and 1-Types in the Recursively Enumerable Degrees 1993 63 ANNALSPAL Kucera, On Relative Randomness 1993 62 ANNALSPAL Yakhnis & Yakhnis, Gurevich-Harrington's Games Defined by Finite Automata 1993 60 ANNALSPAL Rathjen & Weiermann, Proof-Theoretic Investigations on Kruskal's Theorem 1992 57 ANNALSPAL Baaz & Leitsch, Complexity of Resolution Proofs and Function Introduction 1992 56 ANNALSPAL Dekker & Ellentuck, Myhill's Work in Recursion Theory 1992 56 ANNALSPAL Clote & Takeuti, Bounded Arithmetic for NC, ALogTIME, L and NL 1992 56 ANNALSPAL Crossley & Remmel, Cancellation Laws for Polynomial-Time p-Isolated Sets 1992 56 ANNALSPAL Harkleroad, Polynomial-Time Analogues of Isolatedness 1992 56 ANNALSPAL Lincoln & Mitchell & Scedrov & Shankar, Decision Problems for Propositional Linear Logic 1992 56 ANNALSPAL Cenzer & Remmel, Polynomial-Time Abelian Groups 1991 54 ANNALSPAL Germano & Mazzanti, General Iteration and Unary Functions 1991 54 ANNALSPAL Cenzer & Remmel, Polynomial-Time versus Recursive Models 1991 54 ANNALSPAL Zivaljevic, Every Borel Function is Monotone Borel 1991 53 ANNALSPAL Gallier, What's So Special about Kruskal's Theorem and the Ordinal Gamma_0? A Survey of Some Results in Proof Theory 1991 53 ANNALSPAL Seese, The Structure of the Models of Decidable Monadic Theories of Graphs 1991 53 ANNALSPAL Allen, Arithmetizing Uniform NC 1991 53 ANNALSPAL Buss, The Undecidability of k-Provability 1991 52 ANNALSPAL Buss, Propositional consistency Proofs 1991 52 ANNALSPAL Jockusch & Soare, Degrees of Orderings Not Isomorphic to Recursive Linear Orderings 1991 52 ANNALSPAL Kanamori, Regressive Partition Relations, n-Subtle Cardinals, and Borel Diagonalization 1991 52 ANNALSPAL Keisler, From Discrete to Continuous Time 1991 52 ANNALSPAL Krajicek & Pudlak & Takeuti, Bounded Arithmetic and the Polynomial Hierarchy 1991 51 ANNALSPAL Abramsky, Domain theory in Logical Form 1991 51 ANNALSPAL Vardi, Verification of Concurrent Programs: The Automata-theoretic Framework 1991 51 ANNALSPAL Mitchell & Moggi, Kripke-style Models for Typed Lambda Calculus 1991 51 ANNALSPAL Miller & Nadathur & Pfenning & Scedrov, Uniform Proofs as a Foundation for Logic Programming 1991 51 ANNALSPAL Mendler, Inductive Types and Type Constraints in the Second-order Lambda Calculus 1990 50 ANNALSPAL Labhalla & Lombardi, Real Numbers, Continued Fractions and Complexity Classes 1990 50 ANNALSPAL McColm, When is Arithmetic Possible? 1990 48 ANNALSPAL Knight, Constructions by Transfinitely Many Workers 1990 48 ANNALSPAL Yakhnis & Yakhnis, Extension of Gurevich-Harrington's Restricted Memory Determinacy Theorem: A Criterion for the Winning Player and an Explicit Class of Winning Strategies 1990 48 ANNALSPAL Compton & Henson, A Uniform Method for Proving Lower Bounds on the Computational Complexity of Logical Theories 1989 45 ANNALSPAL Ajtai, First-order Definability on Finite Structures 1989 45 ANNALSPAL Beigel & Gasarch, On the Complexity of Finding the Chromatic Number of a Recursive Graph II: The Unbounded Case 1989 45 ANNALSPAL Beigel & Gasarch, On the Complexity of Finding the Chromatic Number of a Recursive Graph I: The Bounded Case 1989 44 ANNALSPAL Ambos-Spies & Soare, The Recursively Enumerable Degrees Have Infinitely Many One-Types 1989 44 ANNALSPAL Crossley & Scott, Completeness Proofs for Propositional Logic with Polynomial-Time Connectives 1989 44 ANNALSPAL Nerode & Remmel, Complexity-Theoretic Algebra II: Boolean Algebras 1989 44 ANNALSPAL Solovay, Injecting Inconsistencies into Models of PA 1989 44 ANNALSPAL Yasugi, The Machinery of Consistency Proofs 1989 41 ANNALSPAL Krajicek, On the Number of Steps in Proofs 1988 39 ANNALSPAL Farmer, A Unification Algorithm for Second-order Monadic Terms 1988 38 ANNALSPAL Kanda, Recursion Theorems and Effective Domains 1988 37 ANNALSPAL Lo, On the Computational Complexity of the Theory of Abelian Groups 1988 37 ANNALSPAL Brandt, Index Sets in the Arithmetical Hierarchy 1988 37 ANNALSPAL Farkas & Szabo, On the Programs-as-Formulas Interpretation of Parallel Programs in Peano Arithmetic 1987 33 ANNALSPAL Kanamori & McAloon, On Goedel Incompleteness and Finite Combinatorics 1983 24 ANNALSPAL Ajtai, Sigma^1_1-Formulae on Finite Structures 1983 24 ANNALSPAL Maass & Stob, The Intervals of the Lattice of Recursively Enumerable Sets Determined by Major Subsets 1990 18 ANNALSPROB Ornstein & Shields, Universal Almost Sure Data Compression 1989 17 ANNALSPROB Cover & Gacs & Gray, Kolmogorov's Contributions to Information Theory and Algorithmic Complexity 1990 4 ANNREVCS Hopcroft, Reflections on Computer Science 1990 4 ANNREVCS Schneck, Supercomputers 1990 4 ANNREVCS Pearl, Reasoning Under Uncertainty 1990 4 ANNREVCS Satyanarayanan, A Survey of Distributed File Systems 1990 4 ANNREVCS Immerman, Complexity Classes 1990 4 ANNREVCS Bach, Number Theoretic Algorithms 1990 4 ANNREVCS Lam, Instruction Scheduling for Superscalar Architectures 1990 4 ANNREVCS Gasser & Hill, Engineering Coordinated Problem Solvers 1990 4 ANNREVCS Dietterich, Machine Learning 1990 4 ANNREVCS La Paugh & Pinter, Channel Routing for Integrated Circuits 1990 4 ANNREVCS Feldman & Cooper & Koch & Lippman & Rumelhart & Sabbah & Waltz, Connectionist Systems 1990 4 ANNREVCS Lesgold & Chipman & Brown & Soloway, Intelligent Training Systems 1990 4 ANNREVCS Buchanan & Bobrow & Davis & McDermott & Shortliffe, Knowledge-Based Systems 1990 4 ANNREVCS Mitchell & Buchanan & DeJong & Dietterich & Rosenbloom & Waibel 1990 4 ANNREVCS Weischedel & Carbonell & Grosz & Lehnert & Marcus & Perrault & Wilensky, Natural Language Processing 1990 4 ANNREVCS Balzer & Belz & Dewar & Fisher & Gabriel & Guttag & Hudak & Wand, Prototyping 1990 4 ANNREVCS Hopcroft & Cutkosky & Lozano-Perez, Robotics, A Long-Range Plan to Maximize National Capabilities 1990 4 ANNREVCS Makhoul & Jelinek & Rabiner & Weinstein & Zue, Spoken Language Systems 1990 4 ANNREVCS Siewiorek & Hsiao & Rennels & Gray & Williams, Ultra-Dependable Architectures 1990 4 ANNREVCS Kanade & Binford & Poggio & Rosenfeld, Vision 1988 3 ANNREVCS Reeke, Protein Folding: Computational Approaches to an Exponential-Time Problem 1988 3 ANNREVCS Buchberger & Collins & Kutzler, Algebraic Methods for Geometric Reasoning 1988 3 ANNREVCS Constable, Themes in the Development of Programming Logics circa 1963-1987 1988 3 ANNREVCS Abelson & Halfant & Katzenelson & Sussman, The LISP Experience 1988 3 ANNREVCS Eppstein & Galil, Parallel Algorithmic Techniques for Combinatorial Computation 1988 3 ANNREVCS Stickel, Resolution Theorem Proving 1988 3 ANNREVCS von zur Gathen, Algebraic Complexity Theory 1988 3 ANNREVCS O'Rourke, Computational Geometry 1987 2 ANNREVCS Fahlman, Common Lisp 1987 2 ANNREVCS Halpern, Using Reasoning About Knowledge to Analyze Distributed Systems 1987 2 ANNREVCS Zucker, The Emerging Paradigm of Computational Vision 1987 2 ANNREVCS Reiter, Nonmonotonic Reasoning 1987 2 ANNREVCS McDermott, Logic, Problem Solving, and Deduction 1987 2 ANNREVCS Georgeff, Planning 1987 2 ANNREVCS McKeown & Swartout, Language Generation and Explanation 1987 2 ANNREVCS Pearl & Korf, Search Techniques 1987 2 ANNREVCS Thorpe & Hebert & Kanade & Shafer, Vision and Navigation for the Carnegie-Mellon Navlab 1987 2 ANNREVCS Maxion & Siewiorek & Elkind, Techniques and Architectures for Fault-Tolerant Computing 1987 2 ANNREVCS Barstow, Knowledge-Based Software Tools 1987 2 ANNREVCS Rudin, Network Protocols and Tools to Help Produce Them 1987 2 ANNREVCS Kaltofen, Computer Algebra Algorithms 1987 2 ANNREVCS Megiddo, Linear Programming (1986) 1987 2 ANNREVCS Kannan, Algorithmic Geometry of Numbers 1987 2 ANNREVCS Clarke & Grumberg, Research on Automatic Verification of Finite-State Concurrent Systems 1987 2 ANNREVCS Kurland & Kurland, Computer Applications in Education: A Historical Overview 1986 1 ANNREVCS Sproull, Frame-Buffer Display Architectures 1986 1 ANNREVCS Galil, Sequential and Parallel Algorithms for Finding Maximum Matchings in Graphs 1986 1 ANNREVCS Wozniakowski, Information-Based Complexity 1996 2 ANTS Adleman & Huang, Counting Rational Points on Curves and Abelian Varieties over Finite Fields 1996 2 ANTS Belabas, Computing Cubic Fields in Quasi-Linear Time 1996 2 ANTS Bernstein, Fast Ideal Arithmetic via Lazy Localization 1996 2 ANTS Brent & van der Poorten & te Riele, A Comparative Study of Algorithms for Computing Continued Fractions of Algebraic Numbers 1996 2 ANTS Denny & Muller, On the Reduction of Composed Relations from the Number Field Sieve 1996 2 ANTS Elkenbracht-Huizing, A Multiple Polynomial General Number Field Sieve 1996 2 ANTS Fermigier, Construction of High-Rank Elliptic Curves over Q and Q(t) 1996 2 ANTS Ford & Havas, A New Algorithm and Refined Bounds for Extended Gcd Computation 1996 2 ANTS Gebel & Petho & Zimmer, Computing S-Integral Points on Elliptic Curves 1996 2 ANTS Giesbrecht, Probabilistic Computation of the Smith Normal Form of a Sparse Integer Matrix 1996 2 ANTS McKee & Pinch, Old and New Deterministic Factoring Algorithms 1996 2 ANTS Meyer & Sorenson, Efficient Algorithms for Computing the Jacobi Symbol 1996 2 ANTS Niklasch, The Number Field Database on the World Wide Web Server 1996 2 ANTS Poonen, Computational Aspects of Curves of Genus at Least 2 1996 2 ANTS Rossner & Seifert, The Complexity of Approximate Optima for Greatest Common Divisor Computations 1996 2 ANTS Schirokauer & Weber & Denny, Discrete Logarithms: The Effectiveness of the Index Calculus Method 1996 2 ANTS Smart, How Difficult Is It to Solve a Thue Equation? 1996 2 ANTS Tsfasman, Algebraic Geometry Lattices and Codes 1996 2 ANTS Weber, Computing Discrete Logarithms with the General Number Field Sieve 1994 1 ANTS Alford & Granville & Pomerance, On the Difficulty of Finding Reliable Witnesses 1994 1 ANTS Bosma & Stevenhagen, Density Computations for Real Quadratic 2-Class Groups 1994 1 ANTS Golliver & Lenstra & McCurley, Lattice Sieving and Trial Division 1994 1 ANTS Adleman & DeMarrais & Huang, A Subexponential Algorithm for Discrete Logarithms over the Rational Subgroup of the Jacobians of Large Genus Hyperelliptic Curves over Finite Fields 1994 1 ANTS Dodson & Haines, Computing Rates of Growth of Division Fields on CM Abelian Varieties 1994 1 ANTS Paulus, Algorithms for CM-Fields 1994 1 ANTS Couveignes & Morain, Schoof's Algorithm and Isogeny Cycles 1994 1 ANTS Stephens, Integer Points on Rational Elliptic Curves 1994 1 ANTS Lehmann & Maurer & Muller & Shoup, Counting the Number of Points on Elliptic Curves over finite Fields of Characteristic Greater than Three 1994 1 ANTS Lipton, Straight-Line Complexity and Integer Factorization 1994 1 ANTS Kozen & Landau & Zippel, Decomposition of Algebraic Functions 1994 1 ANTS Rubinfeld & Zippel, A New Modular Interpolation Algorithm for Factoring Multivariate Polynomials 1994 1 ANTS Adleman, The Function Field Sieve 1994 1 ANTS Elkies, Heegner Point Computations 1994 1 ANTS Cremona, Computing the Degree of a Modular Parametrization 1994 1 ANTS McConnell, Galois Representations from the Cohomology of SL(3,Z) 1994 1 ANTS Daude & Flajolet & Vallee, An Analysis of the Gaussian Algorithm for Lattice Reduction 1994 1 ANTS Kaib, A Fast Variant of the Gaussian Reduction Algorithm 1994 1 ANTS Buchmann, Reducing Lattice Bases by Means of Approximations 1994 1 ANTS Shallit & Sorenson, Analysis of a Left-Shift Binary GCD Algorithm 1994 1 ANTS Majewski & Havas, The Complexity of Greatest Common Divisor Computations 1994 1 ANTS van der Poorten, Explicit Formulas for Units in Certain Quadratic Number Fields 1994 1 ANTS Evdokimov, Factorization of Polynomials over Finite Fields in Subexponential Time under GRH 1994 1 ANTS Gao & Vanstone, On Orders of Optimal Normal Basis Generators 1994 1 ANTS Volcheck, Computing in the Jacobian of a Plane Algebraic Curve 1994 1 ANTS Thiel, Under the Assumption of the Generalized Riemann Hypothesis Verifying the Class Number Belongs to NP intersect Co-NP 1994 1 ANTS Hajir, Calculating the Class Number of Certain Hilbert Class Fields 1994 1 ANTS Adleman & Huang & Kompella, Efficient Checking of Computations in Number Theory 1994 1 ANTS Lay & Zimmer, Constructing Elliptic Curves with Given Group Order over Large Finite Fields 1994 1 ANTS Deleglise & Rivat, Computing pi(x), M(x) and Psi(x) 1994 1 ANTS Shparlinski, On Some Applications of Finitely Generated Semi-groups 1994 1 ANTS Pritchard, Improved Incremental Prime Number Sieves 1994 1 ANTS Ji & Lu, On Dispersion and Markov Constants 1994 1 ANTS Adleman & McCurley, Open Problems in Number Theoretic Complexity, II 1992 APALGS Cole, Parallel Software Paradigms 1992 APALGS Axford, The Divide-and-Conquer Paradigm as a Basis for Parallel Language Design 1992 APALGS Shumsheruddin, The Neural Network Paradigm 1992 APALGS Bustard & Weston, Problem-Driven versus Hardware-Driven Approaches to the Design of Concurrent Programs 1992 APALGS McKeown & Rayward-Smith & Rush, Parallel Branch-and-Bound 1992 APALGS Krishnamurthy, Algebraic Transformation Approach for Parallelism 1992 APALGS Wing, Discrete Event Simulation in Parallel 1992 APALGS Husbands, Genetic Algorithms in Optimisation and Adaptation 1992 APALGS Rajasekaran, Randomised Algorithms for Packet Routing on the Mesh 1992 APALGS Uresin & Dubois, Asynchronous Iterative Algorithms: Models and Convergence 1992 APALGS Archibald, Parallel Dynamic Programming 1992 APALGS Han, Parallel Derandomisation Techniques 1992 APALGS Hake, Parallel Algorithms for Matrix Operations and their Performance on Multiprocessor Systems 1992 APALGS Shumsheruddin, Neural Networks for Robot Control 1992 APALGS Kronsjo, Computational Complexity of Parallel Algorithms 1993 12 APNUMMATH Jessup, A Case against a Divide and Conquer Approach to the Nonsymmetric Eigenvalue Problem 1991 8 APNUMMATH Singh & Kulkarni, An Integrated Solution Strategy on Parallel Computers 1990 6 APNUMMATH Joseph & Levine & Liukkonen, Randomized Newton-Raphson 1982 APP Golomb, Shift Register Sequences, revised edition 1991 APPFIB Anderson, A Fibonacci-Based Pseudo-Random Number Generator 1991 APPFIB Arkin & Arney & Dewald & Giordano, Supercube 1991 APPFIB Capocelli, A Generalization of the Fibonacci Search 1991 APPFIB Fielder & Alford, Pascal's Triangle: Top Gun or Just One of the Gang? 1991 APPFIB Long & Ando, Two Generalizations of Gould's Star of David Theorem 1991 APPFIB Nagasaka & Shiue & Ho, A Fast Algorithm of the Chinese Remainder Theorem and Its Application to Fibonacci Numbers 1991 APPFIB Schaake & Turner, Generating the Pythagorean Triples via Simple Continued Fractions 1991 APPFIB Schaake & Turner, On the Moebius Knot Tree and Euclid's Algorithm 1993 APTCC Bonet, Number of Symbols in Frege Proofs with and without the Deduction Rule 1993 APTCC Buss, Algorithm for Boolean Formula Evaluation and for Tree Contraction 1993 APTCC Clote, On Polynomial Size Frege Proofs of Certain Combinatorial Principles 1993 APTCC Hajek, Interpretability and Fragments of Arithmetic 1993 APTCC Hajek & Montagna & Pudlak, Abbreviating Proofs Using Metamathematical Rules 1993 APTCC Kaye, Open Induction, Tennenbaum Phenomena, and Complexity Theory 1993 APTCC Razborov, An Equivalence between Second Order Bounded Domain Bounded Arithmetic and First Order Bounded Arithmetic 1993 APTCC Verbrugge, Feasible Interpretability 1994 62 ARCHMATH Oettli & Yamasaki, On Gale's Feasibility Theorem for Certain Infinite Networks 1995 ARLOSAP King & Kovacs & Okerson, Directory of Electronic Journals, Newsletters and Academic Discussion Lists, 5th Edition 1989 ARNOLD Allenby & Redfern, Introduction to Number Theory with Computing 1997 ARONSON Koppel, Meta-halakhah: Logic, Intuition, and the Unfolding of Jewish Law 1994 38 ARSCOMB Pelc, Searching with Permanently Faulty Tests 1993 36 ARSCOMB Radziszowski, On the Ramsey Number R(K_5 - e, K_5 - e) 1992 34 ARSCOMB Jungreis & Reid, Labeling Grids 1992 33 ARSCOMB Cummings & Mays, Shuffled Lyndon Words 1991 31 ARSCOMB Yucas, Counting Special Sets of Binary Lyndon Words 1990 29 ARSCOMB Fiol, Connectivity and Superconnectivity of Large Graphs and Digraphs 1990 29 ARSCOMB Fiol & Fabrega & Escudero, Short Paths and Connectivity in Graphs and Digraphs 1990 29 ARSCOMB Ernvall, On Bounds for Nonbinary Arithmetic Codes 1990 29 ARSCOMB Read & Wright, Computing with Three-colourable Graphs: A Survey 1990 29 ARSCOMB Comellas & Morillo & Fiol, Diameter and Mean Distance of Bipartite Digraphs Related to Plane Tessellations 1990 29 ARSCOMB PQ-trees and Triconnectivity 1990 29 ARSCOMB Harzheim, A Reconstruction Problem for Linearly Ordered Sets 1990 29 ARSCOMB Faudree & Schelp & Simonovits, On Some Ramsey Type Problems Connected with Paths, Cycles and Trees 1990 29 ARSCOMB Ray & Schmitt & Wright, Colouring Simplicial Complexes 1990 29 ARSCOMB Chartrand & Goddard & Henning & Lesniak & Swart & Wall, Which Graphs are Distance Graphs? 1990 29 ARSCOMB Csaki & Mohanty & Saran, On Random Walks in a Plane 1989 27 ARSCOMB Gernert, Forbidden and Unavoidable Subgraphs 1989 27 ARSCOMB Pelc, Detecting a Counterfeit Coin with Unreliable Weighings 1988 26 ARSCOMB Lidl & Matthews, A Microcomputer Implementation of Galois Fields 1988 26 ARSCOMB Little & Tutte & Younger, A Theorem on Integer Flows 1988 26 ARSCOMB Mackenzie & Seberry, Maximal q-ary Codes and Plotkin's Bound 1988 26 ARSCOMB Duke, Freedom in Matroids 1988 25 ARSCOMB Hoede, Crystallization: A New Type of Heuristic for the Travelling Salesman Problem and other Combinatorial Optimization Problems 1987 24 ARSCOMB Leonard, A Prefix Problem 1996 ARTECH Oppliger, Authentication Systems for Secure Networks 1995 2 ARTLIFE Pesavento, An Implementation of von Neumann's Self-Reproducing Machine 1995 2 ARTLIFE Paredis, Coevolutionary Computation 1995 ASASCS Wu, Random Shuffling: A New Approach to Matching Problem 1995 ASASCS Lent & Modarres, An Algorithm for Simultaneous Selection of Order Statistics 1996 5 ASIACRYPT Miyaji, A Message Recovery Signature Scheme Equivalent to DSA over Elliptic Curves 1996 5 ASIACRYPT Biehl & Meyer & Thiel, Cryptographic Protocols Based on Real-Quadratic A-Fields 1996 5 ASIACRYPT Anderson & Vaudenay, Minding Your p's and q's 1996 5 ASIACRYPT Just & Vaudenay, Authenticated Multi-Party Key Agreement 1996 5 ASIACRYPT McCurley, Cryptography and the Internet: Lessons and Challenges 1996 5 ASIACRYPT Lenstra, Generating Standard DSA Signatures Without Long Inversion 1996 5 ASIACRYPT De Win & Bosselaers & Vandenberghe & De Gersem & Vandewalle, A Fast Software Implementation for Arithmetic Operations in GF(2^n) 1996 5 ASIACRYPT Knudsen & Preneel, Hash Functions Based on Block Ciphers and Quaternary Codes 1996 5 ASIACRYPT Nyberg, Generalized Feistel Networks 1996 5 ASIACRYPT O'Connor, On Applying Linear Cryptanalysis to IDEA 1996 5 ASIACRYPT Fan & Lei, A Multi-Recastable Ticket Scheme for Electronic Elections 1996 5 ASIACRYPT Michels & Horster, Some Remarks on a Receipt-Free and Universally Verifiable Mix-Type Voting Scheme 1996 5 ASIACRYPT Zhou & Gollmann, Observations on Non-repudiation 1996 5 ASIACRYPT Bleichenbacher & Maurer, On the Efficiency of One-Time Digital Signatures 1996 5 ASIACRYPT Sakurai, A Hidden Cryptographic Assumption in No-Transferable Identification Schemes 1996 5 ASIACRYPT Tsujii, Electronic Money and Key Management from Global and Regional Points of View 1996 5 ASIACRYPT Kobara & Imai, Limiting the Visible Space Visual Secret Sharing Schemes and Their Application to Human Identification 1996 5 ASIACRYPT Maurer & Wolf, Towards Characterizing When Information-Theoretic Key Agreement Is Possible 1996 5 ASIACRYPT Korjik & Kushnir, Key Sharing Based on the Wire-Tap Channel Type II Concept with Noisy Main Channel 1996 5 ASIACRYPT Kurosawa & Satoh, Generalization of Higher Order SAC to Vector Output Boolean Functions 1996 5 ASIACRYPT Chee & Lee & Lee & Sung, On the Correlation Immune Functions and Their Nonlinearity 1996 5 ASIACRYPT Abe & Fujisaki, How to Date Blind Signatures 1996 5 ASIACRYPT Pointcheval & Stern, Provably Secure Blind Signature Schemes 1996 5 ASIACRYPT M'Raihi, Cost-Effective Payment Schemes with Privacy Regulation 1996 5 ASIACRYPT Chan & Frankel & MacKenzie & Tsiounis, Mis-representation of Identities in E-Cash Schemes and How to Prevent it 1996 5 ASIACRYPT Frankel & Tsiounis & Yung, ``Indirect Discourse Proofs'': Achieving Efficient Fair Off-Line E-cash 1996 5 ASIACRYPT Stern, The Validation of Cryptographic Algorithms 1996 5 ASIACRYPT Kim & Park & Won, Convertible Group Signatures 1996 5 ASIACRYPT Mambo & Sakurai & Okamoto, How to Utilize the Transformability of Digital Signatures for Solving the Oracle Problem 1996 5 ASIACRYPT Michels & Horster, On the Risk of Disruption in Several Multiparty Signature Schemes 1996 5 ASIACRYPT Geiselmann & Gollmann, Correlation Attacks on Cascades of Clock Controlled Shift Registers 1996 5 ASIACRYPT Lee & Chee & Park & Park, Conditional Correlation Attack on Nonlinear Filter Generators 1996 5 ASIACRYPT Chabaud & Stern, The Cryptographic Security of the Syndrome Decoding Problem for Rank Distance Codes 1996 5 ASIACRYPT Cowie & Dodson & Elkenbracht-Huizing & Lenstra & Montgomery & Zayer, A World Wide Number Field Sieve Factoring Record: on to 512 Bits 1994 4 ASIACRYPT Beth, Multifeature Security through Homomorphic Encryption 1994 4 ASIACRYPT Desmedt & Di Crescenzo & Burmester, Multiplicative Non-abelian Sharing Schemes and their Application to Threshold Cryptography 1994 4 ASIACRYPT Okada & Kurosawa, Lower Bound on the Size of Shares of Nonperfect Secret Sharing Schemes 1994 4 ASIACRYPT Jackson & Martin & O'Keefe, On Sharing Many Secrets 1994 4 ASIACRYPT Kurosawa & Okada, Combinatorial Interpretation of Secret Sharing Schemes 1994 4 ASIACRYPT Mihaljevic, A Correlation Attack on the Binary Sequence Generators with Time-Varying Output Function 1994 4 ASIACRYPT Fuster-Sabater & Caballero-Gil, On the Linear Complexity of Nonlinearly Filtered PN-Sequences 1994 4 ASIACRYPT Golic, Intrinsic Statistical Weakness of Keystream Generators 1994 4 ASIACRYPT Chee & Lee & Kim, Semi-Bent Functions 1994 4 ASIACRYPT Seberry & Zhang & Zheng, Structures of Cryptographic Functions with Strong Avalanche Characteristics 1994 4 ASIACRYPT Meadows, Formal Verification of Cryptographic Protocols: A Survey 1994 4 ASIACRYPT Yacobi, Efficient Electronic Money 1994 4 ASIACRYPT Niemi & Renvall, How to Prevent Buying of Votes in Computer Elections 1994 4 ASIACRYPT Boyd & Mao, Design and Analysis of Key Exchange Protocols via Secure Channel Identification 1994 4 ASIACRYPT De Santis & Okamoto & Persiano, Zero-Knowledge Proofs of Computational Power in the Shared String Model 1994 4 ASIACRYPT Imai, Information Security Aspects of Spread Spectrum Systems 1994 4 ASIACRYPT Safavi-Naini & Tombak, Combinatorial Structure of A-Codes with r-fold Security 1994 4 ASIACRYPT Horster & Michels & Petersen, Meta-Message Recovery and Meta-Blind Signature Schemes Based on the Discrete Logarithm Problem and their Applications 1994 4 ASIACRYPT Alabbadi & Wicker, A Digital Signature Scheme Based on Linear Error-Correcting Block Codes 1994 4 ASIACRYPT Beguin & Quisquater, Secure Acceleration of DSS Signatures Using Insecure Server 1994 4 ASIACRYPT Atkins & Graff & Lenstra & Leyland, The Magic Words are Squeamish Ossifrage 1994 4 ASIACRYPT Biham, Cryptanalysis of Multiple Modes of Operation 1994 4 ASIACRYPT Tokita & Sorimachi & Matsui, Linear Cryptanalysis of LOKI and s^2 DES 1994 4 ASIACRYPT Patarin, Collisions and Inversions for Damgard's Whole Hash Function 1994 4 ASIACRYPT Charnes & Pieprzyk, Attacking the SL_2 Hashing Scheme 1994 4 ASIACRYPT Kurosawa & Okada & Sakano, Security of the Center in Key Distribution Schemes 1994 4 ASIACRYPT Matsumoto, Incidence Structures for Key Sharing 1994 4 ASIACRYPT Smith & Skinner, A Public-Key Cryptosystem and a Digital Signature System Based on the Lucas Function Analogue to Discrete Logarithms 1994 4 ASIACRYPT Abe & Morita, Higher Radix Nonrestoring Modular Multiplication Algorithm and Public-Key LSI Architecture with Limited Hardware Resources 1994 4 ASIACRYPT Kurosawa & Okada & Tsujii, Low Exponent Attack against Elliptic Curve RSA 1994 4 ASIACRYPT O'Connor & Golic, A Unified Markov Approach to Differential and Linear Cryptanalysis 1994 4 ASIACRYPT Biham & Biryukov, How to Strengthen DES Using Existing Hardware 1994 4 ASIACRYPT Chang & Dai & Gong, Some Cryptographic Properties of Exponential Functions 1994 4 ASIACRYPT Beaver, Factoring: The DNA Solution 1994 4 ASIACRYPT Stern, Can One Design a Signature Scheme Based on Error-Correcting Codes? 1994 4 ASIACRYPT Carter & Clark & Nielsen, DESV-1: A Variation of the Data Encryption Standard (DES) 1991 1 ASIACRYPT Davies, The Transition from Mechanisms to Electronic Computers, 1940 to 1950 1991 1 ASIACRYPT Knudsen, Cryptanalysis of LOKI 1991 1 ASIACRYPT Brown & Kwan & Pieprzyk & Seberrry, Improving Resistance to Differential Cryptanalysis and the Redesign of LOKI 1991 1 ASIACRYPT Miyano, A Method to Estimate the Number of Ciphertext Pairs for Differential Cryptanalysis 1991 1 ASIACRYPT Kim, Construction of DES-Like S-Boxes Based on Boolean Functions Satisfying the SAC 1991 1 ASIACRYPT Yang & Dai & Zeng, The Data Base of Selected Permutations 1991 1 ASIACRYPT Daemen & Govaerts & Vandewalle, A Framework for the Design of One-Way Hash Functions Including Cryptanalysis of Damgard's One-Way Function Based on a Cellular Automaton 1991 1 ASIACRYPT Sadeghiyan & Zheng & Pieprzyk, How to Construct a Family of Strong One-Way Permutations 1991 1 ASIACRYPT Ogata & Kurosawa, On Claw Free Families 1991 1 ASIACRYPT Zheng & Hardjono & Pieprzyk, Sibling Intractable Function Families and Their Applications 1991 1 ASIACRYPT Ohta & Okamoto, A Digital Multisignature Scheme Based on the Fiat-Shamir Scheme 1991 1 ASIACRYPT Lin & Harn, A Generalized Secret Sharing Scheme with Cheater Detection 1991 1 ASIACRYPT Laih & Harn, Generalized Threshold Cryptosystems 1991 1 ASIACRYPT Safavi-Naini, Feistel Type Authentication Codes 1991 1 ASIACRYPT Rhee, Research Activities on Cryptology in Korea 1991 1 ASIACRYPT Sadeghiyan & Pieprzyk, On Necessary and Sufficient Conditions for the Construction of Super Pseudorandom Permutations 1991 1 ASIACRYPT Even & Mansour, A Construction of a Cipher from a Single Pseudorandom Permutation 1991 1 ASIACRYPT Pieprzyk & Sadeghiyan, Optimal Perfect Randomizers 1991 1 ASIACRYPT Kwan & Pieprzyk, A General Purpose Technique for Locating Key Scheduling Weaknesses in DES-like Cryptosystems 1991 1 ASIACRYPT Morita & Ohta & Miyaguchi, Results of Switching-Closure-Test on FEAL 1991 1 ASIACRYPT Mizusawa, IC-Cards and Telecommunication Services 1991 1 ASIACRYPT Shimbo & Kawamura, Cryptanalysis of Several Conference Key Distribution Schemes 1991 1 ASIACRYPT Klapper & Goresky, Revealing Information with Partial Period Correlations 1991 1 ASIACRYPT Meijers & van Tilburg, Extended Majority Voting and Private-Key Algebraic-Code Encryptions 1991 1 ASIACRYPT Goldburg & Dawson & Sridharan, A Secure Analog Speech Scrambler Using the Discrete Cosine Transform 1991 1 ASIACRYPT Harn & Lin, An Oblivious Transfer Protocol and Its Application for the Exchange of Secrets 1991 1 ASIACRYPT Saito & Kurosawa & Sakurai, 4 Move Perfect ZKIP of Knowledge with No Assumption 1991 1 ASIACRYPT Itoh & Sakurai, On the Complexity of Constant Round ZKIP of Possession of Knowledge 1991 1 ASIACRYPT Fortnow & Szegedy, On the Power of Two-Local Random Reductions 1991 1 ASIACRYPT Feigenbaum & Ostrovsky, A Note on One-Prover, Instance-Hiding Zero-Knowledge Proof Systems 1991 1 ASIACRYPT Desmedt & Burmester, An Efficient Zero-Knowledge Scheme for the Discrete Logarithm Based on Smooth Numbers 1991 1 ASIACRYPT Okamoto, An Extension of Zero-Knowledge Proofs and Its Applications 1991 1 ASIACRYPT Itoh & Sakurai & Shizuya, Any Language in IP Has a Divertible ZKIP 1991 1 ASIACRYPT Shu & Matsumoto & Imai, A Multi-Purpose Proof System 1991 1 ASIACRYPT Toussaint, Formal Verification of Probabilistic Properties in Cryptographic Protocols 1991 1 ASIACRYPT Rivest, Cryptography and Machine Learning 1991 1 ASIACRYPT Brandt & Damgard & Landrock, Speeding Up Prime Number Generation 1991 1 ASIACRYPT Laih & Yen & Harn, Two Efficient Server-Aided Secret Computation Protocols Based on the Addition Sequence 1991 1 ASIACRYPT Miyaji, An Ordinary Elliptic Curve Cryptosystems 1991 1 ASIACRYPT Joux & Stern, Cryptanalysis of Another Knapsack Cryptosystem 1991 1 ASIACRYPT Daemen & Bosselaers & Govaerts & Vandewalle, Collisions for Schnorr's Hash Function FFT-Hash Presented at Crypto '91 1991 1 ASIACRYPT Rivest, On NIST's Proposed Digital Signature Standard 1991 1 ASIACRYPT Kaneko, A Known-Plaintext Attack of FEAL-4 Based on the System of Linear Equations on Difference 1991 1 ASIACRYPT Kwan, Simultaneous Attacks in Differential Cryptanalysis (Getting More Pairs Per Encryption) 1991 1 ASIACRYPT Mjolsnes, Privacy, Cryptographic Pseudonyms, and The State of Health 1991 1 ASIACRYPT Daemen, Limitations of the Even-Mansour Construction 1976 38 ASQ Paterson, An Introduction to Boolean Function Complexity 1992 ATAI Trappl, AI: Introduction, Paradigms, Applications (Including CBR), Impacts, Visions 1992 ATAI Havel, Artificial Intelligence and Connectionism: Some Philosophical Implications 1992 ATAI Kubat, Introduction to Machine Learning 1992 ATAI Dorffner, An Introduction to Neurocomputing and its Possible Role in AI 1988 ATAI Biermann, Fundamental Mechanisms in Machine Learning and Inductive Inference: Part 2 1993 14 ATPETRI Barkaoui & Dutheillet & Haddad, An Efficient Algorithm for Finding Structural Deadlocks in Colored Petri Nets 1993 14 ATPETRI Desel & Esparza, Shortest Paths in Reachability Graphs 1993 14 ATPETRI Yen & Wang & Yang, A Unified Approach for Reasoning About Conflict-Free Petri Nets 1992 13 ATPETRI Reisig, Combining Petri Nets and Other Formal Methods 1992 13 ATPETRI Barkaoui & Minoux, A Polynomial-Time Graph Algorithm to Decide Liveness of Some Basic Classes of Bounded Petri Nets 1992 13 ATPETRI Desel, A Proof of the Rank Theorem for Extended Free Choice Nets 1992 13 ATPETRI Kemper & Bause, An Efficient Polynomial-Time Algorithm to Decide Liveness and Boundedness of Free-Choice Nets 1992 AUSCRYPT Desmedt, Threshold Cryptosystems 1992 AUSCRYPT Tombak & Safavi-Naini, Authentication Codes with Perfect Protection 1992 AUSCRYPT Desmedt & Seberry, Practical Proven Secure Authentication with Arbitration 1992 AUSCRYPT Safavi-Naini & Tombak, Authentication Codes under Impersonation Attack 1992 AUSCRYPT Jackson & Martin, Cumulative Arrays and Geometric Secret Sharing Schemes 1992 AUSCRYPT Ogata & Kurosawa & Tsujii, Nonperfect Secret Sharing Schemes 1992 AUSCRYPT Bertilsson & Ingemarsson, A Construction of Practical Secret Sharing Schemes Using Linear Block Codes 1992 AUSCRYPT Zheng & Pieprzyk & Seberry, HAVAL -- A One-way Hashing Algorithm with Variable Length of Output 1992 AUSCRYPT Preneel & Govaerts & Vandewalle, On the Power of Memory in the Design of Collision Resistant Hash Functions 1992 AUSCRYPT Hardjono & Zheng, A Practical Digital Multisignature Scheme Based on Discrete Logarithms 1992 AUSCRYPT Harn & Yang, Group-oriented Undeniable Signature Schemes without the Assistance of a Mutually Trusted Party 1992 AUSCRYPT Seberrry & Zhang, Highly Nonlinear 0-1 Balanced Boolean Functions Satisfying Strict Avalanche Criterion 1992 AUSCRYPT Charnes & Pieprzyk, Linear Nonequivalence versus Nonlinearity 1992 AUSCRYPT Detombe & Tavares, Constructing Large Cryptographically Strong S-Boxes 1992 AUSCRYPT Korzhik & Yakovlev, Nonasymptotic Estimates of Information Protection Efficiency for the Wire-Tape Channel Concept 1992 AUSCRYPT Knudsen, Cryptanalysis of LOKI91 1992 AUSCRYPT Dawson, Cryptanalysis of Summation Generator 1992 AUSCRYPT Laih & Yen, Secure Addition Sequence and its Applications on the Server-Aided Secret Computation Protocols 1992 AUSCRYPT Sakurai & Itoh, Subliminal Channels for Signature Transfer and their Application to Signature Distribution Schemes 1992 AUSCRYPT Fujioka & Okamoto & Ohta, A Practical Secret Voting Scheme for Large Scale Elections 1992 AUSCRYPT Satoh & Kurosawa & Tsujii, Privacy for Multi-party Protocols 1992 AUSCRYPT Pailles, New Protocols for Electronic Money 1992 AUSCRYPT Nieh & Tavares, Modelling and Analyzing Cryptographic Protocols Using Petri Nets 1992 AUSCRYPT Matsumoto & Imai & Laih & Yen, On Verifiable Implicit Asking Protocols for RSA Computation 1992 AUSCRYPT Lim & Lee, Modified Maurer-Yacobi's Scheme and its Applications 1992 AUSCRYPT Klapper, The Vulnerability of Geometric Sequences Based on Fields of Odd Characteristic 1992 AUSCRYPT Lai & Rueppel & Woollven, A Fast Cryptographic Checksum Algorithm Based on Stream Ciphers 1992 AUSCRYPT Mihaljevic, An Approach to the Initial State Reconstruction of a Clock-Controlled Shift Register Based on a Novel Distance Measure 1992 AUSCRYPT Yang & Dai, Construction of m-ary de Bruijn Sequences 1992 AUSCRYPT Snare, Information Technology Security Standards -- An Australian Perspective 1992 AUSCRYPT Cerecedo & Matsumoto & Imai, Non-interactive Generation of Shared Pseudorandom Sequences 1992 AUSCRYPT Portz, A Generalized Description of DES-based and Benes-based Permutation Generators 1992 AUSCRYPT Condie, Prime Generation with the Demytko-Miller-Trbovich Algorithm 1992 AUSCRYPT Hiltgen, Construction of Feebly-one-way Families of Permutations 1992 AUSCRYPT Sakurai & Itoh, On Bit Correlations among Preimages of ``Many to One'' One-way Functions 1992 AUSCRYPT Yen & Laih, The Fast Cascade Exponentiation Algorithm and its Applications on Cryptography 1992 AUSCRYPT Chang & Wu & Chen, The Design of a Conference Key Distribution System 1992 AUSCRYPT Zuk, Remarks on ``The Design of a Conference Key Distribution System'' 1992 AUSCRYPT Harn & Yang, Public-Key Cryptosystem Based on the Discrete Logarithm Problem 1992 AUSCRYPT Miyaji, Elliptic Curves over F_p Suitable for Cryptosystems 1992 AUSCRYPT Waldvogel & Massey, The Probability Distribution of the Diffie-Hellman Key 1992 AUSCRYPT Sauerbrey, A Modular Exponentiation Unit Based on Systolic Arrays 1992 AUSCRYPT O'Keefe, A Comparison of Key Distribution Patterns Constructed from Circle Geometries 1992 AUSCRYPT Rezny & Trimarchi, A Block Cipher Method Using Combinations of Different Methods under the Control of the User Key 1992 AUSCRYPT Preneel & Govaerts & Vandewalle, An Attack on Two Hash Functions by Zheng-Matsumoto-Imai 1992 AUSCRYPT Lidl & Muller, Primality Testing with Lucas Functions 1990 AUSCRYPT Menezes & Vanstone, The Implementation of Elliptic Curve Cryptosystems 1990 AUSCRYPT Koyama, Direct Demonstration of the Power to Break Public-Key Cryptosystems 1990 AUSCRYPT Dai & Zeng, Continued Fractions and Berlekamp-Massey Algorithm 1990 AUSCRYPT Guang, Nonlinear Generators of Binary Sequences with Controllable Complexity and Double Key 1990 AUSCRYPT Xian, K-M Sequence is Forwardly Predictable 1990 AUSCRYPT Ding, Lower Bounds on the Weight Complexities of Cascaded Binary Sequences 1990 AUSCRYPT Lee, Secure User Access Control for Public Networks 1990 AUSCRYPT Knapskog, Formal Specification and Verification of Secure Communication Protocols 1990 AUSCRYPT Varadharajan, Network Security Policy Models 1990 AUSCRYPT van der Lubbe & Boekee, KEYMEX: An Expert System for the Design of Key Management 1990 AUSCRYPT Gaardner & Snekkenes, On the Formal Analysis of PKCS Authentication Protocols 1990 AUSCRYPT Anthony & Martin & Seberry & Wild, Some Remarks on Authentication Systems 1990 AUSCRYPT Ohta & Koyama, Meet-in-the-Middle Attack on Digital Signature Schemes 1990 AUSCRYPT Jansen & Boekee, A Binary Sequence Generator Based on Ziv-Lempel Source Coding 1990 AUSCRYPT Mihaljevic & Golic, A Fast Iterative Algorithm for a Shift Register Initial State Reconstruction Given the Noisy Output Sequence 1990 AUSCRYPT Safavi-Naini, Parallel Generation of Pseudo-random Sequences 1990 AUSCRYPT Zeng & Yang & Rao, Large Primes in Stream Cipher Cryptography 1990 AUSCRYPT Gustafson & Dawson & Caelli, Comparison of Block Ciphers 1990 AUSCRYPT Brown & Seberry, Key Scheduling in DES Type Cryptosystems 1990 AUSCRYPT Brown & Pieprzyk & Seberry, LOKI--A Cryptographic Primitive for Authentication and Secrecy Applications 1990 AUSCRYPT Pieprzyk & Zhang, Permutation Generators of Alternating Groups 1990 AUSCRYPT Chaum, Showing Credentials without Identification: Transferring Signatures between Unconditionally Unlinkable Pseudonyms 1990 AUSCRYPT Girault, A (Non-practical) Three-Pass Identification Protocol Using Coding Theory 1990 AUSCRYPT Shizuya & Koyama & Itoh, Demonstrating Possession without Revealing Factors and Its Application 1990 AUSCRYPT Hayes, Anonymous One-time Signatures and Flexible Untraceable Electronic Cash 1990 AUSCRYPT Xian, Dyadic Matrices and Their Potential Significance in Cryptography 1990 AUSCRYPT Lidl & Muller, A Note on Strong Fibonacci Pseudoprimes 1990 AUSCRYPT Jansen & Boekee, On the Significance of the Directed Acyclic Word Graph in Cryptology 1990 AUSCRYPT Zeng & Huang, Solving Equations in Sequences 1990 AUSCRYPT Ferreira, The Practical Application of State of the Art Security in Real Environments 1990 AUSCRYPT Cooper & Patterson, RSA as a Benchmark for Multiprocessor Machines 1990 AUSCRYPT Alagar, Range Equations and Range Matrices: A Study in Statistical Database Security 1990 AUSCRYPT Hardjono, Record Encryption in Distributed Databases 1990 AUSCRYPT Geiselmann & Gollmann, VLSI Design for Exponentiation in GF(2^n) 1990 AUSCRYPT Morita, A Fast Modular-Multiplication Module for Smart Cards 1990 AUSCRYPT Newberry, Monos: Extended User Authentication 1990 AUSCRYPT Dawson & Goldburg, Universal Logic Sequences 1990 AUSCRYPT Carroll, The Three Faces of Information Security 1990 AUSCRYPT Ames, Secure Cryptographic Initialization 1993 54 AUTORC Brudno, Data Base as a Model of Constructive Logic 1993 54 AUTORC Ismailov & Pokrovskii & Chernorutskii, On a Class of Finite Automata Games 1993 54 AUTORC Kiryushin & Rassvetalova & Ushakov, Modal-Control Synthesis of Binary Dynamic Systems in Linear Flip-Flop Logic 1993 54 AUTORC Opoytsev & Chernorutskii, On a New Principle for Solving Combinatorial Problems 1993 53 AUTORC Adamatskii, Complexity of Identification of Cellular Automata 1992 53 AUTORC Burkov & Khokhlov, Cost-Efficient Taxation Mechanisms 1992 53 AUTORC Gordon, Parallel Algorithms for Solution of Problems in Scheduling Theory 1992 53 AUTORC Shmelev, Exact Penalty Functions in Linear and Integer Programming 1992 53 AUTORC Aslanova & Raradzhev, Arithmetic Representation of Functions in Multivalued Logic and a Parallel 1992 53 AUTORC Barannik, A Method for Estimating Resources Required for Implementation of Finite Algorithms 1992 52 AUTORC Epshtein, Hypertext -- A New Information Paradigm 1992 52 AUTORC Veselovskii & Zalozhnev & Pukhal'skii, Modeling a Modified Omega Network with Recovery of Blocked Calls 1991 52 AUTORC Ivanov, Algebraic Method of Determining Nonexistence of Deadlock Markings in Petri Nets 1991 52 AUTORC Sagalovich, Error-Correcting Codes for Computer Memories 1991 52 AUTORC Kondrat'ev, Information Approach to the Problems of Pattern Recognition 1991 51 AUTORC Levin, Continuously-Valued Logic: Generalizations and Applications. I 1986 AWOC Aggarwal & Carter & Kosaraju, Optimal Tradeoffs for Addition on Systolic Arrays 1986 AWOC Biliris, A Comparative Study of Concurrency Control Methods in B-trees 1986 AWOC Bini & Pan, A Logarithmic Boolean Time Algorithm for Parallel Polynomial Division 1986 AWOC Blair & Lloyd, Generalized River Routing--Algorithms and Performance Bounds 1986 AWOC Brzozowski & Yoeli, Combinational Static CMOS Networks 1986 AWOC Dekel & Ntafos & Peng, Parallel Tree Techniques and Code Optimization 1986 AWOC Frederickson & Santoro, Breaking Symmetry in Synchronous Networks 1986 AWOC Furer & Mehlhorn, AT^2-Optimal Galois Field Multiplier for VLSI 1986 AWOC Guerra, A Unifying Framework for Systolic Designs 1986 AWOC Hagerup and Ruelling, A Generalized Topological Sorting Problem 1986 AWOC Helmbold & Mayr, Two Processor Scheduling is in NC 1986 AWOC Jou & Hu & Parng, VLSI Algorithms and Pipelined Architectures for Solving Structured Linear Systems 1986 AWOC Kanopoulos & Marinos, A High Performance Single-Chip VLSI Signal Processor Architecture 1986 AWOC Kirousis, A Polynomial Algorithm for Recognizing Images of Polyhedra 1986 AWOC Kunde, Lower Bounds for Sorting on Mesh-Connected Architectures 1986 AWOC Lengauer, Exploiting Hierarchy in VLSI Design 1986 AWOC Maon & Schieber & Vishkin, Parallel Ear Decomposition Search (EDS) and st-numbering in Graphs 1986 AWOC Miller & Kaltofen & Ramachandran, Efficient Parallel Evaluation of Straight-Line Code 1986 AWOC Miller & Sudborough, A Polynomial Algorithm for Recognizing Small Cutwidth in Hypergraphs 1986 AWOC Mueller & Lengauer, Linear Algorithms for Two CMOS Layout Problems 1986 AWOC Lodi & Pagli, Some New Results on a Restricted Channel Routing Problem 1986 AWOC Pan & Reif, Fast and Efficient Parallel Linear Programming and Linear Least Squares Computations 1986 AWOC Parberry, On the Time Required to Sum n Semigroup Elements on a Parallel Machine with Simultaneous Writes 1986 AWOC Paschalis & Nikolos & Halatsis, Efficient Modular Design of TSC Checkers for M-out-of-2M Codes 1986 AWOC Bilardi & Preparata, Digital Filtering in VLSI 1986 AWOC Rosenberg, Diogenes, Circa 1986 1986 AWOC Rote, On the Connection Between Hexagonal and Unidirectional Rectangular Systolic Arrays 1986 AWOC Vitanyi, Non Sequential Computation and Laws of Nature 1986 AWOC Yannakakis, Linear and Book Embeddings of Graphs 1991 BALTICCS Freivalds, Inductive Inference of Recursive Functions: Qualitative Theory 1991 BALTICCS Freivalds & Barzdins & Podnieks, Inductive Inference of Recursive Functions: Complexity Bounds 1991 BALTICCS Brazma, Inductive Synthesis of Dot Expressions 1991 BALTICCS Kinber, Some Models of Inductive Syntactical Synthesis from Sample Computations 1991 BALTICCS Barzdins, Inductive Synthesis of Term Rewriting Systems 1991 BALTICCS Freivalds, Complexity of Probabilistic Versus Deterministic Automata 1995 32 BAMS Ruhe, review of Bini & Pan, Polynomial and Matrix Computations (Birkhauser, 1994) 1995 32 BAMS Putnam, review of Penrose, Shadows of the Mind (Oxford, 1994) 1995 32 BAMS Edelman & Kostlan, How Many Zeros of a Random Polynomial are Real? 1995 32 BAMS Smorynski, review of Matiyasevich, Hilbert's Tenth Problem (MIT Press, 1993) 1994 31 BAMS Trotter, review of Cohen, A Course in Computational Algebraic Number Theory (Springer-Verlag, 1993) 1994 31 BAMS Rubin & Silverberg, A Report on Wiles' Cambridge Lectures 1994 30 BAMS Thurston, On Proof and Progress in Mathematics 1994 30 BAMS Atiyah & Borel & Chaitin & Friedan & Glimm & Gray & Hirsch & Mac Lane & Mandelbrot & Ruelle & Schwarz & Uhlenbeck & Thom & Witten & Zeeman, Responses to ``Theoretical Mathematics: Toward a cultural synthesis of Mathematics and theoretical physics'' by A. Jaffe and F. Quinn 1994 30 BAMS Jaffe & Quinn, Response to comments on ``Theoretical Mathematics'' 1994 30 BAMS Wan, review of Shparlinski, Computational and Algorithmic Problems in Finite Fields (Kluwer, 1992), Lidl & Mullen & Turnwald, Dickson Polynomials (Longman, 1993), Small, Arithmetic of Finite Fields (Dekker, 1991), Mullen & Shiue (Eds.), Finite Fields, Coding Theory, and Advances in Communications and Computing (Dekker, 1993), Jungnickel, Finite Fields: Structure and Arithmetics (Wissenschaftsverlag, 1993), Menezes (Ed.) & Blake & Gao & Mullin & Vanstone & Yaghoobian, Applications of Finite Fields (Kluwer, 1993) 1993 29 BAMS Mazur, On the Passage from Local to Global in Number Theory 1992 27 BAMS Alon & Kleitman, Piercing Convex Sets 1992 27 BAMS Lagarias & Shor, Keller's Cube-Tiling Conjecture Is False in High Dimensions 1992 27 BAMS Aldous, review of Mahmoud, Evolution of Random Search Trees (Wiley, 1992) 1992 26 BAMS Shelah, Cardinal Arithmetic for Skeptics 1992 26 BAMS Lenstra, Algorithms in Algebraic Number Theory 1992 26 BAMS Kalai & Kleitman, A Quasi-polynomial bound for the Diameter of Graphs of Polyhedra 1992 26 BAMS Straubing, review of Buchi, Finite Automata, Their Algebras and Grammars: Towards a Theory of Formal Expressions 1992 26 BAMS Parlett, Some Basic Information on Information-based Complexity Theory 1992 26 BAMS Traub & Wozniakowski, Perspectives on Information-based Complexity 1990 23 BAMS McCarthy, review of Penrose, The Emperor's New Mind (1989) 1989 21 BAMS Hu, review of Aigner, Combinatorial Search (1988) 1989 21 BAMS Blum & Shub & Smale, On a Theory of Computation and Complexity over the Real Numbers: NP-Completeness, Recursive Functions and Universal Machines 1988 19 BAMS , review of Anderson, Combinatorics of Finite Sets (Clarendon, 1987) 1988 19 BAMS Linz, A Critique of Numerical Analysis 1988 19 BAMS Ruelle, Is Our Mathematics Natural? The Case of Equilibrium Statistical Mechanics 1988 18 BAMS Durrett, Crabgrass, Measles, and Gypsy Moths: An Introduction to Modern Probability 1986 15 BAMS Grabiner, Computers and the Nature of Man: A Historian's Perspective on Controversies about Artificial Intelligence 1973 BAMS Schwartz, Semantic and Syntactic Issues in Programming 1965 71 BAMS Blum, A Note on Free Subsemigroups with Two Generators 1985 BANTAM Hofstadter, Metamagical Themas: Questing for the Essence of Mind and Pattern 1993 BARILAN Judah (Ed.), Israel Mathematical Conference Proceedings: Set Theory of the Reals 1993 BARILAN Shelah, The Future of Set Theory 1993 BARILAN Goldstern, Tools for Your Forcing Construction 1993 BARILAN Steprans, Combinatorial Consequences of Adding Cohen Reals 1996 BASICBKS Calvin, How Brains Think: Evolving Intelligence, Then and Now 1995 BASICBKS Stewart, Nature's Numbers: The Unreal Reality of Mathematical Imagination 1994 BASICBKS Branscomb, Who Owns Information? From Privacy to Public Access 1993 BASICBKS Crevier, AI: The Tumultuous History of the Search for Artificial Intelligence 1987 BCC Graham & Rodl, Numbers in Ramsey Theory 1987 BCC Thomason, Random Graphs, Strongly Regular Graphs and Pseudo-Random Graphs 1987 BCC Winkler, The Metric Structure of Graphs: Theory and Applications 1989 47 BCENTU Wu & Chou, An Implementation and Testing of the Slash Number System 1989 47 BCENTU Chen, Optimal Systolic Arrays for Computing Discrete Fourier Transform 1996 60 BEATCS Berard, review of Boissonnat & Yvinec, Geometrie Algorithmique (Ediscience International, 1995) 1996 60 BEATCS Ehrig & Wolter, The Impact and Future Role of Algebraic Specification 1996 60 BEATCS Degtyarev & Gurevich & Voronkov, Herbrand's Theorem and Equational Reasoning: Problems and Solutions 1996 60 BEATCS Cleaveland & Smolka (Eds.), Strategic Directions in Computing Research: Concurrency Working Group Report 1996 60 BEATCS Lipponen & Salomaa, Simple Words in Equality Sets 1996 60 BEATCS Engelbriet, Reverse Twin Shuffles 1996 60 BEATCS Schirmer & Kreinovich, Towards a More Realistic Definition of Feasibility 1996 60 BEATCS Seda, Quasi-metrics and Fixed Points in Computing 1996 60 BEATCS Gal-Ezer & Beeri & Harel & Yehudai, A High-School Program in Computer Science 1996 60 BEATCS Keranen, Report on Algorithmic Information and Automata Theory 1996 60 BEATCS Kari, Report on the 2nd Annual Meeting on DNA Based Computers 1996 59 BEATCS Reichel, Unifying ADT -- and Evolving Algebra Specifications 1996 59 BEATCS Mosses (Ed.), CoFI: The Common Framework Initiative for Algebraic Specification 1996 59 BEATCS Benson, Courses on Concurrency 1996 59 BEATCS Salomaa, Conjugate Words, Cuts of the Deck and Cryptographic Protocols 1996 59 BEATCS Bloom & Esik, Two Axiomatizations of a Star Semiring Quasi-Variety 1996 59 BEATCS Dunlaing, Resolution Proofs Viewed as Automata 1996 59 BEATCS Honkala, On the Equivalence Problem of Algebraic Series with Commuting Variables 1996 59 BEATCS Longpre & Kreinovich, Zeros of Riemann's Zeta Function Are Uniformly Distributed, But Not Random: An Answer to Calude's Open Problem 1996 59 BEATCS Majster-Cederbaum & Roggenbach, On Two Different Characterizations of Bisimulation 1996 59 BEATCS Steacy, Structure in the Kolakoski Sequence 1996 59 BEATCS Ehrig & Taentzer, Computing by Graph Transformation: A Survey and Annotated Bibliography 1996 59 BEATCS Jung (Ed.), Domains and Denotational Semantics: History, Accomplishments and Open Problems 1996 59 BEATCS Jung, Classical Domain Theory 1996 59 BEATCS Fiore, Axiomatic Domain Theory 1996 59 BEATCS Moggi & Rosolini, Synthetic Domain Theory 1996 59 BEATCS Riecke, PCF and the Problem of Full Abstraction 1996 59 BEATCS O'Hearn, Parametric Polymorphism 1996 59 BEATCS Stark, Mutable State 1996 59 BEATCS Kari, DNA Computers, Tomorrow's Reality 1996 59 BEATCS Smith, A Survey on High-Level Petri-Net Theory 1996 59 BEATCS Kreowski, Educational Matters 1996 58 BEATCS Kenyon, review of Alonso & Schott, Random Generation of Trees (Kluwer, 1995) 1996 58 BEATCS Collard, review of de Rumeur, Communications dans les Reseaux de Processeurs (Masson, 1994) 1996 58 BEATCS Hufflen, review of Moreau, L'Approche Objets. Concepts et Techniques (Masson, 1994) 1996 58 BEATCS Ehrig & Mahr, Algebraic Techniques in Software Development: A Review of Progress within the last two Decades 1996 58 BEATCS Fitting, A Program to Compute Godel-Lob Fixpoints 1996 58 BEATCS Kozen, On Regularity-Preserving Functions 1996 58 BEATCS Panangaden, Does Concurrency Theory Have Anything To Say About Parallel Programming? 1996 58 BEATCS Mateescu & Salomaa, Views on Linguistics 1996 58 BEATCS Campeanu, Random Numbers Are Borel Normal 1996 58 BEATCS Fernau, Closure Properties of Ordered Languages 1996 58 BEATCS Mitrana, Distributed Catenation Versus Shuffle 1996 58 BEATCS Pagnoni, Detecting and Correcting Operation Errors of Distributed Systems 1996 58 BEATCS Asveld, A Bibliography on Fuzzy Automata, Grammars and Languages 1996 58 BEATCS Melchisedech & Deininger & Drappa & Hoff & Krauss & Li & Ludewig & Mandl-Striegnitz, SESAM -- A Software Engineering Education Tool Based on Graph Grammars 1996 58 BEATCS Paun, Open Problems: 1. Married Self-Reading Sequences; 2. Completeness of Context-free Languages 1995 57 BEATCS Rosaz, Puzzle Corner: Repelling Tokens, The Large Polygon, The Soapbox, The Blind Barman, The Chameleons, The Queens 1995 57 BEATCS Ehrig & Taentzer, COMPUGRAPH II: A Survey of Research Goals and Main Results 1995 57 BEATCS Ehrig & Mahr, Theory and Practice of Software Development: A Review of Driving Forces and Expectations 1995 57 BEATCS Gurevich, Platonism, Constructivism, and Computer Proofs vs. Proofs by Hand 1995 57 BEATCS Weihrauch, A Foundation of Computable Analysis 1995 57 BEATCS Paun, SPLICING: A Challenge for Formal Language Theorists 1995 57 BEATCS Bertol & Reinhardt, The Tautologies over a Finite Set are Context-free 1995 57 BEATCS Chaitin & Arslanov & Calude, Program-Size Complexity Computes the Halting Problem 1995 57 BEATCS Antoni & Cabianca & Vaccari & Benini & Casablanca, Linearity of Client/Server Systems 1995 57 BEATCS Nourani, Artificial Algebras (Extended Abstract) 1995 57 BEATCS Raz, Context-Free Languages are not Closed Under interior and frontierVajnovszki, Constant Time Generation of Binary Unordered Trees 1995 57 BEATCS Geurts, Hierarchy of Discrete-Time Dynamical Systems, a Survey 1995 56 BEATCS Ehrig & Kreowski & Orejas, Correctness of Actualization for Parameterized Implementation Concepts Based on Constructors and Abstractors 1995 56 BEATCS Jancar, All Action-based Behavioural Equivalences are Undecidable for Labelled Petri Nets 1995 56 BEATCS Salomaa, From Parikh Vectors to GO Territories 1995 56 BEATCS Fernau, A Predicate for Separating Language Classes 1995 56 BEATCS Galley, An Omega(log n) Time Linear Cost Lower Bound for the Single Function Coarsest Partition Problem 1995 56 BEATCS Meduna, A Trivial Method of Characterizing the Family of Recursively Enumerable Languages by Scattered Context Grammars 1995 56 BEATCS Moshkov, Relationships between Depth of Deterministic and Nondeterministic Acyclic Programs Computing Functions of k-Valued Logic 1995 56 BEATCS Prodinger, Digital Search Trees and Basic Hypergeometric Functions 1995 56 BEATCS Svozil, Quantum Computation and Complexity Theory II 1995 55 BEATCS Grosse-Rhode, Transition Specifications for Dynamic Abstract Data Types 1995 55 BEATCS Gurevich, The Value, if any, of Decidability 1995 55 BEATCS Hartmanis, On the Weight of Computations 1995 55 BEATCS Parrow, Concurrency without Homotopy 1995 55 BEATCS Salomaa, Return to Patterns 1995 55 BEATCS Buffoli & Antoni & Marchese, OR-Parallelism in Theorem Proving: Speedups versus Timeout 1995 55 BEATCS Lehikoinen & Makinen, A New Distance-Based Coding Method for Binary Trees 1995 55 BEATCS Svozil, Quantum Computation and Complexity Theory I 1995 55 BEATCS Kreowski, Conception of a Course on Syntactic Methods in Picture Generation 1994 54 BEATCS Ehrig & Padberg, Linking Algebraic High Level Nets and Dynamic Abstract Data Types 1994 54 BEATCS Pin, Logic on Words 1994 54 BEATCS Chang, A Machine Model for NP-approximation Problems and the Revenge of the Boolean Hierarchy 1994 54 BEATCS Gunawardena, Homotopy and Concurrency 1994 54 BEATCS Salomaa, Patterns 1994 54 BEATCS Bouali & Gnesi & Larosa, JACK: Just Another Concurrency Kit. The Integration Project. 1994 54 BEATCS Marcus & Paun, Infinite (Almost Periodic) Words, Formal Languages and Dynamical Systems 1994 54 BEATCS Prodinger, Knuth's Old Sum -- A Survey 1994 54 BEATCS Freund & Paun, The Shape of a Language: Some Open Problems 1994 54 BEATCS Groote, An Optimisation Problem for an AC Operator 1994 53 BEATCS Korff & Ehrig, Computing by Graph Transformation II (COMPUGRAPH II) 1994 53 BEATCS Ali, ACCLAIM, Advanced Concurrent Constraint Languages: Application, Implementation, and Methodology 1994 53 BEATCS Ehrig & Orejas, Dynamic Abstract Data Types: An Informal Proposal 1994 53 BEATCS Hartmanis, About the Nature of Computer Science 1994 53 BEATCS van Glabbeek, What Is Branching Time Semantics and Why To Use It? 1994 53 BEATCS Csuhaj-Varju & Meduna, Grammars with Context Conditions (Some Results and Open Problems) 1994 53 BEATCS Asveld, An Alternative Formulation of Cocke-Younger-Kasami's Algorithm 1994 53 BEATCS Lipponen, Primitive Words and Languages Associated to PCP 1994 53 BEATCS Nourani, Types, Induction, and Incompleteness 1994 53 BEATCS Prodinger, Some Polynomials Related to the Fibonacci Polynomials 1994 53 BEATCS Seda, A Topological View of the Kowalski-van Emden Theorem 1994 53 BEATCS Steinbach, A Formalism for Representing Orderings 1994 53 BEATCS Kindler, Safety and Liveness Properties: A Survey 1994 53 BEATCS Schwill, Fundamental Ideas of Computer Science 1994 53 BEATCS Maler & Staiger, On Syntactic Congruences for omega-languages and the Minimization of omega-automata 1994 53 BEATCS Graziani & Zilli, Modular Termination for Weak Overlapping Term Rewriting Systems 1994 52 BEATCS Coquand & Nordstrom & Smith, Type Theory and Programming 1994 52 BEATCS Fortnow, The Role of Relativization in Complexity Theory 1994 52 BEATCS Esparza & Nielsen, Decidability Issues for Petri Nets -- A Survey 1994 52 BEATCS Paun, Marcus Contextual Grammars: After Twenty Five Years 1994 52 BEATCS Gramlich, A Note on a Parameterized Version of the Well-Founded Induction Principle 1994 52 BEATCS Hodkinson, Addendum to: Finite Variable Logics 1994 52 BEATCS Seda, Some Applications Of General Topology To The Semantics Of Logic Programs 1994 52 BEATCS Seljee, Integrity Constraint Checking for Updates in Deductive Databases; A Different Approach 1994 52 BEATCS Auramo & Katajainen & Kulmala, Finding the Maximum in Parallel Random Access Machines 1994 52 BEATCS Printz, Mathematical Training for the Software Developers: A Practical Experience 1993 51 BEATCS Padberg, Algebraic High-Level Net Transformation Systems: A Survey over Theory and Applications 1993 51 BEATCS Hodkinson, Finite Variable Logics 1993 51 BEATCS Traub & Wozniakowski, Recent Progress in Information-based Complexity 1993 51 BEATCS Christensen & Huttel, Decidability Issues for Infinite-State Processes -- A Survey 1993 51 BEATCS Harju & Kleijn, Morphisms and Rational Transducers 1993 51 BEATCS Kari, Insertion Operations: Closure Properties 1993 51 BEATCS Baaz & Fermuller & Zach, Dual Systems of Sequents and Tableaux for Many-Valued Logics 1993 51 BEATCS Csuhaj-Varju & Paun, Limiting the Team Size in Cooperating Grammar Systems 1993 51 BEATCS Domocos, The Generating Function of Completely Bracketed Expressions 1993 51 BEATCS Freivalds & Kinber & Smith, On the Impact of Forgetting on Learning Machines 1993 51 BEATCS Xiao-Long, The Representation of a Program in the Blum-Shub-Smale Theory of Computation over an Arbitrary Ring 1993 51 BEATCS Rensink, Order Isomorphism Does Not Preserve Global Event Independence 1993 51 BEATCS Floreen, A Short Introduction to Neural Associative Memories 1993 51 BEATCS Parnas, Mathematics of Computation for (Software and Other) Engineers 1993 51 BEATCS Printz, Mathematical Training for the Software Developers: A Practical Experience 1993 50 BEATCS Fett & Gerke & Grieskamp & Pepper, Algebraic Programming in OPAL 1993 50 BEATCS Nielsen, The Concurrency Column 1993 50 BEATCS Salomaa & Yu, Limited Nondeterminism for Pushdown Automata 1993 50 BEATCS Carpi, Repetitions in the Kolakovski Sequence 1993 50 BEATCS Domocos & Hristea, A Codification of Column-Convex Polyominoes which Generates a Regular Language 1993 50 BEATCS Drewes & Habel & Kreowski & Taubenberger, A Sketch of Collage Grammars 1993 50 BEATCS Groger & Turan, A Linear Lower Bound for the Size of Threshold Circuits 1993 50 BEATCS Jedrzejowicz, Remark on Shuffle Identities 1993 50 BEATCS Ohlebusch, A Simple Proof of Sufficient Conditions for the Termination of the Disjoint Union of Term Rewriting Systems 1993 50 BEATCS Paun & Salomaa, Remarks Concerning Self-Reading Sequences 1993 50 BEATCS Pawlak, Anatomy of Conflicts 1993 50 BEATCS Priese, Fairness, Part II 1993 50 BEATCS Raspaud, Good and Semi-strong Colorings of Oriented Planar Graphs 1993 50 BEATCS Skowron & Suraj, A Rough Set Approach to Real-Time State Identification 1993 50 BEATCS Urbanek, A Simple Lambda-Term Representing the Predecessor Function with respect to Church Numerals 1993 50 BEATCS Stepney & Barden, Annotated Z Bibliography 1993 50 BEATCS Chaitin, Randomness in Arithmetic and the Decline and Fall of Reductionism in Pure Mathematics 1993 49 BEATCS Navarro & Orejas & Sanchez, Characterizing Confusion 1993 49 BEATCS Courcelle, Graphs and Monadic Second-order Logic: Some Open Problems 1993 49 BEATCS Hartmanis, A Broader Research Agenda for Theory 1993 49 BEATCS Mateescu, The Splendour of an Old Ballad: Aad Van Wijngaarden Grammars 1993 49 BEATCS Buro & Kleine Buning, Report on a SAT Competition 1993 49 BEATCS Dassow & Paun & Salomaa, On Thinness and Slenderness of L Languages 1993 49 BEATCS Gvozdjak, One Letter Context-free Languages Revisited 1993 49 BEATCS Makinen, A Note on Gupta's Binary Tree Codings 1993 49 BEATCS Maung, On Specialization Hierarchies of Mutable Objects 1993 49 BEATCS Mitrana, Some Remarks on Paun-Salomaa Sequences 1993 49 BEATCS Ohlebusch, A Simple Proof of Sufficient Conditions for the Termination of the Disjoint Union of Term Rewriting Systems 1993 49 BEATCS Paun, How Much Thue is Kolakovski? 1993 49 BEATCS Reisig, Petri Nets: Fundamentals, Essentials, Consequences 1993 49 BEATCS Vicolov, Infinite Hierarchies of Valence Languages 1993 49 BEATCS Diderich, A Bibliography on Minimax Trees 1993 49 BEATCS English & Bosworth & Simpson, Concurrency Cliches in CCS and CPN 1993 49 BEATCS Scollo, Algebra in the New UT Informatica Curriculum 1993 49 BEATCS Calude, review of Chaitin, Information-Theoretic Incompleteness (World Scientific, 1992) 1992 48 BEATCS Goguen & Diaconescu, A Short Oxford Survey of Order Sorted Algebra 1992 48 BEATCS Compton & Straubing, Characterizations of Regular Languages in Low Level Complexity Classes 1992 48 BEATCS Paun, Valences: Increasing the Power of Grammars, Transducers, Grammar Systems 1992 48 BEATCS Baaz & Zach, Note on Calculi for a Three-valued Logic for Logic Programming 1992 48 BEATCS Cassaigne & Schwer & Seebold, About Gauss Codes 1992 48 BEATCS Droste & Shortt, Bounded Petri Nets of Finite Dimension Have Only Finitely Many Reachable Markings 1992 48 BEATCS Libkin, An Elementary Proof that Upper and Lower Powerdomain Constructions Commute 1992 48 BEATCS Pawlak, Concurrent versus Sequential: The Rough Sets Perspective 1992 48 BEATCS Steinby, On Generalizations of the Nerode and Myhill Theorems 1992 48 BEATCS Vagvolgyi & Gilleron, For a Rewrite System it is Decidable Whether the Set of Irreducible, Ground Terms is Recognizable 1992 48 BEATCS Kelemen & Mlichova, Bibliography of Grammar Systems 1992 48 BEATCS Muchnik, Games on Infinite Trees and Automata with Dead-Ends: A New Proof for the Decidability of the Monadic Second Order Theory of Two Successors 1992 48 BEATCS Chapman, Teaching Theoretical Computer Science to First Year Undergraduates 1992 47 BEATCS Subramanian, Towards an Algebraic Specification Framework for the VLSI Design Process 1992 47 BEATCS Hartmanis & Chang & Chari & Ranjan & Rohatgi, Relativization: A Revisionistic Retrospective 1992 47 BEATCS Salomaa, What Emil Said about the Post Correspondence Problem 1992 47 BEATCS Arnold & Dicky & Nivat, A Note about Minimal Non-deterministic Automata 1992 47 BEATCS Kozen, On the Myhill-Nerode Theorem for Trees 1992 47 BEATCS Mitrana, Valence Grammars on a Free Generated Group 1992 47 BEATCS Prodinger, Some Analytic Techniques for the Investigation of the Asymptotic Behaviour of Tree Parameters 1992 47 BEATCS Renvall, Andos: A Simple Protocol for Secret Selling of Secrets 1992 47 BEATCS Urbanek, A Note on the Language Operator ``red'' 1992 47 BEATCS de Vreught, Maximal Derivation Lengths of Acyclic CFGs 1992 47 BEATCS Kreowski & Dijkstra & Parnas, Educational Matters 1992 47 BEATCS Wagner, Report on LATIN '92 1992 47 BEATCS Lucanu, review of Apt & Olderog, Verification of Sequential and Concurrent Programs (Springer-Verlag, 1991) 1992 46 BEATCS Grosse-Rhode & Ehrig, Restriction Constructions in Specification Logics 1992 46 BEATCS Gurevich, Zero-One Laws 1992 46 BEATCS Hemachandra & Ogiwara, Is #P Closed Under Subtraction 1992 46 BEATCS Kari & Marcus & Paun & Salomaa, In the Prehistory of Formal Language Theory: Gauss Languages 1992 46 BEATCS Chapman, On Extended Attribute Grammars 1992 46 BEATCS Makinen, A Note on Graftings, Rotations, and Distances in Binary Trees 1992 46 BEATCS Meinel, Branching Programs -- An Efficient Data Structure for Computer-Aided Circuit Design 1992 46 BEATCS Paun & Salomaa, Decision Problems Concerning the Thinness of D0L Languages 1992 46 BEATCS Shallit & Wilson, The ``3x+1'' Problem and Finite Automata 1992 46 BEATCS Urbanek, circle* = square 1992 46 BEATCS Veloso, Yet Another Cautionary Note on Conservative Extensions: A Simple Case with a Computing Flavour 1992 46 BEATCS Courcelle, Graph Grammars, Monadic Second-Order Logic and the Theory of Graph Minors 1992 46 BEATCS Foster, Structures '91: Trip Report 1991 45 BEATCS Best, Overview of the Results of the Esprit Basic Research Action DEMON -- Design Methods Based on Nets 1991 45 BEATCS Ehrig & Lowe, Computing by Graph Transformation (COMPUGRAPH) 1991 45 BEATCS Presicce & Pierantonio, Towards the Algebraic Specification of Classes in Object Oriented Programming 1991 45 BEATCS Gunter, Forms of Semantic Specification 1991 45 BEATCS Selman, Complexity Classes for Partial Functions 1991 45 BEATCS Dassow & Kelemen, Cooperating/Distributed Grammar Systems: a Link between Formal Languages and Artificial Intelligence 1991 45 BEATCS Choffrut, Conjugacies 1991 45 BEATCS Inverardi & Priami, Evaluation of Tools for the Analysis of Communicating Systems 1991 45 BEATCS Fulop & Vagvolgyi, Ground Term Rewriting Rules for the Word Problem of Ground Term Equations 1991 45 BEATCS Leuchner & Miller & Slutzki, Agreement Graph Dependencies 1991 45 BEATCS Paun, A Characterization of Recursively Enumerable Languages 1991 45 BEATCS Turakainen, A Unified Approach to Characterizations of Recursively Enumerable Languages 1991 45 BEATCS Turner, Duality and De Morgan Laws for the Algebra of Lists 1991 45 BEATCS Permvall, A Bibliography on Sketches from the Computer Science Point of View 1991 45 BEATCS Meyer & van der Hoek & Vreeswijk, Epistemic Logic for Computer Science: A Tutorial (Part Two) 1991 45 BEATCS Breazu-Tannen, Report on the International Symposium on Theoretical Computer Science in honor of Boris A. Trakhtenbrot on the occasion of his retirement and 70th birthday 1991 45 BEATCS van Emde Boas, A Very Special Birthday Party: The Meeting on NP-Completeness: The First 20 Years, at Erice, Sicily, June 20-27 1991 1991 44 BEATCS Simon, News from Latin America 1991 44 BEATCS Ehrig & Orejas, Amalgamation and Extension in the Framework of Specification Logics and Generalized Morphisms 1991 44 BEATCS Kunen, Declarative Semantics of Logic Programming 1991 44 BEATCS Niemi, Density in Discrete Systems 1991 44 BEATCS Courcelle, On Constructing Obstruction Sets of Words 1991 44 BEATCS Darondeau, Recursive Graphs are not Stable under Maximal Reduction 1991 44 BEATCS Ibarra, On Resetting DLBA's 1991 44 BEATCS Murphy, The Physics of Observation; a Perspective for Concurrency Theorists 1991 44 BEATCS Pawlak, Decision Logic 1991 44 BEATCS Salomaa & Salomaa & Yu, Primality Types of Instances of the Post Correspondence Problem 1991 44 BEATCS Meyer & van der Hoek & Vreeswijk, Epistemic Logic for Computer Science: A Tutorial (Part One) 1991 44 BEATCS de Roever, Foundations of Computer Science: Leaving the Ivory Tower 1991 43 BEATCS Paterson, Submitting Papers to ICALP 1991 43 BEATCS Ehrig & Adametz, New Compatibility Results for Implementations within the Initial Algebraic Approach 1991 43 BEATCS Compton, Lower Bounds for the Complexity of Theories 1991 43 BEATCS Salomaa, L Codes and L Systems with Immigration 1991 43 BEATCS Barnard & Schmeiser & Skillicorn, Deriving Associative Operators for Language Recognition 1991 43 BEATCS Bertoni & Campadelli & Mauri, Some Notes on Computational Learning Theory 1991 43 BEATCS Bloom & Esik, Cayley iff Stone 1991 43 BEATCS Dershowitz & Jouannaud, Notations for Rewriting 1991 43 BEATCS Giegerich & Ohlebusch, An Implicite Representation of Infinite Sequences of Terms 1991 43 BEATCS Parikh, Dumb-founded Sets 1991 43 BEATCS Stewart, Obtaining Nielsen Reduced Sets in Free Groups 1991 43 BEATCS Veloso & Veloso, Some Remarks on Conservative Extensions: A Socratic Dialogue 1991 43 BEATCS Brzozowski & Seger, Advances in Asynchronous Circuit Theory, Part II: Bounded Inertial Delay Models, MOS Circuits, Design Techniques 1991 43 BEATCS Gurevich, Evolving Algebras: A Tutorial Introduction 1991 43 BEATCS Spencer, A Survey of Categorical Computation: Fixed Points, Partiality, Combinators,... Control? 1990 42 BEATCS Gurevich, On the Classical Decision Problem 1990 42 BEATCS Chang & Rohatgi, On Unique Satisfiability and Randomized Reductions 1990 42 BEATCS Santean, Parallel Communicating Systems 1990 42 BEATCS Chang, An Example of a Theorem that has Contradictory Relativizations and a Diagonalization Proof 1990 42 BEATCS Lingas, A Note on a Parallel Heuristic for Minimum Vertex Cover 1990 42 BEATCS Salomaa & Santean, Secret Selling of Secrets with Several Buyers 1990 42 BEATCS Socher-Ambrosius, Another Technique for Proving Completeness of Ground Resolution 1990 42 BEATCS Stewart, On the Graph Accessibility Problem for Directed Graphs of Bounded Degree 1990 42 BEATCS Urbanek, A Simple Completeness Proof for Earley's Algorithm 1990 42 BEATCS Whitty, An Exercise in Weakest Preconditions 1990 42 BEATCS Brzozowski & Seger, Advances in Asynchronous Circuit Theory; Part I: Gate and Unbounded Inertial Delay Models 1990 42 BEATCS Halter-Koch, review of Pohst & Zassenhaus, Algorithmic Algebraic Number Theory (1989) 1990 41 BEATCS Sannella & Tarlecki, Algebraic Specification and Formal Methods for Program Development: What are the Real Problems? 1990 41 BEATCS Ehrig, ESF-Concepts Linked with Algebraic Module Specifications 1990 41 BEATCS Ehrig & Classen, Overview of Algebraic Specification Languages, Environments and Tools, and Algebraic Specifications of Software Systems 1990 41 BEATCS Scedrov, A Brief Guide to Linear Logic 1990 41 BEATCS Hartmanis & Chang & Ranjan & Rohatgi, On IP = PSPACE and Theorems with Narrow Proofs 1990 41 BEATCS Salomaa, Decidability in Finite Automata (The Formal Language Theory Column) 1990 41 BEATCS Assous & Charretton, Nice Labelling of Event Structures 1990 41 BEATCS Beltrame & Staniszkis, The Generalized Prefix Property 1990 41 BEATCS Byers & Pitt, Conservative Extensions: A Cautionary Note 1990 41 BEATCS Gambosi & Postiglione & Talamo, On the Average Performance of Some Algorithms for On-line Bin-packing 1990 41 BEATCS Kant & van Leeuwen, On Special Multiples of Integers 1990 41 BEATCS Katajainen & Makinen, A Note on the Complexity of Trie Compaction 1990 41 BEATCS Kounalis & Rusinowitch, Mechanizing Inductive Reasoning 1990 41 BEATCS Milnor & Moller, Unique Decomposition of Processes 1990 41 BEATCS Nirmal & Rama, Note on (E0L-E0L) Array Systems 1990 40 BEATCS Allender & Wagner, Counting Hierarchies: Polynomial Time and Constant Depth Circuits 1990 40 BEATCS Kari, Games Played on the Phone: Solitaire & Cellular Automata 1990 40 BEATCS Backhouse & Malcolm, On Induced Congruences 1990 40 BEATCS Van den Bussche, A Formal Basis for Extending SQL to Object-Oriented Databases 1990 40 BEATCS Choffrut, An Optimal Algorithm for Building the Boyer-Moore Automaton 1990 40 BEATCS Formann & Woginger, On the Reconstruction of Simple Polygons 1990 40 BEATCS Gogolla, A Note on the Translation of SQL to Tuple Calculus 1990 40 BEATCS Loch, On the Equivalence Problem for DT0L Systems 1990 40 BEATCS Marxen & Buntrock, Attacking the Busy Beaver 5 1990 40 BEATCS Ochmanski, Notes on a Star Mystery 1990 40 BEATCS Paun, Non-centralized Parallel Communicating Grammar Systems 1990 40 BEATCS Ricci, Most Definitions of Trees over an Alphabet are Wrong 1990 40 BEATCS Szepietowski, Weak Mode of Space Complexity Can Be Used in the Proof that [DSPACE(log log n) = NSPACE(log log n)] ==> [L = NL] 1990 40 BEATCS Turakainen, On the Finiteness of the Multiplicative Monoid Generated by a Nonnegative Matrix 1990 40 BEATCS Gallier & Snyder, Designing Unification Procedures Using Transformations: A Survey 1990 40 BEATCS Diekert, Research Topics in the Theory of Free Partially Commutative Monoids 1989 39 BEATCS , 25% EATCS monograph discounts 1989 39 BEATCS Goguen, Memories of ADJ 1989 39 BEATCS Ehrig & Classen, Overview of Algebraic Specification Languages, Environments and Tools, and Algebraic Specifications of Software Systems (Part 1) 1989 39 BEATCS Gurevich, The Challenger-Solver Game: Variations on the Theme of P =? NP 1989 39 BEATCS Book & Watanabe, A View of Structural Complexity Theory 1989 39 BEATCS Cantone & Cutello, Decision Procedures for Elementary Sublanguages of Set Theory. XVI. Multilevel Syllogistic Extended by Singleton, Rank Comparison and Unary Intersection 1989 39 BEATCS Crochemore, String-Matching and Periods 1989 39 BEATCS Hromkovic, The Knowledge on Information Content of Problems Provides Much Useful Information to Circuit Designers 1989 39 BEATCS de Luca & Varricchio, A Positive Pumping Condition for Regular Sets 1989 39 BEATCS Fulop & Vagvolgyi, Congruential Tree Languages are the Same as Recognizable Tree Languages--A Proof for a Theorem of D. Kozen 1989 39 BEATCS Lescanne & Loria, Well Quasi-Ordering in a Paper by Maurice janet 1989 39 BEATCS Ollongren, A Curious Grammar 1989 39 BEATCS Poigne, Bisimulation as Cointersection 1989 39 BEATCS Skowron, The Evidence Theory and Decision Tables 1989 39 BEATCS Urbanek, On Minimizing Finite Automata 1989 39 BEATCS Aggarwal, Research Topics in Computational Geometry 1989 38 BEATCS Ehrig & Rozenberg & Wagener, A Cooperation with FIZ: A New Information Service for Publications of EATCS-Members in the Bulletin of the EATCS 1989 38 BEATCS Edelsbrunner, The Computational Geometry Column: Non-Obtuse Triangulations; Stabbing Triangles 1989 38 BEATCS Ehrig, The Algebraic Specification Column 1989 38 BEATCS Gurevich, The Logic in Computer Science Column: Infinite Games 1989 38 BEATCS Hartmanis, The Structural Complexity Column: Goedel, von Neumann and the P=?NP Problem 1989 38 BEATCS Salomaa, The Formal Language Theory Column: Knapsacks and Superdogs 1989 38 BEATCS Arnold, Recognizable Sets of Finite Bilabelled Transition Systems 1989 38 BEATCS Bednarczyk, On Minimal Finite Automata--Corrigenda 1989 38 BEATCS Boudol, Atomic Actions (Note) 1989 38 BEATCS Brauer & Brauer, A New Approach to the Jeep Problem 1989 38 BEATCS van Glabbeek & Goltz, Partial Order Semantics for Refinement of Actions--neither necessary nor always sufficient but appropriate when used with care-- 1989 38 BEATCS Golubski & Lippe, Extensions of Top-Down Tree-to-String Transducers 1989 38 BEATCS Hinz & Dassow, An Undecidability Result for Regular Languages and its Applications to Regulated Rewriting 1989 38 BEATCS Jousselin & Moskowitz, Memory and Algebra 1989 38 BEATCS Kranakis & Meertens, Optimal Packing of Similar Triangles 1989 38 BEATCS Nivat & Podelski, Definite Tree Languages (cont'd) 1989 38 BEATCS Ochmanski, Semi-Commutation for Place/Transition Systems 1989 38 BEATCS Pawlak, Knowledge, Reasoning and Classification: A Rough Set Perspective 1989 38 BEATCS de Swart, Improving TABLOG 1989 38 BEATCS Backhouse, Making Formality Work For Us 1989 37 BEATCS Edelsbrunner, The Computational Geometry Column 1989 37 BEATCS Hartmanis, The Structural Complexity Column: On the Importance of Being Pi_2-Hard 1989 37 BEATCS Berstel, Langford Strings are Squarefree 1989 37 BEATCS Brzozowski, Minimization by Reversal Is Not New 1989 37 BEATCS Budach & Giessmann & Grassmann & Graw & Meinel & Molzan & Schafer, Recursive VLSI Design Theory and Application 1989 37 BEATCS Leiss, More on Minimal Finite Automata 1989 37 BEATCS Nirmal & Rama, Note on (E0L-E0L) Array Systems 1989 37 BEATCS Overmars & Scholten & Vincent, Sets Without Empty Convex 6-gons 1989 37 BEATCS Padawitz, Can Inductive Proofs be Automated? Part II 1989 37 BEATCS Rosenblum & Yakovlev & Yakovlev, A Look at Concurrency Semantics through ``Lattice Glasses'' 1989 37 BEATCS Sofronie, Formula-handling Computer Solution of Boolean Equations. I. Ring Equations 1989 37 BEATCS Spaan & Torenvliet & van Emde Boas, Nondeterminism, Fairness and a Fundamental Analogy 1989 37 BEATCS Courcelle, Corrections and Additions to: Some Applications of Logic of Universal Algebra, and of Category Theory to the Theory of Graph Transformations 1989 37 BEATCS Parberry, How to Present a Paper in Theoretical Computer Science: A Speaker's Guide for Students 1988 36 BEATCS Blass, Topoi and Computation 1988 36 BEATCS Joseph & Young, Self-Reducibility: The Effects of Structure on Complexity 1988 36 BEATCS Salomaa, Cryptographic Transductions 1988 36 BEATCS Asveld, On a Post's System of Tag 1988 36 BEATCS Alt & Wagener, Approximation of Polygons by Rectangles and Circles 1988 36 BEATCS Bednarczyk, On Minimal Finite Automata 1988 36 BEATCS Bodlaender, Some Classes of Graphs with Bounded Treewidth 1988 36 BEATCS Hromkovic, A Candidate for Nonlinear Lower Bound on the Combinational Complexity 1988 36 BEATCS Lautemann, A Note on Polynomial Interpretation 1988 36 BEATCS Nivat & Saoudi, Automata on Infinite Trees and Kleene Closure of Regular Tree Sets 1988 36 BEATCS Seebold, An Effective Solution to the D0L Periodicity Problem in the Binary Case 1988 36 BEATCS Tiusanen, Some Unsolved Problems in Modelling Self-timed Circuits Using Petri Nets 1988 36 BEATCS Courcelle, Some Applications of Logic of Universal Algebra, and of Category Theory to the Theory of Graph Transformations 1988 36 BEATCS Paredaens, review of Ullman (1988) 1988 35 BEATCS Edelsbrunner, The Computational Geometry Column 1988 35 BEATCS Ehrig & Pepper, On the Potential Role of Algebraic Specification within Computer Science 1988 35 BEATCS Gurevich, The Logic in Computer Science Column 1988 35 BEATCS Hartmanis & Chang & Kadin & Mitchell, Some Observations about Relativization of Space Bounded Computations 1988 35 BEATCS Salomaa, Cryptography and Natural Languages 1988 35 BEATCS Baratella & File, A Completeness Result for SLDNF Resolution 1988 35 BEATCS Bertoni & Sabadini, Generating Functions of Trace Languages 1988 35 BEATCS Brauer, On Minimizing Finite Automata 1988 35 BEATCS Broy & Wirsing, Ultra-Loose Algebraic Specification 1988 35 BEATCS Guessarian, Fixpoint Strategies for Deductive Databases 1988 35 BEATCS Heuter, Definite Tree Languages 1988 35 BEATCS Lengauer & Wanke, Efficient Processing of Hierarchical Graphs for Engineering Design 1988 35 BEATCS Lozano, NP-Hardness on Succinct Representation of Graphs 1988 35 BEATCS Padawitz, Can Inductive Proofs be Automated? 1988 35 BEATCS Priese, Fairness 1988 35 BEATCS Reisig, Concurrency is More Fundamental than Interleaving 1988 35 BEATCS de Swart & Ophelders, Another Tableau Based Automated Theorem Prover for Classical Logic 1988 35 BEATCS Wegener, Prime Implicants and Parallel Complexity 1988 35 BEATCS Backhouse & Chisholm & Malcolm, Do-It-Yourself Type Theory (Part II) 1988 34 BEATCS Edelsbrunner, ``The Disease of the log-Factor'' or ``Why is it that Some Complexity Functions are Common and Some are Not?'' 1988 34 BEATCS Karhumaki, The Impact of the D0L Problem 1988 34 BEATCS Crochemore & Perrin, Critical Factorizations of Words 1988 34 BEATCS de Felice, On the Finite Completion of Codes 1988 34 BEATCS Fulop & Vagvolgyi, On Domains of Tree Transducers 1988 34 BEATCS Marcus, Formal Languages before Axel Thue 1988 34 BEATCS Paun, On Langford-Lyndon-Thue Sequences 1988 34 BEATCS Backhouse & Chisholm & Malcolm, Do-it-yourself Type Theory (Part I) 1987 33 BEATCS Hartmanis, The Collapsing Hierarchies 1987 33 BEATCS Salomaa, PLAYFAIR 1987 33 BEATCS Benson, Concurrency and Interleaving are Equally Fundamental 1987 33 BEATCS Habel & Kreowski & Vogler, Compatible Graph Properties are Decidable for Hypergraph Replacement Graph Languages 1987 33 BEATCS Kuich, Unambiguous Automata 1987 33 BEATCS Lange & Schudy, A Further Link between Formal Languages and Complexity Theory 1987 33 BEATCS Meyer, Process Modalities Obtained as Fixed Points (Part 2) 1987 33 BEATCS Ochmanski, A Non-Invertible PCF Language 1987 33 BEATCS Pawlak, Decision Tables--A Rough Set Approach 1987 33 BEATCS Szelepcsenyi, The Method of Forcing for Nondeterministic Automata 1987 33 BEATCS Tel & van Leeuwen, A Non-deterministic Algorithm and its Analysis 1987 33 BEATCS Main, A Powerdomain Primer 1987 33 BEATCS Simpson, review of Henle (1986) 1987 33 BEATCS Gyssens & Paredaens, Is Database Theory Dying? 1987 33 BEATCS Gallaire & Minker & Nicolas, Logic and Databases: A Response 1987 32 BEATCS Gruska, Some Observations on Theory and Practice in Computer Science 1987 32 BEATCS Harel, Logic and Databases: A Critique 1987 32 BEATCS Ehrig, Scheme for Algebraic Specification Topics 1987 32 BEATCS Hartmanis, Sparse Complete Sets for NP and the Optimal Collapse of the Polynomial Hierarchy 1987 32 BEATCS Salomaa, Two-way Thue 1987 32 BEATCS Gnaedig, Knuth-Bendix Procedure and Non Deterministic Behavior--An Example 1987 32 BEATCS Main, Detecting Leftmost Periodicities 1987 32 BEATCS Meyer, Process Modalities Obtained as Fixed Points (Part One) 1987 32 BEATCS Rabinovich, Pomset Semantics is Consistent with Data Flow Semantics 1987 32 BEATCS Edelsbrunner, Geometrics and Algorithmics--A Tutorial in Computational Geometry 1987 32 BEATCS Klop, Term Rewriting Systems: A Tutorial 1987 31 BEATCS Boonyavatana & Slutzki, Note: On the Sufficiency of Igarashi's Conditions for Real-time Deterministic Context-free Languages 1987 31 BEATCS Castellano & de Michelis & Pomello, Concurrency versus Interleaving: An Instructive Example 1987 31 BEATCS Chlebus, A Note on the Polynomial-time Hierarchy and the Quantified Boolean Formulas 1987 31 BEATCS Ganziger & Giegerich, A Note on Termination in Combinations of Heterogeneous Term Rewriting Systems 1987 31 BEATCS Lange, On the Construction of Unifying Terms Modulo a Set of Substitutions 1987 31 BEATCS Makinen, Normal Forms for Pure Context-free Grammars 1987 31 BEATCS Poigne, A Remark on Variations of Power Domains 1987 31 BEATCS Sokolowski, How Not to Sweep Infixes under the Carpet 1987 31 BEATCS Tel, Efficient Leader Finding in Arbitrary Networks 1987 31 BEATCS Sestoft, Partial Evaluation Bibliography 1987 31 BEATCS Kreowski, Some Initial Sections of the Algebraic Specification Tale 1987 31 BEATCS Sudborough, ``Cutwidth'' and Related Graph Problems 1987 31 BEATCS Edelsbrunner, Computational Geometry Column (no. 1) 1987 31 BEATCS Hartmanis, The Structural Complexity Column: A Retrospective on Structural Complexity 1987 31 BEATCS Paredaens, The Theory of Databases Column: On Database Models, Summary of a Panel Discussion at the MFDBS-87 Meeting 1986 30 BEATCS Hansel, Symbolic Dynamics, Automata and Coding Theory 1986 30 BEATCS Schoenhage, Tapes versus Pointers, a Study in Implementing Fast Algorithms 1986 30 BEATCS Balcazar & Gabarro, Some Comments about Notations of Orders of Magnitude 1986 30 BEATCS Capocelli, Comments on ``Trends in the Theory of Codes'' by J. Berstel and D. Perrin 1986 30 BEATCS Choquet & Finkel, Applications of Residues for the Analysis of Parallel Systems Communicating by Fifo Channels 1986 30 BEATCS Crochemore, Computing LCF in Linear Time 1986 30 BEATCS Ehrig & Loeckx & Mahr, A Remark on the Equational Calculus for Many-sorted Algebras with Possibly Empty Carrier Sets 1986 30 BEATCS Goguen & Meseguer, Remarks on Remarks on Many-sorted Equational Logic 1986 30 BEATCS Kfoury, A Linear-time Algorithm to Decide whether a Binary Word Contains an Overlap 1986 30 BEATCS Lescanne, Divergence of the Knuth-Bendix Completion Procedure and Termination Orderings 1986 30 BEATCS de Luca & Restivo, On a Generalization of a Conjecture of Ehrenfeucht 1986 30 BEATCS Nirmal & Rama & Sri Hari Nagore, Closure Properties of E0L-regular Matrix Languages 1986 30 BEATCS O'Rourke, The Computational Geometry Column 1986 30 BEATCS Lehmann, Report on the Computer Science Department at Hebrew University (Jerusalem) 1986 29 BEATCS Calude, Note on Ehrenfeucht's Conjecture and Hilbert's Basis Theorem 1986 29 BEATCS Ehrig & Habel & Hummert & Boehm, Towards Algebraic Data Type Grammars: A Junction between Algebraic Specification and Graph Grammars 1986 29 BEATCS Gheorge & Paun, Two (Infinite?) Hierarchies of Vector Languages 1986 29 BEATCS Guessarian, Fixpoint Techniques in Data Base Recursive Logic Programs 1986 29 BEATCS Hemmerling, Real-time Recognition of Some Languages by Trellis and Cellular Automata and Full Scan Turing Machines 1986 29 BEATCS Kinber & Salomaa & Yu, On the Equivalence of Grammars Inferred from Derivations 1986 29 BEATCS Wirsing, Algebraic Specification of the Abstract Data Type ``Continuum'' without Hidden Operations 1986 29 BEATCS Chatelin, A Bibliography on Matrix Multiplication Complexity and Related Problems (July 1968-January 1986) 1986 29 BEATCS America, Object-oriented Programming: A Theoretician's Introduction 1986 29 BEATCS Berstel & Perrin, Trends in the Theory of Codes 1986 29 BEATCS Olderog, Semantics of Concurrent Processes: The Search for Structure and Abstraction, Part II 1985 27 BEATCS Knuth, Theory and Practice 1985 27 BEATCS Chytil & Platek & Vogel, A Note on the Chomsky Hierarchy 1985 27 BEATCS Culik & Karhumaki, Decision Problems Solved with the Help of the Ehrenfeucht Conjecture 1985 27 BEATCS Freivalds, Recursiveness of the Enumerating Functions Increases the Inferability of Recursively enumerable Sets 1985 27 BEATCS Hartmanis, Solvable Problems with Conflicting Relativizations 1985 27 BEATCS Jouannaud & Kounalis, Proofs by Induction in Equational Theories without Constructors 1985 27 BEATCS Ochmanski, Regular Behaviour of Concurrent Systems 1985 27 BEATCS Perrin, On the Solution of Ehrenfeucht's Conjecture 1985 27 BEATCS Salomaa, The Ehrenfeucht Conjecture: A Proof for Language Theorists 1985 27 BEATCS Lepisto, review of Salomaa (1985) 1985 27 BEATCS Haussler, review of Sankoff and Kruskal (1983) 1985 27 BEATCS Dahlhaus & Gaifman, Concerning 2-Adjacent Contextfree Languages 1985 26 BEATCS Guibas & Hershberger, Computing the Visibility Graphs of n Line Segments in O(n^2) Time 1985 26 BEATCS Papadimitriou, A Note on the Expressive Power of Prolog 1985 26 BEATCS Tsakalidis, The Nearest Common Ancestor in a Dynamic Tree 1985 26 BEATCS Broy & Tarlecki, Algebraic Specification of the Abstract Data Type ``Continuum'' 1985 26 BEATCS Engelfriet, The Non-computability of Computability 1985 26 BEATCS Erni & Geibel, Recognition of E0L by Polynomial Boolean Circuits 1985 26 BEATCS Gaifman & Vardi, A Simple Proof that Connectivity of Finite Graphs is not First-order Definable 1985 26 BEATCS Gheorge, Descriptional Complexity Measures Suggested by Hartmann's Error Recovery Scheme 1985 26 BEATCS Lange, Addendum to ``A Note on the Closure of E0L Languages under Erasing Homomorphisms'' 1985 26 BEATCS Pansiot, Subword Complexities and Iteration 1985 26 BEATCS Subramanian, Regular Control on NLC Grammars 1985 26 BEATCS Vardi, A Response to ``A Complete Axiomatisation for Full Join Dependencies in Relations'' 1985 26 BEATCS Vyskoc, Pigeon-hole Principle and Boolean Matrix Multiplication 1985 26 BEATCS Rosenberg, Challenges and Opportunities in VLSI Theory 1985 26 BEATCS Salomaa, Cryptography for Caesar to DES and RSA 1985 26 BEATCS Salomaa, review of Bavel (1983) 1985 26 BEATCS Klop, review of Berg, Boebert, Franta, and Moher (1982) 1985 26 BEATCS Edelsbrunner, Problems in Computational and Combinatorial Geometry 1985 26 BEATCS Wolfram, problems 1985 26 BEATCS Goodman & Pollack, On Problem P74--``How Many Planar Configurations Are There?'' 1985 26 BEATCS Allender, Solutions for Problems P90 and P91 (concatenation with regular sets) 1985 26 BEATCS Clerbout, A Solution to Paun's Problem P100 1985 25 BEATCS Arnborg & Proskurowski, Problems on Graphs with Bounded Decomposability 1985 25 BEATCS Balcazar & Diaz & Gabarro, Examples of CFI-Bi-Immune and CF-Levelable Sets in Logspace 1985 25 BEATCS Buzeteanu, Some Generalizations of Kleene's Second Fixed-point Theorem 1985 25 BEATCS Gabarro, Some Applications of the Interchange Lemma 1985 25 BEATCS Lange, A Note on the Closure of EDL-Languages under Erasing Homomorphisms 1985 25 BEATCS Ottmann & Schrapp & Wood, Weight-Balanced Trees are not Stratified 1985 25 BEATCS Overmars & Welzl, A Simple Method for Solving 2-dimensional Static Range Searching 1985 25 BEATCS Paun, On Parikh-Boundedness of Matrix Languages 1985 25 BEATCS Vitanyi, Logarithmic Signal Propagation Delay and the Efficiency of VLSI Circuits 1985 25 BEATCS Turakainen, A Note on Test Sets for R-Rational Languages 1985 25 BEATCS Rosenberg, References to the Literature on VLSI Algorithmics and Related Mathematical and Practical Issues 1985 25 BEATCS Kreowski, Parallelism and Concurrency in Graph Grammars 1985 25 BEATCS Salomaa, review of Brauer (1984) 1985 25 BEATCS Salomaa, review of Bucher and Maurer (1984) 1985 25 BEATCS Lightner, review of Gondran and Minoux (1984) 1985 25 BEATCS Dassow, Open Problems Contributed for the Evening Session at the Third International Meeting of Young Computer Scientists 1985 25 BEATCS Johnson, The Genealogy of Theoretical Computer Science: A Preliminary Report 1984 24 BEATCS Autebert & Boasson & Gabarro, Context-free Grammars in Greibach Normal Forms 1984 24 BEATCS Balanescu, A Proof Rule for the ``it ti'' Generalized Control Structure 1984 24 BEATCS Bloom & Esik, Some Varieties of Iteration Theories 1984 24 BEATCS Crochemore, Linear Searching for a Square in a Word 1984 24 BEATCS Hartmanis, On Non-isomorphic NP Complete Sets 1984 24 BEATCS Hemmerling, A Searching Algorithm for Finite Embedded D-Graphs with No More than k Regions 1984 24 BEATCS O'Dunlaing & Yap, Counting Digraphs and Hypergraphs 1984 24 BEATCS Padawitz & Wirsing, Completeness of Many-sorted Equational Logic Revisited 1984 24 BEATCS Pawlak, On Rough Sets 1984 24 BEATCS Thalheim, A Complete Axiomatization for Full Join Dependencies in Relations 1984 24 BEATCS Benson, review of Tanenbaum (1981) 1984 24 BEATCS Fellner, review of Pavlidis (1982) 1984 24 BEATCS Thomas, On Problem P 63 of M. Takahashi: omega-Languages which are First-order Definable in Terms of Prefixes 1984 24 BEATCS Harju, On Factorizations of Words 1984 24 BEATCS Harju, P67: A Solution to a Problem of Karhumaki 1984 24 BEATCS Kennaway, Solution of Bull. EATCS Problem 68 1984 24 BEATCS Kaufmann & Muller, Calculating the Orientation of Simple Polygons (Problem P69 of G. Knott) 1983 23 BEATCS Calude & Chitescu, A Class of Universal P. Martin-Lof Tests 1983 23 BEATCS Daley & Smith, On the Complexity of Inductive Inference 1983 23 BEATCS Finkel, Petri Nets and Monogenous FIFO Nets 1983 23 BEATCS Freivalds, An Answer to an Open Problem 1983 23 BEATCS Hromkovic, On the Power of Yao-Rivest Technique (Extended Abstract) 1983 23 BEATCS Korec, Two Kinds of Processors are Sufficient and Large Operating Alphabets are Needed for Regular Trellis Automata Languages 1983 23 BEATCS Lautenbach & Pagnoni, On the Various High-level Petri Nets and Their Invariants 1983 23 BEATCS Lenstra, Polynomial-Time Algorithms for the Factorization of Polynomials 1983 23 BEATCS Valk, review of Hailpern (1982) 1983 23 BEATCS Karhumaki, review of Lothaire (1983) 1983 23 BEATCS Paredaens, review of Maier (1983) 1983 23 BEATCS Paredaens, review of Ullman (Principles of Database Systems (second edition)) 1983 23 BEATCS Lengauer, review of Ullman (Computational Aspects of VLSI) 1983 23 BEATCS Kinber, On the Problem P9(2) of J. Case 1983 23 BEATCS Kelemen & Kelemenova, interview of A. Lindenmayer 1984 22 BEATCS Asveld, Remarks on Defining the Complement of a Language 1984 22 BEATCS Balcazar & Diaz & Gabarro, Some Results about Logspace Complexity Measures 1984 22 BEATCS Chazelle & Incerpi, Computing the Connected Components of D-Ranges 1984 22 BEATCS Dassow, A Note on DT0L Systems 1984 22 BEATCS Vitanyi & Meertens, Big Omega versus the Wild Functions 1984 22 BEATCS Hromkovic, A Note on the ``Communication Complexity'' Paper by Papadimitriou and Sipser 1984 22 BEATCS Benson, The Philosophy of Computer Science (reviews of Davis and Hersh (1981) and Kitcher (1983)) 1984 22 BEATCS Apt, review of Ben Ari (1982) 1984 22 BEATCS Leighton, Research Topics 1984 22 BEATCS Carpi, A Result on Weakly Square-free Words Related to a Problem of Restivo 1984 22 BEATCS Hoffmann & Mehlhorn, Intersecting a Line and a Simple Polygon 1983 21 BEATCS Arnold, A Negative Result for Buchi's Automata 1983 21 BEATCS Blumer & Blumer & Ehrenfeucht & Haussler & McConnell, Linear Size Finite Automata for the Set of All Subwords of a Word--An Outline of Results 1983 21 BEATCS Choueka & Peleg, A Note on omega-Regular Languages 1983 21 BEATCS Georgieva, Notes on the Equivalence of Some Programs 1983 21 BEATCS Gogolla & Ehrich, Algebraic Specification with Subsorts Using Declarations 1983 21 BEATCS Raoult, On Graph Rewritings 1983 21 BEATCS Restivo & Salemi, On Weakly Square Free Words 1983 21 BEATCS Schmidt, An Alternative Definition of NP 1983 21 BEATCS Starke, Monogenous FIFO-Nets and PETRI-Nets are Equivalent 1983 21 BEATCS Gruska & Wiedermann, Two Steps Forward and One Backward, or Quo Vaditis Data Structures and Algorithms (review of Aho, Hopcroft, and Ullman (1983)) 1983 21 BEATCS Edelsbrunner, problems 1983 21 BEATCS Restivo, Three Problems on Square Free Words 1983 21 BEATCS Skyum, problem from Skyum and Valiant (1981) 1983 21 BEATCS Bodlaender, A Solution to P 33 1983 21 BEATCS Edelsbrunner & O'Rourke & Seidel, Announcement of a Solution to P20 1983 21 BEATCS Jantzen & Valk, A Solution to P 24 (iii) 1983 21 BEATCS Leiss, Finding Three Points on a Line in 2-D 1983 21 BEATCS Opatrny, A Solution to Problem P26 1983 21 BEATCS Skyum, A Solution to Problem P26 1983 20 BEATCS Bergstra, Disc Allocation for Cartesian Product Files, a Counterexample 1983 20 BEATCS Bunke, What is the Distance between Graphs 1983 20 BEATCS Calude, A Simple Non-Uniform Operation 1983 20 BEATCS Courcelle, Recognizing Regular Languages with Rewriting 1983 20 BEATCS Freivalds & Kinber, On Extensions of Inferable Cases 1983 20 BEATCS Gabow, Priming the Pump for Lower Bounds on Chomsky Form 1983 20 BEATCS Honkala & Salomaa, How Do You Define the Complement of a Language 1983 20 BEATCS Istrail, A Programming Exercise with Some Theoretical Appeal: The Piling of counters I 1983 20 BEATCS Istrail, A Programming Exercise with Some Theoretical Appeal: The Piling of counters II 1983 20 BEATCS Janko, Addendum to a Bibliography on Randomized Algorithms 1983 20 BEATCS Lauer, A Bibliography of a Project on Formal Models of Concurrency 1983 20 BEATCS Longo & Martini, Computability in Higher Types and the Universal Domain P_omega 1983 20 BEATCS Nagl, Bibliography on Graph Rewriting Systems (Graph Grammars) 1983 20 BEATCS Parisi-Presicce, A Remark on Iterative Congruences 1983 20 BEATCS Sifakis, A Note on Deadlocks in CA-Systems 1983 20 BEATCS Siromoney & Subramanian, Generative Grammar for the Cube-free Abbey Floor 1983 20 BEATCS Turakainen, A Machine-oriented Approach to Compositions of Morphisms and Inverse Morphisms 1983 20 BEATCS Rinnooy Kan, review of Papadimitriou and Steiglitz (1982) 1983 20 BEATCS Jones, review of Pohl and Shaw (1981) 1983 20 BEATCS Best & Thiagarajan, Some Open Problems in ``Token Mathematics'' 1983 20 BEATCS Lindenmayer & Salomaa, problem 1983 20 BEATCS Monien & Speckenmeyer & Vornberger, Problems 1983 20 BEATCS Paun, Two Questions on Regular Languages versus Marcus' Contextual Languages 1983 20 BEATCS van Leeuwen, problems 1983 20 BEATCS Jantzen & Lange, A Solution to P 17 1983 20 BEATCS Margolis & Pin, A Solution to P15 1983 20 BEATCS Margolis & Pin, A Solution to Problem P17 1983 20 BEATCS Turakainen, A Solution to Problem 17 1983 19 BEATCS Capri, A Solution to Berstel's Problem P1 1983 19 BEATCS De Felice, An Answer to Berstel's Problem P2 1983 19 BEATCS Case & Fulk, Solution to Machine Inductive Inference Problem P3 1983 19 BEATCS Paun, A Positive Answer to Problem P11 1983 19 BEATCS Verraedt & De Bra & Gyssens, A Solution to P11 1983 19 BEATCS Arnold, Solution to Problem P12 1983 19 BEATCS Boasson, An Answer to P12: www^R is Cube-free 1983 19 BEATCS Crochemore, A Solution to P12 1983 19 BEATCS Ehrenfeucht & Rozenberg, A Solution to P12 1983 19 BEATCS Harju, On Repetition Free Morphisms 1983 19 BEATCS Istrail, A Solution to Wegner's Problem P12 1983 19 BEATCS Keranen, On L. Wegner's Problem in the General Case 1983 19 BEATCS Klop, A Solution to Problem P12 1983 19 BEATCS Skyum, A Solution to P12 1983 19 BEATCS Verraedt & De Bra & Gyssens, A Solution to P12 1983 19 BEATCS Doberkat, review of Greene and Knuth (1981) 1983 19 BEATCS Skyum, review of Hu (1982) 1983 19 BEATCS Yehudai, review of Nijholt (Context-Free Grammars: Covers, Normal Forms and Parsing) 1983 19 BEATCS Salomaa, review of Peter (1981) 1983 19 BEATCS Blikle, review of Tennent (1981) 1983 19 BEATCS Paz, problem 1983 19 BEATCS van Leeuwen, problems 1982 18 BEATCS Crochemore, A Solution to Berstel's Problem P3 1982 18 BEATCS Harju, A Note on Infinite Words Obtained by Iterating Morphisms 1982 18 BEATCS Janko, A Bibliography on Randomized Algorithms 1982 18 BEATCS Overmars, A O(1) Average Time Update Scheme for Balanced Search Trees 1982 18 BEATCS Paterson, Solution to P8 1982 18 BEATCS Nijholt, review of Backhouse (Syntax of Programming Languages: Theory and Practice) 1982 18 BEATCS Gruska, review of Lewis and Papadimitriou (Elements of the Theory of Computation) 1982 18 BEATCS Paredaens, review of Ullman (1980) 1982 18 BEATCS Case, Machine Inductive Inference Problems 1982 18 BEATCS Jantzen, Two Questions about Context-Free Languages 1982 17 BEATCS Best, Representing a Program Invariant as a Linear Invariant in a Petri Net 1982 17 BEATCS Blab, Some Remarks on ``Non-regular C. F. L. and Pumping'' 1982 17 BEATCS de Bra & Paredaens, A Note on Armstrong's Relation 1982 17 BEATCS Groenewegen, Decision Processes and Parallel Programs 1982 17 BEATCS Nijholt, An Annotated Bibliography of Pumping 1982 17 BEATCS Ruohonen, review of Berstel (1979) 1982 17 BEATCS Wegner, review of Standish (1980) 1982 17 BEATCS Rosenfeld, review of Fu (1982) 1982 17 BEATCS Berstel, Three Questions on Square-free Words 1982 17 BEATCS Sudborough, Some Open Problems in Automata-Based Computational Complexity 1982 17 BEATCS Salomaa, problems 1982 16 BEATCS Bergstra, A Propositional Version of Hoare's Logic with Modal Operators 1982 16 BEATCS Bunke, Representation of Control in Parallel Programmed Grammars 1982 16 BEATCS Culik & Gruska & Salomaa, On Non-regular Context-free Languages and Pumping 1982 16 BEATCS Ehrig, Applications of Conditional Graph Productions to Consistency, Synchronization and Scheduling in Data Base Systems 1982 16 BEATCS Klop, Extending Partial Combinatory Algebras 1982 16 BEATCS Volger, Alternating Turing Machines, Bounded Concatenation Theories and the Decision Problem for the First Order Theories: Some Examples 1982 16 BEATCS Vuillemin, A Quick Review of ``Introduction to VLSI Systems'' by C. Mead and L. Conway 1982 16 BEATCS Jantzen, Report on the Book ``Petri Nets and the Modeling of Systems'' by J. L. Peterson 1981 15 BEATCS Book, Context-sensitive Tally Languages 1981 15 BEATCS Edelsbrunner, A Note on Dynamic Range Searching 1981 15 BEATCS Jantke, A Characterization Theorem on Partial Recursive Functions and Abstract Data Types 1981 15 BEATCS Kreowski, Playing the Token Game in an Algebra--Just a Definition 1981 15 BEATCS Kuich, Formal Power Series and One-way Stack Automata 1981 15 BEATCS van Leeuwen, Positions of Symbols in Context-free Derivations 1981 15 BEATCS Paterson, More on Park's Problem 1981 15 BEATCS Verhoeff, On the Compactification of Programs 2 1981 14 BEATCS Schoening, Complete Sets for the Second Level of the Log-space Hierarchy 1981 14 BEATCS Culik, The omega-Equivalence Problem for Tag Systems with Deletion Number One is Decidable 1981 14 BEATCS Overmars, Reporting and Counting Intersections of Arcs on a Circle 1981 14 BEATCS Reutenauer, On a Problem 1981 14 BEATCS Hajek, Arithmetical Interpretations of Dynamic Logic 1981 14 BEATCS Bergstra & Terlouw, A Propositional Version of Hoare's Logic 1981 14 BEATCS Starke, A Note on Conflicts in Petri Nets 1981 14 BEATCS Dassow & Ehrig, Algebraic Considerations on AFL's 1981 14 BEATCS Apt & Bongers & Stefanski, On the Compactification of Programs 1981 13 BEATCS Papadimitriou & Knuth, Duality in Addition Chains 1981 13 BEATCS van Leeuwen, An Elementary Fact about Unambiguity 1981 13 BEATCS Edelsbrunner, Reporting Intersections of Geometric Objects by Means of Covering Rectangles 1981 13 BEATCS Claus, Two Examples to Skolem's Problem 1981 13 BEATCS Gernert, Graph Grammars which Generate Graphs with Specified Properties 1981 13 BEATCS Poigne, A Note on Z-Sets Being Crossed Up and Down 1981 13 BEATCS Bergstra & Meyer, An Equational Class of I/O-Computable Datastructures that Contains no Recursive Datastructure 1981 13 BEATCS Even & Yacobi, A ``Hard-Core'' Theorem for Randomized Algoithms 1981 13 BEATCS Parisi-Presicce, A Note on the Reduction of Systems of Fixed Point Equations 1981 13 BEATCS Meyer, A Note on Arnold-Karpinsky's Seven Equations Bound for Data Specifications 1981 13 BEATCS Ehrich, Implicit Specification by Algebraic Domain Equations 1981 13 BEATCS Nourani, On Induction for Programming Logic: Syntax, Semantics, and Inductive Closure 1981 13 BEATCS Maenpaa & Rozenberg & Salomaa, Supplementary Bibliography of L Systems 1981 13 BEATCS Edelsbrunner & van Leeuwen, Supplement to ``Multidimensional Algorithms and Data Structures (Bibliography)'' 1980 12 BEATCS Arnold & Karpinski, An Easy Improvement of Bergstra-Meyer's 81 Equations Bound for Data Specifications 1980 12 BEATCS Borger & Karpinski, On the Collatz-like Rational Games, Post Factor Replacement and Commutative Semi-Thue Systems 1980 12 BEATCS Nagl, 1980 Bibliography on Graph Rewriting Systems 1980 12 BEATCS Bunke, Graph Rewriting Systems as a Tool for Transforming Descriptions of Line Drawings 1980 12 BEATCS van Emde Boas & Karpinski, A Number Theoretic Problem Arising from a Problem in Automata Theory 1980 12 BEATCS Claus, Some Remarks on PCP(k) and Related Problems 1980 12 BEATCS Jantzen, A Note on Iterating Inverse Homomorphisms 1980 12 BEATCS Arnold & Priese, A Comment on Some Existing Simulation Conceptions for (Concurrent) Systems 1980 12 BEATCS Gernert & Sammer, Procedure Call by Pattern Matching 1980 12 BEATCS Klaeren, Bibliography on Abstract Software Specification 1980 11 BEATCS Ehrig & Kreowski & Padawitz, Completeness in Algebraic Specifications 1980 11 BEATCS Weihrauch, Is Binary Notation Optimal? (An Open Probem) 1980 11 BEATCS Bibel, A Theoretical Basis for the Systematic Proof Method 1980 11 BEATCS Boasson, Conjugates and CF Languages 1980 11 BEATCS Szilard, Sixteen Defenseless Black Knights 1980 11 BEATCS Fischer & van Leeuwen, Reducing 3DM to Clique and Hamiltonian Circuit 1980 11 BEATCS Eisman, Intercalation Theorems for Derivation Controlled Lindenmeyer Systems 1980 11 BEATCS Bergstra & Tucker, A Natural Data Type with a Finite Equational Final Semantics Specification but no Effective Equational Initial Semantics Specification 1980 11 BEATCS Broy & Wirsing, Partial Recursive Functions and Abstract Data Types 1980 11 BEATCS Henno, A Partial Solution to B. Reusch Problem 1980 11 BEATCS Edelsbrunner & van Leeuwen, Multidimensional Algorithms and Data Structures--A Bibliography 1980 10 BEATCS Meyer, Ten Thousand and One Logics of Programming 1980 10 BEATCS Book, Remarks on Linear Context-Free Languages 1980 10 BEATCS Ainhirn, A Note on Goodness of E0L Fors 1980 10 BEATCS van Emde Boas, Nondeterminism Cannot Be Explained Deterministically: A Counterexample to a Problem Posed by Bernd Reusch 1980 10 BEATCS Starke, Remarks on Reusch's Nondeterminism Problem 1980 10 BEATCS Berengner & Diaz, Computing Minimal Weight Vertex Covers in Bipartite Graphs 1980 10 BEATCS Bucher, A Density Problem for Context-Free Languages 1980 10 BEATCS Leiss, Constructing a Finite Automaton for a Given Regular Expression 1980 10 BEATCS Gernert, New Resuls on Odd Perfect Numbers 1980 10 BEATCS Olivie, On Random Son-Trees 1979 9 BEATCS Bentley, Priority Queues with Range Restriction 1979 9 BEATCS Reusch, An Open Problem Concerning Non-Determinism 1979 9 BEATCS van Leeuwen, Squaring a 2 x 2 Matrix 1979 9 BEATCS Prodinger, A Remark Concerning the Solution of a Linear Congruence 1979 9 BEATCS Ehrig, Graph Grammars Versus Discrete Dynamics 1979 9 BEATCS Karhumaki & Simon, A Note on Elementary Homomorphisms and the Regularity of Equality Sets 1979 9 BEATCS Gernert, Homogeneous Graph Grammars 1979 9 BEATCS Fiduccia, Remarks on a Note of Alt and van Leeuwen Regarding Products in Finite-dimensional Algebras 1979 9 BEATCS Schmeck, A Note on Extending the Notion of Finite Index 1979 9 BEATCS Lippe, Context-Sensitive Top-Down Creative Dendrogrammars 1979 9 BEATCS Olivie & Paredaens, On the Relationship Between Son-Trees and Symmetric Binary B-Trees 1979 9 BEATCS Bertoni & Mauri & Miglioli & Wirsing, On Different Approaches to Abstract Data Types and the Existence of Recursive Models 1979 8 BEATCS Staples, Dynamics of Discrete Structures 1979 8 BEATCS Salomaa, D0L Language Equivalence 1979 8 BEATCS Autebert & Beauquier & Boasson, Some Remarks about Minimal Relational Cones 1979 8 BEATCS Alt & van Leeuwen, A Classroom Note on Computing Products in Finite-Dimensional Algebras 1979 8 BEATCS Gernert, Representation of Knowledge by Means of Nonprocedural Languages and their Compilers 1979 8 BEATCS Barz & Zima, A Bibliography of Parallel Processing 1979 7 BEATCS Gernert, Measuring the Similarity of Complex Structues b Means of Graph Grammars 1979 7 BEATCS Backhouse & Anderson, Least-Cost Repair of Syntax Errors 1978 6 BEATCS Jones, Blindfold Games are Harder than Games with Perfect Information 1978 6 BEATCS Boscarol, First Results about Perrin & Schutzenberger Conjecture 1978 6 BEATCS Raulefs & Siekmann & Szabo & Unvericht, A Short Survey on the State of the Art in Matching and Unification Probems 1978 6 BEATCS Wood, PDA Forms and Strict Interpretations 1978 6 BEATCS Hagauer, A Simple Variable-free CF Grammar Generating a Non Regular Language 1978 6 BEATCS Springsteel & Pudlak, Intermediate Complexity in Data Matrix Problems 1978 6 BEATCS Paredaens, On a Formal Description of Constraints in a Data Base Scheme 1978 6 BEATCS Deussen & Wegner, Bibliography of van Wijngaarden Grammars 1978 5 BEATCS Price & Wotschke, The Triple Construction for Converting a PDA into a CFG is Sometimes Optimal 1978 5 BEATCS Schulz, Garden of Eden-Configurations 1978 5 BEATCS Penttonen, The Equivalence for Realtime Strict DPDA's is Still Open 1978 5 BEATCS Wood, Bibliography of Grammatical Similarity 1978 5 BEATCS Linna, The FPP-Problem for Regular Languges 1978 5 BEATCS Perrin & Schutzenberger, A Conjecture of Differences of Integer Pairs 1978 4 BEATCS Ja'Ja', Optimal Evaluation of Pairs of Bilinear Forms 1978 4 BEATCS Boasson, A Remark on Ogden's Lemma 1978 4 BEATCS Salomaa, D0L Equivalence, The Problem of Iterated Morphisms 1978 4 BEATCS Raz, IL Systems with Bounded Interactions 1978 4 BEATCS Ottmann, On log(n) Solutions of the Dictionary Problem for One-sided Height-balanced Binary Search Trees 1978 4 BEATCS Penttonen, The Decidability of the Equivalence Problem for Realtime Strict Deterministic Pushdown Automata 1978 4 BEATCS Wood, A Bibliography of Top-down Deterministic Parsing 1977 3 BEATCS Courcelle, On the Equivalence Problem for Realtime DPDA's 1967 46 BELLTJ Hopcroft & Ullman, An Approach to a Unified Theory of Automata 1987 BIBLIOP Girard, Proof Theory and Logical Complexity, Volume I 1993 3 BIFURC Nowak & May, The Spatial Dilemmas of Evolution 1995 BIGBROTH RSA Laboratories, Answers to Frequently Asked Questions about Today's Cryptography 1995 BIGBROTH Zimmermann, Pretty Good Privacy: Public Key Encryption for the Masses 1995 BIGBROTH Micali, Fair Cryptosystems 1995 BIGBROTH Diffie, The Impact of a Secret Cryptographic Standard on Encryption, Privacy, Law Enforcement and Technology 1994 22 BIMAS Kynsijarvi & Nieminen, A New Class of Fault Tolerant Communication Networks 1988 16 BIMAS Cohen, On the Capacity of Write-Unidirectional Memories 1996 28 BINFCYB Lee & Kawahara, Transition Diagrams of Finite Cellular Automata 1996 28 BINFCYB Kiwata & Arikawa, Introducing Types into Elementary Formal Systems 1993 25 BINFCYB Takeda, A Fast Matching Algorithm for Patterns with Pictures 1993 25 BINFCYB Furuya & Miyano, NP-Hard Aspects in Analogical Reasoning 1993 25 BINFCYB Furukawa, An Order Relation and Fundamental Operations on Fuzzy Numbers and Their Applications to Fuzzy Linear Programming 1991 24 BINFCYB Shi & Arikawa, Completeness of Dynamic Time-Bounded Derivation for Locally Weak Reducing Programs 1991 24 BINFCYB Nohmi, On a Polynomial Representation of Finite Linear Cellular Automata 1991 24 BINFCYB Yoshida, Zero-sum Games for Discrete-time Multi-parameter Processes 1989 23 BINFCYB Sasagawa, The Dynamics on the Cell Spaces with p States under the Local Transformations Satisfying the Principle of Local Majority 1987 22 BINFCYB Tanatsugu, A Grammatical Inference for Context-Free Languages Based on Self-Embedding 1987 22 BINFCYB Mizoguchi & Ohtsuka & Kawahara, A Symbolic Calculus of Regular Expressions 1987 22 BINFCYB Miyahara, Inductive Inference by Iteratively Working and Consistent Strategies with Anomalies 1992 34 BIOMET Jansen & Douven & van Berkum, An Annealing Algorithm for Searching Optimal Block Designs 1996 BIRKHAUSER Zemanian, Transfiniteness For Graphs, Electrical Networks, and Random Walks 1995 BIRKHAUSER Vilenkin, In Search of Infinity 1995 BIRKHAUSER Di Cosmo, Isomorphisms of Types: From lambda-Calculus to Information Retrieval and Language Design 1995 BIRKHAUSER Kung (Ed.), Gian-Carlo Rota on Combinatorics: Introductory Papers and Commentaries 1995 BIRKHAUSER Engeler & Aberer & Amrhein & Gloor & von Mohrenschildt & Otth & Schwarzler & Weibel, The Combinatory Programme 1994 BIRKHAUSER Bini & Pan, Polynomial and Matrix Computations: Fundamental Algorithms, Volume 1 1994 BIRKHAUSER Riesel, Prime Numbers and Computer Methods for Factorization, Second Edition 1994 BIRKHAUSER Royer & Case, Subrecursive Programming Systems: Complexity & Succinctness 1994 BIRKHAUSER Straubing, Finite Automata, Formal Logic, and Circuit Complexity 1993 BIRKHAUSER Kobler & Schoning & Toran, The Graph Isomorphism Problem: Its Structural Complexity 1993 BIRKHAUSER Curien, Categorical Combinators, Sequential Algorithms, and Functional Programming, Second Edition 1993 BIRKHAUSER Eyssette & Galligo (Eds.), Computational Algebraic Geometry 1992 BIRKHAUSER Kac & Rota & Schwartz & Renz, Discrete Thoughts: Essays on Mathematics, Science, and Philosophy, Revised and Corrected Edition 1992 BIRKHAUSER Bradfield, Verifying Temporal Properties of Systems 1991 BIRKHAUSER Drucker (Ed.), Perspectives on the History of Mathematical Logic 1991 BIRKHAUSER Lawler, Intersections of Random Walks 1991 BIRKHAUSER Ko, Complexity theory of Real Functions 1991 BIRKHAUSER Streicher, Semantics of Type Theory: Correctness, Completeness and Independence Results 1991 BIRKHAUSER Bachmair, Canonical Equational Proofs 1991 BIRKHAUSER Karloff, Linear Programming 1990 BIRKHAUSER Buss & Scott (Eds.), Feasible Mathematics: A Mathematical Sciences Institute Workshop, Ithaca, New York, June 1989 1990 BIRKHAUSER Greene & Knuth, Mathematics for the Analysis of Algorithms, Third Edition 1989 BIRKHAUSER Schoening, Logic for Computer Scientists 1987 BIRKHAUSER Maor, To Infinity and Beyond: A Cultural History of the Infinite 1987 BIRKHAUSER Trudeau, The Non-Euclidean Revolution 1986 BIRKHAUSER Ulam, Science, Computers, and People: From the Tree of Mathematics 1984 BIRKHAUSER Goldberg, Understanding Relativity: Origin and Impact of a Scientific Revolution 1996 36 BIT Bennet & Edwards, A Graph Isomorphism Algorithm Using Pseudoinverses 1994 34 BIT Aspvall & Heggernes, Finding Minimum Height Elimination Trees for Interval Graphs in Polynomial Time 1994 34 BIT Walker, A Summability Method for the Arithmetic Fourier Transform 1994 34 BIT Naur, Proof versus Formalization 1993 33 BIT Chang & Kowng & Wu, A Refinement of Compression-oriented Addressing Scheme 1993 33 BIT Harris & Ramamohanarao, Optimal Dynamic Multi-attribute Hashing for Range Queries 1993 33 BIT Jansen & Woeginger, The Complexity of Detecting Crossing-free Configurations in the Plane 1993 33 BIT Chou & Chung, Modeling of Superscalar Instruction Scheduling and Analysis of a Heuristic Scheduling Algorithm 1993 33 BIT Dutton, Weak-heap Sort 1993 33 BIT Jan & Chang, A Key-Lock-Pair Oriented Access Control Scheme for the Growth of Users and Files 1993 33 BIT Liang, An O(n^2) Algorithm for Finding the Compact Sets of a Graph 1993 33 BIT Olariu & Schwing & Zhang, Optimal Convex Hull Algorithms on Enhanced Meshes 1993 33 BIT Poblete, A Note on the Height of the kth Element in a Heap 1993 33 BIT Yu & Chen, Parallel Algorithms for Permutation Graphs 1993 33 BIT Yu & Yang, A Linear Time Algorithm for the Maximum Matching Problem on Cographs 1993 33 BIT Imielinska & Kalantari, A Generalized Hypergreedy Algorithm for Weighted Perfect Matching 1993 33 BIT Lundberg, Performance Bounds on Multiprocessor Scheduling Strategies for Statically Allocated Programs 1993 33 BIT Sykora & Vrio, On Crossing Numbers of Hypercubes and Cube Connected Cycles 1993 33 BIT Wang, Efficiently Updating Constrained Delaunay Triangulations 1993 33 BIT Barrera & Olsson, An Integer Based Square Root Algorithm 1993 33 BIT Atkinson & Thiyagarajah, The Permutational Power of a Priority Queue 1993 33 BIT Bhagavathi & Looges & Olariu & Schwing & Zhang, Selection on Rectangular Meshes with Multiple Broadcasting 1993 33 BIT Cesarini & Soda, Single Access Hashing with Overflow Separators for Dynamic Files 1993 33 BIT Gambosi & Protasi & Talamo, An Efficient Implicit Data Structure for Relation Testing and Searching in Partially Ordered Sets 1993 33 BIT Liaw & Lei, An Optimal Algorithm to Assign Cryptographic Keys in a Tree Structure for Access Control 1993 33 BIT Stewart, On Parallelizing a Greedy Heuristic for Finding Small Dominant Sets 1992 32 BIT Chen & Yang & Lee, Amortized Analysis of Some Disk Scheduling Algorithms: SSTF, SCAN and N-step SCAN 1992 32 BIT Coolsaet & de Meyer & Fack, Optimal Algorithms for Total Exchange without Buffering on the Hypercube 1992 32 BIT de Graaf & Kosters, Expected Heights in Heaps 1992 32 BIT Katajainen & Pasanen, Stable Minimum Space Partitioning in Linear time 1992 32 BIT Olariu & Schwing & Zhang, A Constant-Time Channel-Assignment Algorithm on Reconfigurable Meshes 1992 32 BIT Perkins, A Mixed Directed-Undirected Data Structure for a Parallel Implementation of a Domain Decomposition Algorithm 1992 32 BIT Yu & Chen, The Weighted Maximum Independent Set Problem in Permutation Graphs 1992 32 BIT Hoshi & Flajolet, Page Usage in a Quadtree Index 1992 32 BIT Jan & Hsu & Lee, The Most Vital Edges with respect to the Number of Spanning Trees in Two-Terminal Series-Parallel Graphs 1992 32 BIT Mairson, The Effect of Table Expansion on the Program Complexity of Perfect Hash Functions 1992 32 BIT Boppana & Halldorsson, Approximating Maximum Independent Sets by Excluding Subgraphs 1992 32 BIT Arnborg & Proskurowski, Canonical Representations of Partial 2- and 3-Trees 1992 32 BIT Pantziou & Spirakis & Zaroliagis, Efficient Parallel Algorithms for Shortest Paths in Planar Digraphs 1992 32 BIT Eppstein, Finding the k Smallest Spanning Trees 1992 32 BIT Hershberger & Suri, Applications of a Semi-Dynamic Convex Hull Algorithm 1992 32 BIT Van Kreveld & Overmars & Agarwal, Intersection Queries in Sets of Disks 1992 32 BIT Levcopoulos & Lingas, Fast Algorithms for Greedy Triangulation 1992 32 BIT Baeza-Yates & Gonnet & Ziviani, Improved Bounds for the Expected Behaviour of AVL Trees 1992 32 BIT Papadakis & Munro & Poblete, Average Search and Update Costs in Skip Lists 1992 32 BIT Colson, On List Primitive Recursion and the Complexity of Computing inf 1992 32 BIT Coquand, The Paradox of Trees in Type Theory 1992 32 BIT Despeyroux, Theo: An Interactive Proof Development System 1992 32 BIT Fredholm & Serafimovski, Partial Inductive Definitions as Type-Systems for Lambda-Terms 1992 32 BIT Hallnas, On Systems of Definitions, Induction and Recursion 1992 32 BIT Mints, Complexity of Subclasses of the Intuitionistic Propositional Calculus 1992 32 BIT Palmgren & Stoltenberg-Hansen, Remarks on Martin-Lof's Partial Type Theory 1992 32 BIT Salvesen, On Specifications, Subset Types and Interpretation of Proposition in Type Theory 1991 31 BIT Bartling & Hinrichs, Probabilistic Analysis of an Algorithm for Solving the k-Dimensional All-Nearest-Neighbors Problem by Projection 1991 31 BIT Chen & Lin, Optimality Criteria of the Disk Modulo Allocation Method for Cartesian Product Files 1991 31 BIT Eloranta, Minimizing the Number of Transitions with Respect to Observation Equivalence 1991 31 BIT Lingas, An Unfeasible Matching Problem 1991 31 BIT Teo & Tuan, A Tight Upper Bound for the Number of Intersections between Two Rectangular Paths 1991 31 BIT Gambosi & Italiano & Talamo, The Set Union Problem with Dynamic Weighted Backtracking 1991 31 BIT Grape, Complete Problems with L-samplable Distributions 1991 31 BIT Puustjarvi, Distributed Management of Transactions in Heterogeneous Distributed Database Systems 1991 31 BIT Schipper & Overmars, Dynamic Partition Trees 1991 31 BIT Arikati & Rangan & Manacher, Efficient Reduction for Path Problems on Circular-Arc Graphs 1991 31 BIT Atkinson, The Recursive Structure of Some Ordering Problems 1991 31 BIT Van Kreveld & De Berg, Finding Squares and Rectangles in Sets of Points 1991 31 BIT Liu & Chen & Wang, A Note on Optimal Multiway Split Trees 1991 31 BIT Wang, Finding Minimal Nested Polygons 1991 31 BIT Makinen, A Linear Time and Space Algorithm for Finding Isomorphic Subtrees of a Binary Tree 1991 31 BIT Gunther & Wong, A Dual Approach to Detect Polyhedral Intersections in Arbitrary Dimensions 1991 31 BIT Johnsen, Generating Binary Trees with Uniform Probability 1991 31 BIT Konvalina & Liu, Bit Strings without q-Separation 1991 31 BIT Vaishnavi & Korson, Height-Analysis of k-Dimensional Leaf and Node Height-Balanced Trees: A New Approach 1991 31 BIT Van de Vel & Shijie, A Modification of Hochbaum and Shmoys' Algorithm for Scheduling Problems 1991 31 BIT Yuan, An Efficient Fault-Tolerant Decentralized Commit Protocol for Single Site Failure 1991 31 BIT Zhang & Rao, Optimal Parallel Quicksort on EREW PRAM 1990 30 BIT Chen & Chang, On the Minimality of Polygon Triangulation 1990 30 BIT Kokosinski, On Generation of Permutations through Decomposition of Symmetric Groups into Cosets 1990 30 BIT Kuo & Tseng, On the Invariance of Male Optimal Stable Matching 1990 30 BIT Mannila & Ukkonen, Unifications, Deunifications and their Complexity 1990 30 BIT Manolopoulos & Faloutsos, Analysis for the End of Block Wasted Space 1990 30 BIT Tan, A Maximum Stable Matching for the Roommates Problem 1990 30 BIT Fjallstrom & Katajainen & Levcopoulos & Petersson, A Sublogarithmic Convex Hull Algorithm 1990 30 BIT Overmars & Schipper & Sharir, Storing Line Segments in Partition Trees 1990 30 BIT Ramamohanarao & Shepherd & Sacks-Davis, Multi-Attribute Hashing with Multiple File for High Performance Partial-Match Retrieval 1990 30 BIT Stojmenovic, An Optimal Algorithm for Generating Equivalence Relations on a Linear Array of Processors 1990 30 BIT Tarhio, Uncle-Attributed Grammars 1990 30 BIT Varadarajan, Partitioning Multi-Edge Graphs 1990 30 BIT Douglas & Miranker, The Multilevel Principle Applied to Sorting 1990 30 BIT Huang, A Divide-and-Conquer Algorithm for Constructing Relative Neighborhood Graph 1990 30 BIT Huang & Viswanathan, On the Construction of Weighted Time-optimal B-Trees 1990 30 BIT Manolopoulos & Kollias, Optimal Data Placement in Two-Headed Disk Systems 1990 30 BIT Munro & Raman & Salowe, Stable In Situ Sorting and Minimum Data Movement 1990 30 BIT Winters, Minimal Perfect Hashing in Polynomial Time 1990 30 BIT Zubair & Gupta, Embeddings on a Boolean Cube 1990 30 BIT Anderson, A General Transposition Method for a Matrix on Auxiliary Store 1990 30 BIT Bauslaugh & Ruskey, Generating Alternating Permutations Lexicographically 1990 30 BIT Chang & Lin, A Reciprocal Confluence Tree Unit and its Applications 1990 30 BIT Jajodia & Springsteel, Lossless Outer Joins with Incomplete Information 1990 30 BIT Lang, Analysis of Recursive Batched Interpolation Search 1990 30 BIT Robison, An Improved Rewriting-Number Algorithm 1990 30 BIT Sprugnoli, Counting Labels in Binary Trees 1990 30 BIT Stewart, An Axiomatic Treatment of SIMD Assignment 1990 30 BIT Syslo & Winter, In-Trees and Plane Embeddings of Outerplanar Graphs 1989 29 BIT Baeza-Yates, A Trivial Algorithm Whose Analysis Is Not: A Continuation 1989 29 BIT Galle, Branch & Sample: A Simple Strategy for Constraint Satisfaction 1989 29 BIT Melhem & Guerra, The Application of a Sequence Notation to the Design of Systolic Computations 1989 29 BIT Scheuermann & Park & Omiecinski, A Heuristic File Reorganization Algorithm Based on Record Clustering 1989 29 BIT Tseng, The Average Performance of a Parallel Stable Marriage Algorithm 1989 29 BIT Makinen, Constructing a Binary Tree from Its Traversals 1989 29 BIT Gropp & Ipsen, Recursive Mesh Refinement on Hypercubes 1989 29 BIT Huang & Huang, On the Complexity of Some Arborescences Finding Problems on a Multihop Radio Network 1989 29 BIT Huang & Tsai, A Linear Systolic Algorithm for the Connected Component Problem 1989 29 BIT Jokinen, Automatically Replacing Indices into Parallel Arrays with Pointers to Records 1989 29 BIT Quinn, Analysis and Benchmarking of Two Parallel Sorting Algorithms: Hyperquicksort and Quickmerge 1989 29 BIT Strothotte & Eriksson & Vallner, A Note on Constructing Min-Max Heaps 1989 29 BIT Gori & Soda, An Algebraic Approach to Cichelli's Perfect Hashing 1989 29 BIT Gupta & Bhattacharjee, A Parallel Derangement Generation Algorithm 1989 29 BIT Lin & Tsay, A Systolic Generation of Combinations 1989 29 BIT Selmer, On Shellsort and the Frobenius Problem 1989 29 BIT Veklerov, On the Decomposability of the Stable Marriage Problem 1988 28 BIT Beck & Krogdahl, A Select and Insert Sorting Algorithm 1988 28 BIT Faloutsos, Signature Files: An Integrated Access Method for Text and Attributes Suitable for Optical Disk Storage 1988 28 BIT Gibson, A Generalisation of Brickell's Algorithm for Fast Modular Multiplication 1988 28 BIT Richards & Vaidya, On the Distribution of Comparisons in Sorting Algorithms 1988 28 BIT Skiena, Encroaching Lists as a Measure of Presortedness 1988 28 BIT Stojmenovic & Langston, On a Proposed Divide-and-Conquer Minimal Spanning Tree Algorithm 1988 28 BIT Denzer & Ecker, Optimal Multipliers for Linear Congruential Pseudo-random Number Generators with Prime Moduli 1988 28 BIT Dijkstra, On Binary Operators and Their Derived Relations 1988 28 BIT Erdos & Riesel, On Admissible Constellations of Consecutive Primes 1988 28 BIT Ershov, Basic Concepts of Algorithms and Programming to be Taught in a School Course in Informatics 1988 28 BIT Aasa & Holmstrom & Nilsson, An Efficiency Comparison of Some Representations of Purely Functional Arrays 1988 28 BIT Gries & Xue, Generating a Random Cycle Permutation 1988 28 BIT Johansen, Inductive Inference of Ultimately Periodic Sequences 1988 28 BIT Aurenhammer, On-line Sorting of Twisted Sequences in Linear Time 1988 28 BIT Huang, A VLSI Partition Algorithm 1988 28 BIT Karlsson & Overmars, Scanline Algorithms on a Grid 1988 28 BIT Chen & Kuo & Sheu, An Optimal Time Algorithm for Finding a Maximum Weight Independent Set in a Tree 1988 28 BIT Knott, Linear Open Addressing and Peterson's Theorem Rehashed 1987 27 BIT Belik, Deadlock Avoidance with a Modified Banker's Algorithm 1987 27 BIT Chang & Chen, Performance of Two-Disk Partition Data Allocations 1987 27 BIT Hasham & Sack, bounds for Min-Max Heaps 1987 27 BIT Munro & Poblete, Searchability in Merging and Implicit Data Structures 1987 27 BIT Makinen, On Top-Down Splaying 1987 27 BIT Noga, Sorting in Parallel by Double Distributive Partitioning 1987 27 BIT Burgdorff & Jajodia & Springstell & Zalcstein, Alternative Methods for the Reconstruction of Trees from their Traversals 1987 27 BIT Chen & Chern & Lee, A New Systolic Architecture for Convex Hull and Half-Plane Intersection Problems 1987 27 BIT Friesen & Langston, Bin Packing: On Optimizing the Number of Pieces Packed 1987 27 BIT Loizou & Thanisch, On Finding a Worst-Case Optimal Fourth Normal Form Database Decomposition 1987 27 BIT Makinen, Left Distance Binary Tree Representations 1987 27 BIT Pawagi, Maximum Weight Independent Set in Trees 1987 27 BIT Carlsson, Average-case Results on Heapsort 1987 27 BIT van Leeuwen & Wiedermann, Array Processing Machines: An Abstract Model 1987 27 BIT Wegner, A Generalized, One-way, Stackless Quicksort 1985 25 BIT Flajolet, Approximate Counting: A Detailed Analysis 1985 25 BIT Chazelle & Guibas & Lee, The Power of Geometric Duality 1984 24 BIT Zaks, A New Algorithm for Generation of Permutations 1981 21 BIT Itoga, The String Merging Problem 1968 8 BIT Dijkstra, A Constructive Approach to the Problem of Program Correctness 1966 6 BIT Naur, Proof of Algorithms by General Snapshots 1989 BLACKWELL Stewart, Does God Play Dice? The Mathematics of Chaos 1987 BLACKWELL Henson, Elements of Functional Languages 1993 55 BMB Unger & Moult, Finding the Lowest Free Energy Conformation of a Protein is an NP-hard Problem: Proof and Implications 1993 55 BMB Fraenkel, Complexity of Protein Folding 1993 55 BMB Tofts, Algorithms for Task Allocation in Ants. (A Study of Temporal Polyethism: Theory) 1993 55 BMB Chao & Hardison & Miller, Constrained Sequence Alignment 1992 54 BMB Van Pelt & Uylings & Verwer & Pentney & Woldenberg, Tree Asymmetry--a Sensitive and Practical Measure for Binary Topological Trees 1991 53 BMB Rosen, Rook's Tour Representation of the Genetic Code 1990 52 BMB Mott & Kirkwood & Curnow, An Accurate Approximation to the Distribution of the Length of the Longest Matching Word Between Two Random DNA Sequences 1990 52 BMB Gotoh, Consistency of Optimal Sequence Alignments 1990 52 BMB Atlan & Koppel, The Cellular Computer DNA: Program or Data 1990 52 BMB Gotoh, Optimal Sequence Alignment Allowing for Long Gaps 1990 52 BMB Allison & Yee, Minimum Message Length Encoding and the Comparison of Macromolecules 1989 51 BMB Auger & Lawrence, Algorithms for the Optimal Identification of Segment Neighborhoods 1989 51 BMB Zuker & Somorjai, The Alignment of Protein Structures in Three Dimensions 1989 51 BMB Churchill, Stochastic Models for Heterogeneous DNA Sequences 1989 51 BMB Tavare & Song, Codon Preference and Primary Sequence Structure in Protein-Coding Regions 1989 51 BMB Sankoff & Goldstein, Probabilistic Models of Genome Shuffling 1989 51 BMB Arratia & Gordon, Tutorial on Large Deviations for the Binomial Distribution 1989 51 BMB Bandelt & Dress, Weak Hierarchies Associated with Similarity Measures--An Additive Clustering Technique 1989 51 BMB Ferretti & Sankoff, A Continuous Analog for RNA Folding 1989 51 BMB Easthope & Havel, Computational Experience with an Algorithm for Tetrangle Inequality Bound Smoothing 1989 51 BMB Myers & Miller, Approximate Matching of Regular Expressions 1986 BOOK Ko, Applying Techniques of Discrete Complexity Theory to Numerical Computation 1986 BOOK Mahaney, Sparse Sets and Reducibilities 1986 BOOK McAloon, Models of Arithmetic and Complexity Theory 1988 BOOKTR Allender & Watanabe, Kolmogorov Complexity and Degrees of Tally Sets 1988 BOOKTR Tang & Book, Polynomial-Time Reducibilities and ``Almost All'' Oracle Sets 1988 BOOKTR Tang & Watanabe, On Tally Relativizations of BP-Complexity Classes 1988 BOOKTR Book & Tang, A Note on Sparse Sets and the Polynomial-Time Hierarchy 1986 BOOKTR Balcazar & Book, Sets with Small Generalized Kolmogorov Complexity 1986 BOOKTR Book & Long, Relativizing the P =? NP Problem 1986 BOOKTR Book & Orponen & Russo & Watanabe, Lowness Properties of Sets in the Exponential-Time Hierarchy 1986 BOOKTR Book, Separating Relativized Complexity Classes 1984 BOOKTR Orponen & Schoening, On the Density of Polynomial Complexity Cores 1984 BOOKTR Orponen & Russo & Schoening, Optimal Approximations and Polynomially Levelable Sets 1984 BOOKTR Du & Isakowitz & Russo, Structural Properties of Complexity Cores 1984 BOOKTR Orponen, A Classification of Complexity Core Lattices 1984 BOOKTR Du & Book, The Existence and Density of Generalized Complexity Cores 1984 BOOKTR Russo & Orponen, A Duality between Recursive Complexity Cores and Polynomial Time Computable Subsets 1993 BROWN Robbins, Beginning Number Theory 1988 BROWN Schmidt, Denotational Semantics--A Methodology for Language Development 1996 2 BSL Dehornoy, Another Use of Set Theory 1996 2 BSL Nies & Shore & Slaman, Definability in the Recursively Enumerable Degrees 1996 2 BSL Soare, Computability and Recursion 1996 2 BSL Lincoln & Mitchell & Scedrov, Linear Logic Proof Games and Optimization 1996 2 BSL Walukiewicz, A Note on the Completeness of Kozen's Axiomatisation of the Propositional mu-Calculus 1996 2 BSL Henkin, The Discovery of My Completeness Proofs 1996 2 BSL Pohlers, Pure Proof Theory, Aims, Methods and Results 1996 2 BSL Kanamori, The Mathematical Development of Set Theory from Cantor to Cohen 1995 1 BSL Davis, American Logic in the 1920s 1995 1 BSL Freiling, How to Compute Antiderivatives 1995 1 BSL Lempp & Lerman, A General Framework for Priority Arguments 1995 1 BSL The ASL Committee on Logic and Education, Guidelines for Logic Education 1995 1 BSL Shoenfield, The Mathematical Work of S. C. Kleene 1995 1 BSL Parsons, Platonism and Mathematical Intuition in Kurt Godel's Thought 1994 122 BSMF Arnoux & Mauduit & Shiokawa & Tamura, Complexity of Sequences Defined by Billiards in the Cube 1988 116 BSMF Voloch, A Note on Elliptic Curves over Finite Fields 1993 BSTNIA Berkey & Homer & Kanamori, Intractable Problems: P = NP 1970 BURKS Burks, Von Neumann's Self-Reproducing Automata 1970 BURKS Burks, Programming and the Theory of Automata 1970 BURKS Burks, Toward a Theory of Automata Based on More Realistic Primitive Elements 1970 BURKS Thatcher, Self-Describing Turing Machines and Self-Reproducing Cellular Automata 1970 BURKS Thatcher, Universality in the von Neumann Cellular Model 1970 BURKS Moore, Machine Models of Self-Reproduction 1970 BURKS Myhill, The Converse of Moore`s Garden-of-Eden Theorem 1970 BURKS Myhill, The Abstract Theory of Self-Reproduction 1970 BURKS Ulam, On Some Mathematical Problems Connected with Patterns of Growth of Figures 1970 BURKS Schrandt & Ulam, On Recursively Defined Geometrical objects and Patterns of Growth 1970 BURKS Stein & Ulam, Nonlinear Transformation Studies on Electronic Computers 1970 BURKS Holland, A Universal Computer Capable of Executing an Arbitrary Number of Subprograms Simultaneously 1970 BURKS Holland, Iterative Circuit Computers 1970 BURKS Holland, Outline for a Logical Theory of Adaptive Systems 1970 BURKS Holland, Hierarchical Descriptions, Universal Spaces, and Adaptive Systems 1977 BUSWEEK , The Growing Threat to Computer Security 1996 21 BYTE Westerfeld, Extending OS/2's User Interface (February) 1996 21 BYTE Webster, The Real Software Crisis 1995 20 BYTE Wayner, Picking the Crypto Locks: A New Technique Called Differential Cryptanalysis Can Break Even DES Quickly 1995 20 BYTE Schneier, Factoring in Public-Key's Future 1995 20 BYTE Gasteiger, Wanted: A Good OS/2 Spreadsheet (June) 1993 18 BYTE Wayner, Optimal Character Recognition 1993 18 BYTE Schneier, Digital Signatures 1992 17 BYTE Manber & Wu, Approximate Pattern Matching 1992 17 BYTE Alford, How Interrupts Work: Interrupt-Processing Mechanisms in PC Systems 1991 16 BYTE Fountain, Modula's Children, Part II: Oberon 1991 16 BYTE Wayner, Smart Memories 1991 16 BYTE Schulman, Undocumented DOS 1991 16 BYTE Apiki, Lossless Data Compression 1991 16 BYTE Alford, The IDE Hard Disk Drive Interface 1989 14 BYTE Kenner, review of Dewdney, The Turing Omnibus: 61 Excursions in Computer Science (1989) 1989 14 BYTE Tevanian & Smith, Mach: The Model for Future Unix 1989 14 BYTE Clarkson, The Quest for the Molecular Computer 1989 14 BYTE Reed, The Quantum Transistor 1989 14 BYTE Vose, review of Gehani, C: An Advanced Introduction, ANSI C Edition, Computer Science Press, 1988 1989 14 BYTE Udell, Extensible Text Editors for Programmers 1989 14 BYTE Thomas, What's in an Object? 1989 14 BYTE Wegner, Learning the Language 1989 14 BYTE Dodani & Hughes & Moshell, Separation of Powers 1989 14 BYTE Thompson, The Next Step 1988 13 BYTE Kernighan & Ritchie, The State of C 1988 13 BYTE Stroustrup, A Better C? 1988 13 BYTE Linowes, It's an Attitude (object-oriented programming in C) 1988 13 BYTE Clinger, Semantics of Scheme 1988 13 BYTE Abelson & Sussman, Lisp: A Language for Stratified Design 1988 13 BYTE Touretzky, How Lisp Has Changed 1988 13 BYTE , Lisp Resource Guide 1988 13 BYTE Wayner, Error-Free Fractions 1988 13 BYTE O'Neill, Faster Than Fast Fourier 1988 13 BYTE Barnsley & Sloan, A Better Way to Compress Images 1988 13 BYTE Bourn, review of Duncan, The MS-DOS Encyclopedia (1988) 1988 13 BYTE Myers, review of IBM Corp., IBM Personal System/2 and Personal Computer BIOS Interface Technical Reference 1988 13 BYTE Myers, review of Wadlow, Memory Resident Programming on the IBM PC 1988 13 BYTE Wilson, Floating-Point Survival Kit 1987 12 BYTE Zeidenberg, Modeling the Brain 1987 12 BYTE Bharath, Information Theory 1987 12 BYTE Malitz, The Turing Machine 1987 12 BYTE Wayner, Zero-Knowledge Proofs 1987 12 BYTE Jones & Hoskins, Back-Propagation: A Generalized Delta Learning Rule 1987 12 BYTE Roberts, Optimizing Compilers: How Compilers Produce Fast Code, and How They Could Be Improved 1987 12 BYTE Josin, Neural-Network Heuristics: Three Heuristic Algorithms that Learn from Experience 1987 12 BYTE Rockett & Stevenson, Karmarkar's Algorithm: A Method for Solving Large Linear Programming Problems 1987 BYTE Hoenig, (Review of Knuth's) Computers and Typesetting 1987 12 BYTE McWorter & Tazelaar, Creating Fractals 1987 12 BYTE Phipps, More on Pan-Reif (letter) 1987 12 BYTE Wittman, review of: Snyder-Palmer, In Search of the Most Amazing Thing: Children, Education, and Computers, Addison-Wesley, 1986 1987 12 BYTE Wittman, review of: Wresch, A Practical Guide to Computer Uses in the English/Language Arts Classroom, Prentice-Hall, 1986 1987 12 BYTE Bork, The Potential for Interactive Technology 1987 12 BYTE Edginton, Installing Memory-Resident Programs with C: Using C Programs to Extend DOS 1987 12 BYTE Hoenig, review of Knuth's Computers & Typesetting 1987 12 BYTE Wichmann & Hill, Building a Random-Number Generator: A Pascal Routine for Very-Long-Cycle Random-Number Sequences 1987 12 BYTE Hansen, Data Structures in a Bit-Mapped Text Editor: How Carnegie-Mellon University Displays Text on the IBM RT PC 1986 BYTE Amsterdam, Data Compression with Huffman Coding 1986 BYTE Schroeder, Plotting the Mandelbrot Set 1986 BYTE Perry, Abstract Mathematical Art 1986 BYTE Ciarcia, Build a Hardware Data Encryptor 1986 BYTE Hoare, Mathematics of Programming 1986 BYTE Phipps, The Inversion of Large Matrices; the Pan and Reif Algorithm Provides a Solution 1984 BYTE Johnson & Munro, Pascal's Design Flaws: Modula-2 Solutions and Pascal Patches 1983 BYTE Smith, Public Key Cryptography: An Introduction to a Powerful Cryptographic System for Use on Microcomputers 1996 21 CAAP Bottreau & Metivier, The Kronecker Product and Local Computations in Graphs 1996 21 CAAP Madonia & Varricchio, Iterative Pairs and Multitape Automata 1996 21 CAAP Boudet & Comon, Diophantine Equations, Presburger Arithmetic and Finite Automata 1996 21 CAAP Kuhnemann, A Pumping Lemma for Output Languages of Macro Tree Transducers 1996 21 CAAP Takayama, Extraction of Concurrent Processes from Higher Dimensional Automata 1996 21 CAAP Pfenning, The Practice of Logical Frameworks 1996 21 CAAP Bachmair & Chen & Ramakrishnan & Ramakrishnan, Subsumption Algorithms Based on Search Trees 1996 21 CAAP Tiuryn & Wand, Untyped Lambda-Calculus with Input-Output 1994 19 CAAP Comon & Treinen, Ordering Constraints on Trees 1994 19 CAAP Engelfriet, Graph Grammars and Tree Transducers 1994 19 CAAP Drewes, A Lower Bound on the Growth of Functions Computed by Tree Transductions 1994 19 CAAP Esparza, On the Decidability of Model Checking for Several mu-Calculi and Petri Nets 1994 19 CAAP Giancarlo & Mignosi, Generalizations of the Periodicity Theorem off Fine and Wilf 1994 19 CAAP Heckmann, Probabilistic Domains 1994 19 CAAP Hofbauer & Huber & Kucherov, Some Results on Top-Context-Free Tree Languages 1994 19 CAAP Khasidashvili, On Higher Order Recursive Program Schemes 1994 19 CAAP Klarlund & Schwartzbach, Graphs and Decidable Transductions Based on Edge Constraints 1994 19 CAAP Kuske, Nondeterministic Automata with Concurrency Relations and Domains 1994 19 CAAP Merlini & Sprugnoli & Verri, Algebraic and Combinatorial Properties of Simple, Coloured Walks 1994 19 CAAP Metivier & Saheb, Probabilistic Analysis of an Election Algorithm in a Tree 1994 19 CAAP Noll, On the First-Order Equivalence of Call-by-Name and Call-by-Value 1994 19 CAAP Peled, On Projective and Separable Properties 1994 19 CAAP Rambow & Satta, A Rank Hierarchy for Deterministic Tree-Walking Transducers 1994 19 CAAP Ratoandromanana & Robilliard, Superposition in Picture Languages 1992 17 CAAP Caron, Decidability of Reachability and Disjoint Union of Term Rewriting Systems 1992 17 CAAP Montanari & Rossi, Graph-Grammars as Context-dependent Rewriting Systems: A Partial Ordering Semantics 1992 17 CAAP Peng & Purushothaman, Empty Stack Pushdown omega-Tree Automata 1992 17 CAAP Potthoff, Modulo Counting Quantifiers over Finite Trees 1992 17 CAAP Seidl, Finite Tree Automata with Cost Functions 1990 15 CAAP Hirst & Harel, On the Power of Bounded Concurrency II: The Pushdown Automata Level 1990 15 CAAP Viennot, Trees Everywhere 1990 15 CAAP Bellia & Bugliesi & Occhiuto, Combinatory Forms for Equational Programming: Instances, Unification and Narrowing 1990 15 CAAP Boudol & Larsen, Graphical versus Logical Specifications 1990 15 CAAP Cai & Paige & Tarjan, More Efficient Bottom-Up Tree Pattern Matching 1990 15 CAAP Caucal, On the Regular Structure of Prefix Rewriting 1990 15 CAAP Clarke & Browne & Kurshan, A Unified Approach for Showing Language Containment and Equivalence between Various Types of omega-Automata 1990 15 CAAP Crochemore & Neraud, Unitary Monoid with Two Generators: An Algorithmic Point of View 1990 15 CAAP Curien & Ghelli, Coherence of Subsumption 1990 15 CAAP Engberg & Winksel, Petri Nets as Models of Linear Logic 1990 15 CAAP Ferrari & Montanari, Towards the Unification of Models for Concurrency 1990 15 CAAP Geniet & Schott & Thimonier, A Markovian Concurrency Measure 1990 15 CAAP Holm, Graph Matching in Operational Semantics and Typing 1990 15 CAAP Kfoury & Tiuryn & Urzyczyn, ML Typability is Dexptime-Complete 1990 15 CAAP Kounalis, Testing for Inductive (Co)-Reducibility 1990 15 CAAP Louchard & Schott, Probabilistic Analysis of Some Distributed Algorithms 1990 15 CAAP Schwartzbach, Infinite Values in Hierarchical Imperative Types 1990 15 CAAP Seidl, Equivalence of Finite-Valued Bottom-up Finite State Tree Transducers Is Decidable 1988 13 CAAP Burghardt, A Tree Pattern Matching Algorithm with Reasonable Space Requirements 1988 13 CAAP Klein & Wood, On the Maximum Path Length of AVL Trees 1988 13 CAAP Lautemann, Decomposition Trees: Structured Graph Representation and Efficient Algorithms 1988 13 CAAP Koebler & Schoening & Toran, On Counting and Approximation 1997 40 CACM Berghel, Email -- The Good, The Bad, and The Ugly 1997 40 CACM Eisenstadt, My Hairiest Bug War Stories 1997 40 CACM Ungar & Lieberman & Fry, Debugging and the Experience of Immediacy 1997 40 CACM Baecker & DiGiano & Marcus, Software Visualization for Debugging 1997 40 CACM Fry, Programming on an Already Full Brain 1997 40 CACM Felten, Webware Security 1997 40 CACM Peleg & Wilkie & Weiser, Intel MMX for Multimedia PCs 1997 40 CACM Nachenberg, Computer Virus-Antivirus Coevolution 1997 40 CACM Schneier, Cryptography, Security, and the Future 1996 39 CACM Walker & Schneider, A Revised Model Curriculum for a Liberal Arts Degree in Computer Science 1996 39 CACM Geist & Chetuparambil & Hedetniemi & Turner, Computing Research Programs in the U. S. 1996 39 CACM Culler & Karp & Patterson & Sahay & Santos & Schauser & Subramonian & von Eicken, LogP: A Practical Model of Parallel Computation 1996 39 CACM Vishkin, Can Parallel Algorithms Enhance Serial Implementation? 1996 39 CACM Tichy, Comments on ``Toolsmith II'' (letter) 1996 39 CACM Moses, Physics Envy (letter) 1996 39 CACM Prechelt, Toolsmithism and Science: Recognize Yourself (letter) 1996 39 CACM Bhimani, Securing The Commercial Internet 1996 39 CACM Borenstein, Perils and Pitfalls of Practical Cybercommerce 1996 39 CACM Panurach, Money in Electronic Commerce: Digital Cash, Electronic Fund Transfer, and Ecash 1996 39 CACM Hinden, IP Next Generation Overview 1996 39 CACM O'Reilly, Publishing Models for Internet Commerce 1996 39 CACM Kirstein & Montasser-Kohsari, The C-ODA Project: Online Access to Electronic Journals 1996 39 CACM Mannoni, Bringing Museums Online 1996 39 CACM Fagin & Naor & Winkler, Comparing Information Without Leaking It 1996 39 CACM Feigenbaum, How the ``What'' Becomes the ``How'' 1996 39 CACM Reddy, To Dream The Possible Dream 1996 39 CACM Heilbrunner, Domain of Halts (letter) 1996 39 CACM Dolev & Malki, The Transis Approach to High Availability Cluster Communication 1996 39 CACM Reiter, Distributing Trust with the Rampart Toolkit 1996 39 CACM Denning & Branstad, A Taxonomy for Key Escrow Encryption Systems 1996 39 CACM Walker & Lipner & Ellison & Balenson, Commercial Key Recovery 1996 39 CACM Maher, Crypto Backup and Key Escrow 1996 39 CACM Ganesan, The Yaksha Security System 1996 39 CACM Brooks, The Computer Scientist as Toolsmith II 1996 39 CACM Wood-Harper & Corder & Wood & Watson, How We Profess: The Ethical Systems Analyst 1996 39 CACM Ralston, The Demographics of Candidates for Faculty Positions in Computer Science 1996 39 CACM Blelloch, Programming Parallel Algorithms 1996 39 CACM Andersen, Battling Plagiarism (letter) 1996 39 CACM Requicha, Geometric Reasoning for Intelligent Manufacturing 1996 39 CACM Mantyla & Nau & Shah, Challenges in Feature-Based Manufacturing Research 1996 39 CACM Neumann & Denning, W(h)ither Research and Education? 1996 39 CACM Cheyney & Gloor & Johnson & Makedon & Matthews & Metaxas, Toward Multimedia Conference Proceedings 1995 38 CACM Dorin & Toal & Morales-Bueno, Understanding Noncomputability (letters) 1995 38 CACM Hansen, Message Parallelism (letter) 1995 38 CACM Maurer, More on the Programming Language C (letter) 1995 38 CACM Kastanas, In Friendly Disagreement (letter) 1995 38 CACM Phoha, A Question of Choice (letter) 1995 38 CACM Balasubramanian & Ma & Yoo, A Systematic Approach to Designing a WWW Application 1995 38 CACM Nanard & Nanard, Hypertext Design Environments and the Hypertext Design Process 1995 38 CACM Thuring & Hannemann & Haake, Hypermedia and Cognition: Designing for Comprehension 1995 38 CACM Kahn, Visual Cues for Local and Global Coherence in the WWW 1995 38 CACM Garzotto & Mainetti & Paolini, Hypermedia Design, Analysis, and Evaluation Issues 1995 38 CACM Morales-Bueno, Noncomputability is Easy to Understand 1995 38 CACM Snyder, Research on the Internet 1995 38 CACM Abelson & Bruce & van Dam & Harvey & Tucker & Wegner & Horwitz & Appel & Cuprak & Kay & Nevison & Schram & Stehlik & Astrachan, The First Course Conundrum (letters) 1995 38 CACM Johnson, C in the First Course Considered Harmful 1995 38 CACM Samuelson, Copyright and Digital Libraries 1995 38 CACM Fox & Akscyn & Furuta & Leggett, Digital Libraries 1995 38 CACM Rao & Pedersen & Hearst & Mackinlay & Card & Masinter & Halvorsen & Robertson, Rich Interaction in the Digital Library 1995 38 CACM French & Fox & Maly & Selman, Wide Area Technical Report Service: Technical Reports Online 1995 38 CACM Heath & Hix & Nowell & Wake & Averboch & Labow & Guyer & Brueni & France & Dalal & Fox, Envision: A User-Centered Database of Computer Science Literature 1995 38 CACM Marchionini & Maurer, The Roles of Digital Libraries In Teaching and Learning 1995 38 CACM Levy & Marshall, Going Digital: A Look at Assumptions Underlying Digital Libraries 1995 38 CACM Wiederhold, Digital Libraries, Value, and Productivity 1995 38 CACM Denning & Rous, The ACM Electronic Publishing Plan 1995 38 CACM Press, The Internet is Not TV: Web Publishing 1995 38 CACM Arensburger & Rosenfeld, To Take Arms Against a Sea of Email 1995 38 CACM Neumann, Reassessing the Crypto Debate 1995 38 CACM LaMalva & Peterson, Accredited Programs in Computing 1995 38 CACM Soloway, Beware, Techies Bearing Gifts 1995 38 CACM Klawe & Leveson, Women in Computing: Where Are We Now? 1995 38 CACM Mehlhorn & Naher, LEDA: A Platform for Combinatorial and Geometric Computing 1995 38 CACM Long & Denning, Ultra-Structure: A Design Theory for Complex Systems and Processes 1995 38 CACM Herring & Palmore, Random Number Generators are Chaotic (letter) 1994 37 CACM Bagley & Kopec, Editing Images of Text 1994 37 CACM Stevenson, Science, Computational Science, and Computer Science: At a Crossroads 1994 37 CACM Press, Commercialization of the Internet 1994 37 CACM Anderson, Why Cryptosystems Fail 1994 37 CACM Simmons, Cryptanalysis and Protocol Failures 1994 37 CACM Stearns, It's Time to Reconsider Time 1994 37 CACM Hartmanis, Turing Award Lecture: On Computational Complexity and the Nature of Computer Science 1994 37 CACM Hoffman & Ali & Heckler & Huybrechts, Cryptography Policy 1994 37 CACM Baclawski & Indurkhya, The Notion of Inheritance in Object-Oriented Programming 1994 37 CACM Berners-Lee & Cailliau & Luotonen & Nielsen & Secret, The World-Wide Web 1994 37 CACM Bowman & Danzig & Manber & Schwartz, Scalable Internet Resource Discovery: Research Problems and Approaches 1994 37 CACM Landau & Kent & Brooks & Charney & Denning & Diffie & Lauck & Miller & Neumann & Sobel, Crypto Policy Perspectives 1994 37 CACM Riecken, A Conversation with Marvin Minsky About Agents 1994 37 CACM Simons, Questions about the NII 1994 37 CACM Ariav & Goodman, Israel: Of Swords and Software Plowshares 1994 37 CACM Shieber, Lessons from a Restricted Turing Test 1994 37 CACM Loebner, In Response 1994 37 CACM Shieber, On Loebner's Lessons 1994 37 CACM LaMalva & Peterson, Accredited Programs in Computing 1994 37 CACM Neumann, Alternative Passwords 1994 37 CACM Computer Science and Telecommunications Board, Academic Careers for Experimental Computer Scientists and Engineers 1994 37 CACM Neumann, Risks of Passwords 1994 37 CACM Press, Emerging Dynabase Tools 1994 37 CACM Hayes-Roth & Jacobstein, The State of Knowledge-Based Systems 1994 37 CACM Grimson & Mundy, Computer Vision Applications 1994 37 CACM Rudnicky & Hauptmann & Lee, Survey of Current Speech Technology 1994 37 CACM Kanade & Reed & Weiss, New Technologies and Applications in Robotics 1994 37 CACM Munakata & Jani, Fuzzy Systems: An Overview 1994 37 CACM Zadeh, Fuzzy Logic, Neural Networks, and Soft Computing 1994 37 CACM Rumelhart & Widrow & Lehr, The Basic Ideas in Neural Networks 1994 37 CACM Widrow & Rumelhart & Lehr, Neural Networks: Applications in Industry, Business and Science 1994 37 CACM Goldberg, Genetic and Evolutionary Algorithms Come of Age 1994 37 CACM Salton & Allan & Buckley, Automatic Structuring and Retrieval of Large Text Files 1994 37 CACM Subramanian & Nosek, A More General Comparison of the Decision Table and Tree 1994 37 CACM Friedman & Kahn, Educating Computer Scientists: Linking the Social and the Technical 1994 37 CACM Nissenbaum, Computing and Accountability 1993 36 CACM Press, The Internet and Interactive Television 1993 36 CACM Denning, A World Lit by Flame 1993 36 CACM Barlow, A Plain Text on Crypto Policy 1993 36 CACM Weingarten, HPCC Research Questioned 1993 36 CACM Hillis & Tucker, The CM-5 Connection Machine: A Scalable Supercomputer 1993 36 CACM Mercuri, Corrupted Polling 1993 36 CACM Dekleva & Martens, First Normal Form Reconsidered 1993 36 CACM Soloway, Should We Teach Students to Program? 1993 36 CACM Hoffman, Clipping Clipper 1993 36 CACM Samuelson, Computer Programs and Copyright's Fair Use Doctrine 1993 36 CACM Press, Before the Altair: The History of Personal Computing 1993 36 CACM Meyer, Systematic Concurrent Object-oriented Programming 1993 36 CACM Karaorman & Bruno, Introducing Concurrency to a Sequential Language 1993 36 CACM Colonna, The Subjectivity of Computers 1993 36 CACM Bush, FidoNet: Technology, Tools, and History 1993 36 CACM Murray, K12 Network: Global Education Through Telecommunications 1993 36 CACM Kent, Internet Privacy Enhanced Mail 1993 36 CACM Rotenberg, Communications Privacy: Implications for Network Design 1993 36 CACM Tuerkheimer, The Underpinnings of Privacy Protection 1993 36 CACM Schwartz & Wood, Discovering Shared Interests Using Graph Analysis 1993 36 CACM Angell, Intelligence: Logical or Biological 1993 36 CACM Steele & Hillis & Stallman & Sussman & Minsky & McCarthy & Backus & Corbato & Anderson, Code of Ethics Reconsidered 1993 36 CACM Wilkes, From Fortran and Algol to Object-Oriented Languages 1993 36 CACM Denning, Designing New Principles to Sustain Research in our Universities 1993 36 CACM Marsaglia, Remarks on Choosing and Implementing Random Number Generators 1993 36 CACM Grosch, In Defense of Maurice Wilkes (letter) 1993 36 CACM Hunter, Internetworking: Coordinating Technology for Systemic Reform 1993 36 CACM Schank, Learning via Multimedia Computers 1993 36 CACM Becker, Teaching With and About Computers in Secondary Schools 1993 36 CACM Perl, ACM Task Force on K-12 Education and Technology 1993 36 CACM Lidtke & Moursund, Computers in Schools: Past, Present, and How We Can Change the Future 1993 36 CACM Task Force of the Pre-College Committee of the Education Board of the ACM, ACM Model High School Computer Science Curriculum 1993 36 CACM Billington, Using the Context-Free Pumping Lemma 1993 36 CACM Martin, The Myth of the Awesome Thinking Machine 1993 36 CACM Kling & Wegner & Rice & Weiss, Broadening Computer Science (letters) 1993 36 CACM Anderson & Johnson & Gotterbarn & Perrolle, Using the New ACM code of Ethics in Decision Making 1993 36 CACM Milner, Elements of Interaction 1993 36 CACM Frenkel, An Interview with Robin Milner 1993 36 CACM Banatre & Le Metayer, Programming by Multiset Transformation 1992 35 CACM Gersting, Intangibles for Success 1992 35 CACM Hayes & Novak & Lehnert, In Defense of Artificial Intelligence (letters) 1992 35 CACM Press, The Net: Progress and Opportunity 1992 35 CACM Denning, Educating a New Engineer 1992 35 CACM LaMalva & Reyes-Guerra, Accredited Programs in Computing 1992 35 CACM Zweben, Are We Overplanting Our Seed Corn? 1992 35 CACM Likins, A Breach of the Social Contract 1992 35 CACM Knowles & Schlafly & Schultz, Comments on Cryptography 1992 35 CACM Wilkes, The Long-Term Future of Operating Systems 1992 35 CACM Hartmanis, Computing the Future 1992 35 CACM Schonberg & Gerhardt & Hayden, A Technical Tour of Ada 1992 35 CACM Feldman, Ada Experience in the Undergraduate Curriculum 1992 35 CACM Touretzky & Lee, Visualizing Evaluation in Applicative Languages 1992 35 CACM Feldman & Shapiro, Spatial Machines: A More Realistic Approach to Parallel Computation 1992 35 CACM Baeza-Yates & Gonnet, A New Approach to Text Searching 1992 35 CACM Wu & Manber, Fast Text Searching Allowing Errors 1992 35 CACM Wilkes, Artificial Intelligence as the Year 2000 Approaches 1992 35 CACM Bell, Ultracomputers: A Teraflop Before Its Time 1992 35 CACM Pugh, A Practical Algorithm for Exact Array Dependence Analysis 1992 35 CACM Soloway, Buying Computers for *Your* School: A Guide for the Perplexed 1992 35 CACM Barlow, Decrypting the Puzzle Palace 1992 35 CACM NIST, The Digital Signature Standard, Proposed by NIST 1992 35 CACM Rivest & Hellman & Anderson & Lyons, Responses to NIST's Proposal 1992 35 CACM Vatti, A Generic Solution to Polygon Clipping 1992 35 CACM Hesselink & Jongejan & Teuhola & Wegner, Duplicate Deletion Derived (letters) 1992 35 CACM Tichy & Philippsen & Hatcher & Frankel, A Critique of the Programming Language C* (letters) 1992 35 CACM Boyd & Yu, Remarks on a Data Encryption Scheme of Yu and Yu (letters) 1992 35 CACM Ferguson, Bit-Tree: A Data Structure for Fast File Processing 1992 35 CACM Heckel, Debunking the Software Patent Myths 1992 35 CACM Anderson et al., ACM Code of Ethics and Professional Conduct 1992 35 CACM Baeza-Yates & Krogh & Ziegler & Sibbald & Sunday, Notes on a Very Fast Substring Search Algorithm 1992 35 CACM Pritchard & James, Additional Notes on a Practical Sieve Algorithm 1992 35 CACM Press, Dynabook Revisited--Portable Computers Past, Present and Future 1992 35 CACM Cohen, First Specialize Then Generalize 1992 35 CACM Robinson, Logic and Logic Programming 1992 35 CACM Grant & Minker, The Impact of Logic Programming on Databases 1992 35 CACM Linn & Clancy, The Case for Case Studies of Programming Problems 1992 35 CACM Neumann, Inside ``Risks of Risks'' 1992 35 CACM Fedanzo & Marquart, Readers Take Exception to Rejoinder (responses to Gries letter) 1992 35 CACM Stallman & Garfinkle, Against Software Patents 1992 35 CACM Rettig, Interface Design When You Don't Know How 1992 35 CACM Bunton & Borriello, Practical Dictionary Management for Hardware Data Compression 1992 35 CACM Fox & Heath & Chen & Daoud, Practical Minimal Perfect Hash Functions for Large Databases 1992 35 CACM Gries & Marsh, The 1989-90 Taulbee Survey 1991 34 CACM LaMalva & Reyes-Guerra, Accredited Programs in Computing, Followed by Year of Initial Accreditation 1991 34 CACM Peterson, More Error-Detecting Digits 1991 34 CACM Gore, Viewpoint: HPCC Policy Champion Forsees networked Nation 1991 34 CACM Lander & Langridge & Saccocio, Mapping and Interpreting Biological Information 1991 34 CACM Frenkel, The Human Genome Project and Informatics 1991 34 CACM Pancake, Software Support for Parallel Computing: Where Are We Headed? 1991 34 CACM Silverman, Massively Distributed Computed and Factoring Large Integers 1991 34 CACM Dittmer, Note on Fast Hashing of Variable Length Text Strings 1991 34 CACM Silberschatz & Stonebraker & Ullman, Database Systems: Achievements and Opportunities 1991 34 CACM Simons, Building a Research Agenda 1991 34 CACM Frailey & Turner & Zweben, Adequacy and Health of Academic-Industry Coupling 1991 34 CACM Denning, Computing, Applications, and Computational Science 1991 34 CACM Weissman, A National Debate on Encryption Exportability 1991 34 CACM Goodman, From Under the Rubble: Computing and the Resuscitation of Romania 1991 34 CACM Soloway, How The Nintendo Generation Learns 1991 34 CACM Gabriel & White & Bobrow, CLOS: Integrating Object-Oriented and Functional Programming 1991 34 CACM Sinclair & Moon, The Philosophy of Lisp 1991 34 CACM Layer & Richardson, Lisp Systems in the 1990s 1991 34 CACM Corbato, On Building Systems That Will Fail 1991 34 CACM Frenkel, An Interview with Fernando Jose Corbato 1991 34 CACM Rettig, Nobody Reads Documentation 1991 34 CACM Tucker & Barnes & Aiken & Barker & Bruce & Cain & Conry & Engel & Epstein & Lidtke & Mulder & Rogers & Spafford & Turner, Computing Curricula 1991 1991 34 CACM Denning, Short Citedness (editorial) 1991 34 CACM Wilkes, Software and the Programmer 1991 34 CACM Samuelson, Is Information Property? 1991 34 CACM Denning, The United States vs. Craig Neidorf 1991 34 CACM Parker & Levy & Spafford & Hawthorn & Rotenberg & BloomBecker & Stallman & Denning, Colleagues Debate Denning's Comments 1991 34 CACM Gries, Teaching Calculation and Discrimination: A More Effective Curriculum 1991 34 CACM Nussbaum & Agarwal, Scalability of Parallel Machines 1991 34 CACM Teuhola & Wegner, Minimal Space, Average Linear Time Duplicate Deletion 1991 34 CACM Blostein & Haken, Justification of Printed Music 1991 34 CACM Steinberg, A Student's View of Cryptography in Computer Science 1991 34 CACM Soloway, Quick, Where do the Computers Go? 1991 34 CACM Yu & Yu, Superimposing Encrypted Data 1991 34 CACM Cristian, Understanding Fault-Tolerant Distributed Systems 1991 34 CACM Richard, On Gerasch's Insertion Algorithm 1991 34 CACM Jarvenpaa & Ives & Davis, Supply/Demand of IS Doctorates in the 1990s 1991 34 CACM Eerkes, Profiling Computer Science Master's Programs 1991 34 CACM Lamport, The Mutual Exclusion Problem has been Solved (letter) 1990 33 CACM Press, Windows, DOS, and the Mac 1990 33 CACM Knight, Connectionist Ideas and Algorithms 1990 33 CACM L'Ecuyer, Random Numbers for Simulation 1990 33 CACM White, Reflections on Snowbird 1990 33 CACM Korson & McGregor, Understanding Object-Oriented: A Unifying Paradigm 1990 33 CACM Jordon, Implementation Benefits of C++ Language Mechanisms 1990 33 CACM Wirfs-Brock & Johnson, Surveying Current Research in Object-Oriented Design 1990 33 CACM Gries & Marsh, The 1988-89 Taulbee Survey Report 1990 33 CACM Valiant, A Bridging Model for Parallel Computation 1990 33 CACM Sunday, A Very Fast Substring Search Algorithm 1990 33 CACM Gladney & Rinehart & Wagner & Thornley & Coven, More on the Cruelty (letters) 1990 33 CACM Parnas & van Schouwen & Kwan, Evaluation of Safety-Critical Software 1990 33 CACM Pugh, Skip Lists: A Probabilistic Alternative to Balanced Trees 1990 33 CACM Pearson, Fast Hashing of Variable-Length Text Strings 1990 33 CACM Kumar, Concurrent Operations on Extendible Hashing and its Performance 1990 33 CACM Oman & Cook, Typographic Style is More than Cosmetic 1990 33 CACM Lehman, Uncertainty in Computer Application 1990 33 CACM Wielgus & Watkins & Sacharuk & Damerla, letters on Dijkstra, A Debate on Teaching Computing Science 1990 33 CACM Hirschberg & Lelewer, Efficient Decoding of Prefix Codes 1990 33 CACM Bernstein & Stern & Ehrich & Dunlavey & Zettel & Herbert & Nelson & Smyth & Walker & Gordon & Cole & Lightstone, letters on Dijkstra, On the Cruelty of Teaching Computing Science 1990 33 CACM Nielsen, The Art of Navigating through Hypertext 1990 33 CACM Dhar & Ranganathan, Integer Programming vs. Expert Systems: An Experimental Comparison 1990 33 CACM Arefi & Hughes & Workman, Automatically Generating Visual Syntax-Directed Editors 1990 33 CACM Van Wyk, Literate Programming: An Assessment 1990 33 CACM McKinley & Liu, Multicast Tree Construction in Bus-Based Networks 1990 33 CACM Padmanabhan, Cube Structures For Multiprocessors 1990 33 CACM Carta, Two Fast Implementations of the ``Minimal Standard'' Random Number Generator 1989 32 CACM McCarthy, Networks Considered Harmful For Electronic Mail 1989 32 CACM Dijkstra, On the Cruelty of Really Teaching Computing Science 1989 32 CACM Parnas & Scherlis & van Emden & Cohen & Hamming & Karp & Winograd & Dijkstra, A Debate on Teaching Computing Science 1989 32 CACM Libes, Choosing a Name for Your Computer 1989 32 CACM Grudin, The Case Against User Interface Consistency 1989 32 CACM Zhu & Takaoka, A Technique for Two-Dimensional Pattern Matching 1989 32 CACM Edgeman & Abrahams & Sand & Crawford & Park & Miller, Random Number Generators and the Minimal Standard 1989 32 CACM Spafford, The Internet Worm: Crisis and Aftermath 1989 32 CACM Rochlis & Eichin, With Microscope and Tweezers: The Wrom from MIT's Perspective 1989 32 CACM Seeley, Password Cracking: A Game of Wits 1989 32 CACM Eisenberg & Gries & Hartmanis & Holcomb & Lynn & Santoro, The Cornell Commission: On Morris and the Worm 1989 32 CACM Frenkel, An Interview with Ivan Sutherland 1989 32 CACM Sutherland, Micropipelines 1989 32 CACM Van Wyk & Lindsay & Thimbleby, Literate Programming: A File Difference Program 1989 32 CACM Abelson & Eisenberg & Halfant & Katzenelson & Sacks & Sussman & Wisdom & Yip, Intelligence in Scientific Computing 1989 32 CACM Samuelson, Why The Look And Feel Of Software User Interfaces Should Not Be Protected by Copyright Law 1989 32 CACM Dobson & Randell, Program Verification: Public Image And Private Reality 1989 32 CACM Denning & Frenkel, A Conversation with Steve Jobs 1989 32 CACM Fiala & Greene, Data Compression with Finite Windows 1989 32 CACM Muller & Holt & Watters & Fetzer, More on the Very Idea (letters) 1989 32 CACM Gries & Walker & Young, The 1988 Snowbird Report: A Discipline Matures 1989 32 CACM Luo, A Practical Sieve Algorithm for Finding Prime Numbers 1989 32 CACM Pleasant & Paulson & Bevier & Smith & Young & Clune & Savitzky & Fetzer, correspondence on Fetzer, Program Verification: The Very Idea 1989 32 CACM Denning & Comer & Gries & Mulder & Tucker & Turner & Young, Computing As A Discipline 1989 32 CACM Lamport, A Simple Approach to Specifying Concurrent Systems 1989 32 CACM Abrahamson, An Adaptive Dependency Source Model for Data Compression 1989 32 CACM Ronen & Palley & Lucas, Spreadsheet Analysis and Design 1989 32 CACM Wagner & Putter, Error Detecting Decimal Digits 1989 32 CACM Jones, Concurrent Operations on Priority Queues 1988 31 CACM Holt & Cordy, The Turing Programming Language 1988 31 CACM Mitra & Tamiz & Yadegar, Experimental Investigation of an Interior Search Method Within a Simplex Framework 1988 31 CACM Colner, Expanding Generalized Regular Expressions 1988 31 CACM Manber, Using Induction to Design Algorithms 1988 31 CACM Itai & Raz, The Number of Buffers Required for Sequential Processing of a Disk File 1988 31 CACM Driscoll & Gabow & Shrairman & Tarjan, Relaxed Heaps: An Alternative to Fibonacci Heaps With Applications to Parallel Computation 1988 31 CACM Park & Miller, Random Number Generators: Good Ones are Hard to Find 1988 31 CACM Gordon, Probabilistic and Genetic Algorithms in Document Retrieval 1988 31 CACM Brown, Calendar Queues: A Fast O(1) Priority Queue Implementation for the Simulation Event Set Problem 1988 31 CACM Rubinstein & Shallit & Szegedy, A Subset Coloring Algorithm and Its Applications to Computer Graphics 1988 31 CACM Fetzer, Program Verification: The Very Idea 1988 31 CACM Haas, Reading and Writing with Computers: A Framework for Explaining Differences in Performance 1988 31 CACM Aggarwal & Vitter, The Input/Output Complexity of Sorting and Related Problems 1988 31 CACM Courts, Improving Locality of Reference in a Garbage-Collecting Memory Management System 1988 31 CACM Hamaker & Witten & Neal, Compress and Compact Discussed Further (letters) 1988 31 CACM Jones, Application of Splay Trees to Data Compression 1988 31 CACM Sarwate, Computation of Cyclic Redundancy Checks via Table Look-Up 1988 31 CACM Smith & Weiss, An Overview of Hypertext 1988 31 CACM van Dam, Hypertext '87: Keynote Address 1988 31 CACM Poirot & Taylor & Norris, Retraining Teachers to Teach High School Computer Science 1988 31 CACM Mel & Omohundro & Robison & Skiena & Thearling & Young & Wolfram, TABLET: Personal Computer of the Year 2000 1988 31 CACM Callahan & Hoffman & Hoffman, Computer Graphics Tools for the Study of Minimal Surfaces 1988 31 CACM L'Ecuyer, Efficient and Portable Combined Random Number Generators 1988 31 CACM Harel, On Visual Formalisms 1988 31 CACM Gerasch, An Insertion Algorithm for a Minimal Internal Path Length Binary Search Tree 1988 31 CACM Cherniak, Undebuggability and Cognitive Science 1988 31 CACM Larson, Dynamic Hash Tables 1988 31 CACM Cocke, The Search for Performance in Scientific Processors: Turing Award Lecture 1988 31 CACM Pickover, Pattern Formation and Chaos in Networks 1988 31 CACM Feldman & Fanty & Goddard & Lynne, Computing with Structured Connectionist Networks 1988 31 CACM Salton & Buckley, Parallel Text Search Methods 1987 30 CACM McCarthy, Generality in Artificial Intelligence 1987 30 CACM Hester & Hirschberg, Self-Organizing Search Lists Using Probabilistic Back-Pointers 1987 30 CACM Coombs & Renear & DeRose, Markup Systems and the Future of Scholarly Text Processing 1987 30 CACM Frenkel, Donald E. Knuth: Scholar with a Passion for the Particular 1987 30 CACM Frenkel, Brian K. Reid: A Graphics Tale of a Hacker Tracker 1987 30 CACM Bentley, Programming Pearls: A Sample of Brilliance 1987 30 CACM Ahituv & Lapid & Neumann, Processing Encrypted Data 1987 30 CACM Ryabko, A Locally Adaptive Data Compression Scheme (letter) 1987 30 CACM Horspool, A Locally Adaptive Data Compression Scheme (letter) 1987 30 CACM Abbott, Knowledge Abstraction 1987 30 CACM Hoare & Hayes & He Jifeng & Morgan & Roscoe & Sanders & Sorensen & Spivey & Sufrin, Laws of Programming 1987 30 CACM Gries, The 1985-1986 Taulbee Survey 1987 30 CACM Becker, Arabic Word Processing 1987 30 CACM Ebert, A Versatile Data Structure for Edge-Oriented Graph Algorithms 1987 30 CACM Witten & Neal & Cleary, Arithmetic Coding for Data Compression 1987 30 CACM Berztiss, A Mathematically Focused Curriculum for Computer Science 1987 30 CACM Van Dyke, Taking ``Computer Literacy'' Literally 1987 30 CACM Booth & Miller, Computer Science Program Accreditation: The First-Year Activities of the Computing Sciences Accreditation Board 1987 30 CACM Bentley, Programming Pearls: Abstract Data Types 1987 30 CACM Hopcroft, Computer Science: The Emergence of a Discipline 1987 30 CACM Tarjan, Algorithm Design 1987 30 CACM Frenkel, An Interview with the 1986 A. M. Turing Award Recipients--John E. Hopcroft and Robert E. Tarjan 1987 30 CACM Stasko & Vitter, Pairing Heaps: Experiments and Analysis 1987 30 CACM Shih & Chen & Lee, Systolic Algorithms to Examine All Pairs of Elements 1987 30 CACM McCracken, Viewpoint: Ruminations on Computer Science Curricula 1987 30 CACM Hillis & Steele, Update to ``Data Parallel Algorithms'' 1986 29 CACM Hillis & Steele, Data Parallel Algorithms 1986 29 CACM Padua & Wolfe, Advanced Compiler Optimizations for Supercomputers 1986 29 CACM Rettberg & Thomas, Contention Is No Obstacle to Shared-Memory Multiprocessing 1986 29 CACM Stanfill & Waltz, Toward Memory-Based Reasoning 1986 29 CACM Stanfill & Kahle, Parallel Free-Text Search on the Connection Machine System 1986 29 CACM Quarterman & Hoskins, Notable Computer Networks 1986 29 CACM Atkinson & Sack & Santoro & Strothotte, Min-Max Heaps and Generalized Priority Queues 1986 29 CACM Bentley, Programming Pearls: Document Design 1986 29 CACM Soloway, Learning to Program = Learning to Construct Mechanisms and Explanations 1986 29 CACM diSessa & Abelson, Boxer: A Reconstructible Computational Medium 1986 29 CACM Gries & Miller & Ritchie & Young, Imbalance between Growth and Funding in Academic Computer Science: Two Trends Colliding 1986 29 CACM Stout & Warren, Tree Rebalancing in Optimal Time and Space 1986 29 CACM Bentley & Sleator & Tarjan & Wei, A Locally Adaptive Data Compression Scheme 1986 29 CACM Gibbs & Tucker, A Model Curriculum for a Liberal Arts Degree in Computer Science 1986 29 CACM Golden & Pechura, The Structure of Microcomputer File Systems 1986 29 CACM Hopcroft, The Impact of Robotics on Computer Science 1986 29 CACM Sammet, Why Ada Is Not Just Another Programming Language 1986 29 CACM Sarnak & Tarjan, Planar Point Location Using Persistent Search Trees 1986 29 CACM Karp, Combinatorics, Complexity, and Randomness 1986 29 CACM Frenkel, Complexity and Parallel Processing: An Interview with Richard M. Karp 1985 28 CACM Colmerauer, Prolog in 10 Figures 1985 28 CACM Friedland & Kedes, Discovering the Secrets of DNA 1985 28 CACM Samet, Data Structures for Quadtree Approximation and Compression 1985 28 CACM Koffman & Stemple & Wardle, Recommended Curriculum for CS2, 1984: A Report of the ACM Curriculum Task Force for CS2 1985 28 CACM O'Leary & Stewart, Data-Flow Algorithms for Parallel Matrix Computations 1985 28 CACM Larmore & Hirschberg, Efficient Optimal Pagination of Scrolls 1985 28 CACM McIntyre & Pechura, Data Compression Using Static Huffman Code-Decode Tables 1985 28 CACM Even & Goldreich & Lempel, A Randomized Protocol for Signing Contracts 1985 28 CACM Conrad, On Design Principles for a Molecular Computer 1985 28 CACM Sager, A Polynomial Time Generator for Minimal Perfect Hash Functions 1985 28 CACM Wolfram, Symbolic Mathematical Computation 1985 28 CACM Wainwright, A Class of Sorting Algorithms Based on Quicksort 1985 28 CACM Bentley & McGeoch, Amortized Analyses of Self-Organizing Sequential Search Heuristics 1985 28 CACM Kubale & Jackowski, A Generalized Implicit Enumeration Algorithm for Graph Coloring 1985 28 CACM Task Force on Curriculum, Computer Science for Secondary Schools: Course Content 1985 28 CACM Witten & Bramwell, A System for Interactive Viewing of Structured Documents 1985 28 CACM Blair & Maron, An Evaluation of Retrieval Effectiveness for a Full-Text Document-Retrieval System 1985 28 CACM Wirth, From Programming Language Design to Computer Construction 1985 28 CACM Sleator & Tarjan, Amortized Efficiency of List Update and Paging Rules 1985 28 CACM Patterson, Reduced Instruction Set Computers 1985 28 CACM Seitz, The Cosmic Cube 1985 28 CACM Merritt, An Inverted Taxonomy of Sorting Algorithms 1984 27 CACM Litke, An Improved Solution to the Traveling Salesman Problem with Thousands of Nodes 1984 27 CACM Valiant, A Theory of the Learnable 1984 27 CACM Ralston, The First Course in Computer Science Needs a Mathematical Corequisite 1984 27 CACM Maude & Maude, Hardware Protection Against Software Piracy 1984 27 CACM Ritchie, Reflections on Software Research 1984 27 CACM Thompson, Reflections on Trusting Trust 1984 27 CACM Van Dam, Computer Graphics Comes of Age: An Interview with Andries Van Dam 1984 27 CACM Chang & Iyengar, Efficient Algorithms to Globally Balance a Binary Search Tree 1984 27 CACM Vitter, Faster Methods for Random Sampling 1984 27 CACM Knuth, Corrigendum: The Complexity of Songs 1984 27 CACM Sammet, Special Report: Progress Report on the ACM Guide to Computing Literature 1984 27 CACM Knuth, The Complexity of Songs 1984 27 CACM Chang, The Study of an Ordered Minimal Perfect Hashing Scheme 1984 27 CACM Denning, Digital Signatures with RSA and Other Public-Key Cryptosystems 1984 27 CACM Rivest & Shamir, How to Expose an Eavesdropper 1984 27 CACM Pritchard, Some Negative Results Concerning Prime Number Generators 1984 27 CACM Koffman & Miller & Wardle, Recommended Curriculum for CS1, 1984 1983 26 CACM Yau, Meeting the Crisis in Computer Science 1983 26 CACM Gonnet, Balancing Binary Trees by Internal Path Reduction 1983 26 CACM Comer, A Computer Science Research Network CSNET: A History and Status Report 1983 26 CACM Loui, Optimal Paths in Graphs with Stochastic or Multidimensional Weights 1983 26 CACM Parnas, A Generalized Control Structure and Its Formal Definition 1983 26 CACM National Commission on Excellence in Education, A Nation at Risk: The Imperative for Educational Reform 1983 26 CACM Cook, An Overview of Computational Complexity 1983 26 CACM Konvalina & Wileman & Stephens, Math Proficiency: A Key to Success for Computer Science Students 1983 26 CACM Motzkin, Pracnique: MEANSORT 1983 26 CACM Dijkstra, Solution of a Problem in Concurrent Programming Control 1983 26 CACM Maurer, An Improved Hash Code for Scatter Storage 1983 26 CACM Morris, Scatter Storage Techniques 1983 26 CACM Dijkstra, The Structure of ``THE''-Multiprogramming System 1983 26 CACM Hoare, An Axiomatic Basis for Computer Programming 1983 26 CACM Earley, An Efficient Context-Free Parsing Algorithm 1983 26 CACM Bell, The Quadratic Quotient Method: A Hash Code Eliminating Secondary Clustering 1983 26 CACM Codd, A Relational Model of Data for Large Shared Data Banks 1983 26 CACM Wirth, Program Development by Stepwise Refinement 1983 26 CACM Ritchie & Thompson, The UNIX Time-Sharing System 1983 26 CACM Rivest & Shamir & Adleman, A Method for Obtaining Digital Signatures and Public-Key Cryptosystems 1983 26 CACM Hoare, Communicating Sequential Processes 1982 25 CACM Vitter, Implementations for Coalesced Hashing 1982 25 CACM O'Donnell, A Critique of the Foundations of Hoare-Style Programming Logic 1982 25 CACM Mor & Fraenkel, Technical Note: A Hash Code Method for Detecting and Correcting Spelling Errors 1982 25 CACM Lageweg & Lenstra & Lawler & Kan, Computer-Aided Complexity Classification of Combinatorial Problems 1982 25 CACM Chandy & Misra, Distributed Computation for Graphs: Shortest Path Algorithms 1982 25 CACM Nievergelt & Preparata, Plane-Sweep Algorithms for Intersecting Geometric Figures 1982 25 CACM Lee & Requicha, Algorithms for Computing the Volume and Other Integral Properties of Solids, I: Known Methods and Open Issues 1982 25 CACM Lee & Requicha, Algorithms for Computing the Volume and Other Integral Properties of Solids, II: A Family of Algorithms Based on Representation Conversion and Cellular Approximation 1982 25 CACM Chin & Lam & Chen, Efficient Parallel Algorithms for Some Graph Problems 1982 25 CACM Martin, An Efficient Garbage Compaction Algorithm 1982 25 CACM Franklin, Technical Note: On an Improved Algorithm for Decentralized Extrema Finding in Circular Configurations of Processors 1982 25 CACM Gifford, Cryptographic Sealing for Information Secrecy and Authentication 1982 25 CACM Welsch, Using Electronic Mail as a Teaching Tool 1982 25 CACM Bentley & Faust & Preparata, Technical Note: Approximation Algorithms for Convex Hulls 1981 24 CACM Jaeschke, Reciprocal Hashing: A Method for Generating Minimal Perfect Hashing Functions 1981 24 CACM Lamport, Technical Note: Password Authentication with Insecure Communication 1981 24 CACM Pritchard, Corrigendum: A Sublinear Additive Sieve for Finding Prime Numbers 1981 24 CACM Booth, Technical Note: Authentication of Signatures Using Public Key Encryption 1981 24 CACM Ricart & Agrawala, Corrigendum: An Optimal Algorithm for Mutual Exclusion in Computer Networks 1981 24 CACM McEliece & Sarwate, Technical Note: On Sharing Secrets and Reed-Solomon Codes 1981 24 CACM Gischer, Shuffle Languages, Petri Nets, and Context-Sensitive Grammars 1981 24 CACM Denning & Sacco, Technical Note: Timestamps in Key Distribution Protocols 1981 24 CACM American Council on Education, Report of the Public Cryptography Study Group 1981 24 CACM Merkle & Hellman, Technical Note: On the Security of Multiple Encryption 1981 24 CACM Traub, Quo Vadimus: Computer Science in a Decade 1981 24 CACM Denning, A Discipline in Crisis 1981 24 CACM Preparata & Vuillemin, The Cube-Connected Cycles: A Versatile Network for Parallel Computation 1981 24 CACM Magel & Austing & Berztiss & Engel & Hamblen & Hoffmann & Mathis, Recommendations for Master's Level Programs in Computer Science--A Report of the ACM Curriculum Committee on Computer Science 1981 24 CACM Andrews, Parallel Programs: Proofs, Principles and Practice 1981 24 CACM Rosenberg, Technical Note: On Uniformly Inserting One Data Structure into Another 1981 24 CACM Ricart & Agrawala, An Optimal Algorithm for Mutual Exclusion in Computer Networks 1981 24 CACM Pritchard, A Sublinear Additive for Finding Prime Numbers 1980 23 CACM Peterson, Computer Programs for Detecting and Correcting Spelling Errors 1980 23 CACM Cook & Jin Kim, Best Sorting Algorithm for Nearly Sorted Lists 1980 23 CACM Hirschberg & Sinclair, Technical Note: Decentralized Extrema-Finding in Circular Configurations of Processors 1980 23 CACM Steele & Sussman, Design of a LISP-Based Microprocessor 1980 23 CACM Iverson, Notation as a Tool of Thought 1980 23 CACM Harel, On Folk Theorems 1980 23 CACM Fletcher, A More General Algorithm for Computing Closed Semiring Costs Between Vertices of a Directed Graph 1980 23 CACM Gill, Hierarchical Binary Search 1980 23 CACM Bentley, Multidimensional Divide-and-Conquer 1980 23 CACM Vuillemin, A Unifying Look at Data Structures 1980 23 CACM Lee, A Linear Algorithm for Copying Binary Trees Using Bounded Workspace 1980 23 CACM Walker & Kemmerer & Popek, Specification and Verification of the UCLA Unix Security Kernel 1980 23 CACM Cichelli, Minimal Perfect Hash Functions Made Simple 1980 23 CACM Abelson & Andreae, Information Transfer and Area-Time Tradeoffs for VLSI Multiplication 1979 22 CACM Peleg & Rosenfeld, Breaking Substitution Ciphers Using a Relaxation Algorithm 1979 22 CACM Tarjan & Yao, Storing a Sparse Table 1979 22 CACM Shamir, How to Share a Secret 1979 22 CACM Anderson & Anderson, Corrigendum: Comments on Perfect Hashing Functions: A Single Probe Retrieving Method for Static Sets 1979 22 CACM Lamport, On the Proof of Correctness of a Calendar Program 1979 22 CACM Lozano-Perez & Wesley, An Algorithm for Planning Collision-Free Paths Among Polyhedral Obstacles 1979 22 CACM Feldman & Sutherland, Rejuvenating Experimental Computer Science--A Report to the National Science Foundation and Others 1979 22 CACM McCracken & Denning & Brandin, Addendum: An ACM Executive Committee Position on the Crisis in Experimental Computer Science 1979 22 CACM Galil, On Improving the Worst Case Running Time of the Boyer-Moore String Matching Algorithm 1979 22 CACM Raiha & Zweben, An Optimal Insertion Algorithm for One-Sided Height-Balanced Binary Search Trees 1979 22 CACM Floyd, The Paradigms of Programming 1979 22 CACM Hirschberg & Chandra & Sarwate, Computing Connected Components on Parallel Computers 1979 22 CACM Dershowitz & Manna, Proving Termination with Multiset Orderings 1979 22 CACM Denning, Secure Personal Computing in an Insecure Network 1979 22 CACM Winograd, Beyond Programming Languages 1979 22 CACM Preparata, An Optimal Real-Time Algorithm for Planar Convex Hulls 1979 22 CACM Fischer & Probert, Storage Reorganization Techniques for Matrix Computation in a Paging Environment 1979 22 CACM Sedgewick, Corrigendum: Implementing Quicksort Programs 1979 22 CACM DeMillo & Lipton & Perlis, Social Processes and Proofs of Theorems and Programs 1979 22 CACM Chang & Roberts, An Improved Algorithm for Decentralized Extrema-Finding in Circular Configurations of Processes 1979 22 CACM Reynolds, Reasoning About Arrays 1979 22 CACM Austing & Barnes & Bonnette & Engel & Stokes, Curriculum '78: Recommendations for the Undergraduate Program in Computer Science--A Report of the ACM Curriculum Committee on Computer Science 1979 22 CACM McMaster, Corrigendum: An Analysis of Algorithms for the Dutch National Flag Problem 1979 22 CACM Anderson & Anderson, Comments on Perfect Hashing Functions: A Single Probe Retrieving Method for Static Sets 1978 21 CACM Needham & Schroeder, Using Encryption for Authentication in Large Networks of Computers 1978 21 CACM Gries & Misra, A Linear Sieve Algorithm for Finding Prime Numbers 1978 21 CACM Friedman & Wise, A Note on Conditional Expressions 1978 21 CACM Brinch Hansen, Distributed Processes: A Concurrent Programming Concept 1978 21 CACM Hoare, Corrigendum: Communicating Sequential Processes 1978 21 CACM Dijkstra & Lamport & Martin & Scholten & Steffens, On-the-Fly Garbage Collection: An Exercise in Cooperation 1978 21 CACM Schneiderman, Jump Searching: A Fast Sequential Search Technique 1978 21 CACM Morris, Counting Large Numbers of Events in Small Registers 1978 21 CACM McMaster, An Analysis of Algorithms for the Dutch National Flag Problem 1978 21 CACM Sedgewick, Implementing Quicksort Programs 1978 21 CACM Ottmann & Six & Wood, Right Brother Trees 1978 21 CACM Backus, Can Programming Be Liberated from the von Neumann Style? A Functional Style and Its Algebra of Programs 1978 21 CACM Hirschberg, Fast Parallel Sorting Algorithms 1978 21 CACM Morris, A Time- and Space-Efficient Garbage Compaction Algorithm 1978 21 CACM Hoare, Communicating Sequential Processes 1978 21 CACM Chin, An O(n) Algorithm for Determining a Near-Optimal Computation Order of Matrix Chain Products 1978 21 CACM Perl & Itai & Avni, Interpolation Search--A Log Log N Search 1978 21 CACM Halatsis & Philokyprou, Pseudochaining in Hash Tables 1978 21 CACM Lamport, Time, Clocks, and the Ordering of Events in a Distributed System 1978 21 CACM Shostak, An Algorithm for Reasoning About Equality 1978 21 CACM Zweben & McDonald, An Optimal Method for Deletions in One-Sided Height-Balanced Trees 1978 21 CACM Driscoll & Lien, A Selective Traversal Algorithm for Binary Search Trees 1978 21 CACM Clark, A Fast Algorithm for Copying List Structures 1978 21 CACM Payne & McMillen, Orderly Enumeration of Nonsingular Binary Matrices Applied to Text Encryption 1978 21 CACM Heckel, A Technique for Isolating Differences Between Files 1978 21 CACM Baker, List Processing in Real Time on a Serial Computer 1978 21 CACM Merkle, Secure Communications Over Insecure Channels 1978 21 CACM Szymanski, Assembling Code for machines with Span-Dependent Instructions 1978 21 CACM Vuillemin, A Data Structure for Manipulating Priority Queues 1978 21 CACM Even & Rodeh, Economical Encoding of Commas Between Strings 1978 21 CACM Kosaraju, Insertions and Deletions in One-Sided Height-Balanced Trees 1978 21 CACM DeMillo & Eisenstat & Lipton, Preserving Proximity in Arrays 1978 21 CACM Rabin, Corrigendum: Complexity of Computations 1978 21 CACM Rivest & Shamir & Adleman, A Method for Obtaining Digital Signatures and Public-Key Cryptosystems 1978 21 CACM Auslander & Strong, Systematic Recursion Removal 1978 21 CACM Manna & Waldinger, Is ``Sometime'' Sometimes Better than ``Always''? 1977 20 CACM Gries, An Exercise in Proving Parallel Programs Correct 1977 20 CACM Manna & Shamir, The Optimal Approach to Recursive Programs 1977 20 CACM Sprugnoli, Perfect Hashing Functions: A Single Probe Retrieving Method for Static Sets 1977 20 CACM Bird, Improving Programs by the Introduction of Recursion 1977 20 CACM Boyer & Moore, A Fast String Searching Algorithm 1977 20 CACM Rabin, Complexity of Computations 1977 20 CACM Scott, Logic and Programming Languages 1977 20 CACM Mairson, Some New Upper Bounds on the Generation of Prime Numbers 1977 20 CACM Wirth, Toward a Discipline of Real-Time Programming 1977 20 CACM Lawler, Comment on Computing the k Shortest Paths in a Graph 1977 20 CACM Robson, A Bounded Storage Algorithm for Copying Cyclic Structures 1977 20 CACM Bird, Notes on Recursion Elimination 1977 20 CACM Baer & Schwab, A Comparison of Tree-Balancing Algorithms 1977 20 CACM Hunt & Szymanski, A Fast Algorithm for Computing Longest Common Subsequences 1977 20 CACM Thompson & Kung, Sorting on a Mesh-Connected Parallel Computer 1977 20 CACM Hunt & Szymanski & Ullman, Operations on Sparse Relations 1977 20 CACM Preparata & Hong, Convex Hulls of Finite Sets of Points in Two and Three Dimensions 1977 20 CACM Knott, A Numbering System for Binary Trees 1977 20 CACM Austing & Barnes & Engel, A Survey of the Literature in Computer Science Education Since Curriculum '68 1976 19 CACM Arden, The Computer Science and Engineering Research Study (COSERS) 1976 19 CACM Rubin, Experiments in Text File Compression 1976 19 CACM Wadler, Analysis of an Algorithm for Real Time Garbage Collection 1976 19 CACM Yap, New Upper bounds for Selection 1976 19 CACM Loui, Weighted Derivation Trees 1976 19 CACM Bitner & Erlich & Reingold, Efficient Generation of the Binary Reflected Gray Code and Its Applications 1976 19 CACM Deutsch & Bobrow, An Efficient, Incremental, Automatic Garbage Collector 1976 19 CACM Wegbreit, Faster Retrieval from Context Trees 1976 19 CACM Donovan, Tools and Philosophy for Software Education 1976 19 CACM Tennent, The Denotational Semantics of Programming Languages 1976 19 CACM Harrison & Ruzzo, Protection in Operating Systems 1976 19 CACM Hirschberg, An Insertion Technique for One-Sided Height-Balanced Trees 1976 19 CACM Metcalfe & Boggs, Ethernet: Distributed Packet Switching for Local Computer Networks 1976 19 CACM Clark, An Efficient List-Moving Algorithm Using Constant Workspace 1976 19 CACM Steele, Corrigendum: Multiprocessing Compactifying Garbage Collection 1976 19 CACM Knott, A Numbering System for Permutations of Combinations 1976 19 CACM Owicki & Gries, Verifying Properties of Parallel Programs: An Axiomatic Approach 1976 19 CACM Fagin, Corrigendum: A Counterintuitive Example of Computer Paging 1976 19 CACM Katz & Manna, Logical Analysis of Programs 1976 19 CACM Newell & Simon, Computer Science as Empirical Inquiry: Symbols and Search 1976 19 CACM Rivest, On Self-Organizing Sequential Search Heuristics 1976 19 CACM Fagin, A Counterintuitive Example of Computer Paging 1976 19 CACM Artzy & Hinds & Saal, A Fast Division Technique for Constant Divisors 1975 18 CACM Naur, Programming Languages, Natural Languages, and Mathematics 1975 18 CACM Jazayeri & Ogden & Rounds, The Intrinsically Exponential Complexity of the Circularity Problem for Attribute Grammars 1975 18 CACM Hunt & Szymanski & Ullman, On the Complexity of LR(k) Testing 1975 18 CACM Graham & Wegman, A Fast and Usually Linear Algorithm for Global Flow Analysis (Abstract Only) 1975 18 CACM Lipton, Reduction: A Method of Proving Properties of Parallel Programs 1975 18 CACM Schwartz, Automatic Data Structure Choice in a Language of Very High Level 1975 18 CACM Bitner & Reingold, Backtrack Programming Techniques 1975 18 CACM Kou & Wong, A Note on the Set Basis Problem Related to the Compaction of Character Sets 1975 18 CACM Gavril, Merging with Parallel Processors 1975 18 CACM Steele, Multiprocessing Compactifying Garbage Collection 1975 18 CACM Bentley, Multidimensional Binary Search Trees Used for Associative Searching 1975 18 CACM Aho & Johnson & Ullman, Deterministic Parsing of Ambiguous Grammars 1975 18 CACM Dijkstra, Guarded Commands, Nondeterminacy and Formal Derivation of Programs 1975 18 CACM Lamport, Multiple byte Processing with Full-Word Instructions 1975 18 CACM Freeman & Shapira, Determining the Minimum-Area Encasing Rectangle for an Arbitrary Closed Curve 1975 18 CACM Bobrow, A Note on Hash Linking 1975 18 CACM Dewar, Indirect Threaded Code 1975 18 CACM Aho & Corasick, Efficient String Matching: An Aid to Bibliographic Search 1975 18 CACM Hirschberg, A Linear Space Algorithm for Computing Maximal Common Subsequences 1975 18 CACM Soule, Addition in an Arbitrary Base Without Radix Conversion 1975 18 CACM Harper & Payne & Savage & Straus, Sorting X + Y 1975 18 CACM Fisher, Copying Cyclic List Structures in Linear Time Using Bounded Workspace 1975 18 CACM Fox, More on kth Shortest Paths 1975 18 CACM Mills, Corrigendum: The New Math of Computer Programming 1975 18 CACM Warren, A Modification of Warshall's Algorithm for the Transitive Closure of Binary Relations 1975 18 CACM Kernighan & Cherry, A System for Typesetting Mathematics 1975 18 CACM Floyd & Rivest, Expected Time Bounds for Selection 1975 18 CACM Floyd & Rivest, Algorithm 489: The Algorithm SELECT--for Finding the ith Smallest of n Elements 1975 18 CACM Parnas, On a Solution to the Cigarette Smoker's Problem (Without Conditional Statements) 1975 18 CACM Mills, The New Math of Computer Programming 1974 17 CACM Knuth, Computer Programming as an Art 1974 17 CACM Dijkstra, Self-stabilizing Systems in Spite of Distributed Control 1974 17 CACM Hoare, Monitors: An Operating System Structuring Concept 1974 17 CACM Shen & Peterson, A Weighted Buddy Method for Dynamic Storage Allocation 1974 17 CACM Schkolnick, The Equivalence of Reducing Transition Languages and Deterministic Languages 1974 17 CACM Hahn, A New Technique for Compression and Storage of Data 1974 17 CACM Evans & Kantrowitz & Weiss, A User Authentication Scheme Not Requiring Secrecy in the Computer 1974 17 CACM Purdy, A High Security Log-in Procedure 1974 17 CACM Lamport, A New Solution of Dijkstra's Concurrent Programming Problem 1974 17 CACM Ritchie & Thompson, The UNIX Time-Sharing System 1974 17 CACM Bruno & Coffman & Sethi, Scheduling Independent Tasks To Reduce Mean Finishing Time 1974 17 CACM Barton & Creasey & Lynch & Snell, An Information-Theoretic Approach to Text Searching in Direct Access Systems 1974 17 CACM Wagner, Order-n Correction for Regular Languages 1974 17 CACM Lindstrom, Copying List Structures Using Bounded Workspace 1974 17 CACM Even, Parallelism in Tape-Sorting 1974 17 CACM Ackerman, Quadratic Search for Hash Tables of Size p^n 1974 17 CACM Stone, A Note on a Combinatorial Problem of Burnett and Coffman 1974 17 CACM Ledgard, Production Systems: or Can We Do Better Than BNF? 1974 17 CACM Wegbreit, The Synthesis of Loop Predicates 1974 17 CACM Knott, A Numbering System for Combinations 1973 16 CACM Couger, Curriculum Recommendations for Undergraduate Programs in Information Systems 1973 16 CACM Bachman, The Programmer as Navigator 1973 16 CACM Feldman & Low, Comment on Brent's Scatter Storage Algorithm 1973 16 CACM Bobrow & Wegbreit, A Model and Stack Implementation of Multiple Environments 1973 16 CACM Lampson, A Note on the Confinement Problem 1973 16 CACM Hirschberg, A Class of Dynamic Memory Allocation Algorithms 1973 16 CACM Ganapathy & Rajaraman, Information Theory Applied to the Conversion of Decision Tables to Computer Programs 1973 16 CACM Fencl, A456--Routing Problem 1973 16 CACM Bron & Kerbosch, A457--Finding All Cliques of an Undirected Graph 1973 16 CACM Roy, R323--Generation of Permutations in Lexicographic Order 1973 16 CACM De Morgan, R357--An Efficient Prime Number Generator 1973 16 CACM Manna & Ness & Vuillemin, Inductive Methods for Proving Properties of Programs 1973 16 CACM Peterson & Kasami & Tokura, On the Capabilities of While, Repeat, and Exit Statements 1973 16 CACM Foster, A Generalization of AVL Trees 1973 16 CACM Huang, A Note on Information Organization and Storage 1973 16 CACM Rosin, Teaching ``About Programming'' 1973 16 CACM McFarlan & Nolan, Curriculum Recommendations for Graduate Professional Programs in Information Systems: Recommended Addendum on Information Systems Administration 1973 16 CACM Kandel, Computer Science--Seminars for Undergraduates 1973 16 CACM Bochmann, Multiple Exits from a Loop Without the GOTO 1973 16 CACM Hall, Equivalence Between AND/OR Graphs and Context-Free Grammars 1973 16 CACM Fiala, A449--Solution of Linear Programming Problems in 0-1 Variables 1973 16 CACM Kernighan, R422--Minimal Spanning Tree 1973 16 CACM Bell, Threaded Code 1973 16 CACM Hopcroft & Tarjan, A447--Efficient Algorithms for Graph Manipulation 1973 16 CACM Alt & Kirk, Computer Photocomposition of Technical Text 1973 16 CACM Pager, On the Problem of Communicating Complex Information 1973 16 CACM Reingold, A Nonrecursive List Moving Algorithm 1973 16 CACM Burkhard & Keller, Some Approaches to Best-Match File Searching 1973 16 CACM Wagner, Common Phrases and Minimum-Space Text Storage 1973 16 CACM Bookstein, On Harrison's Substring Testing Technique 1973 16 CACM Payne, Graduate Education: The Ph. D. Glut 1973 16 CACM Brent, Reducing the Retrieval Time of Scatter Storage Techniques 1973 16 CACM Bays, The Reallocation of Hash-Coded Tables 1973 16 CACM Muraoka & Kuck, On the Time Required for a Sequence of Matrix Products 1972 15 CACM Levialdi, On Shrinking Binary Picture Patterns 1972 15 CACM Eisenberg & McGuire, Further Comments on Dijkstra's Concurrent Programming Control Problem 1972 15 CACM Frazer & Wong, Sorting by Natural Selection 1972 15 CACM Ershov, Corrigendum: Aesthetics and the Human Factor in Programming 1972 15 CACM Dijkstra, The Humble Programmer 1972 15 CACM Parnas & Habermann, Comment on Deadlock Prevention Method 1972 15 CACM Tan, On Foster's Information Storage and Retrieval Using AVL Trees 1972 15 CACM Knuth, George Forsythe and the Development of Computer Science 1972 15 CACM Ershov, Aesthetics and the Human Factor in Programming 1972 15 CACM Arbib, Toward an Automata Theory of Brains 1972 15 CACM Manna & Vuillemin, Fixpoint Approach to the Theory of Computation 1972 15 CACM Traub, Numerical Mathematics and Computer Science 1972 15 CACM Moses, Toward a General Theory of Special Functions 1972 15 CACM Brinch Hansen, Structured Multiprogramming 1972 15 CACM Rosen, Programming Systems and Languages 1972 15 CACM Sammet, Programming Languages: History and Future 1972 15 CACM Pohl, A Sorting Problem and Its Complexity 1972 15 CACM Kandel, Computer Science--A Vicious Circle 1972 15 CACM Harter, The Optimality of Winograd's Formula 1972 15 CACM Bron, A426--Merge Sort Algorithm 1972 15 CACM Ashenhurst, Curriculum Recommendations for Graduate Professional Programs in Information Systems 1972 15 CACM Horowitz & Morgan & Shaw, Computers and Society: A Proposed Course for Computer Scientists 1972 15 CACM Kevin & Whitney, A422--Minimal Spanning Tree 1972 15 CACM Walden, A Note on Cheney's Nonrecursive List-Compacting Algorithm 1972 15 CACM Hu, A Comment on the Double-Chained Tree 1972 15 CACM Habermann, Synchronization of Communicating Processes 1972 15 CACM Pager, A Proposal for a Computer-Based Interactive Scientific Community 1972 15 CACM Martin & Ness, Optimizing Binary Trees Grown with a Sorting Algorithm 1972 15 CACM Gordon & Herman, Corrigendum: Reconstruction of Pictures from Their Projections 1972 15 CACM Flores & Madpis, Corrigendum: Average Binary Search Length for Dense Ordered Lists 1972 15 CACM Shell, Corrigendum: Optimizing the Polyphase Sort 1971 14 CACM Gordon & Herman, Reconstruction of Pictures from Their Projections 1971 14 CACM Amidon & Akin, Algorithmic Selection of the Best Method for Compressing Map Data Strings 1971 14 CACM Harrison, Implementation of the Substring Test by Hashing 1971 14 CACM Shell, Optimizing the Polyphase Sort 1971 14 CACM Earley, Toward an Understanding of Data Structures 1971 14 CACM Courtois & Heymans & Parnas, Concurrent Control with ``Readers'' and ``Writers'' 1971 14 CACM Isoda & Goto & Kimura, An Efficient Bit Table Technique for Dynamic Storage Allocation of 2^n-word Blocks 1971 14 CACM Flores & Madpis, Average Binary Search Length for Dense Ordered Lists 1971 14 CACM Fenichel, Comment on Cheney's List-Compaction Algorithm 1971 14 CACM Moses, Algebraic Simplification: A Guide for the Perplexed 1971 14 CACM Moses, Symbolic Integration: The Stormy Decade 1971 14 CACM DeRemer, Simple LR(k) Grammars 1971 14 CACM Ferguson, Buffer Allocation in Merge-Sorting 1971 14 CACM McVitie & Wilson, The Stable Marriage Problem 1971 14 CACM McVitie & Wilson, A411--Three Procedures for the Stable Marriage Problem 1971 14 CACM Amarel, Computer Science: A Conceptual Framework for Curriculum Planning 1971 14 CACM Gladwin, A Note on Compiling Fixed Point Binary Multiplications 1971 14 CACM Fraser, On the Meaning of Names in Programming Systems 1971 14 CACM Morris, Another Recursion Induction Principle 1971 14 CACM Chambers, A410--Partial Sorting 1971 14 CACM Wirth, Program Development by Stepwise Refinement 1971 14 CACM Manna & Waldinger, Toward Automatic Program Synthesis 1971 14 CACM Slagle & Farrell, Experiments in Automatic Learning for a Multipurpose Heuristic Program 1971 14 CACM Hurwitz, On the Probability Distribution of the Values of Binary Trees 1971 14 CACM Slagle & Lee, Application of Game Tree Searching Techniques to Sequential Pattern Recognition 1971 14 CACM Hammer, Signature Simulation and Certain Cryptographic Codes 1971 14 CACM Chang, The Reconstruction of Binary Patterns from Their Projections 1971 14 CACM Hoare, Proof of a Program: FIND 1970 13 CACM Tiernan, An Efficient Search Algorithm to Find the Elementary Circuits of a Graph 1970 13 CACM Black, Optimum Merging from Mass Storage 1970 13 CACM Wagner, Finiteness Assumptions and Intellectual Isolation of Computer Scientists 1970 13 CACM Bell & Kaman, The Linear Quotient Hash Code 1970 13 CACM Cheney, A Nonrecursive List Compacting Algorithm 1970 13 CACM Bratley, An Improved Algorithm To Produce Complex Primes 1970 13 CACM van Emden, A402--Increasing the Efficiency of Quicksort 1970 13 CACM Bratley, R372--An Algorithm to Produce Complex Primes 1970 13 CACM Seppanen, A399--Spanning Tree 1970 13 CACM Peto, R347--An Efficient Algorithm for Sorting with Minimal Storage 1970 13 CACM van Emden, Increasing the Efficiency of Quicksort 1970 13 CACM Lamport, Comment on Bell's Quadratic Quotient Method for Hash Code Searching 1970 13 CACM Bavel, On the Number of Automorphisms of a Singly Generated Automaton 1970 13 CACM Day, Full Table Quadratic Searching for Scatter Storage 1970 13 CACM Brawn & Gustavson & Mankin, Sorting in a Paging Environment 1970 13 CACM Fielding, A387--Function Minimization and Linear Search 1970 13 CACM Bloom, Space/Time Trade-offs in Hash Coding with Allowable Errors 1970 13 CACM Coffman & Eve, File Structures Using Hashing Functions 1970 13 CACM Bradley, Algorithm and Bound for the Greatest Common Divisor of n Integers 1970 13 CACM Woods, Context-Sensitive Parsing 1970 13 CACM Pomeranz, Note on an Anomaly in Paging 1970 13 CACM Hunt, A Comment on Axiomatic Approaches to Programming 1970 13 CACM Codd, A Relational Model of Data for Large Shared Data Banks 1970 13 CACM London, C245--TREESORT 3 1970 13 CACM Chandler & Harrison, R201--SHELLSORT 1970 13 CACM Wirth, Corrigenda: On Multiprogramming, Machine Coding, and Computer Organization 1970 13 CACM Fenichel & Weizenbaum & Yochelson, A Program to Teach Programming 1970 13 CACM Dempster, Comment on a Paging Anomaly 1970 13 CACM Maurer, A Note on the Complement of Inherently Ambiguous Context-Free Languages 1970 13 CACM Earley, An Efficient Context-Free Parsing Algorithm 1970 13 CACM Griffin & Redish, R347--An Efficient Algorithm for Sorting with Minimal Storage 1969 12 CACM Parter, Numerical Analysis in a Ph. D. Computer Science Program 1969 12 CACM Van Tassel, Advanced Cryptographic Techniques for Computers 1969 12 CACM ANSI, Proposed American National Standard: Presentation of Alphameric Characters for Information Processing 1969 12 CACM Fenichel & Yochelson, A LISP Garbage-Collector for Virtual-Memory Computer Systems 1969 12 CACM Korenjak, A Practical Method for Constructing LR(k) Processors 1969 12 CACM Brown & Richman, The Choice of Base 1969 12 CACM Hoare, An Axiomatic Basis for Computer Programming 1969 12 CACM Stanfel, A Comment on Optimal Tree Structures 1969 12 CACM Wirth, On Multiprogramming, Machine Coding, and Computer Organization 1969 12 CACM Hansen, Compact List Representation: Definition, Garbage Collection, and System Implementation 1969 12 CACM McIlroy, A354--Generator of Spanning Trees 1969 12 CACM Leitch, C323--Generation of Permutations in Lexicographic Order 1969 12 CACM Paton, An Algorithm for Finding a Fundamental Set of Cycles of a Graph 1969 12 CACM Parnas, On Simulating Networks of Parallel Processes in Which Simultaneous Events May Occur 1969 12 CACM Arden & Galler & Graham, The MAD Definition Facility 1969 12 CACM Quillian, The Teachable Language Comprehender: A Simulation Program and Theory of Language 1969 12 CACM Singleton, A347--An Efficient Algorithm for Sorting with Minimal Storage 1969 12 CACM Patt, Variable Length Tree Structures Having Minimum Average Search Time 1969 12 CACM Arora & Dent, Randomized Binary Search Technique 1969 12 CACM Kruskal, Extremely Portable Random Number Generator 1969 12 CACM Salton, Information Science in a Ph. D. Computer Science Program 1969 12 CACM Cannon, Computers in Group Theory: A Survey 1969 12 CACM Arden, The Role of Programming in a Ph. D. Computer Science Program 1968 11 CACM McNaughton, Doctoral Program Series--Automata, Formal Languages, Abstract Switching, and Computability in a Ph. D. Computer Science Program 1968 11 CACM Wolinsky, A Simple Proof of Lewin's Ordered-Retrieval Theorem for Associative Memories 1968 11 CACM Thompson, Regular Expression Search Algorithm 1968 11 CACM Graham, Protection in an Information Processing Utility 1966 9 CACM Knuth, Additional Comments on a Problem in Concurrent Programming Control (letter to the editor) 1965 8 CACM Dijkstra, Solution of a Problem in Concurrent Programming Control 1992 24 CAD Dutta & Srinivas, Reconstruction of Curved Solids from Two Polygonal Orthographic Views 1988 7 CAD Lai & Leinwand, Algorithms for Floorplan Design Via Rectangular Dualization 1987 19 CAD Hoffman & Hopcroft, Geometric Ambiguities in Boundary Representations 1992 11 CADE Wos, The Impossibility of the Automation of Logical Reasoning (Abstract) 1992 11 CADE Ammon, Automatic Proofs in Mathematical Logic and Analysis 1992 11 CADE Chou & Gao, Proving Geometry Statements of Constructive Type 1992 11 CADE Yelick & Garland, A Parallel Completion Procedure for Term Rewriting Systems 1992 11 CADE Cichon & Lescanne, Polynomial Interpretations and the Complexity of Algorithms 1992 11 CADE Protzen, Disproving Conjectures 1992 11 CADE Zhang & Hua, Proving the Chinese Remainder Theorem by the Cover Set Induction 1992 11 CADE Madden, Automatic Program Optimization Through Proof Transformation 1992 11 CADE Manna & Waldinger, The Special-Relation Rules Are Incomplete 1992 11 CADE Farmer & Guttman & Thayer, Little Theories 1992 11 CADE Dershowitz & Mitra & Sivakumar, Decidable Matching for Convergent Systems 1995 12 CAGD Delfinado & Edelsbrunner, An Incremental Algorithm for Betti Numbers of Simplicial Complexes on the 3-Sphere 1995 12 CAGD Facello, Implementation of a Randomized Algorithm for Delaunay and Regular Triangulations in Three Dimensions 1993 10 CAGD Schumaker, Computing Optimal Triangulations Using Simulated Annealing 1992 9 CAGD Dey & Sugihara & Bajaj, Delaunay Triangulations in Three Dimensions with Finite Precision Arithmetic 1992 9 CAGD Powar, Minimal Roughness Property of the Delaunay Triangulation: A Shorter Approach 1991 8 CAGD Sapidis & Perucchio, Delaunay Triangulation of Arbitrarily Shaped Planar Domains 1991 8 CAGD Balbes & Siegel, A Robust Method for Calculating the Simplicity and Orientation of Planar Polygons 1991 8 CAGD Dobkin & Souvaine, Detecting the Intersection of Convex Objects in the Plane 1991 8 CAGD Joe, Construction of Three-dimensional Delaunay Triangulations Using Local Transformations 1980 14 CAH Choueka, Computerized Full-Text Retrieval Systems and Research in the Humanities: The Responsa Project 1993 114 CAMBPHILSOC Hansen & Schmutz, How Random is the Characteristic Polynomial of a Random Matrix? 1963 59 CAMBPHILSOC Nash-Williams, On Well-Quasi-Ordering Finite Trees 1991 CAMELOT Spencer, Exploring Number Theory with Microcomputers, Second Edition 1985 CAMELOT Sahni, Concepts in Discrete Mathematics, Second Edition 1992 18 CANDED Bottino, Comparing Different Approaches to Programming from an Educational Viewpoint 1992 18 CANDED Winnans & Brown, Some Factors Affecting Elementary Teachers' Use of the Computer 1992 18 CANDED Levary, Computer Activities and the Development of Transitions in Student Writing 1990 15 CANDED Hawkridge, Who Needs Computers in Schools, and Why? 1996 20 CANDG Skala, Line Clipping in E^2 with O(1) Processing Complexity 1996 20 CANDG Richardson & Shannon, Palindrome Pictures 1996 20 CANDG Borchers & Deussen & Klingert & Knorzer, Layout Rules for Graphical Web Documents 1996 20 CANDG Colet & Herzog, WWW2GCG, a Web Interface to the GCG Biological Sequences Analysis Software 1995 19 CANDG Graham & Iyengar & Zheng, Improved Recursive Bisection Line Drawing Algorithms 1994 18 CANDG Skala, O(lg N) Line Clipping Algorithm in E^2 1994 18 CANDG Sims-Coomber & Martin, An Implementation of LOGO for Elliptic Geometry 1994 18 CANDG Reiter, Sierpinski Fractals and GCDs 1993 17 CANDG Izmailov & Vladimirov, Dimension of Aliasing Structures 1993 17 CANDG Burtsev & Kuzmin, An Efficient Flood-filling Algorithm 1993 17 CANDG Grim & Mar & Neiger & St. Denis, Self-Reference and Paradox in Two and Three Dimensions 1993 17 CANDG Lakhtakia & Passoja, On the Congruence of Binary Patterns Generated by Modular Arithmetic on a Parent Array 1992 16 CANDG Qian & Bhattacharya, Determining Holes and Connectivity in Binary Images 1992 16 CANDG Lei & Liaw, A Parallel Algorithm for Finding Congruent Regions 1992 16 CANDG Szyszkowicz, Graphical Representation of Pseudorandom Numbers 1992 16 CANDG Miller, review of Foley & van Dam & Feiner & Hughes, Computer Graphics Principles and Practice, Second Edition (Addison-Wesley, 1990) 1991 15 CANDG Sims-Coomber & Martin & Thorne, A Non-Euclidean Implementation of LOGO 1996 32 CANDM Lin, A Systolic Algorithm for Solving Dense Linear Systems 1996 32 CANDM Sadeh, Optimal Data Compression Algorithm 1996 32 CANDM Milovanovic & Milovanovic & Milentijevic & Stojcev, Designing of Processor-Time Optimal Systolic Arrays for Band Matrix-Vector Multiplication 1996 32 CANDM Nambiar, Sentient Arithmetic and Godel's Theorems 1996 31 CANDM Li, A New Complexity Bound for the Least-Squares Problem 1996 31 CANDM Steiner & Yeomans, A Linear Time Algorithm for Maximum Matchings in Convex, Bipartite Graphs 1996 31 CANDM Pan, Optimal and Nearly Optimal Algorithms for Approximating Polynomial Zeros 1996 31 CANDM Tsai & Tang & Chen, An Average Case Analysis of a Greedy Algorithm for the On-Line Steiner Tree Problem 1996 31 CANDM Nyland & Reif, An Algebraic Technique for Generating Optimal CMOS Circuitry in Linear Time 1996 31 CANDM Lu & Hou & Chen, A Parallel Poisson Generator Using Parallel Prefix 1995 30 CANDM Sezgin, Some Remarks on a New Composite Random Number Generator 1995 30 CANDM Koc, Analysis of Sliding Window Techniques for Exponentiation 1995 30 CANDM Antonouiu & Srimani, A Self-Stabiliziing Distributed Algorithm to Construct an Arbitrary Spanning Tree of a Connected Graph 1995 30 CANDM Shibata & Gonda, Extension of de Bruijn Graph and Kautz Graph 1995 30 CANDM Liaw, Password Authentications Using Triangles and Straight Lines 1995 30 CANDM Lam & Sung & Hui, A Cardinalised Binary Representation for Exponentiation 1995 30 CANDM Tang & Gupta, An Efficient Parallel Dynamic Programming Algorithm 1995 30 CANDM Lin & Olariu & Pruesse, An Optimal Path Cover Algorithm for Cographs 1995 30 CANDM Vandermeulen & Donegan & Larnac & Magnier, The Temporal Boolean Derivative Applied to Verification of Extended Finite State Machines 1995 30 CANDM Malek & Vaillancourt, A Composite Polynomial Zerofinding Matrix Algorithm 1995 30 CANDM Chou & Deng & Li & Wang, Parallelizing Strassen's Method for Matrix Multiplication on Distributed-Memory MIMD Architectures 1995 29 CANDM Yan, Primality Testing of Large Numbers in Maple 1995 29 CANDM Deng & Wang & Chang, A New Way of Counting n^m 1995 29 CANDM Pardalos & Li & Hager, Linear Programming Approaches to the Convex Hull Problem in R^m 1995 29 CANDM Chang & Fan & Liaw & Chiou, Cryptanalysis on an Access Control in a Hierarchy 1995 29 CANDM Jana & Sinha, Fast Parallel Algorithm for Polynomial Interpolation 1995 29 CANDM Wos, Preface: The Field of Automated Reasoning 1994 28 CANDM Bhattacharya, The Representation of Permutations by Trees 1994 27 CANDM Brooks, Approximation Complexity for Piecewise Monotone Functions and Real Data 1994 27 CANDM Fox, Random Restarting Versus Simulated Annealing 1994 27 CANDM Xue, A Globally Convergent Algorithm for Facility Location on a Sphere 1994 27 CANDM Faure, Neural Networks and Mathematical Distributions Theory: Periodical and Almost Periodical Dirac Firings 1994 27 CANDM Yang & Chen, Convergence Rate of the Fuzzy Generalized Nearest Neighbor Rule 1994 27 CANDM Rao & Iyengar, Bin-Packing by Simulated Annealing 1994 27 CANDM Reggini, Tree Graph Representation of Hamiltonian Paths 1994 27 CANDM Baritompa, Multidimensional Bisection: A Dual Viewpoint 1994 27 CANDM Hung & Parhami, An Approximate Sign Detection Method for Residue Numbers and its Application to RNS Division 1994 27 CANDM Coolsaet & Fack, Optimal Data Exchange Algorithms on Star Graphs 1994 27 CANDM Jeurissen & Layton, Load Balancing by Graph Coloring, an Algorithm 1994 27 CANDM Sun & Hwang, Key Generation of Algebraic-Code Cryptosystems 1994 27 CANDM Lin, A Systolic Algorithm for Dynamic Programming 1994 27 CANDM Lister & Schaeffer, An Analysis of the Conspiracy Numbers Algorithm 1993 26 CANDM Yang, Period Distribution for Error-Correcting Codes 1993 26 CANDM Price & Salama, Optimal Task Allocation in Hypercube Multiprocessor Ensembles 1993 26 CANDM Yen & Laih, Server-Aided Honest Computation for Cryptographic Applications 1993 26 CANDM Tsubakitani & Evans, A Two-Dimensional Mapping for the Traveling Salesman Problem 1993 26 CANDM Jan & Wang, A Dynamic Access Control Scheme Based Upon the Knapsack Problem 1993 26 CANDM , Software Reports: Evolver 2.0, A Genetic Algorithm for Spreadsheets 1993 26 CANDM Marsaglia & Zaman, Monkey Tests for Random Number Generators 1993 26 CANDM Banzhaf, Self-Replicating Sequences of Binary Numbers 1993 26 CANDM Chang & Hwang, Using Smart Cards to Authenticate Remote Passwords 1993 26 CANDM Stilman, A Linguistic Approach to Geometric Reasoning 1993 26 CANDM Dwyer, The Expected Number of k-Faces of a Voronoi Diagram 1993 26 CANDM Chang & Buehrer, Access Control in a Hierarchy Using a One-Way Trap Door Function 1993 25 CANDM Tsai & Chen & Shieh, Generalized Matrix Euclidean Algorithms for Solving Diophantine Equations and Associated Problems 1993 25 CANDM Sur & Srimani, Topological Properties of Star Graphs 1992 24 CANDM Reif, Efficient VLSI Fault Simulation 1992 24 CANDM Mavronicolas, Efficiency of Semi-synchronous versus Asynchronous Systems: Atomic Shared Memory 1992 24 CANDM Leavens & Vermeulen, 3x + 1 Search Programs 1992 24 CANDM Ruggiero & Galligani, A Parallel Algorithm for Solving Block Tridiagonal Linear Systems 1992 24 CANDM Pan & Chuang, Singular Value Decomposition on SIMD Hypercube and Shuffle-Exchange Computers 1992 24 CANDM Stojmenovic, A Simple Systolic Algorithm for Generating Combinations in Lexographic Order 1992 24 CANDM Egecioglu & Koc, Parallel Prefix Computation with Few Processors 1992 24 CANDM Al-Bassam & Venkatesan & Bose, Codes for Detecting and Correcting Propagation Errors 1992 24 CANDM Koc & Hung, Adaptive m-ary Segmentation and Canonical Recoding Algorithms for Multiplication of Large Binary Numbers 1992 24 CANDM Varadarajan, Symmetry in Mathematics 1992 23 CANDM Koc, A Parallel Algorithm for Exact Solution of Linear Equations via Congruence Technique 1991 22 CANDM Winnie, Computing Structure: Sets, Structures, and Invariants in LISP 1991 22 CANDM Koc, An Improved Algorithm for Mixed-radix Conversion of Residue Numbers 1991 22 CANDM Bhasker & Samad, The Clique-Partitioning Problem 1991 22 CANDM Hsueh, A Unifying Approach to the Structures of the Stable Matching Problems 1991 22 CANDM Chen & Duh & Hsu, An Algorithm Paradigm for Incomplete Hypercubes 1991 21 CANDM Iwamoto, Iterative Integral versus Dynamic Programming 1991 21 CANDM Lin & Lin, An O(log n) Algorithm for Computing Periodic Continued Fractions 1991 21 CANDM Lin, Generating Subsets on a Systolic Array 1991 21 CANDM Egecioglu & Koc & Coma, Fast Computation of Continued Fractions 1990 19 CANDM Chren, A New Residue Number System Division Algorithm 1990 19 CANDM Breuer & Gal-Ezer & Zwas, Microcomputer Laboratories in Mathematics Education 1990 19 CANDM Wagstaff, Some Uses of Microcomputers in Number Theory Research 1989 17 CANDM Oriowski & Pachter, An Algorithm for the Determination of a Longest Increasing Subsequence in a Sequence 1984 10 CANDM Lin & Leiss & McInnis, Division and Sign Detection Algorithms for Residue Number Systems 1995 25 CANDSOC Bellin, Some Thoughts on Teaching Computers & Society 1995 25 CANDSOC Tavani, A Computer Ethics Bibliography 1995 25 CANDSOC De Palma, review of Postman, Technopoly: The Surrender of Culture to Technology (Vintage, 1992) 1990 20 CANDSOC Ragsdale, The Impact of Word Processing on Writing Behaviour: The Interaction of Faculty and Their Secretaries 1994 22 CANEWS Forsell, Are Multiport Memories Physically Feasible? 1994 22 CANEWS Baker, Linear Logic and Permutation Stacks -- The Forth Shall Be First 1993 21 CANEWS Gao, The Chinese Remainder Theorem and the Prime Memory System 1993 21 CANEWS Seznec & Lenfant, Odd Memory Systems May Be Quite Interesting 1993 21 CANEWS Boppana & Chalasani, A Comparison of Adaptive Wormhole Routing Algorithms 1993 21 CANEWS Ramanathan & Oren, Survey of Commercial Parallel Machines 1993 21 CANEWS Danesh, Physical Limitations of a Computer 1993 21 CANEWS Gao, The Chinese Remainder Theorem and the Prime Memory System 1993 21 CANEWS Seznec & Lenfant, Odd Memory Systems May Be Quite Interesting 1993 21 CANEWS Boppana & Chalasani, A Comparison of Adaptive Wormhole Routing Algorithms 1992 20 CANEWS Kaushal & Bedi, Comparison of Hypercube, Hypernet, and Symmetric Hypernet Architectures 1991 19 CANEWS Baker, Precise Instruction Scheduling without a Precise Machine Model 1991 19 CANEWS Rau, Pseudo-Randomly Interleaved Memory 1991 19 CANEWS Lin & Ni, Deadlock-Free Multicast Wormhole Routing in Multicomputer Networks 1990 18 CANEWS Hill, What is Scalability? 1990 18 CANEWS Laplante, A Novel Single Instruction Computer Architecture 1989 17 CANEWS David & Ginosar & Yoeli, An Efficient Implementation of Boolean Functions and Finite State Machines as Self-timed Circuits 1989 17 CANEWS Hsu & Kung, A Hardware Mechanism for Priority Queue 1989 17 CANEWS Kim & Kumar, Perfect Latin Squares and Parallel Array Access 1989 17 CANEWS Weiss, An Aperiodic Storage Scheme to Reduce Memory Conflicts in Vector Processors 1982 CAPO Rothstein, Toward Pattern-Recognizing Visual Prostheses 1991 25 CARNAHAN Diffie, Cryptography in the Year 2000 1991 25 CARNAHAN Branstad, Security in Electronic Message System 1991 25 CARNAHAN Bhattacharyya, New Challenges for Telephone Companies to Secure Switching Systems 1991 25 CARNAHAN Jan & Yu, Yet Another Approach for Secure Broadcasting based upon Single Key Concept 1991 25 CARNAHAN Chiu, A Randomness Conserved Exponential Mapping of GF(q) m-Sequence 1991 25 CARNAHAN Farn & Lee & Chang & Ku & Tsai & Tseng & Waung, An Authenticate Processing for the Information System in Industrial Technology Research Institute 1991 25 CARNAHAN Chang & Hwang, A Strategy for Transforming Public-Key Cryptosystems into Identity-based Cryptosystems 1991 25 CARNAHAN Laih & Chen, Threshold Identification 1991 25 CARNAHAN Xiao, A Survey of Spectrum-Techniques-Based Stream Ciphers 1991 25 CARNAHAN Wah, Secure Communication Networks based on the Public-Key Cryptosystem GF(2^m) 1991 25 CARNAHAN Chang & Hwang, Cryptographic Authentication of Passwords 1991 25 CARNAHAN Yeh & Wu & Chang, A New Cryptosystem Using Matrix Transformation 1991 25 CARNAHAN Chang & Lin, An ID-based Signature Scheme based upon Rabin's Public Key Cryptosystem 1991 25 CARNAHAN Sun & Hwang, Public-Key ID-based Cryptosystem 1991 25 CARNAHAN Sun & Hwang, An Efficient Probabilistic Public-Key Block Encryption and Signature Scheme based on El-Gamal's Scheme 1991 25 CARNAHAN Kuo, A New Signal Encryption Technique and its Attack Study 1991 25 CARNAHAN Simmons, Identification; of Data, Devices, Documents and Individuals 1991 25 CARNAHAN Yeh & Wu & Chang & Chang, A Private Key Cryptosystem based upon Enforced Random Substitution Scheme 1991 CARNCOMM Carnegie Commission, In the National Interest: The Federal Government in the Reform of K-12 Math and Science Education 1985 4 CARTINT Duris & Thompson & Sykora & Vrto, Tight Chip Area Bounds for Sorting 1995 7 CAV Lescow, On Polynomial-Size Programs Winning Finite-State Games 1995 7 CAV Krishnan & Puri & Brayton & Varaiya, The Rabin Index and Chain Automata, with Applications to Automata and Games 1995 7 CAV Vardi, An Automata-Theoretic Approach to Fair Realizability and Synthesis 1995 7 CAV Aziz & Balarin & Brayton & DiBenedetto & Saldanha & Sangiovanni-Vincentelli, Supervisory Control of Finite State Machines 1995 7 CAV Emerson & Sistla, Utilizing Symmetry when Model Checking Under Fairness Assumptions: an Automata-Theoretic Approach 1994 6 CAV Mihail & Papadimitriou, On the Random Walk Method for Protocol Testing 1994 6 CAV Bernholtz & Vardi & Wolper, An Automata-Theoretic Approach to Branching-Time Model Checking 1990 CBMS Varga, Scientific Computation on Mathematical Problems and Conjectures 1989 CBMS Wilf, Combinatorial Algorithms: An Update 1987 CBMS Spencer, Ten Lectures on the Probabilistic Method 1986 CBMS Lovasz, An Algorithmic Theory of Numbers, Graphs and Convexity 1986 CBMS Bollobas, Extremal Graph Theory with Emphasis on Probabilistic Methods 1983 CBMS Tarjan, Data Structures and Network Algorithms 1980 CBMS Winograd, Arithmetic Complexity of Computations 1989 CCC Book, What is Structural Complexity Theory? 1989 CCC Ko, Constructing Oracles by Lower Bound Techniques for Circuits 1989 CCC Shouwen, Randomness, Tally Sets, and Complexity Classes 1989 CCC Watanabe, On One-way Functions 1989 CCC Dingzhu, A New Lower Bound for Parity Circuits 1989 CCC Hwang, How to Design Round Robin Schedules 1989 CCC Miller, Bandwidth in Multigrids for Random Graphs 1989 CCC Simoes-Pereira, A Flavor of Matroids, Graphs and Optimal Job Assignment Problems in Operations Research 1989 CCC Zhemin, Algorithms for Polymatroid Optimization 1989 CCC Wrathall, Free Partially Commutative Groups 1989 CCC Meirui & Dongyue & Xiaolin, Some Results on VLSI Parallel Algorithms 1989 CCC Tianxing, On Optimal Arrangement of 12 Points 1989 CCC Wenci, Some Discussions on Vehicle Routing Problems 1990 2 CCCG Michael Smid, Maintaining the Minimal Distance of a Point Set in Less than Linear Time 1990 2 CCCG Lo & Steiger, An Optimal-Time Algorithm for Ham-Sandwich Cuts in the Plane 1990 2 CCCG Naor & Sharir, Computing a Point in the Center of a Point Set in Three Dimensions 1990 2 CCCG Romanik & Smith, Testing Geometric Objects 1990 2 CCCG Asano & Houle & Imai & Imai, A Unified Linear-Space Approach to Geometric mini-max Problems 1990 2 CCCG Schorn, Accurate and Efficient Algorithms for Proximity Problems 1990 2 CCCG Capoyleas & Rote & Woeginger, Geometric Clusterings 1990 2 CCCG Saalfeld, Canonical Cyclic Orderings for Point Sets in the Plane 1990 2 CCCG Sugihara & Ooishi & Imai, Topology-Oriented Approach to Robustness and its Applications to Several Voronoi-Diagram Algorithms 1990 2 CCCG Milenkovic, Rounding Face Lattices in d Dimensions 1990 2 CCCG Asano & Hersenberg & Pach & Sontang & Souvaine & Suri, Separating Bi-chromatic Points by Parallel Lines 1990 2 CCCG Czyzowicz & Campo & Urrutia & Zaks, Separating Convex Sets on the Plane 1990 2 CCCG Barany & Steiger, On the Expected Number of k-Sets 1990 2 CCCG Wee & Chaiken, An Optimal Parallel L_1 Metric Voronoi Diagram Algorithm 1990 2 CCCG Chen, Efficient Parallel Algorithms on Circular Arcs 1990 2 CCCG Qiu & Meijer & Akl, Decomposing the Star Graph into Disjoint Cycles 1990 2 CCCG Bhattacharya & Shermer, Polygonal Separators and Digital Shape Recognition 1990 2 CCCG Campo, A Note on Separation of Plane Convex Sets 1990 2 CCCG Yeuda & Fogel, Good Splitters with Applications to Ray Shooting 1990 2 CCCG Jones & Kee, Maximal Stabbing of Segments in the Plane 1990 2 CCCG Ntafos, Watchman Routes under Limited Visibility 1990 2 CCCG Ghosh & Maheshwari & Pal & Saluja & Madhavan, Characterizing Weak Visibility Polygons and Related Problems 1990 2 CCCG Halperin & Sharir, Improved Combinatorial Bounds and Efficient Techniques for Certain Motion Planning Problems with Three Degrees of Freedom 1990 2 CCCG Dey, Good Triangulations in the Plane 1990 2 CCCG Beichl & Sullivan, A Robust Parallel Triangulation and Shelling Algorithm 1990 2 CCCG Bar-Yeuda & Grinwald, Triangulating Polygons with Holes 1990 2 CCCG Mitchell & Wynters, Optimal Motion of Covisible Points among Obstacles in the Plane 1990 2 CCCG Friedmann & Hersenberg & Snoeynik, On Coordinate Motion Through a Maze 1990 2 CCCG Mott & Argon & Sutter, The Atomic Strain Tensor 1990 2 CCCG Lienhardt, Barycentric Triangulations of Generalized Maps 1990 2 CCCG Foldes, Spherical Orders, Planar Lattices and Obstruction Graphs 1990 2 CCCG Liu & Rival, Enumerating One-Directional Blocking Relations and Embedding Them in Small Areas on the Plane 1990 2 CCCG Eades & Lin & Tamassia, A New Approach for Drawing a Hierarchical Graph 1990 2 CCCG Rus, Dexterous Rotations of Polygons 1990 2 CCCG Roussille & Bruyere & Dufour, Structure Detection for Polygon Decomposition 1990 2 CCCG Chandru & Rajan & Swaminathan, Monotone Pieces of Chains 1990 2 CCCG Chen & Hsieh & Inselberg & Lee, Planar Conflict Resolution for Air Traffic Control 1990 2 CCCG Pal & Dasgupta & Madhavan, Optimal Polygon Placement by Translation 1990 2 CCCG Schorn, An Object Oriented Workbench for Experimental Geometric Computation 1990 2 CCCG Guo, Free-form Surface Modeling Using Implicit Patches 1990 2 CCCG Estivill-Castro & Rhaman, Visibility in Finitely Oriented Polygons 1990 2 CCCG Bar-Yeuda & Ben-Chanoch, An O(N log* N) Time Algorithm for Covering Simple Polygons with Squares 1990 2 CCCG Heat & Paripaty & Roach, Polyhedra: Faces are Better than Vertices 1990 2 CCCG Wang & Tsin, Finding Constrained and Weighted Voronoi Diagrams in the Plane 1990 2 CCCG Lingas, Fast Algorithms for Bounded Voronoi Diagrams of Restricted Polygons 1990 2 CCCG Ross, Voronoi Diagrams over Dynamic Scenes 1990 2 CCCG Gonzalez & Razzazi & Zheng, An Efficient Divide-and-Conquer Approximation Algorithm for Hyperrectangular Partitions 1990 2 CCCG Freimer & Mitchel & Piatko, On the Complexity of Shattering Using Arrangements 1990 2 CCCG Mazon & Recio, Voronoi Diagrams Coming from Discrete Groups on the Plane 1990 2 CCCG Tsin & Wang, Finding Geodesic Voronoi Diagrams of Points in the Presence of Rectilinear Barriers 1990 2 CCCG Mouaward, Minimal Obscuring Sets: The Parallel View Case 1990 2 CCCG Hefferman, Linear-Time Algorithms for Weakly-Monotone Polygons 1990 2 CCCG Ghosh & Maheshwari & Pal & Madhavan, An Algorithm for Recognizing Palm Polygons 1990 2 CCCG Stewart, An Algorithm to Find the Faces of the Convex Hull in Higher Dimensions 1990 2 CCCG Jaromczyk & Wasilkowski, Numerical Stability of a Convex Hull Algorithm for Simple Polygons 1990 2 CCCG Dwyer, Las Vegas Gift-wrapping Is Twice as Fast 1990 2 CCCG Czyzowicz & Campo & Urrutia & Zaks, Guarding Convex Sets on the Plane 1990 2 CCCG Nilsson & Wood, Optimum Watchmen in Spiral Polygons 1990 2 CCCG Bajaj & Bouma, Dynamic Voronoi Diagrams and Delaunay Triangulations 1990 2 CCCG Boissonnat & Devillers & Teillaud, An On-line Construction of Higher Order Voronoi Diagrams and its Randomized Analysis 1990 2 CCCG Diaz & O'Rourke, Ham-Sandwich Sectioning of Polygons 1990 2 CCCG Rote, The Convergence Rate of the Sandwich Algorithm for Approximating Convex Figures in the Plane 1990 2 CCCG Stojmenovic, Cutting the Volumes of Convex Polyhedra by a Plane 1990 2 CCCG Das & Joseph, The Complexity of Minimum Convex Nested Polyhedra 1990 2 CCCG Metha & Mukherjee & Nagy, Constrained Integer Approximation to 2-d Line Intersections 1990 2 CCCG Kabadi & Aneja & Nair, Weighted 1-Center Problem in a Simple Polygon 1990 2 CCCG Shute, A Reduced Grid for Rectilinear Steiner Minimal Trees 1990 2 CCCG Deneen & Dezell, Using Partitioning and Clustering Techniques to Generate Rectilinear Steiner Trees 1990 2 CCCG Mirzain, Circumscribing Polygon of Disjoint Line Segments 1990 2 CCCG Meijer & Rappaport, Minimum Polygon Covers of Parallel Line Segments 1990 2 CCCG Kranakis & Krizanc & Meertens, Link Length of Rectilinear Watchman Tours in Grids 1990 2 CCCG Kao & Knott, Computing Polygonal Chords and the Farthest Visibility Polygon 1990 2 CCCG Melissaratos & Souvaine, Shortest Paths, Visibility, and Optimization in Planar Curvilinear Objects 1990 2 CCCG Hinrichs & Nievergelt & Schorn, An All-Round Sweep Algorithm for 2-Dimensional Nearest-Neighbor Problems 1990 2 CCCG Smid, Algorithms for Semi-Online Updates on Decomposable Problems 1990 2 CCCG Whiteley, Geometry of Bivariate Splines 1990 2 CCCG Schuierer & Rawlins & Wood, Towards a General Theory of Visibility 1990 2 CCCG Gewali & Ntafos, Minimum Covers for Grids and Orthogonal Polygons by Periscope Guards (Extended Abstract) 1990 2 CCCG Whitesides & Zhao, Extended Abstract: Offsets of Circular Arc Figures 1990 2 CCCG Kabadi & Chandrasekaran, Tree Traveling Salesman Problem 1989 CCT Hartmanis, Overview of Computational Complexity Theory 1989 CCT Mahaney, The Isomorphism Conjecture and Sparse Sets 1989 CCT Book, Restricted Relativizations of Complexity Classes 1989 CCT Immerman, Descriptive and Computational Complexity 1989 CCT Selman, Complexity Issues in Cryptography 1989 CCT Goldwasser, Interactive Proof Systems 1995 CED Research and Policy Committee, Connecting Students to a Changing World: A Technology Strategy for Improving Mathematics and Science Education 1992 18 CEEIJ Khanna, A Measure of the Performance of Binomial Interconnection Networks 1994 CENTMATH Bell, The Place of Rigor in Mathematics 1994 CENTMATH Boas, A Proof of the Fundamental Theorem of Algebra 1994 CENTMATH Richardson, The Ph.D. Degree and Mathematical Research 1994 CENTMATH Price, On the Definition of e^{i theta} 1994 CENTMATH Wilder, The Nature of Mathematical Proof 1994 CENTMATH Buchanan, A Manual for Young Teachers of Mathematics 1994 CENTMATH Murnaghan, The Teaching of College Mathematics 1994 CENTMATH Vance, The Teaching of Mathematics in Colleges and Universities 1994 CENTMATH Polya, With or Without Motivation? 1994 CENTMATH Shannon, A Symmetrical Notation for Numbers 1994 CENTMATH Feller, The Problem of n Liars and Markov Chains 1994 CENTMATH Weil, Mathematical Teaching in Universities 1994 CENTMATH Forsythe, Suggestions to Students on Talking about Mathematical Papers 1994 CENTMATH Boas, Yet Another Proof of the Fundamental Theorem of Algebra 1994 CENTMATH Petard, A Brief Dictionary of Phrases Used in Mathematical Writing 1994 CENTMATH Fefferman, An Easy Proof of the Fundamental Theorem of Algebra 1994 CENTMATH Forsythe, What To Do Till the Computer Scientist Comes 1994 CENTMATH Mordell, Hardy's ``A Mathematician's Apology'' 1994 CENTMATH Knuth, Computer Science and its Relation to Mathematics 1994 CENTMATH Boas, Can We Make Mathematics Intelligible? 1994 CENTMATH Wilf, The Disk with the College Education 1994 CENTMATH Mycielski, The Meaning of the Conjecture P != NP For Mathematical Logic 1994 CFAT Boyer & Altbach & Whitelaw, The Academic Profession: An International Perspective 1994 1 CFPDC Pippenger, Juggling Networks 1994 1 CFPDC Dixon & Tarjan, Optimal Parallel Verification of Minimum Spanning Trees in Logarithmic Time 1994 1 CFPDC Greenlaw & Machta, The Parallel Complexity of Algorithms for Pattern Formation Models 1994 1 CFPDC Waack, On the Parallel Complexity of Iterated Multiplication in Rings of Algebraic Integers 1994 1 CFPDC Liang & Greenlaw & Manacher, NC^2 Algorithms Regarding Hamiltonian Paths and Circuits in Interval Graphs 1994 1 CFPDC Dixon, Concurrency in an O(log log N) Priority Queue 1994 1 CFPDC Bettayeb & Miller & Peng & Sudborough, Embedding k-D Meshes into Optimum Hypercubes with Dilation 2k-1 1994 1 CFPDC Rottger & Schroeder & Unger, Embedding 3-Dimensional Grids into Optimal Hypercubes 1994 1 CFPDC Dehne & Lins, Distributed Cyclic Reference Counting 1994 1 CFPDC Baldy & Dicky & Medina & Morvan & Vilarem, Efficient Reconstruction of the Causal Relationship in Distributed Systems 1994 1 CFPDC Dehne, Scalable Parallel Computational Geometry 1994 1 CFPDC Krizanc & Narayanan, Sorting and Selection on Arrays with Diagonal Connections 1994 1 CFPDC Ubeda, Work-Optimal Thinning Algorithm on SIMD Machines 1994 1 CFPDC Cung & Le Cun, An Efficient Implementation of Parallel A* 1994 1 CFPDC Bokka & Gurla & Olariu & Schwing, Constant-Time Convexity Problems on Reconfigurable Meshes 1994 1 CFPDC Galtier, Deepness Analysis: Bringing Optimal Fronts to Triangular Finite Element Method 1994 1 CFPDC Hily & Solleau, Communications in Bus Networks 1994 1 CFPDC Kiks & Pelc, Fault-Tolerant Linear Broadcasting 1994 1 CFPDC Jansen & Muller, The Minimum Broadcast Time Problem 1994 1 CFPDC Hromkovic & Klasing & Unger & Wagener & Pardubska, The Complexity of Systolic Dissemination of Information in Interconnection Networks 1994 1 CFPDC Krumme, Representations of Gossip Schemes 1994 1 CFPDC Kulasinghe & Bettayeb, On the Multiply-Twisted Hypercube 1988 CGAPPS Hinterberger, Using Graphical Information from a Grid File's Directory to Visualize Patterns in Cartesian Product Spaces 1988 CGAPPS Hutflesz & Widmayer & Six, Twin Grid Files: A Performance Evaluation 1988 CGAPPS Heusinger & Noltemeier, On Separable and Rectangular Clusterings 1988 CGAPPS Hinrichs & Nievergelt & Schorn, A Sweep Algorithm for the All-Nearest-Neighbors Problem 1988 CGAPPS Gao & Kaufmann & Mehlhorn & Rulling & Storb & Jerrum, On Continuous Homotopic One Layer Routing (Extended Abstract) 1988 CGAPPS Meiser, Point Location in Arrangements (Extended Abstract) 1988 CGAPPS Blankenagel & Guting, Internal and External Algorithms for the Points-in-Regions Problem--The Inside Join of Geo-Relational Algebra (Extended Abstract) 1988 CGAPPS Guting, Geo-Relational Algebra: A Model and Query Language for Geometric Database Systems (Extended Abstract) 1988 CGAPPS Bieri & Nef, Elementary Set Operations with d-Dimensional Polyhedra 1988 CGAPPS Buckley, A Divide-and-Conquer Algorithm for Computing 4-Dimensional Convex Hulls 1988 CGAPPS Wagener, Triangulating a Monotone Polygon in Parallel 1988 CGAPPS Klein, Abstract Voronoi Diagrams and their Applications (Extended Abstract) 1988 CGAPPS Hagen, Geometric Modeling of Smooth Surfaces 1988 CGAPPS Abramowski, Collision Avoidance for Nonrigid Objects (Extended Abstract) 1988 CGAPPS Reichling, On the Detection of a Common Intersection of k Convex Polyhedra 1988 CGAPPS Muller, Time Coherence in Computer Animation by Ray Tracing (Extended Abstract) 1988 CGAPPS Aurenhammer, Using Gale Transforms in Computational Geometry 1988 CGAPPS Huckenbeck, Geometrical Abstract Automata 1988 CGAPPS Bruderlin, Automatizing Geometric Proofs and Constructions 1995 14 CGFORUM Owen, Computer Graphics and Computer-Aided Design Literature: A Keyword-indexed Bibliography 1994 13 CGFORUM Yong-Kui, An All-integer Algorithm for Drawing Anti-aliased Straight Lines 1994 13 CGFORUM Palamidese & Crise, Animations to Represent Multivariate Data 1994 13 CGFORUM Owen, Computer Graphics and Computer-aided Design Literature: A Keyword-indexed Bibliography 1994 13 CGFORUM Clare & Day, Experiments in the Parallel Computation of 3D Convex Hulls 1994 13 CGFORUM Dixon & Kirby & Wills, A Data Structure for Artificial Terrain Generation 1993 12 CGFORUM Cignoni & Montani & Perego & Scopigno, Parallel 3D Delaunay Triangulation 1993 12 CGFORUM Abellanas & Garcia & Hernandez & Hurtado & Serra & Urrutia, Updating Polygonizations 1992 11 CGFORUM Rappoport, An Efficient Adaptive Algorithm for Constructing the Convex Differences Tree of a Simple Polygon 1988 7 CGFORUM Day, Planar Convex Hull Algorithms in Theory and Practice 1976 5 CGIP Rothstein & Weiman, Parallel and Sequential Specification of a Context Sensitive Language for Straight Lines on Grids 1991 553 CGMAA Aurenhammer & Stockl & Welzl, The Post Office Problem for Fuzzy Point Sets 1991 553 CGMAA Becker & Franciosa & Gschwind & Ohler & thiemt & Widmayer, An Optimal Algorithm for Approximating a Set of Rectangles by Two Minimum Area Rectangles 1991 553 CGMAA Bieri & Schmidt, An On-Line Algorithm for Constructing Sweep Planes in Regular Position 1991 553 CGMAA Dominguez & Gunther, Performance Analysis of Three Curve Presentation Schemes 1991 553 CGMAA Durst, Preclassification and Delayed Classification of Boundary Entities in Arbitrary Dimensions 1991 553 CGMAA Engel, On the Morphology of Polytopes in R^d 1991 553 CGMAA Fang & Bruderlin, Robustness in Geometric Modeling -- Tolerance-Based Methods 1991 553 CGMAA Ihler & Reich & Widmayer, On Shortest Networks for Classes of Points in the Plane 1991 553 CGMAA Jiang & Bunke, Determination of the Symmetries of Polyhedra and an Application to Object Recognition 1991 553 CGMAA Klein, Moving Along a Street 1991 553 CGMAA Monney, Planar Geometric Reasoning with the Theory of Hints 1991 553 CGMAA Muller & Otte, Solving Algebraic Systems in Bernstein-Bezier Representation 1991 553 CGMAA Nievergelt & Schorn & De Lorenzi & Ammann & Brungger, XYZ: A Project in Experimental Geometric Computation 1991 553 CGMAA Schorn, Implementing the XYZ GeoBench: A Programming Environment for Geometric Algorithms 1991 553 CGMAA Nilsson & Schuierer, Computing the Rectilinear Link Diameter of a Polygon 1991 553 CGMAA Noltemeier, Layout of Flexible Manufacturing Systems -- Selected Problems 1991 553 CGMAA Roos & Noltemeier, Dynamic Voronoi Diagrams in Motion Planning 1991 553 CGMAA Schipper, Generating Triangulations of 2-Manifolds 1991 553 CGMAA Schneider & Kriegel, The TR*-tree: A New Representation of Polygonal Objects Supporting Spatial Queries and Operations 1991 553 CGMAA Schreiber, A Voronoi Diagram Based Adaptive K-Means-Type Clustering Algorithm for Multidimensional Weighted Data 1991 553 CGMAA Schuierer & Rawlins & Wood, A Generalization of Staircase Visibility 1991 553 CGMAA Simon, A New Simple Linear Algorithm to Recognize Interval Graphs 1991 553 CGMAA Stifter, Predictions About Collision Free Paths from Intersection Tests 1989 CGRADS Kidwell, Graduate School and You 1997 7 CGTA Erdos & Fishburn, Minimum Planar Sets with Maximum Equidistance Counts 1997 7 CGTA Ghouse & Goodrich, Fast Randomized Parallel Methods for Planar Convex Hull Construction 1997 7 CGTA Naiman & Wynn, On Intersecting a Point Set with Euclidean Balls 1997 7 CGTA Stifter, Characterization of Contour Elements that Generate Abstract Voronoi Diagrams 1997 7 CGTA Hershberger & Suri, Finding a Shortest Diagonal of a Simple Polygon in Linear Time 1997 7 CGTA Colley & Lubiw & Spinrad, Visibility Graphs of Towers 1997 7 CGTA Bose & Shermer & Toussaint & Zhu, Guarding Polyhedral Terrains 1997 7 CGTA Fischer, Sequential and Parallel Algorithms for Finding a Maximum Convex Polygon 1997 7 CGTA Everett & Rivera-Campo, Edge Guarding Polyhedral Terrains 1997 7 CGTA Yap, Towards Exact Geometric Computation 1997 7 CGTA Milenkovic & Milenkovic, Rational Orthogonal Approximations to Orthogonal Matrices 1997 7 CGTA Das & Heffernan & Narasimhan, LR-Visibility in Polygons 1997 7 CGTA Robert, Geometric Orderings of Intersecting Translates and their Applications 1997 7 CGTA Chew, Near-Quadratic Bounds for the L_1 Voronoi Diagram of Moving Points 1997 7 CGTA de Berg & de Groot & Overmars, Perfect Binary Space Partitions 1997 7 CGTA Mitchell, Approximating the Maxmin-Angle Covering Triangulation 1997 7 CGTA Chew & Goodrich & Huttenlocher & Kedem & Kleinberg & Kravets, Geometric Pattern Matching under Euclidean Motion 1997 7 CGTA Daniels & Milenkovic & Roth, Finding the Largest Area Axis-Parallel Rectangle in a Polygon 1996 6 CGTA Hurtado & Noy, Triangulations, Visibility Graph and Reflex Vertices of a Simple Polygon 1996 6 CGTA Gupta & Janardan & Smid, Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric Objects 1996 6 CGTA Capoyleas, On the Area of the Intersection of Disks in the Plane 1996 6 CGTA Kitsios & Tsakalidis, Space Reduction and an Extension for a Hidden Line Elimination Algorithm 1996 6 CGTA Palios, Optimal Tetrahedralization of the 3D-Region ``Between'' a Convex Polyhedron and a Convex Polygon 1996 6 CGTA Zhu & Sundaram & Snoeyink & Mitchell, Generating Random Polygons with Given Vertices 1996 6 CGTA Bose & Bremner & Toussaint, All Convex Polyhedra Can Be Clamped with Parallel Jaw Grippers 1996 6 CGTA Pocchiola & Vegter, Minimal Tangent Visibility Graphs 1996 6 CGTA Devillers & Golin & Kedem & Schirra, Queries on Voronoi Diagrams of Moving Points 1996 6 CGTA Vleugels & Ferrucci & Overmars & Rao, Hunting Voronoi Vertices 1996 6 CGTA de Berg & van Kreveld & Schwarzkopf & Snoeyink, Point Location in Zones of k-Flats in Arrangements 1996 6 CGTA Rao & Goldberg, Computing Grasp Functions 1996 6 CGTA Nilsson & Schuierer, An Optimal Algorithm for the Rectilinear Link Center of a Rectilinear Polygon 1996 6 CGTA Brass, Erdos Distance Problems in Normed Spaces 1996 6 CGTA Guibas & Overmars & Robert, The Exact Fitting Problem in Higher Dimensions 1996 6 CGTA Asano & Katoh, Variants for the Hough Transform for Line Detection 1996 6 CGTA Matousek & Schwarzkopf, A Deterministic Algorithm for the Three-dimensional Diameter Problem 1996 6 CGTA de Berg, Computing Half-Plane and Strip Discrepancy of Planar Point Sets 1996 6 CGTA Egecioglu & Gonzalez, A Computationally Intractable Problem on Simplicial Complexes 1996 6 CGTA Kirkpatrick & Wismath, Determining Bar-Representability for Ordered Weighted Graphs 1996 6 CGTA Boissonnat & Cerezo & Devillers & Duquesne & Yvinec, An Algorithm for Constructing the Convex Hull of a Set of Spheres in Dimension d 1996 6 CGTA Gupta & Janardan & Smid, Algorithms for Generalized Halfspace Range Searching and other Intersection Searching Problems 1996 6 CGTA Gyori & Hoffmann & Kriegel & Shermer, Generalized Guarding and Partitioning for Rectilinear Polygons 1996 6 CGTA Eppstein, Average Case Analysis of Dynamic Geometric Optimization 1996 5 CGTA Atallah & Fabri, On the Multisearching Problem for Hypercubes 1996 5 CGTA Boissonnat & Dobrindt, On-line Construction of the Upper Envelope of Triangles and Surface Patches in Three Dimensions 1996 5 CGTA Gupta & Janardan & Smid, Algorithms for Generalized Halfspace Range Searching and other Intersection Searching Problems 1996 5 CGTA Beauquier & Nivat & Remila & Robson, Tiling Figures of the Plane with Two Bars 1996 5 CGTA Chazelle & Matousek, Derandomizing an Output-sensitive Convex Hull Algorithm in Three Dimensions 1996 5 CGTA Romanik & Salzberg, Testing Orthogonal Shapes 1995 5 CGTA Chazelle & Rosenberg, Simplex Range Reporting on a Pointer Machine 1995 5 CGTA de Berg, Generalized Hidden Surface Removal 1995 5 CGTA Dickerson & Eppstein, Algorithms for Proximity Problems in Higher Dimensions 1995 5 CGTA Agarwal & Katz & Sharir, Computing Depth Orders for Fat Objects and Related Problems 1995 5 CGTA Souvaine & Yap, Combinatorial Complexity of Signed Discs 1995 5 CGTA Swanson & Lee & Wu, An Optimal Algorithm for Roundness Determination on Convex Polygons 1995 5 CGTA Andrews & Lee, Parallel Algorithms on Circular-Arc Graphs 1995 5 CGTA Baeza-Yates & Schott, Parallel Searching in the Plane 1995 5 CGTA Dwyer, The Expected Size of the Sphere-of-Influence Graph 1995 5 CGTA Gajentaan & Overmars, On a Class of O(n^2) Problems in Computational Geometry 1995 5 CGTA Everett & Corneil, Negative Results on Characterizing Visibility Graphs 1995 5 CGTA Fishburn, Convex Polygons with Few Intervertex Distances 1995 5 CGTA Mitchell & Suri, Separation and Approximation of Polyhedral Objects 1995 5 CGTA Seidel, The Upper Bound Theorem for Polytopes: An Easy Proof of its Asymptotic Version 1994 4 CGTA Hirata & Matousek & Tan & Tokuyama, Complexity of Projected Images of Convex Subdivisions 1994 4 CGTA Kranakis & Pocchiola, Counting Problems Relating to a Theorem of Dirichlet 1994 4 CGTA Schindler, Equivariant Mappings: A New Approach in Stochastic Simulations 1994 4 CGTA Di Battista & Eades & Tamassia & Tollis, Algorithms for Drawing Graphs: An Annotated Bibliography 1994 4 CGTA Jaromczyk & Wasilkowski, Computing Convex Hull in a Floating Point Arithmetic 1994 4 CGTA Agarwal, On Stabbing Lines for Convex Polyhedra in 3D 1994 4 CGTA Fukuda & Rosta, Combinatorial Face Enumeration in Convex Polytopes 1994 4 CGTA Lingas, A Linear-Time Construction of the Relative Neighborhood Graph from the Delaunay Triangulation 1994 4 CGTA O'Rourke & Rippel, Two Segment Classes with Hamiltonian Visibility Graphs 1994 4 CGTA Rappaport & Rosenbloom, Moldable and Castable Polygons 1994 4 CGTA Efrat & Sharir & Ziv, Computing the Smallest k-Enclosing Circle and Related Problems 1994 4 CGTA Heffernan & Schirra, Approximate Decision Algorithms for Point Set Congruence 1994 4 CGTA Romanik & Smith, Testing Geometric Objects 1994 4 CGTA Chazelle & Friedman, Point Location among Hyperplanes and Unidirectional Ray-Shooting 1994 4 CGTA Hershberger & Snoeyink, Computing Minimum Length Paths of a Given Homotopy Class 1994 4 CGTA Sharir & Toledo, Extremal Polygon Containment Problems 1994 4 CGTA Gonzalez & Razzazi & Shing & Zheng, On Optimal Guillotine Partitions Approximating Optimal d-Box Partitions 1994 4 CGTA Keil, Computing a Subgraph of the Minimum Weight Triangulation 1994 4 CGTA Robert & Toussaint, Linear Approximation of Simple Objects 1993 3 CGTA Atallah & Chen, On Parallel Rectilinear Obstacle-avoiding Paths 1993 3 CGTA Dey, On Counting Triangulations in d Dimensions 1993 3 CGTA Heath & Paripati & Roach, Representing Polyhedra: Faces are Better than Vertices 1993 3 CGTA van der Stappen & Halperin & Overmars, The Complexity of the Free Space for a Robot Moving Amidst Fat Obstacles 1993 3 CGTA Anagnostou & Corneil, Polynomial-Time Instances of the Minimum Weight Triangulation Problem 1993 3 CGTA Dwyer, Maximal and Minimal Balls 1993 3 CGTA Efrat & Rote & Sharir, On the Union of Fat Wedges and Separating a Collection of Segments by a Line 1993 3 CGTA Heath & Kasif, The Complexity of Finding Minimal Voronoi Covers with Application to Machine Learning 1993 3 CGTA Clarkson & Mehlhorn & Seidel, Four Results on Randomized Incremental Constructions 1993 3 CGTA Ghosh & Maheshwari & Pal & Saluja & Madhavan, Characterizing and Recognizing Weak Visibility Polygons 1993 3 CGTA Mehlhorn & Sharir & Welzl, Tail Estimates for the Efficiency of Randomized Incremental Algorithms for Line Segment Intersection 1993 3 CGTA Heffernan, Linear-Time Algorithms for Weakly-Monotone Polygons 1993 3 CGTA Kalyanasundaram & Pruhs, A Competitive Analysis of Algorithms for Searching Unknown Scenes 1993 3 CGTA Klein & Mehlhorn & Meiser, Randomized Incremental Construction of Abstract Voronoi Diagrams 1993 3 CGTA Chew & Kedem, A Convex Polygon among Polygonal Obstacles: Placement and High-Clearance Motion 1993 3 CGTA Hambrusch & Dehne, Determining Maximum k-Width-Connectivity on Meshes 1993 3 CGTA Jansen, One Strike against the Min-Max Degree Triangulation Problem 1993 3 CGTA Alsuwaiyel & Lee, Minimal Link Visibility Paths Inside a Simple Polygon 1993 3 CGTA Aronov & Seidel & Souvaine, On Compatible Triangulations of Simple Polygons 1993 3 CGTA Guha, An Optimal Parallel Algorithm Using Exclusive Read/Writes for the Rectilinear Voronoi Diagram 1993 3 CGTA Pellegrini, Lower Bounds on Stabbing Lines in 3-Space 1993 2 CGTA Bistiolas & Sofotassios & Tsakalidis, Computing Rectangle Enclosures 1993 2 CGTA Gewali & Ntafos, Covering Grids and Orthogonal Polygons with Periscope Guards 1993 2 CGTA Golin, How Many Maxima Can There Be? 1993 2 CGTA Avgustinovich & Sevast'janov, Vector Summation within Minimal Angle 1993 2 CGTA Avis & Grishukhin, A Bound on the k-gonality of Facets of the Hypermetric Cone and Related Complexity Problems 1993 2 CGTA Belleville & Shermer, Probing Polygons Minimally is Hard 1993 2 CGTA Godrich, Constructing the Convex Hull of a Partially Sorted Set of Points 1993 2 CGTA Matousek, On Vertical Ray Shooting in Arrangements 1993 2 CGTA Sauer, On the Recognition of Digital Circles in Linear Time 1992 2 CGTA Crescenzi & Di Battista & Piperno, A Note on Optimal Area Algorithms for Upward Drawings of Binary Trees 1992 2 CGTA Hohmeyer & Teller, Stabbing Isothetic Boxes and Rectangles in O(n log n) Time 1992 2 CGTA Joseph & Skiena, Model-based Probing Strategies for Convex Polygons 1992 2 CGTA Katz & Overmars & Sharir, Efficient Hidden Surface Removal for Objects with Small Union Size 1992 2 CGTA de Berg, Dynamic Output-Sensitive Hidden Surface Removal for c-Oriented Polyhedra 1992 2 CGTA Dehne & Ferreira & Rau-Chaplin, Parallel Fractional Cascading on Hypercube Multiprocessors 1992 2 CGTA Matousek, Reporting Points in Halfspaces 1992 2 CGTA Devillers & Meiser & Teillaud, Fully Dynamic Delaunay Triangulation in Logarithmic Expected Time per Operation 1992 2 CGTA Fishburn & Reeds, Unit Distances between Vertices of a Convex Polygon 1992 2 CGTA Hershberger, Upper Envelope Onion Peeling 1992 2 CGTA Hershberger, Minimizing the Sum of Diameters Efficiently 1992 2 CGTA Agarwal & Matousek, Relative Neighborhood Graphs in Three Dimensions 1992 2 CGTA Mirzaian, Hamiltonian Triangulations and Circumscribing Polygons of Disjoint Line Segments 1992 2 CGTA Shor & Van Wyk, Detecting and Decomposing Self-Overlapping Curves 1992 2 CGTA Urabe & Watanabe, On a Counterexample to a Conjecture of Mirzaian 1992 1 CGTA Chazelle & Edelsbrunner & Guibas & Pollack & Seidel & Sharir & Snoeyink, Counting and Cutting Cycles of Lines and Rods in Space 1992 1 CGTA Klein, Walking an Unknown Street with Bounded Detour 1992 1 CGTA Agarwal & Matousek & Suri, Farthest Neighbors, Maximum Spanning Trees and Related Problems in Higher Dimensions 1992 1 CGTA Hambrusch & Tu, A Framework for 1-D Compaction with Forbidden Region Avoidance 1992 1 CGTA Veltkamp, The gamma-Neighborhood Graph 1992 1 CGTA de Berg & Overmars, Hidden Surface Removal for c-Oriented Polyhedra 1992 1 CGTA Halperin & Sharir, Improved Combinatorial Bounds and Efficient Techniques for Certain Motion Planning Problems with Three Degrees of Freedom 1992 1 CGTA Bokowski & Richter-Gebert & Schindler, On the Distribution of Order Types 1992 1 CGTA Eppstein, The Farthest Point Delaunay Triangulation Minimizes Angles 1992 1 CGTA Ntafos, Watchman Routes under Limited Visibility 1992 1 CGTA Rappaport, A Convex Hull Algorithm for Discs, and Applications 1991 1 CGTA Agarwal & Sharir, Off-line Dynamic Maintenance of the Width of a Planar Point Set 1991 1 CGTA Atallah & Chen, Parallel Rectilinear Shortest Paths with Rectangular Obstacles 1991 1 CGTA Shermer, Computing Bushy and Thin Triangulations 1991 1 CGTA Avis & Erdos & Pach, Distinct Distances Determined by Subsets of a Point Set in Space 1991 1 CGTA de Berg, On Rectilinear Link Distance 1991 1 CGTA Overmars & Sharir, Merging Visibility Maps 1991 1 CGTA Seidel, A Simple and Fast Incremental and Randomized Algorithm for Computing Trapezoidal Decompositions and for Triangulating Polygons 1987 CHAITIN Chaitin, Randomness and Mathematical Proof, Scientific American, 1975 1987 CHAITIN Chaitin, On the Difficulty of Computations, IEEE Transactions on Information Theory, 1970 1987 CHAITIN Chaitin, Information-Theoretic Computational Complexity, IEEE Transactions on Information Theory, 1974 1987 CHAITIN Chaitin, Algorithmic Information Theory, Encyclopedia of Statistical Sciences, 1982 1987 CHAITIN Chaitin, Algorithmic Information Theory, IBM Journal of Research and Development, 1977 1987 CHAITIN Chaitin, Goedel's Theorem and Information, International Journal of Theoretical Physics, 1982 1987 CHAITIN Chaitin, Randomness and Goedel's Theorem, Proceedings 1985 Solvay Conference 1987 CHAITIN Chaitin, An Algebraic Equation for the Halting Probability, The Universal Turing Machine 1987 CHAITIN Chaitin, Computing the Busy Beaver Function, Open Problems in Communication and Computation 1987 CHAITIN Chaitin, To a Mathematical Definition of ``Life'', ACM SIGACT News, 1970 1987 CHAITIN Chaitin, Toward a Mathematical Definition of ``Life'', The Maximum Entropy Formalism, 1979 1987 CHAITIN Chaitin, A Theory of Program Size Formally Identical to Information Theory, Journal of the ACM, 1975 1987 CHAITIN Chaitin, Incompleteness Theorems for Random Reals, Advances in Applied Mathematics, 1987 1987 CHAITIN Chaitin, Algorithmic Entropy of Sets, Computers & Mathematics with Applications, 1976 1987 CHAITIN Chaitin, Information-Theoretic Limitations of Formal Systems, Journal of the ACM, 1974 1987 CHAITIN Chaitin, A Note on Monte Carlo Primality Tests and Algorithmic Information Theory, Communications on Pure and Applied Mathematics, 1978 1987 CHAITIN Chaitin, Information-Theoretic Characterizations of Recursive Infinite Strings, Theoretical Computer Science, 1976 1987 CHAITIN Chaitin, Program Size, Oracles, and the Jump Operation, Osaka Journal of Mathematics, 1977 1987 CHAITIN Chaitin, On the Length of Programs for Computing Finite Binary Sequences, Journal of the ACM, 1966 1987 CHAITIN Chaitin, On the Length of Programs for Computing Finite Binary Sequences: Statistical Considerations, Journal of the ACM, 1969 1987 CHAITIN Chaitin, On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural Numbers, Journal of the ACM, 1969 1994 7 CHANCE Zorn, Math Riots Prove Fun Incalculable 1993 6 CHANCE O'Geran & Wynn & Zhiglyavsky, Mastermind as a Test-Bed for Search Algorithms 1991 4 CHANCE Engel & Venetoulias, Monty Hall's Probability Puzzle 1989 CHAOSFRACT Devaney, Overview: Dynamics of Simple Maps 1989 CHAOSFRACT Holmes, Nonlinear Oscillations and the Smale Horseshoe Map 1989 CHAOSFRACT Alligood & Yorke, Fractal Basin Boundaries and Chaotic Attractors 1989 CHAOSFRACT Keen, Julia Sets 1989 CHAOSFRACT Branner, The Mandelbrot Set 1989 CHAOSFRACT Harrison, Introduction to Fractals 1989 CHAOSFRACT Barnsley, Iterated Function Systems 1996 7 CHAOSSF Augenstein, Links between Physics and Set Theory 1995 5 CHAOSSF Afif & Likas & Paschos, A Natural Model and a Parallel Algorithm for Approximately Solving the Maximum Weighted Independent Set Problem 1995 5 CHAOSSF Rasetti, Uncertainty, Predictability and Decidability in Chaotic Dynamical Systems 1995 5 CHAOSSF Ornstein, In What Sense Can a Deterministic System be Random? 1995 5 CHAOSSF Chaitin, Randomness in Arithmetic and the Decline and Fall of Reductionism in Pure Mathematics 1995 5 CHAOSSF Agnes & Rasetti, Undecidability and Chaos in Word-Coded Symbolic Dynamics 1994 4 CHAOSSF Jinghua & Zeng-Rong & Ren, The Measures of Sequence Complexity for EEG Studies 1994 4 CHAOSSF El Naschie, Dimensions and Cantor Spectra 1994 4 CHAOSSF El Naschie, Silver Mean Hausdorff Dimension and Cantor Sets 1994 4 CHAOSSF Poschel & Malchow, A Simple Model for the Growth of Ramified Leaf Structures 1994 4 CHAOSSF Saparin & Witt & Kurths & Anishchenko, The Renormalized Entropy--An Appropriate Complexity Measure? 1994 CHAPHALL Paton (Ed.), Computing with Biological Metaphors 1994 CHAPHALL Megson (Ed.), Transformational Approaches to Systolic Design 1993 CHAPHALL Godsil, Algebraic Combinatorics 1991 CHAPHALL Slomson, An Introduction to Combinatorics 1971 CHAPHALL Conway, Regular Algebra and Finite Machines 1959 CHELSEA Schreier & Sperner, Introduction to Modern Algebra and Matrix Theory, Second Edition 1994 2 CIAC Hartmanis & Chari, On the Intellectual Terrain Around NP 1994 2 CIAC Garg & Tamassia, Advances in Graph Drawing 1994 2 CIAC Sahinalp & Vishkin, On a Parallel-Algorithms Method for String Matching Problems 1994 2 CIAC Yannakakis, Some Open Problems in Approximation 1994 2 CIAC Alimonti, New Local Search Approximation Techniques for Maximum Generalized Satisfiability Problems 1994 2 CIAC Bergadano & Varricchio, Learning Behaviors of Automata from Multiplicity and Equivalence Queries 1994 2 CIAC Bernasconi & Codenotti, Measures of Boolean Function Complexity Based on Harmonic Analysis 1994 2 CIAC Clementi & Impagliazzo, Graph Theory and Interactive Protocols for Reachability Problems on Finite Cellular Automata 1994 2 CIAC Dekel & Hu, Parallel Pruning Decomposition (PDS) and Biconnected Components of Graphs 1994 2 CIAC Di Crescenzo, A Non-Interactive Electronic Cash System 1994 2 CIAC Even & Litman, A Unified Scheme for Routing in Expander Based Networks 1994 2 CIAC Frigioni & Marchetti-Spaccamela & Nanni, Dynamization of Backtrack-Free Search for the Constraint Satisfaction Problem 1994 2 CIAC Hofri & Shachnai, Efficient Reorganization of Binary Search Trees 1994 2 CIAC Israeli & Kranakis & Krizanc & Santoro, Time-Message Trade-Offs for the Weak Unison Problem 1994 2 CIAC Lam & Lee, On Set Equality-Testing 1994 2 CIAC Monti & Roncato, On the Complexity of Some Reachability Problems 1994 2 CIAC Mundhenk, On Self-Reducible Sets of Low Information Content 1994 2 CIAC Rub, Lower Bounds for Merging on the Hypercube 1991 CICS Kurtz & Mitchell & O'Donnell, Connecting Formal Semantics to Constructive Intuitions 1991 CICS Lipton, Kripke Semantics for Dependent Type Theory and Realizability Interpretations 1991 CICS Smith, Reflective Semantics of Constructive Type Theory: Preliminary Report 1991 CICS Thompson, Are Subsets Necessary in Martin-Lof Type Theory? 1991 CICS Lu & Xu, Development Transformation Based on Higher Order Type Theory 1991 CICS Murthy, Classical Proofs as Programs: How, What, and Why 1991 CICS Napierala, Classical Type Theory 1991 CICS Sun, Axiomatization of Calculus of Constructions 1991 CICS Swarup & Reddy, A Logical View of Assignments 1991 CICS Fellows & Langston, Constructivity Issues in Graph Algorithms 1991 CICS Coquand, Constructive Topology and Combinatorics 1991 CICS Chirimar & Howe, Implementing Constructive Real Analysis: Preliminary Report 1991 CICS Tucker & Zucker, Examples of Semicomputable Sets of Real and Complex Numbers 1991 CICS Greenleaf, Bringing Mathematics Education into the Algorithmic Age 1991 CICS Myers & Prather, The Type Structure of CAT 1991 CICS Weihrauch, A Simple and Powerful Approach for Studying Constructivity, Computability, and Complexity 1989 CIME Goecke & Korte & Lovasz, Examples and Algorithmic Properties of Greedoids 1989 CIME Lawler, Combinatorial Structures and Combinatorial Optimization 1989 CIME Arbib, A Polynomial Algorithm for Partitioning Line-Graphs 1989 CIME Chaillou & Hansen & Mahieu, Best Network Flow Bounds for the Quadratic Knapsack Problem 1996 CINFDIR Hildebrandt (Ed.), Computing Information Directory: A Comprehensive Guide to the Computing and Computer Engineering Literature 1978 12 CISS Agerwala & Lint, Communication in Parallel Computer Systems 1978 12 CISS Book, On Formal Grammars (Preliminary Report) 1978 12 CISS Johnson, A Simple Priority Queue in which Initialization and Queue Operations Take O(log log N) Time 1978 12 CISS Johnson & Kashdan, Application of Probabilistic Techniques to NP-Hard Number Problems 1978 12 CISS Sudborough, Relating Open Problems on the Tape Complexity of Context-free Languages and Path Systems Problems 1977 11 CISS Breitbart & Lewis, Combined Complexity [A New Direction in Computational Complexity] 1977 11 CISS Tsichritzis, Research Directions in Data Base Management Systems 1977 11 CISS Fischer, Computational Complexity 1977 11 CISS Lewis & Dobkin & Lipton, Graph Properties Defined by a Forbidden Subgraph 1977 11 CISS Lipton & Miller & Snyder, On an Array Sorting Problem of Kosaraju 1977 11 CISS Miller, Theoretical Studies of Asynchronous and Parallel Processing 1977 11 CISS Stimson & Savitch, Time Hierarchies of Recursive Computations 1977 11 CISS Standish, Program Transformations 1975 9 CISS Galil, On Hierarchies of Complete Problems 1975 9 CISS Gavril, Adaptive Merging by Parallel Disjoint Comparisons 1975 9 CISS Hirschberg, A Slightly Better Bound for the Vertex Connectivity Problem 1975 9 CISS Savitch & Stimson, The Complexity of Recursive Algorithms 1975 9 CISS Walsh & Burkhard, Polynomial Algorithms for (3,1) Graphs 1973 7 CISS Mandl, Precise Bounds Associated with the Subset Construction on Various Classes of Nondeterministic Finite Automata 1970 4 CISS Kosaraju, Finite State Automata with Markers 1995 CITRUS Zonst, Understanding the FFT: A Tutorial on the Algorithm & Software for Laymen, Students, Technicians & Working Engineers 1969 21 CJM Lyndon & Ullman, Groups Generated by Two Parabolic Linear Fractional Transformations 1997 CJTCS Feige & Kilian, On Limited versus Polynomial Nondeterminism 1996 CJTCS Vardi, Rank Predicates vs. Progress Measures in Concurrent-Program Verification 1996 CJTCS Ogihara, Sparse Hard Sets for P Yield Space-Efficient Algorithms 1996 CJTCS Gerstel & cidon & Zaks, Optimal Virtual Path Layout in ATM Networks With Shared Routing Table Switches 1996 CJTCS Buntrock & Niemann, Weakly Growing Context-Sensitive Grammars 1996 CJTCS Hoover & Rudnicki, Uniform Self-Stabilizing Orientation of Unicyclic Networks under Read/Write Atomicity 1996 CJTCS Middendorf, Manhattan Channel Routing is NP-complete Under Truly Restricted Settings 1995 CJTCS Nisan & Ta-Shma, Symmetric Logspace is Closed Under Complement 1995 CJTCS Grolmusz, On the Weak mod m Representation of Boolean Functions 1995 CJTCS Klarlund & Kozen, Rabin Measures 1995 CJTCS Condon & Feigenbaum & Lund & Shor, Probabilistically Checkable Debate Systems and Nonapproximability of PSPACE-Hard Functions 1995 CJTCS Herman, A Comprehensive Bibliography on Self-Stabilization (working paper) 1996 CLARENDON Davies & Samuels, An Introduction to Computational Geometry for Curves and Surfaces 1995 CLARENDON Flowers, An Introduction to Numerical Methods in C++ 1994 CLARENDON Rose, A Course in Number Theory, Second Edition 1994 CLARENDON Hankin, Lambda Calculi: A Guide for Computer Scientists 1994 CLARENDON Gabbay & Hogger & Robinson & Nute (Eds.), Handbook of Logic in Artificial Intelligence and Logic Programming, Volume 3: Nonmonotonic Reasoning and Uncertain Reasoning 1994 CLARENDON Gabbay & Hogger & Robinson & Siekmann (Eds.), Handbook of Logic in Artificial Intelligence and Logic Programming, Volume 2: Deduction Methodologies 1994 CLARENDON Shawe-Taylor & Anthony (Eds.), Computational Learning Theory: EuroCOLT '93, Based on the proceedings of the first European conference on Computational Learning Theory 1994 CLARENDON Hutchinson, Algorithmic Learning 1993 CLARENDON Clote & Krajicek (Eds.), Arithmetic, Proof Theory, and Computational Complexity 1992 CLARENDON Abramsky & Gabbay & Maibaum, Handbook of Logic in Computer Science, Volumes 1 (Background: Mathematical Structures) and 2 (Background: Computational Structures) 1992 CLARENDON Megson, An Introduction to Systolic Algorithm Design 1992 CLARENDON Pretzel, Error-Correcting Codes and Finite Fields 1992 CLARENDON Barrow, Pi in the Sky: Counting, Thinking, and Being 1992 CLARENDON Mitchell (Ed.), Cryptography and Coding II 1991 CLARENDON Cleave, A Study of Logics 1991 CLARENDON Reed & Roscoe & Wachter (Eds.), Topology and Category Theory in Computer Science 1991 CLARENDON Kaye, Models of Peano Arithmetic 1990 CLARENDON Nordstrom & Petersson & Smith, Programming in Martin-Lof's Type Theory 1990 CLARENDON Cofman, What to Solve? Problems and Suggestions for Young Mathematicians 1990 CLARENDON Hogger, Essentials of Logic Programming 1988 CLARENDON Welsh, Codes and Cryptography 1988 CLARENDON Modi, Parallel Algorithms and Matrix Computation 1987 CLARENDON Anderson, Combinatorics of Finite Sets 1987 CLARENDON Reichel, Initial Computability, Algebraic Specifications, and Partial Algebras 1986 CLARENDON Hill, A First Course in Coding Theory 1985 CLARENDON Bell, Boolean-Valued Models and Independence Proofs in Set Theory, Second Edition 1995 12 CLASSIF Joly & Le Calve, Three-Way Distances 1995 12 CLASSIF Leclerc, Minimum Spanning Trees for Tree Metrics: Abridgements and Adjustments 1992 9 CLASSIF Messatfa, An Algorithm to Maximize the Agreement Between Partitions 1992 9 CLASSIF de Amorim & Barthelemy & Ribeiro, Clustering and Clique Partitioning: Simulated Annealing and Tabu Search Approaches 1992 9 CLASSIF Steel & Hendy & Penny, Significance of the Length of the Shortest Tree 1992 9 CLASSIF Steel, The Complexity of Reconstructing Trees from Qualitative Characters and Subtrees 1989 6 CLASSIF Quiroz, Fast Random Generation of Binary, t-ary and Other Types of Trees 1991 CLROB Fitting, Modal Logic Should Say More Than It Does 1991 CLROB Bledsoe, Interactive Proof Presentation 1991 CLROB Bundy, A Science of Reasoning 1991 CLROB Shapiro, Inductive Inference of Theories from Facts 1991 CLROB Jouannaud & Kirchner, Solving Equations in Abstract Algebras: A Rule-Based Survey of Unification 1991 CLROB Comon, Disunification: A Survey 1991 CLROB Wand & O'Keefe, Automatic Dimensional Inference 1991 CLROB Elcock, Absys, the First Logic-Programming Language: A View of the Inevitability of Logic Programming 1994 1 CLTNLS Osherson & Stob & Weinstein, Logic and Learning 1994 1 CLTNLS Banerji, Learning Theoretical Terms 1994 1 CLTNLS Judd, How Loading Complexity is Affected by Node Function Sets 1994 1 CLTNLS Cook, Defining the Limits of Analogical Planning 1994 1 CLTNLS Seshu, Binary Decision Trees and an ``Average-Case'' Model for Concept Learning: Implications for Feature Construction and the Study of Bias 1994 1 CLTNLS Kearns & Schapire, Efficient Distribution-free Learning of Probabilistic Concepts 1994 1 CLTNLS Karpinski & Werther, VC Dimension and Sampling Complexity of Learning Sparse Polynomials and Rational Functions 1994 1 CLTNLS Hirsh & Cohen, Learning from Data with Bounded Inconsistency: Theoretical and Experimental Results 1994 1 CLTNLS Maass & Turan, How Fast Can a Threshold Gate Learn? 1994 1 CLTNLS Baum, When Are k-Nearest Neighbor and Backpropagation Accurate for Feasible-sized Sets of Examples? 1994 CMCHINA Wang, A Summary on Continuous Complexity Theory 1989 89 CMGA Fellows, The Robertson-Seymour Theorems: A Survey of Applications 1989 89 CMGA Hutchinson, On Genus-reducing and Planarizing Algorithms for Embedded Graphs 1989 89 CMGA Rosenberg, Interval Hypergraphs 1989 89 CMGA Manasse & McGeoch & Sleator, Competitive Algorithms for On-line Problems 1989 89 CMGA Basenspiler, On Recognizability of Planar Graphs 1989 89 CMGA Hobbs, Computing Edge-toughness and Fractional Arboricity 1989 89 CMGA Klein, Parallelism, Preprocessing, and Reachability 1989 89 CMGA Slater, A Summary of Results on Pair-connected Reliability 1996 27 CMJ Trachtenberg, The Game of Dreidel Made Fair 1996 27 CMJ Harkleroad, How Mathematicians Know What Computers Can't Do 1996 27 CMJ Reiter & Sonin, The ``Join the Club'' Interpretation of Some Graph Algorithms 1996 27 CMJ Grimaldi & Shier, Redundancy and Reliability of Communication Networks 1995 26 CMJ Schonefeld, Eigenpictures: Picturing the Eigenvector 1995 26 CMJ Henle, Forget Not the Lowly Spreadsheet 1995 26 CMJ Boston, A Taylor-made Plug for Wiles' Proof 1995 26 CMJ Simmonds, A New Look at an Old Function e^{i theta} 1992 23 CMJ Markowsky, Misconceptions about the Golden Ratio 1991 22 CMJ Gallian, The Mathematics of Identification Numbers 1991 22 CMJ Schattschneider, Counting It Twice 1990 21 CMJ Wilf, Self-esteem in Mathematicians 1990 21 CMJ Hersh, Let's Teach Philosophy of Mathematics! 1990 21 CMJ Gopen & Smith, What's an Assignment Like You Doing in a Course Like This?: Writing to Learn Mathematics 1990 21 CMJ Strang, Sums and Differences vs Integrals and Derivatives 1989 20 CMJ Price, Learning Mathematics Through Writing: Some Guidelines 1989 20 CMJ Kleiner, Evolution of the Function Concept: A Brief Survey 1989 20 CMJ Beineke, Are Graphs Finally Surfacing? 1989 20 CMJ Schoenfeld, The Curious Fate of an Applied Problem 1989 20 CMJ Trotter, On-Line Partitioning of Partially Ordered Sets 1996 58 CMPANDSTR Khan & Al-A'ali & Al-Shamlan, Simplification of Context-Free Grammar through Petri Net 1993 47 CMPANDSTR Sloan, A Fast Algorithm for Generating Constrained Delaunay Triangulations 1993 46 CMPANDSTR Souza & Gattass, A New Scheme for Mesh Generation and Mesh Refinement Using Graph Theory 1995 5 CMPCMPL Karchmer & Raz & Wigderson, Super-logarithmic Depth Lower Bounds via the Direct Sum in Communication Complexity 1995 5 CMPCMPL Raz, Fourier Analysis for Probabilistic Communication Complexity 1995 5 CMPCMPL Lickteig & Werther, How Can a Complex Square Root be Computed in an Optimal Way? 1995 5 CMPCMPL Maurer, On the Oracle Complexity of Factoring Integers 1995 5 CMPCMPL Sitharam, Pseudorandom Generators and Learning Algorithms for AC^0 1995 5 CMPCMPL Juedes, Weakly Complete Problems Are Not Rare 1995 5 CMPCMPL Hastad & Jukna & Pudlak, Top-Down Lower Bounds for Depth-Three Circuits 1995 5 CMPCMPL Fich & Kowaluk & Kutylowski & Lorys & Ragde, Retrieval of Scattered Information by EREW, CREW, and CRCW PRAMs 1995 5 CMPCMPL Hiltgen & Paterson, PI_k Mass Production and an Optimal Circuit for the Neciporuk Slice 1995 5 CMPCMPL Alvarez & Jenner, A Note on Logspace Optimization 1995 5 CMPCMPL Sitharam, Evaluating Spectral Norms for Constant Depth Circuits with Symmetric Gates 1995 5 CMPCMPL Littlestone & Long & Warmuth, On-line Learning of Linear Functions 1995 5 CMPCMPL Turan, On the Complexity of Planar Boolean Circuits 1995 5 CMPCMPL Chor & Shani, The Privacy of Dense Symmetric Functions 1995 5 CMPCMPL Alon & Feige & Wigderson & Zuckerman, Derandomized Graph Products 1995 5 CMPCMPL Ma & von zur Gathen, The Computational Complexity of Recognizing Permutation Functions 1994 4 CMPCMPL Nisan & Szegedy, On the Degree of Boolean Functions as Real Polynomials 1994 4 CMPCMPL Beigel, When Do Extra Majority Gates Help? Polylog(n) Majority Gates are Equivalent to One 1994 4 CMPCMPL Barrington & Straubing, Complex Polynomials and Circuit Lower Bounds for Modular Counting 1994 4 CMPCMPL Beigel, Perceptrons, PP, and the Polynomial Hierarchy 1994 4 CMPCMPL Beigel & Tarui, On ACC 1994 4 CMPCMPL Barrington & Beigel & Rudich, Representing Boolean Functions as Polynomials Modulo Composite Numbers 1994 4 CMPCMPL Therien, Circuits Constructed with MOD_q Gates Cannot Compute AND in Sublinear Size 1994 4 CMPCMPL Frieze & Teng, On the Complexity of Computing the Diameter of a Polytope 1994 4 CMPCMPL Condon, A Theory of Strict P-Completeness 1994 4 CMPCMPL Thierauf & Toda & Watanabe, On Closure Properties of GapP 1994 4 CMPCMPL Hemaspaandra & Ogihara & Toda, Space-efficient Recognition of Sparse Self-reducible Languages 1994 4 CMPCMPL Roy & Vorobjov, Finding Irreducible Components of some Real Transcendental Varieties 1994 4 CMPCMPL Petrank, The Hardness of Approximation: Gap Location 1994 4 CMPCMPL Feigenbaum & Fortnow & Lund & Spielman, The Power of Adaptiveness and Additional Queries in Random-Self-reductions 1994 4 CMPCMPL Bloch, Function-Algebraic Characterizations of log and polylog Parallel Time 1994 4 CMPCMPL Nisan, RL subseteq SC 1994 4 CMPCMPL Montana & Pardo & Recio, A Note on Rabin's Width of a Complete Proof 1994 4 CMPCMPL Bshouty & Hancock & Hellerstein & Karpinski, An Algorithm to Learn Read-Once Threshold Formulas, and Transformation between Learning Models 1994 4 CMPCMPL Grandjean, Invariance Properties of RAMs and Linear Time 1993 3 CMPCMPL Babai & Fortnow & Nisan & Wigderson, BPP Has Subexponential Time Simulations Unless EXPTIME Has Publishable Proofs 1993 3 CMPCMPL Bellare & Goldreich & Goldwasser, Randomness in Interactive Proofs 1993 3 CMPCMPL Peralta & Shoup, Primality Testing with Fewer Random Bits 1993 3 CMPCMPL Allender & Bruschi & Pighizzini, The Complexity of Computing Maximal Word Functions 1993 3 CMPCMPL Maass & Schnitger & Szemeredi & Turan, Two Tapes versus One for Off-line Turing Machines 1993 3 CMPCMPL von Braunmuhl & Gengler & Rettinger, The Alternation Hierarchy for Sublogarithmic Space is Infinite 1993 3 CMPCMPL Buhrmann & Spaan & Torenvliet, The Relative Power of Logspace and Polynomial Time Reductions 1993 3 CMPCMPL Ivanyos & Ronyai, Finding Maximal Orders in Semisimple Algebras over Q 1993 3 CMPCMPL Paterson & Zwick, Shallow Circuits and Concise Formulae for Multiple Addition and Multiplication 1993 3 CMPCMPL Condon, The Complexity of the Max Word Problem and the Power of One-Way Interactive Proof Systems 1993 3 CMPCMPL Pitassi & Beame & Impagliazzo, Exponential Lower Bounds for the Pigeonhole Principle 1993 3 CMPCMPL Canetti & Goldreich, Bounds on Tradeoffs between Randomness and Communication Complexity 1993 3 CMPCMPL Ranjan & Chari & Rohatgi, Improving Known Solutions Is Hard 1993 3 CMPCMPL Goldsmith & Joseph, Relativized Isomorphisms of NP-complete Sets 1993 3 CMPCMPL Borodin & Razborov & Smolensky, On Lower Bounds for Read-k-Times Branching Programs 1993 3 CMPCMPL Cook & Dymond, Parallel Pointer Machines 1993 3 CMPCMPL Caniglia & Cortinas & Danon & Heintz & Krick & Solerno, Algorithmic Aspects of Suslin's Proof of Serre's Conjecture 1993 3 CMPCMPL Giusti & Heintz & Sabia, On the Efficiency of Effective Nullstellensatze 1992 2 CMPCMPL Goldmann & Hastad & Razborov, Majority Gates vs. General Weighted Threshold Gates 1992 2 CMPCMPL Kobler & Schoning & Toran, Graph Isomorphism is Low for PP 1992 2 CMPCMPL Aurenhammer & Hagauer & Imrich, Cartesian Graph Factorization at Logarithmic Cost per Edge 1992 2 CMPCMPL Berkman & Matias & Vishkin, Randomized Range-Maxima in Nearly-Constant Parallel Time 1992 2 CMPCMPL Babai & Fortnow & Lund, Non-deterministic Exponential Time Has Two-Prover Interactive Protocols (Addendum) 1992 2 CMPCMPL von zur Gathen & Shoup, Computing Frobenius Maps and Factoring Polynomials 1992 2 CMPCMPL Ronyai, Algorithmic Properties of Maximal Orders in Simple Algebras over Q 1992 2 CMPCMPL Bshouty & Mansour & Schieber & Tiwari, Fast Exponentiation Using the Truncation Operation 1992 2 CMPCMPL Guimaraes & Gasarch & Purtilo, Selection Problems via M-ary Queries 1992 2 CMPCMPL Bellantoni & Cook, A New Recursion-Theoretic Characterization of the Polytime Functions 1992 2 CMPCMPL Coster & Joux & LaMacchia & Odlyzko & Schnorr & Stern, Improved Low-Density Subset Sum Algorithms 1992 2 CMPCMPL Shparlinski, A Deterministic Test for Permutation Polynomials 1992 2 CMPCMPL Grigor'ev & Vorobjov, Counting Connected Components of a Semialgebraic Set in Subexponential Time 1992 2 CMPCMPL Beigel & Feigenbaum, On Being Incoherent without Being Very Hard 1992 2 CMPCMPL Goldsmith & Hemachandra & Kunen, Polynomial-Time Compression 1992 2 CMPCMPL Lynch, The Quantifier Structure of Sentences that Characterize Nondeterministic Time Complexity 1992 2 CMPCMPL Shokrollahi, Efficient Randomized Generation of Optimal Algorithms for Multiplication in Certain Finite Fields 1991 1 CMPCMPL Heiman & Wigderson, Randomized vs. Deterministic Decision Tree Complexity for Read-Once Boolean Functions 1991 1 CMPCMPL McKenzie & Peladeau & Therien, NC^1: The Automata-Theoretic Viewpoint 1991 1 CMPCMPL von zur Gathen, Efficient and Optimal Exponentiation in Finite Fields 1991 1 CMPCMPL Eberly, Decompositions of Algebras over R and C 1991 1 CMPCMPL Baum, Existence and Efficient Construction of Fast Fourier Transforms on Supersolvable Groups 1991 1 CMPCMPL Hirsch, Lower Bounds for the Non-linear Complexity of Algebraic Computation Trees with Integer Inputs 1991 1 CMPCMPL Ko & Tzeng, Three Sigma_2^P-complete Problems in Computational Learning Theory 1991 1 CMPCMPL Hastad & Goldmann, On the Power of Small-Depth Threshold Circuits 1991 1 CMPCMPL Burgisser & Karpinski & Lickteig, Some Computational Problems in Linear Algebra as Hard as Matrix Multiplication 1991 1 CMPCMPL Shokrollahi, On the Rank of Certain Finite Fields 1991 1 CMPCMPL Eberly, Decomposition of Algebras over Finite Fields and Number Fields 1991 1 CMPCMPL von zur Gathen, Computational Complexity: An Editorial 1991 1 CMPCMPL Babai & Fortnow & Lund, Non-deterministic Exponential Time Has Two-Prover Interactive Protocols 1991 1 CMPCMPL Babai & Fortnow, Arithmetization: A New Method in Structural Complexity Theory 1991 1 CMPCMPL Borodin & Tiwari, On the Decidability of Sparse Univariate Polynomial Interpolation 1991 1 CMPCMPL Cleve, Towards Optimal Simulations of Formulas by Bounded-Width Programs 1993 6 CMPTGSYSTS McIlroy & Bostic & McIlroy, Engineering Radix Sort 1992 5 CMPTGSYSTS Moffat, Economical Inversion of Large Text Files 1992 5 CMPTGSYSTS Sakkkinen, A Critique of the Inheritance Principles of C++ 1991 4 CMPTGSYSTS Bentley & Kernighan, A System for Algorithm Animation 1990 3 CMPTGSYSTS Scott & LeBlanc & Marsh & Becker & Dubnicki & Markatos & Smithline, Implementation Issues for the Psyche Multiprocessor Operating System 1989 2 CMPTGSYSTS Stroustrup, The Evolution of C++: 1985 to 1989 1990 CMSDTF Cheeseman, On Finding the Most Probable Model 1991 CMUANNIV Bell, Three Decades of Multiprocessors 1991 CMUANNIV Leiserson, VLSI Theory and Parallel Supercomputing 1991 CMUANNIV Bentley, Tools for Experiments on Algorithms 1991 CMUANNIV Manna & Pnueli, Tools and Rules for the Practicing Verifier 1991 CMUANNIV Kung, Heterogeneous Multicomputers 1991 CMUANNIV Shafer, Why Can't We Model the Physical World? 1991 CMUANNIV Kanade, Computer Vision as a Physical Science 1991 CMUANNIV Rashid, Mach: A Case Study in Technology 1991 CMUANNIV Sutherland, Technology and Courage 1991 CMUANNIV Traub, What Is Scientifically Knowable? 1991 CMUANNIV Scott, Exploration with Mathematica 1977 CMUANNIV Meyer & Shamos, Time and Space 1990 CMWLC Beeson, Some Theories Conservative over Intuitionistic Arithmetic 1990 CMWLC Bellin, Ramsey Interpreted: A Parametric Version of Ramsey's Theorem 1990 CMWLC Brown, Notions of Closed Subsets of a Complete Separable Metric Space in Weak Subsystems of Second Order Arithmetic 1990 CMWLC Buchholz & Sieg, A Note on Polynomial Time Computable Arithmetic 1990 CMWLC Buss, Axiomatizations and Conservation Results for Fragments of Bounded Arithmetic 1990 CMWLC Clote, A Smash-based Hierarchy between PTIME and PSPACE 1990 CMWLC Feferman, Polymorphic Typed Lambda-Calculi in a Type-free Axiomatic Framework 1990 CMWLC Ferreira, Polynomial Time Computable Arithmetic 1990 CMWLC Goad, Metaprogramming in SIL 1990 CMWLC Hatzikiriakou & Simpson, WKL_0 and Orderings of Countable Abelian Groups 1990 CMWLC Hirst, Marriage Theorems and Reverse Mathematics 1990 CMWLC Leivant, Computationally Based Set Existence Principles 1990 CMWLC McAloon, Hierarchy Results for Mixed-Time 1990 CMWLC Nerode & Remmel, Polynomial Time Equivalence Types 1990 CMWLC Pfenning, Program Development through Proof Transformation 1990 CMWLC Statman, Some Models of Scott's Theory LCF Based on a Notion of Rate of Convergence 1990 CMWLC Takeuti, Sharply Bounded Arithmetic and the Function a monus 1 1990 CMWLC Yu, Radon-Nikodym Theorem is Equivalent to Arithmetical Comprehension 1992 24 CNISDN Gotzhein, Temporal Logic and Applications--A Tutorial 1991 22 CNISDN Vasilakos & Moschonas & Paximadis, Variable Window Flow Control and Ergodic Discretized Learning Algorithms for Adaptive Routing in Data Networks 1991 22 CNISDN van Dijk, Product Forms for Random Access Schemes 1991 21 CNISDN Belovich & Konangi, A Linear-Time Approximation Method for Computing the Reliability of a Network 1990 18 CNISDN Wong & Kang, Distributed and Fail-safe Routing Algorithms in Toroidal-based Metropolitan Area Networks 1989 16 CNISDN Garcia-Luna-Aceves, A Minimum-hop Routing Algorithm Based on Distributed Information 1989 16 CNISDN Cockburn, Tree-forming Reversible Routes in Communication Networks 1988 16 CNISDN Humblet & Soloway, Topology Broadcast Algorithms 1988 15 CNISDN Jaffe, Hierarchical Clustering with Topology Databases 1987 12 CNISDN Jaffe & Baratz & Segall, Subtle Design Issues in the Implementation of Distributed, Dynamic Routing Algorithms 1987 12 CNISDN Baratz & Jaffe, Establishing Virtual Circuits in Large Computer Networks 1992 CNOTES Beigel, Syllabus and Reading List for CS561 (on interactive proofs) 1991 CNOTES Blair, Notes on Cryptography 1989 CNOTES Leighton, Research Topics (18.436/6.849 Theory of Parallel and VLSI Computation) 1989 CNOTES Regan, On the Difficulty of Proving Intractability 1989 CNOTES Regan, comparison of Goedel's Theorem and the Recursion Theorem 1988 CNOTES Aggarwal & Wein, Computational Geometry: Lecture Notes for 18.409, Spring 1988 1988 CNOTES Gacs, Lecture Notes on Descriptional Complexity and Randomness 1988 CNOTES Shallit, CS 375: 29 Lectures on Number Theory and Algorithms 1987 CNOTES Goldschlager & Mayr & Ullman, Parallel Algorithms (?) 1985 CNOTES Sipser, Lecture Notes on Complexity Theory 1985 CNOTES Cook & Rackoff, Discrete Mathematics for Computer Science 1984 CNOTES Rabin, Algorithms 1984 CNOTES Rackoff, cryptography 1982 CNOTES Dobkin, Algorithms, VLSI, and Graphics 1978 CNOTES Pippenger, networks 1977 CNOTES Rabin, Probabilistic Algorithms 1977 CNOTES Fischer, Lectures on Network Complexity 1977 CNOTES Meyer, Chapter 11: Turing Machines 1975 CNOTES Pratt, Introduction to Algorithms 1975 CNOTES Fischer, circuits and complexity 1975 CNOTES Wand, Lectures on Induction and Recursion 1993 CNUMOPT Anstreicher & Ji & Potra & Ye, Average Performance of a Self-Dual Interior Point Algorithm 1993 CNUMOPT Bellare & Rogaway, The Complexity of Approximating a Nonlinear Program 1993 CNUMOPT Berman & Kovoor & Pardalos, Algorithms for the Least Distance Problem 1993 CNUMOPT Burke & Goldstein & Tseng & Ye, Translational Cuts for Convex Minimization 1993 CNUMOPT Cohen & Megiddo, Maximizing Concave Functions in Fixed Dimension 1993 CNUMOPT Du, Approximating the Steiner Minimum Tree 1993 CNUMOPT Friedman, The Complexity of Allocating Resources in Parallel: Upper and Lower Bounds 1993 CNUMOPT Griewank, Some Bounds on the Complexity of Gradients, Jacobians, and Hessians 1993 CNUMOPT Guisewite & Pardalos, Complexity Issues in Nonconvex Network Flow Problems 1993 CNUMOPT Guler, Complexity of Smooth Convex Programming and its Applications 1993 CNUMOPT Herrmann & Lee & Snowdon, A Classification of Static Scheduling Problems 1993 CNUMOPT Kamath & Karmarkar, An O(nL) Iteration Algorithm for Computing Bounds in Quadratic Optimization Problems 1993 CNUMOPT Lee & Vairaktarakis, Complexity of Single Machine Hierarchical Scheduling: A Survey 1993 CNUMOPT Paik & Sahni, Performance Driven Graph Enhancement Problems 1993 CNUMOPT Radhakrishnan & Hunt & Stearns, Efficient Algorithms for delta-Near Planar Graph and Algebraic Problem 1993 CNUMOPT Radzik, Parametric Flows, Weighted Means of Cuts, and Fractional Combinatorial Optimization 1993 CNUMOPT Rardin & Tovey & Pilcher, Analysis of a Random Cut Test Instance Generator for the TSP 1993 CNUMOPT Sanchis, Some Complexity Issues Involved in the Construction of Test Cases for NP-hard Problems 1993 CNUMOPT Toledo, Maximizing Non-Linear Concave Functions in Fixed Dimension 1993 CNUMOPT Tsay & Sikorski, A Note on the Complexity of Fixed-Point Computation for Noncontractive Maps 1993 CNUMOPT Vaidya & Atkinson, A Technique for Bounding the Number of Iterations in Path Following Algorithms 1993 CNUMOPT Vavasis, Polynomial Time Weak Approximation Algorithms for Quadratic Programming 1993 CNUMOPT Yu & Kouvelis, Complexity Results for a Class of Min-Max Problems with Robust Optimization Applications 1985 COBIBS Grotschel, Polyhedral Combinatorics 1985 COBIBS Nemhauser, Duality for Integer Optimization 1985 COBIBS Trotter, Discrete Packing and Covering 1985 COBIBS Lawler, Submodular Functions and Polymatroid Optimization 1985 COBIBS Papadimitriou, Computational Complexity 1985 COBIBS Karp & Lenstra & McDiarmid & Rinnooy Kan, Probabilistic Analysis 1985 COBIBS Maffioli & Speranza & Vercellis, Randomized Algorithms 1985 COBIBS Kindervater & Lenstra, Parallel Algorithms 1985 COBIBS Wong, Location and Network Design 1985 COBIBS Christofides, Vehicle Routing 1985 COBIBS Lenstra & Rinnooy Kan, Sequencing and Scheduling 1985 COBIBS Powell, Software 1996 2 COCOON Andrews & Goemans & Zhang, Improved Bounds for On-line Load Balancing 1996 2 COCOON Xue & Du, An O(n log n)-Average-Time Algorithm for Shortest Networks Under a Given Topology 1996 2 COCOON Hsu & Tsai & Wang & Lee, Steiner Problems on Directed Acyclic Graphs 1996 2 COCOON Karaivazoglou & Spirakis & Triantafilou, Wormhole Versus Deflection Routing: A Case Study on the Mesh 1996 2 COCOON Lefmann & Pudlak & Savicky, On Sparse Parity Check Matrices 1996 2 COCOON Chen & Cunha & Homer, Finding a Hidden Code by Asking Questions 1996 2 COCOON Dai & Flannery, Improved Length Lower Bounds for Reflecting Sequences 1996 2 COCOON Imai & Iwata & Sekine & Yoshida, Combinatorial and Geometric Approaches to Counting Problems on Linear Matroids, Graphic Arrangements, and Partial Orders 1996 2 COCOON Di Battista & Tamassia & Vismara, Output-Sensitive Reporting of Disjoint Paths 1996 2 COCOON Rahman & Nakano & Nishizeki, Rectangular Grid Drawing of Plane Graphs 1996 2 COCOON Shin & Kim & Chwa, Area-Efficient Algorithms for Upward Straight-Line Tree Drawings 1996 2 COCOON Aichholzer & Aurenhammer, Straight Skeletons for General Polygonal Figures in the Plane 1996 2 COCOON Allender, A Note on Uniform Circuit Lower Bounds for the Counting Hierarchy 1996 2 COCOON Hofmeister, A Note on the Simulation of Exponential Threshold Weights 1996 2 COCOON Grolmusz, Harmonic Analysis, Real Approximation, and the the Communication Complexity of Boolean Functions 1996 2 COCOON Calinescu & Fernandes, Finding Large Planar Subgraphs and Large Subgraphs of a Given Genus 1996 2 COCOON Shahrokhi & Shi, Efficient Deterministic Algorithms for Embedding Graphs on Books 1996 2 COCOON Hsu & Kao, Optimal Bi-Level Augmentation for Selectivity Enhancing Graph Connectivity with Applications 1996 2 COCOON Domingo, Exact Learning of Subclasses of CDNF Formulas with Membership Queries 1996 2 COCOON Teng, Fast Separator Decomposition for Finite-Element Meshes 1996 2 COCOON Bodlaender & de Fluiter, Reduction Algorithms for Constructing Solutions in Graphs with Small Treewidth 1996 2 COCOON Uehara & Chen & He, Fast RNC and NC Algorithms for Finding a Maximal Set of Paths with an Application 1996 2 COCOON Karkkainen & Ukkonen, Sparse Suffix Trees 1996 2 COCOON Yeh & Varvarigos, Depth-Efficient Threshold Circuits for Multiplication and Symmetric Function Computation 1996 2 COCOON Arvind, A Note on the Self-Witnessing Property of Computational Problems 1996 2 COCOON Kavvadias & Sideri, The Inverse Satisfiability Problem 1996 2 COCOON Hemaspaandra & Jiang & Rothe & Watanabe, The Join Can Lower Complexity 1996 2 COCOON Yong, On the Distribution of Eigenvalues of Graphs 1996 2 COCOON Grigni & Mirelli & Papadimitriou, On the Difficulty of Designing Good Classifiers 1996 2 COCOON Kumar & Russell & Sundaram, Approximating Latin Square Extensions 1996 2 COCOON Akutsu & Bao, Approximating Minimum Keys and Optimal Substructure Screens 1996 2 COCOON Belanger & Wang, Reductions and Covergence Rates of Average Time 1996 2 COCOON Yanbe & Sakurai, On the Complexity of Computational Problems Associated with Simple Stochastic Games 1996 2 COCOON Ibarra & Diniz & Rinard, On the Complexity of Commutativity Analysis 1996 2 COCOON Clementi & Trevisan, Improved Non-approximability Results for Vertex Cover Problems with Density Constraints 1996 2 COCOON Li & Tromp & Zhang, Some Notes on the Nearest Neighbour Interchange Distance 1996 2 COCOON Shanbhogue & Yung, Distributed Computing in Asynchronous Networks with Byzantine Edges 1996 2 COCOON Cho & Sahni, Weight Biased Leftist Trees and Modified Skip Lists 1996 2 COCOON Lau, Probabilistic Analysis of Local Search and NP-Completeness Result for Constraint Satisfaction 1996 2 COCOON Whitesides & Pei, On the Reconfiguration of Chains 1996 2 COCOON Tan & Zhu, Two-Guarding a Rectilinear Polygon 1996 2 COCOON Safavi-Naini, Three Systems for Shared Generation of Authenticators 1996 2 COCOON Lam & Ling & Hui, Efficient Generation of Elliptic Curve Cryptosystems 1996 2 COCOON Meng, Superconnectivity for Minimal Multi-loop Networks 1995 1 COCOON Zwick & Paterson, The Complexity of Mean Payoff Games 1995 1 COCOON Iwama & Miyazaki, Approximation of coNP Sets by NP-Complete Sets 1995 1 COCOON Feng & Cohen & Eades, How to Draw a Planar Clustered Graph 1995 1 COCOON Calamoneri & Petreschi, An Efficient Orthogonal Grid Drawing Algorithm for Cubic Graphs 1995 1 COCOON Cheng & Xu, Constrained Independence System and Triangulations of Planar Point Sets 1995 1 COCOON Wang & Zhu, Three Dimensional Weak Visibility: Complexity and Applications 1995 1 COCOON Kim, Rectangulating Rectilinear Polygons in Parallel 1995 1 COCOON Kamakoti & Krithivasan & Rangan, Efficient Randomized Incremental Algorithm for the Closest Pair Problem Using Leafary Trees 1995 1 COCOON Chan & van der Meyden, Testing Containment of Object-Oriented Conjunctive Queries Is Pi^p_2-Hard 1995 1 COCOON Zhang, Computing Infinite Relations Using Finite Expressions: a New Approach to the Safety Issue in Relational Databases 1995 1 COCOON Lim & Ng, Set-Term Unification in a Logic Database Language 1995 1 COCOON Wild, Computations with Finite Closure Systems and Implications 1995 1 COCOON Lingas, Maximum Tree-Packing in Time O(n^{5/2}) 1995 1 COCOON Shi & West, Optimal Algorithms for Finding Connected Components of an Unknown Graph 1995 1 COCOON Ganley & Golin & Salowe, The Multi-Weighted Spanning Tree Problem 1995 1 COCOON Chen, Algorithmic Graph Embeddings 1995 1 COCOON Agrawal & Egecioglu & El Abbadi, Analysis of Quorum-Based Protocols for Distributed (k+1)-Exclusion 1995 1 COCOON Lin & Orlowska, A Highly Fault-Tolerant Quorum Consensus Method for Managing Replicated Data 1995 1 COCOON Huang, Constructing Craig Interpolation Formulas 1995 1 COCOON Kawabe & Ishii, Currying of Order-Sorted Term Rewriting Systems 1995 1 COCOON Rengarajan & Veni Madhavan, Stack and Queue Number of 2-Trees 1995 1 COCOON Walley & Tan, Shortest Paths in Random Weighted Graphs 1995 1 COCOON Zhou & Nishizeki, Simple Reduction of f-Colorings in Edge-Colorings 1995 1 COCOON Hayase & Sadakane & Tani, Output-Size Sensitiveness of OBDD Construction Through Maximal Independent Set Problem 1995 1 COCOON Tromp & Zhang & Zhao, Small Weight Bases for Hamming Codes 1995 1 COCOON Cassaigne & Karhumaki, Toeplitz Words, Generalized Periodicity and Periodically Iterated Morphisms 1995 1 COCOON Barcucci & Del Lungo & Pergola & Pinzani, A Construction for Enumerating k-Coloured Motzkin Paths 1995 1 COCOON Oleshchuk, On Public-Key Cryptosystem Based on Church-Rosser String-Rewriting Systems 1995 1 COCOON Savage, Extending the Hong-Kung Model to Memory Hierarchies 1995 1 COCOON Cai & Chen, On Log-Time Alternating Turing Machines of Alternating Depth k 1995 1 COCOON Kurosawa & Kageyama, New Bound for Affine Resolvable Designs and Its Application to Authentication Codes 1995 1 COCOON Lubachevsky & Graham, Dense Packings of 3k(k+1)+1 Equal Disks in a Circle for k = 1, 2, 3, 4, and 5 1995 1 COCOON Diaz & Gibbons & Pantziou & Serna & Spirakis & Toran, Efficient Parallel Algorithms for Some Tree Layout Problems 1995 1 COCOON Han & Shen, Conservative Algorithms for Parallel and Sequential Integer Sorting 1995 1 COCOON Chen, An Optimal Algorithm for Proper Learning of Unions of Two Rectangles with Queries 1995 1 COCOON Chen, Disjunctions of Negated Counting Functions Are Efficiently Learnable with Equivalence Queries 1995 1 COCOON Wu, Non-Empty Cross-3-Intersection Theorems of Subsets 1995 1 COCOON Yu, Convexity of Minimal Total Dominating Functions in Graphs 1995 1 COCOON Duparc & Rolland, Transformations for Maximal Planar Graphs with Minimum Degree Five 1995 1 COCOON You & Wang, An Asynchronous Parallel Method for Linear Systems 1995 1 COCOON Zhang, On a Kind of Sequence of Polynomials 1995 1 COCOON Meng, Hamiltonian Cycles in 2-Generated Cayley Digraphs of Abelian Groups 1995 1 COCOON Xu & Lu, Pandiagonal Magic Squares 1995 1 COCOON Wang & You, PFFM and Quasi-Morishima Matrices 1995 1 COCOON Chang & Chang & Liu & Lam & Wang, Edge-Face Total Chromatic Number of Outerplanar Graphs with Delta(G)=6 1995 1 COCOON Schuler & Yamakami, Sets Computable in Polynomial Time on Average 1995 1 COCOON Belanger & Wang, Rankable Distributions Do Not Provide Harder Instances Than Uniform Distributions 1995 1 COCOON Kobayashi, Transformations That Preserve Malignness of Universal Distributions 1995 1 COCOON Hemaspaandra & Rothe, Intersection Suffices for Boolean Hierarchy Equivalence 1995 1 COCOON Kelley & Wan & Yang, A 3/2 log 3-Competitive Algorithm for the Counterfeit Coin Problem 1995 1 COCOON Carlsson & Chen, Searching Rigid Data Structures 1995 1 COCOON Yang, A Better Subgraph of the Minimum Weight Triangulation 1995 1 COCOON Gao & Yin, Sequence Decomposition Method for Computing a Grobner Basis and Its Application to Bivariate Splines 1995 1 COCOON Bai & Yamakawa & Ebara & Nakano, A Broadcasting Algorithm on the Arrangement Graph 1995 1 COCOON Shiau & Yang, A Fast Maximum Finding Algorithm on Broadcast Communication 1995 1 COCOON Shastri, Broadcasting in General Networks I: Trees 1995 1 COCOON Chern & Tuan & Jwo, Uni-Directional Alternating Group Graphs 1995 1 COCOON Sakurai, On Separating Proofs of Knowledge from Proofs of Membership of Language and Its Application to Secure Identification Schemes 1995 1 COCOON Krumke & Noltemeier & Ravi & Marathe, Compact Location Problems with Budget and Communication Constraints 1995 1 COCOON Cheng & Kaminski & Zaks, Minimum Dominating Sets of Intervals on Lines 1995 1 COCOON Choi & Lam, Two-Dimensional Pattern Matching on a Dynamic Library of Texts 1995 1 COCOON Crescenzi & Kann & Silvestri & Trevisan, Structure in Approximation Classes 1995 1 COCOON Peinado, Improved Lower Bounds for the Randomized Boppana-Halldorsson Algorithm for MAXCLIQUE 1995 1 COCOON Cheng & Zhu, MNP: A Class of NP Optimization Problems 1995 1 COCOON Bacik & Mahajan, Semidefinite Programming and Its Applications to NP Problems 1995 1 COCOON Hui & Lam, Analysis and Experimentation on List Update Algorithms 1995 1 COCOON Khoury & Pardalos, An Exact Branch and Bound Algorithm for the Steiner Problem in Graphs 1995 1 COCOON Huang & Li & Lu & Zhang, A Physical Model for the Satisfiability Problem 1995 1 COCOON Kim & McNaughton, An Efficient Algorithm for Local Testability Problem of Finite State Automata 1995 1 COCOON Yu & Yung, Scheduling Task-Tree with Additive Scales on Parallel/Distributed Machines 1995 1 COCOON Chan & Young, Single-Vehicle Scheduling Problem on a Straight Line with Time Window Constraints 1995 1 COCOON Li & Shi, An On-Line Algorithm for Some Uniform Processor Scheduling 1995 1 COCOON Jeavons & Cohen, An Algebraic Characterization of Tractable Constraints 1995 1 COCOON Ding & Qing & Song, Limit Property of Unbalanced Development in Economic Network 1995 1 COCOON Wood, Document Processing, Theory, and Practice 1995 1 COCOON Jiang, Matching and Comparing Sequences in Molecular Biology 1995 1 COCOON Vazirani, Primal-Dual Schema Based Approximation Algorithms 1989 3 CODTA Tietavainen, Codes and Character Sums 1989 3 CODTA Harari, A New Authentication Algorithm 1989 3 CODTA Stern, A Method for Finding Codewords of Small Weight 1989 3 CODTA Ghafoor & Sole, Covering in Hypercubes 1995 8 COLT Valiant, Rationality 1995 8 COLT Sejnowski & Dayan & Montague, Predictive Hebbian Learning 1995 8 COLT Kearns & Mansour & Ng & Ron, An Experimental and Theoretical Comparison of Model Selection Methods 1995 8 COLT Ron & Singer & Tishby, On the Learnability and Usage of Acyclic Probabilistic Finite Automata 1995 8 COLT Freund & Ron, Learning to Model Sequences Generated by Switching Distributions 1995 8 COLT Vovk, A Game of Prediction with Expert Advice 1995 8 COLT Helmbold & Schapire, Predicting Nearly as well as the Best Pruning of a Decision Tree 1995 8 COLT Helmbold & Schapire & Singer & Warmuth, A Comparison of New and Old Algorithms for a Mixture Estimation Problem 1995 8 COLT Bshouty, A Note on Learning Multivariate Polynomials under the Uniform Distribution 1995 8 COLT Yamanishi, Randomized Approximate Aggregating Strategies and Their Applications to Prediction and Discrimination 1995 8 COLT Mitina & Vereshchagin, How to Use Expert Advice in the Case when Actual Values of Estimated Events Remain Unknown 1995 8 COLT Blum & Chalasani & Goldman & Slonim, Learning With Unreliable Boundary Queries 1995 8 COLT Hegedus, Generalized Teaching Dimensions and the Query Complexity of Learning 1995 8 COLT Bshouty & Jackson, Learning DNF over the Uniform Distribution Using a Quantum Example Oracle 1995 8 COLT Lin, Reducing the Number of Queries in Self-Directed Learning 1995 8 COLT Ben-David & Eiron & Kushilevitz, On Self-Directed Learning 1995 8 COLT Rivest & Yin, Being Taught can be Faster than Asking Questions 1995 8 COLT Gasarch & Hird, Reductions for Learning via Queries 1995 8 COLT Stephan, Learning via Queries and Oracles 1995 8 COLT Apsitis & Freivalds & Smith, On the Inductive Inference of Real Valued Functions 1995 8 COLT Cenzer & Moser, Inductive Inference of Functions on the Rationals 1995 8 COLT Kinber & Stephan, Language Learning from Texts: Mind Changes, Limited Memory and Monotonicity 1995 8 COLT Bshouty & Tamon & Wilson, On Learning Decision Trees with Large Output Domains 1995 8 COLT Bshouty & Chen & Decatur & Homer, On the Learnability of Z_N-DNF Formulas 1995 8 COLT Sakai & Takimoto & Maruoka, Proper Learning Algorithm for Functions of k Terms under Smooth Distributions 1995 8 COLT Nakamura & Abe, On-line Learning of Binary and n-ary Relations over Multi-dimensional Clusters 1995 8 COLT Mathias, DNF -- If You Can't Learn 'em, Teach 'em: An Interactive Model of Teaching 1995 8 COLT Baum & Boneh & Garrett, On Genetic Algorithms 1995 8 COLT Kim & Roche, On the Optimal Capacity of Binary Neural Networks: Rigorous Combinatorial Approaches 1995 8 COLT Klasner & Simon, From Noise-Free to Noise-Tolerant and from On-line to Batch Learning 1995 8 COLT Shawe-Taylor, Sample Sizes for Sigmoidal Neural Networks 1995 8 COLT Blackmore & Williamson & Mareels & Sethares, Online Learning via Congregational Gradient Descent 1995 8 COLT Wang & Venkatesh, Criteria for Specifying Machine Complexity in Learning 1995 8 COLT Saul & Singh, Markov Decision Processes in Large State Spaces 1995 8 COLT Kivinen & Warmuth, The Perceptron Algorithm vs. Winnow: Linear vs. Logarithmic Mistake Bounds when Few Input Variables are Relevant 1995 8 COLT Kang & Oh, Learning by a Population of Perceptrons 1995 8 COLT Khardon & Roth, Learning to Reason with a Restricted View 1995 8 COLT Baxter, Learning Internal Representations 1995 8 COLT Awerbuch & Betke & Rivest & Singh, Piecemeal Graph Exploration by a Mobile Robot 1995 8 COLT Dobkin & Gunopulos, Concept Learning with Geometric Hypotheses 1995 8 COLT Fischer, More or Less Efficient Agnostic Learning of Convex Polygons 1995 8 COLT Bshouty & Goldman & Mathias, Noise-Tolerant Parallel Learning of Geometric Concepts 1995 8 COLT Decatur & Gennaro, On Learning from Noisy and Incomplete Examples 1995 8 COLT Ergun & Kumar & Rubinfeld, On Learning Bounded-Width Branching Programs 1995 8 COLT Lee & Bartlett & Williamson, On Efficient Agnostic Learning of Linear Combinations of Basis Functions 1995 8 COLT Schuurmans & Greiner, Sequential PAC Learning 1995 8 COLT Perrone & Blais, Regression NSS: An Alternative to Cross Validation 1995 8 COLT Bartlett & Long, More Theorems about Scale-sensitive Dimensions and Learning 1995 8 COLT Haussler & Opper, General Bounds on the Mutual Information Between a Parameter and n Conditionally Independent Observations 1995 8 COLT Ratsaby & Venkatesh, Learning from a Mixture of Labeled and Unlabeled Examples with Parametric Side Information 1995 8 COLT Boneh, Learning Using Group Representations 1995 8 COLT Ron & Rubinfeld, Exactly Learning Automata with Small Cover Time 1995 8 COLT Aslam & Decatur, Specification and Simulation of Statistical Query Algorithms for Efficiency and Noise Tolerance 1995 8 COLT Bshouty, Simple Learning Algorithms Using Divide and Conquer 1995 8 COLT Ben-David & Gurvits, A Note on VC-Dimension and Measure of Sets of Reals 1995 8 COLT Cohen & Hirsh, Corrigendum for ``Learnability of Description Logics'' 1994 7 COLT Muggleton, Recent Advances in Inductive Logic Programming 1994 7 COLT Pereira, Frequencies vs Biases: Machine Learning Problems in Natural Language Processing 1994 7 COLT Jordan, A Statistical Approach to Decision Tree Modeling 1994 7 COLT Frazier & Pitt, Classic Learning 1994 7 COLT Ron & Singer & Tishby, Learning Probabilistic Automata with Variable Memory Length 1994 7 COLT DasGupta & Siegelmann & Sontag, On a Learnability Question Associated to Neural Networks with Continuous Activations 1994 7 COLT Angluin & Krikis, Learning with Malicious Membership Queries and Exceptions 1994 7 COLT Maass, Efficient Agnostic PAC-Learning with Simple Hypotheses 1994 7 COLT Haussler & Kearns & Seung & Tishby, Rigorous Learning Curve Bounds from Statistical Mechanics 1994 7 COLT Fiechter, Efficient Reinforcement Learning 1994 7 COLT Vovk, An Optimal-Control Application of Two Paradigms of On-Line Learning 1994 7 COLT Blum & Khardon & Kushilevitz & Pitt & Roth, On Learning Read-k-Satisfy-j DNF 1994 7 COLT Pillaipakkamnatt & Raghavan, On the Limits of Proper Learnability of Subclasses of DNF Formulas 1994 7 COLT Bshouty & Cleve & Kannan & Tamon, Oracles and Queries that are Sufficient for Exact Learning 1994 7 COLT Burago, Learning Structurally Reversible Context-Free Grammars from Queries and Counterexamples in Polynomial Time 1994 7 COLT Gillman & Sipser, Inference and Minimization of Hidden Markov Chains 1994 7 COLT Kilian & Lang & Pearlmutter, Playing the Matching-Shoulders Lob-Pass Game with Logarithmic Regret 1994 7 COLT Sakai & Maruoka, Learning Monotone Log-Term DNF Formulas 1994 7 COLT Yamanishi, The Minimum L-Complexity Algorithm and Its Applications to Learning Non-Parametric Rules 1994 7 COLT Chung, Approximate Methods for Sequential Decision Making Using Expert Advice 1994 7 COLT Freivalds & Karpinski & Smith, Co-Learning of Total Recursive Functions 1994 7 COLT Goldberg & Goldman & Mathias, Learning Unions of Boxes with Membership and Equivalence Queries 1994 7 COLT Balcazar & Diaz & Gavalda & Watanabe, An Optimal Parallel Algorithm for Learning DFA 1994 7 COLT Chen & Homer, On Learning Counting Functions with Queries 1994 7 COLT Hegedus, Geometrical Concept Learning and Convex Polytopes 1994 7 COLT Sloan & Turan, Learning with Queries but Incomplete Information 1994 7 COLT Goldberg & Goldman, Learning One-Dimensional Geometric Patterns Under One-Sided Random Misclassification Noise 1994 7 COLT Lange, The Representation of Recursive Languages and its Impact on the Efficiency of Learning 1994 7 COLT Kummer, The Strength of Noninclusions for Teams of Finite Learners 1994 7 COLT Jain & Sharma, On the Intrinsic Complexity of Language Identification 1994 7 COLT Kummer & Stephan, Inclusion Problems in Parallel Learning and Games 1994 7 COLT Bartlett & Long & Williamson, Fat-Shattering and the Learnability of Real-Valued Functions 1994 7 COLT Bshouty & Bshouty, On Learning Arithmetic Read-Once Formulas with Exponentiation 1994 7 COLT Bartlett & Fischer & Hoffgen, Exploiting Random Walks for Learning 1994 7 COLT Frazier & Goldman & Mishra & Pitt, Learning from a Consistently Ignorant Teacher 1994 7 COLT Bylander, Learning Linear Threshold Functions in the Presence of Classification Noise 1994 7 COLT Koiran, Efficient Learning of Continuous Neural Networks 1994 7 COLT Kwon & Kang & Oh, Generalization in Partially Connected Layered Neural Networks 1994 7 COLT Lee & Bartlett & Williamson, Lower Bounds on the VC-Dimension of Smoothly Parametrized Function Classes 1993 6 COLT Grefenstette, Genetic Algorithms and Machine Learning 1993 6 COLT Hinton & van Camp, Keeping Neural Networks Simple by Minimizing the Description Length of the Weights 1993 6 COLT Schapire & Sellie, Learning Sparse Multivariate Polynomials over a Field with Queries and Counterexamples 1993 6 COLT Raghavan & Wilkins, Learning mu-Branching Programs with Queries 1993 6 COLT Berggren, Linear Time Deterministic Learning of k-term DNF 1993 6 COLT Bshouty & Goldman & Hancock & Matar, Asking Questions to Minimize Errors 1993 6 COLT Downey & Evans & Fellows, Parameterized Learning Complexity 1993 6 COLT Kannan, On the Query Complexity of Learning 1993 6 COLT Goldman & Mathias, Teaching a Smarter Learner 1993 6 COLT Hoffgen, Learning and Robust Learning of Product Distributions 1993 6 COLT Laird & Saul & Dunning, A Model of Sequence Extrapolation 1993 6 COLT Yamanishi, On Polynomial-Time Probably Almost Discriminative Learnability 1993 6 COLT Kearns & Seung, Learning from a Population of Hypotheses 1993 6 COLT Kulkarni & Zeitouni, On Probably Correct Classification of Concepts 1993 6 COLT Kummer & Stephan, On the Structure of Degrees of Inferability 1993 6 COLT Lange & Zeugmann, Language Learning in Dependence on the Space of Hypotheses 1993 6 COLT Kilian & Siegelmann, On the Power of Sigmoid Neural Networks 1993 6 COLT Bartlett, Lower Bounds on the Vapnik-Chervonenkis Dimension of Multi-layer Threshold Networks 1993 6 COLT Golea & Marchand, Average Case Analysis of the Clipped Hebb Rule for Nonoverlapping Perceptron Networks 1993 6 COLT Anthony & Holden, On the Power of Polynomial Discriminators and Radial Basis Function Networks 1993 6 COLT Freivalds & Kinber & Smith, On the Impact of Forgetting on Learning Machines 1993 6 COLT Kinber & Smith & Velauthapillai & Wiehagen, On Learning Multiple Concepts in Parallel 1993 6 COLT Daley & Kalyanasundaram, Capabilities of Probabilistic Learners with Bounded Mind Changes 1993 6 COLT Jain & Sharma, Probability is More Powerful than Team for Language Identification from Positive Data 1993 6 COLT Daley & Kalyanasundaram & Velauthapillai, Capabilities of Fallible FINite Learning 1993 6 COLT Ben-David & Jacovi, On Learning in the Limit and Non-Uniform (epsilon, delta)-Learning 1993 6 COLT Ron & Rubinfeld, Learning Fallible Finite State Automata 1993 6 COLT Yokomori, Learning Two-Tape Automata from Queries and Counterexamples 1993 6 COLT Brazma, Efficient Identification of Regular Expressions from Representative Examples 1993 6 COLT Chen, Learning Unions of Two Rectangles in the Plane with Equivalence Queries 1993 6 COLT Auer, On-line Learning of Rectangles in Noisy Environments 1993 6 COLT Decatur, Statistical Queries and Faulty PAC Oracles 1993 6 COLT Evans & Rajagopalan & Vazirani, Choosing a Reliable Hypothesis 1993 6 COLT Betke & Rivest & Singh, Piecemeal Learning of an Unknown Environment 1993 6 COLT Ben-David & Dichterman, Learning with Restricted Focus of Attention 1993 6 COLT Bylander, Polynomial Learnability of Linear Threshold Approximations 1993 6 COLT Darken & Donahue & Gurvits & Sontag, Rate of Approximation Results Motivated by Robust Neural Network Learning 1993 6 COLT Fang & Venkatesh, On the Average Tractability of Binary Integer Programming and the Curious Transition to Perfect Generalization in Learning Majority Functions 1993 6 COLT Kushilevitz & Roth, On Learning Visual Concepts and DNF Formulae 1993 6 COLT Ben-David & Lindenbaum, Localization vs. Identification of Semi-Algebraic Sets 1993 6 COLT Blum & Chalasani & Jackson, On Learning Embedded Symmetric Concepts 1993 6 COLT Boneh & Lipton, Amplification of Weak Learning Under the Uniform Distribution 1993 6 COLT Hancock, Learning k mu Decision Trees on the Uniform Distribution 1993 6 COLT Goldberg & Jerrum, Bounding the Vapnik-Chervonenkis Dimension of Concept Classes Parameterized by Real Numbers 1993 6 COLT Natarajan, Occam's Razor for Functions 1993 6 COLT Takimoto & Maruoka, Conservativeness and Monotonicity for Learning Algorithms 1993 6 COLT Turan, Lower Bounds for PAC Learning with Queries 1993 6 COLT Auer & Long & Maass & Woeginger, On the Complexity of Function Learning 1993 6 COLT Simon, General Bounds on the Number of Examples Needed for Learning Probabilistic Concepts 1993 6 COLT Littlestone & Long, On-line Learning with Linear Loss Constraints 1993 6 COLT Abe & Takeuchi, The `Lob-Pass' Problem and an On-Line Learning Model of Rational Choice 1993 6 COLT Cesa-Bianchi & Long & Warmuth, Worst-case Quadratic Loss Bounds for a Generalization of the Widrow-Hoff Rule 1993 6 COLT Posner & Kulkarni, On-line Learning of Functions of Bounded Variation Under Various Sampling Schemes 1993 6 COLT Kabashima & Shinomoto, Acceleration of Learning in Binary Choice Problems 1993 6 COLT Goldman & Warmuth, Learning Binary Relations Using Weighted Majority Voting 1992 5 COLT Bshouty & Hancock & Hellerstein, Learning Boolean Read-Once Formulas with Arbitrary Symmetric and Constant Fan-in Gates 1992 5 COLT Chen & Maass, On-line Learning of Rectangles 1992 5 COLT Kharitonov, Cryptographic Lower Bounds on Learnability of Boolean Functions on the Uniform Distribution 1992 5 COLT Kivinen & Mannila & Ukkonen, Learning Hierarchical Rule Sets 1992 5 COLT Lang, Random DFA's can be Approximately Learned from Sparse Uniform Examples 1992 5 COLT Mansour, An O(n^log log n) Learning Algorithm for DNF under the Uniform Distribution 1992 5 COLT Bellare, A Technique for Upper Bounding the Spectral Norm with Applications to Learning 1992 5 COLT Aizenstein & Pitt, Exact Learning of Read-k Disjoint DNF and Not-So-Disjoint DNF 1992 5 COLT Goldman & Mathias, Learning k-Term DNF Formulas with an Incomplete Membership Oracle 1992 5 COLT Flammini & Marchetti-Spaccamela & Kucera, Learning DNF Formulae under Classes of Probability Distributions 1992 5 COLT Venkatesh & Snapp & Psaltis, BELLMAN STRIKES AGAIN! The Growth Rate of Sample Complexity with Dimension for the Nearest Neighbor Classifier 1992 5 COLT Lin & Vitter, A Theory for Memory-Based Learning 1992 5 COLT Cohen & Hirsh, Learnability of Description Logics 1992 5 COLT Dzeroski & Muggleton & Russell, PAC-Learnability of Determinate Logic Programs 1992 5 COLT Arimura & Ishizaka & Shinohara, Polynomial Time Inference of A Subclass of Context-free Transformations 1992 5 COLT Boser & Guyon & Vapnik, A Training Algorithm for Optimal Margin Classifiers 1992 5 COLT Kimber & Long, The Learning Complexity of Smooth Functions of a Single Variable 1992 5 COLT Bernstein, Absolute Error Bounds for Learning Linear Functions Online 1992 5 COLT Yamanishi, Probably Almost Discriminative Learning 1992 5 COLT Kulkarni & Mitter & Tsitsiklis & Zeitouni, PAC Learning with Generalized Samples and an Application to Stochastic Geometry 1992 5 COLT Cholak & Downey & Fortnow & Gasarch & Kinber & Kummer & Kurtz & Slaman, Degrees of Inferability 1992 5 COLT Case & Jain & Sharma, On Learning Limiting Programs 1992 5 COLT Daley & Kalyanasundaram & Velauthapillai, Breaking the Probability 1/2 Barrier in FIN-Type Learning 1992 5 COLT Jantke, Case Based Learning in Inductive Inference 1992 5 COLT Wiehagen & Smith, Generalization versus Classification 1992 5 COLT Blum & Chalasani, Learning Switching Concepts 1992 5 COLT Bartlett, Learning with a Slowly Changing Distribution 1992 5 COLT Benedek & Itai, Dominating Distributions and Learnability 1992 5 COLT Bertoni & Campadelli & Morpurgo & Panizza, Polynomial Uniform Convergence and Polynomial-sample Learnability 1992 5 COLT Buescher & Kumar, Learning Stochastic Functions by Smooth Simultaneous Estimation 1992 5 COLT Meir & Fontanari, On Learning Noisy Threshold Functions with Finite Precision Weights 1992 5 COLT Seung & Opper & Sompolinsky, Query by Committee 1992 5 COLT Sakakibara & Siromoney, A Noise Model on Learning Sets of Strings 1992 5 COLT Kapur & Bilardi, Language Learning from Stochastic Input 1992 5 COLT Anthony & Brightwell & Cohen & Shawe-Taylor, On Exact Specification by Examples 1992 5 COLT Jackson & Tomkins, A Computational Model of Teaching 1992 5 COLT Romanik, Approximate Testing and Learnability 1992 5 COLT Ben-David & Cesa-Bianchi & Long, Characterizations of Learnability for Classes of {0,...,n}-valued Functions 1992 5 COLT Kearns & Schapire & Sellie, Toward Efficient Agnostic Learning 1992 5 COLT Anoulova & Fischer & Polt & Simon, PAB-Decisions for Boolean and Real-Valued Features 1992 5 COLT Freivalds & Smith, On the Role of Procrastination for Machine Learning 1992 5 COLT Lange & Zeugmann, Types of Monotonic Language Learning and Their Characterization 1992 5 COLT Freund, An Improved Boosting Algorithm and its Implications on Learning Complexity 1992 5 COLT Helmbold & Warmuth, Some Weak Learning Results 1992 5 COLT Merhav & Feder, Universal Sequential Learning and Decision from Individual Data Sequences 1992 5 COLT Hoffgen & Simon, Robust Trainability of Single Neurons 1992 5 COLT Siegelmann & Sontag, On the Computational Power of Neural Nets 1992 5 COLT Sloan, Corrigendum to Types of Noise in Data for Concept Learning 1991 4 COLT Brooks, The Role of Learning in Autonomous Robots 1991 4 COLT Helmbold & Long, Tracking Drifting Concepts Using Random Examples 1991 4 COLT Bartlett & Williamson, Investigating the Distribution Assumptions in the Pac Learning Model 1991 4 COLT Buescher & Kumar, Simultaneous Learning of Concepts and Simultaneous Estimation of Probabilities 1991 4 COLT Kim, Learning by Smoothing: A Morphological Approach 1991 4 COLT Haussler & Kearns & Schapire, Bounds on the Sample Complexity of Bayesian Learning Using Information Theory and the VC Dimension 1991 4 COLT Opper & Haussler, Calculation of the Learning Curve of Bayes Optimal Classification Algorithm for Learning a Perceptron With Noise 1991 4 COLT Fischer & Polt & Simon, Probably Almost Bayes Decisions 1991 4 COLT Cover, Generalization and Learning 1991 4 COLT Roychowdhury & Siu & Orlitsky & Kailath, A Geometric Approach to Threshold Circuit Complexity 1991 4 COLT Seung & Sompolinsky & Tishby, Learning Curves in Large Neural Networks 1991 4 COLT Maler & Pnueli, On the Learnability of Infinitary Regular Sets 1991 4 COLT Angluin & Slonim, Learning Monotone DNF with an Incomplete Membership Oracle 1991 4 COLT Littlestone, Redundant Noisy Attributes, Attribute Errors, and Linear-threshold Learning Using Winnow 1991 4 COLT Blum & Hellerstein & Littlestone, Learning in the Presence of Finitely or Infinitely Many Irrelevant Attributes (Extended Abstract) 1991 4 COLT Maass, On-line Learning with an Oblivious Environment and the Power of Randomization 1991 4 COLT Hancock & Mansour, Learning Monotone k mu DNF Formulas on Product Distributions 1991 4 COLT Schapire, Learning Probabilistic Read-once Formulas on Product Distributions 1991 4 COLT Hancock, Learning 2 mu DNF Formulas and k mu Decision Trees 1991 4 COLT Yokomori, Polynomial-Time Learning of Very Simple Grammars from Positive Data 1991 4 COLT Daley & Pitt & Velauthapillai & Will, Relations Between Probabilistic and Team One-Shot Learners (extended abstract) 1991 4 COLT Barron, Approximation and Estimation Bounds for Artificial Neural Networks 1991 4 COLT Ji & Psaltis, The VC-Dimension vs. the Statistical Capacity for Two Layer Networks with Binary Weights 1991 4 COLT Venkatesh, On Learning Binary Weights for Majority Functions 1991 4 COLT Nobel, Evaluating the Performance of a Simple Inductive Procedure in the Presence of Overfitting Error 1991 4 COLT Abe & Takeuchi & Warmuth, Polynomial Learnability of Probabilistic Concepts with respect to the Kullback-Leibler Divergence 1991 4 COLT Yamanishi, A Loss Bound Model for On-Line Stochastic Prediction Strategies 1991 4 COLT Goldman & Kearns, On the Complexity of Teaching 1991 4 COLT Furst & Jackson & Smith, Improved Learning of AC^0 Functions 1991 4 COLT Hancock & Hellerstein, Learning Read-Once Formulas over Fields and Extended Bases 1991 4 COLT Bultman & Maass, Fast Identification of Geometric Objects with Membership Queries 1991 4 COLT Raghavan, Bounded Degree Graph Inference from Walks 1991 4 COLT Jiang & Li, On the Complexity of Learning Strings and Sequences 1991 4 COLT Motoki & Shinohara & Wright, The Correct Definition of Finite Elasticity: Corrigendum to Identification of Unions 1991 4 COLT Slaman & Solovay, When Oracles Do Not Help 1990 3 COLT Hancock, Identifying mu-Formula Decision Trees with Queries 1990 3 COLT Raghavan & Schach, Learning Switch Configurations 1990 3 COLT Abe & Warmuth, On the Computational Complexity of Approximating Distributions by Probabilistic Automata 1990 3 COLT Yamanishi, A Learning Criterion for Stochastic Rules 1990 3 COLT Ko, On the Complexity of Learning Minimum Time-Bounded Turing Machines 1990 3 COLT Shinohara, Inductive Inference from Positive Data is Powerful 1990 3 COLT Wright, Inductive Identification of Pattern Languages with Restricted Substitutions 1990 3 COLT Schapire, Pattern Languages Are Not Learnable 1990 3 COLT Fischer & Simon, On Learning Ring-Sum-Expansions 1990 3 COLT Blum & Singh, Learning Functions of k Terms 1990 3 COLT Eisenberg & Rivest, On the Sample Complexity of Pac-Learning Using Random and Chosen Examples 1990 3 COLT Jain & Sharma, Finite Learning by a ``Team'' 1990 3 COLT Kinber, Some Problems of Learning with an Oracle 1990 3 COLT Osherson & Stob & Weinstein, A Mechanical Method of Successful Scientific Inquiry 1990 3 COLT Freund, Boosting a Weak Learning Algorithm by Majority 1990 3 COLT Goldman & Kearns & Schapire, On the Sample Complexity of Weak Learning 1990 3 COLT Ben-David & Itai & Kushilevitz, Learning by Distances 1990 3 COLT Anthony & Biggs & Shawe-Taylor, The Learnability of Formal Concepts 1990 3 COLT Baum, Polynomial Time Algorithms for Learning Neural Nets 1990 3 COLT Long & Warmuth, Composite Geometric Concepts and Polynomial Predictability 1990 3 COLT Helmbold & Sloan & Warmuth, Learning Integer Lattices 1990 3 COLT Simon, On the Number of Examples and Stages Needed for Learning Decision Trees 1990 3 COLT Verbeurgt, Learning DNF under the Uniform Distribution in Quasi-Polynomial Time 1990 3 COLT Kinber & Gasarch & Zeugmann & Pleszkoch & Smith, Learning via Queries with Teams and Anomalies 1990 3 COLT Gasarch & Pleszkoch & Solovay, Learning via Queries in [+, <] 1990 3 COLT Orponen & Greiner, On the Sample Complexity of Finding Good Search Strategies 1990 3 COLT Aslam & Rivest, Inferring Graphs from Walks 1990 3 COLT Vovk, Aggregating Strategies 1989 2 COLT Vapnik, Inductive Principles of the Search for Empirical Dependences (Methods based on Weak Convergence of Probability Measures) 1989 2 COLT Abe, Polynomial Learnability of Semilinear Sets 1989 2 COLT Helmbold & Sloan & Warmuth, Learning Nested Differences of Intersection-Closed Concept Classes 1989 2 COLT Kearns & Pitt, A Polynomial-time Algorithm for Learning k-variable Pattern Languages from Examples 1989 2 COLT Natarajan, On Learning from Exercises 1989 2 COLT Osherson & Stob & Weinstein, On Approximate Truth 1989 2 COLT Milosavljevic & Haussler & Jurka, Informed Parsimonious Inference of Prototypical Genetic Sequences 1989 2 COLT Lin & Vitter, Complexity Issues in Learning by Neural Nets 1989 2 COLT Angluin, Equivalence Queries and Approximate Fingerprints 1989 2 COLT Hellerstein & Karpinski, Learning Read-Once Formulas Using Membership Queries 1989 2 COLT Ishizaka, Learning Simple Deterministic Languages 1989 2 COLT Fulk & Jain, Learning in the Presence of Inaccurate Information 1989 2 COLT Jain & Sharma & Case, Convergence to Nearly Minimal Size Grammars by Vacillating Learning Machines 1989 2 COLT Velauthapillai, Inductive Inference with Bounded Number of Mind Changes 1989 2 COLT Gasarch & Pleszkoch, Learning via Queries to an Oracle 1989 2 COLT Pearl & Dechter, Learning Structure from Data: A Survey 1989 2 COLT Levin & Tishby & Solla, A Statistical Approach to Learning and Generalization in Layered Neural Networks 1989 2 COLT Paturi & Rajasekaran & Reif, The Light Bulb Problem 1989 2 COLT Haussler, Generalizing the PAC Model: Sample Size Bounds from Metric Dimension-based Uniform Convergence Results 1989 2 COLT Littlestone, From On-line to Batch Learning 1989 2 COLT Ben-David & Benedek & Mansour, A Parametrization Scheme for Classifying Models of Learnability 1989 2 COLT Kurtz & Smith, On the Role of Search for Learning 1989 2 COLT Arikawa & Shinohara & Yamamoto, Elementary Formal System as a Unifying Framework for Language Learning 1989 2 COLT Wright, Identification of Unions of Languages Drawn from an Identifiable Class 1989 2 COLT Kelly, Induction from the General to the More General 1989 2 COLT Floyd, Space-Bounded learning and the Vapnik-Chervonenkis Dimension 1989 2 COLT Kivinen, Reliable and Useful Learning 1988 1 COLT Judd, Learning in Neural Networks 1988 1 COLT Blum & Rivest, Training a 3-Node Neural Network is NP-Complete 1988 1 COLT Raghavan, Learning in Threshold Networks 1988 1 COLT Valiant, Functionality in Neural Nets 1988 1 COLT Haussler & Kearns & Littlestone & Warmuth, Equivalence of Models for Polynomial Learnability 1988 1 COLT Linial & Mansour & Rivest, Results on Learnability and the Vapnik-Chervonenkis Dimension 1988 1 COLT Rivest & Sloan, Learning Complicated Concepts Reliably and Usefully 1988 1 COLT Benedek & Itai, Learnability by Fixed Distributions 1988 1 COLT Sloan, Types of Noise in Data for Concept Learning 1988 1 COLT Shackelford & Volper, Learning k-DNF with Noise in the Attributes 1988 1 COLT Vitter & Lin, Learning in Parallel 1988 1 COLT Boucheron & Sallantin, Some Remarks About Space-Complexity of Learning, and Circuit Complexity of Recognizing 1988 1 COLT Ehrenfeucht & Haussler & Kearns & Valiant, A General Lower Bound on the Number of Examples Needed for Learning 1988 1 COLT Shvaytser, Non-Learnable Classes of Boolean Formulae That Are Closed Under Variable Permutation 1988 1 COLT Angluin, Learning with Hints 1988 1 COLT Ehrenfeucht & Haussler, Learning Decision Trees From Random Examples 1988 1 COLT Case, The Power of Vacillation 1988 1 COLT Kurtz & Royer, Prudence in Language Learning 1988 1 COLT Daley, Transformation of Probabilistic Learning Strategies into Deterministic Learning Strategies 1988 1 COLT Gasarch & Smith, Learning via Queries 1988 1 COLT Gasarch & Sitaraman & Smith & Velauthapillai, Learning Programs With an Easy to Calculate Set of Errors 1988 1 COLT Cherniavsky & Velauthapillai & Statman, Inductive Inference: An Abstract Approach 1988 1 COLT Banerji, Learning Theories in a Subset of a Polyadic Logic 1988 1 COLT Haussler & Littlestone & Warmuth, Predicting {0,1}-Functions on Randomly Drawn Points 1988 1 COLT Laird, Efficient Unsupervised Learning 1988 1 COLT DeSantis & Markowsky & Wegman, Learning Probabilistic Prediction Functions 1988 1 COLT Sakakibara, Learning Context-Free Grammars from Structural Data in Polynomial Time 1988 1 COLT Marron, Learning Pattern Languages from a Single Initial Example and from Queries 1988 1 COLT Li & Vazirani, On the Learnability of Finite Automata 1988 1 COLT Ibarra & Jiang, Learning Regular Languages from Counterexamples 1988 1 COLT Porat & Feldman, Learning Automata from Ordered Examples 1988 1 COLT Angluin, Summary of the Panel Discussion (on the role of theory in learning research) 1988 1 COLT Farmer & Sidorowich, Exploiting Chaos to Predict the Future and Reduce Noise (abstract) 1988 1 COLT Kearns & Valiant, Learning Boolean Formulae or Finite Automata is as Hard as Factoring (abstract) 1988 1 COLT Pitt & Warmuth, The Minimum Consistent DFA Problem Cannot be Approximated within any Polynomial (abstract) 1988 1 COLT Pitt & Warmuth, Reductions Among Prediction Problems: On the Difficulty of Predicting Automata (abstract) 1988 1 COLT Natarajan, Learning over Classes of Distributions (abstract) 1988 1 COLT Natarajan, Learning Randomized Heuristics (abstract) 1988 1 COLT Floyd, Space-bounded Learning and the Vapnik-Chervonenkis Dimension (abstract) 1988 1 COLT Hoffmann, Unifying Several Learning Situations (abstract) 1988 1 COLT Komlos & Paturi, Convergence Results in an Associative Memory Model (abstract) 1988 1 COLT Baldi, Learning from Examples without Local Minima (abstract) 1988 1 COLT Sutton, Convergence Theory for a New Kind of Prediction Learning (abstract) 1988 1 COLT Maler & Pnueli, Learning omega-Regular Languages from Ultimately-Periodic Examples (abstract) 1988 1 COLT Jain & Fulk, Open Problems in Systems that Learn (abstract) 1988 1 COLT Jain & Sharma, Connections between Machine Learning and Standardizing Operations (abstract) 1988 1 COLT Jain & Sharma, Study of Minimal Size Restrictions in Machine Learning (abstract) 1988 1 COLT Kurtz & Smith, On the Enumeration Technique (abstract) 1996 749 COMAP Youngstrom & Owens, Fuzzy Sets 1996 746 COMAP Loeb, How to Win at Nim 1992 COMAP Pulskamp & Delaney, Computer and Calculator Computation of Elementary Functions 1989 COMAP Lambert, Voting Games, Power Indices, and Presidential Elections 1989 COMAP Finkel & Haggard, Evaluating the Complexity of a Structured Computer Program 1987 671 COMAP Barnier, Finite-State Machines as Recognizers 1996 16 COMBINAT Deng, Distributed Near-Optimal Matching 1996 16 COMBINAT Kahn & Linial & Samorodnitsky, Inclusion-Exclusion: Exact and Approximate 1996 16 COMBINAT Kierstead & Kolossa, On-line Coloring of Perfect Graphs 1996 16 COMBINAT Pyber, Dense Graphs and Edge Reconstruction 1996 16 COMBINAT Reed & Robertson & Seymour & Thomas, Packing Directed Circuits 1996 16 COMBINAT Yukich, Worst Case Asymptotics for Some Classical Optimization Problems 1996 16 COMBINAT Lev, Representation of Elements of a Sequence by Sumsets 1996 16 COMBINAT Alon, Bipartite Subgraphs 1996 16 COMBINAT Kahale & Schulman, Bounds on the Chromatic Polynomial and on the Number of Acyclic Orientations of a Graph 1996 16 COMBINAT Billera & Sarangarajan, All 0-1 Polytopes are Traveling Salesman Polytopes 1996 16 COMBINAT Coullard & Hellerstein, Independence and Port Oracles for Matroids, with an Application to Computational Learning Theory 1996 16 COMBINAT Triesch, On the Recognition Complexity of Some Graph Properties 1996 16 COMBINAT Azar & Broder & Karlin & Linial & Phillips, Biased Random Walks 1996 16 COMBINAT Currie, Non-repetitive Words: Ages and Essences 1996 16 COMBINAT Dor & Zwick, Finding the alpha n-th Largest Element 1996 16 COMBINAT Eaton & Rodl, Graphs of Small Dimensions 1996 16 COMBINAT Furedi & Jockusch & Rubel, Difference Sets and Inverting the Difference Operator 1996 16 COMBINAT Haxell & Kohayakawa & Luczak, Turan's Extremal Problem in Random Graphs: Forbidding Odd Cycles 1996 16 COMBINAT Jagger & Stovicek & Thomason, Multiplicities of Subgraphs 1996 16 COMBINAT Ramirez-Alfonsin, Complexity of the Frobenius Problem 1995 15 COMBINAT Nisan & Wigderson, On Rank vs. Communication Complexity 1995 15 COMBINAT Raz & Spieker, On the ``log rank''-Conjecture in Communication Complexity 1995 15 COMBINAT Alon & Dubiner, A Lattice Point Problem and Additive Number Theory 1995 15 COMBINAT Cooper & Linial, Fast Perfect-Information Leader-Election Protocols with Linear Immunity 1995 15 COMBINAT Lefmann & Thiele, Point Sets with Distinct Distances 1995 15 COMBINAT Plotkin & Tardos, Improved Bounds on the Max-Flow Min-Cut Ratio for Multicommodity Flows 1995 15 COMBINAT Williamson & Goemans & Mihail & Vazirani, A Primal-Dual Approximation Algorithm for Generalized Steiner Network Problems 1995 15 COMBINAT Klein & Rao & Agrawal & Ravi, An Approximate Max-Flow Min-Cut Relation for Undirected Multicommodity Flow, with Applications 1995 15 COMBINAT Lapidot & Shamir, A One-round, Two-prover, Zero-knowledge Protocol for NP 1995 15 COMBINAT Linial & London & Rabinovich, The Geometry of Graphs and Some of its Algorithmic Applications 1995 15 COMBINAT Seymour, Packing Directed Circuits Fractionally 1995 15 COMBINAT Rubinstein, Sensitivity vs. Block Sensitivity of Boolean Functions 1995 15 COMBINAT Colbourn & Provan & Vertigan, The Complexity of Computing the Tutte Polynomial on Transversal Matroids 1995 15 COMBINAT Diaconis & McGarth & Pitman, Riffle Shuffles, Cycles and Descents 1995 15 COMBINAT Friedman, Some Graphs with Small Second Eigenvalue 1995 15 COMBINAT Friedman & Wigderson, On the Second Eigenvalue of Hypergraphs 1995 15 COMBINAT Frieze & Jerrum, An Analysis of a Monte Carlo Algorithm for Estimating the Permanent 1995 15 COMBINAT Lefmann & Rodl, On Erdos-Rado Numbers 1995 15 COMBINAT Metsch, On the Number of Lines in Planar Graphs 1995 15 COMBINAT Morgenstern, Natural Bounded Concentrators 1995 15 COMBINAT Tardos, Transversals of 2-intervals, a Topological Approach 1995 15 COMBINAT Wagner & Weihe, A Linear-Time Algorithm for Edge-disjoint Paths in Planar Graphs 1994 14 COMBINAT Ajtai, Recursive Construction for 3-Regular Expanders 1994 14 COMBINAT Ajtai, The Complexity of the Pigeonhole Principle 1994 14 COMBINAT Cheriyan & Reif, Directed s-t Numberings, Rubber Bands, and Testing Digraph k-Vertex Connectivity 1994 14 COMBINAT Klazar & Valtr, Generalized Davenport-Schinzel Sequences 1994 14 COMBINAT Wojciechowski, Covering the Hypercube with a Bounded Number of Disjoint Snakes 1994 14 COMBINAT Furedi & Kleitman, The Prison Yard Problem 1994 14 COMBINAT Goodman & Pollack & Wenger & Zamfirescu, Every Arrangement Extends to a Spread 1994 14 COMBINAT McGuinness, Restricted Greedy Clique Decompositions and Greedy Clique Decompositions of K_4-free Graphs 1994 14 COMBINAT McGuinness, Greedy Maximum-Clique Decompositions 1994 14 COMBINAT Cameron & Sachs, Monotone Path Systems in Simple Regions 1994 14 COMBINAT Gotsman & Linial, Spectral Properties of Threshold Functions 1994 14 COMBINAT Vazirani, A Theory of Alternating Paths and Blossoms for Proving Correctness of the O(sqrt(V)E) General Graph Maximum Matching Algorithm 1994 14 COMBINAT Frankl & Watanabe, Density Results for Uniform Families 1994 14 COMBINAT Komjath & Pach, The Complexity of a Class of Infinite Graphs 1993 13 COMBINAT Linial & Saks, Low Diameter Graph Decompositions 1993 13 COMBINAT Matousek & Welzl & Wernisch, Discrepancy and Approximations for Bounded VC-Dimension 1993 13 COMBINAT Sharir, k-sets and Random Hulls 1993 13 COMBINAT Kupitz, Separation of a Finite Set in R^d by Spanned Hyperplanes 1993 13 COMBINAT Bollobas & Erdos & Spencer & West, Clique Coverings of the Edges of a Random Graph 1993 13 COMBINAT Frank, Conservative Weightings and Ear-decompositions of Graphs 1993 13 COMBINAT Lueker & Molodowitch, More Analysis of Double Hashing 1993 13 COMBINAT Middendorf & Pfeiffer, On the Complexity of the Disjoint Paths Problem 1993 13 COMBINAT Zhang, A Note on Arrays of Dots with Distinct Slopes 1993 13 COMBINAT Ajtai & Linial, The Influence of Large Coalitions 1993 13 COMBINAT Suen, On Depth First Search Trees in m-Out Digraphs 1992 12 COMBINAT Cai & Furer & Immerman, An Optimal Lower Bound on the Number of Variables for Graph Identification 1992 12 COMBINAT Hrushovski, Extending Partial Isomorphisms of Graphs 1992 12 COMBINAT Kahn, On a Problem of Erdos and Lovasz: Random Lines in a Projective Plane 1992 12 COMBINAT Mayr & Plaxton, On the Spanning Trees of Weighted Graphs 1992 12 COMBINAT Nisan, Pseudorandom Generators for Space-bounded Computation 1992 12 COMBINAT Frankl, The Convex Hull of Antichains in Posets 1992 12 COMBINAT Aronov & Edelsbrunner & Guibas & Sharir, The Number of Edges of Many Faces in a Line Segment Arrangement 1992 12 COMBINAT Erdos & Frankl & Kleitman & Saks & Szekely, Sharpening the LYM Inequality 1992 12 COMBINAT Hajnal & Szegedy, On Packing Bipartite Graphs 1992 12 COMBINAT Holzman & Kleitman, Sign Vectors and Unit Vectors 1992 12 COMBINAT Rhee & Talagrand, On the Long Edges in the Shortest Tour through n Random Points 1992 12 COMBINAT Lisan, Multi-dimensional Ramsey Theorems -- An Example 1992 12 COMBINAT Miklos, Disproof of a Conjecture in Graph Reconstruction Theory 1992 12 COMBINAT Barany & Howe & Lovasz, On Integer Points in Polyhedra: A Lower Bound 1992 12 COMBINAT Kannan, Lattice Translates of a Polytope and the Frobenius Problem 1992 12 COMBINAT Pudlak & Rodl, A Combinatorial Approach to Complexity 1992 12 COMBINAT Chvatal & McDiarmid, Small Transversals in Hypergraphs 1992 12 COMBINAT Cook & Hartmann & Kannan & McDiarmid, On Integer Points in Polyhedra 1992 12 COMBINAT Erdos & Graham & Ruzsa & Taylor, Bounds for Arrays of Dots with Distinct Slopes or Lengths 1992 12 COMBINAT Kelmans, Spanning Trees of Extended Graphs 1992 12 COMBINAT Miller & Ramachandran, A New Graph Triconnectivity Algorithm and its Parallelization 1992 12 COMBINAT Sundar, On the Deque Conjecture for the Splay Algorithm 1991 11 COMBINAT Bouchet, An Efficient Algorithm to Recognize Locally Equivalent Graphs 1991 11 COMBINAT Friedman, On the Second Eigenvalue and Random Walks in Random d-Regular Graphs 1991 11 COMBINAT Kahn & Linial, Balancing Extensions via Brunn-Minkowski 1991 11 COMBINAT Saks & Werman, On Computing Majority by Comparisons 1991 11 COMBINAT Seymour, Directed Circuits on a Torus 1991 11 COMBINAT Luczak, A Note on the Sharp Concentration of the Chromatic Number of Random Graphs 1991 11 COMBINAT Aldred & Holton & Jackson, Uniform Cyclic Edge Connectivity in Cubic Graphs 1991 11 COMBINAT Alon & Azar, Parallel Comparison Algorithms for Approximation Problems 1991 11 COMBINAT Haggkvist & Thomason, Trees in Tournaments 1991 11 COMBINAT Hajnal, An Omega(n^(4/3)) Lower Bound on the Randomized Complexity of Graph Properties 1991 11 COMBINAT Hartsfield & Ringel, Clean Triangulations 1991 11 COMBINAT Kalyanasundaram & Schnitger, On the Power of White Pebbles 1991 11 COMBINAT Lu, On Claws Belonging to Every Tournament 1991 11 COMBINAT Gyarfas & Lehel, Effective On-line Coloring of P_5-free Graphs 1991 11 COMBINAT Kahn & Meshulam, On mod p Transversals 1991 11 COMBINAT King, An Omega(n^{5/4}) Lower Bound on the Randomized Complexity of Graph Properties 1991 11 COMBINAT Knuth, Efficient Representation of Perm Groups 1991 11 COMBINAT Luczak, The Chromatic Number of Random Graphs 1991 11 COMBINAT Neumann-Lara & Rivera-Campo, Spanning Trees with Bounded Degrees 1991 11 COMBINAT Nisan, Pseudorandom Bits for Constant Depth Circuits 1990 10 COMBINAT Alon, The Maximum Number of Hamiltonian Paths in Tournaments 1990 10 COMBINAT Frank, Packing Paths in Planar Graphs 1990 10 COMBINAT Lagarias & Lenstra & Schnorr, Korkin-Zolotarev Bases and Successive Minima of a Lattice and its Reciprocal Lattice 1990 10 COMBINAT Linial & Nisan, Approximate Inclusion-Exclusion 1990 10 COMBINAT McKay, The Asymptotic Numbers of Regular Tournaments, Eulerian Digraphs and Eulerian Oriented Graphs 1990 10 COMBINAT Seymour, Colouring Series-Parallel Graphs 1990 10 COMBINAT Blokhuis, Solution of an Extremal Problem for Sets Using Resultants of Polynomials 1990 10 COMBINAT Chazelle & Friedman, A Deterministic View of Random Sampling and its Use in Geometry 1990 10 COMBINAT Edelsbrunner, An Acyclicity Theorem for Cell Complexes in d Dimension 1990 10 COMBINAT Erdos & Pach, Variation on the Theme of Repeated Distances 1990 10 COMBINAT Kalai, On Low-dimensional Faces that High-dimensional Polytopes Must Have 1990 10 COMBINAT Laczkovich, Tilings of Polygons with Similar Triangles 1990 10 COMBINAT Pollack & Wenger, Necessary and Sufficient Conditions for Hyperplane Transversals 1990 10 COMBINAT Soltan & Hung, Some Notes about Affine Diameters of Convex Figures 1990 10 COMBINAT Aronov & Sharir, Triangles in Space or Building (and Analyzing) Castles in the Air 1990 10 COMBINAT Barany & Furedi & Lovasz, On the Number of Halving Planes 1990 10 COMBINAT Barany & Perles, The Caratheodory Number for the k-Core 1990 10 COMBINAT Bodlaender & Gritzmann & Klee & van Leeuwen, Computational Complexity of Norm-Maximization 1990 10 COMBINAT Aiello & Goldwasser & Hastad, On the Power of Interaction 1990 10 COMBINAT de Fraysseix & Pach & Pollack, How to Draw a Planar Graph on a Grid 1990 10 COMBINAT King, A Lower Bound for the Recognition of Digraph Properties 1990 10 COMBINAT Nakano & Nishizeki & Saito, On the fg-Coloring of Graphs 1990 10 COMBINAT Razborov, Applications of Matrix Methods to the Theory of Lower Bounds in Computational Complexity 1990 10 COMBINAT Papadimitriou & Yannakakis, On Recognizing Integer Polyhedra 1989 9 COMBINAT Chung & Graham & Wilson, Quasi-random Graphs 1989 9 COMBINAT Frieze & McDiarmid, On Random Minimum Length Spanning Trees 1989 9 COMBINAT Schrijver, The Klein Bottle and Multicommodity Flows 1989 9 COMBINAT Tardos, Query Complexity, or Why is it Difficult to Separate NP^A intersect coNP^A from P^A by Random Oracles A? 1989 9 COMBINAT Lichtenstein & Linial & Saks, Some Extremal Problems Arising from Discrete Control Processes 1989 9 COMBINAT Peleg & Upfal, Constructing Disjoint Paths on Expander Graphs 1989 9 COMBINAT Bergelson & Hindman, Ultrafilters and Multidimensional Ramsey Theorems 1989 9 COMBINAT Galil & Kannan & Szemeredi, On 3-Pushdown Graphs with Large Separators 1989 9 COMBINAT Haggkvist & Manoussakis, Cycles and Paths in Bipartite Tournaments with Spanning Configurations 1989 9 COMBINAT Wojciechowski, A New Lower Bound for Snake-in-the-Box Codes 1988 8 COMBINAT Alon & Freiman, On Sums of Subsets of a Set of Integers 1988 8 COMBINAT Frankl & Rodl, Some Ramsey-Turan Type Results for Hypergraphs 1988 8 COMBINAT Ajtai, A Lower Bound for Finding Predecessors in Yao's Cell Probe Model 1988 8 COMBINAT Lubotzky & Phillips & Sarnak, Ramanujan Graphs 1988 8 COMBINAT Chang & Lawler, Edge Coloring of Hypergraphs and a Conjecture of Erdos, Faber, Lovasz 1988 8 COMBINAT Friedman, A Lower Bound on Strictly Non-blocking Networks 1988 8 COMBINAT Galil & Pan, Improved Processor Bounds for Combinatorial Problems in RNC 1988 8 COMBINAT Aggarwal & Anderson, A Random NC Algorithm for Depth First Search 1988 8 COMBINAT Aharoni & Erdos & Linial, Optima of Dual Integer Linear Programs 1988 8 COMBINAT Bollobas, The Chromatic Number of Random Graphs 1988 8 COMBINAT Hastad, Dual Vectors and Lower Bounds for the Nearest Lattice Point Problem 1988 8 COMBINAT Linial & Lovasz & Wigderson, Rubber Bands, Convex Embeddings and Graph Connectivity 1988 8 COMBINAT Sharir, Improved Lower Bounds on the Length of Davenport-Schinzel Sequences 1988 8 COMBINAT Tardos, The Gap between Monotone and Non-monotone Circuit Complexity is Exponential 1987 7 COMBINAT Matula, Expose-and-Merge Exploration and the Chromatic Number of a Random Graph 1987 7 COMBINAT Anderson, A Parallel Algorithm for the Maximal Path Problem 1987 7 COMBINAT Bollobas & Fenner & Frieze, An Algorithm for Finding Hamilton Paths and Cycles in Random Graphs 1987 7 COMBINAT Jimbo & Maruoka, Expanders Obtained from Affine Transformations 1987 7 COMBINAT Levin, One-way Functions and Pseudorandom Generators 1987 7 COMBINAT Raghavan & Thompson, Randomized Rounding: A Technique for Provably Good Algorithms and Algorithmic Proofs 1987 7 COMBINAT Vazirani, Strong Communication Complexity or Generating Quasi-Random Sequences from Two Communicating Semi-Random Sources 1987 7 COMBINAT Alon & Boppana, The Monotone Circuit Complexity of Boolean Functions 1987 7 COMBINAT Bollobas & Thomason, Threshold Functions 1987 7 COMBINAT Dress & Lovasz, On Some Combinatorial Properties of Algebraic Matroids 1987 7 COMBINAT Frank & Tardos, An Application of Simultaneous Diophantine Approximation in Combinatorial Optimization 1987 7 COMBINAT Friedman & Pippenger, Expanding Graphs Contain All Small Trees 1987 7 COMBINAT Luks, Computing the Composition Factors of a Permutation Group in Polynomial Time 1987 7 COMBINAT Mulmuley, A Fast Parallel Algorithm to Compute the Rank of a Matrix over an Arbitrary Field 1987 7 COMBINAT Mulmuley & Vazirani & Vazirani, Matching is as Easy as Matrix Inversion 1987 7 COMBINAT Promel & Rothschild, A Canonical Restricted Version of van der Waerden's Theorem 1987 7 COMBINAT Shamir & Spencer, Sharp Concentration of the Chromatic Number on Random Graphs G_{n,p} 1987 7 COMBINAT Sharir, Almost Linear Upper Bounds on the Length of General Davenport-Schinzel Sequences 1987 7 COMBINAT Thomassen, On Digraphs with No Two Disjoint Directed Cycles 1987 7 COMBINAT Alon & Kleitman & Pomerance & Saks & Seymour, The Smallest n-Uniform Hypergraph with Positive Discrepancy 1987 7 COMBINAT Bui & Chaudhuri & Leighton & Sipser, Graph Bisection Algorithms with Good Average Case Behavior 1987 7 COMBINAT Kano, Maximum and k-th Maximal Spanning Trees of a Weighted Graph 1986 6 COMBINAT Karloff, A Las Vegas RNC Algorithm for Maximum Matching 1986 6 COMBINAT Alon, Covering Graphs by the Minimum Number of Equivalence Relations 1986 6 COMBINAT Alon, Eigenvalues, Geometric Expanders, Sorting in Rounds, and Ramsey Theory 1986 6 COMBINAT Barany & Edmonds & Wolsey, Packing and Covering a Tree by Subtrees 1986 6 COMBINAT Berger & Felzenbaum & Fraenkel, A Non-analytic Proof of the Newman-Znam Result for Disjoint Covering Systems 1986 6 COMBINAT Elia, On the Non-existence of Barker Sequences 1986 6 COMBINAT Alon, Eigenvalues and Expanders 1986 6 COMBINAT Blum, Independent Unbiased Coin Flips from a Correlated Biased Source--A Finite State Markov Chain 1986 6 COMBINAT Gabow & Galil & Spencer & Tarjan, Efficient Algorithms for Finding Minimum Spanning Trees in Undirected and Directed Graphs 1986 6 COMBINAT Gabow & Stallmann, An Augmenting Path Algorithm for Linear Matroid Parity 1986 6 COMBINAT Hart & Sharir, Nonlinearity of Davenport-Schinzel Sequences and of Generalized Path Compression Schemes 1986 6 COMBINAT Shor, The Average-Case Analysis of Some On-line Algorithms for Bin Packing 1986 6 COMBINAT Babai, On Lovasz' Lattice Reduction and the Nearest Lattice Point Problem 1986 6 COMBINAT Karp & Upfal & Wigderson, Constructing a Perfect Matching is in Random NC 1986 6 COMBINAT Linial, Legal Coloring of Graphs 1985 5 COMBINAT Tarjan, Sequential Access in Splay Trees Takes Linear Time 1984 4 COMBINAT Karmarkar, A New Polynomial-Time Algorithm for Linear Programming 1984 4 COMBINAT Kahn & Saks & Sturtevant, A Topological Approach to Evasiveness 1983 3 COMBINAT Ajtai & Komlos & Szemeredi, Sorting in c log n Parallel Steps 1989 555 COMBMATH Dewdney, Fast Turing Reductions of Combinatorial Problems and Their Algorithms 1989 555 COMBMATH Erdos, Some Old and New Problems on Additive and Combinatorial Number Theory 1989 555 COMBMATH Kleitman, Collections of Sets without Unions and Intersections 1989 555 COMBMATH Recski, Some Open Problems in Matroid Theory 1989 555 COMBMATH Sarnak & Tarjan, Planar Point Location Using Persistent Search Trees 1989 555 COMBMATH Schmeichel, On the Cycle Structure of Finite Projective Planes 1989 555 COMBMATH Seress, Quick Gossiping without Duplicate Transmissions 1989 555 COMBMATH Stanley, Plane Partitions: Past, Present, and Future 1994 COMMCRYP Agnew, Development of Fast Multiplier Structures with Cryptographic Applications 1994 COMMCRYP Ahlswede & Haroutunian & Khachatrian, Messy Broadcasting in Networks 1994 COMMCRYP Blackburn & Carter & Gollmann & Murphy & Paterson & Piper & Wild, Aspects of Linear Complexity 1994 COMMCRYP Cohn & Stevenson, Using Redundancy to Speed up Disk Arrays 1994 COMMCRYP Hagenauer, Soft is Better than Hard 1994 COMMCRYP Ingemarsson, Delay Estimation for Truly Random Binary Sequences or How to Measure the Length of Rip van Winkle's Sleep 1994 COMMCRYP Lai, Higher Order Derivatives and Differential Cryptanalysis 1994 COMMCRYP Loeliger, On the Basic Averaging Arguments for Linear Codes 1994 COMMCRYP Matt, Coding and Multiplexing 1994 COMMCRYP Maurer, The Strong Secret Key Rate of Discrete Random Triples 1994 COMMCRYP Odlyzko, Construction of Invertible Sequences for Multipath Estimation 1994 COMMCRYP Rueppel & Massey, Leaf-Average Node-Sum Interchanges in Rooted Trees with Applications 1994 COMMCRYP Seguin & Drolet, Binary Sequences with Small Correlations 1994 COMMCRYP Wyner & Ziv, The Sliding-Window Lempel-Ziv Algorithm is Asymptotically Optimal 1994 COMMCRYP Zigangirov, Algebraic-Sequential Decoding -- Ideas and Results 1994 COMPALG Abdali, Parallel Computations in *-Semirings 1994 COMPALG Brennan & Piotrowski, The Group of Periods of the Sum of Two Functions 1994 COMPALG Carra Ferro & Sit, On Term-Orderings and Rankings 1994 COMPALG Hoffmann, The Separation Problem of Real Function Partitions and its Significance in Solid Modeling 1995 COMPANDINT Turing, Computing Machinery and Intelligence 1995 COMPANDINT Minsky, Steps Towards Artificial Intelligence 1995 COMPANDINT Newell & Simon, Computer Science as Empirical Enquiry: Symbols and Search 1995 COMPANDINT Minsky, A Framework for Representing Knowledge 1995 COMPANDINT Winograd, A Procedural Model of Language Understanding 1995 COMPANDINT Hayes, In Defense of Logic 1995 COMPANDINT McClelland & Rumelhart & Hinton, The Appeal of Parallel Distributed Processing 1995 COMPANDINT McCarthy, Circumscription--A Form of Non-Monotonic Reasoning 1995 COMPANDINT Minsky, Logical Versus Analogical or Symbolic Versus Connectionist or Neat Versus Scruffy 1995 COMPANDINT Simon, Machine as Mind 1995 12 COMPARITH Owens & Bajwa & Irwin, Reducing the Number of Counters Needed for Integer Multiplication 1995 12 COMPARITH Hamano & Takagi & Yajima & Preparata, O(n)-Depth Circuit Algorithm for Modular Exponentiation 1995 12 COMPARITH Muller & Tisserand & Scherbyna, Semi-Logarithmic Number Systems 1995 12 COMPARITH vanDrunen & Spaanenburg & Lucassen & Nijhuis & Udding, Arithmetic for Relative Accuracy 1995 12 COMPARITH Ferguson, Exact Computation of a Sum or Difference with Applications to Argument Reduction 1995 12 COMPARITH Michelucci, An epsilon Arithmetic for Removing Degeneracies 1993 11 COMPARITH Lewis, An Accurate LNS Arithmetic Unit Using Interleaved Memory Function Interpolator 1993 11 COMPARITH Lozier, An Underflow-Induced Graphics Failure Solved by SLI Arithmetic 1993 11 COMPARITH Turner, Complex SLI Arithmetic: Representation, Algorithms, and Analysis 1993 11 COMPARITH Jenkins & Schnaufer & Mansen, Combined System-Level Redundancy and Modular Arithmetic for Fault Tolerant Digital Signal Processing 1993 11 COMPARITH Kirsch & Turner, Adaptive Beamforming Using RNS Arithmetic 1993 11 COMPARITH Bizzan & Jullien & Wigley & Miller, Integer Mapping Architectures for the Polynomial Ring Engine 1993 11 COMPARITH Montuschi & Ciminiera, n x n Carry-Save Multipliers Without Final Addition 1993 11 COMPARITH Daumas & Matula, Design of a Fast Validated Dot Product Operation 1993 11 COMPARITH Dadda & Piuri & Stefanelli, Multi-Parallel Convolvers 1993 11 COMPARITH Mellott & Smith & Taylor, The Gauss Machine: A Galois-Enhanced Quadratic Residue Number System Systolic Array 1993 11 COMPARITH Jebelean, Comparing Several GCD Algorithms 1993 11 COMPARITH Merrheim & Muller & Yeh, Fast Evaluation of Polynomials and Inverses of Polynomials 1993 11 COMPARITH Benouamer & jaillon & Michelucci & Moreau, A Lazy Exact Arithmetic 1993 11 COMPARITH Shand & Vuillemin, Fast Implementations of RSA Cryptography 1993 11 COMPARITH Zuras, On Squaring and Multiplying Large Integers 1993 11 COMPARITH Takagi, A Modular Multiplication Algorithm with Triangle Additions 1993 11 COMPARITH Kornerup, High-Radix Modular Multiplication for Cryptosystems 1991 10 COMPARITH Frougny, Representation of Numbers in Non-Classical Numeration Systems 1991 10 COMPARITH Duprat & Herreros & Kla, New Redundant Representations of Complex Numbers and Vectors 1991 10 COMPARITH Paterson & Zwick, Shallow Multiplication Circuits 1991 10 COMPARITH Chiang & Lu, A General Division Algorithm for Residue Number Systems 1991 10 COMPARITH Gamberger, New Approach to Integer Division in Residue Number Systems 1991 10 COMPARITH Kantabutra, Designing Optimum Carry-Skip Adders 1991 10 COMPARITH Chan & Schlag & Thomborson & Oklobdzija, Delay Optimization of Carry-Skip Adders and Block Carry-Lookahead Adders 1991 10 COMPARITH Lynch & Swartzlander, The Redundant Cell Adder 1991 10 COMPARITH Kuhnel, Optimal Purely Systolic Addition 1991 10 COMPARITH Vuillemin, Constant Time Arbitrary Length Synchronous Binary Counters 1991 10 COMPARITH Parikh & Matula, A Redundant Binary Euclidean GCD Algorithm 1989 9 COMPARITH Schwarz, Implementing Infinite Precision Arithmetic 1989 9 COMPARITH Duprat & Herreros & Muller, Some Results about On-Line Computation of Functions 1989 9 COMPARITH Koc & Cappello, Systolic Arrays for Integer Chinese Remaindering 1987 8 COMPARITH Han & Carlson, Fast Area-Efficient VLSI Adders 1987 8 COMPARITH Fandrianto, Algorithm for High Speed Shared Radix 4 Division and Radix 4 Square-Root 1987 8 COMPARITH Hull & Cohen, Toward an Ideal Computer Arithmetic 1987 8 COMPARITH Olver, A Closed Computer Arithmetic 1987 8 COMPARITH Hamada, A New Real Number Representation and Its Operation 1987 8 COMPARITH Balsara & Owens, Systolic and Semi-Systolic Digit Serial Multipliers 1987 8 COMPARITH Parhami, Systolic Up/Down Counters with Zero and Sign Detection 1987 8 COMPARITH Tu & Ercegovac, A Radix-4 On-Line Division Algorithm 1987 8 COMPARITH Lin & Sips, A Novel Floating-Point Online Division Algorithm 1987 8 COMPARITH Piuri, Fault-Tolerant Systolic Arrays: An Approach Based upon Residue Arithmetic 1987 8 COMPARITH Barrett, A Formal Approach to Rounding 1995 10 COMPASS Fetzer & Cristian, An Optimal Internal Clock Synchronization Algorithm 1971 COMPAUT Hartmanis, Size Arguments in the Study of Computation Speeds 1992 25 COMPBIO Plouffe & Luxenberg, Biological Modeling on a Microcomputer Using Standard Spreadsheet and Equation Solver Programs: The Hypothalamic-Pituitary-Ovarian Axis as an Example 1991 24 COMPBIO Tyler & Horton & Krause, A Review of Algorithms for Molecular Sequence Comparison 1990 23 COMPBIO Foulser & Core, Parallel Computation of Multiple Biological Sequence Comparisons 1989 22 COMPBIO Core & Edmiston & Saltz & Smith, Supercomputers and Biological Sequence Comparison Algorithms 1989 22 COMPBIO Le & Nussinov & Maizel, Tree Graphs of RNA Secondary Structures and Their Comparisons 1992 22 COMPBM Nussinov, DNA Spatial Considerations in the Arrangement of G/C and A/T Blocks 1992 COMPEUCL Hsiang, On the Development of Quantitative Geometry from Pythagoras to Grassmann 1992 COMPEUCL Bern & Eppstein, Mesh Generation and Optimal Triangulation 1992 COMPEUCL Chou & Rathi, Machine Proofs of Geometry Theorems 1992 COMPEUCL Clarkson, Randomized Geometric Algorithms 1992 COMPEUCL Du & Hwang, The State of Art on Steiner Ratio Problems 1992 COMPEUCL Fortune, Voronoi Diagrams and Delaunay Triangulations 1992 COMPEUCL Seidel, Polar Forms and Triangular B-Spline Surfaces 1992 COMPEUCL MacGregor Smith & Winter, Computational Geometry and Topological Network Design 1992 COMPEURO Vedder, Smart Cards 1992 COMPEURO Heyns, IC Cards for Payment System Applications 1992 COMPEURO Chaum, Electronic Cash for the Motorola SC-21 1992 COMPEURO Quisquater, Recent Smart Cards for Public-Key Cryptosystems 1992 COMPEURO Jerebic & Trobec, Optimal Broadcasting in Toroidal Networks 1992 COMPEURO Konorski & Nowicki & Wozniak, A Unified Local Markov Model of a Multihop Packet Radio Network 1995 11 COMPGEOM Gritzmann & Hufnagel, A Polynomial Time Algorithm for Minkowski Reconstruction 1995 11 COMPGEOM Chan, Output-Sensitive Results on Convex Hull, Extreme Points, and Related Problems 1995 11 COMPGEOM Avis & Bremner, How Good are Convex Hull Algorithms? 1995 11 COMPGEOM Overmars & Rao & Schwarzkopf & Wentink, Immobilizing Polygons against a Wall 1995 11 COMPGEOM Agarwal & Efrat & Sharir, Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and its Applications 1995 11 COMPGEOM Schomer & Thiel, Efficient Collision Detection for Moving Polyhedra 1995 11 COMPGEOM Su & Drysdale, A Comparison of Sequential Delaunay Triangulation Algorithms 1995 11 COMPGEOM Abellanas & Hernandez & Klein & Neumann-Lara & Urrutia, Voronoi Diagrams and Containment of Families of Convex Sets on the Plane 1995 11 COMPGEOM Boissonnat & Sharir & Tagansky, Voronoi Diagrams in Higher Dimensions under Certain Polyhedral Distance Functions 1995 11 COMPGEOM Alt & Schwarzkopf, The Voronoi Diagram of Curved Objects 1995 11 COMPGEOM Edelsbrunner & Waupotitsch, A Combinatorial Approach to Cartograms 1995 11 COMPGEOM Wagner & Wolff, Map Labeling Heuristics: Provably Good and Practically Useful 1995 11 COMPGEOM Finke & Hinrichs, Overlaying Simply Connected Planar Subdivisions in Linear Time 1995 11 COMPGEOM Erickson, New Lower Bounds for Hopcroft's Problem 1995 11 COMPGEOM Matousek, A Helly-Type Theorem for Unions of Convex Sets 1995 11 COMPGEOM Lovasz & Pach & Szegedy, On Conway's Thrackle Conjecture 1995 11 COMPGEOM Bespamyatnikh, An Optimal Algorithm for Closest Pair Maintenance 1995 11 COMPGEOM Gupta & Janardan & Smid & Dasgupta, The Rectangle Enclosure and Point-Dominance Problems Revisited 1995 11 COMPGEOM Arya & Mount, Approximate Range Searching 1995 11 COMPGEOM Agarwal & Schwarzkopf & Sharir, The Overlay of Lower Envelopes in Three Dimension and its Applications 1995 11 COMPGEOM Guibas & Marimont, Rounding Arrangements Dynamically 1995 11 COMPGEOM Tagansky, A New Technique for Analyzing Substructures in Arrangements 1995 11 COMPGEOM Balaban, An Optimal Algorithm for Finding Segment Intersections 1995 11 COMPGEOM Aichholzer & Aurenhammer & Taschwer & Rote, Triangulations Intersect Nicely 1995 11 COMPGEOM Tamaki & Tokuyama, How to Cut Pseudo-Parabolas into Segments 1995 11 COMPGEOM Dickerson & McElfresh & Montague, New Algorithms and Empirical Findings on Minimum Weight Triangulation Heuristics 1995 11 COMPGEOM Pocchiola & Vegter, Computing the Visibility Graph via Pseudo-triangulation 1995 11 COMPGEOM Icking & Klein, Searching for the Kernel of a Polygon -- A Competitive Strategy 1995 11 COMPGEOM Agarwal & Aronov & Suri, Stabbing Triangulations by Lines in 3D 1995 11 COMPGEOM Rege, A Complete and Practical Algorithm for Geometric Theorem Proving 1995 11 COMPGEOM Pellegrini, Monte Carlo Approximation of Form Factors with Error Bounded a Priori 1995 11 COMPGEOM Chazelle & Dobkin & Shouraboura & Tal, Strategies for Polyhedral Surface Decomposition: An Experimental Study 1995 11 COMPGEOM Di Battista & Garg & Liotta & Tamassia & Tassinari & Vargiu, An Experimental Comparison of Three Graph Drawing Algorithms 1995 11 COMPGEOM Aronov & Davis & Dey & Pal & Prasad, Visibility with Reflection 1995 11 COMPGEOM Agarwal & Sharir, Efficient Randomized Algorithms for Some Geometric Optimization Problems 1995 11 COMPGEOM Arya & Mount & Narayan, Accounting for Boundary Effects in Nearest Neighbor Searching 1995 11 COMPGEOM Dyer, A Parallel Algorithm for Linear Programming in Fixed Dimension 1995 11 COMPGEOM Choi & Sellen & Yap, Precision-Sensitive Euclidean Shortest Path in 3-Space 1995 11 COMPGEOM Mata & Mitchell, Approximation Algorithms for Geometric Tour and Network Design Problems 1995 11 COMPGEOM Chen & Klenk & Tu, Shortest Path Queries among Weighted Obstacles in the Rectilinear Plane 1995 11 COMPGEOM Choi & Yap, Rectilinear Geodesics in 3-Space 1995 11 COMPGEOM Wagner & Weihe, An Animated Library of Combinatorial VLSI-Routing Algorithms 1995 11 COMPGEOM van Kreveld & van de Kraats & Overmars, Printed Circuit Board Simplification: Simplifying Subdivisions in Practice 1995 11 COMPGEOM Goldwasser, An Implementation for Maintaining Arrangements of Polygons 1995 11 COMPGEOM Durand & Puech, The Visibility Complex Made Visibly Simple 1995 11 COMPGEOM Glassman & Nelson, An Animation of Euclid's Proposition 47: The Pythagorean Theorem 1995 11 COMPGEOM Joskowith & Sacks, HIPAIR: Interactive Mechanism Analysis, Design Using Configuration Spaces 1995 11 COMPGEOM Ponamgi & Lin & Manocha, Incremental Collistion Detection for Polygonal Models 1995 11 COMPGEOM Chazelle & Dobkin & Shouraboura & Tal, Convex Surface Decomposition 1995 11 COMPGEOM Geiger, 3D Modeling Using the Delaunay Triangulation 1994 10 COMPGEOM de Berg & Guibas & Halperin, Vertical Decompositions for Triangles in 3-Space 1994 10 COMPGEOM Halperin & Sharir, Almost Tight Upper Bounds for the Single Cell and Zone Problems in Three Dimensions 1994 10 COMPGEOM Aronov & Sharir, On Translational Motion Planning in 3-Space 1994 10 COMPGEOM van der Stappen & Overmars, Motion Planning amidst Fat Obstacles (extended abstract) 1994 10 COMPGEOM Choi & Sellen & Yap, Approximate Euclidean Shortest Path in 3-Space (Extended Abstract) 1994 10 COMPGEOM Eades & Whitesides, The Realization Problem for Euclidean Minimum Spanning Trees is NP-hard 1994 10 COMPGEOM Rajasekaran & Ramaswami, Optimal Parallel Randomized Algorithms for the Voronoi Diagram of Line Segments in the Plane and Related Problems 1994 10 COMPGEOM Agarwal & de Berg & Matousek & Schwarzkopf, Constructing Levels in Arrangements and Higher Order Voronoi Diagrams 1994 10 COMPGEOM Agarwal & Matousek & Schwarzkopf, Computing Many Faces in Arrangements of Lines and Segments 1994 10 COMPGEOM Alt & Aichholzer & Rote, Matching Shapes with a Reference Point 1994 10 COMPGEOM Barequet & Sharir, Piecewise-Linear Interpolation between Polygonal Slices 1994 10 COMPGEOM Goodrich & Mitchell & Orletsky, Practical Methods for Approximate Geometric Pattern Matching under Rigid Motions (Preliminary Version) 1994 10 COMPGEOM Halperin & Overmars, Spheres, Molecules, and Hidden Surface Removal 1994 10 COMPGEOM Bose & Bremmer & van Kreveld, Determining the Castability of Simple Polyhedra 1994 10 COMPGEOM Das & Narasimhan, A Fast Algorithm for Constructing Sparse Euclidean Spanners (Extended Abstract) 1994 10 COMPGEOM Kapoor, Dynamic Maintenance of Maximas of 2-d point sets 1994 10 COMPGEOM Atallah & Goodrich & Ramaiyer, Biased Finger Trees and Three-Dimensional Layers of Maxima (Preliminary Version) 1994 10 COMPGEOM Clarkson, An Algorithm for Approximate Closest-point Queries 1994 10 COMPGEOM Kapoor & Smid, New Techniques for Exact and Approximate Dynamic Closest-Point Problems 1994 10 COMPGEOM Datta & Icking, Competitive Searching in a Generalized Street 1994 10 COMPGEOM Gao & Du & Graham, The Tight Lower Bound for the Steiner Ratio in Minkowski Planes 1994 10 COMPGEOM Goodman & Pollack & Wenger, Bounding the Number of Geometric Permutations Induced by k-Transversals 1994 10 COMPGEOM Pach & Shahrokhi & Szegedy, Applications of the Crossing Number 1994 10 COMPGEOM Edelsbrunner & Valtr & Welzl, Cutting Dense Point Sets in Half 1994 10 COMPGEOM Dickerson & Drysdale & McElfresh & Welzl, Fast Greedy Triangulation Algorithms (Extended Abstract) 1994 10 COMPGEOM Bern & Mitchell & Ruppert, Linear-size Nonobtuse Triangulation of Polygons 1994 10 COMPGEOM Chazelle & Shouraboura, Bounds on the Size of Tetrahedralizations 1994 10 COMPGEOM Tan, An Optimal Bound for Conforming Quality Triangulations (extended abstract) 1994 10 COMPGEOM Robins & Salowe, On the Maximum Degree of Minimum Spanning Trees 1994 10 COMPGEOM Das & Narasimhan, Optimal Linear-Time Algorithm for the Shortest Illuminating Line Segment in a Polygon (Extended Abstract) 1994 10 COMPGEOM Guibas & Hershberger, Morphing Simple Polygons 1994 10 COMPGEOM Dey, A New Technique to Compute Polygonal Schema for 2-manifolds with Application to Null-homotopy Detection 1994 10 COMPGEOM Edelsbrunner & Shah, Triangulating Topological Spaces 1994 10 COMPGEOM Bronnimann & Goodrich, Almost Optimal Set Covers in Finite VC-Dimension (Preliminary Version) 1994 10 COMPGEOM Jaromczyk & Kowaluk, An Efficient Algorithm for the Euclidean Two-Center Problem 1994 10 COMPGEOM Matousek, On Geometric Optimization with Few Violated Constraints 1994 10 COMPGEOM Goodrich, Efficient Piecewise-Linear Function Approximation Using the Uniform Metric (Preliminary Version) 1994 10 COMPGEOM Inaba & Katoh & Imai, Applications of Weighted Voronoi Diagrams and Randomization to Variance-Based k-Clustering (Extended Abstract) 1994 10 COMPGEOM Amenta, Bounded Boxes, Hausdorff Distance, and a New Proof of an Interesting Helly-type Theorem 1994 10 COMPGEOM Agarwal & Aronov & Sharir, Computing Envelopes in Four Dimensions with Applications 1994 10 COMPGEOM Mitchell & Mount & Suri, Query-Sensitive Ray Shooting 1994 10 COMPGEOM Gupta & Janardan & Smid, Efficient Algorithms for Generalized Intersection Searching on Non-Iso-Oriented Objects 1994 10 COMPGEOM Hershberger & Snoeyink, An O(n log n) Implementation Of The Douglas-Peucker Algorithm For Line Simplification 1994 10 COMPGEOM Dobkin & Gunopulos, Computing the Rectangle Discrepancy 1994 10 COMPGEOM Lenhof & Smid, An Animation of a Fixed-Radius All-Nearest-Neighbors Algorithm 1994 10 COMPGEOM Tal & Dobkin, GASP -- A System to Facilitate Animating Geometric Algorithms 1994 10 COMPGEOM Mariano & Upson, Penumbral Shadows 1994 10 COMPGEOM Cohen & Lin & Manocha & Ponamgi, Exact Collision Detection for Interactive Environments 1994 10 COMPGEOM Bronnimann, Almost Optimal Polyhedral Separators 1994 10 COMPGEOM Varshney & Brooks & Wright, Interactive Visualization of Weighted Three-dimensional Alpha Hulls 1993 9 COMPGEOM de Berg, Generalized Hidden Surface Removal 1993 9 COMPGEOM Halperin & Sharir, New Bounds for Lower Envelopes in Three Dimensions, with Applications to Visibility in Terrains 1993 9 COMPGEOM Pellegrini, On Lines Missing Polyhedral Sets in 3-space 1993 9 COMPGEOM Halperin & Yap, Combinatorial Complexity of Translating a Box in Polyhedral 3-space 1993 9 COMPGEOM Everett & Robert & van Kreveld, An Optimal Algorithm for the (leq k)-levels, with Applications to Separation and Transversal Problems 1993 9 COMPGEOM Dobkin & Eppstein, Computing the Discrepancy 1993 9 COMPGEOM Das & Heffernan & Narasimhan, Very Sparse Spanners in 3-dimensional Euclidean Space 1993 9 COMPGEOM Amenta, Helly Theorems and Generalized Linear Programming 1993 9 COMPGEOM Goodrich, Geometric Partitioning Made Easier, Even in Parallel 1993 9 COMPGEOM Jadhav & Mukhopadhyay, Computing a Centerpoint of a Finite Planar Set of Points in Linear Time 1993 9 COMPGEOM Clarkson & Eppstein & Miller & Sturtivant & Teng, Approximating Center Points with Iterated Radon Points 1993 9 COMPGEOM Eppstein & Miller & Teng, A Deterministic Linear Time Algorithm for Geometric Separators and Its Applications 1993 9 COMPGEOM Corbalan & Mazon & Recio & Santos, On the Topological Shape of Planar Voronoi Diagrams 1993 9 COMPGEOM Icking & Klein & Le & Ma, Convex Distance Functions in 3-space are Different 1993 9 COMPGEOM Klein & Lingas, A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon 1993 9 COMPGEOM Kirkpatrick & Snoeyink, Tentative Prune-and-Search for Computing Voronoi Vertices 1993 9 COMPGEOM Chen & Ierardi, Optimal Motion Planning for a Rod in the Plane Subject to Velocity Constraints 1993 9 COMPGEOM Li & Milenkovic, A Compaction Algorithm for Non-convex Polygons and Its Application 1993 9 COMPGEOM Fortune & van Wijk, Efficient Exact Arithmetic for Computational Geometry 1993 9 COMPGEOM Fekete & Pulleyblank, Area Optimization of Simple Polygons 1993 9 COMPGEOM Bern & Eppstein, Worst-Case Bounds for Subadditive Geometric Graphs 1993 9 COMPGEOM Aggarwal & Schieber & Tokuyama, Finding a Minimum Weight K-link Path in Graphs with Monge Property and Applications 1993 9 COMPGEOM Katz & Sharir, An Expander-based Approach to Geometric Optimization 1993 9 COMPGEOM Dube, Dominance Range-Query: The One-Reporting Case 1993 9 COMPGEOM Edelsbrunner, The Union of Balls and Its Dual Shape 1993 9 COMPGEOM Delfinado & Edelsbrunner, An Incremental Algorithm for Betti Numbers of Simplicial Complexes 1993 9 COMPGEOM Mulmuley, Dehn-Sommerville Relations, Upper Bound Theorem, and Levels in Arrangements 1993 9 COMPGEOM Snoeyink & Stolfi, Objects that Cannot be Taken Apart with Two Hands 1993 9 COMPGEOM Alon & Rajagopalan & Suri, Long Non-crossing Configurations in the Plane 1993 9 COMPGEOM Pach & Torocsik, Some Geometric Applications of Dilworth's Theorem 1993 9 COMPGEOM Dey & Edelsbrunner, Counting Triangle Crossings and Halving Planes 1993 9 COMPGEOM Chew, Guaranteed-Quality Mesh Generation for Curved Surfaces 1993 9 COMPGEOM Bern, Compatible Tetrahedralizations 1993 9 COMPGEOM Amato & Preparata, An NC^1 Parallel 3D Convex Hull Algorithm 1993 9 COMPGEOM Dehne & Fabri & Rau-Chaplin, Scalable Parallel Geometric Algorithms for Coarse Grained Multicomputers 1993 9 COMPGEOM Mitchell, Shortest Paths among Obstacles in the Plane 1993 9 COMPGEOM Goodrich & Tamassia, Dynamic Ray Shooting and Shortest Paths via Balanced Geodesic Triangulations 1993 9 COMPGEOM Pocchiola & Vegter, The Visibility Complex 1993 9 COMPGEOM Agarwal & Alon & Aronov & Suri, Can Visibility Graphs be Represented Compactly? 1993 9 COMPGEOM Heffernan, An Optimal Algorithm for the Two-Guard Problem 1993 9 COMPGEOM Garg & Goodrich & Tamassia, Area-Efficient Upward Tree Drawings 1993 9 COMPGEOM Arkin & Meijer & Mitchell & Rappaport & Skiena, Decision Trees for Geometric Models 1993 9 COMPGEOM Karasik & Sharir, The Power of Geometric Duality and Minkowski Sums in Optical Computational Geometry 1992 8 COMPGEOM Matousek & Sharir & Welzl, A Subexponential Bound for Linear Programming 1992 8 COMPGEOM Dyer, A Class of Convex Programs with Applications to Computational Geometry 1992 8 COMPGEOM Matousek & Schwarzkopf, Linear Optimization Queries 1992 8 COMPGEOM Rote, Degenerate Convex Hulls in High Dimensions without Extra Storage 1992 8 COMPGEOM Hershberger, Optimal Parallel Algorithms for Triangulated Simple Polygons 1992 8 COMPGEOM Edelsbrunner & Shah, Incremental Flipping Works for Regular Triangulations 1992 8 COMPGEOM Edelsbrunner & Tan, An Upper Bound for Conforming Delaunay Triangulations 1992 8 COMPGEOM Chen, An Optimal Parallel Algorithm for Detecting Weak Visibility of a Simple Polygon 1992 8 COMPGEOM Emiris & Canny, An Efficient Approach to Removing Geometric Degeneracies 1992 8 COMPGEOM Fortune, Numerical Stability of Algorithms for 2d Delaunay Triangulations and Voronoi Diagrams 1992 8 COMPGEOM Heffernan & Schirra, Approximate Decision Algorithms for Point Set Congruence 1992 8 COMPGEOM Alt & Godau, Measuring the Resemblance of Polygonal Curves 1992 8 COMPGEOM Huttenlocher & Kedem & Kleinberg, On Dynamic Voronoi Diagrams and the Minimum Hausdorff Distance for Point Sets under Euclidean Motion in the Plane 1992 8 COMPGEOM Chazelle & Edelsbrunner & Guibas & Sharir, Diameter, Width, Closest Line Pair, and Parametric Searching 1992 8 COMPGEOM Pellegrini, Incidence and Nearest-Neighbor Problems for Lines in 3-space 1992 8 COMPGEOM de Berg & Overmars & Schwarzkopf, Computing and Verifying Depth Orders 1992 8 COMPGEOM Aronov & Sharir, Castles in Air Revisited 1992 8 COMPGEOM Alon & Kleitman, Piercing Convex Sets 1992 8 COMPGEOM Barvinok, Computing the Volume, Counting Integral Points and Exponential Sums 1992 8 COMPGEOM Goodman & Pollack & Wenger & Zamfirescu, There is a Universal Topological Plane 1992 8 COMPGEOM Dillencourt & Smith, A Linear Time Algorithm for Testing the Inscribability of Trivalent Polyhedra 1992 8 COMPGEOM Gritzmann & Klee, Computational Convexity: Progress and Problems in High-dimensional Computational Convexity 1992 8 COMPGEOM Salowe, On Euclidean Spanner Graphs with Small Degree 1992 8 COMPGEOM Chandra & Das & Narasimhan & Soares, New Sparseness Results on Graph Spanners 1992 8 COMPGEOM Melissaratos & Souvaine, Coping with Inconsistencies: A New Approach to Produce Quality Triangulations of Polygonal Domains with Holes 1992 8 COMPGEOM Mitchell & Vavasis, Quality Mesh Generation in Three Dimensions 1992 8 COMPGEOM Bern & Dobkin & Eppstein, Triangulating Polygons without Large Angles 1992 8 COMPGEOM Karasik & Sharir, Optical Computational Geometry 1992 8 COMPGEOM Boissonnat & Devillers & Donati & Preparata, Stable Placements of Spider Robots 1992 8 COMPGEOM Canny & Donald & Ressler, A Rational Rotation Method for Robust Geometric Algorithms 1992 8 COMPGEOM Cohen & Di Battista & Tamassia & Tollis & Bertolazzi, A Framework for Dynamic Graph Drawing 1992 8 COMPGEOM Bronnimann & Chazelle, How Hard is Halfspace Range Searching? 1992 8 COMPGEOM Matousek, Range Searching with Efficient Hierarchical Cuttings 1992 8 COMPGEOM Schwarzkopf, Ray Shooting in Convex Polytopes 1992 8 COMPGEOM Soltan & Gorpinevich, Minimum Dissection of Rectilinear Region with Arbitrary Holes into Rectangles 1992 8 COMPGEOM Mount, Intersection Detection and Separators for Simple Polygons 1992 8 COMPGEOM Klein & Lingas, Manhattonian Proximity in a Simple Polygon 1992 8 COMPGEOM Katoh & Iwano, Finding k Farthest Pairs and k Closest Pairs/Farthest Bichromatic Pairs for Points in the Plane 1992 8 COMPGEOM Schwarz & Smid & Snoeyink, An Optimal Algorithm for On-line Closest-Pair Problem 1992 8 COMPGEOM Alon & Azar, On-line Steiner Trees in the Euclidean Plane 1992 8 COMPGEOM Snyder & Steele, A Priori Inequalities for the Euclidean Traveling Salesman 1992 8 COMPGEOM Aurenhammer & Hoffmann & Aronov, Minkowski-type Theorems and Least-Squares Partitioning 1992 8 COMPGEOM Schipper, Determining Contractibility of Curves 1991 7 COMPGEOM Matousek, Efficient Partition Trees 1991 7 COMPGEOM Agarwal & Sharir, Counting Circular Arc Intersections 1991 7 COMPGEOM de Berg & Halperin & Overmars & Snoeyink & van Kreveld, Efficient Ray Shooting and Hidden Surface Removal 1991 7 COMPGEOM Katz & Overmars & Sharir, Efficient Hidden Surface Removal for Objects with Small Union Size 1991 7 COMPGEOM Agarwal & van Kreveld & Overmars, Intersection Queries for Curved Objects 1991 7 COMPGEOM de Berg & van Kreveld & Nilsson, Shortest Path Queries in Rectilinear Worlds of Higher Dimension 1991 7 COMPGEOM Chiang & Tamassia, Dynamization of the Trapezoid Method for Planar Point Location 1991 7 COMPGEOM Bhattacharya & Czyzowicz & Egyed & Stojmenovic & Toussaint & Urrutia, Computing Shortest Transversals of Sets 1991 7 COMPGEOM Bhattacharya & Jadhav & Mukhopadhayay & Robert, Optimal Algorithms for Some Smallest Intersection Radius Problems 1991 7 COMPGEOM Coxeter, Orthoganal Trees 1991 7 COMPGEOM Avis & Fukuda, A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra 1991 7 COMPGEOM Aronov & O'Rourke, Nonoverlap of the Star Unfolding 1991 7 COMPGEOM Mulmuley, A Generalization of Dehn-Sommerville Relations to Simple Stratified Spaces 1991 7 COMPGEOM Mulmuley, Randomized Multidimensional Search Trees: Dynamic Sampling 1991 7 COMPGEOM Mulmuley & Sen, Dynamic Point Location in Arrangements of Hyperplanes 1991 7 COMPGEOM Aurenhammer & Schwarzkopf, A Simple On-line Randomized Incremental Algorithm for Computing Higher Order Voronoi Diagrams 1991 7 COMPGEOM Clarkson & Cole & Tarjan, Randomized Parallel Algorithms for Trapezoidal Diagrams 1991 7 COMPGEOM Balog & Barany, On the Convex Hull of the Integer Points in a Disc 1991 7 COMPGEOM Icking & Klein, The Two Guards Problem 1991 7 COMPGEOM Toledo, Extremal Polygon Containment Problems 1991 7 COMPGEOM Alt & Behrends & Blomer, Approximate Matching of Polygonal Shapes 1991 7 COMPGEOM Huttenlocher & Kedem & Sharir, The Upper Envelope of Voronoi Surfaces and its Applications 1991 7 COMPGEOM Morgan, Minimal Surfaces, Crystals, and Norms on R^n 1991 7 COMPGEOM Schaudt & Drysdale, Multiplicatively Weighted Crystal Growth Voronoi Diagrams 1991 7 COMPGEOM Wilfong, Nearest Neighbor Problems 1991 7 COMPGEOM Dickerson & Drysdale, Enumerating k Distances for n Points in the Plane 1991 7 COMPGEOM Monma & Suri, Transitions in Geometric Minimum Spanning Trees 1991 7 COMPGEOM Kenyon & Kenyon, How to Take Short Cuts 1991 7 COMPGEOM Salowe, Construction of Multidimensional Spanner Graphs, with Applications to Minimum Spanning Trees 1991 7 COMPGEOM Tokuyama & Nakano, Geometric Algorithms for a Minimum Cost Assignment Problem 1991 7 COMPGEOM Bertolazzi & Di Battista, On Upward Drawing Testing of Triconnected Digraphs 1991 7 COMPGEOM Formann & Wagner, A Packing Problem with Applications to Lettering of Maps 1991 7 COMPGEOM Coullard & Lubiw, Distance Visibility Graphs 1991 7 COMPGEOM Asano & Guibas & Tokuyama, Walking on an Arrangement Topologically 1991 7 COMPGEOM Aronov & Matousek & Sharir, On the Sum of Squares of Cell Complexities in Hyperplane Arrangements 1991 7 COMPGEOM Halperin, On the Complexity of a Single Cell in Certain Arrangements of Surfaces in 3-space 1991 7 COMPGEOM Arkin & Halperin & Kedem & Mitchell & Naor, Arrangements of Segments that Share Endpoints: Single Face Results 1991 7 COMPGEOM Fortune & Milenkovic, Numerical Stability of Algorithms for Line Arrangements 1991 7 COMPGEOM Bern & Eppstein, Polynomial-size Nonobtuse Triangulation of Polygons 1991 7 COMPGEOM Aronov & Erdos & Goddard & Kleitman & Klugerman & Pach & Schulman, Crossing Families 1991 7 COMPGEOM Rajan, Optimality of the Delaunay Triangulation in R^d 1991 7 COMPGEOM Dey, Decomposition and CSG Representation of Polyhedra with Arbitrary Genus 1990 6 COMPGEOM Matousek, Cutting Hyperplane Arrangements 1990 6 COMPGEOM Pach & Woeginger, Some New Bounds for Epsilon-Nets 1990 6 COMPGEOM How to Net a Lot with Little: Small epsilon-Nets for Disks and Halfspaces 1990 6 COMPGEOM Chazelle & Sharir & Welzl, Quasi-Optimal Upper Bounds for Simplex Range Searching and New Zone Theorems 1990 6 COMPGEOM Kirkpatrick & Klawe & Tarjan, Polygon Triangulation in O(n log log n) Time with Simple Data-Structures 1990 6 COMPGEOM Edelsbrunner & Tan & Waupotitsch, An O(n^2 log n) Time Algorithm for the MinMax Angle Triangulation 1990 6 COMPGEOM Heffernan & Mitchell, Structured Visibility Profiles with Applications to Problems in Simple Polygons (extended abstract) 1990 6 COMPGEOM Mitchell & Rote & Woeginger, Minimum-Link Paths Among Obstacles in the Plane (extended abstract) 1990 6 COMPGEOM Goodrich & Shauck & Guha, Parallel Methods for Visibility and Shortest Path Problems in Simple Polygons (Preliminary Version) 1990 6 COMPGEOM Cappell & Goodman & Pach & Pollack & Sharir & Wenger, The Combinatorial Complexity of Hyperplane Transversals 1990 6 COMPGEOM Gritzmann & Klee & Westwater, On the Limited Power of Linear Probes and Other Optimization Oracles 1990 6 COMPGEOM Vegter & Yap, Computational Complexity of Combinatorial Surfaces (Extended Abstract) 1990 6 COMPGEOM Aronov & Chazelle & Edelsbrunner & Guibas & Sharir & Wenger, Points and Triangles in the Plane and Halving Planes in Space 1990 6 COMPGEOM Chazelle & Edelsbrunner & Guibas & Hershberger & Seidel & Sharir, Slimming Down by Adding; Selecting Heavily Covered Points 1990 6 COMPGEOM Girault-Beauquier & Nivat, Tiling the Plane with One Tile 1990 6 COMPGEOM Snoeyink, A Trivial Knot Whose Spanning Disks Have Exponential Size 1990 6 COMPGEOM Bajaj, Geometric Computations with Algebraic Varieties of Bounded Degree 1990 6 COMPGEOM Natarajan, On Computing the Intersection of B-Splines (Extended Abstract) 1990 6 COMPGEOM Overmars & Sharir, Merging Visibility Maps 1990 6 COMPGEOM Pellegrini, Stabbing and Ray Shooting in 3 Dimensional Space 1990 6 COMPGEOM Bentley, K-d Trees for Semidynamic Point Sets 1990 6 COMPGEOM Koutsoupias & Papadimitriou & Sideri, On the Optimal Bisection of a Polygon (Extended Abstract) 1990 6 COMPGEOM Agarwal & Edelsbrunner & Schwarzkopf & Welzl, Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs 1990 6 COMPGEOM Seidel, Linear Programming and Convex Hulls Made Easy 1990 6 COMPGEOM Fleischer & Mehlhorn & Rote & Welzl & Yap, On Simultaneous Inner and Outer Approximation of Shapes 1990 6 COMPGEOM Aonuma & Imai & Imai & Tokuyama, Maximin Location of Convex Objects in a Polygon and Related Dynamic Voronoi Diagrams 1990 6 COMPGEOM Li & Milenkovic, Constructing Strongly Convex Hulls Using Exact or Rounded Arithmetic 1990 6 COMPGEOM Milenkovic & Nackman, Finding Compact Coordinate Representations for Polygons and Polyhedra (Extended Abstract) 1990 6 COMPGEOM Bienstock, Some Provably Hard Crossing Number Problems 1990 6 COMPGEOM Kranakis & Pocchiola, Enumeration and Visibility Problems in Integer Lattices (Extended Abstract) 1990 6 COMPGEOM Canny & Rege & Reif, An Exact Algorithm for Kinodynamic Planning in the Plane 1990 6 COMPGEOM Alt & Fleischer & Kaufmann & Mehlhorn & Naher & Schirra & Uhrig, Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures 1990 6 COMPGEOM Donald & Xavier, Provably Good Approximation Algorithms for Optimal Kinodynamic Planning for Cartesian Robots and Open Chain Manipulators 1990 6 COMPGEOM Lee & Chen & Yang, Shortest Rectilinear Paths among Weighted Obstacles 1990 6 COMPGEOM Snyder, On Minimal Rectilinear Steiner Trees in All Dimensions 1990 6 COMPGEOM Agarwal & Aronov & Sharir & Suri, Selecting Distances in the Plane 1990 6 COMPGEOM Skiena & Smith & Lemke, Reconstructing Sets From Interpoint Distances (Extended Abstract) 1990 6 COMPGEOM Huttenlocher & Kedem, Computing the Minimum Hausdorff Distance for Point Sets Under Translation 1990 6 COMPGEOM Melissaratos & Souvaine, On Solving Geometric Optimization Problems Using Shortest Paths 1990 6 COMPGEOM Chen & Han, Shortest Paths on a Polyhedron 1990 6 COMPGEOM Knight & May & McAffer & Nguyen & Sack, A Computational Geometry Workbench 1989 5 COMPGEOM Matousek, Construction of Epsilon Nets 1989 5 COMPGEOM Agarwal, A Deterministic Algorithm for Partitioning Arrangements of Lines and Its Applications 1989 5 COMPGEOM Paterson & Yao, Binary Partitions with Applications to Hidden Surface Removal and Solid Modelling 1989 5 COMPGEOM Mulmuley, A Fast Planar Partition Algorithm, II 1989 5 COMPGEOM Shor & Van Wyk, Detecting and Decomposing Self-overlapping Curves 1989 5 COMPGEOM Di Batista & Tamassia & Tollis, Area Requirement and Symmetry Display in Drawing Graphs 1989 5 COMPGEOM Vegter, Kink-free Deformations of Polygons 1989 5 COMPGEOM Ke, An Efficient Algorithm for Link-Distance Problems 1989 5 COMPGEOM Roy & Recio, Algorithms in Real Algebraic Geometry and Their Applications 1989 5 COMPGEOM Kaltofen, Computing the Irreducible Real Factors of an Algebraic Curve 1989 5 COMPGEOM Abhyankar & Chandrasekar & Chandru, Degree Complexity Bounds on the Intersection of Algebraic Curves 1989 5 COMPGEOM Bajaj & Ihm, Hermite Interpolation of Rational Space Curves Using Real Algebraic Surfaces 1989 5 COMPGEOM Atallah & Tsay, On the Parallel Decomposability of Geometric Problems 1989 5 COMPGEOM Atallah & Chen, Optimal Parallel Algorithm for Visibility of a Simple Polygon from a Point 1989 5 COMPGEOM Matousek & Welzl, Good Splitters for Counting Points in Triangles 1989 5 COMPGEOM Chazelle & Rosenberg, Computing Partial Sums in Multidimensional Arrays 1989 5 COMPGEOM Barany & Furedi & Lovasz, On the Number of Halving Planes 1989 5 COMPGEOM Edelsbrunner, An Acyclicity Theorem for Cell Complexes in d Dimensions 1989 5 COMPGEOM Pollack & Wenger, Necessary and Sufficient Conditions for Hyperplane Transversals 1989 5 COMPGEOM Halperin & Overmars, Efficient Motion Planning for an L-shaped Object 1989 5 COMPGEOM Chew & Kedem, Placing the Largest Similar Copy of a Convex Polygon among Polygonal Obstacles 1989 5 COMPGEOM Friedman & Hershberger & Snoeyink, Compliant Motion in a Simple Polygon 1989 5 COMPGEOM Briggs, An Efficient Algorithm for One-Step Planar Compliant Motion Planning with Uncertainty 1989 5 COMPGEOM Sproull, Computing on Geometry 1989 5 COMPGEOM Milenkovic, Calculating Approximate Curve Arrangements Using Rounded Arithmetic 1989 5 COMPGEOM Salesin & Stolfi & Guibas, Epsilon Geometry: Building Robust Algorithms from Imprecise Computations 1989 5 COMPGEOM Brisson, Representing Geometric Structures in d Dimensions: Topology and Order 1989 5 COMPGEOM Lienhardt, Subdivisions of n-Dimensional Spaces and n-Dimensional Generalized Maps 1989 5 COMPGEOM Boissonnat & Yvinec, Probing a Scene of Non Convex Polyhedra 1989 5 COMPGEOM Bhattacharya & Kirkpatrick & Toussaint, Determining Sector Visibility of a Polygon 1989 5 COMPGEOM Hershberger & Suri, Finding Tailored Partitions 1989 5 COMPGEOM Imai & Sumino & Imai, Minimax Geometric Fitting of Two Corresponding Sets of Points 1989 5 COMPGEOM Ho & Lee & Chang & Wong, Bounded Diameter Minimum Spanning Trees and Related Problems 1989 5 COMPGEOM Aggarwal & Imai & Katoh & Suri, Finding k Points with Minimum Diameter and Related Problems 1989 5 COMPGEOM Bern & Karloff & Raghavan & Schieber, Fast Geometric Approximation Techniques and Geometric Embedding Problems 1989 5 COMPGEOM Marcotte & Suri, On Geometric Matching 1989 5 COMPGEOM Agarwal, Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number 1989 5 COMPGEOM Dwyer, Higher-dimensional Voronoi Diagrams in Linear Expected Time 1989 5 COMPGEOM Arkin & Connelly & Mitchell, On Monotone Paths among Obstacles with Applications to Planning Assemblies 1989 5 COMPGEOM Liou & Tan & Lee, Minimum Partitioning Simple Rectilinear Polygons in O(n log log n) Time 1989 5 COMPGEOM Snoeyink & Hershberger, Sweeping Arrangements of Curves 1989 5 COMPGEOM Egyed & Wenger, Stabbing Pairwise Disjoint Translates in Linear Time 1989 5 COMPGEOM O'Rourke & Schevon, Computing the Geodesic Diameter of a 3-Polytope 1989 5 COMPGEOM Ruppert & Seidel, On the Difficulty of Tetrahedralizing 3-Dimensional Non-convex Polyhedra 1989 5 COMPGEOM Chazelle & Palios, Triangulating a Non-convex Polytope 1988 4 COMPGEOM Clarkson, Applications of Random Sampling in Computational Geometry, II 1988 4 COMPGEOM Clarkson & Shor, Algorithms for Diametral Pairs and Convex Hulls that are Optimal, Randomized, and Incremental 1988 4 COMPGEOM Clarkson & Tarjan & Van Wyk, A Fast Las Vegas Algorithm for Triangulating a Simple Polygon 1988 4 COMPGEOM Welzl, Partition Trees for Triangle Counting and Other Range Searching Problems 1988 4 COMPGEOM Willard & Wee, Quasi-Valid Range Querying and its Implications for Nearest Neighbor Problems 1988 4 COMPGEOM Edelsbrunner & Guibas & Sharir, The Complexity of Many Faces in Arrangements of Lines and of Segments 1988 4 COMPGEOM Edelsbrunner & Guibas & Hershberger & Seidel & Sharir & Snoeyink & Welzl, Implicitly Representing Arrangements of Lines or Segments 1988 4 COMPGEOM Agarwal & Sharir, Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection 1988 4 COMPGEOM Buchberger, Algebraic Methods for Non-Linear Computational Geometry (Abstract) 1988 4 COMPGEOM Ericson & Yap, The Design of LINETOOL, a Geometric Editor 1988 4 COMPGEOM Dobkin & Silver, Recipes for Geometry and Numerical Analysis--Part I: An Empirical Study 1988 4 COMPGEOM Hoffmann & Hopcroft & Karasick, Towards Implementing Robust Geometric Computations 1988 4 COMPGEOM Edelsbrunner & Mucke, Simulation of Simplicity: A Technique to Cope with Degenerate Cases in Geometric Algorithms 1988 4 COMPGEOM Yap, A Geometric Consistency Theorem for a Symbolic Perturbation Scheme 1988 4 COMPGEOM Mount & Saalfeld, Globally-Equiangular Triangulations of Co-Circular Points in O(n log n) Time 1988 4 COMPGEOM Golin & Sedgewick, Analysis of a Simple Yet Efficient Convex Hull Algorithm 1988 4 COMPGEOM Overmars & Welzl, New Methods for Computing Visibility Graphs 1988 4 COMPGEOM Kapoor & Maheshwari, Efficient Algorithms for Euclidean Shortest Path and Visibility Problems with Polygonal Obstacles 1988 4 COMPGEOM Bern, Hidden Surface Removal for Rectangles 1988 4 COMPGEOM Reif & Sen, An Efficient Output-Sensitive Hidden-Surface Removal Algorithm and Its Parallelization 1988 4 COMPGEOM Cole & Goodrich, Optimal Parallel Algorithms for Polygon and Point-Set Problems 1988 4 COMPGEOM Motwani & Raghunathan & Saran, Covering Orthogonal Polygons with Star Polygons: The Perfect Graph Approach 1988 4 COMPGEOM Dobkin & Edelsbrunner & Overmars, Searching for Empty Convex Polygons 1988 4 COMPGEOM Aronov & Fortune & Wilfong, The Furthest-Site Geodesic Voronoi Diagram 1988 4 COMPGEOM Monma & Paterson & Suri & Yao, Computing Euclidean Maximum Spanning Trees 1988 4 COMPGEOM Asano & Bhattacharya & Keil & Yao, Clustering Algorithms Based on Minimum and Maximum Spanning Trees 1988 4 COMPGEOM Edelsbrunner & Guibas & Hershberger & Pach & Pollack & Seidel & Sharir & Snoeyink, On Arrangements of Jordan Arcs with Three Intersections per Pair 1988 4 COMPGEOM Gewali & Meng & Mitchell & Ntafos, Path Planning in 0/1/infinity Weighted Regions with Applications 1988 4 COMPGEOM Wilfong, Motion Planning in the Presence of Movable Obstacles 1988 4 COMPGEOM Guibas & Sharir & Sifrony, On the General Motion Planning Problem with Two Degrees of Freedom 1988 4 COMPGEOM Natarajan, On Planning Assemblies 1988 4 COMPGEOM Donald, The Complexity of Planar Compliant Motion Planning Under Uncertainty 1988 4 COMPGEOM Sharir & Sifrony, Coordinated Motion Planning for Two Independent Robots 1988 4 COMPGEOM Kedem & Sharir, An Automatic Motion Planning System for a Convex Polygonal Mobile Robot in 2-Dimensional Polygonal Space 1988 4 COMPGEOM Mitchell, On Maximum Flows in Polyhedral Domains 1988 4 COMPGEOM Yamamoto & Kato & Imai & Imai, Algorithms for Vertical and Orthogonal L_1 Linear Approximation of Points 1988 4 COMPGEOM Jaromczyk & Kowaluk, Skewed Projections with an Application to Line Stabbing in R^3 1988 4 COMPGEOM McKenna & O'Rourke, Arrangements of Lines in 3-Space: A Data Structure with Applications 1988 4 COMPGEOM Aronov & Sharir, Triangles in Space or Building (and Analyzing) Castles in the Air 1988 4 COMPGEOM Gao & Jerrum & Kaufmann & Mehlhorn & Rulling & Storb, On Continuous Homotopic One Layer Routing 1987 3 COMPGEOM Lenhart & Pollack & Sack & Seidel & Sharir & Suri & Toussaint & Whitesides & Yap, Computing the Link Center of a Simple Polygon 1987 3 COMPGEOM Hershberger, Finding the Visibility Graph of a Simple Polygon in Time Proportional to Its Size 1987 3 COMPGEOM Aurenhammer, Jordan Sorting Via Convex Hulls of Certain Non-simple Polygons 1987 3 COMPGEOM Mitchell & Papadimitriou, The Weighted Region Problem 1987 3 COMPGEOM Aronov, On the Geodesic Voronoi Diagram of Point Sites in a Simple Polygon 1987 3 COMPGEOM Guibas & Hershberger, Optimal Shortest Path Queries in a Simple Polygon 1987 3 COMPGEOM Suri, The All-Geodesic Furthest Neighbor Problem for Simple Polygons 1987 3 COMPGEOM Stolfi, Oriented Projective Geometry 1987 3 COMPGEOM Dobkin & Laszlo, Primitives for the Manipulation of Three-Dimensional Subdivisions 1987 3 COMPGEOM De Floriani, A Graph Based Approach to Object Feature Recognition 1987 3 COMPGEOM Franklin, Polygon Properties Calculated from the Vertex Neighborhoods 1987 3 COMPGEOM Ottmann & Thiemt & Ullrich, Numerical Stability of Geometric Algorithms 1987 3 COMPGEOM Drysdale & Jerard, Discrete Simulation of NC Machining 1987 3 COMPGEOM Ke & O'Rourke, Moving a Ladder in Three Dimensions: Upper and Lower Bounds 1987 3 COMPGEOM Natarajan, On Detecting the Orientation of Polygons and Polyhedra 1987 3 COMPGEOM Canny & Donald, Simplified Voronoi Diagrams 1987 3 COMPGEOM Alevizos & Boissonnat & Yvinec, An Optimal O(n log n) Algorithm for Contour Reconstruction from Rays 1987 3 COMPGEOM Bajaj & Kim, Compliant Motion Planning with Geometric Models 1987 3 COMPGEOM Seidel, On the Number of Faces in Higher-Dimensional Voronoi Diagrams 1987 3 COMPGEOM Dillencourt, Toughness and Delaunay Triangulations 1987 3 COMPGEOM Saalfeld, Joint Triangulations and Triangulation Maps 1987 3 COMPGEOM Dadoun & Kirkpatrick, Parallel Processing for Efficient Subdivision Search 1987 3 COMPGEOM Chew, Constrained Delaunay Triangulations 1987 3 COMPGEOM Wang & Schubert, An Optimal Algorithm for Constructing the Delaunay Triangulation of a Set of Line Segments 1987 3 COMPGEOM Jaromczyk & Kowaluk, A Note on Relative Neighborhood Graphs 1987 3 COMPGEOM Avnaim & Boissonnat, Simultaneous Containment of Several Polygons 1987 3 COMPGEOM Clarkson & Kapoor & Vaidya, Rectilinear Shortest Paths through Polygonal Obstacles in O(n log^2 n) Time 1987 3 COMPGEOM Edahiro & Tanaka & Hoshino & Asano, A Bucketing Algorithm for the Orthogonal Segment Intersection Search Problem and its Practical Efficiency 1987 3 COMPGEOM Reckhow & Culberson, Covering a Simple Orthogonal Polygon with a Minimum Number of Orthogonally Convex Polygons 1987 3 COMPGEOM Aggarwal & Suri, Fast Algorithms for Computing the Largest Empty Rectangle 1987 3 COMPGEOM Munro & Overmars & Wood, Variations on Visibility 1987 3 COMPGEOM Avis & Wenger, Algorithms for Line Transversals in Space 1987 3 COMPGEOM Alt & Mehlhorn & Wagener & Welzl, Congruence, Similarity, and Symmetries of Geometric Objects 1987 3 COMPGEOM Kirkpatrick, Establishing Order in Planar Subdivisions 1987 3 COMPGEOM Rappaport, Computing Simple Circuits from a Set of Line Segments is NP-Complete 1987 3 COMPGEOM Alon & Haussler & Welzl, Partitioning and Geometric Embedding of Range Spaces of Finite Vapnik-Chervonenkis Dimension 1987 3 COMPGEOM Warren, Blending Quadric Surfaces with Quadric and Cubic Surfaces 1987 3 COMPGEOM Schwartz & Stanton, Analyzing Surfaces: The Truth about Elimination Theory 1986 2 COMPGEOM Guibas & Hershberger & Leven & Sharir & Tarjan, Linear Time Algorithms for Visibility and Shortest Path Problems Inside Simple Polygons 1986 2 COMPGEOM Suri & O'Rourke, Worst-case Optimal Algorithms for Constructing Visibility Polygons with Holes 1986 2 COMPGEOM Chin & Ntafos, Optimum Watchman Routes 1986 2 COMPGEOM Wang & Chan, Finding the Minimum Visible Vertex Distance Between Two Non-intersecting Simple Polygons 1986 2 COMPGEOM Keil, Minimally Covering a Horizontally Convex Orthogonal Polygon 1986 2 COMPGEOM Rappaport & Imai & Toussaint, On Computing Simple Circuits on a Set of Line Segments 1986 2 COMPGEOM Haussler & Welzl, Epsilon-Nets and Simplex Range Queries 1986 2 COMPGEOM Lingas, On Approximation Behavior and Implementation of the Greedy Triangulation for Convex Planar Point Sets 1986 2 COMPGEOM Willard, On the Application of Sheared Retrieval to Orthogonal Range Queries 1986 2 COMPGEOM Guibas & Seidel, Computing Convolutions by Reciprocal Search 1986 2 COMPGEOM Levcopoulos, Fast Heuristics for Minimum Length Rectangular Partitions of Polygons 1986 2 COMPGEOM Klein & Nurmi & Ottmann & Wood, Optimal Dynamic Solutions for Fixed Windowing Problems 1986 2 COMPGEOM Vijayan, Geometry of Planar Graphs with Angles 1986 2 COMPGEOM Crapo & Ryan, Scene Analysis and Geometric Homology 1986 2 COMPGEOM Avis & ElGindy, Triangulating Simplicial Point Sets in Space 1986 2 COMPGEOM Whiteley, Two Algorithms for Polyhedral Pictures 1986 2 COMPGEOM Mount, Storing the Subdivision of a Polyhedral Surface 1986 2 COMPGEOM Schoen, A Defect-Correction Algorithm for Minimizing the Volume of a Simple Polyhedron which Circumscribes a Sphere 1986 2 COMPGEOM Chew, There is a Planar Graph Almost as Good as the Complete Graph 1986 2 COMPGEOM Sifrony & Sharir, A New Efficient Motion-Planning Algorithm for a Rod in Polygonal Space 1986 2 COMPGEOM Maddila & Yap, Moving a Polygon Around the Corner in a Corridor 1986 2 COMPGEOM Sharir & Baltsan, On Shortest Paths Amidst Convex Polyhedra 1986 2 COMPGEOM Visvanathan & Milor, An Efficient Algorithm to Determine the Image of a Parallelepiped Under a Linear Transformation 1986 2 COMPGEOM Atallah & Goodrich, Efficient Plane Sweeping in Parallel (Preliminary Version) 1986 2 COMPGEOM Fjallstrom, Smoothing of Polyhedral Models 1986 2 COMPGEOM Zhang & Bowyer, CSG Set-theoretic Solid Modelling and NC Machining of Blend Surfaces 1986 2 COMPGEOM Field, Implementing Watson's Algorithm in Three Dimensions 1986 2 COMPGEOM Boissonnat & Teillaud, An Hierarchical Representation of Objects: The Delaunay Tree 1986 2 COMPGEOM Devai, Quadratic bounds for Hidden Line Elimination 1986 2 COMPGEOM Dwyer, A Simple Divide-and-Conquer Algorithm for Computing Delaunay Triangulations in O(n log log n) Expected Time 1986 2 COMPGEOM Aggarwal & Klawe & Moran & Shor & Wilber, Geometric Applications of a Matrix Searching Algorithm 1986 2 COMPGEOM Chazelle & Edelsbrunner, Linear Data Structures for Two Types of Range Search 1986 2 COMPGEOM Motwani & Raghavan, Deferred Data Structuring: Query-driven Preprocessing for Geometric Search Problems 1986 2 COMPGEOM Fortune, A Sweepline Algorithm for Voronoi Diagrams 1985 1 COMPGEOM Houle & Toussaint, Computing the Width of a Set 1985 1 COMPGEOM Davis, Computing Separating Planes for Pairs of Disjoint Convex Polyhedra 1985 1 COMPGEOM Little, Extended Gaussian Images, Mixed Volumes, Shape Reconstruction 1985 1 COMPGEOM McKenna & Seidel, Finding the Optimal Shadows of a Convex Polytope 1985 1 COMPGEOM Segal & Sequin, Consistent Calculations for Solids Modelling 1985 1 COMPGEOM Sinha & Klassen & Wang, Exploiting Topological and Geometric Properties for Selective Subdivision 1985 1 COMPGEOM Boissonnat, An Hierarchical Object-centered Representation of Objects: The Delaunay Tree 1985 1 COMPGEOM Dadoun & Kirkpatrick & Walsh, The Geometry of Beam Tracing 1985 1 COMPGEOM Joseph & Plantinga, On the Complexity of Reachability and Motion Planning Questions 1985 1 COMPGEOM Koutsou, A Geometric Reasoning System for Moving an Object While Maintaining Contact with Others 1985 1 COMPGEOM Kedem & Sharir, An Efficient Algorithm for Planning Collision-free Translational Motion of a Convex Polygonal Object in 2-dimensional Space Amidst Polygonal Obstacles 1985 1 COMPGEOM Guting & Nurmi & Ottmann, The Direct Dominance Problem 1985 1 COMPGEOM Kirkpatrick & Seidel, Output-size Sensitive Algorithms for Finding Maximal Vectors 1985 1 COMPGEOM Lubiw, Decomposing Polygonal Regions into Convex Quadrilaterals 1985 1 COMPGEOM Chazelle & Preparata, Halfspace Range Search: An Algorithmic Application of k-sets 1985 1 COMPGEOM Avis, On the Partitionability of Point Sets in Space 1985 1 COMPGEOM Goodman & Pollack, Modelling Planar Configurations 1985 1 COMPGEOM Chazelle, New Techniques for Computing Order Statistics in Euclidean Space 1985 1 COMPGEOM Chazelle & Guibas, Visibility and Intersection Problems in Plane Geometry 1985 1 COMPGEOM Wismath, Characterizing Bar Line-of-sight Graphs 1985 1 COMPGEOM Lipton & North & Sandberg, How to Draw a Graph 1985 1 COMPGEOM Avis & Rappaport, Computing the Largest Empty Convex Subset of a Set of Points 1985 1 COMPGEOM Fries & Mehlhorn & St. Naher, Dynamization of Geometric Data Structures 1985 1 COMPGEOM Overmars, Range Searching in a Set of Line Segments 1985 1 COMPGEOM Widmayer & Wu & Wong, Distance Problems in Computational Geometry for Fixed Orientations 1985 1 COMPGEOM Hoffmann & Mehlhorn & Rosenstiehl & Tarjan, Sorting Jordan Sequences in Linear Time 1985 1 COMPGEOM deRezende & Lee & Wu, Rectilinear Shortest Paths with Rectangular Barriers 1985 1 COMPGEOM Chew, Planning the Shortest Path for a Disc in O(n^2 log n) Time 1985 1 COMPGEOM Leven & Sharir, An Efficient and Simple Motion Planning Algorithm for a Ladder Moving in Two-dimensional Space Amidst Polygonal Barriers 1985 1 COMPGEOM Chazelle & Edelsbrunner, An Improved Algorithm for Constructing kth-order Voronoi Diagrams 1985 1 COMPGEOM Chew & Drysdale, Voronoi Diagrams Based on Convex Distance Functions 1985 1 COMPGEOM Dehne & Noltemeier, A Computational Geometry Approach to Clustering Problems 1985 1 COMPGEOM Edelsbrunner & Seidel, Voronoi Diagrams and Arrangements 1985 1 COMPGEOM Miller & Stout, Pyramid Computer Algorithms for Determining Geometric Properties of Images 1985 1 COMPGEOM Puech & Yahia, Quadtrees, Octrees, Hyperoctrees: A Unified Analytical Approach to Tree Data Structures Used in Graphics, Geometric Modeling and Image Processing 1985 1 COMPGEOM Gonzalez & Zheng, Bounds for Partitioning Rectilinear Polygons 1985 1 COMPGEOM Lingas, On Partitioning Polygons 1985 1 COMPGEOM Aggarwal & Booth & O'Rourke & Suri & Yap, Finding Minimal Convex Nested Polygons 1985 1 COMPGEOM Culberson & Rawlins, Turtlegons: Generating Simple Polygons from Sequences of Angles 1985 1 COMPGEOM Wood & Yap, Computing a Convex Skull of an Orthogonal Polygon 1985 1 COMPGEOM Overmars & Welzl, The Complexity of Cutting Paper 1990 COMPGT Proskurowski & Syslo, Efficient Computations in Tree-Like Graphs 1990 COMPGT Mohring, Graph Problems Related to Gate Matrix Layout and PLA Folding 1990 COMPGT Nishizeki, Planar Graph Problems 1990 COMPGT Mayr, Basic Parallel Algorithms in Graph Theory 1990 COMPGT Helmbold & Mayr, Applications of Parallel Scheduling Algorithms to Families of Perfect Graphs 1990 COMPGT Faigle & Schrader, Orders and Graphs 1990 COMPGT Noltemeier, Dynamic Partial Orders and Generalized Heaps 1990 COMPGT Faigle & Turan, Communication Complexity 1990 COMPGT Rote, Path Problems in Graphs 1990 COMPGT de Werra, Heuristics for Graph coloring 1990 COMPGT Frieze, Probabilistic Analysis of Graph Algorithms 1990 COMPGT Tinhofer, Generating Graphs Uniformly at Random 1990 COMPGT Monien & Sudborough, Embedding one Interconnection Network in Another 1988 COMPINFT Yao, Computational Information Theory 1988 COMPINFT Orlitsky & El Gamal, Communication Complexity 1988 COMPINFT Traub, Introduction to Information-Based Complexity 1988 COMPINFT Baum, Complete Representations for Learning from Examples 1988 COMPINFT Hopfield, Collective Computation, Content-Addressable Memory, and Optimization Problems 1988 COMPINFT Abu-Mostafa, Complexity of Random Problems 1997 13 COMPINT Halpern, A Critical Reexamination of Default Logic, Autoepistemic Logic, and Only Knowing 1996 12 COMPINT Siegelmann, Recurrent Neural Networks and Finite Automata 1996 12 COMPINT Blair & Mutchler & van Lent, Reprised Article: Perfect Recall and Pruning in Games with Imperfect Information 1995 11 COMPINT Gerevini & Schubert, On Computing the Minimal Labels in Time Point Algebra Networks 1994 10 COMPINT Weir, Linear Iterated Pushdowns 1994 10 COMPINT Kaji & Nakanishi & Seki & Kasami, The Computational Complexity of the Universal Recognition Problem for Parallel Multiple Context-Free Grammars 1994 10 COMPINT Lang, Recognition Can Be Harder Than Parsing 1994 10 COMPINT Johnson, Logical Embedded Push-Down Automata in Tree-Adjoining Grammar Parsing 1994 10 COMPINT Harbusch, Toward an Integrated Generation Approach with Tree-Adjoining Grammars 1994 10 COMPINT Kyburg, Believing on the Basis of the Evidence (along with many responses, and his own Logic, Science, and Engineering) 1993 9 COMPINT Golea & Marchand, Polynomial Time Algorithms for Learning Neural Nets of Nonoverlapping Perceptrons 1991 7 COMPINT Fagin & Halpern, Uncertainty, Belief, and Probability 1991 7 COMPINT Cerans & Smith, Self-learning Inductive Inference Machines 1991 7 COMPINT Morgan, Logic, Probability Theory, and Artificial Intelligence -- Part I: the Probabilistic Foundations of Logic 1990 6 COMPINT Dubois & Prade, Reply to Rejoinder 1990 6 COMPINT Schubert, Reply to Rejoinder 1990 6 COMPINT Bacchus, Probability and Logic: A Reply to Cheeseman 1990 6 COMPINT Halpern, Let Many Flowers Bloom: A Response to ``An Inquiry into Computer Understanding'' 1990 6 COMPINT Cheeseman, On the Importance of Evidence: A Response to Halpern 1989 5 COMPINT Allen & Hayes, Moments and Points in an Interval-based Temporal Logic 1989 5 COMPINT Dean & Kanazawa, A Model for Reasoning about Persistence and Causation 1989 5 COMPINT Halpern & McAllester, Likelihood, Probability, and Knowledge 1988 4 COMPINT McArthur, Reasoning about Knowledge and Belief: A Survey 1987 3 COMPINT Rendell, Similarity-based Learning and its Extensions 1987 3 COMPINT Abbott, Cohesion Methods in Inductive Learning 1987 3 COMPINT Matheus & Hohensee, Learning in Artificial Neural Systems 1987 3 COMPINT Banerji, A Discussion of a Report by Ehud Shapiro 1987 3 COMPINT Watanabe, Inductive Ambiguity and the Limits of Artificial Intelligence 1996 39 COMPJ Parhami, Parallel Threshold Voting 1996 39 COMPJ Sekerinski & Sere, A Theory of Prioritizing Composition 1996 39 COMPJ Peng & Sedukhin, Array Processors Design for Division-free Linear System Solving 1996 39 COMPJ Ward, Program Analysis by Formal Transformation 1996 39 COMPJ Gu & Peng, Optimal Algorithms for Node-to-Node Fault Tolerant Routing in Hypercubes 1996 39 COMPJ Nash & Dew & Dyer, A Scalable Shared Queue on a Distributed Memory Machine 1996 39 COMPJ Bozanis & Kitsios & Makris & Tsakalidis, Red-Blue Intersection Reporting for Objects of Non-constant Size 1996 39 COMPJ Majewski & Wormald & Havas & Czech, A Family of Perfect Hashing Methods 1996 39 COMPJ Fokkinga, Expressions That Talk About Themselves 1996 39 COMPJ Takaoka, A Left-to-Right Preprocessing Computation for the Boyer-Moore String Matching Algorithm 1996 39 COMPJ Hui & Martel, Randomized Competitive Algorithms for Successful and Unsuccessful Search 1996 39 COMPJ Hierons, Extending Test Sequence Overlap by Invertibility 1996 39 COMPJ Qian & Wu, Enhanced Fibonacci Cubes 1996 39 COMPJ Gedeon, The Cyclic Towers of Hanoi: An Iterative Solution Produced by Transformation 1996 39 COMPJ Pan & Dromey, Re-engineering Loops 1996 39 COMPJ Pan & Dromey, A Formal Basis for Removing goto Statements 1996 39 COMPJ Ould-Khaoua & Mackenzie & Sotudoh, Comparative Evaluation of Hypermesh and Multi-stage Interconnection Networks 1996 39 COMPJ Saiedian & Spencer, An Efficient Algorithm to Compute the Candidate Keys of a Relational Database Schema 1996 39 COMPJ Kranakis & Krizanc & Ravi, On Multi-label Linear Interval Routing Schemes 1996 39 COMPJ Pan & Hamdi & Singh, Selection on k-dimensional Meshes with Multiple Broadcasting 1996 39 COMPJ Jackson & Mahmoud, Parallel Pipelined Fractal Image Compression Using Quadtree Recomposition 1996 39 COMPJ Gu & Peng, An Efficient Algorithm for Node-to-Node Routing in Hypercubes with Faulty Clusters 1996 39 COMPJ Sekharan & Del Greco & Rathi, Space-Time Trade-offs in the Relative Unranking of Binary Trees 1995 38 COMPJ Leppanen, Performance of Work-optimal PRAM Simulation Algorithms on Coated Meshes 1995 38 COMPJ Chen, An Efficient Construction Algorithm for a Class of Implicit Double-ended Priority Queues 1995 38 COMPJ Moore & Graham, Tagged Up/Down Sorter -- A Hardware Priority Queue 1995 38 COMPJ Reiter & Gong, Securing Causal Relationships in Distributed Systems 1995 38 COMPJ Symvonis, Optimal Stable Merging 1995 38 COMPJ Koster & van der Weide, Hairy Search Trees 1995 38 COMPJ Thimbleby, A New Calculator and Why It Is Necessary 1995 38 COMPJ Turpin & Moffat, Practical Length-limited Coding for Large Alphabets 1995 38 COMPJ Eker, Associative-Commutative Matching via Bipartite Graph Matching 1995 38 COMPJ Shen, Efficient Parallel k-Set Chain Range-Join in Hypercubes 1995 38 COMPJ Kapelios & Panagopoulou & Papamichail & Sirmakessis & Tsakalidis, The `Cross' Rectangle Intersection Problem 1995 38 COMPJ Ahmad & Dhodhi, On the m-way Graph Partitioning Problem 1995 38 COMPJ Chen, A Degradable B^link-Tree with Periodic Data Reorganization 1995 38 COMPJ Wolff, `What is SP?': A Reply 1995 38 COMPJ Browne, The Embedding of Meshes and Trees into Degree Four Chordal Ring Networks 1994 37 COMPJ Ma & Knight & Petridis, A Revised Theory of Action and Time Based on Intervals and Points 1994 37 COMPJ Barsi & Pinotti, Time Optimal Mixed Radix Conversion for Residue Number Applications 1994 37 COMPJ Ward, Reverse Engineering through Formal Transformation: Knuth's `Polynomial Addition' Algorithm 1994 37 COMPJ Chu & Knott, An Analysis of Spiral Hashing 1994 37 COMPJ Oommen & Ng, A New Technique for Enhancing Linked-List Data Retrieval: Reorganize Data Using Artificially Synthesized Queries 1994 37 COMPJ McFarlane & Hoggar, Optimal Drivers for the `Random' Iteration Algorithm 1994 37 COMPJ Ganley & Heath, Optimal and Random Partitions of Random Graphs 1994 37 COMPJ Low & Christianson, Self-authenticating Proxies 1994 37 COMPJ Giddy & Safavi-Naini, Automated Cryptanalysis of Transposition Ciphers 1994 37 COMPJ Kinnersley & Kinnersley, An Efficient Polynomial-Time Algorithm for Three-Track Gate Matrix Layout 1994 37 COMPJ Majumdar, A Note on the Iterative Algorithm for the Reve's Puzzle 1994 37 COMPJ Christensen & Hirshfeld & Moller, Decidable Subsets of CCS 1994 37 COMPJ Franti & Nevalainen & Kaukoranta, Compression of Digital Images by Block Truncation Coding: A Survey 1994 37 COMPJ Zheng & Hardjono & Seberry, Reusing Shares in Secret Sharing Schemes 1994 37 COMPJ Hamdi & Hall, An Efficient Class of Interconnection Networks for Parallel Computations 1994 37 COMPJ Arazi, On Primality Testing Using Purely Divisionless Operations 1993 36 COMPJ Abolhassan & Drefenstedt & Keller & Paul, & Scheerer, On the Physical Design of PRAMs 1993 36 COMPJ Teuhola & Raita, Application of a Finite-State Model to Text Compression 1993 36 COMPJ Franti & Nevalainen, A Two-Stage Modelling Method for Compressing Binary Images by Arithmetic Coding 1993 36 COMPJ Goldberg, Finite State Automata from Regular Expression Trees 1993 36 COMPJ Fraenkel & Klein, Bounding the Depth of Search Trees 1993 36 COMPJ Breene, Quadtrees and Hypercubes: Grid Embedding Strategies Based on Spatial Data Structure Addressing 1993 36 COMPJ Chang & Chen, A New Locally Adaptive Data Compression Scheme Using Multilist Structure 1993 36 COMPJ Czech & Majewski, A Linear Time Algorithm for Finding Minimal Perfect Hash Functions 1993 36 COMPJ Khoong, Shortest-Path Reconstruction Algorithms 1993 36 COMPJ Atkinson, Uniform Generation of Rooted Ordered Trees with Prescribed Degrees 1992 35 COMPJ Boiten & Partsch & Tuijnman & Volker, How to Produce Correct Software -- An Introduction to Formal Specification and Program Development by Transformations 1992 35 COMPJ Harrison, A Higher-Order Approach to Parallel Algorithms 1992 35 COMPJ Barsi & Pinotti, Adding Flexibility to Hybrid Number Systems 1992 35 COMPJ Davis, A Fast Radix Sort 1992 35 COMPJ Huang & Langston, Fast Stable Merging and Sorting in Constant Extra Space 1992 35 COMPJ Korah & Kaimal, A Short Note on Perfectly Balanced Binary Search Trees 1992 35 COMPJ Galton, Classical Logic: a Crash Course for Beginners 1992 35 COMPJ Bertossi & Luccio & Pagli & Lodi, A Parallel Solution to the Approximate String Matching Problem 1992 35 COMPJ Ng & Oommen, A Short Note on Doubly-Linked List Reorganizing Heuristics 1992 35 COMPJ Jamieson & Olariu, Indexing for Multi-attribute Retrieval 1992 35 COMPJ Chang & Lin & Chen, Optimality Properties of the Disc Modulo Allocation Method for k-ary Multiple Key Hashing Files 1992 35 COMPJ Sprugnoli, Properties of Binary Trees Related to Position 1992 35 COMPJ Parhami, Systolic Number Radix Converters 1992 35 COMPJ Carlsson, A Note on HEAPSORT 1992 35 COMPJ Chiaramella & Chevallet, About Retrieval Models and Logic 1992 35 COMPJ Fuhr, Probabilistic Models in Information Retrieval 1992 35 COMPJ Turtle & Croft, A Comparison of Text Retrieval Models 1992 35 COMPJ van Rijsbergen, Probabilistic Retrieval Revisited 1992 35 COMPJ Chang & Chen & Chen, Symbolic Gray Code As a Data Allocation Scheme for Two-Disc Systems 1992 35 COMPJ Er, Efficient Generation of k-ary Trees in Natural Order 1992 35 COMPJ Dufrene & Lin, An Efficient External Sort Algorithm with no Additional Space 1992 35 COMPJ Nevalainen & Raita, An Internal Hybrid Sort Algorithm Revisited 1992 35 COMPJ Burns & McDermid & Dobson, On the Meaning of Safety and Security 1992 35 COMPJ Hwang & Shao & Wang, A New Access Control Method Using Prime Factorisation 1992 35 COMPJ Burmester & Desmedt & Beth, Efficient Zero-Knowledge Identification Schemes for Smart Cards 1992 35 COMPJ Wichmann, A Note on the Use of Floating Point in Critical Systems 1992 35 COMPJ Kim & Pramanik, Optimizing Database Accesses for Parallel Processing of Multikey Range Searches 1992 35 COMPJ Born & Kenevan, Theoretical Performance-Based Cost-Effectiveness of Multicomputers 1992 35 COMPJ Kaur, Hierarchical Hypernet for Pipelining 1992 35 COMPJ Vassalo & Ralston, Algorithms for De Bruijn Sequences -- A Case Study in the Empirical Analysis of Algorithms 1992 35 COMPJ Van de Liefvoort, An Iterative Algorithm for the Reve's Puzzle 1991 34 COMPJ Agrawal & Malpani, Efficient Dissemination of Information in Computer Networks 1991 34 COMPJ Challab, Implementation of Flexible Arrays Using Balanced Trees 1991 34 COMPJ Srinivasen, An Overflow Technique to Defer Splitting in B-trees 1991 34 COMPJ Smyth, Mu-balancing M-way Search Trees 1991 34 COMPJ Dandamudi & Sorenson, Improved Partial-Match Search Algorithms for BD Trees 1991 34 COMPJ Olariu & Overstreet & Wen, A Mergeable Double-ended Priority Queue 1991 34 COMPJ Naor & Martel & Matloff, Performance of Priority Queue Structures in a Virtual Memory Environment 1991 34 COMPJ Makinen, A Survey on Binary Tree Codings 1991 34 COMPJ Argo, Weighting Without Waiting: the Weighted Path Length Tree 1991 34 COMPJ Fenwick, A New Technique for Self-Organising Linear Searches 1991 34 COMPJ Ou & Tharp, High Storage Utilisation for Single-Probe Retrieval Linear Hashing 1991 34 COMPJ Chang & Chen & Jan, On the Design of a Machine-Independent Hashing Scheme 1991 34 COMPJ Ruzicka, A Note on the Efficiency of an Interval Routing Algorithm 1991 34 COMPJ Yue & Jacob, An Efficient Starvation-Free Semaphore Solution for the Graphical Mutual Exclusion Problem 1991 34 COMPJ Dobosiewicz, Linear Probing Sort 1991 34 COMPJ Campbell & McNeill, Finding a Majority When Sorting is Not Available 1991 34 COMPJ Dick, An Introduction to Knuth-Bendix Completion 1991 34 COMPJ Bastani & Chen & Hilal, A Model for the Stability Analysis of Maintenance Strategies for Linear List 1991 34 COMPJ Weiss, Empirical Study of the Expected Running Time of Shellsort 1990 33 COMPJ Foster & Kesselman & Taylor, Concurrency: Simple Concepts and Powerful Tools 1990 33 COMPJ Wolff, Simplicity and Power--Some Unifying Ideas in Computing 1990 33 COMPJ Megson & Evans, A Systolic Array Solution for the Assignment Proglem 1989 32 COMPJ Furuta, An Object-Based Taxonomy for Abstract Structure in Document Models 1989 32 COMPJ Brown, Standards for Structured Documents 1989 32 COMPJ Morris, Rendering Digital Type: A Historical and Economic View of Technology 1989 32 COMPJ Robison & Hafner & Skiena, Eight Pieces Cannot Cover a Chess Board 1989 32 COMPJ Cosnard & Ferreira, Generating Permuations on a VLSI Suitable Linear Network 1989 32 COMPJ Er, A New Algorithm for Generating Binary Trees using Rotations 1989 32 COMPJ Ellis & Lepolesa, A Las Vegas Graph Colouring Algorithma 1989 32 COMPJ Katajainen & Raita, An Approximation Algorithm for Space-optimal Encoding of a Text 1989 32 COMPJ Makinen, On Implementing Two Adaptive Data-compression Schemes 1989 32 COMPJ Scarrott, The Nature of Information 1988 31 COMPJ Goyal & Narayanan, Dictionary Machine with Improved Performance 1988 31 COMPJ Er, A Smooth Reshuffling Algorithm for Solving the Bulterman's Problem 1988 31 COMPJ Suraweera & Al-Anzy, Analysis of a Modified Address Calculation Sorting Algorithm 1988 31 COMPJ Pallo, Some Properties of the Rotation Lattice of Binary Trees 1988 31 COMPJ Megson & Evans, Improved Matrix Product Computations Using Double-Pipeline Systolic Arrays 1988 31 COMPJ Helary & Plouzeau & Raynal, A Distributed Algorithm for Mutual Exclusion in an Arbitrary Network 1988 31 COMPJ van der Weide, Iterative Tree Traversal Using Refinements and Pointer Rotation 1988 31 COMPJ Richards, On the Worst-Possible Analysis of Weighted Comparison-Based Algorithms 1988 31 COMPJ Er, A Fast Algorithm for Generating Set Partitions 1988 31 COMPJ Allison, Some Applications of Continuations 1988 31 COMPJ Megson & Evans, The Unification of Systolic Differencing Algorithms 1987 30 COMPJ Dromey, Derivation of Sorting Algorithms from a Specification 1987 30 COMPJ Cormack & Horspool, Data Compression Using Dynamic Markov Modelling 1977 20 COMPJ Hayes, A Note on the Towers of Hanoi Problem 1996 22 COMPLANGS Yang, Mealy Machines are a Better Model of Lexical Analyzers 1996 22 COMPLANGS Sarwar & Sarwar & Jaragh & Brandeburg, Engineering Quicksort 1994 20 COMPLANGS Pradeep & Murthy, Parallel Arithmetic Expression Evaluation on Reconfigurable Meshes 1994 20 COMPLANGS Sarwar & Jaragh & Wind, An Empirical Study of the Run-time Behavior of Quicksort, Shellsort and Mergesort for Medium to Large Size Data 1994 20 COMPLANGS Pradeep & Murthy, Parallel Recognition and Parsing on Mesh Connected Computers with Multiple Broadcasting 1992 17 COMPLANGS Ciancarini, Parallel Programming with Logic Languages: A Survey 1992 17 COMPLANGS Friedman, From Babbage to Babel and Beyond: A Brief History of Programming Languages 1992 17 COMPLANGS Barnard & Skillicorn, Context-free Parsing on O(n) Processors 1991 16 COMPLANGS Scott, The Lynx Distributed Programming Language: Motivation, Design and Experience 1989 14 COMPLANGS Edelson & Pohl, C++: Solving C's Shortcomings? 1988 13 COMPLANGS Pohl & Edelson, A to Z: C Language Shortcomings 1996 12 COMPLEXITY Wasilkowski, Average Case Complexity of Multivariate Integration and Function Approximation. An Overview 1996 12 COMPLEXITY Koiran, Hilbert's Nullstellensatz Is in the Polynomial Hierarchy 1996 12 COMPLEXITY Frank & Heinrich, Computing Discrepancies of Smolyak Quadrature Rules 1996 12 COMPLEXITY Hertling, Topological Complexity with Continuous Operations 1996 12 COMPLEXITY Kufer, On the Expected Number of Shadow Vertices of the Convex Hull of Random Points 1996 12 COMPLEXITY Novak & Roschmann, Numerical Integration of Peak Functions 1996 12 COMPLEXITY Novak & Wozniakowski, Topological Complexity of Zero-Finding 1996 12 COMPLEXITY Pereverzev & Solodky, The Minimal Radius of Galerkin Information for the Fredholm Problem of the First Kind 1996 12 COMPLEXITY Plaskota, Worst Case Complexity of Problems with Random Information Noise 1996 12 COMPLEXITY Werschulz, The Complexity of Definite Elliptic Problems with Noisy Data 1996 12 COMPLEXITY Mizuno & Megiddo & Tsuchiya, A Linear Programming Instance with Many Crossover Events 1996 12 COMPLEXITY Ye, How Partial Knowledge Helps to Solve Linear Programs 1996 12 COMPLEXITY Bini & Pan, Graeffe's Chebyshev-like, and Cardinal's Processes for Splitting a Polynomial into Factors 1996 12 COMPLEXITY Dalbec, An Algebraic Proof of Barlet's Join Theorem 1996 12 COMPLEXITY Gonzalez-Vega & El Kahoui, An Improved Upper Complexity Bound for the Topology Computation of a Real Algebraic Plane Curve 1996 12 COMPLEXITY Lickteig & Roy, Semi-algebraic Complexity of Quotients and Sign Determination of Remainders 1996 12 COMPLEXITY Pan & Kim & Sadikou & Huang & Zheng, On Isolation of Real and Nearly Real Zeros of a Univariate Polynomial and Its Splitting into Factors 1996 12 COMPLEXITY Catoni, Metropolis, Simulated Annealing, and Iterated Energy Transformation Algorithms: Theory and Experiments 1996 12 COMPLEXITY Niederreiter & Vielhaber, Tree Complexity and a Doubly Exponential Gap between Structured and Random Sequences 1996 12 COMPLEXITY Novak, On the Power of Adaption 1996 12 COMPLEXITY Leoncini, On Speed versus Accuracy: Some Case Studies 1996 12 COMPLEXITY Neff & Reif, An Efficient Algorithm for the Complex Roots Problem 1996 12 COMPLEXITY Rojas & Wang, Counting Affine Roots of Polynomial Systems via Pointed Newton Polytopes 1996 12 COMPLEXITY Emiris, On the Complexity of Sparse Elimination 1996 12 COMPLEXITY Stengle, Complexity Estimates for the Schmudgen Positivstellensatz 1996 12 COMPLEXITY Plaskota, How to Benefit from Noise 1996 12 COMPLEXITY Katscher & Novak & Petras, Quadrature Formulas for Multivariate Convex Functions 1996 12 COMPLEXITY Frank & Heinrich & Pereverzev, Information Complexity of Multivariate Fredholm Integral Equations in Sobolev Classes 1996 12 COMPLEXITY Osipenko, Optimal Recovery of Periodic Functions from Fourier Coefficients Given with an Error 1996 12 COMPLEXITY Maiorov, About Widths of Wiener Space in the L_q-Norm 1996 12 COMPLEXITY Farkov, n-Widths, Faber Expansion, and Computation of Analytic Functions 1995 11 COMPLEXITY Mathe, The Optimal Error of Monte Carlo Integration 1995 11 COMPLEXITY Frank, Complexity of Local Solution of Multivariate Integral Equations 1995 11 COMPLEXITY ]Jones & Fraenkel, Complexities of Winning Strategies in Diophantine Games 1995 11 COMPLEXITY Wilderotter, The Fine Structure of the n-Widths of H^p-Spaces in L_q(-1,1) 1995 11 COMPLEXITY Gensun, Average Widths of W^r H^omega in C(R) 1995 11 COMPLEXITY Osipenko & Parfenov, Ismagilov Type Theorems for Linear, Gel'fand and Bernstein n-Widths 1995 11 COMPLEXITY Werschulz, Waht Is the Complexity of Solution-Restricted Operator Equations? 1995 11 COMPLEXITY Thiel, Short Proofs Using Compact Representations of Algebraic Integers 1995 11 COMPLEXITY Klose, Binary Segmentation for Multivariate Polynomials 1995 11 COMPLEXITY Lickteig & Meer, A Note on Testing the Resultant 1995 11 COMPLEXITY Edelman, On the Determinant of a Uniformly Distributed Complex Matrix 1995 11 COMPLEXITY Cucker & Koiran, Computing over the Reals with Addition and Order: Higher Complexity Classes 1995 11 COMPLEXITY Gu, Finding Well-Conditioned Similarities to Block-Diagonalize Nonsymmetric Matrices Is NP-Hard 1995 11 COMPLEXITY Wynn & Zhigljavsky, Achieving the Ergodically Optimal Convergence Rate for a One-Dimensional Minimization Problem 1995 11 COMPLEXITY Kacewicz & Kowalski, Recovering Linear Operators from Inaccurate Data 1995 11 COMPLEXITY Plaskota, Average Complexity for Linear Problems in a Model with Varying Information Noise 1995 11 COMPLEXITY Ko, Computational Complexity of Fixed Points and Intersection Points 1995 11 COMPLEXITY Temlyakov, An Inequality for Trigonometric Polynomials and Its Application for Estimating the Entropy Numbers 1995 11 COMPLEXITY Wasilkowski & Wozniakowski, Explicit Cost Bounds of Algorithms for Multivariate Tensor Product Problems 1995 11 COMPLEXITY Novak, The Real Number Model in Numerical Analysis 1995 11 COMPLEXITY Sun & Wang, Average Error Bounds of Best Approximation of Continuous Functions on the Wiener Space 1995 11 COMPLEXITY Paskov, Termination Criteria for Linear Problems 1995 11 COMPLEXITY Khachiyan, On the Complexity of Approximating Extremal Determinants in Matrices 1995 11 COMPLEXITY Werschulz, The Complexity of Multivariate Elliptic Problems with Analytic Data 1995 11 COMPLEXITY Galligo & Vorobjov, Complexity of Finding Irreducible Components of a Semialgebraic Set 1994 10 COMPLEXITY Werschulz, The Complexity of Two-Point Boundary-Value Problems with Piecewise Analytic Data 1994 10 COMPLEXITY Choi, Probabilistic Analysis of Simpson's Quadrature 1994 10 COMPLEXITY Gohberg & Olshevsky, Fast Algorithms with Preprocessing for Matrix-Vector Multiplication Problems 1994 10 COMPLEXITY Sun & Wang, mu-Average n-Widths on the Wiener Space 1994 10 COMPLEXITY Chong, Positive Reducibility of the Interior of Filled Julia Sets 1994 10 COMPLEXITY Chu, There Exists a Problem Whose Computational Complexity Is Any Given Function of the Information Complexity 1994 10 COMPLEXITY Nemirovski, On Parallel Complexity of Nonsmooth Convex Optimization 1994 10 COMPLEXITY Wiederotter, Asymptotically Optimal Estimates of the Widths of Bounded Analytic Functions 1994 10 COMPLEXITY Ye, Combining Binary Search and Newton's Method to Compute Real Roots for a Class of Real Functions 1994 10 COMPLEXITY Ryabko, The Complexity and Effectiveness of Prediction Algorithms 1994 10 COMPLEXITY Favati & Lotti & Di Marco & Romani, Asymptotic Behavior of Automatic Quadrature 1994 10 COMPLEXITY Vakhania, On Boundary Value Problems for the Hyperbolic Case 1994 10 COMPLEXITY Kon, On the delta --> 0 Limit in Probabilistic Complexity 1994 10 COMPLEXITY Luo, One-Way Communication Complexity of Computing a Collection of Rational Functions 1994 10 COMPLEXITY Potra, Efficient Hybrid Algorithms for Finding Zeros of Convex Functions 1994 10 COMPLEXITY Dror & Smith & Trudeau, Utilizing Shelve Slots: Sufficiency Conditions for Some Easy Instances of Hard Problems 1994 10 COMPLEXITY Gao & Steele, General Spacefilling Curve Heuristics and Limit Theory for the Traveling Salesman Problem 1994 10 COMPLEXITY Moyer & Wulf, Modeling Optimal Effective Bandwidth of Page-Mode Memory for Stream-Oriented Computations 1994 10 COMPLEXITY Korneichuk, Optimization of Active Algorithms for Recovery of Monotonic Functions from Holder's Class 1994 10 COMPLEXITY Renegar, Is It Possible to Know a Problem Instance Is Ill-Posed? Some Foundations for a General Theory of Condition Numbers 1994 10 COMPLEXITY Cosnard & Koiran & Paugam-Moisy, Bounds on the Number of Units for Computing Arbitrary Dichotomies by Multilayer Perceptrons 1994 10 COMPLEXITY Shonkwiler & Van Vleck, Parallel Speed-Up of Monte Carlo Methods for Global Optimization 1994 10 COMPLEXITY Wozniakowski, Tractability and Strong Tractability of Linear Multivariate Problems 1994 10 COMPLEXITY Borgwardt & Brzank, Average Saving Effects in Enumerative Methods for Solving Knapsack Problems 1994 10 COMPLEXITY Bojanczyk & Heinig, A Multi-step Algorithm for Hankel Matrices 1994 10 COMPLEXITY Abu-Mostafa, Learning from Hints 1993 9 COMPLEXITY Milanese & Vicino, Information-Based Complexity and Nonparametric Worst-Case System Identification 1993 9 COMPLEXITY Strauss, Variational Principles in Curve Design 1993 9 COMPLEXITY Plaskota, A Note on Varying Cardinality in the Average Case Setting 1993 9 COMPLEXITY Heintz & Morgenstern, On the Intrinsic Complexity of Elimination Theory 1993 9 COMPLEXITY Shenhar, On the Kolmogorov Complexity of Arbitrary Objects 1993 9 COMPLEXITY Breslauer & Galil, Efficient Comparison Based String Matching 1993 9 COMPLEXITY Meer, Real Number Models under Various Sets of Operations 1993 9 COMPLEXITY Gao & Wasilkowski, On Detecting Regularity of Functions: A Probabilistic Analysis 1993 9 COMPLEXITY Pan & Demmel, A New Algorithm for the Symmetric Tridiagonal Eigenvalue Problem 1993 9 COMPLEXITY Natarajan, Condition-Sensitive Computation of Approximate Fixed Points 1993 9 COMPLEXITY Perfilov, Choosing Optimal Parameters in Iterative Processes 1993 9 COMPLEXITY Galil & Margalit, Witnesses for Boolean Matrixs Multiplication and for Transitive Closure 1993 9 COMPLEXITY Maiorov, Average n-Widths of the Wiener Space in the L_infinity-Norm 1993 9 COMPLEXITY Burgisser & Karpinski & Lickteig, On Randomized Semi-algebraic Test Complexity 1993 9 COMPLEXITY Papageorgiou, Integration of Monotone Functions of Several Variables 1993 9 COMPLEXITY Iri, A Proof of the Polynomiality of the Iri-Imai Method 1993 9 COMPLEXITY Paskov, Average Case Complexity of Multivariate Integration for Smooth Functions 1993 9 COMPLEXITY Pereverzev & Solodky, On Optimization of Direct Methods of Solving Weakly Singular Integral Equations 1993 9 COMPLEXITY Wasilkowski & Wozniakowski, There Exists a Linear Problem with Infinite Combinatory Complexity 1993 9 COMPLEXITY Shub & Smale, Complexity of Bezout's Theorem. III. Condition Number and Packing 1993 9 COMPLEXITY Novak & Ritter, Some Complexity Results for Zero Finding for Univariate Functions 1993 9 COMPLEXITY Temlyakov, On Approximate Recovery of Functions with Bounded Mixed Derivative 1993 9 COMPLEXITY Niederreiter, Improved Error Bounds for Lattice Rules 1993 9 COMPLEXITY Lee & Wasilkowski, Discontinuity Detection and Thresholding--A Stochastic Approach 1993 9 COMPLEXITY Iserles & Soderlind, Global Bounds on Numerical Error for Ordinary Differential Equations 1993 9 COMPLEXITY Kacewicz & Plaskota, The Minimal Cost of Approximating Linear Operators Using Perturbed Information--The Asymptotic Setting 1993 9 COMPLEXITY Marchuk, On Numerical Solution of Poincare Problem for Oceanic Circulations 1993 9 COMPLEXITY Heinrich, Complexity of Integral Equations and Relations to s-Numbers 1993 9 COMPLEXITY Werschulz, The Complexity of Two-Point Boundary-Value Problems with Analytic Data 1993 9 COMPLEXITY Mathe, On Optimal Random Nets 1993 9 COMPLEXITY Sikorski & Tsay & Wozniakowski, An Ellipsoid Algorithm for the Computation of Fixed Points 1992 8 COMPLEXITY Wozniakowski, Average Case Complexity of Linear Multivariate Problems. I. Theory 1992 8 COMPLEXITY Wozniakowski, Average Case Complexity of Linear Multivariate Problems. II. Applications 1992 8 COMPLEXITY Tiwari, A Problem That Is Easier to Solve on the Unit-Cost Algebraic RAM 1992 8 COMPLEXITY Chow & Palmer, On the Numerical Computation of Orbits of Dynamical Systems: The Higher Dimensional Case 1992 8 COMPLEXITY Wasilkowski, On a Posterieri Upper bounds for Approximating Linear Functionals in a Probabilistic Setting 1992 8 COMPLEXITY Liu & Chen & Lu, On the Complexity of Generating Synchronizable Test Sequences 1992 8 COMPLEXITY Meer, A Note on a P not= NP Result for a Restricted Class of Real Machines 1992 8 COMPLEXITY Cucker & Torrecillas, Two P-Complete Problems in the Theory of the Reals 1992 8 COMPLEXITY Gensun & Yongping, On the Optimal Quadrature Least L_infinity-Norm of Monosplines with Free Knots on the Real Axis 1992 8 COMPLEXITY Burgisser & Lickteig & Shub, Test Complexity of Generic Polynomials 1992 8 COMPLEXITY Du & Ko, A Note on Best Fractions of a Computable Real Number 1992 8 COMPLEXITY Cucker, P_R != NC_R 1992 8 COMPLEXITY Wen, Anosov Endomorphisms on Branched Surfaces 1992 8 COMPLEXITY Tempo & Cerone, Robust Stability: The Computational Complexity Point of View 1992 8 COMPLEXITY Heinrich, Lower Bounds for the Complexity of Monte Carlo Function Approximation 1992 8 COMPLEXITY Plaskota, Function Approximation and Integration on the Wiener Space with Noisy Data 1992 8 COMPLEXITY Wilderotter, n-Widths of H^p-Spaces in L_q(-1,1) 1992 8 COMPLEXITY Wozniakowski, Complexity of Verification and Computation for IBC Problems 1992 8 COMPLEXITY Novak & Wozniakowski, Relaxed Verification for Continuous Problems 1992 8 COMPLEXITY Nemirovsky, Information-Based Complexity of Linear Operator Equations 1992 8 COMPLEXITY Pereverzev & Scharipov, Information Complexity of Equations of the Second Kind with Compact Operators in Hilbert Space 1992 8 COMPLEXITY Pan, Parallel Solution of Toeplitzlike Linear Systems 1992 8 COMPLEXITY Novak, Optimal Linear Randomized Methods for Linear Operators in Hilbert Spaces 1992 8 COMPLEXITY Strzemecki, Polynomial-Time Algorithms for Generation of Prime Implicants 1992 8 COMPLEXITY Magaril-Il'yaev & Tikhomirov, Average Dimension and nu-Widths of Classes of Functions on the Whole Line 1992 8 COMPLEXITY Graf, Barnsley's Scheme for the Fractal Encoding of Images 1992 8 COMPLEXITY Korneichuk, Encoding and Recovery of Operator Values 1991 7 COMPLEXITY Heinrich & Kern, Parallel Information-Based Complexity 1991 7 COMPLEXITY Kostlan, Statistical Complexity of Dominant Eigenvector Calculation 1991 7 COMPLEXITY Weihrauch, On the Complexity of Online Computations of Real Functions 1991 7 COMPLEXITY Chu & Schnitger, The Communication Complexity of Several Problems in Matrix Computation 1991 7 COMPLEXITY Bini & Pan, On the Evaluation of the Eigenvalues of a Banded Toeplitz Block Matrix 1991 7 COMPLEXITY Kahn, Newtonian Graphs for Families of Complex Polynomials 1991 7 COMPLEXITY Venkatesh & Baldi, Programmed Interactions in Higher-Order Neural Networks: The Outer-Product Algorithm 1991 7 COMPLEXITY Traub, Solvability of Ill-Posed Problems: An Historical Note 1991 7 COMPLEXITY Kon & Ritter & Werschulz, On the Average Case Solvability of Ill-Posed Problems 1991 7 COMPLEXITY Vakhania, Gaussian Mean Boundedness of Densely Defined Linear Operators 1991 7 COMPLEXITY Maier, A Path Integral Approach to Data Structure Evolution 1991 7 COMPLEXITY Mathe, Random Approximation of Sobolev Embeddings 1991 7 COMPLEXITY Codenotti & Leoncini, Matrix Inversion in RNC^1 1991 7 COMPLEXITY Mundhenk & Schuler, Random Languages for Nonuniform Complexity Classes 1991 7 COMPLEXITY Buchmann & Williams, Some Remarks Concerning the Complexity of Computing Class Groups of Quadratic Fields 1991 7 COMPLEXITY Venkatesh & Baldi, Programmed Interactions in Higher-Order Neural Networks: Maximal Capacity 1991 7 COMPLEXITY Nemirovsky, On Optimality of Krylov's Information When Solving Linear Operator Equations 1991 7 COMPLEXITY Szarek, Condition Numbers of Random Matrices 1991 7 COMPLEXITY Werschulz, Optimal Residual Algorithms for Linear Operator Equations 1991 7 COMPLEXITY Jaromczyk & Swiatek, A Role of Lower Semicontinuous Functions in the Combinatorial Complexity of Geometric Problems 1991 7 COMPLEXITY Kern, The Parallel Complexity of Function Approximation 1991 7 COMPLEXITY Cohen & Tarsi, NP-Completeness of Graph Decomposition Problems 1991 7 COMPLEXITY Kon & Tempo, Linearity of Algorithms and a Result of Ando 1991 7 COMPLEXITY Johnstone & Silverman, Discretization Effects in Statistical Inverse Problems 1991 7 COMPLEXITY Kacewicz & Plaskota, Noisy Information for Linear Problems in the Asymptotic Setting 1991 7 COMPLEXITY Gao, Probabilistic Analysis of Numerical Integration Algorithms 1991 7 COMPLEXITY Yomdin, Complexity of Functions: Some Questions, Conjectures, and Results 1991 7 COMPLEXITY Grayson, On the Distance to the Zero-Set of a Polynomial 1991 7 COMPLEXITY Jackowski, Complexity of Multilinear Problems in the Average Case Setting 1990 6 COMPLEXITY Ritter, Approximation and Optimization on the Wiener Space 1990 6 COMPLEXITY Lin & Shieh, Space and Time Complexities of Balanced Sorting on Processor Arrays 1990 6 COMPLEXITY Yokoyama, Computing Topological Degree Using Noisy Information 1990 6 COMPLEXITY Jackowski, Complexity of Multilinear Problems in the Worst Case Setting 1990 6 COMPLEXITY Gambaudo & Tresser, Diffeomorphisms with Infinitely Many Strange Attractors 1990 6 COMPLEXITY Ben-Or & Tiwari, Simple Algorithms for Approximating All Roots of a Polynomial with Real Roots 1990 6 COMPLEXITY Heinrich, Probabilistic Complexity Analysis for Linear Problems in Bounded Domains 1990 6 COMPLEXITY Meer, Computations over Z and R: A Comparison 1990 6 COMPLEXITY Althofer, The Complexity of a Simple Stochastic OR-Tree Model in Which ``Directional Search'' Is Bad 1990 6 COMPLEXITY Wasilkowski, Note on Quantization for Signals with Bounded (r+1)st Derivative 1990 6 COMPLEXITY Donoho & Nussbaum, Minimax Quadratic Estimation of a Quadratic Functional 1990 6 COMPLEXITY Bojanczyk, Some Complexity Results in Parallel Matrix-Based Signal Processing 1990 6 COMPLEXITY Bruck & Goodman, On the Power of Neural Networks for Solving Hard Problems 1990 6 COMPLEXITY Kacewicz, On Sequential and Parallel Solution of Initial Value Problems 1990 6 COMPLEXITY Galbiati, On the Asymptotic Probabilistic Analysis of Scheduling Problems in the Presence of Precedence Constraints 1990 6 COMPLEXITY Triesch, A Note on a Theorem of Blum, Shub, and Smale 1990 6 COMPLEXITY Lee, Discontinuity Detection from Band-Limited Signals 1990 6 COMPLEXITY Abu-Mostafa, Learning from Hints in Neural Networks 1990 6 COMPLEXITY Plaskota, On Average Case Complexity of Linear Problems with Noisy Information 1990 6 COMPLEXITY Papageorgiou & Wasilkowski, On the Average Complexity of Multivariate Problems 1990 6 COMPLEXITY Guiasu, Selecting Relevant Projections onto Subsets of Coordinates: A Minimax Dependence-Based Approach 1990 6 COMPLEXITY Mathe, s-Numbers in Information-Based Complexity 1990 6 COMPLEXITY Baum, On Learning a Union of Half Spaces 1990 6 COMPLEXITY Saari, On the Design of Complex Organizations and Distributive Algorithms 1990 6 COMPLEXITY Chuyan & Sukharev, On Adaptive and Nonadaptive Stochastic and Deterministic Algorithms 1989 5 COMPLEXITY Hirsch & Papadimitriou & Vavasis, Exponential Lower Bounds for Finding Brouwer Fixed Points 1989 5 COMPLEXITY Egecioglu & Gallopoulos & Koc, Fast Computation of Divided Differences and Parallel Hermite Interpolation 1989 5 COMPLEXITY Tischler, Critical Points and Values of Complex Polynomials 1989 5 COMPLEXITY Wasilkowski & Wozniakowski, Mixed Settings for Linear Problems 1989 5 COMPLEXITY Chow & Tsitsiklis, The Complexity of Dynamic Programming 1989 5 COMPLEXITY Novak, Average-Case Results for Zero Finding 1989 5 COMPLEXITY Steele, Certifying Smoothness of Discrete Functions and Measuring Legitimacy of Images 1989 5 COMPLEXITY Chaimovich & Freiman & Galil, Solving Dense Subset-Sum Problems by Using Analytical Number Theory 1989 5 COMPLEXITY Kowalski, On Approximations of Band-Limited Signals 1989 5 COMPLEXITY Shub, On the Distance to the Zero Set of a Homogeneous Polynomial 1989 5 COMPLEXITY Werschulz, Average Case Complexity of Elliptic Partial Differential Equations 1989 5 COMPLEXITY Kim, Topological Complexity of a Root Finding Algorithm 1989 5 COMPLEXITY Kon & Novak, On the Adaptive and Continuous Information Problems 1989 5 COMPLEXITY Wasilkowski, On Adaptive Information with Varying Cardinality for Linear Problems with Elliptically Contoured Measures 1989 5 COMPLEXITY Plaskota, Asymptotic Error for the Global Maximum of Functions in s Dimensions 1989 5 COMPLEXITY Wright, Statistical Complexity of the Power Method for Markov Chains 1989 5 COMPLEXITY Werschulz, Optimal Algorithms for a Problem of Optimal Control 1989 5 COMPLEXITY Yokoyama, On Optimal Algorithms for Problems Defined on Groups 1989 5 COMPLEXITY Wasilkowski, Randomization for Continuous Problems 1989 5 COMPLEXITY Curry, On Zero Finding Methods of Higher Order from Data at One Point 1989 5 COMPLEXITY Veroy, Optimal Search Algorithm for Extrema of a Discrete Periodic Bimodal Function 1989 5 COMPLEXITY Kon & Tempo, On Linearity of Spline Algorithms 1989 5 COMPLEXITY Wasilkowski, A Clock Synchronization Problem with Random Delays 1989 5 COMPLEXITY Friedman, On the Convergence of Newton's Method 1989 5 COMPLEXITY Levine, A Lower Bound for the Topological Complexity of Poly(D,n) 1989 5 COMPLEXITY Kowalski & Stenger, Optimal Complexity Recovery of Band- and Energy-Limited Signals II 1989 5 COMPLEXITY Novak & Ritter, A Stochastic Analog to Chebyshev Centers and Optimal Average Case Algorithms 1989 5 COMPLEXITY Kozek & Trzmielak-Stanislawska, On a Class of Omnibus Algorithms for Zero-Finding 1989 5 COMPLEXITY Chor & Goldreich, On the Power of Two-Point Based Sampling 1989 5 COMPLEXITY Codenotti & Flandoli, A Monte Carlo Method for the Parallel Solution of Linear Systems 1988 4 COMPLEXITY Kadane & Wasilkowski & Wozniakowski, On Adaption with Noisy Information 1988 4 COMPLEXITY Abu-Mostafa, Random Problems 1988 4 COMPLEXITY Chudnovsky & Chudnovsky, Algebraic Complexities and Algebraic Curves over Finite Fields 1988 4 COMPLEXITY Boult & Sikorski, Can We Approximate Zeros of Functions with Nonzero Topological Degree? 1988 4 COMPLEXITY Schroder, VLSI-Sorting Evaluated under the Linear Model 1988 4 COMPLEXITY Kowalski & Sielski, Approximation of Smooth Periodic Functions in Several Variables 1988 4 COMPLEXITY Kacewicz, Minimum Asymptotic Error of Algorithms for Solving ODE 1988 4 COMPLEXITY Judd, On the Complexity of Loading Shallow Neural Networks 1988 4 COMPLEXITY Baum, On the Capabilities of Multilayer Perceptrons 1988 4 COMPLEXITY Pineda, Dynamics and Architecture for Neural Computation 1988 4 COMPLEXITY Abu-Mostafa, Lower Bound for Connectivity in Local-Learning Neural Networks 1988 4 COMPLEXITY Georgakopoulos & Kavvadias & Papadimitriou, Probabilistic Satisfiability 1988 4 COMPLEXITY Rokhlin, A Fast Algorithm for the Discrete Laplace Transformation 1988 4 COMPLEXITY Galil & Giancarlo, Data Structures and Algorithms for Approximate String Matching 1988 4 COMPLEXITY Kacewicz & Milanese & Vicino, Conditionally Optimal Algorithms and Estimation of Reduced Order Models 1987 3 COMPLEXITY Lee & Pavlidis & Wasilkowski, A Note on the Trade-off between Sampling and Quantization in Signal Processing 1987 3 COMPLEXITY Adler & Karp & Shamir, A Simplex Variant Solving an m x d Linear Program in O(min(m^2,d^2)) Expected Number of Pivot Steps 1987 3 COMPLEXITY Sikorski & Wozniakowski, Complexity of Fixed Points, I 1987 3 COMPLEXITY Coffman & Garey & Johnson, Bin Packing with Divisible Item Sizes 1987 3 COMPLEXITY Bojanov, sigma-Perfect Splines and Their Application to Optimal Recovery Problems 1987 3 COMPLEXITY Kacewicz, Optimal Solution of Ordinary Differential Equations 1987 3 COMPLEXITY Tsitsiklis & Luo, Communication Complexity and Convex Optimization 1987 3 COMPLEXITY Packel, The Algorithm Designer versus Nature: A Game-Theoretic Approach to Information-Based Complexity 1987 3 COMPLEXITY Shub, On the Asymptotic Behavior of the Projective Rescaling Algorithm for Linear Programming 1987 3 COMPLEXITY Werschulz, An Information-Based Approach to Ill-Posed Problems 1987 3 COMPLEXITY Saari, Some Informational Requirements for Convergence 1987 3 COMPLEXITY Micchelli & Rivlin, An Optimal Recovery View of Walsh's Equiconvergence Theorem 1987 3 COMPLEXITY Babuska, Information-Based Numerical Practice 1987 3 COMPLEXITY Sukharev, The Concept of Sequential Optimality for Problems in Numerical Analysis 1987 3 COMPLEXITY Smale, On the Topology of Algorithms, I 1987 3 COMPLEXITY Renegar, On the Worst-Case Arithmetic Complexity of Approximating Zeros of Polynomials 1987 3 COMPLEXITY Jackowski & Wozniakowski, Complexity of Approximation with Relative Error Criterion in Worst, Average, and Probabilistic Settings 1987 3 COMPLEXITY Hammal & York & Grebogi, Do Numerical Orbits of Chaotic Dynamical Processes Represent True Orbits? 1987 3 COMPLEXITY Lumelsky, Algorithmic and Complexity Issues of Robot Motion in an Uncertain Environment 1987 3 COMPLEXITY Boult, Optimal Algorithms: Tools for Mathematical Modeling 1987 3 COMPLEXITY Demmel, The Geometry of Ill-Conditioning 1987 3 COMPLEXITY Chudnovsky & Chudnovsky, On Expansion of Algebraic Functions in Power and Puiseux Series, II 1987 3 COMPLEXITY Chou, On the Optimality of Krylov Information 1987 3 COMPLEXITY Kacewicz, Asymptotic Error of Algorithms for Solving Nonlinear Problems 1987 3 COMPLEXITY Wozniakowski, Average Complexity for Linear Operators over Bounded Domains 1986 2 COMPLEXITY Chudnovsky & Chudnovsky, On Expansion of Algebraic Functions in Power and Puiseux Series, I 1986 2 COMPLEXITY Lee, Fast Multiplication of a Recursive Block Toeplitz Matrix by a Vector and Its Application 1986 2 COMPLEXITY Kacewicz & Wasilkowski, How Powerful Is Continuous Nonlinear Information for Linear Problems? 1986 2 COMPLEXITY Sukharev, On the Existence of Optimal Affine Methods for Approximating Linear Functionals 1986 2 COMPLEXITY Veroy, An Optimal Algorithm for Search of Extrema of a Bimodal Function 1986 2 COMPLEXITY Huerta, Adaption Helps for Some Nonconvex Classes 1986 2 COMPLEXITY Bini & Pan, Polynomial Division and Its Computational Complexity 1986 2 COMPLEXITY Wasilkowski, Information of Varying Cardinality 1986 2 COMPLEXITY Novak, On Average Case Errors in Numerical Analysis 1986 2 COMPLEXITY Kowalski, Optimal Complexity Recovery of Band- and Energy-Limited Signals 1986 2 COMPLEXITY Wozniakowski, Probabilistic Setting of Information-Based Complexity 1986 COMPLEXITY Boult & Sikorski, Complexity of Computing Topological Degree of Lipschitz Functions in n Dimensions 1986 COMPLEXITY Ko, On the Computational Complexity of Best Chebyshev Approximations 1986 COMPLEXITY Kuczynski, On the Optimal Solution of Large Eigenpair Problems 1986 COMPLEXITY Lee & Wasilkowski, Approximation of Linear Functionals on a Banach Space with a Gaussian Measure 1986 COMPLEXITY Makovoz, On the Kolmogorov Complexity of Functions of Finite Smoothness 1986 COMPLEXITY Milanese & Tempo & Vicino, Strongly Optimal Algorithms and Optimal Information in Estimation Problems 1986 COMPLEXITY Pearl & Tarski, Structuring Causal Trees 1986 COMPLEXITY Shub & Smale, On the Existence of Generally Convergent Algorithms 1986 COMPLEXITY Sikorski & Wozniakowski, For Which Error Criteria Can We Solve Nonlinear Equations? 1985 COMPLEXITY Halpern & Megiddo & Munshi, Optimal Precision in the Presence of Uncertainty 1985 COMPLEXITY Hurwicz & Marschak, Discrete Allocation Mechanisms: Dimensional Requirements for Resource-Allocation Mechanisms When Desired Outcomes Are Unbounded 1985 COMPLEXITY Johnson & Garey, A 71/60 Theorem for Bin Packing 1985 COMPLEXITY Kadane, Parallel and Sequential Computation: A Statistician's View 1985 COMPLEXITY Karp & Luby, Monte-Carlo Algorithms for the Planar Multiterminal Network Reliability Problem 1985 COMPLEXITY Ko, Continuous Optimization Problems and a Polynomial Hierarchy of Real Functions 1985 COMPLEXITY Kung, Memory Requirements for Balanced Computer Architectures 1985 COMPLEXITY Lee, Optimal Algorithms for Image Understanding: Current Status and Future Plans 1985 COMPLEXITY Mount & Reiter, Approximation in a Continuous Model of Computing 1985 COMPLEXITY Schoenhage, Quasi-GCD Computations 1985 COMPLEXITY Sikorski, Optimal Solution of Nonlinear Equations 1985 COMPLEXITY Traub, Complexity of Approximately Solved Problems 1985 COMPLEXITY Wasilkowski, Average Case Optimality 1985 COMPLEXITY Werschulz, Complexity of Differential and Integral Equations 1985 COMPLEXITY Wozniakowski, A Survey of Information-Based Complexity 1996 22 COMPLING Covington, An Algorithm to Align Words for Historical Comparison 1995 21 COMPLING Levinger & Ornan & Itai, Learning Morpho-Lexical Probabilities from an Untagged Corpus with an Application to Hebrew 1995 21 COMPLING Stolcke, An Efficient Probabilistic Context-Free Parsing Algorithm that Computes Prefix Probabilities 1988 COMPMORPH Aggarwal & Ghosh & Shyamasundar, Computational Complexity of Restricted Polygon Decompositions 1988 COMPMORPH Avis & Rappaport, Computing Monotone Simple Circuits in the Plane 1988 COMPMORPH Bhattacharya, Circular Separability of Planar Point Sets 1988 COMPMORPH Eades, Symmetry Finding Algorithms 1988 COMPMORPH ElGindy & Toussaint, Computing the Relative Neighbor Decomposition of a Simple Polygon 1988 COMPMORPH Imai & Iri, Polygonal Approximations of a Curve--Formulations and Algorithms 1988 COMPMORPH Melkman & O'Rourke, On Polygonal Chain Approximation 1988 COMPMORPH O'Rourke, Uniqueness of Orthogonal Connect-the-Dots 1988 COMPMORPH Radke, On the Shape of a Set of Points 1988 COMPMORPH Rawlins & Wood, Ortho-Convexity and Its Generalizations 1988 COMPMORPH Sack & Toussaint, Guard Placement in Rectilinear Polygons 1988 COMPMORPH Sugihara, Realizability of Polyhedrons from Line Drawings 1988 COMPMORPH Toriwaki & Yokoi, Voronoi and Related Neighbours on Digitized Two-Dimensional Space with Applications to Texture Analysis 1988 COMPMORPH Toussaint, A Graph-Theoretical Primal Sketch 1991 COMPNT Stepanov & Shparlinskiy, On the Construction of Primitive Elements and Primitive Normal Bases in a Finite Field 1991 COMPNT Kovacs, Number Systems 1991 COMPNT Petho, On a Polynomial Transformation and Its Application to the Construction of a Public Key Cryptosystem 1935 2 COMPOSITIO Erdos & Szekeres, A Combinatorial Problem in Geometry 1994 318 COMPRENDU Calbrix & Nivat & Podelski, Une Methode de Decision de la Logique Monadique du Second Ordre d'une Fonction Successeur 1997 38 COMPREVS Weiss, review of Pfeiffer, Technical Writing (3rd ed.): A Practical Approach (Prentice-Hall, 1996) 1997 38 COMPREVS King, comparative review of Java guides 1997 38 COMPREVS Ramirez, review of Friedman & Felleisen, The Little Schemer (4th ed.) (MIT Press, 1996) 1997 38 COMPREVS Slater, review of Sedgewick & Flajolet, An Introduction to the Analysis of Algorithms (Addison-Wesley Longman, 1996) 1997 38 COMPREVS Aumann, review of Motwani & Raghavan, Randomized Algorithms (Cambridge University Press, 1995) 1997 38 COMPREVS Guo, review of Louscou-Bozapalidou, Stochastically Costed Tree Automata: Turakainen's Theorem (TCS 156, 1996) 1996 37 COMPREVS Booth, review of Sullivan & Schwerdtfeger & Abello & Marlowe, Secrets of the OS/2 Warp Masters (Wiley, 1996) 1996 37 COMPREVS Van den Bussche, review of Smith, A Recursive Introduction to the Theory of Computation (Springer, 1994) 1996 37 COMPREVS Cohn, review of Hofri, Analysis of Algorithms: Computational Methods and Mathematical Tools (Oxford, 1995) 1996 37 COMPREVS Kranakis, review of Sudan, Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems (Springer, 1995) 1996 37 COMPREVS Huber, review of Amza & Cox & Dwarkadas & Keleher & Lu & Rajamony & Yu & Zwaenepoel, TreadMarks: Shared Memory Computing on Networks of Workstations 1996 37 COMPREVS Oldham, review of Floyd & Beigel, The Language of Machines: An Introduction to Computability and Formal Languages (Computer Science Press, 1994) 1996 37 COMPREVS Tomayko, review of Brooks, The Mythical Man-Month (Anniversary Edition) (Addison-Wesley, 1995) 1996 37 COMPREVS Marcotty, review of Kalicharan, C by Example (Cambridge University Press, 1994) 1996 37 COMPREVS Bergin, review of Horstmann, Mastering Object-Oriented Design in C++ (Wiley, 1995) 1996 37 COMPREVS Aldous, review of Sinclair, Algorithms for Random Generation and Counting: A Markov Chain Approach (Birkhauser, 1993) 1996 37 COMPREVS Spohrer, review of Dean, Allen, and Aloimonos, Artificial Intelligence: Theory and Practice (Benjamin-Cummings, 1995) 1996 37 COMPREVS Hodges, review of Fagin, Halpern, Vardi, and Moses, Reasoning about Knowledge (MIT Press, 1995) 1996 37 COMPREVS Merritt, review of Weiss, Data Structures and Algorithm Analysis (2nd ed.) (Benjamin-Cummings, 1995) 1995 36 COMPREVS Harrow, review of Davis & Sigal & Weyuker, Computability, Complexity, and Languages (2nd ed.): Fundamentals of Theoretical Computer Science (Academic Press, 1994) 1995 36 COMPREVS Weiss, review of Lyn, Bugs in Writing, a Guide to Debugging Your Prose (Addison-Wesley, 1995) 1995 36 COMPREVS Hemaspaandra, review of Bovet & Crescenzi, Introduction to the Theory of Complexity (Prentice Hall, 1994) 1995 36 COMPREVS Purdom, review of Stephen, String Searching Algorithms (World Scientific, 1994) 1995 36 COMPREVS Schneider, review of Deitel & Deitel, C++ How To Program (Prentice-Hall, 1994) 1995 36 COMPREVS Cardelli, review of Lorentz, Recursive Algorithms (Ablex, 1994) 1995 36 COMPREVS Van Dyke, review of Russell & Norvig, Artificial Intelligence: A Modern Approach (Prentice-Hall, 1995) 1995 36 COMPREVS Reid, review of Scott, Scott on Computer Law (2nd ed., vol. 1 and vol. 2) (Prentice Hall Law & Business, 1993) 1995 36 COMPREVS Florea, review of Reddy & wise, An Introduction to C++ (Crossroads 1, 1 (Sept., 1994)) 1995 36 COMPREVS Monahan, review of Stroustrup, The Design of C++ (videotape) (University Video Communications, 1994) 1995 36 COMPREVS Chang, review of Tucker, Applied Combinatorics (3rd ed.) (Wiley, 1994) 1995 36 COMPREVS Campbell, review of Adleman, Molecular Computation of Solutions to Combinatorial Problems (Science 266, 1994) 1995 36 COMPREVS Monahan, review of Deitel & Deitel, C (2nd ed.): How to Program (Prentice-Hall, 1994) 1995 36 COMPREVS Bishop, comparative review of Budd, Classic Data Structures in C++ (Addison-Wesley, 1994) 1995 36 COMPREVS Bishop, comparative review of Model, Data Structures, Data Abstraction: A Contemporary Introduction Using C++ (Prentice-Hall, 1994) 1995 36 COMPREVS Bishop, comparative review of Lippman, C++ Primer (2nd ed.) (Addison-Wesley, 1991) 1995 36 COMPREVS Bishop, comparative review of Winder, Developing C++ Software (2nd ed.) (Wiley, 1993) 1995 36 COMPREVS Bishop, comparative review of Wang, C++ with Object-oriented Programming (Wadsworth, 1994) 1995 36 COMPREVS Bishop, comparative review of Keith & Orlow & Plexico, Data Abstraction and Object-oriented Programming in C++ (Wiley, 1990) 1995 36 COMPREVS Bishop, comparative review of Ranade & Saba, C++ Primer for C Programmers (McGraw-Hill, 1992) 1995 36 COMPREVS Bishop, comparative review of Smith, Reusability and Software Constructions: C and C++ (Wiley, 1990) 1995 36 COMPREVS Bishop, comparative review of Cargill, C++ Programming Style (Addison-Wesley, 1992) 1995 36 COMPREVS Bishop, comparative review of Coplien, Advanced C++: Programming Styles and Idioms (Addision-Wesley, 1992) 1995 36 COMPREVS Jenkins, review of Stallings, Protect Your Privacy: A Guide for PGP Users (Prentice-Hall, 1995) 1995 36 COMPREVS Triesch, review of Parberry, Circuit Complexity and Neural Networks (MIT Press, 1994) 1995 36 COMPREVS Royle, review of Goldberg, Efficient Algorithms for Listing Combinatorial Structures (Cambridge University Press, 1993) 1995 36 COMPREVS Cull, review of Oliver, Programming Classics: Implementing the World's Best Algorithms (Prentice-Hall, 1993) 1995 36 COMPREVS Coulter, review of Pattis & Roberts & Stehlik, Karel the Robot (2nd ed.): A Gentle Introduction to the Art of Programming (Wiley, 1994) 1995 36 COMPREVS Jourdan, review of Weiss, Data Structures and Algorithm Analysis in C++ (Benjamin-Cummings, 1994) 1995 36 COMPREVS Ray, review of Squires, Choosing and Using Educational Software: A Teachers' Guide (Taylor & Francis, 1994) 1995 36 COMPREVS Van Dyke Parunak, review of Resnick, Turtles, Termites, and Traffic Jams: Explorations in Massively Parallel Microworlds (MIT Press, 1994) 1995 36 COMPREVS Sahoo, review of Golomb & Peile & Scholtz, Basic Concepts in Information Theory and Coding: The Adventures of Secret Agent 00111 (Plenum Press, 1994) 1995 36 COMPREVS Van den Bussche, review of Floyd & Beigel, The Language of Machines: An Introduction to Computability and Formal Languages (Computer Science Press, 1994) 1995 36 COMPREVS Harrow, review of Straubing, Finite Automata, Formal Logic, and Circuit Complexity (Birkhauser, 1994) 1995 36 COMPREVS Navlakha, review of Knuth, Computer Musings (videotape): The Associative Law, or the Anatomy of Rotations in Binary Trees (University Video Communications, 1993) 1995 36 COMPREVS Liebrock, review of Lester, The Art of Parallel Programming (Prentice-Hall, 1993) 1995 36 COMPREVS Iordache, review of Rudd, Mastering C (Wiley-QED, 1994) 1995 36 COMPREVS Bochev, review of Veldhuis & Breeuwer, An Introduction to Source Coding (Prentice-Hall, 1993) 1995 36 COMPREVS Cecal, review of Porter, The Best C/C++ Tips Ever (Osborne/McGraw-Hill, 1993) 1995 36 COMPREVS Hicks & Liebrock, review of Akl & Lyons, Parallel Computational Geometry (Prentice-Hall, 1993) 1995 36 COMPREVS Jenkins, comparative reviews of Internet books 1995 36 COMPREVS Petho, review of Giblin, Primes and Programming: An Introduction to Number Theory with Computing (Cambridge University Press, 1993) 1995 36 COMPREVS Ramanathan, review of Quinn, Parallel Computing: Theory and Practice (2nd ed.) (McGraw-Hill, 1994) 1995 36 COMPREVS Gustafson, review of Arbel, Exploring Interior-Point Linear Programming: Algorithms and Software (MIT Press, 1993) 1994 35 COMPREVS Mullin, review of Engel, Exploring Mathematics with your Computer (MAA, 1993) 1994 35 COMPREVS Ciobanu, review of Fischer & Grodzinsky & Frances, The Anatomy of Programming Languages (Prentice-Hall, 1993) 1994 35 COMPREVS Lakshmivarahan, review of Lund, The Power of Interaction (MIT Press, 1992) 1994 35 COMPREVS Warford, review of Gries & Schneider, A Logical Approach to Discrete Math (Springer-Verlag, 1993) 1994 35 COMPREVS Fulcher, comparative review of Almasi & Gottlieb, Highly Parallel Computing (Benjamin-Cummings, 1989) 1994 35 COMPREVS Fulcher, comparative review of Andrews, Concurrent Programming: Principles and Practice (Benjamin-Cummings, 1991) 1994 35 COMPREVS Fulcher, comparative review of Ben-Ari, Principles of Concurrent and Distributed Programming (Prentice-Hall, 1990) 1994 35 COMPREVS Fulcher, comparative review of Burns & Davies, Concurrent Programming (Addison-Wesley, 1993) 1994 35 COMPREVS Fulcher, comparative review of Lawson, Parallel Processing in Industrial Real-Time Applications (Prentice-Hall, 1992) 1994 35 COMPREVS Fulcher, comparative review of Lewis & El-Rewini, Introduction to Parallel Computing (Prentice-Hall, 1992) 1994 35 COMPREVS Fulcher, comparative review of Snow, Concurrent Programming, Cambridge University Press, 1992) 1994 35 COMPREVS Fulcher, comparative review of Shirley, Programming Models for Parallel Systems (Wiley, 1990) 1994 35 COMPREVS Ramanathan, review of Lyuu, Information Dispersal and Parallel Computation (Cambridge University Press, 1992) 1994 35 COMPREVS Cohn, review of Rawlins, Compared to What?: An Introduction to the Analysis of Algorithms (Computer Science Press, 1992) 1993 34 COMPREVS Booth, review of Press & Teukolsky & Vetterling & Flannery, Numerical Recipes in C (2nd Ed.): The Art of Scientific Computing (Cambridge University Press, 1992) 1993 34 COMPREVS Booth, review of Borde, Mathematical TeX By Example (Academic Press, 1993) 1993 34 COMPREVS Owens, review of Neill, Learning C (McGraw-Hill, 1992) 1993 34 COMPREVS Horstmann, review of Meyers, Effective C++: 50 Specific Ways to Improve Your Programs and Designs (Addison-Wesley, 1992) 1993 34 COMPREVS Blackman, review of Schildt, Teach Yourself C++ (Osborne/McGraw-Hill, 1992) 1993 34 COMPREVS Staknis, review of Schildt, Turbo C/C++ (2nd Ed.): The Complete Reference (McGraw-Hill, 1992) 1993 34 COMPREVS Bollman, review of Leighton, Introduction to Parallel Algorithms and Architectures: Array, Trees, Hypercubes (Morgan-Kaufmann, 1992) 1993 34 COMPREVS Horstmann, review of Holub, C + C++: Programming with Objects in C and C++ (McGraw-Hill, 1992) 1993 34 COMPREVS Booth, review of Borde, TeX By Example: A Beginner's Guide (Academic Press, 1992) 1993 34 COMPREVS Zimand, review of Ko, Complexity Theory of Real Functions (Birkhauser Boston, 1991) 1993 34 COMPREVS Codenotti, review of Chaudhuri, Parallel Algorithms: Design and Analysis (Prentice-Hall, 1992) 1993 34 COMPREVS Aspnes, review of Klugerman & Plaxton, Small-Depth Counting Networks (STOC 24, 1992) 1993 34 COMPREVS Kreinovich, review of Blum & Santis & Micali & Persiano, Noninteractive Zero-Knowledge 1992 33 COMPREVS Pandey, review of Aho & Ullman, Foundations of Computer Science (Computer Science Press, 1992) 1992 33 COMPREVS Hailpern, review of Dijkstra, Reasoning about Programs (videotape) (ACM, 1990) 1992 33 COMPREVS Hughes, review of Deitel & Deitel, C: How to Program (Prentice-Hall, 1992) 1992 33 COMPREVS Owens, review of Kruse & Leung & Clovis, Data Structures and Program Design in C (Prentice-Hall, 1992) 1992 33 COMPREVS LePera & Spresser, review of Ross & Wright, Discrete Mathematics (3rd ed.) (Prentice-Hall, 1992) 1992 33 COMPREVS Curelet-Balan, review of Plauger, The Standard C Library (Prentice-Hall, 1992) 1992 33 COMPREVS Sakkinen, review of Ammeraal, C++ for Programmers (Wiley, 1991) 1992 33 COMPREVS Buell, review of Matloff, IBM Microcomputer Architecture and Assembly Language: A Look under the Hood (Prentice-Hall, 1992) 1992 33 COMPREVS Parker, review of LaLonde & Pugh, Inside Smalltalk: Vol. 2 (Prentice-Hall, 1991) 1992 33 COMPREVS Merritt, review of Weiss, Data Structures and Algorithm Analysis (Benjamin-Cummings, 1992) 1992 33 COMPREVS Crepeau, review of Oswald, Diacritical Analysis of Systems: A Treatise on Information Theory (Ellis Horwood, 1991) 1992 33 COMPREVS Stavely, review of Cameron & Rosenblatt, Learning GNU Emacs (O'Reilly & Associates, 1991) 1992 33 COMPREVS Booth, review of Rimmer, Bit-mapped Graphics 1992 33 COMPREVS Howard & Crosby, comparative review of cognitive science textbooks 1992 33 COMPREVS review of Vishkin, Deterministic Sampling: A New Technique for Fast Pattern Matching (1991) 1990 31 COMPREVS Payne, review of Biermann, Great Ideas in Computer Science: A Gentle Introduction (1990) 1990 31 COMPREVS Wegner, review of Penrose, The Emperor's New Mind: Concerning Computers, Minds, and the Laws of Physics (1989) 1989 30 COMPREVS Wilson, review of Allen, Natural Language Understanding (1988) 1989 30 COMPREVS Campbell, review of Harel, Algorithmics: The Spirit of Computing (1986) 1989 30 COMPREVS Wayne, review of Feldman, Data Structures with Modula-2 (1988) 1989 30 COMPREVS Fischer, review of Ahlswede & Wegener, Search Problems, Wiley, 1987 1989 30 COMPREVS Artz, review of Thagard, Computational Philosophy of Science (1988) 1988 COMPREVS Akl, review of Devroye, Lecture Notes on Bucket Algorithms (Birkhauser Boston, 1986) 1987 COMPREVS Stavely, review of Miller, A Software Tools Sampler (Prentice-Hall, 1987) 1987 COMPREVS Salton, review of Dreyfus & Dreyfus & Athanasiou, Mind over Machine: The Power of Human Intuition and Expertise in the Era of the Computer (Free Press, 1986) 1987 COMPREVS Oniga, review of Book & Friedrich, On the Verifiability of Two-Party Algebraic Protocols (TCS, 1985) 1987 29 COMPREVS Ullian, review of Soare (1987) 1987 29 COMPREVS Pan, review of de Groote (1987), Lectures on the Complexity of Bilinear Forms 1987 29 COMPREVS Moret, review of Hong (1986) 1987 28 COMPREVS Appleby, comparative review of data structures books: Horowitz-Sahni, Kruse, Reingold-Hanson (best), Tenenbaum-Augenstein, Tremblay-Sorenson 1986 COMPREVS Simoes-Pereira, review of Hromkovic, On One-way Two-head Deterministic Finite State Automata (Comput. Artif. Intell., 1985) 1986 COMPREVS Adair, review of Harvey, Computer Science LOGO Style. Vol. I: Intermediate Programming (MIT, 1985) 1986 COMPREVS Abramson, review of Tobias & Short & Burrowes & Lough, Beyond Mindstorms: Teaching with IBM LOGO (Holt, Rinehart & Winston, 1985) 1985 COMPREVS Ralston, review of Roberts (1984) 1984 COMPREVS Ralston, review of Polya & Tarjan & Woods, Notes on Introductory Combinatorics (Birkhauser Boston, 1983) 1984 COMPREVS Harel, review of Bavel, Introduction to the Theory of Automata (Reston, 1983) 1981 COMPREVS Kernighan, (Review of Knuth's) TeX and Metafont: New Directions in Typesetting 1980 COMPREVS McQuillin, (Review of Knuth's) TeX and Metafont: New Directions in Typesetting 1968 COMPREVS Floyd, Review of ``On Multi-Head Finite Automata'', by A. L. Rosenberg 1994 14 COMPSHOP Stafford, What's the Code? Data Compression, Part Three 1994 14 COMPSHOP Stafford, What's the Code? Compression Continued 1993 13 COMPSHOP Stafford, What's the Code? Data Compression: Making Nothing Out Of Something 1995 25 COMPSOC Tavani, A Computer Ethics Bibliography 1995 25 COMPSOC Tavani, A Computer Ethics Bibliography 1995 9 COMPSYSTS Clementi & Mentrasti & Pierini, Some Results of Invertible Cellular Automata 1995 9 COMPSYSTS Takesue, Staggered Invariants in Cellular Automata 1995 9 COMPSYSTS Eckart, A Generalization of Cellular Automata 1995 9 COMPSYSTS Joag, Sequences of Pseudorandom Numbers 1994 8 COMPSYSTS Durand, Growing Patterns in One Dimensional Cellular Automata 1994 8 COMPSYSTS Clementi & De Biase & Massini, Fast Parallel Arithmetic on Cellular Automata 1994 8 COMPSYSTS Squier & Steiglitz, Programmable Parallel Arithmetic in Cellular Automata Using a Particle Model 1994 8 COMPSYSTS Terrier, Language Recognizable in Real Time by Cellular Automata 1994 8 COMPSYSTS Shumsky, Computational Properties of Boolean Networks 1994 8 COMPSYSTS Martin, Inherent Generation of Fractals by Cellular Automata 1994 8 COMPSYSTS Prisner, Parallel Chip Firing on Digraphs 1994 8 COMPSYSTS Banzhaf, Self-Replicating Sequences of Binary Numbers: The Build-Up of Complexity 1994 8 COMPSYSTS Page, Covers: A Theory of Boolean Function Decomposition 1994 8 COMPSYSTS Bays, Further Notes on the Game of Three-Dimensional Life 1993 7 COMPSYSTS Dube, Undecidable Problems in Fractal Geometry 1993 7 COMPSYSTS Levine, Cellular Games: An Introduction 1993 7 COMPSYSTS Squier & Steiglitz, Two-Dimensional FHP Lattice Gases Are Computation Universal 1993 7 COMPSYSTS Mitchell & Hraber & Crutchfield, Revisiting the Edge of Chaos: Evolving Cellular Automata to Perform Computations 1993 7 COMPSYSTS Gorodkin & Sorensen & Winther, Neural Networks and Cellular Automata Complexity 1993 7 COMPSYSTS Freund & Wolter, Evolution of Bit Strings II: A Simple Model of Co-Evolution 1992 6 COMPSYSTS Caianiello & Esposito & Marinaro & Tagliaferri, The Behaviour and Learning of a Deterministic Neural Net 1992 6 COMPSYSTS Bartlett & Garzon, Distribution of Linear Rules in Cellular Automata Rule Space 1992 6 COMPSYSTS Homaifar & Guan & Liepins, A New Approach to the Traveling Salesman Problem Using Genetic Algorithms 1992 6 COMPSYSTS Muselli & Ridella, Global Optimization of Functions with the Interval Genetic Algorithm 1992 6 COMPSYSTS Pedersen, Cellular Automata as Algebraic Systems 1992 6 COMPSYSTS Demartines & Blayo, Kohonen Self-Organizing Maps: Is the Normalization Necessary? 1992 6 COMPSYSTS Levine, Regular Language Invariance under One-Dimensional Cellular Automaton Rules 1992 6 COMPSYSTS Levine, Regular Language Invariance under One-Dimensional Cellular Automaton Rules 1992 6 COMPSYSTS Caianiello & Ceccarelli & Marinaro, Can Spurious States Be Useful? 1992 6 COMPSYSTS Cosnard & Tchuente & Tindo, Sequences Generated by Neuronal Automata with Memory 1992 6 COMPSYSTS Mendes & Duarte, Vector Fields and Neural Networks 1992 6 COMPSYSTS Lee & Kothari & Shin, Probabilistic Information Capacity of Hopfield Associative Memory 1991 5 COMPSYSTS Muhlenbein, Darwin's Continent Cycle Theory and Its Simulation by the Prisoner's Dilemma 1991 5 COMPSYSTS Sheth & Nag & Hellwarth, Binary Addition on Cellular Automata 1991 5 COMPSYSTS Li & Peng, Design and Analysis of Competition-Based Neural Networks 1991 5 COMPSYSTS Buss & Papadimitriou & Tsitsiklis, On the Predictability of Coupled Automata: An Allegory about Chaos 1991 5 COMPSYSTS Freund & Wolter, Evolution of Bit Strings: Some Preliminary Results 1991 5 COMPSYSTS Friedman, Structure and Uncomputability in One-Dimensional Maps 1991 5 COMPSYSTS Agur, Fixed Points of Majority Rule Cellular Automata with Application to Plasticity and Precision of the Immune System 1991 5 COMPSYSTS Li, On the Relationship between Complexity and Entropy for Markov Chains and Regular Languages 1991 5 COMPSYSTS Martin & Otto & Felten, Large-Step Markov Chains for the Traveling Salesman Problem 1991 5 COMPSYSTS Binder & Twining & Sherrington, Phase-Space Study of Bistable Cellular Automata 1991 5 COMPSYSTS Goldberg, Real-Coded Genetic Algorithms, Virtual Alphabets, and Blocking 1991 5 COMPSYSTS Voorhees, Geometry and Arithmetic of a Simple Cellular Automaton 1991 5 COMPSYSTS Drescher, Demystifying Quantum Mechanics: A Simple Universe with Quantum Uncertainty 1991 5 COMPSYSTS Madala, Comparison of Inductive versus Deductive Learning Networks 1991 5 COMPSYSTS Bays, A New Game of Three-Dimensional Life 1991 5 COMPSYSTS Sutner, De Bruijn Graphs and Linear Cellular Automata 1990 4 COMPSYSTS Voorhees, Division Algorithm for Cellular Automata Rules 1990 4 COMPSYSTS Halpern & Caltagirone, Behavior of Topological Cellular Automata 1990 4 COMPSYSTS Pedersen, Continuous Transitions of Cellular Automata 1990 4 COMPSYSTS Casartelli, Partitions, Rational Partitions, and Characterization of Complexity 1990 4 COMPSYSTS Fachini & Vassallo, Cellular Automata with Regular Behavior 1990 4 COMPSYSTS Li & Packard, The Structure of the Elementary Cellular Automata Rule Space 1990 4 COMPSYSTS Lindgren & Nordahl, Universal Computation in Simple One-Dimensional Cellular Automata 1990 4 COMPSYSTS Wolpert, The Relationship Between Occam's Razor and Convergent Guessing 1990 4 COMPSYSTS Hurd, Recursive Cellular Automata Invariant Sets 1990 4 COMPSYSTS Hurd, Nonrecursive Cellular Automata Invariant Sets 1990 4 COMPSYSTS Wolpert, A Mathematical Model Theory of Generalization: Part I 1990 4 COMPSYSTS Wolpert, A Mathematical Model Theory of Generalization: Part II 1989 3 COMPSYSTS Floreen & Orponen, On the Computational Complexity of Analyzing Hopfield Nets 1989 3 COMPSYSTS Head, One-Dimensional Cellular Automata: Injectivity from Unambiguity 1989 3 COMPSYSTS Rujan & Marchand, Learning by Minimizing Resources in Neural Networks 1989 3 COMPSYSTS Culik & Dube, Fractal and Recurrent Behavior of Cellular Automata 1989 3 COMPSYSTS Goldberg, Genetic Algorithms and Walsh Functions: Part I, A Gentle Introduction 1989 3 COMPSYSTS Pitsianis & Bleris & Tsalides & Thanailakis & Card, Algebraic Theory of Bounded One-dimensional Cellular Automata 1989 3 COMPSYSTS Nordahl, Formal Languages and Finite Cellular Automata 1988 2 COMPSYSTS Sutner, Additive Automata on Graphs 1988 2 COMPSYSTS Chess, Simulating the Evolution of Behavior: The Iterated Prisoners' Dilemma Problem 1988 2 COMPSYSTS Li, Errata and changes: Power Spectra of Regular Languages and Cellular Automata 1988 2 COMPSYSTS Bays, A Note on the Discovery of a New Game of Three-dimensional Life 1988 2 COMPSYSTS Milnor, On the Entropy Geometry of Cellular Automata 1988 2 COMPSYSTS Sutner, On sigma-Automata 1988 2 COMPSYSTS da Silva & Herrmann & Lucena, Simulations of Mixtures of Two Boolean Cellular Automata Rules 1988 2 COMPSYSTS Tesauro & Janssens, Scaling Relationships in Back-propagation Learning 1988 2 COMPSYSTS Lim, Lattice Gas Automata of Fluid Dynamics for Unsteady Flow 1988 2 COMPSYSTS Peterson & Anderson, Neural Networks and NP-complete Optimization Problems; A Performance Study on the Graph Bisection Problem 1988 2 COMPSYSTS Goldberg, Parity Filter Automata 1987 1 COMPSYSTS Culik, On Invertible Cellular Automata 1987 1 COMPSYSTS Jen, Scaling of Preimages in Cellular Automata 1987 1 COMPSYSTS Walker, Stability of Equilibrial States and Limit Cycles in Sparsely Connected, Structurally Complex Boolean Nets 1987 1 COMPSYSTS Koppel, Complexity, Depth, and Sophistication 1987 1 COMPSYSTS Fahner & Grassberger, Entropy Estimates for Dynamical Systems 1987 1 COMPSYSTS Lubachevsky, Efficient Parallel Simulations of Asynchronous Cellular Arrays 1987 1 COMPSYSTS Lindgren, Errata and Changes: ``Correlations and Random Information in Cellular Automata'' 1987 1 COMPSYSTS Bays, Patterns for Simple Cellular Automata in a Universe of Dense-Packed Spheres 1987 1 COMPSYSTS Denker & Schwartz & Wittner & Solla & Howard & Jackel & Hopfield, Large Automatic Learning, Rule Extraction, and Generalization 1987 1 COMPSYSTS Kugelmass & Squier & Steiglitz, Performance of VLSI Engines for Lattice Computations 1987 1 COMPSYSTS Margolus & Toffoli, Cellular Automata Machines 1987 1 COMPSYSTS Peterson & Anderson, A Mean Field Theory Learning Algorithm for Neural Networks 1987 1 COMPSYSTS Bays, Candidates for the Game of Life in Three Dimensions 1987 1 COMPSYSTS Green, NP-Complete Problems in Cellular Automata 1987 1 COMPSYSTS Hinton & Nowlan, How Learning Can Guide Evolution 1987 1 COMPSYSTS Ilachinski & Halpern, Structurally Dynamic Cellular Automata 1987 1 COMPSYSTS Lindgren, Correlations and Random Information in Cellular Automata 1987 1 COMPSYSTS Faris & Maier, The Value of a Random Game: The Advantage of Rationality 1987 1 COMPSYSTS Langton, Virtual State Machines in Cellular Automata 1987 1 COMPSYSTS Omohundro, Efficient Algorithms with Neural Network Behavior 1987 1 COMPSYSTS Cloney & Goles & Vichniac, The 3x+1 Problem: A Quasi Cellular Automaton 1987 1 COMPSYSTS Skiena, Further Evidence for Randomness in pi 1987 1 COMPSYSTS Tesauro, Scaling Relationships in Back-Propagation Learning: Dependence on Training Set Size 1987 1 COMPSYSTS Albert & Culik, A Simple Universal Cellular Automaton and its One-Way and Totalistic Version 1987 1 COMPSYSTS Guan, Cellular Automaton Public Key Cryptosystem 1987 1 COMPSYSTS Gutowitz & Victor, Local Structure Theory in More Than One Dimension 1987 1 COMPSYSTS Hurd, Formal Language Characterizations of Cellular Automaton Limit Sets 1987 1 COMPSYSTS Lee & Frieder, Self Configuration of Defective Cellular Arrays 1987 1 COMPSYSTS Brown, Competition of Cellular Automata Rules 1987 1 COMPSYSTS Odlyzko & Randall, On the Periods of Some Graph Transformations 1987 1 COMPSYSTS Robison, Fast Computation of Additive Cellular Automata 1984 5 COMPTHEORY Bothe, An Algorithmic Interface Structure for Pascal Compilers 1984 5 COMPTHEORY Budach & Graw, Nonuniform Complexity Classes, Decision Graphs and Homological Properties of Posets 1984 5 COMPTHEORY Burkhard, On the Control of Concurrent Systems by Restrictions of the State Behaviour 1984 5 COMPTHEORY Chlebus, From Domino Tilings to a New Model of Computation 1984 5 COMPTHEORY Danecki, Nondeterministic Propositional Dynamic Logic with Intersection is Decidable 1984 5 COMPTHEORY Diks, A Note on Selection Networks 1984 5 COMPTHEORY Dragalin, Correctness of Inconsistent Theories with Notions of Feasibility 1984 5 COMPTHEORY Ejsmont, On the log-Space Reducibility among Array Languages 1984 5 COMPTHEORY Grabowski, Non-uniformity of Dynamic Logic 1984 5 COMPTHEORY Habasinski, Model Theory of Propositional Logics of Programs: Some Open Problems 1984 5 COMPTHEORY Jaromczyk, Some Results on Decision Trees with Relations to Computational Trees 1984 5 COMPTHEORY Knast, Propositional Calculi of Term Satisfiability and Process Logics 1984 5 COMPTHEORY Kowalczyk, On the Effectiveness of Some Operations on Algorithms 1984 5 COMPTHEORY Krause & Langmaack & Kreczmar & Warpechowski, Concatenation of Program Modules: An Algebraic Approach to the Semantic and Implementation Problems 1984 5 COMPTHEORY Mostowski, Regular Expressions for Infinite Trees and a Standard Form of Automata 1984 5 COMPTHEORY Niwinski, Equational mu-Calculus 1984 5 COMPTHEORY Orlowska, A Logic of Indiscernibility Relations 1984 5 COMPTHEORY Pawlak, Rough Sets and Decision Tables 1984 5 COMPTHEORY Pawlak, On Learning--A Rough Set Approach 1984 5 COMPTHEORY Pettorossi & Skowron, A Methodology for Improving Parallel Programs by Adding Communications 1984 5 COMPTHEORY Radev, Extension of PDL and Consequence Relations 1984 5 COMPTHEORY Ras & Zemankova-Leech, Rough-sets Based Learning Systems 1984 5 COMPTHEORY Rasiowa, Theories of Interacting Stacks 1984 5 COMPTHEORY Rasiowa & Skowron, Rough Concepts Logic 1984 5 COMPTHEORY Rauszer, An Equivalence between Indiscernibility Relations in Information Systems and a Fragment of Intuitionistic Logic 1984 5 COMPTHEORY Rytter, On the Recognition of Context-free Languages 1984 5 COMPTHEORY Skordev, On Multi-valued Homomorphisms 1984 5 COMPTHEORY Starke, Traces and Semiwords 1984 5 COMPTHEORY Suraj, Deadlock Prediction in Linear Systems 1984 5 COMPTHEORY Tinchev & Vakarelov, Propositional Dynamic Logics with Counters and Stacks 1984 5 COMPTHEORY Zilli, Transition Graphs Semantics and Languages 1984 5 COMPTHEORY Warpechowska, On the Implementation of CSP Mechanisms in LOGLAN 1997 30 COMPUTER Mudawwar, Multicode: A Truly Multilingual Approach to Text Encoding 1997 30 COMPUTER Lewis, If Java Is the Answer, What Was the Question? 1996 29 COMPUTER Berners-Lee, WWW: Past, Present, and Future 1996 29 COMPUTER Reddy, The Challenge of Artificial Intelligence 1996 29 COMPUTER Saiedian & Bowen & Butler & Dill & Glass & Gries & Hall & Hinchey & Holloway & Jackson & Jones & Lutz & Parnas & Rushby & Wing & Zave, An Invitation to Formal Methods 1996 29 COMPUTER Jain & Mao & Mohiuddin, Artificial Neural Networks: A Tutorial 1996 29 COMPUTER Raynal & Singhal, Logical Time: Capturing Causality in Distributed Systems 1996 29 COMPUTER Parnas, Why Software Jewels Are Rare 1995 28 COMPUTER McKinley & Tsai & Robinson, Collective Communication in Wormhole-Routed Massively Parallel Computers 1995 28 COMPUTER Nevison, Parallel Computing in the Undergraduate Curriculum 1995 28 COMPUTER Khan & Al-A'ali & Girgis, Object-Oriented Programming for Structured Procedural Programmers 1995 28 COMPUTER Gal-Ezer & Beeri & Harel & Yehudai, A High School Program in Computer Science 1995 28 COMPUTER Stankovic & Spuri & Di Natale & Buttazzo, Implications of Classical Scheduling Results for Real-Time Systems 1995 28 COMPUTER Wirth, A Plea for Lean Software 1995 28 COMPUTER Wood & Hill, Cost-Effective Parallel Computing 1995 28 COMPUTER Lomas & Christianson, To Whom am I Speaking? Remote Booting in a Hostile World 1994 27 COMPUTER Krikelis & Weems, Associative Processing and Processors 1994 27 COMPUTER Furht, Parallel Computing: Glory and Collapse 1994 27 COMPUTER Vetter & Spell & Ward, Mosaic and the World-Wide Web 1994 27 COMPUTER Miller, The Status of Parallel Processing Education 1994 27 COMPUTER Lewis, Where Is Computing Headed? 1994 27 COMPUTER Biermann, Computer Science for the Many 1993 26 COMPUTER Johnson & Hurson & Shirazi, General-Purpose Systolic Arrays 1993 26 COMPUTER Gaughan & Yalamanchili, Adaptive Routing Protocols for Hypercube Interconnection Networks 1992 25 COMPUTER Adrion & Lazowska & van Dam, From Discipline in Crisis to Mature Science: Evolving Needs for Computing Research Infrastructure 1992 25 COMPUTER Brown & Hershberger, Color and Sound in Algorithm Animation 1992 25 COMPUTER Wegner, Dimensions of Object-Oriented Modeling 1992 25 COMPUTER Marsh & Brown & LeBlanc & Scott & Becker & Quiroz & Das & Karlsson, The Rochester Checkers Player: Multimodel Parallel Programming for Animate Vision 1992 25 COMPUTER Rigoutsos & Hummel, Massively Parallel Model Matching: Geometric Hashing on the Connection Machine 1990 23 COMPUTER Parnas, Education for Computing Professionals 1989 22 COMPUTER Dinning, A Survey of Synchronization Methods for Parallel Computers 1989 22 COMPUTER Sharir, Algorithmic Motion Planning in Robotics 1989 22 COMPUTER Hoffmann, The Problems of Accuracy and Robustness in Geometric Computation 1988 21 COMPUTER Feldman & Fanty & Goddard, Computing with Structured Neural Networks 1987 20 COMPUTER Conklin, Hypertext: An Introduction and Survey 1987 20 COMPUTER Hoare, An Overview of Some Formal Methods for Program Design 1983 COMPUTER Davies, Applying the RSA Digital Signature to Electronic Mail 1983 COMPUTER Denning, Protecting Public Keys and Signature Keys 1983 COMPUTER Akl, Digital Signatures: A Tutorial Survey 1983 COMPUTER Kak, Data Security in Computer Networks 1983 COMPUTER DeMillo & Merritt, Protocols for Data Security 1980 13 COMPUTER Salton, Automatic Information Retrieval 1975 8 COMPUTER Atkins, Introduction to the Role of Redundancy in Computer Arithmetic 1996 57 COMPUTG Chen & He & Yao, Three-Partitioning Containing Kernels: Complexity and Heuristic 1996 57 COMPUTG Krause & Rank, A Fast Algorithm for Point-Location in a Finite Element Mesh 1996 56 COMPUTG Punnen, A Fast Algorithm for a Class of Bottleneck Problems 1996 56 COMPUTG Faigle & Garbe & Kern, Randomized Online Algorithms for Maximizing Busy Time Interval Scheduling 1996 56 COMPUTG Zhang, Worst-Case Analysis of the FFH Algorithm for Online Variable-Sized Bin Packing 1996 56 COMPUTG Bekesi & Galambos & Pferschy & Woeginger, The Fractional Greedy Algorithm for Data Compression 1995 55 COMPUTG d'Amore & Nguyen & Roos & Widmayer, On Optimal Cuts of Hyperrectangles 1995 55 COMPUTG Bunke, Fast Approximate Matching of Words Against a Dictionary 1995 54 COMPUTG Locher & Skrzipek, An Algorithm for Locating All Zeros of a Real Polynomial 1995 54 COMPUTG Burkard & Deineko, Polynomially Solvable Cases of the Traveling Salesman Problem and a New Exponential Neighborhood 1995 54 COMPUTG Chung, Fast String Matching Algorithms for Run-Length Coded Strings 1994 53 COMPUTG Benouamer & Jaillon & Michelucci & Moreau, Hashing Lazy Numbers 1994 53 COMPUTG Merrheim, The Computation of Elementary Functions in Radix 2^p 1994 53 COMPUTG Schulte & Omar & Swartzlander, Optimal Initial Approximations for the Newton-Raphson Division Algorithm 1994 52 COMPUTG Ganley & Heath, Heuristics for Laying Out Information Graphs 1994 52 COMPUTG Galambos & van Vliet, Lower Bounds for 1-, 2- and 3-Dimensional On-Line Bin Packing Algorithms 1994 52 COMPUTG Brucker & Nordmann, The k-Track Assignment Problem 1994 52 COMPUTG Poljak & Rendl, Node and Edge Relaxations of the Max-Cut Problem 1994 52 COMPUTG Shakhlevich & Sotskov, Scheduling Two Jobs with Fixed and Nonfixed Routes 1994 52 COMPUTG Babel, A Fast Algorithm for the Maximum Weight Clique Problem 1993 51 COMPUTG Heuser, Deterministic Job-Shop Scheduling Problems with Capacity Focus 1993 51 COMPUTG Kirschenhofer & Prodinger, A Result in Order Statistics Related to Probabilistic Counting 1993 50 COMPUTG Bookstein & Klein, Is Huffman Coding Dead? 1993 50 COMPUTG Bunke & Csirik, An Algorithm for Matching Run-Length Coded Strings 1993 50 COMPUTG Jahn, Loop Invariants in Floating Point Algorithms 1993 50 COMPUTG Mao, Best-k-Fit Bin Packing 1993 50 COMPUTG Kellerer & Woeginger, A Greedy-Heuristic for 3-Partitioning with Similar Elements 1993 50 COMPUTG Posch & Posch, Base Extension Using a Convolution Sum in Residue Number Systems 1993 49 COMPUTG Eiselt & Sandblom, A Computational Study of Redundancy in Randomly Generated Polytopes 1993 49 COMPUTG Galambos & Woeginger, Repacking Helps in Bounded Space On-Line Bin-Packing 1992 49 COMPUTG Ding & Weiss, Best Case Lower Bounds for Heapsort 1992 49 COMPUTG Frommer & Mayer, On the Theory and Practice of Multisplitting Methods in Parallel Computation 1992 48 COMPUTG Bertocchi & Brandolini & Slominski & Sobczynska, A Monte-Carlo Approach for 0-1 Programming Problems 1992 48 COMPUTG Munack, On Global Optimization Using Interval Arithmetic 1992 48 COMPUTG Rote, The Convergence Rate of the Sandwich Algorithm for Approximating Convex Functions 1992 48 COMPUTG Fix & Kannan, A Random Direction Algorithm for an Intersection Problem 1992 48 COMPUTG Handler, A Multiprocessor Working as a Fault-Tolerant Cellular Automaton 1992 48 COMPUTG Bini & Pan, Practical Improvement of the Divide-and-Conquer Eigenvalue Algorithms 1992 47 COMPUTG Muller, Improvements on Printing Mice in Labyrinths 1992 47 COMPUTG Prodinger, Some Comments on a Bin-Packing Problem of W. Knoedel 1991 47 COMPUTG Junger & Reinelt & Zept, Computing Correct Delaunay Triangulations 1991 46 COMPUTG Muller & Wagner, alpha-Vertex Separator is NP-Hard even for 3-Regular Graphs 1991 46 COMPUTG Bhattacharya & Toussaint, Computing Shortest Transversals 1991 46 COMPUTG Su & Chang, On Constructing the Relative Neighborhood Graphs in Euclidean K-dimensional Spaces 1990 45 COMPUTG Brucker & Schlie, Job-Shop Scheduling with Multi-Purpose Machines 1990 45 COMPUTG Burkard & Rote & Yao & Yu, Shortest Polygonal Paths in Space 1990 45 COMPUTG Czopik, The Simultaneous Determination of All Zeros of a Polynomial 1990 44 COMPUTG Hansen & Jaumard, Algorithms for the Maximum Satisfiability Problem 1990 44 COMPUTG Samuel & Toussaint, Computing the External Geodesic Diameter of a Simple Polygon 1990 44 COMPUTG Ruhe & Fruhwirth, epsilon-Optimality for Bicriteria Programs and Its Application to Minimum Cost Flows 1990 43 COMPUTG Flajolet, On Adaptive Sampling 1989 42 COMPUTG Bein & Bruckner, An O(n log n)-Algorithm for Solving a Special Class of Linear Programs 1989 42 COMPUTG Shermer, Hiding People in Polygons 1989 42 COMPUTG Hinz, An Iterative Algorithm for the Tower of Hanoi with Four Pegs 1989 41 COMPUTG Umeo & Asano, Systolic Algorithms for Computational Geometry Problems--A Survey 1988 40 COMPUTG Mohr & Pasche, A Parallel Shortest Path Algorithm 1988 40 COMPUTG Brucker, An Efficient Algorithm for the Job-Shop Problem with Two Jobs 1988 40 COMPUTG Drexl, A Simulated Annealing Approach to the Multiconstraint Zero-One Knapsack Problem 1987 39 COMPUTG Robert & Trystram, An Orthogonal Systolic Array for the Algebraic Path Problem 1987 39 COMPUTG Frenk & Galambos, Hybrid Next-Fit Algorithm for the Two-Dimensional Rectangle Bin-Packing Problem 1987 39 COMPUTG Grotschel & Holland, A Cutting Plane Algorithm for Minimum Perfect 2-Matchings 1987 39 COMPUTG Hertz & de Werra, Using Tabu Search Techniques for Graph Coloring 1986 37 COMPUTG Novacek, Using Time Stamps for Storing and Addressing Extendible Arrays 1986 36 COMPUTG Akl, An Adaptive and Cost-Optimal Parallel Algorithm for Minimum Spanning Trees 1986 36 COMPUTG Chazelle & Lee, On a Circle Placement Problem 1986 36 COMPUTG Santoro & Urrutia, An Improved Algorithm for Boolean Matrix Multiplication 1986 36 COMPUTG Widmayer & Wu & Schlag & Wong, On Some Union and Intersection Problems for Polygons with Fixed Orientations 1970 6 COMPUTG Stoss, k-Tape Simulation of k-Head Turing Machines (in German) 1988 CONCCOMPS Rosenberg, On Validating Parallel Architectures via Graph Embeddings 1988 CONCCOMPS Ramachandran, Fast Parallel Algorithms for Reducible Flow Graphs 1988 CONCCOMPS Gazit & Miller & Teng, Optimal Tree Contraction in the EREW Model 1988 CONCCOMPS Mayr, The Dynamic Tree Expression Problem 1988 CONCCOMPS Rajasekaran & Reif, Randomized Parallel Computation 1988 CONCCOMPS Vitanyi, A Modest Proposal for Communication Costs in Multicomputers 1988 CONCCOMPS Belfore & Johnson & Aylor, The Design of Inherently Fault-Tolerant Systems 1988 CONCCOMPS Kim & Reddy, Fault-Tolerant LU-Decomposition in a Two-Dimensional Systolic Array 1996 8 CONCPE Morales & Roda & Leon & Almeida & Garcia, A Paralel Algorithm for the Integer Knapsack Problem 1996 8 CONCPE Jezequel & Jard, Building a Global Clock for Observing Computations in Distributed Memory Parallel Computers 1995 7 CONCPE Xu & Monien & Luling & Lau, Nearest-Neighbor Algorithms for Load-Balancing in Parallel Computers 1995 7 CONCPE Melhart & Morgenstern & Nute, A Compendium of Processor Allocation Strategies for Two-dimensional Mesh Connected Systems 1995 7 CONCPE Albrizio & Mazzone & Veneziani & Aloisio & Bochicchio & Messina, Pipeline Optimizations for the Prime Factor Algorithm 1995 7 CONCPE Cignoni & Laforenza & Montani & Perego & Scopigno, Evaluation of Parallelization Strategies for an Incremental Delaunay Triangulator in E^3 1994 6 CONCPE Brinch Hansen, SuperPascal--A Publication Language for Parallel Scientific Computing 1994 6 CONCPE Brinch Hansen, Do Hypercubes Sort Faster than Tree Machines? 1993 5 CONCPE Teng & DeMenthon & Davis, Region-to-Region Visibility Analysis Using Data Parallel Machines 1993 5 CONCPE Brinch Hansen, Parallel Cellular Automata: A Model Program for Computational Science 1992 4 CONCPE Ho & Raghunath, Efficient Communication Primitives on Hypercubes 1992 4 CONCPE Cannataro & Spezzano & Talia & Gallizzi, Design, Implementation and Evaluation of a Deadlock-Free Routing Algorithm for Concurrent Computers 1991 3 CONCPE Fox, Physical Computation 1991 3 CONCPE Williams, Performance of Dynamic Load Balancing Algorithms for Unstructured Mesh Calculations 1991 3 CONCPE Aloisio & Lopinto & Veneziani & Fox & Kim, Two Approaches to the Concurrent Implementation of the Prime Factor Algorithm on a Hypercube 1991 3 CONCPE Hoare, The Transputer and Occam: A Personal Story 1991 3 CONCPE Atallah & McFaddin, Sequence Comparison on the Connection Machine 1991 3 CONCPE Wheat, Sorting with Near Linear Speed-up on Tightly Coupled Multiprocessors 1994 5 CONCUR Uselton & Smolka, A Compositional Semantics for Statecharts Using Labeled Transition Systems 1994 5 CONCUR Kiehn & Hennessy, On the Decidability of Non-interleaving Process Equivalences 1994 5 CONCUR Mauw & Mulder, Regularity of BPA-Systems is Decidable 1994 5 CONCUR Girkar & Moll, New Results on the Analysis of Concurrent Systems with an Indefinite Number of Processes 1994 5 CONCUR Di Gianantonio & Honsell & Liani & Plotkin, Countable Non-determinism and Uncountable Limits 1994 5 CONCUR Alur & Courcoubetis & Henzinger, The Observational Power of Clocks 1994 5 CONCUR Kanellakis & Michailidis & Shvartsman, Efficient Parallelism vs. Reliable Distribution: A Trade-off for Concurrent Computations 1994 5 CONCUR Klarlund, The Limit View of Infinite Computations 1994 5 CONCUR Nielsen & Clausen, Bisimulation for Models in Concurrency 1994 5 CONCUR Segala & Lynch, Probabilistic Simulations for Probabilistic Processes 1994 5 CONCUR Yuen & Cleaveland & Dayar & Smolka, Fully Abstract Characterizations of Testing Preorders for Probabilistic Processes 1994 5 CONCUR Wu & Smolka & Stark, Composition and Behaviors of Probabilistic I/O Automata 1992 3 CONCUR Boreale & De Nicola, Testing Equivalences for Mobile Processes 1992 3 CONCUR Jategaonkar & Meyer, Testing Equivalence for Petri Nets with Action Refinement 1992 3 CONCUR Sangiorgi & Milner, The Problem of ``Weak Bisimulation up to'' 1992 3 CONCUR Brinksma, On the Uniqueness of Fixpoints Modulo Observation Congruence 1992 3 CONCUR Groote & Moller, Verification of Parallel Systems via Decomposition 1992 3 CONCUR Gerth & Kuiper & Segers, Interface Refinement in Reactive Systems 1992 3 CONCUR Hennessy, Concurrent Testing of Processes 1992 3 CONCUR Boudol & Castellani & Hennessy & Kiehn, A Theory of Processes with Localities 1992 3 CONCUR Burkart & Steffen, Model Checking for Context-Free Processes 1992 3 CONCUR Christensen & Huttel & Stirling, Bisimulation Equivalence Is Decidable for All Context-Free Processes 1992 3 CONCUR Christensen, Distributed Bisimularity Is Decidable for a Class of Infinite State-Space Processes 1992 3 CONCUR Pnueli, How Vital Is Liveness? Verifying Timing Properties of Reactive and Hybrid Systems 1992 3 CONCUR Stomp, Preserving Specific Properties in Program Development 1992 3 CONCUR Peled, Sometimes ``Some'' Is as Good as ``All'' 1992 3 CONCUR Kaivola & Valmari, The Weakest Compositional Semantic Equivalence Preserving Nexttime-Less Linear Temporal Logic 1992 3 CONCUR Goltz & Kuiper & Penczek, Propositional Temporal Logics and Equivalences 1992 3 CONCUR Pratt, The Duality of Time and Information 1992 3 CONCUR Goubault & Jensen, Homology of Higher Dimensional Automata 1992 3 CONCUR Rensink, Posets for Configurations! 1992 3 CONCUR Meseguer & Montanari & Sassone, On the Semantics of Petri Nets 1992 3 CONCUR Badouel & Darondeau, Structural Operational Specifications and Trace Automata 1992 3 CONCUR Lynch & Lampson & Sogaard-Andersen, At-Most-Once Message Delivery: A Case Study in Algorithm Verification 1992 3 CONCUR Reingold & Wang & Zuck, Games I/O Automata Play 1992 3 CONCUR Alur & Courcoubetis & Halbwachs & Dill & Wong-Toi, Minimization of Timed Transition Systems 1992 3 CONCUR Davies & Schneider, Using CSP to Verify a Timed Protocol over a Fair Medium 1992 3 CONCUR Weinberg & Zuck, Timed Ethernet: Real-Time Formal Specification of Ethernet 1992 3 CONCUR Karjoth, Implementing LOTOS Specifications by Communicating State Machines 1992 3 CONCUR Baeten & Bergstra, Discrete Time Process Algebra 1992 3 CONCUR Klusener, The Silent Step in Time 1992 3 CONCUR Vaandrager & Lynch, Action Transducers and Timed Automata 1992 3 CONCUR Larsen & Skou, Compositional Verification of Probabilistic Processes 1992 3 CONCUR Baeten & Bergstra & Smolka, Axiomatizing Probabilistic Processes: ACP with Generative Probabilities 1992 3 CONCUR Shapiro, Embeddings Among Concurrent Programming Languages 1992 3 CONCUR Rabinovich, Logic of Trace Languages 1992 3 CONCUR Parrow & Sjodin, Multiway Synchronization Verified with Coupled Simulation 1992 3 CONCUR German, Programming in a General Model of Synchronization 1992 3 CONCUR Maraninchi, Operational and Compositional Semantics of Synchronous Automaton Compositions 1992 3 CONCUR Agha & Mason & Smith & Talcott, Towards a Theory of Actor Composition 1991 2 CONCUR Olderog, Towards a Design Calculus for Communicating Programs 1991 2 CONCUR Gunawardena, Geometric Logic, Causality and Event Structures 1991 2 CONCUR Jonsson, Simulations between Specifications of Distributed Systems 1991 2 CONCUR Krishnan, Distributed CCS 1991 2 CONCUR Merritt & Modugno & Tuttle, Time-Constrained Automata 1991 2 CONCUR Moller & Tofts, Relating Processes With Respect to Speed 1991 2 CONCUR Nolte & Priese, Fairness in Models with True Concurrency 1986 CONPAR Burks, A Radically Non-von-Neumann-Architecture for Learning and Discovery 1986 CONPAR Treleaven, Future Parallel Computers 1986 CONPAR Kunde, A General Approach to Sorting on 3-Dimensionally Mesh-Connected Arrays 1986 CONPAR Wagner, Shuffle/Exchange is the Natural Interconnection Scheme for the Parallel Fast Fourier Transform 1996 58 CONSORT Ploger & Klingler, The Molecular Computer 1992 CONTCRYPT Massey, Contemporary Cryptology: An Introduction 1992 CONTCRYPT Smid & Branstad, The Date Encryption Standard: Past and Future 1992 CONTCRYPT Rueppel, Stream Ciphers 1992 CONTCRYPT Diffie, The First Ten Years of Public Key Crypotology 1992 CONTCRYPT Nechvatal, Public Key Cryptography 1992 CONTCRYPT van Oorschot, A Comparison of Practical Public Key Cryptosystems Based on Integer Factorization and Discrete Logarithms 1992 CONTCRYPT Mitchell & Piper & Wild, Digital Signatures 1992 CONTCRYPT Simmons, A Survey of Information Authentication 1992 CONTCRYPT Feigenbaum, Overview of Interactive Proof Systems and Zero-Knowledge 1992 CONTCRYPT Simmons, An Introduction to Shared Secret and/or Shared Control Schemes and Their Application 1992 CONTCRYPT Brickell & Odlyzko, Cryptanalysis: A Survey of Recent Results 1992 CONTCRYPT Moore, Protocol Failures in Cryptosystems 1992 CONTCRYPT Guillou & Ugon & Quisquater, The Smart Card: A Standardized Security Device Dedicated to Public Cryptology 1992 CONTCRYPT Simmons, How to Insure That Data Acquired to Verify Treaty Compliance Are Trustworthy 1972 CPAAP Paterson, Decision Problems in Computational Models 1997 50 CPAM Klain & Rota, A Continuous Analogue of Sperner's Theorem 1997 50 CPAM Spencer, Enumerating Graphs and Brownian Motion 1995 48 CPAM Cantone & Ferro, Techniques of Computable Set Theory with Applications to Proof Verification 1995 48 CPAM Cooper & Hall & Kennedy & Torczon, Interprocedural Analysis and Optimization 1995 48 CPAM Rudolph, Bit-Parallel, Free-Space, Optical Communication 1995 48 CPAM Sharir, Robot Motion Planning 1994 47 CPAM Isopi & Newman, Speed of Parallel Processing for Random Task Graphs 1986 39 CPAM Rabin & Shallit, Randomized Algorithms in Number Theory 1991 13 CPERSONN Biese & Padgett & Ganoe, What Information Systems Graduates Are Really Doing: An Update 1991 13 CPERSONN Schell, Who Teaches Management Information Systems 1996 7 CPM Baeza-Yates & Navarro, A Faster Algorithm for Approximate String Matching 1996 7 CPM El-Mabrouk & Crochemore, Boyer-Moore Strategy to Efficient Approximate String Matching 1996 7 CPM Gasieniec & Karpinski & Plandowski & Rytter, Randomized Efficient Algorithms for Compressed Strings: The Finger-Print Approach 1996 7 CPM Sutinen & Tarhio, Filtration with q-Samples in Approximate String Matching 1996 7 CPM Lipman, Computing Discoveries in Molecular Biology (Abstract) 1996 7 CPM Brodal & Gasieniec, Approximate Dictionary Queries 1996 7 CPM Muth & Manber, Approximate Multiple String Search 1996 7 CPM Armen & Stein, A 2 2/3-Approximation Algorithm for the Shortest Superstring Problem 1996 7 CPM Andersson & Larsson & Swanson, Suffix Trees on Words 1996 7 CPM Breslauer, The Suffix Tree of a Tree and Minimizing Sequential Transducers 1996 7 CPM Farach & Muthukrishnan, Perfect Hashing for Strings: Formalization and Algorithms 1996 7 CPM Gelfand & Mironov & Pevzner, Spliced Alignment: A New Approach to Gene Recognition 1996 7 CPM Ferretti & Nadeau & Sankoff, Original Synteny 1996 7 CPM Berman & Hannenhalli, Fast Sorting by Reversal 1996 7 CPM Sagot & Viari, A Double Combinatorial Approach to Discovering Patterns in Biological Sequences 1996 7 CPM Arratia & Reinert, Poisson Process Approximation for Repeats in One Sequence and Its Application to Sequencing by Hybridization 1996 7 CPM Wang & Gusfield, Improved Approximation Algorithms for Tree Alignment 1996 7 CPM Phillips & Warnow, The Asymmetric Median Tree -- A New Model for Building Consensus Trees 1996 7 CPM Goldberg & Goldberg & Phillips & Sorkin, Constructing Computer Virus Phylogenies 1996 7 CPM Sandak & Nussinov & Wolfson, Docking of Conformationally Flexible Proteins 1996 7 CPM Hart & Istrail, Invariant Patterns in Crystal Lattices: Implications for Protein Folding Algorithms 1996 7 CPM Gusfield & Karp & Wang & Stelling, Graph Traversals, Genes, and Matroids: An Efficient Case of the Travelling Salesman Problem 1996 7 CPM Amir & Calinescu, Alphabet Independent and Dictionary Scaled Matching 1996 7 CPM Park, Analysis of Two-Dimensional Approximate Pattern Matching Algorithms 1996 7 CPM Arikati & Dessmark & Lingas & Marathe, Approximation Algorithms for Maximum Two-Dimensional Pattern Matching 1996 7 CPM Zhang, Efficient Parallel Algorithms for Tree Editing Problems 1996 7 CPM Fu, Approximate Pattern Matching in Directed Graphs 1996 7 CPM Bodlaender & Evans & Fellows, Finite-State Computability of Annotations of Strings and Trees 1995 6 CPM Bafna & Muthukrishnan & Ravi, Computing Similarity between RNA Strings 1995 6 CPM Benham & Kannan & Warnow, Of Chicken Teeth and Mouse Eyes or Generalized Character Compatibility 1995 6 CPM Breslauer & Gasieniec, Efficient String Matching on Coded Texts 1995 6 CPM Cobbs, Fast Approximate Matching using Suffix Trees 1995 6 CPM Dancik, Common Subsequences and Supersequences and Their Expected Length 1995 6 CPM Fu, Pattern Matching in Directed Graphs 1995 6 CPM Gasieniec & Plandowski & Rytter, Constant-Space String Matching with Smaller Number of Comparisons: Sequential Sampling 1995 6 CPM Giancarlo & Grossi, Multi-Dimensional Pattern Matching with Dimensional Wildcards 1995 6 CPM Goldberg & Goldberg & Phillips & Sweedyk & Warnow, Minimizing Phylogenetic Number to Find Good Evolutionary Trees 1995 6 CPM Gupta & Kececioglu & Schaffer, Making the Shortest-Paths Approach to Sum-of-Pairs Multiple Sequence Alignment More Space Efficient in Practice 1995 6 CPM Hanks & Cytron & Gillett, An Efficient Algorithm for Developing Topologically Valid Matchings 1995 6 CPM Hannenhalli, Polynomial-Time Algorithm for Computing Translocation Distance between Genomes 1995 6 CPM Hein & Jiang & Wang & Zhang, On the Complexity of Comparing Evolutionary Trees 1995 6 CPM Karkkainen, Suffix Cactus: A Cross between Suffix Tree and Suffix Array 1995 6 CPM Karpinski & Rytter & Shinohara, Pattern-Matching for Strings with Short Descriptions 1995 6 CPM Knecht, Pairwise Alignment with Scoring on Tuples 1995 6 CPM Kucherov & Rusinowitch, Matching a Set of Strings with Variable Length Don't Cares 1995 6 CPM Lesk, Three-Dimensional Pattern Matching in Protein Structure Analysis 1995 6 CPM Mewes & Heumann, Genome Analysis: Pattern Search in Biological Macromolecules 1995 6 CPM Mohri, Matching Patterns of an Automaton 1995 6 CPM Muthukrishnan, New Results and Open Problems Related to Non-Standard Stringology 1995 6 CPM Park & Kim, String Matching in Hypertext 1995 6 CPM Ravi & Kececioglu, Approximation Algorithms for Multiple Sequence Alignment under a Fixed Evolutionary Tree 1995 6 CPM Rick, A New Flexible Algorithm for the Longest Common Subsequence Problem 1995 6 CPM Roche, Smaller Representations for Finite-State Transducers and Finite-State Automata 1995 6 CPM Sagot & Viari & Soldano, Multiple Sequence Comparison -- A Peptide Matching Approach 1995 6 CPM Vishkin, On a Technique for Parsing a String 1995 6 CPM Yao & Yao, Dictionary Look-Up with Small Errors 1995 6 CPM Zhang & Wang & Shasha, On the Editing Distance between Undirected Acyclic Graphs and Related Problems 1994 5 CPM Benson, A Space Efficient Algorithm for Finding the Best Non-Overlapping Alignment Score 1994 5 CPM Bodlaender & Downey & Fellows & Wareham, The Parameterized Complexity of Sequence Alignment and Consensus 1994 5 CPM Chao, Computing all Suboptimal Alignments in Linear Space 1994 5 CPM Bafna & Lawler & Pevzner, Approximation Algorithms for Multiple Sequence Alignment 1994 5 CPM Huang, A Context Dependent Method for Comparing Sequences 1994 5 CPM Cobbs, Fast Identification of Approximately Matching Substrings 1994 5 CPM Jiang & Wang & Zhang, Alignment of Trees -- an Alternative to Tree Edit 1994 5 CPM Huang & Pevzner & Miller, Parametric Recomputing in Alignment Graphs 1994 5 CPM Luczak & Szpankowski, A Lossy Data Compression Based on String Matching: Preliminary Analysis and Suboptimal Algorithms 1994 5 CPM Manber, A Text Compression Scheme that Allows Fast Searching Directly in the Compressed File 1994 5 CPM Karpinski & Rytter, An Alphabet-Independent Optimal Parallel Search for Three Dimensional Pattern 1994 5 CPM Lestree, Unit Route Upper Bound for String-Matching on Hypercube 1994 5 CPM Kosaraju, Computation of Squares in a String 1994 5 CPM Mohri, Minimization of Sequential Transducers 1994 5 CPM Alexander, Shortest Common Superstrings for Strings of Random Letters 1994 5 CPM Irving & Fraser, Maximal Common Subsequences and Minimal Common Supersequences 1994 5 CPM Breslauer, Dictionary-Matching Using Fixed-Queries Trees 1994 5 CPM Kilpelainen & Mannila, Query Primitives for Tree-Structured Data 1994 5 CPM Idury & Schaffer, Multiple Matching of Parameterized Patterns 1994 5 CPM Akutsu, Approximate String Matching with Don't Care Characters 1994 5 CPM Tang & Zhang & Wu, Matching with Matrix Norm Minimization 1994 5 CPM Chang & Marr, Approximate String Matching and Local Similarity 1994 5 CPM Ito & Shimizu & Nakanishi & Hashimoto, Polynomial-Time Algorithms for Computing Characteristic Strings 1994 5 CPM Sakakibara & Brown & Hughey & Mian & Sjolander & Underwood & Haussler, Rectent Methods for RNA Modeling Using Stochastic Context-Free Grammars 1994 5 CPM Kececioglu & Sankoff, Efficient Bounds for Oriented Chromosome Inversion Distance 1993 4 CPM Akutsu, A Linear Time Pattern Matching Algorithm Between a String and a Tree 1993 4 CPM Breslauer & Colussi & Toniolo, Tight Comparison Bounds for the String Prefix-Matching Problem 1993 4 CPM Fischer & Norel & Nussinov & Wolfson, 3-D Docking of Protein Molecules 1993 4 CPM Garel, Minimal Separators of Two Words 1993 4 CPM Iliopoulos & Moore & Park, Covering a String 1993 4 CPM Irving & Fraser, On the Worst-Case Behaviour of Some Approximation Algorithms for the Shortest Common Supersequence of k Strings 1993 4 CPM Kannan & Myers, An Algorithm for Locating Non-Overlapping Regions of Maximum Alignment Score 1993 4 CPM Kececioglu & Sankoff, Exact and Approximation Algorithms for the Inversion Distance Between Two Chromosomes 1993 4 CPM Kececioglu, The Maximum Weight Trace Problem in Multiple Sequence Alignment 1993 4 CPM Landau & Schmidt, An Algorithm for Approximate Tandem Repeats 1993 4 CPM Landau & Vishkin, Two Dimensional Pattern Matching in a Digitized Image 1993 4 CPM Louchard & Szpankowski, Analysis of a String Edit Problem in a Probabilistic Framework 1993 4 CPM Muthukrishnan, Detecting False Matches in String Matching Algorithms 1993 4 CPM Naor & Brutlag, On Suboptimal Alignments of Biological Sequences 1993 4 CPM Pevzner & Waterman, A Fast Filtration Algorithm for the Substring Matching Problem 1993 4 CPM Regnier & Rostami, A Unifying Look at d-Dimensional Periodicities and Space Coverings 1993 4 CPM Ukkonen, Approximate String-Matching over Suffix Trees 1993 4 CPM Vingron & Pevzner, Multiple Sequence Comparison and n-Dimensional Image Reconstruction 1993 4 CPM Zhang, A New Editing Based Distance Between Unordered Labeled Trees 1992 3 CPM Szpankowski, Probabilistic Analysis of Generalized Suffix Trees 1992 3 CPM Regnier, A Language Approach to String Searching Evaluation 1992 3 CPM Atallah & Jacquet & Szpankowski, Pattern Matching with Mismatches: A Probabilistic Analysis and a Randomized Algorithm 1992 3 CPM Kim & Shawe-Taylor, Fast Multiple Keyword Searching 1992 3 CPM Jacobson & Vo, Heaviest Increasing/Common Subsequence Problems 1992 3 CPM Knight & Myers, Approximate Regular Expression Pattern Matching with Concave Gap Penalties 1992 3 CPM Pevzner & Waterman, Matrix Longest Common Subsequence Problem, Duality and Hilbert Bases 1992 3 CPM Chang & Paige, From Regular Expressions to DFA's Using Compressed NFA's 1992 3 CPM Fischetti & Landau & Schmidt & Sellers, Identifying Periodic Occurrences of a Template with Applications to Protein Structure 1992 3 CPM Sankoff, Edit Distance for Genome Comparison Based on Non-Local Operations 1992 3 CPM Fischer & Nussinov & Wolfson, 3-D Substructure Matching in Protein Molecules 1992 3 CPM Zhang & Shasha & Wang, Fast Serial and Parallel Algorithms for Approximate Tree Matching with VLDC's 1992 3 CPM Kilpelainen & Mannila, Grammatical Tree Matching 1992 3 CPM Chang & Lampe, Theoretical and Empirical Comparisons of Approximate String Matching Algorithms 1992 3 CPM Baeza-Yates & Perleberg, Fast and Practical Approximate String Matching 1992 3 CPM Revuz & Zipstein, DZ: A Text Compression Algorithm For Natural Languages 1992 3 CPM Pevzner, Multiple Alignment with Guaranteed Error Bounds and Communication Cost 1992 3 CPM Irving & Fraser, Two Algorithms for the Longest Common Subsequence of Three (or More) Strings 1992 3 CPM Hui, Color Set Size Problem with Applications to String Matching 1992 3 CPM Mehta & Sahni, Computing Display Conflicts in String and Circular String Visualization 1992 3 CPM Amir & Farach & Matias, Efficient Randomized Dictionary Matching Algorithms 1992 3 CPM Idury & Schaffer, Dynamic Dictionary Matching with Failure Functions 1995 7 CPPRPT SIGS Publications, Special Focus on C++ Books 1995 7 CPPRPT Keffer, The Dynamic Range of C++ 1995 CPROBIA Pemantle, Uniform Random Spanning Trees 1995 CPROBIA Lawler, Random Walks: Simple and Self-Avoiding 1995 CPROBIA Williams, Some Connections Between Brownian Motion and Analysis Via Stochastic Calculus 1995 CPROBIA Pinsky, Can You Feel the Shape of a Manifold With Brownian Motion? 1995 CPROBIA Durrett, Some New Games For Your Computer 1995 CPROBIA Toom, Cellular Automata With Errors: Problems For Students of Probability 1995 CPROBIA Gidas, Metropolis-Type Monte Carlo Simulation Algorithms and Simulated Annealing 1995 CPROBIA Cohen, Random Graphs in Ecology 1995 CPROBIA Mann, How Many Times Should You Shuffle a Deck of Cards? 1995 CPROBIA Maitra & Sudderth, Stochastic Games and Operators 1995 CPROBIA Thron, ``Decisions, Decisions'': The Bandit Model For Decision Processes, Optimal Strategy, and Computer Implementation 1995 CPROBIA Snell & Vanderbei, Three Bewitching Paradoxes 1996 CRCHCD Tonchev, Codes 1996 CRCHCD Colbourn, Computer Science: Selected Applications 1996 CRCHCD Gopalakrishnan & Stinson, Applications of Designs to Cryptography 1996 CRCHCD Gopalakrishnan & Stinson, Derandomization 1996 CRCHCD Street, Optimality and Efficiency: Comparing Block Designs 1996 CRCHCD Colbourn, Group Testing 1996 CRCHCD Dinitz & Lamken & Wallis, Scheduling a Tournament 1996 CRCHCD Colbourn, Winning the Lottery 1996 CRCHCD Gibbons, Computational Methods in Design Theory 1997 CRCPRESS Menezes & van Oorschot & Vanstone, Handbook of Applied Cryptography 1996 CRCPRESS Colbourn & Dinitz (Eds.), The CRC Handbook of Combinatorial Designs 1995 CRCPRESS Chambers (Ed.), Practical Handbook of Genetic Algorithms: New Frontiers, Volume II 1995 CRCPRESS Krantz, The Elements of Advanced Mathematics 1995 CRCPRESS Snell (Ed.), Topics in Contemporary Probability and Its Applications 1995 CRCPRESS Stinson, Cryptography: Theory and Practice 1995 CRCPRESS Chambers (Ed.), Practical Handbook of Genetic Algorithms, Applications: Volume 1 1995 CRCPRESS Lau, A Numerical Library in C for Scientists and Engineers 1994 CRCPRESS Sobol', A Primer for the Monte Carlo Method 1991 CRCPRESS Walker, Fast Fourier Transforms 1991 CRCPRESS Le Mehaute, Fractal Geometries: Theory and Applications 1994 6 CRN Chandra & Patterson & Traub & Young, Do We Produce Too Many Ph.D.s? 1993 5 CRN Schweppe, 1991-92 CRA Taulbee Survey: CS Departments Produced 909 Ph.D.s; Rate of Growth Increased, But Not by Much 1993 5 CRN Maly & French & Fox & Selman, Prototype System PUts Technical Reports On Line 1993 5 CRN Patterson, Novel Program Helps New Faculty with Teaching 1993 5 CRN McCarthy, Merging CS and CE Disciplines Is Not a Good Idea 1993 5 CRN Fellows & Parberry, SIGACT Trying to Get Children Excited about CS 1992 4 CRN Shaw, We Can Teach Software Better 1992 4 CRN Hartmanis & Lin, The King is Dead! Long Live the King! 1992 4 CRN Patterson, Has CS Changed in 20 Years? 1992 4 CRN Gries & Marsh, 1990-91 Taulbee Survey: CS Produced 862 Ph.D.s; Number Taking Faculty Positions Down for Second Year 1991 3 CRN Gries & Marsh, The 1989-90 Taulbee Survey 1991 3 CRN Kieburtz, Formal Software Design Methods Next Step In Improving Quality 1990 2 CRN , Strategic Directions in Computing Research: Conference Report 1990 2 CRN Blumenthal, Scope and Direction of Computer Science and Technology 1990 2 CRN Walker, Analysis of the CRA Study on Faculty Teaching Loads, Departmental Space, and Graduate Student Duties and Support 1990 2 CRN Eerkes, A Comparison of Computer Science Master's Programs At Master's Only and Ph. D. Granting Institutions 1990 2 CRN Babcock & Gore, Technology Transfer Through Collaborative Research 1990 2 CRN Gries, Workshop on Computing Curricula for the 1990's 1990 2 CRN NSF, Database Systems: Achievements and Opportunities; Summary of the Report of the NSF Invitational Workshop on Future Directions in DBMS Research 1990 2 CRN Darlington, NSF Presidential Young Investigator Awards Encourage Science Teaching Careers 1990 2 CRN Wegner, Computer Science: Achievements and Opportunities; Report of the NSF Advisory Committee on Computer Research 1990 2 CRN Atkinson & Anderson, Wiring the Campuses 1996 16 CRYPTO Bellare & Canettii & Krawczyk, Keying Hash Functions for Message Authentication 1996 16 CRYPTO Atici & Stinson, Universal Hashing and Multiple Authentication 1996 16 CRYPTO Helleseth & Johansson, Universal Hash Functions from Exponential Sums over Finite Fields and Galois Rings 1996 16 CRYPTO Patarin, Asymmetric Cryptography with a Hidden Monomial 1996 16 CRYPTO Simon, Anonymous Communication and Anonymous Cash 1996 16 CRYPTO Langford, Weaknesses in Some Threshold Cryptosystems 1996 16 CRYPTO Vaudenay, Hidden Collisions on DSS 1996 16 CRYPTO Young & Yung, The Dark Side of `Black-Box' Cryptography, or: Should We Trust Capstone? 1996 16 CRYPTO Kocher, Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems 1996 16 CRYPTO Naslund, All Bits in ax+b mod p are Hard 1996 16 CRYPTO Boneh & Venkatesan, Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes 1996 16 CRYPTO Schnorr, Security of 2^t-Root Identification Signatures 1996 16 CRYPTO Gennaro & Jarecki & Krawczyk & Rabin, Robust and Efficient Sharing of RSA Functions 1996 16 CRYPTO Cramer & Damgard, New Generation of Secure and Practical RSA-Based Signatures 1996 16 CRYPTO Jakobsson & Yung, Proving Without Knowing: On Oblivious, Agnostic and Blindfolded Provers 1996 16 CRYPTO Halevi & Micali, Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing 1996 16 CRYPTO Knudsen & Meier, Improved Differential Attacks on RC5 1996 16 CRYPTO van Oorschot & Wiener, Improving Implementable Meet-in-the-Middle Attacks by Orders of Magnitude 1996 16 CRYPTO Kelsey & Schneier & Wagner, Key-Schedule Cryptanalysis of IDEA, G-DES, GOST, SAFER, and Triple-DES 1996 16 CRYPTO Kilian & Rogaway, How to Protect DES Against Exhaustive Key Search 1996 16 CRYPTO Maurer & Wolf, Diffie-Hellman Oracles 1996 16 CRYPTO Boneh & Lipton, Algorithms for Black-Box Fields and Their Application to Cryptography 1996 16 CRYPTO Bosselaers & Govaerts & Vandewalle, Fash Hashing on the Pentium 1996 16 CRYPTO Shoup, On Fast and Provably Secure Message Authentication Based on Universal Hashing 1996 16 CRYPTO Hughes & Luther & Morgan & Peterson & Simmons, Quantum Cryptography over Underground Optical Fibers 1996 16 CRYPTO Mayers, Quantum Key Distribution and String Oblivious Transfer in Noisy Channels 1996 16 CRYPTO Massey & Serconek, Linear Complexity of Periodic Sequences: A General Theory 1996 16 CRYPTO Camion & Canteaut, Generalization of Siegenthaler Inequality and Schnorr-Vaudenay Multipermutations 1996 16 CRYPTO Blundo & Mattos & Stinson, Trade-offs Between Communication and Storage in Unconditionally Secure Schemes for Broadcast Encryption and Interactive Key Distribution 1996 16 CRYPTO Droste, New Results on Visual Cryptography 1995 15 CRYPTO Preneel & van Oorschot, MDx-MAC and Building Fast MACs from Hash Functions 1995 15 CRYPTO Bellare & Guerin & Rogaway, XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions 1995 15 CRYPTO Rogaway, Bucket Hashing and its Application to Fast Message Authentication 1995 15 CRYPTO Schroeppel & Orman & O'Malley & Spatscheck, Fast Key Exchange with Elliptic Curve Systems 1995 15 CRYPTO Beguin & Quisquater, Fast Server-Aided RSA Signatures Secure Against Active Attacks 1995 15 CRYPTO Lim & Lee, Security and Performance of Server-Aided RSA Computation Protocols 1995 15 CRYPTO Halevi, Efficient Commitment Schemes with Bounded Sender and Unbounded Receiver 1995 15 CRYPTO Beaver, Precomputing Oblivious Transfer 1995 15 CRYPTO Crepeau & van de Graaf & Tapp, Committed Oblivious Transfer and Private Multi-Party Computation 1995 15 CRYPTO Mayers, On the Security of the Quantum Oblivious Transfer and Key Distribution Protocols 1995 15 CRYPTO Theobald, How to Break Shamir's Asymmetric Basis 1995 15 CRYPTO Park & Lee & Goh, On the Security of the Gollmann Cascades 1995 15 CRYPTO Ohta & Moriai & Aoki, Improving the Search Algorithm for the Best Linear Expression 1995 15 CRYPTO Kaliski & Yin, On Differential and Linear Cryptanalysis of the RC5 Encryption Algorithm 1995 15 CRYPTO Micali & Sidney, A Simple Method for Generating and Sharing Pseudo-Random Functions, with Applications to Clipper-like Key Escrow Systems 1995 15 CRYPTO Lenstra & Winkler & Yacobi, A Key Escrow System with Warrant Bounds 1995 15 CRYPTO Kilian & Leighton, Fair Cryptosystems, Revisited 1995 15 CRYPTO Frankel & Yung, Escrow Encryption Systems Visited: Attacks, Analysis and Designs 1995 15 CRYPTO Anderson & Needham, Robustness Principles for Public Key Protocols 1995 15 CRYPTO Patarin, Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt '88 1995 15 CRYPTO Klapper & Goresky, Cryptanalysis Based on 2-Adic Rational Approximation 1995 15 CRYPTO Knudsen, A Key-schedule Weakness in SAFER K-64 1995 15 CRYPTO Frankel & Yung, Cryptanalysis of the Immunized LL Public Key Systems 1995 15 CRYPTO Cramer & Damgard, Secure Signature Schemes based on Interactive Protocols 1995 15 CRYPTO Kilian, Improved Efficient Arguments 1995 15 CRYPTO Damgard & Goldreich & Okamoto & Wigderson, Honest Verifier vs Dishonest Verifier in Public Coin Zero-Knowledge Proofs 1995 15 CRYPTO Herzberg & Jarecki & Krawczyk & Yung, Proactive Secret Sharing Or: How to Cope With Perpetual Leakage 1995 15 CRYPTO Beimel & Chor, Secret Sharing with Public Reconstruction 1995 15 CRYPTO Blakley & Kabatianski, On General Perfect Secret Sharing Schemes 1995 15 CRYPTO Dodson & Lenstra, NFS with Four Large Primes: An Explosive Experiment 1995 15 CRYPTO Bleichenbacher & Bosma & Lenstra, Some Remarks on Lucas-Based Cryptosystems 1995 15 CRYPTO Langford, Threshold DSS Signatures without a Trusted Party 1995 15 CRYPTO Kurosawa & Obana & Ogata, t-Cheater Identifiable (k,n) Threshold Secret Sharing Schemes 1995 15 CRYPTO Boneh & Lipton, Quantum Cryptanalysis of Hidden Linear Functions 1995 15 CRYPTO Okamoto, An Efficient Divisible Electronic Cash Scheme 1995 15 CRYPTO Boneh & Shaw, Collusioin-Secure Fingerprinting for Digital Data 1994 14 CRYPTO Matsui, The First Experimental Cryptanalysis of the Data Encryption Standard 1994 14 CRYPTO Ohta & Aoki, Linear Cryptanalysis of the Fast Data Encipherment Algorithm 1994 14 CRYPTO Langford & Hellman, Differential-Linear Cryptanalysis 1994 14 CRYPTO Kaliski & Robshaw, Linear Cryptanalysis Using Multiple Approximations 1994 14 CRYPTO Tillich & Zemor, Hashing with SL_2 1994 14 CRYPTO Chao & Tanada & Tsujii, Design of Elliptic Curves with Controllable Lower Boundary of Extension Degree for Reduction Attacks 1994 14 CRYPTO Biehl & Buchmann & Thiel, Cryptographic Protocols Based on Discrete Logarithms in Real-Quadratic Orders 1994 14 CRYPTO Okamoto, Designated Confirmer Signatures and Public-Key Encryption are Equivalent 1994 14 CRYPTO Bleichenbacher & Maurer, Directed Acyclic Graphs, One-way Functions and Digital Signatures 1994 14 CRYPTO Delos & Quisquater, An Identity-based Signature Scheme with Bounded Life-span 1994 14 CRYPTO Lim & Lee, More Flexible Exponentiation with Precomputation 1994 14 CRYPTO Horvath & Magliveras & van Trung, A Parallel Permutation Multiplier for a PGM Crypto-Chip 1994 14 CRYPTO Davis & Ihaka & Fenstermacher, Cryptographic Randomness from Air Turbulence in Disk Drives 1994 14 CRYPTO Gehrmann, Cryptanalysis of the Gemmell and Naor Multiround Authentication Protocol 1994 14 CRYPTO Krawczyk, LFSR-based Hashing and Authentication 1994 14 CRYPTO Kurosawa, New Bound on Authentication Code with Arbitration 1994 14 CRYPTO Blundo & De Santis & Di Crescenzo & Gaggia & Vaccaro, Multi-secret Sharing Schemes 1994 14 CRYPTO Stern, Designing Identification Schemes with Keys of Short Size 1994 14 CRYPTO Cramer & Damgard & Schoenmakers, Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols 1994 14 CRYPTO Itoh & Ohta & Shizuya, Language Dependent Secure Bit Commitment 1994 14 CRYPTO Girault & Stern, On the Length of Cryptographic Hash-Values Used in Identification Schemes 1994 14 CRYPTO Bellare & Goldreich & Goldwasser, Incremental Cryptography: The Case of Hashing and Signing 1994 14 CRYPTO Dwork & Naor, An Efficient Existentially Unforgeable Signature Scheme and its Applications 1994 14 CRYPTO Bierbrauer & Gopalakrishnan & Stinson, Bounds for Resilient Functions and Orthogonal Arrays 1994 14 CRYPTO Chor & Fiat & Naor, Tracing Traitors 1994 14 CRYPTO Maurer, Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms 1994 14 CRYPTO Mihailescu, Fast Generation of Provable Primes Using Search in Arithmetic Progressions 1994 14 CRYPTO Coppersmith, Attack on the Cryptographic Scheme NIKS-TAS 1994 14 CRYPTO Burmester, On the Risk of Opening Distributed Keys 1994 14 CRYPTO Beth & Lazic & Mathias, Cryptanalysis of Cryptosystems Based on Remote Chaos Replication 1994 14 CRYPTO Massey & Serconek, A Fourier Transform Approach to the Linear Complexity of Nonlinearly Filtered Sequences 1994 14 CRYPTO Bellare & Kilian & Rogaway, The Security of Cipher Block Chaining 1994 14 CRYPTO Gilbert & Chauvaud, A Chosen Plaintext Attack of the 16-round Khufu Cryptosystem 1994 14 CRYPTO Tsunoo & Okamoto & Uyematsu, Ciphertext Only Attack for One-way Function of the MAP Using One Ciphertext 1994 14 CRYPTO Seberry & Zhang & Zheng, Pitfalls in Designing Substitution Boxes 1994 14 CRYPTO Kushilevitz & Rosen, A Randomness-Rounds Tradeoff in Private Computation 1994 14 CRYPTO Sako & Kilian, Secure Voting Using Partially Compatible Homomorphisms 1994 14 CRYPTO Canetti & Herzberg, Maintaining Security in the Presence of Transient Faults 1993 13 CRYPTO Shamir, Efficient Signature Schemes Based on Birational Permutations 1993 13 CRYPTO Stern, A New Identification Scheme Based on Syndrome Decoding 1993 13 CRYPTO Coppersmith & Krawczyk & Mansour, The Shrinking Generator 1993 13 CRYPTO Taylor, An Integrity Check Value Algorithm for Stream Ciphers 1993 13 CRYPTO Seberry & Zhang & Zheng, Nonlinearly Balanced Boolean Functions and their Propogation Characteristics 1993 13 CRYPTO Itoh & Hoshi & Tsujii, A Low Communication Competitive Interactive Proof System for Promised Quadratic Residuosity 1993 13 CRYPTO De Santis & Di Crescenzo & Persiano, Secret Sharing and Perfect Zero-Knowledge 1993 13 CRYPTO Aumann & Feige, One Message Proof Systems with Known Space Verifiers 1993 13 CRYPTO Damgard, Interactive Hashing Can Simplify Zero-Knowledge Protocol Design without Complexity Assumptions 1993 13 CRYPTO Blundo & Cresti & De Santis & Vaccaro, Fully Dynamic Secret Sharing Schemes 1993 13 CRYPTO Jackson & Martin & O'Keefe, Multisecret Threshold Schemes 1993 13 CRYPTO Krawczyk, Secret Sharing Made Short 1993 13 CRYPTO Adleman & DeMarrais, A Subexponential Algorithm for Discrete Logarithms over All Finite Fields 1993 13 CRYPTO Buchmann & Loho & Zayer, An Implementation of the General Number Field Sieve 1993 13 CRYPTO Denny & Dodson & Lenstra & Manasse, On the Factorization of RSA-120 1993 13 CRYPTO Bosselaers & Govaerts & Vandewalle, Comparison of Three Modular Reduction Functions 1993 13 CRYPTO Ben-Aroya & Biham, Differential Cryptanalysis of Lucifer 1993 13 CRYPTO Ohta & Matsui, Differential Attack on Message Authentication Codes 1993 13 CRYPTO Preneel & Nuttin & Rijmen, Cryptanalysis of the CFB Mode of the DES with a Reduced Number of Rounds 1993 13 CRYPTO Daemen & Govaerts & Vandewalle, Weak Keys for IDEA 1993 13 CRYPTO Bellare & Rogaway, Entity Authentication and Key Distribution 1993 13 CRYPTO Damgard & Pedersen & Pfitzmann, On the Existence of Statistically Hiding Bit Commitment Schemes and Fail-Stop Signatures 1993 13 CRYPTO Franklin & Haber, Joint Encryption and Message-Efficient Secure Computation 1993 13 CRYPTO Blum & Furst & Kearns & Lipton, Cryptographic Primitives Based on Hard Learning Problems 1993 13 CRYPTO Ferguson, Extensions of Single-term Coins 1993 13 CRYPTO Brands, Untraceable Off-line Cash in Wallets with Observers 1993 13 CRYPTO Crepeau & Kilian, Discreet Solitary Games 1993 13 CRYPTO Bierbrauer & Johansson & Kabatianskii & Smeets, On Families of Hash Functions via Geometric Codes and Concatenation 1993 13 CRYPTO Johansson, On the Construction of Perfect Authentication Codes that Permit Arbitration 1993 13 CRYPTO Gemmell & Naor, Codes for Interactive Authentication 1993 13 CRYPTO Preneel & Govaerts & Vandewalle, Hash Functions Based on Block Ciphers: A Synthetic Approach 1993 13 CRYPTO Hohl & Lai & Meier & Waldvogel, Security of Iterated Hash Functions Based on Block Ciphers 1993 13 CRYPTO Patarin & Chauvaud, Improved Algorithms for the Permuted Kernel Problem 1993 13 CRYPTO O'Connor, On the Distribution of Characteristics in Composite Permutations 1993 13 CRYPTO Li & Hwang & Lee, Remark on the Threshold RSA Signature Scheme 1993 13 CRYPTO Lim & Lee, Another Method for Attaining Security against Adaptively Chosen Ciphertext Attacks 1993 13 CRYPTO Coppersmith & Stern & Vaudenay, Attacks on the Birational Permutation Signature Schemes 1993 13 CRYPTO Beimel & Chor, Interaction in Key Distribution Schemes 1993 13 CRYPTO Leighton & Micali, Secret-Key Agreement without Public-Key Cryptography 1993 13 CRYPTO Fiat & Naor, Broadcast Encryption 1992 12 CRYPTO Bos & Chaum, Provably Unforgeable Signatures 1992 12 CRYPTO van Heijst & Pedersen & Pfitzmann, New Constructions of Fail-Stop Signatures and Lower Bounds 1992 12 CRYPTO Okamoto & Fujioka & Fujisaki, An Efficient Digital Signature Scheme Based on an Elliptic Curve over the Ring Z_n 1992 12 CRYPTO Gordon, Designing and Detecting Trapdoors for Discrete Log Cryptosystems 1992 12 CRYPTO Smid & Branstad, Response to Comments on the NIST Proposted Digital Signature Standard 1992 12 CRYPTO Chaum & Pedersen, Wallet Databases with Observers 1992 12 CRYPTO Hirschfeld, Making Electronic Refunds Safer 1992 12 CRYPTO Micali, Fair Public-Key Cryptosystems 1992 12 CRYPTO Dwork & Naor, Pricing via Processing or Combatting Junk Mail 1992 12 CRYPTO Blundo & De Santis & Gargano & Vaccaro, On the Information Rate of Secret Sharing Schemes 1992 12 CRYPTO Stinson, New General Lower Bounds on the Information Rate of Secret Sharing Schemes 1992 12 CRYPTO Beimel & Chor, Universally Ideal Secret Sharing Schemes 1992 12 CRYPTO Naor & Ostrovsky & Venkatesan & Yung, Perfect Zero-Knowledge Arguments for NP can be Based on General Complexity Assumptions 1992 12 CRYPTO Dwork & Feige & Kilian & Naor & Safra, Low Communication 2-Prover Zero-Knowledge Proofs for NP 1992 12 CRYPTO Goldwasser & Ostrovsky, Invariant Signatures and Non-Interactive Zero-Knowledge Proofs are Equivalent 1992 12 CRYPTO Sakurai & Itoh, On the Discrepancy between Serial and Parallel of Zero-Knowledge Protocols 1992 12 CRYPTO Sivabalan & Tavares & Peppard, On the Design of SP Networks from an Information Theoretic Point of View 1992 12 CRYPTO Carlet, Partially-Bent Functions 1992 12 CRYPTO Zheng & Seberry, Practical Approaches to Attaining Security Against Adaptively Chosen Ciphertext Attacks 1992 12 CRYPTO Baritaud & Campana & Chauvaud & Gilbert, On the Security of the Permuted Kernel Identification Scheme 1992 12 CRYPTO Gordon & McCurley, Massively Parallel Computation of Discrete Logarithms 1992 12 CRYPTO Peralta, A Quadratic Sieve on the n-Dimensional Cube 1992 12 CRYPTO Meier & Staffelbach, Efficient Multiplication on Certain Nonsupersingular Elliptic Curves 1992 12 CRYPTO Koyama & Tsuruoka, Speeding up Elliptic Cryptosystems by Using a Signed Binary Window Method 1992 12 CRYPTO Brandt & Damgard, On Generation of Probable Primes by Incremental Search 1992 12 CRYPTO Fellows & Koblitz, Kid Krypto 1992 12 CRYPTO Bellare & Goldreich, On Defining Proofs of Knowledge 1992 12 CRYPTO Herzberg & Luby, Public Randomness in Cryptography 1992 12 CRYPTO Russell, Necessary and Sufficient Conditions for Collision-Free Hashing 1992 12 CRYPTO Bellare & Yung, Certifying Cryptographic Tools: The Case of Trapdoor Permutations 1992 12 CRYPTO Maurer, Protocols for Secret Key Agreement by Public Discussion Based on Common Information 1992 12 CRYPTO Blundo & De Santis & Herzberg & Kutten & Vaccaro & Yung, Perfectly-Secure Key Distribution for Dynamic Conferences 1992 12 CRYPTO Biham & Shamir, Differential Cryptanalysis of the Full 16-Round DES 1992 12 CRYPTO Knudsen, Iterative Characteristics of DES and S^2 DES 1992 12 CRYPTO Campbell & Wiener, DES is not a Group 1992 12 CRYPTO Eberle, A High-Speed DES Implementation for Network Applications 1992 12 CRYPTO Blakley & Blakley & Chan & Massey, Threshold Schemes with Disenrollment 1992 12 CRYPTO Frankel & Desmedt & Burmester, Non-existence of Homomorphic General Sharing Schemes for Some Key Spaces 1992 12 CRYPTO Harn & Lin, An l-Span Generalized Secret Sharing Scheme 1992 12 CRYPTO Nyberg & Knudsen, Provable Security Against Differential Cryptanalysis 1992 12 CRYPTO Wayner, Content-Addressable Search Engines and DES-like Systems 1992 12 CRYPTO Vaudenay, FFT-Hash-II is not yet Collision-free 1991 11 CRYPTO Abadi & Burrows & Lampson & Plotkin, A Calculus for Access Control in Distributed Systems 1991 11 CRYPTO Toussaint, Deriving the Complete Knowledge of Participants in Cryptographic Protocols 1991 11 CRYPTO Bird & Gopal & Herzberg & Janson & Kutten & Molva & Yung, Systematic Design of Two-Way Authentication Protocols 1991 11 CRYPTO Stinson, Combinatorial Characterizations of Authentication Codes 1991 11 CRYPTO Stinson, Universal Hashing and Authentication Codes 1991 11 CRYPTO Camion & Carlet & Charpin and Sendrier, On Correlation-Immune Functions 1991 11 CRYPTO Capocelli & De Santis & Gargano & Vaccaro, On The Size of Shares for Secret Sharing Schemes 1991 11 CRYPTO Dwork, On Verification in Secret Sharing 1991 11 CRYPTO Pedersen, Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing 1991 11 CRYPTO Fischer & Wright, Multiparty Secret Key Exchange Using a Random Deal of Cards 1991 11 CRYPTO Biham and Shamir, Differential Cryptanalysis of Snefru, Khafre, REDOC-II, LOKI, and Lucifer 1991 11 CRYPTO Tardy-Corfdir & Gilbert, A Known Plaintext Attack on FEAL-4 and FEAL-6 1991 11 CRYPTO Morita & Ohta & Miyaguchi, A Switching Closure Test to Analyze Cryptosystems 1991 11 CRYPTO den Boer and Bosselaers, An Attack on the Last Two Rounds of MD4 1991 11 CRYPTO Chee & Joux & Stern, The Cryptanalysis of a New Public-Key Cryptosystem Based on Modular Knapsacks 1991 11 CRYPTO Lapidot & Shamir, A One-Round, Two-Prover, Zero-Knowledge Protocol for NP 1991 11 CRYPTO Kilian & Rubinfeld, Interactive Proofs With Space Bounded Provers 1991 11 CRYPTO Teng, Functional Inversion and Communication Complexity 1991 11 CRYPTO Rudich, The Use of Interaction in Public Cryptosystems 1991 11 CRYPTO Koyama & Maurer & Okamoto & Vanstone, New Public-key Schemes Based on Elliptic Curves over the Ring Z_n 1991 11 CRYPTO Okamoto & Sakurai, Efficient Algorithms for the Construction of Hyperelliptic Cryptosystems 1991 11 CRYPTO Koblitz, CM-Curves with Good Cryptographic Properties 1991 11 CRYPTO Tsujii & Chao, A New ID-Based Key Sharing System 1991 11 CRYPTO Luby, Pseudo-random Generators from One-way Functions 1991 11 CRYPTO Patarin, New results on Pseudorandom Permutation Generators Based on the DES Scheme 1991 11 CRYPTO Walter, Faster Modular Multiplication by Operand Scaling 1991 11 CRYPTO Okamoto & Ohta, Universal Electronic Cash 1991 11 CRYPTO Pfitzmann & Waidner, How to Break and Repair a ``Provably Secure'' Untraceable Payment System 1991 11 CRYPTO Bennett & Brassard & Crepeau & Skubiszewska, Practical Quantum Oblivious Transfer 1991 11 CRYPTO Broscius & Smith, Exploiting Parallelism in Hardware Implementation of the DES 1991 11 CRYPTO Beaver, Foundations of Secure Interactive Computing 1991 11 CRYPTO Micali & Rogaway, Secure Computation 1991 11 CRYPTO Iversen, A Cryptographic Scheme for Computerized General Elections 1991 11 CRYPTO Beaver, Efficient Multiparty Protocols Using Circuit Randomization 1991 11 CRYPTO Rackoff & Simon, Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack 1991 11 CRYPTO Damgard, Towards Practical Public Key Systems Secure Against Chosen Ciphertext Attacks 1991 11 CRYPTO Desmedt & Frankel, Shared Generation of Authenticators and Signatures 1991 11 CRYPTO Chaum & van Heijst & Pfitzmann, Cryptographically Strong Undeniable Signatures, Unconditionally Secure For The Signer 1990 10 CRYPTO Biham & Shamir, Differential Cryptanalysis of DES-like Cryptosystems 1990 10 CRYPTO Gilbert & Chasse, A Statistical Attack of the Feal-8 Cryptosystem 1990 10 CRYPTO Zeng & Yang & Rao, An Improved Linear Syndrome Algorithm in Cryptanalysis with Applications 1990 10 CRYPTO Brassard & Crepeau, Quantum Bit Commitment and Coin Tossing Protocols 1990 10 CRYPTO Beaver & Feigenbaum & Kilian & Rogaway, Security with Low Communication Overhead 1990 10 CRYPTO Goldwasser & Levin, Fair Computation of General Functions in Presence of Immoral Majority 1990 10 CRYPTO Brassard & Yung, One-Way Group Actions 1990 10 CRYPTO LaMacchia & Odlyzko, Solving Large Sparse Linear Systems over Finite Fields 1990 10 CRYPTO Buchmann & Dullmann, On the Computation of Discrete Logarithms in Class Groups 1990 10 CRYPTO Chuang & Dunham, Matrix Extensions of the RSA Algorithm 1990 10 CRYPTO Koblitz, Constructing Elliptic Curve Cryptosystems in Characteristic 2 1990 10 CRYPTO Beth & Desmedt, Identification Tokens -- or: Solving the Chess Grandmaster Problem 1990 10 CRYPTO Desmedt & Yung, Arbitrated Unconditionally Secure Authentication Can Be Unconditionally Protected Against Arbiter's Attacks 1990 10 CRYPTO Boyar & Chaum & Damgard & Pedersen, Convertible Undeniable Signatures 1990 10 CRYPTO Chaum & Roijakkers, Unconditionally Secure Digital Signatures 1990 10 CRYPTO Simmons, Geometric Shared Secret and/or Shared Control Schemes 1990 10 CRYPTO Brickell & Stinson, Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes 1990 10 CRYPTO Micali & Rabin, Collective Coin Tossing Without Assumptions Nor Broadcasting 1990 10 CRYPTO Yacobi, A Key Distribution ``Paradox'' 1990 10 CRYPTO Fumy & Munzert, A Modular Approach to Key Distribution 1990 10 CRYPTO Zheng & Matsumoto & Imai, Structural Properties of One-way Hash Functions 1990 10 CRYPTO Rivest, The MD4 Message Digest Algorithm 1990 10 CRYPTO Kilian, Achieving Zero-Knowledge Robustly 1990 10 CRYPTO Beaver & Feigenbaum & Shoup, Hiding Instances in Zero-Knowledge Proof Systems 1990 10 CRYPTO Kurosawa & Tsujii, Multi-Language Zero-knowledge Interactive Proof Systems 1990 10 CRYPTO Lapidot & Shamir, Publicly Verifiable Non-Interactive Zero-Knowledge Proofs 1990 10 CRYPTO De Santis & Yung, Cryptographic Applications of the Non-Interactive Metaproof and Many-Prover Systems 1990 10 CRYPTO Kilian, Interactive Proofs with Provable Security Against Honest Verifiers 1990 10 CRYPTO Schrift & Shamir, On the Universality of the Next Bit Test 1990 10 CRYPTO Maurer, A Universal Statistical Test for Random Bit Generators 1990 10 CRYPTO McInnes & Pinkas, On the Impossibility of Private Key Cryptography with Weakly Random Keys 1990 10 CRYPTO Haber & Stornetta, How to Time-Stamp a Digital Document 1990 10 CRYPTO Okamoto & Ohta, How to Utilize the Randomness of Zero-Knowledge Proofs 1990 10 CRYPTO Merkle, Fast Software Encryption Functions 1990 10 CRYPTO de Waleffe & Quisquater, CORSAIR: A Smart Card for Public Key Cryptosystems 1990 10 CRYPTO Kompella & Adleman, Fast Checkers for Cryptography 1990 10 CRYPTO Cleve, Complexity Theoretic Issues Concerning Block Ciphers Related to D. E. S. 1990 10 CRYPTO Cusick & Wood, The REDOC II Cryptosystem 1990 10 CRYPTO Kim & Matsumoto & Imai, A Recursive Construction Method of S-boxes Satisfying Strict Avalanche Criterion 1990 10 CRYPTO van Oorschot, A Comparison of Practical Public Key Cryptosystems Based on Integer Factorization and Discrete Logarithms 1990 10 CRYPTO Koyama & Terada, Nonlinear Parity Circuits and their Cryptographic Applications 1990 10 CRYPTO Staffelbach & Meier, Cryptographic Significance of the Carry for Ciphers Based on Integer Addition 1990 10 CRYPTO LaMacchia & Odlyzko, Computation of Discrete Logarithms in Prime Fields 1990 10 CRYPTO Even, Systolic Modular Multiplication 1990 10 CRYPTO Rivest, Finding Four Million Large Random Primes 1990 10 CRYPTO Miyaguchi, The FEAL Cipher Family 1990 10 CRYPTO Yacobi, Discrete-log With Compressible Exponents 1989 9 CRYPTO Kahn, Keying the German Navy's Enigma 1989 9 CRYPTO Desmedt, Making Conditionally Secure Cryptosystems Unconditionally Abuse-free in a General Context 1989 9 CRYPTO Damgard, On the Existence of Bit Commitment Schemes and Zero-Knowledge Proofs 1989 9 CRYPTO Brand, Problems with the Normal Use of Cryptography for Providing Security on Unclassified Networks 1989 9 CRYPTO Kohl, The Use of Encryption in Kerberos for Network Authentication 1989 9 CRYPTO Feldmeier & Karn, UNIX Password Security -- Ten Years Later 1989 9 CRYPTO Smith, Practical Problems with a Cryptographic Protection Scheme 1989 9 CRYPTO Barrett & Eisele, The Smart Diskette -- A Universal User Token and Personal Crypto-Engine 1989 9 CRYPTO Chan & Games, On the Quadratic Spans of Periodic Sequences 1989 9 CRYPTO Jansen & Boekee, The Shortest Feedback Shift Register That Can Generate a Given Sequence 1989 9 CRYPTO Maurer & Massey, Perfect Local Randomness in Pseudo-random Sequences 1989 9 CRYPTO Goldreich & Krawczyk, Sparse Pseudorandom Distributions 1989 9 CRYPTO Naor, Bit Commitment Using Pseudo-randomness 1989 9 CRYPTO Krawczyk, How to Predict Congruential Generators 1989 9 CRYPTO Preneel & Bosselaers & Govaerts & Vandewalle, A Chosen Text Attack on the Modified Cryptographic Checksum Algorithm of Cohen and Huang 1989 9 CRYPTO Zeng & Yang & Rao, On the Linear Consistency Test (LCT) in Cryptanalysis with Applications 1989 9 CRYPTO Fiat, Batch RSA 1989 9 CRYPTO Bender & Castagnoli, On the Implementation of Elliptic Curve Crypto Systems 1989 9 CRYPTO Bellare & Goldwasser, New Paradigms for Digital Signatures and Message Authentication Based on Non-interactive Zero Knowledge Proofs 1989 9 CRYPTO Chaum & van Antwerpen, Undeniable Signatures 1989 9 CRYPTO Merkle, A Certified Digital Signature 1989 9 CRYPTO Schnorr, Efficient Identification and Signatures for Smart Cards 1989 9 CRYPTO De Soete & Quisquater & Vedder, A Signature with Shared Verification Scheme 1989 9 CRYPTO Even & Goldreich & Micali, On-line/Off-line Digital Signatures 1989 9 CRYPTO Brickell & Davenport, On the Classification of Ideal Secret Sharing Schemes 1989 9 CRYPTO Laih & Harn & Lee & Hwang, Dynamic Threshold Scheme Based on the Definition of Cross-Product in an N-Dimensional Linear Space 1989 9 CRYPTO Chor & Kushilevitz, Secret Sharing over Infinite Domains 1989 9 CRYPTO Desmedt & Frankel, Threshold Cryptosystems 1989 9 CRYPTO Chick & Tavares, Flexible Access Control with Master Keys 1989 9 CRYPTO Tatebayashi & Matsuzaki & Newman, Key Distribution Protocol for Digital Mobile Communication Systems 1989 9 CRYPTO Buchmann & Williams, A Key Exchange System Based on Real Quadratic Fields 1989 9 CRYPTO Yacobi & Shmuely, On Key Distribution Systems 1989 9 CRYPTO Nelson & Heimann, SDNS Architecture and End-to-end Encryption 1989 9 CRYPTO Brickell, A Survey of Hardware Implementations of RSA 1989 9 CRYPTO Findlay & Johnson, Modular Exponentiation Using Recursive Sums of Residues 1989 9 CRYPTO Morita, A Fast Modular-Multiplication Algorithm Based on a Higher Radix 1989 9 CRYPTO Bos & Coster, Addition Chain Heuristics 1989 9 CRYPTO Quisquater & Delescaille, How Easy Is Collision Search? New Results and Applications to DES 1989 9 CRYPTO Damgard, A Design Principle for Hash Functions 1989 9 CRYPTO Merkle, One Way Hash Functions and DES 1989 9 CRYPTO Magliveras & Memon, Properties of Cryptosystem PGM 1989 9 CRYPTO Zheng & Matsumoto & Imai, On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses 1989 9 CRYPTO Okamoto & Ohta, Disposable Zero-Knowledge Authentications and their Applications to Untraceable Electronic Cash 1989 9 CRYPTO Ben-Or & Goldwasser & Kilian & Wigderson, Efficient Identification Schemes Using Two Prover Interactive Proofs 1989 9 CRYPTO Boyar & Peralta, On the Concrete Complexity of Zero-Knowledge Proofs 1989 9 CRYPTO Feige & Shamir, Zero Knowledge Proofs of Knowledge in Two Rounds 1989 9 CRYPTO Kilian & Micali & Ostrovsky, Minimum Resource Zero-Knowledge Proofs 1989 9 CRYPTO Bellare & Micali, Non-interactive Oblivious Transfer and Applications 1989 9 CRYPTO Beaver, Multiparty Protocols Tolerating Half Faulty Processors 1989 9 CRYPTO Cleve, Controlled Gradual Disclosure Schemes for Random Bits and Their Applications 1989 9 CRYPTO Beaver & Goldwasser, Multiparty Computation with Faulty Majority 1989 9 CRYPTO Chaum, The Spymasters Double-Agent Problem: Multiparty Computations Secure Unconditionally from Minorities and Cryptographically from Majorities 1989 9 CRYPTO Bellare & Cowen & Goldwasser, On the Structure of Secret Key Exchange Protocols 1989 9 CRYPTO Shamir, An Efficient Identification Scheme Based on Permuted Kernels 1989 9 CRYPTO Ostrovsky, An Efficient Software Protection Scheme 1989 9 CRYPTO Adams & Tavares, Good S-Boxes Are Easy To Find 1989 9 CRYPTO White, Covert Distributed Processing with Computer Viruses 1989 9 CRYPTO Price, Progress in Data Security Standardisation 1989 9 CRYPTO Miyaguchi, The FEAL-8 Cryptosystem and a Call for Attack 1989 9 CRYPTO Quisquater & Quisquater & Quisquater & Quisquater & Guillou & Guillou & Guillou & Guillou & Guillou & Guillou & Berson, How To Explain Zero-Knowledge Protocols to Your Children 1988 8 CRYPTO Crepeau & Kilian, Weakening Security Assumptions and Oblivious Transfer 1988 8 CRYPTO Impagliazzo & Rudich, Limits on the Provable Consequences of One-Way Permutations 1988 8 CRYPTO Benaloh & Leichter, Generalized Secret Sharing and Monotone Functions 1988 8 CRYPTO Ben-Or & Goldreich & Goldwasser & Hastad & Kilian & Micali & Rogaway, Everything Provable is Provable in Zero-Knowledge 1988 8 CRYPTO Goldreich & Kushilevitz, A Perfect Zero-Knowledge Proof for a Problem Equivalent to Discrete Logarithm 1988 8 CRYPTO Dwork & Stockmeyer, Zero-Knowledge with Finite State Verifiers 1988 8 CRYPTO Bach, Intractable Problems in Number Theory 1988 8 CRYPTO Koblitz, A Family of Jacobians Suitable for Discrete Log Cryptosystems 1988 8 CRYPTO Girault & Toffin & Vallee, Computation of Approximate L-th Roots Modulo n and Application to Cryptography 1988 8 CRYPTO van Tilburg, On the McEliece Public-Key Cryptosystem 1988 8 CRYPTO Lucks, A Constraint Satisfaction Algorithm for the Automated Decryption of Simple Substitution Ciphers 1988 8 CRYPTO Goldreich & Krawczyk & Luby, On the Existence of Pseudorandom Generators 1988 8 CRYPTO Damgard, On the Randomness of Legendre and Jacobi Sequences 1988 8 CRYPTO Micali & Schnorr, Efficient, Perfect Random Number Generators 1988 8 CRYPTO Bellare & Micali, How to Sign Given Any Trapdoor Function 1988 8 CRYPTO Guillou & Quisquater, A ``Paradoxical'' Identity-Based Signature Scheme Resulting from Zero-Knowledge 1988 8 CRYPTO Ohta & Okamoto, A Modification of the Fiat-Shamir Scheme 1988 8 CRYPTO Micali & Shamir, An Improvement of the Fiat-Shamir Identification and Signature Scheme 1988 8 CRYPTO Rackoff, A Basic Theory of Public and Private Cryptosystems 1988 8 CRYPTO Blum & Feldman & Micali, Proving Security Against Chosen Cyphertext Attacks 1988 8 CRYPTO De Santis & Micali & Persiano, Non-Interactive Zero-Knowledge with Preprocessing 1988 8 CRYPTO Feige & Shamir & Tennenholtz, The Noisy Oracle Problem 1988 8 CRYPTO Abadi & Allender & Broder & Feigenbaum & Hemachandra, On Generating Solved Instances of Computational Problems 1988 8 CRYPTO De Soete, Bounds and Constructions for Authentication-Secrecy Codes with Splitting 1988 8 CRYPTO Chaum & Fiat & Naor, Untraceable Electronic Cash 1988 8 CRYPTO Damgard, Payment Systems and Credential Mechanisms with Provable Security Against Abuse by Individuals 1988 8 CRYPTO Huang & Teng, A Universal Problem in Secure and Verifiable Distributed Computation 1988 8 CRYPTO Adleman, An Abstract Theory of Computer Viruses 1988 8 CRYPTO Desmedt, Abuses in Cryptography and How to Fight Them 1988 8 CRYPTO Simmons, How to (Really) Share a Secret 1988 8 CRYPTO Forre, The Strict Avalanche Criterion: Spectral Properties of Boolean Functions and an Extended Definition 1988 8 CRYPTO Zeng & Huang, On the Linear Syndrome Method in Cryptanalysis 1988 8 CRYPTO Kwok & Beale, Aperiodic Linear Complexities of De Bruijn Sequences 1988 8 CRYPTO Sherwood & Gallo, The Application of Smart Cards for RSA Digital Signatures in a Network Comprising both Interactive and Store-and-Forward Facilities 1988 8 CRYPTO Matsumoto & Kato & Imai, Speeding Up Secret Computations with Insecure Auxiliary Devices 1988 8 CRYPTO Herbison, Developing Ethernet Enhanced-Security System 1988 8 CRYPTO Steer & Strawczynski & Diffie & Wiener, A Secure Audio Teleconference System 1988 8 CRYPTO den Boer, Diffie-Hellman is as Strong as Discrete Log for Certain Primes 1988 8 CRYPTO Hwang & Rao, Secret Error-Correcting Codes 1988 8 CRYPTO Brickell & Stinson, The Detection of Cheaters in Threshold Schemes 1988 8 CRYPTO Kurtz & Mahaney & Royer, On the Power of 1-way Functions 1988 8 CRYPTO Brassard & Damgard, ``Practical IP'' subseteq MA 1988 8 CRYPTO Brandt & Damgard & Landrock & Pederson, Zero-Knowledge Authentication Scheme with Secret Key Exchange 1987 7 CRYPTO Price, Standards for Data Security--A Change of Direction 1987 7 CRYPTO Presttun, Integrating Cryptography in ISDN 1987 7 CRYPTO Desmedt & Goutier & Bengio, Special Uses and Abuses of the Fiat-Shamir Passport Protocol (Extended Abstract) 1987 7 CRYPTO Impagliazzo & Yung, Direct Minimum-Knowledge Computations (Extended Abstract) 1987 7 CRYPTO De Santis & Micali & Persiano, Non-interactive Zero-Knowledge Proof Systems 1987 7 CRYPTO Goldreich & Vainish, How to Solve Any Protocol Problem--An Efficiency Improvement 1987 7 CRYPTO Chaum & Damgard & van de Graaf, Multiparty Computations Ensuring Privacy of Each Party's Input and Correctness of the Result 1987 7 CRYPTO Desmedt, Society and Group Oriented Cryptography: A New Concept 1987 7 CRYPTO van de Graaf & Peralta, A Simple and Secure Way to Show the Validity of Your Public Key 1987 7 CRYPTO Galil & Haber & Yung, Cryptographic Computation: Secure Fault-tolerant Protocols and the Public-Key Model (Extended Abstract) 1987 7 CRYPTO Brickell & Chaum & Damgard & van de Graaf, Gradual and Verifiable Release of a Secret (Extended Abstract) 1987 7 CRYPTO Moore, Strong Practical Protocols 1987 7 CRYPTO Koyama & Ohta, Identity-based Conference Key Distribution Systems 1987 7 CRYPTO Matsumoto & Imai, On the Key Predistribution System: A Practical Solution to the Key Distribution Problem 1987 7 CRYPTO Okamoto, Key Distribution Systems Based on Identification Information 1987 7 CRYPTO Quisquater, Secret Distribution of Keys for Public-Key Systems (Extended Abstract) 1987 7 CRYPTO Simmons, An Impersonation-proof Identity Verification Scheme 1987 7 CRYPTO Davida & Matt, Arbitration in Tamper Proof Systems (If DES approx= RSA then What's the Difference between True Signature and Arbitrated Signature Schemes?) 1987 7 CRYPTO Guillou & Quisquater, Efficient Digital Public-Key Signatures with Shadow (Abstract) 1987 7 CRYPTO Adams & Meijer, Security-related Comments Regarding McEliece's Public-Key Cryptosystem 1987 7 CRYPTO DeLaurentis, Components and Cycles of a Random Function 1987 7 CRYPTO Feldman, Fast Spectral Tests for Measuring Nonrandomness and the DES 1987 7 CRYPTO Quisquater & Delescaille, Other Cycling Tests for DES (Abstract) 1987 7 CRYPTO Davida & Dancs, A Crypto-Engine 1987 7 CRYPTO Simmons, A Natural Taxonomy for Digital Information Authentication Schemes 1987 7 CRYPTO Kemmerer, Analyzing Encryption Protocols Using Formal Verification Techniques (Extended Abstract) 1987 7 CRYPTO Blakley & Rundell, Cryptosystems Based on an Analog of Heat Flow 1987 7 CRYPTO Stinson & Vanstone, A Combinatorial Approach to Threshold Schemes 1987 7 CRYPTO Tanaka, A Realization Scheme for the Identity-based Cryptosystems 1987 7 CRYPTO Crepeau, Equivalence between Two Flavours of Oblivious Transfers 1987 7 CRYPTO Stinson, A Construction for Authentication/Secrecy Codes from Certain Combinatorial Designs 1987 7 CRYPTO Merkle, A Digital Signature Based on a Conventional Encryption Function 1987 7 CRYPTO Herlihy & Tygar, How to Make Replicated Data Secure 1987 7 CRYPTO Luby & Rackoff, A Study of Password Security 1987 7 CRYPTO Matias & Shamir, A Video Scrambling Technique Based on Space Filling Curves (Extended Abstract) 1987 7 CRYPTO Brickell & Lee & Yacobi, Secure Audio Teleconference 1987 7 CRYPTO Yacobi, Attack on the Koyama-Ohta Identity Based Key Distribution Scheme 1987 7 CRYPTO Fumy, On the F-Function of FEAL 1987 7 CRYPTO Zeng & Yang & Dai, Patterns of Entropy Drop of the Key in an S-Box of the DES (Extended Abstract) 1987 7 CRYPTO Struik & van Tilburg, The Rao-Nam Scheme is Insecure Against a Chosen-Plaintext Attack 1987 7 CRYPTO Rao, On Struik-Tilburg Cryptanalysis of Rao-Nam Scheme 1987 7 CRYPTO Beauchemin & Brassard, A Generalization of Hellman's Extension of Shannon's Approach to Cryptography (Abstract) 1987 7 CRYPTO Chaum & Crepeau & Damgard, Multiparty Unconditionally Secure Protocols (Abstract) 1986 6 CRYPTO Brickell & Moore & Purtill, Structure in the S-Boxes of the DES (Extended Abstract) 1986 6 CRYPTO Moore & Simmons, Cycle Structure of the DES with Weak and Semi-Weak Keys 1986 6 CRYPTO Rao & Nam, Private-Key Algebraic-Coded Cryptosystems 1986 6 CRYPTO de Jonge & Chaum, Some Variations on RSA Signatures and their Security 1986 6 CRYPTO James & Lidl & Niederreiter, Breaking the Cade Cipher 1986 6 CRYPTO Cade, A Modification of a Broken Public-Key Cipher 1986 6 CRYPTO Kaliski, A Pseudo-Random Bit Generator Based on Elliptic Logarithms 1986 6 CRYPTO Goldreich, Two Remarks Concerning the Goldwasser-Micali-Rivest Signature Scheme 1986 6 CRYPTO Desmedt & Quisquater, Public-Key Systems Based on the Difficulty of Tampering (Is There a Difference between DES and RSA?) (Extended Abstract) 1986 6 CRYPTO Chaum & Evertse, A Secure and Privacy-Protecting Protocol for Transmitting Personal Information between Organizations 1986 6 CRYPTO Goldreich & Micali & Wigderson, How to Prove All NP-Statements in Zero-Knowledge, and a Methodology of Cryptographic Protocol Design (Extended Abstract) 1986 6 CRYPTO Fiat & Shamir, How to Prove Yourself: Practical Solutions to Identification and Signature Problems 1986 6 CRYPTO Chaum, Demonstrating that a Public Predicate can be Satisfied without Revealing any Information about How 1986 6 CRYPTO Chaum & Evertse & van de Graaf & Peralta, Demonstrating Possession of a Discrete Logarithm without Revealing it 1986 6 CRYPTO Cohen Benaloh, Cryptographic Capsules: A Disjunctive Primitive for Interactive Protocols 1986 6 CRYPTO Brassard & Crepeau, Zero-Knowledge Simulation of Boolean Circuits 1986 6 CRYPTO Brassard & Crepeau & Robert, All-or-Nothing Disclosure of Secrets 1986 6 CRYPTO Crepeau, A Zero-Knowledge Poker Protocol that Achieves Confidentiality of the Players' Strategy or How to Achieve an Electronic Poker Face 1986 6 CRYPTO Cohen Benaloh, Secret Sharing Homomorphisms: Keeping Shares of a Secret Secret (Extended Abstract) 1986 6 CRYPTO Tompa & Woll, How to Share a Secret with Cheaters 1986 6 CRYPTO Blakley & Dixon, Smallest Possible Message Expansion in Threshold Schemes 1986 6 CRYPTO Orton & Roy & Scott & Peppard & Tavares, VLSI Implementation of Public-Key Encryption Algorithms 1986 6 CRYPTO Beth & Cook & Gollmann, Architectures for Exponentiation in GF(2^n) 1986 6 CRYPTO Barrett, Implementing the Rivest Shamir and Adleman Public Key Encryption Algorithm on a Standard Digital Signal Processor 1986 6 CRYPTO Jueneman, A High Speed Manipulation Detection Code 1986 6 CRYPTO Gyoery & Seberry, Electronic Funds Transfer Point of Sale in Australia 1986 6 CRYPTO Micali & Rackoff & Sloan, The Notion of Security for Probabilistic Cryptosystems (Extended Abstract) 1986 6 CRYPTO Wagner & Putter & Cain, Large-scale Randomization Techniques 1986 6 CRYPTO Chan & Games, On the Linear Span of Binary Sequences Obtained from Finite Geometries 1986 6 CRYPTO Stinson, Some Constructions and Bounds for Authentication Codes 1986 6 CRYPTO Goldreich, Towards a Theory of Software Protection (Extended Abstract) 1986 6 CRYPTO Beauchemin & Brassard & Crepeau & Goutier, Two Observations on Probabilistic Primality Testing 1986 6 CRYPTO Matyas, Public-Key Registration 1986 6 CRYPTO Desmedt, Is there an Ultimate Use of Cryptography? (Extended Abstract) 1986 6 CRYPTO Guillou & Ugon, Smart Card, a Highly Reliable and Portable Security Device 1986 6 CRYPTO Rankine, THOMAS--A Complete Single Chip RSA Device 1985 5 CRYPTO Estes & Adleman & Kompella & McCurley & Miller, Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number Fields 1985 5 CRYPTO Coppersmith, Another Birthday Attack 1985 5 CRYPTO de Jonge & Chaum, Attacks on Some RSA Signatures 1985 5 CRYPTO Brickell & DeLaurentis, An Attack on a Signature Scheme Proposed by Okamoto and Shiraishi 1985 5 CRYPTO Simmons, A Secure Subliminal Channel (?) 1985 5 CRYPTO Desmedt, Unconditionally Secure Authentication Schemes and Practical and Theoretical Consequences 1985 5 CRYPTO Even & Goldreich & Shamir, On the Security of Ping-Pong Protocols When Implemented Using the RSA 1985 5 CRYPTO Crepeau, A Secure Poker Protocol that Minimizes the Effect of Player Coalitions 1985 5 CRYPTO Berger & Kannan & Peralta, A Framework for the Study of Cryptographic Protocols 1985 5 CRYPTO Coppersmith, Cheating at Mental Poker 1985 5 CRYPTO Diffie, Security for the DoD Transmission Control Protocol 1985 5 CRYPTO Galil & Haber & Yung, Symmetric Public-Key Encryption 1985 5 CRYPTO Gosler, Software Protection: Myth or Reality? 1985 5 CRYPTO Herzberg & Pinter, Public Protection of Software 1985 5 CRYPTO Blakley & Meadows & Purdy, Fingerprinting Long Forgiving Messages 1985 5 CRYPTO Chaum & Evertse, Cryptanalysis of DES with a Reduced Number of Rounds 1985 5 CRYPTO Kaliski & Rivest & Sherman, Is DES a Pure Cipher? (Results of More Cycling Experiments on DES) 1985 5 CRYPTO Moore & Tavares, A Layered Approach to the Design of Private Key Cryptosystems 1985 5 CRYPTO Okamoto & Nakamura, Lifetimes of Keys in Cryptographic Key Management Systems 1985 5 CRYPTO Rueppel, Correlation Immunity and the Summation Generator 1985 5 CRYPTO Siegenthaler, Design of Combiners to Prevent Divide and Conquer Attacks 1985 5 CRYPTO Shamir, On the Security of DES 1985 5 CRYPTO Blakley, Information Theory Without the Finiteness Assumption, II: Unfolding the DES 1985 5 CRYPTO Fell & Diffie, Analysis of a Public Key Approach Based on Polynomial Substitution 1985 5 CRYPTO Kochanski, Developing an RSA Chip 1985 5 CRYPTO Williams, An M^3 Public-Key Encryption Scheme 1985 5 CRYPTO Varadharajan, Trapdoor Rings and Their Use in Cryptography 1985 5 CRYPTO El Gamal, On Computing Logarithms Over Finite Fields 1985 5 CRYPTO Hastad, On Using RSA with Low Exponent in a Public Key Network 1985 5 CRYPTO Stephens, Lenstra's Factorisation Method Based on Elliptic Curves 1985 5 CRYPTO Miller, Use of Elliptic Curves in Cryptography 1985 5 CRYPTO Wolfram, Cryptography with Cellular Automata 1985 5 CRYPTO Reif & Tygar, Efficient Parallel Pseudo-Random Number Generation 1985 5 CRYPTO Luby & Rackoff, How to Construct Pseudo-random Permutations from Pseudo-random Functions 1985 5 CRYPTO Chor & Goldreich & Goldwasser, The Bit Security of Modular Squaring Given Partial Factorization of the Modulus 1985 5 CRYPTO Godlewski & Cohen, Some Cryptographic Aspects of Womcodes 1985 5 CRYPTO Bennett & Brassard & Robert, How to Reduce Your Enemy's Information 1985 5 CRYPTO Feigenbaum, Encrypting Problem Instances: Or...Can You Take Advantage of Someone Without Having to Trust Him? 1985 5 CRYPTO van Tilburg & Boekee, Divergence Bounds on Key Equivocation and Error Probability in Cryptanalysis 1985 5 CRYPTO Desmedt & Odlyzko, A Chosen Text Attack on the RSA Cryptosystem and Some Discrete Logarithm Schemes 1985 5 CRYPTO Webster & Tavares, On the Design of S-boxes 1985 5 CRYPTO Coppersmith, The Real Reason for Rivest's Phenomenon 1985 5 CRYPTO Quisquater & Desmedt & Davio, The Importance of ``Good'' Key Scheduling Schemes (How to Make a Secure DES Scheme with <= 48 Bit Keys?) 1985 5 CRYPTO Haemers, Access Control at the Netherlands Postal and Telecommunications Services 1984 4 CRYPTO Serpell & Brookson & Clark, A Prototype Encryption System Using Public Key 1984 4 CRYPTO El Gamal, A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms 1984 4 CRYPTO Wagner & Magyarik, A Public Key Cryptosystem Based on the Word Problem 1984 4 CRYPTO Ong & Schnorr & Shamir, Efficient Signature Schemes Based on Polynomial Equations 1984 4 CRYPTO Shamir, Identity-Based Cryptosystems and Signature Schemes 1984 4 CRYPTO Chor & Rivest, A Knapsack Type Public Key Cryptosystem Based on Arithmetic in Finite Fields 1984 4 CRYPTO Williams, Some Public Key Crypto-Functions as Intractable as Factorization 1984 4 CRYPTO Blake & Mullin & Vanstone, Computing Logarithms in GF(2^n) 1984 4 CRYPTO Kaliski, Wyner's Analog Encryption Scheme: Results of a Simulation 1984 4 CRYPTO Chen, On Rotation Group and Encryption of Analog Signals 1984 4 CRYPTO Leighton & Matyas, The History of Book Ciphers 1984 4 CRYPTO Davis & Holdridge, An Update on Factorization at Sandia National Laboratories 1984 4 CRYPTO Fairfield & Matusevich & Plany, An LSI Digital Encryption Processor (DEP) 1984 4 CRYPTO Davio & Desmedt & Goubert & Hoornaert & Quisquater, Efficient Hardware and Software Implementations for the DES 1984 4 CRYPTO Hoornaert & Goubert & Desmedt, Efficient Hardware Implementation of the DES 1984 4 CRYPTO Proctor, A Self-Synchronizing Cascaded Cipher System with Dynamic Control of Error Propagation 1984 4 CRYPTO Vazirani & Vazirani, Efficient and Secure Pseudo-Random Number Generation 1984 4 CRYPTO Fairfield & Mortenson & Coulthart, An LSI Random Number Generator (RNG) 1984 4 CRYPTO Kothari, Generalized Linear Threshold Scheme 1984 4 CRYPTO Blakley & Meadows, Security of Ramp Schemes 1984 4 CRYPTO Akl & Meijer, A Fast Pseudo Random Permutation Generator with Applications to Cryptology 1984 4 CRYPTO Goldreich & Goldwasser & Micali, On the Cryptographic Applications of Random Functions 1984 4 CRYPTO Blum & Goldwasser, An Efficient Probabilistic Public Key Encryption Scheme which Hides All Partial Information 1984 4 CRYPTO Chor & Goldreich, RSA/Rabin Least Significant Bits are 1/2 + 1/poly(log N) Secure 1984 4 CRYPTO Blakley, Information Theory without the Finiteness Assumption, I: Cryptosystems as Group-Theoretic Objects 1984 4 CRYPTO Konheim, Cryptanalysis of ADFGVX Encipherment Systems 1984 4 CRYPTO Brickell, Breaking Iterated Knapsacks 1984 4 CRYPTO Desmedt & Quisquater & Davio, Dependence of Output on Input in DES: Small Avalanche Characteristics 1984 4 CRYPTO Reeds & Manferdelli, DES Has No Per Round Linear Factors 1984 4 CRYPTO Davies, A Message Authenticator Algorithm Suitable for a Mainframe Computer 1984 4 CRYPTO Beker & Walker, Key Management for Secure Electronic Funds Transfer in a Retail Environment 1984 4 CRYPTO Simmons, Authentication Theory/Coding Theory 1984 4 CRYPTO Chaum, New Secret Codes Can Prevent a Computerized Big Brother 1984 4 CRYPTO Tedrick, Fair Exchange of Secrets 1984 4 CRYPTO Yung, Cryptoprotocols: Subscription to a Public Key, the Secret Blocking and the Multi-Player Mental Poker Game 1984 4 CRYPTO Fortune & Merritt, Poker Protocols 1984 4 CRYPTO Goldwasser & Micali & Rivest, A `Paradoxical' Solution to the Signature Problem 1984 4 CRYPTO Leung & Tavares, Sequence Complexity as a Test for Cryptographic Systems 1984 4 CRYPTO Bennett & Brassard, An Update on Quantum Cryptography 1984 4 CRYPTO Chaum, How to Keep a Secret Alive: Extensible Partial Key, Key Safeguarding, and Threshold Systems 1983 3 CRYPTO Lagarias, Knapsack Public Key Cryptosystems and Diophantine Approximation (Extended Abstract) 1983 3 CRYPTO Brickell, Solving Low Density Knapsacks 1983 3 CRYPTO Brickell & Lagarias & Odlyzko, Evaluation of the Adleman Attack on Multiply Iterated Knapsack Cryptosystems (Abstract) 1983 3 CRYPTO Even & Goldreich, On the Power of Cascade Ciphers (Extended Abstract) 1983 3 CRYPTO Simmons, The Prisoners' Problem and the Subliminal Channel 1983 3 CRYPTO Williams, An Overview of Factoring 1983 3 CRYPTO Pomerance & Smith & Wagstaff, New Ideas for Factoring Large Integers 1983 3 CRYPTO Wunderlich, Factoring Numbers on the Massively Parallel Computer 1983 3 CRYPTO Davis & Holdridge, Factorization Using the Quadratic Sieve Algorithm 1983 3 CRYPTO Ong & Schnorr, Signatures through Approximate Representations by Quadratic Forms (Extended Abstract) 1983 3 CRYPTO Goldreich, A Simple Protocol for Signing Contracts 1983 3 CRYPTO Blum & Vazirani & Vazirani, Reducibility among Protocols (Extended Abstract) 1983 3 CRYPTO Tedrick, How to Exchange Half a Bit 1983 3 CRYPTO Chaum, Blind Signature System (Abstract) 1983 3 CRYPTO Spencer & Tavares, A Layered Broadcast Cryptographic System 1983 3 CRYPTO Davio & Desmedt & Fosseprez & Govaerts & Hulsbosch & Neutjens & Piret & Quisquater & Vandewalle & Wouters, Analytical Characteristics of the DES 1983 3 CRYPTO Winternitz, Producing a One-Way Hash Function from DES 1983 3 CRYPTO Akl, On the Security of Compressed Encodings 1983 3 CRYPTO Denning, Field Encryption and Authentication 1983 3 CRYPTO Reeds & Sloane, Shift-Register Synthesis (Modulo m) (Abstract) 1983 3 CRYPTO Sachs & Berkovits, Probabilistic Analysis and Performance Modelling of the `Swedish' Algorithm and Modifications 1983 3 CRYPTO El Gamal, A Subexponential-Time Algorithm for Computing Discrete Logarithms over GF(p^2) 1983 3 CRYPTO Lidl & Muller, Permutation Polynomials in RSA-Cryptosystems 1983 3 CRYPTO Jurgensen & Matthews, Some Results on the Information Theoretic Analysis of Cryptosystems 1983 3 CRYPTO Fam, Improving the Security of Exponential Key Exchange 1983 3 CRYPTO Vazirani & Vazirani, RSA Bits Are 732 + epsilon Secure (Preliminary Abstract) 1983 3 CRYPTO Davies, Use of the `Signature Token' to Create a Negotiable Document 1983 3 CRYPTO Even & Goldreich, Electronic Wallet 1983 3 CRYPTO Chaum, Design Concepts for Tamper Responding Systems 1982 2 CRYPTO Hellman & Reyneri, Fast Computation of Discrete Logarithms in GF(q) 1982 2 CRYPTO Brickell & Moore, Some Remarks on the Herlestam-Johannesson Algorithm for Computing Logarithms over GF(2^p) 1982 2 CRYPTO Janardan & Lakshmanan, A Public-Key Cryptosystem Based on the Matrix Cover NP-Completeness Problem 1982 2 CRYPTO Blakley & Swanson, Infinite Structures in Information Theory 1982 2 CRYPTO Brickell, A Fast Modular Multiplication Algorithm with Applications to Two Key Cryptography 1982 2 CRYPTO Blum & Blum & Shub, Comparison of Two Pseudo-Random Number Generators 1982 2 CRYPTO Brassard, On Computationally Secure Authentication Tags Requiring Short Secret Shared Keys 1982 2 CRYPTO Davies, Some Regular Properties of the `Data Encryption Standard' Algorithm 1982 2 CRYPTO Davies & Parkin, The Average Cycle Size of the Key Stream in Output Feedback Encipherment (Abstract) 1982 2 CRYPTO Jueneman, Analysis of Certain Aspects of Output Feedback Mode 1982 2 CRYPTO Hellman & Reyneri, Drainage and the DES 1982 2 CRYPTO Winternitz, Security of a Keystream Cipher with Secret Initial Value (Abstract) 1982 2 CRYPTO Avis & Tavares, Using Data Uncertainty to Increase the Crypto-Complexity of Simple Private Key Enciphering Schemes 1982 2 CRYPTO Rivest & Sherman, Randomized Encryption Techniques 1982 2 CRYPTO Dolev & Wigderson, On the Security of Multi-Party Protocols in Distributed Systems 1982 2 CRYPTO Dolev & Even & Karp, On the Security of Ping-Pong Protocols (Extended Abstract) 1982 2 CRYPTO Longpre, The Use of Public-Key Cryptography for Signing Checks 1982 2 CRYPTO Chaum, Blind Signatures for Untraceable Payments 1982 2 CRYPTO Even & Goldreich & Lempel, A Randomized Protocol for Signing Contracts (Extended Abstract) 1982 2 CRYPTO Goldwasser & Micali & Yao, On Signatures and Authentication 1982 2 CRYPTO Mueller-Schloer & Wagner, Cryptographic Protection of Personal Data Cards 1982 2 CRYPTO Blom, Non-Public Key Distribution 1982 2 CRYPTO Akl & Taylor, Cryptographic Solution to a Multilevel Security Problem 1982 2 CRYPTO Berson, Local Network Cryptosystem Architecture: Access Control 1982 2 CRYPTO Adleman, Implementing an Electronic Notary Public 1982 2 CRYPTO Bennett & Brassard & Breidbart & Wiesner, Quantum Cryptography, or Unforgeable Subway Tokens 1982 2 CRYPTO Shamir, A Polynomial Time Algorithm for Breaking the Basic Merkle-Hellman Cryptosystem (Extended Abstract) 1982 2 CRYPTO Brickell & Davis & Simmons, A Preliminary Report on the Cryptanalysis of Merkle-Hellman Knapsack Cryptosystems 1982 2 CRYPTO Adleman, On Breaking the Iterated Merkle-Hellman Public-Key Cryptosystem 1982 2 CRYPTO Berson, Long Key Variants of DES 1982 2 CRYPTO Even & Goldreich, On the Security of Multi-Party Ping-Pong Protocols (Abstract) 1982 2 CRYPTO Plumstead, Inferring a Sequence Produced by a Linear Congruence (Abstract) 1982 2 CRYPTO Merritt, Key Reconstruction (Abstract) 1982 2 CRYPTO Nicolai, Nondeterministic Cryptography 1982 2 CRYPTO Rivest, A Short Report on the RSA Chip 1997 21 CRYPTOLOGIA Chang & Jan & Kowng, A Digital Signature Scheme Based Upon the Theory of Quadratic Residues 1997 21 CRYPTOLOGIA Sassoon, British Company Makes PGP Easier to Use 1996 20 CRYPTOLOGIA Rubin, One-Time Pad Cryptography 1996 20 CRYPTOLOGIA Rubin, Designing a High-Security Cipher 1996 20 CRYPTOLOGIA Heys & Tavares, Cryptanalysis of Substitution-Permutation Networks Using Key-Dependent Degeneracy 1996 20 CRYPTOLOGIA Schaefer, A Simplified Data Encryption Standard Algorithm 1996 20 CRYPTOLOGIA Clark & Dawson & Bergen, Combinatorial Optimization and the Knapsack Cipher 1995 19 CRYPTOLOGIA Johnson, Cryptology in Cyberspace 1995 19 CRYPTOLOGIA Rubin, Message Authentication Using Quadratic Residues 1995 19 CRYPTOLOGIA Rubin, The Quadratic and Double Quadratic Residue Ciphers 1995 19 CRYPTOLOGIA Wayner, Strong Theoretical Stegnography 1995 19 CRYPTOLOGIA Liaw & Lei, An Efficient Password Authentication Scheme Based on a Unit Circle 1995 19 CRYPTOLOGIA Miller, The Cryptographic Mathematics of Enigma 1994 18 CRYPTOLOGIA King, An Algorithm for the Complete Automated Cryptanalysis of Periodic Polyalphabetic Substitution Ciphers 1994 18 CRYPTOLOGIA Li & Hwang & Lee, Conspiracy Attacks on the Threshold RSA Signature Scheme 1994 18 CRYPTOLOGIA Rubin, Comments on ``Cryptanalysis of Knapsack Ciphers Using Genetic Algorithms'' 1994 18 CRYPTOLOGIA Ritter, Estimating Population from Repetitions in Accumulated Random Samples 1993 17 CRYPTOLOGIA Ganesan & Sherman, Statistical Techniques for Language Recognition: An Introduction and Guide for Cryptanalysts 1993 17 CRYPTOLOGIA Ruland, Realizing Digital Signatures with One-Way Hash Functions 1993 17 CRYPTOLOGIA Mitchell, A Nonlinear Random Number Generator with Known, Long Cycle Length 1993 17 CRYPTOLOGIA O'Connor, The Inclusion-Exclusion Principle and its Applications to Cryptography 1992 16 CRYPTOLOGIA Wayner, Mimic Functions 1992 16 CRYPTOLOGIA King & Bahler, An Implementation of Probabilistic Relaxation in the Cryptanalysis of Simple Substitution Ciphers 1992 16 CRYPTOLOGIA Shirriff & Welch & Kinsman, Decoding a VCR Controller Code 1992 16 CRYPTOLOGIA Kruh, review of Simmons, Contemporary Cryptology (IEEE Press, 1992) 1992 16 CRYPTOLOGIA Mitchell, ``Rubik's Cube'' as a Transposition Device 1992 16 CRYPTOLOGIA Webb, A Public-Key Cryptosystem Based on Complementing Sets 1992 16 CRYPTOLOGIA Carroll & Verhagen & Wong, Chaos in Cryptography: The Escape from the Strange Attractor 1991 15 CRYPTOLOGIA Ritter, The Efficient Generation of Cryptographic Confusion Sequences 1991 15 CRYPTOLOGIA Wheeler & Matthews, Supercomputer Investigations of a Chaotic Encryption Algorithm 1991 15 CRYPTOLOGIA Ritter, Transpositioin Cipher with Pseudo-random Shuffling: The Dynamic Transposition Combiner 1990 14 CRYPTOLOGIA Ritter, Substitution Cipher with Pseudo-Random Shuffling: The Dynamic Substitution Combiner 1989 13 CRYPTOLOGIA Guillou & Davio & Quisquater, Public-Key Techniques: Randomness and Redundancy 1989 13 CRYPTOLOGIA Matthews, On the Derivation of a ``Chaotic'' Encryption Algorithm 1989 13 CRYPTOLOGIA Kak, A New Method for Coin Flipping by Telephone 1988 12 CRYPTOLOGIA Kurosawa & Ito & Takeuchi, Public Key Cryptosystem Using a Reciprocal Number with Same Intractability as Factoring a Large Number 1988 12 CRYPTOLOGIA Jamnig, Securing the RSA-Cryptosystem Against Cycling Attacks 1987 11 CRYPTOLOGIA Bennett, Analysis of the Encryption Algorithm Used in the WordPerfect Word Processing Program 1987 11 CRYPTOLOGIA Rubin, Foiling an Exhaustive Key-Search Attack 1987 11 CRYPTOLOGIA Deavours, Cryptology Courses at Kean College 1995 2 CSAE Rice, Computational Science and the Future of Computing Research 1995 2 CSAE Sullivan, Who Needs Efficient Algorithms? 1995 9 CSL Baaz & Leitsch & Zach, Incompleteness of a First-Order Godel Logic and Some Temporal Logics of Programs 1995 9 CSL Brown & Wallen, Representing Unification in a Logical Framework 1995 9 CSL Caferra & Peltier, Decision Procedures Using Model Building Techniques 1995 9 CSL Clote, A Note on the Relation Between Polynomial Time Functionals and Constable's Class K 1995 9 CSL Dawar & Lindell & Weinstein, First Order Logic, Fixed Point Logic and Linear Order 1995 9 CSL Degtyarev & Voronkov, Simultaneous Rigid E-Unification Is Undecidable 1995 9 CSL Grumbach & Lacroix & Lindell, Generalized Implicit Definitions on Finite Structures 1995 9 CSL Johannsen, On Sharply Bounded Length Induction 1995 9 CSL Kummer & Ott, Effective Strategies for Enumeration Games 1994 8 CSL Pudlak & Buss, How to Lie without Being (easily) Convicted and the Lengths of Proofs in Propositional Calculus 1994 8 CSL Grandjean & Olive, Monadic Logical Definability of NP-Complete Problems 1994 8 CSL Lautemann & Schwentick & Therien, Logics For Context-Free Languages 1994 8 CSL Malmstrom, Log-Approximable Minimization Problems on Random Inputs 1994 8 CSL Stolboushkin & Taitslin, Is First Order Contained in an Initial Segment of PTIME? 1994 8 CSL Schulz, On Existential Theories of List Concatenation 1994 8 CSL Leivant & Marion, Ramified Recurrence and Computational Complexity II: Substitution and Poly-space 1993 7 CSL Aiken & Kozen & Vardi & Wimmers, The Complexity of Set Constraints 1993 7 CSL Ambler & Kwiatkowska & Measor, On Duality for the Modal mu-calculus 1993 7 CSL Baaz & Zach, Short Proofs of Tautologies Using the Schema of Equivalence 1993 7 CSL Bergstra & Bethke & Ponse, Process Algebra with Combinators 1993 7 CSL Blass, Is Game Semantics Necessary? 1993 7 CSL Compton & Uceda-Sosa, The Model Theory of Concurrency 1993 7 CSL Coquand, From Semantics to Rules: a Machine Assisted Analysis 1993 7 CSL Goerdt & Kamps, On the Reasons for Average Superlinear Speedup in Parallel Backtrack Search 1993 7 CSL Gomolko, Negation as Inconsistency in PROLOG via Intuitionistic Logic 1993 7 CSL Gradel & Malmstrom, Approximable Minimisation Problems and Optimal Solutions on Random Inputs 1993 7 CSL Grohe, Bounded-arity Hierarchies in Fixed-point Logics 1993 7 CSL Hirshfeld, Petri Nets and the Equivalence Problem 1993 7 CSL Kozen, Logical Aspects of Set Constraints 1993 7 CSL Makowsky & Pnueli, Oracles and Quantifiers 1993 7 CSL Marcinkowski, A Horn Clause that Implies an Undecidable Set of Horn Clauses 1993 7 CSL Milner, Higher-order Action Calculi 1993 7 CSL Ong & Ritter, A Generic Strong Normalisation Argument: Application to the Calculus of Constructions 1993 7 CSL Raffalli, Data Types, Infinity and Equality in System AF_2 1993 7 CSL Ritter, Normalisation for Typed Lambda Calculi with Explicit Substitution 1993 7 CSL Sieg & Wainer, Program Transformation and Proof Transformation 1993 7 CSL Stewart, Incorporating Generalised Quantifiers and the Least Fixed Point Operator 1993 7 CSL Gurevich & Huggins, Errata to ``The Semantics of the C Programming Language'' 1992 6 CSL Aanderaa, A Universal Turing Machine 1992 6 CSL Aanderaa & Jervell, Recursive Inseparability in Linear Logic 1992 6 CSL Artemov & Strassen, The Basic Logic of Proofs 1992 6 CSL Baaz & Zach, Algorithmic Structuring of Cut-Free Proofs 1992 6 CSL Behrendt & Compton & Gradel, Optimization Problems: Expressibility, Approximation Properties and Expected Asymptotic Growth of Optimal Solutions 1992 6 CSL Benton & Bierman & de Paiva & Hyland, Linear lambda-Calculus and Categorical Models Revisited 1992 6 CSL Berarducci & Bohm, A Self-Interpreter of Lambda Calculus Having a Normal Form 1992 6 CSL Bosse, An ``Ehrenfeucht-Fraisse Game'' for Fixpoint Logic and Stratified Fixpoint Logic 1992 6 CSL Creignou, The Class of Problems that Are Linearly Equivalent to Satisfiability, or a Uniform Method for Proving NP-Completeness 1992 6 CSL Fermuller & Leitsch, Model Building by Resolution 1992 6 CSL Fernando, Comparative Transition System Semantics 1992 6 CSL Gavilanes-Franco & Lucio-Carrasco & Rodriguez-Artalejo, Reasoning with Higher Order Partial Functions 1992 6 CSL Glavan & Rosenzweig, Communicating Evolving Algebras 1992 6 CSL Gonzalez-Moreno & Hortala-Gonzalez & Rodriguez-Artalejo, On the Completeness of Narrowing as the Operational Semantics of Functional Logic Programming 1992 6 CSL Gradel & Otto, Inductive Definability with Counting on Finite Structures 1992 6 CSL Grandjean, Linear Time Algorithms and NP-Complete Problems 1992 6 CSL Gurevich & Huggins, The Semantics of the C Programming Language 1992 6 CSL Honsell & Mason & Smith & Talcott, A Theory of Classes for a Functional Language with Effects 1992 6 CSL Lautemann, Logical Definability of NP-Optimization Problems with Monadic Auxiliary Predicates 1992 6 CSL Marzetta, Universes in the Theories of Types and Names 1992 6 CSL Mitchell & Scedrov, Notes on Sconing and Relators 1992 6 CSL Schiermeyer, Solving 3-Satisfiability in Less than 1,579^n Steps 1992 6 CSL Smith, Kleene's Slash and Existence of Values of Open Terms in Type Theory 1992 6 CSL Stark, Negation-Complete Logic Programs 1992 6 CSL Stewart, Logical Characterizations of Bounded Query Classes II: Polynomial-Time Oracle Machines 1992 6 CSL Tyszkiewicz, On Asymptotic Probabilities of Monadic Second Order Properties 1991 5 CSL Bargury & Makowsky, The Expressive Power of Transitive Closure and 2-way Multihead Automata 1991 5 CSL Beierle & Borger, Correctness Proof for the WAM with Types 1991 5 CSL Best & Esparza, Model Checking of Persistent Petri Nets 1991 5 CSL Chirimar & Lipton, Provability in TBLL: A Decision Procedure 1991 5 CSL Dahlhaus, How to Implement First Order Formulas in Local Memory Machine Models 1991 5 CSL Feferman, A New Approach to Abstract Data Types II. Computation on ADTs as Ordinary Computation 1991 5 CSL Fernando, A Primitive Recursive Set Theory and AFA: On the Logical Complexity of the Largest Bisimulation 1991 5 CSL Flum, On Bounded Theories 1991 5 CSL Goerdt, The Cutting Plane Proof System with Bounded Degree of Falsity 1991 5 CSL Moreno & Gonzalez & Artalejo, Denotational versus Declarative Semantics for Functional Programming 1991 5 CSL Gradel, On Transitive Closure Logic 1991 5 CSL Heusch & Speckenmeyer, Some Aspects of the Probabilistic Behavior of Variants of Resolution 1991 5 CSL Hirshfeld, Safe Queries in Relational Databases with Functions 1991 5 CSL Hooker, Logical Inference and Polyhedral Projection 1991 5 CSL Hosli, Stable Logic 1991 5 CSL Rao & Kapur & Shyamasundar, A Transformational Methodology for Proving Termination of Logic Programs 1991 5 CSL Lehmann, Plausibility Logic 1991 5 CSL Leiss, Towards Kleene Algebra with Recursion 1991 5 CSL Meinke, Equational Specification of Abstract Types and Combinators 1991 5 CSL Mundici, Normal Forms in Infinite-Valued Logic: The Case of One Variable 1991 5 CSL Oguztuzun, A Fragment of First Order Logic Adequate for Observation Equivalence 1991 5 CSL Pinchinat, Ordinal Processes in Comparative Concurrency Semantics 1991 5 CSL Renardel de Lavalette, Logical Semantics of Modularisation 1991 5 CSL Schmerl, A Cut-Elimination Procedure Designed for Evaluating Proofs as Programs 1991 5 CSL Schwichtenberg, Minimal from Classical Proofs 1991 5 CSL Seibert, Quantifier Hierarchies over Word Relations 1991 5 CSL Steffen, Complexity Results for the Default- and the Autoepistemic Logic 1991 5 CSL Stewart, On Completeness for NP via Projection Translations 1991 5 CSL Thistle & Wonham, Control of omega-Automata, Church's Problem, and the Emptiness Problem for Tree omega-Automata 1991 5 CSL Troelstra, Comparing the Theory of Representations and Constructive Mathematics 1991 5 CSL Tyszkiewicz, Infinitary Queries and their Asymptotic Probabilities I: Properties Definable in Transitive Closure Logic 1991 5 CSL Voronkov, On Completeness of Program Synthesis Systems 1991 5 CSL Weiermann, Proving Termination for Term Rewriting Systems 1990 4 CSL Arnborg & Proskurowski & Seese, Monadic Second Order Logic, Tree Automata and Forbidden Minors 1990 4 CSL Blass & Gurevich, On the Reduction Theory for Average Case Complexity 1990 4 CSL Flogel & Karpinski & Kleine Buning, Subclasses of Quantified Boolean Formulas 1990 4 CSL Gabbay, Algorithmic Proof with Diminishing Resources Part 1 1990 4 CSL Grandjean & Robson, RAM with Compact Memory: A Realistic and Robust Model of Computation 1990 4 CSL Habart, Randomness and Turing Reducibility Restraints 1990 4 CSL Hertrampf & Wagner, Interactive Proof Systems: Provers, Rounds, and Error Bounds 1990 4 CSL Mundici, The Complexity of Adaptive Error-Correcting Codes 1990 4 CSL Pudlak, Ramsey's Theorem in Bounded Arithmetic 1990 4 CSL Ranaivoson, Nontrivial Lower Bounds for Some NP-Problems on Directed Graphs 1990 4 CSL Vollmer, The Gap-Language-Technique Revisited 1990 3 CSL Ambos-Spies & Yang, Honest Polynomial-Time Degrees of Elementary Recursive Sets 1990 3 CSL Antoniou & Sperschneider, On the Verification of Modules 1990 3 CSL Borger, A Logical Operational Semantics of Full Prolog: Part 1. Selection Core and Control 1990 3 CSL Cantone & Cutello & Policriti, Set-Theoretic Reduction of Hilbert's Tenth Problem 1990 3 CSL Dahlhaus, The Complexity of Subtheories of the Existential Linear Theory of Reals 1990 3 CSL Dahn, On Test Classes for Universal Theories 1990 3 CSL Decker & Cavedon, Generalizing Allowedness While Retaining Completeness of SLDNF-Resolution 1990 3 CSL Droste & Goebel, Effectively Given Information Systems and Domains 1990 3 CSL Goerdt, Davis-Putnam Resolution versus Unrestricted Resolution 1990 3 CSL Gradel, On Logical Descriptions of Some Concepts in Structural Complexity Theory 1990 3 CSL Gurevich & Moss, Algebraic Operational Semantics and Occam 1990 3 CSL Krajicek & Pudlak, Propositional Provability and Models of Weak Arithmetic 1990 3 CSL Leiss, Polymorphic Recursion and Semi-Unification 1990 3 CSL Leitsch, Deciding Horn Classes by Hyperresolution 1990 3 CSL Meinel, Omega-Branching Programs of Bounded Width 1990 3 CSL Mey, A Predicate Calculus with Control of Derivations 1990 3 CSL Mundici, Reducibility of Monotone Formulas to mu-Formulas 1990 3 CSL Ohlbach, New Ways for Developing Proof Theories for First-Order Multi Modal Logics 1990 3 CSL Parigot, On the Representation of Data in Lambda-Calculus 1990 3 CSL Pasztor & Sain, A Streamlined Temporal Completeness Theorem 1990 3 CSL Penczek, A Concurrent Branching Time Temporal Logic 1990 3 CSL Priese & Nolte, Semantic for Abstract Fairness Using Metric Spaces 1990 3 CSL Speckenmeyer & Kemp, On the Average Time Complexity of Set Partitioning 1990 3 CSL Stark, A Direct Proof for the Completeness of SLD-Resolution 1990 3 CSL Stark, A Quantifier-free Completion of Logic Programs 1990 3 CSL Stepankova & Stepanek, Stratification of Definite Clause Programs and of General Logical Programs 1990 3 CSL Volger, The Semantics of Disjunctive Deductive Databases 1990 3 CSL Wette, Sequential Representation of Primitive Recursive Functions, and Complexity Classes 1989 2 CSL Ambos-Spies & Kamper, On Disjunctive Self-Reducibility 1989 2 CSL Dahlhaus, Completeness with Respect to Interpretations in Deterministic and Nondeterministic Polynomial Time 1989 2 CSL Gradel, Size of Models versus Length of Computations: On Inseparability by Nondeterministic Time Complexity Classes 1989 2 CSL Karpinski, Boolean Circuit Complexity of Algebraic Interpolation Problems 1989 2 CSL Kummer, Numberings of R_1 union F 1989 2 CSL Niemela, On the Complexity of the Decision Problem in Propositional Nonmonotonic Logic 1989 2 CSL Priese & Nivat, On the Existence of Fair Schedulers 1989 2 CSL Speckenmeyer, Is Average Superlinear Speedup Possible? 1989 2 CSL Voigt & Wegener, A Remark on Minimal Polynomials of Boolean Functions 1989 2 CSL Wagner, On the Emptiness Problem of Tree Automata and Completeness of Modal Logics of Programs 1977 CSMON Cowen, Protecting Computer Data Files: Secret Code Designers Get Cryptic Warning 1996 CSPRESS Dewdney, Introductory Computer Science: Bits of Theory, Bytes of Practice 1995 CSPRESS Horowitz & Sahni & Mehta, Fundamentals of Data Structures in C++ 1995 CSPRESS Tanimoto, The Elements of Artificial Intelligence Using Common Lisp, Second Edition 1994 CSPRESS Floyd & Beigel, The Language of Machines: An Introduction to Computability and Formal Languages 1992 CSPRESS Rawlins, Compared to What? An Introduction to the Analysis of Algorithms 1992 CSPRESS Aho & Ullman, Foundations of Computer Science 1991 CSPRESS Levy & Newborn, How Computers Play Chess 1990 CSPRESS Horowitz & Sahni, Fundamentals of Data Structures in Pascal, Third Edition 1990 CSPRESS Tanimoto, The Elements of Artificial Intelligence, Using Common LISP 1989 CSPRESS Davis, Truth, Deduction, and Computation: Logic and Semantics for Computer Science 1989 CSPRESS Gurari, An Introduction to the Theory of Computation 1989 CSPRESS Moore, UNIX: The Minimal Manual 1989 CSPRESS Drobot, Formal Languages and Automata Theory 1989 CSPRESS Horowitz & Sahni, Fundamentals of Data Structures in Turbo Pascal, For the IBM PC 1988 CSPRESS Gehani, C: An Advanced Introduction (ANSI C Edition) 1988 CSPRESS Storer, Data Compression: Methods and Theory 1987 CSPRESS Tanimoto, The Elements of Artificial Intelligence: An Introduction Using LISP 1988 3 CSSE Giandomenico & Guidotti & Grandoni & Simoncini, Gracefully Degradable Algorithm for Byzantine Agreement 1993 6 CSSS Sawhill, Self-Organized Criticality and Complexity Theory 1992 5 CSSS Mitchell, Genetic Algorithms 1992 5 CSSS Hogg & Huberman, Better Than the Best: The Power of Cooperation 1992 5 CSSS Jackson, Chaos Concepts 1992 5 CSSS Baskaran & Noever, Excursion Sets and a Modified Genetic Algorithm: Intelligent Slicing of the Hypercube 1992 5 CSSS Keeley & Bonabeau, Is There Room for Philosophy in the Science(s) of Complexity 1992 5 CSSS Smith, How to Get ``A Biologist's Guide to Internet Resources'' 1991 3 CSSS Traub & Wozniakowski, Theory and Applications of Information-Based Complexity 1991 3 CSSS Hasan, Moving a Human or Robot Arm with Many Degrees of Freedom: Issues and Ideas 1991 3 CSSS Gremillion, Linking Structure and Function: Information Processing in the Brain 1991 3 CSSS Atteson, An Overview of the Minimum Description Length Principle 1991 3 CSSS Greening, Asynchronous Parallel Simulated Annealing 1991 3 CSSS Provatas, Asymptotic Periodicity in One-Dimensional Maps 1990 CSSS Blum, Lectures on a Theory of Computation and Complexity over the Reals (or an Arbitrary Ring) 1990 CSSS Zurek, Algorithmic Information Content, Church-Turing Thesis, Physical Entropy, and Maxwell's Demon 1990 CSSS Lloyd, Physical Measures of Complexity 1990 CSSS Eubank & Farmer, An Introduction to Chaos and Prediction 1990 CSSS Boghosian, Data-Parallel Computation and the Connection Machine 1990 CSSS Jen, Preimages and Forecasting for Cellular Automata 1990 CSSS Sherrington, Complexity Due to Disorder and Frustration 1992 24 CSSTAT Newton (Ed.), Graphics and Visualization 1992 24 CSSTAT Elder, A Novel Efficient Global Search Algorithm for Multiple Dimensions 1992 24 CSSTAT Baker, A Program for Identifying Duplicated Code 1992 7 CSTI Mugnier & Chein, Polynomial Algorithms for Projection and Matching 1996 28 CSURV Loui & al., Strategic Directions in Research in Theory of Computing 1996 28 CSURV Tamassia & al., Strategic Directions in Computational Geometry 1996 28 CSURV Cleaveland & Molka & al., Strategic Directions in Concurrency Research 1996 28 CSURV Clarke & Wing & al., Formal Methods: State of the Art and Future Directions 1996 28 CSURV Hankin & Nielson & Palsberg & al., Strategic Directions in Programming Language Research 1996 28 CSURV Doyle & Dean & al., Strategic Directions in Artificial Intelligence 1996 28 CSURV Mudge & al., Strategic Directions in Computer Architecture 1996 28 CSURV Clark & Pasquale & al., Strategic Directions in Networks and Telecommunications 1996 28 CSURV Guerraoui & al., Strategic Directions in Object-Oriented Programming 1996 28 CSURV Van Hentenryck & Saraswat & al., Strategic Directions in Constraint Programming 1996 28 CSURV Gunter & Mitchell & Notkin & al., Strategic Directions in Software Engineering and Programming Languages 1996 28 CSURV Osterweil & al., Strategic Directions in Software Quality 1996 28 CSURV Stankovic & al., Strategic Directions in Real-Time and Embedded Systems 1996 28 CSURV Silberschatz & Zdonik & al., Strategic Directions in Database Systems--Breaking Out of the Box 1996 28 CSURV Gibson & Vitter & Wilkes & al., Strategic Directions in Storage I/O Issues in Large-Scale Computing 1996 28 CSURV Myers & Hollan & Cruz & al., Strategic Directions in Human-Computer Interaction 1996 28 CSURV Sameh & al., Strategic Directions in Computational Science and Engineering 1996 28 CSURV Adam & Yesha & al., Strategic Directions in Electronic Commerce and Digital Libraries: Toward a Digital Agora 1996 28 CSURV Tucker & al., Strategic Directions in Computer Science Education 1996 28 CSURV Taivalsaari, On the Notion of Inheritance 1996 28 CSURV Jones, An Introduction to Partial Evaluation 1996 28 CSURV Gallian, Error Detection Methods 1996 28 CSURV Soderquist & Leeser, Area and Performance Tradeoffs in Floating-Point Divide and Square-Root Implementations 1996 28 CSURV Agha, Linguistic Paradigms for Programming Complex Distributed Systems 1996 28 CSURV Andreoli & Pareschi, Integrated Computational Paradigms for Flexible Client-Server Communications 1996 28 CSURV Ciancarini, Coordination Models and Languages as Software Integrators 1996 28 CSURV Gilbert, Can Computational Logic Provide a Paradigm for Both the Specification and Implementation of Concurrent Systems? 1996 28 CSURV Hanus & Kuchen, Integration of Functional and Logic Programming 1996 28 CSURV Mycroft, On Integration of Programming Paradigms 1996 28 CSURV Reddy, Imperative Functional Programming 1996 28 CSURV Volpano & Smith, On the Systematic Design of Web Languages 1996 28 CSURV Wadler, Lazy Versus Strict 1996 28 CSURV Benton, On the Relationship Between Formal Semantics and Static Analysis 1996 28 CSURV Cousot, Abstract Interpretation 1996 28 CSURV Danvy & Hentze & Malmkjaer, Resource-Bounded Partial Evaluation 1996 28 CSURV File & Giacobazzi & Ranzato, A Unifying View of Abstract Domain Design 1996 28 CSURV Jagannathan & Wright, Compiling Functional Languages with Flow Analysis 1996 28 CSURV Le Metayer & Schmidt, Structural Operational Semantics as a Basis for Static Program Analysis 1996 28 CSURV Nielson, Annotated Type and Effect Systems 1996 28 CSURV Dam, Modalities in Analysis and Verification 1996 28 CSURV Cartwright & Felleisen, Program Verification Through Soft Typing 1996 28 CSURV Degano & Priami, Enhanced Operational Semantics 1996 28 CSURV Jay, Shape in Computing 1996 28 CSURV Palsberg, Type Inference for Objects 1996 28 CSURV Pettorossi & Proietti, Rules and Strategies for Transforming Functional and Logic Programs 1996 28 CSURV Frakes & Terry, Software Reuse: Metrics and Models 1996 28 CSURV Abiteboul & Kuper & Mairson & Shvartsman & Vardi, In Memoriam: Paris C. Kanellakis 1996 28 CSURV Reingold, Basic Techniques for Design and Analysis of Algorithms 1996 28 CSURV Tamassia, Data Structures 1996 28 CSURV Lee, Computational Geometry 1996 28 CSURV Motwani & Raghavan, Randomized Algorithms 1996 28 CSURV Crochemore & Lecroq, Pattern-Matching and Text-Compression Algorithms 1996 28 CSURV Khuller & Raghavachari, Graph and Network Algorithms 1996 28 CSURV Loui, Computational Complexity Theory 1996 28 CSURV Blelloch & Maggs, Parallel Algorithms 1996 28 CSURV Chandru & Rao, Combinatorial Optimization: An Integer Program Perspective 1996 28 CSURV LaPaugh, Layout Algorithms for VLSI Design 1996 28 CSURV Burger, Memory Systems 1996 28 CSURV Flynn & Rudd, Parallel Architectures 1996 28 CSURV Quinlan, Learning Decision Tree Classifiers 1996 28 CSURV Jordan & Bishop, Neural Networks 1996 28 CSURV Forrest, Genetic Algorithms 1996 28 CSURV Lewis & Fitzgerald & Liu, Robotics 1996 28 CSURV Dean, Automated Planning 1996 28 CSURV Pearl, Decision Making Under Uncertainty 1996 28 CSURV Cinnella, Numerical Simulations of Reactive Flows 1996 28 CSURV Shang, Computational Electromagnetics 1996 28 CSURV Kingsbury, Computational Biology 1996 28 CSURV Silberschatz & Korth & Sudarshan, Data Models 1996 28 CSURV Ceri & Ramakrishnan, Rules in Database Systems 1996 28 CSURV Shasha, Tuning Databases for High Performance 1996 28 CSURV Salzberg, Access Methods 1996 28 CSURV Ioannidis, Query Optimization 1996 28 CSURV Ozsu & Valduriez, Distributed and Parallel Database Systems 1996 28 CSURV Jajodia, Database Security and Privacy 1996 28 CSURV Riloff & Hollaar, Text Databases and Information Retrieval 1996 28 CSURV Bancilhon, Object Databases 1996 28 CSURV Melton, SQL Language Summary 1996 28 CSURV House, Overview of Three-Dimensional Computer Graphics 1996 28 CSURV Rockwood, Geometric Primitives 1996 28 CSURV Ebert, Advanced Modeling Techniques for Computer Graphics 1996 28 CSURV Watt, Rendering Techniques: Past, Present and Future 1996 28 CSURV Thalmann & Thalmann, Computer Animation 1996 28 CSURV Kaufman, Volume Visualization 1996 28 CSURV Grudin, The Organizational Contexts of Development and Use 1996 28 CSURV Dzida, International Usability Standards 1996 28 CSURV Jacob, Human-Computer Interaction: Input Devices 1996 28 CSURV Ware, Multimedia Output Devices and Techniques 1996 28 CSURV Ziegler, Interactive Techniques 1996 28 CSURV Myers, User Interface Software Technology 1996 28 CSURV Rosson, Human Factors in Programming and Software Development 1996 28 CSURV Selber & Johnson-Eilola & Mehlenbacher, Online Support Systems 1996 28 CSURV Finkel, Operating Systems 1996 28 CSURV Stankovic, Real-Time and Embedded Systems 1996 28 CSURV Wills, Process Synchronization and IPC 1996 28 CSURV Denning, Virtual Memory 1996 28 CSURV McKusick, Secondary Storage and Filesystems 1996 28 CSURV Stallings, Advances in High-Speed Networking 1996 28 CSURV Mullender, Distributed Operating Systems 1996 28 CSURV Doeppner, Distributed File Systems and Distributed Memory 1996 28 CSURV Chapin, Distributed and Multiprocessor Scheduling 1996 28 CSURV Siegel & Dietz & Antonio, Software Support for Heterogeneous Computing 1996 28 CSURV Sandhu & Samarati, Authentication, Access Control, and Audit 1996 28 CSURV Bruce, Progress in Programming Languages 1996 28 CSURV Goldberg, Functional Programming Languages 1996 28 CSURV Hirshfield & Ege, Object-Oriented Programming 1996 28 CSURV Cohen, Logic Programming and Constraint Logic Programming 1996 28 CSURV Cardelli, Type Systems 1996 28 CSURV Schmidt, Programming Language Semantics 1996 28 CSURV Sommerville, Software Process Models 1996 28 CSURV Holland & Lieberherr, Object-Oriented Design 1996 28 CSURV Schach, Testing: Principles and Practice 1996 28 CSURV Reiss, Software Tools and Environments 1996 28 CSURV Wegner, Interoperability 1995 27 CSURV Greenlaw & Petrechi & Prather, Cubic Graphs 1995 27 CSURV Prather, Design and Analysis of Hierarchical Software Metrics 1995 27 CSURV Sarkar, Methods to Speed Up Error Back-Propagation Learning Algorithm 1995 27 CSURV Gudivada, Multimedia Systems -- An Interdisciplinary Perspective 1995 27 CSURV Fox & Kieffer, Multimedia Curricula, Courses, and Knowledge Modules 1995 27 CSURV Furht, Where Are Information Superhighways Headed? 1995 27 CSURV Preece & Shneiderman, Survival of the Fittest: The Evolution of Multimedia User Interfaces 1995 27 CSURV Andre, Intellimedia: Making Multimedia Usable by Exploiting AI Methods 1995 27 CSURV Aref & Kamel & Lopresti, On Handling Electronic Ink 1995 27 CSURV Baker & Cruz & Liotta & Tamassia, A New Model for Algorithm Animation Over the WWW 1995 27 CSURV Chang, Exploring Functionalities in the Compressed Image/Video Domain 1995 27 CSURV Christodoulakis & Triantafillou, Research and Development Issues for Large-Scale Multimedia Information Systems 1995 27 CSURV Cowan & Cen & Walpole & Pu, Adaptive Methods for Distributed Video Presentation 1995 27 CSURV Dimitrova, The Myth of Semantic Video Retrieval 1995 27 CSURV Flank, The Role of Natural-Language Processing in Multimedia 1995 27 CSURV Garofalakis & Ioannidis, Scheduling Issues in Multimedia Query Optimization 1995 27 CSURV Ghafoor, Multimedia Database Management Systems 1995 27 CSURV Hall, The Role of Hypermedia in Multimedia Information Systems 1995 27 CSURV Li & Huang, A Dynamic Data Model for a Video Database Management System 1995 27 CSURV Moffat & Zobel, Index Organization for Multimedia Database Systems 1995 27 CSURV Mosse, Resource Reservations in Networked Multimedia Systems 1995 27 CSURV Nahrstedt, End-to-End Guarantees in Networked Multimedia Systems 1995 27 CSURV Ozden & Rastogi & Silberschatz, Research Issues in Multimedia Storage Servers 1995 27 CSURV Picard, Computer Learning of Subjectivity 1995 27 CSURV Roselli, Artificial Intelligence Can Improve Hypermedia Instructional Technologies for Learning 1995 27 CSURV Rus & Subramanian, Customizing Multimedia Information Access 1995 27 CSURV Samet, General Research Issues in Multimedia Database Systems 1995 27 CSURV Schank & Korcuska & Jona, Multimedia Applications for Education and Training: Revolution or Red Herring? 1995 27 CSURV Shenoy & Goyal & Vin, Issues in Multimedia Server Design 1995 27 CSURV Staehli & Walpole & Maier, Device and Physical Data Independence for Multimedia Presentations 1995 27 CSURV Zhang & Tian, Digital Video Analysis and Recognition for Content-Based Access 1995 27 CSURV publisher, Author Index Vols. 23-27 (1991-1995) 1995 27 CSURV publisher, Subject Index 1991-1995 1995 27 CSURV Reddy, Grand Challenges in AI 1995 27 CSURV Ahuja, On Detection and Representation of Multiscale Low-Level Image Structure 1995 27 CSURV Aloimonos & Fermuller & Rosenfeld, Seeing and Understanding: Representing the Visual World 1995 27 CSURV Bajcsy, Signal-to-Symbol Transformation and Vice Versa: From Fundamental Processes to Representation 1995 27 CSURV Brachman & Levesque, Undirected Behavior Without Unbounded Search 1995 27 CSURV Charniak, Natural Language Learning 1995 27 CSURV Clancey, AI: Inventing a New Kind of Machine 1995 27 CSURV Cohn, The Challenge of Qualitative Spatial Reasoning 1995 27 CSURV Dietterich, Overfitting and Undercomputing in Machine Learning 1995 27 CSURV Dubois & Prade, What Does Fuzzy Logic Bring to AI? 1995 27 CSURV Ginsberg, Epistemological and Heuristic Adequacy Revisited 1995 27 CSURV Kambhampati, AI Planning: A Prospectus on Theory and Applications 1995 27 CSURV Korf, Space-Efficient Search Algorithms 1995 27 CSURV Lesser, Multiagent Systems: An Emerging Subdiscipline of AI 1995 27 CSURV Lifschitz, The Logic of Common Sense 1995 27 CSURV Loui, Models of Deliberation in the Social Sciences 1995 27 CSURV Pitrat, AI Systems Are Dumb Because AI Researchers Are Too Clever 1995 27 CSURV Tate, Don't Leave Your Plan on the Shelf 1995 27 CSURV Torasso & Console & Portinale & Dupre, On the Role of Abduction 1995 27 CSURV Waltz & Kasif, On Reasoning From Data 1995 27 CSURV Wellman, The Economic Approach to Artificial Intelligence 1995 27 CSURV Yip & Zhao & Sacks, Imagistic Reasoning 1995 27 CSURV Allan & Jones & Lee & Allan, Software Pipelining 1995 27 CSURV Beauchemin & Barron, The Computation of Optical Flow 1995 27 CSURV Pitoura & Bukhres & Elmagarmid, Object Orientation in Multidatabase Systems 1995 27 CSURV Paakki, Attribute Grammar Paradigms--A High-Level Methodology in Language Implementation 1995 27 CSURV Garlan, Research Directions in Software Architecture 1995 27 CSURV Nierstrasz & Meijler, Research Directions in Software Composition 1995 27 CSURV Wiederhold, Mediation in Information Systems 1995 27 CSURV Manola, Interoperability Issues in Large-Scale Distributed Object Systems 1995 27 CSURV Heiler, Semantic Interoperability 1995 27 CSURV Sutherland, Business Objects in Corporate Information Systems 1995 27 CSURV Gallopoulos & Houstis & Rice, Workshop on Problem-Solving Environments: Findings and Recommendations 1995 27 CSURV Rosenberg, Thoughts on Parallelism and Concurrency in Computing Curricula 1995 27 CSURV Metaxas, Fundamental Ideas for a Parallel Computing Course 1995 27 CSURV Moller & Smolka, On the Computational Complexity of Bisimulation 1995 27 CSURV Cytron & Hailpern, SIGPLAN Scope and Tutorial Needs 1995 27 CSURV Thomasian, High-Performance Secondary Memory (response to Chen et al., RAID: High-Performance Reliable Secondary Memory) 1995 27 CSURV Hartmanis, Turing Award Lecture: On Computational Complexity and the Nature of Computer Science 1995 27 CSURV Belady, The Disappearance of the ``Pure'' Software Industry 1995 27 CSURV Brassard, Time for Another Paradigm Shift 1995 27 CSURV Denning, Can There Be a Science of Information? 1995 27 CSURV Freeman, Effective Computer Science 1995 27 CSURV Loui, Computer Science Is a New Engineering Discipline 1995 27 CSURV Plaice, Computer Science Is an Experimental Science 1995 27 CSURV Savage, Will Computer Science Become Irrelevant? 1995 27 CSURV Stewart, Science and Computer Science 1995 27 CSURV Ullman, The Role of Theory Today 1995 27 CSURV Wegner, Interaction as a Basis for Empirical Computer Science 1995 27 CSURV Weingarten, Government Funding and Computing Research Priorities 1995 27 CSURV Wulf, Are We Scientists or Engineers? 1995 27 CSURV Hartmanis, Response to the Essays ``On Computational Complexity and the Nature of Computer Science'' 1995 27 CSURV Buhr & Fortier & Coffin, Monitor Classification 1995 27 CSURV Baeza-Yates, Fringe Analysis Revisited 1995 27 CSURV Zweben, The Scope and Tutorial Needs of the ACM SIGs: Serving the Need for Professional Development 1995 27 CSURV Leighton, SIGACT Program Summary 1995 27 CSURV Shapiro, SIGART 1995 27 CSURV Rada, SIGBIO and the Relationship Between People and Tools 1995 27 CSURV Miller, SIGCHI and Computing Surveys 1995 27 CSURV Fox, SIGIR 1995 27 CSURV Furuta, Hypertext and Hypermedia Research 1995 27 CSURV Woo, Survey and Tutorial Needs of SIGOIS 1994 26 CSURV Bacon & Graham & Sharp, Compiler Transformations for High-Performance Computing 1994 26 CSURV Matousek, Geometric Range Searching 1994 26 CSURV Landwehr & Bull & McDermott & Choi, A Taxonomy of Computer Program Security Flaws 1994 26 CSURV Bailey & Briner & Chamberlain, Parallel Logic Simulation of VLSI Systems 1994 26 CSURV Chassin de Kergommeaux & Codognet, Parallel Logic Programming Systems 1994 26 CSURV Chen & Lee & Gibson & Katz & Patterson, RAID: High-Performance, Reliable Secondary Storage 1994 26 CSURV Harris, A Survey of PRAM Simulation Techniques 1994 26 CSURV Gupta & Smolka & Bhaskar, On Randomization in Sequential and Distributed Algorithms 1994 26 CSURV Malone & Crowston, The Interdisciplinary Study of Coordination 1994 26 CSURV Lee & Shin, Probabilistic Diagnosis of Multiprocessor Systems 1993 25 CSURV Baskerville, Information Systems Security Design Methods: Implications for Information Systems Development 1993 25 CSURV Eschermann, State Assignment for Hardwired VLSI Control Units 1993 25 CSURV Brancheau & Brown, The Management of End-User Computing: Status and Directions 1993 25 CSURV Shankar, An Introduction to Assertional Reasoning for Concurrent Systems 1993 25 CSURV Norman & Thanisch, Models of Machines and Computation for Mapping in Multicomputers 1993 25 CSURV Lilja, Cache Coherence in Large-Scale Shared-Memory Multiprocessors: Issues and Comparisons 1993 25 CSURV Nelson, The Mathematics of Product Form Queuing Networks 1993 25 CSURV Graefe, Query Evaluation Techniques for Large Databases 1993 25 CSURV Barborak & Malek & Dahbura, The Consensus Problem in Fault-Tolerant Computing 1993 25 CSURV Arman & Aggarwal, Model-Based Object Recognition in Dense-Range Images--A Review 1993 25 CSURV Schneider, Self-Stabilization 1992 24 CSURV Brown, A Survey of Image Registration Techniques 1992 24 CSURV Kukich, Techniques for Automatically Correcting Words in Text 1992 24 CSURV Estiville-Castro & Woods, A Survey of Adaptive Sorting Algorithms 1992 24 CSURV Hwang & Ahuja, Gross Motion Planning--A Survey 1992 24 CSURV Bryant, Symbolic Boolean Manipulation with Ordered Binary-Decision Diagrams 1992 24 CSURV Krueger, Software Reuse 1992 24 CSURV Brinch Hansen, Huseholder Reduction of Linear Equations 1992 24 CSURV McGeoch, Analyzing Algorithms by Simulation: Variance Reduction Techniques and Simulation Speedups 1992 24 CSURV Suetens & Fua & Hanson, Computational Strategies for Object Recognition 1992 24 CSURV Mishra & Eich, Join Processing in Relational Databases 1991 23 CSURV Stytz & Frieder & Frieder, Three-Dimensional Medical Imaging: Algorithms and Computer Systems 1991 23 CSURV McKenzie & Snodgrass, Evaluation of Relational Algebras Incorporating the Time Dimension in Databases 1991 23 CSURV Barghouti & Kaiser, Concurrency Control in Advanced Database Applications 1991 23 CSURV Galil & Italiano, Data Structures and Algorithms for Disjoint Set Union Problems 1991 23 CSURV Aurenhammer, Voronoi Diagrams--A Survey of a Fundamental Geometric Data Structure 1991 23 CSURV Goldberg, Corrigendum: What Every Computer Scientist Should Know About Floating-Point Arithmetic 1991 23 CSURV Shahookar & Mazumder, VLSI Cell Placement Techniques 1991 23 CSURV Abeysundara & Kamal, High-Speed Local Area Networks and Their Performance: A Survey 1991 23 CSURV Goldberg, What Every Computer Scientist Should Know About Floating-Point Arithmetic 1991 23 CSURV Andrews, Paradigms for Process Interaction in Distributed Programs 1991 23 CSURV Chin & Chanson, Distributed Object-Based Programming Systems 1990 22 CSURV Schneider, Implementing Fault-Tolerant Services Using the State Machine Approach: A Tutorial 1990 22 CSURV Levy & Silberschatz, Distributed File Systems: Concepts and Examples 1990 22 CSURV Katz, Toward a Unified Framework for Version Modeling in Engineering Databases 1990 22 CSURV Pawlikowski, Corrigenda to ``Steady-State Simulation of Queueing Processes: A Survey of Problems and Solutions 1990 22 CSURV Sheth & Larson, Federated Database Systems for Managing Distributed, Heterogeneous, and Autonomous Databases 1990 22 CSURV Thomas & Thompson & Chung & Barkmeyer & Carter & Templeton & Fox & Hartman, Heterogeneous Distributed Database Systems for Production Use 1990 22 CSURV Litwin & Mark & Roussopoulos, Interoperability of Multiple Autonomous Databases 1990 22 CSURV Onvural, Survey of Closed Queueing Networks with Blocking 1990 22 CSURV Pawlikowski, Steady-State Simulation of Queueing Processes: A Survey of Problems and Solutions 1990 22 CSURV van de Goor & Verruijt, An Overview of Deterministic Functional RAM Chip Testing 1990 22 CSURV Abbott, Resourceful Systems for Fault Tolerance, Reliability, and Safety 1989 21 CSURV Adam & Wortmann, Security-Control Methods for Statistical Databases: A Comparative Study 1989 21 CSURV Bell & Witten & Cleary, Modeling for Text Compression 1989 21 CSURV McDowell & Helmbold, Debugging Concurrent Programs 1989 21 CSURV Shapiro, Corrigendum: The Family of Concurrent Logic Programming Languages 1989 21 CSURV Bal & Steiner & Tanenbaum, Programming Languages for Distributed Computing Systems 1989 21 CSURV Carriero & Gelernter, How to Write Parallel Programs: A Guide to the Perplexed 1989 21 CSURV Hudak, Conception, Evolution, and Application of Functional Programming Languages 1989 21 CSURV Shapiro, The Family of Concurrent Logic Programming Languages 1989 21 CSURV Abramson, Control Strategies for Two-Player Games 1989 21 CSURV Ellman, Explanation-Based Learning: A Survey of Programs and Perspectives 1989 21 CSURV Colbourn & van Oorshot, Applications of Combinatorial Designs in Computer Science 1989 21 CSURV Hartson & Hix, Human-Computer Interface Development: Concepts and Systems 1989 21 CSURV Knight, Unification: A Multidisciplinary Survey 1988 20 CSURV Johnson & Malek, Survey of Software Tools for Evaluating Reliability, Availability, and Serviceability 1988 20 CSURV Samet, Hierarchical Representations of Collections of Small Rectangles 1988 20 CSURV Peckham & Maryanski, Semantic Data Models 1988 20 CSURV Mannino & Chu & Sager, Statistic Profile Estimation in Database Systems 1988 20 CSURV Enbody & Du, Dynamic Hashing Schemes 1988 20 CSURV Kraemer & King, Computer-Based Systems for Cooperative Work and Group Decision Making 1988 20 CSURV Takagi, Queuing Analysis of Polling Models 1988 20 CSURV Danforth & Tomlinson, Type Theories and Object-Oriented Programming 1987 19 CSURV Knapp, Deadlock Detection in Distributed Databases 1987 19 CSURV Bergfeld Mills & Weldon, Reading Text from Computer Screens 1987 19 CSURV Hull & King, Semantic Database Modeling: Survey, Applications, and Research Issues 1987 19 CSURV Lelewer & Hirschberg, Data Compression 1987 19 CSURV Atkinson & Buneman, Types and Persistence in Database Programming Languages 1987 19 CSURV Lyytinen, Different Perspectives on Information Systems: Problems and Solutions 1987 19 CSURV Kemper & Wallrath, An Analysis of Geometric Modeling in Database Systems 1986 18 CSURV Batini & Lenzerini & Navathe, A Comparative Analysis of Methodologies for Database Schema Integration 1986 18 CSURV Veen, Dataflow Machine Architecture 1986 18 CSURV Mili & Desharnais & Gagne, Formal Models of Stepwise Refinement of Programs 1986 18 CSURV Ryder & Paull, Elimination Algorithms for Data Flow Analysis 1986 18 CSURV Leveson, Software Safety: What, Why, and How 1986 18 CSURV Hirschheim, The Effect of A Priori Views on the Social Implications of Computing: The Case of Office Automation 1986 18 CSURV Teorey & Yang & Fry, A Logical Design Methodology for Relational Databases Using the Extended Entity-Relationship Model 1986 18 CSURV Perrott & Zarea-Aliabadi, Supercomputer Languages 1986 18 CSURV Galil, Efficient Algorithms for Finding Maximum Matching in Graphs 1986 18 CSURV Misra, Distributed Discrete-Event Simulation 1986 18 CSURV Chin & Dyer, Model-Based Recognition in Robot Vision 1985 CSURV Besl & Jain, Three-Dimensional Object Recognition 1985 CSURV Cardelli & Wegner, On Understanding Types, Data Abstraction, and Polymorphism 1985 CSURV Davidson & Garcia-Molina & Skeen, Consistency in Partitioned Networks 1985 CSURV Faloutsos, Access Methods for Text 1985 CSURV Gordon, System Architectures for Computer Music 1985 CSURV Gupta & Sacks-Davis & Tischer, A Review of Recent Developments in Solving ODEs 1985 CSURV Hester & Hirschberg, Self-Organizing Linear Search 1985 CSURV Jarke & Vassiliou, A Framework for Choosing a Database Query Language 1985 CSURV Loy & Abbott, Programming Languages for Computer Music Synthesis, Performance, and Composition 1985 CSURV Pennycook, Computer-Music Interfaces: A Survey 1985 CSURV Quarterman & Silberschatz & Peterson, 4.2BSD and 4.3BSD as Examples of the UNIX System 1985 CSURV Roads, Research in Music and Artificial Intelligence 1985 CSURV Tanenbaum & van Renesse, Distributed Operating Systems 1984 CSURV Bitton & DeWitt & Hsaio & Menon, A Taxonomy of Parallel Sorting 1984 CSURV Gallaire & Minker & Nicolas, Logic and Databases: A Deductive Approach 1984 CSURV Jarke & Koch, Query Optimization in Database Systems 1984 CSURV Kim, Highly Available Systems for Database Applications 1984 CSURV Kurose & Schwartz & Yemini, Mutliple-Access Protocols and Time-Constrained Communication 1984 CSURV Quinn & Deo, Parallel Graph Algorithms 1984 CSURV Samet, The Quadtree and Related Hierarchical Data Structures 1984 CSURV Shneiderman, Response Time and Display Rate in Human Performance with Computers 1984 CSURV Stallings, Local Networks 1984 CSURV Svobodova, File Servers for Network-Based Distributed Systems 1984 CSURV Yu & Chang, Distributed Query Processing 1983 CSURV Abadir & Reghbati, Functional Testing of Semiconductor Random Access Memories 1983 CSURV Andrews & Schneider, Concepts and Notations for Concurrent Programming 1983 CSURV Andrews & Schneider, Corrigenda: Concepts and Notations for Concurrent Programs 1983 CSURV Angluin & Smith, Inductive Inference: Theory and Methods 1983 CSURV Broomell & Heath, Classification Categories and Historical Development of Circuit Switching Topologies 1983 CSURV Haerder & Reuter, Principles of Transaction-Oriented Database Recovery 1983 CSURV King, Centralized versus Decentralized Computing: Organizational Considerations and Management Options 1983 CSURV Lee & Lochovsky, Voice Response Systems 1983 CSURV Lientz, Issues in Software Maintenance 1983 CSURV March, Techniques for Structuring Database Records 1983 CSURV Partsch & Steinbruggen, Program Transformation Systems 1983 CSURV Voydock & Kent, Security Mechanisms in High-Level Network Protocols 1982 CSURV Adrion & Branstad & Cherniavsky, Validation, Verification, and Testing of Computer Software 1982 CSURV Allen & Loomis & Mannino, The Integrated Dictionary/Directory System 1982 CSURV Barnard & Fischler, Computational Stereo 1982 CSURV Brady, Computational Approaches to Image Understanding 1982 CSURV Dowdy & Foster, Comparative Models of the File Assignment Problem 1982 CSURV Dunlop & Basili, A Comparative Analysis of Functional Correctness 1982 CSURV Feuer & Gehani, A Comparison of the Programming Languages C and PASCAL 1982 CSURV Furuta & Scofield & Shaw, Document Formatting Systems: Survey, Concepts, and Issues 1982 CSURV Ganapathi & Fischler & Hennessy, Retargetable Compiler Code Generation 1982 CSURV Howden, Validation of Scientific Programs 1982 CSURV Marsland & Campbell, Parallel Search of Strongly Ordered Game Trees 1982 CSURV Meyrowitz & van Dam, Interactive Editing Systems: Part II 1982 CSURV Meyrowitz & van Dam, Interactive Editing Systems: Part I 1982 CSURV Moret, Decision Trees and Diagrams 1982 CSURV Smith, Cache Memories 1982 CSURV Treleaven & Brownbridge & Hopkins, Data-Driven and Demand-Driven Computer Architecture 1981 CSURV Ahuja & Schacter, Image Models 1981 CSURV Bernstein & Goodman, Concurrency Control in Distributed Database Systems 1981 CSURV Cheheyl & Gasser & Huff & Millen, Verifying Security 1981 CSURV Cohen, Garbage Collection of Linked Data Structures 1981 CSURV Embley & Nagy, Behavioral Aspects of Text Editors 1981 CSURV Frank & Sproull, Testing and Debugging Custom Integrated Circuits 1981 CSURV Gray & McJones & Blasgen & Lindsay & Lorie & Price & Putzolu & Traiger, The Recovery Manager of the System R Database Manager 1981 CSURV Kohler, A Survey of Techniques for Synchronization and Recovery in Decentralized Computer Systems 1981 CSURV Landwehr, Formal Models for Computer Security 1981 CSURV Mayer, The Psychology of How Novices Learn Computer Programming 1981 CSURV Reisner, Human Factors Studies of Database Query Languages: A Survey and Assessment 1981 CSURV Rouse, Human-Computer Interaction in the Control of Dynamic Systems 1981 CSURV Sheil, The Psychological Study of Programming 1981 CSURV Srihari, Representation of Three-Dimensional Digital Images 1981 CSURV Tanenbaum, Network Protocols 1980 CSURV Bird, Tabulation Techniques for Recursive Programs 1980 CSURV Clark, From Electron Mobility to Logical Structure: A View of Integrated Circuits 1980 CSURV Dasgupta, Some Aspects of High Level Microprogramming 1980 CSURV Ellis & Nutt, Office Information Systems and Computer Science 1980 CSURV Erman & Hayes-Roth & Lesser & Reddy, The Hearsay-II Speech-Understanding System: Integrating Knowledge to Resolve Uncertainty 1980 CSURV Hall & Dowling, Approximate String Matching 1980 CSURV Jones & Schwarz, Experience Using Multiprocessor Systems--A Status Report 1980 CSURV Kling, Social Analyses of Computing: Theoretical Perspectives in Recent Empirical Research 1980 CSURV Landskov & Davidson & Shriver & Mallett, Local Microcode Compaction Techniques 1980 CSURV Lueker, Some Techniques for Solving Recurrences 1980 CSURV Maryanski, Backend Database Systems 1980 CSURV Requicha, Representations for Rigid Solids: Theory, Methods, and Systems 1980 CSURV Teorey & Fry, The Logical Record Access Approach to Database Design 1980 CSURV Wetherell, Probabilistic Languages: A Review and Some Open Questions 1980 CSURV Wong, Minimizing Expected Head Movement in One-Dimensional and Two-Dimensional Mass Storage Systems 1979 CSURV Badler & Smoliar, Digital Representations of Human Movement 1979 CSURV Bentley & Friedman, Data Structures for Range Searching (Short Note) 1979 CSURV Bernard, Management Issues in Cooperative Computing 1979 CSURV Bright & Enison, Quasi-Random Number Sequences from a Long-Period TLP Generator (Short Note) 1979 CSURV Cohen, Non-Deterministic Algorithms 1979 CSURV Comer, The Ubiquitous B-Tree 1979 CSURV Dale, Database Management Systems Development in the USSR 1979 CSURV Dasgupta, The Organization of Microprogram Stores 1979 CSURV Denning & Denning, Data Security 1979 CSURV Kim, Relational Database Systems 1979 CSURV Lempel, Cryptology in Transition 1979 CSURV McKell & Hansen & Heitger, Charging for Computing Resources 1979 CSURV Mohanty, Models and Measurements for Quality Assessment of Software 1979 CSURV Molina, A Survey of Resource Directive Decomposition in Mathematical Programming 1979 CSURV Nagy & Wagle, Geographic Data Processing 1979 CSURV Popek & Kline, Encryption and Secure Computer Networks 1979 CSURV Simmons, Symmetric and Asymmetric Encryption 1979 CSURV Sockut & Goldberg, Database Reorganization--Principles and Practice 1978 CSURV Bard, The VM/370 Performance Predictor 1978 CSURV Bergeron & Bono & Foley, Graphics Programming Using the Core System 1978 CSURV Buzen, A Queueing Network Model of MVS 1978 CSURV Carlbom & Paciorek, Planar Geometric Projections and Viewing Transformations 1978 CSURV Chandy & Sauer, Approximate Methods for Analyzing Queueing Network Models of Computer Systems 1978 CSURV Davis & Goodman, The Soviet Bloc's Unified System of Computers 1978 CSURV Denning & Buzen, The Operational Analysis of Queueing Network Models 1978 CSURV Fitzsimmons & Love, A Review and Evaluation of Software Science 1978 CSURV King & Schrems, Cost-Benefit Analysis in Information Systems Development and Operation 1978 CSURV Michener & Foley, Some Major Issues in the Design of the Core Graphics System 1978 CSURV Michener & van Dam, A Functional Overview of the Core System with Glossary 1978 CSURV Muntz, Queueing Networks: A Critique of the State of the Art and Directions for the Future 1978 CSURV Newman & van Dam, Recent Efforts Toward Graphics Standardization 1978 CSURV Randell & Lee & Treleaven, Reliability Issues in Computing System Design 1978 CSURV Rose, A Measurement Procedure for Queueing Network Models of Computer Systems 1978 CSURV Sandewall, Programming in the Interactive Environment: The LISP Experience 1978 CSURV Srodawa, Positive Experiences with a Multiprocessing System (Short Note) 1978 CSURV Verhofstad, Recovery Techniques for Database Systems 1978 CSURV Wong, Queueing Network Modeling of Computer Communication Networks 1978 CSURV Zelkowitz, Perspectives on Software Engineering 1977 CSURV Enslow, Multiprocessor Organization--A Survey 1977 CSURV Gonzalez, Deterministic Processor Scheduling 1977 CSURV Kuck, A Survey of Parallel Machine Organization and Programming 1977 CSURV Lipsky & Church, Applications of a Queueing Network Model for a Computer System 1977 CSURV Peterson, Petri Nets 1977 CSURV Ramamoorthy & Li, Pipeline Architecture 1977 CSURV Sedgewick, Permutation Generation Methods 1977 CSURV Severance & Carlis, A Practical Approach to Selecting Record Access Paths 1977 CSURV Taggart & Tharp, A Survey of Information Requirements Analysis Techniques 1977 CSURV Weide, A Survey of Analysis Techniques for Discrete Algorithms 1977 CSURV Yau & Fung, Associative Processor Architecture--A Survey 1976 CSURV Chamberlin, Relational Data-Base Management Systems 1976 CSURV Denning, Fault-Tolerant Operating Systems 1976 CSURV Fosdick & Osterweil, Data Flow Analysis in Software Reliability 1976 CSURV Fry & Sibley, Evolution of Data-Base Management Systems 1976 CSURV Hantler & King, An Introduction to Proving the Correctness of Programs 1976 CSURV Hecht, Fault-Tolerant Software for Real-Time Applications 1976 CSURV Linden, Operating System Structures to Support Security and Reliable Software 1976 CSURV Marcotty & Ledgard & Bochmann, A Sampler of Formal Definitions 1976 CSURV Michaels & Mittman & Carlson, A Comparison of Relational and CODASYL Approaches to Data-Base Management 1976 CSURV Reddi & Feustel, A Conceptual Framework for Computer Architecture 1976 CSURV Tanenbaum, A Tutorial on ALGOL 68 1976 CSURV Taylor & Frank, CODASYL Data-Base Management Systems 1976 CSURV Tsichritizis & Lochovsky, Hierarchical Data-Base Management 1975 CSURV Anderson & Jensen, Computer Interconnection Structures: Taxonomy, Characteristics and Examples 1975 CSURV Boyse & Warn, A Straightforward Model for Computer Performance Prediction 1975 CSURV Cotton, Microeconomics and the Market for Computer Services 1975 CSURV Huang, An Approach to Program Testing 1975 CSURV Keller, Look-Ahead Processors 1975 CSURV Kimbleton & Schneider, Computer Communications Networks: Approaches, Objectives, and Performance Considerations 1975 CSURV Maurer & Lewis, Hash Table Methods 1975 CSURV Mooers, Computer Software and Copyright 1975 CSURV Presser, Multiprogramming Coordination 1975 CSURV Thurber & Wald, Associative and Parallel Processors 1974 CSURV Aho & Johnson, LR Parsing 1974 CSURV Bobrow & Raphael, New Programming Languages for Artificial Intelligence Research 1974 CSURV Brown, Programming and Documenting Software Projects 1974 CSURV Freeman, Computer Processing of Line-Drawing Images 1974 CSURV Kernighan & Plauger, Programming Style: Examples and Counterexamples 1974 CSURV Knuth, Structured Programming with go to Statements 1974 CSURV Nievergelt, Binary Search Trees and File Organization 1974 CSURV Pooch, Translation of Decision Tables 1974 CSURV Severance, Identifier Search Mechanisms: A Survey and Generalized Model 1974 CSURV Sutherland & Sproul & Schumacker, A Characterization of Ten Hidden-Surface Algorithms 1974 CSURV Wirth, On the Composition of Well-Structured Programs 1974 CSURV Yohe, An Overview of Programming Practices 1973 CSURV Baer, A Survey of Some Theoretical Aspects of Multiprocessing 1973 CSURV Brinch Hansen, Concurrent Programming Concepts 1973 CSURV Couger, Evolution of Business System Analysis Techniques 1973 CSURV Horning & Randell, Process Structuring 1973 CSURV Pooch & Nieder, A Survey of Indexing Techniques for Sparse Matrices 1973 CSURV Rosenfeld, Progress in Picture Processing: 1969-71 1973 CSURV Timmreck, Computer Selection Methodology 1973 CSURV White, A Status Report on Computing Algorithms for Mathematical Programming 1972 CSURV Barnes, A Programmer's View of Automata 1972 CSURV Denning, A Note on Paging Drum Efficiency 1972 CSURV Elspas & Levitt & Waldinger & Waksman, An Assessment of Techniques for Proving Program Correctness 1972 CSURV Hoare & Allison, Incomputability 1972 CSURV Holt, Some Deadlock Properties of Computer Systems 1972 CSURV Nievergelt & Farrar, What Machines Can and Cannot Do 1972 CSURV Presser & White, Linkers and Loaders 1972 CSURV Schucany & Shannon & Minton, A Survey of Statistical Packages 1972 CSURV Stutzman, Data Communication Control Procedures 1972 CSURV Wegner, The Vienna Definition Language 1972 CSURV Willoughby, Staffing the MIS Function 1971 CSURV Coffman & Elphick & Shoshani, System Deadlocks 1971 CSURV Denning, Third Generation Computer Systems 1971 CSURV Foster, An Unclever Time-Sharing System 1971 CSURV Ledgard, Ten Mini-Languages: A Study of Topical Issues in Programming Languages 1971 CSURV Lucas, Performance Evaluation and Monitoring 1971 CSURV Martin, Sorting 1971 CSURV Price, Table Lookup Techniques 1971 CSURV van Dam & Rice, On-Line Text Editing: A Survey 1971 CSURV Williams, A Survey of Data Structures for Computer Graphics Systems 1970 CSURV Beech, A Structural View of PL/I 1970 CSURV Chapin, Flowcharting with the ANSI Standard: A Tutorial 1970 CSURV Cohen & Gotlieb, A List Structure Form of Grammars for Syntactic Analysis 1970 CSURV Denning, Virtual Memory 1970 CSURV Dolotta, Functional Specifications for Typewriter-Like Time-Sharing Terminals 1970 CSURV Hellerman & Smith, Throughput Analysis of Some Idealized Input, Output, and Compute Overlap Configurations 1970 CSURV Knuth, Von Neumann's First Computer Program 1970 CSURV MacDougall, Computer System Simulation: An Introduction 1970 CSURV Sedelow, The Computer in the Humanities and Fine Arts 1970 CSURV Smith, A Survey of Interactive Graphical Systems for Mathematics 1970 CSURV Smith, Digital Control of Industrial Processes 1969 CSURV Aron, Information Systems in Perspective 1969 CSURV Dodd, Elements of Data Management Systems 1969 CSURV Glass, An Elementary Discussion of Compiler/Interpreter Writing 1969 CSURV Hoffman, Computers and Privacy: A Survey 1969 CSURV Kent, Assembler-Language Macroprogramming 1969 CSURV McKinney, A Survey of Analytical Time-Sharing Models 1969 CSURV Rosen, Electronic Computers: A Historical Survey 1969 CSURV Rosenfeld, Picture Processing by Computer 1969 CSURV Rosin, Contemporary Concepts of Microprogramming and Emulation 1969 CSURV Rosin, Supervisory and Monitor Systems 1969 CSURV Wilkes, The Growth of Interest in Microprogramming: A Literature Survey 1996 28 CSURVES Brachman & Levesque, Undirected behavior without unbounded search 1996 28 CSURVES Dean, Integrating theory and practice in planning 1996 28 CSURVES Dietterich, Machine learning 1996 28 CSURVES Doyle, Cleaving (unto) artificial intelligence 1996 28 CSURVES Green, Formality helps scalability and robustness 1996 28 CSURVES Grosz, The importance of integration for AI 1996 28 CSURVES Horswill, Integrated systems and naturalistic tasks 1996 28 CSURVES Koller, Structured representations and intractability 1996 28 CSURVES Pereira, Language, computation and artificial intelligence 1996 28 CSURVES Selman, Computational challenges in artificial intelligence 1996 28 CSURVES Shoham, The open scientific borders of AI, and the case of economics 1996 28 CSURVES Shrobe, Two challenging domains 1996 28 CSURVES Swartout, Future directions in knowledge-based systems 1996 28 CSURVES Wellman, The economic approach to artificial intelligence 1996 28 CSURVES Zilberstein, Resource-bounded reasoning in intelligent systems 1996 28 CSURVES Agarwal & Suri, Simple and practical geometric algorithms 1996 28 CSURVES Amato, Equipping CAD/CAM systems with geometric intelligence 1996 28 CSURVES Chen, Developing algorithms and software for geometric path planning problems 1996 28 CSURVES Tollis, Graph drawing and information visualization 1996 28 CSURVES Vitter, Communication issues in large-scale geometric computation 1996 28 CSURVES Cybenko, Large-scope computing: the industrial challenges 1996 28 CSURVES Kalos, Challenges in computational science 1996 28 CSURVES Neves, Thoughts on CSE candidates for industrial positions 1996 28 CSURVES Rice, Computational science as one driving force for all aspects of computing research 1996 28 CSURVES Sullivan, From theory to practice 1996 28 CSURVES Conte, Importance of profiling and compatibility 1996 28 CSURVES Emer, Incremental versus revolutionary research 1996 28 CSURVES Farrens, Distributed decentralized computing 1996 28 CSURVES Grunwald, Embedded, general-purpose, and high-performance systems 1996 28 CSURVES Li, Applications, storage hierarchy, and integration 1996 28 CSURVES Mills, An industrial perspective on computer architecture 1996 28 CSURVES Nagle, Synergy between software and hardware 1996 28 CSURVES Patt, Microarchitecture, compilers and algorithms 1996 28 CSURVES Smith, Multiscalar as a new architecture paradigm 1996 28 CSURVES Wang, Microprocessor architecture challenges---the best is yet to come! 1996 28 CSURVES Wood, Problems, challenges and the importance of performance evaluation 1996 28 CSURVES Yung, The importance of process technology to microarchitecture 1996 28 CSURVES Baeten & Bergstra, Six issues concerning future directions in concurrency research 1996 28 CSURVES Best, Some major dichotomies relating to future research in concurrency 1996 28 CSURVES Cleaveland, Semantic theories and system design 1996 28 CSURVES Gorrieri, On the power of concurrency theory 1996 28 CSURVES Gouda, Network protocols between exact specifications and pragmatic implementations 1996 28 CSURVES Groote, Concurrency theory will set standards for description and analysis of software 1996 28 CSURVES Hoare, Unifying theories: a personal statement 1996 28 CSURVES Luginbuhl, Issues in concurrent systems research 1996 28 CSURVES Miller, Logical foundations for open system design 1996 28 CSURVES Misra, A discipline of multiprogramming 1996 28 CSURVES Moller, Logics for concurrency: structure versus automata 1996 28 CSURVES Montanari, Causal computing 1996 28 CSURVES De Nicola & Smolka, Concurrency: theory and practice 1996 28 CSURVES Prasad, Models for mobile computing agents 1996 28 CSURVES Pratt, Concurrency concepts: an ongoing search 1996 28 CSURVES Sifakis, Research directions for concurrency 1996 28 CSURVES Steffen & Margaria, Method engineering for real-life concurrent systems 1996 28 CSURVES Thomsen, Programming languages, analysis tools, and concurrency theory 1996 28 CSURVES Wolper, Where is the algorithmic support? 1996 28 CSURVES Brodsky, Constraint databases: promising technology or just intellectual exercise? 1996 28 CSURVES Codognet, The virtuality of constraints and the constraints of virtuality 1996 28 CSURVES Dechter, Bucket elimination: a unifying framework for processing hard and soft constraints 1996 28 CSURVES Dincbas, Constraint programming 1996 28 CSURVES Freuder, In pursuit of the holy grail 1996 28 CSURVES Hermenegildo, Some challenges for constraint programming 1996 28 CSURVES Jaffar & Yap, Constraint programming 2000 1996 28 CSURVES Kasif, Towards a constraint-based engineering framework for algorithm design and application 1996 28 CSURVES Mackworth, Constraint-based design of embedded intelligent systems 1996 28 CSURVES McAllester, The rise of nonlinear mathematical programming 1996 28 CSURVES McAloon, Constraint-based programming 1996 28 CSURVES Montanari & Rossi, Constraint solving and programming: what's next? 1996 28 CSURVES Older, CLP (intervals) 1996 28 CSURVES Puget, Future of constraint programming 1996 28 CSURVES Ramakrishnan, Constraints in databases 1996 28 CSURVES Saraswat, Compositional computing 1996 28 CSURVES Smolka, Constraints in OZ 1996 28 CSURVES Van Hentenryck, Constraint programming for combinatorial search problems 1996 28 CSURVES Blakeley, Thoughts on directions in database research 1996 28 CSURVES Dayal, Database technology at a crossroads 1996 28 CSURVES Jajodia, Managing security and privacy of information 1996 28 CSURVES Korth, New focal points for research in database systems 1996 28 CSURVES Lohman, You think your DBMS is complex now...? 1996 28 CSURVES Lomet, A role for research in the database industry 1996 28 CSURVES Maier, Repackaging database systems 1996 28 CSURVES Manola, Transforming the database system into an open service concept 1996 28 CSURVES Ozsu, Future of database systems: changing applications and technological developments 1996 28 CSURVES Ramakrishnan, Some promising directions for database research 1996 28 CSURVES Ramamritham, Application-oriented database support 1996 28 CSURVES Schek, Improving the role of future database systems 1996 28 CSURVES Snodgrass, The inefficiency of misalignment 1996 28 CSURVES Ullman, Moving database theory into database practice 1996 28 CSURVES Widom, Integrating heterogeneous databases: lazy or eager? 1996 28 CSURVES Astrachan, Education goals and priorities 1996 28 CSURVES Bruce, Thoughts on computer science education 1996 28 CSURVES Cupper, A revised curriculum framework 1996 28 CSURVES Denning, Business design of the university 1996 28 CSURVES Drysdale, What should we teach? 1996 28 CSURVES Kelemen, First courses for nonmajors and public understanding of computer science 1996 28 CSURVES McGeoch, Research in the curriculum, and the Web 1996 28 CSURVES Patt, First courses and fundamentals 1996 28 CSURVES Proulx & Rosala, The future of computer science education 1996 28 CSURVES Rada, Calling for a virtual computing college 1996 28 CSURVES Roberts, Directions in computer science education 1996 28 CSURVES Stein, Interactive programming: revolutionizing introductory computer science 1996 28 CSURVES Tucker, Crisis in computer science education 1996 28 CSURVES Adam & Naqvi, Universal access in digital libraries 1996 28 CSURVES Awerbuch, Maximizing gross network product (GNP): resource management on the GII 1996 28 CSURVES Brodsky, Constraint database technology for electronic trade with complex objectives 1996 28 CSURVES Grossman, Database mining challenges for digital libraries 1996 28 CSURVES Johnson, The physics of politics in the information age 1996 28 CSURVES Blaustein & Mccollum & Rosenthal, Flexible security policies for digital libraries 1996 28 CSURVES Neches, The future of electronic commerce: a pragmatic view 1996 28 CSURVES Bennet & Slonim, The electronic commerce position paper 1996 28 CSURVES Wolfson, Infrastructure and cost models for digital libraries 1996 28 CSURVES Wactlar, The next generation electronic library---capturing the experience 1996 28 CSURVES Alur, Next steps in formal verification 1996 28 CSURVES Clarke & Wing, Tools and partial analysis 1996 28 CSURVES Cleaveland, Formality and software design 1996 28 CSURVES German, Research goals for formal methods 1996 28 CSURVES Henzinger, Some myths about formal verification 1996 28 CSURVES Holzmann, On-the-fly model checking 1996 28 CSURVES Jones, Formal methods light 1996 28 CSURVES Peled, User interfaces for formal methods 1996 28 CSURVES Rushby, Enhancing the utility of formal methods 1996 28 CSURVES Sifakis, Safety, security and quality 1996 28 CSURVES Sistla, Hybrid and incremental modelchecking techniques 1996 28 CSURVES Steffen & Margaria, Tools get formal methods into practice 1996 28 CSURVES Wolper, The meaning of "formal" 1996 28 CSURVES Woodcock, Software engineering research directions 1996 28 CSURVES Bryson, Implications of near-real-time three-dimensional interfaces 1996 28 CSURVES Bulterman, Making the technology serve the user 1996 28 CSURVES Catarci, Databases and the Web: new requirements for an easy access 1996 28 CSURVES Citrin, Strategic directions in visual languages research 1996 28 CSURVES Cruz, Tailorable information visualization 1996 28 CSURVES Glinert & Todd & Wise, The adaptive multi-interface multimodal environment 1996 28 CSURVES Grudin, The end of exile 1996 28 CSURVES Hollan, Strategic issues for human-computer interaction 1996 28 CSURVES Ioannidis, Visual user interfaces for database systems 1996 28 CSURVES Jacob, The future of input devices 1996 28 CSURVES John, Evaluating usability evaluation techniques 1996 28 CSURVES Kurlander, Thoughts on user interface processes and agendas 1996 28 CSURVES Myers, Programmability and heuristics in the user interfaces 1996 28 CSURVES Olsen, Computational resources and the Internet 1996 28 CSURVES Shieber, A call for collaborative interfaces 1996 28 CSURVES Shneiderman, Advanced graphic user interfaces: elastic and tightly coupled windows 1996 28 CSURVES Stasko, Future research directions in human-computer interaction 1996 28 CSURVES Strong, Human-centered information systems (HCIS) 1996 28 CSURVES Wittenburg, The WWW information glut: implications for next-generation HCI technologies 1996 28 CSURVES Aksit, Separation and composition of concerns in the object-oriented model 1996 28 CSURVES Black, Object-oriented languages: the next generation 1996 28 CSURVES Cardelli, Bad engineering properties of object-orient languages 1996 28 CSURVES Cointe, Reflective languages and MetaLevel architectures 1996 28 CSURVES Coplien, Broadening beyond objects to patterns and to other paradigms 1996 28 CSURVES Guerraoui, Distributed programming abstractions 1996 28 CSURVES Kiczales, Aspect-oriented programming 1996 28 CSURVES Lea, Specification, architecture, and interoperability 1996 28 CSURVES Lieberherr, From transience to persistence in object-oriented programming: architectures and patterns 1996 28 CSURVES Madsen, Strategic research directions in object-oriented programming 1996 28 CSURVES Magnusson, Technology integration 1996 28 CSURVES Meseguer, Why OOP needs new semantic foundations 1996 28 CSURVES Mossenbock, Trends in object-oriented programming 1996 28 CSURVES Palsberg, Compiler technology for object-oriented languages 1996 28 CSURVES Schmidt, Using design patterns to guide the development of reusable object-oriented software 1996 28 CSURVES Cardelli, Global computation 1996 28 CSURVES Consel, Program adaptation based on program transformation 1996 28 CSURVES Cousot, Program analysis: the abstract interpretation perspective 1996 28 CSURVES Hanus, Integration of declarative paradigms: benefits and challenges 1996 28 CSURVES Le Metayer, Program analysis for software engineering: new applications, new requirements, new tools 1996 28 CSURVES Nielson, Perspectives on program analysis 1996 28 CSURVES Odersky, Challenges in type systems research 1996 28 CSURVES Paige, Future directions in program transformations 1996 28 CSURVES Pettorossi & Proietti, Future directions in program transformation 1996 28 CSURVES Reynolds, Beyond ML 1996 28 CSURVES Riecke, Semantics: the description of computational structures 1996 28 CSURVES Ryder, The future of program analysis 1996 28 CSURVES Schmidt, On the need for a popular formal semantics 1996 28 CSURVES Volpano, Provably secure programming languages for remote evaluation 1996 28 CSURVES Wilhelm, Program analysis---a toolmaker's perspective 1996 28 CSURVES Burns, Broadening real-time systems research 1996 28 CSURVES Jeffay, Technical and educational challenges for real-time computing 1996 28 CSURVES Jones, Consumer real-time systems 1996 28 CSURVES Koob, Large-scale distributed real-time systems 1996 28 CSURVES Lee, Formal verification, testing and checking of real-time systems 1996 28 CSURVES Lehoczky, Analytical methods for real-time computing 1996 28 CSURVES Liu, Validation of timing properties 1996 28 CSURVES Mok, Firm real-time systems 1996 28 CSURVES Ramamritham, Predictability: demonstrating real-time properties 1996 28 CSURVES Sha, Real-time in the real world 1996 28 CSURVES Stankovic, The pervasiveness of real-time computing 1996 28 CSURVES van Tilborg, Real-time research in the department of defense 1996 28 CSURVES Abowd, Software engineering and programming language considerations for ubiquitous computing 1996 28 CSURVES Chambers, Towards reusable, extensible components 1996 28 CSURVES Clarke & Tarr, New functionality for programming languages 1996 28 CSURVES Griswold & Wolski & Baden & Fink & Kohn, Programming language requirements for the next millennium 1996 28 CSURVES Harper & Lee, Research in programming languages for composability, safety, and performance 1996 28 CSURVES Hudak, Building domain-specific embedded languages 1996 28 CSURVES Kamin, The challenge of language technology transfer 1996 28 CSURVES Moore, Representation issues for reengineering interactive systems 1996 28 CSURVES Palsberg, Software evolution and integration 1996 28 CSURVES Scherlis, Beyond coding 1996 28 CSURVES Wileden, Programming languages and software engineering: past, present and future 1996 28 CSURVES Clarke, How do we improve software quality and how do we show that it matters? 1996 28 CSURVES DeMillo, Mission-critical applications, commercial value and software quality 1996 28 CSURVES McKeeman, Separating concerns in software quality 1996 28 CSURVES Miller, Getting quality methods into practice 1996 28 CSURVES Choudhary & Kotz, Large-scale file systems with the flexibility of databases 1996 28 CSURVES Cormen & Goodrich, A bridging model for parallel computation, communication, and I/O 1996 28 CSURVES Gibson & Wilkes, Self-managing network-attached storage 1996 28 CSURVES Muntz & Pasquale, System-level design issues for storage I/O 1996 28 CSURVES Satyanarayanan & Ellis, Adaptation: the key to mobile I/O 1996 28 CSURVES Vengroff & Vitter, I/O-efficient algorithms and environments 1996 28 CSURVES Green, The impact of the Web on networking research 1996 28 CSURVES Kurose, Future directions in networking research 1996 28 CSURVES Pasquale, Towards internet computing 1996 28 CSURVES Angluin, A 1996 snapshot of computational learning theory 1996 28 CSURVES Fich, Infrastructure issues related to theory of computing research 1996 28 CSURVES Goldreich & Wigderson, Theory of computing: a scientific perspective 1996 28 CSURVES Harper & Mitchell, ML and beyond 1991 CTCS Burroni, Higher Dimensional Word Problem 1991 CTCS Coquand, A Direct Proof of the Intuitionistic Ramsey Theorem 1993 CTCURR Arvind & Han & Hemachandra & Kobler & Lozano & Mundhenk & Ogiwara & Schoening & Silvestri & Thierauf, Reductions to Sets of Low Information Content 1993 CTCURR Belanger & Wang, On Average P vs. Average NP 1993 CTCURR Book, Additional Queries and Algorithmically Random Languages 1993 CTCURR Buhrman & Spaan & Torenvliet, Bounded Reductions 1993 CTCURR Cai & Hemachandra & Vyskoc, Promise Problems and Guarded Access to Unambiguous Computation 1993 CTCURR Condon, The Complexity of Space Bounded Interactive Proof Systems 1993 CTCURR Downey & Fellows, Fixed Parameter Tractability and Completeness 1993 CTCURR Kummer, Degrees of Unsolvability in Abstract Complexity Theory 1993 CTCURR Lozano & Toran, On the Non-Uniform Complexity of the Graph Isomorphism Problem 1993 CTCURR Meinel & Waack, Upper and Lower Bounds for Certain Graph Accessibility Problems on Bounded Alternating omega-Branching Programs 1993 CTCURR Tromp & van Emde Boas, Associative Storage Modification Machines 1996 CTOMW Atkinson, The Complexity of Algorithms 1996 CTOMW Bundy, Prospects for Artificial Intelligence 1996 CTOMW Davenport, Computer Science and Mathematics 1996 CTOMW Hoare, Algebra and Models 1996 CTOMW Milner, Semantic Ideas in Computing 1996 CTOMW Needham, Computers and Communications 1990 CTRETRO Selman, Introduction 1990 CTRETRO Stearns, Juris Hartmanis: The Beginnings of Computational Complexity 1990 CTRETRO Borodin, Juris Hartmanis: Building a Department--Building a Discipline 1990 CTRETRO Young, Juris Hartmanis: Fundamental Contributions to Isomorphism Problems 1990 CTRETRO Immerman & Lander, Describing Graphs: A First-Order Approach to Graph Canonization 1990 CTRETRO Joseph & Young, Self-Reducibility: Effects of Internal Structure on Computational Complexity 1990 CTRETRO Kurtz & Mahaney & Royer, The Structure of Complete Degrees 1990 CTRETRO Li & Vitanyi, Applications of Kolmogorov Complexity in the Theory of Computation 1990 CTRETRO Schoening, The Power of Counting 1992 3 CTRS Meinke, Algebraic Semantics of Rewriting Terms and Types 1992 3 CTRS Padawitz, Generic Induction Proofs 1992 3 CTRS Plaisted & Alexander & Chu & Lee, Conditional Term-Rewriting and First-Order Theorem Proving 1992 3 CTRS Dershowitz, Semigroups Satisfying x^{m+n} = x^n 1992 3 CTRS Pacholski, Decidability of Finiteness Properties 1983 3 CTVLSI Leiserson & Saxe, Optimizing Synchronous Circuitry by Retiming 1995 CUMMINGS Allen, Natural Language Understanding, Second Edition 1995 CUMMINGS Smith, IBM Smalltalk: The Language 1995 CUMMINGS Pohl, C++ for Pascal Programmers, Second Edition 1995 CUMMINGS Sobell, A Practical Guide to the UNIX System, Third Edition 1994 CUMMINGS Almasi & Gottlieb, Highly Parallel Computing, Second Edition 1994 CUMMINGS Kumar & Grama & Gupta & Karypis, Introduction to Parallel Computing: Design and Analysis of Algorithms 1994 CUMMINGS Almasi & Gottlieb, Highly Parallel Computing, Second Edition 1994 CUMMINGS Brookshear, Computer Science: An Overview, Fourth Edition 1991 CUMMINGS Andrews, Concurrent Programming: Principles and Practice 1991 CUMMINGS Fischer & LeBlanc, Crafting a Compiler with C 1991 CUMMINGS Moret & Shapiro, Algorithms from P to NP, Volume I: Design & Efficiency 1991 CUMMINGS Brookshear, Computer Science: An Overview, Third Edition 1989 CUMMINGS Almasi & Gottlieb, Highly Parallel Computing 1988 CUMMINGS Gould, Graph Theory 1987 CUMMINGS Townsend, Discrete Mathematics: Applied Combinatorics and Graph Theory 1996 CUP Sundaram, A First Course in Optimization Theory 1996 CUP Wand & Milner (Eds.), Computing Tomorrow: Future Research Directions in Computer Science 1996 CUP Applebaum, Probability and Information: An Integrated Approach 1996 CUP Plaskota, Noisy Information and Computational Complexity 1996 CUP Schoone, Protocols by Invariants 1996 CUP Manzano, Extensions of First Order Logic 1996 CUP Sachkov, Combinatorial Methods in Discrete Mathematics 1996 CUP Cooper & Slaman & Wainer (Eds.), Computability, Enumerability, Unsolvability: Directions in Recursion Theory 1995 CUP Krajicek, Bounded Arithmetic, Propositional Logic, and Complexity Theory 1995 CUP Meyer & van der Hoek, Epistemic Logic for AI and Computer Science 1995 CUP Rowlinson (Ed.), Surveys in Combinatorics, 1995 (London Mathematical Society Lecture Note Series. 218) 1995 CUP Sharir & Agarwal, Davenport-Schinzel Sequences and their Geometric Applications 1995 CUP Desel & Esparza, Free Choice Petri Nets 1995 CUP Motwani & Raghavan, Randomized Algorithms 1994 CUP Kalicharan, C by Example 1994 CUP Skillicorn, Foundations of Parallel Programming 1994 CUP Paris, The Uncertain Reasoner's Companion: A Mathematical Perspective 1994 CUP Shankar, Metamathematics, Machines, and Godel's Proof 1994 CUP Tel, Introduction to Distributed Algorithms 1994 CUP Fountain, Parallel Computing: Principles and Practice 1994 CUP Velleman, How To Prove It: A Structured Approach 1994 CUP Cameron, Combinatorics: Topics, Techniques, Algorithms 1994 CUP Lidl & Niederreiter, Introduction to Finite Fields and Their Applications, Revised Edition 1993 CUP Goldberg, Efficient Algorithms for Listing Combinatorial Structures 1993 CUP Booth, Communicating in Science: Writing a Scientific Paper and Speaking at Scientific Meetings 1993 CUP Gibbons & Spirakis (Eds.), Lectures on Parallel Computation 1993 CUP Ambos-Spies & Homer & Schoning (Eds.), Complexity Theory: Current Research 1993 CUP Walker (Ed.), Surveys in Combinatorics, 1993 1993 CUP Welsh, Complexity: Knots, Colourings and Counting 1993 CUP Hodges, Model Theory 1992 CUP Yockey, Information Theory and Molecular Biology 1992 CUP Lyuu, Information Dispersal and Parallel Computation 1992 CUP Paterson (Ed.), Boolean Function Complexity 1992 CUP Hoggar, Mathematics for Computer Graphics 1992 CUP Feijs & Jonkers, Formal Specification and Design 1992 CUP Risler, Mathematical Methods for CAD 1992 CUP Press & Teukolsky & Vetterling & Flannery, Numerical Recipes in C: The Art of Scientific Computing, Second Edition 1992 CUP Press & Teukolsky & Vetterling & Flannery, Numerical Recipes in C: The Art of Scientific Computing, Second Edition 1992 CUP Anthony & Biggs, Computational Learning Theory: An Introduction 1991 CUP Olderog, Nets, Terms and Formulas: Three Views of Concurrent Processes and Their Relationship 1991 CUP Agarwal, Intersection and Decomposition Algorithms for Planar Arrangements 1991 CUP Brualdi & Ryser, Combinatorial Matrix Theory 1991 CUP Eells, Probabilistic Causality 1990 CUP Howson & Kahane (Eds.), The Popularization of Mathematics 1990 CUP Bruce & Giblin & Rippon, Microcomputers and Mathematics 1990 CUP Luey, Handbook for Academic Authors, Revised Edition 1990 CUP Partridge & Wilks (eds.), The Foundations of Artificial Intelligence: A Sourcebook 1989 CUP Humphreys & Prest, Numbers, Groups and Codes 1989 CUP Press & Flannery & Teukolsky & Vetterling, Numerical Recipes in Pascal: The Art of Scientific Computing 1988 CUP Sainsbury, Paradoxes 1988 CUP Spivey, Understanding Z: A Specification Language and Its Formal Semantics 1988 CUP Gibbons & Rytter, Efficient Parallel Algorithms 1988 CUP Cutland (ed.), Nonstandard Analysis and its Applications 1987 CUP Chapman, LR Parsing 1987 CUP Chaitin, Algorithmic Information Theory 1987 CUP Paulson, Logic and Computation: Interactive Proof with Cambridge LCF 1986 CUP Bollobas, Combinatorics: Set Systems, Hypergraphs, Families of Vectors, and Combinatorial Probability 1986 CUP Lidl & Niederreiter, Introduction to Finite Fields and their Applications 1986 23 CUP Allison, A Practical Introduction to Denotational Semantics 1986 23 CUP Hindley & Seldin, Introduction to Combinators and lambda-Calculus 1986 CUP Jech, Multiple Forcing 1985 CUP Gibbons, Algorithmic Graph Theory 1985 CUP Burn, Groups: A Path to Geometry 1984 CUP Tutte, Graph Theory 1973 CURRENTS Book, Topics in Formal Language Theory 1973 CURRENTS Borodin, Computational Complexity: Theory and Practice 1973 CURRENTS Manna, Program Schemas 1973 CURRENTS Thatcher, Tree Automata: An Informal Survey 1973 CURRENTS Ullman, Applications of Language Theory to Compiler Design 1994 56 CVGIP Cole & Vishkin, On the Detection of Robust Curves 1994 56 CVGIP Wenqi & Gang-qiang, A Quasi-mechanical Method for Solving the Rectangle Covering Problem--An Approach to Tackling NP Hard Problems 1992 56 CVGIP Ballard & Brown, Principles of Animate Vision 1993 55 CVGIP Sugihara, Approximation of Generalized Voronoi Diagrams by Ordinary Voronoi Diagrams 1993 55 CVGIP Herman, Oriented Surfaces in Digital Spaces 1993 55 CVGIP Sharaiha & Christofides, An Optimal Algorithm for the Straight Segment Approximation of Digital Arcs 1992 54 CVGIP De Floriani & Puppo, An On-Line Algorithm for Constrained Delaunay Triangulation 1990 51 CVGIP Lee & Rosenfeld, Simple Connectivity Is Not Locally Computable for Connected 3D Images 1990 50 CVGIP Shaffer & Samet, Set Operations for Unaligned Linear Quadtrees 1986 CVGIP Rosenfeld, Survey: Picture Processing: 1985 1997 59 CVGIPGMIP Pikaz & Averbuch, An Efficient Topological Characterization of Gray-Levels Textures, Using a Multiresolution Representation 1995 57 CVGIPGMIP Oishi & Sugihara, Topology-Oriented Divide-and-Conquer Algorithm for Voronoi Diagrams 1994 56 CVGIPGMIP Karl & Verghese & Willsky, Reconstructing Ellipsoids from Projections 1993 55 CVGIPGMIP Caglioti, On the Uncertainty of Straight Lines in Digital Images 1991 53 CVGIPGMIP Wuthrich & Stucki, An Algorithmic Comparison between Square- and Hexagonal-Based Grids 1991 53 CVGIPGMIP Banerjee & Mount & Rosenfeld, Pyramid Computation of Neighbor Distance Statistics in Dot Patterns 1995 62 CVGIPIU Dehne & Rau-Chaplin & Ferreira, Hypercube Algorithms for Parallel Processing of Pointer-Based Quadtrees 1995 62 CVGIPIU Rosenfeld, Image Analysis and Computer Vision: 1994 1995 61 CVGIPIU Chung & Lin, Hough Transform on Reconfigurable Meshes 1995 61 CVGIPIU Nicol, A Systolic Approach for Real Time Connected Component Labeling 1995 61 CVGIPIU Yu & Berthod, A Game Strategy Approach for Image Labeling 1995 61 CVGIPIU Bongiovanni & Crescenzi & Guerra, Parallel Simulated Annealing for Shape Detection 1995 61 CVGIPIU Latecki & Eckhardt & Rosenfeld, Well-Composed Sets 1994 59 CVGIPIU Kasif, Optimal Parallel Algorithms for Quadtree Problems 1992 55 CVGIPIU Rosenfeld, Image Analysis and Computer Vision: 1991 1991 54 CVGIPIU Kanatani, Computational Projective Geometry 1986 4 CWIMONOGS Lenstra, Codes from Algebraic Number Fields 1986 4 CWIMONOGS Schrijver, Geometric Methods in Discrete Optimization 1986 4 CWIMONOGS Vitanyi, Archirithmics or Algotecture? 1986 1 CWIMONOGS Jones, Systematic Program Development 1986 1 CWIMONOGS Lovasz, Algorithmic Aspects of Some Notions in Classical Mathematics 1986 1 CWIMONOGS Schwartz, Problems and Perspectives in Robotics 1986 1 CWIMONOGS Bergstra & Klop, Algebra of Communicating Processes 1986 1 CWIMONOGS Lenstra, Primality Testing 1986 1 CWIMONOGS Meertens, Algorithmics 1990 3 CWIQUART Kissin, Models of Multiswitch Energy 1988 1 CWIQUART Smorynski, Hilbert's Programme 1995 4 CWITA Youssef & Tavares, Information Leakage of a Randomly Selected Boolean Function 1995 4 CWITA Aakvaag & Lacaze & Duverdier, On the Use of Periodic Timebase Companding in the Scrambling of Stationary Processes 1995 4 CWITA Battail, On Random-like Codes 1995 4 CWITA Guinand & Lodge & Papke, An Alternative Approach to the Design of Interleavers for Block ``Turbo'' Codes 1995 4 CWITA Gravel & Drolet & Rozon, Improved VLSI Design for Decoding Concatenated Codes Comprising an Irreducible Cyclic Code and a Reed-Solomon Code 1995 4 CWITA Lee & Kschischang, Non-Minimal Trellises for Linear Block Codes 1995 4 CWITA Esmaeili & Gulliver & Secord, Trellis Complexity of Linear Block Codes via Atomic Codewords 1993 3 CWITA Blake & Gao & Lambert, Constructive Problems for Irreducible Polynomials over Finite Fields 1993 3 CWITA Polemi & Sakkalis, Singular Algebraic Curves over Finite Fields 1993 3 CWITA Zarowski, A Divisionless Form of the Schur Berlekamp-Massey Algorithm 1993 3 CWITA Sablatash, Error-Control Coding, Modulation and Equalization for All-Digital Advanced Television: State of the Art and Future Possibilities 1993 3 CWITA Drolet, A Finite Field Arithmetic Unit VLSI Chip 1993 3 CWITA Hendessi & Aref, A Successful Attack against the DES 1992 87 CWITRACT Monna, The Way of Mathematics and Mathematicians: From Reality Towards Fiction 1991 78 CWITRACT Kindervater, Exercises in Parallel Combinatorial Computing 1989 65 CWITRACT de Weger, Algorithms for Diophantine Equations 1988 51 CWITRACT van Laarhoven, Theoretical and Computational Aspects of Simulated Annealing 1987 43 CWITRACT Bodlaender, Distributed Computing: Structure and Complexity 1987 39 CWITRACT van Damme, Equilibria in Noncooperative Games 1987 39 CWITRACT Jansen, Equilibrium Points of Bimatrix Games 1987 39 CWITRACT Borm, Games with Incomplete Information 1987 39 CWITRACT Vrieze, Zero-Sum Stochastic Games 1987 39 CWITRACT Thuijsman, Non-Zerosum Stochastic Games 1987 39 CWITRACT Wakker, From Decision Making under Uncertainty to Game Theory 1987 39 CWITRACT Driessen, The Core of a Cooperative Game: Bounds and Characterizations 1987 39 CWITRACT Driessen, The tau-Value: A Survey 1987 39 CWITRACT Derks, On the Extreme Elements of the Class of (0,1)-Normalized Superadditive Games 1987 39 CWITRACT Curiel, Combinatorial Games 1987 39 CWITRACT Potters, Linear Optimalization Games 1987 39 CWITRACT Peters, Nonsymmetric Nash Bargaining Solutions 1987 39 CWITRACT Storcken, Some Social Choice Problems 1990 33 CYBERNETICA Ma & Li, Direct Limits of Hierarchies of General Systems 1990 33 CYBERNETICA Stuart, Reciprocal Causality and Self-Organizing Systems 1989 32 CYBERNETICA Brunet, Information Theory and Thermodynamics--A Theory of Communication 1987 30 CYBERNETICA Reader, The Memory Channel Machine: Part of a Proposed Learning Machine 1994 29 CYBERNETICS Knyazev & Svirshcheva, Reduction of Boolean Function to Minimal Orthogonal Form 1994 29 CYBERNETICS Kotlyar, On the Packing Density of a Fuzzy Set 1994 29 CYBERNETICS Borisenko, Sufficient Equivalence Condition for n-Tape Automata 1994 29 CYBERNETICS Moldovyan & Moldovyan, New Design Principle for Cryptographic Modules in Computer Security Systems 1994 29 CYBERNETICS Lozovanu, Strongly Polynomial Algorithms for Finding Minimax Paths in Networks and Solution of Cyclic Games 1994 29 CYBERNETICS Diduk, Uncertainty Theory: Purpose, First Results, Prospects. II 1994 29 CYBERNETICS Belousov, On Some Necessary Conditions for the Parallel Application of Substitution Systems 1994 29 CYBERNETICS Pshenichnyi & Kirik, Optimal Network-Flow-Distribution Algorithms 1994 29 CYBERNETICS Diduk, Uncertainty Theory: Purpose, First Results, and Prospects 1993 29 CYBERNETICS Tseitlin, Design of Symbolic-Processing Algorithms 1993 29 CYBERNETICS Lisovik, Problems of Inclusion and Equivalence for Program Schemata and Formal Languages 1993 29 CYBERNETICS Stavrovskii & Pavliv, DM-Automata and Classes of Context-Free Languages 1993 29 CYBERNETICS Tsvetkov, Development of Inductive Inference Algorithms Using Decision Trees 1993 28 CYBERNETICS Sevast'yanov, A Polynomial-Time Open-Shop Problem with an Arbitrary Number of Machines 1993 28 CYBERNETICS Kozhevnikova & Oleshko, An Information Technology for Efficiency Analysis of Recursive Algorithms using Standard Complexity Recurrences 1993 28 CYBERNETICS Meitus, Decidability of the Equivalence Problem for Deterministic Pushdown Automata 1993 28 CYBERNETICS Romov, Maximal Local Classes of Partial Functions of Infinite-Valued Logic 1993 28 CYBERNETICS Stoikova & Marchuk, Exact Bounds on Failure Probability in the ``Strength-Load'' Model with Incomplete Information 1993 28 CYBERNETICS Grinchenko, Hypertext: A New Information Technology 1993 28 CYBERNETICS Vyzhikovskii & Elfimova & Kanevskii, Systolic Array Implementation of Some Iterative Algorithms for Solving Systems of Linear Algebraic Equations 1993 28 CYBERNETICS Rystsov, Rank of a Finite Automaton 1993 28 CYBERNETICS Vinokur, Huffman Codes and Maximizing Properties of Fibonacci Numbers 1992 28 CYBERNETICS Borodyanskii, Nonalgorithmic Discrete Procedures 1992 28 CYBERNETICS Karzanov, A Fast Algorithm for Determining the Distances of the Points of a Given Set in an Integral Lattice from Its Complement 1992 28 CYBERNETICS Parshina, Satisfiability Problem: Some Polynomial Classes of Conjunctive Normal Forms 1992 28 CYBERNETICS Voitishin & Sharkovskaya, Algorithm for the Vertex Packing Problem 1992 27 CYBERNETICS Vasilakos & Haritsis & Batistatos, Isarithmic Flow Control Using Learning Automata 1992 27 CYBERNETICS Chebotarev, Interacting Automata 1992 27 CYBERNETICS Vinokur & Kozhevnikova, Complexity Analysis of Algorithms by Recognition of Their Classification Properties 1992 27 CYBERNETICS Galitsyn & Lavinskii, Combinatorial Compression Algorithms for Ordered Record Sequences 1992 27 CYBERNETICS Voitshin, Algorithms to Find the Maximum Set of Pairwise Incomparable Weighted Vertices in a Directed Acyclic Graph 1992 27 CYBERNETICS Rystsov, Bounds for Parallel Addition Time of Two Numbers 1992 27 CYBERNETICS Ol'man & Salum, Bound on Maximum Structural Complexity of Systems 1992 27 CYBERNETICS Koganov, Coding and Counting Spanning Trees in Kleitman-Golden Graphs 1992 27 CYBERNETICS Alekseev, A Method of Constructing Minimal Failure Cuts 1992 27 CYBERNETICS Krivoi, Algorithms for Minimization of Finite Acyclic Automata and Pattern Matching in Terms 1992 27 CYBERNETICS Borisenko, Sufficient Conditions of Equivalence of Three-Tape Automata 1992 27 CYBERNETICS Markosyan & Gasparyan, LSI Channel Routing Algorithms 1992 27 CYBERNETICS Aizenberg, A Universal Logic Element over the Complex Field 1991 27 CYBERNETICS Lisovik, An Undecidable Problem for Countable Markov Chains 1991 27 CYBERNETICS Nasyrov, Deterministic Realization of Nondeterministic Computations with a Low Measure of Nondeterminism 1991 27 CYBERNETICS Apolloni, Testable Heuristics for the 0-1 Knapsack Problem 1991 27 CYBERNETICS Trubin, Strength and Reinforcement of a Network and Tree Packing 1991 27 CYBERNETICS Gndoyan & Trubin, Some Classes of Location Problems for Trees on a Chain 1991 27 CYBERNETICS Kuzichev, Paraconsistent Intelligent Systems of Computer Logics 1991 27 CYBERNETICS Terebenkov, NP-Completeness of Maximum-Cut and Cycle-Covering Problems for a Planar Graph 1991 27 CYBERNETICS Nezhentsev, Optimal Representation of Cycles in Arithmetic Graphs 1991 27 CYBERNETICS Kanevskii & Korchev, Mapping the Index Set of Algorithm Variables to a Systolic Structure 1991 26 CYBERNETICS Sotskov, Complexity of Optimal Scheduling Problems with Three Jobs 1991 26 CYBERNETICS Rystsov, Weak Equivalence of Automata 1991 26 CYBERNETICS Burgin, Generalized Kolmogorov Complexity and Other Dual Complexity Measures 1991 26 CYBERNETICS Drobushevich & Zubovich, Automatic Verification of Functional Programs 1991 26 CYBERNETICS Gostev, Data Structures as Sets with Repeating Elements 1991 26 CYBERNETICS Timkovskii & Knyazeva, Decidable, Polynomial-Time, and NP-Complete Cases of the Isotone Bipartite Graph Problem 1991 26 CYBERNETICS Zabello, An Improved Merging Algorithm Using a Minimum Number of Comparisons 1991 26 CYBERNETICS Shmerko & Yanushkevich, Algorithms of Boolean Differential Calculus for Systolic Processors 1991 26 CYBERNETICS Vyzhikovski & Kanevskii, Formalized Design of Systolic Processors: The Example of Processors for Triangular Decomposition of Symmetrical Matrices 1991 26 CYBERNETICS Smal'yakov, Existence of Solutions in Zero-Sum Differential Games 1990 26 CYBERNETICS Dunaev, A Mathematical Model of Evolution of Biological Populations 1989 25 CYBERNETICS Tseitlin, Parallelization of Sorting Algorithms 1990 25 CYBERNETICS Timkovskii, Complexity of Common Subsequence and Supersequence Problems and Related Problems 1990 25 CYBERNETICS Meitus, The Equivalence Problem for Real-Time Strict Deterministic Pushdown Automata 1990 25 CYBERNETICS Levin, The Dynamics of Digital Circuits with Memory for Ternary Signals 1990 25 CYBERNETICS Panchuk & Garbovskii, Matrix Representation of Continued Fractions and Its Use in Parallel Computation Algorithms 1990 25 CYBERNETICS Ablaev, Comparative Complexity of the Representation of Languages by Probabilistic Automata 1990 25 CYBERNETICS Anisimov & Shidlovskii, Concurrency Methods for the Dictionary Problem: A Survey 1990 25 CYBERNETICS Dravtsov & Sherman, Solution of Combinatorial Optimization Problems with Minimax Criterion 1989 25 CYBERNETICS Nenakhov & Primak, Efficiency of the Dual Simplex Method for Solving Systems of Linear Inequalities 1989 25 CYBERNETICS Kanivets, Algorithmic Solvability of Comparison Problems for Finitely Ambiguous Sequence Transducers on Superwords 1989 25 CYBERNETICS Godlevskii & Kapitonova & Krivoi & Letichevskii, Iterative Methods of Program Analysis 1989 25 CYBERNETICS Shramchenko, Application of the Graph Planarity Test in Computer-Aided Circuit Design 1989 25 CYBERNETICS Roshchin & Semenova & Sergienko, Solution and Investigation of One Class of Inexact Integer Programming 1989 25 CYBERNETICS Shiryaev, Unsolvability of Some Algorithmic Problems for Straight-Line Programs 1988 24 CYBERNETICS Lavrik, Graph Algorithmic Algebra 1988 24 CYBERNETICS Rystsov, Parallel Complexity of Algebraic Operations 1988 24 CYBERNETICS Mikhalevich & Volkovich & Kolenov, An Algorithm for Coordination of Solutions in a Distributed System of Interdependent Problems with Linear Models 1988 24 CYBERNETICS Nepomnyashchii & Shilov, Nondeterministic Program Schemata and Their Relation to Dynamic Logic 1988 24 CYBERNETICS Lisovik, Reversal-Bounded Multicounter Sigma-Machines 1988 24 CYBERNETICS Zabello, Methods of Merger of Two Ordered Subfiles of Different Length 1988 24 CYBERNETICS Vardanyan, The Complexity of Dynamic Tests for Functions of k-Valued Logic 1988 24 CYBERNETICS Dushin, An Algorithm for the Solution of the Two-Route Johnson Problem 1988 24 CYBERNETICS Mart'yanov & Kharmeev & Yakovlev, Implementation of Proof Schemes in the Method of Invariant Transformations 1988 24 CYBERNETICS Timkovskii, Some Recognition Problems Related to Graph Isomorphism 1988 24 CYBERNETICS Varakin & Danil'chenko & Panishev, Assignment of Jobs to Processors in a Two-Level System 1988 23 CYBERNETICS Tyshkevich & Chernyak & Chernyak, Graphs and Degree Sequences. I 1988 23 CYBERNETICS Gorshkov & Arkhangel'skii, Formalization of the Concept of Multitape Automaton 1988 23 CYBERNETICS Golunkov, Approximate Completeness in Algebras of Partial Recursive Functions and Predicates 1988 23 CYBERNETICS Barzdin' & Brazma & Kinber, Inductive Synthesis of Programs: State of the Art, Problems, Prospects 1988 23 CYBERNETICS Anisimov & Oleshchuk, Church-Rosser Systems with Respect to Formal Languages 1988 23 CYBERNETICS Nigmatullin, Exponential Lower Bounds of Complexity and Step-by-Step Simulation Circuits 1987 23 CYBERNETICS Karzanov, Maximum Matching of Given Weight in Complete and Complete Bipartite Graphs 1987 23 CYBERNETICS Lisovik, Algorithmic Questions for Real Functions 1987 23 CYBERNETICS Korolev, Algorithm to Determine Graph Isomorphism on the Basis of Their Transformation with the Connectedness Component Taken into Account 1987 23 CYBERNETICS Cherkasskii, New Algorithm for Generation of Spanning Trees 1986 22 CYBERNETICS Anisimov, Local Optimization of Colorings of Graphs 1986 22 CYBERNETICS Vinokur, Huffman Trees and Fibonacci Numbers 1986 22 CYBERNETICS Alberts, Possibilities of Various Types of Alternating Automata 1986 22 CYBERNETICS Godlevskii & Krivoi, Transformation Synthesis of Efficient Algorithms with Auxiliary Specifications 1986 22 CYBERNETICS Kapitonova & Mishchenko, Logical Design of Standardized Automata. II 1983 18 CYBERNETICS Gershovich & Shor, Method of Ellipsoids, Its Generalizations and Applications 1981 16 CYBERNETICS Romanovskii, Equivalence Problem for Real-Time Strict Deterministic Pushdown Automata 1973 6 CYBERNETICS Valiev, Certain Estimates of the Time of Computations on Turing Machines with an Input 1997 74 DAMATH Aigner, Finding the Maximum and Minimum 1997 74 DAMATH Felsner & Muller & Wernisch, Trapezoid Graphs and Generalizations, Geometry and Algorithms 1997 74 DAMATH Lai & Wei, Bipartite Permutation Graphs with Application to the Minimum Buffer Size Problem 1997 74 DAMATH Peleg & Wool, The Availability of Crumbling Wall Quorum Systems 1997 74 DAMATH Liu & Mullen, Irreducible Polynomials and Linear Recurring Arrays 1997 73 DAMATH Lamb & Asher & Woodall, Bond Graphs III: Bond Graphs and Electrical Networks 1997 73 DAMATH Parberry, An Efficient Algorithm for the Knight's Tour Problem 1997 73 DAMATH Shigeno & Iwata, A Cost-Scaling Algorithm for 0-1 Submodular Flows 1997 73 DAMATH Vakharia & Catay, Two Machine Openshop Scheduling with Machine-dependent Processing Times 1997 73 DAMATH Chernyak & Chernyak, Note on Complexity of Computing the Domination of Binary Systems 1997 73 DAMATH Honkala, A Decision Method for Parikh Slenderness of Context-free Languages 1997 73 DAMATH Gambosi & Protasi & Talamo, Preserving Approximation in the Min-Weighted Set Cover Problem 1997 73 DAMATH Melkman & Shimony, A Note on Approximate Inclusion-Exclusion 1997 73 DAMATH Cai & Schieber, A Linear-Time Algorithm for Computing the Intersection of All Odd Cycles in a Graph 1997 73 DAMATH Romanik, Directed Rectangle-Visibility Graphs Have Unbounded Dimension 1997 73 DAMATH O'Connor, Nondegenerate Functions and Permutations 1997 73 DAMATH Bollobas & Brightwell, Random Walks and Electrical Resistances in Products of Graphs 1997 73 DAMATH Chvatal, Resolution Search 1997 72 DAMATH Zhang, A New Version of On-line Variable-sized Bin Packing 1997 72 DAMATH Hwang & Yao & Grammatikakis, A d-Move Local Permutation Routing for the d-Cube 1997 72 DAMATH Everett & Klein & Reed, An Algorithm for Finding Homogeneous Pairs 1997 72 DAMATH Park & Park, Lifting Cover Inequalities for the Precedence-constrained Knapsack Problem 1997 72 DAMATH Agnetis & Parriarelli & Rossi, Batch Scheduling in a Two-machine Flow Shop with Limited Buffer 1997 72 DAMATH Bampis & Guinand & Trystram, Some Models for Scheduling Parallel Programs with Communication Delays 1997 72 DAMATH Bianco & Blazewicz & Dell'Olmo & Drozdowski, Linear Algorithms for Preemptive Scheduling of Multiprocessor Tasks Subject to Minimal Lateness 1997 72 DAMATH Brucker & Hurink & Werner, Improving Local Search Heuristics for Some Scheduling Problems. Part II 1997 72 DAMATH Dell'Olmo & Speranza & Tuza, Comparability Graph Augmentation for Some Multiprocessor Scheduling Problems 1997 72 DAMATH Gallo & Piccinonno, b9000A 1/4 Approximate Algorithm for P2/tree/Cmax 1997 72 DAMATH Hochbaum & Landy, Scheduling with Batching: Two Job Types 1997 72 DAMATH Jurisch & Kubiak & Jozefowska, Algorithms for Minclique Scheduling Problems 1997 72 DAMATH Orman & Potts, On the Complexity of Coupled-Task Scheduling 1997 72 DAMATH Schaffter, Scheduling with Forbidden Sets 1997 72 DAMATH Steiner, Minimizing the Number of Tardy Jobs with Precedence Constraints and Agreeable Due Dates 1997 72 DAMATH von Arnim & Schulz, Facets of the Generalized Permutahedron of a Poset 1996 71 DAMATH Akkiraju & Edelsbrunner, Triangulating the Surface of a Molecule 1996 71 DAMATH Atkins & Middendorf, On Physical Mapping and the Consecutive Ones Property for Sparse Matrices 1996 71 DAMATH Bafna & Narayanan & Ravi, Nonoverlapping Local Alignments (Weighted Independent Sets of Axis-parallel Rectangles) 1996 71 DAMATH Bodlaender & de Fluiter, On Intervalizing k-colored Graphs for DNA Physical Mapping 1996 71 DAMATH Boneh & Dunworth & Lipton & Sgall, On the Computational Power of DNA 1996 71 DAMATH Dress & Huson & Moulton, Analyzing and Visualizing Sequence and Distance Data Using SplitsTree 1996 71 DAMATH Goldberg & Goldberg & Phillips & Sweedyk & Warnow, Minimizing Phylogenetic Number to Find Good Evolutionary Trees 1996 71 DAMATH Hannenhalli, Polynomial-Time Algorithm for Computing Translocation Distance between Genomes 1996 71 DAMATH Hein & Jiang & Wang & Zhang, On the Complexity of Comparing Evolutionary Trees 1996 71 DAMATH Kandel & Matias & Unger & Winkler, Shuffling Biological Sequences 1996 71 DAMATH Smith & Toppur, Euclidean Steiner Minimal Trees, Minimum Energy Configurations, and the Embedding Problem of Weighted Graphs in E^3 1996 71 DAMATH Paterson & Przytycka, On the Complexity of String Folding 1996 71 DAMATH Pearson & Robins & Wrege & Zhang, On the Primer Selection Problem in Polymerase Chain Reaction Experiments 1996 71 DAMATH Sankoff & Nadeau, Conserved Synteny as a Measure of Genomic Distance 1996 71 DAMATH Schneider & Mastronarde, Fast Multiple Alignment of Ungapped DNA Sequences Using Information Theory and a Relaxation Method 1996 71 DAMATH Chen & Skiena, Sorting with Fixed-Length Reversals 1996 71 DAMATH Vingron & Waterman, Alignment Networks and Electrical Networks 1996 71 DAMATH Phillips & Warnow, The Asymmetric Median Tree--A New Model for Building Consensus Trees 1996 71 DAMATH Zhang & He & Miller, Local Multiple Alignment via Subgraph Enumeration 1996 70 DAMATH Lee & Yang & Wong, Rectilinear Paths among Rectilinear Obstacles 1996 70 DAMATH Khuller & Raghavachari & Rosenfeld, Landmarks in Graphs 1996 70 DAMATH Cheng & Kovalyov, Batch Scheduling and Common Due-Date Assignment on a Single Machine 1996 70 DAMATH Finta & Liu, Single Machine Scheduling Subject to Precedence Delays 1996 70 DAMATH Granot & Penn, Polynomial Algorithms for (Integral) Maximum Two-Flows in Vertex\Edge-capacitated Planar Graphs 1996 70 DAMATH Burkard & Klinz & Rudolf, Perspectives of Monge Properties in Optimization 1996 70 DAMATH Etzion & Bitan, On the Chromatic Number, Colorings, and Codes of the Johnson Graph 1996 70 DAMATH Lonc, On the Complexity of Some Edge-Partition Problems for Graphs 1996 70 DAMATH Hell & Kirkpatrick & Li, Rounding in Symmetric Matrices and Undirected Graphs 1996 70 DAMATH Hell & Nesetril & Zhu, Complexity of Tree Homomorphisms 1996 70 DAMATH Hurink, Polygon Scheduling 1996 70 DAMATH Paun, On the Splicing Operation 1996 70 DAMATH Chen, Parallel Machine Scheduling with Time Dependent Processing Times 1996 69 DAMATH Flotow, On Powers of Circular Arc Graphs and Proper Circular Arc Graphs 1996 69 DAMATH Makino & Ibaraki, Interior and Exterior Functions of Boolean Functions 1996 69 DAMATH Newberg, The Number of Clone Orderings 1996 69 DAMATH Yan & Chen & Chang, Quasi-Threshold Graphs 1996 69 DAMATH Brown, The Complexity of Generalized Graph Colorings 1996 69 DAMATH Fabrega & Fiol, Bipartite Graphs and Digraphs with Maximum Connectivity 1996 69 DAMATH Khuller & Raghavachari & Young, On Strongly Connected Digraphs with Bounded Cycle Length 1996 69 DAMATH Nachtigall, Periodic Network Optimization with Different Arc Frequencies 1996 69 DAMATH Ng & Wormald, Reconstruction of Rooted Trees from Subtrees 1996 69 DAMATH Wood & Shawe-Taylor, Representation Theory and Invariant Neural Networks 1996 69 DAMATH Demetrovics & Thi, Some Results about Normal Forms for Functional Dependency 1996 69 DAMATH Gutin & Yeo, Ranking the Vertices of a Complete Multipartite Paired Comparison Digraph 1996 69 DAMATH Lim & Park & Chwa, Embedding Trees in Recursive Circulants 1996 69 DAMATH Pixton, Regularity of Splicing Languages 1996 69 DAMATH Stephens, Gap Strings and Spanning Forests for Bridge Graphs of Biconnected Graphs 1996 69 DAMATH Zhang & Zhang, The Clar Covering Polynomial of Hexagonal Systems I 1996 69 DAMATH Balachandran & Pandu Rangan, All-Pairs-Shortest-Length on Strongly Chordal Graphs 1996 69 DAMATH Chen & He, Parallel Complexity of Partitioning a Planar Graph into Vertex-induced Forests 1996 68 DAMATH Fishburn, Decision Theory and Discrete Mathematics 1996 68 DAMATH Stewart, Finding Regular Subgraphs in Both Arbitrary and Planar Graphs 1996 68 DAMATH Ando & Fujishige & Nemoto, Decomposition of a Bidirected Graph into Strongly Connected Components and its Signed Poset Structure 1996 68 DAMATH Beineke & Oellermann & Pippert, On the Steiner Median of a Tree 1996 68 DAMATH Dragan & Voloshin, Incidence Graphs of Biacyclic Hypergraphs 1996 68 DAMATH Fricke & Hedetniemi & Jacobs, Maximal Irredundant Functions 1996 68 DAMATH Manoussakis & Tuza, The Forwarding Index of Directed Networks 1996 68 DAMATH Satyan & Rangan, The Parity Path Problem on some Subclasses of Perfect Graphs 1996 68 DAMATH Bermond & Ergincan, Bus Interconnection Networks 1996 68 DAMATH Averbakh & Berman, A Heuristic with Worst-Case Analysis for Minimax Routing of Two Travelling Salesmen on a Tree 1996 68 DAMATH Blanchet-Sadri, Inclusion Relations between Some Congruences Related to the Dot-Depth Hierarchy 1996 68 DAMATH Dunbar & Goddard & Hedetniemi & McRae & Henning, The Algorithmic Complexity of Minus Domination in Graphs 1996 68 DAMATH Fricke & Henning & Oellermann & Swart, An Algorithm to Find Two Distance Domination Parameters in a Graph 1996 68 DAMATH Lee & Li, On the Fixed Interval Due-Date Scheduling Problem 1996 68 DAMATH de Werra & Hoffman & Mahadev & Peled, Restrictions and Preassignments in Preemptive Open Shop Scheduling 1996 68 DAMATH Yu, Augmentations of Consistent Partial Orders for the One-Machine Total Tardiness Problem 1996 68 DAMATH Aldershof & Carducci, Stable Matchings with Couples 1996 66 DAMATH Yen & Lee, The Weighted Perfect Domination Problem and its Variants 1996 66 DAMATH Allouche & von Haeseler & Peitgen & Skordev, Linear Cellular Automata, Finite Automata and Pascal's Triangle 1996 66 DAMATH Gavril, Intersection Graphs of Helly Families of Subtrees 1996 66 DAMATH Mans & Roucairol, Performances of Parallel Branch and Bound Algorithms with Best-First Search 1996 66 DAMATH Chen & Srivastava, An Improved Lower Bound for the Bin Packing Problem 1996 66 DAMATH Grytczuk, Intertwined Infinite Binary Words 1996 64 DAMATH Chepoi, A Multifacility Location Problem on Median Spaces 1996 64 DAMATH Fraenkel & Klein, Robust Universal Complete Codes for Transmission and Compression 1996 64 DAMATH Armstrong & Jin, Strongly Polynomial Simplex Algorithm for Bipartite Vertex Packing 1996 64 DAMATH Bagchi & Schmeichel & Hakimi, Gossiping with Multiple Sends and Receives 1996 64 DAMATH Marathe & Hunt & Ravi, Efficient Approximation Algorithms for Domatic Partition and On-line Coloring of Circular Arc Graphs 1995 63 DAMATH Averbakh & Berman & Punnen, Constrained Matroidal Bottleneck Problems 1995 63 DAMATH Chang & Rangan & Coorg, Weighted Independent Perfect Domination on Cocomparability Graphs 1995 63 DAMATH Kranakis & Krizanc, Labeled versus Unlabeled Distributed Cayley Networks 1995 63 DAMATH Nowicki & Zdrzalka, A Bicriterion Approach to Preemptive Scheduling of Parallel Machines with Controllable Job Processing Times 1995 63 DAMATH Stadje, Selecting Jobs for Scheduling on a Machine Subject to Failure 1995 63 DAMATH Topp & Vestergaard, Well Irredundant Graphs 1995 63 DAMATH Ilie, On Subwords of Infinite Words 1995 63 DAMATH Driscoll & Healy & Isaak, Scheduling Dyadic Intervals 1995 63 DAMATH Ergincan & Gregory, Directed Moore Hypergraphs 1995 63 DAMATH Gerbessiotis, Close-to-Optimal and Near-Optimal Broadcasting in Random Graphs 1995 63 DAMATH Lai & Lai, Every Matroid is a Submatroid of a Uniformly Dense Matroid 1995 63 DAMATH Srinivas, Matroid Optimization with Generalized Constraints 1995 63 DAMATH Tsai, The Modified Differencing Method for the Set Partitioning Problem with Cardinality Constraints 1995 63 DAMATH Brito, A Simple A.S. Correct Algorithm for Deciding if a Graph Has a Perfect Matching 1995 63 DAMATH Flotow, On Powers of m-Trapezoid Graphs 1995 63 DAMATH Lipponen & Paun, Strongly Prime PCP Words 1995 63 DAMATH Abeledo & Rothblum, Paths to Marriage Stability 1995 63 DAMATH Schaffter, Drawing Graphs on Rectangular Grids 1995 63 DAMATH Bouabdallah & Delorme & Djelloul, Edge Deletion Preserving the Diameter of the Hypercube 1995 62 DAMATH Andreatta & Mason, Path Covering Problems and Testing of Printed Circuits 1995 62 DAMATH Becker & Perl, The Shifting Algorithm Technique for the Partitioning of Trees 1995 62 DAMATH Bianco & Pell'Olmo & Speranza, Scheduling Independent Tasks with Multiple Modes 1995 62 DAMATH Boros & Gurvich & Hammer & Ibaraki & Kogam, Decomposability of Partially Defined Boolean Functions 1995 62 DAMATH Brucker, Efficient Algorithms for some Path Partitioning Problems 1995 62 DAMATH Chopra, Compositions for Matroids with the Fulkerson Property 1995 62 DAMATH Conforti & Cornuejols & Rao, Decomposition of Wheel-and-Parachute-free Balanced Bipartite Graphs 1995 62 DAMATH Cvetkovic & Rowlinson & Simic, On Some Algorithmic Investigations of Star Partitions of Graphs 1995 62 DAMATH Davis-Moradkhan & Roucairol, Graph Partitioning Applied to the Logic Testing of Combinational Circuits 1995 62 DAMATH de Souze & Laurent, Some New Classes of Facets for the Equicut Polytope 1995 62 DAMATH Euler & Le Verge, Complete Linear Descriptions of Small Asymmetric Traveling Salesman Polytopes 1995 62 DAMATH Mahjoub, A min-max Relation for K_3-covers in Graphs Noncontractible to K_5\e 1995 62 DAMATH Mingozzi & Ricciardelli & Spadoni, Partitioning a Matrix to Minimize the Maximum Cost 1995 62 DAMATH Poljak & Rendl, Solving the max-cut Problem Using Eigenvalues 1995 62 DAMATH Tinhofer, Bin-Packing and Matchings in Threshold Graphs 1995 61 DAMATH Aigner & Schwarzkopf, Bounds on the Size of Merging Networks 1995 61 DAMATH Baldick, A Unified Approach to Polynomially Solvable Cases of Integer ``Non-separable'' Quadratic Optimization 1995 61 DAMATH Baumslag, An Algebraic Analysis of the Connectivity of DeBruijn and Shuffle-Exchange Digraphs 1995 61 DAMATH Iwata & Murota, A Theorem on the Principal Structure for Independent Matchings 1995 61 DAMATH Jansen, Scheduling of Conditional Executed Jobs on Unrelated Processors 1995 61 DAMATH Paun & Salomaa, Thin and Slender Languages 1995 61 DAMATH Tamm, Deterministic Communication Complexity of Set Intersection 1995 61 DAMATH Anthony, Classification by Polynomial Surfaces 1995 61 DAMATH Cohen & Blum, On the Problem of Sorting Burnt Pancakes 1995 61 DAMATH De Bonis & Gargano & Vaccaro, Optimal Detection of a Counterfeit Coin with Multi-Arms Balances 1995 61 DAMATH Jamison & Olariu, Linear Time Optimization Algorithms for P_4-sparse Graphs 1995 61 DAMATH Abbott & Smuga-Otto, Lower Bounds for Hypergraph Ramsey Numbers 1995 61 DAMATH Anthony & Brightwell & Shawe-Taylor, On Specifying Boolean Functions by Labelled Examples 1995 61 DAMATH Goemans, An Approximation Algorithm for Scheduling on Three Dedicated Machines 1995 61 DAMATH Ravishankar & Singh, Asymptotically Optimal Gossiping in Radio Networks 1995 61 DAMATH Vygen, NP-Completeness of Some Edge-Disjoint Paths Problems 1995 60 DAMATH Annexstein & Franco, Work-Preserving Emulations of Shuffle-Exchange Networks: An Analysis of the Complex Plane Diagram 1995 60 DAMATH Bagchi & Servatius & Shi, 2-Satisfiability and Diagnosing Faulty Processors in Massively Parallel Computing Systems 1995 60 DAMATH Barthelemy & Hudry & Isaak & Roberts & Tesman, The Reversing Number of a Digraph 1995 60 DAMATH Berman & Franco & Schlipf, Unique Satisfiability of Horn Sets Can Be Solved in Nearly Linear Time 1995 60 DAMATH Colbourn & Provan & Vertigan, A New Approach to Solving Three Combinatorial Enumeration Problems on Planar Graphs 1995 60 DAMATH Erdos & Fishburn, Multiplicities of Interpoint Distances in Finite Planar Sets 1995 60 DAMATH Erdos & Fishburn, Intervertex Distances in Convex Polygons 1995 60 DAMATH Gallo & Pretolani, A New Algorithm for the Propositional Satisfiability Problem 1995 60 DAMATH Hertz, Polynomially Solvable Cases for the Maximum Stable Set Problem 1995 60 DAMATH Hwang, The Time Complexity of Deterministic Broadcast Radio Networks 1995 60 DAMATH Klinz & Rudolf & Woeginger, Permuting Matrices to Avoid Forbidden Submatrices 1995 60 DAMATH Langley, A Recognition Algorithm for Orders of Interval Dimension Two 1995 60 DAMATH Langley, Irreflexive and Reflexive Dimension 1995 60 DAMATH Lazebnik & Ustimenko, Explicit Construction of Graphs with an Arbitrary Large Girth and of Large Size 1995 60 DAMATH Lu, A Note on Biased and Non-biased Games 1995 60 DAMATH Peled & Sun, Enumeration of Difference Graphs 1995 60 DAMATH Penrice, On-line Algorithms for Ordered Sets and Comparability Graphs 1995 60 DAMATH Picouleau, New Complexity Results on Scheduling with Small Communication Delays 1995 59 DAMATH Andersen & Fleischner, The NP-completeness of Finding A-trails in Eulerian Graphs and of Finding Spanning Trees in Hypergraphs 1995 59 DAMATH Benelli & Hassin, Optimal Separable Partitioning in the Plane 1995 59 DAMATH Carlisle & Lloyd, On the k-Coloring of Intervals 1995 59 DAMATH Sotskov & Shakhlevich, NP-hardness of Shop-Scheduling Problems with Tree Jobs 1995 59 DAMATH Swaminathan & Wagner, The Arborescence-Realization Problem 1995 59 DAMATH Benjamin & Converse & Krieger, How Do I Marry Thee? Let Me Count the Ways! 1995 59 DAMATH Carpentieri, Some Democratic Secret Sharing Schemes 1995 59 DAMATH Hadley, Approximation Techniques for Hypergraph Partitioning Problems 1995 59 DAMATH Liu & Vannelli, Generating Lower Bounds for the Linear Arrangement Problem 1995 59 DAMATH Petersson & Moffat, A Framework for Adaptive Sorting 1995 59 DAMATH Spinrad & Sritharan, Algorithms for Weakly Triangulated Graphs 1995 59 DAMATH Brasel & Kluge & Werner, A Polynomial Algorithm for an Open Shop Problem with Unit Processing Times and Tree Constraints 1995 59 DAMATH Eiter & Kilpelainen & Mannila, Recognizing Renamable Generalized Propositional Horn Formulas is NP-Complete 1995 59 DAMATH He & Sher, On Determining Non-isotopic Configurations of Points on a Circle 1995 59 DAMATH Pochet & Wolsey, Integer Knapsack and Flow Covers with Divisible Coefficients: Polyhedra, Optimization and Separation 1995 59 DAMATH Strusevich, Two Machine Flow Shop Scheduling Problem with No Wait in Process: Controllable Machine Speeds 1995 59 DAMATH Tan & Hsueh, A Generalization of the Stable Matching Problem 1995 58 DAMATH Bar-Noy & Kipnis & Schieber, Optimal Computation of Census Functions in the Postal Model 1995 58 DAMATH Culik & Fris, Weighted Finite Transducers in Image Processing 1995 58 DAMATH Keeler & Westbrook, Short Encodings of Planar Graphs and Maps 1995 58 DAMATH Liu & Sanlaville, Preemptive Scheduling with Variable Profile, Precedence Constraints and Due Dates 1995 58 DAMATH Mak & Morton, Distances between Traveling Salesman Tours 1995 58 DAMATH Li & Gutman, A Unified Approach to the First Derivatives of Graph Polynomials 1995 58 DAMATH Bein & Brucker & Park & Pathak, A Monge Property for the d-Dimensional Transportation Problem 1995 58 DAMATH Cechlarova, Trapezoidal Matrices and the Bottleneck Assignment Problem 1995 58 DAMATH Faigle & Gademann & Kern, A Random Polynomial Time Algorithm for Well-Rounding Convex Bodies 1995 58 DAMATH Jurisch, Lower Bounds for the Job-Shop Scheduling Problem on Multi-purpose Machines 1995 58 DAMATH Kubiak, New Results on the Completion Time Variance Minimization 1995 58 DAMATH Sotskov & Leontev & Gordeev, Some Concepts of Stability Analysis in Combinatorial Optimization 1995 58 DAMATH Werner & Winkler, Insertion Techniques for the Heurisitc Solution of the Job Shop Problem 1995 58 DAMATH Comellas & Fiol, Vertex-Symmetric Digraphs with Small Diameter 1995 58 DAMATH Faigle & Nawijn, Note on Scheduling Intervals On-line 1995 58 DAMATH Kortanek & Yamasaki, Discrete Infinite Transportation Problems 1995 58 DAMATH Sanchis, Generating Hard and Diverse Test Sets for NP-Hard Graph Problems 1995 58 DAMATH Sole, Expanding and Forwarding 1995 58 DAMATH Spieker, The Set of Super-Stable Marriages Forms a Distributive Lattice 1995 58 DAMATH Vrt'o, Two Remarks on ``Expanding and Forwarding'' by Sole 1995 58 DAMATH Matsui, The Minimum Spanning tree Problem on a Planar Graph 1995 57 DAMATH Annan, The Complexities of the Coefficients of the Tutte Polynomial 1995 57 DAMATH Birge & Dempster, Optimal Match-up Strategies in Stochastic Scheduling 1995 57 DAMATH Butkovic, Regularity of Matrices in Min-Algebra and its Time Complexity 1995 57 DAMATH Edwards & McDiarmid, The Complexity of Harmonious Colouring for Trees 1995 57 DAMATH Glazebrook, Stochastic Scheduling and Forwards Induction 1995 57 DAMATH Hanen & Munier, A Study of the Cyclic Scheduling Problem on Parallel Processors 1995 57 DAMATH Kucera, Expected Complexity of Graph Partitioning Problems 1995 57 DAMATH Reed, Rooted Routing in the Plane 1995 57 DAMATH Sanlaville, Nearly On Line Scheduling of Preemptive Independent Tasks 1995 57 DAMATH Soma & Zinober & Yanasse & Harley, A Polynomial Approximation Scheme for the Subset Sum Problem 1995 57 DAMATH Srivastav & Stangier, Weighted Fractional and Integral k-Matching in Hypergraphs 1995 57 DAMATH Alon & Spencer & Tetali, Covering with Latin Transversals 1995 57 DAMATH Berkman & Vishkin, Almost Fully-Parallel Parentheses Matching 1995 57 DAMATH Dahlhaus, Efficient Parallel Recognition Algorithms of Cographs and Distance Hereditary Graphs 1995 57 DAMATH Smetanich & Kazanovich & Kornilov, A Combinatorial Approach to the Problem of Self-Assembly 1995 57 DAMATH Pruhs, Using Local Adaptations to Reconfigure a Spanning Tree of a Network 1995 57 DAMATH Ruskey & Jiang & Weston, The Hamiltonicity of Directed sigma-tau Cayley Graphs (Or: A Tale of Backtracking) 1995 56 DAMATH Aoki, Probing the Arrangement of Hyperplanes 1995 56 DAMATH Cheng & Masuyama, A Lower Bound of the Expected Maximum Number of Edge-Disjoint s-t Paths on Probabilistic Graphs 1995 56 DAMATH de Fraysseix & de Mendez & Rosenstiehl, Bipolar Orientations Revisited 1995 56 DAMATH Deza & Laurent, Hypercube Embedding of Generalized Bipartite Metrics 1995 56 DAMATH Fukuda & Namiki, Finding All Common Bases in Two Matroids 1995 56 DAMATH Hanazawa & Narushima & Minaka, Generating Most Parsimonious Reconstructions on a Tree: A Generalization of the Farris-Swofford-Maddison Method 1995 56 DAMATH Karzanov, Half-Integral Flows in a Planar Graph with Four Holes 1995 56 DAMATH Shigeno & Saruwatari & Matsui, An Algorithm for Fractional Assignment Problems 1995 56 DAMATH Fischetti, Clique Tree Inequalities Define Facets of the Asymmetric Traveling Salesman Polytope 1995 56 DAMATH Kohli & Krishnamurti, Joint Performance of Greedy Heuristics for the Integer Knapsack Problem 1995 56 DAMATH Leblanc, Finding Degeneracies among Sets of Lines 1995 56 DAMATH Norris, Universal Covers of Graphs: Isomorphism to Depth n-1 Implies Isomorphism to all Depths 1995 56 DAMATH Blokh & Gutin, Maximizing Traveling Salesman Problem for Special Matrices 1994 55 DAMATH Arkin & Hassin, Approximation Algorithms for the Geometric Covering Salesman Problem 1994 55 DAMATH Bodlaender & Jansen & Woeginger, Scheduling with Incompatible Jobs 1994 55 DAMATH Cai, An Algorithm for an Eulerian Trail Traversing Specified Edges in Given Order 1994 55 DAMATH Hoogeveen & van de Velde & Veltman, Complexity of Scheduling Multiprocessor Tasks with Prespecified Processor Allocations 1994 55 DAMATH Mautor & Roucairol, A New Exact Algorithm for the Solution of Quadratic Assignment Problems 1994 55 DAMATH Nishizeki & Poljak, k-Connectivity and Decomposition of Graphs into Forests 1994 55 DAMATH Bar-Noy & Kipnis, Broadcasting Multiple Messages in Simultaneous Send/Receive Systems 1994 55 DAMATH de Werra, On an Optimization Problem Occurring in FMSs: A Hypergraph-theoretical Formulation 1994 55 DAMATH Gautier & Granot, On the Equivalence of Constrained and Unconstrained Flows 1994 55 DAMATH Hoang, Efficient Algorithms for Minimum Weighted Colouring of Some Classes of Perfect Graphs 1994 55 DAMATH Kolen & Rinnooy Kan & van Hoesel & Wagelmans, Sensitivity Analysis of List Scheduling Heuristics 1994 55 DAMATH Lee & Morris, Geometric Comparison of Combinatorial Polytopes 1994 55 DAMATH Yinnone, Maximum Number of Disjoint Paths Connecting Specified Terminals in a Graph 1994 55 DAMATH Boros & Hammer & Sun, Recognition of q-Horn Formulae in Linear Time 1994 55 DAMATH Cameron & Wood, Maximal Path Length of Binary Trees 1994 55 DAMATH Sevast'janov, On Some Geometric Methods in Scheduling Theory: A Survey 1994 55 DAMATH Istrate & Paun, Some Combinatorial Properties of Self-reading Sequences 1994 55 DAMATH Punnen & Nair, Improved Complexity Bound for the Maximum Cardinality Bottleneck Bipartite Matching Problem 1994 54 DAMATH Bodlaender, Improved Self-reduction Algorithms for Graphs with Bounded Treewidth 1994 54 DAMATH Courcelle, The Monadic Second Order Logic of Graphs VI: On Several Representations of Graphs by Relational Structures 1994 54 DAMATH Korneyenko, Combinatorial Algorithms on a Class of Graphs 1994 54 DAMATH Macmahon, The Combinations of Resistances 1994 54 DAMATH Wanke, k-NLC Graphs and Polynomial Algorithms 1994 54 DAMATH Abeledo & Rothblum, Stable Matchings and Linear Inequalities 1994 54 DAMATH MacGillivray, Graph Homomorphisms with Infinite Targets 1994 54 DAMATH McClurkin, A Lower Bound for Tree Resolution 1994 54 DAMATH Salowe, Euclidean Spanner Graphs with Degree Four 1994 54 DAMATH Tomescu & Zimand, Minimum Spanning Hypertrees 1994 54 DAMATH Frieze & Molloy, Broadcasting in Random Graphs 1994 54 DAMATH Motwani & Sudan, Computing Roots of Graphs is Hard 1994 54 DAMATH Valerio & Moser & Melliar-Smith, Classic Squares and Broadcast Squares 1994 53 DAMATH Bruck, On Optimal Broadcasting in Faulty Hypercubes 1994 53 DAMATH Chlebus & Diks & Pelc, Fast Gossiping with Short Unreliable Messages 1994 53 DAMATH Djelloul, Broadcasting in m-Dimensional Grid Graphs with a Given Neighborhood Template 1994 53 DAMATH Farley & Proskurowski, Bounded-Call Broadcasting 1994 53 DAMATH Feldmann & Hromkovic & Madhavapeddy & Monien & Mysliwietz, Optimal Algorithms for Dissemination of Information in Generalized Communication Modes 1994 53 DAMATH Fraigniaud & Lazard, Methods and Problems of Communication in Usual Networks 1994 53 DAMATH Gargano & Liestman & Peters & Richards, Reliable Broadcasting 1994 53 DAMATH Gerbessiotis, Broadcasting in Random Graphs 1994 53 DAMATH GowriSankaran, Broadcasting on Recursively Decomposable Cayley Graphs 1994 53 DAMATH Klasing & Monien & Peine & Stohr, Broadcasting in Butterfly and deBruijn Networks 1994 53 DAMATH Konig & Lazard, Minimum k-Broadcast Graphs 1994 53 DAMATH Kortsarz & Peleg, Traffic-Light Scheduling on the Grid 1994 53 DAMATH Labahn & Hedetniemi & Laskar, Periodic Gossiping on Trees 1994 53 DAMATH Labahn, A Minimum Broadcast Graph on 63 Vertices 1994 53 DAMATH Lennart Johnsson & Ho, Optimal Communication Channel Utilization for Matrix Transposition and Related Permutations on Binary Cubes 1994 53 DAMATH Maheo & Sacle, Some Minimum Broadcast Graphs 1994 53 DAMATH Maheo & Sacle, Note on the Problem of Gossiping in Multidimensional Grids 1994 53 DAMATH Michallon & Trystram, Practical Experiments of Broadcasting Algorithms on a Configurable Parallel Computer 1994 53 DAMATH Ravishankar & Singh, Broadcasting [0,L] 1994 53 DAMATH Van Scoy & Brooks, Broadcasting Multiple Messages in a Grid 1994 52 DAMATH Jansen, Analysis of Scheduling Problems with Typed Task Systems 1994 52 DAMATH Kratochvil, A Special Planar Satisfiability Problem and a Consequence of its NP-Completeness 1994 52 DAMATH Masuda & Ishii, Two Machine Open Shop Scheduling Problem with Bi-Criteria 1994 52 DAMATH Dahlhaus & Damaschke, The Parallel Solution of Domination Problems on Chordal and Strongly Chordal Graphs 1994 52 DAMATH Enflo & Granville & Shallit & Yu, On Sparse Languages L such that LL = Sigma* 1994 52 DAMATH Maffray & Preissmann, Linear Recognition of Pseudo-split Graphs 1994 52 DAMATH Amaldi & Mayoraz & de Werra, A Review of Combinatorial Problems Arising in Feedforward Neural Network Design 1994 52 DAMATH Bendisch & Derigs & Metz, An Efficient Matching Algorithm Applied in Statistical Physics 1994 52 DAMATH Boyar & Fich & Larsen, Bounds on Certain Multiplications of Affine Combinations 1994 52 DAMATH Cole, Some Results on Greedy Algorithm Conjectures 1994 52 DAMATH Gavril & Urrutia, Intersection Graphs of Concatenable Subtrees of Graphs 1994 52 DAMATH Anthony & Shawe-Taylor, A Result of Vapnik with Applications (Erratum) 1994 52 DAMATH Aurenhammer & Formann & Idury & Schaffer & Wagner, Faster Isometric Embedding in Products of Complete Graphs 1994 52 DAMATH Bar-Noy & Hwang & Kessler & Kutten, A New Competitive Algorithm for Group Testing 1994 52 DAMATH McCormick & Ervolina, Computing Maximum Mean Cuts 1994 52 DAMATH Sherali & Adams, A Hierarchy of Relaxations and Convex Hull Characterizations for Mixed-Integer Zero-One Programming Problems 1994 51 DAMATH Fiechter, A Parallel Tabu Search Algorithm for Large Traveling Salesman Problems 1994 51 DAMATH Galbiati & Maffioli, On the Computation of Pfaffians 1994 51 DAMATH Goemans, Arborescence Polytopes for Series-Parallel Graphs 1994 51 DAMATH Korst & Aarts & Lenstra & Wessels, Periodic Assignment and Graph Colouring 1994 51 DAMATH Leung & Yu & Wei, Minimizing the Weighted Number of Tardy Task Units 1994 51 DAMATH Schmitt & Waterman, Linear Trees and RNA Secondary Structure 1994 51 DAMATH Czyzowicz & Rivera-Campo & Urrutia, Separation of Convex Sets 1994 51 DAMATH Babel & Tinhofer, Hard-to-Color Graphs for Connected Sequential Colorings 1994 51 DAMATH Dahlhaus, A Parallel Algorithm for Computing Steiner Trees in Strongly Chordal Graphs 1994 51 DAMATH Damaschke, PLA Folding in Special Graph Classes 1994 51 DAMATH Niessen, How to Find Overfull Subgraphs in Graphs with Large Maximum Degree 1994 51 DAMATH Pfeiffer, A Note on the Half-Integral Multiflow-Problem Restricted to Minor-Closed Classes of Graphs 1994 51 DAMATH Poguntke, On Reliable Graphs with Static Routing Plans 1994 50 DAMATH Dror & Laporte & Trudeau, Vehicle Routing with Split Deliveries 1994 50 DAMATH Hertz & Jaumard & Ribeiro, A Graph Theory Approach to Subcontracting, Machine Duplication and Intercell Moves in Cellular Manufacturing 1994 50 DAMATH Lakshminarayanan & Chandrasekaran, A Rounding Algorithm for Integer Programs 1994 50 DAMATH Matsui 7 Tamura & Ikebe, Algorithms for Finding a Kth Best Valued Assignment 1994 50 DAMATH Kratochvil & Tuza, Algorithmic Complexity of List Colorings 1994 50 DAMATH Czyzowicz & Rivera-Campo & Santoro & Urrutia & Zaks, Guarding Rectangular Art Galleries 1994 50 DAMATH Istrate, Self-Reading Sequences 1994 50 DAMATH Blanchet-Sadri, On a Complete Set of Generators for Dot-Depth Two 1994 50 DAMATH Cooper, Probabilistic Analysis of Two k-Cluster Problems 1994 50 DAMATH Zimmermann, On the Complexity of the Dual Method for Maximum Balanced Flows 1994 49 DAMATH Bloom & Ruiz, Decompositions into Linear Forests and Difference Labelings of Graphs 1994 49 DAMATH Cochand, Probabilistic Estimates for the Generalized Maximum Satisfiability Problem 1994 49 DAMATH Fayard & Plateau, An Exact Algorithm for the 0-1 Collapsing Knapsack Problem 1994 49 DAMATH Freville & Plateau, An Efficient Preprocessing Procedure for the Multidimensional 0-1 Knapsack Problem 1994 49 DAMATH Gallian, A Guide to the Graph Labeling Zoo 1994 49 DAMATH Hertz & Jaumard & de Aragao, Local Optima Topology for the k-Coloring Problem 1994 49 DAMATH Margot, Some Complexity Results about Threshold Graphs 1994 49 DAMATH Peled & Simeone, An O(nm)-Time Algorithm for Computing the Dual of a Regular Boolean Function 1994 48 DAMATH Belouadah & Potts, Scheduling Identical Parallel Machines to Minimize Total Weighted Completion Time 1994 48 DAMATH Dyer, On a Universal Chain Problem 1994 48 DAMATH Eglese, Routeing Winter Gritting Vehicles 1994 48 DAMATH Gothe-Lundgren & Larsson, A Set Covering Reformulation of the Pure Fixed Charge Transportation Problem 1994 48 DAMATH Irving, Stable Marriage and Indifference 1994 48 DAMATH Kolen & Pesch, Genetic Local Search in Combinatorial Optimization 1994 48 DAMATH Nakamura, An Extension of Elementary Bipartite Graphs to Matroid Pairs and its Characterization 1994 48 DAMATH Van Hoesel & Kuik & Salomon & Van Wassenhove, The Single-Item Discrete Lotsizing and Scheduling Problem: Optimization by Linear and Dynamic Programming 1994 48 DAMATH Damaschke, A Tight Upper Bound for Group Testing in Graphs 1994 48 DAMATH Gimbel & Kratsch & Stewart, On Cocolourings and Cochromatic Numbers of Graphs 1994 48 DAMATH Granot & Skorin-Kapov, On Some Optimization Problems on k-Trees and Partial k-Trees 1994 48 DAMATH Hu & Hwang, Cutting Numbers for the Forward Loop Backward Hop Network 1994 48 DAMATH Schilling, Random Knapsacks with Many Constraints 1994 48 DAMATH Sprague & Tamaki, Routings for Involutions of a Hypercube 1994 48 DAMATH Cai, NP-completeness of Minimum Spanner Problems 1994 48 DAMATH Butkovic, Strong Regularity of Matrices -- A Survey of Results 1994 48 DAMATH Nowicki & Smutnicki, An Approximation Algorithm for a Single-Machine Scheduling Problem with Release Times and Delivery Times 1994 48 DAMATH Bosnjak, Some New Results Concerning Three Counterfeit Coins Problem 1994 48 DAMATH Bouchitte & Jegou & Rampon, On the Directionality of Interval Orders 1994 48 DAMATH Zhu & Mutchler, On Constructing the Elimination Tree 1993 47 DAMATH Goldfarb & Hao, On the Maximum Capacity Augmentation Algorithm for the Maximum Flow Problem 1993 47 DAMATH Huang, On the Complexity of Two Circle Connecting Problems 1993 47 DAMATH McMorris & Powers, Consensus Functions on Trees that Satisfy an Independence Axiom 1993 47 DAMATH van der Veen, An O(n) Algorithm to Solve the Bottleneck Traveling Salesman Problem Restricted to Ordered Product Matrices 1993 47 DAMATH Korach & Penn, A Fast Algorithm for Maximum Integral Two-Commodity Flow in Planar Graphs 1993 46 DAMATH Coullard & del Greco & Wagner, Uncovering Generalized-Network Structure in Matrices 1993 46 DAMATH Hassin & Henig, Monotonicity and Efficient Computation of Optimal Dichotomous Search 1993 46 DAMATH Hellerstein, Functions that are Read-Once on a Subset of their Inputs 1993 46 DAMATH Hwang & Papastavridis, Erratum: Binary Vectors with Exactly k Nonoverlapping m-tuples of Consecutive Ones 1993 46 DAMATH Bezrukov & Grunwald & Weber, On Edge Numberings of the n-cube Graph 1993 46 DAMATH Cochand, A Fixed Point Operator for the Generalised Maximum Satisfiability Problem 1993 46 DAMATH Ervolina & McCormick, Two Strongly Polynomial Cut Cancelling Algorithms for Minimum Cost Network Flow 1993 46 DAMATH Gunther & Hartnell & Rall, Graphs Whose Vertex Independence Number is Unaffected by Single Edge Addition or Deletion 1993 46 DAMATH Baldy & Morvan, A Linear Time and Space Algorithm to Recognize Interval Orders 1993 46 DAMATH Li & Xu & Zhang, The Infinite Families of Optimal Double Loop Networks 1993 46 DAMATH Burkard & Yao, Constrained Partitioning Problems (Erratum) 1993 46 DAMATH Klapper & Chan & Goresky, Cross-correlations of Linearly and Quadratically Related Geometric Sequences and GMW Sequences 1993 46 DAMATH Nowicki & Smutnicki, New Results in the Worst-Case Analysis for Flow-Shop Scheduling 1993 46 DAMATH Queyranne & Sun, The Performance Ratio of Grouping Policies for the Joint Replenishment Problem 1993 46 DAMATH Andreae & Hennig & Parra, On a Problem Concerning Tolerance Graphs 1993 46 DAMATH Broersma & Xueliang, On ``The Matching Polynomial of a Polygraph'' 1993 46 DAMATH Kim & McKee & McMorris & Roberts, p-Competition Numbers 1993 46 DAMATH Llewellyn & Tovey & Trick, Local Optimization on Graphs (Erratum) 1993 45 DAMATH Csirik & Frenk & Labbe, Two-dimensional Rectangle Packing: On-line Methods and Results 1993 45 DAMATH De Souza & Ribeiro, Heuristics for the Minimum Rectilinear Steiner Tree Problem: New Algorithms and a Computational Study 1993 45 DAMATH Du & Hwang, Competitive Group Testing 1993 45 DAMATH Kellerer & Woeginger, A Tight Bound for 3-Partitioning 1993 45 DAMATH Llewellyn & Ryan, A Primal Dual Integer Programming Algorithm 1993 45 DAMATH Agasi & Becker & Perl, A Shifting Algorithm for Constrained Min-Max Partition on Trees 1993 45 DAMATH Dassow & Hinz, Decision Problems and Regular Chain Code Picture Languages 1993 44 DAMATH Adler & Hoffman & Shamir, Monge and Feasibility Sequences in General Flow Problems 1993 44 DAMATH Bernhard & Hedetniemi & Jacobs, Efficient Sets in Graphs 1993 44 DAMATH Telle & Proskurowski, Efficient Sets in Partial k-Trees 1993 44 DAMATH Blair, The Efficiency of AC Graphs 1993 44 DAMATH Cai & Maffray, On the SPANNING k-TREE Problem 1993 44 DAMATH Colbourn & Satyanarayana & Suffel & Sutner, Computing Residual Connectedness Reliability for Restricted Networks 1993 44 DAMATH Anstee, Minimum Vertex Weighted Deficiency of (g,f)-Factors: A Greedy Algorithm 1993 43 DAMATH Cimikowski, On Certain Hamiltonian Inner Triangulations 1993 43 DAMATH Coullard & del Greco & Wagner, Recognizing a Class of Bicircular Matroids 1993 43 DAMATH Houle & Imai & Imai & Robert & Yamamoto, Orthogonal Weighted Linear L_1 and L_infinity Approximation and Applications 1993 43 DAMATH Moran & Wolfsthal, Two-page Book Embedding of Trees under Vertex-Neighborhood Constraints 1993 43 DAMATH Roos, Voronoi Diagrams over Dynamic Scenes 1993 43 DAMATH Schaffer, A Faster Algorithm to Recognize Undirected Path Graphs 1993 43 DAMATH Althofer & Koschnick, On the Deterministic Complexity of Searching Local Maxima 1993 43 DAMATH Kern, On the Depth of Combinatorial Optimization Problems 1993 43 DAMATH Llewellyn & Tovey, Dividing and Conquering the Square 1993 43 DAMATH Rardin & Sudit, Paroid Search: Generic Local Combinatorial Optimization 1993 43 DAMATH Vohra & Hall, A Probabilistic Analysis of the Maximal Covering Location Problem 1993 43 DAMATH Balas & Qi, Linear-Time Separation Algorithms for the Three-Index Assignment Polytope 1993 43 DAMATH Clark & Lewis, Circular Avoiding Sequences with Prescribed Sum 1993 43 DAMATH Jansen, The Allocation Problem in Hardware Design 1993 43 DAMATH Sierksma, The Skeleton of the Symmetric Traveling Salesman Polytope 1993 43 DAMATH Wagner & Corneil, On the Complexity of the Embedding Problem for Hypercube Related Graphs 1993 43 DAMATH Korach & Solel, Tree-width, Path-width, and Cutwidth 1993 42 DAMATH Blazewicz & Kubiak & Martello, Algorithms for Minimizing Maximum Lateness with Unit Length Tasks and Resource Constraints 1993 42 DAMATH Dietrich & Escudero & Chance, Efficient Reformulation for 0-1 Programs -- Methods and Computational Results 1993 42 DAMATH Hochbaum, Why Should Biconnected Components Be Identified First 1993 42 DAMATH Kindervater & Lenstra & Savelsbergh, Sequential and Parallel Local Search for the Time-Constrained Traveling Salesman Problem 1993 42 DAMATH Papadimitriou & Serafini & Yannakakis, Computing the Throughput of a Network with Dedicated Lines 1993 42 DAMATH Kan & Stougie & Vercellis, A Class of Generalized Greedy Algorithms for the Multi-knapsack Problem 1993 42 DAMATH Stougie, A Fast Randomized Algorithm for Partitioning a Graph into Paths of Fixed Length 1993 42 DAMATH Estivill-Castro & Mannila & Wood, Right Invariant Metrics and Measures of Presortedness 1993 42 DAMATH Keil, The Complexity of Domination Problems in Circle Graphs 1993 42 DAMATH Shawe-Taylor & Anthony & Biggs, Bounding Sample Size with the Vapnik-Chervonenkis Dimension 1993 42 DAMATH Sunderam & Winkler, Fast Information Sharing in a Complete Network 1993 42 DAMATH Troutman & Karlinger, A Note on Subtrees Rooted Along the Primary Path of a Binary Tree 1993 41 DAMATH Boyd, Polyhedral Results for the Precedence-Constrained Knapsack Problem 1993 41 DAMATH Franco, On the Occurrence of Null Clauses in Random Instances of Satisfiability 1993 41 DAMATH Lee & Liman, Capacitated Two-Parallel Machines Scheduling to Minimize Sum of Job Completion Times 1993 41 DAMATH Lloyd, Balance, Uncorrelatedness and the Strict Avalanche Criterion 1993 41 DAMATH Siegrist & Amin & Slater, The Optimal Unicyclic Graphs for Pair-Connected Reliability 1993 41 DAMATH Csima & Lovasz, Dating the Marriage 1993 41 DAMATH Salomaa, Simple Reductions between D0L Language and Sequence Equivalence Problems 1993 41 DAMATH Eusterbrock, Errata to ``Selecting the Top Three Elements'' by M. Aigner: A Result of a Computer-Assisted Proof Search 1993 41 DAMATH Granot & Skorin-Kapov, On Polynomial Solvability of the High Multiplicity Total Weighted Tardiness Problem 1993 41 DAMATH Korach & Tal, General Vertex Disjoint Paths in Series-Parallel Graphs 1993 41 DAMATH Galambos & Frenk, A Simple Proof of Liang's Lower Bound for On-line Bin Packing and the Extension to the Parametric Case 1993 41 DAMATH Apostolico & Atallah & Hambrusch, Erratum: New Clique and Independent Set Algorithms for Circle Graphs 1993 41 DAMATH Nowakowski, Search and Sweep Numbers of Finite Directed Acyclic Graphs 1993 41 DAMATH Shull & Shuchat & Orlin & Lepp, Recognizing Hidden Bicircular Networks 1993 41 DAMATH Sinden, Coloring Drawings of Bipartite Graphs: A Problem in Automated Assembly 1993 41 DAMATH Arai & Ueno & Kajitani, Generalization of a Theorem on the Parametric Maximum Flow Problem 1993 41 DAMATH Bang-Jensen & Hell, Fast Algorithms for Finding Hamiltonian Paths and Cycles in In-Tournament Digraphs 1992 40 DAMATH Catlin & Grossman & Hobbs & Lai, Fractional Arboricity, Strength, and Principal Partitions in Graphs and Matroids 1992 40 DAMATH Cederbaum & Koren & Wimer, Balanced Block Spacing for VLSI Layout 1992 40 DAMATH Raychaudhuri, Optimal Multiple Interval Assignments in Frequency Assignment and Traffic Phasing 1992 40 DAMATH Schibell & Stafford, Processor Interconnection Networks from Cayley Graphs 1992 40 DAMATH Frank & Nishizeki & Saito & Suzuki & Tardos, Algorithms for Routing around a Rectangle 1992 40 DAMATH Katoh & Ibaraki & Kameda, A Multiversion Cautious Scheduler with Dynamic Serialization Constraints for Database Concurrency Control 1992 40 DAMATH Ko & Ching, Linear Time Algorithms for the Weighted Tailored 2-Partition Problem and the Weighted 2-Center Problem under l_infinity-Distance 1992 40 DAMATH Lee & Chang, Set to Set Broadcasting in Communication Networks 1992 40 DAMATH Levcopoulos & Petersson, Matching Parentheses in Parallel 1992 40 DAMATH Lou & Sarrafzadeh, Circular Permutation Graph Family with Applications 1992 40 DAMATH Afrati, The Parallel Complexity of Single Rule Logic Programs 1992 40 DAMATH Demetrovics & Katona & Miklos, Partial Dependencies in Relational Databases and their Realization 1992 40 DAMATH Demetrovics & Katona & Sali, The Characterization of Branching Dependencies 1992 40 DAMATH Demetrovics & Libkin & Muchnik, Functional Dependencies in Relational Databases: A Lattice Point of View 1992 40 DAMATH Gottlob & Schrefl & Stumptner, Selective Inheritance of Attribute Values in Relational Databases 1992 40 DAMATH Lausen, Locking based on a Pairwise Decomposition of the Transaction System 1992 40 DAMATH Mannila & Raiha, On the Complexity of Inferring Functional Dependencies 1992 40 DAMATH Sagiv & Saraiya, Minimizing Restricted-Fanout Queries 1992 40 DAMATH Thalheim, The Number of Keys in Relational and Nested Relational Databases 1992 40 DAMATH Andreae, Some Results on Visibility Graphs 1992 40 DAMATH Faigle & Schrader & Turan, The Communication Complexity of Interval Orders 1992 40 DAMATH Raghavan, Integer Programming in VLSI Design 1992 40 DAMATH Voss, Steiner's Problem in Graphs: Heuristic Methods 1992 40 DAMATH Wagner & Wagner, An Efficient Parallel Logarithmic Time Algorithm for the Channel Routing Problem 1992 40 DAMATH Wieners-Lummer, A Manhattan Channel Router with Good Theoretical and Practical Performance 1992 39 DAMATH Dror, Openshop Scheduling with Machine Dependent Processing Times 1992 39 DAMATH Flajolet & Gardy & Thimonier, Birthday Paradox, Coupon Collectors, Caching Algorithms and Self-Organizing Search 1992 39 DAMATH Hwang & Richards, The Capacity of the Subarray Partial Concentrators 1992 39 DAMATH Rothblum & Schneider & Schneider, Characterizations of Max-Balanced Flows 1992 39 DAMATH Spinrad, P_4-Trees and Substitution Decomposition 1992 39 DAMATH Ales & Bacik, Strong Elimination Ordering of the Total Graph of a Tree 1992 39 DAMATH Hartvigsen & Zemel, The Complexity of Lifted Inequalities for the Knapsack Problem 1992 39 DAMATH Ishii, Measure Theoretic Approach to the Classification of Cellular Automata 1992 39 DAMATH Bjorner & Karlander & Lindstrom, Communication Complexity of Two Decision Problems 1992 39 DAMATH Deogun & Steiner, Hamiltonian Cycle is Polynomial on Cocomparability Graphs 1992 39 DAMATH Chang & Tang & Lee, Solving the Euclidean Bottleneck Biconnected Edge Subgraph Problem by 2-Relative Neighborhood Graphs 1992 39 DAMATH Manning & Atallah, Fast Detection and Display of Symmetry in Outerplanar Graphs 1992 39 DAMATH Rardin & Sudit, Paroids: A Canonical Format for Combinatorial Optimization 1992 39 DAMATH Shapiro, Random Walks with Absorbing Points 1992 39 DAMATH Vande Vate, Structural Properties of Matroid Matchings 1992 39 DAMATH Marathe & Ravi & Rangan, Generalized Vertex Covering in Interval Graphs 1992 38 DAMATH Allwright, New (Delta,D) Graphs Discovered by Heuristic Search 1992 38 DAMATH Alon, Transmitting in the n-Dimensional Cube 1992 38 DAMATH Bagga & Beineke & Goddard & Lipman & Pippert, A Survey of Integrity 1992 38 DAMATH Bar-Yehuda & Etzion, Connections between Two Cycles -- A New Design of Dense Processor Interconnection Networks 1992 38 DAMATH Camarda & Gerla, Design and Analysis of Fault-Tolerant Multibus Interconnection Networks 1992 38 DAMATH Campbell, Dense Group Networks 1992 38 DAMATH Chung, Graphs with Small Diameter after Edge Deletion 1992 38 DAMATH Cooperman & Finkelstein, New Methods for Using Cayley Graphs in Interconnection Networks 1992 38 DAMATH Das & Ghosh & Deo, Stirling Networks: A Versatile Combinatorial Topology for Multiprocessor Systems 1992 38 DAMATH Fernandez de la Vega & Manoussakis, The Forwarding Index of Communication Networks with Given Connectivity 1992 38 DAMATH Delorme, Examples of Products Giving Large Graphs with Given Degree and Diameter 1992 38 DAMATH Du & Hsu & Peck, Connectivity of Consecutive-d Digraphs 1992 38 DAMATH Faudree & Gould & Lesniak, Generalized Degrees and Menger Path Systems 1992 38 DAMATH Fredricksen, A New Look at the de Bruijn Graph 1992 38 DAMATH Ghafoor, Connectivity, Persistence and Fault Diagnosis of Interconnection Networks based on O_k and 2O_k Graphs 1992 38 DAMATH Gomez & Fiol & Yebra, Graphs on Alphabets as Models for Large Interconnection Networks 1992 38 DAMATH Gordon, Analysis of Minimal Path Routing Schemes in the Presence of Faults 1992 38 DAMATH Graham & Harary, Changing and Unchanging the Diameter of a Hypercube 1992 38 DAMATH Hamidoune & Llado & Serra, The Connectivity of Hierarchical Cayley Digraphs 1992 38 DAMATH Heinrich & Kim & Kumar, Perfect Latin Squares 1992 38 DAMATH Heydemann & Meyer & Opatrny & Sotteau, Forwarding Indices of k-Connected Graphs 1992 38 DAMATH Heydemann & Opatrny & Sotteau, Broadcasting and Spanning Trees in de Bruijn and Kautz Networks 1992 38 DAMATH Hollmann & van Lint, Nonblocking Self-Routing Switching Networks 1992 38 DAMATH Hu & Hwang, An Improved Upper Bound for the Subarray Partial Concentrators 1992 38 DAMATH Jorgensen, Diameters of Cubic Graphs 1992 38 DAMATH Kantor, Some Large Trivalent Graphs Having Small Diameters 1992 38 DAMATH Kruskal & Snir, Cost-Performance Tradeoffs for Interconnection Networks 1992 38 DAMATH Lazard, Broadcasting in DMA-Bound Bounded Degree Graphs 1992 38 DAMATH Liestman & Peters, Minimum Broadcast Digraphs 1992 38 DAMATH Maurer, Asymptotically-Tight Bounds on the Number of Cycles in Generalized de Bruijn-Good Graphs 1992 38 DAMATH Pippenger, The Asymptotic Optimality of Spider-Web Networks 1992 38 DAMATH Plesnik, Heuristics for the Steiner Problem in Graphs 1992 38 DAMATH Rosenberg, Product-Shuffle Networks: Toward Reconciling Shuffles and Butterflies 1992 38 DAMATH Shier & Valvo & Jamison, Generating the States of a Binary Stochastic System 1992 38 DAMATH Sole & Ghafoor & Sheikh, The Covering Radius of Hadamard Codes in Odd Graphs 1992 38 DAMATH Soneoka, Super Edge-Connectivity of Dense Digraphs and Graphs 1992 38 DAMATH Villar, The Underlying Graph of a Line Digraph 1992 38 DAMATH Wada & Kawaguchi, Efficient Fault-Tolerant Fixed Routings on (k+1)-Connected Digraphs 1992 38 DAMATH Zemor & Cohen, Application of Coding Theory to Interconnection Networks 1992 38 DAMATH Zimmerman & Esfahanian, Chordal Rings as Fault-Tolerant Loops 1992 38 DAMATH Bermond & Delorme & Quisquater, Table of Large (Delta,D)-Graphs 1992 36 DAMATH Belouadah & Posner & Potts, Scheduling with Release Dates on a Single Machine to Minimize Total Weighted Completion Time 1992 36 DAMATH Chakradhar & Bushnell, A Solvable Class of Quadratic 0-1 Programming 1992 36 DAMATH Li & McCormick & Simchi-Levi, The Point-to-Point Delivery and Connection Problems: Complexity and Algorithms 1992 36 DAMATH Morris, The Maximum Number of Complementary Facets of a Simplicial Polytope 1992 36 DAMATH Bermond & Hell & Liestman & Peters, Sparse Broadcast Graphs 1992 36 DAMATH Edwards, The Complexity of Some Graph Colouring Problems 1992 36 DAMATH Han & Igarashi & Truszczynski, Indexing Functions and Time Lower Bounds for Sorting on a Mesh-Connected Computer 1992 36 DAMATH Juyan & Mohar, Optimal Linear Labelings and Eigenvalues of Graphs 1992 36 DAMATH Mohar, A Domain Monotonicity Theorem for Graphs and Hamiltonicity 1992 36 DAMATH Zimmermann, Negative Circuits for Flows and Submodular Flows 1992 36 DAMATH Gargano & Korner & Vaccaro, Search Problems for Two Irregular Coins with Incomplete Feedback: The Underweight Model 1992 36 DAMATH Manoussakis, A Linear-Time Algorithm for Finding Hamiltonian Cycles in Tournaments 1992 36 DAMATH Rangan & Govindan, An O(n log n) Algorithm for a Maxmin Location Problem 1992 36 DAMATH Wang & Williams, Addendum to The Threshold Order of a Boolean Function 1992 36 DAMATH Apostolico & Atallah & Hambrusch, New Clique and Independent Set Algorithms for Circle Graphs 1992 36 DAMATH Keil & Schaefer, An Optimal Algorithm for Finding Dominating Cycles in Circular-Arc Graphs 1992 36 DAMATH Kubale, Some Results Concerning the Complexity of Restricted Colorings of Graphs 1992 36 DAMATH van Baronaigien & Ruskey, Generating Permutations with Given Ups and Downs 1992 36 DAMATH Franzkeit, A Binary Search Problem on Graphs 1992 35 DAMATH Cangalovic & Schreuder, Modelling and Solving an Acyclic Multi-period Timetabling Problem 1992 35 DAMATH Csima & Lovasz, A Matching Algorithm for Regular Bipartite Graphs 1992 35 DAMATH de Werra & Blazewicz, Some Preemptive Open Shop Scheduling Problems with a Renewable or a Nonrenewable Resource 1992 35 DAMATH Fahrion & Dollansky, Construction of University Faculty Timetables Using Logic Programming Techniques 1992 35 DAMATH Ferland & Lavoie, Exchanges Procedures for Timetabling Problems 1992 35 DAMATH Hertz, Finding a Feasible Course Schedule Using Tabu Search 1992 35 DAMATH Hilton, Alternating Hamiltonian Circuits in Edge-Coloured Bipartite Graphs 1992 35 DAMATH Katoh & Koyanagi & Ohnishi & Ibaraki, Optimal Strategies for Some Team Games 1992 35 DAMATH Rosa, On a Class of Completable Partial Edge-Colourings 1992 35 DAMATH Schreuder, Combinatorial Aspects of Construction of Competition Dutch Professional Football Leagues 1992 35 DAMATH Tripathy, Computerised Decision Aid for Timetabling -- A Case Analysis 1992 35 DAMATH Katoh, An epsilon-Approximation Scheme for Combinatorial Optimization Problems with Minimum Variance Criterion 1992 35 DAMATH Katoh, A Fully Polynomial Time Approximation Scheme for Minimum Cost-Reliability Ratio Problems 1992 35 DAMATH Butkovic & Cuninghame-Green, An O(n^2) Algorithm for the Maximum Cycle Mean of an n x n Bivalent Matrix 1992 35 DAMATH Masuyama, On the Tree Packing Problem 1992 35 DAMATH Murphy, Computing Independent Sets in Graphs with Large Girth 1992 35 DAMATH Balaz & Kvasnicka & Pospichal, Two Metrics in a Graph Theory Modeling of Organic Chemistry 1992 35 DAMATH Bankovic, Certain Boolean Equations 1992 35 DAMATH Gutjahr & Welzl & Woeginger, Polynomial Graph-Colorings 1992 35 DAMATH Willson, Calculating Growth Rates and Moments for Additive Cellular Automata 1992 35 DAMATH Damaschke, Distances in Cocomparability Graphs and Their Powers 1992 35 DAMATH Faigle & Schrader, A Greedy Reduction Algorithm for Setup Optimization 1991 34 DAMATH Abrahamson & Fellows & Langston & Moret, Constructive Complexity 1991 34 DAMATH Beigel & Gasarch, The Mapmaker's Dilemma 1991 34 DAMATH Bergeron & Labelle & Leroux, Computation of the Expected Number of Leaves in a Tree Having a Given Automorphism, and Related Topics 1991 34 DAMATH Clark & Entringer & Szekely, Threshold Functions for Local Properties of Graphs: Triangles 1991 34 DAMATH Gimbel & Palmer, Matchings and Cycle Covers in Random Digraphs 1991 34 DAMATH Karp, An Introduction to Randomized Algorithms 1991 34 DAMATH Richey, Improved Bounds for Harmonic-based Bin Packing Algorithms 1991 33 DAMATH Bhandari & Garg, A Note on the Covering Radius of Optimum Codes 1991 33 DAMATH Coffey & Goodman & Farrell, New Approaches to Reduced-Complexity Decoding 1991 32 DAMATH Culik & Yu, Cellular Automata, omega omega-Regular Sets, and Sofic Systems 1991 32 DAMATH Ehrenfeucht & Rozenberg, Grammatical Codes of Trees 1991 32 DAMATH Harju & Kleijn, Decidability Problems for Unary Output Sequential Transducers 1991 32 DAMATH Honkala, On Generalized Zeta Functions of Formal Languages and Series 1991 32 DAMATH Hromkovic & Karhumaki & Rovan & Slobodova, On the Power of Synchronization in Parallel Computations 1991 32 DAMATH Niemi, Power Languages and Density 1991 32 DAMATH Ottmann & Wood, Defining Families of Trees with E0L Grammars 1991 32 DAMATH Wrathall, Trace Monoids with Some Invertible Generators: Two Decision Problems 1991 32 DAMATH Bordat, Efficient Polynomial Algorithms for Distributive Lattices 1991 32 DAMATH Burkard & Sandholzer, Efficiently Solvable Special Cases of Bottleneck Travelling Salesman Problems 1991 31 DAMATH Culik & Harju, Splicing Semigroups of Dominoes and DNA 1991 31 DAMATH Olariu, Some Aspects of the Semi-perfect Elimination 1991 31 DAMATH Abhyankar & Chandrasekar & Chandru, Intersection of Algebraic Space Curves 1991 31 DAMATH Agarwal & Aggarwal & Aronov & Kosaraju & Schieber & Suri, Computing External Farthest Neighbors for a Simple Polygon 1991 31 DAMATH Dwyer, Convex Hulls of Samples from Spherically Symmetric Distributions 1991 31 DAMATH Egyed & Wenger, Ordered Stabbing of Pairwise Disjoint Convex Sets in Linear Time 1991 31 DAMATH Fukuda & Saito & Tamura, Combinatorial Face Enumeration in Arrangements and Oriented Matroids 1991 31 DAMATH Fukuda & Saito & Tamura & Tokuyama, Bounding the Number of k-Faces in Arrangements of Hyperplanes 1991 31 DAMATH Goodman & Pollack, The Complexity of Point Configurations 1991 31 DAMATH Jaromczyk & Kowaluk, Constructing the Relative Neighborhood Graph in 3-dimensional Euclidean Space 1991 31 DAMATH Maehara, Distances in a Rigid Unit-Distance Graph in the Plane 1991 31 DAMATH Moser, Problems, Problems, Problems (in computational geometry) 1991 31 DAMATH Reid, The Relationship between Two Algorithms for Decisions via Sophisticated Majority Voting with an Agenda 1991 31 DAMATH Schaffer, Recognizing Brittle Graphs: Remarks on a Paper of Hoang and Khouzam 1991 31 DAMATH Soardi & Woess, Uniqueness of Currents in Infinite Resistive Networks 1991 31 DAMATH Wang & Williams, The Threshold Order of a Boolean Function 1991 31 DAMATH Arikati & Rangan, An Efficient Algorithm for Finding a Two-pair, and Its Applications 1991 30 DAMATH Chretienne, The Basic Cyclic Scheduling Problem with Deadlines 1991 30 DAMATH de Werra & Roberts, On the Use of Augmenting Chains in Chain Packings 1991 30 DAMATH Erdos & Spencer, Lopsided Lovasz Local Lemma and Latin Transversals 1991 30 DAMATH Fraenkel & Scheinerman, A Deletion Game on Hypergraphs 1991 30 DAMATH Hammer & Maffray & Queyranne, Cut-Threshold Graphs 1991 30 DAMATH Hansen & Labbe & Nicolas, The Continuous Center Set of a Network 1991 30 DAMATH Libura, Sensitivity Analysis for Minimum Hamiltonian Path and Traveling Salesman Problems 1991 30 DAMATH Luczak, Holes in Random Graphs 1991 30 DAMATH Spencer, Threshold Spectra via the Ehrenfeucht Game 1991 30 DAMATH Bovet & Constantin & de Werra, A Convoy Scheduling Problem 1991 30 DAMATH Cai & Ellis, NP-Completeness of Edge-Colouring Some Restricted Graphs 1991 30 DAMATH Hassin & Megiddo, Approximation Algorithms for Hitting Objects with Straight Lines 1991 30 DAMATH Iyer & Ratliff & Vijayan, On an Edge Ranking Problem of Trees and Graphs 1991 30 DAMATH Lee, Parallel Machines Scheduling with Nonsimultaneous Machine Available Time 1991 30 DAMATH Zhang & Chen, When Each Hexagon of a Hexagonal System Covers It 1991 30 DAMATH Esik, A Note on Isomorphic Simulation of Automata by Networks of Two-State Automata 1991 30 DAMATH Hwang & Papastavridis, Binary Vectors with Exactly k Nonoverlapping m-tuples of Consecutive Ones 1991 30 DAMATH Yamasaki, A Difficulty in Particular Shannon-like Games 1990 29 DAMATH Adams & Billionnet & Sutter, Unconstrained 0-1 Optimization and Lagrangean Relaxation 1990 29 DAMATH Crama & Hansen & Jaumard, The Basic Algorithm for Pseudo-Boolean Programming Revisited 1990 29 DAMATH Minoux & Barkaoui, Deadlocks and Traps in Petri Nets as Horn-Satisfiability Solutions and Some Related Polynomially Solvable Problems 1990 29 DAMATH Roberts, Meaningfulness of Conclusions from Combinatorial Optimization 1990 29 DAMATH Wolsey, Valid Inequalities for 0-1 Knapsacks and Mips with Generalised Upper Bound Constraints 1990 29 DAMATH Beame, Lower Bounds for Recognizing Small Cliques on CRCW PRAM's 1990 29 DAMATH Chandra & Tompa, The Complexity of Short Two-Person Games 1990 29 DAMATH Gibbons & Karp & Miller & Soroker, Subtree Isomorphism is in Random NC 1990 29 DAMATH Grolmusz & Ragde, Incomparability in Parallel Computation 1990 29 DAMATH Kirkpatrick & Przytycka, Parallel Recognition of Complement Reducible Graphs and Cotree Construction 1990 29 DAMATH Schieber & Vishkin, Finding All Nearest Neighbors for Convex Polygons in Parallel: A New Lower Bound Technique and a Matching Algorithm 1990 29 DAMATH Soroker, Optimal Parallel Construction of Prescribed Tournaments 1990 28 DAMATH Bauer & Hakimi & Schmeichel, Recognizing Tough Graphs is NP-Hard 1990 28 DAMATH Boyd & Faigle, An Algorithmic Characterization of Antimatroids 1990 28 DAMATH Mamer & Schilling, On the Growth of Random Knapsacks 1990 28 DAMATH Ryan, The Structure of an Integral Monoid and Integer Programming Feasibility 1990 28 DAMATH Idzik, Communication in m-Connected Graphs 1990 28 DAMATH Naor, Succinct Representation of General Unlabeled Graphs 1990 28 DAMATH Aurenhammer, A Relationship between Gale Transforms and Voronoi Diagrams 1990 28 DAMATH Chang & Lee, On the Continuous Working Problem 1990 28 DAMATH Eades & Wormald, Fixed Edge-Length Graph Drawing is NP-Hard 1990 28 DAMATH Langston & Morford, Resource Allocation under Limited Sharing 1990 28 DAMATH Furedi, Perfect Error-Correcting Databases 1990 28 DAMATH Von Arnim & Faigle & Schrader, The Permutahedron of Series-Parallel Posets 1990 28 DAMATH Blazewicz & Drozdowski & Schmidt & de Werra, Scheduling Independent Two Processor Tasks on a Uniform Duo-Processor System 1990 28 DAMATH Burkard & Yao, Constrained Partitioning Problems 1990 28 DAMATH Hammer & Peled & Sun, Difference Graphs 1990 28 DAMATH Hochbaum & Shamir, Minimizing the Number of Tardy Job Units under Release Time Constraints 1990 28 DAMATH Martello & Toth, Lower Bounds and Reduction Procedures for the Bin Packing Problem 1990 28 DAMATH Yang & Du, The Complexity of Determinacy Problem on Group Testing 1990 27 DAMATH Aggarwal & Klawe, Applications of Generalized Matrix Searching to Geometric Algorithms 1990 27 DAMATH Alon & Azar & Ravid, Universal Sequences for Complete Graphs 1990 27 DAMATH Anstee, Simplified Existence Theorems for (g,f)-factors 1990 27 DAMATH Avis & Doskas, Algorithms for High Dimensional Stabbing Problems 1990 27 DAMATH Azar & Pippenger, Parallel Selection 1990 27 DAMATH Cheah & Corneil, The Complexity of Regular Subgraph Recognition 1990 27 DAMATH Dadoun & Kirkpatrick, Parallel Algorithms for Fractional and Maximal Independent Sets in Planar Graphs 1990 27 DAMATH Hammer & Maffray, Completely Separable Graphs 1990 27 DAMATH Harms & Colbourn, Probabilistic Single Processor Scheduling 1990 27 DAMATH Matula & Shahrokhi, Sparsest Cuts and Bottlenecks in Graphs 1990 27 DAMATH Nagamochi & Ibaraki, Multicommodity Flows in Certain Planar Directed Networks 1990 27 DAMATH Nowakowski & Rival & Urrutia, Representing Orders on the Plane by Translating Points and Lines 1990 27 DAMATH Suzuki & Ishiguro & Nishizeki, Edge-disjoint Paths in a Grid Bounded by Two Nested Rectangles 1990 27 DAMATH Winkler, Mean Distance in a Tree 1990 27 DAMATH Bromfield & Piper, Linear Recursion Properties of Uncorrelated Binary Sequences 1990 27 DAMATH Cheston & Fricke & Hedetniemi & Jacobs, On the Computational Complexity of Upper Fractional Domination 1990 27 DAMATH Fishburn & Roberts & Marcus-Roberts, Van Lier Sequences 1990 27 DAMATH Soneoka & Nakada & Imase, Design of a d-Connected Digraph with a Minimum Number of Edges and a Quasiminimal Diameter 1990 27 DAMATH Williams & Richards, Efficient Algorithms for Path Partitions 1990 27 DAMATH Chaimovich, Subset-Sum Problems with Different Summands: Computation 1990 27 DAMATH Cunningham, Computing the Binding Number of a Graph 1990 27 DAMATH Ryan, Fractional Total Colouring 1990 26 DAMATH Jeroslow, Two Mixed Integer Programming Formulations Arising in Manufacturing Management 1990 26 DAMATH Dyer & Frieze, On an Optimization Problem with Nested Constraints 1990 26 DAMATH Aboudi & Jornsten, Resource Constrained Assignment Problems 1990 26 DAMATH Laporte & Martello, The Selective Travelling Salesman Problem 1990 26 DAMATH Smith & Meyer & Thompson, Lower Bounds for the Symmetric Travelling Salesman Problem from Lagrangean Relaxations 1990 26 DAMATH Price & Woodhams, Combinatorial Optimisation Algorithms for a CAD Workstation 1990 26 DAMATH Abdul-Razaq & Potts & Van Wassenhove, A Survey of Algorithms for the Single Machine Total Weighted Tardiness Scheduling Problem 1990 26 DAMATH Dyer & Wolsey, Formulating the Single Machine Sequencing Problem with Release Dates as a Mixed Integer Program 1990 26 DAMATH Nowicki & Zdrzatka, A Survey of Results for Sequencing Problems with Controllable Processing Times 1990 26 DAMATH Rifa & Huguet, Classification of a Class of Distance-Regular Graphs via Completely Regular Codes 1990 26 DAMATH Bang-Jensen & Hell, The Effect of Two Cycles on the Complexity of Colourings by Directed Graphs 1990 26 DAMATH Bennett & Wu, On Minimum Matrix Representation of Closure Operations 1990 26 DAMATH de Werra & Jacot-Descombes & Masson, A Constrained Sports Scheduling Problem 1990 26 DAMATH Dubois, On the r,s-SAT Satisfiability Problem and a Conjecture of Tovey 1990 26 DAMATH Fischetti, A New Linear Storage, Polynomial-Time Approximation Scheme for the Subset-Sum Problem 1990 26 DAMATH Hao, The Optimal Procedures for Quantitative Group Testing 1990 26 DAMATH Li & McCormick & Simchi-Levi, The Complexity of Finding Two Disjoint Paths with Min-Max Objective Function 1989 25 DAMATH Ash & Blake & Vanstone, Low Complexity Normal Bases 1989 25 DAMATH Dershowitz & Saks, Patterns in Trees 1989 25 DAMATH Perl, Better Understanding of Batcher's Merging Networks 1989 25 DAMATH Pippenger, Knots in Random Walks 1989 25 DAMATH Scheinerman & Wierman, Optimal and Near-Optimal Broadcast in Random Graphs 1989 25 DAMATH Vince, Scheduling Periodic Events 1989 25 DAMATH Ravi, On the Orderability Problem of PLA Folding 1989 25 DAMATH Shih & Hsu, An O(n^1.5) Algorithm to Color Proper Circular Arcs 1989 25 DAMATH Brualdi & Pless, Polyadic Codes 1989 25 DAMATH Chen, A New Complete Language for DSPACE(log n) 1989 25 DAMATH Collins, On a Conjecture of Graham and Lovasz about Distance Matrices 1989 25 DAMATH Erdos & Hajnal, Ramsey-type Theorems 1989 25 DAMATH Fraenkel & Lorberbom, Epidemiography with Various Growth Functions 1989 25 DAMATH Friedland, Coherent Algebras and the Graph Isomorphism Problem 1989 25 DAMATH Kantor, Some Cayley Graphs for Simple Groups 1989 25 DAMATH Kauffman, A Tutte Polynomial for Signed Graphs 1989 25 DAMATH Kirschenhofer & Prodinger & Szpankowski, On the Variance of the External Path Length in a Symmetric Digital Trie 1989 25 DAMATH Main, Detecting Leftmost Maximal Periodicities 1989 25 DAMATH Shen & Cai & Liu & Kruskal, Generalized Latin Squares I 1989 25 DAMATH Vazirani & Yannakakis, Pfaffian Orientations, 0-1 Permanents, and Even Cycles in Directed Graphs 1989 24 DAMATH Berge, A New Color Change to Improve the Coloring of a Graph 1989 24 DAMATH Bergeron, Algorithms for Sequential Generation of Combinatorial Structures 1989 24 DAMATH Blumer & Ehrenfeucht & Haussler, Average Sizes of Siffix Trees and DAWGs 1989 24 DAMATH Blumer & Littlestone, Learning Faster than Promised by the Vapnik-Chervonenkis Dimension 1989 24 DAMATH Bouchet, Matchings and Delta-Matroids 1989 24 DAMATH Bourjolly & Pulleyblank, Koenig-Egervary Graphs, 2-Bicritical Graphs and Fractional Matchings 1989 24 DAMATH Brlek, Enumeration of Factors in the Thue-Morse Word 1989 24 DAMATH Cameron, Induced Matchings 1989 24 DAMATH Cohen & Simonyi, Coding for Write-Unidirectional Memories and Conflict Resolution 1989 24 DAMATH Fleischner, Elementary Proofs of (Relatively) Recent Characterizations of Eulerian Graphs 1989 24 DAMATH Guessarian, Fixpoint Strategies for Deductive Databases 1989 24 DAMATH Haddad & Rosenberg, Maximal Partial Clones Determined by the Areflexive Relations 1989 24 DAMATH Hall, Codes and Matrices in Studies on Designs 1989 24 DAMATH Homobono & Peyrat, Fault-Tolerant Routings in Kautz and de Bruijn Networks 1989 24 DAMATH Ito & Jurgensen & Shyr & Thierrin, Anti-Commutative Languages and n-Codes 1989 24 DAMATH Labelle & Yeh, Dyck Paths of Knight Moves 1989 24 DAMATH Saheb, Concurrency Measure in Commutation Monoids 1989 24 DAMATH Simion, Finite Automata for Languages of Combinatorial Interest: An Order Theoretical Point of View 1989 24 DAMATH Simovici & Reischer, An Algebraic Point of View of the Data Structures of Database Systems 1989 23 DAMATH Heydemann & Meyer & Sotteau, On Forwarding Indices of Networks 1989 23 DAMATH Labahn, Extremal Broadcasting Problems 1989 23 DAMATH Llewellyn & Tovey & Trick, Local Optimization on Graphs 1989 23 DAMATH Andreae, A Ternary Search Problem on Graphs 1989 23 DAMATH Arnborg & Proskurowski, Linear Time Algorithms for NP-Hard Problems Restricted to Partial k-Trees 1989 23 DAMATH Aupperle & Keil, Polynomial Algorithms for Restricted Euclidean p-Centre Problems 1989 23 DAMATH Bucher, On the Generation of Powers by OS Schemes 1989 23 DAMATH Capocelli & Vaccaro, Structure of Decoders for Multivalued Encodings 1989 23 DAMATH Zdrzalka & Grabowski, An Algorithm for Single Machine Sequencing with Release Dates to Minimize Maximum Cost 1989 23 DAMATH Champarnaud & Pin, A Maxmin Problem on Finite Automata 1989 22 DAMATH Bermond & Fourneau & Jean-Marie, A Graph Theoretical Approach to Equivalence of Multistage Interconnection Networks 1989 22 DAMATH Marlowe & Paull, Least-Cost Partition Algorithms 1989 22 DAMATH Ivanyi, Construction of Infinite de Bruijn Arrays 1988 22 DAMATH Franco & Ho, Probabilistic Performance of a Heuristic for the Satisfiability Problem 1988 21 DAMATH Atallah & Manacher & Urrutia, Finding a Minimum Independent Dominating Set in a Permutation Graph 1988 21 DAMATH Brecht & Colbourn, Lower Bounds on Two-Terminal Network Reliability 1988 21 DAMATH Bucher, A Note on Regular Classes in Special Thue Systems 1988 21 DAMATH Klarner, m-Recognizability of Sets Closed under Certain Affine Functions 1988 21 DAMATH Mitchell & Piper, Key Storage in Secure Networks 1988 21 DAMATH Murgolo, Anomalous Behavior in Bin Packing Algorithms 1988 21 DAMATH Saks & Statman, An Intersection Problem for Finite Automata 1988 21 DAMATH Gimbel, End Vertices in Interval Graphs 1988 21 DAMATH Honkala, A Defect Property of Codes with Unbounded Delays 1988 21 DAMATH Kari, A Cryptanalytic Observation Concerning Systems Based on Language Theory 1988 21 DAMATH Hell & Liestman, Broadcasting in One Dimension 1988 21 DAMATH Naddef & Santos, One-Pass Batching Algorithms for the One-Machine Problem 1988 21 DAMATH Csirik & Totik, Online Algorithms for a Dual Version of Bin Packing 1988 20 DAMATH Ehrenfeucht & Haussler, A New Distance Metric on Strings Computable in Linear Time 1988 20 DAMATH Holm & Tind, A Unified Approach for Price Directive Decomposition Procedures in Integer Programming 1988 20 DAMATH Kobayashi, Enumeration of Irreducible Binary Words 1988 20 DAMATH Lee & Massey, Multiprocessor Scheduling: Combining LPT and MULTIFIT 1988 20 DAMATH Mahmoud & Pittel, On the Joint Distribution of the Insertion Path Length and the Number of Comparisons in Search Trees 1988 20 DAMATH Vyskoc, Partial Information in Public Key Cryptography 1988 20 DAMATH Yu, Can the Catenation of Two Weakly Sparse Languages be Dense? 1988 20 DAMATH Bienstock, Broadcasting with Random Faults 1988 20 DAMATH Goecke, A Greedy Algorithm for Hereditary Set Systems and a Generalization of the Rado-Edmonds Characterization of Matroids 1987 18 DAMATH Tuza, On the Context-free Production Complexity of Finite Languages 1987 18 DAMATH Larcher & Tichy, A Note on Gray Code and Odd-Even Merge 1987 18 DAMATH Carpaneto & Toth, Primal-Dual Algorithms for the Assignment Problem 1987 18 DAMATH Chegireddy & Hamacher, Algorithms for Finding K-Best Perfect Matchings 1987 18 DAMATH Laporte & Mercure & Nobert, Generalized Travelling Salesman Problem through n Sets of Nodes: The Asymmetrical Case 1987 18 DAMATH Luna & Ziviani & Cabral, The Telephonic Switching Centre Network Problem: Formalization and Computational Experience 1987 18 DAMATH Yanasse & Soma, A New Enumeration Scheme for the Knapsack Problem 1987 17 DAMATH Jeroslow, Representability in Mixed Integer Programming, I: Characterization Results 1987 17 DAMATH Pardalos & Rosen, Bounds for the Solution Set of Linear Complementarity Problems 1987 17 DAMATH Plesnik, A Heuristic for the p-Center Problem in Graphs 1987 17 DAMATH Franco & Plotkin & Rosenthal, Correction to Probabilistic Analysis of the Davis Putnam Procedure for Solving the Satisfiability Problem 1987 17 DAMATH Fujishige, An Out-of-Kilter Method for Submodular Flows 1987 17 DAMATH Iri, A Very Personal Reminiscence on the Problem of Computational Complexity 1987 17 DAMATH Ishii & Masuda & Nishida, Two Machine Mixed Shop Scheduling Problem with Controllable Machine Speeds 1987 17 DAMATH Katoh & Ibaraki, A Parametric Characterization and an epsilon-Approximation Scheme for the Minimization of a Quasiconcave Program 1987 17 DAMATH Masuzawa & Hagihara & Tokura, An Optimal Time Algorithm for the k-Vertex-Connectivity Unweighted Augmentation Problem for Rooted Directed Trees 1987 17 DAMATH Murota, Menger-Decomposition of a Graph and its Application to the Structural Analysis of a Large-scale System of Equations 1987 17 DAMATH Murota, Homotopy Base of an Acyclic Graph--A Combinatorial Analysis of Commutative Diagrams by Means of Preordered Matroid 1987 17 DAMATH Murota & Fujishige, Finding a Homotopy Base for Directed Paths in an Acyclic Graph 1987 17 DAMATH Ozawa, The Principal Partition of a Pair of Graphs and its Application 1987 17 DAMATH Sekiguchi, A Decomposition Theory Based on a Dominance Relation and Composite Jobs 1987 16 DAMATH Barahona & Pulleyblank, Exact Arborescences, Matchings and Cycles 1987 16 DAMATH Bertossi & Bonucelli, Some Parallel Algorithms on Interval Graphs 1987 16 DAMATH Bovet & Panconesi, Inclusion Relationships Among Permutation Problems 1987 16 DAMATH Chetwynd & Hilton, The Edge-Chromatic Class of Regular Graphs of Degree 4 and Their Complements 1987 16 DAMATH Dyer & Walker, An Algorithm for a Separable Integer Programming Problem with Cumulatively Bounded Variables 1987 16 DAMATH Hammer & Sarvate, Encryption Using Hungarian Rings 1987 16 DAMATH Xie, Notes on de Bruijn Sequences 1987 16 DAMATH Kalantari & Rosen, Penalty Formulation for Zero-One Nonlinear Programming 1987 16 DAMATH Tuza, On Two Intersecting Set Systems and k-Continuous Boolean Functions 1987 16 DAMATH Conforti & Cornuejols, Erratum: Submodular Set Functions, Matroids and the Greedy Algorithm: Tight Worst-Case Bounds and Some Generalizations of the Rado-Edmonds Theorem 1987 16 DAMATH Lange & Welzl, String Grammars with Disconnecting or a Basic Root of the Difficulty in Graph Grammar Parsing 1986 15 DAMATH Balas, A Fast Algorithm for Finding an Edge-Maximal Subgraph with TR-Formative Coloring 1986 15 DAMATH Bein & Brucker, Greedy Concepts for Network Flow Problems 1986 15 DAMATH Burkard, Optimal Schedules of Periodically Recurring Events 1986 15 DAMATH Camerini & Maffioli & Martello & Toth, Most and Least Uniform Spanning Trees 1986 15 DAMATH Chung & Murty & Chang, On K^Delta 1986 15 DAMATH Derigs & Goecke & Schrader, Monge Sequences and a Simple Assignment Algorithm 1986 15 DAMATH Faigle & Schrader, On the Computational Complexity of the Order Polynomial 1986 15 DAMATH Foulds, Testing the Theory of Evolution: A Novel Application of Combinatorial Optimization 1986 15 DAMATH Korte & Lovasz, Homomorphisms and Ramsey Properties of Antimatroids 1986 15 DAMATH Lawler & Martel, Polymatroidal Flows with Lower Bounds 1986 15 DAMATH Mehlhorn & Schmidt, On BF-orderable Sets 1986 15 DAMATH Tseng & Truemper, A Decomposition of the Matroids with the Max-Flow Min-Cut Property 1986 15 DAMATH Zimmermann, Duality for balanced Submodular Flows 1986 15 DAMATH Hall & Hochbaum, A Fast Approximation Algorithm for the Multicovering Problem 1986 15 DAMATH Hamacher, Maximal Dynamic Polymatroid Flows and Applications 1986 15 DAMATH Harju & Karhumaki & Kleijn, On Morphic Generation of Regular Languages 1986 15 DAMATH Yu, A Property of Real-time Trellis Automata 1986 14 DAMATH Aigner, Search Problems on Graphs 1986 14 DAMATH Chandrasekaran, Recognition of Gilmore-Gomory Traveling Salesman Problem 1986 14 DAMATH Colbourn & Kocay & Stinson, Some NP-Complete Problems for Hypergraph Degree Sequences 1986 14 DAMATH Cordes & Reid, Largest Polygons with Vertices in a Given Set 1986 14 DAMATH Greenberg, On Equivalent Knapsack Problems 1986 14 DAMATH Hansen & Simeone, Unimodular Functions 1986 14 DAMATH Simeone, An Asymptotically Exact Polynomial Algorithm for Equipartition Problems 1986 14 DAMATH Tchuente, Computation on Binary Tree-Networks 1986 14 DAMATH Kindervater & Lenstra, An Introduction to Parallelism in Combinatorial Optimization 1986 14 DAMATH Maffioli, Randomized Algorithms in Combinatorial Optimization: A Survey 1986 14 DAMATH Rinnooy Kan & Frenk, The Rate of Convergence to Optimality of the LPT Rule 1986 14 DAMATH Schrijver, Polyhedral Proof Methods in Combinatorial Optimization 1986 14 DAMATH van Roy & Wolsey, Valid Inequalities for Mixed 0-1 Programs 1984 9 DAMATH Vishkin, An Optimal Parallel Connectivity Algorithm 1984 9 DAMATH Roberts, Applications of Ramsey Theory 1983 5 DAMATH Blazewicz & Lenstra & Rinnooy Kan, Scheduling Subject to Resource Constraints: Classification and Complexity 1983 5 DAMATH Edwards & Elphick, Lower Bounds for the Clique and the Chromatic Numbers of a Graph 1983 5 DAMATH Franco & Paull, Probabilistic Analysis of the Davis Putnam Procedure for Solving the Satisfiability Problem 1983 5 DAMATH Irving, NP-Completeness of a Family of Graph-Colouring Problems 1983 5 DAMATH Mansfield, On the Computational Complexity of a Merge Recognition Problem 1983 5 DAMATH Welsh, Randomised Algorithms 1996 6 DCC Frey & Hinton, Free Energy Coding 1996 6 DCC Moffat & Stuiver, Exploiting Clustering in Inverted File Compression 1996 6 DCC Louchard & Szpankowski, Averaged Redundancy Rate of the Lempel-Ziv Code 1996 6 DCC Yokoo, An Adaptive Data Compression Method Based on Context Sorting 1996 6 DCC Moffat & Turpin, On the Implementation of Minimum-Redundancy Prefix Codes 1996 6 DCC Cohn & Khazan, Parsing with Suffix and Prefix Dictionaries 1996 6 DCC Larsson, Extended Application of Suffix Trees to Data Compression 1996 6 DCC Franaszek & Robinson & Thomas, Parallel Compression with Cooperative Dictionary Construction 1996 6 DCC Howard, Lossless and Lossy Compression of Text Images by Soft Pattern Matching 1996 6 DCC Culik & Valenta, Finite Automata Based Compression of Bi-Level Images 1996 6 DCC Broder & Mitzenmacher, Pattern-Based Compression of Text Images 1996 6 DCC Acharya & JaJa, Enhancing Lempel-Ziv Codes Using an On-Line Variable Length Binary Encoding 1996 6 DCC Arnavut, Lossless Compression Using Inversions on Multiset Permutations 1996 6 DCC Atallah & Genin & Szpankowski, Pattern Matching Image Compression 1996 6 DCC Bloom, LZP: A New Data Compression Algorithm 1996 6 DCC Chen & Reif, Efficient Lossless Compression of Trees and Graphs 1996 6 DCC Chiu & Berger, Video Compression Using Fax Techniques 1996 6 DCC Fawcett, Combination Coding: A New Entropy Coding Technique 1996 6 DCC Franceschini & Mukherjee, Data Compression Using Encrypted Text 1996 6 DCC Kiselyov & Fisher, Image Compression with Iterated Function Systems, Finite Automata and Zerotrees: Grand Unification 1996 6 DCC Kontoyiannis & Suhov, Stationary Entropy Estimation via String Matching 1996 6 DCC Rivals & Delahaye & Dauchet & Delgrange, A Guaranteed Compression Scheme for Repetitive DNA Sequences 1995 DCC Forchlammer & Rissanen, Coding with Partially Hidden Markov Models 1995 DCC Fowler & Arps & El Gamal & Yang, Quadtree Based JBIG Compression 1995 DCC Vander Kam & Gray, Lossy Compression of Clustered-Dot Halftones Using Sub-Cell Prediction 1995 DCC Estes & Algazi, Efficient Error Free Chain Coding of Binary Documents 1995 DCC Wu & Fang, New Algorithms for Optimal Binary Vector Quantizer Design 1995 DCC Culik & Kari, Finite State Methods for Compression and Manipulation of Images 1995 DCC Ginesta & Kim, A Derailment-Free Finite-State Vector Quantizer with Optimized State Codebooks 1995 DCC Nagumo & Lu & Watson, Parallel Algorithms for the Static Dictionary Compression 1995 DCC Belinskaya & DeAgostino & Storer, Near Optimal Compression with Respect to a Static Dictionary on a Practical Massively Parallel Architecture 1995 DCC Cheung & Kiely, An Efficient Variable Length Coding Scheme for an IID Source 1995 DCC Moffat & Turpin & Katajainen, Space-Efficient Construction of Optimal Prefix Codes 1995 DCC Moffat & Neal & Witten, Arithmetic Coding Revisited 1995 DCC Zandi & Allen & Schwartz & Boliek, CREW: Compression with Reversible Embedded Wavelets 1995 DCC Saupe, Accelerating Fractal Image Compression by Multi-Dimensional Nearest Neighbor Search 1995 DCC Davis, Self-Quantized Wavelet Subtrees: A Wavelet-Based Theory for Fractal Image Compression 1995 DCC Kominek, Convergence of Fractal Encoded Images 1995 DCC Barnes & Watkins, Embedded Wavelet Zerotree Coding with Direct Sum Quantization Structures 1995 DCC Louchard & Szpankowski, Generalized Lempel-Ziv Parsing Scheme and its Preliminary Analysis 1995 DCC Hoang & Long & Vitter, Multiple-Dictionary Compression Using Partial Matching 1995 DCC Chen & Reif, Fast Pattern Matching for Entropy Bounded Text 1995 DCC Teng & Neuhoff, An Improved Hierarchical Lossless Text Compression Algorithm 1995 DCC Horspool, The Effect of Non-Greedy Parsing in Ziv-Lempel Compression Methods 1994 DCC Merhav & Feder, The Minimax Redundancy is a Lower Bound for Most Sources 1994 DCC Azhar & Badros & Glodjo & Kao & Reif, Data Compression Techniques for Stock Market Prediction 1994 DCC Abrahams, Huffman-Type Codes for Infinite Source Distributions 1994 DCC Inglis & Witten, Compression-Based Template Matching 1994 DCC Moffat & Sharman & Zobel, Static Compression for Dynamic Texts 1994 DCC Hirschberg & Stauffer, Parsing Algorithms for Dictionary Compression on the PRAM 1994 DCC Gutmann & Bell, A Hybrid Approach to Text Compression 1994 DCC Constantinescu & Storer, Improved Techniques for Single-Pass Adaptive VQ 1994 DCC Mukherjee & Acharya, Compressed Pattern Matching 1994 DCC Wei & Lan, Parallel Decoding of Huffman Codes 1994 DCC Culik & Kari, A Recursive Algorithm for Image Compression with Finite Automata 1992 DCC Haddadin & Mathews & Stockham, Subband Vector Quantization of Images Using Hexagonal Filter Banks 1992 DCC Buhmann & Kuhnel, Complexity Optimized Vector Quantization: A Neural Network Approach 1992 DCC Lin & Vitter, Nearly Optimal Vector Quantization via Linear Programming 1992 DCC Reif & Yoshida, Optical Techniques for Image Compression 1992 DCC Witten & Bell & Harrison & James & Moffat, Textual Image Compression 1992 DCC De Agostino & Storer, Parallel Algorithms for Optimal Compression Using Dictionaries with the Prefix Property 1992 DCC Horspool & Cormack, Constructing Word-Based Text Compression Algorithms 1992 DCC Moffat & Zobel, Coding for Compression in Full-Text Retrieval Systems 1992 DCC Bookstein & Klein & Raita, Model Based Concordance Compression 1992 DCC Savari & Gallager, Arithmetic Coding for Memoryless Cost Channels 1992 DCC Weinberger & Lempel & Ziv, On the Coding Delay of a General Coder 1992 DCC Sheinwald, On Binary Alphabetical Codes 1992 DCC Stauffer & Hirschberg, Transpose Coding on the Systolic Array 1992 DCC Carpentieri & Storer, A Split-Merge Parallel Block-Matching Algorithm for Video Displacement Estimation 1992 DCC Ali & Papadopoulos & Clarkson, The Use of Fractal Theory in a Video Compression System 1992 DCC Howard & Vitter, Error Modeling for Hierarchical Lossless Image Compression 1992 DCC Amir & Benson, Efficient Two-Dimensional Compressed Matching 1992 DCC Wang & Wu, Vector Run-length Coding of Bilevel Images 1992 DCC Howard & Vitter, Parallel Lossless Image Compression Using Huffman and Arithmetic Coding 1992 DCC Hopper & Preston, Compression of Grey-Scale Fingerprint Images 1992 DCC Lin & Storer, Improving Search for Tree-Structured Vector Quantization 1992 DCC Chen & Zhang & Sheu, An Adaptive High-Speed Lossy Data Compression 1992 DCC Gammerman & Bellotti, Experiments Using Minimal-Length Encoding to Solve Machine Learning Problems 1992 DCC Jacobson, Random Access in Huffman-Coded Files 1991 DCC Howard & Vitter, Analysis of Arithmetic Coding for Data Compression 1991 DCC Langdon, Probabilistic and Q-Coder Algorithms for Binary Source Adaptation 1991 DCC Witten & Bell & Nevill, Models for Compression in Full-Text Retrieval Systems 1991 DCC Teuhola & Raita, Piecewise Arithmetic Coding 1991 DCC Chevion & Karnin & Walach, High Efficiency, Multiplication Free Approximation of Arithmetic Coding 1991 DCC Malak & Baker, An Image Database for Low Bandwidth Communication Links 1991 DCC Lin & Storer & Cohn, On the Complexity of Optimal Tree Pruning for Source Coding 1991 DCC Wu & Yao, Image Coding by Adaptive Tree-Structured Segmentation 1991 DCC Memon & Magliveras & Sayood, Prediction Trees and Lossless Image Compression: An Extended Abstract 1991 DCC Markas & Reif, Image Compression Methods with Distortion Controlled Capabilities 1991 DCC Fischer & Wang, Entropy-Constrained Trellis Coded Quantization 1991 DCC Cosman & Riskin & Gray, Combining Vector Quantization and Histogram Equalization 1991 DCC Nguyen & Mark, Concentric-Shell Partition Vector Quantization with Application to Image Coding 1991 DCC Frost & Barnes & Xu, Design and Performance of Residual Quantizers 1991 DCC Xue & Crissey, An Iteratively Interpolative Vector Quantization Algorithm for Image Data Compression 1991 DCC Polit & Nasrabadi, A New Transform Domain Vector Quantization Technique for Image Data Compression in an Asynchronous Transfer Mode Network 1991 DCC Lindsay & Abercrombie, Restricted Boundary Vector Quantization 1991 DCC Liu & Ma, W-Orbit Finite Automata for Data Compression 1991 DCC Pentland & Horowitz, A Practical Approach to Fractal-Based Image Compression 1991 DCC Devore & Jawerth & Lucier, Data Compression Using Wavelets: Error, Smoothness, and Quantization 1991 DCC Lewis & Knowles, A 64 Kb/s Video Codec Using the 2-D Wavelet Transform 1991 DCC Wyner & Ziv, Fixed Data Base Version of the Lempel-Ziv Data Compression Algorithm 1991 DCC Freeman, Asymptotic Convergence of Dual-Tree Entropy Codes 1991 DCC Sheinwald & Lempel & Ziv, On Compression with Two-Way Head Machines 1991 DCC Gerencser, Asymptotics of Predictive Stochastic Complexity 1991 DCC Weinberger & Ziv & Lempel, On the Optimal Asymptotic Performance of Universal Ordering and Discrimination of Individual Sequences 1991 DCC Szpankowski, A Typical Behaviour of Some Data Compression Schemes 1991 DCC Howard & Vitter, New Methods for Lossless Image Compression Using Arithmetic Coding 1991 DCC Leung & Skiena, Inducing Codes from Examples 1991 DCC Perl & Maram & Kadakuntla, The Cascading of the LZW Compression Algorithm with Arithmetic Coding 1991 DCC Bodlaender & Gonzales & Kloks, Complexity Aspects of Map Compression 1991 DCC De Santis & Persiano, An Optimal Algorithm for the Construction of Optimal Prefix Codes with Given Fringe 1991 DCC Robinson, Compression of Natural Images Using Thread-like Visual Primitives 1991 DCC Lelewer & Hirschberg, Streamlining Context Models for Data Compression 1991 DCC Promhouse & Bennett, Semantic Data Compression 1991 DCC Horspool, Improving LZW 1991 DCC Fang & Sheu & Chen, A Neural Network Based VLSI Vector Quantizer for Real-Time Image Compression 1991 DCC Mukherjee & Bheda & Bassiouni & Acharia, Multibit Decoding/Encoding of Binary Codes Using Memory Based Architectures 1991 DCC Williams, An Extremely Fast Ziv-Lempel Data Compression Algorithm 1991 DCC Jones, Practical Evaluation of Data a Compression Algorithm 1991 DCC Moffat, Two-Level Context Based Compression of Binary Images 1991 DCC Wu & Zhang, A Better Tree-Structured Vector Quantizer 1991 DCC Bookstein & Klein, Flexible Compression for Bitmap Sets 1991 DCC Tilton & Han & Manohar, Compression Experiments with AVHRR Data 1965 DCTOP Thom, Sur L'Homologie des Varietes Algebriques Reelles 1996 21 DDJ Aitken, Moving from C++ to Java (March) 1996 21 DDJ DeVos, A Compact Logarithm Algorithm (March) 1996 21 DDJ Hofri, Binary Search (February) 1988 15 DDJ Porter, What is Modula-2? 1992 DFGSJI Alt & Blomer, Resemblance and Symmetries of Geometric Patterns 1992 DFGSJI Fleischer & Fries & Mehlhorn & Meiser & Naher & Rohnert & Schirra & Simon & Tsakalidis & Uhrig, Selected Topics from Computational Geometry, Data Structures and Motion Planning 1992 DFGSJI Hofting & Lengauer & Wanke, Processing of Hierarchically Defined Graphs and Graph Families 1992 DFGSJI Kriegel & Brinkhoff & Schneider, The Combination of Spatial Access Methods and Computational Geometry in Geographic Database Systems 1992 DFGSJI Kriegel & Heep & Heep & Schiwietz & Schneider, A Flexible and Extensible Index Manager for Spatial Database Systems 1992 DFGSJI Kriegel & Horn & Schiwietz, The Performance of Object Decomposition Techniques for Spatial Query Processing 1992 DFGSJI Muller & Winckler, Distributed Image Synthesis with Breadth-First Ray Tracing and the Ray-Z-Buffer 1992 DFGSJI Nilsson & Ottmann & Schuierer & Icking, Restricted Orientation Computational Geometry 1992 DFGSJI Noltemeier & Verbarg & Zirkelbach, Monotonous Bisector Trees--A Tool for Efficient Partitioning of Complex Scenes of Geometric Objects 1992 DFGSJI Schmeltz, Learning Convex Sets Under Uniform Distribution 1992 DFGSJI Six & Widmayer, Spatial Access Structures for Geometric Databases 1992 DFGSJI Welzl, On Spanning Trees with Low Crossing Numbers 1992 DFGSJI Dietzfelbinger & Meyer auf der Heide, High Performance Universal Hashing, with Applications to Shared Memory Simulations 1992 DFGSJI Feldmann & Mysliwietz & Monien, Distributed Game Tree Search on a Massively Parallel System 1992 DFGSJI Kunde & Tensi, Balanced Strategies for Routing on Meshes 1992 DFGSJI Kutylowski, Complexity of Boolean Functions on PRAMs--Lower Bound Techniques 1992 DFGSJI Kroger & Vornberger, Enumerative vs. Genetic Optimization: Two Parallel Algorithms for the Bin Packing Problem 1992 DFGSJI Reischuk & Schmeltz, Area Efficient Methods to Increase the Reliability of Circuits 1987 DIGITAL da Cruz, Kermit: A File Transfer Protocol 1996 27 DIMACS Lipton & Baum (Eds.), DNA Based Computers: Proceedings of a DIMACS Workshop, April 4, 1995, Princeton University 1996 27 DIMACS Adleman, On Constructing a Molecular Computer 1996 27 DIMACS Baum, A DNA Associative Memory Potentially Larger than the Brain 1996 27 DIMACS Beaver, A Universal Molecular Computer 1996 27 DIMACS Boneh & Dunworth & Lipton, Breaking DES Using a Molecular Computer 1996 27 DIMACS Lipton, Speeding Up Computations via Molecular Biology 1996 27 DIMACS Wilhelm & Rothemund, A DNA and Restriction Enzyme Implementation of Turing Machines 1996 27 DIMACS Smith, DNA Computers in Vitro and Vivo 1996 27 DIMACS Winfree, Complexity of Restricted and Unrestricted Models of Molecular Computation 1996 27 DIMACS Winfree, On the Computational Power of DNA Annealing and Ligation 1996 25 DIMACS Baumslag & Epstein & Gilman & Short & Sims (Eds.), Geometric and Computational Perspectives on Infinite Groups 1996 25 DIMACS Gilman, Formal Languages and Infinite Groups 1996 25 DIMACS Holt, The Warwick Automatic Groups Software 1996 24 DIMACS Billera & Greene & Simion & Stanley (Eds.), Formal Power Series and Algebraic Combinatorics 1996 24 DIMACS Billera & Sarangarajan, The Combinatorics of Permutation Polytopes 1996 24 DIMACS Bjorner, Nonpure Shellability, f-Vectors, Subspace Arrangements and Complexity 1996 24 DIMACS Charney, Metric Geometry: Connections with Combinatorics 1996 24 DIMACS Delest, Algebraic Languages: A Bridge between Combinatorics and Computer Science 1995 22 DIMACS Pardalos & Resende & Ramakrishnan (Eds.), Parallel Processing of Discrete Optimization Problems 1995 22 DIMACS Busch & Mavronicolas, Proving Correctness for Balancing Networks 1995 22 DIMACS Clementi & Rolim & Kucera, A Note on Parallel Randomized Algorithms for Searching Problems 1995 22 DIMACS Correa & Ferreira, Modeling Parallel Branch-and-Bound for Asynchronous Implementations 1995 22 DIMACS Damberg & Migdalas, A Data Parallel Space Dilation Algorithm for the Concentrator Location Problem 1995 22 DIMACS Gerasoulis & Jiao & Yang, A Multistage Approach for Scheduling Task Graphs on Parallel Machines 1995 22 DIMACS Gu, Parallel Algorithms for Satisfiability (SAT) Problem 1995 22 DIMACS Karypis & Gupta & Kumar, Experiences with a Parallel Formulation of an Interior Point Algorithm 1995 22 DIMACS Laursen, Experineces with a Synchronous Parallel Branch and Bound Algorithm 1995 22 DIMACS Mahapatra & Dutt, New Anticipatory Load Balancing Strategies for Parallel A* Algorithms 1995 22 DIMACS Mikolajczak, A Parallel Algorithm for Computing all Homomorphisms of Deterministic Finite Automata 1995 22 DIMACS Niccum & Srivastava & Himatsingka & Li, Query Optimization and Processing in Parallel Databases 1995 22 DIMACS Pande & Psarris, Scheduling Acyclic Task Graphs on Distributed Memory Parallel Architectures 1995 22 DIMACS Reinefeld, Scalability of Massively Parallel Depth-First Search 1995 22 DIMACS Roucairol, On Irregular Data Structures and Asynchronous Parallel Branch and Bound Algorithms 1995 22 DIMACS Schutt & Clausen, Parallel Algorithms for the Assignment Problem--An Experimental Evaluation of Three Distributed Algorithms 1995 22 DIMACS Smith & Xu, Serial & Parallel Algorithms for QSP Problems 1995 21 DIMACS Hsu & Rosenberg & Sotteau (Eds.), Interconnection Networks and Mapping and Scheduling Parallel Computations 1995 21 DIMACS Annexstein, Ranking Algorithms for Hamiltonian Paths in Hypercubic Networks 1995 21 DIMACS Bermond & Bond & Djelloul, Dense Bus Networks of Diameter 2 1995 21 DIMACS Berthome & Ferreira, On Broadcasting Schemes in Restricted Optical Passive Star Systems 1995 21 DIMACS Chen & Faber & Knill, Restricted Routing and Wide Diameter of the Cycle Prefix Network 1995 21 DIMACS Cooperman & Finkelstein, Permutation Routing via Cayley Graphs with an Example for Bus Interconnection Networks 1995 21 DIMACS Diekmann & Monien & Preis, Using Helpful Sets to Improve Graph Bisections 1995 21 DIMACS Du & Hsu & Kleitman, Modification of Consecutive-d Digraphs 1995 21 DIMACS Duato & Lopez, Highly Adaptive Wormhole Routing Algorithms for N-dimensional Torus 1995 21 DIMACS Erickson & Colbourn, Conflict-free Access to Constant-Perimeter Rectangular Subarrays 1995 21 DIMACS Finta & Liu, Makespan Minimization of Task Graphs with Random Task Running Times 1995 21 DIMACS Gerasoulis & Jiao & Yang, Scheduling of Structured and Unstructured Computation 1995 21 DIMACS Goldberg, Routing in Optical Networks: The Problem of Contention 1995 21 DIMACS Hamdi, Communications in Optically Interconnected Parallel Computer Systems 1995 21 DIMACS Harbane, Fault-Tolerant Kautz Networks 1995 21 DIMACS Jesshope & Nedelchev, Asynchronous Packet Routers 1995 21 DIMACS Jia, Cayley Digraphs of Finite Cyclic Groups with Minimal Average Distance 1995 21 DIMACS Karam & Agrawal, Shuffled Tree Based Fault-Tolerant Hierarchical Interconnection Networks 1995 21 DIMACS Qiao & Yi, Restricted Connectivity and Restricted Fault Diameter of Some Interconnection Networks 1995 21 DIMACS Rajasekaran, Sorting and Selection on Interconnection Networks 1995 21 DIMACS Song, Towards a Simple Construction Method for Hamiltonian Decomposition of the Hypercube 1995 21 DIMACS Ziavras, Generalized Reduced Hypercube Interconnection Networks for Massively Parallel Computers 1994 18 DIMACS Blelloch & Chandy & Jagannathan (Eds.), Specification of Parallel Algorithms 1994 18 DIMACS McColl, BSP Programming 1994 18 DIMACS Wegner, Beyond Computable Functions or Escape from the Turing Tarpit 1994 18 DIMACS Lynch, Atomic Transactions for Multiprocessor Programming: A Formal Approach 1994 18 DIMACS Snyder, A Practical Parallel Programming Model 1994 18 DIMACS Lamport, TLA in Pictures 1994 18 DIMACS Misra, A Discipline of Multiprogramming 1994 17 DIMACS , Language Computations: DIMACS Workshop on Human Language, March 20-22, 1992 1994 17 DIMACS Li & Vitanyi, Inductive Reasoning 1994 17 DIMACS Rissanen & Ristad, Language Acquisition in the MDL Framework 1994 17 DIMACS Ristad, Complexity of Morpheme Acquisition 1994 15 DIMACS Dean & Shannon (Eds.), Computational Support for Discrete Mathematics, DIMACS Workshop 1994 15 DIMACS Bhansali & Skiena, Analyzing Integer Sequences 1994 15 DIMACS Stallman & Cleaveland & Hebbar, GDR: A Visualization Tool for Graph Algorithms 1994 15 DIMACS Gloor & Lee & Velez-Sosa, Animated Algorithms Computer Science Education with Algorithm Animation 1994 15 DIMACS Moret & Shapiro, An Empirical Assessment of Algorithms for Constructing a Minimum Spanning Tree 1994 15 DIMACS Schorn, The XYZ GeoBench for the Experimental Evaluation of Geometric Algorithms 1994 15 DIMACS Berque & Goldberg, Monitoring an Algorithm's Execution 1994 15 DIMACS Sanchis, Test Case Construction for the Vertex Cover Problem 1994 15 DIMACS Sutner, Implementing Finite State Machines 1994 15 DIMACS Caugherty & Rodger, NPDA: A Tool for Visualizing and Simulating Nondeterministic Pushdown Automata 1993 14 DIMACS Calderbank & Forney & Moayeri (Eds.), Coding and Quantization 1993 14 DIMACS Loeliger, On Existence Proofs for Asymptotically Good Euclidean-Space Group Codes 1993 14 DIMACS Neuhoff, The Other Asymptotic Theory of Lossy Source Coding 1993 14 DIMACS McLaughlin & Ashley & Neuhoff, The Optimality of the Natural Binary Code 1993 14 DIMACS Fredrickson & Karabed & Siegel & Thapar, Decoding on a Finite State Transition Diagram While Avoiding a Sub-Diagram 1993 14 DIMACS Kuruoglu & Ayanoglu, The Design of Finite-State Machines for Quantization Using Simulated Annealing 1993 13 DIMACS Cai (Ed.), Advances in Computational Complexity Theory 1993 13 DIMACS Ajtai, Approximate Counting with Uniform Constant-Depth Circuits 1993 13 DIMACS Allender & Gore, On Strong Separations from AC^0 1993 13 DIMACS Beck, Parallel Matching Complexity of Ramsey's Theorem 1993 13 DIMACS Condon, On Algorithms for Simple Stochastic Games 1993 13 DIMACS Feigenbaum, Locally Random Reductions in Interactive Complexity Theory 1993 13 DIMACS Fischer & Wright, An Application of Game-Theoretic Techniques to Cryptography 1993 13 DIMACS Hastad & Wigderson, Composition of the Universal Relation 1993 13 DIMACS Maurer, Practical Perfect Cryptographic Security 1993 13 DIMACS Ostrovsky & Venkatesan & Yung, Fair Games against an All-Powerful Adversary 1993 13 DIMACS Schnorr, Factoring Integers and Computing Discrete Logarithms via Diophantine Approximation 1993 13 DIMACS Simon & Szegedy, A New Lower Bound Theorem for Read-Only-Once Branching Programs and its Applications 1993 13 DIMACS Wang, On the E-Isomorphism Problem 1993 12 DIMACS Johnson & McGeoch (Eds.), Network Flows and Matching: First DIMACS Implementation Challenge 1993 12 DIMACS Anderson & Setubal, Goldberg's Algorithm for Maximum Flow in Perspective: A Computational Study 1993 12 DIMACS Nguyen & Venkateswaran, Implementations of the Goldberg-Tarjan Maximum Flow Algorithm 1993 12 DIMACS Badics & Boros, Implementing a Maximum Flow Algorithm: Experiments with Dynamic Trees 1993 12 DIMACS Alizadeh & Goldberg, Implementing the Push-Relabel Method for the Maximum Flow Problem on a Connection Machine 1993 12 DIMACS Shannon & MacCuish & Johnson, A Case Study in Algorithm Animation: Maximum Flow Algorithms 1993 12 DIMACS Bland & Cheriyan & Jensen & Ladanyi, An Empirical Study of Min Cost Flow Algorithms 1993 12 DIMACS Goldberg & Kharitanov, On Implementing Scaling Push-Relabel Algorithms for the Minimum-Cost Flow Problem 1993 12 DIMACS Maros, Performance Evaluation of the MINET Minimum Cost Netflow Solver 1993 12 DIMACS Fujishige & Iwano & Nakano & Tezuka, A Speculative Contraction Method for Minimum Cost Flows: Toward a Practical Algorithm 1993 12 DIMACS McCormick & Liu, An Experimental Implementation of the Dual Cancel and Tighten Algorithm for Minimum-Cost Network Flow 1993 12 DIMACS Joshi & Goldstein & Vaidya, A Fast Implementation of a Path-Following Algorithm for Maximizing a Linear Function over a Network Polytope 1993 12 DIMACS Resende & Veiga, An Efficient Implementation of a Network Interior Point Method 1993 12 DIMACS Neilsen & Zenios, On the Massively Parallel Solution of Linear Network Flow Problems 1993 12 DIMACS Borger & Kang & Klein, Approximating Concurrent Flow with Unit Demands and Capacities: An Implementation 1993 12 DIMACS Leong & Shor & Stein, Implementation of a Combinatorial Multicommodity Flow Algorithm 1993 12 DIMACS Castanon, Reverse Auction Algorithms for Assignment Problems 1993 12 DIMACS Ramakrishnan & Karmarkar & Kamath, An Approximate Dual Projective Algorithm for Solving Assignment Problems 1993 12 DIMACS Hao & Kocur, An Implementation of a Shortest Augmenting Path Algorithm for the Assignment Problem 1993 12 DIMACS Brady & Jung & Nguyen & Raghavan & Subramonian, The Assignment Problem on Parallel Architectures 1993 12 DIMACS Crocker, An Experimental Comparison of Two Maximum Cardinality Matching Programs 1993 12 DIMACS Mattingly & Ritchey, Implementing an O(sqrt(N)M) Cardinality Matching Algorithm 1993 12 DIMACS Applegate & Cook, Solving Large-Scale Matching Problems 1993 11 DIMACS Finkelstein & Kantor (Eds.), Groups and Computation 1993 11 DIMACS Babai & Luks & Seress, Computing Composition Series in Primitive Groups 1993 11 DIMACS Beals, Computing Blocks of Imprimitivity for Small-Base Groups in Nearly Linear Time 1993 11 DIMACS Clausen & Baum, Fast Fourier Transforms for Symmetric Groups 1993 11 DIMACS Conway, From Hyperbolic Reflections to Finite Groups 1993 11 DIMACS Cooperman & Finkelstein, Combinatorial Tools for Computational Group Theory 1993 11 DIMACS Diaconis & Rockmore, Efficient Computation of Isotypic Projections for the Symmetric Group 1993 11 DIMACS Dixon, Constructing Representations of Finite Groups 1993 11 DIMACS Holt & Rees, A Graphics System for Displaying Finite Quotients of Finitely Presented Groups 1993 11 DIMACS Kantor, Random Remarks on Permutation Group Algorithms 1993 11 DIMACS Lam, Application of Group Theory to Combinatorial Searches 1993 11 DIMACS Luks, Permutation Groups and Polynomial-Time Computation 1993 11 DIMACS Mark, Parallel Computation of Sylow Subgroups in Solvable Groups 1993 11 DIMACS Praeger, Computation with Matrix Groups over Finite Fields 1993 11 DIMACS Pyber, Asymptotic Results for Permutation Groups 1993 11 DIMACS Ronyai, Computations in Associative Algebras 1993 11 DIMACS Rosenberg, Cayley Graphs and Direct-Product Graphs 1993 11 DIMACS Sarawagi & Cooperman & Finkelstein, Group Membership for Groups with Primitive Orbits 1993 11 DIMACS Seress & Weisz, PERM: A Program Computing Strong Generating Sets 1993 11 DIMACS Sims, Complexity Issues in Infinite Group Theory 1993 11 DIMACS Soicher, GRAPE: A System for Computing with Graphs and Groups 1993 11 DIMACS York, Implications of Parallel Architectures for Permutation Group Computations 1993 10 DIMACS Friedman (Ed.), Expanding Graphs 1993 10 DIMACS Alon & Roichman, Random Cayley Graphs and Expanders (Abstract) 1993 10 DIMACS Brooks, Spectral Geometry and the Cheeger Constant 1993 10 DIMACS Chung, The Laplacian of a Hypergraph 1993 10 DIMACS Jerrum, Uniform Sampling Modulo a Group of Symmetries Using Markov Chain Simulation 1993 10 DIMACS Kahale, On the Second Eigenvalue and Linear Expansion of Regular Graphs 1993 10 DIMACS Lafferty & Rockmore, NumericalInvestigation of the Spectrum for Certain Families of Cayley Graphs 1993 10 DIMACS Lazebnik & Ustimenko, Some Algebraic Constructions of Dense Graphs of Large Girth and of Large Size 1993 10 DIMACS Lubotzky & Weiss, Groups and Expanders 1993 10 DIMACS Morgenstern, Ramanujan Graphs and Diagrams Function Field Approach 1993 10 DIMACS Schellwat, Highly Expanding Graphs Obtained from Dihedral Groups 1993 10 DIMACS Terras, Are Finite Upper Half Plane Graphs Ramanujan? 1993 9 DIMACS Trotter (Ed.), Planar Graphs 1993 9 DIMACS Archdeacon & Bonnington & Little, Cycles, Cocycles and Diagonals: A Characterization of Planar Graphs 1993 9 DIMACS Heath & Pemmaraju & Trenk, Stack and Queue Layouts of Directed Planar Graphs 1993 9 DIMACS Bender & Canfield, Enumeration of Degree Restricted Rooted Maps on the Sphere 1993 9 DIMACS Bonnington & Little, A Generalisation of MacLane's Theorem to 3-graphs 1993 9 DIMACS Chung & Mumford, Chordal Completions of Grids and Planar Graphs 1993 9 DIMACS Hutton & Lubiw, Upward Planar Drawing of Single Source Acyclic Digraphs 1993 9 DIMACS Khuller & Naor, Flow in Planar Graphs: A Survey of Results 1993 9 DIMACS Kierstead & Trotter, Planar Graph Coloring with an Uncooperative Partner 1993 9 DIMACS Kleitman, Partitioning a Rectangle into Many Sub-rectangles so that a Line can Meet only a Few 1993 9 DIMACS Mohar & Robertson, Disjoint Essential Circuits in Toroidal Maps 1993 9 DIMACS Pach & Torocsik, Layout of Rooted Trees 1993 9 DIMACS West & Will, Vertex Degrees in Planar Graphs 1991 6 DIMACS Goodman & Pollack & Steiger (Eds.), Discrete and Computational Geometry: Papers from the DIMACS Special Year 1991 6 DIMACS Agarwal, Geometric Partitioning and its Applications 1991 6 DIMACS Balog & Barany, On the Convex Hull of the Integer Points in a Disc 1991 6 DIMACS Bern & Eppstein & Plassman & Yao, Horizon Theorems for Lines and Polygons 1991 6 DIMACS Capolyeas & Pach, On the Perimeter of a Point Set in the Plane 1991 6 DIMACS Edelsbrunner, Lines in Space--A Collection of Results 1991 6 DIMACS Furedi & Lagarias & Morgan, Singularities of Minimal Surfaces and Networks and Related Extremal Problems in Minkowski Space 1991 6 DIMACS Gallo & Mishra, Wu-Ritt Characteristic Sets and Their Complexity 1991 6 DIMACS Heintz & Recio & Roy, Algorithms in Real Algebraic Geometry and Applications to Computational Geometry 1991 6 DIMACS Hibi, Ehrhart Polynomials of Convex Polytopes, h-Vectors of Simplicial Complexes, and Nonsingular Projective Toric Varieties 1991 6 DIMACS Kleinschmidt & Schwartz & Sturmfels, Unimodular Fans, Linear Codes, and Toric Manifolds 1991 6 DIMACS Kleinschmidt & Smilansky, New Results for Simplicial Spherical Polytopes 1991 6 DIMACS Lawrence, Rational-function-valued Valuations on Polyhedra 1991 6 DIMACS Lee, Winding Numbers and the Generalized Lower-Bound Conjecture 1991 6 DIMACS Matousek, Computing the Center of Planar Point Sets 1991 6 DIMACS McMullen & Schulte, Finite Quotients of Infinite Universal Polytopes 1991 6 DIMACS Mnev, The Universality Theorem on the Oriented Matroid Stratification of the Space of Real Matrices 1991 6 DIMACS Mount, The Densest Double-Lattice Packing of a Convex Polygon 1991 6 DIMACS Orlik, Arrangements in Topology 1991 6 DIMACS Pach, Notes on Geometric Graph Theory 1991 6 DIMACS Renegar, Recent Progress on the Complexity of the Decision Problem for the Reals 1991 6 DIMACS Snoeyink & Hershberger, Sweeping Arrangements of Curves 1991 6 DIMACS Tverberg, On Geometric Permutations and the Katchalski-Lewis Conjecture on Partial Transversals for Translates 1991 6 DIMACS White, Invariant-Theoretic Computation in Projective Geometry 1990 1 DIMACS Middendorf & Pfeiffer, On the Complexity of the Disjoint Paths Problem (Extended Abstract) 1990 1 DIMACS Middendorf & Pfeiffer, The Paths-Selection Problem 1990 1 DIMACS Barahona, Planar Multicommodity Flows, Max Cut, and the Chinese Postman Problem 1990 1 DIMACS Sebo, The Cographic Multiflow Problem: An Epilogue 1990 1 DIMACS Marcotte, Exact Edge-Colorings of Graphs without Prescribed Minors 1990 1 DIMACS Marcotte, On the Chromatic Index of Multigraphs and a Conjecture of Seymour (II) 1990 1 DIMACS Schrijver & Seymour, Spanning Trees of Different Weights 1997 10 DISTCOMP Fraigniaud & Gavoille, Universal Routing Schemes 1997 10 DISTCOMP Maheshwari & Liskov, Collecting Cyclic Distributed Garbabe by Controlled Migration 1997 10 DISTCOMP Peleg & Wool, Crumbling Walls: A Class of Practical and Efficient Quorum Systems 1997 10 DISTCOMP Shavit & Touitou, Software Transactional Memory 1996 10 DISTCOMP Alur & Taubenfeld, Fast Timing-based Algorithms 1996 10 DISTCOMP Critchlow & Taylor, The Inhibition Spectrum and the Achievement of Causal Consistency 1996 10 DISTCOMP Orda & Rom, Distributed Shortest-Path Protocols for Time-dependent Networks 1996 9 DISTCOMP Brunekreef & Katoen & Koymans & Mauw, Design and Analysis of Dynamic Leader Election Protocols in Broadcast Networks 1996 9 DISTCOMP Charron-Bost & Mattern & Tel, Synchronous, Asynchronous, and Causally Ordered Communication 1996 9 DISTCOMP Herlihy & Shavit & Waarts, Linearizable Counting Networks 1995 9 DISTCOMP Chaudhuri & Coan & Welch, Using Adaptive Timeouts to Achieve At-Most-Once Message Delivery 1995 9 DISTCOMP Friedman, Implementing Hybrid Consistency with High-Level Synchronization Operations 1995 9 DISTCOMP Gong, Efficient Network Authentication Protocols: Lower Bounds and Optimal Implementations 1995 9 DISTCOMP Sayeed & Abu-Amara & Abu-Amara, Optimal Asynchronous Agreement and Leader Election Algorithm for Complete Networks with Byzantine Faulty Links 1995 9 DISTCOMP Zamsky & Israeli & Pinter, Optimal Time Byzantine Agreement for t < n/8 with Linear-Messages 1995 9 DISTCOMP Ben-Aroya & Eilam & Schuster, Greedy Hot-Potato Routing on the Two-dimensional Mesh 1995 9 DISTCOMP Hesselink, Wait-free Linearization with a Mechanical Proof 1995 9 DISTCOMP Ahamad & Neiger & Burns & Kohli & Hutto, Causal Memory: Definitions, Implementation, and Programming 1995 9 DISTCOMP Yang & Anderson, A Fast, Scalable Mutual Exclusion Algorithm 1995 8 DISTCOMP Aharonson & Attiya, Counting Networks with Arbitrary Fan-out 1995 8 DISTCOMP Baldoni & Ciciani, A Class of High Performance Maekawa-type Algorithms for Distributed Systems under Heavy Demand 1995 8 DISTCOMP Boukerche & Tropper, Parallel Simulation on the Hypercube Multiprocessor 1995 8 DISTCOMP Ibaraki & Nagamochi & Kameda, Optimal Coteries for Rings and Related Networks 1995 8 DISTCOMP Lubitch & Moran, Closed Schedulers: A Novel Technique for Analyzing Asynchronous Protocols 1995 8 DISTCOMP Shafer & Ahuja, Implementation of Hierarchical F-Channels for High-Performance Distributed Computing 1995 8 DISTCOMP Afek & Hendler, On the Complexity of Global Computation in the Presence of Link Failures: The General Case 1995 8 DISTCOMP Attiya & Herlihy & Rachman, Atomic Snapshots Using Lattice Agreement 1995 8 DISTCOMP Flatebo & Datta & Schoone, Self-Stabilizing Multi-token Rings 1995 8 DISTCOMP Kessels, Calculational Derivation of a Counter with Bounded Response Time and Bounded Power Dissipation 1995 8 DISTCOMP Singh & Bernstein, A Highly Asynchronous Minimum Spanning Tree Protocol 1994 8 DISTCOMP Burns & Neiger, Fast and Simple Distributed Consensus 1994 8 DISTCOMP Hesselink, Wait-free Linearization with an Assertional Proof 1994 8 DISTCOMP Marzullo & Sabel, Efficient Detection of a Class of Stable Properties 1994 8 DISTCOMP Schiper & Sandoz, Strong Stable Properties in Distributed Systems 1994 8 DISTCOMP Venkatesan & Juang, Efficient Algorithms for Optimistic Crash Recovery 1994 8 DISTCOMP Choy & Singh, Adaptive Solutions to the Mutual Exclusion Problem 1994 8 DISTCOMP Egecioglu & singh, Naming Symmetric Processes Using Shared Variables 1994 8 DISTCOMP Tang, On Multilevel Voting 1994 7 DISTCOMP Anderson, Multi-writer Composite Registers 1994 7 DISTCOMP Jonsson, A Fully Abstract Trace Model for Dataflow and Asynchronous Networks 1994 7 DISTCOMP Merritt & Taubenfeld, Atomic m-Register Operations 1994 7 DISTCOMP Ciuffoletti, Reliability versus Cost: Design of a Probabilistic Broadcast Algorithm 1994 7 DISTCOMP Finkel, Decidability of the Termination Problem for Completely Specified Protocols 1994 7 DISTCOMP Helary & Raynal, Towards the Construction of Distributed Detection Programs, with an Application to Distributed Termination 1994 7 DISTCOMP Schwarz & Mattern, Detecting Causal Relationships in Distributed Computations: In Search of the Holy Grail 1994 7 DISTCOMP Berman & Garay, Fast Consensus in Networks of Bounded Degree 1994 7 DISTCOMP Moser & Melliar-Smith & Agrawala, Necessary and Sufficient Conditions for Broadcast Consensus Protocols 1994 7 DISTCOMP Coan, Efficient Agreement Using Fault Diagnosis 1994 7 DISTCOMP Merritt & Taubenfeld, Knowledge in Shared Memory Systems 1994 7 DISTCOMP Livesey, A Note on Consistency in Asynchronous Multicaches 1994 7 DISTCOMP Dolev & Israeli & Moran, Self-Stabilization of Dynamic Systems Assuming Only Read/Write Atomicity 1994 7 DISTCOMP Katz & Perry, Self-Stabilizing Extensioins for Message-Passing Systems 1994 7 DISTCOMP Afek & Brown, Self-Stabilization over Unreliable Communication Media 1994 7 DISTCOMP Burns & Gouda & Miller, Stabilization and Pseudo-Stabilization 1994 7 DISTCOMP Arora & Attie & Evangelist & Gouda, Convergence of Iteration Systems 1994 7 DISTCOMP Ghosh & Karaata, A Self-Stabilizing Algorithm for Coloring Planar Graphs 1994 7 DISTCOMP Huang & Chen, Self-Stabilizing Depth-First Token Circulation on Networks 1993 6 DISTCOMP Anderson, Composite Registers 1993 6 DISTCOMP Myoupo, Mapping Dynamic Programming onto Modular Linear Systolic Arrays 1993 6 DISTCOMP Neiger & Tuttle, Common Knowledge and Consistent Simultaneous Coordination 1992 6 DISTCOMP Panangaden & Taylor, Concurrent Common Knowledge: Defining Agreement for Asynchronous Systems 1992 6 DISTCOMP Herman, Self-Stabilization: Randomness to Reduce Space 1992 6 DISTCOMP Kaldewaij & Udding, Rank Order Filters and Priority Queues 1992 6 DISTCOMP Katz & Peled, Verification of Distributed Programs Using Representative Interleaving Sequences 1992 6 DISTCOMP Lynch & Attiya, Using Mappings to Prove Timing Properties 1992 5 DISTCOMP Amdur & Weber & Hadzilacos, On the Message Complexity of Binary Byzantine Agreement under Crash Failures 1992 5 DISTCOMP Kanellakis & Shvartsman, Efficient Parallel Algorithms Can Be Made Robust 1992 5 DISTCOMP Zhao & Bastani, A Self-adjusting Algorithm for Byzantine Agreement 1991 5 DISTCOMP Ebergen, A Formal Approach to Designing Delay-Insensitive Circuits 1991 5 DISTCOMP Goldreich & Shrira, On the Complexity of Computation in the Presence of Link Failures: The Case of a Ring 1991 5 DISTCOMP Lisper, Computing Transitive Closure on Systolic Arrays of Fixed Size 1991 5 DISTCOMP Lundy & Miller, Specification and Analysis of a Data Transfer Protocol Using Systems of Communicating Machines 1991 5 DISTCOMP Meldal, A Complete Axiomatic Semantics of Spawning 1991 5 DISTCOMP Alnuweiri & Prasanna, Optimal Geometric Algorithms for Digitized Images on Fixed-size Linear Arrays and Scan-line Arrays 1991 5 DISTCOMP Bar-Yehuda & Goldreich & Itai, Efficient Emulation of Single-hop Radio Network with Collision Detection on Multi-hop Radio Network with No Collision Detection 1991 5 DISTCOMP Halpern & Suzuki, Clock Synchronization and the Power of Broadcasting 1991 5 DISTCOMP Paliwoda & Sanders, An Incremental Specification of the Sliding-Window Protocol 1991 5 DISTCOMP Peleska, Design and Verification of Fault Tolerant Systems with CSP 1991 5 DISTCOMP Hajek, Bounds on Evacuation Time for Deflection Routing 1991 5 DISTCOMP Lengauer & Barnett & Hudson, Towards Systolizing Compilation 1991 4 DISTCOMP Cristian, Reaching Agreement on Processor-Group Membership in Synchronous Distributed Systems 1991 4 DISTCOMP Goldman, Highly Concurrent Logically Synchronous Multicast 1991 4 DISTCOMP Brookes & Roscoe, Deadlock Analysis in Networks of Communicating Processes 1991 4 DISTCOMP Bar-Noy & Dolev, Consensus Algorithms with One-Bit Messages 1991 4 DISTCOMP Singhal, A Class of Deadlock-free Maekawa-type Algorithms for Mutual Exclusion in Distributed Systems 1991 4 DISTCOMP Vogler, Failures Semantics Based on Interval Semiwords is a Congruence for Refinement 1990 4 DISTCOMP Lamport, A Theorem on Atomicity in Distributed Algorithms 1990 4 DISTCOMP Vidyasankar, Concurrent Reading While Writing Revisited 1990 4 DISTCOMP Coan & Welch, Transaction Commit in a Realistic Timing Model 1990 4 DISTCOMP Bar-Noy & Naor & Naor, One-Bit Algorithms 1990 4 DISTCOMP Fekete, Asymptotically Optimal Algorithms for Approximate Agreement 1990 4 DISTCOMP Kessels & Rem, Designing Systolic, Distributed Buffers with Bounded Response Time 1989 3 DISTCOMP Halpern & Fagin, Modelling Knowledge and Action in Distributed Systems 1989 3 DISTCOMP Hilbers & Lukkien, Deadlock-free Message Routing in Multicomputer Networks 1989 3 DISTCOMP Abrahamson & Adler & Higham & Kirkpatrick, Randomized Function Evaluation on a Ring 1989 3 DISTCOMP Cristian, Probabilistic Clock Synchronization 1989 3 DISTCOMP Bar-Noy & Ben-Or & Dolev, Choice Coordination with Limited Failure 1989 3 DISTCOMP Back & Kurki-Suonio, Decentralization of Process nets with Centralized Control 1989 3 DISTCOMP Rajopadhye, Synthesizing Systolic Arrays with Control Signals from Recurrence Equations 1988 3 DISTCOMP Chan & Chin, Distributed Election in Complete Networks 1988 2 DISTCOMP Babaoglu & Stephenson & Drummond, Reliable Broadcasts and Communication Models: Tradeoffs and Lower Bounds 1988 2 DISTCOMP Apt & Francez & Katz, Appraising Fairness in Languages for Distributed Programming 1987 2 DISTCOMP Alpern & Schneider, Recognizing Safety and Liveness 1987 2 DISTCOMP Bracha & Toueg, Distributed Deadlock Detection 1987 2 DISTCOMP Gold & Moran, Distributed Algorithms for Constructing a Minimum-Weight Spanning Tree in a Broadcast Network 1987 2 DISTCOMP van Leeuwen & Tan, An Improved Upperbound for Distributed Election in Bidirectional Rings of Processors 1987 2 DISTCOMP Mattern, Algorithms for Distributed Termination Detection 1987 2 DISTCOMP Srikanth & Toueg, Simulating Authenticated Broadcasts to Derive Simple Fault-Tolerant Algorithms 1987 2 DISTCOMP Hadzilacos, Connectivity Requirements for Byzantine Agreement under Restricted Types of Failures 1987 2 DISTCOMP Miller, The Construction of Self-Synchronizing Finite State Protocols 1987 2 DISTCOMP van de Snepscheut, Fair Mutual Exclusion on a Graph of Processes 1987 2 DISTCOMP Jifeng & Hoare, Algebraic Specification and Proof of a Distributed Recovery Algorithm 1987 2 DISTCOMP Broy, Semantics of Finite and Infinite Networks of Concurrent Communicating Agents 1986 1 DISTCOMP Dally & Seitz, The Torus Routing Chip 1986 1 DISTCOMP Andrews & Olsson, The Evolution of the SR Language 1986 1 DISTCOMP Anantharaman & Clarke & Foster & Mishra, Compiling Path Expressions into VLSI Circuits 1986 1 DISTCOMP Moses & Dolev & Halpern, Cheating Husbands and Other Stories: A Case Study of Knowledge, Action, and Communication 1986 1 DISTCOMP Chandy & Misra, Systolic Algorithms as Programs 1986 1 DISTCOMP Barbara & Garcia-Molina, Mutual Exclusion in Partitioned Distributed Systems 1986 1 DISTCOMP Chandy & Misra, How Processes Learn 1986 1 DISTCOMP Dijkstra, A Belated Proof of Self-Stabilization 1986 1 DISTCOMP Fischer & Lynch & Merritt, Easy Impossibility Proofs for Distributed Consensus Problems 1986 1 DISTCOMP Lamport, On Interprocess Communication. Part I: Basic Formalism 1986 1 DISTCOMP Lamport, On Interprocess Communication. Part II: Algorithms 1986 1 DISTCOMP Liskov & Weihl, Specifications of Distributed Programs 1986 1 DISTCOMP Nguyen & Demers & Gries & Owicki, A Model and Temporal Proof System for Networks of Processes 1986 1 DISTCOMP Pnueli & Zuck, Verification of Multiprocesses Probabilistic Protocols 1991 6 DISTMEMCC Delesalle & Trystram & Wenzek, Optimal Total Exchange on an SIMD Distributed-Memory Hypercube 1991 6 DISTMEMCC van de Geijn, Efficient Global Combine Operations 1991 6 DISTMEMCC Padmanabhan & Baru, Routing Between Subcubes in a Hypercube 1991 6 DISTMEMCC Johnsson & Ho, Optimal All-to-All Personalized Communication with Minimum Span on Boolean Cubes 1991 6 DISTMEMCC Ho & Raghunath, Efficient Communication Primitives on Circuit-Switched Hypercubes 1991 6 DISTMEMCC Scott, Efficient All-to-All Communications Patterns in Hypercube and Mesh Topologies 1991 6 DISTMEMCC Lee & Aboelaze, Linear Speedup of Winograd's Matrix Multiplication Algorithm Using an Array Processor 1991 6 DISTMEMCC Crivelli & Jessup, Toward an Efficient Parallel Implementation of the Bisection Method for Computing Eigenvalues 1991 6 DISTMEMCC Ho & Johnsson & Edelman, Matrix Multiplication on Hypercubes Using Full Bandwidth and Constant Storage 1991 6 DISTMEMCC Guan & Mann & Mural & Uberbacher, Searching for Consensus Patterns on a Hypercube 1991 6 DISTMEMCC Ecklund, External Sorting on a Distributed Memory Machine 1990 5 DISTMEMCC Johnsson & Ho, The Complexity of Reshaping Arrays on Boolean Cubes 1990 5 DISTMEMCC Boppana & Raghavendra, Optimal Self-Routing of Linear-Complement Permutations in Hypercubes 1990 5 DISTMEMCC Miller & Yantchev, Developing Powerful Communication Mechanisms for Distributed Memory Computers from Simple and Efficient Message Routing 1990 5 DISTMEMCC Zemoudeh & Sengupta, Routing Frequently Used Bijections on Hypercube 1990 5 DISTMEMCC Chan & Lee, Distributed Fault-Tolerant Embeddings of Rings in Hypercubes 1990 5 DISTMEMCC Zhou, Fault Tolerant Computing: An Improved Recursive Algorithm 1990 5 DISTMEMCC Lee & Aboelaze, An Efficient Method for Distributing Data in Hypercube Computers 1990 5 DISTMEMCC Snyder & Socha, An Algorithm Producing Balanced Partitionings of Data Arrays 1990 5 DISTMEMCC Embrechts & Jones, An Input/Output Algorithm for M-Dimensional Rectangular Domain Decompositions on N-Dimensional Hypercube Multicomputers 1990 5 DISTMEMCC Ho & Johnsson, Embedding Meshes into Small Boolean Cubes 1990 5 DISTMEMCC Chen & Stallmann, Local Search Variants for Hypercube Embedding 1990 5 DISTMEMCC Gupta & Hambrusch, Multiple Network Embeddings into Hypercubes 1990 5 DISTMEMCC Sen, Embedding a Pyramid on the Hypercube with Minimal Routing Load 1993 6 DISTCOMP Drummond & Babaoglu, Low-Cost Clock Synchronization 1993 6 DISTCOMP Israeli & Li, Bounded Time-Stamps 1993 6 DISTCOMP Liskov, Practical Uses of Synchronized Clocks in Distributed Systems 1993 6 DISTCOMP Tsay & Bagrodia, Some Impossibility Results in Interprocess Synchronization 1993 6 DISTCOMP Welch & Lynch, A Modular Drinking Philosophers Algorithm 1993 6 DISTCOMP Attie & Francez & Grumberg, Fairness and Hyperfairness in Multi-party Interactions 1997 165 DMATH Achlioptas, The Complexity of G-free Colourability 1997 165 DMATH Alon & Tuza & Voigt, Choosability and Fractional Chromatic Numbers 1997 165 DMATH Berge, Motivations and History of Some of My Conjectures 1997 165 DMATH Charon & Guenoche & Hudry & Woirgard, New Results on the Computation of Median Orders 1997 165 DMATH Cordovil, Coloring Matroids 1997 165 DMATH de Werra, Restricted Coloring Models for Timetabling 1997 165 DMATH Delorme & Tillich, Eigenvalues, Eigenspaces and Distances to Subsets 1997 165 DMATH Erdos, Some Old and New Problems in Various Branches of Combinatorics 1997 165 DMATH Klazar, Combinatorial Aspects of Davenport-Schinzel Sequences 1997 165 DMATH Maurras & Vaxes, Multicommodity Network Flow with Jump Constraints 1997 165 DMATH Padberg & Sung, An Analytic Symmetrization of Max Flow-Min Cut 1997 165 DMATH Wojda & Ziolo, Embedding Digraphs of Small Size 1997 165 DMATH Yamasaki, The Arithmetic of Reversed Positional Games 1997 164 DMATH Dell'Olmo & Speranza & Tuza, Efficiency and Effectiveness of Normal Schedules on Three Dedicated Processors 1997 164 DMATH Erdos, Some Recent Problems and Results in Graph Theory 1997 164 DMATH Faudree & Flandrin & Ryjacek, Claw-free Graphs -- A Survey 1997 164 DMATH Katona, Extremal Problems for Finite Sets and Convex Hulls -- A Survey 1997 164 DMATH Kubale & Pakulski & Piwakowski, The Smallest Hard-to-Color Graph for the SL Algorithm 1997 163 DMATH Alevras, Order Preserving Assignments without Contiguity 1997 163 DMATH Tsay & chang, The Exact Gossiping Problem 1997 163 DMATH Wan & Du, A (log_2 3 + 1/2)-competitive Algorithm for the Counterfeit Coin Problem 1996 162 DMATH Maffray & Preissmann, On the NP-completeness of the k-colorability Problem for Triangle-free Graphs 1996 162 DMATH Nishimura & Saito, Two Recursive Theorems on n-extendibility 1996 161 DMATH Dillencourt & Smith, Graph-theoretical Conditions for Inscribability and Delaunay Realizability 1996 161 DMATH Grytczuk, Infinite Self-Similar Words 1996 160 DMATH Hwang & Rothblum & Yao, Localizing Combinatorial Properties of Partitions 1996 160 DMATH Chastand & Polat, Invariant Hamming Graphs in Infinite Quasi-median Graphs 1996 160 DMATH Erdos & Fishburn, Maximum Planar Sets that Determine k Distances 1996 159 DMATH Bange & Barkauskas & Host & Slater, Generalized Domination and Efficient Domination in Graphs 1996 159 DMATH Gutner, The Complexity of Planar Graph Choosability 1996 159 DMATH Hauge & Helleseth, De Bruijn Sequences, Irreducible Codes and Cyclotomy 1996 159 DMATH Schneider, On the Chairman Assignment Problem 1996 158 DMATH Wrathall, The Lattices of Prefixes and Overlaps of Traces 1996 158 DMATH Bryant, A Characterisation of Some 2-connected Graphs and a Comment on an Algorithmic Proof of Brooks' Theorem 1996 156 DMATH Curran & Gallian, Hamiltonian Cycles and Paths in Cayley Graphs and Digraphs -- A Survey 1996 156 DMATH Chen & Kanchi & Gross, A Tight Lower Bound on the Maximum Genus of a Simplicial Graph 1996 156 DMATH Krumme, Reordered Gossip Schemes 1996 156 DMATH Liskovets, A Reductive Technique for Enumerating Non-isomorphic Planar Maps 1996 156 DMATH Anstee & Griggs, An Application of Matching Theory of Edge-colourings 1996 156 DMATH Bollobas, Turan-Ramsey Problems 1996 156 DMATH Edwards, On a Problem Concerning Piles of Counters 1996 155 DMATH Gibbons & Mendelsohn, The Construction of Antipodal Triple Systems by Simulated Annealing 1996 155 DMATH Gionfriddo & Milici, A Result Concerning Two Conjectures of Berge and Chvatal 1996 155 DMATH Klavzar, Coloring Graph Products--A Survey 1996 155 DMATH Mohar, Straight-line Representations of Maps on the Torus and Other Flat Surfaces 1996 153 DMATH Odlyzko, Analytic Methods in Asymptotic Enumeration 1996 153 DMATH Pirillo & Varricchio, Some Combinatorial Properties of Infinite Words and Applications to Semigroup theory 1996 153 DMATH Rota, Report on the Present State of Combinatorics 1996 152 DMATH Kubo & Vakil, On Conway's Recursive Sequence 1996 152 DMATH Noble, Recognising a Partitionable Simplicial Complex is in NP 1996 152 DMATH Noonan, The Number of Permutations Containing Exactly One Increasing Sequence of Length Three 1996 151 DMATH Berge, Combinatorial Games on a Graph 1996 151 DMATH Ito, Even Tournaments and Hadamard Tournaments 1996 151 DMATH Lih & Wu, On Equitable Coloring of Bipartite Graphs 1996 151 DMATH Moon, On the Total Distance between Nodes in Tournaments 1996 151 DMATH Tan, On the Isomorphism Problem for a Family of Cubic Metacirculant Graphs 1996 150 DMATH Csizmadia, Furthest Neighbours in Space 1996 150 DMATH Kierstead & Rodl, Applications of Hypergraph Coloring to Coloring Graphs Not Inducing Certain Trees 1996 150 DMATH Klazar, Extremal Functions for Sequences 1996 150 DMATH Kolossa, On the On-line Chromatic Number of the Family of On-line 3-Chromatic Graphs 1996 150 DMATH Kubale & Piwakowski, A Linear Time Algorithm for Edge Coloring of Binomial Trees 1996 150 DMATH Plummer, Extending Matchings in Planar Graphs V 1996 150 DMATH Popescu, Une Methode d'Enumeration des Cycles Negatifs d'un Graphe Signe 1996 150 DMATH Sacle, Lower Bounds for the Size in Four Families of Minimum Broadcast Graphs 1996 150 DMATH Tokunaga, On a Straight-Line Embedding Problem of Graphs 1996 150 DMATH Vesztergombi, The Two Largest Distances in Finite Planar Sets 1996 150 DMATH Wozniak, Packing Three Trees 1996 150 DMATH Ando & Kaneko & Gervacio, The Bandwidth of a Tree with k Leaves is At Most ceiling(k/2) 1996 150 DMATH Hoffman & Soifer, Another Six-Coloring of the Plane 1996 150 DMATH Petrovic, Decomposition of Some Planar Graphs into Trees 1996 149 DMATH Chen & Archdeacon & Gross, Maximum Genus and Connectivity 1996 149 DMATH Zha, On Minimum-Genus Embeddings 1996 149 DMATH Ahlswede & Khachatrian, A Counterexample to Aharoni's Strongly Maximal Matching Conjecture 1996 149 DMATH Hurtado & Noy, Ears of Triangulations and Catalan Numbers 1996 148 DMATH Albertson & Haas, Parsimonious Edge Coloring 1996 148 DMATH Chang & Tsay, The Partial Gossiping Problem 1996 148 DMATH Gehrke & Walker, Iterating Conditionals and Symmetric Stone Algebras 1996 148 DMATH Hauge & Mykkeltveit, On the Classification of deBruijn Sequences 1996 148 DMATH Ratier, On the Stable Marriage Polytope 1996 148 DMATH Wirsching, On the Combinatorial Structure of 3N + 1 Predecessor Sets 1996 148 DMATH Luczak & Rucinski & Gruszka, On the Evolution of a Random Tournament 1996 148 DMATH Rogers, The Graph of the Square Mapping on the Prime Fields 1995 147 DMATH Edelman, Lexicographically First Reduced Words 1995 147 DMATH Halbeisen & Hungerbuhler, The General Counterfeit Coin Problem 1995 147 DMATH Hartvigsen, Generalizing the All-Pairs Min Cut Problem 1995 147 DMATH Koh & Tan, Kings in Multipartite Tournaments 1995 147 DMATH Savicky, Bent Functions and Random Boolean Formulas 1995 146 DMATH Lisonek, Local and Global Majorities Revisited 1995 146 DMATH Odlyzko & Smith, Nonabelian Sets with Distinct k-Sums 1995 146 DMATH Serfati, Boolean Differential Equations 1995 146 DMATH West, Generating Trees and the Catalan and Schroder Numbers 1995 146 DMATH Boisen, Polynomials and Packings: A New Proof of de Bruijn's Theorem 1995 146 DMATH Brualdi & Fonseca, On the Quasi-transversals of a Matroid 1995 146 DMATH Chan, An Exchange Property of Matroid 1995 146 DMATH Michel & Taubenfeld & Berman, A Connection between Random Variables and Latin k-Cubes 1995 146 DMATH Oxley & Wu, On Matroid Connectivity 1995 145 DMATH Aluffi, A Blow-Up Construction and Graph Coloring 1995 145 DMATH Lalonde, Lyndon Heaps: An Analogue of Lyndon Words in Free Partially Commutative Monoids 1995 144 DMATH Aigner & Triesch & Tuza, Searching for Acyclic Orientations of Graphs 1995 144 DMATH Felsner & Trotter, Colorings of Diagrams of Interval Orders and alpha-Sequences of Sets 1995 144 DMATH Kierstead & Qin, Coloring Interval Graphs with First-Fit 1995 144 DMATH Syslo, The Jump Number Problem on Interval Orders: A 3/2 Approximation Algorithm 1995 143 DMATH Labahn, Kernels of Minimum Size Gossip Schemes 1995 142 DMATH Archdeacon & Grable, The Genus of a Random Graph 1995 142 DMATH Haukkanen, An Abstract Mobius Inversion Formula with Number-theoretic Applications 1995 142 DMATH Kennedy & Pless, A Coding Theoretic Approach to Extending Designs 1995 142 DMATH Korner, Intersection Number and Capacities of Graphs 1995 142 DMATH Smithline, Bandwidth of the Complete k-ary Tree 1995 142 DMATH Stahl, Bounds for the Average Genus of the Vertex-Amalgamation of Graphs 1995 142 DMATH Barnes, Best Packing of Rods into Boxes 1995 142 DMATH Maranas & Floudas & Pardalos, New Results in the Packing of Equal Circles in a Square 1995 141 DMATH Chetwynd & Rhodes, Chessboard Squares 1995 141 DMATH Fraenkel & Loebl, Complexity of Circuit Intersection Graphs 1995 141 DMATH Knill & Ehrenfeucht & Haussler, The Size of k-Pseudotrees 1995 140 DMATH Sanchis, Some Results on Characterizing the Edges of Connected Graphs with a Given Domination Number 1995 140 DMATH Peleg, On the Maximum Density of 0-1 Matrices with No Forbidden Rectangles 1995 140 DMATH Radcliffe & Scott, Every Tree Contains a Large Induced Subgraph with All Degrees Odd 1995 139 DMATH Barcussi & Pinzani & Sprugnoli, The Random Generation of Underdiagonal Walks 1995 139 DMATH Bergeron & Favreau, Fourier Transform over Semi-Simple Algebras and Harmonic Analysis for Probabilistic Algorithms 1995 139 DMATH Zimmerman, Function Composition and Automatic Average Case Analysis 1995 139 DMATH Allouche & Arnold & Berstel & Brlek & Jockusch & Plouffe & Sagan, A Relative of the Thue-Morse Sequence 1995 138 DMATH Aguilo & Fiol, An Efficient Algorithm to Find Optimal Double Loop Networks 1995 138 DMATH Anthony & Brightwell & Cooper, The Vapnik-Chervonenkis Dimension of a Random Graph 1995 138 DMATH Chopra, On Arrays with Some Combinatorial Structure 1995 138 DMATH Cvetkovic & Simic, On Graphs Whose Second Largest Eigenvalue Does Not Exceed (sqrt(t)-1)/2 1995 138 DMATH Harzheim, On Weakly Arithmetic Progressions 1995 138 DMATH Hochberg & McDiarmid & Saks, On the Bandwidth of Triangulated Triangles 1995 138 DMATH Hoggar & McFarlane, Faster Fractal Pictures by Finite Fields and Far Rings 1995 138 DMATH Jennings, On Packing of Squares and Rectangles 1995 138 DMATH Meir & Moon, On Path Entropy Functions for Rooted Trees 1995 138 DMATH Paterson & Robshaw, Storage Efficient Decoding for a Class of Binary de Bruijn Sequences 1995 137 DMATH Czyzowicz & Rivera-Campo & Urrutia & Zaks, On Illuminating Line Segments in the Plane 1995 137 DMATH Duffus & Lefmann & Rodl, Shift Graphs and Lower Bounds on Ramsey Numbers r_k(l;r) 1995 137 DMATH Aldred & Anstee, On the Density of Sets of Divisors 1995 137 DMATH Dale & Skau, The (Generalized) Secretary's Packet Problem and the Bell Numbers 1995 137 DMATH Thatte, On a Reconstruction Problem 1994 136 DMATH Aigner & Triesch, Realizability and Uniqueness in Graphs 1994 136 DMATH Bandelt & Dress, An Order Theoretic Framework for Overlapping Clustering 1994 136 DMATH Christen, Search Problems: One, Two or Many Rounds 1994 136 DMATH Erdos, Problems and Results in Discrete Mathematics 1994 136 DMATH Erdos & Sarkozy & Sos, On Additive Properties of General Sequences 1994 136 DMATH Felsner & Trotter, On the Fractional Dimension of Partially Ordered Sets 1994 136 DMATH Graham, Recent Trends in Euclidean Ramsey Theory 1994 136 DMATH Gritzmann & Klee, On the Complexity of Some Basic Problems in Computational Convexity: I. Containment Problems 1994 136 DMATH Hougardy & Promel & Steger, Probabilistically Checkable Proofs and their Consequences for Approximation Algorithms 1994 136 DMATH Luczak, Phase Transition Phenomena in Random Discrete Structures 1994 136 DMATH Milner, The Use of Elementary Substructures in Combinatorics 1994 136 DMATH Pudlak & Rodl, Some Combinatorial-Algebraic Problems from Complexity Theory 1994 136 DMATH Seidel, Isometric Embeddings and Geometric Designs 1994 136 DMATH Spencer, From Erdos to Algorithms 1994 136 DMATH Strehl, Binomial Identities -- Combinatorial and Algorithmic Aspects 1994 136 DMATH Wegener, Efficient Data Structures for Boolean Functions 1994 136 DMATH Welsh, The Random Cluster Process 1994 135 DMATH Batbedat, Two Representations of Finite Ordered Sets 1994 135 DMATH Fraenkel & Porta & Stolarsky, The Almost PV Behavior of Some Far From PV Algebraic Integers 1994 135 DMATH Razpet, On Divisibility of Binomial Coefficients 1994 134 DMATH Petkovsek, A Generalization of Gosper's Algorithm 1994 134 DMATH Sachs, Coin Graphs, Polyhedra, and Conformal Mapping 1994 133 DMATH Barnes, How Many 1 x 2 x 4 Bricks Can You Get Into an Odd Box 1994 133 DMATH Cerlienco & Mureddu, Generalized Robinson-Schensted Correspondences: A New Algorithm 1994 133 DMATH Hughes, Lower Bounds on Cube Simplexity 1994 133 DMATH Schmerl, Tiling Space with Notched Cubes 1994 133 DMATH Li, On the Conjecture at Two Counterfeit Coins 1994 133 DMATH Snevily, The Snake-in-the-Box Problem: A New Upper Bound 1994 132 DMATH Bogart & Trenk, Bipartite Tolerance Orders 1994 132 DMATH Goddard & Oellermann & Swart, Steiner Distance Stable Graphs 1994 132 DMATH Hell & Zhu, Homomorphisms to Oriented Paths 1994 132 DMATH Kochol, Compatible Systems of Representatives 1994 132 DMATH Moran, The r-Majority Vote Action on 0-1 Sequences 1994 132 DMATH Moran, Parametrization for Stationary Patterns of the r-Majority Operators on 0-1 Sequences 1994 132 DMATH Ramana & Scheinerman & Ullman, Fractional Isomorphism of Graphs 1994 132 DMATH Stankova, Forbidden Subsequences 1994 132 DMATH Selkow, A Probabilistic Lower Bound on the Independence Number of Graphs 1994 132 DMATH Ishigami, An Extremal Problem of Orthants Containing at Most One Point Besides the Origin 1994 131 DMATH Aharoni & Korman, Strong LP Duality in Weighted Infinite Bipartite Graphs 1994 131 DMATH Hoke & Troyon, The Struction Algorithm for the Maximum Stable Set Problem Revisited 1994 131 DMATH Lamken, Constructions for Generalized Balanced Tournament Designs 1994 131 DMATH Lemos, Matroids Having the Same Connectivity Function 1994 131 DMATH Miller & Pritikin, Applying a Result of Frankl and Rodl to the Construction of Steiner Trees in the Hypercube 1994 131 DMATH Zerovnik, A Randomized Algorithm for k-Colorability 1994 128 DMATH Borodin, Simultaneous Coloring of Edges and Faces of Plane Graphs 1994 128 DMATH Chen, Sharp Bound of the k-th Eigenvalue of Trees 1994 128 DMATH Ehrenfeucht & Harju & Rozenberg, Incremental Construction of 2-Structures 1994 128 DMATH Rosa & Znam, Packing Pentagons into Complete Graphs: How Clumsy Can You Get? 1994 127 DMATH Abe, Unsolved Problems on Magic Squares 1994 127 DMATH Alon, Probabilistic Methods in Coloring and Decomposition Problems 1994 127 DMATH Fu & Huang, On Prime Labellings 1994 127 DMATH Griggs & Kleitmann, Independence and the Havel-Hakimi Residue 1994 127 DMATH Plummer, Extending Matchings in Graphs: A Survey 1994 127 DMATH Takahashi & Ueno & Kajitani, Minimal Acyclic Forbidden Minors for the Family of Graphs with Bounded Path-Width 1994 126 DMATH Dekking, Iteration of Maps by an Automaton 1994 126 DMATH Dur, On the Covering Radius of Reed-Solomon Codes 1994 126 DMATH Fraenkel & Kimberling, Generalized Wythoff Arrays, Shuffles and Interspersions 1994 126 DMATH Frick & Henning, Extremal Results on Defective Colorings of Graphs 1994 126 DMATH Krattenthaler & Mohanty, q-Generalization of a Ballot Problem 1994 126 DMATH London, A New Proof of the Colored Krustal-Katona Theorem 1994 126 DMATH Richter & Seymour & Siran, Circular Embeddings of Planar Graphs in Nonspherical Surfaces 1994 126 DMATH Shyr & Yu & thierrin, Monogenic e-Closed Languages and Dipolar Words 1994 126 DMATH Stewart, Deciding Whether a Planar Graph Has a Cubic Subgraph is NP-Complete 1994 126 DMATH Erickson, A Conjecture Concerning Ramsey's Theorem 1994 126 DMATH Froncek, e-Realization of Double-Stars 1994 126 DMATH Labahn & Warnke, Quick Gossiping by Telegraphs 1994 126 DMATH Mayhew, Weight Class Distributions of de Bruijn Sequences 1994 126 DMATH Freiman, New Analytical Results in Subset-Sum Problem (Erratum) 1994 125 DMATH Beineke & Hamburger & Goddard, Random Packings of Graphs 1994 125 DMATH Bierbrauer, A Family of Perpendicular Arrays Achieving Perfect 4-fold Secrecy 1994 125 DMATH Brightwell, Linear Extensions of Random Orders 1994 125 DMATH Chan & Siu & Ma, Nonexistence of Certain Perfect Arrays 1994 125 DMATH Fiol & Fabrega, On the Distance Connectivity of Graphs and Digraphs 1994 125 DMATH Hind, Recent Developments in Total Colouring 1994 125 DMATH McDiarmid & Alfonsin, Sharing Jugs of Wine 1994 125 DMATH Plummer, Extending Matchings in Claw-free Graphs 1994 125 DMATH Schiermeyer, The k-SATISFIABILITY Problem Remains NP-Complete for Dense Families 1994 125 DMATH Triesch, A Probabilistic Upper Bound for the Edge Identification Complexity of Graphs 1994 124 DMATH Bauer & Morgana & Schmeichel, On the Complexity of Recognizing Tough Graphs 1994 124 DMATH Biggs, Combinatorics and Connectionism 1994 124 DMATH Lovasz, Stable Sets and Polynomials 1994 124 DMATH McDiarmid & Sanchez-Arroyo, Total Colouring Regular Bipartite Graphs is NP-Hard 1994 124 DMATH Thatte, Some Results and Approaches for Reconstruction Conjectures 1994 124 DMATH Thomassen, Embeddings of Graphs 1994 124 DMATH Welsh, The Computational Complexity of Knot and Matroid Polynomials 1993 122 DMATH Bandieri, Contracted k-Tessellations of Closed Surfaces 1993 122 DMATH Bollobas & Leader, Maximal Sets of Given Diameter in the Grid and the Torus 1993 122 DMATH Hansen & Zheng, A Linear Algorithm for Perfect Matching in Hexagonal Systems 1993 122 DMATH Thurber, Addition Chains -- An Erratic Sequence 1993 121 DMATH Borowiecki & Drgas-Burchardt, Classes of Chromatically Unique or Equivalent Graphs 1993 121 DMATH Fiedler, Some Minimax Problems for Graphs 1993 121 DMATH Fouquet & Wojda, Mutual Placement of Bipartite Graphs 1993 121 DMATH Katona & Quintas, The Largest Component in a Random Subgraph of the n-Cycle 1993 121 DMATH Konieczna, Asymptotic Normality of Subcubes in Random Subgraphs of the n-Cube 1993 121 DMATH Konig & Sotteau, Symmetric Routings of the Hypercube 1993 121 DMATH Kubale, Interval Edge Coloring of a Graph with Forbidden Colors 1993 121 DMATH Lonc, Majorization, Packing, Covering and Matroids 1993 121 DMATH Schaar, On `Maximal' Hamiltonian Cycles in the Square of a Block 1993 121 DMATH Wei, Hamiltonian Paths and Hamiltonian Connectivity in Graphs 1993 120 DMATH Aharoni & Hartman, On Greene-Kleitman's Theorem for General Digraphs 1993 120 DMATH Breckenridge & Varadarajan & Wehrhahn, Chains, Multichains and Mobius Numbers 1993 120 DMATH Heden, Maximal Partial Spreads and the Modular n-Queen Problem 1993 120 DMATH Kharaghani, A Construction for Hadamard Matrices 1993 120 DMATH Prodinger, How to Select a Loser 1993 120 DMATH Wallis & Zhang, On the Partition and Coloring of a Graph by Cliques 1993 120 DMATH Voigt, List Colourings of Planar Graphs 1993 120 DMATH Clapham & Sheehan, All Trees are 1-Embeddable and All Except Stars are 2-Embeddable 1993 120 DMATH Kupitz, On Convex Segments in a Triangulation 1993 118 DMATH Broersma & Gobel, Coloring a Graph Optimally with Two Colors 1993 118 DMATH Eliahou, The 3x + 1 Problem: New Lower Bounds on Nontrivial Cycle Lengths 1993 117 DMATH Ding, Stable Sets versus Independent Sets 1993 117 DMATH Felzenbaum & Holzman & Kleitman, Packing Lines in a Hypercube 1993 117 DMATH Sharary & Zaguia, Minimizing the Number of Tardy Jobs in Single Machine Sequencing 1993 117 DMATH Mohar, A Polynomial Time Circle Packing Algorithm 1993 117 DMATH Choi & Guan, A Spanning Tree of the 2^m-dimensional Hypercube with Maximum Number of Degree-preserving Vertices 1993 115 DMATH Althofer & Triesch, Edge Search in Graphs and Hypergraphs of Bounded Rank 1993 115 DMATH Chen & Stanley, Derangements on the n-Cube 1993 115 DMATH Sampathkumar, Generalizations of Independence and Chromatic Numbers of a Graph 1993 115 DMATH Tverberg, On a Coin Tossing Problem by G. Bennett 1993 114 DMATH Alon & Caro & Krasikov, Bisection of Trees and Sequences 1993 114 DMATH Amar, Irregularity Strength of Regular Graphs of Large Degree 1993 114 DMATH Balinska & Quintas, The Sequential Generation of Random f-Graphs. Distributions and Predominant Types of Edge Maximal f-Graphs with f > 4 1993 114 DMATH Belfer & Golumbic, Counting Endpoint Sequences for Interval Orders and Interval Graphs 1993 114 DMATH Bellantoni & Hartman & Przytycka & Whitesides, Grid Intersection Graphs and Boxicity 1993 114 DMATH Bermond & Homobono & Peyrat, Connectivity of Kautz Networks 1993 114 DMATH Bond & Delorme, A Note on Partial Cayley Graphs 1993 114 DMATH Bouchet, Recognizing Locally Equivalent Graphs 1993 114 DMATH Chaimovich, Fast Exact and Approximate Algorithms for k-Partition and Scheduling Independent Tasks 1993 114 DMATH Cohen & Zemor, Write-Isolated Memories (WIMs) 1993 114 DMATH Colbourn & Elmallah, Reliable Assignments of Processors to Tasks and Factoring on Matroids 1993 114 DMATH Dejter & Cedeno & Jauregui, A Note on Frucht Diagrams, Boolean Graphs and Hamilton Cycles 1993 114 DMATH Delorme, Eigenvalues of Finite Graphs 1993 114 DMATH Esque & Aguilo & Fiol, Double Commutative-Step Digraphs with Minimum Diameters 1993 114 DMATH Flajolet & Soria, General Combinatorial Schemas: Gaussian Limit Distributions and Exponential Tails 1993 114 DMATH Fouquet & Thuillier, Decomposition of 3-connected Cubic Graphs 1993 114 DMATH Franek & Rodl, 2-Colorings of Complete Graphs with a Small Number of Monochromatic K_4 Subgraphs 1993 114 DMATH Freiman, New Analytical Results in Subset-Sum Problem 1993 114 DMATH Gomez & Fiol & Serra, On Large (Delta,D)-Graphs 1993 114 DMATH Huang & Laurent, (s,r;mu)-Nets and Alternating Forms Graphs 1993 114 DMATH Jaeger, Plane Graphs and Link Invariants 1993 114 DMATH Jorgensen, Nonexistence of Certain Cubic Graphs with Small Diameters 1993 114 DMATH Karchmer & Linial & Newman & Saks & Wigderson, Combinatorial Characterization of Read-Once Formulae 1993 114 DMATH Klein & Minsker, The Super Towers of Hanoi Problem: Large Rings on Small Rings 1993 114 DMATH Kogan & Berman, Characterization of Completely Positive Graphs 1993 114 DMATH Korach & Ostfeld, Recognition of DFS Trees: Sequential and Parallel Algorithms with Refined Verifications 1993 114 DMATH La Poutre & van Leeuwen & Overmars, Maintenance of 2- and 3-edge-connected Components of Graphs I 1993 114 DMATH Levy & Shamir, A Note on a Counting Problem Arising in Percolation Theory 1993 114 DMATH Lipkin, On Subset Sums of r-Sets 1993 114 DMATH Nivat & Podelski, Another Variation on the Common Subexpression Problem 1993 114 DMATH Peled & Srinivasan, Poset Matching--A Distributive Analog of Independent Matching 1993 114 DMATH Santha & Vazirani, Parallel Searching of Multidimensional Cubes 1993 114 DMATH Shamir, A Fast Algorithm for Constructing Monge Sequences in Transportation Problems with Forbidden Arcs 1993 113 DMATH Brown & Watson, Mutually Complementary Partial Orders 1993 113 DMATH Labahn, Information Flows on Hypergraphs 1993 113 DMATH Leimer, Optimal Decomposition by Clique Separators 1993 113 DMATH Sander, On Maximal Antihierarchic Sets of Integers 1993 113 DMATH Schmerl & Trotter, Critically Indecomposable Partially Ordered Sets, Graphs, Tournaments and Other Binary Relational Structures 1993 113 DMATH Schwarzler & Sebo, A Generalized Cut-Condition for Multiflows in Matroids 1993 113 DMATH Erdos & Rousseau, The Size Ramsey Number of a Complete Bipartite Graph 1993 112 DMATH Chao & Chen, On Uniquely 3-colorable Graphs 1993 112 DMATH Luczak, The Size of the Largest Hole in a Random Graph 1993 112 DMATH Robinson & Goldman, The Isolation Game for Regular Graphs 1993 112 DMATH Rodriguez & Satyanarayana, A Generalized Chromatic Polynomial, Acyclic Orientations with Prescribed Sources and Sinks, and Network Reliability 1993 112 DMATH Tuza, Multipartite Turan Problem for Connected Graphs and Hypergraphs 1993 112 DMATH Zhou, Inequalities with Respect to Graph Homomorphism 1993 111 DMATH Caro & Tuza, Bounded Degrees and Prescribed Distances in Graphs 1993 111 DMATH Cordovil & Moreira, A Homotopy Theorem on Oriented Matroids 1993 111 DMATH Erdos, A New Bijection on Rooted Forests 1993 111 DMATH Erdos & Furedi & Pach & Ruzsa, The Grid Revisited 1993 111 DMATH Hell & Seyffarth, Largest Planar Graphs of Diameter Two and Fixed Maximum Degree 1993 111 DMATH Leclerc, Lattice Valuations, Medians and Majorities 1993 111 DMATH Lindstrom, On Algebraic Matroids 1993 111 DMATH Mahadev & Solot & de Werra, The Cyclic Compact Open-Shop Scheduling Problem 1993 111 DMATH Raspaud, Postman Tours and Cycle Covers 1993 111 DMATH Yamasaki, Shannon-like Games are Difficult 1992 110 DMATH Burosch & Havel & Laborde, Distance Monotone Graphs and a New Characterization of Hypercubes 1992 110 DMATH Chung & Diaconis & Graham, Universal Cycles for Combinatorial Structures 1992 110 DMATH Lai & Zhang, Nowhere-Zero 3-Flows of Highly Connected Graphs 1992 110 DMATH Lu, A Characterization on n-Critical Economical Generalized Tic-Tac-Toe Games 1992 110 DMATH Malouf, An Integer Sequence from a Rational Recursion 1992 110 DMATH Olariu, On Sources in Comparability Graphs, with Applications 1992 110 DMATH Wood, Is Every Compact Code Huffman? 1992 109 DMATH Aurenhammer & Hagauer, Computing Equivalence Classes among the Edges of a Graph with Applications 1992 109 DMATH Bang-Jensen & Hell & MacGillivray, On the Complexity of Colouring by Superdigraphs of Bipartite Graphs 1992 109 DMATH Feigenbaum & Schaffer, Finding the Prime Factors of Strong Direct Product Graphs in Polynomial Time 1992 109 DMATH Hochstrasser, A Note on Winkler's Algorithm for Factoring a Connected Graph 1992 109 DMATH Oxley & Welsh, Tutte Polynomials Computable in Polynomial Time 1992 108 DMATH Gil & Steiger & Wigderson, Geometric Medians 1992 108 DMATH Pelant & Rodl, On Coverings of Infinite-Dimentional Metric Spaces 1992 108 DMATH Adamec & Klazar & Valtr, Generalized Davenport-Schinzel Sequences with Linear Upper Bound 1992 108 DMATH Bugata, Trahtenbrot-Zykov Problem and NP-Completeness 1992 108 DMATH Loebl, Unprovable Combinatorial Statements 1992 108 DMATH Matousek & Thomas, On the Complexity of Finding Iso- and Other Morphisms for Partial k-Trees 1992 108 DMATH Razborov, The Gap between the Chromatic Number of a Graph and the Rank of its Adjacency Matrix is Superlinear 1992 107 DMATH Assmus, On the Reed-Muller Codes 1992 107 DMATH Blinovsky, List Decoding 1992 107 DMATH Cohen & Litsyn, On the Covering Radius of Reed-Muller Codes 1992 107 DMATH Dolinar & Ko & McEliece, Some VLSI Decompositions of the de Bruijn Graph 1992 107 DMATH Golomb, Probability, Information Theory, and Prime Number Theory 1992 107 DMATH Hill & Karim, Searching with Lies: The Ulam Problem 1992 107 DMATH Klarner & Post, Some Fascinating Integer Sequences 1992 107 DMATH Mattson, Fault-Detection in Networks 1992 107 DMATH Niederreiter, Orthogonal Arrays and Other Combinatorial Aspects in the Theory of Uniform Point Distributions in Unit Cubes 1992 107 DMATH Piper & Wild, Incidence Structures Applied to Cryptography 1992 107 DMATH Wolf, Efficient Circuits for Multiplying in GF(2^m) for Certain Values of m 1992 105 DMATH Douglas, NP-Completeness and Degree Restricted Spanning Trees 1992 105 DMATH Loeb, A Generalization of the Binomial Coefficients 1992 105 DMATH Lahtonen, An Optimal Polynomial for a Covering Radius Problem 1992 104 DMATH Niederhausen, Fast Lagrange Inversion, with an Application to Factorial Numbers 1992 103 DMATH Alon & Kleitman, Partitioning a Rectangle into Small Perimeter Rectangles 1992 103 DMATH del Greco, Characterizing Bias Matroids 1992 103 DMATH Furedi & Hajnal, Davenport-Schinzel Theory of Matrices 1992 103 DMATH Loeb, A Generalization of the Stirling Numbers 1992 103 DMATH Haviland & Thomason, On Testing the `Pseudo-Randomness' of a Hypergraph 1992 102 DMATH Barcucci & Verri, Some More Properties of Catalan Numbers 1992 102 DMATH Brualdi & Cai & Pless, Orphan Structure of the First-order Reed-Muller Codes 1992 102 DMATH Erdos & Sarkozy, Arithmetic Progressions in Subset Sums 1992 102 DMATH Landman, Ramsey Functions Related to the van der Waerden Numbers 1992 102 DMATH Moss, Distanced Graphs 1992 102 DMATH Sheehan, Balanced Graphs with Minimum Degree Restraints 1992 102 DMATH Woodall, Local and Global Proportionality 1992 102 DMATH Caccetta & Smyth, Graphs of Maximum Diameter 1992 102 DMATH Heden, On the Modular n-Queen Problem 1992 102 DMATH Myrvold, The Degree Sequence is Reconstructible from n-1 Cards 1992 102 DMATH Wilkeit, The Retracts of Hamming Graphs 1992 101 DMATH Cameron & Edmonds, Coflow Polyhedra 1992 101 DMATH Halin, Some Finiteness Results Concerning Separation in Graphs 1992 101 DMATH Nesetril & Rodl, On Ramsey Graphs without Bipartite Subgraphs 1992 101 DMATH Sabidussi, Binary Invariants and Orientations of Graphs 1992 101 DMATH Sachs, How to Calculate the Number of Perfect Matchings in Finite Sections of Certain Infinite Plane Graphs 1992 100 DMATH Plummer, Matching Theory--A Sampler: From Denes Koenig to the Present 1992 100 DMATH Brooks & Smith & Stone & Tutte, Determinants and Current Flows in Electric Networks 1991 98 DMATH Luczak, Cycles in Random Graphs 1991 98 DMATH Petrovic & Thomassen, Kings in k-partite Tournaments 1991 98 DMATH Brown & Corneil, Graph Properties and Hypergraph Colourings 1991 98 DMATH Narendran & O'Dunlaing & Otto, It is Undecidable Whether a Finite Special String-Rewriting System Presents a Group 1991 98 DMATH Caccetta & Vijayan, Maximal Cycles in Graphs 1991 98 DMATH Baranga, The Contraction Principle as a Particular Case of Kleene's Fixed Point Theorem 1991 97 DMATH de Vroedt, On the Maximum Cardinality of Binary Constant Weight Codes with Prescribed Distance 1991 97 DMATH Halin, Tree-Partitions of Infinite Graphs 1991 97 DMATH Lamken, On Near Generalized Balanced Tournament Designs 1991 97 DMATH Marino & Rees, On Parallelism in Steiner Systems 1991 97 DMATH Pfaff, On the Simplicity of 2 and 3 1991 97 DMATH Piotrowski, The Solution of the Bipartite Analogue of the Oberwolfach Problem 1991 96 DMATH Hansen & Kuplinsky, The Smallest Hard-to-Color Graph 1991 96 DMATH Maximum Nonhamiltonian Tough Graphs 1991 96 DMATH Niederreiter, A Combinatorial Problem for Vector Spaces over Finite Fields 1991 96 DMATH Topp & Volkmann, On Packing and Covering Numbers of Graphs 1991 96 DMATH Hendy, A Combinatorial Description of the Closest Tree Algorithm for Finding Evolutionary Trees 1991 95 DMATH Aharoni, Infinite Matching Theory 1991 95 DMATH Cameron, The Age of a Relational Structure 1991 95 DMATH Diestel, Decomposing Infinite Graphs 1991 95 DMATH Imrich & Seifter, A Survey on Graphs with Polynomial Growth 1991 95 DMATH Kriz & Thomas, Analyzing Nash-Williams' Partition Theorem by Means of Ordinal Types 1991 95 DMATH Mohar, Some Relations between Analytic and Geometric Properties of Infinite Graphs 1991 95 DMATH Nash-Williams, Reconstruction of Infinite Graphs 1991 95 DMATH Komjath & Pach, Universal Elements and the Complexity of Certain Classes of Infinite Graphs 1991 95 DMATH Robertson & Seymour & Thomas, Excluding Infinite Minors 1991 95 DMATH Seymour & Thomas, An End-Faithful Spanning Tree Counterexample 1991 95 DMATH Siran, End-Faithful Forests and Spanning Trees in Infinite Graphs 1991 95 DMATH Promel & Thumser & Voigt, Fast Growing Functions based on Ramsey Theorems 1991 94 DMATH Lu, A Matching Game 1991 94 DMATH Granville, On a Paper of Agur, Fraenkel and Klein 1991 94 DMATH Manvel & Meyerowitz & Schwenk & Smith & Stockmeyer, Reconstruction of Sequences 1991 94 DMATH Honkala, All Binary Codes with Covering Radius One are Subnormal 1991 94 DMATH El-Zahar & Sauer, Ramsey-type Properties of Relational Structures 1991 94 DMATH Lai, Graph Whose Edges are in Small Cycles 1991 94 DMATH Siran, Characterization of Signed Graphs Which are Cellularly Embeddable in No More Than One Surface 1991 94 DMATH Suen, On the Largest Strong Components in m-out Digraphs 1991 94 DMATH Watanabe, Arrow Relations on Families of Finite Sets 1991 94 DMATH Clark, Blocking Sets in Finite Projective Spaces and Uneven Binary Codes 1991 93 DMATH Gibbs & Slater, Distinct Distance Sets in a Graph 1991 93 DMATH Taylor, A Distinct Distance Set of 9 Nodes in a Tree of Diameter 36 1991 93 DMATH Mollard, Two Characterizations of Generalized Hypercube 1991 93 DMATH Schmidt, Greedoids and Searches in Directed Graphs 1991 92 DMATH Lam & Kolesova & Thiel, A Computer Search for Finite Projective Planes of Order 9 1991 92 DMATH Pless, Codes and Designs--Existence and Uniqueness 1991 91 DMATH Bandelt & Mulder, Metric Characterization of Parity Graphs 1991 91 DMATH Eppstein & Feigenbaum & Li, Equipartition of Graphs 1991 91 DMATH Redish & Smyth, Closed Form Expressions for the Iterated Floor Function 1991 91 DMATH Abbott & Katchalski, Further Results on Snakes in Powers of Complete Graphs 1991 91 DMATH Clivio, Tilings of a Torus with Rectangular Boxes 1991 91 DMATH Fishburn & Lagarias & Reeds & Shepp, Sets Uniquely Determined by Projections on Axes II Discrete Case 1991 91 DMATH Schindler, Constructible Hypergraphs 1991 91 DMATH Nilli, On the Second Eigenvalue of a Graph 1991 91 DMATH Reid, A Note on Roundedness in 4-Connected Matroids 1991 91 DMATH Faudree & Gould & Lesniak, Neighborhood Conditions and Edge-disjoint Perfect Matchings 1991 91 DMATH Faudree & Jacobson & Kinch & Lehel, Irregularity Strength of Dense Graphs 1991 91 DMATH Luczak, Size and Connectivity of the k-Core of a Random Graph 1991 91 DMATH Mynhardt, Lower Ransey Numbers for Graphs 1991 91 DMATH Oxley, Ternary Paving Matroids 1991 91 DMATH Goddard, Acyclic Colorings of Planar Graphs 1991 91 DMATH Horak, Extending Partial Systems of Distinct Representatives 1991 91 DMATH Hwang, The Monotonicity of the Permanent Function 1991 90 DMATH Assaf, The Packing of Pairs by Quadruples 1991 90 DMATH Courteau & Montpetit, A Class of Codes Admitting at Most three Nonzero Dual Distances 1991 90 DMATH Reid, Triangles in 3-connected Matroids 1991 90 DMATH Ekhad, A Short Proof of a `Strange' Combinatorial Identity Conjectured by Gosper 1991 90 DMATH Grant, A Generalization of the Diameter of a Graph 1991 90 DMATH Assmus & Key, Corrigenda to: Affine and Projective Planes 1991 90 DMATH Dur, The Decoding of Extended Reed-Solomon Codes 1991 90 DMATH Ting & Zhoa, The General Steiner Problem in Boolean Space and Application 1991 89 DMATH Richter, Spanning Trees, Euler Tours, Medial Graphs, Left-Right Paths and Cycle Spaces 1991 89 DMATH Sharir & Skiena, Tight Bounds on a Problem of Lines and Intersections 1991 89 DMATH Stohr, The Pagewidth of Trivalent Planar Graphs 1991 89 DMATH Harzheim, Weakly Arithmetic Progressions in Sets of Natural Numbers 1991 88 DMATH Kierstead, A Polynomial Time Approximation Algorithm for Dynamic Storage Allocation 1991 87 DMATH Currie, Which Graphs Allow Infinite Nonrepetetive Walks? 1991 87 DMATH Erdos & Galvin, Some Ramsey-type Theorems 1991 87 DMATH Albert & Frieze, Occupancy Problems and Random Algebras 1991 87 DMATH Goebel & Cerdeira & Veldman, Label-connected Graphs and the Gossip Problem 1991 87 DMATH Hartman & Newman & Ziv, On Grid Intersection Graphs 1991 87 DMATH Sanchis, Maximum Number of Edges in Connected Graphs with a Given Domination Number 1991 87 DMATH Burosch & Laborde, Characterization of Grid Graphs 1991 87 DMATH Maehara, The Intersection Graph of Random Sets 1991 87 DMATH Montagh, A Simple Proof and a Generalization of an Old Result of Chung and Feller 1990 85 DMATH Akiyama & Chvatal, Packing Paths Perfectly 1990 85 DMATH Kasimatis & Stein, Equidissections of Polygons 1990 85 DMATH Ramras, A New Method for Generating Hamiltonian Cycles on the n-Cube 1990 85 DMATH Barnette, Generating the 4-Connected and Strongly 4-Connected Triangulations on the torus and Projective Plane 1990 85 DMATH Liu, Homomorphisms and Automorphisms of 2-D de Bruijn-Good Graphs 1990 84 DMATH Bennett, Coin Tossing and Moment Sequences 1990 84 DMATH Frankl, An Intersection Problem for Codes 1990 84 DMATH Akiyama & Urrutia, Simple Alternating Path Problem 1990 83 DMATH Savicky, Random Boolean Formulas Representing any Boolean Function with Asymptotically Equal Probability 1990 83 DMATH Furedi & Kahn & Kleitman, Sphere Coverings of the Hypercube with Incomparable Centers 1990 83 DMATH Aaltonen, A New Upper Bound on Nonbinary Block Codes 1990 83 DMATH Assmus & Key, Affine and Projective Planes 1990 83 DMATH Brualdi & Pless, On the Covering Radius of a Code and its Subcodes 1990 83 DMATH Calderbank & Frankl, Binary Codes and Quasi-Symmetric Designs 1990 83 DMATH Conway, Integral Lexicographic Codes 1990 83 DMATH Cohen, Applications of Coding Theory to Communication Combinatorial Problems 1990 83 DMATH Huffman, On the Equivalence of Codes and Codes with an Automorphism Having Two Cycles 1990 83 DMATH Lin & Lin, Codes with Multi-level Error-Correcting Capabilities 1990 82 DMATH Caro & Roditty, A Note on Packing Trees into Complete Bipartite Graphs and on Fishburn's Conjecture 1990 82 DMATH Charlap & Rees & Robbins, The Asymptotic Probability that a Random Biased Matrix is Invertible 1990 82 DMATH Zeilberger, A Bijection from Ordered Trees to Binary Trees that Sends the Pruning Order to the Strahler Number 1990 81 DMATH Edelsbrunner & Robison & Shen, Covering Convex Sets with Non-overlapping Polygons 1990 81 DMATH Frieze, On the Independence Number of Random Graphs 1990 81 DMATH Sole, Completely Regular Codes and Completely Transitive Codes 1990 81 DMATH Chung & Ravikumar, Bounds on the Size of Test Sets for Sorting and Related Networks 1990 81 DMATH Hertz, Bipolarizable Graphs 1990 81 DMATH Venkatesan, On Cleaving a Planar Graph 1990 81 DMATH van den Akker & Koolen & Vaessens, Perfect Codes with Distinct Protective Radii 1990 80 DMATH Middendorf & Pfeiffer, On the Complexity of Recognizing Perfectly Orderable Graphs 1990 80 DMATH El-Mallah & Colbourn, On Two Dual Classes of Planar Graphs 1990 80 DMATH Goldreich, On the Number of Monochromatic Close Pairs of Beads in a Rosary 1990 80 DMATH Katerinis, Toughness of Graphs and the Existence of Factors 1990 80 DMATH Atkinson & Negro & Santoro, Sums of Lexicographically Ordered Sets 1990 80 DMATH Brown & Kelly & Schonheim & Woodrow, Graph Coloring Satisfying Restraints 1990 79 DMATH Taylor, Reconstructing Degree Sequences from k-Vertex-Deleted Subgraphs 1990 79 DMATH Chan, Nondecreasing Subsequences of t-Sequences 1989 78 DMATH Dietrich, Matroids and Antimatroids--A Survey 1989 78 DMATH Sanchez-Arroyo, Determining the Total Colouring Number is NP-Hard 1989 78 DMATH Abu-Sbeih, Generalizing the Duality Theorem of Graph Embeddings 1989 76 DMATH Aldous, The Harmonic-Mean Formula for Probabilities of Unions, Applications to Sparse Random Graphs 1989 76 DMATH Torriani, Constructive Implicit Function Theorems 1989 76 DMATH Woodburn, A 4-color Theorem for the Klein Bottle 1989 76 DMATH Berstel & Crochemore & Pin, Thue-Morse Sequence and p-adic Topology for the Free Monoid 1989 76 DMATH Valette, A Better Packing of Ten Equal Circles in a Square 1989 75 DMATH Akiyama & Nakada & Tokunaga, Packing Smaller Graphs into a Graph 1989 75 DMATH Alon & Bollobas, Graphs with a Small Number of Distinct Induced Subgraphs 1989 75 DMATH Bollobas & Rasmussen, First Cycles in Random Directed Graph Processes 1989 75 DMATH Chung & Seymour, Graphs with Small Bandwidth and Cutwidth 1989 75 DMATH Diestel, Simplicial Decompositions of Graphs: A Survey of Applications 1989 75 DMATH Flajolet & Knuth & Pittel, The First Cycles in an Evolving Graph 1989 75 DMATH Haviland & Thomason, Pseudo-random Hypergraphs 1989 75 DMATH Leader, A Short Proof of a Theorem of Vamos on Matroid Representations 1989 75 DMATH Lovasz & Saks & Trotter, An On-line Graph Coloring Algorithm with Sublinear Performance Ratio 1989 75 DMATH Thomason, A Simple Linear Expected Time Algorithm for Finding a Hamilton Path 1989 75 DMATH Thomason, Dense Expanders and Pseudo-random Bipartite Graphs 1989 75 DMATH Woodall, Forbidden Graphs for Degree and Neighborhood Conditions 1989 74 DMATH Fishburn & Sloane, The Solution to Berlekamp's Switching Game 1989 74 DMATH Reiterman & Rodl & Sinajova, Geometrical Embeddings of Graphs 1989 74 DMATH Syslo, Sequential Coloring versus Welsh-Powell Bound 1989 74 DMATH Petford & Welsh, A Randomised 3-Colouring Algorithm 1989 73 DMATH Agur & Fraenkel & Klein, Errata: The Number of Fixed Points of the Majority Rule 1989 73 DMATH Eidswick, Short Factorizations of Permutations into Transpositions 1989 73 DMATH Farber, Basis Pair Graphs of Transversal Matroids are Connected 1989 73 DMATH Farber, On Diameters and Radii of Bridged Graphs 1989 73 DMATH Lemos, On 3-Connected Matroids 1989 73 DMATH Kouider & Sotteau, On the Existence of a Matching Orthogonal to a 2-Factorization 1989 73 DMATH Aigner, The Double Selection Problem 1989 73 DMATH Hurkens & Schrijver & Tardos, On Fractional Multicommodity Flows and Distance Functions 1989 73 DMATH Kleitman & Fellows, Radius and Diameter in Manhattan Lattices 1989 73 DMATH Rendl & Leclerc, A Multiply Constrained Matroid Optimization Problem 1988 72 DMATH Alon & Chung, Explicit Construction of Linear Sized Tolerant Networks 1988 72 DMATH Bollobas, Sorting in Rounds 1988 72 DMATH Colbourn, Edge-Packings of Graphs and Network Reliability 1988 70 DMATH Agur & Fraenkel & Klein, The Number of Fixed Points of the Majority Rule 1988 70 DMATH Freiman & Lipkin & Levitan, A Polynomial Algorithm for Constructing Families of k-Independent Sets 1988 70 DMATH Frieze, Partitioning Random Graphs into Large Cycles 1988 69 DMATH Farr, The Complexity of Multicolouring 1988 69 DMATH Sidorenko, An Infinite Permutation without Arithmetic Progressions 1988 69 DMATH Neumann-Lara & Urrutia, A Combinatorial Result on Points and Circles on the Plane 1988 68 DMATH Lemos, An Extension of Lindstrom's Result about Characteristic Sets of Matroids 1988 68 DMATH Carlson, Some Unifying Principles in Ramsey Theory 1987 67 DMATH Burr, What Can We Hope to Accomplish in Generalized Ramsey Theory? 1987 67 DMATH Hobbs & Bourgeois & Kasiraj, Packing Trees in Complete Graphs 1987 67 DMATH Satyanarayana & Tindell, Chromatic Polynomials and Network Reliability 1987 67 DMATH Woess, Context-free Languages and Random Walks on Groups 1987 67 DMATH Fiol, Congruences in Z^n, Finite Abelian Groups and the Chinese Remainder Theorem 1987 66 DMATH Compton, Some Methods for Computing Component Distribution Probabilities in Relational Structures 1987 66 DMATH Fenton, Completeness in Oriented Matroids 1987 66 DMATH Klavzar & Petkovsek, Intersection Graphs of Halflines and Halfplanes 1987 66 DMATH Smith, Minimal Trees of Given Search Number 1987 66 DMATH Woodall, An Impossibility Theorem for Electoral Systems 1987 65 DMATH Flajolet & Prodinger, Level Number Sequences for Trees 1987 64 DMATH Luccio & Mazzone & Wong, A Note on Visibility Graphs 1987 64 DMATH Schaffer, Shortest Prefix Strings Containing All Subset Permutations 1987 64 DMATH Siran & Horak, A Construction of Thickness-Minimal Graphs 1987 64 DMATH Straubing, Applications of the Theory of Automata in Enumeration 1987 64 DMATH Maehara, On the Number of Induced Subgraphs of a Random Graph 1986 62 DMATH Umeo & Nakatsuka, A Pipeline-Interval-Optimum Systolic Queue 1986 61 DMATH Fishburn & Hwang & Lee, Do Local Majorities Force a Global Majority? 1986 61 DMATH Palka & Rucinski & Spencer, On a Method for Random Graphs 1986 61 DMATH Bialostocki, An Application of the Ramsey Theorem to Ordered r-Tournaments (Note) 1986 61 DMATH Lawler, Expected Hitting Times for a Random Walk on a Connected Graph 1986 60 DMATH Toth, Packing of Ellipses with Continuously Distributed Area 1986 60 DMATH Kleitman, On a Problem of Yuzvinsky on Separating the n-Cube 1986 59 DMATH Korte & Lovasz, Non-Interval Greedoids and the Transposition Property 1986 59 DMATH Lindstrom, A Non-Linear Algebraic Matroid with Infinite Characteristic Set (Note) 1984 50 DMATH Daykin & Daykin & Paterson, On log Concavity for Order-Preserving and Order-Non-Reversing Maps of Partial Orders 1982 40 DMATH Kemp, On the Number of Words in the Language {w in Sigma*: w = w^R}^2 1978 24 DMATH Hausmann & Korte, Lower Bounds on the Worst-Case Complexity of Some Oracle Algorithms 1978 21 DMATH van Leeuwen, Effective Constructions in Well-Partially-Ordered Free Monoids 1977 19 DMATH Goldstine, A Simplified Proof of Parikh's Theorem 1975 13 DMATH Lovasz, On the Ratio of Optimal Integral and Fractional Covers 1973 4 DMATH Book, Free and Almost-Free Subsemigroups of a Free Semigroup 1970 DOERRHOTZ Siefkes, Decidable Extensions of Monadic Second Order Successor Arithmetic 1996 53 DOKLADY Chashkin, On Estimates on the Complexity of Restrictions of Boolean Functions 1996 53 DOKLADY Shur, Binary Avoidability and Thue-Morse Words 1996 53 DOKLADY Naidenko, To the Problem P =? NP 1996 53 DOKLADY Kozlov, A Version of Cluster Analysis That Eliminates Cluster as an Inexact Concept 1996 53 DOKLADY Brik, Two Suggestions for High-Speed Nonrestoring Division 1995 52 DOKLADY Petrovskii, Metric Spaces of Multisets 1995 51 DOKLADY Kuzyurin, Metric Relations in Integer-Valued Linear Programming 1995 51 DOKLADY Chashkin, The Complexity of Finite Graphs 1995 50 DOKLADY Karpushkin, On the Topology of the Zeros of Polynomials 1995 50 DOKLADY Podlovchenko, Solvability of the Problem of Equivalent Transformations in Special Automaton Models of Recursive Programs 1994 48 DOKLADY Nagornyi, A Constructive Model of Classical Formal Arithmetic 1994 48 DOKLADY Goncharov, Positive Computable Numberings 1994 48 DOKLADY Andreev, Complexity and Coding of Boolean Functions 1993 47 DOKLADY Voloshin, Up-Down Sequences and Ordered Trees 1993 46 DOKLADY Kudryavtsev, On the Time for Solution of Labyrinth Problems by Finite Automata 1993 46 DOKLADY Popov & Popov, Paradoxes in Classical Logic 1993 46 DOKLADY Burgin, Universal Limit Turing Machines 1992 44 DOKLADY Basalikas, Limit Theorems for Random Polynomial Forms 1991 43 DOKLADY Karatsuba, On Fast Computation of Transcendental Functions 1990 40 DOKLADY Zakharov, Automata Models of Programs 1990 40 DOKLADY Kravtsov, Polyhedral Aspects of Transportation Problems 1990 40 DOKLADY Grinchuk, On the Complexity of Realization of Symmetric Boolean Functions by Contact Networks 1990 40 DOKLADY Chernov, On a Class of Local Algorithms 1989 39 DOKLADY Rystov, A Lower Bound for the Time to Add Two Numbers 1989 39 DOKLADY Zuev, Asymptotics of the Logarithm of the Number of Threshold Functions of the Algebra of Logic 1989 39 DOKLADY Ryabko, A Fast Sequential Code 1989 39 DOKLADY Ponomarenko, The Isomorphism Problem for Classes of Graphs 1989 39 DOKLADY Rusanov & Bezmenov, Efficient Roundoff Methods in Executing Arithmetic Operations on a Computer 1989 38 DOKLADY Shen, On Relations Between Different Algorithmic Definitions of Randomness 1988 37 DOKLADY Burgin, The Arithmetical Hierarchy and Inductive Turing Machines 1988 37 DOKLADY Sokolov, Complexity of Optimization on Independence Systems 1988 37 DOKLADY Burosh & Leont'ev & Markosyan, On the Possibility of Information Propagation on Graphs 1988 37 DOKLADY Yukna, On an Entropy Method of Obtaining Lower Bounds for the Complexity of Boolean Functions 1988 37 DOKLADY Lozhkin & Koshkin, On the Complexity of Realizing Some Systems of Boolean Functions by Multiple Switching Circuits 1988 37 DOKLADY Tarasov & Khachiyan & Erlikh, The Method of Inscribed Ellipsoids 1988 37 DOKLADY Nemirovskii, A New Polynomial Algorithm for Linear Programming 1987 35 DOKLADY Nigmatullin, Two Classes of Proofs of Lower Bounds Complexity 1987 35 DOKLADY Bogomolov & Sytnik, Universal Finite Automata 1987 35 DOKLADY Orevkov, Lower Bounds on the Lengths of Derivations in Arithmetic in Terms of the Complexity of Terms Involved in the Derivations 1987 35 DOKLADY Vovk, On a Randomness Criterion 1987 35 DOKLADY Gel'fand & Serganova, On the General Definition of a Matroid and a Greedoid 1987 34 DOKLADY Kanovich, Quasipolynomial Algorithms for Recognizing the Satisfiability and Derivability of Propositional Formulas 1987 34 DOKLADY Grunskii, On the Indistinguishability of Finite Automata by Multiple Experiments 1984 29 DOKLADY Burgin, Inductive Turing Machines with a Multiple Head and Kolmogorov Algorithms 1982 25 DOKLADY Burgin, Generalized Kolmogorov Complexity and Duality in Computational Theory 1981 23 DOKLADY Freivald, Two-Way Finite Probabilistic Automata and Tape-Bounded Turing Machines 1980 21 DOKLADY Slisenko, Determination in Real Time of All the Periodicities in a Word 1979 20 DOKLADY Khachian, A Polynomial Algorithm in Linear Programming 1978 19 DOKLADY Kurdjumov, An Example of a Nonergodic One-Dimensional Homogeneous Random Medium with Positive Transition Probabilities 1977 18 DOKLADY Grigoriev, Imbedding Theorems for Turing Machines of Different Dimensions and Kolmogorov's Algorithms 1977 18 DOKLADY Sakuov, Fast Turing Computations and their Linear Speedup 1974 15 DOKLADY Gacs, On the Symmetry of Algorithmic Information 1974 15 DOKLADY Karzanov, Determining the Maximal Flow in a Network by the Method of Preflows 1973 14 DOKLADY Levin, On Storage Capacity for Algorithms 1970 11 DOKLADY Dinic, Algorithm for Solution of a Problem of Maximum Flow in a Network with Power Estimation 1970 11 DOKLADY Maslov, Estimates of the Number of States of Finite Automata 1970 11 DOKLADY Trakhtenbrot, On Autoreducibility 1966 7 DOKLADY Neciporuk, A Boolean Function 1995 DOUBLEDAY Paulos, A Mathematician Reads the Newspaper 1992 DOUBLEDAY Poundstone, Prisoner's Dilemma 1991 DOVER Revesz, Introduction to Formal Languages 1987 DOVER Hildebrand, Introduction to Numerical Analysis, Second Edition 1995 DPALGS Alon, A Note on Network Reliability 1995 DPALGS Dobrow & Fill, The Move-to-Front Rule for Self-Organizing Lists with Markov Dependent Requests 1995 DPALGS Karlin & Raghavan, Random Walks and Undirected Graph Connectivity: A Survey 1988 DPCS Rosen, The Epistemology of Complexity 1988 DPCS Szu, Fractal Distributions Useful for Search Algorithms 1988 DPCS Landauer, Poor Signal to Noise Ratio in Science 1996 DRECTHY Ambos-Spies, Resource Bounded Genericity 1996 DRECTHY Downey & Jockusch & Stob, Array Nonrecursive Degrees and Genericity 1996 DRECTHY Harrington & Soare, Dynamic Properties of Computably Enumerable Sets 1996 DRECTHY Nies, Relativization of Structures Arising from Computability Theory 1996 DRECTHY Odifreddi, Inductive Inference of Total Functions 1994 DUP Dery (Ed.), Flame Wars: The Discourse of Cyberculture 1993 EATCSMTCS Bloom & Esik, Iteration Theories: The Equational Logic of Iterative Processes 1993 EATCSMTCS Schmidt & Strohlein, Relations and Graphs: Discrete Mathematics for Computer Scientists 1992 EATCSMTCS Janicki & Lauer, Specification and Analysis of Concurrent Systems: The COSY Approach 1992 EATCSMTCS Watanabe (Ed.), Kolmogorov Complexity and Computational Complexity 1992 EATCSMTCS Jensen, Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use, Volume 1 1992 25 EATCSMTCS Wechler, Universal Algebra for Computer Scientists 1991 24 EATCSMTCS Gergely & Ury, First-Order Programming Theories 1990 22 EATCSMTCS Balcazar & Diaz & Gabarro, Structural Complexity II 1990 21 EATCSMTCS Ehrig & Mahr, Fundamentals of Algebraic Specification 2: Module Specifications and Constraints 1990 20 EATCSMTCS Sippu & Soisalon-Soininen, Parsing Theory, Volume II: LR(k) and LL(k) Parsing 1989 18 EATCSMTCS Dassow & Paun, Regulated Rewriting in Formal Language Theory 1989 17 EATCSMTCS Paredaens & De Bra & Gyssens & Van Gucht, The Structure of the Relational Database Model 1988 16 EATCSMTCS Padawitz, Computing in Horn Clause Theories 1988 15 EATCSMTCS Sippu & Soisalon-Soininen, Parsing Theory, Volume I: Languages and Parsing 1988 14 EATCSMTCS Jantzen, Confluent String Rewriting 1988 13 EATCSMTCS Best & Fernandez, Nonsequential Processes: A Petri Net View 1988 12 EATCSMTCS Berstel & Reutenauer, Rational Series and Their Languages 1988 11 EATCSMTCS Balcazar & Diaz & Gabarro, Structural Complexity I 1987 EATCSMTCS Edelsbrunner, Algorithms in Combinatorial Geometry 1987 EATCSMTCS Kroeger, Temporal Logic of Programs 1987 EATCSMTCS Weihrauch, Computability 1986 7 EATCSMTCS Gecseg, Products of Automata 1986 5 EATCSMTCS Kuich & Salomaa, Semirings, Automata, Languages 1984 3 EATCSMTCS Mehlhorn, Data Structures and Algorithms 3: Multidimensional Searching and Computational Geometry 1984 3 EATCSMTCS Mehlhorn, Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness 1984 3 EATCSMTCS Mehlhorn, Data Structures and Algorithms 1: Sorting and Searching 1994 ECML Kohavi, Bottom-Up Induction of Oblivious Read-Once Decision Graphs 1994 ECML Nienhuys-Cheng & Polman, Sample PAC-Learnability in Model Inference 1994 ECML Wettschereck, A Hybrid Nearest-Neighbor and Nearest-Hyperrectangle Algorithm 1994 ECML Shinohara, Complexity of Computing Generalized VC-Dimensions 1994 ECML Vrain & Martin, Inductive Learning of Normal Clauses 1989 ECONOMIST , Quantum Cryptography: Conjugal Secrets 1987 ECONOMIST , Computer Science's Holy Grail 1996 2 EDCC Avresky & Cunningham, Single Source Fault-Tolerant Broadcasting for Two-Dimensional Meshes Without Virtual Channels 1996 2 EDCC Renovell & Huc & Bertrand, The Logic Threshold Based Voting: A Model for Local Feedback Bridging Fault 1996 2 EDCC Guerraoui & Oliveira & Schiper, Atomic Updates of Replicated Data 1992 28 EIK Ahlfeld & Hecker, The Computational Complexity of some Guard Sets in Polygons 1992 28 EIK Bull & Hemmerling, Traps for Jumping Multihead Counter Automata 1992 28 EIK Huy & Than, Generalized Positive Boolean Dependencies 1992 28 EIK Wentzlau, The Maximum Number of Edges in a Preuniquely k-Colourable Graph with Resistive k-Colourings 1992 28 EIK Zurawiecki, The Strong Similitude of Hamiltonian Circuits of a de Bruijn Graph 1992 28 EIK Bordihn, Pure Languages and the Degree of Nondeterminism 1992 28 EIK Habel, Hypergraph Grammars: Transformational and Algorithmic Aspects 1992 28 EIK Salomaa, Confluence, Ground Confluence, and Termination of Monadic Term Rewriting Systems 1992 28 EIK Stiebe, Picture Generation Using Matrix Systems 1992 28 EIK Brandt, Number Representations and Registers 1992 28 EIK Berman & Blok, Equational Dependencies 1992 28 EIK Lau, A Completeness Criterion for P_k(l) 1992 28 EIK Hendrich & Stiebitz, On the Bandwidth of Graph Products 1992 28 EIK Eschenbach, Sequential Fixed-Width Confidence Interval for System Availability 1992 28 EIK Nakatsuka & Ishikawa, Stochastic Properties of Sharing a Taxi 1992 28 EIK Olejar, On the Geometry of a Random Square Boolean Matrix 1992 28 EIK Peltola, A Normal Form for Right Dominating Linear Languages 1992 28 EIK Wegener, How far Can We Count in Constant Depth with a Polylogarithmic Number of Gates? 1992 28 EIK Bertsch, Variation of Parsing Speed -- a Case Study for Modula-2 1992 28 EIK Voigt, On the Chromatic Number of Distance Graphs 1992 28 EIK Dinh Hoa, Uber die Hamiltonizitat in einer Klasse spezieller Graphen 1992 28 EIK Watjen, A Weak Iteration Theorem for k-limited E0L Systems 1991 27 EIK Fauck, Covering Polygons with Rectangles via Edge Coverings of Bipartite Permutation Graphs 1991 27 EIK Hromkovic & Janiga & Koubek, Variable Multihead Machines 1991 27 EIK Koebe, Tolerance Graphs and Trapezoidal Graphs 1991 27 EIK Su, Relationships Between Classes of Petri Net Languages 1991 27 EIK Agaian & Petrosian, On the Relationship between Compression Coefficient, Precision of Reconstruction and Complexity of Calculations 1991 27 EIK Mkhitarian, Multi Asymmetric Error-Correcting Code 1991 27 EIK Staiger, On Codes Having Dual Distance d' >= k 1991 27 EIK Scheithauer, A Three-dimensional Bin Packing Algorithm 1991 27 EIK Ropling-Lenhart, A Lower Bound for the Length of Snakes 1991 27 EIK Bar, A Special Problem on Rectangular Floorplans Solvable in Polynomial Time 1991 27 EIK Sonntag, Hamiltonicity and Traceability of the Lexicographic Product of Hypergraphs 1991 27 EIK Geffert, How to Generate Languages Using Only Two Pairs of Parentheses 1991 27 EIK Tittmann & Blechschmidt, Reliability Bounds Based on Network Splitting 1991 27 EIK Leopold, Reading Data in a Hierarchical Memory 1991 27 EIK Popova, On Time Petri Nets 1991 27 EIK Wentzlau, Preuniquely k-colourable Graphs and k-colouring Matrices 1991 27 EIK Meduna, Global Context Conditional Grammars 1991 27 EIK Lau, On Closed Subsets of Boolean Functions (a New Proof for Post's Theorem) 1991 27 EIK Kutrib & Vollmar, Minimal Time Synchronization in Restricted Defective Cellular Automata 1991 27 EIK Zunic, Inner and Outer Convex Hull Approximation for Finite Planar Point Sets 1991 27 EIK Molitor, A Survey on Wiring 1991 27 EIK Fernau, On Function-limited Lindenmayer Systems 1991 27 EIK Tiplea & Jucan & Masalagiu, Conditional Petri Net Languages 1991 27 EIK Lischke, Correction on My Paper ``The Quality of Separation Between Polynomial Time and Exponential Time'' in J. Inform. Process. Cybernet. EIK 25 (1989) 10, 529-534 1990 26 EIK Kolla, Minimal Area Sizing of Power Supply Nets in VLSI Circuits 1990 26 EIK Baumann & Lesch, Equivalent Colourings and Partitions of Graphs 1990 26 EIK Steidl, Existence and Construction of Self-complementary Normal Bases 1990 26 EIK Stohr, Optimal Book Embeddings in Depth-k K_n-cylinders 1990 26 EIK Goetze & Nehrlich & Gordejev & Kochetkov, Maximal Empty Boxes in Higher-dimensional Spaces 1990 26 EIK Becker & Hartmann, Optimal-Time Multipliers and C-Testability 1990 26 EIK Jurgensen & Yu, Solid Codes 1990 26 EIK Koebe & Knochel, On the Block Alignment Problem 1990 26 EIK Ito & Shyr, p-Languages and p-Representations 1990 26 EIK Watjen, On k-Uniformly-Limited T0L Systems and Languages 1990 26 EIK Makinen, On Breadth-first Context-free Grammars 1990 26 EIK Zunic, Approximate Convex Hull Algorithm -- Efficiency Evaluations 1990 26 EIK Krivine & Parigot, Programming with Proofs 1990 26 EIK Sarni, Lambda-Calculus on Occurrence. The Theory and its Combinatorial Counterpart 1990 26 EIK Prochazka, Systolic Systems for Polynomial GCD Computation 1990 26 EIK Steinby, A Formal Theory of Errors in Tree Representations of Patterns 1990 26 EIK Csuhaj-Varju & Dassow, On Cooperating/Distributed Grammar Systems 1990 26 EIK Bull & Hemmerling, Finite Embedded Trees and Simply Connected Mazes cannot be Searched by Halting Finite Automata 1990 26 EIK Lampe, Local Parse -- A Base for Realistic Parallelisation of Compilers 1990 26 EIK Reichel, Some Classifications of Indian Parallel Languages 1990 26 EIK Voelkel, Graphs and Automata in the Theory of Signature Analysis 1989 25 EIK Huckenbeck, An Equivalence Result for Oracle Sets 1989 25 EIK Unger, The Convex Hull Problem on Special Planar Point Sets 1989 25 EIK Horvath, A Definition and a Generating System for Elementary Sequence Functions 1989 25 EIK Lischke, notes on Lischke, The Quality of Separation Between Polynomial Time and Exponential Time 1989 25 EIK Wiedermann, On the Power of Synchronization 1989 25 EIK Hotz & Kretschmer, The Power of the Greibach Normal Form 1989 25 EIK Kemp, Binary Search Trees for d-dimensional Keys 1989 25 EIK Lischke, The Quality of Separation Between Polynomial Time and Exponential Time 1989 25 EIK Bauernoppel, A Parallel Dictionary with Good Amortized Behavior 1989 25 EIK Zeugmann, Improved Parallel Computations in the Ring Z/p^a 1989 25 EIK Thalheim, review of Brassard and Bratley, Algorithmics: Theory and Practice (1988) 1989 25 EIK Giessmann, review of Brassard, Modern Cryptology: A Tutorial (1988) 1989 25 EIK Wegener & Zadori, A Note on the Relations Between Critical and Sensitive Complexity 1989 25 EIK Dassow, Graph-theoretical Properties and Chain Code Picture Languages 1989 25 EIK Fischer, Lower Bound Proofs via Voronoi Diagrams 1989 25 EIK Freivalds & Kinber & Wiehagen, On the Power of Probabilistic Inductive Inference in Nonstandard Numberings 1989 25 EIK Habasinski, Solving Generalized Equations Over Infinite Trees 1989 25 EIK Lischke, Types of Separations for Relativized Complexity Classes 1989 25 EIK Smid & Torenvliet & van Emde Boas & Overmars, Two Models for the Reconstruction Problem for Dynamic Data Structures 1989 25 EIK Kumicakova-Jiraskova, Chomsky Hierarchy and Communication Complexity 1979 15 EIK Hemmerling, Zur Raumkompliziertheit Mehrdimensionaler Zellularraume und Turing-Automaten 1972 8 EIK Dinh Dieu, On a Necessary Condition for Stochastic Languages 1993 29 ELETS Arazi, Integrating a Key Distribution Procedure into the Digital Signature Standard 1992 38 ENSEIGN Farb, Automatic Groups: A Guided Tour 1992 38 ENSEIGN Allouche & Bacher, Toeplitz Sequences, Paperfolding, Towers of Hanoi and Progression-free Sequences of Integers 1992 38 ENSEIGN Shallit, Real Numbers with Bounded Partial Quotients: A Survey 1982 28 ENSEIGN Borodin, Structured vs General Models in Computational Complexity 1982 28 ENSEIGN Karp & Lipton, Turing Machines That Take Advice 1982 28 ENSEIGN Valiant, Reducibility by Algebraic Projections 1981 27 ENSEIGN Cook, Towards a Complexity Theory of Synchronous Parallel Computation 1984 32 ENSEIGNSC Sakarovitch, Optimisation Combinatoire--Methodes Mathematiques et Algorithmiques: Programmation Discrete 1984 31 ENSEIGNSC Sakarovitch, Optimisation Combinatoire--Methodes Mathematiques et Algorithmiques: Graphes et Programmation Lineaire 1990 ERGOSYST Hancox & Mills & Reid, Keyguide to Information Sources in Artificial Intelligence/Expert Systems 1994 ERLBAUM Schoenfeld (Ed.), Mathematical Thinking and Problem Solving 1992 ERLBAUM Dinsmore (Ed.), The Symbolic and Connectionist Paradigms: Closing the Gap 1996 4 ESA Sedgewick, Analysis of Shellsort and Related Algorithms 1996 4 ESA Garg & Tamassia & Vocca, Drawing with Colors 1996 4 ESA Kirousis & Kranakis & Krizanc, Approximating the Unsatisfiability Threshold of Random Formulas 1996 4 ESA Schwiegelshohn, Preemptive Weighted Completion Time Scheduling of Parallel Jobs 1996 4 ESA Gergov, Approximation Algorithms for Dynamic Storage Allocation 1996 4 ESA Trevisan, Positive Linear Programming, Parallel Approximation and PCP's 1996 4 ESA Mohring & Schaffter & Schulz, Scheduling Jobs with Communication Delays: Using Infeasible Solutions for Approximation 1996 4 ESA Roura & Martinez, Randomization of Search Trees by Subtree Size 1996 4 ESA Ferragina & Muthukrishnan, Efficient Dynamic Method-Lookup in Object Oriented Languages 1996 4 ESA Raman, Priority Queues: Small, Monotone and Trans-dichotomous 1996 4 ESA Nolte & Schrader, Simulated Annealing and Its Problems to Color Graphs 1996 4 ESA Khuller & Sussmann, The Capacitated k-Center Problem 1996 4 ESA Fujito, A Unified Local Ratio Approximation of Node-Deletion Problem 1996 4 ESA Guha & Khuller, Approximation Algorithms for Connected Dominating Sets 1996 4 ESA Frieze & Szpankowski, Greedy Algorithms for the Shortest Common Superstring that Are Asymptotically Optimal 1996 4 ESA Tsukiji & Xhafa, On the Depth of Randomly Generated Circuits 1996 4 ESA Viola & Poblete, The Analysis of Linear Probing Hashing with Buckets 1996 4 ESA Chen & Chen & Wada & Kawaguchi, Parallel Algorithms for Partitioning Sorted Sets and Related Problems 1996 4 ESA Czumaj & Kanarek & Kutylowski & Lorys, Fast Generation of Random Permutations via Network Simulation 1996 4 ESA Ferragina & Luccio, On the Parallel Dynamic Dictionary Matching Problem: New Results with Application 1996 4 ESA Bodlaender & De Fluiter, Parallel Algorithms for Series Parallel Graphs 1996 4 ESA Leoncini & Manzini & Margara, Parallel Complexity of Householder QR Factorization 1996 4 ESA Basch & Guibas & Ramkumar, Reporting Red-Blue Intersections Between Two Sets of Connected Line Segments 1996 4 ESA Alt & Fuchs & Rote & Weber, Matching Convex Shapes with Respect to the Symmetric Difference 1996 4 ESA Arkin & Chiang & Held & Mitchell & Sacristan & Skiena & Yang, On Minimum-Area Hulls 1996 4 ESA Cherkassky & Goldberg, Negative Cycle Detection Algorithms 1996 4 ESA Watson, A New Regular Grammar Pattern Matching Algorithm 1996 4 ESA Karkkainen & Sutinen, Lempel-Ziv Index for q-Grams 1996 4 ESA Heckmann & Lengauer, Computing Upper and Lower Bounds on Textile Nesting Problems 1996 4 ESA Alon & Csirik & Sevast'janov & Vestjens & Woeginger, On-Line and Off-Line Algorithms for Vector Covering 1996 4 ESA Achlioptas & Chrobak & Noga, Competitive Analysis of Randomized Paging Algorithms 1996 4 ESA Awerbuch & Azar & Fiat & Leonardi & Rosen, On-Line Competitive Algorithms for Call Admission in Optical Networks 1996 4 ESA Klein & Lu & Netzer, Race-Condition Detection in Parallel Computation with Semaphores 1996 4 ESA Kaklamanis & Persiano, Efficient Wavelength Routing on Directed Fiber Trees 1996 4 ESA Ben-Aroya & Chinn & Schuster, A Lower Bound for Nearly Minimal Adaptive and Hot Potato Algorithms 1996 4 ESA Christopher & Farach & Trick, The Structure of Circular Decomposable Metrics 1996 4 ESA Dessmark & Lingas & Proskurowski, Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-Trees 1996 4 ESA Arikati & Chen & Chew & Das & Smid & Zaroliagis, Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane 1996 4 ESA Auletta & Parente & Persiano, A New Approach to Optimal Planning of Robot Motion on a Tree with Obstacles 1996 4 ESA Lopez-Ortiz & Schuierer, Generalized Streets Revisited 1996 4 ESA Papadimitriou, Computational Aspects of Organization Theory 1995 3 ESA Even & Itkis & Rajsbaum, On Mixed Connectivity Certificates 1995 3 ESA Baumker & Dittrich & Meyer auf der Heide, Truly Efficient Parallel Algorithms: c-Optimal Multisearch for an Extension of the BSP Model 1995 3 ESA Chaudhuri & Zaroliagis, Optimal Parallel Shortest Paths in Small Treewidth Digraphs 1995 3 ESA Czumaj & Meyer auf der Heide & Stemann, Shared Memory Simulations with Triple-Logarithmic Delay 1995 3 ESA Herley & Pietracaprina & Pucci, Implementing Shared Memory on Multi-Dimensional Meshes and on the Fat-Tree 1995 3 ESA Kaufmann & Sibeyn & Suel, Beyond the Worst-Case Bisection Bound: Fast Sorting and Ranking on Meshes 1995 3 ESA Chlebus & Gasieniec & Pelc, Fast Deterministic Simulation of Computations on Faulty Parallel Machines 1995 3 ESA Codenotti & Gemmell & Simon, Average Circuit Depth and Average Communication Complexity 1995 3 ESA Gil & Itai, Packing Trees 1995 3 ESA Deineko & Rudolf & Woeginger, Sometimes Travelling is Easy: The Master Tour Problem 1995 3 ESA Pe'er & Shamir, Interval Graphs with Side (and Size) Constraints 1995 3 ESA Goldberg & Karzanov, Maximum Skew-Symmetric Flows 1995 3 ESA Henzinger & La Poutre, Certificates and Fast Algorithms for Biconnectivity in Fully-Dynamic Graphs 1995 3 ESA Mehlhorn & Priebe, On the All-Pairs Shortest Path Algorithm of Moffat and Takaoka 1995 3 ESA Husfeldt, Fully Dynamic Transitive Closure in Plane Dags with One Source and One Sink 1995 3 ESA Feng & Cohen & Eades, Planarity for Clustered Graphs 1995 3 ESA Chor & Sudan, A Geometric Approach to Betweenness 1995 3 ESA Papadopoulou & Lee, Efficient Computation of the Geodesic Voronoi Diagram of Points in a Simple Polygon 1995 3 ESA de Berg, Linear Size Binary Space Partitions for Fat Objects 1995 3 ESA Chew & Dor & Efrat & Kedem, Geometric Pattern Matching in d-Dimensional Space 1995 3 ESA Wang & Chin, Finding the Constrained Delaunay Triangulation and Constrained Voronoi Diagram of a Simple Polygon in Linear-Time 1995 3 ESA Arge & Vengroff & Vitter, External-Memory Algorithms for Processing Line Segments in Geographic Information Systems 1995 3 ESA Barbosa & Navarrro & Baeza-Yates & Perleberg & Ziviani, Optimized Binary Search and Text Retrieval 1995 3 ESA Sutinen & Tarhio, On Using q-Gram Locations in Approximate String Matching 1995 3 ESA Meyer auf der Heide & Scheideler, Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks 1995 3 ESA Westbrook, Load Balancing for Response Time 1995 3 ESA Berthome & Duboux & Hagerup & Newman & Schuster, Self-Simulation for the Passive Optical Star Model 1995 3 ESA Farach & Przytycka & Thorup, Computing the Agreement of Trees with Bounded Degrees 1995 3 ESA Yu & Cheriyan, Approximation Algorithms for Feasible Cut and Multicut Problems 1995 3 ESA Serna & Xhafa, On Parallel versus Sequential Approximation 1995 3 ESA Wagner & Wolff, An Efficient and Effective Approximation Algorithm for the Map Labeling Problem 1995 3 ESA Kloks & Kratsch & Muller, Approximating the Bandwidth for Asteroidal Triple-free Graphs 1995 3 ESA Dubhashi & Panconesi, Near-Optimal Distributed Edge Coloring 1995 3 ESA Bern & Eppstein & Guibas & Hershberger & Suri & Wolter, The Centroid of Points with Approximate Weights 1995 3 ESA Schulz & Weismantel & Ziegler, 0/1-Integer Programming: Optimization and Augmentation are Equivalent 1995 3 ESA Kalyanasundaram & Pruhs, The Online Transportation Problem 1995 3 ESA Mutzel, A Polyhedral Approach to Planar Augmentation and Related Problems 1995 3 ESA Gerstel & Wool & Zaks, Optimal Layouts on a Chain ATM Network 1995 3 ESA Alon & Galil & Yung, Efficient Dynamic-Resharing ``Verifiable Secret Sharing'' Against Mobile Adversary 1995 3 ESA Aggarwal & Garay & Herzberg, Adaptive Video On Demand 1995 3 ESA Poblete & Munro & Papadakis, The Binomial Transform and its Application to the Analysis of Skip Lists 1995 3 ESA Damaschke, An Optimal Parallel Algorithm for Digital Curve Segmentation Using Hough Polygons and Monotone Function Search 1995 3 ESA Klein & Lingas, Fast Skeleton Construction 1994 2 ESA Goldberg, Optimization Algorithms for Large Networks 1994 2 ESA Gonnet, Wanna Buy an Algorithm? Cheap! or: Algorithms for Text Searching Which Could Have Commercial Value 1994 2 ESA Garg & Tamassia, Planar Drawings and Angular Resolution: Algorithms and Bounds 1994 2 ESA Biedl & Kant, A Better Heuristic for Orthogonal Graph Drawings 1994 2 ESA Arkin & Held & Mitchell & Skiena, Hamiltonian Triangulations for Fast Rendering 1994 2 ESA Arya & Smid, Efficient Construction of a Bounded Degree Spanner with Low Weight 1994 2 ESA Berman & Fossmeier & Karpinski & Kaufmann & Zelikovsky, Approaching the 5/4-Approximation for Rectilinear Steiner Trees 1994 2 ESA Brodnik & Munro, Membership in Constant Time and Minimum Space 1994 2 ESA Andersson & Nilsson, Faster Searching in Tries and Quadtrees -- An Analysis of Level Compression 1994 2 ESA Poblete & Viola & Munro, The Analysis of a Hashing Scheme by the Diagonal Poisson Transform 1994 2 ESA Carlsson & Chen, Some Lower Bounds for Comparison-Based Algorithms 1994 2 ESA Zhou & Nishizeki, An Efficient Algorithm for Edge-Ranking Trees 1994 2 ESA Weihe, Edge-Disjoint (s,t)-Paths in Undirected Planar Graphs in Linear Time 1994 2 ESA Stoer & Wagner, A Simple Min Cut Algorithm 1994 2 ESA Cho & Raje & Sarrafzadeh, Approximation Algorithm for Finding a Central Vertex of a Chordal Graph 1994 2 ESA Israeli & Shirazi, The Time Complexity of Updating Snapshot Memories 1994 2 ESA Parlati & Yung, Non-Exploratory Self-Stabilization for Constant-Space Symmetry-Breaking 1994 2 ESA Lund & Reingold & Westbrook & Yan, On-Line Distributed Data Management 1994 2 ESA Asano & Katoh & Tokuyama, A Unified Scheme for Detecting Fundamental Curves in Binary Edge Images 1994 2 ESA Burnikel & Mehlhorn & Schirra, How to Compute the Voronoi Diagram of Line Segments: Theoretical and Practical Results 1994 2 ESA Overmars & van der Stappen, Range Searching and Point Location among Fat Objects 1994 2 ESA Boissonnat & Czyzowicz & Devillers & Robert & Yvinec, Convex Tours of Bounded Curvature 1994 2 ESA Chiang & Tamassia, Optimal Shortest Path and Minimum-Link Path Queries in the Presence of Obstacles 1994 2 ESA Gupta & Janardan & Smid, Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric Objects 1994 2 ESA Schiermeyer, Reverse-Fit: A 2-Optimal Algorithm for Packing Rectangles 1994 2 ESA Chen & van Vliet & Woeginger, An Optimal Algorithm for Preemptive On-Line Scheduling 1994 2 ESA Srivastav & Stangier, Tight Approximations for Resource Constrained Scheduling Problems 1994 2 ESA Wedelin, An Algorithm for 0-1 Programming with Application to Airline Crew Scheduling 1994 2 ESA Das & Ferragina, An o(n) Work EREW Parallel Algorithm for Updating MST 1994 2 ESA Franciosa & Gambosi & Nanni, On the Structure of DFS-Forests on Directed Graphs and the Dynamic Maintenance of DFS on DAG's 1994 2 ESA Alon & Yuster & Zwick, Finding and Counting Given Length Cycles 1994 2 ESA Ben-Aroya & Schuster, Greedy Hot-Potato Routing on the Mesh 1994 2 ESA Sibeyn, Desnakification of Mesh Sorting Algorithms 1994 2 ESA Pietracaprina & Pucci, Tight Bounds on Deterministic PRAM Emulations with Constant Redundancy 1994 2 ESA Chlebus & Gambin & Indyk, PRAM Computations Resilient to Memory Faults 1994 2 ESA Bilardi & Bay, An Area Lower Bound for a Class of Fat-Trees 1994 2 ESA Hunt & Marathe & Radhakrishnan & Ravi & Rosenkrantz & Stearns, A Unified Approach to Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs 1994 2 ESA Greenlaq & Machta, The Parallel Complexity of Eden Growth, Solid-on-Solid Growth and Ballistic Deposition 1994 2 ESA Schonhage & Vetter, A New Approach to Resultant Computations and Other Algorithms with Exact Division 1994 2 ESA Plandowski, Testing Equivalence of Morphisms on Context-Free Languages 1994 2 ESA Gasieniec & Park, Work-Time Optimal Parallel Prefix Matching 1994 2 ESA Breslauer & Colussi & Toniolo, On the Exact Complexity of the String Prefix-Matching Problem 1994 2 ESA Ferragina, Incremental Text Editing: A New Data Structure 1994 2 ESA Kloks & Bodlaender & Muller & Kratsch, errata for Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators 1993 1 ESA Albers, The Influence of Lookahead in Competitive Paging Algorithms 1993 1 ESA Atallah & Chen & Lee, An Optimal Algorithm for Shortest Paths on Weighted Interval and Circular-Arc Graphs, with Applications 1993 1 ESA Ben-Asher & Gordon & Schuster, Efficient Self Simulation Algorithms for Reconfigurable Arrays 1993 1 ESA Bertolazzi & Di Battista & Mannino & Tamassia, Optimal Upward Planarity Testing of Single-Source Digraphs 1993 1 ESA Bhatt & Bilardi & Pucci & Ranade & Rosenberg & Schwabe, On Bufferless Routing of Variable-Length Messages in Leveled Networks 1993 1 ESA Breslauer, Saving Comparisons in the Crochemore-Perrin String Matching Algorithm 1993 1 ESA Bruggemann-Klein, Unambiguity of Extended Regular Expressions in SGML Document Grammars 1993 1 ESA Bshouty, On the Direct Sum Conjecture in the Straight Line Model 1993 1 ESA Cohen & Tamassia, Combine and Conquer: a General Technique for Dynamic Algorithms 1993 1 ESA Datta & Maheshwari & Sack, Optimal CREW-PRAM Algorithms for Direct Dominance Problems 1993 1 ESA de Berg & van Kreveld, Trekking in the Alps Without Freezing or Getting Tired 1993 1 ESA Devillers & Golin, Dog Bites Postman: Point Location in the Moving Voronoi Diagram and Related Problems 1993 1 ESA Diaz & Serna & Toran, Parallel Approximation Schemes for Problems on Planar Graphs 1993 1 ESA Fellows & Hallett & Wareham, DNA Physical Mapping: Three Ways Difficult 1993 1 ESA Flajolet & Zimmermann & van Cutsem, A Calculus of Random Generation 1993 1 ESA Gerstel & Zaks, The Bit Complexity of Distributed Sorting 1993 1 ESA Hagauer & Rote, Three-Clustering of Points in the Plane 1993 1 ESA Hromkovic & Klasing & Stohr & Wagener, Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs 1993 1 ESA Italiano & La Poutre & Rauch, Fully Dynamic Planarity Testing in Planar Embedded Graphs 1993 1 ESA Ivkovic & Lloyd, Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps 1993 1 ESA Jordan, Increasing the Vertex-Connectivity in Directed Graphs 1993 1 ESA Klinz & Rudolf & Woeginger, On the Recognition of Permuted Bottleneck Monge Matrices 1993 1 ESA Kloks & Bodlaender & Muller & Kratsch, Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators 1993 1 ESA Kunde, Block Gossiping on Grids and Tori: Deterministic Sorting and Routing Match the Bisection Bound 1993 1 ESA Lenstra & Veldhorst & Veltman, The Complexity of Scheduling Trees with Communication Delays 1993 1 ESA Mayr & Werchner, Optimal Tree Contraction on the Hypercube and Related Networks 1993 1 ESA Paterson, Evolution of an Algorithm 1993 1 ESA Rajasekaran, Mesh Connected Computers with Fixed and Reconfigurable Buses: Packet Routing, Sorting, and Selection 1993 1 ESA Ramachandran & Yang, An Efficient Parallel Algorithm for the Layered Planar Monotone Circuit Value Problem 1993 1 ESA Sibeyn & Kaufmann & Raman, Randomized Routing on Meshes with Buses 1993 1 ESA Simon & Crippa & Collenberg, On the Distribution of the Transitive Closure in a Random Acyclic Digraph 1993 1 ESA Schrijver, Complexity of Disjoint Paths Problems in Planar Graphs 1993 1 ESA Srivastav & Stangier, Integer Multicommodity Flows with Reduced Demands 1993 1 ESA Subramanian, A Fully Dynamic Data Structure for Reachability in Planar Digraphs 1993 1 ESA Wagner & Weihe, A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs 1993 1 ESA Waterman, Sequence Comparison and Statistical Significance in Molecular Biology 1993 1 ESA Welzl & Wolfers, Surface Reconstruction Between Simple Polygons via Angle Criteria 1993 1 ESA Zhou & Nakano & Nishizeki, A Linear Algorithm for Edge-Coloring Partial k-Trees 1992 23 ESMATH Cox & Mouw, Disruption of the Representativeness Heuristic: Can We Be Perturbed into Using Correct Probabilistic Reasoning? 1991 22 ESMATH Moreno & Waldegg, The Conceptual Evolution of Actual Mathematical Infinity 1989 20 ESMATH Borasi & Rose, Journal Writing and Mathematics Instruction 1992 4 ESOP Anderson, Model Checking and Boolean Graphs 1992 4 ESOP Chuang, Fully Persistent Arrays for Efficient Incremental Updates and Voluminous Reads 1992 4 ESOP Danvy, Back to Direct Style 1992 4 ESOP Goldberg, Incremental Garbage Collection without Tags 1992 4 ESOP Hankin & Hunt, Approximate Fixed Points in Abstract Interpretation 1992 4 ESOP O'Keefe & Wand, Type Inference for Partial Types is Decidable 1990 3 ESOP Paige, Transformational Derivation of Nonnumerical Finite Differencing Algorithms 1996 4 ESORICS Waidner, Development of a Secure Electronic Marketplace for Europe 1996 4 ESORICS Mao, Light-Weight Micro-cash Payment for the Internet 1996 4 ESORICS Camenisch & Maurer & Stadler, Digital Payment Systems with Passive Anonymity-Revoking Trustees 1996 4 ESORICS Atluri & Huang, An Authorization Model for Workflows 1996 4 ESORICS Sandhu, Role Hierarchies and Constraints for Lattice-Based Access Controls 1996 4 ESORICS Nicomette & Deswarte, A Multilevel Security Model for Distributed Object Systems 1996 4 ESORICS De Capitani di Vimercati & Samarati, An Authorization Model for Federated Systems 1996 4 ESORICS Farmer & Guttman & Swarup, Security for Mobile Agents: Authentication and State Appraisal 1996 4 ESORICS Asokan & Tsudik & Waidner, Server-Supported Signatures 1996 4 ESORICS Wu, Sleepy Network-Layer Authentication Service for IPSEC 1996 4 ESORICS Zhou & Gollmann, Certified Electronic Mail 1996 4 ESORICS Schneier & Kelsey & Walker, Distributed Proctoring 1996 4 ESORICS Bonatti & Sapino & Subrahmanian, Merging Heterogeneous Security Orderings 1996 4 ESORICS Schneider & Sidiropoulos, CSP and Anonymity 1996 4 ESORICS Wedel & Kessler, Formal Semantics for Authentication Logics 1996 4 ESORICS Lotz, Threat Scenarios as a Means to Formally Develop Secure Systems 1996 4 ESORICS Warner & Li & Keefe & Pal, The Impact of Multilevel Security on Database Buffer Management 1996 4 ESORICS Marks & Motro & Jajodia, Enhancing the Controlled Disclosure of Sensitive Information 1996 4 ESORICS Mancini & Ray, Secure Concurrency Control in MLS Databases with Two Versions of Data 1996 4 ESORICS Maurer, Modelling a Public-Key Infrastructure 1996 4 ESORICS Meadows, Analyzing the Needham-Schroeder Public-Key Protocol: A Comparison of Two Approaches 1994 3 ESORICS Boyd & Mao, Designing Secure Key Exchange Protocols 1994 3 ESORICS Hauser & Janson & Molva & Tsudik & Van Herreweghen, Robust and Secure Password and Key Change Method 1994 3 ESORICS Jiwa & Seberry & Zheng, Beacon Based Authentication 1994 3 ESORICS Hardjono & Seberry, Authentication via Multi-Service Tickets in the Kuperee Server 1994 3 ESORICS Chen, Oblivious Signatures 1994 3 ESORICS Maurer & Schmid, A Calculus for Secure Channel Establishment in Open Networks 1994 3 ESORICS Mao & Boyd, On Strengthening Authentication Protocols to Foil Cryptanalysis 1994 3 ESORICS Camenisch & Piveteau & Stadler, An Efficient Electronic Payment System Protecting Privacy 1994 3 ESORICS Boly & Bosselaers & Cramer & Michelsen & Mjolsnes & Muller & Pedersen & Pfitzmann & de Rooij & Schoenmakers & Schunter & Vallee & Waidner, Teh ESPRIT Project CAFE -- High Security Digital Payment Systems 1994 3 ESORICS Anderson, Liability and Computer Security: Nine Principles 1990 10 ETDS Hurley, Ergodic Aspects of Cellular Automata 1988 8 ETDS Tihomirov, Andrei Nikolaevich Kolmogorov 1989 EUROCAL Grigor'ev, Complexity of Quantifier Elimination in the Theory of Ordinary Differential Equations 1989 EUROCAL Fitch & Hall, Symbolic Computation and the Finite Element Method 1989 EUROCAL Pearce & Fitch, Dynamic Program Improvement 1989 EUROCAL Kaltofen & Krishnamoorthy & Saunders, Mr. Smith Goes to Las Vegas: Randomized Parallel Computation of the Smith Normal Form of Polynomial Matrices 1989 EUROCAL Valibouze, Fonctions Symetriques et Changements de Bases 1989 EUROCAL Scheffler & Seese, A Combinatorial and Logical Approach to Linear-time Computability 1989 EUROCAL Abbott & Davenport, Polynomial Factorization: An Exploration of Lenstra's Algorithm 1989 EUROCAL Werner, Shortest Paths of a Disc Inside a Polygonal Region 1989 EUROCAL Recio & Pardo, Rabin's Width of a Complete Proof and the Width of a Semialgebraic Set 1990 EUROCODE Berger, A Direct Proof for the Automorphism Group of Reed-Solomon Codes 1990 EUROCODE Carlet, A Transformation on Boolean Functions, Its Consequences on Some Problems Related to Reed-Muller Codes 1990 EUROCODE Burger & Chabanne & Girault, Minimum-Change Binary Block-Codes which are Well Balanced 1990 EUROCODE Mabogunje & Farrell, Construction of Unequal Error Protection Codes 1990 EUROCODE Cohen & Gargano & Vaccaro, Unidirectional Error-Detecting Codes 1990 EUROCODE Montpetit, Coherent Partitions and Codes 1990 EUROCODE Le Brigand, Decoding of Codes on Hyperelliptic Curves 1990 EUROCODE Girault, A Survey of Identification Schemes 1990 EUROCODE Harari, A Correlation Cryptographic Scheme 1990 EUROCODE Patarin, Pseudorandom Permutations based on the DES Scheme 1990 EUROCODE Fell, Linear Complexity of Transformed Sequences 1990 EUROCODE Domingo-Ferrer & Huguet-Rotger, A Cryptographic Tool for Programs Protection 1990 EUROCODE Sgarro, A Shannon-theoretic Coding Theorem in Authentication Theory 1990 EUROCODE Fioretto & Sgarro, Joint Fractional Entropy 1990 EUROCODE Capocelli & De Santis, Minimum Codeword Length and Redundancy of Huffman Codes 1994 2 EUROCOLT Solomonoff, The Discovery of Algorithmic Probability: A Guid for the Programming of True Creativity 1994 2 EUROCOLT Freund & Schapire, A Decision-theoretic Generalization of On-line Learning and an Application to Boosting 1994 2 EUROCOLT Ben-David & Kushilevitz & Mansour, Online Learning versus Offline Learning 1994 2 EUROCOLT Ben-David & Lindenbaum, Learning Distributions by their Density Levels--A Paradigm for Learning without a Teacher 1994 2 EUROCOLT Haussler & Kivinen & Warmuth, Tight Worst-Case Loss Bounds for Predicting with Expert Advice 1994 2 EUROCOLT Yamanishi, On-line Maximum Likelihood Prediction with Respect to General Loss Functions 1994 2 EUROCOLT Ambainis, The Power of Procrastination in Inductive Inference: How It Depends on Used Ordinal Notations 1994 2 EUROCOLT Balcazar & Buhrman & Hermo, Learnability of Kolmogorov-Easy Circuit Expressions via Queries 1994 2 EUROCOLT Lange & Zeugmann, Trading Monotonicity Demands versus Mind Changes 1994 2 EUROCOLT Case & Kaufmann & Kinber & Kummer, Learning Recursive Functions from Approximations 1994 2 EUROCOLT Freivalds & Kinber & Smith, On the Intrinsic Complexity of Learning 1994 2 EUROCOLT Jain & Sharma, The Structure of Intrinsic Complexity of Learning 1994 2 EUROCOLT Freivalds & Jain, Kolmogorov Numberings and Minimal Identification 1994 2 EUROCOLT Rissanen, Stochastic Complexity in Learning 1994 2 EUROCOLT Anthony & Bartlett, Function Learning from Interpolation 1994 2 EUROCOLT Gurvitz & Koiran, Approximation and Learning of Convex Superpositions 1994 2 EUROCOLT Vovk, Minimum Description Length Estimators under the Optimal Coding Scheme 1994 2 EUROCOLT Kilpelainen & Mannila & Ukkonen, MDL Learning of Unions of Simple Pattern Languages from Positive Examples 1994 2 EUROCOLT Martin & Osherson, A Note on the Use of Probabilities by Mechanical Learners 1994 2 EUROCOLT Schuurmans, Characterizing Rational versus Exponential Learning Curves 1994 2 EUROCOLT Muselli, Is Pocket Algorithm Optimal? 1994 2 EUROCOLT van den Berg & Bioch, Some Theorems Concerning the Free Energy of (Un)constrained Stochastic Hopfield Neural Networks 1994 2 EUROCOLT Ameur, A Space-Bounded Learning Algorithm for Axis-Parallel Rectangles 1994 2 EUROCOLT Simon, Learning Decision Lists and Trees with Equivalence-Queries 1994 2 EUROCOLT Karpinski & Macintyre, Bounding VC-Dimension of Neural Networks: Progress and Prospects 1994 2 EUROCOLT Golea, Average Case Analysis of a Learning Algorithm for mu-DNF Expressions 1994 2 EUROCOLT Shamir & Shwartzman, Learning by Extended Statistical Queries and its Relation to PAC Learning 1994 2 EUROCOLT Koshiba, Typed Pattern Languages and their Learnability 1994 2 EUROCOLT Bergadano & Varricchio, Learning Behaviors of Automata from Shortest Counterexamples 1994 2 EUROCOLT Brazma, Learning of Regular Expressions by Pattern Matching 1994 2 EUROCOLT Domingo & Lavin, The Query Complexity of Learning Some Subclasses of Context-free Grammars 1993 1 EUROCOLT Maass, On the Complexity of Learning on Neural Nets 1993 1 EUROCOLT Frazier & Pitt, Some New Directions in Computational Learning Theory 1993 1 EUROCOLT Valiant, A Neuroidal Model for Cognitive Functions 1993 1 EUROCOLT Kivinen & Mannila & Ukkonen, Learning Rules with Local Exceptions 1993 1 EUROCOLT Golea & marchand, On Learning Simple Deterministic and Probabilistic Neural Concepts 1993 1 EUROCOLT Fischer, Learning Unions of Convex Polygons 1993 1 EUROCOLT Hegedus, On Training Simple Neural Networks and Small-Weight Neurons 1993 1 EUROCOLT Simon, Bounds on the Number of Examples Needed for Learning Functions 1993 1 EUROCOLT Anthony & Shawe-Taylor, Valid Generalisation of Functions from Close Approximations 1993 1 EUROCOLT Kivinen & Warmuth, Using Experts for Predicting Continuous Outcomes 1993 1 EUROCOLT Pillaipakkamnatt & Raghavan, Read-Twice DNF Formulas are Properly Learnable 1993 1 EUROCOLT Ameur & Fischer & Hoffgen & Meyer auf der Heide, Trial and Error: A New Approach to Space-bounded Learning 1993 1 EUROCOLT Anoulova & Polt, Using Kullback-Leibler Divergence in Learning Theory 1993 1 EUROCOLT Saoudi & Yokomori, Learning Local and Recognizable omega-Languages and Monadic Logic Programs 1993 1 EUROCOLT Wiehagen & Smith & Zeugmann, Classification of Predicates and Languages 1993 1 EUROCOLT Wiklicky, The Neural Network Loading Problem is Undecidable 1993 1 EUROCOLT Gavalda, On the Power of Equivalence Queries 1993 1 EUROCOLT Cesa-Bianchi & Freund & Helmbold & Warmuth, On-line Prediction and Conversion Strategies 1993 1 EUROCOLT Yamanishi, Learning Non-parametric Smooth Rules by Stochastic Rules with Finite Partitioning 1993 1 EUROCOLT Polt, Improved Sample Size Bounds for PAB-Decisions 1996 17 EUROCOMB Matheson & Tarjan, Dominating Sets in Planar Graphs 1996 17 EUROCOMB Remila, Tiling with Bars and Satisfaction of Boolean Formulas 1996 17 EUROCOMB Ruskey & Savage, A Gray Code Combinatorics of a Multiset 1996 17 EUROCOMB Bhandari & Garg, A New Lower Bound on the Minimal Length of a Binary Code 1996 17 EUROCOMB Goddard & Katchalski & Kleitman, Forcing Disjoint Segments in the Plane 1996 17 EUROCOMB Singhi & Shriniwas & Antony, Combinatorial Techniques and Objects in Computer Science: Fault-tolerance and Other Interesting Applications 1996 17 EUROCOMB Bandelt & Chepoi, Cellular Bipartite Graphs 1996 17 EUROCOMB Imrich & Klavzar, On the Complexity of Recognizing Hamming Graphs and Related Classes of Graphs 1996 17 EUROCOMB Karzanov & Manoussakis, Minimum (2,r)-Metrics and Integer Multiflows 1996 17 EUROCOMB Laurent & Poljak, Gap Inequalities for the Cut Polytope 1996 17 EUROCOMB Deza & Shpectorov, Recognition of the l_1-Graphs with Complexity O(nm), or Football in a Hypercube 1996 17 EUROCOMB Wild, Consequences of the Brylawski-Lucas Theorem for Binary Matroids 1995 16 EUROCOMB Currie, On the Structure and Extendibility of k-Power Free Words 1995 16 EUROCOMB Da Silva, Axioms for Maximal Vectors of an Oriented Matroid: a Combinatorial Characterization of the Regions Determined by an Arrangement of Pseudohyperplanes 1994 15 EUROCOMB Chen & Ni, Heap-ordered Trees, 2-Partitions and Continued Fractions 1994 15 EUROCOMB Mundform, A Problem in Permutations: The Game of `Mousetrap' 1994 15 EUROCOMB Czyzowicz & Lakshmanan & Pelc, Searching with Local Constraints on Error Patterns 1993 14 EUROCOMB Delorme & Poljak, Combinatorial Properties and the Complexity of a Max-cut Approximation 1993 14 EUROCOMB Katona & Seress, Greedy Construction of Nearly Regular Graphs 1993 14 EUROCOMB Kleitman & Schulman, Minimally Distant Sets of Lattice Points 1993 14 EUROCOMB Tverberg & Vrecica, On Generalizations of Radon's Theorem and the Ham Sandwich Theorem 1993 14 EUROCOMB Chartrand & Goddard & Henning & Saba & Swart, Principal Common Divisors of Graphs 1993 14 EUROCOMB Cori & Sopena, Some Combinatorial Aspects of Time-stamp Systems 1993 14 EUROCOMB Shpectorov, On Scale Embeddings of Graphs into Hypercubes 1993 14 EUROCOMB Wang & Sauer, Packing Three Copies of a Tree into a Complete Graph 1992 13 EUROCOMB Goulden & Jackson, The Combinatorial Relationship Between Trees, Cacti and Certain Connection Coefficients for the Symmetric Group 1992 13 EUROCOMB Babai & Seress, On the Diameter of Permutation Groups 1991 12 EUROCOMB Bjorner & Lovasz & Shor, Chip-firing Games on Graphs 1991 12 EUROCOMB Grable, Two Packing Problems on k-Matroid Trees 1991 12 EUROCOMB Smith, Finite Codes and Groupoid Words 1991 12 EUROCOMB Babai & Goodman & Lovasz, Graphs with Given Automorphism Group and Few Edge Orbits 1991 12 EUROCOMB Delorme & Sole, Diameter, Covering Index, Covering Radius and Eigenvalue 1989 10 EUROCOMB Moszkowski, A Solution to a Problem of Denes: A Bijection Between Trees and Factorizations of Cyclic Permutations 1989 10 EUROCOMB Linial & Tarsi, Interpolation Between Bases and the Shuffle Exchange Network 1988 9 EUROCOMB Thomason, A Graph Property not Satisfying a `Zero-One Law' 1988 9 EUROCOMB Korner & Marton, New Bounds for Perfect Hashing via Information Theory 1986 7 EUROCOMB Frankl & Maehara, Embedding the n-Cube in Lower Dimensions 1996 14 EUROCRYPT Coppersmith & Franklin & Patarin & Reiter, Low-Exponent RSA with Related Messages 1996 14 EUROCRYPT Bleichenbacher, Generating ElGamal Signatures without Knowing the Secret Key 1996 14 EUROCRYPT Preneel & van Oorschot, On the Security of Two MAC Algorithms 1996 14 EUROCRYPT Patarin, Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms 1996 14 EUROCRYPT Meyer & Muller, A Public Key Cryptosystem Based on Elliptic Curves over Z/nZ Equivalent to Factoring 1996 14 EUROCRYPT Schwenk & Eisfeld, Public Key Encryption and Signature Schemes Based on Polynomials over Z_n 1996 14 EUROCRYPT Cramer & Franklin & Schoenmakers & Yung, Multi-authority Secret-Ballot Elections with Linear Work 1996 14 EUROCRYPT Pfitzmann & Schunter, Asymmetric Fingerprinting 1996 14 EUROCRYPT Burmester, Homomorphisms of Secret Sharing Schemes: A Tool for Verifiable Signature Sharing 1996 14 EUROCRYPT Blackburn & Burmester & Desmedt & Wild, Efficient Multiplicative Sharing Schemes 1996 14 EUROCRYPT Beaver, Equivocable Oblivious Transfer 1996 14 EUROCRYPT Boyar & Peralta, Short Discreet Proofs 1996 14 EUROCRYPT Jakobsson & Sako & Impagliazzo, Designated Verifier Proofs and their Applications 1996 14 EUROCRYPT Coppersmith, Finding a Small Root of a Univariate Modular Equation 1996 14 EUROCRYPT Hong & Oh & Yoon, New Modular Multiplication Algorithms for Fast Modular Exponientation 1996 14 EUROCRYPT Coppersmith, Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known 1996 14 EUROCRYPT Stadler, Publicly Verifiable Secret Sharing 1996 14 EUROCRYPT Ogata & Kurosawa, Optimum Secret Sharing Scheme Secure against Cheating 1996 14 EUROCRYPT Gibson, The Security of the Gabidulin Public Key Cryptosystem 1996 14 EUROCRYPT Knudsen & Robshaw, Non-linear Approximations in Linear Cryptanalysis 1996 14 EUROCRYPT Knudsen & Pedersen, On the Difficulty of Software Key Escrow 1996 14 EUROCRYPT Fischer & Stern, An Efficient Pseudo-random Generator Provably as Secure as Syndrome Decoding 1996 14 EUROCRYPT Klapper, On the Existence of Secure Feedback Registers 1996 14 EUROCRYPT Golic, Fast Low Order Approximation of Cryptographic Functions 1996 14 EUROCRYPT Camion & Canteaut, Construction of t-resilient Functions over a Finite Alphabet 1996 14 EUROCRYPT Zhang & Zheng, Auto-correlations and New Bounds on the Nonlinearity of Boolean Functions 1996 14 EUROCRYPT Aiello & Venkatesan, Foiling Birthday Attacks in Length-Doubling Transformations 1996 14 EUROCRYPT Shoup & Rubin, Session Key Distribution Using Smart Cards 1996 14 EUROCRYPT van Oorschot & Wiener, On Diffie-Hellman Key Agreement with Short Exponents 1996 14 EUROCRYPT Shoup, On the Security of a Practical Identification Scheme 1996 14 EUROCRYPT Gennaro & Jarecki & Krawczyk & Rabin, Robust Threshold DSS Signatures 1996 14 EUROCRYPT Damgard & Pedersen, New Convertible Undeniable Signature Schemes 1996 14 EUROCRYPT Pointcheval & Stern, Security Proofs for Signature Schemes 1996 14 EUROCRYPT Bellare & Rogaway, The Exact Security of Digital Signatures -- How to Sign with RSA and Rabin 1995 13 EUROCRYPT Schnorr & Horner, Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction 1995 13 EUROCRYPT O'Connor, Convergence in Differential Distributions 1995 13 EUROCRYPT Harpes & Kramer & Massey, A Generalization of Linear Cryptanalysis and the Applicability of Matsui's Piling-Up Lemma 1995 13 EUROCRYPT Chen & Pedersen, On the Efficiency of Group Signatures Providing Information-Theoretic Anonymity 1995 13 EUROCRYPT Franklin & Reiter, Verifiable Signature Sharing 1995 13 EUROCRYPT Lim & Lee, Server (Prover/Signer)-aided Verification of Identity Proofs and Signatures 1995 13 EUROCRYPT Lercier & Morain, Counting the Number of Points on Elliptic Curves over Finite Fields: Strategies and Performances 1995 13 EUROCRYPT Weber, An Implementation of the General Number Field Sieve to Compute Discrete Logarithms mod p 1995 13 EUROCRYPT Montgomery, A Block Lanczos Algorithm for Finding Dependencies over GF(2) 1995 13 EUROCRYPT Pfitzmann & Schunter & Waidner, How to Break another ``Provably Secure'' Payment System 1995 13 EUROCRYPT Crepeau & Salvail, Quantum Oblivious Mutual Identification 1995 13 EUROCRYPT Desmedt, Securing Traceability of Ciphertexts -- Towards a Secure Software Key Escrow System 1995 13 EUROCRYPT Gehrmann, Secure Multiround Authentication Protocols 1995 13 EUROCRYPT Gennaro & Micali, Verifiable Secret Sharing as Secure Computation 1995 13 EUROCRYPT Jackson & Martin & O'Keefe, Efficient Secret Sharing without a Mutually Trusted Authority 1995 13 EUROCRYPT Beguin & Cresti, General Short Computational Secret Sharing Schemes 1995 13 EUROCRYPT Stadler & Piveteau & Camenisch, Fair Blind Signatures 1995 13 EUROCRYPT Jakobsson, Ripping Coins for a Fair Exchange 1995 13 EUROCRYPT Brands, Restrictive Blinding of Secret-Key Certificates 1995 13 EUROCRYPT Golic, Towards Fast Correlation Attacks on Irregularly Clocked Shift Registers 1995 13 EUROCRYPT Klapper & Goresky, Large Periods Nearly de Bruijn FCSR Sequences 1995 13 EUROCRYPT Zhang & Zheng, On Nonlinear Resilient Functions 1995 13 EUROCRYPT Kurosawa & Obana, Combinatorial Bounds for Authentication Codes with Arbitration 1995 13 EUROCRYPT Krawczyk, New Hash Functions for Message Authentication 1995 13 EUROCRYPT Bierbrauer, A^2-Codes from Universal Hash Classes 1995 13 EUROCRYPT Pointcheval, A New Identification Scheme Based on the Perceptrons Problem 1995 13 EUROCRYPT Koyama, Fast RSA-type Schemes Based on Singular Cubic Curves 1995 13 EUROCRYPT Sakurai & Shizuya, Relationships among the Computational Powers of Breaking Discrete log Cryptosystems 1995 13 EUROCRYPT Naslund, Universal Hash Functions & Hard Core Bits 1995 13 EUROCRYPT Di Crescenzo, Recycling Random Bits in Composed Perfect Zero-Knowledge 1995 13 EUROCRYPT Wang & Hwang & Tsai, On the Matsumoto and Imai's Human Identification Scheme 1995 13 EUROCRYPT Sako & Kilian, Receipt-free Mix-type Voting Scheme -- A Practical Solution to the Implementation of a Voting Booth 1995 13 EUROCRYPT Naccache & M'raihi & Wolfowicz & di Porto, Are Crypto-Accelerators Really Inevitable? 20 Bit Zero-Knowledge in Less than a Second on Simple 8-Bit Microcontrollers 1995 13 EUROCRYPT Amiano & Di Crescenzo, Anonymous NIZK Proofs of Knowledge with Preprocessing 1994 12 EUROCRYPT Naor & Shamir, Visual Cryptography 1994 12 EUROCRYPT Csirmaz, The Size of a Share Must be Large 1994 12 EUROCRYPT van Dijk, A Linear Construction of Perfect Secret Sharing Schemes 1994 12 EUROCRYPT Blundo & Gaggia & Stinson, On the Dealer's Randomness Required in Secret Sharing Schemes 1994 12 EUROCRYPT Schnorr & Vaudenay, Black Box Cryptanalysis of Hash Networks Based on Multipermutations 1994 12 EUROCRYPT Joux & Granboulan, A Practical Attack against Knapsack Based Hash Functions 1994 12 EUROCRYPT Franklin & Yung, The Blinding of Weak Signatures 1994 12 EUROCRYPT Naccache & Raihi & Vaudenay & Raphaeli, Can D. S. A. be Improved? Complexity Trade-offs with the Digital Signature Standard 1994 12 EUROCRYPT Chaum, Designated Confirmer Signatures 1994 12 EUROCRYPT Bellare & Rogaway, Optimal Asymmetric Encryption 1994 12 EUROCRYPT Orton, A Multiple-Iterated Trapdoor for Dense Compact Knapsacks 1994 12 EUROCRYPT Chabaud, On the Security of some Cryptosystems Based on Error-Correcting Codes 1994 12 EUROCRYPT Chen & Damgard & Pedersen, Parallel Divertibility of Proofs of Knowledge 1994 12 EUROCRYPT D'Amiano & Di Crescenzo, Methodology for Digital Money Based on General Cryptographic Tools 1994 12 EUROCRYPT Chen & Pedersen, New Group Signature Schemes 1994 12 EUROCRYPT Nyberg & Rueppel, Message Recovery for Signature Schemes Based on the Discrete Logarithm Problem 1994 12 EUROCRYPT Li & Hwang & Lee, Threshold-Multisignature Schemes Where Suspected Forgery Implies Traceability of Adversarial Shareholders 1994 12 EUROCRYPT Meier & Staffelbach, The Self-Shrinking Generator 1994 12 EUROCRYPT Goresky & Klapper, Feedback Registers Based on Ramified Extensions of the 2-adic Numbers 1994 12 EUROCRYPT Gottfert & Niederreiter, A General Lower Bound for the Linear Complexity of the Product of Shift-Register Sequences 1994 12 EUROCRYPT Golic & O'Connor, Embedding and Probabilistic Correlation Attacks on Clock-Controlled Shift Registers 1994 12 EUROCRYPT Taylor, Near Optimal Unconditionally Secure Authentication 1994 12 EUROCRYPT Safavi-Naini & Tombak, Authentication Codes in Plaintext and Chosen-Content Attacks 1994 12 EUROCRYPT Cachin & Maurer, Linking Information Reconciliation and Privacy Amplification 1994 12 EUROCRYPT Burmester & Desmedt, A Secure and Efficient Conference Key Distribution System 1994 12 EUROCRYPT Blundo & Cresti, Space Requirements for Broadcast Encryption 1994 12 EUROCRYPT Zheng, How to Break and Repair Leighton and Micali's Key Agreement Protocol 1994 12 EUROCRYPT Eng & Okamoto, Single-Term Divisible Electronic Coins 1994 12 EUROCRYPT Syverson & Meadows, Formal Requirements for Key Distribution Protocols 1994 12 EUROCRYPT Pfitzmann, Breaking an Efficient Anonymous Channel 1994 12 EUROCRYPT Biham, On Matsui's Linear Cryptanalysis 1994 12 EUROCRYPT Chabaud & Vaudenay, Links between Differential and Linear Cryptanalysis 1994 12 EUROCRYPT Matsui, On Correlation between the Order of S-boxes and the Strength of DES 1994 12 EUROCRYPT Seberry & Zhang & Zheng, Relationships among Nonlinearity Criteria 1994 12 EUROCRYPT de Rooij, Efficient Exponentiation Using Precomputation and Vector Addition Chains 1994 12 EUROCRYPT Damm & Heider & Wambach, MIMD-Factorisation on Hypercubes 1994 12 EUROCRYPT Knudsen & Lai, New Attacks on all Double Block Length Hash Functions of Hash Rate 1, Including the Parallel-DM 1994 12 EUROCRYPT Knudsen, New Potentially `Weak' Keys for DES and LOKI 1994 12 EUROCRYPT Jakobsson, Blackmailing Using Undeniable Signatures 1994 12 EUROCRYPT Camenisch & Piveteau & Stadler, Blind Signatures Based on the Discrete Logarithm Problem 1994 12 EUROCRYPT Charnes & O'Connor & Pieprzyk & Safavi-Naini & Zheng, Comments on Soviet Encryption Algorithm 1994 12 EUROCRYPT Nyberg, Linear Approximation of Block Ciphers 1994 12 EUROCRYPT Shamir, Memory Efficient Variants of Public-Key Schemes for Smart Card Applications 1994 12 EUROCRYPT Menicocci, A Systematic Attack on Clock Controlled Cascades 1994 12 EUROCRYPT Johansson & Smeets, On A^2-codes Including Arbiter's Attacks 1994 12 EUROCRYPT Biham & Biryukov, An Improvement of Davies' Attack on DES 1994 12 EUROCRYPT Hruby, Q-Deformed Quantum Cryptography 1993 11 EUROCRYPT Johansson & Kabatianskii & Smeets, On the Relation between A-codes and Codes Correcting Independent Errors 1993 11 EUROCRYPT Safavi-Naini & Tombak, Optimal Authentication Systems 1993 11 EUROCRYPT Dixon & Lenstra, Factoring Integers Using SIMD Sieves 1993 11 EUROCRYPT Demytko, A New Elliptic Curve Based Analogue of RSA 1993 11 EUROCRYPT Blackburn & Murphy & Stern, Weaknesses of a Public-Key Cryptosystem Based on Factorizations of Finite Groups 1993 11 EUROCRYPT Nyberg, Differentially Uniform Mappings for Cryptography 1993 11 EUROCRYPT Beth & Ding, On Almost Perfect Nonlinear Permutations 1993 11 EUROCRYPT Carlet, Two New Classes of Bent Functions 1993 11 EUROCRYPT Cusick, Boolean Functions Satisfying a Higher Order Strict Avalanche Criterion 1993 11 EUROCRYPT Carpentieri & De Santis & Vaccaro, Size of Shares and Probability of Cheating in Threshold Schemes 1993 11 EUROCRYPT Kurosawa & Okada & Sakano & Ogata & Tsujii, Nonperfect Secret Sharing Schemes and Matroids 1993 11 EUROCRYPT Selmer, From the Memoirs of a Norwegian Cryptologist 1993 11 EUROCRYPT Gottfert & Niederreiter, On the Linear Complexity of Products of Shift-register Sequences 1993 11 EUROCRYPT Daemen & Govaerts & Vandewalle, Resynchronization Weaknesses in Synchronous Stream Ciphers 1993 11 EUROCRYPT Games & Rushanan, Blind Synchronization of m-sequences with Even Span 1993 11 EUROCRYPT Seberry & Zhang & Zheng, On Constructions and Nonlinearity of Correlation Immune Functions 1993 11 EUROCRYPT Damgard, Practical and Provably Secure Release of a Secret and Exchange of Signatures 1993 11 EUROCRYPT Simmons, Subliminal Communication is Easy Using the DSA 1993 11 EUROCRYPT Naccache, Can O. S. S. be Repaired? --Proposal for a New Practical Signature Scheme-- 1993 11 EUROCRYPT Boyd & Mao, On a Limitation of BAN Logic 1993 11 EUROCRYPT Park & Itoh & Kurosawa, Efficient Anonymous Channel and All/Nothing Election Scheme 1993 11 EUROCRYPT Domingo-Ferrer, Untransferable Rights in a Client-independent Server Environment 1993 11 EUROCRYPT Ostrovsky & Venkatesan & Yung, Interactive Hashing Simplifies Zero-Knowledge Protocol Design 1993 11 EUROCRYPT Benaloh & de Mare, One-way Accumulators: A Decentralized Alternative to Digital Signatures 1993 11 EUROCRYPT Damgard & Knudsen, The Breaking of the AR Hash Function 1993 11 EUROCRYPT den Boer & Bosselaers, Collisions for the Compression Function of MD5 1993 11 EUROCRYPT Patarin, How to Find and Avoid Collisions for the Knapsack Hash Function 1993 11 EUROCRYPT Ferguson, Single Term Off-line Coins 1993 11 EUROCRYPT Cramer & Pedersen, Improved Privacy in Wallets with Observers 1993 11 EUROCRYPT Brands & Chaum, Distance-Bounding Protocols 1993 11 EUROCRYPT O'Connor, On the Distribution of Characteristics in Bijective Mappings 1993 11 EUROCRYPT Meier, On the Security of the IDEA Block Cipher 1993 11 EUROCRYPT Matsui, Linear Cryptanalysis Method for DES Cipher 1993 11 EUROCRYPT Biham, New Types of Cryptanalytic Attacks Using Related Keys 1993 11 EUROCRYPT Brassard & Salvail, Secret Key Reconciliation by Public Discussion 1993 11 EUROCRYPT Beaver & So, Global, Unpredictable Bit Generation without Broadcast 1993 11 EUROCRYPT de Rooij, On Schnorr's Preprocessing for Digital Signature Schemes 1993 11 EUROCRYPT Burmester, Cryptanalysis of the Chang-Wu-Chen Key Distribution System 1993 11 EUROCRYPT van Oorschot, An Alternate Explanation of Two BAN-Logic ``Failures'' 1993 11 EUROCRYPT Simmons, The Consequences of Trust in Shared Secret Schemes 1993 11 EUROCRYPT Hornauer & Stephan & Wernsdorf, Markov Ciphers and Alternating Groups 1993 11 EUROCRYPT Park & Kurosawa & Okamoto & Tsujii, On Key Distribution and Authentication in Mobile Radio Networks 1992 10 EUROCRYPT Blundo & De Santis & Stinson & Vaccaro, Graph Decompositions and Secret Sharing Schemes 1992 10 EUROCRYPT Frankel & Desmedt, Classification of Ideal Homomorphic Threshold Schemes over Finite Abelian Groups 1992 10 EUROCRYPT Baritaud & Gilbert & Girault, FFT Hashing is not Collision-free 1992 10 EUROCRYPT Schnorr, FFT-Hash II, Efficient Cryptographic Hashing 1992 10 EUROCRYPT Lai & Massey, Hash Functions Based on Block Ciphers 1992 10 EUROCRYPT Berson, Differential Cryptanalysis mod 2^32 with Applications to MD5 1992 10 EUROCRYPT Matsui & Yamagishi, A New Method for Known Plaintext Attack of FEAL Cipher 1992 10 EUROCRYPT Nyberg, On the Construction of Highly Nonlinear Permutations 1992 10 EUROCRYPT Wernsdorf, The One-Round Functions of the DES Generate the Alternating Group 1992 10 EUROCRYPT Golic, Correlation via Linear Sequential Circuit Approximation of Combiners 1992 10 EUROCRYPT Mihaljevic & Golic, Convergence of a Bayesian Iterative Error-Correction Procedure on a Noisy Shift Register Sequence 1992 10 EUROCRYPT O'Connor & Snider, Suffix Trees and String Complexity 1992 10 EUROCRYPT Pfitzmann & Waidner, Attacks on Protocols for Server-aided RSA Computation 1992 10 EUROCRYPT Harper & Menezes & Vanstone, Public-Key Cryptosystems with Very Small Key Lengths 1992 10 EUROCRYPT Sauerbrey & Dietel, Resource Requirements for the Application of Addition Chains in Modulo Exponentiation 1992 10 EUROCRYPT Dixon & Lenstra, Massively Parallel Elliptic Curve Factoring 1992 10 EUROCRYPT panel, Trapdoor Primes and Moduli 1992 10 EUROCRYPT Brickell & Gordon & McCurley & Wilson, Fast Exponentiation with Precomputation 1992 10 EUROCRYPT Beller & Yacobi, Batch Diffie-Hellman Key Agreement Systems and their Application to Portable Communications 1992 10 EUROCRYPT Iwamura & Matsumoto & Imai, High-Speed Implementation Methods for RSA Scheme 1992 10 EUROCRYPT Maurer, A Simplified and Generalized Treatment of Luby-Rackoff Pseudorandom Permutation Generators 1992 10 EUROCRYPT Patarin, How to Construct Pseudorandom and Super Pseudorandom Permutations from One Single Pseudorandom Function 1992 10 EUROCRYPT Sadeghiyan & Pieprzyk, A Construction for Super Pseudorandom Permutations from a Single Pseudorandom Function 1992 10 EUROCRYPT Beaver, How to Break a ``Secure'' Oblivious Transfer Protocol 1992 10 EUROCRYPT Barbaroux, Uniform Results in Polynomial-Time Security 1992 10 EUROCRYPT Beaver & Haber, Cryptographic Protocols Provably Secure against Dynamic Adversaries 1992 10 EUROCRYPT Ohta & Okamoto & Fujioka, Secure Bit Commitment Function against Divertibility 1992 10 EUROCRYPT Damgard, Non-Interactive Circuit Based Proofs and Non-interactive Perfect Zero-Knowledge with Preprocessing 1992 10 EUROCRYPT Biehl & Buchmann & Meyer & Thiel & Thiel, Tools for Proving Zero Knowledge 1992 10 EUROCRYPT van Heyst & Pedersen, How to Make Efficient Fail-Stop Signatures 1992 10 EUROCRYPT Evertse & van Heyst, Which New RSA Signatures Can Be Computed from RSA Signatures, Obtained in a Specific Interactive Protocol? 1992 10 EUROCRYPT Chaum & Pedersen, Transferred Cash Grows in Size 1992 10 EUROCRYPT Niederreiter & Schnorr, Local Randomness in Candidate One-way Functions 1992 10 EUROCRYPT Okamoto & Sakurai & Shizuya, How Intractable is the Discrete Logarithm for a General Finite Group 1992 10 EUROCRYPT Maurer, Factoring with an Oracle 1992 10 EUROCRYPT Heiman, Secure Audio Teleconferencing: A Practical Solution 1992 10 EUROCRYPT Koyama, Secure Conference Key Distribution Schemes for Conspiracy Attacks 1992 10 EUROCRYPT Heiman, A Note on Discrete Logarithms with Special Structure 1992 10 EUROCRYPT Maurer & Yacobi, A Remark on a Non-interactive Public-Key Distribution System 1992 10 EUROCRYPT Chen & Damgard, Security Bounds for Parallel Versions of Identification Protocols 1992 10 EUROCRYPT Sgarro, Information-theoretic Bounds for Authentication Frauds 1992 10 EUROCRYPT Golic & Petrovic, A Generalized Correlation Attack with a Probabilistic Constrained Edit Distance 1992 10 EUROCRYPT Iwamura & Matsumoto & Imai, Systolic Arrays for Modular Exponentiation Using Montgomery Method 1992 10 EUROCRYPT Agnew & Mullin & Vanstone, On the Development of a Fast Elliptic Curve Cryptosystem 1992 10 EUROCRYPT Naccache, A Montgomery-suitable Fiat-Shamir-like Authentication Scheme 1991 9 EUROCRYPT Biham & Shamir, Differential Cryptanalysis of Feal and N-Hash 1991 9 EUROCRYPT Lai & Massey & Murphy, Markov Ciphers and Differential Cryptanalysis 1991 9 EUROCRYPT Camion & Patarin, The Knapsack Hash Function Proposed at Crypto '89 Can be Broken 1991 9 EUROCRYPT Coster & LaMacchia & Odlyzko & Schnorr, An Improved Low-Density Subset Sum Algorithm 1991 9 EUROCRYPT Korzhik & Turkin, Cryptanalysis of McEliece's Public-Key Cryptosystem 1991 9 EUROCRYPT de Rooij, On the Security of the Schnorr Scheme Using Preprocessing 1991 9 EUROCRYPT Burmester & Desmedt, Broadcast Interactive Proofs 1991 9 EUROCRYPT Okamoto & Chaum & Ohta, Direct Zero Knowledge Proofs of Computational Power in Five Rounds 1991 9 EUROCRYPT Crepeau & Santha, On the Reversibility of Oblivious Transfer 1991 9 EUROCRYPT Mund, Ziv-Lempel Complexity for Periodic Sequences and its Cryptographic Application 1991 9 EUROCRYPT Habutsu & Nishio & Sasase & Mori, A Secret Key Cryptosystem by Iterating a Chaotic Map 1991 9 EUROCRYPT Preneel & Govaerts & Vandewalle, Boolean Functions Satisfying Higher Order Propagation Criteria 1991 9 EUROCRYPT Jansen, The Maximum Order Complexity of Sequence Ensembles 1991 9 EUROCRYPT Golic, The Number of Output Sequences of a Binary Sequence Generator 1991 9 EUROCRYPT Dai & Yang, Linear Complexity of Periodically Repeated Random Sequences 1991 9 EUROCRYPT Chepyzhov & Smeets, On a Fast Correlation Attack on Certain Stream Ciphers 1991 9 EUROCRYPT Meier & Staffelbach, Analysis of Pseudo Random Sequences Generated by Cellular Automata 1991 9 EUROCRYPT Chambers & Dai, On Binary Sequences from Recursions ``modulo 2^e'' Made Non-Linear by the Bit-by-Bit ``XOR'' Function 1991 9 EUROCRYPT Desmedt & Yung, Weaknesses of Undeniable Signature Schemes 1991 9 EUROCRYPT Pedersen, Distributed Provers with Applications to Undeniable Signatures 1991 9 EUROCRYPT Fujioka & Okamoto & Ohta, Interactive Bi-Proof Systems and Undeniable Signature Schemes 1991 9 EUROCRYPT Chaum & van Heyst, Group Signatures 1991 9 EUROCRYPT Boyd, Enhancing Secrecy by Data Compression: Theoretical and Practical Aspects 1991 9 EUROCRYPT Schnorr, Factoring Integers and Computing Discrete Logarithms via Diophantine Approximation 1991 9 EUROCRYPT Huber, Some Considerations Concerning the Selection of RSA Moduli 1991 9 EUROCRYPT Portz, On the Use of Interconnection Networks in Cryptography 1991 9 EUROCRYPT Beth & Schaefer, Non Supersingular Elliptic Curves for Public Key Cryptosystems 1991 9 EUROCRYPT Morain, Building Cyclic Elliptic Curves Modulo Large Primes 1991 9 EUROCRYPT Shizuya & Itoh & Sakurai, On the Complexity of Hyperelliptic Discrete Logarithm Problem 1991 9 EUROCRYPT Dawson & Tavares, An Expanded Set of S-Box Design Criteria Based on Information Theory and its Relation to Differential-Like Attacks 1991 9 EUROCRYPT O'Connor, Enumerating Nondegenerate Permutations 1991 9 EUROCRYPT Nyberg, Perfect Nonlinear S-Boxes 1991 9 EUROCRYPT Rueppel, A Formal Approach to Security Architectures 1991 9 EUROCRYPT Horster & Knobloch, Discrete Logarithm Based Protocols 1991 9 EUROCRYPT Matsumoto & Imai, Human Identification Through Insecure Channel 1991 9 EUROCRYPT Goldburg & Dawson & Sridharan, The Automated Cryptanalysis of Analog Speech Scramblers 1991 9 EUROCRYPT Sadeghiyan & Pieprzyk, A Construction for One Way Hash Functions and Pseudorandom Bit Generators 1991 9 EUROCRYPT Fujioka & Okamoto & Miyaguchi, ESIGN: An Efficient Digital Signature Implementation for Smart Cards 1991 9 EUROCRYPT Maurer, New Approaches to the Design of Self-Synchronizing Stream Ciphers 1991 9 EUROCRYPT Pieprzyk & Safavi-Naini, Randomized Authentication Systems 1991 9 EUROCRYPT Gabidulin & Paramonov & Tretjakov, Ideals over a Non-Commutative Ring and Their Application in Cryptology 1991 9 EUROCRYPT Girault, Self-Certified Public Keys 1991 9 EUROCRYPT Maurer & Yacobi, Non-Interactive Public-Key Cryptography 1991 9 EUROCRYPT Zemor, Hash Functions anbd Graphs with Large Girths 1991 9 EUROCRYPT Muller & Oswald, Dickson Pseudoprimes and Primality Testing 1991 9 EUROCRYPT Gibson, Equivalent Goppa Codes and Trapdoors to McEliece's Public Key Cryptosystem 1991 9 EUROCRYPT Pedersen, A Threshold Cryptosystem Without a Trusted Party 1991 9 EUROCRYPT Mihaljevic & Golic, A comparison of Cryptanalytic Principles Based on Iterative Error-Correction 1991 9 EUROCRYPT Biham, Cryptanalysis of the Chaotic-Map Cryptosystem Suggested at EUROCRYPT '91 1991 9 EUROCRYPT Berkovits, How to Broadcast a Secret 1991 9 EUROCRYPT Pieprzyk, Probabilistic Analysis of Elementary Randomizers 1991 9 EUROCRYPT Preneel & Chaum & Fumy & Jansen & Landrock & Roelofsen, Race Integrity Primitives Evaluation (RIPE): A Status Report 1991 9 EUROCRYPT Brynielsson, The Information Leakage Through a Randomly Generated Function 1991 9 EUROCRYPT Chaum, Some Weaknesses of ``Weaknesses of Undeniable Signatures'' 1990 8 EUROCRYPT Burmester & Desmedt, All Languages in NP Have Divertible Zero-Knowledge Proofs and Arguments under Cryptographic Assumptions 1990 8 EUROCRYPT Davida & Desmedt & Peralta, On the Importance of Memory Resources in the Security of Key Exchange Protocols 1990 8 EUROCRYPT Shinozaki & Itoh & Fujioka & Tsujii, Provably Secure Key-Updating Schemes in Identity-based Systems 1990 8 EUROCRYPT den Boer, Oblivious Transfer Protecting Secrecy 1990 8 EUROCRYPT De Santis & Persiano, Public-Randomness in Public-Key Cryptography 1990 8 EUROCRYPT Brickell & McCurley, An Interactive Identification Scheme based on Discrete Logarithms and Factoring 1990 8 EUROCRYPT Lenstra & Manasse, Factoring with Two Large Primes 1990 8 EUROCRYPT Evertse & van Heyst, Which New RSA Signatures can be Computed from some Given RSA Signatures? 1990 8 EUROCRYPT Scheidler & Buchman & Williams, Implementation of a Key Exchange Protocol Using Real Quadratic Fields 1990 8 EUROCRYPT Morain, Distributed Primality Proving and the Primality of (2^3539 + 1)/3 1990 8 EUROCRYPT Lloyd, Properties of Binary Functions 1990 8 EUROCRYPT Pieprzyk, How to Construct Pseudorandom Permutations from Single Pseudorandom Functions 1990 8 EUROCRYPT Nyberg, Constructions of Bent Functions and Difference Sets 1990 8 EUROCRYPT Preneel & Van Leekwijk & Van Linden & Govaerts & Vandewalle, Propagation Characteristics of Boolean Functions 1990 8 EUROCRYPT Niederreiter, The Linear Complexity Profile and the Jump Complexity of Keystream Sequences 1990 8 EUROCRYPT Dai & Beth & Gollmann, Lower Bounds for the Linear Complexity of Sequences over Residue Rings 1990 8 EUROCRYPT Jansen, On the Construction of Run Permuted Sequences 1990 8 EUROCRYPT Meier & Staffelbach, Correlation Properties of Combiners with Memory in Stream Ciphers 1990 8 EUROCRYPT Chan & Goresky & Klapper, Correlation Functions of Geometric Sequences 1990 8 EUROCRYPT Yacobi, Exponentiating Faster with Addition Chains 1990 8 EUROCRYPT Dusse & Kaliski, A Cryptographic Library for the Motorola DSP 56000 1990 8 EUROCRYPT Orup & Svendsen & Andreasen, VICTOR -- An Efficient RSA Hardware Implementation 1990 8 EUROCRYPT Bennett & Bessette & Brassard & Savail & Smolin, Experimental Quantum Cryptography 1990 8 EUROCRYPT Ingemarsson & Simmons, A Protocol to Set Up Shared Secret Schemes without the Assistance of a Mutually Trusted Party 1990 8 EUROCRYPT Sgarro, Lower Bounds for Authentication Codes with Splitting 1990 8 EUROCRYPT Beutelspacher & Rosenbaum, Essentially l-fold Secure Authentication Systems 1990 8 EUROCRYPT Smeets & Vanrose & Wan, On the Construction of Authentication Codes with Secrecy and Codes Withstanding Spoofing Attacks of Order L >= 2 1990 8 EUROCRYPT Stern & Toffin, Cryptanalysis of a Public-Key Cryptosystem based on Approximations by Rational Numbers 1990 8 EUROCRYPT van Oorschot & Wiener, A Known-Plaintext Attack on Two-Key Triple Encryption 1990 8 EUROCRYPT Miyaguchi & Ohta & Iwata, Confirmation that Some Hash Functions are not Collision Free 1990 8 EUROCRYPT Bauspiess & Knobloch & Wichmann, Inverting the Pseudo Exponentiation 1990 8 EUROCRYPT Hwang, Cryptosystem for Group Oriented Cryptography 1990 8 EUROCRYPT Maurer, A Provably-Secure Strongly-Randomized Cipher 1990 8 EUROCRYPT Kruosawa & Katayama & Ogata & Tsujii, General Public Key Residue Cryptosystems and Mental Poker Protocols 1990 8 EUROCRYPT Lai & Massey, A Proposal for a New Block Encryption Standard 1990 8 EUROCRYPT Niemi, A New Trapdoor in Knapsacks 1990 8 EUROCRYPT De Santis & Yung, On the Design of Provably Secure Cryptographic Hash Functions 1990 8 EUROCRYPT Ong & Schnorr, Fast Signature Generation with a Fiat Shamir-like Scheme 1990 8 EUROCRYPT Gleumer & Pfitzmann & Waidner, A Remark on a Signature Scheme where Forgery can be Proved 1990 8 EUROCRYPT Ohta & Okamoto & Koyama, Membership Authentication for Hierarchical Multigroups Using the Extended Fiat-Shamir Scheme 1990 8 EUROCRYPT Chaum, Zero-Knowledge Undeniable Signatures 1990 8 EUROCRYPT Guillou & Quisquater & Walker & Landrock & Shaer, Precautions Taken against Various Potential Attacks in ISO/IEC 9796 1990 8 EUROCRYPT Domingo-Ferrer, Software Run-Time Protection: A Cryptographic Issue 1990 8 EUROCRYPT Girault, An Identity-based Identification Scheme based on Discrete Logarithms Modulo a Composite Number 1990 8 EUROCRYPT Golic & Mihaljevic, A Noisy Clock-Controlled Shift Register Cryptanalysis Concept based on Sequence Comparison Approach 1990 8 EUROCRYPT Kaliski, The MD4 Message Digest Algorithm 1990 8 EUROCRYPT Burmester, A Remark on the Efficiency of Identification Schemes 1990 8 EUROCRYPT Meister, On an Implementation of the Mohan-Adiga Algorithm 1989 7 EUROCRYPT Galil & Haber & Yung, A Secure Public-Key Authentication Scheme 1989 7 EUROCRYPT Brassard, How to Improve Signature Schemes 1989 7 EUROCRYPT Jaburek, A Generalization of El Gamal's Public-Key Cryptosystem 1989 7 EUROCRYPT Gunther, An Identity-based Key-Exchange Protocol 1989 7 EUROCRYPT Bauspiess & Knobloch, How to Keep Authenticity Alive in a Computer Network 1989 7 EUROCRYPT Isselhorst, The Use of Fractions in Public-Key Cryptosystems 1989 7 EUROCRYPT Frankel, A Practical Protocol for Large Group Oriented Networks 1989 7 EUROCRYPT Lloyd, Counting Functions Satisfying a Higher Order Strict Avalanche Criterion 1989 7 EUROCRYPT Davida & Desmedt & Peralta, A Key Distribution System Based on Any One-way Function 1989 7 EUROCRYPT Pieprzyk, Non-linearity of Exponent Permutations 1989 7 EUROCRYPT Sgarro, Informational Divergence Bounds for Authentication Codes 1989 7 EUROCRYPT Quisquater & Girault, 2n-Bit Hash-Functions Using n-Bit Symmetric Block Cipher Algorithms 1989 7 EUROCRYPT Mjolsnes, A Simple Technique for Diffusing Cryptoperiods 1989 7 EUROCRYPT Burmester & Desmedt & Piper & Walker, A General Zero-Knowledge Scheme 1989 7 EUROCRYPT Okamoto & Ohta, Divertible Zero-Knowledge Interactive Proofs and Commutative Random Self-reducibility 1989 7 EUROCRYPT Crepeau, Verifiable Disclosure of Secrets and Applications 1989 7 EUROCRYPT Boyar & Friedl & Lund, Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies 1989 7 EUROCRYPT Stern, An Alternative to the Fiat-Shamir Protocol 1989 7 EUROCRYPT Brassard & Crepeau, Sorting Out Zero-Knowledge 1989 7 EUROCRYPT Brassard & Crepeau & Yung, Everything in NP Can Be Argued in Perfect Zero-Knowledge in a Bounded Number of Rounds 1989 7 EUROCRYPT Yung, Zero-Knowledge Proofs of Computational Power 1989 7 EUROCRYPT den Boer, More Efficient Match-making and Satisfiability. The Five Card Trick 1989 7 EUROCRYPT Vandemeulebroecke & Vanzieleghem & Denayer & Jespers, A Single Chip 1024 Bits RSA Processor 1989 7 EUROCRYPT Cnudde, Cryptel: The Practical Protection of an Existing Electronic Mail System 1989 7 EUROCRYPT Van Auseloos, Technical Security: The Starting Point 1989 7 EUROCRYPT Siuda, Security in Open Distributed Processing 1989 7 EUROCRYPT Vandewalle & Chaum & Fumy & Jansen & Landrock & Roelofsen, A European Call for Cryptographic Algorithms: RIPE; Race Integrity Primitives Evaluation 1989 7 EUROCRYPT Antoine & Brakeland & Eloy & Poullet, Legal Requirements Facing New Signature Technologies 1989 7 EUROCRYPT Chaum, Online Cash Checks 1989 7 EUROCRYPT Chaum & den Boer & van Heyst & Mjolsnes & Steenbeek, Efficient Offline Electronic Checks 1989 7 EUROCRYPT Waidner, Unconditional Sender and Recipient Untraceability in Spite of Active Attacks 1989 7 EUROCRYPT Bos & den Boer, Detection of Disrupters in the DC Protocol 1989 7 EUROCRYPT Flajolet & Odlyzko, Random Mapping Statistics 1989 7 EUROCRYPT Lenstra & Manasse, Factoring by Electronic Mail 1989 7 EUROCRYPT Wiener, Cryptanalysis of Short RSA Secret Exponents 1989 7 EUROCRYPT Pfitzmann & Pfitzmann, How to Break the Direct RSA-Implementation of MIXes 1989 7 EUROCRYPT Jendal & Kuhn & Massey, An Information-Theoretic Treatment of Homophonic Substitution 1989 7 EUROCRYPT Wichmann, Cryptanalysis of a Modified Rotor Machine 1989 7 EUROCRYPT Bertilsson & Brickell & Ingemarsson, Cryptanalysis of Video Encryption Based on Space-filling Curves 1989 7 EUROCRYPT Zheng & Matsumoto & Imai, Impossibility and Optimality Results on Constructing Pseudorandom Permutations 1989 7 EUROCRYPT Rueppel, On the Security of Schnorr's Pseudo Random Generator 1989 7 EUROCRYPT Quisquater & Delescaille, How Easy is Collision Search? Applications to DES 1989 7 EUROCRYPT Simmons, Prepositioned Shared Secret and/or Shared Control Schemes 1989 7 EUROCRYPT Brickell, Some Ideal Secret Sharing Schemes 1989 7 EUROCRYPT De Soete & Vedder & Walker, Cartesian Authentication Schemes 1989 7 EUROCRYPT Beutelspacher, How to Say ``No'' 1989 7 EUROCRYPT Godlewski & Mitchell, Key Minimal Authentication Systems for Unconditional Secrecy 1989 7 EUROCRYPT Gunther, Parallel Generation of Recurring Sequences 1989 7 EUROCRYPT Niederreiter, Keystream Sequences with a Good Linear Complexity Profile for Every Starting Point 1989 7 EUROCRYPT Beth & Dai, On the Complexity of Pseudo-random Sequences -- or: If You Can Describe a Sequence It Can't Be Random 1989 7 EUROCRYPT Dai & Zeng, Feedforward Functions Defined by de Bruijn Sequences 1989 7 EUROCRYPT Meier & Staffelbach, Nonlinearity Criteria for Cryptographic Functions 1989 7 EUROCRYPT Chan & Goresky & Klapper, On the Linear Complexity of Feedback Registers 1989 7 EUROCRYPT Wang, Linear Complexity Profiles and Continued Fractions 1989 7 EUROCRYPT Forre, A Fast Correlation Attack on Nonlinearly Feedforward Filtered Shift-Register Sequences 1989 7 EUROCRYPT Buchmann & Dullmann & Williams, On the Complexity and Efficiency of a New Key Exchange System 1989 7 EUROCRYPT Boyd, A New Multiple Key Cipher and an Improved Voting Scheme 1989 7 EUROCRYPT Morain, Atkin's Test: News from the Front 1989 7 EUROCRYPT Maurer, Fast Generation of Secure RSA-Moduli with Almost Maximal Diversity 1989 7 EUROCRYPT Duhoux, Deciphering Bronze Age Scripts of Crete. The Case of Linear A 1989 7 EUROCRYPT Bosma & van der Hulst, Faster Primality Testing 1989 7 EUROCRYPT Hwang & Rao, Private-Key Algebraic-Code Cryptosystems with High Information Rates 1989 7 EUROCRYPT Quisquater & Bouckaert, Zero-Knowledge Procedures for Confidential Access to Medical Records 1989 7 EUROCRYPT Domingo i Ferrer & Huguet i Rotger, Full Secure Key Exchange and Authentication with No Previously Shared Secrets 1989 7 EUROCRYPT Roggeman, Varying Feedback Shift Registers 1989 7 EUROCRYPT Gollmann & Chambers, A Cryptanalysis of step_{k,m}-Cascades 1989 7 EUROCRYPT Schnorr, Efficient Identification and Signatures for Smart Cards 1989 7 EUROCRYPT Waidner & Pfitzmann, The Dining Cryptographers in the Disco: Unconditional Sender and Recipient Untraceability with Computationally Secure Serviceability 1989 7 EUROCRYPT Carter, Some Conditions on the Linear Complexity Profiles of Certain Binary Sequences 1989 7 EUROCRYPT Brown & Seberry, On the Design of Permutation P in DES Type Cryptosystems 1989 7 EUROCRYPT Agnew & Mullin & Vanstone, A Fast Elliptic Curve Cryptosystem 1988 6 EUROCRYPT Rueppel, Key Agreements Based on Function Composition 1988 6 EUROCRYPT Koyama & Ohta, Security of Improved Identity-Based Conference Key Distribution Systems 1988 6 EUROCRYPT Desmedt, Subliminal-Free Authentication and Signature 1988 6 EUROCRYPT Simmons & Purdy, Zero-Knowledge Proofs of Identity and Veracity of Transaction Receipts 1988 6 EUROCRYPT Brickell & Stinson, Authentication Codes with Multiple Arbiters 1988 6 EUROCRYPT De Soete, Some Constructions for Authentication-Secrecy Codes 1988 6 EUROCRYPT Beth, Efficient Zero-Knowledge Identification Scheme for Smart Cards 1988 6 EUROCRYPT Knobloch, A Smart Card Implementation of the Fiat-Shamir Identification Scheme 1988 6 EUROCRYPT Godlewski & Camion, Manipulations and Errors, Detection and Localization 1988 6 EUROCRYPT Knapskog, Privacy Protected Payments--Realization of a Protocol that Guarantees Payer Anonymity 1988 6 EUROCRYPT Guillou & Quisquater, A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and Memory 1988 6 EUROCRYPT Girault & Cohen & Campana, A Generalized Birthday Attack 1988 6 EUROCRYPT Agnew & Mullin & Vanstone, An Interactive Data Exchange Protocol Based on Discrete Exponentiation 1988 6 EUROCRYPT Brandt & Damgard & Landrock, Anonymous and Verifiable Registration in Databases 1988 6 EUROCRYPT Chaum, Elections with Unconditionally-Secret Ballots and Disruption Equivalent to Breaking RSA 1988 6 EUROCRYPT Davida & Desmedt, Passports and Visas Versus ID's 1988 6 EUROCRYPT Niederreiter, The Probabilistic Theory of Linear Complexity 1988 6 EUROCRYPT Di Porto & Filipponi, A Probabilistic Primality Test Based on the Properties of Certain Generalized Lucas Numbers 1988 6 EUROCRYPT Schnorr, On the Construction of Random Number Generators and Random Function Generators 1988 6 EUROCRYPT Davis & Holdridge, Factorization of Large Integers on a Massively Parallel Computer 1988 6 EUROCRYPT Kawamura & Hirano, A Fast Modular Arithmetic Algorithm Using a Residue Table 1988 6 EUROCRYPT Agnew & Mullin & Vanstone, Fast Exponentiation in GF(2^n) 1988 6 EUROCRYPT Hoornaert & Decroos & Vandewalle & Govaerts, Fast RSA-Hardware: Dream or Reality? 1988 6 EUROCRYPT Gorgui-Naguib & Dlay, Properties of the Euler Totient Function Modulo 24 and Some of its Cryptographic Implications 1988 6 EUROCRYPT Lee & Brickell, An Observation on the Security of McEliece's Public-Key Cryptosystem 1988 6 EUROCRYPT Vallee & Girault & Toffin, How to Break Okamoto's Cryptosystem by Reducing Lattice Bases 1988 6 EUROCRYPT Den Boer, Cryptanalysis of F. E. A. L. 1988 6 EUROCRYPT Meier & Staffelbach, Fast Correlation Attacks on Stream Ciphers 1988 6 EUROCRYPT Tezuka, A New Class of Nonlinear Functions for Running-Key Generators 1988 6 EUROCRYPT Smeets & Chambers, Windmill Generators: A Generalization and an Observation of How Many There Are 1988 6 EUROCRYPT Chambers & Gollmann, Lock-in Effect in Cascades of Clock-Controlled Shift-Registers 1988 6 EUROCRYPT Ding, Proof of Massey's Conjectured Algorithm 1988 6 EUROCRYPT Lin & Liu, Linear Recurring m-Arrays 1988 6 EUROCRYPT Okamoto, Substantial Number of Cryptographic Keys and its Application to Encryption Designs 1988 6 EUROCRYPT Sgarro, A Measure of Semiequivocation 1988 6 EUROCRYPT De Soete & Vedder, Some New Classes of Geometric Threshold Schemes 1988 6 EUROCRYPT Gunther, A Universal Algorithm for Homophonic Coding 1988 6 EUROCRYPT Jingmin & Kaicheng, A New Probabilistic Encryption Scheme 1988 6 EUROCRYPT Matsumoto & Imai, Public Quadratic Polynomial-Tuples for Efficient Signature-Verification and Message-Encryption 1988 6 EUROCRYPT Boyd, Some Applications of Multiple Key Ciphers 1987 5 EUROCRYPT Gunther, Alternating Step Generators Controlled by De Bruijn Sequences 1987 5 EUROCRYPT Siegenthaler & Kleiner & Forre, Generation of Binary Sequences with Controllable Complexity and Ideal r-Tupel Distribution 1987 5 EUROCRYPT Mund & Gollmann & Beth, Some Remarks on the Cross Correlation Analysis of Pseudo Random Generators 1987 5 EUROCRYPT Niederreiter, Sequences with Almost Perfect Linear Complexity Profile 1987 5 EUROCRYPT Rueppel, When Shift Registers Clock Themselves 1987 5 EUROCRYPT Pichler, Finite State Machine Modelling of Cryptographic Systems in Loops 1987 5 EUROCRYPT Agnew, Random Sources for Cryptographic Systems 1987 5 EUROCRYPT Clark, Physical Protection of Cryptographic Devices 1987 5 EUROCRYPT Sedlak, The RSA Cryptography Processor 1987 5 EUROCRYPT Jorissen & Vandewalle & Govaerts, Extension of Brickell's Algorithm for Breaking High Density Knapsacks 1987 5 EUROCRYPT Brickell & Yacobi, On Privacy Homomorphisms (Extended Abstract) 1987 5 EUROCRYPT Chaum & Evertse & van de Graaf, An Improved Protocol for Demonstrating Possession of Discrete Logarithms and Some Generalizations 1987 5 EUROCRYPT Davida & Walter, A Public Key Analog Cryptosystem 1987 5 EUROCRYPT Simmons, Message Authentication with Arbitration of Transmitter/Receiver Disputes 1987 5 EUROCRYPT Beutelspacher, Perfect and Essentially Perfect Authentication Schemes (Extended Abstract) 1987 5 EUROCRYPT Beker & Cole, Message Authentication and Dynamic Passwords 1987 5 EUROCRYPT Schaumuller-Bichl, IC-Cards in High-Security Applications 1987 5 EUROCRYPT Damgard, Collision Free Hash Functions and Public Key Signature Schemes 1987 5 EUROCRYPT Girault, Hash-Functions Using Modulo-N Operations 1987 5 EUROCRYPT Chaum, Blinding for Unanticipated Signatures 1987 5 EUROCRYPT Massey & Maurer & Wang, Non-Expanding, Key-Minimal, Robustly-Perfect, Linear and Bilinear Ciphers 1987 5 EUROCRYPT Evertse, Linear Structures in Blockciphers 1987 5 EUROCRYPT Shimizu & Miyaguchi, Fast Data Encipherment Algorithm FEAL 1987 5 EUROCRYPT Jansen & Boekee, Modes of Blockcipher Algorithms and their Protection Against Eavesdropping 1987 5 EUROCRYPT Verbauwhede & Hoornaert & Vandewalle & De Man, Security Considerations in the Design and Implementation of a New DES Chip 1987 5 EUROCRYPT Anderson & Rangan, High-Performance Interface Architectures for Cryptographic Hardware 1985 3 EUROCRYPT Horak, The Contribution of E. B. Fleissner and A. Figl for Today's Cryptography 1985 3 EUROCRYPT Tedrick, On the History of Cryptography during WW2, and Possible New Directions for Cryptographic Research 1985 3 EUROCRYPT Rivest & Shamir, Efficient Factoring Based on Partial Information 1985 3 EUROCRYPT Niederreiter, A Public-Key Cryptosystem Based on Shift Register Sequences 1985 3 EUROCRYPT Smeets, A Comment on Niederreiter's Public Key Cryptosystem 1985 3 EUROCRYPT Vandewalle & Govaerts & De Becker & Decroos & Speybrouck, Implementation Study of Public Key Cryptographic Protection in an Existing Electronic Mail and Document Handling System 1985 3 EUROCRYPT Muller & Nobauer, Cryptanalysis of the Dickson-Scheme 1985 3 EUROCRYPT Peralta, Simultaneous Security of Bits in the Discrete Log 1985 3 EUROCRYPT Pieprzyk, On Public-Key Cryptosystems Built Using Polynomial Rings 1985 3 EUROCRYPT Kaliski & Rivest & Sherman, Is the Data Encryption Standard a Group? 1985 3 EUROCRYPT Meijer & Akl, Two New Secret Key Cryptosystems 1985 3 EUROCRYPT Siegenthaler, Cryptanalysts Representation of Nonlinearly Filtered ML-Sequences 1985 3 EUROCRYPT Gollewski & Cohen, Authorized Writing for ``Write-Once'' Memories 1985 3 EUROCRYPT Herlestam, On Functions of Linear Shift Register Sequences 1985 3 EUROCRYPT Chen & Dai, On Feedforward Transforms and p-Fold Periodic p-Arrays 1985 3 EUROCRYPT Liu & Wan, Generalized Multiplexed Sequences 1985 3 EUROCRYPT Smeets, A Note on Sequences Generated by Clock Controlled Shift Registers 1985 3 EUROCRYPT Wagner & Putter & Cain, Using Algorithms as Keys in Stream Ciphers 1985 3 EUROCRYPT Brynielsson, On the Linear Complexity of Combined Shift Register Sequences 1985 3 EUROCRYPT Bernasconi & Gunther, Analysis of a Nonlinear Feedforward Logic for Binary Sequence Generators 1985 3 EUROCRYPT Rueppel, Linear Complexity and Random Sequences 1985 3 EUROCRYPT Davies & Price, Engineering Secure Information Systems 1985 3 EUROCRYPT Krivachy, The Chipcard--An Identification Card with Cryptographic Protection 1985 3 EUROCRYPT Rimensberger, Encryption: Needs, Requirements and Solutions in Banking Networks 1985 3 EUROCRYPT Baxter & Jones, The Role of Encipherment Services in Distributed Systems 1985 3 EUROCRYPT Agnew, Modeling of Encryption Techniques for Secrecy and Privacy in Multi-User Networks 1985 3 EUROCRYPT Bradey & Graham, Full Encryption in a Personal Computer System 1985 3 EUROCRYPT Chaum, Showing Credentials without Identification: Signatures Transfereed between Unconditionally Unlinkable Pseudonyms 1985 3 EUROCRYPT Pfitzmann & Waidner, Networks without User Observability--Design Options 1985 3 EUROCRYPT Book & Otto, The Verifiability of Two-Party Protocols 1985 3 EUROCRYPT Simmons, The Practice of Authentication 1985 3 EUROCRYPT Kowatsch & Eichinger & Seifert, Message Protection by Spread Spectrum Modulation in a Packet Voice Radio Link 1984 2 EUROCRYPT Agnew, Secrecy and Privacy in a Local Area Network Environment 1984 2 EUROCRYPT Berger & Peralta & Tedrick, A Provably Secure Oblivious Transfer Protocol 1984 2 EUROCRYPT Beth & Piper, The Stop-and-go Generator 1984 2 EUROCRYPT Blom, An Optimal Class of Symmetric Key Generation Systems 1984 2 EUROCRYPT Bouckaert, Security of Transportable Computerized Files 1984 2 EUROCRYPT Davio & Desmedt & Quisquater, Propagation Characteristics of the DES 1984 2 EUROCRYPT Davis & Holdridge & Simmons, Status Report on Factoring (At the Sandia National Labs) 1984 2 EUROCRYPT Desmedt & Delsarte & Odlyzko & Piret, Fast Cryptanalysis of the Matsumoto-Imai Public Key Scheme 1984 2 EUROCRYPT Ecker, Time-division Multiplexing Scramblers: Selecting Permutations and Testing the Systems 1984 2 EUROCRYPT Girardot, Bull CP8 Smart Card Uses in Cryptology 1984 2 EUROCRYPT Goldreich, On Concurrent Identification Protocols 1984 2 EUROCRYPT Goldreich, On the Number of Close-and-equal Pairs of Bits in a String 1984 2 EUROCRYPT Gollman, Pseudo Random Properties of Cascade Connections of Clock Controlled Shift Registers 1984 2 EUROCRYPT Goodman & McAuley, A New Trapdoor Knapsack Public-Key Cryptosystem 1984 2 EUROCRYPT Gordon, Strong Primes are Easy to Find 1984 2 EUROCRYPT Goutay, Smart Card Applications in Security and Data Protection 1984 2 EUROCRYPT Groscot, Estimation of Some Encryption Functions Implemented into Smart Cards 1984 2 EUROCRYPT Guillou, Smart Cards and Conditional Access 1984 2 EUROCRYPT Harari, Non-Linear, Non-Commutative Functions for Data Integrity 1984 2 EUROCRYPT Jones, User Functions for the Generation and Distribution of Encipherment Keys 1984 2 EUROCRYPT Lidl, On Cryptosystems Based on Polynomials and Finite Fields 1984 2 EUROCRYPT Massey & Rueppel, Linear Ciphers and Random Sequence Generators with Multiple Clocks 1984 2 EUROCRYPT Odlyzko, Discrete Logarithms in Finite Fields and their Cryptographic Significance 1984 2 EUROCRYPT Ozarow & Wyner, Wire-Tap Channel II 1984 2 EUROCRYPT Pieprzyk, Algebraical Structures of Cryptographic Transformations 1984 2 EUROCRYPT Pomerance, The Quadratic Sieve Factoring Algorithm 1984 2 EUROCRYPT Rivest, RSA Chips (Past/Present/Future) 1984 2 EUROCRYPT Ruggiu, Cryptology and Complexity Theories 1984 2 EUROCRYPT Schaumueller & Piller, A Method of Software Protection Based on the Use of Smart Cards and Cryptographic Techniques 1984 2 EUROCRYPT Schnorr & Alexi, RSA-Bits are 0.5 + epsilon Secure 1984 2 EUROCRYPT Serpell & Brookson, Encryption and Key Management for the ECS Satellite Service 1984 2 EUROCRYPT Sgarro, Equivocations for Homophonic Ciphers 1984 2 EUROCRYPT Simmons, The Subliminal Channel and Digital Signatures 1984 2 EUROCRYPT Smeets, On the Use of the Binary Multiplying Channel in a Private Communication System 1984 2 EUROCRYPT Vogel, On the Linear Complexity of Cascaded Sequences 1984 2 EUROCRYPT Wolfowicz & Brugia & Improta, An Encryption and Authentification Procedure for Tele-Surveillance Systems 1996 2 EUROPAR Gibbons & Matias & Ramachandran, The Queue-Read Queue-Write Asynchronous PRAM Model 1996 2 EUROPAR MacKenzie & Ramachandran, ERCW PRAMs and Optical Communications 1996 2 EUROPAR Leppanen, Goodness of Time-Processor Optimal PRAM Simulations 1996 2 EUROPAR Kautonen & Leppanen & Penttonen, Simulations of PRAM on Complete Optical Networks 1996 2 EUROPAR Nibhanupudi & Szymanski, Adaptive Parallelism in the Bulk-Synchronous Parallel Model 1996 2 EUROPAR Nash & Dew & Davy & Dyer, Implementation Issues Relating to the WPRAM Model for Scalable Computing 1996 2 EUROPAR Tiskin, The Bulk-Synchronous Parallel Random Access Machine 1996 2 EUROPAR Juurlink & Wijshoff, The E-BSP Model: Incorporating General Locality and Unbalanced Communication into the BSP Model 1996 2 EUROPAR Gerbessiotis & Siniolakis, Communication Efficient Data Structures on the BSP Model with Applications in Computational Geometry 1996 2 EUROPAR de la Torre & Kruskal, Submachine Locality in the Bulk Synchronous Setting 1996 2 EUROPAR He & Miller & Chen, Algebraic Laws for BSP Programming 1996 2 EUROPAR Baeumker & Dittrich & Meyer auf der Heide & Rieping, Realistic Parallel Algorithms: Priority Queue Operations and Selection for the BSP* Model 1996 2 EUROPAR Gorlatch, Systematic Efficient Parallelization of Scan and Other List Homomorphisms 1996 2 EUROPAR Hains & Mullins, Array Structures and Data-Parallel Algorithms 1996 2 EUROPAR Formella & Keller & Walle, HPP: A High Performance PRAM 1996 2 EUROPAR Strey & Avellana, A New Concept for Parallel Neurocomputer Architectures 1996 2 EUROPAR Fey, Transformation of a 2-D VLSI Systolic Adder Circuit in 3-D Circuits Using Optical Interconnections 1996 2 EUROPAR Lahlou, Scheduling with Unit Processing and Communication Times on a Ring Network: Approximation Results 1996 2 EUROPAR Mayr & Stadtherr, Efficient Parallel Algorithms for Scheduling with Tree Precedence Constraints 1996 2 EUROPAR Calinescu, Bulk Synchronous Parallel Scheduling of Uniform Dags 1996 2 EUROPAR Guerdoux-Jamet & Lavenier & Wagner & Quinton, Design and Implementation of a Parallel Architecture for Biological Sequence Comparison 1996 2 EUROPAR McColl, Universal Computing 1996 2 EUROPAR Fulgham & Snyder, A Comparison of Input and Output Driven Routers 1996 2 EUROPAR Duato & Malumbres, Optimal Topology for Distributed Shared Memory Multiprocessors: Hypercubes Again? 1996 2 EUROPAR Rice & Delgado-Frias & Summerville, A Pattern-Associative Router for Interconnection Network Adaptive Algorithms 1996 2 EUROPAR Bourdin & Ferreira & Marcus, On Stack-Graph OPS-Based Lightwave Networks 1996 2 EUROPAR Heun & Mayr, A General Method for Efficient Embeddings of Graphs into Optimal Hypercubes 1996 2 EUROPAR Dai, The Size Complexity of Strictly Non-blocking Fixed Ratio Concentrators with Constant Depth 1996 2 EUROPAR Barth, Bandwidth and Cutwidth of the Mesh of d-ary Trees 1996 2 EUROPAR Moraes de Azevedo & Bagherzadeh & Latifi, Variable-Dilation Embeddings of Hypercubes into Star Graphs: Performance Metrics, Mapping Functions, and Routing 1996 2 EUROPAR Diaz de Cerio & Valero-Garcia & Gonzalez, Overlapping Communication and Computation in Hypercubes 1996 2 EUROPAR Di Ianni, Efficient Delay Routing 1996 2 EUROPAR Kaklamanis & Krizanc, Multipacket Hot-Potato Routing on Processor Arrays 1996 2 EUROPAR Kim & Yoon & Maeng, A Necessary and Sufficient Condition for Proper Routing in Omega-Omega Network 1996 2 EUROPAR Delorme & Panaite, Rubik Routing Permutations on Graphs 1996 2 EUROPAR Meyer auf der Heide & Schroeder & Schwarze, Routing on Networks of Optical Crossbars 1996 2 EUROPAR Bermond & Munoz & Marchetti-Spaccamela, Induced Broadcasting Algorithms in Iterated Line Digraphs 1996 2 EUROPAR Perennes, Lower Bounds on Broadcasting Time of de Bruijn Networks 1996 2 EUROPAR Laforest, Gossip in Trees under Line-Communication Mode 1996 2 EUROPAR Dimakopoulos & Dimopoulos, Total Exchange in Cayley Networks 1996 2 EUROPAR Dimakopoulos & Dimopoulos, Leaf Communication in Complete Trees 1996 2 EUROPAR Fujita & Laforest & Perennes, A Gossip Algorithm for Bus Networks with Buses of Limited Length 1996 2 EUROPAR Juurlink & Rao & Sibeyn, Worm-Hole Gossiping on Meshes 1996 2 EUROPAR Delmas & Perennes, Circuit-Switched Gossiping in 3-Dimensional Torus Networks 1996 2 EUROPAR Ferragina, A Simple Parallel Dictionary Matching Algorithm 1996 2 EUROPAR Podehl & Rauber & Runger, Scalability and Granularity Issues of the Hierarchical Radiosity Method 1996 2 EUROPAR Sibeyn, List Ranking on Interconnection Networks 1996 2 EUROPAR Urland, Parallel Algorithm for Computing the Fragment Vector in Steiner Triple Systems 1996 2 EUROPAR Nepomniaschaya, Representation of the Gabow Algorithm for Finding Smallest Spanning Trees with a Degree Constraint on Associative Parallel Processors 1996 2 EUROPAR Moussouni & Lavault, Distributed String Matching Algorithm on the N-cube 1995 1 EUROPAR Engquist, Parallelism in Computational Algorithms and the Physical World 1995 1 EUROPAR Romke & Rottger & Schroeder & Simon, On Efficient Embeddings of Grids into Grids in PARIX 1995 1 EUROPAR Achilles, Optimal Emulation of Meshes on Meshes of Trees 1995 1 EUROPAR Das & Mao, Optimal Embeddings in the Hamming Cube Networks 1995 1 EUROPAR Liu, Hierarchical Adaptive Routing Under Hybrid Traffic Load 1995 1 EUROPAR Bhatt & Bilardi & Herley & Pucci & Ranade, Tight Bounds on Parallel List Marking 1995 1 EUROPAR Lowe, Optimization of PRAM-Programs with Input-Dependent Memory Access 1995 1 EUROPAR Chen, Optimal Circular Arc Representations 1995 1 EUROPAR Jaseemuddin & Vranesic, Bidirectional Ring: An Alternative to the Hierarchy of Unidirectional Rings 1995 1 EUROPAR Singhvi & Ghose, A Formal Study of the Mcube Interconnection Network 1995 1 EUROPAR Shionoya & Aoki & Higuchi, Multiwave Interconnection Networks for MCM-Based Parallel Processing 1995 1 EUROPAR Johannesson, FFTs on a Linear SIMD Array 1995 1 EUROPAR Sheu & Chen, Tolerating Faults in Faulty Hypercubes Using Maximal Fault-Free Subcube-Ring 1996 14 EXPMATH Lowe, On the Convergence of Genetic Algorithms 1991 FAIR Wiedermann, Efficient Simulations of Nondeterministic Computations and their Speed-up by the Ring of Cooperating Machines 1995 10 FCT Baeten & Bergstra, Discrete Time Process Algebra with Abstraction 1995 10 FCT Chaochen & Hung & Xiaoshan, A Duration Calculus with Infinite Intervals 1995 10 FCT Fisher & Mitchell, A Delegation-Based Object Calculus with Subtyping 1995 10 FCT Larsen & Pettersson & Yi, Model-Checking for Real-Time Systems 1995 10 FCT Mayr, On Polynomial Ideals, Their Complexity, and Applications 1995 10 FCT Amadio & Leth & Thomsen, From a Concurrent lambda-Calculus to the pi-Calculus 1995 10 FCT Antimirov, Rewriting Regular Inequalities 1995 10 FCT Barthe, A Simple Abstract Semantics for Equational Theories 1995 10 FCT Bergstra & Stefanescu, Processes with Multiple Entries and Exits 1995 10 FCT Bertol, Efficient Rewriting in Cograph Trace Monoids 1995 10 FCT Calude & Zimand, Effective Category and Measure in Abstract Complexity Theory 1995 10 FCT Chaboud, About Planar Cayley Graphs 1995 10 FCT Chepoi & Dragan, On Condorcet and Median Points of Simple Rectilinear Polygons 1995 10 FCT Djidjev & Pantziou & Zaroliagis, Fast Algorithms for Maintaining Shortest Paths in Outerplanar and Planar Digraphs 1995 10 FCT Dragan & Nicolai, r-Domination Problems in Homogeneously Orderable Graphs 1995 10 FCT Durand & Mazoyer, Growing Patterns in 1D Cellular Automata 1995 10 FCT Esparza, Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes 1995 10 FCT Fassbender, Implementation of a UU-Algorithm for Primitive Recursive Tree Functions 1995 10 FCT Ferreira & Zantema, Dummy Elimination: Making Termination Easier 1995 10 FCT Gronewold & Fleischhack, Computing Petri Net Languages by Reductions 1995 10 FCT de Haas, Categorial Graphs 1995 10 FCT Hromkovic & Klasing & Pardubska & Unger & Waczulik & Wagener, Effective Systolic Algorithms for Gossiping in Cycles and Two-Dimensional Grids 1995 10 FCT Jancar & Mraz & Platek & Vogel, Restarting Automata 1995 10 FCT Kessler & Rauber, Optimal Contiguous Expression DAG Evaluations 1995 10 FCT Klaudel & Pelz, Communication as Unification in the Petri Box Calculus 1995 10 FCT Kudlek & Mateescu, Distributed Catenation and Chomsky Hierarchy 1995 10 FCT Kummer & Stephan, The Power of Frequency Computation 1995 10 FCT Le, Randomized Incremental Construction of Simple Abstract Voronoi Diagrams in 3-Space 1995 10 FCT Macarie & Ogihara, Properties of Probabilistic Pushdown Automata 1995 10 FCT Makanin & Abdulrab & Maksimenko, Formal Parametric Equations 1995 10 FCT Niedermeier & Rossmanith, PRAM's Towards Realistic Parallelism: BRAM's 1995 10 FCT Petersen, Some Results Concerning Two-Dimensional Turing Machines and Finite Automata 1995 10 FCT Pighizzini, How Hard is to Compute the Edit Distance 1995 10 FCT Reinhardt, On the Synchronization of Semi-Traces 1995 10 FCT Remila, Tiling with Bars and Satisfaction of Boolean Formulas 1995 10 FCT Sassone, Axiomatizing Petri Net Concatenable Processes 1995 10 FCT Schewe, Functional Sorts in Data Type Specifications; A Geometric Approach to Semantics 1993 9 FCT Diekert, Rewriting, Mobius Functions and Semi-Commutations 1993 9 FCT Dietzfelbinger, Simulations between Different Models of Parallel Computers 1993 9 FCT Ito, Dense and Disjunctive Properties of Languages 1993 9 FCT Jurgensen & Konstantinidis, The Hierarchy of Codes 1993 9 FCT Kreowski, Five Facets of Hyperedge Replacement Beyond Context-Freeness 1993 9 FCT Milner, An Action Structure for Synchronous pi-Calculus 1993 9 FCT Pudlak, AC^0 Circuit Complexity. A Survey of Lower Bounds 1993 9 FCT Salomaa, Pattern Languages: Problems of Decidability and Generation 1993 9 FCT Abdulrab & Maksimenko, General Solution of Mirror Equation 1993 9 FCT Andre & Bossut, Decidability of Equivalence for Linear Letter to Letter Top-Down Tree Transducers 1993 9 FCT Bergstra & Stefanescu, Translations Between Flowchart Schemes and Process Graphs 1993 9 FCT Cazanescu, Local Equational Logic 1993 9 FCT Chrzastowski-Wachtel & Raczunas, Liveness of Weighted Circuits and the Diophantine Problem 1993 9 FCT Courcelle, Context-Free Graph Grammars: Separating Vertex Replacement from Hyperedge Replacement 1993 9 FCT Domosi & Horvath & Ito & Kaszonyi & Katsura, Formal Languages Consisting of Primitive Words 1993 9 FCT Durand, Undecidability of the Surjectivity Problem for 2D Cellular Automata: A Simplified Proof 1993 9 FCT Ebert, Efficient Interpretation of State Charts 1993 9 FCT Fassbender, Implementation of a Universal Unification Algorithm for Macro Tree Transducers 1993 9 FCT Fischer, Finding Maximum Convex Polygons 1993 9 FCT Fischer & Hoffgen & Lefmann & Luczak, Approximations with Axis-Aligned Rectangles 1993 9 FCT Girkar & Moll, Vector Sequence Analysis and Full Weak Safety for Concurrent Systems 1993 9 FCT Groger, Does Transitivity Help? On the Complexity of Poset Properties 1993 9 FCT Hagerup & Maas, Generalized Topological Sorting in Linear Time 1993 9 FCT Hemachandra & Silvestri, Easily Checked Self-Reducibility 1993 9 FCT Holzer & Lange, On the Complexities of Linear LL(1) and LR(1) Grammars 1993 9 FCT Hung & Dung, On the Relation Between Firing Sequences and Processes of Petri Nets 1993 9 FCT Jansen & Scheffler & Woeginger, Maximum Covering with D Cliques 1993 9 FCT Kemp, Monotonically Labelled Ordered Trees and Multidimensional Binary Trees 1993 9 FCT Kuske, Maximum Path Length Pumping Lemma for Edge-Replacement Languages 1993 9 FCT Maier & Schott, Regular Approximations to Shuffle Products of Context-Free Languages, and Convergence of their Generating Functions 1993 9 FCT Manes, The Equational Theory of a Boolean Monad 1993 9 FCT Margenstern, Non Erasing Turing Machines: A Frontier Between a Decidable Halting Problem and Universality 1993 9 FCT Mateescu, On Scattered Syntactic Monoids 1993 9 FCT Potthoff & Thomas, Regular Tree Languages without Unary Symbols are Star-Free 1993 9 FCT Roka, One-Way Cellular Automata on Cayley Graphs 1993 9 FCT Ruzicka & Privara, On Tree Pattern Unification Problems 1993 9 FCT Salomaa & Wood & Yu, Structural Equivalence and ET0L Grammars 1993 9 FCT Slutzki & Vagvolgyi, A Hierarchy of Deterministic Top-Down Tree Transformations 1993 9 FCT Wu, Synthesis of O(lg n) Testable Trees 1993 9 FCT Yin & Hong, On the Learnability of a Restricted Predicate Formula 1991 8 FCT Allender & Gore, On Strong Separations from AC^0 1991 8 FCT Buchmann, Number Theoretical Algorithms and Cryptology 1991 8 FCT Cai, Computations Over Infinite Groups 1991 8 FCT Heinrich, Efficiency of Monte Carlo Algorithms in Numerical Analysis 1991 8 FCT Karpinski, Approximation Algorithms for Counting Problems in Finite Fields 1991 8 FCT Razborow, Lower Bounds for Deterministic and Nondeterministic Branching Programs 1991 8 FCT Reischuk, Graph Theoretical Methods for the Design of Parallel Algorithms 1991 8 FCT Schnorr & Euchner, Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems 1991 8 FCT Traub, Information-Based Complexity: Recent Results and Open Problems 1991 8 FCT Turan, A Survey of Some Aspects of Computational Learning Theory 1991 8 FCT Baier & Majster-Cederbaum, The Consistency of a Noninterleaving and an Interleaving Model for Full TCSP 1991 8 FCT Bank & Krick & Mandel & Solerno, A Geometrical Bound for Integer Programming with Polynomial Constraints 1991 8 FCT Barcucci & Pinzani & Rodella & Sprugnoli, A Characterization of Binary Search Networks 1991 8 FCT Beauquier & Nivat & Niwinski, About the Effect of the Number of Successful Paths in an Infinite Tree on the Recognizability by a Finite Automaton with Buchi Conditions 1991 8 FCT Breveglieri & Citrini & Crespi-Reghizzi, Deterministic Dequeue Automata and LL(1) Parsing of Breadth-Depth Grammars 1991 8 FCT Bruschi & Pighizzini, The Complexity of Computing Maximal Word Functions 1991 8 FCT Buntrock & Jenner & Lange & Rossmanith, Unambiguity and Fewness for Logarithmic Space 1991 8 FCT Chardin, Differential Resultants and Subresultants 1991 8 FCT Chlebus & Vrto, Unifying Binary-Search Trees and Permutations 1991 8 FCT Dassow & Lange, Computational Complexity and Hardest Languages of Automata with Abstract Storages 1991 8 FCT Fachini & Monti & Napoli & Parente, Systolic Y-Tree Automata: Closure Properties and Decision Problems 1991 8 FCT Groeger, A New Partition Lemma for Planar Graphs and its Application to Circuit Complexity 1991 8 FCT Hofmeister & Hohberg & Koehling, Some Notes on Threshold Circuits, and Multiplication in Depth 4 1991 8 FCT Hromkovic, Nonlinear Lower Bounds on the Number of Processors of Circuits with Sublinear Separators 1991 8 FCT Ibarra & Tran, On Space-Bounded Synchronized Alternating Turing Machines 1991 8 FCT Joux & Stern, Improving the Critical Density of the Lagarias-Odlyzko Attack Against Subset Sum Problems 1991 8 FCT Jukna, Optimal versus Stable in Boolean Formulae 1991 8 FCT Kaib, The Gauss Lattice Basis Reduction Algorithm Succeeds With Any Given Norm 1991 8 FCT Kaneps, Regularity of One-Letter Languages Acceptable by 2-Way Finite Probabilistic Automata 1991 8 FCT Knijnenburg & Kok, On the Semantics of Atomized Statements: The Parallel-Choice Option 1991 8 FCT Kounalis & Rusinowitch, Automatic Proof Methods for Algebraic Specifications 1991 8 FCT Kratsch & Hemachandra, On the Complexity of Graph Reconstruction 1991 8 FCT Levcopoulos & Petersson, An Optimal Adaptive In-Place Sorting Algorithm 1991 8 FCT Louchard & Kenyon & Schott, Data Structures Maxima 1991 8 FCT Martinez, Average-Case Analysis of Equality of Binary Trees Under the BST Probability Model 1991 8 FCT Neraud, On the Subsets of Rank Two in a Free Monoid: A Fast Decision Algorithm 1991 8 FCT Plandowski & Rytter & Szymacha, Exact Analysis of Three Tree Contraction Algorithms 1991 8 FCT Salomaa & Yu, Degrees of Nondeterminism for Pushdown Automata 1991 8 FCT Schroeder & Sykora & Vrto, Optimal Embedding of a Toroidal Array in a Linear Array 1991 8 FCT Uhlig, Boolean Functions with a Large Number of Subfunctions and Small Complexity and Depth 1991 8 FCT Valiveti & Oommen & Zgierski, Adaptive Linear List Reorganisation for a System Processing Set Queries 1991 8 FCT Wanke, On the Decidability of Integer Subgraph Problems on Context-Free Graph Languages 1989 7 FCT Abdulrab & Pecuchet, On Word Equations and Makanin's Algorithm 1989 7 FCT Alvarez & Diaz & Toran, Complexity Classes with Complete Problems between P and NP-C 1989 7 FCT Bartha, Interpretations of Synchronous Flowchart Schemes 1989 7 FCT Bertoni & Bruschi & Joseph & Sitharam & Young, Generalized Boolean Hierarchies and Boolean Hierarchies over RP 1989 7 FCT Bloom, The Equational Logic of Iterative Processes 1989 7 FCT Bodlaender & Moran & Warmuth, The Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous Case 1989 7 FCT Brandstadt, The Jump Number Problem for Biconvex Graphs and Rectangle Covers of Rectangular Regions 1989 7 FCT Brzozowski & Ebergen, Recent Developments in the Design of Asynchronous Circuits 1989 7 FCT Chlebus & Diks & Hagerup & Radzik, New Simulations between CRCW PRAMs 1989 7 FCT Coquide & Dauchet & Tison, About Connections between Syntactical and Computational Complexity 1989 7 FCT Crescenzi & Panconesi, Completeness in Approximation Classes 1989 7 FCT Damm & Meinel, Separating Completely Complexity Classes Related to Polynomial Size Omega-Decision Trees 1989 7 FCT Domosi & Esik & Imreh, On Product Hierarchies of Automata 1989 7 FCT Duris & Pudlak, On the Communication Complexity of Planarity 1989 7 FCT Engelfriet, Context-free NCE Graph Grammars 1989 7 FCT Francon & Randrianarimanana & Schott, Dynamic Data Structures with Finite Population: A Combinatorial Analysis 1989 7 FCT Fulop & Vagvolgyi, Iterated Deterministic Top-down Look-ahead 1989 7 FCT Geniet & Thimonier, Using Generating Functions to Compute Concurrency 1989 7 FCT Gil-Luezas, A Logic for Nondeterministic Functional Programs 1989 7 FCT Graw, Decision Problems and Coxeter Groups 1989 7 FCT Gradel, Complexity of Formula Classes in First Order Logic with Functions 1989 7 FCT Howell & Rosier & Yen, Normal and Sinkless Petri Nets 1989 7 FCT Immerman, Descriptive and Computational Complexity 1989 7 FCT Jukna, The Effect of Null-Chains on the Complexity of Contact Schemes 1989 7 FCT Kinber & Zeugmann, Monte-Carlo Inference and Its Relations to Reliable Frequency Identification 1989 7 FCT Korec, Semilinear Real-time Systolic Trellis Automata 1989 7 FCT Kovacs, Inducibility of the Composition of Frontier-to-Root Tree Transformations 1989 7 FCT Krause & Waack, On Oblivious Branching Programs of Linear Length 1989 7 FCT Liskiewicz & Lorys, Some Time-Space Bounds for One-tape Deterministic Turing Machines 1989 7 FCT Litovsky, Rank of Rational Finitely Generated omega-Languages 1989 7 FCT Maass & Slaman, Extensional Properties of Sets of Time Bounded Complexity 1989 7 FCT Marchetti-Spaccamela & Protasi, Learning under Uniform Distribution 1989 7 FCT Nait Abdallah, An Extended Framework for Default Reasoning 1989 7 FCT Nait Abdallah, Logic Programming of Some Mathematical Paradoxes 1989 7 FCT Orlandic & Pfaltz, Analysis of Compact 0-complete Trees: A New Access Method to Large Databases 1989 7 FCT Salomaa, Representation of Recursively Enumerable Languages Using Alternating Finite Tree Recognizers 1989 7 FCT Seebold, About a Family of Binary Morphisms which Stationary Words are Sturmian 1989 7 FCT Seidl, On the Finite Degree of Ambiguity of Finite Tree Automata 1989 7 FCT Simon, Approximation Algorithms for Channel Assignment in Cellular Radio Networks 1989 7 FCT Skurczynski, The Borel Hierarchy is Infinite in the Class of Regular Sets of Trees 1989 7 FCT Springsteel & Stojmenovic, Parallel General Prefix Computations with Geometric, Algebraic and Other Applications 1989 7 FCT Staiger, Kolmogorov Complexity and Hausdorff Dimension 1989 7 FCT Steinby, Tree Language Problems in Pattern Recognition Theory 1989 7 FCT Sutner, The Computational Complexity of Cellular Automata 1989 7 FCT Turan, On Restricted Boolean Circuits 1989 7 FCT Wanke, The Complexity of Connectivity Problems on Context-free Graph Languages 1989 7 FCT Weihrauch, Constructivity, Computability, and Computational Complexity in Analysis 1987 6 FCT Ablaev, Possibilities of Probabilistic On-line Counting Machines 1987 6 FCT Agibalov, Functional Systems on Semilattices 1987 6 FCT Alekseyev, Recognition of Properties in K-Valued Logic and Approximate Algorithms 1987 6 FCT Alexanyan, Linearized Disjunctive Normal Forms of Boolean Functions 1987 6 FCT Alpin & Kotchkarev & Mubarakzianov, On a Stable Generating of Random Sequences by Probabilistic Automata 1987 6 FCT Alyoshin, Automata Classes Induced by Post Classes 1987 6 FCT Andreev, Effective Lower Bounds for Complexity of Some Classes of Schemes 1987 6 FCT Anisimov & Oleshchuk, Stable Finite Automata Mappings and Church-Rosser Systems 1987 6 FCT Arslanov, The Recursion Theorem, Approximations, and Classifying Index Sets of Recursively Enumerable Sets 1987 6 FCT Astakhov, Duality of Functions and Data in Algorithms Description 1987 6 FCT Babikov, On Direct Methods of Realization of Normal Algorithms by Turing Machines 1987 6 FCT Babin, Verbal Operation on Automaton 1987 6 FCT Barashko, The New Way of Probabilistic Compact Testing 1987 6 FCT Baryshev & Zhil'tzova & Markov, Computational Problems in Alphabetic Coding Theory 1987 6 FCT Bogomolov, On the Synthesis of ``Irredundant'' Automata from a Finite Set of Experiments 1987 6 FCT Bolotov, On Equivalence Problem of States for Cellular Automata 1987 6 FCT Budach, Arsenals and Lower Bounds 1987 6 FCT Bukharajev & enikeev & Makarov, Chain-like Model of Programs Communication 1987 6 FCT Bukharajev & Nasirov, Structor Automata 1987 6 FCT Buyevich, On A-Completeness for Some Classes of Bounded Determinate Functions 1987 6 FCT Cejtlin & Jushchenko, Structure Synthesis of Parallel Programs (Methodology and Tools) 1987 6 FCT Chlebus & Chrobak & Diks, Saturating Flows in Networks 1987 6 FCT Cuhrov, On the Number of DNF Minimal Relatively Arbitrary Measures of Complexity 1987 6 FCT Dassow & Jurgensen, Soliton Automata 1987 6 FCT Enikeev, On Development of Dialogue Concurrent Systems 1987 6 FCT Ermakov & Pokhodszey, Discrete Analogue of the Neumann Method Is Not Optimal 1987 6 FCT Ermakov & Rasulov, A Simplest Probability Model of Asynchronous Iterations 1987 6 FCT Ershov & Goncharov & Sviridenko, Semantic Foundations of Programming 1987 6 FCT Evtushenko, Conditions for Existence of Nontrivial Parallel Decompositions of Sequential Machines 1987 6 FCT Frolov, On the Digital System Diagnostics under Uncertainty 1987 6 FCT Gabbasov, The Implicating Vector Problem and its Applications to Probabilistic and Linear Automata 1987 6 FCT Gasanov, Some Asymptotic Evaluations of Complexity of Information Searching 1987 6 FCT Gashkov, On the Complexity of Approximate Realization of Continuous Functions by Schemes and Formulas in Continuous Bases 1987 6 FCT Gashkov & Sidelnikov, Codes, Connected with a Fraction Linear Functions Group and their Decoding 1987 6 FCT Geidmanis, On the Capabilities of Alternating and Nondeterministic Multitape Automata 1987 6 FCT Gibbons & Rytter, Fast Parallel Algorithms for Optimal Edge-Colouring of Some Tree-structured Graphs 1987 6 FCT Grinchuk, On the Complexity of Elementary Periodical Functions Realized by Switching Circuits 1987 6 FCT Gronau, Efficient Algorithmic Construction of Designs 1987 6 FCT de Groote & Heintz & Mohler & Schmidt, On the Complexity of Lie Algebras 1987 6 FCT Grunsky, A Characterization of Sequential Machines by Means of their Behaviour Fragments 1987 6 FCT Hartmanis, Some Observations About NP Complete Sets 1987 6 FCT Hemmerling, Three-dimensional Traps and Barrages for Cooperating Automata (Extended Abstract) 1987 6 FCT Indermark & Klaeren, Efficient Implementation of Structural Recursion 1987 6 FCT Iordanskii, Minimal Numberings of the Vertices of Trees--Approximate Approach 1987 6 FCT Jantzen & Kudlek & Lange & Person, Dyck_1-Reductions of Context-free Languages 1987 6 FCT Jukna, Information Flow and Width of Branching Programs (Extended Abstract) 1987 6 FCT Karahanjan & Sapozhenko, On Some Operations of Partial Monotone Boolean Function Simplifying 1987 6 FCT Karpova, On Complexity of Computations with Limited Memory 1987 6 FCT Kolyada, On the Problem of Completeness for the Regular Mappings 1987 6 FCT Korshunov, The Number and the Structure of Typical Sperner and k-Non-Separable Families of Subsets of a Finite Set 1987 6 FCT Kossovsky, A Criterion of Polynomial Lower Bounds of Combinational Complexity 1987 6 FCT Kotov & Cherkasova, On Generalized Process Logic 1987 6 FCT Kowalczyk & Urzycyn, Verification of Programs with Higher-order Arrays 1987 6 FCT Kozlovskiy, On the Complexity of Analyzing Experiments for Checking Local Faults of an Automaton 1987 6 FCT Kriegel & Waack, Exponential Lower Bounds for Real-Time Branching Programs 1987 6 FCT Kudrjavtzev, On the Conditions of Supplementicity in Functional Systems 1987 6 FCT Kuzjurin, On ONe Approximate Algorithm for Solving Systems of Linear Inequalities with Boolean Variables 1987 6 FCT Kuznetsov & Nurmeev & Salimov, The Problem of Minimal Implicating Vector 1987 6 FCT Latypov, Built-in Self-Testing of Logic Circuits Using Imperfect Duplication 1987 6 FCT Letichevsky, Algebras with Approximation and Recursive Data Structures 1987 6 FCT Lomazova, Procedural Implementation of Algebraic Specifications of Abstract Data Types 1987 6 FCT Lozkin & Koshkin, On the Complexity of Realizing Some Systems of the Functions of the Algebra of Logic by Contact and Generalized Contact Circuits 1987 6 FCT Lozkin & Semenov, On Construction of a Complete System of Compression Functions and on Complexity of Monotone Realization of Threshold Boolean Functions 1987 6 FCT Matijasevich, Diophantine Complexity 1987 6 FCT Meinel, The Power of Nondeterminism in Polynomial-size Bounded-width Branching Programs 1987 6 FCT Men'shikov & Zuev, Estimation Algorithms of Infinite Graphs Percolation Threshold 1987 6 FCT Mikhailov, A Solving of Problems on Technological Models 1987 6 FCT Mints, Some Formal Systems of the Logic Programming 1987 6 FCT Moshkov, On the Programs with Finite Development 1987 6 FCT Movsisian & Margarian, D-Representing Code Problem Solution 1987 6 FCT Mubarakzianov, Metric Properties of Random Sequence 1987 6 FCT Mukhin, Adaptive Strategies for Partially Observable Controlled Random Series 1987 6 FCT Nasyrov, The Degrees of Nondeterminism in Pushdown Automata 1987 6 FCT Noskov, Statistically Effective Algorithms for Automata Control 1987 6 FCT Pereyaslavsky, Linear Test Procedures of Recognition 1987 6 FCT Perfilyeva, Evaluation of Cardinalities of Some Families of csi-Classes in P_{x_0} 1987 6 FCT Podkolzin, On the Temporal Complexity of Boolean Mappings Realizations in Two-dimensional Homogeneous Automata 1987 6 FCT Podlovcenko, On Approximate Solution of the Problem of Equivalent Transformations of Programs 1987 6 FCT Rajasekaran & Reif, Randomized Parallel Computation 1987 6 FCT Redkin, On Checking Correctness of Some Classes of Control Systems 1987 6 FCT Rystsov, The Parallel Complexity of Some Arithmetic and Algebraic Operations 1987 6 FCT Safarian, On Difficulties of Solving a Problem of Decomposition of the System of Boolean Equations 1987 6 FCT Sapozhenko, The Number of Fuzzy Monotone Functions 1987 6 FCT Sazonov, Bounded Set Theory and Polynomial Computability 1987 6 FCT Selivanov, Index Sets of Factor-Objects of the Post Numbering 1987 6 FCT Shkalikova, On Realization of Boolean Functions by Schemes Consisting of Checked Elements 1987 6 FCT Sholomov, The Complexity of the Sequential Choice Mechanism 1987 6 FCT Soloviev, Nondeterministic Finite Algorithmic Procedures as the Models of Abstract Computability 1987 6 FCT Solovieva, The Reducibility of Random Sequences by Automata 1987 6 FCT Stepanov & Shparlinskiy, On Structure Complexity of Normal Basis of Finite Field 1987 6 FCT Stetsenko, On Comparison of Boolean Bases 1987 6 FCT Stohr, A Tradeoff between Pagenumber and Width of Book Embeddings of Graphs 1987 6 FCT Strogalov, On Metric Properties of Automata and epsilon-Approximation of Automaton Mappings 1987 6 FCT Sumenkov, Algorithmization of Obtaining the Converse Comparison Theorems Based on Solving a Logical Equation 1987 6 FCT Sytnik, Synthesis of Universal Finite Automata 1987 6 FCT Taimanov, On Cartesian Powers of P_2 1987 6 FCT Taimina, Complexity Gaps of Turing Machines on Infinite Words 1987 6 FCT Tel, Distributed Infimum Approximation 1987 6 FCT Thalheim, On the Number of Keys in Relational Databases 1987 6 FCT Ugol'nikov, Complexity and Depth of Formulas Realizing Functions from Closed Classes 1987 6 FCT Uhlig, Reliable Networks from Unreliable Gates with Almost Minimal Complexity 1987 6 FCT Validov, On the Standard and Pseudostandard Star Height of Regular Sets 1987 6 FCT Vassiljev, To Automation of Theorem Synthesis 1987 6 FCT Vorobeva, On Efficiency of Prefix Word-Encoding of Binary Messages 1987 6 FCT Voronkov, Deductive Program Synthesis and Markov's Principle 1987 6 FCT Zacharov & Kuznetsov, Complexity of the Problem of Approximation of Stochastic Matrix by Rational Elements 1987 6 FCT Zakharov, To the Functional Equivalence of Turing Machines 1987 6 FCT Zakhar'yashchev, Theorem Proving in Intermediate and Modal Logics 1987 6 FCT Zakrevskii, The Analysis of Concurrent Logic Control Algorithms 1987 6 FCT Zamov, On a Connection between the Resolution Method and the Inverse Method 1985 5 FCT Alberts, Space Complexity of Alternating Turing Machines 1985 5 FCT Andreka & Guessarian & Nemeti, A Unifying Theorem for Algebraic Semantics and Dynamic Logics 1985 5 FCT Balcazar & Diaz & Gabarro, On Some ``Non-uniform'' Complexity Measures 1985 5 FCT Bauernoppel & Jung, Fast Parallel Vertex Colouring 1985 5 FCT Beauquier, Muller Automata and Bi-infinite Words 1985 5 FCT Beauquier & Thimonier, On Formal Languages, Probabilities, Paging and Decoding Algorithms 1985 5 FCT Brandstadt & Kratsch, On the Restriction of Some NP-Complete Graph Problems to Permutation Graphs 1985 5 FCT Chistov, Fast Parallel Calculation of the Rank of Matrices over a Field of Arbitrary Characteristic 1985 5 FCT Chlebus, Algorithms Solving Path Systems 1985 5 FCT Dauchet & Tison, Decidability of Confluence for Ground Term Rewriting Systems 1985 5 FCT Dunne, Lower bounds on the Complexity of 1-Time Only Branching Programs (Preliminary version) 1985 5 FCT Ehrenfeucht & Hoogeboom & Rozenberg, On Coordinated Rewriting 1985 5 FCT Flajolet, Elements of a General Theory of Combinatorial Structures 1985 5 FCT Fle & Roucairol, A Language Theoretic Approach to Serialization Problem in Concurrent Systems 1985 5 FCT Frandsen, Logic Programming and Substitutions 1985 5 FCT Gundermann, A Lower Bound on the Oscillation Complexity of Context-free Languages 1985 5 FCT Jung, Depth Efficient Transformations of Arithmetic into Boolean Circuits 1985 5 FCT Kemp, Free Cost Measures of Trees 1985 5 FCT Korshunov, Discrete Extremal Problems on Covering 1985 5 FCT Koubek & Krsnakova, Parallel Algorithms for Connected Components in a Graph 1985 5 FCT Kramosil, Statistical Testing of Finite Sequences Based on Algorithmic Complexity 1985 5 FCT Kriegel & Waack, Lower Bounds for Boolean Formulae of Depth 3 and the Topology of the n-Cube Membership Problem 1985 5 FCT Lange & Welzl, String Grammars with Disconnecting 1985 5 FCT van Leeuwen & Wiedermann, Array Processing Machines 1985 5 FCT Levcopoulos, A Fast Heuristic for Covering Polygons by Rectangles 1985 5 FCT Makanin, On the Decidability of the Theory of Free Groups (Russian) 1985 5 FCT Margolis & Pin, Products of Group Languages 1985 5 FCT Monien, The Complexity of Embedding Graphs into Binary Trees 1985 5 FCT Nait Abdallah, On Some Topological Properties of Logic Programs 1985 5 FCT Nelson, Recent Results on Continuous Ordered Algebras 1985 5 FCT Nigmatullin, Are Lower Bounds on the Complexity Lower Bounds for Universal Circuits? 1985 5 FCT Reif, Probabilistic Algorithms in Group Theory 1985 5 FCT Reutenauer, Recent Results on Codes 1985 5 FCT Rosier & Yen, A Multiparameter Analysis of the Boundedness Problem for Vector Addition Systems 1985 5 FCT Rozoy, About Two-way Transducers 1985 5 FCT Rytter, Parallel Time O(log n) Recognition of Unambiguous CFLs 1985 5 FCT Sachs, On Colour Critical Graphs 1985 5 FCT Seebold, Generalized Thue-Morse Sequences 1985 5 FCT Seese, Tree-Partite Graphs and the Complexity of Algorithms 1985 5 FCT Seidl, A Quadratic Regularity Test for Non-deleting Macro s Grammars 1985 5 FCT Tarlecki & Wirsing, Continuous Abstract Data Types: Basic Machinery and Results 1985 5 FCT Vardanian, On the Length of Single Dynamic Tests for Monotone Boolean Functions 1985 5 FCT Viennot, Enumerative Combinatorics and Algebraic Languages 1985 5 FCT Voelkel, On Several Kinds of Space-Bounded On-line Multicounter Automata 1985 5 FCT Vogler, Iterated Linear Control and Iterated One-Turn Pushdowns 1985 5 FCT Wechsung, On the Boolean Closure of NP 1985 5 FCT Wegener, The Critical Complexity of All (Monotone) Boolean Functions and Monotone Graph Properties 1985 5 FCT Zink, Degeneration of Shimura Surfaces and a Problem in Coding Theory 1985 5 FCT Passy & Tinchev, Quantifiers in Combinatory PDL: Completeness, Definability, Incompleteness 1985 5 FCT Degano & De Nicola & Montanari, Partial Ordering Derivations for CCS 1985 5 FCT Mehlhorn & Simon, Intersecting Two Polyhedra One of Which is Convex 1983 4 FCT Abramsky, Experiments, Powerdomains and Fully Abstract Models for Applicative Multiprogramming 1983 4 FCT Berman, Deterministic Dynamic Logic of Recursive Programs is Weaker than Dynamic Logic 1983 4 FCT Brandstadt & Wagner, Reversal-bounded and Visit-bounded Realtime Computations 1983 4 FCT Braunmuhl & Verbeek, Input-driven Languages are Recognized in log n Space 1983 4 FCT Chazelle, How to Search in History 1983 4 FCT Constable, Constructive Mathematics as a Programming Logic I: Some Principles of Theory 1983 4 FCT Cook, The Classification of Problems Which Have Fast Parallel Algorithms 1983 4 FCT Costa & Stirling, A Fair Calculus of Communicating Systems 1983 4 FCT Culik & Welzl, Two Way Finite State Generators 1983 4 FCT de Nicola, A Complete Set of Axioms for a Theory of Communicating Sequential Processes 1983 4 FCT Fischer, The Consensus Problem in Unreliable Distributed Systems (A Brief Survey) 1983 4 FCT Flajolet, Methods in the Analysis of Algorithms: Evaluations of a Recursive Partitioning Process 1983 4 FCT Freivalds, Space and Reversal Complexity of Probabilistic One-way Turing Machines 1983 4 FCT Furst & Lipton & Stockmeyer, Pseudorandom Number Generation and Space Complexity 1983 4 FCT Harel, Recurring Dominoes: Making the Highly Undecidable Highly Understandable 1983 4 FCT Harel & Sherman, Propositional Dynamic Logic of Flowcharts 1983 4 FCT Hertel & Mehlhorn, Fast Triangulation of Simple Polygons 1983 4 FCT Itzhaik & Yehudai, On Containment Problems for Finite-turn Languages 1983 4 FCT Janiga & Koubek, On Languages Generated by Semigroups 1983 4 FCT Langmaack, Aspects of Programs with Finite Modes 1983 4 FCT Leighton & Rivest, Estimating a Probability Using Finite Memory 1983 4 FCT Lingas, The Greedy and Delauney Triangulations are not Bad in the Average Case 1983 4 FCT Lingas, Minimum Weight Geometric Triangulation of Multi-connected Polygons is NP-Complete 1983 4 FCT Macintyre, Decision Problems for Exponential Rings: The p-adic Case 1983 4 FCT Main & Benson, Functional Behaviour of Nondeterministic Programs 1983 4 FCT Mehlhorn & Schmidt, A Single Source Shortest Path Algorithm for Graphs with Separators 1983 4 FCT Miller, Isomorphism Testing and Canonical Forms for k-Contractable Graphs (A Generalization of Bounded Valence and Bounded Genus) 1983 4 FCT Ochranova, Finding Dominators 1983 4 FCT Orejas, Characterizing Composability of Abstract Implementations 1983 4 FCT Parikh, Propositional Logics of Programs: New Directions 1983 4 FCT Protasi, A New Probabilistic Model for the Study of Algorithmic Properties of Random Graph Problems 1983 4 FCT Regan, On Diagonalization Methods and the Structure of Language Classes 1983 4 FCT Reischuk, A New Solution for the Byzantine Generals Problem 1983 4 FCT Rodding, Modular Decomposition of Automata 1983 4 FCT Sannella & Wirsing, A Kernel Language for Algebraic Specification and Implementation 1983 4 FCT Shamir & Upfal, A Fast Construction of Disjoint Paths in Communication Networks 1983 4 FCT Simon, A Tight Omega(log log n)-Bound on the Time for Parallel RAM's to Compute Nondegenerated Boolean Functions 1983 4 FCT Smith, The Identification of Propositions and Types in Martin-Lof's Type-Theory: A Programming Example 1983 4 FCT Szepietowski, Remarks on Searching Labyrinths by Automata 1983 4 FCT Tison & Dauchet & Comyn, Metrical and Ordered Properties of Powerdomains 1983 4 FCT Trum & Wotschke, Economy of Description for Program Schemes 1983 4 FCT Ukkonen, On Approximate String Matching 1983 4 FCT Urzyczyn, Deterministic Context-free Dynamic Logic is More Expressive than Deterministic Dynamic Logic of Regular Programs 1983 4 FCT Winskel, A Note on Powerdomains and Modality 1983 4 FCT Park, Reasoning with Fairness Constraints 1981 3 FCT Adamek, Observability and Nerode Equivalence in Concrete Categories 1981 3 FCT Andreka & Nemeti, Some Universal Algebraic and Model Theoretic Results in Computer Science 1981 3 FCT Ausiello & Marchetti-Spaccamela & Protasi, Probabilistic Analysis of the Performance of Greedy Strategies over Different Classes of Combinatorial Problems 1981 3 FCT Babai, Moderately Exponential Bound for Graph Isomorphism 1981 3 FCT Bartha, An Algebraic Definition of Attributed Transformations 1981 3 FCT Brandenburg, Analogies of PAL and COPY 1981 3 FCT Burmeister, Quasi-Equational Logic for Partial Algebras 1981 3 FCT Csakany, Homogeneity and Completeness 1981 3 FCT Daley, On the Error Correcting Power of Pluralism in Inductive Inference 1981 3 FCT Dassow, Equality Languages and Language Families 1981 3 FCT Demetrovics & Katona, Extremal Combinatorial Problems in Relational Data Base 1981 3 FCT Ehrich, Specifying Algebraic Data Types by Domain Equations 1981 3 FCT Esik, An Axiomatization of Regular Forests in the Language of Algebraic Theories with Iteration 1981 3 FCT Goralcik & Goralcikova & Koubek & Rodl, Fast Recognition of Rings and Lattices 1981 3 FCT Huwig, A Definition of the P=NP-Problem in Categories 1981 3 FCT Janssens & Rozenberg, Generating Graph Languages Using Hypergraph Grammars 1981 3 FCT Jaromczyk, Lower Bounds for Problems Defined by Polynomial Inequalities 1981 3 FCT Kaphengst, What is Computable for Abstract Data Types? 1981 3 FCT Karhumaki, On Strongly Cube-free omega-words Generated by Binary Morphisms 1981 3 FCT Kleijn & Rozenberg, On the Role of Selectors in Selective Substitution Grammars 1981 3 FCT Kleine Buning, Classes of Functions over Binary Trees 1981 3 FCT Korte & Lovasz, Mathematical Structures Underlying Greedy Algorithms 1981 3 FCT Kortelainen, Some Properties of Language Families Generated by Commutative Languages 1981 3 FCT Kucera & Trnkova, Isomorphism Completeness for Some Algebraic Structures 1981 3 FCT Leguy, Reducing Algebraic Tree Grammars 1981 3 FCT Leguy, Rational Cone and Substitution 1981 3 FCT Linna, On the Regularity Problem of SF-Languages Generated by Minimal Linear Grammars 1981 3 FCT Merzenich, Co-Algebras as Machines for the Interpretations of Flow Diagrams 1981 3 FCT Meyer auf der Heide & Rollik, Random Access Machines and Straight-line Programs 1981 3 FCT Monien, On the LBA Problem 1981 3 FCT Nemeti, Dynamic Algebras of Programs 1981 3 FCT Nijholt, The Equivalence Problem for LL- and LR-Regular Grammars 1981 3 FCT Poigne, Context-free Languages of Infinite Words as Least Fixpoints 1981 3 FCT Proszynski, Remarks on the Notion of Concurrency Relation in the Case of Systems 1981 3 FCT Pultr, On the Size of Conjunctive Representations of n-ary Relations 1981 3 FCT Rozenberg, On Subwords of Formal Languages 1981 3 FCT Sain, First Order Dynamic Logic with Decidable Proofs and Workable Model Theory 1981 3 FCT Seese, Elimination of Second-Order Quantifiers for Well-founded Trees in Stationary Logic and Finitely Determinate Structures 1981 3 FCT Starke, Processes in Petri Nets 1981 3 FCT Steinby, Some Algebraic Aspects of Recognizability and Rationality 1981 3 FCT Sudborough, Pebbling and Bandwidth 1981 3 FCT Turan, On Cellular Graph-Automata and Second-Order Definable Graph-Properties 1981 3 FCT Vinarek, Extensions of Symmetric hom-Functors to the Kleisli Category 1981 3 FCT Beauquier, A New Operation between Languages 1981 3 FCT Borger, Logical Description of Computation Processes 1981 3 FCT Grabowski, An Algorithm to Identify Slices, with Applications to Vector Replacement Systems 1981 3 FCT Hoffman, One Pebble Does Not Suffice to Search Plane Labyrinths 1981 3 FCT Meinel, About the by Codings of Environments Induced Posets [U_z,<=] and [L_z,<=] 1981 3 FCT Mostowski, The Complexity of Automata and Subtheories of Monadic Second Order Arithmetics 1981 3 FCT Waack, Tape Complexity of Word Problems 1979 2 FCT Hemmerling, Concentration of Multidimensional Tape-Bounded Systems of Turing Automata and Cellular Spaces 1979 2 FCT Kanovic, A Complexity Version of Goedel's Incompleteness Theorem 1979 2 FCT Janiga, Real-Time Computations of Two-Way Multihead Finite Automata 1979 2 FCT Kozen, Automata and Planar Graphs 1979 2 FCT Lipton, On the Consistency of P=NP and Fragments of Arithmetic 1979 2 FCT Lovasz, On Determinants, Matchings, and Random Algorithms 1979 2 FCT Paul, Kolmogorov Complexity and Lower Bounds 1979 2 FCT Antelmann & Budach & Rollik, Universal Traps 1979 2 FCT Danecki & Karpinski, Decidability Results on Plane Automata Searching Mazes 1977 1 FCT Alpin & Bukharajev, Methodology of Proving a Finite-State Stochastic Representability and Nonrepresentability 1977 1 FCT Arnold & Nivat, Non Deterministic Recursive Program Schemes 1977 1 FCT Bednarek & Ulam, Some Remarks on Relational Composition in Computational Theory and Practice 1977 1 FCT Bergstra & Ollongren & van der Weide, An Axiomatization of the Rational Data Objects 1977 1 FCT Berstel, Some Recent Results on Recognizable Formal Power Series 1977 1 FCT Blattner & Ginsburg, Canonical Forms of Context-Free Grammars and Position Restricted Grammar Forms 1977 1 FCT Budach, Environments, Labyrinths and Automata 1977 1 FCT Coy, Automata in Labyrinths 1977 1 FCT Daduna, Stochastic Algebras and Stochastic Automata over General Measurable Spaces: Algebraic Theory and a Decomposition Theorem 1977 1 FCT Dassow, Some Remarks on the Algebra of Automaton Mappings 1977 1 FCT Ehrich, Algebraic Semantics of Type Definitions and Structured Variables 1977 1 FCT Gecseg, Universal Algebras and Tree Automata 1977 1 FCT Janicki, Vectors of Coroutines over Blikle Nets 1977 1 FCT Kaphengst & Reichel, Initial Algebraic Semantics for Non Context-Free Languages 1977 1 FCT Knast & Martinek, Reading Functions and an Extension of Kleene Theorem for Some Families of Languages 1977 1 FCT Mostowski, Operations on omega-Regular Languages 1977 1 FCT Nagl, On the Relation between Graph Grammars and Graph L-Systems 1977 1 FCT Perrot, On the Theory of Syntactic Monoids for Rational Languages 1977 1 FCT Roytberg, The Equivalence of Schemata with Some Feedbacks 1977 1 FCT Shyr & Thierrin, Disjunctive Languages and Codes 1977 1 FCT Wechler, Families of R-Fuzzy Languages 1977 1 FCT Winkowski, Algebras of Partial Sequences--A Tool to Deal with Concurrency 1977 1 FCT Adamek & Koubek, Remarks on Fixed Points of Functors 1977 1 FCT Adamek & Trnkova, Recognizable and Regular Languages in a Category 1977 1 FCT Arbib, Free Dynamics and Algebraic Semantics 1977 1 FCT Arbib & Manes, Efficient State-Splitting 1977 1 FCT Littrich & Merzenich, Nets over Many Sorted Operator Domains and their Semantics 1977 1 FCT Ehrig, Embedding Theorems in the Algebraic Theory of Graph Grammars 1977 1 FCT Elgot, Some ``Geometrical'' Categories Associated with Flowchart Schemes 1977 1 FCT Hoehnke, On Partial Recursive Definitions and Programs 1977 1 FCT Kreowski, Transformations of Derivation Sequences in Graph Grammars 1977 1 FCT Kurka, Applicability of a Production in a Categorical Grammar 1977 1 FCT Meseguer, On Order-Complete Universal Algebra and Enriched Functorial Semantics 1977 1 FCT Obtulowicz, Functorial Semantics of the Type lambda-beta nu Calculus 1977 1 FCT Reiterman, A More Categorical Model of Universal Algebra 1977 1 FCT Schneider, Graph Grammars 1977 1 FCT Tiuryn, Fixed Points and Algebras with Infinitely Long Expressions, II 1977 1 FCT Trnkova, Relational Automata in a Category and their Languages 1977 1 FCT Wiweger, Generalized Linton Algebras 1977 1 FCT Belaga, On Analysis of Protoschemes 1977 1 FCT Buchi, Using Determinancy of Games to Eliminate Quantifiers 1977 1 FCT Cenzer, Non-Generable RE Sets 1977 1 FCT Frumkin, Polynomial Time Algorithms in the Theory of Linear Diophantine Equations 1977 1 FCT Hirschberg, Complexity of Common Subsequence Problems 1977 1 FCT Horvath, Complexity of Sequence Encodings 1977 1 FCT Hotz & Stadel, Network Complexity 1977 1 FCT Kanovic, On Computability of Kolmogorov Complexity 1977 1 FCT Karpinski, The Equivalence Problems for Binary E0L-Systems are Decidable 1977 1 FCT Kinber, On a Theory of Inductive Inference 1977 1 FCT Kreczmar, On Finite and Infinite Computations 1977 1 FCT Kucera, Expected Behavior of Graph Coloring Algorithms 1977 1 FCT Lipski, Two NP-Complete Problems Related to Information Retrieval 1977 1 FCT Muldner, On Properties of Certain Synchronizing Tool for Parallel Computations 1977 1 FCT Munro, The Parallel Complexity of Arithmetic Computation 1977 1 FCT Norris, Maximal Rectangular Relations 1977 1 FCT Nesetril & Pultr, A Dushnik-Miller Type Dimension of Graphs and its Complexity 1977 1 FCT Radziszowski, Programmability and P = NP Conjecture 1977 1 FCT Salwicki, An Algorithmic Approach to Set Theory 1977 1 FCT Seese, Decidability of omega-Trees with Bounded Sets--A Survey 1977 1 FCT Staiger, Empty-Storage-Acceptance of omega-Languages 1977 1 FCT Siefkes, Degrees of Circuit Complexity 1977 1 FCT Wagner, Recursive omega-Languages 1977 1 FCT Weihrauch, A Generalized Computability Thesis 1990 FDPP Backhouse, Constructive Type Theory: A Perspective from Computing Science 1990 FDPP Gries, The Maximum-Segment-Sum Problem 1990 FDPP Gries & van de Snepscheut, Inorder Traversal of a Binary Tree and its Inversion 1990 FDPP Gries, A Hands-in-the-Pocket Presentation of a k-Majority Vote Algorithm 1990 FDPP van Gasteren, A Small Problem on Rectangles 1990 FDPP van Gasteren, On the Formal Derivation of a Proof of the Invariance Theorem 1990 FDPP van Gasteren, A Problem on Bichrome 6-Graphs 1990 FDPP Martin, Formal Program Transformations for VLSI Circuit Synthesis 1990 FDPP Morris, Programs from Specifications 1990 FDPP Morris, Piecewise Data Refinement 1990 FDPP Feijen, Exercises in Formula Manipulation 1990 FDPP Rem, Multiplication and Division of Polynomials 1990 FDPP Rem & Verhoeff, A Parallel Program that Generates the Mobius Sequence 1990 FDPP van de Snepscheut, Distribution and Inversion of Warshall's Algorithm 1990 FDPP van de Snepscheut, A Distributed Algorithm for Mutual Exclusion: An Experimental Presentation 1990 FDPP Dijkstra, The Derivation of a Proof by J. C. S. P. van der Woude 1990 FDPP Dijkstra, Fillers at the YoP Institute 1990 FDPP Gries, Influences (or Lack Thereof) of Formalism in Teaching Programming and Software Engineering 1995 2 FEASMATH Ajtai, On the Existence of modulo p Cardinality Functions 1995 2 FEASMATH Bellantoni, Predicative Recursion and The Polytime Hierarchy 1995 2 FEASMATH Bonet & Buss & Pitassi, Are there Hard Examples for Frege Systems? 1995 2 FEASMATH Buss, On Godel's Theorems on Lengths of Proofs II: Lower Bounds for Recognizing k Symbol Provability 1995 2 FEASMATH Cenzer & Remmel, Feasibly Categorical Abelian Groups 1995 2 FEASMATH Clote & Takeuti, First Order Bounded Arithmetic and Small Boolean Circuit Complexity Classes 1995 2 FEASMATH Downey & Fellows, Parameterized Computational Feasibility 1995 2 FEASMATH Karchmer, On Proving Lower Bounds for Circuit Size 1995 2 FEASMATH Khoussainov & Nerode, Effective Properties of Finitely Generated R. E. Algebras 1995 2 FEASMATH Krajicek, On Frege and Extended Frege Proof Systems 1995 2 FEASMATH Leivant, Ramified Recurrence and Computational Complexity I: Word Recurrence and Poly-time 1995 2 FEASMATH Razborov, Bounded Arithmetic and Lower Bounds in Boolean Complexity 1995 2 FEASMATH Schwichtenberg & Wainer, Ordinal Bounds for Programs 1995 2 FEASMATH Seth, Turing Machine Characterizations of Feasible Functionals of All Finite Types 1995 2 FEASMATH Verbrugge, The Complexity of Feasible Interpretability 1990 1 FEASMATH Ajtai, Parity and the Pigeonhole Principle 1990 1 FEASMATH Blum, Computing over the Reals (or an Arbitrary Ring) (Abstract) 1990 1 FEASMATH Buss, On Model Theory for Intuitionistic Bounded Arithmetic with Applications to Independence Results 1990 1 FEASMATH Clote, Sequential, Machine Independent Characterizations of the Parallel Complexity Classes AlogTIME, AC^k, NC^k and NC 1990 1 FEASMATH Cook & Kapron, Characterizations of the Basic Feasible Functions of Finite Type 1990 1 FEASMATH Cook & Urquhart, Functional Interpretations of Feasibly Constructive Arithmetic -- Abstract 1990 1 FEASMATH Crossley & Remmel, Polynomial-time Combinatorial Operators are Polynomials 1990 1 FEASMATH Dekker, Isols and Kneser Graphs 1990 1 FEASMATH Ferreira, Stockmeyer Induction 1990 1 FEASMATH Foy & Woods, Probabilities of Sentences about Two Linear Orderings 1990 1 FEASMATH Girard & Scedrov & Scott, Bounded Linear Logic: A Modular Approach to Polynomial Time Computability, Extended Abstract 1990 1 FEASMATH Gurevich, On Finite Model Theory (Extended Abstract) 1990 1 FEASMATH Hoover, Computational Models for Feasible Real Analysis 1990 1 FEASMATH Ko, Inverting a One-to-One Real Function is Inherently Sequential 1990 1 FEASMATH Krajicek & Takeuti, On Bounded Sigma_1^1 Polynomial Induction 1990 1 FEASMATH Leivant, Subrecursion and Lambda Representation over Free Algebras (Preliminary Summary) 1990 1 FEASMATH Nerode & Remmel, Complexity-Theoretic Algebra: Vector Space Bases 1990 1 FEASMATH Remmel, When is every Recursive Linear Ordering of Type mu Recursively Isomorphic to a Polynomial Time Linear Ordering over the Natural Numbers in Binary Form? 1996 2 FFAPS Ganz, Binary Representations of Finite Fields and Their Application to Complexity Theory 1996 2 FFAPS Niederreiter, Improved Bounds in the Multiple-Recursive Matrix Method for Pseudorandom Number and Vector Generation 1993 FFCTACC Cohen, Primitive Elements and Polynomials: Existence Results 1993 FFCTACC Flahive & Niederreiter, On Inversive Congruential Generators for Pseudorandom Numbers 1993 FFCTACC Gomez-Calderon, A Special Class of Permutation Polynomials over Finite Fields 1993 FFCTACC Mullen, Permutation Polynomials over Finite Fields 1993 FFCTACC Niederreiter, Recent Advances in the Theory of Finite Fields 1993 FFCTACC Faure, Suggestions for Quasi-Monte-Carlo Users 1993 FFCTACC Gewali & Lombardo, Watchman Routes for a Pair of Convex Polygons 1993 FFCTACC Goertzel, On the Structural Complexity of Sequences, Images, and Automata 1993 FFCTACC Kwon & Latifi & Zheng, Average Distance of Data Communication in Twisted Hypercubes 1993 FFCTACC Miel, Linear Algebraic Structures of Algorithmic Mappings on Array Processors 1993 FFCTACC Niederreiter, Finite Fields and Cryptology 1993 FFCTACC Niederreiter, Finite Fields, Pseudorandom Numbers, and Quasirandom Points 1993 FFCTACC Varghese & Mohan, Tree Coding and IFS Fractals 1993 FFCTACC Webb, Cryptography Using Complementing Subsets of Polynomials over Finite Fields 1993 FFCTACC Yfantis & Baker & Gallitano, An Image Compression Algorithm and Its Implementation 1994 2 FFTAA Cohen, Polynomial Factorisation, Graphs, Designs and Codes 1994 2 FFTAA Fellows & Koblitz, Conbinatorial Cryptosystems Galore! 1994 2 FFTAA Figueroa & Salzberg & Shiue, A Family of Cryptosystems Based on Combinatorial Properties of Finite Geometries 1994 2 FFTAA Gao & von zur Gathen, Berlekamp's and Niederreiter's Polynomial Factorization Algorithms 1994 2 FFTAA Langevin, Some Sequences with Good Autocorrelation Properties 1994 2 FFTAA Matthews, Strong Pseudoprimes and Generalized Carmichael Numbers 1994 2 FFTAA Niederreiter, New Deterministic Factorization Algorithms for Polynomials over Finite Fields 1994 2 FFTAA Odlyzko, Discrete Logarithms and Smooth Polynomials 1994 2 FFTAA Pless, Parents, Children, Neighbors and the Shadow 1994 2 FFTAA Qu & Vanstone, The Knapsack Problem in Cryptography 1994 2 FFTAA Odlyzko, Interpolating Polynomial Problem 1994 32 FIBQ Packard & Packard, The Order of a Perfect k-Shuffle 1994 32 FIBQ Korntved, Extensions to the GCD Star of David Theorem 1993 31 FIBQ Queen, Palindromes 1992 30 FIBQ Tsangaris & Jones, An Old Theorem on the GCD and Its Application 1992 30 FIBQ DeTemple, The Triangle of Smallest Perimeter which Circumscribes a Semicircle 1992 30 FIBQ Liu, A Matrix Method To Solve Linear Recurrences with Constant Coefficients 1992 30 FIBQ Hodgson, On Some Number Sequences Related to the Parity of Binomial Coefficients 1992 30 FIBQ Kuhn & Vogt, Numbers without Ones 1992 30 FIBQ Knopfmacher, Elementary Properties of the Subtractive Euclidean Algorithm 1978 16 FIBQ Knuth & Paterson, Identities from Partition Involutions 1984 FINNSCHOOL Back & Kurki-Suonio, A Case Study in Constructing Distributed Algorithms: Distributed Exchange Sort 1984 FINNSCHOOL Back & Rantanen, A Case Study in Program Modification: Generalizing Lindstrom's Tree Marking Algorithm 1984 FINNSCHOOL Grahne, Information Incompleteness in Databases 1984 FINNSCHOOL Husberg, A Structural Model for Programming Languages 1984 FINNSCHOOL Karhumaki, The Ehrenfeucht Conjecture: A Compactness Claim for Finitely Generated Free Monoids 1984 FINNSCHOOL Koskimies, A Note on One-Pass Evaluation of Attribute Grammars 1984 FINNSCHOOL Mannila, On the Complexity of the Inference Problem for Subclasses of Inclusion Dependencies 1984 FINNSCHOOL Orponen, General Nonrelativizability Results for Parallel Models of Computation 1984 FINNSCHOOL Penttonen & Katajainen, Notes on the Complexity of Sorting in Abstract Machines 1984 FINNSCHOOL Raiha & Tirri, Towards a Theory of Online Schedulers 1984 FINNSCHOOL Saikkonen & Ronn, Distributed Ring Computations 1984 FINNSCHOOL Tamminen, On Search by Address Computation 1984 FINNSCHOOL Tarhio, Top-down and Bottom-up Attributed Grammars 1984 FINNSCHOOL Ukkonen, A Lower Bound Technique with Applications to the Knapsack Problem 1984 FINNSCHOOL Lausen & Soisalon-Soininen & Widmayer, Maximal Concurrency by Locking 1993 1 FIWAC Honkala, A Lower Bound on Binary Codes with Covering Radius One 1993 1 FIWAC Lobstein & Pless, The Length Function: A Revised Table 1993 1 FIWAC Delos & Quisquater, Efficient Multi-Signature Schemes for Cooperating Entities 1993 1 FIWAC Naccache & M'Raihi, Montgomery-suitable Cryptosystems 1993 1 FIWAC Blundo & De Santis & Gargano & Vaccaro, Secret Sharing Schemes with Veto Capabilities 1993 1 FIWAC Tillich & Zemor, Group-theoretic Hash Functions 1993 1 FIWAC Barg, On Small Families of Sequences with Low Periodic Correlation 1993 1 FIWAC Kovalov, Some Restrictions on Distance Distribution of Optimal Binary Codes 1993 1 FIWAC Litsyn & Vardy, Two New Upper Bounds for Codes of Distance 3 1995 8 FJCCCS Chen & Ko & Lih, Equitable and m-Bounded Coloring of Split Graphs 1995 8 FJCCCS Rolland, Four Coloriing for a Subset of Maximal Planar Graphs with Minimum Degree Five 1995 8 FJCCCS Matsui & Matsui, Enumeration Algorithm for the Edge Coloring Problem on Bipartite Graphs 1995 8 FJCCCS Hsu, On-Line Recognition of Interval Graphs in O(m + n log n) Time 1995 8 FJCCCS Chen & Chang, Connected Proper Interval Graphs and the Guard Problem in Spiral Polygons 1995 8 FJCCCS Yeh & Chang, Weighted Connected Domination and Steiner Trees in Distance-Hereditary Graphs 1995 8 FJCCCS Bezrukov & Kaderali & Poguntke, On Central Spanning Trees of a Graph 1995 8 FJCCCS Lin & Lin & Shyu, Complete Bipartite Decompositions of Crowns, with Applications to Complete Directed Graphs 1995 8 FJCCCS Bampis & Hell & Manoussakis & Rosenfeld, Finding an Antidirected Hamiltonian Path Starting with a Forward Arc from a Given Vertex of a Tournament 1995 8 FJCCCS Deza & Huang, Complementary l_1-Graphs and Related Combinatorial Structures 1995 8 FJCCCS Fukuda & Prodon, Double Description Method Revisited 1995 8 FJCCCS Deza & Deza & Fukuda, On Skeletons, Diameters and Volumes of Metric Polyhedra 1995 8 FJCCCS Caseau & Laburthe, Improving Branch and Bound for Jobshop Scheduling with Constraint Propagation 1995 8 FJCCCS Klinz & Woeginger, A New Efficiently Solvable Special Case of the Three-Dimensional Axial Bottlenect Assignment Problem 1995 8 FJCCCS Jaam, Ramsey Numbers by Stochastic Algorithms with New Heuristics 1995 8 FJCCCS Chedid, On the Hybrid Neural Network Model for Solving Optimization Problems 1995 8 FJCCCS Demange & Paschos, Constructive-Non-constructive Approximation and Maximum Independent Set Problem 1995 8 FJCCCS Takabatake, Weakly Greedy Algorithm and Pair-Delta-Matroids 1995 8 FJCCCS Marcus & Sebo, On Integer Multiflows and Metric Packings in Matroids 1995 8 FJCCCS Hu & Morgenthaler, Optimum Alphabetic Binary Trees 1995 8 FJCCCS Sole & Tillich, Block Codes for Dyadic Phase Shift Keying 1995 8 FJCCCS Patrou, Zigzag Codes and Z-Free Hulls 1995 8 FJCCCS Bouchitte & Hilali & Jegou & Rampon, Contiguity Orders 1995 8 FJCCCS Bekesi & Galambos & Pferschy & Woeginger, Worst-Case Analysis for On-Line Data Compression 1995 8 FJCCCS Bermond & Kodate & Perennes, Gossiping in Cayley Graphs by Packets 1995 8 FJCCCS Andreae & Nolle & Rempel & Schreiber, On Embedding 2-Dimensional Toroidal Grids into de Bruijn Graphs with Clocked Congestion One 1995 8 FJCCCS Moussouni & Lavault, N-Cube String Matching Algorithm with Long Texts 1995 8 FJCCCS Lennerstad & Lundberg, Combinatorics for Multiprocessor Scheduling Optimization and Other Contexts in Computer Architecture 1995 8 FJCCCS Euler & Lemarchand, Some Applications of Combinatorial Optimization in Parallel Computing 1995 8 FJCCCS Bampis & Manoussakis & Milis, On the Parallel Complexity of the Alternating Hamiltonian Cycle Problem 1995 8 FJCCCS Petreschi & Sterbini, Threshold Graphs and Synchronization Protocols 1995 8 FJCCCS Milis, Task Assignment in Distributed Systems Using Network Flow Methods 1995 8 FJCCCS Nace & Carlier, Distributed Rerouting in DCS Mesh Networks 1980 FLANGTH Ginsburg, Methods for Specifying Families of Formal Languages--Past-Present-Future 1980 FLANGTH Brzozowski, Open Problems about Regular Languages 1980 FLANGTH Autebert & Boasson, Generators of Cones and Cylinders 1980 FLANGTH Autebert & Beauquier & Boasson & Latteux, Very Small Families of Algebraic Nonrational Languages 1980 FLANGTH Goldstine, Formal Languages and their Relation to Automata: What Hopcroft & Ullman Didn't Tell Us 1980 FLANGTH Salomaa, Morphisms on Free Monoids and Language Theory 1980 FLANGTH Culik, Homomorphisms: Decidability, Equality and Test Sets 1980 FLANGTH Rozenberg, A Survey of Results and Open Problems in the Mathematical Theory of L Systems 1980 FLANGTH Engelfriet, Some Open Questions and Recent Results on Tree Transducers and Tree Languages 1980 FLANGTH Monien & Sudborough, The Interface between Language Theory and Complexity Theory 1980 FLANGTH Aho, Pattern Matching in Strings 1980 FLANGTH Huet & Oppen, Equations and Rewrite Rules: A Survey 1980 FLANGTH Beauquier & Nivat, Application of Formal Language Theory to Problems of Security and Synchronization 1991 FMLDESC Mosses, A Practical Introduction to Denotational Semantics 1991 FMLDESC Astesiano, Inductive and Operational Semantics 1991 FMLDESC Bjorner, Specification and Transformation. Methodology Aspects of the Vienna Development Method -- Towards a Meaning of `M' in VDM 1991 FMLDESC Wirsing, Algebraic Specification: Semantics, Parameterization and Refinement 1991 FMLDESC Broy, Formalization of Distributed, Concurrent, Reactive Systems 1991 FMLDESC Apt & Olderog, Introduction to Program Verification 1991 FMLDESC Cardelli, Typeful Programming 1996 6 FMPSC Fleury & Fraigniaud, Analysis of Deadlock-Free Path-Based Wormhole Multicasting in Meshes in Case of Contentions 1996 6 FMPSC Wang & Tseng & Ho, Efficient Multicast in Wormhole-Routed 2D Mesh/Torus Multicomputers: A Network-Partitioning Approach 1996 6 FMPSC Fan & King, Turn Grouping for Efficient Multicast in Wormhole Mesh Networks 1996 6 FMPSC Grama & Kumar & Ranka & Singh, A^3: A Simple and Asymptotically Accurate Model for Parallel Computation 1996 6 FMPSC Johnson & Yoon, A Fair Fast Distributed Concurrent-Reader Exclusive-Writer Synchronization 1996 6 FMPSC Fu & Tzeng, Lock Improvement Technique for Release Consistency in Distributed Shared Memory Systems 1996 6 FMPSC Shah & Fortes, A Quasi-Barrier Technique to Improve Performance of an Irregular Application 1996 6 FMPSC Bhatia & Youssef, Performance Analysis and Fault Tolerance of Randomized Routing on Clos Networks 1996 6 FMPSC Wisniewski & Cormen & Sundquist, Performing BMMC Permutations in Two Passes through the Expanded Delta Network and MasPar MP-2 1996 6 FMPSC Yeh & Varvarigos, Macro-Star Networks: Efficient Low-Degree Alternatives to Star Graphs for Large-Scale Parallel Architectures 1995 5 FMPSC Syu & Lang & Hua, Efficient Parallelizations of a Competitive Learning Algorithm for Text Retrieval on the MasPar 1995 5 FMPSC Bae & Ranka, Parallelization of Two Breadth-First Search-Based Algorithms Using Different Message-Passing Paradigms: An Experimental Evaluation 1995 5 FMPSC Ranka & Shankar & Alsabti, Many-to-Many Personalized Communication with Bounded Traffic 1995 5 FMPSC Gai & Rebaudengo & Reorda, A Data Parallel Algorithm for Boolean Function Manipulation 1995 5 FMPSC Martino & Suh, How Can Massively Parallel Computers Help in the Prediction of Protein Structure? 1995 5 FMPSC Bokka & Gurla & Olariu & Schwing, Time- and VLSI-Optimal Convex Hull Computation on Meshes with Multiple Broadcasting 1995 5 FMPSC Farrag, Algorithm for Constructing Fault-Tolerant Solutions of the Circulant Graph Configuration 1995 5 FMPSC Youssef, Design and Analysis of Product Networks 1995 5 FMPSC Tsai & McKinley, A Broadcast Algorithm for All-Port Wormhole-Routed Torus Networks 1992 4 FMPSC Hao & MacKenzie & Stout, Selection on the Reconfigurable Mesh 1992 4 FMPSC Shen & Kleinrock, The Virtual-Time Data-Parallel Machine 1992 4 FMPSC Boxer & Miller, Parallel Algorithms for All Maximal Equally-Spaced Collinear Sets 1992 4 FMPSC Peng & Lo, Efficient Algorithms for Locating a Core of a Tree Network with a Specified Length 1992 4 FMPSC Loustaunau & Wang, Towards Efficient Parallelizations of a Computer Algebra Algorithm 1992 4 FMPSC Siegel & Abraham & Bain & Batcher & Casavant & DeGroot & Dennis & Douglas & Feng & Goodman & Huang & Jordan & Jump & Patt & Smith & Smith & Snyder & Stone & Tuck & Wah, Summary of the Report of the NSF-Sponsored Purdue Workshop on Grand Challenges in Computer Architecture for the Support of High Performance Computing 1992 4 FMPSC Herbordt & Weems, Computing Parallel Prefix and Reduction Using Coterie Structures 1992 4 FMPSC Xu & McKinley & Ni, A Scalable Multicast Service for Mesh Networks 1992 4 FMPSC Liszka & Batcher, A Modulo Merge Sorting Network 1992 4 FMPSC Lin & Prasanna, A Routing Algorithm for PEC Networks 1992 4 FMPSC Philippsen, Automatic Data Distribution for Nearest Neighbor Networks 1992 4 FMPSC Drefenstedt & Schmidt, On the Physical Design of Butterfly Networks for PRAMs 1992 4 FMPSC Das & Banerjee, Hyper Petersen Network: Yet Another Hypercube-Like Topology 1992 4 FMPSC Lalwaney & Zenou & Ganz & Koren, Optical Interconnects For Multiprocessors: Cost Performance Trade-Offs 1992 4 FMPSC Park & Bose, Broadcasting in Hypercubes with Link/Node Failures 1992 4 FMPSC Youssef, Off-line Permutation Scheduling on Circuit-Switched Fixed Routing Networks 1992 4 FMPSC Atiquizzaman & Akhtar, Effect of Hot Spot on the Performance of Multistage Interconnection Networks 1992 4 FMPSC Chien & Scherson, Self-Routing Least Common Ancestor Networks 1992 4 FMPSC Coleman & Wang, An Asymptotically Optimal Parallel Bin-Packing Algorithm 1992 4 FMPSC Gu & Gu, Routing Algorithms on a Mesh-Connected Computer 1992 4 FMPSC Narayanan, Single Source Shortest Path Problem on Processor Arrays 1992 4 FMPSC Scott & Baker, Embedding the Hypercube into the 3-Dimension Mesh 1992 4 FMPSC Ziavras, Embedding Multilevel Structures into Massively Parallel Hypercubes -- Connection Machine Results for Computer Vision Algorithms 1990 3 FMPSC Lin & Storer, A New Parallel Algorithm for the Knapsack Problem and Its Implementation on a Hypercube 1990 3 FMPSC MacKenzie & Stout, Asymptotically Efficient Hypercube Algorithms for Computational Geometry 1990 3 FMPSC Scherson & Mehra & Rexford, Toward Scalable Algorithms for Orthogonal shared-Memory Parallel Computers 1990 3 FMPSC Aumann & Schuster, Deterministic PRAM Simulation with constant Memory Blow-Up and No Time-Stamps 1990 3 FMPSC Pan & Chuang, Improved Mesh Algorithms for Straight Line Detection 1990 3 FMPSC Yu & Yu, Random Number Generators with Inherent Parallel Properties 1990 3 FMPSC Fagin, Large Integer Multiplication on Massively Parallel Processors 1990 3 FMPSC Stramm & Berman, Performance Prediction -- How Good is Good? 1990 3 FMPSC Yen & Leu & Bastani, Hash Table and Sorted Array: A Case Study of Multi-Entry Data Structures in Massively Parallel Systems 1990 3 FMPSC Gupta & Kumar, On the Scalability of FFT on Parallel Computers 1990 3 FMPSC MacKenzie & Stout, Practical Hypercube Algorithms for Computational Geometry 1990 3 FMPSC Wein & Zenios, Massively Parallel Auction Algorithms for the Assignment Problem 1990 3 FMPSC Alleyne & Kramer & Scherson, A Bit-Parallel, Word-Parallel, Massively Parallel Associative Processor for Scientific Computing 1990 3 FMPSC Marinescu & Rice, On Single Parameter Characterization of Parallelism 1990 3 FMPSC Storer & Reif, A Parallel Architecture for High Speed Data Compression 1990 3 FMPSC Berkovich, A New Computational Model for Massive Parallelism 1990 3 FMPSC Youssef & Arden, Functional and Topological Relations Among Banyan Multistage Networks of Differeing Switch Sizes 1990 3 FMPSC Makedon & Simvonis, On Bit-Serial Packet Routing for the Mesh and the Torus 1990 3 FMPSC Cam & Fortes, Rearrangeability of Shuffle-Exchange Networks 1990 3 FMPSC Youssef & Narahari, Topological Properties of Banyan-Hypercube Networks 1990 3 FMPSC Bellaachia & Youssef, Partitioning on the Banyan-Hypercube Networks 1990 3 FMPSC Germain & Bechennec & Etiemble & Sansonnet, An Interconnection Network and a Routing Scheme for a Massively Parallel Message-Passing Multicomputer 1990 3 FMPSC Sager & McMillin, A Fast O(k) Multicast Message Routing Algorithm 1990 3 FMPSC Sen & Sengupta & Bandyopadhyay, Generalized Supercube: An Incrementally Expandable Interconnection Network 1988 2 FMPSC Steele, Languages for Massively Parallel Computers 1988 2 FMPSC Rosenfeld, The Impact of Massively Parallel Computers on Image Processing 1988 2 FMPSC Moore & Fogaca & Kramer, Characterizing the Error Function of a Neural Network 1988 2 FMPSC Marciano & Rus, Parallel Implementations of the Simplex Algorithm 1988 2 FMPSC Willebeek-LeMair & Reeves, Region Growing on a Highly Parallel Mesh-Connected SIMD Computer 1988 2 FMPSC Boppana & Raghavendra, Minimum Spanning Tree on the HMESH Architecture 1988 2 FMPSC Chang & Ja'Ja', Optimal Mesh Algorithms for VLSI Routing 1988 2 FMPSC Dorband, Sort Computation 1988 2 FMPSC Eshaghian & Kumar, Optimal Geometric Algorithms for Digitized Pictures on an Optimal Mesh 1988 2 FMPSC Gordon & Stout, Fault Tolerant Message Routing on Large Parallel Systems 1988 2 FMPSC Izraelevitz, A Fast Algorithm for Voronoi Diagram Calculation Based on Distance Doubling 1988 2 FMPSC Krishnamurthy & Ja'Ja', Provably Good Parallel Algorithms for Channel Routing of Multiterminal Nets 1988 2 FMPSC Li & Sheng, Sparse Matrix Vector Multiplication on Polymorphic-Torus 1988 2 FMPSC Berkey, Massively Parallel Computing Applied to the One-Dimensional Bin Packing Problem 1988 2 FMPSC Haug & Graybill, The Martin Marietta Advanced Systolic Array Processor 1988 2 FMPSC Cloud, The Geometric Arithmetic Parallel Processor 1988 2 FMPSC Efe & Blackwell & Shiau & Slough, A Reduced Diameter Interconnection Network 1988 2 FMPSC Hecquard & Acharya, The PSMH: A Pyramid of Fractional Dimension 1988 2 FMPSC Keohane & Stearns, Routing Linear Permutations Through the Omega Network in Two Passes 1988 2 FMPSC Livingston & Stout, Fault Tolerance of Allocation Schemes in Massively Parallel Computers 1988 2 FMPSC Malony, Regular Processor Arrays 1988 2 FMPSC Pfeiffer, Design Considerations for a Pyramidal Cellular Logic Processor 1987 1 FMPSC Wolfram, Cellular Automaton Supercomputing 1987 1 FMPSC Batcher, The Architecture of Tomorrow's Massively Parallel Computer 1987 1 FMPSC McKurdy & Wunderlich, The Factorization of Large Composite Numbers on the MPP 1986 16 FNDPHYS Feynman, Quantum Mechanical Computers 1996 37 FOCS Arora, Polynomial Time Approximation Schemes for Euclidean TSP and other Geometric Problems 1996 37 FOCS Frieze & Kannan, The Regularity Lemma and Approximation Schemes for Dense Problems 1996 37 FOCS Arora & Frieze & Kaplan, A New Rounding Procedure for the Assignment Problem with Applications to Dense Graph Arrangement Problems 1996 37 FOCS Kenyon & Remila, Approximate Strip Packing 1996 37 FOCS Durr & Santha, A Decision Procedure for Unitary Linear Quantum Cellular Automata 1996 37 FOCS Aharonov & Ben-Or, Polynomial Simulations of Decohered Quantum Computers 1996 37 FOCS Shor, Fault-Tolerant Quantum Computation 1996 37 FOCS Kleinberg, Single-Source Unsplittable Flow 1996 37 FOCS Cunningham & Geelen, The Optimal Path-Matching Problem 1996 37 FOCS Kleinberg & Rubinfeld, Short Paths in Expander Graphs 1996 37 FOCS Spielman & Teng, Spectral Partitioning Works: Planar Graphs and Finite Element Meshes 1996 37 FOCS Kogan, Computing Permanents over Fields of Characteristic 3: Where and Why It Becomes Difficult (Extended Abstract) 1996 37 FOCS Huang & Wong, Solving Systems of Polynomial Congruences Modulo a Large Prime (Extended Abstract) 1996 37 FOCS Dor & Zwick, Median Selection Requires (2 + epsilon)n Comparisons 1996 37 FOCS Andersson, Faster Deterministic Sorting and Searching in Linear Space 1996 37 FOCS Vazirani & Saran & Rajan, An Efficient Algorithm for Constructing Minimal Trellises for Codes over Finite Abelian Groups 1996 37 FOCS Spielman, Highly Fault-Tolerant Parallel Computation (Extended Abstract) 1996 37 FOCS Sudan, Maximum Likelihood Decoding of Reed Solomon Codes 1996 37 FOCS Adler, New Coding Techniques for Improved Bandwidth Utilization 1996 37 FOCS Bartal, Probabilistic Approximation of Metric Spaces and its Algorithmic Applications 1996 37 FOCS Madras & Randall, Factoring Graphs to Bound Mixing Rates 1996 37 FOCS Kannan & Li, Sampling According to the Multivariate Normal Density 1996 37 FOCS Mitzenmacher, Load Balancing and Density Dependent Jump Markov Processes (Extended Abstract) 1996 37 FOCS Anderson, Tree Data Structures for N-Body Simulation 1996 37 FOCS Etzioni & Hanks & Jiang & Karp & Madani & Waarts, Efficient Information Gathering on the Internet (extended abstract) 1996 37 FOCS Chalasani & Jha & Saias, Approximate Option Pricing 1996 37 FOCS Therien & Wilke, Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy 1996 37 FOCS Grohe, Equivalence in Finite-Variable Logics is Complete for Polynomial Time 1996 37 FOCS Beame & Pitassi, Simplified and Improved Resolution Lower Bounds 1996 37 FOCS Rabin, Computationally Hard Algebraic Problems (Extended Abstract) 1996 37 FOCS Cheriyan & Thurimella, Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching (Extended Abstract) 1996 37 FOCS Garg, A 3-Approximation for the Minimum Tree Spanning k Vertices 1996 37 FOCS Even & Naor & Zosin, An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem 1996 37 FOCS Sahinalp & Vishkin, Efficient Approximate and Dynamic Matching of Patterns Using a Labeling Paradigm (extended abstract) 1996 37 FOCS Blum & Frieze & Kannan & Vempala, A Polynomial-time Algorithm for Learning Noisy Linear Threshold Functions 1996 37 FOCS Goldreich & Goldwasser & Ron, Property Testing and Its Connection to Learning and Approximation 1996 37 FOCS Beimel & Bergadano & Bshouty & Kushilevitz & Varricchio, On the Applications of Multiplicity Automata in Learning 1996 37 FOCS Frieze & Jerrum & Kannan, Learning Linear Transformations 1996 37 FOCS Meyer auf der Heide & Scheideler, Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols 1996 37 FOCS Andrews & Awerbuch & Fernandez & Kleinberg & Leighton & Liu, Universal Stability Results for Greedy Contention-Resolution Protocols 1996 37 FOCS Broder & Frieze & Upfal, A General Approach to Dynamic Packet Routing with Bounded Buffers (Extended abstract) 1996 37 FOCS Rabani, Path Coloring on the Mesh 1996 37 FOCS Armoni & Saks & Wigderson & Zhou, Discrepancy Sets and Pseudorandom Generators for Combinatorial Rectangles 1996 37 FOCS Agrawal & Thierauf, The Boolean Isomorphism Problem 1996 37 FOCS Amano & Maruoka, Potential of the Approximation Method (Extended Abstract) 1996 37 FOCS Andersson & Miltersen & Riis & Thorup, Static Dictionaries on AC^0 RAMs: Query Time Theta(sqrt(log n / log log n)) is Necessary and Sufficient 1996 37 FOCS Dor & Halperin & Zwick, All Pairs Almost Shortest Paths 1996 37 FOCS Henzinger & Rao & Gabow, Computing Vertex Connectivity: New Bounds from Old Techniques 1996 37 FOCS Erickson, New Lower Bounds for Halfspace Emptiness 1996 37 FOCS Agarwal & Grove & Murali & Vitter, Binary Space Partitions for Fat Rectangles 1996 37 FOCS Petrank & Tardos, On the Knowledge Complexity of NP 1996 37 FOCS Canetti & Gennaro, Incoercible Multiparty Computation (Extended Abstract) 1996 37 FOCS Bellare & Canetti & Krawczyk, Pseudorandom Functions Revisited: The Cascade Construction and its Concrete Security 1996 37 FOCS Alon & Kozlov & Vu, The Geometry of Coin-Weighing Problems 1996 37 FOCS Cover, Universal Data Compression and Portfolio Selection 1996 37 FOCS Kimbrel & Karlin, Near-optimal Parallel Prefetching and Caching 1996 37 FOCS Andrews & Bender & Zhang, New Algorithms for the Disk Scheduling Problem 1996 37 FOCS Arge & Vitter, Optimal Dynamic Interval Management in External Memory (extended abstract) 1996 37 FOCS Plaxton & Rajaraman, Fast Fault-Tolerant Concurrent Access to Shared Objects 1996 37 FOCS Aumann & Bender, Fault Tolerant Data Structures 1996 37 FOCS Ergun & Kumar & Rubinfeld, Approximate Checking of Polynomials and Functional Equations (Extended Abstract) 1996 37 FOCS Kumar & Sivakumar, Efficient Self-Testing/Self-Correction of Linear Recurrences 1996 37 FOCS Rajagopalan & Schulman, Verifying Identities (extended abstract) 1996 37 FOCS Trevisan & Sorkin & Sudan & Williamson, Gadgets, Approximation, and Linear Programming [Extended Abstract] 1996 37 FOCS Hastad, Clique is Hard to Approximate within n^{1-epsilon} 1995 36 FOCS Valiant, Cognitive Computation (Extended Abstract) 1995 36 FOCS Lokam, Spectral Methods for Matrix Rigidity with Applications to Size-Depth Tradeoffs and Communication Complexity 1995 36 FOCS Nisan & Wigderson, Lower Bounds on Arithmetic Circuits via Partial Derivatives (Preliminary Version) 1995 36 FOCS Regan & Sivakumar & Cai, Pseudorandom Generators, Measure Theory, and Natural Proofs 1995 36 FOCS Haken, Counting Bottlenecks to Show Monotone P != NP 1995 36 FOCS Chor & Goldreich & Kushilevitz & Sudan, Private Information Retrieval 1995 36 FOCS Kleinberg & Tardos, Disjoint Paths in Densely Embedded Graphs 1995 36 FOCS Even & Naor & Rao & Schieber, Divide-and-Conquer Approximation Algorithms Via Spreading Metrics (Extended Abstract) 1995 36 FOCS Bhatia & Khuller & Naor, The Loading Time Scheduling Problem (Extended Abstract) 1995 36 FOCS Hall, Approximability of Flow Shop Scheduling 1995 36 FOCS Benczur, A Representation of Cuts within 6/5 Times the Edge Connectivity with Applications 1995 36 FOCS Paterson & Srinivasan, Contention Resolution with Bounded Delay 1995 36 FOCS Plaxton, Tight Bounds for a Distributed Selection Game with Applications to Fixed-Connection Machines 1995 36 FOCS Reif, Efficient Parallel Solution of Sparse Eigenvalue and Eigenvector Problems 1995 36 FOCS Koiran, Approximating the Volume of Definable Sets 1995 36 FOCS Dagum & Karp & Luby & Ross, An Optimal Algorithm for Monte Carlo Estimation (Extended Abstract) 1995 36 FOCS Luby & Randall & Sinclair, Markov Chain Algorithms for Planar Lattice Structures (Extended Abstract) 1995 36 FOCS Mahajan & Ramesh, Derandomizing Semidefinite Programming Based Approximation Algorithms 1995 36 FOCS Naor & Reingold, Synthesizers and Their Application to the Parallel Construction of Pseudo-Random Functions (Preliminary Version) 1995 36 FOCS Naor & Schulman & Srinivasan, Splitters and Near-Optimal Derandomization (Preliminary Version) 1995 36 FOCS Torng, A Unified Analysis of Paging and Caching 1995 36 FOCS Barve & Grove & Vitter, Application-Controlled Paging for a Shared Cache (extended abstract) 1995 36 FOCS Kalyanasundaram & Pruhs, Speed is as Powerful as Clairvoyance 1995 36 FOCS Yannakakis, Perspectives on Database Theory 1995 36 FOCS Edelsbrunner, Algebraic Decomposition of Non-convex Polyhedra 1995 36 FOCS Grigoriev & Karpinski & Vorobjov, Improved Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision Trees 1995 36 FOCS Dey & Guha, Optimal Algorithms for Curves on Surfaces 1995 36 FOCS Barvinok, Integral Geometry of Higher-Dimensional Polytopes and the Average Case in Combinatorial Optimization 1995 36 FOCS von zur Gathen & Shparlinski, Finding Points on Curves over Finite Fields (Extended Abstract) 1995 36 FOCS Goldreich & Rubinfeld & Sudan, Learning Polynomials with Queries: The Highly Noisy Case 1995 36 FOCS Bshouty & Mansour, Simple Learning Algorithms for Decision Trees and Multivariate Polynomials 1995 36 FOCS Auer & Warmuth, Tracking the Best Disjunction 1995 36 FOCS Auer & Cesa-Bianchi & Freund & Schapire, Gambling in a Rigged Casino: The Adversarial Multi-armed Bandit Problem 1995 36 FOCS Freund & Kearns & Mansour & Ron & Rubinfeld & Schapire, Efficient Algorithms for Learning to Play Repeated Games Against Computationally Bounded Adversaries 1995 36 FOCS Saks & Zhou, RSPACE(S) subset DSPACE(S^{3/2}) 1995 36 FOCS Ogihara, Sparse P-Hard Sets Yield Space-Efficient Algorithms 1995 36 FOCS Cai & Sivakumar, The Resolution of a Hartmanis Conjecture 1995 36 FOCS Yao & Demers & Shenker, A Scheduling Model for Reduced CPU Energy (extended abstract) 1995 36 FOCS Awerbuch & Azar & Grove & Kao & Krishnan & Vitter, Load Balancing in the L_p Norm 1995 36 FOCS Fiat & Mansour & Rosen & Waarts, Competitive Access Time via Dynamic Storage Rearrangement (Preliminary Version) 1995 36 FOCS Arora, Reductions, Codes, PCPs, and Inapproximability 1995 36 FOCS Furer, Improved Hardness Results for Approximating the Chromatic Number 1995 36 FOCS Bellare & Goldreich & Sudan, Free Bits, PCPs and Non-Approximability -- Towards Tight Results 1995 36 FOCS Bellare & Coppersmith & Hastad & Kiwi & Sudan, Linearity Testing in Characteristic Two 1995 36 FOCS Beigel & Eppstein, 3-Coloring in Time O(1.3446^n): A No-MIS Algorithm 1995 36 FOCS Henzinger & Henzinger & Kopke, Computing Simulations on Finite and Infinite Graphs 1995 36 FOCS Subramanian, Minimum Coloring Random and Semi-Random Graphs in Polynomial Expected Time 1995 36 FOCS Ajtai & Megiddo & Waarts, Improved Algorithms and Analysis for Secretary Problems and Generalizations 1995 36 FOCS Latombe, Controllability, Recognizability, and Complexity Issues in Robot Motion Planning 1995 36 FOCS Orlitsky & Roche, Coding for Computing 1995 36 FOCS Alon & Edmonds & Luby, Linear Time Erasure Codes With Nearly Optimal Recovery (Extended Abstract) 1995 36 FOCS Buhrman & Fortnow & Torenvliet, Using Autoreducibility to Separate Complexity Classes 1995 36 FOCS Watrous, On One-Dimensional Quantum Cellular Automata 1995 36 FOCS Impagliazzo, Hard-Core Distributions for Somewhat Hard Problems 1995 36 FOCS Mihail & Kaklamanis & Rao, Efficient Access to Optical Bandwidth: --Wavelength Routing on Directed Fiber Trees, Rings, and Trees of Rings-- 1995 36 FOCS Cole & Maggs & Sitaraman, Routing on Butterfly Networks with Random Faults 1995 36 FOCS Beigel & Hurwood & Kahale, Fault Diagnosis in a Flash 1995 36 FOCS Hannenhalli & Pevzner, Transforming Men into Mice (polynomial algorithm for genomic distance problem) 1995 36 FOCS Beals, Algorithms for Matrix Groups and the Tits Alternative 1995 36 FOCS Ferragina & Grossi, Optimal On-Line Search and Sublinear Time Update in String Matching 1995 36 FOCS Margaritis & Skiena, Reconstructing Strings from Substrings in Rounds 1995 36 FOCS Karp & Waarts & Zweig, The Bit Vector Intersection Problem (Preliminary Version) 1995 36 FOCS Kosaraju, Faster Algorithms for the Construction of Parameterized Suffix Trees (Preliminary Version) 1995 36 FOCS Grigni & Koutsoupias & Papadimitriou, An Approximation Scheme for Planar Graph TSP 1995 36 FOCS Okasaki, Amortization, Lazy Evaluation, and Persistence: Lists with Catenation via Lazy Linking 1995 36 FOCS Andersson, Sublogarithmic Searching Without Multiplications 1995 36 FOCS Henzinger & King, Fully Dynamic Biconnectivity and Transitive Closure 1995 36 FOCS Beimel & Gal & Paterson, Lower Bounds for Monotone Span Programs 1995 36 FOCS Krause & Pudlak, On Computing Boolean Functions by Sparse Real Polynomials 1995 36 FOCS Beame & Impagliazzo & Pitassi, Improved Depth Lower Bounds for Small Distance Connectivity 1995 36 FOCS Kutten & Peleg, Tight Fault Locality (Extended Abstract) 1995 36 FOCS Schenk, Faster Approximate Agreement with Multi-Writer Registers 1995 36 FOCS Galil & Mayer & Yung, Resolving Message Complexity of Byzantine Agreement and Beyond (extended summary) 1994 35 FOCS Karger & Motwani & Sudan, Approximate Graph Coloring by Semidefinite Programming 1994 35 FOCS Garg & Saran & Vazirani, Finding Separator Cuts in Planar Graphs within Twice the Optimal 1994 35 FOCS Alon & Frieze & Welsh, Polynomial Time Randomised Approximation Schemes for the Tutte Polynomial of Dense Graphs 1994 35 FOCS Szegedy, A Note on the theta Number of Lovasz and the Generalized Delsarte Bound 1994 35 FOCS Jackson, An Efficient Membership-Query Algorithm for Learning DNF with Respect to the Uniform Distribution 1994 35 FOCS Bshouty & Chen & Homer, On Learning Discretized Geometric Concepts (Extended Abstract) 1994 35 FOCS Dhagat & Hellerstein, PAC Learning with Irrelevant Attributes 1994 35 FOCS Bender & Slonim, The Power of Team Exploration: Two Robots Can Learn Unlabeled Directed Graphs 1994 35 FOCS Adleman, Algorithmic Number Theory -- The Complexity Contribution 1994 35 FOCS Simon, On the Power of Quantum Computation 1994 35 FOCS Shor, Algorithms for Quantum Computation: Discrete Logarithms and Factoring 1994 35 FOCS Cai & Lipton & Zalcstein, The Complexity of the Membership Problem for 2-generated Commutative Semigroups of Rational Matrices 1994 35 FOCS Cai & Fuchs & Kozen & Liu, Efficient Average-Case Algorithms for the Modular Group 1994 35 FOCS Eppstein, Finding the k Shortest Paths 1994 35 FOCS Kosaraju & Park & Stein, Long Tours and Short Superstrings (Preliminary Version) 1994 35 FOCS Weihe, Maximum (s,t)-Flows in Planar Networks in O(|V| log |V|) Time 1994 35 FOCS Cohen, Estimating the Size of the Transitive Closure in Linear Time 1994 35 FOCS Ravi, Rapid Rumor Ramification: Approximating the Minimum Broadcast Time (Extended Abstract) 1994 35 FOCS Naor & Wool, The Load, Capacity and Availability of Quorum Systems (Extended Abstract) 1994 35 FOCS Itkis & Levin, Fast and Lean Self-Stabilizing Asynchronous Protocols 1994 35 FOCS Awerbuch & Azar, Local Optimization of Global Objectives: Competitive Distributed Deadlock Resolution and Resource Allocation 1994 35 FOCS Karger & Koller, (De)randomized Construction of Small Sample Spaces in NC 1994 35 FOCS Srinivasan & Zuckerman, Computing with Very Weak Random Sources 1994 35 FOCS Bellare & Rompel, Randomness-Efficient Oblivious Sampling 1994 35 FOCS Rubinfeld, On the Robustness of Functional Equations 1994 35 FOCS Yao, A Lower Bound for the Monotone Depth of Connectivity 1994 35 FOCS Sinha & Thathachar, Efficient Oblivious Branching Programs for Threshold Functions 1994 35 FOCS Nisan & Rudich & Saks, Products and Help Bits in Decision Trees 1994 35 FOCS Kleitman & Leighton & Ma, On the Design of Reliable Boolean Circuits that Contain Partially Unreliable Gates 1994 35 FOCS Ranade & Schleimer & Wilkerson, Nearly Tight Bounds for Wormhole Routing 1994 35 FOCS Blumofe & Leiserson, Scheduling Multithreaded Computations by Work Stealing 1994 35 FOCS Kutylowski & Lorys & Oesterdiekhoff & Wanka, Fast and Feasible Periodic Sorting Networks of Constant Depth 1994 35 FOCS Blum & Wasserman, Program Result-Checking: A Theory of Testing Meets a Test of Theory 1994 35 FOCS Koutsoupias & Papadimitriou, Beyond Competitive Analysis 1994 35 FOCS Ajtai & Aspnes & Dwork & Waarts, A Theory of Competitive Analysis for Distributed Algorithms 1994 35 FOCS Awerbuch & Gawlick & Leighton & Rabani, On-line Admission Control and Circuit Routing for High Performance Computing and Communication 1994 35 FOCS Lund & Phillips & Reingold, IP over Connection-oriented Networks and Distributional Paging 1994 35 FOCS Micali, CS Proofs (Extended Abstract) 1994 35 FOCS De Santis & Di Crescenzo & Persiano, On Monotone Formula Closure of SZK 1994 35 FOCS Kilian, On the Complexity of Bounded-Interaction and Noninteractive Zero-Knowledge Proofs 1994 35 FOCS Kushilevitz & Micali & Ostrovsky, Reducibility and Completeness In Multi-Party Private Computations 1994 35 FOCS Aldous & Vazirani, ``Go With the Winners'' Algorithms 1994 35 FOCS Gartner & Ziegler, Randomized Simplex Algorithms on Klee-Minty Cubes 1994 35 FOCS Papadimitriou & Raghavan & Sudan & Tamaki, Motion Planning on a Graph (Extended Abstract) 1994 35 FOCS Kleinberg, The Localization Problem for Mobile Robots 1994 35 FOCS Ben-Or, Algebraic Computation Trees in Characteristic p > 0 (Extended Abstract) 1994 35 FOCS Neff & Reif, An O(n^{1+epsilon} log b) Algorithm for the Complex Roots Problem 1994 35 FOCS Grigoriev & Vorobjov, Complexity Lower Bounds for Computation Trees with Elementary Transcendental Function Gates (Extended abstract) 1994 35 FOCS Turan & Vatan, On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-in (Extended Abstract) 1994 35 FOCS Sipser & Spielman, Expander Codes 1994 35 FOCS Linial & London & Rabinovich, The Geometry of Graphs and some of its Algorithmic Applications 1994 35 FOCS Kamath & Motwani & Palem & Spirakis, Tail Bounds for Occupancy and the Satisfiability Threshold Conjecture 1994 35 FOCS Albanese & Blomer & Edmonds & Luby, Priority Encoding Transmission 1994 35 FOCS Schwentick, Graph Connectivity and Monadic NP 1994 35 FOCS Hirshfeld & Jerrum & Moller, A Polynomial-time Algorithm for Deciding Equivalence of Normed Context-free Processes 1994 35 FOCS Basu & Pollack & Roy, On the Combinatorial and Algebraic Complexity of Quantifier Elimination 1994 35 FOCS Charatonik & Pacholski, Set Constraints with Projections are in NEXPTIME 1994 35 FOCS Kannan, Markov Chains and Polynomial time Algorithms 1994 35 FOCS Chazelle, A Spectral Approach to Lower Bounds 1994 35 FOCS Amato & Goodrich & Ramos, Parallel Algorithms for Higher-Dimensional Convex Hulls (Preliminary Version) 1994 35 FOCS Clarkson, More Output-Sensitive Geometric Algorithms (extended abstract) 1994 35 FOCS Arya & Mount & Smid, Randomized and Deterministic Algorithms for Geometric Spanners of Small Diameter 1994 35 FOCS Andersson & Nilsson, A New Efficient Radix Sort 1994 35 FOCS Greene & Parnas & Yao, Multi-Index Hashing for Information Retrieval 1994 35 FOCS Erickson & Ladner & LaMarca, Optimizing Static Calendar Queues 1994 35 FOCS Henzinger, Fully Dynamic Cycle-Equivalence in Graphs 1994 35 FOCS Keselman & Amir, Maximum Agreement Subtree in a Set of Evolutionary Trees -- Metrics and Efficient Algorithms 1994 35 FOCS Farach & Thorup, Optimal Evolutionary Tree Comparison by Sparse Dynamic Programming (Extended Abstract) 1994 35 FOCS Kaplan & Shamir & Tarjan, Tractability of Parameterized Completion Problems on Chordal and Interval Graphs: Minimum Fill-in and Physical Mapping (extended abstract) 1994 35 FOCS Beame & Impagliazzo & Krajicek & Pitassi & Pudlak, Lower Bounds on Hilbert's Nullstellensatz and Propostional Proofs 1994 35 FOCS Allender & Strauss, Measure on Small Complexity Classes, with Applications for BPP 1994 35 FOCS Khanna & Motwani & Sudan & Vazirani, On Syntactic versus Computational Views of Approximability 1994 35 FOCS Nisan & Wigderson, On Rank vs. Communication Complexity 1993 34 FOCS Blum & Chalasani, An On-Line Algorithm for Improving Performance in Navigation 1993 34 FOCS Irani & Rabani, On the Value of Information in Coordination Games (preliminary version) 1993 34 FOCS Awerbuch & Bartal & Fiat, Heat & Dump: Competitive Distributed Paging 1993 34 FOCS Awerbuch & Azar & Plotkin, Throughput-Competitive On-Line Routing 1993 34 FOCS Gottlob, NP Trees and Carnap's Modal Logic 1993 34 FOCS Cosmadakis, Logical Reducibility and Monadic NP 1993 34 FOCS Gupta & Pratt, Gates Accept Concurrent Behavior 1993 34 FOCS Clote & Ignjatovic & Kapron, Parallel Computable Higher Type Functionals (Extended Abstract) 1993 34 FOCS Karger, Random Sampling in Matroids, with Applications to Graph Connectivity and Minimum Spanning Trees 1993 34 FOCS Jerrum & Sorkin, Simulated Annealing for Graph Bisection 1993 34 FOCS Chen & Reif, Using Difficulty of Prediction to Decrease Computation: Fast Sort, Priority Queue and Convex Hull on Entropy Bounded Inputs 1993 34 FOCS Hastad, The Shrinkage Exponent is 2 1993 34 FOCS Hastad & Jukna & Pudlak, Top-Down Lower Bounds for Depth 3 Circuits 1993 34 FOCS Smolensky, On Representations by Low-Degree Polynomials 1993 34 FOCS Agarwala & Fernandez-Baca, A Polynomial-Time Algorithm for the Perfect Phylogeny Problem when the Number of Character States is Fixed 1993 34 FOCS Bafna & Pevzner, Genome Rearrangements and Sorting by Reversals 1993 34 FOCS Teng & Yao, Approximating Shortest Superstrings 1993 34 FOCS Raz & Spieker, On the ``log rank''-Conjecture in Communication Complexity 1993 34 FOCS Juedes & Lutz, The Complexity and Distribution of Hard Problems (Extended Abstract) 1993 34 FOCS Chaudhuri, Sensitive Functions and Approximate Problems 1993 34 FOCS Afek & Stupp, Synchronization Power Depends on the Register Size (Preliminary Version) 1993 34 FOCS Chaudhuri & Herlihy & Lynch & Tuttle, A Tight Lower Bound for k-Set Agreement 1993 34 FOCS Poon, Space Bounds for Graph Connectivity Problems on Node-named JAGs and Node-ordered JAGs 1993 34 FOCS Barnes & Edmonds, Time-Space Lower Bounds for Directed s-t Connectivity on JAG Models (Extended Abstract) 1993 34 FOCS Feige, A Randomized Time-Space Tradeoff of O^~(mR^^) for USTCON 1993 34 FOCS Cole & Crochemore & Galil & Gasieniec & Hariharan & Muthukrishnan & Park & Rytter, Optimally Fast Parallel Algorithms for Preprocessing and Pattern Matching in One and Two Dimensions 1993 34 FOCS Klein & Subramanian, A Linear-Processor Polylog-Time Algorithm for Shortest Paths in Planar Graphs 1993 34 FOCS Aumann & Kedem & Palem & Rabin, Highly Efficient Asynchronous Execution of Large-Grained Parallel Programs 1993 34 FOCS Aslam & Decatur, General Bounds on Statistical Query Learning and PAC Learning with Noise via Hypothesis Boosting 1993 34 FOCS Alon & Ben-David & Cesa-Bianchi & Haussler, Scale-sensitive Dimensions, Uniform Convergence, and Learnability 1993 34 FOCS Bshouty, Exact Learning via the Monotone Theory (Extended Abstract) 1993 34 FOCS Blum & Kannan, Learning an Intersection of k Halfspaces over a Uniform Distribution 1993 34 FOCS Rajagopalan & Vazirani, Primal-Dual RNC Approximation Algorithms for (Multi)-Set (Multi)-Cover and Covering Integer Programs 1993 34 FOCS Callahan, Optimal Parallel All-Nearest-Neighbors Using the Well-Separated Pair Decomposition (Preliminary Version) 1993 34 FOCS Kaklamanis & Krizanc & Rao, Universal Emulations with Sublogarithmic Slowdown (Extended Abstract) 1993 34 FOCS Yao, Quantum Circuit Complexity 1993 34 FOCS Brassard & Crepeau & Jozsa & Langlois, A Quantum Bit Commitment Scheme Provably Unbreakable by both Parties 1993 34 FOCS Gilleron & Tison & Tommasi, Solving Systems of Set Constraints with Negated Subset Relationships 1993 34 FOCS Halperin & Sharir, Near-Quadratic Bounds for the Motion Planning Problem for a Polygon in a Polygonal Environment 1993 34 FOCS Chazelle, Geometric Discrepancy Revisited 1993 34 FOCS Bronnimann & Chazelle & Matousek, Product Range Spaces, Sensitive Sampling, and Derandomization 1993 34 FOCS Egidi, The Complexity of the Theory of p-adic Numbers 1993 34 FOCS Ge, Testing Equalities of Multiplicative Representations in Polynomial Time (Extended Abstract) 1993 34 FOCS Beals & Babai, Las Vegas Algorithms for Matrix Groups 1993 34 FOCS Radzik, Faster Algorithms for the Generalized Network Flow Problem 1993 34 FOCS Gabow, A Framework for Cost-scaling Algorithms for Submodular Flow Problems 1993 34 FOCS Awerbuch & Leighton, A Simple Local-Control Approximation Algorithm for Multicommodity Flow 1993 34 FOCS Frandsen & Bro Miltersen & Skyum, Dynamic Word Problems 1993 34 FOCS Hampapuram & Fredman, Optimal Bi-Weighted Binary Trees and the Complexity of Maintaining Partial Sums 1993 34 FOCS Koiran, A Weak Version of the Blum, Shub & Smale Model 1993 34 FOCS Sharir, Almost Tight Upper Bounds for Lower Envelopes in Higher Dimensions 1993 34 FOCS Hershberger & Suri, Efficient Computation of Euclidean Shortest Paths in the Plane (Extended Abstract) 1993 34 FOCS Aronov & Sharir, The Union of Convex Polyhedra in Three Dimensions 1993 34 FOCS Erickson & Seidel, Better Lower Bounds on Detecting Affine and Spherical Degeneracies 1993 34 FOCS Ben-Amram & Galil, When Can We Sort in o(n log n) Time? (Extended Abstract) 1993 34 FOCS Chang & Gasarch, On Bounded Queries and Approximation 1993 34 FOCS Shallcross & Pan & Lin-Kriz, The NC Equivalence of Planar Integer Linear Programming and Euclidean GCD 1993 34 FOCS Barvinok, A Polynomial Time Algorithm for Counting Integral Points in Polyhedra when the Dimension is Fixed 1993 34 FOCS McAllister & Kirkpatrick & Snoeyink, A Compact Piecewise-Linear Voronoi Diagram for Convex Sites in the Plane 1993 34 FOCS Mitchell, Refining a Triangulation of a Planar Straight-Line Graph to Eliminate Large Angles 1993 34 FOCS Evans & Schulman, Signal Propagation, with Application to a Lower Bound on the Depth of Noisy Formulas 1993 34 FOCS Halldorsson & Radhakrishnan & Subrahmanyam, Directed vs. Undirected Monotone Contact Networks for Threshold Functions 1993 34 FOCS Huang & Ierardi, Counting Rational Points on Curves over Finite Fields (Extended Abstract) 1993 34 FOCS Reif, An O(n log^3 n) Algorithm for the Real Root Problem 1993 34 FOCS Awerbuch & Berger & Cowen & Peleg, Near-Linear Cost Sequential and Distributed Constructions of Sparse Neighborhood Covers 1993 34 FOCS Cohen, Fast Algorithms for Constructing t-Spanners and Paths with Stretch t (Extended abstract) 1993 34 FOCS Garay & Kutten & Peleg, A Sub-Linear Time Distributed Algorithm for Minimum-Weight Spanning Trees (Extended Abstract) 1993 34 FOCS Franklin & Galil & Yung, Eavesdropping Games: A Graph-Theoretic Approach to Privacy in Distributed Systems 1993 34 FOCS Gillman, A Chernoff Bound for Random Walks on Expander Graphs 1993 34 FOCS Kortsarz & Peleg, On Choosing a Dense Subgraph 1993 34 FOCS Leiserson & Rao & Toledo, Efficient Out-of-Core Algorithms for Linear Relaxation Using Blocking Covers (Extended Abstract) 1993 34 FOCS Goodrich & Tsay & Vengroff & Vitter, External-Memory Computational Geometry (Preliminary Version) 1993 34 FOCS Arora & Babai & Stern & Sweedyk, The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations 1993 34 FOCS Leighton & Ma, Breaking the Theta(n log^2 n) Barrier for Sorting with Faults (Extended Abstract) 1992 33 FOCS Arora & Safra, Probabilistic Checking of Proofs; A New Characterization of NP (draft) 1992 33 FOCS Arora & Lund & Motwani & Sudan & Szegedy, Proof Verification and Hardness of Approximation Problems 1992 33 FOCS Nisan & Szemeredi & Wigderson, Undirected Connectivity in O(log_{1.5} n) Space 1992 33 FOCS Fenner & Fortnow & Kurtz, The Isomorphism Conjecture Holds Relative to an Oracle 1992 33 FOCS Buchsbaum & Sundar & Tarjan, Data Structural Bootstrapping, Linear Path Compression, and Catenable Heap Ordered Double Ended Queues 1992 33 FOCS Rauch, Fully Dynamic Biconnectivity in Graphs 1992 33 FOCS Eppstein & Galil & Italiano & Nissenzweig, Sparsification -- A Technique for Speeding up Dynamic Graph Algorithms (Extended Abstract) 1992 33 FOCS Hsu, On Four-Connecting a Triconnected Graph (Extended Abstract) 1992 33 FOCS Agarwal & Eppstein & Matousek, Dynamic Half-space Reporting, Geometric Optimization, and Minimum Spanning Trees 1992 33 FOCS Mulmuley, Randomized Geometric Algorithms and Pseudo-random Generators (Extended abstract) 1992 33 FOCS Kant, Drawing Planar Graphs Using the lmc-ordering 1992 33 FOCS Luks, Computing in Solvable Matrix Groups 1992 33 FOCS Giesbrecht, Fast Algorithms for Matrix Normal Forms 1992 33 FOCS Bini & Pan, Improved Parallel Polynomial Division and Its Extensions 1992 33 FOCS Aspnes & Waarts, Randomized Consensus in Expected O(n log^2 n) Operations Per Processor 1992 33 FOCS Aumann & Rabin, Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation (Extended Abstract) 1992 33 FOCS Jayanti & Chandra & Toueg, Fault-tolerant Wait-free Shared Objects 1992 33 FOCS Gradel & McColm, Hierarchies in Transitive Closure Logic, Stratified Datalog and Infinitary Logic 1992 33 FOCS Alur & Henzinger, Back to the Future: Towards a Theory of Timed Regular Languages 1992 33 FOCS Pitassi & Urquhart, The Complexity of the Hajos Calculus 1992 33 FOCS Blum & Karloff & Rabani & Saks, A Decomposition Theorem and Bounds for Randomized Server Problems 1992 33 FOCS Karlin & Phillips & Raghavan, Markov Paging (Extended Abstract) 1992 33 FOCS Azar & Broder & Karlin, On-line Load Balancing (Extended abstract) 1992 33 FOCS Plaxton & Poonen & Suel, Improved Lower Bounds for Shellsort 1992 33 FOCS Miltersen & Paterson & Tarui, The Asymptotic Complexity of Merging Networks 1992 33 FOCS Galil & Park, Truly Alphabet-Independent Two-Dimensional Pattern Matching 1992 33 FOCS Dubiner & Zwick, Amplification and Percolation 1992 33 FOCS Yao, Algebraic Decision Trees and Euler Characteristics 1992 33 FOCS Grolmusz, Separating the Communication Complexities of MOD m and MOD p Circuits 1992 33 FOCS Coppersmith & Schieber, Lower Bounds on the Depth of Monotone Arithmetic Computations (Extended Summary) 1992 33 FOCS Kahale, On the Second Eigenvalue and Linear Expansion of Regular Graphs 1992 33 FOCS Rabinovich & Sinclair & Wigderson, Quadratic Dynamical Systems (Preliminary Systems) 1992 33 FOCS Friedman, On the Bit Extraction Problem 1992 33 FOCS Jerrum & Vazirani, A Mildly Exponential Approximation Algorithm for the Permanent 1992 33 FOCS El-Yaniv & Fiat & Karp & Turpin, Competitive Analysis of Financial Games 1992 33 FOCS Alon & Kalai & Ricklin & Stockmeyer, Lower Bounds on the Competitive Ratio for Mobile User Tracking and Distributed Job Scheduling (Extended Abstract) 1992 33 FOCS Bartal & Rosen, The Distributed k-Server Problem -- A Competitive Distributed Translator for k-Server Algorithms 1992 33 FOCS Marcinkowski & Pacholski, Undecidability of the Horn-Clause Implication Problem 1992 33 FOCS Kozen & Palsberg & Schwartzbach, Efficient Inference of Partial Types 1992 33 FOCS Van den Bussche & Van Gucht & Andries & Gyssens, On the Completeness of Object-Creating Query Languages (extended abstract) 1992 33 FOCS Lenhof & Smid, Enumerating the k Closest Pairs Optimally 1992 33 FOCS Clarkson, Safe and Effective Determinant Evaluation 1992 33 FOCS Katoh & Tokuyama & Iwano, On Minimum and Maximum Spanning Trees of Linearly Moving Points 1992 33 FOCS Blum & Goldreich, Towards a Computational Theory of Statistical Tests (Extended Abstract) 1992 33 FOCS Alon & Galil & Margalit & Naor, Witnesses for Boolean Matrix Multiplications and for Shortest Paths 1992 33 FOCS De Santis & Persiano, Zero-Knowledge Proofs of Knowledge Without Interaction (Extended Abstract) 1992 33 FOCS Yap, Fast Unimodular Reductions: Planar Integer Lattices (Extended Abstract) 1992 33 FOCS Blomer, How to Denest Ramanujan's Nested Radicals 1992 33 FOCS Eberly, On Efficient Band Matrix Arithmetic 1992 33 FOCS Gartner, A Subexponential Algorithm for Abstract Optimization Problems 1992 33 FOCS Alon & Duke & Lefmann & Rodl & Yuster, The Algorithmic Aspects of the Regularity Lemma (Extended Abstract) 1992 33 FOCS Lovasz & Simonovits, On the Randomized Complexity of Volume and Diameter 1992 33 FOCS Helmbold & Littlestone & Long, Apple Tasting and Nearly One-Sided Learning 1992 33 FOCS Ar & Lipton & Rubinfeld & Sudan, Reconstructing Algebraic Functions from Mixed Data 1992 33 FOCS Bshouty & Cleve, On the Exact Learning of Formulas in Parallel (Extended Abstract) 1992 33 FOCS Aizenstein & Hellerstein & Pitt, Read-Thrice DNF is Hard to Learn With Membership and Equivalence Queries (extended abstract) 1992 33 FOCS Tamaki, Efficient Self-embedding of Butterfly Networks with Random Faults 1992 33 FOCS Leighton & Maggs & Sitaraman, On the Fault Tolerance of Some Popular Bounded-Degree Networks 1992 33 FOCS Feige & Raghavan, Exact Analysis of Hot-Potato Routing (Extended Abstract) 1992 33 FOCS Felperin & Raghavan & Upfal, A Theory of Wormhole Routing in Parallel Computers (Extended Abstract) 1992 33 FOCS Mitchell & Piatko & Arkin, Computing a Shortest k-Link Path in a Polygon 1992 33 FOCS Aggarwal & Bar-Noy & Khuller & Kravets & Schieber, Efficient Minimum Cost Matching Using Quadrangle Inequality 1992 33 FOCS Wagener, Optimal Parallel Hull Construction for Simple Polygons in O(log log n) Time 1992 33 FOCS Cole & Hariharan, Tighter Bounds on the Exact Complexity of String Matching (Extended Abstract) 1992 33 FOCS Kenyon & Kenyon, Tiling a Polygon with Rectangles 1992 33 FOCS Chvatal & Reed, Mick Gets Some (the Odds Are on His Side) 1992 33 FOCS Hagerup & Raman, Waste Makes Haste: Tight Bounds for Loose Parallel Sorting 1992 33 FOCS Chaudhuri & Radhakrishnan, The Complexity of Parallel Prefix Problems on Small Domains 1992 33 FOCS Cohen, Approximate Max Flow on Small Depth Networks 1992 33 FOCS Radzik, Newton's Method for Fractional Combinatorial Optimization 1992 33 FOCS Conforti & Cornuejols, A Class of Logic Problems Solvable by Linear Programming 1992 33 FOCS Toledo, Maximizing Non-Linear Concave Functions in Fixed Dimension 1992 33 FOCS Ajtai & Komlos & Szemeredi, Halvers and Expanders 1992 33 FOCS Ajtai & Alon & Bruck & Cypher & Ho & Naor & Szemeredi, Fault Tolerant Graphs, Perfect Hash Functions and Disjoint Paths 1992 33 FOCS Pan & Reif & Tate, The Power of Combining the Techniques of Algebraic and Numerical Computing: Improved Approximate Multipoint Polynomial Evaluation and Improved Multipole Algorithms 1992 33 FOCS Kaltofen & Pan, Processor-Efficient Parallel Solution of Linear Systems II: The Positive Characteristic and Singular Cases (Extended Abstract) 1992 33 FOCS Schulman, Communication on Noisy Channels: A Coding Theorem for Computation 1991 32 FOCS Feige & Goldwasser & Lovasz & Safra & Szegedy, Approximating Clique is Almost NP-complete (Preliminary Version) 1991 32 FOCS Lapidot & Shamir, Fully Parallelized Multi Prover Protocols for NEXP-time (Extended Abstract) 1991 32 FOCS Beigel & Bellare & Feigenbaum & Goldwasser, Languages that are Easier than their Proofs 1991 32 FOCS Chazelle, An Optimal Convex Hull Algorithm And New Results on Cuttings (Extended Abstract) 1991 32 FOCS Hoffmann & Kaufmann & Kriegel, The Art Gallery Theorem For Polygons With Holes 1991 32 FOCS Matousek & Miller & Pach & Sharir & Sifrony & Welzl, Fat Triangles Determine Linearly Many Holes 1991 32 FOCS Goldreich & Petrank, Quantifying Knowledge Complexity 1991 32 FOCS Boyar & Brassard & Peralta, Subquadratic Zero-Knowledge 1991 32 FOCS Zuckerman, Simulating BPP Using a General Weak Random Source 1991 32 FOCS Blum & Evans & Gemmell & Kannan & Naor, Checking the Correctness of Memories 1991 32 FOCS Baruah & Koren & Mishra & Raghunathan & Rosier & Shasha, On-Line Scheduling in the Presence of Overload 1991 32 FOCS Feldmann & Sgall & Teng, Dynamic Scheduling on Parallel Machines 1991 32 FOCS Vitter & Krishnan, Optimal Prefetching via Data Compression (extended abstract) 1991 32 FOCS Kunde, Concentrated Regular Data Streams on Grids: Sorting and Routing Near to the Bisection Bound 1991 32 FOCS Shmoys & Wein & Williamson, Scheduling Parallel Machines On-line 1991 32 FOCS Kunde, Concentrated Regular Data Streams on Grids: Sorting and Routing Near to the Bisection Bound 1991 32 FOCS Wu & Kung, Communication Complexity for Parallel Divide-and-Conquer 1991 32 FOCS Papadimitriou, On Selecting a Satisfying Truth Assignment (Extended Abstract) 1991 32 FOCS Aizenstein & Pitt, Exact Learning of Read-Twice DNF Formulas (extended abstract) 1991 32 FOCS Mulmuley, Randomized Multidimensional Search Trees: Lazy Balancing and Dynamic Shuffling (Extended abstract) 1991 32 FOCS Schwarzkopf, Dynamic Maintenance of Geometric Structures Made Easy 1991 32 FOCS Matousek, Reporting Points in Halfspaces 1991 32 FOCS Mulmuley, Randomized Multidimensional Search Trees: Further Results in Dynamic Sampling (Extended abstract) 1991 32 FOCS Orlitsky, Interactive Communication: Balanced Distributions, Correlated Files, and Average-case Complexity 1991 32 FOCS Feder & Kushilevitz & Naor, Amortized Communication Complexity (Preliminary Version) 1991 32 FOCS Edmonds & Impagliazzo & Rudich & Sgall, Communication Complexity Towards Lower Bounds on Circuit Depth 1991 32 FOCS Awerbuch & Varghese, Distributed Program Checking: a Paradigm for Building Self-stabilizing Distributed Protocols (Extended Abstract) 1991 32 FOCS Awerbuch & Patt-Shamir & Varghese, Self-Stabilization By Local Checking and Correction 1991 32 FOCS Wang, An Asynchronous Two-Dimensional Self-Correcting Cellular Automaton 1991 32 FOCS Fiat & Foster & Karloff & Rabani & Ravid & Vishwanathan, Competitive Algorithms for Layered Graph Traversal 1991 32 FOCS Deng & Kameda & Papadimitriou, How to Learn an Unknown Environment (Extended Abstract) 1991 32 FOCS Klein, Walking an Unknown Street with Bounded Detour 1991 32 FOCS Radhakrishnan, Better Bounds for Threshold Formulas 1991 32 FOCS Paterson & Zwick, Shrinkage of de Morgan Formulae Under Restriction 1991 32 FOCS Bshouty & Cleve & Eberly, Size-Depth Tradeoffs for Algebraic Formulae 1991 32 FOCS Kapron & Cook, A New Characterization of Mehlhorn's Polynomial Time Functionals (Extended Abstract) 1991 32 FOCS Verma, A Theory of Using History for Equational Systems with Applications (Extended Abstract) 1991 32 FOCS Klarlund, Progress Measures for Complementation of omega-Automata with Applications to Temporal Logic 1991 32 FOCS Emerson & Jutla, Tree Automata, Mu-Calculus and Determinacy (Extended Abstract) 1991 32 FOCS Shoup & Smolensky, Lower Bounds for Polynomial Evaluation and Interpolation Problems 1991 32 FOCS von zur Gathen, Efficient Exponentiation in Finite Fields (Extended Abstract) 1991 32 FOCS Morgenstern, Explicit Construction of Natural Bounded Concentrators 1991 32 FOCS Kahale, Better Expansion for Ramanujan Graphs 1991 32 FOCS Emiris & Canny, A General Approach to Removing Degeneracies 1991 32 FOCS Edelsbrunner & Tan, A Quadratic Time Algorithm for the MinMax Length Triangulation (extended abstract) 1991 32 FOCS Matousek & Welzl & Wernisch, Discrepancy and epsilon-approximations for Bounded VC-dimension 1991 32 FOCS Du & Zhang & Feng, On Better Heuristic for Euclidean Steiner Minimum Trees (Extended Abstract) 1991 32 FOCS Aumann & Ben-Or, Asymptotically Optimal PRAM Emulation on Faulty Hypercubes (Extended Abstract) 1991 32 FOCS Goldreich & Goldwasser & Linial, Fault-tolerant Computation in the Full Information Model (extended abstract) 1991 32 FOCS Leighton & Ma & Plaxton, Highly Fault-Tolerant Sorting Circuits 1991 32 FOCS Leighton & Schwabe, Efficient Algorithms for Dynamic Allocation of Distributed Memory 1991 32 FOCS Adler & Beling, Polynomial Algorithms for LP over a Subring of the Algebraic Integers with Applications to LP with Circulant Matrices 1991 32 FOCS Eppstein, Dynamic Three-Dimensional Linear Programming 1991 32 FOCS Plotkin & Shmoys & Tardos, Fast Approximation Algorithms for Fractional Packing and Covering Problems 1991 32 FOCS Awerbuch & Schulman, The Maintenance of Common Data in a Distributed System 1991 32 FOCS Naor & Roth, Optimal File Sharing in Distributed Networks (Preliminary Version) 1991 32 FOCS Herlihy & Shavit & Waarts, Low Contention Linearizable Counting 1991 32 FOCS Miller & Teng & Vavasis, A Unified Geometric Approach to Graph Separators 1991 32 FOCS Hsu & Ramachandran, A Linear Time Algorithm for Triconnectivity Augmentation (Extended Abstract) 1991 32 FOCS Karger & Koller & Phillips, Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths 1991 32 FOCS Alon & Galil & Margalit, On the Exponent of the All Pairs Shortest Path Problem 1991 32 FOCS Lovasz & Naor & Newman & Wigderson, Search Problems in the Decision Tree Model (Preliminary version) 1991 32 FOCS Alon, A Parallel Algorithmic Version of the Local Lemma 1991 32 FOCS Gal, Lower Bounds for the Complexity of Reliable Boolean Circuits with Noisy Gates 1991 32 FOCS Reischuk & Schmeltz, Reliable Computation with Noisy Circuits and Decision Trees -- A General n log n Lower Bound 1991 32 FOCS Sundar, A Lower Bound for the Dictionary Problem under a Hashing Model 1991 32 FOCS Ben-Amram & Galil, Lower Bounds for Data Structure Problems on RAMs (Extended Abstract) 1991 32 FOCS Frederickson, Ambivalent Data Structures for Dynamic 2-Edge-connectivity and k Smallest Spanning Trees 1991 32 FOCS Andersson & Ottmann, Faster Uniquely Represented Dictionaries 1991 32 FOCS Donald & Chang, On the Complexity of Computing the Homology Type of a Triangulation 1991 32 FOCS Grigoriev & Karpinski, An Approximation Algorithm for the Number of Zeros of Arbitrary Polynomials over GF[q] 1991 32 FOCS Blomer, Computing Sums of Radicals in Polynomial Time 1991 32 FOCS Huang & Ierardi, Efficient Algorithms for the Riemann-Roch Problem and for Addition in the Jacobian of a Curve (Extended Abstract) 1991 32 FOCS Johnson & Metaxas, Connected Components in O(lg^(3/2) |V|) Parallel Time for the CREW PRAM (Extended Abstract) 1991 32 FOCS Gil & Matias & Vishkin, Towards a Theory of Nearly Constant Time Parallel Algorithms 1991 32 FOCS Goodrich, Using Approximation Algorithms to Design Parallel Algorithms that May Ignore Processor Allocation (Preliminary Version) 1991 32 FOCS Gazit, A Deterministic Parallel Algorithm for Planar Graphs Isomorphism 1991 32 FOCS Babai & Friedl, Approximate Representation Theory of Finite Groups 1991 32 FOCS Saran & Vazirani, Finding k-cuts within Twice the Optimal 1991 32 FOCS Shor, How to Pack Better than Best Fit: Tight Bounds for Average-Case On-Line Bin Packing 1991 32 FOCS Amir & Farach, Adaptive Dictionary Matching 1991 32 FOCS Maass & Schnitger & Sontag, On the Computational Power of Sigmoid versus Boolean Threshold Circuits (Extended Abstract) 1991 32 FOCS Krause & Waack, Variation Ranks of Communication Matrices and Lower Bounds for Depth Two Circuits Having Symmetric Gates with Unbounded Fan-In 1991 32 FOCS Beigel & Tarui, On ACC 1991 32 FOCS Kanevsky & Tamassia & Di Battista & Chen, On-Line Maintenance of the Four-Connected Components of a Graph (Extended Abstract) 1991 32 FOCS Gupta & Impagliazzo, Computing Planar Intertwines 1991 32 FOCS Gabow, Applications of a Poset Representation to Edge Connectivity and Graph Rigidity 1990 31 FOCS Lund & Fortnow & Karloff & Nisan, Algebraic Methods for Interactive Proof Systems 1990 31 FOCS Shamir, IP=PSPACE 1990 31 FOCS Babai & Fortnow & Lund, Non-Deterministic Exponential Time has Two-Prover Interactive Protocols 1990 31 FOCS Babai & Fortnow, A Characterization of #P by Arithmetic Straight Line Programs 1990 31 FOCS Dolev & Dwork & Waarts & Yung, Perfectly Secure Message Transmission 1990 31 FOCS Alon & Naor, Coin-flipping Games Immune Against Linear-sized Coalitions (Extended abstract) 1990 31 FOCS Attiya & Lynch & Shavit, Are Wait-Free Algorithms Fast? (Extended Abstract) 1990 31 FOCS Awerbuch & Saks, A Dining Philosophers Algorithm with Polynomial Response Time 1990 31 FOCS Du & Hwang, An Approach for Proving Lower Bounds: Solution of Gilbert-Pollak Conjecture on Steiner Ratio 1990 31 FOCS Formann & Hagerup & Haralambides & Kaufmann & Leighton & Simvonis & Welzl & Woeginger, Drawing Graphs in the Plane with High Resolution 1990 31 FOCS Cheng & Janardan, New Results on Dynamic Planar Point Location 1990 31 FOCS Reif & Tygar & Yoshida, The Computability and Complexity of Optical Beam Tracing 1990 31 FOCS Chang & Lawler, Approximate String Matching in Sublinear Expected Time 1990 31 FOCS Li, Towards a DNA Sequencing Theory (Learning a String) (Preliminary Version) 1990 31 FOCS Colussi & Galil & Giancarlo, On the Exact Complexity of String Matching (Extended Abstract) 1990 31 FOCS Dubiner & Galil & Magen, Faster Tree Pattern Matching 1990 31 FOCS Neff, Specified Precision Polynomial Root Isolation is in NC 1990 31 FOCS Kosaraju & Delcher, A Tree-Partitioning Technique With Applications to Expression Evaluation and Term Matching (Extended Abstract) 1990 31 FOCS Lagergren, Efficient Parallel Algorithms for Tree-Decomposition and Related Problems 1990 31 FOCS Berkman & Ja'Ja' & Krishnamurthy & Thurimella & Vishkin, Some Triply-Logarithmic Parallel Algorithms 1990 31 FOCS Angluin & Frazier & Pitt, Learning Conjunctions of Horn Clauses 1990 31 FOCS Goldman & Kearns & Schapire, Exact Identification of Circuits Using Fixed Points of Amplification Functions (Extended Abstract) 1990 31 FOCS Maass & Turan, On the Complexity of Learning from Counterexamples and Membership Queries 1990 31 FOCS Blum, Separating Distribution-Free and Mistake-Bound Learning Models over the Boolean Domain (Extended Abstract) 1990 31 FOCS Chazelle, Triangulating a Polygon in Linear Time 1990 31 FOCS Bern & Eppstein & Gilbert, Provably Good Mesh Generation 1990 31 FOCS Chazelle & Edelsbrunner & Guibas & Pollack & Seidel & Sharir & Snoeyink, Counting and Cutting Cycles of Lines and Rods in Space 1990 31 FOCS de Berg & Overmars, Hidden Surface Removal for Axis-Parallel Polyhedra (extended abstract) 1990 31 FOCS Leighton & Plaxton, A (fairly) Simple Circuit that (usually) Sorts 1990 31 FOCS Assaf & Upfal, Fault Tolerant Sorting Network 1990 31 FOCS Kaklamanis & Karlin & Leighton & Milenkovic & Raghavan & Rao & Thomborson & Tsantilas, Asymptotically Tight Bounds for Computing with Faulty Arrays of Processors (Extended Abstract) 1990 31 FOCS Bay & Bilardi, Deterministic On-Line Routing on Area-Universal Networks (Extended Abstract) 1990 31 FOCS Feige & Lapidot & Shamir, Multiple Non-Interactive Zero Knowledge Proofs Based on a Single Random String (Extended Abstract) 1990 31 FOCS Goldreich & Impagliazzo & Levin & Venkatesan & Zuckerman, Security Preserving Amplification of Hardness 1990 31 FOCS Sturtivant & Zhang, Efficiently Inverting Bijections Given by Straight Line Programs 1990 31 FOCS Chor & Gereb-Graus & Kushilevitz, Private Computations Over the Integers (extended abstract) 1990 31 FOCS Lovasz & Simonovits, The Mixing Rate of Markov Chains, an Isoperimetric Inequality, and Computing the Volume 1990 31 FOCS Deng & Papadimitriou, Exploring an Unknown Graph (Extended Abstract) 1990 31 FOCS Kannan & Warnow, Inferring Evolutionary History from DNA Sequences (Extended Abstract) 1990 31 FOCS Fich & Munro & Poblete, Permuting 1990 31 FOCS Kearns & Schapire, Efficient Distribution-free Learning of Probabilistic Concepts (Extended Abstract) 1990 31 FOCS Aldous & Vazirani, A Markovian Extension of Valiant's Learning Model (Extended Abstract) 1990 31 FOCS Paturi & Saks, On Threshold Circuits for Parity 1990 31 FOCS Fulk, Robust Separations in Inductive Inference 1990 31 FOCS Abrahamson, A Time-Space Tradeoff for Boolean Matrix Multiplication 1990 31 FOCS Beame & Tompa & Yan, Communication-Space Tradeoffs for Unrestricted Protocols 1990 31 FOCS Beame & Borodin & Raghavan & Ruzzo & Tompa, Time-Space Tradeoffs for Undirected Graph Traversal 1990 31 FOCS Istrail, Constructing Generalized Universal Traversing Sequences of Polynomial Size for Graphs with Small Diameter (Extended Abstract) 1990 31 FOCS Fiat & Rabani & Ravid, Competitive k-Server Algorithms (Extended Abstract) 1990 31 FOCS Vishwanathan, Randomized Online Graph Coloring (Preliminary Version) 1990 31 FOCS Irani, Coloring Inductive Graphs On-line 1990 31 FOCS Cole & Raghunathan, Online Algorithms for Finger Searching (Extended Abstract) 1990 31 FOCS Awerbuch & Cidon & Kutten, Communication-Optimal Maintenance of Replicated Information 1990 31 FOCS Awerbuch & Peleg, Sparse Partitions (Extended Abstract) 1990 31 FOCS Awerbuch & Peleg, Network Synchronization with Polylogarithmic Overhead 1990 31 FOCS Zuckerman, General Weak Random Sources 1990 31 FOCS Alon & Goldreich & Hastad & Peralta, Simple Constructions of Almost k-wise Independent Random Variables 1990 31 FOCS Blum, Some Tools for Approximate 3-Coloring (Extended Abstract) 1990 31 FOCS Bellare & Goldreich & Goldwasser, Randomness in Interactive Proofs 1990 31 FOCS Alon & Megiddo, Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time 1990 31 FOCS Vaidya, Reducing the Parallel Complexity of Certain Linear Programming Problems (extended abstract) 1990 31 FOCS Martel & Subramonian & Park, Asynchronous PRAMs are (almost) as Good as Synchronous PRAMs 1990 31 FOCS Alpern & Carter & Feig, Uniform Memory Hierarchies 1990 31 FOCS Hastad & Goldmann, On the Power of Small-Depth Threshold Circuits 1990 31 FOCS Yao, On ACC and Threshold Circuits 1990 31 FOCS Smolensky, On Interpolation by Analytic Functions with Special Properties and Some Weak Lower Bounds on the Size of Circuits with Symmetric Gates 1990 31 FOCS Bruck & Smolensky, Polynomial Threshold Functions, AC^0 Functions and Spectral Norms (Extended Abstract) 1990 31 FOCS Paterson & Pippenger & Zwick, Faster Circuits and Shorter Formulae for Multiple Addition, Multiplication and Symmetric Boolean Functions (Extended Abstract) 1990 31 FOCS Harel & Raz, Deciding Properties of Nonregular Programs (Preliminary Version) 1990 31 FOCS Lincoln & Mitchell & Scedrov & Shankar, Decision Problems for Propositional Linear Logic 1990 31 FOCS Maler & Pnueli, Tight Bounds on the Complexity of Cascaded Decomposition of Automata 1990 31 FOCS Kaminski & Francez, Finite-Memory Automata (Extended abstract) 1990 31 FOCS Lynch, Probabilities of Sentences about Very Sparse Random Graphs 1990 31 FOCS Naor & Gusfield & Martel, A Fast Algorithm for Optimally Increasing the Edge-Connectivity 1990 31 FOCS Frank, Augmenting Graphs to Meet Edge-Connectivity Requirements 1990 31 FOCS Fredman & Willard, Trans-dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths 1990 31 FOCS Klein & Agrawal & Ravi & Rao, Approximation through Multicommodity Flow 1990 31 FOCS Even & Litman & Winkler, Computing with Snakes in Directed Networks of Automata (extended abstract) 1990 31 FOCS Pnueli & Rosner, Distributed Reactive Systems are Hard to Synthesize 1990 31 FOCS Luo & Tsitsiklis, Communication Complexity of Algebraic Computation (Extended Abstract) 1990 31 FOCS Canetti & Goldreich, Bounds on Tradeoffs between Randomness and Communication Complexity 1990 31 FOCS Toda, The Complexity of Finding Medians 1990 31 FOCS Buss & Papadimitriou & Tsitsiklis, On the Predictability of Coupled Automata: An Allegory about Chaos 1990 31 FOCS Papadimitriou, On Graph-theoretic Lemmata and Complexity Classes (Extended Abstract) 1990 31 FOCS Gurevich, Matrix Decomposition Problem is Complete for the Average Case 1990 31 FOCS Impagliazzo & Levin, No Better Ways to Generate Hard NP Instances than Picking Uniformly at Random 1990 31 FOCS Koscielski & Pacholski, Complexity of Unification in Free Groups and Free Semi-groups 1990 31 FOCS Vallee & Flajolet, The Lattice Reduction Algorithm of Gauss: An Average Case Analysis 1990 31 FOCS Grigoriev & Karpinski & Singer, Interpolation of Sparse Rational Functions Without Knowing Bounds on Exponents 1990 31 FOCS Horng & Huang, Simplifying Nested Radicals and Solving Polynomials by Radicals in Minimum Depth 1990 31 FOCS Babai & Hetyei & Kantor & Lubotzky & Seress, On the Diameter of Finite Groups 1989 30 FOCS Berger & Rompel, Simulating (log^c n)-wise Independence in NC 1989 30 FOCS Motwani & Naor & Naor, The Probabilistic Method Yields Deterministic Parallel Algorithms 1989 30 FOCS Cohen & Wigderson, Dispersers, Deterministic Amplification, and Weak Random Sources 1989 30 FOCS Siegel, On Universal Classes of Fast High Performance Hash Functions, Their Time-Space Tradeoff, and Their Applications 1989 30 FOCS Schapire, The Strength of Weak Learnability 1989 30 FOCS Li & Vitanyi, A Theory of Learning Simple Concepts Under Simple Distributions and Average Case Complexity for the Universal Distribution 1989 30 FOCS Haussler, Generalizing the PAC Model: Sample Size Bounds From Metric Dimension-based Uniform Convergence Results 1989 30 FOCS Goldman & Rivest & Schapire, Learning Binary Relations and Total Orders 1989 30 FOCS Berger & Rompel & Shor, Efficient NC Algorithms for Set Cover with Applications to Learning and Geometry 1989 30 FOCS Marcotte & Suri, Fast Matching Algorithms for Points on a Polygon 1989 30 FOCS Frederickson & Guan, Ensemble Motion Planning on Trees 1989 30 FOCS Pach & Steiger & Szemeredi, An Upper Bound on the Number of Planar k-Sets 1989 30 FOCS Dickerson, The Inverse of an Automorphism in Polynomial Time 1989 30 FOCS von zur Gathen, Testing Permutation Polynomials 1989 30 FOCS Babai & Ronyai, Computing Irreducible Representations of Finite Groups 1989 30 FOCS Ronyai, Galois Groups and Factoring Polynomials Over Finite Fields 1989 30 FOCS Gabow & Xu, Efficient Algorithms for Independent Assignment on Graphic and Linear Matroids 1989 30 FOCS Miller & Naor, Flow in Planar Graphs with Multiple Sources and Sinks 1989 30 FOCS Cheriyan & Hagerup, A Randomized Maximum Flow Algorithm 1989 30 FOCS Linial & Vazirani, Graph Products and Chromatic Numbers 1989 30 FOCS Ng, Lower Bounds for the Stable Marriage Problem and its Variants 1989 30 FOCS Hall & Shmoys, Approximation Schemes for Constrained Scheduling Problems 1989 30 FOCS Ajtai & Gurevich, Datalog Vs. First-Order Logic 1989 30 FOCS Abadi & Halpern, Decidability and Expressiveness for First-Order Logics of Probability 1989 30 FOCS Cook & Kapron, Characterizations of the Basic Feasible Functionals of Finite Type 1989 30 FOCS Pacholski & Szwast, The 0-1 Law Fails for the Class of Existential Second Order Godel Sentences with Equality 1989 30 FOCS Alur & Henzinger, A Really Temporal Logic 1989 30 FOCS Russell, Full Abstraction for Nondeterministic Dataflow Networks 1989 30 FOCS Kosaraju, Efficient Tree Pattern Matching 1989 30 FOCS Kosaraju, Pipelining Computations in a Tree of Processors 1989 30 FOCS Goodrich & Kosaraju, Sorting on a Parallel Pointer Machine with Applications to Set Expression Evaluation 1989 30 FOCS Berkman & Vishkin, Recursive *-Tree Parallel Data-Structure 1989 30 FOCS Ko, Computational Complexity of Roots of Real Functions 1989 30 FOCS Abrahamson & Ellis & Fellows & Mata, On the Complexity of Fixed Parameter Problems 1989 30 FOCS Krentel, Structure in Locally Optimal Solutions 1989 30 FOCS Impagliazzo & Tardos, Decision Versus Search Problems in Super-Polynomial Time 1989 30 FOCS Impagliazzo & Luby, One-way Functions are Essential for Complexity Based Cryptography 1989 30 FOCS Impagliazzo & Naor, Efficient Cryptographic Schemes Provably as Secure as Subset Sum 1989 30 FOCS Kharitonov & Goldberg & Yung, Lower Bounds for Pseudorandom Number Generators 1989 30 FOCS Impagliazzo & Zuckerman, How to Recycle Random Bits 1989 30 FOCS Littlestone & Warmuth, The Weighted Majority Algorithm 1989 30 FOCS Maass & Turan, On the Complexity of Learning from Counterexamples 1989 30 FOCS Tzeng, The Equivalence and Learning of Probabilistic Automata 1989 30 FOCS Fiat & Moses & Shamir & Shimshoni & Tardos, Planning and Learning in Permutation Groups 1989 30 FOCS Ramachandran & Reif, An Optimal Parallel Algorithm for Graph Planarity 1989 30 FOCS Khuller & Schieber, Efficient Parallel Algorithms for Testing Connectivity, and Finding Disjoint s-t Paths in Graphs 1989 30 FOCS Kirousis & Serna & Spirakis, The Parallel Complexity of the Subgraph Connectivity Problem 1989 30 FOCS Khuller & Mitchell & Vazirani, Processor Efficient Parallel Algorithms for the Two Disjoint Paths Problem and for Finding a Kuratowski Homeomorph 1989 30 FOCS Yao, Lower Bounds for Algebraic Computation Trees with Integer Inputs 1989 30 FOCS Landau, Simplification of Nested Radicals 1989 30 FOCS Just, Generalizing the Continued Fraction Algorithm to Arbitrary Dimensions 1989 30 FOCS Mansour & Schieber & Tiwari, The Complexity of Approximating the Square Root 1989 30 FOCS Vaidya, Speeding-up Linear Programming Using Fast Matrix Multiplication 1989 30 FOCS Vaidya, A New Algorithm for Minimizing Convex Functions Over Convex Sets 1989 30 FOCS Driscoll & Healy, Asymptotically Fast Algorithms for Spherical and Related Transforms 1989 30 FOCS Goldberg & Plotkin & Shmoys & Tardos, Interior-Point Methods in Parallel Computation 1989 30 FOCS Awerbuch & Mansour & Shavit, Polynomial End-To-End Communication 1989 30 FOCS Awerbuch & Luby & Goldberg & Plotkin, Network Decomposition and Locality in Distributed Computation 1989 30 FOCS Ricklin & Afek, Upper and Lower Bounds for Routing Schemes in Dynamic Networks 1989 30 FOCS Jiang, The Synchronization of Nonuniform Networks of Finite Automata 1989 30 FOCS Leighton & Maggs, Expanders Might Be Practical: Fast Algorithms for Routing Around Faults on Multibutterflies 1989 30 FOCS Herley, Efficient Simulations of Small Shared Memories on Bounded Degree Networks 1989 30 FOCS Plaxton, On the Network Complexity of Selection 1989 30 FOCS Itkis & Levin, Power of Fast VLSI Models is Insensitive to Wires' Thinness 1989 30 FOCS Berman & Garay & Perry, Towards Optimal Distributed Consensus 1989 30 FOCS Kushilevitz, Privacy and Communication Complexity 1989 30 FOCS Chor & Moscovici, Solvability in Asynchronous Environments 1989 30 FOCS Dolev & Feder, Multiparty Communication Complexity 1989 30 FOCS Di Battista & Tamassia, Incremental Planarity Testing 1989 30 FOCS Broder, Generating Random Spanning Trees 1989 30 FOCS Frederickson, Using Cellular Graph Embeddings in Solving All Pairs Shortest Paths Problems 1989 30 FOCS Dahlhaus & Karpinski, An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO) of an Arbitrary Graph 1989 30 FOCS Condon & Lipton, On the Complexity of Space Bounded Interactive Proofs 1989 30 FOCS Beaver & Goldwasser, Multiparty Computation with Faulty Majority (Extended Announcement) 1989 30 FOCS Kilian & Micali & Ostrovsky, Minimum Resource Zero-Knowledge Proofs (Extended Abstract) 1989 30 FOCS Dwork & Stockmeyer, On the Power of 2-Way Probabilistic Finite State Automata 1989 30 FOCS Dobkin & Suri, Dynamically Computing the Maxima of Decomposable Functions, with Applications 1989 30 FOCS Fortune, Stable Maintenance of Point Set Triangulations in Two Dimensions 1989 30 FOCS Milenkovic, Double Precision Geometry: A General Technique for Calculating Line and Segment Intersections Using Rounded Arithmetic 1989 30 FOCS Duchem & Wagner & Wagner, Area-Optimal Three-Layer Channel Routing 1989 30 FOCS Toda, On the Computational Power of PP and xorP 1989 30 FOCS Fellows & Langston, An Analogue of the Myhill-Nerode Theorem and Its Use in Computing Finite-Basis Characterizations 1989 30 FOCS Mihail, Conductance and Convergence of Markov Chains--A Combinatorial Treatment of Expanders 1989 30 FOCS Cai, Lower Bounds for Constant Depth Circuits in the Presence of Help Bits 1989 30 FOCS Aragon & Seidel, Randomized Search Trees 1989 30 FOCS Mehlhorn & Naher & Rauch, On the Complexity of a Game Related to the Dictionary Problem 1989 30 FOCS Jacobson, Space-efficient Static Trees and Graphs 1989 30 FOCS Sundar, Twists, Turns, Cascades, Deque Conjecture, and Scanning Theorem 1989 30 FOCS Raz & Wigderson, Probabalistic Communication Complexity of Boolean Relations 1989 30 FOCS Cai & Lipton, Subquadratic Simulations of Circuits by Branching Programs 1989 30 FOCS Linial & Mansour & Nisan, Constant Depth Circuits, Fourier Transform and Learnabiltiy 1989 30 FOCS Allender, A Note on the Power of Threshold Circuits 1989 30 FOCS Chazelle, An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra 1989 30 FOCS Mulmuley, On Obstructions in Relation to a Fixed Viewpoint 1989 30 FOCS Overmars & Sharir, Output-Sensitive Hidden Surface Removal 1989 30 FOCS Hansen, Approximation Algorithms for Geometric Embeddings in the Plane with Applications to Parallel Processing Problems 1989 30 FOCS Immerman & Cai, An Optimal Lower Bound on the Number of Variables for Graph Identification 1989 30 FOCS Liskiewicz & Lorys, On Reversal Complexity for Alternating TMs 1989 30 FOCS Fenner & Kurtz & Royer, Every Polynomial-Time 1-Degree Collapses iff P = PSPACE 1988 29 FOCS Nisan & Wigderson, Hardness vs. Randomness 1988 29 FOCS Goldreich & Krawczyk & Luby, On the Existence of Pseudorandom Generators 1988 29 FOCS Kilian, Zero-Knowledge with Log-Space Verifiers 1988 29 FOCS Levin, Homogeneous Measures and Polynomial Time Invariants 1988 29 FOCS Crepeau & Kilian, Achieving Oblivious Transfer Using Weakened Security Assumptions 1988 29 FOCS Mansour & Schieber & Tiwari, Lower Bounds for Integer Greatest Common Divisor Computations 1988 29 FOCS Bshouty, A Lower Bound for Matrix Multiplication 1988 29 FOCS Kahn & Kalai & Linial, The Influence of Variables on Boolean Functions 1988 29 FOCS Lovasz & Saks, Lattices, Moebius Functions and Communication Complexity 1988 29 FOCS Yao, Near-Optimal Time-Space Tradeoff for Element Distinctness 1988 29 FOCS Haussler & Littlestone & Warmuth, Predicting {0,1}-Functions on Randomly Drawn Points 1988 29 FOCS DeSantis & Markowsky & Wegman, Learning Probabilistic Prediction Functions 1988 29 FOCS Linial & Mansour & Rivest, Results on Learnability and the Vapnik-Chervonenkis Dimension 1988 29 FOCS Gasarch & Smith, Learning via Queries 1988 29 FOCS Komlos & Paturi, Effect of Connectivity in Associative Memory Modules (preliminary version) 1988 29 FOCS Klein, Efficient Parallel Algorithms for Chordal Graphs 1988 29 FOCS Luby, Removing Randomness in Parallel Computation Without a Processor Penalty 1988 29 FOCS Goldberg & Plotkin & Vaidya, Sublinear-Time Parallel Algorithms for Matching and Related Problems 1988 29 FOCS Dahlhaus & Hajnal & Karpinski, Optimal Parallel Algorithm for the Hamiltonian Cycle Problem on Dense Graphs 1988 29 FOCS Alon & Azar, Parallel Comparison Algorithms for Approximation Problems 1988 29 FOCS Awerbuch & Sipser, Dynamic Networks are as Fast as Static Networks 1988 29 FOCS Koch, Increasing the Size of a Network by a Constant Factor Can Increase Performance by More Than a Constant Factor 1988 29 FOCS Awerbuch, On the Effects of Feedback in Dynamic Network Protocols 1988 29 FOCS Moses & Waarts, Coordinated Traversal: (t+1)-Round Byzantine Agreement in Polynomial Time 1988 29 FOCS Leighton & Maggs & Rao, Universal Packet Routing Algorithms 1988 29 FOCS Babai & Luks & Seress, Fast Management of Permutation Groups 1988 29 FOCS Shoup, New Algorithms for Finding Irreducible Polynomials Over Finite Fields 1988 29 FOCS Renegar, A Faster PSPACE Algorithm for Deciding the Existential Theory of the Reals 1988 29 FOCS Kaltofen & Trager, Computing with Polynomials Given by Black Boxes for their Evaluations: Greatest Common Divisors, Factorization, Separation of Numerators and Denominators 1988 29 FOCS Canny & Donald & Reif & Xavier, On the Complexity of Kinodynamic Planning 1988 29 FOCS Safra, On the Complexity of omega-Automata 1988 29 FOCS Emerson & Jutla, The Complexity of Tree Automata and Logics of Programs 1988 29 FOCS Courcoubetis & Yannakakis, Verifying Temporal Properties of Finite-State Probabilistic Programs 1988 29 FOCS Ajtai, The Complexity of the Pigeonhole Principle 1988 29 FOCS Ajtai & Fagin, Reachability is Harder for Directed than for Undirected Finite Graphs 1988 29 FOCS Ong, Fully Abstract Models of the Lazy Lambda Calculus 1988 29 FOCS McAllester & Panangaden & Shanbhogue, Nonexpressibility of Fairness and Signaling 1988 29 FOCS Blum & Shub & Smale, On a Theory of Computation over the Real Numbers; NP Completeness, Recursive Functions and Universal Machines (Extended Abstract) 1988 29 FOCS Motwani & Raghunathan & Saran, Constructive Results from Graph Minors: Linkless Embeddings 1988 29 FOCS Dagum & Luby & Mihail & Vazirani, Polytopes, Permanents and Graphs with Large Factors 1988 29 FOCS Leighton & Rao, An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms 1988 29 FOCS Goldberg & Plotkin & Tardos, Combinatorial Algorithms for the Generalized Circulation Problem 1988 29 FOCS Goldschmidt & Hochbaum, Polynomial Algorithm for the k-Cut Problem 1988 29 FOCS Clarkson, A Las Vegas Algorithm for Linear Programming When the Dimension is Small 1988 29 FOCS Malitz, Genus g Graphs Have Pagenumber O(sqrt(g)) 1988 29 FOCS Bhatt & Cai, Take a Walk, Grow a Tree 1988 29 FOCS Broder & Karlin, Bounds on the Cover Time (Preliminary Version) 1988 29 FOCS Eppstein & Galil & Giancarlo, Speeding up Dynamic Programming 1988 29 FOCS Aggarwal & Park, Notes on Searching in Multidimensional Monotone Arrays (preliminary version) 1988 29 FOCS Fredman & Goldsmith, Three Stacks 1988 29 FOCS Dietzfelbinger & Karlin & Mehlhorn & Meyer auf der Heide & Rohnert & Tarjan, Dynamic Perfect Hashing: Upper and Lower Bounds 1988 29 FOCS Ben-Amram & Galil, On Pointers versus Addresses 1988 29 FOCS Chazelle & Friedman, A Deterministic View of Random Sampling and its Use in Geometry 1988 29 FOCS Overmars & Yap, New Upper Bounds in Klee's Measure Problem 1988 29 FOCS Preparata & Tamassia, Fully Dynamic Techniques for Point Location and Transitive Closure in Planar Structures 1988 29 FOCS Clarkson & Edelsbrunner & Guibas & Sharir & Welzl, Complexity Bounds for Arrangements of Curves and Surfaces 1988 29 FOCS Mulmuley, A Fast Planar Partition Algorithm. I 1988 29 FOCS Chazelle & Edelsbrunner, An Optimal Algorithm for Intersecting Line Segments in the Plane 1988 29 FOCS Culberson & Reckhow, Covering Polygons is Hard (Preliminary Abstract) 1987 28 FOCS Chazelle, Polytope Range Searching and Integral Geometry 1987 28 FOCS Ghosh & Mount, An Output Sensitive Algorithm for Computing Visibility Graphs 1987 28 FOCS Dobkin & Friedman & Supowit, Delaunay Graphs Are Almost as Good as Complete Graphs 1987 28 FOCS Edelsbrunner & Pach & Schwartz & Sharir, On the Lower Envelope of Bivariate Functions and Its Applications 1987 28 FOCS Canny, A New Algebraic Method for Robot Motion Planning and Real Geometry 1987 28 FOCS Canny & Reif, New Lower Bound Techniques for Robot Motion Planning Problems 1987 28 FOCS Berman & Roos, Learning One-Counter Languages in Polynomial Time 1987 28 FOCS Littlestone, Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm 1987 28 FOCS Rivest & Schapire, Diversity-Based Inference of Finite Automata 1987 28 FOCS Grolmusz & Ragde, Incomparability in Parallel Computation 1987 28 FOCS Hajnal & Maass & Pudlak & Szegedy & Turan, Threshold Circuits of Bounded Depth 1987 28 FOCS Gurevich, Complete and Incomplete Randomized NP Problems 1987 28 FOCS Blum & Impagliazzo, Generic Oracles and Oracle Classes 1987 28 FOCS van zur Gathen & Kozen & Landau, Functional Decomposition of Polynomials 1987 28 FOCS Ronyai, Factoring Polynomials Over Finite Fields 1987 28 FOCS Kaminski & Bshouty, Multiplicative Complexity of Polynomial Multiplication Over Finite Fields 1987 28 FOCS Mirwald & Schnorr, The Multiplicative Complexity of Quadratic Boolean Forms 1987 28 FOCS Atallah & Cole & Goodrich, Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms 1987 28 FOCS Goldberg & Spencer, A New Parallel Algorithm for the Maximal Independent Set Problem 1987 28 FOCS Grigoriev & Karpinski, The Matching Problem for Bipartite Graphs with Polynomially Bounded Permanents Is in NC 1987 28 FOCS Pan & Reif, Some Polynomial and Toeplitz Matrix Computations 1987 28 FOCS Ranade, How To Emulate Shared Memory 1987 28 FOCS Gereb-Graus & Krizanc, The Complexity of Parallel Comparison Merging 1987 28 FOCS Alon & Azar, The Average Complexity of Deterministic and Randomized Parallel Comparison Sorting Algorithms 1987 28 FOCS Aggarwal & Chandra & Snir, Hierarchical Memory with Block Transfer 1987 28 FOCS Lenstra & Shmoys & Tardos, Approximation Algorithms for Scheduling Unrelated Parallel Machines 1987 28 FOCS Rao, Finding Near Optimal Separators in Planar Graphs 1987 28 FOCS Gazit & Miller, A Parallel Algorithm for Finding a Separator in Planar Graphs 1987 28 FOCS Matula, Determining Edge Connectivity in O(nm) 1987 28 FOCS Kanevsky & Ramachandran, Improved Algorithms for Graph Four-Connectivity 1987 28 FOCS Coppersmith & Raghavan & Tompa, Parallel Graph Algorithms That Are Efficient on Average 1987 28 FOCS Kucera, Canonical Labeling of Regular Graphs in Linear Average Time 1987 28 FOCS Boppana, Eigenvalues and Graph Bisection: An Average-Case Analysis 1987 28 FOCS Broder & Shamir, On the Second Eigenvalue of Random Regular Graphs 1987 28 FOCS Ajtai, Recursive Construction for 3-Regular Expanders 1987 28 FOCS Kilian & Kipnis & Leiserson, The Organization of Permutation Architectures with Bussed Interconnections 1987 28 FOCS Gao & Kaufmann, Channel Routing of Multiterminal Nets 1987 28 FOCS Duris & Galil, Two Lower Bounds in Asynchronous Distributed Computation 1987 28 FOCS Linial, Distributive Graph Algorithms--Global Solutions from Local Data 1987 28 FOCS Attiya & Bar-Noy & Dolev & Koller & Peleg & Reischuk, Achievable Cases in an Asynchronous Environment 1987 28 FOCS Afek & Awerbuch & Plotkin & Saks, Local Management of a Global Resource in a Communication Network 1987 28 FOCS Afek & Awerbuch & Gafni, Applying Static Network Protocols to Dynamic Networks 1987 28 FOCS Israeli & Li, Bounded Time-Stamps 1987 28 FOCS Peterson & Burns, Concurrent Reading While Writing II: The Multiwriter Case 1987 28 FOCS Yao, Lower Bounds to Randomized Algorithms for Graph Properties 1987 28 FOCS Hirsch & Vavasis, Exponential Lower Bounds for Finding Brouwer Fixed Points 1987 28 FOCS Cosmadakis, Database Theory and Cylindric Lattices 1987 28 FOCS Stern, Secret Linear Congruential Generators Are Not Cryptographically Secure 1987 28 FOCS Feldman, A Practical Scheme for Noninteractive Verifiable Secret Sharing 1987 28 FOCS Aiello & Hastad, Perfect Zero-Knowledge Languages Can Be Recognized in Two Rounds 1987 28 FOCS Goldreich & Mansour & Sipser, Interactive Proof Systems: Provers That Never Fail and Random Selection 1987 28 FOCS Oren, On the Cunning Powers of Cheating Verifiers: Some Observations About Zero Knowledge Proofs 1987 28 FOCS Tompa & Woll, Random Self-Reducibility and Zero Knowledge Interactive Proofs of Possession of Information 1987 28 FOCS Tarjan & Van Wyk, Correction to ``A Linear-Time Algorithm for Triangulating a Simple Polygon'' 1987 28 FOCS Vitanyi & Awerbuch, Errata to ``Atomic Shared Register Access by Asynchronous Hardware'' 1986 27 FOCS Abrahamson, Time-Space Tradeoffs for Branching Programs Contrasted With Those for Straight-Line Programs 1986 27 FOCS Aho & Lee, Storing a Dynamic Sparse Table 1986 27 FOCS Aiello & Goldwasser & Hastad, On the Power of Interaction 1986 27 FOCS Alon & Azar & Vishkin, Tight Complexity Bounds for Parallel Comparison Sorting 1986 27 FOCS Alon & Maass, Meanders, Ramsey Theory and Lower Bounds for Branching Programs 1986 27 FOCS Awerbuch & Micali, Dynamic Deadlock Resolution Protocols (Extended Abstract) 1986 27 FOCS Babai & Frankl & Simon, Complexity Classes in Communication Complexity Theory (preliminary version) 1986 27 FOCS Babai, A Las Vegas - NC Algorithm for Isomorphism of Graphs With Bounded Multiplicity of Eigenvalues 1986 27 FOCS Becker & Simon, How Robust is the n-Cube? (Extended Abstract) 1986 27 FOCS Bhatt & Chung & Leighton & Rosenberg, Optimal Simulations of Tree Machines (Preliminary Version) 1986 27 FOCS Brassard & Crepeau & Robert, Information Theoretic Reductions Among Disclosure Problems 1986 27 FOCS Brassard & Crepeau, Non-Transitive Transfer of Confidence: A Perfect Zero-Knowledge Interactive Protocol for SAT and Beyond 1986 27 FOCS Chang & Ibarra & Vergis, On the Power of One-Way Communication 1986 27 FOCS Chazelle, Lower Bounds on the Complexity of Multidimensional Searching 1986 27 FOCS Cole & Vishkin, Approximate and Exact Parallel Scheduling With Applications to List, Tree and Graph Problems 1986 27 FOCS Cole, Parallel Merge Sort 1986 27 FOCS Dwork & Shmoys & Stockmeyer, Flipping Persuasively in Constant Expected Time (Preliminary version) 1986 27 FOCS Dyer & Frieze, Fast Solution of Some Random NP-Hard Problems 1986 27 FOCS Floyd & Karp, FFD Bin Packing for Item Sizes with Distributions on [0,1/2] 1986 27 FOCS Frederickson & Janardan, Separator-Based Strategies for Efficient Message Routing (preliminary version) 1986 27 FOCS Friedman, On Newton's Method for Polynomials 1986 27 FOCS Galil & Tardos, An O(n^2 (m + n log n) log n) Min-Cost Flow Algorithm 1986 27 FOCS Garzon & Zalcstein, The Complexity of Isomorphism Testing 1986 27 FOCS Gazit, An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph 1986 27 FOCS Goldreich & Micali & Wigderson, Proofs That Yield Nothing But Their Validity and a Methodology of Cryptographic Protocol Design 1986 27 FOCS Goldsmith & Joseph, Three Results on the Polynomial Isomorphism of Complete Sets 1986 27 FOCS Greene & Yao, Finite-Resolution Computational Geometry 1986 27 FOCS Hong, Proving by Example and Gap Theorems 1986 27 FOCS Karlin & Manasse & Rudolph & Sleator, Competitive Snoopy Caching 1986 27 FOCS Karp & Saks & Wigderson, On a Search Problem Related to Branch-and-Bound Procedures 1986 27 FOCS Klein & Reif, An Efficient Parallel Algorithm for Planarity 1986 27 FOCS Kurtz & Mahaney & Royer, Collapsing Degrees (Extended Abstract) 1986 27 FOCS Li & Chrobak, k+1 Heads are Better Than k for PDA's 1986 27 FOCS Linial & Lovasz & Wigderson, A Physical Interpretation of Graph Connectivity, and its Algorithmic Applications 1986 27 FOCS Luks, Parallel Algorithms for Permutation Groups and Graph Isomorphism 1986 27 FOCS Ma & Sen & Scherson, The Distance Bound for Sorting on Mesh-Connected Processor Arrays Is Tight (preliminary report) 1986 27 FOCS Moses & Tuttle, Programming Simultaneous Actions Using Common Knowledge: Preliminary Version 1986 27 FOCS Mutchler, What Search Algorithm Gives Optimal Average-Case Performance When Search Resources Are Highly Limited? 1986 27 FOCS Natarajan, An Algorithmic Approach to the Automated Design of Parts Orienters 1986 27 FOCS Peleg & Upfal, The Token Distribution Problem (Preliminary version) 1986 27 FOCS Plantinga & Dyer, An Algorithm for Constructing the Aspect Graph 1986 27 FOCS Raghavan, Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs 1986 27 FOCS Saks & Wigderson, Probabilistic Boolean Decision Trees and the Complexity of Evaluating Game Trees 1986 27 FOCS Sharir & Cole & Kedem & Leven & Pollack & Sifrony, Geometric Applications of Davenport-Schinzel Sequences 1986 27 FOCS Stout, Meshes With Multiple Buses 1986 27 FOCS Strassen, The Asymptotic Spectrum of Tensors and the Exponent of Matrix Multiplication 1986 27 FOCS Tompa & Venkateswaran, A New Pebble Game That Characterizes Parallel Complexity Classes 1986 27 FOCS Ullman & Van Gelder, Parallel Complexity of Logical Query Programs 1986 27 FOCS Vaidya, An Optimal Algorithm for the All-Nearest-Neighbors Problem 1986 27 FOCS Vitanyi & Awerbuch, Atomic Shared Register Access by Asynchronous Hardware (Detailed Abstract) 1986 27 FOCS von zur Gathen, Permanent and Determinant 1986 27 FOCS Wiernik, Planar Realizations of Nonlinear Davenport-Schinzel Sequences by Segments 1986 27 FOCS Wilber, Lower Bounds for Accessing Binary Search Trees with Rotations 1986 27 FOCS Yao, How To Generate and Exchange Secrets (extended abstract) 1985 26 FOCS Aggarwal & Chazelle & Guibas & O'Dunlaing & Yap, Parallel Computational Geometry 1985 26 FOCS Aggarwal & Klawe & Lichtenstein & Linial & Wigderson, Multilayer Grid Embeddings 1985 26 FOCS Ajtai & Wigderson, Deterministic Simulation of Probabilistic Constant Depth Circuits 1985 26 FOCS Alon & Frankl & Rodl, Geometrical Realization of Set Systems and Probabilistic Communication Complexity 1985 26 FOCS Ambos-Spies, Three Theorems on Polynomial Degrees of NP-Sets 1985 26 FOCS Asano & Asano & Guibas & Hershberger & Imai, Visibility-Polygon Search and Euclidean Shortest Paths 1985 26 FOCS Atallah & Hambrusch, Solving Tree Problems on a Mesh-Connected Processor Array 1985 26 FOCS Chor & Goldwasser & Micali & Awerbuch, Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults (Extended Abstract) 1985 26 FOCS Awerbuch & Gallager, Distributed BFS Algorithms 1985 26 FOCS Bach & Shallit, Factoring with Cyclotomic Polynomials 1985 26 FOCS Ben-Or & Linial, Collective Coin Flipping, Robust Voting Schemes and Minima of Banzhaf Values 1985 26 FOCS Bern & Lawler & Wong, Why Certain Subgraph Computations Require Only Linear Time 1985 26 FOCS Boehm, Partial Polymorphic Type Inference Is Undecidable 1985 26 FOCS Boppana, Amplification of Probabilistic Boolean Formulas 1985 26 FOCS Celis & Larson & Munro, Robin Hood Hashing 1985 26 FOCS Chazelle, Slimming Down Search Structures: A Functional Approach to Algorithm Design 1985 26 FOCS Chin & Ting, Weight Spanning Trees 1985 26 FOCS Chor & Goldreich & Hastad & Freidmann & Rudich & Smolensky, The Bit Extraction Problem or t-Resilient Functions 1985 26 FOCS Chor & Goldreich, Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity 1985 26 FOCS Cohen & Fischer, A Robust and Verifiable Cryptographically Secure Election Scheme 1985 26 FOCS Cole & Siegel, On Information Flow and Sorting: New Upper and Lower Bounds for VLSI Circuits 1985 26 FOCS Courcelle, Equivalence and Transformations of Recursive Definitions 1985 26 FOCS Feldman & Micali, Byzantine Agreement in Constant Expected Time (and Trusting No One) 1985 26 FOCS Fischer & Paterson, Dynamic Monotone Priorities on Planar Sets 1985 26 FOCS Frank & Tardos, An Application of Simultaneous Approximation in Combinatorial Optimization 1985 26 FOCS Gabor & Hsu & Supowit, Recognizing Circle Graphs in Polynomial Time 1985 26 FOCS Gabow, A Scaling Algorithm for Weighted Matching on General Graphs 1985 26 FOCS Galil & Haber & Yung, A Private Interactive Test of a Boolean Predicate and Minimum-Knowledge Public-Key Cryptosystems 1985 26 FOCS Galil & Pan, Improved Processor Bounds for Algebraic and Combinatorial Problems in RNC 1985 26 FOCS Greenberg & Leiserson, Randomized Routing on Fat-Trees 1985 26 FOCS Gurevich & Shelah, Fixed-Point Extensions of First-Order Logic 1985 26 FOCS Hirschberg & Larmore, The Least Weight Subsequence Problem 1985 26 FOCS Hochbaum & Shmoys, Using Dual Approximation Algorithms for Scheduling Problems: Theoretical and Practical Results 1985 26 FOCS Huang, Solving Some Graph Problems with Optimal or Near-Optimal Speedup on Mesh-of-Trees Networks 1985 26 FOCS Ja'Ja', Identification Is Easier Than Decoding 1985 26 FOCS Johnson & Papadimitriou & Yannakakis, How Easy Is Local Search? 1985 26 FOCS Kaltofen, Computing with Polynomials Given by Straight-Line Programs II: Sparse Factorization 1985 26 FOCS Karp & Upfal & Wigderson, The Complexity of Parallel Computation on Matroids 1985 26 FOCS Kirousis & Papadimitriou, The Complexity of Recognizing Polyhedral Scenes 1985 26 FOCS Kozen & Yap, Algebraic Cell Decomposition in NC 1985 26 FOCS Landau & Vishkin, Efficient String Matching in the Presence of Errors 1985 26 FOCS Li, Simulating Two Pushdown Stores by One Tape in O(n^{1.5} sqrt(log n)) Time 1985 26 FOCS Lovasz, Computing Ears and Branchings in Parallel 1985 26 FOCS Luks & McKenzie, Fast Parallel Computation with Permutation Groups 1985 26 FOCS Mairson, Average Case Lower Bounds on the Construction and Searching of Partial Orders 1985 26 FOCS Meyer auf der Heide & Wigderson, The Complexity of Parallel Sorting 1985 26 FOCS Meyer auf der Heide, Nondeterministic Versus Probabilistic Linear Search Algorithms 1985 26 FOCS Miller & Reif, Parallel Tree Contraction and Its Application 1985 26 FOCS Moffat & Takaoka, An All Pairs Shortest Path Algorithm with Expected Running Time O(n^2 log n) 1985 26 FOCS Pan, Fast and Efficient Algorithms for Sequential and Parallel Evaluation of Polynomial Zeros and of Matrix Polynomials 1985 26 FOCS Papadimitriou & Wolfe, The Complexity of Facets Resolved 1985 26 FOCS Pippenger, On Networks of Noisy Gates 1985 26 FOCS Reif & Sharir, Motion Planning in the Presence of Moving Obstacles 1985 26 FOCS Reif, An Optimal Parallel Algorithm for Integer Sorting 1985 26 FOCS Rudich, Inferring the Structure of a Markov Chain from Its Output 1985 26 FOCS Sharir & Livne, On Minima of Functions, Intersection Patterns of Curves, and Davenport-Schinzel Sequences 1985 26 FOCS Vardi, Automatic Verification of Probabilistic Concurrent Finite-State Programs 1985 26 FOCS Vazirani & Vazirani, Random Polynomial Time Is Equal to Slightly-Random Polynomial Time 1985 26 FOCS Vitanyi, Area Penalty for Sublinear Signal Propagation Delay on Chip 1985 26 FOCS Vitter, Design and Analysis of Dynamic Huffman Coding 1985 26 FOCS Yao, Separating the Polynomial-Time Hierarchy by Oracles 1984 25 FOCS Aggarwal, A Comparative Study of X-Tree, Pyramid, and Related Machines 1984 25 FOCS Alexi & Chor & Goldreich & Schnorr, RSA/Rabin Bits are 1/2 + 1/poly(log N) Secure 1984 25 FOCS Alon & Milman, Eigenvalues, Expanders, and Superconcentrators 1984 25 FOCS Babai & Szemeredi, On the Complexity of Matrix Group Problems 1984 25 FOCS Balcazar & Book & Long & Schoning & Selman, Sparse Oracles and Uniform Complexity Classes 1984 25 FOCS Beame & Cook & Hoover, Log Depth Circuits for Division and Related Problems 1984 25 FOCS Blum & Shub, Evaluating Rational Functions: Infinite Precision Is Finite Cost and Tractable on Average 1984 25 FOCS Blum, Independent Unbiased Coin Flips from a Correlated Biased Source: A Finite State Markov Chain 1984 25 FOCS Broder & Dolev, Flipping Coins in Many Pockets (Byzantine Agreement on Uniformly Random Values) 1984 25 FOCS Bui & Chaudhuri & Leighton & Sipser, Graph Bisection Algorithms with Good Average Case Behavior 1984 25 FOCS Chang & Yap, A Polynomial Solution for Potato-Peeling and Other Polygon Inclusion and Enclosure Problems 1984 25 FOCS Chazelle, Computing on a Free Tree Via Complexity-Preserving Mappings 1984 25 FOCS Cole & Siegel, River Routing Every Which Way, But Loose 1984 25 FOCS Cole, Slowing Down Sorting Networks To Obtain Faster Sorting Algorithms 1984 25 FOCS Dobkin & Edelsbrunner, Space Searching for Intersecting Objects 1984 25 FOCS Eberly, Very Fast Parallel Matrix and Polynomial Arithmetic 1984 25 FOCS El Gamal & Orlitsky, Interactive Data Compression 1984 25 FOCS Fagin & Halpern & Vardi, A Model-Theoretic Analysis of Knowledge: Preliminary Report 1984 25 FOCS Fiat & Shamir, Polymorphic Arrays: A Novel VLSI Layout for Systolic Computers 1984 25 FOCS Fischer & Paterson, Fishspear: A Priority Queue Algorithm 1984 25 FOCS Fredman & Tarjan, Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms 1984 25 FOCS Friedman, Constructing O(n log n) Size Monotone Formulae for the k-th Elementary Symmetric Polynomial of n Boolean Variables 1984 25 FOCS Frieze & Kannan & Lagarias, Linear Congruential Generators Do Not Produce Random Sequences 1984 25 FOCS Gabow & Galil & Spencer, Efficient Implementation of Graph Algorithms Using Contraction 1984 25 FOCS Goldreich & Goldwasser & Micali, How To Construct Random Functions 1984 25 FOCS Goldwasser & Micali & Rivest, A "Paradoxical" Solution to the Signature Problem 1984 25 FOCS Greenberg & Weiss, A Lower Bound for Probabilistic Algorithms for Finite State Machines 1984 25 FOCS Grollmann & Selman, Complexity Measures for Public-Key Cryptosystems 1984 25 FOCS Hart & Sharir, Nonlinearity of Davenport-Schinzel Sequences and of a Generalized Path Compression Scheme 1984 25 FOCS Heath, Embedding Planar Graphs in Seven Pages 1984 25 FOCS Homer, Minimal Degrees for Honest Polynomial Reducibilities 1984 25 FOCS Ibarra & Palis & Kim, Designing Systolic Algorithms Using Sequential Machines 1984 25 FOCS Imai & Asano, Dynamic Segment Intersection Search with Applications 1984 25 FOCS Itai & Rodeh, The Multi-Tree Approach to Reliability in Distributed Networks 1984 25 FOCS Kaminski, Multiplication of Polynomials Over the Ring of Integers 1984 25 FOCS Kannan & Miller & Rudolph, Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers 1984 25 FOCS Komlos, Linear Verification for Spanning Trees 1984 25 FOCS Kornhauser & Miller & Spirakis, Coordinating Pebble Motion on Graphs, the Diameter of Permutation Groups, and Applications 1984 25 FOCS Meyer auf der Heide & Reischuk, On the Limits To Speed Up Parallel Machines by Large Hardware and Unbounded Communication 1984 25 FOCS Mishra, An Efficient Algorithm To Find All `Bidirectional' Edges of an Undirected Graph 1984 25 FOCS Mitchell, Semantic Models for Second-Order Lambda Calculus 1984 25 FOCS Moran & Snir & Manber, Applications of Ramsey's Theorem to Decision Trees Complexity 1984 25 FOCS Mulmuley, A Semantic Characterization of Full Abstraction for Typed Lambda Calculi 1984 25 FOCS Munro, An Implicit Data Structure for the Dictionary Problem That Runs in Polylog Time 1984 25 FOCS Papadimitriou & Ullman, A Communication-Time Tradeoff 1984 25 FOCS Paturi & Simon, Probabilistic Communication Complexity 1984 25 FOCS Pippenger, Parallel Communication with Limited Buffers 1984 25 FOCS Pitt, A Characterization of Probabilistic Inference 1984 25 FOCS Santha & Vazirani, Generating Quasi-Random Sequences from Slightly-Random Sources 1984 25 FOCS Sedgewick & Vitter, Shortest Paths in Euclidean Graphs 1984 25 FOCS Shor, The Average-Case Analysis of Some On-Line Algorithms for Bin Packing 1984 25 FOCS Stallman & Gabow, An Augmenting Path Algorithm for the Parity Problem on Linear Matroids 1984 25 FOCS Sullivan, A Polynomial Time Algorithm for Fault Diagnosability 1984 25 FOCS Tarjan & Vishkin, Finding Biconnected Components and Computing Tree Functions in Logarithmic Parallel Time 1984 25 FOCS Tiwari, Lower Bounds on Communication Complexity in Distributed Computer Networks 1984 25 FOCS Upfal & Wigderson, How to Share Memory in a Distributed System 1984 25 FOCS Vaidya, A Fast Approximation Algorithm for Minimum Spanning Trees in k-Dimensional Space 1984 25 FOCS Vazirani & Vazirani, Efficient and Secure Pseudo-Random Number Generation 1984 25 FOCS von zur Gathen, Parallel Powering 1983 24 FOCS Aggarwal, Period-Time Tradeoffs for VLSI Models with Delay 1983 24 FOCS Ajtai & Fredman & Komlos, Hash Functions for Priority Queues 1983 24 FOCS Alt, Multiplication Is the Easiest Nontrivial Arithmetic Function 1983 24 FOCS Asano & Asano, Minimum Partition of Polygonal Regions into Trapezoids 1983 24 FOCS Atallah, Dynamic Computational Geometry 1983 24 FOCS Babai & Kantor & Luks, Computational Complexity and the Classification of Finite Simple Groups 1983 24 FOCS Baker & Pinter, An Algorithm for the Optimal Placement and Routing of a Circuit within a Ring of Pads 1983 24 FOCS Baker, Approximation Algorithms for NP-Complete Problems on Planar Graphs 1983 24 FOCS Beauquier & Gire, On Context-Free Generators 1983 24 FOCS Berman & Simon, Lower Bounds on Graph Threading by Probabilistic Machines 1983 24 FOCS Chazelle & Guibas & Lee, The Power of Geometric Duality 1983 24 FOCS Chazelle, Filtering Search: A New Approach to Query Answering 1983 24 FOCS Clarkson, Fast Algorithms for the All Nearest Neighbors Problem 1983 24 FOCS Cole & Yap, Geometric Retrieval Problems 1983 24 FOCS Dolev & Dwork & Stockmeyer, On the Minimal Synchronism Needed for Distributed Consensus 1983 24 FOCS Edelsbrunner & O'Rourke & Seidel, Constructing Arrangements of Lines and Hyperplanes with Applications 1983 24 FOCS Even & Goldreich, On the Security of Multi-Party Ping-Pong Protocols 1983 24 FOCS Flajolet & Martin, Probabilistic Counting 1983 24 FOCS Flajolet & Puech, Tree Structures for Partial Match Retrieval 1983 24 FOCS Frederickson, Shortest Path Problems in Planar Graphs 1983 24 FOCS Gabow, Scaling Algorithms for Network Problems 1983 24 FOCS Greenberg & Ladner, Estimating the Multiplicities of Conflicts in Multiple Access Channels 1983 24 FOCS Guibas & Ramshaw & Stolfi, A Kinetic Framework for Computational Geometry 1983 24 FOCS Gurevich, Algebras of Feasible Functions 1983 24 FOCS Hartmanis, Generalized Kolmogorov Complexity and the Structure of Feasible Computations 1983 24 FOCS Hochschild & Mayr & Siegel, Techniques for Solving Graph Problems in Parallel Environments 1983 24 FOCS Incerpi & Sedgewick, Improved Upper Bounds on Shellsort 1983 24 FOCS Ja'Ja', On the Computational Complexity of the Permanent 1983 24 FOCS Johnson & Venkatesan, Partition of Planar Flow Networks 1983 24 FOCS Kahn & Saks & Sturtevant, A Topological Approach to Evasiveness 1983 24 FOCS Karp & Leighton & Rivest & Thompson & Vazirani & Vazirani, Global Wire Routing in Two-Dimensional Arrays 1983 24 FOCS Karp & Luby, Monte-Carlo Algorithms for Enumeration and Reliability Problems 1983 24 FOCS Klawe, A Tight Bound for Black and White Pebbles on the Pyramid 1983 24 FOCS Kraus & Lehmann, Decision Procedures for Time and Chance 1983 24 FOCS Lagarias & Odlyzko, Solving Low Density Subset Sum Problems 1983 24 FOCS Leivant, Reasoning about Functional Programs and Complexity Classes Associated with Type Disciplines 1983 24 FOCS Linial & Saks, Information Bounds Are Good for Search Problems on Ordered Data Structures 1983 24 FOCS Linial, Legal Coloring of Graphs 1983 24 FOCS Luby & Micali & Rackoff, How To Simultaneously Exchange a Secret Bit by Flipping a Symmetrically Biased Coin 1983 24 FOCS Lueker, Bin Packing with Items Uniformly Distributed over Intervals [a,b] 1983 24 FOCS Mairson, The Program Complexity of Searching a Table 1983 24 FOCS McKenzie & Cook, The Parallel Complexity of the Abelian Permutation Group Membership Problem 1983 24 FOCS Papadimitriou, Games against Nature 1983 24 FOCS Parikh, Propositional Game Logic 1983 24 FOCS Paturi & Simon, Lower Bounds on the Time of Probabilistic On-Line Simulations 1983 24 FOCS Paul & Pippenger & Szemeredi & Trotter, On Determinism Versus Non-Determinism and Related Problems 1983 24 FOCS Rabin, Randomized Byzantine Generals 1983 24 FOCS Reif, Logarithmic Depth Circuits for Algebraic Functions 1983 24 FOCS Schnitger, On Depth-Reduction and Grates 1983 24 FOCS Tiuryn & Urzyczyn, Some Relationships between Logics of Programs and Complexity Theory 1983 24 FOCS Vazirani & Vazirani, Trapdoor Pseudo-Random Number Generators, with Applications to Protocol Design 1983 24 FOCS Vishkin & Wigderson, Trade-Offs between Depth and Width in Parallel Computation 1983 24 FOCS Vitter, Optimum Algorithms for Two Random Sampling Problems 1983 24 FOCS von zur Gathen, Factoring Sparse Multivariate Polynomials 1983 24 FOCS von zur Gathen, Representations of Rational Functions 1983 24 FOCS Wilber, Randomness and the Density of Hard Problems 1983 24 FOCS Wilson, Relativized Circuit Complexity 1983 24 FOCS Wolper & Vardi & Sistla, Reasoning about Infinite Computation Paths 1983 24 FOCS Yannakakis, A Polynomial Algorithm for the Min Cut Linear Arrangement of Trees 1983 24 FOCS Yao, Lower Bounds by Probabilistic Arguments 1982 23 FOCS Adleman & McDonnell, An Application of Higher Reciprocity to Computational Number Theory (Abstract) 1982 23 FOCS Beauquier & Latteux, Substitution of Bounded Rational Cone 1982 23 FOCS Blum & Micali, How To Generate Cryptographically Strong Sequences of Pseudo Random Bits 1982 23 FOCS Borodin & von zur Gathen & Hopcroft, Fast Parallel Matrix and GCD Computations 1982 23 FOCS Chandra & Stockmeyer & Vishkin, A Complexity Theory for Unbounded Fan-In Parallelism 1982 23 FOCS Chazelle, A Theorem on Polygon Cutting with Applications 1982 23 FOCS Chor & Leiserson & Rivest, An Application of Number Theory to the Organization of Raster-Graphics Memory (Extended Abstract) 1982 23 FOCS Chung & Makedon & Sudborough & Turner, Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted Trees 1982 23 FOCS Dolev & Reischuk & Strong, `Eventual' Is Earlier Than `Immediate' 1982 23 FOCS Fredman & Komlos & Szemeredi, Storing a Sparse Table with O(1) Worst Case Access Time 1982 23 FOCS Galil & Hoffmann & Luks & Schnorr & Weber, An O(n^3 log n) Deterministic and an O(n^3) Probabilistic Isomorphism Test for Trivalent Graphs 1982 23 FOCS Galil & Micali & Gabow, Priority Queues with Variable Priority and an O(EV log V) Algorithm for Finding a Maximal Weighted Matching in General Graphs 1982 23 FOCS Goldwasser & Micali & Tong, Why and How to Establish a Private Code on a Public Network (Extended Abstract) 1982 23 FOCS Halpern, Deterministic Process Logic Is Elementary 1982 23 FOCS Hopcroft & Joseph & Whitesides, On the Movement of Robot Arms in 2-Dimensional Bounded Regions 1982 23 FOCS Huynh, Deciding the Inequivalence of Context-Free Grammars with 1-Letter Terminal Alphabet Is Sigma-p-2-Complete 1982 23 FOCS Iwama, On Equations Including String Variables 1982 23 FOCS Jerrum, A Compact Representation for Permutation Groups 1982 23 FOCS Johnson & Venkatesan, Parallel Algorithms for Minimum Cuts and Maximum Flows in Planar Networks (Preliminary Version) 1982 23 FOCS Kaltofen, A Polynomial-Time Reduction from Bivariate to Univariate Integral Polynomial Factorization 1982 23 FOCS Karmarkar & Karp, An Efficient Approximation Scheme for the One-Dimensional Bin-Packing Problem 1982 23 FOCS Karmarkar, Probabilistic Analysis of Some Bin-Packing Problems 1982 23 FOCS Kedem, Optimal Allocation of Computational Resources in VLSI (Preliminary Report) 1982 23 FOCS Lagarias, The Computational Complexity of Simultaneous Diophantine Approximation Problems 1982 23 FOCS Leighton & Leiserson, Wafer-Scale Integration of Systolic Arrays (Extended Abstract) 1982 23 FOCS Lengauer, The Complexity of Compacting Hierarchically Specified Layouts of Integrated Circuits (Preliminary Version) 1982 23 FOCS Megiddo, Linear-Time Algorithms for Linear Programming in R^3 and Related Problems 1982 23 FOCS Mehlhorn, On the Program Size of Perfect and Universal Hash Functions 1982 23 FOCS O'Dunlaing & Yap, Generic Transformation of Data Structures 1982 23 FOCS Papadimitriou, On the Complexity of Unique Solutions 1982 23 FOCS Paul, On-Line Simulation of k+1 Tapes by k Tapes Requires Nonlinear Time 1982 23 FOCS Plumstead, Inferring a Sequence Generated by a Linear Congruence 1982 23 FOCS Preparata & Lipski, Three Layers Are Enough (Extended Abstract) 1982 23 FOCS Queille & Sifakis, A Temporal Logic To Deal with Fairness in Transition Systems 1982 23 FOCS Ramachandran, On Driving Many Long Lines in a VLSI Layout 1982 23 FOCS Reif, Parallel Time O(log N) Acceptance of Deterministic CFLs 1982 23 FOCS Reisch & Schnitger, Three Applications of Kolmogorov-Complexity 1982 23 FOCS Shamir, A Polynomial Time Algorithm for Breaking the Basic Merkle-Hellman Cryptosystem 1982 23 FOCS Stout, Using Clerks in Parallel Processing 1982 23 FOCS Sturtivant, Generalised Symmetries of Polynomials in Algebraic Complexity 1982 23 FOCS Ursic, The Ellipsoid Algorithm for Linear Inequalities in Exact Arithmetic 1982 23 FOCS Vardi, On Decomposition of Relational Databases 1982 23 FOCS Vazirani & Vazirani, A Natural Encoding Scheme Proved Probabilistic Polynomial Complete 1982 23 FOCS Yamnitsky & Levin, An Old Linear Programming Algorithm Runs in Polynomial Time 1982 23 FOCS Yao, Protocols for Secure Computations (Extended Abstract) 1982 23 FOCS Yao, Theory and Applications of Trapdoor Functions (Extended Abstract) 1981 22 FOCS Adleman & Odlyzko, Irreducibility Testing and Factorization of Polynomials (Extended Abstract) 1981 22 FOCS Aviad & Shamir, A Direct Dynamic Solution to Range Search and Related Problems for Product Regions 1981 22 FOCS Ben-Or, Probabilistic Algorithms in Finite Fields 1981 22 FOCS Blum, An Omega(N^{4/2}) Lower Bound on the Monotone Network Complexity of the N-th Degree Convolution 1981 22 FOCS Book & Wilson & Mei-Rui, Relativizing Time and Space (Preliminary Report) 1981 22 FOCS Burns, Symmetry in Systems of Asynchronous Processes 1981 22 FOCS Coppersmith & Winograd, On the Asymptotic Complexity of Matrix Multiplication (Extended Summary) 1981 22 FOCS Dolev & Yao, On the Security of Public Key Protocols (Extended Abstract) 1981 22 FOCS Dolev, Unanimity in an Unknown and Unreliable Environment 1981 22 FOCS Duris & Galil, A Time-Space Tradeoff for Language Recognition 1981 22 FOCS Feig & Winograd, On the Direct Sum Conjecture (Extended Summary) 1981 22 FOCS Flajolet & Steyaert, A Complexity Calculus for Classes of Recursive Search Programs Over Tree Structures 1981 22 FOCS Frederickson, Implicit Data Structures for the Weighted Dictionary Problem (Preliminary Version) 1981 22 FOCS Furst & Saxe & Sipser, Parity, Circuits, and the Polynomial-Time Hierarchy 1981 22 FOCS Gacs, On the Relation Between Descriptional Complexity and Algorithmic Probability 1981 22 FOCS Gurari & Ibarra, Two-Way Counter Machines and Diophantine Equations 1981 22 FOCS Halpern & Reif, The Propositional Dynamic Logic of Deterministic, Well-Structured Programs (Extended Abstract) 1981 22 FOCS Harel & Pnueli & Stavi, Propositional Dynamic Logic of Context-Free Programs 1981 22 FOCS Itai & Rodeh, Symmetry Breaking in Distributive Networks 1981 22 FOCS Ja'Ja', Computation of Algebraic Functions with Root Extractions 1981 22 FOCS Johnson & Klug, Optimizing Conjunctive Queries When Attribute Domains Are Not Disjoint (Extended Abstract) 1981 22 FOCS Kanellakis & Papadimitriou, The Complexity of Distributed Concurrency Control 1981 22 FOCS Kannan, A Circuit-Size Lower Bound 1981 22 FOCS Kannan, Towards Separating Nondeterministic Time from Deterministic Time 1981 22 FOCS Karp & Sipser, Maximum Matchings in Sparse Random Graphs 1981 22 FOCS Kedem & Zorat, On Relations Between Input and Communication/Computation in VLSI (Preliminary Report) 1981 22 FOCS Klawe, Non-Existence of One-Dimensional Expanding Graphs 1981 22 FOCS Leighton, New Lower Bound Techniques for VLSI 1981 22 FOCS Leiserson & Saxe, Optimizing Synchronous Systems 1981 22 FOCS Lipton & Valdes, Census Functions: An Approach to VLSI Upper Bounds (Preliminary Version) 1981 22 FOCS Loui, Simulations Among Multidimensional Turing Machines (Preliminary Version) 1981 22 FOCS Mahaney, On the Number of P-Isomorphism Classes of NP-Complete Sets 1981 22 FOCS Manber & Tompa, The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem 1981 22 FOCS Megiddo & Hakimi & Garey & Johnson & Papadimitriou, The Complexity of Searching a Graph (Preliminary Report) 1981 22 FOCS Megiddo, Applying Parallel Computaion Algorithms in the Design of Serial Algorithms 1981 22 FOCS Papadimitriou & Yannakakis, Worst-Case Ratios for Planar Graphs and the Method of Induction on Faces (Extended Abstract) 1981 22 FOCS Paul, On Heads Versus Tapes 1981 22 FOCS Post, A Minimum Spanning Ellipse Algorithm 1981 22 FOCS Pratt, A Decidable Mu-Calculus (Preliminary Report) 1981 22 FOCS Reischuk, A Fast Probabilistic Parallel Sorting Algorithm 1981 22 FOCS Rounds & Brookes, Possible Futures, Acceptances, Refusals, and Communicating Processes 1981 22 FOCS Sethi, A Model of Concurrent Database Transactions (Summary) 1981 22 FOCS Skyum & Valiant, A Complexity Theory Based on Boolean Algebra 1981 22 FOCS Smith, The Power of Parallelism for Automatic Program Systhesis 1981 22 FOCS Statman, Number Theoretic Functions Computable by Polymorphic Programs (Extended Abstract) 1981 22 FOCS Stearns & Hunt, On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Grammars, and Automata 1981 22 FOCS Tiuryn, Unbounded Program Memory Adds to the Expressive Power of First-Order Dynamic Logic (Extended Abstract) 1981 22 FOCS Vardi, Global Decision Problems for Relational Databases 1981 22 FOCS Verbeek, Time-Space Trade-Offs for General Recursion 1981 22 FOCS Vitter, Deletion Algorithms for Hashing That Preserve Randomness (Detailed Abstract) 1981 22 FOCS Wolper, Temporal Logic Can Be More Expressive 1980 21 FOCS Adleman, On Distinguishing Prime Numbers from Composite Numbers 1980 21 FOCS Bent & Sleator & Tarjan, Biased 2-3 Trees 1980 21 FOCS Bentley & Brown, A General Class of Resource Tradeoffs 1980 21 FOCS Brassard, A Time-Luck Tradeoff in Cryptography 1980 21 FOCS Chandra & Harel, Structure and Complexity of Relational Queries 1980 21 FOCS Chew, An Improved Algorithm for Computing with Equations 1980 21 FOCS Constable, Programs and Types 1980 21 FOCS Courcelle & Franchi-Zannettacci, On the Expressive Power of Attribute Grammars 1980 21 FOCS Doberkat, Some Observations on the Average Behavior of Heapsort 1980 21 FOCS Dobkin & Munro, Efficient Uses of the Past 1980 21 FOCS Dymond & Cook, Hardware Complexity and Parallel Computation 1980 21 FOCS Flajolet & Odlyzko, Exploring Binary Trees and Other Simple Trees 1980 21 FOCS Floyd & Ullman, The Compilation of Regular Expressions into Integrated Circuits 1980 21 FOCS Francez & Lehmann & Pnueli, A Linear History Semantics for Distributed Languages 1980 21 FOCS Francez & Rodeh, A Distributed Abstract Data Type Implemented by a Probabilistic Communication Scheme 1980 21 FOCS Frederickson, Implicit Data Structures with Fast Update 1980 21 FOCS Fredman, The Inherent Complexity of Dynamic Data Structures Which Accommodate Range Queries 1980 21 FOCS Furst & Hopcroft & Luks, Polynomial-Time Algorithms for Permutation Groups 1980 21 FOCS Gurari, The Equivalence Problem for Deterministic Two-Way Sequential Transducers Is Decidable 1980 21 FOCS Harel & Kozen & Parikh, Process Logic: Expressiveness, Decidability, Completeness 1980 21 FOCS Harel, A Linear Time Algorithm for the Lowest Common Ancestors Problem 1980 21 FOCS Hong, On Similarity and Duality of Computation 1980 21 FOCS Hu & Shing, Some Theorems About Matrix Multiplications 1980 21 FOCS Huet & Hullot, Proofs by Induction in Equational Theories with Constructors 1980 21 FOCS Hunt & Rosenkrantz, The Complexity of Recursion Schemes and Recursive Programming Languages 1980 21 FOCS Immerman, Upper and Lower Bounds for First Order Expressibility 1980 21 FOCS Jones & Muchnick, Complexity of Flow Analysis, Inductive Assertion Synthesis and a Language Due to Dijkstra 1980 21 FOCS Karp & Papadimitriou, On Linear Characterizations of Combinatorial Optimization Problems 1980 21 FOCS Kfoury, Loop Elimination and Loop Reduction--A Model-Theoretic Analysis of Programs 1980 21 FOCS LaPaugh, A Polynomial Time Algorithm for Optimal Routing Around a Rectangle 1980 21 FOCS Leiserson, Area-Efficient Graph Layouts (for VLSI) 1980 21 FOCS Luks, Isomorphism of Bounded Valence Can Be Tested in Polynomial Time 1980 21 FOCS Mahaney, Sparse Complete Sets for NP: Solution of a Conjecture of Berman and Hartmanis 1980 21 FOCS Micali & Vazirani, An O(V^{1/2}E) Algorithm for Finding Maximum Matching in General Graphs 1980 21 FOCS Peterson, Succinct Representation, Random Strings, and Complexity Classes 1980 21 FOCS Rabin, N-Process Synchronization by 4 log_2 N-Valued Shared Variable 1980 21 FOCS Simons, A Fast Algorithm for Multiprocessor Scheduling 1980 21 FOCS Sudborough, Efficient Algorithms for Path System Problems and Applications to Alternating Time-Space Complexity Classes 1980 21 FOCS Vitter, Tuning the Coalesced Hashing Method To Obtain Optimum Performance 1980 21 FOCS von Braunmuhl & Verbeek, A Recognition Algorithm for Deterministic CFLs Optimal in Time and Space 1980 21 FOCS Vuillemin, A Combinatorial Limit to the Computing Power of VLSI Circuits 1980 21 FOCS Wegman, Parsing for Structural Editors 1980 21 FOCS Yannakakis & Papadimitriou, Algebraic Dependencies 1980 21 FOCS Yannakakis, On a Class of Totally Unimodular Matrices 1980 21 FOCS Yao, On the Priority Approach to Hidden-Surface Algorithms 1979 20 FOCS Adleman & Manders, Reductions That Lie 1979 20 FOCS Adleman, A Subexponential Algorithm for the Discrete Logarithm Problem with Applications to Cryptography 1979 20 FOCS Aho & Ullman & Yannakakis, Modeling Communications Protocols by Automata 1979 20 FOCS Aleliunas & Karp & Lipton & Lovasz & Rackoff, Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems 1979 20 FOCS Aspvall & Shiloach, A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables per Inequality 1979 20 FOCS Babai & Kucera, Graph Canonization in Linear Average Time 1979 20 FOCS Baker & Hartmanis, Succinctness, Verifiability and Determinism in Representations of Polynomial Time 1979 20 FOCS Blattner, The Decidability of the Equivalence of Context-Free Grammar Forms 1979 20 FOCS Borodin & Fischer & Kirkpatrick & Lynch & Tompa, A Time-Space Tradeoff for Sorting and Related Non-Oblivious Computations 1979 20 FOCS Brassard, Relativized Cryptography 1979 20 FOCS Clarke & Liu, Approximate Algorithms for Optimization of Busy Waiting in Parallel Programs 1979 20 FOCS Dershowitz, Orderings for Term-Rewriting Systems 1979 20 FOCS Dobkin & Snyder, On a General Method for Maximizing and Minimizing Among Certain Geometric Problems 1979 20 FOCS Fischer & Lynch & Burns & Borodin, Resource Allocation with Immunity to Limited Process Failure 1979 20 FOCS Flajolet & Francon & Vuillemin, Sequence of Operations Analysis of Dynamic Data Structures 1979 20 FOCS Gabber & Galil, Explicit Constructions of Linear Size Concentrators and Superconcentrators 1979 20 FOCS Gabow & Tarjan, Efficient Algorithms for Some Matroid Intersection Problems 1979 20 FOCS Gonnet & Munro & Suwanda, Toward Self-Organizing Linear Search 1979 20 FOCS Greibach, Theory of Formal Languages: Origins and Directions (Invited Paper) 1979 20 FOCS Hartmanis, Observations about the Development of Theoretical Computer Science (Invited Paper) 1979 20 FOCS Immerman, Length of Predicate Calculus Formulas as a New Complexity Measure 1979 20 FOCS Kedem & Silberschatz, Controlling Concurrency Using Locking Protocols 1979 20 FOCS Kirkpatrick, Efficient Computation of Continuous Skeletons 1979 20 FOCS Kleene, Origins of Recursive Function Theory (Invited Paper) 1979 20 FOCS Kozen, Semantics of Probabilistic Programs 1979 20 FOCS Lagarias, Succinct Certificates for the Solvability of Binary Quadratic Diophantine Equations 1979 20 FOCS Leiberherr & Specker, Complexity of Partial Satisfaction 1979 20 FOCS Maurer & Nivat, Bijective A-Transducers 1979 20 FOCS Pan, New Methods for the Acceleration of Matrix Multiplications 1979 20 FOCS Paul & Reischuk, On Time Versus Space II 1979 20 FOCS Peterson & Reif, Multiple-Person Alternation 1979 20 FOCS Pippenger, Computation Complexity in Algebraic Function Fields 1979 20 FOCS Pippenger, On Simultaneous Resource Bounds 1979 20 FOCS Pratt, Models of Program Logics 1979 20 FOCS Preparata & Vuillemin, The Cube-Connected-Cycles: A Versatile Network for Parallel Computation 1979 20 FOCS Reif, Complexity of the Mover's Problem and Generalizations 1979 20 FOCS Ruzzo, On Uniform Circuit Complexity 1979 20 FOCS Saxe & Bentley, Transforming Static Data Structures to Dynamic Structures 1979 20 FOCS Schroeppel & Shamir, A TS^2 = O(2^n) Time/Space Tradeoff for Certain NP-Complete Problems 1979 20 FOCS Simon, Division Is Good 1979 20 FOCS Wegman & Carter, New Classes and Applications of Hash Functions 1979 20 FOCS Yannakakis & Papadimitriou & Kung, Locking Policies: Safety and Freedom from Deadlock 1979 20 FOCS Yemini, On Some Theoretical Aspects of Position-Location Problems 1978 19 FOCS Abelson, Lower Bounds on Information Transfer in Distributed Computations 1978 19 FOCS Adleman, Two Theorems on Random Polynomial Time 1978 19 FOCS Blum & Kozen, On the Power of the Compass (or, Why Mazes Are Easier To Search Than Graphs) 1978 19 FOCS Chandra, Computable Nondeterministic Functions 1978 19 FOCS Christen, Improving the Bounds on Optimal Merging 1978 19 FOCS Courcelle, On Recursive Equations Having a Unique Solution 1978 19 FOCS Engelfriet & Rosenberg, Equality Languages, Fixed Point Languages and Representations of Recursively Enumerable Languages 1978 19 FOCS Flon & Suzuki, Consistent and Complete Proof Rules for the Total Correctness of Parallel Programs 1978 19 FOCS Francon & Viennot & Vuillemin, Description and Analysis of an Efficient Priority Queue Representation 1978 19 FOCS Frankel & Garey & Johnson & Schaefer & Yesha, The Complexity of Checkers on an N x N Board--Preliminary Report 1978 19 FOCS Galil, A New Algorithm for the Maximal Flow Problem 1978 19 FOCS Guibas & Sedgewick, A Dichromatic Framework for Balanced Trees 1978 19 FOCS Hartmanis & Immerman & Mahaney, One-Way Log-Tape Reductions 1978 19 FOCS Kanda, Data Types as Initial Algebras: A Unification of Scottery and ADJery (Extended Abstract) 1978 19 FOCS Ladner & Lipton & Stockmeyer, Alternating Pushdown Automata (Preliminary Report) 1978 19 FOCS Lehmann, On the Algebra of Order (Extended Abstract) 1978 19 FOCS Lewis, Complexity of Solvable Cases of the Decision Problem for the Predicate Calculus 1978 19 FOCS Lichtenstein & Sipser, GO Is Pspace Hard 1978 19 FOCS Lipton, Model Theoretic Aspects of Computational Complexity 1978 19 FOCS Lueker, A Data Structure for Orthogonal Range Queries 1978 19 FOCS Munro & Paterson, Selection and Sorting with Limited Storage 1978 19 FOCS Pan, Strassen's Algorithm Is Not Optimal Trilinear Technique of Aggregating, Uniting and Canceling for Constructing Fast Algorithms for Matrix Operations 1978 19 FOCS Parikh, A Decidability Result for a Second Order Process Logic 1978 19 FOCS Paul & Prauss & Reischuk, On Alternation (Preliminary Version) 1978 19 FOCS Reischuk, Improved Bounds on the Problem of Time-Space Trade-Off in the Pebble Game (Preliminary Version) 1978 19 FOCS Simon & Gill & Hunt, On Tape-Bounded Probabilistic Turing Machine Transducers (Extended Abstract) 1978 19 FOCS Simon, Limited Subsets of a Free Monoid 1978 19 FOCS Simons, A Fast Algorithm for Single Processor Scheduling 1978 19 FOCS Sipser, Halting Space-Bounded Computations 1978 19 FOCS Van de Wiele, An Optimal Lower Bound on the Number of Total Operations To Compute 0-1 Polynomials Over the Field of Complex Numbers 1978 19 FOCS Yao & Yao, On the Average-case Complexity of Selecting k-th Best 1978 19 FOCS Yao, Should Tables Be Sorted? 1978 19 FOCS Yap, On Lifted Problems (Preliminary Report) 1977 18 FOCS Adleman & Manders & Miller, On Taking Roots in Finite Fields 1977 18 FOCS Aho & Beeri & Ullman, The Theory of Joins in Relational Data Bases 1977 18 FOCS Bennison & Soare, Recursion Theoretic Characterizations of Complexity Theoretic Properties 1977 18 FOCS Berman, Precise Bounds for Pressburger Arithmetic and the Reals with Addition: Preliminary Report 1977 18 FOCS Blum & Sakoda, Finite Automata in a 2-Dimensional Space 1977 18 FOCS Book, Language Representation Theorems: How To Generate the R. E. Sets from the Regular Sets 1977 18 FOCS Clarke, Program Invariants as Fixed Points 1977 18 FOCS Coffman & Leung, Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation 1977 18 FOCS Flajolet & Raoult & Vuillemin, On the Average Number of Registers Required for Evaluating Arithmetic Expressions 1977 18 FOCS Galil & Seiferas, Saving Space in Fast String-Matching 1977 18 FOCS Guibas & Odlyzko, A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm 1977 18 FOCS Huet, Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems 1977 18 FOCS Hyafil, The Power of Commutativity 1977 18 FOCS Ibarra, The Unsolvability of the Equivalence Problem for epsilon-Free NGSM's with Unary Input (Output) Alphabet and Applications 1977 18 FOCS Katseff & Sipser, Several Results in Program Size Complexity 1977 18 FOCS Kozen, Lower Bounds for Natural Proof Systems (Preliminary Report) 1977 18 FOCS Kung & Song, A Parallel Garbage Collection Algorithm: Correctness and Efficiency 1977 18 FOCS Lawler, Fast Approximation Algorithms for Knapsack Problems 1977 18 FOCS Lehmann & Smyth, Data Types 1977 18 FOCS Lewis, A New Decidable Problem, With Applications 1977 18 FOCS Lipton & Tarjan, Applications of a Planar Separator Theorem 1977 18 FOCS Lipton, A Necessary and Sufficient Condition for the Existence of Hoare Logics 1977 18 FOCS Lloyd, On Triangulations of a Set of Points in the Plane 1977 18 FOCS Maier, A Space Efficient Algorithm for the Lowest Common Ancester Problem and an Application to Finding Negative Cycles 1977 18 FOCS Nelson & Oppen, Fast Decision Algorithms Based on Union and Find 1977 18 FOCS Plaisted, New NP-Hard and NP-Complete Polynomial and Integer Divisibility Problems 1977 18 FOCS Plotkin & Smyth, The Category-Theoretic Solution of Recursive Domain Equations 1977 18 FOCS Pnueli, The Temporal Logic of Programs 1977 18 FOCS Snyder, On Uniquely Representable Data Structures 1977 18 FOCS Statman, The Typed lambda-Calculus Is Not Elementary Recursive 1977 18 FOCS Yao, Probabilistic Computations: Toward a Unified Measure of Complexity (extended abstract) 1976 17 FOCS Adleman & Manders, Diophantine Complexity 1976 17 FOCS Allen & Munro, Self-Organizing Binary Search Trees 1976 17 FOCS Baker & Selman, A Second Step Toward the Polynomial Hierarchy 1976 17 FOCS Berman, On the Structure of Complete Sets: Almost Everywhere Complexity and Infinitely Often Speedup 1976 17 FOCS Boasson & Nivat, Parenthesis Generators 1976 17 FOCS Chandra & Stockmeyer, Alternation 1976 17 FOCS Chirica & Martin, An Algebraic Formulation of Knuthian Semantics 1976 17 FOCS Comer & Sethi, Complexity of Trie Index Construction 1976 17 FOCS Courcelle & Nivat, Algebraic Families of Interpretations 1976 17 FOCS Downey & Sethi, Assignment Commands and Array Structures 1976 17 FOCS Farrow & Kennedy & Zucconi, Graph Grammars and Global Program Data Flow Analysis 1976 17 FOCS Frederickson & Hecht & Kim, Approximation Algorithms for Some Routing Problems 1976 17 FOCS Friedman, Simple Languages and Free Schemes 1976 17 FOCS Fussenegger & Gabow, Using Comparison Trees To Derive Lower Bounds for Selection Problems 1976 17 FOCS Galil & Seiferas, Recognizing Certain Repetitions and Reversals Within Strings 1976 17 FOCS Guibas, The Analysis of Hashing Algorithms That Exhibit k-ary Clustering 1976 17 FOCS Henderson & Zalcstein, Characterization of the Synchronization Languages for PV Systems 1976 17 FOCS Jones & Lipton & Snyder, A Linear Time Algorithm for Deciding Security 1976 17 FOCS Kozen, On Parallelism in Turing Machines 1976 17 FOCS Lehmann, Categories for Fixpoint-Semantics 1976 17 FOCS Pippenger, On the Evaluation of Powers and Related Problems 1976 17 FOCS Plaisted, Some Polynomial and Integer Divisibility Problems Are NP-Hard 1976 17 FOCS Pratt, Considerations on Floyd-Hoare Logic 1976 17 FOCS Rivest & Pratt, The Mutual Exclusion Problem for Unreliable Processes 1976 17 FOCS Shamos & Hoey, Geometric Intersection Problems 1976 17 FOCS Shamos & Yuval, Lower Bounds from Complex Function Theory 1976 17 FOCS Stearns & Lewis & Rosenkrantz, Concurrency Control for Database Systems 1976 17 FOCS van Leeuwen, Variations of a New Machine Model 1976 17 FOCS Wright & Goguen & Thatcher & Wagner, Rational Algebraic Theories and Fixed-Point Solutions 1976 17 FOCS Yao & Rivest, K + 1 Heads Are Better than K 1976 17 FOCS Yao & Yao, The Complexity of Searching an Ordered Random Table 1975 16 FOCS Adleman & Manders, Computational Complexity of Decision Procedures for Polynomials 1975 16 FOCS Arjomandi & Corneil, Parallel Computations in Graph Theory 1975 16 FOCS Beeri, An Improvement on Valiant's Decision Procedure for Equivalence of Deterministic Finite-Turn Pushdown Automata 1975 16 FOCS Csanky, Fast Parallel Matrix Inversion Algorithms 1975 16 FOCS de Bakker, Flow of Control in the Proof Theory of Structured Programming 1975 16 FOCS Downey & Sethi, Correct Computation Rules for Recursive Languages 1975 16 FOCS Even & Itai & Shamir, On the Complexity of Timetable and Multi-Commodity Flow Problems 1975 16 FOCS Even & Kariv, An O(n^{2.5}) Algorithm for Maximum Matching in General Graphs 1975 16 FOCS Floyd, The Exact Time Required To Perform Generalized Addition 1975 16 FOCS Fredman, On the Decision Tree Complexity of the Shortest Path Problems 1975 16 FOCS Garey & Johnson & So, An Application of Graph Coloring to Printed Circuit Testing 1975 16 FOCS Geller & Hunt & Szymanski & Ullman, Economy of Description by Parsers, DPDA's, and PDA's 1975 16 FOCS Hartmanis & Berman, A Note on Tape Bounds for sla Language Processing 1975 16 FOCS Hopcroft & Paul & Valiant, On Time Versus Space and Related Problems 1975 16 FOCS Hunt & Rangel, Decidability of Equivalence, Containment, Intersection, and Separability of Context-Free Languages 1975 16 FOCS Kleitman & Krieger, An Optimal Bound for Two Dimensional Bin Packing 1975 16 FOCS Lipton & Miller & Snyder, Synchronization and Computing Capabilities of Linear Asynchronous Structures 1975 16 FOCS Lipton, Polynomials with 0-1 Coefficients That Are Hard To Evaluate 1975 16 FOCS Markowsky & Rosen, Bases for Chain-Complete Posets 1975 16 FOCS Pippenger, Information Theory and the Complexity of Switching Networks 1975 16 FOCS Pohl, Minimean Optimality in Sorting Algorithms 1975 16 FOCS Pratt, The Effect of Basis on Size of Boolean Expressions 1975 16 FOCS Rounds, A Grammatical Characterization of Exponential-Time Languages 1975 16 FOCS Shamos & Hoey, Closest-Point Problems 1975 16 FOCS Szymanski & Ullman, Evaluating Relational Expressions with Dense and Sparse Arguments 1975 16 FOCS van Emde Boas, Preserving Order in a Forest in Less Than Logarithmic Time 1975 16 FOCS Winograd, The Effect of the Field of Constants on the Number of Multiplications 1975 16 FOCS Yao, On the Complexity of Comparison Problems Using Linear Functions 1974 15 FOCS Aho & Hirschberg & Ullman, Bounds on the Complexity of the Longest Common Subsequence Problem 1974 15 FOCS Baker, "Natural" Properties of Flowchart Complexity Measures 1974 15 FOCS Carlyle & Greibach & Paz, A Two-Dimensional Generating System Modeling Growth by Binary Cell Division 1974 15 FOCS Courcelle, Recursive Schemes, Algebraic Trees and Deterministic Languages 1974 15 FOCS Cremers & Ginsburg, Characterization of Context-Free Grammatical Families 1974 15 FOCS Daley, Non-Complex Sequences: Characterizations and Examples 1974 15 FOCS Demers, Skeletal LR Parsing 1974 15 FOCS Friedman, Relationships Between Monadic Recursion Schemes and Deterministic Context-Free Languages 1974 15 FOCS Galil, Two Way Deterministic Pushdown Automaton Languages and Some Open Problems 1974 15 FOCS Goguen & Thatcher, Initial Algebra Semantics 1974 15 FOCS Hack, The Recursive Equivalence of the Reachability Problem and the Liveness Problem for Petri Nets and Vector Addition Systems 1974 15 FOCS Hartmanis & Simon, On the Power of Multiplication in Random Access Machines 1974 15 FOCS Hayes, Minimization of Fanout in Switching Networks 1974 15 FOCS Hoffman & Landweber, Axiomatic Equivalence of Programs with Structured Variables 1974 15 FOCS Hunt & Szymanski & Ullman, Operations on Sparse Relations and Efficient Algorithms for Grammar Problems 1974 15 FOCS Kerntopf, On Boolean Functions Having Maximal Number of Subfunction Classes 1974 15 FOCS Kung, On the Computational Complexity of Finding the Maxima of a Set of Vectors 1974 15 FOCS Lamagna & Savage, Combinational Complexity of Some Monotone Functions 1974 15 FOCS Lipton & Snyder & Zalcstein, A Comparative Study of Models of Parallel Computation 1974 15 FOCS Rangel, The Equivalence Problem for Regular Expressions Over One Letter Is Elementary 1974 15 FOCS Rivest, On Hash-Coding Algorithms for Partial-Match Retrieval 1974 15 FOCS Rivest, On Self-Organizing Sequential Search Heuristics 1974 15 FOCS Rosenkrantz & Stearns & Lewis, Approximate Algorithms for the Traveling Salesperson Problem 1974 15 FOCS Sahni & Gonzales, P-Complete Problems and Approximate Solutions 1974 15 FOCS Tokura & Kasami & Furuta, Ianov Schemas Augmented by a Pushdown Memory 1974 15 FOCS Yao, Bounds on Selection Networks 1973 14 FOCS Blum & Blum, Inductive Inference: A Recursion Theoretic Approach 1973 14 FOCS Bredeson, On Multiple Input Change Hazard-Free Combinational Switching Circuits without Feedback 1973 14 FOCS Cadiou & Levy, Mechanizable Proofs about Parallel Processes 1973 14 FOCS Chandra, Efficient Compilation of Linear Recursive Programs 1973 14 FOCS Cherniavsky, The Complexity of Some Nonclassical Logics 1973 14 FOCS Chuang & Das, Multiple-Input Change Asynchronous Machines Using Controlled Excitation and Flip-Flops 1973 14 FOCS Dobkin, On the Optimal Evaluation of a Set of N-Linear Forms 1973 14 FOCS Ehrig & Pfender & Schneider, Graph Grammars: An Algebraic Approach 1973 14 FOCS Friedman, Equivalence Problems in Monadic Recursion Schemes 1973 14 FOCS Geller & Harrison, Characterization of LR(0) Languages 1973 14 FOCS Joyner, Automatic Theorem-Proving and the Decision Problem 1973 14 FOCS Kameda & Toida, Efficient Algorithms for Determining an Extremal Tree of a Graph 1973 14 FOCS Machtey, A Notion of Helping and Pseudo-Complementation in Lattices of Honest Subrecursive Classes 1973 14 FOCS Mehlhorn, On the Size of Sets of Computable Functions 1973 14 FOCS Mickunas & Schneider, On the Ability to Cover LR(k) Grammars with LR(1), SLR(1), and (1,1) Bounded-Context Grammars 1973 14 FOCS Pratt & Yao, On Lower Bounds for Computing the i-th Largest Element 1973 14 FOCS Rounds, Complexity of Recognition in Intermediate-Level Languages 1973 14 FOCS Savage, Statistical Indicators of Optimality 1973 14 FOCS Seiferas & Fischer & Meyer, Refinements of the Nondeterministic Time and Space Hierarchies 1973 14 FOCS Spira & Pan, On Finding and Updating Shortest Paths and Spanning Trees 1973 14 FOCS Sudborough, On Tape-Bounded Complexity Classes and Multi-Head Finite Automata 1973 14 FOCS Szymanski & Williams, Non-Canonical Parsing 1973 14 FOCS Weiner, Linear Pattern Matching Algorithms 1973 14 FOCS Young, Optimization Among Provably Equivalent Programs 1972 13 FOCS Akers, Universal Test Sets for Logic Networks 1972 13 FOCS Baker & Book, Reversal-Bounded Multi-Pushdown Machines 1972 13 FOCS Berstel, On Sets of Numbers Recognized by Push-down Automata 1972 13 FOCS Bruno & Coffman & Hosken, Consistency of Synchronization Nets Using P and V Operations 1972 13 FOCS Cherniavsky & Constable, Representing Program Schemes in Logic 1972 13 FOCS Friedman, Some Results on the Effect of Arithmetics on Comparison Problems 1972 13 FOCS Goguen, On Homomorphisms, Simulations, Correctness and Subroutines 1972 13 FOCS Horowitz, The Efficient Calculation of Powers of Polynomials 1972 13 FOCS Hossley & Rackoff, The Emptiness Problem for Automata on Infinite Trees 1972 13 FOCS Huang & Kain & Kinney, Output Sufficient Modules for Uniform Decomposition of Synchronous Sequential Circuits 1972 13 FOCS Johnson, Fast Allocation Algorithms 1972 13 FOCS Jump & Thiagarajan, On the Equivalence of Asynchronous Control Structures 1972 13 FOCS Keller, On the Decomposition of Asynchronous Systems 1972 13 FOCS Kfoury, Effective Computability in Algebraic Structures (A Schematology Approach) 1972 13 FOCS Liu, Optimal Scheduling on Multi-Processor Computing Systems 1972 13 FOCS Logrippo, Renamings in Program Schemas 1972 13 FOCS Maibaum, The Characterization of the Derivation Trees of Context Free Sets of Terms as Regular Sets 1972 13 FOCS Meyer & Moll, Honest Bounds for Complexity Classes of Recursive Functions 1972 13 FOCS Meyer & Stockmeyer, The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space 1972 13 FOCS Moenck & Borodin, Fast Modular Transforms Via Division 1972 13 FOCS Mylopoulos, On the Relation of Graph Grammars and Graph Automata 1972 13 FOCS Rosen, Program Equivalence and Context-Free Grammars 1972 13 FOCS Sahni, Some Related Problems from Network Flows, Game Theory and Integer Programming 1972 13 FOCS Saluja & Reddy, Multiple Faults in Reed-Muller Canonic Networks 1972 13 FOCS Shaw & Traub, On the Number of Multiplications for the Evaluation of a Polynomial and All Its Derivatives 1972 13 FOCS Tourlakis & Mylopoulos, Some Results in Computational Topology 1972 13 FOCS Ullman, A Fast Algorithm for the Elimination of Common Subexpressions 1971 12 FOCS Abramson, Effective Computation Over the Real Numbers 1971 12 FOCS Akers, A Rectangular Logic Array 1971 12 FOCS Brinsfield & Miller, On the Composition of Parallel Program Schemata 1971 12 FOCS Brzozowski & Simon, Characterizations of Locally Testable Events 1971 12 FOCS Burkhard & Kroon, Toward a Weakly Invariant Complexity Theory 1971 12 FOCS Coffman & Jones, Priority Paging Algorithms and the Extension Problem 1971 12 FOCS Cohen & Culik, LR-Regular Grammars--An Extension of LR(k) Grammars 1971 12 FOCS Constable & Gries, On Classes of Program Schemata 1971 12 FOCS Dertouzos, Time Bounds on Space Computations 1971 12 FOCS Fischer & Meyer, Boolean Matrix Multiplication and Transitive Closure 1971 12 FOCS Frosini & Gerace, Synthesis of Asynchronous Sequential Circuits with Master-Slave Subcircuits 1971 12 FOCS Heindel & Horowitz, On Decreasing the Computing Time for Modular Arithmetic 1971 12 FOCS Hopcroft & Karp, A n^{5/2} Algorithm for Maximum Matchings in Bipartite Graphs 1971 12 FOCS Kane & Yau, On the Design of Easily Testable Sequential Machines 1971 12 FOCS Liu, Analysis of Sorting Algorithms 1971 12 FOCS Meyer & Fischer, Economy of Description by Automata, Grammars, and Formal Systems 1971 12 FOCS Munro & Paterson, Optimal Algorithms for Parallel Polynomial Evaluation 1971 12 FOCS Osman & Weiss, Universal Base Functions and Modules for Realizing Arbitrary Switching Functions 1971 12 FOCS Paterson & Stockmeyer, Bounds on the Evaluation Time for Rational Polynomials 1971 12 FOCS Reingold, Computing the Maximum and the Median 1971 12 FOCS Smith, Two-Dimensional Formal Languages and Pattern Recognition 1971 12 FOCS Spira, Complete Linear Proofs of Systems of Linear Inequalities 1971 12 FOCS Stern & Torng, NAND Cellular Arrays 1971 12 FOCS Strong, High Level Languages of Maximum Power 1971 12 FOCS Sudborough, Computation by Multi-Head Finite Automata 1971 12 FOCS Tarjan, Depth-First Search and Linear Graph Algorithms 1971 12 FOCS Wagner, Languages for Defining Sets in Arbitrary Algebras 1970 11 FOCS Aho & Ullman, Equivalence of Programs with Structured Variables 1970 11 FOCS Ashkinazy, Fault Detection Experiments for Asynchronous Sequential Machines 1970 11 FOCS Banks, Universality in Cellular Automata 1970 11 FOCS Benson, Syntactic Clues 1970 11 FOCS Birman & Ullman, Parsing Algorithms with Backtrack 1970 11 FOCS Bjorner, The Synthesis of Finite State Syntax Directed Top-Down and Bottom-Up Transducers 1970 11 FOCS Bredeson & Hulina, Elimination of Static and Dynamic Hazards in Combinational Switching Circuits 1970 11 FOCS Constable & Borodin, On the Efficiency of Programs in Subrecursive Formalisms 1970 11 FOCS Fischler & Tannenbaum, Synchronizing and Representation Problems for Sequential Machines with Masked Outputs 1970 11 FOCS Fliess, Deux Applications de la Representation Matricielle D'Une Serie Rationnelle Non Commutative 1970 11 FOCS Gale & Karp, A Phenomenon in the Theory of Sorting 1970 11 FOCS Giuliano, Writing Stack Acceptors 1970 11 FOCS Graham, Extended Precedence Languages, Bounded Right Context Languages, and Deterministic Languages 1970 11 FOCS Kameda, On the Computational Power of Some Machines with Pushdown-like Storage 1970 11 FOCS Keller, On Maximally Parallel Schemata 1970 11 FOCS Mago, Asynchronous Sequential Circuits with (2,1) Type State Assignments 1970 11 FOCS Paterson, Tape-Bounds for Time-Bounded Turing Machines 1970 11 FOCS Reingold, On the Optimality of Some Set and Vector Algorithms 1970 11 FOCS Rosenkrantz & Lewis, Deterministic Left Corner Parsing 1970 11 FOCS Rutledge, Program Schemata as Automata 1970 11 FOCS Shoshani & Coffman, Sequencing Tasks in Multiprocess Systems to Avoid Deadlocks 1970 11 FOCS Smith, Cellular Automata and Formal Languages 1970 11 FOCS Unger, Asynchronous Sequential Switching Circuits with Unrestricted Input Changes 1970 11 FOCS Zalcstein, On Star-Free Events 1970 11 FOCS Zeigler, Series-Parallel Irreducibility: Machine Oriented Definitions and Proofs 1969 10 FOCS Aho & Ullman, A Characterization of Two-way Deterministic Classes of Languages 1969 10 FOCS Arnold & Newborn, Iteratively Realized Sequential Circuits: Further Considerations 1969 10 FOCS Booth, Probabilistic Representation of Formal Languages 1969 10 FOCS Borodin & Constable & Hopcroft, Dense and Non-Dense Families of Complexity Classes 1969 10 FOCS Brainerd, Semi-Thue Systems and Representations of Trees 1969 10 FOCS Bruno & Altman, Asynchronous Control Networks 1969 10 FOCS Constable, The Operator Gap 1969 10 FOCS Fischer, Two Characterizations of the Context-Sensitive Languages 1969 10 FOCS Fisher & Raney, On the Representation of Formal Languages Using Automata on Networks 1969 10 FOCS Gelenbe, On Probabilistic Automata with Structural Restrictions 1969 10 FOCS Gray & Harrison, Single Pass Precedence Analysis 1969 10 FOCS Greibach, Full AFL's and Nested Iterated Substitution 1969 10 FOCS Hopcroft & Kerr, Some Techniques for Proving Certain Simple Programs Optimal 1969 10 FOCS Joshi & Kosaraju & Yamada, String Adjunct Grammar 1969 10 FOCS Kfoury & Liu, Definite Stochastic Sequential Machines and Definite Stochastic Matrices 1969 10 FOCS King & Weiner, On the Modular Decomposition of Autonomous Sequential Machines 1969 10 FOCS Kohavi, Fault Diagnosis of Logical Circuits 1969 10 FOCS Kosaraju, Recognition of Context-free and Stack Languages 1969 10 FOCS Kriz, Machine Identification Concepts of Path Sensitizing Fault Diagnosis 1969 10 FOCS Logrippo, Storage Interference in Asynchronous Computations 1969 10 FOCS Lovell, The Incompletely-Specified Finite-State Stochastic Sequential Machine Equivalence and Reduction 1969 10 FOCS Nash & Cohen, Parallel Leveled Grammars 1969 10 FOCS Sha & Sze, Threshold Logic: A Simplified Synthesis by a Recursive Method 1969 10 FOCS Stearns & Rosenkrantz, Table Machine Simulation 1969 10 FOCS Tsichritzis, Iterative Procedures 1969 10 FOCS Walters, Deterministic Context-Sensitive Languages 1968 9 FOCS Fischer & Rosenberg, Limited Random Access Turing Machines (Preliminary Version) 1967 8 FOCS Meyer & Rosenberg & Fischer, Turing Machines with Several Read-Write Heads (Preliminary Report) 1966 7 FOCS Korenjak & Hopcroft, Simple Deterministic Languages 1966 7 FOCS Cobham, The Recognition Problem for the Set of Perfect Squares 1965 6 FOCS Ruby & Fischer, Translational Methods and Computational Complexity 1965 6 FOCS Lewis & Stearns & Hartmanis, Memory Bounds for Recognition of Context-free and Context-sensitive Languages 1965 6 FOCS Stearns & Hartmanis & Lewis, Hierarchies of Memory Limited Computations 1964 5 FOCS Hartmanis & Stearns, Computational Complexity of Recursive Sequences 1964 5 FOCS Hennie, Fault Detecting Experiments for Sequential Circuits 1993 4 FODO Ahn, Filtered Hashing 1993 4 FODO Merrett & Shang, Trie Methods for Representing Text 1993 4 FODO Mohan, A Survey of DBMS Research Issues in Supporting Very Large Tables 1989 3 FODO Rabin & Tygar, ITOSS: An Integrated Toolkit for Operating Systems Security 1989 3 FODO Dershowitz & Leong, Fast Exchange Sorts 1989 3 FODO Klein & Wood, The Path Length of Binary Trees 1989 3 FODO Ramamohanarao & Sheperd & Sacks-Davis, Partial-Match Retrieval for Dynamic Files Using Linear Hashing with Partial Expansions 1994 FRACSCI Bunde & Havlin, A Brief Introduction to Fractal Geometry 1994 FRACSCI Weiss, A Primer of Random Walkology 1994 FRACSCI Rapaport & Meyer, Computer Exploration of Fractals, Chaos, and Cooperativity 1985 FRIEDMAN Byerly, Mathematical Aspects of Recursive Function Theory 1985 FRIEDMAN Kfoury, The Pebble Game and Logics of Programs 1985 FRIEDMAN Kolata, Does Goedel's Theorem Matter to Mathematics 1985 FRIEDMAN Nerode & Harrington, The Work of Harvey Friedman 1985 FRIEDMAN Shepherdson, Algorithmic Procedures, Generalized Turing Algorithms, and Elementary Recursion Theory 1985 FRIEDMAN Shepherdson, Computational Complexity of Real Functions 1985 FRIEDMAN Simpson, Nonprovability of Certain Combinatorial Properties of Finite Trees 1985 FRIEDMAN Smith, The Consistency Strengths of Some Finite Forms of the Higman and Kruskal Theorems 1985 FRIEDMAN Smorynski, Some Rapidly Growing Functions 1985 FRIEDMAN Smorynski, The Varieties of Arboreal Experience 1985 FRIEDMAN Smorynski, ``Big'' News from Archimedes to Friedman 1995 15 FSTTCS Paterson & Tassa & Zwick, Looking for MUM and DAD: Text-Text Comparisons Do Help 1995 15 FSTTCS Jain, Branch and Bound on the Network Model 1995 15 FSTTCS Dasgupta & Chakrabarti & DeSarkar, A Near Optimal Algorithm for the Extended Cow-Path Problem in the Presence of Relative Errors 1995 15 FSTTCS Roychoudhury & Sur-Kolay, Efficient Algorithms for Vertex Arboricity of Planar Graphs 1995 15 FSTTCS Diwan & Usharani, A Condition for the Three Colourability of Planar Locally Path Graphs 1995 15 FSTTCS Panangaden, The Expressive Power of Indeterminate Primitives in Asynchronous Computation 1995 15 FSTTCS Raynal & Schiper, From Causal Consistency to Sequential Consistency in Shared Memory Systems 1995 15 FSTTCS Schuler, Average Polynomial Time Is Hard for Exponential Time Under sn-Reductions 1995 15 FSTTCS Ravikumar & Sivakumar, On Self-Testing without the Generator Bottleneck 1995 15 FSTTCS Nielsen & Cheng, Observing Behaviour Categorically 1995 15 FSTTCS Balasubramanian & Raman, Path Balance Heuristic for Self-Adjusting Binary Search Trees 1995 15 FSTTCS Kosaraju, Pattern Matching in Compressed Texts 1995 15 FSTTCS Arikati & Chaudhuri & Zaroliagis, All-Pairs Min-Cut in Sparse Networks 1995 15 FSTTCS Biswas & Kannan, Minimizing Space Usage in Evaluation of Expression Trees 1995 15 FSTTCS Edelsbrunner, Smooth Surfaces for Multi-Scale Shape Representation 1995 15 FSTTCS Levcopoulos & Lingas & Wang, On Parallel Complexity of Planar Triangulations 1995 15 FSTTCS Follert & Schomer & Sellen & Smid & Thiel, Computing a Largest Empty Anchored Cylinder, and Related Problems 1995 15 FSTTCS Krznaric & Levcopoulos, Computing Hierarchies of Clusters from the Euclidean Minimum Spanning Tree in Linear Time 1995 15 FSTTCS Klarlund & Mukund & Sohoni, Determinizing Buchi Asynchronous Automata 1995 15 FSTTCS Asarin & Maler, Achilles and the Tortoise Climbing Up the Arithmetical Hierarchy 1995 15 FSTTCS Browne & Manna & Sipma, Generalized Temporal Verification Diagrams 1995 15 FSTTCS Bianco & de Alfaro, Model Checking of Probabilistic and Nondeterministic Systems 1994 14 FSTTCS Kozen, Efficient Resolution of Singularities of Plane Curves 1994 14 FSTTCS Couveignes & Diaz-Frias & de Rougemont & Santha, On the Interactive Complexity of Graph Reliability 1994 14 FSTTCS Dietzfelbinger & Huhne, Matching Upper and Lower Bounds for Simulations of Several Tapes on One Multidimensional Tape 1994 14 FSTTCS Caussinus & Lemieux, The Complexity of Computing over Quasigroups 1994 14 FSTTCS Mahajan & Vinay, Non-commutative Computation, Depth Reduction and Skew Circuits 1994 14 FSTTCS Coquand & Dybjer, Inductive Definitions and Type Theory, an Introduction (Preliminary Version) 1994 14 FSTTCS Broy & Hinkel & Nipkow & Prehofer & Schieder, Interpreter Verification for a Functional Language 1994 14 FSTTCS Lakshmanan, An Epistemic Foundation for Logic Programming with Uncertainty 1994 14 FSTTCS Tsuiki, On Typed Calculi with a Merge Operator 1994 14 FSTTCS Frigioni & Marchetti-Spaccamela & Nanni, Incremental Algorithms for the Single-Source Shortest Path Problem 1994 14 FSTTCS Arikati & Maheshwari, An O(n) Algorithm for Realizing Degree Sequences 1994 14 FSTTCS Subramanian & Veni Madhavan, Coloring Semi-Random Graphs in Polynomial Expected Time 1994 14 FSTTCS Thomas, Finite-State Strategies in Regular Infinite Games 1994 14 FSTTCS Nandy & Sinha & Bhattacharya, Location of the Largest Empty Rectangle among Arbitrary Obstacles 1994 14 FSTTCS Dahlhaus, Efficient Parallel and Linear Time Sequential Split Decomposition 1994 14 FSTTCS Biswas & Prasad & Pal, Algorithms for Convex Visibility Problems 1994 14 FSTTCS Sen, Lower Bounds for Parallel Algebraic Decision Trees, Complexity of Convex Hulls and Related Problems 1994 14 FSTTCS Amadio & Prasad, Localities and Failures 1994 14 FSTTCS Natarajan & Christoff & Christoff & Cleaveland, Priority and Abstraction in Process Algebra 1994 14 FSTTCS Kumar & Pandya, On the Computational Power of Operators in ICSP with Fairness 1994 14 FSTTCS Yi & Jonsson, Decidability of Timed Language-Inclusion for Networks of Real-Time Communicating Sequential Processes 1994 14 FSTTCS Fortnow, My Favorite Ten Complexity Theorems of the Past Decade 1994 14 FSTTCS Kaji & Fujiwara & Kasami, Solving a Unification Problem under Constrained Substitutions Using Tree Automata 1994 14 FSTTCS Ramesh & Ramakrishnan & Sekar, Automata-Driven Efficient Subterm Unification 1994 14 FSTTCS Raghavan, Randomized Approximation Algorithms in Combinatorial Optimization 1994 14 FSTTCS Arora & Santosh & Saran & Vazirani, A Limited-Backtrack Greedy Schema for Approximation Algorithms 1994 14 FSTTCS Crescenzi & Trevisan, On Approximation Scheme Preserving Reducibility and its Applications 1994 14 FSTTCS Hunt & Marathe & Radhakrishnan & Ravi & Rosenkrantz & Stearns, Approximation Schemes Using L-Reductions 1994 14 FSTTCS Subramanian, An Explanation of Splaying 1994 14 FSTTCS Desel & Radola, Proving Non-Reachability by Modulo-Place-Invariants 1994 14 FSTTCS Knapp, Soundness and Completeness of UNITY Logic 1994 14 FSTTCS Savicky & Wegener, Efficient Algorithms for the Transformation between Different Types of Binary Decision Diagrams 1994 14 FSTTCS Siegel & Stomp, Extending the Limits of Sequentially Phased Reasoning 1994 14 FSTTCS Estivill-Castro & Wood, Foundations for Faster External Sorting 1994 14 FSTTCS Hooker & Vinay, Branching Rules for Satisfiability 1994 14 FSTTCS Kapur & Subramaniam, Using Linear Arithmetic Procedure for Generating Induction Schemes 1993 13 FSTTCS Hartmanis, Some Observations About the Nature of Computer Science 1993 13 FSTTCS van Bakel, Essential Intersection Type Assignment 1993 13 FSTTCS Ait-Kaci & Garrigue, Label-Selective lambda-Calculus Syntax and Confluence 1993 13 FSTTCS Barendsen & Smetsers, Conventional and Uniqueness Typing in Graph Rewrite Systems 1993 13 FSTTCS Castagna, A Meta-Language for Typed Object-Oriented Languages 1993 13 FSTTCS Berry, Preemption in Concurrent Systems 1993 13 FSTTCS Kulkarni & Mitter & Richardson & Tsitsiklis, Local Versus Non-Local Computation of Length of Digitized Curves 1993 13 FSTTCS Lange & Niedermeier, Data-Independences of Parallel Random Access Machines 1993 13 FSTTCS Aguzzi & Modigliani, Proving Termination of Logic Programs by Transforming them Equivalent Term Rewriting Systems 1993 13 FSTTCS Krishna Rao, Completeness of Hierarchical Combinations of Term Rewriting Systems 1993 13 FSTTCS Dershowitz & Mitra, Higher-Order and Semantic Unification 1993 13 FSTTCS Basin & Matthews, A Conservative Extension of First-Order Logic and Its Applications to Theorem Proving 1993 13 FSTTCS Stuckey & Sudarshan, Well-Founded Ordered Search 1993 13 FSTTCS Ramakrishna & Dillon & Moser & Melliar-Smith & Kutty, A Real-Time Interval Logic and Its Decision Procedure 1993 13 FSTTCS Fages, On the Semantics of Optimization Predicates in CLP Languages 1993 13 FSTTCS Ramachandran & Hentenryck, Incremental Algorithms for Constraint Solving and Entailment Over Rational Trees 1993 13 FSTTCS Guha & Suzuki, Proximity Problems and the Voronoi Diagram on a Rectilinear Plane with Rectangular Obstacles 1993 13 FSTTCS Asberg & Blanco & Bose & Garcia-Lopez & Overmars & Toussaint & Wilfong & Zhu, Feasibility of Design in Stereolithography 1993 13 FSTTCS Radhakrishnan & Krumke & Marathe & Rosenkrantz & Ravi, Compact Location Problems 1993 13 FSTTCS Halldorsson & Radhakrishnan & Subrahmanyam, On Some Communication Complexity Problems Related to Threshold Functions 1993 13 FSTTCS Cucker & Rossello, Recursiveness over the Complex Numbers is Time-Bounded 1993 13 FSTTCS Mulmuley, A Lower Bound for Solvability of Polynomial Equations 1993 13 FSTTCS Reif & Stenzel, Reuse of Proofs in Software Verification 1993 13 FSTTCS Norvell, Induce-Statements and Induce-Expressions: Constructs for Inductive Programming 1993 13 FSTTCS Antoine & Le Goff & Pin, A Graphic Language Based on Timing Diagrams 1993 13 FSTTCS Bacchus & Grove & Halpern & Koller, Generating Degrees of Belief from Statistical Information: An Overview 1993 13 FSTTCS Cheng & Esparza & Palsberg, Complexity Results for 1-safe Nets 1993 13 FSTTCS Janin, Some Results About Logical Descriptions of Non-Deterministic Behaviours 1993 13 FSTTCS Janicki & Koutny, Order Structures and Generalisations of Szpilrajn's Theorem 1993 13 FSTTCS Kumar & Pandya, ICSP and Its Relationship with ACSP and CSP 1993 13 FSTTCS Honda & Yoshida, On Reduction-Based Process Semantics 1993 13 FSTTCS Mukund & Sohoni, Keeping Track of the Latest Gossip: Bounded Time-Stamps Suffice 1993 13 FSTTCS Aggarwal & Kutten, Time Optimal Self-Stabilizing Spanning Tree Algorithms 1993 13 FSTTCS Pujari, Efficient Algorithm to Sort Linear Combinations of Arrays 1993 13 FSTTCS Vaishnavi & Khanna, A Simple File Structure for the Weighted Dictionary Problem 1993 13 FSTTCS Dubhashi & Mehlhorn & Ranjan & Thiel, Searching, Sorting and Randomised Algorithms for Central Elements and Ideal Counting in Posets 1993 13 FSTTCS Bhattacharyya & Nagaraja, Learning of Classes of Regular and Linear Languages in Valiant's Learnability Framework 1992 12 FSTTCS Pnueli, System Specification and Refinement in Temporal Logic 1992 12 FSTTCS Dam, Fixed Points of Buchi Automata 1992 12 FSTTCS Ramakrishna & Dillon & Moser & Melliar-Smith & Kutty, An Automata-Theoretic Decision Procedure for Future Interval Logic 1992 12 FSTTCS Granger, Improving the Results of Static Analyses of Programs by Local Decreasing Iterations 1992 12 FSTTCS Agarwal & van Kreveld, Implicit Point Location in Arrangements of Line Segments, with an Application to Motion Planning 1992 12 FSTTCS Jadhav & Mukhopadhyay & Bhattacharya, An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons 1992 12 FSTTCS Levcopoulos & Lingas, C-Sensitive Triangulations Approximate the MinMax Length Triangulation 1992 12 FSTTCS Buhrman & Homer, Superpolynomial Circuits, Almost Sparse Oracles and the Exponential Hierarchy 1992 12 FSTTCS Schuler & Yamakami, Structural Average Case Complexity 1992 12 FSTTCS Arvind & Kobler & Mundhenk, On Bounded Truth-Table, Conjunctive, and Randomized Reductions to Sparse Sets 1992 12 FSTTCS Ganesan, One-Way Functions and Isomorphism Conjecture 1992 12 FSTTCS Agarwala & Fernandez-Baca, Solving the Lagrangian Dual When the Number of Constraints is Fixed 1992 12 FSTTCS Lakshmanan & Nonen, Superfinitensss of Query Answers in Deductive Databases: An Automata-Theoretic Approach 1992 12 FSTTCS Steinbach, Proving Polynomials Positive 1992 12 FSTTCS Sundararajan & Conery, An Abstract Interpretation Scheme for Groundness, Freeness, and Sharing Analysis of Logic Programs 1992 12 FSTTCS Monsuez, Polymorphic Typing by Abstract Interpretation 1992 12 FSTTCS Huet, The Gallina Specification Language: A Case Study 1992 12 FSTTCS Reif, Verification of Large Software Systems 1992 12 FSTTCS Garg & Waldecker, Detection of Unstable Predicates in Distributed Programs 1992 12 FSTTCS Patkar & Narayanan, Fast Sequential and Randomized Parallel Algorithms for Rigidity and Approximate Min k-Cut 1992 12 FSTTCS Ravi & Raghavachari & Klein, Approximation through Local Optimality: Designing Networks with Small Degree 1992 12 FSTTCS Abramsky, Games and Full Completeness for Multiplicative Linear Logic (Extended Abstract) 1992 12 FSTTCS Godskesen & Larsen, Real-Time Calculi and Expansion Theorems 1992 12 FSTTCS Caucal, Branching Bisimulation for Context-Free Processes 1992 12 FSTTCS Mukund & Nielsen, CCS, Locations and Asynchronous Transition Systems 1992 12 FSTTCS Christoff & Christoff, Reasoning about Safety and Liveness Properties for Probabilistic Processes 1992 12 FSTTCS Muthukrishnan & Ramesh, String Matching under a General Matching Relation 1992 12 FSTTCS Martel & Subramonian, On the Complexity of Certified Write All Algorithms 1992 12 FSTTCS Munro & Raman, Selection from Read-Only Memory and Sorting with Optimum Data Movement 1992 12 FSTTCS Ravikumar, Some Observations on 2-Way Probabilistic Finite Automata 1992 12 FSTTCS Mehlhorn, Recent Developments in Algorithms for the Maximum Flow Problem (Abstract) 1991 11 FSTTCS Blum, Program Checking 1991 11 FSTTCS Blass & Gurevich, Randomizing Reductions of Search Problems 1991 11 FSTTCS Sands, Time Analysis, Cost Equivalence, and Program Refinement 1991 11 FSTTCS Mitra & Sivakumar, AC-Equation Solving 1991 11 FSTTCS Tan & Chen, On the Operational Interpretation of Complex Types 1991 11 FSTTCS Lodaya & Ramanujam, Tense Logics for Local Reasoning in Distributed Systems 1991 11 FSTTCS Aceto & Engberg, Failures Semantics for a Simple Process Language with Refinement 1991 11 FSTTCS Hungar, Correctness of Programs over Poor Signatures 1991 11 FSTTCS Case & Jain & Sharma, Complexity Issues for Vacillatory Function Identification 1991 11 FSTTCS Le Saec & Pin & Weil, A Purely Algebraic Proof of McNaughton's Theorem on Infinite Words 1991 11 FSTTCS Jiang & McDowell & Ravikumar, The Structure and Complexity of Minimal NFAs over a Unary Alphabet 1991 11 FSTTCS Mahajan & Krithivasan, Relativised Cellular Automata and Complexity Classes 1991 11 FSTTCS Kim & McNaughton, Computing the Order of a Locally Testable Automaton 1991 11 FSTTCS Goldsmith & Hemachandra & Kunen, On the Structure and Complexity of Infinite Sets with Minimal Perfect Hash Functions 1991 11 FSTTCS Agrawal, NP-hard Sets and Creativeness over Constant Time Languages 1991 11 FSTTCS Stewart, Complete Problems Involving Boolean Labelled Structures and Projection Translations 1991 11 FSTTCS Vinay, Is BP.XOR P a Probabilistic Class? 1991 11 FSTTCS Munro & Raman, Fast Stable In-Place Sorting with O(n) Data Moves 1991 11 FSTTCS Paschos, A Theorem on the Approximation of Set Cover and Vertex Cover 1991 11 FSTTCS Patkar & Narayanan, A Fast Algorithm for the Principal Partition of a Graph 1991 11 FSTTCS Niepel & Rossmanith, Uniform Circuits and Exclusive Read PRAMs 1991 11 FSTTCS Furer & Raghavachari, Contracting Planar Graphs Efficiently in Parallel 1991 11 FSTTCS Krizanc & Narayanan & Raman, Fast Deterministic Selection on Mesh-Connected Processor Arrays 1991 11 FSTTCS Mansour & Park & Schieber & Sen, Improved Selection in Totally Monotone Arrays 1991 11 FSTTCS Papadimitriou & Rangan & Sideri, Designing Secure Communication Protocols from Trust Specifications 1991 11 FSTTCS Ghosh & Maheshwari & Pal & Saluja & Madhavan, Computing the Shortest Path Tree in a Weak Visibility Polygon 1991 11 FSTTCS Bhattacharya, Usefulness of Angle-Sweep over Line-Sweep 1991 11 FSTTCS Winskel, Petri Nets and Transition Systems 1990 10 FSTTCS Huynh & Joskowicz & Lassez & Lassez, Reasoning About Linear Constraints Using Parametric Queries 1990 10 FSTTCS Yuan & You, Discriminant Circumscription 1990 10 FSTTCS Subrahmanyam, Complexity of Algebraic Specifications 1990 10 FSTTCS Treinen, A New Method for Undecidability Proofs of First Order Theories 1990 10 FSTTCS Masseron & Tollu & Vauzeilles, Generating Plans in Linear Logic 1990 10 FSTTCS Culik & Dube, Automata Theoretic Techniques for Image Generation and Compression 1990 10 FSTTCS Saoudi & Muller & Schupp, Recognizable Infinite Tree Sets and their Complexity 1990 10 FSTTCS Vinay & Chandru, The Expressibility of Nondeterministic Auxiliary Stack Automata and its Relation to Treesize Bounded Alternating Auxiliary Pushdown Automata 1990 10 FSTTCS Lewington, Towards Constructive Program Derivation in VDM 1990 10 FSTTCS Kapur & Sivakumar & Zhang, A New Method for Proving Termination of AC-Rewrite Systems 1990 10 FSTTCS Reif & Tyagi, Efficient Parallel Algorithms for Optical Computing with the DFT Primitive 1990 10 FSTTCS Raman, The Power of Collision: Randomized Parallel Algorithms for Chaining and Integer Sorting 1990 10 FSTTCS Lin & Olariu, Fast Parallel Algorithms for Cographs 1990 10 FSTTCS Case & Rajan & Shende, Optimally Representing Euclidean Space Discretely for Analogically Simulating Physical Phenomena 1990 10 FSTTCS Levcopoulos & Lingas & Petersson & Rytter, Optimal Parallel Algorithms for Testing Isomorphism of Trees and Outerplanar Graphs 1990 10 FSTTCS Rajasekaran, Randomized Parallel Selection 1990 10 FSTTCS Pearson & Vazirani, A Fast Parallel Algorithm for Finding a Maximal Bipartite Set 1990 10 FSTTCS Kosaraju, On the Parallel Evaluation of Classes of Circuits 1990 10 FSTTCS Fu & Lee, Voronoi Diagrams of Moving Points in the Plane 1990 10 FSTTCS Nandy & Bhattacharya & Ray, Efficient Algorithms for Identifying All Maximal Isothetic Empty Rectangles in VLSI Layout Design 1990 10 FSTTCS Datta & Ramkumar, On Some Largest Empty Orthoconvex Polygons in a Point Set 1990 10 FSTTCS Kwiatkowska, Defining Process Fairness for Non-Interleaving Concurrency 1990 10 FSTTCS DeNicola, Observational Logics and Concurrency Models 1990 10 FSTTCS Arora & Gouda, Distributed Reset 1990 10 FSTTCS Gronning & Nielsen & Lovengreen, Refinement and Composition of Transition-based Rely-Guarantee Specifications with Auxiliary Variables 1990 10 FSTTCS Juang & Venkatesan, Efficient Algorithms for Crash Recovery in Distributed Systems 1990 10 FSTTCS Reggio, A Non-Standard Inductive Semantics 1990 10 FSTTCS Sieber, Relating Full Abstraction Results for Different Programming Languages 1990 10 FSTTCS Chandrasekaran & Narayanan, Towards a Theory of Commonsense Visual Reasoning 1990 10 FSTTCS Bharati & Sangal & Chaitanya, Natural Language Processing, Complexity Theory and Logic 1989 9 FSTTCS Jamison & Olariu, A Linear-Time Recognition Algorithm for P4-Reducible Graphs 1989 9 FSTTCS Pantziou & Spirakis & Zaroliagis, Fast Parallel Approximations of the Maximum Weighted Cut Problem through Derandomization 1989 9 FSTTCS Kumar & Madhavan, A New Class of Separators and Planarity of Chordal Graphs 1989 9 FSTTCS Rao & Rangan, Optimal Parallel Algorithms on Circular-Arc Graphs 1989 9 FSTTCS Subrahmanian, Algebraic Properties of the Space of Multivalued and Paraconsistent Logic Programs 1989 9 FSTTCS Jiang, An Autoepistemic Logical View of Knowledge Base 1989 9 FSTTCS Dung & Kanchanasut, A Natural Semantics for Logic Programs with Negation 1989 9 FSTTCS Maher, A Transformation System for Deductive Database Modules with Perfect Model Semantics 1989 9 FSTTCS Ahuja & Zhu, An Efficient Distributed Algorithm for Finding Articulation Points, Bridges, and Biconnected Components in Asynchronous Networks 1989 9 FSTTCS Taubenfeld & Katz & Moran, Impossibility Results in the Presence of Multiple Faulty Processes 1989 9 FSTTCS Bonomi & Fleming & Steinberg, An Adaptive Regulator Approach for the Design of Load Sharing Algorithms 1989 9 FSTTCS Breu & Zucca, An Algebraic Compositional Semantics of an Object-Oriented Notation with Concurrency 1989 9 FSTTCS Mukund & Thiagarajan, An Axiomatization of Event Structures 1989 9 FSTTCS Gunawardena, Deducing Causal Relationships in CCS 1989 9 FSTTCS Kasyanov, Annotated Program Transformations 1989 9 FSTTCS Ehrig & Fey & Hansen & Lowe & Jacobs, Algebraic Software Development Concepts for Module and Configuration Families 1989 9 FSTTCS Hemachandra & Jain, On the Limitations of Locally Robust Positive Reductions 1989 9 FSTTCS Lakshmanan, Query Evaluation with Null Values: How Complex is Completeness? 1989 9 FSTTCS Albert, Average Case Complexity Analysis of RETE Pattern-Match Algorithm and Average Size of Join in Databases 1989 9 FSTTCS Kannan, The Frobenius Problem 1989 9 FSTTCS Gambosi & Protasi & Talamo, An Efficient Implicit Data Structure for Path Testing and Searching in Rooted Trees and Forests 1989 9 FSTTCS Bajaj & Dey, Robust Decompositions of Polyhedra 1989 9 FSTTCS Das & Deo & Prasad, Gate Matrix Layout Revisited: Algorithmic Performance and Probabilistic Analysis 1989 9 FSTTCS Ibarra & Jiang & Wang, Parallel Parsing on a One-way Linear Array of Finite-State Machines 1989 9 FSTTCS Tyagi, Energy-time Trade-offs in VLSI Computations 1989 9 FSTTCS Joseph, Time and Real-time in Programs 1989 9 FSTTCS Hennessy, A Proof System for Communicating Processes with Value-passing 1988 8 FSTTCS Preparata, Planar Point Location Revisited (A Guided Tour of a Decade of Research) 1988 8 FSTTCS Ghosh, Computing a Viewpoint of a Set of Points Inside a Polygon 1988 8 FSTTCS Cheriyan & Maheshwari, Analysis of Preflow Push Algorithms for Maximum Network Flow 1988 8 FSTTCS Krishnan & Rangan & Seshadri, A New Linear Algorithm for the Two Path Problem on Chordal Graphs 1988 8 FSTTCS Khuller, Extending Planar Graph Algorithms to K_3,3-free Graphs 1988 8 FSTTCS Crochemore, Constant-Space String-Matching 1988 8 FSTTCS Sur-Kolay & Bhattacharya, Inherent Nonslicibility of Rectangular Duals in VLSI Floorplanning 1988 8 FSTTCS Datta & Krithivasan, Path Planning with Local Information 1988 8 FSTTCS Chou & Gopal, Linear Broadcast Routing (Abstract) 1988 8 FSTTCS Arbib & Italiano & Panconesi, Predicting Deadlock in Store-and-Forward Networks 1988 8 FSTTCS Saxena & Bhatt & Prasad, On Parallel Sorting and Addition with Concurrent Writes 1988 8 FSTTCS Levcopoulos & Petersson, An Optimal Parallel Algorithm for Sorting Presorted Files 1988 8 FSTTCS Rao & Kumar, Superlinear Speedup in Parallel State-Space Search 1988 8 FSTTCS Venkateswaran, Circuit Definitions of Nondeterministic Complexity Classes 1988 8 FSTTCS Kamper, Non-Uniform Proof Systems: A New Framework to Describe Non-Uniform and Probabilistic Complexity Classes 1988 8 FSTTCS Khadilkar & Biswas, Padding, Commitment and Self-reducibility 1988 8 FSTTCS Rich & Slutzki, The Complexity of a Counting Finite-State Automaton 1988 8 FSTTCS Kirchherr, A Hierarchy Theorem for PRAM-Based Complexity Classes 1988 8 FSTTCS Burstall & Honsell, A Natural Deduction Treatment of Operational Semantics 1988 8 FSTTCS Bellot & Jay, Uniformly Applicative Structures, A Theory of Computability and Polyadic Functions 1988 8 FSTTCS Awerbuch & Kirousis & Kranakis & Vitanyi, A Proof Technique for Register Atomicity 1988 8 FSTTCS Desharnais & Madhavji, Relation Level Semantics 1988 8 FSTTCS Henson & Turner, A Constructive Set Theory for Program Development 1988 8 FSTTCS Panangaden & Shanbhogue, McCarthy's Amb Cannot Implement Fair Merge 1988 8 FSTTCS Furukawa & Ueda, GHC--A Language for a New Age of Parallel Programming 1988 8 FSTTCS Pingali & Ekanadham, Accumulators: New Logic Variable Abstractions for Functional Languages 1988 8 FSTTCS Bhatta & Karnick, A Resolution Rule for Well-Formed Formulas 1988 8 FSTTCS Kaplan, Algebraic and Operational Semantics of Positive/Negative Conditional Algebraic Specifications 1988 8 FSTTCS Kapur & Musser & Narendran & Stillman, Semi-Unification 1988 8 FSTTCS Beauvieux, A Method to Check Knowledge Base Consistency 1988 8 FSTTCS Fiadeiro & Sernadas & Sernadas, Knowledge Bases as Structured Theories 1988 8 FSTTCS Janas, On Functional Independencies 1988 8 FSTTCS Bhargava & Browne, A Generic Algorithm for Transaction Processing During Network Partitioning 1987 7 FSTTCS Gurevich, Algebraic Operational Semantics 1987 7 FSTTCS Subramanian & Van & Siromoney, On Ambiguity of DT0L Systems 1987 7 FSTTCS Culik & Linna, The Equivalence Problem for n-Tape Finite Automata with Simple Cycles 1987 7 FSTTCS Ibarra & Ravikumar, Relating the Degree of Ambiguity of Finite Automata to the Succinctness of Their Representation 1987 7 FSTTCS Parigot, Automata, Games, and Positive Monadic Theories of Trees 1987 7 FSTTCS Stewart, An Algorithm for Colouring Perfect Planar Graphs 1987 7 FSTTCS Sastry & Jayakumar & Madhavan, Efficient Algorithms for Domination and Hamilton Circuit Problems on Permutation Graphs 1987 7 FSTTCS Lingas & Proskurowski, Fast Parallel Algorithms for the Subgraph Homeomorphism and the Subgraph Isomorphism Problem for Classes of Planar Graphs 1987 7 FSTTCS Levcopoulos, Improved Bounds for Covering General Polygons with Rectangles 1987 7 FSTTCS Parrow, Submodule Construction as Equation Solving in CCS 1987 7 FSTTCS Bhaskar & Buckley, Computations in Undistinguished Networks 1987 7 FSTTCS Bagrodia, A Distributed Algorithm to Implement N-Party Rendezvous 1987 7 FSTTCS Baeten & van Glabbeek, Merge and Termination in Process Algebra 1987 7 FSTTCS Chandy & Misra, Parallelism and Programming: A Perspective 1987 7 FSTTCS Gannett & Kothari & Yen, On Optimal Parallelization of Sorting Networks 1987 7 FSTTCS Ogunyode, Parallel Algorithms for Approximate Edge Coloring of Simple Graphs 1987 7 FSTTCS Rajasekaran & Tsantilas, An Optimal Randomized Routing Algorithm for the Mesh and a Class of Efficient Mesh-like Routing Networks 1987 7 FSTTCS Huet, The Calculus of Constructions: State of the Art 1987 7 FSTTCS Gries, Modules for Re-Use 1987 7 FSTTCS Santha, Relativized Arthur-Merlin versus Merlin-Arthur Games 1987 7 FSTTCS Zachos & Furer, Probabilistic Quantifiers vs. Distrustful Adversaries 1987 7 FSTTCS Arvind & Biswas, On Certain Bandwidth Restricted Versions of the Satisfiability Problem of Propositional CNF Formulas 1987 7 FSTTCS Parikh, Some Recent Applications of Knowledge 1986 6 FSTTCS Papadimitriou, Shortest-Path Motion 1986 6 FSTTCS Kannan & Lovasz, Covering Minima and Lattice Point Free Convex Bodies 1986 6 FSTTCS von zur Gathen, Irreducible Polynomials over Finite Fields 1986 6 FSTTCS Kannan & McGeoch, Basis Reduction and Evidence for Transcendence of Certain Numbers 1986 6 FSTTCS Mohanty & Bhattacharjee, A Distributed Algorithm for Edge-Disjoint Path Problem 1986 6 FSTTCS Moitra, Scheduling of Hard Real-Time Systems 1986 6 FSTTCS Hochbaum & Shmoys, A Polynomial Approximation Scheme for Machine Scheduling on Uniform Processors: Using the Dual Approximation Approach 1986 6 FSTTCS Lovasz, Connectivity Algorithms Using Rubber-bands 1986 6 FSTTCS Homer, On Simple and Creative Sets in NP 1986 6 FSTTCS Kapur & Narendran & Zhang, Complexity of Sufficient-Completeness 1986 6 FSTTCS Vazirani & Vazirani, Sampling a Population with a Semi-Random Source 1986 6 FSTTCS Gibbons & Rytter, An Optimal Parallel Algorithm for Dynamic Expression Evaluation and its Applications 1986 6 FSTTCS Pan & Reif, Extension of the Parallel Nested Dissection Algorithm to Path Algebra Problems 1986 6 FSTTCS Rajopadhye & Purushothaman & Fujimoto, On Synthesizing Systolic Arrays from Recurrence Equations with Linear Dependencies 1986 6 FSTTCS Verma & Krishnaprasad & Ramakrishnan, An Efficient Parallel Algorithm for Term Matching 1985 FSTTCS Kozen & Vazirani & Vazirani, NC Algorithms for Comparability Graphs, Interval Graphs, and Testing for Unique Perfect Matching 1985 FSTTCS Pan, Fast and Efficient Parallel Algorithms for the Exact Inversion of Integer Matrices 1985 FSTTCS Sherlekar & Pawagi & Ramakrishnan, O(1) Parallel Time Incremental Graph Algorithms 1991 1 FSWAC Tietavainen, On the Correlation of Sequences 1991 1 FSWAC Zemor, An Extremal Problem Related to the Covering Radius of Binary Codes 1991 1 FSWAC Pless, Remarks on Greedy Codes 1991 1 FSWAC Dumer, On Nonbinary Codes with Fixed Distance 1991 1 FSWAC Arazi, Position Recovery on a Circle based on Coding Theory 1991 1 FSWAC Blinovsky, The Lower Bound for Cardinality of Codes Correcting Errors and Defects 1996 26 FTCS Bao & Igarashi, Reliable Broadcasting in Product Networks with Byzantine Faults 1996 26 FTCS Mahapatra & Dutt, Hardware-Efficient and Highly-Reconfigurable 4- and 2-Track Fault-Tolerant Designs for Mesh-Connected Multicomputers 1996 26 FTCS Bae & Bose, Spare Processor Allocation for Fault Tolerance in Torus-Based Multicomputers 1995 25 FTCS Yotsuyanagi & Kajihara & Kinoshita, Synthesis for Testability by Sequential Redundancy Removal Using Retiming 1995 25 FTCS Jiang & Chou & Saluja, Synthesizing Finite State Machines for Minimum Length Synchronizing Sequence Using Partial Scan 1995 25 FTCS Buskens & Bianchini, Self-Stabilizing Mutual Exclusioin in the Presence of Faulty Nodes 1995 25 FTCS Olson & Shin & Jambor, Fault-Tolerant Clock Synchronization for Distributed Systems Using Continuous Synchronization Messages 1994 24 FTCS Bright & Sullivan, Checking Mergeable Priority Queues 1994 24 FTCS Yen & Bastani, Systematic Incorporation of Efficient Fault Tolerance in Systems of Cooperating Parallel Programs 1994 24 FTCS Amato & Loui, Checking Linked Data Structures 1994 24 FTCS Plank & Li, Faster Checkpointing with N+1 Parity 1994 24 FTCS Ku & Hayes, Connectivity and Fault Tolerance of Multiple-Bus Systems 1994 24 FTCS Chiu & Wu, Fault-Tolerant Routing Strategy in Hypercube Systems 1994 24 FTCS Mans & Santoro, Optimal Fault-Tolerant Leader Election in Chordal Rings 1993 23 FTCS Glass & Ni, Fault-Tolerant Wormhole Routing in Meshes 1993 23 FTCS Kantawala & Tao, Designing Concurrent Checking Sorting Networks 1993 23 FTCS Bruck & Cypher & Ho, Wildcard Dimensions, Coding Theory and Fault-Tolerant Meshes and Hypercubes 1993 23 FTCS Tohma & Koyanagi, Design of Neural Networks to Tolerate the Mixture of Two Types of Faults 1993 23 FTCS Shamsunder & Rosenkrantz & Ravi, Exploiting Data Flow Information in Algorithm-Based Fault Tolerance 1993 23 FTCS Lincoln & Rushby, A Formally Verified Algorithm for Interactive Consistency Under a Hybrid Fault Model 1993 23 FTCS Berman & Garay, Randomized Distributed Agreement Revisited 1992 22 FTCS Verissimo & Rodrigues, A Posteriori Agreement for Fault-Tolerant Clock Synchronization on Broadcast Networks 1992 22 FTCS Zheng & Shin, Fault-Tolerant Real-Time Communication in Distributed Computing Systems 1992 22 FTCS Bruck & Cypher & Ho, Efficient Fault-Tolerant Mesh and Hypercube Architectures 1992 22 FTCS Raghavendra & Yang & Tien, Free Dimensions -- An Effective Approach to Achieving Fault Tolerance in Hypercubes 1992 22 FTCS Latifi & Zheng & Bagherzadeh, Optimal Ring Embedding in Hypercubes with Faulty Links 1992 22 FTCS Alam & Melhem, Routing in Modular Fault-Tolerant Multiprocessor System 1992 22 FTCS Srinivas & Jacob & Agrawal, Finite State Machine Testing Based on Growth and Disappearance Faults 1992 22 FTCS Parhami, Optimal Algorithms for Exact, Inexact, and Approval Voting 1992 22 FTCS Blaum & Bruck, Unordered Error-Correcting Codes and Their Applications 1992 22 FTCS Fujiwara & Hamada, Single b-Bit Byte Error Correcting and Double Bit Error Detecting Codes for High-Speed Memory Systems 1992 22 FTCS Rao & Feng & Kolluru, Efficient Multiple Unidirectional Byte Error-Detecting Codes for Computer Memory Systems 1991 21 FTCS Chillarege & Horst & Siewiorek & Swarz, Challenges in Designing Fault-Tolerant Systems 1991 21 FTCS Chlebus & Diks & Pelc, Optimal Broadcasting in Faulty Hypercubes 1991 21 FTCS Sun & Gecsei, A Multiple-Fault Tolerant Sorting Network 1991 21 FTCS Tzeng & Chuang, Fault-Tolerant Gamma Interconnection Networks 1990 20 FTCS Nayak & Santoro & Tan, Fault Intolerance of Reconfigurable Systolic Arrays 1990 20 FTCS Banerjee, Strategies for Reconfiguring Hypercubes Under Faults 1990 20 FTCS Peercy & Banerjee, Distributed Algorithms for Shortest-Path, Deadlock-Free Routing and Broadcasting in Arbitrarily Faulty Hypercubes 1993 4 FTDCS Beauquier & Delaet, Classes of Self-Stabilizing Protocols 1992 FTPDS Schneeweiss, Fault Trees for Networks via Longest Paths Trees 1992 FTPDS Chan & Amano, An Extended Fault-Tolerant Batcher Network 1992 FTPDS Bhatia & Youssef, Efficient Randomized Fault-Tolerant Routing on Clos Networks 1992 FTPDS Harrington & Somani, Synchronizing Hypercube Networks in the Presence of Faults 1996 4 FTRTFTS Shankar, Unifying Verification Paradigms 1996 4 FTRTFTS D'Argenio & Brinksma, A Calculus for Timed Automata 1996 4 FTRTFTS Springintveld & Vaandrager, Minimizable Timed Automata 1996 4 FTRTFTS Mei & Igarashi & Shimizu, Efficient Broadcasting on Faulty Star Networks 1994 3 FTRTFTS Fix & Schneider, Hybrid Verification by Exploiting the Environment 1994 3 FTRTFTS Hooman, Correctness of Real Time Systems by Construction 1994 3 FTRTFTS Lamport & Merz, Specifying and Verifying Fault-Tolerant Systems 1994 3 FTRTFTS Pnueli, Development of Hybrid Systems 1994 3 FTRTFTS Zhou, Linear Duration Invariants 1997 13 GAC Aigner & Li, Searching for Counterfeit Coins 1997 13 GAC Nishimura, A New Recursive Theorem on n-Extendibility 1996 12 GAC Goddard, The Toughness of Cubic Graphs 1996 12 GAC Vince & Yang, Reconstruction of the Set of Branches of a Graph 1996 12 GAC de Werra & Erschler, Open Shop Scheduling with Some Additional Constraints 1995 11 GAC Jeffs & Seager, The Chip Firing Game on n-Cycles 1994 10 GAC Alon, Packing of Partial Designs 1994 10 GAC Chen & Matsumoto & Wang & Zhang & Zhang, A Short Proof of Nash-Williams' Theorem for the Arboricity of a Graph 1993 9 GAC Barany & Frankl & Maehara, Reflecting a Triangle in the Plane 1993 9 GAC Shallit, On the Maximum Number of Distinct Factors of a Binary String 1993 9 GAC Broersma & van den Heuvel & Jung & Veldman, Long Paths and Cycles in Tough Graphs 1993 9 GAC De Simone, On the Vertex Packing Problem 1993 9 GAC Gargano & Korner & Vaccaro, Sperner Capacities 1993 9 GAC Loebl, Gadget Classification 1993 9 GAC Wozniak & Wojda, Triple Placement of Graphs 1992 8 GAC Godsil & Seifter, Graphs with Polynomial Growth Are Covering Graphs 1992 8 GAC Gutjahr & Pflug, The Asymptotic Distribution of Leaf Heights in Binary Trees 1992 8 GAC Yamasaki, Shannon Switching Games Without Terminals III 1991 7 GAC Alon & Kleitman & Lipton & Meshulam & Rabin & Spencer, Set Systems with No Union of Cardinality 0 Modulo m 1991 7 GAC Bierbrauer, Weighted Arcs, The Finite Radon Transform and a Ramsey Problem 1991 7 GAC Alon & Hajnal, Ramsey Graphs Contain Many Distinct Induced Subgraphs 1991 7 GAC Brand, Polynomial Isomorphisms of Combinatorial Objects 1991 7 GAC Frankl, Shadows and Shifting 1991 7 GAC Mohar, Eigenvalues, Diameter, and Mean Distance in Graphs 1991 7 GAC Ramras, Symmetric Edge-Decompositions of Hypercubes 1990 6 GAC Baldi, On a Generalized Family of Colorings 1990 6 GAC Griggs & Hanlon & Odlyzko & Waterman, On the Number of Alignments of k Sequences 1989 5 GAC Conway & Sloane & Wilks, Gray Codes for Reflection Groups 1989 5 GAC Yamasaki, Shannon Switching Games Without Terminals II 1989 5 GAC Bermond & Homobono & Peyrat, Large Fault-Tolerant Interconnection Networks 1994 GALERSCH Marcaccio (Ed.), Gale Directory of Databases, Volume 1: Online Databases, January 1994 1994 GALERSCH Marcaccio (Ed.), Gale Directory of Databases, Volume 2: CD-ROM, Diskette, Magnetic Tape, Handheld, and Batch Access Database Products, January 1994 1993 GALERSCH Marcaccio (Ed.), Gale Directory of Databases 1997 26 GAMETHEORY Dagan & Volij, Bilateral Comparisons and the Consistent Fair Division Rules in the Context of Bankruptcy Problems 1996 25 GAMETHEORY Xu, Isomorphism in 3-Person Games 1995 24 GAMETHEORY Abdou, Nash and Strongly Consistent Two-Player Game Forms 1995 24 GAMETHEORY Knoblauch, Geometric Versions of Finite Games: Prisoner's Dilemma, Entry Deterrence and a Cyclical Majority Paradox 1994 23 GAMETHEORY Domansky & Kreps, ``Eventually Revealing'' Repeated Games with Incomplete Information 1994 23 GAMETHEORY Solymosi & Raghavan, An Algorithm for Finding the Nucleolus of Assignment Games 1994 23 GAMETHEORY Raychaudhuri, Almost Strict Competitiveness in Extensive Games 1993 22 GAMETHEORY Neme, Little Perfection and Complexity 1993 22 GAMETHEORY Mizutani & Hiraide & Nishino, Computational Complexity to Verify the Unstability of Effectivity Function 1993 22 GAMETHEORY Monderer & Sorin, Asymptotic Properties in Dynamic Programming 1993 22 GAMETHEORY Kolpin, The Core of Discontinuous Games 1993 22 GAMETHEORY Guth & Ockenfels & Wendel, Efficiency by Trust in Fairness? Multiperiod Ultimatum Bargaining Experiments With an Increasing Cake 1993 22 GAMETHEORY Diekmann, Cooperation in an Asymmetric Volunteer's Dilemma Game. Theory and Experimental Evidence 1993 21 GAMETHEORY Kuipers, On the Core of Information Graph Games 1992 21 GAMETHEORY Samet, Agreeing to Disagree in Infinite Information Structures 1992 20 GAMETHEORY Propp & Ullman, On the Cookie Game 1992 20 GAMETHEORY Kalai & Neme, The Strenght of a Little Perfection 1992 20 GAMETHEORY Plum, Characterization and Computation of Nash-Equilibria for Auctions with Incomplete Information 1992 20 GAMETHEORY Le Breton & Owen & Weber, Strongly Balanced Cooperative Games 1991 19 GAMETHEORY Sankaran, On Finding the Nucleolus of an N-Person Cooperative Game 1991 19 GAMETHEORY Kurisu, On a Duel with Time Lag and Arbitrary Accuracy Functions 1991 19 GAMETHEORY van den Nouweland & Borm, On the Convexity of Communication Games 1990 19 GAMETHEORY Prasad & Kelly, NP-Completeness of Some Problems Concerning Voting Games 1989 18 GAMETHEORY Fraenkel & Harary, Geodetic Contraction Games and Graphs 1987 16 GAMETHEORY Samuelson, A Note on Uncertainty and Cooperation in a Finitely Repeated Prisoner's Dilemma 1981 GARDNER Knuth, Supernatural Numbers 1987 GASA Davis & Steenstrup, Genetic Algorithms and Simulated Annealing: An Overview 1987 GASA Axelrod, The Evolution of Strategies in the Iterated Prisoner's Dilemma 1995 4 GDRAWING Agarwal & Aronov & Pach & Pollack & Sharir, Quasi-Planar Graphs Have a Linear Number of Edges 1995 4 GDRAWING Godau & Whitesides, Universal 3-Dimensional Visibility Representations for Graphs 1995 4 GDRAWING Benz, KGB: A Customizable Graph Browser 1995 4 GDRAWING Bertault, Adocs: a Drawing System for Generic Combinatorial Structures 1995 4 GDRAWING Biedl, New Lower Bounds for Orthogonal Graph Drawings 1995 4 GDRAWING Bose & Gomez & Ramos & Toussaint, Drawing Nice Projections of Objects in Space 1995 4 GDRAWING Bose & McAllister & Snoeyink, Optimal Algorithms to Embed Trees in a Point Set 1995 4 GDRAWING Brandenburg & Himsolt & Rohrer, An Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms 1995 4 GDRAWING Breu & Kirkpatrick, On the Complexity of Recognizing Intersection and Touching Graphs of Disks 1995 4 GDRAWING Bruss & Frick, Fast Interactive 3-D Graph Visualization 1995 4 GDRAWING Buti & Di Battista & Liotta & Tassinari & Vargiu & Vismara, GD-Workbench: A System for Prototyping and Testing Graph Drawing Algorithms 1995 4 GDRAWING Carbonneaux & Laborde & Madani, CABRI-Graph: A Tool for Research and Teaching in Graph Theory 1995 4 GDRAWING Cruz & Twarog, 3D Graph Drawing with Simulated Annealing 1995 4 GDRAWING Devroye & Kruszewski, The Botanical Beauty of Random Binary Trees 1995 4 GDRAWING Di Battista & Liotta & Whitesides, The Strength of Weak Proximity 1995 4 GDRAWING Formella & Keller, Generalized Fisheye Views of Graphs 1995 4 GDRAWING Gropp, The Drawing of Configurations 1995 4 GDRAWING He, Grid Embeddings of 4-Connected Plane Graphs 1995 4 GDRAWING Heath & Pemmaraju, Recognizing Leveled-Planar Dags in Linear Time 1995 4 GDRAWING Monien & Ramme & Salmen, A Parallel Simulated Annealing Algorithm for Generating 3D Layouts of Undirected Graphs 1995 4 GDRAWING Papakostas & Tollis, Issues in Interactive Orthogonal Graph Drawing 1995 4 GDRAWING Shahrokhi & Sykora & Szekely & Vrt'o, Crossing Numbers of Meshes 1995 4 GDRAWING Yang & Shaffer & Heath, SWAN: A Data Structure Visualization System 1994 3 GDRAWING Cohen & Eades & Lin & Ruskey, Three-Dimensional Graph Drawing 1994 3 GDRAWING Reiss, 3-D Visualization of Program Information 1994 3 GDRAWING Jeron & Jard, 3D Layout of Reachability Graphs of Communicating Processes 1994 3 GDRAWING Mohar & Rosenstiehl, A Flow Approach to Upward Drawings of Toroidal Maps 1994 3 GDRAWING Papakostas & Tollis, Improved Algorithms and Bounds for Orthogonal Drawings 1994 3 GDRAWING Fossmeier & Kaufmann, On Bend-Minimum Orthogonal Upward Drawing of Directed Planar Graphs 1994 3 GDRAWING Even & Granot, Grid Layouts of Block Diagrams -- Bounding the Number of Bends in Each Connection 1994 3 GDRAWING Djidjev, On Drawing a Graph Convexly in the Plane 1994 3 GDRAWING Garg, On Drawing Angle Graphs 1994 3 GDRAWING He & Kao, Regular Edge Labelings and Drawings of Planar Graphs 1994 3 GDRAWING Chrobak & Nakano, Minimum-Width Grid Drawings of Plane Graphs 1994 3 GDRAWING de Fraysseix & de Mendez, Regular Orientations, Arboricity, and Augmentation 1994 3 GDRAWING Junger & Mutzel, The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems 1994 3 GDRAWING Shahrokhi & Szekely & Vrt'o, Crossing Numbers of Graphs, Lower Bound Techniques and Algorithms: a Survey 1994 3 GDRAWING Eades & Marks, Graph Drawing Contest Report 1994 3 GDRAWING Abello & Kumar, Visibility Graphs and Oriented Matroids 1994 3 GDRAWING Dean & Hutchinson, Rectangle-Visibility Representations of Bipartite Graphs 1994 3 GDRAWING Kranakis & Krizanc & Urrutia, On the Number of Directions in Visibility Representations of Graphs 1994 3 GDRAWING Romanik, Directed VR-Representable Graphs have Unbounded Dimension 1994 3 GDRAWING Himsolt, GraphEd: a Graphical Platform for the Implementatiion of Graph Algorithms 1994 3 GDRAWING Sander, Graph Layout through the VCG Tool 1994 3 GDRAWING Tollis & Xia, Drawing Telecommunication Networks 1994 3 GDRAWING Kimelman & Leban & Roth & Zernik, Reduction of Visual Complexity in Dynamic Graphs 1994 3 GDRAWING TOSCANA -- a Graphical Tool for Analyzing and Exploring Data 1994 3 GDRAWING Tanenbaum & Goodrich & Scheinerman, Characterization and Recognition of Point-Halfspace and Related Orders 1994 3 GDRAWING Abellanas & Hurtado & Ramos, Redrawing a Graph within a Geometric Tolerance 1994 3 GDRAWING Godau, On the Difficulty of Embedding Planar Graphs with Inaccuracies 1994 3 GDRAWING Manning & Atallah & Cudjoe & Lozito & Pacheco, A System for Drawing Graphs with Geometric Symmetry 1994 3 GDRAWING Frohlich & Werner, Demonstration of the Interactive Graph-Visualization System daVinci 1994 3 GDRAWING McCreary & Shieh & Gill, CG: a Graph Drawing System Using Graph-Grammar Parsing 1994 3 GDRAWING McWhirter, A Demonstration of Interactive Graph Based Visula Language Applications 1994 3 GDRAWING Kaugars & Reinfelds & Brazma, A Simple Algorithm for Drawing Large Graphs on Small Screens 1994 3 GDRAWING Fowler & Pisanski & Shawe-Taylor, Molecular Graph Eigenvectors for Molecular Coordinates 1994 3 GDRAWING Garg & Tamassia, On the Computational Complexity of Upward and Rectilinear Planarity Testing 1994 3 GDRAWING Papakostas, Upward Planarity Testing of Outerplanar Dags 1994 3 GDRAWING Crescenzi & Piperno, Optimal-Area Upward Drawings of AVL Trees 1994 3 GDRAWING Jourdan & Rival & Zaguia, Upward Drawing on the Plane Grid Using Less Ink 1994 3 GDRAWING Di Battista & Lenhart & Liotta, Proximity Drawability: a Survey 1994 3 GDRAWING Bose & Di Battista & Lenhart & Liotta, Proximity Constraints and Representable Trees 1994 3 GDRAWING ElGindy & Liotta & Lubiw & Meijer & Whitesides, Recognizing Rectangle of Influence Drawable Graphs 1994 3 GDRAWING Sugiyama & Misue, A Simple and Unified Method for Drawing Graphs: Magnetic-Spring Algorithm 1994 3 GDRAWING Lin & Eades, Integration of Declarative and Algorithmic Approaches for Layout Creation 1994 3 GDRAWING Frick & Ludwig & Mehldau, A Fast Adaptive Layout Algorithm for Undirected Graphs 1994 3 GDRAWING Cruz & Garg, Drawing Graphs by Example Efficiently: Trees and Planar Acyclic Digraphs 1994 3 GDRAWING Brandenburg, Designing Graph Drawings by Layout Graph Grammars 1994 3 GDRAWING Noik, Encoding Presentation Emphasis Algorithms for Graphs 1994 3 GDRAWING Luo & Miriyala, A Practical Approach to Static Node Positioning 1994 3 GDRAWING Saalfeld, Map Generalization as a Graph Drawing Problem 1994 3 GDRAWING Stumme & Wille, A Geometrical Heuristic for Drawing Concept Lattices 1991 38 GEOMDED Jingzhong & Lu & Xiaorong, What can we do with only a Pair of Rusty Compasses? 1991 38 GEOMDED Szabo, 21-Neighbor Packing of Equal Balls in the 4-Dimensional Euclidean Space 1997 17 GEOMETRY Edelsbrunner & Valtr & Welzl, Cutting Dense Point Sets in Half 1997 17 GEOMETRY Baryshnikov, Gaussian Samples, Regular Simplices, and Exchangeability 1997 17 GEOMETRY Eppstein & Paterson & Yao, On Nearest Neighbor Graphs 1997 17 GEOMETRY Banaszczyk & Szarek, Lattice Coverings and Gaussian Measures of n-Dimensional Convex Bodies 1997 17 GEOMETRY Edelsbrunner & Ramos, Inclusion-Exclusion Complexes for Pseudodisk Collections 1997 17 GEOMETRY Abellanas & Hernandez & Klein & Neumann-Lara & Urrutia, A Combinatorial Property of Convex Sets 1997 17 GEOMETRY Pellegrini, Monte Carlo Approximation of Form Factors with Error Bounded a Priori 1997 17 GEOMETRY He, Grid Embedding of 4-Connected Graphs 1997 17 GEOMETRY Edelman & Reiner, Erratum to Free Arrangement and Rhombic Tilings 1997 17 GEOMETRY Dwyer, Voronoi Diagrams of Random Lines and Flats 1997 17 GEOMETRY Huber & Sturmfels, Bernstein's Theorem in Affine Space 1997 17 GEOMETRY Ghosh, On Recognizing and Characterizing Visibility Graphs of Simple Polygons 1997 17 GEOMETRY Iwasaki, Polytopes and the Mean Value Property 1997 17 GEOMETRY Grigoriev & Karpinski & Vorobjov, Lower Bound on Testing Membership to a Polygon by Algebraic Decision and Computation Trees 1997 17 GEOMETRY Freiling & Laczkovich & Rinne, Rectangling a Rectangle 1997 17 GEOMETRY Kedem & Sharir & Toledo, On Critical Orientations in the Kedem-Sharir Motion Planning Algorithm 1997 17 GEOMETRY Hales, Sphere Packings, I 1997 17 GEOMETRY Chazelle, Lower Bounds for Off-Line Range Searching 1997 17 GEOMETRY Dubejko, Approximation of Analytic Functions with Prescribed Boundary Conditions by Circle-Packing Maps 1997 17 GEOMETRY Borgwardt, Average Complexity of a Gift-Wrapping Algorithm for Determining the Convex Hull of Randomly Given Points 1997 17 GEOMETRY Brass, On the Quantitative Steinitz Theorem in the Plane 1996 16 GEOMETRY Agarwal & Sharir, Efficient Randomized Algorithms for Some Geometric Optimization Problems 1996 16 GEOMETRY Aichholzer & Aurenhammer & Cheng & Katoh & Rote & Taschwer & Xu, Triangulations Intersect Nicely 1996 16 GEOMETRY Chan, Optimal Output-Sensitive Convex Hull Algorithms in Two and Three Dimensions 1996 16 GEOMETRY Chan, Output-Sensitive Results on Convex Hulls, Extreme Points, and Related Problems 1996 16 GEOMETRY Erickson, New Lower Bounds for Hopcroft's Problem 1996 16 GEOMETRY Pocchiola & Vegter, Topologically Sweeping Visibility Complexes via Pseudotriangulations 1996 16 GEOMETRY Tagansky, A New Technique for Analyzing Substructures in Arrangements of Piecewise Linear Surfaces 1996 16 GEOMETRY Rambau & Ziegler, Projections of Polytopes and the Generalized Baues Conjecture 1996 16 GEOMETRY Efrat & Sharir, A Near-Linear Algorithm for the Planar Segment-Center Problem 1996 16 GEOMETRY Hetyei, On the cd-Variation Polynomials of Andre and Simsun Permutations 1996 16 GEOMETRY MacDonald & Shermer, Isomorphism of Spiral Polygons 1996 16 GEOMETRY Banaszczyk, Inequalities for Convex Bodies and Polar Reciprocal Lattices in R^n. II: Application of K-Convexity 1996 16 GEOMETRY Halperin & Sharir, A Near-Quadratic Algorithm for Planning the Motion of a Polygon in a Polygonal Environment 1996 16 GEOMETRY Rucklidge, Lower Bounds for the Complexity of the Graph of the Hausdorff Distance as a Function of Tranformation 1996 16 GEOMETRY Arya & Mount & Narayan, Accounting for Boundary Effects in Nearest-Neighbor Searching 1996 16 GEOMETRY Le, On Voronoi Diagrams in the L_p-Metric in R^D 1996 16 GEOMETRY Santos, On Delaunay Oriented Matroids for Convex Distance Functions 1996 16 GEOMETRY Ramos, The Number of Extreme Triples of a Planar Point Set 1996 16 GEOMETRY Richardson, Planar Rectifiable Curves Are Determined by Their Projections 1996 16 GEOMETRY Bujalance & Costa & Gamboa & Lafuente, An Algorithm To Compute Orders and Ramification Indices of Cyclic Actions on Compact Surfaces, II 1996 16 GEOMETRY Gruber & Ludwig, A Helmholtz-Lie Type Characterization of Ellipsoids, II 1996 16 GEOMETRY Verschelde & Gatermann & Cools, Mixed-Volume Computation by Dynamic Lifting Applied to Polynomial System Solving 1996 16 GEOMETRY Piepmeyer, The Maximum Number of Odd Integral Distances Between Points in the Plane 1996 15 GEOMETRY McMullen, Weights on Polytopes 1996 15 GEOMETRY Lee, Spheres, Convex Polytopes, and Stress 1996 15 GEOMETRY Amenta, A Short Proof of an Interesting Helly-Type Theorem 1996 15 GEOMETRY Hardin & Sloane, McLaren's Improved Snub Cube and Other New Spherical Designs in Three Dimensions 1996 15 GEOMETRY Kleinschmidt & Onn, Signable Posets and Partitionable Simplicial Complexes 1996 15 GEOMETRY Hoory & Linial, Central Points for Sets in R^n (or: the Chocolate Ice-Cream Problem) 1996 15 GEOMETRY Zong, The Kissing Numbers of Tetrahedra 1996 15 GEOMETRY de Loera, Nonregular Triangulations of Products of Simplices 1996 15 GEOMETRY van Kreveld & Snoeying & Whitesides, Folding Rulers Inside Triangles 1996 15 GEOMETRY Terai & Hibi, Computation of Betti Numbers of Monomial Ideals Associated with Cyclic Polytopes 1996 15 GEOMETRY Werner, The Illumination Bodies of a Simplex 1996 15 GEOMETRY Edelman & Reiner, Free Arrangements and Rhombic Tilings 1996 15 GEOMETRY Cantwell, Edge-Ramsey Theory 1996 15 GEOMETRY Pulapaka & Vince, Nonrevisiting Paths on Surfaces 1996 15 GEOMETRY Gunzel, The Universal Partition Theorem for Oriented Matroids 1996 15 GEOMETRY Ramos, Equipartition of Mass Distributions by Hyperplanes 1996 15 GEOMETRY Tan, An Optimal Bound for High-Quality Conforming Triangulations 1996 15 GEOMETRY Kupitz & Perles, Extremal Theory for Convex Matchings in Convex Geometric Graphs 1996 15 GEOMETRY Nischke & Danzer, A Construction of Inflation Rules Based on n-Fold Symmetry 1996 15 GEOMETRY Agarwal & Schwarzkopf & Sharir, The Overlay of Lower Envelopes and Its Applications 1996 15 GEOMETRY Penne, Yang-Baxter Invariants for Line Configurations 1996 15 GEOMETRY de Berg & Guibas & Halperin, Vertical Decompositions for Triangles in 3-Space 1996 15 GEOMETRY Boltyanski & Martini & Soltan, Star-Shaped Sets in Normed Spaces 1996 15 GEOMETRY McAllister & Kirkpatrick & Snoeyink, A Compact Piecewise-Linear Voronoi Diagram for Convex Sites in the Plane 1996 15 GEOMETRY Bandelt & Chepoi, Embedding Metric Spaces in the Rectilinear Plane: a Six-Point Criterion 1995 14 GEOMETRY Matousek, On Geometric Optimization with Few Violated Constraints 1995 14 GEOMETRY Halperin & Sharir, Almost Tight Upper Bounds for the Single Cell and Zone Problems in Three Dimensions 1995 14 GEOMETRY Bern & Mitchell & Ruppert, Linear-Size Nonobtuse Triangulation of Polygons 1995 14 GEOMETRY Chazelle & Shouraboura, Bounds on the Size of Tetrahedralizations 1995 14 GEOMETRY Goodrich, Efficient Piecewise-Linear Function Approximation Using the Uniform Metric 1995 14 GEOMETRY Bronnimann & Goodrich, Almost Optimal Set Covers in Finite VC-Dimension 1995 14 GEOMETRY Sloane & Hardin & Duff & Conway, Minimal-Energy Clusters of Hard Spheres 1995 14 GEOMETRY de Berg & Dobrindt & Schwarzkopf, On Lazy Randomized Incremental Construction 1995 14 GEOMETRY Kincses, On Polytopes Cut by Flats 1995 14 GEOMETRY Prabhu, Facet-Reducing Cuts of a Convex Polytope 1995 14 GEOMETRY Prabhu, Hamiltonian Simple Polytopes 1995 14 GEOMETRY Hetyei, On the Stanley Ring of a Cubical Complex 1995 14 GEOMETRY Abello & Egecioglu & Kumar, Visibility Graphs of Staircase Polygons and the Weak Bruhat Order, I: from Visibility Graphs to Maximal Chains 1995 14 GEOMETRY Lagarias & Moews, Acknowledgment of Priority Concerning: Polytopes that Fill R^n and Scissors Congruence 1995 14 GEOMETRY Guibas & Halperin & Matousek & Sharir, Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions 1995 14 GEOMETRY He & Schramm, Hyperbolic and Parabolic Packings 1995 14 GEOMETRY Robins & Salowe, Low-Degree Minimum Spanning Trees 1995 14 GEOMETRY Boyvalenkov, Extremal Polynomials for Obtaining Bounds for Spherical Codes and Designs 1995 14 GEOMETRY Garcia & Tejel, The Order of Points on the Second Convex Hull of a Simple Polygon 1995 14 GEOMETRY Saldanha & Tomei & Casarin & Romualdo, Spaces of Domino Tilings 1995 14 GEOMETRY Toth, Densest Packings of Typical Convex Sets Are Not Lattice-Like 1995 14 GEOMETRY de Berg & Matousek & Schwarzkopf, Piecewise Linear Paths Among Convex Obstacles 1995 14 GEOMETRY Thang, Local Rules for Pentagonal Quasi-Crystals 1995 14 GEOMETRY Gabrielov & Vorobjov, Complexity of Stratifications of Semi-Pfaffian Sets 1995 14 GEOMETRY Dey & Schipper, A New Technique To Compute Polygonal Schema for 2-Manifolds with Application to Null-Homotopy Detection 1995 13 GEOMETRY Alon & Kalai, Bounding the Piercing Number 1995 13 GEOMETRY Arkin & Halperin & Kedem & Mitchell & Naor, Arrangements of Segments that Share Endpoints: Single Face Results 1995 13 GEOMETRY Ball, Mahler's Conjecture and Wavelets 1995 13 GEOMETRY Barany, The Limit Shape of Convex Lattice Polygons 1995 13 GEOMETRY Betke & Henk & Wills, Sausages Are Good Packings 1995 13 GEOMETRY Bezdek & Bezdek & Connelly, Finite and Uniform Stability of Sphere Coverings 1995 13 GEOMETRY Blind & Blind, The Cubical d-Polytopes with Fewer than 2^{d+1} Vertices 1995 13 GEOMETRY Bokowski & Schuchert, Equifacetted 3-Spheres as Topes of Nonpolytopal Matroid Polytopes 1995 13 GEOMETRY Chazelle & Matousek & Sharir, An Elementary Approach to Lower Bounds in Geometric Discrepancy 1995 13 GEOMETRY Conway & Sloane, What Are All the Best Sphere Packings in Low Dimensions? 1995 13 GEOMETRY Dolbilin, The Countability of a Tiling Family and the Periodicity of a Tiling 1995 13 GEOMETRY Edelsbrunner, The Union of Balls and Its Dual Shape 1995 13 GEOMETRY Erdos & Purdy, Two Combinatorial Problems in the Plane 1995 13 GEOMETRY Toth, Covering the Plane with Two Kinds of Circles 1995 13 GEOMETRY de Fraysseix & de Mendez & Pach, A Left-First Search Algorithm for Planar Graphs 1995 13 GEOMETRY Goodman & Pollack & Wenger, On the Connected Components of the Space of Line Transversals to a Family of Convex Sets 1995 13 GEOMETRY Gritzmann & Klee & Larman, Largest j-Simplices in n-Polytopes 1995 13 GEOMETRY Gruber, A Helmholtz-Lie Type Characterization of Ellipsoids, I 1995 13 GEOMETRY Heppes, On Surface-Minimizing Polyhedral Decompositions 1995 13 GEOMETRY Kannan & Lovasz & Simonovits, Isoperimetric Problems for Convex Bodies and a Localization Lemma 1995 13 GEOMETRY Kuperberg, Knotted Lattice-Like Space Fillers 1995 13 GEOMETRY Laczkovich & Szekeres, Tilings of the Square with Similar Rectangles 1995 13 GEOMETRY Lagarias & Moews, Polytopes that Fill R^n and Scissors Congruence 1995 13 GEOMETRY Maehara, Embedding a Polytope in a Lattice 1995 13 GEOMETRY Matousek, Tight Upper Bounds for the Discrepancy of Half-Spaces 1995 13 GEOMETRY Schmitt, Another Space-Filling Trefoil Knot 1995 13 GEOMETRY Schneider, Isoperimetric Inequalities for Infinite Hyperplane Systems 1995 13 GEOMETRY Soltan, On Antipodal and Adjoint Pairs of Points for Two Convex Bodies 1995 13 GEOMETRY Valtr, Probability that n Random Points Are in Convex Position 1995 13 GEOMETRY Laczkovich, Decomposition of Convex Figures into Similar Pieces 1995 13 GEOMETRY Richter & Thomassen, Intersections of Curve System and the Crossing Number of C_5 x C_5 1995 13 GEOMETRY Katoh & Tokuyama & Iwano, On Minimum and Maximum Spanning Trees of Linearly Moving Points 1995 13 GEOMETRY Fine, The Mayer-Vietoris and IC Equations for Convex Polytopes 1995 13 GEOMETRY Barvinok, Problems of Distance Geometry and Convex Properties of Quadratic Maps 1995 13 GEOMETRY Tay, Lower-Bound Theorems for Pseudomanifolds 1995 13 GEOMETRY Banaszczyk, Inequalities for Convex Bodies and Polar Reciprocal Lattices in R^n 1995 13 GEOMETRY Schnell, Successive Minima, Intrinsic Volumes, and Lattice Determinants 1995 13 GEOMETRY Chazelle & Edelsbrunner & Grigni & Guibas & Sharir & Welzl, Improved Bounds on Weak epsilon-Nets for Convex Sets 1995 13 GEOMETRY Nostrand & Schulte, Chiral Polytopes from Hyperbolic Honeycombs 1995 13 GEOMETRY Erickson & Seidel, Better Lower Bounds on Detecting Affine and Spherical Degeneracies 1995 13 GEOMETRY Deza & Onn, Lattice-Free Polytopes and Their Diameter 1995 13 GEOMETRY Bjorling-Sachs & Souvaine, An Efficient Algorithm for Guard Placement in Polygons with Holes 1995 13 GEOMETRY Eppstein, Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions 1995 13 GEOMETRY Lenhart & Whitesides, Reconfiguring Closed Polygonal Chains in Euclidean d-Space 1994 12 GEOMETRY Barany & Heppes, On the Exact Constant in the Quantitative Steinitz Theorem in the Plane 1994 12 GEOMETRY Gartner & Welzl, Vapnik-Chervonenkis Dimension and (Pseudo-)Hyperplane Arrangements 1994 12 GEOMETRY Januszewski & Lassak, On-Line Covering the Unit Cube by Cubes 1994 12 GEOMETRY Elekes, Generalized Breadths, Circular Cantor Sets, and the Least Area UCC 1994 12 GEOMETRY Bujalance & Costa & Gamboa & Lafuente, An Algorithm To Compute Odd Orders and Ramification Indices of Cyclic Actions on Compact Surfaces 1994 12 GEOMETRY Steingrimsson, A Decomposition of 2-Weak Vertex-Packing Polytopes 1994 12 GEOMETRY Amenta, Helly-Type Theorems and Generalized Linear Programming 1994 12 GEOMETRY Aggarwal & Schieber & Tokuyama, Finding a Minimum-Weight k-Link Path in Graphs with the Concave Monge Property and Applications 1994 12 GEOMETRY Dey & Edelsbrunner, Counting Triangle Crossings and Halving Planes 1994 12 GEOMETRY Jadhav & Mukhopadhyay, Computing a Centerpoint of a Finite Planar Set of Points in Linear Time 1994 12 GEOMETRY Halperin & Sharir, New Bounds for Lower Envelopes in Three Dimensions, with Applications to Visibility in Terrains 1994 12 GEOMETRY Sharir, Almost Tight Upper Bounds for Lower Envelopes in Higher Dimensions 1994 12 GEOMETRY Agarwal & Alon & Aronov & Suri, Can Visibility Graphs Be Represented Compactly? 1994 12 GEOMETRY Snoeyink & Stolfi, Objects that Cannot Be Taken Apart with Two Hands 1994 12 GEOMETRY Aronov & Sharir, Castles in the Air Revisited 1994 12 GEOMETRY Flajolet & Lafforgue, Search Costs in Quadtrees and Singularity Perturbation Asymptotics 1994 12 GEOMETRY Agarwal & Sharir, On the Number of Views of Polyhedral Terrains 1994 12 GEOMETRY Zong, An Example Concerning the Translative Kissing Number of a Convex Body 1994 12 GEOMETRY Rajan, Optimality of the Delaunay Triangulation in R^d 1994 12 GEOMETRY Pellegrini, On Lines Missing Polyhedral Sets in 3-Space 1994 12 GEOMETRY Robbins, Areas of Polygons Inscribed in a Circle 1994 12 GEOMETRY Pach & Torocsik, some Geometric Applications of Dilworth's Theorem 1994 12 GEOMETRY Cavicchioli & Ruini, Special Representations for n-Bridge Links 1994 12 GEOMETRY Aronov & Bern & Eppstein, On the Number of Minimal 1-Steiner Trees 1994 12 GEOMETRY Barvinok, Computing the Ehrhart Polynomial of a Convex Lattice Polytope 1994 12 GEOMETRY Brandt & Terao, Free Arrangements and Relation Spaces 1994 12 GEOMETRY Srinivasaraghavan & Mukhopadhyay, A New Necessary Condition for the Vertex Visibility Graphs of Simple Polygons 1994 12 GEOMETRY Kuperberg, On-Line Covering a Cube by a Sequence of Cubes 1994 12 GEOMETRY Kranakis & Pocchiola, Camera Placement in Integer Lattices 1994 12 GEOMETRY Doyle & He & Rodin, The Asymptotic Value of the Circle-Packing Rigidity Constants s_n 1994 11 GEOMETRY Lagarias & Shor, Cube-Tilings of R^n and Nonlinear Codes 1994 11 GEOMETRY Agarwal & Matousek, On Range Searching with Semialgebraic Sets 1994 11 GEOMETRY Campi & Haas & Weil, Approximation of Zonoids by Zonotopes in Fixed Directions 1994 11 GEOMETRY Lo & Matousek & Steiger, Algorithms for Ham-Sandwich Cuts 1994 11 GEOMETRY McMullen & Schulte, Quotients of Polytopes and C-Groups 1994 11 GEOMETRY Chan, On Subdivisions of Simplicial Complexes: Characterizing Local h-Vectors 1994 11 GEOMETRY Barany & Steiger, On the Expected Number of k-Sets 1994 11 GEOMETRY Reif & Tygar & Yoshida, Computability and Complexity of Ray Tracing 1994 11 GEOMETRY Santhanakrishnan & Zelevinsky, Simple Vertices of Maximal Minor Polytopes 1994 11 GEOMETRY Borobia, Mirror Property for Nonsingular Mixed Configurations of Lines and Points in R^3 1994 11 GEOMETRY Eppstein & Erickson, Iterated Nearest Neighbors and Finding Minimal Polytopes 1994 11 GEOMETRY Blind & Blind, Gaps in the Numbers of Vertices of Cubical Polytopes, I 1994 11 GEOMETRY Heintz & Roy & Solerno, Description of the Connected Components of a Semialgebraic Set in Single Exponential Time 1994 11 GEOMETRY Baryshnikov & Vitale, Regular Simplices and Gaussian Samples 1994 11 GEOMETRY Nguyen & Soltan, Lower Bounds for the Numbers of Antipodal Pairs and Strictly Antipodal Pairs of Vertices in a Convex Polytope 1994 11 GEOMETRY Eppstein, Approximating the Minimum Weight Steiner Triangulation 1994 11 GEOMETRY Connelly & Servatius, Higher-Order Rigidity--What Is the Proper Definition? 1994 11 GEOMETRY Lopez, Residual Finiteness of Surface Groups via Tessellations 1994 11 GEOMETRY Soares, Approximating Euclidean Distances by Small Degree Graphs 1994 11 GEOMETRY Valtr, Unit Squares Intersecting All Secants of a Square 1994 11 GEOMETRY Halperin, On the Complexity of a Single Cell in Certain Arrangements of Surfaces Related to Motion Planning 1994 11 GEOMETRY Doyle & He & Rodin, Second Derivatives of Circle Packings and Conformal Mappings 1994 11 GEOMETRY Ikebe & Perles & Tamura & Tokunaga, The Rooted Tree Embedding Problem into Points in the Plane 1994 11 GEOMETRY Seppala, Computation of Period Matrices of Real Algebraic Curves 1994 11 GEOMETRY Mohar, Convex Representations of Maps on the Torus and Other Flat Surfaces 1994 11 GEOMETRY Tay, On the Cayley Factorization of Calotte Conditions 1994 11 GEOMETRY Erdos & Fishburn, A Postscript on Distances in Convex n-Gons 1993 10 GEOMETRY Muder, A New Bound on the Local Density of Sphere Packings 1993 10 GEOMETRY Chazelle, An Optimal Convex Hull Algorithm in Any Fixed Dimension 1993 10 GEOMETRY Ball, The Reverse Isoperimetric Problem for Gaussian Measure 1993 10 GEOMETRY Aronov & Naiman & Pach & Sharir, An Invariant Property of Balls in Arrangements of Hyperplanes 1993 10 GEOMETRY Clarkson, A Bound on Local Minima of Arrangements that Implies the Upper Bound Theorem 1993 10 GEOMETRY Linhart, Arrangements of Oriented Hyperplanes 1993 10 GEOMETRY Park & Shin & Chwa & Woo, On the Number of Guard Edges of a Polygon 1993 10 GEOMETRY Brylawski & Ziegler, Topological Representation of Dual Pairs of Oriented Matroids 1993 10 GEOMETRY Mnev & Ziegler, Combinatorial Models for the Finite-Dimensional Grassmannians 1993 10 GEOMETRY Richter-Gebert, Oriented Matroids with Few Mutations 1993 10 GEOMETRY Mnev & Richter-Gebert, Combinatorial Obstructions to the Lifting of Weaving Diagrams 1993 10 GEOMETRY Ziegler, ``What Is a Complex Matroid?'' 1993 10 GEOMETRY Alon & Azar, On-Line Steiner Trees in the Euclidean Plane 1993 10 GEOMETRY Barvinok, Computing the Volume, Counting Integral Points, and Exponential Sums 1993 10 GEOMETRY Bronnimann & Chazelle & Pach, How Hard Is Half-Space Range Searching? 1993 10 GEOMETRY Matousek, Range Searching with Efficient Hierarchical Cuttings 1993 10 GEOMETRY Chazelle & Edelsbrunner & Guibas & Sharir, Diameter, Width, Closest Line Pair, and Parametric Searching 1993 10 GEOMETRY Edelsbrunner & Tan, An Upper Bound for Conforming Delaunay Triangulations 1993 10 GEOMETRY Matousek & Schwarzkopf, On Ray Shooting in Convex Polytopes 1993 10 GEOMETRY Barvinok, Feasibility Testing for Systems of Real Quadratic Equations 1993 10 GEOMETRY Betke & Henk, Approximating the Volume of Convex Bodies 1993 10 GEOMETRY Sturmfels & Ziegler, Extension Spaces of Oriented Matroids 1993 10 GEOMETRY Bern & Edelsbrunner & Eppstein & Mitchell & Tan, Edge Insertion for Optimal Triangulations 1993 10 GEOMETRY Reinelt, A Note on Small Linear-Ordering Polytopes 1993 10 GEOMETRY Chen, On the Euler Characteristic of Finite Unions of Convex Sets 1993 10 GEOMETRY Korneenko & Metelskij, On Lattice Points in Polyhedral Cross-Sections 1993 10 GEOMETRY Schmerl, Partitioning Euclidean Space 1993 9 GEOMETRY Vucic & Zivaljevic, Note on a Conjecture of Sierksma 1993 9 GEOMETRY Du & Gao & Graham & Liu & Wan, Minimum Steiner Trees in Normed Planes 1993 9 GEOMETRY Goodrich, Constructing Arrangements Optimally in Parallel 1993 9 GEOMETRY Brisson, Representing Geometric Structures in d Dimensions: Topology and Order 1993 9 GEOMETRY Harborth & Kemnitz & Moller, An Upper Bound for the Minimum Diameter of Integral Point Sets 1993 9 GEOMETRY Aronov & Fortune & Wilfong, The Furthest-Site Geodesic Voronoi Diagram 1993 9 GEOMETRY Schulman, An Equipartition of Planar Sets 1993 9 GEOMETRY Huttenlocher & Kedem & Sharir, The Upper Envelope of Voronoi Surfaces and Its Applications 1993 9 GEOMETRY Friedman & Linial, On Convex Body Chasing 1993 9 GEOMETRY Thomas & Rubinstein & Cole, The Steiner Minimal Network for Convex Configurations 1993 9 GEOMETRY Wagner, On a New Method for Constructing Good Point Sets on Spheres 1993 9 GEOMETRY Bourgain & Lindenstrauss, Approximating the Ball by a Minkowski Sum of Segments with Equal Length 1993 9 GEOMETRY Chazelle, Cutting Hyperplanes for Divide-and-Conquer 1993 9 GEOMETRY Jockusch, The Lower and Upper Bound Problems for Cubical Polytopes 1993 9 GEOMETRY Betke & Henk & Wills, Successive-Minima-Type Inequalities 1993 9 GEOMETRY Aronov & Pellegrini & Sharir, On the Zone of a Surface in a Hyperplane Arrangement 1993 9 GEOMETRY Csima & Sawyer, There Exist 6n/13 Ordinary Points 1993 9 GEOMETRY Eckhoff, A Gallai-Type Transversal Problem in the Plane 1993 9 GEOMETRY Toth, Flight in a Packing of Disks 1993 9 GEOMETRY Agarwal & Sharir, Applications of a New Space-Partitioning Technique 1993 9 GEOMETRY Martinov, Classification of Arrangements by the Number of Their Cells 1993 9 GEOMETRY Mulmuley, A Generalization of Dehn-Sommerville Relations to Simple Stratified Spaces 1993 9 GEOMETRY Soltan & Gorpinevich, Minimum Dissection of a Rectilinear Polygon with Arbitrary Holes into Rectangles 1993 9 GEOMETRY Althofer & Das & Dobkin & Joseph & Soares, On Sparse Spanners of Weighted Graphs 1993 9 GEOMETRY Naiman & Wynn, Independent Collections of Translates of Boxes and a Conjecture due to Grunbaum 1992 8 GEOMETRY Kalai, Upper Bounds for the Diameter and Height of Graphs of Convex Polyhedra 1992 8 GEOMETRY Malitz & Malitz, A Bounded Compactness Theorem for L^1-Embeddability of Metric Spaces in the Plane 1992 8 GEOMETRY Erdahl, A Cone of Inhomogeneous Second-Order Polynomials 1992 8 GEOMETRY Gradner & Kallay, Subdivision Algorithms and the Kernel of a Polyhedron 1992 8 GEOMETRY Garrett, Circle Packings and Polyhedral Surfaces 1992 8 GEOMETRY Aronov & O'Rourke, Nonoverlap of the Star Unfolding 1992 8 GEOMETRY Kenyon & Kenyon, How To Take Short Cuts 1992 8 GEOMETRY Monma & Suri, Transitions in Geometric Minimum Spanning Trees 1992 8 GEOMETRY Avis & Fukuda, A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra 1992 8 GEOMETRY Matousek, Efficient Partition Trees 1992 8 GEOMETRY Mulmuley & Sen, Dynamic Point Location in Arrangements of Hyperplanes 1992 8 GEOMETRY Conway & Sloane, On the Covering Multiplicity of Lattices 1992 8 GEOMETRY Djidjev & Lingas & Sack, An O(n log n) Algorithm for Computing the Link Center of a Simple Polygon 1992 8 GEOMETRY Brehm, Nonuniqueness Results for X-Ray Problems with Point Sources 1992 8 GEOMETRY Doyle & Lagarias & Randall, Self-Packing of Centrally Symmetric Convex Bodies in R^2 1992 8 GEOMETRY Pellegrini & Shor, Finding Stabbing Lines in 3-Space 1992 8 GEOMETRY Edelman, On the Average Number of k-Sets 1992 8 GEOMETRY Ammann & Grunbaum & Shephard, Aperiodic Tiles 1992 8 GEOMETRY Boltyanski, A New Step in the solution of the Szokefalvi-Nagy Problem 1992 8 GEOMETRY Boissonnat & Devillers & Schott & Teillaud & Yvinec, Applications of Random Sampling to On-Line Algorithms in Computational Geometry 1992 8 GEOMETRY Snyder, Worst-Case Minimum Rectilinear Steiner Trees in All Dimensions 1992 8 GEOMETRY Altshuler & Brehm, Neighborly Maps with Few Vertices 1992 7 GEOMETRY Kirkpatrick & Klawe & Tarjan, Polygon Triangulation in O(n log log n) Time with Simple Data Structures 1992 7 GEOMETRY Franz & Huson, The Classification of Quasi-Regular Polyhedra of Genus 2 1992 7 GEOMETRY Agarwal & Aronov, Counting Facets and Incidences 1992 7 GEOMETRY Brass, The Maximum Number of Second Smallest Distances in Finite Planar Sets 1992 7 GEOMETRY Di Battista & Tamassia & Tollis, Area Requirement and Symmetry Display of Planar Upward Drawings 1992 7 GEOMETRY Saldanha & Tomei, Spectra of Regular Polytopes 1992 7 GEOMETRY Smid, Maintaining the Minimal Distance of a Point Set in Polylogarithmic Time 1992 7 GEOMETRY Blokhuis & Wilbrink, Alternative Proof of Sine's Theorem on the Size of a Regular Polygon in R^n with the l_infinity-Metric 1992 7 GEOMETRY Affentranger & Schneider, Random Projections of Regular Simplices 1992 7 GEOMETRY Ruppert & Seidel, On the Difficulty of Triangulating Three-Dimensional Nonconvex Polyhedra 1992 7 GEOMETRY Gritzmann & Klee, Inner and Outer j-Radii of Convex Bodies in Finite-Dimensional Normed Spaces 1992 7 GEOMETRY Gardner, X-Rays of Polygons 1992 7 GEOMETRY Kirkpatrick & Mishra & Yap, Quantitative Steinitz's Theorems with Applications to Multifingered Grasping 1992 7 GEOMETRY Zucco, The Generic Contact of Convex Bodies with Circumscribed Homothets of a Convex Surface 1992 7 GEOMETRY Pach & Steiger & Szemeredi, An Upper Bound on the Number of Planar K-Sets 1992 7 GEOMETRY Stehling, Ammann Bars and Quasicrystals 1992 7 GEOMETRY Valtr, Convex Independent Sets and 7-Holes in Restricted Planar Point Sets 1992 7 GEOMETRY Norwood & Poole & Laidacker, The Worm Problem of Leo Moser 1992 7 GEOMETRY Komlos & Pach & Woeginger, Almost Tight Bounds for epsilon-Nets 1992 7 GEOMETRY Kannan & Soroker, Tiling Polygons with Parallelograms 1992 7 GEOMETRY Czyzowicz & Rivera-Campo & Urrutia & Zaks, Separating Convex Sets in the Plane 1992 7 GEOMETRY Katchalski & Lewis & Liu, The Different Ways of Stabbing Disjoint Convex Sets 1992 7 GEOMETRY Goossens, Shelling Pseudopolyhedra 1992 7 GEOMETRY Chung & Szemeredi & Trotter, The Number of Different Distances Determined by a Set of Points in the Euclidean Plane 1992 7 GEOMETRY Keil & Gutwin, Classes of Graphs Which Approximate the complete Euclidean Graph 1992 7 GEOMETRY Heppes, Solid Circle-Packings in the Euclidean Plane 1992 7 GEOMETRY Eppstein & Overmars & Rote & Woeginger, Finimum Area k-gons 1992 7 GEOMETRY Levitt, The Euler Characteristic is the Unique Locally Determined Numerical Homotopy Invariant of Finite Complexes 1992 7 GEOMETRY Kantabutra, Motions of a Short-Linked Robot Arm in a Square 1992 7 GEOMETRY Rubinstein & Thomas, The Steiner Ratio Conjecture for Cocircular Points 1992 7 GEOMETRY Kupitz, On a Generalization of the Gallai-Sylvester Theorem 1991 6 GEOMETRY Schrijver, Disjoint Homotopic Paths and Trees in a Planar Graph 1991 6 GEOMETRY Beauquier & Nivat, On Translating One Polyomino To Tile the Plane 1991 6 GEOMETRY Sharir, On k-Sets in Arrangements of Curves and Surfaces 1991 6 GEOMETRY Matousek, Cutting Hyperplane Arrangements 1991 6 GEOMETRY Agarwal & Edelsbrunner & Schwarzkopf & Welzl, Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs 1991 6 GEOMETRY Seidel, Small-Dimensional Linear Programming and Convex Hulls Made Easy 1991 6 GEOMETRY Aronov & Chazelle & Edelsbrunner & Guibas & Sharir & Wenger, Points and Triangles in the Plane and Halving Planes in Space 1991 6 GEOMETRY Bienstock, Some Provably Hard Crossing Number Problems 1991 6 GEOMETRY Canny & Rege & Reif, An Exact Algorithm for Kinodynamic Planning in the Plane 1991 6 GEOMETRY Chazelle, Triangulating a Simple Polygon in Linear Time 1991 6 GEOMETRY Haiman, A Simple and Relatively Efficient Triangulation of the n-Cube 1991 6 GEOMETRY Affentranger & Wieacker, On the Convex Hull of Uniform Random Points in a Simple d-Polytope 1991 6 GEOMETRY Mulmuley, On Levels in Arrangements and Voronoi Diagrams 1991 6 GEOMETRY Maehara, On Graver's Conjecture Concerning the Rigidity Problem of Graphs 1991 6 GEOMETRY Dwyer, Higher-Dimensional Voronoi Diagrams in Linear Expected Time 1991 6 GEOMETRY Vaidya, A Sparse Graph Almost as Good as the Complete Graph on Points in K Dimensions 1991 6 GEOMETRY Benedetti & Loeser & Risler, Bounding the Number of Connected Components of a Real Algebraic Set 1991 6 GEOMETRY Mehlhorn & Meiser & O'Dunlaing, On the Construction of Abstract Voronoi Diagrams 1991 6 GEOMETRY Taylor, On the Global Structure of Crystalline Surfaces 1991 6 GEOMETRY Nackman & Srinivasan, Bisectors of Linearly Separable Sets 1991 6 GEOMETRY Bezdek & Kuperberg & Makai, Maximum Density Space Packing with Parallel Strings of Spheres 1991 6 GEOMETRY Furedi, The Densest Packing of Equal Circles into a Parallel Strip 1991 6 GEOMETRY Billera & Rose, A Dimension Series for Multivariate Splines 1991 6 GEOMETRY Matousek, Lower Bounds on the Length of Monotone Paths in Arrangements 1991 6 GEOMETRY Adams & Sherman, Minimum Ideal Triangulations of Hyperbolic 3-Manifolds 1991 6 GEOMETRY Kopperman & Meyer & Wilson, A Jordon Surface Theorem for Three-Dimensional Digital Spaces 1991 6 GEOMETRY Stengle, Constraints on the Angular Distribution of the Zeros of a Polynomial of Low Complexity 1991 6 GEOMETRY Zamfirescu, On Two Conjectures of Franz Hering About Convex Surfaces 1991 6 GEOMETRY Schmitt, Disks with Special Properties of Densest Packings 1991 6 GEOMETRY Lassak & Zhang, An On-Line Potato-Sack Theorem 1991 6 GEOMETRY Chin & Ntafos, Shortest Watchman Routes in Simple Polygons 1991 6 GEOMETRY Bayer & Klapper, A New Index for Polytopes 1991 6 GEOMETRY Houle, Theorems on the Existence of Separating Surfaces 1991 6 GEOMETRY Maehara, Dispersed Points and Geometric Embedding of Complete Bipartite Graphs 1991 6 GEOMETRY Booth, Analytic Formulas for Full Steiner Trees 1991 6 GEOMETRY Martini, Convex Polytopes Whose Projection Bodies and Difference Sets are Polars 1990 5 GEOMETRY Kos & Torocsik, Convex Disks Can Cover Their Shadow 1990 5 GEOMETRY Agarwal, Partitioning Arrangements of Lines, II: Applications 1990 5 GEOMETRY Dillencourt, Toughness and Delaunay Triangulations 1990 5 GEOMETRY Barnette, W_V Paths on the Torus 1990 5 GEOMETRY Matousek, Construction of epsilon-Nets 1990 5 GEOMETRY Agarwal, Partitioning Arrangements of Lines, I: An Efficient Deterministic Algorithm 1990 5 GEOMETRY Paterson & Yao, Efficient Binary Space Partitions for Hidden-Surface Removal and Solid Modeling 1990 5 GEOMETRY Chazelle & Palios, Triangulating a Nonconvex Polytope 1990 5 GEOMETRY Erdos & Komjath, Countable Decompositions of R^2 and R^3 1990 5 GEOMETRY Bokowski & Richter & Sturmfels, Nonrealizability Proofs in Computational Geometry 1990 5 GEOMETRY Du & Kleitman, Diameter and Radius in the Manhattan Metric 1990 5 GEOMETRY Groemer, On Convex Bodies that Permit Packings of High Density 1990 5 GEOMETRY Frederickson & Rodger, A New Approach to the Dynamic Maintenance of Maximal Points in a Plane 1990 5 GEOMETRY Barany & Larman, A Combinatorial Property of Points and Ellipsoids 1990 5 GEOMETRY Wenger, A Generalization of Hadwiger's Transversal Theorem to Intersecting Sets 1990 5 GEOMETRY Kuperberg & Kuperberg, Double-Lattice Packings of Convex Bodies in the Plane 1990 5 GEOMETRY Dobkin & Friedman & Supowit, Delaunay Graphs Are Almost as Good as Complete Graphs 1990 5 GEOMETRY Abrahamson, On the Modality of Convex Polygons 1990 5 GEOMETRY Khachiyan, An Inequality for the Volume of Inscribed Ellipsoids 1990 5 GEOMETRY Bianchi & Longinetti, Reconstructing Plane Sets from Projections 1990 5 GEOMETRY Aurenhammer, A New Duality Result Concerning Voronoi Diagrams 1990 5 GEOMETRY Gretenkort & Kleinschmidt & Sturmfels, On the Existence of Certain Smooth Toric Varieties 1990 5 GEOMETRY Bjorner & Edelman & Ziegler, Hyperplane Arrangements with a Lattice of Regions 1990 5 GEOMETRY Rappaport & Imai & Toussaint, Computing Simple Circuits from a Set of Line Segments 1990 5 GEOMETRY Filliman, Exterior Algebra and Projections of Polytopes 1990 5 GEOMETRY Clarkson & Edelsbrunner & Guibas & Sharir & Welzl, Combinatorial Complexity Bounds for Arrangements of Curves and Spheres 1990 5 GEOMETRY Edelsbrunner & Guibas & Sharir, The Complexity and Construction of Many Faces in Arrangements of Lines and Segments 1990 5 GEOMETRY Edelsbrunner & Guibas & Sharir, The Complexity of Many Cells in Arrangements of Planes and Related Problems 1990 5 GEOMETRY Graham & Sloane, Penny-Packing and Two-Dimensional Codes 1990 5 GEOMETRY Klee & Kleinschmidt, Geometry of the Gass-Saaty Parametric Cost LP Algorithm 1990 5 GEOMETRY Wenger, Upper Bounds on Geometric Permutations for Convex Sets 1990 5 GEOMETRY Edelsbrunner & Sharir, The Maximum Number of Ways To Stab n Convex Nonintersecting Sets in the Plane Is 2n - 2 1990 5 GEOMETRY Kedem & Sharir, An Efficient Motion-Planning Algorithm for a Convex Polygonal Object in Two-Dimensional Polygonal Space 1990 5 GEOMETRY Kern & Wanka, On a Problem About Covering Lines by Squares 1990 5 GEOMETRY Kung, Combinatorial Geometries Representable over GF(3) and GF(q). I. The Number of Points 1989 4 GEOMETRY Erdos & Lovasz & Vesztergombi, On the Graph of Large Distances 1989 4 GEOMETRY Chazelle & Guibas, Visibility and Intersection Problems in Plane Geometry 1989 4 GEOMETRY Bokowski, A Geometric Realization Without Self-Intersections Does Exist for Dyck's Regular Map 1989 4 GEOMETRY Aggarwal & Guibas & Saxe & Shor, A Linear-Time Algorithm for Computing the Voronoi Diagram of a Convex Polygon 1989 4 GEOMETRY Megiddo, On the Ball Spanned by Balls 1989 4 GEOMETRY Pollack & Sharir & Rote, Computing the Geodesic Center of a Simple Polygon 1989 4 GEOMETRY Gritzmann & Lassak, Estimates for the Minimal Width of Polytopes Inscribed in Convex Bodies 1989 4 GEOMETRY Clarkson & Shor, Applications of Random Sampling in Computational Geometry, II 1989 4 GEOMETRY Clarkson & Tarjan & Van Wyk, A Fast Las Vegas Algorithm for Triangulating a Simple Polygon 1989 4 GEOMETRY Edelsbrunner & Guibas & Hershberger & Seidel & Sharir & Snoeyink & Welzl, Implicitly Representing Arrangements of Lines or Segments 1989 4 GEOMETRY Chazelle & Welzl, Quasi-Optimal Range Searching in Spaces of Finite VC-Dimension 1989 4 GEOMETRY Guibas & Sharir & Sifrony, On the General Motion-Planning Problem with Two Degrees of Freedom 1989 4 GEOMETRY Edelsbrunner & Guibas & Hershberger & Pach & Pollack & Seidel & Sharir & Snoeyink, On Arrangements of Jordan Arcs with Three Intersections per Pair 1989 4 GEOMETRY Alon & Erdos, Disjoint Edges in Geometric Graphs 1989 4 GEOMETRY Pach & Sharir, The Upper Envelope of Piecewise Linear Functions and the Boundary of a Region Enclosed by Convex Plates: Combinatorial Analysis 1989 4 GEOMETRY Edelsbrunner & Guibas & Sharir, The Upper Envelope of Piecewise Linear Functions: Algorithms and Applications 1989 4 GEOMETRY Edelsbrunner, The Upper Envelope of Piecewise Linear Functions: Tight Bounds on the Number of Faces 1989 4 GEOMETRY Boros & Furedi & Kelly, On Representing Sylvester-Gallai Designs 1989 4 GEOMETRY Reiterman & Rodl & Sinajova, Embeddings of Graphs in Euclidean Spaces 1989 4 GEOMETRY Bloch, Complexes Whose Boundaries Cannot Be Pushed Around 1989 4 GEOMETRY Kasimatis, Dissections of Regular Polygons into Triangles of Equal Areas 1989 4 GEOMETRY Tverberg, Proof of Grunbaum's Conjecture on Common Transversals for Translates 1989 4 GEOMETRY Kolzow & Kuba & Volcic, An Algorithm for Reconstructing Convex Bodies from Their Projections 1989 4 GEOMETRY Alon & Katchalski & Pulleyblank, Cutting Disjoint Disks by Straight Lines 1989 4 GEOMETRY Alon & Katchalski & Pulleyblank, The Maximum Size of a Convex Polygon in a Restricted Set of Points in the Plane 1989 4 GEOMETRY Hayward & Rappaport & Wenger, Some Extremal Results on Circles Containing Points 1989 4 GEOMETRY Barany & Schmerl & Sidney & Urrutia, A Combinatorial Result About Points and Balls in Euclidean Space 1989 4 GEOMETRY Hayward, A Note on the Circle Containment Problem 1989 4 GEOMETRY Toussaint, On Separating Two Simple Polygons by a Single Translation 1989 4 GEOMETRY Maehara, Helly-Type Theorems for Spheres 1989 4 GEOMETRY Jaggi & Mani-Levitska & Sturmfels & White, Uniform Oriented Matroids Without the Isotopy Property 1989 4 GEOMETRY Vaidya, An O(n log n) Algorithm for the All-Nearest-Neighbors Problem 1989 4 GEOMETRY Katz, Diameter-Extremal Subsets of Spheres 1989 4 GEOMETRY Chazelle & Edelsbrunner & Guibas, The Complexity of Cutting Complexes 1989 4 GEOMETRY Chung, Sphere-and-Point Incidence Relations in High Dimensions with Applications to Unit Distances and Furthest-Neighbor Pairs 1988 3 GEOMETRY Ke & O'Rourke, Lower Bounds on Moving a Ladder in Two and Three Dimensions 1988 3 GEOMETRY Canny & Donald, Simplified Voronoi Diagrams 1988 3 GEOMETRY Alt & Mehlhorn & Wagener & Welzl, Congruence, Similarity, and Symmetries of Geometric Objects 1988 3 GEOMETRY Avis & Wenger, Polyhedral Line Transversals in Space 1988 3 GEOMETRY Kirkpatrick, Establishing Order in Planar Subdivisions 1988 3 GEOMETRY Lenhart & Pollack & Sack & Seidel & Sharir & Suri & Toussaint & Whitesides & Yap, Computing the Link Center of a Simple Polygon 1988 3 GEOMETRY Pollack & Sharir & Sifrony, Separating Two Simple Polygons by a Sequence of Translations 1988 3 GEOMETRY Baker & Grosse & Rafferty, Nonobtuse Triangulation of Polygons 1988 3 GEOMETRY Bajaj, The Algebraic Degree of Geometric Optimization Problems 1988 3 GEOMETRY Kalai, Many Triangulated Spheres 1988 3 GEOMETRY Wiernik & Sharir, Planar Realizations of Nonlinear Davenport-Schinzel Sequences by Segments 1988 3 GEOMETRY Ewald, On the Classification of Toric Fano Varieties 1988 3 GEOMETRY Senechal, Tiling the Torus and Other Space Forms 1988 3 GEOMETRY Purdy, Repeated Angles in E_4 1988 3 GEOMETRY Deneen & Shute, Polygonizations of Point Sets in the Plane 1988 3 GEOMETRY Frankl & Maehara, On the Contact Dimensions of Graphs 1987 2 GEOMETRY Barany & Furedi, Computing the Volume is Difficult 1987 2 GEOMETRY Hayward, A Lower Bound for the Optimal Crossing-Free Hamiltonian Cycle Problem 1987 2 GEOMETRY Freedman, A Power Law for the Distortion of Planar Sets 1987 2 GEOMETRY Toth, Finite Coverings by Translates of Centrally Symmetric Convex Domains 1987 2 GEOMETRY Yap, An O(n log n) Algorithm for the Voronoi Diagram of a Set of Simple Curve Segments 1987 2 GEOMETRY Sallee, Invertible Relations on Polytopes 1987 2 GEOMETRY Du & Hwang & Song & Ting, Steiner Minimal Trees on Sets of Four Points 1987 2 GEOMETRY Schneider, Tessellations Generated by Hyperplanes 1987 2 GEOMETRY Barnette, Generating Closed 2-Cell Embeddings in the Torus and the Projective Plane 1987 2 GEOMETRY Jamison, Direction Trees 1987 2 GEOMETRY Leven & Sharir, On the Number of Critical Free Contacts of a Convex Polygonal Object Moving in Two-Dimensional Polygonal Space 1987 2 GEOMETRY Schmitt, sigma-Morphic Sets of Prototiles 1987 2 GEOMETRY Billera & Magurn, Balanced Subdivision and Enumeration in Balanced Spheres 1987 2 GEOMETRY Kahn, On Lattices with Moebius Function +/- 1, 0 1987 2 GEOMETRY Leven & Sharir, Planning a Purely Translational Motion for a Convex Object in Two-Dimensional Space Using Generalized Voronoi Diagrams 1987 2 GEOMETRY Szabo, A Reduction of Lattice Tiling by Translates of a Cubical Cluster 1987 2 GEOMETRY Kolinek, A Polynomial-Time Linear Decision Tree for the Traveling Salesman Problem and Other NP-Complete Problems 1987 2 GEOMETRY Aurenhammer, A Criterion for the Affine Equivalence of Cell Complexes in R^d and Convex Polyhedra in R^{d+1} 1987 2 GEOMETRY Du & Hwang & Weng, Steiner Minimal Trees for Regular Polygons 1987 2 GEOMETRY Buchta, On Nonnegative Solutions of Random Systems of Linear Inequalities 1986 1 GEOMETRY Elekes, A Geometric Inequality and the Complexity of Computing Volume 1986 1 GEOMETRY Bokowski & Sturmfels, On the Coordinatization of Oriented Matroids 1986 1 GEOMETRY Toth, Densest Packing of Translates of the Union of Two Circles 1986 1 GEOMETRY Furedi, Random Polytopes in the d-Dimensional Cube 1986 1 GEOMETRY Tamassia & Tollis, A Unified Approach to Visibility Representations of Planar Graphs 1986 1 GEOMETRY Rosenstiehl & Tarjan, Rectilinear Planar Layouts and Bipolar Orientations of Planar Graphs 1986 1 GEOMETRY Altshuler & Brehm, The Weakly Neighborly Polyhedral Maps on the 2-Manifold with Euler Characteristic -1 1986 1 GEOMETRY Katchalski & Lewis & Liu, Geometric Permutations and Common Transversals 1986 1 GEOMETRY Deza & Frankl, On Squashed Designs 1986 1 GEOMETRY Wills, On Polyhedra with Transitivity Properties 1986 1 GEOMETRY Lee & Lin, Generalized Delaunay Triangulation for Planar Graphs 1986 1 GEOMETRY Goodman & Pollack, Upper Bounds for Configurations and Polytopes in R^d 1986 1 GEOMETRY Hoffman & Lee, On the Cone of Nonnegative Circuits 1986 1 GEOMETRY Florian, Approximation of Convex Discs by Polygons 1986 1 GEOMETRY Avis, Diameter Partitioning 1986 1 GEOMETRY Cordovil & Dilao & da Costa, Periodic Orbits for Additive Cellular Automata 1986 1 GEOMETRY Kelly, A Resolution of the Sylvester-Gallai Problem of J.-P. Serre 1986 1 GEOMETRY O'Rourke & Kosaraju & Megiddo, Computing Circular Separability 1986 1 GEOMETRY Ewald, Spherical Complexes and Nonprojective Toric Varieties 1986 1 GEOMETRY Hobby, Smooth, Easy to Compute Interpolating Splines 1986 1 GEOMETRY Schulte & Wills, Geometric Realizations for Dyck's Regular Map on a Surface of Genus 3 1986 1 GEOMETRY Chang & Yap, A Polynomial Solution for the Potato-peeling Problem 1986 1 GEOMETRY Groemer, Some Basic Properties of Packing and Covering Constants 1986 1 GEOMETRY Alon & Kleitman, Covering a Square by Small Perimeter Rectangles 1986 1 GEOMETRY Chazelle & Preparata, Halfspace Range Search: An Algorithmic Application of k-Sets 1986 1 GEOMETRY Debrunner & Mani-Levitska, Can You Cover Your Shadows? 1986 1 GEOMETRY Edelsbrunner & Seidel, Voronoi Diagrams and Arrangements 1986 1 GEOMETRY Kedem & Livne & Pach & Sharir, On the Union of Jordan Regions and Collision-Free Translational Motion Amidst Polygonal Obstacles 1986 1 GEOMETRY Pach, Covering the Plane with Convex Polygons 1986 1 GEOMETRY Stanley, Two Poset Polytopes 1986 1 GEOMETRY Welzl, More on k-Sets of Finite Sets in the Plane 1986 3 GGRAMS Ehrig, Tutorial Introduction to the Algebraic Approach of Graph-Grammars 1986 3 GGRAMS Habel & Kreowski, May We Introduce to You: Hyperedge Replacement 1986 3 GGRAMS Lendenmayer, An Introduction to Parallel Map Generating Systems 1986 3 GGRAMS Nagl, Set Theoretic Approaches to Graph-Grammars 1986 3 GGRAMS Rozenberg, An Introduction to the NLC Way of Rewriting Graphs 1986 3 GGRAMS Rosenfeld, Array Grammars 1983 6 GITCS Constable, Partial Functions in Constructive Formal Theories 1983 6 GITCS Schnorr, Monte-Carlo Factoring Algorithm with Finite Storage 1983 6 GITCS Papadimitriou, Theory of Concurrency Control 1983 6 GITCS Barth, Interprocedural Data Flow Systems 1983 6 GITCS Becker, On the Crossing-free, Rectangular Embedding of Weighted Graphs in the Plane 1983 6 GITCS Best & Merceron, Discreteness, k-Density and d-Continuity of Occurrence Nets 1983 6 GITCS Book & Long & Selman, Controlled Relativizations of P and NP 1983 6 GITCS Brandenburg, The Computational Complexity of Certain Graph Grammars 1983 6 GITCS Eick & Fehr, Inconsistencies of Pure LISP 1983 6 GITCS Finkel & Memmi, Fifo Nets: A New Model of Parallel Computation 1983 6 GITCS Gire, Une Extension aux Mots Infinis de la Notion de Transduction Rationelle 1983 6 GITCS Gogolla & Drosten & Lipeck & Ehrich, Algebraic and Operational Semantics of Exceptions and Errors 1983 6 GITCS Kemp, The Expected Number of Nodes and Leaves at Level k in Ordered Trees 1983 6 GITCS Kreitz & Weihrauch, Complexity Theory on Real Numbers and Functions 1983 6 GITCS Kunde, A Multifit Algorithm for Uniform Multiprocessor Scheduling 1983 6 GITCS Lieberherr & Vavasis, Analysis of Polynomial Approximation Algorithms for Constraint Expressions 1983 6 GITCS Lingas, Heuristics for Minimum Edge Length Rectangular Partitions of Rectilinear Figures 1983 6 GITCS Makowsky & Mahr, An Axiomatic Approach to Semantics of Specification Languages 1983 6 GITCS Meyer auf der Heide, Efficiency of Universal Parallel Computers 1983 6 GITCS Muldner & Kreczmar, Coroutines and Processes in Block Structured Languages 1983 6 GITCS Nijholt & Pittl, A General Scheme for Some Deterministically Parsable Grammars and their Strong Equivalents 1983 6 GITCS Nipkow & Weikum, A Decidability Result about Sufficient-Completeness of Axiomatically Specified Abstract Data Types 1983 6 GITCS Papadimitriou & Zachos, Two Remarks on the Power of Counting 1983 6 GITCS Pin & Sakarovitch, Some Operations and Transductions that Preserve Rationality 1983 6 GITCS Poigne, On Algebras of Computation Sequences and Proofs of Equivalence of Operational and Denotational Semantics 1983 6 GITCS Seebold, Sur les Morphismes qui Engendrent des Mots Infinis ayant des Facteurs Prescrits 1983 6 GITCS Senizergues, The Equivalence Problem for N. T. S. Languages is Decidable 1983 6 GITCS Sieber, Weakest Expressible Preconditions: A New Tool for Proving Completeness Results about Hoare Calculi 1983 6 GITCS Thomas, A Hierarchy of Sets of Infinite Trees 1983 6 GITCS Tsakalidis, Maintaining Order in a Generalized Linked List 1983 6 GITCS Wijshoff & van Leeuwen, Periodic versus Arbitrary Tessellations of the Plane Using Polyominos of a Single Type 1981 5 GITCS Ehrenfeucht & Rozenberg, On the Subword Complexity and Square-freeness of Formal Languages 1981 5 GITCS Kuich, Cycle-free N-Algebraic Systems 1981 5 GITCS Brandenburg, On the Height of Syntactical Graphs 1981 5 GITCS Wegener, Boolean Functions Whose Monotone Complexity is of Size n^2/log n 1981 5 GITCS Sattler, Netzwerke zur Simultanen Berechnung Boolescher Funktionen 1981 5 GITCS Avenhaus & Madlener, P-Complete Problems in Free Groups 1981 5 GITCS Latteux, Quelques Proprietes des Langages a un Compteur 1981 5 GITCS Autebert, Un Resultat de Discontinuite dans les Familles de Langages 1981 5 GITCS Keklikoglou, Verallgemeinerte Kommutative Sprachen 1981 5 GITCS Hotz, Ein Rein Automatentheoretischer Aufbau der Theorie der Kontext-freien Sprachen 1981 5 GITCS Pin, Un Analogue du Theoreme des Varietes pour les Cones et les Cylindres 1981 5 GITCS Schnitger, A Family of Graphs with Expensive Depth-Reduction 1981 5 GITCS Olivie, On alpha-Balanced Binary Search Trees 1981 5 GITCS Guttler, Erzeugung Optimalen Codes fur Series-Parallel Graphs 1981 5 GITCS Hopcroft, Recent Directions in Algorithmic Research 1981 5 GITCS Guting & Kriegel, Dynamic k-Dimensional Multiway Search under Time-varying Access Frequencies 1981 5 GITCS Boasson, Some Applications of CFL's over Infinite Alphabets 1981 5 GITCS Pansiot, A Decidable Property of Iterated Morphisms 1981 5 GITCS Choffrut, Prefix-Preservation for Rational Partial Functions is Decidable 1981 5 GITCS Park, Concurrency and Automata on Infinite Sequences 1981 5 GITCS Josko, An Effective Retract Calculus 1981 5 GITCS Weihrauch, Recursion and Complexity Theory on CPO-S 1981 5 GITCS Klaeren & Schulz, Computable Algebras, Word Problems and Canonical Term Algebras 1981 5 GITCS Muller, Reachability Analysis with Assertion Systems 1981 5 GITCS Overmars & van Leeuwen, Dynamization of Decomposable Searching Problems Yielding Good Worst-case Bounds 1981 5 GITCS Huddleston & Mehlhorn, Robust Balancing in B-Trees 1981 5 GITCS Boasson & Nivat, Centers of Languages 1981 5 GITCS Book & Jantzen & Wrathall, (Erasing)* Strings 1977 3 GITCS Paterson, New Bounds on Formula Size 1989 1 GLAKES Manning, Computational Complexity of Geometric Symmetry Detection in Graphs 1989 1 GLAKES Samal, Performance of Parallel Consistency Algorithms 1989 1 GLAKES Ahmed & Yeh, A Note on Conway's Parallel Sorting Algorithm 1989 1 GLAKES Perl & Mehta, Cascading LZW Algorithm with Huffman Coding: A Variable to Variable Length Compression Algorithm 1989 1 GLAKES Zheng, A Simple and Powerful Representation of Binary Search Trees 1989 1 GLAKES Magliveras & Memon, Random Permutations from Logarithmic Signatures 1989 1 GLAKES Lewis & Van Cleave, Correct and Provably Efficient Methods for Rectilinear Steiner Spanning Tree Generation 1989 1 GLAKES Sanders, Teaching the Spirit of Computational Science 1994 GLOBALSTDS Chandy & Lamport, Distributed Snapshots: Determining Global States of Distributed Systems 1994 GLOBALSTDS Spezialetti & Kearns, Efficient Distributed Snapshots 1994 GLOBALSTDS Lai & Yang, On Distributed Snapshots 1994 GLOBALSTDS Mattern, Efficient Algorithms for Distributed Snapshots and Global Virtual Time Approximation 1994 GLOBALSTDS Cooper & Marzullo, Consistent Detection of Global Predicates 1994 GLOBALSTDS Garg & Waldecker, Detection of Weak Unstable Predicates in Distributed Programs 1994 GLOBALSTDS Lamport & Melliar-Smith, Synchronizing Clocks in the Presence of Faults 1994 GLOBALSTDS Cristian & Aghili & Strong, Clock Synchronization in the Presence of Omission and Performance Failures, and Processor Joins 1994 GLOBALSTDS Olson & Shin, Probabilistic Clock Synchronization in Large Distributed Systems 1994 GLOBALSTDS Kopetz & Ochsenreiter, Clock Synchronization in Distributed Real-Time Systems 1994 GLOBALSTDS Mills, Internet Time Synchronization: The Network Time Protocol 1994 GLOBALSTDS Liskov, Practical Uses of Synchronized Clocks in Distributed Systems 1994 GLOBALSTDS Morgan, Global and Logical Time in Distributed Algorithms 1994 GLOBALSTDS Lamport, Time, Clocks, and the Ordering of Events in a Distributed System 1994 GLOBALSTDS Mattern, Virtual Time and Global States of Distributed Systems 1994 GLOBALSTDS Fidge, Logical Time in Distributed Computing Systems 1994 4 GLSV Shankar & Bhatia, Generalized Segmented Channel Routing 1994 4 GLSV Wu & Tsukiyama & Marek-Sadowska, On Computational Complexity of a Detailed Routing Problem in Two-Dimensional FPGAs 1994 4 GLSV Chowdhary & Bhatia & Tragoudas, Mathematical Model for Routability Analysis of FPGAs 1994 4 GLSV Danda & Madhwapathy & Panyam & Sherwani, An Optimal Algorithm for the Maximum Two Planar Subset Problem 1994 4 GLSV Ganley & Cohoon, A Faster Dynamic Programming Algorithm For Exact Rectilinear Steiner Minimal Trees 1994 4 GLSV Tragoudas, An Improved Algorithm for the Generalized Min-Cut Partitioning Problem 1994 4 GLSV Bahar & Hachtel & Macii & Pardo & Poncino & Somenzi, An ADD-Based Algorithm for Shortest Path Back-Tracing of Large Graphs 1994 4 GLSV Yu & Sechen, Generation of Color-Constrained Spanning Trees with Application in Symbolic Circuit Analysis 1985 GORDONBREACH Kuznetsov & Adel'son-Velskii, Discrete Mathematics for Engineers 1990 GRAPHCOL Toft, 75 Graph-Colouring Problems 1990 GRAPHCOL Holroyd & Loupekine, The Four Colour Problem Is Not Dead 1990 GRAPHCOL Woodall, Improper Colourings of Graphs 1990 GRAPHCOL Chetwynd, Total Colourings of Graphs 1990 GRAPHCOL McDiarmid, Colourings of Random Graphs 1990 GRAPHCOL Biggs, Some Heuristics for Graph Colouring 1990 GRAPHCOL Jaeger, Graph Colourings and Link Invariants 1990 GRAPHCOL Wilson, Line-distinguishing and Harmonious Colourings 1990 GRAPHCOL Hilton & Johnson, A Variation of Ryser's Theorem and a Necessary Condition for the List-Colouring Problem 1996 GREENWD Pritchard & Scott, Literature Searching in Science, Technology, and Agriculture, Revised Edition 1996 GREENWD Cortada, Second Bibliographic Guide to the History of Computing, Computers, and the Information Processing Industry 1996 GREENWD Cortada, A Bibliographic Guide to the History of Computer Applications, 1950-1990 1989 GTAEW Lovasz & Plummer, Some Recent Results on Graph Matching 1989 GTAEW Ning, On the Star Packing Problem 1989 GTAEW Ordman, Distributed Graph Recognition with Malicious Faults 1989 GTAEW Peled & Simeone, The Threshold Measure of a Graph 1989 GTAEW Wang, A Finite Algorithm for Feasible Circuits over Oriented Matroids 1989 GTAEW Xu, An Improved Algorithm for Planarity Testing Based on Wu-Liu's Criterion 1994 75 HADASS Waldoks, Rapid Responsa: Jews in Cyberspace 1989 4 HAI Allen, Natural Language Understanding 1986 HAMMING Hamming, Coding and Information Theory (2nd ed.) 1988 HARPER Zinsser, Writing To Learn 1987 HARPER Wood, Theory of Computation 1986 HARPER Gallier, Logic for Computer Science: Foundations of Automatic Theorem Proving 1985 HARPER Zinsser, On Writing Well: An Informal Guide to Writing Nonfiction, 2nd edition 1988 HAW Paulos, Innumeracy: Mathematical Illiteracy and Its Consequences 1995 2 HCOMB Gessel & Stanley, Algebraic Enumeration 1995 2 HCOMB Odlyzko, Asymptotic Enumeration Methods 1995 2 HCOMB Bollobas, Extremal Graph Theory 1995 2 HCOMB Frankl, Extremal Set Systems 1995 2 HCOMB Nesetril, Ramsey Theory 1995 2 HCOMB Beck & sos, Discrepancy Theory 1995 2 HCOMB Babai, Automorphism Groups, Isomorphism, Reconstruction 1995 2 HCOMB Grotschel & Lovasz, Combinatorial Optimization 1995 2 HCOMB Shmoys & Tardos, Computational Complexity 1995 2 HCOMB Schrijver, Polyhedral Combinatorics 1995 2 HCOMB Godsil & Lovasz, Tools from Linear Algebra 1995 2 HCOMB Alon, Tools from Higher Algebra 1995 2 HCOMB Spencer, Probabilistic Methods 1995 2 HCOMB Bjorner, Topological Methods 1995 2 HCOMB Kolen & Lenstra, Combinatorics in Operations Research 1995 2 HCOMB Recski, Combinatorics in Electrical Engineering and Statics 1995 2 HCOMB Godsil & Grotschel & Welsh, Combinatorics in Statistical Physics 1995 2 HCOMB Rouvray, Combinatorics in Chemistry 1995 2 HCOMB Waterman, Applications of Combinatorics to Molecular Biology 1995 2 HCOMB Lovasz & Shmoys & Tardos, Combinatorics in Computer Science 1995 2 HCOMB Lovasz & Pyber & Welsh & Ziegler, Combinatorics in Pure Mathematics 1995 2 HCOMB Hajnal, Infinite Combinatorics 1995 2 HCOMB Guy, Combinatorial Games 1995 2 HCOMB Biggs & Lloyd & Wilson, The History of Combinatorics 1995 1 HCOMB Bondy, Basic Graph Theory: Paths and Circuits 1995 1 HCOMB Frank, Connectivity and Network Flows 1995 1 HCOMB Pulleyblank, Matchings and Extensions 1995 1 HCOMB Toft, Colouring, Stable Sets and Perfect Graphs 1995 1 HCOMB Seymour, Nowhere-Zero Flows 1995 1 HCOMB Thomassen, Embeddings and Minors 1995 1 HCOMB Karonski, Random Graphs 1995 1 HCOMB Duchet, Hypergraphs 1995 1 HCOMB Trotter, Partially Ordered Sets 1995 1 HCOMB Welsh, Matroids: Fundamental Concepts 1995 1 HCOMB Seymour, Matroid Minors 1995 1 HCOMB Bixby & Cunningham, Matroid Optimization and Algorithms 1995 1 HCOMB Cameron, Permutation Groups 1995 1 HCOMB Cameron, Finite Geometries 1995 1 HCOMB Brouwer, Block Designs 1995 1 HCOMB Brouwer & Haemers, Association Schemes 1995 1 HCOMB van Lint, Codes 1995 1 HCOMB Erdos & Purdy, Extremal Problems in Combinatorial Geometry 1995 1 HCOMB Klee & Kleinschmidt, Convex Polytopes and Related Complexes 1995 1 HCOMB Lagarias, Point Lattices 1995 1 HCOMB Pomerance & Sarkozy, Combinatorial Number Theory 1993 A HCONVGEOM Mani-Vevitska, Characterizations of Convex Sets 1993 A HCONVGEOM Connelly, Rigidity 1993 A HCONVGEOM Gritzmann & Klee, Mathematical Programming and Convex Geometry 1993 A HCONVGEOM Burkard, Convexity and Discrete Optimization 1993 A HCONVGEOM Edelsbrunner, Geometric Algorithms 1993 B HCONVGEOM Toth & Kuperberg, Packing and Covering with Convex Sets 1993 B HCONVGEOM Gritzmann & Wills, Finite Packing and Covering 1993 B HCONVGEOM Schulte, Tilings 1993 B HCONVGEOM Gruber, Baire Categories in Convexity 1993 B HCONVGEOM Weil & Wieacker, Stochastic Geometry 1996 HEATH Linz, An Introduction to Formal Languages and Automata, Second Edition 1991 HEATH Warford, Computer Science, Volumes 1 and 2 1990 HEATH Linz, An Introduction to Formal Languages and Automata 1990 HEATH Linz, Instructor's Guide and Solutions Manual to An Introduction to Formal Languages and Automata 1986 HEATH McKeachie, Teaching Tips: A Guidebook for the Beginning College Teacher, Eighth Edition 1992 1 HEINZNIX Valiant, A Combining Mechanism for Parallel Computers 1992 1 HEINZNIX Vishkin, A Case for the PRAM as a Standard Programmer's Model 1992 1 HEINZNIX Meyer auf der Heide, Hashing Strategies for Simulating Shared Memory on Distributed Memory Machines 1992 1 HEINZNIX Rosenberg, Better Parallel Architectures via Emulations 1992 1 HEINZNIX Cosnard & Koiran, Relations between Models of Parallel Abstract Machines 1992 1 HEINZNIX Formella & Massonne & Paul, Cost Effectiveness of Data Flow Machines and Vector Processors 1992 1 HEINZNIX Leiserson, The Networks of the Connection Machine CM-5 1992 1 HEINZNIX Johnsson, Massively Parallel Computing: Data Distribution and Communication 1992 1 HEINZNIX Monien & Luling & Langhammer, A Realizable Efficient Parallel Architecture 1992 1 HEINZNIX Rudolph, Hardware Support for Collective Communication Operations 1992 1 HEINZNIX Bertin & Roncin & Vuillemin, Programmable Active Memories: A Performance Assessment 1992 1 HEINZNIX Leighton & Maggs, The Role of Randomness in the Design of Interconnection Networks 1992 1 HEINZNIX Snyder, Chaos Router: Finally, a Practical Adaptive Router? 1992 1 HEINZNIX Felperin & Raghavan & Upfal, An Experimental Study of Wormhole Routing in Parallel Computers 1992 1 HEINZNIX Luccio & Pagli & Pucci, Three non Conventional Paradigms of Parallel Computation 1992 1 HEINZNIX Snir, Scalable Parallel Computers and Scalable Parallel Codes: From Theory to Practice 1992 1 HEINZNIX Ranade, A Framework for Analyzing Locality and Portability Issues in Parallel Computing 1992 1 HEINZNIX Mayr & Werchner, Optimal Implementation of General Divide-and-Conquer on the Hypercube and Related Networks 1992 1 HEINZNIX Annexstein, Parallel Implementation of Graph Embeddings 1992 1 HEINZNIX Heydari & Sudborough, On Sorting by Prefix Reversals and the Diameter of Pancake Networks 1991 HELMERS Palmer, The Bar Code Book: Reading, Printing, and Specification of Bar Code Symbols, Second Edition 1994 27 HICSS Lin, Convolution Computation on Shift Switching Buses 1994 27 HICSS Khokhar & Prasanna & Wang, Scalable Data Parallel Implementations of Object Recognition on Connection Machine CM-5 1994 27 HICSS Mayr & Werchner, Optimal Expression Evaluation and Term Matching on the Boolean Hypercube 1994 27 HICSS Dahlhaus, Efficient Parallel Algorithms on Chordal Graphs with a Sparse Tree Representation 1994 27 HICSS Akl & Stojmenovic, Multiple Criteria BSR: An Implementation and Applications to Computational Geometry Problems 1994 27 HICSS Dorward & Matheson & Tarjan, Unstructured Multigrid Strategies on Massively Parallel Computers: A Case for Integrated Design 1994 27 HICSS Roos, Maintaining Voronoi Diagrams in Parallel 1994 27 HICSS Chlebus & Diks & Pelc, Waking up an Anonymous Faulty Network from a Single Source 1994 27 HICSS Adhar & Peng, Parallel Algorithms for K-tree Recognition and its Applications 1994 27 HICSS Morgenstern & Fouque, Efficient Submesh Allocation Using Interval Sets 1976 1 HILBERT Hilbert, Mathematical Problems 1976 1 HILBERT Browder, Problems of Present Day Mathematics 1976 1 HILBERT Martin, Hilbert's First Problem: The Continuum Hypothesis 1976 1 HILBERT Kreisel, What Have We Learnt from Hilbert's Second Problem? 1976 1 HILBERT Busemann, Problem IV: Desarguesian Spaces 1976 1 HILBERT Yang, Hilbert's Fifth Problem and Related Problems on Transformation Groups 1976 1 HILBERT Wightman, Hilbert's Sixth Problem: Mathematical Treatment of the Axioms of Physics 1976 1 HILBERT Tijdeman, Hilbert's Seventh Problem: On the Gel'fond-Baker Method and its Applications 1976 1 HILBERT Bombieri, Hilbert's 8th Problem: An Analogue 1976 1 HILBERT Katz, An Overview of Deligne's Proof of the Riemann Hypothesis for Varieties over Finite Fields (Hilbert's Problem 8) 1976 1 HILBERT Montgomery, Problems Concerning Prime Numbers (Hilbert's Problem 8) 1976 2 HILBERT Tate, Problem 9: The General Reciprocity Law 1976 2 HILBERT Davis & Matijasevic & Robinson, Hilbert's Tenth Problem. Diophantine Equations: Positive Aspects of a Negative Solution 1976 2 HILBERT O'Meara, Hilbert's Eleventh Problem: The Arithmetic Theory of Quadratic Forms 1976 2 HILBERT Langlands, Some Contemporary Problems with Origins in the Jugendtraum (Hilbert's Problem 12) 1976 2 HILBERT Lorentz, The 13-th Problem of Hilbert 1976 2 HILBERT Mumford, Hilbert's Fourteenth Problem--the Finite Generation of Subrings such as Rings of Invariants 1976 2 HILBERT Kleiman, Problem 15. Rigorous Foundation of Schubert's Enumerative Calculus 1976 2 HILBERT Pfister, Hilbert's Seventeenth Problem and Related Problems on Definite Forms 1976 2 HILBERT Milnor, Hilbert's Problem 18: On Crystalographic Groups, Fundamental Domains, and on Sphere Packing 1976 2 HILBERT Serrin, The Solvability of Boundary Value Problems (Hilbert's Problem 19) 1976 2 HILBERT Bombieri, Variational Problems and Elliptic Equations (Hilbert's Problem 20) 1976 2 HILBERT Katz, An Overview of Deligne's Work on Hilbert's Twenty-First Problem 1976 2 HILBERT Bers, On Hilbert's 22nd Problem 1976 2 HILBERT Stampacchia, Hilbert's Twenty-Third Problem: Extensions of the Calculus of Variations 1991 HILGER Killingbeck, Microcomputer Algorithms: Action from Algebra 1990 HILGER Kucera, Combinatorial Algorithms 1990 HILGER Beale & Jackson, Neural Computing: An Introduction 1986 HILGER Moore & McCabe & Urquhart (eds.), Systolic Arrays 1986 HILGER Cizek, Discrete Fourier Transforms and their Applications 1992 2 HLICS Klop, Term Rewriting Systems 1992 2 HLICS Barendregt, Lambda Calculi with Types 1992 2 HLICS Gabbay, Elements of Algorithmic Proof 1992 2 HLICS Paulson, Designing a Theorem Prover 1992 2 HLICS Stirling, Modal and Temporal Logics 1992 1 HLICS Ryan & Sadler, Valuation Systems and Consequence Relations 1992 1 HLICS Phillips, Recursion Theory 1992 1 HLICS Meinke & Tucker, Universal Algebra 1992 1 HLICS Poigne, Basic Category Theory 1992 1 HLICS Smyth, Topology 1992 1 HLICS Makowsky, Model Theory and Computer Science: An Appetizer 1988 HLSCOMBINAT Ahlswede, On Code Pairs with Specified Hamming Distances 1988 HLSCOMBINAT Ben-Or & Linal & Saks, Collective Coin Flipping and Other Models of Imperfect Randomness 1988 HLSCOMBINAT Hurkens & Lovasz & Schrijver & Tardos, How To Tidy Up Your Set-system? 1988 HLSCOMBINAT Klavzar & Petkovsek, On Characterizations with Forbidden Subgraphs 1988 HLSCOMBINAT Bodo, How To Add Poly-Log Many Numbers in Constant Depth 1991 HMPROG Arrow, The Origins of the Impossibility Theorem 1991 HMPROG Balinski, Mathematical Programming: Journal, Society, Recollections 1991 HMPROG Dantzig, Linear Programming 1991 HMPROG Edmonds, A Glimpse of Heaven 1991 HMPROG Gomory, Early Integer Programming 1991 HMPROG Hoffman, Linear Programming at the National Bureau of Standards 1991 HMPROG Iri, Growth of Mathematical Programming in Japan 1991 HMPROG Kuhn, On the Origin of the Hungarian Method 1991 HMPROG Kuhn, Nonlinear Programming: A Historical Note 1991 HMPROG Lawler, Old Stories 1991 HMPROG Mangasarian, Mathematical Programming Musings 1991 HMPROG Nemhauser, Mathematical Programming at Cornell and CORE: The Super Seventies 1991 HMPROG Powell, A View of Nonlinear Optimization 1991 HMPROG Scarf, The Origins of Fixed Point Methods 1991 HMPROG Shor, The Development of Numerical Methods for Nonsmooth Optimization in the USSR 1989 HOARE Hoare, The Emperor's Old Clothes 1989 HOARE Hoare, Quicksort 1989 HOARE Hoare, A Contribution to the Development of ALGOL 1989 HOARE Hoare, An Axiomatic Basis for Computer Programming 1989 HOARE Hoare, Proof of a Program: Find 1989 HOARE Hoare, Procedures and Parameters: An Axiomatic Approach 1989 HOARE Hoare, Computer Science 1989 HOARE Hoare, Proof of Correctness of Data Representations 1989 HOARE Hoare, Proof of a Structured Program: The Sieve of Eratosthenes 1989 HOARE Hoare, A Structured Paging System 1989 HOARE Hoare, An Axiomatic Definition of the Programming Language Pascal 1989 HOARE Hoare, Monitors: An Operating System Structuring Concept 1989 HOARE Hoare, Hints on Programming-Language Design 1989 HOARE Hoare, Recursive Data Structures 1989 HOARE Hoare, Parallel Programming: An Axiomatic Approach 1989 HOARE Hoare, Communicating Sequential Processes 1989 HOARE Hoare, A Calculus of Total Correctness for Communicating Sequential Processes 1989 HOARE Hoare, Programming is an Engineering Profession 1989 HOARE Hoare, A Couple of Novelties in the Propositional Calculus 1989 HOARE Hoare, Programs are Predicates 1989 HOARE Hoare, The Mathematics of Programming 1989 HOARE Hoare, An Overview of Some Formal Methods for Program Design 1989 HOARE Hoare, Envoi 1989 HOARE Hoare, Bibliography of Works by C. A. R. Hoare 1993 HORWOOD Barbosa, Massively Parallel Models of Computation: Distributed Parallel Processing in Artificial Intelligence and Optimisation 1991 HORWOOD Bharath, Computers and Graph Theory: Representing Knowledge for Processing by Computers 1991 HORWOOD Dunne, Computability Theory: Concepts and Applications 1990 HORWOOD Lester, A Practical Approach to Data Structures: Related Algorithms in Pascal with Applications 1988 HORWOOD Curth & Edelmann, APL: A Problem-oriented Introduction 1993 HPEREN Gonick & Smith, The Cartoon Guide to Statistics 1990 2 HTCS Perrin, Finite Automata 1990 2 HTCS Berstel & Boasson, Context-Free Languages 1990 2 HTCS Salomaa, Formal Languages and Power Series 1990 2 HTCS Thomas, Automata on Infinite Objects 1990 2 HTCS Courcelle, Graph Rewriting: An Algebraic and Logic Approach 1990 2 HTCS Dershowitz & Jouannaud, Rewrite Systems 1990 2 HTCS Barendregt, Functional Programming and Lambda Calculus 1990 2 HTCS Mitchell, Type Systems for Programming Languages 1990 2 HTCS Courcelle, Recursive Applicative Program Schemes 1990 2 HTCS Apt, Logic Programming 1990 2 HTCS Mosses, Denotational Semantics 1990 2 HTCS Gunter & Scott, Semantic Domains 1990 2 HTCS Wirsing, Algebraic Specification 1990 2 HTCS Kozen & Tiuryn, Logics of Programs 1990 2 HTCS Cousot, Methods and Logics for Proving Programs 1990 2 HTCS Emerson, Temporal and Modal Logic 1990 2 HTCS Kanellakis, Elements of Relational Database Theory 1990 2 HTCS Lamport & Lynch, Distributed Computing: Models and Methods 1990 2 HTCS Milner, Operational and Algebraic Semantics of Concurrent Processes 1990 1 HTCS van Emde Boas, Machine Models and Simulations 1990 1 HTCS Johnson, A Catalog of Complexity Classes 1990 1 HTCS Seiferas, Machine-Independent Complexity Theory 1990 1 HTCS Li & Vitanyi, Kolmogorov Complexity and its Applications 1990 1 HTCS Aho, Algorithms for Finding Patterns in Strings 1990 1 HTCS Mehlhorn & Tsakalidis, Data Structures 1990 1 HTCS Yao, Computational Geometry 1990 1 HTCS Schwartz & Sharir, Algorithmic Motion Planning in Robotics 1990 1 HTCS Vitter & Flajolet, Average-Case Analysis of Algorithms and Data Structures 1990 1 HTCS van Leeuwen, Graph Algorithms 1990 1 HTCS Strassen, Algebraic Complexity Theory 1990 1 HTCS Lenstra & Lenstra, Algorithms in Number Theory 1990 1 HTCS Rivest, Cryptography 1990 1 HTCS Boppana & Sipser, The Complexity of Finite Functions 1990 1 HTCS Pippenger, Communication Networks 1990 1 HTCS Lengauer, VLSI Theory 1990 1 HTCS Karp & Ramachandran, Parallel Algorithms for Shared-Memory Machines 1990 1 HTCS Valiant, General Purpose Parallel Architectures 1994 HUP Lavine, Understanding the Infinite 1990 7 IACR Ingemarsson & Simmons, How Mutually Distrustful Parties Can Set Up a Mutually Trusted Shared Secret Scheme 1982 7 IBMJAPAN Machida, A Lower Bound on the Complexity of Knapsack Problem 1982 7 IBMJAPAN Hartmanis, On the Structure of Feasible Computations 1982 7 IBMJAPAN Tokura, Area and Time Complexities of VLSI Computations 1982 7 IBMJAPAN Rabin, Transaction Protection Protocols 1982 7 IBMJAPAN Watanabe, The Time-Precision Tradeoff Problem on On-line Probabilistic Turing Machines 1982 7 IBMJAPAN Winograd, Complexity of Matrix Multiplication Ideas and Results 1982 7 IBMJAPAN Valiant, Parallel Computations 1982 7 IBMJAPAN Shinohara, Polynomial Time Inference of Pattern Languages and Its Applications 1982 7 IBMJAPAN Fagin, Armstrong Databases 1982 7 IBMJAPAN Kambayashi, Query Processing in Distributed Database Systems 1977 2 IBMJAPAN Hitotumatu, Some Topics on the Numerical Complexity Problems--Test of Primality and its Applications 1977 2 IBMJAPAN Hopcroft, Overview of the Computational Complexity and Some Topics in Polynomial Complete 1977 2 IBMJAPAN Kasai, P =? NP Question on Program Schemata 1995 39 IBMJRD Agarwal & Balle & Gustavson & Joshi & Palkar, A Three-Dimensional Approach to Parallel Matrix Multiplication 1994 38 IBMJRD Raghavan & Snir, Memory versus Randomization in On-line Algorithms 1987 31 IBMJRD Pippenger, The Complexity of Computations by Networks 1987 31 IBMJRD Coppersmith, Cryptography 1987 31 IBMJRD Karp & Rabin, Efficient Randomized Pattern-Matching Algorithms 1977 IBMJRD Chaitin, Algorithmic Information Theory 1966 10 IBMJRD Rosenberg, On Multi-Head Finite Automata 1995 1 ICAAAPP Luce & Myoupo, An Efficient Linear Systolic Algorithm for Recovering Longest Common Subsequences 1995 1 ICAAAPP Nakano & Wada, Integer Summing Algorithms on Reconfigurable Meshes 1995 1 ICAAAPP Liang & McKay, Fast Parallel Algorithms for Testing k-connectivity of Directed and Undirected Graphs 1995 1 ICAAAPP ElGindy & Wetherall, An L1 Voronoi Diagram for a Reconfigurable Mesh 1995 1 ICAAAPP Chong & Lam, Improved Parallel Algorithms for Finding Connected Components 1995 1 ICAAAPP Chen & Chen, Vertex-Disjoint Routings in Star Graphs 1995 1 ICAAAPP Chen & Chen, A Homomorphism of the de Bruijn Graphs and its Applications 1995 1 ICAAAPP Thiagarajan & Datta & Gonzalez, Self-Stabilizing Algorithms for Tree Metrics 1996 23 ICALP Ganzinger, Saturation-Based Theorem Proving 1996 23 ICALP Ranade, Bandwidth-Efficient Parallel Computation 1996 23 ICALP Bruyere & Latteux, Variable-Length Maximal Codes 1996 23 ICALP Razborov, Lower Bounds for Propositional Proofs and Independence Results in Bounded Arithmetic 1996 23 ICALP Chen & De Nicola, Algebraic Characterizations of Decorated Trace Equivalences over Tree-Like Structures 1996 23 ICALP Jenner & Vogler, Fast Asynchronous Systems in Dense Time 1996 23 ICALP Lenzi, A Hierarchy Theorem for the mu-Calculus 1996 23 ICALP Bradfield & Esparza & Mader, An Effective Tableau System for the Linear Time mu-Calculus 1996 23 ICALP Joung, Characterizing Fairness Implementability for Multiparty Interaction 1996 23 ICALP Lucas, Termination of Context-Sensitive Rewriting by Rewriting 1996 23 ICALP Cheng & Kozen, A Complete Gentzen-style Axiomatization for Set Constraints 1996 23 ICALP Billaud, Fatal Errors in Conditional Expressions 1996 23 ICALP Mossakowski, Different Types of Arrow Between Logical Frameworks 1996 23 ICALP Mitchell & Viswanathan, Effective Models of Polymorphism, Subtyping and Recursion 1996 23 ICALP Bosscher & Griffioen, Regularity for a Large Class of Context-Free Processes is Decidable 1996 23 ICALP Caucal, On Infinite Transition Graphs Having a Decidable Monadic Theory 1996 23 ICALP Senizergues, Semi-Groups Acting on Context-free Graphs 1996 23 ICALP Lisovik, Hard Sets Method and Semilinear Reservoir Method with Applications 1996 23 ICALP Flajolet & Gourdon & Panario, Random Polynomials and Polynomial Factorization 1996 23 ICALP Koppenhagen & Mayr, Optimal Grobner Base Algorithms for Binomial Ideals 1996 23 ICALP Kloks & Kratsch & Wong, Minimum Fill-In of Circle and Circular-Arc Graphs 1996 23 ICALP Chen, Practical Approximation Schemes for Maximum Induced-Subgraph Problems on K_{3,3}-free or K_5-free Graphs 1996 23 ICALP Koutsoupias & Papadimitriou & Yannakakis, Searching a Fixed Graph 1996 23 ICALP Rauch Henzinger & Thorup, Improved Sampling with Applications to Dynamic Graph Algorithms 1996 23 ICALP Pin, The Expressive Power of Existential First Order Sentences of Buchi's Sequential Calculus 1996 23 ICALP Kaivola, Fixpoints for Rabin Tree Automata Make Complementation Easy 1996 23 ICALP Hashiguchi, New Upper Bounds to the Limitedness of Distance Automata 1996 23 ICALP Raymond, Recognizing Regular Expressions by Means of Dataflow Networks 1996 23 ICALP Ablayev & Karpinski, On the Power of Randomized Branching Programs 1996 23 ICALP Andreev & Clementi & Rolim, Hitting Sets Derandomize BPP 1996 23 ICALP Book & Vollmer & Wagner, On Type-2 Probabilistic Quantifiers 1996 23 ICALP Wiedermann, Speeding-Up Single-Tape Nondeterministic Computations by Single Alternation, with Separation Results 1996 23 ICALP Julia, On omega-Generators and Codes 1996 23 ICALP de Luca, On Standard Sturmian Morphisms 1996 23 ICALP Ateniese & Blundo & De Santis & Stinson, Constructions and Bounds for Visual Cryptography 1996 23 ICALP Azar & Bartal & Feuerstein & Fiat & Leonardi & Rosen, On Capital Investment 1996 23 ICALP Miltersen, Lower Bounds for Static Dictionaries on RAMs with Bit Operations but No Multiplication 1996 23 ICALP Bradford & Reinert, Lower Bounds for Row Minima Searching 1996 23 ICALP Shukla & Hunt & Rosenkrantz & Stearns, On the Complexity of Relational Problems for Finite State Processes 1996 23 ICALP Jancar & Esparza, Deciding Finiteness of Petri Nets Up To Bisimulation 1996 23 ICALP Bodei & Degano & Priami, Mobile Processes with a Distributed Environment 1996 23 ICALP van Glabbeek, The Meaning of Negative Premises in Transition System Specifications II 1996 23 ICALP Albers & Mitzenmacher, Average Case Analyses of List Update Algorithms, with Applications to Data Compression 1996 23 ICALP Schulz & Schomer, Self-Organizing Data Structures with Dependent Accesses 1996 23 ICALP Choi & Golin, Lopsided Trees: Analyses, Algorithms, and Applications 1996 23 ICALP Farach & Muthukrishnan, Optimal Logarithmic Time Randomized Suffix Tree Construction 1996 23 ICALP Alon & Srinivasan, Improved Parallel Approximation of a Class of Integer Programming Problems 1996 23 ICALP Bermond & Gargano & Perennes & Rescigno & Vaccaro, Efficient Collective Communication in Optical Networks 1996 23 ICALP Chlebus & Gambin & Indyk, Shared-Memory Simulations on a Faulty-Memory DMM 1996 23 ICALP Herley & Pietracaprina & Pucci, Fast Deterministic Backtrack Search 1996 23 ICALP Yu & Yung, Agent Rendezvous: A Dynamic Symmetry-Breaking Problem 1996 23 ICALP Aumann & Bender, Efficient Asynchronous Consensus with the Value-Oblivious Adversary Scheduler 1996 23 ICALP Cowen & Feigenbaum & Kannan, A Formal Framework for Evaluating Heuristic Programs 1996 23 ICALP Chakrabarti & Phillips & Schulz & Shmoys & Stein & Wein, Improved Scheduling Algorithms for Minsum Criteria 1996 23 ICALP Paterson & Przytycka, On the Complexity of String Folding 1996 23 ICALP Fernandez-Baca & Lagergren, A Polynomial-Time Algorithm for Near-Perfect Phylogeny 1995 22 ICALP Ehrenfeucht & Harju & Rozenberg, Theory of 2-Structures 1995 22 ICALP Diekert & Gastin, A Domain for Concurrent Termination: A Generalization of Mazurkiewicz Traces 1995 22 ICALP Esik & Bertol, Nonfinite Axiomatizability of the Equational Theory of Shuffle 1995 22 ICALP Kuich, The Algebraic Equivalent of AFL Theory 1995 22 ICALP Culik & Kari, Finite State Transformations of Images 1995 22 ICALP Lipponen, Post Correspondence Problem: Words Possible as Primitive Solutions 1995 22 ICALP Metivier & Richomme & Wacrenier, Computing the Closure of Sets of Words under Partial Commutations 1995 22 ICALP Bodlaender & de Fluiter, Intervalizing k-Colored Graphs 1995 22 ICALP Chen, NC Algorithms for Finding a Maximal Set of Paths with Application to Compressing Strings 1995 22 ICALP Giancarlo & Grossi, On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications 1995 22 ICALP Parra & Scheffler, How to Use the Minimal Separators of a Graph for its Chordal Triangulation 1995 22 ICALP Bermond & Gargano & Rescigno & Vaccaro, Fast Gossiping by Short Messages 1995 22 ICALP Bao & Igarashi, Break Finite Automata Public Key Cryptosystem 1995 22 ICALP Nikoletseas & Reif & Spirakis & Yung, Short Memory in Stochastic Graphs: Fuly Dynamic Connectivity in Poly-Log Expected Time 1995 22 ICALP Blundo & De Santis & Persiano & Vaccaro, On the Number of Random Bits in Totally Private Computation 1995 22 ICALP Freivalds & Karpinski, Lower Time Bounds for Randomized Computation 1995 22 ICALP Kobler & Watanabe, New Collapse Consequences of NP Having Small Circuits 1995 22 ICALP Balcazar, The Complexity of Searching Succinctly Represented Graphs 1995 22 ICALP Bauernoppel & Kranakis & Krizanc & Maheshwari & Noy & Sack & Urrutia, Optimal Shooting: Characterizations and Applications 1995 22 ICALP Auletta & Parente & Persiano, Placing Resources in a Tree: Dynamic and Static Algorithms 1995 22 ICALP Chaudhuri & Zaroliagis, Shortest Path Queries in Digraphs of Small Treewidth 1995 22 ICALP Golin & Rote, A Dynamic Programming Algorithm for Constructing Optimal Prefix-Free Codes for Unequal Letter Costs 1995 22 ICALP Bodlaender & Hagerup, Parallel Algorithms with Optimal Speedup for Bounded Treewidth 1995 22 ICALP Henzinger, Approximating Minimum Cuts under Insertions 1995 22 ICALP Corneil & Olariu & Stewart, Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-Free Graphs 1995 22 ICALP Leonardi & Marchetti-Spaccamela, On-line Resource Management with Applications to Routing and Scheduling 1995 22 ICALP Petersen, Alternation in Simple Devices 1995 22 ICALP Henzinger, Hybrid Automata with Finite Bisimulations 1995 22 ICALP Lopez & Narbel, Generalized Sturmian Languages 1995 22 ICALP Pin & Weil, Polynomial Closure and Unambiguous Product 1995 22 ICALP Ben-Amram & Galil, Lower Bounds on Algebraic Random Access Machines 1995 22 ICALP Pietracaprina & Pucci, Improved Deterministic PRAM Simulation on the Mesh 1995 22 ICALP Ambos-Spies, On Optimal Polynomial Time Approximations: P-Levelability vs. Delta-Levelability 1995 22 ICALP Fenner & Lutz & Mayordomo, Weakly Useful Sequences 1995 22 ICALP Schwentick, Graph Connectivity, Monadic NP and Built-in Relations of Moderate Degree 1995 22 ICALP Henzinger & Kopke & Wong-Toi, The Expressive Power of Clocks 1995 22 ICALP Paun, Grammar Systems: A Grammatical Approach to Distribution and Cooperation 1995 22 ICALP Harju & Karhumaki & Plandowski, Compactness of Systems of Equations in Semigroups 1995 22 ICALP Duris & Galil, Sensing versus Nonsensing Automata 1995 22 ICALP Bozanis & Kitsios & Makris & Tsakalidis, New Upper Bounds for Generalized Intersection Searching Problems 1995 22 ICALP Becker & Drechsler & Theobald, OKFDDs versus OBDDs and OFDDs 1995 22 ICALP Marathe & Ravi & Sundaram & Ravi & Rosenkrantz & Hunt, Bicriteria Network Design Problems 1995 22 ICALP Le, On Determining Optimal Strategies in Pursuit Games in the Plane 1995 22 ICALP Rubio, Extension Orderings 1995 22 ICALP Greco & Sacca & Zaniolo, The PushDown Method to Optimize Chain Logic Programs 1995 22 ICALP Andersen & Kristoffersen & Larsen & Niedermann, Automatic Synthesis of Real Time Systems 1995 22 ICALP Blum & Codenotti & Gemmell & Shahoumian, Self-Correcting for Function Fields of Finite Transcendental Degree 1995 22 ICALP Fortnow & Freivalds & Gasarch & Kummer & Kurtz & Smith & Stephan, Measure, Category and Learning Theory 1995 22 ICALP Cosnard & Goles, A Characterization of the Existence of Energies for Neural Networks 1995 22 ICALP Jurgensen & Konstantinidis, Variable-Length Codes for Error Correction 1995 22 ICALP Khuller & Rivlin & Rosenfeld, Graphbots: Mobility in Discrete Spaces 1995 22 ICALP Best & Koutny, Solving Recursive Net Equations 1995 22 ICALP Dawar & Hella & Kolaitis, Implicit Definability and Infinitary Logic in Finite Model Theory 1995 22 ICALP Vogler, The Limit of Split_n-Language Equivalence 1995 22 ICALP Natarajan & Cleaveland, Divergence and Fair Testing 1995 22 ICALP Degano & Priami, Causality for Mobile Processes 1995 22 ICALP Sangiorgi, Internal Mobility and Agent-Passing Calculi 1994 21 ICALP Pudlak, Unexpected Upper Bounds on the Complexity of Some Communication Games 1994 21 ICALP Fernau & Staiger, Valuations and Unambiguity of Languages, with Applications to Fractal Geometry 1994 21 ICALP Siegelmann, On The Computational Power of Probabilistic and Faulty Neural Networks 1994 21 ICALP Cerans, Deciding Properties of Integral Relational Automata (Extended Abstract) 1994 21 ICALP Aumann & Bar-Ilan & Feige, On the Cost of Recomputing: Tight Bounds on Pebbling with Faults 1994 21 ICALP Asarin & Maler, On some Relations between Dynamical Systems and Transition Systems 1994 21 ICALP Globerman & Harel, Complexity Results for Multi-Pebble Automata and their Logics 1994 21 ICALP Kanellakis & Hillebrand & Mairson, An Analysis of the Core-ML Language: Expressive Power and Type Reconstruction 1994 21 ICALP Gyssens & Van den Bussche & Van Gucht, Expressiveness of Efficient Semi-Deterministic Choice Constructs 1994 21 ICALP Gradel & Gurevich, Tailoring Recursion for Complexity 1994 21 ICALP Klarlund & Mukund & Sohoni, Determinizing Asynchronous Automata 1994 21 ICALP Muscholl, On the Complementation of Buchi Asynchronous Cellular Automata 1994 21 ICALP Corradini & De Nicola, Distribution and Locality of Concurrent Systems 1994 21 ICALP Gawlick & Segala & Sogaard-Andersen & Lynch, Liveness in Timed and Untimed Systems 1994 21 ICALP Sanchez-Couso & Fernandez-Camacho, Average-case Analysis of Pattern-Matching in Trees under the BST Probability Model 1994 21 ICALP Jiang & Li, On the Approximation of Shortest Common Supersequences and Longest Common Subsequences (Extended Abstract) 1994 21 ICALP Hariharan & Muthukrishnan, Optimal Parallel Algorithms for Prefix Matching 1994 21 ICALP Amir & Benson & Farach, Optimal Two-Dimensional Compressed Matching 1994 21 ICALP Italiano & Ramaswami, Maintaining Spanning Trees of Small Diameter (Extended Abstract) 1994 21 ICALP Gil & Matias, Simple Fast Parallel Hashing (extended abstract) 1994 21 ICALP Przytycka & Larmore, The Optimal Alphabetic Tree Problem Revisited 1994 21 ICALP Buhrman & Torenvliet, On the Cutting Edge of Relativization: The Resource Bounded Injury Method 1994 21 ICALP Birget & Margolis & Meakin & Weil, PSPACE-completeness of Certain Algorithmic Problems on the Subgroups of Free Groups 1994 21 ICALP Hennessy, Higher-Order Processes and Their Models 1994 21 ICALP Vergauwen & Lewi, Efficient Local Correctness Checking for Single and Alternating Boolean Equation Systems 1994 21 ICALP Abdulla & Jonsson, Undecidable Verification Problems for Programs with Unreliable Channels 1994 21 ICALP Fix & Schneider, Reasoning about Programs by Exploiting the Environment (Extended Abstract) 1994 21 ICALP Brauner, A Model of Intuitionistic Affine Logic From Stable Domain Theory 1994 21 ICALP Plotkin & Winskel, Bistructures, Bidomains and Linear Logic 1994 21 ICALP Aziz & Singhal & Balarin & Brayton & Sangiovanni-Vincentelli, Equivalences for Fair Kripke Structures 1994 21 ICALP von Breugel, Generalizing Finiteness Conditions of Labelled Transition Systems (extended abstract) 1994 21 ICALP Droste, A Kleene Theorem for Recognizable Languages over Concurrency Monoids 1994 21 ICALP Seidl, Least Solutions of Equations over N 1994 21 ICALP Hotz & Pitsch, Fast Uniform Analysis of Coupled-Context-Free Languages 1994 21 ICALP Pin, Polynomial Closure of Group Languages and Open Sets of the Hall Topology 1994 21 ICALP Caron & Comon & Coquide & Dauchet & Jacquemard, Pumping, Cleaning and Symbolic Constraints Solving 1994 21 ICALP Hintermeier & Kirchner & Kirchner, Dynamically-Typed Computations for Order-Sorted Equational Presentations (Extended Abstract) 1994 21 ICALP Di Cosmo & Kesner, Combining First Order Algebraic Rewriting Systems, Recursion and Extensional Lambda Calculi 1994 21 ICALP Upfal, On the Theory of Interconnection Networks for Parallel Computers 1994 21 ICALP Garg & Vazirani & Yannakakis, Multiway Cuts in Directed and Node Weighted Graphs (Extended Abstract) 1994 21 ICALP Feige, A Fast Randomized LOGSPACE Algorithm for Graph Connectivity (Preliminary version) 1994 21 ICALP Nikoletseas & Palem & Spirakis & Yung, Short Vertex Disjoint Paths and Multiconnectivity in Random Graphs: Reliable Network Computing 1994 21 ICALP Lagergren, The Size of an Intertwine 1994 21 ICALP Yuster & Zwick, Finding Even Cycles Even Faster (Extended Abstract) 1994 21 ICALP Hofting & Wanke, Polynomial Time Analysis of Toroidal Periodic Graphs 1994 21 ICALP Bonizzoni, A Tight Lower Bound for Primitivity in k-Structures 1994 21 ICALP Blundo & De Santis & Vaccaro, Randomness in Distribution Protocols (Extended Abstract) 1994 21 ICALP Freivalds & Karpinski, Lower Space Bounds for Randomized Computation 1994 21 ICALP Jakoby & Reischuk & Schindelhauer & Weis, The Average Case Complexity of the Parallel Prefix Problem 1994 21 ICALP Golin & Young, Prefix Codes: Equiprobable Words, Unequal Letter Costs 1994 21 ICALP Plaxton & Suel, A Super-Logarithmic Lower Bound for Hypercubic Sorting Networks 1994 21 ICALP Mei & Igarashi, Efficient Strategies for Robot Navigation in Unknown Environment 1993 20 ICALP Blum, Program Result Checking: A New Approach to Making Programs More Reliable 1993 20 ICALP Andersson & Mattsson, Dynamic Interpolation Search in o(log log n) Time 1993 20 ICALP Frederickson, Searching Among Intervals and Compact Routing Tables 1993 20 ICALP Lund & Yannakakis, The Approximation of Maximum Subgraph Problems 1993 20 ICALP Kann, Polynomially Bounded Minimization Problems Which are Hard to Approximate 1993 20 ICALP Garg & Vazirani & Yannakakis, Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover 1993 20 ICALP Marathe & Hunt & Ravi, The Complexity of Approximating PSPACE-Complete Problems for Hierarchical Specifications 1993 20 ICALP Czumaj & Gibbons, Problems on Pairs of Trees and the Four Colour Problem of Planar Graphs 1993 20 ICALP Kalyanasundaram & Pruhs, Constructing Competitive Tours from Local Information 1993 20 ICALP Bodlaender & Kloks & Kratsch, Treewidth and Pathwidth of Permutation Graphs 1993 20 ICALP Jaromczyk & Swiatek, A Theory of Even Functionals and Their Algorithmic Applications 1993 20 ICALP Flajolet & Golin, Exact Asymptotics of Divide-and-Conquer Recurrences 1993 20 ICALP Kozen & Zaks, Optimal Bounds for the Change-Making Problem 1993 20 ICALP Reif & Tate, The Complexity of N-body Simulation 1993 20 ICALP Dillencourt & Smith, A Simple Method for Resolving Degeneracies in Delaunay Triangulations 1993 20 ICALP Hemachandra, Fault-Tolerance and Complexity 1993 20 ICALP Yamamoto, Reversal-Space Trade-offs for Simultaneous Resource-Bounded Nondeterministic Turing Machines 1993 20 ICALP Orponen, On the Computational Power of Discrete Hopfield Nets 1993 20 ICALP Karpinski & Verbeek, On Randomized Versus Deterministic Computation 1993 20 ICALP Ablayev, Lower Bounds for One-Way Probabilistic Communication Complexity 1993 20 ICALP Hagerup & Mehlhorn & Munro, Maintaining Discrete Probability Distributions Optimally 1993 20 ICALP Franklin & Yung, Secure and Efficient Off-Line Digital Money 1993 20 ICALP Juedes & Lathrop & Lutz, Computational Depth and Reducibility 1993 20 ICALP Baliga & Case, Learnability: Admissible, Co-Finite, and Hypersimple Languages 1993 20 ICALP Jiang & Salomaa & Salomaa & Yu, Inclusion is Undecidable for Pattern Languages 1993 20 ICALP Ibarra & Jiang & Tran & Wang, New Decidability Results Concerning Two-Way Counter Machines and Applications 1993 20 ICALP Michaux & Villemaire, Cobham's Theorem Seen Through Buchi's Theorem 1993 20 ICALP Ebinger & Muscholl, Logical Definability on Infinite Traces 1993 20 ICALP Wilke, Algebras for Classifying Regular Tree Languages and an Application to Frontier Testability 1993 20 ICALP Gupta, Finite Automata as Characterizations of Minor Closed Tree Families 1993 20 ICALP Dolev & Malki, On Distributed Algorithms in a Broadcast Domain 1993 20 ICALP Chlebus & Diks & Pelc, Sparse Networks Supporting Efficient Reliable Broadcasting 1993 20 ICALP Meyer auf der Heide & Oesterdiekhoff & Wanka, Strongly Adaptive Token Distribution 1993 20 ICALP Schonhage, Fast Parallel Computation of Characteristic Polynomials by Leverrier's Power Sum Method Adapted to Fields of Finite Characteristic 1993 20 ICALP Kirousis, Fast Parallel Constraint Satisfaction 1993 20 ICALP Simon, The Product of Rational Languages 1993 20 ICALP Ochmanski & Wacrenier, On Regular Compatibility of Semi-Commutations 1993 20 ICALP Dumas, Algebraic Aspects of B-Regular Series 1993 20 ICALP Cohen & Fredman, Products of Finite State Machines with Full Coverage 1993 20 ICALP Senizergues, An Effective Version of Stallings' Theorem in the Case of Context-Free Groups 1993 20 ICALP Lepisto, On the Power of Periodic Iteration of Morphisms 1993 20 ICALP Mignosi & Seebold, If a D0L Language is k-Power Free then It is Circular 1993 20 ICALP Jategaonkar & Meyer, Deciding True Concurrency Equivalences on Finite Safe Nets 1993 20 ICALP Vogler, Timed Testing of Concurrent Systems 1993 20 ICALP Havelund & Larsen, The Fork Calculus 1993 20 ICALP Inverardi & Priami & Yankelevich, Extended Transition Systems for Parametric Bisimulation 1993 20 ICALP Brown & Gurr, Temporal Logic and Categories of Petri Nets 1993 20 ICALP Lodaya & Ramanujam & Thiagarajan, Decidability of a Partial Order Based Temporal Logic 1993 20 ICALP Hungar & Steffen, Local Model-Checking for Context-Free Process 1993 20 ICALP Abiteboul & Vianu, Computing on Structures 1993 20 ICALP Contejean, A Partial Solution for D-Unification Based on a Reduction to AC1-Unification 1993 20 ICALP Codish & Falaschi & Marriott & Winsborough, Efficient Analysis of Concurrent Constraint Logic Programs 1993 20 ICALP Di Cosmo & Kesner, A Confluent Reduction for the Extensional Typed lamda-Calculus with Pairs, Sums, Recursion and Terminal Object 1993 20 ICALP Barbanera & Fernandez, Modularity of Termination and Confluence in Combinations of Rewrite Systems with lambda_omega 1993 20 ICALP Bracho & Droste, From Domains to Automata with Concurrency 1993 20 ICALP Kanneganti & Cartwright, What Is a Universal Higher-Order Programming Language? 1992 19 ICALP Li & Vitanyi, Philosophical Issues in Kolmogorov Complexity 1992 19 ICALP Straubing, Circuit Complexity and the Expressive Power of Generalized First-Order Formulas 1992 19 ICALP De Santis & Persiano & Yung, One-Message Statistical Zero-Knowledge Proofs and Space-Bounded Verifier 1992 19 ICALP Keranen, Abelian Squares Are Avoidable on 4 Letters 1992 19 ICALP Karhumaki & Plandowski & Rytter, Polynomial Size Test Sets for Context-Free Languages 1992 19 ICALP Nishida, Quasi-Deterministic 0L Systems 1992 19 ICALP Buntrock & Lorys, On Growing Context-Sensitive Languages 1992 19 ICALP Shallit, Numeration Systems, Linear Recurrences, and Regular Sets 1992 19 ICALP Krob, The Equality Problem for Rational Series with Multiplicities in the Tropical Semiring is Undecidable 1992 19 ICALP Clerbout & Latteux & Roos & Zielonka, Semi-Commutations and Rational Expressions 1992 19 ICALP Ibarra & Tran, New Results Concerning Synchronized Finite Automata 1992 19 ICALP Engelfriet, A Greibach Normal Form for Context-Free Graph Grammars 1992 19 ICALP Peladeau & Podelski, On Reverse and General Definite Tree Languages 1992 19 ICALP Arvind & Han & Hemachandra & Koebler & Lozano & Mundhenk & Ogiwara & Schoening & Silvestri & Thierauf, Reductions to Sets of Low Information Content 1992 19 ICALP Sheu & Long, UP and the Low and High Hierarchies: A Relativized Separation 1992 19 ICALP Flajolet, Analytic Analysis of Algorithms 1992 19 ICALP Kirschenhofer & Prodinger & Szpankowski, How to Count Quickly and Accurately 1992 19 ICALP Schmid, The Average CRI-Length of a Tree Collision Resolution Algorithm in Presence of Multiplicity-Dependent Capture Effects 1992 19 ICALP Dietzfelbinger & Gil & Matias & Pippenger, Polynomial Hash Functions Are Reliable 1992 19 ICALP Sekar & Ramesh & Ramakrishnan, Adaptive Pattern Matching 1992 19 ICALP Mansour, Randomized Interpolation and Approximation of Sparse Polynomials 1992 19 ICALP Bodlaender & Fellows & Warnow, Two Strikes Against Perfect Phylogeny 1992 19 ICALP Zhang, Disjunctive Systems and L-Domains 1992 19 ICALP Apostolico & Breslauer & Galil, Optimal Parallel Algorithms for Periods, Palindromes and Squares 1992 19 ICALP Broder & Frieze & Shamir & Upfal, Near-Perfect Token Distribution 1992 19 ICALP Hagerup & Kutylowski, Fast Merging on the EREW PRAM 1992 19 ICALP Khuller & Thurimella, Approximation Algorithms for Graph Augmentation 1992 19 ICALP Westbrook, Fast Incremental Planarity Testing 1992 19 ICALP La Poutre, Maintenance of Triconnected Components of Graphs 1992 19 ICALP Vazirani & Yannakakis, Suboptimal Cuts: Their Enumeration, Weight and Number 1992 19 ICALP Bundgen, Buchberger's Algorithm: The Term Rewriter's Point of View 1992 19 ICALP Comon, Completion of Rewrite Systems with Membership Constraints 1992 19 ICALP Rote, A New Metric Between Polygons, and How to Compute it 1992 19 ICALP Paterson & Yao, On Nearest-Neighbour Graphs 1992 19 ICALP Matousek & Seidel, A Tail Estimate for Mulmuley's Segment Intersection Algorithm 1992 19 ICALP Chazelle & Rosenberg, Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine 1992 19 ICALP Kolaitis & Vardi, Infinitary Logic for Computer Science 1992 19 ICALP Chang & Manna & Pnueli, Characterization of Temporal Property Classes 1992 19 ICALP Ong, Lazy Lambda Calculus: Theories, Models and Local Structure Characterization 1992 19 ICALP Laenens & Vermeir & Zaniolo, Logic Programming Semantics Made Easy 1992 19 ICALP Debray, On the Complexity of Dataflow Analysis of Logic Programs 1992 19 ICALP Cortesi & File & Winsborough, Comparison of Abstract Interpretations 1992 19 ICALP Phoa & Fourman, A Proposed Categorical Semantics for Pure ML 1992 19 ICALP Henzinger & Manna & Pnueli, What Good Are Digital Clocks? 1992 19 ICALP Moller & Tofts, Behavioural Abstraction in TCCS 1992 19 ICALP Brown & Gurr, Timing Petri Nets Categorically 1992 19 ICALP Gastin & Petit, Asynchronous Cellular Automata for Infinite Traces 1992 19 ICALP Hoogers & Kleijn & Thiagarajan, A Trace Semantics for Petri Nets 1992 19 ICALP Vogler, Asynchronous Communication of Petri Nets and the Refinement of Transitions 1992 19 ICALP Montanari & Yankelevich, A Parametric Approach to Localities 1992 19 ICALP Degano & Priami, Proved Trees 1992 19 ICALP Olderog, Interfaces Between Languages for Communicating Systems 1992 19 ICALP Sannella & Tarlecki, Toward Formal Development of Programs from Algebraic Specifications: Model-Theoretic Foundations 1992 19 ICALP Fix & Francez & Grumberg, Program Composition via Unification 1992 19 ICALP Milner & Sangiorgi, Barbed Bisimulation 1992 19 ICALP Rabinovich, Checking Equivalences Between Concurrent Systems of Finite Agents 1992 19 ICALP Cleaveland & Smolka & Zwarico, Testing Preorders for Probabilistic Processes 1991 18 ICALP Gabbrielli & Levi, On the Semantics of Logic Programs 1991 18 ICALP Chen & Hsiang, Logic Programming with Recurrence Domains 1991 18 ICALP Bucciarelli & Ehrhard, Extensional Embedding of a Strongly Stable Model of PCF 1991 18 ICALP Ernoult & Mycroft, Uniform Ideals and Strictness Analysis 1991 18 ICALP Breazu-Tannen & Subrahmanyam, Logical and Computational Aspects of Programming with Sets/Bags/Lists 1991 18 ICALP Bouajjani & Fernandez & Graf & Rodriguez & Sifakis, Safety for Branching Time Semantics 1991 18 ICALP Fix & Francez & Grumberg, Program Composition and Modular Verification 1991 18 ICALP Alur & Courcoubetis & Dill, Model-checking for Probabilistic Real-time Systems (Extended abstract) 1991 18 ICALP Cleaveland & Steffen, Computing Behavioural Relations, Logically 1991 18 ICALP Ben-Asher & Peleg & Ramaswami & Schuster, The Power of Reconfiguration 1991 18 ICALP Fouks, General Resolution of Tseitin Formulas is Hard (extended abstract) 1991 18 ICALP Kannan & Yao, Program Checkers for Probability Generation 1991 18 ICALP Kaneps & Freivalds, Running Time to Recognize Nonregular Languages by 2-Way Probabilistic Automata 1991 18 ICALP Casas & Diaz & Martinez, Statistics on Random Trees 1991 18 ICALP Larsen, The Expressive Power of Implicit Specifications 1991 18 ICALP Yi, CCS + Time = an Interleaving Model for Real Time Systems 1991 18 ICALP Diekert & Ochmanski & Reinhardt, On Confluent Semi-Commutations - Decidability and Complexity Results (extended abstract) 1991 18 ICALP Duchamp & Krob, Lazard's Factorizations of Free Partially Commutative Monoids 1991 18 ICALP Gastin & Petit & Zielonka, A Kleene Theorem for Infinite Trace Languages 1991 18 ICALP Dershowitz, Canonical Sets of Horn Clauses 1991 18 ICALP Madlener & Narendran & Otto, A Specialized Completion Procedure for Monadic String-Rewriting Systems Presenting Groups 1991 18 ICALP Curien & Di Cosmo, A Confluent Reduction for the lambda-Calculus with Surjective Pairing and Terminal Object 1991 18 ICALP Fernando, Provably Recursive Programs and Program Extraction 1991 18 ICALP Lengauer & Theune, Efficient Algorithms for Path Problems with General Cost Criteria 1991 18 ICALP Djidjev & Pantziou & Zaroliagis, Computing Shortest Paths and Distances in Planar Graphs 1991 18 ICALP Galil & Italiano, Maintaining Biconnected Components of Dynamic Planar Graphs (Extended Abstract) 1991 18 ICALP Loebl, Efficient Maximal Cubic Graph Cuts (Extended Abstract) 1991 18 ICALP Vishkin, Structural Parallel Algorithmics 1991 18 ICALP Ranjan & Chari & Rohatgi, Improving Known Solutions is Hard 1991 18 ICALP Hemachandra & Hoene, Collapsing Degrees via Strong Computation (Extended Abstract) 1991 18 ICALP Hagerup, Fast Parallel Generation of Random Permutations 1991 18 ICALP Jung & Serna & Spirakis, A Parallel Algorithm for two Processors Precedence Constraint Scheduling 1991 18 ICALP Fuerer & Raghavachari, An Efficient NC Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs 1991 18 ICALP Thomas, On Logics, Tilings, and Automata 1991 18 ICALP Jouannaud & Okada, Satisfiability of Systems of Ordinal Notations with the Subterm Property is Decidable 1991 18 ICALP Comon, Complete Axiomatizations of Some Quotient Term Algebras 1991 18 ICALP Bol & Groote, The Meaning of Negative Premises in Transition System Specifications (Extended Abstract) 1991 18 ICALP Vogler, Deciding History Preserving Bisimiliarity 1991 18 ICALP Aceto & Hennessy, Adding Action Refinement to a Finite Process Algebra 1991 18 ICALP Bini & Gemignani & Pan, Improved Parallel Computations with Matrices and Polynomials 1991 18 ICALP Lagergren & Arnborg, Finding Minimal Forbidden Minors Using a Finite Congruence 1991 18 ICALP Bodlaender & Kloks, Better Algorithms for the Pathwidth and Treewidth of Graphs 1991 18 ICALP Cucker & Torrecillas, Two P-Complete Problems in the Theory of the Reals 1991 18 ICALP Honkala & Salomaa, L Morphisms: Bounded Delay and Regularity of Ambiguity 1991 18 ICALP Bruyere & de Felice, Degree and Decomposability of Variable-Length Codes 1991 18 ICALP Wilke, An Eilenberg Theorem for infinity-Languages 1991 18 ICALP Culik & Dube, Balancing Order and Chaos in Image Generation (Extended Abstract) 1991 18 ICALP Gurevich, Average Case Complexity 1991 18 ICALP Jiang & Ravikumar, Minimal NFA Problems Are Hard (Extended Abstract) 1991 18 ICALP Hashiguchi, Algorithms for Determining the Smallest Number of Nonterminals (States) Sufficient for Generating (Accepting) a Regular Language 1991 18 ICALP Bhattacharya & Toussaint, Computing Shortest Transversals 1991 18 ICALP Chazelle & Edelsbrunner & Grigni & Guibas & Hershberger & Sharir & Snoeyink, Ray Shooting in Polygons Using Geodesic Triangulations 1991 18 ICALP Bern & Eppstein & Yao, The Expected Extremes in a Delaunay Triangulation 1991 18 ICALP Chazelle, Computational Geometry for the Gourmet: Old Fare and New Dishes (Invited Paper) 1991 18 ICALP Duris & Galil, On the Power of Multiple Reads in a Chip 1991 18 ICALP Groeger & Turan, On Linear Decision Trees Computing Boolean Functions 1991 18 ICALP Galil & Margalit, An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem 1991 18 ICALP Khuller & Mitchell & Vazirani, On-line Algorithms for Weighted Bipartite Matching and Stable Marriages 1991 18 ICALP Naor, Fast Matching with Preprocessing of Text and Pattern 1991 18 ICALP Ravi & Agrawal & Klein, Ordering Problems Approximated: Single-Processor Scheduling and Interval Graph Completion 1990 17 ICALP Naeher & Mehlhorn, LEDA: A Library of Efficient Data Types and Algorithms 1990 17 ICALP Dietzfelbinger & Meyer auf der Heide, A New Universal Class of Hash Functions and Dynamic Hashing in Real Time 1990 17 ICALP Riecke, A Complete and Decidable Proof System for Call-by-Value Equalities 1990 17 ICALP Schwartzbach, Static Correctness of Hierarchical Procedures 1990 17 ICALP Malecki, Generic Terms Having No Polymorphic Types 1990 17 ICALP Krob, A Complete System of B-Rational Identities 1990 17 ICALP de Luca & Varrichio, On Non-counting Regular Classes 1990 17 ICALP Anselmo, Two-way Automata with Multiplicities 1990 17 ICALP Kuich, omega-Continuous Semirings, Algebraic Systems and Pushdown Automata 1990 17 ICALP Geffert, Nondeterministic Computations in Sublogarithmic Space and Space Constructibility 1990 17 ICALP Wiedermann, Normalizing and Accelerating RAM Computations and the Problem of Reasonable Space Measures 1990 17 ICALP Watanabe, A Formal Study of Learning via Queries 1990 17 ICALP Jain & Sharma, Language Learning by a ``Team'' 1990 17 ICALP Milner, Functions as Processes 1990 17 ICALP Jagadeesan & Panangaden, A Domain-theoretic Model for a Higher-order Process Calculus 1990 17 ICALP Droste, Concurrency, Automata and Domains 1990 17 ICALP Hennessy & Ingolfsdottir, A Theory of Communicating Processes with Value-passing 1990 17 ICALP Flajolet & Sipala & Steyaert, Analytic Variations on the Common Subexpression Problem 1990 17 ICALP Cheriyan & Hagerup & Mehlhorn, Can a Maximum Flow be Computed in o(nm) Time? 1990 17 ICALP Razborov, On the Distributional Complexity of Disjointness 1990 17 ICALP Kranakis & Krizanc & van den Berg, Computing Boolean Functions on Anonymous Networks 1990 17 ICALP Goldreich & Krawczyk, On the Composition of Zero-Knowledge Proof Systems 1990 17 ICALP Book & Lutz & Tang, Additional Queries to Random and Pseudorandom Oracles 1990 17 ICALP Rabinovich & Trakhtenbrot, Communication among Relations 1990 17 ICALP Panangaden & Shanbhogue & Stark, Stability and Sequentiality in Dataflow Networks 1990 17 ICALP Alur & Dill, Automata for Modeling Real-Time Systems 1990 17 ICALP Courcoubetis & Yannakakis, Markov Decision Processes and Regular Events 1990 17 ICALP Klop, Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond 1990 17 ICALP Verma & Ramakrishnan, Nonoblivious Normalization Algorithms for Nonlinear Rewrite Systems 1990 17 ICALP Palamidessi, Algebraic Properties of Idempotent Substitutions 1990 17 ICALP Dobkin & Kirkpatrick, Determining the Separation of Preprocessed Polyhedra - A Unified Approach 1990 17 ICALP Guibas & Knuth & Sharir, Randomized Incremental Construction of Delaunay and Voronoi Diagrams 1990 17 ICALP Cole & Goodrich & O'Dunlaing, Merging Free Trees in Parallel for Efficient Voronoi Diagram Construction 1990 17 ICALP Johnson, Local Optimization and the Traveling Salesman Problem 1990 17 ICALP Jerrum & Sinclair, Polynomial-time Approximation Algorithms for the Ising Model 1990 17 ICALP Savage & Wloka, On Parallelizing Graph-Partitioning Heuristics 1990 17 ICALP Choffrut, Iterated Substitutions and Locally Catenative Systems: A Decidability Result in the Binary Case 1990 17 ICALP Clerbout & Latteux & Roos, Decomposition of Partial Commutations 1990 17 ICALP Pelletier, Boolean Closure and Unambiguity of Rational Sets 1990 17 ICALP Larsen & Xinxin, Compositionality Through an Operational Semantics of Contexts 1990 17 ICALP Parrow, Structural and Behavioural Equivalences of Networks 1990 17 ICALP Peled & Pnueli, Proving Partial Order Liveness Properties 1990 17 ICALP de Boer, A Proof System for the Parallel Object-Oriented Language POOL 1990 17 ICALP Blum, A New Approach to Maximum Matching in General Graphs 1990 17 ICALP Di Battista & Tamassia, On-Line Graph Algorithms with SPQR-Trees 1990 17 ICALP Pan & Reif, On the Bit-Complexity of Discrete Solutions of PDEs: Compact Multigrid 1990 17 ICALP Friso Groote & Vaandrager, An Efficient Algorithm for Branching Bisimulation and Stuttering Equivalence 1990 17 ICALP Jones, Partial Evaluation, Self-application and Types 1990 17 ICALP Tucker & Wainer & Zucker, Provable Computable Functions on Abstract Data Types 1990 17 ICALP Comon, Equational Formulas in Order-Sorted Algebras 1990 17 ICALP Goodrich & Atallah & Overmars, An Input-Size/Output-Size Trade-Off in the Time-Complexity of Rectilinear Hidden Surface Removal 1990 17 ICALP Alt & Bloemer & Godeau & Wagener, Approximation of Convex Polygons 1990 17 ICALP Hoffmann, On the Rectilinear Art Gallery Problem 1990 17 ICALP Matias & Vishkin, On Parallel Hashing and Integer Sorting 1990 17 ICALP Ragde, The Parallel Simplicity of Compaction and Chaining 1990 17 ICALP Moller, The Importance of the Left Merge Operator in Process Algebras 1990 17 ICALP Prasad & Giacalone & Mishra, Operational and Algebraic Semantics for Facile: A Symmetric Integration of Concurrent and Functional Programming 1989 16 ICALP Abadi & Lamport & Wolper, Realizable and Unrealizable Specifications of Reactive Systems 1989 16 ICALP Allender, Limitations of the Upward Separation Technique (Preliminary Version) 1989 16 ICALP Allender & Hemachandra, Lower Bounds for the Low Hierarchy (Extended Abstract) 1989 16 ICALP Baeza-Yates & Gonnet, Efficient Text Searching of Regular Expressions 1989 16 ICALP Beauquier & Pin, Factors of Words 1989 16 ICALP Berman & Garay, Asymptotically Optimal Distributed Consensus (Extended Abstract) 1989 16 ICALP Bilardi & Moitra, Time Lower Bounds for CREW-PRAM Computation of Monotone Functions 1989 16 ICALP Bohm, Subduing Self-Application 1989 16 ICALP Brassard & Crepeau & Yung, Everything in NP Can Be Argued in Perfect Zero-Knowledge in a Bounded Number of Rounds 1989 16 ICALP Breazu-Tannen & Gallier, Polymorphic Rewriting Conserves Algebraic Strong Normalization and Confluence 1989 16 ICALP Bruyere, Completion of Finite Codes with Finite Deciphering Delay 1989 16 ICALP Cardone, Relational Semantics for Recursive Types and Bounded Quantification 1989 16 ICALP Chazelle & Edelsbrunner & Guibas & Sharir, A Singly-Exponential Stratification Scheme for Real Semi-Algebraic Varieties and its Applications 1989 16 ICALP Colson, About Primitive Recursive Algorithms 1989 16 ICALP Courcelle, The Definability of Equational Graphs in Monadic Second-Order Logic 1989 16 ICALP Culik & Harju, Dominoes and the Regularity of DNA Splicing Languages 1989 16 ICALP Darondeau & Degano, Causal Trees 1989 16 ICALP Dershowitz & Kaplan & Plaisted, Infinite Normal Forms (Preliminary Version) 1989 16 ICALP Ehrig & Pepper & Orejas, On Recent Trends in Algebraic Specification 1989 16 ICALP Engelfriet & Hoogeboom, Automata with Storage on Infinite Words 1989 16 ICALP Eppstein & Galil, Parallel Algorithmic Techniques for Combinatorial Computation 1989 16 ICALP Feldman & Impagliazzo & Naor & Nisan & Rudich & Shamir, On Dice and Coins: Models of Computation for Random Generation 1989 16 ICALP Feldman & Micali, An Optimal Probabilistic Algorithm for Synchronous Byzantine Agreement 1989 16 ICALP Fussel & Ramachandran & Thurimella, Finding Triconnected Components by Local Replacements (Extended Abstract) 1989 16 ICALP Galil & Park, An Improved Algorithm for Approximate String Matching 1989 16 ICALP Gambosi & Nardelli & Talamo, A Pointer-Free Data Structure for Merging Heaps and Min-Max Heaps 1989 16 ICALP Groote & Vaandrager, Structured Operational Semantics and Bisimulation as a Congruence (Extended Abstract) 1989 16 ICALP Hagerup & Nowak, Parallel Retrieval of Scattered Information 1989 16 ICALP Hastad, Tensor Rank is NP-complete 1989 16 ICALP Hochbaum & Shanthikumar, The Complexity of Nonlinear Separable Optimization 1989 16 ICALP Kenyon-Mathieu & Vitter, General Methods for the Analysis of the Maximal Size of Dynamic Data Structures (Extended Abstract) 1989 16 ICALP Li & Vitanyi, How to Share Concurrent Asynchronous Wait-Free Variables (Preliminary Version) 1989 16 ICALP Li & Vitanyi, A New Approach to Formal Language Theory by Kolmogorov Complexity (Preliminary Version) 1989 16 ICALP Louchard & Randrianarimanana & Schott, Dynamic Algorithms in D. E. Knuth's Model: A Probabilistic Analysis 1989 16 ICALP Manna & Pnueli, Completing the Temporal Picture 1989 16 ICALP Mansour & Schieber & Tiwari, Lower Bounds for Computations with the Floor Operation 1989 16 ICALP Mason & Talcott, Programming, Transforming and Proving with Function Abstractions and Memories 1989 16 ICALP McKenzie & Therien, Automata Theory Meets Circuit Complexity (Extended Abstract) 1989 16 ICALP Mehlhorn & Paul, Two Versus One Index Register and Modifiable Versus Non-Modifiable Programs 1989 16 ICALP Papadimitriou & Yannakakis, Shortest Paths Without a Map (Extended Abstract) 1989 16 ICALP Parisi-Presicce, Modular System Design Applying Graph Grammars Techniques 1989 16 ICALP Perrin, Partial Communications 1989 16 ICALP Pnueli & Rosner, On the Synthesis of an Asynchronous Reactive Module 1989 16 ICALP Pruhs & Manber, The Complexity of Controlled Selection 1989 16 ICALP Raghavan & Snir, Memory Versus Randomization in On-Line Algorithms (Extended Abstract) 1989 16 ICALP Reynolds, Syntactic Control of Interference, Part 2 1989 16 ICALP Steffen, Characteristic Formulae 1989 16 ICALP Toran, A Combinatorial Technique for Separating Counting Complexity Classes 1989 16 ICALP Tucker & Zucker, Horn Programs and Semicomputable Relations on Abstract Structures 1989 16 ICALP Winskel, A Note on Model Checking the Modal nu-Calculus 1989 16 ICALP Zhang, DI-Domains as Information Systems (Extended Abstract) 1988 15 ICALP Aggarwal & Chandra, Communication Complexity of PRAMs (Preliminary Version) 1988 15 ICALP Albert & Fages, Average Case Complexity Analysis of the RETE Multi-Pattern Match Algorithm 1988 15 ICALP Arnborg & Lagergren & Seese, Problems Easy for Tree-Decomposable Graphs (Extended Abstract) 1988 15 ICALP Back & Kurki-Suonio, Serializability in Distributed Systems with Handshaking 1988 15 ICALP Bajaj & Kim, Algorithms for Planar Geometric Models 1988 15 ICALP Benedek & Itai, Nonuniform Learnability 1988 15 ICALP Berstel & Reutenauer, Zeta Functions of Recognizable Languages 1988 15 ICALP Bodlaender, Dynamic Programming on Graphs with Bounded Treewidth 1988 15 ICALP Chang & Ibarra & Palis, Efficient Simulations of Simple Models of Parallel Computation by Time-Bounded ATM's and Space-Bounded TM's 1988 15 ICALP Cole & Salowe & Steiger & Szemeredi, Optimal Slope Selection 1988 15 ICALP Cori & Metivier, Approximation of a Trace, Asynchronous Automata and the Ordering of Events in a Distributed System 1988 15 ICALP Culik, New Techniques for Proving the Decidability of Equivalence Problems 1988 15 ICALP Diekert, Transitive Orientations, Mobius Functions, and Complete Semi-Thue Systems for Free Partially Commutative Monoids 1988 15 ICALP Dietzfelbinger & Maass, The complexity of Matrix Transposition on One-tape Off-line Turing Machines with Output Tape 1988 15 ICALP Edelsbrunner, Geometric Structures in Computational Geometry 1988 15 ICALP Edelsbrunner & Guibas & Pach & Pollack & Seidel & Sharir, Arrangements of Curves in the Plane--Topology, Combinatorics, and Algorithms 1988 15 ICALP Eppstein, Reset Sequences for Finite Automata with Application to Design of Parts Orienters 1988 15 ICALP Flajolet & Gardy & Thimonier, Random Allocations and Probabilistic Languages 1988 15 ICALP Gruska, Systolic Architectures, Systems and Computations 1988 15 ICALP Hartmanis, New Developments in Structural Complexity Theory 1988 15 ICALP Kirchner & Kirchner & Meseguer, Operational Semantics of OBJ-3 1988 15 ICALP Kirschenhofer & Prodinger & Szpankowski, Do We Really Need to Balance Patricia Tries (Extended Abstract) 1988 15 ICALP Kok & Rutten, Contractions in Comparing Concurrency Semantics 1988 15 ICALP Kruskal & Rudolph & Snir, A Complexity Theory of Efficient Parallel Algorithms (Extended Abstract) 1988 15 ICALP Kucera & Marchetti-Spaccamela & Protasi, On the Learnability of DNF Formulae 1988 15 ICALP Lautemann, Efficient Algorithms on Context-free Graph Languages 1988 15 ICALP Lengauer & Wanke, Efficient Analysis of Graph Properties on Context-free Graph Languages (Extended Abstract) 1988 15 ICALP Lingas & Syslo, A Polynomial-time Algorithm for Subgraph Isomorphism of Two-connected Series-Parallel Graphs 1988 15 ICALP Mehlhorn & Yap, Constructive Hopf's Theorem: Or How to Untangle Closed Planar Curves 1988 15 ICALP Niemi, Maximal Dense Intervals of Grammar Forms 1988 15 ICALP Panangaden & Stark, Computations, Residuals, and the Power of Indeterminacy 1988 15 ICALP Rajasekaran & Reif, Nested Annealing: A Provable Improvement to Simulated Annealing 1988 15 ICALP Ramesh & Ramakrishnan, Nonlinear Pattern Matching in Trees 1988 15 ICALP Tao, Invertibility of Linear Finite Automata over a Ring 1988 15 ICALP Rohnert, Moving Discs between Polygons 1988 15 ICALP Rudich & Berman, Optimal Circuits and Transitive Automorphism Groups 1988 15 ICALP Schafer, A Kleene-Presburgerian Approach to Linear Production Systems 1988 15 ICALP Simon, On Minimum Flow and Transitive Reduction 1988 15 ICALP Spehner, La Reconnaissance des Facteurs d'un Langage Fini dans un Texte en Temps Lineaire 1988 15 ICALP Straubing & Therien & Thomas, Regular Languages Defined with Generalized Quantifiers 1988 15 ICALP Tamassia, A Dynamic Data Structure for Planar Graph Embedding (Extended Abstract) 1988 15 ICALP Tang & Book, Separating Polynomial-time Turing and Truth-table Reductions by Tally Sets (Preliminary Report) 1988 15 ICALP Tel, Assertional Verification of a Timer-based Protocol 1988 15 ICALP Thatte, Type Inference with Partial Types 1988 15 ICALP Thiagarajan, Some Behavioural Aspects of Net Theory 1988 15 ICALP Turakainen, The Equivalence of DGSM Replications on Q-Rational Languages is Decidable 1988 15 ICALP Vazirani & Yannakakis, Pfaffian Orientations 0/1 Permanents, and Even Cycles in Directed Graphs 1988 15 ICALP Wagner, On Restricting the Access to an NP-Oracle 1988 15 ICALP Watanabe, On <=^p_1-tt Sparseness and Nondeterministic Complexity Classes (Extended Abstract) 1988 15 ICALP Weijland, Semantics for Logic Programs without Occur Check 1988 15 ICALP You, Outer Narrowing for Equational Theories Based on Constructors 1987 14 ICALP Pitt & Smith, Probability and Plurality for Aggregations of Learning Machines 1987 14 ICALP Abdallah, Logic Programming with Ions (Icons?) 1987 14 ICALP Dybjer, Inverse Image Analysis 1987 14 ICALP Holldobler, A Unification Algorithm for Confluent Theories 1987 14 ICALP Diekert, On the Knuth-Bendix Completion for Concurrent Processes 1987 14 ICALP Hsiang & Rusinowitch, On Word Problems in Equational Theories 1987 14 ICALP Shyamasundar & Narayana & Pitassi, Semantics for Nondeterministic Asynchronous Broadcast Networks 1987 14 ICALP Baeten & van Glabbeek, Another Look at Abstraction in Process Algebra 1987 14 ICALP Gerth & Boucher, A Timed Failures Model for Extended Communicating Processes 1987 14 ICALP Graf & Sifakis, Readiness Semantics for Regular Processes with Silent Actions 1987 14 ICALP Larsen & Milner, Verifying a Protocol Using Relativized Bisimulation 1987 14 ICALP Karhumaki, On Recent Trends in Formal Language Theory 1987 14 ICALP Barrington & Therien, Non-Uniform Automata Over Groups 1987 14 ICALP Beququier, Minimal Automaton of a Rational Cover 1987 14 ICALP Choffrut & Duboc, A Star-Height Problem in Free Monoids with Partial Commutations 1987 14 ICALP Johnson, Single-Valued Finite Transduction 1987 14 ICALP Kuich, The Kleene and the Parikh Theorem in Complete Semirings 1987 14 ICALP Metivier, An Algorithm for Computing Asynchronous Automata in the Case of Acyclic Non-Commutation Graphs 1987 14 ICALP Pin, On the Languages Accepted by Finite Reversible Automata 1987 14 ICALP Aalbersberg & Hoogeboom, Decision Problems for Regular Trace Languages 1987 14 ICALP Chytil & Demner, Panic Mode without Panic 1987 14 ICALP Hafer & Thomas, Computation Tree Logic CTL* and Path Quantifiers in the Monadic Theory of the Binary Tree 1987 14 ICALP Josko, Modelchecking of CTL Formulae under Liveness Assumptions 1987 14 ICALP Lodaya & Thiagarajan, A Modal Logic for a Subclass of Event Structures 1987 14 ICALP Hagerup & Chrobak & Diks, Parallel 5-Colouring of Planar Graphs 1987 14 ICALP Landau & Schieber & Vishkin, Parallel Construction of a Suffix Tree 1987 14 ICALP Li & Yesha, The Probabilistic and Deterministic Parallel Complexity of Symmetric Functions 1987 14 ICALP Ramesh & Verma & Krishnaprasad & Ramakrishnan, Term Matching on Parallel Computers 1987 14 ICALP van Leeuwen & Santoro & Urrutia & Zaks, Guessing Games and Distributed computations in Synchronous Networks 1987 14 ICALP Schwartz & Sharir, On the Bivariate Function Minimization Problem and Its Applications to Motion Planning 1987 14 ICALP Edelsbrunner & Rote & Welzl, Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane 1987 14 ICALP Levcopoulos & Lingas & Sack, Nearly Optimal Heuristics for Binary Search Trees with Geometric Generalizations 1987 14 ICALP Paz & Schnorr, Approximating Integer Lattices by Lattices with Cyclic Factor Groups 1987 14 ICALP Cai & Meyer, On the Complexity of Graph Critical Uncolorability 1987 14 ICALP Gambosi & Nesetril & Talamo, Posets, Boolean Representations and Quick Path Searching 1987 14 ICALP Miyano, The Lexicographically First Maximal Subgraph Problems: P-Completeness and NC Algorithms 1987 14 ICALP Muller, Uniform Computational Complexity of Taylor Series 1987 14 ICALP Marchetti-Spaccamela & Vercellis, Efficient On-line Algorithms for the Knapsack Problem 1987 14 ICALP Dietzfelbinger, Lower Bounds for Sorting of Sums 1987 14 ICALP Aggarwal & Vitter, The I/O Complexity of Sorting and Related Problems 1987 14 ICALP Mehlhorn & Naher & Alt, A Lower Bound for the Complexity of the Union-Split-Find Problem 1987 14 ICALP Tsakalidis, The Nearest Common Ancester in a Dynamic Tree 1987 14 ICALP Finkel, A Generalization of the Procedure of Karp and Miller to Well Structured Transition Systems 1987 14 ICALP Howell & Rosier, Completeness Results for Reachability, Containment, and Equivalence with Respect to Conflict-Free Vector Replacement Systems 1987 14 ICALP Kreowski, Partial Algebras Flow from Algebraic Specifications 1987 14 ICALP Lange & Jenner & Kirsig, The Logarithmic Alternation Hierarchy Collapses: A Sigma_2^L = A Pi_2^L 1987 14 ICALP Beaudry, Testing Membership in Commutative Transformation Semigroups 1987 14 ICALP Ibarra & Jiang, On the Computing Power of One-way Cellular Arrays 1987 14 ICALP Valiant, Recent Developments in the Theory of Learning (Abstract) 1986 ICALP Allender, Characterizations of PUNC and Precomputation 1986 ICALP Arques & Francon & Guichet & Guichet, Comparaison of Algorithms Controlling Concurrent Access to a Database: A Combinatorial Approach 1986 ICALP Aurenhammer, A New Duality Result Concerning Voronoi Diagrams 1986 ICALP Averbuch & Galil & Winograd, Classification of all the Minimal Bilinear Algorithms for Computing the Coefficients of the Product of Two Polynomials Modulo a Polynomial 1986 ICALP Book & Orponen & Russo & Watanabe, On Exponential Lowness 1986 ICALP Borodin & Fich & Meyer auf der Heide & Upfal & Wigderson, A Tradeoff Between Search and Update Time for the Implicit Dictionary Problem 1986 ICALP Brandenburg, Intersections of Some Families of Languages 1986 ICALP Brzozowski & Seger, Correspondence between Ternary Simulation and Binary Race Analysis in Gate Networks 1986 ICALP Choffrut & Schutzenberger, Counting with Rational Functions 1986 ICALP De Felice, Finite Biprefix Sets of Paths in a Graph 1986 ICALP Dymond & Ruzzo, Parallel RAMs with Owned Global Memory and Deterministic Context-Free Language Recognition 1986 ICALP Fribourg, A Strong Restriction of the Inductive Completion Procedure 1986 ICALP Goralcik & Kubek, On Discerning Words by Automata 1986 ICALP Hartmanis & Hemachandra, Complexity Classes without Machines: On Complete Languages for UP 1986 ICALP Hartmanis & Li & Yesha, Containment, Separation, Complete Sets, and Immunity of Complexity Classes 1986 ICALP Hermann & Privara, On Nontermination of Knuth-Bendix Algorithm 1986 ICALP Hromkovic, Tradeoffs for Language Recognition on Parallel Computing Models 1986 ICALP Johnson, Rational Equivalence Relations 1986 ICALP Kirschenhofer & Prodinger, Some Further Results on Digital Search Trees 1986 ICALP Kraus & Lehmann, Knowledge, Belief and Time 1986 ICALP Lai, A Termination Detector for Static and Dynamic Distributed Systems With Asynchronous Non-First-In-First-Out Communication 1986 ICALP Lange, Decompositions of Nondeterministic Reductions 1986 ICALP Lengauer, Hierarchical Planarity Testing Algorithms 1986 ICALP Lisper, Synthesis and Equivalence of Concurrent Systems 1986 ICALP Mannila & Ukkonen, The Set Union Problem with Backtracking 1986 ICALP Mascle, Torsion Matrix Semigroups and Recognizable Transductions 1986 ICALP Metivier, On Recognizable Subsets of Free Partially Commutative Monoids 1986 ICALP Monien & Sudborough, Min Cut is NP-Complete for Edge Weighted Trees 1986 ICALP Muller & Saoudi & Schupp, Alternating Automata, the Weak Monadic Theory of the Tree, and its Complexity 1986 ICALP Muller, Subpolynomial Complexity Classes of Real Functions and Real Numbers 1986 ICALP Niwinksi, On Fixed-Points Clones 1986 ICALP Pecuchet, Etude Syntaxique des Parties Reconnaissables de Mots Infinis 1986 ICALP Phillips, Refusal Testing 1986 ICALP Reed & Roscoe, A Timed Model for Communicating Sequential Processes 1986 ICALP Regan, A Uniform Reduction Theorem 1986 ICALP Rosier & Yen, On the Complexity of Deciding Fair Termination of Probabilistic Concurrent Finite-State Programs 1986 ICALP Schnorr, A More Efficient Algorithm for Lattice Basis Reduction 1986 ICALP Schoening, Lower Bounds by Recursion Theoretic Arguments 1986 ICALP Shavit & Francez, A New Approach to Detection of Locally Indicative Stability 1986 ICALP Simon, An Improved Algorithm for Transitive Closure on Acyclic Digraphs 1986 ICALP Spehner, Un Algorithme Determinant les Melanges de Deux Mots 1986 ICALP Spirakis & Tsakalidis, A Very Fast, Practical Algorithm for Finding a Negative Cycle in a Digraph 1986 ICALP Stirling, A Compositional Reformulation of Owicki-Gries's Partial Correctness Logic for a Concurrent While Language 1986 ICALP Straubing, Semigroups and Languages of Dot-Depth 2 1986 ICALP Varman & Doshi, A Parallel Vertex Insertion Algorithm for Minimum Spanning Trees 1986 ICALP Wagner, More Complicated Questions about Maxima and Minima, and Some Closures of NP 1986 ICALP Willard, Lower Bounds for Dynamic Range Query Problems That Permit Subtraction 1986 ICALP You & Subrahmanyam, E-Unification Algorithms for a Class of Confluent Term Rewriting Systems 1985 ICALP Beauquier & Nivat, About Rational Sets of Factors of a Bi-Infinite Word 1985 ICALP Ben-Or & Goldreich & Micali & Rivest, A Fair Protocol for Signing Contracts 1985 ICALP Bilardi & Preparata, The Influence of Key Length on the Area-Time Complexity of Sorting 1985 ICALP Bouge, Repeated Synchronous Snapshots and their Implementation in CSP 1985 ICALP Bucher & Ehrenfeucht & Haussler, On Total Regulators Generated by Derivation Relations 1985 ICALP Chazelle & Edelsbrunner, Optimal Solutions for a Class of Point Retrieval Problems 1985 ICALP Chazelle & Guibas, Fractional Cascading: A Data Structuring Technique with Geometric Applications 1985 ICALP Chrobak, Hierarchies of One-Way Multihead Automata Languages 1985 ICALP Cole, Partitioning Point Sets in 4 Dimensions 1985 ICALP Coppo, A Completeness Theorem for Recursively Defined Types 1985 ICALP Curien, Categorical Combinatory Logic 1985 ICALP de Bakker & Ch. Meyer & Olderog, Infinite Streams and Finite Observations in the Semantics of Uniform Concurrency 1985 ICALP de Bakker & Kok, Towards a Uniform Topological Treatment of Streams and Functions on Streams 1985 ICALP De Bra, Imposed-Functional Dependencies Inducing Horizontal Decompositions 1985 ICALP Engelfriet & Vogler, Characterization of High Level Tree Transducers 1985 ICALP Flajolet, Ambiguity and Transcendence 1985 ICALP Fortune, A Fast Algorithm for Polygon Containment by Translation 1985 ICALP Furer, Deterministic and Las Vegas Primality Testing Algorithms 1985 ICALP Gabow & Stallman, Efficient Algorithms for Graphic Matroid Intersection and Parity 1985 ICALP Goguen & Jouannaud & Meseguer, Operational Semantics for Order-Sorted Algebra 1985 ICALP Gunter, A Universal Domain Technique for Profinite Posets 1985 ICALP Hansel, A Simple Proof of the Skolem-Mahler-Lech Theorem 1985 ICALP Hartmanis & Immerman, On Complete Problems for NP intersect CoNP 1985 ICALP Hennessy, An Algebraic Theory of Fair Asynchronous Communicating Processes 1985 ICALP Hortala-Gonzalez & Rodriguez-Artalejo, Hoare's Logic for Nondeterministic Regular Programs: A Nonstandard Completeness Theorem 1985 ICALP Hrbacek, Powerdomains as Algebraic Lattices 1985 ICALP Jerrum, Random Generation of Combinatorial Structures from a Uniform Distribution 1985 ICALP Johnson, Do Rational Equivalence Relations have Regular Cross-Sections? 1985 ICALP Jung, On Probabilistic Time and Space 1985 ICALP Karlsson & Munro & Robertson, The Nearest Neighbor Problem on Bounded Domains 1985 ICALP Kaufmann & Mehlhorn, Routing through a Generalized Switchbox 1985 ICALP Keranen, On k-Repetition Free Words Generated by Length Uniform Morphisms over a Binary Alphabet 1985 ICALP Kortelainen, Every Commutative Quasirational Language is Regular 1985 ICALP Kurtz & Manber, A Probabilistic Distributed Algorithm for Set Intersection and its Analysis 1985 ICALP Landau & Yung & Galil, Distributed Algorithms in Synchronous Broadcasting Networks 1985 ICALP Larsen, A Context Dependent Equivalence Between Processes 1985 ICALP Li, Lower Bounds by Kolmogorov-Complexity 1985 ICALP Lovasz, Vertex Packing Algorithms 1985 ICALP Luby & Ragde, A Bidirectional Shortest-Path Algorithm with Good Average-Case Behavior 1985 ICALP Main & Bucher & Haussler, Applications of an Infinite Squarefree CO-CFL 1985 ICALP Manna & Waldinger, Special Relations in Automated Deduction 1985 ICALP Mehlhorn & Tsakalidis, Dynamic Interpolation Search 1985 ICALP Orponen & Russo & Schoening, Polynomial Levelability and Maximal Complexity Cores 1985 ICALP Pin, Finite Group Topology and p-adic Topology for Free Monoids 1985 ICALP Pnueli, Linear and Branching Structures in the Semantics and Logics of Reactive Systems 1985 ICALP Sippu & Soisalon-Soininen, On the Use of Relational Expressions in the Design of Efficient Algorithms 1985 ICALP Sistla & Vardi & Wolper, The Complementation Problem for Buchi Automata with Applications to Temporal Logic 1985 ICALP Stirling, A Complete Compositional Modal Proof System for a Subset of CCS 1985 ICALP Varman & Ramakrishnan, On Matrix Multiplication Using Array Processors 1985 ICALP Vishkin, Optimal Parallel Pattern Matching in Strings 1985 ICALP Zwiers & de Roever & van Emde Boas, Compositionality and Concurrent Networks: Soundness and Completeness of a Proofsystem 1984 ICALP Abiteboul & Ginsburg, Tuple Sequences and Indexes 1984 ICALP Afrati & Papadimitriou & Papageorgiou, The Complexity of Cubical Graphs 1984 ICALP Ambos-Spies & Fleischhack & Huwig, P-Generic Sets 1984 ICALP Atzeni & Morfuni, Functional Dependencies and Disjunctive Existence Constraints in Database Relations with Null Values 1984 ICALP Bergstra & Klop, The Algebra of Recursively Defined Processes and the Algebra of Regular Processes 1984 ICALP Bidoit, Algebraic Specification of Exception Handling and Error Recovery by Means of Declarations and Equations 1984 ICALP Blumer & Blumer & Ehrenfeucht & Haussler & McConnell, Building the Minimal DFA for the Set of All Subwords of a Word On-line in Linear Time 1984 ICALP Chazelle & Ottmann & Soisalon-Soininen & Wood, The Complexity and Decidability of Separation 1984 ICALP Colbourn & Proskurowski, Concurrent Transmissions in Broadcast Networks 1984 ICALP Crochemore, Linear Searching for a Square in a Word 1984 ICALP Dybjer, Domain Algebras 1984 ICALP Fagin & Vardi, The Theory of Data Dependencies--An Overview 1984 ICALP Ferment, Principality Results about Some Matrix Language Families 1984 ICALP Fribourg, Oriented Equational Clauses as a Programming Language 1984 ICALP Gardy & Puech, Relational Algebra Operations and Sizes of Relations 1984 ICALP Girault-Beauquier, Some Results about Finite and Infinite Behaviours of a Pushdown Automaton 1984 ICALP Goltz & Mycroft, On the Relationship of CCS and Petri Nets 1984 ICALP Gouda & Rosier, Communicating Finite State Machines with Priority Channels 1984 ICALP Graf & Sifakis, A Modal Characterization of Observational Congruence on Finite Terms of CCS 1984 ICALP Hromkovic, Communication Complexity 1984 ICALP Ibarra & Kim & Rosier, Space and Time Efficient Simulations and Characterizations of Some Restricted Classes of PDAs 1984 ICALP Izumi & Inagaki & Honda, A Complete Axiom System for Algebra of Closed-Regular Expression 1984 ICALP Jerrum, The Complexity of Finding Minimum-Length Generator Sequences 1984 ICALP Jung, On Probabilistic Tape Complexity and Fast Circuits for Matrix Inversion Problems 1984 ICALP Karhumaki, On Three-Element Codes 1984 ICALP Kirschenhofer & Prodinger, Recursion Depth Analysis for Special Tree Traversal Algorithms 1984 ICALP Lagarias, Performance Analysis of Shamir's Attack on the Basic Merkle-Hellman Knapsack Cryptosystem 1984 ICALP Mannila, Measures of Presortedness and Optimal Sorting Algorithms 1984 ICALP Margolis & Pin, Languages and Inverse Semigroups 1984 ICALP Mehlhorn & Preparata, Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time 1984 ICALP Nait Abdallah, On the Interpretation of Infinite Computations in Logic Programming 1984 ICALP Paige & Tarjan, A Linear Time Algorithm to Solve the Single Function Coarsest Partition Problem 1984 ICALP Pansiot, Complexite des Facteurs des Mots Infinis Engendres par Morphismes Iteres 1984 ICALP Pecuchet, Automates Boustrophedon, Semi-Groupe de Birget et Monoide Inversif Libre 1984 ICALP Reif & Spirakis, Probabilistic Bidding Gives Optimal Distributed Resource Allocation 1984 ICALP Reisig, Partial Order Semantics versus Interleaving Semantics for CSP-like Languages and its Impact on Fairness 1984 ICALP Restivo & Reutenauer, Cancellation, Pumping and Permutation in Formal Languages 1984 ICALP Ron & Rosemberg & Pnueli, A Hardware Implementation of the CSP Primitives and its Verification 1984 ICALP Rosenberg, The VLSI Revolution in Theoretical Circles 1984 ICALP Schoenhage, Factorization of Univariate Integer Polynomials by Diophantine Approximation and an Improved Basis Reduction Algorithm 1984 ICALP Schoening, Robust Algorithms: A Different Approach to Oracles 1984 ICALP Spencer & Mayr, Node Weighted Matching 1984 ICALP Streett & Emerson, The Propositional Mu-Calculus is Elementary 1984 ICALP Tsakalidis, AVL-Trees for Localized Search 1984 ICALP Vitanyi, The Simple Roots of Real-Time Computation Hierarchies 1984 ICALP Vitter, Computational Complexity of an Optical Disk Interface 1984 ICALP Welzl, Encoding Graphs by Derivations and Implications for the Theory of Graph Grammars 1984 ICALP Willard, Sampling Algorithms for Differential Batch Retrieval Problems 1983 ICALP Abramsky, On Semantic Foundations for Applicative Multiprogramming 1983 ICALP Apt & Delporte, An Axiomatization of the Intermittent Assertion Method Using Temporal Logic 1983 ICALP Arnold, Topological Characterization of Infinite Behaviours of Transition Systems 1983 ICALP Brookes & Rounds, Behavioural Equivalence Relations Induced by Programming Logics 1983 ICALP Brookes, On the Relationship of CCS and CSP 1983 ICALP Chandra & Fortune & Lipton, Lower Bounds for Constant Depth Circuits for Prefix Problems 1983 ICALP Choffrut & Karhumaki, Test Sets for Morphisms with Bounded Delay 1983 ICALP Cohen & Lehmann & Pnueli, Symmetric and Economical Solutions to the Mutual Exclusion Problem in a Distributed System 1983 ICALP Culik & Salomaa, Ambiguity and Decision Problems Concerning Number Systems 1983 ICALP Darondeau & Kott, On the Observational Semantics of Fair Parallelism 1983 ICALP de Bakker & Bergstra & Klop & Meyer, Linear Time and Branching Time Semantics for Recursion with Merge 1983 ICALP de Bakker & Zucker, Processes and Fair Semantics for the ADA Rendez-vous 1983 ICALP de Bra & Paredaens, Conditional Dependencies for Horizontal Decompositions 1983 ICALP de Nicola & Hennessy, Testing Equivalences for Processes 1983 ICALP Dehne, An O(N^4) Algorithm to Construct All Voronoi Diagrams for K Nearest Neighbor Searching 1983 ICALP Delest & Viennot, Algebraic Languages and Polyminoes Enumeration 1983 ICALP Edelsbrunner & Welzl, On the Number of Equal-Sized Semispaces of a Set of Points in the Plane 1983 ICALP Ehrig & Wagner & Thatcher, Algebraic Specifications with Generating Constraints 1983 ICALP Fraenkel, Wythoff Games, Continued Fractions, Cedar Trees and Fibonacci Searches 1983 ICALP Gabarro, Initial Index: A New Complexity Function for Languages 1983 ICALP Ganzinger, Modular Compiler Descriptions Based on Abstract Semantic Data Types 1983 ICALP Goltz & Reisig, Processes of Place/Transition-Nets 1983 ICALP Halpern & Manna & Moszkowski, A Hardware Semantics Based on Temporal Intervals 1983 ICALP Hambrusch & Simon, Lower Bounds for Solving Undirected Graph Problems on VLSI 1983 ICALP Hart & Sharir, Concurrent Probabilistic Program, or: How To Schedule If You Must 1983 ICALP Hartmanis & Yesha, Computation Times of NP Sets of Different Densities 1983 ICALP Hsiang & Dershowitz, Rewrite Methods for Clausal and Non-Clausal Theorem Proving 1983 ICALP Indermark, Complexity of Infinite Trees 1983 ICALP Jouannaud & Kirchner & Kirchner, Incremental Construction of Unification Algorithms in Equational Theories 1983 ICALP Kamimura & Tang, Effectively Given Spaces 1983 ICALP Kamimura, Tree Automata and Attribute Grammars 1983 ICALP Karhumaki, A Note on Intersections of Free Submonoids of a Free Monoid 1983 ICALP Lang & Schimmler & Schmeck & Schroeder, A Fast Sorting Algorithm for VLSI 1983 ICALP Lange, Context-free Controlled ET0L Systems 1983 ICALP Latteux & Leguy, On the Composition of Morphisms and Inverse Morphisms 1983 ICALP Le Rest & Margolis, On the Group Complexity of a Finite Language 1983 ICALP Lehmann & Shelah, Reasoning with Time and Chance 1983 ICALP Lenstra, Factoring Multivariate Integral Polynomials 1983 ICALP Lescarne & Steyaert, On the Study of Data Structures: Binary Tournaments with Repeated Keys 1983 ICALP Makedon & Sudborough, Minimizing Width in Linear Layouts 1983 ICALP Manna & Pnueli, Proving Precedence Properties: The Temporal Way 1983 ICALP Moeller, An Algebraic Semantics for Busy (Data-Driven) and Lazy (Demand-Driven) Evaluation and Its Application to a Functional Language 1983 ICALP Munro & Poblete, Searchability in Merging and Implicit Data Structures 1983 ICALP Mycroft & Nielson, Strong Abstract Interpretation Using Power Domains 1983 ICALP Olderog & Hoare, Specification-oriented Semantics for Communicating Processes 1983 ICALP Orponen, Complexity Classes of Alternating Machines with Oracles 1983 ICALP Pansiot, A Propos d'une Conjecture de F. Dejean sur les Repetitions dans les Mots 1983 ICALP Paul & Vishkin & Wagener, Parallel Dictionaries on 2-3 Trees 1983 ICALP Perrin, Varietes de Semigroupes et Mots Infinis 1983 ICALP Pin, Arbres et Hierarchies de Concatenation 1983 ICALP Reif & Sistla, A Multiprocess Network Logic with Temporal and Spatial Modalities 1983 ICALP Sato & Tamaki, Enumeration of Success Patterns in Logic Programs 1983 ICALP Schoening & Book, Immunity 1983 ICALP Smyth, Power Domains and Predicate Transformers: A Topological View 1983 ICALP Spinrad & Valdes, Recognition and Isomorphism of Two Dimensional Partial Orders 1983 ICALP Vitanyi, On the Simulation of Many Storage Heads by a Single One 1983 ICALP von zur Gathen & Kaltofen, Polynomial-Time Factorization of Multivariate Polynomials over Finite Fields 1983 ICALP Winskel, Synchronisation Trees 1983 ICALP Yannakakis & Kanellakis & Cosmadakis & Papadimitriou, Cutting and Partitioning a Graph after a Fixed Pattern 1982 ICALP Back & Mannila, Locality in Modular Systems 1982 ICALP Ben-Ari, On-the-fly Garbage Collection: New Algorithms Inspired by Program Proofs 1982 ICALP Bergstra & Klop, Algebraic Specifications for Parametrized Data Types with Minimal Parameter and Target Algebras 1982 ICALP Berkling & Fehr, A Modification of the lambda-Calculus as a Base for Functional Programming 1982 ICALP Berman & Halpern & Tiuryn, On the Power of Nondeterminism in Dynamic Logic 1982 ICALP Bertoni & Mauri & Sabadini, Equivalence and Membership Problems for Regular Trace Languages 1982 ICALP Blum, On the Power of Chain Rules in Context Free Grammars 1982 ICALP Brandenburg, Extended Chomsky-Schutzenberger Theorems 1982 ICALP Cardelli, Real Time Agents 1982 ICALP Case & Lynes, Machine Inductive Inference and Language Identification 1982 ICALP Comyn & Dauchet, Approximations of Infinitary Objects 1982 ICALP Culik & Karhumaki, On Test Sets and the Ehrenfeucht Conjecture 1982 ICALP Damm & Goerdt, An Automata-Theoretic Characterization of the 0I-Hierarchy 1982 ICALP Dobkin & Kirkpatrick, Fast Detection of Polyhedral Intersections 1982 ICALP Duris & Galil, On Reversal-Bounded Counter Machines and on Pushdown Automata with a Bound on the Size of the Pushdown Store 1982 ICALP Duris & Hromkovic, Multihead Finite State Automata and Concatenation 1982 ICALP Ehrenfeucht & Haussler & Rozenberg, Conditions Enforcing Regularity of Context-Free Languages 1982 ICALP Ehrenfeucht & Rozenberg, Repetitions in Homomorphisms and Languages 1982 ICALP Ehrig & Kreowski, Parameter Passing Commutes with Implementation of Parameterized Data Types 1982 ICALP Faustini, An Operational Semantics for Pure Dataflow 1982 ICALP Fernandez & Thiagarajan, Some Properties of D-Continuous Causal Nets 1982 ICALP Flajolet & Steyaert, A Branching Process Arising in Dynamic Hashing, Trie Searching and Polynomial Factorization 1982 ICALP Gerth, A Sound and Complete Hoare Axiomatization of the ADA Rendezvous 1982 ICALP Goguen & Meseguer, Universal Realization, Persistent Interconnection and Implementation of Abstract Modules 1982 ICALP Gonnet & Munro, Heaps on Heaps 1982 ICALP Goralcikova & Goralcik & Koubek, A Boundary of Isomorphism Completeness in the Lattice of Semigroup Pseudovarieties 1982 ICALP Guttag & Kapur & Musser, Derived Pairs, Overlap Closures, and Rewrite Dominoes: New Tools for Analyzing Term Rewriting Systems 1982 ICALP Harel & Kozen, A Programming Language for the Inductive Sets, and Applications 1982 ICALP Kalorkoti, A Lower Bound for the Formula Size of Rational Functions 1982 ICALP Karhumaki, On the Equivalence Problem for Binary D0L Systems 1982 ICALP Kozen, Results on the Propositional mu-Calculus 1982 ICALP Krevner & Yehudai, An Iteration Theorem for Simple Precedence Languages 1982 ICALP Lingas, The Power of Non-Rectilinear Holes 1982 ICALP Niwinski, Fixed-point Semantics for Algebraic (Tree) Grammars 1982 ICALP Perrin, Completing Biprefix Codes 1982 ICALP Pippenger, Advances in Pebbling 1982 ICALP Plotkin, A Powerdomain for Countable Non-determinism 1982 ICALP Raoult & Sethi, Properties of a Notation for Combining Functions 1982 ICALP Reif, On the Power of Probabilistic Choice in Synchronous Parallel Computations 1982 ICALP Reutenauer, Biprefix Codes and Semisimple Algebras 1982 ICALP Salwicki, Algorithmic Theories of Data Structures 1982 ICALP Sannella & Wirsing, Implementation of Parameterised Specifications 1982 ICALP Schmeck, Algebraic Semantics of Recursive Flowchart Schemes 1982 ICALP Scott, Domains for Denotational Semantics 1982 ICALP Selman & Yacobi, The Complexity of Promise Problems 1982 ICALP Sifakis, Global and Local Invariants in Transition Systems 1982 ICALP Sipser, On Relativization and the Existence of Complete Sets 1982 ICALP Tennent, Semantics of Interference Control 1982 ICALP Vitanyi, Efficient Simulations of Multicounter Machines 1982 ICALP Winskel, Event Structure Semantics for CCS and Related Languages 1981 ICALP Apt & Plotkin, A Cook's Tour of Countable Nondeterminism 1981 ICALP Beeri & Vardi, The Implication Problem for Data Dependencies 1981 ICALP Ben-Ari & Halpern & Pnueli, Finite Models for Deterministic Propositional Dynamic Logic 1981 ICALP Bergstra & Tucker, Algebraically Specified Programming Systems and Hoare's Logic 1981 ICALP Blattner & Latteux, Parikh-Bounded Languages 1981 ICALP Courcelle, An Axiomatic Approach to the Korenjak-Hopcroft Algorithms 1981 ICALP Dershowitz, Termination of Linear Rewriting Systems 1981 ICALP Ehrenfeucht & Rozenberg, On the (Generalized) Post Correspondence Problem with Lists of Length 2 1981 ICALP Engelfriet & File, Passes, Sweeps and Visits 1981 ICALP Fraenkel & Lichtenstein, Computing a Perfect Strategy for n x n Chess Requires Time Exponential in n 1981 ICALP Gurari & Ibarra, The Complexity of Decision Problems for Finite-Turn Multicounter Machines 1981 ICALP Heintz & Sieveking, Absolute Primality of Polynomials is Decidable in Random Polynomial Time in the Number of Variables 1981 ICALP Hong & Mehlhorn & Rosenberg, Cost Tradeoffs in Graph Embeddings, with Applications 1981 ICALP Ibarra & Leininger & Moran, On the Complexity of Simple Arithmetic Expressions 1981 ICALP Istrail, Chomsky-Schutzenberger Representations for Families of Languages and Grammatical Types 1981 ICALP Itai & Konheim & Rodeh, A Sparse Table Implementation of Priority Queues 1981 ICALP Itzhaik & Yehudai, A Decision Procedure for the Equivalence of Two dpdas One of Which is Linear 1981 ICALP Jones, Flow Analysis of Lambda Expressions 1981 ICALP Karhumaki, Generalized Parikh Mappings and Homomorphisms 1981 ICALP King, Alternating Multihead Finite Automata 1981 ICALP Lehmann & Pnueli & Stavi, Impartiality, Justice and Fairness: The Ethics of Concurrent Termination 1981 ICALP Lieberherr, Uniform Complexity and Digital Signatures 1981 ICALP Loeckx, Algorithmic Specifications of Abstract Data Types 1981 ICALP Makowsky, Characterizing Data Base Dependencies 1981 ICALP Makowsky, Errata: Measuring the Expressive Power of Dynamic Logics: An Application of Abstract Model Theory 1981 ICALP Meyer & Mirkowska & Streett, The Deducibility Problem in Propositional Dynamic Logic 1981 ICALP Moriconi & Schwartz, Automatic Construction of Verification Condition Generators from Hoare Logics 1981 ICALP Pearl, The Solution for the Branching Factor of the Alpha-Beta Pruning Algorithm 1981 ICALP Pettorossi, Comparing and Putting Together Recursive Path Ordering, Simplification Orderings and Non-Ascending Property for Termination Proofs of Term Rewriting Systems 1981 ICALP Pin, Langages Reconnaissables et Codage Prefixe Pur 1981 ICALP Pnueli & Zarhi, Realizing an Equational Specification 1981 ICALP Preparata & Vuillemin, Area-Time Optimal VLSI Networks for Computing Integer Multiplication and Discrete Fourier Transform 1981 ICALP Reif, Minimum S-T Cut of a Planar Undirected Network in O(n log^2 n) Time 1981 ICALP Reutenauer, A New Characterization of the Regular Languages 1981 ICALP Schnorr, Refined Analysis and Improvements on Some Factoring Algorithms 1981 ICALP Sethi, Circular Expressions: Elimination of Static Environments 1981 ICALP Shamir, On the Generation of Cryptographically Strong Pseudo-Random Sequences 1981 ICALP Sharir, Data Flow Analysis of Applicative Programs 1981 ICALP Sippu & Soisalon-Soininen, On LALR(k) Testing 1981 ICALP Snir, Proving Lower Bounds for Linear Decision Trees 1981 ICALP Subrahmanyam, Nondeterminism in Abstract Data Types 1981 ICALP Ukkonen, On Size Bounds for Deterministic Parsers 1981 ICALP Ullman, A View of Directions in Relational Database Theory 1981 ICALP Welzl, On the Density of Color-Families 1980 ICALP Ainhirn, How To Get Rid of Pseudoterminals 1980 ICALP Albert & Culik, Test Sets for Homomorphism Equivalence on Context Free Languages 1980 ICALP Albert & Wegner, Languages with Homomorphic Replacements 1980 ICALP Alt, Functions Equivalent to Integer Multiplication 1980 ICALP Astesiano & Costa, Languages with Reducing Reflexive Types 1980 ICALP Back, Semantics of Unbounded Nondeterminism 1980 ICALP Becker & Perl & Schach, A Shifting Algorithm for min-max Tree Partitioning 1980 ICALP Bergstra & Tucker, A Characterisation of Computable Data Types by Means of a Finite Equational Specification Method 1980 ICALP Berman, A Note on Sweeping Automata 1980 ICALP Bini, Border Rank of a p x q x 2 Tensor and the Optimal Approximation of a Pair of Bilinear Forms 1980 ICALP Boasson, Derivations et Reductions dans les Grammaires Algebriques 1980 ICALP Cousot & Cousot, Semantic Analysis of Communicating Sequential Processes 1980 ICALP de Luca & Restivo, On Some Properties of Local Testability 1980 ICALP Ehrenfeucht & Rozenberg, D0S Systems and Languages 1980 ICALP Ehrig & Kreowski & Padawitz, Algebraic Implementation of Abstract Data Types: Concept, Syntax, Semantics and Correctness 1980 ICALP Ehrig & Kreowski & Thatcher & Wagner & Wright, Parameterized Data Types in Algebraic Specification Languages 1980 ICALP Emerson & Clark, Characterizing Correctness Properties of Parallel Programs Using Fixpoints 1980 ICALP Engelfriet & File, Formal Properties of One-Visit and Multi-Pass Attribute Grammars 1980 ICALP Even & Yacobi, Cryptocomplexity and NP-Completeness 1980 ICALP Flajolet & Steyaert, On the Analysis of Tree-Matching Algorithms 1980 ICALP Frederickson & Johnson, Generating and Searching Sets Induced by Networks 1980 ICALP Furer, The Complexity of the Inequivalence Problem for Regular Expressions with Intersection 1980 ICALP Galil, An Almost Linear Time Algorithm for Computing a Dependency Basis in a Relational Data Base 1980 ICALP Genrich & Thiagarajan, Bipolar Synchronization Systems 1980 ICALP Goralcikova & Goralcik & Koubek, Testing of Properties of Finite Algebras 1980 ICALP Gray, A Transaction Model 1980 ICALP Hennessy & Milner, On Observing Nondeterminism and Concurrency 1980 ICALP Hornung & Raulefs, Terminal Algebra Semantics and Retractions for Abstract Data Types 1980 ICALP Huynh, The Complexity of Semilinear Sets 1980 ICALP Kennaway & Hoare, A Theory of Nondeterminism 1980 ICALP Kozen, A Representation Theorem for Models of *-free PDL 1980 ICALP Langmaack & Olderog, Present-day Hoare-like Systems for Programming Languages with Procedures: Power, Limits and Most Likely Extensions 1980 ICALP Lewis & Papadimitriou, Symmetric Space-bounded Computation 1980 ICALP Majster-Cederbaum, Semantics: Algebras, Fixed Points, Axioms 1980 ICALP Makowsky, Measuring the Expressive Power of Dynamic Logics: An Application of Abstract Model Theory 1980 ICALP Mehlhorn, Pebbling Mountain Ranges and its Application to DCFL-Recognition 1980 ICALP Meineche Schmidt, Space-restricted Attribute Grammars 1980 ICALP Mosses, A Constructive Approach to Compiler Correctness 1980 ICALP Papadimitriou & Bentley, A Worst-case Analysis of Nearest Neighbor Searching by Projection 1980 ICALP Pin, Proprietes Syntactiques du Produit non Ambigu 1980 ICALP Raiha & Ukkonen, On the Optimal Assignment of Attributes to Passes in Multi-pass Attribute Evaluators 1980 ICALP Raoult & Vuillemin, Optimal Unbounded Search Strategies 1980 ICALP Reischuk, A ``Fast Implementation'' of a Multidimensional Storage into a Tree Storage 1980 ICALP Salomaa, Grammatical Families 1980 ICALP Schlichtiger, Partitioned Chain Grammars 1980 ICALP Schmidt & Shamir, An Improved Program for Constructing Open Hash Tables 1980 ICALP Shamir, On the Power of Commutativity in Cryptography 1980 ICALP Sippu & Soisalon-Soininen, Characterizations of the LL(k) Property 1980 ICALP Smyth, Computability in Categories 1980 ICALP Snir, On the Size Complexity of Monotone Formulas 1980 ICALP Toffoli, Reversible Computing 1980 ICALP Turchin, The Use of Metasystem Transition in Theorem Proving and Program Optimization 1980 ICALP Vitanyi, On the Power of Real-time Turing Machines under Varying Specifications 1979 ICALP Astesiano & Costa, Sharing in Nondeterminism 1979 ICALP Berstel, Sur les Mots sans Carre Definis par un Morphisme 1979 ICALP Bertoni & Mauri & Miglioli, A Characterization of Abstract Data as Model-theoretic Invariants 1979 ICALP Blattner, Inherent Ambiguities in Families of Grammars 1979 ICALP Book & Brandenburg, Representing Complexity Classes by Equality Sets 1979 ICALP Braunmuhl & Hotzel, Supercounter Machines 1979 ICALP Broy & Dosch & Partsch & Pepper & Wirsing, Existential Quantifiers in Abstract Data Types 1979 ICALP Choffrut, A Generalization of Ginsburg and Rose's Characterization of G-S-M Mappings 1979 ICALP Chottin, Strict Deterministic Languages and Controlled Rewriting Systems 1979 ICALP Commentz-Walter, A String Matching Algorithm Fast on the Average 1979 ICALP Coppo & Dezani-Ciancaglini & Salle, Functional Characterization of Some Semantic Equalities Inside lambda-Calculus 1979 ICALP Cremers & Hibbard, Arbitration and Queueing under Limited Shared Storage Requirements 1979 ICALP Culik, On the Homomorphic Characterizations of Families of Languages 1979 ICALP Dembinski & Maluszynski, Two Level Grammars: CF-Grammars with Equation Schemes 1979 ICALP Dershowitz & Manna, Proving Termination with Multiset Orderings 1979 ICALP Deussen, One Abstract Accepting Algorithm for all Kinds of Parsers 1979 ICALP Duncan & Yelowitz, Studies in Abstract/Concrete Mappings in Proving Algorithm Correctness 1979 ICALP Fich & Brzozowski, A Characterization of a Dot-Depth Two Analogue of Generalized Definite Languages 1979 ICALP Friede, Partitioned LL(k) Grammars 1979 ICALP Gallier, Recursion Schemes and Generalized Interpretations 1979 ICALP Goldstine, A Rational Theory of AFLs 1979 ICALP Hartmanis, On the Succinctness of Different Representations of Languages 1979 ICALP Istrail, A Fixed-Point Theorem for Recursive-Enumerable Languages and Some Considerations about Fixed-point Semantics of Monadic Programs 1979 ICALP Janko, Hierarchic Index Sequential Search with Optimal Variable Block Size and its Minimal Expected Number of Comparisons 1979 ICALP Jeanrond, A Unique Termination Theorem for a Theory with Generalised Commutative Axioms 1979 ICALP Kamimura & Slutzki, DAGS and Chomsky Hierarchy 1979 ICALP Karp, Recent Advances in the Probabilistic Analysis of Graph-theoretic Algorithms 1979 ICALP Kemp, On the Average Stack Size of Regularly Distributed Binary Trees 1979 ICALP Kowalk & Valk, On Reductions of Parallel Programs 1979 ICALP Kuich & Prodinger & Urbanek, On the Height of Derivation Trees 1979 ICALP Manna & Pnueli, The Modal Logic of Programs 1979 ICALP Meyer auf der Heide, A Comparison between Two Variations of a Pebble Game on Graphs 1979 ICALP Milton & Fischer, LL(k) Parsing for Attributed Grammars 1979 ICALP Monien & Sudborough, On Eliminating Nondeterminism from Turing Machines which Use Less than Logarithm Worktape Space 1979 ICALP Nijholt, Structure Preserving Transformations on Non-Left-Recursive Grammars 1979 ICALP Papadimitriou & Yannakakis, The Complexity of Restricted Minimum Spanning Tree Problems 1979 ICALP Rozenberg & Vermeir, Extending the Notion of Finite Index 1979 ICALP Rozenberg, A Systematic Approach to Formal Language Theory through Parallel Rewriting 1979 ICALP Ruzzo, On the Complexity of General Context-free Language Parsing and Recognition 1979 ICALP Savage & Swamy, Space-Time Tradeoffs for Oblivious Integer Multipliction 1979 ICALP Schmidt, Investigating Programs in Terms of Partial Graphs 1979 ICALP Schoenhage, On the Power of Random Access Machines 1979 ICALP Schwartz, An Axiomatic Treatment of ALGOL 68 Routines 1979 ICALP Selman, P-Selective Sets, Tally Languages, and the Behavior of Polynomial Time Reducibilities on NP 1979 ICALP Sethi & Tang, Constructing Call-by-Value Continuation Semantics 1979 ICALP Shields & Lauer, A Formal Semantics for Concurrent Systems 1979 ICALP Sippu & Soisalon-Soininen, On Constructing LL(k) Parsers 1979 ICALP Thatcher & Wagner & Wright, More on Advice on Structuring Compilers and Proving them Correct 1979 ICALP Therien, Languages of Nilpotent and Solvable Groups 1979 ICALP Tiuryn, Unique Fixed Points vs. Least Fixed Points 1979 ICALP Ukkonen, A Modification of the LR(k) Method for Constructing Compact Bottom-Up Parsers 1979 ICALP Ury, Optimal Decomposition of Linear Automata 1979 ICALP Wegner, Bracketed Two-Level Grammars--A Decidable and Practical Approach to Language Definitions 1978 ICALP Albert & Maurer & Rozenberg, Simple E0L Forms under Uniform Interpretation Generating CF Languages 1978 ICALP Altenkamp & Mehlhorn, Codes: Unequal Probabilities, Unequal Letter Costs 1978 ICALP Arnold & Dauchet, Sur l'Inversion des Morphismes d'Arbres 1978 ICALP Barth, Grammars with Dynamic Control Sets 1978 ICALP Beauquier, Ambiguite Forte 1978 ICALP Berman, Relationship between Density and Deterministic Complexity of NP-Complete Languages 1978 ICALP Berry, Stable Models of Typed lambda-Calculi 1978 ICALP Biskup, Path Measures of Turing Machine Computations 1978 ICALP Boe, Une Famille Remarquable de Codes Indecomposables 1978 ICALP Book & Greibach & Wrathall, Comparisons and Reset Machines 1978 ICALP Commentz-Walter, Size-Depth Tradeoff in Boolean Formulas 1978 ICALP Coppo & Dezani-Ciancaglini & Ronchi, (Semi)-Separability of Finite Sets of Terms in Scott's D_infinity-models of the lambda-Calculus 1978 ICALP Cremers & Hibbard, Mutual Exclusion of N Processors Using an O(N)-Valued Message Variable 1978 ICALP Damm & Fehr, On the Power of Self-Application and Higher Type Recursion 1978 ICALP Dobkin & Munro, Time and Space Bounds for Selection Problems 1978 ICALP Ehrig & Kreowski & Padawitz, Stepwise Specification and Implementation of Abstract Data Types 1978 ICALP Fortune & Hopcroft & Schmidt, The Complexity of Equivalence and Containment for Free Single Variable Program Schemes 1978 ICALP Galil, On Improving the Worst Case Running Time of the Boyer-Moore String Matching Algorithm 1978 ICALP Gallier, Semantics and Correctness of Nondeterministic Flowchart Programs with Recursive Procedures 1978 ICALP Harel, Arithmetical Completeness in Logics of Programs 1978 ICALP Itai & Rodeh, Covering a Graph by Circuits 1978 ICALP Lingas, A PSPACE Complete Problem Related to a Pebble Game 1978 ICALP Mignotte, Some Effective Results about Linear Recursive Sequences 1978 ICALP Nijholt, On the Parsing and Covering of Simple Chain Grammars 1978 ICALP Pin, Sur un Cas Particular de la Conjecture de Cerny 1978 ICALP Price & Wotschke, States Can Sometimes Do More than Stack Symbols in PDA's 1978 ICALP Restivo, Some Decision Results for Recognizable Sets in Arbitrary Monoids 1978 ICALP Reutenauer, Sur les Series Rationnelles en Variables non Commutatives 1978 ICALP Saarinen, On Constructing Efficient Evaluators for Attribute Grammars 1978 ICALP Salle, Une Extension de la Theorie des Types en lambda-Calcul 1978 ICALP Savitch, Parallel and Nondeterministic Time Complexity Classes 1978 ICALP Schnorr, Multiterminal Network Flow and Connectivity in Unsymmetrical Networks 1978 ICALP Sciore & Tang, Admissible Coherent c.p.o.'s 1978 ICALP Toffoli, Integration of the Phase-Difference Relations in Asynchronous, Sequential Networks 1978 ICALP Valk, Self-Modifying Nets, a Natural Extension of Petri Nets 1978 ICALP Wiehagen, Characterization Problems in the Theory of Inductive Inference 1978 ICALP Zilli, Head Recurrent Terms in Combinatory Logic: A Generalization of the Notion of Head Normal Form 1977 ICALP Aho & Sethi, How Hard is Compiler Code Generation? 1977 ICALP Alton, ``Natural'' Complexity Measures and Time Versus Memory: Some Definitional Proposals 1977 ICALP Apt & de Bakker, Semantics and Proof Theory of PASCAL Procedures 1977 ICALP Ausiello & D'Atri & Protasi, On the Structure of Combinatorial Problems and Structure Preserving Reductions 1977 ICALP Backhouse & Lutz, Factor Graphs, Failure Functions and Bi-Trees 1977 ICALP Benson & Jeffords, Parallel Decomposition of LR(k) Parsers 1977 ICALP Bertoni & Mauri & Torelli, Some Recursively Unsolvable Problems Relating to Isolated Cutpoints in Probabilistic Automata 1977 ICALP Bohm & Coppo & Dezani-Ciancaglini, Termination Tests Inside lambda-Calculus 1977 ICALP Book & Yap, On the Computational Power of Reversal-Bounded Machines 1977 ICALP Brandenburg, The Contextsensitivity Bounds of Contextsensitive Grammars and Languages 1977 ICALP Chytil & Jakl, Serial Composition of 2-way Finite-State Transducers and Simple Programs on Strings 1977 ICALP Courcelle, On the Definition of Classes of Interpretations 1977 ICALP Culik & Fris, The Sequence Equivalence Problem for D0L Systems is Decidable 1977 ICALP Damm, Languages Defined by Higher Type Program Schemes 1977 ICALP de Roever, On Backtracking and Greatest Fixpoints 1977 ICALP Dietrich, Parsing and Syntactic Error Recovery for Context-Free Grammars by Means of Coarse Structures 1977 ICALP Dikovskii & Modina, On Three Types of Unambiguity of Context-Free Language 1977 ICALP Ehrig & Rosen, The Mathematics of Record Handling 1977 ICALP Engelfriet, Macro Grammars, Lindenmayer Systems and Other Copying Devices 1977 ICALP Erni, On the Time and Tape Complexity of Hyper(1)-AFL's 1977 ICALP Hopner & Opp, Renaming and Erasing in Szilard Languages 1977 ICALP Itai & Rodeh, Some Matching Problems 1977 ICALP Jacob, Complexite des Demi-Groupes de Matrices 1977 ICALP Janssen & van Emde Boas, On the Proper Treatment or Referencing, Dereferencing and Assignment 1977 ICALP Jones & Skyum, Complexity of Some Problems Concerning L Systems 1977 ICALP Kriegel & Ottman, Left-Fitting Translations 1977 ICALP Mehlhorn, Dynamic Binary Search 1977 ICALP Monien, About the Derivation Languages of Grammars and Machines 1977 ICALP Nijholt, Simple Chain Grammars 1977 ICALP Paul & Tarjan, Time-Space Trade-offs in a Pebble Game 1977 ICALP Paz & Moran, Non-deterministic Polynomial Optimization Problems and their Approximation 1977 ICALP Pnueli & Slutzki, Simple Programs and their Decision Problems 1977 ICALP Rajlich, Theory of Data Structures by Relational and Graph Grammars 1977 ICALP Rozenberg & Vermeir, L Systems of Finite Index 1977 ICALP Sajaniemi, The Safety of a Coroutine System 1977 ICALP Savitch & Vitanyi, Linear Time Simulation of Multihead Turing Machines with Head-to-Head Jumps 1977 ICALP Shamir & Wadge, Data Types as Objects 1977 ICALP Simon, On the Difference between One and Many 1977 ICALP Sippu & Soisalon-Soininen, On Defining Error Recovery in Context-free Parsing 1977 ICALP Streinu, LL(k) Languages are Closed under Union with Finite Languages 1977 ICALP Sudborough, The Time and Tape Complexity of Developmental Languages 1977 ICALP Takahashi, Rational Relations of Binary Trees 1977 ICALP Walter, Structural Equivalence of Context-free Grammar Forms Is Decidable 1976 ICALP Alt & Mehlhorn, Lower Bounds for the Space Complexity of Context-free Recognition 1976 ICALP Arnold & Dauchet, Bi-Transductions de Forets 1976 ICALP Beauquier, Generateurs Algebriques Non-Ambigus 1976 ICALP Berry & Courcelle, Program Equivalence and Canonical Forms in Stable Discrete Interpretations 1976 ICALP Bloniarz & Fischer & Meyer, A Note on the Average Time to Compute Transitive Closures 1976 ICALP Brand, Proving Programs Incorrect 1976 ICALP Cartwright, User-defined Data Types as an Aid to Verifying LISP Programs 1976 ICALP de Bakker, Semantics and Termination of Nondeterministic Recursive Programs 1976 ICALP Ehrich, Outline of an Algebraic Theory of Structured Objects 1976 ICALP Fontet, A Linear Algorithm for Testing Isomorphism of Planar Graphs 1976 ICALP Friedman & Wise, CONS Should Not Evaluate Its Arguments 1976 ICALP Galil, On Enumeration Procedures for Theorem Proving and for Integer Programming 1976 ICALP Gill & Simon, Ink, Dirty-Tape Turing Machines, and Quasicomplexity Measures 1976 ICALP Greif, On Proofs of Programs for Synchronization 1976 ICALP Guessarian, Semantic Equivalence of Program Schemes and its Syntactic Characterization 1976 ICALP Hennessy & Ashcroft, The Semantics of Nondeterminism 1976 ICALP Kroeger, Logical Rules of Natural Reasoning about Programs 1976 ICALP Linna, On omega-Sets Associated with Context-free Languages 1976 ICALP Lipski, Informational Systems with Incomplete Information 1976 ICALP Longo & Venturini Zilli, A Theory of Computation with an Identity Discriminator 1976 ICALP McColl, The Depth of Boolean Functions 1976 ICALP Perrin, Sur la Longueur Moyenne des Codes Prefixes 1976 ICALP Restivo, On a Family of Codes 1976 ICALP Sakarovitch, Sur les Monoides Syntactiques des Langages Algebriques Deterministes 1976 ICALP Schnorr, Optimal Algorithms for Self-Reducible Problems 1976 ICALP Schwarz, Event Based Reasoning--A System for Proving Correct Termination of Programs 1976 ICALP Sintzoff, Eliminating Blind Alleys from Backtrack Programs 1976 ICALP Soisalon-Soininen & Ukkonen, A Characterization of LL(k) Languages 1976 ICALP Valiant, The Equivalence Problem for D0L Systems and its Decidability for Binary Alphabets 1976 ICALP van Emden, Verification Conditions as Programs 1976 ICALP van Leeuwen, On the Construction of Huffman Trees 1974 ICALP Arsac, Langages sans Etiquettes et Transformations de Programmes 1974 ICALP Ausiello, Relations between Semantics and Complexity of Recursive Programs 1974 ICALP Berstel & Boasson, Une Suite Decroissante de Cones Rationnels 1974 ICALP Bertsch, A Decidability Result for Sequential Grammars 1974 ICALP Blattner, Transductions of Context-free Languages into Sets of Sentential Forms 1974 ICALP Bohm & Dezani-Ciancaglini, Combinatorial Problems, Combinator Equations and Normal Forms 1974 ICALP Book, On the Structure of Complexity Classes 1974 ICALP Cesari, Sur l'Application du Theoreme de Suschkewitsch a l'Etude des Codes Rationnels Complets 1974 ICALP Chandra, Generalized Program Schemas 1974 ICALP Courcelle & Kahn & Vuillemin, Algorithmes d'Equivalence et de Reduction a des Expressions Minimales dans une Classe d'Equations Recursives Simples 1974 ICALP Cremers & Ginsburg, Context-free Grammar Forms 1974 ICALP Culik & Maibaum, Parallel Rewriting Systems on Terms 1974 ICALP de Michelis & Simone, Semantic Characterization of Flow Diagrams and their Decomposability 1974 ICALP de Roever, Recursion and Parameter Mechanisms: An Axiomatic Approach 1974 ICALP Dezani-Ciancaglini & Zacchi, Application of Church-Rosser Properties to Increase the Parallelism and Efficiency of Algorithms 1974 ICALP Dilger & Raulefs, Monadic Program Schemes under Restricted Classes of Free Interpretations 1974 ICALP Ehrenfeucht & Rozenberg, Trade-off between the Use of Nonterminals, Codings and Homomorphisms in Defining Languages for Some Classes of Rewriting Systems 1974 ICALP Fischer & Probert, Efficient Procedures for Using Matrix Algorithms 1974 ICALP Fischer, Further Schemes for Combining Matrix Algorithms 1974 ICALP Flajolet & Steyaert, On Sets Having Only Hard Subsets 1974 ICALP Fontet, Un Resultat en Theorie des Groupes de Permutations et son Application au Calcul Effectif du Groupe d'Automorphismes d'un Automate Fini 1974 ICALP Gecseg, Composition of Automata 1974 ICALP Geller & Graham & Harrison, Production Prefix Parsing 1974 ICALP Hartmanis & Baker, On Simple Goedel Numberings and Translations 1974 ICALP Hayes, Simple and Structural Redundancy in Non-deterministic Computation 1974 ICALP Hotz, Komplexitatsmasse fur Ausdrucke 1974 ICALP Kandzia, On the Most Recent Property of ALGOL-like Programs 1974 ICALP Kemp, Mehrdeutigkeiten Kontextfreier Grammatiken 1974 ICALP Kreczmar, Effectivity Problems of Algorithmic Logic 1974 ICALP Lang, Deterministic Techniques for Efficient Non-deterministic Parsers 1974 ICALP Lipski & Marek, File Organization, an Application of Graph Theory 1974 ICALP Lomet, Automatic Generation of Multiple Exit Parsing Subroutines 1974 ICALP Martelli & Montanari, Dynamic Programming Schemata 1974 ICALP Mehlhorn, The `Almost All' Theory of Subrecursive Degrees is Decidable 1974 ICALP Monien, Characterizations of Time-Bounded Computations by Limited Primitive Recursion 1974 ICALP Novotny, Operators Reducing Generalized 0L-Systems 1974 ICALP Pacini & Montangero & Turini, Graph Representation and Computation Rules for Typeless Recursive Languages 1974 ICALP Pager, On Eliminating Unit Productions from LR(k) Parsers 1974 ICALP Reynolds, On the Relation between Direct and Continuation Semantics 1974 ICALP Salomaa, Parallelism in Rewriting Systems 1974 ICALP Schnorr, On Maximal Merging of Information in Boolean Computations 1974 ICALP Schutzenberger, Sur une Propriete Syntactique des Relations Rationnelles 1974 ICALP Shamir & Beeri, Checking Stacks and Context-free Programmed Grammars Accept p-Complete Languages 1974 ICALP van Leeuwen, A Generalisation of Parikh's Theorem in Formal Language Theory 1974 ICALP van Wigngaarden, The Generative Power of Two-Level Grammars 1974 ICALP Weicker, Turing Machines with Associative Memory Access 1974 ICALP Weihrauch, The Computational Complexity of Program Schemata 1972 ICALP Aguzzi & Pinzani & Sprugnoli, An Algorithmic Approach to the Semantics of Programming Languages 1972 ICALP Baker, Context-sensitive Grammars Generating Context-free Languages 1972 ICALP Berstel, Sur la Densite Asymptotique de Langages Formels 1972 ICALP Bertoni, Complexity Problems Related to the Approximation of Probabilistic Languages and Events by Deterministic Machines 1972 ICALP Boasson, Un Critere de Rationnalite des Langages Algebriques 1972 ICALP Bohm & Dezani-Ciancaglini, Can Syntax be Ignored During Translation? 1972 ICALP Book, Complexity Classes of Formal Languages 1972 ICALP Butzbach, Une Famille de Congruences de Thue pour lesquelles le Probleme de l'Equivalence est Decidable. Application a l'Equivalence des Grammaires Separees 1972 ICALP Choffrut, Transducteurs Conservant l'Imprimitivite du Langage d'Entree 1972 ICALP Claus, Assignment--Programs 1972 ICALP Cori, Sur des Langages Verifiant des Equations avec Operateur 1972 ICALP Crespi-Reghizzi & della Vigna, Approximation of Phrase Markers by Regular Sets 1972 ICALP Crestin, Un Langage non Ambigu dont le Carre est d'Ambiguite non Bornee 1972 ICALP de Bakker & de Roever, A Calculus for Recursive Program Schemes 1972 ICALP Dubinsky, The Functions Computed by a Monadic Program Schema with One Location 1972 ICALP Engelfriet, Translation of Simple Program Schemes 1972 ICALP Flajolet & Steyaert, Complexite des Problemes de Decision Relatifs aux Algorithmes de Tri 1972 ICALP Fliess, Automates Stochastiques et Series Rationnelles non Commutatives 1972 ICALP Harrison & Havel, On a Family of Deterministic Grammars 1972 ICALP Hitchcock & Park, Induction Rules and Termination Proofs 1972 ICALP Hosch & Landweber, Finite Delay Solutions for Sequential Conditions 1972 ICALP Hsia & Yeh, Finite Automata with Markers 1972 ICALP Joshi & Levy & Takahashi, A Tree Generating System 1972 ICALP Kalman & Rouchaleau, Realization Theory of Linear Systems over a Commutative Ring 1972 ICALP Kemp, An Estimation of the Set of States of the Minimal LR(0)-Acceptor 1972 ICALP Kfoury, Comparing Algebraic Structures up to Algorithmic Equivalence 1972 ICALP Kott, Remarques sur la Structure des Schemas de Programmes 1972 ICALP Kuroda, On Structural Similarity of Phrase-Structure Languages 1972 ICALP Lentin, Equations in Free Monoids 1972 ICALP Linna, Finite Power Property of Regular Languages 1972 ICALP Manna & Vuillemin, Fixpoint Approach to the Theory of Computation 1972 ICALP Monien, Relationships between Pushdown Automata and Tape-bounded Turing Machines 1972 ICALP Nivat, Langages Algebriques sur le Magma Libre et Semantique des Schemas de Programmes 1972 ICALP Nolin, Systemes Algorithmiques, Systemes Fonctionnels 1972 ICALP Paz & Rabinovich, Linear Automata--Approximation Problem 1972 ICALP Ruggiu, Let Types et les Appels de Procedures 1972 ICALP Schnorr, Does the Computational Speed-up Concern Programming? 1972 ICALP Schutzenberger, A propos des Relations Rationnelles Fonctionnelles 1972 ICALP Takahashi, Primitive Transformations of Regular Sets and Recognizable Sets 1972 ICALP Thierrin, Convex Languages 1972 ICALP Turner, An Approach to Mathematical Complexity. An Infinite Hierarchy of Term Languages 1972 ICALP van Emde Boas, A Comparison of the Properties of Complexity Classes and Honesty Classes 1972 ICALP Vidal-Naquet, Quelques Applications des Automates a Arbres Infinis 1972 ICALP Viennot, Automates et Bascules 1972 ICALP Vilfan, A Generalization of a Theorem of Specker and Some Applications 1972 ICALP von Henke & Indermark & Weihrauch, Hierarchies of Primitive Recursive Wordfunctions and Transductions Defined by Automata 1972 ICALP Wand, A Concrete Approach to Abstract Recursive Definitions 1972 ICALP Weiss & Mago & Stanat, Algebraic Parsing Techniques for Context-free Grammars 1972 ICALP Zalcstein, Syntactic Semigroups of Some Classes of Star-free Languages 1995 ICANNGA Reynolds & Gomatam, Theoretical Bounds for Genetic Algorithms 1995 ICANNGA Gibson, An Argument against the Principle of Minimum Alphabet 1995 ICANNGA Jozefowska & Rozycki & Weglarz, A Genetic Algorithm for some Discrete-Continuous Scheduling Problems 1995 ICANNGA Khuri & Schutz & Heitkotter, Evolutionary Heuristics for the Bin Packing Problem 1995 ICANNGA Hao, A Clausal Genetic Representation and its Evolutionary Procedures for Satisfiability Problems 1995 ICANNGA Tambouratzis, Simulated Annealing Artificial Neural Networks for the Satisfiability (SAT) Problem 1995 ICANNGA Alander, Interval Arithmetic and Genetic Algorithms in Global Optimization 1992 4 ICCAL Maurer, Why Hypermedia Systems Are Important 1992 4 ICCAL Petruk, Adjusting to the Paradigm Shift in Teaching and Learning; or: What Do I Do Now? 1992 4 ICCAL Dumslaff & Ebert, Structuring the Subject Matter 1992 4 ICCAL Hesser & Hogan & Mizell, The Sum of the Parts Is Greater than the Whole in Online Graduate Education 1977 ICCAS Rothstein, Transitive Closure, Parallelism, and the Modeling of Skill Acquisition 1992 4 ICCI Muller & Schupp & Saoudi, On the Decidability of the Linear Z-Temporal Logic and the Monadic Second Order Theory of the Integers 1992 4 ICCI Wang & Hsu, Maximum and Minimum Matchings for Series-Parallel Networks 1992 4 ICCI Jonoska, Spinal Cellular Automata 1992 4 ICCI Xue & Sun & Rosen, Minimum Time Message Transmission in Networks 1992 4 ICCI Lin & Tseng, Resource-Requirement Minimization in Relocation Problems with Precedence Constraints 1992 4 ICCI Nilsson & Schuierer, Shortest m-Watchmen Routes for Histograms: The MinMax Case 1992 4 ICCI Chang & Wang & Lee, Generating All Maximal Independent Sets on Trees in Lexicographic Order 1992 4 ICCI Peng & Stephens & Yesha, Algorithms for a K-Tree Core of a Tree 1992 4 ICCI Chandrasekharan & Hannenhalli, Efficient Algorithms for Computing Matching and Chromatic Polynomials on Series-Parallel Graphs 1992 4 ICCI Sanchis, Counting and Generating Integer Partitions in Parallel 1992 4 ICCI Abrahamson & Fellows & Wilson, Parallel Self-Reducibility 1992 4 ICCI Lloyd & Ramanathan, On the Complexity of Distance-2 Coloring 1992 4 ICCI Foster, The Generic Oracle Hypothesis Fails 1992 4 ICCI Estivill-Castro, Move-to-End is Best for Double-Linked Lists 1992 4 ICCI Wang & Longpre, Nondeterministic and Alternating Computations 1992 4 ICCI Innes, Searching with a Lie Using Only Comparison Questions 1992 4 ICCI Yu & Zhuang & Salomaa, Obtaining Tight Upper Bounds for the State Complexities of DFA Operations 1992 4 ICCI Olariu & Shen & Wilson, Sub-Logarithmic Algorithms for the Largest Empty Rectangle Problem 1992 4 ICCI Osiakwan & Akl, An Efficient Parallel Algorithm for the Assignment Problem on the Plane 1992 4 ICCI Johnson & Davis, Space Efficient Parallel Buddy Memory Management 1992 4 ICCI Liu & You & Li, Conflict-Free Routing on Hypercubes 1992 4 ICCI Berthome, K-Selection in Hypercubes 1992 4 ICCI Akl & Cosnard & Ferreira, Revisiting Parallel Speedup Complexity 1992 4 ICCI Patterson, Matrix Multiplication on a Toroidal Parallel Architecture 1992 4 ICCI Kane-Esrig & Streeter & Casella & Keese, The Relevance Density Method in Information Retrieval 1992 4 ICCI Ramakrishna, A Simple Perfect Hashing Method for Static Sets 1992 4 ICCI Nelakonda & Mizuno & Neilsen, A Distributed Algorithm for Parameterized Semaphore Operations 1992 4 ICCI Stephens & Yesha & Humenik, Optimal Allocation for Partially Replicated Database Systems on Ring Networks 1992 4 ICCI Yuan & Chen, Fault-tolerant CSP 1991 ICCI Hehner, What's Wrong With Formal Programming Methods? 1991 ICCI Probert, Computer Science and Communications Protocols: Research Relationships 1991 ICCI Smith, Reaping the Benefits of Mass Production with Massively Parallel Computing - Four Example Applications 1991 ICCI Hung & Chen, On the Quickest Path Problem 1991 ICCI Estivill-Castro & Wood, Practical Adaptive Sorting 1991 ICCI Bshouty, Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains 1991 ICCI Haralambides & Makedon, Approximation Algorithms for the Bandwidth Minimization Problem for a Large Class of Trees 1991 ICCI Ouksel & Yaagoub, The Interpolation-Based Bintree and its Application to Graphics 1991 ICCI Carlisle & Lloyd, On the k-Coloring of Intervals 1991 ICCI Kooshesh & Moret, Folding a Triangulated Simple Polygon: Structural and Algorithmic Results 1991 ICCI Lai & Wood, A Relationship Between Self-Organizing Lists and Binary Search Trees 1991 ICCI Cameron & Wood, How Costly Can Red-Black Trees Be? 1991 ICCI Cameron & Wood, Balance in AVL Trees 1991 ICCI Cosnard & Ferreira, A Tight Lower Bound for Selection in Sorted X+Y 1991 ICCI Levcopoulos & Lingas, Greedy Triangulation Approximates the Optimum and Can Be Implemented in Linear Time in the Average Case 1991 ICCI Raman, Generating Random Graphs Efficiently 1991 ICCI Rival & Zhan, Linear Extensions with Backtracking 1991 ICCI Chen & Han, Storing Shortest Paths for a Polyhedron 1991 ICCI Maheshwari, Partitioning and Scheduling of Parallel Functional Programs Using Complexity Information 1991 ICCI Mittal & Jain & Patney, Subtree Availability in Binary Tree Architectures 1991 ICCI Chan & Friesen, An Optimal Parallel Algorithm for the Vertical Segment Visibility Reporting Problem 1991 ICCI Chau & Liestman, A Fault-Tolerant Binary Tree Architecture 1991 ICCI Hsu & Wang, Unordered Tree Contraction 1991 ICCI Yang & Lee & Chen, Conflict-Free Sorting Algorithms Under Single-Channel and Multi-Channel Broadcast Communication Models 1991 ICCI Qiu & Meijer & Akl, Parallel Routing and Sorting on the Pancake Network 1991 ICCI Kirsch & Blair, Practical Parallel Algorithms for Chordal Graphs 1991 ICCI Chen, Logarithmic Time NC Algorithms for Comparability Graphs and Circle Graphs 1991 ICCI Boals & Gupta & Hashmi & Sherwani, Compact Hypercubes: Properties and Recognition 1991 ICCI Liu & You, Increasing Communication Bandwidth on Hypercube 1991 ICCI Herman & Trilling, Programming a Parallel Sort Using Distributed Procedure Calls 1991 ICCI Krizanc, A Note on Off-Line Permutation Routing on a Mesh-Connected Processor Array 1991 ICCI Myoupo, A Fully-Pipelined Solutions Constructor for Dynamic Programming Problems 1991 ICCI Baumslag, On the Fault-Tolerance of Quasi-Minimal Cayley Networks 1991 ICCI Das & Chen & Lewis & Prasad, Some Fast Parallel Algorithms for Parentheses Matching 1991 ICCI Lin & Olariu, A Simple Optimal Parallel Algorithm to Solve the Lowest Common Ancestor Problem 1991 ICCI Biswas & Sanyal & Tewari, Extended Cycle Shrinking: A Restructuring Method for Parallel Compilation 1991 ICCI Rosen & Xue, Sequential and Distributed Algorithms for the All Pairs Quickest Path Problem 1991 ICCI Boals & Gupta & Hashmi & Sherwani, An Efficient Approximation Algorithm for Hypercube Scheduling 1991 ICCI Olariu & Overstreet & Wen, An Optimal Parallel Algorithm to Reconstruct a Binary Tree from its Traversals 1991 ICCI Youn, An Efficient Multiprocessor Architecture for Image Processing in VLSI 1991 ICCI Kirousis & Spirakis & Tsigas, Simple Atomic Snapshots: A Linear Complexity Solution with Unbounded Time-Stamps 1991 ICCI Raynal, A Distributed Solution to the k-out of-M Resources Allocation Problem 1991 ICCI Bhattacharya & Bhattacharya, Mapping of Fault-Tolerant Permutations in Omega Interconnection Network 1990 ICCI Maier, The Asymptotic Evolution of Data Structures 1990 ICCI Rolim, On the Formal Aspects of Approximation Algorithms 1990 ICCI Eberbach, Selected Aspects of the Calculus of Self-Modifiable Algorithms Theory 1990 ICCI Geske, A Note on Almost-Everywhere Complexity, Bi-Immunity and Nondeterministic Space 1990 ICCI Sheinwald & Pasco, Deriving Deterministic Prediction Rules from Reduction Schemes 1990 ICCI Pugh, Probabilistic Analysis of Set Operations With Constant-time Set Equality Test 1990 ICCI Wallace, Classification by Minimum-Message-Length Inference 1990 ICCI Henglein, Fast Left-Linear Semi-Unification 1990 ICCI Jiang, On the Complexity of (Off-line) 1-tape ATM's Running in Constant Reversals 1990 ICCI Dietz & Raman, A Constant Update Time Finger Search Tree 1990 ICCI Baeza-Yates & Gonnet, Average Case Analysis of Algorithms using Matrix Recurrences 1990 ICCI Heinz, Finding Two-Tree-Factor Elements of Tableau-Defined Monoids in Time O(n^3) 1990 ICCI Tucker & Zucker, Toward a General Theory of Computation and Specification over Abstract Data Types 1990 ICCI Stewart, Using The Hamiltonian Path Operator To Capture NP 1990 ICCI Wang, Some Remarks on Polynomial Time Isomorphisms 1990 ICCI Singh, An Axiomatization of Wait-Freedom and Low-Atomicity 1990 ICCI Harrison & Glaser, The Gamma Model as a Functional Programming Tool 1990 ICCI Toptsis & Yu & Nelson, Computing the Transitive Closure of Symmetric Matrices 1990 ICCI Brown & Czejdo, A Hypertext for Literate Programming 1990 ICCI Steinke & Hamann, Ethics and Computers: Can Universities Set the Standards? 1990 ICCI Boswell & Tharp, Alternatives to the B+-tree 1990 ICCI Winters, Minimal Perfect Hashing For Large Sets of Data 1990 ICCI Lu, Parallel Computation of Longest-Common-Subsequence 1990 ICCI Chen & Das, Parallel Breadth-First and Breadth-Depth Traversals of General Trees 1990 ICCI Kim, A Parallel Algorithm for Path-Min Queries in Trees 1990 ICCI Chen, Efficient Deterministic Parallel Algorithms for Integer Sorting 1990 ICCI Masapati & Ural, Electing a Leader in a Synchronous Recursively Scalable Network 1988 ICCONC Halpern & Fagin, Modelling Knowledge and Action in Distributed Systems 1988 ICCONC Vardi, An Automata-Theoretic Approach to Protocol Verification (Abstract) 1988 ICCONC Drusinsky & Harel, On the Power of Cooperative Concurrency 1988 ICCONC Melliar-Smith, A Graphical Representation of Interval Logic 1988 ICCONC Tel, Total Algorithms 1988 ICCONC Drost & van Leeuwen, Assertional Verification of a Majority Consensus Algorithm for Concurrency Control in Multiple Copy Databases 1988 ICCONC Korach & Tel & Zaks, Optimal Synchronization of ABD Networks 1996 16 ICDCS Liu & Miller & van der Schoot & Ural, Deadlock Detection by Fair Reachability Analysis: From Cyclic to Multi-Cyclic Protocols (and Beyond?) 1996 16 ICDCS Chen & Deng & Attie & Sun, Optimal Deadlock Detection in Distributed Systems Based on Locally Constructed Wait-for Graphs 1996 16 ICDCS Das & Sarkar & Pinotti, Distributed Priority Queues on Hypercube Architectures 1996 16 ICDCS Choy, Robust Distributed Mutual Exclusion 1996 16 ICDCS Mizuno & Nesterenko & Kakugawa, Lock-Based Self-Stabilizing Distributed Mutual Exclusion Algorithms 1996 16 ICDCS Banerjee & Chrysanthis, A New Token Passing Distributed Mutual Exclusion Algorithm 1996 16 ICDCS Prakash & Raynal & Singhal, An Efficient Causal Ordering Algorithm for Mobile Computing Environments 1995 15 ICDCS Cristian & Fetzer, Fault-Tolerant External Clock Synchronization 1995 15 ICDCS Borcherding, Efficient Failure Discovery with Limited Authentication 1995 15 ICDCS Rodrigues & Verissimo, Causal Separators for Large-Scale Multicast Communication 1995 15 ICDCS Ng & Ravishankar, Coterie Templates: A New Quorum Construction Method 1995 15 ICDCS Bulgannawar & Vaidya, A Distributed K-Mutual Exclusion Algorithm 1995 15 ICDCS Rhee, A Fast Distributed Modular Algorithm for Resource Allocation 1995 15 ICDCS Lee & Kim, An Efficient Distributed Deadlock Detection Algorithm 1995 15 ICDCS Garg & Chase, Distributed Algorithms for Detecting Conjunctive Predicates 1995 15 ICDCS Fromentin & Raynal, Characterizing and Detecting the Set of Global States Seen by all Observers of a Distributed Computation 1995 15 ICDCS Fekete & Kaashoek & Lynch, Implementing Sequentially Consistent Shared Objects Using Broadcast and Point-to-Point Communication 1995 15 ICDCS Dolev & Kate & Welch, A Competitive Analysis for Retransmission Timeout 1995 15 ICDCS Yoo & Youn, An Efficient Task Allocation Scheme for Two-Dimensional Mesh-Connected Systems 1993 13 ICDCS Huang & Jiang & Kuo, K-Coteries for Fault-Tolerant K Entries to a Critical Section 1993 13 ICDCS Vaidya & Pradhan, Degradable Agreement in the Presence of Byzantine Faults 1993 13 ICDCS Chen & Yu & Wu, Decentralized Consensus Protocols with Multi-Port Communication 1993 13 ICDCS Peterson & Yi, Average Case Behavior of Election Algorithms for Unidirectional Rings 1993 13 ICDCS Brzezinski & Helary & Raynal, Termination Detection in a Very General Distributed Computing Model 1991 11 ICDCS Garcia-Molina & Kao & Barbara, Aggressive Transmissions over Redundant Paths 1991 11 ICDCS Ahamad & Hutto & John, Implementing and Programming Causal Distributed Shared Memory 1991 11 ICDCS Singh, On the Validity of the Global Time Assumption 1991 11 ICDCS Olson & Shin, Probabilistic Clock Synchronization in Large Distributed Systems 1991 11 ICDCS Neilsen & Mizuno, A DAG-Based Algorithm for Distributed Mutual Exclusion 1991 11 ICDCS Mizuno & Neilsen & Rao, A Token Based Distributed Mutual Exclusion Algorithm Based on Quorum Agreements 1991 11 ICDCS Kim & Das, Modeling Wormhole Routing in a Hypercube 1991 11 ICDCS Kumar, A Randomized Voting Algorithm 1991 11 ICDCS Singh, Efficient Distributed Algorithms for Leader Election in Complete Networks 1991 11 ICDCS Lee & Lu, BNB Self-Routing Permutation Network 1991 11 ICDCS Chiu & Chalasani & Raghavendra, Flexible, Fault-Tolerant Routing Criteria for Circuit-Switched Hypercubes 1991 11 ICDCS Sur & Srimani, Super Star: A New Optimally Fault Tolerant Network Architecture 1990 10 ICDCS Lloyd & Kearns, Bounding Sequence Numbers in Distributed Systems: A General Approach 1990 10 ICDCS Kumar, An Implementation of N-Party Synchronization Using Tokens 1990 10 ICDCS Chlamtac & Ganz, A Study of Communication Resource Allocation in a Distributed System 1990 10 ICDCS Liu, Optimal Routing in the De Bruijn Networks 1989 9 ICDCS Katseff, Initializing Hypercubes 1989 9 ICDCS Jin & Jin, A New Approach to Hypercube Network Analysis 1989 9 ICDCS Cristian, A Probabilistic Approach to Distributed Clock Synchronization 1989 9 ICDCS Bouloutas & Gopal, Some Graph Partitioning Problems and Algorithms Related to Routing in Large Computer Networks 1992 12 ICDCS Glass & Ni, Adaptive Routing in Mesh-Connected Networks 1992 12 ICDCS Nanda & DeGroot & Stenger, Scheduling Directed Task Graphs on Multiprocessors Using Simulated Annealing 1992 12 ICDCS Xu & McKinley & Ni, Efficient Implementation of Barrier Synchronization in Wormhole-Routed Hypercube Multicomputers 1992 12 ICDCS Woo & Newman-Wolfe, Huffman Trees as a Basis for a Dynamic Mutual Exclusion Algorithm for Distributed Systems 1992 12 ICDCS El-Ghazawi & Youssef, A Unified Approach to Fault-Tolerant Routing 1992 12 ICDCS Efe, Reconfigurable Cube Architecture for Parallel Computation 1992 12 ICDCS Hsu & Huang, Analyzing Self-Stabilization with Finite-State Machine Model 1992 12 ICDCS Lan, Fault-Tolerant Multi-Destination Routing in Hypercube Multicomputers 1992 12 ICDCS Agrawal & Jalote, An Efficient Protocol for Voting in Distributed Systems 1992 12 ICDCS Ibaraki & Nagamochi & Kameda, Optimal Coteries for Rings and Related Networks 1992 12 ICDCS Neilsen & Mizuno & Raynal, A General Method to Define Quorums 1992 12 ICDCS Nakajima, Using a Finite Projective Plane with Duality for Decentralized Consensus Protocols 1992 12 ICDCS Raynal & Mizuno & Neilsen, Synchronization and Concurrency Measures for Distributed Computations 1992 12 ICDCS Ladin & Liskov, Garbage Collection of a Distributed Heap 1992 12 ICDCS Tsay & Bagrodia, A Real-Time Algorithm for Fair Interprocess Synchronization 1987 7 ICDCS Naimi & Trehel, An Improvement of the log(n) Distributed Algorithm for Mutual Exclusion 1994 10 ICDE Sarawagi & Stonebraker, Efficient Organization of Large Multidimensional Arrays 1992 8 ICDE Dar & Jagadish, A Spanning Tree Transitive Closure Algorithm 1992 8 ICDE Jiang, I/O-Efficiency of Shortest Path Algorithms: An Analysis 1992 8 ICDE Penaloza & Ozkarahan, Parallel Algorithms for Executing Join on Cube-Connected Multicomputers 1992 8 ICDE Salem & Barbara & Lipton, Probabilistic Diagnosis of Hot Spots 1992 8 ICDE Lee & Belford, An Efficient Object-based Algorithm for Spatial Searching, Insertion, and Deletion 1992 8 ICDE Wei & Lien, Hot-Spot Based Composition Algorithm 1995 5 ICDT Imielinski, Data on Air -- What's in it for the Database Theorist 1995 5 ICDT Paredaens, Spatial Databases, the Final Frontier 1995 5 ICDT Weikum, Parallel Database Systems 1995 5 ICDT Kolaitis, Languages for Polynomial-Time Queries -- An Ongoing Quest 1992 4 ICDT Katona, Combinatorial and Algebraic Results for Database Relations 1992 4 ICDT Abiteboul & Vardi & Vianu, Computing with Infinitary Logic 1992 4 ICDT Grumbach & Tollu, Query Languages with Counters 1992 4 ICDT Abiteboul & Van Gelder, Optimizing Active Databases Using the Split Technique 1992 4 ICDT Papadimitriou & Sideri, On Finding Extensions of Default Theories 1992 4 ICDT Grumbach, A Paradox in Database Theory 1992 4 ICDT Pinchuk & Shvachko, Maintaining Dictionaries: Space-Saving Modifications of B-Trees 1990 3 ICDT Fagin, Finite-Model Theory--A Personal Perspective 1990 3 ICDT Grumbach & Vianu, Playing Games with Objects 1990 3 ICDT Matsliach & Shmueli, Maintaining Bounded Disorder Files in Multiprocessor Multi-Disk Environments 1990 3 ICDT Tsotras & Gopinath, Efficient Algorithms for Managing the History of Evolving Databases 1990 3 ICDT Gallaire & Nicolas, Logic and Databases: An Assessment 1990 3 ICDT Wolfson, A Comparative Analysis of Two-Phase-Commit Protocols 1990 3 ICDT Paris, Efficient Voting Protocols with Witnesses 1990 3 ICDT Borghoff, Voting and Relocation Strategies Preserving Consistency among Replicated Files 1988 2 ICDT Abiteboul, Updates, A New Frontier 1988 2 ICDT Beeri, Data Models and Languages for Databases 1988 2 ICDT Lynch & Merritt & Weihl & Fekete, A Theory of Atomic Transactions 1986 ICDT Abiteboul & Hull, Restructuring of Semantic Database Objects and Office Forms 1986 ICDT Atzeni & Parker, Set Containment Inference 1986 ICDT Buneman, A Domain Theoretic Approach to Higher-Order Relations 1986 ICDT Chan & Hernandez, On the Desirability of Gamma-Acyclic BCNF Database Schemes 1986 ICDT Chandra, Database Queries and Programming Constructs (Invited Lecture) 1986 ICDT Cholvy, Update Semantics under the Domain Closure Assumption 1986 ICDT Convent, Unsolvable Problems Related to the View Integration Approach 1986 ICDT De Bra, Horizontal Decompositions Based on Functional-Dependency-Set-Implications 1986 ICDT Hansdah & Patnaik, Update Serializability in Locking 1986 ICDT Kanellakis, Logic Programming and Parallel Complexity (Invited Lecture) 1986 ICDT Kifer & Lozinskii, Filtering Data Flow in Deductive Databases 1986 ICDT Kriegel & Seeger, Efficient Multidimensional Dynamic Hashing for Uniform and Non-Uniform Record Distributions 1986 ICDT Lakshmanan, Split-Freedom and MVD-Intersection: A New Characterization of Multivalued Dependencies Having Conflict-Free Covers 1986 ICDT Lausen & Soisalon-Soininen & Widmayer, Towards Online Schedulers Based on Pre-Analysis Locking 1986 ICDT Lerat, Query Processing in Incomplete Logical Databases 1986 ICDT Loizou & Thanisch, A Polynomial-time Join Dependency Implication Algorithm for Unary Multi-valued Dependencies 1986 ICDT Lynch & Merritt, Introduction to the Theory of Nested Transactions 1986 ICDT Makowsky & Markowitz & Rotics, Entity-Relationship Consistency for Relational Schemas 1986 ICDT Malvestuto, Modelling Large Bases of Categorized Data with Acyclic Schemes 1986 ICDT Naqvi, Some Extensions to the Closed World Assumption in Databases 1986 ICDT Oommen & Hansen, List Organizing Strategies Using Stochastic Move-to-Front and Stochastic Move-to-Rear Operations 1986 ICDT Rathmann, The Cost of Locking 1986 ICDT Scholl, Theoretical Foundation of Algebraic Optimization Utilizing Unnormalized Relations 1986 ICDT Van Gucht, Interaction-Free Multivalued Dependency Sets 1986 ICDT Wilkins, Updating Logical Databases Containing Null Values 1986 ICDT Wolfson, A New Characterization of Distributed Deadlock in Databases 1986 ICDT Zaniolo, The Generalized Counting Method for Recursive Logic Queries (Invited Lecture) 1993 ICFMPA Ershov, Theory of Domains and Nearby 1993 ICFMPA Grundy, Predicative Programming -- A Survey 1993 ICFMPA Futschek, Algebraic Properties of Loop Invariants 1993 ICFMPA Cousot & Cousot, Galois Connection Based Abstract Interpretations for Strictness Analysis 1993 ICFMPA Moller, Algebraic Calculation of Graph and Sorting Algorithms 1996 3 ICGI Magerman, Learning Grammatical Structure Using Statistical Decision-trees 1996 3 ICGI Knuutila, Inductive Inference from Positive Data: From Heuristic to Characterizing Methods 1996 3 ICGI Apsitis & Freivalds & Simanovskis & Smotrovs, Unions of Identifiable Families of Languages 1996 3 ICGI de la Higuera, Characteristic Sets for Polynomial Grammatical Inference 1996 3 ICGI Vilar, Query Learning of Subsequential Transducers 1996 3 ICGI Brent & Cartwright, Lexical Categorization: Fitting Template Grammars by Incremental MDL Optimization 1996 3 ICGI Tillmann & Ney, Selection Criteria for Word Trigger Pairs in Language Modelling 1996 3 ICGI Fred, Clustering of Sequences Using Minimum Grammar Complexity Criterion 1996 3 ICGI Takada & Nishida, A Note on Grammatical Inference of Slender Context-Free Languages 1996 3 ICGI Sempere & Fos, Learning Linear Grammars from Structural Information 1996 3 ICGI Alquezar & Sanfeliu & Cueva, Learning of Context-Sensitive Language Acceptors through Regular Inference and Constrained Induction 1996 3 ICGI Samuelsson & Tapanainen & Voutilainen, Inducing Constraint Grammars 1996 3 ICGI Deligne & Yvon & Bimbot, Introducing Statistical Dependencies and Structural Constraints in Variable-Length Sequence Models 1996 3 ICGI Gregor & Thomason, A Disagreement Count Scheme for Inference of Constrained Markov Networks 1996 3 ICGI Vidal & Llorens, Using Knowledge to Improve N-gram Language Modelling through the MGGI Methodology 1996 3 ICGI Blasig, Discrete Sequence Prediction with Commented Markov Models 1996 3 ICGI Ruiz & Garcia, Learning k-Piecewise Testable Languages from Positive Data 1996 3 ICGI Emerald & Subramanian & Thomas, Learning Code Regular and Code Linear Languages 1996 3 ICGI Dupont, Incremental Regular Inference 1996 3 ICGI Parekh & Honavar, An Incremental Interactive Algorithm for Grammar Inference 1996 3 ICGI Lorenzo, Inductive Logic Programming for Discrete Event Systems 1996 3 ICGI Golea & Matsuoka & Sakakibara, Stochastic Simple Recurrent Neural Networks 1996 3 ICGI Carrasco & Forcada & Santamaria, Inferring Stochastic Regular Grammars with Recurrent Neural Networks 1996 3 ICGI Casacuberta, Maximum Mutual Information and Conditional Maximum Likelihood Estimation of Stochastic Regular Syntax-directed Translation Schemes 1996 3 ICGI Giordano, Grammatical Inference Using Tabu Search 1996 3 ICGI Oncina & Varo, Using Domain Information During the Learning of a Subsequential Transducer 1996 3 ICGI de la Higuera & Oncina & Vidal, Identification of DFA: Data-dependent vs Data-independent Algorithms 1994 2 ICGI Vidal, Grammatical Inference: An Introductory Survey 1994 2 ICGI Itai, Learning Morphology -- Practice Makes Good 1994 2 ICGI Takada, A Hierarchy of Language Families Learnable by Regular Language Learners 1994 2 ICGI Dupont & Miclet & Vidal, What Is the Search Space of the Regular Inference? 1964 ICLMPS Cobham, The Intrinsic Computational Difficulty of Functions 1960 ICLMPS Schwartz, The Pernicious Influence of Mathematics on Science 1984 ICM Slisenko, Linguistic Considerations in Devising Effective Algorithms 1984 ICM Karp, The Probabilistic Analysis of Combinatorial Algorithms 1984 ICM Letichevsky, Abstract Data Types and Finding Invariants of Programs 1984 ICM Tarjan, Efficient Algorithms for Network Optimization 1984 ICM Valiant, An Algebraic Approach to Computational Complexity 1975 2 ICM Meyer, The Inherent Computational Complexity of Theories of Ordered Sets 1975 2 ICM Paterson, Complexity of Product and Closure Algorithms for Matrices 1975 2 ICM Strassen, Some Results in Algebraic Complexity Theory 1975 2 ICM Szemeredi, On Sets of Integers Containing No k Elements in Arithmetic Progression 1974 ICM Meyer, The Inherent Computational Complexity of Theories of Ordered Sets 1996 ICML Lathrop, On the Learnability of the Uncomputable 1996 ICML Vapnik, Statistical Theory of Generalization (abstract only) 1995 12 ICML Abe & Li & Nakamura, On-line Learning of Binary Lexical Relations Using Two-dimensional Weighted Majority Algorithms 1995 12 ICML Auer & Holte & Maass, Theory and Applications of Agnostic PAC-Learning with Small Decision Trees 1995 12 ICML Blackmore & Miikkulainen, Visualizing High-Dimensional Structure with the Incremental Grid Growing Neural Network 1995 12 ICML Blum, Empirical Support for Winnow and Weighted-Majority Based Algorithms: Results on a Calendar Scheduling Domain 1995 12 ICML Littlestone, Comparing Several Linear-threshold Learning Algorithms on Tasks Involving Superfluous Attributes 1995 12 ICML Maass & Warmuth, Efficient Learning with Virtual Threshold Gates 1995 12 ICML Niyogi, Free to Choose: Investigating the Sample Complexity of Active Learning of Real Valued Functions 1995 12 ICML Nock & Gascuel, On Learning Decision Committees 1995 12 ICML Oliveira & Sangiovanni-Vincentelli, Inferring Reduced Ordered Decision Graphs of Minimum Description Length 1995 12 ICML Schmidhuber, Discovering Solutions with Low Kolmogorov Complexity and High Generalization Capability 1993 10 ICML Frazier & Pitt, Learning From Entailment: An Application to Propositional Horn Sentences 1993 10 ICML Norton & Hirsh, Learning DNF Via Probabilistic Evidence Combination 1990 7 ICML Ko & Marron & Tzeng, Learning String Patterns and Tree Patterns from Examples 1990 7 ICML Obradovic & Parberry, Learning with Discrete Multi-Valued Neurons 1996 4 ICPADS Hsu, All-Fault-Tolerant Embedding of a Complete Binary Tree in a Group of Cayley Graphs 1996 4 ICPADS Chou & Hsu & Sheu, Bubblesort Star Graphs: A New Interconnection Network 1996 4 ICPADS Su & Chen & Duh, A Linear-Time Algorithm for Computing the Diameters of the Incomplete WK-Recursive Networks 1996 4 ICPADS Gu & Peng, An Efficient Algorithm for Set-To-Set Node-Disjoint Paths Problem in Hypercubes 1996 4 ICPADS Faloutsos & Molle, What Features Really Make Distributed Minimum Spanning Tree Algorithms Efficient? 1996 4 ICPADS Hamdi & Tong & Kin, Fast Sorting Algorithms on Reconfigurable Array of Processors with Optical Buses 1996 4 ICPADS Chiu & Chen, Fault-Tolerant Routing Strategy Using Routing Capability in Hypercube Multicomputers 1996 4 ICPADS Yang & Tsai & Tsai, Adaptive Routing in k-ary n-cube Multicomputers 1996 4 ICPADS Park & Kim & Yoon, An Efficient Software Multicast Algorithm in Multiport Wormhole-Routed Multicomputers 1996 4 ICPADS Lee & Horng, Fast Parallel Chessboard Distance Transform Algorithms 1996 4 ICPADS Yip & Bambos, Scalable Routing Schemes for Massively Parallel Processing using Reconfigurable Optical Interconnect 1996 4 ICPADS Nakajima, Fault-Tolerant Distributed Match-Making with Weights 1996 4 ICPADS Cheng & Huang & Shiratori, A Distributed Algorithm for Implementation of First-Order Multiparty Interactions 1996 4 ICPADS Bouhmala & Knutti & Naegeli, A Distributed Algorithm for Optimizing Mesh Partitions 1994 ICPADS Kao & Horng, Computing List Ranking on a RAP with Wider Bus Networks 1994 ICPADS Horng, Semigroup Computation and Its Applications on Mesh-Connected Computers with Hyperbus Broadcasting 1994 ICPADS Lee & Chen, Convexity Problems on Reconfigurable Meshes 1994 ICPADS Lan & Chen, Multicast Communication in 2-D Mesh Networks 1994 ICPADS Zhou & Brent & Tridgell, Efficient Implementation of Sorting Algorithms on Asynchronous Distributed-Memory Machines 1994 ICPADS Anupindi & An & Cooley & Yang, A New and Efficient FFT Algorithm for Distributed Memory Systems 1994 ICPADS Tsai & McKinley, Broadcast in All-Port Wormhole-Routed 3D Mesh Networks Using Extended Dominating Sets 1994 ICPADS Sui & Wang & Lee, Broadcasting on Faulty Hypercubes 1994 ICPADS Huang & Yang, Broadcasting on Uni-Directional Hypercubes 1994 ICPADS Tseng & Lai, On the Embedding of a Class of Regular Graphs in a Faulty Hypercube 1994 ICPADS Chung & Chen, Mapping Pyramids into 3-D Meshes 1994 ICPADS Shyu & Wang & Tang, An Efficient Emulation for Tree-Connected Networks 1994 ICPADS Liu & Sager & McMillin, An Improved Characterization of 1-Step Recoverable Embeddings: Rings in Hypercubes 1994 ICPADS Chan & Lim, Parallel Implementation of the Trie Structure 1994 ICPADS Jiang & Huang, Obtaining Nondominated K-Coteries for Fault-Tolerant Distributed K-Mutual Exclusion 1994 ICPADS Lien & Yuan, A New Approach of Constructing Information Structure for Mutual Exclusion in Distributed Systems 1994 ICPADS Wang & Lang, A Tree-Based Distributed Algorithm for the K-Entry Critical Section Problem 1994 ICPADS Duato, A Theory of Fault-Tolerant Routing in Wormhole Networks 1994 ICPADS Duato & Dao & Gaughan & Yalamanchili, Scouting: Fully Adaptive, Deadlock-Free Routing in Faulty Pipelined Networks 1994 ICPADS Shao & Oruc, Distributed Routing Schemes for Strictly Nonblocking Networks 1994 ICPADS Chiang & Chen, Pyramided Hypercube: An Extendable Cubic Network with Fixed Degree 1994 ICPADS Basu & Dattagupta & Dattagupta, CCT: A New VLSI Architecture for Parallel Processing 1994 ICPADS Cheng & Chuang, Varietal Hypercube -- A New Interconnection Network Topology for Large-Scale Multicomputer 1994 ICPADS Cull & Larson, A Linear Equation Model for Twisted Cube Networks 1992 ICPADS Liu & Shin & Chang, Prevention of Hot Spots in Packet-Switched Multistage Interconnection Networks 1992 ICPADS Yang & Tsai, Fault-Tolerant and Deadlock-Free Wormhole Routing in the Hypercube Network 1992 ICPADS Tien & Ho & Yang, Edge-Disjoint Spanning Trees in Incomplete Hypercubes 1992 ICPADS Trefftz & McKinley, Performance Evaluation of Wormhole Routing in Octagonal Mesh Direct Networks 1992 ICPADS Kaushik & Sharma & Huang & Johnson & Johnson & Sadayappan, An Algebraic Theory for Modeling Multistage Interconnection Networks 1992 ICPADS Jwo & Lakshmivarahan & Dhall, A New Approach to Design 1-Distance Transitive Cayley Graphs as the Architectures for Parallel Computers 1992 ICPADS Hamdi, Architectural Characteristics of the Directional Hypercube 1992 ICPADS Chen & Hwang, R-Network: A New Multipath Multistage Interconnection Network 1992 ICPADS Wu & Chang & Chang, On Testable Design of FFT Butterfly Networks 1992 ICPADS Park & Yoon & Lee & Eun, The Ring-Banyan Network: A Fault Tolerant Multistage Interconnection Network with an Adaptive Self-Routing 1992 ICPADS Sheu & Liaw & Chan, A Broadcasting Algorithm in Star Graph Interconnection Networks 1992 ICPADS Ranka & Wang & Fox, Static Runtime Algorithms for All-to-Many Personalized Communication on Permutation Networks 1992 ICPADS Juang & Venkatesan, Message and Time Optimal Crash Recovery in Tree Networks 1992 ICPADS Wu & Lai & Tseng, Consensus and Termination Detection in the Presence of Faulty Processes 1992 ICPADS Zhang & Law & Rezazadeh & Tseng, A New Approach for Mapping Algorithms with Complex Operations into VLSI Systolic Arrays 1992 ICPADS Liu & McMillin, An Enhanced Reconfigurable Embedding Scheme for Rings in Hypercubes 1992 ICPADS Tsay & Lee & Cheng, Mesh Algorithms for Shortest Path Problems Inside Simple Polygons 1992 ICPADS Yu & Chen, An Efficient Parallel Recognition Algorithm for Bipartite-Permutation Graphs 1992 ICPADS Tseng & Lai & Wu, Low-Congestion Embedding of Multiple Graphs in a Hypercube 1992 ICPADS Greenwood & Somani, A Methodology for Mapping Pipelined Algorithms onto Hypercube Arrays 1992 ICPADS Lin & Oruc, Constant Time Inner Product and Matrix Computations on Permutation-Network-Based Processors 1995 24 ICPP Kim & Yoon & Maeng & Cho, Drop-and-Reroute: A New Flow Control Policy for Adaptive Wormhole Routing 1995 24 ICPP Lee & Kim & Kim & Lee, Adaptive Virtual Cut-through as an Alternative to Wormhole Routing 1995 24 ICPP Tseng & Gupta, All-to-All Personalized Communication in a Wormhole-Routed Torus 1995 24 ICPP Michallon & Trystram, Minimum Depth Arcs-Disjoint Spanning Trees for Broadcasting on Wrap-Around Meshes 1995 24 ICPP Chae & Kim & Kim & Hong & 7Lee, DTN: A New Partitionable Torus Topology 1995 24 ICPP Zheng, Sparse Hypernetworks Based on Steiner Triple Systems 1995 24 ICPP Hsu & Wei, Permutation Routing and Sorting on Directed de Bruijn Networks 1995 24 ICPP Suh & Dao & Duato & Yalamanchili, Software Based Fault-Tolerant Oblivious Routing in Pipelined Networks 1995 24 ICPP Boura & Das, Fault-tolerant Routing in Mesh Networks 1995 24 ICPP Boppana & Chalasani, Fault-Tolerant Multicast Communication for Multicomputers 1995 24 ICPP Huang & JaJa, An Optimal Ear Decomposition Algorithm with Applications on Fixed-Size Linear Arrays 1995 24 ICPP Cai & Huang & Lin, Embedding Two-Dimensional Grids into Hypercubes with Dilation 2 and Congestion 5 1995 24 ICPP Karypis & Kumar, Multilevel Graph Partitioning Schemes 1995 24 ICPP Mahmood & Lynch & Shaffer, Optimal Circuit-Switched Routing in Hypercubes 1995 24 ICPP Wu, Unicasting in Faulty Hypercubes Using Safety Levels 1995 24 ICPP De Coster & Dewulf & Ho, Efficient Multi-Packet Multicast Algorithms on Meshes with Wormhole and Dimension-Ordered Routing 1995 24 ICPP Liu & Petit & Dirkx, Performance Assessment of Large ATM Switching Networks with Parallel Simulation Tool 1995 24 ICPP Eshaghian & Miller, The Systolic Reconfigurable Mesh 1995 24 ICPP Rajasekaran & Sahni, Sorting and Selection on Distributed Memory Bus Computers 1995 24 ICPP Fernandez & Eleser & Efe, Generalized Algorithm for Parallel Sorting on Product Networks 1995 24 ICPP Lee & Varman, Prefetching and I/O Parallelism in Multiple Disk Systems 1995 24 ICPP Das & Sarkar & Pinotti, Application to Distributed Heap Implementation 1995 24 ICPP Ulm & Baker, Solving a Two-Dimensional Knapsack Problem on a Mesh with Multiple Buses 1995 24 ICPP Bokka & Gurla & Olariu & Schwing & Wilson, A Framework for Solving Geometric Problems on Enhanced Meshes 1995 24 ICPP Wong & Stokley & Nguyen & Quammen & Wang, Binary-Exchange Algorithms on a Packed Exponential Connections Network 1995 24 ICPP Hoel & Samet, Data-Parallel Primitives for Spatial Operations 1995 24 ICPP Heirich & Taylor, A Parabolic Load Balancing Method 1994 23 ICPP Seo & Feng, A General Inside-Out Routing Algorithm for a Class of Rearrangeable Networks 1994 23 ICPP Fernandes & Friesen & Kanevsky, Efficient Routing and Broadcasting in Recursive Interconnection Networks 1994 23 ICPP Hamacher & Jiang, Comparison of Mesh and Hierarchical Networks for Multiprocessors 1994 23 ICPP Efe & Fernandez, Computational Properties of Mesh Connected Trees: Versatile Architectures for Parallel Computation 1994 23 ICPP Liotopoulos & Chalasani, Nonblocking Operations of Asymmetrical Clos Networks 1994 23 ICPP Feng & Kim, A New Tag Scheme and Its Tree Representation For A Shuffle-Exchange Network 1994 23 ICPP Park & Watson, On the Rearrangeability of Reverse Shuffle/Exchange Networks 1994 23 ICPP Lee & Batcher, On Sorting Multiple Bitonic Sequences 1994 23 ICPP Tsai & Shin, Sequencing of Concurrent Communication Traffic in a Mesh Multicomputer with Virtual Channels 1994 23 ICPP Robinson & McKinley & Cheng, Optimal Multicast Communication in a Wormhole-Routed Torus Networks 1994 23 ICPP Duato, A Necessary and Sufficient Condition for Deadlock-Free Adaptive Routing in Wormhole Networks 1994 23 ICPP Srivastava & Kumar & Pathak, Distributed Approach for Implementing Genetic Algorithms 1994 23 ICPP Traff, Distributed, Synchronized Implementation of an Algorithm for the Maximum Flow Problem 1994 23 ICPP Fleury & Fraigniaud, Multicasting in Meshes 1994 23 ICPP Chen & Tripathi & Blackmore, A Resource Synchronization Protocol for Multiprocessor Real-Time Systems 1994 23 ICPP Lan, A Fault-Tolerant Routing Algorithm in Hypercubes 1994 23 ICPP Ho & Kao, Optimal Broadcast in All-Port Wormhole-Routed Hypercubes 1994 23 ICPP Lee & Kim, Path Selection for Communicating Tasks in a Wormhole-Routed Multicomputer 1994 23 ICPP Datta, Efficient Parallel Algorithms for Geometric Partitioning Problems Through Parallel Range Searching 1994 23 ICPP Bokka & Gurla & Olariu & Schwing, Constant Time Convexity Problems on Dense Reconfigurable Meshes 1994 23 ICPP Trahan & Vaidyanathan & Subbaraman, Constant Time Graph and Poset Algorithms on the Reconfigurable Multiple Bus Machine 1994 23 ICPP Kao & Horng, Computing k-vertex Connectivity on an Interval Graph 1994 23 ICPP Das & Min, A Unified Approach to Construct Search Trees in Parallel 1994 23 ICPP Nigam & Sahni, Triangulation on a Reconfigurable Mesh With Buses 1994 23 ICPP Lyuu & Schenfeld, Parallel Graph Contraction with Applications to a Reconfigurable Parallel Architecture 1994 23 ICPP Ray & Jiang, Sequential and Parallel Algorithms for Partitioning Tree Task Graphs on a Shared Memory Architecture 1994 23 ICPP Makki & Havas, Distributed Algorithms for Constructing a Depth-First-Search Tree 1993 22 ICPP Kyriakis-Bitzaros & Koufopavlou & Goutis, Space-Time Representation of Iterative Algorithms and the Design of Regular Processor Arrays 1993 22 ICPP Sun, On the Parallel Diagonal Dominant Algorithm 1993 22 ICPP Sheffler & Bryant, An Analysis of Hashing on Parallel and Vector Computers 1993 22 ICPP Hoel & Samet, Data-Parallel R-Tree Algorithms 1993 22 ICPP Kao & Horng & Tsai, Computing Connected Components and Some Related Applications on a RAP 1993 22 ICPP Day & Tripathi, Embedding Grids, Hypercubes, and Trees in Arrangement Graphs 1993 22 ICPP Huang & Liu & Verma, On Embeddings of Rectangles into Optimal Squares 1993 22 ICPP Ibarra & Zheng, Finding Articulation Points and Bridges of Permutation Graphs 1993 22 ICPP Sharp & While, Pattern Recognition Using Fractals 1993 22 ICPP Helman & Ja'Ja', Efficient Image Processing Algorithms on the Scan Line Array Processor 1993 22 ICPP Shi & Ritter, O(n)-Time and O(log n)_Space Image Component Labeling with Local Operators on SIMD Mesh Connected Computers 1993 22 ICPP Gupta & Kumar, Scalability of Parallel Algorithms for Matrix Multiplication 1993 22 ICPP Chen & Krishnamurthy & Macleod, Generalised Matrix Inversion by Successive Matrix Squaring 1993 22 ICPP Tseng & Lai, Ring Embedding in an Injured Hypercube 1993 22 ICPP Lee & Oruc, Fast Parallel Algorithms for Routing One-To-One Assignments in Benes Networks 1993 22 ICPP Liu & Lee, Optimal Routing Algorithms for Generalized de Bruijn Digraphs 1993 22 ICPP Boura & Das, A Class of Partially Adaptive Routing Algorithms for n_dimensional Meshes 1993 22 ICPP Lin & Lai, Generation of Long Sorted Runs on a Unidirectional Array 1993 22 ICPP Bhagavathi & Gurla & Olariu & Schwing & Shen & Wilson & Zhang, Time- and VLSI-Optimal Sorting on Meshes with Multiple Broadcasting 1993 22 ICPP Kale & Krishnan, A Comparison Based Parallel Sorting Algorithm 1993 22 ICPP Blackston & Ranade, SnakeSort: A Family of Simple Optimal Randomized Sorting Algorithms 1993 22 ICPP Wen, Merging Multiple Lists in O(log n) Time 1993 22 ICPP Al-Hajery & Batcher, On the Bit-Level Complexity of Bitonic Sorting Networks 1993 22 ICPP Wang & Hwang, Multicoloring for Fast Sparse Matrix-Vector Multiplication in Solving PDE Problems 1993 22 ICPP Han & Igarashi, Efficient Parallel Shortest Path Algorithms for Banded Matrices 1993 22 ICPP Lin & Lu, Parallel Implementations of a Scalable Consistent Labeling Technique on Distributed Memory Multi-Processor Systems 1993 22 ICPP Srimani, Maximally Fault Tolerant Directed Network Graph With Sublogarithmic Diameter For Arbitrary Number of Nodes 1993 22 ICPP Park & Prasanna & Jang, Fast Arithmetic on Reconfigurable Meshes 1993 22 ICPP Raghavendra & Sridhar & Harikumar, Prefix Computation On a Faulty Hypercube 1993 22 ICPP Bhagavathi & Gurla & Olariu & Lin & Schwing & Zhang, Square Meshes Are Not Optimal For Convex Hull Computation 1993 22 ICPP Efe, Embedding Large Mesh of Trees and Related Networks in the Hypercube With Load Balancing 1993 22 ICPP Cappello & Bechennec & Delaplace & Germain & Giavitto & Neri & Etiemble, Balanced Distributed Memory Parallel Computers 1993 22 ICPP Ravikumar & Kuchlous & Manimaran, Incomplete Star Graph: An Economical Fault-tolerant Interconnection Network 1993 22 ICPP Latifi & Moraes de Azevedo & Bagherzadeh, The Star Connected Cycles: A Fixed-Degree Network for Parallel Processing 1993 22 ICPP Tzeng, Empirical Evaluation of Incomplete Hypercube Systems 1993 22 ICPP Liu & Lee, A Distributed Multicast Algorithm for Hypercube Multicomputers 1993 22 ICPP Liszka & Batcher, A Generalized Bitonic Sorting Network 1993 22 ICPP Mohapatra & Yu & Das & Kim, A Lazy Scheduling Scheme for Improving Hypercube Performance 1993 22 ICPP Das Sharma & Pradhan, Fast and Efficient Strategies for Cubic and Non-Cubic Allocation in Hypercube Multiprocessors 1993 22 ICPP Ghafoor, Random Routing of Tasks in Hypercube Architectures 1993 22 ICPP Chang & Bhuyan, Fault Tolerant Subcube Allocation in Hypercubes 1993 22 ICPP Dighe & Vaidyanathan & Zheng, Bus-Based Tree Structures for Efficient Parallel Computation 1993 22 ICPP Wang & Siegel & Nichols & Abraham, Reducing the Effect of Hot Spots by using a Multipath Network 1993 22 ICPP Lin & McKinley & Ni, The Message Flow Model for Routing in Wormhole-Routed Networks 1993 22 ICPP Hsu & Chung, Generalized Fibonacci Cubes 1993 22 ICPP Yashovardhan & Potlapalli & Agrawal, HMIN: A New Method for Hierarchical Interconnection of Processors 1993 22 ICPP Breznay & Lopez, Tightly Connected Hierarchical Interconnection Networks for Parallel Processors 1993 22 ICPP Ohring & Das, The Folded Petersen Network: A New Communication-Efficient Multiprocessor Topology 1993 22 ICPP Fernandes & Kanevsky, Hierarchical WK-Recursive Topologies for Multicomputer Systems 1993 22 ICPP Fernandes & Kanevsky, Substructure Allocation in Recursive Interconnection Networks 1993 22 ICPP Kohli & Neiger & Ahamad, A Characterization of Scalable Shared Memories 1992 21 ICPP Kumagai, Inorder Skew: A Skewing Scheme for Parallel Tree Memories 1992 21 ICPP Koppelman, Reducing PE/Memory Traffic in Shared Memory Multiprocessors by the Difference Coding of Addresses 1992 21 ICPP Lan, Multicast in Faulty Hypercubes 1992 21 ICPP Bolding & Konstantinidou, On the Comparison of Hypercube and Torus Networks 1992 21 ICPP Konstantinidou, Priorities in Nonminimal, Adaptive Routing 1992 21 ICPP Das & Mukhopadhyaya & Sinha, Bridged and Twisted Hypercubes with Reduced Diameters 1992 21 ICPP Fernandes, Recursive Interconnection Networks for Multicomputer Networks 1992 21 ICPP Huang & Wu, Balanced Hypercubes 1992 21 ICPP Johnson & Goodman, Synthesizing General Topologies from Rings 1992 21 ICPP Rooks & Preiss, A Unifying Framework for Distributed Routing Algorithms 1992 21 ICPP Glass & Ni, Maximally Fully Adaptive Routing in 2D Meshes 1992 21 ICPP Aly & Dowd, Parallel Computer Reconfigurability Through Optical Interconnects 1992 21 ICPP Alnuweiri & Kumar, Optimal Multipass Self-Routing Algorithms for Clos-Type Multistage Networks 1992 21 ICPP Das & Mukhopadhyaya & Dattagupta, A Versatile External Control Method for Self-Routable Permutations in Benes Network 1992 21 ICPP Alleyne & Scherson, Expanded Delta Networks for Very Large Parallel Computers 1992 21 ICPP Lee & Oruc, Design of Efficient and Easily Routable Generalized Connectors 1992 21 ICPP Tang & Padubidri, Routing and Diameter Analysis of Diagonal Mesh Networks 1992 21 ICPP Chang & Bhuyan, Extending Multistage Interconnection Networks for Multitasking 1992 21 ICPP Abdennadher & Feng, On Rearrangeability of Omega-Omega Networks 1992 21 ICPP Guha, A Design for Self-Routing Nonblocking Interconnection Networks 1992 21 ICPP Augustine & Varadarajan, Efficient Mappings for Multi-dimensional Systolic Arrays Using Flexible Buffer Structures 1992 21 ICPP Cam & Fortes, Fault-Tolerant Self-Routing Permutation Networks 1992 21 ICPP Markatos & LeBlanc, Load Balancing vs. Locality Management in Shared-Memory Multiprocessors 1992 21 ICPP Chien & Oruc, Adaptive Binary Sorting Schemes and Associated Interconnection Networks 1992 21 ICPP Lin, Reconfigurable Buses with Shift Switching...VLSI Radix Sort 1992 21 ICPP Bhagavathi & Looges & Olariu & Schwing & Zhang, A Fast Selection Algorithm for Meshes with Multiple Broadcasting 1992 21 ICPP Sheu & Su, A Multicast Algorithm for Hypercube Multiprocessors 1992 21 ICPP Wu, Fault-Tolerant Nonredundant Broadcasting in Hypercubes 1992 21 ICPP Heydemann & Opatrny & Sotteau, Embeddings of Hypercubes and Grids into de Bruijn Graphs 1992 21 ICPP Liu & McMillin, A Divide and Conquer Ring Embedding Scheme in Hypercubes with Efficient Recovery Ability 1992 21 ICPP Bruck & Cypher & Ho, Fault-Tolerant de Bruijn and Shuffle-Exchange Networks 1992 21 ICPP Varvarigos & Bertsekas, Partial Multinode Broadcast Algorithms for D-Dimensional Meshes 1992 21 ICPP Ho & Raghunath, Efficient Algorithm for Gray-to-Binary Permutation on Hypercubes 1992 21 ICPP Park & Prasanna, A Class of Optimal VLSI Architectures for Computing Discrete Fourier Transform 1992 21 ICPP Khan & Lin & Yun, A Parallel Matrix Inversion Algorithm on Torus with Adaptive Pivoting 1992 21 ICPP Noh & Moon & Agrawala, The RPT Parallel Gaussian Elimination Algorithm 1992 21 ICPP Szymanski, The Complexity of FFT and Related Butterfly Algorithms on Meshes and Hypermeshes 1992 21 ICPP Ganapathy & Wah, Synthesizing Optimal Lower Dimensional Processor Arrays 1992 21 ICPP Prasanna & Rao, Parallel Orientation of Polygonal Parts 1992 21 ICPP Jeong & Kim & Baek, Parallel Computation of Congruent Regions on SIMD Machines 1992 21 ICPP Jang & Prasanna, Efficient Parallel Algorithms for Some Geometric Problems on Reconfigurable Mesh 1992 21 ICPP Narayanaswami & Franklin, Boolean Combinations of Polygons in Parallel 1992 21 ICPP Lee & Zheng, Constructing Voronoi Diagram of a Point Set on Mesh of Trees 1992 21 ICPP Hsu & Page & Liu, Computing Prefixes on a Large Family of Interconnection Topologies 1992 21 ICPP Yu & Tseng & Lin, Optimal Parallel Algorithms for Some Problems on Trees 1992 21 ICPP Ulm & Wang, Solving a Two-Dimensional Knapsack Problem on SIMD Computers 1992 21 ICPP Ieumwananonthachai & Wah, Parallel Statistical Selection in Multiprocessors 1992 21 ICPP Cypher & Gravano, Adaptive, Deadlock-Free Packet Routing in Torus Networks with Minimal Storage 1992 21 ICPP Sengupta & Elfe, On Fault-Tolerant Routing in Interconnection Digraphs 1992 21 ICPP Zhong & Lo, An Efficient Heuristic for Application-Specific Routing on Mesh Connected Multicomputers 1992 21 ICPP Thurimella & Yesha, A Scheduling Principle for Precedence Graphs with Communication Delay 1992 21 ICPP Sheu & Chen & Chang, Fault-Tolerant Sorting Algorithm on Hypercube Multicomputers 1992 21 ICPP Lin, Perfectly Overlapped Sorting on a Linear Array 1992 21 ICPP Guo, Sorting on Array Processors with Pipelined Busses 1992 21 ICPP Bolorforoush & Coleman & Quammen & Wang, A Parallel Randomized Sorting Algorithm 1992 21 ICPP Deo & Jain & Medidi, Constructing Height Balanced Trees in Parallel 1992 21 ICPP Chen & Tzeng, Quick Determination of Subcubes in a Faulty Hypercube 1992 21 ICPP Adamson & Tick, Parallel Algorithms for the Single-Source Shortest-Path Problem 1992 21 ICPP Kim & Lai & Tseng, Compacting Free Buddy Subcubes in a Hypercube 1991 20 ICPP Klass & Weiser, Efficient Systolic Array for Matrix Multiplication 1991 20 ICPP ElGindy & Wegrowicz, Selection on the Reconfigurable Mesh 1991 20 ICPP Chen & Das, Breadth-First Traversal of Trees and Integer Sorting in Parallel 1991 20 ICPP Wang & Chen & Hsu, Bitonic Sort with an Arbitrary Number of Keys 1991 20 ICPP Kuo & Liang, Efficient Parallel Sorting and Merging Algorithms for Two-Dimensional Mesh-Connected Processor Arrays 1991 20 ICPP Saha & Wagh, Algorithms for Determining Optimal Partitions in Parallel Divide-and-Conquer Computations 1991 20 ICPP Greenberg & Mitrani, Massively Parallel Algorithms for Network Partition Functions 1991 20 ICPP Colbrook & Brewer & Dellarocas & Weihl, An Algorithm for Concurrent Search Trees 1991 20 ICPP Holey & Ibarra, Triangulation, Voronoi Diagram, and Convex Hull in k-Space on Mesh-Connected Arrays and Hypercubes 1991 20 ICPP Chaudhary & Aggarwal, On the Complexity of Parallel Image Component Labeling 1991 20 ICPP Miller & Tanimoto, Detecting Repeated Patterns on Mesh Computers 1991 20 ICPP Horng & Kleinrock, On the Performance of a Deadlock-free Routing Algorithm for Boolean n-Cube Interconnection Networks with Finite Buffers 1991 20 ICPP Fulgham & Cypher & Sanz, A Comparison of SIMD Hypercube Routing Strategies 1991 20 ICPP Krishnakumar & Hegde & Iyengar, Fault Tolerant Based Embeddings of Quadtrees into Hypercubes 1991 20 ICPP Liu & Huang, Dilation-6 Embeddings of 3-Dimensional Grids into Optimal Hypercubes 1991 20 ICPP Sur & Srimani, A Fault-Tolerant Routing Algorithm for Star Graph Interconnection Network 1991 20 ICPP Scherson & Huang, Embedding Binary Trees in Orthogonal Graphs 1991 20 ICPP Narayanaswami, A Practical Convex Hull Algorithm 1991 20 ICPP Wu & Tang, Ranking, Unranking, and Parallel Enumerating of Topological Orders 1991 20 ICPP dl la Torre & Kruskal, Fast and Efficient Parallel Algorithms for Single Source Lexicographic Depth-First Breadth-First Search and Topological-First Search 1991 20 ICPP Li & Wu, A Multidestination Routing Scheme for Hypercube Multiprocessors 1991 20 ICPP Woo & Block, A Recursive Mutual Exclusion Algorithm for Multiprocessor Systems with Shared Memory 1991 20 ICPP Wang & Chen & Yu, Cost-Optimal Parallel Algorithms for Constructing B-Trees 1991 20 ICPP Tseng & Hao, An NC Algorithm for Recognizing Strict 2-threshold Graphs 1991 20 ICPP Wan & Shannon, Using Separators Instead of Dynamic Programming in Approximation Algorithms for Planar Graphs 1991 20 ICPP Jennings & Lingas & Motyckova, Dynamic Detection of Forest of Tree-Connected Meshes 1991 20 ICPP Gerasch, A Parallel Approximation Algorithm for 0/1 Knapsack 1991 20 ICPP Mendelson & Koren, Using Simulated Annealing for Mapping Algorithms onto Data Driven Arrays 1991 20 ICPP Chen & Zhu, A New Synchronization Mechanism 1991 20 ICPP Batcher, Decomposition of Perfect Shuffle Networks 1991 20 ICPP Jan & Oruc, Fast Self-Routing Permutation Networks 1991 20 ICPP Das & Mukhopadhyaya & Dattagupta, On Self-Routable Permutations in Benes Network 1991 20 ICPP Yeh & Feng, Fault Tolerant Routing on a Class of Rearrangeable Networks 1991 20 ICPP Menezes & Bakhru & Sergent, New Bounds on the Reliability of Two Augmented Shuffle-Exchange Networks 1991 20 ICPP Shih & Batcher, Multiple-Fault Tolerant Cube-Connected Cycles Networks 1991 20 ICPP Boppana & Raghavendra, Efficient Storage Schemes for Arbitrary Size Square Matrices in Parallel Processors with Shuffle-Exchange Networks 1991 20 ICPP Lin & McKinley & Ni, Performance Evaluation of Multicast Wormhole Routing in 2D-Mesh Multicomputers 1991 20 ICPP Szymanski, O(log N/log log N) Randomized Routing in Degree-log N ``Hypermeshes'' 1991 20 ICPP Szymanski & Fang, Randomized Routing of Virtual Connections in Extended Banyans 1991 20 ICPP Kumar & Patnaik, Fault-Tolerant Message Routing and Error Detection Schemes for the Extended Hypercube 1991 20 ICPP Yang & Tien & Raghavendra, Embedding of Multidimensional Meshes onto Faulty Hypercubes 1991 20 ICPP Myoupo, A Way of Deriving Linear Systolic Arrays from a Mathematical Algorithm Description: Case of the Warshall-Floyd Algorithm 1991 20 ICPP Youssef, Cartesian Product Networks 1991 20 ICPP Pan & Chuang, Block Shift Network: A New Interconnection Network for Efficient Parallel Computation 1991 20 ICPP Bennett & Sohn, Layered Networks, A New Class of Multistage Interconnection Networks 1991 20 ICPP Bruck & Cypher & Ho, On the Construction of Fault-Tolerant Cube-Connected Cycles Networks 1991 20 ICPP Blough & Tsai, Binary Hypermesh Networks for Parallel Processing 1991 20 ICPP Rowley & Bose, Fault-Tolerant Ring Embedding in the de Bruijn Networks 1991 20 ICPP Fang & Chen, Embedding Large Binary Trees to Hypercube Multiprocessors 1991 20 ICPP Tien & Raghavendra, Simulation of SIMD Algorithms on Faulty Hypercubes 1991 20 ICPP Hsu, Fibonacci Cubes -- Properties of an Asymmetric Interconnection Topology 1990 19 ICPP Menn & Somani, An Efficient Sorting Algorithm for the Star Graph Interconnection Network 1990 19 ICPP Steinberg & Solomon, Searching Game Trees in Parallel 1990 19 ICPP Varman & Iyer & Scheufler, A Multiprocessor Algorithm for Merging Multiple Sorted Lists 1990 19 ICPP Wang & Lu & Chen, Constant Time Algorithms for the Transitive Closure Problem and Its Applications 1990 19 ICPP Martel & Subramonian, Asynchronous PRAM Algorithms for List Ranking and Transitive Closure 1990 19 ICPP Ramkumar & Rangan, Parallel Algorithms on Interval Graphs 1990 19 ICPP Holey & Ibarra, Iterative Algorithms for Planar Convex Hull on Mesh-Connected Arrays 1990 19 ICPP Lee & Shin, Interleaved All-to-All Reliable Broadcast on Meshes and Hypercubes 1990 19 ICPP Lin & Ni, Multicast Communication in Multicomputer Networks 1990 19 ICPP Lin, A Dimension-Scrambling Approach to Fast Hypercube Data Permutations 1990 19 ICPP Iqbal, Efficient Algorithms for Partitioning Problems 1990 19 ICPP Lo & Rajopadhye & Gupta & Keldsen & Mohamed & Telle, Mapping Divide-and-Conquer Algorithms to Parallel Architectures 1990 19 ICPP Kumar & Singh, Scalability of Parallel Algorithms for the All-Pairs Shortest Path Problem: A summary of Results 1990 19 ICPP Kuo & Chen, The Steiner Problem in Distributed Computing System 1990 19 ICPP Yu & Chen & Lee, An Optimal Parallel Algorithm for Minimum Coloring of Intervals 1990 19 ICPP Deo & Prasad, Parallel Heap 1990 19 ICPP Ibarra & Jiang & Wang, String Editing on a One-way Linear Array of Finite-state Machines 1990 19 ICPP Kratzer, Massively Parallel Sparse-Matrix Computations 1990 19 ICPP Huang & Liu & Viswanathan, A Sub-linear Parallel Algorithm for Some Dynamic Programming Problems 1990 19 ICPP Paden & Christopher, The Statistical Evaluation of a Hypercube Algorithm for the 0/1 Knapsack Problem 1990 19 ICPP Chen & Chen & Chen, Two-Variable Linear Programming on Mesh-Connected Computers with Multiple Broadcasting 1990 19 ICPP Panwar & Mazumder, A Parallel Karmarkar Algorithm on Orthogonal Tree Networks 1990 19 ICPP Nag & Sarrafzadeh, A Parallel Algorithm for Two-Layer Wiring 1990 19 ICPP Witte & Chamberlain & Franklin, Parallel Simulated Annealing Using Speculative Computation 1990 19 ICPP Belkhale & Banerjee, Geometric connected Component Labeling on Distributed Memory Multicomputers 1990 19 ICPP Chang & Singhal & Liu, An Improved O(log N) Mutual Exclusion Algorithm for Distributed Systems 1990 19 ICPP Ho & Johnsson, Embedding Three-Dimensional Meshes in Boolean Cubes by Graph Decomposition 1990 19 ICPP Chen & Chung, Embedding Networks with Ring Connections in Hypercube Machines 1990 19 ICPP Tzeng & Chenm & Chuang, Embeddings in Incomplete Hypercubes 1990 19 ICPP Nigam & Sahni & Krishnamurthy, Embedding Hamiltonians and Hypercubes in Star Interconnection Graphs 1990 19 ICPP Datta & Krithivasan, Efficient Algorithms for the Maximum Empty Rectangle Problem in Shared Memory and Other Architectures 1990 19 ICPP Han & Carlson, The Design and Analysis of the Parallel Prefix Computation Algorithm 1990 19 ICPP Corbett & Scherson, A New Algorithm for Sorting on Multidimensional Mesh-Connected Processors 1990 19 ICPP Efe, Embedding Mesh of Trees in the Hypercube 1990 19 ICPP Huang, Computing Local Sequence Similarities on a Hypercube 1990 19 ICPP Adhar & Peng, Parallel Algorithms for Path Covering, Hamiltonian Path and Hamiltonian Cycle in Cographs 1989 18 ICPP Szymanski, On the Permutation Capability of a Circuit-Switched Hypercube 1989 18 ICPP Bernhard & Hunt & Rosenkrantz, Compaction of Message Patterns into Space-Efficient Representations for Multiprocessor Interconnection Networks (Extended Abstract) 1989 18 ICPP Abraham & Padmanabhan, An Analysis of the Twisted Cube Topology 1989 18 ICPP Ibarra & Sohn, On Mapping Systolic Algorithms onto the Hypercube 1989 18 ICPP Latifi & El-Amawy, On Folded Hypercubes 1989 18 ICPP Berman & Garay, Efficient Agreement on Bounded-Degree Networks (Extended Abstract) 1989 18 ICPP Liang & Chen & Tsai, Embedding of Linear Array and Binary Tree in Cubical Ring Connected Cycles Networks 1989 18 ICPP Byrd & Saraiya & Delagi, Multicast Communication in Multiprocessor Systems 1989 18 ICPP Chen & Tzeng, Enhanced Incomplete Hypercubes 1989 18 ICPP Nassimi, A Fault-Tolerant Routing Algorithm for BPC Permutations on Multistage Interconnection Networks 1989 18 ICPP Koppelman & Oruc, A Self-Routing Permutation Network 1989 18 ICPP Schwederski & Siegel & Casavant, Task Migration Transfers in Multistage Cube Based Parallel Systems 1989 18 ICPP Guan & Langston, Time-Space Optimal Parallel Merging and Sorting 1989 18 ICPP Pawagi, A Parallel Algorithm for Multiple Updates of Minimum Spanning Trees 1989 18 ICPP Cosnard & Ferreira, Parallel Algorithms for Searching in X + Y 1989 18 ICPP Ryu & Ja'Ja', List Ranking on the Hypercube 1989 18 ICPP Ranka & Sahni, Efficient Serial and Parallel Algorithms for Median Filtering 1989 18 ICPP Averbuch & Gabber & Gordissky & Medan, A Parallel FFT on an MIMD Machine 1989 18 ICPP McKenney, High-Speed Event Counting and Classification Using a Dictionary Hash Technique 1989 18 ICPP Almquist & Anderson & Lazowska, The Measured Performance of Parallel Dynamic Programming Implementations 1989 18 ICPP Chang & Ja'Ja', Parallel Algorithms for Wiring Module Pins to Frame Pads 1989 18 ICPP Huang, A New Distributed Algorithm for the Biconnectivity Problem 1989 18 ICPP Moitra & Johnson, A Parallel Algorithm for Maximum Matching on Interval Graphs 1989 18 ICPP Natarajan, Expected Performance of Parallel Search 1989 18 ICPP Yu & Chen & Lee, Optimal Parallel Circle-Cover and Independent Set Algorithms for Circular-Arc Graphs 1989 18 ICPP O'Hallaron, Uniform Approach for Solving Some Classical Problems on a Linear Array 1989 18 ICPP Tsang & Lam & Chin, An Optimal EREW Parallel Algorithm for Parenthesis Matching 1989 18 ICPP Klaiber & Gokhale, Parallel Evaluation of Attribute Grammars 1989 18 ICPP Palis & Shende, Sublinear Parallel Time Recognition of Tree Adjoining Languages 1989 18 ICPP Lee & Kedem, Mapping Nested Loop Algorithms into Multi-Dimensional Systolic Arrays 1989 18 ICPP Rosenblum & Yakovlev, Analysing Semantics of Concurrent Hardware Specifications 1989 18 ICPP Helmbold & McDowell, Modeling Speedup(n) Greater Than n 1989 18 ICPP Parberry & Yan, Improved Upper and Lower Time Bounds for Parallel Random Access Machines Without Simultaneous Writes 1989 18 ICPP Chen & Chen & Chen & Sheu, Reducing Time Complexities of Semigroup Computations on Mesh-Connected Computers with Multiple Broadcasting 1988 17 ICPP Kumar & Tsai, Mapping Two Dimensional Systolic Arrays to One Dimensional Arrays and Applications 1988 17 ICPP Song & Kinney, Distributed Termination on a Mesh 1988 17 ICPP Abraham & Padmanabhan, Reliability of the Hypercube 1988 17 ICPP Boppana & Raghavendra, On Self Routing in Benes and Shuffle Exchange Networks 1988 17 ICPP Miller & Kumar & Reisis & Stout, Data Movement Operations and Applications on Reconfigurable VLSI Arrays 1988 17 ICPP Chen & Liang & Tsai, Loops and Multi-Dimensional Grids on Hypercubes: Mapping and Reconfiguration Algorithms 1988 17 ICPP Boxer & Miller, Dynamic Computational Geometry on Meshes and Hypercubes 1988 17 ICPP Reddy & Banerjee & Abraham, I/O Embedding in Hypercubes 1988 17 ICPP Cheng, Efficient Designs of Priority Queue 1988 17 ICPP Ling & Bayoumi, Algorithms for High Speed Multi-Dimensional Arithmetic and DSP Systolic Arrays 1988 17 ICPP Han & Finkel, An Optimal Scheme for Disseminating Information 1988 17 ICPP McKinley, Multicast Routing in Spanning Bus Hypercubes 1988 17 ICPP Chang & Ja'Ja', Parallel Algorithms for River Routing 1988 17 ICPP Sugihara & Suzuki, Nearly Optimal Clock Synchronization Under Unbounded Message Transmission Time 1988 17 ICPP Chang & Ja'Ja', Parallel Algorithms for Channel Routing in the Knock-Knee Model 1988 17 ICPP Madala & Sinclair, Performance of Parallel Partitioning Algorithms 1988 17 ICPP Janakiram & Agrawal & Mehrotra, A Randomized Parallel Branch and Bound Algorithm 1988 17 ICPP Stojmenovic, Computational Geometry on a Hypercube 1988 17 ICPP Stout, Constant-Time Geometry on PRAMs 1988 17 ICPP Peng & Jun, A New VLSI 2-D Systolic Array for Matrix Multiplication and Its Applications 1988 17 ICPP Peng & Hudson, Parallel Algorithms for Multiplying Very Large Integers 1988 17 ICPP Ibarra & Pong & Sohn, Hypercube Algorithms for Some String Comparison Problems 1988 17 ICPP Han & Igarashi, Time Lower Bounds for Sorting on Multi-Dimensional Mesh-Connected Processor Arrays 1988 17 ICPP Rao & Kumar, Concurrent Insertions and Deletions in a Priority Queue 1988 17 ICPP Lander & Mesirov & Taylor, Protein Sequence Comparison on a Data Parallel Computer 1988 17 ICPP Frederickson & Janardan, Space-Efficient and Fault-Tolerant Message Routing in Outerplanar Networks 1988 17 ICPP Chan, Dilation-2 Embeddings of Grids into Hypercubes 1988 17 ICPP Vishwanathan & Sridhar, Some Results on Graph Coloring in Parallel 1988 17 ICPP Lingas, Subgraph Isomorphism for Connected Graphs of Bounded Valence and Bounded Separator is in NC 1988 17 ICPP Cypher & Sanz, Optimal Sorting on Reduced Architectures 1986 15 ICPP Lin, An Automorphism of a Class of Interconnection Networks 1986 15 ICPP Jain & Tripathi, Equivalence Between Cube-Connected Cycles Networks and Circular Shuffle Networks 1986 15 ICPP Arpasi & Milner, Mathematical Model Partitioning and Packing for Parallel Computer Calculation 1986 15 ICPP Szymanski, A VLSI Comparison of Switch-Recursive Banyan and Crossbar Interconnection Networks 1986 15 ICPP Akers & Krishnamurthy, A Group Theoretic Model for Symmetric Interconnection Networks 1986 15 ICPP Mitra & Cieslak, Randomized Parallel Communications 1986 15 ICPP Nelson & Snyder, Programming Solutions to the Algorithm Contraction Problem 1986 15 ICPP Fang & Ni, Parallel Algorithms for 2-D Convolution 1986 15 ICPP Kruskal & Madej & Rudolph, Parallel Prefix on Fully Connected Direct Connection Machines 1986 15 ICPP Lu & Varman, Mesh-Connected Computer Algorithms for Rectangle-Intersection Problems 1986 15 ICPP Szymanski, On the Universality of Multistage Interconnection Networks 1986 15 ICPP Oruc, Synthesis of a Family of Cellular Permutation Arrays 1986 15 ICPP Lee & Frieder, Massively Fault-Tolerant Cellular Arrays 1986 15 ICPP Lai & Miller, The Traveling Salesman Problem: The Development of a Distributed Computation 1986 15 ICPP LeBlanc, Shared Memory Versus Message-Passing in a Tightly-Coupled Multiprocessor: A Case Study 1986 15 ICPP Chang & Chung & Ibarra & Rao, Systolic Tree Implementation of Data Structures 1986 15 ICPP Fortes & O'Keefe, A Comparative Study of Two Systematic Design Methodologies for Systolic Arrays 1986 15 ICPP Cormen & Leiserson, A Hyperconcentrator Switch for Routing Bit-Serial Messages 1986 15 ICPP Thiele & Schwiegleshohn, On the Systolic Detection of Shortest Routes 1986 15 ICPP Guerra & Melham, Synthesizing Non-Uniform Systolic Designs 1986 15 ICPP Lu, Constructing the Voronoi Diagram on a Mesh-Connected Computer 1986 15 ICPP Ja'Ja' & Owens, Optimal Algorithms for Mesh-Connected Parallel Processors with Serial Memories 1986 15 ICPP Bailey & Cuny, An Efficient Embedding of Large Trees in Processor Grids 1986 15 ICPP Kale, Optimal Communication Neighborhoods 1986 15 ICPP Hembold & Mayr, Perfect Graphs and Parallel Algorithms 1986 15 ICPP Leiserson & Maggs, Communication-Efficient Parallel Graph Algorithms 1986 15 ICPP Kruskal & Rudolph & Snir, Efficient Parallel Algorithms for Graph Models 1986 15 ICPP Pawagi & Gopalakrishnan & Ramakrishnan, A Parallel Algorithm for Dominators 1986 15 ICPP Chang & Ibarra & Palis, Parallel Parsing on a One-Way Array of Finite-State Machines 1986 15 ICPP Scherson & Sen & Shamir, Shear Sort: A True Two-Dimensional Sorting Technique for VLSI Networks 1986 15 ICPP Lipton & Lopresti, Delta Transformations to Simplify VLSI Processor Arrays for Serial Dynamic Programming 1986 15 ICPP Dekel & Ozsvath, Parallel External Merging 1986 15 ICPP Wagner & Han, Parallel Algorithms for Bucket Sorting and the Data Dependent Prefix Problem 1986 15 ICPP Rao & Iyengar & Kashyap, A Parallel Range Search Algorithm Using Multiple Attribute Tree 1986 15 ICPP Beck & Bitton & Wilkinson, Design and Evaluation of a Parallel Sort Utility 1986 15 ICPP Geary, Software Based Mutual Exclusion in a Multiprocessor 1986 15 ICPP Gil & Rudolph, Counting and Packing in Parallel 1986 15 ICPP Santoro & Suen, Reduction Techniques for Selection in Distributed Files 1986 15 ICPP Dekel & Peng & Iyengar, Optimal Parallel Algorithms for Constructing Balanced m-Way Search Tree 1985 14 ICPP Greenberg & Manber, A Probabilistic Pipeline Algorithm for K-Selection on the Tree Machine 1985 14 ICPP Rudolph & Steiger, Subset Selection in Parallel 1985 14 ICPP Paige & Kruskal, Parallel Algorithms for Shortest Path Problems 1985 14 ICPP Ranade, Interconnection Networks and Parallel Memory Organization for Array Processing 1985 14 ICPP Fiat & Shamir & Shapiro, Polymorphic Arrays: An Architecture for a Programmable Systolic Machine 1985 14 ICPP Kruskal & Rudolph & Snir, The Power of Parallel Prefix 1985 14 ICPP Schwartz & Loui, Dictionary Machines on Cube-Class Networks 1985 14 ICPP Lester, Analysis of Firing Rates in Petri Nets Using Linear Algebra 1985 14 ICPP Mace & Wagner, Globally Optimum Selection of Memory Storage Patterns 1985 14 ICPP Bigler & Allan & Oldehoeft, Parallel Dynamic Storage Allocation 1985 14 ICPP Frailong & Jalby & Lenfant, XOR-Schemes: A Flexible Data Organization in Parallel Memories 1985 14 ICPP Mehrotra & Gehringer, Superlinear Speedup Through Randomized Algorithms 1985 14 ICPP Leiserson, Fat-Trees: Universal Networks for Hardware-Efficient Supercomputing 1985 14 ICPP Atallah & Goodrich, Efficient Parallel Solutions to Geometric Problems 1985 14 ICPP Miller & Stout, Varying Diameter and Problem Size in Mesh-Connected Computers 1985 14 ICPP Gopalakrishnan & Ramakrishnan & Kanal, Computing Tree Functions on Mesh-Connected Computers 1985 14 ICPP Gopalakrishnan & Ramakrishnan & Kanal, An Efficient Connected Components Algorithm on a Mesh-Connected Computer 1985 14 ICPP Carlson, Performing Tree and Prefix Computations on Modified Mesh-Connected Parallel Computers 1985 14 ICPP Stout, Tree-Based Graph Algorithms for Some Parallel Computers 1985 14 ICPP Culik & Yu, Translation of Systolic Algorithms between Systems of Different Topology 1985 14 ICPP Marberg & Gafni, Sorting and Selection in Multi-Channel Broadcast Networks 1985 14 ICPP Han, A Family of Parallel Sorting Algorithms 1985 14 ICPP Baer & Kwan & Zick & Snyder, Parallel Tag-Distribution Sort 1985 14 ICPP Agrawal & Leu & Nie, Parallel Sorting on the B-HIVE Machine 1985 14 ICPP Chen & Nussbaum, Sorting with Systolic Architecture 1984 13 ICPP Lee, A New Benes Network Control Algorithm 1984 13 ICPP Raghavendra & Kumar, Permutations on Illiac IV-Type Networks 1984 13 ICPP Irani & Wu, Minimization of Interprocessor Communication for Parallel Computations on a SIMD Multicomputer Interconnected with an Omega Network 1984 13 ICPP Miller & Stout, Computational Geometry on a Mesh-Connected Computer (preliminary version) 1984 13 ICPP Miller & Stout, Convexity Algorithms for Pyramid Computers (preliminary version) 1984 13 ICPP Mullin & Nemeth & Weidenhofer, Will Public Key Crypto Systems Live Up to Their Expectations? (HEP Implementation of the Discrete Log Codebreaker) 1984 13 ICPP Reif, Probabilistic Parallel Prefix Computation 1984 13 ICPP Smith, Parallel Algorithms for Depth First Searches: I. Planar Graphs 1984 13 ICPP Berman & Snyder, On Mapping Parallel Algorithms into Parallel Architectures 1984 13 ICPP Varman & Ramakrishnan, Dynamic Programming and Transitive Closure on Linear Pipelines 1984 13 ICPP Gollakota & Gray, Reconfigurable Cellular Architecture 1984 13 ICPP Quinn & Yoo, Data Structures for the Efficient Solution of Graph Theoretic Problems on Tightly-Coupled MIMD Computers 1984 13 ICPP Kwan & Ruzzo, Adaptive Parallel Algorithms for Finding Minimum Spanning Trees (extended abstract) 1984 13 ICPP Johnsson, Combining Parallel and Sequential Sorting on a Boolean n-Cube 1984 13 ICPP Bar-On & Vishkin, Optimal Parallel Generation of a Computation Tree Form 1979 ICPP Rothstein & Davis, Parallel Recognition of Parabolic and Conic Patterns by Bus Automata 1978 ICPP Rothstein, Topological Pattern Recognition in Parallel and Neural Models on Bus Automata 1977 ICPP Rothstein, Toward an Arithmetic for Parallel Computation 1976 ICPP Rothstein, On the Ultimate Limitations of Parallel Processing 1988 ICSA Roychowdhury & Kailath, Regular Processor Arrays for Matrix Algorithms with Pivoting 1988 ICSA Ibarra & Jiang & Chang & Palis, Systolic Algorithms for Some Scheduling and Graph Problems 1988 ICSA Schwiegelshohn, A Shortperiodic Two-Dimensional Systolic Sorting Algorithm 1988 ICSA Nunez & Valero, A Block Algorithm for the Algebraic Path Problem and Its Execution on a Systolic Array 1988 ICSA Payer, Formal Derivation of Systolic Arrays--A Case Study 1988 ICSA Zhang & Martin & Yun, Parallel Algorithms and Systolic Array Designs for RSA Cryptosystem 1988 ICSA Lin, Mapping Systolic Algorithms into Shuffle Arrays 1988 ICSA Wong & Delosme, Broadcast Removal in Systolic Algorithms 1989 4 ICSLC Coppen, Tree Pattern Matching 1989 4 ICSLC Mulvany, Software Tools for Indexing: What We Need 1993 21 ICTACV Guzelis & Chua, Stability Analysis of Generalized Cellular Neural Networks 1991 6 ICTAG Gunther & Hartnell, On m-Connected and k-Neighbour-Connected Graphs 1991 6 ICTAG Harary, Recent Results and Unsolved Problems on Hypercube Theory 1991 6 ICTAG Harary & Lewinter, Spanning Subgraphs of a Hypercube VI: Survey and Unsolved Problems 1991 6 ICTAG Lazebnik, On the Number of Maximal Independent Sets in Some (v,e)-Graphs 1991 6 ICTAG Levinson, An Algorithm to Decide if a Cayley Diagram Is Planar 1991 6 ICTAG Miller, Multidimensional Bandwidth in Random Graphs 1991 6 ICTAG Myrvold, A Report on the Ally Reconstruction Problem 1991 6 ICTAG Palmer, Random Superposition: Multigraphs 1991 6 ICTAG Shahrokhi, Duality Theorems for the Maximum Concurrent Flow Problem 1991 6 ICTAG Stockmeyer, Who is the Best Doubles Tennis Player? An Introduction to k-Tournaments 1991 6 ICTAG Thomassen, Recent Results on Graph Embeddings 1991 6 ICTAG Wilson, Number Theory for Graphs 1991 6 ICTAG Asano, Difficulty of the Maximum Independent Set Problem on Intersection Graphs of Geometric Objects 1991 6 ICTAG Bagga & Owens, Some Graph Theoretic Properties of Deadlocks and Traps in Petri Nets 1991 6 ICTAG Bagga & Beineke & Lipman & Pippert, Extensions of an Algorithm for Computing the Edge-Integrity of Trees 1991 6 ICTAG Boesch & Li & Stivaros & Suffel, Reliable Graphs with Unreliable Nodes 1991 6 ICTAG Burr, On the Automorphism Group of a Power of a Hypercube 1991 6 ICTAG Burr & Erdos & Frankl & Graham & Sos, Further Results on Maximal Anti-Ramsey Graphs 1991 6 ICTAG Chetwynd, Total Colourings of Graphs--A Progress Report 1991 6 ICTAG Chung, Improved Separators for Planar Graphs 1991 6 ICTAG Erdos, Problems and Results in Combinatorial Analysis and Combinatorial Number Theory 1991 6 ICTAG Feigenbaum, Lexicographically Factorable Extensions of Irreducible Graphs 1995 8 ICVLSI Danda & Madhwapathy & Sherwani, Optimal Algorithms for Planar Over-the-Cell Routing in the Presence of Obstacles 1995 8 ICVLSI Lim & Sahni & Thanvantri, A Fast Algorithm to Test Planar Topological Routability 1995 8 ICVLSI Das & Saxena, Parallel Algorithms for Single Row Routing in Narrow Streets 1995 8 ICVLSI Simon & Bucher & Nossek, Retiming of Synchronous Circuits with Variable Topology 1995 8 ICVLSI Chakradhar, Optimum Retiming of Large Sequential Circuits 1995 8 ICVLSI Pal & Pal & Das & Pal, Computing Area and Wire Length Efficient Routes for Channels 1995 8 ICVLSI Pal & Datta & Pal & Das & Pal, A General Graph Theoretic Framework for Multi-Layer Channel Routing 1995 8 ICVLSI Khare & Mitra & Nag & Maly & Rutenbar, Testability-Oriented Channel Routing 1994 1 IEEECEP Tamaki & Kita & Shimizu & Maekawa & Nishikawa, A Comparison Study of Genetic Codings for the Traveling Salesman Problem 1994 1 IEEECEP Bui & Moon, A New Genetic Approach for the Traveling Salesman Problem 1994 1 IEEECEP Hinterding, Mapping, Order-independent Genes and the Knapsack Problem 1994 1 IEEECEP Parthasarathy & Murthy & Sastry, Clique Finding -- A Genetic Approach 1994 1 IEEECEP Maini & Mehrotra & Mohan & Ranka, Knowledge Based Nonuniform Crossover 1994 1 IEEECEP Back, Selective Pressure in Evolutionary Algorithms: A Characterization of Selection Mechanisms 1994 1 IEEECEP Rudolph, Convergence of Non-elitist Strategies 1994 1 IEEECEP Mahfoud, Genetic Drift in Sharing Methods 1994 1 IEEECEP Lucas, Structuring Chromosomes for Context-free Grammar Evolution 1994 1 IEEECEP Teller, Turing Completeness in the Language of Genetic Programming with Indexed Memory 1994 1 IEEECEP Bramlette, Finding Maximum Flow with Random and Genetic Search 1994 1 IEEECEP Palmer & Kershenbaum, Representing Trees in Genetic Algorithms 1994 1 IEEECEP Gunnels & Cull & Holloway, Genetic Algorithms and Simulated Annealing for Gene Mapping 1994 1 IEEECEP Thonemann, Finding Improved Simulated Annealing Schedules with Genetic Programming 1994 1 IEEECEP Petry & Dunay & Buckles, Regular Language Induction with Genetic Programming 1994 1 IEEECEP Gordon, Locality in Genetic Algorithms 1994 1 IEEECEP Mathias & Whitley, Transforming the Search Space with Gray Coding 1994 1 IEEECEP Back & Khuri, An Evolutionary Heuristic for the Maximum Independent Set Problem 1994 1 IEEECEP Olsen, Penalty Functions and the Knapsack Problem 1994 1 IEEECEP Sun & Wang, The Genetic Algorithm for 0-1 Programming with Linear Constraints 1994 1 IEEECEP Huang & Kao & Horng, A Genetic Algorithm Approach for Set Covering Problems 1995 15 IEEECGA Fang & Piegl, Delaunay Triangulations in Three Dimensions 1993 IEEECICC Curiger & Bonnenberg & Zimmermann & Felber & Kaeslin & Fichtner, Vinci: VLSI Implementation of the New Secret-Key Block Cipher Idea 1990 28 IEEECSM O'Neal, The Humanities and Their Effect On Engineering Education 1990 28 IEEECSM Coes, Science, Mathematics, and Student Values 1978 IEEECSM Adleman & Rivest, The Use of Public Key Cryptography in Communication System Design 1996 IEEECSP Bender, Mathematical Methods in Artificial Intelligence 1996 IEEECSP Bowyer, Ethics and Computing: Living Responsibly in a Computerized World 1996 IEEECSP Sigfried, Understanding Object-Oriented Software Engineering 1996 IEEECSP Stallings, Practical Cryptography for Data Internetworks 1995 IEEECSP Pradhan & Avresky (Eds.), Fault-Tolerant Parallel and Distributed Systems (apparently FTPDS) 1995 IEEECSP Schenfeld (Ed.), Proceedings of the Second International Conference on Massively Parallel Processing Using Optical Interconnections 1995 IEEECSP Abrams & Jajodia & Podell (Eds.), Information Security: An Integrated Collection of Essays 1995 IEEECSP Suri & Walter & Hugue (Eds.), Advances in Ultra-Dependable Distributed Systems 1994 IEEECSP Yang & Marsland (Eds.), Global States and Time in Distributed Systems 1993 IEEECSP Lewis, Foundations of Parallel Programming: A Machine-Independent Approach 1993 IEEECSP Scherson (Ed.), Proceedings, The New Frontiers: A Workshop on Future Directions of Massively Parallel Processing, October 19, 1992, IEEE Computer Society and National Aeronautics and Space Administration 1992 IEEECSP Storer & Cohn (Eds.), DCC '92: Data Compression Conference 1985 IEEECSP Srihari, Computer Text Recognition and Error Correction (Tutorial) 1987 1 IEEEICNN Judd, Learning in Networks Is Hard 1987 1 IEEEICNN Hartley & Szu, A Comparison of the Computational Power of Neural Network Models 1987 1 IEEEICNN Kemke, Modelling Neural Networks by Means of Networks of Finite Automata 1987 1 IEEEICNN Bruck & Goodman, A Generalized Convergence Theorem for Neural Networks and Its Applications in Combinatorial Optimization 1987 1 IEEEICNN Cervantes & Hildebrant, Comparison of Three Neuron-Based Computation Schemes 1987 1 IEEEICNN Marcus, A Connectionist Algorithm for Minimum Cost Network Flows 1987 1 IEEEICNN Berke, That Does Not Compute 1993 11 IEEEJSAC Gong & Lomas & Needham & Saltzer, Protecting Poorly Chosen Secrets from Guessing Attacks 1993 11 IEEEJSAC Gong, Increasing Availability and Security of an Authentication Service 1993 11 IEEEJSAC Bird & Gopal & Herzberg & Janson & Kutten & Molva & Yung, Systematic Design of a Family of Attack-Resistant Authentication Protocols 1993 11 IEEEJSAC Boyd, Security Architectures Using Formal Methods 1993 11 IEEEJSAC Toussaint, A New Method for Analyzing the Security of Cryptographic Protocols 1993 11 IEEEJSAC Zheng & Seberry, Immunizing Public Key Cryptosystems Against Chosen Ciphertext Attacks 1993 11 IEEEJSAC Chang & Lee, A New Generalized Group-Oriented Cryptoscheme Without Trusted Centers 1993 11 IEEEJSAC Tsujii & Chao & Araki, A Simple ID-Based Scheme for Key Sharing 1993 11 IEEEJSAC Harn & Yang, ID-Based Cryptographic Schemes for User Identification, Digital Signature, and Key Distribution 1993 11 IEEEJSAC Kawamura & Shimbo, Fast Server-Aided Secret Computation Protocols for Modular Exponentiation 1993 11 IEEEJSAC Fumy & Landrock, Principles of Key Management 1993 11 IEEEJSAC Agnew & Mullin & Vanstone, An Implementation of Elliptic Curve Cryptosystems Over F_{2^155} 1993 11 IEEEJSAC Metcalfe, Computer/Network Interface Design: Lessons from Arpanet and Ethernet 1991 9 IEEEJSAC Karol & Shaikh, A Simple Adaptive Routing Scheme for Congestion Control in ShuffleNet Multihop Lightwave Networks 1991 9 IEEEJSAC Golestani, A Framing Strategy for Congestion Management 1990 8 IEEEJSAC Biersack, Annotated Bibliography on Network Interconnection 1989 7 IEEEJSAC Simmons, A Protocol to Provide Verifiable Proof of Identity and Unforgeable Transaction Receipts 1989 7 IEEEJSAC Kemmerer, Analyzing Encryption Protocols Using Formal Verification Techniques 1989 7 IEEEJSAC Beth & Gollmann, Algorithm Engineering for Public Key Algorithms 1989 7 IEEEJSAC Tsujii & Itoh, An ID-Based Cryptosystem Based on the Discrete Logarithm Problem 1989 7 IEEEJSAC Del Re & Fantacci & Maffucci, A New Speech Signal Scrambling Method for Secure Communications: Theory, Implementation, and Security Evaluation 1989 7 IEEEJSAC Okamoto & Tanaka, Key Distribution System Based on Identification Information 1989 7 IEEEJSAC Estrin & Mogul & Tsudik, Visa Protocols for Controlling Interorganizational Datagram Flow 1989 7 IEEEJSAC Laih & Lee & Harn & Su, Linearly Shift Knapsack Public-Key Cryptosystem 1995 IEEEPRESS Fogel, Evolutionary Computation: Toward a New Philosophy of Machine Intelligence 1992 IEEEPRESS Simmons (Ed.), Contemporary Cryptology: The Science of Information Integrity 1990 IEEEPRESS , IEEE Standard Computer Dictionary: A Compilation of IEEE Standard Computer Glossaries 1987 IEEEPRESS Blicq, Writing Reports To Get Results: Guidelines for the Computer Age 1986 IEEEPRESS Ash & Ash, The Calculus Tutoring Book 1986 IEEEPRESS Soderstrand & Jenkins & Jullien & Taylor (Eds.), Residue Number System Arithmetic: Modern Applications in Digital Signal Processing 1995 12 IEEESOFT Bowen & Hinchey, Seven More Myths of Formal Methods 1992 IEEESPECT Adam, Threats and Countermeasures 1992 IEEESPECT Bowles & Pelaez, Bad Code 1992 IEEESPECT Adam, Cryptography = Privacy? 1992 IEEESPECT Adam, The Debate over the U. S. Digital Signature Standard 1994 IEEESUPER Agarwal & Gustavson & Zubair, A High Performance Parallel Algorithm for 1-D FFT 1994 IEEESUPER Eckstein, Control Strategies for Parallel Mixed Integer Branch and Bound 1994 IEEESUPER Kamada & Matsuoka & Yonezawa, Efficient Parallel Global Garbage Collection on Massively Parallel Computers 1994 IEEESUPER Cook & Pancake & Walpole, Are Expectations for Parallelism Too High? A Survey of Potential Parallel users 1994 IEEESUPER Karypis & Gupta & Kumar, A Parallel Formulation of Interior Point Algorithms 1994 IEEESUPER Pryor & Cuccaro, Implementation of a Portable and Reproducable Parallel Pseudorandom Number Generator 1994 IEEESUPER Boppana & Chalasani, Fault-Tolerant Routing with Non-Adaptive Wormhole Algorithms in Mesh Networks 1991 IEEESUPER Karmarkar, A New Parallel Architecture for Sparse Matrix Computation Based on Finite Projective Geometries 1991 IEEESUPER Jordan & Heuring, Time Multiplexed Optical Computers 1991 IEEESUPER Fiduccia & Jacobson, Universal Multistage Networks via Linear Permutations 1991 IEEESUPER Wei & Levy, Design and Analysis of Efficient Hierarchical Interconnection Networks 1991 IEEESUPER Felperin & Gravano & Pifarre & Sanz, Fully-Adaptive Routing: Packet-Switching Performance and Wormhole Algorithms 1991 IEEESUPER Kung & Sansom & Schlick & Steenkiste & Arnould & Bitz & Christianson & Cooper & Menzilcioglu & Ombres & Zill, Network-Based Multicomputers: An Emerging Parallel Architecture 1991 IEEESUPER Zagha & Blelloch, Radix Sort for Vector Multiprocessors 1991 IEEESUPER Kanada, A Method of Vector Processing for Shared Symbolic Data 1991 IEEESUPER Alnuweiri, Optimal Bounded-Degree VLSI Networks for Sorting in a Constant Number of Rounds 1991 IEEESUPER Theobald & Gao, An Efficient Parallel Solution for All Pairs Examination 1991 IEEESUPER Woo & Renault, Parallel Power-of-Two FFTs on Hypercubes 1991 IEEESUPER Tzeng, Design of a Highly Reliable Cube-Connected Cycles Architecture 1994 39 IEEETAC Antonio & Tsai & Huang, Time Complexity of a Path Formulated Optimal Routing Algorithm 1991 36 IEEETAC Cruz & Chuah, A Minimax Approach to a Simple Routing Problem 1992 40 IEEETASSP Orchard, Fast Bit-Reversal Algorithms Based on Index Representations in GF(2^b) 1991 39 IEEETASSP Gupta & Rao, An Efficient FFT Algorithm Based on the Discrete Sine Transform 1988 36 IEEETASSP Chang & Chen, A New Systolic Array for Discrete Fourier Transform 1997 46 IEEETC Gavish & Sridhar, Threshold Priority Policy for Channel Assignment in Cellular Networks 1997 46 IEEETC Chen & Tzeng, On-Line Task Migration in Hypercubes Through Double Disjoint Paths 1997 46 IEEETC Kinoshita & lee, A Residue Arithmetic Extension for Reliable Scientific Computation 1997 46 IEEETC Walter, Space/Time Trade-Offs for Higher Radix Modular Multiplication Using Repeated Addition 1997 46 IEEETC Lin & Oruc, The Design of an Optoelectronic Arithmetic Processor Based on Permutation Networks 1997 46 IEEETC Oberman & Flynn, Design Issues in Division and Other Floating-Point Operations 1997 46 IEEETC Wu & Hasan, Efficient Exponentiation of a Primitive Root in GF(2^m) 1997 46 IEEETC Rowley & Bose, Distributed Ring Embedding in Faulty De Bruijn Networks 1997 46 IEEETC Upadhyay & Varavithya & Mohapatra, A Traffic-Balanced Adaptive Wormhole-Routing Scheme for Two-Dimensional Meshes 1997 46 IEEETC Annexstein, Generating De Bruijn Sequences: An Efficient Implementation 1997 46 IEEETC Jiang & Huang & Kuo, Cohorts Structures for Fault-Tolerant k Entries to a Critical Section 1997 46 IEEETC Wu, Reliable Unicasting in Faulty Hypercubes Using Safety Levels 1997 46 IEEETC Lo, A Fast Binary Adder with Conditional Carry Generation 1997 46 IEEETC Dolev & Welch, Crash Resilient Communication in Dynamic Networks 1997 46 IEEETC Ural & Wu & Zhang, On Minimizing the Lengths of Checking Sequences 1997 46 IEEETC Hu & Shen & Yang, Topologies of Combined (2 log N - 1)-Stage Interconnection Networks 1996 45 IEEETC Wrzyszcz & Milford & Dagless, A New Approach to Fixed-Coefficient Inner Product Computation Over Finite Rings 1996 45 IEEETC Bernard, Efficient Fault Locations for Globally Controlled and Comparison-Based Multistage Interconnection Networks 1996 45 IEEETC Oommen & Zhang & Lee, Numerical Similarity and Dissimilarity Measures Between Two Trees 1996 45 IEEETC Jiang & Majithia, Suggestion for a New Representation for Binary Function 1996 45 IEEETC Weng & Nicolau & Siu, The Strict Time Lower Bound and Optimal Schedules for Parallel Prefix with Resource Constraints 1996 45 IEEETC Tzeng & Lin, Efficient Determination of Maximum Incomplete Subcubes in Hypercubes with Faults 1996 45 IEEETC Fujita & Yamashitar, Fast Gossiping on Mesh-Bus Computers 1996 45 IEEETC Saxena & McCluskey, Counting Two-State Transition-Tour Sequences 1996 45 IEEETC Bollig & Wegener, Improving the Variable Ordering of OBDDs Is NP-Complete 1996 45 IEEETC Sasidhar & Chattopadhyay & Chaudhuri, CAA Decoder for Cellular Automata Based Byte Error Correcting Code 1996 45 IEEETC Lo, A Hyper Optimal Encoding Scheme for Self-Checking Circuits 1996 45 IEEETC Ciminiera & Montuschi, Carry-Save Multiplication Schemes without Final Addition 1996 45 IEEETC Liu & Sung, Routing and Transmitting Problems in de Bruijn Networks 1996 45 IEEETC Vassiliadis & Cotofana & Bertels, 2-1 Additions and Related Arithmetic Operations with Threshold Logic 1996 45 IEEETC Chakraborty & Chowdhury & Chaudhuri, Theory and Application of Nongroup Cellular Automata for Synthesis of Easily Testable Finite State Machines 1996 45 IEEETC Cattell & Muzio, Analysis of One-Dimensional Linear Hybrid Cellular Automata over GF(q) 1996 45 IEEETC Shang & Hodzic & Chen, On Uniformization of Affine Dependence Algorithms 1996 45 IEEETC Bui & Moon, Genetic Algorithm and Graph Partitioning 1996 45 IEEETC Paar, A New Architecture for a Parallel Finite Field Multiplier with Low Complexity Based on Composite Fields 1996 45 IEEETC Du & Hsu & Lyuu, Corrigendum to ``Line Digraph Iterations and Connectivity Analysis of de Bruijn and Kautz Graphs'' 1996 45 IEEETC Yan & Suvannapattanan, Correction to ``Improved Digital Signature Algorithm 1996 45 IEEETC Leu & Kuo, A Fault-Tolerant Tree Communication Scheme for Hypercube Systems 1996 45 IEEETC Gaughan & Dao & Yalamanchili & Schimmel, Distributed, Deadlock-Free Routing in Faulty, Pipelined, Direct Interconnection Networks 1996 45 IEEETC Su & Shin, Adaptive Fault-Tolerant Deadlock-Free Routing in Meshes and Hypercubes 1996 45 IEEETC Shin & Daniel, Analysis and Implementation of Hybrid Switching 1996 45 IEEETC Varvarigos & Bertsekas, A Conflict Sense Routing Protocol and Its Performance for Hypercubes 1996 45 IEEETC Felperin & Raghavan & Upfal, A Theory of Wormhole Routing in Parallel Computers 1996 45 IEEETC Bhatt & Bilardi & Pucci & Ranade & Rosenberg & Schwabe, On Bufferless Routing of Variable Length Messages in Leveled Networks 1996 45 IEEETC Pearlmutter, Doing the Twist: Diagonal Meshes Are Isomorphic to Twisted Toroidal Meshes 1996 45 IEEETC Padro & Morillo & Fiol, Comments on ``Line Digraph Iterations and Connectivity Analysis of de Bruijn and Kautz Graphs'' 1996 45 IEEETC Rajasekaran, Mesh Connected Computers with Fixed and Reconfigurable Buses: Packet Routing and Sorting 1996 45 IEEETC Ayoubi & Malluhi & Bayoumi, The Extended Cube Connected Cycles: An Efficient Interconnection for Massively Parallel Systems 1996 45 IEEETC Low & Leong, A New Class of Efficient Algorithms for Reconfiguration of Memory Arrays 1996 45 IEEETC Wang & McCrosky, Negation Trees: A Unified Approach to Boolean Function Complementation 1996 45 IEEETC Cheng & Chen, A New Self-Routing Permutation Network 1996 45 IEEETC Blum & Wasserman, Reflections on the Pentium Bug 1996 45 IEEETC Azadmanesh & Kieckhafer, New Hybrid Fault Models for Asynchronous Approximate Agreement 1996 45 IEEETC Bagherzadeh & Dowd & Nassif, Embedding an Arbitrary Binary Tree into the Star Graph 1996 45 IEEETC Raghavendra & Sridhar, Global Commutative and Associative Reduction Operations in Faulty SIMD Hypercubes 1996 45 IEEETC Malluhi & Bayoumi & Rao, Correction to ``Efficient Mapping of ANNs on Hypercube Massively Parallel Machines'' 1996 45 IEEETC GF(2^m) Multiplication and Division Over the Dual Basis 1996 45 IEEETC De Gloria & Olivieri, Statistical Carry Lookahead Adders 1996 45 IEEETC Dadda & Piuri, Pipelined Adders 1996 45 IEEETC Kundu & Sogomonyan & Goessel & Tarnick, Self-Checking Comparator with One Periodic Output 1996 45 IEEETC Lo & Thanawastien & Rao, Berger Check Prediction for Array Multipliers and Array Dividers 1996 45 IEEETC Orailoglu & Karri, Automatic Synthesis of Self-Recovering VLSI Systems 1996 45 IEEETC Chiu & Wu, A Fault-Tolerant Routing Strategy in Hypercube Multicomputers 1996 45 IEEETC Opatrny & Sotteau & Srinivasan & Thulasiraman, DCC Linear Congruential Graphs: A New Class of Interconnection Networks 1996 45 IEEETC Azar & Naor & Rom, Routing Strategies for Fast Networks 1996 45 IEEETC Fragopoulou & Akl, Edge-Disjoint Spanning Trees on the Star Network with Applications to Fault Tolerance 1996 45 IEEETC Bettayeb & Cong & Girou & Sudborough, Embedding Star Networks into Hypercubes 1996 45 IEEETC Oommen & de St. Croix, Graph Partitioning Using Learning Automata 1996 45 IEEETC Gu & Gu & Du, Convergence Properties of Optimization Algorithms for the SAT Problem 1996 45 IEEETC Bokhari, Multiphase Complete Exchange: A Theoretical Analysis 1996 45 IEEETC Latifi & Srimani, Transposition Networks as a Class of Fault-Tolerant Robust Networks 1996 45 IEEETC Chowdhury & Banerjee, A New Error Analysis Based Method for Tolerance Computation for Algorithm-Based Checks 1996 45 IEEETC Katti, A Note on SEC/AUED Codes 1996 45 IEEETC Lai & Pedram & Vrudhula, Formal Verification Using Edge-Valued Binary Decision Diagrams 1996 45 IEEETC Nandi & Chaudhuri, Analysis of Periodic and Intermediate Boundary 90/150 Cellular Automata 1996 45 IEEETC Katti, A New Residue Arithmetic Error Correction Scheme 1996 45 IEEETC Pomeranz & Reddy, On Removing Redundancies from Synchronous Sequential Circuits with Synchronizing Sequences 1996 45 IEEETC Golic, Linear Models for Keystream Generators 1996 45 IEEETC Kagaris & Tragoudas, Retiming-Based Partial Scan 1996 45 IEEETC Hu & Shen & Liang, Optimally Routing LC Permutations on k-Extra-Stage Cube-Type Networks 1996 45 IEEETC Smith Mazumder, Generation of Minimal Vertex Covers for Row/Column Allocation in Self-Repairable Arrays 1995 44 IEEETC Sullivan & Wilson & Masson, Certification of Computational Results 1995 44 IEEETC Boppana & Chalasani, Fault-Tolerant Wormhole Routing Algorithms for Mesh Networks 1995 44 IEEETC Saab, A Fast and Robust Network Bisection Algorithm 1995 44 IEEETC Atallah & Chen, Optimal Parallel Hypercube Algorithms for Polygon Problems 1995 44 IEEETC Kulasinghe & Bettayeb, Embedding Binary Trees into Crossed Cubes 1995 44 IEEETC Chang & Bhuyan, A Combinatorial Analysis of Subcube Reliability in Hypercubes 1995 44 IEEETC Yen & Laih, Improved Digital Signature Suitable for Batch Verification 1995 44 IEEETC Shin & Chang, A Reservation-Based Algorithm for Scheduling Both Periodic and Aperiodic Real-Time Tasks 1995 44 IEEETC Mukhopadhyaya & Sinha, Fault-Tolerant Routing in Distributed Loop Networks 1995 44 IEEETC Tang & Arden, Class-Congruence Property and Two-Phase Routing of Borel Cayley Graphs 1995 44 IEEETC Hwang & Wright, Survival Reliability of Some Double-Loop Networks and Chordal Rings 1995 44 IEEETC Olstad & Manne, Efficient Partitioning of Sequences 1995 44 IEEETC Hung & Parhami, Error Analysis of Approximate Chinese-Remainder Decoding 1995 44 IEEETC Vinnakota, Implementing Multiplication with Split Read-Only Memory 1995 44 IEEETC Yang & Masson, Broadcast Ring Sandwich Networks 1995 44 IEEETC Liao & King, Valved Routing: Efficient Flow Control for Adaptive Nonminimal Routing in Interconnection Networks 1995 44 IEEETC Kulasinghe & El-Amawy, On the Complexity of Optimal Bused Interconnections 1995 44 IEEETC Chowdhury & Gupta & Chaudhuri, A Low-Cost High-Capacity Associative Memory Design Using Cellular Automata 1995 44 IEEETC Mohapatra & Das, On Dependability Evaluation of Mesh-Connected Processors 1995 44 IEEETC Chang & Bhuyan, Subcube Fault Tolerance in Hypercube Multiprocessors 1995 44 IEEETC Heys & Tavares, Avalanche Characteristics of Substitution-Permutation Encryption Networks 1995 44 IEEETC Shen, An Optimal O(N lg N) Algorithm for Permutation Admissibility to Extra-Stage Cube-Type Networks 1995 44 IEEETC Raghavendra & Yang & Tien, Free Dimensions--An Effective Approach to Achieving Fault Tolerance in Hypercubes 1995 44 IEEETC Oh & Youn & Raj, An Efficient Algorithm-Based Concurrent Error Detection for FFT Networks 1995 44 IEEETC Wu & Yao, A Limited-Global-Information-Based Multicasting Scheme for Faulty Hypercubes 1995 44 IEEETC Hitz & Kaltofen, Integer Division in Residue Number Systems 1995 44 IEEETC Bose & Broeg & Kwon & Ashir, Lee Distance and Topological Properties of k-ary n-Cubes 1995 44 IEEETC DeBiase & Ferrone & Massini, An O(log_2 N) Depth Asymptotically Nonblocking Self-Routing Permutation Network 1995 44 IEEETC Unger, Hazards, Critical Races, and Metastability 1995 44 IEEETC Malluhi & Bayoumi & Rao, Efficient Mapping of ANNs on Hypercube Massively Parallel Machines 1995 44 IEEETC Srinivas & Parhi, A Fast Radix-4 Division Algorithm and Its Architecture 1995 44 IEEETC Di Claudio & Piazza & Orlandi, Fast Combinatorial RNS Processors for DSP Applications 1995 44 IEEETC Cull & Larson, The Mobius Cubes 1995 44 IEEETC Shin & Chang, A Coordinated Location Policy for Load Sharing in Hypercube-Connected Multicomputers 1995 44 IEEETC Cam & Fortes, Frames: A Simple Characterization of Permutations Realized by Frequently Used Networks 1995 44 IEEETC Wu, Safety Levels--An Efficient Mechanism for Achieving Reliable Broadcasting in Hypercubes 1995 44 IEEETC Shen, Optimal Realization of Any BPC Permutation on K-Extra-Stage Omega Networks 1995 44 IEEETC Yen & Laih, Improved Digital Signature Algorithm 1995 44 IEEETC Dunne & Leng & Nwana, On the Complexity of Boolean Functions Computed by Lazy Oracles 1995 44 IEEETC Auletta & Rescigno & Scarano, Embedding Graphs onto the Supercube 1995 44 IEEETC Lopez & Thurimella, On Computing Connected Components of Line Segments 1995 44 IEEETC Tseng & Wu, On a Constant-Time, Low-Complexity Winner-Take-All Neural Network 1995 44 IEEETC Shen & Xu & Wang, An Optimal Algorithm for Permutation Admissibility to Multistage Interconnection Networks 1995 44 IEEETC Cam & Fortes, A Fast VLSI-Efficient Self-Routing Permutation Network 1995 44 IEEETC Rangarajan & Huang & Tripathi, Computing Reliability Intervals for k-Resilient Protocols 1995 44 IEEETC Tzeng & Siu, Message-Optimal Protocols for Fault-Tolerant Broadcasts/Multicasts in Distributed Systems with Crash Failures 1995 44 IEEETC Lin & Chang & Lee, A New Public-Key Cipher System Based Upon the Diophantine Equations 1995 44 IEEETC Johnsson & Ho, On the Conversion Between Binary Code and Binary-Reflected Gray Code on Binary Cubes 1995 44 IEEETC Tong & Wu, Routing in a Three-Dimensional Chip 1995 44 IEEETC Menezes & Bakhru, New Bounds on the Reliability of Augmented Shuffle-Exchange Networks 1995 44 IEEETC Vaidya & Pradhan, Degradable Byzantine Agreement 1995 44 IEEETC Bruck & Cypher & Ho, Wildcard Dimensions, Coding Theory and Fault-Tolerant Meshes and Hypercubes 1994 43 IEEETC Nandi & Kar & Chaudhuri, Theory and Applications of Cellular Automata in Cryptography 1994 43 IEEETC Greenberg, The Fat-Pyramid and Universal Parallel Computation Independent of Wire Delay 1994 43 IEEETC Cypher & Gravano, Storage-Efficient, Deadlock-Free Packet Routing Algorithms for Torus Networks 1994 43 IEEETC Lopez & Zapata, Unified Architecture for Divide and Conquer Based Tridiagonal System Solvers 1994 43 IEEETC Ali & Redinbo, Tight Lower Bounds on the Detection Probabilities of Single Faults at Internal Signal Lines in Combinational Circuits 1994 43 IEEETC Lin & Oruc, Constant Time Inner Product and Matrix Computations on Permutation Network Processors 1994 43 IEEETC Tzeng & Chen, Structural and Tree Embedding Aspects of Incomplete Hypercubes 1994 43 IEEETC Das & Bhattacharya & Dattagupta, Hierarchical Classification of Permutation Classes in Multistage Interconnection Networks 1994 43 IEEETC Ienne & Viredaz, Bit-Serial Multipliers and Squarers 1994 43 IEEETC Ciardo & Lindemann, Comments on ``Analysis of Self-Stabilizing Clock Synchronization by Means of Stochastic Petri Nets'' 1994 43 IEEETC Wegener, The Size of Reduced OBDD's and Optimal Read-Once Branching Programs for Almost All Boolean Functions 1994 43 IEEETC Feng & Seo, A New Routing Algorithm for a Class of Rearrangeable Networks 1994 43 IEEETC Rao & Toida, On Polynomial-Time Testable Combinational Circuits 1994 43 IEEETC Lee & Lu, New Self-Routing Permutation Networks 1994 43 IEEETC Kosko, Fuzzy Systems as Universal Approximators 1994 43 IEEETC Bajwa & Owens & Irwin, Area Time Trade-Offs in Micro-Grain VLSI Array Architectures 1994 43 IEEETC Harrington & Somani, Synchronizing Hypercube Networks in the Presence of Faults 1994 43 IEEETC Bruck & Cypher & Soroker, Embedding Cube-Connected Cycles Graphs into Faulty Hypercubes 1994 43 IEEETC Ray-Chaudhuri & Singhi & Sanyal & Subramanian, Theory and Design of t-Unidirectional Error-Correcting and d-Unidirectional Error-Detecting Code 1994 43 IEEETC Das & Mukhopadhyaya & Sinha, A New Family of Bridged and Twisted Hypercubes 1994 43 IEEETC Wang & Jha, Correction to ``Algorithm-Based Fault Tolerance for FFT Networks'' 1994 43 IEEETC Tzeng, Reliable Butterfly Distributed-Memory Multiprocessors 1994 43 IEEETC Wang, Diagnosability of Enhanced Hypercubes 1994 43 IEEETC Olson & Shin, Probabilistic Clock Synchronization in Large Distributed Systems 1994 43 IEEETC Vuillemin, On Circuits and Numbers 1994 43 IEEETC Phatak & Koren, Hybrid Signed-Digit Number Systems: A Unified Framework for Redundant Number Representations With Bounded Carry Propagation Chains 1994 43 IEEETC Kornerup, A Systolic, Linear-Array Multiplier for a Class of Right-Shift Algorithms 1994 43 IEEETC Zuras, More On Squaring and Multiplying Large Integers 1994 43 IEEETC Ercegovac & Lang & Montuschi, Very-High Radix Division with Prescaling and Selection by Rounding 1994 43 IEEETC Cortadella & Lang, High-Radix Division and Square-Root with Speculation 1994 43 IEEETC DasSarma & Matula, Measuring the Accuracy of ROM Reciprocal Tables 1994 43 IEEETC Hemkumar & Cavallaro, Redundant and On-Line CORDIC for Unitary Transformations 1994 43 IEEETC Bajard & Kla & Muller, BKM: A New Hardware Algorithm for Complex Elementary Functions 1994 43 IEEETC Schulte & Swartzlander, Hardware Designs for Exactly Rounded Elementary Functions 1994 43 IEEETC Lewis, Interleaved Memory Function Interpolators with Application to an Accurate LNS Arithmetic Unit 1994 43 IEEETC Demmel & Li, Faster Numerical Algorithms via Exception Handling 1994 43 IEEETC Chang & Tsay, A Family of Efficient Regular Arrays for Algebraic Path Problems 1994 43 IEEETC Abu-Amara & Lokre, Election in Asynchronous Complete Networks with Intermittent Link Failures 1994 43 IEEETC Kim & Das, Hypercube Communication Delay with Wormhole Routing 1994 43 IEEETC Tang & Padubidri, Diagonal and Toroidal Mesh Networks 1994 43 IEEETC Sun & Cerny & Gecsei, Fault Tolerance in a Class of Sorting Networks 1994 43 IEEETC Wang, Bit-Level Systolic Array for Fast Exponentiation in GF(2^m) 1994 43 IEEETC Banerjee & Peercy, Design and Evaluation of Hardware Strategies for Reconfiguring Hypercubes and Meshes Under Faults 1994 43 IEEETC Wang & Jha, Algorithm-Based Fault Tolerance for FFT Networks 1994 43 IEEETC Weller & Hajek, Comments on ``An Optimal Shortest-Path Routing Policy for Network Computers with Regular Mesh-Connected Topologies'' 1994 43 IEEETC Dowd & Bogineni & Aly & Perreault, Addendum to ``Hierarchical Scalable Photonic Architectures for High-Performance Processor Interconnection'' 1994 43 IEEETC Gu & Rosenkrantz & Ravi, Construction of Check Sets for Algorithm-Based Fault Tolerance 1994 43 IEEETC Palumbo, The Derivation and Experimental Verification of Clock Synchronization Theory 1994 43 IEEETC Thibeault & Savaria & Houle, A Fast Method to Evaluate the Optimum Number of Spares in Defect-Tolerant Integrated Circuits 1994 43 IEEETC Bagchi & Hakimi, Information Dissemination in Distributed Systems With Faulty Units 1994 43 IEEETC Lee & Yang & Wong, On Bends and Distances of Paths Among Obstacles in Two-Layer Interconnection Model 1994 43 IEEETC Franklin & Saluja, Hypergraph Coloring and Reconfigured RAM Testing 1994 43 IEEETC Chen & Chen, Constant Time Sorting on Reconfigurable Meshes 1994 43 IEEETC Muller, Some Characterizations of Functions Computable in On-Line Arithmetic 1994 43 IEEETC Hoelzeman & Bettayeb, On the Genus of Star Graphs 1994 43 IEEETC Chowdhury & Basu & Gupta & Chaudhuri, Design of CAECC--Cellular Automata Based Error Correcting Code 1994 43 IEEETC Heap & Mercer, Least Upper Bounds on OBDD Sizes 1994 43 IEEETC Sun & Wang, Comments on ``Distributed Algorithms for Network Recognition Problems'' 1994 43 IEEETC Soneoka & Ibaraki, Logically Instantaneous Message Passing in Asynchronous Distributed Systems 1994 43 IEEETC Hou & Shin, Incorporation of Optimal Timeouts into Distributed Real-Time Load Sharing 1994 43 IEEETC Prakash & Lee & Johnson, A Nonblocking Algorithm for Shared Queues Using Compare-and-Swap 1994 43 IEEETC Clark & Weng, Maximal and Near-Maximal Shift Register Sequences: Efficient Event Counters and Easy Discrete Logarithms 1994 43 IEEETC Pomeranz & Reddy, Application of Homing Sequences to Synchronous Sequential Circuit Testing 1994 43 IEEETC Sarrafzadeh & Wagner & Wagner & Weihe, Wiring Knock-Knee Layouts: A Global Approach 1994 43 IEEETC Al-Bassam & Bose, Asymmetric/Unidirectional Error Correcting and Detecting Codes 1994 43 IEEETC Chi, Salphasic Distribution of Clock Signals for Synchronous Systems 1994 43 IEEETC De & Sinha, Fast Parallel Algorithm for Ternary Multiplication Using Multivalued I^2 L Technology 1994 43 IEEETC Yang & Tien & Raghavendra, Embedding of Rings and Meshes onto Faulty Hypercubes Using Free Dimensions 1994 43 IEEETC Tsai & Shin, Assignment of Task Modules in Hypercube Multicomputers with Component Failures for Communication Efficiency 1994 43 IEEETC Harper, A Multiaccess Frame Buffer Architecture 1994 43 IEEETC Kornerup, Digit-Set Conversions: Generalizations and Applications 1994 43 IEEETC Swaminathan & Veeramani, Decomposition of {0,1}-Matrices 1994 43 IEEETC Tokarnia, Identifying Minimal Shift Counters: A Search Technique 1994 43 IEEETC Lo, Reliable Floating-Point Arithmetic Algorithms for Error-Coded Operands 1994 43 IEEETC Ramirez & Melhem, Computational Arrays with Flexible Redundancy 1994 43 IEEETC Lagman & Najjar & Srimani, An Analysis of Edge Fault Tolerance in Recursively Decomposable Regular Networks 1994 43 IEEETC Kipnis, Analysis of Asynchronous Binary Arbitration on Digital Transmission-Line Busses 1994 43 IEEETC Burns & Jha, A Totally Self-Checking Checker for a Parallel Unordered Coding Scheme 1994 43 IEEETC Su & Wu, Testing Iterative Logic Arrays for Sequential Faults with a Constant Number of Patterns 1994 43 IEEETC Chen & Kumar, Comments on ``Area-Time Optimal Adder Design'' 1994 43 IEEETC Montuschi & Ciminiera, Over-Redundant Digit Sets and the Design of Digit-by-Digit Division Units 1994 43 IEEETC Lee & Yannakakis, Testing Finite-State Machines: State Identification and Verification 1994 43 IEEETC Goldberg & Maggs & Plotkin, A Parallel Algorithm for Reconfiguring a Multibutterfly Network with Faulty Switches 1994 43 IEEETC Fiduccia & Rappoport, Perfect Shifters 1994 43 IEEETC Mehta & Sahni, Computing Display Conflicts in String Visualization 1994 43 IEEETC Wegener, Comments on ``A Characterization of Binary Decision Diagrams'' 1994 43 IEEETC Burns & Mitchell, Parameter Selection for Server-Aided RSA Computation Schemes 1994 43 IEEETC Lakshman & Wei, Distributed Computing on Regular Networks with Anonymous Nodes 1994 43 IEEETC Zheng, Compressed Tree Machines 1994 43 IEEETC Wei, A Systolic Power-Sum Circuit for GF(2^m) 1994 43 IEEETC Chung & Sharma & Agrawal, Cost-Performance Trade-Offs in Manhattan Street Network Versus 2-D Torus 1994 43 IEEETC Miller & Pritikin & Sudborough, Near Embeddings of Hypercubes into Cayley Graphs on the Symmetric Group 1994 43 IEEETC Chen & Tzeng, Efficient Resource Placement in Hypercubes Using Multiple-Adjacency Codes 1994 43 IEEETC Kawahito & Ishida & Nakamura & Kameyama & Higuchi, High-Speed Area-Efficient Multiplier Design Using Multiple-Valued Current-Mode Circuits 1994 43 IEEETC Kabuo & Taniguchi & Miyoshi & Yamashita & Urano & Edamatsu & Kuninobu, Accurate Rounding Scheme for the Newton-Raphson Method Using Redundant Binary Representation 1994 43 IEEETC Piestrak, Design of Residue Generators and Multioperand Modular Adders Using Carry-Save Adders 1994 43 IEEETC Wigley & Jullien & Reaume, Large Dynamic Range Computations over Small Finite Rings 1993 42 IEEETC Jan & Oruc, Fast Self-Routing Permutation Switching on an Asymptotically Minimum Cost Network 1993 42 IEEETC Rowley & Bose, Fault-Tolerant Ring Embedding in de Bruijn Networks 1993 42 IEEETC Kantabutra, A Recursive Carry-Lookahead/Carry-Select Hybrid Adder 1993 42 IEEETC Ahn & Sahni, NP-Hard Module Rotation Problems 1993 42 IEEETC Varvarigou & Roychowdhury & Kailath, Reconfiguring Processor Arrays Using Multiple-Track Models: The 3-Track-1-Spare-Approach 1993 42 IEEETC Lin, Constant Weight Codes for Correcting Symmetric Errors and Detecting Unidirectional Errors 1993 42 IEEETC Kantabutra, Accelerated Two-Level Carry-Skip Adders--A Type of Very Fast Adders 1993 42 IEEETC Tien & Ho & Yang, Broadcasting on Incomplete Hypercubes 1993 42 IEEETC Bagherzadeh & Nassif & Latifi, A Routing and Broadcasting Scheme on Faulty Star Graphs 1993 42 IEEETC Wu & Hsu & Liu, A Quantitative Evaluation of Cache Types for High-Performance Computer Systems 1993 42 IEEETC Tyagi, A Reduced-Area Scheme for Carry-Select Adders 1993 42 IEEETC Chimento & Trivedi, The Completion Time of Programs on Processors Subject to Failure and Repair 1993 42 IEEETC Vaidya & Pradhan, Fault-Tolerant Design Strategies for High Reliability and Safety 1993 42 IEEETC Colbourn & Devitt & Harms & Kraetzl, Assessing Reliability of Multistage Interconnection Networks 1993 42 IEEETC Schwarz & Flynn, Parallel High-Radix Nonrestoring Division 1993 42 IEEETC Tzeng & Chuang & Wu, Creating Disjoint Paths in Gamma Interconnection Networks 1993 42 IEEETC Bernhard, Bounds on the Performance of Message Routing Heuristics 1993 42 IEEETC Al-Bassam & Bose, Design of Efficient Error-Correcting Balanced Codes 1993 42 IEEETC Bhide & John & Kabuka, A Boolean Neural Network Approach for the Traveling Salesman Problem 1993 42 IEEETC Hasan & Wang & Bhargava, A Modified Massey-Omura Parallel Multiplier for a Class of Finite Fields 1993 42 IEEETC Gotze & Paul & Sauer, An Efficient Jacobi-like Algorithm for Parallel Eigenvalue Computation 1993 42 IEEETC Pomeranz & Reddy, Classification of Faults in Synchronous Sequential Circuits 1993 42 IEEETC Kim & Shin, Deadlock-Free Fault-Tolerant Routing in Injured Hypercubes 1993 42 IEEETC Bruck & Cypher & Ho, Fault-Tolerant Meshes and Hypercubes with Minimal Numbers of Spares 1993 42 IEEETC Dowd & Bogineni & Aly & Perreault, Hierarchical Scalable Photonic Architectures for High-Performance Processor Interconnection 1993 42 IEEETC Porter & Zheng, A Nonbinary Neural Network Design 1993 42 IEEETC Wang & Lin, A Systolic Architecture for Computing Inverses and Divisions in Finite Fields GF(2^m) 1993 42 IEEETC Swarzlander, Editorial: The Five-Step Paradigm for Success in Technical Journal Publication 1993 42 IEEETC Bhatt & Pucci & Ranade & Rosenberg, Scattering and Gathering Messages in Networks of Processors 1993 42 IEEETC Alia & Martinelli, On the Lower Bound to the VLSI Complexity of Number Conversion from Weighted to Residue Representation 1993 42 IEEETC Ortega & Lloris & Prieto & Pelayo, Test-Pattern Generation Based on Reed-Muller Coefficients 1993 42 IEEETC Park & Kim, Geometrical Learning Algorithm for Multilayer Neural Networks in a Binary Field 1993 42 IEEETC Mehta & Sahni, A Data Structure for Circular String Analysis and Visualization 1993 42 IEEETC Day & Tripathi, Embedding of Cycles in Arrangement Graphs 1993 42 IEEETC Arno & Wheeler, Signed Digit Representations of Minimal Hamming Weight 1993 42 IEEETC Brunner & Curiger & Hofstetter, On Computing Multiplicative Inverses in GF(2m) 1993 42 IEEETC Duprat & Herreros & Kla, New Redundant Representations of Complex Numbers and Vectors 1993 42 IEEETC Krishna & Sun, On Theory and Fast Algorithms for Error Correction in Residue Number System Product Codes 1993 42 IEEETC Sha & Steiglitz, Reconfigurability and Reliability of Systolic/Wavefront Arrays 1993 42 IEEETC Lin, Manipulating General Vectors on Synchronous Binary N-Cube 1993 42 IEEETC Lo & Thanawastien & Rao, Berger Check Prediction for Array Multipliers and Array Dividers 1993 42 IEEETC Das & Bhattacharya & Dattagupta, Isomorphism of Conflict Graphs in Multistage Interconnection Networks and Its Application to Optimal Routing 1993 42 IEEETC Miller & Prasanna-Kumar & Reisis & Stout, Parallel Computations on Reconfigurable Meshes 1993 42 IEEETC Eldridge & Walter, Hardware Implementation of Montgomery's Modular Multiplication Algorithm 1993 42 IEEETC Piestrak, The Minimal Test Set for Multioutput Threshold Circuits Implemented as Sorting Networks 1993 42 IEEETC Chen & Upadhyaya, Reliability, Reconfiguration, and Spare Allocation Issues in Binary-Tree Architectures Based on Multiple-Level Redundancy 1993 42 IEEETC Cohen, One-Bit Delay in Ring Networks 1993 42 IEEETC Kamal & Hamacher, Response to ``One-Bit Delay in Ring Networks'' 1993 42 IEEETC Alnuweiri, A New Class of Optimal Bounded-Degree VLSI Sorting Networks 1993 42 IEEETC Hughey, Concurrent Error Detection on Programmable Systolic Arrays 1993 42 IEEETC Graham & Seidel, The Cost of Broadcasting on Star Graphs and k-ary Hypercubes 1993 42 IEEETC Kantabutra, Designing Optimum One-Level Carry-Skip Adders 1993 42 IEEETC Douglass, Rearrangeable Three-Stage Interconnection Networks and Their Routing Properties 1993 42 IEEETC Lim & Cheng & Sahni, Optimal Joining of Compacted Cells 1993 42 IEEETC Varvarigou & Roychowdhury & Kailath, A Polynomial Time Algorithm for Reconfiguring Multiple-Track Models 1993 42 IEEETC Di Claudio & Orlandi & Piazza, A Systolic Redundant Residue Arithmetic Error Correction Circuit 1993 42 IEEETC Redinbo & Napolitano & Andaleon, Multibit Correcting Data Interface for Fault-Tolerant Systems 1993 42 IEEETC Rao, Computational Complexity Issues in Operative Diagnosis of Graph-Based Systems 1993 42 IEEETC Raghavan & Hayes, Reducing Interference Among Vector Accesses in Interleaved Memories 1993 42 IEEETC Arazi, Architectures for Exponentiation Over GF(2^n) Adopted for Smartcard Application 1993 42 IEEETC Funabiki & Takefuji & Lee, Comparisons of Seven Neural Network Models on Traffic Control Problems in Multistage Interconnection Networks 1993 42 IEEETC Chakravarty, A Characterization of Binary Decision Diagrams 1993 42 IEEETC Jha, Fault Detection in CVS Parity Trees with Application to Strongly Self-Checking Parity and Two-Rail Checkers 1993 42 IEEETC Tzeng, A Cube-Connected Cycles Architecture with High Reliability and Improved Performance 1993 42 IEEETC Bagchi & Hakimi & Schmeichel, Gossiping in a Distributed Network 1993 42 IEEETC Braun & Stephan, On Optimizing Diameter and Average Distance of Directed Interconnected Networks 1993 42 IEEETC Miel, Constant Geometry Fast Fourier Transforms on Array Processors 1993 42 IEEETC Walter, Systolic Modular Multiplication 1993 42 IEEETC Parhami, On the Implementation of Arithmetic Support Functions for Generalized Signed-Digit Number Systems 1993 42 IEEETC Chakravarty, A Characterization of Binary Decision Diagrams 1993 42 IEEETC Fowkes, Hardware Efficient Algorithms for Trigonometric Functions 1993 42 IEEETC Tzeng, A Cube-Connected Cycles Architecture with High Reliability and Improved Performance 1993 42 IEEETC Bagchi & Hakimi & Schmeichel, Gossiping in a Distributed Network 1993 42 IEEETC Latifi, Combinatorial Analysis of the Fault-Diameter of the n-cube 1992 41 IEEETC Ercegovac & Lang, On-the-Fly Rounding 1992 41 IEEETC Clarkson & Gorse & Taylor & Ng, Learning Probabilistic RAM Nets Using VLSI Structures 1992 41 IEEETC Bose & Al-Bassam, Byte Unidirectional Error Correcting and Detecting Codes 1992 41 IEEETC Kuo & Liang, Concurrent Error Detection and Correction in Real-Time Systolic Sorting Arrays 1992 41 IEEETC Schwabe, A Benes-like Theorem for the Shuffle-Exchange Graph 1992 41 IEEETC Brzozowski & Ebergen, On the Delay-Sensitivity of Gate Networks 1992 41 IEEETC Yeh & Feng, On a Class of Rearrangeable Networks 1992 41 IEEETC Boros & Hammer & Shamir, A Polynomial Algorithm for Balancing Acyclic Data Flow Graphs 1992 41 IEEETC Fraigniaud, Asymptotically Optimal Broadcasting and Gossiping in Faulty Hypercube Multicomputers 1992 41 IEEETC Orton & Peppard & Tavares, New Fault Tolerant Techniques for Residue Number Systems 1992 41 IEEETC Srinivas & Biswas, Design and Analysis of a Generalized Architecture for Reconfigurable m-ary Tree Structures 1992 41 IEEETC Goldfeld & Etzion, UPP Graphs and UMFA Networks--Architecture for Parallel Systems 1992 41 IEEETC Cortadella & Llaberia, Evaluation of A+B=K Conditions Without Carry Propagation 1992 41 IEEETC Yang & Fuja, The Reliability of Systems with Two Levels of Fault Tolerance: The Return of the ``Birthday Surprise'' 1992 41 IEEETC Scherson & Kramer & Aleyne, Bit-Parallel Arithmetic in a Massively-Parallel Associative Processor 1992 41 IEEETC Dowd, Wavelength Division Multiple Access Channel Hypercube Processor Interconnection 1992 41 IEEETC Lee & Hayes, A Fault-Tolerant Communication Scheme for Hypercube Computers 1992 41 IEEETC Kandlur & Shin, Traffic Routing for Multicomputer Networks with Virtual Cut-Through Capability 1992 41 IEEETC Allen & Kennedy, Vector Register Allocation 1992 41 IEEETC Hong & Leung, On-Line Scheduling of Real-Time Tasks 1992 41 IEEETC Skavantzos & Stouraitis, Decomposition of Complex Multipliers Using Polynomial Encoding 1992 41 IEEETC Alspach, Cayley Graphs with Optimal Fault Tolerance 1992 41 IEEETC Fagin, Fast Addition of Large Integers 1992 41 IEEETC Chung & Chen & Lin, On the Complexity of Search Algorithms 1992 41 IEEETC Kelliher & Owens & Irwin & Hwang, ELM--A Fast Addition Algorithm Discovered by a Program 1992 41 IEEETC Chan & Schlag & Thomborson & Oklobdzija, Delay Optimization of Carry-Skip Adders and Block Carry-Lookahead Adders Using Multidimensional Dynamic Programming 1992 41 IEEETC Lynch & Swartzlander, A Spanning Tree Carry Lookahead Adder 1992 41 IEEETC Mou & Jutand, ``Overturned-Stairs'' Adder Trees and Multiplier Design 1992 41 IEEETC Takagi, A Radix-4 Modular Multiplication Hardware Algorithm for Modular Exponentiation 1992 41 IEEETC Skavantzos & Rao, New Multipliers Modulo 2^N - 1 1992 41 IEEETC Hasan & Wang & Bhargava, Modular Construction of Low Complexity Parallel Multipliers for a Class of Finite Fields GF(2^m) 1992 41 IEEETC Hasan & Bhargava, Bit-Serial Systolic Divider and Multiplier for Finite Fields GF(2^m) 1992 41 IEEETC Wong & Flynn, Fast Division Using Accurate Quotient Approximations to Reduce the Number of Iterations 1992 41 IEEETC Lu & Chiang, A Novel Division Algorithm for the Residue Number System 1992 41 IEEETC Bagchi & Hakimi, Data Transfers in Broadcast Networks 1992 41 IEEETC Fiol & Llado, The Partial Line Digraph Technique in the Design of Large Interconnection Networks 1992 41 IEEETC Ho, An Observation on the Bisectional Interconnection Networks 1992 41 IEEETC Lee & Lee & Kim, Optimal Task Assignment in Linear Array Networks 1992 41 IEEETC Tao & Hartmann & Lala, A General Technique for Designing Totally Self-Checking Checker for 1-out-of-N Code with Minimum Gate Delay 1992 41 IEEETC Takagi & Yajima, Modular Multiplication Hardware Algorithms with a Redundant Representation and Their Application to RSA 1992 41 IEEETC LaPaugh & Lipton & Sandberg, How to Store a Triangular Matrix 1992 41 IEEETC Liaw & Lin, On the OBDD-Representation of General Boolean Functions 1992 41 IEEETC Belkhale & Banerjee, Parallel Algorithms for Geometric Connected Component Labeling on a Hypercube Multiprocessor 1992 41 IEEETC Antonio & Huang & Tsai, A Fast Distributed Shortest Path Algorithm for a Class of Hierarchically Clustered Data Networks 1992 41 IEEETC Hansen & Lih, Improved Algorithms for Partitioning Problems in Parallel, Pipelined, and Distributed Computing 1992 41 IEEETC Blair & Lloyd, Minimizing External Wires in Generalized Single-Row Routing 1992 41 IEEETC Stevens & Kaplan, Determinacy of Generalized Schema 1992 41 IEEETC Arnold & Bailey & Cowles, Comments on ``An Architecture for Addition and Subtraction of Long Word Length Numbers in the Logarithmic Number System'' 1992 41 IEEETC Leighton & Maggs, Fast Algorithms for Routing Around Faults in Multibutterflies and Randomly-Wired Splitter Networks 1992 41 IEEETC Bruck & Cyper & Soroker, Tolerating Faults in Hypercubes Using Subcube Partitioning 1992 41 IEEETC Rangarajan & Fussell, Diagnosing Arbitrarily Connected Parallel Computers with High Probability 1992 41 IEEETC Bianchini & Buskens, Implementation of On-Line Distributed System-Level Diagnosis Theory 1992 41 IEEETC Chuang & Tzeng, A Fast Recognition-Complete Processor Allocation Strategy for Hypercube Computers 1992 41 IEEETC Sarkar & Mukherjee, Design of Optimal Systolic Algorithms for the Transitive Closure Problem 1992 41 IEEETC Blough & Pelc, Complexity of Fault Diagnosis in Comparison Models 1992 41 IEEETC Cappello & Miranker, Systolic Super Summation with Reduced Hardware 1992 41 IEEETC Lui & Muzio, Boolean Matrix Transforms for the Minimization of Modulo-2 Canonical Expansions 1992 41 IEEETC Wilkinson, Comments on ``Design and Analysis of Arbitration Protocols'' 1992 41 IEEETC Jen & Kwai, Data Flow Representation of Iterative Algorithms for Systolic Arrays 1992 41 IEEETC Tsay & Yuan, Some Combinatorial Aspects of Parallel Algorithm Design for Matrix Multiplication 1992 41 IEEETC Tuan, On Optimal Single Jog River Routing 1992 41 IEEETC Sarrafzadeh & Wong, Bottleneck Steiner Trees in the Plane 1992 41 IEEETC Cheng & Agrawal, Initializability Consideration in Sequential Machine Synthesis 1992 41 IEEETC Kim & Kameda, An Algorithm for Optimal Static Load Balancing in Distributed Computer Systems 1992 41 IEEETC Wong & Delosme, Optimization of Computation Time for Systolic Arrays 1992 41 IEEETC Dandamudi & Eager, Hot-Spot Contention in Binary Hypercube Networks 1992 41 IEEETC Chen, Symbol Error-Correcting Codes for Computer Memory Systems 1992 41 IEEETC David & Ginosar & Yoeli, An Efficient Implementation of Boolean Functions as Self-Timed Circuits 1992 41 IEEETC David & Ginosar & Yoeli, Implementing Sequential Machines as Self-Timed Circuits 1992 41 IEEETC Varman & Doshi, Sorting with Linear Speedup on a Pipelined Hypercube 1992 41 IEEETC Chen & Lin & Chang, A Systolic Algorithm for the k-Nearest Neighbors Problem 1992 41 IEEETC Arazi, A Circular Binary Search 1992 41 IEEETC Ibarra & Jiang & Wang, String Editing on a One-Way Linear Array of Finite-State Machines 1992 41 IEEETC Chen & Lai, Constructing Parallel Paths Between Two Subcubes 1992 41 IEEETC Boneh & Savir, Statistical Resistance to Detection 1991 40 IEEETC Tagliarini & Christ & Page, Optimization Using Neural Networks 1991 40 IEEETC Lin & Prasanna & Przytula, Algorithmic Mapping of Neural Network Models onto Parallel SIMD Machines 1991 40 IEEETC Zissimopoulos & Paschos & Pekergin, On the Approximation of NP-Complete Problems by Using the Boltzmann Machine Method: The Cases of Some Covering and Packing Problems 1991 40 IEEETC Salem & Young, A Neural Network Approach to the Labeling of Line Drawings 1991 40 IEEETC Vassiliadis & Schwarz & Sung, Hard-Wired Multipliers with Encoded Partial Products 1991 40 IEEETC Pomeranz & Kohavi, Polynomial Complexity Algorithms for Increasing the Testability of Digital Circuits by Testing-Module Insertion 1991 40 IEEETC Kostopoulos, An Algorithm for the Computation of Binary Logarithms 1991 40 IEEETC Huang & Tripathi & Chen & Tseng, An Efficient Routing Algorithm for Realizing Linear Permutations on p^t-Shuffle-Exchange Networks 1991 40 IEEETC Sarrafzadeh & Lee, Topological Via Minimization Revisited 1991 40 IEEETC Efe, A Variation on the Hypercube with Lower Diameter 1991 40 IEEETC Kim & McNaughton & McCloskey, A Polynomial Time Algorithm for the Local Testability Problem of Deterministic Finite Automata 1991 40 IEEETC Irwin & Owens, A Two-Dimensional, Distributed Logic Architecture 1991 40 IEEETC Martel & Moh, Optimal Prioritized Conflict Resolution on a Multiple Access Channel 1991 40 IEEETC Beivide & Herrada & Balcazar & Arruabarrena, Optimal Distance Networks of Low Degree for Parallel Computers 1991 40 IEEETC Han, An Optimal Linked List Prefix Algorithm on a Local Memory Computer 1991 40 IEEETC Sridhar & Raghavendra, Fault-Tolerant Networks Based on the de Bruijn Graph 1991 40 IEEETC Koh & Tcha, Information Dissemination in Trees with Nonuniform Edge Transmission Times 1991 40 IEEETC Kumar, Hierarchical Quorum Consensus: A New Algorithm for Managing Replicated Data 1991 40 IEEETC Yang & Masson, Nonblocking Broadcast Switching Networks 1991 40 IEEETC Dally, Express Cubes: Improving the Performance of k-ary n-cube Interconnection Networks 1991 40 IEEETC Raghavendra & Boppana, On Self-Routing in Benes and Shuffle-Exchange Networks 1991 40 IEEETC Lakshmanan & Ravikumar & Ganesan, Coping with Erroneous Information while Sorting 1991 40 IEEETC Nodine & Lopresti & Vitter, I/O Overhead and Parallel VLSI Architectures for Lattice Computations 1991 40 IEEETC Faloutsos & Metaxas, Disk Allocation Methods Using Error Correcting Codes 1991 40 IEEETC Gupta & Hambrusch, Embedding Complete Binary Trees into Butterfly Networks 1991 40 IEEETC Alia & Martinelli, A VLSI Modulo m Multiplier 1991 40 IEEETC Singh & Youn, A Modular Fault-Tolerant Binary Tree Architecture with Short Links 1991 40 IEEETC Lai & Sprague, Placement of the Processors of a Hypercube 1991 40 IEEETC Shang & Fortes, Time Optimal Linear Schedules for Algorithms with Uniform Dependencies 1991 40 IEEETC Ibarra & Pong & Sohn, Parallel Recognition and Parsing on the Hypercube 1991 40 IEEETC Kumar & Tsai, On Synthesizing Optimal Family of Linear Systolic Arrays for Matrix Multiplication 1991 40 IEEETC Choinski & Tylaska, Generation of Digit Reversed Address Sequences for Fast Fourier Transforms 1991 40 IEEETC Davidson & Lee & Wolfe, Timed Atomic Commitment 1991 40 IEEETC Raghavan & Tripathi, Sequential Diagnosability is Co-NP Complete 1991 40 IEEETC Guan & Langston, Time-Space Optimal Parallel Merging and Sorting 1991 40 IEEETC Smith & Lin, The Tree-Match Chip 1991 40 IEEETC Tong & Kain, Vote Assignments in Weighted Voting Mechanisms 1991 40 IEEETC Chen & Lai & Lien, A Note on ``Generalized Hypercube and Hyperbus Structures for a Computer Network'' 1991 40 IEEETC Gouda & Multari, Stabilizing Communication Protocols 1991 40 IEEETC Probert & Saleh, Synthesis of Communication Protocols: Survey and Assessment 1991 40 IEEETC Rajagopal & Miller, Synthesizing a Protocol Converter from Executable Protocol Traces 1991 40 IEEETC Harper & Linebarger, Conflict-Free Vector Access Using a Dynamic Storage Scheme 1991 40 IEEETC Tzeng & Wei, Enhanced Hypercubes 1991 40 IEEETC Nicol & Hallaron, Improved Algorithms for Mapping Pipelined and Parallel Computations 1991 40 IEEETC Vijayan, Generalization of Min-Cut Partitioning to Tree Structures and Its Applications 1991 40 IEEETC Murphy & McCraw, Designing Storage Efficient Decision Trees 1991 40 IEEETC Dutt & Hayes, Subcube Allocation in Hypercube Computers 1991 40 IEEETC Bose, On Unordered Codes 1991 40 IEEETC Nikolos, Theory and Design of t-Error Correcting/d-Error Detecting (d>t) and All Unidirectional Error Detecting Codes 1991 40 IEEETC Raghavan & Tripathi, Improved Diagnosability Algorithms 1991 40 IEEETC Haddad & Dahbura & Sharma, Increased Throughput for the Testing and Repair of RAM's with Redundancy 1991 40 IEEETC Bar-Noy & Peleg, Square Meshes are not always Optimal 1991 40 IEEETC Bryant, On the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Application to Integer Multiplication 1991 40 IEEETC Oruc & Mittal, Setup Algorithms for Cube-Connected Parallel Computers Using Recursive Karnaugh Maps 1991 40 IEEETC Ferreira, A Parallel Time/Hardware Tradeoff T.H = O(2^{n/2}) for the Knapsack Problem 1991 40 IEEETC Ghafoor & Bashkow, A Study of Odd Graphs as Fault-Tolerant Interconnection Networks 1991 40 IEEETC Kavianpour & Kim, Diagnosabilities of Hypercubes Under the Pessimistic One-Step Diagnosis Strategy 1991 40 IEEETC Linder & Harden, An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-ary n-Cubes 1991 40 IEEETC Ellis, Embedding Rectangular Grids into Square Grids 1991 40 IEEETC Hong & Muroga, Absolute Minimization of Completely Specified Switching Functions 1991 40 IEEETC Silberman & Spillinger, Functional Fault Simulation as a Guide for Biased-Random Test Pattern Generation 1991 40 IEEETC Esfahanian & Ni & Sagan, The Twisted N-Cube with Application to Multiprocessing 1991 40 IEEETC Lewis & Kung, An Optimal Systolic Array for the Algebraic Path Problem 1991 40 IEEETC Alnuweiri & Kumar, Optimal VLSI Sorting with Reduced Number of Processors 1991 40 IEEETC Haglin & Venkatesan, Approximation and Intractability Results for the Maximum Cut Problem and its Variants 1991 40 IEEETC Fu & Lee, Minimum Spanning Trees of Moving Points in the Plane 1991 40 IEEETC Codenotti & Tamassia, A Network Flow Approach to the Reconfiguration of VLSI Arrays 1991 40 IEEETC Saxena & Bhatt & Prasad, Correction to ``Parallel Algorithm for Delaunay Triangulation on Orthogonal Tree Network in Two and Three Dimensions'' 1991 40 IEEETC Samatham & Pradham, Correction to ``The De Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI'' 1990 39 IEEETC Chen & Shin, Adaptive Fault-Tolerant Routing in Hypercube Multicomputers 1990 39 IEEETC Zarowski & Card, On Addition and Multiplication with Hensel Codes 1990 39 IEEETC Melhem & Hwang, Embedding Rectangular Grids into Square Grids with Dilation Two 1990 39 IEEETC Yang & Lee & Chen, Parallel Graph Algorithms Based Upon Broadcast Communications 1990 39 IEEETC Kugelmass & Steiglitz, An Upper Bound on Expected Clock Skew in Synchronous Systems 1990 39 IEEETC Biswas & Srinivas, A Reconfigurable Tree Architecture with Multistage Interconnection Network 1990 39 IEEETC Lewis, An Architecture for Addition and Subtraction of Long Word Length Numbers in the Logarithmic Number System 1990 39 IEEETC Chakrabarti & Ja'Ja', Systolic Architectures for the Computation of the Discrete Hartley and the Discrete Cosine Transforms Based on Prime Factor Decomposition 1990 39 IEEETC Chakravarty & Hunt, On Computing Signal Probability and Detection Probability of Stuck-at Faults 1990 39 IEEETC Ercegovac & Lang, Fast Multiplication Without Carry-Propagate Addition 1990 39 IEEETC Kuszmaul, Fast, Deterministic Routing, on Hypercubes, Using Small Buffers 1990 39 IEEETC Martin & van de Snepscheut, An Interconnection Network for Distributed Recursive Computations 1990 39 IEEETC Bose, Group Theoretic Signature Analysis 1990 39 IEEETC Sack & Suri, An Optimal Algorithm for Detecting Weak Visibility of a Polygon 1990 39 IEEETC Ciminiera & Montuschi, Higher Radix Square Rooting 1990 39 IEEETC Hornick & Maddila & Mucke & Rosenberger & Skiena & Tollis, Searching on a Tape 1990 39 IEEETC Hortensius & McLeod & Card, Cellular Automata-Based Signature Analysis for Built-in Self-Test 1990 39 IEEETC Banerjee & Rahmeh & Stunkel & Nair & Roy & Balasubramanian & Abraham, Algorithm-Based Fault Tolerance on a Hypercube Multiprocessor 1990 39 IEEETC Chung & Liu & Lin, Scheduling Periodic Jobs That Allow Imprecise Results 1990 39 IEEETC Sam & Gupta, A Generalized Multibit Recoding of Two's Complement Binary Numbers and Its Proof with Application in Multiplier Implementations 1990 39 IEEETC Hashemian, Square Rooting Algorithms for Integer and Floating-Point Numbers 1990 39 IEEETC Arnold & Bailey & Cowles & Cupal, Redundant Logarithmic Arithmetic 1990 39 IEEETC Vuillemin, Exact Real Computer Arithmetic with Continued Fractions 1990 39 IEEETC Shin & chen, Minimal Order Loop-Free Routing Strategy 1990 39 IEEETC Belik, An Efficient Deadlock Avoidance Technique 1990 39 IEEETC Wang & Lee, An Efficient Channel Routing Algorithm to Yield an Optimal Solution 1990 39 IEEETC Huang, Notes on Shuffle/Exchange Type Permutation Sets 1990 39 IEEETC Lee & Yoon, The B-Network: A Multistage Interconnection Network with Backward Links 1990 39 IEEETC Kundu & Reddy, On Symmetric Error Correcting and All Unidirectional Error Detecting Codes 1990 39 IEEETC Fujiwara, Computational Complexity of Controllability/Observability Problems for Combinational Circuits 1990 39 IEEETC Dally, Performance Analysis of k-ary n-cube Interconnection Networks 1990 39 IEEETC Youssef & Arden, Equivalence Between Functionality and Topology of Log N-Stage Banyan Networks 1990 39 IEEETC Montgomery & Kumar, Systematic Random Error Correcting and All Unidirectional Error Detecting Codes 1990 39 IEEETC Lu & Zhang & Muratta, Analysis of Self-Stabilizing Clock Synchronization by Means of Stochastic Petri Nets 1990 39 IEEETC Preparata & Vuillemin, Practical Cellular Dividers 1990 39 IEEETC Mathias & Patnaik, Systolic Evaluation of Polynomial Expressions 1990 39 IEEETC Wei & Thompson, Area-Time Optimal Adder Design 1990 39 IEEETC Li & Probst, Optimal VLSI Dictionary Machines Without Compress Instructions 1990 39 IEEETC Shih & Wu & Kuo, Unifying Maximum Cut and Minimum Cut of a Planar Graph 1990 39 IEEETC Matic, Emulation of Hypercube Architecture on Nearest-Neighbor Mesh-Connected Processing Elements 1990 39 IEEETC Rosenkrantz, Half-Hot State Assignments for Finite State Machines 1990 39 IEEETC Gale & Das & Yu, Improvements to an Algorithm for Equipartitioning 1990 39 IEEETC Friedman & Supowit, Finding the Optimal Variable Ordering for Binary Decision Diagrams 1990 39 IEEETC Beigel & Gill, Sorting n Objects with a k-Sorter 1990 39 IEEETC Ling, An Approach to Implementing Multiplication with Small Tables 1990 39 IEEETC Ancilotti & Lazzerini & Prete & Sacchi, A Distributed Commit Protocol for a Multicomputer System 1990 39 IEEETC Roychowdhury & Bruck & Kailath, Efficient Algorithmsx for Reconfiguration in VLSI/WSI Arrays 1990 39 IEEETC Dutt & Hayes, On Designing and Reconfiguring k-Fault-Tolerant Tree Architectures 1990 39 IEEETC Dunning & Dial & Varanasi, Unidirectional Byte Error Detecting Codes for Computer Memory Systems 1990 39 IEEETC Piestrak, Design of High-Speed and Cost-Effective Self-Testing Checkers for Low-Cost Arithmetic Codes 1990 39 IEEETC Quinn, Analysis and Implementation of Branch-and-Bound Algorithms on a Hypercube Multicomputer 1990 39 IEEETC Lo & Thanawastien, On the Design of Combinational Totally Self-Checking 1-out-of-3 Code Checkers 1990 39 IEEETC Lin & Kumar, A Note on the Linear Transformation Method for Systolic Array Design 1990 39 IEEETC Saxena & Bhatt & Prasad, Efficient VLSI Parallel Algorithm for Delaunay Triangulation on Orthogonal Tree Network in Two and Three Dimensions 1990 39 IEEETC Choi & Park & Kim, An Improved Hardware Implementation of Fault-Tolerant Clock Synchronization Algorithm for Large Multiprocessor Systems 1990 39 IEEETC Kant & Ravichandran, Synthesizing Robust Data Structures--An Introduction 1990 39 IEEETC Isenman & Shasha, Performaance and Architectural Issues for String Matching 1990 39 IEEETC Sugla & Carlson, Extreme Area-Time Tradeoffs in VLSI 1990 39 IEEETC Wang & Pei, A VLSI Design for Computing Exponentiations in GF(2^m) and Its Application to Generate Pseudorandom Number Sequences 1990 39 IEEETC Sasao & Besslich, On the Complexity of Mod-2 Sum PLA's 1990 39 IEEETC Lin & Chen, On the Design of a Unidirectional Systolic Array for Key Enumeration 1990 39 IEEETC Majumdar & Raghavendra & Breuer, Fault Tolerance in Linear Systolic Arrays Using Time Redundancy 1990 39 IEEETC Cypher & Sanz & Snyder, Algorithms for Image Component Labeling on SIMD Mesh-Connected Computers 1990 39 IEEETC Brandman & Orlitsky & Hennessy, A Spectral Lower Bound Technique for the Size of Decision Trees and Two-Level AND/OR Circuits 1989 38 IEEETC Li & Chen & Fuchs, Local Concurrent Error Detection and Correction in Data Structures Using Virtual Backpointers 1989 38 IEEETC Blaum & van Tilborg, On t-Error Correcting/All Unidirectional Error Detecting Codes 1989 38 IEEETC Blelloch, Scans as Primitive Parallel Operations 1989 38 IEEETC Wang & Lee & Chang, The Number of Intersections Between Two Rectangular Paths 1989 38 IEEETC Kapralski, The Maximum and Minimum Selector SELRAM and its Application for Developing Fast Sorting Machines 1989 38 IEEETC Bhattacharya & Seth, Design of Parity Testable Combinational Circuits 1989 38 IEEETC Esfahanian, Generalized Measures of Fault Tolerance with Application to N-Cube Networks 1989 38 IEEETC Melhem, A Systolic Accelerator for the Iterative Solution of Sparse Linear Systems 1989 38 IEEETC Blake & Trivedi, Multistage Interconnection Network Reliability 1989 38 IEEETC Naclerio & Masuda & Nakajima, The Via Minimization Problem is NP-Complete 1989 38 IEEETC Cidon & Sidi, Distributed Assignment Algorithms for Multihop Packet Radio Networks 1989 38 IEEETC Badr & Podar, An Optimal Shortest-Path Routing Policy for Network Computers with Regular Mesh-Connected Topologies 1989 38 IEEETC Feng, A VLSI Architecture for Fast Inversion in GF(2^m) 1989 38 IEEETC Lee, A Performance Bound of Multistage Combining Networks 1989 38 IEEETC Bilardi, Merging and Sorting Networks with the Topology of the Omega Network 1989 38 IEEETC Muroga & Kambayashi & Lai & Culliney, The Transduction Method--Design of Logic Networks Based on Permissible Functions 1989 38 IEEETC Oruc & Thirumalai, A Systematic Design of Cellular Permutation Arrays 1989 38 IEEETC Shen & Oruc, On Systolic Contractions of Program Graphs 1989 38 IEEETC Chalasani & Bhawmik & Acharya & Palchaudhuri, Design of Testable VLSI Circuits with Minimum Area Overhead 1989 38 IEEETC Chang & Jiang, A Binary Single-Key-Lock System for Access Control 1989 38 IEEETC Hortensius & McLeod & Card, Parallel Random Number Generation for VLSI Systems Using Cellular Automata 1989 38 IEEETC Mandelbaum, On Iterative Arrays for the Euclidean Algorithms over Finite Fields 1989 38 IEEETC Ramarao, Distributed Algorithms for Network Recognition Problems 1989 38 IEEETC Johnsson & Ho, Optimum Broadcasting and Personalized Communication in Hypercubes 1989 38 IEEETC Bernstein & Rodeh & Gertner, On the Complexity of Scheduling Problems for Parallel/Pipelined Machines 1989 38 IEEETC Stone, Optimal Search Policies for Searches with I/O Bound Tasks 1989 38 IEEETC Hochet & Quinton & Robert, Systolic Gaussian Elimination over GF(p) with Partial Pivoting 1989 38 IEEETC Topkis, All-to-All Broadcast by Flooding in Communications Networks 1989 38 IEEETC Furer & Mehlhorn, AT^2-Optimal Galois Field Multiplier for VLSI 1989 38 IEEETC Lu & Zhang & Murata, A Design Approach for Self-Diagnosis of Fault-Tolerant Clock Synchronization 1989 38 IEEETC Dadda, On Serial-Input Multipliers for Two's Complement Numbers 1989 38 IEEETC Li & Maresca, Polymorphic-Torus Network 1989 38 IEEETC Hosseini, On Fault-Tolerant Structure, Distributed Fault-Diagnosis, Reconfiguration, and Recovery of the Array Processors 1989 38 IEEETC Vaishnavi, Multidimensional Balanced Binary Trees 1989 38 IEEETC Abraham & Padmanabhan, Performance of the Direct Binary n-Cube Network for Multiprocessors 1989 38 IEEETC Thiebaut, On the Fractal Dimension of Computer Programs and its Application to the Prediction of the Cache Miss Ratio 1989 38 IEEETC Pincin, A New Algorithm for Multiplication in Finite Fields 1989 38 IEEETC Schmeck & Schroeder & Starke, Systolic s^2-Way Merge Sort is Optimal 1989 38 IEEETC Hortensius & Card & McLeod & Pries, Importance Sampling for Ising Computers Using One-Dimensional Cellular Automata 1989 38 IEEETC Lam & Li & Jayakumar, A Study of Two Approaches for Reconfiguring Fault-Tolerant Systolic Arrays 1989 38 IEEETC Bertossi & Bonuccelli, A Gracefully Degradable VLSI System for Linear Programming 1989 38 IEEETC Chakravarty & Hunt, A Note on Detecting Sneak Paths in Transistor Networks 1989 38 IEEETC Chakravarty & Hunt & Ravi & Rosenkrantz, The Complexity of Generating Minimum Test Sets for PLA's and Monotone Combinational Circuits 1989 38 IEEETC Vroomen & Zsombor-Murray & Baracos & Hudson, Comments on ``Algorithmic State Machine Design and Automatic Theorem Proving: Dual Approaches to the Same Activity'' 1989 38 IEEETC Santoro & Suen, Reduction Techniques for Selection in Distributed Files 1989 38 IEEETC Ja'Ja' & Wu, A New Approach to Realizing Partially Symmetric Functions 1989 38 IEEETC Sridhar, A Fast Algorithm for Testing Isomorphism of Permutation Networks 1989 38 IEEETC Park & Balasubramanian & Lipton, Array Access Bounds for Block Storage Memory Systems 1989 38 IEEETC Singhal, A Heuristically-Aided Algorithm for Mutual Exclusion in Distributed Systems 1989 38 IEEETC Lin & Sahni, Fair Edge Deletion Problems 1989 38 IEEETC Parberry, A Note on Nondeterminism in Small, Fast Parallel Computers 1989 38 IEEETC Akers & Krishnamurthy, A Group-Theoretic Model for Symmetric Interconnection Networks 1989 38 IEEETC Samatham & Pradhan, The De Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI 1989 38 IEEETC Mukherjee, Hardware Algorithms for Determining Similarity Between Two Strings 1989 38 IEEETC Liu & Du, A Near-Optimal Heuristic Algorithm for Single-Row Routing 1989 38 IEEETC Miller & Stout, Mesh Computer Algorithms for Computational Geometry 1989 38 IEEETC Kljaich & Smith & Wojcik, Formal Verification of Fault Tolerance Using Theorem-Proving Techniques 1989 38 IEEETC Varma & Raghavendra, Fault-Tolerant Routing in Multistage Interconnection Networks 1989 38 IEEETC Eager & Zahorjan & Lazowska, Speedup Versus Efficiency in Parallel Systems 1989 38 IEEETC Sinha & Srimani, Fast Parallel Algorithms for Binary Multiplication and Their Implementation on Systolic Architectures 1989 38 IEEETC Rice & Jamieson, A Highly Parallel Algorithm for Root Extraction 1989 38 IEEETC El Guibaly, Design and Analysis of Arbitration Protocols 1989 38 IEEETC Vassiliadis & Schwarz & Hanrahan, A General Proof for Overlapped Multiple-Bit Scanning Multiplications 1989 38 IEEETC Fang & Li & Ni, On the Communication Complexity of Generalized 2-D Convolution on Array Processors 1989 38 IEEETC Scherson & Sen, Parallel Sorting in Two-Dimensional VLSI Models of Computation 1989 38 IEEETC Cherkassky & Malek, Partitioning and Permuting Properties of CC-Banyan Networks 1989 38 IEEETC Nakatani & Huang & Arden & Tripathi, K-Way Bitonic Sort 1989 38 IEEETC Van Gelder, PRAM Processor Allocation: A Hidden Bottleneck in Sublogarithmic Algorithms 1989 38 IEEETC Gazit & Malek, On the Number of Permutations Performable by Extra-Stage Multistage Interconnection Networks 1989 38 IEEETC Li & Jayakumar & Lam, Restructuring for Fault-Tolerant Systolic Arrays 1989 38 IEEETC Sanchis, Multiple-Way Network Partitioning 1989 38 IEEETC Bhasker & Sahni, Via Assignment in Single-Row Routing 1989 38 IEEETC Jagadish & Kailath, A Family of New Efficient Arrays for Matrix Multiplication 1988 37 IEEETC Lin & Wu, Broadcast Normalization in Systolic Design 1988 37 IEEETC Parhami, Carry-Free Addition of Recoded Binary Signed-Digit Numbers 1988 37 IEEETC Lin & Sahni, Maximum Alignment of Interchangeable Terminals 1988 37 IEEETC Chandrasekharan & Iyengar, NC Algorithms for Recognizing Chordal Graphs and k Trees 1988 37 IEEETC Scott & Brandenburg, Minimal Mesh Embeddings in Binary Hypercubes 1988 37 IEEETC Chan & Chin, On Embedding Rectangular Grids in Hypercubes 1988 37 IEEETC Atallah, On Multidimensional Arrays of Processors 1988 37 IEEETC Carlson, Modified Mesh-Connected Parallel Computers 1988 37 IEEETC Fuja & Heegard & Goodman, Linear Sum Codes for Random Access Memories 1988 37 IEEETC Doran, Variants of an Improved Carry Look-Ahead Adder 1988 37 IEEETC Steiglitz & Kamal & Watson, Embedding Computation in One-Dimensional Automata by Phase Coding Solitons 1988 37 IEEETC Fisher, Your Favorite Parallel Algorithms Might Not Be as Fast as You Think 1988 37 IEEETC Huang & Tripathi, Self-Routing Technique in Perfect-Shuffle Networks Using Control Tags 1988 37 IEEETC Oommen & Ma, Deterministic Learning Automata Solutions to the Equipartitioning Problem 1988 37 IEEETC Bokhari, Partitioning Problems in Parallel, Pipelined, and Distributed Computing 1988 37 IEEETC Stewart & Ward, A Solution to a Special Case of the Synchronization Problem 1988 37 IEEETC Tao & Hartmann & Lala, An Efficient Class of Unidirectional Error Detecting/Correcting Codes 1988 37 IEEETC Wainer, Generating Fractal-Like Surfaces on General Purpose Mesh-Connected Computers 1988 37 IEEETC Cosentino, Fault Tolerance in a Systolic Residue Arithmetic Processor Array 1988 37 IEEETC Burton, Storage Management in Virtual Tree Machines 1988 37 IEEETC Thanawastien & Srimani, The Universality of a Class of Modified Single-Stage Shuffle-Exchange Networks 1988 37 IEEETC Lee & Davis, An O(n+k) Algorithm for Ordered Retrieval from an Associative Memory 1988 37 IEEETC Du & Ibarra & Naveda, On Two-Dimensional Via Assignment for Single-Row Routing 1988 37 IEEETC Chang & Ibarra & Chung & Rao, Systolic Tree Implementation of Data Structures 1988 37 IEEETC Katseff, Incomplete Hypercubes 1988 37 IEEETC Choi & Malek, A Fault-Tolerant FFT Processor 1988 37 IEEETC Choi & Malek, A Fault-Tolerant Systolic Sorter 1988 37 IEEETC Banerjee, The Cubical Ring Connected Cycles: A Fault-Tolerant Parallel Computation Network 1988 37 IEEETC Vasanthavada & Marinos, Synchronization of Fault-Tolerant Clocks in the Presence of Malicious Failures 1987 36 IEEETC Chen & Shin, Processor Allocation in an N-Cube Multiprocessor Using Gray Codes 1987 36 IEEETC Sadayappan & Ercal, Nearest-Neighbor Mapping of Finite Element Graphs onto Processor Meshes 1987 36 IEEETC Durfee & Lesser & Corkill, Coherent Cooperation Among Communicating Problem Solvers 1987 36 IEEETC Takagi & Yajima, On-Line Error-Detectable High-Speed Multiplier Using Redundant Binary Representation and Three-Rail Logic 1987 36 IEEETC Brzozowski & Seger, A Characterization of Ternary Simulation of Gate Networks 1987 36 IEEETC Owens & Irwin, The Arithmetic Cube 1987 36 IEEETC Chazelle & Edelsbrunner, An Improved Algorithm for Constructing kth-Order Voronoi Diagrams 1987 36 IEEETC O'Leary & Stewart, From Determinacy to Systaltic Arrays 1987 36 IEEETC Lo & chen, A Hardwired Generalized Algorithm for Generating the Logarithm Base-k by Iteration 1987 36 IEEETC Akl & Santoro, Optimal Parallel Merging and Sorting Without Memory Conflicts 1987 36 IEEETC Conterno & Melen, An Analytical Model for a Class of Processor-Memory Interconnection Networks 1987 36 IEEETC Hosseini & Kuhl & Reddy, Distributed Fault-Tolerance of Tree Structures 1987 36 IEEETC Barbara & Garcia-Molina, The Reliability of Voting Mechanisms 1987 36 IEEETC Chlamtac & Kutten, Tree-Based Broadcasting in Multihop Radio Networks 1987 36 IEEETC Awerbuch & Shiloach, New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM 1987 36 IEEETC Gordon, Efficient Embeddings of Binary Trees in VLSI Arrays 1987 36 IEEETC Gecsei & Cerny, Self-Adjusting Networks for VLSI Simulation 1987 36 IEEETC Nishihara & Nishino, Binary Search Revisited: Another Advantage of Fibonacci Search 1987 36 IEEETC Kopetz & Ochsenreiter, Clock Synchronization in Distributed Real-Time Systems 1987 36 IEEETC Jahanian & Mok, A Graph-Theoretic Approach for Timing Analysis and its Implementation 1987 36 IEEETC Gavish, Optimization Models for Configuring Distributed Computer Systems 1987 36 IEEETC Oruc & Oruc, Programming Cellular Permutation Networks Through Decomposition of Symmetric Groups 1987 36 IEEETC Szymanski & Hamacher, On the Permutation Capability of Multistage Interconnection Networks 1987 36 IEEETC Akers & Krishnamurthy, On Group Graphs and Their Fault Tolerance 1987 36 IEEETC Ercegovac & Lang, On-the-Fly Conversion of Redundant into Conventional Representations 1987 36 IEEETC Yalamanchili & Aggarwal, A Characterization and Analysis of Parallel Processor Interconnection Networks 1987 36 IEEETC Lee, A New Benes Network Control Algorithm 1987 36 IEEETC Stankovic, Parallel and Distributed Computing 1987 36 IEEETC Lee & Aggarwal, A Mapping Strategy for Parallel Processing 1987 36 IEEETC Doshi & Varman, Optimal Graph Algorithms on a Fixed-Size Linear Array 1987 36 IEEETC LeBlanc & Mellor-Crummey, Debugging Parallel Programs with Instant Replay 1987 36 IEEETC Wu & Widmayer & Schlag & Wong, Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles 1987 36 IEEETC Wagner & Chin & McLuskey, Pseudorandom Testing 1987 36 IEEETC Wijshoff & van Leeuwen, On Linear Skewing Schemes and d-Ordered Vectors 1987 36 IEEETC Shin & Ramanathan, Clock Synchronization of a Large Multiprocessor System in the Presence of Malicious Faults 1987 36 IEEETC Chang & Ibarra & Palis, Parallel Parsing on a One-Way Array of Finite-State Machines 1987 36 IEEETC Schwartz & Loui, Dictionary Machines on Cube-Class Networks 1987 36 IEEETC Card & Gulak & McLeod & Pries, (lambda,T) Complexity Measures for VLSI Computations in Constant Chip Area 1987 36 IEEETC O'Leary, Systolic Arrays for Matrix Transpose and Other Reorderings 1986 35 IEEETC Ramakrishnan & Fussell & Silberschatz, Mapping Homogeneous Graphs on Linear Arrays 1986 35 IEEETC Nakamura, Algorithms for Iterative Array Multiplication 1986 35 IEEETC Bokhari & Raza, Reducing the Diameters of Computer Networks 1986 35 IEEETC Tsin, Finding Lowest Common Ancestors in Parallel 1986 35 IEEETC Pries & Thanailakis & Card, Group Properties of Cellular Automata and VLSI Applications 1986 35 IEEETC Rhyne & Strader, A Signed Bit-Sequential Multiplier 1986 35 IEEETC Dittert & O'Donnell, Correction to ``Lower Bounds for Sorting with Realistic Instruction Sets'' 1986 35 IEEETC Huang & Tripathi, Finite State Model and Compatibility Theory: New Analysis Tools for Permutation Networks 1986 35 IEEETC van Gils, A Triple Modular Redundancy Technique Providing Multiple-Bit Error Protection Without Using Extra Redundancy 1986 35 IEEETC Atallah & Hambrusch, Optimal Rotation Problems in Channel Routing 1986 35 IEEETC Ibarra & Kim & Palis, Designing Systolic Algorithms Using Sequential Machines 1986 35 IEEETC Jian, An O(2^{0.304n}) Algorithm for Solving Maximum Independent Set Problems 1986 35 IEEETC Reed & Truong & Jensen & Hsu, The VLSI Design of an Error-Trellis Syndrome Decoder for Certain Convolutional Codes 1986 35 IEEETC Vaishnavi, On the Height of Multidimensional Height-Balanced Trees 1986 35 IEEETC Vitter & Simons, New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P 1985 34 IEEETC Van Vu, Efficient Implementations of the Chinese Remainder Theorem for Sign Detection and Residue Decoding 1985 34 IEEETC Leiserson, Fat-Trees: Universal Networks for Hardware-Efficient Supercomputing 1985 34 IEEETC Pfister & Norton, ``Hot Spot'' Contention and Combining in Multistage Interconnection Networks 1985 34 IEEETC Oruc & Oruc, On Testing Isomorphism of Permutation Networks 1985 34 IEEETC Kruskal & Rudolph & Snir, The Power of Parallel Prefix 1985 34 IEEETC Wang & Truong & Shao & Deutsch & Omura & Reed, VLSI Architectures for Computing Multiplications and Inverses in GF(2^m) 1985 34 IEEETC Fisher & Kung, Synchronizing Large VLSI Processor Arrays 1985 34 IEEETC Woo & Agrawala, A Symmetric Tree Structure Interconnection Network and its Message Traffic 1985 34 IEEETC Carlsson & Cruthirds & Sexton & Wright, Interconnection Networks Based on a Generalization of Cube-Connected Cycles 1985 34 IEEETC Oruc & Oruc & Balabanian, Reconfiguration Algorithms for Interconnection Networks 1985 34 IEEETC Schmeck & Schroeder, Dictionary Machines for Different Models of VLSI 1985 34 IEEETC Agrawal & Leu, Dynamic Accessibility Testing and Path Length Optimization of Multistage Interconnection Networks 1985 34 IEEETC Imase & Soneoka & Okada, Connectivity of Regular Directed Graphs with Small Diameters 1985 34 IEEETC Atallah & Kosaraju, A Generalized Dictionary Machine for VLSI 1985 34 IEEETC Kumar & Dias & Jump, Switching Strategies in Shuffle-Exchange Packet-Switched Networks 1985 34 IEEETC Wijshoff & van Leeuwen, The Structure of Periodic Storage Schemes for Parallel Memories 1985 34 IEEETC Chughtai, Complete Binary Spanning Trees of the Eight Nearest Neighbor Array 1985 34 IEEETC Cohn, Counting Sequences with Large Local Distance 1985 34 IEEETC Moitra & Iyengar, A Maximally Parallel Balancing Algorithm for Obtaining Complete Balanced Binary Trees 1985 34 IEEETC Zak & Hwang, Polynomial Division on Systolic Arrays 1985 34 IEEETC Lee & Preparata, Correction to ``Computational Geometry--A Survey'' 1985 34 IEEETC Lee, On the Rearrangeability of 2(log_2 N) - 1 Stage Permutation Networks 1985 34 IEEETC Leighton & Leiserson, Wafer-Scale Integration of Systolic Arrays 1985 34 IEEETC Ashtaputre & Savage, Systolic Arrays with Embedded Tree Structures for Connectivity Problems 1985 34 IEEETC Demuth, Electronic Data Sorting 1985 34 IEEETC Dittert & O'Donnell, Lower Bounds for Sorting with Realistic Instruction Sets 1985 34 IEEETC Mannila, Measures of Presortedness and Optimal Sorting Algorithms 1985 34 IEEETC Rudolph, A Robust Sorting Network 1985 34 IEEETC Bilardi & Preparata, A Minimum Area VLSI Network for O(log n) Time Sorting 1985 34 IEEETC Leighton, Tight Bounds on the Complexity of Parallel Sorting 1985 34 IEEETC Siegel, Minimum Storage Sorting Networks 1985 34 IEEETC Wegner, Quicksort for Equal Keys 1985 34 IEEETC Janus & Lamagna, An Adaptive Method for Unknown Distributions in Distributive Partitioned Sorting 1985 34 IEEETC Rotem & Santoro & Sidney, Distributed Sorting 1985 34 IEEETC Zaks, Optimal Distributed Algorithms for Sorting and Ranking 1985 34 IEEETC Owens & Ja'Ja', Parallel Sorting with Serial Memories 1985 34 IEEETC Kwan & Baer, The I/O Performance of Multiway Mergesort and Tag Sort 1985 34 IEEETC McCulloch, Why Merge?--An Examination of Disk Sorting Strategy 1985 34 IEEETC Lindstrom & Vitter, The Design and Analysis of BucketSort for Bubble Memory Secondary Storage 1985 34 IEEETC Sloan, Comments on ``A Computer Algorithm for Calculating the Product AB Modulo M'' 1985 34 IEEETC Garcia-Molina & Kent, Evaluating Response Time in a Faulty Distributed Computing System 1985 34 IEEETC Ersoy, Semisystolic Array Implementation of Circular, Skew Circular, and Linear Convolutions 1985 34 IEEETC Matula & Kornerup, Finite Precision Rational Arithmetic: Slash Number Systems 1985 34 IEEETC Li & Wah, The Design of Optimal Systolic Arrays 1985 34 IEEETC Esfahanian & Hakimi, Fault-Tolerant Routing in DeBruijn Communication Networks 1985 34 IEEETC Takagi & Yasuura & Yajima, High-Speed VLSI Multiplication Algorithm with a Redundant Binary Addition Tree 1985 34 IEEETC MacKinnon & Taylor & Meijer & Akl, An Optimal Algorithm for Assigning Cryptographic Keys to Control Access in a Hierarchy 1985 34 IEEETC Kak, Encryption and Error-Correction Coding Using D Sequences 1985 34 IEEETC Somani & Agarwal, An Efficient Unsorted VLSI Dictionary Machine 1984 33 IEEETC Ramakrishnan & Varman, Modular Matrix Multiplication on a Linear Array 1984 33 IEEETC Kartashev & Kartashiv, Efficient Internode Communications in Reconfigurable Binary Trees 1984 33 IEEETC Carey & Thompson, An Efficient Implementation of Search Trees on [lg N + 1] Processors 1984 33 IEEETC Brent & Kung, Systolic VLSI Arrays for Polynomial GCD Computation 1984 33 IEEETC Er, On Generating the N-ary Reflected Gray Codes 1984 33 IEEETC Hassan, Signature Testing of Sequential Machines 1984 33 IEEETC Oruc, A Classification of Cube-Connected Networks with a Simple Control Scheme 1984 33 IEEETC Ja'Ja' & Owens, VLSI Sorting with Reduced Hardware 1983 32 IEEETC Bhuyan & Agrawal, Design and Performance of Generalized Interconnection Networks 1983 32 IEEETC Srinivas, Optimal Parallel Scheduling of Gaussian Elimination--DAGS 1983 32 IEEETC Thompson, The VLSI Complexity of Sorting 1983 32 IEEETC Chin & Wang, Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons 1983 32 IEEETC Kallman, A Fast 8-Bit Carry Circuit 1983 32 IEEETC Moret & Thomason & Gonzalez, Symmetric and Threshold Boolean Functions Are Exhaustive 1982 31 IEEETC Kung & Arun & Gal-Ezer & Rao, Wavefront Array Processor: Language, Architecture, and Applications 1982 31 IEEETC Irani & Chen, Minimization of Interprocessor Communication for Parallel Computation 1982 31 IEEETC Weide, Modeling Unusual Behavior of Parallel Algorithms 1982 31 IEEETC Ottmann & Rosenberg & Stockmeyer, A Dictionary Machine (for VLSI) 1982 31 IEEETC Chen, A Distributed Algorithm for Shortest Paths 1982 31 IEEETC Aleliunas & Rosenberg, On Embedding Rectangular Grids in Square Grids 1982 31 IEEETC Gerrity, Computer Representation of Real Numbers 1982 31 IEEETC Strader & Rhyne, A Canonical Bit-Sequential Multiplier 1982 31 IEEETC Dormido & Canto, An Upper Bound for the Synthesis of Generalized Parallel Counters 1980 29 IEEETC Parker, Notes on Shuffle/Exchange-Type Switching Networks 1980 IEEETC Klein & Paterson, Asymptotically Optimal Circuit for a Storage Access Function 1979 28 IEEETC Chen & Feng, Associative Processing of Network Flow Problems 1977 26 IEEETC Preparata & Muller & Barak, Reduction of Depth of Boolean Networks with a Fan-In Constraint 1976 25 IEEETC Goyal, A Note on Atrubin's Real-Time Iterative Multiplier 1975 24 IEEETC Ibarra & Sahni, Polynomially Complete Fault Detection Problems 1974 23 IEEETC Jump, Asynchronous Control Arrays 1974 23 IEEETC Kosaraju, On Some Open Problems in the Theory of Cellular Automata 1972 21 IEEETC Banerji & Brzozowski, On Translation Algorithms in Residue Number Systems 1972 21 IEEETC Jump & Fritsche, Microprogrammed Arrays 1971 20 IEEETC Hamacher, Machine Complexity Versus Interconnection Complexity in Iterative Arrays 1971 20 IEEETC Huang, A Universal Cellular Array 1969 18 IEEETC Banerji & Brzozowski, Sign Detection in Residue Number Systems 1969 18 IEEETC Even & Meyer, Sequential Boolean Equations 1969 18 IEEETC Cole, Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines 1968 17 IEEETC Kautz & Levitt & Waksman, Cellular Interconnection Arrays 1966 15 IEEETC Hennie, On-Line Turing Machine Computations 1965 14 IEEETC Atrubin, A One-Dimensional Real-Time Iterative Multiplier 1964 13 IEEETC Wallace, A Suggestion for a Fast Multiplier 1962 11 IEEETC Szabo, Sign Detection in Nonredundant Residue Systems 1962 11 IEEETC Keir & Cheney & Tannenbaum, Division and Overflow Detection in Residue Number Systems 1962 11 IEEETC Yamada, Real-Time Computation and Recursive Functions Not Real-Time Computable 1961 10 IEEETC Avizienis, Signed-Digit Number Representations for Fast Parallel Arithmetic 1959 8 IEEETC Garner, The Residue Number System 1958 7 IEEETC Robertson, A New Class of Digital Division Methods 1997 16 IEEETCAD Drechsler & Becker, Sympathy: Fast Exact Minimization of Fixed Polarity Reed-Muller Expressions for Symmetric Functions 1997 16 IEEETCAD Sun & Wang & Wong & Liu, Routing for Symmetric FPGA's and FPIC's 1997 16 IEEETCAD Thakur & Chang & Wong & Muthukrishnan, Algorithms for an FPGA Switch Module Routing Problem with Application to Global Routing 1997 16 IEEETCAD Soyata & Friedman & Mulligan, Incorporating Interconnect, Register, and Clock Distribution Delays into the Retiming Process 1996 15 IEEETCAD de Fluiter & Aarts & Korst & Verhaegh & van der Werf, The Complexity of Generalized Retiming Problems 1996 15 IEEETCAD Danda & Liu & Madhwapathy & Panyam & Sherwani & Tollis, Optimal Algorithms for Planar Over-The-Cell Routing Problems 1996 15 IEEETCAD Sauerhoff & Wegener, On the Complexity of Minimizing the OBDD Size for Incompletely Specified Functions 1996 15 IEEETCAD Hochbaum, An Optimal Test Compression Procedure for Combinational Circuits 1996 15 IEEETCAD Carden & Li & Cheng, A Global Router with a Theoretical Bound on the Optimal Solution 1996 15 IEEETCAD Chen & Lee, A Faster Algorithm for Rubber-Band Equivalent Transformation for Planar VLSI Layouts 1995 14 IEEETCAD Tetelbaum, Generalized Optimum Path Search 1995 14 IEEETCAD Becker & Drechsler & Molitor, On the Generation of Area-Time Optimal Testable Adders 1995 14 IEEETCAD Thanvantri & Sahni, Folding a Stack of Equal Width Components 1995 14 IEEETCAD Li, The Complexity of Segmented Channel Routing 1995 14 IEEETCAD Shen & Devadas & Ghosh, Probabilistic Manipulation of Boolean Functions Using Free Boolean Diagrams 1995 14 IEEETCAD Hwang & El Gamal, Min-Cut Replication in Partitioned Networks 1995 14 IEEETCAD Pan & Liu, Area Minimization for Floorplans 1994 13 IEEETCAD Griffith & Robins & Salowe & Zhang, Closing the Gap: Near-Optimal Steiner Trees in Polynomial Time 1994 13 IEEETCAD Theune & Thiele & John & Lengauer, Robust Methods for EMC-Driven Routing 1993 12 IEEETCAD Brand, Exhaustive Simulation Need Not Require an Exponential Number of Tests 1993 12 IEEETCAD Carson, On O(p^2) Algorithms for Planarization 1993 12 IEEETCAD Li & Lim & Agrawal & Sahni, On the Circuit Implementation Problem 1993 12 IEEETCAD Chakradhar & Agrawal & Rothweiler, A Transitive Closure Algorithm for Test Generation 1993 12 IEEETCAD Pomeranz & Reddy, 3-Weight Pseudo-Random Test Generation Based on a Deterministic Test Set for Combinational and Sequential Circuits 1993 12 IEEETCAD Chang, Efficient Algorithms for Wiring Channels with Moveable Terminals 1993 12 IEEETCAD Malik & Singh & Brayton & Sangiovanni-Vincentelli, Performance Optimization of Pipelined Logic Circuits Using Peripheral Retiming and Resynthesis 1993 12 IEEETCAD McFarland, Formal Verification of Sequential Hardware: A Tutorial 1993 12 IEEETCAD Dietmeyer, Generating Minimal Covers of Symmetric Functions 1992 11 IEEETCAD Haruyama & Wong & Fussell, topological Channel Routing 1992 11 IEEETCAD Hagen & Kahng, New Spectral Methods for Ratio Cut Partitioning and Clustering 1992 11 IEEETCAD Shi & Fuchs, Probabilistic Analysis and Algorithms for Reconfiguration of Memory Arrays 1992 11 IEEETCAD Kim & Kyung, Circuit Placement on Arbitrarily Shaped Regions Using the Self-Organization Principle 1992 11 IEEETCAD Muller & Kells & Fichtner, Automatic Rectangle-Based Adaptive Mesh Generation Without Obtuse Angles 1992 11 IEEETCAD McDonald & Peters, Smallest Paths in Simple Rectilinear Polygons 1992 11 IEEETCAD Heeb & Fichtner, A Module Generator Based on the PQ-Tree Algorithm 1992 11 IEEETCAD Cong & Kahng & Robins & Sarrafzadeh & Wong, Provably Good Performance-Driven Global Routing 1992 11 IEEETCAD Bonapace & Lo, An O(n log m) Algorithm for VLSI Design Rule Checking 1992 11 IEEETCAD Funabiki & Takefuji, A Parallel Algorithm for Channel Routing Problems 1991 10 IEEETCAD Devadas, Optimizing Interacting Finite State Machines Using Sequential Don't Cares 1991 10 IEEETCAD Drusinsky-Yoresh, Decision Problems for Interacting Finite State Machines 1991 10 IEEETCAD Takefuji & Lee & Cho, Comments on ``O(n^2) Algorithms for Graph Planarization'' 1991 10 IEEETCAD Tollis, A New Approach to Wiring Layouts 1991 10 IEEETCAD Pangrle, On the Complexity of Connectivity Binding 1991 10 IEEETCAD Cong & Liu, On the k-Layer Planar Subset and Topological Via Minimization Problems 1991 10 IEEETCAD Berman, Circuit Width, Register Allocation, and Ordered Binary Decision Diagrams 1991 10 IEEETCAD Chakravarty & He & Ravi, Minimum Area Layout of Series-Parallel Transistor Networks is NP-Hard 1991 10 IEEETCAD Chen & Moricz, A Delay Distribution Methodology for the Optimal Systolic Synthesis of Linear Recurrence Algorithms 1991 10 IEEETCAD Heisterman & Lengauer, The Efficient Solution of Integer Programs for Hierarchical Global Routing 1991 10 IEEETCAD Chaudhary & Robinson, Channel Routing by Sorting 1991 10 IEEETCAD Berman & Trevillyan, Global Flow Optimization in Automatic Logic Design 1991 10 IEEETCAD Cohoon & Hegde & Martin & Richards, Distributed Genetic algorithms for the Floorplan Design Problem 1991 10 IEEETCAD Saab & Rao, Combinatorial Optimization by Stochastic Evolution 1991 10 IEEETCAD Vannelli, An Adaption of the Interior Point Method for Solving the Global Routing Problem 1991 10 IEEETCAD Ho & Iyengar & Zheng, A General Greedy Channel Routing Algorithm 1991 10 IEEETCAD Yoell, A Robust Channel Router 1991 10 IEEETCAD Costa & Curatelli & Caviglia & Bisio, Symbolic Generation of Constrained Random Logic Cells 1991 10 IEEETCAD Tuan & Teo, On River Routing with Minimum Number of Jogs 1991 10 IEEETCAD Sastry & Pi, Estimating the Minimum of Partitioning and Floorplanning Problems 1990 9 IEEETCAD Ling & Bayoumi, Systolic Temporal Arithmetic: A New Formalism for Specification and Verification of Systolic Arrays 1990 9 IEEETCAD Roussel-Ragot & Dreyfus, A Problem Independent Parallel Implementation of Simulated Annealing: Models and Experiments 1989 8 IEEETCAD Hortensius & McLeod & Pries & Miller & Card, Cellular Automata-Based Pseudorandom Number Generators for Built-In Self-Test 1989 8 IEEETCAD Nair & Berman & Hauge & Yoffa, Generation of Performance Constraints for Layout 1989 8 IEEETCAD Huang & Wing, Improved Gate Matrix Layout 1989 8 IEEETCAD Sarrafzadeh & Lee, A New Approach to Topological Via Minimization 1996 44 IEEETCOMM Seo & Prucnal & Kobayashi, Generalized Multihop Shuffle Networks 1996 44 IEEETCOMM Collins, Cryptographic Redundancy and Mixing Functions 1995 43 IEEETCOMM Szymanski & Fang, Randomized Routing of Virtual Connections in Essentially Nonblocking Log N-Depth Networks 1995 43 IEEETCOMM Takishima & Wada & Murakami, Reversible Variable Length Codes 1995 43 IEEETCOMM Palazzo, A Network Flow Approach to Convolutional Codes 1995 43 IEEETCOMM Belzile & Savaria & Haccoun & Chalifoux, Bounds on the Performance of Partial Selection Networks 1995 43 IEEETCOMM Hershey & Hassan & Yarlagadda, Unconventional Cryptographic Keying Variable Management 1994 42 IEEETCOMM Awerbuch & Kutten & Peleg, On Buffer-Economical Store-and-Forward Deadlock Prevention 1994 42 IEEETCOMM Chien & Oruc, High Performance Concentrators and Superconcentrators Using Multiplexing Schemes 1994 42 IEEETCOMM Stamoulis & Tsitsiklis, The Efficiency of Greedy Routing in Hypercubes and Butterflies 1994 42 IEEETCOMM Shyy & Lea, Rearrangeable Nonblocking Log_{2^d}(N,m,p) Networks 1994 42 IEEETCOMM Jia & Benyamin-Seeyar & Le-Ngoc, On the Capability of (T,U) Permutation Decoding Method 1994 42 IEEETCOMM Liew & Lee, N log N Dual Shuffle-Exchange Network with Error-Correcting Routing 1994 42 IEEETCOMM Narasimha, A Recursive Concentrator Structure with Applications to Self-Routing Switching Networks 1994 42 IEEETCOMM Zheng & Shin, On the Ability of Establishing Real-Time Channels in Point-to-Point Packet-Switched Networks 1994 42 IEEETCOMM Moayeri, On The Memory Sharing Problem 1994 42 IEEETCOMM Qu & Wang & Yang, NP-Completeness and Integer Programming Model for Station Permutation in Performance Optimization of Ring LANs 1994 42 IEEETCOMM Lakshman & Bagchi & Rastani, A Graph-Coloring Scheme for Scheduling Cell Transmissions and Its Photonic Implementation 1994 42 IEEETCOMM Baratz & Gopal & Segall, Fault Tolerant Queries in Computer Networks 1994 42 IEEETCOMM Wieselthier & Barnhart & Ephremides, A Neural Network Approach to Routing Without Interference in Multihop Radio Networks 1993 41 IEEETCOMM Dotson & Norwood & Taylor, Reliability Polynomial for a Ring Network 1993 41 IEEETCOMM Funabiki & Takefuji, A Parallel Algorithm for Broadcast Scheduling Problems in Packet Radio Networks 1993 41 IEEETCOMM Lu & Gough, A Fast-Adaptive Huffman Coding Algorithm 1993 41 IEEETCOMM Lea, A Multicast Broadband Packet Switch 1993 41 IEEETCOMM Shor & Robertazzi, Traffic Sensitive Algorithms and Performance Measures for the Generation of Self-Organizing Radio Network Schedules 1993 41 IEEETCOMM Greenberg & Goodman, Sharp Approximate Models of Deflection Routing in Mesh Networks 1992 40 IEEETCOMM Torrieri, Algorithms for Finding an Optimal Set of Short Disjoint Paths in a Communication Network 1992 40 IEEETCOMM Gavish & Neuman, Routing in a Network with Unreliable Components 1992 40 IEEETCOMM Greenberg & Hajek, Deflection Routing in Hypercube Networks 1992 40 IEEETCOMM Acampora & Shah, Multihop Lightwave Networks: A Comparison of Store-and-Forward and Hot-Potato Routing 1992 40 IEEETCOMM Lee, Design and Analysis of a New Self-Routing Network 1991 39 IEEETCOMM Melen, A General Class of Rearrangeable Interconnection Networks 1991 39 IEEETCOMM Shyy & Lea, Log_2 (N,m,P) Strictly Nonblocking Networks 1991 39 IEEETCOMM Stassinopoulos & Kazantzakis, A Computationally Efficient Iterative Solution of the Multidestination Optimal Dynamic Routing Problem 1991 39 IEEETCOMM Wang & Browning, An Optimal Distributed Routing Algorithm 1990 38 IEEETCOMM Moffat, Implementing the PPM Data Compression Scheme 1990 38 IEEETCOMM Boesch & Suffel & Satyanarayana, Least Reliable Networks and the Reliability Domination 1989 37 IEEETCOMM Gersht & Shulman, Optimal Routing in Circuit Switched Communications Networks 1989 37 IEEETCOMM Ross & Tsang, The Stochastic Knapsack Problem 1989 37 IEEETCOMM Ramabadran & Cohn, An Adaptive Algorithm for the Compression of Computer Data 1988 36 IEEETCOMM Varma & Raghavendra, Rearrangeability of Multistage Shuffle/Exchange Networks 1988 36 IEEETCOMM Narasimha, The Batcher-Banyon Self-Routing Network: Universality and Simplification 1996 43 IEEETCS Wang & Abd-El-Barr, A New Algorithm for RNS Decoding 1996 43 IEEETCS Lutz & Jayasimha, Programmable Modulo-K Counters 1996 43 IEEETCS Nagendra & Irwin & Owens, Area-Time-Power Tradeoffs in Parallel Adders 1996 43 IEEETCS Bruguera & Lang, Implementation of the FFT Butterfly with Redundant Arithmetic 1996 43 IEEETCS Yen & Michel, Unlearning Algorithm In Associative Memory 1996 43 IEEETCS Passos & Sha, Synchronous Circuit Optimization via Multidimensional Retiming 1996 43 IEEETCS Russo & Russo, A Novel Class of Sorting Networks 1996 43 IEEETCS Blair, Low Cost Sorting Circuit for VLSI 1996 43 IEEETCS Crounse & Chua, The CNN Universal Machine is as Universal as a Turing Machine 1995 42 IEEETCS Varkonyi-Koczy, A Recursive Fast Fourier Transformation Algorithm 1995 42 IEEETCS Dimitrov & Cooklev, Hybrid Algorithm for the Computation of the Matrix Polynomial I + A + ... + A^{N-1} 1994 41 IEEETCS Hamdi, A Class of Recursive Interconnection Networks: Architectural Characteristics and Hardware Cost 1994 41 IEEETCS Jeong & Burleson, VLSI Array Synthesis for Polynomial GCD Computation and Application to Finite Field Division 1994 41 IEEETCS Vinnakota & Rao, Fast Conversion Techniques for Binary-Residue Number Systems 1994 41 IEEETCS Lin & Krishna & Krishna, Rings, Fields, the Chinese Remainder Theorem and an Extension--Part I: Theory 1994 41 IEEETCS Lin & Krishna & Krishna, Rings, Fields, the Chinese Remainder Theorem and an Extension--Part II: Applications to Digital Signal Processing 1994 41 IEEETCS Sundararajan & Ahmad & Swamy, A Fast FFT Bit-Reversal Algorithm 1994 41 IEEETCS Efstathiou & Nikolos & Kalamatianos, Area-Time Efficient Modulo 2^n - 1 Adder Design 1994 41 IEEETCS Latifi, Design of Bounded-Degree Circuits for Parallel Processing 1994 41 IEEETCS Ramanathan & Dupont & Shin, Clock Distribution in General VLSI Circuits 1994 41 IEEETCS Boriakoff, FFT Computation with Systolic Arrays--A New Architecture 1994 41 IEEETCS Dimitrov & Donevsky, A Limited Disproof to the Conjecture of Evaluating the Matrix Polynomial I + A + A^2 + ... + A^{N-1} 1994 41 IEEETCS Grover, A New Method for Clock Distribution 1993 40 IEEETCS Stouraitis & Kim & Skavantzos, Full Adder-Based Arithmetic Units for Finite Integer Rings 1993 40 IEEETCS Chua & Roska & Venetianer, The CNN is Universal as the Turing Machine 1992 39 IEEETCS Yamada, A New Formulation of the Quadratic Assignment Problem on an r-Dimensional Grid 1992 39 IEEETCS Johnson, Conflict Free Memory Addressing for Dedicated FFT Hardware 1992 39 IEEETCS Sherwani & Wu & Sarrafzadeh, Algorithms for Minimum-Bend Single Row Routing Problem 1992 39 IEEETCS Weinberg, On the Generation of d-Ordered Sets: A Proof Based on Determinant Theory 1990 39 IEEETCS Bernstein & Lieberman, Secure Random Number Generation Using Chaotic Circuits 1990 39 IEEETCS Chen & Shin & Kandlur, Addressing, Routing, and Broadcasting in Hexagonal Mesh Multiprocessors 1990 39 IEEETCS Blough & Masson, Performance Analysis of a Generalized Concurrent Error Detection Procedure 1990 39 IEEETCS Cheung & Sohi & Saluja & Pradhan, Design and Analysis of a Gracefully Degrading Interleaved Memory System 1990 39 IEEETCS Parhami, Generalized Signed-Digit Number Systems: A Unifying Framework for Redundant Number Representations 1990 39 IEEETCS Masuda & Nakajima & Kashiwabara & Fujisawa, Crossing Minimization in Linear Embeddings of Graphs 1990 39 IEEETCS Srikant, Parallel Parsing of Arithmetic Expressions 1990 39 IEEETCS Heidelberger & Norton & Robinson, Parallel Quicksort Using Fetch-and-Add 1990 39 IEEETCS Won & Sahni & El-Ziq, A Hardware Accelerator for Maze Routing 1990 39 IEEETCS Aravena, Recursive Moving Window DFT Algorithm 1989 38 IEEETCS Kumar & Reibman, Failure Dependent Performance Analysis of a Fault-Tolerant Multistage Interconnection Network 1989 36 IEEETCS Wennmyr, A Convex-Hull Algorithm for Neural Networks 1989 36 IEEETCS Pitas, Fast Algorithms for Running Ordering and Max/Min Calculation 1989 36 IEEETCS Brady & Raghavan & Slawny, Back Propagation Fails to Separate Where Perceptrons Succeed 1989 36 IEEETCS Kam & Cheng & Guez, Pattern Retrieval and Learning in Nets of Asynchronous Binary Threshold Elements 1989 36 IEEETCS Xiong & Kuh, A Unified Approach to the Via Minimization Problem 1989 36 IEEETCS Jaykumar & Thulasiraman & Swamy, MOD-CHAR: An Implementation of Char's Spanning Tree Enumeration Algorithm and Its Complexity Analysis 1989 36 IEEETCS Opatrny & Srinivasan & Alagar, Highly Fault Tolerant Communication Network Models 1989 36 IEEETCS Beraldin & Aboulnasr & Steenaart, Efficient One-Dimensional Systolic Array Realization of the Discrete Fourier Transform 1988 35 IEEETCS Chua & Yang, Cellular Neural Networks: Theory 1988 35 IEEETCS Chua & Yang, Cellular Neural Networks: Applications 1988 35 IEEETCS Wimer & Koren & Cederbaum, Floor Plans, Planar Graphs, and Layouts 1988 35 IEEETCS Lengauer & Muller, Linear Algorithms for Optimizing the Layout of Dynamic CMOS Cells 1988 35 IEEETCS Weis & Mylnski, A Graphtheoretic Approach to the Relative Placement Problem 1988 35 IEEETCS Suaris & Kedem, An Algorithm for Quadrisection and Its Application to Standard Cell Placement 1988 35 IEEETCS Ja'Ja' & Kosaraju, Parallel Algorithms for Planar Graph Isomorphism and Related Problems 1988 35 IEEETCS Das & Deo, Divide-and-Conquer-Based Optimal Parallel Algorithms for Some Graph Problems on EREW PRAM Model 1988 35 IEEETCS Frederickson & Hambrusch, Planar Linear Arrangements of Outerplanar Graphs 1988 35 IEEETCS Jayakumar & Thulasiraman & Swamy, Planar Embedding: Linear-Time Algorithms for Vertex Placement and Edge Ordering 1988 35 IEEETCS Nakano & Nishizeki & Saito, On the f-Coloring of Multigraphs 1988 35 IEEETCS El-Mallah & Colbourn, The Complexity of Some Edge Deletion Problems 1983 30 IEEETCS Soderstrand & Vernia & Chang, An Improved Residue Number System Digital-to-Analog Converter 1997 40 IEEETE Youssefi & Zemoudeh, Course in Parallel Processing 1996 39 IEEETE Sarwar & Parks & Sarwar, Laboratory Exercises for Practical Performance of Algorithms and Data Structures 1996 39 IEEETE Skaar & Brown, Emphasizing Some Little-Used Theorems in Introductory Network Analysis 1996 39 IEEETE Chedid & Mogi, A Simple Iterative Algorithm for the Towers of Hanoi Problem 1996 39 IEEETE Pierre, A Novel Method for Calculating the Convolution Sum of Two Finite Length Sequences 1995 38 IEEETE Armstrong, The Imperfect Solutions Homework Format 1995 38 IEEETE Huang, An Enhanced Computer Networks Course 1995 38 IEEETE Ohlsson & Johansson, A Practice Driven Approach to Software Engineering Education 1995 38 IEEETE Echauz & Vachtsevanos, Fuzzy Grading System 1994 37 IEEETE Loui, Computer Engineering at the University of Illinois at Urbana-Champaign 1994 37 IEEETE Aspnes, A Summary and Analysis of Bachelor of Science Degree Requirements Reported by 125 Electrical Engineering Departments 1994 37 IEEETE Orr & Eisenstein, Summary of Innovations in Electrical Engineering Curricula 1994 37 IEEETE Soderstrand, The New Electrical and Computer Engineering Curricula at University of California-Davis 1994 37 IEEETE Smith, University of Toronto Curricula in Electrical and Computer Engineering 1994 37 IEEETE Bronzino & Ahlgren & Chung & Mertens & Palladino, Design and Teamwork: A Must for Freshmen 1993 36 IEEETE Dattatreya, A Systematic Approach to Teaching Binary Arithmetic in a First Course 1993 36 IEEETE Garcia & Perez & Silverman, On Teaching AI and Expert Systems Courses 1993 36 IEEETE Vannelli, Teaching Large-Scale Optimization by an Interior Point Approach 1993 36 IEEETE Hintz, Introducing Undergraduates to Parallel Processing 1992 35 IEEETE Svoboda, Using Spreadsheets in Introductory EE Courses 1992 35 IEEETE Gurwitz, On Teaching Median-Finding Algorithms 1991 34 IEEETE Marbury & Barnes & Lawsine & Nicholson, A One Room Schoolhouse Plan for Engineering Education 1990 33 IEEETE van den Bos, The Discrete Fourier Transform Data Sequence Need Not Be Circularly Defined 1988 31 IEEETE Hamblen & Parker, An Updated PC-Based Assembly Language Programming Laboratory 1988 31 IEEETE Loui, The Case for Assembly Language Programming 1988 31 IEEETE Katz & Warner, Writing as a Tool for Learning 1996 4 IEEETFS Zadeh, Fuzzy Logic = Computing with Words 1994 2 IEEETFS Laviolette & Seaman, The Efficacy of Fuzzy Representation of Uncertainty 1994 2 IEEETFS Dubois & Prade, Fuzzy Sets--A Convenient Fiction for Modeling Vagueness and Possibility 1994 2 IEEETFS Hisdal, Interpretative Versus Prescriptive Fuzzy Set Theory 1994 2 IEEETFS Klir, On the Alleged Superiority of Probabilistic Representation of Uncertainty 1994 2 IEEETFS Kosko, The Probability Monopoly 1994 2 IEEETFS Wilson, Vagueness and Beyesian Probability 1994 2 IEEETFS Lindley, Comments on ``The Efficacy of Fuzzy Representations of Uncertainty'' 1994 2 IEEETFS Laviolette & Seaman, Unity and Diversity of Fuzziness--From a Probability Viewpoint 1994 2 IEEETFS Woodall & Davis, Comments on ``Editorial: Fuzzy Models--What Are They and Why?'' 1994 2 IEEETFS Bezdek, The Thirsty Traveler Visits Gamont: A Rejoinder to ``Comments on Fuzzy Sets -- What are They and Why?'' 1993 1 IEEETFS Grim, Self-Reference and Chaos in Fuzzy Logic 1997 6 IEEETIP Robinson, Efficient General-Purpose Image Compression with Binary Tree Predictive Coding 1997 6 IEEETIP Shanbehzadeh & Ogunbona, On the Computational Complexity of the LBG and PNN Algorithms 1997 43 IEEETIT Han & Hoshi, Interval Algorithm for Random Number Generation 1997 43 IEEETIT Ahlswede & Han & Kobayashi, Universal Coding of Integers and Unbounded Search Trees 1997 43 IEEETIT Titchener, The Synchronization of Variable-Length Codes 1997 43 IEEETIT Hwang, Optimal Algorithms for Inserting a Random Element into a Random Heap 1997 43 IEEETIT Dumer, Correction to ``Suboptimal Decoding of Linear Codes: Partition Technique'' 1997 43 IEEETIT Louchard & Szpankowski, On the Average Redundancy Rate of the Lempel-Ziv Code 1997 43 IEEETIT Savari, Redundancy of the Lempel-Ziv Incremental Parsing Rule 1996 42 IEEETIT Feigenbaum & Forney & Marcus & McEliece & Vardy, Introduction to the Special Issue on Codes and Complexity 1996 42 IEEETIT Loeliger & Mittelholzer, Convolutional Codes Over Groups 1996 42 IEEETIT Kiely & Dolinar & McEliece & Ekroot & Lin, Trellis Decoding Complexity of Linear Block Codes 1996 42 IEEETIT Perez & Seghers & Costello, A Distance Spectrum Interpretation of Turbo Codes 1996 42 IEEETIT Sipser & Spielman, Expander Codes 1996 42 IEEETIT Spielman, Linear-Time Encodable and Decodable Error-Correcting Codes 1996 42 IEEETIT Alon & Luby, A Linear Time Erasure-Resilient Code with Nearly Optimal Recovery 1996 42 IEEETIT Albanese & Blomer & Edmonds & Luby & Sudan, Priority Encoding Transmission 1996 42 IEEETIT Schulman, Coding for Interactive Communication 1996 42 IEEETIT Stern, A New Paradigm for Public Key Identification 1996 42 IEEETIT Brassard & Crepeau & Santha, Oblivious Transfers and Intersecting Codes 1996 42 IEEETIT Bellare & Coppersmith & Hastad & Kiwi & Sudan, Linearity Testing in Characteristic Two 1996 42 IEEETIT Cohen & Litsyn & Zemor, On Greedy Algorithms in Coding Theory 1996 42 IEEETIT Bruck & Ho, Fault-Tolerant Cube Graphs and Coding Theory 1996 42 IEEETIT Alon & Orlitsky, Source Coding and Graph Entropies 1996 42 IEEETIT Gavish & Lempel, Match-Length Functions for Data Compression 1996 42 IEEETIT Mitchell & Etzion & Paterson, A Method for Constructing Decodable de Bruijn Sequences 1996 42 IEEETIT DasGupta & Sontag, Sample Complexity for Learning Recurrent Perceptron Mappings 1996 42 IEEETIT Abrahams, Generation of Discrete Distributions from Biased Coins 1996 42 IEEETIT Cohen & Litsyn & Zemor, On the Traveling Salesman Problem in Binary Hamming Spaces 1996 42 IEEETIT Berlekamp, Bounded Distance + 1 Soft-Decision Reed-Solomon Decoding 1996 42 IEEETIT Kotter, Fast Generalized Minimum-Distance Decoding of Linear Block Codes Based on Ordered Statistics 1996 42 IEEETIT Tallini & Capocelli & Bose, Design of Some New Efficient Balanced Codes 1996 42 IEEETIT Zhang & Wei, An On-line Universal Lossy Data Compression Algorithm via Continuous Codebook Refinement--Part I: Basic Results 1996 42 IEEETIT Zhang & Yang, An On-line Universal Lossy Data Compression Algorithm via Continuous Codebook Refinement--Part II: Optimality for Phi-Mixing Source Models 1996 42 IEEETIT Goldsmith & Varaiya, Capacity, Mutual Information, and Coding for Finite-State Markov Channels 1996 42 IEEETIT Gillman & Mohtashemi & Rivest, On Breaking a Huffman Code 1996 42 IEEETIT Kato & Han & Nagaoka, Huffman Coding with an Infinite Alphabet 1996 42 IEEETIT Lam & Kulkarni, Extended Synchronizing Codewords for Binary Prefix Codes 1996 42 IEEETIT Levy-dit-Vehel & Litsyn, More on the Covering Radius of BCH Codes 1996 42 IEEETIT Wyner & Ziv, Classification with Finite Memory 1996 42 IEEETIT Roth & Seroussi, Location-Correcting Codes 1996 42 IEEETIT Kabatianskii & Smeets & Johansson, On the Cardinality of Systematic Authentication Codes 1996 42 IEEETIT Balakirsky, Hashing of Databases Based on Indirect Observations of Hamming Distances 1996 42 IEEETIT Kumar, review of Stichtenoth, Algebraic Function Fields and Codes (Springer-Verlag, 1993) 1996 42 IEEETIT Anantharam & Verdu, Bits Through Queues 1996 42 IEEETIT Beimel & Chor, Communication in Key Distribution Schemes 1996 42 IEEETIT Kieffer & Yang, Sequential Codes, Lossless Compression of Individual Sequences, and Kolmogorov Complexity 1996 42 IEEETIT Rissanen, Fisher Information and Stochastic Complexity 1996 42 IEEETIT Lugosi & Zeger, Concept Learning Using Complexity Regularization 1996 42 IEEETIT Arikan, An Inequality on Guessing and its Application to Sequential Decoding 1996 42 IEEETIT Viterbo & Biglieri, Computing the Voronoi Cell of a Lattice: The Diamond-Cutting Algorithm 1996 42 IEEETIT Vardy & Blaum & Siegel & Sincerbox, Conservative Arrays: Multidimensional Modulation Codes for Holographic Recording 1996 42 IEEETIT Yang & Kieffer, Simple Universal Lossy Data Compression Schemes Derived from the Lempel-Ziv Algorithm 1996 42 IEEETIT Wille, New Binary Covering Codes Obtained by Simulated Annealing 1996 42 IEEETIT Agrell, Voronoi Regions for Binary Linear Block Codes 1995 41 IEEETIT Hoholdt & Pellikaan, On the Decoding of Algebraic-Geometric Codes 1995 41 IEEETIT Hache & Le Brigand, Effective Construction of Algebraic Geometry Codes 1995 41 IEEETIT Sakata & Justesen & Madelung & Jensen & Hoholdt, Fast Decoding of Algebraic-Geometric Codes up to the Designed Minimum Distance 1995 41 IEEETIT Shen & Tzeng, Decoding Geometric Goppa Codes up to Designed Minimum Distance by Solving a Key Equation in a Ring 1995 41 IEEETIT Shen & Tzeng, Generation of Matrices for Determining Minimum Distance and Decoding of Algebraic-Geometric Codes 1995 41 IEEETIT Saints & Heegard, Algebraic-Geometric Codes and Multidimensional Cyclic Codes: A Unified Theory and Algorithms for Decoding Using Grobner Bases 1995 41 IEEETIT Bennett & Brassard & Crepeau & Maurer, Generalized Privacy Amplification 1995 41 IEEETIT Park, The Entropy of Consecutive Order Statistics 1995 41 IEEETIT Yamamoto & Itoh, Competitive Optimality of Source Codes 1995 41 IEEETIT Alon & Orlitsky, Repeated Communication and Ramsey Graphs 1995 41 IEEETIT Levenshtein, Krawtchouk Polynomials and Universal Bounds for Codes and Designs in Hamming Spaces 1995 41 IEEETIT Vembu & Verdu, Generating Random Bits from an Arbitrary Source: Fundamental Limits 1995 41 IEEETIT Kalai & Linial, On the Distance Distribution of Codes 1995 41 IEEETIT Krasikov & Litsyn, On the Accuracy of the Binomial Approximation to the Distance Distribution of Codes 1995 41 IEEETIT Khandani & Kabal & Dubois, Computing the Weight Distribution of a Set of Points Obtained by Scaling, Shifting, and Truncating a Lattice 1995 41 IEEETIT McLaughlin & Luo & Xie, On the Capacity of M-ary Runlength-Limited Codes 1995 41 IEEETIT Dabiri & Blake, Fast Parallel Algorithms for Decoding Reed-Solomon Codes Based on Remainder Polynomials 1995 41 IEEETIT Ahlswede & Zhang, New Directions in the Theory of Identification via Channels 1995 41 IEEETIT Ke & Marcellin, A New Construction for n-Track (d,k) Codes with Redundancy 1995 41 IEEETIT Cusick, Properties of the x^2 mod N Pseudorandom Number Generator 1995 41 IEEETIT Gulliver, New Optimal Ternary Linear Codes 1995 41 IEEETIT Urbanke & Agrawal, A Counterexample to a Voronoi Region Conjecture 1995 41 IEEETIT Willems & Shtarkov & Tjalkens, The Context-Tree Weighting Method: Basic Properties 1995 41 IEEETIT Wyner & Wyner, Improved Redundancy of a Version of the Lempel-Ziv Algorithm 1995 41 IEEETIT Soljanin & Georghiades, Coding for Two-Head Recording Systems 1995 41 IEEETIT Cidon & Gopal & Kutten, New Models and Algorithms for Future Networks 1995 41 IEEETIT Zemor & Cohen, The Threshold Probability of a Code 1995 41 IEEETIT Louchard & Szpankowski, Average Profile and Limiting Distribution for a Phrase Size in the Lempel-Ziv Parsing Algorithm 1995 41 IEEETIT Blundo & De Santis, New Bounds on the Information Rate of Secret Sharing Schemes 1995 41 IEEETIT Lafourcade & Vardy, Asymptotically Good Codes Have Infinite Trellis Complexity 1995 41 IEEETIT Ytrehus, On the Trellis Complexity of Certain Binary Linear Block Codes 1995 41 IEEETIT Dettmar & Sorger, Bounded Minimum Distance Decoding of Unit Memory Codes 1995 41 IEEETIT Gilbert, Coding with Digits of Unequal Cost 1995 41 IEEETIT Csiszar, Generalized Cutoff Rates and Renyi's Information Measures 1995 41 IEEETIT Kiely & Coffey & Bell, Optimal Information Bit Decoding of Linear Block Codes 1995 41 IEEETIT Sole, Packing Radius, Covering Radius, and Dual Distance 1995 41 IEEETIT Campbell, Averaging Entropy 1994 40 IEEETIT Ericson & Levenshtein, Superimposed Codes in the Hamming Space 1994 40 IEEETIT Linder & Zamir, On the Asymptotic Tightness of the Shannon Lower Bound 1994 40 IEEETIT Ahlswede & Cai, On Communication Complexity of Vector-Valued Functions 1994 40 IEEETIT Loeliger, An Upper Bound on the Volume of Discrete Spheres 1994 40 IEEETIT Rajan & Siddiqi, A Generalized DFT for Abelian Codes Over Z_m 1994 40 IEEETIT Cohen & Litsyn & Zemor, Upper Bounds on Generalized Distances 1994 40 IEEETIT Feng & Tzeng, A New Procedure for Decoding Cyclic and BCH Codes up to Actual Minimum Distance 1994 40 IEEETIT Struik, On the Structure of Linear Codes with Covering Radius Two and Three 1994 40 IEEETIT Vater, Binary Coding by Integration of Polynomials 1994 40 IEEETIT Hall & Patil, On the Efficiency of On-Line Density Estimators 1994 40 IEEETIT Luo & Tsitsiklis, Data Fusion with Minimal Communication 1994 40 IEEETIT Johansson, Lower Bounds on the Probability of Deception in Authentication with Arbitration 1994 40 IEEETIT Smeets, Bounds on the Probability of Deception in Multiple Authentication 1994 40 IEEETIT Zeger & Gersho, Number of Nearest Neighbors in a Euclidean Code 1994 40 IEEETIT Chen & Reed & Helleseth & Truong, Use of Grobner Bases to Decode Binary Cyclic Codes up to the True Minimum Distance 1994 40 IEEETIT Chen & Reed & Helleseth & Truong, General Principles for the Algebraic Decoding of Cyclic Codes 1994 40 IEEETIT Alon & Orlitsky, A Lower Bound on the Expected Length of One-to-One Codes 1994 40 IEEETIT Litsyn & Vardy, The Uniqueness of the Best Code 1994 40 IEEETIT Blackburn, A Generalization of the Discrete Fourier Transform: Determining the Minimal Polynomial of a Periodic Sequence 1994 40 IEEETIT Feng & Wei & Rao & Tzeng, Simplified Understanding and Efficient Decoding of a Class of Algebraic-Geometric Codes 1994 40 IEEETIT Feng & Rao, A Simple Approach for Construction of Algebraic-Geometric Codes from Affine Plane Curves 1994 40 IEEETIT Fornasini & Valcher, Algebraic Aspects of Two-Dimensional Convolutional Codes 1994 40 IEEETIT Li & Chen, New Lower Bounds for Binary Covering Codes 1994 40 IEEETIT Qian & Gabor & Gupta, On Stochastic Complexity Estimation: A Decision-Theoretic Approach 1994 40 IEEETIT Arikan, An Upper Bound on the Zero-Error Capacity of the Input-Constrained Bit-Shift Channel 1994 40 IEEETIT Cover & Zhang, On the Maximum Entropy of the Sum of Two Dependent Random Variables 1994 40 IEEETIT Schack, The Length of a Typical Huffman Codeword 1994 40 IEEETIT Capocelli & De Santis & Persiano, Binary Prefix Codes Ending in a ``1'' 1994 40 IEEETIT Bar-David & Plotnik & Rom, Limitations on the Capacity of the M-User Binary Adder Channel Due to Physical Considerations 1994 40 IEEETIT Ahlswede & Zhang, On Multiuser Write-Efficient Memories 1994 40 IEEETIT Korner & Lucertini, Compressing Inconsistent Data 1994 40 IEEETIT Jeavons & Cohen & Shawe-Taylor, Generating Binary Sequences for Stochastic Computing 1994 40 IEEETIT Paterson, Perfect Maps 1994 40 IEEETIT Etzion & Vardy, Perfect Binary Codes: Constructions, Properties, and Enumeration 1994 40 IEEETIT Beimel & Chor, Universally Ideal Secret Sharing Schemes 1994 40 IEEETIT Kouritzin, On Almost-Sure Bounds for the LMS Algorithm 1994 40 IEEETIT Weinberger & Merhav & Feder, Optimal Sequential Probability Assignment for Individual Sequences 1994 40 IEEETIT Roychowdhury & Orlitsky & Siu, Lower Bounds on Threshold and Related Circuits via Communication Complexity 1994 40 IEEETIT Klapper & Goresky, Partial Period Autocorrelations of Geometric Sequences 1994 40 IEEETIT Abrahams, Parallelized Huffman and Hu-Tucker Searching 1994 40 IEEETIT Groneick & Grosse, New Binary Codes 1994 40 IEEETIT Gavish & Lempel, On Ternary Complementary Sequences 1994 40 IEEETIT Wei & Feng, Improved Lower Bounds on the Sizes of Error-Correcting Codes for List Decoding 1994 40 IEEETIT Gacs & Gal, Lower Bounds for the Complexity of Reliable Boolean Circuits with Noisy Gates 1994 40 IEEETIT Carlet & Seberry & Zhang, Comments on ``Generating and Counting Binary Bent Sequences'' 1994 40 IEEETIT Chen & Papamarcou, Correction to ``New Asymptotic Results in Parallel Distributed Detection'' 1994 40 IEEETIT Zhang & Xia, Three Messages are not Optimal in Worst Case Interactive Communications 1994 40 IEEETIT Ryabko, Fast and Efficient Coding of Information Sources 1994 40 IEEETIT Savari & Gallager, Arithmetic Coding for Finite-State Noiseless Channels 1994 40 IEEETIT Stinson, Decomposition Constructions for Secret-Sharing Schemes 1994 40 IEEETIT Oh & Metzner, Performance of a General Decoding Technique Over the Class of Randomly Chosen Parity Check Codes 1994 40 IEEETIT Huber, Codes Over Gaussian Integers 1994 40 IEEETIT Teuhola & Raita, Arithmetic Coding into Fixed-Length Codewords 1994 40 IEEETIT Dahl, Fast Decoding of Codes from Algebraic Curves 1994 40 IEEETIT Rimoldi, Successive Refinement of Information: Characterization of the Acievable Rates 1994 40 IEEETIT Feder & Merhav, Relations Between Entropy and Error Probability 1994 40 IEEETIT Gyorfi & Pali & van der Meulen, There is no Universal Source Code for an Infinite Source Alphabet 1994 40 IEEETIT Li & Deng & Wang, On the Equivalence of McEliece's and Niederreiter's Public-Key Cryptosystems 1994 40 IEEETIT Koppelman & Oruc, The Complexity of Routing in Clos Permutation Networks 1994 40 IEEETIT Feder & Gutman & Merhav, Correction to ``Universal Prediction of Individual Sequences'' 1994 40 IEEETIT Cover, review of Zurek, Complexity, Entropy and the Physics of Information 1994 40 IEEETIT Blake, review of Anederson & Mohan, Source and Channel Coding: An Algorithmic Approach 1993 39 IEEETIT Kieffer, A Survey of the Theory of Source Coding with a Fidelity Criterion 1993 39 IEEETIT Boncelet, Block Arithmetic Coding for Source Compression 1993 39 IEEETIT Naor & Orlitsky & Shor, Three Results on Interactive Communication 1993 39 IEEETIT Menezes & Okamoto & Vanstone, Reducing Elliptic Curve Logarithms to Logarithms in a Finite Field 1993 39 IEEETIT Szpankowski, Asymptotic Properties of Data Compression and Suffix Trees 1993 39 IEEETIT Lin & Liu, Structure and Properties of Linear Recurring m-Arrays 1993 39 IEEETIT Viswanathan, A Note on Distributed Estimation and Sufficiency 1993 39 IEEETIT Morita & Kobayashi, On Asymptotic Optimality of a Sliding Window Variation of Lempel-Ziv Codes 1993 39 IEEETIT Chen & Papamarcou, New Asymptotic Results in Parallel Distributed Detection 1993 39 IEEETIT Bar-Noy & Kessler, Tracking Mobile Users in Wireless Communications Networks 1993 39 IEEETIT Bar-Yehuda & Chor & Kushilevitz & Orlitsky, Privacy, Additional Information, and Communication 1993 39 IEEETIT Honig, Channel Shaping to Maximize Minimum Distance 1993 39 IEEETIT van Zanten, Minimal-Change Order and Separability in Linear Codes 1993 39 IEEETIT Ahlswede & Csiszar, Common Randomness in Information Theory and Cryptography--Part I: Secret Sharing 1993 39 IEEETIT Buhmann & Kuhnel, Vector Quantization with Complexity Costs 1993 39 IEEETIT Sole & Stokes, Covering Radius, Codimension, and Dual-Distance Width 1993 39 IEEETIT Hart & Bouloutas, Correcting Dependent Errors in Sequences Generated by Finite-State Processes 1993 39 IEEETIT Ziv & Merhav, A Measure of Relative Entropy Between Individual Sequences with Application to Universal Classification 1993 39 IEEETIT Merhav & Feder, Universal Schemes for Sequential Decision from Individual Data Sequences 1993 39 IEEETIT Neeser & Massey, Proper Complex Random Processes with Applications to Information Theory 1993 39 IEEETIT Stamp & Martin, An Algorithm for the k-Error Linear Complexity of Binary Sequences with Period 2^n 1993 39 IEEETIT Politis, Nonparametric Maximum Entropy 1993 39 IEEETIT Ahlswede & Bassalygo & Pinsker, Nonbinary Codes Correcting Localized Errors 1993 39 IEEETIT Ahlswede, The Maximal Error Capacity of Arbitrarily Varying Channels for Constant List Sizes 1993 39 IEEETIT van Wee, Some New Lower Bounds for Binary and Ternary Covering Codes 1993 39 IEEETIT Hollmann, A Relation Between Levenshtein-Type Distances and Insertion-and-Deletion Correcting Capabilities of Codes 1993 39 IEEETIT Etzion & Greenberg & Honkala, Normal and Abnormal Codes 1993 39 IEEETIT Jacquet, Random Infinite Trees and Supercritical Behavior of Collision Resolution Algorithms 1993 39 IEEETIT Equitz & Cover, Addendum to ``Successive Refinement of Information'' 1993 39 IEEETIT Maurer, Secret Key Agreement by Public Discussion from Common Information 1993 39 IEEETIT Sorger, A New Reed-Solomon Code Decoding Algorithm Based on Newton's Interpolation 1993 39 IEEETIT Kalvalerchik, A New Model of Numerical Computer Data and Its Application for Construction of Minimum-Redundancy Codes 1993 39 IEEETIT Ogier & Rutenburg & Shacham, Distributed Algorithms for Computing Shortest Pairs of Disjoint Paths 1993 39 IEEETIT Shields, Universal Redundancy Rates Do Not Exist 1993 39 IEEETIT Hu & Venkatesh, On the Minimum Expected Duration of a Coin Tossing Game 1993 39 IEEETIT Kawabata, Exact Analysis of the Lempel-Ziv Algorithm for I. I. D. Sources 1993 39 IEEETIT Linebarger & Sudborough & Tollis, Difference Bases and Sparse Sensor Arrays 1993 39 IEEETIT Ornstein & Weiss, Entropy and Data Compression Schemes 1993 39 IEEETIT Hajek & Cruz, On the Average Delay for Routing Subject to Independent Deflections 1993 39 IEEETIT Birk & Linial & Meshulam, On the Uniform-Traffic Capacity of Single-Hop Interconnections Employing Shared Directional Multichannels 1993 39 IEEETIT Kessler & Sidi, Growing Binary Trees in a Random Environment 1993 39 IEEETIT Bucklew & Sadowsky, A Contribution to the Theory of Chernoff Bounds 1993 39 IEEETIT Hong & Vetterli, Computing m DFT's Over GF(q) with One DFT Over GF(q^m) 1993 39 IEEETIT Willems, review of Cover & Thomas, Elements of Information Theory (Wiley, 1991) 1993 39 IEEETIT Siegel, review of McEliece, Finite Fields for Computer Scientists and Engineers (Kluwer, 1987) 1992 38 IEEETIT Baram & Sal'ee, Lower Bounds on the Capacities of Binary and Ternary Networks Storing Sparse Random Vectors 1992 38 IEEETIT Chao & McEliece & Swanson & Rodemich, Performance of Binary Block Codes at Low Signal-to-Noise Ratios 1992 38 IEEETIT Retter, Gaps in the Binary Weight Distributions of Reed-Solomon Codes 1992 38 IEEETIT Csiszar, Arbitrarily Varying Channels with General Alphabets and States 1992 38 IEEETIT Daskalov & Kapralov, New Minimum Distance Bounds for Certain Binary Linear Codes 1992 38 IEEETIT Forney, On the Hamming Distance Properties of Group Codes 1992 38 IEEETIT Radosavljevic & Arikan & Hajek, Sequential Decoding of Low-Density Parity-Check Codes by Adaptive Reordering of Parity Checks 1992 38 IEEETIT Gilbert & Kadota, The Lempel-Ziv Algorithm and Message Complexity 1992 38 IEEETIT Li, Random Texts Exhibit Zipf's Law-Like Word Frequency Distribution 1992 38 IEEETIT Kumar & Wei, Minimum Distance of Logarithmic and Fractional Partial m-Sequences 1992 38 IEEETIT Orlitsky, Average-Case Interactive Communication 1992 38 IEEETIT Nobel & Wyner, A Recurrence Theorem for Dependent Processes with Applications to Data Compression 1992 38 IEEETIT Akashi, A Relation Between Kolmogorov-Prokhorov's Condition and Ohya' Fractal Dimensions 1992 38 IEEETIT Zhang & Xia, New Lower bounds for Binary Codes of Asymmetric Distance Two 1992 38 IEEETIT Fabris, Variable-Length-to-Variable-Length Source Coding: A Greedy Step-by-Step Algorithm 1992 38 IEEETIT Vaidya & Pradhan, A New Class of Bit- and Byte-Error Control Codes 1992 38 IEEETIT Modiano & Ephremides, Communication Complexity of Secure Distributed Computation in the Presence of Noise 1992 38 IEEETIT Vanroose & van der Meulen, Uniquely Decodable Codes for Deterministic Relay Channels 1992 38 IEEETIT Rose & Gurewitz & Fox, Vector Quantization by Deterministic Annealing 1992 38 IEEETIT Feder & Merhav & Gutman, Universal Prediction of Individual Sequences 1992 38 IEEETIT Miller & O'Sullivan, Entropies and Combinatorics of Random Branching Processes and Context-Free Languages 1992 38 IEEETIT Feig & winograd, On the Multiplicative Complexity of Discrete Cosine Transforms 1992 38 IEEETIT Ryabko, A Fast On-Line Adaptive Code 1992 38 IEEETIT Wolfmann, Almost Perfect Autocorrelation Sequences 1992 38 IEEETIT Chung & Salehi & Wei, Correction to ``Optical Orthogonal Codes: Design, Analysis, and Applications 1992 38 IEEETIT Venkatesh, Robustness in Neural Computation: Random Graphs and Sparsity 1992 38 IEEETIT Kschischang & Pasupathy, Some Ternary and Quaternary Codes and Associated Sphere Packings 1992 38 IEEETIT Weinberger & Ziv & Lempel, On the Optimal Asymptotic Performance of Universal Ordering and of Discrimination of Individual Sequences 1992 38 IEEETIT Feder, A Note on the Competitive Optimality of the Huffman Code 1992 38 IEEETIT Alon & Bruck & Naor & Naor & Roth, Construction of Asymptotically Good Low-Rate Error-Correcting Codes through Pseudo-Random Graphs 1992 38 IEEETIT Zhi & Pingzhi & Fan, Disjoint Difference Sets, Difference Triangle Sets, and Related Codes 1992 38 IEEETIT Ziv & Merhav, Estimating the Number of States of a Finite-State Source 1992 38 IEEETIT Plotnik & Weinberger & Ziv, Upper Bounds on the Probability of Sequences Emitted by Finite-State Sources and on the Redundancy of the Lempel-Ziv Algorithm 1992 38 IEEETIT Yokoo, Improved Variations Relating the Ziv-Lempel and Welch-Type Algorithms for Sequential Data Compression 1992 38 IEEETIT Manstetten, Tight Bounds on the Redundancy of Huffman Codes 1992 38 IEEETIT Tassiulas & Ephremides, Jointly Optimal Routing and Scheduling in Packet Radio Networks 1991 37 IEEETIT Dembo & Cover & Thomas, Information Theoretic Inequalities 1991 37 IEEETIT Venkatesh & Franklin, How Much Information Can One Bit of Memory Retain About a Bernoulli Sequence? 1991 37 IEEETIT Kawabata & Yamamoto, A New Implementation of the Ziv-Lempel Incremental Parsing Algorithm 1991 37 IEEETIT Feder, Gambling Using a Finite State Machine 1991 37 IEEETIT Zivkovic, An Algorithm for the Initial State Reconstruction of the Clock-Controlled Shift Register 1991 37 IEEETIT Piret, On the Connectivity of Radio Networks 1991 37 IEEETIT Orlitsky, Worst-Case Interactive Communication II: Two Messages are Not Optimal 1991 37 IEEETIT Yeung, A New Outlook on Shannon's Information Measures 1991 37 IEEETIT Yeung, Alphabetic Codes Revisited 1991 37 IEEETIT Pellikaan & Shen & van Wee, Which Linear Codes are Algebraic-Geometric? 1991 37 IEEETIT Kumar & Moreno, Prime-Phase Sequences with Periodic Correlation Properties Better Than Binary Sequences 1991 37 IEEETIT Pippenger & Stamoulis & Tsitsiklis, On a Lower Bound for the Redundancy of Reliable Networks with Noisy Gates 1991 37 IEEETIT Bender & Wolf, New Asymptotic Bounds and Improvements on the Lempel-Ziv Data Compression Algorithm 1991 37 IEEETIT Zemor & Cohen, Error-Correcting WOM-Codes 1991 37 IEEETIT van Overveld, The Four Cases of Write Unidirectional Memory Codes over Arbitrary Alphabets 1991 37 IEEETIT Wyner & Ziv, Fixed Data Base Version of the Lempel-Ziv Data Compression Algorithm 1991 37 IEEETIT Bassalygo & Gelfand & Pinsker, Coding for Partially Localized Errors 1991 37 IEEETIT Saitoh & Imai, Multiple Unidirectional Byte Error-Correcting Codes 1991 37 IEEETIT Hollmann & Schouhamer Immink, Performance of Efficient Balanced Codes 1991 37 IEEETIT Equitz & Cover, Successive Refinement of Information 1991 37 IEEETIT Frougny, Fibonacci Representations and Finite Automata 1991 37 IEEETIT Elias, Error-Correcting Codes for List Decoding 1991 37 IEEETIT Cruz, A Calculus for Network Delay, Part I: Network Elements in Isolation 1991 37 IEEETIT Cruz, A Calculus for Network Delay, Part II: Network Analysis 1991 37 IEEETIT Capocelli & De Santis, A Note on D-ary Huffman Codes 1991 37 IEEETIT Philips & Towsley & Wolf, Correction to ``On the Diameter of a Class of Random Graphs'' 1990 36 IEEETIT Verboven & van der Meulen, Capacity Bounds for Identification via Broadcast Channels that are Optimal for the Deterministic Broadcast Channel 1990 36 IEEETIT Conway & Sloane, A New Upper Bound on the Minimal Distance of Self-Dual Codes 1990 36 IEEETIT Brouwer & Shearer & Sloane & Smith, A New Table of Constant Weight Codes 1990 36 IEEETIT Montgomery & Diamond & Kumar, Bit Probabilities of Optimal Binary Source Codes 1990 36 IEEETIT Coffey & Goodman, Any Code of Which We Cannot Think is Good 1990 36 IEEETIT Bernard & Sharma, A Lower Bound on Average Codeword Length of Variable Length Error-Correcting Codes 1990 36 IEEETIT Bomer & Antweiler, Periodic Complementary Binary Sequences 1990 36 IEEETIT Bach, A Note on Square Roots on Finite Fields 1990 36 IEEETIT Orlitsky, Worst-Case Interactive Communication I: Two Messages are Almost Optimal 1990 36 IEEETIT Mayhew & Golomb, Linear Spans of Modified de Bruijn Sequences 1990 36 IEEETIT Ross & Yao, Monotonicity Properties for the Stochastic Knapsack 1990 36 IEEETIT Lobstein, The Hardness of Solving Subset Sum with Preprocessing 1990 36 IEEETIT Wiener, Cryptanalysis of Short RSA Secret Exponents 1990 36 IEEETIT Chan & Goresky & Klapper, On the Linear Complexity of Feedback Registers 1990 36 IEEETIT Antweiler & Bomer & Luke, Perfect Ternary Arrays 1990 36 IEEETIT Ziv, review of Cover & Gopinath, Oper Problems in Communication and Computation 1990 36 IEEETIT Wong & Chen, The Entropy of Ordered Sequences and Order Statistics 1990 36 IEEETIT Philips & Towsley & Wolf, On the Diameter of a Class of Random Graphs 1990 36 IEEETIT Hajela, On Computing the Minimum Distance for Faster than Nyquist Signaling 1990 36 IEEETIT Bruck & Naor, The Hardness of Decoding Linear Codes with Preprocessing 1990 36 IEEETIT Birmiwal, The Minimum Codeword Length and Redundancy in the Binary Huffman Code for Uncertain Sources 1990 36 IEEETIT Golic & Obradovic, Correction to ``A Lower Bound on the Redundancy of D-ary Huffman Codes'' 1990 36 IEEETIT Orlitsky & El Gamal, Average and Randomized Communication Complexity 1990 36 IEEETIT Jones & Byrne, General Entropy Criteria for Inverse Problems, with Applications to Data Compression, Pattern Classification and Cluster Analysis 1990 36 IEEETIT Agnew, Cryptographic Systems Using Redundancy 1990 36 IEEETIT Ben-Or & Goldreich & Micali & Rivest, A Fair Protocol for Signing Contracts 1990 36 IEEETIT Okamoto, A Fast Signature Scheme Based on Congruential Polynomial Operations 1990 36 IEEETIT Jimbo & Fuji-Hara, Optimal Authentication Systems and Combinatorial Designs 1990 36 IEEETIT Jeng & Woods, Simulated Annealing in Compound Gaussian Fields 1990 36 IEEETIT Chang & Davisson, Two Iterative Algorithms for Finding Minimax Solutions 1990 36 IEEETIT Korner & Marton, On the Capacity of Uniform Hypergraphs 1990 36 IEEETIT Ramanan & Jordan & Sauer, A New Time Domain, Multistage Permutation Algorithm 1990 36 IEEETIT Shearer, Some New Optimum Golomb Rulers 1990 36 IEEETIT Koplowitz & Lindenbaum & Bruckstein, The Number of Digital Straight Lines on an N X N Grid 1990 36 IEEETIT Vourdas, Information in Quantum Optical Binary Communications 1990 36 IEEETIT Tietavainen, An Asymptotic Bound on the Covering Radii of Binary BCH Codes 1990 36 IEEETIT Sole, A Limit Law on the Distance Distribution of Binary Codes 1990 36 IEEETIT Ozarow & Shepp, The Exact Information Complexity of Indian Poker 1989 35 IEEETIT Cedervall & Johannesson, A Fast Algorithm for Computing Distance Spectrum of Convolutional Codes 1989 35 IEEETIT Pellikaan, On a Decoding Algorithm for Codes on Maximal Curves 1989 35 IEEETIT Wyner & Ziv, Some Asymptotic Properties of the Entropy of a Stationary Ergodic Data Source with Applications to Data Compression 1989 35 IEEETIT Karpovsky & Nagvajara, Optimal Codes for Minimax Criterion on Error Detection 1989 35 IEEETIT Clark & Dunning & Rogers, The Construction of some Bit and Byte Error Control Codes Using Partial Steiner Systems 1989 35 IEEETIT Capocelli & Gargano & Vaccaro, An Efficient Algorithm for Testing Immutability of Variable-Length Codes 1989 35 IEEETIT van Pul & Etzion, New Lower Bounds for Constant Weight Codes 1989 35 IEEETIT Kaikkonen, A New Four-Error-Correcting Code of Length 20 1989 35 IEEETIT Bruck & Blaum, Neural Networks, Error-Correcting Codes, and Polynomials over the Binary n-Cube 1989 35 IEEETIT Hoballah & Varshney, An Information Theoretic Approach to the Distributed Detection Problem 1989 35 IEEETIT Philips & Panwar & Tantawi, Connectivity Properties of a Packet Radio Network Model 1989 35 IEEETIT Dasgupta & Ghosh & Cuykendall, Convergence in Neural Memories 1989 35 IEEETIT Capocelli & De Santis, Tight Upper Bounds on the Redundancy of Huffman Codes 1989 35 IEEETIT Preparata, Holographic Dispersal and Recovery of Information 1989 35 IEEETIT Paterakis & Papantoni-Kazakos, A Simple Window Random Access Algorithm with Advantageous Properties 1989 35 IEEETIT Wyner, review of Blahut, Principles and Practice of Information Theory (1987) 1989 35 IEEETIT Venkatesh & Psaltis, Linear and Logarithmic Capacities in Associative Neural Networks 1989 35 IEEETIT Feder, Reliable Computation by Networks in the Presence of Noise 1989 35 IEEETIT Yamamoto, Coding Theorem for Secret Sharing Communication Systems with Two Noisy Channels 1989 35 IEEETIT Restivo, A Note on Multi-Set Decipherable Codes 1989 35 IEEETIT Simonyi, On Write-Unidirectional Memory Codes 1989 35 IEEETIT Grassberger, Estimating the Information Content of Symbol Sequences and Efficient Codes 1989 35 IEEETIT Anantharam, The Optimal Buffer Allocation Problem 1989 35 IEEETIT Rao & Nam, Private-Key Algebraic-Code Encryptions 1989 35 IEEETIT No & Kumar, A New Family of Binary Pseudorandom Sequences Having Optimal Periodic Correlation Properties and Large Linear Span 1989 35 IEEETIT Mukherji, A Periodic Scheduling Problem in Flow Control for Data Communication Networks 1989 35 IEEETIT van Oorschot & Vanstone, A Geometric Approach to Root Finding in GF(q^m) 1989 35 IEEETIT Adams & Meijer, Security-Related Comments Regarding McEliece's Public-Key Cryptosystem 1989 35 IEEETIT Willems, review of Mansuripur, Introduction to Information Theory 1989 35 IEEETIT Root, review of Middleton, Introduction to Statistical Communication Theory 1989 35 IEEETIT Willems, Universal Data Compression and Repetition Times 1989 35 IEEETIT Kuh & Dickinson, Information Capacity of Associative Memories 1989 35 IEEETIT Sussmann, On the Number of Memories that can be Perfectly Stored in a Neural Net with Hebb Weights 1989 35 IEEETIT Capocelli, Comments and Additions to ``Robust Transmission of Unbounded Strings Using Fibonacci Representations'' 1989 35 IEEETIT Regnier & Jacquet, New Results on the Size of Tries 1988 34 IEEETIT Chor & Rivest, A Knapsack-Type Public Key Cryptosystem Based on Arithmetic in Finite Fields 1988 34 IEEETIT Hajek & Sasaki, Link Scheduling in Polynomial Time 1988 34 IEEETIT Pollara & McEliece & Abdel-Ghaffar, Finite-State Codes 1988 34 IEEETIT Bruck & Goodman, A Generalized Convergence Theorem for Neural Networks 1988 34 IEEETIT Korner & Marton, Random Access Communication and Graph Entropy 1988 34 IEEETIT Honkala, Lower Bounds for Binary Covering Codes 1988 34 IEEETIT Amirazizi & Hellman, Time-Memory-Processor Trade-offs 1988 34 IEEETIT Seroussi & Bshouty, Vector Sets for Exhaustive Testing of Logic Circuits 1988 34 IEEETIT Baldi, Neural Networks, Orientations of the Hypercube, and Algebraic Threshold Functions 1988 34 IEEETIT Pippenger, Reliable Computation by Formulas in the Presence of Noise 1988 34 IEEETIT Ziv, On Classification with Empirically Observed Statistics and Universal Data Compression 1987 33 IEEETIT Hajek, Locating the Maximum of a Simple Random Sequence by Sequential Search 1987 33 IEEETIT Pollard & Schnorr, An Efficient Solution of the Congruence x^2 + ky^2 = m (mod n) 1987 33 IEEETIT McEliece & Posner & Rodemich & Venkatesh, The Capacity of the Hopfield Associative Memory 1987 33 IEEETIT Hwang & Chang, Cutoff Points for Roll Call Protocols in Multiple Access Systems 1987 33 IEEETIT Hwang & Shepp, Some Inequalities Concerning Random Subsets of a Set 1987 33 IEEETIT Ashley & Siegel, A Note on the Shannon Capacity of Run-Length-Limited Codes 1987 33 IEEETIT Chung & Coffman & Reiman & Simon, The Forwarding Index of Communication Networks 1987 33 IEEETIT Apostolico & Fraenkel, Robust Transmission of Unbounded Strings Using Fibonacci Representations 1987 33 IEEETIT Gafni & Bertsekas, Asymptotic Optimality of Shortest Path Routing Algorithms 1987 33 IEEETIT Tanaka, Data Structure of Huffman Codes and Its Application to Efficient Encoding and Decoding 1986 32 IEEETIT Lempel & Ziv, Compression of Two-Dimensional Data 1986 32 IEEETIT van Lint & Wilson, On the Minimum Distance of Cyclic Codes 1986 32 IEEETIT Knuth, Efficient Balanced Codes 1986 32 IEEETIT Wiedemann, Solving Sparse Linear Equations Over Finite Fields 1986 32 IEEETIT Clark & Liang, Equidistant Binary Arithmetic Codes 1986 32 IEEETIT Capocelli, Regular Universal Codeword Sets 1986 32 IEEETIT Leighton & Rivest, Estimating a Probability Using Finite Memory 1986 32 IEEETIT Peralta, A Simple and Fast Probabilistic Algorithm for Computing Square Roots Modulo a Prime Number 1986 32 IEEETIT Feder, Maximum Entropy as a Special Case of the Minimum Description Length Criterion 1986 32 IEEETIT Montgomery & Abrahams, Synchronization of Binary Source Codes 1986 32 IEEETIT Capocelli & Giancarlo & Taneja, Bounds on the Redundancy of Huffman Codes 1986 32 IEEETIT Langdon, Comment on ``A Universal Data Compression System'' 1986 32 IEEETIT Cohen & Lobstein & Sloane, Further Results on the Covering Radius of Codes 1986 32 IEEETIT Cohen & Godlewski & Merkx, Linear Binary Codes for Write-Once Memories 1986 32 IEEETIT Adams, Subcodes and Covering Radius 1986 32 IEEETIT Newhart, Inequivalent Cyclic Codes of Prime Length 1986 32 IEEETIT Litsyn & Tsfasman, A Note on Lower Bounds 1986 32 IEEETIT Bossert & Hergert, Hard- and Soft-Decision Decoding Beyond the Half Minimum Distance--An Algorithm for Linear Codes 1986 32 IEEETIT Lempel, On Multiset Decipherable Codes 1986 32 IEEETIT Abu-Mostafa, The Complexity of Information Extraction 1986 32 IEEETIT Ahlswede & Csiszar, Hypothesis Testing with Communication Constraints 1986 32 IEEETIT Ahlswede, On Multiple Descriptions and Team Guessing 1986 32 IEEETIT Coffman & Gilbert, A Continuous Polling System with Constant Service Times 1986 32 IEEETIT Fischer, A Pyramid Vector Quantizer 1986 32 IEEETIT Geraniotis, Robust Coding for Multiple-Access Channels 1986 32 IEEETIT Pless, Decoding the Golay Codes 1986 32 IEEETIT Rissanen, Complexity of Strings in the Class of Markov Sources 1985 31 IEEETIT Lempel & Cohn, Design of Universal Test Sequences for VLSI 1985 31 IEEETIT Heegard, On the Capacity of Permanent Memory 1985 31 IEEETIT Knuth, Deciphering a Linear Congruential Encryption 1985 31 IEEETIT Johannesson & Zigangirov, On the Distribution of the Number of Computations in Any Finite Number of Subtrees for the Stack Algorithm 1985 31 IEEETIT Gumm, A New Class of Check-Digit Methods for Arbitrary Number Systems 1985 31 IEEETIT ElGamal, A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms 1985 31 IEEETIT ElGamal, A Subexponential-Time Algorithm for Computing Discrete Logarithms over GF(p^2) 1984 30 IEEETIT Calderbank & Mazo, A New Description of Trellis Codes 1984 30 IEEETIT McLoughlin, The Complexity of Computing the Covering Radius of a Code 1984 30 IEEETIT Auslander & Tolmieri, Characterizing the Radar Ambiguity Functions 1984 30 IEEETIT Wells, A Polynomial Form for Logarithms Modulo a Prime 1984 30 IEEETIT Klove, Using Codes for Error Correction and Detection 1984 30 IEEETIT Alltop, A Method for Extending Binary Linear Codes 1984 30 IEEETIT Ahlswede, Improvements of Winograd's Result on Computation in the Presence of Noise 1984 30 IEEETIT Etzion & Lempel, On the Distribution of de Bruijn Sequences of Given Complexity 1983 29 IEEETIT Avis & ElGindy, A Combinatorial Approach to Polygon Similarity 1983 29 IEEETIT O'Rourke & Supowit, Some NP-Hard Polygon Decomposition Problems 1983 29 IEEETIT Dolev & Yao, On the Security of Public Key Protocols 1983 29 IEEETIT Asmuth & Bloom, A Modular Approach to Key Safeguarding 1983 29 IEEETIT Langdon, A Note on the Ziv-Lempel Model for Compressing Individual Sequences 1983 29 IEEETIT Camion, Improving an Algorithm for Factoring Polynomials over a Finite Field and Constructing Large Irreducible Polynomials 1983 29 IEEETIT Vishkin, An Efficient Distributed Orientation Algorithm 1983 29 IEEETIT Rissanen, A Universal Data Compression System 1983 29 IEEETIT Gowda & Kirkpatrick & Lee & Naamad, Dynamic Voronoi Diagrams 1983 29 IEEETIT Karnin & Greene & Hellman, On Secret Sharing Systems 1983 29 IEEETIT Edelsbrunner & Kirkpatrick & Seidel, On the Shape of a Set of Points in the Plane 1983 29 IEEETIT Games, A Generalized Recursive Construction for de Bruijn Sequences 1983 29 IEEETIT Even & Goldreich, DES-Like Functions Can Generate the Alternating Group 1983 29 IEEETIT Brassard, Relativized Cryptography 1982 28 IEEETIT Tokiwa & Sugimura & Kasahara & Namekawa, New Decoding Algorithm for Reed-Muller Codes 1982 28 IEEETIT Shiozaki, Construction for Binary Asymmetric Error-Correcting Codes 1982 28 IEEETIT Hwang & Guan, Generalized Minimum Distance Decoding on Majority Logic Decodable Codes 1982 28 IEEETIT Chen, Formulas for the Solutions of Quadratic Equations over GF(2^m) 1982 28 IEEETIT Langdon & Rissanen, A Simple General Binary Source Code 1982 28 IEEETIT Blake & Mark, A Note on Complex Sequences with Low Correlations 1982 28 IEEETIT Winkelmann, An Improved Strategy for a Counterfeit Coin Problem 1982 28 IEEETIT Mead, Comments on ``An Improved Strategy for a Counterfeit Coin Problem'' 1982 28 IEEETIT Rodeh, A Fast Test for Unique Decipherability Based on Suffix Trees 1982 28 IEEETIT Lempel & Seroussi & Ziv, On the Power of Straight-Line Computations in Finite Fields 1982 28 IEEETIT Henze, The Solution of a General Equation for Public Key Distribution Systems 1980 26 IEEETIT Arazi, A Trapdoor Multiple Mapping 1980 26 IEEETIT Williams, A Modification of the RSA Public-Key Encryption Procedure 1980 26 IEEETIT Hellman, A Cryptanalytic Time-Memory Trade-Off 1980 26 IEEETIT Witsenhausen, Some Aspects of Convexity Useful in Information Theory 1980 26 IEEETIT Shamir & Zippel, On the Security of the Merkle-Hellman Cryptographic Scheme 1980 26 IEEETIT Mehlhorn, An Efficient Algorithm for Constructing Nearly Optimal Prefix Codes 1980 26 IEEETIT Stout, Improved Prefix Encodings of the Natural Numbers 1979 25 IEEETIT Brassard, A Note on the Complexity of Cryptography 1979 25 IEEETIT Heim, On the Algorithmic Foundation of Information Theory 1979 25 IEEETIT Mead, The Average Number of Weighings to Locate a Counterfeit Coin 1979 25 IEEETIT Hershey, Comma-Free Synchronization of Binary Counters 1978 24 IEEETIT Ziv, Coding Theorems for Individual Sequences 1978 24 IEEETIT Solomonoff, Complexity-Based Induction Systems: Comparisons and Convergence Theorems 1978 24 IEEETIT Berlekamp & McEliece & van Tilborg, On the Inherent Intractability of Certain Coding Problems 1978 24 IEEETIT Pohlig & Hellman, An Improved Algorithm for Computing Logarithms over GF(p) and Its Cryptographic Significance 1978 24 IEEETIT Merkle & Hellman, Hiding Information and Signatures in Trapdoor Knapsacks 1978 24 IEEETIT Ziv & Lempel, Compression of Individual Sequences via Variable-Rate Coding 1977 23 IEEETIT Hellman, An Extension of the Shannon Theory Approach to Cryptography 1977 23 IEEETIT Ziv & Lempel, A Universal Algorithm for Sequential Data Compression 1976 22 IEEETIT Pearl, Theoretical Bounds on the Complexity of Inexact Computations 1976 22 IEEETIT Lempel & Ziv, On the Complexity of Finite Sequences 1976 22 IEEETIT Diffie & Hellman, New Directions in Cryptography 1974 20 IEEETIT Chaitin, Information-Theoretic Computational Complexity 1970 16 IEEETIT Chaitin, On the Difficulty of Computations 1996 8 IEEETKDE Shang & Merrettal, Tries for Approximate String Matching 1996 8 IEEETKDE Wang & Chen, On the Complexity of Distributed Query Optimization 1996 8 IEEETKDE Parsons, Current Approaches to Handling Imperfect Information in Data and Knowledge Bases 1996 8 IEEETKDE Teuhola, Path Signatures: A Way to Speed Up Recursion in Relational Databases 1996 8 IEEETKDE Aoe & Morimoto & Shishibori & Park, A Trie Compaction Algorithm for a Large Set of Keys 1996 8 IEEETKDE Zheng & Larson, Speeding Up External Mergesort 1996 8 IEEETKDE Bouguettaya, On-Line Clustering 1996 8 IEEETKDE Zhou & Dillon, Correction to a Footnote in ``Theoretical and Practical Considerations of Uncertainty and Complexity in Automated Knowledge Acquisition'' 1995 7 IEEETKDE Fan & Su, The Design of Efficient Algorithms for Two-Dimensional Pattern Matching 1995 7 IEEETKDE Costagliola & Ferrucci & Tortora & Tucci, Non-Redundant 2D Strings 1994 6 IEEETKDE Hong & Tseng, Learning Concepts in Parallel Based Upon the Strategy of Version Space 1994 6 IEEETKDE Graefe & Linville & Shapiro, Sort vs. Hash Revisited 1994 6 IEEETKDE Stephens & Yesha & Humenik, Optimal Allocation for Partially Replicated Database Systems on Ring Networks 1994 6 IEEETKDE Sosic & Gu, Efficient Local Search with Conflict Minimization: A Case Study of the n-Queens Problem 1994 6 IEEETKDE Lu & Lee & Han, A Study on the Structure of Linear Recursion 1994 6 IEEETKDE Ganguly & Mohan & Ranka, A Space-and-Time-Efficient Coding Algorithm for Lattice Computations 1994 6 IEEETKDE Wang & Zhang & Jeong & Shasha, A System for Approximate Tree Matching 1994 6 IEEETKDE Du & Chang, An Approach to Designing Very Fast Approximate String Matching Algorithms 1994 6 IEEETKDE Brain & Tharp, Using Tries to Eliminate Pattern Collisions in Perfect Hashing 1994 6 IEEETKDE Kumar, G-Tree: A New Data Structure for Organizing Multidimensional Data 1994 6 IEEETKDE Weigert & Tsai, A Computationally Tractable Nonmonotonic Logic 1993 5 IEEETKDE Cheetham & Oommen & Ng, Adaptive Structuring of Binary Search Trees Using Conditional Rotations 1993 5 IEEETKDE Honig, Logical Organization of Knowledge with Inconsistent and Undecidable Algorithms Using Imaginary and Transfinite Exponential Number Forms in a Non-Boolean Field: Part One -- Basic Principles 1992 4 IEEETKDE Yan & Chin & Wang, Optimal Agreement Protocol in Malicious Faulty Processors and Faulty Links 1992 4 IEEETKDE Hachem & Berra, New Order Preserving Access Methods for Very Large Files Derived from Linear Hashing 1992 4 IEEETKDE Ramakrishna & Ramos, Optimal Distribution of Signatures in Signature Hashing 1991 3 IEEETKDE Abdelguerfi & Sood, Computational Complexity of Sorting and Joining Relations with Duplicates 1991 3 IEEETKDE Du & Tong, Multilevel Extendible Hashing: A File Structure for Very Large Databases 1991 3 IEEETKDE Kumar & Place & Yang, An Efficient Algorithm for Mutual Exclusion Using Queue Migration in Computer Networks 1991 3 IEEETKDE Tien & Yang, Comments on ``Hash-Based and Index-Based Join Algorithms for Cube and Ring Connected Multicomputers'' 1991 3 IEEETKDE Simon, Artificial Intelligence: Where Has It Been, and Where is it Going? 1991 3 IEEETKDE Noronha & Sarma, Knowledge-Based Approaches for Scheduling Problems: A Survey 1991 3 IEEETKDE Pao & Sobajic, Neural Networks and Knowledge Engineering 1989 1 IEEETKDE Stonebraker, Future Trends in Database Systems 1989 1 IEEETKDE Zadeh, Knowledge Representation in Fuzzy Logic 1989 1 IEEETKDE Fateman, A Review of Macsyma 1996 7 IEEETNN Smith, An Argument for Abandoning the Traveling Salesman Problem as a Neural-Network Benchmark 1995 6 IEEETNN Baldi & Hornik, Learning in Linear Neural Networks: A Survey 1995 6 IEEETNN Wang, Analysis and Design of An Analog Sorting Network 1995 6 IEEETNN Kremer, On the Computational Power of Elman-Style Recurrent Networks 1995 6 IEEETNN Plate, Holographic Reduced Representations 1995 6 IEEETNN Muselli, On Sequential Construction of Binary Neural Networks 1995 6 IEEETNN Urahama & Nagao, K-Winners-Take-All Circuit with O(N) Complexity 1995 6 IEEETNN Mascioli & Martinelli, A Constructive Algorithm for Binary Neural Networks: The Oil-Spot Algorithm 1995 6 IEEETNN Yip & Pao, Combinatorial Optimization with Use of Guided Evolutionary Simulated Annealing 1995 6 IEEETNN Holden & Rayner, Generalization and PAC Learning: Some New Results for the Class of Generalized Single-Layer Networks 1993 4 IEEETNN Reed, Pruning Algorithms--A Survey 1993 4 IEEETNN Palmieri & Zhu & Chang, Anti-Hebbian Learning in Topologically Constrained Linear Networks: A Tutorial 1993 4 IEEETNN Bose & Garga, Neural Network Design Using Voronoi Diagrams 1991 2 IEEETNN Roth, Analogical Versus Logical or Connectionist Versus Symbolic or Scruffy Versus Neat 1991 2 IEEETNN Steeg, Comments on ``Parallel Algorithms for Finding a Near-Maximum Independent Set of a Circle Graph'' 1991 2 IEEETNN Takefuji & Lee, Authors' Reply (to Steeg, Comments on ``Parallel Algorithms for Finding a Near-Maximum Independent Set of a Circle Graph'') 1991 2 IEEETNN Baum, Neural Net Algorithms That Learn in Polynomial Time from Examples and Queries 1991 2 IEEETNN Huang & Huang, Bounds on the Number of Hidden Neurons in Multilayer Perceptrons 1991 2 IEEETNN Miller & Roysam & Smith & O'Sullivan, Representing and Computing Regular Languages on Massively Parallel Networks 1991 2 IEEETNN Zhou & Cherkassky & Baldwin & Olson, A Neural Network Approach to Job-Shop Scheduling 1990 1 IEEETNN Tekefuji & Chen & Lee & Huffman, Parallel Algorithms for Finding a Near-Maximum Independent Set of a Circle Graph 1997 5 IEEETNWKG Tcha & Chung & Choi, A New Lower Bound for the Frequency Assignment Problem 1997 5 IEEETNWKG Garcia-Luna-Aceves & Murthy, A Path-Finding Algorithm for Loop-Free Routing 1996 4 IEEETNWKG Low & Maxemchuk & Paul, Anonymous Credit Cards and Their Collusion Analysis 1996 4 IEEETNWKG Gerstel & Cidon & Zaks, The Layout of Virtual Paths in ATM Networks 1996 4 IEEETNWKG Abu-Amara & Coan & Dolev & Kanevsky & Welch, Self-Stabilizing Topology Maintenance Protocols for High-Speed Networks 1996 4 IEEETNWKG Bauer & Varma, Distributed Algorithms for Multicast Path Setup in Data Networks 1996 4 IEEETNWKG Liu & Miller, Generalized Fair Reachability Analysis for Cyclic Protocols 1996 4 IEEETNWKG Clementi & Di Ianni, On the Hardness of Approximating Optimum Schedule Problems in Store and Forward Networks 1996 4 IEEETNWKG Doeringer & Karjoth & Nassehi, Routing on Longest-Matching Prefixes 1995 3 IEEETNWKG Feldmeier, Fast Software Implementation of Error Detection Codes 1995 3 IEEETNWKG Shi & Fonseka, Hierarchical Self-Healing Rings 1995 3 IEEETNWKG Katzela & Schwartz, Schemes for Fault Identification in Communication Networks 1995 3 IEEETNWKG Shenker, Making Greed Work in Networks: A Game-Theoretic Analysis of Switch Service Disciplines 1995 3 IEEETNWKG Bala & Stern & Simchi-Levi & Bala, Routing in a Linear Lightwave Network 1995 3 IEEETNWKG Iness & Banerjee & Mukherjeee, GEMNET: A Generalized, Shuffle-Exchange-Based, Regular, Scalable, Modular, Multihop, WDM Lightwave Network 1995 3 IEEETNWKG Mills, Improved Algorithms for Synchronizing Computer Network Clocks 1995 3 IEEETNWKG Shankar & Lee, Minimum-latency Transport Protocols with Modulo-N Incarnation Numbers 1995 3 IEEETNWKG Pankaj & Gallager, Wavelength Requirements of All-Optical Networks 1995 3 IEEETNWKG Lee & Kung, Binary Addressing and Routing Schemes in the Manhattan Street Network 1995 3 IEEETNWKG Bird & Gopal & Herzberg & Janson & Kutten & Molva & Yung, The KryptoKnight Family of Light-Weight Protocols for Authentication and Key Distribution 1995 3 IEEETNWKG Lee & Lee, A New Distribution Network Based on Controlled Switching Elements and Its Applications 1994 2 IEEETNWKG Sharony & Stern & Li, The Universality of Multidimensional Switching Networks 1993 1 IEEETNWKG Pieris & Sasaki, A Linear Lightwave Benes Network 1993 1 IEEETNWKG Wang & Schwartz, Fault Detection with Multiple Observers 1997 19 IEEETPAMI Hofmann & Buhmann, Correction to ``Pairwise Data Clustering by Deterministic Annealing'' 1996 18 IEEETPAMI Oommen & Zhang, The Normalized String Editing Problem Revisited 1996 18 IEEETPAMI Gold & Rangarajan, A Graduated Assignment Algorithm for Graph Matching 1995 17 IEEETPAMI Vidal & Marzal & Aibar, Fast Computation of Normalized Edit Distances 1995 17 IEEETPAMI Sastry & Ranganathan & Remedios, CASM: A VLSI Chip for Approximate String Matching 1995 17 IEEETPAMI Salzberg & Delcher & Heath & Kasif, Best-Case Results for Nearest-Neighbor Learning 1995 17 IEEETPAMI Breu & Gil & Kirkpatrick & Werman, Linear Time Euclidean Distance Transform Algorithms 1995 17 IEEETPAMI Jang & Park & Prasanna, A Fast Algorithm for Computing a Histogram on Reconfigurable Mesh 1994 16 IEEETPAMI Wang, Collision Detection of a Moving Polygon in the Presence of Polygonal Obstacles in the Plane 1994 16 IEEETPAMI Granville & Krivanek & Rasson, Simulated Annealing: A Proof of Convergence 1994 16 IEEETPAMI Sun & Liu & Grady, Reconstruction of 3-D Binary Tree-Like Structures from Three Mutually Orthogonal Projections 1994 16 IEEETPAMI Park & Chin, Optimal Decomposition of Convex Morphological Structuring Elements for 4-Connected Parallel Array Processors 1993 15 IEEETPAMI Huttenlocher & Klanderman & Rucklidge, Comparing Images Using the Hausdorff Distance 1993 15 IEEETPAMI Sinha & Prasada & Houle & Sabourin, Hybrid Contextual Text Recognition with String Matching 1993 15 IEEETPAMI Marzal & Vidal, Computation of Normalized Edit Distance and Applications 1993 15 IEEETPAMI Kulkarni & Mitter & Tsitsiklis & Zeitouni, PAC Learning with Generalized Samples and an Application to Stochastic Geometry 1993 15 IEEETPAMI Lindenbaum & Bruckstein, On Recursive, O(N) Partitioning of a Digitized Curve into Digital Straight Segments 1993 15 IEEETPAMI Farago & Linder & Lugosi, Fast Nearest-Neighbor Search in Dissimilarity Spaces 1993 15 IEEETPAMI Gregor & Thomason, Dynamic Programming Alignment of Sequences Representing Cyclic Patterns 1993 15 IEEETPAMI Saitta & Bergadano, Pattern Recognition and Valiant's Learning Framework 1993 15 IEEETPAMI Tsay & Tsai, Attributed String Matching by Split-and-Merge for On-Line Chinese Character Recognition 1993 15 IEEETPAMI Oommen & Zgierski, Breaking Substitution Cyphers Using Stochastic Automata 1992 14 IEEETPAMI Alnuweiri & Prasanna, Parallel Architectures and Algorithms for Image Component Labeling 1991 13 IEEETPAMI Arkin & chew & Huttenlocher & Kedem & Mitchell, An Efficiently Computable Metric for Comparing Polygonal Shapes 1991 13 IEEETPAMI Le & Lee, Out-of-Roundness Problem Revisited 1991 13 IEEETPAMI Alnuweiri & Kumar, Fast Image Labeling Using Local Operators on Mesh-Connected Computers 1990 12 IEEETPAMI Garcia & Vidal, Inference of k-Testable Languages in the Strict Sense and Application to Syntactic Pattern Recognition 1990 12 IEEETPAMI Wolfson, On Curve Matching 1990 12 IEEETPAMI Ranka & Sahni, Convolution on Mesh Connected Multicomputers 1989 11 IEEETPAMI Prassanna-Kumar & Reisis, Image Computations on Meshes with Multiple Broadcast 1989 11 IEEETPAMI Landraud & Avril & Chretienne, An Algorithm for Finding a Common Structure Shared by a Family of Strings 1989 11 IEEETPAMI Cypher & Sanz & Snyder, An EREW PRAM Algorithm for Image Component Labeling 1989 11 IEEETPAMI Ahuja & Veenstra, Generating Octrees from Object Silhouettes in Orthographic Views 1989 11 IEEETPAMI Ronse, A Bibliography on Digital and Computational Convexity (1961-1988) 1989 11 IEEETPAMI Cordella & Sanniti di Baja, Geometric Properties of the Union of Maximal Neighborhoods 1989 11 IEEETPAMI Wu & Rokne, On Properties of Discretized Convex Curves 1988 10 IEEETPAMI Devroye, Automatic Pattern Recognition: A Study of the Probability of Error 1987 9 IEEETPAMI Oommen, Recognition of Noisy Subsequences Using Constrained Edit Distances 1987 9 IEEETPAMI Nagy & Seth & Einspahr, Decoding Substitution Ciphers by Means of Word Matching with Application to OCR 1983 5 IEEETPAMI Hull & Srihari & Choudhari, An Integrated Algorithm for Text Recognition: Comparison with a Cascaded Algorithm 1982 4 IEEETPAMI Bozinovic & Srihari, A String Correction Algorithm for Cursive Script Recognition 1996 39 IEEETPC Carroll & van der Meij, Ten Misconceptions about Minimalism 1996 39 IEEETPC Renze, Important Factors in the Technical Proposal Process According to Engineering Faculty 1995 38 IEEETPC Selber, Metaphorical Perspectives on Hypertext 1995 38 IEEETPC Farkas & Poltrock, Online Editing, Mark-Up Models, and the Workplace Lives of Editors and Writers 1995 38 IEEETPC Gross, Promises, Hopes, and Hyperbole: Adoption of New Information Technologies 1994 37 IEEETPC Horowitz & Barchilon, Stylistic Guidelines for E-Mail 1993 36 IEEETPC Schreiber, From Academic Writing to Job-Related Writing: Achieving a Smooth Transition 1993 36 IEEETPC Dowhal & Bist & Kohlmann & Musker & Rogers, Producing a Video on a Technical Subject: A Guide 1993 36 IEEETPC Kuo, Teaching Lecture Comprehension to Non-Native Science Students 1992 35 IEEETPC Chew, review of Gannon (Ed.), Best Science Writing: Readings and Insights (The Oryx Press, 1991) 1991 34 IEEETPC Sanford, Augmenting the Gatekeeper's Role: A Decision Support System for a Journal Editor 1991 34 IEEETPC Brockmann, The Unbearable Distraction of Color 1991 34 IEEETPC Horton, Overcoming Chromophobia: A Guide to the Confident and Appropriate Use of Color 1991 34 IEEETPC Winn, Color in Document Design 1991 34 IEEETPC Clark, review of Bolter, Writing Space: The Computer, Hypertext, and the History of Writing (1991) 1991 34 IEEETPC Bush, review of Rude, Technical Editing (1991) 1991 34 IEEETPC Bush, Comparing the Two Cultures in Technical Writing 1991 34 IEEETPC , Database of Dissertations and Theses on Technical Communication 1990 33 IEEETPC Burton, Editing Math: What to Do With the Symbols 1990 33 IEEETPC Corbett, Clearing the Air: Some Thoughts on Gender-Neutral Writing 1990 33 IEEETPC Lindeborg, Faster Manuscript Publishing: A Case Study 1990 33 IEEETPC Carliner, Elements of Editorial Style for Computer-Delivered Information 1989 32 IEEETPC Robinson & Courter, A New Kind of Internship: Technical Writing for Engineers 1989 32 IEEETPC Engle, A Technical Writing Curriculum That Brings Art and Science Together 1989 32 IEEETPC Hill, Using Personal Bibliographic Data Bases to Keep Up With the Engineering Literature 1997 8 IEEETPDS Kim & Liu & Chien, Compressionless Routing: A Framework for Adaptive and Fault-Tolerant Routing 1997 8 IEEETPDS Greenberg & Oh, Universal Wormhole Routing 1997 8 IEEETPDS Wang & Lin, On Routing Maskable Messages in Hypercube-Derived Multistage Interconnection Networks 1997 8 IEEETPDS Day & Al-Ayyoub, The Cross Product of Interconnection Networks 1997 8 IEEETPDS Lee & Shin, Optimal Task Assignment in Homogeneous Networks 1997 8 IEEETPDS Schollmeyer & McMillin, A General Method for Maximizing the Error-Detecting Ability of Distributed Algorithms 1997 8 IEEETPDS Sung & Lin & Ho, Multiple-Edge-Fault Tolerance with Respect to Hypercubes 1997 8 IEEETPDS Jang & Nigam & Prasanna & Sahni, Constant Time Algorithms for Computational Geometry on the Reconfigurable Mesh 1997 8 IEEETPDS Bokka & Gurla & Olariu & Schwing & Wilson, Time-Optimal Domain-Specific Querying on Enhanced Meshes 1997 8 IEEETPDS Tsai & McKinley, An Extended Dominating Node Approach to Broadcast and Global Combine in Multiport Wormhole-Routed Mesh Networks 1997 8 IEEETPDS Fu, Delay-Optimal Quorum Consensus for Distributed Systems 1996 7 IEEETPDS Rao, On Parallel Algorithms for Single-Fault Diagnosis in Fault Propagation Graph Systems 1996 7 IEEETPDS Efe & Fernandez, Mesh-Connected Trees: A Bridge Between Grids and Meshes of Trees 1996 7 IEEETPDS Berthome & Ferreira & Perennes, Optimal Information Dissemination in Star and Pancake Networks 1996 7 IEEETPDS Chuang, CGIN: A Fault Tolerant Modified Gamma Interconnection Network 1996 7 IEEETPDS Passos & Sha, Achieving Full Parallelism Using Multidimensional Retiming 1996 7 IEEETPDS Olariu & Zomaya, A Time- and Cost-Optimal Algorithm for Interlocking Sets--With Applications 1996 7 IEEETPDS Lo & Rajopadhye & Telle & Zhong, Parallel Divide and Conquer on Meshes 1996 7 IEEETPDS Huang & Zhu, A New HAD Algorithm for Optimal Routing of Hierarchically Structured Data Networks 1996 7 IEEETPDS Barak & Schenfeld, Embedding Classical Communication Topologies in the Scalable OPAM Architecture 1996 7 IEEETPDS Ali & Vaidyanathan, Exact Bounds on Running ASCEND/DESCEND and FAN-IN Algorithms on Synchronous Multiple Bus Networks 1996 7 IEEETPDS Dusseau & Culler & Schauser & Martin, Fast Parallel Sorting Under LogP: Experience with the CM-5 1996 7 IEEETPDS Lai & Sheng, Constructing Euclidean Minimum Spanning Trees and All Nearest Neighbors on Reconfigurable Meshes 1996 7 IEEETPDS JaJa & Ryu, The Block Distributed Memory Model 1996 7 IEEETPDS Duato, A Necessary and Sufficient Condition for Deadlock-Free Routing in Cut-Through and Store-and-Forward Networks 1996 7 IEEETPDS Tsai & McKinley, A Broadcast Algorithm for All-Port Wormhole-Routed Torus Networks 1996 7 IEEETPDS Varvarigos & Banerjee, Routing Schemes for Multiple Random Broadcasts in Arbitrary Network Topologies 1996 7 IEEETPDS Das & Pinotti & Sarkar, Correction to ``Optimal and Load Balanced Mapping of Parallel Priority Queues in Hypercubes'' 1996 7 IEEETPDS Bhagavathi & Gurla & Olariu & Schwing & Zhang, Square Meshes Are Not Optimal for Convex Hull Computation 1996 7 IEEETPDS Das & Pinotti & Sarkar, Optimal and Load Balanced Mapping of Parallel Priority Queues in Hypercubes 1996 7 IEEETPDS Thakur & Choudhary & Ramanujam, Efficient Algorithms for Array Redistribution 1996 7 IEEETPDS Deb, Multiskewing--A Novel Technique for Optimal Parallel Memory Access 1996 7 IEEETPDS Feehrer & Ramfelt, Packet Synchronization for Synchronous Optical Deflection-Routed Interconnection Networks 1996 7 IEEETPDS Zheng & Latifi, Optimal Simulation of Linear Multiprocessor Architectures on Multiply-Twisted Cube Using Generalized Gray Codes 1996 7 IEEETPDS Glass & Ni, Fault-Tolerant Wormhole Routing in Meshes without Virtual Channels 1996 7 IEEETPDS Ammann & Jajodia & Frankl, Globally Consistent Event Ordering in One-Directional Distributed Environments 1996 7 IEEETPDS Saikia & Sen, Two Ranking Schemes for Efficient Computation on the Star Interconnection Network 1996 7 IEEETPDS Upfal & Felperin & Snir, Randomized Routing with Shorter Paths 1996 7 IEEETPDS Chen & Chen & Yu, On General Results for All-to-All Broadcast 1996 7 IEEETPDS Lewandowski & Condon & Bach, Asynchronous Analysis of Parallel Dynamic Programming Algorithms 1996 7 IEEETPDS Siu & Chin & Yang, A Note on Consensus on Dual Failure Modes 1996 7 IEEETPDS Singh, Leader Election in the Presence of Link Failures 1996 7 IEEETPDS Yang & Raghavendra, Embedding and Reconfiguration of Binary Trees in Faulty Hypercubes 1996 7 IEEETPDS Peters & Syska, Circuit-Switched Broadcasting in Torus Networks 1996 7 IEEETPDS Bruck & De Coster & Dewulf & Ho & Lauwereins, On the Design and Implementation of Broadcast and Global Combine Operations Using the Postal Model 1996 7 IEEETPDS Youn & Lee, An Efficient Dictionary Machine Using Hexagonal Processor Arrays 1996 7 IEEETPDS Chen, Graph Isomorphism and Identification Matrices: Parallel Algorithms 1996 7 IEEETPDS Yu & Chen, An Efficient Parallel Recognition Algorithm for Bipartite-Permutation Graphs 1996 7 IEEETPDS Wen, Multiway Merging in Parallel 1996 7 IEEETPDS Vadapalli & Srimani, A New Family of Cayley Graph Interconnection Networks of Constant Degree Four 1996 7 IEEETPDS Yamashita & Kameda, Computing on Anonymous Networks: Part I--Characterizing the Solvable Cases 1996 7 IEEETPDS Yamashita & Kameda, Computing on Anonymous Networks: Part II--Decision and Membership Problems 1995 6 IEEETPDS Nigam & Sahni, Sorting n^2 Numbers on n x n Meshes 1995 6 IEEETPDS Nabhan & Zomaya, A Parallel Simulated Annealing Algorithm with Low Communication Overhead 1995 6 IEEETPDS Rangarajan & Setia & Tripathi, A Fault-Tolerant Algorithm for Replicated Data Management 1995 6 IEEETPDS Umasankar & El-Amawy, Generalized Algorithms for Systematic Synthesis of Branch-and-Combine Clock Networks 1995 6 IEEETPDS Chen, Efficient Geometric Algorithms on the EREW PRAM 1995 6 IEEETPDS Lai & Wu, An (N-1)-Resilient Algorithm for Distributed Termination Detection 1995 6 IEEETPDS Lin & Olariu, Reconfigurable Buses with Shift Switching: Concepts and Applications 1995 6 IEEETPDS Stauffer & Hirschberg, Systolic Self-Organizing Lists Under Transpose 1995 6 IEEETPDS Alnuweiri, Parallel Constant-Time Connectivity Algorithms on a Reconfigurable Network of Processors 1995 6 IEEETPDS Huang & Hsieh, Exact Convergence of a Parallel Textured Algorithm for Data Network Optimal Routing Problems 1995 6 IEEETPDS Lan, An Adaptive Fault-Tolerant Routing Algorithm for Hypercube Multicomputers 1995 6 IEEETPDS Newman & Schuster, Hot-Potato Algorithms for Permutation Routing 1995 6 IEEETPDS Alam & Melhem, Routing in Modular Fault-Tolerant Multiprocessor Systems 1995 6 IEEETPDS Bioch & Ibaraki, Generating and Approximating Nondominated Coteries 1995 6 IEEETPDS Efe & Fernandez, Products of Networks with Logarithmic Diameter and Fixed Degree 1995 6 IEEETPDS Duato, A Theory of Deadlock-Free Adaptive Multicast Routing in Wormhole Networks 1995 6 IEEETPDS Lee & Wang, Ring-Connected Networks and Their Relationship to Cubical Ring Connected Cycles and Dynamic Redundancy Networks 1995 6 IEEETPDS Lee & Chen, Optimal Hot Spot Allocation on Meshes for Large-Scale Data-Parallel Algorithms 1995 6 IEEETPDS Gonzalez & Valero-Garcia & Diaz de Cerio, Executing Algorithms with Hypercube Topology on Torus Multicomputers 1995 6 IEEETPDS Yuan & Chang, Message Complexity of the Tree Quorum Algorithm 1995 6 IEEETPDS Bar-Noy & Bruck & Ho & Kipnis & Schieber, Computing Global Combine Operations in the Multiport Postal Model 1995 6 IEEETPDS Bhagavathi & Bokka & Gurla & Olariu & Schwing & Stojmenovic & Zhang, Time-Optimal Visibility-Related Algorithms on Meshes with Multiple Broadcasting 1995 6 IEEETPDS Duh & Chen & Fang, Algorithms and Properties of a New Two-Level Network with Folded Hypercubes as Basic Modules 1995 6 IEEETPDS Brassil & Cruz, Bounds on Maximum Delay in Networks with Deflection Routing 1995 6 IEEETPDS Lin & McKinley & Ni, The Message Flow Model for Routing in Wormhole-Routed Networks 1995 6 IEEETPDS Rai & Trahan & Smailus, Processor Allocation in Hypercube Multiprocessors 1995 6 IEEETPDS Jia, A Total Ordering Multicast Protocol Using Propagation Trees 1995 6 IEEETPDS Sheu & Wu & Chen, An Optimal Broadcasting Algorithm without Message Redundancy in Star Graphs 1995 6 IEEETPDS Chang & Yuan, Performance Characterization of the Tree Quorum Algorithm 1995 6 IEEETPDS Posch & Posch, Modulo Reduction in Residue Number Systems 1995 6 IEEETPDS Libeskind-Hadas & Shrivastava & Melhem & Liu, Optimal Reconfiguration Algorithms for Real-Time Fault-Tolerant Processor Arrays 1995 6 IEEETPDS Ramanathan & Chalasani, Resource Placement with Multiple Adjacency Constraints in k-ary n-Cubes 1995 6 IEEETPDS Bagherzadeh & Dowd & Latifi, A Well-Behaved Enumeration of Star Graphs 1995 6 IEEETPDS Liu & Shin & Chang, Prevention of Congestion in Packet-Switched Multistage Interconnection Networks 1995 6 IEEETPDS El-Amawy & Kulasinghe, Properties of Generalized Branch and Combine Clock Networks 1995 6 IEEETPDS Kao & Horng & Wang & Tsai, Designing Efficient Parallel Algorithms on CRAP 1995 6 IEEETPDS Tsay & Chang, Some New Designs of 2-D Array for Matrix Multiplication and Transitive Closure 1995 6 IEEETPDS Wang & Chin & Yan, Byzantine Agreement in a Generalized Connected Network 1995 6 IEEETPDS Ghose & Desai, Hierarchical Cubic Networks 1995 6 IEEETPDS Gu & Gu, Two Packet Routing Algorithms on a Mesh-Connected Computer 1995 6 IEEETPDS Chen, Efficient Parallel Binary Search on Sorted Arrays, with Applications 1995 6 IEEETPDS Wang & Siegel & Nichols & Abraham, Using a Multipath Network for Reducing the Effects of Hot Spots 1995 6 IEEETPDS Chan & Chin & Poon, Optimal Simulation of Full Binary Trees on Faulty Hypercubes 1995 6 IEEETPDS Pratt & Nguyen, Distributed Synchronous Clocking 1995 6 IEEETPDS Lee & Oruc, A Fast Parallel Algorithm for Routing Unicast Assignments in Benes Networks 1995 6 IEEETPDS Varvarigos & Bertsekas, Dynamic Broadcasting in Parallel Computing 1995 6 IEEETPDS Shao & Oruc, Efficient Nonblocking Switching Networks for Interprocessor Communications in Multiprocessor Systems 1995 6 IEEETPDS Netzer & Xu, Necessary and Sufficient Conditions for Consistent Global Snapshots 1995 6 IEEETPDS Chung, Prefix Computations on a Generalized Mesh-Connected Computer with Multiple Buses 1995 6 IEEETPDS Ho & Kao, Optimal Broadcast in All-Port Wormhole-Routed Hypercubes 1995 6 IEEETPDS Lee & Batcher, A Multiway Merge Sorting Network 1995 6 IEEETPDS Chen, Efficient Geometric Algorithms on the EREW PRAM 1995 6 IEEETPDS Lai & Wu, An (N-1)-Resilient Algorithm for Distributed Termination Detection 1995 6 IEEETPDS Stauffer & Hirschberg, Systolic Self-Organizing Lists Under Transpose 1995 6 IEEETPDS Alnuweiri, Parallel Constant-Time Connectivity Algorithms on a Reconfigurable Network of Processors 1994 5 IEEETPDS Edelman & Heller & Johnsson, Index Transformation Algorithms in a Linear Algebra Framework 1994 5 IEEETPDS Kim & Shin, Operationally Enhanced Folded Hypercubes 1994 5 IEEETPDS Pifarre & Gravano & Denicolay & Sanz, Adaptive Deadlock- and Livelock-Free Routing in the Hypercube Network 1994 5 IEEETPDS Helary & Mostefaouni & Raynal, A General Scheme for Token- and Tree-Based Distributed Mutual Exclusion Algorithms 1994 5 IEEETPDS Ziavras, RH: A Versatile Family of Reduced Hypercube Interconnection Networks 1994 5 IEEETPDS Olson & Shin, Fault-Tolerant Routing in Mesh Architectures 1994 5 IEEETPDS Ghosh & Das & John, Concurrent Processing of Linearly Ordered Data Structures on Hypercube Multicomputers 1994 5 IEEETPDS Olson & Shin, Fault-Tolerant Clock Synchronization in Large Multicomputer Systems 1994 5 IEEETPDS Prasad & Das & Chen, Efficient EREW PRAM Algorithms for Parentheses-Matching 1994 5 IEEETPDS Shih & Batcher, Adding Multiple-Fault Tolerance to Generalized Cube Networks 1994 5 IEEETPDS Lin & McKinley & Ni, Deadlock-Free Multicast Wormhole Routing in 2-D Mesh Multicomputers 1994 5 IEEETPDS Garg & Ghosh, Repeated Computation of Global Functions in a Distributed Environment 1994 5 IEEETPDS Lu & Lin, Parallel Algorithms for the Longest Common Subsequence Problem 1994 5 IEEETPDS Jain & Rajaraman, Lower and Upper Bounds on Time for Multiprocessor Optimal Schedules 1994 5 IEEETPDS Wolfstahl & Yoeli, An Equivalence Theorem for Labeled Marked Graphs 1994 5 IEEETPDS Abu-Amara & Gummadi, New Model and Algorithms for Leader Election in Synchronous Fiber-Optic Networks 1994 5 IEEETPDS Misic & Jovanovic, Communication Aspects of the Star Graph Interconnection Network 1994 5 IEEETPDS Kirousis & Spirakis & Tsigas, Reading Many Variables in One Atomic Operation: Solutions with Linear or Sublinear Complexity 1994 5 IEEETPDS Berkey & Wang, A Systolic-Based Parallel Bin Packing Algorithm 1994 5 IEEETPDS Bhagavathi & Looges & Olariu & Schwing & Zhang, A Fast Selection Algorithm for Meshes with Multiple Broadcasting 1994 5 IEEETPDS Shukla & Agrawal, A Framework for Mapping Periodic Real-Time Applications on Multicomputers 1994 5 IEEETPDS Chien & Oruc, Adaptive Binary Sorting Schemes and Associated Interconnection Networks 1994 5 IEEETPDS Agrawal & Ng, Computing Network Flow on a Multiple Processor Pipeline 1994 5 IEEETPDS Guo & Melhem, Embedding Binary X-Trees and Pyramids in Processor Arrays with Spanning Buses 1994 5 IEEETPDS Qiao & Melhem, Reconfiguration with Time Division Multiplexed MIN's for Multiprocessor Communications 1994 5 IEEETPDS Bernhard & Rosenkrantz, Partitioning Message Patterns for Bundled Omega Networks 1994 5 IEEETPDS Soh & Rai & Trahan, Improved Lower Bounds on the Reliability of Hypercube Architectures 1994 5 IEEETPDS Tzeng & Chuang, A Pairwise Substitutional Fault Tolerance Technique for the Cube-Connected Cycles Architecture 1994 5 IEEETPDS Adve & Vernon, Performance Analysis of Mesh Interconnection Networks with Deterministic Routing 1994 5 IEEETPDS Pifarre & Gravano & Felperin & Sanz, Fully Adaptive Minimal Deadlock-Free Packet Routing in Hypercubes, Meshes, and Other Networks: Algorithms and Simulations 1994 5 IEEETPDS Scheiman & Cappello, A Period-Processor-Time-Minimal Schedule for Cubical Mesh Algorithms 1994 5 IEEETPDS Gu & Gu, Algorithms and Average Time Bounds of Sorting on a Mesh-Connected Computer 1993 4 IEEETPDS Shin & Chou, A Simple Distributed Loop-Free Routing Strategy for Computer Communication Networks 1993 4 IEEETPDS Duato, A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks 1993 4 IEEETPDS Chen & Agrawal & Burke, dBCube: A New Class of Hierarchical Multiprocessor Interconnection Networks with Area Efficient Layout 1993 4 IEEETPDS Nassimi, Parallel Algorithms for the Classes of +/- 2^b DESCEND and ASCEND Computations on a SIMD Hypercube 1993 4 IEEETPDS Angelaccio & Colajanni, Unifying and Optimizing Parallel Linear Algebra Algorithms 1993 4 IEEETPDS Jenq & Sahni, Image Shrinking and Expanding on a Pyramid 1993 4 IEEETPDS Serrano & Parhami, Optimal Architectures and Algorithms for Mesh-Connected Parallel Computers with Separable Row/Column Buses 1993 4 IEEETPDS Lin & Ni, Multicast Communication in Multicomputer Networks 1993 4 IEEETPDS Yang & Wang, A New Graph Approach to Minimizing Processor Fragmentation in Hypercube Multiprocessors 1993 4 IEEETPDS Meliksetian & Chen, Optimal Routing Algorithm and the Diameter of the Cube-Connected Cycles 1993 4 IEEETPDS Takesue, A Family of Parallel Prefix Algorithms Embedded in Networks 1993 4 IEEETPDS Gupta & Kumar, The Scalability of FFT on Parallel Computers 1993 4 IEEETPDS Chan & Chin, A Parallel Algorithm for an Efficient Mapping of Grids in Hypercubes 1993 4 IEEETPDS Stamoulis & Tsitsiklis, Efficient Routing Schemes for Multiple Broadcasts in Hypercubes 1993 4 IEEETPDS Ibaraki & Kameda, A Theory of Coteries: Mutual Exclusion in Distributed Systems 1993 4 IEEETPDS Adve & Hill, A Unified Formalization of Four Shared-Memory Models 1993 4 IEEETPDS Oh & Choi, Generalized Measures of Fault Tolerance in n-Cube Networks 1993 4 IEEETPDS Tien & Raghavendra, Algorithms and Bounds for Shortest Paths and Diameter in Faulty Hypercubes 1993 4 IEEETPDS Kim & Prasanna, Latin Squares for Parallel Array Access 1993 4 IEEETPDS Rao & Kumar, On the Efficiency of Parallel Backtracking 1993 4 IEEETPDS Liestman & Richards, Network Communication in Edge-Colored Graphs: Gossiping 1993 4 IEEETPDS Chakraborty & Allison & Ribbens & Watson, The Parallel Complexity of Embedding Algorithms for the Solution of Systems of Nonlinear Equations 1993 4 IEEETPDS Dally & Aoki, Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels 1993 4 IEEETPDS Chan & Chin, Optimal Resilient Distributed Algorithms for Ring Election 1993 4 IEEETPDS El-Amawy, Clocking Arbitrarily Large Computing Structures Under Constant Skew Bound 1993 4 IEEETPDS Lindon & Akl, An Optimal Implementation of Broadcasting with Selective Reduction 1993 4 IEEETPDS Makedon & Symvonis, An Efficient Heuristic for Permutation Packet Routing on Meshes with Low Buffer Requirements 1993 4 IEEETPDS Chan & Lee, Fault-Tolerant Embedding of Complete Binary Trees in Hypercubes 1993 4 IEEETPDS Varvarigos & Bertsekas, Multinode Broadcast in Hypercubes and Rings with Randomly Distributed Length of Packets 1993 4 IEEETPDS Tao & Hartmann, A Novel Concurrent Error Detection Scheme for FFT Networks 1993 4 IEEETPDS Hsu, Fibonacci Cubes--A New Interconnection Topology 1993 4 IEEETPDS Zhu & Ahuja, On Job Scheduling on a Hypercube 1993 4 IEEETPDS Wolf & Dias & Yu, A Parallel Sort Merge Join Algorithm for Managing Data Skew 1993 4 IEEETPDS Pritchard & Nicole, Cube Connected Mobius Ladders: An Inherently Deadlock-Free Fixed Degree Network 1992 3 IEEETPDS Efe, The Crossed Cube Architecture for Parallel Computation 1992 3 IEEETPDS Corbett, Rotator Graphs: An Efficient Topology for Point-to-Point Multiprocessor Networks 1992 3 IEEETPDS Corbett & Scherson, Sorting in Mesh Connected Multiprocessors 1992 3 IEEETPDS Mendia & Sarkar, Optimal Broadcasting on the Star Graph 1992 3 IEEETPDS Scheiman & Cappello, A Processor-Time-Minimal Systolic Array for Transitive Closure 1992 3 IEEETPDS Herlihy & Moss, Lock-Free Garbage Collection for Multiprocessors 1992 3 IEEETPDS Omiecinski & Lin, The Adaptive-Hash Join Algorithm for a Hypercube Multicomputer 1992 3 IEEETPDS Shang & Fortes, On Time Mapping of Uniform Dependence Algorithms into Lower Dimensional Processor Arrays 1992 3 IEEETPDS Olariu & Schwing & Zhang, Optimal Parallel Algorithms for Problems Modeled by a Family of Intervals 1992 3 IEEETPDS Cappello, Correction to ``A Processor-Time-Minimal Systolic Array for Cubical Mesh Algorithms'' 1992 3 IEEETPDS Chen & Huang, Reliability Analysis of Distributed Systems Based on a Fast Reliability Algorithm 1992 3 IEEETPDS Dally, Virtual-Channel Flow Control 1992 3 IEEETPDS Klaiber & Gokhale, Parallel Evaluation of Attribute Grammars 1992 3 IEEETPDS Balbo & Chiola & Bruell & Chen, An Example of Modeling and Evaluation of a Concurrent Program Using Colored Stochastic Petri Nets: Lamport's Fast Mutual Exclusion Algorithm 1992 3 IEEETPDS Cheng & Ibe, Reliability of a Class of Multistage Interconnection Networks 1992 3 IEEETPDS Tong & Kain & Tsai, Rollback Recovery in Distributed Systems Using Loosely Synchronized Clocks 1992 3 IEEETPDS Chen & Wang & Lu, On the Parallel Computation of the Algebraic Path Problem 1992 3 IEEETPDS Cappello, A Processor-Time-Minimal Systolic Array for Cubical Mesh Algorithms 1992 3 IEEETPDS Fiduccia, Bused Hypercubes and Other Pin-Optimal Networks 1992 3 IEEETPDS Kumar & Patnaik, Extended Hypercube: A Hierarchical Interconnection Network of Hypercubes 1991 2 IEEETPDS Padmanabhan, Design and Analysis of Even-Sized Binary Shuffle-Exchange Networks for Multiprocessors 1991 2 IEEETPDS Li & Cheng, Job Scheduling in a Partitionable Mesh Using a Two-Dimensional Buddy System Partitioning Scheme 1991 2 IEEETPDS Olariu & Wen, Optimal Parallel Initialization Algorithms for a Class of Priority Queues 1991 2 IEEETPDS Witte & Chamberlain & Franklin, Parallel Simulated Annealing Using Speculative Computation 1991 2 IEEETPDS Aravena & Barbir, A Class of Low Complexity High Concurrence Algorithms 1991 2 IEEETPDS Bernhard & Rosenkrantz, Using the Dual Path Property of Omega Networks to Obtain Conflict-Free Message Routing 1991 2 IEEETPDS Fan & Cheng, A Generalized Simultaneous Access Dictionary Machine 1991 2 IEEETPDS Barbara & Lipton, A Class of Randomized Strategies for Low-Cost Comparison of File Copies 1991 2 IEEETPDS O'Hallaron, Uniform Approach for Solving Some Classical Problems on a Linear Array 1991 2 IEEETPDS Scherson, Orthogonal Graphs for the Construction of a Class of Interconnection Networks 1991 2 IEEETPDS Kim & Das & Lin, A Top-Down Processor Allocation Scheme for Hypercube Computers 1991 2 IEEETPDS El-Amawy & Latifi, Properties and Performance of Folded Hypercubes 1991 2 IEEETPDS Harper, Block, Multistride Vector, and FFT Accesses in Parallel Memory Systems 1990 1 IEEETPDS Omiecinski, A Parallel Algorithm for Relational Database Normalization 1990 1 IEEETPDS Wang & Chen, Constant Time Algorithms for the Transitive Closure and Some Related Graph Problems on Processor Arrays 1990 1 IEEETPDS Luan & Gligor, A Fault-Tolerant Protocol for Atomic Broadcast 1990 1 IEEETPDS Nishio & Li & Manning, A Resilient Mutual Exclusion Algorithm for Computer Networks 1990 1 IEEETPDS Chen & Shin, Depth-First Search Approach for Fault-Tolerant Routing in Hypercube Multicomputers 1990 1 IEEETPDS Youssef & Narahari, The Banyan-Hypercube Networks 1990 1 IEEETPDS Chen & Chen & Chen & Sheu, Designing Efficient Parallel Algorithms on Mesh-Connected Computers with Multiple Broadcasting 1990 1 IEEETPDS Akl & Meijer, Parallel Binary Search 1990 1 IEEETPDS Helmbold & McDowell, Modeling Speedup (n) Greater than n 1990 1 IEEETPDS Melliar-Smith & Moser & Agrawala, Broadcast Protocols for Distributed Systems 1990 1 IEEETPDS Ibarra & Sohn, On Mapping Systolic Algorithms onto the Hypercube 1990 1 IEEETPDS Lee & Kedem, Mapping Nested Loop Algorithms into Multidimensional Systolic Arrays 1990 1 IEEETPDS Ranka & Sahni, Odd Even Shifts in SIMD Hypercubes 1990 1 IEEETPDS Ryu & Ja'Ja', Efficient Algorithms for List Ranking and for Solving Graph Problems on the Hypercube 1990 1 IEEETPDS Banerjee & Jones & Sargent, Parallel Simulated Annealing Algorithms for Cell Placement on Hypercube Multiprocessors 1993 42 IEEETREL Sankar & Prasad & Rao, Comment on: Enumeration of All Minimal Cutsets for a Node Pair in a Graph 1992 41 IEEETREL Yang, Terminal-Pair Reliability of Tree-Type Computer Communication Networks 1997 13 IEEETROB Tzionas & Thanailakis & Tsalides, Collision-Free Path Planning for a Diamond-Shaped Robot Using Two-Dimensional Cellular Automata 1996 12 IEEETROB Chu & Proth, Single Machine Scheduling with Chain Structured Precedence Constraints and Separation Time Windows 1995 11 IEEETROB Rao & Goldberg, Manipulating Algebraic Parts in the Plane 1995 11 IEEETROB Fijany & Sharf & D'Eleuterio, Parallel O(Log N) Algorithms for Computation of Manipulator Forward Dynamics 1991 7 IEEETROB Dudek & Jenkin & Milios & Wilkes, Robotic Exploration as Graph Construction 1991 7 IEEETROB Schweikard, Polynomial Time Collision Detection for Manipulator Paths Specified by Joint Motions 1989 5 IEEETROB Takahashi & Schilling, Motion Planning in a Plane Using Generalized Voronoi Diagrams 1989 5 IEEETROB Shin & Woo, An Optimal Algorithm for Finding all Visible Edges in a Simple Polygon 1996 22 IEEETSE Ward, Derivation of Data Intensive Algorithms by Formal Transformation: The Schnorr-Waite Graph Marking Algorithm 1996 22 IEEETSE Finney, Mathematical Notation in Formal Specification: Too Difficult for the Masses? 1996 22 IEEETSE Abadi & Needham, Prudent Engineering Practice for Cryptographic Protocols 1996 22 IEEETSE Heintze & Tygar, A Model for Secure Protocols and Their Compositions 1996 22 IEEETSE Reiter, A Secure Group Membership Protocol 1996 22 IEEETSE Gong & Qian, Computational Issues in Secure Interoperation 1996 22 IEEETSE McLean, A General Theory of Composition for a Class of ``Possibilistic'' Properties 1995 21 IEEETSE DeMillo & Mathur & Wong, Some Critical Remarks on a Hierarchy of Fault-Detecting Abilities of Test Methods 1995 21 IEEETSE Frankl & Weyuker, Reply to ``Some Critical Remarks on a Hierarchy of Fault-Detecting Abilities of Test Methods'' 1995 21 IEEETSE Ng & Butler & Kay, An Intelligent Tutoring System for the Dijkstra-Gries Methodology 1995 21 IEEETSE Dolev & Israeli & Moran, Analyzing Expected Time by Scheduler-Luck Games 1994 20 IEEETSE Menasce & Yesha & Kalpakis, On a Unified Framework for the Evaluation of Distributed Quorum Attainment Protocols 1994 20 IEEETSE Flatebo & Datta, Two-State Self-Stabilizing Algorithms for Token Rings 1993 19 IEEETSE Biswas & Browne, Data Structures for Parallel Resource Management 1993 19 IEEETSE Rangarajan & Jalote & Tripathi, Capacity of Voting Systems 1993 19 IEEETSE Gansner & Koutsofios & North & Vo, A Technique for Drawing Directed Graphs 1991 17 IEEETSE Breitbart & Georgakopoulos & Rusinkiewicz & Silberschatz, On Rigorous Transaction Scheduling 1991 17 IEEETSE Vose, A Linear Algorithm For Generating Random Numbers With a Given Distribution 1991 17 IEEETSE Boyd & Ural, On the Complexity of Generating Optimal Test Sequences 1990 16 IEEETSE Goldschlag, Mechanically Verifying Concurrent Programs with the Boyer-Moore Prover 1990 16 IEEETSE Sarkar & Deo, Estimating the Speedup in Parallel Parsing 1990 16 IEEETSE Harel & Lachover & Naamad & Pnueli & Politi & Sherman & Shtull-Trauring & Trakhtenbrot, STATEMATE: A Working Environment for the Development of Complex Reactive Systems 1990 16 IEEETSE Itai & Kutten & Wolfstahl & Zaks, Optimal Distributed t-Resilient Election in Complete Networks 1990 16 IEEETSE Feldman, A New Spectral Test for Nonrandomness and the DES 1990 16 IEEETSE Cordy & Eliot & Robertson, TuringTool: A User Interface to Aid in the Software Maintenance Task 1989 15 IEEETSE Evangelist & Francez & Katz, Multiparty Interactions for Interprocess Communication and Synchronization 1989 15 IEEETSE Brilliant & Knight & Leveson, The Consistent Comparison Problem in N-Version Software 1989 15 IEEETSE Chiou & Chen, Secure Broadcasting Using the Secure Lock 1989 15 IEEETSE Aoe, An Efficient Implementation of Static String Pattern Matching Machines 1989 15 IEEETSE Wegner & Teuhola, The External Heapsort 1989 15 IEEETSE May, The Parallel Assignment Problem Redefined 1989 15 IEEETSE Mills & Basili & Gannon & Hamlet, Mathematical Principles for a First Course in Software Engineering 1989 15 IEEETSE Jacob & Page, Synthesis of Mutual Exclusion Solutions Based on Binary Semaphores 1989 15 IEEETSE Lenders, Distributed Computing with Single Read-Single Write Variables 1989 15 IEEETSE Lakshmanan & Thulasiraman & Comeau, An Efficient Distributed Protocol for Finding Shortest Paths in Networks with Negative Weights 1989 15 IEEETSE Cidon, An Efficient Distributed Knot Detection Algorithm 1989 15 IEEETSE Sidhu & Leung, Formal Methods for Protocol Testing: A Detailed Study 1988 14 IEEETSE Casavant & Kuhl, A Taxonomy of Scheduling in General-Purpose Distributed Computing Systems 1987 13 IEEETSE Freeman, Essential Elements of Software Engineering Education Revisited 1987 13 IEEETSE Ardis, The Evolution of Wang Institute's Master of Software Engineering Program 1987 13 IEEETSE Weiss, Teaching a Software Design Methodology 1987 13 IEEETSE Bentley & Dallen, Exercises in Software Design 1987 13 IEEETSE Burns & Robertson, Two Complementary Course Sequences on the Design and Implementation of Software Products 1987 13 IEEETSE Wortman, Software Projects in an Academic Environment 1987 13 IEEETSE McKeeman, Experience with a Software Engineering Project Course 1987 13 IEEETSE Leventhal & Mynatt, Components of Typical Undergraduate Software Engineering Courses: Results from a Survey 1987 13 IEEETSE Riddle & Williams, Technology Selection: An Educational Approach 1987 13 IEEETSE Lavi & Ben Porat & Ben-David, IAI Corporate Software Engineering Training and Education Program 1987 13 IEEETSE Cherniavsky & Smith, A Recursion Theoretic Approach to Program Testing 1987 13 IEEETSE de Jonge & Tanenbaum & van de Riet, Two Access Methods Using Compact Binary Trees 1987 13 IEEETSE Dalal, A Distributed Algorithm for Constructing Minimal Spanning Trees 1987 13 IEEETSE Moore & Simmons, Cycle Structure of the DES for Keys Having Palindromic (or Antipalindromic) Sequences of Round Keys 1987 13 IEEETSE Millen & Clark & Freedman, The Interrogator: Protocol Security Analysis 1987 13 IEEETSE Meadows & Mutchler, Matching Secrets in the Absence of a Continuously Available Trusted Authority 1978 4 IEEETSE Manna & Waldinger, The Logic of Computer Programming 1997 27 IEEETSMC Siegelmann & Horne & Giles, Computational Capabilities of Recurrent NARX Neural Networks 1997 27 IEEETSMC Oommen & de St. Croix, String Taxonomy Using Learning Automata 1996 26 IEEETSMC Rajaraman & Sastry, Finite Time Analysis of the Pursuit Algorithm for Learning Automata 1995 25 IEEETSMC Elmesbahi & Bouattane & Benabbou, Theta(1) Time Quadtree Algorithm and Its Application for Image Geometric Properties on a Mesh Connected Computer (MCC) 1995 25 IEEETSMC Thathachar & Phansalkar, Convergence of Teams and Hierarchies of Learning Automata in Connectionist Systems 1995 25 IEEETSMC Ranganathan & Mehrotra & Subramanian, A High Speed Systolic Architecture for Labeling Connected Components in an Image 1995 25 IEEETSMC Rouvellou & Hart, Inference of a Probabilistic Finite State Machine from its Output 1995 25 IEEETSMC Hirota & Pedrycz, Design of Fuzzy Systems With Fuzzy Flip-Flops 1995 25 IEEETSMC Bunke & Csirik, Parametric String Edit Distance and its Application to Pattern Recognition 1994 24 IEEETSMC Levine & Kreifeldt, Uniquely Representing Point Patterns with Minimal Information 1994 24 IEEETSMC Rao & Oblow, Majority and Location_Based Fusers for Systems of PAC Concept Learners 1994 24 IEEETSMC Gu & Huang, Efficient Local Search With Search Space Smoothing: A Case Study of the Traveling Salesman Problem (TSP) 1994 24 IEEETSMC Bhandarkar, A Fuzzy Probabilistic Model for the Generalized Hough Transform 1994 24 IEEETSMC Sastry & Phansalkar & Thathachar, Decentralized Learning of Nash Equilibria in Multi-Person Stochastic Games With Incomplete Information 1994 24 IEEETSMC Shasha & Wang & Zhang & Shih, Exact and Approximate Algorithms for Unordered Tree Matching 1994 24 IEEETSMC Stewart & Liaw & White, A Bibliography of Heuristic Search Research Through 1992 1994 24 IEEETSMC Rao & Oblow & Glover & Liepins, N-Learners Problem: Fusion of Concepts 1994 24 IEEETSMC Bhattacharya & Mukherjee, On the Representation of Uncertain Information by Multidimensional Arrays 1993 23 IEEETSMC Lin & Kao & Hsu, Applying the Genetic Approach to Simulated Annealing in Solving Some NP-Hard Problems 1993 23 IEEETSMC Gu, Local Search for the Satisfiability (SAT) Problem 1993 23 IEEETSMC Sastry & Rajaraman & Ranjan, Learning Optimal Conjunctive Concepts through a Team of Stochastic Automata 1992 22 IEEETSMC Kennes, Computational Aspects of the Mobius Transformation of Graphs 1992 22 IEEETSMC Takefuji & Tanaka & Lee, A Parallel String Search Algorithm 1992 22 IEEETSMC Pattipati & Dontamsetty, On a Generalized Test Sequencing Problem 1991 21 IEEETSMC Albus, Outline for a Theory of Intelligence 1991 21 IEEETSMC Messinger & Rowe & Henry, A Divide-and-Conquer Algorithm for the Automatic Layout of Large Directed Graphs 1990 20 IEEETSMC Tatman & Shachter, Dynamic Programming and Influence Diagrams 1989 19 IEEETSMC Hirota & Ozawa, The Concept of Fuzzy Flip Flop 1989 19 IEEETSMC Mukhopadhyay & Thathachar, Associative Learning of Boolean Functions 1989 19 IEEETSMC Arazi & Dinstein & Kafri, Intuition, Perception, and Secure Communication 1989 19 IEEETSMC Ramirez, On Two Nonequivalent Measures of Complexity 1989 19 IEEETSMC Rothstein, Correction to ``Bus Automata, Brains, and Mental Models'' 1988 18 IEEETSMC White, The Limits and Capabilities of Machines--A Review 1988 18 IEEETSMC Battista & Nardelli, Hierarchies and Planarity Theory 1988 18 IEEETSMC Rothstein, Bus Automata, Brains, and Mental Models 1977 7 IEEETSMC Fu & Lu, A Clustering Procedure for Syntactic Patterns 1995 1 IEEETVCG Tal & Dobkin, Visualization of Geometric Algorithms 1994 141 IEEPCDS Pourbigharaz & Yassine, Simple Binary to Residue Transformation with respect to 2^m + 1 1994 141 IEEPCDS Daneshgaran & Yao, Efficient Parallel Pipelinable VLSI Architecture for Finding the Maximum Binary Number 1994 141 IEEPCDS Tan & Song, Improvement on the Diagonal Routing Model 1993 140 IEEPCDS Hiasat, New Designs for a Sign Detector and a Residue to Binary Convertor 1993 140 IEEPCDS Kowalczuk, Discrete Approximation of Continuous-Time Systems: A Survey 1997 144 IEEPCDT Coffey & Saidha, Logic for Verifying Public-Key Cryptographic Protocols 1997 144 IEEPCDT Fenn & Benaissa & Taylor, Dual Basis Systolic Multipliers for GF(2^m) 1997 144 IEEPCDT Tiersma, Enhancing the Security of El Gamal's Signature Scheme 1996 143 IEEPCDT Chen & Yang, Fast Algorithm and its Systolic Realisation for Distance 1996 143 IEEPCDT Panneerselvam & Bandyopadhyay & Jullien, Area Efficient Systolic Interconnection Networks 1996 143 IEEPCDT Bhattacharjee & Sinha & Chattopadhyay & Chaudhuri, Cellular Automata Based Scheme for Solution of Boolean Equations 1996 143 IEEPCDT Lam & Tong, Closed Semiring Connectionist Network for the Bellman-Ford Computation 1996 143 IEEPCDT Lee & Hwang, Modified Harn Signature Scheme Based on Factoring and Discrete Logarithms 1996 143 IEEPCDT de Lima & Kinniment, Hierarchical Placement Method Based on a Force-directed Algorithm with Simultaneous Global Routing for Sea-of-Gates 1996 143 IEEPCDT Paplinski & Bhattacharjee, Hardware Implementation of the Lehmer Random Number Generator 1996 143 IEEPCDT Tu, Comment: Public-Key Cryptosystem Design Based on Factoring and Discrete Logarithms 1996 143 IEEPCDT Hsu, All-Fault-Tolerant Embedding of a Complete Binary Tree in a Group of Cayley Graphs 1995 142 IEEPCDT Chalasani & Boppana, Adaptive Wormhole Routing in Tori with Faults 1995 142 IEEPCDT Ravikumar & Goel, Deadlock-free Wormhole Routing Algorithms for Star Graph Topology 1995 142 IEEPCDT Liu & Wang & Wang & Lee, Design and Hardware Architectures for Dynamic Huffman Coding 1995 142 IEEPCDT Jiang, Novel Design of Arithmetic Coding for Data Compression 1995 142 IEEPCDT Wang & Hwang & Tsai, On the Matsumoto and Imai Human Identification Scheme 1995 142 IEEPCDT Yang & Owens & Irwin, Lower Bound Study on Interconnect Complexity of the Decomposed Finite State Machines 1995 142 IEEPCDT Chen & Chen & Hu, Two Parallel Paths in Incomplete Hypercubes 1995 142 IEEPCDT Wu & Wu, Cheating Detection and Cheater Identification in Secret Sharing Schemes 1995 142 IEEPCDT Lee & Hwang, The Security of He and Kiesler's Signature Schemes 1995 142 IEEPCDT Harn, Enhancing the Security of ElGamal's Signature Scheme 1995 142 IEEPCDT Mao & Boyd, Methodical Use of Cryptographic Transformations in Authentication Protocols 1995 142 IEEPCDT Petlin & Furber & Romankevich & Groll, Designing Asynchronous Sequential Circuits for Random Pattern Testability 1995 142 IEEPCDT Papadimitriou & Maritsas, Self-adaptive Random-Access Protocols for WDM Passive Star Networks 1995 142 IEEPCDT Park & Kyung & Hwang, Efficient State Encoding Algorithm Based on Hypercube Construction 1995 142 IEEPCDT Harn, Efficient Sharing (Broadcasting) of Multiple Secrets 1995 142 IEEPCDT Hamdi & Pan, Efficient Parallel Algorithms on Optically Interconnected Arrays of Processors 1995 142 IEEPCDT Yen & Laith, Fast Algorithms for LUC Digital Signature Computation 1994 141 IEEPCDT Jiang & Jones, Parallel Design of Arithmetic Coding 1994 141 IEEPCDT Srinivasan & Petry, Constant-Division Algorithms 1994 141 IEEPCDT Hsu & Liu, Quick Recovery of Two Embedded Complete Binary Trees in a Hypercube 1994 141 IEEPCDT Walker & Morgan, Pipeline Ring Data-Flow Architecture for Solving Large Iterative Structures 1994 141 IEEPCDT Avedillo & Quintana & Huertas, FSMTEST: Synthesis for Testability and Test Generation of PLA-based FSM 1994 141 IEEPCDT Avedillo & Quintana & Huertas, State Merging and State Splitting via State Assignment: A New FSM Synthesis Algorithm 1994 141 IEEPCDT Yuan, Message Optimal Fully Decentralised Evaluation of Associative and Commutative Functions 1994 141 IEEPCDT Masera & Piccinini & Zamboni, Minimisation of Control Store Width in Digital Systems 1994 141 IEEPCDT He & Kiesler, Enhancing the Security of El Gamal's Signature Scheme 1994 141 IEEPCDT Sun & Lombardi, Design for Testability of Sequential Circuits 1994 141 IEEPCDT Yuan & Tsay, Unified Approach to Designing Parallel Winograd Algorithms 1994 141 IEEPCDT Harn, Public-Key Cryptosystem Design Based on Factoring and Discrete Logarithms 1994 141 IEEPCDT Ziavras & Haravu, Processor Allocation Strategies for Modified Hypercubes 1994 141 IEEPCDT Li & Leung & Lam, Optimised Synthesis of Delay-Insensitive Circuits Using Time-Sharing 1994 141 IEEPCDT Piestrak, Design of Residue Generators and Multioperand Adders Modulo 3 Built of Multioutput Threshold Circuits 1994 141 IEEPCDT Harn & Lin & Yang, Threshold Cryptosystem with Multiple Secret Sharing Policies 1993 140 IEEPCDT Murtagh & Tsoi & Bergmann, Bit-Serial Systolic Array Implementation of a Multilayer Perceptron 1993 140 IEEPCDT Ibrahim, Radix-2^n Multiplier Structures: A Structured Design Methodology 1993 140 IEEPCDT Bhattacharya & Choi & Tsai, Unidirectional Cube Connected Cycles 1993 140 IEEPCDT Wang & Chang & Feng, Binary-Tree Timing Simulation with Consideration of Internal Charges 1993 140 IEEPCDT Truong & Reed & Shih, Efficient Multiplication Algorithm over the Finite Fields GF(q^m) where q = 3, 5 1993 140 IEEPCDT Pan & Chuang, Faster Line Detection Algorithms on Enhanced Mesh Connected Arrays 1994 141 IEEPCMM Al Jabri & Al-Thukair & Mirza, Private-Key Encryption Based on Concatenation of Codes 1994 13 IFIP Yamamoto & Chuang, Physical Limits for Computing and Communication 1994 13 IFIP Drefenstedt & Keller & Paul, Applications of PRAMs in Telecommunications 1994 13 IFIP Guibas, The Design and Analysis of Geometric Algorithms 1994 13 IFIP Hartmanis, The Structure of the Complexity of Computations: A Guided Tour through Complexity Classes 1994 13 IFIP Johnson, The Traveling Salesman Problem: A Report on the State of the Art 1994 13 IFIP Mehlhorn & Naher, The Implementation of Geometric Algorithms 1994 13 IFIP Milner, Computing is Interaction 1994 13 IFIP Valiant, A Computational Model for Cognition 1994 13 IFIP Wigderson, The Wonders of the Digital Envelope -- A Crash Course in Modern Cryptography 1994 13 IFIP Chang & Hsu, Element Perturbation Problems of Optimum Spanning Trees with Two-Parameter Objectives 1994 13 IFIP Gruska & Napoli & Parente, Optimization of Systolic Tree Automata 1994 13 IFIP Iwama & Miyazaki, SAT-Variable Complexity of Hard Combinatorial Problems 1994 13 IFIP Kung & Lin & Hsia, An Object-Oriented Conceptual Model for Information Systems 1994 13 IFIP Li, Lamport's Bakery Algorithm Applied to Loosely-Coupled SCI Platforms 1994 13 IFIP Marco & Morillo, The Use of Elliptic Curves in Smart Cards 1994 13 IFIP Mishra & Raghavan, Design Issues in Randomized Branch and Bound Algorithms: A Study of Graph Partitioning 1994 13 IFIP Miyadera & Tsuchida & Yaku, A Tidy Drawing Problme on the Minimum Area for Tree-Structured Diagrams and Its Application to Program Diagrams 1994 13 IFIP Regan, Linear-Time Algorithms in Memory Hierarchies 1994 13 IFIP Saito & Nakano, Adaptive Concept Learning Algorithm 1994 13 IFIP Ye & Keane, A Fault Tolerant Distributed Termination Detection Scheme 1994 13 IFIP Gruska & Guessarian, Correctness of Basic Systolic Systems Transformations 1994 13 IFIP Kahl, Can Functional Programming Be Liberated from the Applicative Style? 1994 13 IFIP Blass & Gurevich, Evolving Algebras and Linear Time Hierarchy 1994 13 IFIP Anselmo & Restivo, Factorizing Languages 1994 13 IFIP Carton, Chain Automata 1994 13 IFIP Cassaigne, An Algorithm to Test if a Given Circular HD0L-Language Avoids a Pattern 1994 13 IFIP de Luca & Varricchio, On a Conjecture of Brzozowski 1994 13 IFIP Giammarresi & Mantaci & Mignosi & Restivo, A Periodicity Theorem for Trees 1994 13 IFIP Hromkovic & Karhumaki, Two Lower Bounds on Computational Complexity of Infinite Word Generation 1994 13 IFIP Pelletier & Sakarovitch, On the Lexicographic Uniformization of Deterministic 2-tape Automata 1994 13 IFIP Perrin, Automata on Infinite Words 1994 13 IFIP Rubinstein & Shutt, Self-Modifying Finite Automata 1994 13 IFIP Thomas, Finite-State Recognizability and Logic: From Words to Graphs 1994 13 IFIP McColl, Scalable Parallel Computing: A Grand Unified Theory and Its Practical Development 1994 13 IFIP Mohan & Kamakoti & Rangan, Efficient Randomized Parallel Algorithm for the Closest Pair Problem in D-dimension 1994 13 IFIP Danvy, Partial Evaluation for Program Speedups 1994 13 IFIP Gill & Jones, Cheap Deforestation in Practice: An Optimiser for Haskell 1994 13 IFIP Gurevich & Huggins, Evolving Algebras and Partial Evaluation 1994 13 IFIP Heinrich, Complexity Theory and Monte Carlo Algorithms in Numerical Analysis 1994 13 IFIP Jones, Program Speedups in Theory and Practice 1994 13 IFIP Paige, Efficient Translation of External Input in a Dynamically Typed Language 1994 13 IFIP Regan, Linear Speed-Up, Information Vicinity, and Finite-State Machines 1994 13 IFIP Scherlis, Boundary and Path Manipulations on Abstract Data Types 1994 13 IFIP Wasilkowski & Wozniakowski, On Strong Tractability of Multivariate Problems 1992 12 IFIP Reiss, Program Visualization: Where Do We Go From Here 1992 12 IFIP Nakano & Nakajima & Nakakura & Yoshida & Goi & Nakai & Segawa & Kishida, An Accurate, High Speed Implementation of Division by the Quasi-Unity Divisor Method 1992 12 IFIP Stasinski, Reducing Multiplicative Complexity of Polynomial Algebra Algorithms 1992 12 IFIP Chen, Constructing Priority Queues Optimally in Parallel 1992 12 IFIP Hsu & Wang & Wu, Parallel Algorithms for Finding the Most Vital Edge with Respect to Minimum Spanning Tree 1992 12 IFIP Leighton & Maggs, The Role of Randomness in the Design of Interconnection Networks 1992 12 IFIP Wiedermann, Optimal Algorithms for Sorting on Single-tape Turing Machines 1992 12 IFIP Balcazar & Hermo & Mayordomo, Characterizations of Logarithmic Advice Complexity Classes 1992 12 IFIP Iwama & Abeta & Miyano, Random Generation of Satisfiable and Unsatisfiable CNF Predicates 1992 12 IFIP Siegelmann & Sontag & Giles, The Complexity of Language Recognition by Neural Networks 1992 12 IFIP Deng & Papadimitriou, Competitive Distributed Decision-Making 1992 12 IFIP Ye & Keane, Token Scheme: An Algorithm for Distributed Termination Detection 1992 12 IFIP Boissonnat, Some New Research Directions in Robot Motion Planning 1992 12 IFIP El-Dessouki & El-Shishtawy & El-Mahdi, A Path Planning Algorithm for Three Link Manipulator 1992 12 IFIP Hitschfeld & Muller & Fichtner, Generation of 3-D Delaunay Meshes for Complex Geometries Using Iterative Refinement 1992 12 IFIP Machado & Filho, A Generalization of the Maximal Closure of a Digraph 1992 12 IFIP Chang, Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs 1992 12 IFIP Plaza & Ferragut & Montenegro, Derefinement Algorithms of Nested Meshes 1992 12 IFIP Karp, On-Line Algorithms Versus Off-Line Algorithms: How Much is it Worth to Know the Future? 1992 12 IFIP Zhang, Polynomial Algorithms for the k-Chinese Postman Problem 1992 12 IFIP Sung & Hsu & Hwang, Data Structure for Graph Representations of a Network Having Double Euler Tails 1992 12 IFIP Cunto & Kashima & Rey, A New Algorithm for Selecting the Median, Two Quartiles, Minimum and Maximum of a Set of Numbers 1992 12 IFIP Tokuda, An Improved Shellsort 1992 12 IFIP Ur & Trick & Sleator, Analysis of Online Algorithms for Organ Allocation 1992 12 IFIP Baeza-Yates, Text Retrieval: Theory and Practice 1992 12 IFIP Nicodeme, Compact Balanced Tries 1992 12 IFIP Ukkonen, Constructing Suffix Trees On-line in Linear Time 1992 12 IFIP Luo & Reijns, Linear Programming on Transputers 1992 12 IFIP May, General Purpose Parallel Computers 1992 12 IFIP Li, A Deadlock-free Adaptive Routing Algorithm for Direct Binary Hypercubes 1989 11 IFIP Hashigushi, Algorithms for Determining Relative Star Height and Star Height 1989 11 IFIP Micali, ``Perfect'' Pseudo-Random Number Generation 1989 11 IFIP Blum & Raghavan, Program Correctness: Can One Test for It? 1989 11 IFIP Lovasz, Faster Algorithms for Hard Problems 1989 11 IFIP Kumar & Place & Yang, A Superior Algorithm for Mutual Exclusion in Computer Networks - VISHNU 1989 11 IFIP Bhuyan & Deogun & Raghavan, Near-Optimal Algorithms for the Boundary Selection Problem in User-Oriented Information Retrieval 1989 11 IFIP Hemachandra & Wechsung, Using Randomness to Characterize the Complexity of Computation 1989 11 IFIP Krause & Meinel & Waack, Separating Complexity Classes Related to Restricted Logarithmic Space-Bounded Turing Machines 1989 11 IFIP Heintz & Roy & Solerno, On the Complexity of Semialgebraic Sets 1989 11 IFIP Freisleben, Non-Broadcast Communication Schemes for Information Dissemination 1989 11 IFIP Iwama & Kambayashi, An O(log n) Parallel Connectivity Algorithm on the Mesh of Buses 1989 11 IFIP Barachini & Mistelberger & Bahr, A New Method for Parallel Pattern Matching 1989 11 IFIP Smid & Overmars & Torenvliet & van Emde Boas, Multiple Representations of Dynamic Data Structures 1989 11 IFIP Kirschenhofer & Prodinger & Szpankowski, Digital Search Trees - Further Results on a Fundamental Data Structure 1989 11 IFIP Klein & Wood, On Binary Trees 1989 11 IFIP Reif & Sen, Randomized Parallel Algorithms 1989 11 IFIP Muller & Paul, Contributions of Theoretical Computer Science, Applied Computer Science and Numerical Mathematics to the Design of Parallel Computers 1989 11 IFIP Hopfield, The Effectiveness of Neural Computing 1989 11 IFIP Jager & Stickel, Proofs as Advanced and Powerful Tools 1989 11 IFIP Denenberg, Developing Reasoning Skills in College Freshmen Using Computer Programming, Collaborative Problem Solving and Writing 1989 11 IFIP Guessarian, Improving Fixpoint Tools for Computer Science 1989 11 IFIP Padawitz, Proving the Correctness of Schorr-Waite Graph Marking by Inductive Expansion 1983 IFIP Freivalds, Methods and Languages to Prove the Power of Probabilistic Machines 1977 IFIP Freivalds, Probabilistic Machines Can Use Less Running Time 1977 IFIP Hume, Education in Computing Versus User Needs 1977 IFIP Pohl & Shaw, Introducing Computer Science: An Alternative 1974 IFIP Rosenberg, Computed Access in Ragged Arrays 1971 IFIP Traub, Optimal Iterative Processes: Theorems and Conjectures 1965 IFIP Hartmanis & Lewis & Stearns, Classifications of Computations by Time and Memory Requirements 1990 6 IFIPSEC Fumy & Pfau, Asymmetric Authentication Schemes for Smart Cards - Dream or Reality? 1991 1 IJAC Le Saec & Pin & Weil, Semigroups with Idempotent Stabilizers and Applications to Automata Theory 1991 1 IJAC Cohen, Isodiametric and Isoperimetric Inequalities for Group Representations 1991 1 IJAC Gilman, Verifying that a Group is Virtually Free 1991 1 IJAC Burris & Lawrence, Term Rewrite Rules for Finite Fields 1991 1 IJAC Goralcik & Vanicek, Binary Patterns in Binary Words 1991 5 IJAR Lehner, Probabilities and Reasoning About Possibilities 1991 5 IJAR Ruspini, On the Semantics of Fuzzy Logic 1990 4 IJAR Williamson & Downs, Probabilistic Arithmetic. I. Numerical Methods for Calculating Convolutions and Dependency Bounds 1985 9 IJCAI Halpern, A Guide to the Modal Logics of Knowledge and Belief: Preliminary Draft 1992 2 IJCGA Clarkson & Cole & Tarjan, Randomized Parallel Algorithms for Trapezoidal Diagrams 1992 2 IJCGA Hsu & Chang & Lee, Parallel Algorithms for Computing the Closest Visible Vertex Pair Between Two Polygons 1992 2 IJCGA Amato & Preparata, The Parallel 3D Convex Hull Problem Revisited 1992 2 IJCGA Guha, Parallel Computation of Internal and External Farthest Neighbours in Simple Polygons 1992 2 IJCGA Chandran & Mount, A Parallel Algorithm for Enclosed and Enclosing Triangles 1992 2 IJCGA O'Rourke, Computational Geometry Column 15 (open ``art gallery'' problems) 1982 11 IJCIS Motzkin & Hansen, An Efficient External Sorting with Minimal Space Requirement 1981 10 IJCIS Lewis, Stateless Turing Machines and Fixed Points 1992 43 IJCM Chang, A Fast Algorithm to Retrieve Symbolic Pictures 1992 43 IJCM Moriya, Closure Properties of Subclasses of omega-Regular Languages Under Morphism and Inverse Morphism 1992 43 IJCM De Matteis & Pagnutti, Critical Distances in Pseudorandom Sequences Generated with Composite Moduli 1992 43 IJCM Gusev & Evans & Tasic, Fast Linear Systolic Matrix Vector Multiplication 1992 43 IJCM Mahajan & Krithivasan, Some Results on Time-Varying and Relativised Cellular Automata 1992 43 IJCM Makinen, On Drawing Regular Bipartite Graphs 1992 43 IJCM Ho & Yang & Hsu, Performance Analysis of Stack Space Allocation Based Upon Random Walk Model 1992 43 IJCM Tiplea, Selective Petri Net Languages 1992 42 IJCM Stojmenovic, On Random and Adaptive Parallel Generation of Combinatorial Objects 1992 42 IJCM Lee & Chang, Covering Grid Points in a Convex Polygon with Straight Lines 1992 42 IJCM Gupta, Generation of Binary Trees from (0-1) Codes 1992 42 IJCM Chen & Rokne, The Convex Hull of a Set of Convex Polygons 1992 42 IJCM Csuhaj-Varju & Dassow & Kelemen, On Cooperating/Distributed Grammar Systems with Different Styles of Acceptance 1992 42 IJCM Chen, An O(1) Time Algorithm for String Matching 1992 42 IJCM Essert, The Algorithm for Elimination of Isomorphic Orbital Structures 1992 42 IJCM Prasad & Patnaik & Murthy, An Optimal Parallel Algorithm for Sparse Matrix Bandwidth Reduction on a Linear Array 1992 42 IJCM Zimmermann & Salamon, The Demon Algorithm 1992 42 IJCM Tseng & Yang, 2D Random Filter and Analysis 1992 42 IJCM Jin & Cahn, A Genetic Approach for Network Partitioning 1992 42 IJCM Olariu & Wen, An Optimal Parallel Algorithm to Construct a Deap 1992 41 IJCM Chen, ZIPF-Halstead's Theory of Software Metrication 1992 41 IJCM Vela & Bahamonde, An Algorithm to Minimize Representations of Finite Order Relations 1992 41 IJCM Dhrif & Sarkar, Systolic Algorithms for the Dynamic Programming Problem 1992 41 IJCM Rosen & Sun & Xue, On a New Algorithm for Stable Assignment 1992 41 IJCM Zhang, Introducing Data Types in Intuitionistic Type Theory 1992 41 IJCM Evans & Margaritis, A Re-Usable Systolic Array for Matrix-Vector Multiplication 1992 41 IJCM Wu & Chang, A Password Authentication Scheme Based on Discrete Logarithms 1992 41 IJCM Chen & Liu, Optimal Multiway Generalized Split Trees 1992 41 IJCM Link & Olariu, A Simple NC Recognition Algorithm for Welsh-Powell Opposition Graphs 1991 40 IJCM Rao & Sridhar & Iyengar, An O(n log n) Set Refinement Algorithm with Applications 1991 40 IJCM Koc, High-Radix and Bit Recoding Techniques for Modular Exponentiation 1991 40 IJCM Ito & Katsura, Context-Free Languages Consisting of Non-Primitive Words 1991 40 IJCM Yao, Simulated Annealing with Extended Neighbourhood 1991 40 IJCM Pan, An Improved Election Algorithm in Chordal Ring Networks 1991 40 IJCM Lin & Tseng, Some Results of the Relocation Problems with Processing Times and Deadlines 1991 40 IJCM Jurgensen & Yu, Relations on Free Monoids, Their Independent Sets, and Codes 1991 40 IJCM Watjen, Restriction of Active Symbols in k-Limited ET0L Systems and a Normal Form Theorem 1991 40 IJCM Eldridge, A Faster Modular Multiplication Algorithm 1991 40 IJCM Levene & Loizou, A Domain Theoretic Characterisation of the Universal Relation 1991 40 IJCM Asveld & Hogendorp, On the Generating Power of Regularly Controlled Bidirectional Grammars 1991 39 IJCM van Zanten, An Iterative Optimal Algorithm for the Generalized Tower of Hanoi Problem 1991 39 IJCM Ancona & Bruzzone & De Floriani, Using Structured Steiner Trees for Hierarchical Global Routing 1991 39 IJCM Hoffmann & Salamon, Simulated Annealing for Single Minimum Optimization Problems 1991 39 IJCM Evans & Sanossian, Back Propagation Architecture for Computing Visual Depth 1991 39 IJCM Tan, Stable Matchings and Stable Partitions 1991 39 IJCM Walter, Fast Modular Multiplication Using 2-Power Radix 1991 39 IJCM Milani, On the Descriptive Power of Simple Precedence Grammars 1991 39 IJCM Yao & Rokne, A Straightforward Algorithm for Computing the Medial Axis of a Simple Polygon 1991 39 IJCM Olariu & Wen, Merging Heaps in Parallel 1991 38 IJCM Evans & Megson, A Systolic Simplex Algorithm 1991 38 IJCM Gupta, On the Generation of P-Sequences 1991 38 IJCM Andersson, Maintaining alpha-Balanced Trees by Partial Rebuilding 1991 38 IJCM Lin, Parallel Permutation Generation on Linear Array 1991 38 IJCM Li & Cheng, Worst Case Performance Analysis of the Two Dimensional Binary Buddy System 1991 38 IJCM Zhang & Rao, Heuristic Tree Search with Nonparametric Statistical Inference Methods 1991 38 IJCM Kuo & Tseng, Stable Matching with Special Preference Patterns 1991 38 IJCM Pardalos & Desai, An Algorithm for Finding a Maximum Weighted Independent Set in an Arbitrary Graph 1990 37 IJCM Makinen, Experiments on Drawing 2-Level Hierarchical Graphs 1990 37 IJCM Muller, Symmetric Connection Problems and their Solution by Bidirectional Search 1990 37 IJCM Liang, Friedman's Question: Detectability of Bridging Faults in Irredundant Computational Logic Networks 1990 37 IJCM Tollis, Wiring Layouts in the Tri-Hexagonal Grid 1990 37 IJCM Huang & Chin, Mathematical Studies on a Transaction's Waits and Deadlocks in a 2PL Environment 1990 37 IJCM Cho & Huynh, The Complexity of Membership for Deterministic Growing Context-Sensitive Grammars 1990 37 IJCM Dassow & Jurgensen & Rulling, Information Transmission in IL Systems 1990 37 IJCM Evans & Margaritis, Systolic Networks for Iterative Methods for Linear Equations with Cyclic Reduction, II 1990 37 IJCM Smit, The Permutation Rank of an Automaton II 1990 37 IJCM Forys & Head, The Poset of Retracts of a Free Monoid 1990 37 IJCM Datta & Srikant & Krithivasan, Fast Sequential and Parallel Algorithms for Finding the Largest Rectangle Separating Two Sets 1990 36 IJCM Huang & Chan, A New Algorithm for Stable Assignments 1990 36 IJCM Aoe, A Practical Method for Compressing Sparse Matrices with Variant Entries 1990 35 IJCM Olariu, Constructing Bimodal Convex Hexagons 1990 35 IJCM Nistal & Martin, Naturality of the Conditional and the Recursion 1990 35 IJCM Zhang, An Equivalence Relation on Suffix Codes Defined by Generalized Regular Languages 1990 35 IJCM Nivat & Saoudi & Dare, Parallel Generation of Infinite Images 1990 35 IJCM Eldin & Evans, Finite Element Software for Mini-Computers 1990 35 IJCM Dassow & Watjen, On the Relations Between the Degree of Synchronization and the Degree of Nondeterminism in k-Limited T0L Systems 1990 35 IJCM Liang, A Theory of Boolean Integration 1990 35 IJCM Hogendorp, Time-Bounded Controlled Bidirectional Grammars 1990 35 IJCM Fellah & Jurgensen & Yu, Constructions for Alternating Finite Automata 1990 34 IJCM Olariu, A Simple Linear-Time Algorithm for Computing the Center of an Interval Graph 1990 34 IJCM Edelsbrunner & Overmars & Welzl & Hartman & Feldman, Ranking Intervals Under Visibility Constraints 1990 34 IJCM Yan, Foundations of Declarative Testing in Arbitrary Logic Programming 1990 34 IJCM Ito & Tanaka, Dense Property of Initial Literal Shuffles 1990 34 IJCM Batagelj & Pisanski & Simoes-Pereira, An Algorithm for Tree-Realizability of Distance Matrices 1990 34 IJCM Makinen, How to Draw a Hypergraph 1990 34 IJCM Paun & Santean, Further Remarks on Parallel Communicating Grammar Systems 1990 34 IJCM Mahmoud & Fahmy, A Tabular Method for the Analysis of Large Petri Nets 1990 34 IJCM Jackson & Ramanan, An Efficient Algorithm for a Special Case of the Set Partition Problem 1990 34 IJCM Cole, An Algorithm for Assigning Multiplexor Inputs 1990 34 IJCM Varadharajan, A Mathematical Model for System Design and Refinement 1990 34 IJCM Glinos & Nakos, An Application of Computer Algebra to Algebraic Topology 1990 34 IJCM Meira & Motz & Tepedino, A Formal Semantics for SQL 1990 34 IJCM Essert, An Efficient Algorithm for Saving Ordered Sets in a Compacted Form 1990 33 IJCM Walter & Eldridge, A Verification of Brickell's Fast Modular Multiplication Algorithm 1990 33 IJCM Pardalos & Phillips, A Global Optimization Approach for Solving the Maximum Clique Problem 1990 33 IJCM Evans & Margaritis, Systolic Designs for the Calculation of the Eigenvalues and Eigenvectors of a Symmetric Tridiagonal Matrix 1990 33 IJCM Xue-Miao, A Loopless Approach to the Multipeg Towers of Hanoi 1990 33 IJCM Aoe, A Compact Representation of Hierarchical Relations Using Decimal Notations 1990 33 IJCM Bhattacharya, Decomposition of De Bruijn Graphs 1990 32 IJCM Sridhar, Augmenting the Aho-Corasick Pattern Matching Machine 1990 32 IJCM Joe, On the Correctness of a Linear-Time Visibility Polygon Algorithm 1990 32 IJCM Srikant, A Parallel Algorithm for the Minimization of Finite State Automata 1990 32 IJCM Morhac, Precise Multidimensional Deconvolution Using the Polynomial Algebra Concept 1990 32 IJCM Wu, Maximizing the Number of Spanning Trees on the (P,P+2) Graphs 1990 32 IJCM Chao & Zhang, On Partitions of Functions on Finite Sets 1990 32 IJCM Dobosiewicz, A More Efficient Algorithm for the Min-Plus Multiplication 1990 32 IJCM Miguet & Robert, Path Planning on a Ring of Processors 1989 30 IJCM Olariu, A Simple NC Algorithm to Recognize Weakly Triangulated Graphs 1989 30 IJCM Chiou & Lin & Yang, On the Fast Generation of Base-K Logarithm 1989 30 IJCM Wang & Chang, An Upper Bound for the Average Length of the Euclidean Minimum Spanning Tree 1989 30 IJCM Marcu, Note on the Edge Rotation Distance between Trees 1989 30 IJCM Atanasiu & Mitrana, The Modular Grammars 1989 30 IJCM Ito & Jurgensen & Shyr & Thierrin, n-Prefix-Suffix Languages 1989 30 IJCM Megson & Evans, On Systolic Arrays for Complex Matrix Problems 1989 IJCM Ishizaka, Inductive Inference of Regular Languages Based on Model Inference 1989 IJCM Wilson, Algorithms for Obtaining Normal Forms of Logical Expressions 1989 IJCM Dhamdhere, A New Algorithm for Composite Hoisting and Strength Reduction Optimisation (+ Corrigendum) 1989 29 IJCM Tseng & Wang, Maximizing the Number of Spanning Trees of Networks Based on Cycle Basis Representation 1989 29 IJCM Tuza, Langford Strings are Square-free 1989 29 IJCM Zuidweg, Decision Procedures and Graph Reductions for Bisimulation Equivalences: Part 1 1989 29 IJCM Zuidweg, Decision Procedures and Graph Reductions for Bisimulation Equivalences: Part 2 1989 29 IJCM Er, Efficient Enumeration of Cyclic Permutations in situ 1989 29 IJCM Harary & Hayes, On Meshy Trees 1989 29 IJCM Kimble, Observations on the Generation of Permutations from Random Sequences 1989 28 IJCM Nirmal, Indian Parallelism on Unary 0L Systems 1989 28 IJCM Hwang, On Classical and Modern Marriage Problems 1989 28 IJCM Bermudez, LAR(M,C,L) Grammars 1989 28 IJCM Tseng & Wang, Maximizing the Number of Spanning Trees of Networks Based on Cycle Basis Representation 1989 28 IJCM Chan, A Statistical Analysis of the Towers of Hanoi Problem 1989 28 IJCM Beleage & Pallo, A Decidable Word Problem Without Equivalent Canonical Term Rewriting System 1989 28 IJCM Mulder & Von Solms, The Object-Oriented Paradigm and Automata Theory 1989 28 IJCM Marcus, Generalized Langford Languages 1989 28 IJCM Yan, Completeness of a Top-Down Declarative Error Diagnoser 1989 27 IJCM Katajainen & Koppinen & Leipala & Nevalainen, Divide and Conquer for the Closest-Pair Problem Revisited 1989 27 IJCM Denninghoff & Gatterdam, On the Undecidability of Splicing Systems 1989 27 IJCM Das & Deo, Parallel Coloring of Graphs: Two Approximate Algorithms 1989 27 IJCM Hogendorp, Controlled Bidirectional Grammars 1989 26 IJCM Sharma & Yen, Boundedness, Hierarchy of Fairness, and Communication Networks with Delay 1989 26 IJCM Marcus & Paun, Langford Strings, Formal Languages and Contextual Ambiguity 1989 26 IJCM Salomaa, Hierarchy of k-Context-Free Languages, Part 2 1989 26 IJCM Hartley, Reassembling Polygons from Edges 1989 26 IJCM Salomaa, Hierarchy of k-Context-Free Languages: Part 1 1989 26 IJCM Tsomokos, K-Sigma-Treeautomata and Their Relation to Weighted Context-Free Grammars 1988 26 IJCM Li, Immunity, Simplicity, Probabilistic Complexity Classes and Relativizations 1988 26 IJCM Pandu Rangan & Meenakshi, Matrix Transposition in a Magnetic Bubble Memory 1988 26 IJCM Makinen, Two Complexity Measures for Context-Free Languages 1988 26 IJCM Gault & Clint, ``Curiouser and Curiouser'' said Alice. Further Reflections on an Interesting Recursive Function 1988 25 IJCM Evans, Systolic Algorithms 1988 25 IJCM Bitz & Kung, Path Planning on the Warp Computer: Using a Linear Systolic Array in Dynamic Programming 1988 25 IJCM Margaritis & Evans, A Systolic Ring Architecture for Solving Polynomial Equations 1988 25 IJCM McEvoy & Dew, The Cut Theorem--A Tool for Design of Systolic Algorithms 1988 25 IJCM Evans & Megson, Compact Systolic Arrays for Incomplete Matrix Factorisation Methods 1988 25 IJCM Cosnard & Robert, Systolic Givens Factorization of Dense Rectangular Matrices 1988 25 IJCM Bekakos & Evans, Systolic LU-Factorization ``Dequeues'' for Tridiagonal Systems 1988 25 IJCM Megson & Evans, Triangular Systolic Arrays for Matrix Product and Factorisation 1988 25 IJCM Evans & Margaritis, Systolic Computation of the Matrix Exponential and Other Matrix Functions 1988 25 IJCM Sarkar & Guha, A Fast Distributed Deadlock-Detection Algorithm for Hypercube 1988 25 IJCM Chaudhuri & Thakur, A Graph-Theoretic Multiple Logic Fault Analysis through Petri-Nets 1988 25 IJCM Amir & Kaplan, Relocation Problems are Hard 1988 25 IJCM Harary & Lewinter, Spanning Subgraphs of a Hypercube III: Meshes 1988 25 IJCM Nirmal & Rama, Fairness on Synchronized E0L Array Systems 1988 25 IJCM Shuhua & Lian, The Complexity of Computing the Automorphism Group of Automata and Related Problems 1988 24 IJCM Das, Wheel-Augmented Binary Trees 1988 24 IJCM Makino, An Algorithm for Finding all the k-Components of a Digraph 1988 24 IJCM Krithivasan & Srinivasan, Time Varying Pushdown Automata 1988 24 IJCM Bermudez & Schimpf, A General Model for Fixed Look-Ahead LR Parsers 1988 24 IJCM Higgins, Embedding Recursive Functions in Universal Algorithms 1988 24 IJCM Yokomori, Inductive Inference of Context-free Languages Based on Context-free Expressions 1988 24 IJCM Tucci, A Note on the Decomposition of Infinite Automata 1988 24 IJCM Lu Xue-Miao, Towers of Hanoi Problem with Arbitrary k >= 3 Pegs 1988 23 IJCM Yang & Wang & Lee & Boesch, The Number of Spanning Trees of the Regular Networks 1988 23 IJCM Varadharajan, Cryptosystems Based on Permutation Polynomials 1988 23 IJCM Turakainen, On Some Transducer Equivalence Problems for Families of Languages 1988 23 IJCM Marola, An Algorithm for Finding the Number of (0,1,2,...,l)-Matrices with Prefixed Row Sum and Column Sum Vectors 1988 23 IJCM Smit, The Permutation Rank of an Automaton I 1987 23 IJCM Er, Lexicographic Enumeration, Ranking and Unranking of Permutations of r out of n Objects 1987 23 IJCM King & Jarratt, An Algebra to Represent Security Policies for Cryptography-Based Secure Storage Systems 1987 23 IJCM Artemi, The Knaster-Tarski Fixed-Point Theorem is not Uniformly Constructive 1987 23 IJCM Rees, Notations and Computability 1987 22 IJCM Chaudhuri, An O(log n) Parallel Algorithm for Strong Connectivity Augmentation Problem 1987 22 IJCM Mason, Dynamic Template Translators--A New Device for Specifying Programming Languages 1987 22 IJCM Ratoandromanana, Quotient and bounded Context-Free Languages 1987 22 IJCM Balanescu & Gheorghe & Paun, Three Variants of Apical Growth Filamentous Systems 1987 22 IJCM Yousif & Evans, Merging by the Parallel Binary Search Algorithm 1987 22 IJCM Er, On Enumerating Tree Permutations in Natural Order 1987 22 IJCM Tsai & Chin, A Study of Some Addition Chain Problems 1987 22 IJCM Lee & Chwa, A New Triangulation-Linear Class of Simple Polygons 1987 22 IJCM Honkala, It is Decidable Whether or Not a Permutation-Free Morphism is an L Code 1987 22 IJCM Culik & Yu, Fault-Tolerant Schemes for Some Systolic Systems 1987 22 IJCM Evans & Margaritis, Systolic Designs for the Root-Squaring Method 1987 22 IJCM Datta, On the Parallel Arithmetic Complexity of the Root-Finding Problem 1987 21 IJCM Francis, The Stability of Marriage and University Admissions--Zero-One Programming Method 1987 21 IJCM Er, Counter Examples to Adjudicating a Towers of Hanoi Contest 1987 21 IJCM Pallo, Generating Trees with n Nodes and m Leaves 1987 21 IJCM Hartley, Reporting Intersections of Polygons 1987 21 IJCM Mateescu & Paun, On States Observability in Deterministic Finite Automata 1986 20 IJCM Fenner & Loizou, A Study of Binary Tree Traversal Algorithms and a Tag-free Threaded Representation 1986 20 IJCM Culik & Yu & Ibarra, Iterative Tree Arrays with Logarithmic Depth 1986 20 IJCM Zhang, Efficient Parallel Algorithms for Breadth First Spanning Forests of General Graphs 1986 20 IJCM Hwang, The Algebra of Stable Marriages 1986 20 IJCM Ramarao, A Simple Variant of Node Connectivity is NP-Complete 1986 20 IJCM Evans & Bekakos, On the Implementation of Acousto-optic Cells for a ``Rotating'' and ``Folding'' Algorithm Systolization 1986 20 IJCM Er, A Loopless Approach for Constructing a Fastest Algorithm for the Towers of Hanoi Problem 1986 19 IJCM Asveld, Complete Symmetry in D2L Systems and Cellular Automata 1986 19 IJCM Klein, Direct Dominance of Points 1986 19 IJCM Burton & Campbell, A Curious Recursive Function 1986 19 IJCM Batagelj, On the Balanced Divide and Conquer Equation 1986 19 IJCM Sastry & Murthy, On the Number of Keys in Minimal 2-3 Brother Trees 1986 19 IJCM Butrick, A Complete System Generation Algorithm for List Structures 1986 19 IJCM Dobosiewicz, Optimal Binary Search Trees 1986 19 IJCM Kim & Chwa, Parallel Algorithms for a Depth First Search and a Breadth First Search 1986 19 IJCM Krithivasan & Das, Time Varying Finite Automata 1986 19 IJCM Varadharajan, Use of Trapdoor Structures in Cryptography 1986 19 IJCM Xuemiao, Towers of Hanoi Graphs 1974 4 IJCM Ibarra & Melson, Some Results Concerning Automata on Two-Dimensional Tapes 1991 7 IJCV Nelson, Introduction: Vision as Intelligent Behavior--An Introduction to Machine Vision Research at the University of Rochester 1991 7 IJCV Swain & Ballard, Color Indexing 1991 7 IJCV Nelson, Qualitative Detection of Motion by a Moving Observer 1991 7 IJCV Rimey & Brown, Controlling Eye Movements with Hidden Markov Models 1991 7 IJCV Olson & Coombs, Real-Time Vergence Control for Binocular Robots 1991 1 IJDCC Tietavainen, Covering Radius and Dual Distance 1991 1 IJDCC LaMacchia & Odlyzko, Computation of Discrete Logarithms in Prime Fields 1996 7 IJFCS Wong, An Algorithm for Finding a Maximum Cycle of Bipartite Graphs with Large Degrees 1996 7 IJFCS Kobayashi & Yokomori, Families of Noncounting Languages and Their Learnability from Positive Data 1996 7 IJFCS Macarie, A Note of Multihead Finite-State Automata 1996 7 IJFCS Agrawal & Venkatesh, On the Isomorphism Conjecture for 2-DFA Reductions 1996 7 IJFCS Klostermeyer, Scheduling Two Salesmen in a Network 1996 7 IJFCS Plaza, On the Propositional SLDNF-Resolution 1996 7 IJFCS Viksna, Inductive Inference of Limiting Programs with Bounded Number of Mind Changes 1996 7 IJFCS Orlandic & Mahmoud, Storage Overhead of O-Trees, B-Trees and Prefix B-Trees: A Comparative Analysis 1996 7 IJFCS Chen & Schott, Optimal Operations on Red-Black Trees 1996 7 IJFCS Caporaso, Safe Turing Machines, Grzegorczyk Classes and Polytime 1996 7 IJFCS Breveglieri & Cherubini & Citrini & Reghizzi, Multi-Push-Down Languages and Grammars 1996 7 IJFCS Prodinger, Depth and Path Length of Heap Ordered Trees 1996 7 IJFCS Ripphausen-Lipa & Wagner & Weihe, Linear-Time Algorithms for Disjoint Two-Face Paths Problems in Planar Graphs 1996 7 IJFCS Kloks, Treewidth of Circle Graphs 1996 7 IJFCS Das & Heffernan, Constructing Degree-3 Spanners with Other Sparseness Properties 1996 7 IJFCS Fleischer, A Simple Balanced Search Tree with O(1) Worst-Case Update Time 1996 7 IJFCS Ruohonen, An Effective Cauchy-Peano Existence Theorem for Unique Solutions 1996 7 IJFCS Greenlaw, Subtree Isomorphism is in DLOG for Nested Trees 1996 7 IJFCS Larsen & Fagerberg, Efficient Rebalancing of B-Trees with Relaxed Balance 1996 7 IJFCS Sankoff & Sundaram & Kececioglu, Steiner Points in the Space of Genome Rearrangements 1996 7 IJFCS Agarwala & Fernandez-Baca, Simple Algorithms for Perfect Phylogeny and Triangulating Colored Graphs 1996 7 IJFCS Furer & Miller, Alignment-to-Alignment Editing with ``Move Gap'' Operations 1996 7 IJFCS Zhang & Wang & Shasha, On the Editing Distance Between Undirected Acyclic Graphs 1996 7 IJFCS Hanks & Cytron & Gillett, On Finding Topologically Valid Matchings in Restriction-Fragment Maps 1996 7 IJFCS Duval & Smyth, Covering a Circular String with Substrings of Fixed Length 1995 6 IJFCS Szwast, A Note on the Asymptotic Probabilities of Existential Second-Order Minimal Godel Sentences with Equality 1995 6 IJFCS Castellani, Observing Distribution in Processes: Static and Dynamic Localities 1995 6 IJFCS Dubacq, How to Simulate Turing Machines by Invertible One-Dimensional Cellular Automata 1995 6 IJFCS Hemaspaandra & Hoene & Naik & Ogihara & Selman & Thierauf & Wang, Nondeterministically Selective Sets 1995 6 IJFCS Raja & Shyamasundar, The Quine-Bernays Combinatory Calculus 1995 6 IJFCS Slobodova, On the Power of One-Way Globally Deterministic Synchronized Alternating Turing Machines and Multihead Automata 1995 6 IJFCS Hayashi & Kobayashi, A New Formalization of Feferman's System of Functions and Classes and Its Relation to Frege Structure 1995 6 IJFCS Kameyama, A Type-Free Theory of Half-Monotone Inductive Definitions 1995 6 IJFCS Smith, Hybrid Partial-Total Type Theory 1995 6 IJFCS Mason & Talcott, Reasoning About Object Systems in VTLoE 1995 6 IJFCS Beeson, Using Nonstandard Analysis to Ensure the Correctness of Symbolic Computations 1995 6 IJFCS Bloom & Esik, Some Equational Laws of Initiality in 2CCC's 1995 6 IJFCS Besnard & Kohlas, Evidence Theory Based on General Consequence Relations 1995 6 IJFCS Arvind & Kobler & Schuler, On Helping and Interactive Proof Systems 1995 6 IJFCS Clementi & Di Ianni, Optimum Schedule Problems in Store and Forward Networks 1995 6 IJFCS Peng & Iyer, A New Type of Pushdown Automata on Infinite Trees 1995 6 IJFCS Baeza-Yates & Poblete, Higher-Order Analysis of 2-3 Trees 1995 6 IJFCS Musikaev & Taitslin, Flat Backtracking Prolog for Databases: A Formal Semantics, the Computational Complexity and the Expressibility 1995 6 IJFCS Hintikka & Sandu, What is the Logic of Parallel Processing? 1995 6 IJFCS Monserrat & Rossello & Torrens, When is a Category of Many-Sorted Partial Algebras Cartesian-Closed? 1995 6 IJFCS Haralambides & Tragoudas, Bipartitioning into Overlapping Sets 1995 6 IJFCS Jain, An Infinite Class of Functions Identifiable Using Minimal Programs in All Kolmogorov Numberings 1994 5 IJFCS Trahan & Vedantham, Analysis of PRAM Instruction Sets from a Log Cost Perspective 1994 5 IJFCS Maelbrancke & Olivie, Dynamic Tree Rebalancing Using Recurrent Rotations 1994 5 IJFCS Leung & Yu, Heuristic for Minimizing the Number of Late Jobs on Two Processors 1994 5 IJFCS Yen & Wang & Yang, Some Complexity Results for Rings of Petri Nets 1994 5 IJFCS Cai, Computing Jordan Normal Forms Exactly for Commuting Matrices in Polynomial Time 1994 5 IJFCS Ogihara, On Serializable Languages 1994 5 IJFCS Duris & Rolim, Conjunctive and Disjunctive Reducibilities to Sparse and Tally Sets Revisited 1994 5 IJFCS Lieberherr & Xiao, Customizing Adaptive Software to Object-Oriented Software Using Grammars (Erratum) 1994 5 IJFCS Khoong & Leong, Relaxed Inorder Heaps 1994 5 IJFCS Carpentieri & Storer, Optimal Inter-Frame Alignment for Video Compression 1994 5 IJFCS Sanchis, Constructing Language Instances Based on Partial Information 1994 5 IJFCS Tatsuta, Two Realizability Interpretations of Monotone Inductive Definitions 1994 5 IJFCS Tel, Network Orientation 1994 5 IJFCS Bodlaender, On Disjoint Cycles 1994 5 IJFCS Culik & Karhumaki, Iterative Devices Generating Infinite Words 1994 5 IJFCS Chen & Ni, On the Average Altitude of Heap-Ordered Trees 1993 4 IJFCS Jansen, Scheduling of Incompatible Jobs on Unrelated Machines 1993 4 IJFCS Vollmer & Wagner, The Complexity of Finding Middle Elements 1993 4 IJFCS Lai & Wood, A Top-Down Updating Algorithm for Weight-Balanced Trees 1993 4 IJFCS Symvonis & Tragoudas, Searching a Pseudo 3-Sided Solid Orthoconvex Grid 1993 4 IJFCS Vincent & Srinivasan, Redundancy and the Justification for Fourth Normal Form in Relational Databases 1993 4 IJFCS Nakano & Nishizeki, Scheduling File Transfers Under Port and Channel Constraints 1993 4 IJFCS Stewart, On Two Approximation Algorithms for the Clique Problem 1993 4 IJFCS Ibarra & Jiang & Tran & Wang, On the Equivalence of Two-Way Pushdown Automata and Counter Machines Over Bounded Languages 1993 4 IJFCS Dickerson, General Polynomial Decomposition and the s-1-Decomposition are NP-Hard 1993 4 IJFCS Lange & Zeugmann, Learning Recursive Languages with Bounded Mind Changes 1993 4 IJFCS Diks & Garrido & Lingas, Parallel Algorithms for Finding Maximal k-Dependent Sets and Maximal f-Matchings 1993 4 IJFCS Olariu & Stewart, A New Characterization of Unbreakable Graphs 1993 4 IJFCS Kamareddine & Nederpelt, On Stepwise Explicit Substitution 1993 4 IJFCS Lisitsa, Complexity of Universal Circumscription 1993 4 IJFCS Hemaspaandra & Jain & Vereshchagin, Banishing Robust Turing Completeness 1993 4 IJFCS Melnikov, The Equality Condition for Infinite Catenations of Two Sets of Finite Words 1992 3 IJFCS Droste, Concurrent Automata and Domains 1992 3 IJFCS Blanchet-Sadri, The Dot-Depth of a Generating Class of Aperiodic Monoids is Computable 1992 3 IJFCS Mukund, Petri Nets and Step Transition Systems 1992 3 IJFCS Ottmann & Wood, Updating Binary Trees with Constant Linkage Cost 1992 3 IJFCS Saoudi & Muller & Schupp, Finite State Processes, Z-Temporal Logic and the Monadic Theory of the Integers 1992 3 IJFCS Bloom & Esik, Iteration Algebras 1992 3 IJFCS Krishnan, A Calculus of Timed Communicating Systems 1992 3 IJFCS Cheng & Hwang & Akyildiz & Hsu, Routing Algorithms for Double Loop Networks 1992 3 IJFCS Pym, A Unification Algorithm for the lambda Pi-Calculus 1992 3 IJFCS Antonelli & Pelagatti, On the Complexity of the Mapping Problem for Massively Parallel Architectures 1992 3 IJFCS Lodaya & Ramanujam & Thiagarajan, Temporal Logics for Communicating Sequential Agents: I 1992 3 IJFCS Stolboushkin, On the Computing Power of Programs with Sets 1992 3 IJFCS Bertoni & Massazza & Sabadini, Holonomic Generating Functions and Context Free Languages 1992 3 IJFCS van der Hoek & Meyer, Making Some Issues of Implicit Knowledge Explicit 1992 3 IJFCS Oles, When is a Category of Many-Sorted Algebras Cartesian Closed? 1992 3 IJFCS Olariu & Schwing & Zhang, Optimal Parallel Encoding and Decoding Algorithms for Trees 1992 3 IJFCS Agostino & Petreschi, On PV_chunk Operations and Matrogenic Graphs 1992 3 IJFCS Saoudi, Pushdown Automata on Infinite Trees and Nondeterministic Context-Free Programs 1992 3 IJFCS Campadelli & Morpurgo, Learning Classes of Linearly Separable Boolean Functions from Positive Examples 1992 3 IJFCS Luccio & Pietracaprina & Pucci, Analysis and Implementation of Parallel Uniform Hashing 1992 3 IJFCS Hromkovic & Inoue & Rovan & Slobodova & Takanami & Wagner, On the Power of One-Way Synchronized Alternating Machines with Small Space 1992 3 IJFCS Marche, The Word Problem of ACD-Ground Theories is Undecidable 1992 3 IJFCS Case & Jain & Sharma, On Learning Limiting Programs 1991 2 IJFCS Marti-Oliet & Meseguer, From Petri Nets to Linear Logic through Categories: A Survey 1991 2 IJFCS Inoue & Ito & Takanami, Alternating Turing Machines with Modified Accepting Structure 1991 2 IJFCS Panti, Solution of a Number Theoretic Problem Involving Knowledge 1991 2 IJFCS Huynh, Efficient Detectors and Constructors for Simple Languages 1991 2 IJFCS Chen & Toda, On the Complexity of Computing Optimal Solutions 1991 2 IJFCS Monti & Parente, Systolic Tree with Base Automata 1991 2 IJFCS Hemachandra & Jain, On the Limitations of Locally Robust Positive Reductions 1991 2 IJFCS Metivier & Rozoy, On the Star Operation in Free Partially Commutative Monoids 1991 2 IJFCS Tucker & Zucker, Projections of Semicomputable Relations on Abstract Data Types 1991 2 IJFCS Arvind & Biswas, Edge-Deletion Graph Problems with First-Order Expressible Subgraph Properties 1991 2 IJFCS Nguyen, A Relational Model of Demonic Nondeterministic Programs 1991 2 IJFCS Bodlaender, On the Complexity of Some Coloring Games 1991 2 IJFCS Hirokawa, Principal Type Assignment to Lambda Terms 1991 2 IJFCS Jiang & McDowell & Ravikumar, The Structure and Complexity of Minimal NFA's over a Unary Alphabet 1991 2 IJFCS Abadi & Pierce & Plotkin, Faithful Ideal Models for Recursive Polymorphic Types 1991 2 IJFCS Wilmes, Functional Production Systems Viewed as Grammars 1991 2 IJFCS Bergstra & Mauw & Wiedijk, Uniform Algebraic Specifications of Finite Sets with Equality 1991 2 IJFCS Cai & Furst, PSPACE Survives Constant-Width Bottlenecks 1991 2 IJFCS Zanko, #P-Completeness via Many-One Reductions 1990 1 IJFCS McNaughton, The Development of Formal Language Theory Since 1956 1990 1 IJFCS Farmer & Watro, Redex Capturing in Term Graph Rewriting 1990 1 IJFCS Comon, Solving Symbolic Ordering Constraints 1990 1 IJFCS Droste & Goebel, Universal Information Systems 1990 1 IJFCS Katajainen & Makinen, Tree Compression and Optimization with Applications 1990 1 IJFCS Korah & Kaimal, Dynamic Optimal Binary Search Tree 1990 1 IJFCS Subrahmanian, A Ring-Theoretic Basis for Logic Programming (Errata) 1990 1 IJFCS Barbanera, Combining Term Rewriting and Type Assignment Systems 1990 1 IJFCS Bovet & Di Ianni & Crescenzi, Deadlock Prediction in the Case of Dynamic Routing 1990 1 IJFCS Bruschi & Joseph & Young, Strong Separations for the Boolean Hierarchy over RP 1990 1 IJFCS Cherubini & Citrini & Reghizzi & Mandrioli, Breadth and Depth Grammars and Deque Automata 1990 1 IJFCS Costantini, Semantics of a Metalogic Programming Language 1990 1 IJFCS Falaschi & Gabbrielli & Levi & Murakami, Nested Guarded Horn Clauses 1990 1 IJFCS Goldwurm, Some Limit Distributions in Analysis of Algorithms for Problems on Trace Languages 1990 1 IJFCS Gorrieri & Montanari, Towards Hierarchical Description of Systems: A Proof System for Strong Prefixing 1990 1 IJFCS Gradel, On the Notion of Linear Time Computability 1990 1 IJFCS Mignosi, Sturmian Words and Ambiguous Context-Free Languages 1990 1 IJFCS Piperno & Tronci, Regular Systems of Equations in lambda-Calculus 1990 1 IJFCS Rosolini, About Modest Sets 1990 1 IJFCS Fachini & Gruska & Schettini & Sangiorgi, Simulation of Systolic Tree Automata on Trellis Automata 1990 1 IJFCS Ausiello & Protasi, Limiting Polynomial Approximation of Complexity Classes 1990 1 IJFCS De Agostino & Petreschi, Parallel Recognition Algorithms for Graphs with Restricted Neighbourhoods 1990 1 IJFCS Li & Cheng, Generalized First-Fit Algorithms in Two and Three Dimensions 1990 1 IJFCS Barbuti & Martelli, Recognizing Non-Floundering Logic Programs and Goals 1990 1 IJFCS Kenyon & Yao, On Evaluating Boolean Functions with Unreliable Tests 1990 1 IJFCS Saoudi & Muller & Schupp, On the Complexity of omega-Tree Sets and Nerode Theorem 1990 1 IJFCS Subrahmanian, A Ring-Theoretic Basis for Logic Programming 1990 1 IJFCS Suchenek, Applications of Lyndon Homomorphism Theorems to the Theory of Minimal Models 1990 1 IJFCS Wei, On a Personnel Assignment Problem 1990 1 IJFCS Preparata, Planar Point Location Revisited 1995 10 IJIS Kampke, Probabilistic Logic via Capacities 1992 7 IJIS Smets, The Transferable Belief Model and Random Sets 1992 7 IJIS Paass, Probabilistic Reasoning and Probabilistic Neural Networks 1995 89 IJM Haxell & Kohayakawa, The Size-Ramsey Number of Trees 1995 89 IJM Burton & Steif, New Results on Measures of Maximal Entropy 1994 88 IJM Shelah, How Special are Cohen and Random Forcings, i.e. Boolean Algebras of the Family of Subsets of Reals Modulo Meagre or Null 1992 78 IJM Vrecica & Zivaljevic, The Ham Sandwich Theorem Revisited 1988 64 IJM Komjath & Mekler & Pach, Some Universal Graphs 1987 59 IJM Bollobas & Brightwell, Graphs Whose Every Transitive Orientation Contains Almost Every Relation 1981 39 IJM Maass & Shore & Stob, Splitting Properties and Jump Classes 1981 38 IJM Bollobas & Rosenfeld, Sorting in One Round 1963 1 IJM Rabin, Real Time Computation 1993 39 IJMANMACH Lazonder & van der Meij, The Minimal Manual: Is Less Really More? 1993 38 IJMANMACH Kelly & Sleeman & Gilhooly, Artificial Intelligence in Education: Using State Space Search and Heuristics in Mathematics Instruction 1992 36 IJMANMACH Linn & Clancy, Can Experts' Explanations Help Students Develop Program Design Skills? 1989 12 IJMMS Krasikov, How Many Numbers Satisfy the 3X + 1 Conjecture? 1989 12 IJMMS Rhee, Failure of Random Networks 1992 3 IJNS Goudreau & Giles, Routing in Random Multistage Interconnections Networks: Comparing Exhaustive Search, Greedy and Neural Network Approaches 1990 21 IJPAM Farahmand, Crossings of a Random Algebraic Polynomial 1997 25 IJPP Dehne & Song, Randomized Parallel List Ranking for Distributed Memory Multiprocessors 1996 24 IJPP Kelly & Pugh & Rosser & Shpeisman, Transitive Closure of Infinite Graphs and its Applications 1996 24 IJPP Sheffler & Schreiber & Pugh & Gilbert & Chatterjee, Efficient Distribution Analysis via Graph Contraction 1996 24 IJPP Matheson & Tarjan, Parallelism in Multigrip Methods: How Much Is Too Much? 1995 23 IJPP Capitanio & Nicolau & Dutt, A Hypergraph-Based Model for Port Allocation on Multiple-Register-File VLIW Architectures 1995 23 IJPP Ben-Asher & Runger & Schuster & Wilhelm, 2DT-FP: A Parallel Functional Programming Language on Two-Dimensional Data 1995 23 IJPP Granston & Veidenbaum, Combining Flow and Dependence Analyses to Expose Redundant Array Accesses 1995 23 IJPP Griebl & Lengauer, A Communication Scheme for the Distributed Execution of Loop Nests with while Loops 1994 22 IJPP Johnson, Parallel-Access Memory Management Using Fast-Fits 1994 22 IJPP Carter & Ferrante & Bala, XDP: A Compiler Intermediate Language Extension for the Representation and Optimization of Data Movement 1994 22 IJPP Scott & Mellor-Crummey, Fast, Contention-Free Combining Tree Barriers for Shared-Memory Multiprocessors 1994 22 IJPP Li & Pingali, A Singular Loop Transformation Framework Based on Non-Singular Matrices 1994 22 IJPP Bell, Scalable, Parallel Computers: Alternatives, Issues, and Challenges 1994 22 IJPP Dennis, Machines and Models for Parallel Computing 1994 22 IJPP Kennedy, Compiler Technology for Machine-Independent Parallel Programming 1994 22 IJPP Kuck, What Do Users of Parallel Computer Systems Really Need? 1992 21 IJPP Feautrier, Some Efficient Solutions to the Affine Scheduling Problem. I. One-Dimensional Time 1992 21 IJPP Loots & Smith, A Parallel Algorithm for the 0-1 Knapsack Problem 1992 21 IJPP Sprague, A Parallel Algorithm to Construct a Dominance Graph on Nonoverlapping Rectangles 1992 21 IJPP Sarkar & Stojmenovic, Parallel Algorithms for Separation of Two Sets of Points and Recognition of Digital Convex Polygons 1992 21 IJPP Palis & Shende, An NC Algorithm for Recognizing Tree Adjoining Languages 1991 20 IJPP Ciepielewski, Scheduling in Or-Parallel Prolog Systems: Survey and Open Problems 1991 20 IJPP Susswein & Henderson & Zachary & Hansen & Hinker & Marsden, Parallel Path Consistency 1991 20 IJPP Dehne & Miller & Rau-Chaplin, Optical Clustering on a Mesh-Connected Computer 1991 20 IJPP Iqbal, Approximate Algorithms for Partitioning Problems 1991 20 IJPP Das & Moser & Melliar-Smith, A Parallel Sorting Algorithm for a Novel Model of Computation 1991 20 IJPP Adamson & Tick, Greedy Partitioned Algorithms for the Shortest-Path Problem 1991 20 IJPP Li & Naughton & Plank, An Efficient Checkpointing Method for Multicomputers with Wormhole Routing 1991 20 IJPP Singh & Kumar & Agha & Tomlinson, Efficient Algorithms for Parallel Sorting on Mesh Multicomputers 1991 20 IJPP Skillicorn, Models for Practical Parallel Computation 1991 20 IJPP Livesey, A Network Model of Barrier Synchronization Algorithms 1990 19 IJPP Sosic & Riesenfeld, Parallel Algorithms for Line Generation 1990 19 IJPP Blough & Bagherzadeh, Near-Optimal Message Routing and Broadcasting in Faulty Hypercubes 1990 19 IJPP Ibarra & Palis, An Efficient All-Parses Systolic Algorithm for General Context-free Parsing 1990 19 IJPP Langlois, Systolic Parsing of Context-free Languages 1990 19 IJPP Bermudez & Newman-Wolfe & Logothetis, Parallel Construction of SLR(1) and LALR(1) Parsers 1990 19 IJPP Dehne & Pham & Stojmenovic, Optimal Visibility Algorithms for Binary Images on the Hypercube 1990 19 IJPP Lubachevsky, Synchronization Barrier and Related Tools for Shared Memory Parallel Programming 1989 18 IJPP Singh & Overbeek, Derivation of Efficient Parallel Programs: An Example from Genetic Sequence Analysis 1989 18 IJPP Springsteel & Stojmenovic, Parallel General Prefix Computations with Geometric, Algebraic, and Other Applications 1989 18 IJPP Akl & Dehne, Pipelined Search on Coarse Grained Networks 1989 18 IJPP Hemmendinger, Initializing Memory Shared by Several Processors 1989 18 IJPP Taubenfeld & Katz & Moran, Initial Failures in Distributed Computations 1989 18 IJPP Gupta & Hill, A Scalable Implementation of Barrier Synchronization Using an Adaptive Combining Tree 1989 18 IJPP Zhang, Parallel Algorithms for Minimal Spanning Trees of Directed Graphs 1989 18 IJPP Huang, A Space-Efficient Parallel Sequence Comparison Algorithm for a Message-Passing Multiprocessor 1989 18 IJPP Ginosar & Egozi, Topological Comparison of Perfect Shuffle and Hypercube 1988 17 IJPP Swain, Comments on Samal and Henderson: ``Parallel Consistent Labeling Algorithms'' 1988 17 IJPP Cybenko & Allen & Polito, Practical Parallel Union-Find Algorithms for Transitive Closure and Clustering 1988 17 IJPP Edmiston & Core & Saltz & Smith, Parallel Processing of Biological Sequence Comparison Algorithms 1988 17 IJPP Janakiram & Gehringer & Agrawel & Mehrotra, A Randomized Parallel Branch-and-Bound Algorithm 1988 17 IJPP Hensgen & Finkel & Manber, Two Algorithms for Barrier Synchronization 1987 16 IJPP Gilbert & Zmijewski, A Parallel Graph Partitioning Algorithm for a Message-Passing Multiprocessor 1987 16 IJPP Degano & Marchetti, Partial Ordering Models for Concurrency Can Be Defined Operationally 1987 16 IJPP Rao & Kumar, Parallel Depth First Search. Part I. Implementation 1987 16 IJPP Kumar & Rao, Parallel Depth First Search. Part II. Analysis 1987 16 IJPP Samal & Henderson, Parallel Consistent Labeling Algorithms 1987 16 IJPP Main, Trace, Failure and Testing Equivalences for Communicating Processes 1987 16 IJPP Francez & Katz, Fairness and the Axioms of Control Predicates 1986 15 IJPP ElGindy, An Optimal Speed-up Parallel Algorithm for Triangulating Simplicial Point Sets in Space 1986 15 IJPP Merks, An Optimal Parallel Algorithm for Triangulating a Set of Points in the Plane 1986 15 IJPP Wolfe, Loop Skewing: The Wavefront Method Revisited 1986 15 IJPP Brooks, The Butterfly Barrier 1986 15 IJPP Rana & Banerji, An Optimal Distributed Solution to the Dining Philosophers Problem 1982 21 IJTP Rothstein, Physics of Selective Systems: Computation and Biology 1995 5 IMA Korjik & Ivkov & Merinovich & Barg & van Tilborg, A Broadcast Key Distributiion Scheme Based on Block Designs 1995 5 IMA Shin & Sweeney, Sequential Decoding for a Subcode of Reed Solomon Codes 1995 5 IMA Cabellero-Gil & Fuster-Sabater, Linear Span Analysis of a Set of Periodic Sequence Generators 1995 5 IMA Han & Gollmann & Mitchell, Minimal Weight k-SR Representations 1995 5 IMA Hirschfeld, The Main Conjecture for MDS Codes 1995 5 IMA Norton, Some Decoding Applications of Minimal Realization 1995 5 IMA Fan & Darnell, The Synthesis of Perfect Sequences 1995 5 IMA Penzhorn & Kuhn, Computation of Low-Weight Parity Checks for Correlation Attacks on Stream Ciphers 1995 5 IMA Mitchell, A Storage Complexity Based Analogue of Maurer Key Establishment Using Public Channels 1995 5 IMA Ho & Sweeney, Soft Decision Decoding of Reed Solomon Codes Using the Dorsch Algorithm 1995 5 IMA MacKay & Neal, Good Codes Based on Very Sparse Matrices 1995 5 IMA Phoenix & Townsend, Quantum Cryptography: Protecting our Future Networks with Quantum Mechanics 1995 5 IMA Radu & Govaerts & Vandewalle, Prepaid Electronic Cheques Using Public-Key Certificates 1995 5 IMA Lucks, How Traveling Salespersons Prove Their Identity 1995 5 IMA Smith & Boyd, An Elliptic Curve Analogue of McCurley's Key Agreement Scheme 1995 5 IMA Ahmadian-Attari & Farrell, Multi-Dimensional Ring TCM Codes for Fading Channels 1995 5 IMA van Tilborg, Authentication Codes: an Area where Coding and Cryptology Meet 1995 5 IMA Sendrier, Efficient Generation of Binary Words of Given Weight 1995 5 IMA Cachin, On-Line Secret Sharing 1995 5 IMA Oleshchuk, Church-Rosser Codes 1995 5 IMA Canteaut, A New Algorithm for Finding Minimum-Weight Words in Large Linear Codes 1995 5 IMA Stansfield & Walker, Coding and Cryptography for Speech and Vision 1995 5 IMA Zyablov & Shavgulidze & Justesen, Some Constructions of Generalised Concatenated Codes Based on Unit Memory Codes 1995 5 IMA Geiselmann, A Note on the Hash Function of Tillich and Zemor 1995 5 IMA Veron, Cryptanalysis of Harari's Identification Scheme 1995 5 IMA Quirke & Darnell, Analysis of Sequence Segment Keying as a Method of CDMA Transmission 1995 5 IMA Buttigieg & Farrell, Constructions for Variable-Length Error-Correcting Codes 1992 2 IMA Boyd, Applying Compression Coding in Cryptography 1992 2 IMA Burr, Performance Limits for Combined Coding and Modulation Schemes: A Geometric Approach 1992 2 IMA Carter, Enumeration Results on Linear Complexity Profiles 1992 2 IMA Darnell & Kemp, Multi-Level Complementary Sequence Sets: Synthesis and Applications 1992 2 IMA Gollmann, Automata Theory and Cryptanalysis 1992 2 IMA Hill, Optimal Linear Codes 1992 2 IMA Honary & Arani & Darnell, Embedded Modulation and Coding for HF Channels 1992 2 IMA Jedwab, Nonexistence Results for Barker Arrays 1992 2 IMA Jefferies & Walker, An Algebraic Zero-knowledge Identification Scheme 1992 2 IMA Jones, Standards for Data Security 1992 2 IMA Kokkos & O'Reilly, A Strategy for Designing Multilevel Codes with Defined Spectral and Error Control Properties 1992 2 IMA Lloyd, Characterising and Counting Functions Satisfying the Strict Avalanche Criterion of Order (n-3) 1992 2 IMA Maurer, Some Number-theoretic Conjectures and their Relation to the Generation of Cryptographic Primes 1992 2 IMA Pinch, Recognising Elements of Finite Fields 1992 2 IMA O'Reilly & Popplewell & Williams, Design and Implementation of Binary Combined Error Control and Line Coding Schemes 1992 2 IMA Rueppel, Security Models and Notions for Stream Ciphers 1992 2 IMA Simmons & Smeets, A Paradoxical Result in Unconditionally Secure Authentication Schemes -- and an Explanation 1992 2 IMA Stephens, The Zero-Square Algorithm for Computing Linear Complexity Profiles 1992 2 IMA Sweeney, Coding of Multi-Level Transmissions Using Cyclic Codes 1992 2 IMA Taleb & Farrell, Minimum Weight Decoding of Reed-Solomon Codes 1997 15 IMAVIS Tzionas & Thanailakis & Tsalides, An Efficient Algorithm for the Largest Empty Figure Problem Based on a 2D Cellular Automaton Architecture 1995 IMPAPPCOMP Leung, A Survey of Scheduling Results for Imprecise Computation Tasks 1992 102 INDACAD Venkaiah, An RSA Based Public-Key Cryptosystem for Secure Communication 1992 102 INDACAD Kaschel, A Note to the Paper ``An Efficient Algorithm for Linear Programming'' of V Ch Venkaiah 1997 133 INFCTRL Hromkovic & Klasing & Unger & Wagener, Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes 1997 133 INFCTRL Sorensen, Strong Normalization from Weak Normalization in Typed lambda-Calculi 1997 132 INFCTRL Jansen & Ohring, Approximation Algorithms for Time Constrained Scheduling 1997 132 INFCTRL Tofte & Talpin, Region-Based Memory Management 1997 132 INFCTRL Kivinen & Warmuth, Exponentiated Gradient versus Gradient Descent for Linear Predictors 1997 132 INFCTRL Jain & Sharma, Elementary Formal Systems, Intrinsic Complexity, and Procrastination 1996 131 INFCTRL Rooss & Wagner, On the Power of DNA-Computing 1996 131 INFCTRL Blundo & De Santis & Vaccaro, Randomness in Distribution Protocols 1996 131 INFCTRL Sangiorgi, Bisimulation for Higher-Order Process Calculi 1996 131 INFCTRL Agrawal & Arvind, A Note on Decision versus Search for Graph Automorphism 1996 131 INFCTRL Ferrucci & Pacini & Satta & Sessa & Tortora & Tucci & Vitiello, Symbol-Relation Grammars: A Formalism for Graphical Languages 1996 131 INFCTRL Kari & Thierrin, Contextual Insertions/Deletions and Computability 1996 131 INFCTRL Kao & Reif & Tate, Searching in an Unknown Environment: An Optimal Randomized Algorithm for the Cow-Path Problem 1996 131 INFCTRL Bertram-Kretzberg & Hofmeister, Multiple Product Modulo Arbitrary Numbers 1996 130 INFCTRL Beame & Borodin & Raghavan & Ruzzo & Tompa, Time-Space Tradeoffs for Undirected Graph Traversal by Graph Automata 1996 130 INFCTRL Wang, Parametric Timing Analysis for Real-Time Systems 1996 130 INFCTRL Giancarlo & Grossi, On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications 1996 130 INFCTRL Bruyere & De Felice, Any Lifting of a Trace Coding Is a Word Coding 1996 130 INFCTRL Fenner & Fortnow & Li, Gap-Definability as a Closure Property 1996 130 INFCTRL Jain & Sharma, Computational Limits on Team Identification of Languages 1996 130 INFCTRL Wilke & Yoo, Computing the Rabin Index of a Regular Language of Infinite Words 1996 130 INFCTRL Abdulla & Jonsson, Undecidable Verification Problems for Programs with Unreliable Channels 1996 130 INFCTRL Damm & Holzer, Inductive Counting for Width-Restricted Branching Programs 1996 129 INFCTRL Mingyi, A New Research into Default Logic 1996 129 INFCTRL Ateniese & Blundo & De Santis & Stinson, Visual Cryptography for General Access Structures 1996 129 INFCTRL Aceto & Ingolfsdottir, CPO Models for Compact GSOS Languages 1996 129 INFCTRL Hella, Logical Hierarchies in PTIME 1996 129 INFCTRL Jenner & McKenzie & Therien, Logspace and Logtime Leaf Languages 1996 129 INFCTRL Dam, Model Checking Mobile Processes 1996 129 INFCTRL Apsitis & Freivalds & Smith, On Duality in Learning and the Selection of Learning Teams 1996 129 INFCTRL Anoulova & Fischer & Polt & Simon, Probably Almost Bayes Decisions 1996 128 INFCTRL Case & Jain & Sharma, Machine Induction without Revolutionary Changes in Hypothesis Size 1996 128 INFCTRL Romanik & Vitter, Using Vapnik-Chervonenkis Dimension to Analyze the Testing Complexity of Program Segments 1996 128 INFCTRL Harel & Singerman, More on Nonregular PDL: Finite Models and Fibonacci-like Programs 1996 128 INFCTRL Han & Thierauf, Restricted Information from Nonadaptive Queries to NP 1996 128 INFCTRL Changizi, Self-Monitoring Machines and an omega^omega Hierarchy of Loops 1996 128 INFCTRL Lynch & Vaandrager, Forward and Backward Simulations. II. Timing-Based Systems 1996 128 INFCTRL Mason & Smith & Talcott, From Operational Semantics to Domain Theory 1996 128 INFCTRL Kilian & Siegelmann, The Dynamic Universality of Sigmoidal Neural Networks 1996 128 INFCTRL Varghese & Lynch, A Tradeoff between Safety and Liveness for Randomized Coordinated Attack 1996 127 INFCTRL Pitts, Relational Properties of Domains 1996 127 INFCTRL Abdulla & Jonsson, Verifying Programs with Unreliable Channels 1996 127 INFCTRL Mitchell & Viswanathan, Standard ML-NJ Weak Polymorphism and Imperative Constructs 1996 127 INFCTRL Hillebrand & Kanellakis & Mairson, Database Query Languages Embedded in the Typed Lambda Calculus 1996 127 INFCTRL Brookes, Full Abstraction for a Shared-Variable Parallel Language 1996 127 INFCTRL Joyal & Nielsen & Winskel, Bisimulation from Open Maps 1996 127 INFCTRL Fiore, A Coinduction Principle for Recursive Data Types Based on Bisimulation 1996 127 INFCTRL V'yugin, Bayesianism: An Algorithmic Analysis 1996 127 INFCTRL Di Gianantonio, Real Number Computability and Domain Theory 1996 127 INFCTRL Aceto & van Glabbeek & Fokkink & Ingolfsdottir, Axiomatizing Prefix Iteration with Silent Steps 1996 127 INFCTRL Vogler, The Limit of Split_n-Language Equivalence 1996 126 INFCTRL Droste, Aperiodic Languages in Concurrency Monoids 1996 126 INFCTRL Hancock & Jiang & Li & Tromp, Lower Bounds on Learning Decision Lists and Trees 1996 126 INFCTRL Bloo & Kamareddine & Nederpelt, The Barendregt Cube with Definitions and Generalised Reduction 1996 126 INFCTRL Ringeissen, Combining Decision Algorithms for Matching in the Union of Disjoint Equational Theories 1996 126 INFCTRL Chaudhuri, Sensitive Functions and Approximate Problems 1996 126 INFCTRL Fokkink & van Glabbeek, Ntyft/ntyxt Rules Reduce to Ntree Rules 1996 126 INFCTRL Hofmann & Pierce, Positive Subtyping 1996 126 INFCTRL Boreale & De Nicola, A Symbolic Semantics for the pi-Calculus 1996 126 INFCTRL Sayeed, Efficient Perfectly Secure Message Transmission in Synchronous Networks 1996 126 INFCTRL Alur & Taubenfeld, Contention-Free Complexity of Shared Memory Algorithms 1996 126 INFCTRL Plotkin, On a Question of H. Friedman 1996 126 INFCTRL Itoh, Simulating Fair Dice with Biased Coins 1996 126 INFCTRL Boudol & Laneve, The Discriminating Power of Multiplicities in the lambda-Calculus 1996 126 INFCTRL Palsberg, Efficient Inference of Object Types (Erratum) 1996 125 INFCTRL Abadi & Cardelli, A Theory of Primitive Objects: Untyped and First-Order Systems 1996 125 INFCTRL Barbanera & Berardi, A Symmetric Lambda Calculus for Classical Program Extraction 1996 125 INFCTRL Goltz & Gorrieri & Rensink, Comparing Syntactic and Semantic Action Refinement 1996 125 INFCTRL Takahashi & Akama & Hirokawa, Normal Proofs and Their Grammar 1996 125 INFCTRL Plaisted & Sattler-Klein, Proof Lengths for Equational Completion 1996 125 INFCTRL Creignou & Hermann, Complexity of Generalized Satisfiability Counting Problems 1996 125 INFCTRL Juedes & Lutz, Completeness and Weak Completeness under Polynomial-Size Circuits 1996 125 INFCTRL Giammarresi & Restivo & Seibert & Thomas, Monadic Second-Order Logic over Rectangular Pictures and Recognizability by Tiling Systems 1996 125 INFCTRL Lafont & Scedrov, The Undecidability of Second Order Multiplicative Linear Logic 1996 125 INFCTRL Bar-Ilan & Peleg, Scheduling Jobs Using Common Resources 1996 125 INFCTRL Kupferman & Grumberg, Branching-Time Temporal Logic and Tree Automata 1996 125 INFCTRL Book & Watanabe, On Random Hard Sets for NP 1996 124 INFCTRL Howe, Proving Congruence of Bisimulation in Functional Programming Languages 1996 124 INFCTRL Ho, Beyond Recursive Real Functions 1996 124 INFCTRL Ben-Eliyahu & Magidor, A Temporal Logic for Proving Properties of Topologically General Executions 1996 124 INFCTRL Fraser & Irving & Middendorf, Maximal Common Subsequences and Minimal Common Supersequences 1996 124 INFCTRL Rabinovich, On Schematological Equivalence of Dataflow Networks 1996 124 INFCTRL Yen, On the Regularity of Petri Net Languages 1996 124 INFCTRL Edalat, Power Domains and Iterated Function Systems 1996 124 INFCTRL Fortnow & Reingold, PP Is Closed under Truth-Table Reductions 1996 124 INFCTRL Gruchalski, Computability on dl-Domains 1996 124 INFCTRL Cece & Finkel & Iyer, Unreliable Channels Are Easier to Verify Than Perfect Channels 1996 124 INFCTRL Kesner & Puel & Tannen, A Typed Pattern Calculus 1996 124 INFCTRL Haack, A Decomposition Theorem for Domains 1996 124 INFCTRL Anderson & Yang, Time/Contention Trade-Offs for Multiprocessor Synchronization 1996 124 INFCTRL Kosiuczenko & Meinke, On the Power of Higher-Order Algebraic Specification Methods 1995 123 INFCTRL Attiya & Dolev & Welch, Connection Management without Retaining Information 1995 123 INFCTRL Dawar & Hella, The Expressive Power of Finitely Many Generalized Quantifiers 1995 123 INFCTRL Becker & Drechsler & Werchner, On the Relation between BDDs and FDDs 1995 123 INFCTRL Palsberg, Efficient Inference of Object Types 1995 123 INFCTRL Peleg & Wool, The Availability of Quorum Systems 1995 123 INFCTRL Kinber & Stephan, Language Learning from Texts: Mindchanges, Limited Memory, and Monotonicity 1995 123 INFCTRL Janicki & Koutny, Semantics of Inhibitor Nets 1995 123 INFCTRL Hromkovic & Klasing & Stohr & Wagener, Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs 1995 123 INFCTRL Farach & Thorup, Fast Comparison of Evolutionary Trees 1995 123 INFCTRL Cai & Chen & Downey & Fellows, On the Structure of Parameterized Problems in NP 1995 123 INFCTRL Bioch & Ibaraki, Complexity of Identification and Dualization of Positive Boolean Functions 1995 123 INFCTRL Freivalds & Kinber & Smith, On the Intrinsic Complexity of Learning 1995 123 INFCTRL Bast & Hagerup, Fast Parallel Space Allocation, Estimation, and Integer Sorting 1995 123 INFCTRL Luccio & Pagli, Approximate Matching for Two Families of Trees 1995 123 INFCTRL Fortnow & Laplante, Circuit Lower Bounds a la Kolmogorov 1995 123 INFCTRL Berkman & Iliopoulos & Park, The Subtree Max Gap Problem with Application to Parallel String Covering 1995 123 INFCTRL Takada, A Hierarchy of Language Families Learnable by Regular Language Learning 1995 123 INFCTRL Bshouty, Exact Learning Boolean Functions via the Monotone Theory 1995 122 INFCTRL de'Liguoro & Piperno, Nondeterministic Extensions of Untyped lambda-Calculus 1995 122 INFCTRL Barbuti & Codish & Giacobazzi & Maher, Oracle Semantics for Prolog 1995 122 INFCTRL McColm, Pebble Games and Subroutines in Least Fixed Point Logic 1995 122 INFCTRL Herrmann, On the Undecidability of Implications between Embedded Multivalued Database Dependencies 1995 122 INFCTRL Pillaipakkamnatt & Raghavan, Read-Twice DNF Formulas Are Properly Learnable 1995 122 INFCTRL Brown & Gurr, A Categorical Linear Framework for Petri Nets 1995 122 INFCTRL Fokkink & Klusener, An Effective Axiomatization for Real Time ACP 1995 122 INFCTRL Gabbrielli & Levi & Meo, Observable Behaviors and Equivalences of Logic Programs 1995 122 INFCTRL Aiken & Kozen & Wimmers, Decidability of Systems of Set Constraints with Negative Constraints 1995 122 INFCTRL Chen & Hsiang, Recurrence Domains: Their Unification and Application to Logic Programming 1995 122 INFCTRL Coppo & Giannini, Principal Types and Unification for Simple Intersection Type Systems 1995 122 INFCTRL Degano & Gorrieri, A Causal Operational Semantics of Action Refinement 1995 122 INFCTRL Spreen, On Some Decision Problems in Programming 1995 122 INFCTRL Muthukrishnan & Ramesh, String Matching under a General Matching Relation 1995 121 INFCTRL Mateescu & Salomaa & Salomaa & Yu, P, NP, and the Post Correspondence Problem 1995 121 INFCTRL Christensen & Huttel & Stirling, Bisimulation Equivalence Is Decidable for All Context-Free Processes 1995 121 INFCTRL Vogler, Timed Testing of Concurrent Systems 1995 121 INFCTRL Paramodulation, Bachmair & Ganzinger & Lynch & Snyder, Basic Paramodulation 1995 121 INFCTRL McAllester & Kucan & Otth, A Proof of Strong Normalization for F_2, F_infinity, and Beyond 1995 121 INFCTRL Jain & Sharma & Velauthapillai, Finite Identification of Functions by Teams with Success Ratio 1/2 and Above 1995 121 INFCTRL Lynch & Vaandrager, Forward and Backward Simulations. I. Untimed Systems 1995 121 INFCTRL Baeten & Bergstra & Smolka, Axiomatizing Probabilistic Processes: ACP with Generative Probabilities 1995 121 INFCTRL Freund, Boosting a Weak Learning Algorithm by Majority 1995 121 INFCTRL Hemaspaandra & Jha, Defying Upward and Downward Separation 1995 121 INFCTRL Longpre & Watanabe, On Symmetry of Information and Polynomial Time Invertibility 1995 121 INFCTRL De Santis & Di Crescenzo & Persiano, Zero-Knowledge Arguments and Public-Key Cryptography 1995 121 INFCTRL Ben-Asher & Lange & Peleg & Schuster, The Complexity of Reconfiguring Network Models 1995 121 INFCTRL van Glabbeek & Smolka & Steffen, Reactive, Generative, and Stratified Models of Probabilistic Processes 1995 121 INFCTRL Gottlob, The Complexity of Default Reasoning under the Stationary Fixed Point Semantics 1995 121 INFCTRL Adleman & Huang & Kompella, Efficient Checkers for Number-Theoretic Computations 1995 121 INFCTRL Clote, Cutting Plane and Frege Proofs 1995 121 INFCTRL Stewart, Completeness of Path-Problems via Logical Reductions 1995 120 INFCTRL Zeugmann & Lange & Kapur, Characterizations of Monotonic and Dual Monotonic Language Learning 1995 120 INFCTRL Parrow & Sangiorgi, Algebraic Theories for Name-Passing Calculi 1995 120 INFCTRL Vollmer & Wagner, Complexity Classes of Optimization Functions 1995 120 INFCTRL Van den Bussche & Paredaens, The Expressive Power of Complex Values in Object-Based Data Models 1995 120 INFCTRL Pan & Sobze & Atinkpahoun, On Parallel Computations with Banded Matrices 1995 120 INFCTRL Power, Why Tricategories? 1995 120 INFCTRL Di Pierro & Martelli & Palamidessi, Negation as Instantiation 1995 120 INFCTRL Boreale & De Nicola, Testing Equivalence for Mobile Processes 1995 120 INFCTRL Beigel & Kummer & Stephan, Approximable Sets 1995 120 INFCTRL Tung, Computational Complexity of Arithmetical Sentences 1995 120 INFCTRL Buss & Tompa, Lower Bounds on Universal Traversal Sequences Based on Chains of Length Five 1995 120 INFCTRL Yamazaki, A Normal Form Problem for Unlabeled Boundary NLC Graph Languages 1995 120 INFCTRL Ben-David & Benedek & Mansour, A Parameterization Scheme for Classifying Models of PAC Learnability 1995 120 INFCTRL Roychowdhury & Siu & Orlitsky & Kailath, Vector Analysis of Threshold Functions 1995 120 INFCTRL Edalat, Dynamical Systems, Measures, and Fractals via Domain Theory 1995 120 INFCTRL Book & Lutz & Martin, The Global Power of Additional Queries to Random Oracles 1995 120 INFCTRL Ogihara, Equivalence of NC^k and AC^{k-1} Closures of NP and Other Classes 1995 120 INFCTRL Kummer & Stephan, Recursion Theoretic Properties of Frequency Computation and Bounded Queries 1995 120 INFCTRL Fagin & Stockmeyer & Vardi, On Monadic NP vs Monadic co-NP 1995 120 INFCTRL Bar-Noy & Deng & Garay & Kameda, Optimal Amortized Distributed Consensus 1995 120 INFCTRL Dong & Su, Incremental and Decremental Evaluation of Transitive Closure by First-Order Queries 1995 120 INFCTRL O'Hearn & Riecke, Kripke Logical Relations and PCF 1995 120 INFCTRL Beauquier & Niwinski, Automata on Infinite Trees with Counting Constraints 1995 120 INFCTRL Neraud, Algorithms for Detecting Morphic Images of a Word 1995 120 INFCTRL Tung, The Bounds of Skolem Functions and Their Applications 1995 119 INFCTRL Ferrucci & Pacini & Sessa, Redundancy Elimination and Loop Checks for Logic Programs 1995 119 INFCTRL Nakayama & Maruoka, Loop Circuits and Their Relation to Razborov's Approximation Model 1995 119 INFCTRL Dawar & Lindell & Weinstein, Infinitary Logic and Inductive Definability over Finite Structures 1995 119 INFCTRL Di Cosmo, Second Order Isomorphic types: A Proof Theoretic Study on Second Order lambda-Calculus with Surjective Pairing and Terminal Object 1995 119 INFCTRL Barbanera & Dezani-Ciancaglini & de'Liguoro, Intersection and Union Types: Syntax and Semantics 1995 119 INFCTRL Chen & Toda, The Complexity of Selecting Maximal Solutions 1995 119 INFCTRL Metivier & Richomme, New Results on the Star Problem in Trace Monoids 1995 119 INFCTRL Gouy & Jiang, Universal Retractions on DI-Domains 1995 119 INFCTRL Amir & Farach & Idury & La Poutre & Schaffer, Improved Dynamic Dictionary Matching 1995 119 INFCTRL Neiger, Simplifying the Design of Knowledge-Based Algorithms Using Knowledge Consistency 1995 119 INFCTRL Seberry & Zhang & Zheng, Nonlinearity and Propagation Characteristics of Balanced Boolean Functions 1995 119 INFCTRL Dekkers, Inhabitation of Types in the Simply typed Lambda Calculus 1995 119 INFCTRL Kennaway & Klop * Sleep & de Vries, Transfinite Reductions in Orthogonal Term Rewriting Systems 1995 119 INFCTRL Yamanishi, A Loss Bound Model for On-Line Stochastic Prediction Algorithms 1995 119 INFCTRL Honsell & Mason & Smith & Talcott, A Variable Typed Logic of Effects 1995 119 INFCTRL Lodaya & Parikh & Ramanujam & Thiagarajan, A Logical Study of Distributed Transition Systems 1995 119 INFCTRL Bergstra & Heering, Homomorphism Preserving Algebraic Specifications Require Hidden Sorts 1995 119 INFCTRL Hagerup, A Lower Bound for the Emulation of PRAM Memories on Processor Networks 1995 119 INFCTRL Gradel & McColm, On the Power of Deterministic Transitive Closures 1995 118 INFCTRL Adamek, Recursive Data Types in Algebraically omega-Complete Categories 1995 118 INFCTRL Nielsen & Rozenberg & Thiagarajan, Transition Systems, Event Structures, and Unfoldings 1995 118 INFCTRL Freivalds & Kinber & Wiehagen, How Inductive Inference Strategies Discover Their Errors 1995 118 INFCTRL Niedermeier & Rossmanith, Unambiguous Auxiliary Pushdown Automata and Semi-unbounded Fan-in Circuits 1995 118 INFCTRL Halpern & Wimmers, Full Abstraction and Expressive Completeness for FP 1995 118 INFCTRL Gorrieri & Laneve, Split and ST Bisimulation Semantics 1995 118 INFCTRL Straubing & Therien & Thomas, Regular Languages Defined with Generalized Quantifiers 1995 118 INFCTRL Hromkovic & Muller & Sykora & Vrto, On Embeddings in Cycles 1995 118 INFCTRL Caucal & Huynh & Tian, Deciding Branching Bisimilarity of Normed Context-Free Processes Is in Sigma^p_2 1995 118 INFCTRL Maler & Pnueli, On the Learnability of Infinitary Regular Sets 1995 118 INFCTRL Weber & Klemm, Economy of Description for Single-Valued Transducers 1995 118 INFCTRL Amir & Farach, Efficient 2-Dimensional Approximate Matching of Half-Rectangular Figures 1995 118 INFCTRL Stuckey, Negation and Constraint Logic Programming 1995 118 INFCTRL Khuller & Matias, A Simple Randomized Sieve Algorithm for the Closest-Pair Problem 1995 118 INFCTRL Vogler, Generalized OM-Bisimulation 1995 118 INFCTRL Bultman & Maass, Fast Identification of Geometric Objects with Membership Queries 1995 118 INFCTRL Shawe-Taylor, Sample Sizes for Threshold Networks with Equivalences 1995 118 INFCTRL Beigel & Kummer & Stephan, Quantifying the Amount of Verboseness 1995 118 INFCTRL Kucherov & Tajine, Decidability of Regularity and Related Properties of Ground Normal Form Languages 1995 118 INFCTRL Touati & Brayton & Kurshan, Testing Language Containment for omega-Automata Using BDDs 1995 118 INFCTRL Litovsky & Metivier & Zielonka, On the Recognition of Families of Graphs with Local Computations 1995 118 INFCTRL Takahashi, Parallel Reductions in lambda-Calculus 1995 118 INFCTRL Palsberg & Schwartzbach, Safety Analysis versus Type Inference 1995 118 INFCTRL Alur & Itai & Kurshan & Yannakakis, Timing Verification by Successive Approximation 1995 118 INFCTRL Cristian & Aghili & Strong & Dolev, Atomic Broadcast: From Simple Message Diffusion to Byzantine Agreement 1995 117 INFCTRL Baudinet, On the Expressiveness of Temporal Logic Programming 1995 117 INFCTRL Aldous & Vazirani, A Markovian Extension of Valiant's Learning Model 1995 117 INFCTRL Paturi & Rajasekaran & Reif, The Light Bulb Problem 1995 117 INFCTRL Huynh & Tian, On Deciding Readiness and Failure Equivalences for Processes 1995 117 INFCTRL Yokouchi, Embedding a Second-Order Type System into an Intersection Type System 1995 117 INFCTRL Hennessy & Regan, A Process Algebra for Timed Systems 1995 117 INFCTRL Ben-David & Itai & Kushilevitz, Learning by Distances 1995 117 INFCTRL Bossut & Dauchet & Warin, A Kleene Theorem for a Class of Planar Acyclic Graphs 1995 117 INFCTRL Subramanian, The Parallel Complexity of Propagation in Boolean Circuits 1995 117 INFCTRL Goldman & Kearns & Schapire, On the Sample Complexity of Weak Learning 1995 117 INFCTRL Kurshan & McMillan, A Structural Induction Theorem for Processes 1995 117 INFCTRL Kleine Buning & Karpinski & Flogel, Resolution for Quantified Boolean Formulas 1995 117 INFCTRL Ben-Amram & Galil, On the Power of the Shift Instruction 1995 117 INFCTRL Lausen & Soisalon-Soininen, Safety by Uninterpreted Locks 1995 117 INFCTRL Howell & Venkatrao, On Non-preemptive Scheduling of Recurring Tasks Using Inserted Idle Times 1995 117 INFCTRL Kim & Lee, Node Replacement Graph Languages Squeezed with Chains, Trees, and Forests 1995 117 INFCTRL Idury & Schaffer, Multiple Matching of Rectangular Patterns 1995 117 INFCTRL Shmueli, A Single Recursive Predicate Is Sufficient for Pure Datalog 1995 117 INFCTRL Hoogers & Kleijn & Thiagarajan, A Trace Semantics for Petri Nets 1995 117 INFCTRL Castagna & Ghelli & Longo, A Calculus for Overloaded Functions with Subtyping 1995 117 INFCTRL Bellia & Occhiuto, Suprema of Open and Closed Formulas and Their Application to Resolution 1995 117 INFCTRL Ludwig, A Subexponential Randomized Algorithm for the Simple Stochastic Game Problem 1995 116 INFCTRL Fleischer & Jung & Mehlhorn, A Communication-Randomness Tradeoff for Two-Processor Systems 1995 116 INFCTRL Tamm, Communication Complexity of Sum-Type Functions Invariant under Translation 1995 116 INFCTRL Case & Jain & Sharma, Complexity Issues for Vacillatory Function Identification 1995 116 INFCTRL Schneider, An Operational Semantics for Timed CSP 1995 116 INFCTRL Yamakami, Feasible Computability and Resource Bounded Topology 1995 116 INFCTRL Fulop & Vagvolgyi, Attributed Tree Transducers Cannot Induce All Deterministic Bottom-up Tree Transformations 1995 116 INFCTRL Grahne & Mendelzon, Updates and Subjunctive Queries 1995 116 INFCTRL Walker, Objects in the pi-Calculus 1995 116 INFCTRL Amadio, A Quick Construction of a Retraction of All Retractions for Stable Bifinites 1995 116 INFCTRL Courcelle, Structural Properties of Context-Free Sets of Graphs Generated by Vertex Replacement 1995 116 INFCTRL Riecke, Statman's 1-Section Theorem 1995 116 INFCTRL Fang & Rajasekera, Entropy Optimization Models with Convex Constraints 1995 116 INFCTRL Smid, Dynamic Rectangular Point Location, with an Application to the Closest Pair Problem 1995 116 INFCTRL Huth, A Maximal Monoidal Closed Category of Distributive Algebraic Domains 1995 116 INFCTRL Camilleri & Winskel, CCS with Priority Choice 1995 116 INFCTRL Thomsen, A Theory of Higher Order Communicating Systems 1995 116 INFCTRL Nerode & Ng & Subrahmanian, Computing Circumscriptive Databases. I. Theory and Algorithms 1995 116 INFCTRL Abe, Characterizing PAC-Learnability of Semilinear Sets 1995 116 INFCTRL Immerman & Landau, The Complexity of Iterated Multiplication 1995 116 INFCTRL Eberly, Fast Parallel Band Matrix Arithmetic 1995 116 INFCTRL Sheinwald & Lempel & Ziv, On Encoding and Decoding with Two-Way Head Machines 1995 116 INFCTRL Diekert & Gastin & Petit, Rational and Recognizable Complex Trace Languages 1994 115 INFCTRL Aceto & Hennessy, Adding Action Refinement to a Finite Process Algebra 1994 115 INFCTRL Haussler & Littlestone & Warmuth, Predicting {0,1}-Functions on Randomly Drawn Points 1994 115 INFCTRL Mayer & Stockmeyer, The Complexity of Word Problems--This Time with Interleaving 1994 115 INFCTRL Upfal, Tolerating a Linear Number of Faults in Networks of Bounded Degree 1994 115 INFCTRL Kolaitis & Thakur, Logical Definability of NP Optimization Problems 1994 115 INFCTRL Groote & Huttel, Undecidable Equivalences for Basic Process Algebra 1994 115 INFCTRL Vardi & Wolper, Reasoning about Infinite Computations 1994 115 INFCTRL Wright & Felleisen, A Syntactic Approach to Type Soundness 1994 115 INFCTRL Fekete, Asynchronous Approximate Agreement 1994 115 INFCTRL Horita & de Bakker & Rutten, Fully Abstract Denotational Models for Nonuniform Concurrent Languages 1994 114 INFCTRL Fulk & Jain, Approximate Inference and Scientific Method 1994 114 INFCTRL Shemesh & Francez, Finite-State Unification Automata and Relational Languages 1994 114 INFCTRL Kranakis & Krizanc & van den Berg, Computing Boolean Functions on Anonymous Networks 1994 114 INFCTRL Hashiguchi, The Infinite 2-Star Height Hierarchy of Extended Regular Languages of Star Degree at Most Two 1994 114 INFCTRL Boudol & Castellani, Flow Models of Distributed Computations: Three Equivalent Semantics for CCS 1994 114 INFCTRL Ehrenfeucht & Hoogeboom & Rozenberg, Combinatorial Properties of Dependence Graphs 1994 114 INFCTRL Cook & Palsberg, A Denotational Semantics of Inheritance and Its Correctness 1994 114 INFCTRL Breazu-Tannen & Gallier, Polymorphic Rewriting Conserves Algebraic Confluence 1994 114 INFCTRL Bohm & Intrigila, The Ant-Lion Paradigm for Strong Normalization 1994 114 INFCTRL Esparza, Reduction and Synthesis of Live and Bounded Free Choice Petri Nets 1994 114 INFCTRL Rivest & Sloan, A Formal Model of Hierarchical Concept Learning 1994 114 INFCTRL Sorenson & Parberry, Two Fast Parallel Prime Number Sieves 1994 114 INFCTRL Nicollin & Sifakis, The Algebra of Timed Processes, ATP: Theory and Application 1994 113 INFCTRL Taubenfeld & Katz & Moran, Impossibility Results in the Presence of Multiple Faulty Processes 1994 113 INFCTRL Chin & McColl, Virtual Shared Memory: Algorithms and Complexity 1994 113 INFCTRL Ogielski, Minimal Samples of Positive Examples Identifying k-CNF Boolean Functions 1994 113 INFCTRL Long & Warmuth, Composite Geometric Concepts and Polynomial Predictability 1994 113 INFCTRL Wand & Wang, Conditional Lambda-Theories and the Verification of Static Properties of Programs 1994 113 INFCTRL Harel & Raz, Deciding Emptiness for Stack Automata on Infinite Trees 1994 113 INFCTRL Jerrum, Simple Translation-Invariant Concepts Are Hard to Learn 1994 113 INFCTRL Afek & Matias, Elections in Anonymous Networks 1994 113 INFCTRL Shallit, Numeration Systems, Linear Recurrences, and Regular Sets 1994 113 INFCTRL Beaudry, Membership Testing in Threshold One Transformation Monoids 1994 113 INFCTRL Wanke, On the Decidability of Certain Integer Subgraph Problems on Context-Free Graphs Languages 1994 113 INFCTRL Ellis & Sudborough & Turner, The Vertex Separation and Search Number of a Graph 1994 113 INFCTRL Schieber & Snir, Calling Names on Nameless Networks 1994 113 INFCTRL Gerber & Lee, A Resource-Based Prioritized Bisimulation of Real-Time Systems 1994 113 INFCTRL Contejean & Devie, An Efficient Incremental Algrorithm for Solving Systems of Linear Diophantine Equations 1994 112 INFCTRL Comon & Delor, Equational Formulae with Membership Constraints 1994 112 INFCTRL Allender & Hertrampf, Depth Reductions for Circuits of Unbounded Fan-In 1994 112 INFCTRL Dimopoulos & Magirou, A Graph-Theoretic Approach to Default Logic 1994 112 INFCTRL Paturi & Saks, Approximating Threshold Circuits by Rational Functions 1994 112 INFCTRL Henzinger & Manna & Pnueli, Temporial Proof Methodologies for Timed Transition Systems 1994 112 INFCTRL Abadi & Halpern, Decidability and Expressiveness for First-Order Logics of Probability 1994 112 INFCTRL Levcopoulos & Petersson, Sorting Shuffled Monotone Sequences 1994 112 INFCTRL Grolmusz, The BNS Lower Bound for Multi-party Protocols Is Nearly Optimal 1994 112 INFCTRL Hennessy, A Fully Abstract Denotational Model for Higher-Order Processes 1994 112 INFCTRL Parberry, A Guide for New Referees in Theoretical Computer Science 1994 112 INFCTRL Yan & Parberry, Exponential Size Lower Bounds for Some Depth Three Circuits 1994 112 INFCTRL Pierce, Bounded Quantification Is Undecidable 1994 111 INFCTRL Henzinger & Nicollin & Sifakis & Yovine, Symbolic Model Checking for Real-Time Systems 1994 111 INFCTRL Talpin & Jouvelot, The Type and Effect Discipline 1994 111 INFCTRL Cartwright & Curien & Felleisen, Fully Abstract Semantics for Observably Sequential Languages 1994 111 INFCTRL Aceto & Bloom & Vaandrager, Turning SOS Rules into Equations 1994 111 INFCTRL Abramsky & Jagadeesan, New Foundations for the Geometry of Interaction 1994 111 INFCTRL Sangiorgi, The Lazy Lambda Calculus in a Concurrency Scenario 1994 111 INFCTRL Comon & Haberstrau & Jouannaud, Syntacticness, Cycle-Syntacticness, and Shallow Theories 1994 110 INFCTRL Bucciarelli & Ehrhard, Sequentiality in an Extensional Framework 1994 110 INFCTRL Coquand, An Analysis of Ramsey's Theorem 1994 110 INFCTRL Godefroid & Wolper, A Partial Approach to Model Checking 1994 110 INFCTRL Hodas & Miller, Logic Programming in a Fragment of Intuitionistic Linear Logic 1994 110 INFCTRL Kozen, A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events 1994 110 INFCTRL Leivant, A Foundational Delineation of Poly-time 1994 110 INFCTRL Sorenson, Polylog Depth Circuits for Integer Factoring and Discrete Logarithms 1994 110 INFCTRL Thanisch & Loizou & Nummenmaa, Finding Compact Scheme Forests in Nested Normal Form Is NP-Hard 1994 110 INFCTRL Ng & Subrahmanian, Stable Semantics for Probabilistic Deductive Databases 1994 110 INFCTRL Kucera & Marchetti-Spaccamela & Protasi, On Learning Monotone DNF Formulae under Uniform Distributions 1994 110 INFCTRL Trahan & Ramachandran & Loui, Parallel Random Access Machines with both Multiplication and Shifts 1994 110 INFCTRL Homer & Wang, Immunity of Complete Problems 1994 110 INFCTRL van Kreveld & Overmars, Concatenable Structures for Decomposable Problems 1994 110 INFCTRL Steffen & Ingolfsdottir, Characteristic Formulae for Processes with Divergence 1994 110 INFCTRL Diekert & Ochmanski & Reinhardt, On Confluent Semi-commutations: Decidability and Complexity Results 1994 110 INFCTRL Attiya & Lynch, Time Bounds for Real-Time Process Control in the Presence of Timing Uncertainty 1994 110 INFCTRL Zhang, A Representation of SFP 1994 109 INFCTRL Cardelli & Martini & Mitchell & Scedrov, An Extension of System F with Subtyping 1994 109 INFCTRL Curien & Ghelli, Decidability and Confluence of beta eta top_<= Reduction in F_<= 1994 109 INFCTRL Giannini & Ronchi Della Rocca, A Type Inference Algorithm for a Stratified Polymorphic Type Discipline 1994 109 INFCTRL Hayashi, Singleton, Union, and Intersection Types for Program Extraction 1994 109 INFCTRL Phoa, From Term Models to Domains 1994 109 INFCTRL Plotkin, A Semantics for Static Type Inference 1994 109 INFCTRL Abadi, A Semantics for Static Type Inference in a Nondeterministic Language 1994 108 INFCTRL Shinohara, Rich Classes Inferable from Positive Data: Length-Bounded Elementary Formal Systems 1994 108 INFCTRL Baeza-Yates & Gonnet, Fast String Matching with Mismatches 1994 108 INFCTRL Hastad & Wegener & Wurm & Yi, Optimal Depth, Very Small Size Circuits for Symmetric Functions in AC^0 1994 108 INFCTRL Littlestone & Warmuth, The Weighted Majority Algorithm 1994 108 INFCTRL Bruschi & Pighizzini & Sabadini, On the Existence of Minimum Asynchronous Automata and on the Equivalence Problem for Unambiguous Regular Trace Languages 1994 108 INFCTRL Tulipani, Decidability of the Existential Theory of Infinite Terms with Subterm Relation 1994 108 INFCTRL Bodlaender & Moran & Warmuth, The Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous Case 1994 108 INFCTRL Boudol, Lambda-Calculi for (Strict) Parallel Functions 1994 108 INFCTRL de Boer & Palamidessi, Embedding as a Tool for Language Comparison 1994 108 INFCTRL Krichevsky, Occam's Razor, Partially Specified Boolean Functions, String Matching, and Independent Sets 1993 107 INFCTRL Burns & Lynch, Bounds on Shared Memory for Mutual Exclusion 1993 107 INFCTRL Devolder, Precircular Codes and Periodic Biinfinite Words 1993 107 INFCTRL Hennessy & Ingolfsdottir, A Theory of Communicating Processes with Value Passing 1993 107 INFCTRL Freivalds & Smith, On the Role of Procrastination in Machine Learning 1993 107 INFCTRL Jonsson & Parrow, Deciding Bisimulation Equivalences for a Class of Non-Finite-State Programs 1993 107 INFCTRL Gunter & Gunter & MacQueen, Computing ML Equality Kinds Using Abstract Interpretation 1993 107 INFCTRL Goodrich & Atallah & Overmars, Output-Sensitive Methods for Rectilinear Hidden Surface Removal 1993 107 INFCTRL O'Hearn & Tennent, Semantical Analysis of Specification Logic, 2 1993 107 INFCTRL Parrow, Structural and Behavioural Equivalences of Networks 1993 107 INFCTRL Pacholski & Szwast, A Counterexample to the 0-1 Law for the Class of Existential Second-Order Minimal Godel Sentences with Equality 1993 107 INFCTRL Kuper, An Axiomatic Theory for Partial Functions 1993 107 INFCTRL Klarlund & Schneider, Proving Nondeterministically Specified Safety Properties Using Progress Measures 1993 106 INFCTRL Cori & Metivier & Zielonka, Asynchronous Mappings and Asynchronous Cellular Automata 1993 106 INFCTRL Kawaguchi & Wada, New Results in Graph Routing 1993 106 INFCTRL Baeza-Yates & Culberson & Rawlins, Searching in the Plane 1993 106 INFCTRL Howell & Jancar & Rosier, Completeness Results for Single-Path Petri Nets 1993 106 INFCTRL Berkman & Vishkin, On Parallel Integer Merging 1993 106 INFCTRL Meiser, Point Location in Arrangements of Hyperplanes 1993 106 INFCTRL Rivest & Sloan, On Choosing between Experimenting and Thinking when Learning 1993 106 INFCTRL Palmgren, An Information System Interpretation of Martin-Lof's Partial Type Theory with Universes 1993 106 INFCTRL Choffrut, On the Starheight of Some Rational Subsets Closed under Partial Commutations 1993 106 INFCTRL Leung & Wong, Minimizing the Number of Late Tasks with Error Constraint 1993 106 INFCTRL Apt & Pedreschi, Reasoning about Termination of Pure Prolog Programs 1993 105 INFCTRL Abramsky & Ong, Full Abstraction in the Lazy Lambda Calculus 1993 105 INFCTRL Goldberg, Automating Polya Theory: The Computational Complexity of the Cycle Index Polynomial 1993 105 INFCTRL Reynolds & Plotkin, On Functors Expressible in the Polymorphic Typed Lambda Calculus 1993 105 INFCTRL van Benthem Jutting, Typing in Pure Type Systems 1993 105 INFCTRL Hoofman, Continuous Information Systems 1993 105 INFCTRL Gasarch & Hemachandra & Hoene, On Checking versus Evaluation of Multiple Queries 1993 105 INFCTRL Jung & Kirousis & Spirakis, Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of Directed Acyclic Graphs with Communication Delays 1993 105 INFCTRL Ristad, The Anaphora Problem 1993 105 INFCTRL Chaudhuri, More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems 1993 104 INFCTRL Feldman & Impagliazzo & Naor & Nisan & Rudich & Shamir, On Dice and Coins: Models of Computation for Random Generation 1993 104 INFCTRL Israeli & Jalfon, Uniform Self-Stabilizing Ring Orientation 1993 104 INFCTRL Frederickson, An Optimal Algorithm for Selection in a Min-Heap 1993 104 INFCTRL Shyamasundar & Narayana & Pitassi, Semantics of Nondeterministic Asynchronous Broadcast Networks 1993 104 INFCTRL Luginbuhl & Loui, Hierarchies and Space Measures for Pointer Machines 1993 104 INFCTRL Kannan & Venkateswaran & Vinay & Yao, A Circuit-Based Proof of Toda's Theorem 1993 104 INFCTRL Duris & Galil, On the Power of Multiple Reads in a Chip 1993 104 INFCTRL Goldsmith & Joseph & Young, Using Self-Reducibilities to Characterize Polynomial Time 1993 104 INFCTRL Alur & Courcoubetis & Dill, Model-Checking in Dense Real-Time 1993 104 INFCTRL Alur & Henzinger, Real-Time Logics: Complexity and Expressiveness 1993 104 INFCTRL Sekar & Ramakrishnan, Programming in Equational Logic: Beyond Strong Sequentiality 1993 104 INFCTRL Middeldorp, Modular Properties of Conditional Term Rewriting Systems 1993 103 INFCTRL Staiger, Kolmogorov Complexity and Hausdorff Dimension 1993 103 INFCTRL Musikaev & Taitslin, Limitations of the Program Memory and the Expressive Power of Dynamic Logics 1993 103 INFCTRL Aceto & Hennessy, Towards Action-Refinement in Processo Algebras 1993 103 INFCTRL Peleg, Distance-Dependent Distributed Directories 1993 103 INFCTRL Rivest & Schapire, Inference of Finite Automata Using Homing Sequences 1993 103 INFCTRL Pnueli & Zuck, Probabilistic Verification 1993 103 INFCTRL Ginsburg & Simovici & Wang, Content-Related Interval Queries on Object Histories 1993 103 INFCTRL Beigel & Gasarch & Gill & Owings, Terse, Superterse, and Verbose Sets 1993 103 INFCTRL Falaschi & Levi & Martelli & Palamidessi, A Model-Theoretic Reconstruction of the Operational Semantics of Logic Programs 1993 103 INFCTRL Meseguer & Goguen, Order-Sorted Algebra Solves the Constructor-Selector, Multiple Representation, and Coercion Problems 1993 102 INFCTRL Sistla & Zuck, Reasoning in a Restricted Temporal Logic 1993 102 INFCTRL Dietzfelbinger & Meyer auf der Heide, An Optimal Parallel Dictionary 1993 102 INFCTRL Kaufmann & Klar, Routing in Polygons without Rectilinearly Visible Corners 1993 102 INFCTRL Fleischer & Sinha & Uhrig, A Lower Bound for the Worst Case of Bottom-Up-Heapsort 1993 102 INFCTRL Graham & Harary & Livingston & Stout, Subcube Fault-Tolerance in Hypercubes 1993 102 INFCTRL Bloom & Esik & Taubner, Iteration Theories of Synchronization Trees 1993 102 INFCTRL Shade & Narayana, Real-Time Semantics for Shared-Variable Concurrency 1993 102 INFCTRL Kfoury & Tiuryn & Urzyczyn, The Undecidability of the Semi-unification Problem 1993 102 INFCTRL Buntrock & Hemachandra & Siefkes, Using Inductive Counting to Simulate Nondeterministic Computation 1993 102 INFCTRL Jain & Sharma, Learning with the Knowledge of an Upper Bound on Program Size 1992 101 INFCTRL Hashiguchi & Yamada, String Matching Problems over Free Partially Commutative Monoids 1992 101 INFCTRL Ng & Subrahmanian, Probabilistic Logic Programming 1992 101 INFCTRL Goerdt, Characterizing Complexity Classes by General Recursive Definitions in Higher Types 1992 101 INFCTRL Pin & Straubing & Therien, Some Results on the Generealized Star-Height Problem 1992 101 INFCTRL Dougherty, Adding Algebraic Rewriting to the Untyped Lambda Calculus 1992 101 INFCTRL Dahlhaus & Makowsky, Query Languages for Hierarchic Databases 1992 101 INFCTRL Verma & Ramakrishnan, Tight Complexity Bounds for Term Matching Problems 1992 101 INFCTRL Stransky, A Lattice for Abstract Interpretation of Dynamic (LISP-like) Structures 1992 101 INFCTRL Vakarelov, A Modal Logic for Cyclic Repeating 1992 101 INFCTRL Mehlhorn & Paul & Uhrig, k versus k+1 Index Registers and Modifiable versus Non-modifiable Programs 1992 100 INFCTRL Zhang, dI-Domains as Prime Information Systems 1992 100 INFCTRL Board, The Online Graph Bandwidth Problem 1992 100 INFCTRL Groote & Vaandrager, Structured Operational Semantics and Bisimulation as a Congruence 1992 100 INFCTRL Goldstine & Leung & Wotschke, On the Relation between Ambiguity and Nondeterminism in Finite Automata 1992 100 INFCTRL Milner & Parrow & Walker, A Calculus of Mobile Processes, I 1992 100 INFCTRL Milner & Parrow & Walker, A Calculus of Mobile Processes, II 1992 100 INFCTRL Haussler, Decision Theoretic Generalizations of the PAC Model for Neural Net and Other Learning Applications 1992 99 INFCTRL Fairtlough & Wainer, Ordinal Complexity of Recursive Definitions 1992 99 INFCTRL de Lavalette, Strictness Analysis via Abstract Interpretation for Recursively Defined Types 1992 99 INFCTRL Darondeau & Yoccoz, Proof Systems for Infinite Behaviours 1992 99 INFCTRL Benveniste & Le Guernic & Sorel & Sorine, A Denotational Theory of Synchronous Reactive Systems 1992 99 INFCTRL Ore, The Extended Calculus of Constructions (ECC) with Inductive Types 1992 99 INFCTRL Asperti & Martini, Categorical Models of Polymorphism 1992 99 INFCTRL Larsen & Milner, A Compositional Protocol Verification Using Relativized Bisimulation 1992 99 INFCTRL Robson, Deterministic Simulation of a Single Tape Turing Machine by a Random Access Machine in Sub-linear Time 1992 98 INFCTRL Burch & Clarke & McMillan & Dill & Hwang, Symbolic Model Checking: 10^20 States and Beyond 1992 98 INFCTRL Crole & Pitts, New Foundations for Fixpoint Computations: FIX-Hyperdoctrines and the FIX-Logic 1992 98 INFCTRL Freyd & Mulry & Rosolini & Scott, Extensional PERs 1992 98 INFCTRL Kfoury & Tiuryn, Type Reconstruction in Finite Rank Fragments of the Second-Order lambda-Calculus 1992 98 INFCTRL Kolaitis & Vardi, Infinitary Logics and 0-1 Laws 1992 97 INFCTRL Greenlaw, A Model Classifying Algorithms as Inherently Sequential with Applications to Graph Searching 1992 97 INFCTRL Willard, A Density Control Algorithm for Doing Insertions and Deletions in a Sequentially Ordered File in a Good Worst-Case Time 1992 97 INFCTRL Bar-Noy & Dolev & Dwork & Strong, Shifting Gears: Changing Algorithms on the Fly to Expedite Byzantine Agreement 1992 97 INFCTRL Jiang, The Synchronization of Nonuniform Networks of Finite Automata 1992 97 INFCTRL Tung, Polynomial Time Algorithms for Sentences over Number Fields 1992 97 INFCTRL Cho & Huynh, The Parallel Complexity of Finite-State Automata Problems 1992 97 INFCTRL Sakakibara, Efficient Learning of Context-Free Grammars from Positive Structural Examples 1992 97 INFCTRL Coan & Welch, Modular Construction of a Byzantine Agreement Protocol with Optimal Message Bit Complexity 1992 97 INFCTRL Wegener, The Worst Case Complexity of McDiarmid and Reed's Variant of BOTTOM-UP HEAPSORT Is Less than n log n + 1.1 n 1992 97 INFCTRL Bartha, An Algebraic Model of Synchronous Systems 1992 96 INFCTRL Emde & Schinzel, Aggregating Inductive Expertise on Partial Recursive Functions 1992 96 INFCTRL Hromkovic & Krause & Meinel & Waack, Branching Programs Provide Lower Bounds on the Areas of Multilective Deterministic and Nondeterministic VLSI-Circuits 1992 96 INFCTRL Vitter & Lin, Learning in Parallel 1992 96 INFCTRL Condon, The Complexity of Stochastic Games 1992 96 INFCTRL Stachniak, Resolution Approximation of First-Order Logics 1992 96 INFCTRL Vovk, Universal Forecasting Algorithms 1992 96 INFCTRL Fischer & Griffeth & Guibas & Lynch, Optimal Placement of Identical Resources in a Tree 1992 96 INFCTRL Buchanan & Mays, Retrograde Codes and Bounded Synchronization Delay 1992 96 INFCTRL Dowd, Generic Oracles, Uniform Machines, and Codes 1992 96 INFCTRL Berman & Schnitger, On the Complexity of Approximating the Independent Set Problem 1992 96 INFCTRL Zeugmann, Highly Parallel Computations Modulo a Number Having Only Small Prime Factors 1992 96 INFCTRL Ekman, A Note on the Characterization of Weak Bisimulation Congruence in CCS 1992 96 INFCTRL Yen, A Unified Approach for Deciding the Existence of Certain Petri Net Paths 1991 95 INFCTRL Hromkovic, Nonlinear Lower Bounds on the Number of Processors of Circuits with Sublinear Separators 1991 95 INFCTRL Haussler & Kearns & Littlestone & Warmuth, Equivalence of Models for Polynomial Learnability 1991 95 INFCTRL Jain & Sharma, Learning in the Presence of Partial Explanations 1991 95 INFCTRL Ponse, Process Expressions and Hoare's Logic: Showing an Irreconcilability of Context-Free Recursion with Scott's Induction Rule 1991 95 INFCTRL Mahesh & Rangan & Srinivasan, On Finding the Minimum Bandwidth of Interval Graphs 1991 95 INFCTRL Colussi, Correctness and Efficiency of Pattern Matching Algorithms 1991 95 INFCTRL Bar-Noy & Dolev & Koller & Peleg, Fault-Tolerant Critical Section Management in Asynchronous Environments 1991 95 INFCTRL Engelfriet, Iterated Stack Automata and Complexity Classes 1991 95 INFCTRL Apostolico & Crochemore, Optimal Canonization of All Substrings of a String 1991 95 INFCTRL Barrington & McKenzie, Oracle Branching Programs and Logspace versus P 1991 94 INFCTRL de Bakker, Comparative Semantics for Flow of Control in Logic Programming without Logic 1991 94 INFCTRL Tiomkin & Makowsky, Decidability of Finite Probabilistic Propositional Dynamic Logics 1991 94 INFCTRL Berardi, Retractions on dI-Domains as a Model for Type:Type 1991 94 INFCTRL Krause & Waack, On Oblivious Branching Programs of Linear Length 1991 94 INFCTRL Larsen & Skou, Bisimulation through Probabilistic Testing 1991 94 INFCTRL Bhatt & Diks & Hagerup & Prasad & Radzik & Saxena, Improved Deterministic Parallel Integer Sorting 1991 94 INFCTRL Droste, Universal Homogeneous Event Structures and Domains 1991 94 INFCTRL Gradel, Simple Sentences That Are Hard to Decide 1991 94 INFCTRL Lubiw & Racz, A Lower bound for the Integer Element Distinctness Problem 1991 94 INFCTRL Wanke, Algorithms for Graph Problems on BNLC Structured Graphs 1991 93 INFCTRL Aiello & Hastad, Relativized Perfect Zero Knowledge Is Not BPP 1991 93 INFCTRL Crescenzi & Panconesi, Completeness in Approximation Classes 1991 93 INFCTRL Passy & Tinchev, An Essay in Combinatory Dynamic Logic 1991 93 INFCTRL Hoover, Real Functions, Contraction Mappings, and P-Completeness 1991 93 INFCTRL Wand, Type Inference for Record Concatenation and Multiple Inheritance 1991 93 INFCTRL Mislove & Moss & Oles, Non-Well-Founded Sets Modeled as Ideal Fixed Points 1991 93 INFCTRL Moggi, Notions of Computation and Monads 1991 93 INFCTRL Leivant, Finitely Stratified Polymorphism 1991 93 INFCTRL Moschovakis, A Model of Concurrency with Fair Merge and Full Recursion 1991 93 INFCTRL Breazu-Tannen & Coquand & Gunter & Scedrov, Inheritance as Implicit Coercion 1991 92 INFCTRL Cunto & Gonnet & Munro & Poblete, Fringe Analysis for Extquick: An in situ Distributive External Sorting Algorithm 1991 92 INFCTRL Abramsky, A Domain Equation for Bisimulation 1991 92 INFCTRL Du & Leung & Young, Scheduling Chain-Structured Tasks to Minimize Makespan and Mean Flow Time 1991 92 INFCTRL Venkateswaran, Two Dynamic Programming Algorithms for Which Interpreted Pebbling Helps 1991 92 INFCTRL Kinber & Zeugmann, One-Sided Error Probabilistic Inductive Inference and Reliable Frequency Identification 1991 92 INFCTRL Cole & Vishkin, Approximate Parallel Scheduling. II. Applications to Logarithmic-Time Optimal Parallel Graph Algorithms 1991 92 INFCTRL Cardone & Coppo, Type Inference with Recursive Types: Syntax and Semantics 1991 92 INFCTRL Hornick & Preparata, Deterministic P-RAM Simulation with Constant Redundancy 1991 92 INFCTRL Geske & Huynh & Seiferas, A Note on Almost-Everywhere-Complex Sets and Separating Deterministic-Time-Complexity Classes 1991 92 INFCTRL Avron, Simple Consequence Relations 1991 91 INFCTRL Gopalakrishnan & Ramakrishnan & Kanal, Approximate Algorithms for the Knapsack Problem on Parallel Computers 1991 91 INFCTRL Ronyai, Computing the Order of Centralizers in Linear Groups 1991 91 INFCTRL Chrobak & Karloff & Radzik, Connectivity vs. Reachability 1991 91 INFCTRL de Bruijn, Telescopic Mappings in Typed Lambda Calculus 1991 91 INFCTRL Coan & Dwork, Simultaneity Is Harder than Agreement 1991 91 INFCTRL Larsen & Winskel, Using Information Systems to Solve Recursive Domain Equations 1991 91 INFCTRL Bellatoni, Parallel Random Access Machines with Bounded Memory Wordsize 1991 91 INFCTRL Krause, Lower Bounds for Depth-Restricted Branching Programs 1991 91 INFCTRL Bidoit & Froidevaux, General Logical Databases and Programs: Default Logic Semantics and Stratification 1991 91 INFCTRL Amadio, Recursion over Realizability Structures 1991 91 INFCTRL Buss & Hay, On Truth-Table Reducibility to SAT 1991 91 INFCTRL Pruhs & Manber, The Complexity of Controlled Selection 1991 91 INFCTRL Geiger & Paz & Pearl, Axioms and Algorithms for Inferences Involving Probabilistic Independence 1991 91 INFCTRL von zur Gathen & Seroussi, Boolean Circuits versus Arithmetic Circuits 1991 90 INFCTRL Bach, Toward a Theory of Pollard's Rho Method 1991 90 INFCTRL Ko, Separating the Low and High Hierarchies by Oracles 1991 90 INFCTRL McColl & Paterson & Bowditch, Planar Acyclic Computation 1991 90 INFCTRL Dybjer, Inverse Image Analysis Generalises Strictness Analysis 1991 90 INFCTRL Majster-Cederbaum & Zetzsche, Towards a Foundation for Semantics in Complete Metric Spaces 1991 90 INFCTRL Bohm & Tronci, About Systems of Equations, X-Separability, and Left-Invertibility in the lambda-Calculus 1991 90 INFCTRL Linial & Mansour & Rivest, Results on Learnability and the Vapnik-Chervonenkis Dimension 1991 90 INFCTRL Kolaitis, The Expressive Power of Stratified Logic Programs 1991 90 INFCTRL Huynh, Effective Entropies and Data Compression 1991 90 INFCTRL Ibarra & Jiang & Chang & Ravikumar, Some Classes of Languages in NC^1 1991 90 INFCTRL Luo, A Higher-Order Calculus and Theory Abstraction 1990 89 INFCTRL Leivant, Inductive Definitions over Finite Structures 1990 89 INFCTRL Mix Barrington & Straubing & Therien, Non-uniform Automata over Groups 1990 89 INFCTRL Chlebus, Turing Machines with Access to History 1990 89 INFCTRL Finkel, Reduction and Covering of Infinite Reachability Trees 1990 89 INFCTRL Liu & Wrathall & Zeger, Efficient Solution of Some Problems in Free Partially Commutative Monoids 1990 89 INFCTRL Tofte, Type Inference for Polymorphic References 1990 89 INFCTRL Zaionc, A Characterization of Lambda Definable Tree Operations 1990 89 INFCTRL Ahlswede & Ye & Zhang, Creating Order in Sequence Spaces with Simple Machines 1990 88 INFCTRL Meseguer & Montanari, Petri Nets Are Monoids 1990 88 INFCTRL Dwork & Moses, Knowledge and Common Knowledge in a Byzantine Environment: Crash Failures 1990 88 INFCTRL Dauchet & Heuillard & Lescanne & Tison, Decidability of the Confluence of Finite Ground Term Rewrite Systems and of Other Related Term Rewrite Systems 1990 88 INFCTRL Kalyanasundaram & Schnitger, Rounds versus Time for the Two Person Pebble Game 1990 88 INFCTRL Pelletier & Sakarovitch, Easy Multiplications. II. Extensions of Rational Semigroups 1990 88 INFCTRL Itai & Rodeh, Symmetry Breaking in Distributed Networks 1990 88 INFCTRL Paturi & Seiferas & Simon & Newman-Wolfe, Milking the Aanderaa Argument 1990 87 INFCTRL Winskel, A Compositional Proof System on a Category of Labelled Transition Systems 1990 87 INFCTRL Cleaveland & Hennessy, Priorities in Process Algebras 1990 87 INFCTRL Fagin & Halpern & Megiddo, A Logic for Reasoning about Probabilities 1990 87 INFCTRL Gallier & Narendran & Plaisted & Snyder, Rigid E-Unification: NP-Completeness and Applications to Equational Matings 1990 87 INFCTRL Bruce & Longo, A Modest Model of Records, Inheritance, and Bounded Quantification 1990 87 INFCTRL Compton & Laflamme, An Algebra and a Logic for NC 1990 87 INFCTRL Bloom, Can LCF Be Topped? Flat Lattice Models of Typed lambda-Calculus 1990 87 INFCTRL Kolaitis & Vardi, 0-1 Laws and Decision Problems for Fragments of Second-Order Logic 1990 86 INFCTRL Asperti, Stability and Computability in Coherent Domains 1990 86 INFCTRL Frederickson, A Distributed Shortest Path Algorithm for a Planar Network 1990 86 INFCTRL Allender & Watanabe, Kolmogorov Complexity and Degrees of Tally Sets 1990 86 INFCTRL Goldstine & Kintala & Wotschke, On Measuring Nondeterminism in Regular Languages 1990 86 INFCTRL Fulop & Vagvolgyi, A Complete Rewriting System for a Monoid of Tree Transformation Classes 1990 86 INFCTRL Chang & Fan & Davisson, On Numerical Methods of Calculating the Capacity of Continuous-Input Discrete-Output Memoryless Channels 1990 86 INFCTRL Kapur & Narendran & Otto, On Ground-Confluence of Term Rewriting Systems 1990 86 INFCTRL Ash & Hall & Pin, On the Varieties of Languages Associated with Some Varieties of Finite Monoids with Commuting Idempotents 1990 86 INFCTRL Kanellakis & Smolka, CCS Expressions, Finite State Processes, and Three Problems of Equivalence 1990 86 INFCTRL Sack & Strothotte, A Characterization of Heaps and Its Applications 1990 86 INFCTRL Bodlaender, The Complexity of Finding Uniform Emulations on Paths and Ring Networks 1990 86 INFCTRL Litow, Parallel Complexity of the Regular Code Problem 1990 85 INFCTRL Tennent, Semantical Analysis of Specification Logic 1990 85 INFCTRL Meinel, Polynomial Size Omega-Branching Programs and Their Computational Power 1990 85 INFCTRL Conner, Sequential Machines Realized by Group Representations 1990 85 INFCTRL Walker, Bisimulation and Divergence 1990 85 INFCTRL Fulk, Prudence and Other Conditions on Formal Language Learning 1990 85 INFCTRL Courcelle, The Monadic Second-Order Logic of Graphs 1990 85 INFCTRL Bruce & Meyer & Mitchell, The Semantics of Second-Order Lambda Calculus 1990 84 INFCTRL America & de Boer, Proving Total Correctness of Recursive Procedures 1990 84 INFCTRL Engelfriet and Rozenberg, A Comparison of Boundary Graph Grammars and Context-Free Hypergraph Grammars 1990 84 INFCTRL Sakata, Extension of the Berlekamp-Massey Algorithm to N Dimensions 1990 84 INFCTRL Georgakopoulos & Kavadias, The Banker's Problem with Precedences 1990 84 INFCTRL Khuller, Extending Planar Graph Algorithms to K_3,3-Free Graphs 1990 84 INFCTRL Spreen, Computable One-to-One Enumerations of Effective Domains 1990 84 INFCTRL Lazrek & Lescanne & Thiel, Tools for Proving Inductive Equalities, Relative Completeness, and omega-Completeness 1990 84 INFCTRL Hagerup, Optimal Parallel Algorithms on Planar Graphs 1990 84 INFCTRL Afek & Landau & Schieber & Yung, The Power of Multimedia: Combining Point-to-Point and Multiaccess Networks 1990 84 INFCTRL Cai, A Note on the Determinant and Permanent Problem 1989 83 INFCTRL German & Clarke & Halpern, Reasoning about Procedures as Parameters in the Language L4 1989 83 INFCTRL Immerman & Kozen, Definability with Bounded Number of Bound Variables 1989 83 INFCTRL Arnold & Brlek, Optimal Word Chains for the Thue-Morse Word 1989 83 INFCTRL America & de Bakker & Kok & Rutten, Denotational Semantics of a Parallel Object-Oriented Language 1989 83 INFCTRL Smid & Overmars & Torenvliet & van Emde Boas, Maintaining Multiple Representations of Dynamic Data Structures 1989 83 INFCTRL Fich & Li & Ragde & Yesha, On the Power of Concurrent-Write PRAMs with Read-Only Memory 1989 83 INFCTRL Cho & Ginsburg, Decision Problems of Object Histories 1989 83 INFCTRL Turner, Approximation Algorithms for the Shortest Common Superstring Problem 1989 83 INFCTRL Itoh & Tsujii, Structure of Parallel Multipliers for a Class of Fields GF(2^m) 1989 83 INFCTRL Nivat & Saoudi, Automata on Infinite Objects and Their Applications to Logic and Programming 1989 83 INFCTRL Voigt & Wegener, Minimal Polynomials for the Conjunction of Functions on Disjoint Variables Can Be Very Simple 1989 83 INFCTRL Ahlswede & Zhang, Coding for Write-Efficient Memory 1989 83 INFCTRL Aggarwal & Booth & O'Rourke & Suri & Yap, Finding Minimal Convex Nested Polygons 1989 83 INFCTRL Estivill-Castro & Wood, A New Measure of Presortedness 1989 82 INFCTRL Ehrenfeucht & Haussler, Learning Decision Trees from Random Examples 1989 82 INFCTRL Ehrenfeucht & Haussler & Kearns & Valiant, A General Lower Bound on the Number of Examples Needed for Learning 1989 82 INFCTRL Anderson & Mayr & Warmuth, Parallel Approximation Algorithms for Bin Packing 1989 82 INFCTRL Stomp & de Roever & Gerth, The mu-Calculus as an Assertion-Language for Fairness Arguments 1989 82 INFCTRL Freivalds & Smith & Velauthapillai, Trade-Off among Parameters Affecting Inductive Inference 1989 82 INFCTRL Afrati & Papadimitriou & Papageorgiou, The Complexity of Cubical Graphs (Corrigendum) 1989 82 INFCTRL Bertoni & Mauri & Sabadini, Membership Problems for Regular and Context-Free Trace Languages 1989 82 INFCTRL Montenyohl & Wand, Incorporating Static Analysis in a Combinator-Based Compiler 1989 82 INFCTRL Babai & Moran, Proving Properties of Interactive Proofs by a Generalized Counting Technique 1989 82 INFCTRL Arnold & Dicky, An Algebraic Characterization of Transition System Equivalences 1989 82 INFCTRL Jouannaud & Kounalis, Automatic Proofs by Induction in Theories without Constructors 1989 82 INFCTRL Cai & Hemachandra, Enumerative Counting Is Hard 1989 82 INFCTRL Willard, Lower Bounds for the Addition-Subtraction Operations in Orthogonal Range Queries and Related Problems 1989 82 INFCTRL Droste, Recursive Domain Equations for Concrete Data Structures 1989 82 INFCTRL Lynch & Stark, A Proof of the Kahn Principle for Input/Output Automata 1989 82 INFCTRL Sinclair & Jerrum, Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains 1989 81 INFCTRL Ramanan, Average-case Analysis of the Smart Next Fit Algorithm 1989 81 INFCTRL Casas & Diaz & Steyaert, Average-case Analysis of Robinson's Unification Algorithm with Two Different Variables 1989 81 INFCTRL Bermudez & Logothetis, Simple Computation of LALR(1) Lookahead Sets 1989 81 INFCTRL Head, Deciding the Immutability of Regular Codes and Languages under Finite Transductions 1989 81 INFCTRL Olariu, A Simple Linear-time Algorithm for Computing the RNG and MST of Unimodal Polygons 1989 81 INFCTRL Khuller, On Computing Graph Closures 1989 81 INFCTRL Feinberg, Characterizing the Shortest Path of an Object among Obstacles 1989 81 INFCTRL Goldberg & Tarjan, A Parallel Algorithm for Finding a Blocking Flow in an Acyclic Network 1989 81 INFCTRL Falkowski, A Self-Optimizing Prolog Program and the Underlying Statistical Model 1989 81 INFCTRL Streett & Emerson, An Automata Theoretic Decision Procedure for the Propositional Mu-Calculus 1989 81 INFCTRL Senizergues, Church-Rosser Controlled Rewriting Systems and Equivalence Problems for Deterministic Context-Free Languages 1989 81 INFCTRL Istrail, An Arithmetical Hierarchy in Propositional Dynamic Logic 1989 81 INFCTRL Hrbacek, Convex Powerdomains II 1989 81 INFCTRL Coppersmith & Raghavan & Tompa, Parallel Graph Algorithms That Are Efficient on Average 1989 81 INFCTRL Cole & Vishkin, Faster Optimal Parallel Prefix Sums and List Ranking 1989 81 INFCTRL Schnitzlein & Stoss, Linear-Time Simulation of Multihead Turing Machines 1989 81 INFCTRL Willard & Reif, Parallel Processing Can Be Harmful: The Unusual Behavior of Interpolation Search 1989 81 INFCTRL Coquand & Gunter & Winskel, Domain Theoretic Models of Polymorphism 1989 81 INFCTRL Abrusci & Mascari, A Logic of Recursion 1989 81 INFCTRL Milner, A Complete Axiomatisation for Observational Congruence of Finite-State Behaviours 1989 81 INFCTRL Tiuryn, A Simplified Proof of DDL < DL 1989 81 INFCTRL Browne & Clarke & Grumberg, Reasoning about Networks with Many Identical Finite State Processes 1989 81 INFCTRL Gibbons & Rytter, Optimal Parallel Algorithms for Dynamic Expression Evaluation and Context-Free Recognition 1989 81 INFCTRL Fraenkel, The Use and Usefulness of Numeration Systems 1989 81 INFCTRL Ko, Distinguishing Conjunctive and Disjunctive Reducibilities by Sparse Sets 1989 81 INFCTRL Engelfriet & Leih, Linear Graph Grammars: Power and Complexity 1989 80 INFCTRL Karloff & Ruzzo, The Iterated Mod Problem 1989 80 INFCTRL Dymond & Cook, Complexity Theory of Parallel Time and Hardware 1989 80 INFCTRL Quinlan & Rivest, Inferring Decision Trees Using the Minimum Description Length Principle 1989 80 INFCTRL Porat & Francez, Fairness in Context-Free Grammars under Every Choice-Strategy 1989 80 INFCTRL Jenner & Kirsig & Lange, The Logarithmic Alternation Hierarchy Collapses: ASigma^L_2 = APi^L_2 1989 80 INFCTRL Klop & de Vrijer, Unique Normal Forms for Lambda Calculus with Surjective Pairing 1989 80 INFCTRL Engelfriet, The Power of Two-Way Deterministic Checking Stack Automata 1989 80 INFCTRL Bernot, Correctness Proofs for Abstract Implementations 1989 80 INFCTRL Vazirani, NC Algorithms for Computing the Number of Perfect Matchings in K_3,3-Free Graphs and Related Problems 1989 80 INFCTRL Cousot & Cousot, A Language Independent Proof of the Soundness and Completeness of Generalized Hoare Logic 1989 80 INFCTRL Torenvliet & van Emde Boas, Simplicity, Immunity, Relativizations and Nondeterminism 1989 80 INFCTRL Kleine Buning & Lowen, Optimizing Propositional Calculus Formulas with Regard to Questions of Deducibility 1989 80 INFCTRL Santha, Relativized Arthur-Merlin versus Merlin-Arthur Games 1989 80 INFCTRL Curien & Obtulowicz, Partiality, Cartesian Closedness, and Toposes 1988 79 INFCTRL Fulk, Saving the Phenomena: Requirements that Inductive Inference Machines Not Contradict Known Data 1988 79 INFCTRL Koymans & Shyamasundar & de Roever & Gerth & Arun-Kumar, Compositional Semantics for Real-Time Distributed Computing 1988 79 INFCTRL Trachtenberg, Fault Tolerant Computing and Reliable Communication: A Unified Approach 1988 79 INFCTRL Robinson & Rosolini, Categories of Partial Maps 1988 79 INFCTRL Rinat & Francez & Grumbert, Infinite Trees, Markings, and Well-Foundedness 1988 79 INFCTRL Stohr, A Trade-off between Page Number and Page Width of Book Embeddings of Graphs 1988 79 INFCTRL Tsaknakis & Papantoni-Kazakos, Outlier Resistant Filtering and Smoothing 1988 79 INFCTRL Van Gelder, A Satisfiability Tester for Non-clausal Propositional Calculus 1988 79 INFCTRL Hortala-Gonzalez & Lucio-Carrasco & Rodriguez-Artalejo, Some General Incompleteness Results for Partial Correctness Logics 1988 79 INFCTRL Itai & Rodeh, The Multi-Tree Approach to Reliability in Distributed Networks 1988 79 INFCTRL Benson & Ben-Shachar, Bisimulation of Automata 1988 79 INFCTRL Beaudry, Membership Testing in Commutative Transformation Semigroups 1988 78 INFCTRL Selman, Promise Problems Complete for Complexity Classes 1988 78 INFCTRL Itoh & Tsujii, A Fast Algorithm for Computing Multiplicative Inverses in GF(2^m) Using Normal Bases 1988 78 INFCTRL Efremidis & Papadimitriou & Sideris, Complexity Characterizations of Attribute Grammar Languages 1988 78 INFCTRL Vogler, The OI-Hierarchy Is Closed under Control 1988 78 INFCTRL Baeten & Bergstra, Global Renaming Operators in Concrete Process Algebra 1988 78 INFCTRL Landau, Some Remarks on Computing the Square Parts of Integers 1988 78 INFCTRL Babai & Just & Meyer auf der Heide, On the Limits of Computations with the Floor Function 1988 78 INFCTRL Compton, The Computational Complexity of Asymptotic Problems I: Partial Orders 1988 78 INFCTRL Hashiguchi, Algorithms for Determining Relative Star Height and Star Height 1988 78 INFCTRL Courcelle & Deransart, Proofs of Parallel Correctness for Attribute Grammars with Applications to Recursive Procedures and Logic Programming 1988 78 INFCTRL Li & Vitanyi, Tape versus Queue and Stacks: The Lower Bounds 1988 77 INFCTRL Westerdale, An Automaton Decomposition for Learning System Environments 1988 77 INFCTRL Cosmadakis, The Word and Generator Problems for Lattices 1988 77 INFCTRL Edelsbrunner & Preparata, Minimum Polygonal Separation 1988 77 INFCTRL Frougny, Linear Numeration Systems of Order Two 1988 77 INFCTRL Slot & van Emde Boas, The Problem of Space Invariance for Sequential Machines 1988 77 INFCTRL Bagchi & Sastry, One-Step Completely Orthogonalizable Codes from Generalized Quadrangles 1988 77 INFCTRL Dekkers, Reducibility of Types in Typed Lambda Calculus 1988 77 INFCTRL Osherson & Stob & Weinstein, Synthesizing Inductive Expertise 1988 77 INFCTRL Becker & Simon, How Robust Is the n-Cube? 1988 77 INFCTRL Welch & Lynch, A New Fault-Tolerant Algorithm for Clock Synchronization 1988 77 INFCTRL Amir & Gasarch, Polynomial Terse Sets 1988 77 INFCTRL Stanfel, Mathematical Optimization and the Synchronizing Properties of Encodings 1988 77 INFCTRL Pitt & Smith, Probability and Plurality for Aggregations of Learning Machines 1988 76 INFCTRL Coquand & Huet, The Calculus of Constructions 1988 76 INFCTRL Padawitz, The Equational Theory of Parameterized Specifications 1988 76 INFCTRL Cardelli, A Semantics of Multiple Inheritance 1988 76 INFCTRL Sannella & Tarlecki, Specifications in an Arbitrary Institution 1988 76 INFCTRL Mitchell, Polymorphic Type Inference and Containment 1988 76 INFCTRL Moggi, Partial Morphisms in Categories of Effective Objects 1988 76 INFCTRL Lampson & Burstall, Pebble, a Kernel Language for Modules and Abstract Data Types 1988 76 INFCTRL Spirakis, Optimal Parallel Randomized Algorithms for Sparse Addition and Identification 1988 76 INFCTRL Beame, Limits on the Power of Concurrent-Write Parallel Machines 1988 76 INFCTRL Nielson, Strictness Analysis and Denotational Abstract Interpretation 1987 75 INFCTRL Barendregt & Kennaway & Klop & Sleep, Needed Reduction and Spine Strategies for the Lambda Calculus 1987 75 INFCTRL Hauschildt & Valk, Safe States in Banker-like Resource Allocation Problems 1987 75 INFCTRL Kranakis, Fixed Point Equations with Parameters in the Projective Model 1987 75 INFCTRL Roscoe & Dathi, The Pursuit of Deadlock Freedom 1987 75 INFCTRL Angluin, Learning Regular Sets from Queries and Counterexamples 1987 75 INFCTRL Klein & Wood, The Node Visit Cost of Brother Trees 1987 75 INFCTRL Bracha, Asynchronous Byzantine Agreement Protocols 1987 75 INFCTRL Yamamoto & Noguchi, Comparison of the Power between Reversal-Bounded ATMs and Reversal-Bounded NTMs 1987 75 INFCTRL Mansour & Zaks, On the Bit Complexity of Distributed Computations in a Ring with a Leader 1987 75 INFCTRL Karpinski & Verbeek, On the Monte Carlo Space Constructible Functions and Separation Results for Probabilistic Complexity Classes 1987 75 INFCTRL Carlson, Time-Space Efficient Algorithms for Computing Convolutions and Related Problems 1987 75 INFCTRL He & Yesha, Parallel Recognition and Decomposition of Two Terminal Series Parallel Graphs 1987 75 INFCTRL Hagerup, Towards Optimal Parallel Bucket Sorting 1987 75 INFCTRL Broder & Dolev & Fischer & Simons, Efficient Fault-Tolerant Routings in Networks 1987 75 INFCTRL Waner & Wu, The Hierarchical Structure of Graph Searches 1987 74 INFCTRL Sakarovitch, Easy Multiplications. I. The Realm of Kleene's Theorem 1987 74 INFCTRL Hrbacek, Convex Powerdomains I 1987 74 INFCTRL Boppana & Lagarias, One-Way Functions and Circuit Complexity 1987 74 INFCTRL Santha, On Using Deterministic Functions to Reduce Randomness in Probabilistic Algorithms 1987 74 INFCTRL Marron & Ko, Identification of Pattern Languages from Examples and Queries 1987 74 INFCTRL Frederickson & Srinivas, On-line Updating of Solutions to a Class of Matroid Intersection Problems 1987 74 INFCTRL Kratsch, Finding the Minimum Bandwidth of an Interval Graph 1987 74 INFCTRL Welch, Simulating Synchronous Processors 1987 74 INFCTRL Krichevsky, Information Compression and Varshamov-Gilbert Bound 1987 74 INFCTRL Kirschenhofer & Prodinger, On the Recursion Depth of Special Tree Traversal Algorithms 1987 74 INFCTRL Peleg & Simons, On Fault Tolerant Routings in General Networks 1987 74 INFCTRL Yang & Masson, An Efficient Algorithm for Multiprocessor Fault Diagnosis Using the Comparison Approach 1987 74 INFCTRL Rozoy, The Dyck Language D_1'* Is Not Generated by Any Matrix Grammar of Finite Index 1987 73 INFCTRL Costa & Stirling, Weak and Strong Fairness in CCS 1987 73 INFCTRL Engelfriet & Vogler, Look-Ahead on Pushdowns 1987 73 INFCTRL Pacini & Turini, Semantics of Production Systems 1987 73 INFCTRL Li & Yesha, Separation and Lower Bounds for ROM and Nondeterministic Models of Parallel Computation 1987 73 INFCTRL Obtulowicz, Algebra of Constructions. I. The Word Problem for Partial Algebras 1987 73 INFCTRL Ginsburg & Gyssens, Object Histories Which Avoid Certain Subsequences 1987 73 INFCTRL Duris & Galil & Schnitger, Lower Bounds on Communication Complexity 1987 73 INFCTRL Teneketzis & Ho, The Decentralized Wald Problem 1987 73 INFCTRL Becker & Osthof, Layouts with Wires of Balanced Length 1987 73 INFCTRL Clerbout & Latteux, Semi-commutations 1987 73 INFCTRL Rytter, Parallel Time O(log n) Recognition of Unambiguous Context-free Languages 1987 72 INFCTRL Woll, Reductions among Number Theoretic Problems 1987 72 INFCTRL Dolev & Halpern & Simons & Strong, A New Look at Fault-Tolerant Network Routing 1987 72 INFCTRL Winskel, Petri Nets, Algebras, Morphisms, and Compositionality 1987 72 INFCTRL Papantoni-Kazakos, Qualitative Robustness in Time Series 1987 72 INFCTRL Mehlhorn & Preparata, Area-Time Optimal Division for T = Omega((log n)^{1 + epsilon}) 1987 72 INFCTRL Dezani-Ciancaglini & Zacchi, Type Theories, Normal Forms, and D_infinity-Lambda-Models 1987 72 INFCTRL Driscoll & Furst, Computing Short Generator Sequences 1987 72 INFCTRL Kutylowski, A Generalized Grzegorczyk Hierarchy and Low Complexity Classes 1987 72 INFCTRL Rawlins & Wood, Optimal Computation of Finitely Oriented Convex Hulls 1987 72 INFCTRL Gunter, Universal Profinite Domains 1987 72 INFCTRL Andreka & Guessarian & Nemeti, A Unifying Theorem for Algebraic Semantics and Dynamic Logics 1987 72 INFCTRL Thatte, A Refinement of Strong Sequentiality for Term Rewriting with Constructors 1987 72 INFCTRL Amir & Gabbay, Preservation of Expressive Completeness in Temporal Models 1986 71 INFCTRL Bodlaender & van Leeuwen, Simulation of Large Networks on Smaller Networks 1986 71 INFCTRL Papadimitriou & Yannakakis, A Note on Succinct Representations of Graphs 1986 71 INFCTRL Mohan & Srivas, Function Definitions in Term Rewriting and Applicative Programming 1986 71 INFCTRL Culik & Gruska & Salomaa, Systolic Trellis Automata: Stability, Decidability and Complexity 1986 71 INFCTRL Heller, On Relativized Exponential and Probabilistic Complexity Classes 1986 71 INFCTRL Damm & Goerdt, An Automata-Theoretical Characterization of the 0I-Hierarchy 1986 71 INFCTRL Yokouchi, Retraction Map Categories and Their Applications to the Construction of Lambda Calculus Models 1986 71 INFCTRL Zak, An Exponential Lower Bound for Real-Time Branching Programs 1986 71 INFCTRL MacQueen & Plotkin & Sethi, An Ideal Model for Recursive Polymorphic Types 1986 71 INFCTRL Karpinski & Verbeek, On the Power of Two-Way Random Generators and the Impossibility of Deterministic Poly-Space Simulation 1986 70 INFCTRL Hart & Sharir, Probabilistic Propositional Temporal Logics 1986 70 INFCTRL Royer, Inductive Inference of Approximations 1986 70 INFCTRL Moriya & Iwata & Kasai, A Note on Some Simultaneous Relations among Time, Space, and Reversal for Single Work Tape Nondeterministic Turing Machines 1986 70 INFCTRL Gacs, Every Sequence Is Reducible to a Random One 1986 70 INFCTRL Lausen & Soisalon-Soininen & Widmayer, Pre-analysis Locking 1986 70 INFCTRL Denenberg & Gurevich & Shelah, Definability by Constant-Depth Polynomial-Size Circuits 1986 70 INFCTRL Atzeni & Morfuni, Functional Dependencies and Constraints on Null Values in Database Relations 1986 70 INFCTRL Cole & Vishkin, Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking 1986 70 INFCTRL Orponen & Schoening, The Density and Complexity of Polynomial Cores for Intractable Sets 1986 70 INFCTRL Osherson & Stob & Weinstein, Aggregating Inductive Expertise 1986 69 INFCTRL Atallah & Hambrusch, Solving Tree Problems on a Mesh-Connected Processor Array 1986 69 INFCTRL Curien, Categorical Combinators 1986 69 INFCTRL Daley & Smith, On the Complexity of Inductive Inference 1986 69 INFCTRL File, Machines for Attribute Grammars 1986 69 INFCTRL Homer & Reif, Arithmetic Theories for Computational Complexity Problems 1986 69 INFCTRL Rozenberg & Welzl, Boundary NLC Graph Grammars--Basic Definitions, Normal Forms, and Complexity 1986 69 INFCTRL Seiferas, A Simplified Lower Bound for Context-Free-Language Recognition 1986 69 INFCTRL Zachos & Heller, A Decisive Characterization of BPP 1986 68 INFCTRL Apt & Delporte-Gallet, Syntax Directed Analysis of Liveness Properties of While Programs 1986 68 INFCTRL Brandt, The Position of Index Sets of Identifiable Sets in the Arithmetical Hierarchy 1986 68 INFCTRL Chazelle & Cole & Preparata & Yap, New Upper Bounds for Neighbor Searching 1986 68 INFCTRL Flanagan, An Optimally Data Efficient Isomorphism Inference Algorithm 1986 68 INFCTRL Graf & Sifakis, A Logic for the Description of Non-deterministic Programs and Their Properties 1986 68 INFCTRL Graf & Sifakis, A Modal Characterization of Observational Congruence on Finite Terms of CCS 1986 68 INFCTRL Hoffmann & Mehlhorn & Rosentiehl & Tarjan, Sorting Jordan Sequences in Linear Time Using Level-Linked Search Trees 1986 68 INFCTRL Huynh, A Superexponential Lower Bound for Grobner Bases and Church-Rosser Commutative Thue Systems 1986 68 INFCTRL Immerman, Relational Queries Computable in Polynomial Time 1986 68 INFCTRL Lynch & Griffeth & Fischer & Guibas, Probabilistic Analysis of a Network Resource Allocation Algorithm 1986 68 INFCTRL Poigne, On Specifications, Theories, and Models with Higher Types 1986 68 INFCTRL Townsend, A Polynomial Jump Operator 1985 67 INFCTRL Balcazar & Diaz & Gabarro, Uniform Characterizations of Non-uniform Complexity Measures 1985 67 INFCTRL Blass & Gurevich & Kozen, A Zero-One Law for Logic with a Fixed-Point Operator 1985 67 INFCTRL Galil, Optimal Parallel Algorithms for String Matching 1985 67 INFCTRL Hennessy & Stirling, The Power of the Future Perfect in Program Logics 1985 67 INFCTRL Ibarra & Kim & Rosier, On Space and Time Efficient TM Simulations of Some Restricted Classes of PDA's 1985 67 INFCTRL Ibarra & Kim & Rosier, Some Characterizations of Multihead Finite Automata 1985 67 INFCTRL Karpinski & Verbeek, There Is No Polynomial Deterministic Space Simulation of Probabilistic Space with a Two-Way Random-Tape Generator 1985 67 INFCTRL Meyer auf der Heide, Lower Time Bounds for Solving Linear Diophantine Equations on Several Parallel Computational Models 1985 67 INFCTRL Robson, Alternation with Restrictions on Looping 1985 67 INFCTRL Rytter, Fast Recognition of Pushdown Automaton and Context-free Languages 1985 67 INFCTRL Szwerinski, Symmetrical One-Dimensional Cellular Spaces 1985 67 INFCTRL Tsakalidis, AVL-Trees for Localized Search 1985 67 INFCTRL Vishkin, Optimal Parallel Pattern Matching in Strings 1985 67 INFCTRL Wegener, The Critical Complexity of All (Monotone) Boolean Functions and Monotone Graph Properties 1985 66 INFCTRL Adachi, Powerposets 1985 66 INFCTRL Afrati & Papadimitriou & Papageorgiou, The Complexity of Cubical Graphs 1985 66 INFCTRL Amir, Separation in Nonlinear Time Models 1985 66 INFCTRL Blum, An Area-Maximum Edge Length Trade-off for VLSI Layout 1985 66 INFCTRL Frederickson, Implicit Data Structures for Weighted Elements 1985 66 INFCTRL Grabowski, On Relative Completeness of Hoare Logics 1985 66 INFCTRL Grumberg & Francez & Makowsky & de Roever, A Proof Rule for Fair Termination of Guarded Commands 1985 66 INFCTRL Huynh, The Complexity of Equivalence Problems for Commutative Grammars 1985 66 INFCTRL Kaltofen, Effective Hilbert Irreducibility 1985 66 INFCTRL Kannan, Unraveling k-Page Graphs 1985 66 INFCTRL Rounds, On the Relationships between Scott Domains, Synchronization Trees, and Metric Spaces 1985 66 INFCTRL Stern, Complexity of Some Problems from the Theory of Automata 1985 65 INFCTRL Ambos-Spies, Sublattices of the Polynomial Time Degrees 1985 65 INFCTRL Dershowitz, Computing with Rewrite Systems 1985 65 INFCTRL Grant & Minker, Normalization and Axiomatization for Numerical Dependencies 1985 65 INFCTRL Hartmanis & Immerman & Sewelson, Sparse Sets in NP-P: EXPTIME versus NEXPTIME 1985 65 INFCTRL Ibarra & Rosier, On Simple Programs with Primitive Conditional Statements 1985 65 INFCTRL Ibarra & Rosier, The Equivalence Problem and Correctness Formulas for a Simple Class of Programs 1985 65 INFCTRL Kfoury, Definability by Deterministic and Non-deterministic Programs (with Applications to First-Order Dynamic Logic) 1985 65 INFCTRL Plaisted, Semantic Confluence Tests and Completion Methods 1985 65 INFCTRL Statman, Logical Relations and the Typed Lambda-Calculus 1985 64 INFCTRL Chazelle, How to Search in History 1985 64 INFCTRL Cook, A Taxonomy of Problems with Fast Parallel Algorithms 1985 64 INFCTRL De Nicola, Two Complete Axiom Systems for a Theory of Communicating Sequential Processes 1985 64 INFCTRL Furst & Lipton & Stockmeyer, Pseudorandom Number Generation and Space Complexity 1985 64 INFCTRL Harel & Sherman, Propositional Dynamic Logic of Flowcharts 1985 64 INFCTRL Hertel & Mehlhorn, Fast Triangulation of the Plane with Respect to Simple Polygons 1985 64 INFCTRL Reischuk, A New Solution for the Byzantine Generals Problem 1985 64 INFCTRL Ukkonen, Algorithms for Approximate String Matching 1984 63 INFCTRL Ajtai & Fredman & Komlos, Hash Functions for Priority Queues 1984 63 INFCTRL Arazi, An Approach for Generating Different Types of Gray Codes 1984 63 INFCTRL Cole & Yap, Geometric Retrieval Problems 1984 63 INFCTRL Ehrenfeucht & Rozenberg, An Easy Proof of Greibach Normal Form 1984 63 INFCTRL Feldman, A Decidable Propositional Dynamic Logic with Explicit Probabilities 1984 63 INFCTRL Franzblau & Kleitman, An Algorithm for Covering Polygons with Rectangles 1984 63 INFCTRL Gouda & Manning & Yu, On the Progress of Communication between Two Finite State Machines 1984 63 INFCTRL Guting, Dynamic C-Oriented Polygonal Intersection Searching 1984 63 INFCTRL Harel & Kozen, A Programming Language for the Inductive Sets, and Applications 1984 63 INFCTRL Kleijn & Penttonen & Rozenberg & Salomaa, Direction Independent Context-Sensitive Grammars 1984 63 INFCTRL Narendran & Otto & Winklmann, The Uniform Conjugacy Problem for Finite Church-Rosser Thue Systems Is NP-Complete 1984 63 INFCTRL Robson, Fast Probabilistic RAM Simulation of Single Tape Turing Machine Computations 1984 63 INFCTRL Sistla & Clarke & Francez & Meyer, Can Message Buffers Be Axiomatized in Linear Temporal Logic? 1984 62 INFCTRL Friedman, On the Spectra of Universal Relational Sentences 1984 62 INFCTRL Giannini & Longo, Effectively Given Domains and Lambda-Calculus Models 1984 62 INFCTRL Hong, On Similarity and Duality of Computation (I) 1984 62 INFCTRL Itzhaik & Yehudai, An Intermediate Machine Technique for Deciding Equivalence between a DPDA and a Linear DPDA 1984 62 INFCTRL Krichevsky, Optimal Hashing 1984 62 INFCTRL Ladner & Stockmeyer & Lipton, Alternation Bounded Auxiliary Pushdown Automata 1984 62 INFCTRL Lundelius & Lynch, An Upper and Lower Bound for Clock Synchronization 1984 62 INFCTRL Main & Benson, Functional Behavior of Nondeterministic and Concurrent Programs 1984 62 INFCTRL Munro & Poblete, Fault Tolerance and Storage Reduction in Binary Search Trees 1984 62 INFCTRL Wegener, Optimal Decision Trees and One-Time-Only Branching Programs for Symmetric Boolean Functions 1984 62 INFCTRL Wijshoff & van Leeuwen, Arbitrary versus Periodic Storage Schemes and Tessellations of the Plane Using One Type of Polyomino 1984 61 INFCTRL Beeri & Vardi, On Acyclic Database Decompositions 1984 61 INFCTRL Broy, Semantics of Communicating Processes 1984 61 INFCTRL Coffman & Gilbert, Dynamic, First-Fit Packings in Two or More Dimensions 1984 61 INFCTRL Doberkat, An Average Case Analysis of Floyd's Algorithm to Construct Heaps 1984 61 INFCTRL Emerson & Sistla, Deciding Full Branching Time Logic 1984 61 INFCTRL Even & Selman & Yacobi, The Complexity of Promise Problems with Applications to Public-Key Cryptography 1984 61 INFCTRL Feng & Tzeng, On Quasi-Perfect Property of Double-Error-Correcting Goppa Codes and Their Complete Decoding 1984 61 INFCTRL Gurevich & Lewis, A Logic for Constant-Depth Circuits 1984 61 INFCTRL Levin, Randomness Conservation Inequalities; Information and Independence in Mathematical Theories 1984 61 INFCTRL Mohan & Fussell & Silberschatz, Compatibility and Commutativity of Lock Modes 1984 61 INFCTRL Niwinski, Fixed-Point Characterization of Context-Free infinity-Languages 1984 61 INFCTRL Schmitt, Diamond Formulas: A Fragment of Dynamic Logic with Recursively Enumerable Validity Problem 1984 61 INFCTRL Thiagarajan & Vos, A Fresh Look at Free Choice Nets 1984 61 INFCTRL Yamasaki & Doshita, Erratum: The Satisfiability Problem for a Class Consisting of Horn Sentences and Non-Horn Sentences in Propositional Logic 1984 60 INFCTRL Back & Mannila, A Semantic Approach to Program Modularity 1984 60 INFCTRL Bergstra & Klop, Process Algebra for Synchronous Communication 1984 60 INFCTRL Duris & Galil & Paul & Reischuk, Two Nonlinear Lower Bounds for On-Line Computations 1984 60 INFCTRL Falaschi & Levi & Palamidessi, A Synchronization Logic: Axiomatics and Formal Semantics of Generalized Horn Clauses 1984 60 INFCTRL Harel & Peleg, On Static Logics, Dynamic Logics, and Complexity Classes 1984 60 INFCTRL Loui, The Complexity of Sorting on Distributed Systems 1984 60 INFCTRL Papantoni-Kazakos, A Game Theoretic Approach to Robust Filtering 1984 60 INFCTRL Soisalon-Soininen & Widmayer, On the Complexity of Concurrency Control by Locking in Distributed Database Systems 1984 60 INFCTRL Tiuryn, Unbounded Program Memory Adds to the Expressive Power of First-Order Programming Logic 1983 59 INFCTRL Barany & Furedi, Mental Poker with Three or More Players 1983 59 INFCTRL Barendregt & Rezus, Semantics for Classical AUTOMATH and Related Systems 1983 59 INFCTRL Ehrenfeucht & Rozenberg, Repetition of Subwords in D0L Languages 1983 59 INFCTRL Hennessy, Synchronous and Asynchronous Experiments on Processes 1983 59 INFCTRL Schmeck, Algebraic Semantics of Recursive Flowchart Schemes 1983 59 INFCTRL Staiger, Subspaces of GF(q)^omega and Convolutional Codes 1983 59 INFCTRL Stolboushkin, Regular Dynamic Logic Is Not Interpretable in Deterministic Context-Free Dynamic Logic 1983 59 INFCTRL Weiss, An n^{3/2} Lower Bound on the Monotone Network Complexity of the Boolean Convolution 1983 59 INFCTRL Yamasaki & Doshita, The Satisfiability Problem for a Class Consisting of Horn Sentences and Some Non-Horn Sentences in Propositional Logic 1983 58 INFCTRL Borodin & Cook & Pippenger, Parallel Computation for Well-Endowed Rings and Space-Bounded Probabilistic Machines 1983 58 INFCTRL Cosmadakis, The Complexity of Evaluating Relational Queries 1983 58 INFCTRL Gasarch & Homer, Relativizations Comparing NP and Exponential Time 1983 58 INFCTRL Ko, On the Computational Complexity of Ordinary Differential Equations 1983 58 INFCTRL Lorenc & Lapins, Discrete Random Process Stabilization 1983 58 INFCTRL Mehlhorn & Preparata, Area-Time Optimal VLSI Integer Mutliplier with Minimum Computation Time 1983 58 INFCTRL Steyaert & Flajolet, Patterns and Pattern-Matching in Trees: An Analysis 1983 58 INFCTRL Urzyczyn, Nontrivial Definability by Flow-Chart Programs 1983 58 INFCTRL Witsenhausen & Wyner, Erratum: On Storage Media with Aftereffects 1983 57 INFCTRL Csirmaz, On the Strength of ``Sometimes'' and ``Always'' in Program Verification 1983 57 INFCTRL Golson & Rounds, Connections between Two Theories of Concurrency: Metric Spaces and Synchronization Trees 1983 57 INFCTRL Goltz & Resig, The Non-sequential Behavior of Petri Nets 1983 57 INFCTRL Grandjean, Complexity of the First-Order Theory of Almost All Finite Structures 1983 57 INFCTRL Halpern, Deterministic Process Logic Is Elementary 1983 57 INFCTRL Huynh, Commutative Grammars: The Complexity of Uniform Word Problems 1983 57 INFCTRL Kamimura, Tree Automata and Attribute Grammars 1983 57 INFCTRL Kurtz, On the Random Oracle Hypothesis 1983 57 INFCTRL Restivo & Reutenauer, Some Applications of a Theorem of Shirshov to Language Theory 1983 57 INFCTRL Stockmeyer, Optimal Orientations of Cells in Slicing Floorplan Designs 1983 57 INFCTRL Stolboushkin & Taitslin, Deterministic Dynamic Logic Is Strictly Weaker than Dynamic Logic 1983 57 INFCTRL Wand, Loops in Combinator-Based Compilers 1983 56 INFCTRL Case, Pseudo-Extensions of Computable Functions 1983 56 INFCTRL Culik & Salomaa, Ambiguity and Decision Problems Concerning Number Systems 1983 56 INFCTRL Davis & Weyuker, A Formal Notion of Program-Based Test Data Adequacy 1983 56 INFCTRL Galperin & Wigderson, Succinct Representations of Graphs 1983 56 INFCTRL Meyer & Mitchell, Termination Assertions for Recursive Programs: Completeness and Axiomatic Definability 1983 56 INFCTRL Miller, Isomorphism of Graphs Which are Pairwise k-Separable 1983 56 INFCTRL Miller, Isomorphism of k-Contractible Graphs. A Generalization of Bounded Valence and Bounded Genus 1983 56 INFCTRL Mitchell, The Implication Problem for Functional and Inclusion Dependencies 1983 56 INFCTRL Urzyczyn, A Necessary and Sufficient Condition in Order That a Herbrand Interpretation Be Expressive Relative to Recursive Programs 1983 56 INFCTRL Vishkin & Wigderson, Dynamic Parallel Memories 1983 56 INFCTRL von Braunmuhl & Cook & Mehlhorn & Verbeek, The Recognition of Deterministic CFLs in Small Time and Space 1983 56 INFCTRL Witsenhausen & Wyner, On Storage Media with Aftereffects 1983 56 INFCTRL Wolper, Temporal Logic Can Be More Expressive 1982 55 INFCTRL Berkling & Fehr, A Consistent Extension of the Lambda-Calculus as a Base for Functional Programming Languages 1982 55 INFCTRL Blake, The Enumeration of Certain Run Length Sequences 1982 55 INFCTRL Blass & Gurevich, On the Unique Satisfiability Problem 1982 55 INFCTRL Dolev & Even & Karp, On the Security of Ping-Pong Protocols 1982 55 INFCTRL Eisenbarth & Ziviani & Gonnet & Mehlhorn & Wood, The Theory of Fringe Analysis and Its Application to 2-3 Trees and B-Trees 1982 55 INFCTRL Even & Long & Yacobi, A Note on Deterministic and Nondeterministic Time Complexity 1982 55 INFCTRL Gurevich & Lewis, The Inference Problem for Template Dependencies 1982 55 INFCTRL Harel & Sherman, Looping vs. Repeating in Dynamic Logic 1982 55 INFCTRL Ito & Inoue & Takanami & Taniguchi, Two-Dimensional Alternating Turing Machines with Only Universal States 1982 55 INFCTRL Kannan, Circuit-Size Lower Bounds and Non-reducibility to Sparse Sets 1982 55 INFCTRL Neuhoff & Shields, Channel Distances and Representation 1982 55 INFCTRL Porat & Francez & Moran & Zaks, Fair Derivations in Context-Free Grammars 1982 55 INFCTRL Rivest & Shamir, How to Reuse a ``Write-Once'' Memory 1982 55 INFCTRL Simon, A Tight Omega(log log n)-Bound on the Time for Parallel RAM's to Compute Nondegenerated Boolean Functions 1982 55 INFCTRL Vitanyi, On Efficient Simulations of Multicounter Machines 1982 54 INFCTRL Bergstra & Tucker, The Completeness of the Algebraic Specification Methods for Computable Data Types 1982 54 INFCTRL Blair, The Recursion-Theoretic Complexity of the Semantics of Predicate Logic as a Programming Language 1982 54 INFCTRL Davis, Why Goedel Didn't Have Church's Thesis 1982 54 INFCTRL de Bakker & Zucker, Processes and the Denotational Semantics of Concurrency 1982 54 INFCTRL Duris & Galil, On Reversal-Bounded Counter Machines and on Pushdown Automata with a Bound on the Size of the Pushdown Store 1982 54 INFCTRL Manders & Daley, The Complexity of the Validity Problem for Dynamic Logic 1982 54 INFCTRL Maurer & Rozenberg & Welzl, Using String Languages to Describe Picture Languages 1982 54 INFCTRL Ronchi della Rocca, Characterization Theorems for a Filter Lambda Model 1982 54 INFCTRL Streett, Propositional Dynamic Logic of Looping and Converse Is Elementarily Decidable 1982 54 INFCTRL Zachos, Robustness of Probabilistic Computational Complexity Classes under Definitional Perturbations 1982 53 INFCTRL Borden, Optimal Asymmetric Error Detecting Codes 1982 53 INFCTRL Golze & Priese, Petri Net Implementations by a Universal Cell Space 1982 53 INFCTRL Hashiguchi, Regular Languages of Star Height One 1982 53 INFCTRL Kantor, An Exponential Number of Generalized Kerdock Codes 1982 53 INFCTRL Ko, Some Negative Results on the Computational Complexity of Total Variation and Differentiation 1982 53 INFCTRL Lehmann & Shelah, Reasoning with Time and Chance 1982 53 INFCTRL Minamide, An Extension of the Entropy Theorem for Parameter Estimation 1982 53 INFCTRL Nath & Mohan Kaur, On Some Characterizations of the Shannon Entropy Using Extreme Symmetry and Block Symmetry 1982 53 INFCTRL Osherson & Stob & Weinstein, Learning Strategies 1982 53 INFCTRL Papadimitriou & Tsitsiklis, On the Complexity of Designing Distributed Protocols 1982 53 INFCTRL Paul, On-Line Simulation of k+1 Tapes by k Tapes Requires Nonlinear Time 1982 53 INFCTRL Reed & Rosenfeld, Recognition of Surfaces in Three-Dimensional Digital Images 1982 53 INFCTRL Sifakis, Global and Local Invariants in Transition Systems 1982 53 INFCTRL Sippu & Soisalon-Soininen, On LL(k) Parsing 1982 53 INFCTRL Sippu, Derivational Complexity of Context-Free Grammars 1982 52 INFCTRL Albert & Culik & Karhumaki, Test Sets for Context Free Languages and Algebraic Systems of Equations over a Free Monoid 1982 52 INFCTRL Arbib & Manes, Parametrized Data Types Do Not Need Highly Constrained Parameters 1982 52 INFCTRL Bergstra & Chmielinska & Tiuryn, Another Incompleteness Result for Hoare's Logic 1982 52 INFCTRL Borodin & von zur Gathen & Hopcroft, Fast Parallel Matrix and GCD Computations 1982 52 INFCTRL Butzer & Engels, Dyadic Calculus and Sampling Theorems for Functions with Multidimensional Domain. II. Applications to Dyadic Sampling Representations 1982 52 INFCTRL Butzer & Engels, Dyadic Calculus and Sampling Theorems for Functions with Multidimensional Domain. I. General Theory 1982 52 INFCTRL Chen, Tradeoffs in the Inductive Inference of Nearly Minimal Size Programs 1982 52 INFCTRL Courcelle & Franchi-Zannettacci, On the Equivalence Problem for Attribute Systems 1982 52 INFCTRL Daley, Busy Beaver Sets: Characterizations and Applications 1982 52 INFCTRL Dolev & Fischer & Fowler & Lynch & Strong, An Efficient Algorithm for Byzantine Agreement without Authentication 1982 52 INFCTRL Hay, On the Recursion-Theoretic Complexity of Relative Succinctness of Representations of Languages 1982 52 INFCTRL Kleijn & Rozenberg, Corrigendum: Sequential, Continuous, and Parallel Grammars 1982 52 INFCTRL Koymans, Models of the Lambda Calculus 1982 52 INFCTRL Menzel & Sperschneider, Universal Automata with Uniform Bounds on Simulation Time 1982 52 INFCTRL Meyer, What is a Model of the Lambda Calculus? 1982 52 INFCTRL Osherson & Weinstein, Criteria of Language Learning 1982 52 INFCTRL Selman, Analogues of Semirecursive Sets and Effective Reducibilities to the Study of NP Complexity 1982 52 INFCTRL Soare, Computational Complexity of Recursively Enumerable Sets 1982 52 INFCTRL Tomita, A Direct Branching Algorithm for Checking Equivalence of Some Classes of Deterministic Pushdown Automata 1981 51 INFCTRL Angluin, A Note on the Number of Queries Needed to Identify Regular Languages 1981 51 INFCTRL Breazu & Stanasila, A Generalization of Kleene's Theorem and Nondeterministic Structured Programming 1981 51 INFCTRL Culik & Wood, A Note on Recurrent Words 1981 51 INFCTRL Ferentinos & Papaioannou, New Parametric Measures of Information 1981 51 INFCTRL Gacs & Levin, Causal Nets or What is a Deterministic Computation? 1981 51 INFCTRL Goles & Martinez, A Short Proof on the Cyclic Behaviour of Multithreshold Symmetric Automata 1981 51 INFCTRL Goles & Olivos, The Convergence of Symmetric Threshold Automata 1981 51 INFCTRL Hashimoto, A Direct Proof of the Equality between the Block Definition and the Process Definition of Distortion-Rate Functions for Stationary Ergodic Sources 1981 51 INFCTRL Hennessy, A Term Model for Synchronous Processes 1981 51 INFCTRL Kunze & Shyr & Thierrin, H-Bounded and Semi-discrete Languages 1981 51 INFCTRL Maurer & Sudborough & Welzl, On the Complexity of the General Coloring Problem 1981 51 INFCTRL McKeague, On the Capacity of Channels with Gaussian and Non-Gaussian Noise 1981 51 INFCTRL Morgenthaler & Rosenfeld, Surfaces in Three-Dimensional Digital Images 1981 51 INFCTRL Nomura, Homomorphisms and Congruences for Abstract Feedback Systems 1981 51 INFCTRL Paun, Corrigendum to ``The Complement of a Finite Index Matrix Language is Context Sensitive'' 1981 51 INFCTRL Shiozaki, Proposal of a New Coding Pattern in Orchard Scheme 1981 51 INFCTRL Sontag, Conditions for Abstract Nonlinear Regulation 1981 51 INFCTRL Upton, An Extension of Tree Adjunct Grammars 1981 51 INFCTRL Witteveen & Boelens, Inferring Control Structures from the Behaviour of a Production System 1981 51 INFCTRL Xu Ziwei, On the Representation and Enumeration of Fuzzy Switching Functions 1981 50 INFCTRL Moriya, An Incompleteness Theorem for One-Dimensional Binary Cellular Acceptors 1981 50 INFCTRL Maurer & Salomaa & Wood, On Predecessors of Finite Languages 1980 45 INFCTRL Hofri, Two-Dimensional Packing: Expected Performance of Simple Level Algorithms 1980 45 INFCTRL Hughes, Derivatives and Quotients of Prefix-Free Context-Free Languages 1980 45 INFCTRL Daley, Quantitative and Qualitative Information in Computations 1979 43 INFCTRL Engelfriet & Rozenberg, Equality Languages and Fixed Point Languages 1979 43 INFCTRL Wagner, On omega-Regular Sets 1979 43 INFCTRL Book, A Remark on Tally Languages and Complexity Classes 1977 35 INFCTRL Culik & Fris, The Decidability of the Equivalence Problem for D0L-Systems 1976 30 INFCTRL Sudborough, One-Way Multihead Writing Finite Automata 1976 30 INFCTRL Valiant, A Note on the Succinctness of Descriptions of Deterministic Languages 1975 28 INFCTRL Grasselli, Synchronization of Cellular Arrays: The Firing Squad Problem in Two Dimensions 1974 26 INFCTRL Butler, A Note on Cellular Automata Simulations 1974 25 INFCTRL Sudborough, Bounded-Reversal Multihead Finite Automata Languages 1974 24 INFCTRL Jump & Kirtane, On the Interconnection Structure of Cellular Networks 1973 22 INFCTRL Ginsburg & Goldstine, Intersection-Closed Full AFL and the Recursively Enumerable Languages 1972 21 INFCTRL Joshi & Kosaraju & Yamada, String Adjunct Grammars: I. Local and Distributed Adjunction 1972 21 INFCTRL Joshi & Kosaraju & Yamada, String Adjunct Grammars: II. Equational Representation, Null Symbols, and Linguistic Relevance 1972 21 INFCTRL Amoroso & Guilfoyle, Some Comments on Neighborhood Size for Tessellation Automata 1972 21 INFCTRL Meyer, Program Size in Restricted Programming Languages 1972 20 INFCTRL Ritchie, Language Recognition by Marking Automata 1971 19 INFCTRL Aho & Ullman, Translations on a Context Free Grammar 1971 19 INFCTRL Book & Wegbreit, A Note on AFLs and Bounded Erasing 1971 19 INFCTRL Jump & Marathe, On the Length of Feedback Shift Registers 1971 18 INFCTRL Smith, Cellular Automata Complexity Trade-Offs 1971 18 INFCTRL Yamada & Amoroso, Structural and Behavioral Equivalences of Tessellation Automata 1970 16 INFCTRL Delsarte & Goethals & Mac Williams, On Generalized Reed-Muller Codes and Their Relatives 1970 16 INFCTRL Loekx, The Parsing for General Phrase-Structure Grammars 1970 16 INFCTRL Paz, Counterexamples and Bounds for Graphs Solvable with Finite Delay 1970 16 INFCTRL Chan, A Computer Processing Queueing System with Feedback 1970 16 INFCTRL Gelenbe, On Languages Defined by Linear Probabilistic Automata 1970 16 INFCTRL Zierler, On x^n+x+1 over GF(2) 1970 16 INFCTRL Duncan, Likelihood Functions for Stochastic Signals in White Noise 1970 16 INFCTRL Bleustein, Exponential Error Bounds for Discrete Memoryless Channels with Sequential Decision Feedback 1970 16 INFCTRL Mandelbaum, On Efficient Burst Correcting Residue Polynomial Codes 1970 16 INFCTRL Fine, Extrapolation When Very Little is Known about the Source 1970 16 INFCTRL Gabrielian, The Theory of Interacting Local Automata 1970 16 INFCTRL Chazan & Weiss, Higher Order Autocorrelation Functions as Translation Invariants 1970 16 INFCTRL Cerny, Approximation in the Space of Information Channels 1970 16 INFCTRL van Lint, On the Nonexistence of Perfect 2- and 3-Hamming-Error-Correcting Codes over GF(q) 1970 16 INFCTRL Yasui & Yajima, Two-State Two-Symbol Probabilistic Automata 1970 16 INFCTRL Reddy & Davida & Robinson, A Class of High-Rate Double-Error-Correcting Convolutional Codes 1970 16 INFCTRL Hsu, A Large Class of Cyclic and Shortened Cyclic Binary Codes for Multiple Error Correction 1970 16 INFCTRL Montanari, Separable Graphs, Planar Graphs and Web Grammars 1970 16 INFCTRL Augustin, Infinite-Alphabet Channels and the Method of Codes of a Fixed Composition 1970 16 INFCTRL Knast, Representability of Nonregular Languages in Finite Probabilistic Automata 1970 16 INFCTRL Guiasu, An Informational Model for Two-Person Games 1970 16 INFCTRL Korsh, On Decisions and Information Concerning an Unknown Parameter 1970 16 INFCTRL Patrick & Fischer, A Generalized k-Nearest Neighbor Rule 1970 16 INFCTRL Tavares & Fukada, Synchronization of a Class of Codes Derived from Cyclic Codes 1970 16 INFCTRL Wolf & Wyner & Ziv, The Channel Capacity of the Postal Channel 1970 16 INFCTRL Kuich, On the Entropy of Context-Free Languages 1970 16 INFCTRL Jones, A Note on the Index of a Context-Free Language 1970 16 INFCTRL Tzannes & Spencer & Kaplan, On Estimating the Entropy of Random Fields 1970 16 INFCTRL Greibach, Full AFLs and Nested Iterated Substitution 1970 16 INFCTRL Daroczy, Generalized Information Functions 1970 16 INFCTRL Vairavan, Input-Output Relations of Finite Memory Systems 1970 16 INFCTRL Stucky & Walter, Minimal Linear Realizations of Autonomous Automata 1970 16 INFCTRL Fukunaga & Koontz, Representation of Random Processes Using the Finite Karhunen-Loeve Expansion 1970 16 INFCTRL Pu, Erratum: Generalized Decomposition of Incomplete Finite Automata 1970 17 INFCTRL Block, review of Minsky and Papert (1969) 1969 15 INFCTRL Loveland, A Variant of the Kolmogorov Concept of Complexity 1969 15 INFCTRL Gallaire, Recognition Time of Context-Free Languages by On-Line Turing Machines 1969 15 INFCTRL Jump, A Note on the Iterative Decomposition of Finite Automata 1969 14 INFCTRL Yamada & Amoroso, Tessellation Automata 1968 13 INFCTRL Aho & Hopcroft & Ullman, Time and Tape Complexity of Pushdown Automaton Languages 1967 11 INFCTRL Blum, On the Size of Machines 1967 11 INFCTRL Fischer, Turing Machines with a Schedule to Keep 1967 11 INFCTRL Kasami, A Note on Computing Time for Recognition of Languages Generated by Linear Grammars 1967 11 INFCTRL Stearns, A Regularity Test for Pushdown Machines 1966 9 INFCTRL Chen, A Note on Sequential Decision Approach to Pattern Recognition and Machine Learning 1966 9 INFCTRL Ginsburg & Greibach, Mappings Which Preserve Context Sensitive Languages 1966 9 INFCTRL Ullmann, Associating Parts of Patterns 1966 9 INFCTRL Martin-Lof, The Definition of Random Sequences 1966 9 INFCTRL Ginsburg & Greibach, Deterministic Context Free Languages 1966 9 INFCTRL Gray & Harrison, The Theory of Sequential Relations 1966 9 INFCTRL Page, Equivalences between Probabilistic and Deterministic Sequential Machines 1966 9 INFCTRL McNaughton, Testing and Generating Infinite Sequences by a Finite Automaton 1966 9 INFCTRL Magiros, Stability Concepts of Dynamical Systems 1966 9 INFCTRL Beutler & Leneman, Random Sampling of Random Processes: Stationary Point Processes 1966 9 INFCTRL Leneman, Random Sampling of Random Processes: Impulse Processes 1966 9 INFCTRL Fischer, Turing Machines with Restricted Memory Access 1966 9 INFCTRL Baldwin, The Dependence Capacity of Finite Borel Fields 1966 9 INFCTRL Isaacs & Leondes, Optimal Control System Synthesis for Cost Functionals Involving Convex Single Valued Functions of the State and Control Variables 1966 9 INFCTRL Mazo & Salz, Spectra of Frequency Modulation with Random Waveforms 1966 9 INFCTRL Wyner, Capacity of the Product of Channels 1966 9 INFCTRL Brookner, Recurrent Events in a Markov Chain 1966 9 INFCTRL Sakaguchi, Some Examples of Bayesian Adaptive Programming 1966 9 INFCTRL Clayden & Clowes & Parks, Letter Recognition and the Segmentation of Running Text 1966 9 INFCTRL Erzberger & Kim, Optimum Boundary Control of Distributed Parameter Systems 1966 9 INFCTRL Radke, Necessary and Sufficient Conditions on Conditional Probabilities to Maximize Entropy 1966 9 INFCTRL Arnold & Richards, Monotone Congruence Algorithms 1966 9 INFCTRL Pavlidis, Stability of a Class of Discontinuous Dynamical Systems 1966 9 INFCTRL Jelinek, Determination of Capacity Achieving Input Probabilities for a Class of Finite State Channels with Side Information 1966 9 INFCTRL Kailath, Some Results on Singular Detection 1966 9 INFCTRL Ginsburg & Rose, Preservation of Languages by Transducers 1966 9 INFCTRL Arbib, Simple Self-Reproducing Universal Automata 1966 9 INFCTRL Krohn & Maurer & Rhodes, Realizing Complex Boolean Functions with Simple Groups 1966 9 INFCTRL Tang & Chien, Cyclic Product Codes and Their Implementation 1966 9 INFCTRL Katzenelson & Gould, A Note on ``A Spectrum Factorization Method for the Calculation of Nonlinear Filters of the Volterra Type'' 1966 9 INFCTRL Bregstone, Note on ``A Spectrum Factorization Method for the Calculation of Nonlinear Filters of the Volterra Type'' of Katzenelson and Gould 1966 9 INFCTRL Lebedev & Levitin, Information Transmission by Electromagnetic Field 1966 9 INFCTRL Dejean & Schutzenberger, On a Question of Eggan 1966 9 INFCTRL Paz, Some Aspects of Probabilistic Automata 1966 9 INFCTRL Ullian, Failure of a Conjecture About Context Free Languages 1966 9 INFCTRL Arimoto, Linear, Stationary, Optimal Feedback Control Systems 1966 9 INFCTRL Wagner, A Search Technique for Quasi-Perfect Codes 1966 9 INFCTRL Waksman, An Optimum Solution to the Firing Squad Synchronization Problem 1965 8 INFCTRL Hennie, One-Tape, Off-Line Turing Machine Computations 1964 7 INFCTRL Solomonoff, A Formal Theory of Inductive Inference. Part I 1964 7 INFCTRL Solomonoff, A Formal Theory of Inductive Inference. Part II 1963 6 INFCTRL Stearns & Hartmanis, Regularity Preserving Modifications of Regular Expressions 1995 1 INFOBAHN Rosenblum, Fighting the (Pretty) Good Fight 1995 1 INFOBAHN Harris, The Geopolitics of Cyberspace 1991 13 INFOWORLD LaPlante, Computer Science Gets a `Reality Check' 1991 13 INFOWORLD Glass, Object-Oriented Programming: An Executive Overview 1991 13 INFOWORLD Coursey, Riding the Internet 1984 INFOWORLD Mace, Computer Test Hits Snags: Some College Freshmen Not Getting Course Credit 1988 45 INFSCIENCES Kak, Multilayered Array Computing 1987 43 INFSCIENCES Krithivasan & Sitalakshmi, Efficient Two-Dimensional Pattern Matching in the Presence of Errors 1987 43 INFSCIENCES Lucanu, Several Properties of Array Languages 1987 43 INFSCIENCES Chaudhuri, Algorithms for Some Graph Problems on a Distributed Computational Model 1980 20 INFSCIENCES Scott & Jefferson, On the Analysis of an Information Theoretic Model of Spatial Interaction 1980 20 INFSCIENCES Inoue & Takanami, A Note on Deterministic Three-Way Tape-Bounded Two-Dimensional Turing Machines 1980 20 INFSCIENCES Wu & Rosenfeld, Sequential and Cellular Graph Automata 1980 20 INFSCIENCES Mukhopadhyay, A Fast Algorithm for the Longest-Common-Subsequence Problem 1973 6 INFSCIENCES Feldman & Owings, A Class of Universal Linear Bounded Automata 1995 INFSEC Brinkley & Schell, What Is There to Worry About? An Introduction to the Computer Security Problem 1995 INFSEC Brinkley & Schell, Concepts and Terminology for Computer Security 1995 INFSEC Abrams & Podell, Malicious Software 1995 INFSEC Abrams & Podell, Cryptography 1995 INFSEC Kent, Internet Privacy Enhanced Mail 1995 INFSEC Humphreys, Electronic Data Interchange (EDI) Messaging Security 1994 1 INPUT Horstmann, A Strategic C++ Subset for CS1 Instruction 1992 INRIAANNIV Rabin, Dependable Parallel Computing by Randomization (Abstract) 1992 INRIAANNIV Saltzer, Technology, Networks, and the Library of the Year 2,000 1992 INRIAANNIV Ullman, New Frontiers in Database System Research 1992 INRIAANNIV Constable, Formal Theories and Software Systems: Fundamental Connections between Computer Science and Logic 1992 INRIAANNIV Manna & Pnueli, Time for Concurrency 1992 INRIAANNIV Preparata & Bilardi, Horizons of Parallel Computation 1992 INRIAANNIV Sethi & Campbell & Dorward & Iyengar & Kalmanek & Murakami & Shieh & Tan, Control Software for Virtual-Circuit Switches: Call Processing 1996 20 INTEG Even, The Retiming Lemma: A Simple Proof and Applications 1996 20 INTEG Dion & Risset & Robert, Resource-constrained Scheduling of Partitioned Algorithms on Processor Arrays 1996 20 INTEG Chao & Harper, An Efficient Lower Bound Algorithm for Channel Routing 1995 19 INTEG Kim & Liu, A New Approach to the Multiport Memory Allocation Problem in Data Path Synthesis 1995 19 INTEG Gao & Liu, Minimum Crosstalk Switchbox Routing 1995 19 INTEG Mahmood & Sparks & Baker, Systolic Algorithms for Solving a Sparse System of Linear Equations in Circuit Simulation 1995 18 INTEG Fenn & Taylor & Benaissa, A Dual Basis Bit-Serial Systolic Multiplier for GF(2^m) 1995 18 INTEG Tahir & Dlay & Naguib & Hinton, Fault Tolerant Arithmetic Unit Using Duplication and Residue Codes 1995 18 INTEG Becker & Hahn & Hartmann & Sparmann, On the Testability of Iterative Logic Arrays 1994 18 INTEG Alexiou & Stiliadis & Kanopoulos, On the Design of a High-Performance, Expandable, Sorting Engine 1994 17 INTEG Venkateswaran & Mazumder, A Survey of DA Techniques for PLD and FPGA Based Systems 1994 17 INTEG Jansen, On the Complexity of Allocation Problems in High-Level Synthesis 1994 17 INTEG Keller, Regular Layouts of Butterfly Networks 1994 17 INTEG Kundu, An Efficient Technique for Obtaining Unate Implementation of Functions through Input Encoding 1994 17 INTEG Gonzalez & Zheng, Single Phase Three-Layer Channel Routing Algorithms 1993 16 INTEG Ercegovac & Lang, Multiplication / Division / Square Root Module for Massively Parallel Computers 1993 16 INTEG Groeneveld, Necessary and Sufficient Conditions for the Routability of Classical Channels 1993 16 INTEG Even & Rachman & Spillinger, Linear Test Sequences for Detecting Functionally Faulty RAM's 1993 15 INTEG Wolf, FSM Decomposition for Pipelined Data 1993 15 INTEG Tragoudas & Tollis, River Routing and Density Minimization for Channels with Interchangeable Terminals 1993 15 INTEG Wang & Wong, Graph-based Techniques to Speed Up Floorplan Area Optimization 1992 14 INTEG Hambrusch & Tu, Minimizing Total Wire Length during 1-dimensional Compaction 1989 8 INTEG Gonzales & Zheng, Stretching and Three-layer Wiring Planar Layouts 1990 INTMATHU World Directory of Mathematicians 1990, 9th Edition 1990 102 INVMATH Jones, Rectifiable Sets and the Traveling Salesman Problem 1971 12 INVMATH Robinson, Undecidability and Nonperiodicity for Tilings of the Plane 1995 6 INWORLD Ubois, Hero or Villain? An Interview with PGP Creator Philip Zimmermann 1996 5 IPCO Barany & Onn, Colourful Linear Programming 1996 5 IPCO Thomas & Weismantel, Test Sets and Inequalities for Integer Programs 1996 5 IPCO Rossner & Schnorr, An Optimal, Stable Continued Fraction Algorithm 1996 5 IPCO Chopra & Gilboa & Sastry, Algorithms and Extended Formulations for One and Two Facility Network Design 1996 5 IPCO Barnhart & Hane & Vance, Integer Multicommodity Flow Problems 1996 5 IPCO Caprara & Fischetti & Toth, A Heuristic Algorithm for the Set Covering Problem 1996 5 IPCO Tseng & Bertsekas, An epsilon-Relaxation Method for Generalized Separable Convex Cost Network Flow Problems 1996 5 IPCO Kolliopoulos & Stein, Finding Real-Valued Single-Source Shortest Paths in o(n^3) Expected Time 1996 5 IPCO Fekete & Khuller & Klemmstein & Raghavachari & Young, A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees 1996 5 IPCO Halldorsson, Approximating k-Set Cover and Complementary Graph Coloring 1996 5 IPCO Kapoor, On Minimum 3-Cuts and Approximating k-Cuts Using Cut Trees 1996 5 IPCO Goemans & Williamson, Primal-Dual Approximation Algorithms for Feedback Problems in Planar Graphs 1996 5 IPCO Pataki, Cone-LP's and Semidefinite Programs: Geometry and a Simplex-Type Method 1996 5 IPCO Helmberg & Rendl & Weismantel, Quadratic Knapsack Relaxations Using Cutting Planes and Semidefinite Programming 1996 5 IPCO Kahale, A Semidefinite Bound for Mixing Rates of Markov Chains 1996 5 IPCO Burkard & Cela & Rote & Woeginger, The Quadratic Assignment Problem with a Monotone Anti-Monge and a Symmetric Toeplitz Matrix: Easy and Hard Cases 1996 5 IPCO Cohen, On Optimizing Multiplications of Sparse Matrices 1996 5 IPCO Anstreicher & Fampa & Lee & Williams, Continuous Relaxations for Constrained Maximum-Entropy Sampling 1996 5 IPCO Hartvigsen, A Submodular Optimization Problem with Side Constraints 1996 5 IPCO Murota, Convexity and Steinitz's Exchange Property 1996 5 IPCO Novick & Sebo, On Ideal Clutters, Metrics and Multiflows 1996 5 IPCO Goemans, A Supermodular Relaxation for Scheduling with Release Dates 1996 5 IPCO Schulz, Scheduling to Minimize Total Weighted Completion Time: Performance Guarantees of LP-Based Heuristics and Lower Bounds 1996 5 IPCO Simonetti & Balas, Implementation of a Linear Time Algorithm for Certain Generalized Traveling Salesman Problems 1996 5 IPCO Bertsimas & Teo & Vohra, On Dependent Randomized Rounding Algorithms 1996 5 IPCO Chen & Frieze, Coloring Bipartite Hypergraphs 1996 5 IPCO Teo & Bertsimas, Improved Randomized Approximation Algorithms for Lot-Sizing Problems 1996 5 IPCO Hoogeveen & Kawaguchi, Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases 1996 5 IPCO Martin & Shmoys, A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem 1996 5 IPCO Hoogeveen & Vestjens, Optimal On-Line Algorithms for Single-Machine Scheduling 1996 5 IPCO Goemans & Hall, The Strongest Facets of the Acyclic Subgraph Polytope Are Unknown 1996 5 IPCO Muller & Schulz, Transitive Packing 1996 5 IPCO Funke & Reinelt, A Polyhedral Approach to the Feedback Vertex Set Problem 1996 5 IPCO Carr, Separating over Classes of TSP Inequalities Defined by 0 Node-Lifting in Polynomial Time 1996 5 IPCO Fleischer & Tardos, Separating Maximally Violated Comb Inequalities in Planar Graphs 1996 5 IPCO Burkard & Deineko & Woeginger, The Travelling Salesman and the PQ-Tree 1995 4 IPCO Frieze & Jerrum, Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION 1995 4 IPCO Even & Naor & Schieber & Sudan, Approximating Minimum Feedback Sets and Multi-Cuts in Directed Graphs 1995 4 IPCO Bertsimas & Teo & Vohra, Nonlinear Formulations and Improved Randomized Approximation Algorithms for Multicut Problems 1995 4 IPCO Carr, Separating Clique Tree and Bipartition Inequalities in Polynomial Time 1995 4 IPCO Muller & Schulz, The Interval Order Polytope of a Digraph 1995 4 IPCO Cheng & Cunningham, Separation Problems for the Stable Set Polytope 1995 4 IPCO Bienstock, Computational Study of a Family of Mixed-Integer Quadratic Programming Problems 1995 4 IPCO Pisinger, A Minimal Algorithm for the Bounded Knapsack Problem 1995 4 IPCO Escudero & Martello & Toth, A Framework for Tightening 0-1 Programs Based on Extensions of Pure 0-1 KP and SS Problems 1995 4 IPCO Helmberg & Poljak & Rendl & Wolkowicz, Combining Semidefinite and Polyhedral Relaxations for Integer Programs 1995 4 IPCO Deng, Distributed Near-Optimal Matching 1995 4 IPCO Pferschy, The Random Linear Bottleneck Assignment Problem 1995 4 IPCO Cherkassky & Goldberg, On Implementing Push-Relabel Method for the Maximum Flow Problem 1995 4 IPCO Ali & Han & Kennington, Use of Hidden Network Structure in the Set Partitioning Problem 1995 4 IPCO Hartvigsen, Generalized Max Flows and Augmenting Paths 1995 4 IPCO Kleinschmidt & Onn, Oriented Matroid Polytopes and Polyhedral Fans are Signable 1995 4 IPCO Novick & Sebo, On Combinatorial Properties of Binary Spaces 1995 4 IPCO Bouchet, Coverings and Delta-Coverings 1995 4 IPCO Barany & Scarf & Shallcross, The Topological Structure of Maximal Lattice Free Convex Bodies: The General Case 1995 4 IPCO Laburthe, The Hilbert Basis of the Cut Cone over the Complete Graph K_6 1995 4 IPCO Hosten & Sturmfels, GRIN: An Implementatiion of Grobner Bases for Integer Programming 1995 4 IPCO Crama & Spieksma, Scheduling Jobs of Equal Length: Complexity, Facets and Computational Results 1995 4 IPCO Hoogeveen & van de Velde, Formulating a Scheduling Problem with Almost Identical Jobs by Using Propositional Completion Times 1995 4 IPCO Queyranne & Schulz, Scheduling Unit Jobs with Compatible Realease Dates on Parallel Machines with Nonstationary Speeds 1995 4 IPCO Conforti & Cornuejols & Kapoor & Vuskovic, A Mickey-Mouse Decomposition Theorem 1995 4 IPCO Klinz & Woeginger, Minimum Cost Dynamic Flows: The Series-Parallel Case 1995 4 IPCO Nobili & Sassano, (0, +/- 1) Ideal Matrices 1995 4 IPCO Juvan & Marincek & Mohar, Embedding Graphs in the Torus in Linear Time 1995 4 IPCO Ageev & Kostochka & Szigeti, A Characterization of Seymour Graphs 1995 4 IPCO Bartels & Welsh, The Markov Chain of Colourings 1995 4 IPCO Gabow & Manu, Packing Algorithms for Arborescences (and Spanning Trees) in Capacitated Graphs 1995 4 IPCO Nagamochi & Ibaraki, A Faster Edge Splitting Algorithm in Multigraphs and its Application to the Edge-Connectivity Augmentation Problem 1995 4 IPCO Frank & Jordan, How to Make a Strongly Connected Digraph Two-Connected 1995 4 IPCO Dahl, Polyhedra and Optimization in Connection with a Weak Majorization Ordering 1995 4 IPCO Ceria & Cornuejols & Dawande, Combining and Strengthening Gomory Cuts 1995 4 IPCO Gu & Nemhauser & Savelsbergh, Sequence Independent Lifting of Cover Inequalities 1997 61 IPL Wang & Hsu & Sung, Faithful 1-edge Fault Tolerant Graphs 1997 61 IPL Henk, Note on Shortest and Nearest Lattice Vectors 1997 61 IPL Cintioli & Silvestri, Revisiting a Result of Ko 1997 61 IPL Dell'Olmo & Giordani & Speranza, An Approximation Result for a Duo-processor Task Scheduling Problem 1997 61 IPL Encarnacion, Black-box Polynomial Resultants 1997 61 IPL Roupin, On Approximating the Memory-constrained Module Allocation Problem 1997 61 IPL Park & Lee & Sung & Kim, Improving Bounds for the Number of Correlation Immune Boolean Functions 1997 61 IPL Choi & Lam, Dynamic Suffix Tree and Two-dimensional Texts Management 1997 61 IPL Kulasinghe, Connectivity of the Crossed Cube 1997 61 IPL Deogun & Kratsch & Steiner, An Approximation Algorithm for Clustering Graphs with Dominating Diametral Path 1997 61 IPL Lecroq & Luce & Myoupo, A Faster Linear Systolic Algorithm for Recovering a Longest Common Subsequence 1997 61 IPL Mosca, Polynomial Algorithms for the Maximum Stable Set Problem on Particular Classes of P_5-free Graphs 1997 61 IPL Zhang, A Simple Semi On-line Algorithm for P2//C_max with a Buffer 1997 61 IPL Hong & Kim, Resolving Data Conflicts with Multiple Versions and Precedence Relationships in Real-time Databases 1997 61 IPL Fris & Havel & Liebl, The Diameter of the Cube-connected Cycles 1997 61 IPL Rosenblum, Monotone Real Circuits are More Powerful than Monotone Boolean Circuits 1997 61 IPL Wang, Linear Complexity Profiles and Jump Complexity 1997 61 IPL Sato, Ergodicity of Linear Cellular Automata over Z_m 1997 61 IPL Zippel, Zero Testing of Algebraic Functions 1997 61 IPL Loescher, One Unary Function Says Less Than Two in Existential Second Order Logic 1997 61 IPL Guan & Zhu, A Coloring Problem for Weighted Graphs 1997 61 IPL Uehara, Collapse of PP with a Semi-random Source to BPP 1997 61 IPL Saab, An Improved Algorithm for Intersecting Convex Polygons 1997 61 IPL Shikishima-Tsuji & Katsura & Kobayashi, On Termination of Confluent One-Rule String-Rewriting Systems 1997 61 IPL Chung, Efficient Huffman Decoding 1997 61 IPL Bodlaender & Thilikos & Yamazaki, It is Hard to Know when Greedy is Good for Finding Independent Sets 1997 61 IPL Lu & Tang, A Linear-Time Algorithm for the Weighted Feedback Vertex Problem on Interval Graphs 1997 61 IPL Franciosa & Gambosi & Nanni, The Incremental Maintenance of a Depth-First-Search Tree in Directed Acyclic Graphs 1997 61 IPL Wang, NP-hard Sets are Superterse unless NP is Small 1997 61 IPL Farach & Muthukrishnan, Optimal Parallel Randomized Renaming 1997 61 IPL King & Tzeng, On-line Algorithms for the Dominating Set Problem 1997 61 IPL Kornerup, Odd-Even Sort in Powerlists 1997 61 IPL Hasunuma & Shibata, Containment of Butterflies in Networks Constructed by the Line Digraph Operation 1997 61 IPL Sedjelmaci & Lavault, Improvements on the Accelerated Integer GCD Algorithm 1997 61 IPL Bozanis & Kitsios & Makris & Tsakalidis, The Space-optimal Version of a Known Rectangle Enclosure Reporting Algorithm 1997 61 IPL Ashir & Stewart & Ahmed, Communication Algorithms in k-ary n-Cube Interconnection Networks 1997 61 IPL Blum & Karger, An O^~(n^{3/14})-Coloring Algorithm for 3-Colorable Graphs 1997 61 IPL Taylor & Hachem & Selkow, The Average Height of a Node in the BANG Abstract Directory Tree 1996 60 IPL Germain & Pallo, Two Shortest Path Metrics on Well-formed Parentheses Strings 1996 60 IPL Nystrom, There is No Fully Abstract Fixpoint Semantics for Non-deterministic Languages with Infinite Computations 1996 60 IPL Grable, Nearly-perfect Hypergraph Packing is in NC 1996 60 IPL Kurosawa & Okada, Combinatorial Lower Bounds for Secret Sharing Schemes 1996 60 IPL Kocberber & Can, Partial Evaluation of Queries for Bit-sliced Signature Files 1996 60 IPL Veanes & Barklund, Construction of Natural Cycletrees 1996 60 IPL Meilsen & Mizuno, Erratum to ``Nondominated k-Coteries for Multiple Mutual Exclusion'' 1996 60 IPL Chlebikova, Approximating the Maximally Balanced Connected Partition Problem in Graphs 1996 60 IPL Skillicorn, A Parallel Tree Difference Algorithm 1996 60 IPL Sun, Term Rewriting and Hoare Logic -- Coded Rewriting 1996 60 IPL Venema & Shen & Suraweera, NC Algorithms for the Single Most Vital Edge Problem with Respect to Shortest Paths 1996 60 IPL Venkatesan & Rangan, Approximate Triclique Coloring for Register Allocation 1996 60 IPL Nassif & Bagherzadeh, A Grid Embedding into the Star Graph for Image Analysis Solutions 1996 60 IPL Jan & Tseng, On the Security of Image Encryption Method 1996 60 IPL Ito & Takagi & Yajima, Square Rooting by Iterative Multiply-Additions 1996 60 IPL Youssef & Tavares, Comment on ``Bounds on the Number of Functions Satisfying the Strict Avalanche Criterion'' 1996 60 IPL Domingo i Ferrer, A New Privacy Homomorphism and Applications 1996 60 IPL Christie, Sorting Permutations by Block-interchanges 1996 60 IPL Bax & Franklin, A Finite-Difference Sieve to Count Paths and Cycles by Length 1996 60 IPL Wagh & Mo, Hamilton Cycles in Trivalent Cayley Graphs 1996 60 IPL Lin, Perfectly Overlapping Merging and Sorting on a Two-way Linear Array 1996 60 IPL alidaee & Ahmadian, Scheduling on a Single Processor with Variable Speed 1996 60 IPL Kitsios & Tsakalidis, Space-optimal Hidden Line Elimination for Rectangles 1996 60 IPL Nitsche & Ochsenschlager, Approximately Satisfied Properties of Systems and Simple Language Homomorphisms 1996 60 IPL Buhaceanu & Feijen, Formal Derivation of an Algorithm for Distributed Phase Synchronization 1996 60 IPL Cusick & Stanica, Bounds on the Number of Functions Satisfying the Strict Avalanche Criterion 1996 60 IPL Kloks, K_{1,3}-free and W_4-free Graphs 1996 60 IPL Banach, Transitive Term Graph Rewriting 1996 60 IPL Erlingsson & Krishnamoorthy & Raman, Efficient Multiway Radix Search Trees 1996 60 IPL Schwarzkopf & Vleugels, Range Searching in Low-Density Environments 1996 60 IPL Chou, Simple Proof Techniques for Property Preservation via Simulation 1996 60 IPL Chen & Lau, Dividing Strategies for the Optimization of a Test Suite 1996 60 IPL Prather, The Subprogram Problem for Software Metric Design 1996 60 IPL Hunt & Michael & Parthasarathy & Scott, An Efficient Algorithm for Concurrent Priority Queue Heaps 1996 60 IPL Liang & Rhee, Finding Biconnected Components in O(n) Time for a Class of Graphs 1996 60 IPL Melancon, Viennot Factorization of Infinite Words 1996 60 IPL Veloso, On Pushout Consistency, Modularity and Interpolation for Logical Specifications 1996 60 IPL Sere, Procedures and Atomicity Refinement 1996 60 IPL Reingold & Westbrook, Off-line Algorithms for the List Update Problem 1996 60 IPL Shiau & Yang, A Fast Maximum Finding Algorithm on Broadcast Communication 1996 60 IPL Gopalakrishnan & Stinson, A Simple Analysis of the Error Probability of Two-Point Based Sampling 1996 60 IPL Eades & Stirk & Whitesides, The Techniques of Komolgorov and Barzdin for Three-dimensional Orthogonal Graph Drawings 1996 60 IPL Chen & Klenk, Erratum to ``Rectilinear Short Path Queries among Rectangular Obstacles'' 1996 60 IPL Natschlager & Schmitt, Erratum to ``Exact VC-dimension of Boolean Monomials'' 1996 60 IPL Julia & Litovsky & Patrou, On Codes, omega-Codes and omega-Generators 1996 60 IPL Makki & Havas, Distributed Algorithms for Depth-First Search 1996 60 IPL Garcia & Tejel, Using Total Monotonicity for Two Optimization Problems on the Plane 1996 60 IPL Lee, Semantic Data Modelling Using Linear Logic 1996 60 IPL Giakoumakis, P_4-laden Graphs: A New Class of Brittle Graphs 1996 60 IPL Otto & Van den Bussche, First-order Queries on Databases Embedded in an Infinite Structure 1996 60 IPL Al Jabri, The Unicity Distance: An Upper Bound on the Probability of an Eavesdropper Successfully Estimating the Secret Key 1996 60 IPL Wegener, On the Complexity of Encoding in Analog Circuits 1996 59 IPL Czumaj & Diks & Przytycka, Parallel Maximum Independent Set in Convex Bipartite Graphs 1996 59 IPL Deineko & Woeginger, The Convex-Hull-and-k-Line Travelling Salesman Problem 1996 59 IPL Seidl, Fast and Simple Nested Fixpoints 1996 59 IPL De Prisco & Parlati & Persiano, A Note on the Expected Path Length of Trees with Known Fringe 1996 59 IPL Rescigno, On the Communication Complexity of Polling 1996 59 IPL Ustimenko, Algebra of Two-level Cause-Effect Structures 1996 59 IPL Tokunaga, Intersection Number of Two Connected Geometric Graphs 1996 59 IPL Melkman & Shimony, Algorithms for Parsimonious Complete Sets in Directed Graphs 1996 59 IPL Bollig & Lobbing & Wegener, On the Effect of Local Changes in the Variable Ordering of Ordered Decision Diagrams 1996 59 IPL Baeza-Yates & Fuentes, A Framework to Animate String Algorithms 1996 59 IPL Romijn & Vaandrager, A Note on Fairness in I/O Automata 1996 59 IPL Turan & Vatan, A Size-Depth Trade-off for the Analog Computation of Boolean Functions 1996 59 IPL Nielsen, Output-sensitive Peeling of Convex and Maximal Layers 1996 59 IPL Hernandez Barrera, Algorithms for Deciding the Containment of Polygons 1996 59 IPL Plandowski & Rytter & Szymacha, Parallel Tree-Contraction and Fibonacci Numbers 1996 59 IPL Tanaka & Nishino & Beals, Negation-limited Circuit Complexity of Symmetric Functions 1996 59 IPL Ghosh & Gupta, An Exercise in Fault-Containment: Self-Stabilizing Leader Election 1996 59 IPL Santos, Inscribing a Symmetric Body in an Ellipse 1996 59 IPL Goltz & Wehrheim, Modelling Causality via Action Dependencies in Branching Time Semantics 1996 59 IPL Panaite, Hypercube Permutations Routable Under All Dimension Orderings 1996 59 IPL Young & Wilsey, A Distributed Method to Bound Rollback Lengths for Fossil Collection in Time Warp Simulators 1996 59 IPL Holsztynski & Koczkodaj, Convergence of Inconsistency Algorithms for the Pairwise Comparisons 1996 59 IPL Szepietowski, The Element Distinctness Problem on One-Tape Turing Machines 1996 59 IPL Alsuwaiyel, Finding a Shortest Hamiltonian Path Inside a Simple Polygon 1996 59 IPL Borchert & Lozano, Succinct Circuit Representations and Leaf Language Classes are Basically the Same Concept 1996 59 IPL Tseng, Embedding a Ring in a Hypercube with Both Faulty Links and Faulty Nodes 1996 59 IPL Athithan & Roy, Hyperspherical Neighborhoods and Pattern Recognition Using Neural Networks 1996 59 IPL Ivkovic & Lloyd, A Fundamental Restriction on Fully Dynamic Maintenance of Bin Packing 1996 59 IPL Shen & Ramnath, Optimal Parallel Selection in Sorted Matrices 1996 59 IPL Alon & Bradford & Fleischer, Matching Nuts and Bolts Faster 1996 59 IPL Paun, Splicing Systems with Targets are Computationally Universal 1996 59 IPL Baier & Majster-Cederbaum, Denotational Linear Time Semantics and Sequential Composition 1996 59 IPL Aranha & Pandu Rangan, An Efficient Distributed Algorithm for Centering a Spanning Tree of a Biconnected Graph 1996 59 IPL Bernasconi, Sensitivity vs. Block Sensitivity (an Average-Case Study) 1996 59 IPL Morgan & McIver, Unifying wp and wlp 1996 59 IPL Moriya & Yamasaki, Literal Shuffle on omega-Languages 1996 59 IPL De Agostino & Storer, On-line versus Off-line Computation in Dynamic Text Compression 1996 59 IPL Fujito, A Note on Approximation of the Vertex Cover and Feedback Vertex Set Problems -- Unified Approach 1996 59 IPL Howard & Vitter, Parallel Lossless Image Compression Using Huffman and Arithmetic Coding 1996 59 IPL Glaister & Shallit, A Lower Bound Technique for the Size of Nondeterministic Finite Automata 1996 59 IPL Dunten & Jones & Sorenson, A Space-efficient Fast Prime Number Sieve 1996 59 IPL Barth, Optimal Broadcasting in the Back to Back d-ary Trees 1996 59 IPL Nagumo & Lu & Watson, On-line Longest Fragment First Parsing Algorithm 1996 59 IPL Madanial & Venkatesan & Rangan, Tree 3-spanners on Interval, Permutation and Regular Bipartite Graphs 1996 59 IPL Ho & Wang & Juan, A Linear Time Algorithm for Finding All Hinge Vertices of a Permutation Graph 1996 59 IPL Chung & Mah, Semantics-based Transaction Management for Multidatabase Systems 1996 59 IPL Manku, A Linear Time Algorithm for the Bottleneck Biconnected Spanning Subgraph Problem 1996 59 IPL Alstrup & Clausen & Jorgensen, An O(|V|*|E|) Algorithm for Finding Immediate Multiple-Vertex Dominators 1996 59 IPL Watjen & Spilker, Decidability Results Concerning k-limited ED0L Systems 1996 59 IPL Natschlager & Schmitt, Exact VC-Dimension of Boolean Monomials 1996 59 IPL Baeza-Yates & Perleberg, Fast and Practical Approximate String Matching 1996 59 IPL Zwick, On the Number of ANDs versus the Number of ORs in Monotone Boolean Circuits 1996 59 IPL Kuo & Huang, A Simple Scheme to Construct k-Coteries with O(sqrt(N)) Uniform Quorum Sizes 1996 59 IPL Bshouty, A Subexponential Exact Learning Algorithm for DNF Using Equivalence Queries 1996 59 IPL Henzinger & Williamson, On the Number of Small Cuts in a Graph 1996 59 IPL Wang & Fu, A Frame for General Divide-and-Conquer Recurrences 1996 59 IPL Marchetti-Spaccamela & Nanni & Rohnert, Maintaining a Topological Order under Edge Insertions 1996 58 IPL Danyi & Fulop, correction to A Note on the Equivalence Problem of E-patterns 1996 58 IPL Lim, Minimum Area Joining of k Compacted Cells 1996 58 IPL Binkley & Schach, A Comparison of Sixteen Quality Metrics for Object-Oriented Design 1996 58 IPL Cheng, Widest Empty L-shaped Corridor 1996 58 IPL Ogata & Sakano & Kurosawa, Multisymbol Majority Vote and Hard Core 1996 58 IPL Obana & Kurosawa, Veto is Impossible in Secret Sharing Schemes 1996 58 IPL Staiger, Codes, Simplifying Words, and Open Set Condition 1996 58 IPL Juurlink & Wijshoff, Communication Primitives for BSP Computers 1996 58 IPL Dasgupta & Chakrabarti & DeSarkar, Agent Search in Uniform b-ary Trees: Multiple Goals and Unequal Costs 1996 58 IPL Higham & Przytycka, A Simple, Efficient Algorithm for Maximum Finding on Rings 1996 58 IPL Ahuja, Assertions agbout Past and Future in Highways: Global Flush Broadcast and Flush-Vector-Time (Erratum) 1996 58 IPL Hofmeister & Lefmann, Independent Sets in Graphs with Triangles 1996 58 IPL Shidlovsky & Bertino, On the Number of Descendants in an Object DAG 1996 58 IPL Colussi & De Col, A Time and Space Efficient Data Structure for String Searching on Large Texts 1996 58 IPL Burns & Davis, Choosing Task Periods to Minimise System Utilisation in Time Triggered Systems 1996 58 IPL Hui & Martel, Analyzing Self-Adjusting Linear List Algorithms with Deletions and Unsuccessful Searches 1996 58 IPL Dijkstra, ``Everywhere'' in Predicate Algebra and Modal Logic 1996 58 IPL Sharir, Excess in Arrangements of Segments 1996 58 IPL Sacca, Multiple Total Stable Models are Definitely Needed to Solve Unique Solution Problems 1996 58 IPL Blazewicz & Bouvry & Guinand & Trystram, Scheduling Complete Intrees on Two Uniform Processors with Communication Delays 1996 58 IPL Rehof, Strong Normalization for Non-structural Subtyping via Saturated Sets 1996 58 IPL Ciampolini & Lamma & Mello, An Abstract Interpretation Framework for Optimizing Dynamic Modular Logic Languages 1996 58 IPL Cai, Fixed-Parameter Tractability of Graph Modification Problems for Hereditary Properties 1996 58 IPL Grandi, Implementing (Nondeterministic) Parallel Assignments 1996 58 IPL Balachandran & Nagavamsi & Pandu Rangan, Clique Transversal and Clique Independence on Comparability Graphs 1996 58 IPL Birget, The State Complexity of comp(Sigma*comp(L)) and its Connection with Temporal Logic 1996 58 IPL Hwang & Chang & Yang, Authenticated Encryption Schemes with Message Linkage 1996 58 IPL Salomaa, Yield-Languages of Two-Way Pushdown Tree Automata 1996 58 IPL Malhotra & Srinivasan & Kulkarni, Storage-efficient Data Structure for Large Lookup Dictionaries 1996 58 IPL Kann & Lagergren & Panconesi, Approximability of Maximum Splitting of k-sets and some other Apx-complete Problems 1996 58 IPL Panda, New Linear Time Algorithms for Generating Perfect Elimination Orderings of Chordal Graphs 1996 58 IPL Obokata & Nishitani & Igarashi, A Probably Optimal Embedding of Hyper-Rings in Hypercubes 1996 58 IPL Seo & Lee, Applicability of Genetic Algorithms to Optimal Evaluation of Path Predicates in Object-Oriented Queries 1996 58 IPL Hirata, A Unified Linear-Time Algorithm for Computing Distance Maps 1996 58 IPL Ta-Shma, A Note on PCP vs. MIP 1996 58 IPL Basten, Branching Bisimilarity is an Equivalence Indeed! 1996 58 IPL Liang & McKay & Shen, NC Algorithms for Dynamically Solving the All Pairs Shortest Paths Problem and Related Problems 1996 58 IPL Garrido & Kelsen & Lingas, A Simple NC-Algorithm for a Maximal Independent Set in a Hypergraph of Poly-log Arboricity 1996 58 IPL Balasubramanian & Nagaraj, Perfect Power Testing 1996 58 IPL Chao & Chen & Chen, Multiple Search Problem on Reconfigurable Meshes 1996 58 IPL Eiselt & Gendreau & Laporte, Optimal Location of Facilities on a Network with an Unreliable Node or Link 1996 58 IPL Kim, Unambiguous Description of Chain Code Picture Languages 1996 58 IPL de Azevedo & Bagherzadeh & Dowd & Latifi, Some Topological Properties of Star Connected Cycles 1996 58 IPL Ra & Kim, A Parallel Parsing Algorithm for Arbitrary Context-free Grammars 1996 58 IPL Kimura & Togashi & Shiratori, Extension of Synthesis Algorithm of Recursive Processes to mu-Calculus 1996 58 IPL Lacoste, Finitistic Proofs of 0-1 Laws for Fragments of Second-order Logic 1996 58 IPL Neufeld, A Pursuit-Evasion Problem on a Grid 1996 58 IPL Harikumar & Kumar, Iterative Deepening Multiobjective A 1996 58 IPL Krishnamachari & Mittal, Design and Analysis of a Generalized Multi-ring Architecture 1996 58 IPL Marathe & Ravi, On Approximation Algorithms for the Minimum Satisfiability Problem 1996 58 IPL Caussinus, A Note on a Theorem of Barrington, Straubing and Therien 1996 58 IPL Ogihara, Functions Computable with Limited Access to NP 1996 58 IPL Lipton, On Proving that a Graph Has No Large Clique: A Connection with Ramsey Theory 1996 58 IPL Tzeng, On Path Equivalence of Nondeterministic Finite Automata 1996 58 IPL Kirousis & Spirakis & Tsigas, Simple Atomic Snapshots: A Linear Complexity Solution with Unbounded Time-stamps 1996 57 IPL Monti, On the Computational Complexity of Graph Closures 1996 57 IPL Gawiejnowicz, A Note on Scheduling on a Single Processor with Speed Dependent on a Number of Executed Jobs 1996 57 IPL Yen, A Highly Safe Self-Stabilizing Mutual Exclusion Algorithm 1996 57 IPL Fudos & Pitoura & Szpankowski, On Pattern Occurrences in a Random Text 1996 57 IPL Chen & Klenk, Rectilinear Short Path Queries among Rectangular Obstacles 1996 57 IPL Ramnath & Sunder, On Two-Processor Scheduling and Maximum Matching in Permutation Graphs 1996 57 IPL Ben-Or & Ron, Agreement in the Presence of Faults, on Networks of Bounded Degree 1996 57 IPL Kim, A Note on Finding Compact Sets in Graphs Represented by an Adjacency List 1996 57 IPL Trevisan, A Note on Minimum-Area Upward Drawing of Complete Fibonacci Trees 1996 57 IPL Canetti, More on BPP and the Polynomial-Time Hierarchy 1996 57 IPL Attiya & Friedman, Limitations of Fast Consistency Conditions for Distributed Shared Memories 1996 57 IPL Koutsoupias & Papadimitriou, The 2-Evader Problem 1996 57 IPL Lenhart & Liotta, Drawing Outerplanar Minimum Weight Triangulations 1996 57 IPL Cusick, Bounds on the Number of Functions Satisfying the Strict Avalanche Criterion 1996 57 IPL Viswanathan & Czabarka & Sengupta, On Fault-tolerant Embedding of Hamiltonian Circuits in Line Digraph Interconnection Networks 1996 57 IPL Seshadri & Rotem, The Two Headed Disk: Stochastic Dominance of the Greedy Policy 1996 57 IPL Monti & Roncato, A Gap Theorem for the Anonymous Torus 1996 57 IPL Rhee & Liang, An NC Algorithm for the Clique Cover Problem in Cocomparability Graphs and its Application 1996 57 IPL Metivier & Saheb, Medians and Centres of Polyominoes 1996 57 IPL Vadapalli & Srimani, Shortest Routing in Trivalent Cayley Graph Network 1996 57 IPL Aslam & Decatur, On the Sample Complexity of Noise-tolerant Learning 1996 57 IPL Cattell & Dinneen & Fellows, A Simple Linear-Time Algorithm for Finding Path-Decompositions of Small Width 1996 57 IPL Murshed & Kaykobad, Seek Distances in Two-headed Disk Systems 1996 57 IPL Baclawski & Simovici, A Characterization of the Information Content of a Classification 1996 57 IPL Symvonis, Routing on Trees 1996 57 IPL Veanes & Barklund, On the Number of Edges in Cycletrees 1996 57 IPL Clote, A Note on the Monotone Complexity of 2-REF 1996 57 IPL Danyi & Fulop, A Note on the Equivalence Problem of E-Patterns 1996 57 IPL Levcopoulos & Krznaric, Tight Lower Bounds for Minimum Weight-Triangulation Heuristics 1996 57 IPL Goldsmith & Homer, Scalability and the Isomorphism Problem 1996 57 IPL Chen & Yu, A More General Sufficient Condition for Partition Testing to be Better than Random Testing 1996 57 IPL Alimonti, New Local Search Approximation Techniques for Maximum Generalized Satisfiability Problems 1996 57 IPL Muller & Rub & Rulling, A Circuit for Exact Summation of Floating-Point Numbers 1996 57 IPL Abellanas & Garcia & Hernandez-Penalver & Hurtado & Serra & Urrutia, Onion Polygonizations 1996 57 IPL Zimand, A High-Low Kolmogorov Complexity Law Equivalent to the 0-1 Law 1996 57 IPL Blum, An O(n log n) Implementation of the Standard Method for Minimizing n-State Finite Automata 1996 57 IPL Muscholl & Petersen, A Note on the Commutative Closure of Star-free Languages 1996 57 IPL Ghandeharizadeh & Ierardi & Zimmermann, An On-line Algorithm to Optimize File Layout in a Dynamic Environment 1996 57 IPL Garrido & Jarominek & Lingas & Rytter, A Simple Randomized Parallel Algorithm for Maximal f-Matchings 1996 57 IPL Aspvall & Levcopoulos & Lingas & Storlind, On 2-QBF Truth Testing in Parallel 1996 57 IPL Dong & Su, Conjunctive Query Containment with Respect to Views and Constraints 1996 57 IPL Deng, A Lower Bound for Communication on the Crossbar 1996 57 IPL Fagerberg, A Generalization of Binomial Queues 1996 57 IPL Nayak & Acciaro & Gissi, A Note on Isomorphic Chordal Rings (Erratum) 1996 57 IPL Das, Modal Logics in the Theory of Relational Databases 1996 57 IPL Volpano, Lower Bounds on Type Checking Overloading 1996 57 IPL Harper, A Note on ``A Simplified Account of Polymorphic References'' 1996 57 IPL Yanbe & Sakurai, A Short Certificate of the Number of Universal Optimal Strategies for Stopping Simple Stochastic Games 1996 57 IPL Herman & Koczkodaj, A Monte Carlo Study of Pairwise Comparison 1996 57 IPL Dancik, Complexity of Boolean Functions over Bases with Unbounded Fan-in Gates 1996 57 IPL Drozdowski, Real-time Scheduling of Linear Speedup Parallel Tasks 1996 57 IPL Duh & Chen & Hsu, Combinatorial Properties of Generalized Hypercube Graphs 1996 57 IPL Xue, On a Class of Square-free Graphs 1996 57 IPL Lee & Chang, Integrating Authentication in Public Key Distribution System 1996 57 IPL Merlini & Sprugnoli & Verri, A Uniform Model for the Storage Utilization of B-Tree-like Structures 1995 56 IPL Yen, A Note on Fine Covers and Iterable Factors of VAS Languages 1995 56 IPL Uehara, Efficient Simulations by a Biased Coin 1995 56 IPL Youssef & Tavares, Resistance of Balanced s-Boxes to Linear and Differential Cryptanalysis 1995 56 IPL Yao, A Note on Neural Sorting Networks with O(1) Time Complexity 1995 56 IPL Yang, A Better Subgraph of the Minimum Weight Triangulation 1995 56 IPL Chiang & Chen, The (n,k)-Star Graph: A Generalized Star Graph 1995 56 IPL Vilar, Reducing the Overhead of the AESA Metric-Space Nearest Neighbour Searching Algorithm 1995 56 IPL Bokka & Gurla & Olariu & Schwing, Time- and VLSI-Optimal Convex Hull Computation on Meshes with Multiple Broadcasting 1995 56 IPL Chakraborty, A Branching Process Model for Genetic Algorithms 1995 56 IPL Rubinstein & Shutt, Self-modifying Finite Automata: An Introduction 1995 56 IPL Codenotti & Manzini & Margara, Algebraic Techniques in Communication Complexity 1995 56 IPL Pin, A Negative Answer to a Question of Wilke on Varieties of omega-Languages 1995 56 IPL Sempere & Lopez, A McCulloch-Pitts Neural Net to Characterize Even Linear Languages 1995 56 IPL Libkin & Wong, On Representation and Querying Incomplete Information in Databases with Bags 1995 56 IPL Liang & Blum, Circular Convex Bipartite Graphs: Maximum Matching and Hamiltonian Circuits 1995 56 IPL Utard & Hains, Deadlock-free Absorption of Barrier Synchronisations 1995 56 IPL Mereghetti & Pighizzini, A Remark on Middle Space Bounded Alternating Turing Machines 1995 56 IPL Damaschke, A Parallel Algorithm for Nearly Optimal Edge Search 1995 56 IPL Prodinger, Multiple Quickselect -- Hoare's Find Algorithm for Several Elements 1995 56 IPL Lowe, An Attack on the Needham-Schroeder Public-Key Authentication Protocol 1995 56 IPL Albers & von Stengel & Werchner, A Combined BIT and TIMESTAMP Algorithm for the List Update Problem 1995 56 IPL Volpano & Smith, A Type Soundness Proof for Variables in LCF ML 1995 56 IPL Jukna, Computing Threshold Functions by Depth-3 Threshold Circuits with Smaller Thresholds of their Gates 1995 56 IPL Clark & Jacob, On the Security of Recent Protocols 1995 56 IPL Devillers & Golin, Incremental Algorithms for Finding the Convex Hulls of Circles and the Lower Envelopes of Parabolas 1995 56 IPL Srinivasan & Madhukar & Nagavamsi & Rangan & Chang, Edge Domination on Bipartite Permutation Graphs and Cotriangulated Graphs 1995 56 IPL Tomkins, Lower Bounds for Two Call Control Problems 1995 56 IPL Herrera de Figueiredo & Meidanis & Picinin de Mello, A Linear-Time Algorithm for Proper Interval Graph Recognition 1995 56 IPL Krumke, On a Generalization of the p-Center Problem 1995 56 IPL Cusick, Cryptanalysis of a Public Key System Based on Diophantine Equations 1995 56 IPL Chakraborty, A Simpler Derivation of Schema Hazard in Genetic Algorithms 1995 56 IPL Broder & Dyer & Frieze & Raghavan & Upfal, The Worst-Case Running Time of the Random Simplex Algorithm is Exponential in the Height 1995 56 IPL Wang & Chen & Lee, An O(log n) Parallel Algorithm for Constructing a Spanning Tree on Permutation Graphs 1995 56 IPL Lawler & Sarkissian, An Algorithm for ``Ulam's Game'' and its Application to Error Correcting Codes 1995 56 IPL Devroye & Kruszewski, A Note on the Horton-Strahler Number for Random Trees 1995 56 IPL Liang, Steiner Set and Connected Domination in Trapezoid Graphs 1995 56 IPL Arvind & Kobler & Mundhenk, On Reductions to Sets that Avoid EXPSPACE 1995 56 IPL Aspvall, Minimizing Elimination Tree Height Can Increase Fill More than Linearly 1995 56 IPL Barsi & Pinotti, Addendum to ``A Fully Parallel Algorithm for Residue to Binary Conversion'' (Erratum) 1995 56 IPL Thomas, Garbage Collection in Shared-Environment Closure Reducers: Space-efficient Depth First Copying Using a Tailored Approach 1995 56 IPL Estivill-Castro & O'Rourke & Urrutia & Xu, Illumination of Polygons with Vertex Lights 1995 56 IPL Bertoni & Cesa-Bianchi & Fiorino, Efficient Learning with Equivalence Queries of Conjunctions of Modulo Functions 1995 56 IPL Greenwood, On the Equity of Mutual Exclusion Algorithms in Distributed Systems 1995 56 IPL Parberry, A Real-Time Algorithm for the (n^2 - 1) Puzzle 1995 56 IPL Gu & Peng, Node-to-Node Cluster Fault Tolerant Routing in Star Graphs 1995 56 IPL Saxena & Rao, Parallel Algorithms for Connectivity Problems on Interval Graphs 1995 56 IPL Mitchell & Rote & Sundaram & Woeginger, Counting Convex Polygons in Planar Point Sets 1995 56 IPL Leung & Wei, Tighter Bounds on a Heuristic for a Partition Problem 1995 56 IPL Hagerup, The Parallel Complexity of Integer Prefix Summation 1995 56 IPL Petreschi & Sterbini, Recognizing Strict 2-Threshold Graphs in O(m) Time (Erratum) 1995 55 IPL Farach & Przytycka & Thorup, On the Agreement of Many Trees 1995 55 IPL Chen, A Fast and Efficient NC Algorithm for Maximal Matching 1995 55 IPL Nievergelt & Deo, Metric Graphs Elastically Embeddable in the Plane 1995 55 IPL Dasgupta & Chakrabarti & DeSarkar, Utility of Pathmax in Partial Order Heuristic Search 1995 55 IPL Vasconcelos, Unification of Kinded Infinite Trees 1995 55 IPL Broder & Frieze & Lund & Phillips & Reingold, Balanced Allocations for Tree-like Inputs 1995 55 IPL Liang, Fast Parallel Algorithms for the Approximate Edge-Coloring Problem 1995 55 IPL Nayak & Accia & Gissi, A Note on Isomorphic Chordal Rings 1995 55 IPL Park & Goldberg, Order-of-Demand Analysis for Lazy Languages 1995 55 IPL Pitsch, LR(k)-Coupled-Context-Free Grammars 1995 55 IPL Akutsu, Approximate String Matching with Don't Care Characters 1995 55 IPL Ramachandran, Modulo Classes and Logarithmic Advice 1995 55 IPL Horng, Password Authentication without Using a Password Table 1995 55 IPL Tan & Lu, Workload Scheduling for Multiple Query Processing 1995 55 IPL Chen, Solving the Shortest-Paths Problem on Bipartite Permutation Graphs Efficiently 1995 55 IPL Lee & Kim, Resolving All Deadlocks in Distributed Systems 1995 55 IPL Chen, An Optimal Disk System with Two Restricted Heads 1995 55 IPL Leung & Ranjan & Hernandez & Tang & Gonzalez, A Simple Proof on the Decidability of Equivalence between Recursive and Nonrecursive Datalog Programs 1995 55 IPL Park & Choi & Kim, Uniform Partitioning of Relations Using Histogram Equalization Framework: An Efficient Parallel Hash-Based Join 1995 55 IPL Boztas, A Robust Multi-priority Topology-independent Transmission Schedule for Packet Radio Networks 1995 55 IPL Schuler, Some Properties of Sets Tractable Under Every Polynomial-Time Computable Distribution 1995 55 IPL Lam, A Note on Codes Having No Finite Completions 1995 55 IPL Blundo, A Note on Dynamic Threshold Schemes 1995 55 IPL Keller & Walle, A Note on Implementing Combining Networks 1995 55 IPL Atkinson & Scholefield, Transformational vs Reactive Refinement in Real-Time Systems 1995 55 IPL Thirusangu & Rangarajan, A Note on the Construction of Marked Graphs 1995 55 IPL Droubay, Palindromes in the Fibonacci Word 1995 55 IPL Tan & Song, Hexagonal Three-Layer Channel Routing 1995 55 IPL Park & Goldberg, Static Analysis for Optimizing Reference Counting 1995 55 IPL Singhal & Mattern, An Optimality Proof for Asynchronous Recovery Algorithms in Distributed Systems 1995 55 IPL Jha & Slutzki, A Scheme to Construct Distance-Three Codes Using Latin Squares, with Applications to the n-Cube 1995 55 IPL Berard, Untiming Timed Languages 1995 55 IPL Shi & Ritter & Wilson, Simulations between Two Reconfigurable Mesh Models 1995 55 IPL Nikolik, Constraint Preservation through Loops 1995 55 IPL Oellermann & Spinrad, A Polynomial Algorithm for Testing whether a Graph is 3-Steiner Distance Hereditary 1995 55 IPL Chang & Yap, A Note on Improved Deterministic Time Simulation of Nondeterministic Space for Small Space 1995 55 IPL Kavraki & Kolountzakis, Partitioning a Planar Assembly into Two Connected Parts is NP-complete 1995 55 IPL Gong, Collisionful Keyed Hash Functions with Selectable Collisions 1995 55 IPL Hower, Constraint Satisfaction -- Algorithms and Complexity Analysis 1995 55 IPL Westbrook & Yan, Linear Bounds for On-line Steiner Problems 1995 55 IPL Hill, The Lazy z-Buffer 1995 55 IPL Swaminathan & Giriraj & Bhatia, The Pagenumber of the Class of Bandwidth-k Graphs is k-1 1995 55 IPL Alsuwaiyel & Lee, Finding an Approximate Minimum-Link Visibility Path inside a Simple Polygon 1995 55 IPL Wang, Some Results on Selectivity and Self-Reducibility 1995 55 IPL Valois, A 3-valued Wakeup Protocol 1995 55 IPL Saab, Iterative Improvement of Vertex Covers 1995 55 IPL Corneil & Kim & Natarajan & Olariu & Sprague, Simple Linear Time Recognition of Unit Interval Graphs 1995 55 IPL Dermouche, A Fast Algorithm for String Matching with Mismatches 1995 55 IPL Huynh & Marriott, Incremental Constraint Deletion in Systems of Linear Constraints 1995 55 IPL Huang & Hsu & Lee, ECFSM-based Probabilistic Protocol Verification 1995 55 IPL Kloks & Kratsch, Computing a Perfect Edge without Vertex Elimination Ordering of a Chordal Bipartite Graph 1995 55 IPL Hong & Leung, Probabilistic Analysis of k-dimensional Packing Algorithms 1995 55 IPL Barsi & Perotti, Addendum to ``A Fully Parallel Algorithm for Residue to Binary Conversion'' 1995 55 IPL Mahajan & Vinodchandran, A Note on Mod and Generalised Mod Classes 1995 55 IPL Vogler, Fairness and Partial Order Semantics 1995 55 IPL Datta & Sen, 1-Approximation Algorithm for Bottleneck Disjoint Path Matching 1995 55 IPL Lin & Harn, Fair Reconstruction of a Secret 1995 55 IPL Chedid, On the Generalized Twisted Cube 1995 55 IPL Cull & Larson, On Generalized Twisted Cubes 1995 55 IPL Butler, Easy Verification of Behavioural Subtyping in Common Cases 1995 54 IPL de Luca, A Division Property of the Fibonacci Word 1995 54 IPL Tromp & Shallit, Subword Complexity of a Generalized Thue-Morse Word 1995 54 IPL Zissimopoulos, On the Performance Guarantee of Neural Networks for NP-hard Optimization Problems 1995 54 IPL Schmeiser & Barnard, Producing a Top-Down Parse Order with Bottom-Up Parsing 1995 54 IPL Desel & Kindler & Vesper & Walter, A Simplified Proof for a Self-Stabilizing Protocol: A Game of Cards 1995 54 IPL Vadapalli & Srimani, Trivalent Cayley Graphs for Interconnection Networks 1995 54 IPL Alon & Mansour, 3-Discrepancy Sets and Their Application for Interpolation of Sparse Polynomials 1995 54 IPL Laroussinie, About the Expressive Power of CTL Combinators 1995 54 IPL Litow, The Influence of Graph Structure on Generalized Dimension Exchange 1995 54 IPL Oyang, A Tight Upper Bound of the Lumped Disk Seek Time for the Scan Disk Scheduling Policy 1995 54 IPL Bolland & Urrutia, Separating Collection of Points in Euclidean Spaces (Corrigendum) 1995 54 IPL Simon, A Note on Lexicographic Breadth First Search for Chordal Graphs 1995 54 IPL Corneil & Olariu & Stewart, A Linear Time Algorithm to Compute a Dominating Path in an AT-free Graph 1995 54 IPL Herman & Ghosh, Stabilizing Phase-Clocks 1995 54 IPL Fromentin & Jard & Jourdan & Raynal, On-the-Fly Analysis of Distributed Computations 1995 54 IPL Sugihara & Inagaki, Why is the 3D Delaunay Triangulation Difficult to Construct? 1995 54 IPL Demri, 3-SAT = SAT for a Class of Normal Modal Logics 1995 54 IPL Iwama & Pitassi, Exponential Lower Bounds for the Tree-like Hajos Calculus 1995 54 IPL Fujiwara & Masuzawa & Fujiwara, An Optimal Parallel Algorithm for the Euclidean Distance Maps of 2-D Binary Images 1995 54 IPL Blokhuis & Kloks, On the Equivalence Covering Number of Splitgraphs 1995 54 IPL Sajith & Saxena, Optimal Parallel Algorithms for Coloring Bounded Degree Graphs and Finding Maximal Independent Sets in Rooted Trees (Corrigendum) 1995 54 IPL Yu, A New Solution for Thue's Problem 1995 54 IPL Petreschim & Sterbini, Recognizing Strict 2-Threshold Graphs in O(m) Time 1995 54 IPL Fernau, A Note on Uniformly Limited ET0L Systems with Unique Interpretation 1995 54 IPL Kummer, A Learning-Theoretic Characterization of Classes of Recursive Functions 1995 54 IPL Barsi, Decoding Residue Codes 1995 54 IPL Fujita, A Note on the Size of a Multicast Tree in Hypercubes 1995 54 IPL Goldwurm, Random Generation of Words in an Algebraic Language in Linear Binary Space 1995 54 IPL Hebrard, Unique Horn Renaming and Unique 2-Satisfiability 1995 54 IPL Chrobak & Payne, A Linear-Time Algorithm for Drawing a Planar Graph on a Grid 1995 54 IPL Subramanian, A Polynomial Bound on the Number of Light Cycles in an Undirected Graph (Erratum) 1995 54 IPL Gonzalez, A Simple LP-free Approximation Algorithm for the Minimum Weight Vertex Cover Problem 1995 54 IPL Schlipf & Annexstein & Franco & Swaminathan, On Finding Solutions for Extended Horn Formulas 1995 54 IPL Alvarez & Fernandez, Efficient Management of Multiple Outstanding Timeouts 1995 54 IPL Snelick & Ja'Ja' & Kacker & Lyon, Using Synthetic Perturbations and Statistical Screening to Assay Shared-Memory Programs 1995 54 IPL Woeginger, Scheduling with Time-Dependent Execution Times 1995 54 IPL Sloan, Four Types of Noise in Data for PAC Learning 1995 54 IPL Jain & Werth, Analysis of Approximate Algorithms for Edge-Coloring Bipartite Graphs 1995 54 IPL Jenner, Knapsack Problems for NL 1995 54 IPL Gawiejnowicz & Pankowska, Scheduling Jobs with Varying Processing Times 1995 54 IPL Rao, A Note on P-Selective Sets and Closeness 1995 54 IPL Jones, Partial Functions and Logics: A Warning 1995 54 IPL Chen & Chen, Compact Embedding of Binary Trees into Hypercubes 1995 54 IPL Ausiello & Protasi, Local Search, Reducibility and Approximability of NP-Optimization Problems 1995 54 IPL Barriga & Ayani, Lazy Update: An Efficient Implementation of LRU Stacks 1995 54 IPL Myers, Approximately Matching Context-Free Languages 1995 54 IPL Bunke & Csirik, An Improved Algorithm for Computing the Edit Distance of Run-Length Coded Strings 1995 54 IPL Agarwala & Fernandez-Baca, Weighted Search in the Plane 1995 54 IPL Moore & Smyth, A Correction to ``An Optimal Algorithm to Compute all the Covers of a String'' 1995 54 IPL Dong, On the Index of Positive Programmed Formal Languages 1995 54 IPL Cidon & Shavitt, Message Terminating Algorithms for Anonymous Rings of Unknown Size 1995 54 IPL Varghese & Chamberlain & Weihl, Deriving Global Virtual Time Algorithms from Conservative Simulation Protocols 1995 54 IPL Weiss, A Note on Construction of Treaps and Cartesian Trees 1995 54 IPL Nikolopoulos, Constant-Time Parallel Recognition of Split Graphs 1995 54 IPL Petersen, On Space Functions Fully Constructed by Two-dimensional Turing Machines 1995 54 IPL Nassar, A Markov Model for Multibus Multiprocessor Systems under Asynchronous Operation 1995 54 IPL Kaivola, On Modal mu-Calculus and Buchi Tree Automata 1995 54 IPL Dunne & Gittings & Leng, Multiprocessor Simulation Strategies with Optimal Speed-up 1995 54 IPL Rusu, Quasi-Parity and Perfect Graphs 1995 54 IPL Ogihara, On Helping by Parity-like Languages 1995 54 IPL Oberoi, lambda_{beta'} -- A lambda-Calculus with a Generalized beta-Reduction Rule 1995 54 IPL Chickering & Geiger & Heckerman, On Finding a Cycle Basis with a Shortest Maximal Cycle 1995 54 IPL Kao, Linear-Time Optimal Augmentation for Componentwise Bipartite-Completeness of Graphs 1995 53 IPL Spiliopoulou & Cotronis & Hazopoulos, Query Processing for Multimedia Applications on Optical Media 1995 53 IPL May & Lunn, New Statistics for Demand-based Software Testing 1995 53 IPL Macarie, Decreasing the Bandwidth of a Transition Matrix 1995 53 IPL Goldmann, A Note on the Power of Majority Gates and Modular Gates 1995 53 IPL Dijkstra, An Experiment with the Use of Predicate Transformers in UNITY 1995 53 IPL Natu & Fang, On the Point-to-Point Connection Problem 1995 53 IPL Otto, A Note on the Number of Monadic Quantifiers in Monadic Sigma_1^1 1995 53 IPL Valmari, The Weakest Deadlock-Preserving Congruence 1995 53 IPL O'Connor, A New Lower Bound on the Expected Size of Irredundant Forms for Boolean Functions 1995 53 IPL El-Yaniv & Kleinberg, Geometric Two-Server Algorithms 1995 53 IPL Kim & Park & Choi & Shin & Chwa, An Optimal Algorithm for Finding the Edge Visibility Polygon under Limited Visibility 1995 53 IPL Otto, Solvability of Word Equations Modulo Finite Special and Confluent String-Rewriting Systems is Undecidable in General 1995 53 IPL Laih & Tu & Tai, On the Security of the Lucas Function 1995 53 IPL Davis & Burns, Optimal Priority Assignment for Aperiodic Tasks with Firm Deadlines in Fixed Priority Pre-emptive Systems 1995 53 IPL Heydemann & Sotteau, A Note on Recursive Properties of the de Bruijn, Kautz and FFT Digraphs 1995 53 IPL Barbosa & Porto, An Algorithm for FIFO Message Delivery among Migrating Tasks 1995 53 IPL Tokuda & Watanabe, An Efficient Semantic Evaluator for Warped LC(1) Attributed Grammars 1995 53 IPL Hamdi, Topological Properties of the Directional Hypercube 1995 53 IPL Veloso & Maibaum, On the Modularization Theorem for Logical Specifications 1995 53 IPL Steiger & Streinu, A Pseudo-algorithmic Separation of Lines from Pseudo-lines 1995 53 IPL Subramanian, A Polynomial Bound on the Number of Light Cycles in an Undirected Graph 1995 53 IPL Boland & Urrutia, Separating Collections of Points in Euclidean Spaces 1995 53 IPL Tu & Smith, Training Digraphs 1995 53 IPL Gupta, Generalized Dominators 1995 53 IPL De Prisco & Persiano, Characteristic Inequalities for Binary Trees 1995 53 IPL Kucherov & Rusinowitch, Undecidability of Ground Reducibility for Word Rewriting Systems with Variables 1995 53 IPL Matousek, On Enclosing k Points by a Circle 1995 53 IPL Ohlebusch, Termination is not Modular for Confluent Variable-Preserving Term Rewriting Systems 1995 53 IPL Likas & Stafylopatis, A Parallel Algorithm for the Minimum Weighted Vertex Cover Problem 1995 53 IPL Rittri, Semi-unification of Two Terms in Abelian Groups (Corrigendum) 1995 53 IPL von Karger & Hoare, Sequential Calculus 1995 53 IPL Mathematics of Program Construction Group, Fixed-point Calculus 1995 53 IPL The Eindhoven Tuesday Afternoon Club, Constructing the Galois Adjoint 1995 53 IPL Dijkstra, Heuristics for a Calculational Proof 1995 53 IPL Gries & Schneider, Equational Propositional Logic 1995 53 IPL Kornerup, Mapping a Functional Notation for Parallel Programs onto Hypercubes 1995 53 IPL Rustan & Leino, Constructing a Program with Exceptions 1995 53 IPL Back & von Wright, Games and Winning Strategies 1995 53 IPL Russell & Sundaram, The Relativized Relationship between Probabilistically Checkable Debate Systems, IP and PSPACE 1995 53 IPL Fischer, A Note on the Complexity of Local Search Problems 1995 53 IPL Kurosawa & Okada & Tsujii, Low Exponent Attack against Elliptic Curve RSA 1995 53 IPL Ang & Tan, The Interval B-Tree 1995 53 IPL Lim & Lee, Several Practical Protocols for Authentication and Key Exchange 1995 53 IPL Hwang & Chen, On the Security of SPLICE/AS -- The Authentication System in WIDE Internet 1995 53 IPL Hwang & Lee & Li & Ko & Chen, Two Attacks on Neuman-Stubblebine Authentication Protocols 1995 53 IPL Hassin & Tamir, On the Minimum Diameter Spanning Tree Problem 1995 53 IPL Wolfson & Jajodia, An Algorithm for Dynamic Data Allocation in Distributed Systems 1995 53 IPL Jain, On a Question about Learning Nearly Minimal Programs 1995 53 IPL Franzle & von Stengel & Wittmuss, A Generalized Notion of Semantic Independence 1995 53 IPL Monti & Roncato, Completeness Results Concerning Systolic Tree Automata and E0L Languages 1995 53 IPL Canetti & Even & Goldreich, Lower Bounds for Sampling Algorithms for Estimating the Average 1995 53 IPL Clementi & Impagliazzo, The Reachability Problem for Finite Cellular Automata 1995 53 IPL Kulasinghe & Bettayeb, Multiply-twisted Hypercube with Five or More Dimensions is not Vertex-transitive 1995 53 IPL Aggarwal & Jain & Gupta, An Efficient Selection Algorithm on the Pyramid 1995 53 IPL Zheng, On Key Agreement Protocols Based on Tamper-proof Hardware 1995 53 IPL Chang & Hsu, Element Perturbation Problems of Optimum Spanning Trees with Two-Parameter Objectives 1994 52 IPL Bergstra & Stefanescu, Bisimulation is Two-Way Simulation 1994 52 IPL Carpi, On Repeated Factors in C^infinity-Words 1994 52 IPL Bhattacharya & Bagchi, A General Framework for Minimax Search in Game Trees 1994 52 IPL Klein, A Data Structure for Bicategories, with Application to Speeding Up an Approximation Algorithm 1994 52 IPL Liang, Dominations in Trapezoid Graphs 1994 52 IPL Yan & Chang, The Path-Partition Problem in Block Graphs 1994 52 IPL Petersen, On the Determinacy Problem for Two-way Pushdown Automata 1994 52 IPL O'Connor, An Upper Bound on the Number of Functions Satisfying the Strict Avalanche Criterion 1994 52 IPL Boppana, The Decision-Tree Complexity of Element Distinctness 1994 52 IPL Fokkink, A Complete Equational Axiomatization for Prefix Iteration 1994 52 IPL Bertoni & Mereghetti & Pighizzini, An Optimal Lower Bound for Nonregular Languages (Corrigendum) 1994 52 IPL Lu & Cheng & Wuu, A Complete Decoding Algorithm for Double-Error-Correcting Primitive Binary BCH Codes of Odd m (Corrigendum) 1994 52 IPL Petersen, Refined Simulation of Multihead Automata 1994 52 IPL Book, On Collapsing the Polynomial-Time Hierarchy 1994 52 IPL Khuller & Vishkin, On the Parallel Complexity of Digraph Reachability 1994 52 IPL Korsh, Loopless Generation of k-ary Tree Sequences 1994 52 IPL Bax, Algorithms to Count Paths and Cycles 1994 52 IPL Weiss, Linear-Time Construction of Treaps and Cartesian Trees 1994 52 IPL Yan & Hsiao, A Fuzzy Clustering Algorithm for Graph Bisection 1994 52 IPL Chen, A Parallel Algorithm for Finding a Triconnected Component Separator with an Application 1994 52 IPL Duszak & Koczkodaj, Generalization of a New Definition of Consistency for Pairwise Comparisons 1994 52 IPL Luccio & Pedrotti, A Parallel List Update Problem 1994 52 IPL Rao & Rothe & Watanabe, Upward Separation for FewP and Related Classes 1994 52 IPL Cohen, The Convergence Span of Greedy Load Balancing 1994 52 IPL Iwamoto & Toussaint, Finding Hamiltonian Circuits in Arrangements of Jordan Curves is NP-Complete 1994 52 IPL Lee & Kim & Choe, Path for AND-Parallel Execution of Logic Programs 1994 52 IPL Sun & Shieh, On Dynamic Threshold Schemes 1994 52 IPL Nuutila, An Efficient Transitive Closure Algorithm for Cyclic Digraphs 1994 52 IPL de Berg & van Kreveld, Rectilinear Decompositions with Low Stabbing Number 1994 52 IPL Kelson, An Optimal Parallel Algorithm for Maximal Matching 1994 52 IPL Pedrotti, Analysis of a List-Update Strategy 1994 52 IPL Liang, On the Feedback Vertex Set Problem in Permutation Graphs 1994 52 IPL Pruhs, Average-Case Scalable On-line Algorithms for Fault Replacement 1994 52 IPL Durand & Salinier, Constructor Equivalent Term Rewriting Systems are Strongly Sequential: A Direct Proof 1994 52 IPL Dietz & Raman, A Constant Update Time Finger Search Tree 1994 52 IPL Devroye & Kruszewski, A Note on the Horton-Strahler Number for Random Trees 1994 52 IPL Wagner, Approximate Map Labeling is in Omega(n log n) 1994 52 IPL Flammini, On the Learnability of Monotone k mu-DNF Formulae under Product Distributions 1994 52 IPL Seidl, Haskell Overloading is DEXPTIME-Complete 1994 52 IPL Rittri, Semi-unification of Two Terms in Abelian Groups 1994 52 IPL Liaw & Lee, An Optimal Algorithm to Solve the Minimum Weakly Cooperative Guards Problem for 1-Spiral Polygons 1994 52 IPL Peng & Wang & Lee, Recognizing Shortest-Path Trees in Linear Time 1994 52 IPL Hassin & Lahav (Haddad), Maximixing the Number of Unused Colors in the Vertex Coloring Problem 1994 52 IPL Tokuda & Watanabe, An Attribute Evaluation of Context-free Languages 1994 52 IPL Gouda, Stabilizing Observers 1994 52 IPL Mayo & Kearns, Distributed Termination Detection with Roughly Synchronized Clocks 1994 52 IPL Roos & Widmayer, k-Violation Linear Programming 1994 52 IPL Akinari & Hagiwara, On the Real-Number Representation with Variable-Length Exponent Field 1994 52 IPL Martel, Maximum Finding on a Multiple Access Broadcast Network 1994 52 IPL Mogensen, WORM-2DPDAs: An Extension to 2DPDAs That Can Be Simulated in Linear Time 1994 52 IPL Khan, An Algorithm for Hazard-free Minimization of Incompletely Specified Switching Function 1994 52 IPL Larmore & Rytter, An Optimal Sublinear Time Parallel Algorithm for Some Dynamic Programming Problems 1994 52 IPL Chen & Shen & Topor, An Efficient Permutation-based Parallel Range-Join Algorithm on N-Dimensional Torus Computers 1994 52 IPL Kleinberg, A Lower Bound for Two-Server Balancing Algorithms 1994 52 IPL Galbiati & Maffioli & Morzenti, A Short Note on the Approximability of the Maximum Leaves Spanning Tree Problem 1994 52 IPL Mei & Igarashi, An Efficient Strategy for Robot Navigation in Unknown Environment 1994 51 IPL Tsai & Tang & Chen, Average Performance of a Greedy Algorithm for the On-line Minimum Matching Problem on Euclidean Space 1994 51 IPL Seiden & Hirschberg, Finding Succinct Ordered Minimal Perfect Hash Functions 1994 51 IPL Chandra, Constructing Sparse Spanners for Most Graphs in Higher Dimensions 1994 51 IPL Hofri, On Timeout for Global Deadlock Detection in Decentralized Database Systems 1994 51 IPL Lysne, Extending Bachmair's Method for Proof by Consistency to the Final Algebra 1994 51 IPL Lopez-Ortiz, New Lower Bounds for Element Distinctness on a One-Tape Turing Machine 1994 51 IPL Kuzjurin, Multi-processor Scheduling and Expanders 1994 51 IPL Acciaro, On the Complexity of Computing Grobner Bases in Characteristic 2 1994 51 IPL Chen & van Vliet & Woeginger, A Lower Bound for Randomized On-line Scheduling Algorithms 1994 51 IPL Albacea, Parallel Algorithm for Finding a Core of a Tree Network 1994 51 IPL Dey & Shah, Many-Face Complexity in Incremental Convex Arrangements 1994 51 IPL Jwo & Tuan, On Transmitting Delay in a Distance-Transitive Strongly Antipodal Graph 1994 51 IPL Shen & Hu & Liang, Realization of an Arbitrary Permutation on a Hypercube 1994 51 IPL Long, Halfspace Learning, Linear Programming, and Nonmalicious Distributions 1994 51 IPL Allison, Using Hirschberg's Algorithm to Generate Random Alignments of Strings 1994 51 IPL Raz, Serializability by Commitment Ordering 1994 51 IPL Gergov, Time-Space Tradeoffs for Integer Multiplication on Various Types of Input Oblivious Sequential Machines 1994 51 IPL Gusfield, Faster Implementation of a Shortest Superstring Approximation 1994 51 IPL Hung & Parhami, Fast RNS Division Algorithms for Fixed Divisors with Application to RSA Encryption 1994 51 IPL Raspaud & Sopena, Good and Semi-Strong Colorings of Oriented Planar Graphs 1994 51 IPL Barth & Raspaud, Two Edge-Disjoint Hamiltonian Cycles in the Butterfly Graph 1994 51 IPL Sridharan & Stephanou & Craig & Keerthi, Distance Measures on Intersecting Objects and their Applications 1994 51 IPL Fischer & Hoffgen, Computing a Maximum Axis-Aligned Rectangle in a Convex Polygon 1994 51 IPL Cheng & Masuyama, On the Equivalence in Complexity among Three Computation Problems on Maximum Number of Edge-Disjoint s-t Paths in a Probabilistic Graph 1994 51 IPL Harper, A Simplified Account of Polymorphic References 1994 51 IPL Eppstein, Arboricity and Bipartite Subgraph Listing Algorithms 1994 51 IPL Hu & Chen & Hwang, A New Competitive Algorithm for the Counterfeit Coin Problem 1994 51 IPL Jerrum, Counting Trees in a Graph is #P-Complete 1994 51 IPL Lu & Chen & Wuu, A Complete Decoding Algorithm for Double-Error-Correcting Primitive Binary BCH Codes of Odd m 1994 51 IPL Easwarakumar & Rangan & Cheston, A Linear Algorithm for Centering a Spanning Tree of a Biconnected Graph 1994 51 IPL Bapiraju & Rao, Enumeration of Binary Trees 1994 51 IPL Chen & Ni, Internal Path Length of the Binary Representation of Heap-ordered Trees 1994 51 IPL Hassin & Rubinstein, Approximations for the Maximum Acyclic Subgraph Problem 1994 51 IPL Deineko & van Dal & Rote, The Convex-Hull-and-Line Traveling Salesman Problem: A Solvable Case 1994 51 IPL Szwarcfiter & Chaty, Enumerating the Kernels of a Directed Graph with No Odd Circuits 1994 51 IPL Ramalingam & Reps, On Competitive On-line Algorithms for the Dynamic Priority-ordering Problem 1994 51 IPL Blum & Rochow, A Lower Bound on the Single-Operation Worst-Case Time Complexity of the Union-Find Problem on Intervals 1994 51 IPL Basin, A Term Equality Problem Equivalent to Graph Isomorphism 1994 51 IPL Frazier & Page, Prefix Grammars: An Alternative Characterization of the Regular Languages 1994 51 IPL Blackburn, Increasing the Rate of Output of m-Sequences 1994 51 IPL Hemaspaandra, Census Techniques Collapse Space Classes 1994 51 IPL Lee & Choe, Grammar Coverings of a Deterministic Parser with Action Conflicts 1994 51 IPL Sengupta & Viswanathan, On Fault-tolerant Fixed Routing in Hypercubes 1994 51 IPL Bilardi & Chaudhuri & Dubhashi & Mehlhorn, A Lower Bound for Area-Universal Graphs 1994 51 IPL Kirrinnis, An Optimal Bound for Path Weights in Huffman Trees 1994 51 IPL Diks & Kranakis & Krizanc & Mans & Pelc, Optimal Coteries and Voting Schemes 1994 51 IPL Mahajan & Thierauf & Vinodchandran, A Note on SpanP Functions 1994 51 IPL Wen, New Algorithms for the LCA Problem and the Binary Tree Reconstructions Problem 1994 51 IPL Jimbo & Maruoka, On the Relationship between epsilon-Biased Random Variables and epsilon-Dependent Random Variables 1994 51 IPL Chen & Chuang, A Fast Algorithm for Euclidean Distance Maps of a 2-D Binary Image 1994 51 IPL Gil & Matias, Designing Algorithms by Expectations 1994 51 IPL Igarashi & Osawa & Unger, Automorphisms of Broadcasting Schemes with Respect to Start Rounds 1994 51 IPL Sinachopoulos, Logics and Decidability for Labelled Pre- and Partially Ordered Kripke Structures 1994 51 IPL Halperin & Sharir, On Disjoint Concave Chains in Arrangements of (Pseudo) Lines 1994 50 IPL Bertoni & Mereghetti & Pighizzini, An Optimal Lower Bound for Nonregular Languages 1994 50 IPL Pirillo, Infinite Words and Biprefix Codes 1994 50 IPL Lin & Lin, Minimal Fully Adaptive Wormhole Routing on Hypercubes 1994 50 IPL Galvez, A Note on a Proposed LALR Parser for Extended Context-free Grammars 1994 50 IPL Nykanen & Ukkonen, Finding Lowest Common Ancestors in Arbitrarily Directed Trees 1994 50 IPL Alagar & Venkatesan, An Optimal Algorithm for Distributed Snapshots with Causal Message Ordering 1994 50 IPL Gergov & Meinel, On the Complexity of Analysis and Manipulation of Boolean functions in Terms of Decision Graphs 1994 50 IPL Atkinson & Sack, Uniform Generation of Forests of Restricted Height 1994 50 IPL Naumann, A Recursion Theorem for Predicate Transformers on Inductive Data Types 1994 50 IPL Pagli & Pucci, Counting the Number of Fault Patterns in Redundant VLSI Arrays 1994 50 IPL Manzini, Sparse Matrix Vector Multiplication on Distributed Architectures: Lower Bounds and Average Complexity Results 1994 50 IPL Moore & Smyth, An Optimal Algorithm to Compute All the Covers of a String 1994 50 IPL Neilsen & Mizuno, Nondominated k-Coteries for Multiple Mutual Exclusion 1994 50 IPL Li, Trajectory Planning in H-Space 1994 50 IPL Zhang & Ozsoyoglu, Some Results on the Containment and Minimization of (In)equality Queries 1994 50 IPL Perleberg, Single Character Searching Methods and the shift-or Pattern-Matching Algorithm 1994 50 IPL Jimbo & Maruoka, On the Relationship between the Diameter and the Size of a Boundary of a Directed Graph 1994 50 IPL Punnen & Nair, A Fast and Simple Algorithm for the Bottleneck Biconnected Spanning Subgraph Problem 1994 50 IPL Sugihara, Simpler Proof of a Realizability Theorem on Delaunay Triangulations 1994 50 IPL Resende & El Abbadi, On the Serializability Theorem for Nested Transactions 1994 50 IPL Ravi, A Primal-Dual Approximation Algorithm for the Steiner Forest Problem 1994 50 IPL Manber & Wu, An Algorithm for Approximate Membership Checking with Application to Password Security 1994 50 IPL Radhakrishnan & Subrahmanyam, Directed Monotone Contact Networks for Threshold Functions 1994 50 IPL Narayanaswami & Luken, Approximating x^n Efficiently 1994 50 IPL Istrail & Zivkovic, Bounded-Width Polynomial-Size Boolean Formulas Compute Exactly Those Functions in AC^0 1994 50 IPL Berkovich, Multiprocessor Interconnection Network Using Pairwise Balanced Combinatorial Designs 1994 50 IPL Wang & Lowry & Fuchs, Consistent Global Checkpoints Based on Direct Dependency Tracking 1994 50 IPL Barsi & Pinotti, A Fully Parallel Algorithm for Residue to Binary Conversion 1994 50 IPL Azar & Broder & Frieze, On the Problem of Approximating the Number of Bases of a Matroid 1994 50 IPL Lin, Determining the Global Progress of Parallel Simulation with FIFO Communication 1994 50 IPL Demange & Grisoni & Paschos, Approximation Results for the Minimum Graph Coloring Problem 1994 50 IPL Fraenkel & Reingold & Saxena, Efficient Management of Dynamic Tables 1994 50 IPL Collette, An Explanatory Presentation of Composition Rules for Assumption-Commitment 1994 50 IPL Seberrry & Zhang & Zheng, Improving the Strict Avalanche Characteristics of Cryptographic Functions 1994 50 IPL Kim, An Optimal Scheduling Algorithm for Preemptable Real-time Tasks 1994 50 IPL Khuller & Raghavachari & Young, Designing Multi-commodity Flow Trees 1994 50 IPL Bartal & Karloff & Rabani, A Better Lower Bound for On-line Scheduling 1994 50 IPL Moriya, On Two-Way Tree Automata 1994 50 IPL Dietz & Macarie & Seiferas, Bits and Relative Order from Residues, Space Efficiently 1994 50 IPL Kim & Kim, O(log n) Numerical Algorithms on a Mesh with Wormhole Routing 1994 50 IPL Weems & Swayze, Allocation Techniques for Distributed Reduction Data Elements 1994 50 IPL Ding & Weiss, On the Complexity of Building an Interval Heap 1994 50 IPL Kumar & Babu, Optimal Network Partitioning for Fault-Tolerant Network Management Using Evolutionary Programming 1994 50 IPL Dhamdhere & Kulkarni, A Token Based k-Resilient Mutual Exclusion Algorithm for Distributed Systems 1994 50 IPL Yuan, Logic Program Semantics and Circumscription of Autoepistemic Theories 1994 50 IPL Baldoni & Ciciani, Distributed Algorithms for Multiple Entries to a Critical Section with Priority 1994 50 IPL Maire, Polyominos and Perfect Graphs 1994 50 IPL Ferragina, Static and Dynamic Parallel Computation of Connected Components 1994 50 IPL Chang & Yuan, Message Complexity of Hierarchical Quorum Consensus Algorithm 1994 50 IPL Roy & Athithan & Ganagi & Reddy, A New Method to Solve Non-linear Equations 1994 50 IPL Deo & Jain & Medidi, An Optimal Parallel Algorithm for Merging Using Multiselection 1994 50 IPL Chen, Finding the k Quickest Simple Paths in a Network 1994 50 IPL Di Crescenzo & Persiano, Round-Optimal Perfect Zero-Knowledge Proofs 1994 50 IPL Siromoney & Mathew & Dare & Subramanian, Infinite Lyndon Words 1994 50 IPL Simha & Majumdar, On Lookahead in the List Update Problem 1994 50 IPL Gurla, Leftmost One Computation on Meshes with Row Broadcasting (Corrigendum) 1994 49 IPL Tel, Maximal Matching Stabilizes in Quadratic Time 1994 49 IPL Libkin & Wong, Conservativity of Nested Relational Calculi with Internal Generic Functions 1994 49 IPL Chepoi & Dragan, Computing a Median Point of a Simple Rectilinear Polygon 1994 49 IPL Borchers & Gupta, Extending the Quadrangle Inequality to Speed-up Dynamic Programming 1994 49 IPL Rajsbaum, Upper and Lower Bounds for Stochastic Marked Graphs 1994 49 IPL Collin & Dolev, Self-Stabilizing Depth-First Search 1994 49 IPL Sajith & Saxena, Optimal Parallel Algorithms for Coloring Bounded Degree Graphs and Finding Maximal Independent Sets in Rooted Trees 1994 49 IPL Kann, Maximum Bounded H-Matching is MAX SNP-Complete 1994 49 IPL Reddy & Leiss, An O(log N) Algorithm to Solve Linear Recurrences on Hypercubes 1994 49 IPL Prodinger, An Asymptotic Comment on a Paper by Analyti and Pramanik 1994 49 IPL Khardon, On Using the Fourier Transform to Learn Disjoint DNF 1994 49 IPL Paul, A Note on Bitonic Sorting 1994 49 IPL van Wezel & Tel, An Assertional Proof of Rana's Algorithm 1994 49 IPL Breslauer, Testing String Superprimitivity in Parallel 1994 49 IPL Tiwari & Tompa, A Direct Version of Shamir and Snir's Lower Bounds on Monotone Circuit Depth 1994 49 IPL Zhang & Jiang, Some MAX SNP-hard Results Concerning Unordered Labeled Trees 1994 49 IPL Kolountzakis, Selection of a Large Sum-free Subset in Polynomial Time 1994 49 IPL Wuu & Huang, Identity Assignment in Uniform Synchronous Rings 1994 49 IPL Pemmaraaju & Shaffer, Analysis of the Worst Case Space Complexity of a PR Quadtree 1994 49 IPL Blazewicz & Dell'Olmo & Drozdowski & Speranza, Scheduling Multiprocessor Tasks on Three Dedicated Processors (Corrigendum) 1994 49 IPL Wang, A New Routing Algorithm for Cyclic Shifts on BRGC Hypercubes 1994 49 IPL Huang & Huang & Wang, A Sweepline Algorithm to Solve the Two-Center Problem 1994 49 IPL de Luca & Mione, On Bispecial Factors of the Thue-Morse Word 1994 49 IPL Leuchner & Miller & Slutzki, A Note on the Equivalence of a Set of egds to a Set of FDs 1994 49 IPL Calvert, Eliminating Disjunctions of Leads-To Properties 1994 49 IPL Neiger, Distributed Consensus Revisited 1994 49 IPL Kim & Park, Two-way dominant Sequence Clustering for Processor Scheduling 1994 49 IPL Cheng & Cunningham, A Faster Algorithm for Computing the Strength of a Network 1994 49 IPL Kakugawa & Fujita & Yamashita & Ae, A Distributed k-Mutual Exclusion Algorithm Using k-Coterie 1994 49 IPL Amir & Farach & Muthukrishnan, Alphabet Dependence in Parameterized Matching 1994 49 IPL Kim, The Range Co-Minima Problem 1994 49 IPL Ladermann & Petersen, Notes on Looping Deterministic Two-way Pushdown Automata 1994 49 IPL Li & Chang, An Algorithm to Estimate the Fraction Defective and the Exponential Mean Life Using Unlabeled Samples 1994 49 IPL Shibata & Shirahata & Osawa, Counting Closed Walks in Generalized de Bruijn Graphs 1994 49 IPL Panda & Mohanty, Recognition Algorithm for Intersection Graphs of Edge Disjoint Paths in a Tree 1994 49 IPL Jovanovic & Misic, Fault Tolerance of the Star Graph Interconnection Network 1994 49 IPL Monet & Buss, Size-Depth Tradeoffs for Boolean Formulae 1994 49 IPL Yang & Dhall & Lakshmivarahan, A Processor Efficient MIS Algorithm on Random Graphs 1994 49 IPL Singh, Real-time Leader Election 1994 49 IPL Jung & Choe & Han, An Efficient Computation of Right Context for LR-based Error Repair 1994 49 IPL Saxena, Two-Coloring Linked Lists is NC^1-complete for Logarithmic Space 1994 49 IPL Gemmell & Harchol, Tight Bounds on Expected Time to Add Correctly and Add Mostly Correctly 1994 49 IPL Steinbach, Generating Polynomial Orderings 1994 49 IPL Mairson, Generating Words in a Context-free Language Uniformly at Random 1994 49 IPL Klop & Middeldorp & Toyama & de Vrijer, Modularity of Confluence: A Simplified Proof 1994 49 IPL Gianuzzi, Distributed Termination Detection in Reducible Communication Graphs 1994 49 IPL Nuutila & Soisalon-Soininen, On Finding the Strongly Connected Components in a Directed Graph 1994 49 IPL Goldmann & Grape & Hastad, On Average Time Hierarchies 1994 49 IPL Kanchanasut, A Shortest-Path Algorithm for Manhattan Graphs 1994 49 IPL Belbaraka & Stojmenovic, On Generating B-Trees with Constant Average Delay and in Lexicographic Order 1994 49 IPL Veljan, Computing Values of a Polynomial with Only Few Multiplications 1994 49 IPL Ting & Yao, A Randomized Algorithm for Finding Maximum with O((log n)^2) Polynomial Tests 1994 49 IPL Rhee & Liang & Dhall & Lakshmivarahan, Efficient Algorithms for Finding Depth-First and Breadth-First Search Trees in Permutation Graphs 1994 49 IPL Kaplan & Shamir, The Domatic Number Problem on Some Perfect Graph Families 1993 48 IPL Culik & Kari, Parametrized Recurrent Systems for Image Generation 1993 48 IPL Rodrigues & Ural, Exact Solutions for the Construction of Optimal Length Test Sequences 1993 48 IPL Vincent & Srinivasan, A Note on Relation Schemes which are in 3NF but not in BCNF 1993 48 IPL Inoue & Ito & Takanami & Yoshinaga, A Note on Multi-Inkdot Nondeterministic Turing Machines with Small Space 1993 48 IPL Pillaipakkamnatt & Raghavan, A Linear Time Equivalence Test for Read-Twice DNF Formulas 1993 48 IPL Fraigniaud & Kenyon & Pelc, Finding a Target Subnetwork in Sparse Networks with Random Faults 1993 48 IPL Goldschmidt & Hochbaum & Yu, A Modified Greedy Heuristic for the Set Covering Problem with Improved Worst Case Bound 1993 48 IPL Dankelmann, Computing the Average Distance of an Interval Graph 1993 48 IPL Ho & Leung & Wei, Complexity of Scheduling Tasks with Time-dependent Execution Times 1993 48 IPL Iwano & Katoh, Efficient Algorithms for Finding the Most Vital Edge of a Minimum Spanning Tree 1993 48 IPL Johnson & Harathi, A Simple Correctness Proof of the MCS Contention-free Lock 1993 48 IPL Grinstead & Slater & Sherwani & Holmes, Efficient Edge Domination Problems in Graphs 1993 48 IPL Kavraki & Latombe & Wilson, On the Complexity of Assembly Partitioning 1993 48 IPL Sheu & Liaw & Chen, A Broadcasting Algorithm in Star Graph Interconnection Networks 1993 48 IPL Rouskov & Srimani, Fault Diameter of Star Graphs 1993 48 IPL Golin & Sedgewick, Queue-Mergesort 1993 48 IPL Billionnet, Partitioning Multiple-Chain-like Task Across a Host-Satellite System 1993 48 IPL Khoong, Optimal Parallel Construction of Heaps 1993 48 IPL Lee & Choe & Han, A Description of Dynamic Behavior for Compilers Based on Object Oriented Modeling 1993 48 IPL Reichwein & Fiadeiro, Models for the Substitution Axiom of UNITY Logic 1993 48 IPL Tsai & Tang, The Competitiveness of Randomized Algorithms for On-line Steiner Tree and On-line Spanning Tree Problems 1993 48 IPL Fulop & Gyenizse, On Injectivity of Deterministic Top-Down Tree Transducers 1993 48 IPL Tan & Lu, On Resource Scheduling of Multi-Join Queries in Parallel Database Systems 1993 48 IPL Paterson & Schroder & Sykora & Vrt'o, A Short Proof of the Dilation of a Toroidal Mesh in a Path 1993 48 IPL Buhrman & Torenvliet & van Emde Boas, Twenty Questions to a p-Selector 1993 48 IPL Chang & Liu, Polynomial Algorithms for the Weighted Perfect Domination Problems on Chordal Graphs and Split Graphs 1993 48 IPL Tscha & Choi & Lee, Rearrangeable Nonblocking Condition for Multi-log_2 N Multiconnection Networks 1993 48 IPL Shah, A Parallel Algorithm for Constructing Projection Polyhedra 1993 48 IPL Chang & Wang & Kankanhalli, Multidimensional On-line Bin-packing: An Algorithm and its Average-case Analysis 1993 48 IPL Fujita & Yamashita, Fast Gossiping on Square Mesh Computers 1993 48 IPL Hensgen & Sims & Charley, A Fair Banker's Algorithm for Read and Write Locks 1993 48 IPL Sieling & Wegener, Reduction of OBDDs in Linear Time 1993 48 IPL Ramarao & Venkatesan, The Lower Bounds on Distributed Shortest Paths 1993 48 IPL Bennaceur & Plateau, An Exact Algorithm for the Constraint Satisfaction Problem: Application to Logical Inference 1993 48 IPL Karloff, Fast Algorithms for Approximately Counting Mismatches 1993 48 IPL Pretolani, A Linear Time Algorithm for Unique Horn Satisfiability 1993 48 IPL Yang, An Incremental LL(1) Parsing Algorithm 1993 48 IPL Atkinson & Walker, Enumerating k-way Trees 1993 48 IPL Steel & Warnow, Kaikoura Tree Theorems: Computing the Maximum Agreement Subtree 1993 48 IPL Gartner, A Remark on the Regulation of kIET0L Systems 1993 48 IPL Chinn & Sinha, Bounds on Sample Space Size for Matrix Product Verification 1993 48 IPL Gupta, On Bounded-Probability Operators and C_= P 1993 48 IPL Voss, Worst-Case Performance of Some Heuristics for Steiner's Problem in Directed Graphs 1993 48 IPL Hall, Using Overloading to Express Distinctions between Evaluators 1993 48 IPL Buchsbaum & Carlisle, Determining Uni-connectivity in Directed Graphs 1993 48 IPL Hachem, An Approximate Analysis of the Performance of Extendible Hashing with Elastic Buckets 1993 48 IPL Ahuja, Assertions about Past and Future in Highways: Global Flush Broadcast and Flush-Vector-Time 1993 48 IPL Yellin & Jutla, Finding Extremal Sets in Less than Quadratic Time 1993 48 IPL Hwang, Scheme for Secure Digital Mobile Communications Based on Symmetric Key Cryptography 1993 48 IPL Santos & Orozco, Rate Monotonic Scheduling in Hard Real-Time Systems 1993 48 IPL Yu & Yang, A Simple Optimal Parallel Algorithm for the Minimum Coloring Problem on Interval Graphs 1993 47 IPL Arkin & Halldorsson & Hassin, Approximating the Tree and Tour Covers of a Graph 1993 47 IPL Krizanc, Integer Sorting on a Mesh-connected Array of Processors 1993 47 IPL Gumm, Another Glance at the Alpern-Schneider Characterization of Safety and Liveness in Concurrent Executions 1993 47 IPL Shen, Static Behavior Analysis of a Mesh System 1993 47 IPL Hastad & Phillips & Safra, A Well-Characterized Approximation Problem 1993 47 IPL Udink & Kok, Unity Properties and Sequences of States, Some Observations 1993 47 IPL Huhne, Linear Speed-up Does Not Hold on Turing Machines with Tree Storages 1993 47 IPL Eades & Lin & Smyth, A Fast and Effective Heuristic for the Feedback Arc Set Problem 1993 47 IPL Chen & Guha, Testing a Simple Polygon for Monotonicity Optimally in Parallel 1993 47 IPL Kim & Ahn & Lim, An Algebraic Algorithm to Compute the Exact General Sweep Boundary of a 2D Curved Object 1993 47 IPL Rao & Luo, On Similarity of Polynomial Configurations 1993 47 IPL Chang & Choe & Han, Static Filtering on Stratified Programs 1993 47 IPL Park & Lee & Choe, On the Reduction of LR(k) Parsers 1993 47 IPL Alonso & Reingold & Schott, Determining the Majority 1993 47 IPL de Almeida & Barbosa, A String-Matching Algorithm for the CREW PRAM 1993 47 IPL Gurla, Leftmost One Computation on Meshes with Row Broadcasting 1993 47 IPL Vaidyanathan & Trahan, Optimal Simulation of Multidimensional Reconfigurable Meshes by Two-dimensional Reconfigurable Meshes 1993 47 IPL Lim & Chee & Cheng, Single Jog Minimum Area Joining of Compacted Cells 1993 47 IPL Luby & Sinclair & Zuckerman, Optimal Speedup of Las Vegas Algorithms 1993 47 IPL Xu & Lau, Optimal Parameters for Load Balancing Using the Diffusion Method in k-ary n-Cube Networks 1993 47 IPL Yun & Choe & Han, Syntactic Error Repair Using Repair Patterns 1993 47 IPL Lin, Parallel Trace-driven Simulation of Packet-switched Multiplexer under Priority Scheduling Policy 1993 47 IPL Bax, Inclusion and Exclusion Algorithm for the Hamiltonian Path Problem 1993 47 IPL Bhattacharya & Bagchi, A Faster Alternative to SSS* with Extension to Variable Memory 1993 47 IPL Hirschberg & Seiden, A Bounded-Space Tree Traversal Algorithm 1993 47 IPL Katz & Sharir, Optimal Slope Selection via Expanders 1993 47 IPL Shin & Choe, An Improved LALR(k) Parser Generation for Regular Right Part Grammars 1993 47 IPL Durand & Salinier, Constructor Equivalent Term Rewriting Systems 1993 47 IPL Gopalakrishnan & Hoffman & Stinson, A Note on a Conjecture Concerning Symmetric Resilient Functions 1993 47 IPL Luchetti & Pinotti, Some Comments on Building Heaps in Parallel 1993 47 IPL Chang & Choe & Han, Efficient Bottom-Up Execution of Logic Programs Using Abstract Interpretation 1993 47 IPL Bright, Range-Restricted Mergeable Priority Queues 1993 47 IPL Steiner & Yeomans, A Note on ``Scheduling Unit-Time Tasks with Integer Release Times and Deadlines'' 1993 47 IPL Dassow & Paun & Salomaa, On the Union of 0L Languages 1993 47 IPL Nieuwenhuis, Simple LPO Constraint Solving Methods 1993 47 IPL Frederickson & Hambrusch & Tu, Shortest Path Computations in Source-Deplanarized Graphs 1993 47 IPL Tardos & Vazirani, Improved Bounds for the Max-Flow Min-Multicut Ratio for Planar K_{r,r}-free Graphs 1993 47 IPL Jain & Sharma, On the Non-existence of Maximal Inference Degrees for Language Identification 1993 47 IPL Yu & Yang, An O(n) Time Algorithm for Maximum Matching on Cographs 1993 47 IPL Hancart, On Simon's String Searching Algorithm 1993 47 IPL Lee & Henschen, Semantics and Properties of Existential Quantifiers in Deductive Databases 1993 47 IPL Park & Kim & Prasanna, An O(1) Time Optimal Algorithm for Multiplying Matrices on Reconfigurable Mesh 1993 47 IPL Toledo, Approximate Parametric Searching 1993 47 IPL Teia, A Lower Bound for Randomized List Update Algorithms 1993 47 IPL Crescenzi & Silvestri, A Note on the Descriptive Complexity of Maximization Problems 1993 47 IPL Owolabi, Efficient Pattern Searching over Large Dictionaries 1993 47 IPL Hershberger, A Faster Algorithm for the Two-Center Decision Problem 1993 47 IPL Meskes & Noack, The Generalized Supplementary Magic-Sets Transformation for Stratified Datalog 1993 47 IPL Chen & Tang, A 2|E|-bit Distributed Algorithm for the Directed Euler Trail Problem 1993 47 IPL Breslauer & Colussi & Toniolo, Tight Comparison Bounds for the String Prefix-Matching Problem 1993 46 IPL Krishnaprasad, Locality in Inheritance Networks 1993 46 IPL Hoffgen, Computational Limitations on Training Sigmoid Neural Networks 1993 46 IPL Chedid & Chedid, A New Variation on Hypercubes with Smaller Diameter 1993 46 IPL Middendorf, Minimum Broadcast Time is NP-Complete for 3-Regular Planar Graphs and Deadline 2 1993 46 IPL Bolognesi, Deriving Graphical Representations of Process Networks from Algebraic Expressions 1993 46 IPL Andersson & Nilsson, Improved Behavior of Tries by Adaptive Branching 1993 46 IPL Clarke & Draghicescu & Krushan, A Unified Approach for Showing Language Inclusion and Equivalence between Various Types of omega-Automata 1993 46 IPL Prodinger & Szpankowski, A Note on Binomial Recurrences Arising in the Analysis of Algorithms (Letter to the editor) 1993 46 IPL Bijlsma, Calculating with Procedure Calls 1993 46 IPL Stamoulis & Tsitsiklis, An Efficient Algorithm for Multiple Simultaneous Broadcasts in the Hypercube 1993 46 IPL Muller & Nicolai, Polynomial Time Algorithms for Hamiltonian Problems on Bipartite Distance-Hereditary Graphs 1993 46 IPL Chang & Du, Diamond Deque: A Simple Data Structure for Priority Deques 1993 46 IPL Schoning, On Random Reductions from Sparse Sets to Tally Sets 1993 46 IPL Wise, Stop-and-Copy and One-Bit Reference Counting 1993 46 IPL Kim & Lee & Lee, Analysis of Fuzzy Operators for High Quality Information Retrieval 1993 46 IPL Snyder, On the Complexity of Recursive Path Orderings 1993 46 IPL Crochemore & Gasieniec & Rytter, Two-dimensional Pattern Matching by Sampling 1993 46 IPL Kuncheva, Genetic Algorithm for Feature Selection for Parallel Classifiers 1993 46 IPL Halldorsson, Approximating the Minimum Maximal Independence Number 1993 46 IPL Mazurkiewicz, Distributed Disassembly of Mosaics 1993 46 IPL Demetrovics & Thi, Some Problems Concerning Keys for Relation Schemes and Relations in the Relational Datamodel 1993 46 IPL van Kreveld, The Power of Parallel Projection 1993 46 IPL Tsay, An Efficient Implementation of Priority Queues Using Fixed-sized Systolic Coprocessors 1993 46 IPL Chakraborty & Dastidar, Using Reliability Analysis to Estimate the Number of Generations to Convergence in Genetic Algorithms 1993 46 IPL Bianco & Blazewicz & Dell'Olmo & Drozdowski, Preemptive Scheduling of Multiprocessor Tasks on the Dedicated Processor System Subject to Minimal Lateness 1993 46 IPL Fischer & Goldberg & Haglin & Plotkin, Approximating Matchings in Parallel 1993 46 IPL Gavalda, A Positive Relativization of Polynomial Time versus Polylog Space 1993 46 IPL Chen & Hung, On the Quickest Path Problem 1993 46 IPL Liu & Chen & Lin, An Algorithm for Coalescing Operations with Precedence Constraints in Real-time Systems 1993 46 IPL Davis & Prieditis, The Expected Length of a Shortest Path 1993 46 IPL Latifi, On the Fault-Diameter of the Star Graph 1993 46 IPL Sato, Decidability for Some Problems of Linear Cellular Automata over Finite Commutative Rings 1993 46 IPL Fischetti & Landau & Schmidt & Sellers, Identifying Periodic Occurrences of a Template with Applications to Protein Structure (Corrigendum) 1993 46 IPL Ho-Stuart & Zedan & Fang, Congruent Weak Bisimulation with Dense Real-Time 1993 46 IPL Ohisuka, A Proof of the Substitution Lemma in de Bruijn's Notation 1993 46 IPL Hoory & Wigderson, Universal Traversal Sequences for Expander Graphs 1993 46 IPL Moffat & Zobel, Supporting Random Access in Files of Variable Length Records 1993 46 IPL Zelikovsky, A Faster Approximation Algorithm for the Steiner Tree Problem in Graphs 1993 46 IPL Wegener, Optimal Lower Bounds on the Depth of Polynomial-Size Threshold Circuits for Some Arithmetic Functions 1993 46 IPL Thangavel & Muthuswamy, Parallel Algorithms for Addition and Multiplication on Processor Arrays with Reconfigurable Bus Systems 1993 46 IPL Longpre & Mocas, Symmetry of Information and One-way Functions 1993 46 IPL Shen & Hu, A Note on Minimal Visibility Graphs 1993 46 IPL Makedon & Sheinwald & Wolfsthal, A Simple Linear-Time Algorithm for the Recognition of Bandwidth-2 Biconnected Graphs 1993 46 IPL Wu & Chen, The Towers of Hanoi Problem with Cyclic Parallel Moves 1993 46 IPL Yu & Tseng & Chang, Sequential and Parallel Algorithms for the Maximum-Weight Independent Set Problem on Permutation Graphs 1993 46 IPL Megson, Systolic Partitioning Algorithms 1993 46 IPL Lins, Generational Cyclic Reference Counting 1993 46 IPL Lai & Wei, The Edge Hamiltonian Path Problem is NP-complete for Bipartite Graphs 1993 46 IPL Yang, New Binary Sequences with Perfect Staircase Profile of Linear Complexity 1993 46 IPL Vaidyanathan & Hartmann & Varshney, Running ASCEND, DESCEND and PIPELINE Algorithms in Parallel Using Small Processors 1993 46 IPL Kobayashi, Sigma^0_n-complete Properties of Programs and Martin-Lof Randomness 1993 46 IPL Cha & Chung & Kwon, Complexity Measures for Concurrent Programs Based on Information-theoretic Metrics 1993 46 IPL Oh, An Analytical Evidence for Kale's Heuristic for the N Queens Problems 1993 45 IPL Wang & Belanger, Honest Iteration Schemes of Randomizing Algorithms 1993 45 IPL Cai, The Recognition of Union Trees 1993 45 IPL Gavril, An Efficiently Solvable Graph Partition Problem to which Many Problems are Reducible 1993 45 IPL Korsh, Counting and Randomly Generating Binary Trees 1993 45 IPL Schwabe, Constant-Slowdown Simulations of Normal Hypercube Algorithms on the Butterfly Network 1993 45 IPL Razborov & Wigderson, n^Omega(log n) Lower Bounds on the Size of Depth-3 Threshold Circuits with AND Gates at the Bottom 1993 45 IPL Chen & Hsieh, A Neural Sorting Network with O(1) Time Complexity 1993 45 IPL Gargano & Vaccaro & Vozella, Fault Tolerant Routing in the Star and Pancake Interconnection Networks 1993 45 IPL Ravindran & Gibbons, Dense Edge-disjoint Embedding of Complete Binary Trees in the Hypercube 1993 45 IPL Buro, On the Maximum Length of Huffman Codes 1993 45 IPL Cheung & Lau, A Lower Bound for Permutation Routing on Two-dimensional Bused Meshes 1993 45 IPL Spinrad, Doubly Lexical Ordering of Dense 0-1 Matrices 1993 45 IPL Hanschke & Wurtz, Satisfiability of the Smallest Binary Program 1993 45 IPL Bijlsma, Quasi-Boolean Equivalence 1993 45 IPL De Prisco & De Santis, On Binary Search Trees 1993 45 IPL Lu, Parallelizing Mallat Algorithm for 2-D Wavelet Transforms 1993 45 IPL Lee & Papadimitriou, The All-Pairs Quickest Path Problem 1993 45 IPL Dickerson & Shugart, A Simple Algorithm for Enumerating Longest Distances in the Plane 1993 45 IPL Raczunas, Remarks on the Equivalence of c-e Structures and Petri Nets 1993 45 IPL Ihler & Wagner & Wagner, Modeling Hypergraphs by Graphs with the Same Mincut Properties 1993 45 IPL Wang & Lin, On Constructing Multiple Spanning Trees in a Hypercube 1993 45 IPL Liang & Rhee, Finding a Maximum Matching in a Circular-Arc Graph 1993 45 IPL Analyti & Pramanik, Performance Analysis of a Main Memory Multi-directory Hashing Technique 1993 45 IPL Shen & Hu & Cong & Sudborough & Girou & Bettayeb, The 4-Star Graph Is Not a Subgraph of any Hypercube 1993 45 IPL Chor & Kushilevitz, A Communication-Privacy Tradeoff for Modular Addition 1993 45 IPL Rosenblueth, An Execution Mechanism for Nondeterministic, State-oriented Programs Based on a Chart Parser 1993 45 IPL Jiang, I/O- and CPU-optimal Recognition of Strongly Connected Components 1993 45 IPL Ranjan & Rus, A Tool for the Analysis of Manipulation 1993 45 IPL Day & Tripathi, Unidirectional Star Graphs 1993 45 IPL Chen & Lin, The Computational Complexity of Satisfiability of Temporal Horn Formulas in Propositional Linear-Time Temporal Logic 1993 45 IPL Merritt & Taubenfeld, Speeding Lamport's Fast Mutual Exclusion Algorithm 1993 45 IPL Liskiewicz, On the Relationship between Deterministic Time and Deterministic Reversal 1993 45 IPL Amato, Improved Processor Bounds for Parallel Algorithms for Weighted Directed Graphs 1993 45 IPL Hsu & Snodgrass, Optimal Block Size for Set-valued Attributes 1993 45 IPL Suraweera & Bhattacharya, An O(log m) Parallel Algorithm for the Minimum Spanning Tree Problem 1993 45 IPL Foster, The Generic Oracle Hypothesis is False 1993 45 IPL Cross & Drefenstedt & Keller, Reduction of Network Cost and Wiring in Ranade's Butterfly Routing 1993 45 IPL Chin, Permutations on the Block PRAM 1993 45 IPL Jifeng & Hoare, From Algebra to Operational Semantics 1993 45 IPL Pilarski & Kameda, Simple Bounds on the Convergence Rate of an Ergodic Markov Chain 1993 45 IPL Drewes, NP-completeness of k-connected Hyperedge-Replacement Languages of Order k 1993 45 IPL Bern, Approximate Closest-Point Queries in High Dimensions 1993 45 IPL Fischer & Moran & Taubenfeld, Space-efficient Asynchronous Consensus without Shared Memory Initialization 1993 45 IPL Kimbrel & Sinha, A Probabilistic Algorithm for Verifying Matrix Products Using O(n^2) Time and log_2 n + O(1) Random Bits 1993 45 IPL Palsberg, Normal Forms Have Partial Types 1993 45 IPL Dillenburg & Nelson, Improving the Efficiency of Depth-First Search by Cycle Elimination 1993 45 IPL Fischetti & Landau & Sellers & Schmidt, Identifying Periodic Occurrences of a Template with Applications to Protein Structure 1993 45 IPL Halldorsson, A Still Better Performance Guarantee for Approximate Graph Coloring 1993 45 IPL Lin & Chern, The Most Vital Edges in the Minimum Spanning Tree Problem 1993 45 IPL Kim & Chang & Kim, Multidisk Partial Match File Design with Known Access Pattern 1993 45 IPL Schoenmakers, A Systematic Analysis of Splaying 1993 45 IPL Baeza-Yates & Regnier, Fast Two-Dimensional Pattern Matching 1992 44 IPL Engelfriet, An Elementary Proof of Double Greibach Normal Form 1992 44 IPL Feige, On the Complexity of Finite Random Functions 1992 44 IPL Vishwanathan, An Approximation Algorithm for the Asymmetric Travelling Salesman Problem with Distances One and Two 1992 44 IPL Fortnow & Szegedy, On the Power of Two-local Random Reductions 1992 44 IPL Cohen & Scott, Rationality of Division Orderings 1992 44 IPL Pascoletti, An Optimal Algorithm for the Period of a Strongly Connected Digraph 1992 44 IPL Acharya & Badrinath, Recording Distributed Snapshots based on Causal Order of Message Delivery 1992 44 IPL Simonson & Sudborough, On the Complexity of Tree Embedding Problems 1992 44 IPL Leung, A Note on Finitely Ambiguous Distance Automata 1992 44 IPL Luo & Bochmann & Das & Wu, Failure-Equivalent Transformation of Transition Systems to Avoid Internal Actions 1992 44 IPL Breslauer, An On-line String Superprimitivity Test 1992 44 IPL Amir & Farach, Two-dimensional Dictionary Matching 1992 44 IPL Wu & Chen, The Towers of Hanoi Problem with Parallel Moves 1992 44 IPL Lin & Vitter, Approximation Algorithms for Geometric Median Problems 1992 44 IPL Bar-Noy & Motwani & Naor, The Greedy Algorithm is Optimal for On-line Edge Coloring 1992 44 IPL d'Amore & Franciosa, On the Optimal Binary Plane Partition for Sets of Isothetic Rectangles 1992 44 IPL Overmars, Point Location in Fat Subdivisions 1992 44 IPL Rossmanith & Rytter, Observations on log(n) Time Parallel Recognition of Unambiguous cfl's 1992 44 IPL Gupta, Dynamic Parallel Evaluation of the Cross-product Set Using Time-stamps 1992 44 IPL Greenberg & Ja'Ja' & Krishnamurthy, On the Difficulty of Manhattan Channel Routing 1992 44 IPL Dekel & Hu & Ouyang, An Optimal Algorithm for Finding Compact Sets 1992 44 IPL Dalal & Etherington, A Hierarchy of Tractable Satisfiability Problems 1992 44 IPL Zhang, The Pre-NTS Property is Undecidable for Context-free Grammars 1992 44 IPL Wang & Yuan, Preservation of Integrity Constraints in Definite DATALOG Programs 1992 44 IPL Jiang & Li & Du, A Note on Shortest Superstrings with Flipping 1992 44 IPL Chang & Chung, Fault-tolerant Routing in Unique-Path Multistage Omega Network 1992 44 IPL Gupta, On the Closure of Certain Function Classes under Integer Division by Polynomially-bounded Functions 1992 44 IPL Tamura & Tamura, Degree Constrained Tree Embedding into Points in the Plane 1992 44 IPL Lins, Cyclic Reference Counting with Lazy Mark-Scan 1992 44 IPL Martello & Toth, A Note on 0.5-bounded Greedy Algorithms for the 0/1 Knapsack Problem 1992 44 IPL Shvartsman, An Efficient Write-All Algorithm for Fail-Stop PRAM without Initialized Memory 1992 44 IPL Cadoli, The Complexity of Model Checking for Circumscriptive Formulae 1992 44 IPL Bovet & Varricchio, On the Regularity of Languages on a Binary Alphabet Generated by Copying Systems 1992 44 IPL Makinen, Remarks on the Structural Grammatical Inference Problem for Context-free Grammars 1992 44 IPL Lobo & Subrahmanian, Relating Minimal Models and Pre-requisite-free Normal Defaults 1992 44 IPL Lu & Henschen, The Completeness of gp-Resolution for Annotated Logics 1992 44 IPL Han & Narahari & Choi, Mapping a Chain Task to Chained Processors 1992 44 IPL Pan & Sadikou & Landowne, Polynomial Division with a Remainder by Means of Evaluation and Interpolation 1992 44 IPL Ghosh & Maheshwari, An Optimal Parallel Algorithm for Computing Furthest Neighbors in a Tree 1992 44 IPL Woeginger, The Complexity of Finding Arborescences in Hypergraphs 1992 44 IPL Bainbridge, A Heuristic Method for Generating Large Random Expressions 1992 44 IPL Pachl, A Simple Proof of a Completeness Result for leads-to in the UNITY Logic (Corrigendum) 1992 44 IPL Bousquet-Melou, The Number of Minimal Word Chains Computing the Thue-Morse Word 1992 44 IPL Gastin & Ochmanski & Petit & Rozoy, Decidability of the Star Problem in A* x {b}* 1992 44 IPL De Iaco & Luccio, Finding All the Palindromes in a Binary Tree in Linear Time and Space 1992 44 IPL Kao & Wan, Not All Planar Digraphs Have Small Cycle Separators 1992 44 IPL Morii & Kasahara, Perfect Staircase Profile of Linear Complexity for Finite Sequences 1992 44 IPL Chen & Hou, Non-associative Parallel Prefix Computation 1992 44 IPL Mukhopadhyaya & Sinha, Hamiltonian Graphs with Minimum Number of Edges for Fault-Tolerant Topologies 1992 44 IPL Teo & Tuan, An Efficient One-Side Height Minimization Algorithm for Routing around a Rectangle 1992 44 IPL Chien & Yang, The Worst Case Analysis of Algorithm on Multiple Stacks Manipulation 1992 44 IPL Chung, Indexed Extendible Hashing 1992 44 IPL Masuyama & Naito, Deciding Whether Graph G Has Page Number One is in NC 1992 44 IPL Paschos, A (Delta/2)-Approximation Algorithm for the Maximum Independent Set Problem 1992 44 IPL Yu & Yang, An Optimal Parallel Algorithm for the Domatic Partition Problem on an Interval Graph Given its Sorted Model 1992 44 IPL Hammer & Kogan, Horn Functions and their DNFs 1992 44 IPL Hwang, Efficient ID-Based Key Distribution with Tamperfree Devices 1992 44 IPL Kapur & Bilardi, On Uniform Learnability of Language Families 1992 44 IPL Garg, Some Optimal Algorithms for Decomposed Partially Ordered Sets 1992 44 IPL Veeraraghavulu & Kumar & Madhavan, A Linear-Time Algorithm for Isomorphism of a Subclass of Chordal Graphs 1992 44 IPL Sharary & Zaguia, On a Setup Optimization Problem for Interval Orders 1992 43 IPL Jerebic & Trobec, Optimal Routing in Toroidal Networks 1992 43 IPL Chang & Wang, Efficient Algorithms for the Maximum Weight Clique and Maximum Weight Independent Set Problems on Permutation Graphs 1992 43 IPL Peng & Chang, A Simple Linear Time Algorithm for the Domatic Partition Problem on Strongly Chordal Graphs 1992 43 IPL Scholefield & Zedan, Weakest Precondition Semantics for Time and Concurrency 1992 43 IPL Albacea, A Parallel Algorithm for Edge-Coloring of Graphs with Edge-Disjoint Cycles 1992 43 IPL Kim & Kim, A Mean Value Analysis of the Ethernet Throughput 1992 43 IPL Wang, A Note on Two-way Probabilistic Automata 1992 43 IPL Chen & Yu & Yamaguchi & Kitagawa & Ohbo & Fujiwara, Decomposition -- An Approach for Optimizing Queries Including ADT Functions 1992 43 IPL Hagerup, On a Compaction Theorem of Ragde 1992 43 IPL Hsiao & Tang & Chang, An Efficient Algorithm for Finding a Maximum Weight 2-Independent Set on Interval Graphs 1992 43 IPL Schwabe, Embedding Meshes of Trees into deBruijn Graphs 1992 43 IPL Dawes, Some Pursuit-Evasion Problems on Grids 1992 43 IPL Satyanarayanan & Muthukrishnan, A Note on Raymond's Tree Based Algorithm for Distributed Mutual Exclusion 1992 43 IPL Czech & Havas & Majewski, An Optimal Algorithm for Generating Minimal Perfect Hash Functions 1992 43 IPL Pombortsis, Analysis of Hierarchical Bus-Based Multicomputer Architectures 1992 43 IPL Ressler, Random List Permutations in Place 1992 43 IPL van Vliet, An Improved Lower Bound for On-line Bin Packing Algorithms 1992 43 IPL Gemmell & Sudan, Highly Resilient Correctors for Polynomials 1992 43 IPL Palsberg & Schwartzbach, Safety Analysis versus Type Inference for Partial Types 1992 43 IPL Kolountzakis & Kutulakos, Fast Computation of the Euclidean Distance Maps for Binary Images 1992 43 IPL Birget, Intersection and Union of Regular Languages and State Complexity 1992 43 IPL Chen, A Fast and Efficient Parallel Algorithm for Finding a Satisfying Truth Assignment to a 2-CNF Formula 1992 43 IPL Takaoka, A New Upper Bound on the Complexity of the All Pairs Shortest Path Problem 1992 43 IPL Greenberg & Maley, Minimum Separation for Single-Layer Channel Routing 1992 43 IPL Allison, Lazy Dynamic-Programming Can Be Eager 1992 43 IPL Bagchi, On Sorting in the Presence of Erroneous Information 1992 43 IPL Huttenlocher & Kedem & Kleinberg, Voronoi Diagrams of Rigidly Moving Sets of Points 1992 43 IPL Inoue & Ito & Takanami, A Relationship between Nondeterministic Turing Machines and 1-Inkdot Turing Machines with Small Space 1992 43 IPL de Moor, Inductive Data Types for Predicate Transformers 1992 43 IPL Saluja & Subrahmanyam, On the Power of Enumerative Counting 1992 43 IPL Woeginger, Finding the Closest Extreme Vertex to a Fixed Point 1992 43 IPL Liu & Kim, An Efficient Parallel Sorting Algorithm 1992 43 IPL Henzinger, Sooner is Safer than Later 1992 43 IPL Galiev & Polupanov & Shparlinski, Distances from Differences of Roots of Polynomials to the Nearest Integers 1992 43 IPL Penczek, On Undecidability of Propositional Temporal Logics on Trace Systems 1992 43 IPL Boreale & Inverardi & Nesi, Complete Sets of Axioms for Finite Basic LOTOS Behavioural Equivalences 1992 43 IPL Dimitrov & Cooklev & Donevsky, On the Multiplication of Reduced Biquaternions and Applications 1992 43 IPL Kim & Choe, Yet Another Efficient Backward Execution Algorithm in the AND / OR Process Model (Corrigenda) 1992 43 IPL Szymanski & Sinharoy, Complexity of the Closest Vector Problem in a Lattice Generated by (0,1)-Matrix (Corrigenda) 1992 43 IPL Martelli & Tricomi, A New SLDNF-Tree 1992 43 IPL Chee & Lim, The Algorithmic Complexity of Colour Switching 1992 43 IPL Hsu & Lee & Chang, Special Subgraphs of Weighted Visibility Graphs 1992 43 IPL Hsu & Huang, A Self-Stabilizing Algorithm for Maximal Matching 1992 43 IPL Hwang, Attacks on Okamoto and Tanaka's One-Way ID-Based Key Distribution System 1992 43 IPL Sen & Deng & Guha, On a Graph Partition Problem with Application to VLSI Layout 1992 43 IPL Majster-Cederbaum, Ensuring the Existence of a BCNF-Decomposition that Preserves Functional Dependencies in O(N^2) Time 1992 43 IPL Cheung & Lau, Mesh Permutation Routing with Locality 1992 43 IPL Li & Vitanyi, Optimality of Wait-free Atomic Multiwriter Variables 1992 43 IPL Saluja, A Note on the Permanent Value Problem 1992 43 IPL Bern & Gilbert, Drawing the Planar Dual 1992 43 IPL Chandra, Does Randomization Help in On-line Bin Packing? 1992 43 IPL Bachmair, Associative-Commutative Reduction Orderings 1992 43 IPL Schirra, Approximate Decision Algorithms for Approximate Congruence 1992 43 IPL Kern, Learning Convex Bodies under Uniform Distribution 1992 43 IPL Tsai, An Algorithm for Flow Time Minimization and Its Asymptotic Makespan Properties 1992 43 IPL Singhal & Kshemkalyani, An Efficient Implementation of Vector Clocks 1992 43 IPL Koutsoupias & Papadimitriou, On the Greedy Algorithm for Satisfiability 1992 42 IPL Manacher & Mankus, Incorporating Negative-Weight Vertices in Certain Vertex-Search Graph Algorithms 1992 42 IPL Miltersen, Circuit Depth Relative to a Random Oracle 1992 42 IPL Woeginger & Yu, On the Equal-Subset-Sum Problem 1992 42 IPL Zhu, Computing the Shortest Diagonal of a Monotone Polygon in Linear Time 1992 42 IPL Dahlhaus & Karpinski & Kelsen, An Efficient Parallel Algorithm for Computing a Maximal Independent Set in a Hypergraph of Dimension 3 1992 42 IPL Stein & Wein, Approximating the Minimum-Cost Maximum Flow is P-Complete 1992 42 IPL Khuller & Schieber, On Independent Spanning Trees 1992 42 IPL Morita, Computation-Universality of One-Dimensional One-Way Reversible Cellular Automata 1992 42 IPL Brogi & Ciampolini & Lamma & Mello, The Implementation of a Distributed Model for Logic Programming Based on Multiple-headed Clauses 1992 42 IPL Goles & Martinez, Automata Networks and Optimization 1992 42 IPL Kinnersley, The Vertex Separation Number of a Graph Equals its Path-Width 1992 42 IPL Day & Tripathi, Arrangement Graphs: A Class of Generalized Star Graphs 1992 42 IPL Chen, A Simple Parallel Algorithm for Computing the Diameters of all Vertices in a Tree and its Application 1992 42 IPL Goldberg, A Natural Randomization Strategy for Multicommodity Flow and Related Algorithms 1992 42 IPL Wismath, Computing the Full Visibility Graph of a Set of Line Segments 1992 42 IPL Han, Binding Propagation Beyond the Reach of Rule / Goal Graphs 1992 42 IPL Litow, On Iterated Integer Product 1992 42 IPL Wrightson & Coldwell, A Truncation Technique for Clausal Analytic Tableaux 1992 42 IPL Singh, Expected Connectivity and Leader Election in Unreliable Networks 1992 42 IPL Cameron & Wood, A Note on the Path Length of Red-Black Trees 1992 42 IPL Hwang, Protocols for Group Oriented Secret Sharing 1992 42 IPL Blum, Rank-r Decision Trees are a Subclass of r-Decision Lists 1992 42 IPL Aykanat & Ozguner, A Fault-Tolerant Hexagonal Systolic Array 1992 42 IPL Chen, Optimal Parallel Time Bounds for the Maximum Clique Problem on Intervals 1992 42 IPL Vaidyanathan, Sorting on PRAMs with Reconfigurable Buses 1992 42 IPL Liu & You, An Implementation of a Nonlinear Skewing Scheme 1992 42 IPL Vaidyanathan & Hartmann & Varshney, PRAMs with Variable Word-Size 1992 42 IPL Colbourn & Stinson & Teirlinck, A Parallelization of Miller's n^log n Isomorphism Technique 1992 42 IPL Sprague & Kulkarni, Optimal Parallel Algorithms for Finding Cut Vertices and Bridges of Interval Graphs 1992 42 IPL Szymanski & Sinharoy, Complexity of the Closest Vector Problem in a Lattice Generated by (0,1)-Matrix 1992 42 IPL Huy & Livotsky & Long Van, Which Finite Monoids are Syntactic Monoids of Rational omega-Languages 1992 42 IPL Zhang & Statman & Shasha, On the Editing Distance between Unordered Labeled Trees 1992 42 IPL Parker & Hamblen, Optimal Value for the Newton-Raphson Division Algorithm 1992 42 IPL Li & Vitanyi, Average Case Complexity under the Universal Distribution Equals Worst-Case Complexity 1992 42 IPL Salowe, A Note on Lower Bounds for Rectilinear Steiner Trees 1992 42 IPL Bui & Jones, Finding Good Approximate Vertex and Edge Partitions is NP-Hard 1992 42 IPL Mowbray, Finitary Logics for Some CCS Observational Bisimulations 1992 42 IPL Groote, A Short Proof of the Decidability of Bisimulation for Normed BPA-Processes 1992 42 IPL Sarkar & Chakrabarti & Ghose & De Sarkar, A Simple 0.5-Bounded Greedy Algorithm for the 0/1 Knapsack Problem 1992 42 IPL Han & Lin, Scheduling Real-time Computations with Separation Constraints 1992 42 IPL Trier, Additive Weights of a Special Class of Nonuniformly Distributed Backtrack Trees 1992 42 IPL Rubinfeld, Batch Checking with Applications to Linear Functions 1992 42 IPL Burmester, An Almost-Constant Round Interactive Zero-Knowledge Proof 1992 42 IPL Cho & Huynh, The Parallel Complexity of Coarsest Set Partition Problems 1992 42 IPL Plateau & Trystam, Optimal Total Exchange for a 3-D Torus of Processors 1992 42 IPL Van De Snepscheut, A LISP Programming Exercise 1992 42 IPL Chandru & Hooker, Detecting Embedded Horn Structure in Propositional Logic 1992 42 IPL Kamakoti & Rangan, An Optimal Algorithm for Reconstructing a Binary Tree 1992 42 IPL Gabrani & Shankar, A Note on the Reconstruction of a Binary Tree from its Traversals 1992 42 IPL Makinen, On the Structural Grammatical Inference Problem for Some Classes of Context-free Grammars 1992 42 IPL Singh, Towards an Understanding of Unbounded Variables in Asynchronous Systems 1992 42 IPL Clark & Shahrokhi & Szekely, A Linear Time Algorithm for Graph Partition Problems 1992 42 IPL Alt & Geffert & Mehlhorn, A Lower Bound for the Nondeterministic Space Complexity of Context-free Recognition 1992 42 IPL Fleischner & Woeginger, Detecting Cycles through Three Fixed Vertices in a Graph 1992 42 IPL Meijer & Rappaport, Computing the Minimum Weight Triangulation of a Set of Linearly Ordered Points 1992 42 IPL Sen & Sengupta & Bandyopadhyay, On the Routing Problem in Faulty Supercubes 1992 42 IPL Sarkar & Chakrabarti & Ghose & De Sarkar, Effective Use of Memory in Iterative Deepening Search 1992 42 IPL Megiddo, A Note on Approximate Linear Programming 1992 42 IPL Aggarwal & Edelsbrunner & Raghavan & Tiwari, Optimal Time Bounds for Some Proximity Problems in the Plane 1992 41 IPL Clausen, Almost All Boolean Functions Have No Linear Symmetries 1992 41 IPL Muller, Confluence of the Lambda Calculus with Left-Linear Algebraic Rewriting 1992 41 IPL Erbas & Tanik & Aliyazicioglu, Linear Congruence Equations for the Solutions of the N-Queens Problem 1992 41 IPL Miller, Generating Hinges from Arbitrary Subhypergraphs 1992 41 IPL Esparza, A Solution to the Covering Problem for 1-Bounded Conflict-free Petri Nets Using Linear Programming 1992 41 IPL Bshouty, A Lower Bound for the Multiplication of Polynomials Modulo a Polynomial 1992 41 IPL Lozinskii, Counting Propositional Models 1992 41 IPL Jansen, An Approximation Algorithm for the General Routing Problem 1992 41 IPL Carson & Nirkhe & Vongsathorn, A Discrete-State Model of the Two-headed Disk 1992 41 IPL Brandt & Cabrelli & Molter, An Algorithm for the Computation of the Hutchinson Distance (Corrigendum) 1992 41 IPL Regan, Diagonalization, Uniformity, and Fixed-Point Theorems 1992 41 IPL Eppstein, Parallel Recognition of Series-Parallel Graphs 1992 41 IPL Papantoni-Kazakos & Kazakos & Birmiwal, Predictive Analog-to-Digital Conversion for Resistance to Data Outliers 1992 41 IPL Panangaden & Shanbhogue, The Expressive Power of Indeterminate Dataflow Primitives 1992 41 IPL Wiseman, New Binary Codes from a Generalization of Zinoviev's Technique 1992 41 IPL Shoudai, A P-Complete Language Describable with Iterated Shuffle 1992 41 IPL Whaley, Alternative Developments of Cyclic-Permutation Algorithms 1992 41 IPL Wang, An Improved Parallel Algorithm for Computing the Generalized Inverse A^+ 1992 41 IPL Rivin & Zabih, A Dynamic Programming Solution to the n-Queens Problem 1992 41 IPL Narayanaswami & Franklin, Edge Intersection on the Hypercube Computer 1992 41 IPL Ko & Ruskey, Generating Permutations of a Bag by Interchanges 1992 41 IPL Urrutia & Gavril, An Algorithm for Fraternal Orientation of Graphs 1992 41 IPL Blazewicz & Dell'Olmo & Drozdowski & Speranza, Scheduling Multiprocessor Tasks on Three Dedicated Processors 1992 41 IPL Dam, R-Generability, and Definability in Branching Time Logics 1992 41 IPL Myoupo, Dynamic Programming on Linear Pipelines (Corrigenda) 1992 41 IPL Szalas, Axiomatizing Fixpoint Logics 1992 41 IPL Gusfield & Landau & Schieber, An Efficient Algorithm for the All Pairs Suffix-Prefix Problem 1992 41 IPL Wu & Tang, Solving the Satisfiability Problem by Using Randomized Approach 1992 41 IPL Rote & Woeginger, Counting Convex k-gons in Planar Point Sets 1992 41 IPL Kamin, Head-strictness is not a Monotonic Abstract Property 1992 41 IPL Buss, The Graph of Multiplication is Equivalent to Counting 1992 41 IPL Radhakrishnan, Improved Bounds for Covering Complete Uniform Hypergraphs 1992 41 IPL Hoover & Poole, A Distributed Self-stabilizing Solution to the Dining Philosophers Problem 1992 41 IPL Arvind & Regan, Connected Domination and Steiner Set on Weighted Permutation Graphs 1992 41 IPL Goldmann & Hastad, A Simple Lower Bound for Monotone Clique Using a Communication Game 1992 41 IPL Ma & Narahari & Tao, Optimal Embedding of 2-D Torus into Ring 1992 41 IPL Gemignani, Fast Inversion of Hankel and Toeplitz Matrices 1992 41 IPL Kirchherr, Kolmogorov Complexity and Random Graphs 1992 41 IPL Misra & Gries, A Constructive Proof of Vizing's Theorem 1992 41 IPL Shermer, A Linear Algorithm for Bisecting a Polygon 1992 41 IPL Esselink, The Order of Appel's Algorithm 1992 41 IPL Aggarwal, Parallel Complexity of Computing a Maximal Set of Disjoint Paths 1992 41 IPL Rajcani, Optimal Parallel 3-Coloring Algorithm for Rooted Trees and its Applications 1992 41 IPL Verma, Strings, Trees, and Patterns 1992 41 IPL Larsen & Schwartzbach & Schmidt, A New Formalism for Relational Algebra 1992 41 IPL Wada & Luo & Kawaguchi, Optimal Fault-Tolerant Routings for Connected Graphs 1992 41 IPL Kobuchi, Order of State Functions and Logic Functions 1992 41 IPL Pavlu, On Efficient Implementation of LR-Attributed Grammars 1992 41 IPL Adams, On Immunity against Biham and Shamir's ``Differential Cryptanalysis'' 1992 41 IPL Von Zur Gathen, Processor-efficient Exponentiation in Finite Fields 1992 41 IPL Leermakers, A Recursive Ascent Earley Parser 1992 41 IPL Yao, Finding Approximate Solutions to NP-Hard Problems by Neural Networks is Hard 1992 41 IPL Chang & Lee, Finding a Maximum Set of Independent Chords in a Circle 1992 41 IPL Aurenhammer & Stockl, Searching for Segments with Largest Relative Overlap 1992 41 IPL Huang & Chen, A Self-Stabilizing Algorithm for Constructing Breadth-First Trees 1992 41 IPL Battista & Tamassia & Tollis, Constrained Visibility Representations of Graphs 1992 41 IPL Jacob, A Model of Reconfiguration in Communicating Sequential Processes with a Notion of Transactions 1992 41 IPL Ancona & Fassino & Gianuzzi, Optimization of LR(k) ``Reduced Parsers'' 1992 41 IPL Atkinson & Sack, Generating Binary Trees at Random 1992 41 IPL Stotts & Godfrey, Place/Transition Nets with Debit Arcs 1992 41 IPL Pachl, A Simple Proof of a Completeness Result for leads-to in the UNITY Logic 1992 41 IPL Chen & Das, Breadth-first Traversal of Trees and Integer Sorting in Parallel 1992 41 IPL Srimani & Reddy, Another Distributed Algorithm for Multiple Entries to a Critical Section 1992 41 IPL Misra, Phase Synchronization (Corrigenda) 1991 40 IPL Bartha & Gombas, A Structure Theorem for Maximum Internal Matchings in Graphs 1991 40 IPL Yang, Reducing Conflict Resolution Time for Solving Graph Problems in Broadcast Communications 1991 40 IPL Barsi, Mod m Arithmetic in Binary Systems 1991 40 IPL Kumar & Cheung, A High Availability sqrt(N) Hierarchical Grid Algorithm for Replicated Data 1991 40 IPL Allison & Dix & Yee, Shortest Path and Closure Algorithms for Banded Matrices 1991 40 IPL Shen & Reingold, Scheduling on a Hypercube 1991 40 IPL Chu, Evaluating Clustering Factor Approach to Estimating Block Selectivities 1991 40 IPL Ghosh & Mahanti, Bidirectional Heuristic Search with Limited Resources 1991 40 IPL Ercal, Distributed Evaluation of an Iterative Function for All Object Pairs on an SIMD Hypercube 1991 40 IPL Pettersson, Comments on ``Always-True Is Not Invariant'': Assertional Reasoning about Invariance 1991 40 IPL Domingo-Ferrer, Distributed User Identification by Zero-Knowledge Access Rights Proving 1991 40 IPL Chen, A Randomized NC Algorithm for the Maximal Tree Cover Problem 1991 40 IPL Park, A Special Case of the n-Vertex Traveling-Salesman Problem That Can Be Solved in O(n) Time 1991 40 IPL Grossi, Further Comments on the Subtree Isomorphism for Ordered Trees 1991 40 IPL Mahapatra & Pareek, Modelling a Fast Parallel Thinning Algorithm for Shared Memory SIMD Computers 1991 40 IPL Stewart, Complete Problems for Symmetric Logspace Involving Free Groups 1991 40 IPL Chaochen & Hoare & Ravn, A Calculus of Durations 1991 40 IPL Guha & Sen, Expected Time Analysis of Interpolation Merge -- A Simple New Merging Algorithm 1991 40 IPL Hsiao & Tang & Chang, Solving the Single Step Graph Searching Problem by Solving the Maximum Two-Independent Set Problem 1991 40 IPL Uhlmann, Satisfying General Proximity / Similarity Queries with Metric Trees 1991 40 IPL Gonzalez, Covering a Set of Points in Multidimensional Space 1991 40 IPL Halperin & Sharir, On Disjoint Concave Chains in Arrangements of (Pseudo) Lines 1991 40 IPL Jiang, DFS-Traversing Graphs in a Paging Environment, LRU or MRU? 1991 40 IPL Ronn, On the Logarithmic Evaluation of Recurrence Relations 1991 40 IPL Kim & Choe, Yet Another Efficient Backward Execution Algorithm in the AND / OR Process Model 1991 40 IPL Massart, An Agent Calculus with Simple Actions where the Enabling and Disabling are Derived Operators 1991 40 IPL Cherief & Schnoebelen, tau-Bisimulations and Full Abstraction for Refinement of Actions 1991 40 IPL Lin, Fast Algorithms for Lowest Common Ancestors on a Processor Array with Reconfigurable Buses 1991 40 IPL Aggarwal & Raghavan, Deferred Data Structure for the Nearest Neighbor Problem 1991 40 IPL Hsu & Tsai, Linear Time Algorithms on Circular-Arc Graphs 1991 40 IPL Boyd & Ural, The Synchronization Problem in Protocol Testing and its Complexity 1991 40 IPL Mehta & Mukherjee & Nagy, Constrained Integer Approximation to Planar Line Intersection 1991 40 IPL Abadi & Alpern & Apt & Francez & Katz & Lamport & Schneider, Preserving Liveness: Comments on ``Safety and Liveness from a Methodological Point of View'' 1991 40 IPL Dederichs & Weber, Reply to the Comments by M. Abadi et al. 1991 40 IPL Chen & Tang, Computing the Optimal IO Sequences of a Protocol in Polynomial Time 1991 40 IPL Brewster & MacGillivray, A Note on Restricted H-Colouring 1991 40 IPL Ghosh, Binary Self-Stabilization in Distributed Systems 1991 40 IPL Wein, Las Vegas RNC Algorithms for Unary Weighted Perfect Matching and T-Join Problems 1991 40 IPL Pelc, Broadcasting in Complete Networks with Faulty Nodes Using Unreliable Calls 1991 40 IPL Janardan, On the Dynamic Maintenance of Maximal Points in the Plane 1991 40 IPL Yodaiken, Modal Functions for Concise Definition of State Machines and Products 1991 40 IPL Bonnier & Nilsson & Naslund, A Simple Fixed Point Characterization of Three-valued Stable Model Semantics 1991 40 IPL Pan & Reif, The Parallel Computation of Minimum Cost Paths in Graphs by Stream Contraction 1991 40 IPL Yang, New Enumeration Results about the Optical Orthogonal Codes 1991 40 IPL Allender & Gore, Rudimentary Reductions Revisited 1991 40 IPL Subramaniyam & Diwan, A Counterexample for the Sufficiency of Edge Guards in Star Polygons 1991 40 IPL Wang, On the Complexity of the Extreme Points Decision Problem 1991 40 IPL Chang, Single Step Graph Search Problem 1991 40 IPL Brandt & Cabrelli & Molter, An Algorithm for the Computation of the Hutchinson Distance 1991 40 IPL Crescenzi & Fiorini & Silvestri, A Note on the Approximation of the MAX CLIQUE Problem 1991 40 IPL Heckmann, Lower and Upper Power Domain Constructions Commute on all cpos 1991 40 IPL Huang & Huang, Complexity of the Repeaters Allocating Problem 1991 40 IPL Diekert & Book, On ``Inherently Context-sensitive'' Languages -- An Application of Complexity Cores 1991 40 IPL Jiang & Ravikumar, A Note on the Space Complexity of Some Decision Problems for Finite Automata 1991 40 IPL Pinotti & Pucci, Parallel Priority Queues 1991 40 IPL Shermer, A Counterexample to the Algorithms for Determining Opaque Minimal Forests 1991 40 IPL Blair & Lloyd, The Benefits of External Wires in Single Row Routing 1991 40 IPL Hesselink, Repetitions, Known or Unknown? 1991 39 IPL von Stengel, An Algebraic Characterization of Semantic Independence 1991 39 IPL Crippa, A Special Case of the Dynamization Problem for Least Cost Paths 1991 39 IPL Chen, Characterizing Parallel Hierarchies by Reducibilities 1991 39 IPL Howell, The Complexity of Problems Involving Structurally Bounded and Conservative Petri Nets 1991 39 IPL Baeza-Yates, Height Balance Distribution of Search Trees 1991 39 IPL Bijlsma, Derivation of Logic Programs by Functional Methods 1991 39 IPL Myoupo, Dynamic Programming on Linear Pipelines 1991 39 IPL Raynal & Schiper & Toueg, The Causal Ordering Abstraction and a Simple Way to Implement It 1991 39 IPL Schweikard, Trigonometric Polynomials with Simple Roots 1991 39 IPL Parekh, Analysis of a Greedy Heuristic for Finding Small Dominating Sets in Graphs 1991 39 IPL Tucci & Costagliola & Chang, A Remark on NP-Completeness of Picture Matching 1991 39 IPL Kavadias & Kirousis & Spirakis, The Complexity of the Reliable Connectivity Problem 1991 39 IPL Ragde, Analysis of an Asynchronous PRAM Algorithm 1991 39 IPL Rao & Provence, An Integrated Approach to Routing and Via Minimization 1991 39 IPL van de Snepscheut, Inversion of a Recursive Tree Traversal 1991 39 IPL Bron & Hesselink, Smoothsort Revisited 1991 39 IPL Hsu & Jan & Lee & Hung & Chern, Finding the Most Vital Edge with Respect to Minimum Spanning Tree in Weighted Graphs 1991 39 IPL Yang & Lee, A Sound and Complete Query Evaluation for Implicit Predicate which is a Semantic Descriptor of Unknown Values 1991 39 IPL Sen, Some Observations on Skip-lists 1991 39 IPL Motoki, Inductive Inference from All Positive and Some Negative Data 1991 39 IPL Matousek, Randomized Optimal Algorithm for Slope Selection 1991 39 IPL van Baronaigien, A Loopless Algorithm for Generating Binary Tree Sequences 1991 39 IPL Carlsson & Chen, An Optimal Parallel Adaptive Sorting Algorithm 1991 39 IPL Turau, Fixed-Radius Near Neighbors Search 1991 39 IPL Levcopoulos & Petersson, Splitsort--An Adaptive Sorting Algorithm 1991 39 IPL Morris & Wong, Systematic Choice of Initial Points in Local Search: Extensions and Application to Neural Networks 1991 39 IPL Hofmeister & Hohberg & Kohling, Some Notes on Threshold Circuits, and Multiplication in Depth 4 1991 39 IPL Spinrad, Finding Largest Holes 1991 39 IPL Fraigniaud & Peyrat, Broadcasting in a Hypercube When Some Calls Fail 1991 39 IPL Keil, A Simple Algorithm for Determining the Envelope of a Set of Lines 1991 39 IPL Qiu & Meijer & Akl, Decomposing a Star Graph into Disjoint Cycles 1991 39 IPL Huang & Langston, Stable Set and Multiset Operations in Optimal Time and Space 1991 39 IPL Simon, The Vapnik-Chervonenkis Dimension of Decision Trees with Bounded Rank 1991 39 IPL Ragde & Wigderson, Linear-size Constant-depth Polylog-threshold Circuits 1991 39 IPL Chen & Yu & Huang, A Self-Stabilizing Algorithm for Constructing Spanning Trees 1991 39 IPL Heffernan, The Translation Square Map and Approximate Congruence 1991 39 IPL Jeffs, Order Independent NCE Grammars Recognized in Polynomial Time 1991 39 IPL Garg & Ahson & Gupta, A Fuzzy Petri Net for Knowledge Representation and Reasoning 1991 39 IPL Shvartsman, Achieving Optimal CRCW PRAM Fault-Tolerance 1991 39 IPL Newman, Private vs. Common Random Bits in Communication Complexity 1991 39 IPL Omondi, Fast One's-Complement Multiplication 1991 39 IPL Grossi, A Note on the Subtree Isomorphism for Ordered Trees and Related Problems 1991 39 IPL Irani & Rubinfeld, A Competitive 2-Server Algorithm 1991 39 IPL Sheu, Fault-Tolerant Parallel k Selection Algorithm in n-Cube Networks 1991 39 IPL Bataineh & Ozguner & Sarwal, Parallel Boolean Operations for Information Retrieval 1991 39 IPL Fantechi & Gnesi & Ristori, Compositionality and Bisimulation: A Negative Result 1991 39 IPL Nieuwenhuis & Nivela, Efficient Deduction in Equality Horn Logic by Horn-Completion 1991 39 IPL Book, On Random Oracle Separations 1991 39 IPL Charron-Bost, Concerning the Size of Logical Clocks in Distributed Systems 1991 39 IPL Apostolico & Farach & Iliopoulos, Optimal Superprimitivity Testing for Strings 1991 39 IPL Chen & Cox & Mishra, An NL Hierarchy 1991 39 IPL Olsson & Huang, Axiomatic Semantics for ``escape'' Statements 1991 39 IPL Tamassia & Tollis & Vitter, Lower Bounds for Planar Orthogonal Drawings of Graphs 1991 39 IPL Stohr, Broadcasting in the Butterfly Network 1991 39 IPL Sistla, Proving Correctness with Respect to Nondeterministic Safety Specifications 1991 39 IPL Luccio & Pagli, An Efficient Algorithm for Some Tree Matching Problems 1991 38 IPL Danzig, A Cooperative Game with Applications to Computer Networks 1991 38 IPL Preparata, Inverting a Vandermonde Matrix in Minimum Parallel Time 1991 38 IPL Kennedy, Parallel Cardinality Stacks and an Aplication 1991 38 IPL Irani, Two Results on the List Update Problem 1991 38 IPL Luo & Klostermeyer & Chow & Newman-Wolfe, Optimal Deadlock Resolutions in Edge-disjoint Reducible Wait-for Graphs 1991 38 IPL Latifi, Distributed Subcube Identification Algorithms for Reliable Hypercubes 1991 38 IPL Nawrocki, Conflict Detection and Resolution in a Lexical Analyzer Generator 1991 38 IPL Herley, A Note on the Token Distribution Problem 1991 38 IPL Zuckerman, On the Time to Traverse All Edges in a Graph 1991 38 IPL Zivkovic, A Fast Algorithm for Finding the Compact Sets 1991 38 IPL Rytter & Saoudi, On the Complexity of the Recognition of Parallel 2D-Image Languages 1991 38 IPL Hershberger, A New Data Structure for Shortest Path Queries in a Simple Polygon 1991 38 IPL Lingas, Bit Complexity of Matrix Products 1991 38 IPL Kim & Pramanik, The FX Distribution Method for Parallel Processing of Partial Match Queries 1991 38 IPL Woeginger, On Minimizing the Sum of k Tardinesses 1991 38 IPL Hambrusch & Luby, Parallel Asynchronous Connected Components in a Mesh 1991 38 IPL Kalamboukis & Mantzaris, Towards Optimal Distributed Election on Chordal Rings 1991 38 IPL Fotouhi & Pramanik, Problem of Optimizing the Number of Block Accesses in Performing Relational Join is NP-Hard 1991 38 IPL Matousek, Computing Dominances in E^n 1991 38 IPL Snyder, Lower Bounds for Rectilinear Steiner Trees (Corrigendum) 1991 38 IPL Lee & Choe, SLR(k) Covering for LR(k) Grammars (Corrigenda) 1991 38 IPL Bradford & Jenkyns, On the Inadequacy of Tournament Algorithms for the N-SCS Problem 1991 38 IPL Chrobak & Larmore, A Note on the Server Problem and a Benevolent Adversary 1991 38 IPL Floren, A Note on ``A Faster Approximation Algorithm for the Steiner Problem in Graphs'' 1991 38 IPL Goldberg, Processor-Efficient Implementation of a Maximum Flow Algorithm 1991 38 IPL Siklossy & Tulp, The Space Reduction Method: A Method to Reduce the Size of Search Spaces 1991 38 IPL Gasarch, On Selecting the k Largest with Restricted Quadratic Queries 1991 38 IPL Leiss & Reddy, Embedding Complete Binary Trees into Hypercubes 1991 38 IPL Shonkwiler, Computing the Hausdorff Set Distance in Linear Time for any L_p Point Distance 1991 38 IPL Basart, Some Upper Bounds for Minimal Trees 1991 38 IPL Cai & Hemachandra, A Note on Enumerative Counting 1991 38 IPL Sakkinen, Selftype is a Special Case 1991 38 IPL Kao & Tate, Online Matching with Blocked Input 1991 38 IPL Fernandez-Baca & Williams, On Matroids and Hierarchical Graphs 1991 38 IPL Rote, Computing the Minimum Hausdorff Distance between Two Point Sets on a Line under Translation 1991 38 IPL Langemyr, Circuits for Computing the GCD of Two Polynomials over an Algebraic Number Field 1991 38 IPL Martel, Self-adjusting Multi-way Search Trees 1991 38 IPL Rajanarayanan & Iyengar, A New Optimal Distributed Algorithm for the Set Intersection Problem 1991 38 IPL Rote & Woeginger & Zhu & Wang, Counting k-Subsets and Convex k-gons in the Plane 1991 38 IPL Mnuk, A div(n) Depth Boolean Circuit for Smooth Modular Inverse 1991 38 IPL Pramanik & Das & Bandyopadhyay & Fay, A Deadlock-free Communication Kernel for Loop Architecture 1991 38 IPL Acketa & Zunic, On the Number of Linear Partitions of the (m,n)-Grid 1991 38 IPL Crochemore & Rytter, Efficient Parallel Algorithms to Test Square-freeness and Factorize Strings 1991 38 IPL Alvarez & Gabarro, The Parallel Complexity of Two Problems on Concurrency 1991 38 IPL Yen, A Polynomial Time Algorithm to Decide Pairwise Concurrency of Transitions for 1-Bounded Conflict-free Petri Nets 1991 38 IPL Manzini, Radix Sort on the Hypercube 1991 38 IPL Meidanis, Lower Bounds for Arithmetic Problems 1991 38 IPL Messeguer, Dynamic Behaviour in Updating Process over BST of Size Two with Probabilistic Deletion Algorithms 1991 38 IPL Misra, Phase Synchronization 1991 38 IPL Minsker, The Towers of Antwerpen Problem 1991 38 IPL Dielissen & Kaldewaij, Rectangular Partition is Polynomial in Two Dimensions but NP-complete in Three 1991 38 IPL Goralcik & Goralcikova & Koubek, Alternation with a Pebble 1991 38 IPL Stojmenovic, Bisections and Ham-Sandwich Cuts of Convex Polygons and Polyhedra 1991 38 IPL Elmagarmid & Du, Integrity Aspects of Quasi Serializability 1991 38 IPL Horng & Chen & Fang, Optimal Speed-Up Algorithms for Template Matching on SIMD Hypercube Multiprocessors with Restricted Local Memory 1991 38 IPL Shoup, Smoothness and Factoring Polynomials over Finite Fields 1991 38 IPL Cheng, A Graph Transformation Algorithm for Concurrency Control in a Partitioned Database 1991 38 IPL Chen & Das & Akl, A Unified Approach to Parallel Depth-First Traversals of General Trees 1991 37 IPL Taubner, A Note on the Notation of Recursion in Process Algebras 1991 37 IPL Teo & Tuan, An Improved Upper Bound on the Number of Intersections between Two Rectangular Paths 1991 37 IPL Mahmoud, Motion Estimation based on Modified Fourier Spectrum 1991 37 IPL Danvy, Semantics-directed Compilation of Nonlinear Patterns 1991 37 IPL Vidyasankar, A Very Simple Construction of 1-Writer Multireader Multivalued Atomic Variable 1991 37 IPL Wang & Chen & Chen, A Simple Approach to Implementing Multiplication with Small Tables 1991 37 IPL Galil & Italiano, A Note on Set Union with Arbitrary Deunions 1991 37 IPL Lee & Choe, SLR(k) Covering for LR(k) Grammars 1991 37 IPL Srikant & Krithivasan, Fastest Path Across Constrained Moving Rectilinear Obstacles 1991 37 IPL Rao & Zhang, Building Heaps in Parallel 1991 37 IPL Yuan, Topological Properties of Subercube 1991 37 IPL Mullin, A Caution on Universal Classes of Hash Functions 1991 37 IPL Beauquier, An Undecidable Problem about Rational Sets and Contour Words of Polyominoes 1991 37 IPL Kaldewaij & Schoenmakers, The Derivation of a Tighter Bound for Top-Down Skew Heaps 1991 37 IPL Itoh, Characterization for a Family of Infinitely Many Irreducible Equally Spaced Polynomials 1991 37 IPL Sakakibara, On Learning from Queries and Counterexamples in the Presence of Noise 1991 37 IPL Taubenfeld, On the Nonexistence of Resilient Consensus Protocols 1991 37 IPL Wang & Cheng, List Scheduling of Parallel Tasks 1991 37 IPL Wen, Parallel Multiple Search 1991 37 IPL Jacobs, Probabilistic Checking of Associativity in Algebras 1991 37 IPL Deng & Mahajan, Server Problems and Resistive Spaces 1991 37 IPL Irving, On Approximating the Minimum Independent Dominating Set 1991 37 IPL Tan & Hirata & Inagaki, The Intersection Searching Problem for c-oriented Polygons 1991 37 IPL Huizing & de Roever, Introduction to Design Choices in the Semantics of Statecharts 1991 37 IPL Zwick, An Extension of Khrapchenko's Theorem 1991 37 IPL Liang & Rhee & Dhall & Lakshmivarahan, A New Approach for the Domination Problem on Permutation Graphs 1991 37 IPL Corbett & Scherson, A Unified Algorithm for Sorting on Multidimensional Mesh-connected Processors 1991 37 IPL Serna, Approximating Linear Programming is Log-Space Complete for P 1991 37 IPL Alt & Blum & Mehlhorn & Paul, Computing a Maximum Cardinality Matching in a Bipartite Graph in Time O(n^1.5 sqrt(m/log n)) 1991 37 IPL Skyum, A Simple Algorithm for Computing the Smallest Enclosing Circle 1991 37 IPL Czyzowicz & Lakshmanan & Pelc, Searching with a Forbidden Lie Pattern in Responses 1991 37 IPL Manber & Baeza-Yates, An Algorithm for String Matching with a Sequence of Don't Cares 1991 37 IPL Duris & Vrto, Semelectivity Is Not Sufficient 1991 37 IPL Jiang, Traversing Graphs in a Paging Environment, BFS or DFS? 1991 37 IPL Green, An Oracle Separating Parity-P from PP^PH 1991 37 IPL Janssen, An Optimization Problem Related to Neural Networks 1991 37 IPL Sasaki, The Effect of the Density of States on the Metropolis Algorithm 1991 37 IPL Huynh, The Effective Entropies of Some Extensions of Context-free Languages 1991 37 IPL Turski, On Starvation and Some Related Issues 1991 37 IPL Hofri & Shachnai, On the Optimality of the Counter Scheme for Dynamic Linear Lists 1991 37 IPL Litovsky, Prefix-free Languages as omega-Generators 1991 37 IPL Luccio & Pietracaprina & Pucci, Analysis of Parallel Uniform Hashing 1991 37 IPL Snyder, Lower Bounds for Rectilinear Steiner Trees in Bounded Space 1991 37 IPL Handley, A Space Efficient Distributive Sort 1991 37 IPL Tamassia, An Incremental Reconstruction Method for Dynamic Planar Point Location 1991 37 IPL Tanaka, A Dual Algorithm for the Satisfiability Problem 1991 37 IPL Beigel & Hemachandra & Wechsung, Probabilistic Polynomial Time is Closed under Parity Reductions 1991 37 IPL von Wright, Program Inversion in the Refinement Calculus 1991 37 IPL Gibbons & Ziani, The Balanced Binary Tree Technique on Mesh-connected Computers 1991 37 IPL He, An Efficient Parallel Algorithm for Finding Minimum Weight Matching for Points on a Convex Polygon 1991 37 IPL Carlsson, An Optimal Algorithm for Deleting the Root of a Heap 1991 37 IPL Chang & Gouda, On the Minimum Requirements for Independent Recovery in Distributed Systems 1991 37 IPL Zhang, Overlap Closures Do Not Suffice for Termination of General Term Rewriting Systems 1991 37 IPL Chaudhuri & Ladner, Safety and Liveness of omega-Context-free Languages 1991 37 IPL Olariu, An Optimal Greedy Heuristic to Color Interval Graphs 1991 37 IPL Kann, Maximum Bounded 3-dimensional Matching is MAX SNP-Complete 1991 37 IPL Manolopoulos & Vakali, Seek Distances in Disks with Two Independent Heads per Surface 1991 37 IPL Sarkar & Chakrabarti & Ghose & De Sarkar, Multiple Visibility Graphs 1991 37 IPL Yu & Lin & Wu, The Tree Representation of the Graph Used in Binary Image Processing 1990 36 IPL Ghosh & Maheshwari, An Optimal Algorithm for Computing a Minimum Nested Nonconvex Polygon 1990 36 IPL Kocsis & Bohme, Rotation-based Computations for Ray-tracing Second-order Surfaces and Curves 1990 36 IPL Brogi & Lamma & Mello, Hypothetical Reasoning in Logic Programming: A Semantic Approach 1990 36 IPL Fulop & Vagvolgyi, The Emptiness Problem is Undecidable for Domains of Partial Monadic 2-Modular Tree Transformations 1990 36 IPL Hoogerwoord, A Calculational Derivation of the CASOP Algorithm 1990 36 IPL Matsliach, Performance Analysis of File Organizations that Use Multi-Bucket Data Leaves 1990 36 IPL Salomaa & Yu, The Immortality Problem for Lag Systems 1990 36 IPL Di Battista & Liu & Rival, Bipartite Graphs, Upward Drawings, and Planarity 1990 36 IPL Kim, Parallel Algorithms for the Segment Dragging Problem 1990 36 IPL Kim & Lee, Partial Sum Problem Mapping into a Hypercube 1990 36 IPL Hur & Chon, Self and Selftype 1990 36 IPL Damaschke & Muller & Kratsch, Domination in Convex and Chordal Bipartite Graphs 1990 36 IPL Martin, A Note on Division Orderings on Strings 1990 36 IPL Sheu & Chiang, Efficient Allocation of Chain-like Task on Chain-like Network Computers 1990 36 IPL Damm, Problems Complete for PARITY-L 1990 36 IPL Cheng & Janardan, Efficient Dynamic Algorithms for Some Geometric Intersection Problems 1990 36 IPL Gyssens & Paredaens & Van Gucht, On a Hierarchy of Classes for Nested Databases 1990 36 IPL Makarov, On the Synthesis of Fast Algorithms for Signal Processing 1990 36 IPL Dublish, Some Comments on the Subtree Isomorphism Problem for Ordered Trees 1990 36 IPL Teo & Tuan, Performance Analysis of Greedy Heuristic to Find a Minimum Total-Jogs Layout for River Routing 1990 36 IPL Barbosa, Blocking versus Nonblocking Interprocess Communication: A Note on the Effect on Concurrency 1990 36 IPL Kleine Buning, Existence of Simple Propositional Formulas 1990 36 IPL Qian, An Axiom System for Database Transactions 1990 36 IPL Woeginger, A Simple Solution to the Two Paths Problem in Planar Graphs 1990 36 IPL Dijkstra, Making a Fair Roulette from a Possibly Biased Coin 1990 36 IPL Ramesh, On the Completeness of Modular Proof Systems 1990 36 IPL Makinen, The Grammatical Inference Problem for the Szilard Languages of Linear Grammars 1990 36 IPL Falkowski, Perceptrons Revisited 1990 36 IPL Kutylowski, Remarks on Sorting and One-way Multihead Finite Automata 1990 36 IPL Vyskoc, Making Bubblesort Recursive 1990 36 IPL Lee, Efficient Address Generation in a Parallel Processor 1990 36 IPL Cheng, An Algebraic Semantics of Notional Entailment Logic Cn 1990 36 IPL Tsalgatidou, Modelling and Animating Information Systems Dynamics 1990 36 IPL Li, On Full Utilization of Multi-Channel Capacity with Priority Protocol 1990 36 IPL Sanchis, On the Complexity of Test Case Generation for NP-Hard Problems 1990 36 IPL Kollias & Manolopoulos & Papadimitriou, The Optimum Execution Order of Queries in Linear Storage 1990 36 IPL Larmore, An Optimal Algorithm with Unknown Time Complexity for Convex Matrix Searching 1990 36 IPL Lin & Olariu, A Fast Parallel Algorithm to Recognize Partitionable Graphs 1990 36 IPL Paulik, Worst-Case Analysis of a Generalized Heapsort Algorithm 1990 36 IPL Hagerup & Shen, Improved Nonconservative Sequential and Parallel Sorting 1990 36 IPL Biro, Object-oriented Interaction in Resource Constrained Scheduling 1990 36 IPL Slobodova, One-way Globally Deterministic Synchronized Alternating Finite Automata Recognize Exactly Deterministic Context-sensitive Languages 1990 36 IPL Vavasis, Quadratic Programming is in NP 1990 36 IPL Cai, Lower Bounds for Constant-Depth Circuits in the Presence of Help Bits 1990 36 IPL Lee & Park & Kim, An Upper Bound on Buffer Size for Join Operation Using Nonclustered Indexes 1990 36 IPL Lipton & Park, The Processor Identity Problem 1990 36 IPL Haldar & Patnaik, Oracle Complexities for Computational Geometry of Semi-Algebraic Sets and Voronoi Diagrams 1990 36 IPL Megson & Gaston, Improved Matrix Triangularisation Using a Double Pipeline Systolic Array 1990 36 IPL Liu, A Note on Graham's Bound 1990 36 IPL Chen & Lu & Brozovsky & Wang, An Optimization Technique for Protocol Conformance Testing Using Multiple UIO Sequences 1990 36 IPL Jedrzejowicz, Infinite Hierarchy of Shuffle Expressions over a Finite Alphabet 1990 36 IPL Kim, Finding a Maximum Independent Set in a Permutation Graph 1990 36 IPL Dederichs & Weber, Safety and Liveness from a Methodological Point of View 1990 36 IPL Wang & Chen, Two-Dimensional Processor Array with a Reconfigurable Bus System Is At Least as Powerful as CRCW Model 1990 36 IPL Burris & Lawrence, Unification in Commutative Rings Is Not Finitary 1990 36 IPL Fields & Frederickson, A Faster Algorithm for the Maximum Weighted Tardiness Problem 1990 36 IPL Goldreich & Petrnak, The Best of Both Worlds: Guaranteeing Termination in Fast Randomized Byzantine Agreement Protocols 1990 36 IPL Qiu & Meijer, A Note on Diameter of Acyclic Directed Hypercubes 1990 36 IPL Bodlaender & Tel, Bit-Optimal Election in Synchronous Rings 1990 35 IPL Van Gasteren & Tel, Comments on ``On the Proof of a Distributed Algorithm'': Always-True is not Invariant (Letter to the editor) 1990 35 IPL Shmoys & Williamson, Analyzing the Held-Karp TSP Bound: A Monotonicity Property with Application 1990 35 IPL Mostowski, Alternating Automata with Start Formulas 1990 35 IPL Karner, A Note on Terminal Balancing of Algebraic Systems 1990 35 IPL Yen & Lee, The Weighted Perfect Domination Problem 1990 35 IPL Aggarwal & Leighton, A Tight Lower Bound for the Train Reversal Problem 1990 35 IPL Wu & Wang & Tai, Application of Exponential Hetero-Associative Memory on Frequency Classifier 1990 35 IPL Sheu & Tang, Efficient Parallel k Selection Algorithm 1990 35 IPL Wu & Manber & Myers & Miller, An O(NP) Sequence Comparison Algorithm 1990 35 IPL Chin, On the Depth Complexity of the Counting Functions 1990 35 IPL Block & Woo, A More Efficient Generalization of Peterson's Mutual Exclusion Algorithm 1990 35 IPL Loui & Sohoni, An Algorithm for Load Balancing in Multiprocessor Systems 1990 35 IPL Toda, On the Complexity of Topological Sorting 1990 35 IPL Gradel, Simple Interpretations among Complicated Theories 1990 35 IPL Grigg & Miguet & Robert, Symmetric Matrix-Vector Product on a Ring of Processors 1990 35 IPL Cimikowski, Finding Hamiltonian Cycles in Certain Planar Graphs 1990 35 IPL Chang & Huang & Tang, An Optimal Algorithm for Constructing Oriented Voronoi Diagrams and Geographic Neighborhood Graphs 1990 35 IPL Hellerstein & Klein & Wilber, On the Time-Space Complexity of Reachability Queries for Preprocessed Graphs 1990 35 IPL Dickerson & Drysdale, Fixed-Radius Near Neighbors Search Algorithms for Points and Segments 1990 35 IPL Francez, Cooperating Proofs for Distributed Programs with Multiparty Interactions (Corrigenda) 1990 35 IPL Lin, Parallel Algorithm for Generating Permutations on Linear Array 1990 35 IPL Gouda & Herman, Stabilizing Unison 1990 35 IPL Yuan, The Communication Complexity for Decentralized Evaluation of Functions 1990 35 IPL Mehlhorn & Haher, Bounded Ordered Dictionaries in O(log log N) Time and O(n) Space 1990 35 IPL Inverardi & Nesi, A Rewriting Strategy to Verify Observational Congruence 1990 35 IPL Alon, Generating Pseudo-random Permutations and Maximum Flow Algorithms 1990 35 IPL Manacher & Mankus & Smith, An Optimum Theta(n log n) Algorithm for Finding a Canonical Hamiltonian Path and a Canonical Hamiltonian Circuit in a Set of Intervals 1990 35 IPL Deng, An Optimal Parallel Algorithm for Linear Programming in the Plane 1990 35 IPL Altman & Logothetis, A Note on Ambiguity in Context-free Grammars 1990 35 IPL Lambrichts & Nees & Paredaens & Peelman & Tanca, Checking Functional Consistency in Deductive Databases 1990 35 IPL Crochemore & Rytter, Parallel Construction of Minimal Suffix and Factor Automata 1990 35 IPL Kwiatkowska, A Metric for Traces 1990 35 IPL Mehlhorn & Naher & Uhrig, Hidden Line Elimination for Isooriented Rectangles 1990 35 IPL Vardi, Endmarkers Can Make a Difference 1990 35 IPL Arikati & Rangan, Linear Algorithm for Optimal Path Cover Problem on Interval Graphs 1990 35 IPL Launchbury, Strictness Analysis Aids Inductive Proofs 1990 35 IPL Piotrowski, A Functional Model of a Simplified Sequential Machine 1990 35 IPL Lubiw, Counterexample to a Conjecture of Szymanski on Hypercube Routing 1990 35 IPL Herman, Probabilistic Self-Stabilization 1990 35 IPL Guenther, Efficient Expansion of Factored Expressions 1990 35 IPL Maes, On a Cyclic String-to-String Correction Problem 1990 35 IPL Barnard & Skillicorn, Pipelining Tree-structured Algorithms on SIMD Architectures 1990 35 IPL Fung & Nicholl & Tarjan & Van Wyk, Simplified Linear-time Jordan Sorting and Polygon Clipping 1990 35 IPL Wang, Obtaining Lazy Evaluation with Continuations in Scheme 1990 35 IPL Wegener, Efficient Simulation of Circuits by EREW PRAMs 1990 35 IPL Sideris, On Attribute Grammars without Attribute Synthesis 1990 35 IPL Wand, A Short Proof of the Lexical Addressing Algorithm 1990 35 IPL Ahuja & Zhu, An O(n log n) Feasibility Algorithm for Preemptive Scheduling of n Independent Jobs on a Hypercube 1990 35 IPL Aggarwal & Suri, Computing the Longest Diagonal of a Simple Polygon 1990 35 IPL Jacob, A Model of Reconfiguration in Communicating Sequential Processes 1990 35 IPL Bajaj & Dey, Polygon Nesting and Robustness 1990 35 IPL Siromoney & Mathew, A Public Key Cryptosystem Based on Lyndon Words 1990 35 IPL Ching & Mehlhorn & Smid, Dynamic Deferred Data Structuring 1990 35 IPL Lodi & Luccio & Pagli, Routing in Times Square Mode 1990 35 IPL Rubinfeld, The Cover Time of a Regular Expander is O(n log n) 1990 35 IPL Boxer & Miller, Common Intersections of Polygons (Corrigenda) 1990 35 IPL Dumar & Iyengar & Sharma, Corrections to a Distributed Depth-First Search Algorithm (Corrigenda) 1990 34 IPL Goldreich, A Note on Computational Indistinguishability 1990 34 IPL Chandrasekharan, Isomorphism Testing of k-trees is in NC, for Fixed k 1990 34 IPL Chomicki & Subrahmanian, Generalized Closed World Assumption is Pi^0_2-complete 1990 34 IPL Heath, Covering a Set with Arithmetic Progressions is NP-complete 1990 34 IPL Zargham & Danhof, Toward a Definition of Fault Analysis for Petri Nets Models 1990 34 IPL Klein & Stein, A Parallel Algorithm for Eliminating Cycles in Undirected Graphs 1990 34 IPL Matsliach & Shmueli, Distributing a B^+-tree in a Loosely Coupled Environment 1990 34 IPL Sengupta & Bandyopadhyay, Deadlock-free Routing in k-ary Hypercube Network in Presence of Processor Failures 1990 34 IPL Manber, Recognizing Breadth-First Search Trees in Linear Time 1990 34 IPL Kale, An Almost Perfect Heuristic for the N Nonattacking Queens Problem 1990 34 IPL Lutz, Some Proofs of Data Refinement 1990 34 IPL Wang & Chen & Lin, Constant Time Sorting on a Processor Array with a Reconfigurable Bus System 1990 34 IPL Bradford, Sequence Matching with Binary Codes 1990 34 IPL Bagchi & Hakimi & Mitchem & Schmeichel, Parallel Algorithms for Gossiping by Mail 1990 34 IPL Khuller, Coloring Algorithms for K_5-Minor Free Graphs 1990 34 IPL Cooper & Kitchen, CASOP: A Fast Algorithm for Computing the n-ary Composition of a Binary Associative Operator 1990 34 IPL Ramalingam & Rangan, New Sequential and Parallel Algorithms for Interval Graph Recognition 1990 34 IPL Dunne, Comment on Kochol's Paper ``Efficient Monotone Circuits for Threshold Functions'' 1990 34 IPL Ronn & Saikkonen, Distributed Termination Detection with Counters 1990 34 IPL Tuza, Periodic String Division Generated by Deterministic L Systems 1990 34 IPL Kim, A Parallel Algorithm for Finding a Maximum Clique of a Set of Circular Arcs of a Circle 1990 34 IPL Murphy, A Unifying Framework for Trie Design Heuristics 1990 34 IPL Pugh, Slow Optimally Balanced Search Strategies vs. Cached Fast Uniformly Balanced Search Strategies 1990 34 IPL Pombortsis, Sharing Special Purpose Resources in a Multiprocessor Environment 1990 34 IPL Kuo & Tseng, The Necessary and Sufficient Condition for the Worst-Case Male Optimal Stable Matching 1990 34 IPL Robson, Random Access Machines with Multi-dimensional Memories 1990 34 IPL Weiss & Sedgewick, More on Shellsort Increment Sequences 1990 34 IPL Gonnet & Baeza-Yates, An Analysis of the Karp-Rabin String Matching Algorithm 1990 34 IPL Althofer, Tight Lower Bounds on the Length of Word Chains 1990 34 IPL Hoare, Fixed Points of Increasing Functions 1990 34 IPL Pallo, A Distance Metric on Binary Trees Using Lattice-Theoretic Measures 1990 34 IPL Bertoni & Goldwurm & Massazza, Counting Problems and Algebraic Formal Power Series in Noncommuting Variables 1990 34 IPL Harn & Kiesler, An Efficient Probabilistic Encryption Scheme 1990 34 IPL Park & Kim, A Distributed Synchronization Scheme for Fair Multi-process Handshakes 1990 34 IPL Goeman, Towards a Theory of (Self) Applicative Communicating Processes: A Short Note 1990 34 IPL Meinel, Logic vs. Complexity Theoretic Properties of the Graph Accessibility Problem for Directed Graphs of Bounded Degree 1990 34 IPL Teng, Space Efficient Processor Identity Protocol 1990 34 IPL Tipper, A Straightforward Iterative Algorithm for the Planar Voronoi Diagram 1990 34 IPL Plehn, Preemptive Scheduling of Independent Jobs with Release Times and Deadlines on a Hypercube 1990 34 IPL Ntafos, The Robber Route Problem 1990 34 IPL Dey & Bryant & Takaoka, Lexical Ambiguity in Tree Adjoining Grammars 1990 34 IPL Wee & Chaiken & Willard, On the Angle Restricted Nearest Neighbor Problem 1990 34 IPL Sen, Finding an Approximate Median with High Probability in Constant Parallel Time 1990 34 IPL Cook & Pitassi, A Feasibly Constructive Lower Bound for Resolution Proofs 1990 34 IPL Laumond, Connectivity of Plane Triangulations 1990 34 IPL Olariu, On the Closure of Triangle-free Graphs under Substitution 1990 34 IPL Cosnard & Duprat & Ferreira, The Complexity of Searching in X + Y and Other Multisets 1990 34 IPL Kurihara & Kaji, Modular Term Rewriting Systems and the Termination 1990 34 IPL Ahuja, Flush Primitives for Asynchronous Distributed Systems 1990 34 IPL Simonson, Routing with Critical Paths 1990 34 IPL Andersson & Carlsson, Construction of a Tree from Its Traversals in Optimal Time and Space 1990 34 IPL Jacob, Separability and the Detection of Hidden Channels 1990 34 IPL Martinez & Wachenchauzer & Lins, Cyclic Reference Counting with Local Mark-Scan 1990 34 IPL Murphy & Selkow, Finding Nearest Neighbors with Voronoi Tessellations 1990 34 IPL Neaderhouser Purdy & Purdy, The Area-Time Complexity of the Greatest Common Divisor Problem: A Lower Bound 1990 34 IPL Leung & Young, Preemptive Scheduling to Minimize Mean Weighted Flow Time 1990 34 IPL Morrison & Atkinson & Brown & Dearle, On the Classification of Binding Mechanisms 1990 34 IPL Francez, Cooperating Proofs for Distributed Programs with Multiparty Interactions 1990 33 IPL Bertossi & Moretti, Parallel Algorithms on Circular-Arc Graphs 1990 33 IPL Dillencourt, Realizability of Delaunay Triangulations 1990 33 IPL Gunther & Shaw, Path Integral Evaluation of ALOHA Network Transients 1990 33 IPL Altman & Chlebus, Sorting Roughly Sorted Sequences in Parallel 1990 33 IPL Olariu, A Generalization of Chvatal's Star-Cutset Lemma 1990 33 IPL Hagerup & Rub, A Guided Tour of Chernoff Bounds 1990 33 IPL Galil & Park, A Linear-Time Algorithm for Concave One-Dimensional Dynamic Programming 1990 33 IPL Hingston & Wilkinson, A Distributed Join Algorithm 1990 33 IPL Khuller & Mitchell, On a Triangle Counting Problem 1990 33 IPL Knapp, A Predicate Transformer for Progress 1990 33 IPL Crescenzi & Silvestri, Relative Complexity of Evaluating the Optimum Cost and Constructing the Optimum for Maximization Problems 1990 33 IPL Suzuki & Takahashi & Nishizeki, A Linear Algorithm for Bipartition of Biconnected Graphs 1990 33 IPL Han & Igarashi, Time Lower bounds for Sorting on Multi-dimensional Mesh-connected Processor Arrays 1990 33 IPL Kamper, A Result Relating Disjunctive Self-reducibility to P-Immunity 1990 33 IPL Kannan & Chuang, Fast Hough Transform on a Mesh Connected Processor Array 1990 33 IPL Boxer & Miller, Common Intersections of Polygons 1990 33 IPL Agrawal & El Abbadi, Exploiting Logical Structures in Replicated Databases 1990 33 IPL Shoup, On the Deterministic Complexity of Factoring Polynomials over Finite Fields 1990 33 IPL Anderson & Miller, A Simple Randomized Parallel Algorithm for List-Ranking 1989 33 IPL Hershberger, Finding the Upper Envelope of n Line Segments in O(n log n) Time 1989 33 IPL Lee & Preparata, Parallel Batched Planar Point Location on the CCC 1989 33 IPL Hagerup & Rub, Optimal Merging and Sorting on the EREW PRAM 1989 33 IPL Levcopoulos & Petersson, A Note on Adaptive Parallel Sorting 1989 33 IPL Wanke & Wiegers, Undecidability of the Bandwidth Problem on Linear Graph Languages 1989 33 IPL Rolim, On the Polynomial IO-Complexity 1989 33 IPL Boreddy & Mukherjee, An Algorithm to Find Polygon Similarity 1989 33 IPL Zippel, An Explicit Separation of Relativised Random Polynomial Time and Relativised Deterministic Polynomial Time 1989 33 IPL Zerovnik, A Randomised Heuristical Algorithm for Estimating the Chromatic Number of a Graph 1989 33 IPL Grossi & Luccio, Simple and Efficient String Matching with k Mismatches 1989 33 IPL Shoudai, The Lexicographically First Topological Order Problem is NLOG-Complete 1989 33 IPL Lopriore, Software-controlled Cache Coherence Protocol for Multicache Systems 1989 33 IPL McCurley, Auxiliary Variables in Partial Correctness Programming Logics 1989 33 IPL Akl & Gries & Stojmenovic, An Optimal Parallel Algorithm for Generating Combinations 1989 33 IPL Book & Tang, A Note on Sparse Sets and the Polynomial-Time Hierarchy 1989 33 IPL Boppana, The Average-case Parallel Complexity of Sorting 1989 33 IPL Rao & Rangan, Optimal Parallel Algorithms on Circular-Arc Graphs 1989 33 IPL Parker & Parberry, Constructing Sorting Networks from k-Sorters 1989 33 IPL Berghammer & Schmidt & Zierer, Symmetric Quotients and Domain Constructions 1989 33 IPL Avis & Robert & Wenger, Lower Bounds for Line Stabbing 1989 33 IPL Buchta, On the Average Number of Maxima in a Set of Vectors 1989 33 IPL Chung & Chen & Lin, Fast Computation of Periodic Continued Fractions 1989 33 IPL Szepietowski, Some Remarks on the Alternating Hierarchy and Closure under Complement for Sublogarithmic Space 1989 33 IPL Thome & Wilhelm, Simulating Circular Attribute Grammars through Attribute Reevaluation 1989 33 IPL Dietzfelbinger, The Speed of Copying on One-tape Off-line Turing Machines 1989 33 IPL Schaffer, Optimal Node Ranking of Trees in Linear Time 1989 33 IPL Ceri & Gottlob & Tanca & Wiederhold, Magic Semi-Joins 1989 33 IPL Szepietowski, Some Notes on Strong and Weak log log n Space Complexity 1989 33 IPL Fulop & Vagvolgyi, Top-down Tree Transducers with Deterministic Top-down Look-ahead 1989 33 IPL Wan & Wong, An Adaptive Algorithm for Finding a Covering Hypersphere 1989 33 IPL Lee, On Access and Alignment of Data in a Parallel Processor 1989 33 IPL Majster-Cederbaum, The Contraction Property is Sufficient to Guarantee the Uniqueness of Fixed Points of Endofunctors in a Category of Complete Metric Spaces 1989 33 IPL Misra, A Simple Proof of a Simple Consensus Algorithm 1989 33 IPL Taubenfeld, Leader Election in the Presence of n-1 Initial Failures 1989 33 IPL Rao & Rangan, Linear Algorithm for Domatic Number Problem on Interval Graphs 1989 33 IPL DasGupta & Veni Madhavan, An Approximate Algorithm for the Minimal Vertex Nested Polygon Problem 1989 33 IPL Wong, Comments on ``A Comparison of Concatenated and Superimposed Code Word Surrogate Files for Very Large Data/Knowledge Bases'' 1989 33 IPL Raynal, Prime Numbers as a Tool to Design Distributed Algorithms 1989 32 IPL Shiraishi, A Parallel Algorithm for the Maximum 2-Chain Edge Packing Problem 1989 32 IPL Abiteboul, Boundedness Is Undecidable for Datalog Programs with a Single Recursive Rule 1989 32 IPL Alblas, Optimal Incremental Simple Multi-Pass Attribute Evaluation 1989 32 IPL Padberg & Sassano, The Complexity of Matching with Bonds 1989 32 IPL Drysdale & Jaromczyk, A Note on Lower Bounds for the Maximum Area and Maximum Perimeter k-gon Problems 1989 32 IPL Gibbons & Srikant, A Class of Problems Efficiently Solvable on Mesh-Connected Computers Including Dynamic Expression Evaluation 1989 32 IPL Demolombe & Illarramendi, Heuristics for Syntactical Optimization of Relational Queries 1989 32 IPL Abiteboul & Gyssens & van Gucht, An Alternative Way to Represent the Cogroup of a Relation in the Context of Nested Databases 1989 32 IPL Toyama, Fast Knuth-Bendix Completion with a Term Rewriting System Compiler 1989 32 IPL Veroy, Optimal Search Algorithm for a Minimum of a Discrete Periodic Bimodal Function (Corrigenda), and Average Complexity of Divide-and-Conquer Algorithms (Corrigenda) 1989 32 IPL van den Bos, PROCOL: A Protocol-Constrained Concurrent Object-Oriented Language 1989 32 IPL Kemp, A One-to-One Correspondence between Two Classes of Ordered Trees 1989 32 IPL Francez, Cooperating Proofs for Distributed Programs with Multiparty Interactions 1989 32 IPL Everett & Gupta, Acyclic Directed Hypercubes May Have Exponential Diameter 1989 32 IPL Cheston & Farley & Hedetniemi & Proskurowski, Centering a Spanning Tree of a Biconnected Graph 1989 32 IPL Barrington & Corbett, On the Relative Complexity of Some Languages in NC^1 1989 32 IPL Clouatre & Laliberte & Merrett, A General Implementation of Relational Recursion with Speedup Techniques for Programmers 1989 32 IPL Roberts, Another Note on Recursive Ascent 1989 32 IPL Baron & Urbanek, Factorial Languages with Quadratically Upper Bounded Growth Functions and Nonlinearly Upper Bounded Subword Complexities 1989 32 IPL Makinen, On the Subtree Isomorphism Problem for Ordered Trees 1989 32 IPL Chakrabarti & Ghose & Pandey & De Sarkar, Increasing Search Efficiency Using Multiple Heuristics (Corrigenda) 1989 32 IPL Atallah & Chen, An Optimal Parallel Algorithm for the Minimum Circle-Cover Problem 1989 32 IPL Narasimhan, A Note on the Hamiltonian Circuit Problem on Directed Path Graphs 1989 32 IPL Bern & Plassmann, The Steiner Problem with Edge Lengths 1 and 2 1989 32 IPL Ligozat & Bestougeff, On Relations between Intervals 1989 32 IPL Sharma & Iyengar & Mandyam, An Efficient Distributed Depth-First-Search Algorithm 1989 32 IPL Sharir, A Note on the Papadimitriou-Silverberg Algorithm for Planning Optimal Piecewise-Linear Motion of a Ladder 1989 32 IPL Lingas, Voronoi Diagrams with Barriers and the Shortest Diagonal Problem 1989 32 IPL Ellis & Mata & MacGillivray, A Linear Time Algorithm for Longest (s,t)-Paths in Weighted Outerplanar Graphs 1989 32 IPL Egecioglu & Kalantari, Approximating the Diameter of a Set of Points in the Euclidean Space 1989 32 IPL Sandhu, The Demand Operation in the Schematic Protection Model 1989 32 IPL Laih & Harn & Lee, A New Threshold Scheme and its Application in Designing the Conference Key Distribution Cryptosystem 1989 32 IPL Janiak, Minimization of Resource Consumption under a Given Deadline in the Two-processor Flow-shop Scheduling Problem 1989 32 IPL Huang, Termination Detection by Using Distributed Snapshots 1989 32 IPL Kochol, Efficient Monotone Circuits for Threshold Functions 1989 32 IPL Skiena, Reconstructing Graphs from Cut-Set Sizes 1989 32 IPL Goscinski, A Synchronization Algorithm for Processes with Dynamic Priorities in Computer Networks with Node Failures 1989 32 IPL Richardson & Ganapathi, Interprocedural Analysis vs. Procedure Integration 1989 32 IPL Cull & Holloway, Computing Fibonacci Numbers Quickly 1989 32 IPL Sagar & Sarje & Ahmed, On Module Assignment in Two-processor Distributed Systems: A Modified Algorithm 1989 32 IPL Morris, Well-founded Induction and the Invariance Theorem for Loops 1989 32 IPL Choi & Kim, Hybrid Join: An Improved Sort-based Join Algorithm 1989 32 IPL Boxer & Miller, A Parallel Circle-Cover Minimization Algorithm 1989 32 IPL Chern & Chen & Liu, An LC Branch-and-Bound Algorithm for the Module Assignment Problem 1989 32 IPL Kim & Kim, Coordinator: A Modification to the Monitor Concept 1989 32 IPL Feitelson & Rudolph, Implementation of a Wait-free Synchronization Primitive that Solves n-Process Consensus 1989 32 IPL Wolfram, Forward Checking and Intelligent Backtracking 1989 32 IPL Chen & Yeh & Chen, Using Fewer Processors to Reduce Time Complexities of Semigroup Computations 1989 32 IPL Damaschke, The Hamiltonian Circuit Problem for Circle Graphs is NP-Complete 1989 32 IPL Sarkar & Stojmenovic, An Optimal Parallel Circle-Cover Algorithm 1989 32 IPL Gunther, Path Integral Methods for Computer Performance Analysis 1989 32 IPL Matousek, On-line Computation of Convolutions 1989 32 IPL Sistla, On Verifying that a Concurrent Program Satisfies a Nondeterministic Specification 1989 32 IPL Iwano, An Improvement of Goldberg, Plotkin and Vaidya's Maximal Node-Disjoint Paths Algorithm 1989 32 IPL Biskup, Boyce-Codd Normal Form and Object Normal Forms 1989 32 IPL Hagerup, Hybridsort Revisited and Parallelized 1989 32 IPL Blass & Gurevich, On Matijasevitch's Nontraditional Approach to Search Problems 1989 32 IPL Lloyd, A Fast Algorithm for Finding Interlocking Sets 1989 31 IPL Stalmarck, A Note on the Computational Complexity of the Pure Classical Implication Calculus 1989 31 IPL Nagamochi & Ibaraki, On Max-Flow Min-Cut and Integral Flow Properties for Multicommodity Flows in Directed Networks 1989 31 IPL Foster & Vohra, Probabilistic Analysis of a Heuristic for the Dual Bin Packing Problem 1989 31 IPL Yoccoz, Recursive omega-Rule for Proof Systems 1989 31 IPL Mukkamala, Some Properties of View-based Replication Control Algorithms for Distributed Systems 1989 31 IPL Bertolazzi & Sassano, A Decomposition Strategy for the Vertex Cover Problem 1989 31 IPL Czaja, Finite Processes in Cause-Effect Structures and their Composition 1989 31 IPL Aggarwal & Hawrylycz, On Computing the Closest Boundary Point on the Convex Hull 1989 31 IPL Carlsson & Chen & Strothotte, A Note on the Construction of Data Structure ``Deap'' 1989 31 IPL Bloniarz & Ravi, An Omega(n log n) Lower Bound for Decomposing a Set of Points into Chains 1989 31 IPL Eisinger, A Note on the Completeness of Resolution with Self-Resolution 1989 31 IPL Allison, Direct Semantics and Exceptions Define Jumps and Coroutines 1989 31 IPL Gregori, Unit-length Embedding of Binary Trees on a Square Grid 1989 31 IPL Wu, Fast Approximations to Discrete Optimal Quantization 1989 31 IPL Chlebus, Parallel Iterated Bucket Sort 1989 31 IPL Malhotra & To & Kanchanasut, An Improved Data-Dependency-Based Backtracking Scheme for Prolog 1989 31 IPL Goldman, A Space Efficient Greedy Triangulation Algorithm 1989 31 IPL Varma, Fault-tolerant Routing in Unique-Path Multistage Interconnection Networks 1989 31 IPL Mattern, An Efficient Distributed Termination Test 1989 31 IPL Carson & Vongsathorn, Error Bounds on Disk Arrangement Using Frequency Information 1989 31 IPL Hochbaum & Shamir, An O(n log^2 n) Algorithm for the Maximum Weighted Tardiness Problem 1989 31 IPL Skillicorn & Barnard, Parallel Parsing on the Connection Machine 1989 31 IPL Matsuoka & Kamada & Kawai, Asymptotic Evaluation of Window Visibility 1989 31 IPL Tel & Mattern, Comments on ``Ring Based Termination Detection Algorithm for Distributed Computations'' 1989 31 IPL Shih & Hsu, An O(n log n + m log log n) Maximum Weight clique Algorithm for Circular-arc Graphs 1989 31 IPL Bodlaender, Achromatic Number is NP-Complete for Cographs and Interval Graphs 1989 31 IPL Tsitsiklis, On the Use of Random Numbers in Asynchronous Simulation via Rollback 1989 31 IPL Leung, Bin Packing with Restricted Piece Sizes 1989 31 IPL Lentfert & Overmars, Data Structures in a Real-time Environment 1989 31 IPL Cheriyan & Maheshwari, The Parallel Complexity of Finding a Blocking Flow in a 3-Layer Network 1989 31 IPL Beaudry, Characterization of Idempotent Transformation Monoids 1989 31 IPL Luccio & Palgi, On the Upper Bound on the Rotation Distance of Binary Trees 1989 31 IPL Ho & Lee, Counting Clique Trees and Computing Perfect Elimination Schemes in Parallel 1989 31 IPL Sundar, Worst-case Data Structures for the Priority Queue with Attrition 1989 31 IPL Basart & Huguet, An Approximation Algorithm for the TSP 1989 31 IPL Ramakrishna, Analysis of Random Probing Hashing 1989 31 IPL Burton, A Note on Higher-order Functions versus Logical Variables 1989 31 IPL Stewart, An Algorithm for Colouring Perfect Planar Graphs 1989 31 IPL Rytter, A Note on Optimal Parallel Transformations of Regular Expressions to Nondeterministic Finite Automata 1989 31 IPL Ginat & Sleator & Tarjan, A Tight Amortized Bound for Path Reversal 1989 31 IPL Kamada & Kawai, An Algorithm for Drawing General Undirected Graphs 1989 31 IPL Aggarwal & Kravets, A Linear Time Algorithm for Finding All Farthest Neighbors in a Convex Polygon 1989 31 IPL Robert & Tourancheau & Villard, Data Allocation Strategies for the Gauss and Jordan Algorithms on a Ring of Processors 1989 31 IPL Hartley, Drawing Polygons Given Angle Sequences 1989 31 IPL Kumar, Concurrency Control on Extendible Hashing 1989 31 IPL Olariu & Randall, Welsh-Powell Opposition Graphs 1989 31 IPL Yu, A Pumping Lemma for Deterministic Context-free Languages 1989 31 IPL de Fraysseix & Imai, Notes on Oriented Depth-First Search and Longest Paths 1989 30 IPL Nazareth & Ariyawansa, On Accelerating Newton's Method Based on a Conic Model 1989 30 IPL De Luca & Varricchio, Factorial Languages Whose Growth Function Is Quadratically Upper Bounded 1989 30 IPL Lindhorst & Shahrokhi, On Renaming a Set of Clauses as a Horn Set 1989 30 IPL Ibarra & Jiang, Optimal Simulation of Tree Arrays by Linear Arrays 1989 30 IPL Vogt, A New Approach to Optimal Cache Scheduling 1989 30 IPL Vidyasankar, An Elegant 1-Writer Multireader Multivalued Atomic Register 1989 30 IPL Rytter & Szymacha, Parallel Algorithms for a Class of Graphs Generated Recursively 1989 30 IPL Kucera, Graphs with Small Chromatic Numbers are Easy to Color 1989 30 IPL Ch'ng & Srinivasan & Ooi, Study of Selforganizing Heuristics for Skewed Access Patterns 1989 30 IPL Song & Park & Lee & Park & Kim, A Distributed Deadlock Detection Algorithm: Distributed Graph Reconstruction Algorithm 1989 30 IPL Zalcstein & Garzon, An NC^2 Algorithm for Testing Similarity of Matrices 1989 30 IPL Gusfield & Irving, Parametric Stable Marriage and Minimum Cuts 1989 30 IPL Vardi, A Note on the Reduction of Two-way Automata to One-way Automata 1989 30 IPL Rajan & Ghosh & Gupta, An Efficient Parallel Algorithm for Random Sampling 1989 30 IPL Omiecinski & Tien, A Hash-based Join Algorithm for a Cube-Connected Parallel Computer 1989 30 IPL Lavault, Average Number of Messages for Distributed Leader-Finding in Rings of Processors 1989 30 IPL Chetto & Chetto, Scheduling Periodic and Sporadic Tasks in a Real-time System 1989 30 IPL Wogulis, Self-adjusting and Split Sequence Hash Tables 1989 30 IPL Raymond, A Distributed Algorithm for Multiple Entries to a Critical Section 1989 30 IPL Mattern, Global Quiescence Detection Based on Credit Distribution and Recovery 1989 30 IPL Barkley & Lee, Point Representation and Hashing of an Interval 1989 30 IPL Aggarwal & Coppersmith & Kleitman, A Generalized Model for Understanding Evasiveness 1989 30 IPL Robson, Separating Strings with Small Automata 1989 30 IPL Culbertson & Rudnicki, A Fast Algorithm for Constructing Trees from Distance Matrices 1989 30 IPL Itoh & Tsujii, An Efficient Algorithm for Deciding Quadratic Residuosity in Finite Fields GF(p^m) 1989 30 IPL Jokinen, Customizable Garbage Collectors 1989 30 IPL Provan, Shortest Enclosing Walks and Cycles in Embedded Graphs 1989 30 IPL Gerstel & Mansour & Zaks, Bit Complexity of Order Statistics on a Distributed Star Network 1989 30 IPL Rolim & Greibach, A Note on the Best-Case Complexity 1989 30 IPL Kelter, The Pitfall Paradox and its Solution with Virtual Objects 1989 30 IPL Staunstrup & Nievergelt, The Behavior of Shared Objects: Concepts, Pitfalls, and a New Model 1989 30 IPL Culik, Variations of the Firing Squad Problem and Applications 1989 30 IPL Ehlers & von Solms, Using Random Context Structure Grammars to Represent Chemical Structures 1989 30 IPL Fleischer, Communication Complexity of Multi-processor Systems 1989 30 IPL Wong & Morris, A New Approach to Choosing Initial Points in Local Search 1989 30 IPL Kim & Park & Kim, A Model of Distributed Control: Dependency and Uncertainty 1989 30 IPL Consel & Danvy, Partial Evaluation of Pattern Matching in Strings 1989 30 IPL Shonkwiler, An Image Algorithm for Computing the Hausdorff Distance Efficiently in Linear Time 1989 30 IPL Mihail, On Coupling and the Approximation of the Permanent 1989 30 IPL Martel & Gusfield, A Fast Parallel Quicksort Algorithm 1989 30 IPL van Emde Boas, Space Measures for Storage Modification Machines 1989 30 IPL Foster & Greenberg, Lower Bounds on the Area of Finite-state Machines 1989 30 IPL Salowe, L-infinity Interdistance Selection by Parametric Search 1989 30 IPL Roth, A Note on Word Chains and Regular Languages 1989 30 IPL Darondeau, Bisimulation and Effectiveness 1989 30 IPL Sandhu, The Reflected Tree Hierarchy for Protection and Sharing 1989 30 IPL Lingas & Karpinski, Subtree Isomorphism is NC Reducible to Bipartite Perfect Matching 1989 30 IPL Chakrabarti & Ghose & Pandey & De Sarkar, Increasing Search Efficiency Using Multiple Heuristics 1989 30 IPL Turan, Lower Bounds for Synchronous Circuits and Planar Circuits 1989 30 IPL Galil & Pan, Parallel Evaluation of the Determinant and of the Inverse of a Matrix 1989 30 IPL Gereb-Graus & Paturi & Szemeredi, There are No p-Complete Families of Symmetric Boolean Functions 1989 30 IPL Hehner, Real-time Programming 1988 29 IPL Majster-Cederbaum, On the Uniqueness of Fixed Points of Endofunctors in a Category of Complete Metric Spaces 1988 29 IPL Waxman & Imase, Worst-Case Performance of Rayward-Smith's Steiner Tree Heuristic 1988 29 IPL Olariu, On the Unimodality of Convex Polygons 1988 29 IPL Morgan, Auxiliary Variables in Data Refinement 1988 29 IPL Guessarian & Priese, On the Minimal Number of X Operators to Model Regularity in Fair SCCS 1988 29 IPL Lamb, Benign Side Effects 1988 29 IPL Shankar & Ramachandran, Efficient Parallel Circuits and Algorithms for Division 1988 29 IPL Moriya, Closure Property of Principal Cones under Substitution 1988 29 IPL Veroy, Average Complexity of Divide-and-Conquer Algorithms 1988 29 IPL Hagerup, On Saving Space in Parallel Computation 1988 29 IPL Gallo & Scutella, Polynomially Solvable Satisfiability Problems 1988 29 IPL Boom, Lazy Variable-Renumbering Makes Substitution Cheap 1988 29 IPL Veroy, Optimal Search Algorithm for a Minimum of a Discrete Periodic Bimodal Function 1988 29 IPL Schorn, A Canonical Simplifier for Trigonometric Expressions in the Kinematic Equation 1988 29 IPL Ozguner & Aykanat, A Reconfiguration Algorithm for Fault Tolerance in a Hypercube Multiprocessor 1988 29 IPL Chrobak & Harter, A Note on Random Sampling 1988 29 IPL McCune, Un-Skolemizing Clause Sets 1988 29 IPL Sharir, The Shortest Watchtower and Related Problems for Polyhedral Terrains 1988 29 IPL d'Atri & Moscarini, On Hypergraph Acyclicity and Graph Chordality 1988 29 IPL Dublish, An O(n^3) Algorithm for Finding the Minimal Opaque Forest of a Convex Polygon 1988 29 IPL Nawrocki & Urbanski, Fixed-sized Blocks Optimization 1988 29 IPL Bozapalidis & Ioulidis, Varieties of Formal Series on Trees and Eilenberg's Theorem 1988 29 IPL Cho & Huynh, On a Complexity Hierarchy between L and NL 1988 29 IPL Ouksel & Scheuermann, Implicit Data Structures for Linear Hashing Schemes 1988 29 IPL Park & Park & Kim, Efficient Backward Execution in AND/OR Process Model 1988 29 IPL Leiss, On the Degree of Dominator Trees 1988 29 IPL Kruseman Aretz, On a Recursive Ascent Parser 1988 29 IPL Schreiber & Rosolini, An Algebraic Description of Some State-dependent Failure Mechanisms 1988 29 IPL HCB_tree: A Height Compressed B_tree for Parallel Processing 1988 29 IPL Ibarra & Jiang & Ravikumar, Some Subclasses of Context-free Languages in NC^1 1988 29 IPL Shannon, A Linear-Processor Algorithm for Depth-first Search in Planar Graphs 1988 29 IPL Narendran & Otto, Preperfectness is Undecidable for Thue Systems Containing Only Length-Reducing Rules and a Single Commutation Rule 1988 29 IPL Vossen, A New Characterization of FD Implementation with an Application to Update Anomalies 1988 29 IPL Bodlaender, The Complexity of Finding Uniform Emulations on Fixed Graphs 1988 29 IPL Van den Broek, Confluence of Indirection Reductions in Graph Rewrite Systems 1988 29 IPL Haldar & Subramanian, Ring Based Termination Detection Algorithm for Distributed Computations 1988 29 IPL Korel & Laski, Dynamic Program Slicing 1988 29 IPL Arnold & Crubille, A Linear Algorithm to Solve Fixed-point Equations on Transition Systems 1988 29 IPL Szalas, An Incompleteness Result in Process Algebra 1988 29 IPL Rytter, On Efficient Parallel Computations of Costs of Paths on a Grid Graph 1988 29 IPL Hoffmann & Kriegel, Embedding Rectilinear Graphs in Linear Time 1988 29 IPL Blikle, A Guided Tour of the Mathematics of MetaSoft'88 1988 29 IPL Watjen & Unruh, On the Degree of Synchronization of k1T0L and k1ET0L Systems 1988 29 IPL De Luca & Pelagalli & Varricchio, Test Sets for Languages of Infinite Words 1988 29 IPL Louka & Tchuente, Dynamic Programming on Two-dimensional Systolic Arrays 1988 29 IPL Mittal, A Fast Backtrack Algorithm for Graph Isomorphism 1988 29 IPL Minoux, LTUR: A Simplified Linear-Time Unit Resolution Algorithm for Horn Formulae and Computer Implementation 1988 29 IPL Huang, A Fully Distributed Termination Detection Scheme 1988 29 IPL Raoult, Proving Open Properties by Induction 1988 29 IPL Reichling, On the Detection of a Common Intersection of k Convex Objects in the Plane 1988 29 IPL Burton & McKeown & Rayward-Smith, On Process Assignment in Parallel Computing 1988 29 IPL Makinen, On Linear Search Heuristics 1988 29 IPL Atkinson & Santoro, A Practical Algorithm for Boolean Matrix Multiplication 1988 29 IPL Kessels, An Exercise in Proving Self-Stabilization with a Variant Function 1988 29 IPL Sassa & Nakata, Time-optimal Short-circuit Evaluation of Boolean Expressions 1988 29 IPL Arora & Gupta, More Comments on ``Distributed Termination Detection Algorithm for Distributed Computations'' (letter) 1988 28 IPL Bertossi, On the Domatic Number of Interval Graphs 1988 28 IPL Wang & Kuo, A Study on Two Geometric Location Problems 1988 28 IPL Vidyasankar, Converting Lamport's Regular Register to Atomic Register 1988 28 IPL Hartmanis & Hemachandra, On Sparse Oracles Separating Feasible Complexity Classes 1988 28 IPL Chen & Yu & Liu, Two Algorithms for Constructing a Binary Tree from Its Traversals 1988 28 IPL Ho & Lee, Efficient Parallel Algorithms for Finding Maximal Cliques, Clique Trees, and Minimum Coloring on Chordal Graphs 1988 28 IPL Liskiewicz & Lorys, Alternating Real-time Computations 1988 28 IPL Chan & Hernandez, Testing Unboundedness of Database Schemes and Functional Dependencies 1988 28 IPL Loui & Matsushita & West, Election in a Complete Network with a Sense of Direction (Corrigendum) 1988 28 IPL Mazurkiewicz, Solvability of the Asynchronous Ranking Problem 1988 28 IPL Iyer & Ratliff & Vijayan, Optimal Node Ranking of Trees 1988 28 IPL Platt & Magdy, Adaptive Control Using Switched Capacitor Filters 1988 28 IPL Li, Reconstruction of Polygons from Projections 1988 28 IPL Karloff & Paturi & Simon, Universal Traversal Sequences of Length n^O(log n) for Cliques 1988 28 IPL Romeuf, Shortest Path Under Rational Constraint 1988 28 IPL Fortnow & Sipser, Are there Interactive Protocols for co-NP Languages? 1988 28 IPL Ciaccia & Maio & Tiberio, A Unifying Approach to Evaluating Block Accesses in Database Organizations 1988 28 IPL Das & Fay, Fault-Tolerant and Flexible Interconnection of Multiple Processors 1988 28 IPL Miller & Gadia & Kothari & Liu, Completeness Issues for Join Dependencies Derived from the Universal Relation Join Dependency 1988 28 IPL O'Dunlaing, A Tight Lower Bound for the Complexity of Path-Planning for a Disc 1988 28 IPL Imase & Manabe, Fault-Tolerant Routings in a kappa-Connected Network 1988 28 IPL Chung & Krishnamoorthy, Algorithms of Placing Recovery Points 1988 28 IPL Du & Leung, Scheduling Tree-structured Tasks with Restricted Execution Times 1988 28 IPL Rosenkrantz & Hunt, Matrix Multiplication for Finite Algebraic Systems 1988 28 IPL Takada, Grammatical Inference for Even Linear Languages Based on Control Sets 1988 28 IPL Chen & Lai, Preemptive Scheduling of Independent Jobs on a Hypercube 1988 28 IPL Brassard & Kannan, The Generation of Random Permutations on the Fly 1988 28 IPL Suzuki, Proving Properties of a Ring of Finite-State Machines 1988 28 IPL Inoue & Takanami, Some Considerations about NPRIORITY(1) without ROM 1988 28 IPL Brandwajn, Load Imbalance in DASD Dynamic Reconnection 1988 28 IPL Mishra, Strictness Analysis of the Untyped lambda-Calculus 1988 28 IPL Aguilar-Martin & Alsina, Characterizations of Some Rescaling Functions 1988 28 IPL Weiss & Sedgewick, Bad Cases for Shaker-Sort 1988 28 IPL Morrison, Parallel p-adic Computation 1988 28 IPL Luccio & Pietracaprina & Pucci, A Probabilistic Simulation of PRAMs on a Bounded Degree Network 1988 28 IPL Chan & Chung, Optimal Multidisk Partial Match File Designs 1988 28 IPL Ural & Yang, A Structural Test Selection Criterion 1988 28 IPL Kirchherr, Transposition of an lxl Matrix Requires Omega(log l) Reversals on Conservative Turing Machines 1988 28 IPL Gazit & Miller, An Improved Parallel Algorithm that Computes the BFS Numbering of a Directed Graph 1988 28 IPL Dehne & Stojmenovic, An O(sqrt(n)) Time Algorithm for the ECDF Searching Problem for Arbitrary Dimensions on a Mesh-of-Processors 1988 28 IPL Pan, Computing the Determinant and the Characteristic Polynomial of a Matrix via Solving Linear Systems of Equations 1988 28 IPL Engelfriet & Hoogeboom, Prefix and Equality Languages of Rational Functions are Co-context-free 1988 28 IPL Bovet & De Agostino & Petreschi, Parallelism and the Feedback Vertex Set Problem 1988 28 IPL Auffray, Linear Strategy for Propositional Modal Resolution 1988 28 IPL Ebert, Computing Eulerian Trails 1988 28 IPL Anderson & Gouda, Atomic Semantics of Nonatomic Programs 1988 28 IPL Schevon & Vitter, A Parallel Algorithm for Recognizing Unordered Depth-first Search 1988 28 IPL Latteux & Timmerman, Bifaithful Starry Transductions 1988 28 IPL Italiano, Finding Paths and Deleting Edges in Directed Acyclic Graphs 1988 28 IPL Szpankowski, The Evaluation of an Alternative Sum with Applications to the Analysis of Some Data Structures 1988 28 IPL Lamb & Dawes, Testing for Class Membership in Multi-parent Hierarchies 1988 28 IPL Rolim & Greibach, On the IO-Complexity and Approximation Languages 1988 28 IPL Jedrzejowicz, Infinite Hierarchy of Expressions Containing Shuffle Closure Operator 1988 28 IPL Chin & Ntafos, Optimum Watchman Routes 1988 28 IPL Dwelly, Synchronizing the I/O Behavior of Functional Programs with Feedback 1988 28 IPL Olariu, Paw-free Graphs 1988 27 IPL Matousek, Line Arrangements and Range Search 1988 27 IPL De Luca & Varricchio, On the Factors of the Thue-Morse Word on Three Symbols 1988 27 IPL Bodlaender, A Better Lower Bound for Distributed Leader Finding in Bidirectional, Asynchronous Rings of Processors 1988 27 IPL Hsu & Madnick, Shifting Timestamps for Concurrency Control in an Information Hierarchy 1988 27 IPL Kutten, Optimal Fault-tolerant Distributed Construction of a Spanning Forest 1988 27 IPL Orlowska, Proof System for Weakest Prespecification 1988 27 IPL Sridhar, On the Connectivity of the De Bruijn Graph 1988 27 IPL Huang, A Lower Bound for the Edit-Distance Problem under an Arbitrary Cost Function 1988 27 IPL Fernandez-Baca, Nonserial Dynamic Programming Formulations of Satisfiability 1988 27 IPL Sakkinen, Comments on ``Manipulation of Data Structures without Pointers'' 1988 27 IPL Savage, Recognizing Majority on a One-way Mesh 1988 27 IPL Jung & Mehlhorn, Parallel Algorithms for Computing Maximal Independent Sets in Trees and for Updating Minimum Spanning Trees 1988 27 IPL Krishnaprasad, On the Computability of Circumscription 1988 27 IPL Weems, A Study of Page Arrangements for Extendible Hashing 1988 27 IPL Kumar & Malhotra, A New Computation Rule for PROLOG 1988 27 IPL Itano & Sato & Hirai & Yamagata, An Incremental Pattern Matching Algorithm for the Pipelined Lexical Scanner 1988 27 IPL Gabow & Tarjan, A Linear-Time Algorithm for Finding a Minimum Spanning Pseudoforest 1988 27 IPL Krivanek, The Complexity of Ultrametric Partitions on Graphs 1988 27 IPL Ramalingam & Pandu Rangan, A Unified Approach to Domination Problems on Interval Graphs 1988 27 IPL Tsin, On Handling Vertex Deletion in Updating Minimum Spanning Trees 1988 27 IPL Ramarao & Daley & Melhem, Message Complexity of the Set Intersection Problem 1988 27 IPL Rohnert, Time and Space Efficient Algorithms for Shortest Paths between Convex Polygons 1988 27 IPL Koo & Toueg, Effects of Message Loss on the Termination of Distributed Protocols 1988 27 IPL Faigle & Schrader, On the Convergence of Stationary Distributions in Simulated Annealing Algorithms 1988 27 IPL Esfahanian & Hakimi, On Computing a Conditional Edge-Connectivity of a Graph 1988 27 IPL Szepietowski, Remarks on Languages Acceptable in log log n Space 1988 27 IPL Roelants van Baronaigien & Ruskey, Generating t-ary Trees in A-Order 1988 27 IPL Bugrara & Purdom, An Exponential Lower Bound for the Pure Literal Rule 1988 27 IPL Holenderski & Szalas, Propositional Description of Finite Cause-Effect Structures 1988 27 IPL Johnson & Yannakakis & Papadimitriou, On Generating All Maximal Independent Sets 1988 27 IPL Mehlhorn, A Faster Approximation Algorithm for the Steiner Problem in Graphs 1988 27 IPL Chandran & Rosenfeld, Order Statistics on a Hypercube 1988 27 IPL Bertossi, Parallel Circle-cover Algorithms 1988 27 IPL Cook & Luby, A Simple Parallel Algorithm for Finding a Satisfying Truth Assignment to a 2-CNF Formula 1988 27 IPL Berman & Blok, Positive Boolean Dependencies 1988 27 IPL Watanabe, On Hardness of One-way Functions 1988 27 IPL Leszczylowski & Bonnier & Maluszynski, Logic Programming with External Procedures: Introducing S-Unification 1988 27 IPL Chlebus, A Parallel Bucket Sort 1988 27 IPL Witaszek, A Practical Method for Finding the Optimum Postponement Transformation for LR(k) Parsers 1988 27 IPL Singhal & Yesha, A Polynomial Algorithm for Computation of the Probability of Conflicts in a Database under Arbitrary Data Access Distribution 1988 27 IPL Miyano, A Parallelizable Lexicographically First Maximal Edge-induced Subgraph Problem 1988 27 IPL Chang & Chang, An Ordered Minimal Perfect Hashing Scheme with Single Parameter 1988 27 IPL Liu & Ntafos, On Decomposing Polygons into Uniformly Monotone Parts 1988 27 IPL Baader, A Note on Unification Type Zero 1988 27 IPL Sandhu, Cryptographic Implementation of a Tree Hierarchy for Access Control 1988 27 IPL Patterson & Supowit, Finding the Vertices Nearest to a Point in a Hypercube 1988 27 IPL Frieze, On the Random Construction of Heaps 1988 27 IPL Balakrishnan & Sutarwala & Majumdar & Banerji & Linders & Majithia, A Semantic Approach for Modular Synthesis of VLSI Systems 1988 27 IPL Li, A Separator Theorem for One-dimensional Graphs under Linear Mapping 1988 27 IPL Atallah & Frederickson & Kosaraju, Sorting with Efficient Use of Special-purpose Sorters 1988 27 IPL Ramalingam & Pandu Rangan, Total Domination in Interval Graphs Revisited 1988 27 IPL Lyon, A Tagless Marking that is Linear over Subtrees 1988 27 IPL Josephs, The Data Refinement Calculator for Z Specifications 1988 27 IPL Lea, Digital and Hilbert k-d Trees 1988 27 IPL Gibbons & Israeli & Rytter, Parallel O(log n) Time Edge-colouring of Trees and Halin Graphs 1988 27 IPL Chang & Ibarra & Ravikumar & Berman, Some Observations Concerning Alternating Turing Machines Using Small Space (Erratum) 1988 26 IPL Gopalakrishnan & Srivas, Implementing Functional Programs Using Mutable Abstract Data Types 1988 26 IPL Chan, The Boundedness Problem for Three-Dimensional Vector Addition Systems with States 1988 26 IPL Maggs & Plotkin, Minimum-Cost Spanning Tree as a Path-Finding Problem 1988 26 IPL Cole, An Optimally Efficient Selection Algorithm 1988 26 IPL Cidon, Yet Another Distributed Depth-First-Search Algorithm 1988 26 IPL Karlsson & Overmars, Normalized Divide-and-Conquer: A Scaling Technique for Solving Multi-dimensional Problems 1988 26 IPL Czaja, Cause-Effect Structures 1988 26 IPL Bezem & van Leeuwen, On Estimating the Complexity of Logarithmic Decompositions 1988 26 IPL Gilbert, Some Nested Dissection Order is Nearly Optimal 1988 26 IPL Arbib, A Polynomial Characterization of Some Graph Partitioning Problems 1988 26 IPL Culik & Karhumaki, On Totalistic Systolic Networks 1988 26 IPL Sieminski, Fast Decoding of the Huffman Codes 1988 26 IPL Morgan, Data Refinement by Miracles 1988 26 IPL Dymond, Input-driven Languages are in log n Depth 1988 26 IPL Soisalon-Soininen & Tarhio, Looping LR Parsers 1988 26 IPL Hinrichs & Nievergelt & Schorn, Plane-Sweep Solves the Closest Pair Problem Elegantly 1988 26 IPL De Vel & Krishnamurthy, An Iterative Pipelined Array Architecture for the Generalized Matrix Inversion 1988 26 IPL Cook, Short Propositional Formulas Represent Nondeterministic Computations (Note) 1988 26 IPL Makinen, On the Rotation Distance of Binary Trees (Note) 1988 26 IPL Seiferas, A Variant of Ben-Or's Lower Bound for Algebraic Decision Trees (Note) 1987 26 IPL Apt & Bouge & Clermont, Two Normal Form Theorems for CSP Programs 1987 26 IPL Goodrich, Finding the Convex Hull of a Sorted Point Set in Parallel 1987 26 IPL Martin, Extension Functions for Multiset Orderings 1987 26 IPL Pinter & Wolfstahl, Embedding Ternary Trees in VLSI Arrays 1987 26 IPL Guntzer & Paul, Jump Interpolation Search Trees and Symmetric Binary Numbers 1987 26 IPL Takaoka, A Decomposition Rule for the Hoare Logic 1987 26 IPL Apostolico & Hambrusch, Finding Maximum Cliques on Circular-Arc Graphs 1987 26 IPL Baleanu & Tomescu, An Architecture for Symbolic Processing 1987 26 IPL Szalas, Arithmetical Axiomatization of First-order Temporal Logic 1987 26 IPL Sykora & Vrto, Tight Chip Area Lower Bounds for String Matching 1987 26 IPL Zhu & Loh & Siy, towards the Minimum Set of Primitive Relations in Temporal Logic 1987 26 IPL Hou, Trinity Algebra and Its Application to Machine Decompositions 1987 26 IPL Sajeev & Olszewski, Manipulation of Data Structures without Pointers 1987 26 IPL Moran & Wolfstahl, Extended Impossibility Results for Asynchronous Complete Networks 1987 26 IPL Hastad, One-way Permutations in NC^0 1987 26 IPL Fellows & Langston, Nonconstructive Advances in Polynomial-time Complexity 1987 26 IPL Balsters, Comments on ``A Deficiency of Natural Deduction'' (letter) 1987 26 IPL Metivier & Ochmanski, On Lexicographic Semi-Commutations 1987 26 IPL Shen & Edelsbrunner, A Tight Lower Bound on the Size of Visibility Graphs 1987 26 IPL Rusinowitch, On Termination of the Direct Sum of Term-Rewriting Systems 1987 26 IPL Mirzaian, A Halving Technique for the Longest Stuttering Subsequence Problem 1987 26 IPL Magott, Performance Evaluation of Concurrent Systems Using Conflict-free and Persistent Petri Nets 1987 26 IPL Galil & Yung, Partitioned Encryption and Achieving Simultaneity by Partitioning 1987 26 IPL Mathieu & Puech & Yahia, Average Efficiency of Data Structures for Binary Image Processing 1987 26 IPL Subramanian & Siromoney & Abisha, A D0L-T0L Public Key Cryptosystem 1987 26 IPL Gupta & Hambrush, Optimal Three-Dimensional Layouts of Complete Binary Trees 1987 26 IPL Thazhuthaveetil & Pleszkun, On the Structural Locality of Reference in LISP List Access Streams 1987 26 IPL Jaumard & Simeone, On the Complexity of the Maximum Satisfiability Problem for Horn Formulas 1987 26 IPL Driscoll & Lang & Franklin, Modeling B-Tree Insertion Activity 1987 26 IPL Berztiss, A Notation for Distributed Operations 1987 26 IPL Berstel & Brlek, On the Length of Word Chains 1987 26 IPL Book & Liu, Rewriting Systems and Word Problems in a Free Partially Commutative Monoid 1987 26 IPL Carlsson, The Deap--A Double-ended Heap to Implement Double-ended Priority Queues 1987 26 IPL Incerpi & Sedgewick, Practical Variations of Shellsort 1987 26 IPL Bermond & Fourneau & Jean-Marie, Equivalence of Multistage Interconnection Networks 1987 26 IPL Babai, Random Oracles Separate PSPACE from the Polynomial-Time Hierarchy 1987 25 IPL Krause & Larmore & Volper, Packing Items from a Triangular Distribution 1987 25 IPL Jedrzejowicz, Nesting of Shuffle Closure is Important 1987 25 IPL Pallo, On the Rotation Distance in the Lattice of Binary Trees 1987 25 IPL Baeza-Yates, Some Average Measures in m-ary Search Trees 1987 25 IPL Moran, Generalized Lower Bounds Derived from Hastad's Main Lemma 1987 25 IPL Kunde & Steppat, On the Worst-Case Ratio of a Compound Multiprocessor Scheduling Algorithm 1987 25 IPL Vrto, The Area-Time Complexity of the VLSI Counter 1987 25 IPL Peper, Determining Connected Components in Linear Time by a Linear Number of Processors 1987 25 IPL Kelter, The Complexity of Strict Serializability Revisited 1987 25 IPL Kobuchi, A Note on Symmetrical Cellular Spaces 1987 25 IPL Pawagi & Gopalakrishnan & Ramakrishnan, Computing Dominators in Parallel (Corrigendum) 1987 25 IPL Raghavan & Venkatesan, On Bounds for a Board Covering Problem 1987 25 IPL Salowe & Steiger, Stable Unmerging in Linear Time and Constant Space 1987 25 IPL Venkatesh & Radhakrishnan & Li, Optimal Checkpointing and Local Recording for Domino-free Rollback Recovery 1987 25 IPL Nawrocki & Martinek, A Storage Allocation Method with Invalidating Dangling References 1987 25 IPL Calude, Super-Exponentials Nonprimitive Recursive, but Rudimentary 1987 25 IPL Ravi & Hunt, An Application of the Planar Separator Theorem to Counting Problems 1987 25 IPL Gries & Stojmenovic, A Note on Graham's Convex Hull Algorithm 1987 25 IPL Zhu & Cheung, A New Distributed Breadth-First-Search Algorithm 1987 25 IPL Suros & Montagne, Fitted Diagonals for Reducing I/O Bandwidth in Systolic Systems 1987 25 IPL Friedberg & Peterson, An Efficient Solution to the Mutual Exclusion Problem Using Weak Semaphores 1987 25 IPL Tel & van Leeuwen, Comments on ``A Distributed Algorithm for Distributed Termination'' 1987 25 IPL Autebert & Flajolet & Gabarro, Prefixes of Infinite Words and Ambiguous Context-free Languages 1987 25 IPL Brustmann & Wegener, The Complexity of Symmetric Functions in Bounded-Depth Circuits 1987 25 IPL Ochmanski, Inevitability in Concurrent Systems 1987 25 IPL Kemp, A Note on the Number of Leftist Trees 1987 25 IPL Wiltink, A Deficiency of Natural Deduction 1987 25 IPL Apostolico, Remark on the Hsu-Du New Algorithm for the Longest Common Subsequence Problem 1987 25 IPL Gries & Pascoletti & Sbriz, Horner's Rule and the Computation of Linear Recurrences 1987 25 IPL Goldberg & Plotkin, Parallel (Delta + 1)-Coloring of Constant-Degree Graphs 1987 25 IPL Levcopoulos, An Omega(sqrt(n)) Lower Bound for the Nonoptimality of the Greedy Triangulation 1987 25 IPL Reichling, A Simplified Solution of the n Queens' Problem 1987 25 IPL Buda, Multiprocessor Automata 1987 25 IPL Bhatt & Cosmadakis, The Complexity of Minimizing Wire Lengths in VLSI Layouts 1987 25 IPL Fries & Mehlhorn & Naher & Tsakalidis, A log log n Data Structure for Three-sided Range Queries 1987 25 IPL Appel, Garbage Collection Can Be Faster Than Stack Allocation 1987 25 IPL Toyama, Counterexamples to Termination for the Direct Sum of Term Rewriting Systems 1987 25 IPL Verjus, On the Proof of a Distributed Algorithm 1987 25 IPL Dillencourt, A Non-Hamiltonian, Nondegenerate Delaunay Triangulation 1987 25 IPL Lai & Yang, On Distributed Snapshots 1987 25 IPL Klapper, A Lower Bound on the Complexity of the Convex Hull Problem for Simple Polyhedra 1987 25 IPL Babaoglu, Stopping Times of Distributed Consensus Protocols: A Probabilistic Analysis 1987 25 IPL Kawai, Local Authentication in Insecure Environments 1987 25 IPL Fischer & Immerman, Interpreting Logics of Knowledge in Propositional Dynamic Logic with Converse 1987 25 IPL Chung & Cho, History Sensitive String for Multiple Alphabets 1987 25 IPL Tse, On the Detection of Unstructuredness in Flowgraphs 1987 25 IPL Zobel, Transformations for Communication Fairness in CSP 1987 25 IPL Alexandridis & Tsanakas, An Encoding Scheme for the Efficient Representation of Hierarchical Image Structures 1987 25 IPL Morris, Varieties of Weakest Liberal Preconditions 1987 25 IPL Hoare & Jifeng & Sanders, Prespecification in Data Refinement 1987 25 IPL Katajainen & Nevalainen & Teuhola, A Linear Expected-Time Algorithm for Computing Planar Relative Neighborhood Graphs 1987 25 IPL Atallah & Bajaj, Efficient Algorithms for Common Transversals 1987 25 IPL Broy, Predicative Specifications for Functional Programs Describing Communicating Networks 1987 25 IPL Lakshmanan & Meenakshi & Thulasiraman, A Time-Optimal Message-Efficient Distributed Algorithm for Depth-First-Search 1987 25 IPL Frieze, Parallel Algorithms for Finding Hamilton Cycles in Random Graphs 1987 25 IPL Maley, An Observation Concerning Constraint-Based Compaction 1987 25 IPL Rayward-Smith, The Complexity of Preemptive Scheduling Given Interprocessor Communication Delays 1987 25 IPL Boppana & Hastad & Zachos, Does co-NP Have Short Interactive Proofs? 1987 25 IPL Tennent, Quantification in Algol-like Languages 1987 25 IPL Mints & Tyugu, Semantics of a Declarative Language (Corrigendum) 1987 25 IPL Chang & Ibarra & Ravikumar & Berman, Some Observations Concerning Alternating Turing Machines Using Small Space 1987 25 IPL Melkman, On-line Construction of the Convex Hull of a Simple Polyline 1987 25 IPL Kirsig & Lange, Separation with the Ruzzo, Simon, and Tompa Relativization Implies DSPACE(log n) \ne NSPACE(log n) 1987 25 IPL Hamlet, Probable Correctness Theory 1987 25 IPL Howell & Rosier & Yen, An O(n^1.5) Algorithm to Decide Boundedness for Conflict-free Vector Replacement Systems 1987 25 IPL Cybenko & Krumme & Venkataraman, Fixed Hypercube Embedding 1987 25 IPL Laumond, Obstacle Growing in a Nonpolygonal World 1987 25 IPL Naor, A Fast Parallel Coloring of Planar Graphs with Five Colors 1987 25 IPL Wang & Tsin, An O(log n) Time Parallel Algorithm for Triangulating a Set of Points in the Plane 1987 25 IPL Hyslop & Lamagna, Performance of Distributive Partitioned Sort in a Demand Paging Environment 1987 25 IPL Reif, A Topological Approach to Dynamic Graph Connectivity 1987 24 IPL Muller, Sorting Numbers Using Limited Systolic Coprocessors 1987 24 IPL Gottlob, On the Size of Nonredundant FD-Covers 1987 24 IPL Szepietowski, There are no Fully Space Constructible Functions between log log n and log n 1987 24 IPL Parberry, An Improved Simulation of Space and Reversal Bounded Deterministic Turing Machines by Width and Depth Bounded Uniform Circuits 1987 24 IPL Samet & Shaffer & Webber, Digitizing the Plane with Cells of Nonuniform Size 1987 24 IPL Blumer & Ehrenfeucht & Haussler & Warmuth, Occam's Razor 1987 24 IPL Bajantri & Skillicorn, A Fast Multiprocessor Message Passing Implementation 1987 24 IPL Fraser & Hanson, Optimization of Argument Evaluation Order 1987 24 IPL Marie & Trivedi, A Note on the Effect of Preemptive Policies on the Stability of a Priority Queue 1987 24 IPL Wright, A Note on External Sorting Using Almost Single Input Buffering 1987 24 IPL Sridhar, A New Algorithm for Parallel Solution of Linear Equations 1987 24 IPL Edelsbrunner & Overmars, Zooming by Repeated Range Detection 1987 24 IPL Madlener & Otto, Using String-Rewriting for Solving the Word Problem for Finitely Presented Groups 1987 24 IPL Asano & Asano & Imai, Shortest Path Between Two Simple Polygons 1987 24 IPL Atkinson & Chang, Computing the Number of Mergings with Constraints 1987 24 IPL Hazari & Zedan, A Distributed Algorithm for Distributed Termination 1987 24 IPL Koch, Automating the Semantic Component 1987 24 IPL Hirschberg & Volper, Improved Update/Query Algorithms for the Interval Valuation Problem 1987 24 IPL Chang & Gonnet & Rotem, On the Costs of Self-Stabilization 1987 24 IPL Valentine & Davis, The Automated Solution of Logic Puzzles 1987 24 IPL Chrobak & Rytter, Remarks on String-Matching and One-Way Multihead Automata 1987 24 IPL Tennent, A Note on Undefined Expression Values in Programming Logics 1987 24 IPL Widmayer & Wood, Time- and Space-optimal Contour Computation for a Set of Rectangles 1987 24 IPL Dillencourt, Traveling Salesman Cycles are not Always Subgraphs of Delaunay Triangulations or of Minimum Weight Triangulations 1987 24 IPL Kennaway & Sleep, Variable Abstraction in O(n log n) Space 1987 24 IPL Van de Snepscheut, ``Algorithms for On-the-Fly Garbage Collection'' Revisited 1987 24 IPL Pawagi & Gopalakrishnan & Ramakrishnan, Computing Dominators in Parallel 1987 24 IPL Van Leijenhorst, A Note on the Formula Size of the ``mod k'' Functions 1987 24 IPL Zubair & Madan, Time Efficient Systolic Architecture for Matrix * Vector Multiplication 1987 24 IPL Bini & Pan, A Logarithmic Boolean Time Algorithm for Parallel Polynomial Division 1987 24 IPL Edenbrandt, Chordal Graph Recognition is in NC 1987 24 IPL Ramanan, Obtaining Lower Bounds Using Artificial Components 1987 24 IPL Carlsson, A Variant of Heapsort with Almost Optimal Number of Comparisons 1987 24 IPL Golumbic, A General Method for Avoiding Cycling in a Network 1987 24 IPL Meira, Strict Combinators 1987 24 IPL Blazewicz & Finke, Minimizing Mean Weighted Execution Time Loss on Identical and Uniform Processors 1987 24 IPL Horspool & Levy, Correctness of an Extended Operator-Precedence Parsing Algorithm 1987 24 IPL Ruby, A Liveness Property of a Parallel Algorithm 1987 24 IPL Szwarcfiter, A Note on the Computation of the k-Closure of a Graph 1987 24 IPL Kubale, The Complexity of Scheduling Independent Two-Processor Tasks on Dedicated Processors 1987 24 IPL Krentel, A Note on the Transaction Backout Problem 1987 24 IPL Anstee, A Polynomial Algorithm for b-Matchings: An Alternative Approach 1987 24 IPL Roussille & Dufour, Generation of Convex Polygons with Individual Angular Constraints 1987 24 IPL McColl & Paterson, The Planar Realization of Boolean Functions 1987 24 IPL Huynh, On Solving Hard Problems by Polynomial-size Circuits 1987 24 IPL Grune, How to Compare the Incomparable 1987 24 IPL Castan & Durand & Lemaitre, A Set of Combinators for Abstraction in Linear Space 1987 24 IPL Van Leijenhorst & Van der Weide, On a Recursion Connected with Tree Balancing Algorithms 1987 24 IPL Akman, An Algorithm for Determining an Opaque Minimal Forest of a Convex Polygon 1987 24 IPL Raynal, A Distributed Algorithm to Prevent Mutual Drift between n Logical Clocks 1987 24 IPL Pitt, A Note on Extending Knuth's Tree Estimator to Directed Acyclic Graphs 1987 24 IPL Evans & Yousif, Explicit Solution of Block Tridiagonal Systems of Linear Equations 1987 24 IPL Slusarek, An Off-line Storage Algorithm 1987 24 IPL Emerson, Uniform Inevitability is Tree Automaton Ineffable 1987 24 IPL Grazon, An Infinite Word Language Which is Not Co-CFL 1987 24 IPL Wolfson, Concurrent Execution of Transaction Copies 1987 24 IPL Field, A Note on a New Data Structure for In-the-Past Queries 1987 24 IPL Rey & Ward, On Determining the On-line Minimax Linear Fit to a Discrete Point Set in the Plane 1987 24 IPL Korel, The Program Dependence Graph in Static Program Testing 1987 24 IPL Gottlob, Subsumption and Implication 1987 24 IPL Sassa & Nakata, A Simple Realization of LR-Parsers for Regular Right Part Grammars 1987 24 IPL Anderson & Mayr, Parallelism and the Maximal Path Problem 1987 24 IPL Hoare & He, The Weakest Prespecification 1987 24 IPL Yannakakis & Gavril, The Maximum k-Colorable Subgraph Problem for Chordal Graphs 1987 24 IPL Pujari & Gupta, Letter to the Editor: Comment on ``Worst-Case Choice for the Stable Marriage Problem'' 1987 24 IPL Alexandrakis & Bozapalidis, Weighted Grammars and Kleene's Theorem 1987 24 IPL Kurtz & O'Donnell & Royer, How to Prove Representation-Independent Independence Results 1987 24 IPL Feijen & Van Gasteren & Gries, In-Situ Inversion of a Cyclic Permutation 1987 24 IPL Kim & Chwa, An O(n log n log log n) Parallel Maximum Matching Algorithm for Bipartite Graphs 1987 24 IPL Hochschild, Multiple Cuts, Input Repetition, and VLSI Complexity 1987 24 IPL Finkel & Madduri, An Efficient Deadlock Avoidance Algorithm 1987 24 IPL Sassa & Ishizuka & Nakata, ECLR-Attributed Grammars: A Practical Class of LR-Attributed Grammars 1987 24 IPL Bernstein, Predicate Transfer and Timeout in Message Passing Systems 1987 24 IPL Bird & Hughes, An Alpha-Beta Algorithm: An Exercise in Program Transformation 1987 24 IPL Yuba & Hoshi, Binary Search Networks: A New Method for Key Searching 1987 24 IPL Arvind & Biswas, An O(n^2) Algorithm for the Satisfiability Problem of a Subset of Propositional Sentences in CNF that Includes All Horn Sentences 1986 23 IPL Leiss, The Inaccessible Set: A Classification by Query Type of Security Risks in Statistical Databases 1986 23 IPL Benois & Sakarovitch, On the Complexity of Some Extended Word Problems Defined by Cancellation Rules 1986 23 IPL Edelsbrunner & Welzl, Halfplanar Range Search in Linear Space and O(n^0.695) Query Time 1986 23 IPL Martin, A New Generalization of Dekker's Algorithm for Mutual Exclusion 1986 23 IPL Holenderski, The Correctness of Nondeterministic Programs Revisited 1986 23 IPL Allison & Dix, A Bit-String Longest-Common-Subsequence Algorithm 1986 23 IPL Choe & Chang, Efficient Computation of the Locally Least-Cost Insertion String for the LR Error Repair 1986 23 IPL Harary & Slater, A Linear Algorithm for the Cutting Center of a Tree 1986 23 IPL Kieburtz, When Chasing Your Tail Saves Time 1986 23 IPL Nakata & Sassa, L-Attributed LL(1)-Grammars are LR-Attributed 1986 23 IPL Sommerhalder & Van Westrhenen, A Parallel O(log n) Algorithm for the Drawing of Algebraic Curves in an n x n Square 1986 23 IPL Ambos-Spies, A Note on Complete Problems for Complexity Classes 1986 23 IPL Van de Snepscheut & Udding, An Alternative Implementation of Communication Primitives 1986 23 IPL Evans & Yousif, Merging by the Parallel Jump Searching Algorithm 1986 23 IPL Chen & Williams, The Value of an Array Facility in Prolog 1986 23 IPL Broy, Denotational Semantics of Communicating Sequential Programs 1986 23 IPL Stojanovski, A Note on Implementing Prolog in Lisp 1986 23 IPL Handley, An In Situ Distributive Sort 1986 23 IPL Makinen, A Note on Pure Grammars 1986 23 IPL Dehornoy, Turing Complexity of the Ordinals 1986 23 IPL Latteux & Timmerman, Finitely Generated omega-Languages 1986 23 IPL Alpern & Demers & Schneider, Safety without Stuttering 1986 23 IPL O'Hallaron & Reynolds, A Generalized Deadlock Predicate 1986 23 IPL Blum, Towards an Asymptotic Analysis of Karmarkar's Algorithm 1986 23 IPL Bertossi & Bonuccelli, Hamiltonian Circuits in Interval Graph Generalizations 1986 23 IPL Yamasaki & Doshita, Resolution Deduction to Detect Satisfiability for Another Class Including non-Horn Sentences in Propositional Logic 1986 23 IPL Gordon, Eliminating the Flag in Threaded Binary Search Trees 1986 23 IPL Murphy & Selkow, The Efficiency of Using k-d Trees for Finding Nearest Neighbors in Discrete Space 1986 23 IPL Corrigendum to: Sensitivity Analysis of Minimum Spanning Trees and Shortest Path Trees 1986 23 IPL Codenotti & Lotti, A VLSI Fast Solver for Tridiagonal Linear Systems 1986 23 IPL Makarov, A Noncommutative Algorithm for Multiplying 5 x 5 Matrices Using 102 Multiplications 1986 23 IPL Lai & Sprague, A Note on Anomalies in Parallel Branch-and-bound Algorithms with One-to-one Bounding Functions 1986 23 IPL Cooper & Akl, Efficient Selection on a Binary Tree 1986 23 IPL Poblete, Approximating Functions by their Poisson Transform 1986 23 IPL Bertossi, Total Domination in Interval Graphs 1986 23 IPL Szpankowski, On an Asymptotic Analysis of a Tree-type Algorithm for Broadcast Communications 1986 23 IPL Wagner, On the Intersection of the Class of Linear Context-free Languages and the Class of Single-reset Languages 1986 23 IPL Mints & Tyugu, Semantics of a Declarative Language 1986 23 IPL Taghva, Some Characterizations of Finitely Specifiable Implicational Dependency Families 1986 23 IPL Udding, Absence of Individual Starvation Using Weak Semaphores 1986 23 IPL Tan & Tel & van Leeuwen, Letter to the Editor: Comments on ``Distributed Termination Detection Algorithm for Distributed Computations'', by Arora, Rana, and Gupta 1986 23 IPL Schmeck, Corrigendum to: On the Maximum Edge Length in VLSI Layouts of Complete Binary Trees 1986 23 IPL Lavallee & Roucairol, A Fully Distributed (Minimal) Spanning Tree Algorithm 1986 23 IPL Apostolico, Improving the Worst-case Performance of the Hunt-Szymanski Strategy for the Longest Common Subsequence of Two Strings 1986 23 IPL Rohnert, Shortest Paths in the Plane with Convex Polygonal Obstacles 1986 23 IPL Hoogerwoord, An Implementation of Mutual Inclusion 1986 23 IPL Rytter, An Application of Mehlhorn's Algorithm for Bracket Languages to log(n) Space Recognition of Input-driven Languages 1986 23 IPL Laski, An Algorithm for the Derivation of Codefinitions in Computer Programs 1986 23 IPL Annot & Janssens & Van de Goor, Comments on Morris's Starvation-free Solution to the Mutual Exclusion Problem 1986 23 IPL Ntafos, On Gallery Watchmen in Grids 1986 23 IPL Franco, On the Probabilistic Performance of Algorithms for the Satisfiability Problem 1986 23 IPL Codenotti & Lotti, Area-Time Tradeoffs for Bilinear Forms Computations in VLSI 1986 23 IPL Balcazar, On Delta^P_2-Immunity 1986 23 IPL Culik & Karhumaki, A Note on the Equivalence Problem of Rational Formal Power Series 1986 23 IPL Falkowski & Schmitz, A Note on the Queens' Problem 1986 23 IPL Kakuta & Nakamura & Iida, A Parallel Reference Counting Algorithm 1986 23 IPL Lin & Shih, Long Edges in the Layouts of Shuffle-Exchange and Cube-Connected Cycles Graphs 1986 23 IPL Rytter, The Space Complexity of the Unique Decipherability Problem 1986 23 IPL Schmeck, On the Maximum Edge Length in VLSI Layouts of Complete Binary Trees 1986 23 IPL Tinhofer & Schreck, The Bounded Subset Sum Problem Is Almost Everywhere Randomly Decidable in O(n) 1986 23 IPL Vikas & Basandra, Data Algebra and its Application in Database Design 1986 22 IPL Aizawa & Nakamura, Direction-Independent Application of Productions on Two-dimensional Arrays 1986 22 IPL Alanko & Smelianski, On the Calculation of Control Transition Probabilities in a Program 1986 22 IPL Ambos-Spies, Inhomogeneities in the Polynomial-Time Degrees: The Degrees of Super Sparse Sets 1986 22 IPL Apt & Kozen, Limits for Automatic Verification of Finite-State Concurrent Systems 1986 22 IPL Arora & Rana & Gupta, Distributed Termination Detection Algorithm for Distributed Computations 1986 22 IPL Aurenhammer, The One-Dimensional Weighted Voronoi Diagram 1986 22 IPL Baumgarten & Ochsenschlager, On Termination and Phase Changes in the Presence of Unreliable Communication 1986 22 IPL Bernstein, Determining the Shape of a Convex n-Sided Polygon by Using 2n+k Tactile Probes 1986 22 IPL Berstel, Every Iterated Morphism Yields a Co-CFL 1986 22 IPL Bourret & Souza de Oliveira, Lower and Upper Bounds of the Sizes of Domains: Estimates and Experiments 1986 22 IPL Carlsson, Splitmerge--a Fast Stable Merging Algorithm 1986 22 IPL Carpi & de Luca, Square-Free Words on Partially Commutative Free Monoids 1986 22 IPL Chatelin, On Transformation of Algorithms to Multiply 2 x 2 Matrices 1986 22 IPL Chen, O(1) Space Complexity Deletion for AVL Trees 1986 22 IPL Choi & Kim, A Controlled Quantification in Parsing of Montague Grammar 1986 22 IPL Cialdea, Some Remarks on the Possibility of Extending Resolution Proof Procedures to Intuitionistic Logic 1986 22 IPL Clarkson, Linear Programming in O(n x 3^d^2) Time 1986 22 IPL Cockayne & Hewgill, Exact Computation of Steiner Minimal Trees in the Plane 1986 22 IPL Codenotti & Lotti, A Note on the VLSI Counter 1986 22 IPL Dai, EDISON-80, a Language for Modular Programming of Parallel Processes 1986 22 IPL Dehne, O(n^{1/2}) Algorithms for the Maximal Elements and ECDF Searching Problem on a Mesh-Connected Parallel Computer 1986 22 IPL Evans, Experiments with Trees for the Storage and Retrieval of Future Events 1986 22 IPL Gajewska & Tarjan, Deques with Heap Order 1986 22 IPL Gire, Two Decidability Problems for Infinite Words 1986 22 IPL Goralcik & Koubek, Verifying Nonrigidity 1986 22 IPL Grigoriadis & Kalantari, A Lower Bound to the Complexity of Euclidean and Rectilinear Matching Algorithms 1986 22 IPL Gupta & Srinivasan, Approximate Storage Utilization of B-Trees 1986 22 IPL Gusfield & Pitt, Equivalent Approximation Algorithms for Node Cover 1986 22 IPL Hamburg, Two Tagless Variations on the Deutsch-Schorr-Waite Algorithm 1986 22 IPL Hanatani & Fagin, A Simple Characterization of Database Dependency Implication 1986 22 IPL Hattori, Nonisomorphic Graphs with the Same T-Polynomial 1986 22 IPL Highnam, Optimal Algorithms for Finding the Symmetries of a Planar Point Set 1986 22 IPL Hughes, A Novel Representation of Lists and its Application to the Function ``Reverse'' 1986 22 IPL Israeli & Itai, A Fast and Simple Randomized Parallel Algorithm for Maximal Matching 1986 22 IPL Israeli & Shiloach, An Improved Parallel Algorithm for Maximal Matching 1986 22 IPL Jacobs & van Emde Boas, Two Results on Tables 1986 22 IPL Jaumard & Minoux, An Efficient Algorithm for the Transitive Closure and a Linear Worst-Case Complexity Result for a Class of Sparse Graphs 1986 22 IPL Kallay, Convex Hull Made Easy 1986 22 IPL Keil, Total Domination in Interval Graphs 1986 22 IPL Keller, Set-Theoretic Problems of Null Completion in Relational Databases 1986 22 IPL Kriauciukas, Tree-like Parse and Polynomial Subclasses of Search Problems 1986 22 IPL Krivanek, Hexagonal Unit Network--A Tool for Proving the NP-Completeness Results of Geometric Problems 1986 22 IPL Kumar & Manohar, On Probability of Forest of Quadtrees Reducing to Quadtrees 1986 22 IPL Leiss & Jitmedha, Horizontally and Vertically Bounded Propagation of Privileges 1986 22 IPL Li & Yesha, String-Matching Cannot be Done by a Two-Head One-Way Deterministic Finite Automaton 1986 22 IPL Lickteig, Gaussian Elimination is Optimal for Solving Linear Equations in Dimension Two 1986 22 IPL Lingas, The Greedy and Delauney Triangulations are not Bad in the Average Case 1986 22 IPL Loui & Matsushita & West, Election in a Complete Network with a Sense of Direction 1986 22 IPL Manolopoulos, Batched Search of Index Sequential Files 1986 22 IPL Martel, Lower Bounds on Parallel Algorithms for Finding the First Maximal Independent Set 1986 22 IPL Pan, The Trade-Off Between the Additive Complexity and the Asynchronicity of Linear and Bilinear Algorithms 1986 22 IPL Panny, A Note on the Higher Moments of the Expected Behavior of Straight Insertion Sort 1986 22 IPL Parberry, On Recurrent and Recursive Interconnection Patterns 1986 22 IPL Pawagi & Ramakrishnan, An O(log n) Algorithm for Parallel Update of Minimum Spanning Trees 1986 22 IPL Richards, Data Compression and Gray-Code Sorting 1986 22 IPL Rosier, A Note on Presburger Arithmetic with Array Segments, Permutation and Equality 1986 22 IPL Sattolo, An Algorithm to Generate a Random Cyclic Permutation 1986 22 IPL Schwer, On the Rationality of Petri Net Languages 1986 22 IPL Shock, Computing the Minimum Cover of Functional Dependencies 1986 22 IPL Snir, Exact Balancing Is Not Always Good 1986 22 IPL Stojmenovic & Soisalon-Soininen, A Note on Approximate Convex Hulls 1986 22 IPL Takaoka, An On-line Pattern Matching Algorithm 1986 22 IPL Webster & Baker, A Class of Differential Equations for Testing Variable Step-Size Integration 1985 21 IPL Alpern & Schneider, Defining Liveness 1985 21 IPL Atkinson, On Zigzag Permutations and Comparisons of Adjacent Elements 1985 21 IPL Bini & Pan, Fast Parallel Polynomial Division via Reduction to Triangular Toeplitz Matrix Inversion and to Polynomial Inversion Modulo a Power 1985 21 IPL Birkhoff, A Direct Routing Algorithm for the Bit-Reversal Permutation on a Shuffle-Exchange Network 1985 21 IPL Budd, Creation and Reflexive Rights in Grammatical Protection Systems 1985 21 IPL Codenotti & Romani & Lotti, VLSI Implementation of Fast Solvers for Band Linear Systems with Constant Coefficient Matrix 1985 21 IPL Derigs, An Efficient Dijkstra-Like Labeling Method for Computing Shortest Odd/Even Paths 1985 21 IPL Dobosiewicz, A Note on Natural Selection 1985 21 IPL Duris & Sykora & Vrt'o & Thompson, Tight Chip Area Lower Bounds for Discrete Fourier and Walsh-Hadamard Transformations 1985 21 IPL Edelsbrunner & Maurer, Finding Extreme Points in Three Dimensions and Solving the Post-Office Problem in the Plane 1985 21 IPL Guralnik & Zemach & Warnock, An Algorithm for Uniform Random Sampling of Points in and on a Hypersphere 1985 21 IPL Guting, Fast Dynamic Intersection Searching in a Set of Isothetic Line Segments 1985 21 IPL Herman & Chandy, On Distributed Search 1985 21 IPL Hromkovic, Alternating Multicounter Machines with Constant Number of Reversals 1985 21 IPL Hromkovic, Linear Lower Bounds on Unbounded Fan-In Boolean Circuits 1985 21 IPL Hsiao & Shen, k-Fold Bitonic Sort on a Mesh-Connected Parallel Computer 1985 21 IPL Ja'Ja' & Takche, Improved Lower Bounds for Some Matrix Multiplication Problems 1985 21 IPL Janiga & Koubek, A Note on Finding Minimum Cuts in Directed Planar Networks by Parallel Computations 1985 21 IPL Jantzen, A Note on a Special One-Rule Semi-Thue System 1985 21 IPL Kaldewaij, On the Decomposition of Sequences into Ascending Subsequences 1985 21 IPL Kapur & Krishnamoorthy, Worst-Case Choice for the Stable Marriage Problem 1985 21 IPL Keedy & Freisleben, On the Efficient Use of Semaphore Primitives 1985 21 IPL Kfoury, The Unwind Property for Programs with Bounded Memory 1985 21 IPL Kothari & Ramarao, General Algorithms for the Address Calculation of Lexicographically Ordered Tuples 1985 21 IPL Laumond, Enumeration of Articulation Pairs of a Planar Graph 1985 21 IPL Lautemann & Meyer auf der Heide, Lower Time Bounds for Integer Programming with Two Variables 1985 21 IPL Lee & Ching, The Power of Geometric Duality Revisited 1985 21 IPL Lumelsky, On Fast Computation of Distance Between Line Segments 1985 21 IPL Magott Performance Evaluation of Systems of Cyclic Sequential Processes with Mutual Exclusion Using Petri Nets 1985 21 IPL Mannila & Mehlhorn, A Fast Algorithm for Renaming a Set of Clauses as a Horn Set 1985 21 IPL Marchetti-Spaccamela & Romano, On Different Approximation Criteria for Subset Product Problems 1985 21 IPL Martin & Burch, Fair Mutual Exclusion with Unfair P and V Operations 1985 21 IPL Martin, The Probe: An Addition to Communication Primitives (Erratum) 1985 21 IPL Meyer, Incremental String Matching 1985 21 IPL Negri & Pelagatti, Join During Merge: An Improved Sort Based Algorithm 1985 21 IPL Nguyen, The Incompleteness of Misra and Chandy's Proof Systems 1985 21 IPL Oh & Park, A Note on Removing Loops from Table-Driven Code Generators 1985 21 IPL Pagli, Self-Adjusting Hash Tables 1985 21 IPL Rauchle & Toueg, Exposure to Deadlock for Communicating Processes is Hard to Detect 1985 21 IPL Robert & Tchuente, A Systolic Array for the Longest Common Subsequence Problem 1985 21 IPL Samet, Bidirectional Coroutines 1985 21 IPL Supowit, Decomposing a Set of Points into Chains, with Applications to Permutation and Circle Graphs 1985 21 IPL Thompson, VLSI Design with Multiple Active Layers 1985 21 IPL Vitanyi, An n^{1.618} Lower bound on the Time to Simulate One Queue or Two Pushdown Stores by One Tape 1985 21 IPL Vitanyi, Square Time is Optimal for Simulation of One Pushdown Store or One Queue by an Oblivious One-Head Tape Unit 1985 21 IPL Watjen, Feedback Automata and Their Languages 1985 21 IPL Wegener, Optimal Search with Positive Switch Cost is NP-Hard 1985 21 IPL Yokomori & Wood & Lange, A Three-Restricted Normal Form Theorem for ET0L Languages (Erratum) 1985 21 IPL Yoo, An Approach to the Transportation of Computer Software 1985 21 IPL Yung, A Secure and Useful ``Keyless Cryptosystem'' 1985 20 IPL A Note on Chains of Deterministic Pushdown Transducers 1985 20 IPL Auzins & Kinber, On Separation of the Emptiness and Equivalence Problems for Program Schemes 1985 20 IPL Awerbuch, A New Distributed Depth-First-Search Algorithm 1985 20 IPL Beauquier & Perrin, Codeterministic Automata on Infinite Words 1985 20 IPL Beynon & Iliopoulos, Computing a Basis for a Finite Abelian p-Group 1985 20 IPL Bilardi & Preparata, The VLSI Optimality of the AKS Sorting Network 1985 20 IPL Bitner, Storing Matrices on Disk for Efficient Row and Column Retrieval 1985 20 IPL Book & Otto, Cancellation Rules and Extended Word Problems 1985 20 IPL Bounas, Direct Determination of a `Seed' Binary Matrix 1985 20 IPL Chan, A Note on Redundant Disk Modulo Allocation 1985 20 IPL Cole & Yap, A Parallel Median Algorithm 1985 20 IPL Devroye, A Note on the Expected Time Required to Construct the Outer Layer 1985 20 IPL Duboc, Some Properties of Commutation in Free Partially Commutative Monoids 1985 20 IPL Harel & Peleg, More on Looping vs. Repeating in Dynamic Logic 1985 20 IPL Hartmanis, Independence Results about Context-Free Languages and Lower Bounds 1985 20 IPL Iliopoulos, Analysis of Algorithms on Problems in General Abelian Groups 1985 20 IPL Jajodia, On Equivalence of Relational and Network Database Models 1985 20 IPL Joseph, On a Problem in Real-Time Computing 1985 20 IPL Kak, How to Detect Tampering of Data 1985 20 IPL Keil, Finding Hamiltonian Circuits in Interval Graphs 1985 20 IPL Lodi & Luccio, Split Sequence Hash Search 1985 20 IPL Main, An Infinite Square-Free Co-CFL 1985 20 IPL Makinen, A Note On Undercover Relation 1985 20 IPL Makinen, An Undecidable Problem for Context-Free Grammars 1985 20 IPL Martin, The Probe: An Addition to Communication Primitives 1985 20 IPL McKeown, A Special Purpose MIMD Parallel Processor 1985 20 IPL McLean, A Comment on the `Basic Security Theorem' of Bell and LaPadula 1985 20 IPL Meira, A Linear Applicative Solution for the Set Union Problem 1985 20 IPL Mirzaian & Arjomandi, Selection in X + Y and Matrices with Sorted Rows and Columns 1985 20 IPL Morgan, Global and Logical Time in Distributed Algorithms 1985 20 IPL Njau, Details of Distortions in the Computed Fourier Transforms of Signals--Part I: Short Periodic Signals 1985 20 IPL Noshita, Translation of Turner Combinators in O(n log n) Space 1985 20 IPL Papadimitriou, An Algorithm for Shortest-Path Motion in Three Dimensions 1985 20 IPL Passy & Tinchev, PDL with Data Constants 1985 20 IPL Plaisted, The Undecidability of Self-Embedding for Term Rewriting Systems 1985 20 IPL Rangarajan & Arun-Kumar, Fair Derivations in E0L Systems 1985 20 IPL Rao & Majumdar, An Algorithm for Local Compaction of Horizontal Microprograms 1985 20 IPL Reif, Depth-First Search is Inherently Sequential 1985 20 IPL Santoro & Sidney, Interpolation-Binary Search 1985 20 IPL Shallit & Shamir, Number-Theoretic Functions Which are Equivalent to Number of Divisors 1985 20 IPL Slusarek, A Note on the Dynamic Storage Allocation Problem 1985 20 IPL Sontag, Real Addition and the Polynomial Hierarchy 1985 20 IPL Srimani, Letter to the Editor 1985 20 IPL Thatte, On the Correspondence Between Two Classes of Reduction Systems 1985 20 IPL Tsin, An Optimal Parallel Processor Bound in Strong Orientation of an Undirected Graph 1985 20 IPL Ukkonen, Upper Bounds on the Size of LR(k) Parsers 1985 20 IPL Van de Snepscheut, Evaluating Expressions with a Queue 1985 20 IPL Van Gils, How to Cope with Faulty Processors in a Completely Connected Network of Communicating Processors 1985 20 IPL Vishkin, On Efficient Parallel Strong Orientation 1985 20 IPL Volger, Some Results on Addition/Subtraction Chains 1985 20 IPL Welzl, Constructing the Visibility Graph for n-Line Segments in O(n^2) Time 1985 20 IPL Widmayer & Wong, An Optimal Algorithm for the Maximum Alignment of Terminals 1985 20 IPL Wise, Representing Matrices as Quadtrees for Parallel Processors 1984 19 IPL Akl, An Optimal Algorithm for Parallel Selection 1984 19 IPL Alt & Mehlhorn & Munro, Partial Match Retrieval in Implicit Data Structures 1984 19 IPL Avis, Non-Partitionable Point Sets 1984 19 IPL Bechtold & Kuspert, On the Use of Extendible Hashing without Hashing 1984 19 IPL Bertossi, Dominating Sets for Split and Bipartite Graphs 1984 19 IPL Best, Fairness and Conspiracies (Erratum) 1984 19 IPL Biskup, Some Variants of the Take-Grant Protection Model 1984 19 IPL Bourret, How to Estimate the Sizes of Domains 1984 19 IPL Carpi, On the Centers of the Set of Weakly Square-Free Words on a Two Letter Alphabet 1984 19 IPL Chrobak & Chlebus, Probabilistic Turing Machines and Recursively Enumerable Dedekind Cuts 1984 19 IPL Chrobak, A Note on Bounded-Reversal Multipushdown Machines 1984 19 IPL Darondeau & Kott, Towards a Formal Proof System for omega-Rational Expressions 1984 19 IPL Dowdy & Eager & Gordon & Saxton, Throughput Concavity and Response Time Convexity 1984 19 IPL Eades & McKay, An Algorithm for Generating Subsets of Fixed Size with a Strong Minimal Change Property 1984 19 IPL Faigle & Schrader, Minimizing Completion Time for a Class of Scheduling Problems 1984 19 IPL Frederickson, On Linear-Time Algorithms for Five-Coloring Planar Graphs 1984 19 IPL Grune, How to Produce All Sentences from a Two-Level Grammar 1984 19 IPL Gupta & Srivastava, On Synthesis of Scheduling Algorithms 1984 19 IPL Gursel & Scheuermann, Asserting the Optimality of Serial SJRPs in Processing Simple Queries in Chain Networks 1984 19 IPL Johnson & Bryant, Formal Syntax Methods for Natural Language 1984 19 IPL Kallay, The Complexity of Incremental Convex Hull Algorithms in R^d 1984 19 IPL Karhumaki & Wood, Inverse Morphic Equivalence on Languages 1984 19 IPL Klupsz, A Linear Algorithm of a Deadlock Avoidance for Nonpreemptible Resources 1984 19 IPL Kowaltowski & Palma, Another Solution of the Mutual Exclusion Problem 1984 19 IPL Kral, On Software Equations 1984 19 IPL Leung, Approximate Storage Utilisation of B-Trees: A Simple Derivation and Generalisations 1984 19 IPL Lipski, An O(n log n) Manhattan Path Algorithm 1984 19 IPL Lotti, Area-Time Tradeoff for Rectangular Matrix Multiplication in VLSI Models 1984 19 IPL Luque & Ripoll, Integer Linear Programming for Microprograms Register Allocation 1984 19 IPL Madduri & Finkel, Extension of the Banker's Algorithm for Resource Allocation in a Distributed Operating System 1984 19 IPL Maio & Scalas & Tiberio, On Estimating Access Costs in Relational Databases 1984 19 IPL Makinen, On Derivation Preservation 1984 19 IPL Manber, A Probabilistic Lower Bound for Checking Disjointness of Sets 1984 19 IPL Martin & Rem, A Presentation of the Fibonacci Algorithm 1984 19 IPL McKenzie, Permutations of Bounded Degree Generate Groups of Polynomial Diameter 1984 19 IPL McKeown & Rayward-Smith, Communication Problems on MIMD Parallel Computers 1984 19 IPL Oyamaguchi, Some Remarks on Subclass Containment Problems for Several Classes of dpda's 1984 19 IPL Palvia & March, Approximating Block Accesses in Database Organizations 1984 19 IPL Parker, On Converting Character Strings to Integers 1984 19 IPL Rytter, On Linear Context-Free Languages and One-Way Multihead Automata 1984 19 IPL Savitch & Vitanyi, On the Power of Real-Time Two-Way Multihead Finite Automata with Jumps 1984 19 IPL Shamir & Schnorr, Cryptanalysis of Certain Variants of Rabin's Signature Scheme 1984 19 IPL Spirakis & Yap, Strong NP-Hardness of Moving Many Discs 1984 19 IPL Subrahmanyam & You, On Embedding Functions in Logic 1984 19 IPL Tourlakis, An Inductive Number-Theoretic Characterization of NP 1984 19 IPL Treat & Budd, Extensions to Grid Selector Composition and Compilation in APL 1984 19 IPL Vyskoc, A Note on Boolean Matrix Multiplication 1984 19 IPL Walsh, How Evenly Should One Divide to Conquer Quickly? 1984 19 IPL Weyuker, The Complexity of Data Flow Criteria for Test Data Selection 1984 19 IPL Woo & Smith & Agrawala, A Proof of the Determinacy Property of the Data Flow Schema 1984 19 IPL Wood, The Contour Problem for Rectilinear Polygons 1984 19 IPL Wyrostek, On the `Correct Prefix Property' in Precedence Parsers (Erratum) 1984 18 IPL Alia & Barsi & Martinelli, A Fast VLSI Conversion between Binary and Residue Systems 1984 18 IPL Allison & Noga, The L_1 Travelling Salesman Problem 1984 18 IPL Apostolico & Giancarlo, Pattern Matching Machine Implementation of a Fast Test for Unique Decipherability 1984 18 IPL Atallah, Parallel Strong Orientation of an Undirected Graph 1984 18 IPL Atzeni & Morfuni, Functional Dependencies in Relations with Null Values 1984 18 IPL Barth, An Analytical Comparison of Two String Search Algorithms 1984 18 IPL Berkowitz, On Computing the Determinant in Small Parallel Time Using a Small Number of Processors 1984 18 IPL Best, Fairness and Conspiracies 1984 18 IPL Blazewicz & Weglarz & Drabowski, Scheduling Independent 2-Processor Tasks to Minimize Schedule Length 1984 18 IPL Chin & Wang, Minimum Vertex Distance between Separable Convex Polygons 1984 18 IPL Cioni & Kreczmar, Programmed Deallocation without Dangling Reference 1984 18 IPL Cormack & Horspool, Algorithms for Adaptive Huffman Codes 1984 18 IPL Courcelle, Some Negative Results Concerning DPDA's 1984 18 IPL Dyer & Frieze, A Partitioning Algorithm for Minimum Weighted Euclidean Matching 1984 18 IPL Fle & Roucairol, Multiserialization of Iterated Transactions 1984 18 IPL Friesen & Langston, A Storage-Size Selection Problem 1984 18 IPL Geist, Perception-Based Configuration Design of Computer Systems 1984 18 IPL Goodman & Tay, A Characterization of Multivalued Dependencies Equivalent to a Join Dependency 1984 18 IPL Holenderski, A Note on Specifying and Verifying Concurrent Processes 1984 18 IPL Hull, A Parallel View of Stable Marriages 1984 18 IPL Ihm & Ntafos, On Legal Path Problems in Digraphs 1984 18 IPL Kasyanov, Loop Cleaning 1984 18 IPL Katsuno, When Do Non-Conflict-Free Multivalued Dependency Sets Appear? 1984 18 IPL Kreowski & Rozenberg, Note on Node-Rewriting Graph Grammars 1984 18 IPL Lee & Lee, On a Circle-Cover Minimization Problem 1984 18 IPL Lickteig, A Note on Border Rank 1984 18 IPL Lifschitz, On Verification of Programs with Goto Statements 1984 18 IPL Magott, Performance Evaluation of Concurrent Systems Using Petri Nets 1984 18 IPL Mannila & Ukkonen, A Simple Linear-Time Algorithm for In Situ Merging 1984 18 IPL Miola, Algebraic Approach to p-adic Conversion of Rational Numbers 1984 18 IPL Miyano, Remarks on Two-Way Automata with Weak-Counters 1984 18 IPL Moffat & Takaoka, A Priority Queue for the All Pairs Shortest Path Problem 1984 18 IPL Moller-Nielsen & Staunstrup, Experiments with a Fast String Searching Algorithm 1984 18 IPL Monien, Deterministic Two-Way One-Head Pushdown Automata are Very Powerful 1984 18 IPL Ohya & Iri & Murota, A Fast Voronoi-Diagram Algorithm with Quaternary Tree Bucketing 1984 18 IPL Remmers, A Technique for Developing Loop Invariants 1984 18 IPL Rowe, Diophantine Inference on a Statistical Database 1984 18 IPL Saoudi, Infinitary Tree Languages Recognized by omega-Automata 1984 18 IPL Scarioni & Speranza, A Probabilistic Analysis of an Error-Correcting Algorithm for the Towers of Hanoi Puzzle 1984 18 IPL Schlorer, Insecurity of Set Controls for Statistical Databases 1984 18 IPL Tazawa, On the Consecutive Retrieval Property for Generalized Binary Queries 1984 18 IPL Tiekenheinrich, A 4n-Lower bound on the Monotone Network Complexity of a One-Output Boolean Function 1984 18 IPL Topor, Termination Detection for Distributed Computations 1984 18 IPL Trakhtenbrot, Some Equivalent Transformations of Recursive Programs Based on Their Schematic Properties 1984 18 IPL Turan, The Critical Complexity of Graph Properties 1984 18 IPL Turpin & Coan, Extending Binary Byzantine Agreement to Multivalued Byzantine Agreement 1984 18 IPL Vardi, A Note on Lossless Database Decompositions 1984 18 IPL Wilf, Backtrack: An O(1) Expected Time Algorithm for the Graph Coloring Problem 1984 18 IPL Xiaolong Jin, Large Processors are Good in VLSI Chips 1984 18 IPL Yamasaki & Yoshida & Doshita & Hirata, A New Combination of Input and Unit Deductions for Horn Sentences 1984 18 IPL Yodogawa, A Note on Array Grammars 1984 18 IPL Zak, Letter to the Editor 1984 18 IPL Zemel, An O(n) Algorithm for the Linear Multiple Choice Knapsack Problem and Related Problems 1983 17 IPL Asai, A Consideration of a Practical Implementation for a New Convergence Division 1983 17 IPL Atallah, A Linear Time Algorithm for the Hausdorff Distance Between Convex Polygons 1983 17 IPL Barnard, Recursive Descent Parsing Using Implementation Languages Requiring Definition Before Use 1983 17 IPL Bartholdi & Platzman, A Fast Heuristic Based on Spacefilling Curves for Minimum-Weight Matching in the Plane 1983 17 IPL Bertossi, Finding Hamiltonian Circuits in Proper Interval Graphs 1983 17 IPL Blum, A Note on the `Parallel Computation Thesis' 1983 17 IPL Broy, Denotational Semantics of Communicating Processes Based on a Language for Applicative Multiprogramming 1983 17 IPL Cesarini & Soda, An Algorithm to Construct a Compact B-Tree in Case of Ordered Keys 1983 17 IPL Choffrut & Culik, Folding of the Plane and the Design of Systolic Arrays 1983 17 IPL Clocksin, Real-Time Functional Queue Operations Using the Logical Variable 1983 17 IPL Croitoru & Suditu, Perfect Stables in Graphs 1983 17 IPL De Bra & Paredaens, An Algorithm for Horizontal Decompositions 1983 17 IPL Ehrenfeucht & Rozenberg, On the Subword Complexity of m-Free D0L Languages 1983 17 IPL Er, Computing Sums of Order-k Fibonacci Numbers in Log Time 1983 17 IPL Farinas, Space as Time 1983 17 IPL Fischer & Paterson, Storage Requirements for Fair Scheduling 1983 17 IPL Gangolli & Tanimoto, Two Pyramid Machine Algorithms for Edge Detection in Noisy Binary Images 1983 17 IPL Guibas & Stolfi, On Computing All North-East Nearest Neighbors in the L_1 Metric 1983 17 IPL Hikita, Listing and Counting Subtrees of Equal Size of a Binary Tree 1983 17 IPL Ida, Some FP Algebra with Currying Operation 1983 17 IPL Kobuchi, Stability of Desynchronized 0L Systems 1983 17 IPL Kolla, Where-Oblivious Is Not Sufficient 1983 17 IPL Kucera, Erratum and Addendum to: Parallel Computation and Conflicts in Memory Access 1983 17 IPL Lautemann, BPP and the Polynomial Hierarchy 1983 17 IPL Lifschnitz & Pesotchinsky, A Note on the Complexity of a Partition Algorithm 1983 17 IPL Magazine, Optimality of Intuitive Checkpointing Policies 1983 17 IPL Makinen, Boundedness Testing for Unambiguous Context-Free Grammars 1983 17 IPL Martin, Precise Typing and Filters 1983 17 IPL Mayoh, Models of Programs and Processes 1983 17 IPL Mili, Verifying Programs by Induction on Their Data Structure: General Format and Applications 1983 17 IPL Myers, An Applicative Random-Access Stack 1983 17 IPL Nawrocki, Contiguous Segmentation with Limited Compacting 1983 17 IPL Nishihara & Ikeda, Address Calculation Algorithms for Ordered Sets of Combinations 1983 17 IPL Ramesh & Mehndiratta, The Liveness Property of On-the-Fly Garbage Collector--A Proof 1983 17 IPL Rana, A Distributed Solution of the Distributed Termination Problem 1983 17 IPL Richards, Shape Distribution of Height-Balanced Trees 1983 17 IPL Rohl, A Faster Lexicographical N Queens Algorithm 1983 17 IPL Schorr, Physical Parallel Devices Are Not Much Faster than Sequential Ones 1983 17 IPL Seroussi & Ma, On the Arithmetic Complexity of Matrix Kronecker Powers 1983 17 IPL Shamir, Embedding Cryptographic Trapdoors in Arbitrary Knapsack Systems 1983 17 IPL Shing, Optimum Ordered Bi-Weighted Binary Trees 1983 17 IPL Shmueli, Dynamic Cycle Detection 1983 17 IPL Skyum, A Measure in Which Boolean Negation is Exponentially Powerful 1983 17 IPL Tarjan, An Improved Algorithm for Hierarchical Clustering Using Strong Components 1983 17 IPL Tirri, Simulation, Reduction and Preservation of Correctness Properties of Parallel Systems 1983 17 IPL Tong & Lawler, A Faster Algorithm for Finding Edge-Disjoint Branchings 1983 17 IPL Tsin & Chin, A General Program Scheme for Finding Bridges 1983 17 IPL Vyskoc, A Note on the Power of Integer Division 1983 17 IPL Weiser, Reconstructing Sequential Behavior from Parallel Behavior Projections 1983 17 IPL Willard, Log-Logarithmic Worst-Case Range Queries are Possible in Space Theta(N) 1983 17 IPL Willett, Trapdoor Knapsacks without Superincreasing Structure 1983 17 IPL Williams, Is an Exit Statement Sufficient? 1983 17 IPL Williams, The Problem of Absolute Privacy 1983 17 IPL Wyrostek, On the `Correct Prefix Property' in Precedence Parsers 1983 17 IPL Yokomori & Joshi, Semi-Linearity, Parikh-Boundedness and Tree-Adjunct Languages 1983 17 IPL Yu & Gouda, Unboundedness Detection for a Class of Communicating Finite-State Machines 1983 17 IPL Zheng, The Duodirun Merging Algorithm: A New Fast Algorithm for Parallel Merging 1983 16 IPL Agrawal & DeWitt, Updating Hypothetical Data Bases 1983 16 IPL Allison, Stable Marriages by Coroutines 1983 16 IPL Alpern & Schneider, Key Exchange Using `Keyless Cryptography' 1983 16 IPL Bertossi & Bonuccelli, Preemptive Scheduling of Periodic Jobs in Uniform Multiprocessor Systems 1983 16 IPL Bossi & Cocco & Colussi, A Divide-and-Conquer Approach to General Context-Free Parsing 1983 16 IPL Carpi, On the Size of a Square-Free Morphism on a Three Letter Alphabet 1983 16 IPL Casanova, The Theory of Functional and Subset Dependencies over Relational Expressions 1983 16 IPL Chazelle, A Decision Procedure for Optimal Polyhedron Partitioning 1983 16 IPL Chazelle, An Improved Algorithm for the Fixed-Radius Neighbor Problem 1983 16 IPL Clarkson, A Modification of the Greedy Algorithm for Vertex Cover 1983 16 IPL Cohen, A Note on a Fast Algorithm for Sparse Matrix Multiplication 1983 16 IPL Constable, Programs as Proofs: A Synopsis 1983 16 IPL Crochemore & Le Rest & Wender, An Optimal Test on Finite Unavoidable Sets of Words 1983 16 IPL Deleage, An Application of a Transfer Lemma 1983 16 IPL Dijkstra & Feijen & van Gasteren, Derivation of a Termination Detection Algorithm for Distributed Computations 1983 16 IPL Duda, The Effects of Checkpointing on Program Execution Time 1983 16 IPL Ehrenfeucht & Rozenberg, On the Subword Complexity of Locally Catenative D0L Languages 1983 16 IPL Eicholz, Optimal Networks for Distributing Nonsequential Programs 1983 16 IPL Fagin & Vardi, Armstrong Databases for Functional and Inclusion Dependencies 1983 16 IPL Fraser, A Generalization of Two Code Ordering Optimizations 1983 16 IPL Frederickson, Scheduling Unit-Time Tasks with Integer Release Times and Deadlines 1983 16 IPL Freund, Init and Anf Operating on omega-Languages 1983 16 IPL Fushimi, Increasing the Orders of Equidistribution of the Leading Bits of the Tausworthe Sequence 1983 16 IPL Goldberg & Purdom & Brown, Corrigendum: Average Time Analysis of Simplified Davis-Putnam Procedures 1983 16 IPL Gusfield, Connectivity and Edge-Disjoint Spanning Trees 1983 16 IPL Guting, Stabbing C-Oriented Polygons 1983 16 IPL Hartmanis, On Sparse Sets in NP - P 1983 16 IPL Hertel, Smoothsort's Behavior on Presorted Sequences 1983 16 IPL Hofri, Should the Two-Headed Disk be Greedy?--Yes, It Should 1983 16 IPL Ibaraki & Katoh, On-Line Computation of Transitive Closures of Graphs 1983 16 IPL Jedrzejowicz, On the Enlargement of the Class of Regular Languages by the Shuffle Closure 1983 16 IPL Kantabutra, Traveling Salesman Cycles are not Always Subgraphs of Voronoi Duals 1983 16 IPL Kriegel & Kwong, Insertion-Safeness in Balanced Trees 1983 16 IPL Latteux, On a Language without Star 1983 16 IPL Lester, Accuracy of Approximating Queueing Network Departure Processes with Independent Renewal Processes 1983 16 IPL Lloyd, On a Simple Deadlock Recovery Problem 1983 16 IPL McGlinn, Is SSS* Better than Alpha-Beta? 1983 16 IPL Metivier, About the Rewriting Systems Produced by the Knuth-Bendix Completion Algorithm 1983 16 IPL Meyer auf der Heide, Infinite Cube-Connected Cycles 1983 16 IPL Morris, Letter on: Another Compacting Garbage Collector 1983 16 IPL Murtagh, Expected-Time Complexity Results for Hierarchic Clustering Algorithms Which Use Cluster Centres 1983 16 IPL Ozawa, Considerations on the Similarity Measures between Index Terms 1983 16 IPL Perko, A Representation of Disjoint Sets with Fast Initialization 1983 16 IPL Rystsov, Polynomial Complete Problems in Automata Theory 1983 16 IPL Rytter, A Simulation Result for Two-Way Pushdown Automata 1983 16 IPL Rytter, Time Complexity of Loop-Free Two-Way Pushdown Automata 1983 16 IPL Schoening, On the Structure of Delta^p_2 1983 16 IPL Soisalon-Soininen, On Computing Approximate Convex Hulls 1983 16 IPL Tamminen, Analysis of N-Trees 1983 16 IPL Tarjan, Updating a Balanced Search Tree in O(1) Rotations 1983 16 IPL Tsuda & Sato & Tatsumi, Generalization of Floyd's Model on Permuting Information in Idealized Two-Level Storage 1983 16 IPL Walsh, Iteration Strikes Back--at the Cyclic Towers of Hanoi 1983 16 IPL Wegener, Relating Monotone Formula Size and Monotone Depth of Boolean Functions 1983 16 IPL Wood & Fernandez & Lang, Minimization of Demand Paging for the LRU Stack Model of Program Behavior 1983 16 IPL Yap, A Hybrid Algorithm for the Shortest Path Between Two Nodes in the Presence of Few Negative Arcs 1983 16 IPL Yuba & Yamaguchi & Shimada, A Control Mechanism of a Lisp-Based Data-Driven Machine 1983 16 IPL Zahorjan & Bell & Sevcik, Estimating Block Transfers When Record Access Probabilities are Non-Uniform 1982 15 IPL Balcazar & Diaz, A Note on a Theorem by Ladner 1982 15 IPL Becker & Degenhardt & Doenhardt & Hertel & Kaninke & Kerber & Mehlhorn & Naher & Rohnert & Winter, A Probabilistic Algorithm for Vertex Connectivity of Graphs 1982 15 IPL Bergstra & Tucker, Two Theorems about the Completeness of Hoare's Logic 1982 15 IPL Bermond & Delorme & Quisquater, Tables of Large Graphs with Given Degree and Diameter 1982 15 IPL Bron & Dijkstra & Swierstra, A Memory-Management Unit for the Optimal Exploitation of a Small Address Space 1982 15 IPL Ceri & Pelagatti, A Solution Method for the Non-Additive Resource Allocation Problem in Distributed System Design 1982 15 IPL Cheung, A Statistical Model for Estimating the Number of Records in a Relational Database 1982 15 IPL Culik & Wood, A Note on Some Tree Similarity Measures 1982 15 IPL Dijkstra & van Gasteren, An Introduction to Three Algorithms for Sorting in Situ 1982 15 IPL Eastman & Zemankova, Partially Specified Nearest Neighbor Searches Using k-d Trees 1982 15 IPL editorial board, Letter on papers by Shortt, Wilson & Shortt, Urbanek, Gries & Levin, Miller & Brown 1982 15 IPL Farley & Proskurowski, Directed Maximal-Cut Problems 1982 15 IPL Goh & Rotem, Recognition of Perfect Elimination Bipartite Graphs 1982 15 IPL Goldberg & Purdom & Brown, Average Time Analyses of Simplified Davis-Putnam Procedures 1982 15 IPL Gonzalez & Johnson, Sorting Numbers in Linear Expected Time and Optimal Extra Space 1982 15 IPL Greenberg & Ladner & Paterson & Galil, Efficient Parallel Algorithms for Linear Recurrence Computation 1982 15 IPL Highnam, The Ears of a Polygon 1982 15 IPL Hoshi & Yuba, A Counter Example to a Monotonicity Property of k-d Trees 1982 15 IPL Imai, Finding Connected Components of an Intersection Graph of Squares in the Euclidean Plane 1982 15 IPL Inoue & Takanami & Taniguchi, A Note on Alternating On-Line Turing Machines 1982 15 IPL Jouannaud & Lescanne, On Multiset Orderings 1982 15 IPL Korczynski & Winkowski, A Communication Concept for Distributed Systems 1982 15 IPL Leipala, On Optimal Multilevel Indexed Sequential Files 1982 15 IPL Leung, Optimal Database Reorganisation: Some Practical Difficulties 1982 15 IPL Levin, Letter on: Burton, An Efficient Functional Implementation of FIFO Queues 1982 15 IPL Levy, An Improved List-Searching Algorithm 1982 15 IPL Lewis & Statman, Unifiability is Complete for Co-NLogSpace 1982 15 IPL Luccio & Pagli, A Linear Algorithm to Determine Minimal Spanning Forests in Chain Graphs 1982 15 IPL Lueker & Willard, A Data Structure for Dynamic Range Queries 1982 15 IPL Lukaszewicz, Universal Grammars 1982 15 IPL Main, Permutations are not Context-Free: An Application of the Interchange Lemma 1982 15 IPL Manacher, Steady-Paced-Output and Fractional-On-Line Algorithms on a RAM 1982 15 IPL Morris, Another Compacting Garbage Collector 1982 15 IPL Mostowski, Determinancy of Sinking Automata on Infinite Trees and Inequalities between Various Rabin's Pair Indices 1982 15 IPL Motoki, A Note on Upper Bounds for the Selection Problem 1982 15 IPL Muluszynski & Nilsson, Grammatical Unification 1982 15 IPL Nijholt, On the Relationship between the LL(k) and LR(k) Grammars 1982 15 IPL Reddy & Bhalla & Prasad, Robust, Centralized Certifier Based Concurrency Control for Distributed Databases 1982 15 IPL Rytter, A Note on Two-Way Nondeterministic Pushdown Automata 1982 15 IPL Rytter, Time Complexity of Unambiguous Path Systems 1982 15 IPL Schoor, Fast Algorithm for Sparse Matrix Multiplication 1982 15 IPL Sharir, Fast Composition of Sparse Maps 1982 15 IPL Slater, A Linear Algorithm for the Number of Degree Constrained Subforests of a Tree 1982 15 IPL Spyratos, A Homomorphism Theorem for Data Base Mappings 1982 15 IPL Stockmeyer & Vazirani, NP-Completeness of Some Generalizations of the Maximum Matching Problem 1982 15 IPL Stout, Drawing Straight Lines with a Pyramid Cellular Automaton 1982 15 IPL Syslo, A Labeling Algorithm to Recognize a Line Digraph and Output its Root Graph 1982 15 IPL Szepietowski, A Finite 5-Pebble-Automaton Can Search Every Maze 1982 15 IPL Tamminen, Extendible Hashing with Overflow 1982 15 IPL Walsh, The Towers of Hanoi Revisited: Moving the Rings by Counting the Moves 1982 15 IPL Wang, A New Hierarchy of Two-Dimensional Array Languages 1982 15 IPL Wegener, Best Possible Asymptotic Bounds on the Depth of Monotone Functions in Multivalued Logic 1982 15 IPL Wegner, Sorting a Linked List with Equal Keys 1982 15 IPL Winkler, On Computability of the Mean Deviation 1982 14 IPL Aspvall & Plass & Tarjan, Erratum: A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas 1982 14 IPL Backhouse, Writing a Number as a Sum of Two Squares: A New Solution 1982 14 IPL Bar-Yehuda & Vishkin, Complexity of Finding k-Path-Free Dominating Sets in Graphs 1982 14 IPL Barlow & Evans & Shanehchi, Parallel Multisection for the Determination of the Eigenvalues of Symmetric Quindiagonal Matrices 1982 14 IPL Beretta, Monte Carlo Estimation of Numerical Stability in Fast Algorithms for Systems of Bilinear Forms 1982 14 IPL Bergstra & Meyer, A Simple Transfer Lemma for Algebraic Specifications 1982 14 IPL Bini, Reply to the Paper ``The Numerical Instability of Bini's Algorithm'' 1982 14 IPL Brouwer & van Emde Boas, A Note on `Master Keys for Group Sharing' 1982 14 IPL Burton, A Linear Space Translation of Functional Programs to Turner Combinators 1982 14 IPL Burton, An Efficient Functional Implementation of FIFO Queues 1982 14 IPL Carlson & Savage, Extreme Time-Space Tradeoffs for Graphs with Small Space Requirements 1982 14 IPL Chor, Arithmetic of Finite Fields 1982 14 IPL De Felice, On the Triangle Conjecture 1982 14 IPL Demolombe, Generalized Division for Relational Algebraic Language 1982 14 IPL Doberkat, Asymptotic Estimates for the Higher Moments of the Expected Behavior of Straight Insertion Sort 1982 14 IPL Edelsbrunner & Maurer, Polygonal Intersection Searching 1982 14 IPL Edelsbrunner & Overmars, On the Equivalence of Some Rectangle Problems 1982 14 IPL Elgot & Perlis & Snyder, A Syntax-Free Semantics for the APL Operators 1982 14 IPL Farinas Del Cerro, A Simple Deduction Method for Modal Logic 1982 14 IPL Fischer & Lynch, A Lower Bound for the Time to Assure Interactive Consistency 1982 14 IPL Franchi-Zannettacci, An Extension to Trees of the Sardinas and Patterson Algorithm 1982 14 IPL Gelenbe & Gardy, On the Size of Projections: I 1982 14 IPL Gini, The Automatic Synthesis of Iterative Programs 1982 14 IPL Graham & Mendelzon, Strong Equivalence of Relational Expressions under Dependencies 1982 14 IPL Gunn, Compile Time Type Checking of Structure Field Accessing 1982 14 IPL Hart, Permutation Inversions and Multidimensional Cumulative Distribution Functions 1982 14 IPL Jakobsson, Evaluation of a Hierarchical Bit-Vector Compression Technique 1982 14 IPL Jou & Fischer, The Complexity of Recognizing 3NF Relation Schemes 1982 14 IPL King & Smith-Thomas, An Optimal Algorithm for Sink-Finding 1982 14 IPL Ko, Some Observations on the Probabilistic Algorithms and NP-Hard Problems 1982 14 IPL Korsh, Growing Nearly Optimal Binary Search Trees 1982 14 IPL Krichevsky, Letter on: Mauceri & Restivo, A Family of Codes Commutatively Equivalent to Prefix Codes 1982 14 IPL Kucera, Parallel Computation and Conflicts in Memory Access 1982 14 IPL Lagarias & Swartwout, Minimal Storage Representations for Binary Relations 1982 14 IPL Lassez & Nguyen & Sonenberg, Fixed Point Theorems and Semantics: A Folk Tale 1982 14 IPL Minker & Zanon, An Extension to Linear Resolution with Selection Function 1982 14 IPL Nath & Maheshwari, Parallel Algorithms for the Connected Components and Minimal Spanning Tree Problems 1982 14 IPL Nijholt, A Note on the Sufficiency of Sokolowski's Criterion for Context-Free Languages 1982 14 IPL Orenstein, Multidimensional Tries Used for Associative Searching 1982 14 IPL Reddy & Bhalla & Prasad, A Model of Concurrency Control in Distributed Database Systems 1982 14 IPL Ridjanovic & Brodie, Defining Database Dynamics with Attribute Grammars 1982 14 IPL Rohrich, A Hybrid of Quicksort with O(n log n) Worst Case Complexity 1982 14 IPL Savage, Depth-First Search and the Vertex Cover Problem 1982 14 IPL Schmitt, On the Computational Power of the Floor Function 1982 14 IPL Shanthikumar, A Recursive Algorithm to Generate Joint Probability Distribution of Arrivals from Exponential Sources During a Random Time Interval 1982 14 IPL Slisenko, Context-Free Grammars as a Tool for Describing Polynomial-Time Subclasses of Hard Problems 1982 14 IPL Tarhio, LR Parsing of Some Ambiguous Grammars 1982 14 IPL Tarjan, A Hierarchical Clustering Algorithm Using Strong Components 1982 14 IPL Tarjan, Sensitivity Analysis of Minimum Spanning Trees and Shortest Path Trees 1982 14 IPL Umeo & Morita & Sugata, Deterministic One-Way Simulation of Two-Way Real-Time Cellular Automata and Its Related Problems 1982 14 IPL Upfal, Formal Correctness Proofs of a Nondeterministic Program 1982 14 IPL van Leeuwen & Nivat, Efficient Recognition of Rational Relations 1982 14 IPL Watjen & Struckmann, An Algorithm for Verifying Equations of Morphisms in a Category 1982 14 IPL Yokomori & Wood & Lange, A Three-Restricted Normal Form Theorem for ET0L Languages 1982 14 IPL Zaks, Generation of k-ary Trees 1981 13 IPL Agrawala & Tripathi, On the Optimality of Semidynamic Routing Schemes 1981 13 IPL Ancona & Gianuzzi, A New Method for Implementing LR(k) Tables 1981 13 IPL Arora & Sharma, Guarded Procedure: A Distributed Programming Concept 1981 13 IPL Atallah & Kosaraju, An Adversary-Based Lower Bound for Sorting 1981 13 IPL Atkinson, The Cyclic Towers of Hanoi 1981 13 IPL Barlow & Evans & Shanehchi, A Parallel Merging Algorithm 1981 13 IPL Barth, An Alternative for the Implementation of the Knuth-Morris-Pratt Algorithm 1981 13 IPL Bertossi, The Edge Hamiltonian Path Problem is NP-Complete 1981 13 IPL Bird, The Jogger's Problem 1981 13 IPL Blum & Karp & Vornberger & Papadimitriou & Yannakakis, The Complexity of Testing Whether a Graph is a Superconcentrator 1981 13 IPL Book, NTS Grammars and Church-Rosser Systems 1981 13 IPL Chan, Deciding Freeness for Program Schemes with a Single Unary Function 1981 13 IPL Clerbout & Latteux, The Inclusion of D0L in MULTI-RESET 1981 13 IPL Davis & Rinaldi & Trebilcock, Data Compression in Limited Capacity Microcomputer Systems 1981 13 IPL Denning & Meijer & Schneider, More on Master Keys for Group Sharing 1981 13 IPL Edelsbrunner & Maurer, On the Intersection of Orthogonal Objects 1981 13 IPL Ehrenfeucht & Rozenberg, On the Subword Complexity of D0L Languages with a Constant Distribution 1981 13 IPL Filho, Optimal Choice of Discriminators in a Balanced k-d Binary Search Tree 1981 13 IPL Freivalds, Projections of Languages Recognizable by Probabilistic and Alternating Finite Multitape Automata 1981 13 IPL Goodman & Shmueli, Limitations of the Chase 1981 13 IPL Guida & Somalvico, Multi-Problem-Solving: Knowledge Representation and System Architecture 1981 13 IPL Gunn & Harland, Degrees of Constancy in Programming Languages 1981 13 IPL Hassin, Maximum Flow in (s,t) Planar Networks 1981 13 IPL Hood & Melville, Real-Time Queue Operation in Pure LISP 1981 13 IPL Ibarra & Moran, Deterministic and Probabilistic Algorithms for Maximum Bipartite Matching via Fast Matrix Multiplication 1981 13 IPL Ibarra & Rosier, On the Decidability of Equivalence for Deterministic Pushdown Transducers 1981 13 IPL Korsh, Greedy Binary Search Trees are Nearly Optimal 1981 13 IPL Lewis & boynton & Burton, Expected Complexity of Fast Search with Uniformly Distributed Data 1981 13 IPL Makarov, Using Duality for the Synthesis of an Optimal Algorithm Involving Matrix Multiplication 1981 13 IPL Moran, A Note on `Is Shortest Path Problem Not Harder than Matrix Multiplication?' 1981 13 IPL Nakamura & Aizawa, Acceptors for Isometric Parallel Context-Free Array Languages 1981 13 IPL Nakamura, Some Remarks on One-Pebble Rectangular Array Acceptors 1981 13 IPL Pan, The Lower Bounds on the Additive Complexity of Bilinear Problems in Terms of Some Algebraic Quantities 1981 13 IPL Papadimitriou & Yannakakis, The Clique Problem for Planar Graphs 1981 13 IPL Ramamohanarao & Sacks-Davis, hardware Address Translation for Machines with a Large Virtual Memory 1981 13 IPL Regnier, On the Average Height of Trees in Digital Search and Dynamic Hashing 1981 13 IPL Romani, Author's Reply to S. Moran's Note on the Shortest Path Problem 1981 13 IPL Rytter, A Hardest Language Recognized by Two-Way Nondeterministic Pushdown Automata 1981 13 IPL Rytter, The Dynamic Simulation of Recursive and Stack Manipulation Programs 1981 13 IPL Rytter, Time Complexity of Languages Recognized by One-Way Multihead Pushdown Automata 1981 13 IPL Sabelfeld, Tree Equivalence of Linear Recursive Schemata is Polynomial-Time Decidable 1981 13 IPL Schwartz, Finding the Minimum Distance Between Two Convex Polygons 1981 13 IPL Senizergues, A New Class of C. F. L. for Which the Equivalence is Decidable 1981 13 IPL Siklossy, Efficient Query Evaluation in Relational Data Bases with Missing Values 1981 13 IPL Storer, Constructing Full Spanning Trees for Cubic Graphs 1981 13 IPL Stoyan & Smelyakov, An Approach to the Problems of Routing Optimization in the Regions of Intricate Shape 1981 13 IPL Tolle & Siddall, On the Complexity of Vector Computations in Binary Tree Machines 1981 13 IPL Troya & Vaquero, An Approximation Algorithm for Reducing Expected Head Movement in Linear Storage Devices 1981 13 IPL van de Snepscheut, Synchronous Communication between Asynchronous Components 1981 13 IPL Vitter, A Shared-Memory Scheme for Coalesced Hashing 1981 13 IPL Warren & Fox & Markstein, Modulus Division on a Two's Complement Machine 1981 13 IPL Watanabe, A Fast Algorithm for Finding All Shortest Paths 1981 13 IPL Williams, A Systematic Test for Extended Operator Precedence 1981 13 IPL Yamasaki, On Weak Persistency of Petri Nets 1981 13 IPL Yasuura, Width and Depth of Combinational Logic Circuits 1981 12 IPL Ancilotti & Boari, Information Streams Sharing a Finite Buffer: Protection Problems 1981 12 IPL Bertoni & Mauri, On Efficient Computation of the Coefficients of Some Polynomials with Applications to Some Enumeration Problems 1981 12 IPL Book, The Undecidability of a Word Problem: On a Conjecture of Strong, Maggiolo-Schettini and Rosen 1981 12 IPL Borodin & Guibas & Lynch & Yao, Efficient Searching Using Partial Ordering 1981 12 IPL Bruynooghe, Solving Combinatorial Search Problems by Intelligent Backtracking 1981 12 IPL Ceri & Pelagatti, An Upper Bound on the Number of Execution Nodes for a Distributed Join 1981 12 IPL Choffrut, A Closure Property of Deterministic Context-Free Languages 1981 12 IPL Courcelle, The Simultaneous Accessibility of Two Configurations of Two Equivalent DPDA's 1981 12 IPL Crochemore, An Optimal Algorithm for Computing the Repetitions in a Word 1981 12 IPL de Luca, A combinatorial Property of the Fibonacci Words 1981 12 IPL Denning & Schneider, Master Keys for Group Sharing 1981 12 IPL Dudzinski & Dydek, On a Stable Minimum Storage Merging Algorithm 1981 12 IPL Eastman, Optimal Bucket Size for Nearest Neighbor Searching in k-d Trees 1981 12 IPL Ebert, A Sensitive Transitive Closure Algorithm 1981 12 IPL Erni & Lapsien, On the Time and Tape Complexity of Weak Unification 1981 12 IPL Fowler & Paterson & Tanimoto, Optimal Packing and Covering in the Plane are NP-Complete 1981 12 IPL Frougny, Simple Deterministic NTS Languages 1981 12 IPL Gabow, A Linear-Time Recognition Algorithm for Interval Dags 1981 12 IPL Harland, Concurrency in a Language Employing Messages 1981 12 IPL Harland, On Facilities for Interprocess Communication 1981 12 IPL Hatzopoulos & Kollias, Optimal Policy for Database Backup and Recovery 1981 12 IPL Hehner & shyamasundar, An Implementation of P and V 1981 12 IPL Hehner, Bunch Theory: A Simple Set Theory for Computer Science 1981 12 IPL Hell & Kirkpatrick, On Generalized Matching Problems 1981 12 IPL Hellman, Another Cryptanalytic Attack on ``A Cryptosystem for Multiple Communication'' 1981 12 IPL Huang, An Algorithm for Inverting a Permutation 1981 12 IPL Ibarra & Moran & Rosier, Probabilistic Algorithms and Straight-Line Programs for Some Rank Decision Problems 1981 12 IPL Ingemarsson & Wong, A User Authentication Scheme for Shared Data Based on a Trap-Door One-Way Function 1981 12 IPL Iri & Murota & Matsui, Linear-Time Approximation Algorithms for Finding the Minimum-Weight Perfect Matching on a Plane 1981 12 IPL Jaffar, Presburger Arithmetic with Array Segments 1981 12 IPL Jaromczyk, Linear Decision Trees are Too Weak for Convex Hull Problem 1981 12 IPL Konneker & Varol, A Note on Heuristics for Dynamic Organization of Data Structures 1981 12 IPL Lawler & Martel, Scheduling Periodically Occurring Tasks on Multiple Processors 1981 12 IPL Leland & Finkel & Qiao & Solomon & Uhr, High Density Graphs for Processor Interconnection 1981 12 IPL Lischke, Two Types of Properties for Complexity Measures 1981 12 IPL Lloyd, Coffman-Graham Scheduling of UET Task Systems with 0-1 Resources 1981 12 IPL Maier & Salveter, Hysterical B-Trees 1981 12 IPL Mauceri & Restivo, A Family of Codes Commutatively Equivalent to Prefix Codes 1981 12 IPL Mauney & Fischer, An Improvement to Immediate Error Detection in Strong LL(1) Parsers 1981 12 IPL Mehlhorn & Overmars, Optimal Dynamization of Decomposable Searching Problems 1981 12 IPL Meijer, A Note on ``A Cryptosystem for Multiple Communication'' 1981 12 IPL Micali, Two-Way Deterministic Finite Automata are Exponentially More Succinct than Sweeping Automata 1981 12 IPL Ottmann & Salomaa & Wood, Sub-Regular Grammar Forms 1981 12 IPL Overmars & van Leeuwen, Some Principles for Dynamizing Decomposable Searching Problems 1981 12 IPL Overmars & van Leeuwen, Worst-Case Optimal Insertion and Deletion Methods for Decomposable Searching Problems 1981 12 IPL Overmars, General Methods for `All Elements' and `All Pairs' Problems 1981 12 IPL Pansiot, A Note on Post's Correspondence Problem 1981 12 IPL Pansiot, The Morse Sequence and Iterated Morphisms 1981 12 IPL Papadimitriou & Yannakakis, On Minimal Eulerian Graphs 1981 12 IPL Peterson, Myths About the Mutual Exclusion Problem 1981 12 IPL Petreschi & Simeone, Erratum: A Switching Algorithm for the Solution of Quadratic Boolean Equations 1981 12 IPL Preparata & Supowit, Testing a Simple Polygon for Monotonicity 1981 12 IPL Rytter, An Effective Simulation of Deterministic Pushdown Automata with Many Two-Way and One-Way Heads 1981 12 IPL Schnorr, How Many Polynomials Can Be Approximated Faster than They Can Be Evaluated? 1981 12 IPL Semba, Generation of All the Balanced Parenthesis Strings in Lexicographical Order 1981 12 IPL Shiloach, Another Look at the Degree Constrained Subgraph Problem 1981 12 IPL Snir, On the complexity of Simplifying Quadratic Forms 1981 12 IPL Steinberg & Rodeh, A Layout for the Shuffle-Exchange Network with Theta(N^2/log N) Area 1981 12 IPL Tompa, An Extension of Savitch's Theorem to Small Space Bounds 1981 12 IPL Tsao, The Numerical Instability of Bini's Algorithm 1981 12 IPL Valiant, Addendum: Computing Multivariate Polynomials in Parallel 1981 12 IPL Vardi, The Decision Problem for Database Dependencies 1981 12 IPL Whitesides, An Algorithm for Finding Clique Cut-Sets 1981 12 IPL Wilhelm, A Modified Tree-to-Tree Correction Problem 1981 12 IPL Winkowski, Protocols of Accessing Overlapping Sets of Resources 1980 11 IPL Allison & Noga, Selection by Distributive Partitioning 1980 11 IPL Arora & Rana, Heuristic Algorithms for Process Assignment in Distributed Computing Systems 1980 11 IPL Avis, Comments on a Lower Bound for Convex Hull Determination 1980 11 IPL Bailey & Dromey, Fast String Searching by Finding Subkeys in Subtext 1980 11 IPL Banachowski, A Complement to Tarjan's Result about Lower Bound on the Complexity of the Set Union Problem 1980 11 IPL Bhat, On the Complexity of Testing a Graph for N-Cube 1980 11 IPL Brent & Kung, On the Area of Binary Tree Layouts 1980 11 IPL Brown, An Improved BL Lower Bound 1980 11 IPL Broy, Transformational Semantics for Concurrent Programs 1980 11 IPL Calmet & Loos, An Improvement of Rabin's Probabilistic Algorithm for Generating Irreducible Polynomials over GF(p) 1980 11 IPL Chung & Luccio & Wong, Minimum Number of Steps for Permutation in a Bubble Memory 1980 11 IPL Colbourn & McKay, A Correction to Colbourn's Paper on the Complexity of Matrix Symmetrizability 1980 11 IPL Day, Comments on: T. D. Bui, ``On an L-Stable Method for Stiff Differential Equations'' 1980 11 IPL Day, On the Internal S-Stability of Rosenbrock Methods 1980 11 IPL Dershowitz, The Schorr-Waite Marking Algorithm Revisited 1980 11 IPL Devroye, A Note on Finding Convex Hulls via Maximal Vectors 1980 11 IPL Dijkstra & Scholten, Termination Detection for Diffusing Computations 1980 11 IPL Dobosiewicz, An Efficient Variation of Bubble Sort 1980 11 IPL Dyer, A Fast Parallel Algorithm for the Closest Pair Problem 1980 11 IPL Ebert, A Note on Odd and Even Factors of Undirected Graphs 1980 11 IPL Erkio, Internal Merge Sorting with Delayed Selection 1980 11 IPL Frederickson, Probabilistic Analysis for Simple One- and Two-Dimensional Bin Packing Algorithms 1980 11 IPL Grabowski, The Decidability of Persistence for Vector Addition Systems 1980 11 IPL Gries & Levin, Computing Fibonacci Numbers (and Similarly Defined Functions) in Log Time 1980 11 IPL Hanson, Code Improvement via Lazy Evaluation 1980 11 IPL Ibarra & Moran & Rosier, A Note on the Parallel Complexity of Computing the Rank of Order n Matrices 1980 11 IPL Jammel & Stiegler, On Expected Costs of Deadlock Detection 1980 11 IPL Johnson, The Complexity of a VLSI Adder 1980 11 IPL Kandzia & Mangelmann, On Covering Boyce-Codd Normal Forms 1980 11 IPL Kanellakis, On the Computational Complexity of Cardinality Constraints in Relational Databases 1980 11 IPL Kawai, A Formal System for Parallel Programs in Discrete Time and Space 1980 11 IPL Kinber, On Inclusion Problem for Deterministic Multitape Automata 1980 11 IPL Krawczyk, Error Correction by Mutational Grammars 1980 11 IPL Laut, Safe Procedural Implementations of Algebraic Types 1980 11 IPL Leiss, A Note on a Signature System Based on Probabilistic Logic 1980 11 IPL Leung & Merrill, A Note on Preemptive Scheduling of Periodic, Real-Time Tasks 1980 11 IPL Liu & Demers, An Algorithm for Testing Lossless Join Property in Relational Databases 1980 11 IPL Lloyd, Errata: List Scheduling Bounds for UET Systems with Resources 1980 11 IPL Loizou, On a Cycle Finding Algorithm 1980 11 IPL Loui, A Note on the Pebble Game 1980 11 IPL Luque & Ripoll, Tuning Architecture via Microprogramming 1980 11 IPL Majster-Cederbaum, A Simple Relation Between Relational and Predicate Transformer Semantics for Nondeterministic Programs 1980 11 IPL Moura, A Note on Grammatical Covers 1980 11 IPL Pajunen, On Two Theorems of Lenstra 1980 11 IPL Paredaens & Ponsaert, Grant Levels in an Authorization Mechanism 1980 11 IPL Peterson, A Note on Colored Petri Nets 1980 11 IPL Petreschi & Simeone, A Switching Algorithm for the Solution of Quadratic Boolean Equations 1980 11 IPL Pettorossi, Derivation of an O(k^2 log n) Algorithm for Computing Order-k Fibonacci Numbers from the O(k^3 log n) Matrix Multiplication Method 1980 11 IPL Preparata & Vuillemin, Area-Time Optimal VLSI Networks for Multiplying Matrices 1980 11 IPL Robson, Storage Allocation is NP-Hard 1980 11 IPL Romani, Shortest-Path Problem Is Not Harder than Matrix Multiplication 1980 11 IPL ten Hoopen, Consecutive Retrieval with Redundancy: An Optimal Linear and an Optimal Cyclic Arrangement and their Storage Space Requirements 1980 11 IPL ter Bekke, Convertibility in Databases 1980 11 IPL Urbanek, An O(log n) Algorithm for Computing the n^{th} Element of the Solution of a Difference Equation 1980 11 IPL Valiant, Computing Multivariate Polynomials in Parallel 1980 11 IPL van Leeuwen & Wood, Erratum: Dynamization of Decomposable Searching Problems 1980 11 IPL Williams, Batch Sizes for the Batching Method of Colouring Planar Maps 1980 11 IPL Williams, Cubic Map Configurations 1980 11 IPL Yao, A Note on the Analysis of Extendible Hashing 1980 10 IPL Akl, Corrigendum on Convex Hull Algorithms 1980 10 IPL Anderson, Encoded Pointers--An Interesting Data-Structure for Modern Sil's 1980 10 IPL Arora & Rana, Analysis of the Module Assignment Problem in Distributed Computing Systems with Limited Storage 1980 10 IPL Barnden, A Characterization of Systems Derived from Terminating Concurrent Histories 1980 10 IPL Ben-Ari, A Simplified Proof that Regular Resolution is Exponential 1980 10 IPL Bertossi, On the Complexity fo Scheduling Jobs on Dedicated Resources to Minimize Set-up Costs 1980 10 IPL Blum & Chandra & Wegman, Equivalence of Free Boolean Graphs Can Be Decided Probabilistically in Polynomial Time 1980 10 IPL Bohm & Machi & Sontacchi, Complexity Bounds for Equivalence and Isomorphism of Latin Squares 1980 10 IPL Booth, Lexicographically Least Circular Substrings 1980 10 IPL Brandwajn & Joly, A Scheme for Fault-Tolerant Virtual Memory 1980 10 IPL Broy & Wirsing, Program Development: From Enumeration to Backtracking 1980 10 IPL Bui, A Note on an Improved Bisection Algorithm 1980 10 IPL Buneman & Levy, The Towers of Hanoi Problem 1980 10 IPL Burton & Lewis, A Robust Variation of Interpolation Search 1980 10 IPL Cellary & Mayer, A simple Model of Query Scheduling in Distributed Data Base Systems 1980 10 IPL Chung & Luccio & Wong, A New Permutation Algorithm for Bubble Memories 1980 10 IPL Czaja, Deadlock and Fairness in Parallel Schemas: A Set-Theoretic Characterization and Decision Problems 1980 10 IPL Czaja, Parallel System Schemas and Their Relation to Automata 1980 10 IPL Deb, Conflict-Free Access of Arrays--a Counter Example 1980 10 IPL Doran & Thomas, Variants of the Software Solution to Mutual Exclusion 1980 10 IPL Ehrenfeucht & Rozenberg, On the Emptiness of Intersection of Two D0S Languages Problem 1980 10 IPL Farley, Levelling Terrain Trees: A Transshipment Problem 1980 10 IPL Fraenkel & Yesha, Complexity of Solving Algebraic Equations 1980 10 IPL Goldschlager, A Space Efficient Algorithm for the Monotone Planar Circuit Value Problem 1980 10 IPL Gordon, The Denotational Semantics of Sequential Machines 1980 10 IPL Hemerik, Formal Derivation of a List Processing Program 1980 10 IPL Honeyman & Ladner & Yannakakis, Testing the Universal Instance Assumption 1980 10 IPL Inoue & Takanami, A Note on Decision Problems for Three-Way Two-Dimensional Finite Automata 1980 10 IPL Jazayeri, An Improvement in the Iterative Data Flow Analysis Algorithm 1980 10 IPL Kessels, The Readers and Writers Problem Avoided 1980 10 IPL Kirkpatrick, A Note on Delaunay and Optimal Triangulations 1980 10 IPL Lengauer & Tarjan, The Space Complexity of Pebble Games on Trees 1980 10 IPL Liang, A Lower Bound for On-Line Bin Packing 1980 10 IPL Lloyd, List Scheduling Bounds for UET Systems with Resources 1980 10 IPL Luccio & Mazzone, A Cryptosystem for Multiple Communication 1980 10 IPL Meijer & Akl, The Design and Analysis of a New Hybrid Sorting Algorithm 1980 10 IPL Melville & Gries, Controlled Density Sorting 1980 10 IPL Nakamura & Inoue, A Remark on Two-Dimensional Finite Automata 1980 10 IPL Olivie, On the Relationship between Son-Trees and Symmetric Binary B-Trees 1980 10 IPL Overmars & van Leeuwen, Further Comments on Bykat's Convex Hull Algorithm 1980 10 IPL Pagan, On the Generation of Compilers from Language Definitions 1980 10 IPL Passy, Structured Programs for Turing Machines 1980 10 IPL Rayward-Smith & Rolph, Finding Linear and Circular Sequences of Minimal and Maximal Total Adjacency 1980 10 IPL Sabelfeld, The Logic-Termal Equivalence is Polynomial-Time Decidable 1980 10 IPL Samet & Marcus, Purging in an Equality Data Base 1980 10 IPL Santoro, Extending the Four Russians' Bound to General Matrix Multiplication 1980 10 IPL Sarwate, A Note on Universal Classes of Hash Functions 1980 10 IPL Savage, Maximum Matchings and Trees 1980 10 IPL Sleator, A 2.5 Times Optimal Algorithm for Packing in Two Dimensions 1980 10 IPL Truszczynski, Once More on Storage for Consecutive Retrieval 1980 10 IPL van der Nat, A Fast Sorting Algorithm, a Hybrid of Distributive and Merge Sorting 1980 10 IPL van Emde Boas, On the Omega(n log n) Lower Bound for Convex Hull and Maximal Vector Determination 1980 10 IPL van Leeuwen & Wood, Dynamization of Decomposable Searching Problems 1980 10 IPL Vitanyi, Achievable High Scores of epsilon-Moves and Running Times in DPDA Computations 1980 10 IPL Wallis & Silverman, Efficient Implementation of the Ada Overloading Rules 1980 10 IPL Wang, Some New Results on Isotonic Array Grammars 1980 10 IPL Watanabe, Another Application of Recursion Introduction 1980 10 IPL Wilson & Shortt, An O(log n) Algorithm for Computing General Order-k Fibonacci Numbers 1980 10 IPL Zaniolo, Mixed Transitivity for Functional and Multivalued Dependencies in Database Relations 1979 9 IPL Akritas, On the Solution of Polynomial Equations Using Continued Fractions 1979 9 IPL Andrew, Another Efficient Algorithm for Convex Hulls in Two Dimensions 1979 9 IPL Arora & Rana, On Module Assignment in Two-Processor Distributed Systems 1979 9 IPL Berry & Schwartz, United and Discriminated Record Types in Strongly Typed Languages 1979 9 IPL Best, A Note on the Proof of a Concurrent Program 1979 9 IPL Bini & Capovani, Lower Bounds of the Complexity of Linear Algebras 1979 9 IPL Brown, Some Observations on Random 2-3 Trees 1979 9 IPL Brown, Voronoi Diagrams from Convex Hulls 1979 9 IPL Bykat, On Polygon Similarity 1979 9 IPL Chandy & Misra, Deadlock Absence Proofs for Networks of Communicating Processes 1979 9 IPL Cherniavsky & Keohane & Henderson, A Note Concerning Top Down Program Development and Restricted Exit Control Structures 1979 9 IPL Cockayne & Ruskey & Thomason, An Algorithm for the Most Economic Link Addition in a Tree Communication Network 1979 9 IPL Colbourn, The Complexity of Symmetrizing Matrices 1979 9 IPL DeMillo & Miller, Implicit Computation of Synchronization Primitives 1979 9 IPL Dershowitz, A Note on Simplification Orderings 1979 9 IPL Devai & Szendrenyi, Comments on Convex Hull of a Finite Set of Points in Two Dimensions 1979 9 IPL Eberlein, A Note on Medium Selection and Spider Production 1979 9 IPL Ehrenfeucht & Rozenberg, An Observation on Scattered Grammars 1979 9 IPL Ehrenfeucht & Rozenberg, Finding a Homomorphism between Two Words is NP-Complete 1979 9 IPL Ferrari & Guida, DB: A LISP-Type Data Base System 1979 9 IPL Fournier & Kedem, Comments on the All Nearest-Neighbor Problem for Convex Polygons 1979 9 IPL Franklin, Padded Lists: Set Operations in Expected Theta(log log N) Time 1979 9 IPL Friedman & Wise, Erratum: Output Driven Interpretation of Recursive Programs, or Writing Creates and Destroys Data Structures 1979 9 IPL Grabowski, The Unsolvability of Some Petri Net Language Problems 1979 9 IPL Grant, Partial Values in a Tabular Database Model 1979 9 IPL Gunn & Morrison, On the Implementation of Constants 1979 9 IPL Harel, Erratum: Two Results on Process Logic 1979 9 IPL Itai, A Randomized Algorithm for Checking Equivalence of Circular Lists 1979 9 IPL Itano, Reduction of Page Swaps on the Two Dimensional Transforms in a Paging Environment 1979 9 IPL Jackowski & Kubiak & Sokolowski, Complexity of Sorting by Distributive Partitioning 1979 9 IPL Jonkers, A Fast Garbage Compaction Algorithm 1979 9 IPL Langmaack & Lippe & Wagner, The Formal Termination Problem for Programs with Finite ALGOL 68-Modes 1979 9 IPL Lao, A New Data Structure for the UNION-FIND Problem 1979 9 IPL Lee & Yang, Location of Mutliple Points in a Planar Subdivision 1979 9 IPL Leung, bounds on List Scheduling of UET Tasks with Restricted Resource Constraints 1979 9 IPL Luk, `Possible' Membership of a Multivalued Dependency in a Relational Database 1979 9 IPL Manacher & Zobrist, Neither the Greedy nor the Delaunay Triangulation of a Planar Point Set Approximates the Optimal Triangulation 1979 9 IPL McCallum & Avis, A Linear Algorithm for Finding the Convex Hull of a Simple Polygon 1979 9 IPL Mitchell & Hedetniemi, Linear Algorithms for Edge-Coloring Trees and Unicyclic Graphs 1979 9 IPL Mitchell, Linear Algorithms to Recognize Outerplanar and Maximal Outerplanar Graphs 1979 9 IPL Moore, A Mechanical Proof of the Termination of Takeuchi's Function 1979 9 IPL Morris, Traversing Binary Trees Simply and Cheaply 1979 9 IPL Nijholt, From Left-Regular to Greibach Normal Form Grammars 1979 9 IPL Nozaki, A Note on the Complexity of Approximative Evaluation of Polynomials 1979 9 IPL Oulsnam, Cyclomatic Numbers Do Not Measure Complexity of Unstructured Programs 1979 9 IPL Prini, Stack Implementation of Shallow Binding in Languages with Mixed Scoping 1979 9 IPL Robson, The Emptiness of Complement Problem for Semi Extended Regular Expressions Requires c^n Space 1979 9 IPL Schwartz, Aliasing Among Pointers in EUCLID 1979 9 IPL Sengupta & Bandyopadhyay & Srimani, On Identification of CR Property in File Organisation 1979 9 IPL Slowinski, Cost-Minimal Preemptive Scheduling of Independent Jobs with Release and Due Dates on Open Shop Under Resource Constraints 1979 9 IPL Srinivasan & Rajaraman, On the Normalization of Relational Databases 1979 9 IPL Szwarcfiter, Systems of Distinct Representatives for k Families of Sets 1979 9 IPL Teskey, Document Retrieval Using Associative Processors 1979 9 IPL Veloso, Characterizing the Regular Prefix Codes and Right Power-Bounded Languages 1979 9 IPL Williams & Bulmer, A Transportable Code Generator System 1979 9 IPL Yao, A Note on a Conjecture of Kam and Ullman Concerning Statistical Databases 1979 9 IPL Yao, Graph 2-Isomorphism is NP-Complete 1979 9 IPL Yehudai, A Note on the Pumping Lemma for Regular Languages 1979 8 IPL Abelson, A Note on Time-Space Tradeoffs for Computing Continuous Functions 1979 8 IPL Akl & Toussaint, Addendum to ``An Improved Algorithm to Check for Polygon Similarity'' 1979 8 IPL Akl, Two Remarks on a Convex Hull Algorithm 1979 8 IPL Angluin, A Note on a Construction of Margulis 1979 8 IPL Aspvall & Plass & Tarjan, A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas 1979 8 IPL Bentley & Maurer, A Note on Euclidean Near Neighbor Searching in the Plane 1979 8 IPL Bentley, Decomposable Searching Problems 1979 8 IPL Bertoni & Mauri & Torelli, Three Efficient Algorithms for Counting Problems 1979 8 IPL Bini & Capovani & Romani & Lotti, O(n^{2.7799}) Complexity for n x n Approximate Matrix Mutliplication 1979 8 IPL Blazewicz, Deadline Scheduling of Tasks with Ready Times and Resource Constraints 1979 8 IPL Bonuccelli & Bovet, Minimum Node Disjoint Path Covering for Circular-Arc Graphs 1979 8 IPL Brown, Addendum to ``A Storage Scheme for Height-Balanced Trees'' 1979 8 IPL Broy & Wirsing & Finance & Quere & Remy, Methodical Solution of the Problem of Ascending Subsequences of Maximum Length within a Given Sequence 1979 8 IPL Buda, Generalized^{1.5} Sequential Machine Maps 1979 8 IPL Bui, Erratum: On an L-Stable Method for Stiff Differential Equations 1979 8 IPL Cellary, A New Safety Test for Deadlock Avoidance 1979 8 IPL Cherniavsky, On Finding Test Data Sets for Loop Free Programs 1979 8 IPL Culik & Maurer, Secure Information Storage and Retrieval Using New Results in Cryptography 1979 8 IPL Culik, Some Decidability Results about Regular Pushdown Translations 1979 8 IPL Czaja, A Specification of Parallel Problems 1979 8 IPL Dobkin & Lipton & Reiss, Linear Programming is Log-Space Hard for P 1979 8 IPL Dobosiewicz, The Practical Significance of D. P. Sort Revisited 1979 8 IPL Fischer & Tai & Milton, Immediate Error Detection in Strong LL(1) Parsers 1979 8 IPL Fortune & Hopcroft, A Note on Rabin's Nearest-Neighbor Algorithm 1979 8 IPL Fournier, Comments on Convex Hull of a Finite Set of Points in Two Dimensions 1979 8 IPL Fraenkel, Paired Sequential Lists in a Memory Interval 1979 8 IPL Fridman & Holloway & Minsky, Abstract FOR-Loops over Several Aggregates 1979 8 IPL Friedman & Wise, Reference Counting Can Manage the Circular Environments of Mutual Recursion 1979 8 IPL Gonnet, Erratum: Notes on the Derivation of Asymptotic Expressions from Summations 1979 8 IPL Gurari & Ibarra, On the Space Complexity of Recursive Algorithms 1979 8 IPL Harel, Two Results on Process Logic 1979 8 IPL Henno, The Depth of Monotone Functions in Multivalued Logic 1979 8 IPL Hitotumatu & Noshita, A Technique for Implementing Backtrack Algorithms and Its Application 1979 8 IPL Huits & Kumar, The Practical Significance of Distributive Partitioning Sort 1979 8 IPL Inoue & Takanami, A Note on Bottom-Up Pyramid Acceptors 1979 8 IPL Inoue & Takanami, A Note on Cyclic Closure Operations 1979 8 IPL Jantzen, A Note on Vector Grammars 1979 8 IPL Kessels & Martin, Two Implementations of the Conditional Critical Region Using a Split Binary Semaphore 1979 8 IPL Kruijer, Self-Stabilization (in Spite of Distributed Control) in Tree-Structured Systems 1979 8 IPL Kundu, An Intermediate-Value Theorem for Optimum Tree Valuation 1979 8 IPL Leipala, On a Generalization of Binary Search 1979 8 IPL Lenstra, Miller's Primality Test 1979 8 IPL Loizou, Mathematical Solution for a Data Processing System 1979 8 IPL Lyon, Batch Scheduling from Short Lists 1979 8 IPL Makarov, Using Duality to Compute the Pair of Matrix Products QY and Y^TQ over a Commutative Ring 1979 8 IPL Mathon, A Note on Graph Isomorphism Counting Problem 1979 8 IPL Misra, Space-Time Trade Off in Implementing Certain Set Operations 1979 8 IPL Morris, A Starvation-Free Solution to the Mutual Exclusion Problem 1979 8 IPL Muhlbacher, F-Factors of Graphs: A Generalized Matching Problem 1979 8 IPL Osborn, Testing for Existence of a Covering Boyce-Codd Normal Form 1979 8 IPL Pankov & Dolmatov, Substantiable Evaluations by Electronic Computers and Their Application to One Problem in Combinatorial Geometry 1979 8 IPL Papadimitriou, Efficient Search for Rationals 1979 8 IPL Paun, On Szilard's Languages Associated to a Matrix Grammar 1979 8 IPL Pequeno & Lucena, An Approach for Data Type Specification and its Use in Program Verification 1979 8 IPL Plesnik, The NP-Completeness of the Hamiltonian Cycle Problem in Planar Digraphs with Degree Bound Two 1979 8 IPL Reisig, A Note on the Representation of Finite Tree Automata 1979 8 IPL Reiss, Rational Search 1979 8 IPL Rick & Evans, An Improved Bisection Algorithm 1979 8 IPL Rivest & van de Wiele, An Omega((n/lg n)^{1/2}) Lower Bound on the Number of Additions Necessary to Compute 0-1 Polynomials over the Ring of Integer Polynomials 1979 8 IPL Rosenberg, A Note on Paths Embedded in Trees 1979 8 IPL Ruohonen, The Decidability of the F0L-D0L Equivalence Problem 1979 8 IPL Sang Ajang & Teer, An Efficient Algorithm for Detection of Combined Occurrences 1979 8 IPL Shamir, Factoring Number in O(log n) Arithmetic Steps 1979 8 IPL Shiloach, A Fast Equivalence-Checking Algorithm for Circular Lists 1979 8 IPL Shiloach, Edge-Disjoint Branching in Directed Multigraphs 1979 8 IPL Shiloach, Strong Linear Orderings of a Directed Network 1979 8 IPL Silva-Filho, Average Case Analysis of Region Search in Balanced k-d trees 1979 8 IPL Simovici & Grigoras, Even Initial Feedback Vertex Set Problem is NP-Complete 1979 8 IPL Soundararajan, Axiomatic Proofs of Total Correctness of Programs 1979 8 IPL Stoyan & Socolovsky, The Minimization Method for Some Permutation Functionals 1979 8 IPL Ukkonen, The Nonexistence of Some Covering Context-Free Grammars 1979 8 IPL van der Knijff & Lassez, A Clarification of the Comparison between Some Measures of Software Science 1979 8 IPL van der Nat, Binary Merging by Partitioning 1979 8 IPL van Leeuwen, On Compromising Statistical Data-Bases with a Few Known Elements 1979 8 IPL Vikas, Analysis of a Periodically Inspected Buffer 1979 8 IPL Yang & Lee, A Note on the All Nearest-Neighbor Problem for Convex Polygons 1979 8 IPL Yuval, Corrigendum: A Simple Proof of Strassen's Result 1978 IPL Ajtai & Komlos & Szemeredi, There is No Fast Single Hashing Algorithm 1978 IPL Akl & Toussaint, A Fast Convex Hull Algorithm 1978 IPL Akl & Toussaint, An Improved Algorithm to Check for Polygon Similarity 1978 IPL Akl, Comments on: G. Manacher, An Application of Pattern Matching to a Problem in Geometrical Complexity 1978 IPL Allison, Phrase Structures, Non-Determinism and Backtracking 1978 IPL Anderson, A Reevaluation of an Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set 1978 IPL Arora & Subramanian, An Optimal Demand Prepaging Algorithm 1978 IPL Arora & Subramanian, Exploiting the Optimal Paging Algorithms 1978 IPL Bentley & Shamos, Divide and Conquer for Linear Expected Time 1978 IPL Bergstra, What is an Abstract Datatype? 1978 IPL Boari & Natali, Erratum: Mutliple Access to a Tree in the Context of Readers and Writers Problem 1978 IPL Boari & Natali, Mutliple Access to a Tree in the Context of Readers and Writers Problem 1978 IPL Bongiovanni & Luccio, On Cahit's Result on Graceful Permutations 1978 IPL Brandwajn & Kruchten & Hernandez, ARCADE--A System for Research and Education in Computer Architecture 1978 IPL Bratko, Proving Correctness of Strategies in the AL1 Assertional Language 1978 IPL Brown, A Storage Scheme for Height-Balanced Trees 1978 IPL Burton, Comments on: Sorting by Distributive Partitioning 1978 IPL Bykat, Convex Hull of a Finite Set of Points in Two Dimensions 1978 IPL Camerini, The Min-Max Spanning Tree Problem and Some Extensions 1978 IPL Caviness & Epstein, A Note on the Complexity of Algebraic Differentiation 1978 IPL Cheston, A Correction to a Unilaterally Connected Components Algorithm 1978 IPL Clark & Green, A Note on Shared List Structure in LISP 1978 IPL Crespi-Reghizzi & Mandrioli, A Class of Grammar Generating Non-Counting Languages 1978 IPL Culik, The Decidability of v-Local Catenativity and of Other Properties of D0L Systems 1978 IPL Czaja, Implementaion Approach to Parallel Systems 1978 IPL Czaja, Parallel Implementation of Path Expressions 1978 IPL de Champeaux, Substad: For Fast Substitution in LISP, with an Application on Unification 1978 IPL Demetrovics, On the Number of Candidate Keys 1978 IPL Demillo & Lipton, A Probabilistic Remark on Algebraic Program Testing 1978 IPL Devillers & Lauer, A General Mechanism for Avoiding Starvation with Distributed Control 1978 IPL Dobosiewicz, Author's reply to Warren Burton's comments on distributive partitioning sorting 1978 IPL Dobosiewicz, Sorting by Distributive Partitioning 1978 IPL Dolev & Shamir, Commutation Relations of Slices Characterize Some Synchronization Primitives 1978 IPL Engelfriet, On Tree Transducers for Partial Functions 1978 IPL Friedman & Greibach, On Equivalence and Subclass Containment Problems for Deterministic Context-Free Languages 1978 IPL Garey & Johnson & Preparata & Tarjan, Triangulating a Simple Polygon 1978 IPL Garey & Tarjan, A Linear-Time Algorithm for Finding All Feedback Vertices 1978 IPL Giegerich & Wilhelm, Counter-One-Pass Features in One-Pass Compilation: A Formalization Using Attribute Grammars 1978 IPL Glushkov & Tseytlin & Yushchenko, Certain Problems of the Theory of Structured Program Schemes 1978 IPL Gonnet, Notes on the Derivation of Asymptotic Expressions from Summations 1978 IPL Hansen, A Predecessor Algorithm for Ordered Lists 1978 IPL Hirschberg, An Information-Theoretic Lower Bound for the Longest Common Subsequence Problem 1978 IPL Howden, Lindenmayer Grammars and Symbolic Testing 1978 IPL Huet, An Algorithm to Generate the Basis of Solutions to Homogeneous Linear Diophantine Equations 1978 IPL Hughes, The Equivalence of Vector Addition Systems to a Subclass of Post Canonical Systems 1978 IPL Illies, A Counterexample to the Generalized Aanderaa-Rosenberg Conjecture 1978 IPL Inoue & Takanami & Nakamura, A Note on Two-Dimensional Finite Automata 1978 IPL Istrail, Tag Systems Generating Thue Irreducible Sequences 1978 IPL Jaffe, Counting Productions in Context-Free Derivations 1978 IPL Jakobsson, Huffman Coding in Bit-Vector Compression 1978 IPL Kambayashi & Hayashi & Tanaka & Yajima, A Linear Storage Space Algorithm for a Reference Structure Index 1978 IPL Karayiannis & Loizou, Cycle Detection in Critical Path Networks 1978 IPL Koplowitz & Jouppi, A More Efficient Convex Hull Algorithm 1978 IPL Lee & Preparata, The All Nearest-Neighbor Problem for Convex Polygons 1978 IPL Lipton & Miller, A Batching Method for Coloring Planar Graphs 1978 IPL Malhotra & Kumar & Maheshwari, An O(/V/^3) Algorithm for Finding Maximum Flows in Networks 1978 IPL McColl, The Maximum Depth of Monotone Formulae 1978 IPL Merrett, QT Logic: Simpler and More Expressive than Predicate Calculus 1978 IPL Natarajan & White, Optimum Domination in Weighted Trees 1978 IPL Noshita & Masuda & Machida, On the Expected Behaviors of the Dijkstra's Shortest Path Algorithm for Complete Graphs 1978 IPL Paredaens, On the Expressive Power of the Relational Algebra 1978 IPL Paun, On the Generative Capacity of Simple Matrix Grammars of Finite Index 1978 IPL Peltola & Erkio, Insertion Merge Sorting 1978 IPL Preparata & Sarwate, An Improved Parallel Processor Bound in Fast Matrix Inversion 1978 IPL Reiser, A Linear Selection Algorithm for Sets of Elements with Weights 1978 IPL Rohlf, A Probabilistic Minimum Spanning Tree Algorithm 1978 IPL Ruohonen, A Note on Language Equations Involving Morphisms 1978 IPL Samet, A Canonical Form Algorithm for Proving Equivalence of Conditional Forms 1978 IPL Schachtel, A Noncommutative Algorithm for Mutliplying 5 x 5 Matrices Using 103 Mutliplications 1978 IPL Selkow, New Bounds for the Clique Number of a Graph 1978 IPL Sethi & Rajaraman & Kenjale, An Error-Correcting Coding Scheme for Alphanumeric Data 1978 IPL Shortt, An Iterative Program to Calculate Fibonacci Numbers in O(log n) Arithmetic Operations 1978 IPL Sokolowski, A Method for Proving Programming Languages Non Context-Free 1978 IPL Sudborough, A Note on Weak Operator Precedence Grammars 1978 IPL Terashima & Goto, Genetic Order and Compactifying Garbage Collectors 1978 IPL Teuhola, A Compression Method for Clustered Bit-Vectors 1978 IPL Tsur, Analysis of Queuing Networks in Which Processes Exhibit Locality-Transition Behaviour 1978 IPL Winkowski, Erratum: An Algebraic Characterization of the Behaviour of Non-Sequential Systems 1978 IPL Yuval, A Simple Proof of Strassen's Result 1977 IPL Albert & Mauer, The Class of Context-Free Languages is not an E0L Family 1977 IPL Banatre, Producing Optimised Code for Coercions 1977 IPL Bentley & Stanat & Williams, The Complexity of Finding Fixed-Radius Near Neighbors 1977 IPL Bird, Two Dimensional Pattern Matching 1977 IPL Blazewicz, Simple Algorithms for Multiprocessor Scheduling to Meet Deadlines 1977 IPL Brandwajn & Mouneix, A Study of a Page-on-Demand System 1977 IPL Bui, On an L-Stable Method for Stiff Differential Equations 1977 IPL Cahit, Realization of Graceful Permutation by a Shuffle-Exchange Network 1977 IPL Chin & Steiglitz, A Fast Error Evaluation Algorithm for Polynomial Approximation 1977 IPL Cohen & Katcoff, Automatic Solution of a Certain Class of Combinatorial Problems 1977 IPL Collins & Musser, Analysis of the Pope-Stein Division Algorithm 1977 IPL Deo & Krishnamoorthy & Pai, Generalizations of Line Graphs and Applications 1977 IPL Dinic & Kelmans & Zaitsev, Nonisomorphic Trees with the Same T-Polynomial 1977 IPL Endres & Stork, Fifo-Optimal Placement on Pages of Independently Referenced Sectors 1977 IPL Ershov, On the Partial Computation Principle 1977 IPL Francez, A Case for a Forward Predicate Transformer 1977 IPL Friedman & Wise, Erratum: Garbage Collecting a Heap Which Includes a Scatter Table 1977 IPL Gavril, Testing for Equality between Maximum Matching and Minimum Node Covering 1977 IPL Gonnet & Rogers, The Interpolation-Sequential Search Algorithm 1977 IPL Goto & Ida & Gunji, Parallel Hashing Algorithms 1977 IPL Grant, Addendum: Recognition of E0L Languages in Less than Quartic Time 1977 IPL Grant, Null Values in a Relational Data Base 1977 IPL Grant, Recognition of E0L Languages in Less than Quartic Time 1977 IPL Herschberg & Boekhorst, Concurrent File Access under Unpredictability 1977 IPL Hikita & Goto, An O(N) Algorithm for Finding Periodicity of a Sequence Using Hash Coding 1977 IPL Javor, An Adaptive Time Advancement Algorithm for Discrete Simulation 1977 IPL Jones, A Note on Linear Time Simulation of Deterministic Two-Way Pushdown Automata 1977 IPL Kittler, A Method for Determining Class Subspaces 1977 IPL Knuth, A Generalization of Dijkstra's Algorithm 1977 IPL Kobuchi, Two Characterization Theorems of Locally Catenative Developmental Systems 1977 IPL Kundu, Sorting Tree, Nestling Tree and Inverse Permutation 1977 IPL Lipski, One More Polynomial Complete Consecutive Retrieval Problem 1977 IPL Lukaszewicz, Functional Grammars 1977 IPL Madsen, An Experiment in Formal Definition of Operating System Facilities 1977 IPL Matwin, An Experimental Investigation of Geschke's Method of Global Program Optimization 1977 IPL Matwin, On the Completeness of a Set of Transformations Optimizing Linear Programs 1977 IPL Merrett, Relations as Programming Language Elements 1977 IPL Perl & Reingold, Understanding the Complexity of Interpolation Search 1977 IPL Raghavan & Yu, A Note on a Multidimensional Searching Problem 1977 IPL Raiha & Saarinen, An Optimization of the Alternating Semantic Evaluator 1977 IPL Rajaraman & Vikas, A First-in-First-out Buffered Cyclic Memory 1977 IPL Ramshaw, Binomial Coefficients with Non-Integral Lower Index 1977 IPL Reddi, Alternate Solutions to the Cigarette Smokers' Problem without Conditionals 1977 IPL Rowicki, A Note on Optimal Preemptive Scheduling for Two-Processor Systems 1977 IPL Sassa & Goto, ``V-Tape'', a Virtual Memory Oriented Data Type, and its Resource Requirements 1977 IPL Schnorr & Klupp, A Universally Hard Set of Formulae with Respect to Non-Deterministic Turing Acceptors 1977 IPL Selkow, The Tree-to-Tree Editing Problem 1977 IPL Shaw & Traub, Selection of Good Algorithms from a Family of Algorithms for Polynomial Derivative Evaluation 1977 IPL Steckelberg & Seth, On a Relation between Algebraic Programs and Turing Machines 1977 IPL Sudborough, A Note on Weak Operator Precedence Grammars 1977 IPL Talbert, On the Formal Specification of the Semantics of Processed Information 1977 IPL Turner, Error Diagnosis and Recovery in One Pass Compilers 1977 IPL van Emde Boas, Preserving Order in a Forest in Less than Logarithmic Time and Linear Space 1977 IPL Williams, Complete Operator Precedence Conditions 1977 IPL Winkowski, An Algebraic Characterization of the Behaviour of Non-Sequential Systems 1977 IPL Wurges, Comments on `Error Resynchronisation in Producer Consumer Systems' 1977 IPL Yuval, Theil's Estimator 1977 IPL Zuczek, The Universal Space for Parallel Computation 1976 5 IPL Arjomandi, On Finding All Unilaterally Connected Components of a Digraph 1976 5 IPL Barak, On the Parallel Evaluation of Division-Free Arithmetic Expressions with Fan-in of Three 1976 5 IPL Bentley & Yao, An Almost Optimal Algorithm for Unbounded Searching 1976 5 IPL Boari & Natali, Some Properties of Deadlock Detection and Recovery in Readers and Writers Problems 1976 5 IPL Bochmann, Comments on Monitor Definition and Implementation 1976 5 IPL Delcour & Duijvestein, Enclosures: An Access Control Mechanism with Applications in Parallel Programming and Other Areas of System Programming 1976 5 IPL Doyle & Rivest, Linear Expected Time of a Simple Union-Find Algorithm 1976 5 IPL Duske & Parchmann & Schumacher, A Pattern Representation of Indexed Languages 1976 5 IPL Friedman & Wise, Garbage Collecting a Heap Which Includes a Scatter Table 1976 5 IPL Friedman & Wise, Output Driven Interpretation of Recursive Programs, or Writing Creates and Destroys Data Structures 1976 5 IPL Gabow, A Note on Degree-Constrained Star Subgraphs of Bipartite Graphs 1976 5 IPL Gabow, Some Improved Bounds on the Number of 1-Factors of n-Connected Graphs 1976 5 IPL Gairola & Rajaraman, A Distributed Index Sequential Access Method 1976 5 IPL Guida & Somalvico, Semantics in Problem Representation and Search 1976 5 IPL Hansen, A Cascade Algorithm for the Logical Closure of a Set of Binary Relations 1976 5 IPL Hansen, Erratum: A Cascade Algorithm for the Logical Closure of a Set of Binary Relations 1976 5 IPL Hennell & Woodward & Hedley, On Program Analysis 1976 5 IPL Hyafil & Rivest, Constructing Optimal Binary Decision Trees is NP-Complete 1976 5 IPL Innes & Tsur, Interval Analysis, Pagination and Program Locality 1976 5 IPL Kaye, A Gray Code for Set partitions 1976 5 IPL Kundu, A Linear Algorithm for the Hamiltonian Completion Number of a Tree 1976 5 IPL Lawler, A Note on the Complexity of the Chromatic Number Problem 1976 5 IPL Linna, The D0L-ness for Context-Free Languages is Decidable 1976 5 IPL Lozinskii, On a Problem in Storage Optimization 1976 5 IPL Luccio & Preparata, Storage for Consecutive Retrieval 1976 5 IPL Lucena & Cowan, Toward a System's Environment for Computer Assisted Programming 1976 5 IPL Madsen & Rodrigue & Karush, Matrix Mutliplication by Diagonals on a Vector/Parallel Processor 1976 5 IPL Manacher, An Application of Pattern Matching to a Problem in Geometrical Complexity 1976 5 IPL Mandrioli, n-Reconstructability of Context-Free Grammars 1976 5 IPL Marsaglia & Ananthanarayanan & Paul, Improvements on Fast Methods for Generating Normal Random Variables 1976 5 IPL Maurer & Ottmann & Six, Implementing Dictionaries Using Binary Trees of Very Small Height 1976 5 IPL Meertens, A Space-Saving Technique for Assigning Algol 68 Mutliple Values 1976 5 IPL Mehlhorn, Bracket-Languages are Recognizable in Logarithmic Space 1976 5 IPL Partsch & Pepper, A Family of Rules for Recursion Removal 1976 5 IPL Probert, Commutativity, Non-Commutativity, and Bilinearity 1976 5 IPL Rozenberg, More on ET0L Systems versus Random Context Grammars 1976 5 IPL Samadi, B-Trees in a System with Mutliple Users 1976 5 IPL Santoro, Full Table Search by Polynomial Functions 1976 5 IPL Sassa & Goto, A Hashing Method for Fast Set Operations 1976 5 IPL Shyamasundar, A Note on Linear Precedence Functions 1976 5 IPL Trivedi, On a Semaphore Anomaly 1976 5 IPL Valiant, Relative Complexity of Checking and Evaluating 1976 5 IPL Wang, Erratum: Recursiveness of Monotonic Array Grammars and a Hierarchy of Array Languages 1976 5 IPL Wang, Recursiveness of Monotonic Array Grammars and a Hierarchy of Array Languages 1976 5 IPL Yu & Johnson, On the Complexity of Finding the Set of Candidate Keys for a Given Set of Functional Dependencies 1976 5 IPL Yuval, Finding Nearest Neighbors 1976 5 IPL Zave, A Series Expansion Involving the Harmonic Numbers 1976 4 IPL Barrow & Burstall, Subgraph Isomorphism, Matching Relational Structures and Maximal Cliques 1976 4 IPL Bentley & Burkhard, Heuristics for Partial-Match Retrieval Data Base Design 1976 4 IPL Chrobot, Layer--A Language Construction for Concurrent Structural Program Design 1976 4 IPL Coy, The Logical Meaning of Programs of a Subrecursive Language 1976 4 IPL Cunningham & Gilford, A Note on the Semantic Definition of Side Effects 1976 4 IPL De Wolf & De Mey, Numerical Solution of Integral Equations for Potential Problems by a Variational Principle 1976 4 IPL Dobkin & van Leeuwen, The Complexity of Vector-Products 1976 4 IPL Ehrich & Lipski, On the Storage Space Requirement of Consecutive Retrieval with Redundancy 1976 4 IPL Engelfriet & Skyum, Copying Theorems 1976 4 IPL Feyock, Noiselike Transform of omega-Events 1976 4 IPL Galil, Two Fast Simulations Which Imply Some Fast String Matching and Palindrome-Recognition Algorithms 1976 4 IPL Hanson, A Simple Variant of the Boundary-Tag Algorithm for the Allocation of Coroutine Environments 1976 4 IPL Krishnamurthy & Chandra, A Note on Precedence Functions 1976 4 IPL Krzemien & Lukasiewicz, Automatic Generation of Lexical Analyzers in a Compiler-Compiler 1976 4 IPL Lamport, Comments on ``A Synchronization Anomaly'' 1976 4 IPL Lang & Fernandez, Scheduling of Unit-Length Independent Tasks with Execution Constraints 1976 4 IPL Pritchard, A Proof Rule for Mutliple Coroutine Systems 1976 4 IPL Reusch, Generalized Lattices Applicable in Retrieval Models 1976 4 IPL Rozenberg & Wood, A Note on K-Iteration Grammars 1976 4 IPL Rozenberg, On Slicing of K-Iteration Grammars 1976 4 IPL Wessner, Optimal Alphabetic Search Trees with Restricted Maximal Height 1976 4 IPL Yuval, An Algorithm for Finding All Shortest Paths Using N^{2.81} Infinite-Precision Mutliplications 1975 4 IPL Anderssen & Guttmann, A Rationale for the Numerical Differentiation of Experimental Data 1975 4 IPL Banerjee & Rajaraman, A Dual Link Data Structure for Random File Organization 1975 4 IPL Christensen, Crossvalidation: Minimizing the Entropy of the Future 1975 4 IPL Clark, A Fast Algorithm for Copying Binary Trees 1975 4 IPL Cockayne & Goodman & Hedetniemi, A Linear Algorithm for the Domination Number of a Tree 1975 4 IPL Duncan & Yelowitz, Loop Unravelling: A Practical Tool in Proving Program Correctness 1975 4 IPL Germano & Maggiolo-Schettini, Sequence-to-Sequence Recursiveness 1975 4 IPL Hyafil & Van de Wiele, On the Additive Complexity of Specific Polynomials 1975 4 IPL Jarzabek & Krawczyk, LL-Regular Grammars 1975 4 IPL Johnson, Priority Queues with Update and Finding Minimum Spanning Trees 1975 4 IPL Kang & Ault, Some Properties of a Centroid of a Free Tree 1975 4 IPL Levy, Complete Operator Precedence 1975 4 IPL Misra & Tarjan, Optimal Chain Partitions of Trees 1975 4 IPL Nieminen, Some Observations on the Determination of an Upper Bound for the Clique Numbers of a Graph 1975 4 IPL Pearl, On the Complexity of Inexact Computations 1975 4 IPL Penttonen, ET0L-Grammars and N-Grammars 1975 4 IPL Rotem, On a Correspondence between Binary Trees and a Certain Type of Permutation 1975 4 IPL Rowicki, A Note on Optimal Scheduling for Two-Processor Systems 1975 4 IPL Ruohonen, Three Results of Comparison between L Languages with and without Interaction 1975 4 IPL Sekey, A Generating Function for Entropy 1975 4 IPL Yao, An O(/E/ log log /V/) Algorithm for Finding Minimum Spanning Trees 1975 3 IPL Asai & Lee, Design of Queuing Buffer Register Size 1975 3 IPL Bentley & Stanat, Analysis of Range Searches in Quad Trees 1975 3 IPL Brinch Hansen, Universal Types in Concurrent Pascal 1975 3 IPL Cahit & Cahit, On the Graceful Numbering of Spanning Trees 1975 3 IPL Camerini & Maffioli, Bounds for 3-Matroid Intersection Problems 1975 3 IPL Cohen, Interpretation of Non-Deterministic Algorithms in Higher-Level Languages 1975 3 IPL Crespi-Reghizzi & Mandrioli, A Decidability Theorem for a Class of Vector-Addition Systems 1975 3 IPL Crespi-Reghizzi & Mandrioli, Erratum: A Decidability Theorem for a Class of Vector Addition Systems 1975 3 IPL Dal Bono & Diligenti & Mosca & Ricci & Villani, A Simple FORTRAN Support for Computer-Assisted Instruction 1975 3 IPL Dasgupta & Tartar, On the Minimization of Control Memories 1975 3 IPL de Groote, On the Complexity of Quaternion Mutliplication 1975 3 IPL De Wolf & De Mey, Numerical Methods for Solving Integral Equations of Potential Problems 1975 3 IPL Galand & Loncour, Structured Implementation of Symbolic Execution: A First Part in a Program Verifier 1975 3 IPL Gavril, An Algorithm for Testing Chordality of Graphs 1975 3 IPL Ghezzi, LL(1) Grammars Supporting an Efficient Error Handling 1975 3 IPL Hosono, On the Cardinality of Some Lattices 1975 3 IPL Kameda, On the Vector Representation of the Reachability in Planar Directed Graphs 1975 3 IPL Keir, Should the Stable Rounding Rule be Radix-Dependent 1975 3 IPL Kittler, On the Divergence and the Joshi Dependence Measure in Feature Selection 1975 3 IPL Knuth & Reiser, Erratum: Evading the Drift in Floating-Point Addition 1975 3 IPL Lazos, A Comparison of Simulation Results and a Mathematical Model of a Multiprogramming System 1975 3 IPL Lipton & Tuttle, A Synchronization Anomaly 1975 3 IPL Pleszczynski, On the Generation of Permutations 1975 3 IPL Preparata & Muller, The Time Required to Evaluate Division-Free Arithmetic Expressions 1975 3 IPL Reiser & Knuth, Evading the Drift in Floating-Point Addition 1975 3 IPL Rem, On the Programming of Elastic Stores 1975 3 IPL Robson, A Simple Solution to the Interleaved Memory Bandwidth Problem 1975 3 IPL Sridharan, Erratum: Computer Generation of Vertex Graphs 1975 3 IPL Stevens, An Elementary Computer Algorithm for the Calculation of the Coefficient of Inbreeding 1975 3 IPL van Leeuwen, The Membership Question for ET0L-Languages is Polynomially Complete 1975 3 IPL von Solms, On T0L Languages over Terminals 1975 3 IPL Wegbreit, Retrieval from Context Trees 1975 3 IPL Weihrauch, Program Schemata with Polynomial Bounded Counters 1975 3 IPL Yuval, Finding Near Neighbors in K-Dimensional Space 1975 3 IPL Zave, A Fast Compacting Garbage Collector 1974 3 IPL Arnborg, Abstract Computation Model Used for a Production Compiler 1974 3 IPL Campbell, Optimal Use of Storage in a Simple Model of Garbage Collection 1974 3 IPL Cooprider & Heymans & Courtois & Parnas, Information Streams Sharing a Finite Buffer: Other Solutions 1974 3 IPL Deimel, Remark on the Computational Power of a Turing Machine Variant 1974 3 IPL Fisher, Bounded Workspace Garbage Collection in an Address-Order Preserving List Processing Environment 1974 3 IPL Ibarra, A Note on Semilinear Sets and Bounded-Reversal Multihead Pushdown Automata 1974 3 IPL Jovanovich, Note on a Modification of the Fundamental Cycles Finding Algorithm 1974 3 IPL Knuth & Szwarcfiter, Erratum: A Structured Program to Generate All Topological Sorting Arrangements 1974 3 IPL Kobayashi, A Note on Extending Equivalence Theories of Algorithms 1974 3 IPL Minker & VanderBrug, The Earley Algorithm as a Problem Representation 1974 3 IPL Noshita, Median Selection of 9 Elements in 14 Comparisons 1974 3 IPL Sridharan, Computer Generation of Vertex Graphs 1974 3 IPL Takaoka, A Note on the Ambiguity of Context-Free Grammars 1974 3 IPL Tarjan, A Good Algorithm for Edge-Disjoint Branching 1974 3 IPL Tarjan, A New Algorithm for Finding Weak Components 1974 3 IPL van Leeuwen & Smith, An Improved Bound for Detecting Looping Configurations in Deterministic DPA's 1974 3 IPL Zelkowitz, Structured Operating System Organization 1974 2 IPL Dewar, A Stable Minimum Storage Sorting Algorithm 1974 2 IPL Hansal, ``Software Devices'' for Processing Graphs Using PL/I Compile Time Facilities 1974 2 IPL Hoare, Optimization of Store Size for Garbage Collection 1974 2 IPL Jackson & Dasgupta, The Identification of Parallel Micro-Operations 1974 2 IPL Knuth & Szwarcfiter, A Structured Program to Generate All Topological Sorting Arrangements 1974 2 IPL Lee & Rozenberg, The Length Sets of D0L Languages are Uniformly Bounded 1974 2 IPL Middleton, Cost-Oriented Program Optimisation 1974 2 IPL Solntseff, On a Notational Device for the Description of Pointer-Free Operations on Structured Data 1974 2 IPL Tarjan, A Note on Finding the Bridges of a Graph 1973 2 IPL Adams, Another Representation of Binary Tree Traversal 1973 2 IPL Barnett, A Technique for Reducing Comparison Times in Certain Applications of the Merging Method of Sorting 1973 2 IPL Boasson, The Inclusion of the Substitution Closure of Linear and One-Counter Languages in the Largest Sub-AFL of the Fanmily of Algebraic Languages is Proper 1973 2 IPL Boffey, Applying the Minimax Rule over Graphs Which are not Trees 1973 2 IPL Coffman, A Note on the Relative Performance of Two Disk Scanning Policies 1973 2 IPL Coffy, On Computing the Time Complexity of Transitive Closure Algorithms 1973 2 IPL Cohen, Syntax-Directed Unit Conversion 1973 2 IPL Cremers & Maurer & Mayer, A Note on Leftmost Restricted Random Context Grammars 1973 2 IPL Devillers & Louchard, Realization of Petri Nets without Conditional Statements 1973 2 IPL Dwyer, Simple Algorithms for Traversing a Tree without an Auxiliary Stack 1973 2 IPL Ehrenfeucht & Rozenberg, A Limit Theorem for Sets of Subwords in Deterministic T0L Languages 1973 2 IPL Floyd & Smith, A Linear Time Two Tape Merge 1973 2 IPL Francez & Slutzky, On the Non-Compactness of the Class of Program Schemas 1973 2 IPL Henhapl, A Transformation of Marked Graphs 1973 2 IPL Herman, On Universal Computer-Constructors 1973 2 IPL Heuer & Molchanov, Numerical Solution of a Boundary Problem for Equations of Elastic Equilibrium of Bodies in Transferences 1973 2 IPL Hoare, A General Conservation Law for Queueing Dicsiplines 1973 2 IPL Holnapy & Szots & Botar, A Generalization of the Method of Finite Differences 1973 2 IPL Jarvis, On the Identification of the Convex Hull of a Finite Set of Points in the Plane 1973 2 IPL Karhumaki, An Example of a PD2L-System with the Growth Type 2 1/2 1973 2 IPL Kasyanov, Some Properties of Fully Reducible Graphs 1973 2 IPL Kral & Demner, A Note on the Number of States of the De Remer's Recognizer 1973 2 IPL Krogdahl, A Dynamic Storage Allocation Problem 1973 2 IPL Kung, A New Upper Bound on the Complexity of Derivative Evaluation 1973 2 IPL Lindstrom, Scanning List Structures without Stacks or Tag Bits 1973 2 IPL Minsky, Representation of Binary Trees on Associative Memories 1973 2 IPL Mizumoto & Toyoda & Tanaka, Examples of Formal Grammars with Weights 1973 2 IPL Molchanov & Galba, On the Convergence of Difference Schemes Approximating a Plane Static Problem of the Theory of Elasticity with Mixed Boundary Conditions 1973 2 IPL Molchanov & Iakovlev, On the Class of Iterative Methods for Obtaining the Generalized Solution of Non-Consistent Systems of Linear Algebraic Equations 1973 2 IPL Robson, An Improved Algorithm for Traversing Binary Trees without Auxiliary Stack 1973 2 IPL Roschke & Furtado, An Algorithm for Obtaining the Chromatic Number and an Optimal Coloring of a Graph 1973 2 IPL Rosenfeld & Milgram, Parallel/Sequential Array Automata 1973 2 IPL Roussopoulos, A Max{m,n} Algorithm for Determining the Graph H from its Line Graph C 1973 2 IPL Salton, Experiments in Multi-Lingual Information Retrieval 1973 2 IPL Sethi, A Note on Implementing Parallel Assignment Instructions 1973 2 IPL Tang & Wong, A Modified Branch-and-Bound Strategy 1973 2 IPL Varhegyi, Numerical Differentiation of Experimental Data 1973 2 IPL Warren, Minimal Comparison Sorting by Choosing Most Efficient Comparisons 1973 2 IPL Yuval, On a Problem Connected with Topological Sorting 1972 1 IPL Anderssen, A Refinement Procedure for Pure Random Search 1972 1 IPL Baker, An Unintentional Omission from ALGOL 68 1972 1 IPL Bayer, Oriented Balanced Trees and Equivalence Relations 1972 1 IPL Brandstetter, Storage Requirements in Stochastic Data Acquisition Systems 1972 1 IPL Branquart & Cardinael & Delescaille & Lewi, A Context-Free Syntax of ALGOL 68 1972 1 IPL Bron, Outline of a Machine without Branch Instructions 1972 1 IPL Carroll & Fraser & Gill, Automatic Content Analysis in an On-Line Environment 1972 1 IPL Chroust, Expression Evaluation with Minimum Average Working Storage 1972 1 IPL Dijkstra, Information Streams Sharing a Finite Buffer 1972 1 IPL Engelfriet, A Note on Infinite Trees 1972 1 IPL Findler, Short Note on a Heuristic Search Strategy in Long-Term Memory Networks 1972 1 IPL Graham, An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set 1972 1 IPL Gries, Programming by Induction 1972 1 IPL Horowitz, A Fast Method for Interpolation Using Preconditioning 1972 1 IPL Horowitz, Errata: A Fast Method for Interpolation with Preconditioning 1972 1 IPL Knuth & Floyd, Errata: Notes on Avoiding ``Go To'' Statements 1972 1 IPL Knuth & Kaehler, An Experiment in Optimal Sorting 1972 1 IPL Kral, A New Additive Pseudorandom Number Generator for Extremely Short Word-Lengths 1972 1 IPL Kral, Errata: A New Pseudorandom Number Generator for Extremely Short Word-Lengths 1972 1 IPL Krepyshev & Pollack, Synthesis of a Discrete-Time Optimal Filter Algorithm with Reduced Sensitivity to Deviations of a Priori Statistics 1972 1 IPL Mayoh, Recursion and Stacks 1972 1 IPL Molchanov & Nikolenko, On an Approach to Integrating Boundary Problems with a Non-Unique Solution 1972 1 IPL Molchanov & Stepanets, Iterative Methods for Solving Difference Equations of the Theory of Elasticity Not Depending on the Spacing of the Difference Set 1972 1 IPL Nievergelt & Pradels, Bounds on the Weighted Path Length of Binary Trees 1972 1 IPL Ogilvie & Olson, On the Use of Complete Subgraphs in Cluster Analysis 1972 1 IPL Reddy & Broadley & Erman & Johnsson & Newcomer & Robertson & Wright, XCRIBL-- A Hardcopy Scan Line Graphics System for Document Generation 1972 1 IPL Rozenberg, Direct Proofs of the Undecidability of the Equivalence Problem for Sentential Forms of Linear Context-Free Grammars and the Equivalence Problem for 0L Systems 1972 1 IPL Rozenberg, Errata: The Equivalence Problem for Deterministic T0L-Systems is Undecidable 1972 1 IPL Rozenberg, The Equivalence Problem for Deterministic T0L-Systems is Undecidable 1972 1 IPL Siklossy, Fast and Read-Only Algorithms for Traversing Trees without an Auxiliary Stack 1972 1 IPL Solntseff & Yezerski, ECT--An Extensible-Contractable Translator System 1972 1 IPL Solntseff, A Classification of Extensible Programming Languages 1972 1 IPL Tarjan, Determining Whether a Groupoid is a Group 1972 1 IPL Toussaint, Feature Evaluation with Quadratic Mutual Information 1972 1 IPL Tsichritzis, Protection in Operating Systems 1972 1 IPL Tzafestas, Design Parameters for a Multiserver Processing Buffering System with Feedback 1972 1 IPL Tzafestas, Input-Output Modeling and Identification of Linear Automata 1972 1 IPL van Dam & Tompa, Software Data Paging and Segmentation for Complex Systems 1972 1 IPL Vantilborgh & Van Lamsweerde, On an Extension of Dijkstra's Semaphore Primitives 1972 1 IPL Varney, Priority Processes Used for Scheduling within a Tree Structured Operating System 1972 1 IPL Whale, The Critical Value of the Basic Parameter of a Nonlinear Differential Equation 1972 1 IPL Zimmer, Soft Precedence 1971 1 IPL Borodin & Munro, Evaluating Polynomials at Many Points 1971 1 IPL Caviness & Pollack & Rubald, An Existence Lemma for Canonical Forms in Symbolic Mathematics 1971 1 IPL Corneil, An n^2 Algorithm for Determining the Bridges of a Graph 1971 1 IPL Duncan & Zissos, Programmed Simulation of Sequential Circuits 1971 1 IPL Gelenbe, The Two-Thirds Rule for Dynamic Storage Allocation under Equilibrium 1971 1 IPL Henhapl & Jones, A Run-Time Mechanism for Referencing Variables 1971 1 IPL Hopcroft & Tarjan, A V^2 Algorithm for Determining Isomorphism of Planar Graphs 1971 1 IPL Karlgren, Stacking without Really Stacking when Reducing Categorical Expressions 1971 1 IPL Knuth & Floyd, Notes on Avoiding ``Go To'' Statements 1971 1 IPL Maurer, The Solution of a Problem by Ginsburg 1971 1 IPL Merrett, General Programs for Management Systems 1971 1 IPL Milgram & Rosenfeld, A Note on Scattered Context Grammars 1971 1 IPL Munro, Efficient Determination of the Transitive Closure of a Directed Graph 1971 1 IPL Salton, The Performance of Interactive Information Retrieval 1971 1 IPL Scheidig, Representation and Equality of Modes 1971 1 IPL Stacey, The Role of Virtual Memory in the Handling of Application Files 1971 1 IPL Tsichritzis, A Note on Comparison of Subrecursive Hierarchies 1971 1 IPL Zissos & Duncan, Programmed Simulation of Race Hazards in Sequential Circuits 1996 10 IPPS Feitelson & Rudolph, Towards Convergence in Job Schedulers for Parallel Supercomputers 1996 10 IPPS Feitelson, Packing Schemes for Gang Scheduling 1996 10 IPPS Wang & Franke & Papaefthymiou & Pattnaik & Rudolph & Squillante, A Gang Scheduling Design for Multiprogrammed Parallel Computing Environments 1996 10 IPPS Chiang & Vernon, Dynamic vs. Static Quantum-Based Parallel Processor Allocation 1996 10 IPPS Blumofe & Frigo & Joerg & Leiserson & Randall, Dag-Consistent Distributed Shared Memory 1996 10 IPPS Kutylowski & Wierzbicki, Approximate Compaction and Padded-Sorting on Exclusive Write PRAMs 1996 10 IPPS Pinotti & Crupi & Das, A Parallel Solution to the Extended Set Union Problem with Unlimited Backtracking 1996 10 IPPS Ravikumar & Xiong, A Parallel Algorithm for Minimization of Finite Automata 1996 10 IPPS Deng & Zhu, A Randomized Algorithm for Voronoi Diagram of Line Segments on Coarse-Grained Multiprocessors 1996 10 IPPS Bhattacharyya & Sriram & Lee, Self-Timed Resynchronization: A Post-Optimization for Static Multiprocessor Schedules 1996 10 IPPS Liang & Brent, Constructing the Spanners of Graphs in Parallel 1996 10 IPPS Bader & JaJa, Practical Parallel Algorithms for Dynamic Data Redistribution, Media Finding, and Selection 1996 10 IPPS Chung & Condon, Parallel Implementation of Boruvka's Minimum Spanning Tree Algorithm 1996 10 IPPS Bader & JaJa & Harwood & Davis, Parallel Algorithms for Image Enhancement and Segmentation by Region Growing with an Experimental Study 1996 10 IPPS Harabagiu & Moldovan, A Parallel Algorithm for Text Inference 1996 10 IPPS Gu & Tamaki, Routing a Permutation in the Hypercube by Two Sets of Edge-Disjoint Paths 1996 10 IPPS Donaldson & Ferrante, Determining Asynchronous Acyclic Pipeline Execution Times 1996 10 IPPS Chlebus & Rolim & Slutzki, Distributing Tokens on a Hypercube without Error Accumulation 1996 10 IPPS Sengupta & Raghavendra, On Some Global Operations in Faulty SIMD Hypercubes 1996 10 IPPS Tadepalli & Lloyd, An Improved Approximation Algorithm for Scheduling Task Trees on Linear Arrays 1996 10 IPPS Kazerouni & Rajan & Shyamasundar, Mapping Linear Recurrences onto Systolic Arrays 1996 10 IPPS Park & Agrawal, Generic Methodologies for Deadlock-Free Routing 1996 10 IPPS Chang, Partitionability of the Multistage Interconnection Networks 1996 10 IPPS Hamdi & Song, On Embedding Various Networks into the Hypercube Using Matrix Transformations 1996 10 IPPS Izadi & Ozguner, Optimal Subcube Fault Tolerance in a Circuit-Switched Hypercube 1996 10 IPPS Tseng & Chang & Sheu, Fault-Tolerant Ring Embedding in Star Graphs 1996 10 IPPS Raksapatcharawong & Pinkston, An Optical Interconnect Model for k-ary n-cube Wormhole Networks 1996 10 IPPS Vaidyanathan & Nadella, Fault-Tolerant Multiple Bus Networks for Fan-In Algorithms 1996 10 IPPS Damaschke, Coping with Sparse Inputs on Enhanced Meshes -- Semigroup Computation with COMMON CRCW Buses 1996 10 IPPS Nakano & Olariu, An Optimal Algorithm for the Angle-Restricted All Nearest Neighbor Problem on the Reconfigurable Mesh 1996 10 IPPS Matthews & Martel, Parallel Algorithms Using Unreliable Broadcasts 1996 10 IPPS Pavel & Akl, Efficient Algorithms for the Hough Transform on Arrays with Reconfigurable Optical Buses 1996 10 IPPS Trahan & Lu & Vaidyanathan, Integer and Floating Point Matrix-Vector Multiplication on the Reconfigurable Mesh 1996 10 IPPS Gocal & Batcher, Bitonic Sorting on Benes Networks 1996 10 IPPS Bar-Noy & Ho, Broadcasting Multiple Messages in the Multiport Model 1996 10 IPPS Yang, A Class of Interconnection Networks for Multicasting 1996 10 IPPS Suh & Yalamanchili, Algorithms for All-to-All Personalized Exchange in 2D and 3D Tori 1995 9 IPPS Gravenstreter & Methem & Chiarulli & Levitan & Teza, The Partitioned Optical Passive Stars (POPS) Topology 1995 9 IPPS Singhvi & Ghose, The Mcube: A Symmetrical Cube Based Network with Twisted Links 1995 9 IPPS Das & Sinha, Multi-Mesh--An Efficient Topology for Parallel Processing 1995 9 IPPS Burger & Wood, Accuracy vs. Performance in Parallel Simulation of Interconnection Networks 1995 9 IPPS Li & Gustavson, Fat-tree for Local Area Multiprocessors 1995 9 IPPS Ohring & Ibel & Das & Kumar, On Generalized Fat Trees 1995 9 IPPS Andrews & Atallah & Chen & Lee, Parallel Algorithms for Maximum Matching in Interval Graphs 1995 9 IPPS Ferragina, An EREW PRAM Fully-Dynamic Algorithm for MST 1995 9 IPPS Peng & Wang & Wang, Recognizing Depth-First-Search Trees in Parallel 1995 9 IPPS Hsu & Ramachandran & Dean, Implementation of Parallel Graph Algorithms on a Massively Parallel SIMD Computer with Virtual Processing 1995 9 IPPS Homer & Peinado, A Highly Parallel Algorithm to Approximate MaxCut on Distributed Memory Architectures 1995 9 IPPS Boukerche & Tropper, A Distributed Algorithm for the Detection of Local Cycles and Knots 1995 9 IPPS Bruck & Dolev & Ho & Orni & Strong, PCODE: An Efficient and Reliable Collective Communication Protocol for Unreliable Broadcast Domains 1995 9 IPPS Vishkin & Raman, Parallel Algorithms for Database Operations and a Database Operation for Parallel Algorithms 1995 9 IPPS Tschoke & Luling & Monien, Solving the Traveling Salesman Problem with a Distributed Branch-and-Bound Algorithm on a 1024 Processor Network 1995 9 IPPS Guan & Mural & Uberbacher, Sequence Comparison on a Cluster of Workstations Using the PVM System 1995 9 IPPS Larsen & Fagerberg, B-Trees with Relaxed Balance 1995 9 IPPS Berkman & Matias, Fast Parallel Algorithms for Minimum and Related Problems with Small Integer Inputs 1995 9 IPPS Matias & Vishkin, A Note on Reducing Parallel Model Simulations to Integer Sorting 1995 9 IPPS Young & Swami, The Parameterized Round-Robin Partitioned Algorithm for Parallel External Sort 1995 9 IPPS Johnson, A Performance Comparison of Fast Distributed Mutual Exclusion Algorithms 1995 9 IPPS Tzeng & Fu, Efficient Implementation of Mutual Exclusion Locks in Large Multiprocessors 1995 9 IPPS Baruah & Gehrke & Plaxton, Fast Scheduling of Periodic Tasks on Multiple Resources 1995 9 IPPS ElGindy & Wetherall, A Simple Voronoi Diagram Algorithm for a Reconfigurable Mesh 1995 9 IPPS Parhami & Hung, Robust Shearsort on Incomplete Bypass Meshes 1995 9 IPPS Mishra & Chang & Bhuyan & Lombardi, Fault-Tolerant Sorting in SIMD Hypercubes 1995 9 IPPS Olariu & Schwing, A Faster Sorting Algorithm in the Broadcast Communication Model 1995 9 IPPS Fragopoulou & Akl, Efficient Algorithms for Global Data Communication on the Multidimensional Torus Network 1995 9 IPPS Jagota, A Near-Optimal Algorithm for Gossiping in a d-Dimensional Mesh Bus Interconnection Network 1995 9 IPPS Bellaachia & Youssef, A Unified Theory for a Traffic Analysis in Product Networks 1995 9 IPPS Gilbert & Miller & Teng, Geometric Mesh Partitioning: Implementation and Experiments 1995 9 IPPS Lee & Fortes, Toward Data Distribution Independent Parallel Matrix Multiplication 1995 9 IPPS Wang & Roychowdhury, Minimizing Communication Overhead for Matrix Inversion Algorithms on Hypercubes 1995 9 IPPS Park & Agrawal, A Novel Deadlock-Free Routing Technique for a Class of de Bruijn Graph Based Networks 1995 9 IPPS Tseng & Gupta & Panda, An Efficient Scheme for Complete Exchange in 2D Tori 1995 9 IPPS Anjan & Pinkston, DISHA: A Deadlock Recovery Scheme for Fully Adaptive Routing 1995 9 IPPS Rao & Suel & Tsantilas & Goudreau, Efficient Communication Using Total-Exchange 1995 9 IPPS Huang & Zhu, A Fast Distributed Optimal Routing Algorithm for Multicommodity Large Data Networks 1995 9 IPPS Deng & Dymond, Efficient Routing and Message Bounds for Optimal Parallel Algorithms 1995 9 IPPS Lin & Tzeng, Reconfiguration and Experiments on a Faulty Hypercube 1995 9 IPPS Panda, Global Reduction in Wormhole k-ary n-cube Networks with Multidestination Exchange Worms 1995 9 IPPS Kumaran & Quinn, Divide-and-Conquer Programming on MIMD Computers 1995 9 IPPS Andre & Le Fur & Maheo & Pazat, Parallelization of a Wave Propagation Application using a Data Parallel Compiler 1994 8 IPPS Dickey & Gottlieb & Liu, Interconnection Network Switch Architectures and Combining Strategies 1994 8 IPPS Choi & Chien, Integrating Networks and Memory Hierarchies in a Multicomputer Node Architecture 1994 8 IPPS Das & Mao, A Theoretical Network Model and the Hamming Cube Networks 1994 8 IPPS Al-Hajery & Batcher, Low Cost Complexity of a General Multicast Network 1994 8 IPPS Fernandes & Kanevsky, Generalized Ring Interconnection Networks 1994 8 IPPS Alnuweiri, Synchronous Bus Arbitration with Constant Logic Per Module 1994 8 IPPS Nigam & Sahni, Computational Geometry on a Reconfigurable Mesh 1994 8 IPPS Olariu & Stojmenovic, Time-Optimal Proximity Algorithms on Meshes with Multiple Broadcasting 1994 8 IPPS Guha, An Optimal Mesh Computer Algorithm for Constrained Delaunay Triangulation 1994 8 IPPS Bhagavathi & Bokka & Gurla & Olariu & Schwing & Stojmenovic & Zhang, Time-Optimal Visibility-Related Algorithms on Meshes with Multiple Broadcasting 1994 8 IPPS Karinthi & Srinivas & Almasi, A Parallel Algorithm for Computing Polygon Set Operations 1994 8 IPPS Kim & Ibarra, Transformations Between Boundary Codes, Run Length Codes, and Linear Quadtrees 1994 8 IPPS Fan & Gupta & Liu, Latin Cubes and Parallel Array Access 1994 8 IPPS Singh, A Framework for Programming Using Non-Atomic Variables 1994 8 IPPS Chen & Lee, Solving the All-Pair Shortest Path Problem on Interval and Circular-Arc Graphs 1994 8 IPPS Kim & Jeong & Kim, An Optimal Parallel Matching Algorithm for a Convex Bipartite Graph on a Mesh-Connected Computer 1994 8 IPPS Bradford & Rawlis & Shannon, Efficient Matrix Chain Ordering in Polylog Time 1994 8 IPPS Toptsis, Parallel Bidirectional Heuristic Search with Dynamic Process Re-Direction 1994 8 IPPS Li, Solving Static Optimal Matching Problems in Heterogeneous Processing with Generalized Stable Marriage Algorithms 1994 8 IPPS Lee & Hua & Lang, On Random Sampling for Parallel Simulated Annealing 1994 8 IPPS Stauffer & Hirschberg, PRAM Algorithms for Static Dictionary Compression 1994 8 IPPS Ja'Ja' & Ryu & Vishkin, Sorting Strings and Constructing Digital Search Trees in Parallel 1994 8 IPPS Wu & Chen, Parallel Extended GCD Algorithm 1994 8 IPPS Das & Min & Halverson, Efficient Parallel Algorithms for Tree-Related Problems Using the Parentheses Matching Strategy 1994 8 IPPS Gorlatch & Lengauer, Systematic Development of an SPMD Implementation Schema for Mutually Recursive Divide-and-Conquer Specifications 1994 8 IPPS Vishkin, Can Parallel Algorithms Enhance Serial Implementation? 1994 8 IPPS Reif, Models and Resource Metrics for Parallel and Distributed Computation 1994 8 IPPS Sibeyn, Deterministic Routing and Sorting on Rings 1994 8 IPPS Suel, Routing and Sorting on Meshes with Row and Column Buses 1994 8 IPPS Quammen & Wang, Bitonic Sorting on 2D-PEC: An Algorithmic Study on a Hierarchy of Meshes Network 1994 8 IPPS Nassimi & Perl & Becker, The Generalized Class of g-Chain Periodic Sorting Networks 1994 8 IPPS Li & Mutka, Priority Based Real-Time Communication for Large Scale Wormhole Networks 1994 8 IPPS Cheng & Hwang, Fuzzy Communication for Guided Loop Scheduling in Multicomputers 1994 8 IPPS Sanches & Song, SIMD Algorithms for Matrix Multiplication on the Hypercube 1994 8 IPPS Kapoor & Schroder & Beresford-Smith, Deterministic Permutation Routing on a Reconfigurable Mesh 1994 8 IPPS Summerville & Delgado-Frias & Vassiliadis, A High Performance Pattern Associative Oblivious Router for Tree Topologies 1994 8 IPPS Zerrouk & Blinn & Greiner, Encapsulating Networks and Routing 1994 8 IPPS Young & Park & Lee & Choi, Circuit-Switched Broadcasting in d-Dimensional Tori and Meshes 1994 8 IPPS Thakur & Choudhary, All-to-All Communication on Meshes with Wormhole Routing 1994 8 IPPS Alleyne & Scherson, On Evil Twin Networks and the Value of Limited Randomized Routing 1994 8 IPPS Wisniewski & Kontothanassis & Scott, Scalable Spin Locks for Multiprogrammed Systems 1994 8 IPPS Shen & Hu & Liang, Efficient Embedding K-ary Complete Trees into Hypercubes 1994 8 IPPS Huang & Liu & Verma, A New Combinatorial Approach to Optimal Embeddings of Rectangles 1994 8 IPPS Chen & Tzeng, Distributed Identification of All Maximal Incomplete Subcubes in a Faulty Hypercube 1994 8 IPPS Medidi & Deo, Parallel Dictionaries on AVL Trees 1994 8 IPPS Varshneya & Madan & Balakrishnan, Concurrent Search and Insertion in K-Dimensional Height Balanced Trees 1994 8 IPPS Larsen, AVL Trees with Relaxed Balance 1994 8 IPPS Miller & Schaller, The Right Stuff? Teaching Parallel Computing 1993 7 IPPS Valiant, Why BSP Computers? 1993 7 IPPS Sha & Steiglitz, Maintaining Bipartite Matchings in the Presence of Failures 1993 7 IPPS Lingas & Maheshwari & Sack, Parallel Algorithms for Rectilinear Link Distance Problems 1993 7 IPPS Nigam & Sahni, Sorting n^2 Numbers on n x n Meshes 1993 7 IPPS Thiruchelvan & Trahan & Vaidyanathan, On the Power of Segmenting and Fusing Buses 1993 7 IPPS MacKenzie, A Separation Between Reconfigurable Mesh Models 1993 7 IPPS Berthome & Ferreira & Maggs & Perennes & Plaxton, Sorting-Based Selection Algorithms for Hypercube Networks 1993 7 IPPS Chang & Bhuyan, Parallel Algorithms for Hypercube Allocation 1993 7 IPPS Barnett & Littlefield & Payne & van de Geijn, Global Combine on Mesh Architectures with Wormhole Routing 1993 7 IPPS Balakrishnan & Panda, Impact of Multiple Consumption Channels on Wormhole Routed k-ary n-cube Networks 1993 7 IPPS Gessesse & Chalasani, New Degree Four Networks: Properties and Performance 1993 7 IPPS Nigam & Sahni, Sorting n Numbers on n x n Reconfigurable Meshes with Buses 1993 7 IPPS Guha, Optimal Mesh Computer Algorithms for Simple Polygons 1993 7 IPPS Jain & Chandrasekharan, An Efficient Parallel Algorithm for Min-Cost Flow on Directed Series-Parallel Networks 1993 7 IPPS Vaidyanathan & Hartmann & Varshney, Towards Optimal Parallel Radix Sorting 1993 7 IPPS Ibarra & Zheng, On the Shortest Path Problems for Permutation Graphs 1993 7 IPPS Nassimi, A Parallel MSF Algorithm for Planar Graphs on a Mesh and Applications to Image Processing 1993 7 IPPS Singhvi, The Connection Cubes: Symmetric, Low Diameter Interconnection Networks with Low Node Degree 1993 7 IPPS Ligon & Ramachandran, Simulating Interconnection Networks in RAW 1993 7 IPPS Tseng & Panda, A Trip-Based Multicasting Model for Wormhole-Routed Networks with Virtual Channels 1993 7 IPPS Scherson & Subramanian, Efficient Off-Line Routing of Permutations on Restricted Access Expanded Delta Networks 1993 7 IPPS Gupta & Schenfeld, A Heuristic Approach for Embedding Communication Patterns in an Interconnection Cached Parallel Processing Network 1993 7 IPPS Lu & Burr & Peterson, Permutation on the Mesh with Reconfigurable Bus: Algorithms and Practical Considerations 1993 7 IPPS Shen & Liang, A Parallel Algorithm for Multiple Edge Updates of Minimum Spanning Trees 1993 7 IPPS Goodrich & Matias & Vishkin, Approximate Parallel Prefix Computation and its Applications 1993 7 IPPS Chen & Guha, Testing a Simple Polygon for Monotonicity Optimally in Parallel 1993 7 IPPS Wittenbrink & Somani, 2D and 3D Optimal Parallel Image Warping 1993 7 IPPS Singh & Sridhar, Gossiping on Interval Graphs 1993 7 IPPS Venkatraman & Kime & Srinivas, Parallel Algorithms for Height Balancing Binary Trees 1993 7 IPPS Mehrotra & Ranka & Wang, A Probabilistic Analysis of a Locality Maintaining Load Balancing Algorithm 1993 7 IPPS Ja'Ja', Designing Efficient Parallel Algorithms: Models and Paradigms with Applications to Image Processing 1993 7 IPPS Antonio & Lin & Metzger, Complexity of Intensive Communications in Balanced Generalized Hypercubes 1993 7 IPPS Gaughan & Yalamanchili, Analytical Models of Bandwidth Allocation in Pipelined k-ary n-cubes 1993 7 IPPS Yang & Raghavendra, Reconfiguration of Binary Trees in Faulty Hypercubes 1993 7 IPPS Dai, On Synchronous Strictly Non-Blocking Concentrators and Generalized-Concentrators 1993 7 IPPS Somani, Design of Efficient Reconfigurable Networks 1993 7 IPPS Boppana & Chalasani, New Wormhole Routing Algorithms for Multicomputers 1993 7 IPPS Johnson, Supporting Insertions and Deletions in Striped Parallel Filesystems 1993 7 IPPS Khokhar & Lin, Stereo and Image Matching on Fixed Size Linear Arrays 1993 7 IPPS Scherson & Chien, Least Common Ancestor Networks 1993 7 IPPS Latifi & Bagherzadeh, The Clustered-Star Graph: A New Topology for Large Interconnection Networks 1993 7 IPPS Ohring & Das, Dynamic Embeddings of Trees and Quasi-Grids into Hyper-de Bruijn Networks 1993 7 IPPS Malluhi & Bayoumi & Rao, On the Hierarchical Hypercube Interconnection Network 1993 7 IPPS Chaudhary & Sabata & Aggarwal, Mapping Interconnection Networks into VEDIC Networks 1993 7 IPPS Antonio & Metzger, Hypersphere Mapper: A Nonlinear Programming Approach to the Hypercube Embedding Problem 1993 7 IPPS Ghouse & Goodrich, Experimental Evidence for the Power of Random Samplings in Practical Parallel Algorithms 1993 7 IPPS Karypis & Kumar, Efficient Parallel Mappings of a Dynamic Programming Algorithm: A Summary of Results 1993 7 IPPS Dekel & Hu, Parallel Dynamic st-numbering and Applications 1993 7 IPPS Kumar & Huang & Johnson & Sadayappan, A Tensor Product Formulation of Strassen's Matrix Multiplication Algorithm with Memory Reduction 1993 7 IPPS Chandy, Writing Correct Parallel Programs 1993 7 IPPS Sen & Sengupta & Bandyopadhyay, On Some Topological Properties of Hypercube, Incomplete Hypercube and Supercube 1993 7 IPPS Guan & Tsai & Blough, An Analytical Model for Wormhole Routing in Multicomputer Interconnection Networks 1993 7 IPPS Ganesan & Pradhan, Optimal Broadcasting in Binary de Bruijn Networks and Hyper-deBruijn Networks 1993 7 IPPS Rajasekaran & Wei, Selection, Routing, and Sorting on the Star Graph 1993 7 IPPS Shonkwiler & Ghannadian & Alford, Parallel Simulated Annealing for the n-Queen Problem 1993 7 IPPS Schwarzkopf, Computing Convolutions on Mesh-Like Structures 1993 7 IPPS Raghavendra & Sridhar, Global Semigroup Operations in Faulty SIMD Hypercubes 1993 7 IPPS Marinescu & Rice, Speedup, Communication Complexity, and Blocking -- A La Recherche du Temps Perdu 1993 7 IPPS Cong & Zheng & Sharma, On Simulations of Linear Arrays, Rings, and 2-D Meshes on Fibonacci Cube Networks 1993 7 IPPS Huang & Zhu & Hsieh, Parallel Implementation Issues of the TExtured Algorithm for Optimal Routing in Data Networks 1993 7 IPPS ElGindy, A New Horizon for Sorting on Mesh Architectures 1992 6 IPPS Yang & Raghavendra, Embedding and Reconfiguration of Binary Trees in Faulty Hypercubes 1992 6 IPPS Kwan & Bic, A Structuring Technique for Compute-Aggregate-Broadcast Algorithms on Distributed Memory Computers 1992 6 IPPS Aggarwal & Ma & Sandri & Sarkar, Adaptive Graph Computations with a Connection Machine 1992 6 IPPS Ibarra & Kim, Quadtree Building Algorithms on an SIMD Hypercube 1992 6 IPPS Mitra, Efficient Parallel Shortest Path Algorithms for k-Chordal Graphs 1992 6 IPPS Gupta & Wang, Generalized Compressed Tree Machines 1992 6 IPPS Zhong & Rajopadhye & Lo, Parallel Implementation of Divide-and-Conquer Algorithms on Binary de Bruijn Networks 1992 6 IPPS Sarnath & He, Efficient Parallel Algorithms for Selection and Searching on Sorted Matrices 1992 6 IPPS Saoudi & Nivat & Rangan & Sundaram & Ramkumar, A Parallel Algorithm for Recognizing the Shuffle of Two Strings 1992 6 IPPS Alnuweiri, Routing BPS Permutations in VLSI 1992 6 IPPS Nassimi, Nearly Logarithmic Time Parallel Algorithms for the Class of +/- 2^b ASCEND Computations on a SIMD Hypercube 1992 6 IPPS Jang & Prasanna, An Optimal Sorting Algorithm on Reconfigurable Mesh-Connected Computer 1992 6 IPPS Jeong & Choi, An Optimal Parallel Algorithm for Finding the Smallest Enclosing Rectangle on a Mesh-Connected Computer 1992 6 IPPS Reisis, An Efficient Convex Hull Computation on the Reconfigurable Mesh 1992 6 IPPS Ben-Asher & Schuster, The Bus-Usage Method for the Analysis of Reconfiguring Networks Algorithms 1992 6 IPPS Das & Chen, A New Parallel Algorithm for Breadth-First Search on Interval Graphs 1992 6 IPPS Flatebo & Datta, Two-State Self-Stabilizing Algorithms 1992 6 IPPS Yang & Choo, Formal Derivation of an Efficient Parallel 2-D Gauss-Seidel Method 1992 6 IPPS Shieh, Memory Requirements to Balance Thus Asymptotically Full-Speedup FFT Computation on Processor Arrays 1992 6 IPPS Deng & Iyengar, An Optimal Parallel Algorithm for Arithmetic Expresssion Parsing 1992 6 IPPS Bi & Giloi, Supporting Matrix Operations in Vector Architectures 1992 6 IPPS Mahanti & Daniels, IDPS: A Massively Parallel Heuristic Search Algorithm 1992 6 IPPS Meybodi, Banyan Heap Machine 1992 6 IPPS Hambrusch & Dehne, Determining Maximum k-Width Connectivity on Meshes 1992 6 IPPS Johnson & Metaxas, Optimal Algorithms for the Vertex Updating Problem of a Minimum Spanning Tree 1992 6 IPPS Zhang & Korf, Parallel Heap Operations on EREW PRAM: Summary of Results 1992 6 IPPS Johnson & Colbrook, A Distributed Data-Balanced Dictionary Based on the B-Link Tree 1992 6 IPPS Serrano & Parhami, Optimal Aspect Ratio and Number of Separable Row/Column Buses for Mesh-Connected Parallel Computers 1992 6 IPPS Fiduccia, Bussed Interconnection Networks from Trees 1992 6 IPPS Youssef, On-line Communication on Circuit-Switched Fixed Routing Meshes 1992 6 IPPS Blough & Najand, Fault-Tolerant Multiprocessor System Routing Using Incomplete Diagnostic Information 1992 6 IPPS Youssef & Alleyne & Scherson, Permutation Routing in Restricted Access Networks 1992 6 IPPS Draper & Ghosh, Multipath E-Cube Algorithms (MECA) for Adaptive Wormhole Routing and Broadcasting in k-ary n-Cubes 1992 6 IPPS Varma & Chalasani, Asymmetrical Multiconnection Three-Stage Clos Networks 1992 6 IPPS Jeng & Sahni, Histogramming on a Reconfigurable Mesh Computer 1992 6 IPPS Bagherzadeh & Hawk, Parallel Implementation of the Auction Algorithm on the Intel Hypercube 1992 6 IPPS Prasad & Deo, Parallel Heap: Improved and Simplified 1992 6 IPPS Gravana & Pifarre & Denicolay & Sanz, Adaptive Deadlock-Free Wormhole Routing in Hypercubes 1992 6 IPPS Luling & Monien, Load Balancing for Distributed Branch and Bound Algorithms 1992 6 IPPS Hsu & Yew, The Impact of Wiring Constraints on Hierarchical Network Performance 1992 6 IPPS Liu & Hsu, Distributed Algorithms for Shortest-Path Deadlock-Free Routing and Broadcasting in a Class of Interconnection Topologies 1992 6 IPPS Li, An Improved Multiple-Path Deadlock-Free Routing Algorithm in Binary Hypercubes 1992 6 IPPS Krizanc & Narayanan, Multipacket Selection on a Mesh-Connected Processor Arrays 1992 6 IPPS Ge & Antonio & Vitalpur, Visualization of a Simple Routing Scheme for Meshes 1992 6 IPPS Cull & Larson, The ``Mobius Cubes'': Improved Cubelike Networks for Parallel Computation 1992 6 IPPS Notomi & Murata, Hierarchically Organized Petri Net State Space for Reachability and Deadlock Analysis 1992 6 IPPS Lin & Antonio, Modeling and Control of Distributed Asynchronous Computations 1992 6 IPPS Berman & Bharali, Distributed Consensus in Semi-Synchronous Systems 1992 6 IPPS Samantarai, A Paradigm for Distributed Deadlock Avoidance in Multicomputer Networks 1992 6 IPPS Rokusawa & Ichiyoshi, A Scheme for State Change in a Distributed Environment Using Weighted Throw Counting 1992 6 IPPS Lai & Tseng & Dong, A More Efficient Message-Optimal Algorithm for Distributed Termination Detection 1991 5 IPPS Holey & Ibarra, Triangulation in a Plane and 3-D Convex Hull on Mesh-Connected Arrays and Hypercubes 1991 5 IPPS Reisis, Improved Graph Computations on the Reconfigurable Mesh 1991 5 IPPS Yen & Bastani & Leiss, An Inherently Fault Tolerant Sorting Algorithm 1991 5 IPPS Sridhar & Goyal, Routing Algorithms in Interval and Circular-Arc Networks 1991 5 IPPS Becker & Martel & Park, General Asynchrony Is Not Expensive for PRAMs 1991 5 IPPS Ibarra & Kim, Fast Parallel Algorithms for Solving Triangular Systems of Linear Equations on the Hypercube 1991 5 IPPS Gazit, Optimal EREW Parallel Algorithms for Connectivity, Ear Decomposition and st-Numbering of Planar Graphs 1991 5 IPPS Singh & Kumar & Agha & Tomlinson, Scalability of Parallel Sorting on Mesh Multicomputers 1991 5 IPPS Smit & Havinga & Jansen, An Algorithm for Generating Node Disjoint Routes in Kautz Digraphs 1991 5 IPPS Wen, Parallel Multiple Search 1991 5 IPPS Zheng, SIMD Data Communication Algorithms for Multiply Twisted Hypercubes 1991 5 IPPS Prasas & Deo, Two EREW Algorithms for Parentheses Matching 1991 5 IPPS Chen & Das, A Cost-Optimal Parallel Algorithm for the Parentheses Matching Problem on EREW PRAM 1991 5 IPPS Berkey & Wang, A Parallel Approximation Algorithm for Solving One-Dimensional Bin Packing Problems 1991 5 IPPS Prabhala & Sherwani, Fully Normal Algorithms for Incomplete Hypercubes 1991 5 IPPS Varadarajan & Ravichandran, Refining Algorithm Mappings for Linear Systolic Arrays 1991 5 IPPS Jang & Przytula, Trade-Offs in Mapping FFT Computations onto Fixed Size Mesh Processor Array 1991 5 IPPS Kistler & Webb, Connected Components with Split and Merge 1991 5 IPPS Megson, Systolic Rank Updating and the Solution of Non-Linear Equations 1991 5 IPPS Esonu & Al-Khalili & Hariri, On the Design of Optimal Fault-Tolerant Systolic Array Architectures 1991 5 IPPS Scherson, Multidimensional Access Shared Memory Parallel Processing Systems 1991 5 IPPS Kim & Raghavendra, A Simple Algorithm to Route Arbitrary Permutations on 8-Input 5-Stage Shuffle/Exchange Network 1991 5 IPPS Jwo & Lakshmivarahan & Dhall, Characterization of Node Disjoint (Parallel) Path in Star Graphs 1991 5 IPPS Youssef, Efficient Randomized Routing on Clos Networks 1991 5 IPPS Gupta & Boals & Sherwani, On Optimal Embeddings into Incomplete Hypercubes 1991 5 IPPS Park & Tsai, Distributed Hierarchical Optimal Routing Using Aggregation/Disaggregation and Decomposition/Composition Techniques 1991 5 IPPS Madabhushi & Lakshmivarahan & Dhall, A Note on Orthogonal Graphs 1991 5 IPPS Giloi & Montenegro, Choosing the Interconnect of Distributed Memory Systems by Cost and Blocking Behavior 1991 5 IPPS Dingle & Barada, Optimum Embeddings of End-Around Meshes into Pyramid Networks 1991 5 IPPS Mittal & Jain & Patney, Link Augmented Binary (LAB) - Tree: Its Structure, Routing and Fault Tolerance Properties 1991 5 IPPS Efe & Ramaiyer, Congestion and Fault Tolerance of Binary Tree Embeddings on Hypercube 1991 5 IPPS Kirkman & Quammen, Packed Exponential Connections--A Hierarchy of 2-D Meshes 1991 5 IPPS Haq, Cross-Cube: A New Fault Tolerant Hypercube-Based Network 1991 5 IPPS Aboelaze, Multi-level Hypercube Network 1991 5 IPPS Yuan, A Resilient Decentralized Commit Protocol 1991 5 IPPS Bellaachia & Youssef, Greedy Partitioning Strategy for Banyan-Hypercube Networks 1991 5 IPPS Parhami, High-Performance Parallel Pipelined Voting Networks 1991 5 IPPS Matsunaga & Oyaizu & Uozumi & Hoshiko & Kimura, Modeling and Performance Analysis for Processor-to-Processor Communications Unit Using a 100 Mb/s Optical Token Ring 1991 5 IPPS Li & Jamieson, A System for Algorithm-Architecture Mapping Based on Dependence Graph Matching and Hypergraphs 1991 5 IPPS Woo & Sahni, Load Balancing on a Hypercube 1991 5 IPPS Raghavendra & Chalasani & Boppana, Improved Algorithms for Load Balancing in Circuit-Switched Hypercubes 1991 5 IPPS Avritzer & Gerla & Carlyle, A Load Sharing Interconnection Network for Hard Real-Time Systems 1995 IPPSW Feitelson & Rudolph, Parallel Job Scheduling: Issues and Approaches 1993 IRFORUM Salton & Allan & Buckley, Approaches to Passage Retrieval in Full Text Information Systems 1993 IRFORUM Bookstein & Klein & Raita, Is Huffman Coding Dead? 1993 IRFORUM Linoff & Stanfill, Compression of Indexes with Full Positional Information in Very Large Text Databases 1993 IRFORUM Aktug & Can, Analysis of Multiterm Queries in a Dynamic Signature 1992 IRFORUM Fox & Chen & Heath, A Faster Algorithm for Constructing Minimal Perfect Hash Functions 1989 23 IRFORUM Aoe, Storing a Tree Structure by Using Decimal Notation 1989 23 IRFORUM Aoe, An Efficient Implementation of String Pattern Matching Machines for a Finite Number of Keywords 1989 23 IRFORUM Baeza-Yates, Algorithms for String Searching: A Survey 1989 23 IRFORUM Collin & Levinson, Partial Order Maintenance 1989 23 IRFORUM Kuo & Cross, An Improved Algorithm to Find the Length of the Longest Common Subsequence of Two Strings 1996 3 IRREGULAR Hagerup, Allocating Independent Tasks to Parallel Processors: An Experimental Study 1996 3 IRREGULAR Dorward & Matheson & Tarjan, Towards Efficient Unstructured Multigrid Preprocessing 1996 3 IRREGULAR Yu & Ibarra & Yang, Parallel Progressive Radiosity with Adaptive Meshing 1996 3 IRREGULAR Traff & Zaroliagis, A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs 1996 3 IRREGULAR de Dinechin & Wilde & Rajopadhye & Andonov, A Regular VLSI Array for an Irregular Algorithm 1996 3 IRREGULAR Gonzalez, Multi-Message Multicasting 1996 3 IRREGULAR Diderich & Gengler, Synchronization as a Strategy for Designing Efficient Parallel Algorithms 1996 3 IRREGULAR Heun & Mayr, Efficient Dynamic Embedding of Arbitrary Binary Trees into Hypercubes 1996 3 IRREGULAR Grigni & Manne, On the Complexity of the Generalized Block Distribution 1996 3 IRREGULAR Greenlaw & Machta, The Parallel Complexity of Randomized Fractals 1995 6 ISAAC Shimozono, An Approximation Algorithm for Alphabet Indexing Problem 1995 6 ISAAC Katajainen & Moffat & Turpin, A Fast and Space-Economical Algorithm for Length-Limited Coding 1995 6 ISAAC Bhattacharya & Mukhopadhyay, Computing in Linear Time a Chord from which a Simple Polygon is Weakly Internally Visible 1995 6 ISAAC Datta & Hipke & Schuierer, Competitive Searching in Polygons--Beyond Generalised Streets 1995 6 ISAAC Kusakari & Suzuki & Nishizeki, Finding a Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas 1995 6 ISAAC Lokam & Mahajan & Vinay, Logspace Verifiers, NC, and NP 1995 6 ISAAC Karg & Schuler, Structure in Average Case Complexity 1995 6 ISAAC Chien & Steiger, Some Geometric Lower Bounds 1995 6 ISAAC Arge, The I/O-Complexity of Ordered Binary-Decision Diagram Manipulation 1995 6 ISAAC Frank & Ibaraki & Nagamochi, Two Arc Disjoint Paths in Eulerian Digraphs 1995 6 ISAAC Asahiro & Iwama, Finding Dense Subgraphs 1995 6 ISAAC Gupta & Nishimura, Finding Smallest Supertrees 1995 6 ISAAC Chang, Weighted Domination of Cocomparability Graphs 1995 6 ISAAC Andreev & Clementi & Crescenzi & Dahlhaus & de Agostino & Rolim, The Parallel Complexity of Approximating the High Degree Subgraph Problem 1995 6 ISAAC Bafna & Berman & Fujito, Constant Ratio Approximations fo the Weighted Feedback Vertex Set Problem for Undirected Graphs 1995 6 ISAAC Halldorsson & Yoshihara, Greedy Approximations of Independent Sets in Low Degree Graphs 1995 6 ISAAC Ono & Hirata & Asano, An Approximation Algorithm for MAX 3-SAT 1995 6 ISAAC Tani & Yamazaki, Learning of Restricted RNLC Graph Languages 1995 6 ISAAC Papadimitriou & Ramanathan & Rangan, Optimal Information Delivery 1995 6 ISAAC Santoro & Ren & Nayak, On the Complexity of Testing for Catastrophic Faults 1995 6 ISAAC Kwon & Chwa, Scheduling Parallel Tasks with Individual Deadlines 1995 6 ISAAC von zur Gathen & Shparlinski, Orders of Gauss Periods in Finite Fields 1995 6 ISAAC Havas & Majewski, A Hard Problem that is Almost Always Easy 1995 6 ISAAC Sekine & Imai & Tani, Computing the Tutte Polynomial of a Graph of Moderate Size 1995 6 ISAAC Dedorath & Gergov & Hagerup, More Efficient Parallel Flow Algorithms 1995 6 ISAAC Carlsson & Sundstrom, Linear-time In-Place Selection in Less than 3n Comparisons 1995 6 ISAAC Carlsson & Chen, Heap Construction: Optimal in Both Worst and Average Cases? 1995 6 ISAAC Shi, Fast Approximate Dicitionary Matching 1995 6 ISAAC Hsu, Undirected Vertex-Connectivity Structure and Smallest Four-Vertex-Connectivity Augmentation 1995 6 ISAAC Damaschke, Searching for a Monotone Function by Independent Threshold Queries 1995 6 ISAAC Makino & Ibaraki, A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions 1995 6 ISAAC Yen & Jian & Lao, Deciding Bisimulation and Trace Equivalences for Systems with Many Identical Processes 1995 6 ISAAC Hamada & Mei & Nishitani & Igarashi, Embeddings of Hyper-Rings in Hypercubes 1995 6 ISAAC Cheng & Tang, A Fast Algorithm for Computing Optimal Rectilinear Steiner Trees for Extremal Point Sets 1995 6 ISAAC Zhou & Nishizeki, Algorithms for Finding f-Colorings of Partial k-Trees 1995 6 ISAAC Hwan-Gue & Zelikovsky, Spanning Closed Trail and Hamiltonian Cycle in Grid Graphs 1995 6 ISAAC Hsu, A Linear Time Algorithm for Finding Maximal Planar Subgraphs 1995 6 ISAAC Abello & Estivill-Castro & Shermer & Urrutia, Illumination with Orthogonal Floodlights 1995 6 ISAAC Bose & Toussaint, No Quadrangulation is Extremely Odd 1995 6 ISAAC Chin & Snoeyink & Wang, Finding the Medial Axis of a Simple Polygon in Linear Time 1995 6 ISAAC Krznaric & Levcopoulos, The First Subquadratic Algorithm for Complete Linkage Clustering 1995 6 ISAAC Bradford & Fleischer, Matching Nuts and Bolts Faster 1995 6 ISAAC Fu, Linear Matching-Time Algorithm for the Directed Graph Isomorphism Problem 1995 6 ISAAC Fujita & Kameda & Yamashita, A Resource Assignment Problem on Graphs 1995 6 ISAAC Chen, NC Algorithms for Partitioning Sparse Graphs into Induced Forests with an Application 1994 5 ISAAC Wu, Polynomial Equations-Solving and its Applications 1994 5 ISAAC Klein & Lingas, Hamiltonian Abstract Voronoi Diagrams in Linear Time 1994 5 ISAAC Bose & Houle & Toussaint, Every Set of Disjoint Line Segments Admits a Binary Tree 1994 5 ISAAC Iwano & Raghavan & Tamaki, The Traveling Cameraman Problem, with Applications to Automatic Optical Inspection 1994 5 ISAAC Akutsu, On Determining the Congruity of Point Sets in Higher Dimensions 1994 5 ISAAC Book & Watanabe, On Random Hard Sets for NP 1994 5 ISAAC Hemaspaandra & Naik & Ogihara & Selman, Computing Solutions Uniquely Collapses the Polynomial Hierarchy 1994 5 ISAAC Santha & Tan, Verifying the Determinant in Parallel 1994 5 ISAAC Lin, Hardness of Approximating Graph Transformation Problem 1994 5 ISAAC Panconesi & Papatriantafilou & Tsigas & Vitanyi, Randomized Wait-Free Naming 1994 5 ISAAC Rajasekaran & Chen & Yooseph, Unifying Themes for Network Selection 1994 5 ISAAC Molcho & Zaks, Robust Asynchronous Algorithms in Networks with a Fault Detection Ring 1994 5 ISAAC Jennings & Motyckova, Distributed Algorithms for Finding Small Cycle Covers in Arbitrary Networks 1994 5 ISAAC Zhang & Zhu, A Neural Network Model for Quadratic Programming with Simple Upper and Lower Bounds and its Application to Linear Programming 1994 5 ISAAC Zhu & Ma & Qiu, Analysis of the Convergency of Topology Preserving Neural Networks 1994 5 ISAAC Arvind & Kobler & Schuler, On Helping and Interactive Proof Systems 1994 5 ISAAC Gu & Gu, Average Time Complexity of the SAT 1.2 Algorithm 1994 5 ISAAC Chen, Average Cost to Produce Partial Orders 1994 5 ISAAC Li & Ma, Two Notes on Low-Density Subset Sum Algorithms 1994 5 ISAAC Cai & Hirsch, Rotation Distance, Triangulations of Planar Surfaces and Hyperbolic Geometry 1994 5 ISAAC Chen & Smith, Finitely Representable Spatial Objects and Efficient Computation 1994 5 ISAAC Nagamochi & Nichimura & Ibaraki, Computing All Small Cuts in Undirected Networks 1994 5 ISAAC Zhou & Nishizeki, Edge-Coloring and f-Coloring for Various Classes of Graphs 1994 5 ISAAC Gopalakrishnan & Rangan, Edge-Disjoint Paths in Permutation Graphs 1994 5 ISAAC Taoka & Watanabe, Minimum Augmentation to k-Edge-Connect Specified Vertices of a Graph 1994 5 ISAAC Srivastav & Stangier, Algorithmic Chernoff-Hoeffding Inequalities in Integer Programming 1994 5 ISAAC Takaoka, Approximate Pattern Matching with Samples 1994 5 ISAAC Lin & Orlowska, An Efficient Optimal Algorithm for Minimizing the Overall Communication Cost in Replicated Data Management 1994 5 ISAAC Gu, Multispace Search: A New Optimization Approach 1994 5 ISAAC Arikati & Maheshwari, Realizing Degree Sequences in Parallel 1994 5 ISAAC Kavvadias & Pantziou & Spirakis & Zaroliagis, Efficient Sequential and Parallel Algorithms for the Negative Cycle Problem 1994 5 ISAAC Chen & Hu, Fast and Efficient Operations on Parallel Priority Queues 1994 5 ISAAC Carlsson & Chen & Matisson, Heaps with Bits 1994 5 ISAAC von zur Gathen & Shparlinski, Components and Projections of Curves over Finite Fields 1994 5 ISAAC Middendorf, On the Approximation of Finding Various Minimal, Maximal, and Consistent Sequences 1994 5 ISAAC Nakanishi & Hasidume & Ito & Hashimoto, A Linear-Time Algorithm for Computing Characteristic Strings 1994 5 ISAAC Makino & Ibaraki, The Maximum Latency and Identification of Positive Boolean Functions 1994 5 ISAAC Kaufmann & Lauer & Schroder, Fast Deterministic Hot-Potato Routing in Hypercubes 1994 5 ISAAC Kaufmann & Gao & Thulasiraman, On Steiner Minimal Trees in Grid Graphs and Its Application to VLSI Routing 1994 5 ISAAC Shen & Hu & Dai & Wang, Optimal Routing of Permutations on Rings 1994 5 ISAAC Ambos-Spies & Terwijn & Zheng, Resource Bounded Randomness and Weakly Complete Problems 1994 5 ISAAC Krishnan & Puri & Brayton, Deterministic omega Automata vis-a-vis Deterministic Buchi Automata 1994 5 ISAAC Mihara & Nishino, Quantum Computation and NP-Complete Problems 1994 5 ISAAC Fortnow & Rogers, Separability and One-Way Functions 1994 5 ISAAC Akutsu & Halldorsson, On the Approximation of Largest Common Subtrees and Largest Common Point Sets 1994 5 ISAAC Jiang & Wang, An Approximation Scheme for Some Steiner Tree Problems in the Plane 1994 5 ISAAC Yang & Xu & You, A chain Decomposition Algorithm for the Proof of a Property on Minimum Weight Triangulations 1994 5 ISAAC Ding, The Generating Algorithm for Quasi-Full Steiner Trees 1994 5 ISAAC Hui & Martel, Analysing Deletions in Competitive Self-Adjusting Linear List Algorithms 1994 5 ISAAC Abuaiadh & Kingston, Are Fibonacci Heaps Optimal? 1994 5 ISAAC Kao & Teng, Simple and Efficient Graph Compression Schemes for Dense and Complement Graphs 1994 5 ISAAC Subramanian, Improved Algorithms for Coloring Random Graphs 1994 5 ISAAC Ibarra & Tran, On the Parallel Complexity of Solving Recurrence Equations 1994 5 ISAAC Iwamoto & Iwama, Extended Graph Connectivity and Its Gradually Increasing Parallel Complexity 1994 5 ISAAC Metaxas & Pantziou & Symvonis, Parallel h-v Drawings of Binary Trees 1994 5 ISAAC Hsieh & Ho, An Efficient Parallel Strategy for Recognizing Series-Parallel Graphs 1994 5 ISAAC Tokuyama, Orthogonal Queries in Segments and Triangles 1994 5 ISAAC Zhu, Further Computational Geometry in Secondary Memory 1994 5 ISAAC Tan & Hirata, Shortest Safari Routes in Simple Polygon 1994 5 ISAAC Chin & Wang, On Greedy Tetrhedralization of Points in 3D 1994 5 ISAAC Fujiyoshi & Kajitani & Niitsu, The Totally-Perfect Bipartite Graph and Its Construction 1994 5 ISAAC Tsai & Lee, k-Best Cuts for Circular-Arc Graphs 1994 5 ISAAC Chen, Revisiting Circular Arc Graphs 1994 5 ISAAC Rangan & Chang, Weighted Irredundance of Interval Graphs 1994 5 ISAAC Tani & Imai, A Reordering Operation for an Ordered Binary Decision Diagram and an Extended Framework for Combinatorics of Graphs 1994 5 ISAAC Hosaka & Takenaga & Yajima, On the Size of Ordered Binary Decision Diagrams Representing Threshold Functions 1994 5 ISAAC Li & Li, Nonuniform Lowness and Strong Nonuniform Lowness 1994 5 ISAAC Biehl, Definition and Existence of Super Complexity Cores 1994 5 ISAAC Young & Chan, Efficient Algorithms for Assigning Chain-Like Tasks on a Chain-Like Network Computer 1994 5 ISAAC Lau, Manpower Scheduling with Shift Change Constraints 1994 5 ISAAC Xu & Gabow, Fast Algorithms for Transversal Matroid Intersection Problems 1994 5 ISAAC Deng, A Convex Hull Algorithm on Coarse-Grained Multiprocessors 1994 5 ISAAC Lee & Batcher, A Multiway Merging Network 1994 5 ISAAC Asano, Reporting and Counting Intersections of Lines within a Polygon 1994 5 ISAAC Havas & Lian, A New Problem in String Searching 1994 5 ISAAC Sun & Du & Xue, Achieving the Shortest Clock Period by Inserting the Minimum Amount of Delay 1994 5 ISAAC Bao & Igarashi, A Randomized Algorithm to Finite Automata Public Key Cryptosystem 1993 4 ISAAC de Berg & Guibas & Halperin & Overmars & Schwarzkopf & Sharir & Teillaud, Reaching a Goal with Directional Uncertainty 1993 4 ISAAC Das & Heffernan, Constructing Degree-3 Spanners with Other Sparseness Properties 1993 4 ISAAC Dobrindt & Yvinec, Remembering Conflicts in History Yields Dynamic Algorithms 1993 4 ISAAC Furer & Subramanian & Madhavan, Coloring Random Graphs in Polynomial Expected Time 1993 4 ISAAC Asano, Graphical Degree Sequence Problems with Connectivity Requirements 1993 4 ISAAC Dai & Imai & Iwano & Katoh, How to Treat Delete Requests in Semi-Online Problems 1993 4 ISAAC Carlsson & Jonsson & Nilsson, Finding the Shortest Watchman Routes by Divide-and-Conquer 1993 4 ISAAC Hoffmann & Kriegel, A Graph Coloring Result and Its Consequences for Some Guarding Problems 1993 4 ISAAC Dessmark & Jansen & Lingas, The Maximum k-Dependent and f-Dependent Set Problem 1993 4 ISAAC Takahashi & Suzuki & Nishizeki, Finding Shortest Non-Crossing Rectilinear Paths in Plane Regions 1993 4 ISAAC Kloks, Treewidth of Circle Graphs 1993 4 ISAAC Chen, A Framework for Constructing Heap-like Structures In-Place 1993 4 ISAAC Khoong & Leong, Double-Ended Binomial Queues 1993 4 ISAAC Fleischer, A Simple Balanced Search Tree with O(1) Worst-Case Update Time 1993 4 ISAAC Ohring & Das, Mapping Dynamic Data and Algorithm Structures into Product Networks 1993 4 ISAAC Cogolludo & Rajasekaran, Permutation Routing on Reconfigurable Meshes 1993 4 ISAAC Grammatikakis & Hsu & Hwang, Adaptive and Oblivious Algorithms for D-Cube Permutation Routing 1993 4 ISAAC Srivastav & Stangier, On Quadratic Lattice Approximations 1993 4 ISAAC Fujito, A 2/3-Approximation of the Matroid Matching Problem 1993 4 ISAAC Dube, Using Fractal Geometry for Solving Divide-and-Conquer Recurrences 1993 4 ISAAC Ruskey, Simple Combinatorial Gray Codes Constructed by Reversing Sublists 1993 4 ISAAC Borodin, Time-Space Tradeoffs 1993 4 ISAAC Leung, Separating Exponentially Ambiguous NFA from Polynomially Ambiguous NFA 1993 4 ISAAC Han & Hemaspaandra & Thierauf, Threshold Computation and Cryptographic Security 1993 4 ISAAC Niedermeier & Rossmanith, On the Power of Reading and Writing Simultaneously in Parallel Computations 1993 4 ISAAC Book, Relativizing Complexity Classes with Random Oracles 1993 4 ISAAC Liestman & Richards, Perpetual Gossiping 1993 4 ISAAC Ikeda, A Probabilistic Selection Network with Butterfly Networks 1993 4 ISAAC Fujita & Yamashita & Ae, Optimal Group Gossiping in Hypercubes Under Wormhole Routing Model 1993 4 ISAAC Bitan & Zaks, Optimal Linear Broadcast Routing with Capacity Limitations 1993 4 ISAAC Awerbuch & Leighton, A Survey of Recent Advances in Multicommodity Flow: Algorithms and Applications 1993 4 ISAAC He & Kao, Parallel Construction of Canonical Ordering and Convex Drawing of Triconnected Planar Graphs 1993 4 ISAAC Asano & Katoh, Number Theory Helps Line Detection in Digital Images 1993 4 ISAAC Chen, Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon 1993 4 ISAAC Weihe, Multicommodity Flows in Even, Planar Networks 1993 4 ISAAC Ripphausen-Lipa & Wagner & Weihe, Linear Time Algorithms for Disjoint Two-Face Paths 1993 4 ISAAC Deng & Mirzaian, Robot Mapping: Foot-Prints vs. Tokens 1993 4 ISAAC Yannakakis, Recent Developments in the Approximability of Combinatorial Problems 1993 4 ISAAC Okamoto, On the Relationship among Cryptographic Physical Assumptions 1993 4 ISAAC Meinel & Waack, Separating Complexity Classes Related to Bounded Alternating w-Branching Programs 1993 4 ISAAC Tani & Hamaguchi & Yajima, The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams 1993 4 ISAAC Kavvadias & Papadimitriou & Sideri, On Horn Envelopes and Hypergraph Transversals 1993 4 ISAAC Chrobak & Larmore & Reingold & Westbrook, Page Migration Algorithms Using Work Functions 1993 4 ISAAC Feuerstein & Marchetti-Spaccamela, Memory Paging for Connectivity and Path Problems in Graphs 1993 4 ISAAC Hui & Martel, Randomized On-Line Algorithms for the Page Replication Problem 1993 4 ISAAC Hambrusch & Tu, New Algorithms for Minimizing the Longest Wire Length during Circuit Compaction 1993 4 ISAAC Greenberg & Hung & Shih, Parallel Algorithms for Single-Layer Channel Routing 1993 4 ISAAC Aggarwal & Tokuyama, Consecutive Interval Query and Dynamic Programming on Intervals 1993 4 ISAAC Aggarwal & Tokuyama, An Improved Algorithm for the Traveler's Problem 1993 4 ISAAC Karuno & Nagamochi & Ibaraki, Vehicle Scheduling on a Tree with Release and Handling Times 1993 4 ISAAC Lok & Young, Scheduling Algorithms for a Chain-like Task System 1993 4 ISAAC Chang & Rangan & Coorg, Weighted Independent Perfect Domination on Cocomparability Graphs 1993 4 ISAAC Wang & Huang & Chao & Lee, Plane Sweep Algorithms for the Polygonal Approximation Problems with Applications 1993 4 ISAAC Cheng & Lim & Wu, Optimal Rectilinear Steiner Tree for Extremal Point Sets 1993 4 ISAAC Fossmeier & Kaufmann & Zelikovsky, Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem 1992 3 ISAAC Vishkin, Methods in Parallel Algorithmics and Who May Need to Know Them? 1992 3 ISAAC Lee, Rectilinear Paths Among Rectilinear Obstacles 1992 3 ISAAC Chen & Lee, Linear Time Algorithms for k-Cutwidth Problem 1992 3 ISAAC Watanabe & Mashita & Taoka, The k-Edge-Connectivity Augmentation Problem of Weighted Graphs 1992 3 ISAAC Patkar & Narayanan, Principal Lattice of Partitions of Submodular Functions on Graphs: Fast Algorithms for Principal Partition and Generic Rigidity 1992 3 ISAAC Hwang & Lee, The Application of the Searching Over Separators Strategy to Solve Some NP-Complete Problems on Planar Graphs 1992 3 ISAAC Halldorsson, Parallel and On-Line Graph Coloring Algorithms 1992 3 ISAAC Matsumoto, Competitive Analysis of the Round Robin Algorithm 1992 3 ISAAC Chien & Chen & Yang, Competitive Analysis of the On-Line Algorithms for Multiple Stacks Systems 1992 3 ISAAC Lai, Self-Adjusting Augmented Search Trees 1992 3 ISAAC Gonzalez & Murayama, Algorithms for a Class of Min-Cut and Max-Cut Problems 1992 3 ISAAC Ho & Ko & Ma & Sung, Algorithms for Rectilinear Optimal Multicast Tree Problem 1992 3 ISAAC Kloks & Bodlaender, Approximating Treewidth and Pathwidth of Some Classes of Perfect Graphs 1992 3 ISAAC Ueno & Yamazaki & Kajitani, Graph Spanners and Connectivity 1992 3 ISAAC Berkman & Matias & Vishkin, Randomized Range-Maxima in Nearly-Constant Parallel Time 1992 3 ISAAC Han & Igarashi & Kanai & Miura, Fault-Tolerant Broadcasting in Binary Jumping Networks 1992 3 ISAAC Iwama & Miyano & Kambayashi, Routing Problems on the Mesh of Buses 1992 3 ISAAC Jimbo & Maruoka, Selection Networks with 8n log_2 n Size and O(log n) Depth 1992 3 ISAAC Book, Relativizations of the P =? NP and Other Problems: Some Developments in Structural Complexity Theory 1992 3 ISAAC Symvonis & Tragoudas, Searching a Solid Pseudo 3-Sided Orthoconvex Grid 1992 3 ISAAC Dendris & Kalafatis & Kirousis, An Efficient Parallel Algorithm for Geometrically Characterizing Drawings of a Class of 3-D Objects 1992 3 ISAAC Sugihara, Topologically Consistent Algorithms Related to Convex Polyhedra 1992 3 ISAAC Choi & Shin & Chwa, Characterizing and Recognizing Visibility Graphs of Funnel-Shaped Polygons 1992 3 ISAAC Itoh & Horikawa, On the Complexity of Composite Numbers 1992 3 ISAAC Kobayashi, On Malign Input Distributions for Algorithms 1992 3 ISAAC Arvind & Kobler & Mundhenk, Lowness and the Complexity of Sparse and Tally Descriptions 1992 3 ISAAC Wang & Belanger, Honest Iteration Schemes of Randomizing Algorithms 1992 3 ISAAC Lee & Chang, Approximating Vertices of a Convex Polygon with Grid Points in the Polygon 1992 3 ISAAC Akutsu, Algorithms for Determining the Geometrical Congruity in Two and Three Dimensions 1992 3 ISAAC Jennings & Lingas, On the Relationships Among Constrained Geometric Structures 1992 3 ISAAC Madlener & Otto & Sattler-Klein, Generating Small Convergent Systems Can Be Extremely Hard 1992 3 ISAAC Ogawa, Chew's Theorem Revisited -- Uniquely Normalizing Property of Nonlinear Term Rewriting Systems -- 1992 3 ISAAC Bolignano & Debabi, Higher Order Communicating Processes with Value-Passing, Assignment and Return of Results 1992 3 ISAAC Pijls & de Bruin, Searching Informed Game Trees 1992 3 ISAAC Iri, How to Generate Realistic Sample Problems for Network Optimization 1992 3 ISAAC Martello & Toth, Generalized Assignment Problems 1992 3 ISAAC Guevremont & Snoeyink, Recognizing an Envelope of Lines in Linear Time 1992 3 ISAAC Chan & Chin, Approximation of Polygonal Curves with Minimum Number of Line Segments 1992 3 ISAAC Sarrafzadeh & Wagner & Wagner & Weihe, Wiring Knock-Knee Layouts: A Global Approach 1992 3 ISAAC Takahashi & Suzuki & Nishizeki, Algorithms for Finding Non-Crossing Paths with Minimum Total Length in Planar Graphs 1992 3 ISAAC Longpre & Watanabe, On Symmetry of Information and Polynomial Time Invertibility 1992 3 ISAAC Beigel & Tarui & Toda, On Probabilistic ACC Circuits with an Exact-Threshold Output Gate 1992 3 ISAAC Kurosawa & Watanabe, Computational and Statistical Indistinguishabilities 1992 3 ISAAC Fu & Li, On Symmetric Differences of NP-Hard Sets with Weakly-P-Selective Sets 1992 3 ISAAC Sarrafzadeh & Lee, Restricted Track Assignment with Applications 1992 3 ISAAC Hsu, A Simple Test for the Consecutive Ones Property 1992 3 ISAAC Hakata & Imai, The Longest Common Subsequence Problem for Small Alphabet Size Between Many Strings 1992 3 ISAAC Lam & Lee, The Implicit Dictionary Problem Revisited 1992 3 ISAAC Reinhardt, Sorting In-Place with a Worst Case Complexity of n log n - 1.3n + O(log n) Comparisons and epsilon n log n + O(1) Transports 1992 3 ISAAC Moffat & Petersson & Wormald, Sorting and/by Merging Finger Trees 1991 2 ISAAC Papadimitriou, Decision-Making with Incomplete Information 1991 2 ISAAC Lee & Sarrafzadeh, Maximum Independent Set of a Permutation Graph in k Tracks 1991 2 ISAAC Lin & Skiena, Algorithms for Square Roots of Graphs 1991 2 ISAAC Fujita & Yamashita & Ae, Distributed k-Mutual Exclusion Problem and k-Coteries 1991 2 ISAAC Raghunathan & Saran, Is the Shuffle-Exchange Better Than the Butterfly? 1991 2 ISAAC Yao, Weighted Random Assignments with Application to Hashing 1991 2 ISAAC Nakano & Nishizeki, Scheduling File Transfers under Port and Channel Constraints 1991 2 ISAAC Hsu & Ma, Substitution Decomposition on Chordal Graphs and Applications 1991 2 ISAAC Takahashi & Ueno & Kajitani, Mixed-Searching and Proper-Path-Width 1991 2 ISAAC Wagner & Wolfers, Short Wire Routing in Convex Grids 1991 2 ISAAC Wagner, A New Approach to Knock-Knee Channel Routing 1991 2 ISAAC Asano & Tokuyama, Circuit Partitioning Algorithms: Graph Model versus Geometry Model 1991 2 ISAAC Boros & Hammer & Ibaraki & Kawakami, Identifying 2-Monotonic Positive Boolean Functions in Polynomial Time 1991 2 ISAAC Hu & Tang & Lee, An Average Case Analysis of Monien and Speckenmeyer's Mechanical Theorem Proving Algorithm 1991 2 ISAAC Chan & Lam, An On-Line Algorithm for Navigating in Unknown Terrain 1991 2 ISAAC Janardan, On Maintaining the Width and Diameter of a Planar Point-Set Online 1991 2 ISAAC Edelsbrunner, Optimal Triangulations by Retriangulating 1991 2 ISAAC Guibas & Hershberger & Mitchell & Snoeyink, Approximating Polygons and Subdivisions with Minimum Link Paths 1991 2 ISAAC Tan & Hirata & Inagaki, An Incremental Algrithm for Constructing Shortest Watchman Routes 1991 2 ISAAC Lee & Chang, On Hitting Grid Points in a Convex Polygon with Straight Lines 1991 2 ISAAC Benkouar & Manoussakis & Paschos & Saad, On the Complexity of Some Hamiltonian and Eulerian Problems in Edge-Colored Complete Graphs 1991 2 ISAAC Asano, Dynamic Programming on Intervals 1991 2 ISAAC Szpankowski, Combinatorial Optimization Through Order Statistics 1991 2 ISAAC Guibas, Combinatorics and Algorithms of Geometric Arrangements 1991 2 ISAAC Hasegawa & Imai & Hakata, An Analysis of Randomized Shear Sort on the Mesh Computer 1991 2 ISAAC Wu, Efficient Parallel Divide-and-Conquer for a Class of Interconnection Topologies 1991 2 ISAAC Chan & Chin & Poon, Optimal Specified Root Embedding of Full Binary Trees in Faulty Hypercubes 1991 2 ISAAC Fleischer, A Tight Lower Bound for the Worst Case of Bottom-Up Heapsort 1991 2 ISAAC Moffat & Petersson, Historical Searching and Sorting 1991 2 ISAAC Andersson & Lai, Comparison-Efficient and Write-Optimal Searching and Sorting 1991 2 ISAAC Yao, Nearest Neighbors Revisited 1991 2 ISAAC Estivill-Castro & Sherk, Competitiveness and Response Time in On-Line Algorithms 1991 2 ISAAC Ho, A Linear Time Optimal Via Assignment Algorithm for Three-Dimensional Channel Routing 1991 2 ISAAC Longpre & Mocas, Symmetry of Information and One-Way Functions 1991 2 ISAAC Hsu & Hwang & Ho & Tsai, A Linear Time Algorithm to Recognize the Double Euler Trail for Series-Parallel Networks 1991 2 ISAAC Hsu & Ramachandran, On Finding a Smallest Augmentation to Biconnect a Graph 1991 2 ISAAC Kaufmann & Klar, A Faster Algorithm for Edge-Disjoint Paths in Planar Graphs 1991 2 ISAAC Lenhof & Smid, An Optimal Construction Method for Generalized Convex Layers 1991 2 ISAAC Smid, Rectangular Point Location and the Dynamic Closest Pair Problem 1991 2 ISAAC Chan & Friesen, Parallel Algorithms for Some Dominance Problems Based on a CREW PRAM 1991 2 ISAAC Diks & Garrido & Lingas, Parallel Algorithms for Finding Maximal k-Dependent Sets and Maximal f-Matchings 1994 ISIT Wyner, Typical Sequences and All That: Entropy, Pattern Matching and Data Compression 1994 ISIT Kieffer & Finamore & Nunes, A Class of Noiseless Data Compression Algorithms Based on Lempel-Ziv Parsing Trees 1994 ISIT Kieffer & Yang, On The OPTA Function For Lossless Compression Of Individual Sequences Via Recursive Sequential Codes 1994 ISIT Wyner, The Redundancy and Distribution of the Phrase Lengths of the Fixed-Database Lempel-Ziv Algorithm 1994 ISIT Wyner & Wyner, Improved Redundancy of a Version of the Lempel-Ziv Algorithm 1994 ISIT Gavish & Lempel, Match-Length Functions for Data Compression 1994 ISIT Ziv & Hershkovitz, Another Look at Universal Data Compression 1994 ISIT Franaszek & thomas & Tsoucas, Context Allocation with an Application to Data Compression 1994 ISIT Kawabata, Exact Analysis of the Lempel-Ziv Algorithm for Unifilar Markov Source 1994 ISIT Shamoon & Heegard, Adaptive Update Algorithms for Fixed Dictionary Lossless Data Compressors 1994 ISIT Kuo & Lin, Predictable Timestamp under Synchronized Clocks in a Network 1994 ISIT Zeger & Gersho, How Many Points in Euclidean Space Can Have a Common Nearest Neighbor? 1994 ISIT Coffey & Sechrest, Information Retrieval from Databases 1994 ISIT Reznikova & Ryabko, Using Shannon Entropy and Kolmogorov Complexity to Study the Language and Intelligence of Ants 1994 ISIT Alon & Orlitsky, A Lower Bound on the Expected Length of One-to-One Codes 1994 ISIT Massey, Guessing and Entropy 1994 ISIT Korner, On the Extremal Combinatorics of the Hamming Space 1994 ISIT Simonyi, Entropy Splitting Hypergraphs 1994 ISIT Arikan, An Improved Graph-Entropy Bound for Perfect Hashing 1994 ISIT Alon & Orlitsky, Repeated Communication and Ramsey Graphs 1994 ISIT Levitin & Karpovsky, Traveling Salesman Problem in the Space of Binary Vectors 1994 ISIT Khandani, Decoding of a Cartesian Product Set with a Constraint on an Additive cost; Fixed-Rate Entropy-Coded Vector Quantization 1994 ISIT Kobayashi & Morita & Hoshi, Enumeration of Permutations Classified by Length of Longest Monotone Subsequences 1994 ISIT Krichevskii & Potapov, Combinatorial Source Encoding and Perfect Hashing 1994 ISIT da Rocha, A Secret-Key Cipher Based on Linear Complementary Codes 1994 ISIT Desmedt & Yung, Minimal Cryptosystems and Defining Subliminal-Freeness 1994 ISIT Klapper & Goresky, Feedback with Carry Shift Registers: 2-Adic Models and Summation Combiners 1994 ISIT Yamamoto, Rate-Distortion Theory for the Shannon Cipher System 1994 ISIT Bennett & Brassard & Crepeau & Maurer, Generalized Privacy Amplification 1994 ISIT Gander & Maurer, On the Secret-Key Rate of Binary Random Variables 1994 ISIT Ahlswede & Zhang, Identification via Wiretap Channels 1994 ISIT Wu & Xiao & Wang, On Degeneration of Correlation-Immune Functions 1994 ISIT Hauge & Mykkeltveit, Symmetry Properties of De Bruijn Sequences 1994 ISIT van Dijk, On the Information Rate of Perfect Secret Sharing Schemes 1994 ISIT Desmedt, Subliminal-Free Sharing Schemes 1994 ISIT Blundo & De Santis & Gaggia & Vaccaro, Lower Bounds in Secret Sharing Schemes 1994 ISIT Johansson, A2-Codes and Codes for the Rank Metric 1994 ISIT Gehrmann, Long Message Authentication Using Pseudo-Random Functions 1994 ISIT Alabbadi & Wicker, Susceptibility of Digital Signature Schemes Based on Error-Correcting Codes to Universal Forgery 1994 ISIT Tanaka, Security Certified Simple Identity-Based Non-Interactive Key Sharing 1994 ISIT Blundo & Cresti & Vaccaro, Key Distribution Schemes 1994 ISIT Sidelnikov, Exponentiation-Based Key Generation Using Noncommutative Groups 1994 ISIT Rico & Sanvicente, A Very Fast Method for Verifying Digital Signatures 1994 ISIT Charnes & Pieprzyk & Safavi-Naini, Families of Threshold Schemes 1994 ISIT Safavi-Naini & Tombak & Pieprzyk, Authentication Codes and Plaintext Attack 1996 2 ISPAN Maggs, A Critical Look at Three of Parallel Computing's Maxims 1996 2 ISPAN Chen, Optimal Overlap Representations 1996 2 ISPAN Zheng & Calidas & Zhang, Efficient In-Place Sorting Algorithms Using Feasible Parallel Machine Models 1996 2 ISPAN Lee & Horng & Kao & Lee, Optimal Parallel Algorithms for Computing the Chessboard Distance Transform on RAP 1996 2 ISPAN Forsell & Leppanen & Penttonen, Efficient Two-Level Mesh Based Simulation of PRAMs 1996 2 ISPAN Yeh & Parhami, Hierarchical Swapped Networks: Efficient Low-Degree Alternatives to Hypercubes and Generalized Hypercubes 1996 2 ISPAN Huang & Chen, Shortest-Path Routing Algorithm and Topological Properties for Two-Level Hypernet Networks 1996 2 ISPAN Lee & Batcher, A Bitonic Sorting Network with Simpler Flip Interconnections 1996 2 ISPAN Qiao & Zhou, Establishing Switch--Disjoint Connections in Stage-Controlled Banyans 1996 2 ISPAN Numata & Horiguchi, Efficient Reconfiguration Scheme for Mesh-Connected Network: The Recursive Shift Approach 1996 2 ISPAN Gupta & Dixit, The Design and Deployment of a Mobility Supporting Network 1996 2 ISPAN Quammen & Stanley & Wang, The Packed Exponential Connections Network 1996 2 ISPAN Eberhart & Li, Optimizing Communication for Array Operations on Message-Passing Multicomputers 1996 2 ISPAN Kao & Horng, Computing Dominators and Its Applications on Processor Arrays with Reconfigurable Bus Systems 1996 2 ISPAN Pan & Hamdi, Quicksort on a Linear Array with a Reconfigurable Pipelined Bus System 1996 2 ISPAN Tsaur & Horng, Protocols for Designing a Fast and Perfect Group-Oriented Secret Key Sharing in Distributed Systems 1996 2 ISPAN Li & Zhang, Tuning Parallel Program through Automatic Program Analysis 1996 2 ISPAN Caro & Nochefranca & Muga & Sy, The Wide-Diameter of the Generalized de Bruijn Graphs UG_B(n,n(n+1)) 1996 2 ISPAN Lam & Furness, On Parallelization of Neural Classification Algorithms 1996 2 ISPAN Wu & Shu, Parallelization of Scheduling Algorithms 1996 2 ISPAN Chang & Liang, Performance Evaluation of Clos Networks under Bursty Traffic 1996 2 ISPAN Boury & Colinas & Richard, Extended Graph and Matrix Models for Networks 1996 2 ISPAN Siegel & Wang & Roychowdhury & Tan, Computing with Heterogeneous Parallel Machines: Advantages and Challenges 1996 2 ISPAN Su & Chen & Duh, Broadcasting on Incomplete WK-Recursive Networks 1996 2 ISPAN Xiao & Zhang & Zhou, A Multicast Protocol in Multistage Interconnection Networks 1996 2 ISPAN Jia & Nett & Cao & Kaiser, Verifications of RMP: An Efficient Reliable Multicast Protocol 1996 2 ISPAN Ho & Liang & Tsai, On Multicast Routing in Clos Networks 1996 2 ISPAN Hasimoto & Masuyama & Sasama, Fault Tolerant Subcube Allocation in Hypercube 1996 2 ISPAN Yamada & Ueno, Fault-Tolerant Graphs for Tori 1996 2 ISPAN Shen, Fault-Tolerant Multicast with Traffic-Balancing in Hypercubes 1996 2 ISPAN Nayak & Santoro & Xue, Ring Reconfiguration in Presence of Close Fault Cuts 1996 2 ISPAN Kurino & Sakakura & Zhang & Fukazawa, A Parallel Reduction Algorithm with Communication Delay 1996 2 ISPAN Hamdi & Pan, Communication-Efficient Algorithms on Reconfigurable Array of Processors with Spanning Optical Buses 1996 2 ISPAN Bokka & Olariu & Schwing & Wilson & Zomaya, A Time-Optimal Solution to Planar Point Location in Ordered Functional Domains, with Applications 1996 2 ISPAN Kim & Seo & Feng, On a Class of Concatenated (2 log_2 N - 1)-Stage Interconnection Networks 1995 ISSAC Diaz & Kaltofen, On Computing Greatest Common Divisors with Polynomials Given By Black Boxes for Their Evaluations 1995 ISSAC Liao & Fateman, Evaluation of the Heuristic Polynomial GCD 1995 ISSAC Majewski & Havas, A Solution to the Extended GCD Problem 1995 ISSAC Sorenson, An Analysis of Lehmer's Euclidean GCD Algorithm 1990 15 ISSAC Kuhn & Madlener & Otto, A Test for lambda-Confluence for Certain Prefix Rewriting Systems with Applications to the Generalized Word Problem 1990 15 ISSAC Fateman, Advances and Trends in the Design and Construction of Algebraic Manipulation Systems 1990 15 ISSAC Grigoriev, How to Test in Subexponential Time Whether Two Points can be Connected by a Curve in a Semialgebraic Set 1990 15 ISSAC Mishra & Pedersen, Arithmetic with Real Algebraic Numbers is in NC 1990 15 ISSAC Yokoyama & Noro & Takeshima, On Determining the Solvability of Polynomials 1990 15 ISSAC von zur Gathen, Polynomials over Finite Fields with Large Images 1990 15 ISSAC Chou & Gao, Methods for Mechanical Geometry Formula Deriving 1990 15 ISSAC Kapur & Wan, Refutational Proofs of Geometry Theorems via Characteristic Set Computation 1990 15 ISSAC Bini & Pan, Parallel Polynomial Computations by Recursive Processes 1989 14 ISSAC Kaltofen & Valente & Yui, An Improved Las Vegas Primality Test 1989 14 ISSAC Odlyzko, Symbolic Algebra in Mathematics: Dreams and Reality 1989 14 ISSAC Fateman, Lookup Tables, Recurrences and Complexity 1989 14 ISSAC Grossman & Larson, Labeled Trees and the Efficient Computation of Derivations 1989 14 ISSAC Devitt, Unleashing Computer Algebra on the Mathematics Curriculum 1989 14 ISSAC Ravenscroft & Lamagna, Symbolic Summation with Generating Functions 1989 14 ISSAC Kutzler, Careful Algebraic Translations of Geometry Theorems 1989 14 ISSAC Deprit & Deprit, Massively Parallel Symbolic Computation 1989 14 ISSAC O'Hearn & Stachniak, Note on Theorem Proving Strategies for Resolution Counterparts of Non-Classical Logics 1989 14 ISSAC Murray & Rosenthal, Employing Path Dissolution To Shorten Tableaux Proofs 1989 13 ISSAC Ausiello & Marchetti Spaccamela & Nanni, Dynamic Maintenance of Paths and Path Expressions on Graphs 1989 13 ISSAC Musser & Stepanov, Generic Programming 1989 13 ISSAC Sergeraert, From a Noncomputability Result to New Interesting Definitions and Computability Results 1989 13 ISSAC Sharma & Wang, Symbolic Derivation and Automatic Generation of Parallel Routines for Finite Element Analysis 1989 13 ISSAC Abhyankar & Bajaj, Computations with Algebraic Curves 1989 13 ISSAC Teitelbaum, On the Computational Complexity of the Resolution of Plane Curve Singularities 1989 13 ISSAC Edelsbrunner & Preparata & West, Tetrahedrizing Point Sets in Three Dimensions 1989 13 ISSAC Stifter, A Generalization of the Roider Method to Solve the Robot Collision Problem in 3D 1989 13 ISSAC Todd & Cherry, Symbolic Analysis of Planar Drawings 1989 13 ISSAC Winkler, A Geometrical Decision Algorithm Based on the Grobner Bases Algorithm 1989 13 ISSAC Brown & Cooperman & Finkelstein, Solving Permutation Problems Using Rewriting Systems 1989 13 ISSAC Wissmann, Applying Rewriting Techniques to Groups with Power-Commutation-Presentations 1989 13 ISSAC Weispfenning, Efficient Decision Procedures for Locally Finite Theories II 1989 13 ISSAC Boy de la Tour & Caferra, A Formal Approach to Some Usually Informal Techniques Used in Mathematical Reasoning 1989 13 ISSAC Cantone & Cutello & Ferro, Decision Procedures for Elementary Sublanguages of Set Theory. XIV: Three Languages Involving Rank Related Constructs 1989 13 ISSAC Grigor'ev, Complexity of Computing the Characters and the Genre of a System of Exterior Differential Equations 1994 24 ISMVL Chu & Current, Quaternary Multiplier Circuit 1994 24 ISMVL Kamiura & Hata & Yamato, Design of Fault-Tolerant Cellular Arrays on Multiple-Valued Logic 1994 24 ISMVL Reischer & Simovici & Stojmenovic, Several Remarks on Algebraic Entropy 1994 24 ISMVL Kauffman, Knot Automata 1993 6 ISRGPMC Holst, The General Birthday Problem 1993 6 ISRGPMC Duke & Lefmann & Rodl, On Uncrowded Hypergraphs 1993 6 ISRGPMC Bollobas & Kohayakawa & Luczak, Connectivity Properties of Random Subgraphs of the Cube 1993 6 ISRGPMC Brightwell, Random Graph Orders Do Not Satisfy a 0-1 Law 1993 6 ISRGPMC Lynch, On the Threshold of Chaos in Random Boolean Cellular Automata 1993 6 ISRGPMC Alon & Tuza, The Acyclic Orientation Game on Random Graphs 1993 6 ISRGPMC Odlyzko, Search for the Maximum of a Random Walk 1993 6 ISRGPMC Erdos & Suen & Winkler, On the Size of a Random Maximal Graph 1993 6 ISRGPMC Tuza, How to Make A Random Graph Irregular 1993 6 ISRGPMC Maier, The Shape of Stretched Planar Trees 1993 6 ISRGPMC Janson, A Graph Fourier Transform and Proportional Graphs 1993 6 ISRGPMC Bollobas & Thomason, Generalized Chromatic Numbers of Random Graphs 1993 6 ISRGPMC miscellaneous, Open Problems 1990 3 ISRGPMC Frieze & Kucera, Parallel Colouring of Random Graphs 1990 3 ISRGPMC Frieze & Luczak, Hamiltonian Cycles in a Class of Random Graphs: One Step Further 1990 3 ISRGPMC Janson & Luczak & Rucinski, An Exponential Bound for the Probability of Nonexistence of a Specified Subgraph of a Random Graph 1990 3 ISRGPMC Kemp, Further Results on Leftist Trees 1990 3 ISRGPMC Kratochvil & Maly & Matousek, On the Existence of Perfect Codes in a Random Graph 1990 3 ISRGPMC Rucinski, Small Subgraphs of Random Graphs--A Survey 1990 3 ISRGPMC Spencer, Undecidable Probabilities 1990 3 ISRGPMC Vahidi-Asl & Wierman, First-Passage Percolation on the Voronoi Tesselation and Delaunay Triangulation 1990 3 ISRGPMC Weber, Random Spread of Information, Random Graph Processes and Random Walks 1985 2 ISRGPMC Dyer & Frieze & Foulds, On the Strength of Connectivity of Random Subgraphs of the n-Cube 1985 2 ISRGPMC Janson, Random Self-Avoiding Walks in Some One-dimensional Lattices 1985 2 ISRGPMC Luczak, On Matchings and Hamiltonian Cycles in Subgraphs of Random Graphs 1985 2 ISRGPMC Palmer, Unsolved Problems in the Theory of Random Graphs 1985 2 ISRGPMC Thomason, Pseudo-Random Graphs 1985 2 ISRGPMC Weber, On the Independence Number of Random Subgraphs of the n-Cube 1991 ISSMM DeHon & Knight & Minsky, Fault-Tolerant Design for Multistage Routing Networks 1995 3 ISTCS Gemund & Jakob & Massonne & Paul & Spengler, High Performance Transaction Systems on the SB-PRAM 1995 3 ISTCS Czumaj & Meyer auf der Heide & Stemann, Improved Optimal Shared Memory Simulations, and the Power of Reconfiguration 1995 3 ISTCS Ben Aroya & Newman & Schuster, Randomized Single-Target Hot-Potato Routing 1995 3 ISTCS Feige, Observations on Hot Potato Routing 1995 3 ISTCS Vereshchagin, NP-Sets are Co-NP-Immune Relative to a Random Oracle 1995 3 ISTCS Vereshchagin, Lower Bounds for Perceptrons Solving some Separation Problems and Oracle Separation of AM from PP 1995 3 ISTCS Tardos & Barrington, A Lower Bound on the Mod 6 Degree of the OR Function 1995 3 ISTCS Hoyer, A General Technique for Implementation of Efficient Priority Queues 1995 3 ISTCS Schmidt, All Shortest Paths in Weighted Grid Graphs and Its Application to Finding All Approximate Repeats in Strings 1995 3 ISTCS Katz, Improved Algorithms in Geometric Optimization via Expanders 1995 3 ISTCS Dor & Zwick, Finding Percentile Elements 1995 3 ISTCS Brit & Moran & Taubenfeld, Public Data Structures: Counters as a Special Case 1995 3 ISTCS Ben-Dor & Israeli & Shirazi, Dynamic Counting 1995 3 ISTCS Riany & Shavit & Touitou, Towards a Practical Snapshot Algorithm 1995 3 ISTCS Gerth & Kuiper & Peled & Penczek, A Partial Order Approach to Branching Time Logic Model Checking 1995 3 ISTCS Harel & Singerman, More on Nonregular PDL: Expressive Power, Finite Models, Fibonacci Programs 1995 3 ISTCS Petersen, Automata with Sensing Heads 1995 3 ISTCS Pevzner & Waterman, Open Combinatorial Problems in Computational Molecular Biology 1995 3 ISTCS Rossner & Schnorr, Computation of Highly Regular Nearby Points 1995 3 ISTCS Feige & Goemans, Approximating the Value of Two Prover Proof Systems, with Applications to MAX 2SAT and MAX DICUT 1995 3 ISTCS Friedl & Sudan, Some Improvements to Total Degree Tests 1995 3 ISTCS Bellare & Feige & Kilian, On the Role of Shared Randomness in Two Prover Proof Systems 1995 3 ISTCS Kilian & Naor, On the Complexity of Statistical Reasoning 1995 3 ISTCS Wigderson, Computational Pseudo-Randomness 1995 3 ISTCS Goldberg & Zwick, Optimal Deterministic Approximate Parallel Prefix Sums and Their Applications 1995 3 ISTCS Berkman & Gibbons & Matias, On the Power of Randomization for the Common PRAM 1995 3 ISTCS Sgall, Randomized On-Line Scheduling of Parallel Jobs 1995 3 ISTCS Moran, Using Approximate Agreement to Obtain Complete Disagreement: The Output Structure of Input-Free Asynchronous Computations 1995 3 ISTCS Kleinberg & Attiya & Lynch, Trade-Offs between Message Delivery and Quiesce Times in Connection Management Protocols 1995 3 ISTCS Mayer & Naor & Stockmeyer, Local Computations on Static and Dynamic Graphs 1992 ISTCS Chen, Merging and Splitting Priority Queues and Deques in Parallel 1992 ISTCS Bshouty, Lower Bounds for the Complexity of Functions in a Realistic RAM Model 1992 ISTCS Kenyon & King, On Boolean Decision Trees with Faulty Nodes 1992 ISTCS Golumbic & Shamir, Interval Graphs, Interval Orders and the Consistency of Temporal Events 1992 ISTCS Voronkov, Higher Order Functions in First Order Theory 1992 ISTCS Dosch, Reduction Relations in Strict Applicative Languages 1992 ISTCS Kortsarz & Peleg, Approximation Algorithms for Minimum Time Broadcast 1992 ISTCS Ben-Asher & Peleg & Schuster, The Complexity of Reconfiguring Network Models 1992 ISTCS Gal & Hollander & Itai, Optimal Mapping in Direct Mapped Cache Environments 1992 ISTCS Cohen & Megiddo, New Algorithms for Generalized Network Flows 1992 ISTCS Miller, Factoring Polynomials via Relation-Finding 1992 ISTCS Pan, New Resultant Inequalities and Complex Polynomial Factorization 1992 ISTCS Linzer, Can Symmetric Toeplitz Solvers be Strongly Stable? 1992 ISTCS Sadeh & Averbuch, On Parallel Computation of Multivariate Polynomials 1992 ISTCS Dwork & Herlihy & Plotkin & Waarts, Time-Lapse Snapshots 1992 ISTCS Gawlick & Lynch & Shavit, Concurrent Timestamping Made Simple 1992 ISTCS Helary & Raynal, Distributed Evaluation: A Tool for Constructing Distributed Detection Programs 1992 ISTCS Luk-Zilberman, Foundations of Asymptotical Theory of Determinate Compact Testing 1992 ISTCS Hartman, Optimal K-Colouring and K-Nesting of Intervals 1992 ITCOMP Gray & Cosman & Riskin, Image Compression and Tree-Structured Vector Quantization 1992 ITCOMP Fisher & Jacobs & Boss, Fractal Image Compression Using Iterated Transforms 1992 ITCOMP Reif & Yoshida, Optical Techniques for Image Compression 1992 ITCOMP Howard & Vitter, Practical Implementations of Arithmetic Coding 1992 ITCOMP Hirschberg & Lelewer, Context Modeling for Text Compression 1992 ITCOMP Cohn, Ziv-Lempel Compressors with Deferred-Innovation 1992 ITCOMP Storer, Massively Parallel Systolic Algorithms for Real-Time Dictionary-Based Text Compression 1992 ITCOMP Capocelli & De Santis, Variations on a Theme by Gallager 1992 ITCOMP Weinberger & Lempel & Ziv, On the Coding Delay of a General Coder 1992 ITCOMP Sheinwald, Finite State Two-Dimensional Compressibility 1997 ITP Sipser, Introduction to the Theory of Computation 1995 ITP Ford, Spinning the Web: How to Provide Information on the Internet 1995 ITP Decker & Hirshfield, The Object Concept: An Introduction to Computer Programming Using C++ 1994 ITP Wang, C++ with Object-Oriented Programming 1992 2 ITS Anderson, Intelligent Tutoring and High School Mathematics 1992 2 ITS Kurup & Greer & McCalla, The Fawlty Article Tutor 1991 IWANN Ligomenides, Cooperative Computing and Neural Networks 1991 IWANN Kemke, Neural Network Modelling by Means of Networks of Finite Automata 1991 IWANN Mayoraz, On the Power of Networks of Majority Functions 1989 6 IWDM Ben Choi & Lee, Generic Associative Memory for Information Retrieval 1989 6 IWDM Lee & Mak, Design and Analysis of a Parallel VLSI String Search Algorithm 1996 3 IWFSE Lai & Rueppel, Attacks on the HKM/HFX Cryptosystem 1996 3 IWFSE Knudsen & Berson, Truncated Differentials of SAFER 1996 3 IWFSE Vaudenay, On the Weak Keys of Blowfish 1996 3 IWFSE Blaze, High-Bandwidth Encryption with Low-Bandwidth Smartcards 1996 3 IWFSE Jenkins, ISAAC 1996 3 IWFSE Geiselmann, A Note on the Hash Function of Tillich and Zemor 1996 3 IWFSE Dobbertin, Cryptanalysis of MD4 1996 3 IWFSE Dobbertin & Bosselaers & Preneel, RIPEMD-160: A Strengthened Version of RIPEMD 1996 3 IWFSE Nyberg, Fast Accumulated Hashing 1996 3 IWFSE Anderson & Biham, Tiger: A Fast New Hash Function 1996 3 IWFSE Rijmen & Daemen & Preneel & Bosselaers & De Win, The Cipher SHARK 1996 3 IWFSE Anderson & Biham, Two Practical and Provably Secure Block Ciphers: BEAR and LION 1996 3 IWFSE Schneier & Kelsey, Unbalanced Feistel Networks and Block Cipher Design 1996 3 IWFSE Clark & Golic & Dawson, A Comparison of Fast Correlation Attacks 1996 3 IWFSE Penzhorn, Correlation Attacks on Stream Ciphers: Computing Low-Weight Parity Checks Based on Error-Correcting Codes 1996 3 IWFSE Golic, On the Security of Nonlinear Filter Generators 1996 3 IWFSE Lucks, Faster Luby-Rackoff Ciphers 1996 3 IWFSE Matsui, New Structure of Block Ciphers with Provable Security Against Differential and Linear Cryptanalysis 1994 2 IWFSE Baum & Blackburn, Clock-controlled Pseudorandom Generators on Finite Groups 1994 2 IWFSE Chambers, On Random Mappings and Random Permutations 1994 2 IWFSE Ding, Binary Cyclotomic Generators 1994 2 IWFSE Dobbertin, Construction of Bent Functions and Balanced Boolean Functions with High Nonlinearity 1994 2 IWFSE Lai, Additive and Linear Structures of Cryptographic Functions 1994 2 IWFSE Rivest, The RC5 Encryption Algorithm 1994 2 IWFSE Blaze & Schneier, The MacGuffin Block Cipher Algorithm 1994 2 IWFSE Nyberg, S-Boxes and round Functions with Controllable Linearity and Differential Uniformity 1994 2 IWFSE O'Connor, Properties of Linear Approximation Tables 1994 2 IWFSE Anderson, Searching for the Optimum Correlation Attack 1994 2 IWFSE Biham & Kocher, A Known Plaintext Attack on the PKZIP Stream Cipher 1994 2 IWFSE Golic, Linear Cryptanalysis of Stream Ciphers 1994 2 IWFSE Klapper, Feedback with Carry Shift Registers over Finite Fields 1994 2 IWFSE MacKay, A Free energy Minimization Framework for Inference Problems in Modulo 2 Arithmetic 1994 2 IWFSE Knudsen, Truncated and Higher Order Differentials 1994 2 IWFSE Massey, SAFER K-64: One Year Later 1994 2 IWFSE Rijmen & Preneel, Improved Characteristics for Differential Cryptanalysis of Hash Functions Based on Block Ciphers 1994 2 IWFSE Kaliski & Robshaw, Linear Cryptanalysis Using Multiple Approximations and FEAL 1994 2 IWFSE Blocher & Dichtl, Problems with the Linear Cryptanalysis of DES Using More Than One Active S-Box per Round 1994 2 IWFSE Daemen & Govaerts & Vandewalle, Correlation Matrices 1994 2 IWFSE Vaudenay, On the Need for Multipermutations: Cryptanalysis of MD4 and SAFER 1994 2 IWFSE Lucks, How to Exploit the Intractability of Exact TSP for Cryptography 1994 2 IWFSE Roe, How to Reverse Engineer an EES Device 1994 2 IWFSE Penzhorn, A Fast Homophonic Coding Algorithm Based on Arithmetic Coding 1994 2 IWFSE Anderson, On Fibonacci Keystream Generators 1994 2 IWFSE Rijmen & Preneel, Cryptanalysis of McGuffin 1994 2 IWFSE Roe, Performance of Block Ciphers and Hash Functions -- One Year Later 1994 2 IWFSE Wheeler & Needham, TEA, a tiny Encryption Algorithm 1996 9 IWHOLTP Brackin, Deciding Cryptographic Protocol Adequacy with HOL: The Implementation 1996 9 IWHOLTP Gordon, Set Theory, Higher Order Logic or Both? 1995 8 IWHOLTP Agerholm, Non-Primitive Recursive Function Definitions 1995 8 IWHOLTP Brackin, Deciding Cryptographic Protocol Adequacy with HOL 1995 8 IWHOLTP Busch, A Practical Method for Reasoning About Distributed Systems in a Theorem Prover 1995 8 IWHOLTP Collins & Syme, A Theory of Finite Maps 1995 8 IWHOLTP Eisenbiegler & Kumar, An Automata Theory Dedicated Towards Formal Circuit Synthesis 1995 8 IWHOLTP Harrison, Inductive Definitions: Automation and Application 1995 8 IWHOLTP Yamamoto & Nishizaki & Hagiya & Toda, Formalization of Planar Graphs 1989 IWSCM Newbery, Edge Concentration: A Method for Clustering Directed Graphs 1990 1 IWWERT Makanin, Investigations on Equations in a Free Group 1990 1 IWWERT Koscielski, An Analysis of Makanin's Algorithm Deciding Solvability of Equations in Free Groups 1990 1 IWWERT Abdulrab, Implementation of Makanin's Algorithm 1990 1 IWWERT Schulz, Makanin's Algorithm for Word Equations -- Two Improvements and a Generalization 1990 1 IWWERT Baader, Unification Theory 1990 1 IWWERT Bockmayr, Algebraic and Logic Aspects of Unification 1990 1 IWWERT Bockmayr, Model-Theoretic Aspects of Unification 1990 1 IWWERT Ohsuga & Sakai, Complete Equational Unification Based on an Extension of the Knuth-Bendix Completion Procedure 1990 1 IWWERT Baader, Unification in Varieties of Completely Regular Semigroups 1990 1 IWWERT Book, A Note on Confluent Thue Systems 1990 1 IWWERT Wrathall, Confluence of One-Rule Thue Systems 1990 1 IWWERT Karhumaki, Systems of Equations over a Finite Set of Words and Automata Theory (extended abstract) 1990 1 IWWERT Makanina, New System of Defining Relations of the Braid Group 1994 42 IZVESTIYA Vdovin, Extension of a New Axiomatic Set Theory 1994 42 IZVESTIYA Vereshchagin, Relativizable and Nonrelativizable Theorems in the Polynomial Theory of Algorithms 1992 38 IZVESTIYA Bulitko, On Ways of Characterizing Complete Sets 1991 37 IZVESTIYA Vdovin, Foundations of a New Axiomatic Set Theory 1987 29 IZVESTIYA Grigor'ev, The Complexity of the Decision Problem for the First Order Theory of Algebraically Closed Fields 1985 IZVESTIYA Ivanov, Recognition of an Approximate Occurrence of Words on a Turing Machine in Real Time 1997 44 JACM Miller & Teng & Thurston & Vavasis, Separators for Sphere-Packings and Nearest Neighbor Graphs 1997 44 JACM Abiteboul & Vardi & Vianu, Fixpoint Logics, Relational Machines, and Computational Complexity 1997 44 JACM Morishita, Avoiding Cartesian Products for Multiple Joins 1997 44 JACM Awerbuch & Schulman, The Maintenance of Common Data in a Distributed System 1997 44 JACM Koch & Leighton & Maggs & Rao & Rosenberg & Schwabe, Work-Preserving Emulations of Fixed-Connection Networks 1997 44 JACM Ishii & Leiserson & Papaefthymiou, Optimizing Two-Phase, Level-Clocked Circuitry 1996 43 JACM Baeza-Yates & Gonnet, Fast Text Searching for Regular Expressions or Automaton Searching on Tries 1996 43 JACM Omlin & Giles, Constructing Deterministic Finite-State Automata in Recurrent Neural Networks 1996 43 JACM Aggarwal & Bar-Noy & Coppersmith & Ramaswami & Schieber & Sudan, Efficient Routing in Optical Networks 1996 43 JACM Basu & Pollack & Roy, On the Combinatorial and Algebraic Complexity of Quantifier Elimination 1996 43 JACM Sippu & Soisalon-Soininen, An Analysis of Magic Sets and Related Optimization Strategies for Logic Queries 1996 43 JACM Vitter & Krishnan, Optimal Prefetching via Data Compression 1996 43 JACM Busch & Mavronicolas, A Combinatorial Treatment of Balancing Networks 1996 43 JACM Hellerstein & Pillaipakkamnatt & Raghavan & Wilkins, How Many Queries Are Needed to Learn? 1996 43 JACM Bol & Groote, The Meaning of Negative Premises in Transition Systems Specifications 1996 43 JACM Karger & Stein, A New Approach to the Minimum Cut Problems 1996 43 JACM Cheng & Muntz, Bounding Errors Introduced by Clustering of Customers in Closed Product-Form Queuing Networks 1996 43 JACM Koscielski & Pacholski, Complexity of Makanin's Algorithm 1996 43 JACM Chandra & Hadzilacos & Toueg, The Weakest Failure Detector for Solving Consensus 1996 43 JACM Li & Tromp & Vitanyi, How to Share Concurrent Wait-Free Variables 1996 43 JACM Bshouty & Tamon, On the Fourier Spectrum of Monotone Functions 1996 43 JACM Santos, On Linear Potential Functions for Approximating Bayesian Computations 1996 43 JACM Goldreich & Ostrovsky, Software Protection and Simulation on Oblivious RAMs 1996 43 JACM Marcus & Subrahmanian, Foundations of Multimedia Database Systems 1996 43 JACM Nederhof & Bertsch, Linear-Time Suffix Parsing for Deterministic Languages 1996 43 JACM van Glabbeek & Weijland, Branching Time and Abstraction in Bisimulation Semantics 1996 43 JACM Selman & Kautz, Knowledge Compilation and Theory Approximation 1996 43 JACM Chandra & Toueg, Unreliable Failure Detectors for Reliable Distributed Systems 1996 43 JACM Feige & Goldwasser & Lovasz & Safra & Szegedy, Interactive Proofs and the Hardness of Approximating Cliques 1996 43 JACM Bhatt & Chung & Hong & Leighton & Obrenic & Rosenberg & Schwabe, Optimal Emulations by Butterfly-Like Networks 1996 43 JACM Goodrich & Kosaraju, Sorting on a Parallel Pointer Machine with Applications to Set Expression Evaluation 1996 43 JACM Curien & Harding & Levy, Confluence Properties of Weak and Strong Calculi of Explicit Substitutions 1996 43 JACM Afek & Awerbuch & Plotkin & Saks, Local Management of a Global Resource in a Communication Network 1996 43 JACM Chen & Warren, Tabled Evaluation with Delaying for General Logic Programs 1996 43 JACM Joung & Smolka, A Comprehensive Study of the Complexity of Multiparty Interaction 1996 43 JACM Alur & Feder & Henzinger, The Benefits of Relaxing Punctuality 1996 43 JACM Miltersen & Paterson & Tarui, The Asymptotic Complexity of Merging Networks 1996 43 JACM Boyer & Yu, Automated Proofs of Object Code for a Widely Used Microprocessor 1995 42 JACM Goemans & Williamson, Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming 1995 42 JACM Freivalds & Kinber & Smith, On the Impact of Forgetting on Learning Machines 1995 42 JACM Boyar & Brassard & Peralta, Subquadratic Zero-Knowledge 1995 42 JACM Bergstra & Tucker, Equational Specifications, Complete Term Rewriting Systems, and Computable and Semicomputable Algebras 1995 42 JACM Afek & Greenberg & Merritt & Taubenfeld, Computing with Faulty Shared Objects 1995 42 JACM Toyama & Klop & Barendregt, Termination for Direct Sums of Left-Linear Complete Term Rewriting Systems 1995 42 JACM Choudhury & Leung & Whitt, Calculating Normalization Constants of Closed Queueing Networks by Numerically Inverting Their Generating Functions 1995 42 JACM Koutsoupias & Papadimitriou, On the k-Server Conjecture 1995 42 JACM Verma, A Theory of Using History for Equational Systems with Applications 1995 42 JACM Awerbuch & Peleg, Online Tracking of Mobile Users 1995 42 JACM Tempero & Ladner, Recoverable Sequence Transmission Protocols 1995 42 JACM Kahale, Eigenvalues and Expansion of Regular Graphs 1995 42 JACM Conforti & Cornuejols, A Class of Logic Problems Solvable by Linear Programming 1995 42 JACM Gottlob, Translating Default Logic into Standard Autoepistemic Logic 1995 42 JACM Kifer & Lausen & Wu, Logical Foundations of Object-Oriented and Frame-Based Languages 1995 42 JACM Alon & Yuster & Zwick, Color-Coding 1995 42 JACM Courcoubetis & Yannakakis, The Complexity of Probabilistic Verification 1995 42 JACM Galil, A Constant-Time Optimal Parallel String-Matching Algorithm 1995 42 JACM Nodine & Vitter, Greed Sort: Optimal Deterministic Sorting on Parallel Disks 1995 42 JACM van Beek & Dechter, On the Minimality and Global Consistency of Row-Convex Constraint Networks 1995 42 JACM Compton & Ravishankar, Expected Deadlock Time in a Multiprocessing System 1995 42 JACM Korilis & Lazar, On the Existence of Equilibria in Noncooperative Optimal Flow Control 1995 42 JACM Bay & Bilardi, Deterministic On-Line Routing on Area-Universal Networks 1995 42 JACM Birman & Gail & Hantler & Rosberg & Sidi, An Optimal Service Policy for Buffer Systems 1995 42 JACM O'Hearn & Tennent, Parametricity and Local Variables 1995 42 JACM Lin & Shoham, Provably Correct Theories of Action 1995 42 JACM Karger & Klein & Tarjan, A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees 1995 42 JACM Wang & Zhang & Chau, Decomposition of Magic Rewriting 1995 42 JACM Tsitsiklis & Stamoulis, On the Average Communication Complexity of Asynchronous Distributed Algorithms 1995 42 JACM Kurtz & Mahaney & Royer, The Isomorphism Conjecture Fails Relative to a Random Oracle 1995 42 JACM Gottlob, NP Trees and Carnap's Modal Logic 1995 42 JACM De Nicola & Vaandrager, Three Logics for Branching Bisimulation 1995 42 JACM Clarkson, Las Vegas Algorithms for Linear and Integer Programming When the Dimension Is Small 1995 42 JACM Berger & Brady & Brown & Leighton, Nearly Optimal Algorithms and Bounds for Multilayer Channel Routing 1995 42 JACM Eiter & Gottlob, The Complexity of Logic-Based Abduction 1995 42 JACM Nebel & Burckert, Reasoning About Temporal Relations: A Maximal Tractable Subclass of Allen's Interval Algebra 1995 42 JACM Callahan & Kosaraju, A Decompostion of Multidimensional Point Sets with Applications to k-Nearest Neighbors and n-Body Potential Fields 1995 42 JACM Chien & Kim, Planar-Adaptive Routing: Low-Cost Adaptive Networks for Multiprocessors 1995 42 JACM Attiya & Bar-Noy & Dolev, Sharing Memory Robustly in Message-Passing Systems 1995 42 JACM Dolev & Halpern & Simons & Strong, Dynamic Fault-Tolerant Clock Synchronization 1995 42 JACM Haldar & Vidyasankar, Constructing 1-Writer Multireader Multivalued Atomic Variables from Regular Variables 1995 42 JACM Chang & Nelson, Bounds on the Speedup and Efficiency of Partial Synchronization on Parallel Processing Systems 1995 42 JACM Bloom & Istrail & Meyer, Bisimulation Can't Be Traced 1995 42 JACM Blum & Kannan, Designing Programs that Check Their Work 1994 41 JACM Atallah & Goodrich & Kosaraju, Parallel Algorithms for Evaluating Sequences of Set-Manipulation Operations 1994 41 JACM Rabin, Robust Sharing of Secrets when the Dealer Is Honest or Cheating 1994 41 JACM Ross & Tsang & Wang, Monte Carlo Summation and Integration Applied to Multiclass Queuing Networks 1994 41 JACM Karp, Probabilistic Recurrence Relations 1994 41 JACM Naughton & Ramakrishnan, How to Forget the Past without Repeating It 1994 41 JACM Bell & Nerode & Ng & Subrahmanian, Mixed Integer Programming Methods for Computing Nonmonotonic Deductive Databases 1994 41 JACM Ross, Modular Stratification and Magic Sets for Datalog Programs with Negation 1994 41 JACM Afek & Attiya & Fekete & Fischer & Lynch & Mansour & Wang & Zuck, Reliable Communication Over Unreliable Channels 1994 41 JACM Kearns & Li & Valiant, Learning Boolean Formulas 1994 41 JACM Motwani, Average-Case Analysis of Algorithms for Matchings and Related Problems 1994 41 JACM Rathmann & Winslett & Manasse, Circumscription with Homomorphisms: Solving the Equality and Counterexample Problems 1994 41 JACM Glass & Ni, The Turn Model for Adaptive Routing 1994 41 JACM Dallery & Liu & Towsley, Equivalence, Reversibility, Symmetry and Concavity Properties in Fork-Join Queuing Networks with Blocking 1994 41 JACM Driscoll & Sleator & Tarjan, Fully Persistent Lists with Catenation 1994 41 JACM Lund & Yannakakis, On the Hardness of Approximating Minimization Problems 1994 41 JACM Storer & Reif, Shortest Paths in the Plane with Polygonal Obstacles 1994 41 JACM Reif & Storer, A Single-Exponential Upper Bound for Finding Shortest Paths in Three Dimensions 1994 41 JACM Aspnes & Herlihy & Shavit, Counting Networks 1994 41 JACM Buntine & Burckert, On Solving Equations and Disequations 1994 41 JACM Blum & Jiang & Li & Tromp & Yannakakis, Linear Approximation of Shortest Superstrings 1994 41 JACM Conway & Pinsky & Tridandapani, Efficient Decomposition Methods for the Analysis of Multi-Facility Blocking Models 1994 41 JACM Lui & Muntz, Computing Bounds on Steady State Availability of Repairable Computer Systems 1994 41 JACM Bell & Witten, The Relationship between Greedy Parsing and Symbolwise Text Compression 1994 41 JACM Attiya & Lynch & Shavit, Are Wait-Free Algorithms Fast? 1994 41 JACM Reif & Sharir, Motion Planning in the Presence of Moving Obstacles 1994 41 JACM Gao & Kaufmann, Channel Routing of Multiterminal Nets 1994 41 JACM Ladkin & Maddux, On Binary Constraint Problems 1994 41 JACM Blum, New Approximation Algorithms for Graph Coloring 1994 41 JACM Drusinsky & Harel, On the Power of Bounded Concurrency I: Finite Automata 1994 41 JACM Hirst & Harel, On the Power of Bounded Concurrency II: Pushdown Automata 1994 41 JACM Rivest & Schapire, Diversity-Based Inference of Finite Automata 1994 41 JACM Dubiner & Galil & Magen, Faster Tree Pattern Matching 1994 41 JACM Khuller & Vishkin, Biconnectivity Approximations and Graph Carvings 1994 41 JACM Bachmair & Dershowitz, Equational Inference, Canonical Proofs, and Proof Orderings 1994 41 JACM Abrahamson & Adler & Higham & Kirkpatrick, Tight Lower Bounds for Probabilistic Solitude Verification on Anonymous Rings 1994 41 JACM Singh & Anderson & Gouda, The Elusive Atomic Register 1994 41 JACM Fagin & Halpern, Reasoning About Knowledge and Probability 1994 41 JACM Kfoury & Tiuryn & Urzyczyn, An Analysis of ML Typability 1994 41 JACM Cosnard & Daoudi, Optimal Algorithms for Parallel Givens Factorization on a Coarse-Grained PRAM 1994 41 JACM Alon & Megiddo, Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time 1994 41 JACM Fischer & Paterson, Fishspear: A Priority Queue Algorithm 1994 41 JACM Rockmore, Efficient Computation of Fourier Inversion for Finite Groups 1994 41 JACM Kearns & Valiant, Cryptographic Limitations on Learning Boolean Formulae and Finite Automata 1994 41 JACM Orponen & Ko & Schoning & Watanabe, Instance Complexity 1994 41 JACM Attiya & Dwork & Lynch & Stockmeyer, Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty 1994 41 JACM Baker, Approximation Algorithms for NP-Complete Problems on Planar Graphs 1994 41 JACM Alur & Henzinger, A Really Temporal Logic 1993 40 JACM Coffman & Garey, Proof of the 4/3 Conjecture for Preemptive vs. Nonpreemptive Two-Processor Scheduling 1993 40 JACM Luo & Tsitsiklis, On the Communication Complexity of Distributed Algebraic Computation 1993 40 JACM Donald & Xavier & Canny & Reif, Kinodynamic Motion Planning 1993 40 JACM Tay, On the Optimality of Strategies for Multiple Joins 1993 40 JACM Fekete & Lynch & Mansour & Spinelli, The Impossibility of Implementing Reliable Communication in the Face of Crashes 1993 40 JACM Golumbic & Shamir, Complexity and Algorithms for Reasoning about Time: A Graph-Theoretic Approach 1993 40 JACM Arnborg & Courcelle & Proskurowski & Seese, An Algebraic Theory of Graph Reduction 1993 40 JACM Fonlupt & Nachef, Dynamic Programming and the Graphical Traveling Salesman Problem 1993 40 JACM Jean-Marie & Gun, Parallel Queues with Resequencing 1993 40 JACM Baccelli & Liu & Towsley, Extremal Scheduling of Parallel Processing with and without Real-Time Constraints 1993 40 JACM Knessl, On the Sojourn Time Distribution in a Finite Capacity Processor Shared Queue 1993 40 JACM Cohen & Megiddo, Strongly Polynomial-Time and NC Algorithms for Detecting Cycles in Periodic Graphs 1993 40 JACM Yu & Dias & Lavenberg, On the Analytical Modeling of Database Concurrency Control 1993 40 JACM Afek & Attiya & Dolev & Gafni & Merritt & Shavit, Atomic Snapshots of Shared Memory 1993 40 JACM Afrati & Papadimitriou, The Parallel Complexity of Simple Logic Programs 1993 40 JACM Halpern & Tuttle, Knowledge, Probability, and Adversaries 1993 40 JACM Marek & Schwarz & Truszczynski, Modal Nonmonotonic Logics: Ranges, Characterization, Computation 1993 40 JACM Coppersmith & Doyle & Raghavan & Snir, Random Walks on Weighted Graphs and Applications to On-line Algorithms 1993 40 JACM Karloff & Raghavan, Randomized Algorithms and Pseudorandom Numbers 1993 40 JACM Baader, Unification in Commutative Theories, Hilbert's Bagis Theorem, and Grobner Bases 1993 40 JACM Murray & Rosenthal, Dissolution: Making Paths Vanish 1993 40 JACM Johnson, Factorization and Circuit in the Connection Method 1993 40 JACM Wang, Z-Module Reasoning: An Equality-Oriented Proving Method with Built-in Ring Axioms 1993 40 JACM Linial & Mansour & Nisan, Constant Depth Circuits, Fourier Transform, and Learnability 1993 40 JACM Mehlhorn & Tsakalidis, Dynamic Interpolation Search 1993 40 JACM van Kreveld & Overmars, Union-Copy Structures and Dynamic Segment Trees 1993 40 JACM Baeten & Bergstra & Klop, Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages 1993 40 JACM Gaifman & Mairson & Sagiv & Vardi, Undecidable Optimization Problems for Database Logic Programs 1993 40 JACM Nelson & Towsley, A Performance Evaluation of Several Priority Policies for Parallel Processing Systems 1993 40 JACM Bhatt & Cai, Taking Random Walks to Grow Trees in Hypercubes 1993 40 JACM Karp & Zhang, Randomized Parallel Algorithms for Backtrack Search and Branch-and-Bound Computation 1993 40 JACM Bshouty, On the Complexity of Functions for Random Access Machines 1993 40 JACM LaPaugh, Recontamination Does Not Help to Search a Graph 1993 40 JACM McAllester & Givan, Taxonomic Syntax for First Order Inference 1993 40 JACM McAllester, Automatic Recognition of Tractability in Inference Relations 1993 40 JACM Nicol, The Cost of Conservative Synchronization in Parallel Discrete Event Simulations 1993 40 JACM Neiger & Toueg, Simulating Synchronized Clocks and Common Knowledge in Distributed Systems 1993 40 JACM Lengauer & Wanke, Efficient Decision Procedures for Graph Properties on Context-Free Graph Languages 1993 40 JACM Leung, An Execution/Sleep Scheduling Policy for Serving an Additional Job in Priority Queueing Systems 1993 40 JACM Gallier & Narendran & Plaisted & Raatz & Snyder, An Algorithm for Finding Canonical Sets of Ground Rewrite Rules in Polynomial Time 1993 40 JACM Dolev & Dwork & Waarts & Yung, Perfectly Secure Message Transmission 1993 40 JACM Hobby, Generating Automatically Tuned Bitmaps from Outlines 1993 40 JACM Pitt & Warmuth, The Minimum Consistent DFA Problem Cannot be Approximated within any Polynomial 1993 40 JACM Harper & Honsell & Plotkin, A Framework for Defining Logics 1993 40 JACM Angluin & Hellerstein & Karpinski, Learning Read-Once Formulas with Queries 1992 39 JACM Borodin & Linial & Saks, An Optimal On-Line Algorithm for Metrical Task System 1992 39 JACM Fiat & Naor & Schmidt & Siegel, Nonoblivious Hashing 1992 39 JACM Mansour & Schieber, The Intractability of Bounded Protocols for On-Line Sequence Transmission over Non-FIFO Channels 1992 39 JACM Dwork & Stockmeyer, Finite State Verifiers I: The Power of Interaction 1992 39 JACM Dwork & Stockmeyer, Finite State Verifiers II: Zero Knowledge 1992 39 JACM Lund & Fortnow & Karloff & Nisan, Algebraic Methods for Interactive Proof Systems 1992 39 JACM Shamir, IP = PSPACE 1992 39 JACM Shen, IP = PSPACE: Simplified Proof 1992 39 JACM Herlihy & Lynch & Merritt & Weihl, On the Correctness of Orphan Management Algorithms 1992 39 JACM Collins & Dolinar & McEliece & Pollara, A VLSI Decomposition of the deBruijn Graph 1992 39 JACM Debray, Efficient Dataflow Analysis of Logic Programs 1992 39 JACM Dillencourt & Samet & Tamminen, A General Approach to Connected Component Labeling for Arbitrary Image Representations (Corrigenda) 1992 39 JACM Halpern & Zuck, A Little Knowledge Goes a Long Way: Knowledge-Based Derivations and Correctness Proofs for a Family of Protocols 1992 39 JACM Heath & Istrail, The Pagenumber of Genus g Graphs is O(g) 1992 39 JACM Billionnet & Costa & Sutter, An Efficient Algorithm for a Task Allocation Problem 1992 39 JACM Eppstein & Galil & Giancarlo & Italiano, Sparse Dynamic Programming I: Linear Cost Functions 1992 39 JACM Eppstein & Galil & Giancarlo & Italiano, Sparse Dynamic Programming II: Convex and Concave Cost Functions 1992 39 JACM Greenberg & Madras, How Fair is Fair Queuing? 1992 39 JACM Beaudry & McKenzie & Therien, The Membership Problem in Aperiodic Transformation Monoids 1992 39 JACM Ben-Amram & Galil, On Pointers versus Addresses 1992 39 JACM Gasarch & Smith, Learning via Queries 1992 39 JACM German & Sistla, Reasoning about Systems with Many Processes 1992 39 JACM Raz & Wigderson, Monotone Circuits for Matching Require Linear Depth 1992 39 JACM Dillencourt & Samet & Tamminen, A General Approach to Connected-Component Labeling for Arbitrary Image Representations 1992 39 JACM Katajainen & Raita, An Analysis of the Longest Match and the Greedy Heuristics in Text Encoding 1992 39 JACM Ramesh & Ramakrishnan, Nonlinear Pattern Matching in Trees 1992 39 JACM Sprugnoli, The Generation of Binary Trees as a Numerical Problem 1992 39 JACM Fagin & Halpern & Vardi, What Can Machines Know? On the Properties of Knowledge in Distributed Systems 1992 39 JACM Gallier & Narendran & Raatz & Snyder, Theorem Proving Using Equational Matings and Rigid E-Unification 1992 39 JACM Meyers, A Four Russians Algorithm for Regular Expression Pattern Matching 1992 39 JACM Chazelle & Edelsbrunner, An Optimal Algorithm for Intersecting Line Segments in the Plane 1992 39 JACM Upfal, An O(log N) Deterministic Packet-Routing Scheme 1992 39 JACM Demolombe, Syntactical Characterization of a Subset of Domain-Independent Formulas 1992 39 JACM Goguen & Burstall, Institutions: Abstract Model Theory for Specification and Programming 1992 39 JACM Aceto & Hennessy, Termination, Deadlock, and Divergence 1992 39 JACM Dowdy & Carlson & Krantz & Tripathi, Single-Class Bounds of Multi-Class Queuing Networks 1992 39 JACM Bellare & Micali, How to Sign Given Any Trapdoor Permutation 1992 39 JACM Allender & Hemachandra, Lower Bounds for the Low Hierarchy 1991 38 JACM Stewart & White, Multiobjective A* 1991 38 JACM Gabow & Tarjan, Faster Scaling Algorithms for General Graph-Matching Problems 1991 38 JACM Chan & Hernandez, Independence-Reducible Database Schemes 1991 38 JACM Bloom & Esik, Floyd-Hoare Logic in Iteration Theories 1991 38 JACM Halpern & Shoham, A Propositional Modal Logic of Time Intervals 1991 38 JACM Tiomkin & Kaminski, Nonmonotonic Default Modal Logics 1991 38 JACM Balas & Miller & Pekny & Toth, A Parallel Shortest Augmenting Path Algorithm for the Assignment Problem 1991 38 JACM Glasserman, Structural Conditions for Perturbation Analysis of Queuing Systems 1991 38 JACM Berger & Rompel, Simulating (log^c n)-Wise Independence in NC 1991 38 JACM Atallah & Chen & Wagener, An Optimal Parallel Algorithm for the Visibility of a Simple Polygon from a Point 1991 38 JACM Imielinski, Abstraction in Query Processing 1991 38 JACM Hsiang & Rusinowitch, Proving Refutational Completeness of Theorem-Proving Strategies: The Transfinite Semantic Tree Method 1991 38 JACM Marek & Truszczynski, Autoepistemic Logic 1991 38 JACM Van Gelder & Ross & Schlipf, The Well-Founded Semantics for General Logic Programs 1991 38 JACM Crochemore & Perrin, Two-Way String-Matching 1991 38 JACM Ross & Yao, Optimal Load Balancing and Scheduling in a Distributed Computer System 1991 38 JACM Goldreich & Micali & Wigderson, Proofs that Yield Nothing But Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems 1991 38 JACM Ozveren & Willsky & Antsaklis, Stability and Stabilizability of Discrete Event Dynamic Systems 1991 38 JACM Toran, Complexity Classes Defined by Counting Quantifiers 1991 38 JACM Arkin & Papadimitriou & Yannakakis, Modularity of Cycles and Paths in Graphs 1991 38 JACM Dobkin & Suri, Maintenance of Geometric Extrema 1991 38 JACM Bryant, A Methodology for Hardware Verification Based on Logic Simulation 1991 38 JACM Ioannidis & Wong, Towards an Algebraic Theory of Recursion 1991 38 JACM Fagin & Halpern & Vardi, A Model-Theoretic Analysis of Knowledge 1991 38 JACM Bambos & Walrand, On Stability and Performance of Parallel Processing Systems 1991 38 JACM Mansour & Schieber & Tiwari, A Lower Bound for Integer Greatest Common Divisor Computations 1991 38 JACM Condon, Space-Bounded Probabilistic Game Automata 1991 38 JACM Alon & Dewdney & Ott, Efficient Simulation of Finite Automata by Neural Nets 1991 38 JACM Dyer & Frieze & Kannan, A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies 1991 38 JACM Mitchell & Papadimitriou, The Weighted Region Problem: Finding Shortest Paths Through a Weighted Planar Subdivision 1991 38 JACM Mulmuley, A Fast Planar Partition Algorithm, II 1991 38 JACM Willard, Optimal Sample Cost Residues for Differential Database Batch Query Problems 1991 38 JACM Sagiv, Evaluation of Queries in Independent Database Schemes 1991 38 JACM Frederickson, Planar Graph Decomposition and All Pairs Shortest Paths 1991 38 JACM Chandru & Hooker, Extended Horn Sets in Propositional Logic 1991 38 JACM Kissin, Upper and Lower Bounds on Switching Energy in VLSI 1990 37 JACM Szpankowski, Patricia Tries Again Revisited 1990 37 JACM Briggs, A Correction of the Termination Conditions of the Henschen-Naqvi Technique 1990 37 JACM Bolev & Reischuk & Strong, Early Stopping in Byzantine Agreement 1990 37 JACM Nipkow, Unification in Primal Algebras, Their Powers and Their Varieties 1990 37 JACM Nadathur & Miller, Higher-Order Horn Clauses 1990 37 JACM Cockett & Herrera, Decision Tree Reduction 1990 37 JACM Hochbaum & Shanthikumar, Convex Separable Optimization Is Not Much Harder than Linear Optimization 1990 37 JACM Harrison & Patel, The Representation of Multistage Interconnection Networks in Queuing Models of Parallel Systems 1990 37 JACM Chazelle, Lower Bounds for Orthogonal Range Searching: II. The Arithmetic Model 1990 37 JACM Larmore & Hirschberg, A Fast Algorithm for Optimal Length-Limited Huffman Codes 1990 37 JACM Graham & Wang, On the Equivalence of an Egd to a Set of Fd's 1990 37 JACM Ryu & Thomasian, Analysis of Database Performance with Dynamic Locking 1990 37 JACM Attiya & Bar-Noy & Dolev & Peleg & Reischuk, Renaming in an Asynchronous Environment 1990 37 JACM Halpern & Moses, Knowledge and Common Knowledge in a Distributed Environment 1990 37 JACM Uresin & Dubois, Parallel Asynchronous Algorithms for Discrete Data 1990 37 JACM Orda & Rom, Shortest-Path and Minimum Delay Algorithms in Networks with Time-Dependent Edge-Length 1990 37 JACM Han & Wagner, An Efficient and Fast Parallel-Connected Component Algorithm 1990 37 JACM Pattipati & Kostreva & Teele, Approximate Mean Value Analysis Algorithms for Queueing Networks: Existence, Uniqueness, and Convergence Results 1990 37 JACM Gurevich & Shelah, Nondeterministic Linear-Time Tasks May Require Substantially Nonlinear Deterministic Time in the Case of Sublinear Work Space 1990 37 JACM Davis, Cost-Error Relationships in A* Tree-Searching 1990 37 JACM Chazelle, Lower Bounds for Orthogonal Range Searching: I. The Reporting Case 1990 37 JACM Ahuja & Mehlhorn & Orlin & Tarjan, Faster Algorithms for the Shortest Path Problem 1990 37 JACM Bollobas & Broder & Simon, The Cost Distribution of Clustering in Random Probing 1990 37 JACM Awerbuch & Goldreich & Peleg & Vainish, A Trade-Off between Information and Communication in Broadcast Protocols 1990 37 JACM Herlihy, Concurrency and Availability as Dual Properties of Replicated Atomic Data 1990 37 JACM Abadi & Manna, Nonclausal Deduction in First-Order Temporal Logic 1990 37 JACM Shahrokhi & Matula, The Maximum Concurrent Flow Problem 1990 37 JACM Bergstra & Heering & Klint, Module Algebra 1990 37 JACM Baccelli & Liu, On the Execution of Parallel Programs on Multiprocessor Systems--A Queuing Theory Approach 1990 37 JACM Ko, Separating and Collapsing Results on the Relativized Probabilistic Polynomial-Time Hierarchy 1990 37 JACM Kolaitis & Papadimitriou, Some Computational Aspects of Circumscription 1990 37 JACM Cosmadakis & Kanellakis & Vardi, Polynomial-Time Implication Problems for Unary Inclusion Dependencies 1990 37 JACM Jaffar, Minimal and Complete Word Unification 1990 37 JACM Halpern & Williams & Wimmers, Completeness of Rewrite Rules and Rewrite Strategies for FP 1990 37 JACM Knessl & Tier, Asymptotic Expansions for Large Closed Queueing Networks 1990 37 JACM Mate, Nondeterministic Polynomial-Time Computations and Models of Arithmetic 1989 36 JACM Dean, Using Temporal Hierarchies to Efficiently Maintain Large Temporal Databases 1989 36 JACM Platzman & Bartholdi, Spacefilling Curves and the Planar Travelling Salesman Problem 1989 36 JACM Dowd & Perl & Rudolph & Saks, The Periodic Balanced Sorting Network 1989 36 JACM Abiteboul & Vianu, A Transaction-Based Approach to Relational Database Specification 1989 36 JACM Gyssens & Paredaens & VanGucht, A Uniform Approach toward Handling Atomic and Structured Information in the Nested Relational Database Model 1989 36 JACM van de Snepscheut & Swenker, On the Design of Some Systolic Algorithms 1989 36 JACM Engelfriet & File, Passes, Sweeps, and Visits in Attribute Grammars 1989 36 JACM Kortelainen, The Conjecture of Fliess on Commutative Context-Free Languages 1989 36 JACM Goldberg & Tarjan, Finding Minimum-Cost Circulations by Canceling Negative Cycles 1989 36 JACM Castellani & Hennessy, Distributed Bisimulations 1989 36 JACM Allender, P-Uniform Circuit Complexity 1989 36 JACM Blumer & Ehrenfeucht & Haussler & Warmuth, Learnability and the Vapnik-Chervonenkis Dimension 1989 36 JACM Gabor & Subowit & Hsu, Recognizing Circle Graphs in Polynomial Time 1989 36 JACM Lengauer, Hierarchical Planarity Testing Algorithms 1989 36 JACM Peleg & Upfal, A Trade-Off between Space and Efficiency for Routing Tables 1989 36 JACM Pippenger, Invariance of Complexity Measures for Networks with Unreliable Gates 1989 36 JACM Gabow & Galil & Spencer, Efficient Implementation of Graph Algorithms Using Contraction 1989 36 JACM Kapoor & Reingold, Optimum Lopsided Binary Trees 1989 36 JACM Chor & Merritt & Shmoys, Simple Constant-Time Consensus Protocols in Realistic Failure Models 1989 36 JACM Baccelli & Massey & Towsley, Acyclic Fork-Join Queueing Networks 1989 36 JACM Beame & Hastad, Optimal Bounds for Decision Problems on the CRCW PRAM 1989 36 JACM Li & Yesha, New Lower Bounds for Parallel Computation 1989 36 JACM Hobby, Rasterizing Curves of Constant Width 1989 36 JACM Beeri & Bernstein & Goodman, A Model for Concurrency in Nested Transactions Systems 1989 36 JACM Cunto & Munro, Average Case Selection 1989 36 JACM Klein & Wood, On the Path Length of Binary Trees 1989 36 JACM Manacher & Bui & Mai, Optimum Combinations of Sorting and Merging 1989 36 JACM Rabin, Efficient Dispersal of Information for Security, Load Balancing, and Fault Tolerance 1989 36 JACM Rosenthal & Pino, A Generalized Algorithm for Centrality Problems on Trees 1989 36 JACM Bilardi & Preparata, Size-Time Complexity of Boolean Networks for Prefix Computations 1989 36 JACM Pitt, Probabilistic Inductive Inference 1989 36 JACM Muller & Spinrad, Incremental Modular Decomposition 1989 36 JACM Brzozowski & Seger, A Unified Framework for Race Analysis of Asynchronous Networks 1989 36 JACM McCune & Henschen, Maintaining State Constraints in Relational Databases: A Proof Theoretic Basis 1989 36 JACM Naughton, Minimizing Function-Free Recursive Inference Rules 1989 36 JACM Dill, A Counter-Example for ``A Simpler Construction for Showing the Intrinsically Exponential Complexity of the Circularity Problem for Attribute Grammars'' 1989 36 JACM Helman, A Common Schema for Dynamic Programming and Branch and Bound Algorithms 1989 36 JACM Boyar, Inferring Sequences Produced by Pseudo-Random Number Generators 1989 36 JACM Kaminski, A Note on Probabilistically Verifying Integer and Polynomial Products 1989 36 JACM Kaminski & Bshouty, Multiplicative Complexity of Polynomial Multiplication over Finite Fields 1989 36 JACM de Souza e Silva & Gail, Calculating Availability and Performability Measures of Repairable Computer Systems Using Randomization 1989 36 JACM de Souza e Silva & Lavenberg, Calculating Joint Queue Length Distributions in Product Form Queueing Networks 1988 35 JACM Chvatal & Szemeredi, Many Hard Examples for Resolution 1988 35 JACM Grigoriadis & Kalantari, A New Class of Heuristic Algorithms for Weighted Perfect Matching 1988 35 JACM Cole & Siegel, Optimal VLSI Circuits for Sorting 1988 35 JACM Gonzalez & Lee, A Linear Time Algorithm for Optimal Routing around a Rectangle 1988 35 JACM Panwar & Towsley & Wolf, Optimal Scheduling Policies for a Class of Queues with Customer Deadlines to the Beginning of Service 1988 35 JACM Attiya & Snir & Warmuth, Computing on an Anonymous Ring 1988 35 JACM Karlin & Upfal, Parallel Hashing: An Efficient Implementation of Shared Memory 1988 35 JACM Ramshaw, Eliminating go to's while Preserving Program Structure 1988 35 JACM Goldberg & Tarjan, A New Approach to the Maximum-Flow Problem 1988 35 JACM Barrington & Therien, Finite Monoids and the Fine Structure of NC^1 1988 35 JACM Leivant & Fernando, Meager and Replete Failures of Relative Completeness 1988 35 JACM Pitt & Valiant, Computational Limitations on Learning from Examples 1988 35 JACM Seiferas & Vitanyi, Counting Is Easy 1988 35 JACM Collings & Hembree, Addendum to ``Initializing Generalized Feedback Shift Register Pseudorandom Number Generators 1988 35 JACM Shanker, A Mechanical Proof of the Church-Rosser Theorem 1988 35 JACM Furst & Gross & McGeoch, Finding a Maximum-Genus Graph Imbedding 1988 35 JACM Hsu, The Coloring and Maximum Independent Set Problems on Planar Perfect Graphs 1988 35 JACM Rhee & Talagrand, Some Distributions That Allow Perfect Packing 1988 35 JACM Goodman & Greenberg & Madras & March, Stability of Binary Exponential Backoff 1988 35 JACM Heath & Rosenberg & Smith, The Physical Mapping Problem for Parallel Architectures 1988 35 JACM Kosaraju & Atallah, Optimal Simulations between Mesh-Connected Arrays of Processors 1988 35 JACM Fich & Tompa, The Parallel Complexity of Exponentiating Polynomials over Finite Fields 1988 35 JACM Daduna, Busy Periods for Subnetworks in Stochastic Networks: Mean Value Analysis 1988 35 JACM Rohlicek & Willsky, The Reduction of Perturbed Markov Generators: An Algorithm Exposing the Role of Transient States 1988 35 JACM Chang & Ibarra & Vergis, On the Power of One-Way Communication 1988 35 JACM Fellows & Langston, Nonconstructive Tools for Proving Polynomial-Time Decidability 1988 35 JACM Meyer auf der Heide, Fast Algorithms for N-Dimensional Restrictions of Hard Problems 1988 35 JACM Schoenhage, A Nonlinear Lower Bound for Random-Access Machines under Logarithmic Cost 1988 35 JACM Baltsan & Sharir, On the Shortest Paths between Two Convex Polyhedra 1988 35 JACM Dwork & Lynch & Stockmeyer, Consensus in the Presence of Partial Synchrony 1988 35 JACM McNaughton & Narendran & Otto, Church-Rosser Thue Systems and Formal Languages 1988 35 JACM Ullman & Van Gelder, Efficient Tests for Top-Down Termination of Logical Rules 1988 35 JACM Galil & Tardos, An O(n^2(m + n log n)log n) Min-Cost Flow Algorithm 1988 35 JACM Sasaki & Hajek, The Time Complexity of Maximum Matching by Simulated Annealing 1988 35 JACM Singh Sandhu, The Schematic Protection Model: Its Definition and Analysis for Acyclic Attenuating Schemes 1988 35 JACM Calderbank & Coffman & Flatto, Optimal Directory Placement on Disk Storage Devices 1988 35 JACM Alt, Comparing the Combinational Complexities of Arithmetic Functions 1988 35 JACM Wegener, On the Complexity of Branching Programs and Decision Trees for Clique Functions 1988 35 JACM Walther, Many-Sorted Unification 1988 35 JACM Megiddo & Hakimi & Garey & Johnson & Papadimitriou, The Complexity of Searching a Graph 1988 35 JACM Lee & Shin, Optimal Design and Use of Retry in Fault-Tolerant Computer Systems 1988 35 JACM Abiteboul & Vianu, Equivalence and Optimization of Relational Transactions 1988 35 JACM Hadzilacos, A Theory of Reliability in Database Systems 1988 35 JACM Klug, On Conjunctive Queries Containing Inequalities 1988 35 JACM Gonnet & Larson, External Hashing with Limited Internal Storage 1988 35 JACM Hickey & Cohen, Automating Program Analysis 1988 35 JACM Tripathi & Woodside, A Vertex-Allocation Theorem for Resources in Queuing Networks 1988 35 JACM Kaltofen, Greatest Common Divisors of Polynomials Given by Straight-Line Programs 1987 34 JACM Inselberg & Chomut & Reif, Complexity Algorithms in Parallel Coordinates 1987 34 JACM Mitra & Cieslak, Randomized Parallel Communications on an Extension of the Omega Network 1987 34 JACM Vitter, Design and Analysis of Dynamic Huffman Codes 1987 34 JACM Willard, Multidimensional Search Trees That Provide New Types of Memory Reductions 1987 34 JACM Bloch & Daniels & Spector, A Weighted Voting Algorithm for Replicated Directories 1987 34 JACM Bracha, An O(log n) Expected Rounds Randomized Byzantine Generals Protocol 1987 34 JACM Tiwari, Lower Bounds on Communication Complexity in Distributed Computer Networks 1987 34 JACM Tezuka, On the Discrepancy of GFSR Pseudorandom Numbers 1987 34 JACM Johnson, Parallel Algorithms for Minimum Cuts and Maximum Flows in Planar Networks 1987 34 JACM Kaminski, A Linear Time Algorithm for Residue Computation and a Fast Algorithm for Division with a Sparse Divisor 1987 34 JACM McKenna, Asymptotic Expansions of the Sojourn Time Distribution Functions of Jobs in Closed, Product-Form Queuing Networks 1987 34 JACM Ajtai & Gurevich, Monotone versus Positive 1987 34 JACM Sagiv & Delobel & Parker & Fagin, Correction to ``An Equivalence between Relational Database Dependencies and a Fragment of Propositional Logic'' 1987 34 JACM Galil & Hoffmann & Luks & Schnorr & Weber, An O(n^3 log n) Deterministic and an O(n^3) Las Vegas Isomorphism Test for Trivalent Graphs 1987 34 JACM Irving & Leather & Gusfield, An Efficient Algorithm for the ``Optimal'' Stable Marriage 1987 34 JACM Beeri & Kifer, A Theory of Intersection Anomalies in Relational Database Schemes 1987 34 JACM Blumer & Blumer & Haussler & McConnell & Ehrenfeucht, Complete Inverted Files for Efficient Text Retrieval and Analysis 1987 34 JACM Fredman & Tarjan, Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms 1987 34 JACM Hirschberg & Larmore, New Applications of Failure Functions 1987 34 JACM Srikanth & Toueg, Optimal Clock Synchronization 1987 34 JACM Cabay & Domzy, Systems of Linear Equations with Dense Univariate Polynomial Coefficients 1987 34 JACM Nelson, Stochastic Catastrophe Theory in Computer Performance Modeling 1987 34 JACM Suri, Infinitesimal Perturbation Analysis for General Discrete Event Systems 1987 34 JACM Book & Du, The Existence and Density of Generalized Complexity Cores 1987 34 JACM Oyamaguchi, The Equivalence Problem for Real-Time DPDAs 1987 34 JACM Murray & Rosenthal, Inference with Path Resolution and Semantic Graphs 1987 34 JACM Hsu, Recognizing Planar Perfect Graphs 1987 34 JACM Greenberg & Flajolet & Ladner, Estimating the Multiplicities of Conflicts to Speed Their Resolution in Multiple Access Channels 1987 34 JACM Lee & Shin, Optimal Reconfiguration Strategy for a Degradable Multimodule Computing System 1987 34 JACM Chan & Mendelzon, Answering Queries on Embedded-Complete Database Schemes 1987 34 JACM Papachristou, Associative Table Lookup Processing for Multioperand Residue Arithmetic 1987 34 JACM Pflug & Kessler, Linear Probing with a Nonuniform Address Distribution 1987 34 JACM Degano & Montanari, A Model for Distributed Systems Based on Graph Rewriting 1987 34 JACM Peleg, Concurrent Dynamic Logic 1987 34 JACM Homer, Minimal Degrees for Polynomial Reducibilities 1987 34 JACM Venkataraman, Decidability of the Purely Existential Fragment of the Theory of Term Algebras 1987 34 JACM Chazelle & Dobkin, Intersection of Convex Objects in Two and Three Dimensions 1987 34 JACM Vianu, Dynamic Functional Dependencies and Database Aging 1987 34 JACM Reif & Valiant, Logarithmic Time Sort for Linear Size Networks 1987 34 JACM Dolev & Dwork & Stockmeyer, On the Minimal Synchronism Needed for Distributed Consensus 1987 34 JACM Frederickson & Lynch, Electing a Leader in a Synchronous Ring 1987 34 JACM Upfal & Wigderson, How to Share Memory in a Distributed System 1987 34 JACM Toyama, On the Church-Rosser Property for the Direct Sum of Term Rewriting Systems 1987 34 JACM Hochbaum & Shmoys, Using Dual Approximation Algorithms for Scheduling Problems: Theoretical and Practical Results 1987 34 JACM Reischuk, Simultaneous WRITES of Parallel Random Access Machines Do Not Help to Compute Simple Arithmetic Functions 1987 34 JACM Donatiello & Iyer, Analysis of a Composite Performance Reliability Measure for Fault-Tolerant Systems 1987 34 JACM Cole, Slowing Down Sorting Networks to Obtain Faster Sorting Algorithms 1987 34 JACM Urquhart, Hard Examples for Resolution 1986 33 JACM de Champeaux, Subproblem Finder and Instance Checker, Two Cooperating Modules for Theorem Provers 1986 33 JACM Grimson, The Combinatorics of Local Constraints in Model-Based Recognition and Localization from Sparse Data 1986 33 JACM Ramachandran, On Driving Many Long Wires in a VLSI Layout 1986 33 JACM Chaudhuri & Rao, Approximating Grammar Probabilities: Solution of a Conjecture 1986 33 JACM Collings & Hembree, Initializing Generalized Feedback Shift Register Pseudorandom Number Generators 1986 33 JACM Cosnard & Robert, Complexity of Parallel QR Factorization 1986 33 JACM Apt & Plotkin, Countable Nondeterminism and Random Assignment 1986 33 JACM Conway & Georganas, RECAL--A New Efficient Algorithm for the Exact Analysis of Multiple-Chain Queuing Networks 1986 33 JACM Goldreich & Goldwasser & Micali, How to Construct Random Functions 1986 33 JACM Kannan & Lipton, Polynomial-Time Algorithm for the Orbit Problem 1986 33 JACM Rowland & Cowles, Small Sample Algorithms for the Identification of Polynomials 1986 33 JACM Abiteboul & Ginsburg, Tuple Sequences and Lexicographic Indexes 1986 33 JACM Asano & Asano & Imai, Partitioning a Polygonal Region into Trapezoids 1986 33 JACM Balcazar & Book & Schoening, The Polynomial-Time Hierarchy and Sparse Oracles 1986 33 JACM Beeri & Kifer, Elimination of Intersection Anomalies from Database Schemes 1986 33 JACM Chin, Security Problems on Inference Controls for SUM, MAX, and MIN Queries 1986 33 JACM Chor & Leiserson & Rivest & Shearer, An Application of Number Theory to the Organization of Raster-Graphics Memory 1986 33 JACM Coleman & Edenbrandt & Gilbert, Predicting Fill for Sparse Orthogonal Factorization 1986 33 JACM Devroye, A Note on the Height of Binary Search Trees 1986 33 JACM Digricoli & Harrison, Equality-Based Resolution 1986 33 JACM Dolev & Lynch & Pinter & Stark & Weihl, Reaching Approximate Agreement in the Presence of Faults 1986 33 JACM Eager & Sevcik, Bound Hierarchies for Multiple-Class Queuing Networks 1986 33 JACM Emerson & Halpern, ``Sometimes'' and ``Not Never'' Revisited: On Branching versus Linear Time Temporal Logic 1986 33 JACM Flajolet & Puech, Partial Match Retrieval of Multidimensional Data 1986 33 JACM Ginsburg & Hull, Sort Sets in the Relational Model 1986 33 JACM Graham & Mendelzon & Vardi, Notions of Dependency Satisfaction 1986 33 JACM Harel, Effective Transformations on Infinite Trees, with Applications to High Undecidability, Dominoes, and Fairness 1986 33 JACM Hochbaum & Shmoys, A Unified Approach to Approximation Algorithms for Bottleneck Problems 1986 33 JACM Lamport, The Mutual Exclusion Problem: Part I--A Theory of Interprocess Communication 1986 33 JACM Lamport, The Mutual Exclusion Problem: Part II--Statement and Solutions 1986 33 JACM Long & Selman, Relativizing Complexity Classes with Sparse Oracles 1986 33 JACM Lubachevsky & Mitra, A Chaotic Asynchronous Algorithm for Computing the Fixed Point of a Nonnegative Matrix of Unit Spectral Radius 1986 33 JACM Manna & Waldinger, Special Relations in Automated Deduction 1986 33 JACM Mehlhorn & Preparata, Routing through a Rectangle 1986 33 JACM Mitra & McKenna, Asymptotic Expansions for Closed Markovian Networks with State-Dependent Service Rates 1986 33 JACM Reiter, A Sound and Sometimes Complete Query Evaluation Algorithm for Relational Databases with Null Values 1986 33 JACM Singh, Improved Methods for Storing and Updating Information in the Out-of-Kilter Algorithm 1986 33 JACM Tsitsiklis & Papadimitriou & Humblet, The Performance of a Precedence-Based Queuing Discipline 1986 33 JACM van de Liefvoort & Lipsky, A Matrix-Algebraic Solution to Two K_m Servers in a Loop 1985 32 JACM Abiteboul, Disaggregations in Databases 1985 32 JACM Adler & Meggido, A Simplex Algorithm Whose Average Number of Steps Is Bounded between Two Quadratic Functions of the Smaller Dimension 1985 32 JACM Awerbuch, Complexity of Network Synchronization 1985 32 JACM Bagchi & Mahanti, Three Approaches to Heuristic Search in Networks 1985 32 JACM Baker & Coffman & Willard, Algorithms for Resolving Conflicts in Dynamic Storage Allocation 1985 32 JACM Bauer, Soundness and Completeness of a Synthesis Algorithm Based on Example Computations 1985 32 JACM Bender & Butler, Enumeration of Structured Flowcharts 1985 32 JACM Bracha & Toueg, Asynchronous Consensus and Broadcast Protocols 1985 32 JACM Buckley & Silbershatz, Beyond Two-Phase Locking 1985 32 JACM Cao & Stewart, Iterative Aggregation/Disaggregation Techniques for Nearly Uncoupled Markov Chains 1985 32 JACM Chazelle & Monier, A Model of Computation for VLSI with Related Complexity Results 1985 32 JACM Cornuejols & Naddef & Pulleyblank, The Traveling Salesman Problem in Graphs with 3-Edge Cutsets 1985 32 JACM Cunningham, Optimal Attack and Reinforcement of a Network 1985 32 JACM Dechter & Pearl, Generalized Best First Search Strategies and the Optimality of A* 1985 32 JACM Dolev & Reischuk, Bounds on Information Exchange for Byzantine Agreement 1985 32 JACM Even & Selman & Yacobi, Hard-Core Theorems for Complexity Classes 1985 32 JACM Faigle, On Ordered Languages and the Optimization of Linear Functions by Greedy Algorithms 1985 32 JACM Fischer & Lynch & Paterson, Impossibility of Distributed Consensus with One Faulty Process 1985 32 JACM Freuder, A Sufficient Condition for Backtrack-Bounded Search 1985 32 JACM Fuchs & Kafura, Memory-Constrained Task Scheduling on a Network of Dual Processors 1985 32 JACM Garcia-Molina & Barbara, How to Assign Votes in a Distributed System 1985 32 JACM Gonzalez-Smith & Storer, Parallel Algorithms for Data Compression 1985 32 JACM Gottlob & Leitsch, On the Efficiency of Subsumption Algorithms 1985 32 JACM Greenberg & Winograd, A Lower Bound on the Time Needed in the Worst Case to Resolve Conflicts Deterministically in Multiple Access Channels 1985 32 JACM Gurari, Decidable Problems for Powerful Programs 1985 32 JACM Hennessy & Milner, Algebraic Laws for Nondeterminism and Concurrency 1985 32 JACM Hennessy, Acceptance Trees 1985 32 JACM Hochbaum & Maass, Approximation Schemes for Covering and Packing Problems in Image Processing and VLSI 1985 32 JACM Karp & Wigderson, A Fast Parallel Algorithm for the Maximal Independent Set Problem 1985 32 JACM Klawe, A Tight Bound for Black and White Pebbles on the Pyramid 1985 32 JACM Lagarias & Odlyzko, Solving Low-Density Subset Sum Problems 1985 32 JACM Lamport & Melliar-Smith, Synchronizing Clocks in the Presence of Faults 1985 32 JACM Lee & Lee, A Simple On-Line Packing Algorithm 1985 32 JACM Mahanti & Bagchi, AND/OR Graph Heuristic Search Methods 1985 32 JACM Manber & Tompa, The Complexity of Problems on Probabilistic, Nondeterministic, and Alternating Decision Trees 1985 32 JACM Meyer auf der Heide, Lower Bounds for Solving Linear Diophantine Equations on Random Access Machines 1985 32 JACM Moran & Snir & Manber, Applications of Ramsey's Theorem to Decision Tree Complexity 1985 32 JACM Papadimitriou, Correction to ``A Theorem in Database Concurrency Control'' 1985 32 JACM Sacca, Closures of Database Hypergraphs 1985 32 JACM Sistla & Clarke, The Complexity of Propositional Linear Temporal Logics 1985 32 JACM Skyum & Valiant, A Complexity Theory Based on Boolean Algebra 1985 32 JACM Sleator & Tarjan, Self-Adjusting Binary Search Trees 1985 32 JACM Staples & Nguyen, A Fixpoint Semantics for Nondeterministic Data Flow 1985 32 JACM Tantawi & Towsley, Optimal Static Load Balancing in Distributed Computer Systems 1985 32 JACM Tay & Suri & Goodman, A Mean Value Performance Model for Locking in Databases: The No-Waiting Case 1985 32 JACM Vantilborgh, Aggregation with an Error of O(epsilon^2) 1985 32 JACM Wang & Lloyd & Soffa, Feedback Vertex Sets and Cyclically Reducible Graphs 1985 32 JACM Willard & Lueker, Adding Range Restriction Capability to Dynamic Data Structures 1985 32 JACM Yannakakis, A Polynomial Algorithm for the Min-Cut Linear Arrangement of Trees 1985 32 JACM Yao, Uniform Hashing Is Optimal 1985 32 JACM Zerling, Generating Binary Trees Using Rotations 1984 31 JACM Adachi & Iwata, Some Combinatorial Game Problems Require Omega(n^k) Time 1984 31 JACM Atallah & Kosaraju, Graph Problems on a Mesh-Connected Processor Array 1984 31 JACM Baccelli & Gelenbe & Plateau, An End-to-End Approach to the Resequencing Problem 1984 31 JACM Beeri & Dowd & Fagin & Statman, On the Structure of Armstrong Relations for Functional Dependencies 1984 31 JACM Beeri & Vardi, A Proof Procedure for Data Dependencies 1984 31 JACM Bloniarz & Hunt & Rosenkrantz, Algebraic Structures with Hard Equivalence and Minimization Problems 1984 31 JACM Bojancyzk, Optimal Asynchronous Newton Method for the Solution of Nonlinear Equations 1984 31 JACM Boxma & Kelly & Konheim, The Product Form for Sojourn Time Distributions in Cyclic Exponential Queues 1984 31 JACM Boyer & Moore, A Mechanical Proof of the Unsolvability of the Halting Problem 1984 31 JACM Brookes & Hoare & Roscoe, A Theory of Communicating Sequential Processes 1984 31 JACM Calderbank & Coffman & Flatto, Optimum Head Separation in Disk System with Two Read/Write Heads 1984 31 JACM Clenshaw & Olver, Beyond Floating Point 1984 31 JACM Cosmadakis & Papadimitriou, Updates of Relational Views 1984 31 JACM Courtois & Semal, Bounds for the Positive Eigenvectors of Nonnegative Matrices and for Their Approximations by Decomposition 1984 31 JACM Culik & Harju, The omega-Sequence Equivalence Problem for D0L Systems Is Decidable 1984 31 JACM Datta & Ghosh, Synthesis of a Class of Deadlock-Free Petri Nets 1984 31 JACM Eades & Hickey & Read, Some Hamilton Paths and a Minimal Change Algorithm 1984 31 JACM Feit, A Fast Algorithm for the Two-Variable Integer Programming Problem 1984 31 JACM Fredman & Komlos & Szemeredi, Storing a Sparse Table with O(1) Worst Case Access Time 1984 31 JACM Gottlieb & Kruskal, Complexity Results for Permuting Data and Other Computations on Parallel Processors 1984 31 JACM Greene & El Gamal, Configuration of VLSI Arrays in the Presence of Defects 1984 31 JACM Gurevich & Stockmeyer & Vishkin, Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems 1984 31 JACM Henshen & Naqvi, On Compiling Queries in Recursive First-Order Databases 1984 31 JACM Hofri, Analysis of Interleaved Storage via a Constant-Service Queuing System with Markov-Chain-Driven Input 1984 31 JACM Hoover & Klawe & Pippenger, Bounding Fan-Out in Logical Networks 1984 31 JACM Hull & Yap, The Format Model: A Theory of Database Organization 1984 31 JACM Hull, Finitely Specifiable Implicational Dependency Families 1984 31 JACM Hunt, Terminating Turing Machine Computations and the Complexity and/or Decidability of Correspondence Problems, Grammars, and Program Schemes 1984 31 JACM Imielinski & Lipski, Incomplete Information in Relational Databases 1984 31 JACM Ja'Ja' & Kumar, Information Transfer in Distributed Computing with Applications to VLSI 1984 31 JACM Ja'Ja', The VLSI Complexity of Selected Graph Problems 1984 31 JACM Lazar, Optimal Flow Control of an M/M/m Queue 1984 31 JACM McKenna & Mitra, Asymptotic Expansions and Integral Representations of Moments of Queue Lengths in Closed Markovian Networks 1984 31 JACM McLean, A Formal Method for the Abstract Specification of Software 1984 31 JACM Meggido, Linear Programming in Linear Time When the Dimension Is Fixed 1984 31 JACM Melamed & Yadin, Numerical Computation of Sojourn-Time Distributions in Queuing Networks 1984 31 JACM Meyer auf der Heide, A Polynomial Linear Search Algorithm for the n-Dimensional Knapsack Problem 1984 31 JACM Mitra & Weinberger, Probabilistic Models of Database Locking: Solutions, Computational Algorithms, and Asymptotics 1984 31 JACM Pachl & Korach & Rotem, Lower Bounds for Distributed Maximum-Finding Algorithms 1984 31 JACM Papadimitriou, On the Complexity of Unique Solutions 1984 31 JACM Reif, Symmetric Complementation 1984 31 JACM Rock, The Three-Machine No-Wait Flow Shop Is NP-Complete 1984 31 JACM Savage, Space-Time Trade-Offs for Banded Matrix Problems 1984 31 JACM Shostak, Deciding Combinations of Theories 1984 31 JACM Simon, Priority Queues with Feedback 1984 31 JACM Smith, Random Trees and the Analysis of Branch and Bound Procedures 1984 31 JACM Tarjan & van Leeuwen, Worst-Case Analysis of Set Union Algorithms 1984 31 JACM Traub & Wozniakowski, On the Optimal Solution of Large Linear Systems 1984 31 JACM Trojan, Lower Bounds and Fast Algorithms for Sequence Acceleration 1984 31 JACM Upfal, Efficient Schemes for Parallel Communication 1984 31 JACM Williamson, Depth-First Search and Duratowski Subgraphs 1984 31 JACM Yannakakis, Serializability by Locking 1983 30 JACM Apt, Formal Justification of a Proof System for Communicating Sequential Processes 1983 30 JACM Arjomandi & Fischer & Lynch, Efficiency of Synchronous Versus Asynchronous Distributed Systems 1983 30 JACM Ausiello & D'Atri & Sacca, Graph Algorithms for Functional Dependency Manipulation 1983 30 JACM Bagchi & Mahanti, Search Algorithms Under Different Kinds of Heuristics--A Comparative Study 1983 30 JACM Beeri & Fagin & Maier & Yannakakis, On the Desirability of Acyclic Database Schemes 1983 30 JACM Brand & Zafiropulo, On Communicating Finite-State Machines 1983 30 JACM Chandy & Martin, A Characterization of Product-Form Queuing Networks 1983 30 JACM Clarke & German & Halpern, Effective Axiomatizations of Hoare Logics 1983 30 JACM Coffman & Sethi, Instruction Sets for Evaluating Arithmetic Expressions 1983 30 JACM De Chanpeaux, Bidirectional Heuristic Search Again 1983 30 JACM Fagin, Degrees of Acyclicity for Hypergraphs and Relational Database Schemes 1983 30 JACM Forth, Locking Primitives in a Database System 1983 30 JACM Fortune & Leivant & O'Donnell, The Expressiveness of Simple Second-Order Type Structures 1983 30 JACM Frederickson, Implicit Data Structures for the Dictionary Problem 1983 30 JACM Galil & Paul, An Efficient General-Purpose Parallel Computer 1983 30 JACM Gati, The Complexity of Solving Polynomial Equations by Quadrature 1983 30 JACM Gavish, Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem 1983 30 JACM Goodman & Shmueli, Syntactic Characterization of Tree Database Schemas 1983 30 JACM Gusfield, Parametric Combinatorial Computing and a Problem of Program Module Distribution 1983 30 JACM Hajek, The Proof of a Folk Theorem on Queuing Delay with Applications to Routing in Networks 1983 30 JACM Hong & Mehlhorn & Rosenberg, Cost Trade-Offs in Graph Embedding with Applications 1983 30 JACM Ibaraki & Abdel-Wahab & Kameda, Design of Minimum-Cost Deadlock-Free Systems 1983 30 JACM Ibarra & Leininger, On the Simplification and Equivalence Problems for Straight-Line Programs 1983 30 JACM Ibarra & Moran, Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs 1983 30 JACM Ja'Ja', Time-Space Trade-offs for Some Algebraic Problems 1983 30 JACM Jaffe, Decentralized Simulation of Resource Managers 1983 30 JACM Kannan, Polynomial-Time Aggregation of Integer Programming Problems 1983 30 JACM Kedem & Silberschatz, Locking Protocols: From Exclusive to Shared Locks 1983 30 JACM Klug, Locking Expressions for Increased Database Concurrency 1983 30 JACM Krevner & Yehudai, An Iteration Theorem for Simple Precedence Languages 1983 30 JACM Lamport, The Weak Byzantine Generals Problem 1983 30 JACM Larson, Analysis of Uniform Hashing 1983 30 JACM Lord & Kowalik & Kumar, Solving Linear Algebraic Equations on an MIMD Computer 1983 30 JACM Matula & Beck, Smallest-Last Ordering and Clustering and Graph Coloring Algorithms 1983 30 JACM Maurer & Salomaa & Wood, A Supernormal-Form Theorem for Context-Free Grammars 1983 30 JACM Megiddo, Applying Parallel Computation Algorithms in the Design of Serial Algorithms 1983 30 JACM Nau, Decision Quality As a Function of Search Depth on Game Trees 1983 30 JACM Nourani, Abstract Implementations and Their Correctness Proofs 1983 30 JACM Raoult & Sethi, Properties of a Notation for Combining Functions 1983 30 JACM Rosenberg, Three-Dimensional VLSI: A Case Study 1983 30 JACM Sarwate, A Note on ``A Note on Multiple Error Detection in ASCII Numberic Data Communication'' 1983 30 JACM Schassberger & Daduna, The Time for a Round Trip in a Cycle of Exponential Queues 1983 30 JACM Sippu & Soisalon-Soininen & Ukkonen, The Complexity of LALR(k) Testing 1983 30 JACM Stewart, Computable Error Bounds for Aggregated Markov Chains 1983 30 JACM Strong, Vector Execution of Flow Graphs 1983 30 JACM Supowit, The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees 1983 30 JACM Suri, Robustness of Queuing Network Formulas 1983 30 JACM Tarsi, Optimal Search on Some Game Trees 1983 30 JACM Vitter, Analysis of the Search Performance of Coalesced Hashing 1983 30 JACM Wigderson, Improving the Performance Guarantee for Approximate Graph Coloring 1983 30 JACM Xu Mei-Rui & Doner & Book, Refining Nondeterminism in Relativizations of Complexity Classes 1982 29 JACM Angluin, Inference of Reversible Languages 1982 29 JACM Apt & van Emden, Contributions to the Theory of Logic Programming 1982 29 JACM Arbib & Manes, The Pattern-of-Calls Expansion Is the Canonical Fixpoint for Recursive Definitions 1982 29 JACM Bader & Moura, A Generalization of Ogden's Lemma 1982 29 JACM Beatty, On the Relationship Between the LL(1) and LR(1) Grammars 1982 29 JACM Becker & Schach & Perl, A Shifting Algorithm for Min-Max Tree Partitioning 1982 29 JACM Book, Confluent and Other Types of Thue Systems 1982 29 JACM Brent & Kung, Corrigendum: The Area-Time Complexity of Binary Multiplication 1982 29 JACM Brown, Determination of the Conditional Response for Quantum Allocation Algorithms 1982 29 JACM Bryant, Maximum Processing Rates of Memory Bound Systems 1982 29 JACM Burns & Jackson & Lynch & Fischer & Peterson, Data Requirements for Implementation of N-Process Mutual Exclusion Using a Single Shared Variable 1982 29 JACM Chow & Yu, On the Construction of Feedback Queries 1982 29 JACM Cohen & Hickey & Katcoff, Upper Bounds for Speedup in Parallel Parsing 1982 29 JACM Ehrich, On the Theory of Specification, Implementation, and Parametrization of Abstract Data Types 1982 29 JACM Ernst & Goldstein, Mechanical Discovery of Classes of Problem-Solving Strategies 1982 29 JACM Fagin, Horn Clauses and Database Dependencies 1982 29 JACM Floyd & Ullman, The Compilation of Regular Expressions into Integrated Circuits 1982 29 JACM Fredman, The Complexity of Maintaining an Array and Computing Its Partial Sums 1982 29 JACM Freuder, A Sufficient Condition for Backtrack-Free Search 1982 29 JACM Gabow, An Almost-Linear Algorithm for Two-Processor Scheduling 1982 29 JACM Galil, An Almost Linear-Time Algorithm for Computing a Dependency Basis in a Relational Database 1982 29 JACM Ginsburg & Zaiddan, Properties of Functional-Dependency Families 1982 29 JACM Goldschlager, A Universal Interconnection Pattern for Parallel Computers 1982 29 JACM Grant & Jacobs, On the Family of Generalized Dependency Constraints 1982 29 JACM Gurari & Ibarra, Two-Way Counter Machines and Diophantine Equations 1982 29 JACM Hoffmann & O'Donnell, Pattern Matching in Trees 1982 29 JACM Honeyman, Testing Satisfaction of Functional Dependencies 1982 29 JACM Hunt, On the Complexity of Flowchart and Loop Program Schemes and Programming Languages 1982 29 JACM Hunt, On the Decidability of Grammar Problems 1982 29 JACM Jacobs, On Database Logic 1982 29 JACM Jerrum & Snir, Some Exact Complexity Results for Straight-Line Computations over Semirings 1982 29 JACM Kameda, A Finite-Source Queue with Different Customers 1982 29 JACM Klug, Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions 1982 29 JACM Lam, Dynamic Scaling and Growth Behavior of Queuing Network Normalization Constants 1982 29 JACM Lengauer & Tarjan, Asymptotically Tight Bounds on Time-Space Trade-offs in a Pebble Game 1982 29 JACM Lien, On the Equivalence of Database Models 1982 29 JACM Lloyd, Critical Path Scheduling with Resource and Processor Constraints 1982 29 JACM Martel, Preemptive Scheduling with Release Times, Deadlines, and Due Times 1982 29 JACM Matula, Basic Digit Sets for Radix Representation 1982 29 JACM Maurer & Salomaa & Wood, Dense Hierarchies of Grammatical Families 1982 29 JACM McDermott, Nonmonotonic Logic II: Nonmonotonic Modal Theories 1982 29 JACM Meyer & Halpern, Axiomatic Definitions of Programming Languages: A Theoretical Assessment 1982 29 JACM Minoura, Deadlock Avoidance Revisited 1982 29 JACM Nassimi & Sahni, Parallel Permutation and Sorting Algorithms and a New Generalized Connection Network 1982 29 JACM Papadimitriou & Yannakakis, The Complexity of Restricted Spanning Tree Problems 1982 29 JACM Papadimitriou, A Theorem in Database Concurrency Control 1982 29 JACM Rackoff, Relativized Questions Involving Probabilistic Algorithms 1982 29 JACM Ruschitzka, The Performance of Job Classes with Distinct Policy Functions 1982 29 JACM Sadri & Ullman, Template Dependencies: A Large Class of Dependencies in Relational Databases and Its Complete Axiomatization 1982 29 JACM Sagiv & Walecka, Subset Dependencies and a Completeness Result for a Subclass of Embedded Multivalued Dependencies 1982 29 JACM Samelson & Bulgren, A Note on Product-Form Solution for Queuing Networks with Poisson Arrivals and General Service-Time Distributions with Finite Means 1982 29 JACM Sciore, A Complete Axiomatization of Full Join Dependencies 1982 29 JACM Sethi, Useless Actions Make a Difference: Strict Serializability of Database Updates 1982 29 JACM Smith, The Power of Pluralism for Automatic Program Systhesis 1982 29 JACM Stark, Semaphore Primitives and Starvation-Free Mutual Exclusion 1982 29 JACM Storer & Szymanski, Data Compression via Textual Substitution 1982 29 JACM Takamizawa & Nishizeki & Saito, Linear-Time Computability of Combinatorial Problems in Series-Parallel Graphs 1982 29 JACM Tobagi, Distributions of Packet Delay and Interdeparture Time in Slotted ALOHA and Carrier Sense Multiple Access 1982 29 JACM Tzelnic & Gertner, An Approach to Program Behavior Modeling and Optimal Memory Control 1982 29 JACM Ukkonen, The Equivalence Problem for Some Non-Real-Time Deterministic Pushdown Automata 1982 29 JACM Winker, Generation and Verification of Finite Models and Counterexamples Using an Automated Theorem Prover Answering Two Open Questions 1982 29 JACM Yannakakis, A Theory of Safe Locking Policies in Database Systems 1982 29 JACM Yao, On Parallel Computation for the Knapsack Problem 1982 29 JACM Yu & Lam & Salton, Term Weighting in Information Retrieval Using the Term Precision Model 1981 28 JACM Achugbue & Chin, Bounds on Schedules for Independent Tasks with Similar Execution Times 1981 28 JACM Andrews, Theorem Proving via General Matings 1981 28 JACM Bernstein & Chiu, Using Semi-Joins to Solve Relational Queries 1981 28 JACM Bibel, On Matrices with Connections 1981 28 JACM Brent & Kung, The Area-Time Complexity of Binary Multiplication 1981 28 JACM Bruno & Downey & Frederickson, Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan 1981 28 JACM Chandra & Kozen & Stockmeyer, Alternation 1981 28 JACM Chin & Tsai, On J-maximal and J-minimal Flowshop Schedules 1981 28 JACM Chu, A Note on Multiple Error Detection in ASCII Numeric Data Communication 1981 28 JACM Davis & Jaffe, Algorithms for Scheduling Tasks on Unrelated Processors 1981 28 JACM Dobkin & Munro, Optimal Time Minimal Space Selection Algorithms 1981 28 JACM Ehrenfeucht & Rozenberg & Ruohonen, A Morphic Representation of Complements of Recursively Enumerable Sets 1981 28 JACM Even & Shiloach, An On-Line Edge-Deletion Problem 1981 28 JACM Feldman & Adkins & Curry & Pooch, Measurement Bias in Feedback Queues 1981 28 JACM Fredman, A Lower Bound on the Complexity of Orthogonal Range Queries 1981 28 JACM Galil, String Matching in Real Time 1981 28 JACM Gnesi & Montanari & Martelli, Dynamic Programming As Graph Searching: An Algebraic Approach 1981 28 JACM Gonnet, Expected Length of the Longest Probe Sequence in Hash Code Searching 1981 28 JACM Gurari & Ibarra, The Complexity of the Equivalence Problem for Simple Programs 1981 28 JACM Hogger, Derivation of Logic Programs 1981 28 JACM Jazayeri, A Simpler Construction for Showing the Intrinsically Exponential Complexity of the Circularity Problem for Attribute Grammars 1981 28 JACM Karr, Summation in Finite Terms 1981 28 JACM Katoh & Ibaraki & Mine, An Algorithm for K Best Solutions of the Resource Allocation Problem 1981 28 JACM Kirkpatrick, A Unified Lower Bound for Selection and Set Partitioning Problems 1981 28 JACM Kleinrock & Nilsson, On Optimal Scheduling Algorithms for Time-Shared Systems 1981 28 JACM Kumar & Breuer, Probabilistic Aspects of Boolean Switching Functions via a New Transform 1981 28 JACM Latouche, Algorithmic Analysis of a Multiprogramming-Multiprocessor Computer System 1981 28 JACM Leong & Seiferas, New Real-Time Simulations of Multihead Tape Units 1981 28 JACM Lieberherr & Specker, Complexity of Partial Satisfaction 1981 28 JACM Lipski, On Databases with Incomplete Information 1981 28 JACM Loveland & Reddy, Deleting Repeated Goals in the Problem Reduction Format 1981 28 JACM Maier & Sagiv & Yannakakis, On the Complexity of Testing Implications of Functional and Join Dependencies 1981 28 JACM Mateti, A Decision Procedure for the Correctness of a Class of Programs 1981 28 JACM Mayr & Meyer, The Complexity of the Finite Containment Problem for Petri Nets 1981 28 JACM Papadimitriou, On the Complexity of Integer Programming 1981 28 JACM Perl & Schach, Max-Min Tree Partitioning 1981 28 JACM Peterson & Stickel, Complete Sets of Reductions for Some Equational Theories 1981 28 JACM Reiser & Lavenberg, Corrigendum: Mean-Value Analysis of Closed Multichain Queuing Networks 1981 28 JACM Rem, The Closure Statement: A Programming Language Construct Allowing Ultraconcurrent Execution 1981 28 JACM Rodeh & Pratt & Even, Linear Algorithm for Data Compression via String Matching 1981 28 JACM Rowland & Davis, On the Use of Transcendentals for Program Testing 1981 28 JACM Sagiv & Delobel & Parker & Fagin, An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic 1981 28 JACM Samet, Connected Component Labeling Using Quadtrees 1981 28 JACM Sevcik & Mitrani, The Distribution of Queuing Network States at Input and Output Instants 1981 28 JACM Shostak, Deciding Linear Inequalities by Computing Loop Residues 1981 28 JACM Stickel, A Unification Algorithm for Associative-Commutative Functions 1981 28 JACM Tarjan, A Unified Approach to Path Problems 1981 28 JACM Tarjan, Fast Algorithms for Solving Path Problems 1981 28 JACM Trivedi & Sigmon, Optimal Design of Linear Storage Hierarchies 1981 28 JACM Wasilkowski, n-Evaluation Conjecture for Multipoint Iterations for the Solution of Scalar Nonlinear Equations 1981 28 JACM Yao, A Lower Bound to Finding Convex Hulls 1981 28 JACM Yao, Should Tables be Sorted? 1980 27 JACM Abelson, Lower Bounds on Information Transfer in Distributed Computation 1980 27 JACM Abramson & Breitbart & Lewis, Complex Properties of Grammars 1980 27 JACM Altenkamp & Mehlhorn, Codes: Unequal Probabilities, Unequal Letter Costs 1980 27 JACM Aronson & Jacobs & Minker, A Note on Fuzzy Deduction 1980 27 JACM Bender, The Number of Fanout-Free Functions with Various Gates 1980 27 JACM DeMillo & Eisenstat & Lipton, Space-Time Trade-Offs in Structured Programming: An Improved Combinatorial Embedding Theorem 1980 27 JACM Downey & Sethi & Tarjan, Variations on the Common Subexpression Problem 1980 27 JACM Ehrenfeucht & Rozenberg, The Sequence Equivalence Problem Is Decidable for 0S Systems 1980 27 JACM Engelfriet & Meineche Schmidt & van Leeuwen, Stack Machines and Classes of Nonnested Macro Languages 1980 27 JACM Engelfriet & Rozenberg, Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages 1980 27 JACM Fayolle & Mitrani & Iasnogorodski, Sharing a Processor Among Many Job Classes 1980 27 JACM Fisher & Hochbaum, Database Location in Computer Networks 1980 27 JACM Gonzalez & Johnson, A New Algorithm for Preemptive Scheduling of Trees 1980 27 JACM Graham & Yao & Yao, Information Bounds are Weak in the Shortest Distance Problem 1980 27 JACM Greibach & Friedman, Superdeterministic PDSs: A Subclass with a Decidable Inclusion Problem 1980 27 JACM Henderson & Zalcstein, Synchronization Problems Solvable by Generalized PV Systems 1980 27 JACM Huet, Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems 1980 27 JACM Ja'Ja', Computation of Bilinear Forms over Finite Fields 1980 27 JACM Kameda, Testing Deadlock-Freedom of Computer Systems 1980 27 JACM Kannan, A Polynomial Algorithm for the Two-Variable Integer Programming Problem 1980 27 JACM Kaplan & Ullman, A Scheme for the Automatic Inference of Variable Types 1980 27 JACM Krishnaswamy & Pyster, On the Correctness of Semantic-Syntax-Directed Translations 1980 27 JACM Ladner & Fischer, Parallel Prefix Computation 1980 27 JACM Lee, Two-Dimensional Voronoi Diagrams in the L_p-Metric 1980 27 JACM Lichtenstein & Sipser, GO is Polynomial-Space Hard 1980 27 JACM Lipton & Rosenberg & Yao, External Hashing Schemes for Collections of Data Structures 1980 27 JACM Maier, Minimum Covers in the Relational Database Model 1980 27 JACM Mendelson & Yechiali, A New Approach to the Analysis of Linear Probing Schemes 1980 27 JACM Nassimi & Sahni, An Optimal Routing Algorithm for Mesh-Connected Parallel Computers 1980 27 JACM Nelson & Oppen, Fast Decision Procedures Based on Congruence Closure 1980 27 JACM Oppen, Reasoning About Recursively Defined Data Structures 1980 27 JACM Papadimitriou & Kanellakis, Flowshop Scheduling with Limited Temporary Storage 1980 27 JACM Parchmann, Corrigendum on ``Control System Model for Critically Timed Sources'' 1980 27 JACM Pawlikowski, Message Waiting Time in a Packet Switching System 1980 27 JACM Pease & Shostak & Lamport, Reaching Agreements in the Presence of Faults 1980 27 JACM Prabhala & Sethi, Efficient Computation of Expressions with Common Subexpressions 1980 27 JACM Proskurowski, On the Generation of Binary Trees 1980 27 JACM Ramakrishnan, Solving Two-Commodity Transportation Problems with Coupling Constraints 1980 27 JACM Raoult & Vuillemin, Operational and Semantic Equivalence Between Recursive Programs 1980 27 JACM Reischuk, Improved Bounds on the Problem of Time-Space Trade-Off in the Pebble Game 1980 27 JACM Reiser & Lavenberg, Mean Value Analysis of Closed Multichain Queuing Networks 1980 27 JACM Reiter, Equality and Domain Closure for First-Order Databases 1980 27 JACM Sagiv & Yannakakis, Equivalences Among Relational Expressions with the Union and Difference Operators 1980 27 JACM Sagiv, An Algorithm for Inferring Multivalued Dependencies with an Application to Propositional Logic 1980 27 JACM Sahni & Cho, Scheduling Independent Tasks with Due Times on a Uniform Processor System 1980 27 JACM Schwartz, Fast Probabilistic Algorithms for Verification of Polynomial Identities 1980 27 JACM Sethi & Tang, Constructing Call-by-Value Continuation Semantics 1980 27 JACM Shiloach, A Polynomial Solution in the Undirected Two Paths Problem 1980 27 JACM Silberschatz & Kedem, Consistency in Hierarchical Database Systems 1980 27 JACM Solomon & Finkel, A Note on Enumerating Binary Trees 1980 27 JACM Suzuki & Jefferson, Verification Decidability of Pressburger Array Programs 1980 27 JACM Swartz, Polling in a Loop System 1980 27 JACM Towsley, Queuing Network Models with State-Dependent Routing 1980 27 JACM Trivedi & Wagner & Sigmon, Optimal Selection of CPU Speed, Device Capacities, and File Assignments 1980 27 JACM Tsukiyama & Ariyoshi & Shirakawa & Ozaki, An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset 1980 27 JACM Wand, Continuation-Based Program Transformation Strategies 1980 27 JACM Ward & Halstead, A Syntactic Theory of Message Passing 1980 27 JACM Wasilkowski, Can Any Stationary Iteration Using Linear Information be Globally Convergent? 1980 27 JACM We-Min Chow, The Cycle Time Distribution of Exponential Cyclic Queues 1980 27 JACM Yao, New Algorithms for Bin Packing 1979 26 JACM Baker & Kosaraju, A Comparison of Multilevel break and next Statements 1979 26 JACM Beery & Levy, Minimal and Optimal Computations of Recursive Programs 1979 26 JACM Beyer & Jones & Mitchell, Linear Algorithms for Isomorphism of Maximal Outerplanar Graphs 1979 26 JACM Bhat & Nance, An Evaluation of CPU Efficiency Under Dynamic Quantum Allocation 1979 26 JACM Bolour, Optimality Properties of Multiple-Key Hashing Functions 1979 26 JACM Brown & Tarjan, A Fast Merging Algorithm 1979 26 JACM Bui, Some A-Stable and L-Stable Methods for the Numerical Integration of Stiff Ordinary Differential Equations 1979 26 JACM Bustoz & Feldstein & Goodman & Linnainmaa, Improved Trailing Digits Estimates Applied to Optimal Computer Arithmetic 1979 26 JACM Butcher, A Transformed Implicit Runge-Kutta Method 1979 26 JACM Cherniavsky & Kamin, A Complete and Consistent Hoare Axiomatics for a Simple Programming Language 1979 26 JACM Clarke, Programming Language Constructs for Which It Is Impossible to Obtain Good Hoare Axiom Systems 1979 26 JACM Cohen & Hickey, Two Algorithms for Determining Volumes of Convex Polyhedra 1979 26 JACM Culik, A Purely Homomorphic Characterization of Recursively Enumerable Sets 1979 26 JACM Fishman & Moore, Estimating the Mean of a Correlated Binary Sequence with an Application to Discrete Event Simulation 1979 26 JACM Frederickson, Approximation Algorithms for Some Postman Problems 1979 26 JACM Fussenegger & Gabow, A Counting Approach to Lower Bounds for Selection Problems 1979 26 JACM Galil & Megiddo, A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort 1979 26 JACM Gelenbe, On the Optimum Checkpoint Interval 1979 26 JACM Gross & Rosen, A Linear Time Planarity Algorithm for 2-Complexes 1979 26 JACM Gupta, Bounds on Storage for Consecutive Retrieval 1979 26 JACM Gurari & Ibarra, An NP-Complete Number-Theoretic Problem 1979 26 JACM Henschen, Theorem Proving by Covering Expressions 1979 26 JACM Hwang, An O(n log n) Algorithm for Rectilinear Minimal Spanning Tree 1979 26 JACM Iglehart & Lewis, Regenerative Simulation with Internal Controls 1979 26 JACM Johnson & Miller & Minnihan & Wrathall, Reducibility Among Floating-Point Graphs 1979 26 JACM Kacewicz, Integrals with a Kernel in the Solution of Nonlinear Equations in N Dimensions 1979 26 JACM Kedem, Combining Dimensionality and Rate of Growth Arguments for Establishing Lower Bounds on the Number of Multiplications and Divisions 1979 26 JACM Kowaltowski, Data Structures and Correctness of Programs 1979 26 JACM Lee & Preparata, An Optimal Algorithm for Finding the Kernel of a Polygon 1979 26 JACM Lemme & Rice, Speedup in Parallel Algorithms for Adaptive Quadrature 1979 26 JACM Logrippo, Renamings, Maximal Parallelism, and Space-Time Tradeoff in Program Schemata 1979 26 JACM Lueker & Booth, A Linear Time Algorithm for Deciding Interval Graph Isomorphism 1979 26 JACM Manacher, Significant Improvements to the Hwang-Lin Merging Algorithm 1979 26 JACM Manacher, The Ford-Johnson Sorting Algorithm Is Not Optimal 1979 26 JACM Mendelson & Yechiali, Performance Measures for Ordered Lists in Random-Access Files 1979 26 JACM Mendelzon, On Axiomatizing Multivalued Dependencies in Relational Databases 1979 26 JACM Milne & Milner, Concurrent Processes and Their Syntax 1979 26 JACM Milner, Flowgraphs and Flow Algebras 1979 26 JACM Noetzel, A Generalized Queueing Discipline for Product Form Network Solutions 1979 26 JACM Papadimitriou, Optimality of the Fast Fourier Transform 1979 26 JACM Papadimitriou, The Serializability of Concurrent Database Updates 1979 26 JACM Parchmann, Control System Model for Critically Timed Sources 1979 26 JACM Pippenger & Fischer, Relations Among Complexity Measures 1979 26 JACM Reiss, Security in Databases; A Combinatorial Study 1979 26 JACM Rodrigue & Madsen & Karush, Odd-Even Reductions for Banded Linear Equations 1979 26 JACM Rosen, Data Flow Analysis for Procedural Languages 1979 26 JACM Rosenberg, Encoding Data Structures in Trees 1979 26 JACM Savitch & Stimson, Time Bounded Random Access Machines with Parallel Processing 1979 26 JACM Shostak, A Practical Decision Procedure for Arithmetic with Function Symbols 1979 26 JACM Skeel, Scaling for Numerical Stability in Gaussian Elimination 1979 26 JACM Smith, Characterizing the Storage Process and Its Effect on the Update of Main Memory by Write Through 1979 26 JACM Strong & Markowsky & Chandra, Search Within a Page 1979 26 JACM Tai, The Tree-to-Tree Correction Problem 1979 26 JACM Tarjan, Applications of Path Compression on Balanced Trees 1979 26 JACM Traub & Wozniakowski, Convergence and Complexity of Newton Iteration for Operator Equations 1979 26 JACM Werschulz, Maximal Order and Order of Information for Numerical Quadrature 1979 26 JACM Yannakakis, The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems 1978 25 JACM Allen & Munro, Self-Organizing Search Trees 1978 25 JACM Arvillias & Maritsas, Partitioning the Period of a Class of m-Sequences and Application to Pseudorandom Number Generation 1978 25 JACM Attar & Choueka & Dershowitz & Fraenkel, KEDMA--Linguistic Tools for Retrieval Systems 1978 25 JACM Baudet, Asynchronous Iterative Methods for Multiprocessors 1978 25 JACM Bentley & Kung & Schkolnick & Thompson, On the Average Number of Maxima in a Set of Vectors and Applications 1978 25 JACM Book, Simple Representations of Certain Classes of Languages 1978 25 JACM Brand, Path Calculus in Program Verification 1978 25 JACM Brent & Kung, Fast Algorithms for Manipulating Formal Power Series 1978 25 JACM Butler, Analysis and Design of Fanout-Free Networks of Positive Symmetric Gates 1978 25 JACM Cooper & Maron, Foundations of Probabilistic and Utility-Theoretic Indexing 1978 25 JACM Crespi-Reghizzi & Guida & Mandrioli, Noncounting Context-Free Languages 1978 25 JACM Downey & Sethi, Assignment Commands with Array References 1978 25 JACM Galil & Seiferas, A Linear-Time On-Line Recognition Algorithm for ``Palstar'' 1978 25 JACM Garey & Johnson, ``Strong'' NP-Completeness Results: Motivation, Examples, and Implications 1978 25 JACM Garfinkel & Gilbert, The Bottleneck Traveling Salesman Problem: Algorithms and Probabilistic Analysis 1978 25 JACM Gentleman, Some Complexity Results for Matrix Computations on Parallel Processors 1978 25 JACM Gonzalez & Sahni, Preemptive Scheduling of Uniform Processor Systems 1978 25 JACM Guibas, The Analysis of Hashing Techniques that Exhibit k-ary Clustering 1978 25 JACM Harrison & Rubin, Another Generalization of Resolution 1978 25 JACM Hoare, Some Properties of Predicate Transformers 1978 25 JACM Horvath, Stable Sorting in Asymptotically Optimal Time and Extra Space 1978 25 JACM Hunt & Szymanski, Corrigendum: Lower Bounds and Reductions Between Grammar Problems 1978 25 JACM Hunt & Szymanski, Lower Bounds and Reductions Between Grammar Problems 1978 25 JACM Ibarra, Reversal-Bounded Multicounter Machines and Their Decision Problems 1978 25 JACM Iglehart & Shedler, Regenerative Simulation of Response Times in Networks of Queues 1978 25 JACM Itai & Rodeh & Tanimoto, Some Matching Problems for Bipartite Graphs 1978 25 JACM Itai, Two-Commodity Flow 1978 25 JACM Johnson & Kashdan, Lower Bounds for Selection in X + Y and Other Multisets 1978 25 JACM Jones & Muchnick, The Complexity of Finite Memory Programs with Recursion 1978 25 JACM Kafura & Shen, An Algorithm to Design the Memory Configuration of a Computer Network 1978 25 JACM Kung & Traub, All Algebraic Functions Can Be Computed Fast 1978 25 JACM Landweber & Robertson, Properties of Conflict-Free and Persistent Petri Nets 1978 25 JACM Lawler & Labetoulle, On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming 1978 25 JACM Lewis, Renaming a Set of Clauses as a Horn Set 1978 25 JACM Logrippo, Renamings and Economy of Memory in Program Schemata 1978 25 JACM Maier, The Complexity of Some Problems on Subsequences and Supersequences 1978 25 JACM McKellar & Wong, Dynamic Placement of Records in Linear Storage 1978 25 JACM McKie, An Example of a Skewing Function 1978 25 JACM Mulvey, Pivot Strategies for Primal-Simplex Network Codes 1978 25 JACM Musser, On the Efficiency of a Polynomial Irreducibility Test 1978 25 JACM Omahen & Marathe, Analysis and Applications of the Delay Cycle for the M/M/c Queueing System 1978 25 JACM Perl & Shiloach, Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph 1978 25 JACM Pippenger, A Time-Space Trade-Off 1978 25 JACM Rao, Performance Analysis of Cache Memories 1978 25 JACM Rivest, Optimal Arrangement of Keys in a Hash Table 1978 25 JACM Rotem & Varol, Generation of Binary Trees from Ballot Sequences 1978 25 JACM Sameh & Kuck, On Stable Parallel Linear System Solvers 1978 25 JACM Schnorr, Satisfiability is Quasilinear Complete in NQL 1978 25 JACM Seiferas & Fischer & Meyer, Separating Nondeterministic Time Complexity Classes 1978 25 JACM Sethi, Conditional Expressions with Equality Tests 1978 25 JACM Sudborough, On the Tape Complexity of Deterministic Context-Free Languages 1978 25 JACM Vantilborgh, Exact Aggregation in Exponential Queueing Networks 1978 25 JACM Wand, A New Incompleteness Result for Hoare's System 1978 25 JACM Wilf, A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane 1978 25 JACM Yao & Rivest, k + 1 Heads Are Better than k 1978 25 JACM Yu & Salton & Siu, Effective Automatic Indexing Using Term Addition and Deletion 1978 25 JACM Zoltners, A Direct Descent Binary Knapsack Algorithm 1977 24 JACM Aho & Johnson & Ullman, Code Generation for Expressions with Common Subexpressions 1977 24 JACM Attar & Fraenkel, Local Feedback in Full-Text Retrieval Systems 1977 24 JACM Baker, An Algorithm for Structuring Flowgraphs 1977 24 JACM Ballantyne & Bledsoe, Automatic Proofs of Theorems in Analysis Using Nonstandard Techniques 1977 24 JACM Blake & Konheim, Big Buckets Are (Are Not) Better! 1977 24 JACM Boesch & Gimpel, Covering the Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization 1977 24 JACM Bookstein & Kraft, Operations Research Applied to Document Indexing and Retrieval Decisions 1977 24 JACM Brandwajn, A Queueing Model of Multiprogrammed Computer Systems Under Full Load Conditions 1977 24 JACM Bui, Errata and Comments on a Paper by J. R. Cash 1977 24 JACM Burstall & Darlington, A Transformation System for Developing Recursive Programs 1977 24 JACM Chandy & Howard & Towsley, Product From and Local Balance in Queueing Networks 1977 24 JACM Comer & Sethi, The Complexity of Trie Index Construction 1977 24 JACM Das, A Machine Representation of Finite T_0 Topologies 1977 24 JACM Davis, Proof, Completeness, Transcendentals, and Sampling 1977 24 JACM de Champeaux & Sint, An Improved Bidirectional Heuristic Search Algorithm 1977 24 JACM DeMillo & Vairavan & Sycara-Cyranski, A Study of Schedules as Models of Synchronous Parallel Computation 1977 24 JACM Fayolle & Gelenbe & Labetoulle, Stability and Optimal Control of the Packet Switching Broadcast Channel 1977 24 JACM Fiduccia & Zalcstein, Algebras Having Linear Multiplicative Complexities 1977 24 JACM Goguen & Thatcher & Wagner & Wright, Initial Algebra Semantics and Continuous Algebras 1977 24 JACM Hehner, Information Content of Programs and Operation Encoding 1977 24 JACM Hirschberg, Algorithms for the Longest Common Subsequence Problem 1977 24 JACM Hofri, On Certain Output-Buffer Management Techniques--A Stochastic Model 1977 24 JACM Hopcroft & Paul & Valiant, On Time Versus Space 1977 24 JACM Horvath & Lam & Sethi, A Level Algorithm for Preemptive Scheduling 1977 24 JACM Hunt & Rosenkrantz, On Equivalence and Containment Problems for Formal Languages 1977 24 JACM Hwang & Yao, Optimal Batched Searching of Tree Structured Files in Multiprocessor Computer Systems 1977 24 JACM Hyafil & Kung, The Complexity of Parallel Evaluation of Linear Recurrences 1977 24 JACM Ibaraki, The Power of Dominance Relations in Branch-and-Bound Algorithms 1977 24 JACM Ibarra & Kim, Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors 1977 24 JACM Johnson, Efficient Algorithms for Shortest Paths in Sparse Networks 1977 24 JACM Jones & Muchnick, Even Simple Programs Are Hard to Analyze 1977 24 JACM Kinariwala & Rao, Flow Switching Approach to the Maximum Flow Problem: I 1977 24 JACM Kou, On Live-Dead Analysis for Global Data Flow Problems 1977 24 JACM Krause & Shen & Schwetman, Erratum 1977 24 JACM Lin & Rardin, Development of a Parametric Generating Procedure for Integer Programming Test Problems 1977 24 JACM Lipton & Snyder, A Linear Time Algorithm for Deciding Subject Security 1977 24 JACM Lipton & Zalcstein, Word Problems Solvable in Logspace 1977 24 JACM Loveman, Program Improvement by Source-to-Source Transformation 1977 24 JACM Lynch, Log Space Recognition and Translation of Parenthesis Languages 1977 24 JACM Maekawa, Queueing Models for Computer Systems Connected by a Communication Line 1977 24 JACM Omahen, Capacity Bounds for Multiresource Queues 1977 24 JACM Reynolds, Semantics of the Domain of Flow Diagrams 1977 24 JACM Rosenberg & Stockmeyer, Hashing Schemes for Extendible Arrays 1977 24 JACM Sahasrabudhe & Kulkarni, On Solving Fredholm Integral Equations of the First Kind 1977 24 JACM Shostak, On the SUP-INF Method for Proving Presburger Formulas 1977 24 JACM Summers, A Methodology for LISP Program Construction from Examples 1977 24 JACM Wegbreit, Complexity of Synthesizing Inductive Assertions 1977 24 JACM Wilhelm, A General Model for the Performance of Disk Systems 1977 24 JACM Young, Optimization Among Provably Equivalent Programs 1977 24 JACM Yu & Luk, Analysis of Effectiveness of Retrieval in Clustered Files 1976 23 JACM Aho & Hirschberg & Ullman, Bounds on the Complexity of the Longest Common Subsequence Problem 1976 23 JACM Aho & Johnson, Optimal Code Generation for Expression Trees 1976 23 JACM Brent, Fast Multiple-Precision Evaluation of Elementary Functions 1976 23 JACM Bruno & Sethi, Code Generation for a One-Register Machine 1976 23 JACM Bruno, Sequencing Jobs with Stochastic Task Structures on a Single Machine 1976 23 JACM Burge, An Analysis of Binary Search Trees Formed from Sequences of Nondistinct Keys 1976 23 JACM Cash, Semi-Implicit Runge-Kutta Procedures with Error Estimates for the Numerical Integration of Stiff Systems of Ordinary Differential Equations 1976 23 JACM Chang & Korsh, Canonical Coin Changing and Greedy Solutions 1976 23 JACM Cody & Coffman, Errata 1976 23 JACM Cody & Coffman, Record Allocation for Minimizing Expected Retrieval Costs on Drum-Like Storage Devices 1976 23 JACM Crump, Numerical Inversion of Laplace Transforms Using a Fourier Series Approximation 1976 23 JACM Deo, Note on Hopcroft and Tarjan's Planarity Algorithm 1976 23 JACM Eisner & Severance, Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases 1976 23 JACM Even & Tarjan, A Combinatorial Problem Which is Complete in Polynomial Space 1976 23 JACM Fagin & Easton, The Independence of Miss Ratio on Page Size 1976 23 JACM Feldstein & Goodman, Convergence Estimates for the Distribution of Trailing Digits 1976 23 JACM Fraser, Array Permutation by Index-Digit Permutation 1976 23 JACM Gabow, An Efficient Implementation of Edmonds' Algorithm for Maximum Matching in Graphs 1976 23 JACM Garey & Johnson, Scheduling Tasks with Nonuniform Deadlines on Two Processors 1976 23 JACM Garey & Johnson, The Complexity of Near-Optimal Graph Coloring 1976 23 JACM Ginsburg & Lynch, Size Complexity in Context-Free Grammar Forms 1976 23 JACM Gonzalez & Sahni, Open Shop Scheduling to Minimize Finish Time 1976 23 JACM Graham & Wegman, A Fast and Usually Linear Algorithm for Global Flow Analysis 1976 23 JACM Harris, A Code for the Transportation Problem of Linear Programming 1976 23 JACM Hayes, Enumeration of Fanout-Free Boolean Functions 1976 23 JACM Heller & Stevenson & Traub, Accelerated Iterative Methods for the Solution of Tridiagonal Systems on Parallel Computers 1976 23 JACM Hirschberg & Wong, A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables 1976 23 JACM Hoffmann & Landweber, A Completeness Theorem for Straight-Line Programs with Structured Variables 1976 23 JACM Horowitz & Pavlidis, Picture Segmentation by a Tree Traversal Algorithm 1976 23 JACM Horowitz & Sahni, Exact and Approximate Algorithms for Scheduling Nonidentical Processors 1976 23 JACM Iglehart, Simulating Stable Stochastic Systems, VI: Quantile Estimation 1976 23 JACM Joyner, Resolution Strategies as Decision Procedures 1976 23 JACM Kam & Ullman, Global Data Flow Analysis and Iterative Algorithms 1976 23 JACM Konheim & Reiser, A Queueing Model with Finite Waiting Room and Blocking 1976 23 JACM Kung, New Algorithms and Lower Bounds for the Parallel Evaluation of Certain Rational Expressions and Recurrences 1976 23 JACM Larson, Efficiency of Computation of Cayley Tables of 2-Groups 1976 23 JACM Lipton & Eisenstat & DeMillo, Space and Time Hierarchies for Classes of Control Structures and Data Structures 1976 23 JACM Martelli, A Gaussian Elimination Algorithm for the Enumeration of Cut Sets in a Graph 1976 23 JACM McCreight, A Space-Economical Suffix Tree Construction Algorithm 1976 23 JACM Mickunas & Lancaster & Schneider, Transforming LR(k) Grammars to LR(1), SLR(1), and (1,1) Bounded Right-Context Grammars 1976 23 JACM Mickunas, On the Complete Covering Problem for LR(k) Grammars 1976 23 JACM Muller & Preparata, Restructuring of Arithmetic Expressions for Parallel Evaluation 1976 23 JACM Pagano, On the Linear Convergence of a Covariance Factorization Algorithm 1976 23 JACM Papadimitriou, On the Complexity of Edge Traversing 1976 23 JACM Peterson, Theorem Proving with Lemmas 1976 23 JACM Phuong, Solution of Integer Programs with a Quadratic Objective Function 1976 23 JACM Pippenger & Valiant, Shifting Graphs and Their Applications 1976 23 JACM Potier & Gelenbe & Lenfant, Adaptive Allocation of Central Processing Unit Quanta 1976 23 JACM Price, A Note on the Effect of the Central Processor Service Time Distribution on Processor Utilization in Multiprogrammed Computer Systems 1976 23 JACM Rider, A Simple Approximation to the Average Queue Size in the Time-Dependent M/M/1 Queue 1976 23 JACM Rosberg & Adiri, Multilevel Queues with External Priorities 1976 23 JACM Sahni & Gonzalez, P-Complete Approximation Problems 1976 23 JACM Sahni, Algorithms for Scheduling Independent Tasks 1976 23 JACM Schmidt & Druffel, A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance Matrices 1976 23 JACM Slater, R-Domination in Graphs 1976 23 JACM Srinivasan, Linear Programming Computational Procedures for Ordinal Regression 1976 23 JACM Ullmann, An Algorithm for Subgraph Isomorphism 1976 23 JACM van Emden & Kowalski, The Semantics of Predicate Logic as a Programming Language 1976 23 JACM Wagner, A Shortest Path Algorithm for Edge-Sparse Graphs 1976 23 JACM Wegbreit & Spitzen, Proving Properties of Complex Data Structures 1976 23 JACM Wegbreit, Verifying Program Performance 1976 23 JACM Wong & Chandra, Bounds for the String Editing Problem 1976 23 JACM Yakimovsky, Boundary and Object Detection in Real World Images 1976 23 JACM Yao & Yao, Lower Bounds on Merging Networks 1976 23 JACM Yu & Luk & Cheung, A Statistical Model for Relevance Feedback in Information Retrieval 1976 23 JACM Yu & Salton, Precision Weighting--An Effective Automatic Indexing Method 1975 22 JACM Babad, A Generalized Multi-Entrance Time-Sharing Priority Queue 1975 22 JACM Baskett & Chandy & Muntz & Palacios, Open, Closed, and Mixed Networks of Queues with Different Classes of Customers 1975 22 JACM Bertsch, An Observation on Relative Parsing Time 1975 22 JACM Boyer & Moore, Proving Theorems About LISP Functions 1975 22 JACM Bruno & Lassagne, The Generation of Optimal Code for Stack Machines 1975 22 JACM Cash, A Class of Implicit Runge-Kutta Methods for the Numerical Integration of Stiff Ordinary Differential Equations 1975 22 JACM Chaitin, A Theory of Program Size Formally Identical to Information Theory 1975 22 JACM Dass, A Sufficient Bound for Codes Correcting Bursts with Weight Constraint 1975 22 JACM Dressler & Parker, Primes with a Prime Subscript 1975 22 JACM Easton & Wong, The Effect of a Capacity Constraint on the Minimal Cost of a Partition 1975 22 JACM Elias & Flower, The Complexity of Some Simple Retrieval Problems 1975 22 JACM Fuller & Baskett, An Analysis of Drum Storage Units 1975 22 JACM Gelenbe, On Approximate Computer System Models 1975 22 JACM Goodman & Hedetniemi & Slater, Advances on the Hamiltonian Completion Problem 1975 22 JACM Gotlieb & Macewen, Errata [Vol. 20, No. 4] 1975 22 JACM Hayes, The Fanout Structure of Switching Functions 1975 22 JACM Hofri & Yadin, A Processor in Series with Demand-Interrupting Devices--A Stochastic Model 1975 22 JACM Horowitz & Sahni, On Computing the Exact Determinant of Matrices with Polynomial Entries 1975 22 JACM Horowitz, A Sorting Algorithm for Polynomial Multiplication 1975 22 JACM Hsu, An Algorithm for Finding a Minimal Equivalent Graph of a Digraph 1975 22 JACM Ibarra & Kim, Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems 1975 22 JACM Jump & Thiagarajan, On the Interconnection of Asynchronous Control Structures 1975 22 JACM Knauer, A Simple Planarity Criterion 1975 22 JACM Kohler & Steiglitz, Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop Problem n/2/F/F-bar 1975 22 JACM Kowalski, A Proof Procedure Using Connection Graphs 1975 22 JACM Krause & Shen & Schwetman, Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems 1975 22 JACM Kung & Luccio & Preparata, On Finding the Maxima of a Set of Vectors 1975 22 JACM Ladner, On the Structure of Polynomial Time Reducibility 1975 22 JACM Lowrance & Wagner, An Extension of the String-to-String Correction Problem 1975 22 JACM Lynch, On Reducibility to Complex or Sparse Sets 1975 22 JACM Manacher, A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String 1975 22 JACM Micchelli & Miranker, High Order Search Methods for Finding Roots 1975 22 JACM Miller, Computer Search for Numerical Instability 1975 22 JACM Morgenstern, The Linear Complexity of Computation 1975 22 JACM Muller & Preparata, Bounds to Complexities of Networks for Sorting and for Switching 1975 22 JACM Musser, Multivariate Polynomial Factorization 1975 22 JACM Oney, Queueing Analysis of the Scan Policy for Moving-Head Disks 1975 22 JACM Perl & Garey & Even, Efficient Generation of Optimal Prefix Code: Equiprobable Words Using Unequal Cost Letters 1975 22 JACM Pfaltz, Representing Graphs by Knuth Trees 1975 22 JACM Rice, A Metalgorithm for Adaptive Quadrature 1975 22 JACM Rosenberg, Corrigendum [Vol. 21, No. 4] 1975 22 JACM Ross & Klingman & Napier, A Computational Study of the Effects of Problem Dimensions on Solution Times for Transportation Problems 1975 22 JACM Sahni, Approximate Algorithms for the 0/1 Knapsack Problem 1975 22 JACM Schank & Goldman & Rieger & Riesbeck, Inference and Paraphrase by Computer 1975 22 JACM Sethi, Errata [Vol. 21, No. 4] 1975 22 JACM Sudborough, A Note on Tape-Bounded Complexity Classes and Linear Context-Free Languages 1975 22 JACM Svoboda, The Concept of Term Exclusiveness and Its Effect on the Theory of Boolean Functions 1975 22 JACM Tarjan, Efficiency of a Good But Not Linear Set Union Algorithm 1975 22 JACM Valiant, Regularity and Related Problems for Deterministic Pushdown Automata 1975 22 JACM Winograd, On the Parallel Evaluation of Certain Arithmetic Expressions 1975 22 JACM Wright, The Change-Making Problem 1975 22 JACM Yelowitz, Derivation of a Path-Connectivity Matrix for Tagged Flowcharts 1975 22 JACM Yu, A Formal Construction of Term Classes 1974 21 JACM Balkovich & Chiu & Presser & Wood, Comments on a Paper by Gaver 1974 21 JACM Batni & Russell & Kime, An Efficient Algorithm for Finding an Irredundant Set Cover 1974 21 JACM Bellmore & Hong, Transformation of Multisalesmen Problem to the Standard Traveling Salesman Problem 1974 21 JACM Berman & Colijn, A Modified List Technique Allowing Binary Search 1974 21 JACM Blevins & Stewart, Calculating the Eigenvectors of Diagonally Dominant Matrices 1974 21 JACM Brent, The Parallel Evaluation of General Arithmetic Expressions 1974 21 JACM Chaitin, Information-Theoretic Limitations of Formal Systems 1974 21 JACM Chien & Mark, A Document Storage Method Based on Polarized Distance 1974 21 JACM Cotten & Abd-Alla, Processing Times for Segmented Jobs with I/O Compute Overlap 1974 21 JACM Crane & Iglehart, Simulating Stable Stochastic Systems II: Markov Chains 1974 21 JACM Crane & Iglehart, Simulating Stable Stochastic Systems I: General Multiserver Queues 1974 21 JACM Dunham, Efficiency of Chebyshev Approximation on Finite Subsets 1974 21 JACM Earnest, Some Topics in Code Optimization 1974 21 JACM Elias, Efficient Storage and Retrieval by Content and Address of Static Files 1974 21 JACM Fenner & Loizou, Some New Bounds on the Condition Numbers of Optimally Scaled Matrices 1974 21 JACM Fleisig & Loveland & Smiley & Yarmush, An Implementation of the Model Elimination Proof Procedure 1974 21 JACM Franaszek & Wagner, Some Distribution-Free Aspects of Paging Algorithm Performance 1974 21 JACM Gabrielian & Ginsburg, Grammar Schemata 1974 21 JACM Gill & Blum, On Almost Everywhere Complex Recursive Functions 1974 21 JACM Gordon & Riesenfeld, Bernstein-Bezier Methods for the Computer-Aided Design of Free-Form Curves and Surfaces 1974 21 JACM Haralick, The Diclique Representation and Decomposition of Binary Relations 1974 21 JACM Harrison & Havel, On the Parsing of Deterministic Languages 1974 21 JACM Hecht & Ullman, Characterizations of Reducible Flow Graphs 1974 21 JACM Henschen & Wos, Unit Refutations and Horn Sets 1974 21 JACM Herr, On a Statistical Model of Strand and Westwater for the Numerical Solution of a Fredholm Integral Equation of the First Kind 1974 21 JACM Hibbard, Context-Limited Grammars 1974 21 JACM Hopcroft & Tarjan, Efficient Planarity Testing 1974 21 JACM Horowitz & Sahni, Computing Partitions with Applications to the Knapsack Problem 1974 21 JACM Hueckel, Erratum [Vol. 20, No. 4] 1974 21 JACM Ingargiola & Korsh, Finding Optimal Demand Paging Algorithms 1974 21 JACM Katz & Konheim, Priority Disciplines in a Loop System 1974 21 JACM Kobayashi, Application of the Diffusion Approximation to Queueing Networks I: Equilibrium Queue Distributions 1974 21 JACM Kobayashi, Application of the Diffusion Approximation to Queueing Networks II: Nonequilibrium Distributions and Applications to Computer Modeling 1974 21 JACM Kohler & Steiglitz, Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems 1974 21 JACM Konheim & Meister, Waiting Lines and Times in a System with Polling 1974 21 JACM Kritzinger & Graham, A Theorem in the Theory of Compromise Merge Methods 1974 21 JACM Kung & Traub, Optimal Order of One-Point and Multipoint Iteration 1974 21 JACM Lehot, An Optimal Algorithm To Detect a Line Graph and Output Its Root Graph 1974 21 JACM Michel & Coffman, Synthesis of a Feedback Queueing Discipline for Computer Operation 1974 21 JACM Michie & Sibert, Some Binary Derivation Systems 1974 21 JACM Mitra, Some Aspects of Hierarchical Memory Systems 1974 21 JACM Nevins, A Human Oriented Logic for Automatic Theorem-Proving 1974 21 JACM Overbeek, A New Class of Automated Theorem-Proving Algorithms 1974 21 JACM Pager, Further Results on the Problem of Finding Minimal Length Programs for Decision Tables 1974 21 JACM Palmer & Rahimi & Robinson, Efficiency of a Binary Comparison Storage Technique 1974 21 JACM Plemmons, Linear Least Squares by Elimination and MGS 1974 21 JACM Richman, Computing a Subinterval of the Image 1974 21 JACM Robson, Bounds for Some Functions Concerning Dynamic Storage Allocation 1974 21 JACM Rosenberg, Allocating Storage for Extendible Arrays 1974 21 JACM Rubin, A Search Procedure for Hamilton Paths and Circuits 1974 21 JACM Schubert, Iterated Limiting Recursion and the Program Minimization Problem 1974 21 JACM Sethi, Testing for the Church-Rosser Property 1974 21 JACM Sevcik, Scheduling for Minimum Total Loss Using Service Time Distributions 1974 21 JACM Shaw & Traub, On the Number of Multiplications for the Evaluation of a Polynomial and Some of Its Derivatives 1974 21 JACM Slagle, Automated Theorem-Proving for Theories with Simplifiers, Commutativity, and Associativity 1974 21 JACM Trotter & Shetty, An Algorithm for the Bounded Variable Integer Programming Problem 1974 21 JACM Tsao, Some A Posteriori Error Bounds in Floating-Point Computations 1974 21 JACM Wagner & Fischer, The String-to-String Correction Problem 1974 21 JACM Wang, An Algorithm for the Chromatic Number of a Graph 1974 21 JACM Wang, The Undecidability of the Existence of Zeros of Real Elementary Functions 1974 21 JACM Wojcik & Metze, An Analysis of Some Relationships Between Post and Boolean Algebras 1974 21 JACM Wong & Coppersmith, A Combinatorial Problem Related to Multimodule Memory Organizations 1974 21 JACM Zohar, The Solution of a Toeplitz Set of Linear Equations 1973 20 JACM Adiri & Hofri & Yadin, A Multiprogramming Queue 1973 20 JACM Adiri, Cyclic Queues with Bulk Arrivals 1973 20 JACM Arora & Gallo, Optimization of Static Loading and Sizing of Multilevel Memory Systems 1973 20 JACM Ashcroft & Manna & Pnueli, Decidable Properties of Monadic Functional Schemas 1973 20 JACM Bass & Young, Ordinal Hierarchies and Naming Complexity Classes 1973 20 JACM Beatty, An Axiomatic Approach to Code Optimization for Expressions [Errata, 538] 1973 20 JACM Bertziss, A Backtrack Procedure for Isomorphism of Directed Graphs 1973 20 JACM Burnett & Coffman, A Combinatorial Problem Related to Interleaved Memory Systems 1973 20 JACM Daley, An Example of Information and computation Resource Trade-Off 1973 20 JACM Dalphin & Lovass-Nagy, Best Least Squares Solutions to Finite Difference Equations Using the Generalized Inverse and Tensor Product Methods 1973 20 JACM Di Paola, The Solvability of the Decision Problem for Classes of Proper Formulas and Related Results 1973 20 JACM Dixon, Z-Resolution: Theorem-Proving with Compiled Axioms 1973 20 JACM Ehrlich, Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations 1973 20 JACM Friedli, Optimal Covering Algorithms in Methods of Search for Solving Polynomial Equations 1973 20 JACM Goldstein & Richman, A Midpoint Phenomenon 1973 20 JACM Gotlieb & MacEwen, Performance of Movable-Head Disk Storage Devices 1973 20 JACM Gray & Harrison, Canonical Precedence Schemes 1973 20 JACM Green, A Path Entropy Function for Rooted Trees 1973 20 JACM Griffith, Mathematical Models for Automatic Line Detection 1973 20 JACM Grossman & Silverman, Placement of Records on a Secondary Storage Device to Minimize Access Time 1973 20 JACM Hueckel, A Local Visual Operator Which Recognizes Edges and Lines 1973 20 JACM Hwang & Deutsch, A Class of Merging Algorithms 1973 20 JACM Jenkins, Bernouil's Method with Implicit Shifting 1973 20 JACM Johnson, A Note on Dijkstra's Shortest Path Algorithm 1973 20 JACM Kaneko & Liu, On Local Roundoff Errors in Floating-Point Arithmetic 1973 20 JACM Keller, Parallel Program Schemata and Maximal Parallelism II: Construction of Closures 1973 20 JACM Keller, Parallel Program Schemata and Maximal Parallelism I: Fundamental Results 1973 20 JACM Krogh, On Testing a Subroutine for the Numerical Integration of Ordinary Differential Equations 1973 20 JACM Lewis & Payne, Generalized Feedback Shift Register Pseudorandom Number Algorithm 1973 20 JACM Liu & Layland, Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment 1973 20 JACM Lomet, A Formalization of Transition Diagram Systems 1973 20 JACM McClellan, The Exact Solution of Systems of Linear Equations with Polynomial Coefficients 1973 20 JACM Miller, Toward Abstract Numerical Analysis 1973 20 JACM Morgenstern, Note on a Lower Bound of the Linear Complexity of the Fast Fourier Transform 1973 20 JACM Nievergelt & Wong, Upper Bounds for the Total Path Length of Binary Trees 1973 20 JACM Pietrzykowski, A Complete Mechanization of Second-Order Type Theory 1973 20 JACM Richards, Efficient Exercising of Switching Elements in Combinational Nets 1973 20 JACM Richards, Efficient Exercising of Switching Elements in Nets of Identical Gates 1973 20 JACM Rosen, Tree-Manipulating Systems and Church-Rosser Theorems 1973 20 JACM Rosenfeld, Arcs and Curves in Digital Pictures 1973 20 JACM Salkin & Koncal, Set Covering by an All Integer Algorithm: Computational Experience 1973 20 JACM Salton, Recent Studies in Automatic Text Analysis and Document Retrieval 1973 20 JACM Sloate & Bickart, A-Stable Composite Multistep Methods 1973 20 JACM Srinivasan & Thompson, Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm 1973 20 JACM Stillman, The Concept of Weak Substitution in Theorem-Proving 1973 20 JACM Stone, An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations 1973 20 JACM Tootill & Robinson & Eagle, An Asymptotically Random Tausworthe Sequence 1973 20 JACM Tourlakis & Mylopoulos, Some Results in Computational Topology 1973 20 JACM Watson, An Algorithm for the Inversion of Block Matrices of Toeplitz Form 1973 20 JACM Williams & White, A Note on Yen's Algorithm for Finding the Length of All Shortest Paths in N-Node Nonnegative-Distance Networks 1973 20 JACM Worrell & Hulme, Efficient Ordering of Set Expressions for Symbolic Expansion 1973 20 JACM Yue & Wong, On the Optimality of the Probability Ranking Scheme in Storage Applications 1972 19 JACM Salton, Editorial: What Is Computer Science? 1972 19 JACM Beck & Kolman, Computer Approaches to the Representation of Lie Algebras 1972 19 JACM Fleck & Hedetniemi & Oehmke, S-Semigroups of Automata 1972 19 JACM Pavlidis, Linear and Context-Free Graph Grammars 1972 19 JACM Fischer & Meyer & Rosenberg, Real-Time Simulation of Multihead Tape Units 1972 19 JACM Ibarra, A Note Concerning Nondeterministic Tape Complexities 1972 19 JACM Beatty, An Axiomatic Approach to Code Optimization for Expressions 1972 19 JACM Frazer & Benneti, Bounds on Optimal Merge Performance, and a Strategy for Optimality 1972 19 JACM Reingold, On the Optimality of Some Set Algorithms 1972 19 JACM Savage, Computational Work and Time on Finite Machines 1972 19 JACM Greibach & Ginsburg, Multitape AFA 1972 19 JACM Santos, A Note on Bracketed Grammars 1972 19 JACM Aho & Denning & Ullman, Weak and Mixed Strategy Parsing 1972 19 JACM Mcafee & Presser, An Algorithm for the Design of Simple Precedence Grammars 1972 19 JACM Ellis, The Halting Problem for Probabilistic Context-Free Generators 1972 19 JACM Gray & Harrison, On the Covering and Reduction Problems for Context-Free Grammars 1972 19 JACM Earnest & Balke & Anderson, Analysis of Graphs by Ordering of Nodes 1972 19 JACM Weinblatt, A New Search Algorithm for Finding the Simple Cycles of a Finite Directed Graph 1972 19 JACM Mulligan & Corneil, Corrections to Bierstone's Algorithm for Generating Cliques 1972 19 JACM Even & Pnueli & Lempel, Permutation Graphs and Transitive Graphs 1972 19 JACM Pfaltz, Graph Structures 1972 19 JACM Yen, Finding the Lengths of All Shortest Paths in N-Node Nonnegative-Distance Complete Networks Using 1/2 N^3 Additions and N^3 Comparisons 1972 19 JACM Chang, The Generation of Minimal Trees with a Steiner Topology 1972 19 JACM Srinivasan & Thompson, Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems 1972 19 JACM Stanfel, Practical Aspects of Doubly Chained Trees for Retrieval 1972 19 JACM Huang & Cline, Inversion of Persymmetric matrices Having Toeplitz Inverses 1972 19 JACM Edmonds & Karp, Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems 1972 19 JACM Hammer & Peled, On the Maximization of a Pseudo-Boolean Function 1972 19 JACM Chen & Epley, Memory Requirements in a Multiprocessing Environment 1972 19 JACM Heacox & Purdom, Analysis of Two Time-Sharing Queueing Models 1972 19 JACM Konheim & Meister, Service in a Loop System 1972 19 JACM Mitrani, Nonpriority Multiprogramming Systems Under Heavy Demand Conditions--Customers' Viewpoint 1972 19 JACM Nance & Bhat & Claybrook, Busy Period Analysis of a Time-Sharing System: Transform Inversion 1972 19 JACM Kleinrock & Muntz, Processor Sharing Queueing Models of Mixed Scheduling Disciplines for Time Shared Systems 1972 19 JACM Schultz, A Stochastic Model for Message Assembly Buffering with a Comparison of Block Assignment Strategies 1972 19 JACM Harris & Marlin, A Note on Feedback Queues with Bulk Service 1972 19 JACM Selkow, One-Pass Complexity of Digital Picture Properties 1972 19 JACM Bayes, A Minimum Variance Sampling Technique for Simulation Models 1972 19 JACM Zeigler, Toward a Formal Theory of Modeling and Simulation: Structure Preserving Morphisms 1972 19 JACM Lee, Fuzzy Logic and the Resolution Principle 1972 19 JACM Slagle, Automatic Theorem Proving with Built-in Theories Including Equality, Partial Ordering, and Sets 1972 19 JACM van Westrhenen, Statistical Studies of Theoremhood in Classical Propositional and First-Order Predicat Calculus 1972 19 JACM Loveland, A Unifying View of Some Linear Herbrand Procedures 1972 19 JACM Blikle, Addressless Units for Carrying Out Loop-Free Computations 1972 19 JACM Borodin, Computational Complexity and the Existence of Complexity Gaps. Corrigendum 1972 19 JACM Constable, The Operator Gap 1972 19 JACM Zadeh, Theoretical Efficiency of the Edmonds-Karp Algorithm for Computing Maximal Flows 1972 19 JACM Landweber & Robertson, Recursive Properties of Abstract Complexity Classes 1972 19 JACM Rosenberg, Addressable Data Graphs 1972 19 JACM Tarjan, Sorting Using Networks of Queues and Stacks 1972 19 JACM Bruno & Steiglitz, The Expression of Algorithms by Charts 1972 19 JACM Constable & Borodin, Subrecursive Programming Languages, Part I: Efficiency and Program Structure 1972 19 JACM Ullman, A Note on the Efficiency of Hashing Functions 1972 19 JACM Slagle, An Approach for Finding C-Linear Complete Inference Systemsssssssssss 1971 18 JACM Salton, Editorial: Some Thoughts on Scientific Information Dissemination 1971 18 JACM Wilkinson, Some Comments from a Numerical Analyst 1971 18 JACM Cook, Characterizations of Pushdown Machines in Terms of Time-Bounded Computers 1971 18 JACM Harrison & Schkolnick, A Grammatical Characterization of One-Way Nondeterministic Stack Languages 1971 18 JACM Case, A Note on Degrees of Self-Describing Turing Machines 1971 18 JACM Smith, Simple Computation-Universal Cellular Spaces 1971 18 JACM Kautz, An Augmented Content-Addressed Memory Array for Implementation with Large-Scale Integration 1971 18 JACM Irani & Wallace, On Network Linguistics and the Conversational Design of Queueing Networks 1971 18 JACM Kernighan, Optimal Sequential Partitions of Graphs 1971 18 JACM Simon & Lee, On the Optimal Solutions to And/Or Series-Parallel Graphs 1971 18 JACM Goffman, A Mathematical Method for Analyzing the Growth of a Scientific Discipline 1971 18 JACM Abdelmalek, Linear L_1 Approximation for a Discrete Point Set and L_1 Solutions of Overdetermined Linear Equations 1971 18 JACM Benschop & Ratz, A Mean Square Estimate of the Generated Roundoff Error in Constant Matrix Iterative Processes 1971 18 JACM Cryer, Topological Problems Arising When Solving Boundary Value Problems for Elliptic Partial Differential Equations by the Method of Finite Differences 1971 18 JACM Dill & Gear, A Graphical Search for Stiffly Stable Methods for Ordinary Differential Equations 1971 18 JACM Mock, Numerical Analysis of a Nonlinear Diffusion Problem 1971 18 JACM Tootill & Robinson & Adams, The Runs Up-and-Down Performance of Tausworthe Pseudo-Random Number Generators 1971 18 JACM Bunch, Equilibration of Symmetric Matrices in the Max-Norm 1971 18 JACM Rose, A Note on Consistent Ordering and Zero Circulation 1971 18 JACM Kaplan & Papetti, A Note on Quadrilateral Interpolation 1971 18 JACM Smith, Multiplicative Pseudo-Random Number Generators with Prime Modulus 1971 18 JACM Wasserstrom, Solving Boundary-Value Problems by Imbedding 1971 18 JACM Philippatos & Moscato, Effects of Constrained Information on Player Decisions in Experimental Business Simulation: Some Empirical Evidence 1971 18 JACM Lions, Some Results Concerning the Reduction of Binary Matrices 1971 18 JACM Aho & Denning & Ullman, Principles of Optimal Page Replacement 1971 18 JACM Gaver & Lewis, Probability Models for Buffer Storage Allocation Problems 1971 18 JACM Lewis & Shedler, A Cyclic-Queue Model of System Overhead in Multiprogrammed Computer Systems 1971 18 JACM Bhat & Nance, Busy Period Analysis of a Time-Sharing System Modeled as a Semi-Markov Process 1971 18 JACM Burge & Konheim, An Accessing Model 1971 18 JACM Gaver, Analysis of Remote Terminal Backlogs under Heavy Demand Conditions 1971 18 JACM Robson, An Estimate of the Store Size Necessary for Dynamic Stroage Allocation 1971 18 JACM Adiri, A Dynamic Time-Sharing Priority Queue 1971 18 JACM Adiri, A Note on Some Mathematical Models of Time-Sharing Systems 1971 18 JACM Mylopoulos & Pavlidis, On the Topological Properties of Quantized Spaces. II. Connectivity and Order of Connectivity 1971 18 JACM Steffanelli & Rosenfeld, Some Parallel Thinning Algorithms for Digital Pictures 1971 18 JACM Alexander & Thaler, The Boundary Count of Digital Pictures 1971 18 JACM Hueckel, An Operator Which Locates Edges in Digitized Pictures 1971 18 JACM Winder, Chow Parameters in Threshold Logic 1971 18 JACM de Vries, Minimal Sets of Distinct Literals for a Logically Passive Function 1971 18 JACM Chang & Slagle, Completeness of Linear Refutation for Theories with Equality 1971 18 JACM Reiter, Two Results on Ordering for Resolution with Merging and Linear Format 1971 18 JACM Blum, On Effective Procedures for Speeding Up Algorithms 1971 18 JACM Cole, Deterministic Pushdown Store Machines and Real-Time Computation 1971 18 JACM Hartmanis & Hopcroft, An Overview of the Theory of Computational Complexity 1971 18 JACM Brown, On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors 1971 18 JACM Brown & Traub, On Euclid's Algorithm and the Theory of Subresultants 1971 18 JACM Collins, The Calculation of Multivariate Polynomial Resultants 1971 18 JACM Heindel, Integer Arithmetic Algorithms for Polynomial Real Zero Determination 1971 18 JACM Martin, Determining the Equivalence of Algebraic Expressions by Hash Coding 1971 18 JACM Johnson, On the Problem of Recognizing Zero 1970 17 JACM Minsky, Form and Content in Computer Science 1970 17 JACM Ginsburg & Hopcroft, Two-Way Balloon Automata and AFL 1970 17 JACM Bavel & Muller, Connectivity and Reversibility in Automata 1970 17 JACM Willis, Computational Complexity and Probability Constructions 1970 17 JACM Colmerauer, Total Precedence Relations 1970 17 JACM Cudia, General Problems of Formal Grammars 1970 17 JACM Rosenberg, A Note on Ambiguity of Context-Free Languages and Presentations of Semilinear Sets 1970 17 JACM Gurk & Minker, Storage Requirements for Information Handling Centers 1970 17 JACM Augustson & Minker, An Analysis of Some Graph Theoretical Cluster Techniques 1970 17 JACM Chand & Kapur, An Algorithm for Convex Polytopes 1970 17 JACM Gustavson & Liniger & Willoughby, Symbolic Generation of an Optimal Crout Algorithm for Sparse Systems of Linear Equations 1970 17 JACM Meyer & Painter, Note on a Least Squares Inverse for a Matrix 1970 17 JACM Andrews & Kane, Kronecker Matrices, Computer Implementation, and Generalized Spectra 1970 17 JACM Haber, Sequences of Numbers That Are Approximately Completely Equidistributed 1970 17 JACM Henrici, Methods of Search for Solving Polynomial Equations 1970 17 JACM Rahme, Stability Analysis of a New Algorithm Used for Integrating a System of Ordinary Differential Equations 1970 17 JACM Zafarullah, Application of the Method of Lines to Parabolic Partial Differential Equations with Error Estimates 1970 17 JACM Cryer, On the Approximate Solution of Free Boundary Problems Using Finite Differences 1970 17 JACM Kagiwada & Kalaba, An Initial-Value Theory for Fredholm Integral Equations with Semidegenerate Kernels 1970 17 JACM Tsuda & Ichida, Nonlinear Interpolation of Multivariable Functions by the Monte Carlo Method 1970 17 JACM Akima, A New Method of Interpolation and Smooth Curve Fitting Based on Local Procedures 1970 17 JACM Good & London, Computer Interval Arithmetic: Definition and Proof of Correct Implementation 1970 17 JACM Gruttke, Pseudo-Runge-Kutta Methods of the Fifth Order 1970 17 JACM Hashimoto, A Method for Solving Large Matrix Equations Reduced from Fredholm Integral Equations of the Second Kind 1970 17 JACM Kaneko & Liu, Accumulation of Round-off Error in Fast Fourier Transforms 1970 17 JACM Shampine, Efficiency of a Procedure for Near-Minimax Approximation 1970 17 JACM Smith, Error Bounds for Zeros of a Polynomial Based Upon Gerschgorin's Theorems 1970 17 JACM Coffman & Muntz & Trotter, Waiting Time Distributions for Processor-Sharing Systems 1970 17 JACM Rasch, A Queueing Theory Study of Round-Robin Scheduling of Time-Shared Computer Systems 1970 17 JACM Delbrouck, A Feedback Queueing System with Batch Arrivals, Bulk Service, and Queue-Dependent Service Time 1970 17 JACM Muntz & Coffman, Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems 1970 17 JACM Ramamoorthy & Chandy, Optimization of Memory Hierarchies in Multiprogrammed Systems 1970 17 JACM Purdom & Stigler, Statistical Properties of the Buddy System 1970 17 JACM Chang & Gill, Algorithmic Solution of the Change-Making Problem 1970 17 JACM Roth, An Approach to Solving Linear Discrete Optimization Problems 1970 17 JACM Shrager, Nonlinear Regression With Linear Constraints: An Extension of the Magnified Diagonal Method 1970 17 JACM Bonzon, Necessary and Sufficient Conditions for Dynamic Programming of Combinatorial Type 1970 17 JACM Corneil & Gotlieb, An Efficient Algorithm for Graph Isomorphism 1970 17 JACM Rosenfeld, Connectivity in Digital Pictures 1970 17 JACM Sklansky, Thresholded Convolution Operations 1970 17 JACM Hodes, The Logical Complexity of Geometric Properties in the Plane 1970 17 JACM Montanari, On Limit Properties in Digitization Schemes 1970 17 JACM Shaw, Parsing of Graph-Representable Pictures 1970 17 JACM Nevins, A Programming Language with Automatic Goal Generation and Selection 1970 17 JACM Boyle & Grau, An Algorithmic Semantics for ALGOL 60 Identifier Denotation 1970 17 JACM Fox, Accelerating List Processing in Discrete Programming 1970 17 JACM Beus, The Use of Information in Sorting 1970 17 JACM Frazer & McKellar, Samplesort: A Sampling Approach to Minimal Storage Tree Sorting 1970 17 JACM Stanfel, Tree Structures for Optimal Searching 1970 17 JACM Breuer, Simplification of the Covering Problem with Application to Boolean Expressions 1970 17 JACM Stone, An Algorithm for Modular Partitioning 1970 17 JACM Mowle, Controllability of Nonlinear Sequential Networks 1970 17 JACM Anderson & Bledsoe, A Linear Format for Resolution With Merging and a New Technique for Establishing Completeness 1970 17 JACM Slagle, Interpolation Theorems for Resolution in Lower Predicate Calculus 1970 17 JACM Chang, The Unit Proof and the Input Proof in Theorem Proving 1970 17 JACM Caviness, On Canonical Forms and Simplification 1970 17 JACM Baer & Bovet & Estrin, Legality and Other Properties of Graph Models of Computations 1970 17 JACM Manna & Pnueli, Formalization of Properties of Functional Programs 1970 17 JACM Pager, On the Efficiency of Algorithms 1970 17 JACM Sethi & Ullman, The Generation of Optimal Code for Arithmetic Expressions 1970 17 JACM Tsichritzis, The Equivalence Problem of Simple Programs 1970 17 JACM Grzymala-Busse, Errata: On the Periodic Representations and the Reducibility of Periodic Automata 1969 16 JACM Hamming, One Man's View of Computer Science 1969 16 JACM Slagle & Dixon, Experiments with Some Programs that Search Game Trees 1969 16 JACM Loveland, A Simplified Format for the Model Elimination Theorem-Proving Procedure 1969 16 JACM Loveland, Errata: A Simplified Format for the Model Elimination Theorem-Proving Procedure 1969 16 JACM Sandewall, A Planning Problem Solver Based on Look-Ahead in Stochastic Game Trees 1969 16 JACM Ernst, Sufficient Conditions for the Success of GPS 1969 16 JACM Montanari, Continuous Skeletons from Digitized Images 1969 16 JACM Brzozowski & Cohen, On Decompositions of Regular Events 1969 16 JACM Chaitin, On the Length of Programs for Computing Finite Binary Sequences: Statistical Considerations 1969 16 JACM Hartmanis, On the Complexity of Undecidable Problems in Automata Theory 1969 16 JACM Hopcroft & Ullman, Some Results on Tape-bounded Turing Machines 1969 16 JACM Waksman, A Model of Replication 1969 16 JACM Grzymala-Busse, Automorphisms of Polyadic Automata 1969 16 JACM Grzymala-Busse, Errata: Automorphisms of Polyadic Automata 1969 16 JACM Meyer, A Note on Star-Free Events 1969 16 JACM Reynolds & Cutlip, Synchronization and General Repetitive Machines, with Applications to Ultimate Definite Automata 1969 16 JACM Spira, The Time Required for Group Multiplication 1969 16 JACM Grzymala-Busse, On the Periodic Representations and the Reducibility of Periodic Automata 1969 16 JACM Liu, Lattice Functions, Pair Algebras, and Finite-State Machines 1969 16 JACM Moyles & Thompson, An Algorithm for Finding a Minimum Equivalent Graph of a Digraph 1969 16 JACM Greibach, An Infinite Hierarchy of Context-Free Languages 1969 16 JACM Rosenkrantz, Programmed Grammars and Classes of Formal Languages 1969 16 JACM Manna, Properties of Programs and the First-Order Predicate Calculus 1969 16 JACM Maurer, A Direct Proof of the Inherent Ambiguity of a Simple Context-Free Language 1969 16 JACM Wegner, Translation Networks and Function Composition 1969 16 JACM Aho, Nested Stack Automata 1969 16 JACM Chaitin, On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural Numbers 1969 16 JACM Kasami & Torii, A Syntax-Analysis Procedure for Unambiguous Context-Free Grammars 1969 16 JACM Ullman, Halting Stack Automata 1969 16 JACM Gibbs, A Cycle Generation Algorithm for Finite Undirected Linear Graphs 1969 16 JACM Brown & Traub, MERCURY: A System for the Computer-Aided Distribution of Technical Reports 1969 16 JACM Kochen, Automatic Question-Answering of English-Like Questions About Simple Diagrams 1969 16 JACM Edmundson, New Methods in Automatic Extracting 1969 16 JACM Reed & Turn, A Generalization of Shift-Register Sequence Generators 1969 16 JACM Ghosh & Senko, File Organization: On the Selection of Random Access Index Points for Sequential Files 1969 16 JACM Pease, Organization of Large Scale Fourier Processors 1969 16 JACM Guard & Oglesby & Bennett & Settle, Semi-Automated Mathematics 1969 16 JACM Trauboth, Recursive Formulas for the Evaluation of the Convolution Integral 1969 16 JACM Berman, Lattice Approximations to the Minima of Functions of Several Variables 1969 16 JACM Linz, Linear Multistep Methods for Volterra Integro-Differential Equations 1969 16 JACM Pease, Inversion of Matrices by Partitioning 1969 16 JACM Lyness, Notes on the Adaptive Simpson Quadrature Routine 1969 16 JACM Rahme, A New Look at the Numerical Integration of Ordinary Differential Equations 1969 16 JACM Tal, On Monotone Decomposable Operators 1969 16 JACM Loizou, Nonnormality and Jordan Condition Numbers of Matrices 1969 16 JACM Zafarullah, Finite Difference Scheme for a Third Boundary Value Problem 1969 16 JACM Zohar, Toeplitz matrix Inversion: The Algorithm of W. F. Trench 1969 16 JACM Coffman, Analysis of a Drum Input/Output Queue Under Scheduled Operation in a Paged Computer System 1969 16 JACM Coffman, Errata: Analysis of a Drum Input/Output Queue Under Scheduled Operation in a Paged Computer System 1969 16 JACM Frank, Analysis and Optimization of Disk Storage Devices for Time-Sharing Systems 1969 16 JACM Adiri & Avi-Itzhak, A Time-Sharing Queue with a Finite Number of Customers 1969 16 JACM Shimizu, A Stochastic Approximation Method for Optimization Problems 1969 16 JACM Adiri, Computer Time-Sharing Queues with Priorities 1969 16 JACM Di Paola, The Recursive Unsolvability of the Decision Problem for the Class of Definite Formulas 1969 16 JACM Young, Toward a Theory of Enumerations 1969 16 JACM Di Paola, Random Sets in Subrecursive Hierarchies 1968 15 JACM Wilkes, Computers Then and Now 1968 15 JACM Salton & Lesk, Computer Evaluation of Indexing and Text Processing 1968 15 JACM Wirth, PL360, A Programming Language for the 360 Computers 1968 15 JACM Echols & Cooper, The Solution of Integer Linear Programming Problems by Direct Search 1968 15 JACM Slagle & Bursky, Experiments With a Multipurpose, Theorem-Proving Heuristic Program 1968 15 JACM Strand & Westwater, Statistical Estimation of the Numerical Solution of a Fredholm Integral Equation of the First Kind 1968 15 JACM Dubner & Abate, Numerical Inversion of Laplace Transforms and the Finite Fourier Cosine Transform 1968 15 JACM Kaplan, Some Completeness Results in the Mathematical Theory of Computation 1968 15 JACM Bavel, Structure and Transition-Preserving Functions of Finite Automata 1968 15 JACM Waksman, A Permutation Network 1968 15 JACM Sklansky & Finkelstein & Russell, A Formalism for Program Translation 1968 15 JACM Gilmore, Structuring of Parallel Algorithms 1968 15 JACM Kubert & Szabo & Giulieri, The Perspective Representation of Functions of Two Variables 1968 15 JACM Morse, A Mathematical Model for the Analysis of Contour-Line Data 1968 15 JACM Orden & Nalbandian, A Bidirectional Simplex Algorithm 1968 15 JACM Loveland, Mechanical Theorem-Proving by Model Elimination 1968 15 JACM Pease, An Adaptation of the Fast Fourier Transform for Parallel Processing 1968 15 JACM Zeleznik, Quasi-Newton Methods for Nonlinear Equations 1968 15 JACM Morris & Odell, Common Solutions for n Matrix Equations With Applications 1968 15 JACM Aberth, Analysis in the Computable Number Field 1968 15 JACM Schutzenberger, A Remark on Acceptable Sets of Numbers 1968 15 JACM Yeh, Generalized Pair Algebra With Applications to Automata Theory 1968 15 JACM Hopcroft & Ullman, Decidable and Undecidable Questions About Automata 1968 15 JACM Hartmanis, Computational Complexity of One-Tape Turing Machine Computations 1968 15 JACM Waksman, Corrigendum: A Permutation Network 1968 15 JACM Coffman, Analysis of Two Time-Sharing Algorithms Designed for Limited Swapping 1968 15 JACM Comba, A Procedure for Detecting Intersections of Three-Dimensional Objects 1968 15 JACM Andrews, Resolution With Merging 1968 15 JACM Hartmanis & Shank, On the Recognition of Primes by Automata 1968 15 JACM Kohfeld & Thompson, A Modification of Nordsieck's method Using an ``Off-Step'' Point 1968 15 JACM Zielke, Inversion of Modified Symmetric Matrices 1968 15 JACM Griffiths, The Unsolvability of the Equivalence Problem for Lambda-Free Nondeterministic Generalized Machines 1968 15 JACM Hopcroft & Ullman, Relations Between Time and Tape Complexities 1968 15 JACM Ginsburg & Harrison, One-Way Nondeterministic Real-Time List-Storage Languages 1968 15 JACM Chartres & Florentin, A Universal Syntax-Directed Top-Down Analyzer 1968 15 JACM Lewis & Stearns, Syntax-Directed Transduction 1968 15 JACM Wirth, Corrigendum: PL360, A Programming Language for the 360 Computers 1968 15 JACM Gotlieb & Kumar, Semantic Clustering of Index Terms 1968 15 JACM Morrison, PATRICIA--Practical Algorithm To Retrieve Information Coded in Alphanumeric 1968 15 JACM Lowe, The Influence of Data-Base Characteristics and Usage on Direct-Access File Organization 1968 15 JACM Coffman & Kleinrock, Feedback Queueing Models for Time-Shared Systems 1968 15 JACM Abate & Dubner & Weinberg, Queueing Analysis of the IBM 2314 Disk Storage Facility 1968 15 JACM Reiter, Scheduling Parallel Computations 1968 15 JACM Montanari, A Method for Obtaining Skeletons Using a Quasi-Euclidean Distance 1968 15 JACM Quinlan & Hunt, A Formal Deductive Problem-Solving System 1968 15 JACM Aho, Indexed Grammars--An Extension of Context-Free Grammars 1968 15 JACM Rosenberg, On the Independence of Real-Time Definability and Certain Structural Properties of Context-Free Languages 1968 15 JACM Cudia & Singletary, Degrees of Unsolvability in Formal Grammars 1968 15 JACM Mukhopadhyay, Representation of Events in the von Neumann Cellular Model 1968 15 JACM Karim, A theorem for the Stability of General Predictor-Corrector Methods for the Solution of Systems of Differential Equations 1968 15 JACM Dyer, Generalized Multistep Methods in Satellite Orbit Computation 1968 15 JACM Andrews, A Correction Concerning Resolution: Resolution With Merging 1967 14 JACM Perlis, The Synthesis of Algorithmic Systems 1967 14 JACM Wunderlich, Sieving Procedures on a Digital Computer 1967 14 JACM Lewis & Baxendale & Bennett, Statistical Discrimination of the Synonymy/Antonymy Relationship Between Words 1967 14 JACM Brans, A Computer Program for the Nonnumerical Testing and Reduction of Sets of Algebraic Partial Differential Equations 1967 14 JACM Chartres & Geuder, Computable Error Bounds for Direct Solution of Linear Equations 1967 14 JACM Stewart, A Modification of Davidon's Minimization Method to Accept Difference Approximations of Derivatives 1967 14 JACM Butcher, A Multistep Generalization of Runge-Kutta Methods With Four or Five Stages 1967 14 JACM Coveyou & MacPherson, Fourier Analysis of Uniform Random Number Generators 1967 14 JACM Young, Binomial-Weighted Orthogonal Polynomials 1967 14 JACM Collins, Subresultants and Reduced Polynomial Remainder Sequences 1967 14 JACM Shaw, Modified Multistep Methods Based on a Nonpolynomial Interpolant 1967 14 JACM Kohfeld & Thompson, Multistep Methods With Modified Predictors and Correctors 1967 14 JACM Yasuhara, A Remark on Post Normal Systems 1967 14 JACM Ginsburg & Greibach & Harrison, Stack Automata and Compiling 1967 14 JACM Minnick, Survey of Microcellular Research 1967 14 JACM Kleinrock, Time-Shared Systems: A Theoretical Treatment 1967 14 JACM Shemer, Some Mathematical Considerations of Time-Sharing Scheduling Algorithms 1967 14 JACM Chu & Chueh, Error Probability in Decision Functions for Character Recognition 1967 14 JACM Martin & Estrin, Models of Computations and Systems--Evaluation of Vertex Probabilities in Graph Models of Computations 1967 14 JACM Waite, Path Detection in Multidimensional Iterative Arrays 1967 14 JACM Moore, A Convergent Algorithm for Solving Polynomial Equations 1967 14 JACM Moler, Iterative Refinement in Floating Point 1967 14 JACM Blum, A Machine-Independent Theory of the Complexity of Recursive Functions 1967 14 JACM Westlake, A Uniform Random Number Generator Based on the Combination of Two Congruential Generators 1967 14 JACM Mancino, Resolution by Iteration of Some Nonlinear Systems 1967 14 JACM Krogh, A Test for Instability in the Numerical Solution of Ordinary Differential Equations 1967 14 JACM Ginzburg, A Procedure for Checking Equality of Regular Expressions 1967 14 JACM Cryer, On the Numerical Solution of a Quasi-Linear Elliptic Equation 1967 14 JACM Natapoff, Irreducible Topological Components of an Arbitrary Boolean Truth Function and Generation of Their Minimal Coverings 1967 14 JACM Pickett, Note Concerning the Algebraic Theory of Automata 1967 14 JACM Ginsburg & Greibach & Harrison, One-Way Stack Automata 1967 14 JACM Pereira, Corrigendum 1967 14 JACM Weeg, Corrigendum 1967 14 JACM Gaver, Probability Models for Multiprogramming Computer Systems 1967 14 JACM Manacher, Production and Stabilization of Real-Time Task Schedules 1967 14 JACM Brzozowski, Roots of Star Events 1967 14 JACM Karp, Some Bounds on the Storage Requirements of Sequential Machines and Turing Machines 1967 14 JACM McNaughton, Parenthesis Grammars 1967 14 JACM Rosenkrantz, Matrix Equations and Normal Forms for Context-Free Grammars 1967 14 JACM Oliver, Analysis of Factorial Experiments Using Generalized Matrix Operations 1967 14 JACM Klee, A Method for Constructing Circuit Codes 1967 14 JACM Mowle, An Algorithm for Generating Stable Feedback Shift Registers of Order n 1967 14 JACM Rigal & Gaches, On the Compatibility of a Given Solution With the Data of a Linear System 1967 14 JACM Hicks & Wei, Numerical Solution of Parabolic Partial Differential Equations With Two-Point Boundary Conditions by use of the Method of Lines 1967 14 JACM Karp & Miller & Winograd, The Organization of Computations for Uniform Recurrence Equations 1967 14 JACM Carroll & Wetherald, Application of Parallel Processing to Numerical Weather Prediction 1967 14 JACM Knuth & Bigelow, Programming Languages for Automata 1967 14 JACM Floyd, Nondeterministic Algorithms 1967 14 JACM Rosenberg, Real-Time Definable Languages 1967 14 JACM Hartmanis, On Memory Requirements for Context-Free Language Recognition 1967 14 JACM Gill & Flexer, Periodic Decomposition of Sequential Machines 1967 14 JACM Aanderaa & Fischer, The Solvability of the Halting Problem for 2-State Post Machines 1967 14 JACM Barnes & Fitzgerald, Minimal Experiments for Input-Independent Machines 1967 14 JACM Slagle, Automatic Theorem Proving with Renamable and Semantic Resolution 1967 14 JACM Wos & Robinson & Carson & Shalla, The Concept of Demodulation in Theorem Proving 1967 14 JACM Fairthorne, Morphology of ``Information Flow'' 1967 14 JACM Shapiro, An Algorithm for Reconstructing Protein and RNA Sequences 1967 14 JACM Sigillito, On a Continuous Method of Approximating Solutions of the Heat Equation 1967 14 JACM Reinwald & Soland, Conversion of Limited-Entry Decision Tables to Optimal Computer Programs II: Minimum Storage Requirement 1967 14 JACM Pease, Matrix Inversion Using Parallel Processing 1967 14 JACM Odell & Decell, On computing the Fixed-Point Probability Vector of Ergodic Transition Matrices 1967 14 JACM Brush & Kohfeld & Thompson, Solution of Ordinary Differential Equations Using Two ``Off-Step'' Points 1967 14 JACM Van Gelder, Some New Results in Pseudo-Random Number Generation 1967 14 JACM Winograd, On the Time Required to Perform Multiplication 1966 13 JACM Hibbard & Ullian, The Independence of Inherent Ambiguity From Complementedness Among Context-Free Languages 1966 13 JACM Chaitin, On the Length of Programs for Computing Finite Binary Sequences 1966 13 JACM Hennie & Stearns, Two-Tape Simulations of Multitape Turing Machines 1966 13 JACM Parikh, On Context-Free Languages 1965 12 JACM Fischer, Generation of Primes by a One-Dimensional Real-Time Iterative Array 1996 57 JACTION Simon, Spinning the Jewish Web 1996 56 JACTION Pollack, Does The Class of '40 Have Anything To Say to the Class of '99? 1996 56 JACTION Eisen, Gemara-Phobia; Getting ``Into'' Gemara: How to Take the Plunge 1996 56 JACTION Twersky, And Yitzchak Trembled... 1996 56 JACTION Simon & Adlerstein, The Virtual Shtender 1995 56 JACTION Luban, Is Your Oven Kosher? What Every Kosher Cook Must Know 1995 56 JACTION Blidstein, review of Wurzburger, Ethics of Responsibility: Pluralistic Approaches to Covenantal Ethics (Jewish Publication Society, 1994) 1995 55 JACTION Simon, Piracy on the High PCs 1995 55 JACTION Katz, Is the ADL Right About the Right? 1995 55 JACTION Kurtz, A Generation Without Grandparents 1995 55 JACTION Fink, Hearing the Call of History 1994 54 JACTION Simon & Adlerstein, Torah on the PC 1994 54 JACTION Adlerstein, Learning With An Electronic Chavruta 1993 54 JACTION Gellis, A Revolution in the Making: The Computerized Jewish Network 1993 54 JACTION Simon, Hebrew/English Word Processing under Windows 1993 54 JACTION Schlam, review of Feder, A Jewish Conservative Looks at Pagan America (Huntington House Publishers, 1993) 1993 54 JACTION Greenwald, review of Johnson, A United Jerusalem: The Story of Ateret Cohanim 1989 120 JALGEB Birget & Rhodes, Group Theory via Global Semigroup Theory 1995 8 JAMS Kahn & Komlos & Szemeredi, On the Probability that a Random +/-1 Matrix is Singular 1994 7 JAMS Talagrand, Matching Theorems and Empirical Discrepancy Computations Using Majorizing Measures 1992 5 JAMS Lenstra & Pomerance, A Rigorous Time Bound for Factoring Integers 1991 4 JAMS Luczak & Spencer, When Does the Zero-One Law Hold? 1991 4 JAMS Schramm, Rigidity of Infinite (Circle) Packings 1991 4 JAMS Chung & Graham, Quasi-random Set Systems 1990 3 JAMS Alon & Seymour & Thomas, A Separator Theorem for Nonplanar Graphs 1990 2 JAMS Goodman & Pollack & Sturmfels, The Intrinsic Spread of a Configuration in R^d 1989 2 JAMS Chazelle, Lower Bounds on the Complexity of Polytope Range Searching 1989 2 JAMS Hafner & McCurley, A Rigorous Subexponential Algorithm for Computation of Class Groups 1989 2 JAMS Chung, Diameters and Eigenvalues 1988 1 JAMS Sleator & Tarjan & Thurston, Rotation Distance, Triangulations, and Hyperbolic Geometry 1988 1 JAMS Shelah & Spencer, Zero-One Laws for Sparse Random Graphs 1989 26 JAPROB Halfin, Next-Fit Bin Packing with Random Piece Sizes 1989 26 JAPROB Sutton, Packing Densities of Randomly Constructed Codes 1989 26 JAPROB Glynn, A Discrete-Time Storage Process with a General Release Rule 1996 16 JAR Bronsard & Reddy & Hasker, Induction Using Term Orders 1996 16 JAR Kapur & Subramaniam, New Uses of Linear Arithmetic in Automated Theorem Proving by Induction 1996 16 JAR Ireland & Bundy, Productive Use of Failure in Inductive Proof 1996 16 JAR Kraan & Basin & Bundy, Middle-Out Reasoning for Synthesis and Induction 1996 16 JAR Basin & Walsh, A Calculus for and Termination of Rippling 1996 16 JAR Kaufmann & Pecchiari, Interaction with the Boyer-Moore Theorem Prover: A Tutorial Study Using the Arithmetic-Geometric Mean Theorem 1995 14 JAR Vadaparty, On the Complexity of Nested-Object Matching 1993 11 JAR Schulz, Word Unification and Transformation of Generalized Equations 1993 11 JAR Farmer & Guttman & Thayer, IMPS: An Interactive Mathematical Proof System 1992 9 JAR Kaufmann, An Extension of the Boyer-More Theorem Prover to Support First-Order Quantification 1992 9 JAR Kuper & McAloon & Palem & Perry, A Note on the Parallel Complexity of Anti-Unification 1992 9 JAR Delcher & Kasif, Efficient Parallel Term Matching and Anti-Unification 1992 9 JAR Franzen, Hilbert's Tenth Problem is of Unification Type Zero 1992 9 JAR Kifer & Lozinskii, A Logic for Reasoning with Inconsistency 1992 8 JAR Russinoff, A Mechanical Prof of Quadratic Reciprocity 1992 8 JAR Hines, Completeness of a Prover for Dense Linear Orders 1992 8 JAR Quaife, Automated Deduction in von Neumann-Bernays-Goedel Set Theory 1991 7 JAR Nutt, The Unification Hierarchy is Undecidable 1991 7 JAR Wen-Tsun, Mechanical Theorem Proving of Differential Geometries and Some of its Applications in Mechanics 1991 7 JAR Cantone, Decision Procedures for Elementary Sublanguages of Set Theory: X. Multilevel Syllogistic Extended by the Singleton and Powerset Operators 1991 7 JAR Cantone & Schwartz, Decision Procedures for Elementary Sublanguages of Set Theory: XI. Multilevel Syllogistic Extended by Some Elementary Map Constructs 1991 7 JAR Ferro, Decision Procedures for Elementary Sublanguages of Set Theory: XII. Multilevel Syllogistic Extended with Singleton and Choice Operators 1991 7 JAR Parlamento & Policriti, Decision Procedures for Elementary Sublanguages of Set Theory: XIII. Model Graphs, Reflection and Decidability 1991 7 JAR Quaife, Unsolved Problems in Elementary Number Theory 1990 6 JAR Patel-Schneider, A Decidable First-Order Logic for Knowledge Representation 1990 6 JAR Plaisted, A Sequent-Style Model Elimination Strategy and a Positive Refinement 1990 6 JAR Gao, Transcendental Functions and Mechanical Theorem Proving in Elementary Geometries 1991 34 JCAM Eichenauer-Herrmann & Niederreiter, On the Discrepancy of Quadratic Congruential Pseudorandom Numbers 1990 31 JCAM Afflerbach, Criteria for the Assessment of Random Number Generators 1990 31 JCAM Bouleau, On Effective Computation of Expectations in Large or Infinite Dimension 1990 31 JCAM Eddy, Random Number Generators for Parallel Processors 1990 31 JCAM Eichenauer-Herrmann & Topuzoglu, On the Period Length of Congruential Pseudorandom Number Sequences Generated by Inversions 1990 31 JCAM Gentle, Computer Implementation of Random Number Generators 1990 31 JCAM Kemp, Patchwork Rejection Algorithms 1990 31 JCAM Ripley, Thoughts on Pseudorandom Number Generators 1990 31 JCAM Tichy, Random Points in the Cube and on the Sphere with Applications to Numerical Analysis 1990 31 JCAM Zielinski, An Aperiodic Pseudorandom Number Generator 1988 23 JCAM von Hohenbalken, An Algorithm for Set Operations on Nonconvex Polygons (with an Application to Census Tracts) 1988 22 JCAM Andersson & Casti & Christiansen & Karlqvist, Emerging Paradigms in Applied Mathematical Modelling--An Introduction 1988 22 JCAM Klir, The Future of Information, Computer, and Systems Sciences 1988 22 JCAM Rosen, Complexity and Information 1988 22 JCAM Kostlan, Complexity Theory of Numerical Linear Algebra 1988 22 JCAM Rockafellar, Optimization: A Case for the Development of New Mathematical Concepts 1993 1 JCOMBDES Gibbons & Mathon, The Use of Hill-Climbing to Construct Orthogonal Steiner Triple Systems 1993 1 JCOMBDES Sloane, Covering Arrays and Intersecting Codes 1989 7 JCOMPM Calude & Chitescu, Upper Limitation of Kolmogorov Complexity and Universal P. Martin-Lof Tests 1997 10 JCRYPTOL de Rooij, On Schnorr's Preprocessing for Digital Signature Schemes 1997 10 JCRYPTOL Beaver & Feigenbaum & Kilian & Rogaway, Locally Random Reductions: Improvements and Applications 1997 10 JCRYPTOL Itoh & Ohta & Shizuya, A Language-Dependent Cryptographic Primitive 1997 10 JCRYPTOL Dobbertin, RIPEMD with Two-Round Compress Function Is Not Collision-Free 1997 10 JCRYPTOL Kaliski, A Chosen Message Attack on Demytko's Elliptic Curve Cryptosystem 1996 9 JCRYPTOL Impagliazzo & Naor, Efficient Cryptographic Schemes Provably as Secure as Subset Sum 1996 9 JCRYPTOL Franklin & Haber, Joint Encryption and Message-Efficient Secure Computation 1996 9 JCRYPTOL Jackson & Martin & O'Keefe, Ideal Secret Sharing Schemes with Multiple Secrets 1996 9 JCRYPTOL Han & Hemaspaandra, Pseudorandom Generators and the Frequency of Simplicity 1996 9 JCRYPTOL De Santis & Persiano, The Power of Preprocessing in Zero-Knowledge Proofs of Knowledge 1996 9 JCRYPTOL Bellare & Yung, Certifying Permutations: Noninteractive Zero-Knowledge Based on Any Trapdoor Permutation 1996 9 JCRYPTOL Goldreich & Kahan, How To Construct Constant-Round Zero-Knowledge Proof Systems for NP 1996 9 JCRYPTOL Fischer & Micali & Rackoff, A Secure Protocol for the Oblivious Transfer (Extended Abstract) 1996 9 JCRYPTOL Fischer & Wright, Bounds on Secret Key Exchange Using a Random Deal of Cards 1996 9 JCRYPTOL Itoh & Hoshi & Tsujii, A Low Communication Competitive Interactive Proof System for Promised Quadratic Residuosity 1996 9 JCRYPTOL Golic, Correlation Properties of a General Binary Combiner with Memory 1996 9 JCRYPTOL Heys & Tavares, Substitution-Permutation Networks Resistant to Differential and Linear Cryptanalysis 1996 9 JCRYPTOL Bey-Aroya & Biham, Differential Cryptanalysis of Lucifer 1996 9 JCRYPTOL Even & Goldreich & Micali, On-Line/Off-Line Digital Signatures 1995 8 JCRYPTOL Pei, Information-Theoretic Bounds for Authentication Codes and Block Designs 1995 8 JCRYPTOL Dyer & Fenner & Frieze & Thomason, On Key Storage in Secure Networks 1995 8 JCRYPTOL Damgard, Practical and Provably Secure Release of a Secret and Exchange of Signatures 1995 8 JCRYPTOL Yang & Guo, Further Enumerating Boolean Functions of Cryptographic Significance 1995 8 JCRYPTOL Maurer, Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters 1995 8 JCRYPTOL Blackburn & Murphy & Stern, The Cryptanalysis of a Public-Key Implementation of Finite Group Mappings 1995 8 JCRYPTOL Stinson & Massey, An Infinite Class of Counterexamples to a Conjecture Concerning Nonlinear Resilient Functions 1995 8 JCRYPTOL O'Connor, On the Distribution of Characteristics in Bijective Mappings 1995 8 JCRYPTOL Russell, Necessary and Sufficient Conditions for Collision-Free Hashing 1995 8 JCRYPTOL Vanstone & Zuccherato, Short RSA Keys and Their Generation 1995 8 JCRYPTOL Davies & Murphy, Pairs and Triplets of DES S-Boxes 1995 8 JCRYPTOL Nyberg & Knudsen, Provable Security Against a Differential Attack 1995 8 JCRYPTOL Blundo & De Santis & Stinson & Vaccaro, Graph Decompositions and Secret Sharing Schemes 1994 7 JCRYPTOL Qu & Vanstone, Factorizations in the Elementary Abelian p-Group and Their Cryptographic Significance 1994 7 JCRYPTOL O'Connor & Klapper, Algebraic Nonlinearity and Its Applications to Cryptography 1994 7 JCRYPTOL Biham, New Types of Cryptanalytic Attacks Using Related Keys 1994 7 JCRYPTOL O'Connor, An Analysis of a Class of Algorithms for S-Box Construction 1994 7 JCRYPTOL Teng, Functional Inversion and Communication Complexity 1994 7 JCRYPTOL Scheidler & Buchmann & Williams, A Key-Exchange Protocol Using Real Quadratic Fields 1994 7 JCRYPTOL Simmons, Proof of Soundness (Integrity) of Cryptographic Protocols 1994 7 JCRYPTOL Kemmerer & Meadows & Millen, Three Systems for Cryptographic Protocol Analysis 1994 7 JCRYPTOL Goldreich & Oren, Definitions and Properties of Zero-Knowledge Proof Systems 1994 7 JCRYPTOL Klapper, The Vulnerability of Geometric Sequences Based on Fields of Odd Characteristic 1994 7 JCRYPTOL Chor & Gereb-Graus & Kushilevitz, On the Structure of the Privacy Hierarchy 1994 7 JCRYPTOL Murphy & Paterson & Wild, A Weak Cipher that Generates the Symmetric Group 1993 6 JCRYPTOL Orton & Peppard & Tavares, A Design of a Fast Pipelined Modular Multiplier Based on a Diminished-Radix Algorithm 1993 6 JCRYPTOL Menezes & Vanstone, Elliptic Curve Cryptosystems and Their Implementation 1993 6 JCRYPTOL Lenstra & Yacobi, User Impersonation in Key Certification Schemes 1993 6 JCRYPTOL Schrift & Shamir, Universal Tests for Nonuniform Distributions 1993 6 JCRYPTOL Rosenbaum, A Lower Bound on Authentication After Having Observed a Sequence of Messages 1993 6 JCRYPTOL Capocelli & De Santis & Gargano & Vaccaro, On the Size of Shares for Secret Sharing Schemes 1993 6 JCRYPTOL Coppersmith, Modifications to the Number Field Sieve 1993 6 JCRYPTOL Boyar & Lund & Peralta, On the Communication Complexity of Zero-Knowledge Proofs 1993 6 JCRYPTOL Chor & Kushilevitz, Secret Sharing Over Infinite Domains 1993 6 JCRYPTOL Goldreich & Kushilevitz, A Perfect Zero-Knowledge Proof System for a Problem Equivalent to the Discrete Logarithm 1992 5 JCRYPTOL Brickell & Stinson, Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes 1992 5 JCRYPTOL Magliveras & Memon, Algebraic Properties of Cryptosystem PGM 1992 5 JCRYPTOL Phillips & Phillips, Strongly Ideal Secret Sharing Schemes 1992 5 JCRYPTOL Dai, Binary Sequences Derived from ML-Sequences over Rings. I: Periods and Minimal Polynomials 1992 5 JCRYPTOL Maurer, A Universal Statistical Test for Random Bit Generators 1992 5 JCRYPTOL Lloyd, Counting Binary Functions with Certain Cryptographic Properties 1992 5 JCRYPTOL Georgiades, Some Remarks on the Security of the Identification Scheme Based on Permuted Kernels 1992 5 JCRYPTOL Loxton & Khoo & Bird & Seberry, A Cubic RSA Code Equivalent to Factorization 1992 5 JCRYPTOL Bennett & Bessette & Brassard & Salvail & Smolin, Experimental Quantum Cryptography 1992 5 JCRYPTOL Brickell & McCurley, An Interactive Identification Scheme Based on Discrete Logarithms and Factoring 1992 5 JCRYPTOL Evertse & van Heyst, Which New RSA-Signatures Can Be Computed from Certain Given RSA-Signatures? 1992 5 JCRYPTOL Maurer, Conditionally-Perfect Secrecy and a Provably-Secure Randomized Cipher 1992 5 JCRYPTOL Meier & Staffelbach, Correlation Properties of Combiners with Memory in Stream Ciphers 1991 4 JCRYPTOL Schnorr, Efficient Signature Generation by Smart Cards 1991 4 JCRYPTOL Bengio & Brassard & Desmedt & Goutier & Quisquater, Secure Implementation of Identification Systems 1991 4 JCRYPTOL Boyar & Friedl & Lund, Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies 1991 4 JCRYPTOL Koblitz, Elliptic Curve Implementation of Zero-Knowledge Blobs 1991 4 JCRYPTOL Beaver, Secure Multiparty Protocols and Zero-Knowledge Proof Systems Tolerating a Faulty Minority 1991 4 JCRYPTOL Brickell & Davenport, On the Classification of Ideal Secret Sharing Schemes 1991 4 JCRYPTOL Maurer & Massey, Local Randomness in Pseudorandom Sequences 1991 4 JCRYPTOL Naor, Bit Commitment Using Pseudorandomness 1991 4 JCRYPTOL Biham & Shamir, Differential Cryptanalysis of DES-like Cryptosystems 1991 3 JCRYPTOL Lenstra, On the Chor-Rivest Knapsack Cryptosystem 1991 3 JCRYPTOL Micali & Schnorr, Efficient, Perfect Polynomial Random Number Generators 1991 3 JCRYPTOL De Soete, New Bounds and Constructions for Authentication/Secrecy Codes with Splitting 1991 3 JCRYPTOL Kaliski, One-Way Permutations on Elliptic Curves 1991 3 JCRYPTOL Golic & Mihaljevic, A Generalized Correlation Attack on a Class of Stream Ciphers Based on the Levenshtein Distance 1991 3 JCRYPTOL Agnew & Mullin & Onyszchuk & Vanstone, An Implementation for a Fast Public-Key Cryptosystem 1991 3 JCRYPTOL Gaarder & Snekkenes, Applying a Formal Analysis Technique to the CCITT X.509 Strong Two-Way Authentication Protocol 1991 3 JCRYPTOL Haber & Stornetta, How To Time-Stamp a Digital Document 1991 3 JCRYPTOL Matyas, Key Processing with Control Vectors 1991 3 JCRYPTOL Pastor, CRYPTOPOST^TM--A Cryptographic Application to Mail Processing 1990 3 JCRYPTOL Godlewski & Mitchell, Key-Minimal Cryptosystems for Unconditional Secrecy 1990 3 JCRYPTOL Adams & Tavares, The Structured Design of Cryptographically Good S-Boxes 1990 3 JCRYPTOL Merkle, A Fast Software One-Way Hash Function 1990 2 JCRYPTOL Forre, Methods and Instruments for Designing S-Boxes 1990 2 JCRYPTOL Walker, Information-Theoretic Bounds for Authentication Schemes 1990 2 JCRYPTOL Murphy, The Cryptanalysis of FEAL-4 with 20 Chosen Plaintexts 1990 2 JCRYPTOL Mitchell, Enumerating Boolean Functions of Cryptographic Significance 1990 2 JCRYPTOL Boyar & Kurtz & Krentel, A Discrete Logarithm Implementation of Perfect Zero-Knowledge Blobs 1990 2 JCRYPTOL Simmons, A Cartesian Product Construction for Unconditionally Secure Authentication Codes that Permit Arbitration 1990 2 JCRYPTOL Niederreiter, A Combinatorial Approach to Probabilistic Results on the Linear-Complexity Profile of Random Sequences 1990 2 JCRYPTOL Abadi & Feigenbaum, Secure Circuit Evaluation 1990 2 JCRYPTOL Nishimura & Sibuya, Probability To Meet in the Middle 1990 2 JCRYPTOL Stinson, The Combinatorics of Authentication and Secrecy Codes 1990 2 JCRYPTOL Gong & Wheeler, A Matrix Key-Distribution Scheme 1989 1 JCRYPTOL Koblitz, Hyperelliptic Cryptosystems 1989 1 JCRYPTOL Luby & Rackoff, A Study of Password Security 1989 1 JCRYPTOL Meier & Staffelbach, Fast Correlation Attacks on Certain Stream Ciphers 1989 1 JCRYPTOL Boyar, Inferring Sequences Produced by a Linear Congruential Generator Missing Low-Order Bits 1989 1 JCRYPTOL Piper & Walker, Linear Ciphers and Spreads 1988 1 JCRYPTOL Feige & Fiat & Shamir, Zero-Knowledge Proofs of Identity 1988 1 JCRYPTOL McCurley, A Key Distribution System Equivalent to Factoring 1988 1 JCRYPTOL Buchmann & Williams, A Key-Exchange System Based on Imaginary Quadratic Fields 1988 1 JCRYPTOL Stinson, A Construction for Authentication/Secrecy Codes from Certain Combinatorial Designs 1988 1 JCRYPTOL Beauchemin & Brassard, A Generalization of Hellman's Extension to Shannon's Approach to Cryptography 1988 1 JCRYPTOL Tompa & Woll, How to Share a Secret with Cheaters 1988 1 JCRYPTOL Kaliski & Rivest & Sherman, Is the Data Encryption Standard a Group? (Results of Cycling Experiments on DES) 1988 1 JCRYPTOL Stinson, Some Constructions and Bounds for Authentication Codes 1988 1 JCRYPTOL Beauchemin & Brassard & Crepeau & Goutier & Pomerance, The Generation of Random Numbers that Are Probably Prime 1988 1 JCRYPTOL Chaum, The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability 1991 1 JCSOC Bromley, Thinking About Computers and Schools: A Skeptical View 1991 1 JCSOC Rosenberg, Debunking Computer Literacy 1991 1 JCSOC Chapman, The ``Computer Revolution'': Freedom or Empire? 1991 1 JCSOC Hakken, Has There Been a Computer Revolution? An Anthropological View 1991 1 JCSOC Cook, Computers and Rumors of Revolution 1991 1 JCSOC Kling & Iacano, Making a ``Computer Revolution'' 1991 1 JCSOC Lyman, The Revolution of the Artificial Men 1991 1 JCSOC Merritt, Computers and Economic Transformation 1991 1 JCSOC Turkle, Revolutions in Mind: Computers Are Changing the Way We Think 1997 54 JCSS Beeri & Milo, Comparison of Functional and Predicative Query Paradigms 1997 54 JCSS Van den Bussche & Van Gucht, A Semideterministic Approach to Object Creation and Nondeterminism in Database Queries 1997 54 JCSS Papadimitriou & Yannakakis, Tie-Breaking Semantics and Structural Totality 1997 54 JCSS Chaudhuri & Vardi, On the Equivalence of Recursive and Nonrecursive Datalog Programs 1997 54 JCSS Ross & Sagiv, Monotonic Aggregation in Deductive Database 1997 54 JCSS Grahne & Mendelzon & Revesz, Knowledgebase Transformations 1997 54 JCSS van der Meyden, The Complexity of Querying Indefinite Data about Linearly Ordered Domains 1997 54 JCSS Bonner & Imielinski, Reusing and Modifying Rulebases by Predicate Substitution 1997 54 JCSS Karpinski & Macintyre, Polynomial Bounds for VC Dimension of Sigmoidal and General Pfaffian Neural Networks 1997 54 JCSS Koiran, A Weak Version of the Blum, Shub, and Smale Model 1997 54 JCSS Koiran & Sontag, Neural Networks with Quadratic VC Dimension 1997 54 JCSS Turan & Vatan, On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-In 1996 53 JCSS Mitzenmacher, Bounds on the Greedy Routing Algorithm for Array Networks 1996 53 JCSS Schwabe & Sutherland, Improved Parity-Declustered Layouts for Disk Arrays 1996 53 JCSS Reid-Miller, List Ranking and List Scan on the CRAY C90 1996 53 JCSS Ghosh & Muthukrishnan, Dynamic Load Balancing by Random Matchings 1996 53 JCSS Tamaki, Construction of the Mesh and the Torus Tolerating a Large Number of Faults 1996 53 JCSS Leoncini, On the Parallel Complexity of Gaussian Elimination with Pivoting 1996 53 JCSS Halperin & Zwick, An Optimal Randomised Logarithmic Time Connectivity Algorithm for the EREW PRAM 1996 53 JCSS Gibbons & Matias & Ramachandran, Efficient Low-Contention Parallel Algorithms 1996 53 JCSS Meghini & Thanos, An Optimal Predicate Locing Scheduler 1996 53 JCSS Goerdt, A Threshold for Unsatisfiability 1996 53 JCSS Kari & Thierrin, Maximal and Minimal Solutions to Language Equations 1996 53 JCSS Eiter & Gottlob, The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions 1996 53 JCSS Jiang & Li, k One-Way Heads Cannot Do String-Matching 1996 53 JCSS Blair & Lloyd, River Routing with a Generalized Model 1996 53 JCSS Chari & Rohatgi, On Completeness under Random Reductions 1996 53 JCSS Engelfriet & van Oostrom, Regular Description of Context-free Graph Languages 1996 53 JCSS Grzymala-Busse & Than, Partition Triples: A Tool for Reduction of Data Sets 1996 53 JCSS Jain, Program Synthesis in the Presence of Infinite Number of Inaccuracies 1996 53 JCSS Agrawal & Biswas, Polynomial-Time Isomorphism of 1-L-Complete Sets 1996 53 JCSS Papadimitriou, On Limited Nondeterminism and the Complexity of the V-C Dimension 1996 53 JCSS Ogihara & Thierauf & Toda & Watanabe, On Closure Properties of #P in the Context of PF o #P 1996 53 JCSS Hirst & Harel, Taking It to the Limit: On Infinite Variants of NP-Complete Problems 1996 53 JCSS Hemaspaandra & Naik & Ogihara & Selman, P-Selective Sets and Reducing Search to Decision vs Self-Reducibility 1996 53 JCSS Buhrman & Torenvliet, P-Selective Self-Reducible Sets: A New Characterization of P 1996 53 JCSS Dymond & Fich & Nishimura & Ragde & Ruzzo, Pointers versus Arithmetic in PRAMs 1996 53 JCSS Kautz & Miltersen, Relative to a Random Oracle, NP Is Not Small 1996 53 JCSS Tardos, Multi-prover Encoding Schemes and Three-prover Proof Systems 1996 53 JCSS Buhrman & Orponen, Random Strings Make Hard Instances 1996 53 JCSS Agrawal, On the Isomorphism Conjecture for Weak Reducibilities 1996 53 JCSS Compton & Gradel, Logical Definability of Counting Functions 1996 53 JCSS Chang, On the Query Complexity of Clique Size and Maximum Satisfiability 1996 53 JCSS Vikas, An O(n) Algorithm for Abelian p-Group Isomorphism and an O(n log n) Algorithm for Abelian Group Isomorphism 1996 53 JCSS Shallit & Breitbart, Automaticity I: Properties of a Measure of Descriptional Complexity 1996 53 JCSS Baliga & Case, Learnability: Admissible, Co-Finite, and Hypersimple Languages 1996 53 JCSS Drewes, Language Theoretic and Algorithmic Properties of d-dimensional Collages and Patterns in a Grid 1996 53 JCSS Moran & Taubenfeld & Yadin, Concurrent Counting 1996 53 JCSS Sieling, New Lower Bounds and Hierarchy Results for Restricted Branching Programs 1996 53 JCSS Lange & Zeugmann, Incremental Learning from Positive Data 1996 53 JCSS Fich & Impagliazzo & Kapron & King & Kutylowski, Limits on the Power of Parallel Random Access Machines with Weak Forms of Write Conflict Resolution 1996 53 JCSS Gao, Towards Structured Parallel Computing on Architecture-Independent Parallel Algorithm Design for Distributed-Memory Architectures 1996 53 JCSS Gabow & Xu, Efficient Theoretic and Practical Algorithms for Linear Matroid Intersection Problems 1996 53 JCSS Dietz, A Space Efficient Variant of Path Copying for Partially Persistent Sorted Sets 1996 52 JCSS Jain & Sharma, The Intrinsic Complexity of Language Identification 1996 52 JCSS Kummer & Stephan, Inclusion Problems in Parallel Learning and Games 1996 52 JCSS Bshouty & Cleve & Gavalda & Kannan & Tamon, Oracles and Queries That Are Sufficient for Exact Learning 1996 52 JCSS Bartlett & Long & Williamson, Fat-Shattering and the Learnability of Real-Valued Functions 1996 52 JCSS Dobkin & Gunopulos & Maass, Computing the Maximum Bichromatic Discrepancy, with Applications to Computer Graphics and Machine Learning 1996 52 JCSS Frazier & Goldman & Mishra & Pitt, Learning from a Consistently Ignorant Teacher 1996 52 JCSS Wong, Normal Forms and Conservative Extension Properties for Query Languages over Collection Types 1996 52 JCSS Morishita, An Extension of Van Gelder's Alternating Fixpoint to Magic Programs 1996 52 JCSS Hirst & Harel, Completeness Results for Recursive Data Bases 1996 52 JCSS Van den Bussche & van Gucht & Vossen, Reflective Programming in the Relational Algebra 1996 52 JCSS Haas & Naughton & Seshadri & Swami, Selectivity and Cost Estimation for Joins Based on Random Sampling 1996 52 JCSS Grumbach & Milo, Towards Tractable Algebras for Bags 1996 52 JCSS Kanellakis & Ramaswamy, Indexing for Data Models with Constraints and Classes 1996 52 JCSS Schapire & Sellie, Learning Sparse Multivariate Polynomials over a Field with Queries and Counterexamples 1996 52 JCSS Kummer & Stephan, On the Structure of Degrees of Inferability 1996 52 JCSS Simon, General Bounds on the Number of Examples Needed for Learning Probabilistic Concepts 1996 52 JCSS Goldman & Mathias, Teaching a Smarter Learner 1996 52 JCSS Bshouty & Goldman & Hancock & Matar, Asking Questions to Minimize Errors 1996 52 JCSS Kshemkalyani, Temporal Interactions of Intervals in Distributed Systems 1996 52 JCSS Amir & Benson & Farach, Let Sleeping Files Lie: Pattern Matching in Z-Compressed Files 1996 52 JCSS Schuler & Yamakami, Structural Average Case Complexity 1996 52 JCSS Vaishnavi, On k-Dimensional Balanced Binary Trees 1996 52 JCSS Gibson, Exact Classification with Two-Layer Neural Nets 1996 52 JCSS Andries & Paredaens, On Instance-Completeness for Database Query Languages involving Object Creation 1996 52 JCSS Fang & Venkatesh, Learning Binary Perceptrons Perfectly Efficiently 1996 52 JCSS Eppstein & Galil & Italiano & Spencer, Separator Based Sparsification. I. Planarity Testing and Minimum Spanning Trees 1996 52 JCSS Baker, Parameterized Pattern Matching: Algorithms and Applications 1996 52 JCSS Nisan & Zuckerman, Randomness is Linear in Space 1996 52 JCSS Pippenger, Self-Routing Superconcentrators 1996 52 JCSS Cherubini & San Pietro, A Polynomial-Time Parsing Algorithm for K-Depth Languages 1996 52 JCSS Chen, On the Structural Properties of the Set of Fixpoints for Nondeterministic Recursive Definitions 1996 52 JCSS La Poutre, Lower Bounds for the Union-Find and the Split-Find Problem on Pointer Machines 1996 52 JCSS Krishnamurthy & Ramakrishnan & Shmueli, A Framework for Testing Safety and Effective Computability 1996 52 JCSS Libkin & Wong, Semantic Representations and Query Languages for Or-Sets 1996 52 JCSS Astesiano & Zucca, A Free Construction of Dynamic Terms 1996 52 JCSS Willard, Applications of Range Query Theory to Relational Data Base Join and Selection Operations 1996 52 JCSS Ehrenfeucht & Engelfriet & Rozenberg, Finite Languages for the Representation of Finite Graphs 1996 52 JCSS Honkala, On Parikh Slender Languages and Power Series 1996 52 JCSS Fortnow & Yamakami, Generic Separations 1995 51 JCSS Bartal & Fiat & Rabani, Competitive Algorithms for Distributed Data Management 1995 51 JCSS Bartal & Fiat & Karloff & Vohra, New Algorithms for an Ancient Scheduling Problem 1995 51 JCSS Blum & Rudich, Fast Learning of k-Term DNF Formulas with Queries 1995 51 JCSS Goodrich, Planar Separators and Parallel Polygon Triangulation 1995 51 JCSS Kahn & Kim, Entropy and Sorting 1995 51 JCSS Seidel, On the All-Pairs-Shortest-Path Problem in Unweighted Undirected Graphs 1995 51 JCSS Imielinski & van der Meyden & Vadaparty, Complexity Tailored Design: A New Design Methodology for Databases With Incomplete Information 1995 51 JCSS Abiteboul & Kanellakis & Ramaswamy & Waller, Method Schemas 1995 51 JCSS Seo & Lim & Eun, On Comparison and Analysis of Algorithms for Multiplication in GF(2^m) 1995 51 JCSS Adamek & Nelson & Reiterman, Continuous Algebras Revisited 1995 51 JCSS Skodinis & Wanke, Emptiness Problems of eNCE Graph Languages 1995 51 JCSS Vela & Bahamonde, The Best Nondeterministic Representations of Finite Orderings 1995 51 JCSS Ben-Asher & Newman, Decision Trees with Boolean Threshold Queries 1995 51 JCSS Asano, An O(n log log n) Time Algorithm for Constructing a Graph of Maximum Connectivity with Prescribed Degrees 1995 51 JCSS Creignou, A Dichotomy Theorem for Maximum Generalized Satisfiability Problems 1995 51 JCSS Chomicki & Niwinski, On the Feasibility of Checking Temporal Integrity Constraints 1995 51 JCSS Seshadri & Naughton, On the Expected Size of Recursive Datalog Queries 1995 51 JCSS Grumbach & Vianu, Tractable Query Languages for Complex Object Databases 1995 51 JCSS Johnson & Raab, A Tight Upper Bound on the Benefits of Replica Control Protocols 1995 51 JCSS Afrati & Cosmadakis & Yannakakis, On Datalog vs Polynomial Time 1995 51 JCSS Helm & Marriott & Odersky, Spatial Query Optimization: From Boolean Constraints to Range Queries 1995 51 JCSS Garcia-Molina & Salem, Non-deterministic Queue Operations 1995 51 JCSS Beeri & Milo, Subtyping in OODBs 1995 51 JCSS Ganguly & Greco & Zaniolo, Extrema Predicates in Deductive Databases 1995 51 JCSS Feder & Motwani, Clique Partitions, Graph Compression and Speeding-Up Algorithms 1995 51 JCSS Baliga & Case & Jain, Language Learning with Some Negative Information 1995 51 JCSS Cole & Zajicek, The Expected Advantage of Asynchrony 1995 51 JCSS Kabanza & Stevenne & Wolper, Handling Infinite Temporal Data 1995 51 JCSS Lipton & Naughton, Query Size Estimation by Adaptive Sampling 1995 51 JCSS Kanellakis & Kuper & Revesz, Constraint Query Languages 1995 51 JCSS Agrawal & El Abbadi, Constrained Shared Locks for Increasing Concurrency in Databases 1995 51 JCSS Schlipf, The Expressive Powers of the Logic Programming Semantics 1995 51 JCSS Saraiya, On the Efficiency of Transforming Database Logic Programs 1995 51 JCSS Kolaitis & Vardi, On the Expressive Power of Datalog: Tools and a Case Study 1995 50 JCSS Chang & Kadin & Rohatgi, On Unique Satisfiability and the Threshold Behavior of Randomized Reductions 1995 50 JCSS Barrington & Straubing, Superlinear Lower Bounds for Bounded-Width Branching Programs 1995 50 JCSS Bovet & Crescenzi & Silvestri, Complexity Classes and Sparse Oracles 1995 50 JCSS Kolaitis & Thakur, Approximation Properties of NP Minimization Classes 1995 50 JCSS Gupta, Closure Properties and Witness Reduction 1995 50 JCSS Grigni & Sipser, Monotone Separation of Logarithmic Space from Logarithmic Depth 1995 50 JCSS Beaudry & McKenzie, Circuits, Matrices, and Nonassociative Computation 1995 50 JCSS Green & Kobler & Regan & Schwentick & Toran, The Power of the Middle Bit of a #P Function 1995 50 JCSS Gavalda, Bounding the Complexity of Advice Functions 1995 50 JCSS Rohatgi, Saving Queries with Randomness 1995 50 JCSS Saluja & Subrahmanyam & Thakur, Descriptive Complexity of #P Functions 1995 50 JCSS Condon & Ladner, Interactive Proof Systems with Polynomially Bounded Strategies 1995 50 JCSS Bshouty & Hancock & Hellerstein, Learning Boolean Read-Once Formulas over Generalized Bases 1995 50 JCSS Mansour, An O(n^log log n) Learning Algorithm for DNF under the Uniform Distribution 1995 50 JCSS Helmbold & Warmuth, On Weak Learning 1995 50 JCSS Daley & Kalyanasundaram & Velauthapillai, Breaking the Probability 1/2 Barrier in FIN-Type Learning 1995 50 JCSS Kharitonov, Cryptographic Lower Bounds for Learnability of Boolean Functions on the Uniform Distribution 1995 50 JCSS Beigel & Reingold & Spielman, PP Is Closed under Intersection 1995 50 JCSS Matousek, Approximations and Optimal Geometric Divide-and-Conquer 1995 50 JCSS Yannakakis & Lee, Testing Finite State Machines: Fault Detection 1995 50 JCSS Leighton & Makedon & Plotkin & Stein & Tardos & Tragoudas, Fast Approximation Algorithms for Multicommodity Flow Problems 1995 50 JCSS Borodin & Irani & Raghavan & Schieber, Competitive Paging with Locality of Reference 1995 50 JCSS Gabow, A Matroid Approach to Finding Edge Connectivity and Packing Arborescences 1995 50 JCSS Kaltofen, Effective Noether Irreducibility Forms and Applications 1995 50 JCSS Babai & Cooperman & Finkelstein & Luks & Seress, Fast Monte Carlo Algorithms for Permutation Groups 1995 50 JCSS Abiteboul & Vianu, Computing with First-Order Logic 1995 50 JCSS Angluin & Kharitonov, When Won't Membership Queries Help? 1995 50 JCSS Kalpakis & Yesha, On the Power of the Linear Array Architecture for Performing Tree-Structured Computations 1995 50 JCSS Karhumaki & Plandowski & Rytter, Polynomial Size Test Sets for Context-Free Languages 1995 50 JCSS Goldman & Kearns, On the Complexity of Teaching 1995 50 JCSS Blum & Hellerstein & Littlestone, Learning in the Presence of Finitely or Infinitely Many Irrelevant Attributes 1995 50 JCSS Kinber & Smith & Velauthapillai & Wiehagen, On Learning Multiple Concepts in Parallel 1995 50 JCSS Jiang & Salomaa & Salomaa & Yu, Decision Problems for Patterns 1995 50 JCSS Parberry, Load Sharing with Parallel Priority Queues 1995 50 JCSS Ben-David & Cesa-Bianchi & Haussler & Long, Characterizations of Learnability for Classes of {0,...,n}-Valued Functions 1995 50 JCSS Sutner, On the Computational Complexity of Finite Cellular Automata 1995 50 JCSS Nishimura, Efficient Asynchronous Simulation of a Class of Synchronous Parallel Algorithms 1995 50 JCSS Hoffgen & Simon & Van Horn, Robust Trainability of Single Neurons 1995 50 JCSS Dingle & Sudborough, Single Row Routing on Multilayers 1995 50 JCSS Siegelmann & Sontag, On the Computational Power of Neural Nets 1995 50 JCSS Wang & Belanger, On the NP-Isomorphism Problem with Respect to Random Instances 1995 50 JCSS Ito & Weddell, Implication Problems for Functional Constraints on Databases Supporting Complex Objects 1994 49 JCSS Mulmuley, An Efficient Algorithm for Hidden Surface Removal, II 1994 49 JCSS Berger & Rompel & Shor, Efficient NC Algorithms for Set Cover with Applications to Learning and Geometry 1994 49 JCSS Motwani & Naor & Naor, The Probabilistic Method Yields Deterministic Parallel Algorithms 1994 49 JCSS Ramachandran & Reif, Planarity Testing in Parallel 1994 49 JCSS Ajtai & Gurevich, Datalog vs First-Order Logic 1994 49 JCSS Fulk & Jain & Osherson, Open Problems in ``Systems That Learn'' 1994 49 JCSS Cai & Hartmanis, On Hausdorff and Topological Dimensions of the Kolmogorov Complexity of the Real Line 1994 49 JCSS Qian, Another Look at Parameterization for Order-Sorted Algebraic Specifications 1994 49 JCSS Boyar & Larsen, Efficient Rebalancing of Chromatic Search Trees 1994 49 JCSS Levene & Loizou, The Nested Universal Relation Data Model 1994 49 JCSS Durand, The Surjectivity Problem for 2D Cellular Automata 1994 49 JCSS Ito & Weddell, Implication Problems for Functional Constraints on Databases Supporting Complex Objects 1994 49 JCSS Fellows & Langston, On Search, Decision, and the Efficiency of Polynomial-Time Algorithms 1994 49 JCSS Nisan & Wigderson, Hardness vs. Randomness 1994 49 JCSS Nishida & Kobuchi, Invariant Sets for Substitution 1994 49 JCSS Krishnakumar, On Computing Serial Dependency Relations 1994 49 JCSS Case & Jain & Sharma, Vacillatory Learning of Nearly Minimal Size Grammars 1994 49 JCSS Amir & Farach & Galil & Giancarlo & Park, Dynamic Dictionary Matching 1994 49 JCSS Kaminski, A Branching Time Logic with Past Operators 1994 49 JCSS Karchmer & Newman & Saks & Wigderson, Non-deterministic Communication Complexity with Few Witnesses 1994 49 JCSS Engelfriet & Vogler, The Translation Power of Top-Down Tree-to-Graph Transducers 1994 49 JCSS Kozen & Palsberg & Schwartzbach, Efficient Inference of Partial Types 1994 49 JCSS Kantabutra, A Linear-Time Near-Optimum-Length Triangulation Algorithm for Convex Polygons 1994 49 JCSS You & Yuan, A Three-Valued Semantics for Deductive Databases and Logic Programs 1994 49 JCSS Salomaa & Yu, Measures of Nondeterminism for Pushdown Automata 1994 49 JCSS Obradovic & Parberry, Learning with Discrete Multivalued Neurons 1994 49 JCSS Sugihara, Robust Gift Wrapping for the Three-Dimensional Convex Hull 1994 49 JCSS Goldberg, Listing Graphs That Satisfy First-Order Sentences 1994 49 JCSS Toda, Simple Characterizations of P(#P) and Complete Problems 1994 49 JCSS Sato, Group Structured Linear Cellular Automata over Z_m 1994 49 JCSS Chang & Chor & Goldreich & Hartmanis & Hastad & Ranjan & Rohatgi, The Random Oracle Hypothesis Is False 1994 49 JCSS Hattori, Time-Extraction for Temporal Logic--Logic Programming and Local Process Time 1994 49 JCSS Wanke, The Complexity of Connectivity Problems on Context-Free Graph Languages 1994 49 JCSS Pippenger, Symmetry in Self-Correcting Cellular Automata 1994 49 JCSS Jain & Sharma, Characterizing Language Identification by Standardizing Operations 1994 49 JCSS Raghavan, Bounded Degree Graph Inference from Walks 1994 49 JCSS Fachini & Monti, A Kleene-like Characterization of Languages Accepted by Systolic Tree Automata 1994 48 JCSS Bern & Eppstein & Gilbert, Provably Good Mesh Generation 1994 48 JCSS Fiat & Rabani & Ravid, Competitive k-Server Algorithms 1994 48 JCSS Neff, Specified Precision Polynomial Root Isolation Is in NC 1994 48 JCSS Kearns & Schapire, Efficient Distribution-Free Learning of Probabilistic Concepts 1994 48 JCSS Papadimitriou, On the Complexity of the Parity Argument and Other Inefficient Proofs of Existence 1994 48 JCSS Fredman & Willard, Trans-dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths 1994 48 JCSS Li, Learning Fixed Point Patterns by Recurrent Networks 1994 48 JCSS Berkman & Vishkin, Finding Level-Ancestors in Trees 1994 48 JCSS Dietzfelbinger & Kutylowski & Reischuk, Exact Lower Time Bounds for Computing Boolean Functions on CREW PRAMs 1994 48 JCSS Cadoli & Lenzerini, The Complexity of Propositional Closed World Reasoning and Circumscription 1994 48 JCSS Benedek & Itai, Nonuniform Learnability 1994 48 JCSS Homer & Longpre, On Reductions of NP Sets to Sparse Sets 1994 48 JCSS Stinson, Combinatorial Techniques for Universal Hashing 1994 48 JCSS Siu & Dembo & Kailath, On the Perceptron Learning Algorithm on Data with High Precision 1994 48 JCSS Selman, A Taxonomy of Complexity Classes of Functions 1994 48 JCSS Gereb-Graus & Li, Three One-Way Heads Cannot Do String Matching 1994 48 JCSS Hegner, Unique Complements and Decompositions of Database Schemata 1994 48 JCSS Engelfriet & Heyker, Hypergraph Languages of Bounded Degree 1994 48 JCSS Blelloch & Little, Parallel Solutions to Geometric Problems in the Scan Model of Computation 1994 48 JCSS Fenner & Fortnow & Kurtz, Gap-Definable Counting Classes 1994 48 JCSS Kari, Reversibility and Surjectivity Problems of Cellular Automata 1994 48 JCSS Cai & Condon & Lipton, PSPACE Is Provable by Two Provers in One Round 1994 48 JCSS Alon & Pudlak, Superconcentrators of Depth 2 and 3; Odd Levels Help (Rarely) 1993 47 JCSS Hastad & Schrift & Shamir, The Discrete Logarithm Modula a Composite Hides O(n) Bits 1993 47 JCSS Szegedy, Functions with Bounded Symmetric Communication Complexity, Programs over Commutative Monoids, and ACC 1993 47 JCSS Fredman & Willard, Surpassing the Information Theoretic Bound with Fusion Trees 1993 47 JCSS Mulmuley, Output Sensitive and Dynamic Constructions of Higher Order Voronoi Diagrams and Levels in Arrangements 1993 47 JCSS Kao & Klein, Towards Overcoming the Transitive-Closure Bottleneck: Efficient Parallel Algorithms for Planar Digraphs 1993 47 JCSS Cypher & Plaxton, Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related Computers 1993 47 JCSS Blum & Luby & Rubinfeld, Self-Testing/Correcting with Applications to Numerical Problems 1993 47 JCSS Luby, Removing Randomness in Parallel Computation without a Processor Penalty 1993 47 JCSS McAllester & Panangaden & Shanbhogue, Nonexpressibility of Fairness and Signaling 1993 47 JCSS Lovasz & Saks, Communication Complexity and Combinatorial Lattice Theory 1993 47 JCSS Komlos & Paturi, Effect of Connectivity in an Associative Memory Model 1993 47 JCSS Cohen & Wolfson, Why a Single Parallelization Strategy Is Not Enough in Knowledge Bases 1993 47 JCSS Johnson & Shasha, B-Trees with Inserts and Deletes: Why Free-at-Empty Is Better Than Merge-at-Half 1993 47 JCSS Kifer & wu, A Logic for Programming with Complex Objects 1993 47 JCSS Hull & Su, Algebraic and Calculus Query Languages for Recursively Typed Complex Objects 1993 47 JCSS Weihl, The Impact of Recovery on Concurrency Control 1993 47 JCSS Van Gelder, The Alternating Fixpoint of Logic Programs with Negation 1993 47 JCSS Ramakrishnan & Sagiv & Ullman & Vardi, Logical Query Optimization by Proof-Tree Transformation 1993 46 JCSS Cohen & Perrin & Pin, On the Expressive Power of Temporal Logic 1993 46 JCSS Ogiwara & Hemachandra, A Complexity Theory for Feasible Closure Properties 1993 46 JCSS Ravi & Lloyd, Graph Theoretic Analysis of PLA Folding Heuristics 1993 46 JCSS Goldsmith & Joseph & Young, A Note on Bi-immunity and p-Closeness of p-Cheatable Sets in P/Poly 1993 46 JCSS Hemachandra & Hoene, Collapsing Degrees via Strong Computation 1993 46 JCSS Bloom & Esik, Matrix and Matricial Iteration Theories, Part I 1993 46 JCSS Bloom & Esik, Matrix and Matricial Iteration Theories, Part II 1993 46 JCSS Hajnal & Maass & Pudlak & Szegedy & Turan, Threshold Circuits of Bounded Depth 1993 46 JCSS Dassow & Jurgensen, Deterministic Soliton Automata with at Most One Cycle 1993 46 JCSS Venkatesh, Directed Drift: A New Linear Threshold Algorithm for Learning Binary Weights On-Line 1993 46 JCSS Courcelle & Engelfriet & Rozenberg, Handle-Rewriting Hypergraph Grammars 1993 46 JCSS Howell & Rosier & Yen, Normal and Sinkless Petri Nets 1993 46 JCSS Jansen, The Interconnection Problem 1993 46 JCSS Ziarko, Variable Precision Rough Set Model 1993 46 JCSS Janssens & Lens & Rozenberg, Computation Graphs for Actor Grammars 1993 46 JCSS Watanabe & Nakamura, A Minimum 3-Connectivity Augmentation of a Graph 1992 45 JCSS Regan, Minimum-Complexity Pairing Functions 1992 45 JCSS Lam & Tiwari & Tompa, Trade-offs between Communication and Space 1992 45 JCSS Weil, Closure of Varieties of Languages under Products with Counter 1992 45 JCSS Bettayeb & Miller & Sudborough, Embedding Grids into Hypercubes 1992 45 JCSS Carlstrom, Foreground Automata 1992 45 JCSS Downey, Nondiamond Theorems for Polynomial Time Reducibility 1992 45 JCSS Krob, Models of a K-Rational Identity System 1992 45 JCSS Yuan & Ozsoyoglu, Design of Desirable Relational Database Schemes 1992 45 JCSS Obradovic & Parberry, Computing with Discrete Multivalued Neurons 1992 45 JCSS Schmid & Blieberger, Some Investigations of FCFS Scheduling in Hard Real Time Applications 1992 45 JCSS Birget, Positional Simulation of Two-Way Automata: Proof of a Conjecture of R. Kannan and Generalizations 1992 45 JCSS Borodin & Ruzzo & Tompa, Lower Bounds on the Length of Universal Traversal Sequences 1992 45 JCSS Babai & Nisan & Szegedy, Multiparty Protocols, Pseudorandom Generators for Logspace, and Time-Space Trade-offs 1992 45 JCSS Feder, A New Fixed Point Approach for Stable Networks and Stable Marriages 1992 45 JCSS Wang & Blum, Discrete-Time versus Continuous-Time Models of Neural Networks 1992 45 JCSS Sontag, Feedforward Nets for Interpolation and Classification 1992 45 JCSS Honsell & Ronchi Della Rocca, An Approximation Theorem for Topological Lambda Models and the Topological Incompleteness of Lambda Calculus 1992 45 JCSS Gyssens & Van Gucht, The Powerset Algebra as a Natural Tool to Handle Nested Database Relations 1992 45 JCSS Bar-Yehuda & Goldreich & Itai, On the Time-Complexity of Broadcast in Multi-hop Radio Networks: An Exponential Gap between Determinism and Randomization 1992 45 JCSS Stewart, Using the Hamiltonian Path Operator to Capture NP 1992 44 JCSS Lindell, The Invariant Problem for Binary String Structures and the Parallel Complexity Theory of Queries 1992 44 JCSS Klapper, Distributed Event Algebras 1992 44 JCSS Kaminski & Pinter, Finite Automata on Directed Graphs 1992 44 JCSS Silva & Murata, B-Fairness and Structural B-Fairness in Petri Net Models of Concurrent Systems 1992 44 JCSS Barrington & Compton & Straubing & Therien, Regular Languages in NC^1 1992 44 JCSS Watanabe, On Polynomial Time One-Truth-Table Reducibility to a Sparse Set 1992 44 JCSS Maass & Slaman, The Complexity Types of Computable Sets 1992 44 JCSS Ben-David & Chor & Goldreich & Luby, On the Theory of Average Case Complexity 1992 44 JCSS Lutz, Almost Everywhere High Nonuniform Complexity 1992 44 JCSS Feige & Shamir, Multi-oracle Interactive Protocols with Constant Space Verifiers 1992 44 JCSS Kobler & Schoning & Toda & Toran, Turing Machines with Few Accepting Computations and Low Sets for PP 1992 44 JCSS Homer & Selman, Oracles for Structural Properties: The Isomorphism Problem and Public-Key Cryptography 1992 44 JCSS Mayr & Subramanian, The Complexity of Circuit Value and Network Stability 1992 44 JCSS Lam & Ruzzo, Results on Communication Complexity Classes 1992 44 JCSS Li & Vitanyi, Inductive Reasoning and Kolmogorov Complexity 1992 44 JCSS Chan & Atzeni, Connection-Trap-Free Database Schemes 1992 44 JCSS Diaconescu, Contraction Algebras and Unification of (Infinite) Terms 1992 44 JCSS Muller & Preparata, Parallel Restructuring and Evaluation of Expressions 1992 44 JCSS Lengauer & Wagner, The Correlation between the Complexities of the Nonhierarchical and Hierarchical Versions of Graph Problems 1992 44 JCSS Dahlhaus & Karpinski, Perfect Matching for Regular Graphs Is AC^0-Hard for the General Matching Problem 1992 44 JCSS Ragde, Processor-Time Tradeoffs in PRAM Simulations 1992 44 JCSS Takahashi, Self-Similarity of Linear Cellular Automata 1992 44 JCSS Sandhu, Undecidability of Safety for the Schematic Protection Model with Cyclic Creates 1992 44 JCSS Herbst, Some Remarks on a Theorem of Sakarovitch 1991 43 JCSS Fiat & Munro & Naor & Schaffer & Schmidt & Siegel, An Implicit Data Structure for Searching a Multikey Table in Logarithmic Time 1991 43 JCSS Papadimitriou & Yannakakis, Optimization, Approximation, and Complexity Classes 1991 43 JCSS Yannakakis, Expressing Combinatorial Optimization Problems by Linear Programs 1991 43 JCSS Fenton & Whitty, Program Structures: Some New Characterisations 1991 43 JCSS Ito & Jurgensen & Shyr & Thierrin, Outfix and Infix Codes and Related Classes of Languages 1991 43 JCSS Li, On Computing Decision Regions with Neural Nets 1991 43 JCSS Abrahamson, Time-Space Tradeoffs for Algebraic Problems on General Sequential Machines 1991 43 JCSS Alon & Bar-Noy & Linial & Peleg, A Lower Bound for Radio Broadcast 1991 43 JCSS Ibarra & Jiang, Learning Regular Languages from Counterexamples 1991 43 JCSS Krizanc, Oblivious Routing with Limited Buffer Capacity 1991 43 JCSS Engelfriet & Heyker, The String Generating Power of Context-Free Hypergraph Grammars 1991 43 JCSS Stifter, An Axiomatic Approach to Voronoi-Diagrams in 3D 1991 43 JCSS Venkateswaran, Properties That Characterize LOGCFL 1991 43 JCSS Hadzilacos & Hadzilacos, Transaction Synchronisation in Object Bases 1991 43 JCSS Herlihy & Weihl, Hybrid Concurrency Control for Abstract Data Types 1991 43 JCSS Abiteboul & Vianu, Datalog Extensions for Database Queries and Updates 1991 43 JCSS Kolaitis & Papadimitriou, Why Not Negation by Fixpoint? 1991 43 JCSS Haddad & Naughton, A Counting Algorithm for a Cyclic Binary Query 1991 43 JCSS Buneman & Davidson & Watters, A Semantics for Complex Objects and Approximate Answers 1991 43 JCSS Hull & Su, On the Expressive Power of Database Queries with Intermediate Types 1991 42 JCSS Duris & Galil, Two Lower Bounds in Asynchronous Distributed Computation 1991 42 JCSS Yao, Lower Bounds to Randomized Algorithms for Graph Properties 1991 42 JCSS Kanevsky & Ramachandran, Improved Algorithms for Graph Four-Connectivity 1991 42 JCSS Ranade, How to Emulate Shared Memory 1991 42 JCSS Aiello & Hastad, Statistical Zero-Knowledge Languages Can Be Recognized in Two Rounds 1991 42 JCSS Gurevich, Average Case Completeness 1991 42 JCSS Giovannetti & Levi & Moiso & Palamidessi, Kernel-LEAF: A Logic plus Functional Language 1991 42 JCSS Otto & Wrathall, Overlaps in Free Partially Commutative Monoids 1991 42 JCSS Naughton, One-Sided Recursions 1991 42 JCSS Garzon & Zalcstein, On Isomorphism Testing of a Class of 2-Nilpotent Groups 1991 42 JCSS Edelsbrunner & Guibas, Corrigendum: Topologically Sweeping an Arrangement 1991 42 JCSS Broy & Lengauer, On Denotational versus Predictive Semantics 1991 42 JCSS Bach, Realistic Analysis of Some Randomized Algorithms 1991 42 JCSS You, Unification Modulo an Equality Theory for Equational Logic Programming 1991 42 JCSS Beigel, Relativized Counting Classes: Relations among Thresholds, Parity, and Mods 1991 42 JCSS Bodlaender, Some Lower Bound Results for Decentralized Extrema-Finding in Rings of Processors 1991 42 JCSS Li & Yesha, Resource Bounds for Parallel Computation of Threshold and Symmetric Functions 1990 41 JCSS Barrington & Immerman & Straubing, On Uniformity within NC^1 1990 41 JCSS Lutz, Pseudorandom Sources for BPP 1990 41 JCSS Shinoda & Slaman, On the Theory of the PTIME Degrees of the Recursive Sets 1990 41 JCSS Balcazar, Self-Reducibility 1990 41 JCSS Longpre & Young, Cook Reducibility Is Faster than Karp Reducibility in NP 1990 41 JCSS Halstenberg & Reischuk, Relations between Communication Complexity Classes 1990 41 JCSS Pitt & Warmuth, Prediction-Preserving Reducibility 1990 41 JCSS Beeri & Kanellakis & Bancilhon & Ramakrishnan, Bounds on the Propagation of Selection into Logic Programs 1990 41 JCSS Abiteboul & Vianu, Procedural Languages for Database Queries and Updates 1990 41 JCSS Bermudez & Schimpf, Practical Arbitrary Lookahead LR Parsing 1990 41 JCSS Hemachandra & Rudich, On the Complexity of Ranking 1990 41 JCSS Dechter, Decomposing a Relation into a Tree of Binary Relations 1990 41 JCSS Atzeni & Cristina De Bernardis, A New Interpretation for Null Values in the Weak Instance Model 1990 41 JCSS Kuper, Logic Programming with Sets 1990 41 JCSS Fekete & Lynch & Merritt & Weihl, Commutativity-Based Locking for Nested Transactions 1990 40 JCSS Kim, Picture Iteration and Picture Ambiguity 1990 40 JCSS Engelfriet & Leih & Welzl, Boundary Graph Grammars with Dynamic Edge Relabeling 1990 40 JCSS Ginsburg & Tian, Input-Dependent-Only Object Histories 1990 40 JCSS Aalbersberg & Engelfriet & Rozenberg, The Complexity of Regular DNLC Graph Languages 1990 40 JCSS Ozsoyoglu & Su, On Inference Control in Semantic Data Models for Statistical Databases 1990 40 JCSS Fulk, A Note on A. E. h-Complex Functions 1990 40 JCSS Flannery & Martin, The Hoare and Smyth Power Domain Constructors Commute under Composition 1990 40 JCSS Grandjean, First-Order Spectra with One Variable 1990 40 JCSS Dassow & Jurgensen, Soliton Automata 1990 40 JCSS Gruska, Genomorphisms of Semi-modular Lattices 1990 40 JCSS Main & Rozenberg, Edge-Label Controlled Graph Grammars 1990 40 JCSS Poigne, Parametrization for Order-Sorted Algebraic Specification 1990 40 JCSS Lausen & Soisalon-Soininen & Widmayer, On the Power of Safe Locking 1990 40 JCSS Yap, A Geometric Consistency Theorem for a Symbolic Perturbation Scheme 1990 40 JCSS Motwani & Raghunathan & Saran, Covering Orthogonal Polygons with Star Polygons: The Perfect Graph Approach 1990 40 JCSS Bern, Hidden Surface Removal for Rectangles 1990 40 JCSS Dobkin & Silver, Applied Computational Geometry: Towards Robust Solutions of Basic Problems 1990 40 JCSS Mitchell, On Maximum Flows in Polyhedral Domains 1989 39 JCSS Ambos-Spies, Honest Polynomial Time Reducibilities and the P =? NP Problem 1989 39 JCSS Kadin, P^NP[O(log n)] and Sparse Turing-Complete Sets for NP 1989 39 JCSS Hemachandra, The Strong Exponential Hierarchy Collapses 1989 39 JCSS Greenlaw, Ordered Vertex Removal and Subgraph Problems 1989 39 JCSS America & Rutten, Solving Reflexive Domain Equations in a Category of Complete Metric Spaces 1989 39 JCSS Robinson & Goldman, The Set Coincidence Game: Complexity, Attainability, and Symmetric Strategies 1989 39 JCSS Guibas & Hershberger, Optimal Shortest Path Queries in a Simple Polygon 1989 39 JCSS Dadoun & Kirkpatrick, Parallel Construction of Subdivision Hierarchies 1989 39 JCSS Culberson & Reckhow, Orthogonally Convex Coverings of Orthogonal Polygons without Holes 1989 39 JCSS Chew, There Are Planar Graphs Almost as Good as the Complete Graph 1989 39 JCSS Suri, Computing Geodesic Furthest Neighbors in Simple Polygons 1989 39 JCSS Sugihara, On Finite-Precision Representations of Geometric Objects 1989 39 JCSS Chung & Ravikumar, Strong Nondeterministic Turing Reduction--A Technique for Proving Intractability 1989 39 JCSS Abadi & Feigenbaum & Kilian, On Hiding Information from an Oracle 1989 39 JCSS Leivant, Descriptive Characterizations of Computational Complexity 1989 39 JCSS Schoening, Probabilistic Complexity Classes and Lowness 1989 39 JCSS Allender, Some Consequences of the Existence of Pseudorandom Generators 1989 38 JCSS Hromkovic & Inoue & Takanami, Lower Bounds for Language Recognition on Two-Dimensional Alternating Multihead Machines 1989 38 JCSS Ibarra & Jiang & Chang, On Iterative and Cellular Tree Arrays 1989 38 JCSS Fle, Serialization of Concurrent Programs 1989 38 JCSS Pan & Reif, Fast and Efficient Solution of Path Algebra Problems 1989 38 JCSS Rich, Positive Relativizations of the P =? NP Problem 1989 38 JCSS Mannila & Raiha, Automatic Generation of Test Data for Relational Queries 1989 38 JCSS Naughton, Data Independent Recursion in Deductive Databases 1989 38 JCSS Bidoit & Hull, Minimalism, Justification and Non-monotonicity in Deductive Databases 1989 38 JCSS Bancilhon & Khoshafian, A Calculus for Complex Objects 1989 38 JCSS Afrati & Papadimitriou & Papageorgiou & Roussou & Sagiv & Ullman, On the Convergence of Query Evaluation 1989 38 JCSS Hadzilacos & Yannakakis, Deleting Completed Transactions 1989 38 JCSS Sagiv & Shmueli, A Characterization of Finite fd-Acyclicity 1989 38 JCSS Olken & Rotem, Rearranging Data to Maximize the Efficiency of Compression 1989 38 JCSS Coffman & Leighton, A Provably Efficient Algorithm for Dynamic Storage Allocation 1989 38 JCSS Yannakakis, Embedding Planar Graphs in Four Pages 1989 38 JCSS Cai, With Probability One, a Random Oracle Separates PSPACE from the Polynomial-Time Hierarchy 1989 38 JCSS Driscoll & Sarnak & Sleator & Tarjan, Making Data Structures Persistent 1989 38 JCSS Ajtai & Komlos & Steiger & Szemeredi, Optimal Parallel Selection Has Complexity O(Log Log N) 1989 38 JCSS Galil & Kannan & Szemeredi, On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing Machines 1989 38 JCSS Barrington, Bounded-Width Polynomial-Size Branching Programs Recognize Exactly Those Languages in NC^1 1989 38 JCSS Edelsbrunner & Guibas, Topologically Sweeping an Arrangement 1989 38 JCSS Halpern & Vardi, The Complexity of Reasoning about Knowledge and Time. I. Lower Bounds 1988 37 JCSS Chan, Pushdown Automata with Reversal-Bounded Counters 1988 37 JCSS Lloyd & Soffa & Wang, On Locating Minimum Feedback Vertex Sets 1988 37 JCSS Schoening, Graph Isomorphism Is in the Low Hierarchy 1988 37 JCSS O'Connor, An Unpredictability Approach to Finite-State Randomness 1988 37 JCSS Frederickson, Distributed Algorithms for Selection in Sets 1988 37 JCSS Howell & Rosier, Completeness Results for Conflict-Free Vector Replacement Systems 1988 37 JCSS Salomaa, Deterministic Tree Pushdown Automata and Monadic Tree Rewriting Systems 1988 37 JCSS Pippenger, Correction to ``Computational Complexity of Algebraic Functions'' 1988 37 JCSS Alon & Maass, Meanders and Their Applications in Lower Bound Arguments 1988 37 JCSS Raghavan, Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs 1988 37 JCSS Chrobak & Li, k+1 Heads Are Better than k for PDAs 1988 37 JCSS Brassard & Chaum & Crepeau, Minimum Disclosure Proofs of Knowledge 1988 37 JCSS Klein & Reif, An Efficient Parallel Algorithm for Planarity 1988 37 JCSS Kurtz & Mahaney & Royer, Collapsing Degrees 1988 37 JCSS Papadimitriou & Wolfe, The Complexity of Facets Resolved 1988 37 JCSS Kirousis & Papadimitriou, The Complexity of Recognizing Polyhedral Scenes 1988 37 JCSS Luks & McKenzie, Parallel Algorithms for Solvable Permutation Groups 1988 37 JCSS Landau & Vishkin, Fast String Matching with k Differences 1988 37 JCSS Johnson & Papadimitriou & Yannakakis, How Easy Is Local Search? 1988 37 JCSS Li, Simulating Two Pushdown Stores by One Tape in O(n^{1.5} sqrt(log n)) Time 1988 36 JCSS Parberry & Schnitger, Parallel Computation with Threshold Functions 1988 36 JCSS Wilson, A Measure of Relativized Space Which Is Faithful with Respect to Depth 1988 36 JCSS Dietzfelbinger & Maass, Lower Bound Arguments with ``Inaccessible'' Numbers 1988 36 JCSS Allender, Isomorphisms and 1-L Reductions 1988 36 JCSS Buss, Relativized Alternation and Space-Bounded Computation 1988 36 JCSS Sipser, Expanders, Randomness, or Time versus Space 1988 36 JCSS Regan, The Topology of Provability in Complexity Theory 1988 36 JCSS Zachos, Probabilistic Quantifiers and Games 1988 36 JCSS Condon & Ladner, Probabilistic Game Automata 1988 36 JCSS Krentel, The Complexity of Optimization Problems 1988 36 JCSS Wilber, White Pebbles Help 1988 36 JCSS Gacs & Reif, A Simple Three-Dimensional Real-Time Reliable Cellular Array 1988 36 JCSS Chung & Hajela & Seymour, Self-Organizing Sequential Search and Hilbert's Inequalities 1988 36 JCSS de Bakker & Meyer & Olderog & Zucker, Transition Systems, Metric Spaces, and Ready Sets in the Semantics of Uniform Concurrency 1988 36 JCSS Karp & Upfal & Wigderson, The Complexity of Parallel Search 1988 36 JCSS Babai & Moran, Arthur-Merlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes 1988 36 JCSS Baldi, Group Actions and Learning for a Family of Automata 1988 36 JCSS Lindsay, On Alternating omega-Automata 1988 36 JCSS Katsura, Automorphism Groups and Factor Automata of Strongly Connected Automata 1988 36 JCSS Esik, Independence of the Equational Axioms for Iteration Theories 1988 36 JCSS Van Gucht & Fischer, Multilevel Nested Relational Structures 1987 35 JCSS Fredman & Spencer, Refined Complexity Analysis for Heap Operations 1987 35 JCSS Otto, On Deciding the Confluence of a Finite String-Rewriting System on a Given Congruence Class 1987 35 JCSS Beauquier & Blattner & Latteux, On Commutative Context-Free Languages 1987 35 JCSS Bidoit, The Verso Algebra or How to Answer Queries with Fewer Joins 1987 35 JCSS Benson & Guessarian, Algebraic Solutions to Recursion Schemes 1987 35 JCSS Toda, Sigma_2 SPACE(n) Is Closed under Complement 1987 35 JCSS Babai & Hajnal & Szemeredi & Turan, A Lower Bound for Read-Once-Only Branching Programs 1987 35 JCSS Stefanescu, On Flowchart Theories. Part I. The Deterministic Case 1987 35 JCSS Main & Rozenberg, Handle NLC Grammars and R. E. Languages 1987 35 JCSS Winkowski & Maggiolo-Schettini, An Algebra of Processes 1987 35 JCSS Trnkova & Reiterman, Dynamic Algebras with Test 1987 35 JCSS Autebert & Boasson & Senizergues, Groups and NTS Languages 1987 35 JCSS Biskup & Meyer, Design of Relational Database Schemes by Deleting Attributes in the Canonical Decomposition 1987 35 JCSS Peleg, Communication in Concurrent Dynamic Logic 1987 35 JCSS Kurshan, Complementing Deterministic Buchi Automata in Polynomial Time 1987 35 JCSS Parisi-Presicce, Union and Actualization of Module Specifications: Some Compatibility Results 1987 35 JCSS Watanabe & Nakamura, Edge-Connectivity Augmentation Problems 1987 34 JCSS Sannella & Tarlecki, On Observational Equivalence and Algebraic Specification 1987 34 JCSS Padawitz, Parameter-Preserving Data Type Specifications 1987 34 JCSS Castellani, Bisimulations and Abstraction Homomorphisms 1987 34 JCSS Broy, Specification and Top-Down Design of Distributed Systems 1987 34 JCSS Makowsky, Why Horn Formulas Matter in Computer Science: Initial Structures and Generic Examples 1987 34 JCSS Blum & Ehrig & Parisi-Presicce, Algebraic Specification of Modules and Their Basic Interconnections 1987 34 JCSS Poigne & Voss, On the Implementation of Abstract Data Types by Programming Language Constructs 1987 34 JCSS Boehm & Fonio & Habel, Amalgamation of Graph Transformations: A Synchronization Mechanism 1987 34 JCSS Burstall, Inductively Defined Functions in Functional Programming Languages 1987 34 JCSS Degano & Montanari, Concurrent Histories: A Basis for Observing Distributed Systems 1987 34 JCSS Cantone & Ferro & Schwartz, Decision Procedures for Elementary Sublanguages of Set Theory. V. Multilevel Syllogistic Extended by the General Union Operator 1987 34 JCSS Frederickson, Upper Bounds for Time-Space Trade-offs in Sorting and Selection 1987 34 JCSS Amir, Expressive Completeness Failure in Branching Time Structures 1987 34 JCSS Mirzaian, River Routing in VLSI 1987 34 JCSS Howell & Rosier, An Analysis of the Nonemptiness Problem for Classes of Reversal-Bounded Multicounter Machines 1987 34 JCSS Ko & Hua, A Note on the Two-Variable Pattern-Finding Problem 1987 34 JCSS Vogler, Basic Tree Transducers 1987 34 JCSS Abrahamson, Succinct Representation of Regular Sets Using Gotos and Boolean Variables 1986 33 JCSS Grumberg & Francez & Katz, A Complete Rule for Equifair Termination 1986 33 JCSS Tarlecki, Quasi-varieties in Abstract Algebraic Institutions 1986 33 JCSS Abiteboul & Bidoit, Non First Normal Form Relations: An Algebra Allowing Data Restructuring 1986 33 JCSS Kaliski & Yunkap Kwankam & Halpern & Shulman, A Theory of Orbital Behavior in a Class of Nonlinear Systems: Chaos and a Signature-Based Approach 1986 33 JCSS Janssens & Rozenberg & Welzl, The Bounded Degree Problem for NLC Grammars Is Decidable 1986 33 JCSS Hotz, A Representation Theorem of Infinite Dimensional Algebras and Applications to Language Theory 1986 33 JCSS Dahlhaus & Warmuth, Membership for Growing Context-Sensitive Grammars Is Polynomial 1986 33 JCSS Card & Thanailakis & Pries & McLeod, Analysis of Bounded Linear Cellular Automata Based on a Method of Image Charges 1986 33 JCSS Mannila & Raiha, Design by Example: An Application of Armstrong Relations 1986 33 JCSS Vardi, Querying Logical Databases 1986 33 JCSS Wolfson & Yannakakis, Deadlock-Freedom (and Safety) of Transactions in a Distributed Database 1986 33 JCSS Ausiello & D'Atri & Moscarini, Chordality Properties on Graphs and Minimal Conceptual Connections in Semantic Data Models 1986 33 JCSS Cosmadakis & Kanellakis & Spyratos, Partition Semantics for Relations 1986 33 JCSS Connors, Equivalence of Views by Query Capacity 1986 33 JCSS Sagiv, Concurrent Operations on B*-Trees with Overtaking 1986 33 JCSS Hadzilacos & Papadimitriou, Algorithmic Aspects of Multiversion Concurrency Control 1986 33 JCSS Mulmuley, Fully Abstract Submodels of Typed Lambda Calculi 1986 33 JCSS Fiat & Shamir, Polymorphic Arrays: A Novel VLSI Layout for Systolic Computers 1986 33 JCSS Munro, An Implicit Data Structure Supporting Insertion, Deletion, and Search in O(log^2 n) Time 1986 33 JCSS Santha & Vazirani, Generating Quasi-random Sequences from Semi-random Sources 1986 33 JCSS Greenberg & Weiss, A Lower Bound for Probabilistic Algorithms for Finite State Machines 1986 33 JCSS Paturi & Simon, Probabilistic Communication Complexity 1986 32 JCSS Miller, Finding Small Simple Cycle Separators for 2-Connected Planar Graphs 1986 32 JCSS Reif & Lewis, Efficient Symbolic Analysis of Programs 1986 32 JCSS Karhumaki & Maon, A Simple Undecidable Problem: Existential Agreement of Inverses of Two Morphisms on a Regular Language 1986 32 JCSS Bergstra & Klop, Conditional Rewrite Rules: Confluence and Termination 1986 32 JCSS Hodgson & Kent, Uniform Normal Form for General Time-Bounded Complexity Classes 1986 32 JCSS Owings, Effective Choice Functions and Index Sets 1986 32 JCSS Chlebus, Domino-Tiling Games 1986 32 JCSS Perrin & Pin, First-Order Logic and Star-Free Sets 1986 32 JCSS Lakshmipathy & Winklmann, ``Global'' Graph Problems Tend to Be Intractable 1986 32 JCSS Ben-Or & Kozen & Reif, The Complexity of Elementary Algebra and Geometry 1986 32 JCSS Boppana, Threshold Functions and Bounded Depth Monotone Circuits 1986 32 JCSS Chazelle, Reporting and Counting Segment Intersections 1986 32 JCSS de Champeaux, About the Paterson-Wegman Linear Unification Algorithm 1986 32 JCSS Dolev & Halpern & Strong, On the Possibility and Impossibility of Achieving Clock Synchronization 1986 32 JCSS Gacs, Reliable Computation with Cellular Automata 1986 32 JCSS Kantabutra & Kosaraju, New Algorithms for Multilink Robot Arms 1986 32 JCSS Li, Binary Trees and Uniform Distribution of Traffic Cutback 1986 32 JCSS Rosier & Yen, A Multiparameter Analysis of the Boundedness Problem for Vector Addition Systems 1986 32 JCSS Urzyczyn, ``During'' Cannot Be Expressed by ``After'' 1986 32 JCSS Vardi & Wolper, Automata-Theoretic Techniques for Modal Logics of Programs 1986 32 JCSS Wegener, Time-Space Trade-offs for Branching Programs 1985 31 JCSS Apostolico & Preparata, Structural Properties of the String Statistics Problem 1985 31 JCSS Atallah, A Matching Problem in the Plane 1985 31 JCSS Bernstein & Goodman, Serializability Theory for Replicated Databases 1985 31 JCSS Bloom & Esik, Axiomatizing Schemes and Their Behaviors 1985 31 JCSS Boasson & Senizergues, NTS Languages Are Deterministic and Congruential 1985 31 JCSS Engelfriet & Vogler, Macro Tree Transducers 1985 31 JCSS Fischer & Saxton & Thomas & Van Gucht, Interactions between Dependencies and Nested Relational Structures 1985 31 JCSS Flajolet & Martin, Probabilistic Counting Algorithms for Data Base Applications 1985 31 JCSS Gabow, Scaling Algorithms for Network Problems 1985 31 JCSS Hromkovic, On the Power of Alternation in Automata Theory 1985 31 JCSS Incerpi & Sedgewick, Improved Upper Bounds on Shellsort 1985 31 JCSS Kaliski & Klein, Behavior of a Class of Nonlinear Discrete-Time Systems 1985 31 JCSS Melhem, Formal Analysis of a Systolic System for Finite Element Stiffness Matrices 1985 31 JCSS Papadimitriou, Games against Nature 1985 31 JCSS Senizergues, The Equivalence and Inclusion Problems for NTS Languages 1985 31 JCSS von zur Gathen & Kaltofen, Factoring Sparse Multivariate Polynomials 1985 31 JCSS von zur Gathen, Irreducibility of Multivariate Polynomials 1985 31 JCSS Wilson, Relativized Circuit Complexity 1985 30 JCSS Aso & Honda, Dynamical Characteristics of Linear Cellular Automata 1985 30 JCSS Bahamonde, Cost Functors and Optimal Realization 1985 30 JCSS Book & Long & Selman, Qualitative Relativizations of Complexity Classes 1985 30 JCSS Borodin & Hopcroft, Routing, Merging, and Sorting on Parallel Models of Computation 1985 30 JCSS Chandra & Fortune & Lipton, Unbounded Fan-in Circuits and Associative Functions 1985 30 JCSS Chiba & Nishizeki & Abe & Ozawa, A Linear Algorithm for Embedding Planar Graphs Using PQ-Trees 1985 30 JCSS Chrobak, Variations on the Technique of Duris and Galil 1985 30 JCSS Dymond & Tompa, Speedups of Deterministic Machines by Synchronous Parallel Machines 1985 30 JCSS Emerson & Halpern, Decision Procedures and Expressiveness in the Temporal Logic of Branching Time 1985 30 JCSS Engelfriet, Hierarchies of Hyper-AFLs 1985 30 JCSS Gabow & Tarjan, A Linear-Time Algorithm for a Special Case of Disjoint Set Union 1985 30 JCSS Gonczarowski & Shamir, Pattern Selector Grammars and Several Parsing Algorithms in the Context-free Style 1985 30 JCSS Kantor, Sylow's Theorem in Polynomial Time 1985 30 JCSS Kozen, A Probabilistic PDL 1985 30 JCSS Ladner & Norman, Solitaire Automata 1985 30 JCSS Landau & Miller, Solvability by Radicals Is in Polynomial Time 1985 30 JCSS Lenstra, Factoring Multivariate Polynomials over Finite Fields 1985 30 JCSS Lin & Wu, Area-Period Tradeoffs for Multiplication of Rectangular Matrices 1985 30 JCSS Main & Benson, Free Semiring-Representations and Nondeterminism 1985 30 JCSS Narendran & O'Dunlaing & Rolletschek, Complexity of Certain Decision Problems about Congruential Languages 1985 30 JCSS Reif & Sistla, A Multiprocess Network Logic with Temporal and Spatial Modalities 1985 30 JCSS Schimpf & Gallier, Tree Pushdown Automata 1984 29 JCSS Atallah & Vishkin, Finding Euler Tours in Parallel 1984 29 JCSS Chen, On the Fixpoints of Nondeterministic Recursive Definitions 1984 29 JCSS Devroye, Exponential Bounds for the Running Time of a Selection Algorithm 1984 29 JCSS Engelfriet & Slutzki, Extended Macro Grammars and Stack Controlled Machines 1984 29 JCSS Goodman & Shmueli & Tay, GYO Reductions, Canonical Connections, Tree and Cyclic Schemas, and Tree Projections 1984 29 JCSS Harel & Paterson, Undecidability of PDL with L = {a^{2^i} | i >= 0} 1984 29 JCSS Hsu & Du, New Algorithms for the LCS Problem 1984 29 JCSS Kroger, A Generalized Nexttime Operator in Temporal Logic 1984 29 JCSS Latteux & Rozenberg, Commutative One-Counter Languages Are Regular 1984 29 JCSS Meyer & Tiuryn, Equivalences among Logics of Programs 1984 29 JCSS Miyajima & Harao & Noguchi, Indecomposable Maps in Tessellation Structures of Arbitrary Dimension 1984 29 JCSS Motoki, An Application of Cohen's Result on Star Height to the Theory of Control Structures 1984 29 JCSS Muro & Kameda & Minoura, Multi-version Concurrency Control Scheme for a Database System 1984 29 JCSS Ntafos & Gonzalez, On the Computational Complexity of Path Cover Problems 1984 29 JCSS Pachl, Finding Pseudoperipheral Nodes in Graphs 1984 29 JCSS Plaisted, Complete Problems in the First-Order Predicate Calculus 1984 29 JCSS Porat & Yoeli, Towards a Hierarchy of Nets 1984 29 JCSS Reif, The Complexity of Two-Player Games of Incomplete Information 1984 29 JCSS Restivo & Reutenauer, On Cancellation Properties of Languages Which Are Supports of Rational Power Series 1984 29 JCSS Savage, The Performance of Multilective VLSI Algorithms 1984 29 JCSS Savitch & Dymond, Consistency in Nondeterministic Storage 1984 29 JCSS Sugihara, An n log n Algorithm for Determining the Congruity of Polyhedra 1984 29 JCSS Troeger, Weak Equivalence in a Class of Structured Program Schemes 1984 29 JCSS Vitanyi, On Two-Tape Real-Time Computation and Queues 1984 29 JCSS Yesha, Time-Space Tradeoffs for Matrix Multiplication and the Discrete Fourier Transform of Any General Sequential Random-Access Computer 1984 29 JCSS Yu & Ozsoyoglu & Lam, Optimization of Distributed Tree Queries 1984 28 JCSS Aho, Anthony C. Klug, 1949-1983 1984 28 JCSS Bhatt & Leighton, A Framework for Solving VLSI Graph Layout Problems 1984 28 JCSS Casanova & Fagin & Papadimitriou, Inclusion Dependencies and Their Interaction with Functional Dependencies 1984 28 JCSS Feldman & Harel, A Probabilistic Dynamic Logic 1984 28 JCSS Furer, Data Structures for Distributed Counting 1984 28 JCSS Goldwasser & Micali, Probabilistic Encryption 1984 28 JCSS Goodman & Shmueli, The Tree Projection Theorem and Relational Query Processing 1984 28 JCSS Graham & Yannakakis, Independent Database Schemas 1984 28 JCSS Hunt & Rosenkrantz, The Complexity of Monadic Recursion Schemes: Exponential Time Bounds 1984 28 JCSS Imielinski & Lipski, The Relational Model of Data and Cylindric Algebras 1984 28 JCSS Johnson & Klug, Testing Containment of Conjunctive Queries under Functional and Inclusion Dependencies 1984 28 JCSS Kanellakis & Papadimitriou, Is Distributed Locking Harder? 1984 28 JCSS Lloyd & Ravi, One-Layer Routing without Component Constraints 1984 28 JCSS Loui, Minimizing Access Pointers into Trees and Arrays 1984 28 JCSS Milner, A Complete Inference System for a Class of Regular Behaviors 1984 28 JCSS Papadimitriou & Sipser, Communication Complexity 1984 28 JCSS Papadimitriou & Yannakakis, The Complexity of Facets (and Some Facets of Complexity) 1984 28 JCSS Ruzzo & Simon & Tompa, Space-Bounded Hierarchies and Probabilistic Computations 1984 28 JCSS Vardi, The Implication and Finite Implication Problems for Typed Template Dependencies 1984 28 JCSS Warmuth & Haussler, On the Complexity of Iterated Shuffle 1984 28 JCSS Willard, New Trie Data Structures Which Support Very Fast Search Operations 1984 28 JCSS Zaniolo, Database Relations with Null Values 1983 27 JCSS Astesiano & Costa, The Insensitivity Theorem for Nonreducing Reflexive Types 1983 27 JCSS Bloom & Thatcher & Wagner & Wright, Recursion and Iteration in Continuous Theories: The ``M-Construction'' 1983 27 JCSS Bloom, All Solutions of a System of Recursion Equations in Infinite Trees and Other Contraction Theories 1983 27 JCSS Blum & Parisi-Presicce, Implementation of Data Types by Algebraic Methods 1983 27 JCSS Blum, Reminiscences 2 1983 27 JCSS Esik, Algebras of Iteration Theories 1983 27 JCSS Goguen & Meseguer, Correctness of Recursive Parallel Nondeterministic Flow Programs 1983 27 JCSS Hashiguchi, Representation Theorems on Regular Languages 1983 27 JCSS Heilbrunner, Tests for the LR-, LL-, and LC-Regular Conditions 1983 27 JCSS Hodgson & Kent, A Normal Form for Arithmetical Representation of NP-Sets 1983 27 JCSS Hull, Acyclic Join Dependency and Data Base Projections 1983 27 JCSS Ito & Osato & Nasu, Linear Cellular Automata over Z_m 1983 27 JCSS Lorentz & Benson, Deterministic and Nondeterministic Flowchart Interpretations 1983 27 JCSS Lynch & Fischer, A Technique for Decomposing Algorithms Which Use a Single Shared Variable 1983 27 JCSS Miller, Reminiscences 1 1983 27 JCSS Miyano, Remarks on Multihead Pushdown Automata and Multihead Stack Automata 1983 27 JCSS Parisi-Presicce, Extensions of Iterative Congruences on Free Iterative Algebras 1983 27 JCSS Rabin, Transaction Protection by Beacons 1983 27 JCSS Schmeck, Algebraic Characterization of Reducible Flowcharts 1983 27 JCSS Schoening, A Low and a High Hierarchy within NP 1983 27 JCSS Shepherdson, Calvin C. Elgot 1922-1980 1983 27 JCSS Staiger, Finite-State omega-Languages 1983 27 JCSS Steenstrup & Arbib & Manes, Port Automata and the Algebra of Concurrent Processes 1983 27 JCSS Storer, On the Complexity of Chess 1983 27 JCSS Suzuki & Murata, A Method for Stepwise Refinement and Abstraction of Petri Nets 1983 27 JCSS Troeger, An Axiomatization of D-scheme Strong Equivalence 1983 26 JCSS Albert & Wood, Checking Sets, Test Sets, Rich Languages and Commutatively Closed Languages 1983 26 JCSS Asano & Hirata, Edge-Contraction Problems 1983 26 JCSS Carlson & Savage, Size-Space Tradeoffs for Oblivious Computations 1983 26 JCSS Comer, Effects of Updates on Optimality in Tries 1983 26 JCSS Ehrenfeucht & Engelfriet & Rozenberg, Context Free Normal Systems and ET0L Systems 1983 26 JCSS Fich, Lower Bounds for the Cycle Detection Problem 1983 26 JCSS Galil & Seiferas, Time-Space-Optimal String Matching 1983 26 JCSS Ginsburg & Goldstine & Spanier, On the Equality of Grammatical Families 1983 26 JCSS Grefenstette, Network Structure and the Firing Squad Synchronization Problem 1983 26 JCSS Harel & Pnueli & Stavi, Propositional Dynamic Logic of Nonregular Programs 1983 26 JCSS Ibarra & Leininger, On the Zero-Inequivalence Problem for Loop Programs 1983 26 JCSS Joseph, Polynomial Time Computations in Models of ET 1983 26 JCSS Kleitman & Leighton & Lepley & Miller, An Asymptotically Optimal Layout for the Shuffle-Exchange Graph 1983 26 JCSS Ko, On Self-Reducibility and Weak P-Selectivity 1983 26 JCSS Latteux, Languages a un Compteur 1983 26 JCSS Muller & Schupp, Groups, the Theory of Ends, and Context-Free Languages 1983 26 JCSS Riffelmacher, Multiplicative Complexity and Algebraic Structure 1983 26 JCSS Sippu & Soisalon-Soinnen, On the Complexity of LL(k) Testing 1983 26 JCSS Sleator & Tarjan, A Data Structure for Dynamic Trees 1983 26 JCSS Tchuente, Computation of Boolean Functions on Networks of Binary Automata 1983 26 JCSS Ukkonen, Lower Bounds on the Size of Deterministic Parsers 1983 26 JCSS Venkataraman & Yasuhara & Hawrusik, A View of Computability on Term Algebras 1983 26 JCSS Watanabe & Nakamura, On the Transformation Semigroups of Finite Automata 1982 25 JCSS Ben-Ari & Halpern & Pnueli, Deterministic Propositional Dynamic Logic: Finite Models, Complexity, and Completeness 1982 25 JCSS Bentley & Brown, A General Class of Resource Tradeoffs 1982 25 JCSS Bergstra & Tucker, Expressiveness and the Completeness of Hoare's Logic 1982 25 JCSS Chandra & Harel, Structure and Complexity of Relational Queries 1982 25 JCSS Engelfriet & Skyum, The Copying Power of One-State Tree Transducers 1982 25 JCSS Flajolet & Odlyzko, The Average Height of Binary Trees and Other Simple Trees 1982 25 JCSS Harel & Kozen & Parikh, Process Logic: Expressiveness, Decidability, Completeness 1982 25 JCSS Hoffman, Subcomplete Regular Events in Symbolic Logic 1982 25 JCSS Huet & Hullot, Proofs by Induction in Equational Theories with Constructors 1982 25 JCSS Immerman, Upper and Lower Bounds for First Order Expressibility 1982 25 JCSS Kasai & Miller, Homomorphisms between Models of Parallel Computation 1982 25 JCSS Kuich, An Algebraic Characterization of Some Principal Regulated Rational Cones 1982 25 JCSS Luks, Isomorphism of Graphs of Bounded Valance Can Be Tested in Polynomial Time 1982 25 JCSS Mahaney, Sparse Complete Sets for NP: Solution of a Conjecture of Berman and Hartmanis 1982 25 JCSS Rabin, N-Process Mutual Exclusion with Bounded Waiting by 4 log_2 N-Valued Shared Variable 1982 25 JCSS Yannakakis & Papadimitriou, Algebraic Dependencies 1982 24 JCSS Adamek & Nelson & Reiterman, Tree Constructions of Free Continuous Algebras 1982 24 JCSS Albert & Culik, Tree Correspondence Problems 1982 24 JCSS Engelfriet & File, Simple Multi-Visit Attribute Grammars 1982 24 JCSS Frederickson & Johnson, The Complexity of Selection and Ranking in X + Y and Matrices with Sorted Columns 1982 24 JCSS Ginsburg & Goldstine & Spanier, A Prime Decomposition Theorem for Grammatical Families 1982 24 JCSS Goldman & Homer, Quadratic Automata 1982 24 JCSS Hashiguchi, Limitedness Theorem on Finite Automata with Distance Functions 1982 24 JCSS Ibarra & Moran, On Some Decision Problems for RAM Programs 1982 24 JCSS Ja'Ja', The Computational Complexity of a Set of Quadratic Functions 1982 24 JCSS Joseph & Young, Corrigendum: Independence Results in Computer Science? 1982 24 JCSS Ko, The Maximum Value Problem and NP Real Numbers 1982 24 JCSS Laskowski, Computing Lower Bounds on Tensor Rank over Finite Fields 1982 24 JCSS Long, A Note on Sparse Oracles for NP 1982 24 JCSS Lynch, Accessibility of Values as a Determinant of Relative Complexity in Algebras 1982 24 JCSS Machida & Kasai, Space Complexity in On-Line Computation 1982 24 JCSS Maggiolo-Schettini & Winkowski, Processes of Transforming Structures 1982 24 JCSS Nijholt, The Equivalence Problem for LL- and LR-Regular Grammars 1982 24 JCSS Pippenger, Superconcentrators of Depth 2 1982 24 JCSS Pittl, On LLP(k) Parsers 1982 24 JCSS Rodeh, Finding the Median Distributively 1982 24 JCSS Thuraisingham, Representation of One-One Degrees by Decision Problems for System Functions 1982 24 JCSS Yehudai, A Hierarchy of Real-Time Deterministic Languages and Their Equivalence 1981 23 JCSS Aiello & Prini, An Efficient Interpreter for the Lambda-Calculus 1981 23 JCSS Back, On Correct Refinement of Programs 1981 23 JCSS Ehrig & Mahr, Complexity of Algebraic Implementations for Abstract Data Types 1981 23 JCSS Fredman & Volper, Query Time Versus Redundancy Trade-offs for Range Queries 1981 23 JCSS Gallier, Recursion-Closed Algebraic Theories 1981 23 JCSS Huet, A Complete Proof of Correctness of the Knuth-Bendix Completeness Algorithm 1981 23 JCSS Joseph & Young, Independence Results in Computer Science? 1981 23 JCSS Leiss, The Complexity of Restricted Regular Expressions and the Synthesis Problem for Finite Automata 1981 23 JCSS Lynch, Upper Bounds for Static Resource Allocation in a Distributed System 1981 23 JCSS Maurer & Salomaa & Wood, Completeness of Context-Free Grammar Forms 1981 23 JCSS Meyer & Parikh, Definability in Dynamic Logic 1981 23 JCSS Nakamura, Synchronous to Asynchronous Transformation of Polyautomata 1981 23 JCSS Overmars & van Leeuwen, Maintenance of Configurations in the Plane 1981 23 JCSS Oyamaguchi & Inagaki & Honda, The Equivalence Problem for Two dpda's, One of Which is a Finite-Turn or One-Counter Machine 1981 23 JCSS Paul & Seiferas & Simon, An Information-Theoretic Approach to Time Bounds for On-Line Computation 1981 23 JCSS Selman, Some Observations on NP Real Numbers and P-Selective Sets 1981 23 JCSS Snyder, Theft and Conspiracy in the Take-Grant Protection Model 1981 23 JCSS Tompa, An Optimal Solution to a Wire-Routing Problem 1981 23 JCSS Tompa, Corrigendum: Time-Space Tradeoffs for Computing Functions, Using Connectivity Properties of Their Circuits 1981 23 JCSS Valk & Vidal-Naquet, Petri Nets and Regular Languages 1981 23 JCSS Werschulz, On Maximal Order for Local and Global Numerical Problems 1981 22 JCSS Baker, Extending Lookahead for LR Parsers 1981 22 JCSS Borodin & Fischer & Kirkpatrick & Lynch & Tompa, A Time-Space Tradeoff for Sorting on Non-Oblivious Machines 1981 22 JCSS Brassard, A Time-Luck Tradeoff in Relativized Cryptography 1981 22 JCSS Chew & Machtey, A Note on Structure and Looking Back Applied to the Complexity of Computable Functions 1981 22 JCSS Gabber & Galil, Explicit Constructions of Linear-Sized Superconcentrators 1981 22 JCSS Georgeff, Interdependent Translation Schemes 1981 22 JCSS Gurari & Ibarra, The Complexity of Decision Problems for Finite-Turn Multicounter Machines 1981 22 JCSS Immerman, Number of Quantifiers Is Better Than Number of Tape Cells 1981 22 JCSS Janssens & Rozenberg, Decision Problems for Node Label Controlled Graph Grammars 1981 22 JCSS Kozen, Semantics of Probabilistic Programs 1981 22 JCSS Machtey & Young, Remarks on Recursion versus Diagonalization and Exponentially Difficult Problems 1981 22 JCSS Melville, An Improved Simulation Result for Ink-Bounded Turing Machines 1981 22 JCSS Moran, Some Results on Relativized Deterministic and Nondeterministic Time Hierarchies 1981 22 JCSS Nakamura, Regularity and Firing Sequences of Computation Graphs 1981 22 JCSS Ohtsuki & Mori & Kashiwabara & Fujisawa, On Minimal Augmentation of a Graph to Obtain an Interval Graph 1981 22 JCSS Paul & Reischuk, On Time versus Space II 1981 22 JCSS Pippenger, Computational Complexity of Algebraic Functions 1981 22 JCSS Riccardi, The Independence of Control Structures in Abstract Programming Systems 1981 22 JCSS Ruohonen, The Decidability of the D0L-DT0L Equivalence Problem 1981 22 JCSS Ruzzo, On Uniform Circuit Complexity 1981 22 JCSS Savage, Area-Time Tradeoffs for Matrix Multiplication and Related Problems in VLSI Models 1981 22 JCSS Simon, Division in Idealized Unit Cost RAMs 1981 22 JCSS Wegman & Carter, New Hash Functions and Their Use in Authentication and Set Equality 1981 22 JCSS Willson, Growth Patterns of Ordered Cellular Automata 1981 22 JCSS Workman, SR(s,k) Parsers: A Class of Shift-Reduce Bounded-Context Parsers 1980 21 JCSS Angluin, Finding Patterns Common to a Set of Strings 1980 21 JCSS Ausiello & D'Atri & Protasi, Structure Preserving Reductions among Convex Optimization Problems 1980 21 JCSS Brandenburg, Multiple Equality Sets and Post Machines 1980 21 JCSS Chandra & Harel, Computable Queries for Relational Data Bases 1980 21 JCSS Fujishige, An Efficient PQ-Graph Algorithm for Solving the Graph-Realization Problem 1980 21 JCSS Galil & Naamad, An O(E V log^2 V) Algorithm for the Maximal Flow Problem 1980 21 JCSS Gonnet, Open-Addressing Hashing with Unequal-Probability Keys 1980 21 JCSS Head, A-Transducers and the Monotonicity of 1L Schemes 1980 21 JCSS Jaffe, The Equivalence of R. E. Program Schemes and Data Flow Schemes 1980 21 JCSS Ladner, The Complexity of Problems in Systems of Communicating Sequential Processes 1980 21 JCSS Lehmann, On the Algebra of Order 1980 21 JCSS Lewis, Complexity Results for Classes of Quantificational Formulas 1980 21 JCSS Lynch, Straight-Line Program Length as a Parameter for Complexity Analysis 1980 21 JCSS Maier & Mendelzon & Sadri & Ullman, Adequacy of Decompositions of Relational Databases 1980 21 JCSS Maurer & Salomaa & Wood, Context-Free Grammar Forms with Strict Interpretations 1980 21 JCSS Mavrides, A Finite Step-Size Procedure for the F-W Method 1980 21 JCSS Munro & Suwanda, Implicit Data Structures for Fast Search and Update 1980 21 JCSS Naude, A Duality Theory for Decomposable Systems in a Category 1980 21 JCSS Ruzzo, Tree-Size Bounded Alternation 1980 21 JCSS Seki & Kobuchi, On D1L Schemes Simulated by D0L Schemes 1980 21 JCSS Sipser, Lower Bounds on the Size of Sweeping Automata 1980 20 JCSS Arbib & Manes, Foundations of System Theory: The Hankel Matrix 1980 20 JCSS Boasson & Nivat, Adherences of Languages 1980 20 JCSS Brzozowski & Fich, Languages of R-Trivial Monoids 1980 20 JCSS Culik & Salomaa, Test Sets and Checking Words for Homomorphism Equivalence 1980 20 JCSS Dietz & Kosaraju, Recognition of Topological Equivalence of Patterns by Array Automata 1980 20 JCSS Engelfriet & Rozenberg & Slutzki, Tree Transducers, L Systems, and Two-Way Machines 1980 20 JCSS Filotti, An Algorithm for Imbedding Cubic Graphs in the Torus 1980 20 JCSS Gallant & Maier & Storer, On Finding Minimal Length Superstrings 1980 20 JCSS Ginzburg & Yoeli, Vector Addition Systems and Regular Languages 1980 20 JCSS Gonzalez & Ja'Ja', On the Complexity of Computing Bilinear Forms with {0,1} Constants 1980 20 JCSS Hennessy, A Proof System for the First-Order Relational Calculus 1980 20 JCSS Kasai & Adachi, A Characterization of Time Complexity by Simple Loop Programs 1980 20 JCSS LaPaugh & Rivest, The Subgraph Homeomorphism Problem 1980 20 JCSS Lewis & Yannakakis, The Node-Deletion Problem for Hereditary Properties is NP-Complete 1980 20 JCSS Masek & Paterson, A Faster Algorithm Computing String Edit Distances 1980 20 JCSS Miller & Yap, On Formulating Simultaneity for Studying Parallelism and Synchronization 1980 20 JCSS Miyano, One-Way Weak-Stack-Counter Automata 1980 20 JCSS Paredaens, The Interaction of Integrity Constraints in an Information System 1980 20 JCSS Pratt, A Near-Optimal Method for Reasoning about Action 1980 20 JCSS Rivest & Meyer & Kleitman & Winklmann & Spencer, Coping with Errors in Binary Search Procedures 1980 20 JCSS Tompa, Time-Space Tradeoffs for Computing Functions, Using Connectivity Properties of Their Circuits 1979 19 JCSS Adamek & Koubek, Least Fixed Point of a Functor 1979 19 JCSS Benson, Parameter Passing in Nondeterministic Recursive Programs 1979 19 JCSS Blattner & Head, The Decidability of Equivalence for Deterministic Finite Transducers 1979 19 JCSS Book & Greibach & Wrathall, Reset Machines 1979 19 JCSS Ehrenfeucht & Rozenberg & Vermeir, On ET0L Systems with Rank 1979 19 JCSS Francez & Hoare & Lehmann & de Roever, Semantics of Nondeterminism, Concurrency, and Communication 1979 19 JCSS Friedman & Greibach, Superdeterministic DPDAs: The Method of Accepting Does Affect Decision Problems 1979 19 JCSS Germano & Maggiolo-Schettini, Computable Stack Functions for Semantics of Stack Programs 1979 19 JCSS Gurari & Ibarra, Simple Counter Machines and Number-Theoretic Problems 1979 19 JCSS Harju, A Simulation Result for the Auxiliary Pushdown Automata 1979 19 JCSS Harrison & Yehudai, A Hierarchy of Deterministic Languages 1979 19 JCSS Head, Codeterministic Lindenmayer Schemes and Systems 1979 19 JCSS Hunt, Observations on the Complexity of Regular Expression Problems 1979 19 JCSS Kanetkar & Wagh, Group Character Tables in Discrete Transform Theory 1979 19 JCSS Maxson & Smith, Automorphisms of Linear Automata 1979 19 JCSS Naude, Universal Realization 1979 19 JCSS Nozaki, Sorting Using Networks of Deques 1979 19 JCSS Pair & Amirchahy & Neel, Correctness Proofs of Syntax-Directed Processing Descriptions by Attributes 1979 19 JCSS Paul, On Time Hierarchies 1979 19 JCSS Rozenberg & Vermeir, On Recursion in ET0L Systems 1979 19 JCSS Wand, Final Algebra Semantics and Data Type Extensions 1979 18 JCSS Angluin & Valiant, Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings 1979 18 JCSS Butler, Decomposable Maps in General Tessellation Structures 1979 18 JCSS Carter & Wegman, Universal Classes of Hash Functions 1979 18 JCSS Dobkin & Lipton, On the Complexity of Computations under Varying Sets of Primitives 1979 18 JCSS Fischer & Ladner, Propositional Dynamic Logic of Regular Programs 1979 18 JCSS Friedman & Greibach, Monadic Recursion Schemes: The Effect of Constants 1979 18 JCSS Ginali, Regular Trees and the Free Iterative Theory 1979 18 JCSS Gordon, Complexity Classes of Provable Recursive Functions 1979 18 JCSS Gurari & Ibarra, Some Decision Problems Concerning Sequential Transducers and Checking Automata 1979 18 JCSS Latteux, Cones rationnels commutatifs 1979 18 JCSS Linna, Two Decidability Results for Deterministic Pushdown Automata 1979 18 JCSS Maruoka & Kimura, Injectivity and Surjectivity of Parallel Maps for Cellular Automata 1979 18 JCSS Miller, Graph Isomorphism, General Remarks 1979 18 JCSS Mitchell & Cockayne & Hedetniemi, Linear Algorithms on Recursive Representations of Trees 1979 18 JCSS Nozaki, Equivalence Problem of Non-Deterministic Finite Automata 1979 18 JCSS Ono & Nakamura, Undecidability of the First-Order Arithmetic A[P(x),2x,x+1] 1979 18 JCSS Paun, On the Family of Finite Index Matrix Languages 1979 18 JCSS Poplawski, On LL-Regular Grammars 1979 18 JCSS Rouchaleau & Sontag, On the Existence of Minimal Realizations of Linear Dynamical Systems over Noetherian Integral Domains 1979 18 JCSS Tarjan, A Class of Algorithms which Require Nonlinear Time to Maintain Disjoint Sets 1979 18 JCSS Valette, Analysis of Petri Nets by Stepwise Refinements 1979 18 JCSS Veloso & Gill, Some Remarks on Multiple-Entry Finite Automata 1979 18 JCSS Werschulz, Optimal Order for Approximation of Derivatives 1979 18 JCSS Weyuker, Modifications of the Program Scheme Model 1978 17 JCSS Aggarwal, A Note on ``Indecomposable Parallel Maps'' by S. Amoroso and I. J. Epstein 1978 17 JCSS Breidbart, On Splitting Recursive Sets 1978 17 JCSS Choueka, Finite Automata, Definable Sets, and Regular Expressions over omega^n-Tapes 1978 17 JCSS Courcelle & Guessarian, On Some Classes of Interpretations 1978 17 JCSS Culik & Salomaa, On the Decidability of Homomorphism Equivalence for Languages 1978 17 JCSS Ehrenfeucht & Rozenberg, On the Structure of Derivations in Deterministic ET0L Systems 1978 17 JCSS Golze, (A-)Synchronous (Non-)Deterministic Cell Spaces Simulating Each Other 1978 17 JCSS Hegner, Duality Theory for Discrete-Time Linear Systems 1978 17 JCSS Inagaki & Sakabe & Fukumura, Addressable Approximations to Nonaddressable Data Graphs 1978 17 JCSS Ito, A Representation of Strongly Connected Automata and its Applications 1978 17 JCSS Jones & Lipton, The Enforcement of Security Policies for Computation 1978 17 JCSS King & Wrathall, Stack Languages and Log n Space 1978 17 JCSS Kobayashi, The Firing Squad Synchronization Problem for a Class of Polyautomata Networks 1978 17 JCSS Lucchesi & Osborn, Candidate Keys for Relations 1978 17 JCSS Maibaum, Pumping Lemmas for Term Languages 1978 17 JCSS Maxson & Smith, Endomorphisms of Linear Automata 1978 17 JCSS McColl, The Circuit Depth of Symmetric Boolean Functions 1978 17 JCSS Milner, A Theory of Type Polymorphism in Programming 1978 17 JCSS Moore & Case, The Complexity of Total Order Structures 1978 17 JCSS Pippenger, On Rearrangeable and Non-Blocking Switching Networks 1978 17 JCSS Plotkin, T^omega as a Universal Domain 1978 17 JCSS Priese, A Note on Asynchronous Cellular Automata 1978 17 JCSS Rabinovitz, Closure Properties and Languages Defined by Bilinear Automata 1978 17 JCSS Reusch, Realization of Finite Automata with Linear Parts 1978 17 JCSS Takaoka, A Definition of Measures over Language Space 1978 16 JCSS Baker, ``Natural'' Properties of Flowchart Step-Counting Measures 1978 16 JCSS Barto, A Note on Pattern Reproduction in Tessellation Structures 1978 16 JCSS Berger & Pair, Inference for Regular Bilanguages 1978 16 JCSS Brzozowski & Knast, The Dot-Depth Hierarchy of Star-Free Languages is Infinite 1978 16 JCSS Chin & Houck, Algorithms for Updating Minimal Spanning Trees 1978 16 JCSS Cohen & Gold, omega-Computations on Deterministic Pushdown Machines 1978 16 JCSS Dobkin & Lipton, A Lower Bound of 1/2 n^2 on Linear Search Programs for the Knapsack Problem 1978 16 JCSS Elgot & Vloom & Tindell, On the Algebraic Structure of Rooted Trees 1978 16 JCSS Engelfriet & Meineche Schmidt, IO and OI. II 1978 16 JCSS Galil, Palindrome Recognition in Real Time by a Multitape Turing Machine 1978 16 JCSS Guibas & Szemeredi, The Analysis of Double Hashing 1978 16 JCSS Hartmanis & Berman, On Polynomial Time Isomorphisms of Some New Complete Sets 1978 16 JCSS Jonassen & Knuth, A Trivial Algorithm Whose Analysis Isn't 1978 16 JCSS Klove, On Complements of Unary L Languages 1978 16 JCSS Lipton & Stockmeyer, Evaluation of Polynomials with Super-Preconditioning 1978 16 JCSS Manders & Adleman, NP-Complete Decision Problems for Binary Quadratics 1978 16 JCSS Maurer & Salomaa & Wood, ET0L Forms 1978 16 JCSS Oppen, A 2^{2^{2pn}} Upper bound on the Complexity of Presburger Arithmetic 1978 16 JCSS Paterson & Wegman, Linear Unification 1978 16 JCSS Schaefer, On the Complexity of Some Two-Person Perfect-Information Games 1978 16 JCSS Schuler, Inductive Definability in Formal Language Theory 1978 16 JCSS Smyth, Power Domains 1978 16 JCSS Vitanyi & Savitch, On Inverse Deterministic Pushdown Transductions 1978 16 JCSS Wotschke, Nondeterminism and Boolean Operations in pda's 1977 15 JCSS Atanasiu, C-Grammars and Tree-Codifications 1977 15 JCSS Blattner & Head, Single-Valued a-Transducers 1977 15 JCSS Burkhard, Associative Retrieval Trie Hash-Coding 1977 15 JCSS Cohen & Gold, Theory of omega-Languages. I: Characterizations of omega-Context-Free Languages 1977 15 JCSS Cohen & Gold, Theory of omega-Languages. II: A Study of Various Models of omega-Type Generation and Recognition 1977 15 JCSS Cremers & Ginsburg & Spanier, The Structure of Context-Free Grammatical Families 1977 15 JCSS Engelfriet & Meineche Schmidt, IO and OI. I 1977 15 JCSS Fong & Ullman, Finding the Depth of a Flow Graph 1977 15 JCSS Golan, Conditional Grammars 1977 15 JCSS Greibach, Control Sets on Context-Free Grammar Forms 1977 15 JCSS Jones, Corrigendum: Space-Bounded Reducibility Among Combinatorial Problems 1977 15 JCSS Nijholt, On the Covering of Parsable Grammars 1977 15 JCSS Reusch, Linear Realization of Finite Automata 1977 15 JCSS Revesz, Algebraic Properties of Derivation Words 1977 15 JCSS Sato & Honda, Certain Relations between Properties of Maps of Tessellation Automata 1977 15 JCSS Toffoli, Computation and Construction Universality of Reversible Cellular Automata 1977 15 JCSS Tsuji & Toyoda & Tanaka, Relational Data Graphs and Some Properties of Them 1977 15 JCSS Wand, A Characterization of Weakest Preconditions 1977 15 JCSS Watanabe & Noguchi, The Amalgamation of Automata 1977 15 JCSS Willson, Limiting Shapes for Configurations 1977 14 JCSS Ae, Direct or Cascade Product of Pushdown Automata 1977 14 JCSS Bloom & Ginali & Rutledge, Scalar and Vector Iteration 1977 14 JCSS Ching & Wyman, Duality and the Regulator Problem for Linear Systems over Commutative Rings 1977 14 JCSS Fagin, Asymptotic Miss Ratios over Independent References 1977 14 JCSS Fleischner, On the Equivalence of Mealy-Type and Moore-Type Automata and a Relation between Reducibility and Moore-Reducibility 1977 14 JCSS Friedman, Equivalence Problems for Deterministic Context-Free Languages and Monadic Recursion Schemes 1977 14 JCSS Geller & Harrison, Characteristic Parsing: A Framework for Producing Compact Deterministic Parsers, II 1977 14 JCSS Geller & Harrison, Characteristic Parsing: A Framework for Producing Compact Deterministic Parsers, I 1977 14 JCSS Hartfiel & Maxson, A Semigroup Characterization of a Linearly Realizable Automaton over GF(p) 1977 14 JCSS Lipton & Miller & Snyder, Synchronization and Computing Capabilities of Linear Asynchronous Structures 1977 14 JCSS Maibaum, Erratum: A Generalized Approach to Formal Languages 1977 14 JCSS Plaisted, Sparse Complex Polynomials and Polynomial Reducibility 1977 14 JCSS Rayward-Smith, Hypergrammars: An Extension of Macrogrammars 1977 14 JCSS Rodrigue, The Method of Closest Approach for Finding Nonisolated Zeros of Functions 1977 14 JCSS Rosenberg, On Storing Concatenable Arrays 1977 14 JCSS Seiferas, Relating Refined Space Complexity Classes 1977 14 JCSS Seiferas, Techniques for Separating Space Complexity Classes 1977 14 JCSS Sikdar, On Topological Machines 1977 14 JCSS Wotschke, Degree-Languages: A New Concept of Acceptance 1976 13 JCSS Aho & Ullman, Node Listings for Reducible Flow Graphs 1976 13 JCSS Amoroso & Epstein, Indecomposable Parallel Maps in Tessellation Structures 1976 13 JCSS Arnold & Dauchet, Un Theoreme de Duplication pour les Forete Algebriques 1976 13 JCSS Baer & van Leeuwen, The Halting Problem for Linear Turing Assemblers 1976 13 JCSS Bloom, Varieties of Ordered Algebras 1976 13 JCSS Booth & Lueker, Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms 1976 13 JCSS Cook & Sethi, Storage Requirements for Deterministic Polynomial Time Recognizable Languages 1976 13 JCSS Dobkin, A Nonlinear Lower Bound on Linear Search Tree Programs for Solving Knapsack Problems 1976 13 JCSS Fischer & Robertson & Saxton, On the Sequential Nature of Functions 1976 13 JCSS Hunt & Szymanski, Complexity Metatheorems for Context-Free Grammar Problems 1976 13 JCSS Ibarra & Kim, A Useful Device for Showing the Solvability of Some Decision Problems 1976 13 JCSS Laing, Automaton Introspection 1976 13 JCSS Lynch, Complexity-Class-Encoding Sets 1976 13 JCSS Masunaga & Noguchi & Oizumi, A Characterization of Automata and a Direct Product Decomposition 1976 13 JCSS McCormick, Some Convergence Results on the Method of Gradients for Ax = lambda Bx 1976 13 JCSS Miller, Riemann's Hypothesis and Tests for Primality 1976 13 JCSS Nozaki, Hazard Analysis of Asynchronous Circuits in Muller-Bartky's Sense 1976 13 JCSS Perrault, Intercalation Lemmas for Tree Transducer Languages 1976 13 JCSS Peterson, Computation Sequence Sets 1976 13 JCSS Rozenberg & Salomaa, Context-Free Grammars with Graph-Controlled Tables 1976 13 JCSS Schoenhage & Paterson & Pippenger, Finding the Median 1976 13 JCSS Shibata, On the Structure of Abelian Automata 1976 13 JCSS Taniguchi & Kasami, A Result on the Equivalence Problem for Deterministic Pushdown Automata 1976 13 JCSS Valiant, Graph-Theoretic Properties in Computational Complexity 1976 12 JCSS Alton, Nonexistence of Program Optimizers in Several Abstract Settings 1976 12 JCSS Anderson, Another Proof of the Theorem on Pattern Reproduction in Tessellation Structures 1976 12 JCSS Bloom & Elgot, The Existence and Construction of Free Iterative Theories 1976 12 JCSS Breitbart, Some Bounds on the Complexity of Predicate Recognition by Finite Automata 1976 12 JCSS Bruno & Coffman & Johnson, On Batch Scheduling of Jobs with Stochastic Service Times and Cost Structures on a Single Server 1976 12 JCSS Courcelle & Vuillemin, Completeness Results for the Equivalence of Recursive Schemas 1976 12 JCSS Ehrenfeucht & Zeiger, Complexity Measures for Regular Expressions 1976 12 JCSS Ehrig & Kreowski, Systematic Approach to Reduction and Minimization in Automata and System Theory 1976 12 JCSS Ezawa & Mizumoto & Toyoda & Tanaka, Interactive Languages 1976 12 JCSS Galil & Simon, A Note on Multiple-Entry Finite Automata 1976 12 JCSS Goldstine, Bounded AFLs 1976 12 JCSS Hart, The Derivation Language of a Phrase Structure Grammar 1976 12 JCSS Hashiguchi & Honda, Properties of Code Events and Homomorphisms over Regular Events 1976 12 JCSS Helton, The Semigroup of an Algebra Automaton 1976 12 JCSS Hunt & Rosenkrantz & Szymanski, On the Equivalence, Containment, and Covering Problems for the Regular and Context-Free Languages 1976 12 JCSS Lewis, On Computational Reducibility 1976 12 JCSS Mehlhorn, Polynomial and Abstract Subrecursive Classes 1976 12 JCSS Meyer, Sufficient Conditions for the Convergence of Monotonic Mathematical Programming Algorithms 1976 12 JCSS Nasu & Honda, A Completeness Property of One-Dimensional Tessellation Automata 1976 12 JCSS Pratt & Stockmeyer, A Characterization of the Power of Vector Machines 1976 12 JCSS Richardson, Continuous Self-Reproduction 1976 12 JCSS Savage & Weiner & Bagchi, Neighborhood Search Algorithms for Guaranteeing Optimal Traveling Salesman Tours Must Be Inefficient 1976 12 JCSS Weihrauch, The Computational Complexity of Program Schemata 1976 12 JCSS Yaku, Surjectivity of Nondeterministic Parallel Maps Induced by Nondeterministic Cellular Automata 1975 11 JCSS Baer, Computation by Assembly 1975 11 JCSS Best & Ritter, An Accelerated Conjugate Direction Method to Solve Linearly Constrained Minimization Problems 1975 11 JCSS Cremers & Ginsburg, Context-Free Grammar Forms 1975 11 JCSS de Bakker & Meertens, On the Completeness of the Inductive Assertion Method 1975 11 JCSS Di Gregorio & Trautteur, On Reversibility in Cellular Automata 1975 11 JCSS Ehrenfeucht, Practical Decidability 1975 11 JCSS Ehrig & Tischer, Graph Grammars and Applications to Specialization and Evolution in Biology 1975 11 JCSS Freedman & Ladner, Space Bounds for Processing Contentless Inputs 1975 11 JCSS Harao & Noguchi, Fault Tolerant Cellular Automata 1975 11 JCSS Hollerer & Vollmar, On ``Forgetful'' Cellular Automata 1975 11 JCSS Ibarra & Sahni, Hierarchies of Turing Machines with Restricted Tape Alphabet Size 1975 11 JCSS Igarashi & Honda, Erratum: On the Extension of Gladkij's Theorem and the Hierarchies of Languages 1975 11 JCSS Jones, Space-Bounded Reducibility among Combinatorial Problems 1975 11 JCSS Nishio & Kobuchi, Fault Tolerant Cellular Spaces 1975 11 JCSS Rajlich, Dynamics of Discrete Systems and Pattern Reproduction 1975 11 JCSS Reedy & Savitch, Ambiguity in the Developmental Systems of Lindenmayer 1975 11 JCSS Rosen, Program Equivalence and Context-Free Grammars 1975 11 JCSS Rovan, Proving Containment of Bounded AFL 1975 11 JCSS Rozenberg & Lee, Some Properties of the Class of L Languages with Interactions 1975 11 JCSS Sontag, On Some Questions of Rationality and Decidability 1975 11 JCSS van Leeuwen, The Tape-Complexity of Context-Independent Developmental Languages 1975 11 JCSS Walker, Formal Grammars and the Regeneration Capability of Biological Systems 1975 10 JCSS Alagic, Natural State Transformations 1975 10 JCSS Amoroso & Cooper & Patt, Some Clarifications of the Concept of A Garden-of-Eden Configuration 1975 10 JCSS Ashcroft, Proving Assertions about Parallel Programs 1975 10 JCSS Beeri, Two-Way Nested Stack Automata Are Equivalent to Two-Way Stack Automata 1975 10 JCSS Germano & Maggiolo-Schettini, Proving a Compiler Correct: A Simple Approach 1975 10 JCSS Ginsburg & Goldstine & Greibach, Uniformly Erasable AFL 1975 10 JCSS Goguen, Discrete-Time Machines in Closed Monoidal Categories. I 1975 10 JCSS Goldstine, Some Independent Families of One-Letter Languages 1975 10 JCSS Greibach, One Counter Languages and the IRS Condition 1975 10 JCSS Hamilton & Mertens, Reproduction in Tessellation Structures 1975 10 JCSS Harnik, Effective Proper Procedures and Universal Classes of Program Schemata 1975 10 JCSS Joshi & Levy & Takahashi, Tree Adjunct Grammars 1975 10 JCSS Kiel, Two-Way A-Transducers and AFL 1975 10 JCSS Machtey, On the Density of Honest Subrecursive Classes 1975 10 JCSS McCloskey, Abstract Families of Length-Preserving Processors 1975 10 JCSS Mizumoto & Toyoda & Tanaka, Various Kinds of Automata with Weights 1975 10 JCSS Nakamura, On Causal omega^2-Systems 1975 10 JCSS Owings, Splitting a Context-Sensitive Set 1975 10 JCSS Salomon, The Decidability of a Mapping Problem for Generalized Sequential Machines with Final States 1975 10 JCSS Sudborough, On Tape-Bounded Complexity Classes and Multihead Finite Automata 1975 10 JCSS Ullman, NP-Complete Scheduling Problems 1975 10 JCSS Valiant & Paterson, Deterministic One-Counter Automata 1975 10 JCSS Valiant, General Context-Free Recognition in Less than Cubic Time 1974 9 JCSS Book, Comparing Complexity Classes 1974 9 JCSS Cook, An Observation on Time-Storage Trade Off 1974 9 JCSS Daley, The Extent and Density of Sequences within the Minimal-Program Complexity Hierarchies 1974 9 JCSS Elias, Minimum Times and Memories Needed to Compute the Values of a Function 1974 9 JCSS Fischer & Stockmeyer, Fast On-Line Integer Multiplication 1974 9 JCSS Gill & Kou, Multiple-Entry Finite Automata 1974 9 JCSS Ginsburg & Spanier, On Incomparable Abstract Family of Languages (AFL) 1974 9 JCSS Heindel, Congruence Arithmetic Algorithms for Polynomial Real Zero Determination 1974 9 JCSS Hwang, Cyclic Decomposition of Finite Stochastic Systems 1974 9 JCSS Johnson, Approximation Algorithms for Combinatorial Problems 1974 9 JCSS Kasai, Translatability of Flowcharts into While Programs 1974 9 JCSS Kosaraju, 1-Way Stack Automaton with Jumps 1974 9 JCSS Kosaraju, Analysis of Structured Programs 1974 9 JCSS Lewis & Rosenkrantz & Stearns, Attributed Translations 1974 9 JCSS Lynch, Approximations to the Halting Problem 1974 9 JCSS Maruoka & Kimura, Completeness Problem of One-Dimensional Binary Scope-3 Tessellation Automata 1974 9 JCSS Meyer, Algorithm Model for Penalty Functions-Type Iterative Procedures 1974 9 JCSS Norris, Difunctionally Induced State Machines 1974 9 JCSS Robertson, Complexity Classes of Partial Recursive Functions 1974 9 JCSS Rouchaleau & Wyman, Linear Dynamical Systems over Integral Domains 1974 9 JCSS Tarjan, Testing Flow Graph Reducibility 1974 9 JCSS Vuillemin, Correct and Optimal Implementations of Recursion in a Simple Programming Language 1974 8 JCSS Baker & Book, Reversal-Bounded Multipushdown Machines 1974 8 JCSS Bird, On Transformations of Programs 1974 8 JCSS Blum & Rodrigue, Solution of Eigenvalue Problems in Hilbert Spaces by a Gradient Method 1974 8 JCSS Borodin & Moenck, Fast Modular Transforms 1974 8 JCSS Choueka, Theories of Automata on omega-Tapes: A Simplified Approach 1974 8 JCSS Cremers & Mayer, On Vector Languages 1974 8 JCSS Crestin, Structure des Grammaires d'Ambiguite Bornee 1974 8 JCSS Fischer & Warkentin, Predecessor Machines 1974 8 JCSS Ginsburg & Rose, The Equivalence of Stack Counter Acceptors and Quasi-Realtime Acceptors 1974 8 JCSS Goguen, On Homomorphisms, Correctness, Termination, Unfoldments, and Equivalence of Flow Diagram Programs 1974 8 JCSS Guha & Yeh, On Periodicity of Sequential Machines 1974 8 JCSS Hart, Ambiguity and Decision Problems for Local Adjunct Languages 1974 8 JCSS Ibaraki, Classes of Discrete Optimization Problems and Their Decision Problems 1974 8 JCSS Igarashi & Honda, Deterministic Multitape Automata Computations 1974 8 JCSS Johnson, Fast Algorithms for Bin Packing 1974 8 JCSS Kfoury, Translatability of Schemas over Restricted Interpretations 1974 8 JCSS Khabbaz, A Geometric Hierarchy of Languages 1974 8 JCSS Lewis, Program Schemata and the First-Order Decision Problem 1974 8 JCSS Maibaum, A Generalized Approach to Formal Languages 1974 8 JCSS Revesz, Comment on the Paper ``Error Detection in Formal Languages'' 1974 8 JCSS Walljasper, Left-Derivation Bounded Languages 1973 JCSS Abe & Mizumoto & Toyoda & Tanaka, Web Grammars and Several Graphs 1973 JCSS Arbib, Coproducts and Decomposable Machines 1973 JCSS Bird, The Equivalence Problem for Deterministic Two-Tape Automata 1973 JCSS Blattner, The Unsolvability of the Equality Problem for Sentential Forms of Context-Free Grammars 1973 JCSS Blum & Floyd & Pratt & Rivest & Tarjan, Time Bounds for Selection 1973 JCSS Boasson, Two Iteration Theorems for Some Families of Languages 1973 JCSS Cheung, Approximate Solutions and Error Bounds for Quasilinear Elliptic Boundary Value Problems 1973 JCSS Cook & Reckhow, Time Bounded Random Access Machines 1973 JCSS Cook, A Hierarchy for Nondeterministic Time Complexity 1973 JCSS Culik & Cohen, LR-Regular Grammars--an Extension of LR(k) Grammars 1973 JCSS Feliciangeli & Herman, Algorithms for Producing Grammars from Sample Derivations: a Common Problem of Formal Language Theory and Developmental Biology 1973 JCSS Garland & Luckham, Program Schemes, Recursion Schemes, and Formal Languages 1973 JCSS Ginsburg & Greibach, On AFL Generators for Finitely Encoded AFA 1973 JCSS Harrison & Havel, Strict Deterministic Grammars 1973 JCSS Hartmanis & Walter, Group Theoretic Characterization of Linear Permutation Automata 1973 JCSS Hopcroft & Tarjan, A V log V Algorithm for Isomorphism of Triconnected Planar Graphs 1973 JCSS Horowitz, The Efficient Calculation of Powers of Polynomials 1973 JCSS Hughes, Many-one Degrees Associated with Semi-Thue Systems 1973 JCSS Ibarra, On Two-way Multihead Automata 1973 JCSS Igarashi & Honda, On the Extension of Gladkij's Theorem and the Hierarchies of Languages 1973 JCSS Kartashev, State Assignment for Realizing Modular Input-Free Sequential Logical Networks Without Invertors 1973 JCSS Kohavi & Winograd, Establishing Certain Bounds Concerning Finite Automata 1973 JCSS Konheim & Meister, Distributions of Queue Lengths and Waiting Times in a Loop with Two-Way Traffic 1973 JCSS Kung, A Bound on the Multiplicative Efficiency of Iteration 1973 JCSS Masunaga & Noguchi & Oizumi, A Structure Theory of Automata Characterized by Groups 1973 JCSS Munro & Paterson, Optimal Algorithms for Parallel Polynomial Evaluation 1973 JCSS Nozaki, Two Entropies of a Generalized Sorting Problem 1973 JCSS Nudds, Conversion of Programs Between Computers: Interpreters, Simulators and Compilers 1973 JCSS Rosebrugh & Wood, A Characterization Theorem for n-Parallel Right Linear Languages 1973 JCSS Rutledge, Program Schemata as Automata. I 1973 JCSS Savitch, Maze Recognizing Automata and Nondeterministic Tape Complexity 1973 JCSS Schnorr, Process Complexity and Effective Random Tests 1973 JCSS Walker & Strong, Characterizations of Flowchartable Recursions 1973 JCSS Yaku, The Constructibility of a Configuration in a Cellular Automaton 1973 JCSS Zeigler, Every Discrete Input Machine Is Linearly Simulatable 1972 JCSS Aho & Ullman, Equivalence of Programs with Structured Variables 1972 JCSS Aho & Ullman, Optimization of LR(k) Parsers 1972 JCSS Amoroso & Patt, Decision Procedures for Surjectivity and Injectivity of Parallel Maps for Tessellation Structures 1972 JCSS Bucy, The Riccati Equation and Its Bounds 1972 JCSS Butzbach, Les 1-Convexes du Monoide Commutatif N^n 1972 JCSS Cleave, Combinatorial Systems. I. Cylindrical Problems 1972 JCSS Constable & Muchnick, Subrecursive Program Schemata I & II: I. Undecidable Equivalence Problems; II. Decidable Equivalence Problems 1972 JCSS Eickel & Loeckx, The Relation Between Derivations and Syntactical Structures in Phrase-Structure Grammars 1972 JCSS Enderton, Degrees of Computational Complexity 1972 6 JCSS Gale & Karp, A Phenomenon in the Theory of Sorting 1972 JCSS Giuliano, Writing Stack Acceptors 1972 JCSS Golberg, The Equivalence of Several Initial Value Methods for Solving Integral Equations 1972 JCSS Goldstine, Substitution and Bounded Languages 1972 JCSS Greibach, Syntactic Operators on Full SemiAFLs 1972 JCSS Heindel, Computation of Powers of Multivariate Polynomials over the Integers 1972 JCSS Itkin & Zwinogrodzki, On Program Schemata Equivalence 1972 JCSS Kameda, Pushdown Automata with Counters 1972 JCSS Kang, Effective Operators with No Strong Gaps 1972 JCSS Katzenelson, The Markov Algorithm as a Language Parser--Linear Bounds 1972 JCSS King & Floyd, An Interpretation-Oriented Theorem Prover over Integers 1972 JCSS Machtey, Augmented Loop Languages and Classes of Computable Functions 1972 JCSS McCormick, A General Approach to One-Step Iterative Methods with Application to Eigenvalue Problems 1972 JCSS Muller & Miller, A Generalization of the Theory of Incompletely Specified Machines 1972 JCSS Munro & Borodin, Efficient Evaluation of Polynomial Forms 1972 JCSS Paterson, Tape Bounds for Time-Bounded Turing Machines 1972 JCSS Preparata & Yeh, Continuously Valued Logic 1972 JCSS Rabin, Proving Simultaneous Positivity of Linear Forms 1972 JCSS Rajlich, Absolutely Parallel Grammars and Two-Way Finite State Transducers 1972 JCSS Richardson, Tessellations with Local Transformations 1972 JCSS Schultz, Discrete Tchebycheff Approximation for Multivariate Splines 1972 JCSS Smith, Real-Time Language Recognition by One-Dimensional Cellular Automata 1972 JCSS Spira, Complete Linear Proofs of Systems of Linear Inequalities 1972 JCSS Stanat, A Homomorphism Theorem for Weighted Context-Free Grammars 1972 JCSS Wise, Generalized Overlap Resolvable Grammars and their Parsers 1972 JCSS Zalcstein, Locally Testable Languages 1971 5 JCSS Ibarra, Characterizations of Some Tape and Time Complexity Classes of Turing Machines in Terms of Multihead and Auxiliary Stack Automata 1971 5 JCSS Book, Time-Bounded Grammars and Their Languages 1971 5 JCSS Rosenberg, Data Graphs and Addressing Schemes 1970 4 JCSS Aho & Ullman, A Characterization of Two-Way Deterministic Classes of Languages 1970 4 JCSS Fischer & Meyer & Rosenberg, Time-Restricted Sequence Generation 1970 4 JCSS Hartmanis & Hopcroft, What Makes Some Language Theory Problems Undecidable 1970 4 JCSS Luckham & Park & Paterson, On Formalised Computer Programs 1970 4 JCSS Savitch, Relationships Between Nondeterministic and Deterministic Tape Complexities 1969 3 JCSS Karp & Miller, Parallel Program Schemata 1969 3 JCSS Manna, The Correctness of Programs 1967 1 JCSS Hopcroft & Ullman, Nonerasing Stack Automata 1997 77 JCTA Krasikov & Roditty, On a Reconstruction Problem for Sequences 1996 76 JCTA Blackburn & Etzion & Paterson, Permutation Polynomials, de Bruijn Sequences, and Linear Complexity 1996 76 JCTA Kim, On Increasing Subsequences of Random Permutations 1996 76 JCTA Fon-Der-Flaass, A Note on Greedy Codes 1996 75 JCTA Goodman & Pollack & Wenger, Bounding the Number of Geometric Permutations Induced by k-Transversals 1996 75 JCTA Goulden & West, Raney Paths and a Combinatorial Relationship between Rooted Nonseparable Planar Maps and Two-Stack-Sortable Permutations 1996 75 JCTA Gordon & Patashnik & Kuperberg & Spencer, Asymptotically Optimal Covering Designs 1996 75 JCTA Konvalina, A Generalization of Waring's Formula 1996 75 JCTA Ball, On Packing Unequal Squares 1996 74 JCTA Frankl & Ota & Tokushige, Covers in Uniform Intersecting Families and a Counterexample to a Conjecture of Lovasz 1996 74 JCTA Aigner, Searching with Lies 1996 74 JCTA Szonyi, On the Number of Directions Determined by a Set of Points in an Affine Galois Plane 1996 74 JCTA McDiarmid & Steger, Tidier Examples for Lower Bounds on Diagonal Ramsey Numbers 1996 73 JCTA Brightwell & Promel & Steger, The Average Number of Linear Extensions of a Partial Order 1996 73 JCTA Bennett, From Coin Tossing to the Jacobi Polynomials 1996 73 JCTA Ward & Wood, Characters and the Equivalence of Codes 1996 73 JCTA Kezdy & Snevily & Wang, Partitioning Permutations into Increasing and Decreasing Subsequences 1996 73 JCTA Kushilevitz & Linial & Rabinovich & Saks, Witness Sets for Families of Binary Vectors 1996 73 JCTA Kahn, Asymptotically Good List-Colorings 1996 73 JCTA Loeb, The Fundamental Theorem of Voting Schemes 1996 73 JCTA Knuth, The Knowlton-Graham Partition Problem 1996 73 JCTA Leung & Wei, A Comparison Theorem for Permanents and a Proof of a Conjecture on (t,m)-Families (Corrigendum) 1995 71 JCTA Thiele, The No-Four-on-Circle Problem 1995 71 JCTA Korner, On the Extremal Combinatorics of the Hamming Space 1995 71 JCTA Babai & Snevily & Wilson, A New Proof of Several Inequalities on Codes and Sets 1995 71 JCTA Shor, A New Proof of Cayley's Formula for Counting Labeled Trees 1995 70 JCTA Rasmussen & Savage & West, Gray Code Enumeration of Families of Integer Partitions 1995 70 JCTA Savage & Winkler, Monotone Gray Codes and the Middle Levels Problem 1995 70 JCTA Fazekas & Levenshtein, On Upper Bounds for Code Distance and Covering Radius of Designs in Polynomial Metric Spaces 1995 70 JCTA Brams & Taylor, On Envy-Free Cake Division 1995 69 JCTA Haussler, Sphere Packing Numbers for Subsets of the Boolean n-Cube with Bounded Vapnik-Chervonenkis Dimension 1995 69 JCTA Li & Vitanyi, Kolmogorov Complexity Arguments in Combinatorics (erratum) 1994 67 JCTA Sharir, On Joints in Arrangements of Lines in Space and Related Problems 1994 67 JCTA Jockusch, Perfect Matchings and Perfect Squares 1994 66 JCTA Li & Vitanyi, Kolmogorov Complexity Arguments in Combinatorics 1994 66 JCTA Jacquet & Szpankowski, Autocorrelation on Words and Its Applications: Analysis of Suffix Trees by String-Ruler Approach 1994 66 JCTA Maltby, Trisecting a Rectangle 1994 66 JCTA Li, Three Counterfeit Coins Problem 1994 66 JCTA Babai & Pyber, Permutation Groups without Exponentially Many Orbits on the Power Set 1994 65 JCTA Aronov & Matousek & Sharir, On the Sum of Squares of Cell Complexities in Hyperplane Arrangements 1994 65 JCTA McQuillan & Richter, Equality in a Result of Kleitman 1993 64 JCTA Brualdi & Pless, Greedy Codes 1993 64 JCTA Onn, Geometry, Complexity, and Combinatorics of Permutation Polytopes 1993 64 JCTA Hurlbert & Isaak, On the de Bruijn Torus Problem 1993 63 JCTA Chen, A Coding Algorithm for Renyi Trees 1993 63 JCTA Lefmann & Phelps & Rodl, Rigid Linear Binary Codes 1993 62 JCTA Huffman & Job & Pless, Multipliers and Generalized Multipliers of Cyclic Objects and Cyclic Codes 1993 62 JCTA Hudson, A Marriage Theorem with Lebesgue Measure 1993 62 JCTA Fishburn & Graham, Lexicographic Ramsey Theory 1993 62 JCTA Tamura, Transformation from Arbitrary Matchings to Stable Matchings 1993 62 JCTA Eppstein, Improved Bounds for Intersecting Triangles and Halving Planes 1992 61 JCTA Aharoni & Holzman, How to Guess Two Letters Correctly 1992 61 JCTA Chung & Graham, Quasi-Random Subsets of Z_n 1992 61 JCTA Frankl & Tokushige, Some Best Possible Inequalities Concerning Cross-Intersecting Families 1992 61 JCTA Leung & Wei, A Comparison Theorem for Permanents and a Proof of a Conjecture on (t,m)-Families 1992 61 JCTA Gotsman & Linial, The Equivalence of Two Problems on the Cube 1992 60 JCTA Conway & Pless & Sloane, The Binary Self-Dual Codes of Length up to 32: A Revised Enumeration 1992 60 JCTA Flammenkamp, Progress in the No-Three-in-Line-Problem 1992 60 JCTA Brochet, Representation of the Positive Real Numbers as Sums of Colored Rational Numbers 1992 60 JCTA Baillon & Simons, Almost-Fixed-Point and Fixed-Point Theorems for Discrete-Valued Maps 1992 59 JCTA Pach & Sharir, Repeated Angles in the Plane and Related Problems 1992 59 JCTA Kahn, Coloring Nearly-Disjoint Hypergraphs with n+o(n) Colors 1992 59 JCTA Korner & Simonyi, A Sperner-Type Theorem and Qualitative Independence 1992 59 JCTA Rawlings, A Binary Tree Decomposition Space of Permutation Statistics 1992 59 JCTA Galvin & Scheepers, A Ramseyan Theorem and an Infinite Game 1992 59 JCTA Negro & Sereno, Solution of Ulam's Problem on Binary Search with Three Lies 1991 58 JCTA Fraenkel & Lorberbom, Nimhoff Games 1991 57 JCTA van Wee, Bounds on Packings and Coverings by Spheres in q-ary and Mixed Hamming Spaces 1991 57 JCTA van Lint & van Wee, Generalized Bounds on Binary/Ternary Mixed Packing and Covering Codes 1991 56 JCTA Edelsbrunner & Hajnal, A Lower Bound on the Number of Unit Distances between the Vertices of a Convex Polygon 1990 55 JCTA Spencer, Counting Extensions 1990 55 JCTA Pittel & Rubin, How Many Random Questions Are Necessary to Identify n Distinct Objects? 1990 55 JCTA Furedi, The Maximum Number of Unit Distances in a Convex n-gon 1990 55 JCTA Skiena, Counting k-Projections of a Point Set 1990 54 JCTA Guzicki, Ulam's Searching Game with Two Lies 1990 54 JCTA Frankl & Graham & Rodl, Iterated Combinatorial Density Theorems 1990 53 JCTA Pilpel, Descending Subsequences of Random Permutations 1989 52 JCTA Chavez, A Natural Notion of Morphism for Linear Programming Problems 1989 52 JCTA Agarwal & Sharir & Shor, Sharp Upper and Lower Bounds on the Length of General Davenport-Schinzel Sequences 1989 52 JCTA Alon & Spencer, Ascending Waves 1989 52 JCTA Promel & Voigt, A Short Proof of the Restricted Ramsey Theorem for Finite Set Systems 1989 52 JCTA Czyzowicz & Mundici & Pelc, Ulam's Searching Game with Lies 1989 52 JCTA Babai, The Probability of Generating the Symmetric Group 1989 51 JCTA Bruyere, About Prefix Sets of Words 1989 51 JCTA Pippenger & Spencer, Asymptotic Behavior of the Chromatic Index for Hypergraphs 1989 51 JCTA Pelc, Detecting Errors in Searching Games 1989 50 JCTA Cantor, On Arithmetical Algorithms over Finite Fields 1989 50 JCTA Boppana & Spencer, A Useful Elementary Correlation Inequality 1989 50 JCTA Spencer, Erratum: Three Hundred Million Points Suffice 1989 50 JCTA Mendes France & Shallit, Wire Bending 1989 50 JCTA Erdos & Spencer, Monochromatic Sumsets 1988 49 JCTA Komjath, A Simplified Construction of Nonlinear Davenport-Schinzel Sequences 1988 49 JCTA Czyzowicz & Pelc & Mundici, Solution of Ulam's Problem on Binary Search with Two Lies 1988 48 JCTA Pelc, Prefix Search with a Lie 1988 47 JCTA Hoffman & Tucker, Greedy Packing and Series-Parallel Graphs 1988 47 JCTA Odlyzko, On Subspaces Spanned by Random Selections of +/-1 Vectors 1987 46 JCTA Kahane & Fraenkel, k-Welter--A Generalization of Welter's Game 1987 46 JCTA Fraenkel & Goldschmidt, PSPACE-Hardness of Some Combinatorial Games 1987 45 JCTA Wille, The Football Pool Problem for 6 Matches: A New Upper Bound Obtained by Simulated Annealing 1987 45 JCTA Aigner & West, Sorting by Insertion of Leading Elements 1985 38 JCTA Etzion, On the Distribution of de Bruijn Sequences of Low Complexity 1985 38 JCTA Shor, A Counterexample to the Triangle Conjecture 1981 30 JCTA Brown, On van der Waerden's Theorem and the Theorem of Paris and Harrington 1981 30 JCTA Guibas & Odlyzko, Periods in Strings 1973 15 JCTA Galvin & Shelah, Some Counterexamples in the Partition Calculus 1996 68 JCTB Alon, Disjoint Directed Cycles 1996 68 JCTB Kahn, Asymptotics of the Chromatic Index for Multigraphs 1996 68 JCTB Brualdi & Hollingsworth, Multicolored Trees in Complete Graphs 1995 65 JCTB Robertson & Seymour, Graph Minors. XIV. Extending an Embedding 1995 65 JCTB Fraughnaugh & Locke, 11/30 (Finding Large Independent Sets in Connected Triangle-Free 3-Regular Graphs 1995 64 JCTB Robertson & Seymour & Thomas, Kuratowski Chains 1995 64 JCTB Robertson & Seymour & Thomas, Petersen Family Minors 1995 64 JCTB Robertson & Seymour & Thomas, Sachs' Linkless Embedding Conjecture 1995 64 JCTB Robertson & Seymour, Graph Minors. XII. Distance on a Surface 1995 63 JCTB Robertson & Seymour, Graph Minors. XIII. The Disjoint Paths Problem 1995 63 JCTB Komjath & Shelah, Universal Graphs without Large Cliques 1994 62 JCTB Andreae, On Reconstructing Rooted Trees 1994 62 JCTB Schrijver & Seymour, Packing Odd Paths 1994 62 JCTB Robertson & Seymour & Thomas, Quickly Excluding a Planar Graph 1994 61 JCTB Bauslaugh, The Complexity of Infinite H-Colouring 1994 61 JCTB Takacs, On the Total Heights of Random Rooted Binary Trees 1994 61 JCTB Linial & Rabinovich, Local and Global Clique Numbers 1994 61 JCTB de Graaf & Schrijver, Grid Minors of Graphs on the Torus 1994 61 JCTB McKay & Radziszowski, Linear Programming in Some Ramsey Problems 1994 60 JCTB Karzanov, Paths and Metrics in a Planar Graph with Three or More Holes. I. Metrics 1994 60 JCTB Karzanov, Paths and Metrics in a Planar Graph with Three or More Holes. II. Paths 1994 60 JCTB Robertson & Seymour, Graph Minors. XI. Circuits on a Surface 1993 58 JCTB Lefmann & Rodl, On Canonical Ramsey Numbers for Complete Graphs versus Paths 1993 58 JCTB Seymour & Thomas, Graph Searching and a Min-Max Theorem for Tree-Width 1993 58 JCTB West, Generating Linear Extensions by Adjacent Transpositions 1993 58 JCTB Schrijver, Tait's Flyping Conjecture for Well-Connected Links 1993 58 JCTB Schrijver, Graphs on the Torus and Geometry of Numbers 1993 57 JCTB Chung & Cleve & Dagum, A Note on Constructive Lower Bounds for the Ramsey Numbers R(3,t) 1992 56 JCTB Reiterman & Rodl & Sinajova, On Embedding of Graphs into Euclidean Spaces of Small Dimension 1992 56 JCTB Capoyleas & Pach, A Turan-Type Theorem on Chords of a Convex Polygon 1992 56 JCTB Luczak & Rucinski & Voigt, Ramsey Properties of Random Graphs 1992 56 JCTB Seymour, On Secret-Sharing Matroids 1992 56 JCTB Komjath, Martin's Axiom and Spanning Trees of Infinite Graphs 1992 55 JCTB Moews, Pebbling Graphs 1992 55 JCTB Truemper, A Decomposition Theory for Matroids. VI. Almost Regular Matroids 1992 55 JCTB Truemper, A Decomposition Theory for Matroids. VII. Analysis of Minimal Violation Matrices 1992 55 JCTB Lu, Hamiltonianian Games 1992 55 JCTB Kaufmann & Mehlhorn, On Local Routing of Two-Terminal Nets 1992 55 JCTB Chen & Gross, Limit Points for Average Genus. I. 3-Connected and 2-Connected Simplicial Graphs 1992 54 JCTB Ramras, Symmetric Vertex Partitions of Hypercubes by Isometric Trees 1991 53 JCTB Schrijver, Short Proofs on Multicommodity Flows and Cuts 1991 52 JCTB Brown & Rodl, A Ramsey Type Problem Concerning Vertex Colourings 1991 52 JCTB Robertson & Seymour, Graph Minors. X. Obstructions to Tree-Decomposition 1991 52 JCTB Seifter, Properties of Graphs with Polynomial Growth 1991 52 JCTB Bienstock & Robertson & Seymour & Thomas, Quickly Excluding a Forest 1991 52 JCTB Kratochvil, String Graphs. I. The Number of Critical Nonstring Graphs Is Infinite 1991 52 JCTB Kratochvil, String Graphs. II. Recognizing String Graphs Is NP-Hard 1991 52 JCTB Petrovic, On Graphs with Exactly One Eigenvalue Less Than -1 1990 50 JCTB Tardos, An Intersection Theorem for Supermatroids 1990 50 JCTB Hertz, A Fast Algorithm for Coloring Meyniel Graphs 1990 50 JCTB Marcotte, Erratum: ``On the Chromatic Index of Multigraphs and a Conjecture of Seymour (I)'' (1966) 1988 45 JCTB Erdos & Faudree & Pach & Spencer, How to Make a Graph Bipartite 1988 44 JCTB Frieze, Finding Hamilton Cycles in Sparse Random Graphs 1987 43 JCTB Miller, An Additivity Theorem for the Genus of a 2-Connected Graph 1980 28 JCTB Kleitman & Kwiatkowski, Further Results on the Aanderaa-Rosenberg Conjecture 1987 44 JCT Blokhuis, More on Maximal Intersecting Families of Finite Sets 1987 44 JCT Gusfield & Irving & Leather & Saks, Every Finite Distributive Lattice Is a Set of Stable Matchings for a Small Stable Marriage Instance 1986 43 JCT Fraenkel & Yesha, The Generalized Sprague-Grundy Function and Its Invariance under Certain Mappings 1986 43 JCT Aharoni & Linial, Minimal Non-Two-Colorable Hypergraphs and Minimal Unsatisfiable Formulas 1969 6 JCT Haines, On Free Monoids Partially Ordered by Embedding 1994 JERUSCOMB Deutsch, A Fine Classification of Closed Planar Sets According to Their Non-seeing Property 1994 JERUSCOMB Ekhad & Zeilberger, A High-School Algebra, ``Formal Calculus,'' Proof of Bieberbach 1994 JERUSCOMB Eriksson, Node Firing Games on Graphs 1994 JERUSCOMB Graver & Servatius & Servatius, Abstract Rigidity in m-Space 1994 JERUSCOMB Hurlbert & Isaak, A Meshing Technique for de Bruijn Tori 1994 JERUSCOMB Laurent, Hypercube Embedding of Distances with Few Values 1994 JERUSCOMB Shabat & Zvonkin, Plane Trees and Algebraic Numbers 1994 JERUSCOMB Teller & Hohmeyer, Stabbing Oriented Convex Polygons in Randomized O(n^2) Time 1997 9 JETAI Jain, Strong Monotonic and Set-driven Inductive Inference 1996 8 JETAI Heath & Kasif & Kosaraju & Salzberg & Sullivan, Learning Nested Concept Classes with Limited Storage 1996 8 JETAI Green, Fodor, Functions, Physics, and Fantasyland: Is AI a Mickey Mouse Discipline? 1995 7 JETAI Dietrich, AI and the Mechanistic Forces of Darkness 1995 7 JETAI Wiehagen & Smith, Generalization versus Classification 1995 7 JETAI Parsons & Kubat & Dohnal, A Rough Set Approach to Reasoning under Uncertainty 1994 6 JETAI Case, Infinitary Self-Reference in Learning Theory 1994 6 JETAI Case & Rajan & Shende, Spatial/Kinematic Domain and Lattice Computers 1994 6 JETAI Daley & Kalyanasundaram & Velauthapillai, The Power of Probabilism in Popperian FINite Learning 1994 6 JETAI Freivalds & Hoffmann, An Inductive Inference Approach to Classification 1994 6 JETAI Lange & Zeugmann, Characterization of Language Learning from Informant under Various Monotonicity Constraints 1994 6 JETAI Lavrac & Dzeroski, Weakening the Language Bias of LINUS 1994 6 JETAI Muggleton, Predicate Invention and Utilization 1994 6 JETAI Wiehagen & Zeugmann, Ignoring Data May Be the Only Way to Learn Efficiently 1992 4 JETAI Hayes & Ford & Adams-Webber, Human Reasoning about Artificial Intelligence 1992 4 JETAI Case & Chen & Jain, Strong Separation of Learning Classes 1992 4 JETAI Aizawa, Connectionism and Artificial Intelligence: History and Philosophical Interpretation 1991 3 JETAI Bylander, Tractability and Artificial Intelligence 1991 3 JETAI Turney, The Gap between Abstract and Concrete Results in Machine Learning 1991 3 JETAI Boyle, On the Physical Limitations of Pattern Matching 1989 1 JETAI Harary, The Graph of a Boolean Function 1989 36 JGEOM Rawlins & Wood, A Decomposition Theorem for Convexity Spaces 1997 24 JGT Dvorak & Havel & Laborde & Mollard, Spanning Caterpillars of a Hypercube 1997 24 JGT Entringer & Goddard & Henning, A Note on Cliques and Independent Sets 1996 23 JGT Kotlov & Lovasz, The Rank and Size of Graphs 1996 23 JGT Alon & Erdos & Holzman & Krivelevich, On k-Saturated Graphs with Restrictions on the Degrees 1996 23 JGT Toth, A Ramsey-Type Bound for Rectangles 1995 20 JGT Brauner & Brualdi & Sneyd, Pseudo-Interval Graphs 1995 20 JGT Gerards, On Tutte's Characterization of Graphic Matroids--A Graphic Proof 1995 20 JGT Hell & Huang, Lexicographic Orientation and Representation Algorithms for Comparability Graphs, Proper Circular Arc Graphs, and Proper Interval Graphs 1995 20 JGT Su, An Algorithm for the Decomposition of Graphs into Cliques 1995 20 JGT Georges, On the Harmonious Coloring of Collections of Graphs 1995 20 JGT Stahl, On the Average Genus of the Random Graph 1995 20 JGT Kleitman & Lasaga & Cowen, Asymptotic Enumeration of Full Graphs 1995 19 JGT Borodin, A New Proof of the 6 Color Theorem 1995 19 JGT Korach & Ostfeld, On the Existence of Special Depth First Search Trees 1995 19 JGT McKay & Radziszowski, R(4,5) = 25 1995 19 JGT Bugata & Nagy & Vavra, A Polynomial Time Algorithm Recognizing Link Trees 1995 19 JGT Mao-cheng & Fleischner, An Eulerian Trail Traversing Specified Edges in Given Order 1995 19 JGT Fisher & Ryan, Tournament Games and Positive Tournaments 1995 19 JGT Archdeacon & Bonnington & Little, An Algebraic Characterization of Planar Graphs 1994 18 JGT Kierstead & Trotter, Planar Graph Coloring with an Uncooperative Partner 1994 18 JGT Gavril, Intersection Graphs of Proper Subtrees of Unicyclic Graphs 1994 18 JGT Weichsel, Dominating Sets in n-Cubes 1994 18 JGT Alon, Subdivided Graphs Have Linear Ramsey Numbers 1994 18 JGT King & Nash-Williams, Reconstructing the Number of Copies of a Valency-Labeled Finite Graph in an Infinite Graph 1994 18 JGT Bialostocki & Dierker, On Zero Sum Ramsey Numbers: Multiple Copies of a Graph 1994 18 JGT Desai & Rao, A Characterization of the Smallest Eigenvalue of a Graph 1994 18 JGT Liu, Constraints on the Number of Maximal Independent Sets in Graphs 1993 17 JGT Lovasz & Winkler, A Note on the Last New Vertex Visited by a Random Walk 1993 17 JGT Chen & Lai, Collapsible Graphs and Matchings 1993 17 JGT Faudree & Gyarfas & Lesniak & Schelp, Rainbow Coloring the Cube 1993 17 JGT Goddard & Kleitman, A Note on Maximal Triangle-Free Graphs 1993 17 JGT Chartrand & Johns & Tian & Winters, Directed Distance in Digraphs: Centers and Medians 1993 17 JGT Khalifat & Politof & Satyanarayana, On Minors of Graphs with at Least 3n - 4 Edges 1993 17 JGT Li, Hamiltonian Cycles in 3-Connected Claw-Free Graphs 1993 17 JGT Cao & Yuan, Graphs Characterized by the Second Eigenvalue 1993 17 JGT Bienstock & Dean, Bounds for Rectilinear Crossing Numbers 1993 17 JGT Juvan & Mohar, Laplace Eigenvalues and Bandwidth-Type Invariants of Graphs 1993 17 JGT Eppstein, Connectivity, Graph Minors, and Subgraph Multiplicity 1993 17 JGT Guichard, Acyclic Graph Coloring and the Complexity of the Star Chromatic Number 1993 17 JGT Alon & Caro, On Three Zero-Sum Ramsey-Type Problems 1993 17 JGT Chen & Hattingh & Rousseau, Asymptotic Bounds for Irredundant and Mixed Ramsey Numbers 1992 16 JGT Furedi, The Maximum Number of Edges in a Minimal Graph of Diameter 2 1991 15 JGT Babai, Vertex-Transitive Graphs and Vertex-Transitive Maps 1991 15 JGT McDiarmid, Expected Numbers at Hitting Times 1991 15 JGT Raspaud, Cycle Covers of Graphs with a Nowhere-Zero 4-Flow 1991 15 JGT Gould, Updating the Hamiltonian Problem--A Survey 1991 15 JGT Chung & Graham, Quasi-Random Tournaments 1991 15 JGT Zito, The Structure and Maximum Number of Maximum Independent Sets in Trees 1990 14 JGT Alon, Ramsey Graphs Cannot Be Defined by Real Polynomials 1990 14 JGT Hartvigsen, Path-Isomorphic Networks 1990 14 JGT Faudree & Gould & Jacobson & Lesniak, Lower Bounds for Lower Ramsey Numbers 1990 14 JGT Oporowski, A Counterexample to Seymour's Self-Minor Conjecture 1990 14 JGT Zhang, Minimum Cycle Coverings and Integer Flows 1990 14 JGT Brightwell & Winkler, Extremal Cover Times for Random Walks on Trees 1990 14 JGT Kerber & Laue & Hager & Weber, Cataloging Graphs by Generating Them Uniformly at Random 1990 14 JGT Marcotte & Seymour, Extending an Edge-Coloring 1990 14 JGT Heinrich, Coloring the Edges of K_m x K_m 1990 14 JGT Babai & Simonovits & Spencer, Extremal Subgraphs of Random Graphs 1990 14 JGT Bang-Jensen, Locally Semicomplete Digraphs: A Generalization of Tournaments 1989 13 JGT Zehavi & Itai, Three Tree-Paths 1989 13 JGT Sen & Das & Roy & West, Interval Digraphs: An Analogue of Interval Graphs 1988 12 JGT Muder & Weaver & West, Pagenumber of Complete Bipartite Graphs 1987 11 JGT Johnson & Pollak, Hypergraph Planarity and the Complexity of Drawing Venn Diagrams 1987 11 JGT Whitty, Vertex-Disjoint Paths and Edge-Disjoint Branchings in Directed Graphs 1987 11 JGT Alon & Kleitman & Thomassen & Saks & Seymour, Subgraphs of Large Connectivity and Chromatic Number in Graphs of Large Chromatic Number 1987 11 JGT Schoone & Bodlaender & van Leeuwen, Diameter Increase Caused by Edge Deletion 1987 11 JGT Brouwer & Veldman, Contractibility and NP-Completeness 1992 JHUP Trotter, Combinatorics and Partially Ordered Sets: Dimension Theory 1989 JHUP Golub & Van Loan, Matrix Computations, Second Edition 1996 12 JISAE Lien, Direct Composition Algorithms 1996 12 JISAE Tseng, Resilient and Flexible Ring Embedding in An Injured Hypercube 1996 12 JISAE Tsai & Horng, Efficient Embedding Hypercube on Arrangement Graphs 1996 12 JISAE Jwo, Properties of Star Graph, Bubble-sort Graph, Prefix-reversal Graph and Complete-transposition Graph 1996 12 JISAE Chen & Chang & Yang, Cryptanalysis of the Secret Exponent of the RSA Scheme 1996 12 JISAE Chen & Chen, Optimal Embedding of Large Complete Binary Trees into Hypercubes 1996 12 JISAE Kaushik & Sharma & Huang & Johnson & Johnson & Sadayappan, An Algebraic Theory for Modeling Direct Interconnection Networks 1996 12 JISAE Bonacina & Hsiang, A Category-Theoretic Treatment of Automated Theorem Proving 1996 12 JISAE Wang & Hsu, Maximum and Minimum Matchings for Series-Parallel Networks 1995 11 JISAE Chang & Horng & Buehrer, A Cascade Exponentiation Evaluation Scheme Based on the Lempel-Ziv-Welch Compression Algorithm 1995 11 JISAE Chen, Fast Subcube Compaction in Hypercubes with the Buddy Allocation Strategy 1993 9 JISAE Liang & Tang & Lee, A Different Approach for Solving the Specified Diameter Partition Problem 1993 9 JISAE Chang, An Optimal Algorithm for Edge Searching an Interval Graph 1993 9 JISAE Chou & Yun & Tseng, A Constant-Time Neural Network for Multiple Selection of Extreme Values 1993 9 JISAE Shou & Wang, An Efficient Quorum Generating Approach for Distributed Mutual Exclusion 1993 9 JISAE Yang & Tsai, Adaptive and Fault-Tolerant Wormhole Routing in Hypercube Network 1993 9 JISAE Lei & Liaw, Efficient Parallel Algorithms for Finding the Majority Element 1993 9 JISAE Kaushik & Sharma & Huang, An Algebraic Theory for Modeling Multistage Interconnection Networks 1993 9 JISAE Yang & Lee, Efficient Parallel Neighbor Finding Algorithms for Quadtrees on Hypercubes 1993 9 JISAE Wu & Choue, Fault-Tolerant FFT Butterfly Network Design 1992 8 JISAE Laih, Cryptanalysis of Public-Key Cryptosystem Using the Pascal Triangle 1992 8 JISAE Chen & Yang, Amortized Analysis of Disk Scheduling Algorithm V(R) 1992 8 JISAE Chen & Horng & Ku, Terminal Reliability Modeling & Analysis of Hypercube Networks 1992 8 JISAE Fang & Chen, An Embedding of Large Binary Trees into Hypercube Multiprocessors of Limited Size 1992 8 JISAE Lin & Chen & Chang, On the Motion Planning Problem: The Case of a Polygonal Object Moving Amidst Obstacles of Arbitrary Shape 1992 8 JISAE Hwang & Wang, Parallel Decoding of the (31,16,7) Quadratic Residue Code 1991 7 JISAE Chen & Hou, A Branch-and-Bound Algorithm for Single-Row Routing 1991 7 JISAE Lin & Wu, Easily Testable Cellular Array Multipliers 1991 7 JISAE Chang, Spatial Match Retrieval of Symbolic Pictures 1991 7 JISAE Tien & Yang, Hierarchical Spanning Trees in Incomplete Hypercubes 1991 7 JISAE Chen & Huang & Hsieh, Rearrangeability of Cascaded Delta Networks 1991 7 JISAE Laih & Harn & Lee & Hwang, Dynamic Threshold Scheme Based on the Definition of Cross-Product in an N-Dimensional Linear Space 1991 7 JISAE Lee & Quek, Partial Matching of Two Dimensional Shapes Using Random Coding 1990 6 JISAE Chern & Tseng, A New Distributed Maximum Flow Algorithm for Planar Directed Network 1990 6 JISAE Tsai & Chen & Feng, An H-V Tile-Expansion Router 1990 6 JISAE Chang & Wu, A New Password Authentication Scheme 1990 6 JISAE Chen & Lu & Wang & Lee, Constrained Chinese Postman Problem with Its Application on Synchronizable Protocol Test Generation 1990 6 JISAE Kuo & Sheu, Finding Maximum Matching in Bipartite Graphs on a Single-Channel Broadcast Communication Model 1990 6 JISAE Chang & Chao, Parallel Operator-Precedence Parsing 1990 6 JISAE Wu, Relating Tiling and Coloring to Testing of Combinational Iterative Logic Arrays 1992 2 JISYSTS Ludermir, Computability of Logical Neural Networks 1993 10 JJIAM Sekitani & Yamamoto, A Recursive Algorithm for Finding the Minimum Covering Sphere of a Polytope and the Minimum Covering Concentric Spheres of Several Polytopes 1991 8 JJIAM Sasaki & Suzuki & Kolar & Sasaki, Approximate Factorization of Multivariate Polynomials and Absolute Irreducibility Testing 1991 8 JJIAM Namikawa & Ibaraki, An Algorithm for the Fair Resource Allocation Problem with a Submodular Constraint 1991 8 JJIAM Seno & Buonocore, Some Mathematical Considerations on Two-mode Searching II 1991 14 JMAPPS Tomek & Khan & Muldner & Nassar & Novak & Proszynski, Hypermedia--Introduction and Survey 1991 14 JMAPPS Maurer & Tomek, Hypermedia Bibliography 1991 29 JMB Mesterton-Gibbons, An Escape from `The Prisoners's Dilemma' 1994 46 JNT Kraaikamp, On Symmetric and Asymmetric Diophantine Approximation by Continued Fractions 1994 46 JNT Rote, Sequences with Subword Complexity 2n 1994 46 JNT Hastad & Lagarias & Odlyzko, On the Distribution of Multiplicative Translates of Sets of Residues (mod p) 1993 43 JNT Borwein & Borwein, On the Generating Function of the Integer Part: [n alpha + gamma] 1990 34 JNT Harman, Approximation of Real Matrices by Integral Matrices 1978 10 JNT Lew & Rosenberg, Polynomial Indexing of Integer Lattice-Points I. General Concepts and Quadratic Polynomials 1978 10 JNT Lew & Rosenberg, Polynomial Indexing of Integer Lattice-Points II. Nonexistence Results for Higher-Degree Polynomials 1996 JONESBART Neapolitan & Naimipour, Foundations of Algorithms 1995 JONESBART Hein, Discrete Structures, Logic, and Computability 1995 JONESBART Crownover, Introduction to Fractals and Chaos 1994 JONESBART Walker, The Limits of Computing 1993 JONESBART Bernstein & Lewis, Concurrency in Programming and Database Systems 1992 JONESBART Lee, Algorithms and Data Structures in Computer Engineering 1992 JONESBART Chandy & Taylor, An Introduction to Parallel Programming 1995 8 JOOP LaLonde & Pugh, Complexity in C++: A Smalltalk Perspective 1990 3 JOOP Antebi, Issues in Teaching C++ 1989 1 JOOP Saunders, A Survey of Object-Oriented Programming Languages 1989 1 JOOP Bergin & Greenfield, What Does Modula-2 Need to Fully Support Object-Oriented Programming? 1986 JOSSEY Eble, The Craft of Teaching: A Guide to Mastering the Professor's Art 1996 91 JOTA Brinkhuis, Introduction to Duality in Optimization Theory 1996 91 JOTA Andrus & Schaferkotter, An Exterior-Point Method for Linear Programming Problems 1996 91 JOTA Dondeti & Emmons, Max-Min Matching Problems with Multiple Assignments 1996 89 JOTA Ruml & Ngo & Marks & Shieber, Easily Searched Encodings for Number Partitioning 1995 87 JOTA Cheng & Mitchell, A Primal-Dual Interior-Point Method for Linear Programming Based on a Weighted Barrier Function 1995 87 JOTA Bertsekas, An Auction Algorithm for the Max-Flow Problem 1995 87 JOTA Barros & Frenk, Generalized Fractional Programming and Cutting Plane Algorithms 1995 87 JOTA Wong, Matrix Representation and Gradient Flows for NP-Hard Problems 1995 86 JOTA Rueda & Hanson & Singh, Optimality and Duality with Generalized Convexity 1995 86 JOTA Yang & Liu, Three Kinds of Generalized Convexity 1995 84 JOTA Martinez, On Motivating the Mitchell-Todd Modification of Karmarkar's Algorithm for LP Problems with Free Variables 1993 79 JOTA Best & Tan, An O(n^3 log n) Strong Polynomial Algorithm for an Isotonic Regression Knapsack Problem 1993 79 JOTA Penot, Preservation of Persistence and Stability under Intersections and Operations. Part 1: Persistence 1993 79 JOTA Penot, Preservation of Persistence and Stability under Intersections and Operations. Part 2: Stability 1993 78 JOTA Mitchell, Updating Lower Bounds When Using Karmarkar's Projective Algorithm for Linear Programming 1993 78 JOTA Xu & Mizukami, Two-Person Two-Criteria Decision Making Problems for Descriptor Systems 1992 72 JOTA Ye, Extensions of the Potential Reduction Algorithm for Linear Programming 1989 63 JOTA Roos, New Trajectory-Following Polynomial-Time Algorithm for Linear Programming Problems 1988 57 JOTA Shanno & Marsten, A Reduced-Gradient Variant of Karmarkar's Algorithm and Null-Space Projections 1995 101 JPAA Austin & Henckell & Nehaniv & Rhodes, Subsemigroups and Complexity via the Presentation Lemma 1995 101 JPAA Zashev, Categorial Generalization of Algebraic Recursion Theory 1993 88 JPAA Ridley & Mays, Generalized Witt Formulae and Comma-free Codes 1992 81 JPAA Burgisser & Lickteig, Verification Complexity of Linear Prime Ideals 1992 77 JPAA Rosenthal, Quantaloidal Nuclei, the Syntactic Congruence and Tree Automata 1991 73 JPAA Sander, Existence and Uniqueness of the Real Closure of an Ordered Field without Zorn's Lemma 1990 67 JPAA Carral & Rotillon & Ly, Codes Defined from Some Maximal Curves 1990 67 JPAA Fitchas & Galligo & Morgenstern, Precise Sequential and Parallel Complexity for Quantifier Elimination over Algebraically Closed Fields 1990 65 JPAA Kobayashi, Complete Rewriting Systems and Homology of Monoid Algebras 1990 9 JPAM Savitch, Turbo Pascal 2001.5 1990 9 JPAM Lapreste, Opaque Types and Generic Facilities: Modula-2 vs. Turbo Pascal 5.0 1997 40 JPDC Deng & Liu & Long & Xiao, Competitive Analysis of Network Load Balancing 1997 40 JPDC Wang & Wang, Minimum Assignment of Test Links for Hypercubes with Lower Fault Bounds 1997 40 JPDC Sarnath & He, On Parallel Selection and Searching in Partial Orders: Sorted Matrices 1997 40 JPDC Bertossi & Mei, P-Bandwidth Priority Queues on Reconfigurable Tree of Meshes 1997 40 JPDC Abali & Stunkel & Benveniste, Clock Synchronization on a Multicomputer 1996 39 JPDC Awerbuch & Berger & Cowen & Peleg, Fast Distributed Network Decompositions and Covers 1996 39 JPDC Skillicorn, Parallel Implementation of Tree Skeletons 1996 39 JPDC Mohapatra, Processor Allocation Using Partitioning in Mesh Connected Parallel Computers 1996 39 JPDC Ferreira & Robson, Fast and Scalable Parallel Algorithms for Knapsack-like Problems 1996 39 JPDC Beresford-Smith & Diessel & ElGindy, Optimal Algorithms for Constrained Reconfigurable Meshes 1996 39 JPDC Ouyang & Palem, Very Efficient Cyclic Shifts on Hypercubes 1996 39 JPDC Das & Sinha, A New Topology with Odd Degree for Multiprocessor Systems 1996 38 JPDC El Baz & Spiteri & Miellou & Gazen, Asynchronous Iterative Algorithms with Flexible Communication for Nonlinear Network Flow Problems 1996 38 JPDC Park, A Parallel Algorithm for Global Routing Using an Associative Processor 1996 38 JPDC Gao & Rosenberg, Toward Efficient Scheduling of Evolving Computations on Rings of Processors 1996 38 JPDC Bromley, Quasirandom Number Generators for Parallel Monte Carlo Algorithms 1996 37 JPDC Alimonti & Flocchini & Santoro, Finding the Extrema of a Distributed Multiset 1996 37 JPDC Rajasekaran, Randomized Selection on the Hypercube 1996 37 JPDC Yun & Park, Hierarchical Hypercube Networks (HHN) for Massively Parallel Computers 1996 37 JPDC Tseng & Lai, On the Embedding of a Class of Regular Graphs in a Faulty Hypercube 1996 37 JPDC Ram & Sreenivas & Subramaniam, Parallel Simulated Annealing Algorithms 1996 37 JPDC Hameenanttila & Guan & Carothers & Chen, The Flexible Hypercube: A New Fault-Tolerant Architecture for Parallel Computing 1996 36 JPDC Kaddoura & Ranka & Wang, Array Decompositions for Nonuniform Computational Environments 1996 36 JPDC Sharma 7 Pradhan, Submesh Allocation in Mesh Multicomputers Using Busy-List: A Best-Fit Approach with Complete Recognition Capability 1996 36 JPDC Olariu & Stojmenovic, Time-Optimal Nearest-Neighbor Computations on Enhanced Meshes 1996 36 JPDC Ng & Pun & Ip & Hamdi & Ahmad, Embedding Pyramids into 3D Meshes 1996 36 JPDC Gil & Matias, An Effective Load Balancing Policy for Geometric-Decaying Algorithms 1996 35 JPDC Barnett & Payne & van de Geijn & Watts, Broadcasting on Meshes with Wormhole Routing 1996 35 JPDC Chen & Wang & Wang, Tiling Nested Loops into Maximal Rectangular Blocks 1996 35 JPDC Greenberg & Park & Schwabe, The Cost of Complex Communication on Simple Networks 1996 35 JPDC Yan & Zhang & Yang, A Fast Token-Chasing Mutual Exclusion Algorithm in Arbitrary Network Topologies 1996 35 JPDC Bader & JaJa, Parallel Algorithms for Image Histogramming and Connected Components with an Experimental Study 1996 35 JPDC Das & Dattagupta, Two-Pass Rearrangeability in Faulty Benes Networks 1996 35 JPDC Clarke & Barnard, An LR Substring Parser Applied in a Parallel Environment 1996 35 JPDC Feitelson & Rudolph, Evaluation of Design Choices for Gang Scheduling Using Distributed Hierarchical Control 1996 35 JPDC Kim & Belford, A Distributed Election Protocol for Unreliable Networks 1996 35 JPDC Gouda & Haddix, The Stabilizing Token Ring in Three Bits 1996 35 JPDC Larmore & Przytycka, A Parallel Algorithm for Optimum Height-Limited Alphabetic Binary Trees 1996 35 JPDC Raghavendra & Sridhar, Dimension Ordering and Broadcast Algorithms in Faulty SIMD Hypercubes 1996 35 JPDC Lin & Orlowska, An Optimal Voting Scheme for Minimizing the Overall Communication Cost in Replicated Data Management 1996 35 JPDC Efe, Embedding Large Complete Binary Trees in Hypercubes with Load Balancing 1996 34 JPDC Stoyenko & Bosch & Aksit & Marlowe, Load Balanced Mapping of Distributed Objects to Minimize Network Communication 1996 34 JPDC Chinn & Leighton & Tompa, Minimal Adaptive Routing on the Mesh with Bounded Queue Size 1996 34 JPDC Yang & Ibarra, Performance Prediction in Symbolic Scheduling of Partitioned Programs with Weight Variation 1996 34 JPDC Hyde & Fleisch, An Analysis of Degenerate Sharing and False Coherence 1996 34 JPDC Schikarski & Wagner, Efficient Parallel Matrix Inversion on Interconnection Networks 1996 34 JPDC Raghavendra & Sridhar, Exact Solutions to Diameter and Routing Problems in PEC Networks 1996 34 JPDC Leung & Tam & Young, On-Line Routing of Real-Time Messages 1996 34 JPDC Antonoiu & Srimani, A Self-Stabilizing Leader Election Algorithm for Tree Graphs 1996 34 JPDC Naimi & Trehel & Arnold, A Log(N) Distributed Mutual Exclusion Algorithm Based on Path Reversal 1996 34 JPDC Lu & Chung, A Fault-Tolerant Multistage Combining Network 1996 34 JPDC Sanchis & Squire, Parallel Algorithms for Counting and Randomly Generating Integer Partitions 1996 34 JPDC Calvin & Trystram, Matrix Transpose for Block Allocations on Torus and de Bruijn Networks 1996 34 JPDC Trahan & Vaidyanathan & Thiruchelvan, On the Power of Segmenting and Fusing Buses 1996 34 JPDC Fujita & Yamashita, A Nonoblivious Bus Access Scheme Yields an Optimal Partial Sorting Algorithm 1996 33 JPDC Chang, A Simulation Study on Distributed Mutual Exclusion 1996 33 JPDC Merrall, Parallel Execution of Nested Parallel Expressions 1996 33 JPDC Banerjee & Ghosh & Reddy, Parallel Algorithm for Shortest Pairs of Edge-Disjoint Paths 1996 33 JPDC Dighe & Vaidyanathan & Zheng, The Bus-Connected Ringed Tree: A Versatile Interconnection Network 1996 33 JPDC Mourad & Fuchs & Saab, Site Partitioning for Redundant Arrays of Distributed Disks 1996 33 JPDC Sang & Mascarenhas & Rego, Mobile-Process-Based Parallel Simulation 1996 33 JPDC Tsay & Chang, Designing Lower-Dimensional Regular Arrays for Algorithms with Uniform Dependencies 1996 33 JPDC Matheson & Tarjan, Analysis of Multigrid Algorithms on Massively Parallel Computers: Architectural Implications 1996 33 JPDC Veanes & Barklund, Natural Cycletrees: Flexible Interconnection Graphs 1996 33 JPDC Bhatt & Chung & Leighton & Rosenberg, Scheduling Tree-Dags Using FIFO Queues: A Control-Memory Trade-Off 1996 33 JPDC Bermond & Peyrat & Sakho & Tchuente, Parallelization of the Gaussian Elimination Algorithm on Systolic Arrays 1996 33 JPDC Flocchini & Mans, Optimal Elections in Labeled Hypercubes 1996 33 JPDC Cheung & Lau, Routing with Locality on Meshes with Buses 1996 33 JPDC Rouskov & Latifi & Srimani, Conditional Fault Diameter of Star Graph Networks 1996 33 JPDC Chan & Chin & Chu & Mak, Dilation-5 Embedding of 3-Dimensional Grids into Hypercubes 1996 32 JPDC Hambrusch & Khokhar, C^3: A Parallel Model for Coarse-Grained Machines 1996 32 JPDC Gupta & Kaushik & Huang & Sadayappan, Compiling Array Expressions for Efficient Execution on Distributed-Memory Machines 1996 32 JPDC Fragopoulou & Akl & Meijer, Optimal Communication Primitives on the Generalized Hypercube Network 1996 32 JPDC Olariu & Schwing, A Novel Deterministic Sampling Scheme with Applications to Broadcast-Efficient Sorting on the Reconfigurable Mesh 1996 32 JPDC Lin & Tzeng, Effective Utilization of Hypercubes in the Presence of Faults 1996 32 JPDC Brzezinski & Helary & Raynal & Singhal, Erratum: Deadlock Models and a General Algorithm for Distributed Deadlock Detection 1995 31 JPDC Kulasinghe & El-Amawy, On Achieving Maximum Performance in Time-Varying Arrays 1995 31 JPDC Brzezinski & Helary & Raynal & Singhal, Deadlock Models and a General Algorithm for Distributed Deadlock Detection 1995 31 JPDC Robinson & Judd & McKinley & Cheng, Efficient Multicast in All-Port Wormhole-Routed Hypercubes 1995 31 JPDC Buker & Mertsching, Parallel Evaluation of Hierarchical Image Databases 1995 31 JPDC Greenberg & Oh, Packet Routing in Networks with Long Wires 1995 31 JPDC Litow & Hosseini & Vairavan & Wolffe, Performance Characteristics of a Load Balancing Algorithm 1995 31 JPDC Latifi, Migration of Tasks in Interconnection Networks Based on the Star Graph 1995 31 JPDC Haldar & Vidyasankar, Buffer-Optimal Constructions of 1-Writer Multireader Multivalued Atomic Shared Variables 1995 31 JPDC Ferragina, A Technique to Speed Up Parallel Fully Dynamic Algorithms for MST 1995 31 JPDC Yen & Bastani, Parallel Hashing: Collision Resolution Strategies and Performance 1995 31 JPDC Draper & Faber, The Diameter and Average Distance of Supertoroidal Networks 1995 31 JPDC Leung & Tam & Wong & Young, Routing Messages with Release Time and Deadline Constraints 1995 31 JPDC Arguello & Bruguera & Zapata, A Parallel Architecture for the Self-Sorting FFT Algorithm 1995 30 JPDC Ben-Asher & Gordon & Schuster, Efficient Self-Simulation Algorithms for Reconfigurable Arrays 1995 30 JPDC Lai & Sheng, Triangulation on Reconfigurable Meshes: A Natural Decomposition Approach 1995 30 JPDC Venkatesan & Ramarao, Making Fault-Sensitive Algorithms Tolerate Link Failures 1995 30 JPDC Newman & Schuster, Hot Potato Worm Routing via Store-and-Forward Packet Routing 1995 30 JPDC Das & Sinha, Optimal Communication Algorithms in Distributed Loop Networks 1995 29 JPDC Lin & Prasanna, Bounds on the Diameter of One-Dimensional PEC Networks 1995 29 JPDC Anderson & Setubal, A Parallel Implementation of the Push-Relabel Algorithm for the Maximum Flow Problem 1995 29 JPDC Lin & Wang, Message Pattern Routing in Hypercubes: A Distribute-Concentrate Approach 1995 29 JPDC Aboelaze & Wah, A Processor Array with Bounded I/O Ports for Computing Transitive Closures 1995 29 JPDC Fan & Abu-Ghazaleh & Wilsey, On the Complexity of Scheduling MIMD Operations for SIMD Interpretation 1995 28 JPDC Rhee & Dhall & Lakshmivarahan, The Minimum Weight Dominating Set Problem for Permutation Graphs Is in NC 1995 28 JPDC Cheng & Agrawala, Optimal Replication of Series-Parallel Graphs for Computation-Intensive Applications 1995 28 JPDC Clement & Quinn, Overlapping Computations, Communications and I/O in Parallel Sorting 1995 28 JPDC Babaoglu & Raynal, Specification and Verification of Dynamic Properties in Distributed Computations 1995 28 JPDC Lin & McKinley & Esfahanian, Adaptive Multicast Wormhole Routing in 2D Mesh Multicomputers 1995 28 JPDC Seban, A Distributed Critical Section Protocol for General Topology 1995 28 JPDC Jain & Rajaraman, Improved Lower Bounds on Time and Processors for Scheduling Precedence Graphs on Multicomputer Systems 1995 27 JPDC Kankanhalli & Franklin, Area and Perimeter Computation of the Union of a Set of Iso-rectangles in Parallel 1995 27 JPDC Bhagavathi & Olariu & Schwing & Shen & Wilson & Zhang, Convexity Problems on Meshes with Multiple Broadcasting 1995 27 JPDC Bilardi & Preparata, Horizons of Parallel Computation 1995 27 JPDC Baldoni & Ciciani & Cioffi, On the Correctness of Goscinski's Algorithm 1995 27 JPDC Pfluegl & Blough, A New and Improved Algorithm for Fault-Tolerant Clock Synchronization 1995 27 JPDC Mohapatra & Yu & Das, A Lazy Scheduling Scheme for Hypercube Computers 1995 27 JPDC Schwiebert & Jayasimha, Optimal Fully Adaptive Minimal Wormhole Routing for Meshes 1995 27 JPDC Das & Min, A Unified Approach to the Parallel Construction of Search Trees 1995 27 JPDC Stewart, Reasoning about Data-Parallel Array Assignment 1995 27 JPDC Bokka & Gurla & Olariu & Schwing, Constant-Time Convexity Problems on Reconfigurable Meshes 1995 27 JPDC Olariu & Overstreet & Wen, Reconstructing a Binary Tree from Its Traversals in Doubly Logarithmic CREW Time 1995 26 JPDC Chen & Olariu & Schwing & Wang & Zhang, Constant-Time Tree Algorithms on Reconfigurable Meshes on Size n x n 1995 26 JPDC Maheshwari, Partitioning and Scheduling of Parallel Functional Programs for Larger Grain Execution 1995 26 JPDC Choy & Singh, Efficient Implementation of Synchronous Communication over Asynchronous Networks 1995 26 JPDC Mayr & Werchner, Optimal Routing of Parentheses on the Hypercube 1995 26 JPDC Dahlgren & Stenstrom, Using Write Caches to Improve Performance of Cache Coherence Protocols in Shared-Memory Multiprocessors 1995 26 JPDC Singh, A Framework for Programming with Nonatomic Memories 1995 26 JPDC Billionnet & Elloumi, An Algorithm for Finding the K-Best Allocations of a Tree Structured Program 1995 26 JPDC Bhattacharya & Keefe & Tsai, Covert Channel Secure Hypercube Message Communication 1995 26 JPDC Seznec & Lenfant, Odd Memory Systems: A New Approach 1995 26 JPDC Rajasekaran & Raghavachari, A Randomized Algorithm for Multipacket Routing on the Mesh 1995 26 JPDC Boppana & Raghavendra, On Methods to Align and Access Data Arrays in Parallel Computers 1995 26 JPDC Szymanski, ``Hypermeshes'': Optical Interconnection Networks for Parallel Computing 1995 26 JPDC Ohring & Das, Incomplete Hypercubes: Embeddings of Tree-Related Networks 1995 26 JPDC Khanna & Fuchs, A Linear Time Algorithm for Sequential Diagnosis in Hypercubes 1995 26 JPDC Sur & Srimani, An Almost Regular Fault Tolerant Network with Arbitrary Number of Nodes 1995 26 JPDC Chatterjee & Gilbert & Long & Schreiber & Teng, Generating Local Addresses and Communication Sets for Data-Parallel Programs 1995 26 JPDC Karinthi & Srinivas & Almasi, A Parallel Algorithm for Computing Polygon Set Operations 1995 26 JPDC Rajasekaran & Ramaswami, Optimal Mesh Algorithms for the Voronoi Diagram of Line Segments and Motion Planning in the Plane 1995 26 JPDC Arvind & Kamakoti & Rangan, Efficient Parallel Algorithms for Permutation Graphs 1995 26 JPDC Peleg, A Note on Optimal Time Broadcast in Faulty Hypercubes 1995 25 JPDC Richards & Liestman, Degree-Constrained Pyramid Spanners 1995 25 JPDC Jang & Prasanna, An Optimal Sorting Algorithm on Reconfigurable Mesh 1995 25 JPDC Blelloch & Chatterjee & Zagha, Solving Linear Recurrences with Loop Raking 1995 25 JPDC Bruck & Cypher & Ho, On the Construction of Fault-Tolerant Cube-Connected Cycles Networks 1995 24 JPDC Chen & Stallmann, On Embedding Binary Trees into Hypercubes 1995 24 JPDC Agrawal & Abbadi, A Token-Based Fault-Tolerant Distributed Mutual Exclusion Algorithm 1995 24 JPDC Barnett & Littlefield & Payne & van de Geijn, Global Combine Algorithms for 2-D Meshes with Wormhole Routing 1995 24 JPDC Sridhar & Raghavendra, Computing Large Subcubes in Residual Hypercubes 1995 24 JPDC Nakano, Optimal Initializing Algorithms for a Reconfigurable Mesh 1995 24 JPDC Fragopoulou & Akl, Optimal Communication Algorithms on Star Graphs Using Spanning Tree Constructions 1995 24 JPDC Siu & Roychowdhury & Kailath, Toward Massively Parallel Design of Multipliers 1995 24 JPDC Ibarra & Zheng, An Optimal Shortest Path Parallel Algorithm for Permutation Graphs 1995 24 JPDC Shen & Hu & Liang, Embedding K-ary Complete Trees into Hypercubes 1995 24 JPDC Bhandarkar & Arabnia, The Hough Transform on a Reconfigurable Multi-Ring Network 1994 23 JPDC Guo, Optically Interconnected Processor Arrays with Switching Capability 1994 23 JPDC Venkatesan & Ramarao, Computing Associative Functions Distributively in Spite of Link Failures 1994 23 JPDC Bruno & Cappello, Implementing the 3D Alternating Direction Method on the Hypercube 1994 23 JPDC Liang & Bhattacharya & Tsai, Fault-Tolerant Multicasting on Hypercubes 1994 23 JPDC Conn & Podrazik, Parallel Recurrence Solvers for Vector and SIMD Supercomputers 1994 23 JPDC Deo & Jain & Medidi, Parallel Construction of (a,b)-Trees 1994 23 JPDC Chang, Comments on ``Two Algorithms for Mutual Exclusion in Real-Time Distributed Computer Systems'' 1994 23 JPDC Shi & Ritter, A Fast Algorithm for Image Component Labeling with Local Operators on Mesh Connected Computers 1994 23 JPDC Han & Igarashi & Kanai & Miura, Broadcasting in Faulty Binary Jumping Networks 1994 23 JPDC Gil & Matias, Fast and Efficient Simulations among CRCW PRAMs 1994 23 JPDC Gil, Renaming and Dispersing: Techniques for Fast Load Balancing 1994 23 JPDC Varvarigos & Bertsekas, Partial Multinode Broadcast and Partial Exchange Algorithms for d-Dimensional Meshes 1994 23 JPDC Tseng & Lai & Wu, Matrix Representation of Graph Embedding in a Hypercube 1994 23 JPDC Woo & Naylor, Optimal Routing Algorithms for a Class of Cylindrical Banyan Multicomputers 1994 23 JPDC Dehne & Fabri & Nassar & Rau-Chaplin & Valiveti, Construction of d-Dimensional Hyperoctrees on a Hypercube Multiprocessor 1994 23 JPDC Martel & Raghunathan, Asynchronous PRAMs with Memory Latency 1994 23 JPDC Nigam & Sahni, Sorting n Numbers on n x n Reconfigurable Meshes with Buses 1994 23 JPDC Scheuermann & Yaagoub & OUksel, Compression of Binary Images on a Hypercube Machine 1994 23 JPDC Annexstein, Embedding Hypercubes and Related Networks into Mesh-Connected Processor Arrays 1994 23 JPDC Lan, Adaptive Fault-Tolerant Multicast in Hypercube Multicomputers 1994 23 JPDC Atkinson & Sack, Uniform Generation of Binary Trees in Parallel 1994 23 JPDC Heydemann & Opatrny & Sotteau, Embeddings of Hypercubes and Grids into de Bruijn Graphs 1994 22 JPDC Ellis & Mata-Montero & Muller, Serial and Parallel Algorithms for (k,2)-Partite Graphs 1994 22 JPDC Chalasani & Raghavendra & Varma, Fault-Tolerant Routing in MIN-Based Supercomputers 1994 22 JPDC Gabarro & Galvalda, An Approach to Correctness of Data Parallel Algorithms 1994 22 JPDC Misic & Jovanovic, Routing Function and Deadlock Avoidance in a Star Graph Interconnection Network 1994 22 JPDC Bertossi & Logi, Parallel String Matching with Variable Length Don't Cares 1994 22 JPDC Gerbessiotis & Valiant, Direct Bulk-Synchronous Parallel Algorithms 1994 22 JPDC Chiu & Chalasani & Raghavendra, Flexible Routing Criteria for Circuit-Switched Hypercubes 1994 22 JPDC Wu, An Optimal Fault-Tolerant Nonredundant Broadcasting Scheme in Injured Hypercubes 1994 22 JPDC Higham & Schenk, Maintaining B-Trees on an EREW PRAM 1994 22 JPDC Bajard & Duprat & Kla & Muller, Some Operators for On-Line Radix-2 Computations 1994 22 JPDC Gusev & Evans, A New Matrix Vector Product Systolic Array 1994 22 JPDC Oruc, A Study of Permutation Networks: New Designs and Some Generalizations 1994 22 JPDC Johnson, A Highly Concurrent Priority Queue 1994 22 JPDC Uyar & Reeves, Fault Reconfiguration for the Near Neighbor Task in a Multistage-Network MIMD System 1994 22 JPDC Qiu & Akl & Meijer, On Some Properties and Algorithms for the Star and Pancake Interconnection Networks 1994 22 JPDC Lin & Olariu, An Optimal Parallel Matching Algorithm for Cographs 1994 22 JPDC Makedon & Symvonis, Optimal Algorithms for Multipacket Routing Problems on Rings 1994 22 JPDC Kshemkalyani & Singhal, On Characterization and Correctness of Distributed Deadlock Detection 1994 22 JPDC Kumar & Grama & Vempaty, Scalable Load Balancing Techniques for Parallel Computers 1994 22 JPDC Bhattacharya & Elsesser & Tsai & Du, Multicasting in Generalized Multistage Interconnection Networks 1994 22 JPDC Yang & Tien & Raghavendra, Reconfiguration of Rings and Meshes in Faulty Hypercubes 1994 22 JPDC Eberbach, CSA: In the Direction of Greater Representational Power for Neurocomputing 1994 22 JPDC Bhagavathi & Olariu & Shen & Wilson, A Time-Optimal Multiple Search Algorithm on Enhanced Meshes, with Applications 1994 22 JPDC Bauer & Feeney & Gargantini, Parallel 3-D Filling with Octrees 1994 21 JPDC Donaldson & Berman & Paturi, Program Speedup in a Heterogeneous Computing Network 1994 21 JPDC Manzini, Sparse Matrix Computations on the Hypercube and Related Networks 1994 21 JPDC Singh & Kurose, Electing ``Good'' Leaders 1994 21 JPDC Galil & Park, Parallel Algorithms for Dynamic Programming Recurrences with More Than O(1) Dependency 1994 21 JPDC Lee, Generalized Recursive Sorting Networks 1994 20 JPDC Johnsson & Ho, Binary Cube Emulation of Butterfly Networks Encoded by Gray Code 1994 20 JPDC Nassimi, Nearly Logarithmic-Time Parallel Algorithms for the Class of +/-2^b ASCEND Computations on a SIMD Hypercube 1994 20 JPDC Ibarra & Kim, Fast Parallel Algorithms for Solving Triangular Systems of Linear Equations on the Hypercube 1994 20 JPDC Herbordt & Corbett & Weems & Spalding, Practical Algorithms for Online Routing on Fixed and Reconfigurable Meshes 1994 20 JPDC Zwietering & Aarts & Wessels, The Minimal Number of Layers of a Perceptron That Sorts 1994 20 JPDC Peng & Lo, A Simple Optimal Parallel Algorithm for a Core of a Tree 1994 20 JPDC Alnuweiri & Prasanna, Efficient Parallel Computations on the Reduced Mesh of Trees Organization 1994 20 JPDC Lee & Kruskal & Kuck, On the Effectiveness of Combining in Resolving `Hot Spot' Contention 1994 20 JPDC Palis & Rajasekaran & Wei, Packet Routing and PRAM Emulation on Star Graphs and Leveled Networks 1994 20 JPDC Weemeeuw & Demoen, A Fine-Grained Parallel Memory Compaction Algorithm 1994 20 JPDC Leung & Shende, On Multidimensional Packet Routing for Meshes with Buses 1994 20 JPDC Funabiki & Takefuji, A Parallel Algorithm for Traffic Control Problems in Three-Stage Connecting Networks 1994 20 JPDC Wagner, Embedding the Complete Tree in the Hypercube 1994 20 JPDC Zhang & Korf, Parallel Heap Operations on an EREW PRAM 1994 20 JPDC Atallah & Dehne & Miller & Rau-Chaplin & Tsay, Multisearch Techniques: Parallel Data Structures on Mesh-Connected Computers 1994 20 JPDC Raghavendra & Sridhar, Routing Permutations on Hypercube Machines with Half-Duplex Links 1994 20 JPDC Dekel & Hu, A Parallel Algorithm for Finding Minimum Cutsets in Reducible Graphs 1994 20 JPDC Hambrusch & He & Miller, Parallel Algorithms for Gray-Scale Digitized Picture Component Labeling on a Mesh-Connected Computer 1994 20 JPDC Jenq & Sahni, Reconfigurable Mesh Algorithms for the Hough Transform 1994 20 JPDC Akl & Meijer & Stojmenovic, An Optimal Systolic Algorithm for Generating Permutations in Lexicographic Order 1994 20 JPDC Chiang & Chen, Distributed Fault-Tolerant Routing in Kautz Networks 1994 20 JPDC Marinescu & Rice, On High Level Characterization of Parallelism 1994 20 JPDC Ho & Raghunath & Johnsson, An Efficient Algorithm for Gray-to-Binary Permutation on Hypercubes 1993 19 JPDC Gupta & Hambrusch, Multiple Network Embeddings into Hypercubes 1993 19 JPDC Brown & Xiong, A Parallel Quicksort Algorithm 1993 19 JPDC Dingle & Sudborough, Simulation of Binary Trees and X-Trees on Pyramid Networks 1993 19 JPDC Choi & Somani, Rearrangeable Circuit-Switched Hypercube Architectures for Routing Permutations 1993 19 JPDC Ranka & Wang & Yeh, Embedding Meshes on the Star Graph 1993 19 JPDC Lin, Perfectly Overlapped Generation of Long Runs for Sorting Large Files 1993 19 JPDC Peir & Lee, Look-Ahead Routing Switches for Multistage Interconnection Networks 1993 19 JPDC Ferretti, The Generalized Hough Transform on Mesh-Connected Computers 1993 19 JPDC Nassimi & Tsai, An Efficient Implementation of Batcher's Odd-Even Merge on a SIMD Hypercube 1993 19 JPDC Tzeng, A Reliable Cube-Connected Cycles Structure 1993 18 JPDC Bohm & Hiromoto, The Dataflow Time and Space Complexity of FFT's 1993 18 JPDC Wagner, Embedding All Binary Trees in the Hypercube 1993 18 JPDC Ma & Tao, Embeddings among Meshes and Tori 1993 18 JPDC Singhal, A Taxonomy of Distributed Mutual Exclusion 1993 17 JPDC Park & Ewerbring, An Algorithm for the Generalized Singular Value Decomposition on Massively Parallel Computers 1993 17 JPDC Chan & Lee, Fault-Tolerant Permutation Routing in Hypercubes 1993 17 JPDC Kapralski, New Methods for the Generation of Permutations, Combinations, and Other Combinatorial Objects in Parallel 1993 17 JPDC Gupta & Bruell & Ghosh, Mutual Exclusion on a Hypercube 1993 17 JPDC Skillicorn & Barnard, Compiling in Parallel 1993 17 JPDC Barak & Ben-Natan, Bounded Contractions in Full Trees 1993 17 JPDC Mayr & Plaxton, Pipelined Parallel Prefix Computations, and Sorting on a Pipelined Hypercube 1993 17 JPDC Cormen, Fast Permuting on Disk Arrays 1993 17 JPDC Vitter & Nodine, Large-Scale Sorting in Uniform Memory Hierarchies 1993 17 JPDC Malhotra & Trivedi, Reliability Analysis of Redundant Arrays of Inexpensive Disks 1992 16 JPDC Siegel & Abraham & Bain & Batcher & Casavant & DeGroot & Dennis & Douglas & Feng & Goodman & Huang & Jordan & Jump & Patt & Smith & Smith & Snyder & Stone & Tuck & Wah, Report of the Purdue Workshop on Grand Challenges in Computer Architecture for the Support of High Performance Computing 1992 16 JPDC Heywood & Ranka, A Practical Hierarchical Model of Parallel Computation. I. The Model 1992 16 JPDC Heywood & Ranka, A Practical Hierarchical Model of Parallel Computation. II. Binary Tree and FFT Algorithms 1992 16 JPDC Ben-Asher & Egozi & Schuster, 2-D SIMD Algorithms for Perfect Shuffle Networks 1992 16 JPDC Takaoka & Umehara, An Efficient VLSI Algorithm for the All Pairs Shortest Path Problem 1992 16 JPDC Sheu & Chen & Chang, Fault-Tolerant Sorting Algorithm on Hypercube Multicomputers 1992 16 JPDC Johnsson & Ho, Generalized Shuffle Permutations on Boolean Cubes 1992 16 JPDC Fraigniaud, Complexity Analysis of Broadcasting in Hypercubes with Restricted Communication Capabilities 1992 16 JPDC Ziavras, On the Problem of Expanding Hypercube-Based Systems 1992 16 JPDC Cheng & Sawchuk, A One-Copy Algorithm for 2-D Shuffles for Optical Omega Networks 1992 16 JPDC Clark & McColm & Stark, On the Complexity of Deadlock-Free Programs on a Ring of Processors 1992 15 JPDC Bolosky & Scott, Evaluation of Multiprocessor Memory Systems Using Off-Line Optimal Behavior 1992 15 JPDC Marsh & Brown & LeBlanc & Scott & Becker & Das & Karlsson & Quiroz, Operating System Support for Animate Vision 1992 15 JPDC Li, Minimum Deadlock-Free Message Routing Restrictions in Binary Hypercubes 1992 15 JPDC Rajasekaran & Overholt, Constant Queue Routing on a Mesh 1992 15 JPDC Kuo & Moldovan, The State of the Art in Parallel Production Systems 1992 15 JPDC Wilkinson, Overlapping Connectivity Interconnection Networks for Shared Memory Multiprocessor Systems 1992 15 JPDC Sridhar & Iyengar & Rajanarayanan, Range Search in Parallel Using Distributed Data Structures 1992 15 JPDC Iqbal, Efficient Algorithms for Dilated Mappings of Binary Trees 1992 15 JPDC Chen & Chen & Chen, Efficient Median Finding and Its Application to Two-Variable Linear Programming on Mesh-Connected Computers with Multiple Broadcasting 1992 14 JPDC Shi & Schaeffer, Parallel Sorting by Regular Sampling 1992 14 JPDC Yeh & Feng, Algorithm-Based Fault Tolerance for Matrix Inversion with Maximum Pivoting 1992 14 JPDC Lee & Hayes, Design of Gracefully Degradable Hypercube-Connected Systems 1992 14 JPDC Fagin, Large Integer Multiplication on Hypercubes 1992 14 JPDC Ja'Ja' & Ryu, Load Balancing and Routing on the Hypercube and Related Networks 1992 14 JPDC Guan & Langston, Parallel Methods for Solving Fundamental File Rearrangement Problems 1992 14 JPDC Wang & Mendel, Parallel Structured Networks for Solving a Wide Variety of Matrix Algebra Problems 1992 14 JPDC Funabiki & Takefuji & Lee, A Neural Network Model for Finding a Near-Maximum Clique 1992 14 JPDC Wong & Delosme, Transformation of Broadcasts into Propagations in Systolic Algorithms 1992 14 JPDC Tzeng & Chen, An Effective Approach to the Enhancement of Incomplete Hypercube Computers 1992 14 JPDC Sengupta & Zemoudeh & Bandyopadhyay, Self-Routing Algorithms for Strongly Regular Multistage Interconnection Networks 1992 14 JPDC Colbourn & Heinrich, Conflict-Free Access to Parallel Memories 1992 14 JPDC Provost & Melhem, A Distributed Algorithm for Embedding Trees in Hypercubes with Modifications for Run-Time Fault Tolerance 1992 14 JPDC Youssef & Narahari, Topological Properties of Generalized Banyan-Hypercube Networks 1991 13 JPDC Savage & Wloka, Parallelism in Graph-Partitioning 1991 13 JPDC Carmona & Rice, Modeling the Serial and Parallel Fractions of a Parallel Algorithm 1991 13 JPDC Yuan & Agrawala, Fault-Tolerant Decentralized Commit Protocols 1991 13 JPDC Lin & Storer, Processor-Efficient Hypercube Algorithms for the Knapsack Problem 1991 13 JPDC Sen & Sengupta & Bandyopadhyay, Generalized Supercube: An Incrementally Expandable Interconnection Network 1991 13 JPDC Kumar & Singh, Scalability of Parallel Algorithms for the All-Pairs Shortest-Path Problem 1991 13 JPDC Ben-Asher & Peleg & Ramaswami & Schuster, The Power of Reconfiguration 1991 13 JPDC Storer & Reif, A Parallel Architecture for High-Speed Data Compression 1991 13 JPDC Wein & Zenios, On the Massively Parallel Solution of the Assignment Problem 1991 13 JPDC Ho, Optimal Broadcasting on SIMD Hypercubes without Indirect Addressing Capability 1991 13 JPDC Lin & Olariu, An NC Recognition Algorithm for Cographs 1991 13 JPDC Koc & Arachchige, A Fast Algorithm for Gaussian Elimination over GF(2) and Its Implementation on the GAPP 1991 12 JPDC Antonio & Tsai & Huang, A Highly Parallel Algorithm for Multistage Optimization Problems and Shortest Path Problems 1991 12 JPDC Dutt & Hayes, Designing Fault-Tolerant Systems Using Automorphisms 1991 12 JPDC Guo & Melhem & Hall & Chiarulli & Levitan, Pipelined Communications in Optically Interconnected Arrays 1991 12 JPDC Dandamudi & Eager, On Hypercube-Based Hierarchical Interconnection Network Design 1991 12 JPDC Zeppenfeld, Parallel Search in Bivalued Game Trees 1991 12 JPDC Panda & Hwang, Fast Data Manipulation in Multiprocessors Using Parallel Pipelined Memories 1991 12 JPDC Aumann & Schuster, Improved Memory Utilization in Deterministic PRAM Simulation 1991 11 JPDC Bertsekas & Ozveren & Stamoulis & Tseng & Tsitsiklis, Optimal Communication Algorithms for Hypercubes 1991 11 JPDC Dimitrovsky, The Group Lock and Its Applications 1991 11 JPDC Martinez & Campbell, A Self-Adjusting Dynamic Logic Module 1991 11 JPDC Padmanabhan, Efficient Architectures for Data Access in a Shared Memory Hierarchy 1991 11 JPDC Edelman, Optimal Matrix Transposition and Bit Reversal on Hypercubes: All-to-All Personalized Communication 1991 11 JPDC Chlebus & Vrto, Parallel Quicksort 1991 11 JPDC Efe, Embedding Mesh of Trees in the Hypercube 1991 11 JPDC Varadarajan, Embedding Shuffle Networks in Hypercubes 1991 11 JPDC Wang & Chen, Cost-Optimal Parallel Algorithms for Constructing 2-3 Trees 1991 11 JPDC Boppana & Raghavendra, Generalized Schemes for Access and Alignment of Data in Parallel Processors with Self-Routing Interconnection Networks 1991 11 JPDC LaRowe & Ellis, Page Placement Policies for NUMA Multiprocessors 1991 11 JPDC Schwiegelshohn & Gasperoni & Ebcioglu, On Optimal Parallelization of Arbitrary Loops 1991 11 JPDC Kunde & Tensi, (k-k) Routing on Multidimensional Mesh-Connected Arrays 1991 11 JPDC Balsara & Owens & Irwin, Digit Serial Multipliers 1991 11 JPDC Wright, Parallel Algorithms for Generating the Raster Representation of Straight Lines and Circles 1991 11 JPDC Weems & Riseman & Hanson & Rosenfeld, The DARPA Image Understanding Benchmark for Parallel Computers 1991 11 JPDC Seban, FTN Topology and Protocols 1991 11 JPDC Chan & Lee, Distributed Fault-Tolerant Embeddings of Rings in Hypercubes 1991 11 JPDC Bernhard & Rosenkrantz, An Efficient Method for Representing and Transmitting Message Patterns on Multiprocessor Interconnection Networks 1991 11 JPDC Scherson & Corbett, Communications Overhead and the Expected Speedup of Multidimensional Mesh-Connected Parallel Processors 1990 10 JPDC Cormen & Leiserson, A Hyperconcentrator Switch for Routing Bit-Serial Messages 1990 10 JPDC Silverman, Parallel Polynomial Arithmetic over Finite Rings 1990 10 JPDC Leung & Tam & Wong & Young & Chin, Packing Squares into a Square 1990 10 JPDC Koppelman & Oruc, A Self-Routing Permutation Network 1990 10 JPDC Li & Cheng, Static Job Scheduling in Partitionable Mesh Connected Systems 1990 10 JPDC Hosseini & Litow & Malkawi & McPherson & Vairavan, Analysis of a Graph Coloring Based Distributed Load Balancing Algorithm 1990 10 JPDC Stout & Wagar, Intensive Hypercube Communication. Prearranged Communication in Link-Bound Machines 1990 10 JPDC Lisper, Synthesis of Time-Optimal Systolic Arrays with Cells with Inner Structure 1990 10 JPDC Wah & Li, Optimal Parallel Evaluation of AND Trees 1990 10 JPDC Hung & Rosenfeld, Processing Border Codes on a Mesh-Connected Computer 1990 10 JPDC Cohn, Implementing the Multiprefix Operation Efficiently 1990 10 JPDC Ercal & Ramanujam & Sadayappan, Task Allocation onto a Hypercube by Recursive Mincut Bipartitioning 1990 9 JPDC Moser & Melliar-Smith, The World Banker's Problem 1990 9 JPDC Hohberg, How to Find Biconnected Components in Distributed Networks 1990 9 JPDC Fan & Cheng, Design and Analysis of Simultaneous Access Priority Queues 1990 9 JPDC Gupta & Lee, The n-Omega: An Omega-like Topology for Distributed-Memory Multiprocessors 1990 9 JPDC Ranka & Sahni, String Editing on an SIMD Hypercube Multicomputer 1990 9 JPDC Nation & Siegel, Disjoint Path Properties of the Data Manipulator Network Family 1990 9 JPDC Harper & Jump, Evaluation of Reduced Bandwidth Multistage Networks 1990 9 JPDC Park & Balasubramanian, Reducing Communication Costs for Sorting on Mesh-Connected and Linearly Connected Parallel Computers 1990 9 JPDC LeBlanc & Mellor-Crummey & Fowler, Analyzing Parallel Program Executions Using Multiple Views 1990 9 JPDC Kuo & Fuchs, Reconfigurable Cube-Connected Cycles Architectures 1990 9 JPDC Bertolazzi & Salza & Guerra, A Parallel Algorithm for the Visibility Problem from a Point 1990 9 JPDC Li & Venkatesh & Radhakrishnan, Time Advancement in Distributed Event Simulation 1990 9 JPDC Zimmermann, The Theory of Acyclic Systolic Systems 1990 9 JPDC Lai & White, Mapping Pyramid Algorithms into Hypercubes 1990 9 JPDC Huang, A Fully Pipelined Minimum-Spanning-Tree Constructor 1990 9 JPDC Dehne, Computing the Largest Empty Rectangle on One- and Two-Dimensional Processor Arrays 1990 9 JPDC Goodrich & Atallah, On Performing Robust Order Statistics in Tree-Structured Dictionary Machines 1990 9 JPDC Goscinski, Two Algorithms for Mutual Exclusion in Real-Time Distributed Computer Systems 1990 9 JPDC Cheng, A Simultaneous Access Queue 1990 9 JPDC Anger & Hwang & Chow, Scheduling with Sufficient Loosely Coupled Processors 1990 9 JPDC Chowdhury, The Greedy Load Sharing Algorithm 1990 8 JPDC Olukotun & Mudge, Hierarchical Gate-Array Routing on a Hypercube Multiprocessor 1990 8 JPDC Ho & Johnsson, Embedding Meshes in Boolean Cubes by Graph Decomposition 1990 8 JPDC Baru & Goel, Squashed Embedding of E-R Schemas in Hypercubes 1990 8 JPDC Davis & Mannix & Shaw & Hartrum, Distributed Discrete-Event Simulation Using Null Message Algorithms on Hypercube Architectures 1990 8 JPDC Dehne & Rau-Chaplin, Implementing Data Structures on a Hypercube Multiprocessor, and Applications in Parallel Computational Geometry 1990 8 JPDC Teng, Adaptive Parallel Algorithms for Integral Knapsack Problems 1990 8 JPDC Sips & Lin, A New Model for On-Line Arithmetic with an Application to the Reciprocal Calculation 1990 8 JPDC Chandrasekaran & Venkatesan, A Message-Optimal Algorithm for Distributed Termination Detection 1990 8 JPDC Cole & Zajicek, An Optimal Parallel Algorithm for Building a Data Structure for Planar Point Location 1990 8 JPDC Tsay & Yuan, Systolic Flow 1990 8 JPDC Knobe & Lukas & Steele, Data Optimization: Allocation of Arrays to Reduce Communication on SIMD Machines 1990 8 JPDC Blevins & Davis & Heaton & Reif, BLITZEN: A Highly Integrated Massively Parallel Machine 1990 8 JPDC Lan & Esfahanian & Ni, Multicast in Hypercube Multiprocessors 1990 8 JPDC Codenotti & Lotti & Romani, Area-Time Trade-Offs for Matrix-Vector Multiplication 1990 8 JPDC Kim & Agrawal & Plemmons, Least-Squares Multiple Updating Algorithms on a Hypercube 1990 8 JPDC Carlson, Solving Linear Recurrence Systems on Mesh-Connected Computers with Multiple Global buses 1990 8 JPDC Peleg, Time-Optimal Leader Election in General Networks 1989 7 JPDC Juang & Wah, Load Balancing and Ordered Selections in a Computer System with Multiple Contention Buses 1989 7 JPDC Kumar & Tsai, Designing Linear Systolic Arrays 1989 7 JPDC Cheung, An Algorithm with Decentralized Control for Sorting Files in a Network 1989 7 JPDC Zhu & Fang & Li, A New Parallel Sorting Approach with Sorting Memory Module 1989 7 JPDC Wagner, Embedding Arbitrary Binary Trees in a Hypercube 1989 7 JPDC King & Gendreau & Li, Reliable Election in Broadcast Networks 1989 7 JPDC Szymanski & Hamacher, On the Universality of Multipath Multistage Interconnection Networks 1989 7 JPDC Yoon & Lee, B-Banyan and B-Delta Networks for Multiprocessor Systems 1989 7 JPDC Engstrom & Cappello, The SDEF Programming System 1989 7 JPDC Scherson & Ma, Analysis and Applications of the Orthogonal Access Multiprocessor 1989 7 JPDC Parker, A Concurrent Search Structure 1989 7 JPDC Rosenfeld, Arc colorings, Partial Path Groups, and Parallel Graph Contractions 1989 7 JPDC Tel & Wijshoff, Hierarchical Parallel Memory Systems and Multiperiodic Skewing Schemes 1989 7 JPDC Ling & Bayoumi, Systematic Algorithm Mapping for Multidimensional Systolic Arrays 1989 7 JPDC Bongiovanni & Petreschi, Parallel-Depth Search for Acyclic Digraphs 1989 7 JPDC Hung & Rosenfeld, Parallel Processing of Linear Quadtrees on a Mesh-Connected Computer 1989 7 JPDC Schwiegelshohn & Thiele, Linear Systolic Arrays for Matrix Computations 1989 7 JPDC Stark & Kotin, The Social Metaphor for Distributed Processing 1989 7 JPDC Pakzad, Fault Tolerance Analysis of the Class of Rearrangeable Interconnection Networks 1989 7 JPDC Skillicorn & Kocay, A Global Measure of Network Connectivity 1989 7 JPDC Smitley & Lee, Synthesizing Minimum Total Expansion Topologies for Reconfigurable Interconnection Networks 1989 6 JPDC Han, Parallel Algorithms for Computing Linked List Prefix 1989 6 JPDC Peleg & Van Gelder, Packet Distribution on a Ring 1989 6 JPDC Dekel & Ozsvath, Parallel External Merging 1989 6 JPDC Abramson & Yung, Divide and Conquer under Global Constraints: A Solution to the N-Queens Problem 1989 6 JPDC Bier & Loe, Embedding of Binary Trees into Hypercubes 1989 6 JPDC Schroeder, Top-Down Designs of Instruction Systolic Arrays for Polynomial Interpolation and Evaluation 1989 6 JPDC Tagamets & Reggia, A Data Flow Implementation of a Competition-Based Connectionist Model 1989 6 JPDC Arbib, Neural Computing. Guest Editor's Introduction 1989 6 JPDC Kung & Hwang, A Unified Systolic Architecture for Artificial Neural Networks 1989 6 JPDC Barbosa & Gafni, A Distributed Implementation of Simulated Annealing 1989 6 JPDC Johnson, A Neural Network Approach to the 3-Satisfiability Problem 1989 6 JPDC Guerra & Hambrusch, Parallel Algorithms for Line Detection on a Mesh 1989 6 JPDC Schieber & Moran, Parallel Algorithms for Maximum Bipartite Matchings and Maximum 0-1 Flows 1989 6 JPDC Gao, Algorithmic Aspects of Balancing Techniques for Pipelined Data Flow Code Generation 1989 6 JPDC Veldhorst, Gaussian Elimination with Partial Pivoting on an MIMD Computer 1989 6 JPDC Scherson & Ilgen, A Reconfigurable Fully Parallel Associative Processor 1989 6 JPDC Schaeffer, Distributed Game-Tree Searching 1989 6 JPDC Saad & Schultz, Data Communication in Hypercubes 1989 6 JPDC McAulay, Conjugate Gradients on Optical Crossbar Interconnected Multiprocessor 1989 6 JPDC Scherson & Sen & Ma, Two Nearly Optimal Sorting Algorithms for Mesh-Connected Processor Arrays Using Shear-sort 1989 6 JPDC Bodlaender, The Classification of Coverings of Processor Networks 1987 6 JPDC Rotem & Korach & Santoro, Analysis of a Distributed Algorithm for Extrema Finding in a Ring 1987 6 JPDC Berman & Snyder, On Mapping Parallel Algorithms into Parallel Architectures 1987 6 JPDC Bailey & Cuny & MacLeod, Reducing Communication Overhead: A Parallel Code Optimization 1987 6 JPDC Shamir & Upfal, A Probabilistic Approach to the Load-Sharing Problem in Distributed Systems 1988 5 JPDC Purushothaman & Subrahmanyam, Reasoning about Systolic Algorithms 1988 5 JPDC Martel, A Parallel Algorithm for Preemptive Scheduling of Uniform Machines 1988 5 JPDC Oklobdzija & Barnes, On Implementing Addition in VLSI Technology 1988 5 JPDC Mathias & Patnaik, A Systolic Evaluator for Linear, Quadratic, and Cubic Expressions 1988 5 JPDC Jain & Tripathi, An Analysis of Cube-Connected Cycles and Circular Shuffle Networks for Parallel Computation 1988 5 JPDC Sridhar & Raghavendra, Uniform Minimal Full-Access Networks 1988 5 JPDC Nicol & Willard, Problem Size, Parallel Architecture, and Optimal Speedup 1988 5 JPDC Lee & Shragowitz & Sahni, A Hypercube Algorithm for the 0/1 Knapsack Problem 1988 5 JPDC Duprat & Muller, Hardwired Polynomial Evaluation 1988 5 JPDC Kornerup & Matula, An On-Line Arithmetic Unit for Bit-Pipelined Rational Arithmetic 1988 5 JPDC Eriksen, A Termination Detection Protocol and Its Formal Verification 1988 5 JPDC Katz & Volper, Geometric Retrieval in Parallel 1987 4 JPDC Sinclair, Efficient Computation of Optimal Assignments for Distributed Tasks 1987 4 JPDC Balasubramanian & Banerjee, A Fault Tolerant Massively Parallel Processing Architecture 1987 4 JPDC Bhuyan, Analysis of Interconnection Networks with Different Arbiter Designs 1987 4 JPDC Oruc, Designing Cellular Permutation Networks through Coset Decompositions of Symmetric Groups 1987 4 JPDC Teng & Wang, Parallel Algorithms for Message Decomposition 1987 4 JPDC Taylor & Hellerstein & Safra & Shapiro, Notes on the Complexity of Systolic Programs 1987 4 JPDC Cappello, Gaussian Elimination on a Hypercube Automaton 1987 4 JPDC Duval & Wagner & Han & Loveland, Finding Test-and-Treatment Procedures Using Parallel Computation 1987 4 JPDC Vishkin, Randomized Parallel Speedups for List Ranking 1987 4 JPDC Meyer & Podrazik, A Parallel First-Order Linear Recurrence Solver 1987 4 JPDC Johnsson, Communication Efficient Basic Linear Algebra Computations on Hypercube Architectures 1987 4 JPDC Kumar & Raghavendra, Array Processor with Multiple Broadcasting 1987 4 JPDC Taylor, A Residue Arithmetic Implementation of the FFT 1987 4 JPDC Mudge & Abdel-Rahman, Vision Algorithms for Hypercube Machines 1987 4 JPDC Stout, Supporting Divide-and-Conquer Algorithms for Image Processing 1986 3 JPDC Bermond & Delorme & Quisquater, Strategies for Interconnection Networks: Some Methods from Graph Theory 1986 3 JPDC Kumar & Kowalik, Triangularization of a Positive Definite Matrix on a Parallel Computer 1986 3 JPDC Chen, A Design Methodology for Synthesizing Parallel Algorithms and Architectures 1986 3 JPDC Atallah & Goodrich, Efficient Parallel Solutions to Some Geometric Problems 1986 3 JPDC Jegou & Seznec, Data Synchronized Pipeline Architecture: Pipelining in Multiprocessor Environments 1986 3 JPDC Mirchandaney & Stankovic, Using Stochastic Learning Automata for Job Scheduling in Distributed Processing Systems 1986 3 JPDC Dolev & Upfal & Warmuth, The Parallel Complexity of Scheduling with Precedence Constraints 1986 3 JPDC Lai, Termination Detection for Dynamically Distributed Systems with Non-first-in-first-out Communication 1986 3 JPDC Drezner & Barak, An Asynchronous Algorithm for Scattering Information between the Active Nodes of a Multicomputer System 1986 3 JPDC Li & Jayakumar, Systolic Structures: A Notion and Characterization 1986 3 JPDC Sado & Igarashi, Some Parallel Sorts on a Mesh-Connected Processor Array and Their Time Efficiency 1986 3 JPDC Jamieson & Mueller & Siegel, FFT Algorithms for SIMD Parallel Processing Systems 1986 3 JPDC Varma & Raghavendra, On Permutations Passable by the Gamma Network 1986 3 JPDC Ngai & Irwin & Rawat, Regular, Area-Time Efficient Carry-Lookahead Adders 1985 2 JPDC Umeo, A Class of SIMD Machines Simulated by Systolic Arrays 1985 2 JPDC Rosenfeld, The Prism Machine: An Alternative to the Pyramid 1985 2 JPDC Despain & Peterson & Rothaus & Wold, Fast Fourier Transform Processors Using Gaussian Residue Arithmetic 1985 2 JPDC Wu, Embedding of Tree Networks into Hypercubes 1985 2 JPDC Ibarra & Palis & Kim, Some Results Concerning Linear Iterative (Systolic) Arrays 1985 2 JPDC Oruc & Oruc, Equivalence Relations among Interconnection Networks 1984 1 JPDC Kung & Lam, Wafer-Scale Integration and Two-Level Pipelined Implementations of Systolic Arrays 1984 1 JPDC Kumar & Jump, Performance Enhancement in Buffered Delta Networks Using Crossbar Switches and Multiple Links 1988 JPOST Shapiro, Talmudware 1996 22 JSCOMP Kozen & Landau & Zippel, Decomposition of Algebraic Functions 1996 21 JSCOMP Krandick & Jebelean, Bidirectional Exact Integer Division 1996 21 JSCOMP Weber, Parallel Implementation of the Accelerated Integer GCD Algorithm 1996 21 JSCOMP Cesari & Maeder, Performance Analysis of the Parallel Karatsuba Multiplication Algorithm for Distribution Memory Architectures 1996 21 JSCOMP Intrigila & Venturini Zilli, A Remark on Infinite Matching vs Infinite Unification 1996 21 JSCOMP Collins & Encarnacion, Improved Techniques for Factoring Univariate Polynomials 1995 20 JSCOMP Shoup, A New Polynomial Factorization Algorithm and its Implementation 1995 20 JSCOMP Greenhill, Theoretical and Experimental Comparison of Efficiency of Finite Field Extensions 1995 20 JSCOMP Collins & Encarnacion, Efficient Rational Number Reconstruction 1995 20 JSCOMP Encarnacion, Computing GCDs of Polynomials over Algebraic Number Fields 1995 20 JSCOMP Hermann & Kolaitis, The Complexity of Counting Problems in Equational Matching 1995 20 JSCOMP Arnault, Constructing Carmichael Numbers which are Strong Pseudoprimes to Several Bases 1995 20 JSCOMP Eaves & Rothblum, Linear Problems and Linear Algorithms 1995 20 JSCOMP Dauchet & Caron & Coquide, Automata for Reduction Properties Solving 1995 20 JSCOMP Zantema, Total Termination of Term Rewriting is Undecidable 1995 19 JSCOMP Filgueiras & Tomas, A Fast Method for Finding the Basis of Nonnegative Solutions to a Linear Diophantine Equation 1995 19 JSCOMP Lee & Saunders, Fraction Free Gaussian Elimination for Sparse Matrices 1995 19 JSCOMP Poli, A Deterministic Construction of Normal Bases With Complexity O(n^3 + n log n log(log n) log q) 1995 19 JSCOMP Baaz & Fermuller, Resolution-based Theorem Proving for Many-valued Logics 1995 19 JSCOMP Jebelean, A Double-Digit Lehmer-Euclid Algorithm for Finding the GCD of Long Integers 1994 18 JSCOMP Barkee & Can & Ecks & Moriarty & Ree, Why You Cannot Even Hope to use Grobner Bases in Public Key Cryptography: An Open Letter to a Scientist Who Failed and a Challenge to Those Who Have Not Yet Failed 1994 18 JSCOMP Huang & Ierardi, Efficient Algorithms for the Riemann-Roch Problem and for Addition in the Jacobian of a Curve 1994 18 JSCOMP Bach, Tensor Products and Computability 1994 18 JSCOMP Weiermann, Complexity Bounds for Some Finite Forms of Kruskal's Theorem 1994 18 JSCOMP Apt & van Emde Boas & Welling, The STO-problem is NP-hard 1994 18 JSCOMP Priestley & Ward, A Multipurpose Backtracking Algorithm 1994 17 JSCOMP Shoup, Fast Construction of Irreducible Polynomials over Finite Fields 1994 17 JSCOMP Nievergelt, Complexity, Algorithms, Programs, Systems: The Shifting Focus 1994 17 JSCOMP Weber & Knipping & Helmut, An Application of Point Pattern Matching in Astronautics 1994 17 JSCOMP Raymond & Wood, Grail: A C++ Library for Automata and Expressions 1994 17 JSCOMP O'Brien, Isomorphism Testing for p-groups 1994 17 JSCOMP Zantema, Termination of Term Rewriting: Interpretation and Type Elimination 1993 16 JSCOMP Rosenmann, An Algorithm for Constructing Grobner and Free Schreier Bases in Free Group Algebras 1993 16 JSCOMP Jacobs & Muddana, The Word Problem for Free Partially Commutative, Partially Associative Groupoids 1993 16 JSCOMP Boudet, Combining Unification Algorithms 1993 16 JSCOMP Niederreiter & Gottfert, Factorization of Polynomials over Finite Fields 1993 16 JSCOMP Berarducci & Zilli, Generalizations of Unification 1993 16 JSCOMP Reeves & Sturmfels, A Note on Polynomial Reduction 1993 16 JSCOMP Gaal, On the Resolution of F(x,y) = G(x,y) 1993 16 JSCOMP O'Brien, Isomorphism Testing for p-Groups 1993 16 JSCOMP Schorn, An Axiomatic Approach to Robust Geometric Programs 1993 16 JSCOMP Madlener & Sattler-Klein & Otto, On the Problem of Generating Small Convergent Systems 1993 16 JSCOMP Torgersen, Parallel Scheduling of Recursively Defined Arrays: Revisited 1993 15 JSCOMP Chadha & Plaisted, On the Mechanical Derivation of Loop Invariants 1993 15 JSCOMP Dershowitz & Lee, Logical Debugging 1993 15 JSCOMP Fahmy & Biermann, Synthesis of Real Time Acceptors 1993 15 JSCOMP Viry, Factorization of Multivariate Polynomials with Coefficients in F_p 1993 15 JSCOMP Beauzamy & Trevisan & Wang, Polynomial Factorization: Sharp Bounds, Efficient Algorithms 1993 15 JSCOMP Snyder, A Fast Algorithm for Generating Reduced Ground Rewriting Systems from a Set of Ground Equations 1993 15 JSCOMP Zhang & Shirazi & Yun, An Efficient Algorithm and Parallel Implementations for Binary and Residue Number Systems 1993 15 JSCOMP Bergeron, Surprising Mathematics Using A Computer Algebra System 1993 15 JSCOMP Manocha & Canny, MultiPolynomial Resultant Algorithms 1993 15 JSCOMP Jebelean, An Algorithm for Exact Division 1993 15 JSCOMP Grabe, On Lucky Primes 1993 15 JSCOMP Butler & Cannon, On Holt's Algorithm 1993 15 JSCOMP Burris & Lawrence, The Equivalence Problem for Finite Rings 1992 14 JSCOMP Treinen, A New Method for Undecidability Proofs of First Order Theories 1992 14 JSCOMP Dougherty & Johann, An Improved General E-Unification Method 1992 14 JSCOMP Miller, Unification Under a Mixed Prefix 1992 14 JSCOMP Gessel, Super Ballot Numbers 1992 14 JSCOMP Weispfenning, Comprehensive Grobner Bases 1992 13 JSCOMP Grossman & Larson, Symbolic Computation of Derivations Using Labelled Trees 1992 13 JSCOMP Fateman, A Review of Mathematica 1992 13 JSCOMP Sit, An Algorithm for Solving Parametric Linear Systems 1992 13 JSCOMP Sasaki & Suzuki, Three New Algorithms for Multivariate Polynomial GCD 1992 13 JSCOMP Renegar, On the Computational Complexity and Geometry of the First-order Theory of the Reals. Part I: Introduction. Preliminaries. The Geometry of Semi-algebraic Sets. The Decision Problem for the Existential Theory of the Reals 1992 13 JSCOMP Renegar, On the Computational Complexity and Geometry of the First-order Theory of the Reals. Part II: The General Decision Problem. Preliminaries for Quantifier Elimination 1992 13 JSCOMP Renegar, On the Computational Complexity and Geometry of the First-order Theory of the Reals. Part III: Quantifier Elimination 1991 12 JSCOMP Nipkow, Combining Matching Algorithms: The Regular Case 1991 12 JSCOMP Epstein & Holt & Rees, The Use of Knuth-Bendix Methods to Solve the Word Problem in Automatic Groups 1991 12 JSCOMP Sims, The Knuth-Bendix Procedure for Strings as a Substitute for Coset Enumeration 1991 12 JSCOMP Leedham-Green & Praeger & Soicher, Computing with Group Homomorphisms 1991 12 JSCOMP Leon, Permutation Group Algorithms Based on Partitions, I: Theory and Algorithms 1991 12 JSCOMP Otto, When is an Extension of a Specification Consistent? Decidable and Undecidable Cases 1991 12 JSCOMP Roque & Dos Santos, Computer Algebra in Spacetime Embedding 1991 12 JSCOMP Richardson, Wu's Method and the Khovanskii Finiteness Theorem 1991 12 JSCOMP Eikelder & Wilmont, Normal Forms for a Class of Formulas 1991 12 JSCOMP Klop & Middeldorp, Sequentiality in Orthogonal Term Rewriting Systems 1991 12 JSCOMP Champarnaud & Hansel, AUTOMATE, a Computing Package for Automata and Finite Semigroups 1991 12 JSCOMP Yap, A New Lower Bound Construction for Commutative Thue Systems with Applications 1991 12 JSCOMP Takayama, Extraction of Redundancy-free Programs from Constructive Natural Deduction Proofs 1991 11 JSCOMP Morgenstern, Invariant and Geometric Aspects of Algebraic Complexity Theory I 1991 11 JSCOMP Havel, Some Examples of the Use of Distances as Coordinates for Euclidean Geometry 1991 11 JSCOMP Sturmfels, Computational Algebraic Geometry of Projective Configurations 1991 11 JSCOMP Ponder, Parallel Multiplication and Powering of Polynomials 1991 11 JSCOMP Laville, Comparison of Priority Rules in Pattern Matching and Term Rewriting 1991 11 JSCOMP Chazarain & Riscos & Alonso & Briales, Multi-valued Logic and Grobner Bases with Applications to Modal Logic 1991 11 JSCOMP Gentili & O'Connor, Rational Geometry in Space 1991 11 JSCOMP Pais & Peterson, Using Forcing to Prove Completeness of Resolution and Paramodulation 1991 11 JSCOMP Rusinowitch, Theorem-proving with Resolution and Superposition 1991 11 JSCOMP Ganzinger, A Completion Procedure for Conditional Equations 1991 11 JSCOMP Kapur & Narendran & Zhang, Automating Inductionless Induction using Test Sets 1991 11 JSCOMP Kounalis & Rusinowitch, On Word Problems in Horn Theories 1991 11 JSCOMP Socher, On the Relation Between Resolution Based and Completion Based Theorem Proving 1991 11 JSCOMP Plaisted & Potter, Term Rewriting: Some Experimental Results 1990 10 JSCOMP von zur Gathen & Giesbrecht, Constructing Normal Bases in Finite Fields 1990 10 JSCOMP Shallit, On the Worst Case of Three Algorithms for Computing the Jacobi Symbol 1990 10 JSCOMP Shackell, Growth Estimates for Exp-Log Functions 1990 10 JSCOMP Nef & Schmidt, Computing a Sweeping-plane in Regular (``General'') Position: a Numerical and a Symbolic Solution 1990 10 JSCOMP Weispfenning, The Complexity of Almost Linear Diophantine Problems 1990 10 JSCOMP Cucker & Roy, A Theorem on Random Polynomials and Some Consequences in Average Complexity 1990 10 JSCOMP Hunt & Stearns, The Complexity of Equivalence for Commutative Rings 1990 10 JSCOMP von zur Gathen, Functional Decomposition of Polynomials: the Wild Case 1990 10 JSCOMP Mathieu & Ford, On p-adic Computation of the Rational Form of a Matrix 1990 10 JSCOMP Beckman & Stuckrad, The Concept of Grobner Algebras 1990 10 JSCOMP Lallement & McFadden, On the Determination of Green's Relations in Finite Transformation Semigroups 1990 10 JSCOMP Alevizos & Boissonnat & Yvinec, Non-convex Contour Reconstruction 1990 10 JSCOMP Mulmuley, A Fast Planar Partition Algorithm, I 1990 10 JSCOMP Chazelle & Sharir, An Algorithm for Generalized Point Location and its Applications 1990 10 JSCOMP Avis & Imai, Locating a Robot with Angle Measurements 1990 10 JSCOMP Megiddo, On the Complexity of Some Geometric Problems in Unbounded Dimension 1990 10 JSCOMP Edelsbrunner & Preparata & West, Tetrahedrizing Point Sets in Three Dimensions 1990 10 JSCOMP Yap, Symbolic Treatment of Geometric Degeneracies 1990 10 JSCOMP Schwartz & Sharir, On the Two-Dimensional Davenport-Schinzel Problem 1990 10 JSCOMP Ratner & Warmuth, The (n^2 - 1)-Puzzle and Related Relocation Problems 1990 10 JSCOMP Risler & Ronga, Testing Polynomials 1990 10 JSCOMP Grigor'ev, Complexity of Factoring and Calculating the GCD of Linear Ordinary Differential Operators 1990 10 JSCOMP Roy & Szpirglas, Complexity of Computation on Real Algebraic Numbers 1990 10 JSCOMP Norton, On the Asymptotic Analysis of the Euclidean Algorithm 1990 9 JSCOMP Sims, Computing the Order of a Solvable Permutation Group 1990 9 JSCOMP Ma & von zur Gathen, Analysis of Euclidean Algorithms for Polynomials over Finite Fields 1990 9 JSCOMP Gunther, Minimum K-Partitioning of Rectilinear Polygons 1990 9 JSCOMP Ramesh & Ramakrishnan, Parallel Tree Pattern Matching 1990 9 JSCOMP Kaltofen & Buchberger, Computational Algebraic Complexity (editorial) 1990 9 JSCOMP Bach & Shoup, Factoring Polynomials Using Fewer Random Bits 1990 9 JSCOMP Canny, Generalised Characteristic Polynomials 1990 9 JSCOMP Coppersmith & Winograd, Matrix Multiplication via Arithmetic Progressions 1990 9 JSCOMP von zur Gathen, Functional Decomposition of Polynomials: The Tame Case 1990 9 JSCOMP Kaltofen & Trager, Computing with Polynomials Given by Black Boxes for Their Evaluations: Greatest Common Divisors, Factorization, Separation of Numerators and Denominators 1990 9 JSCOMP Rolletschek, Shortest Division Chains in Imaginary Quadratic Number Fields 1990 9 JSCOMP Ronyai, Computing the Structure of Finite Algebras 1990 9 JSCOMP Zippel, Interpolating Polynomials from Their Values 1990 9 JSCOMP Von zur Gathen, Inversion in Finite Fields Using Logarithmic Depth 1990 9 JSCOMP Fulling, The Analytic Approach to Recursion Relations 1989 8 JSCOMP Abdulrab & Pecuchet, Solving Word Equations 1989 8 JSCOMP Dur, On Computing the Canonical Form for a Binary Form of Odd Degree 1989 8 JSCOMP Puel, Using Unavoidable Set of Trees to Generalize Kruskal's Theorem 1989 8 JSCOMP Meseguer & Goguen & Smolka, Order-Sorted Unification 1989 8 JSCOMP Schmidt-Schauss, Unification in Permutative Equational Theories is Undecidable 1989 8 JSCOMP Fribourg, Strong Restriction of the Inductive Completion Procedure 1989 8 JSCOMP Abadi & Manna, Temporal Logic Programming 1989 8 JSCOMP Burckert & Herold & Schmidt-Schauss, On Equational Theories, Unification, and (Un)decidability 1989 8 JSCOMP Schmidt-Schauss, Unification in a Combination of Arbitrary Disjoint Equational Theories 1989 8 JSCOMP Snyder & Gallier, Higher-order Unification Revisited: Complete Sets of Transformations 1989 8 JSCOMP Le Chenadec, On the Logic of Unification 1989 8 JSCOMP Clausen & Fortenbacher, Efficient Solution of Linear Diophantine Equations 1989 8 JSCOMP Lincoln & Christian, Adventures in Associative-Commutative Unification 1989 7 JSCOMP Traugott, Deductive Synthesis of Sorting Programs 1989 7 JSCOMP Suppes & Takahashi, An Interactive Calculus Theorem-Prover for Continuity Properties 1989 7 JSCOMP Kozen & Landau, Polynomial Decomposition Algorithms 1989 7 JSCOMP Narendran & O'Dunlaing, Cancellativity in Finitely Presented Semigroups 1989 7 JSCOMP Siekmann, Unification Theory 1989 7 JSCOMP Martin & Nipkow, Boolean Unification--The Story So Far 1989 7 JSCOMP Smolka & Ait-Kaci, Inheritance Hierarchies: Semantics and Unification 1989 7 JSCOMP Comon & Lescanne, Equational Problems and Disunification 1989 7 JSCOMP Kanellakis & Revesz, On the Relationship of Congruence Closure and Unification 1989 7 JSCOMP Statman, The Word Problem for Smullyan's Lark Combinator is Decidable 1989 7 JSCOMP Scholten & Overmars, General Methods for Adding Range Restrictions to Decomposable Searching Problems 1989 7 JSCOMP Cole & Sharir, Visibility Problems for Polyhedral Terrains 1988 6 JSCOMP Bayer & Stillman, On the Complexity of Computing Syzygies 1988 6 JSCOMP Bachmair & Derschowitz, Critical Pair Criteria for Completion 1988 6 JSCOMP Kapur & Musser & Narendran, Only Prime Superpositions Need be Considered in the Knuth-Bendix Completion Procedure 1988 6 JSCOMP Myers & Gokhale, Parallel Scheduling of Recursively Defined Arrays 1988 6 JSCOMP Wrathall, The Word Problem for Free Partially Commutative Groups 1988 5 JSCOMP Weispfenning, The Complexity of Linear Problems in Fields 1988 5 JSCOMP Davenport & Heintz, Real Quantifier Elimination is Doubly Exponential 1988 5 JSCOMP Grigor'ev & Vorobjov, Solving Systems of Polynomial Inequalities in Subexponential Time 1988 5 JSCOMP Grigor'ev, Complexity of Deciding Tarski Algebra 1988 5 JSCOMP Risler, Some Aspects of Complexity in Real Algebraic Geometry 1988 5 JSCOMP Coste & Roy, Thom's Lemma, the Coding of Real Algebraic Numbers and the Computation of the Topology of Semi-algebraic Sets 1988 5 JSCOMP Arnborg & Feng, Algebraic Decomposition of Regular Curves 1988 5 JSCOMP McCallum, An Improved Projection Operation for Cylindrical Algebraic Decomposition of Three-dimensional Space 1988 5 JSCOMP Arnon & Collins & McCallum, An Adjacency Algorithm for Cylindrical Algebraic Decompositions of Three-dimensional Space 1988 5 JSCOMP Arnon, A Cluster-Based Cylindrical Algebraic Decomposition Algorithm 1988 5 JSCOMP Arnon & McCallum, A Polynomial-time Algorithm for the Topological Type of a Real Algebraic Curve 1988 5 JSCOMP Arnon & Mignotte, On Mechanical Quantifier Elimination for Elementary Algebra and Geometry 1988 5 JSCOMP Lazard, Quantifier Elimination: Optimal Solution for Two Classical Examples 1988 5 JSCOMP Arnon, A Bibliography of Quantifier Elimination for Real Closed Fields 1987 4 JSCOMP Von Zur Gathen, Feasible Arithmetic Computations: Valiant's Hypothesis 1987 3 JSCOMP Fortenbacher, An Algebraic Approach to Unification Under Associativity and Commutativity 1987 3 JSCOMP Sims, Verifying Nilpotence 1987 3 JSCOMP Aurenhammer, Recognising Polytopical Cell Complexes and Constructing Projection Polyhedra 1987 3 JSCOMP Fages, Associative-Commutative Unification 1987 3 JSCOMP Buchberger, History and Basic Features of the Critical-Pair/Completion Procedure 1987 3 JSCOMP Book, Thue Systems as Rewriting Systems 1987 3 JSCOMP Dershowitz, Termination of Rewriting 1987 3 JSCOMP Rusinowitch, Path of Subterms Ordering and Recursive Decomposition Ordering Revisited 1987 3 JSCOMP Hsiang, Rewrite Method for Theorem Proving in First Order Theory with Equality 1987 3 JSCOMP Yelick, Unification in Combinations of Collapse-free Regular Theories 1987 3 JSCOMP Tiden & Arnborg, Unification Problems with One-sided Distributivity 1987 3 JSCOMP Benanav & Kapur & Narendran, Complexity of Matching Problems 1986 2 JSCOMP Caviness, Computer Algebra: Past and Future 1986 JSCOMP Avenhaus, On the Descriptive Power of Term Rewriting Systems 1986 JSCOMP Edelsbrunner & Waupotitsch, Computing a Ham-sandwich Cut in Two Dimensions 1992 42 JSCS Maclaren, A Limit on the Usable Length of a Pseudorandom Sequence 1996 61 JSL Hella & Luosto & Vaananen, The Hierarchy Theorem for Generalized Quantifiers 1996 61 JSL Ambos-Spies & Fejer & Lempp & Lerman, Decidability of the Two-quantifier Theory of the Recursively Enumerable Weak Truth-table Degrees and Other Distributive Upper Semi-lattices 1996 61 JSL Zambella, Notes on Polynomially Bounded Arithmetic 1996 61 JSL Gurevich & Shelah, On Finite Rigid Structures 1996 61 JSL Zanardo, Branching-Time Logic with Quantification over Branches: The Point of View of Modal Logic 1996 61 JSL Bartoszynski & Roslanowski & Shelah, Adding One Random Real 1996 61 JSL Grove & Halpern & Koller, Asymptotic Conditional Probabilities: The Non-unary Case 1995 60 JSL Gradel & Gurevich, Tailoring Recursioin for Complexity 1995 60 JSL Shelah & Stanley, A Combinatorial Forcing for Coding the Universe by a Real when There are No Sharps 1995 60 JSL Shelah & Stanley, The Combinatorics of Combinatorial Coding by a Real 1995 60 JSL Goldstern & Shelah, The Bounded Proper Forcing Axiom 1994 59 JSL Jockusch & Soare, Boolean Algebras, Stone Spaces, and the Iterated Turing Jump 1994 59 JSL Artemov & Montagna, On First-Order Theories with Provability Operator 1994 59 JSL Gordeev, A Modified Sentence Unprovable in PA 1994 59 JSL Hummel, Effective Versions of Ramsey's Theorem: Avoiding the Cone above 0' 1994 59 JSL Welch, Characterising Subsets of omega_1 Constructible from a Real 1994 59 JSL Buss, On Godel's Theorems on Lengths of Proofs I: Number of Lines and Speedup for Arithmetics 1994 59 JSL Ying, A Logic for Approximate Reasoning 1994 59 JSL Lachlan & Soare, Models of Arithmetic and Upper Bounds for Arithmetic Sets 1994 59 JSL Friedman, Jensen's Sigma* Theory and the Combinatorial Content of V=L 1994 59 JSL Mazur, Questions of Decidability and Undecidability in Number Theory 1994 59 JSL Pheidas, Extensions of Hilbert's Tenth Problem 1994 59 JSL Melles, Natural Internal Forcing Schemata Extending ZFC: Truth in the Universe? 1994 59 JSL Baliga & Case & Jain & Suraj, Machine Learning of Higher-Order Programs 1994 59 JSL Friedman, The Genericity Conjecture 1994 59 JSL Krajicek, Lower Bounds to the Size of Constant-Depth Propositional Proofs 1994 59 JSL Goode, Accessible Telephone Directories 1994 59 JSL Simpson, On the Strength of Konig's Duality Theorem for Countable Bipartite Graphs 1994 59 JSL Fagin, A Quantitative Analysis of Modal Logic 1994 59 JSL McGee, On the Degrees of Unsolvability of Modal Predicate Logics of Provability 1993 58 JSL Shore & Slaman, Working below a High Recursively Enumerable Degree 1993 58 JSL Kechris, Amenable versus Hyperfinite Borel Equivalence Relations 1993 58 JSL Chagrov & Zakharyaschev, The Undecidability of the Disjunction Property of Propositional Logics and Other Related Problems 1993 58 JSL Bateman & Jockusch & Woods, Decidability and Undecidability of Theories with a Predicate for the Primes 1993 58 JSL Spencer, Zero-One Laws with Variable Probability 1993 58 JSL Maddy, Does V Equal L? 1993 58 JSL Cornaros & Dimitracopoulos, A Note on Exponentiation 1992 57 JSL van Lambalgen, Independence, Randomness and the Axiom of Choice 1992 57 JSL Montagna, Polynomially and Superexponentially Shorter Proofs in Fragments of Arithmetic 1992 57 JSL Ambos-Spies & Nies & Shore, The Theory of the Recursively Enumerable Weak Truth-Table Degrees is Undecidable 1992 57 JSL Fagin & Halpern & Vardi, What is an Inference Rule? 1992 57 JSL Uspensky, Kolmogorov and Mathematical Logic 1992 57 JSL Kummer, A Proof of Beigel's Cardinality Conjecture 1992 57 JSL Harizanov & Kummer & Owings, Frequency Computations and the Cardinality Theorem 1992 57 JSL Ballard & Hrbacek, Standard Foundations for Nonstandard Analysis 1992 57 JSL Gasarch & Pleszkoch & Solovay, Learning via Queries in [+,<] 1992 57 JSL Albert & Baldinger & Rhodes, Undecidability of the Identity Problem for Finite Subgroups 1991 56 JSL Pacholski & Szwast, Asymptotic Probabilities of Existential Second Order Godel Sentences 1991 56 JSL Hodes, Corrections to Where Do Sets Come From? 1991 56 JSL Halpern, Presburger Arithmetic with Unary Predicates is Pi^1_1 Complete 1991 56 JSL Osherson & Stob & Weinstein, A Universal Inductive Inference Machine 1991 56 JSL Feferman, Reflecting on Incompleteness 1990 55 JSL , Cumulative Index to Volumes 27-55 (1962-1990) 1990 55 JSL van Lambalgen, The Axiomatization of Randomness 1990 55 JSL Howard, Definitions of Compact 1990 55 JSL Ajtai & Fagin, Reachability is Harder for Directed than for Undirected Finite Graphs 1990 55 JSL Goodman, Mathematics as Natural Science 1990 55 JSL Grigorieff, Every Recursive Linear Ordering Has a Copy in DTIME-SPACE(n, log n) 1989 54 JSL Moschovakis, The Formal Language of Recursion 1989 54 JSL Richard, Definability in Terms of the Successor Function and the Coprimeness Predicate in the Set of Arbitrary Integers 1989 54 JSL Jockusch & Lerman & Soare & Solovay, Recursively Enumerable Sets Modulo Iterated Jumps and Extensions of Arslanov's Completeness Criterion 1989 54 JSL McColm, Some Restrictions on Simple Fixed Points of the Integers 1989 54 JSL van Lambalgen, Algorithmic Information Theory 1989 54 JSL Gurevich & Shelah, Time Polynomial in Input or Output 1989 54 JSL Owings, A Cardinality Version of Beigel's Nonspeedup Theorem 1989 54 JSL Mahaney, review of Schoening, Complexity and Structure (1986) 1989 54 JSL Royer, Two Recursion Theoretic Characterizations of Proof Speed-ups 1988 53 JSL Ressayre, Formal Languages Defined by the Underlying Structure of their Words 1988 53 JSL Maass, On the Use of Inaccessible Numbers and Order Indiscernibles in Lower Bound Arguments for Random Access Machines 1988 53 JSL French, The False Assumption Underlying Berry's Paradox 1988 53 JSL Paris & Wilkie & Woods, Provability of the Pigeonhole Principle and the Existence of Infinitely Many Primes 1988 53 JSL Osherson & Stob & Weinstein, Mechanical Learners Pay a Price for Bayesianism 1988 53 JSL Yasuhara, review of Tourlakis (1984) 1988 53 JSL Shepherdson, review of Fitting (1987) 1988 53 JSL Kurtz, review of Hastad (1987) 1988 53 JSL Maddy, Believing the Axioms. II 1988 53 JSL Sieg, Hilbert's Program Sixty Years Later 1988 53 JSL Simpson, Partial Realizations of Hilbert's Program 1988 53 JSL Feferman, Hilbert's Program Relativized: Proof-theoretical and Foundational Reductions 1988 53 JSL Maddy, Believing the Axioms. I 1987 52 JSL Groszek, Combinatorics on Ideals and Forcing with Trees 1987 52 JSL van Lambalgen, Von Mises' Definition of Random Sequences Reconsidered 1987 52 JSL Sobrinho, On the Consistency of Self-referential Systems 1987 52 JSL Buss, Polynomial Size Proofs of the Propositional Pigeonhole Principle 1987 52 JSL Stockmeyer, Classifying the Computational Complexity of Problems (Survey/Expository Paper) 1986 51 JSL Poizat, Q = NQ? 1983 47 JSL Maass, Recursively Enumerable Generic Sets 1980 45 JSL Bennison, Recursively Enumerable Complexity Sequences and Measure Independence 1975 40 JSL Marques, On Degrees of Unsolvability and Complexity Properties 1975 40 JSL Lynch, ``Helping'': Several Formalizations 1974 39 JSL Moll & Meyer, Honest Bounds for Complexity Classes of Recursive Functions 1974 39 JSL Jones & Selman, Turing Machines and the Spectra of First-order Formulas 1973 38 JSL Blum & Marques, On Complexity Properties of Recursively Enumerable Sets 1972 JSL Meyer & Fischer, Computational Speed-Up by Effective Operators 1971 36 JSL Jech, Trees 1971 JSL Helm & Young, On Size vs. Efficiency for Programs Admitting Speed-Ups 1958 23 JSL Rogers, Goedel Numberings of Partial Recursive Functions 1996 82 JSM Grigoriev, Testing the Shift-Equivalence of Polynomials Using Quantum Machines 1995 74 JSM Gabbasov, Algorithmic Ways of Deciding Whether an Infinite Language is a Code 1995 73 JSM Grigor'eva, A Class of Heuristic Algorithms for the Routing Problem 1994 72 JSM Kondrat'ev, Properties of Optimal Classifications in Game-Theoretical Pattern Recognition Algorithms 1994 72 JSM Perekhod, Parallel Algorithm for Linear Diophantine Equations 1994 70 JSM Kondrat'ev, Game-Theoretic Recognition Algorithms 1994 70 JSM Ilovaiskaya & Shcherbina, On Computational Aspects of the Realization of Local Algorithms for Solution of Problems of Discrete Optimization 1994 70 JSM Vorob'ev & Grigor'ev, Finding Connected Components of a Semialgebraic Set in Subexponential Time 1994 70 JSM Grigor'ev, Complexity of Solution of Linear Systems in Rings of Differential Operators 1994 70 JSM Grigor'ev, Complexity of Testing Irreducibility of a System of Linear Ordinary Differential Equations 1994 70 JSM Jones, Computational Complexity of Winning Strategies in Two-Person Polynomial Games 1994 70 JSM Ponomarenko, Polynomial Time Recognition and Testing of Isomorphism of Cyclic Tournaments 1994 70 JSM Chistov, Algorithm of Polynomial Complexity for Factoring Polynomials over Local Fields 1994 70 JSM Barvinok, Computation of Exponential Integrals 1994 70 JSM Krich & Slisenko & Solerno & Heintz, Search for Shortest Path around Semialgebraic Obstacles in the Plane 1993 66 JSM Litvin & Boreisha & Vasyukov, Stochastic Localization of Roots of Random Polynomials 1993 66 JSM Novozhilova, Minimal Covering Problem and Redundancy Reduction in Databases 1993 65 JSM Donskoi, Dynamics of Two-Person Zero-Sum Games with Boolean Strategies and Partially Given Payoff Function 1993 65 JSM Donskoi, On the Correctness of a Linear Closure of Set of Recognition Algorithms of the Decision Tree Type 1993 65 JSM Shevchik, Multicommodity Flow Problem 1993 65 JSM Bachurina & Beletskii & Levental, Pseudopolynomial Algorithms for the Solution of Backpack Problems 1992 61 JSM Vafina & Fazylov, Random Search Method for Solving Series of Linear Programming Problems 1992 61 JSM Shevelev, Some Problems of the Theory of Enumerating the Permutations with Restricted Positions 1992 61 JSM Kozyrev & Yushmanov, Representations of Graphs and Networks (Coding, Layouts and Embeddings) 1992 59 JSM Vorob'ev, Deciding Consistency of Systems of Exponential-Polynomial Inequalities in Subexponential Time 1992 59 JSM Grigor'ev, Complexity of Quantifier Elimination in the Theory of Ordinary Differentially Closed Fields 1992 59 JSM Grigor'ev, Complexity of Factorization and GCD Computation for Linear Ordinary Differential Operators 1992 59 JSM Evdokimov, Factorization of Solvable Polynomials over Finite Fields and the Generalized Riemann Hypothesis 1992 59 JSM Orevkov, Remark on Kreisel's Conjecture 1992 59 JSM Chistov, Polynomial Complexity Algorithms for Computational Problems in the Theory of Algebraic Curves 1991 56 JSM Finn, Plausible Inference and Plausible Reasoning 1991 56 JSM Bol'shakov & Smirnov, Text Compression Methods 1991 56 JSM Bol'shakov, Automatic Error Correction in Inflected Languages 1991 55 JSM Vorob'ev & Grigor'ev, Solving Systems of Polynomial Inequalities over a Real Closed Field in Subexponential Time 1991 55 JSM Gaganov, Parallel Computation of Arithmetic Expressions Involving Unary Functions 1991 55 JSM Grigor'ev, Complexity of Deciding the First-Order Theory of Real Closed Fields 1991 55 JSM Grigor'eva, Testing Planar Pictures for Isomorphism in Linear Time 1991 55 JSM Matiyasevich, Diophantine Complexity 1991 55 JSM Orevkov, Proof Schemata in Hilbert-Type Axiomatic Theories 1991 55 JSM Ponomarenko, The Isomorphism Problem for Classes of Graphs Closed under Contraction 1990 52 JSM Varchenko, Evolutions of Convex Hulls and Phase Transitions in Thermodynamics 1989 47 JSM Zhurbenko & Smirnova, Some Properties of Random Number Generators 1985 29 JSM Bel'tyukov, Complexity Lower Bounds for Machine Computing Models 1985 29 JSM Frumkin, Complexity Questions in Number Theory 1985 29 JSM Zemlyachenko & Korneenko & Tyshkevich, Graph Isomorphism Problem 1983 22 JSM Slisenko, Detection of Periodicities and String-Matching in Real Time 1983 22 JSM Grigor'eva, Complexity Measures of Words Based on String Matching and Edit Distance 1980 14 JSM Grigoriev, Kolmogorov Algorithms are Stronger than Turing Machines 1980 14 JSM Matiyasevich, A New Proof of the Theorem on Exponential Diophantine Representation of Enumerable Sets 1973 1 JSM Matiyasevich, Real-Time Recognition of the Inclusion Relation 1983 JUDP Oshry, Responsa from the Holocaust 1983 1 JVLSICS Leiserson & Saxe, Optimizing Synchronous Systems 1997 17 KASHRUS Wikler, Alternative Torah Learning In The Computer Age (April) 1996 17 KASHRUS editors, 1997 Kosher Supervision Guide: *245* Kashrus Symbols & Organizations 1996 16 KASHRUS Westheim, How To Choose A Hotel For Pesach (February) 1993 3 KGC Cowen, Some Connections Between Set Theory and Computer Science 1993 3 KGC Feferman, Godel's Dialectica Interpretation and Its Two-Way Stretch 1993 3 KGC Halpern, A Critical Reexamination of Default Logic, Autoepistemic Logic, and Only Knowing 1993 3 KGC Pacholski, Undecidability of Implication Problems in Logic Programming, Data Base Theory and Classical Logic 1993 3 KGC Bamber, Computation with Access to the Reals, but Using Only Classical Machines 1993 3 KGC Danos & Joinet & Schellinx, The Structure of Exponentials: Uncovering the Dynamics of Linear Logic Proofs 1993 3 KGC Egly, On Different Concepts of Function Introduction 1993 3 KGC Faglia, Double Exponential Inseparability of Robinson Subsystem Q_+ from the Unsatisfiable Sentences in the Language of Addition 1993 3 KGC Johannsen, On the Weakness of Sharply Bounded Polynomial Induction 1993 3 KGC Kolany, On the Logic of Hypergraphs 1993 3 KGC Kummer & Stephan, Recursion Theoretic Properties of Frequency Computation and Bounded Queries (Extended Abstract) 1993 3 KGC Nies, Interpreting True Arithmetic in Degree Structures 1993 3 KGC Parigot, Classical Proofs as Programs 1993 3 KGC Sazonov & Voronkov, A Construction of Typed Lambda Models Related to Feasible Computability 1993 3 KGC Schwarz & Truszczynski, Nonmonotonic Reasoning is Sometimes Simpler 1993 3 KGC Willard, Self-Verifying Axiom Systems 1993 3 KGC Zlatuska, Committed-Choice Concurrent Logic Programming in Linear Logic 1995 KLUWER Tezuka, Uniform Random Numbers: Theory and Practice 1995 KLUWER Klove & Korzhik, Error Detecting Codes: General Theory And Their Application In Feedback Communication Systems 1995 KLUWER Natarajan (Ed.), Imprecise and Approximate Computation 1995 KLUWER Anglin, The Queen of Mathematics: An Introduction to Number Theory 1994 KLUWER Blahut & Costello & Maurer & Mittelholzer (Eds.), Communications and Cryptography: Two Sides of One Tapestry 1994 KLUWER Roychowdhury & Siu & Orlitsky (Eds.), Theoretical Advances in Neural Computation and Learning 1993 KLUWER Banerjee, Loop Transformations for Restructuring Compilers: The Foundations 1992 KLUWER Shparlinski, Computational and Algorithmic Problems in Finite Fields 1992 KLUWER Geddes & Czapor & Labahn, Algorithms for Computer Algebra 1992 KLUWER Storer (Ed.), Image and Text Compression 1992 KLUWER Takefuji, Neural Network Parallel Computing 1992 KLUWER Gebotys & Elmasry, Optimal VLSI Architectural Synthesis: Area, Performance and Testability 1991 KLUWER Mullin & Jenkins & Hains & Bernecky & Gao (Eds.), Arrays, Functional Languages, and Parallel Systems 1991 KLUWER Zlatev, Computational Methods for General Sparse Matrices 1991 KLUWER Bergum & Philippou & Horadam (Eds.), Applications of Fibonacci Numbers, Volume 4: Proceedings of `The Fourth International Conference on Fibonacci Numbers and Their Applications' 1991 KLUWER Zhigljavsky, Theory of Global Random Search 1991 KLUWER Lee & Sheu, Hardware Annealing in Analog VLSI Neurocomputing 1990 KLUWER Adamek & Trnkova, Automata and Algebras in Categories 1990 KLUWER Tseng, A Systolic Array Parallelizing Compiler 1990 KLUWER Brown, Boolean Reasoning: The Logic of Boolean Equations 1990 KLUWER Fetzer, Artificial Intelligence: Its Scope and Limits 1990 KLUWER Iannucci, Parallel Machines: Parallel Machine Languages: The Emergence of Hybrid Dataflow Computer Architectures 1989 KLUWER Otten & van Ginneken, The Annealing Algorithm 1987 KLUWER McEliece, Finite Fields for Computer Scientists and Engineers 1987 KLUWER Bokhari, Assignment Problems in Parallel and Distributed Computing 1985 KMURTHY Krishnamurthy, Error-Free Polynomial Matrix Computations 1992 KNOPF Postman, Technopoly: The Surrender of Culture to Technology 1991 KNOPF Paulos, Beyond Numeracy: Ruminations of a Numbers Man 1971 KOHAVIPAZ Ashcroft & Manna & Pnueli, Decidable Properties of Monadic Functional Schemas 1971 KOHAVIPAZ Meyer & McCreight, Computationally Complex and Pseudo-Random Zero-One Valued Functions 1971 KOHAVIPAZ Borodin, Horners Rule Is Uniquely Optimal 1971 KOHAVIPAZ Morgenstern, On Linear Algorithms 1971 KOHAVIPAZ Winograd & Wolfe, On the Rate of Convergence of Local Iterative Schemes 1971 KOHAVIPAZ Even & Itai, Queues, Stacks, and Graphs 1971 KOHAVIPAZ Liu, Construction of Sorting Plans 1971 KOHAVIPAZ Tsichritzis, IFF Programs 1971 KOHAVIPAZ Cori & Richard, Some Languages Related to Planar Maps 1971 KOHAVIPAZ Levy, Tree Adjunct, Parenthesis, and Distributed Adjunct Grammars 1971 KOHAVIPAZ Reeker, State Graphs and Context Free Languages 1971 KOHAVIPAZ Bancilhon & Depeyrot, Dispersion Matrices and Stochastic Automata Morphisms 1971 KOHAVIPAZ Thompson & Booth, Encoding of Probabilistic Context-Free Languages 1971 KOHAVIPAZ Hopcroft, An n log n Algorithm for Minimizing States in a Finite Automaton 1971 KOHAVIPAZ Kohavi & Winograd, Bounds on the Length of Synchronizing Sequences and the Order of Information Losslessness 1971 KOHAVIPAZ Herman, Every Finite Sequential Machine Is Linearly Realizable 1971 KOHAVIPAZ Meyer & Zeigler, On the Limits of Linearity 1971 KOHAVIPAZ Reusch, Theorems on Additive Automata 1971 KOHAVIPAZ Bavel, Connectivity and Separation in Automata 1971 KOHAVIPAZ Give'on, Algebraic Theory of m-ARY Systems 1971 KOHAVIPAZ Perrot, Groups and Automata 1971 KOHAVIPAZ Zeigler, Automaton Structure Preserving Morphisms with Applications to Decomposition and Simulation 1971 KOHAVIPAZ Breuer, An Algorithm for Generating a Fault Detection Test for a Class of Sequential Circuits 1971 KOHAVIPAZ Friedman & Menon, Fault Location in Iterative Logic Arrays 1971 KOHAVIPAZ Seitz, An Approach to Designing Checking Experiments Based on a Dynamic Model 1971 KOHAVIPAZ Arango & Santos & Pascual, Tree-Threshold-Synthesis of Ternary Functions 1971 KOHAVIPAZ Moraga, A Minimization Method for 3-Valued Logic Functions 1971 KOHAVIPAZ Lang & Schkolnick, The Minimization of Control Variables in Adaptive Systems 1971 KOHAVIPAZ Mukhopadhyay & Reddy, On Completeness of a Set of Ambiguous Logic Primitives 1971 KOHAVIPAZ Frosini & Gerace, Minimizing the Number of Internal States in Incompletely Specified Pulse Input Asynchronous Sequential machines 1986 KRANAKIS Kranakis, Primality and Cryptography 1992 KRSR Schwartz, The Pernicious Influence of Mathematics on Science 1992 KRSR Rota, Combinatorics 1992 KRSR Schwartz, Computer Science 1992 KRSR Kac, Mathematics: Trends 1992 KRSR Schwartz, The Future of Computer Science 1992 KRSR Rota, Complicating Mathematics 1992 KRSR Kac, Academic Responsibility 1992 KRSR Schwartz, Artificial Intelligence 1992 KRSR Kac, Will Computers Replace Humans? 1992 KRSR Schwartz, Computer-Aided Instruction 1992 KRSR Rota, Misreading the History of Mathematics 1992 KRSR Kac, Doing Away with Science 1992 KRSR Rota, More Discrete Thoughts 1979 15 KYBERNETIKA Zak, A Turing Machine Space Hierarchy 1965 6 KYBERNETIKA Becvar, Real-Time and Complexity Problems in Automata Theory 1990 LAMI Cull, Analysis of Algorithms 1990 LAMI Pin, Rational and Recognizable Languages 1990 LAMI Taneja, On Generalized Entropies with Applications 1982 LANDA Wang, Specker's Mathematical Work from 1949 to 1979 1982 LANDA Baur, Die Theorie der Paare Reell Abgeschlossener Korper 1982 LANDA Baur & Rabin, Linear Disjointness and Algebraic Complexity 1982 LANDA Borodin, Structured vs. General Models in Computational Complexity 1982 LANDA Bott, An Equivalent Setting of the Morse Theory 1982 LANDA Cook, towards a Complexity Theory of Synchronous Parallel Computation 1982 LANDA Coray, Complexite d'Algorithmes Modulaires 1982 LANDA Elgot & Shepherdson, An Equational Axiomatization of the Algebra of Reducible Flowchart Schemes 1982 LANDA Erdos, Problems and Results on Finite and Infinite Combinatorial Analysis II 1982 LANDA Fischer & Paterson, The Fast Skew-Closure Algorithm 1982 LANDA Furer, Alternation and the Ackermann Case of the Decision Problem 1982 LANDA Gaifman & Dimitracopoulos, Fragments of Peano's Arithmetic and the MRDP Theorem 1982 LANDA Girard, Proof-theoretic Investigations of Inductive Definitions (Part I) 1982 LANDA Heintz & Schnorr, Testing Polynomials Which are Easy to Compute 1982 LANDA Karp & Lipton, Turing Machines that Take Advice 1982 LANDA Kochen & Kripke, Non-standard Models of Peano Arithmetic 1982 LANDA Koppelberg, On Boolean Algebras with Distinguished Subalgebras 1982 LANDA Paris & Dimitracopoulos, Truth Definitions for Delta_0 Formulae 1982 LANDA Paul & Simon, Decision Trees and Random Access Machines 1982 LANDA Prestel, Zur Axiomatisierung Gewisser Affiner Geometrien 1982 LANDA Schoenhage, Random Access Machines and Presburger Arithmetic 1982 LANDA Valiant, Reducibility by Algebraic Projections 1982 LANDA Ziegler, Einige Unentscheidbare Korpertheorien 1989 1 LASC Gabriel & Steel, Editorial: What Computers Can't Do (And Why) 1992 1 LATIN Alimonti & Feuerstein & Nanni, Linear Time Algorithms for Liveness and Boundedness in Conflict-free Petri Nets 1992 1 LATIN Allouche, q-Regular Sequences and Other Generalizations of q-Automatic Sequences 1992 1 LATIN Barrington & Straubing, Complex Polynomials and Circuit Lower Bounds for Modular Counting 1992 1 LATIN Beauquier & Latteux & Slowinski, A Decidability Result about Convex Polyominoes 1992 1 LATIN Bern & Edelsbrunner & Eppstein & Mitchell & Tan, Edge-Insertion for Optimal Triangulations 1992 1 LATIN Bettayeb & Cong & Girou & Sudborough, Simulating Permutation Networks on Hypercubes 1992 1 LATIN Blum, Universal Statistical Tests 1992 1 LATIN Bossut & Warin, Automata and Pattern Matching in Planar Directed Acyclic Graphs 1992 1 LATIN Bruggemann-Klein, Regular Expressions into Finite Automata 1992 1 LATIN Bruyere, Automata and Codes with Bounded Deciphering Delay 1992 1 LATIN Carlsson & Chen, Parallel Complexity of Heaps and min-max Heaps 1992 1 LATIN Cucker & Rossello, On the Complexity of Some Problems for the Blum, Shub & Smale Model 1992 1 LATIN de la Vega & Paschos & Saad, Average Case Analysis of a Greedy Algorithm for the Minimum Hitting Set Problem 1992 1 LATIN Ferreira & Song, Achieving Optimality for Gate Matrix Layout and PLA Folding: A Graph Theoretic Approach 1992 1 LATIN Frougny, How to Write Integers in Non-integer Base 1992 1 LATIN Garrido & Jarominek & Lingas & Rytter, A Simple Randomized Parallel Algorithm for Maximal f-Matchings 1992 1 LATIN Gasarch & Guimaraes, On the Number of Components of a Recursive Graph 1992 1 LATIN Giesbrecht, Factoring in Skew-polynomial Rings 1992 1 LATIN Gil & Matias, Leaders Election without Conflict Resolution rule--Fast and Efficient Randomized Simulations among CRCW PRAMs 1992 1 LATIN Goles & Kiwi, Dynamics of Sand-Piles Games on Graphs 1992 1 LATIN Gutierrez & Recio, Rational Function Decomposition and Grobner Bases in the Parameterization of Plane Curves 1992 1 LATIN Hashiguchi, The Double Reconstruction Conjectures about Colored Hypergraphs and Colored Directed Graphs 1992 1 LATIN Hertrampf, Locally Definable Acceptance Types--the Three-valued Case 1992 1 LATIN Hollman, On the Computation of the Hilbert Series 1992 1 LATIN Jennings & Motyckova, A Distributed Algorithm for Finding All Maximal Cliques in a Network Graph 1992 1 LATIN Kaltofen, Polynomial Factorization 1987-1991 1992 1 LATIN Kobayashi, Properties of Recognizable M-Subsets of a Free Monoid 1992 1 LATIN Pereira do Lago, On the Burnside Semigroups x^n=x^{n+m} 1992 1 LATIN Lenstra, Massively Parallel Computing and Factoring 1992 1 LATIN de Luca & Varricchio, Some Regularity Conditions based on Well Quasi-orders 1992 1 LATIN Myers, Approximate Matching of Network Expressions with Spacers 1992 1 LATIN Niedermeier & Rossmanith, Unambiguous Simulations of Auxiliary Pushdown Automata and Circuits 1992 1 LATIN Pin, On Reversible Automata 1992 1 LATIN Porto, Even Induced Cycles in Planar Graphs 1992 1 LATIN Pratt, Arithmetic + Logic + Geometry = Concurrency 1992 1 LATIN Rolim, On the Density and Core of the Complexity Classes 1992 1 LATIN Sakarovitch, The ``Last'' Decision Problem for Rational Trace Languages 1992 1 LATIN Sinclair, Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow 1992 1 LATIN Sleator, Data Structures and Terminating Petri Nets 1992 1 LATIN Therien, Circuits Constructed with MOD_q Gates Cannot Compute AND in Sublinear Size 1992 1 LATIN Weber, Decomposing a k-Valued Transducer into k Unambiguous Ones 1992 1 LATIN Zhou & Nakano & Suzuki & Nishizeki, An Efficient Algorithm for Edge-coloring Series-parallel Multigraphs 1992 1 LATIN Cosnard & Koiran & Paugam-Moisy, Complexity Issues in Neural Network Computations 1994 LCC Cardone, Strict Finitism and Feasibility 1994 LCC Parikh, Logical Omniscience 1994 LCC Sazonov, On Feasible Numbers 1994 LCC Bloch, On Parallel Hierarchies and R^i_k 1994 LCC Berger & Schwichtenberg, Program Extraction from Classical Proofs 1994 LCC Clote, Computational Models and Function Algebras 1994 LCC Constable, Expressing Computational Complexity in Constructive Type Theory 1994 LCC Girard, Light Linear Logic 1994 LCC Leivant, Intrinsic Theories and Computational Complexity 1994 LCC Buss, On Herbrand's Theorem 1994 LCC Krajicek & Pudlak, Some Consequences of Cryptographical Conjectures for S^1_2 and EF 1994 LCC Takeuti, Frege Proof System and TNC^0 1994 LCC Bellantoni, Characterizing Parallel Time by Type 2 Recursions With Polynomial Output Length 1994 LCC Seth, Type 2 Polynomial Hierarchies 1994 LCC Wainer, The Hierarchy of Terminating Recursive Programs over N 1994 LCC Cenzer & Remmel, Feasibly Categorical Models 1994 LCC Gradel & Gurevich, Metafinite Model Theory 1994 LCC Khoussainov & Nerode, Automatic Presentations of Structures 1994 LCC Dawar, A Restricted Second Order Logic for Finite Structures 1994 LCC Fagin, Comparing the Power of Monadic NP Games 1994 LCC Grumbach & Su & Tollu, Linear Constraint Query Languages: Expressive Power and Complexity 1994 LCC Lindell, A Constant-Space Sequential Model of Computation for First-Order Logic 1994 LCC Makowsky & Pnueli, Logics Capturing Relativized Complexity Classes Uniformly 1994 LCC Rosen & Weinstein, Preservation Theorems in Finite Model Theory 1994 LCC Suciu & Breazu-Tannen, A Query Language for NC 1989 LCHULL Maass & Slaman, Some Problems and Results in the Theory of Actually Computable Functions 1989 LCHULL Slaman, On Bounded Time Turing Reducibility on the Recursive Sets 1989 LCHULL Davis, Trends in Logic: Relation with Computer Science 1989 LCHULL Bernardi, The Teaching of Logic 1989 LCHULL Davis, Teaching the Incompleteness Theorem 1989 LCHULL Watt, LTF -- A Logic Teaching Framework 1986 LCHULL Gibbins, Teaching Logic by Computer: A Hacker's Guide 1986 LCHULL Moore, The Origins of Forcing 1986 LCHULL Shepherdson, Introduction to the Theory of Logic Programming 1994 3 LFCS Ablayev, Lower Bounds for Probabilistic Space Complexity: Communication-Automata Approach 1994 3 LFCS Brown & Jeffrey, Allegories of Circuits 1994 3 LFCS Downey & Fellows & Kapron & Hallett & Wareham, The Parameterized Complexity of Some Problems in Logic and Linguistics 1994 3 LFCS Ge & Nerode, On Extreme Points of Convex Compact Turing Located Set 1994 3 LFCS Khoussainov & Nerode, The Notion of Rank and Games 1994 3 LFCS Makowsky & Pnueli, Arity vs. Alternation in Second Order Logic 1992 2 LFCS Baliga & Case & Jain & Suraj, Machine Learning of Higher Order Programs 1992 2 LFCS Calo & Makowsky, The Ehrenfeucht-Fraisse Games for Transitive Closure 1992 2 LFCS Dershowitz & Reingold, Ordinal Arithmetic with List Structures 1992 2 LFCS Hemachandra & Jain & Vereshchagin, Banishing Robust Turing Completeness 1992 2 LFCS Kossovsky & Prokhoroff, The Polynomial Complexity of Conjunctive Normal Form Satisfiability, when the Number of Conjunctions and Negations is Limited 1992 2 LFCS Lano, Set Theoretic Foundations for Fuzzy Set Theory, and Their Applications 1992 2 LFCS Mullins, Kleene Automata and Recursion Theory 1992 2 LFCS Shilov, Propositional Dynamic Logic with Fixed Points: Algorithmic Tools for Verification of Finite State Machines 1992 2 LFCS Spreen, Effective Operators and Continuity Revisited 1989 1 LFCS Basin, Building Theories in Nuprl 1989 1 LFCS Bloom & Meyer, A Remark on Bisimulation Between Probabilistic Processes 1989 1 LFCS Carmo & Sernadas, Inevitability in Branching Time 1989 1 LFCS Gurevich & Shelah, Nearly Linear Time 1989 1 LFCS Hansen & Nikolajsen & Traff & Jones, Experiments with Implementations of Two Theoretical Constructions 1989 1 LFCS Heisel & Reif & Stephan, A Dynamic Logic for Program Verification 1989 1 LFCS Hirshfeld & Rabinovich & Trakhtenbrot, Discerning Causality in Interleaving Behavior 1989 1 LFCS Huttel & Larsen, The Use of Static Constructs in a Modal Process Logic 1989 1 LFCS Kanovich, What is the Logic of Computational Tasks? 1989 1 LFCS Lambek, Fixpoints Revisited 1989 1 LFCS Moschovakis, A Mathematical Modeling of Pure, Recursive Algorithms 1989 1 LFCS Zielonka, Safe Executions of Recognizable Trace Languages by Asynchronous Automata 1990 LFFP Girard, The System F of Variable Types, 15 Years Later 1990 LFFP Reynolds & Plotkin, On Functors Expressible in the Polymorphic Lambda Calculus 1990 LFFP Mitchell, Polymorphic Type Inference and Containment 1990 LFFP Mitchell, A Type-Inference Approach to Reduction Properties and Semantics of Polymorphic Expressions (Summary) 1990 LFFP Bruce & Meyer & Mitchell, The Semantics of Second-Order Lambda-Calculus 1990 LFFP Meyer & Mitchell & Moggi & Statman, Empty Types in Polymorphic Lambda-Calculus 1990 LFFP Breazu-Tannen & Meyer, Computable Values Can Be Classical 1990 LFFP Breazu-Tannen & Meyer, Polymorphism is Conservative over Simple Types 1990 LFFP Bainbridge & Freyd & Scedrov & Scott, Functorial Polymorphism 1992 LFROMCS Barringer & Gabbay, The Imperative Future: Past Successes implies Future Actions 1992 LFROMCS Borger, A Logical Operational Semantics of Full Prolog: Part III. Built-in Predicates for Files, Terms, Arithmetic and Input-Output 1992 LFROMCS Cook, Computability and Complexity of Higher Type Functions 1992 LFROMCS Cosmo & Longo, Constructively Equivalent Propositions and Isomorphisms of Objects, or Terms as Natural Transformations 1992 LFROMCS Feferman, Logics for Termination and Correctness of Functional Programs 1992 LFROMCS Fine, Transparent Grammars 1992 LFROMCS Gallier & Snyder, Designing Unification Procedures Using Transformations: A Survey 1992 LFROMCS Girard & Scedrov & Scott, Normal Forms and Cut-Free Proofs as Natural Transformations 1992 LFROMCS Jones, Computer Implementation and Applications of Kleene's S-m-n and Recursion Theorems 1992 LFROMCS Kolaitis & Vardi, 0-1 Laws for Fragments of Second-Order Logic: An Overview 1992 LFROMCS Krajicek, No Counter-Example Interpretation and Interpretation and Interactive Computation 1992 LFROMCS Leivant, Semantic Characterizations of Number Theories 1992 LFROMCS Lipton, Constructive Kripke Semantics and Realizability 1992 LFROMCS Maass & Slaman, Splitting and Density for the Recursive Sets of a Fixed Time Complexity 1992 LFROMCS Mac Lane & Moerdijk, Reals and Forcing with an Elementary Topos 1992 LFROMCS Moss, Completeness Theorems for Logics of Feature Structures 1992 LFROMCS Nerode & Yakhnis & Yakhnis, Concurrent Programs as Strategies in Games 1992 LFROMCS Parikh, Finite and Infinite Dialogues 1992 LFROMCS Pudlak, Some Relations Between Subsystems of Arithmetic and Complexity of Computations 1992 LFROMCS Shepherdson, Logics for Negation as Failure 1992 LFROMCS Statman, Normal Varieties of Combinators 1992 LFROMCS Urquhart, Complexity of Proofs in Classical Propositional Logic 19?? LIBTR Booth & Govindan & Langston & Ramachandramurthi, Cutwidth Approximation in Linear Time 19?? LIBTR Fellows & Langston, Constructivity Issues in Graph Algorithms 19?? LIBTR Battle & Vose, Isomorphisms of Genetic Algorithms 19?? LIBTR Hanson & Heng, Visualizing the Fourth Dimension Using Geometry and Light 19?? LIBTR Sharkey & Day & Sharkey, A Connectionist Machine Tractable Dictionary: The Very Idea 19?? LIBTR Sharkey, Computing Parity on a Single Weight Layer: A Nonmonotonic Learning Function 19?? LIBTR Basin & Howe, Some Normalization Properties of Martin-Lof's Type Theory, and Applications 19?? LIBTR Basin & Kaufmann, The Boyer-Moore Prover and nuprl: An Experimental Comparison 19?? LIBTR Gecseg & Jurgensen, Automata Represented by Products of Soliton Automata 19?? LIBTR Ito & Jurgensen & Shyr & Thierrin, n-Prefix-Suffix Languages 19?? LIBTR Ito & Jurgensen & Shyr & Thierrin, Outfix and Infix Codes and Related Classes of Languages 19?? LIBTR Fellah & Jurgensen & Yu, Alternating Finite Automata 19?? LIBTR Dassow & Jurgensen, Deterministic Soliton Automata with At Most One Cycle 19?? LIBTR Jurgensen & Yu, Relations on Free Monoids, Their Independent Sets, and Codes 19?? LIBTR Singh, A Design Methodology for Self-Timed Systems 19?? LIBTR Greenberg & Bhatt, Routing Multiple Paths in Hypercubes 19?? LIBTR Huntbach, Program Synthesis by Inductive Inference 19?? LIBTR Fellows & Kinnersley & Langston, Finite-Basis Theorems and a Computation-integrated Approach to Obstruction Set Isolation 19?? LIBTR Huang & Langston, Stable Duplicate-Key Extraction with Optimal Time and Space Bounds 19?? LIBTR Kinnersley & Langston, Online Variable-sized Bin Packing 1996 LIBTR Hoover, Model for Characterizing and Creating Certificate Programs in Technology-Specific Areas 1996 LIBTR Castelli & Kontoyiannis & Li & Turek, Progressive Classification: A Multiresolution Approach 1996 LIBTR Gupta, Graph Partitioning Based Sparse Matrix Orderings for Interior-Point Algorithms 1996 LIBTR Chandra & Raghavan & Ruzzo & Smolensky & Tiwari, The Electrical Resistance of a Graph Captures Its Commute and Cover Times 1996 LIBTR Haas & Stokes, Estimating the Number of Classes in a Finite Population 1996 LIBTR Megiddo, Finding a Line of Sight thru Boxes in d-space in Linear Time 1996 LIBTR Sarawagi & Agrawal & Gupta, On Computing the Data Cube 1996 LIBTR Megiddo & Mizuno & Tsuchiya, A Modified Layered-Step Interior-Point Algorithm for Linear Programming 1996 LIBTR Ogihara, Breadth First Search 3SAT Algorithms for DNA Computers 1996 LIBTR Menon, Representation Schemes and Impact on Algorithms 1996 LIBTR Menon, An Introduction to Implicit Techniques 1996 LIBTR Menon, CSG Constructs for Free-Form Solids Bounded by Implicit Algebraic Patches 1996 LIBTR Fagin & Stockmeyer, Relaxing the Triangle Inequality in Pattern Matching 1996 LIBTR Leighton & Maggs & Richa, Fast Algorithms for Finding 0(congestion+dilation) Packet Routing Schedules 1996 LIBTR Coppersmith, Rectangular Matrix Multiplication Revisited 1996 LIBTR Gupta, Fast and Effective Algorithms for Graph Partitioning, and Sparse Matrix Ordering 1996 LIBTR Arbab & Blom & Burger & Everaars, Reusability of Coordination Programs 1996 LIBTR Brovedani & Klusener, A Verification of the Bakery Protocol Combining Algebraic and Model-oriented Techniques 1996 LIBTR Damgard & Cramer, On Monotone Function Closure of Perfect and Statistical Zero-Knowledge 1996 LIBTR Hemaspaandra & Hemaspaandra & Hempel, A Downward Translation in the Polynomial Hierarchy 1996 LIBTR Hemaspaandra & Jiang & Rothe & Watanabe, Polynomial-Time Multi-selectivity 1996 LIBTR Brown, WebCard: Integrated and Uniform Access to Mail, News, and the Web 1996 LIBTR Trumbo & Lee & Knoth, A Constrained Bin-packing Problem 1996 LIBTR Fagin, Easier Ways to Win Logical Games 1996 LIBTR Fagin, Comparing the Power of Games on Graphs 1996 LIBTR Camp & Harkavy & Tygar & Yee, Anonymous Atomic Transactions 1996 LIBTR Slye & Elnozahy, Supporting Nondeterministic Execution in Fault-tolerant Systems 1996 LIBTR Tygar, Atomicity in Electronic Commerce 1996 LIBTR Tygar & Yee & Heintze, Cryptographic Postage Indicia 1996 LIBTR Brown & Najork, Collaborative Active Textbooks: A Web-based Algorithm Animation System for an Electronic Classroom 1996 LIBTR Ogihara & Ray, Simulating Boolean Circuits on a DNA Computer 1996 LIBTR Zimand, Existential Theorems in Computational Complexity Theory: Size and Robustness 1996 LIBTR Samuelsson, Relating Turing's Formula and Zipf's Law 1996 LIBTR Baiou & Barahona & Mahjoub, Separation of Partition Inequalities 1996 LIBTR Bowdidge & Griswold, Supporting the Restructuring of Data Abstractions through Manipulation of a Program Visualization 1996 LIBTR Cai & Schieber, A Linear-Time Algorithm for Computing the Intersection of all Odd Cycles in a Graph 1996 LIBTR Conn & Gould & Toint, Methods for Nonlinear Constraints in Optimization Calculations 1996 LIBTR Kilov & Simmonds, Natural Modularity 1996 LIBTR Lim & Heidelberger & Pattnaik & Snir, Message Proxies for Efficient, Protected Communication on SMP Clusters 1996 LIBTR Nair, The Hint Bit for Conditional Branch Instructions 1996 LIBTR Chatterjee & Gilbert & Oliker & Schreiber & Sheffler, Algorithms for Automatic Alignment of Arrays 1996 LIBTR Hemaspaandra & Hemaspaandra & Hempel, Query Order in the Polynomial Hierarchy 1996 LIBTR Biddle & Tempero, Teaching Programming by Teaching Reusability 1996 LIBTR Heun & Mayr, Optimal Dynamic Edge-disjoint Embeddings of Complete Binary Trees into Hypercubes 1996 LIBTR Koppenhagen & Mayr, The Complexity of the Equivalence Problem for Commutative Semigroups 1996 LIBTR Koppenhagen & Mayr, An Optimal Algorithm for Constructing the Reduced Grobner Basis of Binomial Ideals 1996 LIBTR Koppenhagen & Mayr, Optimal Grobner Base Algorithms for Binomial Ideals 1996 LIBTR Kuhnle & Mayr, Exponential Space Computation of Grobner Bases 1996 LIBTR Nazareth & Regensburger & Scholz, Mini-statecharts: A Lean Version of Statecharts 1996 LIBTR Scholz, An Extended Version of Mini-statecharts 1996 LIBTR Clarke & Wing, Formal Methods: State of the Art and Future Directions 1996 LIBTR Warfel, Tasks and Connection Sets: Choreographed Communication on a Reconfigurable Connection-based Parallel Computer 1996 LIBTR Zhao, Verification of Arithmetic Circuits 1996 LIBTR Stephenson, Stacks and Trees and Strings and Bits and Pieces 1996 LIBTR Chen & Han & Yu, Data Mining: An Overview from Database Perspective 1996 LIBTR Sivaram & Panda & Stunkel, Efficient Broadcast and Multicast on Multistage Interconnection Networks Using Multiport Encoding 1996 LIBTR Hemaspaandra & Hemaspaandra & Hempel, R^SN_1-tt(NP) Distinguishes Robust Many-One and Turing Completeness 1996 LIBTR Hemaspaandra & Rajasethupathy & Sethupathy & Zimand, Power Balance and Congressional Apportionment Algorithms 1996 LIBTR Hemaspaandra & Ogihara, Universally Serializable Computation 1996 LIBTR Hemaspaandra & Hemaspaandra & Rothe, Exact Analysis of Dodgson Elections: Lewis Carroll's 1876 Voting System is Complete for Parallel Access to NP 1996 LIBTR Prakash & Baldoni & Beraldi, Slotted-FIFO Channels for Asynchronous Distributed Systems 1996 LIBTR Coppersmith & Johnson & Matyas, Triple DES Cipher Block Chaining with Output Feedback Masking 1996 LIBTR Kuelmann & Krohm, Equivalence Checking Using Cuts and Heaps 1996 LIBTR Janicki & Koczkodaj, A Weak Order Approach to Group Ranking 1996 LIBTR Zimand, How To Privatize Random Bits 1996 LIBTR Zaki & Parthasarathy & Li & Ogihara, Evaluation of Sampling for Data Mining of Association Rules 1996 LIBTR Zaki & Ogihara & Parthasarathy & Li, Parallel Data Mining for Association Rules on Shared-Memory Multi-processors 1996 LIBTR Fischer & Hemaspaandra & Torenvliet, Witness-isomorphic Reductions and Local Search 1996 LIBTR Franke & Wang & Pattnaik & Rudolph, Gang Scheduling for Multiprocessor Systems 1996 LIBTR Devgan, Fast Circuit Simulation Techniques: Theory and Practice 1996 LIBTR Siegel & Stunkel, Trends in Parallel Machine Interconnection Networks 1996 LIBTR Engelhardt & Wendelborn, Visualizing Communications Patterns in Nested Data-parallel Computations 1996 LIBTR Cazals & Ramkumar, Algorithms to Compute the Intersection and Union of Toleranced Polygons 1996 LIBTR Manna & Pnueli, Clocked Transition Systems 1996 LIBTR Silberschatz & Stonebraker & Ullman, Database Research: Achievements and Opportunities into the 21st Century 1996 LIBTR Iyengar, Scalability of Dynamic Storage Allocation Algorithms 1996 LIBTR Bergstra & Dinesh & Field & Heering, A Complete Transformational Toolkit for Compilers 1996 LIBTR Di Gianantonio, A Golden Ratio Notation for the Real Numbers 1996 LIBTR Bhandari, Do Computers Really Think? 1996 LIBTR Pfitzmann & Waidner, Properties of Payment Systems: General Definition Sketch and Classification 1996 LIBTR Deri, Network Management for the 90s 1996 LIBTR Nguyen, A Formal System for Linear Space Reasoning 1996 LIBTR Hemaspaandra & Jiang & Rothe & Watanabe, The Join Can Lower Complexity 1996 LIBTR Borchert & Hemaspaandra & Rothe, Powers-of-Two Acceptance Suffices for Equivalence and Bounded Ambiguity Problems 1996 LIBTR Bisdikian, The n-ary Stack Algorithm for the Wireless Random Access Channel 1996 LIBTR Banerjee & Niblack & Flickner, A Minimum Description Length Polygonal Approximation Method 1996 LIBTR Hemaspaandra & Zaki & Zimand, Polynomial-Time Semi-rankable Sets 1996 LIBTR Fagin & Halpern & Moses & Vardi, Common Knowledge Revisited 1996 LIBTR Satyanarayanan, Fundamental Challenges in Mobile Computing 1996 LIBTR Abali & Stunkel & Benveniste, Clock Synchronization on a Multicomputer 1996 LIBTR Menon & Srinivasan, A Decade of Teaching Geometry: A New York Experience 1996 LIBTR Islam & Dave & Campbell, Algorithms for Communication Compilation for Unreliable Networks 1996 LIBTR Lueh & Gross & Adl-Tabatabai, Global Register Allocation Based on Graph Fusion 1996 LIBTR Kearney & Corneil, Power of Trees 1996 LIBTR Flynn & Tetzlaff, Disk Striping and Block Replication Algorithms for Video File Servers 1996 LIBTR Tetzlaff & Flynn, Block Allocation in Video Servers for Availability and Throughput 1996 LIBTR Braudaway & Magerlein & Mintzer, Protecting Publicly-Available Images with a Visible Image Watermark 1996 LIBTR Scott & Michael, The Topological Barrier: A Synchronization Abstraction for Regularly-Structured Parallel Applications 1996 LIBTR Taubin & Rossignac, Geometric Compression through Topological Surgery 1996 LIBTR Even & Naor & Rao & Schieber, Divide-and-Conquer Approximation Algorithms via Spreading Metrics 1996 LIBTR Bisdikian, A Review of Random Access Algorithms 1995 LIBTR Mraz & Freimuth & Nowicki & Silberman, Using Commodity Networks for Distributed Computing Research 1995 LIBTR Schmidt, Implementation and Improvement of an Algorithm for Maze Searching, with Azimuth Input 1995 LIBTR Biddle & Tempero, Comparing a Computing Curriculum with the ACM/IEEE-CS Recommendations 1995 LIBTR Biddle & Tempero, Explaining Inheritance: A Code Reusability Perspective 1995 LIBTR Biddle & Tempero, Understanding OOP Language Support for Reusability 1995 LIBTR Biddle & Tempero, Understanding the Impact of Language Features on Reusability 1995 LIBTR Fuchs, Formal Design of a Model-N Counter 1995 LIBTR Zhang & Kang & Lipsky, On the Performance of Parallel Computers: Order Statistics and Amdahl's Law 1995 LIBTR Heywood & Leopold, Dynamic Randomized Simulation of Hierarchical PRAMs on Meshes 1995 LIBTR Avresky & Cunningham, Modeling Fault-tolerant Adaptive Routing for Two-dimensional Meshes 1995 LIBTR Cunningham & Avresky, A New Solution for Fault-tolerant Adaptive Wormhole Routing in Two-dimensional Meshes 1995 LIBTR Cunningham & Avresky, Fault-tolerant Adaptive Broadcasting and Multicasting Using Wormhole Routing in Two-dimensional Meshes 1995 LIBTR Mishra & Chang & Bhuyan & Lombardi, Fault-tolerant Sorting in SIMD Hypercubes 1995 LIBTR McIver & Conway, Seven Deadly Sins of Introductory Programming Language Design 1995 LIBTR Laforest, Broadcast and Gossip in Line-communication Mode 1995 LIBTR Kopidakis & Zissimopoulos, An Approximation Scheme for Scheduling Independent Jobs into Subcubes of a Hypercube of Fixed Dimension 1995 LIBTR Aerts & Bevers & De Vlaminck, A Prototype Environment for Karel the Robot 1995 LIBTR Dolev & Reischuk & Strong & Wimmers, A Decentralized High Performance Time Service Architecture 1995 LIBTR Halpern, On Ambiguities in the Interpretation of Game Trees 1995 LIBTR Grove & Halpern, On the Expected Value of Games with Absentmindedness 1995 LIBTR Hifi & Zissimopoulos, Constrained Two-dimensional Cutting: An Improvement of Christofides and Whitlocks Exact Algorithm 1995 LIBTR Karzanov, Minimum Distance Mappings of Graphs 1995 LIBTR Durr & Le Thanh & Santha, A Decision Procedure for Well-formed Quantum Linear Cellular Automata 1995 LIBTR Michael & Scott, Correction of a Memory Management Method for Lock-free Data Structures 1995 LIBTR Karaivazoglou & Spirakis & Triantafilou, Wormhole Routing Simulation on a Mesh 1995 LIBTR Diaz & Gibbons & Pantziou & Serna & Spirakis & Toran, Efficient Parallel Algorithms for some Tree Layout Problems 1995 LIBTR Aydogan & Stunkel & Aykanat & Abali, Adaptive Source Routing in Multistage Interconnection Networks 1995 LIBTR Griffioen & Korver, The Bakery Protocol: A Comparative Case-Study in Formal Verification 1995 LIBTR Cramer & Franklin & Schoenmakers & Yung, Multi-authority Secret-Ballot Elections with Linear Work 1995 LIBTR Walters & Zantema, Rewrite Systems for Integer Arithmetic 1995 LIBTR Lynch & Segala & Vaandrager & Weinberg, Hybrid I/O Automata 1995 LIBTR Romijn & Vaandrager, A Note on Fairness in I/O Automata 1995 LIBTR Bose & McAllister & Snoeyink, Optimal Algorithm to Embed Trees in a Point Set 1995 LIBTR Pippenger, Pure versus Impure Lisp 1995 LIBTR Baldoni & Manabe & Raynal & Aoyagi, k-Arbiter: A Safe and General Scheme for h-out-of-k Mutual Exclusion Problems 1995 LIBTR Parker & Pierce, The Randomizing FFT: An Alternative to Pivoting in Gaussian Elimination 1995 LIBTR Le & Parker & Pierce, Input Randomization and Automatic Derivation of Systolic Arrays for Matrix Computations 1995 LIBTR Paz & Pearl, Axiomatic Characterization of Directed Graphs 1995 LIBTR Korf, Optimal Number Partitioning 1995 LIBTR Palnati & Gerla & Leonardi, Deadlock-free Routing in an Optimal Interconnect for High-Speed Wormhole Routing Networks 1995 LIBTR Leonardi & Neri & Palnati & Gerla, Congestion Control Techniques in Asynchronous Wormhole Routing Networks 1995 LIBTR Leonardi & Palnati & Gerla, Analysis of the Bidirectional Shufflenet Multihop Topology 1995 LIBTR Bampis & Giannakos & Karzanov & Manoussakis & Milis, A Parallel Algorithm for finding a Perfect Matching in Planar Graphs 1995 LIBTR Feitelson & Rudolph, The Promise of Optical Free-space Interconnections for Concurrent Memory Access 1995 LIBTR Werman & Weinshall, Complexity of Indexing: Efficient and Learnable Large Database Indexing 1995 LIBTR Karpinski & Zelikovsky, New Approximation Algorithms for the Steiner Trees Problem 1995 LIBTR Karpinski & Zelikovsky, New Approximation Algorithms for the Steiner Tree Problems 1995 LIBTR Plunkett & Symvonis, On the Hot-Potato Permutation Routing Algorithm of Borodin, Rabani and Schieber 1995 LIBTR Meirman, Competitive Algorithms for the Array Updating Problem in Functional Languages 1995 LIBTR Friedman & Keidar & Malki & Birman & Dolev, Deciding in Partitionable Networks 1995 LIBTR Koppenhagen & Mayr, The Complexity of the Boundedness, Coverability, and Selfcoverability Problems for Commutative Semigroups 1995 LIBTR Mayr, On Polynomial Ideals, their Complexity, and Applications 1995 LIBTR Jansen & Ohring, Approximation Algorithms for Time Constrained Scheduling 1995 LIBTR Mayr & Stadtherr, Optimal Parallel Algorithms for Two Processor Scheduling with Tree Precedence Constraints 1995 LIBTR Mayr & Werchner, Optimal Tree Contraction and Term Matching on the Hypercube and Related Networks 1995 LIBTR Heun & Mayr, Embedding Graphs with Bounded Treewidth into Optimal Hypercubes 1995 LIBTR Karpinski & Zelikovsky, 1.757 and 1.267-Approximation Algorithms for the Network and Rectilinear Steiner Tree Problems 1995 LIBTR Arora & Karger & Karpinski, Polynomial Time Approximation Schemes for Dense Instances of NP-hard Problems 1995 LIBTR Alizadeh & Karp & Weisser & Zweig, Physical Mapping of Chromosomes Using Unique Probes 1995 LIBTR Adler & Byers & Karp, Parallel Sorting with Limited Bandwidth 1995 LIBTR Luby & Wigderson, Pairwise Independence and Derandomization 1995 LIBTR Hernek, Random Walks on Colored Graphs: Analysis and Applications 1995 LIBTR Lamparter & Albanese & Kalfane & Luby, PET -- Priority Encoding Transmission: A New, Robust and Efficient Video Broadcast Technology 1995 LIBTR Blomer & Kalfane & Karp & Karpinski & Luby & Zuckerman, An XOR-based Erasure-resilient Coding Scheme 1995 LIBTR Plaskota, Noisy Information and Computational Complexity: A Short Survey 1995 LIBTR Gupta & Rothermel, Fault Handling for Multi-party Real-time Communication 1995 LIBTR Antoniotti & Mishra, The Supervisor Synthesis Problem for Unrestricted CTL is NP-complete 1995 LIBTR Farley & Pelc & Proskurowski, Minimum-Time Multidrop Broadcast 1995 LIBTR Farley & Freeman, Burden of Proof in Legal Argumentation 1995 LIBTR Russinovich & Cogswell, Replay for Concurrent Non-deterministic Shared Memory Applications 1995 LIBTR Hein & Jiang & Wang & Zhang, On the Complexity of Comparing Evolutionary Trees 1995 LIBTR Alberts & Henzinger, Average Case Analysis of Dynamic Graph Algorithms 1995 LIBTR Albers & Mitzenmacher, Average Case Analyses of List Update Algorithms, with Applications to Data Compression 1995 LIBTR Blum & Cucker & Shub & Smale, Complexity and Real Computation: A Manifesto 1995 LIBTR Bhatt & Chung & Leighton & Rosenberg, On Optimal Strategies for Stealing Cycles 1995 LIBTR Nettles, Safe and Efficient Persistent Heaps 1995 LIBTR Evans & Pippenger, On the Maximum Tolerable Noise for Reliable Computation by Formulas 1995 LIBTR Goldberg & Goldman & Scott, PAC Learning of One-Dimensional Patterns 1995 LIBTR Srivas & Miller, Formal Verification of a Commercial Microprocessor 1995 LIBTR Bharat & Brown, Visual Obliq: A System for Building Distributed, Multi-user Applications by Direct Manipulation 1995 LIBTR Berkman & Sandholm, What Should be Minimized in a Decision Tree: A Re-examination 1995 LIBTR Even & Litman & Rosenberg, Monochromatic Paths and Triangulated Graphs 1995 LIBTR Martin, A Computer Scientist's Guide to Writing and Publishing Technical Articles 1995 LIBTR McAuliffe & Tempero, Protecting Computer Systems from Attack 1995 LIBTR Biddle & Tempero, What Every Manager Should Know about C++ 1995 LIBTR O'Malley & Orman & Schroeppel, Fast Key Exchange with Elliptic Curve Systems 1995 LIBTR Cammaroto & Delorme & Ordaz, Stars with Null Sum in Graph 1995 LIBTR Simmen & Shekita & Malkemus, Optimizing the Way Order Requirements are Satisfied 1995 LIBTR Friedman & Halpern, Plausibility Measures and Default Reasoning 1995 LIBTR Alpern & Carter & Ferrante, Space-limited Procedures: A Methodology for Portable High-Performance 1995 LIBTR Miller, Artificial Life as Theoretical Biology: How To Do Real Science with Computer Simulation 1995 LIBTR Thompson, Evolving Fault-Tolerant Systems 1995 LIBTR Balbi de Oliveira, An Empirical Exploration of Computations with a Cellular-Automata-Based Artificial Life World 1995 LIBTR Kay, Cryptanalysis Techniques: An Example Using Kerberos 1995 LIBTR Guattery, Applications of Graph-Theoretical Properties in Algorithms 1995 LIBTR Paterson & Prztycka, On the Complexity of String Folding 1995 LIBTR Ravindran & Gibbons & Paterson, Dense Edge-Disjoint Embedding of Complete Binary Trees in Interconnection Networks 1995 LIBTR Paterson & Srinivasan, Contention Resolution with Bounded Delay 1995 LIBTR Rhee & Martin, A Scalable Real-time Synchronization Protocol for Distributed Systems 1995 LIBTR Karger, Random Sampling in Graph Optimization Problems 1995 LIBTR Basch & Khanna & Motwani, On Diameter Verification and Boolean Matrix Multiplication 1995 LIBTR Khanna & Motwani & Yao, Approximation Algorithms for the Largest Common Subtree Problem 1995 LIBTR Chaitin, The Limits of Mathematics 1995 LIBTR Hemaspaandra & Ramachandran & Zimand, Worlds To Die For 1995 LIBTR Roberts & Symvonis & Zhang, Routing on Trees via Matchings 1995 LIBTR Ramaswami & Segall, Efficient Shortest-Path Computation in Multiwavelength Lightwave Networks 1995 LIBTR Hall & Ramaswami & Sasaki, Fault-Tolerant Multichannel Multiplexer Ring Configuration 1995 LIBTR Ajtai & Megiddo & Waarts, Improved Algorithms and Analysis for Secretary Problems and Generalizations (preliminary version) 1995 LIBTR Fagin, Combining Fuzzy Information from Multiple Systems 1995 LIBTR Mizuno & Tsuchiya & Megiddo, A Linear Programming Instance with Many Crossover Events 1995 LIBTR Anderson & Lotspiech, Rights Management and Security in the Electronic Library 1995 LIBTR Halpern, A Logical Approach to Reasoning about Uncertainty: A Tutorial 1995 LIBTR Friedman & Halpern, Modeling Belief in Dynamic Systems Part 1: Foundations 1995 LIBTR Friedman & Halpern, Plausibility Measures: A User's Guide 1995 LIBTR Halpern & Koller, Representation Dependence in Probabilistic Inference 1995 LIBTR Bacchus & Halpern & Levesque, Reasoning about Noisy Sensors in the Situation Calculus 1995 LIBTR Bruck & Ho, Fault-Tolerant Cube Graphs and Coding Theory 1995 LIBTR Turek & Li & Rogowitz & Wolf & Bergman & Castelli & Chen & Gerth & Robinson & Ryniker & Treinish & Pickover & Wu, Search and Retrieval in Large Image Archives 1995 LIBTR Douglas, A Review of Numerous Parallel Multigrid Methods 1995 LIBTR Hu & Tresser, Period Doubling, Entropy, and Renormalization 1995 LIBTR Boneh & Dunworth & Lipton, Breaking DES Using a Molecular Computer 1995 LIBTR Boneh & Lipton, Making DNA Computer Error Resistant 1995 LIBTR Gu & Peng, k-Pairwise Cluster Fault Tolerant Routing in Star Graphs 1995 LIBTR Kokosinski, Algorithms for Unranking Combinations and Other Related Choice Functions 1995 LIBTR Fugii & Nehaniv & Schmitt, On Genetic Algorithms 1995 LIBTR Sedukhin, An Algorithm and Array Processors for Solving the Systems of Linear Equations 1995 LIBTR Huang & Cheng & Osano & Shiratori, Design of a Coordinator for the Committee Coordination Problem 1995 LIBTR Orr, Reorienting Curriculums and Faculty for the Shift to Discipline-specific Language Instruction 1995 LIBTR Kokosinski, Unranking Combinations in Parallel 1995 LIBTR Kapralski, Fast Parallel Algorithms for Shortest Path within Planar Figures 1995 LIBTR Palis & Liou & Rajasekaran & Shende, Online Scheduling of Dynamic Trees 1995 LIBTR Coppersmith, Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Unknown 1995 LIBTR Jerrum, Computational Polya Theory 1995 LIBTR Chochia & Cole & Heywood, Implementing the Hierarchical PRAM on the 2D Mesh: Analyses and Experiments 1995 LIBTR Nastou & Serpanos & Maritsas, Average Case Analysis of Searching in Associative Processing 1995 LIBTR McGuire, Two Methods for Checking Formulas of Temporal Logic 1995 LIBTR Lasher & Reich & Anderson, The Computer Science Technical Report (CS-TR) Project: Considerations from the Library Perspective 1995 LIBTR Kennedy, Solving Unweighted and Weighted Bipartite Matching Problems in Theory and Practice 1995 LIBTR Wolf, Hierarchical Models of Synchronous Circuits for Formal Verification and Substitution 1995 LIBTR Greenwald & Singhal & Stone & Cheriton, Designing an Academic Firewall: Policy, Practice and Experience with SURF 1995 LIBTR Blackburn & Meyer-Viol & de Rijke, A Proof System for Finite Trees 1995 LIBTR Panaite, Parallel Routings within All the Levels of Wrapped Butterfly 1995 LIBTR Manoussakis, Matchings in Graphs and Scheduling Problems 1995 LIBTR Delorme & Duran & Ordaz, The Zero-Sum Stars Problem 1995 LIBTR Delorme & Panaite, Rubik Routings: Packet Routings in a Restricted Communication Model 1995 LIBTR Bodlaender & Downey & Fellows & Wareham, The Parameterized Complexity of Sequence Alignment and Consensus 1995 LIBTR Biedl & Kant, A Better Heuristic for Orthogonal Graph Drawings 1995 LIBTR van Leeuwen & Tan, Compact Routing Methods: A Survey 1995 LIBTR Agarwal & de Berg & Matousek & Schwarzkopf, Constructing Levels in Arrangements and Higher Order Voronoi Diagrams 1995 LIBTR van Leeuwen & Santoro & Urrutia & Zaks, Guessing Games, Binomial Sum Trees and Distributed Computations in Synchronous Networks 1995 LIBTR Vleugels & Overmars, Approximating Generalized Voronoi Diagrams in Any Dimension 1995 LIBTR Flammini & van Leeuwen & Marchetti-Spaccamela, The Complexity of Interval Routing on Random Graphs 1995 LIBTR de Berg, Trends and Developments in Computational Geometry 1995 LIBTR Svestka & Overmars, Probabilistic Path Planning 1995 LIBTR Blum & Furst, Fast Planning through Planning Graph Analysis 1995 LIBTR Franaszek & Robinson & Thomas, Parallel Compression with Cooperative Dictionary Construction 1995 LIBTR Coppersmith & Franklin & Patarin & Reiter, Low-Exponent RSA with Related Messages 1995 LIBTR Zimand, On Randomized Cryptographic Primitives 1995 LIBTR Michael & Scott, Simple, Fast, and Practical Non-blocking and Blocking Concurrent Queue Algorithms 1995 LIBTR Franaszek & Thomas, Empirical Context Allocation for Multiple Dictionary Data Compression 1995 LIBTR Chillarege, Challenges Facing Software Fault-Tolerance 1995 LIBTR Blackburn & de Rijke, Why Combine Logics? 1995 LIBTR Levrie & Bultheel, First-order linear recurrence systems and matrix continued fractions 1995 LIBTR van Glabbeek & Vaandrager, The Difference between Splitting in n and n+1 1995 LIBTR Brands, Secret-Key Certificates (continued) 1995 LIBTR Siebes & van den Akker & van der Voort, (Un)decidability Results for Trigger Design Theories 1995 LIBTR Cramer, New Generation of Secure and Practical RSA-based Signatures 1995 LIBTR Ariola & Klop, Equational Term Graph Rewriting 1995 LIBTR Rounds & Zhang, Suggestions for a Non-monotonic Feature Logic 1995 LIBTR Mitchell & Vavasis, An Aspect Ratio Bound for Triangulating a d-Grid Cut by a Hyperplane 1995 LIBTR Spirakis & Triantafillou, Greedy Hot-Potato Routing in the 2-D Mesh with Random Destinations 1995 LIBTR Fortnow & Rogers, Separability and One-way Functions 1995 LIBTR Babai & Friedl, On Slightly Superlinear Transparent Proofs 1995 LIBTR Fortnow & Freivalds & Gasarch & Kummer & Kurtz & Smith & Stephan, Measure, Category and Learning Theory 1995 LIBTR Fink & Wood, Strong Restricted-Orientation Convexity 1995 LIBTR Geva, A Study of Higher-order Sequential Computation 1995 LIBTR Hemaspaandra & Hempel & Wechsung, Query Order and Self-specifying Machines 1995 LIBTR Marchiori, A Methodology for Proving Termination of General Logic Problems 1995 LIBTR Fokkink & Klusener, An Effective Axiomatization for Real Time ACP 1995 LIBTR Apt, Arrays, Bounded Quantification and Iteration in Logic and Constraint Logic Programming 1995 LIBTR Kennaway & Klop & Sleep & de Vries, Infinitary Lambda Calculus 1995 LIBTR Brands, More on Restrictive Blind Issuing of Secret-Key Certificates in Parallel Mode 1995 LIBTR Blackburn & de Rijke, Why Combine Logics? 1995 LIBTR Shachnai, On the Hardness of Approximate Counting and Phenomena Prediction 1995 LIBTR Li & Ofek & Yung, Time-driven Priority Flow Control for Real-time Heterogeneous Internetworking 1995 LIBTR Lew & Lew, A General Permutation Test for Pairwise Agreement 1995 LIBTR Cortez, Prediction of Generalization Ability in Learning Machines 1995 LIBTR Lamport, Proving Possibility Properties 1995 LIBTR Ma, The Recognition of Permutation Functions 1995 LIBTR Gao & von Zur Gathen & Panario, Gauss Periods, Primitive Normal Bases, and Fast Exponentiation in Finite Fields/fR 1995 LIBTR Ghosh & Leighton & Maggs & Muthukrishnan & Plaxton & Rajaraman & Richa & Tarjan & Zuckerman, Tight Analyses of Two Local Load Balancing Algorithms 1995 LIBTR Goldreich & Petrank, Quantifying Knowledge Complexity 1995 LIBTR Kesten & Pnueli & Raviv, OBDDs LTL MC Model Checking of Linear TL, Using OBDDs 1995 LIBTR Peleg, The Power of Small Coalitions in Graphs 1995 LIBTR Bar-Noy & Canetti & Kutten & Mansour & Schieber, Bandwidth Allocation with Preemption 1995 LIBTR Raghavan & Upfal, Efficient Routing in All-Optical Networks 1995 LIBTR Broder & Dyer & Frieze & Raghavan & Upfal, The Worst-Case Running Time of the Random Simplex Algorithm is Exponential in the Height 1995 LIBTR Azar & Broder & Karlin & Upfal, Balanced Allocations 1995 LIBTR Mayer & Naor & Stockmeyer, Local Computations on Static and Dynamic Graphs 1995 LIBTR Fiat & Naor, Rigorous Time/Space Tradeoffs for Inverting Functions 1995 LIBTR Naor & Wool, The Load, the Capacity and Availability of Quorum Systems 1995 LIBTR Cierniak & Li, Recovering Logical Data and Code Structures 1995 LIBTR Even & Naor & Schieber & Zosin, Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications to Multicuts 1995 LIBTR Chaitin, How to Run Algorithmic Information Theory on a Computer 1995 LIBTR Chaitin, The Limits of Mathematics--Tutorial Version 1995 LIBTR Agarwal & Balle & Gustavson & Joshi & Palker, A 3-dimensional Approach to Parallel Matrix Multiplication 1995 LIBTR Ramaswami & Segall, Distributed Network Control for Wavelength Routed Optical Networks 1995 LIBTR Selman & Kirkpatrick, Critical Behavior in the Computational Cost of Satisfiability Testing 1995 LIBTR Chatterjee & Inselberg, Visualizing Multi-dimensional Polytopes and Topologies for Tolerances 1995 LIBTR Hemaspaandra & Zaki & Zimand, Polynomial-Time Semi-rankable Sets 1995 LIBTR Walicki & Broy, Structured Specifications and Implementation of Nondeterministic Data Types 1995 LIBTR Bodlaender & Deogun & Jansen & Kloks & Kratsch & Muller & Tuza, Ranking of Graphs 1995 LIBTR Grinberg & Lafferty & Sleator, A Robust Parsing Algorithm for Link Grammars 1995 LIBTR Mogul, The Case for Persistent-Connection HTTP 1995 LIBTR Dion & Monier, Contour: A Tile-based Gridless Router 1995 LIBTR Monier & Dion, Recursive Layout Generation 1995 LIBTR Haddad, Drip: A Schematic Drawing Interpreter 1995 LIBTR Brown & Shillner, DeckScape: An Experimental Web Browser 1995 LIBTR Ogihara, Functions Computable with Limited Access to NP 1995 LIBTR Masullo, Putting Digital Libraries to Work for Education 1995 LIBTR Masullo, EduPort: A Networked Education Infrastructure 1995 LIBTR Carrasquel, Are Case Studies a Good Teaching Tool for CS1? 1995 LIBTR Ibarra, Finding Pattern Matchings for Permutations 1995 LIBTR Brands, Off-line Electronic Cash Based on Secret-Key Certificates 1995 LIBTR Hoepman & Paptriantafilou & Tsigas, Toward Self-Stabilizing Wait-free Shared Memory Objects 1995 LIBTR Alstein & Hoepman & Olivier & van der Put, Self-Stabilizing Mutual Exclusion on Directed Graphs 1995 LIBTR Brands, Secret-Key Certificates 1995 LIBTR Brands, Restrictive Blinding of Secret-Key Certificates 1995 LIBTR Strong, Specification of Logical Clock Objects 1995 LIBTR Coster & Dewulf & Leuven & Ho, Efficient Multi-packet Multicast Algorithms on Meshes with Wormhole and Dimension-oriented Routing 1995 LIBTR Choy & Dievendorff & Dwork & Lotspiech & Morris & Anderson & Bell & Boyer & Griffin & Hoenig & McCrossin & Miller & Pass & Pestoni & Picciano, The Almaden Distributed Digital Library System 1995 LIBTR Maelbrancke & Olivie, The Fringe Bucket-Quadtree, a Robust and Efficient Spatial Data Structure with a High Population Density 1995 LIBTR Brands, A Note on Parallel Executions of Restrictive Blind Issuing Protocols for Secret-Key Certificates 1995 LIBTR Blaum & Bruck, New Results on Coding for Parallel Asynchronous Communications 1995 LIBTR Ford & Myllymaki, A Log-structured Organization for Tertiary Storage 1995 LIBTR Basturk & Bellare & Chow & Guerin, Secure Transport Protocols for High-Speed Networks 1995 LIBTR Zadrozny, The Compactness of Construction Grammars 1995 LIBTR Rogowitz & Gerth & Rabenhorst, An Intelligent Tool for Selecting Colors and Fonts for Graphical User Interfaces 1995 LIBTR Brezin & Shub, Stable Ergodicity in Homogeneous Spaces 1995 LIBTR Frankel & Herzberg & Karger & Krawczyk & Kunzinger & Yung, CDPD Wireless Network Security: Fraud-prevention, Availability, Confidentiality, and Anonymity 1995 LIBTR Zadrozny, Measuring Semantic Complexity 1995 LIBTR Hong & Hosking & Winograd, Use of Randomization to Normalize Feature Merits 1995 LIBTR Even & Naor & Schieber & Sudan, Approximating Minimum Feedback Sets and Multicuts in Directed Graphs 1995 LIBTR Hemaspaandra & Zaki & Zimand, Polynomial-Time Semi-rankable Sets 1995 LIBTR Hemaspaandra & Rothe & Wechsung, Easy Sets and Hard Certificate Schemes 1995 LIBTR Zimand, On Randomized Cryptographic Primitives 1995 LIBTR Ogihara, The PL Hierarchy Collapses 1995 LIBTR Chor & Sudan, A Geometric Approach to Betweenness 1995 LIBTR Khanna & Motwani & Sudan & Vazirani, On Syntactic versus Computational Views of Approximability 1995 LIBTR Cramer, On Shared Randomness and the Size of Secure Signatures 1995 LIBTR Cramer & Pedersen, Efficient and Provable Security Amplifications 1995 LIBTR Brands, Restrictive Blind Issuing of Secret-Key Certificates in Parallel Mode 1995 LIBTR Chaitin, A New Version of Algorithmic Information Theory 1995 LIBTR Tresser & Worfolk, Controlling Chaos by Synchronization 1995 LIBTR Guattery & Miller, Efficient Parallel Algorithms for Planar DAGs 1995 LIBTR Chen & Yu & Wu, Index Allocation for Sequential Data Broadcasting in Wireless Mobile Computing 1995 LIBTR Schwiegelshohn & Turek & Wolf, Preemptive Scheduling of Parallel Tasks 1995 LIBTR Borodin & Rabani & Schieber, Deterministic Many-to-Many Hot Potato Routing 1995 LIBTR Malhortra & Srinivasan, Storage Efficient Data Structure for Large Lookup Dictionaries 1995 LIBTR Reif, O(log^2 n) Time Efficient Parallel Factorization of Dense, Sparse Separable, and Banded Matrices 1995 LIBTR Ito & Takagi & Yajima, Efficient Initial Approximation and Fast Converging Algorithms for Division and Square Root 1995 LIBTR Hamano & Takagi & Yajima & Preparata, 0(n)-Depth Circuit for Modular Exponentiation 1995 LIBTR Hassler & Takagi, Function Evaluation by Table Look-Up and Addition 1995 LIBTR Takenaga & Yajima, Expressive Power of Read-k-Times-Only Branching Programs 1995 LIBTR Takagi & Yajima, On the Expressive Power of OBDDs with Parametric Variables and Bounded Cutwidth Circuits 1995 LIBTR Nakashima & Chikayama, Depth-First Copying Garbage Collection without Extra Stack Space 1995 LIBTR Shouichi & Katsuo, Unateness, Symmetry, and Self-Duality of Boolean Functions Satisfying the Propagation Criterion 1995 LIBTR Ito & Takagi & Yajima, Efficient Hardware Initial Approximation Method for Multiplicative Division and Square Root 1995 LIBTR Karzanov, Multiflows and Disjoint Paths of Minimum Total Cost 1995 LIBTR Li & Sotteau & Ku, 2-Diameter of de Bruijn Networks 1995 LIBTR Heydemann & Opatrny & Sotteau, Embeddings of Complete Binary Trees into Extended Grids with Edge-Congestion 1 1995 LIBTR Karzanov, How to Tidy Up a Symmetric Set-System 1995 LIBTR Hauser, Using the Internet to Reduce Software Piracy -- On Anonymous Receipts, Anonymous ID Cards, and Anonymous, Vouchers 1995 LIBTR Doeringer & Karjoth & Nassehi, Routing on Longest-Matching Prefixes 1995 LIBTR Coppersmith, Quadratic Integer Programming, and Factoring with a Clue 1995 LIBTR Sirisaengtaksin & Fuentes & Kreinovich, Non-traditional Neural Networks that Solve One More Intractable Problem: Propositional Satisfiability 1995 LIBTR Nelson, Three-Dimensional Recognition via Two-Stage Associative Memory 1995 LIBTR Kyburg, Combinatorial Semantics 1995 LIBTR Hemaspaandra & Jiang & Rothe & Watanabe, Multi-selectivity and Complexity-lowering Joins 1995 LIBTR Ogihara, Sparse Hard Sets for P Yield Space-Efficient Algorithms 1995 LIBTR Chow & Herzberg, Network Randomization Protocol: A Proactive Pseudo-random Generator 1995 LIBTR Bar-Noy & Shachnai & Tamir, The Minimum Color Sum Problem and Distributed Resource Allocation 1995 LIBTR Shearer, The Independence Number of Dense Graphs with Large Odd Girth 1995 LIBTR Bar-Noy & Mayer & Schieber & Sudan, Guaranteeing Fair Service to Persistent Dependent Tasks 1995 LIBTR Coppersmith, Factoring with a Hint 1995 LIBTR Seiferas & Meyer, Characterization of Realizable Space Complexities 1995 LIBTR Vaandrager, Verification of a Distributed Summation Algorithm 1995 LIBTR Schoenmakers, A New Algorithm for the Recognition of Series Parallel Graphs 1995 LIBTR Urquhart & Fu, Simplified Lower Bounds for Propositional Proofs 1995 LIBTR Lin & Orlowska, An Optimal Voting Scheme for Minimizing the Overall Communication Cost in Replicated Data Management 1995 LIBTR Feldmann & Maggs & Sgall & Sleator & Tomkins, Competitive Analysis of Call Admission Algorithms that Allow Delay 1995 LIBTR Starkey & Bryant, Using Ordered Binary-Decision Diagrams for Compressing Images and Image Sequences 1995 LIBTR Wing, Teaching Mathematics to Software Engineers 1995 LIBTR Kessler & Krawczyk, Minimum Buffer Length and Clock Rate for the Shrinking Generator Cryptosystem 1995 LIBTR Mayer & Ofek & Yung, Approximate Max-Min Fair Rates via Distributed Local Scheduling with Partial Information 1995 LIBTR Zadrozny, The Compactness of Construction Grammars 1995 LIBTR Zadrozny & Ramer, The Significance of Constructions 1995 LIBTR Kavraki & Latombe & Motwani & Raghavan, Randomized Query Processing in Robot Path Planning 1995 LIBTR Raghavan & Upfal, Stochastic Contention Resolution with Short Delays 1995 LIBTR Lagarias & Tresser, A Walk Along the Branches of the Extended Farey Tree 1995 LIBTR Arazi & Corella, Public Key Cryptographic IC-card Identification Based on Low-Cost Hardware in the Card and Low Communication Overhead 1995 LIBTR Broder & Dyer & Frieze & Raghavan & Upfal, The Worst-Case Running Time of the Random Simplex Algorithm is Exponential in the Height 1995 LIBTR Bellare & Guerin & Rogaway, XOR MACs: New Methods for Message Authentication Using Block Ciphers 1995 LIBTR Thatcher, Screen Reader/2 Access to the Graphical User Interface 1995 LIBTR Thatcher, Exploring the Internet with OS/2 and Screen Reader/2 1995 LIBTR Lew & Lew, Reliability in Terms of the Proportion of Pairs that Agree 1995 LIBTR Appenzeller & Kuehlmann, Formal Verification of a PowerPC* Microprocessor 1995 LIBTR Franaszek & Georgiou & Li, Adaptive Routing in Clos Network 1994 LIBTR Hung & Ierardi, Constructing Convex Hulls of Piecewise Smooth Objects 1994 LIBTR Salvy (Ed.), Algorithms Seminar, 1993-1994 1994 LIBTR LaForge, Some Zarankiewicz Numbers with Linear Time Extremal Algorithms for Finding Bipartite Cliques 1994 LIBTR Chaitin, The Limits of Mathematics IV 1994 LIBTR Chaitin, The Limits of Mathematics II 1994 LIBTR Chaitin, The Limits of Mathematics 1994 LIBTR Gong, Authentication, Key Distribution, and Secure Broadcast in Computer Networks Using No Encryption or Decryption 1994 LIBTR Gong, Efficient Network Authentication Protocols: Lower Bounds and Optimal Implementations 1994 LIBTR Gong, Fail-Stop Protocols: An Approach to Designing Secure Protocols 1994 LIBTR Arrowsmith & McMillin, Teaching the Practice of Formal Methods in Distributed Computing Systems -- A Module 1994 LIBTR Sankaranarayana, Well-Covered Graphs: Some New Sub-classes and Complexity Results 1994 LIBTR Culberson & Schaeffer, Efficiently Searching the 15-Puzzle 1994 LIBTR Elmallah & Culberson, Multicommodity Flows in Simple Multistage Networks 1994 LIBTR Plaat & Schaeffer & Pijls & de Bruin, Nearly Optimal Minimax Tree Search? 1994 LIBTR Plaat & Schaeffer & Pijls & de Bruin, A New Paradigm for Minimax Search 1994 LIBTR Bouabdallah & Laforest, Gossiping in Faulty Distributed Networks 1994 LIBTR Fraigniaud & Laforest, Length and Number of Buses for Gossiping in Networks 1994 LIBTR Manber, A Simple Scheme To Make Passwords Based on One-Way Functions Much Harder To Crack 1994 LIBTR Bowen & Hinchey, Ten Commandments of Formal Methods 1994 LIBTR Robertson & Jones, Simple, Proven Approaches to Text Retrieval 1994 LIBTR Wheeler & Needham, Two Cryptographic Notes 1994 LIBTR Pritchard, An Old Sub-quadratic Algorithm for Finding Extremal Sets 1994 LIBTR Jerrum, The Computational Complexity of Counting 1994 LIBTR Esparza & Bruns, Trapping Mutual Exclusion in the Box Calculus 1994 LIBTR Frieze & Jerrum, Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION 1994 LIBTR Harris, A Survey of PRAM Simulation Techniques 1994 LIBTR Najork & Brown, A Library for Visualizing Combinatorial Structures [videotape] 1994 LIBTR Just & Kranakis & Krizanc & van Oorschot, Broadcasting Session Keys 1994 LIBTR Oommen & de St. Croix, String Taxonomy Using Learning Automata 1994 LIBTR Kranakis & Krizanc & Maheshwari & Sack & Urrutia, Killing Two Birds with One Stone 1994 LIBTR van Oorschot, Extending Cryptographic Logics of Belief to Key Agreement Protocols 1994 LIBTR Rueppel & van Oorschot, Modern Key Agreement Techniques 1994 LIBTR Syverson & van Oorschot, On Unifying Some Cryptographic Protocol Logics 1994 LIBTR Wiener, Efficient DES Key Search 1994 LIBTR Mans & Santoro, Optimal Fault-Tolerant Leader Election in Chordal Rings 1994 LIBTR Oommen & van Oorschot, Randomized Encryption with Insertions and Deletions Based on Probability Distributions 1994 LIBTR Kranakis & Krizanc & Urrutia, On the Number of Directions in Visibility Representations of Graphs 1994 LIBTR van Oorschot & Wiener, Parallel Collision Search with Application to Hash Functions and Discrete Logarithms 1994 LIBTR Oommen & de St. Croix, Graph Partitioning Using Learning Automata 1994 LIBTR Kranakis & Krizanc & Ruf & Urrutia & Woeginger, VC-Dimensions for Graphs 1994 LIBTR Kranakis & Krizanc & Luccio, String Recognition on Anonymous Rings 1994 LIBTR Filin & Malyshev & Manita, Probabilistic Models for Computer Architectures 1994 LIBTR Boissonnat & Czyzowicz & Devillers & Yvinec, Circular Separability of Polygons 1994 LIBTR Maranget, Two Techniques for Compiling Lazy Pattern Matching 1994 LIBTR Suciu & Paredaens, Any Algorithm in the Complex Object Algebra with Powerset Needs Exponential Space to Compute Transitive Closure 1994 LIBTR Suciu & Breazu-Tannen, A Query Language for NC 1994 LIBTR Suciu & Tannen, Efficient Compilation of High-level Data Parallel Algorithms 1994 LIBTR de Berg & Guibas & Halperin, Vertical Decompositions for Triangles in 3-Space 1994 LIBTR Agarwal & Schwarzkopf & Sharir, The Overlay of Lower Envelopes and its Applications 1994 LIBTR Zantema, Total Termination of Term Rewriting is Undecidable 1994 LIBTR Abadi & Needham, Prudent Engineering Practice for Cryptographic Protocols 1994 LIBTR Gower & Wilkerson, R-by-C crozzle: An NP-hard Problem 1994 LIBTR Nahum & O'Malley & Orman & Schroeppel, Towards High Performance Cryptographic Software 1994 LIBTR Sivilotti & Carlin, A Tutorial for C++ 1994 LIBTR Rustan & Leino, Computing Permutation Encodings 1994 LIBTR van de Snepscheut, Mechanized Support for Stepwise Refinement 1994 LIBTR Myers & Burks & Stormo, Identifying Features in Biological Sequences: Fifth Workshop Report 1994 LIBTR Chandra, Approximation and Online Algorithms for Graph Problems 1994 LIBTR Babai, Automorphism Groups, Isomorphism, Reconstruction 1994 LIBTR Babai & Kimmel & Lokam, Simultaneous Messages vs. Communication 1994 LIBTR Fortnow & Kimmel, Beating a Finite Automaton in the Big Match 1994 LIBTR Rogers, The Isomorphism Conjecture Holds and One-way Functions Exist Relative to an Oracle 1994 LIBTR Fortnow & Laplante, A Note on Adaptiveness and Advice in Coherence 1994 LIBTR Gal & Szegedy, Fault Tolerant Circuits and Probabilistically Checkable Proofs 1994 LIBTR Fenner & Fortnow, Beyond P^NP = NEXP 1994 LIBTR Gal, Semi-unbounded Fan-in Circuits: Boolean vs. Arithmetic 1994 LIBTR Fortnow & Kummer, Resource-Bounded Instance Complexity 1994 LIBTR Tsai & Freidl, Two Results on the Bit Extraction Problem 1994 LIBTR Babai & Kimmel, Simultaneous Messages vs. Communication 1994 LIBTR Laplante, A Kolmogorov Complexity Proof of Hastads Switching Lemma 1994 LIBTR Feigenbaum & Fortnow, A Note on Self-Correction vs. Random-Self-Reducibility 1994 LIBTR Babai, Transparent Proofs and Limits to Approximation 1994 LIBTR Lipton & O'Donnell, Intuitive Counterexamples for Constructive Fallacies 1994 LIBTR Gregor & Harris, String Matching with Left-to-Right Networks 1994 LIBTR Gregor, Data-driven Inductive Inference of Finite-State Automata 1994 LIBTR Bienstock & Langston, Algorithmic Implications of the Graph Minor Theorem 1994 LIBTR Babai & Beals & Cai & Ivanyos & Luks, Multiplicative Equations over Commuting Matrices 1994 LIBTR Fraigniaud & Gavoille, Interval Routing Schemes 1994 LIBTR Adamo & Trejo, Parallel Merge Sort for Distributed Memory Architectures 1994 LIBTR Fleury & Fraigniaud, Strategies for Multicasting in Meshes 1994 LIBTR Fleury & Fraigniaud, Deadlocks in Adaptive Wormhole Routing 1994 LIBTR Mazoyer, Synchronization of a Line of Finite Automata with Nonuniform Delays 1994 LIBTR Smucker & Stanley & Ashlock, Analyzing Social Network Structures in the Iterated Prisoners Dilemma with Choice and Refusal 1994 LIBTR Bacik & Mahajan, Interactive Proof Systems and Polynomial Algorithms 1994 LIBTR Hell & Kirkpatrick, A Greedy [g,f]-factor Algorithm for Complete and Complete Bipartite Graphs 1994 LIBTR Akl & Bhattacharya & Kaller, Optimal Parallel Algorithm for the Maximum Clique Problem in a Family of Proper Circular Arcs 1994 LIBTR Burton & Simpson, Space Efficient Execution of Deterministic Parallel Programs 1994 LIBTR Bhattacharya & Kaller, An O(m + n log n) Algorithm for the Maximum Clique Problem in Circular-Arc Graphs 1994 LIBTR Deserable, A Terminology for 2D Grids 1994 LIBTR Deserable, The Arrowhead Torus: A Cayley Graph on the 6-valent Grid 1994 LIBTR Hettler & Nazareth & Regensburger & Slotosch, AVL Trees Revisited: A Case Study in Spectrum 1994 LIBTR Stolen, A Refinement Relation Supporting the Transition from Unbounded to Bounded Communication Buffers 1994 LIBTR Overmars & Svestka, A Probabilistic Learning Approach to Motion Planning 1994 LIBTR Bose & Guibas & Lubiw & Overmars & Souvaine & Urrutia, The Floodlight Problem 1994 LIBTR Rao & Goldberg, Computing Grasp Functions 1994 LIBTR Bouckaert, Probabilistic Network Construction Using the Minimum Description Length Principle 1994 LIBTR Overmars & van der Stappen, Range Searching and Point Location among Fat Objects 1994 LIBTR Ferrucci & Overmars & Rao & Vleugels, Hunting Voronoi Vertices 1994 LIBTR Svestka & Overmars, Motion Planning for Car-like Robots Using a Probabilistic Learning Approach 1994 LIBTR de Berg, Computing Half-Plane and Strip Discrepancy of Planar Point Sets 1994 LIBTR Halperin & Overmars, Spheres, Molecules, and Hidden Surface Removal 1994 LIBTR Agarwal & Matousek & Schwarzkopf, Computing Many Faces in Arrangement of Lines and Segments 1994 LIBTR Agarwal & Schwarzkopf & Sharir, The Overlay of Lower Envelopes and its Applications 1994 LIBTR van Kreveld & Snoeyink & Whitesides, Folding Rulers Inside Triangles 1994 LIBTR de Berg & Dobrindt & Schwarzkopf, On Lazy Randomized Incremental Construction 1994 LIBTR Devillers & Golin, Dog Bites Postman: Point Location in the Moving Voronoi Diagram and Related Problems 1994 LIBTR Lazarus & Verroust, Feature-based Shape Transformation for Polyhedral Objects 1994 LIBTR Pennec & Ayache, An o[n^2] Algorithm for 3D Substructure Matching of Proteins 1994 LIBTR Devillers & Golin, Incremental Algorithms for Finding the Convex Hulls of Circles and the Lower Envelopes of the Parabolas 1994 LIBTR Ron & Singer & Tishby, The Power of Amnesia: Learning Probabilistic Automata with Variable Memory Length 1994 LIBTR Becker & Geiger, A Constant-Factor Polynomial Approximation Algorithm for the Weighted Vertex Feedback Set Problem 1994 LIBTR Lubitch & Moran, Closed Schedulers: Constructions and Applications to Consensus Protocols 1994 LIBTR Friedman, Implementing Hybrid Consistency with High-Level Synchronization Operations 1994 LIBTR Wagner & Bruckstein, Row Straightening via Local Interactions 1994 LIBTR Even & Granot, Rectilinear Planar Drawings with Few Bends in Each Edge 1994 LIBTR Ben-David & Kushilevitz & Mansour, Online Learning versus Offline Learning 1994 LIBTR Dolev & Israeli & Moran, Uniform Self-Stabilizing Leader Election Part 1: Complete Graph Protocols 1994 LIBTR Alur & Attiya & Taubenfeld, Time-Adaptive Algorithms for Synchronization 1994 LIBTR Dinitz & Vainshtein, The General Structure of Edge-Connectivity of a Vertex Subset in a Graph and its Incremental Maintenance 1994 LIBTR Biran & Moran & Zaks, Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks 1994 LIBTR Dinitz, Subset Connectivity and Edge-Disjoint Trees, with an Application to Target Broadcasting 1994 LIBTR Kozen, Logical Aspects of Set Constraints 1994 LIBTR Haussler & Seung & Kearns & Tishby, Rigorous Learning Curve Bounds from Statistical Mechanics 1994 LIBTR Amir & Dolev & Melliar-Smith & Moser, Robust and Efficient Replication Using Group Communication 1994 LIBTR Shapira & Rappoport, On Compatible Star Decompositions of Simple Polygons 1994 LIBTR Dolev & Malki, Consensus Made Practical 1994 LIBTR Dolev & Malki, On Distributed Algorithms in a Broadcast Domain 1994 LIBTR Sivilotti & Carlin, A Tutorial for CC++ 1994 LIBTR Yener & Boult, Flow Trees: A Lower Bound Computation Tool with Applications to Rearrangeable Multihop Lightwave Network Optimization 1994 LIBTR Chang & Bhuyan, Combinatorial Analysis of Subcube Reliability in Hypercubes 1994 LIBTR Cunningham & Avresky, Fault Tolerant Adaptive Routing for Two-dimensional Meshes 1994 LIBTR Fernandez & Friesen, Efficient Routing and Broadcasting in Recursive Interconnection Networks 1994 LIBTR Avresky & Al-Tawil, Reconfiguration of Faulty Hypercubes 1994 LIBTR Al-Tawil & Avresky, Reconfiguration of Spanning Trees in Faulty Hypercubes 1994 LIBTR Gregor, Data-driven Inductive Inference of Finite-State Automata 1994 LIBTR Howard & Vitter, Fast and Efficient Lossless Image Compression 1994 LIBTR Howard & Vitter, Arithmetic Coding for Data Compression 1994 LIBTR Reif, An O(n log^3 N) Algorithm for the Real Root and Symmetric Tridiagonal Eigenvalue Problems 1994 LIBTR Agarwal & Sen, Selection in Monotone Matrices and Computing k-th Nearest Neighbors 1994 LIBTR Agarwal & Schwarzkopf & Sharir, The Overlay of Lower Envelopes and its Application 1994 LIBTR Agarwal & Aronov & Sharir, Computing Envelopes in Four Dimensions with Application 1994 LIBTR Miltersen & Subramanian & Vitter & Tamassia, Complexity Models for Incremental Computation 1994 LIBTR Curewitz & Krishnan & Vitter, Practical Prefetching via Data Compression 1994 LIBTR Howard & Vitter, Design and Analysis of Fast Text Compression Based on Quasi-arithmetic Coding 1994 LIBTR Romanik & Vitter, Using Vapnik-Chervonenkis Dimension to Analyze the Testing Complexity of Program Segments 1994 LIBTR Agarwal & Katz & Sharir, Computing Depth Orders and Related Problems 1994 LIBTR Starks & Kreinovich & Narasimhamurthy, How to Avoid Congestion in Computer Networks 1994 LIBTR Kreinovich, One More Explanation of Why Totalitarian Economy has not been a Success: Systems Approach 1994 LIBTR Morgenstein & Kreinovich, Which Algorithms are Feasible and Which are Not Depends on the Geometry of Space-Time 1994 LIBTR Nguyen & Kreinovich, On Logical Equivalence in Fuzzy Logic 1994 LIBTR Nguyen & Kosheleva & Kreinovich, Is the Success of Fuzzy Logic Really Paradoxical? Or: Towards the Actual Logic behind Expert Systems 1994 LIBTR Nguyen & Kreinovich, When is an Algorithm Feasible? Soft Computing Approach 1994 LIBTR Kreinovich & Nyugen, On Hilbert's Thirteenth Problem for Soft Computing 1994 LIBTR Nguyen & Kreinovich, Towards Theoretical Foundations of Soft Computing Applications 1994 LIBTR Abello & Kreinovich & Nguyen & Sudarsky & Yen, Computing an Appropriate Control Strategy Based only on a Given Plant's Rule-based Model is NP-Hard 1994 LIBTR Razborov, On Provably Disjoint NP-Pairs 1994 LIBTR Damgard & Knudsen, Enhancing the Strength of Conventional Cryptosystems 1994 LIBTR Damgard & Goldreich & Wigderson, Hashing Functions Can Simplify Zero-Knowledge Protocol Design 1994 LIBTR Miltersen & Nisan & Safra & Wigderson, On Data Structures and Asymmetric Communication Complexity 1994 LIBTR Breslauer & Gasieniec, Efficient String Matching on Coded Texts 1994 LIBTR Beimel & Gal & Paterson, Lower Bounds for Monotone Span Programs 1994 LIBTR Skyum, Complexity Theory -- Present and Future 1994 LIBTR Arge, External-Storage Data Structures for Plane-Sweep Algorithms 1994 LIBTR Riis, Count(q) Does Not Imply Count(p) 1994 LIBTR Riis, Finitisation in Bounded Arithmetic 1994 LIBTR Riis, A Fractal which Violates the Axiom of Determinacy 1994 LIBTR Riis, Bootstrapping the Primitive Recursive Functions by 47 Colors 1994 LIBTR Riis, Count(q) versus the Pigeon-Hole Principle 1994 LIBTR Goldreich, Probabilistic Proof Systems 1994 LIBTR Cramer & Damgard, Secure Signature Schemes Based on Interactive Protocols 1994 LIBTR Husfeldt, Fully Dynamic Transitive Closure in Plane Dags with One Source and One Wormhole Sink 1994 LIBTR Nisan & Ta-Shma, Symmetric logspace is Closed under Complement 1994 LIBTR Aiken & Kozen & Wimmers, Decidability of Systems of Set Constraints with Negative Constraints 1994 LIBTR Brodal, Partially Persistent Data Structures of Bounded Degree with Constant Update Time 1994 LIBTR Myers, Approximately Matching Context-free Languages 1994 LIBTR Downey & Wright, The Ratio of the Extreme to the Sum in a Random Sequence with Applications 1994 LIBTR Paterson & Dancik, Longest Common Subsequences 1994 LIBTR Clippingdale & Wilson, Self-Similar Neural Networks Based on a Kohonen Learning Rule 1994 LIBTR Miltersen, On the Cell Probe Complexity of Polynomial Evaluation 1994 LIBTR Kautz & Miltersen, Relative to a Random Oracle, NP is not Small 1994 LIBTR Megiddo & Naor & Anderson, The Minimum Reservation Rate Problem in Audio/Visual Systems 1994 LIBTR Goldberg & Goldman, Learning One-dimensional Geometric Patterns under One-Sided Random Misclassification Noise 1994 LIBTR Frazier & Goldman & Mishra & Pitt, Learning from a Consistently Ignorant Teacher 1994 LIBTR Swaminathan & Goldman, An Incremental Distributed Algorithm for Computing Biconnected Components 1994 LIBTR Bshouty & Goldberg & Goldman & Mathias, Exact Learning of Discretized Geometric Concepts 1994 LIBTR Hershberger & Suri, Morphing Binary Trees 1994 LIBTR Bienstock & Langston, Algorithmic Implications of the Graph Minor Theorem 1994 LIBTR Liu & Mussi, Deadlock Free Routing on a Ring: A Performance Evaluation 1994 LIBTR Audoire & Codani & Lavenier & Quinton, Machines Specialisees pour la Comparaison de Sequences Biologiques 1994 LIBTR Berg & Dobrindt & Schwarzkopf, On Lazy Randomized Incremental Construction 1994 LIBTR Lazarus & Verroust, Feature-based Shape Transformation for Polyhedral Objects 1994 LIBTR Pennec & Ayache, An o(n^2) Algorithm for 3D Substructure Matching of Proteins 1994 LIBTR Lamport, Processes are in the Eye of the Beholder 1994 LIBTR Brown & Hershberger, The Third Annual Video Review of Computational Geometry 1994 LIBTR Ghosh & Saluja, Optimal On-line Algorithms for Walking with Minimum Number of Turns in Unknown Streets 1994 LIBTR Kazerouni & Rajan & Shyamasundar, Mapping Linear Recurrences onto Systolic Arrays 1994 LIBTR Ghosh, On Recognizing and Characterizing Visibility Graphs of Simple Polygons 1994 LIBTR Ta-Shma, A Note on PCP vs. MIP 1994 LIBTR Singer & Tishby, Inferring Probabilistic Acyclic Automata Using the Minimum Description Length Principle 1994 LIBTR Bulgannawar & Vaidya, A Distributed K-Mutual Exclusion Algorithm 1994 LIBTR Cunningham & Avresky, Adaptive Routing for Two-dimensional Meshes 1994 LIBTR Dolev & Israeli & Moran, Uniform Self-Stabilizing Leader Election Part 2: General Graph Protocol 1994 LIBTR Gregor & Harris, String Matching with Left-to-Right Networks 1994 LIBTR Downey & Wright, The Ratio of the Extreme to the Sum in a Random Sequence with Applications 1994 LIBTR Myers, Approximately Matching Context-free Languages 1994 LIBTR Wiener, Efficient DES Key Search 1994 LIBTR Delorme & Tillich, The Spectrum of de Bruijn and Kautz Graphs 1994 LIBTR Kouider & Lonc, Path Decompositions of Regular Graphs 1994 LIBTR Burns & Rosenschein, Recognition via Blob Representation and Relational Voting 1994 LIBTR Metaxas & Pantziou & Symvonis, Parallel h-v Drawings of Binary Trees 1994 LIBTR Kagaris & Pantziou & Tragoudas & Zaroliagis, Quickest Paths: Faster Algorithms and Dynamization 1994 LIBTR Nikoletseas & Spirakis, On the Second Eigenvalue of Random Regular Graphs with Edge Faults 1994 LIBTR Kapoulas & Spirakis, Near-Optimal List Ranking on the 2-dimensional Mesh 1994 LIBTR Albers, Improved Randomized On-line Algorithms for the List Update Problem 1994 LIBTR Rustan & Leino, Computing Permutation Encodings 1994 LIBTR Sivilotti & Carlin, A Tutorial for C++ 1994 LIBTR Avresky & Al-Tawil, Improvement of Reliability in Hypercubes Using a Fast Reconfiguration Algorithm 1994 LIBTR Avresky & Al-Tawil, Reconfiguration of Faulty Hypercubes 1994 LIBTR Dolev & Israeli & Moran, Uniform Self-Stabilizing Leader Election Part 2: General Graph Protocol 1994 LIBTR Fernandez & Friesen, Efficient Routing and Broadcasting in Recursive Interconnection Networks 1994 LIBTR Van Driessche & Roose, A Spectral Algorithm for Constrained Graph Partitioning I: The Bisection Case 1994 LIBTR Macarie & Ogihara, Properties of Probabilistic Pushdown Automata 1994 LIBTR Ogihara, On Helping by Parity-like Languages 1994 LIBTR Ogihara, Polynomial-Time Membership Comparable Sets 1994 LIBTR Azar & Broder & Karlin & Upfal, Balanced Allocations 1994 LIBTR Arora & Fagin, On Winning Strategies in Ehrenfeucht-Fraisse Games 1994 LIBTR Upfal, On the Theory of Interconnection Networks for Parallel Computers 1994 LIBTR Halpern & Moses & Vardi, Algorithmic Knowledge 1994 LIBTR Friedman & Halpern, A Knowledge-based Framework for Belief Change Part I: Foundations 1994 LIBTR Chaitin, The Berry Paradox 1994 LIBTR Friedman & Halpern, Conditional Logic of Belief Change 1994 LIBTR Grove & Halpern & Koller, Random Worlds and Maximum Entropy 1994 LIBTR Ram & Jones, Foundations of Foundations of Artificial Intelligence 1994 LIBTR Najork & Brown, A Library for Visualizing Combinatorial Structures 1994 LIBTR Lamport, TLA in Pictures 1994 LIBTR Szwarcfiter, Recognizing Clique-Helly Graphs 1994 LIBTR Flores & Ordaz, On the Erdos-Ginzberg-Ziv Theorem 1994 LIBTR Shahrokhi & Szekely & Sykora & Vrto, Book Embeddings and Crossing Numbers 1994 LIBTR Cook & Kay & Ryan & Thomas, A Toolkit for Appraising the Long Term Usability of a Text Editor 1994 LIBTR Biddle & Tempero, Teaching C++ Experience at Victoria University of Wellington 1994 LIBTR Main, Analog Solution of NP-hard Problems 1994 LIBTR Baillie & McBryan, Computer Science Aspects of Grand Challenge Computing 1994 LIBTR Abuaiadh & Kingston, Are Fibonacci Heaps Optimal? 1994 LIBTR de Rijke, A Lindstrom Theorem for Modal Logic 1994 LIBTR Dinesh, A Trying C++ Experience (Why Compare Dropped C++) 1994 LIBTR Ehrenburg & van Maanen, A Finite Automaton Learning System Using Genetic Programming 1994 LIBTR Pellenkoft & Galindo-Legaria & Kersten, The Impact of Catalogs and Join Algorithms on Probabilistic Query Optimization 1994 LIBTR Brands, Off-line Cash Transfer by Smart Cards 1994 LIBTR Berman, A New Data Structure for Fast Approximate Matching 1994 LIBTR Bampis & Manoussakis & Milis, An RNC Algorithm for the Alternating Hamiltonian Cycle Problem in 2-Edge-Colored Complete Graphs 1994 LIBTR Zimand, Large Sets in AC^0: A Kolmogorov Complexity Related Property and Some Applications 1994 LIBTR Zimand, On the Size of Sets with Weak Membership Properties 1994 LIBTR Hemaspaandra & Ogihara, Universally Serializable Computation 1994 LIBTR Hemaspaandra & Vollmer, The Satanic Notations: Counting Classes beyond #P and Other Definitional Adventures 1994 LIBTR Hunt & Michael & Parthasarathy & Scott, An Efficient Algorithm for Concurrent Priority Queue Heaps 1994 LIBTR Hemaspaandra & Jiang, Logspace Reducibility and Self-reducibility: Models and Equivalences 1994 LIBTR Hemaspaandra, Teaching Computational Complexity: Resources to Treasure 1994 LIBTR Zimand, Martin-Lof Tests Can Help Too 1994 LIBTR Jiang & Sefieras & Vitanyi, Two Heads are Better than Two Tapes 1994 LIBTR Antoshenkov & Lomet & Murray, Order Preserving Key Compression 1994 LIBTR Fredman & Khachiyan, On the Complexity of Dualization of Monotone Disjunctive Normal Forms 1994 LIBTR Khachiyan, On the Complexity of Approximating Extremal Determinants in Matrices 1994 LIBTR Groote & Korver, A Correctness Proof of the Bakery Protocol in muCRL 1994 LIBTR Conway & Davison & Lentin, The Style: A Guide to Writing Better C Programs 1994 LIBTR Lamport, Processes are in the Eye of the Beholder 1994 LIBTR Matheson & Tarjan, Dominating Sets in Planar Graphs 1994 LIBTR Cole & Klein & Tarjan, Linear-Work Parallel Algorithm for Finding Minimum Spanning Trees 1994 LIBTR Petrakis & Faloutsos, Similarity Searching in Large Image Databases 1994 LIBTR Vishkin, Project for Developing Computer Science Agenda(s) for High-Performance Computing: An Organizer's Summary 1994 LIBTR Kelly & Pugh & Rosser, Code Generation for Multiple Mappings 1994 LIBTR Hingston & Lees, Sequential Analysis with Probabilistic Finite State Automata 1994 LIBTR Coppersmith, An Approximate Fourier Transform Useful in Quantum Factoring 1994 LIBTR Shub & Smale, On the Intractability of Hilbert's Nullstellensatz and an Algebraic Version of NP != P? 1994 LIBTR Bellare & Kilian & Rogaway, The Security of Cipher Block Chaining 1994 LIBTR Bellare & Sadan, Improved Non-approximability Results 1994 LIBTR Fekete & Pulleyblank, Backward Error Analysis for the Traveling Salesman Problem: Generalized Convexity 1994 LIBTR Dolev & Reischuk & Strong, Observable Clock Synchronization (extended abstract) 1994 LIBTR Kojima & Megiddo & Mizuno & Shindoh, Horizontal and Vertical Decomposition in Interior Point Methods for Linear Programs 1994 LIBTR Fagin, Comparing the Power of Monadic NP Games 1994 LIBTR Halpern, A Theory of Knowledge and Ignorance for Many Agents 1994 LIBTR Halpern, The Complexity of Modal Logic with a Bounded Number of Primitive Propositions 1994 LIBTR Ding & Ho & Tsay, Matrix Transpose on Meshes with Wormhole and XY Routing 1994 LIBTR Halpern, Should Knowledge Imply Belief? 1994 LIBTR Halpern & Lakemeyer, Levesque's Axiomatization of Only Knowing is Incomplete 1994 LIBTR Bacchus & Grove & Halpern & Koller, Generating New Beliefs from Old 1994 LIBTR Friedman & Halpern, A Knowledge-based Framework for Belief Change, Part II: Revision and Update 1994 LIBTR Ajtai & Komlos & Szemeredi, On a Conjecture of Loebl 1994 LIBTR Alpern & Carter, The Myth of Scalable High Performance 1994 LIBTR Chaitin, The Limits of Mathematics III 1994 LIBTR Raghavan, Randomized Approximation Algorithms in Combinatorial Optimization 1994 LIBTR Hariharan & Jutla, Pattern Matching in Ziv-Lempel Compressed Strings 1994 LIBTR Chaitin, The Limits of Mathematics (extended abstract) 1994 LIBTR Aggarwal & Bar-Noy & Khuller & Kravets & Schieber, Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality 1994 LIBTR Li & Tian, Degree Sums, Claws and Hamiltonicity 1994 LIBTR Romanik & Vitter, Using Vapnik-Chervonenkis Dimension to Analyze the Testing Complexity of Program Segments 1994 LIBTR Pippenger, Topological Aspects of Regular Languages 1994 LIBTR Brown & Hershberger, The Third Annual Video Review of Computational Geometry 1994 LIBTR Djelloul & Favaron, On Distances and Eccentricities in the Shuffle-Exchange Network 1994 LIBTR Heydemann & Sotteau, A Note on Recursive Properties of de Bruijn, Kautz and FFT Digraphs 1994 LIBTR Heydemann & Opatrny & Sotteau, Embeddings of Complete Binary Trees into Star Graphs with Congestion 1 1994 LIBTR Hifi & Zissimopoulos, A Recursive Exact Algorithm for Weighted Two-dimensional Knapsack 1994 LIBTR Guattery & Miller, On the Performance of Spectral Graph Partitioning Methods 1994 LIBTR Canteaut & Chabanne, A Further Improvement of the Work Factor in an Attempt at Breaking McEliece's Cryptosystem 1994 LIBTR Andonov & Rajopadhye, An Optimal Algo-Tech-Cuit for the Knapsack Problem 1994 LIBTR Regnier, Average Performance of Morris-Pratt-like Algorithms 1994 LIBTR de Berg & Guibas & Halperin & Overmars & Schwarzkopf & Sharir & Teillaud, Reaching a Goal with Directional Uncertainty 1994 LIBTR Jacquet & Szpankowski, Asymptotic Behavior of the Lempel-Ziv Parsing Scheme and Digital Search Trees 1994 LIBTR Luczak & Szpankowski, A Lossy Data Compression Based on String Matching: Preliminary Analysis and Suboptimal Algorithms 1994 LIBTR Fromentin & Raynal, When All the Observers of a Distributed Computation Do Agree 1994 LIBTR Jones, Euclidean Communication Spanning Trees 1994 LIBTR Jerrum, A Very Simple Algorithm for Estimating the Number of k-colourings of a Low Degree Graph 1994 LIBTR Hirshfeld & Jerrum & Moller, A Polynomial-Time Algorithm for Deciding Bisimulation Equivalence of Normed Basic Parallel Processes 1994 LIBTR Hirshfeld & Jerrum & Moller, A Polynomial Time Algorithm for Deciding Bisimilarity of Normed Context-free Processes 1994 LIBTR Lynch & Vaandrager, Action Transducers and Timed Automata 1994 LIBTR Apt & van Emde Boas & Welling, The STO-Problem is NP-hard 1994 LIBTR Kirkpatrick & Snoeyink, Computing Common Tangents without a Separating Line 1994 LIBTR Agarwal & Swami, A One-Pass Space-Efficient Algorithm for Finding Quantiles 1994 LIBTR Knudsen, Practically Secure Feistel Ciphers 1994 LIBTR Nyberg & Knudsen, Provable Security against a Differential Attack 1994 LIBTR Abolfazlian, What's Connectionism Got To Do With It?! 1994 LIBTR Jensen, An Introduction to the Theoretical Aspects of Coloured Petri Nets 1994 LIBTR Chen, Witness Hiding Proofs and Applications 1994 LIBTR Mayoh, Patterns, Graphs and DNA 1994 LIBTR Chen & Pedersen, Group Signatures: Unconditional Security for Members 1994 LIBTR Bader & Ja'Ja', Parallel Algorithms for Image Histogramming and Connected Components with an Experimental Study 1994 LIBTR Arora, Probabilistic Checking of Proofs and Hardness of Approximation Problems 1994 LIBTR Dobkin & Gunopulos, The Maximum Discrepancy of Simple Geometric Ranges 1994 LIBTR Dobkin & Gunopulos, Concept Learning with Simple Geometric Hypotheses 1994 LIBTR Padhye, Use of Tree-based Algorithms for Internal Sorting 1994 LIBTR Webb, Generality is More Significant than Complexity: Toward an Alternative to Occam's Razor 1994 LIBTR Zhou, A Generic Recursive Algorithm for Fault-tolerant Computing 1994 LIBTR Freivalds & Karpinski, Lower Space Bounds for Randomized Computation 1994 LIBTR Dahlhaus & Karpinski, On the Computational Complexity of Matching on Chordal and Strongly Chordal Graphs 1994 LIBTR von zur Gathen & Karpinski & Shparlinski, Counting Curves and their Projections 1994 LIBTR Berman & Fobmeier & Karpinski & Kaufmann & Zelikovsky, Approaching the 5/4-Approximation for Rectilinear Steiner Trees 1994 LIBTR Albanese & Blomer & Edmonds & Luby, Priority Encoding Transmission 1994 LIBTR Ostrovsky & Wilkerson, Faster Computation on Directed Networks of Automata 1994 LIBTR Schwarz & Teich & Welzl & Evans, On Finding a Minimal Enclosing Parallelogram 1994 LIBTR Saint John, Output Sets, Halting Sets and an Arithmetical Hierarchy for Ordered Subrings of the Real Numbers under Blum/Shub/Smale Computation 1994 LIBTR Goldmann & Karpinski, Simulating Threshold Circuits by Majority Circuits (extended version) 1994 LIBTR Karpinski & Shparlinski, Efficient Approximation Algorithms for Sparse Polynomials over Finite Fields 1994 LIBTR Goldreich & Ostrovsky, Computational Complexity and Knowledge Complexity 1994 LIBTR Schnorr & Vaudenay, Black Box Cryptanalysis of Hash Networks Based on Multipermutations 1994 LIBTR Rossner & Schnorr, A Stable Integer Relation Algorithm 1994 LIBTR Koller & Megiddo & von Stengel, Efficient Computation of Equilibria for Extensive Two-Person Games 1994 LIBTR Stockmeyer, Parallelism in Parity-Declustered Layouts for Disk Arrays 1994 LIBTR Fraenkel & Simpson, How Many Squares Must a Binary Sequence Contain? 1994 LIBTR Mansour & Peleg, An Approximation Algorithm for Minimum-Cost Network Design 1994 LIBTR Gal-Ezer & Beeri & Harel & Yehudai, A High-School Program in Computer Science 1994 LIBTR Harel & Gery & Politi, Object-Oriented Modeling with State Charts 1994 LIBTR Fraenkel, Error Correcting Codes and Combinatorial Games 1994 LIBTR Feige & Goldwasser, The Weizmann Workshop on Probabilistic Proof Systems 1994 LIBTR Fraenkel, Scenic Trails Ascending from Sea Level Nim to Alpine Chess 1994 LIBTR Harel & Singerman, More on Nonregular PDL: Expressive Power, Finite Models, Fibonacci Programs 1994 LIBTR Naor & Shamir, Visual Cryptography 1994 LIBTR Feige, Observations on Hot Potato Routing 1994 LIBTR Alon & Naor, Derandomization, Witnesses for Boolean Matrix Multiplication and Construction of Perfect Hash Functions 1994 LIBTR Grossman & Wool, Computational Experience with Approximation Algorithms for the Set Covering Problem 1994 LIBTR Hilke & Lohn & Reggia & Navarro, A Modified Cellular Automata Model of Nucleotide Interactions and DNA Replication 1994 LIBTR Khuller & Raghavachari & Rosenfeld, Localization in Graphs 1994 LIBTR Kavraki & Latombe & Motwani & Raghavan, Randomized Query Processing in Robot Motion Planning 1994 LIBTR Tunkelang, A Practical Approach to Drawing Undirected Graphs 1994 LIBTR Cramer & Damgard & Schoenmakers, Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols 1994 LIBTR Maelbrancke & Olivie, Spatial Data Structures 1994 LIBTR Burrows & Wheeler, A Block-Sorting Lossless Data Compression Algorithm 1994 LIBTR Mansour & Nisan & Vishkin, Trade-offs between Communication Throughput and Parallel Time 1994 LIBTR Ja'Ja' & Ryu, An Optimal Randomized Parallel Algorithm for the Single Function Coarsest Partition Problem 1994 LIBTR Ja'Ja' & Ryu, Randomized Parallel Algorithms on the Block Distributed Memory Model 1994 LIBTR Wuthrich, Line Segment Rasterization in n-Dimensional Space 1994 LIBTR Fokkink, A Complete Equational Axiomatisation for Prefix Iteration 1994 LIBTR Jiang & Seiferas & Vitanyi, Two Heads are Better than Two Tapes 1994 LIBTR Papatriantafilou & Tsigas, Self-stabilizing Wait-free Clock Synchronization 1994 LIBTR Panconesi & Papatriantafilou & Tsigas & Vitanyi, Randomized Wait-free Naming 1994 LIBTR Fredman & Rauch, Lower Bounds for Dynamic Connectivity Problems in Graphs 1994 LIBTR Kozen, Logical Aspects of Set Constraints 1994 LIBTR Hadzilacos & Toueg, A Modular Approach to Fault-Tolerant Broadcasts and Related Problems 1994 LIBTR Chandra & Hadzilacos & Toueg, The Weakest Failure Detector for Solving Consensus 1994 LIBTR Pearson, A Polynomial-Time Algorithm for the Change-making Problem 1994 LIBTR Efremidis, On Program Transformations 1994 LIBTR Sgall, On-line Scheduling on Parallel Machines 1994 LIBTR Grigoriadis & Khachiyan, Coordination Complexity of Parallel Price-directive Decompostition 1994 LIBTR Grigoriadis & Khachiyan, A Sublinear-Time Randomized Approximation Algorithm for Matrix Games 1994 LIBTR Abadi & Needham, Prudent Engineering Practice for Cryptographic Protocols 1994 LIBTR Raman, A Simpler Analysis of Algorithm 65 (find) 1994 LIBTR Cain & Sherman, How to Break Gifford's Cipher 1994 LIBTR Dietz & Raman, Very Fast Optimal Parallel Algorithms for Heap Construction 1994 LIBTR Kellu & Pugh & Rosser, Code Generation for Multiple Mappings 1994 LIBTR Papatriantafilou & Tsigas, How a Rainbow Coloring Function Can Simulate Wait-free Handshaking 1994 LIBTR Tip, A Survey of Program Slicing Techniques 1994 LIBTR Franklin & Yung, Privacy from Partial Broadcast 1994 LIBTR Walters, A Complete Term Rewriting System for Decimal Integer Arithmetic 1994 LIBTR Barendregt & Wupper & Mulder, Computable Processes 1994 LIBTR van Rij, Antialiasing and Shading, an Implementation 1994 LIBTR Jiang & Wang, An Approximation Scheme for Some Steiner Tree Problems in the Plane 1994 LIBTR Deogun & Kratsch & Steiner, 1-Tough Cocomparability Graphs are Hamiltonian 1994 LIBTR Janicki, On Non-numerical Ranking 1994 LIBTR Tucker & Zucker, Computable Functions on Stream Algebras 1994 LIBTR Kreinovich, Checking Identities is Intractable (NP-Hard), So Human Provers Will Be Always Needed 1994 LIBTR Hayase & Takenaga & Yajima, Computational Power of Cube-Connected Associative Processor Arrays under Restrictions on Communication 1994 LIBTR Shouichi & Katsuo, Nonlinearity Criteria of Boolean Functions 1994 LIBTR Hosaka & Takenaga & Yajima, Size of Ordered Binary Decision Diagrams Representing Threshold Functions 1994 LIBTR Bruck & Ho & Kipnis & Weathersby, Efficient Algorithms for All-to-All Communications in Multi-Port Message-Passing Systems 1994 LIBTR Blaum & Bruck & Vardy, Binary Codes with Large Symbols 1994 LIBTR Biela, Patenting Software Inventions Involving Mathematical Algorithms 1994 LIBTR Franke & Hochschild & Pattnaik & Snir, An Efficient Implementation of MPI 1994 LIBTR Karlin & Raghavan, Random Walks and Undirected Graph Connectivity: A Survey 1994 LIBTR Choy & Fagin & Stockmeyer, Efficiently Extendible Mappings for Balanced Data Distribution 1994 LIBTR Dyer, A Parallel Algorithm for Linear Programming in Fixed Dimension 1994 LIBTR Ho & Kao, Efficient Submesh Permutations in Wormhole-Routed Meshes 1994 LIBTR Rossner & Schnorr, A Stable Integer Relation Algorithm 1994 LIBTR Vaudenay & Schnorr, Black Box Cryptanalysis of Hash Networks Based on Multipermutations 1994 LIBTR Karp & Zhang, Finite Branching Processes AND/OR Tree Evaluation 1994 LIBTR Carter & Ferrante & Hummel, Hierarchical Tiling: A Framework for Multi-level Parallelism and Locality 1994 LIBTR Tamaki, Construction of the Mesh and the Torus Tolerating a Large Number of Faults 1994 LIBTR Chaitin, The Limits of Mathematics (in C) 1994 LIBTR Fagin & Halpern & Moses & Vardi, An Operational Semantics for Knowledge Bases 1994 LIBTR Dobkin & Gunopulos, Computing the Rectangle Discrepancy 1994 LIBTR Matheson & Tarjan, Critical Analysis of Multigrid Methods on Massively Parallel Computers 1994 LIBTR Juutistenaho, Linear Time Algorithm for Layout of Acyclic Digraphs with Variable-sized Vertices 1994 LIBTR Juutistenaho, Linear Time Algorithms for Layout of Generalized Trees 1994 LIBTR Condon & Hellerstein & Pottle & Wigderson, On the Power of Finite Automata with Both Nondeterministic and Probabilistic States 1994 LIBTR Lewandowski & Condon, Experiments with Parallel Graph Coloring Heuristics 1994 LIBTR Lewandowski & Condon & Bach, Asynchronous Analysis of Parallel Dynamic Progamming Algorithms 1994 LIBTR Goldreich & Wigderson, Tiny Families of Functions with Random Properties: A Quality-Size Trade-off for Hashing 1994 LIBTR Fraenkel, Even Kernels 1994 LIBTR Upfal, On the Theory of Interconnection Networks for Parallel Computers 1994 LIBTR Peleg & Wool, Crumbling Walls: A Class of High Availability Quorum Systems 1994 LIBTR Harel, Towards a Theory of Recursive Structures 1994 LIBTR Globerman & Harel, Complexity Results for Multi-Pebble Automata and their Logics 1994 LIBTR Melis, Representing and Reformulating Diagonalization Methods 1994 LIBTR Awerbuch & Azar & Blum & Vempala, Improved Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen 1994 LIBTR Hallgren, Linear Congruential Generators over Elliptic Curves 1994 LIBTR Brown, The 1993 SRC Algorithm Animation Festival 1994 LIBTR Hemaspaandra & Rothe, Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets 1994 LIBTR Rao, On P-Selectivity and Closeness 1994 LIBTR Zimand, Weighted NP Optimization Problems: Logical Definability and Approximation Properties 1994 LIBTR Hemaspaandra & Zimand, Strong Forms of Balanced Immunity 1994 LIBTR Macarie, On the Structure of Log-Space Probabilistic Complexity Classes 1994 LIBTR Hemaspaandra & Ogihara, Universally Serializable Computation 1994 LIBTR Ogihara, On Serializable Languages 1994 LIBTR Fischer & Hemaspaandra & Torenvliet, Witness-Isomorphic Reductions and the Local Search Problem 1994 LIBTR Hemaspaandra & Naik & Ogiwara & Selman, Computing Solutions Uniquely Collapses the Polynomial Hierarchy 1994 LIBTR Macarie, Properties of Multihead Two-way Probabilistic Automata 1994 LIBTR Calude & Zimand, Effective Category and Measure in Abstract Complexity Theory 1994 LIBTR Hemaspaandra & Torenvliet, Optimal Advice 1994 LIBTR Denny-Brown & Han & Hemaspaandra & Torenvliet, Semi-membership Algorithms: Some Recent Advances 1994 LIBTR Hemaspaandra & Hoene & Ogihara, Reducibility Classes of P-Selective Sets 1994 LIBTR Bshouty & Jackson, Learning DNF over the Uniform Distribution Using a Quantum Example Oracle 1994 LIBTR Micali, A Secure and Efficient Digital Signature Algorithm 1994 LIBTR Cherkassky & Goldberg, On Implementing Push-Relabel Method for the Maximum Flow Problem 1994 LIBTR Fredman & Khachiyan, On the Complexity of Dualization of Monotone Disjunctive Normal Forms 1994 LIBTR Minsky, A Problem with Long-term Computing Processes, and What Can Be Done About It 1994 LIBTR Khachiyan, On the Complexity of Approximating Extremal Determinants in Matrices 1994 LIBTR Landauer, Is Quantum Mechanics Useful? 1994 LIBTR Karlin & Nelson & Tamaki, On the Fault Tolerance of the Butterfly 1994 LIBTR Kutten & Peleg, Faster Distributed MST Algorithm 1994 LIBTR Jaffar & Maher, Constraint Logic Programming: A Survey 1994 LIBTR Raghavan & Upfal, Efficient Routing in All-Optical Networks 1994 LIBTR Blum & Chalasani & Coppersmith & Pulleyblank & Raghavan & Sudan, The Minimum Latency Problem 1994 LIBTR Rabenhorst, Interactive Exploration of Multidimensional Data 1994 LIBTR Coppersmith, Attack on the Cryptographic Scheme NIKS-TAS 1994 LIBTR Chen & Purtilo, A Visualization Tool for C Programs 1994 LIBTR Cain & Sherman, How to Break Gifford's Cipher 1994 LIBTR Heyman & O'Leary, What is Fundamental for Markov Chains: First Passage Times, Fundamental Matrices, and Group Generalized Inverses 1994 LIBTR Perlis, Logic for a Lifetime 1994 LIBTR Stewart, Gauss, Statistics, and Gaussian Elimination 1994 LIBTR Chatterjee & Gilbert & Schreiber & Sheffler, Array Distribution in Data-Parallel Programs 1994 LIBTR Sheffler & Schreiber & Gilbert & Chatterjee, Aligning Parallel Arrays to Reduce Communication 1994 LIBTR Goldberg & Kennedy, Global Price Updates Help 1994 LIBTR Muchnik & Vereshchagin, A General Method to Construct Oracles Realizing Given Relationships between Complexity Classes 1994 LIBTR Vereshchagin, NP-Sets are Co-NP-Immune Relative to a Random Oracle 1994 LIBTR Rothe & Voss & Susse & Rothe, A General Method to Determine Invariants 1994 LIBTR Li, Compiler Optimizations for Cache Locality and Coherence 1994 LIBTR Macarie, Decreasing the Bandwidth of a Transition Matrix 1994 LIBTR Fix & Schneider, Reasoning about Programs by Exploiting the Environment 1994 LIBTR Kozen & Landau & Zippel, Decomposition of Algebraic Functions 1994 LIBTR Gries & Schneider, A New Approach to Teaching Mathematics 1994 LIBTR Rauch, Improved Data Structures for Fully Dynamic Biconnectivity 1994 LIBTR Sabel & Marzullo, Simulating Fail-Stop in Asynchronous Distributed Systems 1994 LIBTR Gries & Schneider, Teaching Math More Effectively, through the Design of Calculational Proofs 1994 LIBTR Reif, O(log^2 n) Time Efficient Parallel Factorization of Dense, Sparse Separable, and Banded Matrices 1994 LIBTR Kreinovich & Lakeyev & Noskov, Approximate Linear Algebra is Intractable 1994 LIBTR Koudas & Faloutsos & Kamel, Declustering R-Trees on Multi-Computer Architectures 1994 LIBTR Landau & Vishkin, Pattern Matching in a Digitized Image 1994 LIBTR Nickerson, Skip List Data Structures for Multidimensional Data 1994 LIBTR Wahbe & Lucco & Graham, Adaptable Binary Programs 1994 LIBTR Clarke & Zhao, Combining Symbolic Computation and Theorem Proving: Some Problems of Ramanujan 1994 LIBTR Perlis, Consciousness and Complexity: The Cognitive Quest 1994 LIBTR Pugh, Counting Solutions to Presburger Formulas: How and Why 1994 LIBTR Khuller & Matherly, Practical Algorithms for Finding Biconnected Subgraphs 1994 LIBTR Maslov & Pugh, Simplifying Polynomial Constraints over Integers to Make Dependence Analysis More Precise 1994 LIBTR Sahinalp & Vishkin, Symmetry Breaking for Suffix Tree Construction 1994 LIBTR Ja'Ja' & Ryu, The Block Distributed Memory Model 1994 LIBTR Khuller & Raghavachari & Young, Low Degree Spanning Trees of Small Weight 1994 LIBTR Liu & Miller, Generalized Fair Reachability Analysis for Cyclic Protocols: Part 1 1994 LIBTR Rao & Rothe & Watanabe, Upward Separation for FewP and Related Classes 1994 LIBTR Macarie, Properties of Multihead Two-Way Probabilistic Finite Automata 1994 LIBTR Macarie, Connections among Space-Bounded and Multihead Probabilistic Automata 1994 LIBTR Rothe, A Promise Class at Least as Hard as the Polynomial Hierarchy 1994 LIBTR Hemaspaandra & Jiang, P-Selectivity: Intersections and Indices 1994 LIBTR Hemaspaandra & Rothe, Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets 1994 LIBTR Giles & Goudreau, Routing in Optical Multistage Interconnection Networks: A Neural Network Solution 1994 LIBTR Han & Hemaspaandra, Pseudorandom Generators and the Frequency of Simplicity 1994 LIBTR Han, On Accessing and Hiding Information (Ph.D. Thesis) 1994 LIBTR Vereshchagin, Lower Bounds for Perceptrons Solving Some Separation Problems and Oracle Separation of AM from PP 1993 LIBTR Phillips, Theory and Applications of Online Algorithms 1993 LIBTR Gal & Szegedy, Fault Tolerant Circuits and Probabilistically Checkable Proofs 1993 LIBTR Babai, Transparent Proofs and Limits to Approximation 1993 LIBTR Helary & Mostefaoui, A O(log^2 n) Fault-Tolerant Distributed Mutual Exclusion Algorithm Based on Open-Cube Structure 1993 LIBTR Reich & Weiser, Libraries are More than Information: Situational Aspects of Electronic Libraries 1993 LIBTR Goldreich, Finding the Shortest Move-Sequence in the Graph-generalized 15-Puzzle is NP-Hard 1993 LIBTR Baram & Barniv, Obstacle Detection by Recognizing Binary Expansion Patterns 1993 LIBTR Baram, Classification of Binary and Real Bounded Data by Learning Sparse Representations 1993 LIBTR Chu, There Exists a Problem whose Computational Complexity is Any Given Function of the Information Complexity 1993 LIBTR Bhatt & Bilardi & Pucci & Ranade & Rosenburg & Schwabe, On Bufferless Routing of Variable Length Messages in Leveled Networks 1993 LIBTR Wu & Manber, A Fast Algorithm for Multi-pattern Searching 1993 LIBTR Wise, Running Karp-Rabin Matching and Greedy String Tiling 1993 LIBTR Dahlhaus, A Simple Efficient Parallel Algorithm to Recognize Chordal Graphs as Interval Graphs 1993 LIBTR Symvonis, Optimal Stable Merging 1993 LIBTR Mark, Parallel Computation of Sylow Subgroups in Solvable Groups 1993 LIBTR Boissonnat & Dobrindt, On-line Randomized Contruction of the Upper Envelope of Triangles and Surface Patches in R^3 1993 LIBTR Thirion & Gourdon, The Marching Lines Algorithm: New Results and Proofs 1993 LIBTR Devillers & Golin, Dog Bites Postman: Point Location in the Moving Voronoi Diagram and Related Problems 1993 LIBTR Akl & Stojmenovic, Multiple Criteria BSR: An Implementation and Applications to Computational Geometry Problems 1993 LIBTR Qiu & Akl, Properties of the Breadth First Spanning Tree of the Star Graph 1993 LIBTR Fragopoulou & Akl, Optimal Communication Algorithms on Star Graphs Using Spanning Tree Constructions 1993 LIBTR Howard & Vitter, Fast Progressive Lossless Image Compression 1993 LIBTR De Prisco & De Santis, New Lower Bounds on the Cost of Binary Search Trees 1993 LIBTR De Prisco & De Santis, Catastrophic Faults in Reconfigurable Linear Arrays 1993 LIBTR Nuutila & Soisalon-Soininen, Efficient Transitive Closure Computation 1993 LIBTR Nuutila & Soisalon-Soininen, On Finding the Strong Components in a Directed Graph 1993 LIBTR Nuutila & Soisalon-Soininen, A Single-Pass Algorithm for Transitive Closure 1993 LIBTR Malmi, Efficient Rebalancing of Tree-type Main Memory Dictionaries 1993 LIBTR Fisher, Hierarchical Matching Beats the Non-wildcard and Interpretation Tree Model Matching Algorithm 1993 LIBTR Ron & Singer & Tishby, The Power of Amnesia 1993 LIBTR Spencer, Time-Work Tradeoffs for Parallel Algorithms 1993 LIBTR Spencer, Almost Optimally Efficient Parallel Ear Decomposition 1993 LIBTR McMillin & Lutfiyya & Tsai & Liu, Parallel Algorithm Fundamentals and Analysis 1993 LIBTR Cole, Parallel Programming, List Homomorphisms and the Maximum Segment Sum Problem 1993 LIBTR Duggan, Literate Programming: A Review 1993 LIBTR Hyvonen & Malmi, TRAKLA: A System for Teaching Algorithms Using Email and a Graphical Editor 1993 LIBTR Pollari-Malmi & Soininen & Ylonen, Batch Updates and Concurrency in B-trees 1993 LIBTR Tempero & Ladner, Recoverable Sequence Transmission Protocols 1993 LIBTR Ramachandran & Yang, An Efficient Parallel Algorithm for the General Planar Monotone Circuit Value Problem 1993 LIBTR Suel, Optimal Deterministic Routing and Sorting on Mesh-Connected Arrays of Processors 1993 LIBTR Barnett & Payne & van de Geijn & Watts, Broadcasting on Meshes with Worm-hole Routing 1993 LIBTR Pelletier & Elio, Some Truths about Non-monotonic Reasoning 1993 LIBTR Boissonnat & Cerezo & Devillers & Duquesne & Yvinec, An Algorithm for Constucting the Convex Hull of a Set of Spheres in Dimension d 1993 LIBTR Bonnans & Gonzaga, Convergence of Interior Point Algorithms for the Monotone Linear Complementarity Problem 1993 LIBTR Regnier & Rostami, A Unifying Look at d-dimensional Periodicities and Space Coverings 1993 LIBTR Breu & Kirkpatrick, Unit Disk Graph Recognition is NP-hard 1993 LIBTR Kirkpatrick & Snoeyink, Tentative Prune-and-Search for Computing Fixed-points with Applications to Geometric Computation 1993 LIBTR Pippenger, Analysis of a Recurrence Arising from a Construction for Non-blocking Networks 1993 LIBTR Pippenger, Self-routing Superconcentrators 1993 LIBTR Pippenger, Juggling Networks 1993 LIBTR Flajolet & Sedgewick, The Average Case Analysis of Algorithms: Complex Asymptotics and Generating Functions 1993 LIBTR Assmus & Key, Codes and Finite Geometries 1993 LIBTR Newlands, Laboratory-based Teaching of Data Structures 1993 LIBTR Padhye, Three New Sorting Algorithms Based on a Distribute-Collect Paradigm 1993 LIBTR Shipman & Marshall, Formality Considered Harmful: Experiences, Emerging Themes, and Directions 1993 LIBTR Symvonis, Routing on Trees 1993 LIBTR Abuaiadh & Kingston, An Efficient Algorithm for the Shortest Path Problem 1993 LIBTR Aarts, Proving Theorems of the Lambek Calculus of Order 2 in Polynomial Time 1993 LIBTR Bala & Kipnis & Rudolph & Snir, Designing Efficient, Scalable, and Portable Collective Communication Libraries 1993 LIBTR Dershowitz, A Taste of Rewrite Systems 1993 LIBTR Linial, Local-Global Phenomena in Graphs 1993 LIBTR Dolev & Malki & Yarom, Warm Backup Using Snooping 1993 LIBTR Tarhio, A Boyer-Moore Approach for Two-dimensional Matching 1993 LIBTR Bernstein & Rajagopalan, The Roommates Problem (or Why a Bird in the Hand is Worth Two in the Bush) 1993 LIBTR Aspnes & Herlihy & Shavit, Counting Networks 1993 LIBTR Ravi, Steiner Trees and Beyond: Approximation Algorithms for Network Design 1993 LIBTR Kanellakis & Ramaswamy & Vengroff & Vitter, Indexing for Data Models with Constraints and Classes 1993 LIBTR Howard, The Design and Analysis of Efficient Lossless Data Compression Systems 1993 LIBTR de la Torre & Greenlaw & Schaffer, A Note on Deogun and Peng's Edge Ranking Algorithm 1993 LIBTR Greenlaw, Subtree Isomorphism is in DSPACE(log n) for Restricted Trees 1993 LIBTR Greenlaw & Machta, On the Parallel Complexity of Invasion Percolation 1993 LIBTR Fagin, Quantitative Modal Logic 1993 LIBTR Bruck & Cypher & Ho, Fault-tolerant Meshes with Small Degree 1993 LIBTR Buss & Tompa, Lower Bounds on Universal Traversal Sequences Based on Chains of Length Five 1993 LIBTR Breslauer, Saving Comparisons in the Crochemore-Perrin String Matching Algorithm 1993 LIBTR Apostolico & Breslauer & Galil, Parallel Detection of all Palindromes in a String 1993 LIBTR Salvy, Algorithms Seminar 1992-1993 1993 LIBTR Harel & Sardas, Randomized Graph Drawing with Heavy-Duty Preprocessing 1993 LIBTR Creignou & Hermann, On #P Completeness of Some Counting Problems 1993 LIBTR Vitter & Shriver, Algorithms for Parallel Memory II: Hierarchical Multilevel Memories 1993 LIBTR Vitter & Shriver, Algorithms for Parallel Memeory I: Two-level Memories 1993 LIBTR Subramanian & Tamassia & Vitter, An Efficient Parallel Algorithm for Shortest Paths in Planar Layered Digraphs 1993 LIBTR Helary & Mostefaoui, A O[log_2 n] Fault-tolerant Distributed Mutual Exclusion Algorithm Based on Open-Cube Structure 1993 LIBTR White & Gillet, A Simulated Annealing/Tabu Search Algorithm for the Vehicle Routing Problem 1993 LIBTR Hwu & Ho, The Interpolating Random Spline Cryptosystem and the Chaotic-Map Public Key Cryptosystem 1993 LIBTR Mayer & Ercal, Parallel Genetic Algorithms for the DAG Vertex Splitting Problem 1993 LIBTR Sauder & Ho, An Analysis of Modern Cryptosystems 1993 LIBTR Mayer, Parallel Genetic Algorithm for the DAG Vertex Splitting Problem 1993 LIBTR Jenness & Gillett, The Difficulty of Approximating the Chromatic Number for Random Composite Graphs 1993 LIBTR Liu & McMillin, Fault-tolerant Ring Embeddings in Hypercubes -- A Reconfigurable Approach 1993 LIBTR Boissonnat & Dobrindt, On-line Randomized Construction of the Upper Envelope of Triangles and Surface Patches in R^3 1993 LIBTR Flajolet & Lafforgue, Search Costs in Quadtrees and Singularity Perturbation Asymptotics 1993 LIBTR Gabow, Centroids, Representations and Submodular Flows 1993 LIBTR Asanovic & Beck & Feldman & Morgan & Wawrzynek, Development of a Connectionist Network Supercomputer 1993 LIBTR Lutz & Martin, The Global Power of Additional Queries to Random Oracles 1993 LIBTR Sarnath, Lower Bounds for Padded Sorting and Approximate Counting 1993 LIBTR Fenner & Homer & Ogiwara & Selman, On Using Oracles that Compute Values 1993 LIBTR Regan, Efficient Reductions from NP to Parity Using Error-Correcting Codes (preliminary version) 1993 LIBTR Sarnath, A Randomized Parallel Algorithm for dfa-Minimization 1993 LIBTR Hemaspaandra & Naik & Ogiwara & Selman, P-Selective Sets, and Reducing Search to Decision vs. Self-reducibility 1993 LIBTR Miller, The Status of Parallel Processing Education: 1993 1993 LIBTR Aizenstein, On the Learnability of Disjunctive Normal Form Formulas and Decision Trees 1993 LIBTR Gupta, On Isolating on Odd Number of Elements and its Applications in Complexity Theory 1993 LIBTR Schwiebert & Jayasimha, Optimal Fully Adaptive Wormhole Routing for Meshes 1993 LIBTR Kamal & Singhal, On Formal Verification of Distributed Mutual Exclusion Algorithms 1993 LIBTR Brzezinski & Helary & Raynal, Distributed Termination Detection: General Model and Algorithms 1993 LIBTR Atallah & Fabri, On the Multisearching Problem for Hypercubes 1993 LIBTR Jacquet & Rais & Szpankowski, Compact Suffix Trees Resemble Patricia Tries: Limiting Distribution of Depth 1993 LIBTR Pan, Simple Multivariate Polynomial Multiplication 1993 LIBTR Luby & Naor & Naor, On Removing Randomness from a Parallel Algorithm for Minimum Cuts 1993 LIBTR Luby & Velickovic, On Deterministic Approximation of DNF 1993 LIBTR Upfal & Feleprin, Randomized Routing with Shorter Paths 1993 LIBTR Chang & Nelson, Optimal Task Scheduling on Distributed Parallel Processors 1993 LIBTR Bruck & Cypher & Ho, Efficient Algorithms for the Index Operation in Message-Passing Systems 1993 LIBTR Mayer & Stockmeyer, The Complexity of PDL with Interleaving 1993 LIBTR Alur & Henzinger & Vardi, Parametric Real-time Reasoning 1993 LIBTR Dyer & Frieze & Jerrum, Approximately Counting Hamilton Cycles in Dense Graphs 1993 LIBTR Jerrum & Sorkin, Simulated Annealing for Graph Bisection 1993 LIBTR Flajolet & Zimmermann & Van Cutsem, A Calculus for the Random Generation of Combinatorial Structures 1993 LIBTR Golin, Maxima in Convex Regions 1993 LIBTR Jacquet & Szpankowski, On the Lempel-Ziv Parsing Algorithm and its Digital Tree Representation 1993 LIBTR Luby & Sinclair & Zuckerman, Optimal Speedup of Las Vegas Algorithms 1993 LIBTR Bernasconi & Codenotti, Sensitivity of Boolean Functions, Abstract Harmonic Analysis, and Circuit Complexity 1993 LIBTR Bshouty & Hancock & Hellerstein & Karpinski, An Algorithm to Learn Read-Once Threshold Formulas, and Some Generic Transformations between Learning Models 1993 LIBTR Karp & Luby & Meyer auf der Heide, Efficient PRAM Simulation on a Distributed Memory Machine 1993 LIBTR Liskiewicz & Reischuk, The Sublogarithmic Space World 1993 LIBTR Reischuk & Schindelhauer, Precise Average Case Complexity Measures 1993 LIBTR Miltersen, Lower Bounds for Union-Split-Find Related Problems on Random Access Machines 1993 LIBTR Koizumi & Maruoka & Paterson, Consistency of Natural Relations on Sets 1993 LIBTR Dancik & Paterson, Upper Bounds for the Expected Length of a Longest Common Subsequence of Two Binary Sequences 1993 LIBTR Hiltgen & Paterson, Pi_k Mass Production and an Optimal Circuit for the Nechiporuk Slice 1993 LIBTR Cole & Hariharan & Paterson & Zwick, Tighter Lower Bounds on the Exact Complexity of String Matching 1993 LIBTR Czumaj & Gibbons, Problems on Pairs of Trees and the Four Colour Problem of Planar Graphs 1993 LIBTR Novak & Gibbons, Superperfect Pairs of Trees in Graphs 1993 LIBTR Beigel & Kummer & Stephan, Approximable Sets 1993 LIBTR Manoussakis & Milis, A Woodall's Type Sufficient Condition for Bipartite Digraphs to be Hamiltonian 1993 LIBTR Al Khowarizmi, Perfect and Locally Perfect Colourings 1993 LIBTR Chou & Manoussakis & Megalakaki & Spyratos & Tuza, Paths through Fixed Vertices in Edge-colored Graphs 1993 LIBTR Fernandez, AC Complement Problems: Satisfiability and Negation Elimination 1993 LIBTR Pruesse, Efficient Generation of Linear Extensions and Other Restricted Permutations 1993 LIBTR Feige & Zuckerman, Derandomized Graphs 1993 LIBTR Gilon & Peleg, Embedding Techniques for Distributed Dictionaries 1993 LIBTR Gilon & Peleg, Compact Deterministic Distributed Dictionaries 1993 LIBTR Moscowitz & Shapiro, On the Structural Simplicity of Machines and Languages 1993 LIBTR Felperin & Raghavan & Upfal, A Theory of Wormhole Routing in Parallel Computers 1993 LIBTR Borodin & Raghavan & Schieber & Upfal, How Much Can Hardware Help Routing? 1993 LIBTR Kortsarz & Peleg, Generating Low-Degree 2-Spanners 1993 LIBTR Feige, A Tight Upper Bound on the Cover Time for Random Walks on Graphs 1993 LIBTR Yackel, Minimum-Perimeter Tiling in Parallel Computation 1993 LIBTR Bjorling-Sachs, Variations on the Art Gallery Theorem 1993 LIBTR Gent & Walsh, Easy Problems are Sometimes Hard 1993 LIBTR Damgard & Knudsen, The Breaking of the AR Hash Function 1993 LIBTR Klarlund & Mukund & Sohoni, Determinizing Asynchronous Automata 1993 LIBTR Nielson & Nielson, Iterative Algorithms for Fixed Point Computation 1993 LIBTR Knudsen, Cryptanalysis of LOKO91 1993 LIBTR Knudsen, Iterative Characteristics of DES and s^2-DES 1993 LIBTR Frandsen & Miltersen & Skyum, Dynamic Word Problems 1993 LIBTR Frandsen & Miltersen & Skyum, The Complexity of Finding Replicas Using Equality Tests 1993 LIBTR Engberg & Winskel, Completeness Results for Linear Logic on Petri Nets 1993 LIBTR Zucker, Normal and Inverted Function Tables 1993 LIBTR Janicki & Koutny, Representations of Discrete Interval Orders and Semi-orders 1993 LIBTR Janicki, Towards a Formal Semantics of Tables 1993 LIBTR Jiang & Vitanyi, Two Heads are Better than Two Tapes 1993 LIBTR Wang & Jiang, On the Complexity of Multiple Sequence Alignment 1993 LIBTR Wang & Jiang, Approximation Algorithms for Tree Alignment with a Given Phylogeny 1993 LIBTR Jiang & Wang & Zhang, Alignment of Trees -- An Alternative to Tree Edit 1993 LIBTR Attali & Montanvert, Squelettes et Diagrammes de Voronoi 1993 LIBTR Broder & Freize & Suen & Upfal, Optimal Construction of Edge-Disjoint Paths in Random Graphs 1993 LIBTR Balmforth & Spiegel & Tresser, The Topological Entropy of One-Dimensional Maps: Approximations and Bounds 1993 LIBTR Aggarwal & Kutten, Time Optimal Self-stabilizing Spanning Tree Algorithms 1993 LIBTR Bellare & Rogaway, Entity Authentication and Key Distribution 1993 LIBTR Bellare, Interactive Proofs and Approximation: Reductions from Two Provers in One Round 1993 LIBTR Naor & Stockmeyer, What Can Be Computed Locally? 1993 LIBTR Bar-Noy & Bruck & Ho & Kipnis & Schieber, Computing Global Combine Operations in the Multi-Port Postal Model 1993 LIBTR Rissanen, Fisher Information and Stochastic Complexity 1993 LIBTR Tsudik & Van Herreweghen, On Simple and Secure Key Distribution 1993 LIBTR Cull & Larson, The Mobius Cubes 1993 LIBTR Larson & Cull, Static and Dynamic Performance of the Mobius Cubes (long version) 1993 LIBTR Larson & Cull, Static and Dynamic Performance of the Mobius Cube (short version) 1993 LIBTR Cull & Holloway, Approximate String Matching for Biological Sequence with Swaps and Inversions 1993 LIBTR Cull & Larson, A Note on Generalized Twisted Cubes 1993 LIBTR Bose & Rowley, A Distributed Algorithm for Finding a Fault-free Cycle in a De Bruijn Network 1993 LIBTR Tallini & Capocelli & Bose, Design of Some New Efficient Balance Codes 1993 LIBTR Bose & Broeg & Kwon & Ashir, Lee Distance and Topological Properties of k-ary n-Cubes 1993 LIBTR Heath, Graph Embeddings and Simplicial Maps 1993 LIBTR Mayo & Wake, A Grassroots Approach to Graduate Teaching Assistant Mentoring 1993 LIBTR Heath & Lavinus, Optimal and Random Partitions of Random Graphs 1993 LIBTR Takagi & Takagi & Yajima, Linear Arrangement Algorithms for VLSI Layout of High-Speed Multipliers 1993 LIBTR Tani & Hamaguchi & Yajima, The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams 1993 LIBTR Cutler & Kamiya, Preprocessing the Text for Faster String Searching 1993 LIBTR Veanes, Cycletrees: A Novel Class of Interconnection Graphs 1993 LIBTR Karpinski & Rytter, On a Sublinear Time Parallel Construction of Optimal Binary Search Trees 1993 LIBTR Kushilevitz & Micali & Ostrovsky, Any Non-Private Boolean Function Is Complete For Private Multi-Party Computations 1993 LIBTR Luby & Ertel, Optimal Parallelization of Las Vegas Algorithms 1993 LIBTR Grigoriev & Karpinski, Lower Bounds on Complexity of Testing Membership to a Polygon for Algebraic and Randomized Computation Trees 1993 LIBTR Goldreich & Ostrovsky, Software Protection and Simulation on Oblivious RAMs 1993 LIBTR Ostrovsky & Wigderson, One-Way Functions are Essential for Non-trivial Zero-Knowledge 1993 LIBTR Alon & Blum & Fiat & Kannan & Naor & Ostrovsky, Matching Nuts and Bolts 1993 LIBTR Weber, The Study of Computer Science Concepts through Game Play 1993 LIBTR Bshouty & Goldman & Hancock & Matar, Asking Questions to Minimize Errors 1993 LIBTR Proskurowski & Syslo & Winter, Plane Embeddings of 2-Trees and Biconnected Partial 2-Trees 1993 LIBTR Mark, Sylow's Theorem and Parallel Computation 1993 LIBTR Babai & Luks & Seress, Computing Composition Series in Primitive Groups 1993 LIBTR Luks, Permutation Groups and Polynomial-Time Computation 1993 LIBTR Farley & Proskurowski, Self-Repairing Networks and Minimum Self-Repairing Graphs 1993 LIBTR Ar & Cai, Uncheatable Benchmarks Using Numerical Instability 1993 LIBTR Klein & Tarjan, Randomized Linear-Time Algorithm for Finding Minimum Spanning Trees 1993 LIBTR Mutchler, The Multi-Player Version of Minimax Displays Game-Tree Pathology 1993 LIBTR Langston, An Obstruction-based Approach to Layout Optimization 1993 LIBTR Langston, Time-Space Optimal Parallel Computation 1993 LIBTR Breshears & Langston, MIMD versus SIMD Computation: Experience with Non-numeric Parallel Algorithms 1993 LIBTR Desprez & Ferreira & Tourancheau, Efficient Communication Operations in Reconfigurable Parallel Computers 1993 LIBTR Desprez & Fraigniaud & Tourancheau, Successive Broadcasts on Hypercube 1993 LIBTR Gregor & Thomason, Dynamic Programming Alignment of Sequences Representing Cyclic Patterns 1993 LIBTR Govindan & Langston & Ramachandramurthi, A Practical Approach to Layout Optimization 1993 LIBTR Adve, Designing Memory Consistency Models for Shared-Memory, Multiprocessors 1993 LIBTR Hyslop, Bucketing Algorithms for Sorting, Searching and Computational Geometry 1993 LIBTR Innes, Searching with an Error 1993 LIBTR Bradford & Choppella & Rawlins, On Lower Bounds for the Matrix Chain Ordering Problem 1993 LIBTR Bradford & Rawlins & Shannon, Matrix Chain Ordering in Polylog Time with n/lg n Processors 1993 LIBTR Gerbessiotis, Topics in Parallel and Distributed Computation 1993 LIBTR Kushilevitz & Micali & Ostrovsky, Universal Boolean Judges and their Characterization 1993 LIBTR Ar, Trustworthy Computations 1993 LIBTR Bertot & Kahn & Thery, Proof by Pointing 1993 LIBTR Al-Tawil & Avresky & Pradhan, Fault Tolerance of Hypercubes Using Spanning Trees 1993 LIBTR Lee & Liu, A Fault-Tolerance Broadcast Algorithm for Hypercube Multiprocessor Systems 1993 LIBTR Cai & Chen, On Input Read-Modes of Alternating Turing Machines 1993 LIBTR Chang & Bhuyan, Fault Tolerant Broadcasting Algorithms in SIMD Hypercubes 1993 LIBTR Sharma & Pradham, Submesh Allocation in Mesh Multicomputers 1993 LIBTR Kanevsky & Chao, On the Embedding of Cycles in Pancake Graphs 1993 LIBTR Abu-Amara & Kanevsky, On the Complexities of Leader Election Algorithms 1993 LIBTR Lee & Liu, An Efficient Fault-Tolerant Multicast Technique for Hypercubes 1993 LIBTR Vaidya & Pradham, Degradable Byzantine Agreement 1993 LIBTR Lee & Kim, Simple, Efficient Distributed Depth-First-Search Algorithms 1993 LIBTR Chen & Kanchi & Kanevsky, On the Complexity of Graph Embeddings 1993 LIBTR Lee & Lee & Kim & Abu-Amara, Complete Deadlock Detection in a Distributed System 1993 LIBTR Vaidya, A New Class of Unidirectional Error Control Codes 1993 LIBTR Chang & Bhuyan, An Approach to Hypercube Allocation Using Weights 1993 LIBTR Lin & Vitter, A Theory for Memory-based Learning 1993 LIBTR Krishnan & Vitter, Optimal Prediction for Prefetching in the Worst Case 1993 LIBTR Agarwal, On stabbing Lines for Convex Polyhedra in 3D 1993 LIBTR Agarwal & Sharir, Ray Shooting Amidst Convex Polygons in 2D 1993 LIBTR Agarwal & Sharir, Ray shooting Amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions 1993 LIBTR Conway, Criteria and Consideration in the Selection of a First Programming Language 1993 LIBTR Micali, Fair Cryptosystems 1993 LIBTR Savage, Limits on Heterogeneous Supercomputing 1993 LIBTR Savage, Space-Time Tradeoffs in Memory Hierarchies 1993 LIBTR Bilardi & Preparata, Horizons of Parallel Computation 1993 LIBTR Lu & Klein & Netzer, Detecting Race Conditions in Parallel Programs That Use One Semaphore 1993 LIBTR Klein & Plotkin & Rao & Tardos, Bound on the Max-Flow Min-Cut Ratio for Directed Multicommodity Flows 1993 LIBTR Ravi, A Primal-Dual Approximation Algorithm for the Steiner Forest Problem 1993 LIBTR Klein & Ravi, A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees 1993 LIBTR Ganesan & Pradhan, Wormhole Routing in de Bruijn Networks 1993 LIBTR Liu & Kim, An Efficient Partition Finding Algorithm with Low Communication Cost for External Sorting in Parallel Database Systems 1993 LIBTR Banatre & Bryce, A Security Proof System for Networks of Communicating Processes 1993 LIBTR Bouchitte & Hilali & Jegou & Rampon, Contiguity Orders 1993 LIBTR Andonov & Raimbault & Quinton, Dynamic Programming Parallel Implementations for the Knapsack Problem 1993 LIBTR Favron & Li & Schelp, Strong Edge Colorings of Graphs 1993 LIBTR Boudet & Comon, About the Theory of Tree Embedding 1993 LIBTR Favaron, Least Domination in a Graph 1993 LIBTR Rusu, Properly Orderable Graphs 1993 LIBTR Rusu, Building Counterexamples 1993 LIBTR Manber, A Text Compression Scheme That Allows Fast Searching Directly in the Compressed File 1993 LIBTR Dyreson & Snodgrass, Efficient Timestamp Input and Output 1993 LIBTR Manber & Wu, A Two-Level Approach to Information Retrieval 1993 LIBTR Aggarwal & Bar-Noy & Coppersmith & Ramaswami & Schieber & Sadan, Efficient Routing and Scheduling Algorithms for Optical Networks 1993 LIBTR Ramaswami & Sivarajan, Optimal Routing and Wavelength Assignment in All-Optical Networks 1993 LIBTR Chaitin, Exhibiting Randomness in Arithmetic Using Mathematica and C 1993 LIBTR Snir, Issues and Directions in Scalable Parallel Computing 1993 LIBTR Philips & Nelson, The Moment Bound is Tighter than Chernoff's Bound for Positive Tail Probabilities 1993 LIBTR Kyriakis-Bitzaros & Goutis, Space-Time Representation of Iterative Algorithms and the Design of Regular Processor Arrays 1993 LIBTR Franaszek & Tsoucas & Thomas, Optimal Context Allocation with an Application to Data Compression 1993 LIBTR Cahn, The Travelling Art Dealer's Problem or the Shopper's Dilemma 1993 LIBTR Ho & Kao, Optimal Broadcast on Hypercubes with Wormhole and E-Cube Routings 1993 LIBTR Agrawal & Faloutsos & Swami, Efficient Similarity Search in Sequence Databases 1993 LIBTR Cabrera & McPherson & Schwarz & Wyllie, Implementing Atomicity in Two Systems: Techniques, Tradeoffs and Experience 1993 LIBTR Ho & Kao, Optimal Broadcast in All-Port Wormhole-routed Hypercubes 1993 LIBTR Ajtai, Geometric Properties of Sets Defined by Constant Depth Circuits 1993 LIBTR da Rocha & Blaum, A Secret Cryptosystem Based on Phased Burst Correcting Codes 1993 LIBTR Aiken & Kozen & Wimmers, Decidability of Systems of Set Constraints with Negative Constraints 1993 LIBTR Konstantinidou, Segment Routing: A Novel Routing Technique for Parallel Computers 1993 LIBTR Dwork & Halpern & Waarts, Performing Work Efficiently in the Presence of Faults 1993 LIBTR Chen & Chen & Yu, Combining Two Classes of Schemes for Optimal All-to-All Broadcasting 1993 LIBTR Bar-Noy & Kipnis & Schieber, Optimal Computation of Census Functions in the Postal Model 1993 LIBTR Barahona, Packing Spanning Trees 1993 LIBTR Awerbuch & Kutten & Mansour & Patt-Shamir & Varghese, Time Optimal Self-Stabilizing Synchronization 1993 LIBTR Rubinfeld & Sudan, Robust Characterization of Polynomials and their Applications to Program Testing 1993 LIBTR Verma & Gopal, Efficiency Considerations in Leaky Buckets 1993 LIBTR Stok & Spillinger & Even, Reversed Retiming for Initialization 1993 LIBTR Kreinovich, Fast Parallel Algorithms that Compute Transitive Closure of a Fuzzy Relation 1993 LIBTR Kreinovich, Min and Max are the Only Continuous &-, v-Operations for Finite Logics 1993 LIBTR Villa & Bernat & Kreinovich, Estimating Errors of Indirect Measurements on Realistic Parallel Machines: Routings on 2-D and 3-D Meshes that are Nearly Optimal 1993 LIBTR Kreinovich & Lakeyev & Noskov, Optimal Solution of Interval Linear Systems is Intractable (NP-Hard) 1993 LIBTR Kreinovich, Towards a More Realistic Notion of a Feasible Algorithm 1993 LIBTR Kreinovich & Watson, How Difficult is it to Invent a Non-trivial Game? 1993 LIBTR Rohn & Kreinovich, Computing Exact Componentwise Bounds on Solutions of Linear Systems with Interval Data is NP-Hard 1993 LIBTR Traylor & Kreinovich, A Bright Side of NP-Hardness of Interval Computations: Interval Heuristics Applied to NP-Problems 1993 LIBTR Sandoval & Kreinovich, A Neural Network Learns Faster if we Present Patterns in Random Order: An Explanation 1993 LIBTR Kreinovich, Ellipsoid Computations are Intractable Even for Polynomials 1993 LIBTR Louchard & Szpankowski, Average Profile and Limiting Distribution for a Phrase Size in the Lempel-Ziv Parsing Algorithm 1993 LIBTR Flajolet & Sedgewick, The Average Case Analysis of Algorithms: Counting and Generating Functions 1993 LIBTR Devillers & Fabri, Scalable Algorithms for Bichromatic Line Segment Intersection Problems on Coarse Grained Multicomputers 1993 LIBTR Heintz & Morgenstern, On the Intrinsic Complexity of Elimination Theory 1993 LIBTR Breslauer, Testing String Superprimitivity in Parallel 1993 LIBTR Breslauer, Dictionary-Matching on Unbounded Alphabets: Uniform Length Dictionaries 1993 LIBTR Goldberg, PAC-Learning Geometrical Figures 1993 LIBTR Arora & Lund & Motwani & Sudan & Szegedy, Proof Verification and the Hardness of Approximation Problems 1993 LIBTR Jutla, Approximating Asymmetric Traveling Salesman Problem with Distances One and Two 1993 LIBTR Emerson & Jutla, The Complexity of Tree Automata and Logics of Programs 1993 LIBTR Verma & Gopal, Tree Computation for Reserved Bandwidth Traffic 1993 LIBTR Chaitin, The Limits of Mathematics--Course Outline and Software 1993 LIBTR Kirkpatrick & Selman, Critical Behavior at the k-Satisfiability Threshold 1993 LIBTR Italiano & Ramaswami, Maintaining Spanning Trees of Small Diameter 1993 LIBTR Janson & Tsudik, Secure and Minimal Protocols for Authenticated Key Distribution 1993 LIBTR Hauser & Janson & Molva & Tsudik & Herreweghen, Robust and Secure Password and Key Change Method 1993 LIBTR Ajtai, Symmetric Systems of Linear Equations Modulo p 1993 LIBTR Aiken & Kozen & Vardi & Wimmers, The Complexity of Set Constraints 1993 LIBTR Fuchs & Stolen, Development of a Distributed min/max Component 1993 LIBTR Kunde & Niedermeier & Rossmanith, Faster Sorting and Routing on Grids with Diagonals 1993 LIBTR Felten & LaMarca & Ladner, Building Counting Networks from Larger Balancers 1993 LIBTR Beame & Pitassi, An Exponential Separation between the Matching Principle and the Pigeonhole Principle 1993 LIBTR Beame & Sinha, Simulation of Multiprefix PRAMs by Unbounded Fan-in Circuits 1993 LIBTR Thrash, A Note on the Least Common Multiples of Dense Sets of Integers 1993 LIBTR Gent & Walsh, Towards an Understanding of Hill-climbing Procedures for SAT 1993 LIBTR Regan, On the Difference between Turing Machine Time and Random-Access Machine Time 1993 LIBTR Sarnath, Doubly Logarithmic Time Parallel Sorting 1993 LIBTR Kreinovich & Kosheleva, An Application of Logic to Combinatorial Geometry: How Many Tetrahedra are Equidecomposable with a Cube? 1993 LIBTR Ladner & Lampe & Rogers, Vector Prefix Addition on Sub-Bus Mesh Computers 1993 LIBTR Lawry, Communication Complexity: Iterative Techniques for Lower Bounds 1993 LIBTR Luby & Ertel, Optimal Parallelization of Las Vegas Algorithms 1993 LIBTR Mayr & Werchner, Divide-and-Conquer Algorithms on the Hypercube 1993 LIBTR Heun & Mayr, A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into its Optimal Hypercube 1993 LIBTR Schnekenburger, A Definition of Efficiency of Parallel Programs in Multi-tasking Environments 1993 LIBTR Heintze, Set Based Analysis of Arithmetic 1993 LIBTR Kantrowitz, Bibliography of Research in Natural Language Generation 1993 LIBTR Kalantari & Kalantari, High Order Iterative Methods for Approximating Roots of Polynomials 1993 LIBTR Kalantari & Kalantari, High Order Iterative Methods for Approximating Square and Cube Roots 1993 LIBTR Ganguly & Leichter & Noordewier, Fast Search Methods for Biological Sequence Databases 1993 LIBTR Fernando, Operational Semantics, Bisimulations and Logical Complexity 1993 LIBTR Corciulo & Giannotti & Pedreschi, Datalog with Non-deterministic Choice Computes NDB-PTIME 1993 LIBTR Efremidis & Gries, An Algorithm for Processing Program Transformations 1993 LIBTR Vavasis & Ye, An Accelerated Interior Point Method Whose Running Time Depends only on A 1993 LIBTR Kozen & Stefansson, Computing the Newtonian Graph (extended abstract) 1993 LIBTR Canny & Pedersen, An Algorithm for the Newton Resultant 1993 LIBTR Vavasis & Ye, Condition Numbers for Polyhedra with Real Number Data 1993 LIBTR Hartmanis & Chari, On the Intellectual Terrain around NP 1993 LIBTR Anderson, Program Derivation by Proof Transformation 1993 LIBTR Keller, Regular Layouts of Butterfly Networks in Three Dimensions 1993 LIBTR Kanazawa, Identification in the Limit of Categorial Grammars 1993 LIBTR Ganesan & Pradhan, Wormhole Routing in de Bruijn Networks 1993 LIBTR Vaidya, A New Class of Unidirectional Error Control Codes 1993 LIBTR Liu & Kim, An Efficient Partition Finding Algorithm with Low Communication Cost for External Sorting in Parallel Database Systems 1993 LIBTR Chen & Kanchi & Kanevsky, On the Complexity of Graph Embeddings 1993 LIBTR Chen & Kanchi & Gross, A Tight Lower Bound on the Maximum Genus of a Simplicial Graph 1993 LIBTR Lee & Kim, Simple, Efficient Distributed Depth-First-Search Algorithms 1993 LIBTR Vaidya & Pradhan, Degradable Byzantine Agreement 1993 LIBTR Attiya & Welch, Sequential Consistency versus Linearizability 1993 LIBTR Lee & Liu, An Efficient Fault-Tolerant Multicast Technique for Hypercubes 1993 LIBTR Abu-Amara & Kanevsky, On the Complexities of Leader Election Algorithms 1993 LIBTR Vuillemin, On Circuits and Numbers 1993 LIBTR Smith, A Theory of Distributed Time 1993 LIBTR Rabi & Sherman, Associative One-way Functions: A New Paradigm for Secret-Key Agreement and Digital Signatures 1993 LIBTR O'Leary & Wu, A Block GTH Algorithm for Finding the Stationary Vector of a Markov Chain 1993 LIBTR Bader & Ja'Ja' & Chellappa, Scalable Data Parallel Algorithms for Texture Synthesis and Compression Using Gibbs Random Fields 1993 LIBTR Beigel & Gasarch & Kinber, Frequency Computation and Bounded Queries 1993 LIBTR Ja'Ja' & Ryu, The Block Distributed Memory Model for Shared Memory Multiprocessors 1993 LIBTR Flake & Sun & Lee & Chen, Exploiting Chaos to Control the Future 1993 LIBTR Marcus & Subrahmanian, Multimedia Database Systems 1993 LIBTR Faloutsos & Kamel, Beyond Uniformity and Independence: Analysis of R-Trees Using the Concept of Fractal Dimension 1993 LIBTR Buchsbaum, Data-Structural Bootstrapping and Catenable Deques 1993 LIBTR Allender & Ogiwara, Relationships among PL, #L, and the Determinant 1993 LIBTR Allender & Gore, A Uniform Circuit Lower Bound for the Permanent 1993 LIBTR Cox & Hanrahan, Evenly Distributed Depth is the Worst for Distributed Snooping 1993 LIBTR Dixon, Minimum Spanning Tree Verification, Fast Priority Queues, and Massively Parallel Factoring 1993 LIBTR Buchsbaum & Tarjan, Confluently Persistent Deques via Data-Structural Bootstrapping 1993 LIBTR Buchsbaum & Sundar & Tarjan, Lazy Structure Sharing for Query Optimization 1993 LIBTR Chazelle, Quasi-orthogonality via Finite-Differencing: An Elementary Approach to Geometric Discrepancy 1993 LIBTR Chazelle & Matousek, On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension 1993 LIBTR Sitaraman, Communication and Fault Tolerance in Parallel Computers 1993 LIBTR Edahiro, Delay Minimization for Zero-Skew Routing 1993 LIBTR Edahiro, Clustering-based Optimization Algorithm in Zero-Skew Routings 1993 LIBTR Allender & Jiao, Depth Reduction for Noncommutative Arithmetic Circuits (extended abstract) 1993 LIBTR Allender & Balcazar & Immerman, A First-order Isomorphism Theorem 1993 LIBTR Campos, Distributed, Garbage-collected, Persistent, Virtual Address Spaces 1993 LIBTR Estivill-Castro & Wood, An Adaptive Generic Sorting Algorithm that Uses Variable Partitioning 1993 LIBTR Zhang, A Constrained Edit Distance between Unordered Labeled Trees 1993 LIBTR Zhang, Fast Algorithm for the Constrained Editing Distance between Ordered Labeled Trees and Related Problems 1993 LIBTR Lamport, How to Write a Long Formula 1993 LIBTR Abadi & Lamport, Conjoining Specifications 1993 LIBTR Young, How Reductions to Sparse Sets Collapse the Polynomial-Time Hierarchy: A Primer 1993 LIBTR Lai & Wood, Adaptive Heuristics for Binary Search Trees and Constant Linkage Cost 1993 LIBTR Nurmi & Soisalon-Soininen & Wood, Relaxed AVL Trees and Main-Memory Databases 1993 LIBTR Lai & Wood, A New Approach to Competitive List-Update Algorithms 1993 LIBTR Mourad & Morris & Swami & Young, Limits of Parallelism in Hash Join Algorithms 1993 LIBTR Weinberger & Merhav & Feder, Optimal Sequential Probability Assignment for Individual Sequences 1993 LIBTR Kasson, Color Accuracy in Kodak Photo CDs 1993 LIBTR Feder & Vardi, Monotone Monadic SNP and Constraint Satisfaction 1993 LIBTR Halpern, Reasoning about Only Knowing with Many Agents 1993 LIBTR Bacchus & Grove & Halpern & Koller, Statistical Foundations for Default Reasoning 1993 LIBTR Ramachandran & Yang, An Efficient Parallel Algorithm for the Layered Planar Monotone Circuit Value Problem 1993 LIBTR Barnett & Littlefield & Payne & van de Geijn, On the Efficiency of Global Combine Algorithms for 2-D Meshes with Wormhole Routing 1993 LIBTR Bellare & Goldwasser & Lund & Russell, Efficient Probabilistically Checkable Proofs and Applications to Approximation 1993 LIBTR Litsyn & Vardy, The Uniqueness of the Best Code 1993 LIBTR Borodin & Raghavan & Upfal, How Much Can Hardware Help Routing? 1993 LIBTR Rajan, Optimality of the Delaunay Triangulation in R^d 1993 LIBTR Yellin & Jutla, Finding Extremal Sets in Less than Quadratic Time 1993 LIBTR Chaitin, On the Number of n-Bit Strings with Maximum Complexity 1993 LIBTR Lin & Wong, Process-Variation-Tolerant Zero Skew Clock Routing 1993 LIBTR Gasperoni & Schwiegelshohn, A Structural Hierarchy for Directed Graphs 1993 LIBTR Beling & Megiddo, Using Fast Matrix Multiplication to Find Basic Solutions 1993 LIBTR Fagin & Stockmeyer & Vardi, On Monadic NP vs. Monadic co-NP 1993 LIBTR Califano & Rigoutsos, FLASH: A Fast Look-up Algorithm for String Homology 1993 LIBTR Faloutsos & Ranganathan & Manolopoulos, Fast Subsequence Matching in Time-Series Databases 1993 LIBTR Aggarwal & Bar-Noy & Khuller & Kravets & Schieber, Efficient Minimum Cost Matching and Transportation Using Quadrangle Inequality 1993 LIBTR Sun & Giles & Chen & Lee, The Neural Network Pushdown Automation: Model, Stack and Learning Simulations 1993 LIBTR Cherkassky & Goldberg & Radzik, Shortest Paths Algorithms: Theory and Experimental Evaluation 1993 LIBTR Goldberg & Kennedy, An Efficient Cost Scaling Algorithm for the Assignment Problem 1993 LIBTR Knuth, The Sandwich Theorem 1993 LIBTR Zhang, Density Control and On-line Labeling Problems (Ph.D. Thesis) 1993 LIBTR Hemaspaandra & Zimand, Seeking Stronger Separations: Probability One Balanced- and Bi-immunity 1993 LIBTR Hemaspaandra & Silvestri, Easily Checked Generalized Self-Reducibility 1993 LIBTR Milis, Task Assignments in Distributed Systems Using Network Flow Methods 1993 LIBTR Kanchi & Kim, Efficient Failure Handling in Distributed Election on an Asynchronous Complete Network 1993 LIBTR Dobkin & Tal, Building and Using Polyhedral Hierarchies 1993 LIBTR Calude & Jurgensen, Randomness as an Invariant for Number Representations 1993 LIBTR Grigoriadis & Khachiyan, An Exponential-Function Reduction Method for Block-angular Convex Programs 1993 LIBTR Khachiyan, Rounding of Polytopes in R^n 1993 LIBTR Masticola, Static Detection of Deadlocks in Polynomial Time 1993 LIBTR Myers, Why are Human-Computer Interfaces Difficult to Design and Implement? 1993 LIBTR Selberg, How to Stop a Cheater: Secret Sharing with Dishonest Participation 1993 LIBTR Hoover, TAP-D: A Model for Developing Specialization Tracks in Graduate Software Engineering Education 1993 LIBTR Garlan & Brown & Jackson & Tomayko & Wing, The CMU Masters in Software Engineering Core Curriculum 1993 LIBTR Newman & Schuster, Hot-Potato Algorithms for Permutation Routing (extended abstract) 1993 LIBTR Brown & Hershberger, The Second Annual Video Review of Computational Geometry 1993 LIBTR Michael & Scott, Fast Mutual Exclusion, even with Contention 1993 LIBTR Hemaspaandra & Hoene & Naik & Ogiwara & Selman & Thierauf & Wang, Selectivity: Reductions, Nondeterminism, and Function Classes 1993 LIBTR Macarie, Space-efficient Deterministic Simulation of Probabilistic Automata 1993 LIBTR Zimand, The Complexity of the Optimal Spanning Hypertee Problem 1993 LIBTR Khuller, Design and Analysis of Algorithms: Course Notes 1993 LIBTR Salem, Space-efficient Hot Spot Estimation 1993 LIBTR Maslov, Automatically Solving Polynomial Constraints over the Integers 1993 LIBTR Wu, Multilist Scheduling: A New Parallel Programming Model 1993 LIBTR Garlan & Brown & Jackson & Tomayko & Wing, The CMU Master of Software Engineering Core Curriculum 1993 LIBTR Uspensky & Shen, Relations between Varieties of Kolmogorov Complexities 1993 LIBTR Bakker & van Breugel & de Bruin, Comparative Semantics for Linear Arrays of Communicating Processes 1993 LIBTR Bonsangue & Kok, Isomorphisms between Predicate and State Transformers 1993 LIBTR van Breugel, Three Metric Domains of Processes for Bisimulation 1993 LIBTR van Breugel, Relating State Transformation Semantics and Predicate Transformer Semantics for Parallel Programs 1993 LIBTR Fernando, Bisimulations and Predicate Logic 1993 LIBTR Dershowitz & Jouannaud & Klop, More Problems in Rewriting 1993 LIBTR Bergstra & Heering, Homomorphism Preserving Algebraic Specifications Require Hidden Sorts 1993 LIBTR Mathur & Reingold, Generalized Kraft's Inequality and Discrete k-modal Search 1993 LIBTR Delfinado & Edelsbrunner, An Incremental Algorithm for Betti Numbers of Simplicial Complexes 1993 LIBTR Facello, Constructing Delaunay and Regular Triangulations in Three Dimensions 1993 LIBTR Spencer, Almost Optimally Efficient Spanning Tree Computation on the EREW PRAM 1993 LIBTR de Bakker & van Breugel, Topological Models for Higher Order Control Flow 1993 LIBTR Bennett & Gacs & Li & Vitanyi & Zurek, Thermodynamics of Computation and Information Distance 1993 LIBTR Gacs, The Boltzmann Entropy and Randomness Tests 1993 LIBTR Kennaway & Klop & Sleep & de Vries, Comparing Curried and Uncurried Rewriting 1993 LIBTR Khasidashvili, Perpetual Reductions in Orthogonal Combinatory Reduction Systems 1993 LIBTR Khasidashvili, Higher Order Recursive Program Schemes are Turing Incomplete 1993 LIBTR Kennaway & Klop & Sleep & de Vries, Event Structures and Orthogonal Term Graph Rewriting 1993 LIBTR Rutten, A Structural Co-induction Theorem 1993 LIBTR Khasidashvili, Perpetual Reductions and Strong Normalization in Orthogonal Term Rewriting Systems 1993 LIBTR Henderson & Zorn, A Comparison of Object-oriented Programming in Four Modern Languages 1993 LIBTR Matta & Shankar, On the Interaction between Gateway Scheduling and Routing 1993 LIBTR Greenberg & Oh, Universal Wormhole Routing 1993 LIBTR Lakos, A General Systematic Approach to Arc Extensions for Coloured Petri Nets 1993 LIBTR Lakos, The Role of Substitution Places in Hierarchical Coloured Petri Nets 1993 LIBTR Lakos, Coloured Petri Nets with Place Summary Functions 1993 LIBTR Forester, Formalizing Constructive Real Analysis 1993 LIBTR Donald & Jennings & Rus, Towards a Theory of Information Invariants for Cooperating Autonomous Mobile Robots 1993 LIBTR Liu & Teitelbaum, Deriving Incremental Programs 1993 LIBTR Rohatgi, On Properties of Random Reductions 1993 LIBTR Rubinfeld & Sudan, Robust Characterizations of Polynomials and their Applications to Program Testing 1993 LIBTR Srinivasan, Techniques for Probabilistic Analysis and Randomness-efficient Computation 1993 LIBTR Stefansson, Systems of Set Constraints with Negative Constraints are NEXPTIME-Complete 1993 LIBTR Johnson & Pearson & Pingali, Finding Regions Fast: Single Entry Single Exit and Control Regions in Linear Time 1993 LIBTR Salton & Allan, Selective Text Utilization and Text Traversal 1993 LIBTR Fix & Grumberg, Verification of Temporal Properties 1993 LIBTR Sundaram, Fast Algorithms for N-Body Simulations 1993 LIBTR Chandra & Toueg, Unreliable Failure Detectors for Reliable Distributed Systems 1993 LIBTR Etzioni & Levy & Segal & Thekkath, OS Agents: Using AI Techniques in the Operating System Environment 1993 LIBTR Lockyear & Ebeling, The Practical Application of Retiming to the Design of High-Performance Systems 1993 LIBTR Dymond & Fich & Nishimura & Ragde & Ruzzo, Pointers versus Arithmetic in PRAMs 1993 LIBTR Craig, Building FIFO and Priority-Queuing Spin Locks from Atomic Swap 1993 LIBTR Beame & Borodin & Raghavan & Ruzzo & Tompa, Time-Space Tradeoffs for Undirected Graph Traversal 1993 LIBTR Dietz & Macarie & Seiferas, Bits and Relative Order from Residues, Space Efficiently 1993 LIBTR de la Torre & Kruskal, Fast Parallel Algorithms for All Sources Lexicographic Search and Path-algebra Problems 1993 LIBTR Greenlaw & Machta, On the Parallel Complexity of Invasion Percolation 1993 LIBTR Han & Thierauf, Advice from Nonadaptive Queries to NP 1993 LIBTR Watanbe, An NP Set with No Co-DP Sparse Subset 1993 LIBTR Liu & Miller, Deadlock Detection for Cyclic Protocols Using Generalized Fair Reachability Analysis 1993 LIBTR Khuller & Raghavachari & Young, Maintaining Directed Reachability with Few Edges 1993 LIBTR Vishkin, Can Parallel Algorithms Enhance Serial Implementation? 1993 LIBTR Helman & Ja'Ja', Efficient Image Processing Algorithms on the Scan Line Array Processor 1993 LIBTR Billups & Ferris, Convergence of Infeasible Interior-Point Algorithms from Arbitrary Starting Points 1993 LIBTR Sanghi, Flow Control in Computer Networks 1993 LIBTR Greenberg & Oh, Routing Schemes for Packets on Fat-trees 1993 LIBTR Kharitonov, The Cryptographic Hardness of Machine Learning (microfiche) 1993 LIBTR Gunawardena, Min-Max Functions, Part I 1993 LIBTR Gupta & Mumick, Improvement to the PF Algorithm 1993 LIBTR Karger & Motwani, Derandomization through Approximation: An NC Algorithm for Minimum Cuts 1993 LIBTR Univ & Mashack, Bibliography of Computer Science Reports, 1963-1992 1993 LIBTR Goldberg, Combinatorial Optimization: Lecture Notes for CS363/OR349 1993 LIBTR Goldberg & Radzik, A Heuristic Improvement of the Bellman-Ford Algorithm 1993 LIBTR Manna & Pnueli, A Temporal Proof Methodology for Reactive Systems 1993 LIBTR Manna & Pnueli, Models for Reactivity 1993 LIBTR Dietz & Seiferas & Zhang, A Tight Lower Bound for On-line Monotonic List Labeling 1993 LIBTR Kamiya, On the Average-Case Behavior of Boyer-Moore-Horspool's String Searching Algorithm 1993 LIBTR Spencer, Upper Bounds for Ramsey Numbers via Linear Programming 1993 LIBTR Takizawa & Arita & Minoh & Ikeda, Extraction of Character Strings from Unformed Document Images 1993 LIBTR Breslauer, Saving Comparisons in the Crochemore-Perrin String Matching Algorithm 1993 LIBTR van Benthem & van Eijck & Stebletsova, Modal Logic, Transition Systems and Processes 1993 LIBTR Lynch & Vaandrager, Forward and Backward Simulations Part I: Untimed Systems 1993 LIBTR Shen, A Strange Application of Kolmogorov Complexity 1993 LIBTR Han & Hemachandra & Thierauf, Threshold Computation and Cryptographic Security 1993 LIBTR Panconesi & Srinivasan, Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds 1993 LIBTR Panconesi, Locality in Distributed Computing (Ph.D Thesis) 1993 LIBTR Budhiraja, The Primary-Backup Approach: Lower and Upper Bounds (Ph.D Thesis) 1993 LIBTR Aiken & Kozen & Vardi & Wimmers, The Complexity of Set Constraints 1993 LIBTR Kleinberg & Mullainathan, Resource Bounds and Combinations of Consensus Objects 1993 LIBTR Kleinberg, A Lower Bound for Two-Server Balancing Algorithms 1993 LIBTR Chew, Near-Quadratic Bounds for the L1 Voronoi Diagram of Moving Points 1993 LIBTR Chew & Fortune, Sorting Helps for Voronoi Diagrams 1993 LIBTR Chandra & Chandra, Undecidability in Macroeconomics (preliminary draft) 1993 LIBTR Fischer, Optimizing the Degree of Minimum Weight Spanning Trees 1993 LIBTR Aiken & Kozen & Wimmers, Decidability of Systems of Set Constraints with Negative Constraints 1993 LIBTR Chari & Rohatgi & Srinivasan, Randomness-Optimal Unique Element Isolation, with Applications to Perfect Matching and Related Problems 1993 LIBTR Panconesi & Srinivasan, On the Complexity of Distributed Network Decomposition 1993 LIBTR Semba & Yajima, Combinatorial Algorithms by Boolean Processing II 1993 LIBTR Semba & Yajima, Combinatorial Algorithms by Boolean Processing I 1993 LIBTR Matsuoka & Yajima, A Linear Time Algorithm for Hamiltonian Cycle Problem on Memory Type Processor Array 1993 LIBTR Ja'Ja' & Ryu & Vishkin, Sorting Strings and Constructing Digital Search Trees in Parallel 1993 LIBTR Frievalds & Kinber & Smith, On the Impact of Forgetting on Learning Machines 1993 LIBTR Fischer, A Note on the Complexity of Local Search Problems 1993 LIBTR van Benthem & Bergstra, Logic of Transition Systems 1993 LIBTR Dolev & Israeli & Moran, Uniform Self-stabilizing Leader Election Part 1: Complete Graph Protocols 1993 LIBTR Moran & Taubenfeld, A Lower Bound on Wait-free Counting 1993 LIBTR Brown, The 1992 SRC Algorithm Animation Festival 1993 LIBTR Anderson & Owicki & Saxe & Thacker, High Speed Switch Scheduling for Local Area Networks 1993 LIBTR Keller, Fast Parallel Permutation Algorithms 1993 LIBTR Lu & Nerode & Remmel & Subrahmanian, Towards a Theory of Hybrid Knowledge Bases 1993 LIBTR Souvaine & Yap, Combinatorial Complexity of Signed Discs 1993 LIBTR Kalantari, A Simple Polynomial Time Algorithm for a Convex Hull Problem Equivalent to Linear Programming 1993 LIBTR Gore, Lower Bounds for Uniform Constant Depth Circuits 1993 LIBTR Bala & Kipnis & Rudolph & Snir, Designing Efficient, Scalable, and Portable Collective Communication Libraries 1993 LIBTR Lomonozov & Waksman, On Network Representation of the Solutions in Combinatorial Optimization 1993 LIBTR Zimand, On the Topological Size of p-m-Complete Degrees 1993 LIBTR Cai & Keil, Spanners in Graphs with Bounded Degree 1993 LIBTR Lynch & Vaandrager, Forward and Backward Simulations Part II: Timing-based Systems 1993 LIBTR Ferguson, Single Term Off-line Coins 1993 LIBTR Hoepman & Tromp, Binary Snapshots 1993 LIBTR Valdes-Perez, A Scientific Basis for Computational Science 1993 LIBTR Shufelt & Berliner, Generating Knight's Tours without Backtracking from Errors 1993 LIBTR Nettles & O'Toole & Gifford, Concurrent Garbage Collection of Persistent Heaps 1993 LIBTR Nettles & O'Toole & Pierce & Haines, Replication-based Incremental Copying Collection 1993 LIBTR Baumslag, An Algebraic Analysis of the Connectivity of deBruijn and Shuffle-Exchange Digraphs 1993 LIBTR Behrendt & Compton, Optimization Problems: Expressibility, Approximation Properties and Expected Asymptotic Growth of Optimal Solutions 1993 LIBTR Bertoni & Dorigo, Implicit Parallelism in Genetic Algorithms 1993 LIBTR Beguelin & Seligman, Causality-preserving Timestamps in Distributed Programs 1993 LIBTR Harper, A Simplified Account of Polymorphic References 1993 LIBTR Rubinfeld & Zippel, A New Modular Interpolation Algorithm for Factoring Multivariate Polynomials 1993 LIBTR Reiter & Birman & van Renesse, Fault-tolerant Key Distribution (preliminary version) 1993 LIBTR Henzinger & Manna & Pnueli, Temporal Proof Methodologies for Timed Transition Systems 1993 LIBTR Salton & Allan & Buckley, Approaches to Passage Retrieval in Full Text Information Systems 1993 LIBTR Maelbrancke & Olivie, Dynamic Tree Rebalancing Using Recurrent Rotations 1993 LIBTR Willson & Shafer, What is the Center of the Image? 1993 LIBTR Blelloch & Hardwick, Class Notes: Programming Parallel Algorithms CS 15-840B (Fall 1992) 1993 LIBTR Wisniewski & Kontothanassis & Scott, Scalable Spin Locks for Multiprogrammed Systems 1993 LIBTR Crowl & Crovella & LeBlanc & Scott, Beyond Data Parallelism: The Advantages of Multiple Parallelizations in Combinatorial Search 1993 LIBTR Hemachandra, Fault-tolerance and Complexity 1993 LIBTR Cai & Hemachandra & Vyskoc, Promises and Fault-tolerant Database Access 1993 LIBTR Macarie, Closure Properties of Stochastic Languages 1993 LIBTR Cypher & Konstantinidou, Bounds on the Efficiency of Message-passing Protocols for Parallel Computers 1993 LIBTR Szelepcsenyi, Beta_k-complete Problems and Greediness 1993 LIBTR Greenberg & Oh, Packet Routing in Networks with Long Wires 1993 LIBTR Ja'Ja' & Ryu, An Efficient Parallel Algorithm for the Single Function Coarsest Partition Problem 1993 LIBTR Kelly & Pugh, A Framework for Unifying Reordering Transformations 1993 LIBTR Kim & Kim & Ryu, Constructing a Centroid Tree of a Tree in Parallel 1993 LIBTR Smith & Tygar, Signed Vector Timestamps: A Secure Protocol for Partial Order Time 1993 LIBTR Tygar & Yee, Cryptography: It's Not Just for Electronic Mail Anymore 1993 LIBTR Arya & Mount, Algorithms for Fast Vector Quantization 1993 LIBTR Lamport, How to Write a Proof 1993 LIBTR Abadi, Baby Modula-3 and a Theory of Objects 1993 LIBTR Lamport, How To Make a Correct Multiprocess Program Execute Correctly on a Multiprocessor 1993 LIBTR Kamel & Faloutsos, Hilbert R-tree: An Improved R-tree Using Fractals 1993 LIBTR Fernandez & Lobo, A Proof Procedure for Stable Theorems 1993 LIBTR Ganesan & Sherman, Statistical Techniques for Language Recognition: An Introduction and Guide for Cryptanalysts 1993 LIBTR Greenberg & Shih, Single-layer Channel Routing and Placement with Single-sided Nets on One Side 1992 LIBTR Maydan, Accurate Analysis of Array References 1992 LIBTR Wu & Manber & Myers, A Sub-quadratic Algorithm for Approximate Limited Expression Matching 1992 LIBTR Kececioglu & Myers, Combinatorial Algorithms for DNA Sequence Assembly 1992 LIBTR Knight & Myers, Super-Pattern Matching 1992 LIBTR Landau & Immerman, The Similarities (and Differences) between Polynomials and Integers 1992 LIBTR Bhatt & Chung & Leighton & Rosenberg, Salvage-Embeddings of Complete Trees 1992 LIBTR Qiu & Fragopoulou & Akl, On the Tree Structure of the Star Graph 1992 LIBTR Qiu & Meijer & Akl, On the Cycle Structure of Star Graphs 1992 LIBTR Wu, Approximate Pattern Matching and its Applications 1992 LIBTR Liu & Scott, Multi-level Fractal Block Coding 1992 LIBTR Scott, The Ultimate Random Number Generator 1992 LIBTR Scott & Shafa'Amry, Implementing an Identity-based Key Exchange Algorithm 1992 LIBTR Shafa'Amry & Scott, On the Identity-based Key Exchange Protocol 1992 LIBTR Binau, Mutual Exclusion in a Token Ring in C++: Program and Proof 1992 LIBTR Fyfe, Invariance Hints and the VC Dimension 1992 LIBTR Ladner & LaMarca & Tempero, Counting Protocols for Reliable End-to-End Transmission 1992 LIBTR Newlands, Teaching Programming to First Year Students 1992 LIBTR Eppstein, Sets of Points with Many Halving Lines 1992 LIBTR Scherson & Chien, Least Common Ancestor Networks 1992 LIBTR Eppstein, Speed-ups in Constructive Solid Geometry 1992 LIBTR Li & Morris, A Non-deterministic Parallel Sorting Algorithm 1992 LIBTR Brinch Hansen, Simulated Annealing 1992 LIBTR Brinch Hansen, Primality Testing 1992 LIBTR Culler & Karp & Patterson & Sahay & Schauser & Santos & Subramonian & von Eicken, LogP: Towards a Realistic Model of Parallel Computation 1992 LIBTR Dwork & Herlihy & Plotkin & Waarts, Time-Lapse Snapshots 1992 LIBTR Lakhotia, Understanding Someone Else's Code: Analysis of Experiences 1992 LIBTR Bar-Noy & Kipnis, Multiple Message Broadcasting in the Postal Model 1992 LIBTR Dai & Imai & Iwano & Katoh & Ohtsuka & Yoshimura, A New Unified Approximate Approach to the Minimum Cut Problem and its Variants Using Minimum Range Cut Algorithms 1992 LIBTR McKenzie & Peladeau & Therien, NC^1: The Automata-theoretic Viewpoint 1992 LIBTR Winograd, Computer, Ethics and Social Responsibility 1992 LIBTR Juedes & Lathrop & Lutz, Computational Depth and Reducibility 1992 LIBTR Lutz & Mayordomo, Cook versus Karp-Levin: Separating Completeness Notions if NP is not Small 1992 LIBTR Juedes & Lutz, The Complexity and Distribution of Hard Problems 1992 LIBTR Agarwala & Fernandez-Baca & Slutzki, Fast Algorithms for Inferring Evolutionary Trees 1992 LIBTR Book & Lutz & Wagner, An Observation on Probability versus Randomness with Applications to Complexity Classes 1992 LIBTR Lutz & Mayordomo, Measure, Stochasticity, and the Density of Hard Languages 1992 LIBTR Juedes & Lutz, Kolmagorov Complexity, Complexity Cores, and the Distribution of Hardness 1992 LIBTR Lutz, One-way Functions and Balanced NP 1992 LIBTR Book & Lutz, On Languages with Very High Information Content 1992 LIBTR Baker & Fernandes-Baca & Leavens, Course Specifications for New Introductory Courses: Computer Science 227X and 228X 1992 LIBTR Gupta, On Bounded-Probability Operators and C P^1 1992 LIBTR Cohen & Ofek, Self-termination Mechanism for Label Swapping Routine 1992 LIBTR Goldberg & Jerrum, A Sub-logarithmic Communication Algorithm for the Completely Connected Optical Communication Parallel Computer 1992 LIBTR Berezner & Krutina & Malyshev, Exponential Convergence of One-Dimensional Toom's Probabilistic Cellular Automata 1992 LIBTR Lavallee & Duong, A Parallel Probabilistic Algorithm to Find All Vertices of a Polytope 1992 LIBTR Louchard & Szpankowski, A Probabilistic Analysis of a String Edit Problem 1992 LIBTR Doherty, A Constraint-based Approach to Proof Procedures for Multi-valued Logics 1992 LIBTR Livesey & Moses, Serialisability in Distributed Multiprocessors 1992 LIBTR Livesey & Moses, Strict Serialisability is NP-Complete 1992 LIBTR Badouel & Wuthrich & Fiume, An Analysis of Connectivity of k-ary n-Cube m-Diag Interconnection Networks 1992 LIBTR Kortsarz & Peleg, On Choosing a Dense Subgraph 1992 LIBTR Marcus & Peleg, Load Balancing in Quorum Systems 1992 LIBTR Klarlund, Progress Measures, Immediate Determinacy, and a Subset Construction for Tree Automata 1992 LIBTR Allender & Balcazar & Immerman, A First-order Isomorphism Theorem 1992 LIBTR Fyfe, Invariance Hints and the VC Dimension 1992 LIBTR Lin & Vitter, A Theory for Memory-based Learning 1992 LIBTR Ravi & Marathe & Ravi & Rosenkrantz & Hunt, Many Birds with One Stone: Multi-Objective Approximation Algorithms 1992 LIBTR Nodine & Vitter, Optimal Deterministic Sorting on Parallel Disks 1992 LIBTR Nodine & Vitter, Optimal Deterministic Sorting in Parallel Memory Hierarchies 1992 LIBTR Cohen & Battista & Tamassia & Tollis, A Framework for Dynamic Graph Drawing 1992 LIBTR Abiteboul & Kanellakis & Ramaswamy & Waller, Method Schemas 1992 LIBTR Ravi & Klein, When Cycles Collapse: A General Approximation Technique for Constrained Two-connectivity Problems 1992 LIBTR Lin & Vitter, e-Approximations with Minimum Packing Constraint Violation 1992 LIBTR Hoang, A Systolic Array for the Sequence Alignment Problem 1992 LIBTR Ravi, Approximation Algorithms for Steiner Augmentations for Two-connectivity 1992 LIBTR Kanevsky, On Upper Bound and Representation of Minimum Size Separating Vertex Sets of a Graph 1992 LIBTR Skordos, Time-reversible Maxwell's Demon 1992 LIBTR Bundy, How to Solve It by Induction 1992 LIBTR Gent & Walsh, The Enigma of SAT Hill-climbing Procedures 1992 LIBTR Jagota & Regan, Performance of MAX-CLIQUE Approximation Heuristics under Description-Length Weighted Distributions 1992 LIBTR Green & Kobler & Regan & Schwentick & Toran, The Power of the Middle Bit of a Number-P Function 1992 LIBTR Regan, Linear Time and Memory Efficient Computation 1992 LIBTR Regan & Royer, On Closure Properties of Bounded 2-Sided Error Complexity Classes 1992 LIBTR Abu-Amara & Kanevsky, Algorithms for Leader Election in General Networks 1992 LIBTR Fernandes & Kanevsky, On Recursive Interconnection Networks and their Extensions 1992 LIBTR Liu & Lee, A Distributed Multicast Algorithm for Hypercube Multicomputers 1992 LIBTR Breene, Quadtrees and Hypercubes: Grid Embedding Strategies Based on Spatial Data Structure Addressing 1992 LIBTR Chang & Bhuyan, Parallel Algorithms for Hypercube Allocation 1992 LIBTR Mannava & Ding, Analysis of Wormhole Routing in Multistage Interconnection Networks 1992 LIBTR Vaidya, Degradable Agreement in the Presence of Byzantine Faults 1992 LIBTR Abello & Chen, Some Results in Graph Emulations 1992 LIBTR Abello & Egecioglu & Kumar, A Combinatorial View of Visibility Graphs of Simple Polygons 1992 LIBTR Kanevsky, On Upper Bound and Representation of Minimum Size Separating Vertex Sets of a Graph 1992 LIBTR Zhang & Shasha & Wang, Approximate Tree Matching in the Presence of Variable Length Don't Cares 1992 LIBTR Van Der Meyden, The Complexity of Querying Indefinite Information: Defined Relations, Recursion and Linear Order 1992 LIBTR Culberson, Iterated Greedy Graph Coloring and the Difficulty Landscape 1992 LIBTR Liu & Li, Routing Linear Complement Permutations on Hypercubes 1992 LIBTR Culberson, Genetic Invariance: A New Paradigm for Genetic Algorithm Design 1992 LIBTR Lewchuk, Genetic Invariance: A New Type of Genetic Algorithm 1992 LIBTR Coen, Interactive Program Derivation 1992 LIBTR Paulson, Set Theory as a Computational Logic: I. From Foundations to Functions 1992 LIBTR Jurgensen & Salomaa & Yu, Transducers and the Decidability of Independence in Free Monoids 1992 LIBTR Dassow & Jurgensen, The Transition Monoids of Soliton Trees 1992 LIBTR Calude & Jurgensen & Zimand, The Set of Independent Statements is Topologically Large 1992 LIBTR Calude, Borel Normality and Algorithmic Randomness 1992 LIBTR Cameron & Wood, Maximal Path Length of Binary Trees 1992 LIBTR Cameron & Wood, Binary Trees, Fringe Thickness, and Minimum Path Length 1992 LIBTR Cameron & Wood, Balance in AVL Trees and Space Cost of Brother Trees 1992 LIBTR Cameron & Wood, Red-Black Trees are Insertion Reachable 1992 LIBTR Lai & Wood, A Top-Down Updating Algorithm for Weight-Balanced Trees 1992 LIBTR Bewick & Flynn, Binary Multiplication Using Partially Redundant Multiples 1992 LIBTR Rosenblum, The Design and Implementation of a log-Structured File System 1992 LIBTR Teller & Hohmeyer, Stabbing Oriented Convex Polygons in Randomized O(n^2) Time 1992 LIBTR Subramonian, An O(log n) Time Common CRCW PRAM Algorithm for Minimum Spanning Tree 1992 LIBTR Subramonian, Designing Synchronous Algorithms for Asynchronous Processors 1992 LIBTR Ruppert, A New and Simple Algorithm for Quality 2-dimensional Mesh Generation 1992 LIBTR Demmel, Trading Off Parallelism and Numerical Stability 1992 LIBTR Olson, Fast Alignment by Eliminating Unlikely Matches 1992 LIBTR Kim, Mathematical Findings on Artificial Neural Nets and their Physical Meaning 1992 LIBTR Condon & Hernek, Random Walks in Colored Graphs 1992 LIBTR Ho & Raghunath & Johnsson, An Efficient Algorithm for Gray-to-Binary Permutation on Hypercubes 1992 LIBTR Naor, Constructing Ramsey Graphs from Small Probability Spaces 1992 LIBTR Goldberg, Scaling Algorithms for the Shortest Paths Problem 1992 LIBTR Bruck & Cypher & Gravano & Ho & Ho & Konstantinidou & Upfal & Kipnis & Snir, Survey of Routing Issues for the Vulcan Parallel Computer 1992 LIBTR Halpern & Kapron, Zero-One Laws for Modal Logic 1992 LIBTR Makowsky & Pnueli, Computable Quantifiers and Logics Capturing Complexity Classes (extended abstract) 1992 LIBTR Dinitz, The 3-Edge-Components and a Structural Description of All 3-Edge-Cuts in a Graph 1992 LIBTR Khuller & Naor, Flow in Planar Graphs: A Survey of Recent Results 1992 LIBTR Petrank, The Hardness of Approximation: Gap Location (preliminary version) 1992 LIBTR Biham, New Types of Cryptanalytic Attacks Using Related Keys 1992 LIBTR Ben-Asher & Cohen & Schuster, Efficient Address Decoding for Fast Packet Switching Systems 1992 LIBTR Ben-David & Fraiman, Algorithms for Learning by Distances 1992 LIBTR Bar-On, Fast Parallel LR and QR Algorithms for Symmetric Band Matrices 1992 LIBTR Dolev & Israeli & Moran, Resource Bounds for Self Stabilizing Message Driven Protocols (revised version of TR 641) 1992 LIBTR Blum & Goldreich, Towards a Computational Theory of Statistical Tests 1992 LIBTR Sharell & Makowsky, Probabilistic Lower Bounds for Average Case Complexity 1992 LIBTR Lindenbaum & Fischer & Bruckstein, On Gabor's Contribution to Image Enhancement 1992 LIBTR Bruckstein & Tannenbaum, Some Mathematical Problems in Computer Vision 1992 LIBTR Levinger & Ornan & Itai, Morphological Disambiguation in Hebrew Using A Priori Probabilities 1992 LIBTR Agarwal & Sharir & Toledo, Applications of Parametric Searching in Geometric Optimization 1992 LIBTR Kao & Reif, Searching in an Unknown Environment: An Optimal Randomized Algorithm for the Cow-path Problem 1992 LIBTR Nadathur & Pfenning, Implicit Point Location in Arrangements of Line Segments, with an Application to Motion Planning 1992 LIBTR Tate, Stable Computation of the Complex Roots of Unity 1992 LIBTR Fahmy, Optimal Parallel Evaluation of Matrix Product Expressions 1992 LIBTR Harrison & Khoshnevisan, A New Approach to Recursion Removal 1992 LIBTR Sharp & Cripps, Synthesis of the Fast Fourier Transform Algorithm by Functional Language Program Transformation 1992 LIBTR Sharp & While, Pattern Recognition Using Fractals 1992 LIBTR Geerling, Two Examples of Parallel-Program Derivation: Parallel-Prefix and Matrix Multiplication 1992 LIBTR Larsen, AVL Trees with Relaxed Balance 1992 LIBTR Culler & Karp & Patterson & Sahay & Schauser & Santos & Subramonian & von Eicken, LogP: Towards a Realistic Model of Parallel Computation 1992 LIBTR Karp & Sahay & Santos, Optimal Broadcast and Summation in the LogP Model 1992 LIBTR Asuri & Dillencourt & Eppstein & Lueker & Molodowitch, Fast Optimal Parallel Algorithms for Maximal Matching in Sparse Graphs 1992 LIBTR Alleyne & Scherson, Expanded Delta Networks for Very Large Parallel Computers 1992 LIBTR Eppstein, Offline Algorithms for Dynamic Minimum Spanning Tree Problems 1992 LIBTR Eppstein, Fully Dynamic Maintenance of euclidean Minimum Spanning Trees 1992 LIBTR Eppstein, Connectivity, Graph Minors, and Subgraph Multiplicity 1992 LIBTR Alleyne & Chien & Scherson, Lowest Common Ancestor Interconnection Networks 1992 LIBTR Seiden & Hirschberg, Finding Succinct Ordered Minimal Perfect Hashing Functions 1992 LIBTR Chien & Scherson, Self-routing Lowest Common Ancestor Networks 1992 LIBTR Eppstein & Erickson, New Algorithms for Minimum-Measure Simplices and One-dimensional Weighted Voronoi Diagrams 1992 LIBTR Gemmell, Infinitely Long Walks on 2-colored Graphs which Don't Cover the Graph 1992 LIBTR Dey & Edelsbrunner, Counting Triangle Crossings and Halving Planes 1992 LIBTR Barr & Hickman, Reporting Computational Experiments with Parallel Algorithms: Issues, Measures, and Experts' Opinions 1992 LIBTR Oldehoeft, The Undergraduate Core Computer Science Curriculum at Colorado State University 1992 LIBTR Winograd, Computers, Ethics, and Social Responsibility 1992 LIBTR Rau & Fisher, Instruction-level Parallel Processing: History, Overview and Perspective 1992 LIBTR Kotov, Concurrent Counter Automata 1992 LIBTR Fisher & Rau, Instruction-level Parallel Processing 1992 LIBTR Malitz & Malitz, A Bounded Compactness Theorem for L-Embeddability of Metric Spaces in the Plane 1992 LIBTR Oliver, Decision Graphs -- An Extension of Decision Trees 1992 LIBTR Yee & Allison, Fast String Alignment with Linear Indel Costs 1992 LIBTR Yee & Allison, Reconstruction of Strings Past 1992 LIBTR Balas & Fischetti & Pulleyblank, The Precedence-constrained Asymmetric Traveling Salesman Polytope 1992 LIBTR Zhang, On the Optimality of Randomized Alpha-Beta Search 1992 LIBTR Lockyear & Ebeling, Minimizing the Effect of Clock Skew via Circuit Retiming 1992 LIBTR Andonov & Quinton, Efficient Linear Systolic Array for the Knapsack Problem 1992 LIBTR Greenlaw, Breadth-Depth Search is P-Complete 1992 LIBTR Nitta, Protein Sequence Analysis by Parallel Inference Machine 1992 LIBTR Schroder & Stewart, On Infinitely Many Algorithms for Solving Equations 1992 LIBTR Wilson & Latombe & Lozano-Perez, On the Complexity of Partitioning an Assembly 1992 LIBTR Badouel & Wuthrich & Fiume, An Analysis of Connectivity of k-ary n-Cube m-Diag Interconnection Networks 1992 LIBTR Kao, Planar Strong Connectivity Helps in Parallel Depth-First Search 1992 LIBTR Tate, Arithmetic Circuit Complexity and Motion Planning 1992 LIBTR Wagner, Evaluating Uniform Expressions within Two Steps of Minimum Parallel Time 1992 LIBTR Agarwal & Matousek, On Range Searching with Semialgebraic Sets 1992 LIBTR Wagner & Landis, A Method for Deriving Systolic Algorithms 1992 LIBTR Schmidt & Suda, A Perfect Hash Function Generator 1992 LIBTR Ali & Farhat, A Graph Theoretic Approach for Testing VLSI Circuits 1992 LIBTR Dement & Srimani, A New Algorithm for K Mutual Exclusion in Distributed Systems 1992 LIBTR Sur & Srimani, A Self-stabilizing Algorithm for Coloring Bipartite Graphs 1992 LIBTR Murray & Rosenthal, On the Computational Intractability of Analytic Tableau Methods 1992 LIBTR Balaban & Murray, Time Structures: An Interleaved Temporal-Hierarchical Language for Processing Temporal Knowledge 1992 LIBTR Ramesh & Becker & Murray, On Computing Prime Implicants and Prime Implicates 1992 LIBTR Pan, Linear Time Approximate Evaluation of a Polynomial at Real Points 1992 LIBTR Hunt, On Solving Systems of Linear Equations and Path Problems for Bounded Treewidth Graphs 1992 LIBTR Ravi, Many Birds with One Stone: Multi-objective Approximation Algorithms 1992 LIBTR Stearns & Hunt, An Algebraic Model for Combinatorial Problems 1992 LIBTR Cohn & Riskin & Ladner, Theory and Practice of Vector Quantizers Trained on Small Training Sets 1992 LIBTR Allison, A Fast Algorithm for the Optimal Alignment of Three Strings 1992 LIBTR Teillaud, Towards Dynamic Randomized Algorithms in Computational Geometry 1992 LIBTR Flajolet & Gao & Odlyzko & Richmond, The Distribution of Heights of Binary Trees and Other Simple Trees 1992 LIBTR Pertel, A Critique of Adaptive Routing 1992 LIBTR Pertel, Mesh Distance Formulae 1992 LIBTR Spuler & Gupta, An Empirical Study of Nearly Optimal Binary Search Trees and Split Trees 1992 LIBTR Spuler, The Best Algorithm for Searching a Binary Search Tree 1992 LIBTR Spuler, The Optimal Binary Search Tree for Andersson's Search Algorithm 1992 LIBTR Spuler, Two-way Comparison Search Trees a Generalization of Binary Search Trees and Split Trees 1992 LIBTR Spuler & Gupta, Binary Split Tree Insertion and Deletion Algorithms 1992 LIBTR Saluja & Subrahmanyam & Thakur, Descriptive Complexity of #P Functions 1992 LIBTR Zhu & Mutchler, A Technique for Generating a New Algorithm from an Existing One 1992 LIBTR Littlestone & Warmuth, The Weighted Majority Algorithm 1992 LIBTR Long, Sorting and Searching with a Faulty Comparison Oracle 1992 LIBTR Haussler, Sphere Packing Numbers for Subsets of the Boolean n-Cube with Bounded Vapnik-Chervonenkis Dimension 1992 LIBTR Zhong & Lo, Application-specific Deadlock Free Wormhole Routing on Multicomputers 1992 LIBTR Zhong & Lo, An Efficient Heuristic for Application-specific Routing on Mesh Connected Multiprocessors 1992 LIBTR Lo, Temporal Communication Graphs: Lamport's Process-Time Graphs Augmented for the Purpose of Mapping and Scheduling 1992 LIBTR Luks, Computing in Solvable Matrix Groups 1992 LIBTR Lo & Rajopadhye & Telle & Zhong, Parallel Divide and Conquer on Meshes 1992 LIBTR Sawada & Takenaga & Yajima, On the Relations between Binary Decision Diagrams, Turing Machines and Combinational Logic Circuits 1992 LIBTR Takagi, A Modular Multiplication Algorithm with Triangle Additions 1992 LIBTR Yajima, Regular Constant-Depth Circuits Characterized by Pseudo-definite Automata 1992 LIBTR Breslauer, Saving Comparisons in the Crochemore-Perrin String Matching Algorithm 1992 LIBTR Breslauer, An On-line String Superprimitivity Test 1992 LIBTR Breslauer, Fast Parallel String Prefix-matching 1992 LIBTR Breslauer & Colussi & Toniolo, Tight Comparison Bounds for the String Prefix-matching Problem 1992 LIBTR Breslauer, Testing String Superprimitivity in Parallel 1992 LIBTR Franklin & Yung, Communication Complexity of Secure Distributed Computing 1992 LIBTR Breslauer & Galil, A Lower Bound for Parallel String Matching 1992 LIBTR Breslauer & Galil, Parallel String Matching Algorithms 1992 LIBTR Breslauer, Efficient String Algorithmics (Ph.D. thesis) 1992 LIBTR Nguyen & Kreinovich & Lea, How to Combine Probabilistic and Fuzzy Uncertainties in Fuzzy Control 1992 LIBTR Nguyen & Kreinovich & Tolbert, On Robustness of Fuzzy Logics 1992 LIBTR Pal & Kreinovich, An Optimal Choice of an Entropy-like Function for Image Processing 1992 LIBTR Chokr & Kamoroff & Kreinovich, Possible Worlds Semantics of Probabilistic Uncertainty Unexpectedly Leads to a Maximum Entropy Approach 1992 LIBTR Sparaggis & Cassandras & Towsley, On the Duality between Routing and Scheduling Systems with Finite Buffer Space 1992 LIBTR Zhang, Complexity of Symmetric Functions in Perceptron-like Models 1992 LIBTR Holloway, An Annotated Bibliography of Algorithms Applicable to Molecular Biology 1992 LIBTR Goldman & Mathias, Learning k-Term DNF Formulas with an Incomplete Oracle 1992 LIBTR Witte, The CLOS Network as a Multirate Distributor with a Greedy Routing Algorithm 1992 LIBTR Goldman & Sloan, Can PAC Learning Algorithms Tolerate Random Attribute Noise? 1992 LIBTR Goldman & Kearns, On the Complexity of Teaching 1992 LIBTR Gillett, DNA Mapping Algorithms: Strategies for Single Restriction Enzyme and Multiple Restriction Enzyme Mapping 1992 LIBTR Goldman & Kearns & Schapire, On the Sample Complexity of Weakly Learning 1992 LIBTR Cypher & Gravano, Storage-efficient, Deadlock-free Packet Routing Algorithms for Torus Networks 1992 LIBTR Johnsson & Ho, Binary Cube Emulation of Butterfly Networks Encoded by Gray Code 1992 LIBTR Coppersmith, The Data Encryption Standard (DES) and its Strength against Attacks 1992 LIBTR Warren, Changing Division by a Constant to Multiplication in Two's-Complement Arithmetic 1992 LIBTR Hededus & Megiddo, On the Geometric Separability of Boolean Functions 1992 LIBTR Johnsson, Optimal Communication Channel Utilization for Matrix Transposition and Related Permutations on Binary Cubes 1992 LIBTR Valiant, Why BSP Computers? 1992 LIBTR Valiant, A Combining Mechanism for Parallel Computers 1992 LIBTR Shieber, Lessons from a Restricted Turing Test 1992 LIBTR Ho & Johnsson & Raghunath, An Efficient Algorithm for Gray-to-Binary Permutation on Hypercubes 1992 LIBTR Naor & Roth, Optimal File Sharing in Distributed Networks 1992 LIBTR Raghavan & Felperin & Upfal, A Theory of Wormhole Routing in Parallel Computers 1992 LIBTR Felperin & Raghavan & Upfal, An Experimental Study of Wormhole Routing in Parallel Computers 1992 LIBTR Blaum & Bruck, Coding for Delay-insensitive Communication with Partial Synchronization 1992 LIBTR DeMichiel, An Introduction to CLOS 1992 LIBTR Hancock, The Complexity of Learning Formulas and Decision Trees that Have Restricted Reads 1992 LIBTR Larsen, Length of Maximal Common Subsequences 1992 LIBTR Andersen, Local Computation of Simultaneous Fixed-points 1992 LIBTR Larsen, Strategies for Expression Evaluation Using Sort-Merge Algorithms 1992 LIBTR Boyar & Larsen, Efficient Rebalancing of Chromatic Search Trees 1992 LIBTR Arge & Knudsen & Larsen, A General Lower Bound on the I/O-Complexity of Comparison-based Algorithms 1992 LIBTR Kozen, Partial Automata and Finitely Generated Congruences: An Extension of Nerode's Theorem 1992 LIBTR Bro Miltersen, The Bit Probe Complexity Measure Revisited 1992 LIBTR Pedersen, Distributed Provers and Verifiable Secret Sharing Based on the Discrete Logarithm Problem 1992 LIBTR Boyar & Fich & Larsen, Bounds on Certain Multiplications of Affine Combinations 1992 LIBTR Koenig & Simmons, Complexity Analysis of Real-time Reinforcement Learning Applied to Finding Shortest Paths in Deterministic Domains 1992 LIBTR Tan, Optimal Two-dimensional Triangulations 1992 LIBTR Barnes, Time-Space Tradeoffs for Graph s-t Connectivity 1992 LIBTR Peris, Fast Modular Arithmetic on Permutation Networks 1992 LIBTR Lin, Unified Algebraic Computations on Cyclic Permutation Networks 1992 LIBTR Czumaj, Parallel Algorithm for the Matrix Chain Product Problem 1992 LIBTR Ravindran & Gibbons, Dense Edge-disjoint Embedding of Complete Binary Trees in the Hypercube 1992 LIBTR Czumaj, An Optimal Parallel Algorithm for Computing a Near-Optimal Order of Matrix Multiplications 1992 LIBTR Mavronicolas, Efficiency of Semi-synchronous versus Asynchronous Systems: Atomic Shared Memory 1992 LIBTR Gerbessiotis & Valiant, Direct Bulk-Synchronous Parallel Algorithms 1992 LIBTR Goldwasser & Ostrovsky, Invariant Signatures and Non-Interactive Zero-Knowledge Proofs are Equivalent 1992 LIBTR Naor & Ostrovsky & Venkatesan & Yung, Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions 1992 LIBTR Goldmann & Karpinski, Simulating Threshold Circuits by Majority Circuits 1992 LIBTR Grigoriev & Karpinski, Computation of the Additive Complexity of Algebraic Circuits with Root Extracting 1992 LIBTR Karpinski & Verbeek, On Randomized versus Deterministic Computation 1992 LIBTR Pan, Approximate Evaluation of a Polynomial on a Set of Real Points 1992 LIBTR Frieze & Karp & Reed, When is the Assignment Bound Tight for the Asymmetric Traveling-Salesman Problem? 1992 LIBTR Ausiello & Italiano & Nanni, Optimal Traversal of Directed Hypergraphs 1992 LIBTR Dahlhaus & Karpinski & Kelsen, An Efficient Parallel Algorithm for Computing a Maximal Independent Set in a Hypergraph of Dimension 3 1992 LIBTR Burgisser & Karpinski & Lickteig, On Randomized Algebraic Test Complexity 1992 LIBTR Herzberg & Luby, Public Randomness in Cryptography 1992 LIBTR Alizadeh & Newberg & Karp & Weisser, Physical Mapping of Chromosomes: A Combinatorial Problem in Molecular Biology 1992 LIBTR El-Yaniv & Fiat & Karp & Turpin, Competitive Analysis of Financial Games 1992 LIBTR Pan, Can We Utilize the Cancellation of the Most Significant Digits? 1992 LIBTR Pan & Sadikou & Landowne & Tiga, A New Approach to Fast Polynomial Interpolation and Multipoint Evaluation 1992 LIBTR Weihrauch, The Degrees of Discontinuity of Some Translators between Representations of the Real Numbers 1992 LIBTR Karp, On-line Algorithms versus Off-line Algorithms: How Much is it Worth to Know the Future? 1992 LIBTR Pan, The NC Equivalence of Integer Linear Programming and Euclidean GCD 1992 LIBTR Voigt, Fuzzy Evolutionary Algorithms 1992 LIBTR Ar & Blum & Codenotti & Gemmell, Checking Approximate Computations over the Reals 1992 LIBTR Haussler, Decision Theoretic Generalizations of the PAC Model for Neural Net and Other Learning Applications 1992 LIBTR Pitassi, The Power of Weak Formal Systems 1992 LIBTR Zhang & Barrington & Tarui, Computing Symmetric Functions with AND/OR Circuits and a Single MAJORITY Gate 1992 LIBTR Setubal, Implementations and Variations of a Maximum-Flow Algorithm 1992 LIBTR Chien & Oruc, Adaptive Binary Sorting Schemes and Associated Interconnection Networks 1992 LIBTR Muller, Lecture Notes on Domain Theory 1992 LIBTR Schabes & Shieber, An Alternative Conception of Tree-adjoining Derivation 1992 LIBTR Mavronicolas, Timing-based, Distributed Computation: Algorithms and Impossibility Results 1992 LIBTR Mavronicolas, An Upper and a Lower Bound for Tick Synchronization 1992 LIBTR Pan, Improved Parallel Computations with Toeplitz-like and Hankel-like Matrices 1992 LIBTR Immerman & Landau, The Complexity of Interated Multiplication 1992 LIBTR Tiwari & Tompa, A Direct Version of Shamir and Snir's Lower Bounds on Monotone Circuit Depth 1992 LIBTR Hirsh, The Computational Complexity of the Candidate-Elimination Algorithm 1992 LIBTR Klawe, Bringing Mathematical Research to Life in the Schools 1992 LIBTR Schwartz & Emtage & Kahle & Neuman, A Comparison of Internet Resource Discovery Approaches 1992 LIBTR Khaira & Miller & Sheffler, Nested Dissection: A Survey and Comparison of Various Nested Dissection Algorithms 1992 LIBTR Boissonnat & Geiger, Three Dimensional Reconstruction of Complex Shapes Based on the Delaunay Triangulation 1992 LIBTR Dam, Fixpoints of Buchi Automata 1992 LIBTR Bar-Noy & Kipnis & Schieber, An Optimal Algorithm for Computing Census Functions in Message-passing Systems 1992 LIBTR Cristian & Aghili & Strong, Clock Synchronization in the Presence of Omission and Performance Failures, and Processor Joins 1992 LIBTR Shub, Theory and Practice in Computer Sciences -- Past, Present and Future 1992 LIBTR Bshouty & Mansour & Schieber & Tiwari, Fast Exponentiation Using the Truncation Operation 1992 LIBTR Coppersmith, Two Broken Hash Functions 1992 LIBTR Bellare & Goldreich, On Defining Proofs of Knowledge 1992 LIBTR Bellare & Yung, Certifying Cryptographic Tools: The Case of Trapdoor Permutations 1992 LIBTR Edelman & Kostlan & Shub, How Many Eigenvalues of a Random Matrix are Real? 1992 LIBTR Tien & Ho & Yang, Edge-disjoint Spanning Trees in Incomplete Hypercubes 1992 LIBTR Dwork & Feige & Kilian & Naor & Safra, Low Communication 2-prover Zero-knowledge Proofs for NP 1992 LIBTR Berkman & Schieber & Vishkin, A Fast Parallel Algorithm for Finding the Convex Hull of a Sorted Point Set 1992 LIBTR Fiat & Rabani & Ravid, A Deterministic O(k^3)-competitive k-server Algorithm for the Circle 1992 LIBTR Alon & Kalai & Ricklin & Stockmeyer, Lower Bounds on the Competitive Ratio for Mobile User Tracking and Distributed Job Scheduling 1992 LIBTR Chaitin, Randomness in Arithmetic and the Decline and Fall of Reductionism in Pure Mathematics 1992 LIBTR Ajtai, First-order Properties of Random Substructures 1992 LIBTR Bruck & Cypher & Ho, Wildcard Dimensions, Coding Theory and Fault-tolerant Meshes and Hypercubes 1992 LIBTR Aggarwal & Kipnis, Message-Time Tradeoff for Combining Data in Message-passing Systems 1992 LIBTR Bar-Noy & Kipnis, Broadcasting Multiple Messages in Simultaneous Send/Receive Systems 1992 LIBTR Abiteboul & Vardi & Vianu, Computing with Infiniatry Logic 1992 LIBTR Mayer & Stockmeyer, The Complexity of Word Problems -- This Time with Interleaving 1992 LIBTR Ferrante & Gao & Midkiff & Schonberg, A Critical Survey of Automatic Data Partitioning 1992 LIBTR Stankovic, Distributed Computing 1992 LIBTR Girkar & Moll, Bounds on Chain Lengths for Collections of Non-negative Lattice Points in n-Space 1992 LIBTR Leighton & Malitz, Separators and Hypercube Embeddings 1992 LIBTR Goldberg & Plotkin, Lecture Notes: Topics in Combinatorial Optimization 1992 LIBTR Kharitonov, Cryptographic Hardness of Distributed-Specific Learning 1992 LIBTR Goldberg, An Efficient Implementation of a Scaling Minimum-Cost Flow Algorithm 1992 LIBTR Mathies, Paths in Graphs and Parallel Computing 1992 LIBTR Acharya, Reflected Number Systems 1992 LIBTR Arakawa & Krotkov, Fractal Surface Reconstruction with Uncertainty Estimation: Modeling Natural Terrain 1992 LIBTR Bhatt & Chung & Leighton & Rosenberg, Tolerating Faults in Synchronization Networks 1992 LIBTR Pfenning, A Proof of the Church-Rosser Theorem and its Representation in a Logical Framework 1992 LIBTR Niedermeier & Rossmanith, Optimal Parallel Algorithms for Computing Recursively Defined Functions 1992 LIBTR Radzik, Algorithms for Some Linear and Fractional Combinatorial Optimization Problems 1992 LIBTR Aspnes, Wait-free Consensus 1992 LIBTR Chiang & Tamassia, Dynamization of the Trapezoid Method for Planar Point Location in Monotone Subdivisions 1992 LIBTR Chiang & Preparata & Tamassia, A Unified Approach to Dynamic Point Location, Ray Shooting and Shortest Paths in Planar Maps 1992 LIBTR Goodman & Pollack, Allowable Sequences and Order Types in Discrete and Computational Geometry 1992 LIBTR Hansen & Roberts, An Impossibility Result in Axiomatic Location Theory 1992 LIBTR Bjorner & Lovasz & Yao, Linear Decision Trees: Volume Estimates and Topological Bounds 1992 LIBTR Khachiyan, Diagonal Matrix Scaling is NP-Hard 1992 LIBTR Abeledo & Rothblum, Courtship and Linear Programming 1992 LIBTR Boros & Crama & Hammer & Saks, A Complexity Index for Satisfiability Problems 1992 LIBTR Hastad & Lagarias & Odlyzko, On the Distribution of Multiplicative Translates of Sets of Residues (mod p) 1992 LIBTR Lagarias & Shor, Keller's Cube-tiling Conjecture is False in High Dimensions 1992 LIBTR Kahn, On a Problem of Erdos and Lovasz II: n(r) = 0(r) 1992 LIBTR Allender & Bruschi & Pighizzini, The Complexity of Computing Maximal Word Functions 1992 LIBTR Majewski & Wormald & Czech & Havas, A Family of Generators of Minimal Perfect Hash Functions 1992 LIBTR Fishburn, Convex Polygons with Few Vertices 1992 LIBTR Fishburn, Convex Polygons with Few Intervertex Distances 1992 LIBTR Boros & Hammer & Hartmann & Shamir, Balancing Problems in Acyclic Networks 1992 LIBTR Czech & Havas & Majewski, An Optimal Algorithm for Generating Minimal Perfect Hash Functions 1992 LIBTR Chvatal & Reed, Mick Gets Some (The Odds Are On His Side) 1992 LIBTR Chvatal, Lecture Notes on the New AKS Sorting Network 1992 LIBTR Allender & Gore, A Uniform Circuit Lower Bound for the Permanent 1992 LIBTR Amir & Farach & Idury & Poutre & Schaffer, Improved Dynamic Dictionary Matching 1992 LIBTR Buchsbaum & Sundar & Tarjan, Data Structural Bootstrapping, Linear Path Compression, and Catenable Heap Ordered Double Ended Queues 1992 LIBTR Bershad & Redell & Ellis, Fast Mutual Exclusion for Uniprocessors 1992 LIBTR Berman & DasGupta, Results on Approximation of the Rectilinear Polygon Cover Problem (preliminary version) 1992 LIBTR Berman & Kovoor & Pardalos, A Linear-Time Algorithm for the Least-Distance Problem 1992 LIBTR Berman & Fujito, A 2/3-Approximation of the Matroid Matching Problem 1992 LIBTR Furer & Subramanian, Coloring Random Graphs 1992 LIBTR Furer & Raghavachari, Approximating the Minimum Degree Spanning and Steiner Trees To Within One from the Optimal Degree 1992 LIBTR DasGupta & Schnitger, Efficient Approximation with Neural Networks: A Comparison of Gate Functions 1992 LIBTR Berman & Bharali, Quick Atomic Broadcast (preliminary version) 1992 LIBTR Feige & Raghavan & Peleg & Upfal, Computing with Noisy Information 1992 LIBTR Alpern & Carter & Feig & Selker, The Uniform Memory Hierarchy Model of Computation 1992 LIBTR Bellare & Goldwasser, The Complexity of Decision versus Search 1992 LIBTR Abolhassan & Keller & Scheerer, Optimal Sorting in Linear Arrays with Minimum Global Control 1992 LIBTR Li & Vitanyi, Mathematical Theory of Thermodynamics of Computation 1992 LIBTR Tromp, On Update-Last Schemes 1992 LIBTR Breslauer & Galil, Finding All Periods and Initial Palindromes of a String in Parallel 1992 LIBTR Cross & Drefenstedt & Keller, Reduction of Network Cost and Wiring in Ranade's Butterfly Routing 1992 LIBTR Breslauer & Colussi & Toniolo, Tight Comparison Bounds for the String Prefix-matching Problem 1992 LIBTR Breslauer & Galil, Efficient Comparison Based String Matching 1992 LIBTR Pugh & Wonnacott, Static Analysis of Upper Bounds on Parallelism 1992 LIBTR Kelly & Pugh, Generating Schedules and Code within a Unified Reordering Transformation Framework 1992 LIBTR Blanksteen & Hendler & Nau, Complexity, Decidability and Undecidability Results for Rule-based Expert Systems 1992 LIBTR Vishkin, A Case for the PRAM as a Standard Programmer's Model 1992 LIBTR Bader & Ja'Ja' & Chellappa, Scalable Data Parallel Algorithms for Texture Synthesis and Compression Using Gibbs Random Fields 1992 LIBTR Landau & Vishkin, Pattern Matching in a Digitized Image 1992 LIBTR Faloutsos & Kamel, Packed R-trees Using Fractals 1992 LIBTR Arya & Mount, Asymptotically Efficient Randomized Algorithm for Nearest Neighbor Searching 1992 LIBTR Arya & Mount, Efficient Heuristic for Nearest Neighbor Searching 1992 LIBTR Groselj, Peaksort: A Heapsort with a Twist 1992 LIBTR Harel, How Hard is it To Reason about Propositional Programs? 1992 LIBTR Peleg & Schechtman & Wool, Approximating Bounded 0-1 Integer Linear Programs 1992 LIBTR Kortsarz & Peleg, Approximation Algorithms for Minimum Time Broadcast 1992 LIBTR Bar-Ilan & Kortzarz & Peleg, Greedy Approximation Algorithms 1992 LIBTR Alon & Karp & Peleg & West, A Graph-theoretic Game & Its Application to the k-Server Problem 1992 LIBTR Kortsarz & Peleg, Generating Sparse 2-Spanners 1992 LIBTR Kortsarz & Peleg, Traffic-Light Scheduling on the Grid 1992 LIBTR Feige & Raghavan & Peleg & Upfal, Computing with Noisy Information 1992 LIBTR Garay & Kutten & Peleg, A Sub-Linear Time Distributed Algorithm for Minimum-Weight Spanning Trees 1992 LIBTR Awerbuch & Baratz & Peleg, Efficient Broadcast and Light-weight Spanners 1992 LIBTR Hirst & Harel, Taking it to the Limit: On Infinite Variants of NP-Complete Problems 1992 LIBTR Barabash & Fraenkel & Weiss, Iterated Beatty Functions 1992 LIBTR Kesten & Pnueli, An Efficient Introduction of the Past 1992 LIBTR Feige & Lapidot & Shamir, Multiple Non-interactive Zero Knowledge Proofs under General Assumptions 1992 LIBTR Lapidot & Shamir, Fully Parallelized Multi Prover Protocols for NEXP-time 1992 LIBTR Lapidot & Shamir, A One-round, Two-prover, Zero-knowledge Protocol for NP 1992 LIBTR Etzion-Petruschka & Harel, On the Solvability of Domino Snake Problems 1992 LIBTR Franova, A Constructive Proof for Prime Factorization Theorem: A Result of Putting it Together in Constructive Matching Methodology 1992 LIBTR Cerin & Myoupo, A Linear Systolic Architecture for the Longest Increasing Subsequence Problem 1992 LIBTR Myoupo, Mapping Dynamic Programming onto Modular Linear Systolic Arrays 1992 LIBTR Myoupo & Fabret, Designing Modular Linear Systolic Arrays Using Dependence Graph Regular Partitions 1992 LIBTR Fourneau & Veque, Stochastic Automata Networks Simulation 1992 LIBTR Dufourd & Myoupo & Cerin, An Efficient Parallel Solution for the Longest Increasing Subsequence Problem 1992 LIBTR Yoshikawa, Simulated Annealing: A Survey -Part I- 1992 LIBTR Rajasekaran & McKendall, Randomized Routing and Sorting on the Reconfigurable Mesh 1992 LIBTR Jiang & Li, k One-way Heads Cannot Do String-matching 1992 LIBTR Ibarra & Jiang & Tran & Wang, On the Equivalence of Two-way Pushdown Automata and Counter Machines over Bounded Languages 1992 LIBTR Ibarra & Jiang & Tran & Wang, New Decidability Results Concerning Two-way Counter Machines and Applications 1992 LIBTR Jiang & Li, On the Approximation of Shortest Common Supersequences and Longest Common Subsequences 1992 LIBTR Tucker & Zucker, Theory of Computation over Stream Algebras, and Its Applications 1992 LIBTR Jiang & Li & Du, A Note on Shortest Common Superstrings with Flipping 1992 LIBTR Eiter & Kilpelainen & Mannila, Recognizing Renamable Generalized Propositional Horn Formulas is NP-Complete 1992 LIBTR Chazelle & Matousek, Derandomizing an Output-sensitive Convex Hull Algorithm in Three Dimensions 1992 LIBTR Tay, A Monotonicity Theorem for Tandem Queues 1992 LIBTR Appel, Unrolling Recursions Saves Space 1992 LIBTR Dobkin & Zhao, Optimal Algorithms for Computing Connected Components of Bichromatic Line Segments and Polygons 1992 LIBTR Palios, Decomposition Problems in Computational Geometry (thesis) 1992 LIBTR Pach & Torocsik, Layout of Rooted Trees 1992 LIBTR Schaffer, Analysis of Heapsort 1992 LIBTR Rogers & Reppy & Hendren, Supporting SPMD Execution for Dynamic Data Structures 1992 LIBTR Barber, Computational Geometry with Imprecise Data and Arithmetic 1992 LIBTR Tal & Chazelle & Dobkin, The New-Jersey Line-Segment-Saw Massacre (companion to the video) 1992 LIBTR Sha, Run-Time Fault Tolerance for Array Architectures 1992 LIBTR Bushbaum & Sundar & Tarjan, Data Structural Bootstrapping, Linear Path Compression, and Catenable Heap Ordered Double Ended Queues 1992 LIBTR Cox & Hanrahan, Depth Complexity in Object-Parallel Graphics Architectures 1992 LIBTR Dobkin, Computational Geometry and Computer Graphics 1992 LIBTR Chao & LaPaugh, Finding All Minimal Shapes in a Routing Channel 1992 LIBTR Leighton & Maggs & Sitaraman, On the Fault Tolerance of Some Popular Bounded-degree Networks 1992 LIBTR Fraser & Hanson & Proebsting, Engineering Efficient Code Generators Using Tree Matching and Dynamic Programming 1992 LIBTR Friedman, Probabilistic Spaces of Boolean Functions of a Given Complexity: Generalities and Random k-SAT Coefficients 1992 LIBTR Acharya, Reflected Number Systems 1992 LIBTR Apt & Doets, A New Definition of SLDNF-resolution 1992 LIBTR Kwast & van Denneheuvel, Weak Equivalence: Theory and Applications 1992 LIBTR de Haas & van Emde Boas, Object Oriented Application Flow Graphs and Their Semantics 1992 LIBTR Kyburg, Combinatorial Semantics 1992 LIBTR Ogiwara & Thierauf & Toda & Watanabe, On Closure Properties of #P in the Context of PF % #P 1992 LIBTR Konig & Lazard, Minimum k-Broadcast Graphs 1992 LIBTR Klawe, Shallow Grates 1992 LIBTR Pippenger, Symmetry in Self-correcting Cellular Automata 1992 LIBTR Pippenger, Rearrangeable Circuit-switching Networks 1992 LIBTR Fich, The Complexity of Computation on the Parallel Random Access Machine 1992 LIBTR Bellantoni, Predicative Recursion and Computational Complexity 1992 LIBTR Bach & Peralta, Asymptotic Semi-smoothness Probabilities 1992 LIBTR Lewandowski & Condon & Bach, Realistic Analysis of Parallel Dynamic Programming Algorithms 1992 LIBTR Jiang & Salomaa & Salomaa & Yu, Inclusion is Undecidable for Pattern Languages 1992 LIBTR Jiang & Li, Approximating Shortest Superstrings with Constraints 1992 LIBTR Kieckhafer & Azadmanesh, Reaching Approximate Agreement with Mixed-Mode Faults 1992 LIBTR Fragopoulou, Efficient Algorithms for the Parity Problem on Processor Arrays with Reconfigurable Bus Systems 1992 LIBTR Akl & Stojmenovic, A Simple and Optimal Systolic Algorithm for Generating Permutations 1992 LIBTR Qiu & Akl, Load Balancing and Selection on the Star and Pancake Interconnection Networks 1992 LIBTR Kivinen, Problems in Computational Learning Theory 1992 LIBTR Floreen, Computational Complexity Problems in Neural Associative Memories 1992 LIBTR Kilpelainen, Tree Matching Problems with Applications to Structured Text Databases 1992 LIBTR Higham & Schenk, Maintaining b-Trees on an EREW PRAM 1992 LIBTR Alur & Henzinger, Real-time Logics: Complexity and Expressiveness 1992 LIBTR Alur & Henzinger, A Really Temporal Logic 1992 LIBTR Henzinger, Sooner is Safer than Later 1992 LIBTR Budhiraja & Marzullo, Tradeoffs in Implementing Primary-Backup Protocols 1992 LIBTR Schmidt & Siegel & Srinivasan, Chernoff-Hoeffding Bounds for Applications with Limited Independence 1992 LIBTR Huttenlocher & Kleinberg, Comparing Point Sets under Projection 1992 LIBTR Huttenlocher & Rucklidge, A Multi-Resolution Technique for Comparing Images Using the Hausdorff Distance 1992 LIBTR Webber, Thinning Context-free Languages 1992 LIBTR Kleinberg, Algorithms for On-line Navigation 1992 LIBTR Kalpakis & Yesha, Optimal within a Constant Schedules for Forest dags on Parallel Architectures 1992 LIBTR Khuller & Vishkin & Young, A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Cover 1992 LIBTR Schroder, On Infinitely Many Algorithms for Solving Equations 1992 LIBTR Ferguson, Touring Machines: Autonomous Agents with Attitudes 1992 LIBTR Ferguson, Touring Machines: An Architecture for Dynamic, Rational, Mobile Agents 1992 LIBTR Francez, Contrastive Logic (revised version of TR 668) 1992 LIBTR Finkelshtein & Markovitch, Selective Utilization of Macro Operators: A Learning Program Solves the General N x N Puzzle 1992 LIBTR Litow & Dumas, Additive Cellular Automata and Algebraic Series 1992 LIBTR Seznec & Jegou & Lenfant, Prime Memory Systems Do Not Require Euclidean Division by a Prime Number 1992 LIBTR Lischke, The Quality of Separation Between NP and Exponential Time; Reducing the Cases 1992 LIBTR Ar & Blum & Codenotti & Gemmell, Checking Approximate Computations over the Reals 1992 LIBTR Chvatal, Lecture Notes on the New AKS Sorting Network 1992 LIBTR Breslauer, Fast Parallel String Prefix-Matching 1992 LIBTR Miltersen & Paterson & Tarui, The Asymptotic Complexity of Merging Networks (extended abstract) 1992 LIBTR Dain, Minimum Distance Error Recovery for LR Parsers 1992 LIBTR Paterson & Zwick, Shallow Multiplication Circuits and Wise Financial Investments 1992 LIBTR Gibbons & Paterson, Dense Edge-Disjoint Embedding of Binary Trees in the Mesh 1992 LIBTR Fischer & Paterson, Fishspear: A Priority Queue Algorithm 1992 LIBTR Raman, Eliminating Amortization: On Data Structures with Guaranteed Response Time 1992 LIBTR Han & Hemachandra & Thierauf, Threshold Computation and Cryptographic Security 1992 LIBTR Brown & Hershberger (Eds.), Animation of Geometric Algorithms: A Video Review 1992 LIBTR Barnes & Ruzzo & Buss & Schieber, A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity 1992 LIBTR Felten & Rabinovich, A Centralized Token-based Algorithm for Distributed Mutual Exclusion 1992 LIBTR Condon & Ladner, interactive Proof Systems with Polynomially Bounded Strategies 1992 LIBTR Tanimoto, Learning Mathematics via Image Processing: A Rationale and a Research Direction 1992 LIBTR Rangarajan & Huang & Tripathi, Computing Reliability Intervals for k-Resilient Protocols 1992 LIBTR Unger & Moult, Why Genetic Algorithms are Suitable for Protein Folding Analysis: The Theoretical Foundations 1992 LIBTR Tian, Understanding and Using Program Complexity to Improve Software Development 1992 LIBTR Bonatti & Kraus & Subrahmanian, Foundations of Secure Deductive Databases 1992 LIBTR Nagulapalli, Fault Diagnosis and Fault Tolerant Strategies for an Adaptive Binary Sorting Network 1992 LIBTR Kalpakis & Yesha, On the Power of the Linear Array Architecture for Performing Tree-structured Computations 1992 LIBTR Alaettinoglu & Shankar & Dussa-Zieger & Matta, Responsiveness of Routing Protocols to Link Failures and Repairs 1992 LIBTR Cheng & Agrawala, Modeling of Cross Traffic in Conjunction with Deterministic Analysis of Virtual Circuits 1992 LIBTR Mukherjee & Tripathi, Performance Analysis of Ring-Connected-Ring Network 1992 LIBTR Guibas & Pellegrini, New Algorithmic Results for Lines-in-3-Space Problems 1992 LIBTR Pellegrini, A New Algorithm for Counting Circular Arc Intersections 1992 LIBTR Fernando, Provably Recursive Programs 1992 LIBTR Clinger & Rees, Revised Report on the Algorithmic Language Scheme 1992 LIBTR Plouzeau & Raynal, Elements for a Course on the Design of Distributed Algorithms 1992 LIBTR Bergeron & Flajolet & Salvy, Varieties of Increasing Trees 1992 LIBTR Dowek, A Second-Order Pattern Matching Algorithm for the Cube of Typed Lambda-Calculi 1992 LIBTR Schaffer & Sedgewick, The Analysis of Heapsort 1992 LIBTR Chao & LaPaugh, Finding All Minimal Shapes in a Routing Channel 1992 LIBTR Peled, Sometimes `Some' is as Good as `All' (preliminary version) 1992 LIBTR Stearns & Hunt, Structure Trees and their Application 1992 LIBTR Miller, What to Draw? When to Draw? An Essay on Parallel Program Visualization 1992 LIBTR Sheu & Long, UP and the Low and High Hierarchies: A Relativized Separation 1992 LIBTR Akl & Stojmenovic, Generating Binary Trees in Parallel 1992 LIBTR Singh, Leader Election in Complete Networks 1992 LIBTR Agrawal & Rangarajan & Tripathi, Probabilistic Clock Synchronization in the Presence of Failures 1992 LIBTR Khuller & Raghavachari & Young, Balancing Minimum Spanning and Shortest Path Trees 1992 LIBTR Lee & Oruc, Fast Parallel Algorithms for Routing One-to-One Assignments in Benes Networks 1992 LIBTR Sherman & Kalpakis, Probabilistic Analysis of an Enhanced Partitioning Algorithm for the Steiner Tree Problem in Rd 1992 LIBTR Lin & Oruc, Constant Time Inner Product and Matrix Computations on Permutation Network Processors 1992 LIBTR Greenberg & Ja'Ja' & Krishnamurthy, On the Difficulty of Manhattan Channel Routing 1992 LIBTR Verschelde & Cools, Symmetric Homotopy Construction 1992 LIBTR Mehldau & Myers, A System for Pattern Matching Applications on Biosequences 1992 LIBTR Fekete & Kay & Kingston, Teaching Exceptionally Able Students in a Mass CS1 Course 1992 LIBTR Hell & Manoussakis & Tuza, Packing Problems in Edge-Colored Graphs 1992 LIBTR Bouabdallah, On Mutual Exclusion in Faulty Distributed Systems 1992 LIBTR Narayanan, Selection, Sorting, and Routing on Mesh-connected Processor Arrays 1992 LIBTR Aspnes, Wait-free Consensus 1992 LIBTR Sheffler, Implementing the Multiprefix Operation on Parallel and Vector Computers 1992 LIBTR Vijay-Shanker & Weir, The Equivalence of Four Extensions of Context-free Grammars 1992 LIBTR Bellare, Interactive Proofs and Approximation 1992 LIBTR Plaxton & Suel, A Lower Bound for Sorting Networks based on the Shuffle Permutation 1992 LIBTR Barnett, A Systolizing Complier 1992 LIBTR Maggs & Plaxton, Sorting-based Selection Algorithms for Hypercubic Networks 1992 LIBTR Bern & Edelsbrunner & Eppstein & Mitchell & Tan, Edge Insertion for Optimal Triangulations 1992 LIBTR Edelsbrunner & Mucke, Three-Dimensional Alpha Shapes 1992 LIBTR Singh & Kumar & Agha & Tomlinson, Efficient Algorithms for Parallel Sorting on Mesh Multicomputers 1992 LIBTR Edelsbrunner & Tan, An Upper Bound for Conforming Delaunay Triangulations 1992 LIBTR Ravikumar, A Note on Checking Matrix Products 1992 LIBTR Ravikumar, Some Observations on 2-way Probabilistic Finite Automata 1992 LIBTR Baluja, A Massively Distributed Parallel Genetic Algorithm (mdpGA) 1992 LIBTR Arakawa & Krotkov, Fractal Surface Reconstruction with Uncertainty Estimation: Modeling Natural Terrain 1992 LIBTR Aberer & Codenotti, Towards a Complexity Theory for Approximation 1992 LIBTR Irani, Competitive Algorithms for On-line Paging and Graph Coloring 1992 LIBTR Seidel, Backwards Analysis of Randomized Geometric Algorithms 1992 LIBTR Bshouty & Hancock & Hellerstein & Karpinski, Read-Once Threshold Formulas, Justifying Assignments, and Generic Transformations 1992 LIBTR Codenotti & Margara, Local Properties of Some NP-Complete Problems 1992 LIBTR Beigel, Communicating with Low-Diffraction Lasers and Mirrors 1992 LIBTR Aberer & Codenotti, On the Power of Discontinous Approximate Computations 1992 LIBTR Nayak & Santoro & Tan, On Reconfigurability of Systolic Arrays 1992 LIBTR Dehne & Flach & Sack & Valiveti, Computational Geometry on Analog Neural Circuits 1992 LIBTR Oommen & Lee, Numeric Similarity and Dissimularity Measures between Two Trees 1992 LIBTR Nayak & Pagli & Santoro, Recognition of Catastrophic Faults in Reconfigurable Arrays with Arbitrary Link Redundancy 1992 LIBTR Atkinson & Thiyagarah, The Permutational Power of a Priority Queue 1992 LIBTR Kranakis & Pocchiola, Enumeration Problems Relating to Dirichlet's Theorem 1992 LIBTR Kranakis & Santoro, Distributed Computing on Anonymous Hypercubes with Faulty Components 1992 LIBTR Koenig, The Complexity of Real-time Search 1992 LIBTR Statman & Dowek, On Statman's Finite Completeness Theorem 1992 LIBTR Sheffler & Bryant, Work Efficient Hashing on Parallel and Vector Computers 1992 LIBTR Hirsh, The Computational Complexity of the Candidate-Elimination Algorithm 1992 LIBTR Han & Noordewier, An Efficient Algorithm for Ordering Random Genomic Clones 1992 LIBTR Berman, Lower and Upper Bounds for Incremental Algorithms 1992 LIBTR Imielinska & Kalantari, A General Class of Heuristics for Minimum Weight Perfect Matching and a log_3 log_3 n-error Special Case in O(n^2 log log n)-time 1992 LIBTR Allender & Bruschi & Pighizzini, The Complexity of Computing Maximal Word Functions 1992 LIBTR Allender & Gore, On Strong Separations from AC0 1992 LIBTR Allender, Applications of Time-bounded Kolmogorov Complexity in Complexity Theory 1992 LIBTR Allender, Depth Reduction for Circuits of Unbounded Fan-in 1992 LIBTR Allender & Gore, A Uniform Circuit Lower Bound for the Permanent 1992 LIBTR Allender & Beigel & Hertrampf & Homer, Almost-Everywhere Complexity Hierarchies for Nondeterministic Time 1992 LIBTR Fraenkel & Scheinerman & Ullman, Undirected Edge Geography 1992 LIBTR Schrift & Shamir, Universal Tests for Non-uniform Distributions 1992 LIBTR Fraenkel & Kotzig & Sabidussi, Modular Nim 1992 LIBTR Fraenkel, Complexity of Protein Folding 1992 LIBTR Fraenkel & Loebl, Complexity of Circuit Intersection in Graphs 1992 LIBTR Wallace & Patrick, Coding Decision Trees 1992 LIBTR Yee & Allison, Reconstruction of Strings Past 1992 LIBTR Romanik, Approximate Testing Theory 1992 LIBTR Goldberg, Scaling Algorithms for the Shortest Paths Problem 1992 LIBTR Motwani, Lecture Notes on Approximation Algorithms Volume I 1992 LIBTR Plotkin & Shmoys & Tardos, Fast Approximation Algorithms for Fractional Packing and Covering Problems 1992 LIBTR Wang, Fault-Tolerant Computation on Hypercubes 1992 LIBTR Walker, Probability Estimation for Classification Trees and DNA Sequence Analysis (thesis) 1992 LIBTR Dwork & Herlihy & Plotkin & Waarts, Time-lapse Snapshots 1992 LIBTR Goldberg & Maggs & Plotkin, A Parallel Algorithm for Reconfiguring a Multibutterfly Network with Faulty Switches 1992 LIBTR Ranjan, Issues in NP-Optimization and Approximation (thesis) 1992 LIBTR Chandra & Hadzilacos & Toueg, The Weakest Failure Detector for Solving Consensus 1992 LIBTR Huttenlocher & Kleinberg, On Invariants on Sets of Points or Line Segments under Projection 1992 LIBTR Trefethen, The Definition of Numerical Analysis 1992 LIBTR Salton & Allan & Buckley, Selective Use of Full-Text Databases 1992 LIBTR Budhiraja & Marzullo & Schneider & Toueg, Optimal Primary-Backup Protocols 1992 LIBTR Jayanti & Chandra & Toueg, Fault-Tolerant Wait-free Shared Objects 1992 LIBTR Chatterjee & Gilbert & Schreiber & Teng, Optimal Evaluation of Array Expressions on Massively Parallel Machines 1992 LIBTR Gusgen & Hertzberg, On Space and Time 1992 LIBTR Cerulli & De Leone & Piacente, A Modified Auction Algorithm for the Shortest Path Problem 1992 LIBTR Alonso & Reingold & Schott, Multidimensional Divide-and-Conquer Maximin Recurrences 1992 LIBTR Goldstein & Reingold, The Complexity of Pursuit on a Graph 1992 LIBTR Khaira & Miller & Sheffler, Nested Dissection: A Survey and Comparison of Various Nested Dissection Algorithms 1992 LIBTR Makowsky, Computable Quantifiers and Logics over Finite Structures 1992 LIBTR Fix & Francez & Grumberg, Program Composition via Unification 1992 LIBTR Ben-David & Halevi, On the Independence of P versus NP (revised version) 1992 LIBTR Schuster & Shemesh, Sorting on High Dimensional Reconfiguring Arrays 1992 LIBTR Bar-Yehuda & Etzion & Moran, Rotating-Table Games and Derivatives of Words (revised version) 1992 LIBTR Makowsky & Sharell, On Average Case Complexity of SAT for Symmetric Distributions 1992 LIBTR Litman, Rewiring -- A New Design Technique for Systolic Systems (extended abstract) 1992 LIBTR Bar-Yehuda & Goldreich & Itai, On the Time-Complexity of Broadcast in Multi-Hop Radio Networks: An Exponential Gap between Determinism and Randomization (revised version) 1992 LIBTR Bar-Yehuda & Israeli & Itai, Multiple Communication in Multi-Hop Radio Networks (revised version) 1992 LIBTR Bar-Yehuda & Fogel, Variations on Ray Shooting (revised version) 1992 LIBTR Bar-Yehudah & Etzion, Connections between Two Cycles -- A New Design of Dense Processor Interconnection Networks (revised version) 1992 LIBTR Sidi, A Note on the Determination of the Zeros of Certain Polynomials 1992 LIBTR Makowsky, Model Theory and Computer Science: An Appetizer (2nd edition) 1992 LIBTR Calo & Makowsky, The Ehrenfeucht-Fraisse Games for Transitive Closure 1992 LIBTR Pettersson, A Term Pattern-Match Compiler Inspired by Finite Automata Theory 1992 LIBTR Knight & Myers, Approximate Regular Expression Pattern Matching with Concave Gap Penalties 1992 LIBTR Myers, Approximate Matching of Network Expressions with Spacers 1992 LIBTR Abadi & Lamport, An Old-fashioned Recipe for Real Time 1992 LIBTR Seznec & Jegou & Lenfant, Prime Memory Systems do not Require Euclidean Division by a Prime Number 1992 LIBTR Kannan & Naor & Rudich, Anchors in Tournaments 1992 LIBTR Kozen, On Action Algebras 1992 LIBTR Menezes & Bakhru, New Bounds on the Reliability of Two Augmented Shuffle-Exchange Networks 1992 LIBTR Jain & Agrawala & Sanghi, Virtual Circuits with Cross Traffic: Model, Analysis and Parameter Estimation 1992 LIBTR Khachiyan, Diagonal Matrix Scaling is NP-Hard 1992 LIBTR Chandra & Hadzilacos & Toueg, The Weakest Failure Detector for Solving Consensus 1992 LIBTR Wayner, Using Content-Addressable Search Engines to Encrypt and Break DES 1992 LIBTR Salton & Allan & Buckley, Automatic Structuring and Retrieval of Large Text Files 1992 LIBTR Critchlow, The Inherent Cost of Achieving Causal Consistency 1992 LIBTR Xavier, Provably-Good Approximation Algorithms for Optimal Kinodynamic Robot Motion Plans 1992 LIBTR Unger & Moult, Why Genetic Algorithms are Suitable for Protein Folding Analysis: The Theoretical Foundations 1992 LIBTR Tian, Understanding and Using Program Complexity to Improve Software Development 1992 LIBTR Nagulapalli, Fault Diagnosis and Fault Tolerant Strategies for an Adaptive Binary Sorting Network 1992 LIBTR Kalpakis & Yesha, On the Power of the Linear Array Architecture for Performing Tree-Structured Computations 1992 LIBTR Alaettinoglu & Shankar & Dussa-Zieger & Matta, Responsiveness of Routing Protocols to Link Failures and Repairs 1992 LIBTR Cheng & Agrawala, Modeling of Cross Traffic in Conjunction with Deterministic Analysis of Virtual Circuits 1992 LIBTR Guibas & Pellegrini, New Algorithmic Results for Lines-in-3-Space Problems 1992 LIBTR Pellegrini, A New Algorithm for Counting Circular Arc Intersections 1992 LIBTR Clinger & Rees, Revised Report on the Algorithmic Language Scheme 1992 LIBTR le Verge & Quinton, The Palindrome Systolic Array Revisited 1992 LIBTR Plouzeau & Raynal, Elements for a Course on the Design of Distributed Algorithms 1992 LIBTR Dowek, A Second-Order Pattern Matching Algorithm for the Cube of Typed Lambda-Calculi 1992 LIBTR Hemachandra & Silvestri, Easily Checked Self-Reducibility 1992 LIBTR Narayanan, Selection, Sorting, and Routing on Mesh-connected Processor Arrays (thesis) 1992 LIBTR Goldberg & Kharitonov, On Implementing Scaling Push-Relabel Algorithms for the Minimum-Cost Flow Problem 1992 LIBTR Alizadeh & Goldberg, Implementing the Push-Relabel Method for the Maximum Flow Problem on a Connection Machine 1992 LIBTR Chang & Manna & Pnueli, The Safety-Progress Classification 1992 LIBTR Maler & Manna & Pnueli, From Timed to Hybrid Systems 1992 LIBTR Radzik, Newton's Method for Fractional Combinatorial Optimization 1992 LIBTR Manna & Waldinger, Fundamentals of Deductive Program Synthesis 1992 LIBTR Kennaway & Klop & Sleep & Vries, On the Adequacy of Graph Rewriting for Simulating Term Rewriting 1992 LIBTR Michallon & Trystram, Optimal Broadcasting Algorithms on Torus 1992 LIBTR Harel & Raz, Deciding Properties of Nonregular Programs 1992 LIBTR Hirst, Vector Trees: A Data Structure for Fast Intersection 1992 LIBTR Zhang & Foo, A Computational Model for the Logic of Theory Change 1992 LIBTR Symvonis & Tragoudas, Searching a Solid Pseudo 3-sided Orthoconvex Grid 1992 LIBTR Dahlhaus, Learning Monotone Read-Once Formulas in Quadratic Time 1992 LIBTR Dahlhaus, Optimal (Parallel) Algorithms for the All-to-All Vertices Distance Problem for Certain Graph Classes 1992 LIBTR Brown & Hershberger, Animation of Geometric Algorithms: A Video Review 1992 LIBTR Ramalingam & Reps, An Incremental Algorithm for a Generalization of the Shortest-Path Problem 1992 LIBTR Bryant, Symbolic Boolean Manipulation with Ordered Binary Decision Diagrams 1992 LIBTR Hemachandra & Jha, Defying Upward and Downward Separation 1992 LIBTR Scott & Mellor-Crummey, Fast, Contention-free Combining Tree Barriers 1992 LIBTR Ablayev, Lower Bounds for Probabilistic Space Complexity: Automata Approach 1992 LIBTR Ablayev, Lower Bounds for One-way Probabilistic Communication Complexity 1992 LIBTR Khaira & Miller, Nested Dissection: A Survey 1992 LIBTR Greenberg & Shih, Finding a Maximum-Density Planar Subset of a Set of Nets in a Channel 1992 LIBTR Baekgaard & Mark, Incremental Evaluation of Set Differences 1992 LIBTR Unger & Moult, Genetic Algorithms for Protein Folding Simulations 1992 LIBTR Alaettinoglu & Shankar, Stepwise Assertional Design of Distance-Vector Routing Algorithms 1992 LIBTR Venkatesh & Cooper & White, Properties of Local Energy and Separability of Features 1992 LIBTR Kyburg, Semantics for Probabilistic Inference 1992 LIBTR Yackel & Meyer, Minimum-Perimeter Domain Decomposition 1992 LIBTR Nielsen, A Style Guide for Technical Reports 1992 LIBTR Arvind & Han & Hemachandra & Kobler & Lozano & Mundhenk & Ogiwara & Schoning & Silvestri & Thierauf, Reductions to Sets of Low Information Content 1992 LIBTR Cai & Hemachandra & Vyskoc, Promise Problems and Access to Unambiguous Computation 1992 LIBTR Burrows & Jerian & Lampson & Mann, On-line Data Compression in a Log-Structured File System 1992 LIBTR Sarkar & Brown, Graphical Fisheye Views of Graphs 1992 LIBTR Cai, Tree Spanners: Spanning Trees that Approximate distances 1992 LIBTR Bolding & Snyder, Mesh and Torus Chaotic Routing 1992 LIBTR Khuller & Vishkin, Biconnectivity Approximations and Graph Carvings 1992 LIBTR Nerode & Ng & Subrahmanian, Computing Circumscriptive Databases, Part I: Theory and Algorithms 1992 LIBTR Chien & Oruc, Adaptive Binary Sorting Schemes and Associated Interconnection Networks 1992 LIBTR Menasce & Yesha & Kalpakis, HFT: A Highly Fault Tolerant and Efficient Protocol for Distributed Mutual Exclusion 1992 LIBTR Menasce & Yesha & Kalpakis, On a Unified Framework for the Evaluation of Distributed Quorum Attainment Protocols 1992 LIBTR Stewart, On the Perturbation of Markov Chains with Nearly Transient States 1992 LIBTR Romanik, Approximate Testing and Learnability 1992 LIBTR Lee & Oruc, Design of Efficient and Easily Routable Generalized Connectors 1992 LIBTR Stewart, Gaussian Elimination, Perturbation Theory and Markov Chains 1992 LIBTR Halpern, Reasoning about Knowledge: A Survey Circa 1991 (revised) 1992 LIBTR Unger & Moult, On the Computational Complexity of Protein Folding 1992 LIBTR Dietz, Heap Construction in the Parallel Comparison Tree Model 1992 LIBTR Hirst, Vector Trees: A Compact Data Structure for Sets 1992 LIBTR Kingston, Curriculum Engineering 1992 LIBTR Arora & Lund & Motwani & Sudan & Szegedy, On the Intractability of Approximation Problems (early draft) 1992 LIBTR Huttenlocher & Kedem & Kleinberg, On Dynamic Voronoi Diagrams and the Minimum Hausdorff Distance for Point Sets under Euclidean Motion in the Plane 1992 LIBTR Mitchell & Vavasis, Quality Mesh Generation in Three Dimensions 1992 LIBTR Constable & Smith, Computational Foundations of Basic Recursive Function Theory 1992 LIBTR Henzinger & Manna & Pnueli, Timed Transition Systems 1992 LIBTR Alur & Henzinger, Logics and Models of Real Time: A Survey 1992 LIBTR Clinger & Rees, Revised Report on the Algorithmic Language Scheme 1992 LIBTR Webber, A Formal Definition of Unnecessary Computation in Functional Programs 1992 LIBTR Bennett, Decision Tree Construction via Linear Programming 1991 LIBTR Chaudhuri, Towards a Complexity Hierarchy of Wait-free Concurrent Objects 1991 LIBTR Mayordomo, Almost Every Set in Exponential Time is P-Bi-immune 1991 LIBTR Grimson & Huttenlocher & Jacobs, Affine Matching with Bounded Sensor Error: A Study of Geometric Hashing and Alignment 1991 LIBTR Fellows & Langston, On Search, Decision, and the Efficiency of Polynomial-Time Algorithms 1991 LIBTR Fellows & Langston, On Search, Decision, and the Efficiency of Polynomial-Time Algorithms 1991 LIBTR Severi, The Meaning of Type 1991 LIBTR Betarte & Gimenez, Experiences with a Mechanization of Martin-Lof's Theory of Types 1991 LIBTR Peratto, Course-of-Values Recursion in Martin-Lof's Type Theory 1991 LIBTR Groves & Flinn, The Case for Formal Methods in Software Development 1991 LIBTR Herlihy, A Methodology for Implementing Highly Concurrent Data Objects 1991 LIBTR Herlihy & Shavit & Waarts, Linearizable Counting Networks 1991 LIBTR Ben-Natan & Barak, Parallel Contractions of Grids for Task Assignment to Processor Networks 1991 LIBTR ElGindy, Improved Convex Hull Algorithm on a Processor Array with a Reconfigurable Bus System 1991 LIBTR ElGindy, On the Utilisation of Data Duplication to Accelerate the SORT Operation on Mesh Architectures 1991 LIBTR ElGindy & Mitra, Orthogonal Shortest Route Queries among Axes Parallel Rectangular Obstacles 1991 LIBTR Avis, The m-Core Properly Contains the m-Divisible Points in Space 1991 LIBTR Everett & Whitesides, Finding all the Largest Circles in a 3-dimensional Box 1991 LIBTR Book & Lutz & Wagner, On Complexity Classes and Algorithmically Random Languages 1991 LIBTR Pach & Agarwal, Combinatorial Geometry 1991 LIBTR MacKenzie & Stout, "Ultra-Fast Expected Time Parallel Algorithms" 1991 LIBTR Regan & Schwentick, On the Power of One Bit of a Number-P Function 1991 LIBTR Lockyear & Ebeling, Optimal Retiming of Multi-phase, Level-clocked Circuits 1991 LIBTR Agrawal & Klein & Ravi, Ordering Problems Approximated: Register Sufficiency, Single-Processor Scheduling and Interval Graph Completion 1991 LIBTR Agrawal & Klein & Ravi, How Tough is the Minimum-Degree Steiner Tree? A New Approximate Min-Max Equality (Complete with Algorithms) 1991 LIBTR Heywood & Ranka, Sorting and List Ranking on the Hierarchical PRAM Model 1991 LIBTR Brinch Hansen, Do Hypercubes Sort Faster than Tree Machines? 1991 LIBTR Brinch Hansen, Parallel Divide and Conquer 1991 LIBTR Mansour & Fox, A Comparison of Load Balancing Algorithms for Parallel Computations 1991 LIBTR Goldman, Computational Learning Theory Lecture Notes for CS 582 Spring Semester, 1991 1991 LIBTR Goldman & Sloan, The Difficulty of Random Attribute Noise 1991 LIBTR Srinivas, Pattern Matching: A Sheaf-theoretic Approach 1991 LIBTR Hirschberg & Pazzani, Average Case Analysis of a k-CNF Learning Algorithm 1991 LIBTR Eppstein, Dynamic Three-dimensional Linear Programming 1991 LIBTR Eppstein, Persistence, Offline Algorithms, and Space Compaction 1991 LIBTR Eppstein, Approximating the Minimum Weight Triangulation 1991 LIBTR Eppstein, New Algorithms for Minimum Area k-gons 1991 LIBTR Eppstein, Improved Bounds for Intersecting Triangles and Halving Planes 1991 LIBTR Eppstein, Subquadratic Nonobtuse Triangulation of Convex Polygons 1991 LIBTR Stauffer & Hirschberg, Systolic Implementations for Transpose Coding 1991 LIBTR Friedman, Some Geometric Aspects of Graphs and their Eigenfunctions 1991 LIBTR Spencer, On the Size of Independent Sets in Hypergraphs 1991 LIBTR Bell & Gupta, Implementing Linear Hashing in Main Memory 1991 LIBTR Proskurowski, Graph Reductions, and Techniques for Finding Minimal Forbidden Minors 1991 LIBTR Fuentes & Kreinovich & Dantsin, Less than 2n Satisfiability Algorithm Extended to the Case when Almost All Clauses are Short 1991 LIBTR Cai & Furer & Immerman, An Optimal Lower Bound on the Number of Variables for Graph Identification 1991 LIBTR Barrington & Beigel & Rudich, Representing Boolean Functions as Polynomials Modulo Composite Numbers 1991 LIBTR Nakamura & Rosenfeld, Two-dimensional Connected Pictures are not Recognizable by Finite-State Acceptors 1991 LIBTR Klein & Hubbard & Krishnan & Hillebrand & Langworthy & Goldwasser & Mayer & Basye & Borger & Luks & Conner & Cervone & Sairam & Ravi & Agrawal & Cohen & Rosenzweig, Combinatorial Optimization 1990: Lecure Notes 1991 LIBTR Sairam & Vitter & Tamassia, A Complexity Theoretic Approach to Incremental Computation 1991 LIBTR Buss & Kanellakis & Radge & Shvartsman, Parallel Algorithms with Processor Failures and Delays 1991 LIBTR Klein & Agrawal & Ravi & Rao, An Approximate Max-Flow Min-Cut Relation for Multicommodity Flow and its Applications 1991 LIBTR Howard & Vitter, Analysis of Arithmetic Coding for Data Compression 1991 LIBTR Klein, Parallel Algorithms for Chordal Graphs 1991 LIBTR Howard & Vitter, New Methods for Lossless Image Compression Using Arithmetic Coding 1991 LIBTR Vitter & Krishnan, Optimal Prefetching via Data Compression 1991 LIBTR Howard & Vitter, Practical Implementations of Arithmetic Coding 1991 LIBTR Klein & Plotkin & Stein & Tardos, Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts 1991 LIBTR Chiang & Tamassia, Dynamic Algorithms in Computational Geometry 1991 LIBTR Klein, A Parallel Randomized Approximation Scheme for Shortest Paths 1991 LIBTR Katoh & Iwano, Finding k Farthest Pairs and k Closest/Farthest Bichromatic Pairs for Points in the Plane 1991 LIBTR Maruyama & Takeda, New kth-Shortest Path Algorithm and its Applications to NLP 1991 LIBTR Feitelson & Rudolph, Gang Scheduling Performance Benefits for Fine-grain Synchronization 1991 LIBTR Parnas & Rudolph, Representation of Synapses in Neuronal Networks 1991 LIBTR Hunt & Stearns & Ravi, Generalized Predicate Sets, Structure Trees, and Graph and Hypergraph Coloring Problems 1991 LIBTR Ravi & Rosenkrantz & Tayi, Heuristic and Special Case Algorithms for Dispersion Problems 1991 LIBTR Rosenkrantz & Hunt, The Complexity of Structural Containment and Equivalence 1991 LIBTR Pan, On Decreasing the Precision of Matrix Computations 1991 LIBTR Kapur & Narendran, Double-Exponential Complexity of Computing a Complete Set of AC-Unifiers 1991 LIBTR Yu & Rosenkrantz, A Linear-time Scheme for Version Reconstruction 1991 LIBTR Radhakrishnan & Hunt & Stearns, Efficient Algorithms for Solving Systems of Linear Equations and Path Problems 1991 LIBTR Allison & Wallace & Yee, Minimum Message Length Encoding, Evolutionary Trees and Multiple-Alignment 1991 LIBTR Apt & Pedreschi, Reasoning about Termination of Prolog Programs 1991 LIBTR Gemmell & Sudan, Highly Resilient Correctors for Polynomials 1991 LIBTR Randall, Efficient Generation of Random Nonsingular Matrices 1991 LIBTR Chang & Lawler, Sublinear Expected Time Approximate String Matching and Biological Applications 1991 LIBTR Chang & Lampe, Theoretical and Empirical Comparisons of Approximate String Matching Algorithms 1991 LIBTR Keshav, Congestion Control in Computer Networks 1991 LIBTR Goldreich, Three XOR-Lemmi -- An Exposition 1991 LIBTR Gerstel & Zaks, A New Characterization of Tree Medians with Applications of Distributed Algorithms 1991 LIBTR Even & Mansour, A Construction of Cipher from a Single Psuedorandom Permutation 1991 LIBTR Ben-David & Halevi, On the Independence of P versus NP 1991 LIBTR Ben-Dor, On Sampling with a Slightly Random Source 1991 LIBTR Ben-Asher & Peleg & Schuster, The Complexity of Reconfiguring Network Models 1991 LIBTR Fischer & Moran & Taubenfeld, Space-Efficient Asynchronous Consensus without Shared Memory Initialization 1991 LIBTR Biham & Shamir, Differential Cryptanalysis of the Full 16-Round DES 1991 LIBTR Goldreich, On Defining Proofs of Knowledge 1991 LIBTR Bargury & Makowsky, The Expressive Power of Transitive Closure and 2-way Multihead Automata 1991 LIBTR Goldreich & Goldwasser & Linial, Fault-tolerant Computation in the Full Information Model (preliminary version) 1991 LIBTR Goldreich & Petrank, Quantifying Knowledge Complexity (preliminary version) 1991 LIBTR Goldreich, A Uniform-Complexity Treatment of Encryption and Zero-Knowledge (revised version of TR 568 & 627) 1991 LIBTR Leung & Yu, A Heuristic for Minimizing the Number of Late Jobs on Two Processors 1991 LIBTR Leung & Yu & Wei, Minimizing the Weighted Number of Tardy Task Units 1991 LIBTR Birget, Note of the Equivalence Problem for Certain Finite-state Devices 1991 LIBTR Kieckhafer & Azadmanesh, Low Cost Approximate Agreement in Partially Connected Networks 1991 LIBTR Stinson, Data Encryption 1991 LIBTR Leung & Wei & Yu, Minimizing Makespan on Parallel Machines with Nonsimultaneous Machine Available and Ending Times 1991 LIBTR Stinson, Graph Decompositions and Secret Sharing Schemes 1991 LIBTR Birget, Intersection and Union of Regular Languages, and State Complexity 1991 LIBTR Leung & Shende, On Multi-dimensional Packet Routing for Meshes with Buses 1991 LIBTR Leung & Wei, Maximal k-Multiple-Free Sets of Integers 1991 LIBTR Stinson, Universal Hashing and Authentication Codes 1991 LIBTR Birget, Partial Orders on Words, Minimal Elements of Regular Languages, and State Complexity 1991 LIBTR Colbourn & Magliveras & Stinson, Steiner Triple Systems of Order 19 with Nontrivial Automorphism Group 1991 LIBTR Rudnick & Goldberg, Signal, Noise, and Genetic Algorithms 1991 LIBTR Agarwal & Sharir, Applications of a New Space Partitioning Technique 1991 LIBTR Regan & Schwentick, On the Power of One Bit of a Number-P Function 1991 LIBTR Darragh & Cleary & Witten, Bonsai: A Compact Representation of Trees 1991 LIBTR Sharp & Harrison & Darlington, A Synthesis of Dynamic Message-passing Algorithm for Quicksort 1991 LIBTR Sharp & Cripps, Parallel Algorithms that Solve Problems by Communication 1991 LIBTR Hirsch, The Allen Interval Algebra and Metric Information 1991 LIBTR Raynal & Mizuno & Neilsen, Synchronization and Concurrency Measures for Distributed Computations 1991 LIBTR Raynal, About Logical Clocks for Distributed Systems 1991 LIBTR Andonov & Quinton, Efficient Linear Systolic Array for the Knapsack Problem 1991 LIBTR Bell & Gupta, An Evaluation of Self-adjusting Binary Search Tree Techniques 1991 LIBTR Brooks, Intelligence without Reason 1991 LIBTR Susswein & Henderson & Zachary & Hansen & Hinker & Marsden, Parallel Path Consistency 1991 LIBTR Galil & Italiano, Maintaining the 3-Edge-Connected Components of a Graph On-line 1991 LIBTR Regnier, Performance of String Searching Algorithms under Various Probabilistic Models 1991 LIBTR Ahuja & Orlin & Stein & Tarjan, Improved Algorithms for Bipartite Network Flow 1991 LIBTR Rosenberg, Lower Bounds in Geometric Searching (thesis) 1991 LIBTR Tay & Loke, A Theory for Deadlocks 1991 LIBTR Han & Kelsen & Ramachandran & Tarjan, Computing Minimal Spanning Subgraphs in Linear Time 1991 LIBTR Friedman, On the Bit Extraction Problem 1991 LIBTR Pan, Randomized Incomplete Numerical Factorization of a Polynomial over the Complex Field 1991 LIBTR Grigoriev & Karpinski, An Approximation Algorithm for the Number of Zeros of Arbitrary Polynomials over GF[q] 1991 LIBTR Karpinski & Werther, VC Dimension and Sampling Complexity of Learning Sparse Polynomials and Rational Functions 1991 LIBTR Alt & Guibas & Mehlhorn & Karp & Wigderson, A Method for Obtaining Randomized Algorithms with Small Tail Probabilities 1991 LIBTR Blum & Luby & Rubinfeld, Self-Testing/Correcting with Applications to Numerical Problems (revised version) 1991 LIBTR Ladkiin & Reinefeld, How to Solve Interval Constraint Networks: The Definitive Answer -- Probably 1991 LIBTR Alon & Karp & Peleg & West, A Graph-theoretic Game and its Application to the k-Server Problem 1991 LIBTR Hastad & Impagliazzo & Levin & Luby, Construction of a Pseudo-random Generator for Any One-way Function 1991 LIBTR Anderson, A Survey of Polynomial Factorisation Algorithms 1991 LIBTR Santha & Wilson, Polynomial Size Constant Depth Circuits with a Limited Number of Negations 1991 LIBTR Zhong & Rajopadhye & Lo, Parallel Implementation of Divide-and-Conquer Algorithms on Binary de Bruijn Networks 1991 LIBTR Chazelle & Matousek, Derandomizing an Output-sensitive Convex Hull Algorithm in Three Dimensions 1991 LIBTR Makinen, A Survey on Binary Tree Codings 1991 LIBTR Delyon & Maler, On Fault-tolerant Symbolic Computations 1991 LIBTR Raynal, About Logical Clocks for Distributed Systems 1991 LIBTR Delyon & Juditsky, Accelerated Stochastic Approximation 1991 LIBTR Salesin, Epsilon Geometry: Building Robust Algorithms from Imprecise Computations 1991 LIBTR Nakamura, Three-dimensional Connected Pictures are not Recognizable by Finite-State Acceptors 1991 LIBTR Hosking & Moss, Compiler Support for Persistent Programming 1991 LIBTR Rosenberg, Cycles in Networks 1991 LIBTR Yao, Probabilistic Behavior of Shortest Paths over Unbounded Regions 1991 LIBTR Gil & Meyer auf Der Heide & Wigderson, The Tree Model for Hashing: Lower and Upper Bounds 1991 LIBTR Gabow, A Matroid Approach to Finding Edge Connectivity and Packing Arborescences 1991 LIBTR Gabow, Applications of a Poset Representation to Edge Connectivity and Graph Rigidity 1991 LIBTR de la Torre & Greenlaw, Super Critical Tree Numbering and Optimal Tree Ranking are in NC 1991 LIBTR Greenlaw, The Parallel Complexity of Approximation Algorithms for the Maximum Acyclic Subgraph Problem 1991 LIBTR Akl & Qiu, Parallel Minimum Spanning Forest Algorithms on the Star and Pancake Interconnection Networks 1991 LIBTR Young, Competitive Paging and Dual-guided On-line Weighted Caching and Matching Algorithms 1991 LIBTR Fayard & Zissimopoulos, An Approximation Algorithm for Solving Unconstrained Two-Space Knapsack Problems 1991 LIBTR Heydemann & Opatrny & Sotteau, Embeddings of Hypercubes and Grids into de Bruijn Graphs 1991 LIBTR El Maftouhi & Gordones, The Maximum Order of a Strong Matching in a Random Graph 1991 LIBTR Wu & Manber & Myers, Improving the Running Times for Some String-Matching Problems 1991 LIBTR Mehldau, A Pattern Matching System for Biosequences 1991 LIBTR Myers, An Overview of Sequence Comparison Algorithms in Molecular Biology 1991 LIBTR Kojima & Megiddo & Mizuno, A Primal-Dual Exterior Point Algorithm for Linear Programming 1991 LIBTR Blaum & Bruck, Unordered Error-correcting Codes and their Applications 1991 LIBTR Megiddo & Tamir, Linear Time Algorithms for Separable Quadratic Programming Problems 1991 LIBTR Makowski & Nelson, Distributed Parallelism Considered Harmful 1991 LIBTR Bar-Noy & Kipnis, Designing Broadcasting Algorithms in the Postal Model for Message-passing Systems 1991 LIBTR Wang & Cypher, Fault-tolerant Ring and Torus Embeddings in Hypercubes 1991 LIBTR Ho, Spanning Trees and Communication Primitives on Hypercubes 1991 LIBTR Broder & Frieze & Upfal, Existence and Construction of Edge Disjoint Paths on Expander Graphs 1991 LIBTR Raghavan & Upfal, A Theory of Wormhole Routing in Parallel Computers 1991 LIBTR Dwork, On Verification in Secret Sharing 1991 LIBTR Dolev & Dwork & Naor, Non-malleable Cryptography 1991 LIBTR Dwork & Waarts, Simple and Efficient Bounded Concurrent Timestamping OR Bounded Concurrent Timestamp Systems are Comprehensible! 1991 LIBTR Rissanen, Information Theory and Neural Nets 1991 LIBTR Konstantinidou & Snyder, Chaos Router: Architecture and Performance 1991 LIBTR Konstantinidou & Upfal, Experimental Comparison of Multistage Interconnection Networks 1991 LIBTR Halpern, A Note on Knowledge-based Protocols and Specifications 1991 LIBTR Kalai & Stockmeyer, A Lower Bound on the Complexity of Regional Matchings on the Hypercube 1991 LIBTR Fujishige & Iwano & Nakano & Tezuka, A Speculative Contraction Method for Minimum Cost Flows: Toward a Practical Algorithm 1991 LIBTR Boden, What is Creativity? 1991 LIBTR Zhang & Statman & Shasha, On the Editing Distance between Unordered Labeled Trees 1991 LIBTR Fox & Chen & Daoud & Heath, Order Preserving Minimal Perfect Hash Functions and Information Retrieval 1991 LIBTR Chakraborty & Allison & Ribbens & Watson, Analysis of Function Component Complexity for Hypercube Homotopy Algorithms 1991 LIBTR Heath, Edge Coloring Planar Graphs with Two Outerplanar Subgraphs 1991 LIBTR Kahn & Komlos & Szemeredi, Singularity Probabilities for Random 11 Matrices 1991 LIBTR Pelikan & Pintz & Szemeredi, On the Running Time of the Adleman-Pomerance-Rumely Primality Test 1991 LIBTR Grigoriadis & Khachiyan, Approximate Solution of Matrix Games in Parallel 1991 LIBTR Radhakrishnan, Graph Entropy and Formula Complexity 1991 LIBTR Bhatia & Leighton & Makedon, Improved Algorithms for two Dimensional Grid Routing 1991 LIBTR Corella, Mechanizing Set Theory 1991 LIBTR Boden, The Impact of AI on Philosophy 1991 LIBTR Obrenic, Embeddings de Bruijn and Shuffle-Exchange Graphs in Five Pages 1991 LIBTR Berman & Bharali, Asymptotically Optimal Distributed Consensus in Presence of Timing Uncertainty 1991 LIBTR Kalyanasundaram & Schnitger, Communication Complexity and Lower Bounds for Sequential Machines 1991 LIBTR Chan, Machine Learning in Molecular Biology Sequence Analysis 1991 LIBTR Lloyd & Burns, Finding the Position of a Subarray in a Pseudo-random Array 1991 LIBTR Denning, Mutual Exclusion 1991 LIBTR Agarwal & Sharir, Counting Circular Arc Intersections 1991 LIBTR Agarwal & Matousek, Relative Neighborhood Graphs in Three Dimensions 1991 LIBTR Krishnan & Reif, Towards Randomized Strongly Polynomial Algorithms for Linear Programming 1991 LIBTR Karr & Krishnan & Reif, Derivation of the Ellipsoid Algorithm 1991 LIBTR Agarwal & Matousek & Suri, Farthest Neighbors, Maximum Spanning Trees and Related Problems in Higher Dimensions 1991 LIBTR Atkinson & Sack, Uniform Generation of Combinatorial Objects in Parallel 1991 LIBTR Atallah & Dehne & Miller & Rau-Chaplin & Tsay, Multisearch Techniques for Implementing Data Structures on a Mesh-connected Computer 1991 LIBTR Oommen, String Editing with Substitution, Insertion, Deletion, Squashing and Expansion Operations 1991 LIBTR O'Reilly & Santoro, The Expressiveness of Silence: Optimal Algorithms for Synchronous Communication of Information 1991 LIBTR Kranakis & Pocchiola, A Brief Survey of Art Gallery Problems in Integer Lattice Systems 1991 LIBTR Agarwal & Matousek, Dynamic Half-space Range Reporting and its Applications 1991 LIBTR Agarwal & Efrat & Sharir & Toledo, Computing a Segment-center for a Planar Point Set 1991 LIBTR Goldschlager, What is Money? 1991 LIBTR Liu & You & Li, A Parallel Storage Scheme and its Implementation 1991 LIBTR Greenlaw & Hoover & Ruzzo, A Compendium of Problems Complete for P 1991 LIBTR Karpinski & Zimmermann, Probabilistic Recurrence Relations for Parallel Divide-and-Conquer Algorithms 1991 LIBTR Ye & Keane, A Distributed Termination Detection Scheme 1991 LIBTR Simard, Learning State Space Dynamics in Recurrent Networks 1991 LIBTR Cull & Larson, The Rmobius cubeS: An Interconnection Network for Parallel Computation 1991 LIBTR Cull & Holloway, Algorithms for Constructing a Consensus Sequence 1991 LIBTR Kececioglu, Exact and Approximation Algorithms for DNA Sequence Reconstruction 1991 LIBTR Friesen & Langston, Analysis of a Compound Bin Packing Algorithm 1991 LIBTR Langston, Time-Space Optimal Parallel Computation 1991 LIBTR Guan & Langston, Time-Space Optimal Parallel Merging and Sorting 1991 LIBTR Fellows & Langston, Constructivity Issues in Graph Algorithms 1991 LIBTR Fox & Lee, FAST-INV: A Fast Algorithm for Building Large Inverted Files 1991 LIBTR Galil & Park, Parallel Dynamic Programming 1991 LIBTR Jiang & Ravikumar, A Note on the Space Complexity of Some Decision Problems for Finite Automata 1991 LIBTR Biermann, Computer Science for the Many 1991 LIBTR Furer & He & Kao & Raghavachari, O (N log log n)-Work Parallel Algorithms for Straight-line Grid Embeddings of Planar Graphs 1991 LIBTR Cheriyan & Kao & Thurimella, Scan-first Search and Sparse Certificates: Improved Parallel Algorithms for k-Vertex Connectivity 1991 LIBTR Galil & Italiano, Fully Dynamic Algorithms for 2-Edge Connectivity 1991 LIBTR Galil & Italiano, Maintaining the 3-Edge-Connected Components of a Graph On-line 1991 LIBTR Galil & Italiano, Maintaining Biconnected Components of Dynamic Planar Graphs 1991 LIBTR Italiano, Dynamic Data Structures for Graphs 1991 LIBTR Sur & Srimani, Incrementally Extensible Hypercube (IEH) Graphs 1991 LIBTR Karpinski & Zimmermann, Probabilistic Recurrence Relations for Parallel Divide-and-Conquer Algorithms 1991 LIBTR Frandsen, Parallel Construction of Irreducible Polynomials 1991 LIBTR Gerstel & Zaks, A New Characterization of Tree Medians with Applications to Distributed Algorithms 1991 LIBTR Kozen & Zaks, Optimal Bounds for the Change-Making Problem 1991 LIBTR Skyum, A Sweepline Algorithm for Generalized Delaunay Triangulations 1991 LIBTR Biran & Moran & Zaks, Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks 1991 LIBTR Whitley, Fundamental Principles of Deception in Genetic Search 1991 LIBTR Das & Whitley, The Only Challenging Problems are Deceptive: Global Search by Solving Order-1 Hyperplanes 1991 LIBTR Whitley & Starkweather, The Traveling Salesman and Sequence Scheduling: Quality Solutions Using Genetic Edge Recombination 1991 LIBTR Whitley, Deception, Dominance and Implicit Parallelism in Genetic Search 1991 LIBTR Barnett & Lengauer, A Systolizing Compilation Scheme 1991 LIBTR Jerrum, An Analysis of a Monte Carlo Algorithm for Estimating the Permanent 1991 LIBTR Sangiorgi & Lengauer, An Improved Systolic Array for String Correction 1991 LIBTR Xue & Lengauer, The Synthesis of Control Signals for One-Dimensional Systolic Arrays 1991 LIBTR Hsu & Ramachandran, On Finding a Smallest Augmentation to Biconnect a Graph 1991 LIBTR Ramachandran & Yang, Finding the Closed Partition of a Planar Graph 1991 LIBTR Kelsen & Ramachandran, The Complexity of Finding Minimal Spanning Subgraphs 1991 LIBTR Ramachandran & Wang, The Telephone Connection Problem 1991 LIBTR Camion & Patarin, The Knapsack Hash Function Proposed at Crypto'89 Can Be Broken 1991 LIBTR Boguslavski & Greenberg & Jacquet & Kruskal & Stolyar, Models of Memory Interference in Multiprocessors 1991 LIBTR Siegelmann & Sontag, On the Computational Power of Neural Nets 1991 LIBTR Donald & Chang, On Computing the Homology Type of a Triangulation 1991 LIBTR Pan, Randomized Incomplete Numerical Factorization of a Polynomial over the Complex Field 1991 LIBTR Grigoriev & Karpinski, An Approximation Algorithm for the Number of Zeros of Arbitrary Polynomials over GF[q] 1991 LIBTR Karpinski & Werther, VC Dimension and Sampling Complexity of Learning Sparse Polynomials and Rational Functions 1991 LIBTR Alt & Guibas & Mehlhorn & Karp & Wigderson, A Method for Obtaining Randomized Algorithms with Small Tail Probabilities 1991 LIBTR Blum & Luby & Rubinfeld, Self-Testing/Correcting with Applications to Numerical Problems (revised version) 1991 LIBTR Alon & Karp & Peleg & West, A Graph-theoretic Game and Its Application to the k-Server Problem 1991 LIBTR Anderson, A Survey of Polynomial Factorisation Algorithms 1991 LIBTR Santha & Wilson, Polynomial Size Constant Depth Circuits with a Limited Number of Negations 1991 LIBTR Zhong & Rajopadhye & Lo, Parallel Implementation of Divide-and-Conquer Algorithms on Binary de Bruijn Networks 1991 LIBTR Chazelle & Matousek, Derandomizing an Output-Sensitive Convex Hull Algorithm in Three Dimensions 1991 LIBTR Friedman, On the Bit Extraction Problem 1991 LIBTR Han & Kelsen & Ramachandran & Tarjan, Computing Minimal Spanning Subgraphs in Linear Time 1991 LIBTR Tay & Loke, A Theory for Deadlocks 1991 LIBTR Rosenberg, Lower Bounds in Geometric Searching (thesis) 1991 LIBTR Ahuja & Orlin & Stein & Tarjan, Improved Algorithms for Bipartite Network Flow 1991 LIBTR Regnier, Performance of String Searching Algorithms under Various Probabilistic Models 1991 LIBTR Hanson, MIT Scheme Reference Manual 1991 LIBTR Fraenkel & Simonson, Geography 1991 LIBTR Fraenkel & Simpson, On Infinite Disjoint Covering Systems 1991 LIBTR Fraenkel & Loebl, Complexity of Circuit Intersection in Graphs 1991 LIBTR Biham & Shamir, Different Cryptanalysis of Feal and n-Hash 1991 LIBTR Biham & Shamir, Different Cryptanalysis of Snefru, Khafre, REDOC-II, LOKI and Lucifer 1991 LIBTR Fraenkel & Kimberling, Generalized Wythoff Arrays, Shuffles and Interspersions 1991 LIBTR Corella, Mechanizing Set Theory 1991 LIBTR Malcolm & Gaines, A Word Processor Supporting Group-Writing 1991 LIBTR Greenberg, An Annotated Bibliography of Computer Supported Cooperative Work 1991 LIBTR Bshouty, Euclid's GCD Algorithm Is Not Optimal Part I. Upper Bound 1991 LIBTR Averbuch & Bshouty & Kaminski, A Classification of Algorithms for Multiplying Polynomials of Small Degree over Finite Fields 1991 LIBTR Malcolm, Group Writer a Word Processor for Collaborative Document Preparation 1991 LIBTR Cole & Zajicek, The APRAM -- The Rounds Complexity Measure and the Explicit Costs of Synchronization 1991 LIBTR Pellegrini, Combinatorial and Algorithmic Analysis of Stabbing and Visibility Problems in 3-dimensional Space 1991 LIBTR Cole, Tight Bounds on the Complexity of the Boyer-Moore Pattern Matching Algorithm 1991 LIBTR Rigoutsos & Hummel, On a Parallel Implementation of Geometric Hashing on the Connection Machine 1991 LIBTR Clarkson & Cole & Tarjan, Randomized Parallel Algorithms for Trapezoidal Diagrams 1991 LIBTR Cole & Zajicek, An Asynchronous Parallel Algorithm for Undirected Graph Connectivity 1991 LIBTR Stauffer & Hirschberg, Parallel Data Compression 1991 LIBTR Bhatia & Hirschberg & Scherson, Shortest Paths in Orthogonal Graphs 1991 LIBTR Lelewer, Data Compressions on Machines with Limited Memory 1991 LIBTR Hoene, Monotonic Enumerations of Complete Sets 1991 LIBTR Cohn & Tesauro, How Tight are the Vapnik-Chervonenkis Bounds? 1991 LIBTR Zwick & Paterson, The Memory Game 1991 LIBTR Gibbons, A Tutorial Introduction to Distributed Memory Models of Parallel Computation 1991 LIBTR Martin & Otto & Felten, Large-Step Markov Chains for the Traveling Salesman Problem 1991 LIBTR Vaidyanathan & Hartmann & Varshney, Optimal Parallel Lexicographic Sorting Using a Fine-grained Decomposition 1991 LIBTR Kurtz & Mahaney & Royer, Average Dependence and Random Oracles (preliminary report) 1991 LIBTR Mansour & Fox, An Evolutionary Approach to Load Balancing Parallel Computations 1991 LIBTR Dai, Complexity Issues in Strictly Non-blocking Networks 1991 LIBTR Shields, Cube Complexes as Automata 1991 LIBTR Thomas, Parallel Simulation of Petri Nets 1991 LIBTR Anderson, Wait-free Parallel Algorithms for the Union-Find Problem 1991 LIBTR Nakamura, Three-Dimensional Connected Pictures are not Recognizable by Finite-State Acceptors 1991 LIBTR Fekete & Lynch & Mansour & Spinelli, The Impossibility of Implementing Reliable Communication in the Face of Crashes 1991 LIBTR Attiya & Lynch, Time Bounds for Real-time Process Control in the Presence of Timing Uncertainty 1991 LIBTR Lynch & Attiya, Using Mappings to Prove Timing Properties 1991 LIBTR Rivest & Glasser, A Fast Muliport Memory Based on Single-Port Memory Cells 1991 LIBTR Micali & Rogaway, Secure Computation (preliminary report) 1991 LIBTR Bellare, Randomness in Interactive Proofs 1991 LIBTR Grigni, Structure in Monotone Complexity 1991 LIBTR Hsieh & Weihl, Scalable Reader-Writer Locks for Parallel Systems 1991 LIBTR Nebel & Backstrom, On the Computational Complexity of Temporal Projection and Some Related Problems 1991 LIBTR Grigoriadis & Khachiyan, Approximate Solution of Matrix Games in Parallel 1991 LIBTR Yang & Gerasoulis, A Fast Static Scheduling Algorithm for DAGs on an Unbounded Number of Processors 1991 LIBTR Wei & Levy, Design and Analysis of Efficient Hierarchical Interconnection Networks 1991 LIBTR Imielinska & Kalantari, A Generalized Hypergreedy Algorithm for Perfect Matching 1991 LIBTR Chen & Kruskal, An EREW Parallel Algorithm for List Ranking Image Curves in O(log N) Time 1991 LIBTR Averbuch & Bshouty & Kaminski, A Classification of Algorithms for Multiplying Polynomials of Small Degree over Finite Fields 1991 LIBTR Bshouty, Euclid's GCD Algorithm Is Not Optimal Part I. Upper Bound 1991 LIBTR Greenberg, An Annotated Bibliography of Computer Supported Cooperative Work 1991 LIBTR Kannan & Yao, Program Checkers for Probability Generation 1991 LIBTR Lovasz, How to Compute the Volume? 1991 LIBTR Nisan & Widgerson, Rounds in Communication Complexity Revisited 1991 LIBTR Maurer, A Digital Signature Scheme and a Public-Key Cryptosystem based on Elliptic Curves over Z_m 1991 LIBTR Allender & Cai & Feigenbaum, Workshop Summary: Structural Complexity and Cryptography 1991 LIBTR McGeoch, Using the Short-Path Subgraph to Find Shortest Paths 1991 LIBTR Monma & Suri, Transitions in Geometric Minimum Spanning Trees 1991 LIBTR Allender, Rudimentary Reductions Revisited 1991 LIBTR Agarwal & Shrir, Counting Circular Arc Intersections 1991 LIBTR Kahn, Recent Results on Some Not-So-Recent Hypergraph Matching and Covering Problems 1991 LIBTR Agarwal & Sharir, Applications of a New Space Partitioning Technique 1991 LIBTR Barthelemy & Hudry & Isaak & Roberts & Tesman, The Reversing Number of a Digraph 1991 LIBTR Grigoriadis & Khachiyan, Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints 1991 LIBTR Halldorsson, Improved Performance Guarantee of Randomized On-line Graph Coloring 1991 LIBTR Lovasz & Winkler, Note: On the Last New Vertex Visited by a Random Walk 1991 LIBTR Cai & Condon & Lipton, PSPACE is Provable by Two Provers in One Round 1991 LIBTR Yao, Probabilistic Behavior of Shortest Paths over Unbounded Regions 1991 LIBTR Hu & Hwang, A Competitive Algorithm for the Counterfeit Coin Problem 1991 LIBTR Lovasz & Naor & Newman & Wigderson, Search Problems in the Decision Tree Model 1991 LIBTR Feige, On the Success Probability of the Two Provers in One-Round Proof Systems 1991 LIBTR Maheo & Sacle, Some Minimum Broadcast Graphs 1991 LIBTR Bouabdallah & Konig, A Fault-Tolerant Algorithm for the Distributed Mutual Exclusion Problem 1991 LIBTR Miller & Arnaldo & Gonzalez, The Geometry of Backpropagation Training: Visualization, Heuristics, and Theory 1991 LIBTR Smith & Samadzadeh, An Annotated Bibliography of Literate Programming 1991 LIBTR Harrison & Abowd, Formal Methods in Human Computer Interaction: A Tutorial 1991 LIBTR Krizanc & Narayanan, Off-line Routing with Small Queues on a Mesh-connected Processor Array 1991 LIBTR Hemachandra & Jain & Vereshchagin, Banishing Robust Turing Completeness 1991 LIBTR Bayer, Non-deterministic Computing, Transactions and Recursive Atomicity 1991 LIBTR Hussmann, Nondeterministic Algebraic Specifications 1991 LIBTR Rao, Commutativity and Parallel Program Design 1991 LIBTR Barnett & Payne & van de Geijn, Optimal Braodcasting in Mesh-connected Architectures 1991 LIBTR Barborak & Malek & Dahbura, The Consensus Problem in Fault-tolerant Computing 1991 LIBTR Janak & Pattnaik, Protein Calculations on Parallel Processors. I. Parallel Algorithm for the Potential Energy 1991 LIBTR Wagner, Some Mathematical Thoughts on Languages for Data Directed Design 1991 LIBTR Nackman & Srinivasan, Point Placement Algorithms for Deluanay Triangulation of Polygonal Domains 1991 LIBTR Scarf & Shallcross, Shortest Integer Vectors 1991 LIBTR Afrati & Cosmadakis & Yannakakis, On Datalog vs. Polynomial Time 1991 LIBTR Moran & Jahanian, Cheap Mututal Exclusion 1991 LIBTR Berman & Garay & Perry, Early Stopping Distributed Consensus with Minimum Message Size 1991 LIBTR Bhattacharya & Georgiadis & Tsoucas, Extended Polymatroids: Properties and Optimization 1991 LIBTR Borguraev, Building a Lexicon: The Contribution of Computers 1991 LIBTR Mumick & Finkelstein & Pirahesh & Ramakrishnan, Magic is Relevant 1991 LIBTR Berry & Hellerstein, Characterizing and Interpreting Periodic Behavior in Computer Systems 1991 LIBTR Hillebrand & Kanellakis & Mairson & Vardi, Tools for Datalog Boundedness 1991 LIBTR Rudolph & Slivkin & Upfal, A Simple Load Balancing Scheme for Task Allocation in Parallel Machines 1991 LIBTR Bruck & Cypher & Soroker, Running Ascend-Descend Algorithms on Faulty Hypercubes 1991 LIBTR Feder & Kushilevitz & Naor, Amortized Communication Complexity 1991 LIBTR Hadzilacos & Halpern, Message-Optimal Protocols for Byzantine Agreement 1991 LIBTR Mohan & Narang, Algorithms for Creating Indexes for Very Large Tables without Quiescing Updates 1991 LIBTR Lassez & Lassez, Quantifier Elimination for Conjuctions of Linear Constraints via a Convex Hull Algorithm 1991 LIBTR Stone & Cocke, Computer Architecture in the 1990s 1991 LIBTR Baladi & Rockmore & Tongring & Tresser, Renormalization on the n-dimensional Torus 1991 LIBTR Hadzilacos & Halpern, The Failure Discovery Problem 1991 LIBTR Lauwereins & Bruck, Efficient Implementation of a Neural Multiplier 1991 LIBTR Tien & Ho & Yang, Broadcasting on Incomplete Hypercubes 1991 LIBTR Rissanen, The Minimal Description Length Principle 1991 LIBTR Bruck & Cypher & Soroker, Tolerating Faults in Hypercubes Using Subcube Partitioning 1991 LIBTR Bruck & Cypher & Ho, Fault-tolerant Meshes with Minimal Numbers of Spares 1991 LIBTR Sagiv & Saraiya, Minimizing Restricted-Fanout Queries 1991 LIBTR Bruck & Cypher & Ho, On the Construction of Fault-tolerant Cube-connected Cycles Networks 1991 LIBTR Cohen & Megiddo, New Algorithms for Generalized Network Flows 1991 LIBTR Kieburtz & Agapiev, What is an Abstract Machine? 1991 LIBTR Golin, A Provably-Fast Linear-Expected-Time Maxima-Finding Algorithm 1991 LIBTR Golin, Probabilistic Analyses of Closest Pair Algorithms 1991 LIBTR Belhamissi & Jegado, Scheduling in Distributed Systems: Survey and Questions 1991 LIBTR Dershowitz & Jouannaud & Klop, Open Problems in Rewriting 1991 LIBTR Fokkinga, Calculate Categorically! 1991 LIBTR Kanovich, Fast Theorem Proving in Intuitionistic Propositional Logic 1991 LIBTR Rekers, Generalized LR Parsing for General Context-free Grammars 1991 LIBTR Makedon & Symvonis, Optimal Algorithms for Multipacket Routing Problems on Rings 1991 LIBTR Golan, Direct Polyhedron Projection Algorithm 1991 LIBTR Chen & Yu & Wu, Optimal All-to-All Braodcasting Schemes in Distributed Systems with Multi-port Communication 1991 LIBTR Haas & Sclinger, Database Research at the IBM Almaden Research Center 1991 LIBTR Golan, An Algorithm to Build Convex Polyhedra 1991 LIBTR Aggarwal & Raghavan, Deferred Data Structure for the Nearest Neighbor Problem 1991 LIBTR Dwork & Stockmeyer, Bounds on the Time to Reach Agreement as a Function of Message Delay 1991 LIBTR Malhotra & Munroe, Support for Persistent Objects: Two Architectures 1991 LIBTR Forrest & Tomlin, Implementing Interior Point Linear Programming Methods in the Optimization Subroutine Library 1991 LIBTR Ho & Johnsson & Edelman, Matrix Multiplication on Hypercubes Using Full Bandwidth and Constant Storage 1991 LIBTR Gregoire & Makowsky & Levin, Programming Reactive Systems with Statecharts 1991 LIBTR Bar-Yehudah & Etzion & Moran, Rotating-Table Games and Derivatives of Words 1991 LIBTR Chor & Gereb-Graus & Kushilevitz, On the Structure of the Privacy Hierarchy 1991 LIBTR Alon & Goldreich & Hastad & Peralta, Simple Constructions of Almost k-wise Independent Random Variables 1991 LIBTR Attiya, Implementing FIFO Queues and Stacks (preliminary version) 1991 LIBTR Bracha & Rachman, Randomized Consensus in Expected O(n^2 log n) Operations 1991 LIBTR Biran & Moran & Zaks, Deciding 1-Solvability of Distributed Tasks is NP-hard 1991 LIBTR Broy & Kloos, Weakening the Weak Conditions for Self-timed Circuits 1991 LIBTR Chaitin, LISP Program-Size Complexity 1991 LIBTR Buhmann & Micchelli, On Radial Basis Approximation on Periodic Grids 1991 LIBTR Johnson & Nemhauser, Recent Developments and Future Directions in Mathematical Programming 1991 LIBTR Yang & Lee & Wong, On Bends and Lengths of Rectilinear Paths: A Graph-theoretic Approach 1991 LIBTR Chiang & Sarrafzadeh & Wong, An Optimal Algorithm for Rectilinear Steiner Trees for Switchbox with Obstacles 1991 LIBTR Mansour & Park & Schieber & Sen, Improved Selection in Totally Monotone Arrays 1991 LIBTR Aggarwal, Parallel Complexity of Computing a Maximal Set of Disjoint Paths 1991 LIBTR Heckert & Bolle, On Geometric Hashing and the Generalized Hough Transform 1991 LIBTR Akl & Qiu, Data Communication and Computational Geometry on the Star and Pancake Interconnection Networks 1991 LIBTR Skillicorn & Woodside, An Analytic Result on Grain Size 1991 LIBTR Ergincan & Dawes & Bermond, De Bruijn Bus Networks and their Generalization 1991 LIBTR Skillicorn, Practical Parallel Computation I. Models of Computation 1991 LIBTR Skillicorn, Practical Parallel Computation II. Categorical Data Types 1991 LIBTR Akl & Duboux & Stojmenovic, Constant Delay Parallel Counters 1991 LIBTR Frandsen & Sturtivant, What is an Efficient Implementation of the Lambda-Calculus? 1991 LIBTR Frandsen & Valence & Barrington, Some Results on Uniform Arithmetic Circuit Complexity 1991 LIBTR Collins & Jefferson, Selection in Massively Parallel Genetic Algorithms 1991 LIBTR Cong & Kahng & Robins, Provably Good Performance-driven Global Routing 1991 LIBTR Lamport, The Temporal Logic of Actions 1991 LIBTR Paschos, An Approximation Algorithm for Set Cover 1991 LIBTR Paschos, A Theorem on the Approximation of Set Cover and Vertex Cover 1991 LIBTR de la Vega & Santha, Average Case Analysis of the Merging Algorithm of Hwang and Lin 1991 LIBTR Rozoy & Saquet, A Distributed Routing Protocol 1991 LIBTR Schweizer, Combinatorial Design of Fault-tolerant Communication Structures, with Applications to Non-blocking Switches 1991 LIBTR van de Snepscheut, Inversion of a Recursive Tree Traversal 1991 LIBTR Martin, Asynchronous Datapaths and the Design of an Asynchronous Adder 1991 LIBTR Selman, A Taxonomy of Complexity Class of Functions 1991 LIBTR He, Efficient Parallel Algorithms for Two Graph Layout Problems 1991 LIBTR Homer & Selman, Complexity Theory 1991 LIBTR Walker, Common Knowledge: A Survey 1991 LIBTR Rajasekaran & Raghavachari, Optimal Randomized Algorithms for Multipacket and Wormhole Routing on the Mesh 1991 LIBTR Wei, Emulation of a PRAM on Leveled Networks 1991 LIBTR Applegate, Sampling, Integration, and Computing Volumes 1991 LIBTR Teng, Points, Spheres, and Separators: A Unified Geometric Approach to Graph Partitioning 1991 LIBTR Bates & Lavie, Recognizing Substrings of LR(k) Languages in Linear Time 1991 LIBTR Brunvand, Translating Concurrent Communicating Programs into Asynchronous Circuits 1991 LIBTR Tarjan, Efficient Maximum Flow Algorithms 1991 LIBTR Dietzfelbinger & Karlin & Mehlhorn & Meyer auf der Heide & Rohnert & Tarjan, Dynamic Perfect Hashing: Upper and Lower Bounds 1991 LIBTR Cai & Han & Tarjan, An O(m log n)-Time Algorithm for the Maximal Planar Subgraph Problem 1991 LIBTR Flajolet & Soria, General Combinatorial Schemas: Gaussian Limit Distributions and Exponential Tails 1991 LIBTR Konig & Sotteau, Symmetric Routings of the Hypercube 1991 LIBTR Baumslag & Heydemann & Opatrny & Sotteau, Embeddings of Shuffle-like Graphs in Hypercubes 1991 LIBTR Manoussakis & Tuza, The Forwarding Index of Directed Networks 1991 LIBTR Saad, Complexity of the Forwarding Index Problem 1991 LIBTR Reingold & Wang & Zuck, Games I/O Automata Play 1991 LIBTR Tian & Zelkowitz, Notes on Data Complexity and Comprehension 1991 LIBTR Eggleton & Fraenkel & Simpson, Beatty Sequences and Langford Sequences 1991 LIBTR Moses & Tennenholtz, Barriers, Tools and the Qualitative Complexity of Processes 1991 LIBTR Harel & Raz, Deciding Emptiness for Stack Automata on Infinite Trees 1991 LIBTR Fraenkel, Iterated Floor Function, Algebraic Numbers, Discrete Chaos, Beatty Subsequences, Semigroups 1991 LIBTR Maass, On-line Learning with an Oblivious Environment and the Power of Randomization 1991 LIBTR Burgisser & Karpinski & Lickteig, Some Computational Problems in Linear Algebra as Hard as Matrix Multiplication 1991 LIBTR Karp, Parallel Combinatorial Computing 1991 LIBTR Grigoriev & Karpinski, Algorithms for Sparse Rational Interpolation 1991 LIBTR Hellerstein & Karpinski, Computational Complexity of Learning Read-Once Formulas over Different Bases 1991 LIBTR Pinotti & Pucci, Parallel Priority Queues 1991 LIBTR Grigoriev & Karpinski & Singer, Computational Complexity of Sparse Rational Interpolation 1991 LIBTR Karp, Probabilistic Recurrence Relations 1991 LIBTR Pan & Reif, Generalized Compact Multigrid 1991 LIBTR Pucci & Zimmermann, On the Average Case Complexity of Parallel Sublist Selection 1991 LIBTR Attiya & Mavronicolas, Efficiency of Semi-synchronous versus Asynchronous Networks 1991 LIBTR Babaoglu, Tools and Techniques for Adding Fault Tolerance to Distributed and Parallel Programs 1991 LIBTR Canny & Donald & Ressler, Geometric Algorithms (extended abstract) 1991 LIBTR Chang, On the Structure of NP Computations under Boolean Operators (Ph.D thesis) 1991 LIBTR Field, Incremental Reduction in the Lambda Calculus and Related Reduction Systems 1991 LIBTR Connelly & Freimer, Covering a Triangle with Disks Centered on its Boundary 1991 LIBTR Haussler & Opper, Calculation of the Learning Curve of Bayes Optimal Classification Algorithm for Learning a Perceptron with Noise 1991 LIBTR Narendran & Tiwari, Polynomial Root-finding: Analysis and Computational Investigation of a Parallel Algorithm 1991 LIBTR Naughton & Ramakrishnan & Sagiv & Ullman, Argument Reduction by Factoring 1991 LIBTR Srivastava & Sudarshan & Ramakrishnan & Naughton, Space Optimization in Deductive Databases 1991 LIBTR Long & Sheu, A Refinement of the Low and High Hierarchies 1991 LIBTR Wu & Manber, Fast Text Searching with Errors 1991 LIBTR Lai & Manber, Flying through Hypertext 1991 LIBTR Downey, Regular Variation and the Solution of Recurrences 1991 LIBTR Lin, Approximating the Chromatic Polynomial of a Graph 1991 LIBTR Kurtz & Mahaney & Royer, Average Dependence and Random Oracles 1991 LIBTR Matri-Oliet & Meseguer, From Petri Nets to Linear Logic through Categories: A Survey 1991 LIBTR Shankar, Mechanical Verification of a Schematic Protocol for Byzantine Fault-tolerant Clock Sychronization 1991 LIBTR Kapur, Computational Learning of Languages 1991 LIBTR Coleman, Large-scale Numerical Optimization: Introduction and Overview 1991 LIBTR Bay & Bilardi, Deterministic On-line Routing on Area-universal Networks 1991 LIBTR Schneider & Bloom & Marzullo, Putting Time into Proof Outlines 1991 LIBTR Pearson & Vazirani, Efficient Sequential and Parallel Algorithms for Maximal Bipartite Sets 1991 LIBTR Murthy, Classical Proofs as Programs: How, What and Why 1991 LIBTR Vavasis, Approximation Algorithms for Indefinite Quadratic Programming 1991 LIBTR Misra & Gries, A Constructive Proof of Vizing's Theorem 1991 LIBTR Rohatgi, Saving Queries with Randomness 1991 LIBTR Rus, On Dexterous Rotations of Polygons 1991 LIBTR Carroll & Verhagen & Wong, Chaotic Cryptography 1991 LIBTR Salomaa & Yu, Degrees of Nondeterminism for Pushdown Automata 1991 LIBTR Kolaitis & Thakur, Approximation Properties of NP Minimization Classes 1991 LIBTR Acker & Miranker, On Parallel Divide-and-Conquer 1991 LIBTR Elomaa & Kivinen, Learning Decision Trees from Noisy Examples 1991 LIBTR Kilpelainen & Mannila, Ordered and Unordered Tree Inclusion 1991 LIBTR Skubiszewski, Binary Periodic Synchronizing Sequences 1991 LIBTR Gallier, Constructive Logics. Part I: A Tutorial on Proof Systems and Typed Lambda-Calculi 1991 LIBTR Gallier, Constructive Logics. Part II: Linear Logic and Proof Nets 1991 LIBTR Kesner, Pattern Matching in Order-sorted Languages 1991 LIBTR Akl & Calvert & Stojmenovic, Systolic Generation of Derangements 1991 LIBTR Osiakwan & Akl, An EP Algorithm for Computing a Minimum Weight Perfect Matching for a Set of Points on the Plane 1991 LIBTR Lindon & Akl, An Optimal Implementation of Broadcasting with Selective Reduction 1991 LIBTR Qiu & Akl & Meijer, The Star and Pancake Interconnection Networks: Properties and Algorithms 1991 LIBTR Lin, Parallel Algorithms for Routing in Non-blocking Networks 1991 LIBTR Lin, Fault Tolerant Planar Communication Networks 1991 LIBTR Gil & Matias, Fast Hashing on a PRAM -- Designing by Expectation 1991 LIBTR Gil, Fast Load Balancing on a PRAM 1991 LIBTR Harrison & Meyer, A Debugger for the Postscript Language 1991 LIBTR Koppelman & Oruc, The Complexity of Routing in Permutation Networks 1991 LIBTR Berkman & Matias & Vishkin, Randomized Range-Maxima in Nearly-Constant Parallel Time 1991 LIBTR Grigoriev & Karpinski & Odlyzko, Short Proofs for Nondivisibility of Sparse Polynomials under the Extended Riemann Hypothesis 1991 LIBTR Jokinen & Tarhio & Ukkonen, A Comparison of Approximate String Matching Algorithms 1991 LIBTR Raynal, A Simple Taxonomy for Distributed Mutual Exclusion Algorithms 1991 LIBTR Murthy, An Evaluation Semantics for Classical Proofs 1991 LIBTR Li, A Globally Convergent Method for Lp Problems 1991 LIBTR Huttenlocher & Klanderman & Rucklidge, Comparing Images Using the Hausdorff Distance under Translation 1991 LIBTR Stewart, Robust Point Location in Approximate Polygons 1991 LIBTR Klarlund & Kozen, Rabin Measures and their Applications to Fairness and Automata Theory 1991 LIBTR Freimer, Shattering Configurations of Points with Hyperplanes 1991 LIBTR Rohatgi, A Note on Time-Space Bounded Interactive Protocols 1991 LIBTR Freimer & Mitchell & Piatko, On the Complexity of Shattering Using Arrangements 1991 LIBTR Maelbrancke & Olivie, Updating Search Trees with 0(1) Rotations Using Local and Global Balance Criteria 1991 LIBTR Clamen, Data Persistence in Programming Languages: A Survey 1991 LIBTR Rogaway, The Round Complexity of Secure Protocols 1991 LIBTR Blum, Algorithms for Approximate Graph Coloring 1991 LIBTR Schwabe, Efficient Embeddings and Simulations for Hypercubic Networks 1991 LIBTR Lim, Waiting Algorithms for Synchronization in Large-scale Multiprocessors 1991 LIBTR Newman, Randomness and Robustness in Hypercube Computation 1991 LIBTR Bennett & Mangasarian, Robust Linear Programming Discrimination of Two Linearly Inseparable Sets 1991 LIBTR Srinivasan & Carey, Performance of On-line Index Construction Algorithms 1991 LIBTR Yackel & Meyer, Optimal Tilings for Parallel Database Design 1991 LIBTR Lynch & Attiya, Using Mappings to Prove Timing Properties 1991 LIBTR Awerbuch & Baratz & Peleg, Cost-sensitive Analysis of Communication Protocols 1991 LIBTR Rogaway, The Complexity of Continuous Optimization 1991 LIBTR Aspnes & Herlihy & Shavit, Counting Networks 1991 LIBTR Bellare & Goldwasser, The Complexity of Decision versus Search 1991 LIBTR Gupta, Formal Hardware Verification Methods: A Survey 1991 LIBTR Sleator & Tarjan & Thurston, Short Encodings of Evolving Structures 1991 LIBTR Nettles & Wing, Persistence + Undoability = Transactions 1991 LIBTR Shaw & Tomayko, Models for Undergraduate Project Courses in Software Engineering 1991 LIBTR Herskovits, Computer-based Probabilistic-Network Construction 1991 LIBTR Cohen, Combinatorial Algorithms for Optimization Problems 1991 LIBTR Fischer & Goldberg & Plotkin, Approximating Matchings in Parallel 1991 LIBTR Goldberg, A Natural Randomization Strategy for Multicommodity Flow and Related Algorithms 1991 LIBTR Orlin & Plotkin & Tardos, Polynomial Dual Network Simplex Algorithms 1991 LIBTR Leighton & Makedon & Plotkin & Stein & Tardos & Tragoudas, Fast Approximation Algorithms for Multicommodity Flow Problems 1991 LIBTR Gil & Matias, Leader Election without a Conflict Resolution Rule -- Fast and Efficient Randomized Simulations among CRCW PRAMs 1991 LIBTR Gil & Matias & Vishkin, Towards a Theory of Nearly Constant Time Parallel Algorithms 1991 LIBTR Novik, Automated Proving of Geometry Theorems Possibly Involving Inequalities 1991 LIBTR Salem & Barbara & Lipton, Probabilistic Diagnosis of Hot Spots 1991 LIBTR Kirkpatrick & Klawe & Tarjan, Polygon Triangulation in O(N log log N) Time with Simple Data Structures 1991 LIBTR Cai, Computations over Infinite Groups 1991 LIBTR Clarkson & Cole & Tarjan, Randomized Parallel Algorithms for Trapezoidal Diagrams 1991 LIBTR Lovasz & Young, Lecture Notes on Evasiveness of Graph Properties 1991 LIBTR Mishra & Tarjan, A Linear-Time Algorithm for Finding an Ambitus 1991 LIBTR Chazelle & Edelsbrunner & Guibas & Sharir & Snoeyink, Computing a Face in an Arrangement of Line Segments and Related Problems 1991 LIBTR Chazelle & Friedman, Point Location among Hyperplanes and Unidirectional Ray-Shooting 1991 LIBTR Ristad, Human Language Comprehension is NP-Complete 1991 LIBTR Chazelle, An Optimal Convex Hull Algorithm for Points Sets in any Fixed Dimension 1991 LIBTR Chazelle, Cutting Hyperplanes for Divide-and-Conquer 1991 LIBTR Sha & Steiglitz, Reliable Reconfigurable Structures for Array Architectures 1991 LIBTR Noh & Agrawala, A Study of Three Matrix Multiplication Algorithms on the Connection Machine 1991 LIBTR Edelsbrunner & Seidel & Sharir, On the Zone Theorem for Hyperplane Arrangements 1991 LIBTR Pitassi & Beame & Impagliazzo, Exponential Lower Bounds for the Pigeonhole Principle 1991 LIBTR Devillers, Randomization Yields Simple O(n log* n) Algorithms for Difficult omega(n) Problems 1991 LIBTR Raoult, A Survey of Tree Transductions 1991 LIBTR Abu-Amara & Kanevsky, Simple Optimal Algorithm for Leader Election 1991 LIBTR Cai & Chen, A Simple Characterization of the Boolean Hierarchy 1991 LIBTR Kambhatla, Hypercube vs. Cube-connected Cycles: A Topological Evaluation 1991 LIBTR Hager & Horst & Pardalos, Mathematical Programming, A Computational Perspective 1991 LIBTR Furer & Raghavachari, Parallel Edge Coloring Approximation 1991 LIBTR Peng & Purushothaman, Empty Stack Pushdown omega-Tree Automata 1991 LIBTR Purushothaman & Seaman, An adequate Operational Semantics of Sharing in Lazy Evaluation 1991 LIBTR Maass & Schnitger & Sontag, On the Computational Power of Sigmoid versus Boolean Threshold Circuits 1991 LIBTR Bui & Jones, Finding Good Approximate Vertex and Edge Partitions is NP-Hard 1991 LIBTR Berman & Ramaiyer, An Approximation Algorithm for the Steiner Tree Problem 1991 LIBTR Bui & Jones, Vertex and Edge Partitioning Algorithms for Tree Structured Graphs and Graphs with Small Separators 1991 LIBTR Williams, Applications of Computational Geometry to Volume Visualization 1991 LIBTR Pierce & Deneen & Shute, Teaching Software Design in the Freshman Year 1991 LIBTR Pach & Agarwal, Combinatorial Geometry 1991 LIBTR Rubinfeld, Interactive Proofs with Space Bounded Provers 1991 LIBTR Adler & Shamir, Greedily Solvable Transportation Networks and Edge-guided Vertex Elimination 1991 LIBTR Golumbic & Shamir, Complexity and Algorithms for Reasoning about Time: A Graph-theoretic Approach 1991 LIBTR Krawczyk, Checking Weak Programs: The Case of Small Dimensional Linear Programming (extended abstract) 1991 LIBTR Radhakrishnan, Graph Entropy and Formula Complexity 1991 LIBTR Roberts & Xu, On the Optimal Strongly Connected Orientations of City Street Graphs IV: Four East-West Avenues or North-South Streets 1991 LIBTR Roberts, On the Indicator Function of the Plurality Function 1991 LIBTR Goldreich & Krawczyk, On the Composition of Zero-Knowledge Proof Systems 1991 LIBTR Coffman & Garey, Proof of the 4/3 Conjecture for Preemptive vs. Nonpreemptive Two-processor Scheduling 1991 LIBTR Mahadev & Roberts & Santhanakrishnan, 3-Choosable Complete Bipartite Graphs 1991 LIBTR Feigenbaum & Kahn & Lund, Complexity Results for Pomset Languages 1991 LIBTR Hwang & Rothblum & Shepp, Monotone Optimal Multi-partitions Using Schur Convexity with Respect to Partial Orders 1991 LIBTR Spencer & Winkler, Three Thresholds for a Liar 1991 LIBTR Pierce, Bounded Quantification is Undecidable 1991 LIBTR Ramalingam & Reps, On the Computational Complexity of Incremental Algorithms 1991 LIBTR Sorenson, An Analysis of Two Prime Number Sieves 1991 LIBTR Goldberg, Combinatorial Optimization Lecture Notes for CS363/OR349 Winter 1991 1991 LIBTR Tromp & Vitanyi, Randomized Wait-free Test-and-Set 1991 LIBTR Dietz & Raman, Persistence, Amortization and Randomization 1991 LIBTR Marsh & Brown & LeBlanc & Scott & Becker & Das & Karlsson & Quiroz, The Rochester Checkers Player: Multi-model Parallel Programming for Animate Vision 1991 LIBTR Jha, Defying Upward Separation 1991 LIBTR Chronaki & Markatos, A Lower Bound for the Closest Pair Problem 1991 LIBTR Chang & Phillips & Ullman, A Programming and Problem Solving Seminar 1991 LIBTR Hemachandra & Spaan, Quasi-injective Reductions 1991 LIBTR Tromp & Vitanyi, A Randomized Algorithm for Two-process Wait-free Test-and-Set 1991 LIBTR Li & Vitanyi, Combinatorial Properties of Finite Sequences with High Kolmogorov Complexity 1991 LIBTR Spaan, Census Techniques on Relativized Space Classes 1991 LIBTR Nishimura, Asynchrony in Shared Memory Parallel Computation 1991 LIBTR Chen & Gross, A Relationship of Average Genus to the Graph Isomorphism Problem 1991 LIBTR Chen & Joshi, An Algorithmic Result in Graph Imbeddings 1991 LIBTR Gao & Guibas & Kirkpatrick & Laaser & Saxe, Finding Extrema with Unary Predicates 1991 LIBTR Myers, A Sublinear Algorithm for Approximate Keyword Searching 1991 LIBTR Abadi & Halpern, Decidability and Expressiveness for First-order Logics of Probability 1991 LIBTR Sipser & Kapron & Pitassi, Topics in Complexity Theory: I. Expander Graphs II. Descriptive Set Theory 1991 LIBTR Berkman & Vishkin, Almost Fully-parallel Parentheses Matching 1991 LIBTR Khuller & Naor, Flow in Planar Graphs with Vertex Capacities 1991 LIBTR Nitzberg & Lo, Distributed Shared Memory: A Survey of Issues and Algorithms 1991 LIBTR Brookes & Geva, Towards a Theory of Parallel Algorithms on Concrete Data Structures 1991 LIBTR Li & Vitanyi, Combinatorics and Kolmogorov Complexity 1991 LIBTR Blum & Jiang & Li & Tromp & Yannakakis, Linear Approximation of Shortest Superstrings 1991 LIBTR Li & Vitanyi, Optimality of Wait-free Atomic Multiwriter Variables 1991 LIBTR Harrison & Pan, IncTex: An Incremental Document Processing System 1991 LIBTR Sadeh, Look-ahead Techniques for Micro-opportunistic Job Shop Scheduling 1991 LIBTR Bershad, Mutual Exclusion for Uniprocessors 1991 LIBTR Stricker, Message Routing on Irregular 2D-Meshes and Tori 1991 LIBTR Shaw & Tomayko, Models for Undergraduate Project Courses in Software Engineering 1991 LIBTR Melissaratos & Souvaine, Coping with Inconsistencies: A New Approach to Produce Quality Triangulations of Polygonal Domains with Holes for the Finite Element Method 1991 LIBTR Bjorling-Sachs & Souvaine, A Tight Bound for Guarding General Polygons with Holes 1991 LIBTR Wolf & Dias & Yu, A Parallel Sort Merge Join Algorithm for Managing Data Skew 1991 LIBTR Harrison & Ossher, Some Persistent Minuses of C++ 1991 LIBTR Nadas, Probabilistic Hidden Perceptrons, Artificial Neural Nets and their Training by an EM Algorithm 1991 LIBTR Corbett, Rotator graphs: An Efficient Topology for Point-to-Point Multiprocessor Networks 1991 LIBTR Dietrich & Escudero & Chance, Efficient Reformulation for 0-1 Programs Methods and Computational Results 1991 LIBTR Oruc, A Study of Permutation Networks: Some Generalizations and Tradeoffs 1991 LIBTR Kao & Mount, Computing Generalized Voronoi Diagrams in Improved Time and Space Bounds 1991 LIBTR Khuller & Thurimella, Approximation Algorithms for Graph Augmentation 1991 LIBTR Jan & Oruc, Fast Self-Routing Permutation Switching on an Asymptotically Minimum Cost Network 1991 LIBTR Khuller & Matias, A Simple Randomized Sieve Algorithm for the Closest-Pair Problem 1991 LIBTR Bell & Nerode & Ng & Subrahmanian, Implementing Deductive Databases by Linear Programming 1991 LIBTR Jalote & Rangarajan & Tripathi, Capacity of Voting Systems 1991 LIBTR Afek & Matias, Elections in Anonymous Networks 1991 LIBTR Berkman & Ja'Ja' & Krishnamurthy & Thurimella & Vishkin, Top-Bottom Routing around a Rectangle is As Easy As Computing Prefix Minima 1991 LIBTR Leighton & Leiserson & Klugerman, Theory of Parallel and VLSI Computation: Lecture Notes for 18.435/6.848 1991 LIBTR Bellare, The Spectral Norm of Finite Functions 1991 LIBTR Schapire, The Design and Analysis of Efficient Learning Algorithms 1991 LIBTR Goemans & Papaefthymiou, Advanced Algorithms: Lecture Notes for 18.415/6.854 1991 LIBTR Huang, An Evaluation of Concurrent Priority Queue Algorithms 1991 LIBTR Wang, An In-depth Analysis of Concurrent b-Tree Algorithms 1991 LIBTR Paterson & Zwick, Shrinkage of de Morgan Formulae under Restriction 1991 LIBTR Booth, Some Fast Algorithms on Graphs and Trees 1991 LIBTR Nurmi & Soisalon-Soininen, Uncoupling Updating and Rebalancing in Chromatic Binary Search Trees 1991 LIBTR Fischer & Wright, Multiparty Secret Key Exchange Using a Random Deal of Cards 1991 LIBTR Wang & Zuck, Real-time Sequence Transmission Problem 1991 LIBTR Stephenson, Fast Ordered Multicasts 1991 LIBTR Birman & Schiper & Stephenson, Lightweight Causal and Atomic Group Multicast 1991 LIBTR Huttenlocher & Kedem & Sharir, The Upper Envelope of Voronoi Surfaces and its Applications 1991 LIBTR Chew & Marzullo, Masking Failure of Multidimensional Systems 1991 LIBTR Beigel & Chang & Ogiwara, A Relationship between Difference Hierarchies and Relativized Polynomial Hierarchies 1991 LIBTR Applegate & Jacobson & Sleator, Computer Analysis of Sprouts 1991 LIBTR Klusener, Completeness in Real Time Process Algebra 1991 LIBTR Veltkamp, 2D and 3D Object Reconstruction with the V-Neighborhood Graph 1991 LIBTR van Eijck & de Vries, Dynamic Interpretation and Hoare Deduction 1991 LIBTR Vogler, Is Partial Order Semantics Necessary for Action Refinement? 1991 LIBTR Broy & Dederichs & Dendorfer & Weber, Characterizing the Behaviour of Reactive Systems by Trace Sets 1991 LIBTR Furbach & Suttner & Fronhofer, Massively Parallel Inference Systems 1991 LIBTR Hussmann, Nondeterministic Algebraic Specifications 1991 LIBTR Bayer, Non-deterministic Computing, Transactions and Recursive Atomicity 1991 LIBTR Gold, Dataflow Semantics for Petri Nets 1991 LIBTR Acharya & Badrinath, An Efficient Protocol for Ordering Broadcast Messages in Distributed Systems 1991 LIBTR Beckmann & Polychronopolous, Broadcast Networks for Fast Synchronization 1991 LIBTR Bellantoni & St. Jacques, ITRC Lecture Series in Complexity: Lectures by A. A. Razborov 1991 LIBTR Bach & Giesbrecht & McInnes, The Complexity of Number Theoretic Problems 1991 LIBTR Kapron, Feasible Computations in Higher Types 1991 LIBTR Stricker, Message Routing on Irregular 2D-Meshes and Tori 1991 LIBTR Brookes & Geva, Towards a Theory of Parallel Algorithms on Concrete Data Structures 1991 LIBTR Blum & Jiang & Tromp & Yannakakis, Linear Approximation of Shortest Superstrings 1991 LIBTR Jiang & Li, On the Complexity of Learning Strings and Sequences 1991 LIBTR Jiang & Li, Towards a DNA Sequencing Theory (Learning a String) 1991 LIBTR Janicki & Koutny, Optimal Simulations, Nets and Reachability Graphs 1991 LIBTR Janicki & Koutny, Invariants and Paradigms of Concurrency Theory 1991 LIBTR Jiang, A Note of the Space Complexity of Some Decision Problems for Finite Automata 1991 LIBTR Ibarra & Jiang & Wang, A Characterization of Exponential-Time Languages by Alternating Context-free Grammars 1991 LIBTR Li & Vitanyi, Kolmogorov Complexity Arguments in Combinatorics 1991 LIBTR Li & Tromp & Vitanyi, How to Share Concurrent Wait-free Variables 1991 LIBTR Li & Vitanyi, Average Case Complexity under the Universal Distribution Equals Worst Case Complexity 1991 LIBTR Akyurek & Salem, Management of Partially-Safe Buffers 1991 LIBTR Garcia-Molina & Salem, Non-deterministic Queue Operations 1991 LIBTR Salem & Barbara & Lipton, Probabilistic Diagnosis of Hot Spots 1991 LIBTR Pugh, The Omega Test: A Fast and Practical Integer Programming Algorithm for Dependence Analysis 1991 LIBTR Khuller & Mitchell & Vazirani, On-line Algorithms for Weighted Bipartite Matching and Stable Marriages 1991 LIBTR Vishkin, Structural Parallel Algorithmics 1991 LIBTR Bundy, On the Nature of Mathematical Judgement: Reply to Penrose 1991 LIBTR Koc & Cappelo & Gallopolous, Decomposing Polynomial Interpolation for Systolic Arrays 1991 LIBTR Chaudhuri, Topics in the Theory of Distributed Computing 1991 LIBTR Anderson & Simons, A Scheduling Problem Arising from Loop Parallelization on MIMD Machines 1991 LIBTR Brisson, Representation of d-Dimensional Geometric Objects 1991 LIBTR Winston & Shellard, Artificial Intelligence at MIT - Expanding Frontiers 1991 LIBTR Broder & Karlin & Raghavan & Upfal, Trading Space for Time in Undirected s-t Connectivity 1991 LIBTR Sorenson, Algorithms in Number Theory 1991 LIBTR Vanacek & Nau & Karinthi, A Simple Approach to Performing Set Operations on Polyhedra 1991 LIBTR Sidhu & Nair & Abdallah, A Distributed Algorithm for Finding Multiple Disjoint Paths 1991 LIBTR Sidhu & Abdallah & Nair, A Distance Vector Algorithm for Alternate Path Routing 1991 LIBTR Gil & Matias, Fast Hashing on a PRAM - Designing by Expectation 1991 LIBTR Matias & Vishkin, Converting High Probability into Nearly-Constant Time - With Applications to Parallel Hashing 1991 LIBTR Cole & Vishkin, On the Detection of Robust Curves 1991 LIBTR Landau & Vishkin, Pattern Matching in a Digitized Image 1991 LIBTR Rangarajan & Tripathi, Efficient Synchronization of Clocks in a Distributed System 1991 LIBTR Romanik, Testing as a Dual to Learning 1991 LIBTR Rangarajan & Tripathi, A Robust Distributed Mutual Exclusion Algorithm 1991 LIBTR Sakho & Muntean, Optimal Systolic Network for Gaussian Elimination 1991 LIBTR Afek & Fischer & Attiya & Lynch & Fekete & Mansour & Wang & Zuck, Reliable Communication over Unreliable Channels 1991 LIBTR Westbrook, Randomized Algorithms for Multiprocessor Page Migration 1991 LIBTR Beigel, Polynomial Interpolation, Threshold Circuits, and the Polynomial Hierarchy 1991 LIBTR Olivie & Vansina, Towards an Object Oriented Logo 1991 LIBTR Embrechts & Roose, A Parallel Distance Transformation Algorithm 1991 LIBTR Kratsch & Hemachandra, On the Complexity of Graph Reconstruction 1991 LIBTR Kyburg, Evidential Probability 1991 LIBTR Ogiwara & Hemachandra, A Complexity Theory for Feasible Closure Properties 1991 LIBTR Kaklamanis & Krizanc & Narayanan & Tsantilas, Randomized Sorting and Selection on Mesh-connected Processor Arrays 1991 LIBTR Haussler & Long, A Generalization of Sauer's Lemma 1991 LIBTR Kratsch & Hemachandra, On the Complexity of Graph Reconstruction 1991 LIBTR Kyburg, Evidential Probability 1991 LIBTR Ogiwara & Hemachandra, A Complexity Theory for Feasible Closure Properties 1991 LIBTR Kaklamanis & Krizanc & Narayanan & Tsantilas, Randomized Sorting and Selection on Mesh-connected Processor Arrays 1991 LIBTR Freivalds & Smith, On the Role of Procrastination for Machine Learning 1991 LIBTR Sidhu & Chung, On Sufficient Conditions for an Efficient Protocol Conformance Test Generation Technique Based on Rural Chinese Postman Problem 1991 LIBTR Hung & Zucker, Semantics of Pointer Referencing and Dereferencing with Intensional Logic 1991 LIBTR Tucker & Zucker, Deterministic and Nondeterministic Computation, and Horn Programs, on Abstract Data Types 1991 LIBTR Tucker & Zucker, Examples of Semicomputable Sets of Real and Complex Numbers 1991 LIBTR Tucker & Zucker, Provable Computable Selection Functions on Abstract Structures 1991 LIBTR Abadi & Burrows & Lampson & Plotkin, A Calculus for Access Control in Distributed Systems 1991 LIBTR Kunen, A Completeness Result for Linked Resolution 1991 LIBTR Netzer & Miller, What are Race Conditions? Some Issues and Formalizations 1991 LIBTR Srinivasan & Carey, On-line Index Construction Algorithms 1991 LIBTR Brunet, An Algorithm for Transforming Iterative Numerical Algorithms to Adaptive Equivalents (Application to the Stokes Problem) 1991 LIBTR Dutt, A Fast Algorithm for the Evaluation of Trigonometric Series 1991 LIBTR Furuta, Important Papers in the History of Document Preparation Systems: Basic Sources 1991 LIBTR Chandran & Mount, A Parallel Algorithm for Enclosed and Enclosing Triangles 1991 LIBTR Mount, The Densest Double-Lattice Packing of a Convex Polygon 1991 LIBTR Kao & Mount & Saalfeld, Dynamic Maintenance of Delaunay Triangulations 1991 LIBTR Raman, Optimal Sub-logarithmic Time Integer Sorting on the CRCW PRAM (note) 1991 LIBTR Berkman & Vishkin, Finding Level-Ancestors in Trees 1991 LIBTR Arkin & Khuller & Mitchell, Geometric Knapsack Problems 1991 LIBTR Adve & Vernon, Performance Analysis of Multiprocessor Mesh Interconnection Networks with Wormhole Routing 1991 LIBTR Woest & Goodman, An Analysis of Synchronization Mechanisms in Shared-Memory Multiprocessors 1990 LIBTR Pratt, Modeling Concurrency with Geometry 1990 LIBTR Pratt, Action Logic and Pure Induction 1990 LIBTR Robbins & Robbins, Choosing a Leader on a Torus 1990 LIBTR Andrews & Barszcz, The C* Parallel Programming Language 1990 LIBTR Aspnes & Herlihy & Shavit, Counting Networks and Multi-processor Coordination (extended abstract) 1990 LIBTR Galton, The Church-Turing Thesis: Its Nature and Status 1990 LIBTR Greenlaw, A Model Classifying Algorithms as Inherently Sequential with Applications to Graph Searching 1990 LIBTR Lin & Vitter, Complexity Issues in Learning by Neural Nets 1990 LIBTR Nodine & Vitter, Greed Sort: An Optimal External Sorting Algorithm for Multiple Disks 1990 LIBTR Brown University, Computer Science Curriculum for the Year 2000 1990 LIBTR Keller & Graefe & Maier, Efficient Assembly of Complex Objects 1990 LIBTR Kao & Shannon, Linear-Processor NC Algorithms for Planar Directed Graphs II: Directed Spanning Trees 1990 LIBTR Guibas & Knuth & Sharir, Randomized Incremental Construction of Delaunay and Voronoi Diagrams 1990 LIBTR Mishra & Pedersen, Arithmetic of Real Algebraic Numbers in NC 1990 LIBTR Chazelle & Edelsbrunner & Guibas & Sharir & Stolfi, Lines in Space: Combinatorics and Algorithms 1990 LIBTR Sharir & Overmars, An Improved Technique for Output-Sensitive Hidden Surface Removal 1990 LIBTR Hong & Tan, Average Time for Boolean Matrix Multiplication 1990 LIBTR Donovan, Performance of Shared Memory in a Parallel Computer 1990 LIBTR Berger & Rigoutsos, An Algorithm for Point Clustering and Grid Generation 1990 LIBTR Lanin & Shasha, Tree Locking on Changing Trees 1990 LIBTR Paterson & Pippenger & Zwick, Optimal Carry Save Networks 1990 LIBTR Banieqbal & Hilditch, The Random Matrix Hashing Algorithm 1990 LIBTR Lipton & Sandberg, A Free-Market Exchange for Information 1990 LIBTR Chazelle & Sharir & Welzl, Quasi-Optimal Upper Bounds for Simplex Range Searching and New Zone Theorems 1990 LIBTR Kapidakis, Average-Case Analysis of Graph-Searching Algorithms 1990 LIBTR Djidjev & Lingas & Sack, An O(N Log N) Algorithm for Computing the Link Center of a Simple Polygon 1990 LIBTR Kolovson, Indexing Techniques for Multi-dimensional Spatial Data and Historical Data in Database Management Systems 1990 LIBTR Chua & Shi, Multiple Layer Cellular Neural Networks: A Tutorial 1990 LIBTR Kim, Optimal Parallel Algorithms on Sorted Intervals 1990 LIBTR Kim, A Parallel Algorithm for Finding a Maximum Clique of a Set of Circular-Arcs of a Circle 1990 LIBTR Anderson, Parallel Algorithms for Generating Random Permutations on a Shared Memory Machine 1990 LIBTR Chaudhuri, Agreement is Harder than Consensus: Set Consensus Problems in Totally Asynchronous Systems 1990 LIBTR Kim, Parallel Algorithms for the Segment-Dragging Problem 1990 LIBTR Kim, Optimal Parallel Algorithms on Sorted Circular Arcs 1990 LIBTR Chandran & Kim & Mount, Parallel Computational Geometry of Rectangles 1990 LIBTR Beame & Tompa & Yan, Communication-Space Tradeoffs for Unrestricted Protocols 1990 LIBTR Kaplan & Shamir, A Primal Dual Path Following Algorithm for Linear Programming with Box Type Constraints 1990 LIBTR Hochbaum & Shamir & Shanthikumar, A Polynomial Algorithm for an Integer Quadratic Nonseparable Transporation Problem 1990 LIBTR Jaromczyk & Swiatek, A Role of Lower Semicontinuous Functions in the Combinatorial Complexity of Geometric Problems 1990 LIBTR Matousek, Cutting Hyperplane Arrangements 1990 LIBTR Gritzmann & Sturmfels, Minkowski Addition of Polytopes: Computational Complexity and Applications to Grobner Bases 1990 LIBTR Aronov & Chazelle & Edelsbrunner & Guibas & Sharir & Wenger, Points and Triangles in the Plane and Halving Planes in Space 1990 LIBTR Pach & Sharir, Repeated Angles in the Plane and Related Problems 1990 LIBTR Erdos & Makai & Pach & Spencer, Gaps in Difference Sets, and the Graph of Nearly Equal Distances 1990 LIBTR Pach & Steiger & Szemeredi, An Upper Bound on the Number of Planar k-Sets 1990 LIBTR Lee, Regular Triangulations of Convex Polytopes 1990 LIBTR Kenyon, Sensitivity vs. Block Sensitivity of Boolean Functions 1990 LIBTR Kaufmann, Allowing Overlaps Makes Switchbox Layouts Nice 1990 LIBTR Agarwal & Aronov & Sharir & Suri, Selecting Distances in the Plane 1990 LIBTR Matousek & Pach & Sharir & Sifrony & Welzl, Fat Triangles Determine Linearly Many Holes 1990 LIBTR Khachiyan & Kalantari, Diagonal Matrix Scaling and Linear Programming 1990 LIBTR Furedi & Hajnal, Davenport-Schinzel Theory of Matrices 1990 LIBTR Kreveld & Overmars & Agarwal, Intersection Queries in Sets of Disks 1990 LIBTR Pinto & Shamir, Efficient Algorithms for Minimum Cost Flow Problems with Convex Costs 1990 LIBTR Allender & Gore, On Strong Separations from AC! 1990 LIBTR Vershik, On Topological Questions of Real Complexity Theory and Combinatorial Optimization 1990 LIBTR Lee, Winding Numbers and the Generalized Lower-Bound Conjecture 1990 LIBTR Boros & Crama & Hammer, Chvatal Cuts and Odd Cycle Inequalities in Quadratic 0-1 Optimization 1990 LIBTR Agarwal & Edelsbrunner & Schwarzkopf & Welzl, Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs 1990 LIBTR Melissaratos & Souvaine, Shortest Paths Help Solve Geometric Optimization Problems on Planar Regions 1990 LIBTR Agarwal & Sharir, Circle Shooting in a Simple Polygon 1990 LIBTR Goodrich & Atallah & Overmars, Output-sensitive Methods for Rectilinear Hidden Surface Removal 1990 LIBTR Boros & Hammer, Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-boolean Functions 1990 LIBTR Agarwal & Aronov, Counting Facets and Incidences 1990 LIBTR Grotschel & Monma & Stoer, Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints 1990 LIBTR Grotschel & Monma & Stoer, Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints 1990 LIBTR Feigenbaum & Merritt, DIMACS Workshop on Distributed Computing and Cryptography 1990 LIBTR Halldorsson, A Still Better Performance Guarantee for Approximate Graph Coloring 1990 LIBTR Aronov & Edelsbrunner & Guibas & Sharir, The Number of Edges of Many Faces in a Line Segment Arrangement 1990 LIBTR Brightwell & Winkler, Counting Linear Extensions is #P-Complete 1990 LIBTR Barany & Goodman & Pollack, Do Projections Go To Infinity? 1990 LIBTR Wenger, Geometric Permutations and Connected Components 1990 LIBTR Agarwal & Sharir, Planar Geometric Location Problems 1990 LIBTR Kahachiyan, Complexity of Polytope Volume Computation 1990 LIBTR Karzanov & Kahachiyan, On the Conductance of Order Markov Chains 1990 LIBTR Agarwal & Sharir, Circular Visibility in a Simple Polygon from a Point 1990 LIBTR Salowe, Construction of Multidimensional Spanner Graphs, with Applications to Minimum Spanning Trees 1990 LIBTR Agarwal & Sharir, Off-line Dynamic Maintenance of the Width of a Planar Point Set 1990 LIBTR Tetali & Winkler, Meeting Times for Random Walks on Graphs 1990 LIBTR Roberts, Characterizations of the Plurality Function 1990 LIBTR Poljak, Neural Networks via Linear Programming and Convexity 1990 LIBTR Kalantari & Khachiyan, On the Complexity of Nonnegative Matrix Scaling 1990 LIBTR Adler & Hoffman & Shamir, Monge and Feasbility Sequences in General Flow Problems 1990 LIBTR Du & Hwang, A Proof of Gilbert-Pollak's Conjecture on the Steiner Ratio 1990 LIBTR Radhakrishnan, Sigma Pi Sigma Threshold Formulas 1990 LIBTR Driscoll & Sleator & Tarjan, Fully Persistent Lists with Catenation 1990 LIBTR Booth, Fast Algorithms on Graphs and Trees 1990 LIBTR Heiman & Wigderson, Randomized vs. Deterministic Decision Tree Complexity for Read-Once Boolean Functions 1990 LIBTR Allender & Hertrampf, Depth Reduction for Circuits of Unbounded Fan-in 1990 LIBTR Haber & Stornetta, How to Time-Stamp a Digital Document 1990 LIBTR Ravikumar, Some Applications of a Technique of Sakoda and Sipser 1990 LIBTR Atkinson & Sack, Generating Binary Trees at Random 1990 LIBTR Horvitz, Computation and Action under Bounded Resources (thesis) 1990 LIBTR Willard, A Density Control Algorithm for Doing Insertions and Deletions in a Sequentially Ordered File in Good Worst-Case Time 1990 LIBTR Blair & Ravi, On the Near-Optimal Selection of Memory Storage Patterns 1990 LIBTR Fredman & Willard, Trans-Dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths 1990 LIBTR Beame & Brisson & Ladner, The Complexity of Computing Symmetric Functions Using Threshold Circuits 1990 LIBTR Bunton & Borriello, Practical Dictionary Management for Hardware Data Compression (Development of a Theme by Ziv and Lempel) 1990 LIBTR Moore, Simulating Neural Networks on SIMD Mesh and Pyramid Machines 1990 LIBTR Yu & Rosenkrantz, A Linear-Time Scheme for Version Reconstruction 1990 LIBTR Jiang & McDowell & Ravikumar, The Structure and Complexity of Minimal NFA's over a Unary Alphabet 1990 LIBTR Jiang & Ravikumar, NFA Minimization Problems are Hard 1990 LIBTR Lutz, A Note on Independent Random Oracles 1990 LIBTR Rao, Eventual Determinism: Using Probabilistic Means to Achieve Deterministic Ends 1990 LIBTR Donald & Chang, On the Probabilistic Analysis of Normal Form Computation of a Sparse Matrix 1990 LIBTR Vavasis & Zippel, Proving Polynomial-Time for Sphere-Constrained Quadratic Programming 1990 LIBTR Salton & Buckley, A Note on Term Weighting and Text Matching 1990 LIBTR Klarlund & Schneider, Progress Measures for Verification Involving Nondeterminism 1990 LIBTR Ranjan & Chari & Rohatgi, Improving Known Solutions Is Hard 1990 LIBTR Miller & Vavasis, Density Graphs and Separators 1990 LIBTR Kapur & Bilardi, Language Learning without Overgeneralization 1990 LIBTR Lipton, Realizability and Kripke Forcing 1990 LIBTR Guibas & Knuth & Sharir, Randomized Incremental Construction of Delaunay and Voronoi Diagrams 1990 LIBTR Mishra & Pedersen, Arithmetic of Real Algebraic Numbers in NC 1990 LIBTR Chazelle & Edelsbrunner & Guibas & Sharir & Stolfi, Lines in Space: Combinatorics and Algorithms 1990 LIBTR Pach & Sharir, Repeated Angles in the Plane and Related Problems 1990 LIBTR Sharir & Overmars, An Improved Technique for Output-Sensitive Hidden Surface Removal 1990 LIBTR Aronov & Chazelle & Edelsbrunner & Guibas & Sharir & Wenger, Points and Triangles in the Plane and Halving Planes in Space 1990 LIBTR Hong & Tan, Average Time for Boolean Matrix Multiplication 1990 LIBTR Berger & Rigoutsos, An Algorithm for Point Clustering and Grid Generation 1990 LIBTR Matousek & Sharir & Pach & Sifrony & Welzl, Fat Triangles Determine Linearly Many Holes 1990 LIBTR Paterson & Pippenger & Zwick, Optimal Carry Save Networks 1990 LIBTR Poggio & Girosi, Continuous Stochastic Cellular Automata That Have a Stationary Distribution and No Detailed Balance 1990 LIBTR Bradley, Causes and Effects of Chaos 1990 LIBTR Poggio, A Theory of How the Brain Might Work 1990 LIBTR Cooper & Herskovits, Determination of the Entropy of a Belief Network is NP-Hard 1990 LIBTR Crosby & Stelovsky, How Do We Read Algorithms? A Case Study 1990 LIBTR Pach & Pollack & Welzl, Weaving Patterns of Lines and Line Segments in Space 1990 LIBTR Chazelle & Edelsbrunner & Guibas & Pollack & Seidel & Sharir & Snoeyink, Counting and Cutting Cycles of Lines and Rods in Space 1990 LIBTR Agarwal & Sharir, Off-line Dynamic Maintenance of the Width of a Planar Point Set 1990 LIBTR Agarwal & Sharir, Circular Visibility in a Simple Polygan from a Point 1990 LIBTR Dinning, Detecting Nondeterminism Shared Memory Parallel Programs 1990 LIBTR Agarwal, Circle Shooting in a Simple Polygon 1990 LIBTR Agarwal & Sharir, Planar Geometric Location Problems 1990 LIBTR Halperin & Sharir, Improved Combinatorial Bounds and Efficient Techniques for Certain Motion Planning Problems with Three Degrees of Freedom 1990 LIBTR Agarwal & Aronov & Sharir & Suri, Selecting Distances in the Plane 1990 LIBTR Pellegrini, Stabbing and Ray Shooting in 3 Dimensional Space 1990 LIBTR Pedersen, Counting Real Zeroes 1990 LIBTR Heath & Rosenberg, Laying Out Graphs Using Queues 1990 LIBTR Bouabdallah & Konig, A Distributed Algorithm for the Mutual Exclusion Problem 1990 LIBTR Manoussakis & Tuza, Optimal Routings in Communication Networks with Linearly Bounded Capacity 1990 LIBTR Plummer, Degree Sums, Neighborhood Unions and Matching Extension in Graphs 1990 LIBTR Favaron & Mago & Ordaz, On the Bipartite Independence Number of a Balanced Bipartite Graph 1990 LIBTR Myoupo, A Geometric Approach for Transitive Closure Problems on Modular Linear Systolic Arrays 1990 LIBTR Bouabdallah & Konig, Embedding De Bruijn Networks in the Hypercube 1990 LIBTR Jarnvall, Fine Tuning a Locally Adaptive Data Compression Scheme 1990 LIBTR Makinen, A Linear Time and Space Algorithm for Finding Isomorphic Subtrees of a Binary Tree 1990 LIBTR Eppstein, The Farthest Point Delaunay Triangulation Minimizes Angles 1990 LIBTR Molodowitch, Analysis and Design of Algorithms: Double Hashing and Parallel Graph Searching 1990 LIBTR Gurajada & Srivastava, Equidepth Partitioning of a Data Set Based on Finding its Medians 1990 LIBTR Shankar & Ranka, Hypercube Algorithms for Operations on Quadtrees 1990 LIBTR Byers, Computability over Abstract Data Types 1990 LIBTR Miller & Tanimoto, Detecting Repeated Patterns on Mesh Computers 1990 LIBTR Lutz & Book, Bounded Reducibility to Pseudorandom Problems 1990 LIBTR Lutz & Schmidt, Circuit Size Relative to Pseudorandom Oracles 1990 LIBTR Jha, Hypercubes, Median Graphs and Products of Graphs: Some Algorithmic and Combinatorial Results 1990 LIBTR Amarel, Problem Solving 1990 LIBTR Chen & Du, On Critical Path Problem 1990 LIBTR Ben-Natan & Barak, Bounded Contractions of Dense Trivalent Graphs 1990 LIBTR Barak & Ben-Natan, Bounded Contractions of Full Trees 1990 LIBTR Zabrodsky, Symmetry -- A Review 1990 LIBTR Ben-Asher & Peleg & Ramaswami & Schuster, The Power of Reconfiguration 1990 LIBTR Levy, A Counting Problem on General Graphs Arising from Percolation Theory 1990 LIBTR Lerman & Rudolph, Parallel Processors: Will They Ever Meet? 1990 LIBTR Gotsmann & Shamir & Friedman, On the Second Eigenvalue of Noisy Boolean Networks 1990 LIBTR Aumann & Schuster, Deterministic PRAM Simulation with Constant Memory Blow-up and No Time-Stamps 1990 LIBTR Leiss, On Solving Language Equations over a One-letter Alphabet 1990 LIBTR Paris, Efficient Voting Protocols with Witnesses 1990 LIBTR Wang & Cheng, Parallel Time Complexity of a Heuristic Algorithm for the k-Center Problem with Usage Weights 1990 LIBTR Hofri & Shachnai, The Application of Restricted Counter Schemes to Three Models of Linear Search 1990 LIBTR Li & Cheng, Worst Case Performance Analysis of the Two Dimensional Binary Buddy System 1990 LIBTR Katoh & Iwano, Efficient Algorithms for Minimum Range Cut Problems 1990 LIBTR Xue & Lengauer, On the Description and Development of One-dimensional Systolic Arrays 1990 LIBTR Wang & Cheng, A Heuristic Algorithm for the k-Center Problem with Cost and Usage Weights 1990 LIBTR Laderman & Pan & Sha, On Practical Algorithms for Accelerated Matrix Multiplication 1990 LIBTR Pan & Reif, Compact Multigrid 1990 LIBTR Pan, Decreasing the Displacement Rank of a Matrix 1990 LIBTR Pan, Complexity of Algorithms for Linear Systems of Equations 1990 LIBTR Boyar & Chaum & Damgard & Pedersen, Convertible Undeniable Signatures 1990 LIBTR Burns, Performance Analysis and Optimization of Asynchronous Circuits 1990 LIBTR Lukkien, Parallel Program Design and Generalized Weakest Preconditions 1990 LIBTR Selman, A Note on Adaptive vs. Nonadaptive Reductions to NP 1990 LIBTR Selman, One-way Functions in Complexity Theory 1990 LIBTR Regan & Royer, A Simpler Proof of PH <= BP(Parity-P) 1990 LIBTR Li & Cheng, A Generalized Harmonic Algorithm for On-line Multi-dimensional Bin Packing 1990 LIBTR Verma, Strings, Ordered Subtree Isomorphism and Pattern Matching 1990 LIBTR Wang & Cheng, A Heuristic Algorithm for the k-Center Problem with Vertex Weight 1990 LIBTR Burns & Martin, Performance Analysis and Optimization of Asynchronous Circuits 1990 LIBTR Beaver, Security, Fault Tolerance, and Communication Complexity in Distributed Systems 1990 LIBTR Haussler, Decision Theoretic Generalizations of the PAC Model for Neural Net and Other Learning Applications 1990 LIBTR Witten & Bell & Nevill, Indexing and Compressing Full-Text Databases for CD-ROM 1990 LIBTR Edelson, Parallel Sorting over the Internet 1990 LIBTR Makinen, How to Draw a Hypergraph 1990 LIBTR Baumslag & Rosenberg, Processor-Time Tradeoffs for Cayley Graph Interconnection Networks 1990 LIBTR Lyuu, An Information Dispersal Approach to Issues in Parallel Processing 1990 LIBTR Tsantilas, Communication Issues in Parallel Computation 1990 LIBTR Lewis, A Logic of Concrete Time Intervals (extended abstract) 1990 LIBTR Chew, Building Voronoi Diagrams for Convex Polygons in Linear Expected Time 1990 LIBTR Chew, There is a Planar Graph Almost as Good as the Complete Graph 1990 LIBTR Bhatt & Chung & Hong & Leighton & Obrenic & Rosenberg & Schwabe, Optimal Emulations by Butterfly-like Networks 1990 LIBTR Koch & Leighton & Maggs & Roa & Rosenberg & Schwabe, Work-preserving Emulations of Fixed-connection Networks 1990 LIBTR Kao & Shannon, Linear-Processor NC Algorithms for Planar Directed Graphs II: Directed Spanning Trees 1990 LIBTR Aggarwal & Anderson & Kao, Parallel Depth-first Search in General Directed Graphs 1990 LIBTR Holliday & Ellis, Accuracy of Memory Reference Traces of Parallel Computations in Trace-driven Simulation 1990 LIBTR LaRowe & Ellis, Experimental Comparison of Memory Management Policies for NUMA Multiprocessors 1990 LIBTR Lynch, Multivalued Possibilities Mappings 1990 LIBTR Stolfo & Yu, Complexity of Mortgage Pool Allocation 1990 LIBTR Reif & Sen, Optimal Parallel Randomized Algorithms for Computational Geometry II 1990 LIBTR Bini & Pan, Improved Parallel Polynomial Division 1990 LIBTR Pan & Landowne & Sadikou, Approximate Polynomial Division with a Remainder by Means of Evaluation and Interpolation 1990 LIBTR Pan, Complexity of Computations with Matrices and Polynomials 1990 LIBTR Pan, Parametrization of Newton's Iteration for Computations with Structured Matrices and Applications 1990 LIBTR Pan, Parallel Least-Squares Solution of Toeplitz-like Linear Systems 1990 LIBTR Bini & Pan, On the Evaluation of the Eigenvalues of a Banded toeplitz Block Matrix 1990 LIBTR Bini & Pan, Computing Matrix Eigenvalues and Polynomial Zeros Where the Output is Real 1990 LIBTR Ausiello & Italiano & Spaccamela & Nanni, Incremental Algorithms for Minimal Length Paths 1990 LIBTR Pinsky & Fahn & Yemini, Mortgage Pool Allocation by Simulated Annealing 1990 LIBTR Galil & Park, Dynamic Programming with Convexity, Concavity, and Sparsity 1990 LIBTR Dolev & Israeli & Moran, Resource Bounds for Self Stabilizing Message Driven Protocols 1990 LIBTR Bar-Yehuda & Fogel, Partitioning a Sequence into Few Monotone Subsequences 1990 LIBTR Bar-Yehuda & Fogel, Variations on Ray Shooting 1990 LIBTR Jacquet & Muhlethaler, Models for Communications in the Hypercube 1990 LIBTR Vallee & Flajolet, The Lattice Reduction Algorithm of Gauss: An Average Case Analysis 1990 LIBTR Crapo, On the Generic Rigidity of Plane Frameworks 1990 LIBTR Couvert & Pedrono & Raynal, Implementation and Evaluation of Distributed Synchronization on a Distributed Memory Parallel Machine 1990 LIBTR Boissonnat & Devillers & Schott & Teillaud & Yvinec, Applications of Random Sampling to On-line Algorithms in Computational Geometry 1990 LIBTR Minet & Anceaume, Non-blocking Atomic Broadcast with Omission Failures 1990 LIBTR el Khadiri & Marie & Rubino, Estimation of Network Reliability on a Parallel Machine by Means of a Monte Carlo Technique 1990 LIBTR Lavault, Analysis of a Distributed Algorithm for Mutual Exclusion 1990 LIBTR Mans & Roucairol, Concurrency in Priority Queues for Branch and Bound Algorithms 1990 LIBTR Fayolle & Ignatyuk & Malyshev & Menshikov, Random Walks in Two-dimensional Complexes 1990 LIBTR Fayolle & Malyshev & Menshikov, Random Walks in a Quarter Plane with Zero Drifts. I: Ergodicity and Null Recurrence 1990 LIBTR Baeza-Yates & Regnier, Average Running Time of Boyer-Moore-Horspool Algorithm 1990 LIBTR Atallah & Jacquet & Szpankowski, A Probabilistic Approach to Pattern Matching with Mismatches 1990 LIBTR Devillers & Meiser & Teillaud, Fully Dynamic Delaunay Triangulation in Logarithmic Expected Time Per Operation 1990 LIBTR Caucal & Monfort, On the Transition Graphs of Automata and Grammars 1990 LIBTR Colburn, Program Verification, Defeasible Reasoning, and Two Views of Computer Science 1990 LIBTR Shute, Worse-case Length Ratios for Various Heuristics for Rectilinear and Euclidean Steiner Minimal Trees 1990 LIBTR Haussler & Littlestone & Warmuth, Predicting (0,1)-Functions on Randomly Drawn Points 1990 LIBTR Norris, Universal Covers of Edge-labeled Digraphs: Isomorphism to Depth n-1 Implies Isomorphism to All Depths 1990 LIBTR Kolaitis & Thakur, Logical Definability of NP Optimiziation Problems 1990 LIBTR Abe & Warmuth, On the Computational Complexity of Approximating Distributions by Probabilistic Automata 1990 LIBTR Helmbold & McDowell, Computing Reachable States of Parallel Programs 1990 LIBTR Dershowitz & Reingold, Calendrical Calculations 1990 LIBTR Bein & Kamburowski & Stallmann, Optimal Reduction of Directed Acyclic Graphs: A Revised Version 1990 LIBTR Chang & Bein & Angel, Parallel Algorithms for Surface Intersection 1990 LIBTR Wang & Cypher & Mayr, Embedding Complete Binary Trees in Faulty Hypercubes 1990 LIBTR Fiat & Naor, Implicit 0(1) Probe Search 1990 LIBTR Anderson & Simons, A Scheduling Problem Arising from Loop Parallelization on MIMD Machines 1990 LIBTR Siu & Bruck, On the Power of Threshold Circuits with Small Weights 1990 LIBTR Koller & Megiddo, On the Complexity of Two-person Zero-sum Games in Extensive Form 1990 LIBTR Aspnes & Herlihy & Shavit, Counting Networks and Multi-processor Coordination 1990 LIBTR Saks & Shavit & Woll, Optimal Time Randomized Consensus-making Resilient Algorithms Fast in Practice 1990 LIBTR Ajtai, Constant Depth Circuits with Incomplete Inputs 1990 LIBTR Cidon & Kutten & Mansour & Peleg, Greedy Packet Scheduling 1990 LIBTR Philips, New Algorithms to Color Graphs and Find Maximum Cliques 1990 LIBTR Mazurkiewicz & Rabinovich & Trakhtenbrot, Connectedness and Synchronization 1990 LIBTR Awerbuch & Bar-Noy & Gopal, Approximate Distributed Bellman-Ford Algorithms 1990 LIBTR Fraenkel, Deexponentializing Complex Computational Mathematical Problems Using Physical or Biological Systems 1990 LIBTR Awerbuch & Peleg, Locality-sensitive Resource Allocation 1990 LIBTR Harel, Hamiltonian Paths in Infinite Graphs 1990 LIBTR Kleinman & Moscowitz & Pnueli & Shapiro, Communication with Directed Logic Variables 1990 LIBTR Fraenkel, Selected Bibliography on Combinatorial Games and Some Related Material 1990 LIBTR Fraenkel, Complexity of Games 1990 LIBTR Kliger & Shapiro, From Decision Trees to Decision Graphs 1990 LIBTR Bar-Ilan & Peleg, How to Allocate Network Centers 1990 LIBTR Awerbuch & Peleg, Network Synchronization with Polylogarithmic Overhead 1990 LIBTR Awerbuch & Peleg, Efficient Distributed Construction of Sparse Covers 1990 LIBTR Biham & Shamir, Differential Cryptanalysis of DES-like Cryptosystems 1990 LIBTR Shamir, IP = Pspace 1990 LIBTR Han, A Fast Derandomization Scheme and its Applications 1990 LIBTR Han & Igarashi, Derandomization by Exploiting Redundancy and Mutual Independence 1990 LIBTR Breitbart & Hunt & Rosenkrantz, Asymptotic Bounds on the Size of Binary Decision Diagrams Representing Boolean Functions 1990 LIBTR Han, A Parallel Algorithm for the PROFIT/COST Problem 1990 LIBTR Jones, Probabilistic Non-determinism 1990 LIBTR Jerrum & Sinclair, Polynomial-Time Approximation Algorithms for the Ising Model 1990 LIBTR Acciaro & Atkinson, A New Algorithm for Testing the Regularity of a Permutation Group 1990 LIBTR Oommen & Zgierski, Breaking Substitution Cyphers Using Stochastic Automata 1990 LIBTR Epstein & Knight & May & Nguyen & Sack, A Workbench for Computational Geometry (WOCG) 1990 LIBTR Dehne & Hambrusch, Parallel Algorithms for Determining k-Width-Connectivity in Binary Images 1990 LIBTR Aleksandrov & Djidjev, Separation of Graphs of Bounded Genus 1990 LIBTR Sidney & Sidney, Representing Partial Orders by Polygons and Circles in the Plane 1990 LIBTR Diks & Djidjev & Sykora & Vrto, Edge Separators of Planar and Outerplanar Graphs with Applications 1990 LIBTR Valiveti & Oommen, A Presortedness Metric for Ensembles of Data Sequences 1990 LIBTR Valiveti & Oommen, Self-organizing Double-linked Lists 1990 LIBTR Dehne & Ferreira & Rau-Chaplin, Parallel Processing of Quad Trees on the Hypercube (and PRAM) 1990 LIBTR Atkinson, A Survey of Algorithms for Handling Permutation Groups 1990 LIBTR Klawe & Leighton, A Tight Lower Bound on the Size of Planar Permutation Networks 1990 LIBTR Klawe, Superlinear Bounds for Matrix Searching Problems 1990 LIBTR Wagner, Embedding All Binary Trees in the Hypercube 1990 LIBTR Luks, Lectures on Polynomial-Time Computation in Groups 1990 LIBTR Baruah & Howell & Rosier, Algorithms and Complexity Concerning the Preemptive Scheduling of Periodic, Real-time Tasks on one Processor 1990 LIBTR Abrahamson & Fellows & Langston & Moret, Constructive Complexity 1990 LIBTR Langston, Fast Search Algorithms for Layout Permutation Problems 1990 LIBTR Gregor & Thomason, Dynamic Programming Alignment of Sequences Representing Cyclic Patterns 1990 LIBTR Guan & Langston, Time-Space Optimal Parallel Merging and Sorting 1990 LIBTR Langston, Fast Stable Merging and Sorting in Constant Extra Space 1990 LIBTR Jajodia & Mutchler, Dynamic Voting Algorithms for Maintaining the Consistency of a Replicated Database 1990 LIBTR MacLennan, Continuous Spatial Automata 1990 LIBTR Primeaux, Simultaneous Multiple String Alignment to Infer Markov Networks for the Classification of Human Chromosomes 1990 LIBTR Ranade, A Simpler Analysis of the Karp-Zhang Parallel Branch-and-Bound Method 1990 LIBTR Liu & You, Routing Algorithms for Hypercube 1990 LIBTR Liu & You, A Hybrid Network and its Routing Algorithm 1990 LIBTR Osherson & Weinstein, Notes on Hierarchies and Inductive Inference 1990 LIBTR Rajasekaran, On the Convergence Time of Simulated Annealing 1990 LIBTR Osherson & Stob & Weinstein, Logic and Learning 1990 LIBTR Petkovsek, Finding Closed-form Solutions of Difference Equations by Symbolic Methods 1990 LIBTR Henderson, Efficient Algorithms for Listing Unlabeled Graphs 1990 LIBTR Henderson, Automating Polya Theory: The Computational Complexity of the Cycle Index Polynomial 1990 LIBTR Jerrum, The Elusiveness of Large Cliques in a Random Graph 1990 LIBTR Applegate & Cook, A Computational Study of Job-shop Scheduling 1990 LIBTR Furst & Jackson & Smith, Learning AC Functions Sampled under Mutually Independent Distributions 1990 LIBTR Etzioni, A Structural Theory of Explanation-based Learning 1990 LIBTR Blelloch, Prefix Sums and their Applications 1990 LIBTR Smith & Sturtivant, Fixed Points under the Fourier Transform of Boolean Functions 1990 LIBTR Toussaint, An Output-Complexity-Sensitive Polygon Triangulation Algorithm 1990 LIBTR Avis, On the Complexity of Isometric Embedding in the Hypercube 1990 LIBTR Egyed & Wenger, Ordered Stabbing of Pairwise Disjoint Convex Sets in Linear Time 1990 LIBTR Avis & Maehara, Metric Extensions and the L Hierarchy 1990 LIBTR Leblanc, Some Application of the Topological Plane Sweep Algorithm 1990 LIBTR Bhattacharya & Toussaint, Computing Shortest Transversals 1990 LIBTR Toussaint, Computational Geometry and Computer Vision 1990 LIBTR Devroye & Toussaint, Convex Hulls for Random Lines 1990 LIBTR Robert & Toussaint, Computational Geometry and Facility Location 1990 LIBTR Toussaint, A New Look at Euclid's Second Proposition 1990 LIBTR Bhattacharya & Czyzowicz & Egyed & Stojmenovic & Toussaint & Urrutia, Computing Shortest Transversals of Sets 1990 LIBTR Eades & Whitesides, Maximal Biplanar Subgraphs of Bipartite Graphs 1990 LIBTR Bettati & Gillies & Han & Lin & Liu & Liu & Shih, Recent Results in Real-time Scheduling 1990 LIBTR Spencer & Klugerman, The Probabilistic Method: Lecture Notes for 18.409 1990 LIBTR Mansour, On the Complexity of Computing Algebraic Functions 1990 LIBTR Williamson, Analysis of the Held-Karp Heuristic for the Traveling Salesman Problem 1990 LIBTR Wein & Zenios, On the Massively Parallel Solution of the Assignment Problem 1990 LIBTR Wein & Williamson, On-line Scheduling of Parallel Machines 1990 LIBTR Attiya & Dwork & Lynch & Stockmeyer, Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty 1990 LIBTR Rivest, The MD4 Message Digest Algorithm 1990 LIBTR Bellare & Rompel, Randomness-efficient Sampling of Arbitrary Functions 1990 LIBTR Goldman, Learning Binary Relations, Total Orders, and Read-once Formulas 1990 LIBTR Papaefthymiou, On Retiming Synchronous Circuitry and Mixed-Integer Optimization 1990 LIBTR Goldman, Distributed Algorithm Simulation using Input/Output Automata 1990 LIBTR Aslam & Dhagat, On-line Algorithms for 2-coloring Hypergraphs via Chip Games 1990 LIBTR Hansen, Results in Computational Geometry: Geometric Embeddings and Query-Retrieval Problems 1990 LIBTR Gibbons & Ziani, The Balanced Binary Tree Technique on Mesh Connected Computers 1990 LIBTR Paterson & Pippenger & Zwick, Optimal Carry Save Networks 1990 LIBTR Paterson & Zwick, Shallow Multiplication Circuits 1990 LIBTR Driscoll & Sleator & Tarjan, Fully Persistent Lists with Catenation 1990 LIBTR Chazelle & Guibas & Edelsbrunner & Sharir, Lines in Space: Combinatorics and Algorithms 1990 LIBTR Dixon & Rauch & Tarjan, Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time 1990 LIBTR Serpanos, Scalable Shared Memory Interconnections 1990 LIBTR Chazelle & Edelsbrunner & Guibas & Pollack & Seidel & Sharir & Snoeyink, Counting and Cutting Cycles of Lines and Rods in Space 1990 LIBTR Dechter, On the Design of Networks with Hidden Variables 1990 LIBTR Bracha & Rachman, Approximated Counters and Randomized Consensus 1990 LIBTR Bar-On & Sidi, New Algorithms for Polynomial and Trigonometric Interpolation on Parallel Computers 1990 LIBTR Even & Rajsbaum, The Use of a Synchronizer Yields Maximum Computation Rate in Distributed Networks 1990 LIBTR Lempel & Paz, An Algorithm for Finding a Shortest Vector in a Two Dimensional Modular Lattice 1990 LIBTR Bar-Yehuda & Grinwald, An O(N+H1+e)-time Algorithm to Merge H Simple Polygons 1990 LIBTR Goldreich & Shrira, On the Complexity of Computation in the Presence of Link Failures: The Case of a Ring 1990 LIBTR Kushilevitz, Foundations of Cryptography (Notes from the Lecture #3 by Prof. J. Hastad) 1990 LIBTR Fischer & Moran & Rudich & Taubenfeld, The Wakeup Problem (draft) 1990 LIBTR Barrero, Arrays of Unbounded Dimensions and Abstract Data Types: What Everybody Knows and Everybody Else Should Know 1990 LIBTR Kooshesh & Moret, Folding a Triangulated Simple Polygon: Structural and Algorithmic Results 1990 LIBTR Han & Igarashi & Truszczynski, A New Limit for the Power of Chain Theorem 1990 LIBTR Jaromczyk & Wasilkowski, Numerical Stability of a Convex Hull Algorithm for Simple Polygons 1990 LIBTR Guan & Langston, Distributed Algorithms for Multi-Channel Broadcast Networks 1990 LIBTR Guan & Langston, Time-Space Optimal Parallel Set Operations 1990 LIBTR Zhu & Mutchler, An Entropy Heuristic for the Traveling Salesman Problem 1990 LIBTR Snoeyink, Topological Approaches in Computational Geometry 1990 LIBTR Henzinger & Manna & Pneuli, An Interleaving Model for Real Time 1990 LIBTR Galbiati & Talcott, A Simplifier for Untyped Lambda Expressions 1990 LIBTR Haddad, Triangularization: A Two-processor Scheduling Problem 1990 LIBTR Knuth, CWEB User Manual: The CWEB System of Structured Documentation 1990 LIBTR Nazarian, Bibliography, Department of Computer Science Technical Reports, 1963--1990 1990 LIBTR Cheriton & Goosen & Boyle, ParaDiGm: A Highly Scalable Shared-memory Multi-computer Architecture 1990 LIBTR Pugh, A Skip List Cookbook 1990 LIBTR Srinivas, Category Theory Definitions and Examples 1990 LIBTR McBryan, Trends in Parallel Computing 1990 LIBTR Pozo & Winklmann, A Proof of Exponential ``Permutation Complexity'' 1990 LIBTR Gabow & Xu, Efficient Algorithms for Independent Assignment on Graphic Matroids 1990 LIBTR Gabow, Data Structures for Weighted Matching and Nearest Common Ancestors with Linking 1990 LIBTR Goguen, For Pieces on Error, Truth and Reality 1990 LIBTR Ng, An O(n^3 log n^1/2) Algorithm for the Optimal Stable Marriage Problem 1990 LIBTR Lelewer & Hirschberg, An Order-2 Context Model for Data Compression with Reduced Time and Space Requirements 1990 LIBTR Glabbeek & Weijland, Branching Time and Abstraction in Bisimulation Semantics 1990 LIBTR Apostolico & Italiano & Gambosi & Talamo, The Set Union Problem with Unlimited Backtracking 1990 LIBTR Korach & Solel & Tal, On Disjoint Paths Problems in Graphs with Bounded Tree Width 1990 LIBTR Goldreich, A Note on Computational Indistinguishability 1990 LIBTR Even & Pneuli, How to Keep a Dynamic Distributive Directed Graph Acyclic and Yet Grant All Requests of Edge Additions 1990 LIBTR Kiryati & Bruckstein, What's in a Set of Points? 1990 LIBTR Ben-David & Borodin, A New Measure for the Study of Online Algorithms 1990 LIBTR Goldreich & Oren, Definitions and Properties of Zero-Knowledge Proof Systems 1990 LIBTR Korach & Penn, Tight Integral Duality Gap in the Chinese Postman Problem 1990 LIBTR Korach & Ostfeld, On the Existence of Special DFS-Trees 1990 LIBTR Korach & Tal, General Vertex Disjoint Paths in Series-Parallel Graphs 1990 LIBTR Biran & Moran & Zaks, The Round Complexity of l-Solvable Tasks (extended abstract) 1990 LIBTR Goldreich & Micali & Wigderson, Proofs that Yield Nothing but their Validity or All Languages in NP Have Zero-Knowledge Proof Systems (3rd revision) 1990 LIBTR Bruckstein, Self-Similarity Properties of Digitized Straight Lines 1990 LIBTR Korach & Penn, On Seymour's and Lomonsov's Plane Integral Two Commodity Flow Results 1990 LIBTR Matsliach & Shmueli, The Competitiveness of On-line Demand Paging Algorithms for Generalized Two-level Memories 1990 LIBTR Matsliach & Shmueli, Maintaining Bounded Disorder Files in Multi-processor Multi-disk Environments 1990 LIBTR Shaked & Koplowitz & Bruckstein, Star-shapedness of Digitized Planar Shapes 1990 LIBTR Bitan & Zaks, Optimal Linear Broadcast 1990 LIBTR Awerbuch & Goldreich & Herzberg, A Quantitative Approach to Dynamic Networks 1990 LIBTR Goldreich, A Uniform-Complexity Treatment of Encryption and Zero-Knowledge 1990 LIBTR Dechter, From Local to Global Consistency 1990 LIBTR Chor & Goldreich & Hastad, The Random Oracle Hypothesis Is False 1990 LIBTR Korach & Solel, Linear Time Algorithm for Minimum Weight Steiner Tree in Graphs with Bounded Tree-width 1990 LIBTR Goldreich & Petrank, The Best of Both Worlds: Guaranteeing Termination in Fast Randomized Byzantine Agreement Protocols 1990 LIBTR Ben-David & Borodin & Karp & Tardos & Wigderson, On the Power of Randomization in Online Algorithms 1990 LIBTR Goldreich & Hastad, A Simple Construction of Almost k-wise Independent Random Variables 1990 LIBTR Chen & Davis, A Parallel Algorithm for List Ranking Image Curves in O(log N) Time 1990 LIBTR Rosenfeld & Kong, Connectedness of a Set, Its Complement and Their Common Boundary 1990 LIBTR Venkateswaran & Mazumder, An Efficient Reconstruction Algorithm for Restructuring Hexagonal Arrays 1990 LIBTR Livesey, Distributed Optimistic Concurrency Control in a Persistent Object Store 1990 LIBTR Rosenberg & Henskens & Brown & Morrison & Munro , Stability in a Persistent Store based on a Large Virtual Memory 1990 LIBTR Morrison & Brown & Connor & Cutts & Dearle & Kirby & Rosenberg & Stemple, Protection in Persistent Object Systems 1990 LIBTR Weir, A Method for Self-determination of Adaptive Learning Rates, in Back-propagation 1990 LIBTR Weir & Chen, Training and Generalization Using Continuous Back-propagation 1990 LIBTR Livesey, Clamping in Boltzmann Machines 1990 LIBTR Burns & Gouda & Miller, Pseudo-stabilization 1990 LIBTR Menon, Dynamic Aspects of Signaling in Distributed Neural Systems 1990 LIBTR Carraghan & Pardalos, A Parallel Algorithm for the Maximum Weight Clique Problem 1990 LIBTR Murthy & Pardalos, A Local Search Algorithm for the Quadratic Assignment Problem 1990 LIBTR Pardalos & Jha, Complexity of Uniqueness and Local Search in Quadratic 0-1 Programming 1990 LIBTR Han, Computing Local Sequence Similarities on a Supercomputer 1990 LIBTR Wolter, Representing Subassembly Trees by Deepest Common Ancestor Relations 1990 LIBTR Barrington, Some Problems Involving Razborov-Smolensky Polynomials 1990 LIBTR Barrington, The Current State of Circuit Lower Bounds 1990 LIBTR Khachiyan, Complexity of Polytope Volume Computation 1990 LIBTR Amarel, Problem Solving 1990 LIBTR Anderson & Kahan & Schlag, Single-layer Cylindrical Compaction 1990 LIBTR Kim, Parallel Algorithms for Geometric Intersection Graphs 1990 LIBTR Tompa, Lower Bounds on Universal Traversal Sequences for Cycles and Higher Degree Graphs 1990 LIBTR Anderson & Beame & Ruzzo, Low Overhead Parallel Schedules for Task Graphs 1990 LIBTR Vaidyanathan & Hartmann & Varshney, Optimal Parallel Solutions to the Neighbor Localization Problem and Integer Sorting: A Fine Grained Approach 1990 LIBTR Greenfield, A Proof for a QuickHull Algorithm 1990 LIBTR Mattson, Simplifications to ``A New Approach to the Covering Radius ...'' 1990 LIBTR Regan & Royer, A Simpler Proof of PH subseteq BP[oplus P] 1990 LIBTR Mehrotra & Mohan & Ranka, Bounds on the Number of Samples Needed in Neural Learning 1990 LIBTR Berkling, Arrays and the Lambda Calculus 1990 LIBTR Ranka & Wang, Load Redistribution on the Hypercube in the Presence of Faults 1990 LIBTR Choudhary & Ranka, Mesh and Pyramid Algorithms for Iconic Indexing 1990 LIBTR Herrtwich, An Introduction to Real-time Scheduling 1990 LIBTR Karpinski & Meyer auf der Heide, On the Complexity of Genuinely Polynomial Computation 1990 LIBTR Guesgen & Ladkin, An Algebraic Approach to General Boolean Constraint Problems 1990 LIBTR Cleve, Complexity Theoretic Issues Concerning Block Ciphers Related to D.E.S. 1990 LIBTR Ehrenfeucht & Karpinski, The Computational Complexity of (XOR, AND) Counting Problems 1990 LIBTR Blum & Smale, The Godel Incompleteness Theorem and Decidability over a Ring 1990 LIBTR Irani, Two Results on the List Update Problem 1990 LIBTR Traub & Wozniakowski, Information-based Complexity: New Questions for Mathematicians 1990 LIBTR Traub & Wozniakowski, The Monte Carlo Algorithm with a Pseudo-random Generator 1990 LIBTR Rubinfeld, Designing Checkers for Programs that Run in Parallel 1990 LIBTR Blum & Luby & Rubinfeld, Self-Testing/Correcting with Applications to Numerical Problems 1990 LIBTR Hemachandra & Rubinstein, Separating Complexity Classes with Tally Oracles 1990 LIBTR Lickteig, On Semialgebraic Decision Complexity 1990 LIBTR Rubinfeld, A Mathematical Theory of Self-checking, Self-testing and Self-correcting Programs 1990 LIBTR Maass & Turan, How Fast Can a Threshold Gate Learn? 1990 LIBTR Blum, A Theory of Computation and Complexity over the Real Numbers 1990 LIBTR Ladkin, Constraint Reasoning with Intervals: A Tutorial, Survey and Bibliography 1990 LIBTR Karmarkar & Karp & Lipton & Lovasz & Luby, A Monte-Carlo Algorithm for Estimating the Permanent 1990 LIBTR Zimmermann, Automatic Worst Case Complexity Analysis of Parallel Program 1990 LIBTR Zuckerman, New Pseudo-random Generators for Weak Random Sources 1990 LIBTR Manocha & Canny, Rational Curves with Polynomial Parametrization 1990 LIBTR McAllester, Automatic Recognition of Tractability in Inference Relations 1990 LIBTR DeHon & Knight & Minsky, Fault-tolerant Design for Multistage Routing Networks 1990 LIBTR Gogan, Slice Functions and the Method of Approximations 1990 LIBTR Lutz, A Pseudorandom Oracle Characterization of BPP 1990 LIBTR Gupta & Nishimura, An Outline of the Graph Minors Project 1: Wagner's Conjecture 1990 LIBTR Atkin & Moran, Elliptic Curves and Primality Proving 1990 LIBTR Coffman & Liu, On the Optimal Stochastic Scheduling of Out-Forests 1990 LIBTR Fell, Linear Complexity of Transformed Sequences 1990 LIBTR Flajolet & Sipala & Steyaert, Analytic Variations on the Least Common Subexpression Problem 1990 LIBTR Lavallee & Lavault, Efficient Routing Protocols in Nameless Networks 1990 LIBTR Touzene & Plateau, Optimal Multinode Broadcast on a Mesh Connected Graph with Reduced Bufferization 1990 LIBTR Plateau & Atif, A Method for Handling Complex Markov Models of Parallel Systems 1990 LIBTR Sloman, Beyond Turing Equivalence 1990 LIBTR Fischer & Paterson & Rackoff, Secret Bit Transmission Using a Random Deal of Cards 1990 LIBTR Hochman, How to Create a Failure Tolerant Distributed System 1990 LIBTR Beigel & Reingold & Spielman, PP is Closed under Intersection 1990 LIBTR Reingold & Westbrook, Randomized Algorithms for the List Update Problem 1990 LIBTR Reingold & Westbrook, Optimum Off-line Algorithms for the List Update Problem 1990 LIBTR Beigel & Reingold & Spielman, The Perceptron Strikes Back 1990 LIBTR Beigel & Feigenbaum, Improved Bounds on Coherence and Checkability 1990 LIBTR Beigel, On ACC 1990 LIBTR Spencer, A Survey of Categorical Computation: Fixed Points, Partiality, Combinators, ... Control? 1990 LIBTR Shannon, Linear-Processor DNC Algorithms for Sublinear Separators in Planar Graphs 1990 LIBTR Jog & Suh & Van Gucht, Parallel Genetic Algorithms Applied to the Traveling Salesman Problem 1990 LIBTR Shannon & Wan, Approximating Small Separators in Planar Graphs: Trade-offs in Time, Processors, and Separator Size 1990 LIBTR Wan, A Linear-Processor Algorithm for Finding Small Cycle Separators on Undirected Planar Graphs 1990 LIBTR Duchene & Turau, Complex Object Hashing 1990 LIBTR Nardi & Miller, The Spreadsheet Interface: A Basis for End User Programming 1990 LIBTR Sturtivant, Are There Elimination Algorithms for the Permanent? 1990 LIBTR Christensen, A Logical Characterization of Asynchronously Communicating Agents 1990 LIBTR Zhang, Extended Smolensky's Method 1990 LIBTR Boyar & Damgard, A Discrete Logarithm Blob for Noninteractive XOR Gates 1990 LIBTR Niepel & Rossmath, Uniform Circuits and Exlusive Read PRAMs 1990 LIBTR Niedermeier & Rossmath, Unambiguous Simulations of Auxiliary Pushdown Automata and Circuits 1990 LIBTR Leggett & Kacmar & Schnase, Working Bibliography of Hypertext 1990 LIBTR Heron & Kruckenberg & Soe & Wei, A Modified Manchester Carry-Skip Adder 1990 LIBTR Snyder, A Note on the Complexity of Simplification Orderings 1990 LIBTR Homer & Selman, Complexity Theory: Encyclopedia Article 1990 LIBTR Buhrman & Homer & Torenvliet, Honest Reductions, Completeness and Nondeterministic Complexity Classes 1990 LIBTR Klop, Term Rewriting Systems 1990 LIBTR Bol, Loop Checking and Negation 1990 LIBTR Judd, Characterizing NP and Measuring Instance Complexity 1990 LIBTR Hofstee & Martin & van de Snepscheut, Distributed Sorting 1990 LIBTR Dolev & Dwork & Waarts & Yung, Perfectly Secure Message Transmission 1990 LIBTR Vogl, The Complexity of Union and Concatenation over the Regular Languages 1990 LIBTR Maass & Schnitger & Szemeredi & Turan, Two Tapes versus One for Off-line Turing Machines 1990 LIBTR Obradovic & Berman, Weighted Voting for Operation Dependent Management of Replicated Data 1990 LIBTR Furer & Raghavachari, An Efficient NC Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs 1990 LIBTR Berman & Garay, Better Masking for Better Consensus 1990 LIBTR Pangrle, On the Complexity of Connectivity Binding 1990 LIBTR Myers & Huang, An O(N^2 log N) Restriction Map Comparison and Search Algorithm 1990 LIBTR Parberry, On the Computational Complexity of Optimal Sorting Network Verification 1990 LIBTR Berman & Garay, Improved Protocols for Distributed Consensus 1990 LIBTR Guisewite & Pardalos, Minimum Concave-Cost Network Flow Problems: Applications, Complexity, and Algorithms 1990 LIBTR Sandberg, Design of the PRAM Network 1990 LIBTR Dobkin & Kirkpatrick, Determining the Separation of Preprocessed Polyhedra - A Unified Approach 1990 LIBTR Young, Competitive Paging as Cache Size Varies 1990 LIBTR Ting, Some Complexity Questions Related to the Query Pi(X_ik - X_jk):0? 1990 LIBTR Althofer & Das & Dobkin & Joseph, Generating Sparse Spanners for Weighted Graphs 1990 LIBTR Kenyon & Yao, On Evaluating Boolean Functions with Unreliable Tests 1990 LIBTR Feldman & Lakoff & Stolcke & Hollbach Weber, Miniature Language Acquisition: A Touchstone for Cognitive Science 1990 LIBTR Abe, Learning Commutative Deterministic Finite State Automata in Polynomial Time 1990 LIBTR Chan & Schlag, A Note on Designing Two-level Carry-Skip Adders 1990 LIBTR Long & Warmuth, Composite Geometric Concepts and Polynomial Predictability 1990 LIBTR Jas, A Best-First Error Correction Algorithm 1990 LIBTR Levinson & Beach & Dayan & Snyder & Sohn, Adaptive-Predictive Game-Playing Programs 1990 LIBTR Haussler, Probably Approximately Correct Learning 1990 LIBTR Kolaitis & Vardi, 0-1 Laws for Infinitary Logics 1990 LIBTR Fong, Parallelizing the Fast Fourier Transform 1990 LIBTR Abrahamson & Adler & Higham & Kirkpatrick, Optimal Algorithms for Probabilistic Solitude Detection on Anonymous Rings 1990 LIBTR Abrahamson & Adler & Higham & Kirkpatrick, Tight Lower Bounds for Probabilistic Solitude Verification on Anonymous Rings 1990 LIBTR Pippenger, Selection Networks 1990 LIBTR Pippenger & Stamoulis & Tsitsiklis, On a Lower Bound for the Redundancy of Reliable Networks with Noisy Gates 1990 LIBTR Kirkpatrick & Klawe & Tarjan, Polygon Triangulation in O(N log log N) Time with Simple Data Structures 1990 LIBTR Kenyon & Lovasz, Algorithmic Discrete Mathematics 1990 LIBTR Eppstein & Italiano & Tamassia & Tarjan & Westbrook & Yung, Maintenance of a Minimum Spanning Forest in a Dynamic Planar Graph 1990 LIBTR Dikaiakos & Steiglitz, Comparison of Tree and Straight-line Clocking for Long Systolic Arrays 1990 LIBTR Cai & Paige & Tarjan, More Efficient Bottom-Up Tree Pattern Matching 1990 LIBTR Golin, Probabilistic Analysis of Geometric Algorithms 1990 LIBTR Sleator & Tarjan & Thurston, Short Encodings of Evolving Structures 1990 LIBTR Cypher, A Lower Bound on the Size of Shellsort Sorting Networks 1990 LIBTR Jezequel, Building a Global Time on Parallel Machines 1990 LIBTR De Raedt & Martens & Bruynooghe, A Practical Multi Valued Logic to Reason about (In)completeness and (In)consisitency 1990 LIBTR Fayolle & Iasnogorodski & Malyshev, Algebraic Generating Functions for Two-dimensional Random Walks 1990 LIBTR Devillers, Simultaneous Containment of Several Polygons: Analysis of the Contact Configurations 1990 LIBTR Boudol, A lambda-Calculus for Parallel Functions 1990 LIBTR Flajolet & Salvy & Zimmermann, Automatic Average-Case Analysis of Algorithms 1990 LIBTR Boissonnat & Devillers & Teillaud, A Dynamic Construction of Higher Order Voronoi Diagrams and its Randomized Analysis 1990 LIBTR Chew & Wallace, De-Bruijn Interconnection Networks 1990 LIBTR Snyder, A Note on the Complexity of Simplification Orderings 1990 LIBTR Homer & Selman, Complexity Theory: Encyclopedia Article 1990 LIBTR Buhrman & Homer & Torenvliet, Honest Reductions, Completeness and Nondeterministic Complexity Classes 1990 LIBTR Bol, Loop Checking and Negation 1990 LIBTR Groote & Ponse, Process Algebra with Guards Combining Hoare Logic with Process Algebra 1990 LIBTR de Bakker & Warmerdam, Four Domains for Concurrency 1990 LIBTR Judd, Characterizing NP and Measuring Instance Complexity 1990 LIBTR Hofstee & Martin & van de Snepscheut, Distributed Sorting 1990 LIBTR Vogl, The Complexity of Union and Concatenation over the Regular Languages 1990 LIBTR Obradovic & Berman, Weighted Voting for Operation Dependent Management of Replicated Data 1990 LIBTR Furer & Raghavachari, An Efficient NC Algorithm for Finding hamiltonian Cycles in Dense Directed Graphs 1990 LIBTR Berman & Garay, Better Masking for Better Consensus 1990 LIBTR Pangrle, On the Complexity of Connectivity Binding 1990 LIBTR Myers & Huang, An O(N^2 log N) Restriction Map Comparison and Search Algorithm 1990 LIBTR Parberry, On the Computational Complexity of Optimal Sorting Network Verification 1990 LIBTR Berman & Garay, Improved Protocols for Distributed Consensus 1990 LIBTR Huang, Computing Local Sequence Similarities on a Hypercube 1990 LIBTR Guisewite & Pardalos, Minimum Concave-Cost Network Flow Problems: Applications, Complexity, and Algorithms 1990 LIBTR Sandberg, Design of the PRAM Network 1990 LIBTR Dobkin & Kirkpatrick, Determining the Separation of Preprocessed Polyhedra - A Unified Approach 1990 LIBTR Young, Competitive Paging as Cache Size Varies 1990 LIBTR Ting, Some Complexity Questions Related to the Query P_i(X_ik - X_jk):0? 1990 LIBTR Althofer & Das & Dobkin & Joseph, Generating Sparse Spanners for Weighted Graphs 1990 LIBTR Kenyon & Yao, On Evaluating Boolean Functions with Unreliable Tests 1990 LIBTR Feldman & Lakoff & Stolcke & Hollbach Weber, Miniature Language Acquisition: A Touchstone for Cognitive Science 1990 LIBTR Abe, Learning Commutative Deterministic Finite State Automata in Polynomial Time 1990 LIBTR Chan & Schlag, A Note on Designing Two-level Carry-Skip Adders 1990 LIBTR Long & Warmuth, Composite Geometric Concepts and Polynomial Predictability 1990 LIBTR Jas, A Best-First Error Correction Algorithm 1990 LIBTR Levinson & Beach & Dayan & Snyder & Sohn, Adaptive-Predictive Game-Playing Programs 1990 LIBTR Ferguson, Parallel Algorithms for Computer Graphics 1990 LIBTR Haussler, Probably Approximately Correct Learning 1990 LIBTR Kolaitis & Vardi, 0-1 Laws for Infinitary Logics 1990 LIBTR Fong, Parallelizing the Fast Fourier Transform 1990 LIBTR Abrahamson & Adler & Higham & Kirkpatrick, Optimal Algorithms for Probabilistic Solitude Detection on Anonymous Rings 1990 LIBTR Abrahamson & Adler & Higham & Kirkpatrick, Tight Lower Bounds for Probabilistic Solitude Verification on Anonymous Rings 1990 LIBTR Pippenger, Selection Networks 1990 LIBTR Pippenger & Stamoulis & Tsitsiklis, On a Lower Bound for the Redundancy of Reliable Networks with Noisy Gates 1990 LIBTR Kirkpatrick & Klawe & Tarjan, Polygon Triangulation in O(N log log N) Time with Simple Data Structures 1990 LIBTR Chazelle, Efficient Polygon Triangulation 1990 LIBTR Kenyon & Lovasz, Algorithmic Discrete Mathematics 1990 LIBTR Eppstein & Italiano & Tamassia & Tarjan & Westbrook & Yung, Maintenance of a Minimum Spanning Forest in a Dynamic Planar Graph 1990 LIBTR Dikaiakos & Steiglitz, Comparison of Tree and Straight-line Clocking for Long Systolic Arrays 1990 LIBTR Cai & Paige & Tarjan, More Efficient Bottom-up Tree Pattern Matching 1990 LIBTR Golin, Probabilistic Analysis of Geometric Algorithms 1990 LIBTR Sleator & Tarjan & Thurston, Short Encodings of Evolving Structures 1990 LIBTR Chazelle, Triangulating a Simple Polygon in Linear Time 1990 LIBTR Levinson, Pattern Associativity and the Retrieval of Semantic Networks 1990 LIBTR Cypher, A Lower Bound on the Size of Shellsort Sorting Networks 1990 LIBTR Jezequel, Building a Global Time on Parallel Machines 1990 LIBTR De Raedt & Martens & Bruynooghe, A Practical Multi Valued Logic to Reason about (In)completeness and (In)consisitency 1990 LIBTR Fayolle & Iasnogorodski & Malyshev, Algebraic Generating Functions for Two-dimensional Random Walks 1990 LIBTR Jezequel, Building a Global Time on Parallel Machines 1990 LIBTR Devillers, Simultaneous Containment of Several Polygons: Analysis of the Contact Configurations 1990 LIBTR Boudol, A Lambda-Calculus for Parallel Functions 1990 LIBTR Flajolet & Salvy & Zimmermann, Automatic Average-case Analysis of Algorithms 1990 LIBTR Boissonnat & Devillers & Teillaud, A Dynamic Construction of Higher Order Voronoi Diagrams and its Randomized Analysis 1990 LIBTR Albert & Casas & Fages & Zimmermann, Average Case Analysis of Unification Algorithms 1990 LIBTR Chew & Wallace, De-Bruijn Interconnection Networks 1990 LIBTR Simmons & Yu, Training a Neural Network to be a Context Sensitive Grammar 1990 LIBTR Apt & Olderog, Introduction to Program Verification 1990 LIBTR Veltkamp, The v-Neighborhood Graph 1990 LIBTR Cherkasova, A Fully Abstract Model for Concurrent Nondeterministic Processes Based on Posets with Non-actions 1990 LIBTR Coster, Some Algorithms on Addition Chains and their Complexity 1990 LIBTR Baeten & Bergstra, Process Algebra with a Zero Object 1990 LIBTR van Glabbeek, The Linear Time - Branching Time Spectrum 1990 LIBTR Kossen, Resolution and Logical Consequences 1990 LIBTR Bos & Chaum, SmartCash: A Practical Electronic Payment System 1990 LIBTR Rudnick, A Bibliography of the Intersection of Genetic Search and Artificial Neural Networks 1990 LIBTR Klarlund, Progress Measures and Finite Arguments for Infinite Computations 1990 LIBTR Chang & Rohatgi, Random Reductions in the Boolean Hierarchy are not Robust 1990 LIBTR Salton & Buckley, Flexible Text Matching for Information Retrieval 1990 LIBTR Hendrickson, The Molecule Problem: Determining Conformation from Pairwise Distances 1990 LIBTR Khuller, Efficient Parallel Algorithms for Disjoint Paths and Connectivity 1990 LIBTR Salton & Zhao & Buckley, A Simple Syntactic Approach for the Generation of Indexing Phrases 1990 LIBTR Khuller & Schieber, Efficient Parallel Algorithms for Testing k-Connectivity and Finding Disjoint s-t Paths in Graphs 1990 LIBTR Salton & Buckley, An Evaluation of Text Matching Systems for Text Excerpts of Varying Scope 1990 LIBTR Chew & Kedem, High-Clearance Motion Planning for a Convex Polygon among Polygonal Obstacles 1990 LIBTR Vavasis, Black-Box Complexity of Local Minimization 1990 LIBTR Khuller & Mitchell & Vazirani, On-line Algorithms for Weighted Matching and Stable Marriages 1990 LIBTR Shanbhogue, The Relationship between Multiway and Two-way Fair Merges 1990 LIBTR Pingali & Beck & Johnson & Moudgill & Stodghill, Dependence Flow Graphs: An Algebraic Approach to Program Dependencies 1990 LIBTR Murthy, Extracting Constructive Content from Classical Proofs 1990 LIBTR Bloom & Istrail & Meyer, Bisimulation Can't Be Traced 1990 LIBTR Siu & Bruck, Neural Computation of Arithmetic Functions 1990 LIBTR Sheinvald & Pasco, Trade-offs in Complexity vs. Compression for PRES DP Rules 1990 LIBTR Gaifman & Mairson & Sagiv & Vardi, Undecidable Optimization Problems for Database Logic Programs 1990 LIBTR Rissanen, Stochastic Complexity and Statistics 1990 LIBTR Attiya & Bar-Noy & Dolev, Sharing Memory Robustly in Message-Passing Systems 1990 LIBTR Assaf & Upfal, Fault Tolerant Sorting Network 1990 LIBTR Kolaitis & Vardi, 0-1 Laws for Infinitary Logic 1990 LIBTR Cypher & Plaxton, Techniques for Shared Key Sorting 1990 LIBTR Johnsson & Ho, The Complexity of Reshaping Arrays on Boolean Cubes 1990 LIBTR Ho & Johnsson, Embedding Meshes into Small Boolean Cubes 1990 LIBTR Kojima & Megiddo & Noma & Yoshise, A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems 1990 LIBTR Cohen & Megiddo, On the Complexity of Some Flow Problems 1990 LIBTR Naor & Naor, Small-Bias Probability Spaces: Efficient Constructions and Applications 1990 LIBTR Ho, Optimal Broadcasting on SIMD Hypercubes 1990 LIBTR Ho, On the Processor Labelings of Cube Type Networks 1990 LIBTR Cohen & Megiddo, Strongly Polynomial Time and NC Algorithms for Detecting Cycles in Periodic Graphs 1990 LIBTR Hafner & Sarnak, Relatively Prime Values of Polynomials 1990 LIBTR Ho, Hypercube - A Reconfigurable Mesh 1990 LIBTR Ajtai, Boolean Complexity and Probabilistic Construction 1990 LIBTR Kolaitis & Vardi, 0-1 Laws for Fragments of Second-order Logic 1990 LIBTR Alon & Naor, Coin-Flipping Games Immune against Linear-sized Coalitions 1990 LIBTR Harel & Vardi, On the Power of Bounded Concurrency III: Reasoning about Programs 1990 LIBTR Halpern, Let Many Flowers Bloom: A Response to `An Inquiry into Computer Understanding' 1990 LIBTR Li & Stout, Reconfigurable Massively Parallel Computers: An Introduction 1990 LIBTR Alon & Bruck & Naor & Naor & Roth, Construction of Asymptotically Good Low-Rate Error-Correcting Codes through Pseudo-random Graphs 1990 LIBTR Fulgham & Cypher & Sanz, A Comparison of SIMD Hypercube Routing Strategies 1990 LIBTR Wang & Chen & Li, Fast Algorithms for Some Arithmetic and Logic Operations 1990 LIBTR Megiddo, A General NP-Completeness Theorem 1990 LIBTR Haas, The Maximum and Mean of a Random Length Sequence 1990 LIBTR Cohen & Megiddo, Maximizing Concave Functions in Fixed Dimension 1990 LIBTR Gopal & Strong & Toueg & Cristian, Early-Delivery Atomic Broadcast 1990 LIBTR Fagin, Finite-Model Theory - A Personal Perspective 1990 LIBTR Broder & Karlin & Raghavan & Upfal, Trading Space for Time in Undirected s-t Connectivity 1990 LIBTR Alon, Non-constructive Proofs in Combinatorics 1990 LIBTR Alon & Kleitman & Lipton & Meshulam & Rabin & Spencer, Set Systems with no Union of Cardinality O Modulo m 1990 LIBTR Rossignac & Requicha, Constructive Non-regulatized Goemetry 1990 LIBTR Cooley, The Structure of FFT and Convolution Algorithms 1990 LIBTR Trio, Computer Hacking - An Overview of an Underculture 1990 LIBTR Neff & Boguraev, From Machine-readable Dictionaries to Lexical Data Bases 1990 LIBTR Thomas & Kundu, Synthesis of Fully Testable Sequential Machines 1990 LIBTR Sivarajan & Ramaswami, Multihop Lightwave Networks based on de Bruijn Graphs 1990 LIBTR Alpern & Carter & Feig, Uniform Memory Hierarchies 1990 LIBTR Larmore & Schieber, On-line Dynamic Programming with Applications to the Prediction of RNA Secondary Structure 1990 LIBTR Shub, On the Work of Steve Smale on the Theory of Computation 1990 LIBTR Corella, ZF/HOL, a Formal Theory for the Mechanization of Mathematics 1990 LIBTR Italiano & Sarnak, Fully Persistent Data Structures for Disjoint Set Union Problems 1990 LIBTR Shub, Some Remarks on Bezout's Theorem and Complexity Theory 1990 LIBTR Grayson, The Basin of Attraction for Interior Point Linear Programming Algorithms 1990 LIBTR Parikh, Finite and Infinite Dialogues 1990 LIBTR Abali & Ozguner & Bataineh, Balanced Parallel Sort on Hypercube Multiprocessors 1990 LIBTR Irani, Two Results on the List Update Problem 1990 LIBTR Coppersmith & Doyle & Raghavan & Snir, Random Walks on Weighted Graphs and Applications to On-line Algorithms 1990 LIBTR Singco & Nordeen, Back-of-the-Envelope Approach to Chaos 1990 LIBTR Feige & Peleg & Raghavan & Upfal, Randomized Broadcast in Networks 1990 LIBTR Milenkovic & Nackman, Finding Compact Coordinate Representations for Polygons and Polyhedra 1990 LIBTR Strong & Dolev & Cristian, A Unified Theory of Distributed Coordination 1990 LIBTR Kojima & Megiddo & Mizuno, A General Framework of Continuation Methods for Complementarity Problems 1990 LIBTR Aggarwal & Park, Improved Algorithms for Economic Lot-Size Problems 1990 LIBTR Rabenhorst, A Color Gallery of Complex Functions 1990 LIBTR Bernstein & Kruskal & Sarnak, Creation and Maintenance of Multiple Versions 1990 LIBTR Raghavan & Snir, Memory versus Randomization in On-line Algorithms 1990 LIBTR Abali & Ozguner & Bataineh, Load Balanced Sort on Hypercube Multiprocessors 1990 LIBTR Stone, A Simple and Correct Shared-Queue Algorithm Using Compare-and-Swap 1990 LIBTR Chou & Gao, Mechanical Theorem Proving in Differential Geometry: II. Bertrand Curves 1990 LIBTR Silberschatz & Stonebraker & Ullman, Database Systems: Achievements and Opportunities 1990 LIBTR Ramachandran & Reif, Planarity Testing in Parallel 1990 LIBTR Rao, Reasoning about Probabilistic Algorithms 1990 LIBTR Chou & Gao, Mechanical Theorem Proving in Riemann Geometry 1990 LIBTR Saouter & Quinton, Computability of Recurrence Equations 1990 LIBTR Darondeau & Nolte & Priese & Yoccoz, Fairness, Distances and Degrees 1990 LIBTR Raynal, Order Notions and Atomic Multicast in Distributed Systems: A Short Survey 1990 LIBTR Broder & Karlin & Raghavan & Upfal, On the Parallel Complexity of Evaluating Game-Trees 1990 LIBTR Bain & Muggleton, Non-monotonic Learning 1990 LIBTR Bettinger & Srikantan, UBGCCS-90: Proceedings of the Fifth Annual University at Buffalo Graduate-Conference on Computer Science 1990 LIBTR Curtis & Rauen, A Module System for Scheme 1990 LIBTR Rajasekaran & Overholt, Constant Queue Routing on a Mesh 1990 LIBTR Rajasekaran, Randomized Parallel Selection 1990 LIBTR Ibarra & Wang & Jiang, Efficient Parallel Algorithms for Solving Set Recurrence Equations and Applications 1990 LIBTR Jiang & Ravikumar, NFA Minimization Problems are Hard 1990 LIBTR Jiang & McDowell & Ravikumar, The Structure and Complexity of Minimal NFA's over a Unary Alphabet 1990 LIBTR Janicki & Koutny, Using Optimal Simulations to Reduce Reachability Graphs 1990 LIBTR Myers & Huang, An O(N^2 log N) Restriction Map Comparison and Search Algorithm 1990 LIBTR Bailey, How Circuit Size Affects Parallelism 1990 LIBTR Henry & Hudson, Viewing Large Graphs 1990 LIBTR Wu & Manber, An Algorithm for Min-Cost Edge-Disjoint Cycles and its Applications 1990 LIBTR Bellantoni & Pitassi & Urquhart, Approximation and Small-Depth Frege Proofs 1990 LIBTR Booth & Westbrook, Linear Algorithms for Analysis of Minimum Spanning and Shortest Path Trees in Planar Graphs 1990 LIBTR Fischer & Moran & Rudich & Taubenfeld, The Wakeup Problem 1990 LIBTR Bylander & Allemang & Tanner & Josephson, The Computational Complexity of Abduction 1990 LIBTR Cohen, On the Random Walk with Zero Drifts in the First Quadrant of R2 1990 LIBTR Rodgers & Baddeley, Nested Monte Carlo Study of Random Packing on the Sphere 1990 LIBTR Hoogeveen, Minimizing Maximum Earliness and Maximum Lateness on a Single Machine 1990 LIBTR De Nicola & Montanari & Vaandrager, Back and Forth Bisimulations 1990 LIBTR Desel & Esparza, Reachability in Reversible Free-Choice Systems 1990 LIBTR Rossmanith, The Owner Concept for PRAMs 1990 LIBTR Berkman & Vishkin, On Parallel Integer Merging 1990 LIBTR Subramanian, The Computational Complexity of the Circuit Value and Network Stability Problems 1990 LIBTR Adel'son-Vel'ski & Dinic & Karzanov, Book Review: Flow Algorithms 1990 LIBTR Heckerman, Probabilistic Similarity Networks 1990 LIBTR Manna & Pnueli, Tools and Rules for the Practicing Verifier 1990 LIBTR Lavignon & Shoham, Temporal Automata 1990 LIBTR Lamport, A Temporal Logic of Actions 1990 LIBTR Keil, A Simple Algorithm for Determining the Envelope of a Set of Lines 1990 LIBTR Greenlaw, The Parallel Complexity of Approximation Algorithms for the Acyclic Subgraph Problem 1990 LIBTR Greenlaw, Breadth-Depth Search is P-Complete 1990 LIBTR Chazelle & Edelsbrunner & Guibas & Sharir, Algorithms for Bichromatic Line Segment Problems and Polyhedral Terrains 1990 LIBTR Edelsbrunner & Tan & Waupotitsch, An O(n^2 log n) Time Algorithm for the Minmax Angle Triangulation 1990 LIBTR Chazelle & Edelsbrunner & Guibas & Hershberger & Seidel & Sharir, Slimming Down by Adding; Selecting Heavily Covered Points 1990 LIBTR Edelsbrunner & Sharir, A Hyperplane Incidence Problem with Applications to Counting Distances 1990 LIBTR Edelsbrunner & Chazelle & Guibas & Sharir, Points and Triangles in the Plane and Halving Planes in Space 1990 LIBTR Chazelle & Edelsbrunner & Guibas & Sharir & Stolfi, Lines in Space: Combinatorics and Algorithms 1990 LIBTR Goering, A Graph Grammar Approach to Concurrent Programming 1990 LIBTR Helmbold & Sloan & Warmuth, Learning Integer Lattices 1990 LIBTR Hemachandra & Hoene, Collapsing Degrees via Strong Computation 1990 LIBTR Krizanc, A Note on Off-line Permutation Routing on a Mesh-connected Processor Array 1990 LIBTR Krizanc & Narayanan, Randomized Selection on the Mesh-connected Processor Array 1990 LIBTR Zhang, Redundancy Control of a Robot Manipulator Using a Systolic Array Processor 1990 LIBTR Babel, Finding Maximum Cliques in Arbitrary and in Special Graphs 1990 LIBTR Shen & Edelsbrunner, Two Algorithms for Searching in a k-Key Table 1990 LIBTR Aharwal & Edelsbrunner & Schwarzkopf & Welzl, Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs 1990 LIBTR Board, Topics in Computational Learning Theory and Graph Algorithms 1990 LIBTR Dagum, On the Magnification of Exchange Graphs with Applications to Enumeration Problems 1990 LIBTR Ben-David & Borodin & Karp & Tardos & Wigderson, On the Power of Randomization in Online Algorithms 1990 LIBTR Karp, An Introduction to Randomized Algorithms 1990 LIBTR Karpinski & Meyer auf der Heide, On the Complexity of Genuinely Polynomial Computation 1990 LIBTR Cleve & Luby, A Note on Self-Testing/Correcting Methods for Trigonometric Functions 1990 LIBTR Ladkin & Anger & Rodriguez, Temporal Reasoning with Intervals in Branching Time 1990 LIBTR Karpinski & Luby, Approximating the Number of Solutions of a GF[2] Polynomial 1990 LIBTR Hirsch, Applications of Topology to Lower Bound Estimates in Computer Science 1990 LIBTR Freksa, Temporal Reasoning Based on Semi-intervals 1990 LIBTR Cleve, Towards Optimal Simulations of Formulas by Bounded-Width Programs 1990 LIBTR Omohundro, The Delaunay Triangulation and Function Learning 1990 LIBTR Ladkin & Crow, On Location: Points about Regions 1990 LIBTR Nelson, Virutal Memory vs. the File System 1990 LIBTR Broy, On the Design and Verification of a Simple Distributed Spanning Tree Algorithm 1990 LIBTR Diekert & Ochmanski & Reinhardt, On Confluent Semi-Commutations-Decidability and Complexity Results 1990 LIBTR Bellare & Micali, How to Sign Given any Trapdoor Permutation 1990 LIBTR Schapire, The Emerging Theory of Average-case Complexity 1990 LIBTR Blum & De Santis & Micali & Persiano, Non-interactive Zero Knowledge 1990 LIBTR Afek & Attiya & Dolev & Gafni & Merritt & Shavit, Atomic Snapshots of Shared Memory 1990 LIBTR Fekete & Lynch, The Need for Headers: An Impossibility Result for Communication over Unreliable Channels 1990 LIBTR Goldman & Lynch, Modelling Shared State in a Shared Action Model 1990 LIBTR Awerbuch & Peleg, Non-obtrusive Synchronizers 1990 LIBTR Feldman & Micali, An Optimal Algorithm for Synchronous Byzantine Agreement 1990 LIBTR Attiya & Bar-Noy & Dolev, Sharing Memory Robustly in Message-passing Systems 1990 LIBTR Fekete & Lynch & Weihl, A Serialization Graph Construction for Nested Transactions 1990 LIBTR Goldman & Rivest & Schapire, Learning Binary Relations and Total Orders 1990 LIBTR Tuttle, Knowledge and Distributed Computation 1990 LIBTR Liskov & Shrira & Wroclawski, Efficient At-Most-Once Messages Based on Synchronized Clocks 1990 LIBTR Pocchiola & Kranakis, Camera Placement in Integer Lattices (extended abstract) 1990 LIBTR Kissin, Upper and Lower Bounds on Switching Energy in VLSI 1990 LIBTR Kennaway & Klop & Sleep & de Vries, An Infinitary Church-Rosser Property for Non-collapsing Orthogonal Term Rewriting Systems 1990 LIBTR Kranakis & Krizanc, Computing Boolean Functions on Anonymous Hypercube Networks (extended abstract) 1990 LIBTR Rekers & Koorn, Substring Parsing for Arbitrary Context-free Grammars 1990 LIBTR Khachiyan, Complexity of Polytope Volume Computation 1990 LIBTR Amarel, Problem Solving 1990 LIBTR Lister, On Leaping Tall Maxima in a Single Bound: An Improved Learning Algorithm for the Boltzmann Machine 1990 LIBTR Meidanis, Lower Bounds for Arithmetic Problems 1990 LIBTR Sorenson, The K-ary GCD Algorithm 1990 LIBTR Cappello & Gallopoulos & Koc, Systolic Computation of Interpolating Polynomials 1990 LIBTR Kimura & Clarke, A Parallel Algorithm for Constructing Binary Decision Diagrams 1990 LIBTR Reynolds & Plotkin, On Functors Expressible in the Polymorphic Typed Lambda Calculus 1990 LIBTR Shaw, Informatics for a New Century: Computing Education for the 1990s and Beyond 1990 LIBTR Bates, The Architecture of PRL: A Mathematical Medium 1990 LIBTR Brookes & Geva, Towards a Theory of Parallel Algorithms on Concrete Data Structures 1990 LIBTR Leivant, Semantic Characterizations of Number Theories 1990 LIBTR Goetsch, Maximization of Mutual Information in a Context Sensitive Neural Network 1990 LIBTR Shaw, Prospects for an Engineering Discipline of Software 1990 LIBTR Gleicher & Witkin, Snap Together Mathematics 1990 LIBTR Vidal, The Computation of Grobner Bases on a Shared Memory Multiprocessor 1990 LIBTR Leivant, Finitely Stratified Polymorphism 1990 LIBTR Matias & Vishkin, On Parallel Hashing and Integer Sorting 1990 LIBTR Guimaraes & Gasarch & Purtilo, Selection Problems via k-ary Queries 1990 LIBTR Kedem & Palem & Raghunathan & Spirakis, Combining Tentative and Definite Executions for Dependable Parallel Computing 1990 LIBTR Abadi & Burrows & Kaufman & Lampson, Authentication and Delegation with Smart-cards 1990 LIBTR Hoogeveen & van de Velde, Polynomial-time Algorithms for Single-machine Multicriteria Scheduling 1990 LIBTR Gamkrelidze, On a Local Limit Theorem for Lattice Distribution 1990 LIBTR Hoogeveen, Analysis of Christofides' Heuristic: Some Paths are More Difficult than Cycles 1990 LIBTR van de Velde, Duality-based Algorithms for Scheduling Unrelated Parallel Machines 1990 LIBTR Ding & Schrijver & Seymour, Disjoint Cycles in Directed Graphs on the Torus and the Klein Bottle 1990 LIBTR Ding & Schrijver & Seymour, Disjoint Paths in a Planar Graph - A General Theorem 1990 LIBTR Schrijver & Seymour, A Simpler Proof and a Generalization of the Zero-Trees Theorem 1990 LIBTR Frank & Schrijver, Edge-disjoint Circuits in Graphs on the Torus 1990 LIBTR Cohen, On the Attained Waiting Time 1990 LIBTR Boxma & Levy & Weststrate, Efficient Visit Orders for Polling Systems 1990 LIBTR Veltman & Lageweg & Lenstra, Multiprocessor Scheduling with Communication Delays 1990 LIBTR Ukkonen, Approximate String Matching with Suffix Automata 1990 LIBTR Tarhio & Ukkonen, Approximate Boyer-Moore String Matching 1990 LIBTR Chelvanayagman, PASS (Protein Analysis System): A Simple Molecular Graphics System for Personal Computers 1990 LIBTR Chung & Sidhu, Fault Coverage of Probabilistic Test Sequences 1990 LIBTR Menezes, Reliability and Other Tradeoffs in a Spectrum of Double-Tree Interconnection Networks: A Case Study 1990 LIBTR Khuller & Naor & Klein, The Lattice Structure of Flow in Planar Graphs 1990 LIBTR Stewart, An Updating Algorithm for Subspace Tracking 1990 LIBTR Shankar & Lam, A Stepwise Refinement Heuristic for Protocol Construction 1990 LIBTR Ko & Orponen & Schoning & Watanabe, Instance Complexity 1990 LIBTR Abadi & Lamport, Composing Specifications 1990 LIBTR Abadi, An Axiomatization of Lamport's Temporal Logic of Actions 1990 LIBTR Ajtai & Komlos & Szemeredi, Generating Expanders from Two Permutations 1990 LIBTR Allender & Hemachandra & Ogiwara & Watanabe, Relating Equivalence and Reducibility to Sparse Sets 1990 LIBTR Allender, Oracles versus Proof Techniques That Do Not Relativize 1990 LIBTR Altman, Exclusion Methods for the Determination of Protein Structure from Experimental Data 1990 LIBTR Alur & Henzinger, Real-time Logics: Complexity and Expressiveness 1990 LIBTR Anderson, Composite Registers 1990 LIBTR Anderson, Multiple-Writer Composite Registers 1990 LIBTR Bagchi & Kalantari, New Optimality Conditions and Algorithms for Homogeneous and Polynomial Optimization over Spheres 1990 LIBTR Biham & Shamir, Differential Cryptanalysis of DES-like Cryptosystems 1990 LIBTR Chang, Parallel Algorithms for Optimal Routing Around a Rectangle 1990 LIBTR Cheriyan & Thurimella, On Determining Vertex Connectivity 1990 LIBTR Cox & Fowler & Veenstra, Interprocessor Invocation on a NUMA Multiprocessor 1990 LIBTR Dietz, Finding Ancestors in Trees 1990 LIBTR Gafter, Parallel Incremental Compilation 1990 LIBTR Gilmore, How Many Real Numbers Are There? 1990 LIBTR Goldberg, Processor-Efficient Implementation of a Maximum Flow Algorithm 1990 LIBTR Goldsmith & Hemachandra & Kunen, On the Structure and Complexity of Infinite Sets with Minimal Perfect Hash Functions 1990 LIBTR Guibas & Knuth & Sharir, Randomized Incremental Construction of Delaunay and Voronoi Diagrams 1990 LIBTR Haran & Harel, A Visual Formalism for Rule-based Systems 1990 LIBTR Harel & Rosner & Vardi, On the Power of Bounded Concurrency III: Reasoning about Programs 1990 LIBTR Hemachandra & Ogiwara & Toda, Space-efficient Recognition of Sparse Self-reducible Languages 1990 LIBTR Hemachandra, Algorithms from Complexity Theory: Polynomial-Time Operations for Complex Sets 1990 LIBTR Heydon, An Introduction to Circuit Complexity and a Guide to Hastad's Proof 1990 LIBTR Hung & Wen & Gallivan & Saleh, A Parallel Circuit Simulation Using Hierarchical Relaxation 1990 LIBTR Jain, Learning in the Presence of Additional Information and Inaccurate Information 1990 LIBTR Karzanov & Khachiyan, On the Conductance of Order Markov Chains 1990 LIBTR Khachiyan & Kalantari, Diagonal Matrix Scaling and Linear Programming 1990 LIBTR Krumme & Cybenko & Venkataraman, Gossiping in Minimal Time 1990 LIBTR Kyburg, Giving up Certainties 1990 LIBTR Kyburg, Uncertainty Logics 1990 LIBTR Lange & Rossmanith, Two Results on Unambiguous Circuits 1990 LIBTR Larrabee, Efficient Generation of Test Patterns Using Boolean Satisfiability 1990 LIBTR Melissaratos & Souvaine, Shortest Paths Help Solve Geometric Optimization Problems on Planar Regions 1990 LIBTR Mellor-Crummey & Scott, Algorithms for Scalable Synchronization on Shared-Memory Multiprocessors 1990 LIBTR Miranker, Has Parallel Computing Failed Again? A Manifesto for Parallel Computation 1990 LIBTR Pierce, A Taste of Category Theory for Computer Scientists 1990 LIBTR Pratt, Dynamic Algebras as a Well-behaved Fragment of Relational Algebras 1990 LIBTR Pugh, A Skip List Cookbook 1990 LIBTR Pugh, Concurrent Maintenance of Skip Lists 1990 LIBTR Ribas, Automatic Generation of Systolic Programs from Nested Loops 1990 LIBTR Schubert, Semantic Nets are in the Eye of the Beholder 1990 LIBTR Sherman, On Superpolylogarithmic Subexponential Fuctions 1990 LIBTR Vogler, Recognizing Edge Replacement Graph Languages in Cubic Time 1989 LIBTR Safavi-Naini, Parallel Generation of Pseudo-random Sequences 1989 LIBTR Safavi-Naini & Seberry, Pseudo Random Sequences from Codes 1989 LIBTR Kolen & Goel, Learning in Parallel Distributed Processing Networks: Computational Complexity and Information Content 1989 LIBTR Drakopoulos & Constantopoulos, An Exact Algorithm for 2-D String Matching 1989 LIBTR Fyfe, Properties of the V-C Dimension 1989 LIBTR Wegner, Concepts and Paradigms of Object-oriented Programming (expansion of Oct. 4 OOPSLA-89 keynote talk) 1989 LIBTR Schuster, Deterministic PRAM Simulation with Constant Memory Blow-up 1989 LIBTR Buchsbaum & Kanellakis & Vitter, A Data Structure for Arc Insertion and Regular Path Finding 1989 LIBTR Tamassia & Vitter, Parallel Transitive Closure and Point Location in Planar Structures 1989 LIBTR Shvartsman, Achieving Optimal CRCW PRAM Fault-Tolerance 1989 LIBTR Edwards, The Complexity of Some Graph Colouring Problems 1989 LIBTR Safavi-Naini, Parallel Generation of Pseudo-random Sequences 1989 LIBTR Pieprzyk & Seberry, Remarks on Extension of DES -- Which Way To Go? 1989 LIBTR Safavi-Naini & Seberry, Pseudo Random Sequences from Codes 1989 LIBTR Sharir & Overmars, A Simple Output-sensitive Algorithm for Hidden Surface Removal 1989 LIBTR Shasha & Wang, Optimal Best-Match Retrieval 1989 LIBTR Kedem & Palem & Spirakis, Efficient Robust Parallel Computations 1989 LIBTR Agarwal, Ray Shooting and Other Applications of Spanning Trees with low Stabbing Number 1989 LIBTR Aronov & Edelsbrunner & Guibas & Sharir, Improved Bounds on the Number of Edges of Many Faces in Arrangements of Line Segments 1989 LIBTR Kirkpatrick & Kosaraju & Mishra & Yap, Quantitative Steinitz's Theorems with Applications to Multifingered Grasping 1989 LIBTR Overmars & Schipper & Sharir, Storing Line Segments in Partition Trees 1989 LIBTR Mishra & Tarjan, A Linear Time Algorithm for Finding an Ambitus 1989 LIBTR Sifrony, Decision in Motion Planning is Easier than Path Calculation 1989 LIBTR Lamdan & Wolfson, On the Error Analysis of Geometric Hashing 1989 LIBTR Cole & Mishra & Schmidt & Siegel, On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log n-Block Sequences 1989 LIBTR Cole, On the Dynamic Finger Conjecture for Splay Trees. Part II: Finger Searching 1989 LIBTR Li, Complexity of Term Rewriting 1989 LIBTR Sifrony, A Real Nearly Linear Algorithm for Translating a Convex Polygon 1989 LIBTR Caianiello, Learning as the Evolution of Representation 1989 LIBTR Waxman, New Approximation Algorithms for the Steiner Tree Problem 1989 LIBTR Natarajan, Some Results on Learning 1989 LIBTR Neilsen & Mizuno, A DAG-based Algorithm for Distributed Mutual Exclusion 1989 LIBTR Gangnet & Herve & Pudet & Van Thong, Incremental Computation of Planar Maps 1989 LIBTR Bertin & Roncin & Vuillemin, Introduction to Programmable Active Memories 1989 LIBTR Buchsbaum & Kanellakis & Vitter, A Data Structure for Arc Insertion and Regular Path Finding 1989 LIBTR Feigenbaum & Merritt, DIMACS Workshop on Distributed Computing and Cryptography 1989 LIBTR Komjath & Pach, Universal Elements and the Complexity of Certain Classes of Infinite Graph 1989 LIBTR Robertson & Seymour & Thomas, Quickly Excluding a Planar Graph 1989 LIBTR Seymour & Thomas, Excluding Infinite Trees 1989 LIBTR Alon & Seymour & Thomas, A Separator Theorem for Non-planar Groups 1989 LIBTR Hwang & Monma & Roberts, DIMACS Workshop on Reliability of Computer and Communication Networks 1989 LIBTR Chazelle, DIMACS Workshop on Geometric Complexity 1989 LIBTR Heath, Covering a Set with Arithmetic Progressions is NP-Complete 1989 LIBTR Olderog & Apt, Using Transformations to Verify Parallel Programs 1989 LIBTR Roucairol, Parallel Computing in Combinatorial Optimization 1989 LIBTR Lavallee & Lavault, Yet Another Distributed Election and (Minimum-Weight) Spanning Tree Algorithm 1989 LIBTR Badouel, Algebraically Closed Theories 1989 LIBTR Lesventes, A Simple Graph Construction of Semilinear Reachability Sets of Vector Addition Systems 1989 LIBTR Sharir & Overmars, A Simple Output-Sensitive Algorithm for Hidden Surface Removal 1989 LIBTR Shasha & Wang, Optimal Best-Match Retrieval 1989 LIBTR Kedem & Palem & Spirakis, Efficient Robust Parallel Computations 1989 LIBTR Agarwal, Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number 1989 LIBTR Kirkpatrick & Kosaraju & Mishra & Yap, Quantitative Steinitz's Theorems with Applications to Multifingered Grasping 1989 LIBTR Overmars & Schipper & Sharir, Storing Line Segments in Partition Trees 1989 LIBTR Mishra & Tarjan, A Linear Time Algorithm for Finding an Ambitus 1989 LIBTR Sifrony, Decision in Motion Planning is Easier than Path Calculation 1989 LIBTR Lamdan & Wolfson, On the Error Analysis of Geometric Hashing 1989 LIBTR Cole & Mishra & Schmidt & Siegel, On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log n-Block Sequences 1989 LIBTR Cole, On the Dynamic Finger Conjecture for Splay Trees. Part II: Finger Searching 1989 LIBTR Li, Complexity of Term Rewriting 1989 LIBTR Sifrony, A Real Nearly Linear Algorithm for Translating a Convex Polygon 1989 LIBTR Waxman, New Approximation Algorithms for the Steiner Tree Problem 1989 LIBTR Al-Dhelaan & Bose, Efficient Fault Tolerant Broadcasting Algorithm for the Hypercube 1989 LIBTR Al-Dhelaan & Bose, Efficient Fault Tolerant Broadcasting Algorithm for the Cube-connected Cycles Network 1989 LIBTR Kazerouni-zand & Fisher, Deletions on Persistent B-Trees 1989 LIBTR Serpette & Vuillemin & Herve, BigNum: A Portable and Efficient Package for Arbitrary-Precision Arithmetic 1989 LIBTR Efe, Embedding Mesh of Trees in the Hypercube 1989 LIBTR Isaak & Kim & McKee & McMorris & Roberts, 2 - Competition Graphs 1989 LIBTR Camion & Patarin, The Knapsack Hash Function Proposed at Crypto '89 Can Be Broken 1989 LIBTR Fyfe, Properties of the V-C Dimension 1989 LIBTR Perlis, Some Brief Essays on Mind 1989 LIBTR Makinen, On the Subtree Isomorphism Problem for Ordered Trees 1989 LIBTR Shallit, On the Worst Case of Three Algorithms for Computing the Jacobi Symbol 1989 LIBTR LaRowe & Ellis, NUMA Multiprocessor Page Placement Policies 1989 LIBTR LaRowe & Ellis, Dynamic Page Placement in a NUMA Multiprocessor Virtual Memory System 1989 LIBTR Rim & Kashiwabara & Nakajima, A Note on the NP-Hardness of the Topological Via Minimization Problem 1989 LIBTR Amir & Farach, The Whole is Faster than its Parts Efficient Matching of Nonrectangular Shapes 1989 LIBTR Downey & Gasarch & Homer & Moses, On Honest Polynomial Reductions, Relativizations, and P=NP 1989 LIBTR Wu & Ja'Ja', Optimal Algorithms for Adjacent Side Routing 1989 LIBTR Ja'Ja' & Ryu, Efficient Techniques for Routing and for Solving Graph Problems on the Hypercube 1989 LIBTR Landau & Vishkin & Nussinov, Fast Alignment of DNA and Protein Sequences 1989 LIBTR McElvany, Guaranteed Deadlines for Hard Real-time Fault-tolerant Distributed Systems 1989 LIBTR Kanevsky, On the Balanced Tree of K+1 - Connected Components 1989 LIBTR Kanevsky, Graphs with Odd and Even Edge Connectivities are Inherently Different 1989 LIBTR Jerrum & McKay & Sinclair, When is a Graphical Sequence Stable? 1989 LIBTR Langston & Morford, Resource Allocation under Limited Sharing 1989 LIBTR Lynch & Goldman, Distributed Algorithms: Lecture Notes for 6.852 1989 LIBTR Ginat & Shankar & Agrawala, A Simple Near-optimal Solution to the Drinking Philosophers Problem 1989 LIBTR Stotts & Pugh, A Notation for Parallelism in Finite Automata 1989 LIBTR Agrawala & Kim, Time Estimates and Clock Synchronization in Distributed Systems 1989 LIBTR Yuan & Agrawala, A Decomposition Approach to Non-preemptive Real-time Scheduling 1989 LIBTR Litwin & Rossopoulos, A Model for Computer Life 1989 LIBTR de la Torre & Kruskal, Fast Parallel Algorithms for All Source Lexicographic Search and Path Finding Problems 1989 LIBTR Ja'Ja' & Ryu, Load Balancing and Routing on the Hypercube and Related Networks 1989 LIBTR Beigel & Gasarch, The Mapmaker's Dilemma 1989 LIBTR Amir & Farach, The Whole Is Faster Than Its Parts: Efficient Matching of Non-rectangular Shapes 1989 LIBTR Berkman & Breslauer & Galil & Schieber & Vishkin, Highly Parallelizable Problems 1989 LIBTR Ja'Ja' & Wu, Optimal Algorithms for Adjacent Side Routing 1989 LIBTR Ja'Ja' & Ryu, Efficient Algorithms for Routing and Solving Graph Problems on the Hypercube 1989 LIBTR Rim & Kashiwabara & Nakajima, A Note on the NP-Hardness of the Topological Via Minimization Problem 1989 LIBTR Landau & Vishkin, Fast Alignment of DNA and Protein Sequences 1989 LIBTR Quong, On the Average-Case Running Time of the Boyer-Moore String Matching Algorithm 1989 LIBTR Nirkhe & Tripathi, Synchronization in Hard Real-time Systems 1989 LIBTR Amir & Landau, Fast Parallel and Serial Multidimensional Approximate Array Matching 1989 LIBTR Vishkin, Deterministics Sampling for Fast Pattern Matching 1989 LIBTR de la Torre & Kruskal, A Simplified Parallel Algorithm for Computing the BFS Numbering of a Directed Graph and a Companion Boolean Matrix Multiplication Algorithm 1989 LIBTR Dagan & Itai, A Set Expression Based Inheritance System 1989 LIBTR Roth & Lempel, t-Sum Generators of Finite Abelian Groups 1989 LIBTR Gordon, Analysis of Minimal Path Routing Schemes in the Presence of Faults 1989 LIBTR Chou & Gao, Ritt-Wu's Decomposition Algorithm and Geometry Theorem Proving 1989 LIBTR Clingman & Friesen, Algebraic Analysis of Goal Seeking Automata 1989 LIBTR Clingman & Friesen, Algebraic Analysis of Goal-Seeking Systems 1989 LIBTR Clingman & Friesen, Algebraic Analysis of Neural Net Learning 1989 LIBTR Brinch Hansen, Analysis of a Parallel Mergesort 1989 LIBTR Ranka & Sahni, Computing Hough Transforms on Hypercube Multicomputers 1989 LIBTR Brinch Hansen, The Nature of Parallel Programming 1989 LIBTR Ranka & Wang & Yeh, Embedding Meshes on the Star Graph 1989 LIBTR Ranka & Heywood, Two-dimensional Pattern Matching with k Mismatches 1989 LIBTR Tromp & van Emde Boas, Associative Storage Modification Machines 1989 LIBTR Boissonnat & Yvinec, Probing a Scene of Non Convex Polyhedra 1989 LIBTR Boissonnat & Devillers-Teillaud, On the Randomized Construction of the Delaunay Tree 1989 LIBTR Morain, Distributed Primality Proving and the Primality of (2^{3539} + 1)/3 1989 LIBTR Warmuth, Towards Representation Independence in PAC Learning 1989 LIBTR Helmbold & Sloan & Warmuth, Learning Nested Differences of Intersection-Closed Classes 1989 LIBTR Roberts, Proximity Search via Content Addressable Memory (PCAM) 1989 LIBTR Aiken & Nicolau, Fine-grain Parallelization versus the Wavefront Method 1989 LIBTR Ngai, A Framework for Adaptive Routing in Computer Networks 1989 LIBTR Cai, The Polynomial Hierarchy is Provable by Two Provers in one Round 1989 LIBTR Abe, Characterizing PAC-Learnability of Semilinear Sets and Commutative Regular Languages 1989 LIBTR Sundar & Tarjan, Unique Binary Search Tree Representations and Equality-Testing of Sets and Sequences 1989 LIBTR Halpern & Moses, Knowledge and Common Knowledge in a Distributed Environment 1989 LIBTR Merkle, Large Scale Analysis of Neural Structures 1989 LIBTR Ngai, A Framework for Adaptive Routing in Computer Networks 1989 LIBTR Cai, The Polynomial Hierarchy is Provable by Two Provers in One Round 1989 LIBTR Abe, Characterizing PAC-Learnability of Semilinear Sets and Commutative Regular Languages 1989 LIBTR Sundar & Tarjan, Unique Binary Search Tree Representations and Equality-testing of Sets and Sequences 1989 LIBTR Halpern & Moses, Knowledge and Common Knowledge in a Distributed Environment 1989 LIBTR Ichiyoshi, Research Issues in Parallel Knowledge Information Processing 1989 LIBTR Sakakibara, An Efficient Learning of Context-free Grammars from Positive, Structural Examples 1989 LIBTR Anderson, Composite Registers 1989 LIBTR Anderson, Multiple-writer Composite Registers 1989 LIBTR Zimmermann & Zimmermann, The Automatic Complexity Analysis of Divide-and-Conquer Algorithms 1989 LIBTR Kim, Times Estimates and Clock Synchronization in Distributed Systems 1989 LIBTR Sher & Revenkar & Venkatesan, An Object Oriented Model for a Radar System Simulation 1989 LIBTR Quong, Searching for Fixed-Length Patterns 1989 LIBTR Gonzalez & Razzazi & Zheng, An Efficient Divide-and-Conquer Approximation Algorithm for Hyperrectangular Partitions 1989 LIBTR Ganzalez & Razzazi & Zheng, On Optimal Guillotine Partitions Approximating Hyperrectangular Partitions 1989 LIBTR Gonzalez & Zheng, Grid Stretching Algorithms for Routing Multiterminal Nets through a Rectangle 1989 LIBTR Gonzalez & Razzazi, Properties and Algorithms for Constrained Delaunay Triangulations 1989 LIBTR Wee & Chaiken, An Optimal Parallel Voronoi Diagram Algorithm with L1 Metric 1989 LIBTR Bernhard & Rosenkrantz, An Efficient Method for the Representation and Transmission of Message Patterns on Multiprocessor Interconnection Networks 1989 LIBTR Bernhard & Rosenkrantz, Algebraic Structure of Mask-Representable Address Sets and Message Patterns 1989 LIBTR Willard, Applications of Range Query Theory to Relational Data Base Join and Selection Operations 1989 LIBTR Takada, On Learning Semilinear Sets: An Approach to Learning Parallel, Computation Models 1989 LIBTR Ahuja & Zhu, Job Scheduling on Hypercubes 1989 LIBTR Ahuja & Zhu, A Faster Algorithm for Preemptive Scheduling of Independent Jobs on a Hypercube 1989 LIBTR Gahlot & Singhal, On Fairness of Distributed Mutual Exlusion Algorithms 1989 LIBTR Chen, NC Algorithms for Circular-Arc Graphs 1989 LIBTR Schanck & Mamrak, A Composition Environment to Support Scholarly Authoring 1989 LIBTR Harms & Weide, Efficient Initialization and Finalization of Data Structures: Why and How 1989 LIBTR Kolen & Goel, Learning in Parallel Distributed Processing Networks: Computational Complexity and Information Content 1989 LIBTR Pollack, Connectionism: Past, Present, and Future 1989 LIBTR Pollack, Book Review of Perceptrons: An Introduction to Computational Geometry, Expanded Edition (Minsky, Papert) 1989 LIBTR Singhal, Theory and Construction of Optimal Dynamic Information-Structure Mutual Exclusion Algorithms for Distributed Systems 1989 LIBTR Gabow & Tarjan, Faster Scaling Algorithms for General Graph Matching Problems 1989 LIBTR Boppana & Sipser, The Complexity of Finite Functions 1989 LIBTR Fellows & Langston, An Analogue of the Myhill-Nerode Theorem and its Use in Computing Finite-Basis Characterizations 1989 LIBTR Guan & Langston, Time-Space Optimal Parallel Merging and Sorting 1989 LIBTR Huang & Langston, Fast Stable Merging and Sorting in Constant Extra Space 1989 LIBTR Langston & Morford, Resource Allocation under Limited Sharing 1989 LIBTR MacLennan, Outline of a Theory of Massively Parallel Analog Computation 1989 LIBTR MacLennan, Continuous Computation: Taking Massive Parallelism Seriously 1989 LIBTR Toussaint, Computational Geometry: Recent Developments 1989 LIBTR Seymour & Thomas, Graph Searching, and a Minimax Theorem for Tree-width 1989 LIBTR Levinson, Towards more Optimal Vertex Covers 1989 LIBTR Kolaitis & Papadimitriou, Some Computational Aspects of Circumscription 1989 LIBTR Anderson & Kahan, An O(n log n) Algorithm for 1-D Tile Compaction 1989 LIBTR Littlestone, Mistake Bounds and Logarithmic Linear-Threshold Learning Algorithms 1989 LIBTR Pagallo & Haussler, A Greedy Method for Learning uDNF Functions under the Uniform Distribution 1989 LIBTR Colin & Levinson, Partial Order Maintenance: A Tutorial 1989 LIBTR Littlestone & Warmuth, The Weighted Majority Algorithm 1989 LIBTR Ramamoorthy, 3-Partition Remains Intractable for Distinct Numbers 1989 LIBTR Kolaitis, Implicit Definability on Finite Structures and Unambiguous Computations 1989 LIBTR Haussler, Generalizing the PAC Model for Neural Net and Other Learning Applications 1989 LIBTR Fulcher, Neural Networks - A Survey 1989 LIBTR Ruzsa, On the Number of Sums and Differences 1989 LIBTR Dobkin & Souvaine, Detecting the Intersection of Convex Objects in the Plane 1989 LIBTR Hoffmann, On the Rectilinear Art Gallery Problem 1989 LIBTR Ruzsa, The Density of the Set of Sums 1989 LIBTR Floyd, On Space-bounded Learning and the Vapnik-Chervonenkis Dimension 1989 LIBTR Karpinski & Werther, VC Dimension and Learnability of Sparse Polynomials and Rational Functions 1989 LIBTR Cleve, Controlled Gradual Disclosure Schemes for Random Bits and their Applications 1989 LIBTR Ben-David & Chor & Goldreich & Luby, On the Theory of Average Case Complexity 1989 LIBTR Reischuk, Fast Evaluation of Boolean Formulas by CREW-PRAMs 1989 LIBTR Dahlhaus & Karpinski, An Efficient Parallel Algorithm for the 3MIS Problem 1989 LIBTR Guesgen, Spatial Reasoning Based on Allen's Temporal Logic 1989 LIBTR Karp & Zhang, On Parallel Evaluation of Game Trees 1989 LIBTR Kannan, Program Checkers for Algebraic Problems 1989 LIBTR Blum, Lectures on a Theory of Computation and Complexity over the Reals (or an Arbitrary Ring) 1989 LIBTR Gibbons, The Asynchronous PRAM: A Semi-synchronous Model for Shared Memory MIMD Machines 1989 LIBTR Ousterhout, Why Aren't Operating Systems Getting Faster as Fast as Hardware? 1989 LIBTR Welch & Lynch, Synthesis of Efficient Drinking Philosophers Algorithms 1989 LIBTR Schapire, The Strength of Weak Learnability 1989 LIBTR Lynch & Attiya, Using Mappings to Prove Timing Properties 1989 LIBTR Awerbuch & Peleg, Routing with Polynomial Communication-Space Tradeoff 1989 LIBTR Awerbuch & Peleg, Online Tracking of Mobile Users 1989 LIBTR Kipnis, Priority Arbitration with Busses 1989 LIBTR Attiya & Lynch, Time Bounds for Real-time Process Control in the Presence of Timing Uncertainty 1989 LIBTR Lynch, A Hundred Impossibility Proofs for Distributed Computing 1989 LIBTR Blelloch, Scan Primitives and Parallel Vector Models 1989 LIBTR Stein, Using Cycles and Scaling in Parallel Algorithms 1989 LIBTR Phillips, Theoretical and Experimental Analyses of Parallel Combinatorial Algorithms 1989 LIBTR Pan, A New Algorithm for the Symmetric Eigenvalue Problem 1989 LIBTR McNaughton, The Development of Formal Language Theory since 1956 1989 LIBTR Gu & Rosenkrantz & Ravi, Design and Analysis of Test Schemes for Algorithm-based Fault Tolerance 1989 LIBTR Rosenkrantz & Hunt, The Complexity of Processing Hierarchical Specifications 1989 LIBTR Stearns & Hunt, Power Indices, Structure Trees, and Easier Hard Problems 1989 LIBTR Pan, Parallel Solution of Sparse Linear and Path Systems 1989 LIBTR Pan, Superfast and Storage Efficient Inversion and Triangular Factorization of Toeplitz-like Matrices 1989 LIBTR Kandri-Rody & Kapur & Winkler, Knuth-Bendix Procedure and Buchberger Algorithm - A Synthesis 1989 LIBTR Pan & Reif, On the Bit-complexity of Discrete Solutions of PDEs: Compact Multigrid 1989 LIBTR Wee & Chaiken & Ravi, Rectilinear Spanning Trees Using Geographic Nearest Neighbors 1989 LIBTR Wee & Chaiken & Willard, On the Angle Restricted Nearest Neighbor Problem 1989 LIBTR Willard, Lower Bounds for the Addition-Subtraction Operations in Orthogonal, Range Queries and Related Problems 1989 LIBTR Pan, Estimating the Extremal Eigenvalues of a Symmetric Matrix 1989 LIBTR Stearns & Hunt, SAT, Structure Trees, and the Complexity of Finite Algebra and Combinatorial Optimization (preliminary report) 1989 LIBTR Willard, Optimal Sample Cost Residues for Differential Data Base Batch Query Problems 1989 LIBTR Whitesides & Zhao, On the Placement of Euclidean Trees 1989 LIBTR Wu & Manber & Myer & Miller, An O(NP) Sequence Comparison Algorithm 1989 LIBTR Manber & Wu, An Algorithm for Approximate String Matching with Non Uniform Costs 1989 LIBTR Downey, Bounding Synchronization Overhead for Parallel Iteration 1989 LIBTR Chandran, Merging in Parallel Computational Geometry 1989 LIBTR Leavens, A Distributed Search Program for the 3x + 1 Problem 1989 LIBTR Fernandez-Baca & Williams, On Matroids and Hierarchical Graphs 1989 LIBTR Lutz, Measure-theoretic Pseudorandomness: Robustness of the Notion 1989 LIBTR Yen, A Multiparameter Analysis of Domino Tiling with an Application to Concurrent Systems 1989 LIBTR Book & Lutz & Tang, Additional Queries to Random and Pseudorandom Oracles 1989 LIBTR Lutz, An Upward Separation Theorem 1989 LIBTR Yen, A Logic for Petri Nets and its Applications 1989 LIBTR Fernandez-Baca & Williams, Augmentation Problems on Hierarchically Defined Graphs 1989 LIBTR Yen, Communicating Processes, Scheduling and the Complexity of Nontermination 1989 LIBTR Howell & Rosier & Yen, Normal and Sinkless Petri Nets 1989 LIBTR Mukkavilli & Prabhu, On Implementing Divide-and-Conquer Algorithms for Multiprocessors 1989 LIBTR Bar-Ilan & Beaver, Non-Cryptographic Fault-Tolerant Computing in a Constant Number of Rounds of Interaction 1989 LIBTR Ossia & Rudolph, Adaptive Algorithms 1989 LIBTR Bar-Ilan & Zernik, Random Leaders and Random Spanning Trees 1989 LIBTR Schwarz & Shamir, The Two Dimensional Compaction Problem 1989 LIBTR Gotsman, On Boolean Functions, Polynomials and Algebraic Threshold Functions 1989 LIBTR Heath & Rosenberg, Graph Layout Using Queues 1989 LIBTR Tunnell & Heath, Development of New Heuristics for the Euclidean Traveling Salesman Problem 1989 LIBTR Berman & Garay & Perry, Asymptotically Optimal Distributed Consensus with Optimal Resiliency 1989 LIBTR Pardalos & Ye & Han, Algorithms for the Solution of Quadratic Knapsack Problems 1989 LIBTR Berman & Garay, Cloture Voting: n/4-Resilient, Polynomial Time Distributed Consensus in t+1 Rounds 1989 LIBTR Furer, On the Complexity of Integer Multiplication (extended abstract) 1989 LIBTR Furer & Raghavachari, A Simple NC Reduction Form Vertex-weighted Matching to Perfect Matching 1989 LIBTR Furer & Raghavachari, An NC Approximation Algorithm for the Minimum Degree Spanning Tree Problem 1989 LIBTR Bui & Prabhu, Reconfigurable Embeddings of a Multi-dimensional Mesh in a Hypercube 1989 LIBTR Desai & Pardalos, An Algorithm for Finding a Maximum Weighted Independent Set in an Arbitrary Graph 1989 LIBTR Berman & Schnitger, On the Complexity of Approximating the Independent Set Problem 1989 LIBTR Hwang & Owens & Irwin, Exploiting Communication Complexity for Multi-level Logic Synthesis 1989 LIBTR Berman & Garay & Perry, Recursive Phase King Protocols for Distributed Consensus 1989 LIBTR Goldstine & Leung & Wotschke, On the Relation between Ambiguity and Nondeterminism in Finite Automata 1989 LIBTR Friesen & Langston, Analysis of a Compound Bin Packing Algorithm 1989 LIBTR Fellows & Langston, On Well-Partial-Order Theory and its Application to Combinatorial Problems of VLSI Design 1989 LIBTR Brossman & Cross, Model-based Recognition of Characters in Trademark Artwork 1989 LIBTR Cross & Kuo, A Two-step String-matching Procedure 1989 LIBTR Guan & Langston, Time-Space Optimal Parallel Merging and Sorting 1989 LIBTR Abrahamson, A Time-Space Tradeoff for Boolean Matrix Multiplication 1989 LIBTR Flajolet & Odlyzko, Random Mapping Statistics 1989 LIBTR Hascoet, Theory Meets Efficiency: A New Implementation for Proof Trees 1989 LIBTR Kalorkoti, Turing Degrees and the Word and Conjugacy Problems for Finitely Presented Groups 1989 LIBTR Walker, Automated Analysis of Mutual Exclusion Algorithms Using CCS 1989 LIBTR Gabow & Westermann, Forests, Frames and Games: Algorithms for Matroid Sums and Applications 1989 LIBTR LaPaugh & Lipton & Sandberg, How to Store a Triangular Matrix 1989 LIBTR Cai & Condon & Lipton, On Bounded Round Multi-Prover Interactive Proof Systems 1989 LIBTR Cai & Condon & Lipton, Playing Games of Incomplete Information 1989 LIBTR Friedman & Wigderson, On the Second Eigenvalue of Hypergraphs 1989 LIBTR Dobkin & Souvaine, Detecting the Intersection of Convex Objects in the Plane 1989 LIBTR Friedman, Some Graphs with Small Second Eigenvalue 1989 LIBTR Westbrook, Algorithms and Data Structures for Dynamic Graph Problems 1989 LIBTR Westbrook & Tarjan, Maintaining Bridge-connected and Biconnected Components On-line 1989 LIBTR Chazelle & Palios, Triangulating a Nonconvex Polytope 1989 LIBTR Hershberger & Brown, Boolean Formulae for Simple Polygons 1989 LIBTR Denning, The Internet Worm 1989 LIBTR Jaeckel, An Alternative Design for a Sparse Distributed Memory 1989 LIBTR Denning, Bayesian Learning 1989 LIBTR Dennis, The Paradigm Compiler: Mapping a Functional Language for the Connection Machine 1989 LIBTR Denning, Sparse Distributed Memory 1989 LIBTR Herlihy & Lynch & Merritt & Weihl, On the Correctness of Orphan Management Algorithms 1989 LIBTR Itai & Kutten & Wolfstahl & Zaks, Optimal Distributed t-Resilient Election in Complete Networks 1989 LIBTR Taubenfeld & Katz & Moran, Impossibility Results in the Presence of Multiple Faulty Processes 1989 LIBTR Korach & Solel & Tal, On Disjoint Paths Problems in Graphs with Bounded Tree Width 1989 LIBTR Bshouty, Lower Bounds for the Complexity of Functions in Random Access Machines 1989 LIBTR Korach & Ostfeld, Recognition of DFS Trees: Sequential and Parallel Algorithms with Refined Verifications 1989 LIBTR Korach & Kutten & Moran, A Modular Technique for the Design of Efficient Distributed Leader Finding Algorithms 1989 LIBTR Bshouty, A Lower Bound for Matrix Multiplication 1989 LIBTR Bshouty, Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains 1989 LIBTR Bshouty, On the 2 x 2 Matrix Multiplication 1989 LIBTR Goldreich, Foundations of Cryptography: List of References 1989 LIBTR Abe, Polynomial Learnibility of Formal Languages 1989 LIBTR Agarwal & Aggarwal & Aronov & Kosaraju & Schieber & Suri, Computing External-Farthest Neighbors for a Simple Polygon 1989 LIBTR Aggarwal & Alpern & Chandra & Snir, A Model for Hierarchical Memory 1989 LIBTR Aggarwal & Edelsbrunner & Raghavan & Tiwari, Optimal Time Bounds for Some Proximity Problems in the Plane 1989 LIBTR Aggarwal & Park, Sequential Searching in Multidimensional Monotone Arrays 1989 LIBTR Ajtai & Linial, The Influence of Large Coalitions 1989 LIBTR Allison & Yee, Minimum Message Length Encoding and the Comparison of Macromolecules 1989 LIBTR Alon & Kleitman, Partitioning a Rectangle into Small Perimeter Rectangles 1989 LIBTR Alon & Seymour & Thomas, A Separator Theorem for Graphs with an Excluded Minor and its Applications 1989 LIBTR Aronov & Edelsbrunner & Guibas & Sharir, Improved Bounds on the Number of Edges of Many Faces in Arrangements of Line Segments 1989 LIBTR Bar-Yehuda & Ben-Chanoch, Covering Polygons with Squares 1989 LIBTR Bar-Yehuda & Israeli & Itai, Multiple Communication in Multi-hop Radio Networks 1989 LIBTR Barrero, Inference of Tree Grammars with Identification in the Limit 1989 LIBTR Beaver, Perfect Privacy for Two-Party Protocols 1989 LIBTR Bein & Brucker & Stallmann, A Characterization of Network-Representable Polymatroids 1989 LIBTR Ben-David & Benedek & Mansour, The Passive Student is Really Weaker (A Parametrization Scheme for Classifying Models of Learnability) 1989 LIBTR Benedek, Problems in Computerized Learnability 1989 LIBTR Bernabeu-Auban & Ahamad, Modeling an Efficient Mutual Exclusion Algorithm 1989 LIBTR Bestavros, The Input Output Real-time Automaton: A Model for Real-time Parallel Computation 1989 LIBTR Boneh & Hofri, The Coupon-Collector Problem Revisited 1989 LIBTR Boroujerdi & Moret & Morgenstern & Shapiro, Observed Linear-Time Algorithms for Four-Coloring Large Planar Graphs 1989 LIBTR Bruck, Optimal Broadcasting in Faulty Hypercubes via Edge-Disjoint Embedding 1989 LIBTR Chang & Ja'Ja' & Ryu, Optimal Parallel Algorithms for One-Layer Routing 1989 LIBTR Chang & Ja'Ja', Parallel Algorithms for Channel Routing in the Knock-Knee Model 1989 LIBTR Chen & Liao & Yun & Tanik, Studies on Multi-Peg Towers of Hanoi 1989 LIBTR Chen & Shin, Depth-first Search Approach for Fault-tolerant Routing in Hypercube Multicomputers 1989 LIBTR Chou & Gao & Arnon, On the Mechanical Proof of Geometry Theorems Involving Inequalities 1989 LIBTR Chou & Gao, A Class of Geometry Statements of Contructive Type and Geometry Theorem Proving 1989 LIBTR Chvatal & Sun, Recognizing Dart-free Perfect Graphs 1989 LIBTR Colvin & Coyle & Tanik, The Lisp Programming Language: Tutorial and Experience 1989 LIBTR Cypher, Theoretical Aspects of VLSI Pin Limitations 1989 LIBTR Dadoun & Kirkpatrick, Optimal Parallel Algorithms for Convex Polygon Separation 1989 LIBTR Dandamudi & Eager, Hot-spot Contention in Binary Hypercube Networks 1989 LIBTR Dehne & Ferreira & Rau-Chaplin, Parallel Fractional Cascading on a Hypercube Multiprocessor 1989 LIBTR Dolev, Distinguishing Timing Failures from Clock Failures (extended abstract) 1989 LIBTR Edelsbrunner & Overmars & Welzl, Ranking Intervals under Visibility Constraints 1989 LIBTR Edelsbrunner & Shi, An O(n log^2 h) Time Algorithm for the Three-Dimensional Convex Hull Problem 1989 LIBTR Etzion & Bar-David, An Explicit Construction of Euler Circuits in Shuffle Nets and Related Networks 1989 LIBTR Gao, Towards Structured Parallel Computing - Part I - A Theory of Algorithm Design and Analysis for Distributed-memory Architectures 1989 LIBTR Gereb-Graus, Lower Bounds on Parallel, Distributed and Automata Computations 1989 LIBTR Goguen, A Categorical Manifesto 1989 LIBTR Goldreich & Herzberg & Mansour, Source to Destination Communication in the Presence of Faults 1989 LIBTR Goldreich & Krawczyk, On the Composition of Zero-Knowledge Proof Systems 1989 LIBTR Goldreich & Krawczyk, Sparse and Evasive Pseudorandom Distributions 1989 LIBTR Goldreich & Micali & Wigderson, Proofs That Yield Nothing But Their Validity or All Languages in NP Have Zero-Knowledge Proofs (Revised Version of TR#498) 1989 LIBTR Goldreich, A Uniform-Complexity Treatment of Encryption and Zero-Knowledge 1989 LIBTR Gouda & Howell & Rosier, The Instability of Self-Stabilization 1989 LIBTR Goumbic & Laskar, Irredundancy in Circular Arc Graphs 1989 LIBTR Hecker & Bolle, Is Geometric Hashing a Hough Transform 1989 LIBTR Hellerstein & Klein & Wilber, On the Time-Space Complexity of Reachability Queries for Preprocessed Graphs 1989 LIBTR Helman & Moret & Shapiro, An Exact Characterization of Greedy Structures 1989 LIBTR Herman, Probabilistic Self-Stabilization 1989 LIBTR Higham, Randomized Distributed Computing on Rings 1989 LIBTR Ishizaka, Learning Simple Deterministic Languages 1989 LIBTR Kaklamanis & Krizanc & Tsantilas, Tight Bounds for Oblivious Routing in the Hypercube 1989 LIBTR Kalantari, Derivation of a Generalized and Strengthened Gordan Theorem from Generalized Karmarkar Potenial and Logarithmic Barrier Functions 1989 LIBTR Karonski, The Evolution of Random Graphs 1989 LIBTR Kearns, The Computational Complexity of Machine Learning 1989 LIBTR Kirkpatrick & Przytycka, Parallel Construction of Binary Trees with Almost Optimal Weighted Path Length 1989 LIBTR Klawe, A Simple Linear Time Algorithm for Concave One-Dimensional Dynamic Programming 1989 LIBTR Klein & Stein, A Parallel Algorithm for Eliminating Cycles in Undirected Graphs 1989 LIBTR Kornerup & Matula, Lcf: A Lexicographic Binary Representation of the Rationals 1989 LIBTR Kushilevitz, Privacy and Communication Complexity 1989 LIBTR Lunt, Secure Distributed Data Views: Identification of Deficiencies and Directions for Future Research 1989 LIBTR Matula & Kucera, An Expose-and-Merge Algorithm and the Chromatic Number of a Random Graph 1989 LIBTR Megiddo & Papadimitriou, A Note on Total Functions, Existence Theorems, and Computational Complexity 1989 LIBTR Mihail & Vazirani, On the Magnification of 0-1 Polytopes 1989 LIBTR Moran & Woldstahl, Two-Page Book Embedding of Trees under Vertex-Neighborhood Constraints 1989 LIBTR Moran & Wolfstahl, One-Page Book Embedding under Vertex-Neighborhood Constraints 1989 LIBTR Morgenstern, Algorithms for General Graph Coloring 1989 LIBTR Motwani & Naor & Naor, The Probabilistic Method Yields Deterministic Parallel Algorithms 1989 LIBTR Naor, Bit Commitment Using Pseudo-randomness 1989 LIBTR Ng & Oommen, On Doubly Linked List Reorganizing Heuristics 1989 LIBTR O'Neil, Developing a Course in Cognitive Science 1989 LIBTR Palis & Shende, A Pumping Lemma Scheme for the Control Language Hierarchy 1989 LIBTR Pippenger, Exactly Solvable Telephone Switching Problems 1989 LIBTR Pippenger, The Asymptotic Optimality of Spider-web Networks 1989 LIBTR Pippenger, The Expected Capacity of Concentrators 1989 LIBTR Pitt, Inductive Inference, DFAs, and Computational Complexity 1989 LIBTR Poggio & Girosi, A Theory of Networks for Approximation and Learning 1989 LIBTR Reingold & Dershowitz, Calendrical Calculations 1989 LIBTR Rensink, A New Proof of the NP-Completeness of Visual Match 1989 LIBTR Roth & Benedek, Interpolation and Approximation of Light Boolean Functions 1989 LIBTR Roth & Lempel, Application of Circulant Matrices to the Construction and Decoding of Linear Codes 1989 LIBTR Saxberg, A Modern Differential Geometric Approach to Shape from Shading 1989 LIBTR Shen, Topics in Combinatorics and Algorithms 1989 LIBTR Soule & Gupta, Analysis of Parallelism and Deadlocks in Distributed-Time Logic Simulation 1989 LIBTR Tsantilas, A Refined Analysis of the Valiant-Brebner Algorithm 1989 LIBTR Tsay & Bagrodia, Some Impossibility Results in Interprocess Synchronization 1989 LIBTR Tuminaro, Multigrid Algorithms on Parallel Processing Systems 1989 LIBTR Uchida & Yoshida, The Fifth Generation Computer Technology and Biological Sequencing 1989 LIBTR Valiant, General Purpose Parallel Architectures 1989 LIBTR Venkateswaran, Two Natural Circuits for which Interpreted Pebbling Helps 1989 LIBTR Wolf & Dias & Yu, An Effective Algorithm for Parallelizing Sort Merge Joins in the Presence of Data Skew 1989 LIBTR Zhang, Parallel Algorithms for Combinatorial Search Problems 1988 LIBTR Ziavras & Davis, Fast Addition on the Fat Pyramid and its Simulation on the Connection Machine 1988 LIBTR Dillencourt, Graph-theoretical Properties of Algorithms Involving Delaunay Triangulations 1988 LIBTR Rosenfeld & Wu, ``Digital Geometry'' on Graphs 1988 LIBTR Ginat & Shankar, An Assertional Correctness Proof of a Distributed Mutual Exclusion Algorithm Based on Path Reversal 1988 LIBTR Rim & Nakajima, Complexity Results for Rectangle Intersection and Overlap Graphs 1988 LIBTR Sitaraman, The Ordered Matching Problem 1988 LIBTR Amir & Beigel & Gasarch, Cheatable, P-Terse, and P-Superterse Sets 1988 LIBTR Drescher, Demystifying Quantum Mechanics -- A Simple Universe with Quantum Uncertainty -- 1988 LIBTR Judd, Neural Network Design and the Complexity of Learning 1988 LIBTR Beigel & Gasarch, On the Complexity of Finding the Chromatic Number of a Recursive Graph II: The Unbounded Case 1988 LIBTR Kurtz, The Isomorphism Conjecture Fails Relative to a Generic Oracle 1988 LIBTR Dillencourt, Graph-theoretical Properties of Algorithms Involving Delaunay Triangulations 1988 LIBTR Rosenfeld & Wu, Digital Geometry on Graphs 1988 LIBTR Ziavras & Davis, Fast Addition on the Fat Pyramid and Its Simulation on the Connection Machine 1988 LIBTR Schmidt & Siegel, The Spatial Complexity of Oblivious k-Probe Hash Functions 1988 LIBTR Ben-Asher & Egozi & Schuster, SIMD Algorithms for 2-D Arrays in Shuffle Networks 1988 LIBTR Freudenthal & Peze, Efficient Synchronization Algorithms Using Fetch and Add on Multiple Bitfield Integers 1988 LIBTR New & Fisher, Concurrent Search and Insertion in Persistent Search Trees 1988 LIBTR Ginat & Shankar, An Assertional Correctness Proof of a Distributed Mutual Exclusion Algorithm based on Path Reversal 1988 LIBTR Rim & Nakajima, Complexity Results for Rectangle Intersection and Overlap Graphs 1988 LIBTR Al-Dhelaan & Bose, Incomplete Cube-connected Cycles Network 1988 LIBTR Langford, Genetic Algorithms as Function Optimizers 1988 LIBTR Kazerouni-zand & Fisher, A Space Efficient Persistent B-Tree 1988 LIBTR Mogul, The Experimental Literature of the Internet: An Annotated Bibliography 1988 LIBTR Lee, Communication Behavior of Linear Arrays of Processes 1988 LIBTR Makinen, On Implementing Two Adaptive Data-Compression Schemes 1988 LIBTR Makinen, Constructing a Binary Tree from its Traversals 1988 LIBTR Sanchis & Fulk, Efficient Language Instance Generation 1988 LIBTR Sakakibara, An Efficient Learning of Context-free Grammars for Bottom-Up Parsers 1988 LIBTR Katajainen & Makinen, A Note in the Complexity of Trie Compaction 1988 LIBTR Korach & Ostfeld, DFS Tree Construction: Algorithms and Characterizations 1988 LIBTR Korach & Ostfeld, Hamiltonian and Degree Restricted DFS Trees 1988 LIBTR Hendler & Israel, A Highly Parallel Implementation of a Marker Passing Algorithm 1988 LIBTR Lazzaro & Ryckebusch & Mahowald & Mead, Winner-Take-All Networks of O(N) Complexity 1988 LIBTR Judd, Neural Network Design and the Complexity of Learning 1988 LIBTR Lazzaro & Ryckebusch & Mahowald & Mead, Winner-Take-All Networks of O(N) Complexity 1988 LIBTR Judd, Neural Network Design and the Complexity of Learning 1988 LIBTR Pase, A Fast Algorithm for Near-optimal Static Scheduling of Acyclic Graphs to Multiprocessor Systems 1988 LIBTR Thornton, Information-theoretic Foundation for Inductive Generalisation 1988 LIBTR Ahuja & Zhu, A Distributed Algorithm for Minimum Weight Spanning Trees based on Echo Algorithms 1988 LIBTR Ahuja & Zhu, On the Communication Complexities in Two Distributed Depth First Search Algorithms 1988 LIBTR Ahuja & Zhu, A New Distributed Algorithm for Biconnected Component Detection in Asynchronous Networks 1988 LIBTR Rothstein, Entropy and the Evolution of Complexity and Individuality 1988 LIBTR Fellows & Langston, On Search, Decision and the Efficiency of Polynomial-time Algorithms 1988 LIBTR Abrahamson & Fellows & Langston & Moret, Constructive Complexity 1988 LIBTR Judd, Neural Network Design and the Complexity of Learning 1988 LIBTR Lazzaro & Ryckebusch & Mahowlad & Mead, Winner-Take-All Networks of O(N) Complexity 1988 LIBTR Porat & Feldman, Learning Automata from Ordered Examples 1988 LIBTR Ginat & Shankar, Correctness Proof and Amortization Analysis of a log N Distributed Mutual Exclusion Algorithm 1988 LIBTR Amir, Efficient String Matching with Scaling 1988 LIBTR Gasarch & Lockwood, The Existence of Matchings for Recursive and Highly Recursive Bipartite Graphs 1988 LIBTR Gasarch & Pearlman, The Complexity of Optimization Problems Related to Partition 1988 LIBTR Chang & Ja'Ja', Parallel Algorithms for Wiring Module Pins to Frame Pads 1988 LIBTR Beilner, Measuring with Slow Clocks 1988 LIBTR Cole, Algorithmic Skeletons: A Structures Approach to the Management of Parallel Computation 1988 LIBTR Parberry, A Primer on the Complexity Theory of Neural Networks (preliminary version) 1988 LIBTR Campbell & Carlsson & Dinneen & Faber & Fellows & Langston & Moore & Mullhaupt & Sexton, Dense Symmetric Networks from Linear Groups 1988 LIBTR Cross & Gupta, Distributed Point-Pattern Matching 1988 LIBTR Ritchie, The Design and Implementation of an Interactive Proof Editor 1988 LIBTR Sinclair, Randomised Algorithms for Counting and Generating Combinatorial Structures 1988 LIBTR Gonzalez, Formal Verification: A Survey of Techniques 1988 LIBTR Capocelli & Cerbone & Cull & Holloway, Fibonacci Facts and Formulas 1988 LIBTR Cull & Holloway, Computing Fibonacci Numbers Quickly 1988 LIBTR Choi & Lewis, Parallel Execution of the Simplex Algorithm 1988 LIBTR Kamin & Adams, Fast Fourier Transform Algorithm Design and Tradeoffs 1988 LIBTR Atallah & Hambrusch, Topological Numbering of Features on a Mesh 1988 LIBTR Apostolico & Atallah & Larmore & McFaddin, Efficient Parallel Algorithms for String Editing and Related Problems 1988 LIBTR Schreiber, Bidiagonalization and Symmetric Tridiagonalization by Systolic Arrays 1988 LIBTR Rogers, Kanerva's Sparse Distributed Memory: An Associative Memory Algorithm Well-suited to the Connection Machine 1988 LIBTR Denning, Massive Parallelism in the Future of Science 1988 LIBTR Tichy, Parallel Matrix Multiplication on the Connection Machine 1988 LIBTR Atallah & Goodrich, Output-sensitive Hidden Surface Elimination for Rectangles 1988 LIBTR Baghosian & Taylor & Rothman, A Cellular Automata Simulation of Two-Phase Flow on the CM-2 Connection Machine System 1988 LIBTR Baldwin, Multi Dimensional Trees 1988 LIBTR Hillis, Intelligence as an Emergent Behavior; or, the Songs of Eden 1988 LIBTR Kemp, Encryption in Electronic Funds Transfer Applications 1988 LIBTR Manson, Petri Net Theory: A Survey 1988 LIBTR Matula & Shahrokhi, Sparsest Cuts and Bottlenecks in Graphs 1988 LIBTR Sakakibara, Inference of Reversible Context-free Grammars 1988 LIBTR Sakakibara, Learning Context-free Grammars from Structural Data in Polynomial Time 1988 LIBTR Waltz, The Prospects for Building Truly Intelligent Machines 1987 LIBTR Cole & Zajicek, On Optimal Parallel Algorithm for Building a Data Structure for Planar Point Location 1987 LIBTR Lenstra & Lenstra, Algorithms in Number Theory 1987 LIBTR Chakravarty & Hunt, On the Generalized Probability Problem with Application to Testing and Reliability Analysis 1987 LIBTR Boxer & Miller, Parallel Dynamic Computational Geometry 1987 LIBTR Gasarch & Kamishlian, Embedding the Three Element Chain into the Turing Degrees: An Exposition 1987 LIBTR Atallah & Cole & Goodrich, Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms 1987 LIBTR Cole, Parallel Merge Sort 1987 LIBTR Frederickson & Srinivas, Algorithms and Data Structures for an Expanded Family of Matroid Intersection Problems 1987 LIBTR Loui, Theory and Computation of Uncertain Inference and Decision 1987 LIBTR Kyburg, Probabilistic Inference 1987 LIBTR Sher, A Probabilistic Approach to Low-level Vision 1987 LIBTR Watts, Calculating the Principal Views of a Polyhedron 1987 LIBTR Bent, Matching Multiple Patterns from Right to Left 1987 LIBTR Lindsay, Logical Frames for Interactive Theorem Proving 1987 LIBTR Jones & Moore, An Experimental User Interface for a Theorem Proving Assistant 1987 LIBTR Fisher & Barringer, Program Logics - A Short Survey 1987 LIBTR Suh & Van Gucht, Distributed Genetic Algorithms 1987 LIBTR Cha, Dynamic Load Balancing Algorithm Complexity 1987 LIBTR Lovstrand, Electronic Mail Addressing in Theory and Practice 1987 LIBTR Rothstein, Bus Automata for Intelligent Robots and Computer Vision 1987 LIBTR Rothstein, Bus Automata, Brains, and Mental Models 1987 LIBTR Flaig, VLSI Mesh Routing Systems 1987 LIBTR Amir, Multidimensional and Relative Approximate Pattern Matching 1987 LIBTR Parberry & Schnitger, Relating Boltzmann Machines to Conventional Models of Computation 1987 LIBTR Brown & Fellows & Langston, Polynomial-Time Self-Reducibility: Theoretical Motivations and Practical Results 1987 LIBTR Amir & Kaplan, Relocation Problems are Hard 1987 LIBTR Angluin & Gasarch, Training Sequences 1987 LIBTR de la Torre, Analysis of Tries 1987 LIBTR Ghosh & Mount, An Output Sensitive Algorithm for Computing Visibility Graphs 1987 LIBTR Huang & Davis, A Tight Upper Bound for the Speedup of Parallel Best-First Branch-and-Bound Algorithms 1987 LIBTR Hung, Hypercube Parallel Prefix Algorithms 1987 LIBTR Ja'Ja' & Kosaraju, Parallel Algorithms for Planar Graph Isomorphism and Related Problems 1987 LIBTR Ja'Ja' & Wu, On Routing Two-Terminal Nets in the Presence of Obstacles 1987 LIBTR Knott & Jou, A Program to Determine Whether Two Line Segments Intersect 1987 LIBTR Masuda & Nakajima & Kashiwabara & Fujisawa, Efficient Enumeration of Maximal and Maximium Independent Sets of an Interval Graph and a Circular-Arc Graph 1987 LIBTR Sitaraman & Rosenfeld, Probabilistic Analysis of Two Stage Matching 1987 LIBTR Wong & Fiebrich, Simulated Annealing-based Circuit Placement Algorithm on the Connection Machine System 1986 LIBTR Kruskal & Rudolph & Snir, Efficient Synchronization on Multiprocessors with Shared Memory 1986 LIBTR Kruskal & Snir, A Unified Theory of Interconnection Network Structure 1986 LIBTR Dally, On the Performance of k-ary n-Cube Interconnection Networks 1986 LIBTR Sanchis, Multiple-way Network Partitioning 1986 LIBTR Newman-Wolfe, Observations on Multi-peg Towers of Hanoi 1986 LIBTR Zadeh, Outline of a Theory of Usuality based on Fuzzy Logic 1986 LIBTR Yokoyama & Takeshima, Factorization of Uni-variate Polynomials over Finite Fields 1986 LIBTR Char & Geddes & Gonnet, GCSHEU: Heuristic Polynomial GCD Algorithm based on Integer GCD Computation 1986 LIBTR Doberkat, An Upper Bound for the Expected Complexity of Finding All Zeros of a Continuous Function by Brute Force 1986 LIBTR Aaby & Narayana, Equivalence of Temporal Interval Logic and Temporal Logic 1986 LIBTR Hamburger & Haugeland, Artificial Intelligence: The Very Idea 1986 LIBTR Berkey, Two-dimensional Bin Packing Algorithms 1986 LIBTR Blelloch, Parallel Prefix vs. Concurrent Memory Access 1986 LIBTR Casotto & Sangiovanni-Vincentelli, Placement of Standard Cells Using Simulated Annealing on the Connection Machine 1986 LIBTR Hillis, New Computer Architectures: A Survey 1986 LIBTR Levcopoulos, Heuristics for Minimum Decompositions of Polygons 1986 LIBTR Levcopoulos, New Results about the Approximation Behavior of the Greedy Triangulation 1986 LIBTR Webber, Circuit Simulation on the Connection Machine 1986 LIBTR Yokomori, Inductive Inference of Context-free Languages - Context-free Expression Method 1985 LIBTR Mostow, Foreword: What is AI? And What Does It Have To Do with Software Engineering? 1985 LIBTR Dally & Seitz, The Balanced Cube: A Concurrent Data Structure 1985 LIBTR Ellis, Distributed Data Structures: A Case Study 1985 LIBTR Feldman, Energy and the Behavior of Connectionist Models 1985 LIBTR Newman-Wolfe, A Set Theoretic Problem: A Solution for the Hypercube and its Applications 1985 LIBTR Feldman & Ballard & Brown & Dell, Rochester Connectionist Papers: 1979-1985 1985 LIBTR Fanty, Context-free Parsing in Connectionist Networks 1985 LIBTR Halpern & Moses, A Guide to the Modal Logics of Knowledge and Belief: Preliminary Draft 1985 LIBTR Hester & Hirschberg, Self-Organizing Lists Using Probabilistic Back-pointers 1985 LIBTR Razouk & Hirschberg, Tools for Efficient Analysis of Concurrent Software Systems 1985 LIBTR Hirschberg & Larmore, The Set LCS Problem 1985 LIBTR Parberry, Recurrent and Recursive Interconnection Patterns 1985 LIBTR Paturi & Simon, Probabilistic Communication Complexity 1985 LIBTR Denning, The Science of Computing -- 1985 1985 LIBTR Beigel & Gasarch & Owings, Nondeterministic Bounded Query Reductibilities 1985 LIBTR Hirschberg & Larmore, The Least Weight Subsequence Problem 1985 LIBTR Salem & Wolfram, Thermodynamics and Hydrodynamics with Cellular Automata 1985 LIBTR Seki & Takeuchi, An Algorithm for Finding a Query which Descriminates Competing Hypotheses 1984 LIBTR Ihebuzor, A Catalogue of Seven Vertex Graphs 1984 LIBTR Abraham & Gottlieb & Kruskal, Simulating Shared-Memory Parallel Computers 1984 LIBTR Su, Supermesh 1984 LIBTR Koch & Poggio, Biophysics of Computation: Neurons, Synapses and Membranes 1984 LIBTR Konolige, Belief and Incompleteness 1983 LIBTR Yasuura, On the Parallel Computational Complexity of Unification 1983 LIBTR Gottlieb & Lubachevsky & Rudolph, Basic Techniques for the Efficient Coordination of Very Large Numbers of Cooperating Sequential Processors 1983 LIBTR Kalos, The NYU Ultracomputer 1983 LIBTR Paul & Vishkin & Wagener, Parallel Computation on 2-3 Trees 1983 LIBTR Gottlieb, Comparing the NYU Ultracomputer with Other Large-scale Parallel Processors 1983 LIBTR Robinson, Logic Programming - Past, Present and Future - 1982 LIBTR Rosenfeld, Diameter-Time Cellular Warping 1982 LIBTR Tevanian, A Structure Independent Method for Saving and Restoring Dynamically Allocated Data 1982 LIBTR Prosser & Kilgour, A Fast Integer Square Root Algorithm 1981 LIBTR Gottlieb, An Historical Guide to the Ultracomputer Literature 1981 LIBTR Gottlieb & Kruskal, Coordinating Parallel Processors: A Partial Unification 1981 LIBTR Tarnlund, A Programming Language based on a Natural Deduction System 1981 LIBTR Minsky, Nature Abhors an Empty Vacuum 1980 LIBTR Browning, The Tree Machine: A Highly Concurrent Computing Environment 1979 LIBTR Meertens, Bitonic Sort on Ultracomputers 1978 LIBTR Stanford University, Bibliography of Stanford Computer Science Reports 1963-1978 1974 LIBTR Hinds, A Design for the Buddy System with Arbitrary Sequences of Block Sizes 1996 11 LICS Medina & Immerman, A Generalization of Fagin's Theorem 1996 11 LICS Marcinkowski, DATALOG SIRUPs Uniform Boundedness is Undecidable 1996 11 LICS Benedikt & Libkin, On the Structure of Queries in Constraint Query Languages 1996 11 LICS Stark, A Fully Abstract Domain Model for the pi-Calculus 1996 11 LICS Fiore & Moggi & Sangiorgi, A Fully-Abstract Model for the pi-Calculus 1996 11 LICS Cattani & Sassone, Higher Dimensional Transaction Systems 1996 11 LICS Natarajan & Cleaveland, An Algebraic Theory of Process Efficiency 1996 11 LICS Tiuryn & Urzyczyn, The Subtyping Problem for Second-Order Types is Undecidable 1996 11 LICS Aspinall & Compagnoni, Subtyping Dependent Types 1996 11 LICS Altenkirch & Hofmann & Streicher, Reduction-Free Normalisation for a Polymorphic System 1996 11 LICS Etessami & Wilke, An Until Hierarchy for Temporal Logic 1996 11 LICS Ramanujam, Locally Linear Time Temporal Logic 1996 11 LICS Seidl, A Modal mu-Calculus for Durational Transition Systems 1996 11 LICS McAllester & Givan & Kozen & Witty, Tarskian Set Constraints 1996 11 LICS Huet, Design of a Proof Assistant 1996 11 LICS Pitts, Reasoning about Local Variables with Operationally-Based Logical Relations 1996 11 LICS Brookes, The Essence of Parallel Algol 1996 11 LICS McCusker, Games and Full Abstraction for FPC 1996 11 LICS Davies, A Temporal-Logic Approach to Binding-Time Analysis 1996 11 LICS Godefroid & Long, Symbolic Protocol Verification with Queue BDDs 1996 11 LICS Alur & Henzinger, Reactive Modules 1996 11 LICS Alur & McMillan & Peled, Model-checking of Correctness Conditions for Concurrent Objects 1996 11 LICS Ong, A Semantic View of Classical Proofs: Type-Theoretic, Categorical, and Denotational Characterizations 1996 11 LICS Abadi & Fiore, Syntactic Considerations on Recursive Types 1996 11 LICS Hillebrand & Kanellakis, On the Expressive Power of Simply Typed and Let-Polymorphic Lambda Calculi 1996 11 LICS Cervesato & Pfenning, A Linear Logical Framework 1996 11 LICS Henzinger, The Theory of Hybrid Automata 1996 11 LICS Willems & Wolper, Partial-Order Methods for Model Checking: From Linear Time to Branching Time 1996 11 LICS Bhat & Cleaveland, Efficient Model Checking via the Equational mu-Calculus 1996 11 LICS Abdulla & Cerans & Jonsson & Tsay, General Decidability Theorems for Infinite-State Systems 1996 11 LICS Kupferman & Safra & Vardi, Relating Word and Tree Automata 1996 11 LICS Hirst & Harel, More about Recursive Structures: Descriptive Complexity and Zero-One Laws 1996 11 LICS Kolaitis & Vardi, On the Expressive Power of Variable-Confined Logics 1996 11 LICS McColm, Zero-One Laws for Gilbert Random Graphs 1996 11 LICS Edalat, The Scott Topology Induces the Weak Topology 1996 11 LICS Edalat & Escardo, Integration in Real PCF 1996 11 LICS Danos & Herbelin & Regnier, Game Semantics and Abstract Machines 1996 11 LICS Pradhan, Semantics of Normal Logic Programs and Contested Information 1996 11 LICS Joyal, Lattices, Categories and Communication 1996 11 LICS Benton & Wadler, Linear Logic, Monads and the Lambda Calculus 1996 11 LICS Selinger, Order-Incompleteness and Finite Lambda Models 1996 11 LICS Munoz, Confluence and Preservation of Strong Normalisation in an Explicit Substitutions Calculus 1996 11 LICS Bethke & Klop & de Vrijer, Completing Partial Combinatory Algebras with Unique Head-Normal Forms 1996 11 LICS Basin & Ganzinger, Complexity Analysis Based on Ordered Resolution 1996 11 LICS Narendran, Solving Linear Equations over Polynomial Semirings 1996 11 LICS Nieuwenhuis, Basic Paramodulation and Decidable Theories 1996 11 LICS Nurmonen, Counting Modulo Quantifiers on Finite Linearly Ordered Trees 1996 11 LICS Degtyarev & Matiyasevich & Voronkov, Simultaneous Rigid E-Unification and Related Algorithmic Problems 1996 11 LICS Degtyarev & Voronkov, Decidability Problems for the Prenex Fragment of Intuitionistic Logic 1996 11 LICS Marek & Nerode & Remmel, On the Complexity of Abduction 1996 11 LICS Matiyasevich & Senizergues, Decision Problems for Semi-Thue Systems with a Few Rules 1996 11 LICS Milner, Calculi for Interactions 1995 10 LICS Kesten & Pnueli, A Complete Proof System for QPTL 1995 10 LICS Walukiewicz, Completeness of Kozen's Axiomatisation of the Propositional mu-Calculus 1995 10 LICS Kupferman & Pnueli, Once and For All 1995 10 LICS Dutertre, Complete Proof Systems for First Order Interval Temporal Logic 1995 10 LICS Lynch & Tyszkiewicz, The Infinitary Logic of Sparse Random Graphs 1995 10 LICS Dawar & Gradel, Generalized Quantifiers and 0-1 Laws 1995 10 LICS Gottlob, Relativized Logspace and Generalized Quantifiers over Finite Structures 1995 10 LICS Paredaens & Van den Bussche & Van Gucht, First-Order Queries on Finite Structures Over the Reals 1995 10 LICS Alur & Peled & Penczek, Model-Checking of Causality Properties 1995 10 LICS Vardi, On the Complexity of Modular Model Checking 1995 10 LICS Wang, Timing Behavior Analysis for Real-Time Systems 1995 10 LICS Bouajjani & Echahed & Habermehl, On the Verification Problem of Nonregular Properties for Nonregular Processes 1995 10 LICS Gordon, The Semantics Challenge of Verilog HDL 1995 10 LICS Nadathur & Loveland, Uniform Proofs and Disjunctive Logic Programming 1995 10 LICS Pfenning, Structural Cut Elimination 1995 10 LICS Lynch, Paramodulation without Duplication 1995 10 LICS Marek & Nerode & Remmel, Complexity of Normal Default Logic and Related Modes of Nonmonotonic Reasoning 1995 10 LICS Mifsud & Milner & Power, Control Structures 1995 10 LICS van Glabbeek & Plotkin, Configuration Structures 1995 10 LICS Gay & Nagarajan, A Typed Calculus of Synchronous Processes 1995 10 LICS Miculan & Gadducci, Modal mu-Types for Processes 1995 10 LICS Abramsky & McCusker, Games and Full Abstraction for the Lazy lambda-Calculus 1995 10 LICS Edalat, Domain Theory in Stochastic Processes 1995 10 LICS Jeffrey, A Fully Abstract Semantics for a Concurrent Functional Language with Monadic Types 1995 10 LICS Constable, Experience Using Type Theory as a Foundation for Computer Science 1995 10 LICS Dougherty & Subrahmanyam, Equality Between Functionals in the Presence of Coproducts 1995 10 LICS Longo & Milsted & Soloviev, A Logic of Subtyping 1995 10 LICS Piperno, Normalization and Extensionality 1995 10 LICS Kfoury & Wells, New Notions of Reduction and Non-Semantic Proofs of Strong beta-Normalization in Typed lambda-Calculi 1995 10 LICS Stolboushkin, Finitely Monotone Properties 1995 10 LICS Etessami & Immerman, Tree Canonization and Transitive Closure 1995 10 LICS Otto, PTime Canonization for Two Variables with Counting 1995 10 LICS Seth, When Do Fixed Point Logics Capture Complexity Classes? 1995 10 LICS Dowek & Hardin & Kirchner, Higher-Order Unification via Explicit Substitutions 1995 10 LICS Comon, Sequentiality, Second Order Monadic Logic and Tree Automata 1995 10 LICS Comon & Nieuwenhuis & Rubio, Orderings, AC-Theories and Symbolic Constraint Solving 1995 10 LICS Bhat & Cleaveland & Grumberg, Efficient On-the-Fly Model Checking for CTL 1995 10 LICS Andersen, Partial Model Checking 1995 10 LICS Tronci, Hardware Verification, Boolean Logic Programming, Boolean Functional Programming 1995 10 LICS Simpson, Compositionality via Cut-Elimination: Hennessy-Milner Logic for an Arbitrary GSOS 1995 10 LICS Jonsson & Yi, Compositional Testing Preorders for Probabilistic Processes 1995 10 LICS Pratt, The Stone Gamut: A Coordinatization of Mathematics 1995 10 LICS Palmgren & Stoltenberg-Hansen, Logically Presented Domains 1995 10 LICS Lamarche, Games Semantics for Full Propositional Linear Logic 1995 10 LICS Lincoln & Scedrov & Shankar, Decision Problems for Second-Order Linear Logic 1995 10 LICS Kanovich, The Complexity of Neutrals in Linear Logic 1995 10 LICS Kopylov, Decidability of Linear Affine Logic 1995 10 LICS Trakhtenbrot, Origins and Metamorphoses of the Trinity: Logic, Nets, Automata 1994 9 LICS Burstall, Terms, Proofs, and Refinement 1994 9 LICS Gurevich & Immerman & Shelah, McColm's Conjecture 1994 9 LICS Dawar & Hella, The Expressive Power of Finitely Many Generalized Quantifiers 1994 9 LICS Otto, Generalized Quantifiers for Simple Properties 1994 9 LICS Hella & Kolaitis & Luosto, How to Define a Linear Order on Finite Models 1994 9 LICS Alur & Henzinger, Finitary Fairness 1994 9 LICS Sewell, Bisimulation is Not Finitely (First Order) Equationally Axiomatisable 1994 9 LICS Saraswat & Jagadeesan & Gupta, Foundations of Timed Concurrent Constraint Programming 1994 9 LICS Jeffrey, A Fully Abstract Semantics for Concurrent Graph Reduction 1994 9 LICS Fiore & Plotkin, An Axiomatization of Computationally Adequate Domain Theoretic Models of FPC 1994 9 LICS Colson & Ehrhard, On Strong Stability and Higher-Order Sequentiality 1994 9 LICS Huth & Jung & Keimel, Linear Types, Approximation, and Topology 1994 9 LICS Edalat, Domain Theory and Integration 1994 9 LICS Charatonik & Pacholski, Negative Set Constraints with Equality 1994 9 LICS Stefansson, Systems of Set Constraints with Negative Constraints are NEXPTIME-Complete 1994 9 LICS Andersen & Stirling & Winskel, A Compositional Proof System for the Modal mu-Calculus 1994 9 LICS Zhang & Sokolsky & Smolka, On the Parallel Complexity of Model Checking in the Modal Mu-Calculus 1994 9 LICS Hemaspaandra, Complexity Transfer for Modal Logic 1994 9 LICS Wells, Typability and Type-Checking in the Second-Order lambda-Calculus are Equivalent and Undecidable 1994 9 LICS Palsberg, Efficient Inference of Object Types 1994 9 LICS Piperno & Ronchi della Rocca, Type Inference and Extensionality 1994 9 LICS Hofmann & Streicher, The Groupoid Model Refutes Uniqueness of Identity Proofs 1994 9 LICS Baas & Fermuller & Leitsch, A Non-Elementary Speed-Up in Proof Length by Structural Clause Form Transformation 1994 9 LICS Impagliazzo & Pitassi & Urquhart, Upper and Lower Bounds for Tree-Like Cutting Planes Proofs 1994 9 LICS Abiteboul & Papadimitriou & Vianu, The Power of Reflective Relational Machines 1994 9 LICS Medina & Immerman, A Syntactic Characterization of NP-Completeness 1994 9 LICS Stark, The Declarative Semantics of the Prolog Selection Rule 1994 9 LICS Brogi & Turini, Semantics of Meta-Logic in an Algebra of Programs 1994 9 LICS Miller, A Multiple-Conclusion Meta-Logic 1994 9 LICS Lincoln & Shankar, Proof Search in First-Order Linear Logic and Other Cut-Free Sequent Calculi 1994 9 LICS Loader, Linear Logic, Totality and Full Completeness 1994 9 LICS Urzyczyn, The Emptiness Problem for Intersection Types 1994 9 LICS Plotkin & Abadi & Cardelli, Subtyping and Parametricity 1994 9 LICS Geuvers & Werner, On the Church-Rosser Property for Expressive Type Systems and Its Consequences for Their Metatheoretic Study 1994 9 LICS Abadi & Cardelli, A Semantics of Object Types 1994 9 LICS Reddy, Passivity and Independence 1994 9 LICS Moggi, A General Semantics for Evaluation Logic 1994 9 LICS Robinson & Rosolini, Reflexive Graphs and Parametric Polymorphism 1994 9 LICS Brown & Hutton, Categories, Allegories, and Circuit Design 1994 9 LICS Bachmai & Ganzinger, Rewrite Techniques for Transitive Relations 1994 9 LICS Marche, Normalised Rewriting and Normalised Completion 1994 9 LICS Barbanera & Fernandez & Geuvers, Modularity of Strong Normalization and Confluence in the Algebraic lambda-Cube 1994 9 LICS Ariola & Klop, Cyclic Lambda Graph Rewriting 1994 9 LICS Asperti & Danos & Laneve & Regnier, Paths in the Lambda-Calculus 1994 9 LICS Thiagarajan, A Trace Based Extension of Linear Time Temporal Logic 1994 9 LICS van der Meyden, Axioms for Knowledge and Time in Distributed Systems with Perfect Recall 1994 9 LICS Chang & Manna & Pnueli, Compositional Verification of Real-Time Systems 1994 9 LICS Arieli & Avron, Logical Bilattices and Inconsistent Data 1994 9 LICS Ben-David & Ben-Eliyahu, A Modal Logic for Subjective Default Reasoning 1994 9 LICS Pentus, Language Completeness of the Lambek Calculus 1994 9 LICS Goubault, Rigid E-Unifiability is DEXPTIME-Complete 1994 9 LICS Prehofer, Higher-Order Narrowing 1993 8 LICS Longo & Milsted & Soloviev, The Genericity Theorem and the Notion of Parametricity in the Polymorphic lambda-Calculus 1993 8 LICS Hoang & Mitchell & Viswanathan, Standard ML-NJ Weak Polymorphism and Imperative Constructs 1993 8 LICS Mitchell & Honsell & Fisher, A Lambda Calculus of Objects and Method Specialization 1993 8 LICS Parigot, Strong Normalization for Second Order Classical Natural Deduction 1993 8 LICS Chou & Gao & Zhang, Automated Production of Traditional Proofs for Constructive Geometry Theorems 1993 8 LICS Narendran & Pfenning & Statman, On the Unification Problem for Cartesian Closed Categories 1993 8 LICS Nipkow, Functional Unification of Higher Order Patterns 1993 8 LICS Bachmair & Ganzinger & Waldmann, Set Constraints Are the Monadic Class 1993 8 LICS Pitts, Relational Properties of Recursively Defined Domains 1993 8 LICS Brookes, Full Abstraction for a Shared Variable Parallel Language 1993 8 LICS Fiore, A Coinduction Principle for Recursive Data Types Based on Bisimulation 1993 8 LICS Pnueli & Zuck, In and Out of Temporal Logic 1993 8 LICS Walukiewicz, On Completeness of the mu-Calculus 1993 8 LICS Bouajjani & Echahed & Sifakis, On Model Checking for Real-Time Properties with Durations 1993 8 LICS Abdulla & Jonsson, Verifying Programs with Unreliable Channels 1993 8 LICS Niwinski & Stolboushkin, y = 2x vs. y = 3x 1993 8 LICS Courcelle, Monadic Second-Order Logic and Hypergraph Orientation 1993 8 LICS Lynch, Infinitary Logics and Very Sparse Random Graphs 1993 8 LICS Fayolle & Grumbach & Tollu, Asymptotic Probabilities of Languages with Generalized Quantifiers 1993 8 LICS Falaschi & Gabbrielli & Marriott & Palamidessi, Compositional Analysis for Concurrent Constraint Programming 1993 8 LICS Schroeder-Heister, Rules of Definitional Reflection 1993 8 LICS Felty, Encoding the Calculus of Constructions in a Higher Order Logic 1993 8 LICS Lambek, Programs, Grammars, and Arguments: A Personal View of Some Connections between Computation, Language, and Logic 1993 8 LICS Barwise & Seligman, Imperfect Information Flow 1993 8 LICS Breazu-Tannen & Kesner & Puel, A Typed Pattern Calculus 1993 8 LICS Ong, Non-Determinism in a Functional Setting 1993 8 LICS Phoa, Adequacy for Untyped Translations of Typed lambda-Calculi 1993 8 LICS Danos & Regnier, Local and Asynchronous Beta-Reduction 1993 8 LICS Beame & Pitassi, An Exponential Separation between the Matching Principle and the Pigeonhole Principle 1993 8 LICS Seth, Some Desirable Conditions for Feasible Functionals of Type 2 1993 8 LICS Hillebrand & Kanellakis & Mairson, Database Query Languages Embedded in the Typed Lambda Calculus 1993 8 LICS Lakshmanan & Ashraf & Han, Homomorphic Tree Embeddings and Their Applications to Recursive Program Optimization 1993 8 LICS Martin & Scott, The Order Types of Termination Orderings on Terms, Strings, and Multisets 1993 8 LICS Narendran & Rusinowitch, The Unifiability Problem in Ground AC Theories 1993 8 LICS Pentus, Lambek Grammars are Context Free 1993 8 LICS Pierce & Sangiorgi, Typing and Subtyping for Mobile Processes 1993 8 LICS Christensen & Hirshfeld & Moller, Decomposability, Decidability, and Axiomatisability for Bisimulation Equivalence on Basic Parallel Processes 1993 8 LICS Hennessy, A Fully Abstract Denotational Model for Higher Order Processes 1993 8 LICS Jategaonkar & Meyer, Self-Synchronization of Concurrent Processes 1993 8 LICS Joyal & Nielsen & Winskel, Bisimulation and Open Maps 1992 7 LICS Dowek, Third Order Matching is Decidable 1992 7 LICS Kapur & Narendran, Double-Exponential Complexity of Computing a Complete Set of AC-Unifiers 1992 7 LICS Grove & Halpern & Koller, Random Worlds and Maximum Entropy 1992 7 LICS Schwarz, Minimal Model Semantics for Nonmonotonic Modal Logics 1992 7 LICS Kolaitis & Vardi, Fixpoint Logic vs. Infinitary Logic in Finite-Model Theory 1992 7 LICS Graedel & McColm, Deterministic versus Nondeterministic Transitive Closure Logic 1992 7 LICS Stolboushkin, Axiomatizable Classes of Finite Models and Definability of Linear Order 1992 7 LICS Gonthier & Levy & Mellies, An Abstract Standardisation Theorem 1992 7 LICS Nakano, A Constructive Formalization of the Catch and Throw Mechanism 1992 7 LICS Murthy, A Computational Analysis of Girard's Translation and LC 1992 7 LICS Sangiorgi, The Lazy Lambda Calculus in a Concurrency Scenario 1992 7 LICS Wing, Specifications in Software Development 1992 7 LICS Aceto & Bloom & Vaandrager, Turning SOS Rules into Equations 1992 7 LICS Stark, A Calculus of Dataflow Networks 1992 7 LICS de Boer & Klop & Palamidessi, Asynchronous Communication in Process Algebra 1992 7 LICS Ulidowski, Equivalences on Observable Processes 1992 7 LICS Talpin & Jouvelot, The Type and Effect Discipline 1992 7 LICS Jensen, Abstract Interpretation and Disjunctive Strictness Analysis 1992 7 LICS Mason & Talcott, References, Local Variables and Operations 1992 7 LICS Kanovich, Horn Programming in Linear Logic is NP-Complete 1992 7 LICS Abramsky & Jagadeesan, New Foundations for the Geometry of Interaction 1992 7 LICS Gonthier & Abadi & Levy, Linear Logic without Boxes 1992 7 LICS Lincoln & Mitchell, Operational Aspects of Linear Lambda Calculus 1992 7 LICS Pratt, Origins of the Calculus of Binary Relations 1992 7 LICS Comon & Haberstrau & Jouannaud, Decidable Problems in Shallow Equational Theories 1992 7 LICS Caucal, Monadic Theory of Term Rewritings 1992 7 LICS Toyama, Strong Sequentiality of Left-Linear Overlapping Term Rewriting Systems 1992 7 LICS Seth, There is No Recursive Axiomatization for Feasible Functionals of Type 2 1992 7 LICS Clote, Cutting Planes and Constant Depth Frege Proofs 1992 7 LICS Tiuryn, Subtype Inequalities 1992 7 LICS Heintze & Jaffar, An Engine for Logic Program Analysis 1992 7 LICS Aiken & Wimmers, Solving Systems of Set Constraints 1992 7 LICS Saraswat, The Category of Constraint Systems is Cartesian-Closed 1992 7 LICS Kolaitis & Vaananen, Generalized Quantifiers and Pebble Games on Finite Structures 1992 7 LICS Hella, Logical Hierarchies in PTIME 1992 7 LICS Halpern & Kapron, Zero-One Laws for Modal Logic 1992 7 LICS Klarlund, Progress Measures, Immediate Determinacy, and a Subset Construction for Tree Automata 1992 7 LICS Henzinger & Nicollin & Sifakis & Yovine, Symbolic Model Checking for Real-Time Systems 1992 7 LICS Pfenning & Hannan, Compiler Verification in LF 1992 7 LICS Fribourg, Mixing List Recursion and Integer Ordering 1992 7 LICS Curien, Observable Sequential Algorithms on Concrete Data Structures 1992 7 LICS Freyd & Robinson & Rosolini, Functorial Parametricity 1992 7 LICS Geuvers, The Church-Rosser Property for beta eta-Reduction in Typed lambda-Calculi 1992 7 LICS de'Liguoro & Piperno & Statman, Retracts in Simply Typed lambda beta eta-Calculus 1991 6 LICS Leivant, A Foundational Delineation of Computational Feasibility 1991 6 LICS Alessi & Barbanera, Toward a Semantics for the QUEST Language 1991 6 LICS Aczel, Term Declaration Logic and Generalised Composita 1991 6 LICS Hodas & Miller, Logic Programming in a Fragment of Intuitionistic Linear Logic 1991 6 LICS Lafont & Streicher, Games Semantics for Linear Logic 1991 6 LICS Lincoln & Scedrov & Shankar, Linearizing Intuitionistic Implication 1991 6 LICS Malacaria & Regnier, Some Results on the Interpretation of lambda-Calculus in Operator Algebras 1991 6 LICS Pfenning, Unification and Anti-Unification in the Calculus of Constructions 1991 6 LICS Audebaud, Partial Objects in the Calculus of Constructions 1991 6 LICS Murthy, An Evaluation Semantics for Classical Proofs 1991 6 LICS Cleaveland & Zwarico, A Theory of Testing for Real-Time 1991 6 LICS Hungar, Complexity Bounds of Hoare-style Proof Systems 1991 6 LICS Hung & Zucker, Semantics of Pointers, Referencing and Dereferencing with Intensional Logic 1991 6 LICS Bucciarelli & Ehrard, Sequentiality and Strong Stability 1991 6 LICS Stoughton, Parallel PCF has a Unique Extensional Model 1991 6 LICS Taylor, The Fixed Point Property in Synthetic Domain Theory 1991 6 LICS Howe, On Computational Open-Endedness in Martin-Lof's Type Theory 1991 6 LICS Mendler, Predicative Type Universes and Primitive Recursion 1991 6 LICS Statman, Freyd's Hierarchy of Combinator Monoids 1991 6 LICS Tronci, Equational Programming in lambda-Calculus 1991 6 LICS Berger & Schwichtenberg, An Inverse of the Evaluation Functional for Typed lambda-Calculus 1991 6 LICS Kozen, A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events 1991 6 LICS Avron & Hirshfeld, On First Order Database Query Languages 1991 6 LICS Peled & Katz & Pnueli, Specifying and Proving Serializability in Temporal Logic 1991 6 LICS Camilleri & Winskel, CCS with Priority Choice 1991 6 LICS Klarlund & Kozen, Rabin Measures and Their Applications to Fairness and Automata Theory 1991 6 LICS Jonsson & Larsen, Specification and Refinement of Probabilistic Processes 1991 6 LICS Pacholski & Szwast, On the 0-1 Law for the Class of Existential Second Order Minimal Goedel Sentences with Equality 1991 6 LICS Bonet & Buss, On the Deduction Rule and the Number of Proof Lines 1991 6 LICS Fruhwirth & Shapiro & Vardi & Yardeni, Logic Programs as Types for Logic Programs 1991 6 LICS Kifer & Wu, A First-Order Theory of Types and Polymorphism in Logic Programming 1991 6 LICS Cortesi & File & Winsborough, Prop Revisited: Propositional Formulas as Abstract Domain for Groundness Analysis 1991 6 LICS Stuckey, Constructive Negation for Constraint Logic Programming 1991 6 LICS Nipkow, Higher-Order Critical Pairs 1991 6 LICS Jouannaud & Okada, A Computation Model for Executable Higher-Order Algebraic Specification Languages 1991 6 LICS Ryan, Defaults and Revision in Structured Theories 1991 6 LICS Huttel & Stirling, Actions Speak Louder than Words: Proving Bisimilarity for Context-Free Processes 1991 6 LICS Vaandrager, On the Relationship between Process Algebra and Input/Output Automata 1991 6 LICS de Boer, A Compositional Proof System for Dynamic Process Creation 1991 6 LICS Godefroid & Wolper, A Partial Approach to Model Checking 1990 5 LICS Kfoury & Tiuryn, Type Reconstruction in Finite-Rank Fragments of the Polymorphic lambda-Calculus 1990 5 LICS Robinson & Rosolini, Polymorphism, Set Theory, and Call-by-Value 1990 5 LICS Droste & Goebel, Universal Domains in the Theory of Denotational Semantics of Programming Languages 1990 5 LICS Jung, The Classification of Continuous Domains 1990 5 LICS Heintze & Jaffar, A Decision Procedure for a Class of Set Constraints 1990 5 LICS Lassez & McAloon, A Constraint Sequent Calculus 1990 5 LICS Comon, Solving Inequations in Term Algebras 1990 5 LICS van der Meyden, The Dynamic Logic of Permission 1990 5 LICS Marek & Nerode & Remmel, A Theory of Nonmonotonic Rule systems 1990 5 LICS Allen & Constable & Howe & Aitken, The Semantics of Reflected Proof 1990 5 LICS Larsen & Xinxin, Equation Solving Using Modal Transition Systems 1990 5 LICS De Nicola & Vaandrager, Three Logics for Branching Bisimulation 1990 5 LICS van Glabbeek & Smolka & Steffen & Tofts, Reactive, Generative, and Stratified Models of Probabilistic Processes 1990 5 LICS Moller, The Nonexistence of Finite Axiomatisations for CCS Congruences 1990 5 LICS Kolaitis & Vardi, 0-1 Laws for Infinitary Logics 1990 5 LICS Kolaitis, Implicit Definability on Finite Structures and Unambiguous Computations 1990 5 LICS Clote, ALOGTIME and a Conjecture of S. A. Cook 1990 5 LICS Courcelle, On the Expression of Monadic Second-Order Graph Properties Without Quantifications over Sets of Edges 1990 5 LICS Gehlot & Gunter, Normal Process Representatives 1990 5 LICS Brown & Gurr, A Categorial Linear Framework for Petri Nets 1990 5 LICS Cerrito, A Linear Semantics for Allowed Logic Programs 1990 5 LICS Sekar & Ramakrishnan, Programming in Equational Logic: Beyond Strong Sequentiality 1990 5 LICS Dauchet & Tison, The Theory of Ground Rewrite Systems is Decidable 1990 5 LICS Lescanne, Well Rewrite Orderings 1990 5 LICS Murthy & Russell, A Constructive Proof of Higman's Lemma 1990 5 LICS Kirchner & Klay, Syntactic Theories and Unification 1990 5 LICS Nipkow, Proof Transformations for Equational Theories 1990 5 LICS Boudet & Constejean & Devie, A New AC Unification Algorithm with an Algorithm for Solving Systems of Diophantine Equations 1990 5 LICS Dorre & Rounds, On Subsumption and Semiunification in Feature Algebras 1990 5 LICS Cosmadakis & Meyer, Completeness for Typed Lazy Inequalities 1990 5 LICS Wand & Wang, Conditional Lambda-Theories and the Verification of Static Properties of Programs 1990 5 LICS Guzman & Hudak, Single-Threaded Polymorphic Lambda Calculus 1990 5 LICS Freyd & Mulry & Rosolini & Scott, Extensional PERs 1990 5 LICS Abadi & Plotkin, A PER Model of Polymorphism and Recursive Types 1990 5 LICS Phoa, Effective Domains and Intrinsic Structure 1990 5 LICS Lewis, A Logic of Concrete Time Intervals 1990 5 LICS Alur & Henzinger, Real-Time Logics: Complexity and Expressiveness 1990 5 LICS Harel & Lichtenstein & Pnueli, Explicit Clock Temporal Logic 1990 5 LICS Alur & Courcoubetis & Dill, Model-Checking for Real-Time Systems 1990 5 LICS Burch & Clarke & McMillan & Dill & Hwang, Symbolic Model Checking: 10^20 States and Beyond 1990 5 LICS Cleaveland & Steffen, When Is ``Partial'' Adequate? A Logic-Based Proof Technique Using Partial Specifications 1990 5 LICS Goldman & Lynch, Modelling Shared State in a Shared Action Model 1990 5 LICS Emerson & Evangelist & Srinivasan, On the Limits of Efficient Temporal Decidability 1990 5 LICS Harel & Rosner & Vardi, On the Power of Bounded Concurrency III: Reasoning about Programs 1990 5 LICS Crole & Pitts, New Foundations for Fixpoint Computations 1990 5 LICS Freyd, Recursive Types Reduced to Inductive Types 1989 4 LICS Scott, Domains and Logics (extended abstract) 1989 4 LICS Pitts, Non-trivial Power Types Can't Be Subtypes of Polymorphic Types 1989 4 LICS Moggi, Computational Lambda-Calculus and Monads 1989 4 LICS Cosmadakis, Computing with Recursive Types 1989 4 LICS Leivant, Stratified Polymorphism 1989 4 LICS Gaifman & Shapiro, Proof Theory and Semantics of Logic Programs 1989 4 LICS Fitting, Negation as Refutation 1989 4 LICS Abiteboul & Vianu, Fixpoint Extensions of First-order Logic and Datalog-like Languages 1989 4 LICS Bose & Clarke & Long & Michaylov, Parthenon, a Parallel Theorem Prover for Non-Horn Clauses 1989 4 LICS Wand, Type Inference for Record Concatenation and Multiple Inheritance 1989 4 LICS Kfoury & Tiuryn & Urzyczyn, Computational Consequences and Partial Solutions of a Generalized Unification Problem 1989 4 LICS Robinson, How Complete Is PER? 1989 4 LICS Breazu-Tannen & Coquand & Gunter & Scedrov, Inheritance and Explicit Coercion 1989 4 LICS Davis, Emil Post's Contributions to Computer Science 1989 4 LICS Aceto & Hennessy, Towards Action-Refinement in Process Algebras 1989 4 LICS Gischer, A Complete Axiom System for Event Executions 1989 4 LICS Moschovakis, A Game-Theoretic Modelling of Concurrency 1989 4 LICS Rabinovich & Trakhtenbrot, Nets of Processes and Data Flow 1989 4 LICS Degano & Meseguer & Montanari, Axiomatizing Net Computations and Processes 1989 4 LICS Jones & Plotkin, A Probabilistic Powerdomain of Evaluations 1989 4 LICS Howe, Equality in Lazy Computation Systems 1989 4 LICS de Vrijer, Extending the Lambda Calculus with Surjective Pairing Is Conservative 1989 4 LICS Abadi & Pierce & Plotkin, Faithful Ideal Models for Recursive Polymorphic Types 1989 4 LICS Harper & Sannella & Tarlecki, Structure and Representation in LF 1989 4 LICS Lifschitz, The Mathematics of Nonmonotonic Reasoning (Abstract) 1989 4 LICS Vardi, On the Complexity of Epistemic Reasoning 1989 4 LICS Kifer & Lozinskii, RI: A Logic for Reasoning with Inconsistency 1989 4 LICS Mislove & Moss & Oles, Non-well-founded Sets Obtained from Ideal Fixed Points 1989 4 LICS Fernando, Substitutional Recursion on Non-well-founded Sets 1989 4 LICS Mason & Talcott, A Sound and Complete Axiomatization of Operational Equivalence of Programs with Memory 1989 4 LICS Jagadeesan & Panangaden & Pingali, A Fully Abstract Semantics for a Functional Language with Logic Variables 1989 4 LICS Mosses, Unified Algebras and Institutions 1989 4 LICS Pfenning, Elf: A Language for Logic Definition and Verified Metaprogramming 1989 4 LICS Stolboushkin, Some Complexity Bounds for Dynamic Logic 1989 4 LICS Emerson & Jutla, On Simultaneously Determinizing and Complementing omega-Automata 1989 4 LICS Lubarsky, mu-Definable Sets of Integers 1989 4 LICS Clarke & Long & McMillan, Compositional Model Checking 1989 4 LICS Goerdt, Characterizing Complexity Classes by Higher Type Primitive Recursive Definitions 1989 4 LICS Nerode & Remmel & Scedrov, Polynomially Graded Logic 1989 4 LICS Luo, ECC, an Extended Calculus of Constructions 1989 4 LICS Middeldorp, A Sufficient Condition for the Termination of the Direct Sum of Term Rewriting Systems 1988 3 LICS Kolaitis & Vardi, 0-1 Laws and Decision Problems for Fragments of Second-Order Logic 1988 3 LICS Compton & Laflamme, An Algebra and a Logic for NC 1988 3 LICS Tiomkin, Proving Unprovability 1988 3 LICS Hoare & Gordon, Partial Correctness of C-MOS Switching Circuits: An Exercise in Applied Logic 1988 3 LICS Bruce & Longo, A Modest Model of Records, Inheritance and Bounded Quantification 1988 3 LICS Amadio, A Fixed Point Extension of the Second Order Lambda-Calculus: Observable Equivalences and Models 1988 3 LICS Giannini & Ronchi Della Rocca, Characterization of Typings in Polymorphic Type Discipline 1988 3 LICS Kfoury & Tiuryn & Urzyczyn, On the Computational Power of Universally Polymorphic Recursion 1988 3 LICS Breazu-Tannen, Combining Algebra and Higher-Order Types 1988 3 LICS Bohm & Piperno, Characterizing X-Separability and One-Side Invertibility in lambda-beta-Omega-Calculus 1988 3 LICS Dershowitz & Okada, Proof-Theoretic Techniques for Term Rewriting Theory 1988 3 LICS Kuper & McAloon & Palem & Perry, Efficient Parallel Algorithms for Anti-Unification and Relative Complement 1988 3 LICS Boudet & Jouannaud & Schmidt-Schauss, Unification in Free Extensions of Boolean Rings and Abelian Groups 1988 3 LICS Wand, Corrigendum: Complete Type Inference for Simple Objects 1988 3 LICS Degano & De Nicola & Montanari, On the Consistency of ``Truly Concurrent'' Operational and Denotational Semantics 1988 3 LICS Winskel, A Category of Labelled Petri Nets and Compositional Proof System 1988 3 LICS Meseguer & Montanari, Petri Nets Are Monoids: A New Algebraic Foundation for Net Theory 1988 3 LICS Abadi & Lamport, The Existence of Refinement Mappings 1988 3 LICS Dam, Relevance Logic and Concurrent Composition 1988 3 LICS Walker, Bisimulations and Divergence 1988 3 LICS Cleaveland & Hennessy, Priorities in Process Algebras 1988 3 LICS Larsen & Thomsen, A Modal Process Logic 1988 3 LICS Vorobyov, On the Arithmetic Inexpressiveness of Term Rewriting Systems 1988 3 LICS Gallier & Snyder & Narendran & Plaisted, Rigid E-Unification Is NP-Complete 1988 3 LICS Bachmair, Proof by Consistency in Equational Theories 1988 3 LICS Meyer & Cosmadakis, Semantical Paradigms: Notes for an Invited Lecture 1988 3 LICS Coquand, Categories of Embeddings 1988 3 LICS Ehrhard, A Categorical Semantics of Constructions 1988 3 LICS Freyd & Girard & Scedrov & Scott, Semantic Parametricity in Polymorphic Lambda Calculus 1988 3 LICS Bloom, Can LCF Be Topped? Flat Lattice Models of Typed Lambda Calculus 1988 3 LICS Cartwright & Demers, The Topology of Program Termination 1988 3 LICS Gunter & Jung, Coherence and Consistency in Domains 1988 3 LICS Gerth & Codish & Lichtenstein & Shapiro, Fully Abstract Denotational Semantics for Flat Concurrent Prolog 1988 3 LICS Baudinet, Proving Termination Properties of PROLOG Programs: A Semantic Approach 1988 3 LICS Maher, Complete Axiomatization of the Algebras of Finite, Rational and Infinite Trees 1988 3 LICS Constable & Smith, Computational Foundations of Basic Recursive Function Theory 1988 3 LICS Griffin, Notational Definition--A Formal Account 1988 3 LICS Salvesen & Smith, The Strength of the Subset Type in Martin-Lof's Type Theory 1988 3 LICS Mendler & Aczel, The Notion of a Framework and a Framework for LTC 1988 3 LICS Niwinski, Fixed Points vs. Infinite Generation 1988 3 LICS Fagin & Halpern & Megiddo, A Logic for Reasoning about Probabilities 1988 3 LICS Muller & Saoudi & Schupp, Temporal and Dynamic Logics Are Decidable in Exponential Time 1988 3 LICS Grabowski & Hungar, On the Existence of Effective Hoare Logics 1987 2 LICS Breazu-Tannen & Meyer, Polymorphism Is Conservative over Simple Types 1987 2 LICS Goguen & Meseguer, Order-Sorted Algebra Solves the Constructor-Selector, Multiple Representation and Coercion Problems 1987 2 LICS Mendler, Recursive Types and Type Constraints in Second-Order Lambda Calculus 1987 2 LICS Wand, Complete Type Inference for Simple Objects 1987 2 LICS Abramsky, Domain Theory in Logical Form 1987 2 LICS Harel & Pnueli & Schmidt & Sherman, On the Formal Semantics of Statecharts 1987 2 LICS Seely, Modeling Computations: A 2-Categorical Framework 1987 2 LICS Gaifman & Pratt, Partial Order Models of Concurrency and the Computation of Functions 1987 2 LICS Bidoit & Froidevaux, Minimalism Subsumes Default Logic and Circumscription in Stratified Logic Programming 1987 2 LICS Miller & Nadathur & Scedrov, Hereditary Harrop Formulas and Uniform Proof Systems 1987 2 LICS Gaifman & Mairson & Sagiv & Vardi, Undecidable Optimization Problems for Database Logic Programs 1987 2 LICS Abadi, The Power of Temporal Proofs 1987 2 LICS Alpern & Schneider, Proving Boolean Combinations of Deterministic Properties 1987 2 LICS Sistla & German, Reasoning with Many Processes 1987 2 LICS Sistla & Zuck, On the Eventuality Operator in Temporal Logic 1987 2 LICS Vardi, Verification of Concurrent Programs: The Automata-Theoretic Framework 1987 2 LICS Constable & Smith, Partial Objects in Constructive Type Theory 1987 2 LICS Harper & Honsell & Plotkin, A Framework for Defining Logics 1987 2 LICS Howe, The Computational Behavior of Girard's Paradox 1987 2 LICS Allen, A Non-Type-Theoretic Definition of Martin-Lof's Types 1987 2 LICS Kfoury & Tiuryn & Urzyczyn, The Hierarchy of Finitely Typed Functional Programs 1987 2 LICS Immerman & Kozen, Definability with Bounded Number of Bound Variables 1987 2 LICS Thomas, On Chain Logic, Path Logic, and First-Order Logic over Infinite Trees 1987 2 LICS Halpern & Wimmers, Full Abstraction and Expressive Completeness for FP 1987 2 LICS Shoham, A Semantical Approach to Nonmonotonic Logics 1987 2 LICS Fagin & Halpern, I'm OK If You're OK: On the Notion of Trusting Communication 1987 2 LICS Goerdt, Hoare Logic for Lambda-Terms as Basis of Hoare Logic for Imperative Languages 1987 2 LICS Mitchell & Moggi, Kripke-Style Models for Typed Lambda Calculus 1987 2 LICS Freyd & Scedrov, Some Semantic Aspects of Polymorphic Lambda Calculus 1987 2 LICS Bohm & Tronci, X-Separability and Left-Invertibility in lambda-Calculus 1987 2 LICS Bachmair & Dershowitz, Inference Rules for Rewrite-Based First-Order Theorem Proving 1987 2 LICS Gallier & Raatz & Snyder, Theorem Proving Using Rigid E-Unification: Equational Matings 1987 2 LICS Kirchner & Lescanne, Solving Disequations 1987 2 LICS Dauchet & Tison & Heuillard & Lescanne, Decidability of the Confluence of Ground Term Rewriting Systems 1986 1 LICS Abadi & Manna, A Timely Resolution 1986 1 LICS Amadio & Bruce & Longo, The Finitary Projection Model for Second Order Lambda Calculus and Solutions to Higher Order Domain Equations 1986 1 LICS Bachmair & Dershowitz & Hsiang, Orderings for Equational Proofs 1986 1 LICS Beckman & Gustavsson & Waern, An Algebraic Model of Parallel Execution of Logic Programs 1986 1 LICS Benson & Ben-Shachar, Strong Bisimulation of State Automata 1986 1 LICS Brookes, A Semantically Based Proof System for Partial Correctness and Deadlock in CSP 1986 1 LICS Browne, An Improved Algorithm for the Automatic Verification of Finite State Systems Using Temporal Logic 1986 1 LICS Chou & Ko, On Mechanical Theorem Proving in Minkowskian Plane geometry 1986 1 LICS Coppo & Zacchi, Type Inference and Logical Relations 1986 1 LICS Coquand, An Analysis of Girard's Paradox 1986 1 LICS Csirmaz & Hart, Program Correctness on Finite Fields 1986 1 LICS Despeyroux, Proof of Translation in Natural Semantics 1986 1 LICS Emerson & Lei, Efficient Model Checking in Fragments of the Propositional Mu-Calculus 1986 1 LICS Felleisen & Friedman & Kohlbecker & Duba, Reasoning with Continuations 1986 1 LICS German & Clarke & Halpern, True Relative Completeness of an Axiom System for the Language L4 1986 1 LICS Gunter, The Largest First-Order-Axiomatizable Cartesian Closed Category of Domains 1986 1 LICS Halpern & Shoham, A Propositional Modal Logic of Time Intervals 1986 1 LICS Halpern & Williams & Wimmers, Good Rewrite Strategies for FP 1986 1 LICS Jonsson & Manna & Waldinger, Towards Deductive Synthesis of Dataflow Networks 1986 1 LICS Jouannaud & Kounalis, Automatic Proofs by Induction in Equational Theories without Constructors 1986 1 LICS Kapur & Musser, Inductive Reasoning with Incomplete Specifications 1986 1 LICS Kirchner, Computing Unification Algorithms 1986 1 LICS Knoblock & Constable, Formalized Metareasoning in Type Theory 1986 1 LICS Makowsky & Sain, On the Equivalence of Weak Second Order and Nonstandard Time Semantics for Various Program Verification Systems 1986 1 LICS Mason, Equivalence of First Order LISP Programs: Proving Properties of Destructive Programs via Transformation 1986 1 LICS Mendler & Panangaden & Constable, Infinite Objects in Type Theory 1986 1 LICS Meyer, Floyd-Hoare Logic Defines Semantics: Preliminary Version 1986 1 LICS Mohring, Algorithm Development in the Calculus of Constructions 1986 1 LICS Monteiro & Pereira, A Sheaf-Theoretic Model of Concurrency 1986 1 LICS Parikh, Levels of Knowledge in Distributed Computing 1986 1 LICS Perrin & Schupp, Automata on the Integers, Recurrence Distinguishability, and the Equivalence and Decidability of Monadic Theories 1986 1 LICS Plaisted, The Denotational Semantics of Nondeterministic Recursive Programs Using Coherent Relations 1986 1 LICS Pnueli & Zuck, Probabilistic Verification by Tableaux 1986 1 LICS Rosner & Pnueli, A Choppy Logic 1986 1 LICS Rounds & Kasper, A Complete Logical Calculus for Record Structures Representing Linguistic Information 1986 1 LICS Schlipf, How Uncomputable Is General Circumscription? 1986 1 LICS Shultis, The Design and Implementation of Intuit 1986 1 LICS Statman, On Translating Lambda Terms into Combinators; the Basis Problem 1986 1 LICS Vardi & Wolper, An Automata-Theoretic Approach to Automatic Program Verification 1996 245 LINALG Abeledo & Blum, Stable Matchings and Linear Programming 1996 244 LINALG Chi, The Long-Run Behavior of Markov Chains 1996 239 LINALG Moeller & Milstein, Algebraic Representations for Finite-State Machines 1996 234 LINALG Khachiyan, Diagonal Matrix Scaling is NP-Hard 1996 232 LINALG Kreinovich & Lakeyev & Noskov, Approximate Linear Algebra Is Intractable 1995 226 LINALG Kaplansky, A Contribution to von Neumann's Theory of Games. II 1995 226 LINALG van der Holst & Lovasz & Schrijver, On the Invariance of Colin de Verdiere's Graph Parameter Under Clique Sums 1995 226 LINALG de Graaf & Schrijver, Characterizing Homotopy of Systems of Curves on a Compact Surface by Crossing Numbers 1995 226 LINALG Lovasz & Seress, The Cocycle Lattice of Binary Matroids, II 1995 226 LINALG Barany & Bunting & Larman & Pach, Rich Cells in an Arrangement of Hyperplanes 1995 217 LINALG Fisher & Reeves, Optimal Strategies for Random Tournament Games 1995 217 LINALG Fisher & Ryan, Tournament Games and Condorcet Voting 1995 217 LINALG Lundgren & Merz & Rasmussen, Chromatic Numbers of Competition Graphs 1995 217 LINALG Roberts, On the Problem of Consistent Marking of a Graph 1995 216 LINALG Abeledo & Rothblum, Courtship and Linear Programming 1991 157 LINALG Berenstein & Struppa, Recent Improvements in the Complexity of the Effective Nullstellensatz 1991 157 LINALG Le Bruyn & Van den Bergh, Algebraic Properties of Linear Cellular Automata 1991 152 LINALG Ye & Pardalos, A Class of Linear Complementarity Problems Solvable in Polynomial Time 1991 152 LINALG Freund, Theoretical Efficiency of a Shifted-Barrier-Function Algorithm for Linear Programming 1991 152 LINALG den Hertog & Roos & Terlaky, A Potential-Reduction Variant of Renegar's Short-Step Path-Following Method for Linear Programming 1991 152 LINALG Pardalos & Ye & Han, Algorithms for the Solution of Quadratic Knapsack Problems 1991 152 LINALG Todd, The Affine-Scaling Direction for Linear Programming Is a Limit of Projective-Scaling Directions 1991 152 LINALG Vanderbei, Splitting Dense Columns in Sparse Linear Systems 1991 152 LINALG Kim & Nazareth, The Decomposition Principle and Algorithms for Linear Programming 1991 152 LINALG Kojima & Megiddo, The Relation Between the Path of Centers and Smale's Regularization of the Linear Programming Problem 1991 152 LINALG Turner, Computing Projections for the Karmarkar Algorithm 1991 152 LINALG Mizuno, O(n^rho L)-Iteration and O(n^3 L)-Operation Potential Reduction Algorithms for Linear Programming 1991 152 LINALG Kortanek & Potra & Ye, On Some Efficient Interior Point Methods for Nonlinear Convex Programming 1991 152 LINALG Lustig & Marsten & Shanno, Computational Experience With a Primal-Dual Interior Point Method for Linear Programming 1991 152 LINALG Anstreicher, On Monotonicity in the Scaled Potential Algorithm for Linear Programming 1991 152 LINALG Mehrotra, On Finding a Vertex Solution Using Interior Point Methods 1991 152 LINALG Herzel & Recchioni & Zirilli, A Quadratically Convergent Method for Linear Programming 1991 152 LINALG Gay, Masive Memory Buys Little Speed for Complete, In-Core Sparse Cholesky Factorizations on Some Scalar Computers 1991 152 LINALG Domich & Boggs & Rogers & Witzgall, Optimizing Over Three-Dimensional Subspaces in an Interior-Point Method for Linear Programming 1991 152 LINALG Tapia & Zhang, An Optimal-Basis Identification Technique for Interior-Point Linear Programming Algorithms 1989 114 LINALG Karzanov, Polyhedra Related to Undirected Multicommodity Flows 1989 114 LINALG Frank & Tardos, An Application of Submodular Flows 1989 114 LINALG Peled & Srinivasan, The Polytope of Degree Sequences 1989 114 LINALG Lovasz & Saks & Schrijver, Orthogonal Representations and Connectivity of Graphs 1989 114 LINALG Chvatal & Cook & Hartmann, On Cutting-Plane Proofs in Combinatorial Optimization 1989 114 LINALG Hassin & Megiddo, On Orientations and Shortest Paths 1989 114 LINALG Horiguchi & Miranker, Noisy Sort, A Memory-Intensive Sorting Algorithm 1989 114 LINALG Alon & Cosares & Hochbaum & Shamir, An Algorithm for the Detection and Construction of Monge Sequences 1987 96 LINALG von zur Gathen, Permanent and Determinant 1978 19 LINALG Brockett & Dobkin, On the Optimal Evaluation of a Set of Bilinear Forms 1994 LINFLOW van Eijck & Visser, Logic and Information Flow 1994 LINFLOW van Benthem, A Note on Dynamic Arrow Logic 1994 LINFLOW van Eijck, Axiomatizing Dynamic Predicate Logic with Quiantified Dynamic Logic 1994 LINFLOW Gardenfors, How Logic Emerges from the Dynamics of Information 1994 LINFLOW Kozen, On Action Algebras 1994 LINFLOW Kracht, Logic and Control: How They Determine the Behaviour of Presuppositions 1994 LINFLOW Moss & Seligman, Classification Domains and Information Links: A Brief Survey 1994 LINFLOW Ponse, Process Algebra and Dynamic Logic 1994 LINFLOW Pratt, A Roadmap of Some Two-Dimensional Logics 1994 LINFLOW Andreka & Nemeti & Sain, Some New Landmarks on the Roadmap of Two Dimensional Logics 1994 LINFLOW de Rijke, Meeting Some Neighbors 1994 LINFLOW Visser, Actions under Presuppositions 1988 2 LISPTRS Clinger, The Scheme of Things: Exact and Inexact Numbers 1995 40 LMALGEB Auer, An Elementary Proof of the Invertibility of Distance Matrices 1995 39 LMALGEB Simic, Some Notes on Graphs Whose Second Largest Eigenvalue is Less Than (sqrt(5)-1)/2 1995 39 LMALGEB Helmberg & Mohar & Poljak & Rendl, A Spectral Approach to Bandwidth and Separator Problems in Graphs 1995 39 LMALGEB Cvetkovic, Star Partitions and the Graph Isomorphism Problem 1995 39 LMALGEB Grone, Eigenvalues and the Degree Sequences of Graphs 1995 39 LMALGEB Khosrovshahi & Torabi, A Note on Labelings of Graphs 1994 38 LMALGEB Bloom, Bijective Comparison of Optimal Planarity Algorithms 1994 38 LMALGEB Nylen & Uhlig, Realizations of Interlacing by Tree-Patterned Matrices 1990 26 LMALGEB Canfield & Williamson, The Two Basic Linear Time Planarity Algorithms: Are They the Same? 1990 26 LMALGEB Lin & Lin, The n-Dimensional Pythagorean Theorem 1996 210 LNCIS De Wilde, Neural Network Models: An Analysis 1996 1163 LNCS Kim & Matsumoto (Eds.), Advances in Cryptology -- ASIACRYPT '96: International Conference on the Theory and Applications of Cryptology and Information Security 1996 1162 LNCS Feitelson & Rudolph (Eds.), Job Scheduling Strategies for Parallel Processing: IPPS '96 Workshop 1996 1160 LNCS Arikawa & Sharma (Eds.), Algorithmic Learning Theory, 7th International Workshop, ALT '96 1996 1159 LNCS Borges & Kaestner (Eds.), Advances in Artificial Intelligence: 13th Brazilian Symposium on Artificial Intelligence, SBIA '96 1996 1158 LNCS Berardi & Coppo (Eds.), Types for Proofs and Programs: International Workshop, TYPES '95 1996 1153 LNCS Burke & Ross (Eds.), Practice and Theory of Automated Timetabling, First International Conference 1996 1151 LNCS Babaoglu & Marzullo (Eds.), Distributed Algorithms: 10th International Workshop, WDAG '96 1996 1150 LNCS Hlawiczka & Silva & Simoncini (Eds.), Dependable Computing -- EDCC-2: Second European Dependable Computing Conference 1996 1148 LNCS Lin & Manocha (Eds.), Applied Computational Geometry: Towards Geometric Engineering, FCRC'96 Workshop, WACG'96 1996 1147 LNCS Miclet & de la Higuera (Eds.), Grammatical Inference: Learning Syntax from Sentences, Third International Colloquium, ICGI-96 1996 1146 LNCS Bertino & Kurth & Martella & Montolivo (Eds.), Computer Security -- ESORICS 96: 4th European Symposium on Research in Computer Security 1996 1145 LNCS Cousot & Schmidt (Eds.), Static Analysis: Third International Symposium, SAS'96 1996 1143 LNCS Fogarty (Ed.), Evolutionary Computing: AISB Workshop 1996 1141 LNCS Voigt & Ebeling & Rechenberg & Schwefel (Eds.), Parallel Problem Solving from Nature -- PPSN IV: International Conference on Evolutionary Computation -- The 4th International Conference on Parallel Problem Solving from Nature 1996 1140 LNCS Kuchen & Swierstra (Eds.), Programming Languages: Implementations, Logics, and Programs: 8th International Symposium, PLILP '96 1996 1139 LNCS Hanus & Rodriguez-Artalejo (Eds.), Algebraic and Logic Programming: 5th International Conference, ALP'96 1996 1138 LNCS Calmet & Campbell & Pfalzgraf (Eds.), Artificial Intelligence and Symbolic Mathematical Computation: International Conference, AISMC-3 1996 1136 LNCS Diaz & Serna (Eds.), Algorithms -- ESA '96: Fourth Annual European Symposium 1996 1135 LNCS Jonsson & Parrow (Eds.), Formal Techniques in Real-Time and Fault-Tolerant Systems, 4th International Symposium 1996 1133 LNCS Chouinard & Fortier & Gulliver (Eds.), Information Theory and Applications II, 4th Canadian Workshop 1996 1128 LNCS Calmet & Limongelli, Design and Implementation of Symbolic Computation Systems: International Symposium, DISCO '96 1996 1127 LNCS Boszormenyi (Ed.), Parallel Computation: Third International ACPC Conference, with Special Emphasis on Parallel Databases and Parallel I/O 1996 1125 LNCS von Wright & Grundy & Harrison (Eds.), Theorem Proving in Higher Order Logics: 9th International Conference, TPHOLs'96 1996 1124 LNCS Bouge & Fraigniaud & Mignotte & Robert (Eds.), Euro-Par'96 Parallel Processing: Second International Euro-Par Conference, Proceedings, Volume II 1996 1123 LNCS Bouge & Fraigniaud & Mignotte & Robert (Eds.), Euro-Par'96 Parallel Processing: Second International Euro-Par Conference, Proceedings, Volume I 1996 1122 LNCS Cohen (Ed.), Algorithmic Number Theory: Second International Symposium, ANTS-II 1996 1121 LNCS Perner & Wang & Rosenfeld (Eds.), Advances in Structural and Syntactical Pattern Recognition: 6th International Workshop, SSPR '96 1996 1120 LNCS Deza & Euler & Manousssakis (Eds.), Combinatorics and Computer Science: 8th Franco-Japanese and 4th Franco-Chinese Conference 1996 1117 LNCS Ferreira & Rolim & Saad & Yang (Eds.), Parallel Algorithms for Irregularly Structured Problems: Third Internation Workshop, IRREGULAR '96 1996 1113 LNCS Penczek & Szalas (Eds.), Mathematicsl Foundations of Computer Science 1996: 21st International Symposium, MFCS '96 1996 1112 LNCS von der Malsburg & von Seelen & Vorbruggen & Sendhoff (Eds.), Artificial Neural Networks -- ICANN 96, 1996 International Conference 1996 1109 LNCS Koblitz (Ed.), Advances in Cryptology -- CRYPTO '96: 16th Annual International Cryptology Conference 1996 1103 LNCS Ganzinger (Ed.), Rewriting Techniques and Applications: 7th International Conference, RTA-96 1996 1102 LNCS Alur & Henzinger (Eds.), Computer Aided Verification: 8th International Conference, CAV '96 1996 1101 LNCS Wirsing & Nivat (Eds.), Algebraic Methodology and Software Technology: 5th International Conference, AMAST '96 1996 1100 LNCS Pfitzmann, Digital Signature Schemes: General Framework and Fail-Stop Signatures 1996 1099 LNCS Meyer auf der Heide & Monien, Automata, Languages and Programming: 23rd International Colloquium, ICALP '96 1996 1097 LNCS Karlsson & Lingas (Eds.), Algorithm Theory -- SWAT '96: 5th Scandinavian Workshop on Algorithm Theory 1996 1095 LNCS McCune & Padmanabhan, Automated Deduction in Equational Logic and Cubic Curves 1996 1092 LNCS Buning (Ed.), Computer Science Logic: 9th International Workshop, CSL '95, Annual Conference of the EACSL 1996 1091 LNCS Billington & Reisig (Eds.), Application and Theory of Petri Nets 1996, 17th International Conference 1996 1090 LNCS Cai & Wong (Eds.), Computing and Combinatorics: Second Annual International Conference, COCOON '96 1996 1089 LNCS Ramalingam, Bounded Incremental Computation 1996 1084 LNCS Cunningham & McCormick & Queyranne (Eds.), Integer Programming and Combinatorial Optimization: 5th International IPCO Conference 1996 1082 LNCS Adam & Bhargava & Halem & Yesha (Eds.), Digital Libraries: Research and Technology Advances, ADL'95 Forum, Selected Papers 1996 1075 LNCS Hirschberg & Myers (Eds.), Combinatorial Pattern Matching: 7th Annual Symposium, CPM 96 1996 1074 LNCS Dowek & Heering & Meinke & Moller (Eds.), Higher-Order Algebra, Logic, and Term Rewriting: Second International Workshop, HOA '95 1996 1073 LNCS Cuny & Ehrig & Engels & Rozenberg (Eds.), Graph Grammars and Their Application to Computer Science, 5th International Workshop (1994) 1996 1071 LNCS Miglioli & Moscato & Mundici & Ornaghi (Eds.), Theorem Proving with Analytic Tableaux and Related Methods; 5th International Workshop, TABLEAUX '96 1996 1070 LNCS Maurer (Ed.), Advances in Cryptology -- EUROCRYPT '96: International Conference on the Theory and Application of Cryptographic Techniques 1996 1066 LNCS Alur & Henzinger & Sontag (Eds.), Hybrid Systems III: Verification and Control 1996 1061 LNCS Ciancarini & Hankin (Eds.), Coordination Languages and Models, First International Conference: COORDINATION '96 1996 1059 LNCS Kirchner (Ed.), Trees in Algebra and Programming -- CAAP '96, 21st International Colloquium 1996 1058 LNCS Nielson (Ed.), Programming Languages and Systems -- ESOP '96: 6th European Symposium on Programming 1996 1054 LNCS Ferreira & Pardalos (Eds.), Solving Combinatorial Optimization Problems in Parallel: Methods and Techniques 1996 1054 LNCS Ferreira & Pardalos, SCOOP: Solving Combinatorial Optimization Problems in Parallel 1996 1054 LNCS Bovet & Clementi & Crescenzi & Silvestri, Parallel Approximation of Optimization Problems 1996 1054 LNCS Clementi & Rolim & Urland, Randomized Parallel Algorithms 1996 1054 LNCS Megson & Rapanotti & Chen, Automatic Synthesis of Parallel Algorithms 1996 1054 LNCS Gengler, An Introduction to Parallel Dynamic Programming 1996 1054 LNCS Luling & Monien & Reinefeld & Tschoke, Mapping Tree-structured Combinatorial Optimization Problems onto Parallel Computers 1996 1054 LNCS de Bruijn & Kindervater & Trienekens, Towards an Abstract Parallel Branch and Bound Machine 1996 1054 LNCS Correa & Ferreira, Parallel Best-First Branch-and-Bound in Discrete Optimization: A Framework 1996 1054 LNCS Benaichouche & Cung & Dowaji & Le Cun & Mautor & Roucairol, Building a Parallel Branch and Bound Library 1996 1054 LNCS Pardalos & Xue & Panagiotopoulos, Parallel Algorithms for Global Optimization Problems 1996 1054 LNCS Laursen, Parallel Heuristic Search -- Introductions and a New Approach 1995 1053 LNCS Graf, Term Indexing 1996 1051 LNCS Gaudel & Woodcock (Eds.), FME'96: Industrial Benefit and Advances in Formal Methods, Third International Symposium of Formal Methods Europe 1996 1051 LNCS Hoare, How did Software get so Reliable Without Proof? 1996 1047 LNCS Hajnicz, Time Structures: Formal Description and Algorithmic Representation 1996 1046 LNCS Puech & Reischuk (Eds.), STACS 96: 13th Annual Symposium on Theoretical Aspects of Computer Science 1996 1043 LNCS Moller & Birtwistle (Eds.), Logics for Concurrency: Structure versus Automata 1996 1039 LNCS Gollmann (Ed.), Fast Software Encryption: Third International Workshop 1996 1034 LNCS Kuper & Wallace (Eds.), Constraint Databases and Applications: ESPRIT WG CONTESSA Workshop 1996 1034 LNCS Afrati & Andronikos & Kavalieros, On the Expressiveness of First-Order Constraint Languages 1996 1034 LNCS Freeston, The Application of Multi-Dimensional Indexing Methods to Constraints 1996 1034 LNCS Reinert, Ambiguity for Referntial Integrity Is Undecidable 1996 1033 LNCS Huang & Sadayappan & Banerjee & Gelernter & Nicolau & Padua (Eds.), Languages and Compilers for Parallel Computing: 8th International Workshop, LCPC '95 1996 1032 LNCS Godefroid, Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem 1996 1030 LNCS Pichler & Moreno-Diaz & Albrecht (Eds.), Computer Aided Systems Theory -- EUROCAST '95: A Selection of Papers from the Fifth International Workshop on Computer Aided Systems Theory 1996 1029 LNCS Dawson & Golic (Eds.), Cryptography: Policy and Algorithms, International Conference 1996 1029 LNCS Caelli, Open Forum -- Cryptography: Personal Freedom and Law Enforcement -- Is it Possible to Get Agreement? 1996 1029 LNCS Ware, Privacy and Security Policy Choices in an NII Environment 1996 1029 LNCS Caelli, Commercial Key Escrow: An Australian Perspective 1996 1029 LNCS Orlowski, Encryption and the Global Information Infrastructure: An Australian Perspective 1996 1029 LNCS Anderson, Crypto in Europe -- Markets, Law and Policy 1996 1029 LNCS Ames, Saving Dollars Makes Sense of Crypto Export Controls 1996 1029 LNCS Jefferies & Mitchell & Walker, A Proposed Architecture for Trusted Third Party Services 1996 1029 LNCS He & Dawson, A New Key Escrow Cryptosystem 1996 1029 LNCS He & Dawson, How to Fairly Reconstruct a Shared Secret 1996 1029 LNCS Golic, A Note on Nonuniform Decimation of Periodic Sequences 1996 1029 LNCS Gustafson & Dawson & Golic, Randomness Measures Related to Subset Occurrence 1996 1029 LNCS Millan, Low Order Approximation of Cipher Functions 1996 1029 LNCS Damgard & Knudsen, Multiple Encryption with Minimum Key 1996 1029 LNCS Gysin, A One-Key Cryptosystem Based on a Finite Nonlinear Automaton 1996 1029 LNCS Golic & O'Connor, A Cryptanalysis of Clock-Controlled Shift Registers with Multiple Steps 1996 1029 LNCS Golic & Salmasizadeh & Clark & Khodkar & Dawson, Discrete Optimisation and Fast Correlation Attacks 1996 1029 LNCS Bakhtiari & Safavi-Naini & Pieprzyk, Keyed Hash Functions 1996 1029 LNCS Hwang & Chang & Yang, Some Active Attacks on Fast Server-Aided Secret Computation Protocols for Modular Exponentiation 1996 1029 LNCS Laih & Kuo, Cryptanalysis of the Enhanced ElGamal's Signature Scheme 1996 1029 LNCS Chen, Access with Pseudonyms 1996 1029 LNCS Chen, A New Identification Algorithm 1996 1029 LNCS Fuchsberger & Gollmann & Lothian & Paterson & Sidiropoulos, Public-key Cryptography on Smart Cards 1996 1029 LNCS Gaskell & Looi, Integrating Smart Cards Into Authentication Systems 1996 1029 LNCS Hruby, Smart Card with Interferometric Quantum Cryptography Device 1996 1029 LNCS Gollmann, Cryptographic APIs 1996 1029 LNCS Russell, Foiling Active Network Impersonation Attacks Made in Collusion with an Insider 1996 1029 LNCS Mohay & Morarji & Le-Viet & Munday & Caelli, The CASS Shell 1996 1027 LNCS Brandenburg (Ed.), Graph Drawing: Symposium on Graph Drawing, GD '95 1995 1026 LNCS Thiagarajan (Ed.), Foundations of Software Technology and Theoretical Computer Science, 15th Conference 1995 1025 LNCS Boyd (Ed.), Cryptography and Coding: 5th IMA Conference 1995 1023 LNCS Kanchanasut & Levy (Eds.), Algorithms, Concurrency and Knowledge: 1995 Asian Computing Science Conference, ACSC '95 1995 1022 LNCS Hartel & Plasmeijer (Eds.), Funtional Programming Languages in Education: First International Symposium, FPLE '95 1995 1019 LNCS Brinksma & Cleaveland & Larsen & Margaria & Steffen (Eds.), Tools and Algorithms for the Construction and Analysis of Systems: First International Workshop, TACAS '95 1995 1017 LNCS Nagl (Ed.), Graph-Theoretic Concepts in Computer Science: 21st International Workshop, WG '95 1995 1012 LNCS Bartosek & Staudek & Wiedermann (Eds.), SOFSEM '95: Theory and Practice of Informatics, 22nd Seminar on Current Trends in Theory and Practice of Informatics 1995 1011 LNCS Furuhashi (Ed.), Advances in Fuzzy Logic, Neural Networks and Genetic Algorithms: IEEE/Nagoya-University World Wisepersons Workshop 1995 1008 LNCS Preneel (Ed.), Fast Software Encryption, Second International Workshop 1995 1007 LNCS Bosselaers & Preneel (Eds.), Integrity Primitives for Secure Information Systems: Final Report of RACE Integrity Primitives Evaluation, RIPE-RACE 1040 1995 1004 LNCS Staples & Eades & Katoh & Moffat (Eds.), Algorithms and Computations: 6th International Symposium, ISAAC '95 1995 1001 LNCS Sudan, Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems 1995 1000 LNCS van Leeuwen (Ed.), Computer Science Today: Recent Trends and Developments 1995 1000 LNCS Brassard, A Quantum Jump in Computer Science 1995 1000 LNCS Steels & Tokoro, Artificial Life and Real World Computing 1995 1000 LNCS Siegelmann, Recurrent Neural Networks 1995 1000 LNCS McColl, Scalable Computing 1995 1000 LNCS Monien & Diekmann & Feldmann & Klasing & Luling & Menzel & Romke & Schroeder, Efficient Use of Parallel and Distributed Systems: From Theory to Practice 1995 1000 LNCS Snyder, Experimental Validation of Models of Parallel Computation 1995 1000 LNCS Wiedermann, Quo Vadetis, Parallel Machine Models? 1995 1000 LNCS Bai & Day & Demmel & Dongarra & Gu & Ruhe & van der Vorst, Templates for Linear Algebra Problems 1995 1000 LNCS Beth & Klappenecker & Minkwitz & Nuckel, The ART behind IDEAS 1995 1000 LNCS Adleman, Algorithmic Number Theory and Its Relationship to Computational Complexity 1995 1000 LNCS Nakano & Zhou & Nishizeki, Edge-Coloring Algorithms 1995 1000 LNCS Hannenhalli & Pevzner, Towards a Computational Theory of Genome Rearrangements 1995 1000 LNCS Herlihy & Rajsbaum, Algebraic Topology and Distributed Computing -- A Primer 1995 1000 LNCS Anuchitanukul & Manna & Uribe, Differential BDDs 1995 1000 LNCS Agarwal & Sharir, Algorithmic Techniques for Geometric Optimization 1995 1000 LNCS Nievergelt & Gasser & Maser & Wirth, All the Needles in a Haystack: Can Exhaustive Search Overcome Combinatorial Chaos? 1995 1000 LNCS Radcliffe & Surry, Fundamental Limitations on Search Algorithms: Evolutionary Computing in Perspective 1995 1000 LNCS Broy, Mathematical System Models as a Basis of Software Engineering 1995 1000 LNCS Shaw & Garlan, Formulations and Formalisms in Software Architecture 1995 1000 LNCS Smolka, The Oz Programming Model 1995 1000 LNCS Wood, Standard Generalized Markup Language: Mathematical and Philosophical Issues 1995 1000 LNCS Gries & Schneider, Avoiding the Undefined by Underspecification 1995 1000 LNCS Harel, Towards a Theory of Recursive Structures 1995 1000 LNCS Pratt, Chu Spaces and Their Interpretation as Concurrent Objects 1995 1000 LNCS Bruynooghe & Codish & Mulkers, Abstracting Unification: A Key Step in the Design of Logic Program Analyses 1995 1000 LNCS Anderson & Needham, Programming Satan's Computer 1995 1000 LNCS Reisig, Petri Net Models of Distributed Algorithms 1995 1000 LNCS Clarke & Jha, Symmetry and Induction in Model Checking 1995 1000 LNCS Vardi, Alternating Automata and Program Verification 1995 1000 LNCS Sandewall, Reasoning about Actions and Change with Ramification 1995 1000 LNCS Eklundh, Trends in Active Vision 1995 1000 LNCS Li & Vitanyi, Computational Machine Learning in Theory and Praxis 1995 1000 LNCS Yager, Fuzzy Sets as a Tool for Modeling 1995 1000 LNCS van Rijsbergen, Information Retrieval and Informative Reasoning 1995 1000 LNCS Vossen, Database Transaction Models 1995 1000 LNCS Bulterman & Hardman, Multimedia Authoring Tools: State of the Art and Research Challenges 1995 1000 LNCS Kappner & Steinmetz, Computational Models for Distributed Multimedia Applications 1995 1000 LNCS Maurer, Hypermedia Systems as Internet Tools 1995 997 LNCS Jantke & Shinohara & Zeugmann (Eds.), Algorithmic Learning Theory, 6th International Workshop, ALT '95 1995 996 LNCS Dybjer & Nordstrom & Smith (Eds.), Types for Proofs and Programs: International Workshop TYPES '94 1995 995 LNCS Muller & Paul, The Complexity of Simple Computer Architectures 1995 993 LNCS Fogarty (Ed.), Evolutionary Computing: AISB Workshop 1995 988 LNCS Frank & Kuhn (Eds.), Spatial Information Theory: A Theoretical Basis for GIS, International Conference COSIT '95 1995 986 LNCS Baker (Ed.), Memory Management: International Workshop IWMM 95 1995 986 LNCS Wilson & Johnstone & Neely & Boles, Dynamic Storage Allocation: A Survey and Critical Review 1995 986 LNCS Plainfosse & Shapiro, A Survey of Distributed Garbage Collection Techniques 1995 986 LNCS Armstrong & Virding, One Pass Real-Time Generational Mark-Sweep Garbage Collection 1995 979 LNCS Spirakis (Ed.), Algorithms -- ESA '95: Third Annual European Symposium 1995 972 LNCS Helary & Raynal (Eds.), Distributed Algorithms, 9th International Workshop, WDAG '95 1995 971 LNCS Schubert & Windley & Alves-Foss (Eds.), Higher Order Logic Theorem Proving and Its Applications, 8th International Workshop 1995 969 LNCS Wiedermann & Hajek (Eds.), Mathematical Foundations of Computer Science 1995: 20th International Symposium, MFCS '95 1995 968 LNCS Dershowitz & Lindenstrauss (Eds.), Conditional and Typed Rewriting Systems, 4th International Workshop, CTRS-94 1995 966 LNCS Haridi & Ali & Magnusson (Eds.), EURO-PAR '95: Parallel Processing, First International EURO-PAR Conference 1995 965 LNCS Reichel (Ed.), Fundamentals of Computation Theory: 10th International Conference, FCT '95 1995 964 LNCS Malyshkin (Ed.), Parallel Computing Technologies: Third International Conference PaCT-95 1995 963 LNCS Coppersmith (Ed.), Advances in Cryptology -- CRYPTO '95, 15th Annual International Cryptology Conference 1995 962 LNCS Lee & Smolka (Eds.), CONCUR '95: Concurrency Theory, 6th International Conference 1995 961 LNCS Jantke & Lange (Eds.), Algorithmic Learning for Knowledge-Based Systems: GOSLER Final Report 1995 961 LNCS Wiehagen & Zeugmann, Learning and Consistency 1995 961 LNCS Freivalds & Kinber & Wiehagen, Error Detecting in Inductive Inference 1995 961 LNCS Freivalds & Kinber & Wiehagen, Learning from Good Examples 1995 961 LNCS Daley & Kalyanasundaram, Towards Reduction Arguments for FINite Learning 1995 961 LNCS Case & Suraj & Jain, Not-So-Nearly-Minimal-Size Program Inference 1995 961 LNCS Jain & Sharma, On Identification by Teams and Probabilistic Machines 1995 961 LNCS Apsitis, Topological Considerations in Composing Teams of Learning Machines 1995 961 LNCS Freivalds & Kinber & Smith, Probabilistic versus Deterministic Memory Limited Learning 1995 961 LNCS Gasarch & Pleszkoch & Velauthapillai, Classification Using Information 1995 961 LNCS Wiehagen & Smith & Zeugmann, Classifying Recursive Predicates and Languages 1995 961 LNCS Zeugmann & Lange, A Guided Tour Across the Boundaries of Learning Recursive Languages 1995 961 LNCS Shinohara & Arikawa, Pattern Inference 1995 961 LNCS Watson, Inductive Learning of Recurrence-Term Languages from Positive Data 1995 961 LNCS Takada, Learning Formal Languages Based on Control Sets 1995 961 LNCS Albrecht, On Lower Bounds for the Depth of Threshold Circuits with Weights from {-1,0,+1} 1995 961 LNCS Pippig, Structuring Neural Networks and PAC-Learning 1995 960 LNCS Leivant (Ed.), Logic and Computational Complexity: International Workshop LCC '94 1995 959 LNCS Du & Li (Eds.), Computing and Combinatorics: First Annual International Conference, COCOON '95 1995 958 LNCS Calmet & Campbell (Eds.), Integrating Symbolic Mathematical Computation and Artificial Intelligence: Second International Conference, AISMC-2 1995 956 LNCS Yao (Ed.), Progress in Evolutionary Computation: AI '93 and AI '94 Workshops on Evolutionary Computation 1995 956 LNCS Michalewicz, A Perspective on Evolutionary Computation 1995 956 LNCS Yao & Darwen, An Experimental Study of N-Person Iterated Prisoner's Dilemma Games 1995 956 LNCS Chan & Mazumder, A Systolic Architecture for High Speed Hypergraph Partitioning Using Genetic Algorithms 1995 956 LNCS Seunarine & Eberbach, The Calculus of Self-Modifiable Algorithm Based Evolutionary Computer Network Routing 1995 956 LNCS Darwen & Yao, On Evolving Robust Strategies for Iterated Prisoner's Dilemma 1995 956 LNCS Piggott & Suraweera, Encoding Graphs for Genetic Algorithms: An Investigation Using the Minimum Spanning Tree Problem 1995 955 LNCS Akl & Dehne & Sack & Santoro (Eds.), Algorithms and Data Structures: 4th International Workshop, WADS '95 1995 953 LNCS Pitt & Rydeheard & Johnstone (Eds.), Category Theory and Computer Science: 6th International Conference, CTCS '95 1995 951 LNCS Egenhofer & Herring (Eds.), Advances in Spatial Databases: 4th International Symposium, SSD '95 1995 950 LNCS De Santis (Ed.), Advances in Cryptology -- EUROCRYPT '94, Workshop on the Theory and Application of Cryptographic Techniques 1995 949 LNCS Feitelson & Rudolph (Eds.), Job Scheduling Strategies for Parallel Processing: IPPS '95 Workshop 1995 948 LNCS Cohen & Giusti & Mora (Eds.), Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 11th International Symposium, AAECC-11 1995 947 LNCS Moller (Ed.), Mathematics of Program Construction, Third International Conference, MPC '95 1995 946 LNCS Froidevaux & Kohlas (Eds.), Symbolic and Quantitative Approaches to Reasoning and Uncertainty, European Conference, ECSQARU '95 1995 945 LNCS Bouchon-Meunier & Yager & Zadeh (Eds.), Advances in Intelligent Computing -- IPMU '94: 5th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems 1995 944 LNCS Fulop & Gecseg (Eds.), Automata, Languages and Programming: 22nd International Colloquium, ICALP 95 1995 942 LNCS Bockle, Exploitation of Fine-Grain Parallelism 1995 941 LNCS Cadoli, Tractable Reasoning in Artificial Intelligence 1995 940 LNCS Goble & Keane (Eds.), Advances in Databases, 13th British National Conference on Databases, BNCOD 13 1995 939 LNCS Wolper (Ed.), Computer Aided Verification, 7th International Conference, CAV '95 1995 938 LNCS Birman & Mattern & Schiper (Eds.), Theory and Practice in Distributed Systems, International Workshop 1995 937 LNCS Galil & Ukkonen (Eds.), Combinatorial Pattern Matching, 6th Annual Symposium, CPM 95 1995 936 LNCS Alagar & Nivat (Eds.), Algebraic Methodology and Software Technology, 4th International Conference, AMAST '95 1995 935 LNCS De Michelis & Diaz (Eds.), Application and Theory of Petri Nets 1995, 16th International Conference 1995 933 LNCS Pacholski & Tiuryn (Eds.), Computer Science Logic: 8th Workshop, CSL '94 1995 931 LNCS Braspenning & Thuijsman & Weijters (Eds.), Artificial Neural Networks: An Introduction to ANN Theory and Practice 1995 930 LNCS Mira & Sandoval (Eds.), From Natural to Artificial Neural Computation, International Workshop on Artificial Neural Networks 1995 928 LNCS Marek & Nerode & Truszczynski (Eds.), Logic Programming and Nonmonotonic Reasoning, Third International Conference, LPNMR '95 1995 925 LNCS Jeuring & Meijer (Eds.), Advanced Functional Programming: First International Spring School on Advanced Functional Programming Techniques, Tutorial Text 1995 922 LNCS Dorr, Efficient Graph Rewriting and Its Implementation 1995 921 LNCS Guillou & Quisquater (Eds.), Advances in Cryptology -- EUROCRYPT '95: International Conference on the Theory and Application of Cryptographic Techniques ( 1995 920 LNCS Balas & Clausen (Eds.), Integer Programming and Combinatorial Optimization: 4th International IPCO Conference 1995 917 LNCS Pieprzyk & Safavi-Naini (Eds.), Advances in Cryptology -- ASIACRYPT '94, 4th International Conference on the Theory and Applications of Cryptology (I'm calling it 13th, but counting actual conferences makes it look like 14th) 1995 916 LNCS Adam & Bhargava & Yesha (Eds.), Digital Libraries: Current Issues, Digital Libraries Workshop DL '94 1995 915 LNCS Mosses & Nielsen & Schwartzbach (Eds.), TAPSOFT '95: Theory and Practice of Software Development, 6th International Joint Conference CAAP/FASE 1995 914 LNCS Hsiang (Ed.), Rewriting Techniques and Applications: 6th International Conference, RTA-95 1995 912 LNCS Lavrac & Wrobel (Eds.), Machine Learning: ECML-95, 8th European Conference on Machine Learning 1995 904 LNCS Vitanyi (Ed.), Computational Learning Theory: Second European Conference, EuroCOLT '94 1995 903 LNCS Mayr & Schmidt & Tinhofer (Eds.), Graph-Theoretic Concepts in Computer Science: 20th International Workshop. WG '94 1995 902 LNCS Dezani-Ciancaglini & Plotkin (Eds.), Typed Lambda Calculi and Applications: Second International Conference on Typ[ed Lambda Calculi and Applications, TLCA '95 1995 900 LNCS Mayr & Puech (Eds.), STACS 95: 12th Annual Symposium on Theoretical Aspects of Computer Science 1995 897 LNCS Fisher & Owens (Eds.), Executable Modal and Temporal Logics: IJCAI '93 Workshop 1995 897 LNCS Fisher & Owens, An Introduction to Executable Modal and Temporal Logics 1995 909 LNCS Comon & Jouannaud (Eds.), Term Rewriting: French Spring School of Theoretical Computer Science 1995 908 LNCS Rao, Extensions of the UNITY Methodology: Compositionality, Fairness and Probability in Parallelism 1995 907 LNCS Ito & Yonezawa (Eds.), Theory and Practice of Parallel Programming: International Workshop TPPP '94 1995 906 LNCS Astesiano & Reggio & Tarlecki (Eds.), Recent Trends in Data Type Specification: 10th Workshop on Specification of Abstract Data Types, Joint with the 5th COMPASS Workshop 1995 901 LNCS Kumar & Kropf (Eds.), Theorem Provers in Circuit Design: Theory, Practice and Experience, Second International Conference, TPCD '94 1995 894 LNCS Tamassia & Tollis (Eds.), Graph Drawing: DIMACS International Workshop, GD '94 1995 893 LNCS Gottlob & Vardi (Eds.), Database Theory -- ICDT '95: 5th International Conference 1994 880 LNCS Thiagarajan (Ed.), Foundations of Software Technology and Theoretical Computer Science, 14th Conference 1994 879 LNCS Dongarra & Wasniewski (Eds.), Parallel Scientific Computing, First International Workshop, PARA '94 1994 877 LNCS Adleman & Huang (Eds.), Algorithmic Number Theory, First International Symposium, ANTS-1 1994 875 LNCS Gollmann (Ed.), Computer Security -- ESORICS 94, Third European Symposium on Research in Computer Security 1994 872 LNCS Arikawa & Jantke (Eds.), Algorithmic Learning Theory: 4th International Workshop on Analogical and Inductive Inference, AII '94, and 5th International Workshop on Algorithmic Learning Theory, ALT '94 1994 870 LNCS Greenfield, Distributed Programming Paradigms with Cryptography Applications 1994 866 LNCS Davidor & Schwefel & Manner (Eds.), Parallel Problem Solving from Nature -- PPSN III, International Conference on Evolutionary Computation, The Third Conference on Parallel Problem Solving from Nature 1994 865 LNCS Fogarty (Ed.), Evolutionary Computing: AISB Workshop, Selected Papers 1994 863 LNCS Langmaack & de Roever & Vytopil (Eds.), Formal Techniques in Real-Time and Fault-Tolerant Systems: Third International SymposiumInternational Symposium Organized Jointly with the Working Group Provably Correct Systems -- ProCoS 1994 862 LNCS Carrasco & Oncina (Eds.), Grammatical Inference and Applications, Second International Colloquium, ICGI-94 1994 860 LNCS Zagler & Busby & Wagner (Eds.), Computers for Handicapped Persons: 4th International Conference, ICCHP '94 1994 859 LNCS Melham & Camilleri (Eds.), Higher Order Logic Theorem Proving and Its Applications, 7th International Workshop 1994 857 LNCS Tel & Vitanyi (Eds.), Distributed Algorithms: 8th International Workshop, WDAG '1994 1994 855 LNCS van Leeuwen (Ed.), Algorithms -- ESA '94, Second Annual European Symposium 1994 854 LNCS Buchberger & Volkert (Eds.), Parallel Processing: CONPAR 94 -- VAPP VI, Third Joint International Conference on Vector and Parallel Processing 1994 853 LNCS Bolding & Snyder (Eds.), Parallel Computer Routing and Communication, First International Workshop, PCRCW '94 1994 852 LNCS Echtle & Hammer & Powell (Eds.), Dependable Computable -- EDCC-1, First European Dependable Computing Conference 1994 850 LNCS Levi & Rodriguez-Artalejo (Eds.), Algebraic and Logic Programming: 4th International Conference, ALP '94 1994 848 LNCS Krommer & Ueberhuber, Numerical Integration on Advanced Computer Systems 1994 845 LNCS Jouannaud (Ed.), Constraints in Computational Logics: First International Conference, CCL '94 1994 843 LNCS Szepietowski, Turing Machines with Sublogarithmic Space 1994 842 LNCS Kloks, Treewidth: Computations and Approximations 1994 841 LNCS Privara & Rovan & Ruzicka (Eds.), Mathematical Foundations of Computer Science 1994: 19th International Symposium, MFCS'94 1994 840 LNCS Reinelt, The Traveling Salesman: Computational Solutions for TSP Applications 1994 839 LNCS Desmedt (Ed.), Advances in Cryptology -- CRYPTO '94: 14th Annual International Cryptology Conference 1994 836 LNCS Jonsson & Parrow (Eds.), CONCUR '94: Concurrency Theory, 5th International Conference 1994 834 LNCS Du & Zhang (Eds.), Algorithms and Computation: 5th International Symposium, ISAAC '94 1994 832 LNCS Borger & Gurevich & Meinke (Eds.), Computer Science Logic: 7th Workshop, CSL '93, Selected Papers 1994 831 LNCS Bouchitte & Morvan (Eds.), Orders, Algorithms, and Applications: International Workshop ORDAL '94 1994 831 LNCS Habib & Nourine, Bit-Vector Encoding for Partially Ordered Sets 1994 831 LNCS Bogart, Intervals and Orders: What Comes After Interval Orders? 1994 831 LNCS Spinrad, Dimension and Algorithms 1994 831 LNCS Simon & Trunz, A Cleanup on Transitive Orientation 1994 831 LNCS Gustedt & Steger, Testing Hereditary Properties Efficiently on Average 1994 831 LNCS Lin, Triangle Graphs and Their Coloring 1994 831 LNCS Capelle, Representation of an Order as Union of Interval Orders 1994 829 LNCS Chmora & Wicker (Eds.), Error Control, Cryptology, and Speech Compression: Workshop on Information Protection, 1993, Selected Papers 1994 829 LNCS Artamonov & Klyachko & Sidelnikov & Yashchenko, Algebraic Aspects of Key Generation Systems 1994 829 LNCS Alabbadi & Wicker, Susceptibility of Digital Signature Schemes Based on Error-Correcting Codes to Universal Forgery 1994 829 LNCS Blakley & Kabatianskii, Linear Algebra Approach to Secret Sharing Schemes 1994 829 LNCS Boyarinov, Self-Checking Decoding Algorithm for Reed-Solomon Codes 1994 829 LNCS Asnis & Fedorenko & Krouk & Mironchikov, Tables of Coverings for Decoding by S-Sets 1994 829 LNCS Sidorenko, Periodicity of One-Dimensional Tilings 1994 827 LNCS Gabbay & Ohlbach (Eds.), Temporal Logic: First International Conference, ICTL '94 1994 824 LNCS Schmidt & Skyum (Eds.), Algorithm Theory -- SWAT '94: 4th Scandinavian Workshop on Algorithm Theory 1994 820 LNCS Abiteboul & Shamir (Eds.), Automata, Languages and Programming: 21st International Colloquium, ICALP '94 1994 818 LNCS Dill (Ed.), Computer Aided Verification: 6th International Conference, CAV '94 1994 817 LNCS Halatsis & Maritsas & Philokyprou & Theodoridis (Eds.), PARLE '94: Parallel Architectures and Languages Europe, 6th International PARLE Conference 1994 816 LNCS Heering & Meinke & Moller & Nipkow (Eds.), Higher-Order Algebra, Logic, and Term Rewriting: First International Workshop, HOA '93, Selected Papers 1994 815 LNCS Valette (Ed.), Application and Theory of Petri Nets 1994: 15th International Conference 1994 813 LNCS Nerode & Matiyasevich (Eds.), Logical Foundations of Computer Science: Third International Symposium, LFCS '94 1994 812 LNCS Karhumaki & Maurer & Rozenberg (Eds.), Results and Trends in Theoretical Computer Science: Colloquium in Honor of Arto Salomaa 1994 812 LNCS Andersen & Jones, Generalizing Cook's Transformation to Imperative Stack Programs 1994 812 LNCS Berstel, A Rewriting of Fife's Theorem About Overlap-Free Words 1994 812 LNCS Brauer & Brauer, Reconsidering the Jeep Problem -- Or How to Transport a Birthday Present to Salosauna -- 1994 812 LNCS Bruggemann-Klein & Fischer & Ottmann, Learning Picture Sets from Examples 1994 812 LNCS Calude & Jurgensen, Randomness as an Invariant for Number Representations 1994 812 LNCS Csuhaj-Varju, Cooperating Grammars' Systems: Power and Parameters 1994 812 LNCS Culik & Kari, Parallel Pattern Generation with One-Way Communications 1994 812 LNCS Ehrenfeucht & Rozenberg, Dynamic Labeled 2-Structures with Variable Domains 1994 812 LNCS Engelfriet, Deciding the NTS Property of Context-Free Grammars 1994 812 LNCS Gecseg, Homomorphic Representations by Products of Tree Automata 1994 812 LNCS Harju & Hoogeboom & Kleijn, Identities and Transductions 1994 812 LNCS Harju & Rozenberg, Decomposition of Infinite Labeled 2-Structures 1994 812 LNCS Honkala, An Iteration Property of Lindenmayerian Power Series 1994 812 LNCS Hromkovic & Karhumaki & Lepisto, Comparing Descriptional and Computational Complexity of Infinite Words 1994 812 LNCS Ibarra & Jiang, On Some Open Problems Concerning the Complexity of Cellular Arrays 1994 812 LNCS Kari, Power of Controlled Insertion and Deletion 1994 812 LNCS Kelemenova & Kelemen, From Colonies to Eco(grammar)systems 1994 812 LNCS Kuich, On the Multiplicity Equivalence Problem for Context-free Grammars 1994 812 LNCS Makanin & Abdulrab, On General Solution of Word Equations 1994 812 LNCS Mateescu, On (Left) Partial Shuffle 1994 812 LNCS Maurer, Learning Theoretical Aspects is Important but (Sometimes) Dangerous 1994 812 LNCS Nielsen & Clausen, Bisimulation, Games, and Logic 1994 812 LNCS Niemi & Renvall, Cryptographic Protocols and Voting 1994 812 LNCS Nurmi, Cryptographic Protocols for Auctions and Bargaining 1994 812 LNCS Paun & Dassow & Skalla, On the Size of Components of Cooperating Grammar Systems 1994 812 LNCS Paz, An Elementary Algorithmic Problem from an Advanced Standpoint 1994 812 LNCS Ruohonen, Event Detection for ODEs and Nonrecursive Hierarchies 1994 812 LNCS Salomaa & Wood & Yu, Rediscovering Pushdown Machines 1994 812 LNCS Simon, String Matching Algorithms and Automata 1994 812 LNCS Steinby, Classifying Regular Languages by Their Syntactic Algebras 1994 812 LNCS Turakainen, On Polynomial Matrix Equations X^T = p(X) and X = p(X) Where all Parameters are Nonnegative 1994 812 LNCS Welzl, Gram's Equation -- A Probabilistic Proof 1994 809 LNCS Anderson (Ed.), Fast Software Encryption: Cambridge Security Workshop, December 9-11, 1993 1994 809 LNCS Massey, SAFER K-64: A Byte-Oriented Block-Ciphering Algorithm 1994 809 LNCS Daemen & Govaerts & Vandewalle, A New Approach To Block Cipher Design 1994 809 LNCS Kaliski & Robshaw, Fast Block Cipher Proposal 1994 809 LNCS Blocher & Dichtl, Fish: A Fast Software Stream Cipher 1994 809 LNCS Krawczyk, The Shrinking Generator: Some Practical Considerations 1994 809 LNCS Anderson, A Modern Rotor Machine 1994 809 LNCS Chambers, Two Stream Ciphers 1994 809 LNCS Rogaway & Coppersmith, A Software-Optimised Encryption Algorithm 1994 809 LNCS Lomas, Encrypting Network Traffic 1994 809 LNCS Preneel, Design Principles for Dedicated Hash Functions 1994 809 LNCS Roe, Performance of Symmetric Ciphers and One-Way Hash Functions 1994 809 LNCS Golic, On the Security of Shift Register Based Keystream Generators 1994 809 LNCS Ding, The Differential Cryptanalysis and Design of Natural Stream Ciphers 1994 809 LNCS Biham, On Modes of Operation 1994 809 LNCS Gollmann, Cryptanalysis of Clock Controlled Shift Registers 1994 809 LNCS Wheeler, A Bulk Data Encryption Algorithm 1994 809 LNCS Tao, On Finite Automaton One-Key Cryptosystems 1994 809 LNCS Schnorr & Vaudenay, Parallel FFT-Hashing 1994 809 LNCS Lai & Knudsen, Attacks on Double Block Length Hash Functions 1994 809 LNCS Chan & Games & Rushanan, On Quadratic M-Sequences 1994 809 LNCS Klapper & Goresky, 2-Adic Shift Registers 1994 809 LNCS Nyberg, New Bent Mappings Suitable for Fast Implementation 1994 809 LNCS MacLaren, Cryptographic Pseudorandom Numbers in Simulation 1994 809 LNCS Schneier, Description of a New Variable-Length Key, 64-bit Block Cipher (Blowfish) 1994 809 LNCS Di Porto & Wolfowicz, VINO: A Block Cipher Including Variable Permutations 1994 809 LNCS Knudsen, Practically Secure Feistel Ciphers 1994 807 LNCS Crochemore & Gusfield (Eds.), Combinatorial Pattern Matching, 5th Annual Symposium, CPM 94 1994 806 LNCS Barendregt & Nipkow (Eds.), Types for Proofs and Programs: International Workshop TYPES '93 1994 805 LNCS Cosnard & Ferreira & Peters (Eds.), Parallel and Distributed Computing: Theory and Practice, First Canada-France Conference 1994 803 LNCS de Bakker & de Roever & Rozenberg (Eds.), A Decade of Concurrency: Reflections and Perspectives, REX School/Symposium, June 1-4, 1993 1994 803 LNCS Kesten & Manna & Pnueli, Temporal Verification of Simulation and Refinement 1994 803 LNCS Lamport, Verification and Specification of Concurrent Programs 1994 803 LNCS Lynch, Simulation Techniques for Proving Properties of Real-Time Systems 1994 803 LNCS Thomas & Lescow, Logical Specifications of Infinite Computations 1994 802 LNCS Brookes & Main & Melton & Mislove & Schmidt (Eds.), Mathematical Foundations of Programming Semantics, 9th International Conference 1994 793 LNCS Gulliver & Secord (Eds.), Information Theory and Applications, Third Canadian Workshop 1994 792 LNCS Jones & Hagiya & Sato (Eds.), Logic, Language and Computation: Festschrift in Honor of Satoro Takasu 1994 792 LNCS Takahashi, A Simple Proof of the Genericity Lemma 1994 792 LNCS Hasegawa, Well-Ordering of Algebras and Kruskal's Theorem 1994 792 LNCS Kobayashi, On Coding Theorems with Modified Length Functions 1994 792 LNCS Kasai & Sawato & Iwata, Thirty four Comparisons are Required to Sort 13 Items 1994 790 LNCS van Leeuwen (Ed.), Graph-Theoretic Concepts in Computer Science, 19th International Workshop, WG '93 1994 789 LNCS Hagiya & Mitchell (Eds.), Theoretical Aspects of Computer Software: International Symposium TACS '94 1994 787 LNCS Trees in Algebra and Programming -- CAAP '94, 19th International Colloquium 1994 785 LNCS Ehrig & Orejas (Eds.), Recent Trends in Data Type Specification, 9th Workshop on Specification of Abstract Data Types, Joint with the 4th COMPASS Workshop 1994 784 LNCS Bergadano & De Raedt (Eds.), Machine Learning: ECML-94, European Conference on Machine Learning 1994 781 LNCS Cohen & Litsyn & Lobstein & Zemor (Eds.), Algebraic Coding, First French-Israeli Workshop 1994 780 LNCS Joyce & Seger (Eds.), Higher Order Logic Theorem Proving and Its Applications, 6th International Workshop, HUG '93 1994 778 LNCS Bonuccelli & Crescenzi & Petreschi (Eds.), Algorithms and Complexity, Second Italian Conference, CIAC '94 1994 776 LNCS Schneider & Ehrig (Eds.), Graph Transformations in Computer Science, International Workshop 1994 775 LNCS Enjalbert & Mayr & Wagner (Eds.), STACS 94, 11th Annual Symposium on Theoretical Aspects of Computer Science 1994 774 LNCS Banatre & Lee (Eds.), Hardware and Software Architectures for Fault Tolerance, Experiences and Perspectives 1994 774 LNCS Stiffler, Fault Tolerant Architectures -- Past, Present and (?) Future 1994 773 LNCS Stinson (Ed.), Advances in Cryptology -- CRYPTO '93, 13th Annual International Cryptology Conference 1994 765 LNCS Helleseth (Ed.), Advances in Cryptology -- EUROCRYPT '93, Workshop on the Theory and Application of Cryptographic Techniques 1993 762 LNCS Ng & Raghavan & Balasubramanian & Chin (Eds.), Algorithms and Computation: 4th International Symposium, ISAAC '93 1993 761 LNCS Shyamasundar (Ed.), Foundations of Software Technology and Theoretical Computer Science, 13th Conference 1993 758 LNCS Teillaud, Towards Dynamic Randomized Algorithms in Computational Geometry 1993 756 LNCS Pieprzyk & Sadeghiyan, Design of Hashing Algorithms 1993 755 LNCS Moller & Partsch & Schuman (Eds.), Formal Program Development: IFIP TC2/WG 2.1 State-of-the-Art Report 1993 754 LNCS Pfeiffer & Nagle (Eds.), Conceptual Structures: Theory and Implementation, 7th Annual Workshop 1994 750 LNCS Diaz-Herrera (Ed.), Software Engineering Education, 7th SEI CSEE Conference 1993 748 LNCS Halstead & Ito (Eds.), Parallel Symbolic Computing: Languages, Systems, and Applications, US/Japan Workshop 1993 744 LNCS Jantke & Kobayashi & Tomita & Yokomori (Eds.), Algorithmic Learning Theory, 4th International Workshop, ALT '93 1993 743 LNCS Doshita & Furukawa & Jantke & Nishida (Eds.), Algorithmic Learning Theory, Third Workshop, ALT '92 1993 741 LNCS Preneel & Govaerts & Vandewalle (Eds.), Computer Security and Industrial Cryptography: State of the Art and Evolution, ESAT Course 1993 741 LNCS De Schutter, Trends in the Fight Against Computer-Related Delinquency 1993 741 LNCS Vandewalle & Govaerts & Preneel, Technical Approaches to Thwart Computer Fraud 1993 741 LNCS De Soete, Public Key Cryptography 1993 741 LNCS de Waleffe & Quisquater, Better Login Protocols for Computer Networks 1993 741 LNCS van Tilburg, Secret-Key Exchange with Authentication 1993 741 LNCS Preneel & Govaerts & Vandewalle, Information Authentication: Hash Functions and Digital Signatures 1993 741 LNCS Fumy, Key Management 1993 741 LNCS Preneel, Standardization of Cryptographic Techniques 1993 741 LNCS Chaum, Numbers Can Be a Better Form of Cash than Paper 1993 741 LNCS Vedder, Security Aspects of Mobile Communications 1993 741 LNCS Fumy, (Local Area) Network Security 1993 740 LNCS Brickell (Ed.), Advances in Cryptology -- CRYPTO '92, 12th Annual International Cryptology Conference 1993 739 LNCS Imai & Rivest & Matsumoto (Eds.), Advances in Cryptology -- ASIACRYPT '91: International Conference on the Theory and Application of Cryptology 1993 737 LNCS Calmet & Campbell (Eds.), Artificial Intelligence and Symbolic Mathematical Computing, International Conference AISMC-1 1993 736 LNCS Grossman & Nerode & Ravn & Rischel (Eds.), Hybrid Systems 1993 736 LNCS Manna & Pnueli, Verifying Hybrid Systems 1993 736 LNCS Henzinger & Manna & Pnueli, Towards Refining Temporal Specifications into Hybrid Systems 1993 736 LNCS Nerode & Kohn, Models for Hybrid Systems: Automata, Topologies, Controllability, Observability 1993 735 LNCS Bjorner & Broy & Pottosin (Eds.), Formal Methods in Programming and Their Applications, International Conference 1993 734 LNCS Volkert (Ed.), Parallel Computation, Second International ACPC Conference 1993 730 LNCS Lomet (Ed.), Foundations of Data Organization and Algorithms, 4th International Conference, FODO '93 1993 726 LNCS Lengauer (Ed.), Algorithms -- ESA '93: First Annual European Symposium 1993 725 LNCS Schiper (Ed.), Distributed Algorithms, 7th International Workshop, WDAG '93 1993 724 LNCS Cousot & Falaschi & File & Rauzy (Eds.), Static Analysis, Third Interantional Workshop, WSA '93 1993 718 LNCS Seberry & Zheng (Eds.), Advances in Cryptology -- AUSCRYPT '92, Workshop on the Theory and Application of Cryptographic Techniques 1993 717 LNCS Sommerville & Paul (Eds.), Software Engineering -- ESEC '93, 4th European Software Engineering Conference 1993 717 LNCS Buxton, On the Decline of Classical Programming 1993 716 LNCS Frank & Campari (Eds.), Spatial Information Theory: A Theoretical Basis for GIS, European Conference, COSIT '93 1993 715 LNCS Best (Ed.), CONCUR '93: 4th International Conference on Concurrency Theory 1993 713 LNCS Gottlob & Leitsch & Mundici (Eds.), Computational Logic and Proof Theory: Third Kurt Godel Colloquium, KGC '93 1993 711 LNCS Borzyskowski & Sokolowski (Eds.), Mathematical Foundations of Computer Science 1993: 18th International Symposium, MFCS '93 1993 710 LNCS Esik (Ed.), Fundamentals of Computation Theory, 9th International Conference, FCT '93 1993 709 LNCS Dehne & Sack & Santoro & Whitesides (Eds.), Algorithms and Data Structures: Third Workshop, WADS '93 1993 702 LNCS Borger & Jager & Kleine Buning & Martini & Richter (Eds.), Computer Science Logic, 6th Workshop, CSL '92 1993 694 LNCS Bode & Reeve & Wolf (Eds.), PARLE '93: Parallel Architectures and Languages Europe, 5th International PARLE Conference 1993 693 LNCS Lauer (Ed.), Functional Programming, Concurrency, Simulation and Automated Reasoning: International Lecture Series 1991-1992, McMaster University, Hamilton, Ontario, Canada 1993 693 LNCS Lauer, On the Use of Theory Based Systems to Traverse Educational Gaps in Computer Related Activities 1993 693 LNCS MacQueen, Reflections on Standard ML 1993 693 LNCS Dershowitz, A Taste of Rewrite Systems 1993 693 LNCS Barnett & Lengauer, A Systolizing Compilation Scheme for Nested Loops with Linear Bounds 1993 692 LNCS Abel & Ooi (Eds.), Advances in Spatial Databases: Third International Symposium, SSD '93 1993 691 LNCS Marsan (Ed.), Application and Theory of Petri Nets 1993: 14th International Conference 1993 690 LNCS Kirchner (Ed.), Rewriting Techniques and Applications: 5th International Conference, RTA-93 1993 684 LNCS Apostolico & Crochemore & Galil & Manber (Eds.), Combinatorial Pattern Matching: 4th Annual Symposium, CPM 93 1993 681 LNCS Wansing, The Logic of Information Structures 1993 678 LNCS Meyer auf der Heide & Monien & Rosenberg (Eds.), Parallel Architectures and Their Efficient Use: First Heinz Nixdorf Symposium 1993 677 LNCS Abdulrab & Pecuchet (Eds.), Word Equations and Related Topics: Second International Workshop, IWWERT '91 1993 674 LNCS Rozenberg (Ed.), Advances in Petri Nets 1993 1993 673 LNCS Cohen & Mora & Moreno (Eds.), Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 10th International Symposium, AAECC-10 1993 670 LNCS Woodcock & Larsen (Eds.), FME '93: Industrial-Strength Formal Methods: First International Symposium of Formal Methods Europe 1993 669 LNCS Bird & Morgan & Woodcock (Eds.), Mathematics of Program Construction: Second International Conference 1993 668 LNCS Gaudel & Jouannaud (Eds.), TAPSOFT '93: Theory and Practice of Software Development, 4th International Joint Conference CAAP/FASE 1993 665 LNCS STACS 93: 10th Annual Symposium on Theoretical Aspects of Computer Science 1993 661 LNCS Hanson & Remmele & Rivest (Eds.), Machine Learning: From Theory to Applications: Cooperative Research at Siemens and MIT 1993 661 LNCS Blum & Rivest, Training a 3-Node Neural Network is NP-Complete 1993 661 LNCS Kearns & Valiant, Cryptographic Limitations on Learning Boolean Formulae and Finite Automata 1993 661 LNCS Rivest & Schapire, Inference of Finite Automata Using Homing Sequences 1993 658 LNCS Rueppel (Ed.), Advances in Cryptology -- EUROCRYPT '92: Workshop on the Theory and Application of Cryptographic Techniques 1993 657 LNCS Mayr (Ed.), Graph-Theoretic Concepts in Computer Science: 18th International Workshop, WG '92 1993 656 LNCS Rusinowitch & Remy (Eds.), Conditional Term Rewriting Systems: Third Internation Workshop, CTRS-92 1992 653 LNCS Bensoussan & Verjus (Eds.), Future Tendencies in Computer Science, Control and Applied Mathematics: International Conference on the 25th Anniversary of INRIA 1992 652 LNCS Shyamasundar (Ed.), Foundations of Software Technology and Theoretical Computer Science, 12th Conference 1992 650 LNCS Ibaraki & Inagaki & Iwama & Nishizeki & Yamashita (Eds.), Algorithms and Computation: Third International Symposium, ISAAC '92 1992 647 LNCS Segall & Zaks (Eds.), Distributed Algorithms: 6th International Workshop, WDAG '92 1992 646 LNCS Biskup & Hull (Eds.), Database Theory -- ICDT '92: 4th International Conference 1993 644 LNCS Apostolico & Crochemore & Galil & Manber (Eds.), Combinatorial Pattern Matching, Third Annual Symposium 1992 643 LNCS Habel, Hyperedge Replacement: Grammars and Languages 1992 642 LNCS Jantke (Ed.), Analogical and Inductive Inference: International Workshop AII '92 1992 634 LNCS Bouge & Cosnard & Robert & Trystram (Eds.), Parallel Processing: CONPAR 92 -- VAPP V, Second Joint International Conference on Vector and Parallel Processing 1992 633 LNCS Pearce & Wagner (Eds.), Logics in AI: European Workshop JELIA '92 1992 630 LNCS Cleaveland (Ed.), CONCUR '92: Third International Conference on Concurrency Theory 1992 629 LNCS Havel & Koubek (Eds.), Mathematical Foundations of Computer Science 1992: 17 International Symposium 1992 626 LNCS Borger & Jager & Kleine Buning & Richter (Eds.), Computer Science Logic, 5th Workshop, CSL '91 1992 623 LNCS Kuich (Ed.), Automata, Languages and Programming: 19th International Colloquium 1992 621 LNCS Nurmi & Ukkonen (Eds.), Algorithm Theory -- SWAT '92 1992 620 LNCS Nerode & Taitslin (Eds.), Logical Foundations of Computer Science -- Tver '92, Second International Symposium 1992 617 LNCS Marik & Stepankova & Trappl (Eds.), Advanced Topics in Artificial Intelligence, International Summer School 1992 616 LNCS Jensen (Ed.), Application and Theory of Petri Nets 1992, 13th International Conference 1992 613 LNCS Myers & O'Donnell (Eds.), Constructivity in Computer Science, Summer Symposium 1992 609 LNCS Rozenberg (Ed.), Advances in Petri Nets 1992 1992 608 LNCS Frasson & Gauthier & McCalla (Eds.), Intelligent Tutoring Systems: Second International Conference, ITS '92 1992 607 LNCS Kapur (Ed.), Automated Deduction -- CADE-11, 11th International Conference on Automated Deduction 1992 606 LNCS Knuth, Axioms and Hulls 1992 602 LNCS Tomek (Ed.), Computer Assisted Learning: 4th International Conference, ICCAL '92 1992 601 LNCS Dolev & Galil & Rodeh (Eds.), Theory of Computing and Systems: ISTCS '92, Israel Symposium 1992 600 LNCS de Bakker & Huizing & de Roever & Rozenberg (Eds.), Real-Time: Theory in Practice, REX Workshop 1992 598 LNCS Brookes & Main & Melton & Mislove & Schmidt (Eds.), Mathematical Foundations of Programming Semantics: 7th International Conference 1992 594 LNCS Monien & Ottmann (Eds.), Data Structures and Efficient Algorithms: Final Report on the DFG Special Joint Initiative 1992 591 LNCS Zima (Ed.), Parallel Computation: First International ACPC Conference 1992 583 LNCS Simon (Ed.), LATIN '92: 1st Latin American Symposium on Theoretical Informatics 1992 582 LNCS Krieg-Bruckner (Ed.), ESOP '92: 4th European Symposium on Programming 1992 581 LNCS Raoult (Ed.), CAAP '92: 17th Colloquium on Trees in Algebra and Programming 1992 579 LNCS Toueg & Spirakis & Kirousis (Eds.), Distributed Algorithms: 5th International Workshop, WDAG '91 1992 578 LNCS Beth & Frisch & Simmons (Eds.), Public-Key Cryptography: State of the Art and Future Directions 1992 577 LNCS Finkel & Jantzen (Eds.), STACS 92: 9th Annual Symposium on Theoretical Aspects of Computer Science 1992 576 LNCS Feigenbaum (Ed.), Advances in Cryptology -- CRYPTO '91: Proceedings 1992 573 LNCS Cohen & Litsyn & Lobstein & Zemor (Eds.), Algebraic Coding: First French-Soviet Workshop 1992 572 LNCS Schulz (Ed.), Word Equations and Related Topics: 1st International Workship, IWWERT '90 1992 570 LNCS Schmidt & Berghammer (Eds.), Graph-Theoretic Concepts in Computer Science: 17th International Workshop, WG '91 1991 565 LNCS Becker & Eisele & Mundemann (Eds.), Parallelism, Learning, Evolution: Workshop on Evolutionary Models and Strategies; Workshop on Parallel Processing: Logic, Organization, and Technology -- WOPPLOT 89 1991 561 LNCS Ding & Xiao & Shan, The Stability Theory of Stream Ciphers 1991 560 LNCS Biswas & Nori (Eds.), Foundations of Software Technology and Theoretical Computer Science, 11th Conference 1991 559 LNCS Butler, Fundamental Algorithms for Permutation Groups 1991 557 LNCS Hsu & Lee (Eds.), ISA '91 Algorithms: 2nd International Symposium on Algorithms 1991 554 LNCS Grahne, The Problem of Incomplete Information in Relational Databases 1991 548 LNCS Kruse & Siegel (Eds.), Symbolic and Quantitative Approaches to Uncertainty, European Conference ECSQAU 1991 547 LNCS Davies (Ed.), Advances in Cryptology -- EUROCRYPT '91 1991 540 LNCS Prieto (Ed.), Artificial Neural Networks, International Workshop IWANN '91 1991 539 LNCS Mattson & Mora & Rao (Eds.), Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 9th International Symposium, AAECC-9 1991 538 LNCS Kojima & Megiddo & Noma & Yoshise, A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems 1991 537 LNCS Menezes & Vanstone (Eds.), Advances in Cryptology -- CRYPT '90 1991 535 LNCS Jorrand & Kelemen (Eds.), Fundamentals of Artificial Intelligence Research, International Workshop FAIR '91 1991 533 LNCS Borger & Kleine Buning & Richter & Schonfeld (Eds.), Computer Science Logic, 4th Workshop, CSL '90 1991 530 LNCS Pitt & Curien & Abramsky & Pitts & Poigne & Rydeheard (Eds.), Category Theory and Computer Science 1991 529 LNCS Budach (Ed.), Fundamentals of Computation Theory, 8th International Conference, FCT '91 1991 527 LNCS Baeten & Groote (Eds.), CONCUR '91: 2nd International Conference on Concurrency Theory 1991 526 LNCS Ito & Meyer (Eds.), Theoretical Aspects of Computer Software, International Conference TACS '91 1991 525 LNCS Gunther & Schek (Eds.), Advances in Spatial Databases: 2nd Symposium, SSD '91 1991 524 LNCS Rozenberg (Ed.), Advances in Petri Nets 1991 1991 521 LNCS Bouchon-Meunier & Yager & Zadeh (Eds.), Uncertainty in Knowledge Bases, 3rd International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, IPMU '90 1991 520 LNCS Tarlecki (Ed.), Mathematical Foundations of Computer Science 1991: 16th International Symposium 1991 519 LNCS Dehne & Sack & Santoro (Eds.), Algorithms and Data Structures: 2nd Workshop, WADS '91 1991 514 LNCS Cohen & Charpin (Eds.), EUROCODE '90: International Symposium on Coding Theory and Applications 1991 508 LNCS Sakata (Ed.), Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 8th International Conference, 1990 1991 507 LNCS Sherwani & de Doncker & Kapenga (Eds.), Computing in the 90's: The First Great Lakes Computer Science Conference, Kalamazoo, Michigan, 1989 1991 506 LNCS Aarts & van Leeuwen & Rem (Eds.), PARLE '91: Parallel Architectures and Languages Europe, Volume II Parallel Languages 1991 505 LNCS Aarts & van Leeuwen & Rem (Eds.), PARLE '91: Parallel Architectures and Languages Europe, Volume I Parallel Architectures and Algorithms 1991 502 LNCS Barzdins & Bjorner (Eds.), Baltic Computer Science: Selected Papers 1991 501 LNCS Bidoit & Kreowski & Lescanne & Orejas & Sannella (Eds.), Algebraic System Specification and Development: A Survey and Annotated Bibliography 1991 497 LNCS Dehne & Fiala & Koczkodaj (Eds.), Advances in Computing and Information -- ICCI '91 1991 496 LNCS Schwefel & Manner (Eds.), Parallel Problem Solving from Nature, 1st Workship, PPSN 1 1991 494 LNCS Abramsky & Maibaum (Eds.), TAPSOFT '91: Proceedings of the International Joint Conference on Theory and Practice of Software Development 1991 491 LNCS Yonezawa & Ito (Eds.), Concurrency: Theory, Language, and Architecture 1991 491 LNCS Stirling, An Introduction to Modal and Temporal Logics for CCS 1991 488 LNCS Book (Ed.), Rewriting Techniques and Applications, 4th International Conference, RTA-91 1991 487 LNCS Bode (Ed.), Distributed Memory Computing: 2nd European Conference, EDMCC2 1991 487 LNCS Scheidig & Schneider & Spurk, Efficient and Scalable Logical Busses for Message-Passing Interconnection Networks 1991 487 LNCS Xie & Ge, An Optimal Structure that Accommodates both a Ring and a Binary Tree 1991 486 LNCS van Leeuwen & Santoro (Eds.), Distributed Algorithms, 4th International Workshop 1991 484 LNCS Mohring (Ed.), Graph-Theoretic Concepts in Computer Science, 16th International Workshop WG '90 1991 480 LNCS Choffrut & Jantzen (Eds.), STACS 91: 8th Annual Symposium on Theoretical Aspects of Computer Science 1991 473 LNCS Damgard (Ed.), Advances in Cryptology -- EUROCRYPT '90 1990 472 LNCS Nori & Madhavan (Eds.), Foundations of Software Technology and Theoretical Computer Science 1990 470 LNCS Abiteboul & Kanellakis (Eds.), ICDT '90 1990 469 LNCS Guessarian (Ed.), Semantics of Systems of Concurrent Processes 1990 469 LNCS Beauquier, Fault-Tolerant Naming and Mutual Exclusion 1990 469 LNCS Charron-Bost, Concerning the Size of Clocks 1990 469 LNCS Darondeau, Concurrency and Computability 1990 469 LNCS Darondeau & Degano, Causal Trees: Interleaving + Causality 1990 469 LNCS Duchamp & Krob, Partially Commutative Formal Power Series 1990 468 LNCS Akl & Fiala & Koczkodaj (Eds.), Advances in Computing and Information--ICCI '90: International Conference on Computing and Information 1990 461 LNCS Deransart & Jourdan (Eds.), Attribute Grammars and their Applications, International Conference WAGA 1990 461 LNCS Knuth, The Genesis of Attribute Grammars 1990 461 LNCS Delest & Fedou, Counting polyominoes Using Attribute Grammars 1990 460 LNCS Uhl & Schmid, A Systematic Catalogue of Reusable Abstract Data Types 1990 458 LNCS Baeten & Klop (Eds.), CONCUR '90, Theories of Concurrency: Unification and Extension 1990 458 LNCS Abadi, An Axiomatization of Lamport's Temporal Logic of Actions 1990 458 LNCS de Boer & Palamidessi, On the Asynchronous Nature of Communication in Concurrent Logic Languages: A Fully Abstract Model Based on Sequences 1990 458 LNCS Fekete & Lynch, The Need for Headers: An Impossibility Result for Communication over Unreliable Channels 1990 458 LNCS van Glabbeek, The Linear Time-Branching Time Spectrum 1990 458 LNCS Groote, A New Strategy for Proving omega-Completeness Applied to Process Algebra 1990 454 LNCS Diekart, Combinatorics on Traces 1990 451 LNCS Marik & Stepankova & Zdrahal (Eds.), Artificial Intelligence in Higher Education 1990 451 LNCS Kelemen & Mikulecky, Changing Philosophy of Teaching Artificial Intelligence 1990 451 LNCS Kowalski, A Proposal for an Undergraduate Degree in the Uses of Logic 1990 451 LNCS Siklossy, After 24 Years in AI: Some Lessons 1990 451 LNCS Stepankova & Stepanek, AI Education and Logic 1990 448 LNCS Simons & Spector (Eds.), Fault-Tolerant Distributed Computing 1990 448 LNCS Fischer, A Theoretician's View of Fault Tolerant Distributed Computing 1990 448 LNCS Gray, A Comparison of the Byzantine Agreement Problem and the Transaction Commit Problem 1990 448 LNCS Schneider, The State Machine Approach: A Tutorial 1990 448 LNCS Dolev & Strong, A Simple Model for Agreement in Distributed Systems 1990 448 LNCS Cristian & Dolev & Strong & Aghili, Atomic Broadcast in a Real-Time Environment 1990 448 LNCS Ben-Or, Randomized Agreement Protocols 1990 448 LNCS Simons & Welch & Lynch, An Overview of Clock Synchronization 1990 448 LNCS Beck & Srikanth & Toueg, Implementation Issues in Clock Synchronization 1990 448 LNCS Fischer & Lynch & Merritt, Easy Impossibility Proofs for Distributed Consensus Problems 1990 448 LNCS Cohn, Arpanet Routing 1990 448 LNCS Hadzilacos, On the Relationship Between the Atomic Commitment and Consensus Problems 1990 448 LNCS Coan, Bibliography for Fault-Tolerant Distributed Computing 1990 445 LNCS van Gasteren, On the Shape of Mathematical Arguments 1990 438 LNCS Norrie & Siz (Eds.), Computer Assisted Learning, 3rd Internation Conference, ICCAL '90 1990 438 LNCS Nievergelt, Computer Science for Teachers: A Quest for Classics and How to Present Them 1990 435 LNCS Brassard (Ed.), Advances in Cryptology -- CRYPTO '89: Proceedings 1990 434 LNCS Quisquater & Vandewalle (Eds.), Advances in Cryptology -- EUROCRYPT '89 1990 432 LNCS Jones (Ed.), ESOP '90: 3rd European Symposium on Programming 1990 432 LNCS Paige, Symbolic Finite Differencing - Part I 1990 431 LNCS Arnold (Ed.), CAAP '90: 15th Colloquium on Trees in Algebra and Programming 1990 430 LNCS de Bakker & de Roever & Rozenberg (Eds.), Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctness: REX Workshop 1990 430 LNCS Abadi & Lamport, Composing Specifications 1990 430 LNCS Lynch, Multivalued Possibilities Mappings 1990 430 LNCS Merritt, Completeness Theorems for Automata 1990 425 LNCS Bergman & Maddux & Pigozzi (Eds.), Algebraic Logic and Universal Algebra in Computer Science: Conference, Ames, Iowa, USA, June 1-4, 1988, Proceedings 1990 425 LNCS Andreka & Jonsson & Nemeti, Relatively Free Relation Algebras 1990 425 LNCS Berman, The Value of Free Algebras 1990 425 LNCS Gumm, Continuations of Logic Programs 1990 425 LNCS Nemeti, On Cylindric Algebraic Model Theory 1990 425 LNCS Pratt, Dynamic Algebras as a Well-Behaved Fragment of Relation Algebras 1990 425 LNCS Wagner, All Recursive Types Defined Using Products and Sums Can Be Implemented Using Pointers 1990 425 LNCS Fleischer, The Abstract Galois Theory: A Survey 1990 424 LNCS Rozenberg (Ed.), Advances in Petri Nets 1989 1990 417 LNCS Martin-Lof & Mints, COLOG-88: International Conference on Computer Logic 1990 417 LNCS Dantsin, Algorithms for Probabilistic Inference 1990 417 LNCS Kreinovich, Group-Theoretic Approach to Intractable Problems 1990 417 LNCS Martin-Lof, Mathematics of Infinity 1990 417 LNCS Orevkov, Correctness of Short Proofs in Theory with Notions of Feasibility 1990 412 LNCS Cybenko, Complexity Theory of Neural Networks and Classification Problems 1990 411 LNCS Nagl, Graph-Theoretic Concepts in Computer Science: 15th International Workshop WG '89 1989 401 LNCS Reif & Sen, Randomization in Parallel Algorithms and its Impact on Computational Geometry 1989 401 LNCS Levcopoulos & Lingas, There Are Planar Graphs Almost as Good as the Complete Graphs and as Short as Minimum Spanning Trees 1989 401 LNCS Dehne, Computing Digitized Voronoi Diagrams on a Systolic Screen and Applications to Clustering 1989 401 LNCS Iliopoulos & Smyth, PRAM Algorithms for Identifying Polygon Similarity 1989 401 LNCS Ramachandran, A Framework for Parallel Graph Algorithm Design 1989 401 LNCS Papatheodorou & Tsantanis, Fast Soliton Automata 1989 401 LNCS Kim & McNaughton & McCloskey, An Upper Bound on the Order of Locally Testable Deterministic Finite Automata 1989 401 LNCS Caucal, A Fast Algorithm to Decide on Simple Grammars Equivalence 1989 401 LNCS Cosnard & Daoudi & Robert, Complexity of the Parallel Givens Factorization on Shared Memory Architectures 1989 401 LNCS Andersson, Optimal Bounds on the Dictionary Problem 1989 401 LNCS Oommen & Ng, Optimal Constant Space Move-to-Rear List Organization 1989 401 LNCS Aleksandrov & Djidjev, Improved Bounds on the Size of Separators of Toroidal Graphs 1989 401 LNCS Sprugnoli & Barcucci & Chiuderi & Pinzani, On Some Properties of (a,b)-Trees 1989 401 LNCS Nussbaum & Sack, Disassembling Two-Dimensional Composite Parts via Translations 1989 401 LNCS Das & Joseph, Which Triangulations Approximate the Complete Graph? 1989 401 LNCS Serna & Spirakis, The Approximability of Problems Complete for P 1989 401 LNCS Bruschi & Joseph & Young, A Structural Overview of NP Optimization Problems 1989 401 LNCS Chlebus, Sorting with Distance Bound on a Mesh-Connected Processor Array 1989 401 LNCS Katajainen & Levcopoulos & Petersson, Local Insertion Sort Revisited 1989 401 LNCS Kunde, Packet Routing on Grids of Processors 1989 401 LNCS Diks & Rytter, Optimal Parallel Computations for Halin Graphs 1989 401 LNCS Osiakwan & Akl, Optimal Parallel Algorithms for b-Matchings in Trees 1989 400 LNCS Klein, Concrete and Abstract Voronoi Diagrams 1989 398 LNCS Stirling, Comparing Linear and Branching Time Temporal Logics 1989 398 LNCS Katz & Peled, Interleaving Set Temporal Logic 1989 398 LNCS Graf & Sifakis, An Expressive Logic for a Process Algebra with Silent Actions 1989 398 LNCS Banieqbal & Barringer, Temporal Logic with Fixed Points 1989 398 LNCS Wolper, On the Relation of Programs and Computations to Models of Temporal Logic 1989 398 LNCS Manna & Pnueli, Specification and Verification of Concurrent Programs by forall-Automata 1989 398 LNCS Josko, MCTL - An Extension of CTL for Modular Verification of Concurrent Systems 1989 398 LNCS Clarke & Grumberg, The Model Checking Problem for Concurrent Systems with Many Similar Processes 1989 398 LNCS Vardi, Unified Verification Theory 1989 386 LNCS Berstel, Finite Automata and Rational Languages. An Introduction 1989 386 LNCS Straubing, The Wreath Product and Its Applications 1989 386 LNCS Schutzenberger, Decomposition Polynomiale des Fonctions Rationnelles (English summary) 1989 386 LNCS Pin, Relational Morphisms, Transductions and Operations on Languages 1989 386 LNCS Birget, Basic Techniques for Two-way Finite Automata 1989 386 LNCS Simon, Properties of Factorization Forests 1989 386 LNCS Hashiguchi, Relative Star Height, Star Height and Finite Automata with Distance Functions 1989 386 LNCS Meakin, Automata and the Word Problem 1989 386 LNCS Thomas, Automata and Quantifier Hierarchies 1989 386 LNCS Weil, Concatenation Product: A Survey 1989 386 LNCS de Luca & Varricchio, A Finiteness Condition for Semigroups 1989 386 LNCS Almeida, Equations for Pseudovarieties 1989 386 LNCS Crochemore, Algorithms and Automata 1989 386 LNCS Rauzy, Numbers and Automata 1989 386 LNCS Restivo, Codes and Automata 1989 386 LNCS Straubing & Therien, Finite Automata and Computational Complexity 1989 386 LNCS Guessarian, A Characterization of Fair Computations of Finite State SCCS Processes 1989 386 LNCS Vergamini, Verification of Distributed Systems: An Experiment 1989 384 LNCS McColl, Parallel Algorithms and Architectures 1989 384 LNCS Loyens, Parallel Programming Techniques for Linear Algebra 1989 384 LNCS van de Vorst, A Parallel Implementation of the Karmarkar Algorithm Using a Parallel Linear Algebra Library 1989 373 LNCS Theoharis, Algorithms for Parallel Polygon Rendering 1989 370 LNCS Meinel, Modified Branching Programs and Their Computational Power 1989 369 LNCS Taubner, Finite Representations of CCS and TCSP Programs by Automata and Petri Nets 1989 362 LNCS Lisper, Synthesizing Synchronous Systems by Static Scheduling in Space-Time 1989 358 LNCS Gianni (Ed.), Symbolic and Algebraic Computation: International Symposium ISSAC '88 (13th) 1989 355 LNCS Dershowitz (Ed.), Rewriting Techniques and Applications 1989 354 LNCS de Bakker & de Roever & Rozenberg (Eds.), Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency 1989 354 LNCS van Benthem, Time, Logic and Computation 1989 354 LNCS Bergstra & Klop, Process Theory Based on Bisimulation Semantics 1989 354 LNCS Emerson & Srinivasan, Branching Time Temporal Logic 1989 354 LNCS Hennessy, Observing Processes 1989 354 LNCS Manna & Pnueli, The Anchored Version of the Temporal Framework 1989 354 LNCS Mazurkiewicz, Basic Notions of Trace Theory 1989 354 LNCS Winskel, An Introduction to Event Structures 1989 354 LNCS Thomas, Computation Tree Logic and Regular omega-Languages 1988 337 LNCS Gunther, Efficient Structures for Geometric Data Management 1988 331 LNCS Pnueli & Harel, Applications of Temporal Logic to the Specification of Real-time Systems (Extended Abstract) 1988 331 LNCS Fischer & Zuck, Reasoning about Uncertainty in Fault-tolerant Distributed Systems 1988 329 LNCS Ambos-Spies & Fleischhack & Huwig, Diagonalizing over Deterministic Polynomial Time 1988 329 LNCS Blasius & Hedtstuck, Resolution with Feature Unification 1988 329 LNCS Bohm & Piperno, Surjectivity for Finite Sets of Combinators by Weak Reduction 1988 329 LNCS Bry & Manthey, Proving Finite Satisfiability of Deductive Databases 1988 329 LNCS Dahlhaus, Is SETL a Suitable Language for Parallel Programming--A Theoretical Approach 1988 329 LNCS Germano & Mazzanti, Loose Diagrams, Semigroupoids, Categories, Groupoids and Iteration 1988 329 LNCS Gurevich & Morris, Algebraic Operational Semantics and Modula-2 1988 329 LNCS Heisel & Reif & Stephan, Program Verification Using Dynamic Logic 1988 329 LNCS Jager, Induction in the Elementary Theory of Types and Names 1988 329 LNCS Karpinski & Kleine Buning & Schmitt, On the Computational Complexity of Quantified Horn Clauses 1988 329 LNCS Lenz & Wegener, The Conjunctive Complexity of Quadratic Boolean Functions 1988 329 LNCS Leiss, On Type Inference for Object-Oriented Programming Languages 1988 329 LNCS Lowen, Optimization Aspects of Logical Formulas 1988 329 LNCS Rasiowa, Logic of Approximation Reasoning 1988 329 LNCS Rehrmann & Priese, Deciding the Path- and Word-Fair Equivalence Problem 1988 329 LNCS Rinn & Schinzel, Learning by Teams from Examples with Errors 1988 329 LNCS Schmitt, A Survey of Rewrite Systems 1988 329 LNCS Schoenfeld, Interfacing a Logic Machine 1988 329 LNCS Schoening, Complexity Cores and Hard-to-Prove Formulas 1988 329 LNCS Speckenmeyer, On the Average Case Complexity of Backtracking for the Exact-Satisfiability Problem 1988 329 LNCS Spreen, On Functions Computable in Nondeterministic Polynomial Time: Some Characterizations 1988 329 LNCS Stepankova & Stepanek, Developing Logic Programs: Computing Through Normalizing 1988 329 LNCS Volger, Model Theory of Deductive Databases 1988 329 LNCS Weber, Algorithms for Propositional Updates 1988 325 LNCS Brassard, Modern Cryptography: A Tutorial 1988 323 LNCS Deransart & Jourdan & Lorho, Attribute Grammars: Definitions, Systems and Bibliography 1988 322 LNCS Lehrmann Madsen & Moller-Pedersen, What Object-Oriented Programming May Be--and What It Does Not Have to Be 1988 322 LNCS Lindskov Knudsen & Lehrmann Madsen, Teaching Object-Oriented Programming Is More Than Teaching Object-Oriented Programming Languages 1988 322 LNCS Sakkinen, On the Darker Side of C++ 1988 321 LNCS Zwiers, Compositionality, Concurrency and Partial Correctness: Proof Theories for Networks of Processes, and Their Relationship 1988 318 LNCS Carlsson & Munro & Poblete, An Implicit Binomial Queue with Constant Insertion Time 1988 318 LNCS Lai & Wood, Implicit Selection 1988 318 LNCS Carlsson & Mattsson, An Extrapolation on the Interpolation Search 1988 318 LNCS Mannila & Ukkonen, Time Parameter and Arbitrary Deunions in the Set Union Problem 1988 318 LNCS Draws & Eriksson & Forslund & Hoglund & Vallner & Strothotte, Two New Algorithms for Constructing Min-Max Heaps 1988 318 LNCS Wood, Extremal Cost Tree Data Structures 1988 318 LNCS Guibas & Overmars & Sharir, Intersecting Line Segments, Ray Shooting, and Other Applications of Geometric Partitioning Techniques 1988 318 LNCS Krishnaswamy & Kim, Problems of Posting Sentries: Variations on the Art Gallery Theorem (Detailed Abstract) 1988 318 LNCS Gunther, A Lower Bound and Two Approximative Algorithms for the K-Partitioning of Rectilinear Polygons 1988 318 LNCS Ghosh, On Recognizing and Characterizing Visibility Graphs of Simple Polygons 1988 318 LNCS Overmars, Connectability Problems 1988 318 LNCS Cunto & Poblete, Two Hybrid Methods for Collision Resolution in Open Addressing Hashing 1988 318 LNCS Szpankowski, On an Alternative Sum Useful in the Analysis of Some Data Structures 1988 318 LNCS Hoyland, Bin-Packing in 1.5 Dimension 1988 318 LNCS Yap, Applications of a Symbolic Perturbation Scheme (Abstract) 1988 318 LNCS Dahlhaus & Karpinski, A Fast Parallel Algorithm for Computing All Maximal Cliques in a Graph and the Related Problems (Extended Abstract) 1988 318 LNCS Gilbert & Hafsteinsson, Parallel Solution of Sparse Linear Systems 1988 318 LNCS Dehne & Sack & Stojmenovic, A Note on Determining the 3-Dimensional Convex Hull of a Set of Points on a Mesh of Processors (Preliminary Version) 1988 318 LNCS Kirousis & Spirakis, Probabilistic Log-space Reductions and Problems Probabilistically Hard for P 1988 318 LNCS Baeza-Yates & Culberson & Rawlins, Searching with Uncertainty (Extended Abstract) 1988 318 LNCS Levcopoulos & Katajainen & Lingas, An Optimal Expected-time Parallel Algorithm for Voronoi Diagrams 1988 318 LNCS Proskurowski & Ruskey, Generating Binary Trees by Transpositions 1988 318 LNCS Keil, Approximating the Complete Euclidean Graph 1988 318 LNCS Dietzfelbinger & Mehlhorn & Meyer auf der Heide & Rohnert, Upper and Lower Bounds for the Dictionary Problem 1988 318 LNCS Djidjev, Linear Algorithms for Graph Separation Problems 1988 318 LNCS Bodlaender, Polynomial Algorithms for Graph Isomorphism and Chromatic Index on Partial k-trees 1988 318 LNCS Vazirani, NC Algorithms for Computing the Number of Perfect Matchings in K_3,3-free Graphs and Related Problems 1988 318 LNCS Syslo & Winter, Independent Covers in Outerplanar Graphs 1988 318 LNCS Weiss & Sedgewick, Tight Lower Bounds for Shellsort 1987 316 LNCS Choffrut, An Introduction to Automata Network Theory 1987 316 LNCS Schupp, Arrays, Automata and Groups: Some Interconnections 1987 316 LNCS Perrin, Local Maps 1987 316 LNCS Goles, Threshold Networks and Generalizations 1987 316 LNCS Tchuente, Computation on Finite Networks of Automata 1987 316 LNCS Robert, Systolic Algorithms for Path-Finding Problems 1987 316 LNCS Mazoyer, An Overview of the Firing Squad Synchronization Problem 1987 316 LNCS Soulie, Representation of Knowledge and Learning on Automata Networks 1987 316 LNCS Weisbuch, Random Boolean Nets and Disordered Systems 1988 306 LNCS Lassez & Maher & Marriott, Unification Revisited 1987 296 LNCS Abbott & Bradford & Davenport, Factorisation of Polynomials: Old Ideas and Recent Results 1987 277 LNCS Benninghofen & Kemmerich & Richter, Systems of Reductions 1987 273 LNCS Royer, A Connotational Theory of Program Structure 1986 272 LNCS Giloi, Interconnection Networks for Massively Parallel Computer Systems 1986 270 LNCS Ambos-Spies, Minimal Pairs for Polynomial Time Reducibilities 1986 270 LNCS Asser, Primitive Recursive Word-Functions of One Variable 1986 270 LNCS Blass & Gurevich, Existential Fixed-Point Logic 1986 270 LNCS Bramik, You have not Understood a Sentence, unless You Can Prove it 1986 270 LNCS Borger, Unsolvable Decision Problems for Prolog Programs 1986 270 LNCS Bruggemann-Klein & Klein, On the Minimality of K, F, and D or: Why Loten is Non-Trivial 1986 270 LNCS Carstens, A 5-Color-Extension-Theorem 1986 270 LNCS Cohen, Closure Relations, Buchberger's Algorithm, and Polynomials in Infinitely Many Variables 1986 270 LNCS Cohors-Fresenborg, The Benefit of Microworlds in Learning Computer Programming 1986 270 LNCS Dahlhaus, Skolem Normal Forms Concerning the Least Fixpoint 1986 270 LNCS Deutsch, Spectral Representation of Recursively Enumerable and Coenumerable Predicates 1986 270 LNCS Drosdol & Schinzel, Aggregating Inductive Expertise on Partial Recursive Functions 1986 270 LNCS Ebbinghaus, Domino Threads and Complexity 1986 270 LNCS Engeler, Modelling of Cooperative Processes 1986 270 LNCS Germano & Mazzanti, A Setting for Generalized Computability 1986 270 LNCS Grandjean, First-order Spectra with One Variable 1986 270 LNCS Hasenjaeger, On the Early History of Register Machines 1986 270 LNCS Karpinski & Verbeek, Randomness, Provability, and the Separation of Monte Carlo Time and Space 1986 270 LNCS Kleine Buning & Lettmann, Representation Independent Query and Update Operations on Propositional Definite Horn Formulas 1986 270 LNCS Kull & Specker, Direct Construction of Mutually Orthogonal Latin Squares 1986 270 LNCS Kummer, Negative Results about the Length Problem 1986 270 LNCS Lickteig & Volger, Some Results on the Complexity of Powers 1986 270 LNCS Mundici, The Turing Complexity of AF C*-Algebras with Lattice-ordered K_0 1986 270 LNCS Nokel & Rehbold & Richter, Remarks on SASL and the Verification of Functional Programming Languages 1986 270 LNCS Ottmann & Thiemt & Ullrich, Numerical Stability of Simple Geometric Algorithms in the Plane 1986 270 LNCS Priese, Communication with Concurrent Systems via I/O-Procedures 1986 270 LNCS Scarpellini, A Class of exp-time Machines which can be Simulated by Polytape Machines 1986 270 LNCS Schwank, alpha-beta-gamma-Automata Realizing Preferences 1986 270 LNCS Ein einfaches Verfahren zur Normalisierung unendlicher Herleitungen 1986 270 LNCS Siefkes, Grammars for Terms and Automata. On a Book by the late J. Richard Buchi 1986 270 LNCS Sieg, Relative Konsistenz 1986 270 LNCS Slaby, Segment Translation Systems 1986 270 LNCS Sperschneider, First Steps towards a Theory of Complexity over more General Data Structures 1986 270 LNCS Spreen & Stahl, On the Power of Single-Valued Nondeterministic Polynomial Time Computations 1986 270 LNCS Thomas, A Concatenation Game and the Dot-Depth Hierarchy 1986 270 LNCS Wagner, Do there Exist Languages with an Arbitrarily Small Amount of Context-Sensitivity 1986 270 LNCS Wegener, The Complexity of Symmetric Boolean Functions 1987 256 LNCS , Rewriting Techniques and Applications 1987 251 LNCS Akman, Unobstructed Shortest Paths in Polyhedral Environments 1987 245 LNCS de Groote, Lectures on the Complexity of Bilinear Problems 1986 220 LNCS Shibayama, A Fast Parallel Merging Algorithm for 2-3 Trees 1986 220 LNCS Toyama, On Equivalence Transformations for Term Rewriting Systems 1986 LNCS Schoening, Complexity and Structure 1985 188 LNCS Muller, The Reachability Problem for VAS 1983 156 LNCS Overmars, The Design of Dynamic Data Structures 1983 149 LNCS Beth (Ed.), Cryptography: Proceedings of the Workshop on Cryptography, Burg Feuerstein, Germany, March 29-April 2, 1982 1983 149 LNCS Bauer, Cryptology--Methods and Maxims 1983 149 LNCS Konheim, Cryptanalysis of a Kryha Machine 1983 149 LNCS Schuchmann, Enigma Variations 1983 149 LNCS Sloane, Encrypting by Random Rotations 1983 149 LNCS Beker, Analogue Speech Security Systems 1983 149 LNCS Hess & Wirl, A Voice Scrambling System for Testing and Demonstration 1983 149 LNCS Timmann, The Rating of Understanding in Secure Voice Communication Systems 1983 149 LNCS Gyorfi & Kerekes, Analysis of Multiple Access Channel Using Multiple Level FSK 1983 149 LNCS Pichler, Analog Scrambling by the General Fast Fourier Transform 1983 149 LNCS Piper, Stream Ciphers 1983 149 LNCS Jennings, Multiplexed Sequences: Some Properties of the Minimum Polynomial 1983 149 LNCS Herlestam, On Using Prime Polynomials in Crypto Generators 1983 149 LNCS Oberman, Communication Security in Remote Controlled Computer Systems 1983 149 LNCS Horbach, Privacy and Data Protection in Medicine 1983 149 LNCS Schaumuler-Bichl, Cryptanalysis of the Data Encryption Standard by the Method of Formal Coding 1983 149 LNCS Gordon & Retkin, Are Big S-Boxes Best? 1983 149 LNCS Davies & Parkin, The Average Cycle Size of the Key Stream in Output Feedback Encipherment 1983 149 LNCS Davio & Goethals & Quisquater, Authentication Procedures 1983 149 LNCS Schobi & Massey, Fast Authentication in a Trapdoor-Knapsack Public Key Cryptosystem 1983 149 LNCS Ingemarsson, A New Algorithm for the Solution of the Knapsack Problem 1983 149 LNCS Eier & Lagger, Trapdoors in Knapsack Cryptosystems 1983 149 LNCS Schnorr, Is the RSA-Scheme Safe? 1983 149 LNCS Sattler & Schnorr, Ein Effizienzvergleich der Faktorisierungsverfahren von Morrison-jBrillhart und Schroeppel 1983 149 LNCS Ecker, Finite Semigroups and the RSA-Cryptosystem 1983 149 LNCS Mignotte, How to Share a Secret? 1981 104 LNCS Deussen (Ed.), Theoretical Computer Science: 5th GI-Conference 1988 300 LNEMS Derigs, Programming in Networks and Graphs: On the Combinatorial Background and Near-Equivalence of Network Flow and Matching Algorithms 1996 1623 LNMATH Yap, Total Colourings of Graphs 1993 1554 LNMATH Lenstra & Lenstra (Eds.), The Development of the Number Field Sieve 1993 1554 LNMATH Lenstra, The Number Field Sieve: An Annotated Bibliography 1993 1554 LNMATH Pollard, Factoring with Cubic Integers 1993 1554 LNMATH Lenstra & Lenstra & Manasse & Pollard, The Number Field Sieve 1993 1554 LNMATH Pollard, The Lattice Sieve 1993 1554 LNMATH Buhler & Lenstra & Pomerance, Factoring Integers with the Number Field Sieve 1993 1554 LNMATH Couveignes, Computing a Square Root for the Number Field Sieve 1993 1554 LNMATH Bernstein & Lenstra, A General Number Field Sieve Implementation 1992 1525 LNMATH Casacuberta & Castellet (Eds.), Mathematical Research Today and Tomorrow: Viewpoints of Seven Fields Medalists 1992 1518 LNMATH Stichtenoth & Tsfasman (Eds.), Coding Theory and Algebraic Geometry 1992 1518 LNMATH Stichtenoth & Tsfasman, Algebraic Geometry and Coding Theory. An Introduction 1992 1512 LNMATH Adleman & Huang, Primality Testing and Abelian Varieties Over Finite Fields 1990 1432 LNMATH Ambos-Spies & Muller & Sacks (Eds.), Recursion Theory Week 1990 1432 LNMATH Ambos-Spies & Homer & Yang, Honest Polynomial Reductions and Exptally Sets 1990 1432 LNMATH Cooper, Enumeration Reducibility, Nondeterministics Computations and Relative Computability of Partial Functions 1990 1432 LNMATH Downey & Jockusch & Stob, Array Nonrecursive Sets and Multiple Permitting Arguments 1990 1432 LNMATH Kucera, Randomness and Generalizations of Fixed Point Free Functions 1990 1432 LNMATH Lempp & Lerman, Priority Arguments Using Iterated Trees of Strategies 1990 1432 LNMATH Maass & Slaman, On the Relationship between the Complexity, the Degree, and the Extension of a Computable Set 1990 1432 LNMATH Nerode & Remmel, Polynomially Isolated Sets 1989 1407 LNMATH Pohlers, Proof Theory: An Introduction 1989 1405 LNMATH Fraley & Vial, Numerical Study of Projective Methods for Linear Programming 1989 1405 LNMATH Vial, A Unified Approach to Projective Algorithms for Linear Programming 1989 1355 LNMATH Bokowski & Sturmfels, Computational Synthetic Geometry 1990 125 LNPAM Chudnovsky & Jenks (Eds.), Computers in Mathematics 1990 125 LNPAM David, Keynote Remarks at the Conference on Computers and Mathematics 1990 125 LNPAM Andrews & Baxter, SCRATCHPAD Explorations for Elliptic Theta Functions 1990 125 LNPAM Askey, Integration and Computers 1990 125 LNPAM Bledsoe, Some Thoughts on Proof Discovery 1990 125 LNPAM Chudnovsky & chudnovsky, Computer Algebra in the Service of Mathematical Physics and Number Theory 1990 125 LNPAM Dantzig, Impact of Linear Programming on Computer Development 1990 125 LNPAM Erdos, Uses of and Limitations of Computers in Number Theory 1990 125 LNPAM Gosper, Strip Mining in the Abandoned Orefields of Nineteenth Century Mathematics 1990 125 LNPAM Kaltofen, Polynomial Factorization 1982-1986 1990 125 LNPAM Lehmer, Factorization Then and Now 1990 125 LNPAM Max, Computer Animation in Mathematics, Science, and Art 1990 125 LNPAM Regge, Physicists and Computer Algebra 1990 125 LNPAM Sammet, Symbolic Computation: The Early Days (1950-1971) 1990 125 LNPAM Stoutemyer, What Computer Algebra Systems Can and Cannot Do 1990 125 LNPAM Winkler, Solution of Equations I: Polynomial Ideals and Grobner Bases 1994 87 LNSTAT Moller, Lectures On Random Voronoi Tessellations 1991 66 LNSTAT Wright, Exact Confidence Bounds when Sampling from Small Finite Universes: An Easy Reference Based on the Hypergeometric Distribution 1996 LOGALG Artemov & Chuprina, Logic of Proofs with Complexity Operators 1996 LOGALG Girard, Proof-Nets: The Parallel Syntax for Proof-theory 1996 LOGALG Belle & Parlamento, Undecidability in Weak Membership Theories 1996 LOGALG Ferreira, Some Notes on Subword Quantification and Induction Thereof 1996 LOGALG Sambin, A New and Elementary Method to Represent Every Complete Boolean Algebra 1975 LOGCOLLOQ Meyer, Weak Monadic Second Order Theory of Successor Is Not Elementary-Recursive 1987 LOGCOMB Simpson, Unprovable Theorems and Fast-Growing Functions 1992 13 LOGPROG Tucker & Zucker, Deterministic and Nondeterministic Computation, and Horn Programs, on Abstract Data Types 1991 10 LOGPROG Vardi, Database Logic Programming 1991 10 LOGPROG Beeri & Naqvi & Shmueli & Tsur, Set Constructors in a Logic Database Language 1991 10 LOGPROG Naughton & Sagiv, A Simple Characterization of Uniform Boundedness for a Class of Recursions 1991 10 LOGPROG Beeri & Ramakrishnan, On the Power of Magic 1991 10 LOGPROG Ausiello & Italiano, On-line Algorithms for Polynomially Solvable Satisfiability Problems 1989 7 LOGPROG Gallo & Urbani, Algorithms for Testing the Satisfiability of Propositional Formulae 1989 6 LOGPROG Ramesh & Verma & Krishnaprasad & Ramakrishnan, Term Matching on Parallel Computers 1989 6 LOGPROG Delcher & Kasif, Some Results on the Complexity of Exploiting Data Dependency in Parallel Logic Programs 1984 1 LOGPROG Dwork & Kanellakis & Mitchell, On the Sequential Nature of Unification 1995 LONGMAN Cutland & Neves & Oliveira & Sousa-Pinto (Eds.), Developments in Nonstandard Mathematics 1992 LONGMAN Golan, The Theory of Semirings, with Applications in Mathematics and Theoretical Computer Science 1990 LONGMAN Nelson & Wilson (Eds.), Graph Colourings 1985 LOVSZEM Agaian & Gevorkian, On Parallel Algorithms of Some Orthogonal Transforms 1985 LOVSZEM Arany, An Efficient Algorithm for Finding Peripheral Nodes 1985 LOVSZEM Bocian & Mikolajczak, Computational Aspects of Assigning Characteristic Semigroup of Asynchronous Automata and Their Extensions 1985 LOVSZEM Borowik, Reichenbach's Propositional Logic in Algorithmic Form 1985 LOVSZEM Camerini & Galbiati & Maffioli, The Complexity of Weighted Multi-Constrained Spanning Tree Problems 1985 LOVSZEM Chmiel, An Algorithm for Finding SC-Preimages of a Deterministic Finite Automaton 1985 LOVSZEM Fischer, On Entropy Decomposition Methods and Algorithm Design 1985 LOVSZEM Fox, An Efficient Algorithm for Dynamic String-Storage Allocation 1985 LOVSZEM Garey & Pinter, Covering Intervals with Intervals under Containment Constraints 1985 LOVSZEM Goldreich & Goldwasser & Micali, How to Construct Random Functions 1985 LOVSZEM Hoffmann, Four Pebbles Don't Suffice to Search Planar Infinite Labyrinths 1985 LOVSZEM Hossfeld, Parallel Algorithms: The Impact of Communication Complexity 1985 LOVSZEM Ivanyi, Tight Worst-case Bounds for Bin Packing Algorithms 1985 LOVSZEM Johnson & Pollak, Hypergraph Planarity and the Complexity of Drawing Venn Diagrams 1985 LOVSZEM Jukna, Convolutional Characterization of Computability and Complexity of Computations 1985 LOVSZEM Jukna, Succinct Data Representations and the Complexity of Computations 1985 LOVSZEM Kannan, Lattices, Basis Reduction and the Shortest Vector Problem 1985 LOVSZEM Liskiewicz & Lorys & Piotrow, The Characterization of Some Complexity Classes by Recursion Schemata 1985 LOVSZEM Lovasz, Some Algorithmic Problems on Lattices 1985 LOVSZEM Moravek, Linear Proofs in the Non-Negative Cone 1985 LOVSZEM Paris & Handley & Wilkie, Characterizing Some Low Arithmetic Classes 1985 LOVSZEM Rycerz & Jegier, Constructing a Simplex Form of a Rational Matrix 1985 LOVSZEM Ruzsa & Tuza, Computing N with a Few Number of Additions 1985 LOVSZEM Schnorr, A Hierarchy of Polynomial Time Basis Reduction Algorithms 1985 LOVSZEM Sipser, A Topological View of Some Problems in Complexity Theory 1985 LOVSZEM Staiger, omega-Computations on Turing Machines and the Accepted Languages 1985 LOVSZEM Turan, On the Greedy Algorithm for an Edge-Partitioning Problem 1985 LOVSZEM Walsh, The Complexity of Linear Quadtrees 1993 LPARCOMP Vishkin, Structural Parallel Algorithmics 1993 LPARCOMP Spirakis & Gibbons, PRAM Models and Fundamental Parallel Algorithmic Techniques: Part I 1993 LPARCOMP Spirakis, PRAM Models and Fundamental Parallel Algorithmic Techniques: Part II 1993 LPARCOMP Ramachandran, Efficient Parallel Graph Algorithms 1993 LPARCOMP O Dunlaing, Some Parallel Geometric Algorithms 1993 LPARCOMP Iliopoulos, Parallel Algorithms for String Pattern Matching 1993 LPARCOMP Evans, Design of Parallel Matrix Algorithms 1993 LPARCOMP Kedem & Palem & Raghunathan & Spirakis, Resilient Parallel Computing On Unreliable Parallel Machines 1993 LPARCOMP Toran, P-Completeness 1993 LPARCOMP Gibbons, An Introduction to Distributed Memory Models of Parallel Computation 1993 LPARCOMP Tel, Network Orientation 1993 LPARCOMP McColl, Special Purpose Parallel Computing 1993 LPARCOMP McColl, General Purpose Parallel Computing 1993 LPARCOMP Chin, Complexity Models for All-Purpose Parallel Computation 1993 LPARCOMP Wijshoff, Implementing Sparse BLAS Primitives on Concurrent/Vector Processors 1995 MAA Halmos, Linear Algebra Problem Book 1994 MAA Devlin, All the Math that's Fit to Print: Articles from The Manchester Guardian 1994 MAA Schwartzman, The Words of Mathematics: An Etymological Dictionary of Mathematical Terms Used in English 1994 MAA Ewing (Ed.), A Century of Mathematics, Through the Eyes of the Monthly 1993 MAA Nelsen, Proofs Without Words: Exercises in Visual Thinking 1993 MAA Straffin, Game Theory and Strategy 1993 MAA Engel, Exploring Mathematics with Your Computer 1992 MAA Dudley, Mathematical Cranks 1992 MAA Steen (Ed.), Library Recommendations for Undergraduate Mathematics 1991 22 MAA Wilf, Student Research Projects: Self-esteem in Mathematics 1991 22 MAA Cooney & Dewar & Kenschaft & Kraines & Latka & LiSanti, Recruitment and Retention of Students in Undergraduate Mathematics 1991 22 MAA Ridenhour, Spiders, Computers, and Markov Chains 1991 22 MAA Strang, A Chaotic Search for i 1991 22 MAA Sandefur, Discrete Dynamical Modeling 1991 22 MAA Devaney, The Orbit Diagram and the Mandelbrot Set 1991 22 MAA Blaine, Theory vs. Computation in Some Very Simple Dynamical Systems 1991 22 MAA Matthews & Strogatz, Chaotic Mappings and Probability Distributions 1991 22 MAA Parris, The Root-Finding Route to Chaos 1991 22 MAA Willson, Teaching about Fractals 1991 22 MAA Nievergelt, Fractals Illustrate the Mathematical Way of Thinking 1990 MAA Sterrett (Ed.), Using Writing To Teach Mathematics 1990 34 MAA Ore & Wilson, Graphs and Their Uses, Revised and updated edition 1989 62 MAA Bailey, A Historical Survey of Solution by Functional Iteration 1989 62 MAA Vanden Eynden, Flipping a Coin Over the Telephone 1989 62 MAA Boas, Multiplying Long Numbers 1989 62 MAA Redheffer, Some Thoughts About Limits 1988 MAA Steen (ed.), Calculus for a New Century: A Pump, Not a Filter 1988 MAA Klamkin, U. S. A. Mathematical Olympiads, 1972-1986 1987 MAA Gillman, Writing Mathematics Well: A Manual for Authors 1970 MACCCSPC Paterson & Hewitt, Comparative Schematology 1997 26 MACHLEARN Blum, Empirical Support for Winnow and Weighted-Majority Algorithms: Results on a Calendar Scheduling Domain 1997 26 MACHLEARN Bshouty, Exact Learning of Formulas in Parallel 1996 25 MACHLEARN Ron & Singer & Tishby, The Power of Amnesia: Learning Probabilistic Automata with Variable Memory Length 1996 25 MACHLEARN Frazier & Pitt, CLASSIC Learning 1996 25 MACHLEARN Haussler & Kearns & Seung & Tishby, Rigorous Learning Curve Bounds from Statistical Mechanics 1996 25 MACHLEARN Pillaipakkamnatt & Raghavan, On the Limits of Proper Learnability of Subclasses of DNF Formulas 1996 25 MACHLEARN Oliveira & Sangiovanni-Vincentelli, Using the Minimum Description Length Principle to Infer Reduced Ordered Decision Graphs 1996 25 MACHLEARN Goldberg & Goldman & Scott, PAC Learning of One-Dimensional Patterns 1996 25 MACHLEARN Cesa-Bianchi & Freund & Helmbold & Warmuth, On-line Prediction and Conversion Strategies 1996 24 MACHLEARN Kalles & Morris, Efficient Incremental Induction of Decision Trees 1996 24 MACHLEARN Kushilevitz & Roth, On Learning Visual Concepts and DNF Formulae 1996 23 MACHLEARN Frasconi & Gori & Maggini & Soda, Representation of Finite State Automata in Recurrent Radial Basis Function Networks 1995 21 MACHLEARN Floyd & Warmuth, Sample Compression, Learnability, and the Vapnik-Chervonenkis Dimension 1995 21 MACHLEARN Parsons & Forrest & Burks, Genetic Algorithms, Operators, and DNA Fragment Assembly 1995 21 MACHLEARN Milosavljevic, Discovering Dependencies via Algorithmic Mutual Information: A Case Study in DNA Sequence Comparisons 1995 21 MACHLEARN Ioerger & Rendell & Subramaniam, Searching for Representatios to Improve Protein Sequence Fold-Class Prediction 1995 20 MACHLEARN Goldman & Warmuth, Learning Binary Relations Using Weighted Majority Voting 1995 20 MACHLEARN Cortes & Vapnik, Support-Vector Networks 1995 19 MACHLEARN Aizenstein & Pitt, On the Learnability of Disjunctive Normal Form Formulas 1995 19 MACHLEARN Meir & Merhav, On the Stochastic Complexity of Learning Realizable and Unrealizable Rules 1995 19 MACHLEARN Yokomori, On Polynomial-Time Learnability in the Limit of Strictly Deterministic Automata 1995 19 MACHLEARN Wettchereck & Dietterich, An Experimental Comparison of the Nearest-Neighbor and Nearest-Hyperrectangle Algorithms 1995 19 MACHLEARN Ben-David, Monotonicity Maintenance in Information-Theoretic Machine Learning Algorithms 1995 19 MACHLEARN Mooney, Encouraging Experimental Results on Learning CNF 1995 18 MACHLEARN Goldberg & Jerrum, Bounding the Vapnik-Chervonenkis Dimension of Concept Classes Parameterized by Real Numbers 1995 18 MACHLEARN Ron & Rubinfeld, Learning Fallible Deterministic Finite Automata 1995 18 MACHLEARN Auer & Long & Maass & Woeginger, On the Complexity of Function Learning 1995 18 MACHLEARN Betke & Rivest & Singh, Piecemeal Learning of an Unknown Environment 1995 18 MACHLEARN Kearns & Seung, Learning from a Population of Hypotheses 1994 17 MACHLEARN Mahadevan & Tadepalli, Quantifying Prior Determination Knowledge Using the PAC Learning Model 1994 16 MACHLEARN Hancock & Golea & Marchand, Learning Nonoverlapping Perceptron Networks from Examples and Membership Queries 1994 16 MACHLEARN Conklin & Witten, Complexity-Based Induction 1994 15 MACHLEARN Bohanec & Bratko, Trading Accuracy for Simplicity in Decision Trees 1994 15 MACHLEARN Epstein, Toward an Ideal Trainer 1994 15 MACHLEARN Kaelbling, Associative Reinforcement Learning: Functions in k-DNF 1994 15 MACHLEARN Kaelbling, Associative Reinforcement Learning: A Generate and Test Algorithm 1994 15 MACHLEARN White & Liu, Technical Note: Bias in Information-Based Measures in Decision Tree Induction 1994 15 MACHLEARN Cohn & Atlas & Ladner, Improving Generalization with Active Learning 1994 14 MACHLEARN Maass & Turan, Algorithms and Lower Bounds for On-Line Learning of Geometrical Concepts 1994 14 MACHLEARN Goldman & Sloan, The Power of Self-Directed Learning 1994 14 MACHLEARN Angluin & Slonim, Randomly Fallible Teachers: Learning Monotone DNF with an Incomplete Membership Oracle 1994 14 MACHLEARN Helmbold & Long, Tracking Drifting Concepts By Minimizing Disagreements 1994 14 MACHLEARN Schapire, Learning Probabilistic Read-once Formulas on Product Distributions 1994 14 MACHLEARN Haussler & Kearns & Schapire, Bounds on the Sample Complexity of Bayesian Learning Using Information Theory and the VC Dimension 1994 14 MACHLEARN Barron, Approximation and Estimation Bounds for Artificial Neural Networks 1993 13 MACHLEARN Forrest & Mitchell, What Makes a Problem Hard for a Genetic Algorithm? Some Anomalous Results and Their Explanation 1993 13 MACHLEARN Kohavi & Benson, Research Note on Decision Lists 1993 13 MACHLEARN Hellerstein, Book Review: Natarajan, Machine Learning: A Theoretical Approach (Morgan Kaufmann, 1991) 1993 13 MACHLEARN Natarajan, A Reply to Hellerstein's Book Review of Machine Learning: A Theoretical Approach 1993 12 MACHLEARN Milosavljevic & Jurka, Discovery by Minimal Length Encoding: A Case Study in Molecular Evolution 1993 12 MACHLEARN Karp, Design Methods for Scientific Hypothesis Formation and Their Application to Molecular Biology 1993 11 MACHLEARN Wallace & Patrick, Coding Decision Trees 1993 11 MACHLEARN Kulkarni & Mitter & Tsitsiklis, Active Learning Using Arbitrary Binary Valued Queries 1993 11 MACHLEARN Sakakibara, Noise-Tolerant Occam Algorithms and Their Applications to Learning Decision Trees 1992 9 MACHLEARN Pazzani & Sarrett, A Framework for Average Case Analysis of Conjunctive Learning Algorithms 1992 9 MACHLEARN Blum, Learning Boolean Functions in an Infinite Attribute Space 1992 9 MACHLEARN Maass & Turan, Lower Bound Methods and Separation Results for On-Line Learning Models 1992 9 MACHLEARN Angluin & Frazier & Pitt, Learning Conjunctions of Horn Clauses 1992 9 MACHLEARN Yamanishi, A Learning Criterion for Stochastic Rules 1992 9 MACHLEARN Abe & Warmuth, On the Computational Complexity of Approximating Distributions by Probabilistic Automata 1992 9 MACHLEARN Osherson & Stob & Weinstein, A Universal Method of Scientific Inquiry 1992 9 MACHLEARN Honavar, review of Judd, Neural Network Design and the Complexity of Learning (MIT Press, 1990) 1992 9 MACHLEARN Judd, A Reply to Honavar's Book Review of Neural Network Design and the Complexity of Learning 1992 8 MACHLEARN Tzeng, Learning Probabilistic Automata and Markov Chains via Queries 1992 8 MACHLEARN Oblow, Implementing Valiant's Learnability Theory Using Random Sets 1991 7 MACHLEARN Porat & Feldman, Learning Automata from Ordered Examples 1991 7 MACHLEARN Koppel, Learning to Predict Non-Deterministically Generated Strings 1991 6 MACHLEARN Lin & Vitter, Complexity Results on Learning by Neural Nets 1991 6 MACHLEARN Salzberg, A Nearest Hyperrectangle Learning Method 1990 5 MACHLEARN Angluin, Negative Results for Equivalence Queries 1990 5 MACHLEARN Ishizaka, Polynomial Time Learnability of Simple Deterministic Languages 1990 5 MACHLEARN Helmbold & Sloan & Warmuth, Learning Nested Differences of Intersection-Closed Concept Classes 1990 5 MACHLEARN Schapire, The Strength of Weak Learnability 1990 5 MACHLEARN Pagallo & Haussler, Boolean Feature Discovery in Empirical Learning 1990 5 MACHLEARN Shvaytser, A Necessary Condition for Learning from Positive Examples 1989 4 MACHLEARN Haussler, Learning Conjunctive Concepts in Structural Domains 1989 4 MACHLEARN Board & Pitt, Semi-Supervised Learning 1989 4 MACHLEARN Natarajan, On Learning Sets and Functions 1989 4 MACHLEARN Van Lehn, Efficient Specialization of Relational Concepts 1989 3 MACHLEARN Langley, Toward a Unified Science of Machine Learning 1988 3 MACHLEARN Goldberg & Holland, Genetic Algorithms and Machine Learning 1988 3 MACHLEARN Langley, Machine Learning as an Experimental Science 1988 3 MACHLEARN Sutton, Learning to Predict by the Methods of Temporal Differences 1988 3 MACHLEARN Hall, Learning by Failing to Explain: Using Partial Explanations to Learn in Incomplete or Intractable Domains 1988 3 MACHLEARN Greiner & Silver & Becker & Gruninger, A Review of Machine Learning at AAAI-87 1988 2 MACHLEARN Haussler, New Theoretical Directions in Machine Learning 1988 2 MACHLEARN Littlestone, Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm 1988 2 MACHLEARN Angluin, Queries and Concept Learning 1988 2 MACHLEARN Angluin & Laird, Learning From Noisy Examples 1988 2 MACHLEARN Pitt & Reinke, Criteria for Polynomial-Time (Conceptual) Clustering 1987 2 MACHLEARN Rivest, Learning Decision Lists 1987 2 MACHLEARN Langley, Machine Learning and Grammar Induction 1987 2 MACHLEARN Berwick & Pilato, Learning Syntax by Automata Induction 1987 2 MACHLEARN VanLehn & Ball, A Version Space Approach to Learning Context-Free Grammars 1994 MACMILL Gelernter, The Muse in the Machine: Computerizing the Poetry of Human Thought 1986 MACMILL Herstein, Abstract Algebra 1995 566 MAMS Robertson & Seymour & Thomas, Excluding Infinite Clique Minors 1990 MANCHESTER Robert, The Impact of Vector and Parallel Architectures on the Gaussian Elimination Algorithm 1990 MANCHESTER Ricciardi (Ed.), Lectures in Applied Mathematics and Informatics 1987 MANCHESTER Soulie & Robert & Tchuente (editors), Automata Networks in Computer Science: Theory and Applications 1987 MANCHESTER Tchuente, Computation on Automata Networks (in Soulie-Robert-Tchuente) 1987 MANCHESTER Robert, Systolic Algorithms and Architectures (in Soulie-Robert-Tchuente) 1987 MANCHESTER Quinton, The Systematic Design of Systolic Arrays (in Soulie-Robert-Tchuente) 1996 6 MANDMS Rotman, Counting Information: A Note on Physicalized Numbers 1995 5 MANDMS Pickering & Chater, Why Cognitive Science Is Not Formalized Folk Psychology 1995 5 MANDMS Morris & Richardson, How Not to Demarcate Cognitive Science and Folk Psychology: A Response to Pickering and Chater 1995 5 MANDMS Horsten & Roelants, The Church-Turing Thesis and Effective Mundane Procedures 1995 5 MANDMS Cleland, Effective Procedures and Computable Functions 1995 5 MANDMS Hardcastle, A Critique of Information Processing Theories of Consciousness 1994 4 MANDMS Harnad, Computation Is Just Interpretable Symbol Manipulation; Cognition Isn't 1994 4 MANDMS Chalmers, On Implementing a Computation 1994 4 MANDMS Chrisley, Why Everything Doesn't Realize Every Computation 1994 4 MANDMS MacLennan, ``Words Lie in Our Way'' 1994 4 MANDMS Kentridge, Symbols, Neurons, Soap-Bubbles and the Neural Computation Underlying Cognition 1994 4 MANDMS Boyle, Computation as an Intrinsic Property 1994 4 MANDMS Bringsjord, Computation among Other Things, Is Beneath Us 1993 3 MANDMS Cleland, Is the Church-Turing Thesis True? 1992 2 MANDMS Dascal, Why Does Language Matter to Artificial Intelligence? 1992 2 MANDMS Harvey, review of David F. Sewell, New Tools for New Minds: A Cognitive Perspective on the Use of Computers with Young Children 1992 2 MANDMS Franklin & Garzon, On Stability and Solvability (Or, When Does a Neural Network Solve a Problem?) 1991 1 MANDMS Clapin, Connectionism Isn't Magic 1991 1 MANDMS Fetzer, Philosophical Aspects of Program Verification 1991 1 MANDMS Glymour, The Hierarchies of Knowledge and the Mathematics of Discovery 1991 1 MANDMS Colburn, Program Verification, Defeasible Reasoning, and Two Views of Computer Science 1991 1 MANDMS Schagrin, review of Paul Thagard, Computational Philosophy of Science, MIT Press (1988) 1995 MANNING Malkin, Comprehensive Networking Glossary and Acronym Guide 1995 MANU Goldreich, Foundations of Cryptography (Fragments of a Book) 1995 MANU Fu, Tight Hierarchy between Monotone NC_1 and Monotone NC_2 (Preliminary Version) 1994 MANU Blaze, Protocol Failure in the Escrowed Encryption Standard (Preliminary Draft) 1994 MANU Amir & Keselman, Maximum Agreement Subtree in a Set of Evolutionary Trees -- Metrics and Efficient Algorithms 1994 MANU Shallit & Breitbart, Automaticity: Properties of a Measure of Descriptional Complexity 1993 MANU Pieprzyk & Tombak, Soviet Encryption Algorithm (translated from Russian) 1993 MANU Kanamori & Homer, From Impossible to Intractable Problems 1993 MANU Zimand, Complexity of Optimal Spanning Hypertrees 1993 MANU Szelepcsenyi, beta_k-Complete Problems and Greediness 1993 MANU Elnozahy & Zwaenepoel, Manetho: Transparent Rollback-Recovery with Low Overhead, Limited Rollback and Fast Output Commit 1989 MANU Kaneps, Stochasticity of the Languages Acceptable by Two-way Finite Probabilistic Automata (translation from Diskretnaya Matematika) 1971 MANU Meyer, An Optimal Time Bound for a One Tape On-line Turing Machine Computation 1996 MARDEK Ursini & Agliano (Eds.), Logic and Algebra 1996 MARDEK Sierksma, Linear and Integer Programming: Theory and Practice 1995 MARDEK Grillet, Semigroups: An Introduction to the Structure Theory 1994 MARDEK Fischer & Loustaunau & Shapiro & Green & Farkas (Eds.), Computational Algebra 1993 MARDEK Loustau & Dillon, Linear Geometry with Computer Graphics 1993 MARDEK Mullen & Shiue (Eds.), Finite Fields, Coding Theory, and Advances in Communications and Computing 1992 MARDEK Evans & Minieka, Optimization Algorithms for Networks and Graphs, Second Edition, Revised and Expanded 1991 MARDEK Hoffman & Leonard & Lindner & Phelps & Rodger & Wall, Coding Theory: The Essentials 1991 MARDEK Bennett & Evert & Lander, What Every Engineer Should Know about Microcomputers: Hardware/Software Design, A Step-by-Step Example 1990 MARDEK A Primer in Probability, Second Edition, Revised and Expanded 1989 MARDEK Mauch & Birch, Guide to the Successful Thesis and Dissertation, Conception to Publication: A Handbook for Students and Faculty, Second Edition 1989 MARDEK Pavel, Fundamentals of Pattern Recognition 1986 MARDEK Jeter, Mathematical Programming: An Introduction to Optimization 1983 MARDEK Kotz & Stroup, Educated Guessing: How to Cope in an Uncertain World 1982 261 MATHANN Lenstra & Lenstra & Lovasz, Factoring Polynomials with Rational Coefficients 1992 111 MATHBIOS Day & McMorris, Interpreting Consensus Sequences Based on Plurality Rule 1992 111 MATHBIOS Sankoff, Efficient Optimal Decomposition of a Sequence into Disjoint Regions, Each Matched to Some Template in an Inventory 1992 109 MATHBIOS Tsuji, A Measure of Spacing in One Dimension 1991 105 MATHBIOS Soler & Jankowski, Modeling RNA Secondary Structures I. Mathematical Structural Model for Predicting RNA Secondary Structures 1991 105 MATHBIOS Soler & Jankowski, Modeling RNA Secondary Structures II. The Geometric Structural Solution for tRNA 1990 100 MATHBIOS Nussinov & Shapiro & Le & Maizel, Speeding Up the Dynamic Algorithm for Planar RNA Folding 1990 98 MATHBIOS Hein, Reconstructing Evolution of Sequences Subject to Recombination Using Parsimony 1997 66 MATHCOMP Berczes & Hajdu, Computational Experiences on the Distances of Polynomials to Irreducible Polynomials 1996 65 MATHCOMP Bach & Peralta, Asymptotic Semismoothness Probabilities 1996 65 MATHCOMP Bach & Sorenson, Explicit Bounds for Primes in Residue Classes 1996 65 MATHCOMP Bach & Lukes & Shallit & Williams, Results and Estimates on Pseudopowers 1996 65 MATHCOMP Emmerich, Pseudorandom Vector Generation by the Compound Inversive Method 1996 65 MATHCOMP Kato & Wu & Yanagihara, The Serial Test for a Nonlinear Pseudorandom Number Generator 1996 65 MATHCOMP Loh & Niebuhr, A New Algorithm for Constructing Large Carmichael Numbers 1996 65 MATHCOMP Erdos & Lewin, d-complete Sequences of Integers 1996 65 MATHCOMP Smith, A Multiple-Precision Division Algorithm 1996 65 MATHCOMP Eichenauer-Herrmann & Emmerich, Compound Inversive Congruential Pseudorandom Numbers: An Average-Case Analysis 1996 65 MATHCOMP Kato & Wu & Yanagihara, On a Nonlinear Congruential Pseudorandom Number Generator 1996 65 MATHCOMP Deleglise & Rivat, Computing pi(x): The Meissel, Lehmer, Lagarias, Miller, Odlyzko Method 1996 65 MATHCOMP Burthe, Further Investigations with the Strong Probable Prime Test 1995 64 MATHCOMP Iyanaga, A Recursive Method to Calculate the Number of Solutions of Quadratic Equations over Finite Fields 1995 64 MATHCOMP Franco & Pomerance, On a Conjecture of Crandall Concerning the qx+1 Problem 1995 64 MATHCOMP Pritchard & Moran & Thyssen, Twenty-two Primes in Arithmetic Progression 1995 64 MATHCOMP Ziv, Converting Approximate Error Bounds into Exact Ones 1995 64 MATHCOMP Niederreiter, Pseudorandom Vector Generation by the Multiple-Recursive Matrix Method 1995 64 MATHCOMP Niederreiter & Gottfert, On a New Factorization Algorithm for Polynomials over Finite Fields 1995 64 MATHCOMP Arnault, Rabin-Miller Primality Test: Composite Numbers Which Pass It 1995 64 MATHCOMP Dilcher & Skula, A New Criterion for the First Case of Fermat's Last Theorem 1995 64 MATHCOMP Applegate & Lagarias, Density Bounds for the 3x+1 Problem. I. Tree-Search Method 1995 64 MATHCOMP Applegate & Lagarias, Density Bounds for the 3x+1 Problem. II. Krasikov Inequalities 1994 63 MATHCOMP McKee, Computing Division Polynomials 1994 63 MATHCOMP Eichenauer-Herrmann, On Generalized Inversive Congruential Pseudorandom Numbers 1994 63 MATHCOMP Brent, On the Periods of Generalized Fibonacci Recurrences 1994 63 MATHCOMP Schlafly & Wagon, Carmichael's Conjecture on the Euler Function is Valid below 10^10,000,000 1994 62 MATHCOMP Eichenauer-Herrmann, Improved Lower Bounds for the Discrepancy of Inversive Congruential Pseudorandom Numbers 1994 62 MATHCOMP Eichenauer-Herrmann & Ickstadt, Explicit Inversive Congruential Pseudorandom Numbers with Power of Two Modulus 1994 62 MATHCOMP Niederreiter, Factoring Polynomials over Finite Fields Using Differential Equations and Normal Bases 1993 61 MATHCOMP Clausen & Baum, Fast Fourier Transforms for Symmetric Groups: Theory and Implementation 1993 61 MATHCOMP Mignotte & Tzanakis, Arithmetical Study of a Certain Ternary Recurrence and Related Questions 1993 61 MATHCOMP Jaeschke, On Strong Pseudoprimes to Several Bases 1993 61 MATHCOMP Sinisalo, Checking the Goldbach Conjecture up to 4 x 10^11 1993 61 MATHCOMP Adleman & DeMarrais, A Subexponential Algorithm for Discrete Logarithms over All Finite Fields 1993 61 MATHCOMP Atkin & Morain, Elliptic Curves and Primality Proving 1993 61 MATHCOMP Bach & Huelsbergen, Statistical Evidence for Small Generating Sets 1993 61 MATHCOMP Damgard & Landrock & Pomerance, Average Case Error Estimates for the Strong Probable Prime Test 1993 61 MATHCOMP Deshouillers & Granville & Narkiewicz & Pomerance, An Upper Bound in Goldbach's Problem 1993 61 MATHCOMP Lenstra & Shallit, Continued Fractions and Linear Recurrences 1993 61 MATHCOMP Odlyzko, Iterated Absolute Values of Differences of Consecutive Primes 1993 61 MATHCOMP Rumely, Numerical Computations Concerning the ERH 1993 60 MATHCOMP Wang & Compagner, On the Use of Reducible Polynomials as Random Number Generators 1992 58 MATHCOMP de Boor & Ron, Computational Aspects of Polynomial Interpolation in Several Variables 1992 58 MATHCOMP Eichenauer-Herrmann & Niederreiter, Lower Bounds for the Discrepancy of Inversive Congruential Pseudorandom Numbers with Power of Two Modulus 1992 58 MATHCOMP Goldfeld, On the Computational Complexity of Modular Symbols 1992 58 MATHCOMP Traub & Wozniakowski, The Monte Carlo Algorithm with a Pseudorandom Generator 1992 58 MATHCOMP Shoup, Searching for Primitive Roots in Finite Fields 1991 57 MATHCOMP L'Ecuyer & Tezuka, Structural Properties for Two Classes of Combined Random Number Generators 1991 57 MATHCOMP Gordon & Pomerance, The Distribution of Lucas and Elliptic Pseudoprimes 1991 56 MATHCOMP Steidl & Tasche, A Polynomial Approach to Fast Algorithms for Discrete Fourier-Cosine and Fourier-Sine Transforms 1991 56 MATHCOMP Eichenauer-Herrmann, Inversive Congruential Pseudorandom Numbers Avoid the Planes 1991 56 MATHCOMP Lenstra, Finding Isomorphisms between Finite Fields 1990 MATHCOMP Babai & Ronyai, Computing Irreducible Representations of Finite Groups 1990 MATHCOMP Demetriou, A Characterization Theorem for the Discrete Best Monotonic Approximation Problem 1990 MATHCOMP Niederreiter, Lower Bounds for the Discrepancy of Inversive Congruential Pseudorandom Numbers 1990 MATHCOMP Mitchell, Error Estimates Arising from Certain Pseudorandom Sequences in a Quasi-random Search Method 1990 MATHCOMP Bach, Explicit Bounds for Primality Testing and Related Problems 1990 54 MATHCOMP Teitelbaum, The Computational Complexity of the Resolution of Plane Curve Singularities 1990 54 MATHCOMP Montgomery & Silverman, An FFT Extension to the P-1 Factoring Algorithm 1990 54 MATHCOMP Fishman, Multiplicative Congruential Random Number Generators with Modulus 2^beta: An Exhaustive Analysis for beta = 32 and a Partial Analysis for beta = 48 1990 54 MATHCOMP Blecksmith & Brillhart & Gerst, On the mod 2 Reciprocation of Infinite Modular-Part Products and the Parity of Certain Partition Functions 1990 54 MATHCOMP Cohen, On an Integer's Infinitary Divisors 1990 54 MATHCOMP Shoup, New Algorithms for Finding Irreducible Polynomials Over Finite Fields 1990 54 MATHCOMP Just, Integer Relations Among Algebraic Numbers 1989 53 MATHCOMP Kaltofen & Rolletschek, Computing Greatest Common Divisors and Factorizations in Quadratic Number Fields 1989 53 MATHCOMP Kim & Pomerance, The Probability that a Random Probable Prime is Composite 1989 MATHCOMP Afflerbach & Weilbacher, The Exact Determination of Rectangle Discrepancy for Linear Congruential Pseudorandom Numbers 1989 MATHCOMP Pintz & Steiger & Szemeredi, Infinite Sets of Primes with Fast Primality Tests and Quick Generation of Large Primes 1989 MATHCOMP Smith, Efficient Multiple-Precision Evaluation of Elementary Functions 1989 MATHCOMP Niederreiter, The Serial Test for Congruential Pseudorandom Numbers Generated by Inversions 1989 MATHCOMP Eichenauer-Herrmann & Grothe & Lehn, On the Period Length of Pseudorandom Vector Sequences Generated by Matrix Generators 1989 MATHCOMP Bach & Shallit, Factoring with Cyclotomic Polynomials 1989 MATHCOMP Young & Potler, First Occurrence Prime Gaps 1987 MATHCOMP Silverman, The Multiple Polynomial Quadratic Sieve 1987 48 MATHCOMP Pomerance, Very Short Primality Proofs 1987 48 MATHCOMP Koblitz, Elliptic Curve Cryptosystems 1987 48 MATHCOMP Adleman & Estes & McCurley, Solving Bivariate Quadratic Congruences in Random Polynomial Time 1987 48 MATHCOMP Cohen & Lenstra, Implementation of a New Primality Test 1987 48 MATHCOMP Cohen & Lenstra, Supplement to ``Implementation of a New Primality Test'' 1987 48 MATHCOMP Montgomery, Speeding the Pollard and Elliptic Curve Methods of Factorization 1985 44 MATHCOMP Schoof, Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p 1984 42 MATHCOMP Cohen & Lenstra, Primality Testing and Jacobi Sums 1984 42 MATHCOMP Lenstra, Divisors in Residue Classes 1976 30 MATHCOMP Anshel, Decision Problems for HNN Groups and Vector Addition Systems 1991 22 MATHED Dubeau, Cauchy and Mathematical Induction 1991 22 MATHED Clements, Teaching Topics in Numerical Linear Algebra Using Spreadsheets 1991 22 MATHED Singh, Philosophy of Mathematics: An Outlook 1991 22 MATHED Pitcher, Visualization in Linear Algebra 1991 22 MATHED Fassler, A Computer Approach to Number Theory 1991 22 MATHED English & O'Donoghue & Bajpai, A Proposal for the Self-Empowered Mathematics Teacher 1990 21 MATHED Healy & Sutherland, The Use of Spreadsheets within the Mathematics Classroom 1990 21 MATHED Hubbard, Tertiary Mathematics without Lectures 1990 21 MATHED Dolgos, Discrete Mathematics in the High School Curriculum 1990 21 MATHED Stern, Menstrual Cycle Analysis: A Problem in Pattern Recognition 1990 21 MATHED Dreyfus & Eisenberg, Polynomials: A Theme which Should not be Forgotten 1990 21 MATHED Emenalo & Okpara, A Study Guide for Mathematics Students 1989 20 MATHED Brinn, Boolean Algebra 1989 20 MATHED Spresser, The Travelling Salesman Problem: Selected Algorithms and Heuristics 1989 20 MATHED Burrows, Measures of Information and Uncertainty 1989 20 MATHED Kreith, Euclid Turns to Probability 1988 19 MATHED Malaty, What is Wrong with the `Back-to-Basics' Movement, and What was Wrong with the `New-Math' Movement 1987 18 MATHED Leron & Eisenberg, On a Knowledge-Related Paradox and its Resolution 1987 18 MATHED Briginshaw, Myth and Reality in Teaching Undergraduate Mathematics 1996 80 MATHGAZ Hoare, A Survey of Mathematical Logic, Part II: Post-1931 1995 79 MATHGAZ Brown & Porter, The Methodology of Mathematics 1995 79 MATHGAZ Simons, Approximate Matrix Inversion 1994 78 MATHGAZ Wichmann, An Encyclopedia of Tiling Patterns 1994 78 MATHGAZ Knuth, Leaper Graphs 1994 78 MATHGAZ Jones & Wiegold, The Palindrome Problem in Base 2 1993 77 MATHGAZ MacMillan, Which Computer Language? 1988 72 MATHGAZ Johnson, Choice of Programming Language for Schools--(2) 1987 71 MATHGAZ Anderson, Struggling with the 3x + 1 Problem 1995 MATHGEN Haussler & Warmuth, The Probably Approximately Correct (PAC) and Other Learning Models 1995 MATHGEN Haussler, Decision Theoretic Generalizations of the PAC Model for Neural Net and Other Learning Applications 1995 MATHGEN Wolpert, The Relationship Between PAC, the Statistical Physics Framework, the Bayesian Framework, and the VC Framework 1997 19 MATHINT Bailey & Borwein & Borwein & Plouffe, The Quest for Pi 1997 19 MATHINT Velleman, Fermat's Last Theorem and Hilbert's Program 1996 18 MATHINT Koblitz, The Case Against Computers in K-13 Math Education (Kindergarten through Calculus) 1996 18 MATHINT Dubinsky & Noss, Some Kinds of Computers for Some Kinds of Learning: A Reply to Koblitz 1996 18 MATHINT Kantor, Hilbert's Problems and Their Sequels 1995 17 MATHINT Arnold, Will Mathematics Survive? Report on the Zurich Congress 1995 17 MATHINT Gale & Propp & Sutherland & Troubetzkoy, Further Travels with My Ant 1995 17 MATHINT Milnor, A Nobel Prize for John Nash 1995 17 MATHINT Mullen, A Candidate for the ``Next Fermat Problem'' 1995 17 MATHINT Shallit & Williams & Morain, Discovery of a Lost Factoring Machine 1995 17 MATHINT Baer, ET and an Infinitary Church's Thesis 1995 17 MATHINT Bell, Infinitesimals and the Continuum 1994 16 MATHINT Traub & Werschulz, Linear Ill-Posed Problems Are Solvable on the Average for All Gaussian Measures 1994 16 MATHINT Landau, How to Tangle with a Nested Radical 1994 16 MATHINT Propp, Further Ant-ics 1994 16 MATHINT Gale, The Return of the Jeep 1994 16 MATHINT Shub, Mysteries of Mathematics and Computation 1993 15 MATHINT Sagan, A Geometrization of Lebesgue's Space-Filling Curve 1993 15 MATHINT Nelson, Taking Formalism Seriously 1993 15 MATHINT Toussaint, A New Look at Euclid's Second Proposition 1993 15 MATHINT Loxton, review of Koblitz, A Course in Number Theory and Cryptography (Springer-Verlag, 1987) 1993 15 MATHINT Canfield, review of Wilf, Generatingfunctionology (Academic Press, 1990) 1993 15 MATHINT Henriksen, There Are Too Many B. A. D. Mathematicians 1993 15 MATHINT Gale, Mathematical Entertainments (dividing a cake) 1993 15 MATHINT Guy, review of Graham & Rothschild & Spencer, Ramsey Theory, Second Edition (Wiley, 1990) 1992 14 MATHINT Matijasevich, My Collaboration with Julia Robinson 1992 14 MATHINT Morgan, Minimal Surfaces, Crystals, Shortest Networks, and Undergraduate Research 1992 14 MATHINT McCarthy, Catalan Numbers (letter) 1992 14 MATHINT Hanlon, Order and Disorder in Algebraic Combinatorics 1992 14 MATHINT Akin, The Spiteful Computer: A Determinism Paradox 1992 14 MATHINT Birkhoff & Mac Lane, A Survey of Modern Algebra: The Fiftieth Anniversary of its Publication 1992 14 MATHINT Roitman, The Uses of Set Theory 1991 13 MATHINT Cohen & Stewart, The Information in Your Hand 1991 13 MATHINT Calderbank, The Mathematics of Modems 1990 12 MATHINT Protter, Calculus Reform 1990 12 MATHINT Wells, Are These the Most Beautiful? 1990 12 MATHINT Sumners, Untangling DNA 1990 12 MATHINT Zalcman, review of Kac & Rota & Schwartz, Discrete Thoughts: Essays on Mathematics, Science and Philosophy (1986) 1990 12 MATHINT Lam, How Reliable Is a Computer-Based Proof? 1990 12 MATHINT Priestley, Mathematics and Poetry: How Wide the Gap? 1990 12 MATHINT Sallows, A Curious New Result in Switching Theory 1990 12 MATHINT Peter, Mathematics Is Beautiful 1990 12 MATHINT Morris & Harkleroad, Rozsa Peter: Recursive Function Theory's Founding Mother 1990 12 MATHINT Baker, Some Topological Problems in Robotics 1989 11 MATHINT Krantz, Fractal Geometry 1989 11 MATHINT Mandelbrot, Some ``Facts'' That Evaporate Upon Examination 1989 11 MATHINT Devlin & Douglas & Hirsch & Gleick & Mandelbrot & Franks, discussion of Gleick, Chaos 1989 11 MATHINT DeTurck, Sphere and Torus Music (includes phonograph record) 1989 11 MATHINT Gale, The Truth and Nothing But the Truth 1989 11 MATHINT Rosenfeld & Melter, Digital Geometry 1989 11 MATHINT Mac Lane, Paradise Lost: The Troubled Government Support of Science 1989 11 MATHINT Sutner, Linear Cellular Automata and the Garden-of-Eden 1989 11 MATHINT Ciesielski, How Good Is Lebesgue Measure? 1989 11 MATHINT Franks, review of Gleick (1987) 1988 10 MATHINT French, The Banach-Tarski Theorem 1988 10 MATHINT Snapper, What Do We Do When We Do Mathematics? 1988 10 MATHINT Ram Murty, Artin's Conjecture for Primitive Roots 1988 10 MATHINT Smorynski, Against Mac Lane 1988 10 MATHINT Mac Lane, To the Greater Health of Mathematics 1988 10 MATHINT Berndt, Ramanujan--100 Years Old (Fashioned) or 100 Years New (Fangled)? 1988 10 MATHINT Saari, Symmetry, Voting, and Social Choice 1988 10 MATHINT Cipra, Andy Rooney, Ph. D. 1988 10 MATHINT Muir, The Psychology of Mathematical Creativity 1987 9 MATHINT Hoffman, The Computer-Aided Discovery of New Embedded Minimal Surfaces 1987 9 MATHINT Ralston, Questions about Precollege Mathematics Education 1987 9 MATHINT Strang, Karmarkar's Algorithm and Its Place in Applied Mathematics 1986 8 MATHINT Mac Lane, Are We All Just Specialists? 1986 8 MATHINT Halmos, I Want to be a Mathematician (Excerpts) 1986 8 MATHINT Wagon, Primality Testing 1986 8 MATHINT Abikoff, TeX review 1986 8 MATHINT Steen, Living with a New Mathematical Species 1986 8 MATHINT Harnik, Infinitesimals from Leibniz to Robinson: Time to Bring Them Back to School 1986 8 MATHINT Appel & Haken, The Four Color Proof Suffices 1986 8 MATHINT Schenitzer, Some Thoughts on the Teaching of Mathematics 1986 8 MATHINT Dijkstra, On a Cultural Gap 1986 8 MATHINT Wagon, Fermat's Last Theorem 1985 7 MATHINT Wagon, Bin-Packing 1984 6 MATHINT Ewing, A Breach of Etiquette (editorial) 1982 4 MATHINT Piranian, Say It Better 1982 4 MATHINT Halmos, Think It Gooder 1997 70 MATHMAG Peifer, An Introduction to Combinatorial Group Theory and the Word Problem 1997 70 MATHMAG Fan & Poonen & Poonen, How to Spread Rumors Fast 1996 69 MATHMAG Ramnath & Scully, Moving Card i to Position j with Perfect Shuffles 1995 68 MATHMAG Guiasu, Is There Any Regularity in the Distribution of Prime Numbers at the Beginning of the Sequence of Positive Integers? 1995 68 MATHMAG Young & Taylor & Zwicker, Counting Quota Systems: A Combinatorial Question from Social Choice Theory 1995 68 MATHMAG Erbas & Tanik, Generating Solutions to the N-Queens Problem Using 2-Circulants 1995 68 MATHMAG Schielack, Math Bite: A Quick Counting Proof of the Irrationality of k^{1/n} 1995 68 MATHMAG Bloom, A One-Sentence Proof That sqrt(2) Is Irrational 1994 67 MATHMAG Burns, Convolutions and Computer Graphics 1994 67 MATHMAG Schilling, The Importance of a Game 1994 67 MATHMAG Sayrafiezadeh, The Birthday Problem Revisited 1994 67 MATHMAG Kiltinen, How Few Transpositions Suffice?...You Already Know! 1993 66 MATHMAG Wong, The Prisoner's Dilemma 1992 65 MATHMAG Wardlaw, Euler's Theorem for Polynomials 1992 65 MATHMAG Fialkow & Salas, Data Exchange and Permutation Length 1990 63 MATHMAG Kalman, Reading a Bus-Connected Processor Array 1990 63 MATHMAG Quine, Elementary Proof That Some Angles Cannot Be Trisected by Ruler and Compass 1990 63 MATHMAG Brill & Stueben, Demystifying the Projective Plane 1989 62 MATHMAG Alon & Liu, An Application of Set Theory to Coding Theory 1989 62 MATHMAG Chung & Gardner & Graham, Steiner Trees on a Checkerboard 1988 61 MATHMAG Niven, Coding Theory Applied to a Problem of Ulam 1987 60 MATHMAG Danzer & Grunbaum & Shephard, Equitransitive Tilings, or How to Discover New Mathematics 1987 60 MATHMAG Medvedoff & Morrison, Groups of Perfect Shuffles 1995 56 MATHNASUSSR Solov'ev, Computability by Nondeterministic Program and the Moschovakis Search Computability 1994 55 MATHNASUSSR Nechaev, Complexity of a Determinate Algorithm for the Discrete Logarithm 1994 55 MATHNASUSSR Pavlov, Arithmetic Problems of Combinatorial Analysis 1992 51 MATHNASUSSR Selivanov, Precomplete Numberings and Functions without Fixed Points 1991 48 MATHNASUSSR Afanas'ev, Local Time of a Random Walk up to the First Passage to the Semiaxis 1991 48 MATHNASUSSR Borodin, Generalization of a Theorem of Kotzig and a Prescribed Coloring of the Edges of Planar Graphs 1991 48 MATHNASUSSR Razborov, Lower Bounds of the Complexity of Symmetric Boolean Functions of Contact-Rectifier Circuits 1990 47 MATHNASUSSR Krupskii, Efficient Coding of Approximations of Real Numbers 1990 46 MATHNASUSSR Grigor'ev, Complexity of Computations in Commutative Division of the USSR Academy of Sciences 1989 44 MATHNASUSSR Ablaev, Influence of the Degree of Isolation of the Cutpoint on the Number of States of a Probabilistic Automaton 1989 44 MATHNASUSSR Shtogrin, Action Centers of Planigons 1987 41 MATHNASUSSR Razborov, Lower Bounds on the Size of Bounded Depth Circuits over a Complete Basis with Logical Addition 1981 28 MATHNASUSSR Bel'tyukov, Hierarchy of Complexity of Computation of Partial Functions with Values 0 and 1 1992 57 MATHPROG Adler & Beling, Polynomial Algorithms for LP over a Subring of the Algebraic Integers with Applications to LP with Circulant Matrices 1992 57 MATHPROG Al-Sultan & Murty, Exterior Point Algorithms for Nearest Points and Convex Quadratic Programs 1992 57 MATHPROG Atkinson & Vaidya, A Scaling Technique for Finding the Weighted Analytic Center of a Polytope 1992 57 MATHPROG Du & Zhang, On Better Heuristics for Steiner Minimum Trees 1992 57 MATHPROG Gritzmann & Klee, Deciding Uniqueness in Norm Maximization 1992 57 MATHPROG Kamath & Karmarkar & Ramakrishnan & Resende, A Continuous Approach to Inductive Inference 1992 57 MATHPROG Sun & Qi, An Interior Point Algorithm of O(sqrt(m)|ln epsilon|) Iterations for C^1-Convex Programming 1992 57 MATHPROG Tovey, A Polynomial-Time Algorithm for Computing the Yolk in Fixed Dimension 1992 57 MATHPROG Vavasis, Approximation Algorithms for Indefinite Quadratic Programming 1992 57 MATHPROG Wasilkowski, On Average Complexity of Global Optimization Problems 1992 57 MATHPROG Ye, On the Finite Convergence of Interior-Point Algorithms for Linear Programming 1992 57 MATHPROG Pardalos & Vavasis, Open Questions in Complexity Theory for Numerical Optimization 1992 56 MATHPROG Mitchell & Todd, Solving Combinatorial Optimization Problems Using Karmarkar's Algorithm 1992 56 MATHPROG Wallacher & Zimmerman, A Combinatorial Interior Point Method for Network Flow Problems 1992 56 MATHPROG Chang & McCormick, A Hierarchical Algorithm for Making Sparse Matrices Sparser 1992 56 MATHPROG Mizuno, A New Polynomial Time Method for a Linear Complementarity Problem 1992 55 MATHPROG Wood, The Bisection Method in Higher Dimensions 1992 55 MATHPROG Grotschel & Win, A Cutting Plane Algorithm for the Windy Postman Problem 1992 55 MATHPROG Hochbaum & Shamir & Shanthikumar, A Polynomial Algorithm for an Integer Quadratic Non-separable Transportation Problem 1992 55 MATHPROG Dyer & Frieze, Probabilistic Analysis of the Generalised Assignment Problem 1992 55 MATHPROG Korach & Penn, Tight Integral Duality Gap in the Chinese Postman Problem 1992 55 MATHPROG Klein & Luss & Smith, A Lexicographic Minimax Algorithm for Multiperiod Resource Allocation 1992 55 MATHPROG Roy & Wallenius, Nonlinear Multiple Objective Optimization: An Algorithm and Some Theory 1992 54 MATHPROG Vavasis, Local Minima for Indefinite Quadratic Knapsack Problems 1992 54 MATHPROG Bland & Jensen, On the Computational Behavior of a Polynomial-Time Network Flow Algorithm 1992 54 MATHPROG Orlin & Ahuja, New Scaling Algorithms for the Assignment and Minimum Mean Cycle Problems 1992 54 MATHPROG Rothblum, Characterization of Stable Matchings as Extreme Points of a Polytope 1992 54 MATHPROG Barnes & Hoffman & Rothblum, Optimal Partitions Having Disjoint Convex and Conic Hulls 1992 54 MATHPROG Lai & Wu, Extremal Points and Optimal Solutions for General Capacity Problems 1992 54 MATHPROG Billionnet & Sutter, Persistency in Quadratic 0-1 Optimization 1992 53 MATHPROG Ahuja & Goldberg & Orlin & Tarjan, Finding Minimum-Cost Flows by Double Scaling 1992 53 MATHPROG Tseng, Complexity Analysis of a Linear Complementarity Algorithm based on a Lyapunov Function 1992 53 MATHPROG Zabinsky & Smith, Pure Adaptive Search in Global Optimization 1992 53 MATHPROG Thach, A Decomposition Method Using a Pricing Mechanism for Min Concave Cost Flow Problems with a Hierarchical Structure 1992 53 MATHPROG Fonlupt & Naddef, The Traveling Salesman Problem in Graphs with Some Excluded Minors 1992 53 MATHPROG Fischetti & Toth, An Additive Bounding Procedure for the Asymmetric Travelling Salesman Problem 1992 53 MATHPROG Potters & Curiel & Tijs, Traveling Salesman Games 1992 53 MATHPROG Fourer, A Simplex Algorithm for Piecewise-Linear Programming III: Computational Analysis and Applications 1991 52 MATHPROG Freund, A Potential-Function Reduction Algorithm for Solving a Linear Program Directly from an Infeasible ``Warm Start'' 1991 52 MATHPROG Kovacevic-Vujcic, Improving the Rate of Convergence of Interior Point Methods for Linear Programming 1991 52 MATHPROG den Hertog & Roos, A Survey of Search Directions in Interior Point Methods for Linear Programming 1991 52 MATHPROG Karmarkar & Ramakrishnan, Computational Results of an Interior Point Algorithm for Large Scale Linear Programming 1991 52 MATHPROG Karmarkar & Resende & Ramakrishnan, An Interior Point Algorithm to Solve Computationally Difficult Set Covering Problems 1991 52 MATHPROG Gonzaga, Interior Point Algorithms for Linear Programming with Inequality Constraints 1991 52 MATHPROG Hansen & Jaumard & Lu, An Analytical Approach to Global Optimization 1991 52 MATHPROG Padberg & Sung, An Analytical Comparison of Different Formulations of the Travelling Salesman Problem 1991 52 MATHPROG Goldberg & Grigoriadis & Tarjan, Use of Dynamic Trees in a Network Simplex Algorithm for the Maximum Flow Problem 1991 52 MATHPROG Bayer & Lagarias, Karmarkar's Linear Programming Algorithm and Newton's Method 1991 52 MATHPROG Dekkers & Aarts, Global Optimization and Simulated Annealing 1991 52 MATHPROG Pitowsky, Correlation Polytopes: Their Geometry and Complexity 1991 52 MATHPROG Tani & Tsukiyama & Shinoda & Shirakawa, On Area-efficient Drawings of Rectangular Duals for VLSI Floor-plan 1991 52 MATHPROG Hansen & Madsen & Nielsen, Optimization of Pipe Networks 1991 52 MATHPROG Aurenhammer, Using Gale Transforms in Computational Geometry 1991 51 MATHPROG Naddef & Rinaldi, The Symmetric Traveling Salesman Problem Polytope and its Graphical Relaxation: Composition of Valid Inequalities 1991 51 MATHPROG Gotschel & Holland, Solution of Large-scale Symmetric Travelling Salesman Problems 1991 51 MATHPROG Freund, Polynomial-time Algorithms for Linear Programming based only on Primal Scaling and Projected Gradients of a Potential Function 1991 51 MATHPROG Paparrizos, An Infeasible (Exterior Point) Simplex Algorithm for Assignment Problems 1991 51 MATHPROG Brown, Solving Knapsack Sharing Problems with General Tradeoff Functions 1991 51 MATHPROG Werman & Magagnosc, The Relationship between Integer and Real Solutions of Constrained Convex Programming 1991 50 MATHPROG Adler & Karmarkar & Resende & Veiga, Errata: ``An Implementation of Karmarkar's Algorithm for Linear Programming'' 1991 49 MATHPROG Goldfarb & Liu, An O(n^3 L) Primal Interior Point Algorithm for Convex Quadratic Programming 1991 49 MATHPROG More & Vavasis, On the Solution of Concave Knapsack Problems 1991 49 MATHPROG Lustig, Feasibility Issues in a Primal-Dual Interior-Point Method for Linear Programming 1991 49 MATHPROG Boyd & Pulleyblank, Optimizing over the Subtour Polytope of the Travelling Salesman Problem 1991 49 MATHPROG Powell & Yuan, A Trust Region Algorithm for Equality Constrained Optimization 1990 49 MATHPROG Blair, Representation for Multiple Right-hand Sides 1990 49 MATHPROG Gonzaga, Polynomial Affine Algorithms for Linear Programming 1990 47 MATHPROG Anstreicher, A Standard Form Variant, and Safeguarded Linesearch, for the Modified Karmarkar Algorithm 1990 47 MATHPROG Goldfarb & Hao, A Primal Simplex Algorithm that Solves the Maximum Flow Problem in at Most nm Pivots and O(n^2 m) time 1990 47 MATHPROG Cook & Kannan & Schrijver, Chvatal Closures for Mixed Integer Programming Problems 1990 47 MATHPROG Vaidya, An Algorithm for Linear Programming which Requires O((m+n)n^2+(m+n)^{1.5}n)L) Arithmetic Operations 1990 47 MATHPROG Padberg & Rinaldi, Facet Identification for the Symmetric Traveling Salesman Polytope 1990 47 MATHPROG Granot & Skorin-Kapov, Some Proximity and Sensitivity Results in Quadratic Integer Programming 1990 47 MATHPROG Ye & Todd, Containing and Shrinking Ellipsoids in the Path-Following Algorithm 1990 47 MATHPROG Cook, Cutting-Plane Proofs in Polynomial Space 1990 47 MATHPROG Padberg & Rinaldi, An Efficient Algorithm for the Minimum Capacity Cut Problem 1990 47 MATHPROG Orlin & Vande Vate, Solving the Linear Matroid Parity Problem as a Sequence of Matroid Intersection Problems 1990 46 MATHPROG Lenstra & Shmoys & Tardos, Approximation Algorithms for Scheduling Unrelated Parallel Machines 1990 46 MATHPROG Conn & Cornuejols, A Projection Method for the Uncapacitated Facility Location Problem 1990 46 MATHPROG McDiarmid, On the Improvement per Iteration in Karmarkar's Algorithm for Linear Programming 1990 46 MATHPROG Pardalos & Kovoor, An Algorithm for a Singly Constrained Class of Quadratic Programs Subject to Upper and Lower Bounds 1990 46 MATHPROG Dyer & Frieze, On Patching Algorithms for Random Asymmetric Travelling Salesman Problems 1990 46 MATHPROG Nemhauser & Wolsey, A Recursive Procedure to Generate All Cuts for 0-1 Mixed Integer Programs 1990 46 MATHPROG Monma & Munson & Pulleyblank, Minimum-Weight Two-Connected Spanning Networks 1990 46 MATHPROG Asic & Kovacevic-Vujcic & Radosavljevic-Nicolic, Asymptotic Behaviour of Karmarkar's Method for Linear Programming 1990 46 MATHPROG Granot & Skorin-Kapov, Towards a Strongly Polynomial Algorithm for Strictly Convex Quadratic Programs: An Extension of Tardos' Algorithm 1990 46 MATHPROG Meanti & Kan & Stougie & Vercellis, A Probabilistic Analysis of the Multiknapsack Value Function 1990 46 MATHPROG Ye, A ``Build-Down'' Scheme for Linear Programming 1990 46 MATHPROG Kalantari, Karmarkar's Algorithm with Improved Steps 1989 45 MATHPROG Carpaneto & Fischetti & Toth, New Lower Bounds for the Symmetric Travelling Salesman Problem 1989 44 MATHPROG Anderson & Lewis, An Extension of the Simplex Algorithm for Semi-infinite Linear Programming 1989 44 MATHPROG Leung & Magnanti, Valid Inequalities and Facets of the Capacitated Plant Location Problem 1989 44 MATHPROG Adler & Resende & Veiga & Karmarkar, An Implementation of Karmarkar's Algorithm for Linear Programming 1989 44 MATHPROG Ye & Tse, An Extension of Karmarkar's Projective Algorithm for Convex Quadratic Programming 1989 44 MATHPROG Sassano, On the Facial Structure of the Set Covering Polytope 1989 44 MATHPROG Dyer & Frieze, A Randomized Algorithm for Fixed-dimensional Linear Programming 1989 44 MATHPROG Kern, A Probabilistic Analysis of the Switching Algorithm for the Euclidean TSP 1989 44 MATHPROG de Werra, Generalized Edge Packings 1989 44 MATHPROG Kojima & Mizuno & Yoshise, A Polynomial-time Algorithm for a Class of Linear Complementary Problems 1989 44 MATHPROG Monteiro & Adler, Interior Path Following Primal-Dual Algorithms. Part I: Linear Programming 1989 44 MATHPROG Monteiro & Adler, Interior Path Following Primal-Dual Algorithms. Part II: Convex Quadratic Programming 1989 44 MATHPROG Win, On the Windy Postman Problem on Eulerian Graphs 1989 43 MATHPROG Ferris & Philpott, An Interior Point Algorithm for Semi-infinite Linear Programming 1989 43 MATHPROG Gonzaga, Conical Projection Algorithms for Linear Programming 1988 42 MATHPROG Brezovec & Cornuejols & Glover, A Matroid Algorithm and Its Application to the Efficient Solution of Two Optimization Problems on Graphs 1988 42 MATHPROG Frank & Tardos, Generalized Polymatroids and Submodular Flows 1988 41 MATHPROG Shanno, Computing Karmarkar Projections Quickly 1988 41 MATHPROG Todd, Exploiting Special Structure in Karmarkar's Linear Programming Algorithm 1988 40 MATHPROG Han, A Successive Projection Method 1988 40 MATHPROG Bard, Convex Two-level Optimization 1988 40 MATHPROG Imai, On the Convexity of the Multiplicative Version of Karmarkar's Potential Function 1988 40 MATHPROG Renegar, A Polynomial-Time Algorithm, Based on Newton's Method, for Linear Programming 1988 40 MATHPROG Gay, Erratum: ``A Variant of Karmarkar's Linear Programming Algorithm for Problems in Standard Form'' by D. M. Gay 1988 40 MATHPROG Goldfarb & Mehrotra, A Relaxed Revision of Karmarkar's Method 1987 39 MATHPROG Bixby & Marcotte & Trotter, Packing and Covering with Integral Feasible Flows in Integral Supply-Demand Networks 1987 39 MATHPROG Balakrishnan, LP Extreme Points and Cuts for the Fixed-Charge Network Design Problem 1987 39 MATHPROG Ye & Kojima, Recovering Optimal Dual Solutions in Karmarkar's Polynomial Algorithm for Linear Programming 1987 39 MATHPROG Dennis & Morshedi & Turner, A Variable-Metric Variant of the Karmarkar Algorithm for Linear Programming 1987 39 MATHPROG de Ghellinck & Vial, An Extension of Karmarkar's Algorithm for Solving a System of Linear Homogeneous Equations on the Simplex 1987 38 MATHPROG Bouchet, Greedy Algorithm and Symmetric Matroids 1987 38 MATHPROG Drezner, On the Complexity of the Exchange Algorithm for Minimax Optimization Problems 1987 37 MATHPROG Gay, A Variant of Karmarkar's Linear Programming Algorithm for Problems in Standard Form 1987 31 MATHPSTUDY Tomlin, An Experimental Approach to Karmarkar's Projective Method for Linear Programming 1991 MATHREVLN Johnson, An Introduction to the Mathematical Revolution Inspired by Computing 1991 MATHREVLN Piper, Cryptography--The Catalyst 1991 MATHREVLN Evans, The Return of the Visual 1991 MATHREVLN Arrowsmith, The Mathematics of Chaos 1991 MATHREVLN Holden, Computing The Unpredictable: Deterministic Chaos and The Nervous System 1991 MATHREVLN Epstein, Word Processing Algorithms, Rewrite Rules and Group Theory 1991 MATHREVLN Burstall, Computer Assisted Proof for Mathematics: An Introduction Using the LEGO Proof System 1991 MATHREVLN Lu, A New Method of Automated Theorem Proving 1991 MATHREVLN Knott, Making Discrete Mathematics Executable on a Computer 1991 MATHREVLN Norcliffe, The Wider Uses of the Z Specification Language in Mathematical Modelling 1991 MATHREVLN Andrew & Bose & Cosby, Scene Analysis via Galois Lattices 1991 MATHREVLN Johnson, The Mathematics of Complex Systems 1991 MATHREVLN Seidman, The Mathematics of Complex Computational Systems 1991 MATHREVLN Simpson, A Euclidean Basis for Computation 1991 MATHREVLN Sossai, An Extension of Turing Machines 1991 MATHREVLN Greenleaf, Algorithmic Languages and the Computability of Functions 1991 MATHREVLN Rayward-Smith, The Parallel Computation Hypothesis and its Applications to Computer Science 1991 MATHREVLN Fenton, The Mathematics of Complexity in Computing and Software Engineering 1991 MATHREVLN Tse & Whitty, The Mathematics of Calibration 1991 MATHREVLN Hyland, Computing and Foundations 1991 MATHREVLN Beynon & Russ, The Development and Use of Variables in Mathematics and Computer Science 1991 MATHREVLN Ormell, The End of the Defensive Era of Mathematics 1991 MATHREVLN Cooke, Revolution, Evolution or Renaissance? 1991 MATHREVLN Cohen, The Superfluous Paradigm 1990 15 MATHSCI Rota, The Concept of Mathematical Truth 1989 14 MATHSCI Davis & Davis, Fibonacci Numbers and the Golden Mean in Nature 1989 14 MATHSCI Jammalamadaka & Uppuluri, Is p a Prime Number? Some Probabilistic Tests for Primality 1980 6 MATHSCI Smillie, APL as a Mathematical Notation and a Programming Language 1994 27 MATHSPECT Sherrill, A Partial Proof of Fermat's Last Theorem 1994 26 MATHSPECT Cook, Fermat's Last Theorem--A Theorem at Last 1994 26 MATHSPECT Grannell & Griggs, An Introduction to Steiner Systems 1993 26 MATHSPECT Abian & Eslami, A Proof of the Arithmetic-Geometric Mean Inequality 1991 23 MATHSPECT Rosenblatt, Infinity and Geometry 1990 23 MATHSPECT Rosenblatt, Infinity and Enumeration 1990 23 MATHSPECT Hill, Error-Correcting Codes II 1990 22 MATHSPECT Abian, A Simple Proof of a Weaker Form of Stirling's Formula 1990 22 MATHSPECT Hill, Error-Correcting Codes 1988 20 MATHSPECT Stewart, Factorizing Large Numbers 1997 MCGHILL Mitchell, Machine Learning 1994 MCGHILL Quinn, Parallel Computing: Theory and Practice, Second Edition 1993 MCGHILL Ranade & Zamir, The J. Ranade UNIX Primer 1993 MCGHILL Wankat & Oreovicz, Teaching Engineering 1993 MCGHILL Hwang, Advanced Computer Architecture: Parallelism, Scalability, Programmability 1993 MCGHILL Feit, TCP/IP: Architecture, Protocols, and Implementation 1992 MCGHILL Scragg, Computer Organization: A Top-Down Approach 1991 MCGHILL Schildt, C++: The Complete Reference 1967 MCGHILL Szabo & Tanaka, Residue Arithmetic and its Applications to Computer Technology 1992 16 MCMOD Gichev, An Algorithm for Routing Messages between Processing Elements in a Multiprocessor System which Tolerates a Maximal Number of Faulty Links 1992 16 MCMOD Dunn & Fedyna & Peters, Efficient Parallel Implementation of Sequence Analysis Algorithms Using a Global Address Space Model 1992 16 MCMOD Keen & Redgrave & Lawton & Cinkosky & Misra & Fickett & Burks, Access to Molecular Biology Databases 1992 16 MCMOD Barron & Witten & Liu, A Bibliography on Computational Molecular Biology and Genetics 1992 16 MCMOD Egghe, Theory of Search Keys and Applications in Retrieval Techniques Used by Catalogers 1992 16 MCMOD Waissi, A New Karzanov-type O(n^3) Max-Flow Algorithm 1992 16 MCMOD Haessler, One-dimensional Cutting Stock Problems and Solution Procedures 1992 16 MCMOD Lutfiyya & McMillin & Poshyanonda & Dagli, Composite Stock Cutting through Simulated Annealing 1992 16 MCMOD Farley, Limiting the Number of Each Piece in Two-dimensional Cutting Stock Patterns 1992 16 MCMOD Gemmill, Solution to the Assortment Problem via the Genetic Algorithm 1991 15 MCMOD Sjogren, Cycles and Spanning Trees 1990 13 MCMOD Stanfel, New Optimization Models for Designing Synchronizing Codes 1990 13 MCMOD Zhang & Lu, Parallel Algorithms for Some Algebraic Operations on Polynomial Equations 1990 13 MCMOD Gzyl & Jimenez & Quiroz, The Physicist's Approach to the Travelling Salesman Problem--II 1990 13 MCMOD Gamboa & Gzyl, Linear Programming with Maximum Entropy 1990 13 MCMOD King & Zhang & Jin, A Diagonal Completion and 2-optimal Procedure for the Travelling Salesman Problem 1990 13 MCMOD Feiring, An Efficient Procedure for Obtaining Feasible Solutions to the n-City Traveling Salesman Problem 1990 13 MCMOD Cheng & Sin, The NP-Completeness of the n/m/Parallel/C_max Preemptive Due-Date Scheduling Problem 1990 13 MCMOD Feiring, An Efficient Procedure for the N-City Traveling Salesman Problem 1990 13 MCMOD Parthasarathy, Is There a Relation between Sequential Control and Continuous Control? 1989 12 MCMOD Gzyl & Jiminez, The Physicist's Approach to the Travelling Salesman Problem 1983 MCT Apt, Ten Years of Hoare's Logic. A Survey--Part II: Nondeterminism 1983 MCT de Bakker & Zucker, Processes and the Denotational Semantics of Concurrency 1983 MCT Manna & Pnueli, Verification of Concurrent Programs: A Temporal Proof System 1983 MCT Park, The ``Fairness'' Problem and Nondeterministic Computing Networks 1983 MCT Rem, Partially Ordered Computations, with Applications to VLSI Design 1980 MCT Engelfriet, Two-way Automata and Checking Automata 1980 MCT Mehlhorn, Dynamic Data Structures 1980 MCT Meyer & Winklmann, The Fundamental Theorem of Complexity Theory (Preliminary version) 1980 MCT Nivat, Infinite Words, Infinite Trees, Infinite Computations 1980 MCT Pratt, Dynamic Logic 1980 MCT Thatcher & Wagner & Wright, Notes on Algebraic Fundamentals for Theoretical Computer Science 1976 82 MCT Savitch, Three Hardest Problems 1976 81 MCT van Leeuwen, The Complexity of Data Organization 1994 MECKLERMED Abbott (Ed.), Internet World's On Internet 94 1986 MERGING Banchoff, Computer Graphics Applications in Geometry: ``Because the Light is Better over Here'' 1986 MERGING Flanders, Symbolic Manipulation 1986 MERGING Hilton, Teaching and Research: The History of a Pseudoconflict 1986 MERGING Kleitman, Combinatorics and Applied Mathematics 1986 MERGING Nerode, Applied Logic 1991 METHPROG Hesse, Two Metamodels for Application System Development -- Conventional vs. Object-Oriented Approach 1991 METHPROG Partsch & Volker, Another Case Study on Reusability of Transformational Developments Pattern Matching According to Knuth, Morris, and Pratt 1991 METHPROG Pepper, Literate Program Derivation: A Case Study 1991 METHPROG Kloos & Dosch, Transformational Development of Circuit Descriptions for Binary Adders 1996 21 MFCS Clarke & Zhao, Word Level Model Checking 1996 21 MFCS Diekert & Muscholl, Code Problems on Traces 1996 21 MFCS Gibbons & Amos & Hodgson, Models of DNA Computation 1996 21 MFCS Mosses, Theory and Practice of Action Semantics 1996 21 MFCS Mukund & Thiagarajan, Linear Time Temporal Logics over Mazurkiewicz Traces 1996 21 MFCS Peled, Partial Order Reduction: Model-checking Using Representatives 1996 21 MFCS Remmel, Nonmonotonic Rule Systems: Forward Chaining, Constraints, and Complexity 1996 21 MFCS Sannella & Tarlecki, Mind the Gap! Abstract versus Concrete Models of Specifications 1996 21 MFCS Tiuryn, A Sequent Calculus for Subtyping Polymorphic Types 1996 21 MFCS Uspensky, Kolmogorov Complexity: Recent Research in Moscow 1996 21 MFCS Balbiani, A Modal Logic for Data Analysis 1996 21 MFCS Baum & Frias & Haeberer & Lopez, From Specifications to Programs: A Fork-Algebraic Approach to Bridge the Gap 1996 21 MFCS Bednarczyk, Logic of Predicates with Explicit Substitutions 1996 21 MFCS Beigel & Gasarch & Kummer & Martin & McNicholl & Stephan, On the Query Complexity of Sets 1996 21 MFCS Bono & Bugliesi & Liquori, A Lambda Calculus of Incomplete Objects 1996 21 MFCS Boreale & Trevisan, Bisimilarity Problems Requiring Exponential Time 1996 21 MFCS de Bruijn & Nienhuys-Cheng, Linear Dynamic Kahn Networks are Deterministic 1996 21 MFCS Cai & Kloks & Wong, Shortest Path Problems with Time Constraints 1996 21 MFCS Chlebus & Czumaj & Gasieniec & Kowaluk & Plandowski, Parallel Alternating-Direction Access Machine 1996 21 MFCS Corradini & Pistore, Specification and Verification of Timed Lazy Systems 1996 21 MFCS Demri, A Class of Information Logics with a Decidable Validity Problem 1996 21 MFCS Dessmark & Lingas, On the Power of Nonconservative PRAM 1996 21 MFCS Durand, Self-similarity Viewed as a Local Property via Tile Sets 1996 21 MFCS Engelhardt & de Roever, Simulation of Specification Statements in Hoare Logic 1996 21 MFCS Esik & Labella, Equational Properties of Iteration in Algebraically Complete Categories 1996 21 MFCS Fernau, On Unconditional Transfer 1996 21 MFCS Fotakis & Spirakis, (poly(log log n), poly(log log n))-restricted Verifiers are Unlikely to Exist for Languages in NP 1996 21 MFCS Gasieniec & Kranakis & Krizanc & Pelc, Minimizing Congestion of Layouts for ATM Networks with Faulty Links 1996 21 MFCS Glaister & Shallit, Polynomial Automaticity, Context-free Languages, and Fixed Points of Morphisms (extended abstract) 1996 21 MFCS Goltz & Wehrheim, Causal Testing 1996 21 MFCS Hu & Iwasaki & Takeichi, Construction of List Homomorphisms by Tupling and Fusion 1996 21 MFCS Kwiatkowska & Norman, Probabilistic Metric Semantics for a Simple Language with Recursion 1996 21 MFCS Maggiolo-Schettini & Winkowski, Dynamic Graphs 1996 21 MFCS Mantaci & Restivo, Equations on Trees 1996 21 MFCS Ohlebusch & Ukkonen, On the Equivalence Problem for E-pattern Languages (extended abstract) 1996 21 MFCS Pawlowski & Paczkowski & Sokolowski, Specifying and Verifying Parametric Processes 1996 21 MFCS Pliuskevicius, On Saturation with Flexible Function Symbols 1996 21 MFCS Rossner & Seifert, Approximating Good Simultaneous Diophantine Approximations is Almost NP-hard 1996 21 MFCS Seebold, On the Conjugation of Standard Morphisms 1996 21 MFCS Shi, A Semantic Matching Algorithm: Analysis and Implementation 1996 21 MFCS Sibeyn, Routing on Triangles, Tori and Honeycombs 1996 21 MFCS de la Torre & Kao, A Uniform Analysis of Trie Structures That Store Prefixing-keys with Application to Doubly-chained Prefixing-tries 1996 21 MFCS Wabenhorst, On Fairness in Terminating and Reactive Programs 1996 21 MFCS Yamakami, Polynomial Time Samplable Distributions 1996 21 MFCS Zucca, From Static to Dynamic Abstract Data-types 1995 20 MFCS Adler & Byers & Karp, Scheduling Parallel Communication: The h-Relation Problem 1995 20 MFCS Arnborg, Decomposable Structures, Boolean Function Representations, and Optimization 1995 20 MFCS Flammini & van Leeuwen & Marchetti-Spaccamela, The Complexity of Interval Routing on Random Graphs (Extended Abstract) 1995 20 MFCS Geffert, Bridging Across the log(n) Space Frontier 1995 20 MFCS Gottlob & Leone & Veith, Second Order Logic and the Weak Exponential Hierarchies 1995 20 MFCS Hartmanis, On the Computing Paradigm and Computational Complexity 1995 20 MFCS Lehmann, Ranked Structures in Nonmonotonic Reasoning and Belief Revision (Abstract) 1995 20 MFCS Perrin, Symbolic Dynamics and Finite Automata 1995 20 MFCS Razborov, Lower Bounds for Propositional Proofs and Independence Results in Bounded Arithmetic (Abstract) 1995 20 MFCS Vitanyi, Physics and the New Computation 1995 20 MFCS Allender & Strauss, Measure on P: Robustness of the Notion 1995 20 MFCS Burtschick, Comparing Counting Classes for Logspace, One-Way Logspace, and First-Order 1995 20 MFCS Damm & Holzer, Automata That Take Advice 1995 20 MFCS Homer & Mocas, Nonuniform Lower Bounds for Exponential Time Classes 1995 20 MFCS Kaufmann & Kummer, On a Quantitative Notion of Uniformity 1995 20 MFCS Merkle & Wang, Separations by Random Oracles and ``Almost'' Classes for Generalized Reducibilities 1995 20 MFCS Beauquier & Burago & Slissenko, On the Complexity of Finite Memory Policies for Markov Decision Processes 1995 20 MFCS Hofmeister & Lefmann, Derandomization for Sparse Approximations and Independent Sets 1995 20 MFCS Katajainen & Pasanen & Titan, Asymptotically Efficient In-Place Merging 1995 20 MFCS Heusch, The Complexity of the Falsifiability Problem for Pure Implicational Formulas 1995 20 MFCS Kann, Strong Lower Bounds on the Approximability of Some NPO PB-complete Maximization Problems 1995 20 MFCS Lefmann & Savicky, Some Typical Properties of Large AND/OR Boolean Formulas 1995 20 MFCS Huhne, The Hedge: An Efficient Storage Device for Turing Machines with One Head (Extended Abstract) 1995 20 MFCS Maruyama & Miyano, Graph Inference from a Walk for Trees of Bounded Degree 3 is NP-complete 1995 20 MFCS Stojmenovic, Honeycomb Networks 1995 20 MFCS Fischer & Hemaspaandra & Torenvliet, Witness-Isomorphic Reductions and the Local Search Problem (Extended Abstract) 1995 20 MFCS Bertram-Kretzberg & Hofmeister, Multiple Product Modulo Arbitrary Numbers 1995 20 MFCS Meinel & Waack, Lower Bounds for the Majority Communication Complexity of Various Graph Accessibility Problems 1995 20 MFCS Bertoni & Mereghetti & Pighizzini, Strong Optimal Lower Bounds for Turing Machines that Accept Nonregular Languages 1995 20 MFCS Zak, A Superpolynomial Lower Bound for (1,+k(n))-Branching Programs 1995 20 MFCS Breveglieri & Cherubini & Crespi-Reghizzi, Deterministic Parsing for Augmented Context-Free Grammars 1995 20 MFCS Mignosi & Restivo & Salemi, A Periodicity Theorem on Words and Applications 1995 20 MFCS Hotz & Pitsch, A New Approach to Analyse Coupled-Context-Free Languages 1995 20 MFCS Hermann & Kolaitis, Computational Complexity of Simultaneous Elementary Matching Problems 1995 20 MFCS Rao, Graph Reducibility of Term Rewriting Systems 1995 20 MFCS Urzyczyn, Positive Recursive Type Assignment 1995 20 MFCS Kranakis & Krizanc & Luccio, String Recognition on Anonymous Rings 1995 20 MFCS Roka, The Firing Squad Synchronization Problem on Cayley Graphs 1995 20 MFCS Sibeyn & Kaufmann, Solving Cheap Graph Problems on Meshes 1995 20 MFCS Burkart & Caucal & Steffen, An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes 1995 20 MFCS Bauget & Gastin, On Congruences and Partial Orders 1995 20 MFCS Corradini & Gorrieri & Roccetti, Performance Preorder: Ordering Processes with Respect to Speed 1995 20 MFCS Ferreira & Hennessy, Towards a Semantic Theory of CML (Extended Abstract) 1995 20 MFCS Huguet & Petit, Modular Construction of Distributing Automata 1995 20 MFCS Sangiorgi, On the Proof Method for Bisimulation (Extended Abstract) 1995 20 MFCS Martin, Towards a Calculus of Predicate Transformers 1995 20 MFCS Abadi & Merz, An Abstract Account of Composition 1995 20 MFCS van der Goot & de Bruin, Syntax and Semantics of Procol 1995 20 MFCS Godskesen & Larsen, Synthesizing Distinguishing Formulae for Real Time Systems (Extended Abstract) 1995 20 MFCS Laroussinie & Larsen & Weise, From Timed Automata to Logic--and Back 1995 20 MFCS Makowsky & Ravve, Incremental Model Checking for Decomposable Structures 1995 20 MFCS Janin & Walukiewicz, Automata for the Modal mu-calculus and Related Results 1995 20 MFCS Niebert, A nu-calculus with Local Views for Systems of Sequential Agents 1995 20 MFCS Feinsilver & Schott, An Operator Calculus Approach to the Evolution of Dynamic Data Structures 1994 19 MFCS Cheatham, Models, Languages, and Compiler Technology for High Performance Computers 1994 19 MFCS Cosnard & Matamala, On NC-Real Complexity Classes for Additive Circuits and Their Relations with NC 1994 19 MFCS Duris & Rolim, E-Complete Sets Do Not Have Optimal Polynomial Time Approximations 1994 19 MFCS Bloom & Esik, Solving Polynomial Fixed Point Equations 1994 19 MFCS Makowsky, Capturing Complexity Classes with Lindstrom Quantifiers 1994 19 MFCS Monien & Diekmann & Luling, Communication Throughput of Interconnection Networks 1994 19 MFCS Lipton & O'Donnell, Intuitive Counterexamples for Constructive Fallacies 1994 19 MFCS Orejas & Pino & Ehrig, Algebraic Methods in the Compositional Analysis of Logic Programs 1994 19 MFCS Paterson & Dancik, Longest Common Subsequences 1994 19 MFCS Pevzner & Lipshutz, Towards DNA Sequencing Chips 1994 19 MFCS Sgall, On-Line Scheduling of Parallel Jobs 1994 19 MFCS Winskel, Stable Bistructure Models of PCF 1994 19 MFCS Albers, A Competitive Analysis of the List Updata Problem with Lookahead 1994 19 MFCS Alessi & Dezani-Ciancaglini & de'Liguoro, May and Must Convergency in Concurrent lambda-Calculus 1994 19 MFCS Ambos-Spies & Neis & Terwijn, Genericity and Measure for Exponential Time 1994 19 MFCS Baeza-Yates, Analysis of Bounded Disorder 1994 19 MFCS Bertoni & Mereghetti & Pighizzini, On Languages Accepted with Simultaneous Complexity Bounds and Their Ranking Problem 1994 19 MFCS de Boer & van Hulst, A Proof System for Asynchronously Communicating Deterministic Processes 1994 19 MFCS Bouabdallah & Heydemann & Opatrny & Sotteau, Embedding Complete Binary Trees into Star Networks 1994 19 MFCS Damm & Holzer, Inductive Counting below LOGSPACE 1994 19 MFCS Dassow, Decision Problems for Edge Grammars 1994 19 MFCS Dehne & Klein, ``The Big Sweep'': On the Power of the Wavefront Approach to Voronoi Diagrams 1994 19 MFCS Denejko & Diks & Pelc & Piotrow, Reliable Minimum Finding Comparator Networks 1994 19 MFCS Dessmark & Lingas & Garrido, On Parallel Complexity of Maximum f-Matching and the Degree Sequence Problem 1994 19 MFCS Dietzfelbinger & Hromkovic & Schnitger, A Comparison of Two Lower Bound Methods for Communication Complexity 1994 19 MFCS Obono & Goralcik & Maksimenko, Efficient Solving of the Word Equations in One Variable 1994 19 MFCS Ferrari & Montanari & quaglia, A pi-Calculus with Explicit Substitutions: the Late Semantics 1994 19 MFCS Forti & Honsell & Lenisa, Processes and Hyperuniverses 1994 19 MFCS Frayman & Kanevsky & Kirchherr, The Combinatorial Complexity of a Finite String 1994 19 MFCS Gold, A Fully Abstract Semantics for Termination in Petri Nets 1994 19 MFCS Alves & Laurent & Spyratos, Passive and Active Rules in Deductive Databases 1994 19 MFCS Hegedus, Combinatorial Results on the Complexity of Teaching and Learning 1994 19 MFCS Hermo, Degrees and Reducibilities of Easy Tally Sets 1994 19 MFCS Hoogeboom & ten Pas, MSO Definable Text Languages 1994 19 MFCS Hromkovic & Kari & Kari & Pardubska, Two Lower Bounds on Distributive Generation of Languages 1994 19 MFCS Inverardi & Zilli, Rational Rewriting 1994 19 MFCS Karhumaki & Plandowski, On the Size of Independent Systems of Equations in Semigroups 1994 19 MFCS Karpinski & Rytter, On a Sublinear Time Parallel Construction of Optimal Binary Search Trees 1994 19 MFCS Kavvadias & Pantziou & Spirakis & Zaroliagis, Hammock-on-Ears Decomposition: A Technique for the Efficient Parallel Solution of Shortest Paths and Other Problems 1994 19 MFCS Klasing, The Relationship Between Gossiping in Vertex-Disjoint Paths Mode and Bisection Width 1994 19 MFCS Kurka, A Comparison of Finite and Cellular Automata 1994 19 MFCS Lange & Reinhardt, Empty Alternation 1994 19 MFCS Le Saec & Litovsky, On the Minimization Problem for omega-Automata 1994 19 MFCS Meinel & Slobodova, On the Complexity of Constructing Optimal Ordered Binary Decision Diagrams 1994 19 MFCS Narayanan & Roy & Patkar, Approximation Algorithms for Min-k-Overlap Problems Using the Principal Lattice of Partitions Approach 1994 19 MFCS De Nicola & labella, A Completeness Theorem for Nondeterministic Kleene Algebras 1994 19 MFCS Papatriantafilou & Tsigas, How a Rainbow Colouring Function Can Simulate Wait-Free Handshaking 1994 19 MFCS Plump, Critical Pairs in Term Graph Rewriting 1994 19 MFCS Priami & Yankelevich, Read-Write Causality 1994 19 MFCS Richomme, Some Trace Monoids Where Both the Star Problem and the Finite Power Property Problem are Decidable 1994 19 MFCS Salomaa & Wood & Yu, Complexity of E0L Structural Equivalence 1994 19 MFCS Sibeyn & Chlebus & Kaufmann, Shorter Queues for Permutation Routing on Meshes 1994 19 MFCS Sieber, Full Abstraction for the Second Order Subset of an ALGOL-like Language 1994 19 MFCS Weber & Head, The Finest Homophonic Partition and Related Code Concepts 1993 18 MFCS Apt & Etalle, On the Unification Free Prolog Programs 1993 18 MFCS Arnold & Dicky, Equivalences and Preorders on Transition Systems 1993 18 MFCS McKinna & Burstall, Deliverables: A Categorical Approach to Program Development in Type Theory 1993 18 MFCS Diekert, Complex and Complex-like Traces 1993 18 MFCS Honsell & Lenisa, Some Results on the Full Abstraction Problem for Restricted Lambda Calculi 1993 18 MFCS Milner, Action Calculi, or Syntactic Action Structures 1993 18 MFCS Pitts & Stark, Observable Properties of Higher Order Functions that Dynamically Create Local Names, or: What's New? 1993 18 MFCS Pratt, The Second Calculus of Binary Relations 1993 18 MFCS Ehrenfeucht & Rozenberg, An Introduction to Dynamic Labeled 2-Structures 1993 18 MFCS Mateescu & Salomaa, Post Correspondence Problem: Primitivity and Interrelations with Complexity Classes 1993 18 MFCS Wadler, A Taste of Linear Logic 1993 18 MFCS Alonso & Schott, On the Tree Inclusion Problem 1993 18 MFCS Amadio, On the Adequacy of PER Models 1993 18 MFCS Arvind & Kobler & Mundhenk, Hausdorff Reductions to Sparse Sets and to Sets of High Information Content 1993 18 MFCS Astesiano & Reggio & Zucca, Stores as Homomorphisms and their Transformations 1993 18 MFCS de Bakker & van Breugel & de Bruin, Comparative Semantics for Linear Arrays of Communicating Processes, a Study of the UNIX Fork and Pipe Commands 1993 18 MFCS Beauquier & Podelski, Rabin Tree Automata and Finite Monoids 1993 18 MFCS Benke, Efficient Type Reconstruction in the Presence of Inheritance 1993 18 MFCS Berstel & Seebold, A Characterization of Sturmian Morphisms 1993 18 MFCS Bodlaender & Jansen, On the Complexity of Scheduling Incompatible Jobs with Unit-Times 1993 18 MFCS Bonsangue & Kok, Isomorphisms between Predicate and State Transformers 1993 18 MFCS Cai & Chen, On the Amount of Nondeterminism and the Power of Verifying 1993 18 MFCS Castellani, Observing Distribution in Processes 1993 18 MFCS Cerin & Petit, Speedup of Recognizable Trace Languages 1993 18 MFCS Cerioli & Meseguer, May I Borrow Your Logic? 1993 18 MFCS Chaudhuri & Hagerup & Raman, Approximate and Exact Deterministic Parallel Selection 1993 18 MFCS Chen & Staples, Defining Soft Sortedness by Abstract Interpretation 1993 18 MFCS Chen, A Model for Real-time Process Algebras 1993 18 MFCS Costa & Sernadas & Sernadas, Data Encapsulation and Modularity: Three Views of Inheritance 1993 18 MFCS Culik & Kari, Image Compression Using Weighted Finite Automata 1993 18 MFCS Dezani-Ciancaglini & de'Liguoro & Piperno, Filter Models for a Parallel and Non Deterministic lambda-Calculus 1993 18 MFCS Di Gianantonio, Real Number Computability and Domain Theory. 1993 18 MFCS Diskin & Beylin, Lambda Substitution Algebras 1993 18 MFCS Durand, Global Properties of 2D Cellular Automata: Some Complexity Results 1993 18 MFCS Engberg & Winskel, Completeness Results for Linear Logic on Petri Nets 1993 18 MFCS Fantechi & Gnesi & Perticaroli, An Expressive Logic for Basic Process Algebra 1993 18 MFCS Frandsen & Miltersen & Skyum, The Complexity of Finding Replicas Using Equality Tests 1993 18 MFCS van Glabbeek, A Complete Axiomatization for Branching Bisimulation Congruence of Finite-state Behaviours 1993 18 MFCS de Haas & van Emde Boas, Object Oriented Application Flow Graphs and their Semantics 1993 18 MFCS Hromkovic & Kari & Kari, Some Hierarchies for the Communication Complexity Measures of Cooperating Grammar Systems 1993 18 MFCS Ibarra & Richards, Efficient Parallel Graph Algorithms Based on Open Ear Decomposition 1993 18 MFCS Ibarra & Tran, On the Communication Complexity of Parallel Computation 1993 18 MFCS Jancar & Mraz & Platek, A Taxonomy of Forgetting Automata 1993 18 MFCS Jifeng, Hybrid Parallel Programming and Implementation of Synchronised Communication 1993 18 MFCS Kiehn, Proof Systems for Cause Based Equivalences 1993 18 MFCS Martin, A Uniform Universal CREW PRAM 1993 18 MFCS Murphy, Observing Located Concurrency 1993 18 MFCS Narbel, The Boundary of Substitution Systems 1993 18 MFCS Neraud, New Algorithms for Detecting Morphic Images of a Word 1993 18 MFCS Paczkowski, Ignoring Nonessential Interleavings in Assertional Reasoning on Concurrent Programs 1993 18 MFCS Parigot & Roziere, Constant Time Reductions in lambda-Calculus 1993 18 MFCS Parisi-Presicce & Veglioni, Heterogeneous Unified Algebra 1993 18 MFCS Pigozzi & Salibra, A Representation Theorem for Lambda Abstraction Algebras 1993 18 MFCS Pliuskevicius, On Saturated Calculi for a Linear Temporal Logic 1993 18 MFCS Puhlmann, The Snack Powerdomain for Database Semantics 1993 18 MFCS Reus & Streicher, Verifying Properties of Module Construction in Type Theory 1993 18 MFCS Ruzicka & Waczulik, On Time-Space Trade-offs in Dynamic Graph Pebbling 1993 18 MFCS Sassone & Nielsen & Winskel, Deterministic Behavioural Models for Concurrency 1993 18 MFCS Scholefield & Zedan & Jifeng, Real-time Refinement: Semantics and Application 1993 18 MFCS Steffen & Weise, Deciding Testing Equivalence for Real-time Processes with Dense Time 1993 18 MFCS Stephan & Wolpers, A Calculus for Higher Order Procedures with Global Variables 1993 18 MFCS Stevens, Variable Substitution with Iconic Combinators 1993 18 MFCS Treinen, Feature Constraints with First-Class Features 1993 18 MFCS Wagner & Wagner, Between Min Cut and Graph Bisection 1993 18 MFCS Wanke, Paths and Cycles in Finite Periodic Graphs 1993 18 MFCS Yin & Hong, Learning Decision Lists from Noisy Examples 1993 18 MFCS Zabel, Analytic Tableaux for Finite and Infinite Post Logics 1992 17 MFCS Agarwal & Matousek, On Range Searching with Semialgebraic Sets 1992 17 MFCS Diaz, Graph Layout Problems 1992 17 MFCS Lange & Rossmanith & Rytter, Parallel Recognition and Ranking of Context-Free Languages 1992 17 MFCS Mihail, On the Expansion of Combinatorial Polytopes 1992 17 MFCS Orponen, Neural Networks and Complexity Theory 1992 17 MFCS Tucker & Zucker, Theory of Computation over Stream Algebras, and its Applications 1992 17 MFCS Watanabe, On the Complexity of Small Description and Related Topics 1992 17 MFCS Wiedermann, Weak Parallel Machines: A New Class of Physically Feasible Parallel Machine Models 1992 17 MFCS Wigderson, The Complexity of Graph Connectivity 1992 17 MFCS Bast & Dietzfelbinger & Hagerup, A Perfect Parallel Dictionary 1992 17 MFCS Becker & Hartmann, Some Remarks on the Test Complexity of Iterative Logic Arrays 1992 17 MFCS Burtschick & Hoene, The Degree Structure of 1-L Reductions 1992 17 MFCS Cai & Hemachandra & Vyskoc, Promise Problems and Access to Unambiguous Computation 1992 17 MFCS Chari & Ranjan & Rohatgi, On the Complexity of Incremental Computation 1992 17 MFCS Choffrut & Goldwurm, Rational Transductions and Complexity of Counting Problems 1992 17 MFCS Comon & Fernandez, Negation Elimination in Equational Formulae 1992 17 MFCS Costa & Sernadas & Sernadas & Ehrich, Object Interaction 1992 17 MFCS Curien & Hardin & Rios, Strong Normalization of Substitutions 1992 17 MFCS Daley & Kalyanasundaram, Probabilistic and Pluralistic Learners with Mind Changes 1992 17 MFCS Damm & Holzer & Lange, The Parallel Complexity of Iterated Morphisms and the Arithmetic of Small Numbers 1992 17 MFCS Derencourt & Karhumaki & Latteux & Terlutte, On Computational Power of Weighted Finite Automata 1992 17 MFCS Feldmann & Mysliwietz, The Shuffle Exchange Network has a Hamiltonian Path 1992 17 MFCS Gastin & Petit, Poset Properties of Complex Traces 1992 17 MFCS Goerdt, A Threshold for Unsatisfiability 1992 17 MFCS Gold, Dataflow Semantics for Petri Nets 1992 17 MFCS Guessarian & Veloso-Peixoto, About Boundedness for Some DATALOG and DATALOG^- Programs 1992 17 MFCS Hagerup & Petersson, Merging and Sorting Strings in Parallel 1992 17 MFCS Jancar & Mraz & Platek, Characterization of Context-Free Languages by Erasing Automata 1992 17 MFCS Kari, Insertion and Deletion of Words: Determinism and Reversibility 1992 17 MFCS Kascak, Small Universal One-State Linear Operator Algorithm 1992 17 MFCS Laneve & Montanari, Mobility in the CC-Paradigm 1992 17 MFCS Lange & Rossmanith, The Emptiness Problem for Intersections of Regular Languages 1992 17 MFCS Leung, On Finite Automata with Limited Nondeterminism 1992 17 MFCS Litovsky & Metivier & Sopena, Definitions and Comparisons of Local Computations on Graphs 1992 17 MFCS Martin, Efficient Unidimensional Universal Cellular Automaton 1992 17 MFCS Maruyama & Miyano, Inferring a Tree from Walks 1992 17 MFCS Mayordomo, Almost Every Set in Exponential Time is P-Bi-Immune 1992 17 MFCS Murphy & Poigne, A Functorial Semantics for Observed Concurrency 1992 17 MFCS Ochmanski, Modelling Concurrency with Semi-Commutations 1992 17 MFCS Pedersen, Decision Problems for Cellular Automata and Their Semigroups 1992 17 MFCS Pinna & Poigne, On the Nature of Events 1992 17 MFCS Preilowski & Dahlhaus & Wechsung, New Parallel Algorithms for Convex Hull and Triangulation in 3-Dimensional Space 1992 17 MFCS Przymusinski, Two Simple Characterizations of Well-Founded Semantics 1992 17 MFCS Ramesh, Fully Abstract Semantics for Higher Order Communicating Systems 1992 17 MFCS Reimen, Superposable Trellis Automata 1992 17 MFCS Roos & Albers, Maintaining Proximity in Higher Dimensional Spaces 1992 17 MFCS Szilard & Yu & Zhang & Shallit, Characterizing Regular Languages with Polynomial Densities 1992 17 MFCS Wang, A Strategy for Speeding-up the Computation of Characteristic Sets 1992 17 MFCS Wrathall & Diekert & Otto, One-Rule Trace-Rewriting Systems and Confluence 1991 16 MFCS Lassez & Maher & Marriott, Elimination of Negation in Term Algebras 1991 16 MFCS Lescanne, Rewrite Orderings and Termination of Rewrite Systems 1991 16 MFCS Manna & Pnueli, On the Faithfulness of Formal Models 1991 16 MFCS Nielsen, Models for Concurrency 1991 16 MFCS Salwicki, On a Hierarchy of File Types and a Tower of Their Theories 1991 16 MFCS Alessi & Barbanera, Strong Conjunction and Intersection Types 1991 16 MFCS Astesiano & Cerioli, Partial Higher-order Specifications 1991 16 MFCS Bonnier, Unification in Incompletely Specified Theories: A Case Study 1991 16 MFCS Boudol & Castellani & Hennessy & Kiehn, Observing Localities 1991 16 MFCS Costa & Reggio, Abstract Dynamic Data Types: A Temporal Logic Approach 1991 16 MFCS Cerny, Generating Words by Cellular Automata 1991 16 MFCS Degano & Gorrieri, Atomic Refinement in Process Description Languages 1991 16 MFCS Diekert & Gastin & Petit, Recognizable Complex Trace Languages 1991 16 MFCS Domenjoud, Solving Systems of Linear Diophantine Equations: An Algebraic Approach 1991 16 MFCS Dowek, A Second Order Pattern Matching Algorithm for the Cube of Typed lambda-Calculi 1991 16 MFCS Egidi & Honsell & Ronchi della Rocca, The Lazy Call-by-Value lambda-Calculus 1991 16 MFCS Gorrieri & Laneve, The Limit of split_n-Bisimulations for CCS Agents 1991 16 MFCS Hansel & Krob & Michaux, Stochastic Automata and Length Distributions of Rational Languages 1991 16 MFCS Hilken & Rydeheard, Towards a Categorical Semantics Type Classes 1991 16 MFCS Howell & Jancar & Rosier, Single-path Petri Nets 1991 16 MFCS Hromkovic & Monien, The Bisection Problem for Graphs of Degree 4 (Configuring Transputer Systems) 1991 16 MFCS Ibarra & Jiang & Wang, Some Results Concerning 2-D On-line Tessallation Acceptors and 2-D Alternating Finite Automata 1991 16 MFCS Inverardi & Nesi, Infinite Normal Forms for Non-linear Term Rewriting Systems 1991 16 MFCS Jokinen & Ukkonen, Two Algorithms for Approximate String Matching in Static Texts 1991 16 MFCS Karhumaki & Rytter & Jarominek, Efficient Constructions of Test Sets for Regular and Context-free Languages 1991 16 MFCS Kavadias & Kirousis & Spirakis, The Complexity of the Reliable Connectivity Problem 1991 16 MFCS Kesner, Pattern Matching in Order-sorted Languages 1991 16 MFCS Konikowska, Two over Three: A Two-valued Logic for Software Specification and Validation over a Three-valued Predicate Calculus 1991 16 MFCS Kounalis & Lugiez & Pottier, A Solution of the Complement Problem in Associative-Commutative Theories 1991 16 MFCS Krishnan, A Model for Real-time Systems 1991 16 MFCS Nguyen Huong Lam & Do Long Van, On Strict Codes 1991 16 MFCS Leiss & Henglein, A Decidable Case of the Semi-Unification Problem 1991 16 MFCS Leopold, Maintaining Dictionaries in a Hierarchical Memory 1991 16 MFCS Meinel & Waack, Upper and Lower Bounds for Certain Graph-Accessibility Problems on Bounded Alternating omega-Branching Programs 1991 16 MFCS Montanari & Sassone, CCS Dynamic Bisimulation is Progressing 1991 16 MFCS Nait Abdallah, Syntax and Semantics of a Monotonic Framework for Non-monotonic Reasoning 1991 16 MFCS Niwinski, On the Cardinality of Sets of Infinite Trees Recognizable by Finite Automata 1991 16 MFCS Paech, Extending Temporal Logic by Explicit Concurrency 1991 16 MFCS Pino Perez, An Extensional Partial Combinatory Algebra based on lambda-Terms 1991 16 MFCS Poigne, Once More on Order-sorted Algebras 1991 16 MFCS Roos & Wacrenier, Composition of Two Semi Commutations 1991 16 MFCS Ruzicka, An Efficient Decision Algorithm for the Uniform Semi-Unification Problem 1991 16 MFCS Shvachko, Different Modifications of Pointer Machines and their Computational Power 1990 15 MFCS Borger, A Logical Operational Semantics of Full Prolog 1990 15 MFCS Jouannaud, Syntactic Theories 1990 15 MFCS Kozen, On Kleene Algebras and Closed Semirings 1990 15 MFCS Krajicek & Pudlak & Sgall, Interactive Computations of Optimal Solutions 1990 15 MFCS Meinel, Restricted Branching Programs and Their Computational Power 1990 15 MFCS Meyer auf der Heide, Dynamic Hashing Strategies 1990 15 MFCS Selman, One-Way Functions in Complexity Theory 1990 15 MFCS Tiuryn, Type Inference Problems: A Survey 1990 15 MFCS Toran, Counting the Number of Solutions 1990 15 MFCS Vree, Implementation of Parallel Graph Reduction by Explicit Annotation and Program Transformation 1990 15 MFCS Alberts, Interrogative Complexity of omega-Languages' Recognition 1990 15 MFCS Allender & Hertrampf, On the Power of Uniform Families of Constant Depth Threshold Circuits 1990 15 MFCS d'Amore & Franciosa, Separating Sets of Hyperrectangles 1990 15 MFCS Baruah & Howell & Rosier, On Preemptive Scheduling of Periodic, Real-Time Tasks on One Processor 1990 15 MFCS de Bruin & de Vink, Retractions in Comparing Prolog Semantics 1990 15 MFCS Buntrock & Hemachandra & Siefkes, Using Inductive Counting to Simulate Nondeterministic Computation 1990 15 MFCS Cerna, Some Properties of Zerotesting Bounded One-Way Multicounter Machines 1990 15 MFCS Chrobak & Larmore, On Fast Algorithms for Two Servers 1990 15 MFCS Clerbout & Gonzales, Decomposition of Semi Commutations 1990 15 MFCS Crochemore & Rytter, Parallel Construction of Minimal Suffix and Factor Automata 1990 15 MFCS Culik & Dube, Affine Automata: A Technique to Generate Complex Images 1990 15 MFCS Damm, The Complexity of Symmetric Functions in Parity Normal Forms 1990 15 MFCS Darondeau & Degano, Event Structures, Causal Trees, and Refinements 1990 15 MFCS Dublish & Maheshwari, Query Languages which Express all PTIME Queries for Trees and Unicyclic Graphs 1990 15 MFCS Fachini & Maggiolo Schettini & Sangiorgi, Comparisons Among Classes of Y-Tree Systolic Automata 1990 15 MFCS Gasarch & Hemachandra & Hoene, On Checking Versus Evaluation of Multiple Queries 1990 15 MFCS Gavalda & Torenvliet & Watanabe & Balcazar, Generalized Kolmogorov Complexity in Relativized Separations 1990 15 MFCS Gavilanes-Franco, A First-Order Logic for Partial Recursive Functions 1990 15 MFCS Geffert, Speed-up Theorem Without Tape Compression 1990 15 MFCS Geidmanis, On Possibilities of One-Way Synchronized and Alternating Automata 1990 15 MFCS Goerdt, Unrestricted Resolution Versus N-Resolution 1990 15 MFCS Gold & Vogler, Quality Criteria for Partial Order Semantics of Place/Transition-Nets 1990 15 MFCS Golubski & Lippe, Tree-Stack Automata 1990 15 MFCS Hansen & Chao-Chen, Specification and Verification of Higher Order Processes 1990 15 MFCS Hinz, The Membership Problem for Context-Free Chain Code Picture Languages 1990 15 MFCS Hromkovic & Jeschke & Monien, Optimum Algorithms for Dissemination of Information in Some Interconnection Networks 1990 15 MFCS Jonsson, A Hierarchy of Compositional Models of I/O-Automata 1990 15 MFCS Kaneps & Freivalds, Minimal Nontrivial Space Complexity of Probabilistic One-Way Turing Machines 1990 15 MFCS Karpinski & Meyer auf der Heide, On the Complexity of Genuinely Polynomial Computation 1990 15 MFCS Kounalis, Pumping Lemmas for Tree Languages Generated by Rewrite Systems 1990 15 MFCS Kowaluk & Wagner, Vector Language: Simple Description of Hard Instances 1990 15 MFCS Krause, Separating Parity-L from L, NL, co-NL and AL (=P) for Oblivious Turing Machines of Linear Access Time 1990 15 MFCS Krivanek, The Use of Graphs of Elliptical Influence in Visual Hierarchical Clustering 1990 15 MFCS Lange & Rossmanith, Characterizing Unambiguous Augmented Pushdown Automata by Circuits 1990 15 MFCS Latteux & Timmerman, Rational omega-transductions 1990 15 MFCS Levcopoulos & Petersson, Splitsort--An Adaptive Sorting Algorithm 1990 15 MFCS Manca & Salibra, Equational Calculi for Many-Sorted Algebras with Empty Carrier Sets 1990 15 MFCS Ochmanski, Semi-Commutation and Deterministic Petri Nets 1990 15 MFCS Parigot, Internal Labellings in Lambda-Calculus 1990 15 MFCS Pasztor, A Sup-Preserving Completion of Ordered Partial Algebras 1990 15 MFCS Piotrow, ATIME(n) is Closed Under Counting 1990 15 MFCS Pliuskevicius, Investigation of Finitary Calculi for the Temporal Logics by Means of Infinitary Calculi 1990 15 MFCS Poigne, Typed Horn Logic 1990 15 MFCS Sain, Results on the Glory of the Past 1990 15 MFCS Uyen, A Stronger Version of Parikh Theorem 1990 15 MFCS Waack, The Parallel Complexity of Some Constructions in Combinatorial Group Theory 1990 15 MFCS Walukiewicz, Gentzen Type Axiomatization for PAL 1990 15 MFCS Weber, Distance Automata Having Large Finite Distance or Finite Ambiguity 1990 15 MFCS Wegener, Bottom-Up-Heap Sort, a New Variant of Heap Sort Beating on Average Quick Sort 1990 15 MFCS Wegener & Wurm & Yi, Symmetric Functions in AC^0 Can Be Computed in Constant Depth with Very Small Size 1990 15 MFCS Wiegers, The k-section of Treewidth Restricted Graphs 1990 15 MFCS Zeugmann, Computing Large Polynomial Powers Very Fast in Parallel 1989 14 MFCS Hartmanis & Ranjan, Space Bounded Computations: Review and New Separation Results 1989 14 MFCS Harel, A Thesis for Bounded Concurrency 1989 14 MFCS Hemachandra & Hoene & Siefkes, Polynomial-time Functions Generate SAT: On P-Splinters 1989 14 MFCS Barrington & McKenzie, Oracle Branching Programs and Logspace versus P (extended abstract) 1989 14 MFCS Stetsenko, One More Method for Proving Lower Bounds on the Formula Complexity of Boolean Functions 1989 14 MFCS Diks & Hagerup & Rytter, Optimal Parallel Algorithms for the Recognition and Colouring Outerplanar Graphs 1989 14 MFCS Dassow & Hromkovic & Karhumaki & Rovan & Slobodova, On the Power of Synchronization in Parallel Computations 1989 14 MFCS Steffen, Optimal Data Flow Analysis via Observational Equivalence 1989 14 MFCS Kok, An Iterative Metric Fully Abstract Semantics for Nondeterministic Dataflow (extended abstract) 1989 14 MFCS de Boer & Kok & Palamidessi & Rutten, Control Flow versus Logic: A Denotational and Declarative Model for Guarded Horn Clauses 1989 14 MFCS Schmidt & Schwartzbach, An Imperative Type Hierarhy with Partial Products 1989 14 MFCS Farres-Casals, Proving Correctness of Constructor Implementations 1989 14 MFCS Mehlhorn & Naher, A Library of Efficient Data Types and Algorithms 1989 14 MFCS Trakhtenbrot, Understanding Nets (abstract) 1989 14 MFCS Just, Integer Relations among Algebraic Numbers 1989 14 MFCS Saoudi, Pushdown Automta on Infinite Trees and Omega-Kleene Closure of Context-free Tree Sets 1989 14 MFCS Calude & Vaidya, Ehrenfeucht Test Set Theorem and Hilbert Basis Theorem: A Constructive Glimpse 1989 14 MFCS Heuter, Generalized Definite Tree Languages 1989 14 MFCS Zaionc, How To Define Functionals on Free Structures in Typed Lambda-Calculus 1989 14 MFCS Weber, On the Lengths of Values in a Finite Transducer 1989 14 MFCS Gouda & Howell & Rosier, System Simulation and the Sensitivity of Self-stabilization (extended abstract) 1989 14 MFCS van Glabbeek & Goltz, Equivalence Notions for Concurrent Systems and Refinement of Actions (extended abstract) 1989 14 MFCS Meyer & de Vink, Pomset Semantics for True Concurrency with Synchronization and Recursion (extended abstract) 1989 14 MFCS Badouel, Algebraically Closed Theories 1989 14 MFCS Steffen & Knoop, Finite Constants: Characterizations of a New Decidable Set of Constants 1989 14 MFCS Jousselin & Moskowitz, Memory and Algebra 1989 14 MFCS Holte & Rosier & Tulchinsky & Varvel, Pinwheel Scheduling with Two Distinct Numbers 1989 14 MFCS Slusarek, A Coloring Algorithm for Interval Graphs 1989 14 MFCS Wiedermann, On the Computational Efficiency of Symmetric Neural Networks 1989 14 MFCS Chlebus & Diks & Rytter & Szymacha, Parallel Complexity of Lexicographically First Problems for Tree-structured Graphs (extended abstract) 1989 14 MFCS Palko & Sykora & Vrto, Area Complexity of Merging 1989 14 MFCS Elkan, Logical Characterizations of Nonmonotonic TMSs 1989 14 MFCS Andrews, Proof-theoretic Characterisations of Logic Programming 1989 14 MFCS Szczepanska, The Hoare-like Verification System for a Language with an Exception Handling Mechanism 1989 14 MFCS Petermann, An Extended Herbrand Theorem for First-order Theories with Equality Interpreted in Partial Algebras 1989 14 MFCS Agafonov, From Specification Languages to Specification Knowledge Bases: The pto Approach 1989 14 MFCS Courcelle, Monadic Second-order Logic and Context-Free Graph Grammar 1989 14 MFCS Regnier, Knuth-Morris-Pratt Algorithm: An Analysis 1989 14 MFCS Meinel, Switching Graphs and Their Complexity 1989 14 MFCS Iwanowski, Testing Approximate Symmetry in the Plane Is NP-hard 1989 14 MFCS Kowalczyk, Complexity of Decision Problems under Incomplete Information 1989 14 MFCS Ng & Oommen, Generalizing Singly-Linked List Reorganizing Heuristics for Doubly-Linked Lists 1989 14 MFCS Ablayev, On Comparing Probabilistic and Deterministic Automata Complexity of Languages 1989 14 MFCS Andreka & Nemeti & Sain, On the Strength of Temporal Proofs 1989 14 MFCS Manca & Salibra & Scollo, On the Nature of TELLUS (a Typed Equational Logic Look over Uniform Specification) 1989 14 MFCS Yoccoz, Constructive Aspects of the Omega-Rule: Application to Proof Systems in Computer Science and Algorithmic Logic 1989 14 MFCS Peladeau, Logically Defined Subsets of N^k 1989 14 MFCS Weil, On Varietes of Languages Closed under Products with Counter 1989 14 MFCS Petit, Characterization of Recognizable Trace Languages by Distributed Automata 1989 14 MFCS Olderog, Correctness of Concurrent Processes 1989 14 MFCS Mazurkiewicz, Concurrency, Modularity and Synchronization 1989 14 MFCS Kotov & Cherkasova, Concurrent Nondeterministic Processes: Adequacy of Structure and Behaviour 1988 13 MFCS Book, Sparse Sets, Tally Sets, and Polynomial Reducibilities 1988 13 MFCS Boehm, Functional Programming and Combinatory Algebras 1988 13 MFCS Cherkasova, On Models and Algebras for Concurrent Processes 1988 13 MFCS Crochemore, String Matching with Constraints 1988 13 MFCS Hemachandra, Structure of Complexity Classes: Separations, Collapses, and Completeness 1988 13 MFCS Kinber, Inductive Syntactical Synthesis of Programs from Sample Computations 1988 13 MFCS Reif & Storer, 3-Dimensional Shortest Paths in the Presence of Polyhedral Obstacles 1988 13 MFCS Schoening, Robust Oracle Machines 1988 13 MFCS Simon, Recognizable Sets with Multiplicities in the Tropical Semiring 1988 13 MFCS Wirsing & Hennicker & Breu, Reusable Specification Components 1988 13 MFCS Monien & Sudborough, Comparing Interconnection Networks 1988 13 MFCS Ablayev, Probabilistic Automata Complexity of Languages Depends on Language Structure and Error Probability 1988 13 MFCS Allevi & Cherubini & Reghizzi, Breadth-first Phrase Structure Grammars and Queue Automata 1988 13 MFCS Bauernoppel & Jung, Implementing Abstract Data Structures in Hardware 1988 13 MFCS Beauquier & Petit, Distribution of Sequential Processes 1988 13 MFCS Bossut & Dauchet & Warin, Automata and Rational Expressions on Planar Graphs 1988 13 MFCS Bruyere, On Maximal Prefix Sets of Words 1988 13 MFCS Carstensen, Infinite Behaviour of Deterministic Petri Nets 1988 13 MFCS Chlebus & Diks & Radzik, Testing Isomorphism of Outerplanar Graphs in Parallel 1988 13 MFCS Chlebus & Diks & Hagerup & Radzik, Efficient Simulations between Concurrent-Read Concurrent-Write PRAM Models 1988 13 MFCS Danecki, Multiple Propositional Dynamic Logic of Parallel Programs (Extended Abstract) 1988 13 MFCS D'Atri & Moscarini & Sassano, The Steiner Tree Problem and Homogeneous Sets 1988 13 MFCS Dauchet, Termination of Rewriting is Undecidable in the One-Rule Case 1988 13 MFCS Diekert & Vogler, Local Checking of Trace Synchronizability (Extended Abstract) 1988 13 MFCS Diks & Djidjev & Sykora & Vrto, Edge Separators for Planar Graphs and their Applications 1988 13 MFCS Frumkin, A Fast Parallel Algorithm for Eigenvalue Probem of Jacobi Matrices 1988 13 MFCS Gavalda & Balcazar, Strong and Robustly Strong Polynomial Time Reducibilities to Sparse Sets 1988 13 MFCS Geffert, Context-free-like Forms for the Phrase-structure Grammars 1988 13 MFCS Goerdt, On the Expressive Strength of the Finitely Typed Lambda-Terms 1988 13 MFCS Goerdt, Hoare Calculi for Higher-Type Control Structures and their Completeness in the Sense of Cook 1988 13 MFCS Goltz, On Representing CCS Programs by Finite Petri Nets 1988 13 MFCS Howell & Rosier & Yen, A Taxonomy of Fairness and Temporal Logic Problems for Petri Nets 1988 13 MFCS Hromkovic & Prochazka, Branching Programs as a Tool for Proving Lower Bounds on VLSI Computations and Optimal Algorithms for Systolic Arrays 1988 13 MFCS Jukna, Two Lower Bounds for Circuits over the Basis (&,v,-) 1988 13 MFCS Kaplan, Positive/Negative Conditional Rewriting 1988 13 MFCS Kratochvil & Krivanek, On the Computational Complexity of Codes in Graphs 1988 13 MFCS Krause & Meinel & Waack, Separating the Eraser Turing Machine Classes L_e, NL_e, co-NL_e and P_e 1988 13 MFCS Larsen & Thomsen, Compositional Proofs by Partial Specification of Processes 1988 13 MFCS Laurent & Spyratos, Introducing Negative Information in Relational Databases 1988 13 MFCS Le Chenadec, On Positive Occur-Checks in Unification 1988 13 MFCS Lorys & Liskiewicz, Two Applications of Fuerer's Counter to One-tape Nondeterministic TMs 1988 13 MFCS Miyano, Delta_2^p-Complete Lexicographically First Maximal Subgraph Problems 1988 13 MFCS Orlowska, Proof System for Weakest Prespecification and its Applications 1988 13 MFCS Piotrow, On Complexity of Counting 1988 13 MFCS Lu & Qian, Design, Proof and Analysis of New Efficient Algorithms for Incremental Attribute Evaluation 1988 13 MFCS Ruzicka, On Efficiency of Interval Routing Algorithms 1988 13 MFCS Ruzicka & Privara, An Almost Linear Robinson Unification Algorithm 1988 13 MFCS Savicky, Random Boolean Formulas Representing Any Boolean Function with Asymptotically Equal Probability (Extended Abstract) 1988 13 MFCS Slobodova, On the Power of Communication in Alternating Machines 1988 13 MFCS Speckenmeyer, Classes of CNF-Formulas with Backtracking Trees of Exponential or Linear Average Order for Exact-Satisfiability 1988 13 MFCS Varricchio, Bisections of Free Monoids and a New Unavoidable Regularity 1988 13 MFCS Vogler, Failures Semantics and Deadlocking of Modular Petri Nets (Extended Abstract) 1988 13 MFCS Weber, A Decomposition Theorem for Finite-valued Transducers and an Application to the Equivalence Problem 1986 12 MFCS Ablaev & Freivalds, Why Sometimes Probabilistic Algorithms Can Be More Effective 1986 12 MFCS Berstel & Sakarovitch, Recent Results in the Theory of Rational Sets 1986 12 MFCS Broy, Partial Interpretations of Higher Order Algebraic Types 1986 12 MFCS Chytil, Kins of Context-Free Languages 1986 12 MFCS Ehrig & Fey & Parisi-Presicce & Blum, Algebraic Theory of Module Specifications with Constraints 1986 12 MFCS van Emde Boas, A Semantical Model for Integration and Modularization of Rules 1986 12 MFCS von zur Gathen, Parallel Arithmetic Computations: A Survey 1986 12 MFCS Hirose, An Approach to Proof Checkers 1986 12 MFCS Hopcroft, The Promise of Electronic Prototyping 1986 12 MFCS Ibarra, Systolic Arrays: Characterizations and Complexity 1986 12 MFCS Lee, Geometric Location Problems and their Complexity 1986 12 MFCS Munro, Developing Implicit Data Structures 1986 12 MFCS Tiuryn, Higher-Order Arrays and Stacks in Programming: An Application of Complexity Theory to Logics of Programs 1986 12 MFCS Alt & Hagerup & Mehlhorn & Preparata, Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones 1986 12 MFCS Astesiano & Reggio & Wirsing, Relational Specifications and Observational Semantics 1986 12 MFCS Becker, Efficient Testing of Optimal Time Adders 1986 12 MFCS Bublitz & Schurfeld & Voigt & Wegener, Properties of Complexity Measures for PRAMs and WRAMs 1986 12 MFCS Cazanescu, Iterative Systems of Equations 1986 12 MFCS Chistov, Polynomial Complexity of the Newton-Puiseux Algorithm 1986 12 MFCS Chrobak & Rytter, Unique Decipherability for Partially Commutative Alphabet 1986 12 MFCS Culik & Karhumaki, The Equivalence of Finite Valued Transducers (on HDT0L Languages) is Decidable 1986 12 MFCS Diks, A Fast Parallel Algorithm for Six-Colouring of Planar Graphs 1986 12 MFCS Durian, Quicksort without a Stack 1986 12 MFCS Dvorak & Durian, Towards an Efficient Merging 1986 12 MFCS Esik & Domosi & Gecseg & Viragh, Homomorphic Realization of Automata with Composition 1986 12 MFCS Fischer, Refined Bounds on the Complexity of Sorting and Selection 1986 12 MFCS Fischer & Wolfrum, On the Inherent Combinatorial Complexity of Geometric Problems in d-Dimensional Space 1986 12 MFCS Flajolet, The Evolution of Two Stacks in Bounded Space and Random Walks in a Triangle 1986 12 MFCS Fleischhack, P-Genericity and Strong P-Genericity 1986 12 MFCS Frougny, Fibonacci Numeration Systems and Rational Functions 1986 12 MFCS Gamatie, Safe Implementation Equivalence for Asynchronous Nondeterministic Processes 1986 12 MFCS Geffert, Grammars with Context Dependency Restricted to Synchronization 1986 12 MFCS Goralcikova & Koubek, Some Improved Parallelisms for Graphs 1986 12 MFCS Graf, A Complete Inference System for an Algebra of Regular Acceptance Models 1986 12 MFCS Gundermann & Wechsung, Nondeterministic Turing Machines with Modified Acceptance 1986 12 MFCS Hemmerling, Remark on the Power of Compass 1986 12 MFCS Hinz, Regular Chain Code Picture Languages of Nonlinear Descriptional Complexity 1986 12 MFCS Howell & Rosier, An Analysis of the Nonemptiness Problem for Classes of Reversal-Bounded Multicounter Machines 1986 12 MFCS Hromkovic, A New Appproach to Defining the Communication Complexity for VLSI 1986 12 MFCS Jukna, Lower Bounds on the Complexity of Local Circuits 1986 12 MFCS Kolar, Optimal Sorting of Seven Element Sets 1986 12 MFCS Korec, Undecidable Problems Concerning Generalized Pascal Triangles of Commutative Algebras 1986 12 MFCS Koubek & Riha, Regular Augmentation of Automata and Transducers 1986 12 MFCS Kramosil, On Some Types of Pseudo-random Sequences 1986 12 MFCS Kriegel, The Space Complexity of the Accessibility Problem for Undirected Graphs with log n Bounded Genus 1986 12 MFCS Kucera, An Alternative, Priority-Free, Solution to Post's Problem 1986 12 MFCS Kucera & Marchetti-Spaccamela & Protasi & Talamo, Near Optimal Algorithms for Finding Minimum Steiner Trees on Random Graphs 1986 12 MFCS Kuich, Matrix Systems and Principal Cones of Algebraic Power Series 1986 12 MFCS Lange, Two Characterizations of the Logarithmic Alternation Hierarchy 1986 12 MFCS Meinel, P-Projection Reducibility and the Complexity Classes L(nonuniform) and NL(nonuniform) 1986 12 MFCS Mery, A Proof System To Derive Eventuality Properties Under Justice Hypothesis 1986 12 MFCS Nait Abdallah, Al-Khowarizmi: A Formal System for Higher-Order Logic Programming 1986 12 MFCS Romian & Sakarovitch, One-Sided Dyck Reduction over Two Letter Alphabet and Deterministic Context-Free Languages 1986 12 MFCS Rozoy, Model and Complexity of Termination for Distributed Computations 1986 12 MFCS Rutenburg, Complexity of Generalized Graph Coloring 1986 12 MFCS Spirakis, The Parallel Complexity of Deadlock Detection 1986 12 MFCS Staiger & Nehrlich, The Centers of Context-Sensitive Languages 1986 12 MFCS Tarhio & Ukkonen, A Greedy Algorithm for Constructing Shortest Common Superstrings 1986 12 MFCS Vogler, The OI-Hierarchy Is Closed Under Control 1986 12 MFCS Weber & Seidl, On the Degree of Ambiguity of Finite Automata 1986 12 MFCS Ras & Zemankova, Learning in Knowledge Based Systems, a Probabilistic Approach 1986 12 MFCS Goldreich & Micali & Wigderson, Proofs that Release Minimum Knowledge 1984 11 MFCS Balcazar, Separating, Strongly Separating, and Collapsing Relativized Complexity Classes 1984 11 MFCS Chistov & Grigor'ev, Complexity of Quantifier Elimination in the Theory of Algebraically Closed Fields 1984 11 MFCS Gruska, Systolic Automata--Power, Characterizations, Nonhomogeneity 1984 11 MFCS Hoffman, A Note on Unique Decipherability 1984 11 MFCS Hotz, Outline of an Algebraic Language Theory 1984 11 MFCS Jantzen, Thue Systems and the Church-Rosser Property 1984 11 MFCS Longo, Limits, Higher Type Computability and Type-free Languages 1984 11 MFCS Mazurkiewicz, Traces, Histories, Graphs: Instances of a Process Monoid 1984 11 MFCS Perrin, Recent Results on Automata and Infinite Words 1984 11 MFCS Preparata, VLSI Algorithms and Architectures 1984 11 MFCS Semenov, Decidability of Monadic Theories 1984 11 MFCS Albert, On the Ehrenfeucht Conjecture on Test Sets and its Dual Version 1984 11 MFCS Balcazar & Book & Schoening, Sparse Oracles, Lowness, and Highness 1984 11 MFCS Beauquier & Thimonier, Computability of Probabilistic Parameters for Some Classes of Formal Languages 1984 11 MFCS Brandenburg, A Truly Morphic Characterization of Recursively Enumerable Sets 1984 11 MFCS Broy, On the Herbrand Kleene Universe for Nondeterministic Computations 1984 11 MFCS Burkhard, An Investigation of Controls for Concurrent Systems of Abstract Control Languages 1984 11 MFCS Cerny, On Generalized Words of Thue-Morse 1984 11 MFCS Chrobak, Nondeterminism is Essential for Two-way Counter Machines 1984 11 MFCS Costa & Stirling, Weak and Strong Fairness in CCS 1984 11 MFCS Daley & Smith, On the Complexity of Inductive Inference 1984 11 MFCS Edelsbrunner & Welzl, Monotone Edge Sequences in Line Arrangements and Applications 1984 11 MFCS Enjalbert & Michel, Many-sorted Temporal Logic for Multiprocesses Systems 1984 11 MFCS Habasinski, Process Logics: Two Decidability Results 1984 11 MFCS Hemmerling & Kriegel, On Searching of Special Classes of Mazes and Finite Embedded Graphs 1984 11 MFCS Hennessy & Stirling, The Power of Future Perfect in Program Logics 1984 11 MFCS Hromkovic, Hierarchy of Reversal and Zerotesting Bounded Multicounter Machines 1984 11 MFCS Hromkovic, On the Power of Alternation in Finite Automata 1984 11 MFCS Ibarra & Rosier, The Equivalence Problem and Correctness Formulas for a Simple Class of Programs 1984 11 MFCS Jaromczyk, Lower Bounds for Polygon Simplicity Testing and Other Problems 1984 11 MFCS Kanovic, A Uniform Independence of Invariant Sentences 1984 11 MFCS Karhumaki & Kleijn, On the Equivalence of Compositions of Morphisms and Inverse Morphisms on Regular Languages 1984 11 MFCS Kowalczyk, Some Connections between Presentability of Complexity Classes and the Power of Formal Systems of Reasoning 1984 11 MFCS Kucera, Finding a Maximum Flow in (s,t)-planar Network in Linear Expected Time 1984 11 MFCS Lange, Nondeterministic Logspace Reductions 1984 11 MFCS Lenstra, Factoring Multivariate Polynomials over Algebraic Number Fields 1984 11 MFCS Longo & Moggi, Goedel Numberings, Principal Morphisms, Combinatory Algebras 1984 11 MFCS de Luca & Restivo, Representation of Integers and Language Theory 1984 11 MFCS Moravek & Pudlak, New Lower Bound for Polyhedral Membership Problem with an Application to Linear Programming 1984 11 MFCS Nepomnjashchaja, Decidability of the Equivalence Problem for Synchronous Deterministic Pushdown Automata 1984 11 MFCS De Nicola, Models and Operators for Nondeterministic Processes 1984 11 MFCS Oommen, Algorithms for String Editing which Permit Arbitrarily Complex Edit Constraints 1984 11 MFCS Orponen & Schoening, The Structure of Polynomial Complexity Cores 1984 11 MFCS Ottmann & Widmayer, Solving Visibility Problems by Using Skeleton Structures 1984 11 MFCS Poigne, Another Look at Parameterization Using Algebras with Subsorts 1984 11 MFCS Pudlak, A Lower Bound on Complexity of Branching Programs 1984 11 MFCS Reiterman & Trnkova, From Dynamic Algebras to Test Algebras 1984 11 MFCS Robson, Combinatorial Games with Exponential Space Complete Decision Problems 1984 11 MFCS Rytter, Fast Recognitions of Pushdown Automaton and Context-free Languages 1984 11 MFCS Starke, Multiprocessor Systems and their Concurrency 1984 11 MFCS Tarlecki, Free Constructions in Algebraic Institutions 1984 11 MFCS Tiuryn & Urzyczyn, Remarks on Comparing Expressive Power of Logics of Programs 1984 11 MFCS Wagner, The Complexity of Problems Concerning Graphs with Regularities 1984 11 MFCS Wegener, On the Complexity of Slice Functions 1984 11 MFCS Zak, An Exponential Lower Bound for One-Time-Only Branching Programs 1984 11 MFCS Sipser, A Topological View of Some Problems in Complexity Theory 1984 11 MFCS Danecki, Propositional Dynamic Logic with Strong Loop Predicate 1981 10 MFCS Bentley & Ottman, The Complexity of Manipulating Hierarchically Defined Sets of Rectangles 1981 10 MFCS Ershov, The Transformational Machine: Theme and Variations 1981 10 MFCS Freivalds, Probabilistic Two-way Machines 1981 10 MFCS Joseph & Young, A Survey of Some Recent Results on Computational Complexity in Weak Theories of Arithmetic 1981 10 MFCS Korte & Schrader, A Survey on Oracle Techniques 1981 10 MFCS Monien & Sudborough, Time and Space Bounded Complexity Classes and Bandwidth Constrained Problems 1981 10 MFCS Nesetril, Representations of Graphs by Means of Products and their Complexity 1981 10 MFCS Nijholt, Parsing Strategies: A Concise Survey 1981 10 MFCS van Leeuwen & Overmars, The Art of Dynamizing 1981 10 MFCS Valiant & Skyum, Fast Parallel Computation of Polynomials Using Few Processors 1981 10 MFCS Valk, Generalizations of Petri Nets 1981 10 MFCS Alt & Mehlhorn & Munro, Partial Match Retrieval in Implicit Data Structures 1981 10 MFCS Andreka & Nemeti & Sain, A Characterization of Floyd-provable Programs 1981 10 MFCS Astesiano & Zucca, Semantics of CSP via Translation into CCS 1981 10 MFCS Ehrich, On Realization and Implementation 1981 10 MFCS Grigor'ev, Multiplicative Complexity of a Bilinear Form over a Commutative Ring 1981 10 MFCS Hajek, Making Dynamic Logic First-Order 1981 10 MFCS Horejs, Partial Interpretations of Program Schemata 1981 10 MFCS Hromkovic, Closure Properties of the Family of Languages Recognized by One-way Two-head Deterministic Finite State Automata 1981 10 MFCS Janiga, Another Hierarchy Defined by Multihead Finite Automata 1981 10 MFCS Jaromczyk, An Extension of Rabin's Complete Proof Concept 1981 10 MFCS Jensen, How to Find Invariants for Coloured Petri Nets 1981 10 MFCS Jung, Relationships between Probabilistic and Deterministic Tape Complexity 1981 10 MFCS Beauquier & Berstel, More about the ``Geography'' of Context-free Languages 1981 10 MFCS Bergstra & Broy & Tucker & Wirsing, On the Power of Algebraic Specifications 1981 10 MFCS Bertoni & Brambilla & Mauri & Sabadini, An Application of the Theory of Free Partially Commutative Monoids: Asymptotic Densities of Trace Languages 1981 10 MFCS Book & Jantzen & Monien & O'Dunlaing & Wrathall, On the Complexity of Word Problems in Certain Thue Systems 1981 10 MFCS Brandenburg, On the Transformation of Derivation Graphs to Derivation Trees 1981 10 MFCS Brandstadt, Pushdown Automata with Restricted Use of Storage Symbols 1981 10 MFCS Cherkasova & Kotov, Structured Nets 1981 10 MFCS Daley, Retraceability, Repleteness and Busy Beaver Sets 1981 10 MFCS Damm & Guessarian, Combining T and Level-N 1981 10 MFCS Kelemenova, Grammatical Levels of the Position Restricted Grammars 1981 10 MFCS Kleijn & Rozenberg, A General Framework for Comparing Sequential and Parallel Rewriting 1981 10 MFCS Knoedel, A Bin Packing Algorithm with Complexity O(n log n) and Performance 1 in the Stochastic Limit 1981 10 MFCS Korec, Codings of Nonnegative Integers 1981 10 MFCS Koubek & Riha, The Maximum k-Flow in a Network 1981 10 MFCS Kreowski & Rozenberg, On the Constructive Description of Graph Languages Accepted by Finite Automata 1981 10 MFCS Kriegel & Vaishnavi, Weighted Multidimensional B-Trees Used as Nearly Optimal Dynamic Dictionaries 1981 10 MFCS Kucera, Maximum Flow in Planar Networks 1981 10 MFCS Lieberherr, Probabilistic Combinatorial Optimization 1981 10 MFCS Meyer auf der Heide, Time-Processor Trade-offs for Universal Parallel Computers 1981 10 MFCS Pittl, Negative Results on the Size of Deterministic Right Parsers 1981 10 MFCS Pokorny, Key-Equivalence of Functional Dependency Statements Systems 1981 10 MFCS Reiterman & Trnkova, On Representation of Dynamic Algebras with Reversion 1981 10 MFCS Rovan, A Framework for Studying Grammars 1981 10 MFCS Sazanov, On Existence of Complete Predicate Calculus in Meta-Mathematics without Exponentiation 1981 10 MFCS Soisalon-Soininen & Wood, On Structural Similarity of Context-free Grammars 1981 10 MFCS Sokolowski, Axioms for the Term-wise Correctness of Programs 1981 10 MFCS Staiger, Complexity and Entropy 1981 10 MFCS Steiner, Axiomatic Semantics of Indirect Addressing 1981 10 MFCS Tanaka & Kambayashi, Testing of Join Dependency by a Modified Chase Method 1981 10 MFCS Wedde, A Starvation-free Solution of the Dining Philosophers' Problem by Use of Interaction Systems 1981 10 MFCS Weihrauch & Schafer, Admissible Representations of Effective cpo's 1981 10 MFCS Wiedermann, Preserving Total Order in Constant Expected Time 1981 10 MFCS Kanda, Constructive Category Theory (No. 1) 1981 10 MFCS Budach, Two Pebbles Don't Suffice 1980 9 MFCS Bjorner, Formal Description of Programming Concepts: A Software Engineering Viewpoint 1980 9 MFCS Burstall, Electronic Category Theory 1980 9 MFCS Genrich & Lautenbach & Thiagarajan, Substitution Systems: A Family of System Models Based on Concurrency 1980 9 MFCS Hartmanis & Mahaney, An Essay about Research on Sparse NP Complete Sets 1980 9 MFCS Keller, Some Theoretical Aspects of Applicative Multiprocessing 1980 9 MFCS Wong, On Some Discrete Optimization Problems in Mass Storage Systems 1980 9 MFCS Wulf, Abstract Data Types: A Retrospective and Prospective View 1980 9 MFCS Arnold & Nivat, Controlling Behaviours of Systems, Some Basic Concepts and Some Applications 1980 9 MFCS Ausiello & Bartini & Moscarini, Conceptual Relations between Data Bases Transformed under Join and Projection 1980 9 MFCS Barenguer & Diaz, The Weighted Sperner's Set Problem 1980 9 MFCS Best, Proof of a Concurrent Program Finding Euler Path 1980 9 MFCS Bibel, A Theoretical Basis for the Systematic Proof Method 1980 9 MFCS Brock, Consistent Semantics for a Data Flow Language 1980 9 MFCS Cardelli, Analog Processes 1980 9 MFCS Coppo, An Extended Polymorphic Type System for Applicative Languages 1980 9 MFCS Danko, A Criterion of Undecidability of Algorithmic Theories 1980 9 MFCS Degano & Lomanto & Sirovich, On Finding the Optimal Access Path to Resolve a Relational Data Base Query 1980 9 MFCS Ehrig & Kreowski & Mahr & Padawitz, Compound Algebraic Implementations: An Approach to Stepwise Refinement of Software Systems 1980 9 MFCS Harel, On And/Or Schemes 1980 9 MFCS Hennessy & Plotkin, A Term Model for CCS 1980 9 MFCS Hoffmann & Schmiedecke, A Mathematical Approach to Multi-Pass Parsing 1980 9 MFCS Hupback, Abstract Implementation of Abstract Data Type 1980 9 MFCS Ja'Ja' & Simon, Parallel Algorithms in Graph Theory: Planarity Testing 1980 9 MFCS Janicki, On Atomic Nets and Concurrency Relations 1980 9 MFCS Janssens & Rozenberg, Node-Label Controlled Graph Grammars 1980 9 MFCS Jensen, A Method to Compare the Descriptive Power of Different Types of Petri Nets 1980 9 MFCS Klaeren, A Simple Class of Algorithmic Specifications for Abstract Software Modules 1980 9 MFCS Kraft & Wedde, Introducing Patterns of Behaviour in Distributed System Parts 1980 9 MFCS Kupka, Van Wijngaarden Grammars as a Special Information Processing Model 1980 9 MFCS Kwong & Wood, Approaches to Concurrency in B-Trees 1980 9 MFCS Monien, On a Subclass of Pseudopolynomial Problems 1980 9 MFCS Muller, Decidability of Reachability in Persistent Vector Replacement Systems 1980 9 MFCS Okoma, Generalized Heapsort 1980 9 MFCS Ono & Nakamura, Decidability Results on a Query Language for Data Bases with Incomplete Information 1980 9 MFCS Padawitz, New Results on Completeness and Consistency of Abstract Data Types 1980 9 MFCS Pearl, Asymptotic Complexity of Game-Searching Procedures 1980 9 MFCS Rasiowa, Completeness in Classical Logic of Complex Algorithms 1980 9 MFCS Reichel, Initially Restricting Algebraic Theories 1980 9 MFCS Reising, Schemes for Nonsequential Processing Systems 1980 9 MFCS Reiterman & Trnkova, Dynamic Algebras which are not Kripke Structures 1980 9 MFCS Ruzicka, Time and Space Bounds in Producing Certain Partial Orders 1980 9 MFCS Salwicki, Axioms of Algorithmic Logic Univocally Determine Semantics of Programs 1980 9 MFCS Sazonov, A Logical Approach to the Problem ``P = NP'' 1980 9 MFCS Shields & Lauer, Programming and Verifying Concurrent Systems in COSY 1980 9 MFCS Sifakis, Deadlocks and Livelocks in Transition Systems 1980 9 MFCS Slutzki, Descriptional Complexity of Concurrent Processes 1980 9 MFCS Sokolowski, A Uniform Approach to Applicative and Imperative Features in Programming Languages 1980 9 MFCS Suraj, A Resource Allocation Problem 1980 9 MFCS Takaoka & Moffat, An O(n^2 log n log log n) Expected Time Algorithm for the All Shortest Distance Problem 1980 9 MFCS Valiev, Decision Complexity of Variants of Propositional Dynamic Logic 1980 9 MFCS Vitanyi, Relativized Obliviousness 1980 9 MFCS Wirsing & Broy, Abstract Data Types as Lattices of Finitely Generated Models 1980 9 MFCS Witaszek, The LR(k) Parser 1979 8 MFCS de Bakker, A Sound and Complete Proof System for Partial Program Correctness 1979 8 MFCS Barzdin, The Problem of Reachability and Verification of Programs 1979 8 MFCS Blikle, Assertion Programming 1979 8 MFCS Book, Complexity Classes of Formal Languages 1979 8 MFCS Freivalds, Fast Probabilistic Algorithms 1979 8 MFCS Hartmanis & Baker, Relative Succinctness of Representations of Languages and Separation of Complexity Classes 1979 8 MFCS Havel, On Two Types of Loops 1979 8 MFCS Hennessy & Plotkin, Full Abstraction for a Simple Parallel Programming Language 1979 8 MFCS Maurer, On Some Developments in Cryptography and their Applications to Computer Science 1979 8 MFCS Mehlhorn, Searching, Sorting and Information Theory 1979 8 MFCS Milner, LCF: A Way of Doing Proofs with a Machine 1979 8 MFCS Pratt, Axioms or Algorithms 1979 8 MFCS Salomaa, Power from Power Series 1979 8 MFCS Slisenko, Computational Complexity of String and Graph Identification 1979 8 MFCS Wood, A Survey of Grammar and L Forms--1978 1979 8 MFCS Adachi & Kasai & Moriya, A Theoretical Study on the Time Analysis of Programs 1979 8 MFCS Andreka & Nemeti & Sain, Completeness Problems in Verification of Programs and Program Schemes 1979 8 MFCS Autebert, Relationships between AFDL's and Cylinders 1979 8 MFCS Comyn & Werner, Computable Data Types 1979 8 MFCS Cousineau & Enjalbert, Program Equivalence and Provability 1979 8 MFCS Culik & Karhumaki, Interactive L Systems with Almost Interactionless Behaviour 1979 8 MFCS Daley, On the Simplification of Constructions in Degrees of Unsolvability via Computational Complexity 1979 8 MFCS Damm, An Algebraic Extension of the Chomsky Hierarchy 1979 8 MFCS Dekhtjar, Bounds on Computational Complexity and Approximability of Initial Segments of Recursive Sets 1979 8 MFCS Fischer, On the Weighted Path Length of Binary Search Trees for Unknown Access Probabilities 1979 8 MFCS Gens & Levner, Computational Complexity of Approximation Algorithms for Combinatorial Problems 1979 8 MFCS Goralcikova & Koubek, A Reduct-and-Closure Algorithm for Graphs 1979 8 MFCS Gregusova & Korec, Small Universal Minski Machines 1979 8 MFCS Kamimura & Slutzki, Parallel and Two-way Recognizers of Directed Acyclic Graphs 1979 8 MFCS Kanda, Fully Effective Solutions of Recursive Domain Equations 1979 8 MFCS Kramosil, A Note on Computational Complexity of a Statistical Deducibility Testing Procedure 1979 8 MFCS Kudlek, Context Free Normal Systems 1979 8 MFCS Linna & Penttonen, New Proofs for Jump DPDA's 1979 8 MFCS de Luca & Restivo, Synchronization and Maximality for Very Pure Subsemigroups of a Free Semigroup 1979 8 MFCS Marandzjan, On the Sets of Minimal Indices of Partial Recursive Functions 1979 8 MFCS Mehlhorn, Some Remarks on Boolean Sums 1979 8 MFCS Mirkowska, On the Propositional Algorithmic Logic 1979 8 MFCS Nijholt & Soisalon-Soininen, Ch(k) Grammars: A New Characterization of LL(k) Languages 1979 8 MFCS Ottmann & Wood, A Uniform Approach to Balanced Binary and Multiway Trees 1979 8 MFCS Paun, On the Generative Capacity of Some Classes of Grammars with Regulated Rewriting 1979 8 MFCS Ruzicka, Validity Test for Floyd's Operator-Precedence Parsing Algorithms 1979 8 MFCS Starke, On the Languages of Bounded Petri Nets 1979 8 MFCS Tegze, Dyck Language D_2 is not Absolutely Parallel 1979 8 MFCS Tiuryn, Fixed Points in Power-set Algebra of Infinite Trees 1979 8 MFCS Trakhtenbrot, On Relaxation Rules in Algorithmic Logic 1979 8 MFCS Trnkova, L-Fuzzy Functorial Automata 1979 8 MFCS Tseytlin, Schematics of Structural Parallel Programming and its Applications 1979 8 MFCS Valiev, On Axiomatization of Deterministic Propositional Dynamic Logic 1979 8 MFCS Wagner, Bounded Recursion and Complexity Classes 1979 8 MFCS Wechler, Characterization of Rational and Algebraic Power Series 1979 8 MFCS Wechsung, A Crossing Measure for 2-tape Turing Machines 1979 8 MFCS Wiedermann, The Complexity of Lexicographic Sorting and Searching 1979 8 MFCS Winkowski, An Algebraic Approach to Concurrence 1979 8 MFCS Yamasaki, On Multitape Automata 1979 8 MFCS Zak, A Turing Machine Oracle Hierarchy 1979 8 MFCS Berry & Levy, A Survey of Some Syntactic Results in the lambda-Calculus 1979 8 MFCS Cousineau & Nivat, On Rational Expressions Representing Infinite Rational Trees: Application to the Structure of Flow Charts 1978 7 MFCS van Emde Boas, The Connection between Modal Logic and Algorithmic Logic 1978 7 MFCS Courcelle & Nivat, The Algebraic Semantics of Recursive Program Schemes 1978 7 MFCS Dijkstra, Finding the Correctness Proof of a Concurrent Program 1978 7 MFCS Kotov, An Algebra for Parallelism Based on Petri Nets 1978 7 MFCS Mayoh, Data Types as Functions 1978 7 MFCS Milner, Synthesis of Communicating Behaviour 1978 7 MFCS Wagner & Thatcher & Wright, Programming Languages as Mathematical Objects 1978 7 MFCS Auguston, Writing and Verifying Sequential Files Updating Programs 1978 7 MFCS Bancilhon, On the Completeness of Query Languages for Relational Data Bases 1978 7 MFCS Barth, Mastering Context Sensitivity in Programming Languages 1978 7 MFCS Bergstra, Decision Problems Concerning Parallel Programming 1978 7 MFCS Dembinski & Maluszynski, Attribute Grammars and Two-level Grammars: A Unifying Approach 1978 7 MFCS Ehrich, Extensions and Implementations of Abstract Data Types Specifications 1978 7 MFCS Ehrig & Rosen, Concurrency of Manipulations in Multidimensional Information Structures 1978 7 MFCS Ehrig & Kreowski & Maggiolo-Schettini & Rosen & Winkowski, Deriving Structures from Structures 1978 7 MFCS Francez & Hoare & de Roever, Semantics of Nondeterminism, Concurrency and Communication 1978 7 MFCS Gardarin, Contribution to the Theory of Concurrency in Databases 1978 7 MFCS Genrich & Lautenbach, Facts in Place/Transition-Nets 1978 7 MFCS Goetze & Nehrlich, Loop Programs and Classes of Primitive Recursive Functions 1978 7 MFCS Grabowski & Kreczmar, Dynamic Theories of Real and Complex Numbers 1978 7 MFCS Grigoriev, Multiplicative Complexity of a Pair of Bilinear Forms and of the Polynomial Multiplication 1978 7 MFCS Guessarian, Some Applications of Algebraic Semantics 1978 7 MFCS Hogger, Goal-oriented Derivation of Logic Programs 1978 7 MFCS Irlik, Transforming Recursion Equations to Algorithms 1978 7 MFCS Jacob, Structural Invariants for Some Classes of Structured Programs 1978 7 MFCS Janicki, Synthesis of Concurrent Schemes 1978 7 MFCS Klette, Fast Matrix Multiplication by Boolean RAM in Linear Storage 1978 7 MFCS Knuth, Cycles of Partial Orders 1978 7 MFCS Lischke, Complexity Measures Defined by Mazurkiewicz-algorithms 1978 7 MFCS Lukaszewicz, On Functional Grammars 1978 7 MFCS Markowsky & Carter & Wegman, Analysis of a Universal Class of Hash Functions 1978 7 MFCS Meyer, A Framework for Producing Deterministic Canonical Bottom-up Parsers 1978 7 MFCS Meersman & Rozenberg, Cooperating Grammar Systems 1978 7 MFCS Moalla & Pulou & Sifakis, Synchronized Petri Nets: A Model for the Description of Non-autonomous Systems 1978 7 MFCS Nepomniaschy, On Divergence and Halting Problems for Monadic Program Schemas 1978 7 MFCS Nevalainen & Jakobsson & Berg, Compression of Clustered Inverted Files 1978 7 MFCS Parikh, The Completeness of Propositional Dynamic Logic 1978 7 MFCS Pettorossi, Improving Memory Utilization in Transforming Recursive Programs 1978 7 MFCS Pittl, On Two Subclasses of Real-time Grammars 1978 7 MFCS Ras, On Information Storage and Retrieval Systems, an Algebraic Approach, Part 1 1978 7 MFCS Saheb-Djahromi, Probabilistic LCF 1978 7 MFCS Salwicki, On Algorithmic Theory of Stacks 1978 7 MFCS Schiffers & Wedde, Analyzing Program Solutions of Coordination Problems by CP-nets 1978 7 MFCS Sifakis, Structural Properties of Petri Nets 1978 7 MFCS Sintzoff, Ensuring Correctness by Arbitrary Postfixed-points 1978 7 MFCS Slisenko, String-matching in Real-time: Some Properties of the Data Structure 1978 7 MFCS Spyratos & Bancilhon, Name Independence and Database Abstraction in the Relational Model 1978 7 MFCS Starke, Free Petri Net Languages 1978 7 MFCS Ukkonen, Transformations to Produce Certain Covering Grammars 1978 7 MFCS Valk, On the Computational Power of Extended Petri Nets 1978 7 MFCS Rissanen, Theory of Relations for Databases--A Tutorial Survey 1977 6 MFCS Ausiello, On the Structure and Properties of NP-Complete Problems and their Associated Optimization Problems 1977 6 MFCS Blikle, A Comparative Review of Some Program Verification Methods 1977 6 MFCS Boasson, Classification of the Context-free Languages 1977 6 MFCS Elgot, Finite Automaton from a Flowchart Scheme Point of View 1977 6 MFCS Engeler, A New Type of Models of Computation 1977 6 MFCS Ershov & Itkin, Correctness of Mixed Computation in Algol-like Programs 1977 6 MFCS Gecseg & Toth, Algebra and Logic in Theoretical Computer Science 1977 6 MFCS Kacewicz & Wozniakowski, A Survey of Recent Problems and Results in Analytic Computational Complexity 1977 6 MFCS Maurer & Ottmann, Tree-Structures for Set Manipulation Problems 1977 6 MFCS Salwicki, Applied Algorithmic Logic 1977 6 MFCS Schnorr, Improved Lower Bounds on the Number of Multiplications/Divisions which are Necessary to Evaluate Polynomials 1977 6 MFCS Trakhtenbrot, Frequency Algorithms and Computations 1977 6 MFCS Valiant, Graph-theoretic Arguments in Low-level Complexity 1977 6 MFCS Wechsung, Properties of Complexity Classes: A Short Survey 1977 6 MFCS Wright & Wagner & Thatcher, A Uniform Approach to Inductive Posets and Inductive Closure 1977 6 MFCS Agafonov, Generalized Probabilistic Grammars 1977 6 MFCS Ausiello & Atri & Gaudiano & Protasi, Classes of Structurally Isomorphic NP-Optimization Problems 1977 6 MFCS Autebert, Pushdown-automata and Families of Languages Generating Cylinders 1977 6 MFCS de Bakker, Semantics of Infinite Processes Using Generalized Trees 1977 6 MFCS Benda & Bendova, Characterization of Recognizable Families by Means of Regular Languages 1977 6 MFCS Bertoni & Mauri & Torelli, An Algebraic Approach to Problem Solution and Problem Semantics 1977 6 MFCS Cerny, Complexity and Minimality of Context-free Grammars and Languages 1977 6 MFCS Chytil, Comparison of the Active Visiting and the Crossing Complexities 1977 6 MFCS Hajek, Arithmetical Complexity of Some Problems in Computer Science 1977 6 MFCS von Henke, Formal Transformations and the Development of Programs 1977 6 MFCS Horvath, Optimal RASP Programs for Arbitrarily Complex 0-1 Valued Functions 1977 6 MFCS Janssen & van Emde Boas, The Expressive Power of Intensional Logic in the Semantics of Programming Languages 1977 6 MFCS Kanovic, On the Complexity of Equivalent Transformations in Programming Languages 1977 6 MFCS Kasyanov & Pokrovsky, Schematology in a Multi-Language Optimizer 1977 6 MFCS Korec, Decidability (Undecidability) of Equivalence of Minsky Machines with Components Consisting of at Most Seven (Eight) Instructions 1977 6 MFCS Kral, A Top-down No Backtrack Parsing of General Context-free Languages 1977 6 MFCS Kramosil, A Probabilistic Restriction of Branching Plans 1977 6 MFCS Kudlek & Novotny, Reducing Operators for Normed General Formal Systems 1977 6 MFCS Levin & V'jugin, Invariant Properties of Informational Bulks 1977 6 MFCS Linna, Two Decidability Results for Deterministic Pushdown Automata 1977 6 MFCS Lipski, On the Logic of Incomplete Information 1977 6 MFCS De Luca & Termini, Measures of Ambiguity in the Analysis of Complex Systems 1977 6 MFCS Meersman & Rozenberg, Two-level Meta-controlled Substitution Grammars 1977 6 MFCS Miglioli & Ornaghi, A Calculus to Build Up Correct Programs 1977 6 MFCS Ng & Bang, Another Approach for Proving Program Correctness 1977 6 MFCS Nijholt, Cover Results and Normal Forms 1977 6 MFCS Peckel, On a Deterministic Subclass of Context-free Languages 1977 6 MFCS Pittl, Exponential Optimization for the LLP(k) Parsing Method 1977 6 MFCS Preparata, The Medial Axis of a Simple Polygon 1977 6 MFCS Raulefs, Semantics and Proof Rules for Coroutine Hierarchies in Block-structured Programming Languages 1977 6 MFCS Rozenberg & Vermeir, Acceptors for Iteration Languages 1977 6 MFCS Ruzicka & Wiedermann, How Good is the Adversary Lower Bound? 1977 6 MFCS Sokolowski, Total Correctness for Procedures 1977 6 MFCS Sturc, A Model for Retrieval Systems and Some Mathematical Problems Behind 1977 6 MFCS Sudborough, Time and Tape Bounded Auxiliary Pushdown Automata 1977 6 MFCS Sykora, A Fast Non-commutative Algorithm for Matrix Multiplication 1977 6 MFCS Tiuryn, Fixed-points and Algebras with Infinitely Long Expressions, I 1977 6 MFCS Trnkova & Adamek, On Languages, Accepted by Machines in the Category of Sets 1977 6 MFCS Valiev, Real Time Computations with Restrictions on Tape Alphabet 1977 6 MFCS Vianu, The Bodnarchuk Metric Space of Languages and the Topology of the Learning Space 1977 6 MFCS Wagner & Wechsung, Complexity Hierarchies of Oracles 1977 6 MFCS Wedde & Winkowski, Determining Processes by Violations 1977 6 MFCS Weicker, The Influence of the Machine Model on the Time Complexity of Context-free Language Recognition 1977 6 MFCS Weihrauch, A Generalized Computability Thesis 1977 6 MFCS Wiehagen, Identification of Formal Languages 1977 6 MFCS Goguen & Meseguer, Correctness of Recursive Flow Diagram Programs 1976 5 MFCS Apt & de Bakker, Exercises in Denotational Semantics 1976 5 MFCS Brauer, W-Automata and their Languages 1976 5 MFCS Cadiou, On Semantic Issues in the Relational Model of Data 1976 5 MFCS Dijkstra, The Effective Arrangement of Logical Systems 1976 5 MFCS Germano & Maggiolo-Schettini, Recursivity, Sequence Recursivity, Stack Recursivity and Semantics of Programs 1976 5 MFCS Gruska, Descriptional Complexity (of Languages)--A Short Survey 1976 5 MFCS Havel, On the Branching Structure of Languages 1976 5 MFCS Nagorny, Algorithms and Real Numbers 1976 5 MFCS Novotny, On Mappings of Machines 1976 5 MFCS Salomaa, Recent Results on L Systems 1976 5 MFCS Starke, Decision Problems for Multi-Tape Automata 1976 5 MFCS Trakhtenbrot, Recursive Program Schemes and Computable Functionals 1976 5 MFCS Wagner & Wright & Goguen & Thatcher, Some Fundamentals of Order-Algebraic Semantics 1976 5 MFCS Agafonov, On Attribute Grammars 1976 5 MFCS Aiello & Aiello & Attardi & Cavallari & Prini, Formal Definition of Semantics of Generalized Control Regimes 1976 5 MFCS Bainbridge, Minimal While Programs 1976 5 MFCS Benda & Bendova, On Specific Features of Recognizable Families of Languages 1976 5 MFCS Bergmann, On the Termination of Simple Computer Programs 1976 5 MFCS Berthelot & Roucairol, Reduction of Petri Nets 1976 5 MFCS Brunner & Wechler, On Behaviour of R-Fuzzy Automata 1976 5 MFCS Buda, Cannonizing Reducibility Method in the Theory of Program Schemata 1976 5 MFCS Choffrut, Strongly Connected G-S-M Mappings Preserving Conjugation 1976 5 MFCS Chytil, Analysis of the Non-Context-Free Component of Formal Languages 1976 5 MFCS Colombetti & Pagello, Programs, Computations and Temporal Features 1976 5 MFCS Coy, A Note on the Automatic Generation of Inductive Assertions 1976 5 MFCS Cremers & Hibbard, On the Relationship between a Procedure and its Data 1976 5 MFCS Dekhtyar, On the Relativization of Deterministic and Nondeterministic Complexity Classes 1976 5 MFCS Dinca, The Metric Properties on the Semigroups and the Languages 1976 5 MFCS Dobkin & Lipton, A Lower Bound of 1/2 n^2 on Linear Search Programs for the Knapsack Problem 1976 5 MFCS Dorfler, The Direct Product of Automata and Quasi-Automata 1976 5 MFCS Ehrich, An Axiomatic Approach to Information Structures 1976 5 MFCS Ehrig & Kreowski, Parallelism of Manipulations in Multidimensional Information Structures 1976 5 MFCS Ginsburg & Mayer, On Strict Interpretations of Grammar Forms 1976 5 MFCS Gorun, A Hierarchy of Context-Sensitive Languages 1976 5 MFCS Gorski, On Consecutive Storage of Records 1976 5 MFCS Grabowski, A Remark on Equivalence of Mazurkiewicz's Finite-Control Algorithms over Nets 1976 5 MFCS Hansen & Leszczylowski, Microprogram-Oriented Model of the Controlled Structure 1976 5 MFCS Harrison, Relations between Programs with Different Storage Requirements 1976 5 MFCS von Henke, An Algebraic Approach to Data Types, Program Verification, and Program Synthesis 1976 5 MFCS Hopner & Opp, About Three Equational Classes of Languages Built Up by Shuffle Operations 1976 5 MFCS Huwig, A Machine Independent Description of Complexity Classes, Definable by Nondeterministic as well as Deterministic Turing Machines with Primitive Recursive Tape or Time Bounds 1976 5 MFCS Indermark, Schemes with Recursion on Higher Types 1976 5 MFCS Irlik, Constructing Iterative Version of a System of Recursive Procedures 1976 5 MFCS Issel, A Method Using a Set-Theoretical Formalism to Describe the Semantics of Programming Languages 1976 5 MFCS Jagielski, The Cubic Search Method 1976 5 MFCS Janicki, Vectors of Coroutines 1976 5 MFCS Jedrzejowicz, One-One Degrees of Turing Machines Decision Problems 1976 5 MFCS Kelemen, Heuristic Representation of State-Space by Finite Automaton 1976 5 MFCS Knast Semigroup Characterizations of Some Language Varieties 1976 5 MFCS Kreczmar, On Memory Requirements of Strassen's Algorithms 1976 5 MFCS Kwasowiec, Determinism in Concurrent Systems 1976 5 MFCS Lautenbach & Wedde, Generating Control Mechanisms by Restrictions 1976 5 MFCS Laski, On Diagnosis of Algorithmical Processes 1976 5 MFCS Mikolajczak, On Some Properties of Cyclic Automata and their Extensions 1976 5 MFCS Mosses, Compiler Generation Using Denotational Semantics 1976 5 MFCS Nepomniaschy, On Divergence Problem for Program Schemas 1976 5 MFCS Nijholt, On the Parsing of LL-Regular Grammars 1976 5 MFCS Perrin, The Characteristic Polynomial of a Finite Automaton 1976 5 MFCS Prusinkiewicz, Error Detection Using Regular Languages 1976 5 MFCS Ras, On a Relationship between Programs of Address Machines and Mazurkiewicz Algorithms 1976 5 MFCS de Roever, Dijkstra's Predicate Transformer, Non-Determinism, Recursion, and Termination 1976 5 MFCS Rozenberg & Vermeir, Context-Free Programmed Grammars and ET0L Systems 1976 5 MFCS Rus, Context-Free Algebra: A Mathematical Device for Compiler Specification 1976 5 MFCS Ruzicka & Wiedermann, On the Lower Bound for Minimum Comparison Selection 1976 5 MFCS Salwicki & Muldner, Computational Processes Generated by Programs with Recursive Procedures and Block Structures 1976 5 MFCS Sakarovitch, An Algebraic Framework for the Study of the Syntactic Monoids--Application to the Group Languages 1976 5 MFCS Sazonov, Degrees of Parallelism in Computations 1976 5 MFCS Schurmann, On Adaptability of a System of Programs 1976 5 MFCS Skowron, A Mathematical Model of Parallel Information Processing 1976 5 MFCS Smyth, Powerdomains 1976 5 MFCS Tiuryn, On the Domain of Iteration in Iterative Algebraic Theories 1976 5 MFCS Verbeek & Weihrauch, The Influence of the Data Presentation on the Computational Power of Machines 1976 5 MFCS Winkowski, On Sequential Modelling of Non-Sequential Processes 1976 5 MFCS Zwinogrodzki, Equivalence and Optimization of Recursive Program Schemata 1976 5 MFCS Giarratana & Gimona & Montanari, Observability Concepts in Abstract Data Type Specification 1976 5 MFCS Genrich & Thieler-Mevissen, The Calculus of Facts 1976 5 MFCS Karpinski, Multiplicity Functions on omega-Automata 1975 4 MFCS Barzdin & Bicevskis & Kalninsh, Construction of Complete Sample System for Correctness Testing 1975 4 MFCS van Emde Boas, Ten Years of Speedup 1975 4 MFCS Hajek, On Logics of Discovery 1975 4 MFCS Harrison, On Models of Protection in Operating Systems 1975 4 MFCS Kral & Demner, Parsing as a Subtask of Compiling 1975 4 MFCS Mazurkiewicz, Parallel Recursive Program Schemes 1975 4 MFCS Novotny, On Some Problems Concerning Pawlak's Machines 1975 4 MFCS Salomaa, Formal Power Series and Growth Functions of Lindenmayer Systems 1975 4 MFCS Starke, On the Representability of Relations by Deterministic and Nondeterministic Multi-tape Automata 1975 4 MFCS Trakhtenbrot, On Problems Solvable by Successive Trials 1975 4 MFCS Trnkova, Automata and Categories 1975 4 MFCS Zaslavskii, On Some Models of Computability of Boolean Functions 1975 4 MFCS Adamek, Automata and Categories: Finiteness Contra Minimality 1975 4 MFCS Anisimov, Languages over Free Groups 1975 4 MFCS Ausiello & Protasi, On the Comparison of Notions of Approximation 1975 4 MFCS Benesova & Korec, Non-linear Speed-up Theorem for Two Register Minsky Machines 1975 4 MFCS Best & Schmid, Systems of Open Paths in Petri Nets 1975 4 MFCS Boasson, On the Largest Full Sub-AFL of the Full AFL of Context-free Languages 1975 4 MFCS Chytil, On Complexity of Nondeterministic Turing Machines Computations 1975 4 MFCS Dikovskii, On Closure Properties of Context-free Derivation Complexity Classes 1975 4 MFCS Evtimov, Control Structures in Single Block Programs 1975 4 MFCS Freivald, Minimal Goedel Numbers and their Identification in the Limit 1975 4 MFCS Gecseg, Isomorphic Representation of Automata 1975 4 MFCS Genrich, Extended Simple Regular Expressions 1975 4 MFCS Gini & Gini, CONNIVER Programs by Logical Point of View 1975 4 MFCS Grzymala-Busse, On the Set of All Automata with the Same Monoid of Endomorphisms 1975 4 MFCS Havel, Nondeterministically Recognizable Sets of Languages 1975 4 MFCS Havranek, The Approximation Problem in Computational Statistics 1975 4 MFCS Indermark, The Continuous Algebra of Monadic Languages 1975 4 MFCS Kanovic, On Sets of Complex-Programmed Numbers 1975 4 MFCS Karpinski, Decision Algorithms for Havel's Branching Automata 1975 4 MFCS Koubek & Reiterman, Automata and Categories--Input Processes 1975 4 MFCS Kroeger, Formalization of Algorithmic Reasoning 1975 4 MFCS Levi & Sirovich, Proving Program Properties, Symbolic Evaluation and Logical Procedural Semantics 1975 4 MFCS Maluszynski, A Contribution to Error Recovery 1975 4 MFCS Mayer, On the Analysis and Synthesis Problems for Context-free Expressions 1975 4 MFCS Mehlhorn & Galil, Monotone Switching Circuits and Boolean Matrix Product 1975 4 MFCS Meznik, On Some Lattice-Theoretic Properties of Generable Languages 1975 4 MFCS Modina, On Some Formal Grammars Generating Dependency Trees 1975 4 MFCS Ng & Hsia & Yeh, Graph Walking Automata 1975 4 MFCS Perl, On Finding All Solutions of the Partitioning Problem 1975 4 MFCS Piricka-Kelemenova, Greibach Normal Form Complexity 1975 4 MFCS Podlovchenko, On Correctness and Essentiality of Some Ianov Schemas Equivalence Relations 1975 4 MFCS Pudlak, Polynomially Complete Problems in the Logic of Automated Discovery 1975 4 MFCS Rajlich, Relational Definition of Computer Languages 1975 4 MFCS de Roever, First-order Reduction of Call-by-Name to Call-by-Value 1975 4 MFCS Ruzicka, Local Disambiguating Transformation 1975 4 MFCS Simovici, On Cardinal Sequential Outer Measures 1975 4 MFCS Trakhtenbrot, On Representation of Sequential and Parallel Functions 1975 4 MFCS Tseytlin, The Theory of the Modified Post Algebras and Multidimensional Automata Structures 1975 4 MFCS Turner, An Algebraic Theory of Formal Languages 1975 4 MFCS Valiev, On Polynomial Reducibility of Word Problem under Embedding of Recursively Presented Groups in Finitely Presented Groups 1975 4 MFCS Valk, On the Synthesis of Automata with Several Initial States 1975 4 MFCS Wagner, A Hierarchy of Regular Sequence Sets 1975 4 MFCS Wechler, R-Fuzzy Grammars 1975 4 MFCS Wechsung, Characterization of Some Classes of Context-free Languages in Terms of Complexity Classes 1975 4 MFCS Wiehagen, Inductive Inference of Recursive Functions 1975 4 MFCS Winkowski, Proving Properties of Programs by Means of Predicate Logic 1975 4 MFCS Wojdylo, A Generalization of Scott's Flow Diagrams 1974 3 MFCS Becvar, Sequential Functions and Generalized Moore and Mealy Automata 1974 3 MFCS Bertoni, Mathematical Methods of the Theory of Stochastic Automata 1974 3 MFCS Beyga, On the Quasi-Controllability of Automata 1974 3 MFCS Brzozowski & Yoeli, Models for Analysis of Races in Sequential Networks 1974 3 MFCS Goguen & Thatcher & Wagner & Wright, Factorizations, Congruences, and the Decomposition of Automata and Systems 1974 3 MFCS Grzymala-Busse, On the Periodic Sum and Extensions of Finite Automata 1974 3 MFCS Havel, Finite Branching Automata: Automata Theory Motivated by Problem Solving 1974 3 MFCS Mikulecky, On Configurations in Cellular Automata 1974 3 MFCS Wagner & Staiger, Finite Automata Acceptance of Infinite Sequences 1974 3 MFCS Wechler, R-Fuzzy Automata with a Time-variant Structure 1974 3 MFCS Freivald, Functions Computable in the Limit by Probabilistic Machines 1974 3 MFCS Goetze & Klette, Some Properties of Limit Recursive Functions 1974 3 MFCS Konikowska, On Some Approximation Problems of Continuous Computations 1974 3 MFCS Kwasowiec, Set-Theoretic Properties of Programs in Stored Program Computers 1974 3 MFCS Ras, Classification of Programs of a SPC 1974 3 MFCS Tiuryn, The Algebraic Approach to the Theory of Computing Systems 1974 3 MFCS Zakowski, Continuous Simple Z-Machines, Z-Computable Functions and Sets of Functions of n Real Variables 1974 3 MFCS Dahl, An Approach to Correctness Proofs of Semicoroutines 1974 3 MFCS Dembinski, Towards an Understanding of Complex Processes 1974 3 MFCS Skowron, Simulation 1974 3 MFCS Winkowski, Concurrent Programs 1974 3 MFCS Crestin, Ultralinear Expressions 1974 3 MFCS Fontet, A Family of Algebraic Systems Related to the Theory of Equations on Free Monoids 1974 3 MFCS Karpinski, Stretching by Probabilistic Tree Automata and Santos Grammars 1974 3 MFCS Kral, Top Down versus Bottom Up Syntax Analysis Revised 1974 3 MFCS Maluszynski, Substring Languages 1974 3 MFCS Owsianiecka, Defining Languages by Mazurkiewicz Algorithms 1974 3 MFCS Piricka, Complexity and Normal Forms of Context-free Languages 1974 3 MFCS Wechsung, The Axiomatization Problem of a Theory of Linear Languages 1974 3 MFCS Kelemen, A Lattice-Theoretical Approach to Problem-Solving 1974 3 MFCS Kulpa, On the Equivalence of Planar Grammars and Parallel Picture Processing Algorithms 1974 3 MFCS Lipski, Combinatorial Aspects of Information Storage and Retrieval 1974 3 MFCS Banachowski, Modular Approach to the Logical Theory of Programs 1974 3 MFCS Blikle, Proving Programs by Sets of Computations 1974 3 MFCS Evtimov, Bases of Paths in Correctness Proofs 1974 3 MFCS Hoehnke, Algebraic Models I 1974 3 MFCS Irlik, Structured Programmability of Iterative Algorithms 1974 3 MFCS Leszczylowski, On Equivalence of Programs 1974 3 MFCS Leszczylowski, Mathematical Model of Programs with Dynamic Allocation of Variables 1974 3 MFCS Miglioli, Mathematical Foundations of Motivation Languages and Synthesis Maps 1974 3 MFCS Mosses, The Semantics of Semantic Equations 1974 3 MFCS Rasiowa, omega^+-valued Algorithmic Logic as a Tool to Investigate Procedures 1974 3 MFCS de Roever, Call-by-Value versus Call-by-Name: A Proof-Theoretic Comparison 1974 3 MFCS Salwicki, Procedures, Formal Computations and Models 1973 MFCS Flajolet & Steyaert, Decision Problems for Multihead Finite Automata 1993 9 MFPS Curien, On the Symmetry of Sequentiality 1993 9 MFPS Kopperman & Flagg, The Asymmetric Topology of Computer Science 1993 9 MFPS Calbrix & Nivat & Podelski, Ultimately Periodic Words of Rational omega-Languages 1992 7 MFPS Smith, From Operational to Denotational Semantics 1992 7 MFPS Barwise, Information Links in Domain Theory 1992 7 MFPS Wand, Correctness of Procedure Representations in Higher-Order Assembly Language 1992 7 MFPS Brookes & Geva, Continuous Functions and Parallel Algorithms on Concrete Data Structures 1992 7 MFPS Aceto, On Relating Concurrency and Nondeterminism 1992 7 MFPS Kasangian, On Continuous Time Agents 1996 16 MICRO Abdelguerfi & Kaliski & Patterson, Public-Key Security Systems 1996 16 MICRO Naccache & M'Raihi, Cryptographic Smart Cards 1996 16 MICRO Koc & Acar & Kaliski, Analyzing and Comparing Montgomery Multiplication Algorithms 1996 16 MICRO Zuquete & Guedes, Transparent Authentication and Confidentiality for Stream Sockets 1996 16 MICRO Dhem & Veithen & Quisquater, SCALPS: Smart Card for Limited Payment Systems 1993 MICTREND Parker, Unix User's Handbook 1994 13 MIILEARN Robinson, Logic, Computers, Turing, and von Neumann 1994 13 MIILEARN Muggleton, Logic and Learning: Turing's Legacy 1994 13 MIILEARN Arimura & Shinohara & Otsuki & Ishizaka, A Generalization of the Least Generalization 1994 13 MIILEARN Srinivasan & Muggleton & Bain, The Justification of Logical Theories Based on Data Compression 1994 13 MIILEARN Yokomori, Learning Non-deterministic Finite Automata from Queries and Counterexamples 1972 MILLTHATCH Strassen, Evaluation of Rational Functions 1972 MILLTHATCH Rabin, Solving Linear Equations by Means of Scalar Products 1972 MILLTHATCH Reingold & Stocks, Simple Proofs of Lower Bounds for Polynomial Evaluation 1972 MILLTHATCH Fiduccia, On Obtaining Upper Bounds on the Complexity of Matrix Multiplication 1972 MILLTHATCH Paterson, Efficient Iterations for Algebraic Numbers 1972 MILLTHATCH Winograd, Parallel Iteration Methods 1972 MILLTHATCH Brent, The Computational Complexity of Iterative Methods for Systems of Nonlinear Equations 1972 MILLTHATCH Schultz, The Computational Complexity of Elliptic Partial Differential Equations 1972 MILLTHATCH Karp, Reducibility Among Combinatorial Problems 1972 MILLTHATCH Floyd, Permuting Information in Idealized Two-Level Storage 1972 MILLTHATCH Pratt, An n log n Algorithm to Distribute n Records Optimally in a Sequential Access File 1972 MILLTHATCH Van Voorhis, Toward a Lower Bound for Sorting Networks 1972 MILLTHATCH Hopcroft & Tarjan, Isomorphism of Planar Graphs 1972 MILLTHATCH Fischer, Efficiency of Equivalence Algorithms 1989 11 MINMIC Chen & Chern, A New Three-Stage Procedure for Parallel Algorithm Design 1989 11 MINMIC Liu & Datta, A Pipeline Approach to Problem-Size-Independent Processor Arrays 1993 MISP Johnson & Reichard, Power Programming... Motif, Second Edition 1996 MITPRESS Kasabov, Foundations of Neural Networks, Fuzzy Systems, and Knowledge Engineering 1996 MITPRESS Friedman & Felleisen, The Little Schemer, Fourth Edition 1996 MITPRESS Peek & Newby (Eds.), Scholarly Publishing: The Electronic Frontier 1995 MITPRESS Wilson, Practical Parallel Programming 1995 MITPRESS Franklin, Artificial Minds 1994 MITPRESS Parberry, Circuit Complexity and Neural Networks 1994 MITPRESS Forester & Morrison, Computer Ethics: Cautionary Tales and Ethical Dilemmas in Computing, Second Edition 1994 MITPRESS Kearns & Vazirani, An Introduction to Computational Learning Theory 1994 MITPRESS Resnick, Turtles, Termites, and Traffic Jams: Explorations in Massively Parallel Microworlds 1994 MITPRESS Kinnear (Ed.), Advances in Genetic Programming 1994 MITPRESS van Eijck & Visser (Eds.), Logic and Information Flow 1994 MITPRESS Doets, From Logic to Logic Programming 1994 MITPRESS Forester & Morrison, Computer Ethics: Cautionary Tales and Ethical Dilemmas in Computing, Second Edition 1993 MITPRESS Waldo (Ed.), The Evolution of C++: Language Design in the Marketplace of Ideas 1993 MITPRESS Arbel, Exploring Interior-Point Linear Programming: Algorithms and Software 1993 MITPRESS Nigrin, Neural Networks for Pattern Recognition 1993 MITPRESS Matiyasevich, Hilbert's Tenth Problem 1993 MITPRESS Pereira & Nerode (Eds.), Logic Programming and Non-monotonic Reasoning: Proceedings of the Second International Workshop 1993 MITPRESS Winskel, The Formal Semantics of Programming Languages: An Introduction 1992 MITPRESS Friedman & Wand & Haynes, Essentials of Programming Languages 1992 MITPRESS Dreyfus, What Computers *Still* Can't Do: A Critique of Artificial Reason 1992 MITPRESS Schapire, The Design and Analysis of Efficient Learning Algorithms 1992 MITPRESS Lund, The Power of Interaction 1992 MITPRESS Gunter, Semantics of Programming Languages: Structures and Techniques 1992 MITPRESS Nisan, Using Hard Problems to Create Pseudorandom Generators 1991 MITPRESS Hatcher & Quinn, Data-Parallel Programming on MIMD Computers 1991 MITPRESS Pierce, Basic Category Theory for Computer Scientists 1991 MITPRESS Asperti & Longo, Categories, Types, and Structures: An Introduction to Category Theory for the Working Computer Scientist 1990 MITPRESS How to Write Parallel Programs: A First Course 1990 MITPRESS Kilian, Uses of Randomness in Algorithms and Protocols 1990 MITPRESS Blelloch, Vector Models for Data-Parallel Computing 1990 MITPRESS Smith, An Introduction to Text Processing 1990 MITPRESS Wallen, Automated Proof Search in Non-Classical Logics: Efficient Matrix Proof Methods for Modal and Intuitionistic Logics 1990 MITPRESS Biermann, Great Ideas in Computer Science: A Gentle Introduction 1989 MITPRESS Sharples & Hogg & Hutchinson & Torrance & Young, Computers and Thought: A Practical Introduction to Artificial Intelligence 1989 MITPRESS Springer & Friedman, Scheme and The Art of Programming 1989 MITPRESS McAllester, Ontic: A Knowledge Representation System for Mathematics 1989 MITPRESS Karchmer, Communication Complexity: A New Approach to Circuit Depth 1989 MITPRESS Gusfield & Irving, The Stable Marriage Problem: Structure and Algorithms 1989 MITPRESS Condon, Computational Models of Games 1989 MITPRESS Barrett (ed.), The Society of Text: Hypertext, Hypermedia, and the Social Construction of Information 1988 MITPRESS Minsky & Papert, Perceptrons: An Introduction to Computational Geometry, Expanded Edition 1988 MITPRESS Thagard, Computational Philosophy of Science 1988 MITPRESS Hennessy, Algebraic Theory of Processes 1988 MITPRESS Ibaraki & Katoh, Resource Allocation Problems: Algorithmic Approaches 1988 MITPRESS Brown, Algorithm Animation 1988 MITPRESS Raynal, Networks and Distributed Computation: Concepts, Tools and Algorithms 1987 MITPRESS Friedman & Felleisen, The Little LISPer, Trade Edition 1987 MITPRESS Wang, Reflections on Kurt Goedel 1987 MITPRESS Hastad, Computational Limitations of Small-Depth Circuits 1987 MITPRESS Toffoli & Margolus, Cellular Automata Machines: A New Environment for Modeling 1987 MITPRESS Ebeling, All the Right Moves: A VLSI Architecture for Chess 1987 MITPRESS Mulmuley, Full Abstraction and Semantic Equivalence 1987 MITPRESS von Neumann, Papers of John von Neumann on Computing and Computer Theory 1987 MITPRESS Barton & Berwick & Ristad, Computational Complexity and Natural Language 1986 MITPRESS Harvey, Computer Science Logo Sytle, Volume 2: Projects, Styles, and Techniques 1986 MITPRESS Raynal, Algorithms for Mutual Exclusion 1984 MITPRESS Bach, Analytic Methods in the Analysis and Design of Number Theoretic Algorithms 1983 MITPRESS Leighton, Complexity Issues in VLSI--Optimal Layouts for the Shuffle-Exchange Graph and Other Networks 1972 MITPRESS Peterson & Weldon, Error-Correcting Codes, Second Edition 1969 MITPRESS Minsky & Papert, Perceptrons: An Introduction to Computational Geometry 1995 MLA Gibaldi, MLA Handbook for Writers of Research Papers, Fourth Edition 1990 MLAIA Hinton, Connectionist Learning Procedures 1990 MLAIA De Jong, Genetic-Algorithm-based Learning 1990 MLAIA Haussler, Applying Valiant's Learning Framework to AI Concept-Learning Problems 1990 MLAIA Rivest & Schapire, A New Approach to Unsupervised Learning in Deterministic Environments 1990 MLAIA Stefanski & Wnek & Zhang, Bibliography of Recent Machine Learning Research (1985-1989) 1962 9 MMJ The Equation a^M = b^N c^P in a Free Group 1985 MMSSSS Bergstra & Klop, Verification of an Alternating Bit Protocol by Means of Process Algebra 1985 MMSSSS Shinohara, Some Problems on Inductive Inference from Positive Data 1985 MMSSSS Daley, Inductive Inference Hierarchies: Probabilistic vs. Pluralistic Strategies 1985 MMSSSS Habasinski, Decidability in Pratt's Process Logics 1985 MMSSSS Peter & Szabo, Orientation Problems on Sequences by Recursive Functions 1994 2 MMWORLD Sirota, The Great Speaker Shoot-Out 1994 2 MMWORLD James, Pump Up the Volume 1964 MOORE Huffman, The Synthesis of Sequential Switching Circuits 1964 MOORE Rabin & Scott, Finite Automata and their Decision Problems 1964 MOORE Shepherdson, The Reduction of Two-way Automata to One-way Automata 1964 MOORE Rabin, Probabilistic Automata 1964 MOORE Hartmanis, Loop-free Structure of Sequential Machines 1964 MOORE Huffman, Canonical Forms for Information-lossless Finite-state Logical Machines 1964 MOORE McNaughton & Yamada, Regular Expressions and State Graphs for Automata 1964 MOORE Copi & Elgot & Wright, Realization of Events by Logical Nets 1964 MOORE Burks & Wright, Theory of Logical Nets 1964 MOORE Moore, The Firing Squad Synchronization Problem 1964 MOORE Medvedev, On the Class of Events Representable in a Finite Automaton 1964 MOORE Kutti, On a Graphical Representation of the Operating Regime of Circuits 1964 MOORE Moore, Bibliographic Comments on Sequential Machines 1964 MOORE Moore, Bibliography on Sequential Machines, Sequential Circuits, and Related Topics 1996 21 MOR Goldfarb & Jin, A Faster Combinatorial Algorithm for the Generalized Circulation Problem 1996 21 MOR Monderer & Samet, Proximity of Information in Games with Incomplete Information 1996 21 MOR Khachiyan, Rounding of Polytopes in the Real Number Model of Computation 1996 21 MOR Shimkin & Shwartz, Asymptotically Efficient Adaptive Strategies in Repeated Games. Part II: Asymptotic Optimality 1996 21 MOR Barvinok, Two Algorithmic Results for the Traveling Salesman Problem 1996 21 MOR Yakir, The Differencing Algorithm LDM for Partitioning: A Proof of a Conjecture of Karmarkar and Karp 1996 21 MOR Hoogeveen, Minimizing Maximum Promptness and Maximum Lateness on a Single Machine 1996 21 MOR Hansen & Roberts, An Impossibility Result in Axiomatic Location Theory 1996 21 MOR de Meyer, Repeated Games and Partial Differential Equations 1996 21 MOR de Meyer, Repeated Games, Duality and the Central Limit Theorem 1996 21 MOR Aardal & Pochet & Wolsey, Erratum: Capacitated Facility Location: Valid Inequalities and Facets 1994 19 MOR Karp & Kan & Vohra, Average Case Analysis of a Heuristic for the Assignment Problem 1994 19 MOR Deng & Papadimitriou, On the Complexity of Cooperative Solution Concepts 1993 18 MOR Bienstock & Bramel & Simchi-Levi, A Probabilistic Analysis of Tour Partitioning Heuristics for the Capacitated Vehicle Routing Problem with Unsplit Demands 1993 18 MOR Roth & Rothblum & Vande Vate, Stable Matchings, Optimal Assignments, and Linear Programming 1993 18 MOR Gowda, Applications of Degree Theory to Linear Complementarity Problems 1993 18 MOR Mizuno & Todd & Ye, On Adaptive-step Primal-dual Interior-point Algorithms for Linear Programming 1993 18 MOR Scarf & Shallcross, Shortest Integer Vectors 1993 18 MOR Gilboa & Kalai & Zemel, The Complexity of Eliminating Dominated Strategies 1993 18 MOR Glasserman, Filtered Monte Carlo 1993 18 MOR Chang & Yao, Rearrangement, Majorization and Stochastic Scheduling 1993 18 MOR Rhee, Inequalities for Bin Packing-II 1993 18 MOR Rhee, Optimal Bin Packing of Items of Sizes Uniformly Distributed over [0,1] 1993 18 MOR Peleg, An Axiomatization of the Core of Market Games: A Correction 1993 18 MOR Papadimitriou & Yannakakis, The Traveling Salesman Problem with Distances One and Two 1993 18 MOR Lu & Posner, An NP-Hard Open Shop Scheduling Problem with Polynomial Average Time Complexity 1993 18 MOR Jaillet, Analysis of Probabilistic Combinatorial Optimization Problems in Euclidean Spaces 1993 18 MOR Karp & Motwani & Nisan, Probabilistic Analysis of Network Flow Algorithms 1993 18 MOR Blum, An Approximation for a Continuous Max-Flow Problem 1993 18 MOR Schal, Average Optimality in Dynamic Programming with General State Space 1993 18 MOR Boros & Hammer, Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions 1992 17 MOR Granot & Granot, Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest Problem 1992 17 MOR Granot & Granot, On Some Network Flow Games 1992 17 MOR Roundy, Cyclic Schedules for Job Shops with Identical Jobs 1992 17 MOR Naddef, The Binested Inequalities for the Symmetric Traveling Salesman Polytope 1992 17 MOR Federgruen & Queyranne & Zheng, Simple Power-of-Two Policies Are Close to Optimal in a General Class of Production / Distribution Networks with General Joint Setup Costs 1992 17 MOR Lovasz & Scarf, The Generalized Basis Reduction Algorithm 1992 17 MOR Weiss, Turnpike Optimality of Smith's Rule in Parallel Machines Stochastic Scheduling 1992 17 MOR Naddef & Rinaldi, The Crown Inequalities for the Symmetric Traveling Salesman Polytope 1992 17 MOR Barany, Fair Distribution Protocols or How the Players Replace Fortune 1992 17 MOR Feinberg, On Stationary Strategies in Borel Dynamic Programming 1992 17 MOR Hall & Magnanti, A Polyhedral Intersection Theorem for Capacitated Spanning Trees 1992 17 MOR Hall & Shmoys, Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better 1992 17 MOR Hassin, Approximation Schemes for the Restricted Shortest Path Problem 1992 17 MOR Lehrer, Correlated Equilibria in Two-Player Repeated Games with Nonobservable Actions 1992 17 MOR Lehrer, Two-Player Repeated Games with Nonobservable Actions and Observable Payoffs 1992 17 MOR Monteiro, On the Continuous Trajectories for a Potential Reduction Algorithm for Linear Programming 1991 16 MOR Todd, Probabilistic Models for Linear Programming 1991 16 MOR Freund & Tan, A Method for the Parametric Center Problem, with a Strictly Monotone Polynomial-Time Algorithm for Linear Programming 1991 16 MOR Brockett & Charnes, Information Theoretic Approach to Geometric Programming 1991 16 MOR Rhee, On the Fluctuations of the Stochastic Traveling Salesperson Problem 1991 16 MOR Rhee & Talagrand, Multidimensional Optimal Bin Packing with Items of Random Sets 1991 16 MOR Bertsekas & Tsitsiklis, An Analysis of Stochastic Shortest Path Problems 1991 16 MOR Boyd & Cunningham, Small Travelling Salesman Polytopes 1991 16 MOR Tarjan, Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem 1991 16 MOR Bienstock, Some Generalized Max-Flow Min-Cut Problems in the Plane 1991 16 MOR Goldberg & Plotkin & Tardos, Combinatorial Algorithms for the Generalized Circulation Problem 1991 16 MOR Chen & Mandelbaum, Discrete Flow Networks: Bottleneck Analysis and Fluid Approximations 1991 16 MOR Queyranne & Wang, Single-Machine Scheduling Polyhedra with Precedence Constraints 1991 16 MOR Monticino, The Adequacy of Universal Strategies in Analytic Gambling Problems 1991 16 MOR Fischetti, Facets of the Asymmetric Traveling Salesman Problem 1991 16 MOR Goemans & Bertsimas, Probabilistic Analysis of the Held and Karp Lower Bound for the Euclidean Traveling Salesman Problem 1991 16 MOR Rhee, Stochastic Analysis of a Modified First Fit Decreasing Packing 1991 16 MOR Courcoubetis & Rothblum, On Optimal Packing of Randomly Arriving Objects 1990 15 MOR Monteiro & Adler, An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence 1990 15 MOR Goldberg & Tarjan, Finding Minimum-Cost Circulations by Successive Approximation 1990 15 MOR Du & Leung, Minimizing Total Tardiness on One Machine Is NP-Hard 1990 15 MOR Todd & Ye, A Centered Projective Algorithm for Linear Programming 1990 15 MOR Bienstock & Marcotte, On a Network Design Problem That Is Intractable on Trees 1990 15 MOR Holzman, An Axiomatic Approach to Location on Networks 1990 15 MOR Ye, Recovering Optimal Basic Variables in Karmarkar's Polynomial Algorithm for Linear Programming 1990 15 MOR Monteiro & Adler & Resende, A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension 1990 15 MOR Mehrotra & Sun, An Algorithm for Convex Quadratic Programming That Requires O(n^3.5 L) Arithmetic Operations 1990 15 MOR Kannan & Lovasz & Scarf, The Shapes of Polyhedra 1989 14 MOR Zemel, Easily Computable Facets of the Knapsack Polytope 1989 14 MOR Anstreicher, The Worst-Case Step in Karmarkar's Algorithm 1989 14 MOR Fujishige & Rock & Zimmerman, A Strongly Polynomial Algorithm for Minimum Cost Submodular Flow Problems 1989 14 MOR Tsitsiklis, Markov Chains with Rare Transitions and Simulated Annealing 1989 14 MOR Rhee & Talagrand, Martingale Inequalities, Interpolation and NP-Complete Problems 1989 14 MOR Megiddo & Shub, Boundary Behavior of Interior Point Algorithms in Linear Programming 1989 14 MOR Dyer & Frieze, Probabilistic Analysis of the Multidimensional Knapsack Problem 1987 12 MOR Truemper, Max-Flow Min-Cut Matroids: Polynomial Testing and Polynomial Algorithms for Maximum Flow and Shortest Routes 1987 12 MOR Rhee & Talagrand, Martingale Inequalities and NP-Complete Problems 1996 MORGKAUF Sayood, Introduction to Data Compression 1996 MORGKAUF Lynch, Distributed Algorithms 1994 MORGKAUF Fox & Williams & Messina, Parallel Computing Works! 1993 MORGKAUF Moldovan, Parallel Processing: From Applications to Systems 1993 MORGKAUF Reif (Ed.), Synthesis of Parallel Algorithms 1991 MORGKAUF Abramson, The Expected-Outcome Model of Two-Player Games 1991 MORGKAUF Rawlins (Ed.), Foundations of Genetic Algorithms 1991 MORGKAUF Natarajan, Machine Learning: A Theoretical Approach 1990 MORGKAUF Shrager & Langley (Eds.), Computational Models of Scientific Discovery and Theory Formation 1992 2 MPC Dijkstra, On the Economy of Doing Mathematics 1992 2 MPC Backhouse & van Gasteren, Calculating a Path Algorithm 1992 2 MPC Hoogerwoord, A Logarithmic Implementation of Flexible Arrays 1992 2 MPC Moller & Russling, Shorter Paths to Graph Algorithms 1992 2 MPC Schoenmakers, Inorder Traversal of a Binary Heap and its Inversion in Optimal Time and Space 1992 2 MPC Srinivas, Derivation of a Parallel Matching Algorithm 1992 2 MPC Augusteijn, An Alternative Derivation of a Binary Heap Construction Function 1992 2 MPC Hoogerwoord, A Derivation of Huffman's Algorithm 1989 MPC Hehner, Termination is Timing 1989 MPC May & Shepherd, Towards Totally Verified Systems 1989 MPC Meertens, Constructing a Calculus of Programs 1989 MPC Gribomont, Stepwise Refinement and Concurrency: A Small Exercise 1989 MPC Kaldewaij & Rem, A Derivation of a Systolic Rank Order Filter with Constant Response Time 1989 MPC Kaldewaij & Schoenmakers, Searching by Elimination 1989 MPC Lengauer & Sanders, The Projection of Systolic Programs 1989 MPC Smith & Lowry, Algorithm Theories and Design Tactics 1990 MRAMST Nesetril & Rodl, Ramsey Theory Old and New 1990 MRAMST Erdos, Problems and Results on Graphs and Hypergraphs: Similarities and Differences 1990 MRAMST Rado, Note on Canonical Partitions 1990 MRAMST Beck, On Size Ramsey Number of Paths, Trees and Circuits. II 1990 MRAMST Burr, On the Computational Complexity of Ramsey-Type Problems 1990 MRAMST Frankl, Constructive Ramsey Bounds and Intersection Theorems for Sets 1990 MRAMST Kriz & Thomas, Ordinal Types in Ramsey Theory and Well-Partial-Ordering Theory 1990 MRAMST Nesetril & Rodl, Partite Construction and Ramsey Space Systems 1990 MRAMST Promel & Voigt, Graham-Rothschild Parameter Sets 1990 MRAMST Nilli, Shelah's Proof of the Hales-Jewett Theorem 1990 MRAMST Weiss, Partitioning Topological Spaces 1990 MRAMST Carlson & Simpson, Tolological Ramsey Theory 1990 MRAMST Furstenberg & Katznelson & Weiss, Ergodic Theory and Configurations in Sets of Positive Density 1990 MRAMST Graham, Topics in Euclidean Ramsey Theory 1990 MRAMST Erdos & Nesetril & Rodl, On Pisier Type Problems and Results (Combinatorial Applications to Number Theory) 1990 MRAMST Paris, Combinatorial Statements Independent of Arithmetic 1990 MRAMST Pudlak, Boolean Complexity and Ramsey Theorems 1990 MRAMST Spencer, Uncrowded Graphs 1992 MRTT Thom, Leaving Mathematics for Philosophy 1992 MRTT Novikov, Role of Integrable Models in the Development of Mathematics 1992 MRTT Yau, The Current State and Prospects of Geometry and Nonlinear Differential Equations 1992 MRTT Connes, Noncommutative Geometry 1992 MRTT Samle, Theory of Computation 1992 MRTT Jones, Knots in Mathematics and Physics 1992 MRTT Faltings, Recent Progress in Diophantine Geometry 1994 5 MSSP Mastorakis & Theodorou & Tzafestas, A General Factorization Method for Multivariable Polynomials 1996 29 MST Miller & Pritikin & Sudborough, Bounded Dilation Maps of Hypercubes into Cayley Graphs on the Symmetric Group 1996 29 MST Cai & Liu, The Bounded Membership Problem of the Monoid SL_2(N) 1996 29 MST Blackburn, Node Bisectors of Cayley Graphs 1996 29 MST Lange & Zeugmann, Set-Driven and Rearrangement-Independent Learning of Recursive Languages 1996 29 MST Cucker & Matamala, On Digital Nondeterminism 1996 29 MST Meinel & Waack, Lower Bounds for the Majority Communication Complexity of Various Graph Accessibility Problems 1996 29 MST Gupta, Alternating Time Versus Deterministic Time: A Separation 1996 29 MST Sheu & Long, UP and the Low Hierarchies: A Relativized Separation 1996 29 MST Gross & Chen, Algebraic Specification of Interconnection Network Relationships by Permutation Voltage Graph Mappings 1996 29 MST Feldmann & Mysliwietz, The Shuffle Exchange Network has a Hamiltonian Path 1996 29 MST Agrawal & Biswas, NP-Creative Sets: A New Class of Creative Sets in NP 1996 29 MST Danyi & Fulop, Superlinear Deterministic Top-Down Tree Transducers 1996 29 MST Hemaspaandra & Zimand, Strong Self-Reducibility Precludes Strong Immunity 1996 29 MST Makedon & Symvonis, Flit-Serial Packet Routing on Meshes and Tori 1996 29 MST Yamashita & Kameda, Computing Functions on Asynchronous Anonymous Networks 1996 29 MST Radhakrishnan, Pi-Sigma-Pi Threshold Formulas 1996 29 MST Ben-Amram & Julstrom & Zwick, A Note on Busy Beavers and Other Creatures 1996 29 MST Jiang & Li, DNA Sequencing and String Learning 1996 29 MST Hamidoune & Serra, On Small Cuts Separating an Abelian Cayley Graph into Two Equal Parts 1996 29 MST Hertrampf & Vollmer & Wagner, On Balanced Versus Unbalanced Computation Trees 1996 29 MST Birget, Two-Way Automata and Length-Preserving Homomorphisms 1996 29 MST Golubski & Lippe, Tree-Stack Automata 1996 29 MST Cai & Green & Thierauf, On the Correlation of Symmetric Functions 1996 29 MST Yokomori, Learning Two-Tape Automata from Queries and Counterexamples 1996 29 MST Uspensky & Shen, Relations Between Varieties of Kolmogorov Complexities 1996 29 MST Morales & Lew, An Enlarged Family of Packing Polynomials on Multidimensional Lattices 1996 29 MST Lew & Morales & Sanchez-Flores, Diagonal Polynomials for Small Dimensions 1996 29 MST Papadimitriou & Sideri, The Bisection Width of Grid Graphs 1996 29 MST Herley, Representing Shared Data in Distributed-Memory Parallel Computers 1996 29 MST Tragoudas, Improved Approximations for the Minimum-Cut Ratio and the Flux 1996 29 MST Slutzki & Vagvolgyi, A Hierarchy of Deterministic Top-Down Tree Transformations 1996 29 MST Jesi & Pighizzini & Sabadini, Probabilistic Asynchronous Automata 1996 29 MST Kobler & Toda, On the Power of Generalized MOD-Classes 1996 29 MST Kari, Representation of Reversible Cellular Automata with Block Permutations 1996 29 MST Arvind & Kobler & Mundhenk, Upper Bounds for the Complexity of Sparse and Tally Descriptions 1995 28 MST Gasarch & Krentel & Rappoport, OptP as the Normal Behavior of NP-Complete Problems 1995 28 MST Courcelle & Engelfriet, A Logical Characterization of the Sets of Hypergraphs Defined by Hyperedge Replacement Grammars 1995 28 MST Krause & Waack, Variation Ranks of Communication Matrices and Lower Bounds for Depth-Two Circuits Having Nearly Symmetric Gates with Unbounded Fan-In 1995 28 MST Aurenhammer & Hagauer, Recognizing Binary Hamming Graphs in O(n^2 log n) Time 1995 28 MST Choffrut & Guerra, Logical Definability of Some Rational Trace Languages 1995 28 MST Even & Rajsbaum, Unison, Canon, and Sluggish Clocks in Networks Controlled by a Synchronizer 1995 28 MST Choffrut & Goldwurm, Rational Transductions and Complexity of Counting Problems 1995 28 MST Westbrook & Yan, The Performance of Greedy Algorithms for the On-Line Steiner Tree and Related Problems 1995 28 MST Israeli & Shaham & Shirazi, Linear-Time Snapshot Implementations in Unbalanced Systems 1995 28 MST Green, A Lower Bound for Monotone Perceptrons 1995 28 MST Long & Sheu, A Refinement of the Low and High Hierarchies 1995 28 MST Liskiewicz, On the Power of 1-Tape Off-Line ATMs Running in a Bounded Number of Reversals 1995 28 MST Wrathall & Diekert, On Confluence of One-Rule Trace-Rewriting Systems 1995 28 MST Otto, On Confluence Versus Strong Confluence for One-Rule Trace-Rewriting Systems 1995 28 MST Chang & Kadin, On Computing Boolean Connectives of Characteristic Functions 1995 28 MST Palis & Shende, Pumping Lemmas for the Control Language Hierarchy 1995 28 MST Chu & Schnitger, Communication Complexity of Matrix Computation over Finite Fields 1995 28 MST Regan & Royer, On Closure Properties of Bounded Two-Sided Error Complexity Classes 1995 28 MST Fachini & Gruska & Napoli & Parente, Power of Interconnections and of Nondeterminism in Regular Y-Tree Systolic Automata 1995 28 MST Jain & Sharma, Prudence in Vacillatory Language Identification 1995 28 MST Apostolico & Crochemore, Fast Parallel Lyndon Factorization with Applications 1995 28 MST Wang, Productive Functions and Isomorphisms 1995 28 MST Alvarez & Balcazar & Jenner, Adaptive Logspace Reducibility and Parallel Time 1995 28 MST Kivinen, Learning Reliably and with One-Sided Error 1995 28 MST Raghavan, Robust Algorithms for Packet Routing in a Mesh 1995 28 MST Rifa & Borrell, A Fast Algorithm To Compute Irreducible and Primitive Polynomials in Finite Fields 1995 28 MST Meinel & Waack, Separating Complexity Classes Related to Bounded Alternating omega-Branching Programs 1995 28 MST Litovsky & Metivier & Sopena, Different Local Controls for Graph Relabeling Systems 1995 28 MST Comon, On Unification of Terms with Integer Exponents 1994 27 MST Vijay-Shanker & Weir, The Equivalence of Four Extensions of Context-Free Grammars 1994 27 MST Attiya & Mavronicolas, Efficiency of Semisynchronous Versus Asynchronous Networks 1994 27 MST Chanberlain & Fiduccia, Universality of Iterated Networks 1994 27 MST Bar-Noy & Kipnis, Designing Broadcasting Algorithms in the Postal Model for Message-Passing Systems 1994 27 MST Anderson, Primitives for Asynchronous List Compression 1994 27 MST Kaklamanis & Persiano, Branch-and-Bound and Backtrack Search on Mesh-Connected Arrays of Processors 1994 27 MST Plaxton & Suel, A Lower Bound for Sorting Networks Based on the Shuffle Permutation 1994 27 MST Seidl, Equivalence of Finite-Valued Tree Transducers Is Decidable 1994 27 MST Hermo & Mayordomo, A Note on Polynomial-Size Circuits with Low Resource-Bounded Kolmogorov Complexity 1994 27 MST Hertz, A New Polynomial-Time Algorithm for the Maximum Weighted (Chi(G)-1)-Coloring Problem in Comparability Graphs 1994 27 MST Li & Vitanyi, Statistical Properties of Finite Sequences with High Kolmogorov Complexity 1994 27 MST Ogiwara, Generalized Theorems on Relationships Among Reducibility Notions to Certain Complexity Classes 1994 27 MST Book & Lutz & Wagner, An Observation on Probability Versus Randomness with Applications to Complexity Classes 1994 27 MST Watanabe, A Framework for Polynomial-Time Query Learnability 1994 27 MST Watanabe & Gavalda, Structural Analysis of Polynomial-Time Query Learnability 1994 27 MST Kratsch & Hemaspaandra, On the Complexity of Graph Reconstruction 1994 27 MST Berend & Frougny, Computability by Finite Automata and Pisot Bases 1994 27 MST Frandsen & Valence & Barrington, Some Results on Uniform Arithmetic Circuit Complexity 1994 27 MST Stewart, On Completeness for NP via Projection Translations 1994 27 MST Ehrenfeucht & Rozenberg & Salomaa, Semantics of Trees 1994 27 MST Fu & Li & Zhong, An Application of the Translational Method 1994 27 MST Even & Litman, On the Capabilities of Systolic Systems 1994 27 MST Lin & Pippenger, Parallel Algorithms for Routing in Nonblocking Networks 1994 27 MST Obrenic, An Approach To Emulating Separable Graphs 1994 27 MST Papaefthymiou, Understanding Retiming Through Maximum Average-Delay Cycles 1994 27 MST Ranade, Optimal Speedup for Backtrack Search on a Butterfly Network 1993 26 MST Goldstine & Price & Wotschke, On Reducing the Number of Stack Symbols in a PDA 1993 26 MST Sanchis, On the Effective Generation of Set Elements Within Specified Ranges 1993 26 MST Luccio & Pagli, A Model of Sequential Computation with Pipelined Access to Memory 1993 26 MST Yen & Pak, Complexity Analysis of Propositional Concurrent Programs Using Domino Tiling 1993 26 MST Kintala & Pun & Wotschke, Concise Representations of Regular Languages by Degree and Probabilistic Finite Automata 1993 26 MST Birget, State-Complexity of Finite-State Devices, State Compressibility and Incompressibility 1993 26 MST Annexstein & Baumslag, On the Diameter and Bisector Size of Cayley Graphs 1993 26 MST Beigel & Chang & Ogiwara, A Relationship Between Difference Hierarchies and Relativized Polynomial Hierarchies 1993 26 MST Muller, A Note on Balanced Immunity 1993 26 MST Weber, Distance Automata Having Large Finite Distance or Finite Ambiguity 1993 26 MST Fu, On Lower bounds of the Closeness Between Complexity Classes 1993 26 MST Watanabe & Toda, Structural Analysis of the Complexity of Inverse Functions 1993 26 MST Green, On the Power of Deterministic Reductions to C_= P 1993 26 MST Berman & Garay, Cloture Votes: n/4-Resilient Distributed Consensus in t+1 Rounds 1993 26 MST Bar-Noy & Dolev, A Partial Equivalence Between Shared-Memory and Message-Passing in an Asynchronous Fail-Stop Distributed Environment 1993 26 MST Hadzilacos & Halpern, Message-Optimal Protocols for Byzantine Agreement 1993 26 MST Hadzilacos & Halpern, The Failure Discovery Problem 1993 26 MST Coan & Welch, Modular Construction of an Efficient 1-Bit Byzantine Agreement Protocol 1992 25 MST Otto, The Problem of Deciding Confluence on a Given Congruence Class Is Tractable for Finite Special String-Rewriting Systems 1992 25 MST Gleason, Semigroups of Shift Register Counting Matrices 1992 25 MST Lou & Sarrafzadeh & Rim & Nakajima & Masuda, General Circular Permutation Layout 1992 25 MST Loui & Luginbuhl, The Complexity of On-Line Simulations Between Multidimensional Turing Machines and Random Access Machines 1992 25 MST Lehr, A Result About Languages Concerning Paperfolding Sequences 1992 25 MST Greenlaw, The Parallel Complexity of Approximation Algorithms for the Maximum Acyclic Subgraph Problem 1992 25 MST Yamakami, Structural Properties for Feasibly Computable Classes of Type Two 1992 25 MST Selman, A Survey of One-Way Functions in Complexity Theory 1992 25 MST Buntrock & Damm & Hertrampf & Meinel, Structure and Importance of Logspace-MOD Class 1992 25 MST Clote, A Time-Space Hierarchy Between Polynomial Time and Polynomial Space 1992 25 MST Janardan & Cheng, Efficient Distributed Algorithms for Single-Source Shortest Paths and Related Problems on Plane Networks 1992 25 MST Kranakis & Vitanyi, A Note on Weighted Distributed Match-Making 1992 25 MST Irani & Naor & Rubinfeld, On the Time and Space Complexity of Computation Using Write-Once Memory or Is Pen Really Much Worse than Pencil? 1992 25 MST Huckenbeck, Constructing Sets of Functions which Have a Given F-Cardinality 1992 25 MST Eppstein & Hemachandra & Tisdall & Yener, Simultaneous Strong Separations of Probabilistic and Unambiguous Complexity Classes 1992 25 MST Frougny, Representations of Numbers and Finite Automata 1992 25 MST Autebert & Boasson, The Equivalence of Pre-NTS Grammars Is Decidable 1991 24 MST Kaklamanis & Krizanc & Tsantilas, Tight Bounds for Oblivious Routing in the Hypercube 1991 24 MST Baumslag & Annexstein, A Unified Framework for Off-Line Permutation Routing in Parallel Networks 1991 24 MST Aiello & Leighton & Maggs & Newman, Fast Algorithms for Bit-Serial Routing on a Hypercube 1991 24 MST Lyuu, Fast Fault-Tolerant Parallel Communication and On-Line Maintenance for Hypercubes Using Information Dispersal 1991 24 MST Greenberg & Bhatt, Routing Multiple Paths in Hypercubes 1991 24 MST Slough & Winklmann, On Limitations of Transformations Between Combinatorial Problems 1991 24 MST Haralambides & Makedon & Monien, Bandwidth Minimization: An Approximation Algorithm for Caterpillars 1991 24 MST Buhrman & Homer & Torenvliet, Completeness for Nondeterministic Complexity Classes 1991 24 MST Kravets & Park, Selection and Sorting in Totally Monotone Arrays 1991 24 MST Toda, On Polynomial-Time Truth-Table Reducibility of Intractable Sets to P-Selective Sets 1991 24 MST Lozano & Toran, Self-Reducible Sets of Small Density 1991 24 MST Parberry, A Computer-Assisted Optimal Depth Lower Bound for Nine-Input Sorting Networks 1991 24 MST Courcelle & Niwinski & Podelski, A Geometrical View of the Determinization and Minimization of Finite-State Automata 1991 24 MST Watanabe, On Intractability of the Class UP 1991 24 MST Miller & Sudborough, A Polynomial Algorithm for Recognizing Bounded Cutwidth in Hypergraphs 1991 24 MST Hromkovic, On Problems for Which No Oracle Can Help 1991 24 MST Allender, Limitations of the Upward Separation Technique 1990 23 MST Stearns & Hunt, Power Indices and Easier Hard Problems 1990 23 MST Rosenberg, Exposing Graph Uniformities via Algebraic Specification 1990 23 MST Narendran, It Is Decidable Whether a Monadic Thue System Is Canonical Over a Regular Set 1990 23 MST Barrington, Extensions of an Idea of McNaughton 1990 23 MST Book & Tang, Characterizing Polynomial Complexity Classes by Reducibilities 1990 23 MST Zhang & Kapur, Unnecessary Inferences in Associative-Commutative Completion Procedures 1990 23 MST Parberry, Single-Exception Sorting Networks and the Computational Complexity of Optimal Sorting Network Verification 1990 23 MST Cai & Hemachandra, On the Power of Parity Polynomial Time 1990 23 MST Kutylowski, One-Way Multihead Finite Automata and 2-Bounded Languages 1990 23 MST Huynh, The Complexity of Ranking Simple Languages 1990 23 MST Diaz & Toran, Classes of Bounded Nondeterminism 1990 23 MST Yen, Communicating Processes, Scheduling, and the Complexity of Nondeterminism 1990 23 MST Greenberg & Heath & Rosenberg, Optimal Embeddings of Butterfly-like Graphs in the Hypercube 1989 22 MST Janssens & Rozenberg, Actor Grammars 1989 22 MST Aalbersberg & Hoogeboom, Characterizations of the Decidability of Some Problems for Regular Trace Languages 1989 22 MST Homer & Wang, Absolute Results Concerning One-Way Functions and Their Applications 1989 22 MST Klapper, Generalized Lowness and Highness and Probabilistic Complexity Classes 1989 22 MST Miyano, The Lexicographically First Maximum Subgraph Problems: P-Completeness and NC Algorithms 1989 21 MST Courcelle, The Monadic Second-Order Logic of Graphs, II: Infinite Graphs of Bounded Width 1989 21 MST Hewett & Slutzki, Comparisons Between Some Pumping Conditions for Context-Free Languages 1989 21 MST Fulop & Vagvolgyi, Variants of Top-Down Tree Transducers with Look-Ahead 1988 21 MST Erdos & Koren & Moran & Silberman & Zaks, Minimum-Diameter Cyclic Arrangements in Mapping Data-Flow Graphs onto VLSI Arrays 1988 21 MST Torenvliet, A Second Step Toward the Strong Polynomial-time Hierarchy 1988 21 MST Ibarra & Ravikumar, Sublogarithmic-space Turing Machines, Nonuniform Space Complexity, and Closure Properties 1987 20 MST Bauderon & Courcelle, Graph Expressions and Graph Rewritings 1987 20 MST Russo & Orponen, On P-Subset Structures 1987 20 MST Tsitsiklis, On the Stability of Asynchronous Iterative Processes 1987 20 MST Aravena & Porter, State Representations for m-D Systems with Generalized Causality Structures 1987 20 MST Helton & Rodman, Vandermonde and Resultant Matrices: An Abstract Approach 1987 20 MST Huillet & Monin & Salut, Lie Algebraic Canonical Representations in Nonlinear Control Systems 1987 20 MST Tsinias & Kalouptsidis, Prolongations and Stability Analysis via Lyapunov Functions of Dynamical Polysystems 1987 20 MST Simonson, A Variation on the Min Cut Linear Arrangement Problem 1987 20 MST Otto, Finite Canonical Rewriting Systems for Congruences Generated by Concurrency Relations 1987 20 MST Latteux & Turakainen, A New Normal Form for the Compositions of Morphisms and Inverse Morphisms 1987 20 MST Turakainen, The Equivalence of Deterministic gsm Replications on Q-Rational Languages Is Decidable 1987 20 MST Taylor, On the Small Time Behavior of the Nonlinear Estimation Problem for Finite Bandwidth Signals 1987 20 MST van der Schaft, Correction: On Realization of Nonlinear Systems Described by Higher Order Differential Equations 1987 20 MST Zimand, On Relativizations with Restricted Number of Accesses to the Oracle Set 1987 20 MST Wilson, Relativized NC 1987 20 MST Chan, On Two-Way Weak Counter Machines 1987 20 MST Gordon, On the Computational Power of Totalistic Cellular Automata 1987 20 MST Amari, Differential Geometry of a Parametric Family of Invertible Linear Systems--Riemannian Metric, Dual Affine Connections 1987 19 MST Brandenburg & Brandstadt & Wagner, Uniform Simulations of Nondeterministic Real Time Multitape Turing Machines 1987 19 MST Flajolet & Steyaert, A Complexity Calculus for Recursive Tree Algorithms 1987 19 MST Tsinias & Kalouptsidis & Bacciotti, Lyapunov Functions and Stability of Dynamical Polysystems 1987 19 MST Lipski & Preparata, A Unified Approach to Layout Wirability 1987 19 MST Huillet & Monin & Salut, Lie Algebraic Representation Results for Nonstationary Evolution Operators 1987 19 MST Celle & Gauthier, Realizations of Nonlinear Analytic Input-Output Maps 1987 19 MST van der Schaft, On Realization of Nonlinear Systems Described by Higher-Order Differential Equations 1986 19 MST Drager & Martin, Global Observability of Flows on the Torus: An Application of Number Theory 1986 19 MST Vogler, Iterated Linear Control and Iterated One-Turn Pushdowns 1986 19 MST Gauthier & Guerin, Unitary Immersions of Nonlinear Systems 1986 19 MST Helmke, Topology of the Moduli Space for Reachable Linear Dynamical Systems: The Complex Case 1986 MST Aravena, State Trajectories in Hilbert Resolution Spaces 1986 MST Chung & Rosenberg, Minced Trees, with Applications to Fault-Tolerant VLSI Processor Arrays 1986 MST Crouch & Byrnes, Local Accessibility, Local Reachability, and Representations of Compact Groups 1986 MST Cullen, Local System Equivalence 1986 MST Grizzle & Nijmeijer, Zeros at Infinity for Nonlinear Discrete Time Systems 1986 MST Halpern & Loui & Meyer & Weise, On Time Versus Space III 1986 MST Schoening, Complete Sets and Closeness to Complexity Classes 1985 MST Balcazar & Schoening, Bi-Immune Sets for Complexity Classes 1985 MST Bunce, Stabilizability of Linear Systems Defined over C*-Algebras 1985 MST Byrnes, Editor's Introduction to Euler's ``An Essay on Continued Fractions'' translated by B. F. Wyman and M. F. Wyman 1985 MST Clark & Ong & Tarn & Huang, Quantum Nondemolition Filters 1985 MST Delchamps, Global Structure of Families of Multivariable Linear Systems with an Application to Identification 1985 MST Dolezal & Shankar, A Local Implicit Function Theorem and Application to Systems of Differential Equations 1985 MST Ehrenfeucht & Rozenberg & Verraedt, A Combinatorial Property of E0L Languages 1985 MST Euler, An Essay on Continued Fractions 1985 MST Grandjean, Universal Quantifiers and Time Complexity of Random Access Machines 1985 MST Grasse, Structure of the Boundary of the Attainable Set in Certain Nonlinear Systems 1985 MST Kasai & Iwata, Gradually Intractable Problems and Nondeterministic Log-Space Lower Bounds 1985 MST Ko, Nonlevelable Sets and Immune Sets in the Accepting Density Hierarchy in NP 1985 MST Latteux & Leguy, On the Usefulness of Bifaithful Rational Cones 1985 MST Litow, On Efficient Deterministic Simulation of Turing Machine Computations Below Logspace 1985 MST Marino & Boothby & Elliott, Geometric Properties of Linearizable Control Systems 1985 MST Nijmeijer & van der Schaft, Partial Symmetries for Nonlinear Systems 1985 MST Otto & Wrathall, A Note on Thue Systems with a Single Defining Relation 1985 MST Pan, On Reduced Thue Systems 1985 MST Sallet, Sur la Structure de l'Ensemble d'Accessibilite de Certains Systemes: Application a l'Equivalence des Systemes 1985 MST van der Schaft, Controlled Invariance for Hamiltonian Systems 1984 MST Angluin & Hoover, Regular Prefix Relations 1984 MST Bilardi & Jin, Permutation-Exchange Graphs That Emulate the Binary Cube 1984 MST Book & Selman, Characterizations of Reduction Classes Modulo Oracle Conditions 1984 MST Byrnes & Spong & Tarn, A Several Complex Variables Approach to Feedback Stabilization of Linear Neutral Delay-Differential Systems 1984 MST Crouch & Irving, On Finite Volterra Series Which Admit Hamiltonian Realizations 1984 MST Duris & Galil, A Time-Space Tradeoff for Language Recognition 1984 MST Furst & Saxe & Sipser, Parity, Circuits, and the Polynomial-Time Hierarchy 1984 MST Hammer & Khargonekar, Decoupling of Linear Systems by Dynamic Output Feedback 1984 MST Heller, Relativized Polynomial Hierarchies Extending Two Levels 1984 MST Hepburn & Wonham, Structurally Stable Nonlinear Regulation with Step Inputs 1984 MST Herfort & Kuich, Semitopological Semirings and Pushdown Automata 1984 MST Hunt & Su, Observability for Two-Dimensional Systems 1984 MST Ibarra & Leininger & Rosier, A Note on the Complexity of Program Evaluation 1984 MST Kannan, Towards Separating Nondeterminism from Determinism 1984 MST Leighton, New Lower Bound Techniques for VLSI 1984 MST Murray, Time-Varying Systems and Crossed Products 1984 MST Ong & Huang & Tarn & Clark, Invertibility of Quantum-Mechanical Control Systems 1984 MST Palamides & Sficas & Staikos, Wazewski's Topological Method for Caratheodory Systems 1984 MST Sakarovitch & Nishida & Kobuchi, Recurrent Words for Substitution 1984 MST Walczak, A Note on the Controllability of Nonlinear Systems 1983 16 MST Bacciotti & Stefani, On the Relationship Between Global and Local Controllability 1983 16 MST Book, A Note on Special Thue Systems With a Single Defining Relation 1983 16 MST Borgida, Some Formal Results About Stratificational Grammars and Their Relevance to Linguistics 1983 16 MST Bucy, Identification and Filtering 1983 16 MST Carlyle & Greibach & Paz, Matching and Spanning in Certain Planar Graphs 1983 16 MST Courcelle, An Axiomatic Approach to the Korenjak-Hopcroft Algorithms 1983 16 MST Coxson, A Note on Memoryless Operators 1983 16 MST DeSantis & Porter, Operator Factorization on Partially Ordered Hilbert Resolution Spaces 1983 16 MST Guessarian, Pushdown Tree Automata 1983 16 MST Gurari & Ibarra, A Note on Finite-Valued and Finitely Ambiguous Transducers 1983 16 MST Hammer, Stability and Nonsingular Stable Precompensation: An Algebraic Approach 1983 16 MST Hansel & Perrin, Codes and Bernoulli Partitions 1983 16 MST Hermann & Martin, Lie and Morse Theory for Periodic Orbits of Vector Fields and Matrix Riccati Equations, II 1983 16 MST Kalouptsidis, Prolongations and Lyapunov Functions in Control Systems 1983 16 MST Ko, On the Definitions of Some Complexity Classes of Real Numbers 1983 16 MST Nolte & Naude, Duality Between Reachability and Observability for Adjoint Systems 1983 16 MST Parikh, Some Applications of Topology to Program Semantics 1983 16 MST Preparata, Optimal Three-Dimensional VLSI Layouts 1983 16 MST Savitch, A Note on Relativized Log Space 1983 16 MST Shayman, On the Periodic Solutions of the Matrix Riccati Equation 1983 16 MST Swamy & Savage, Space-Time Tradeoffs for Linear Recursion 1982 15 MST Benson, In Scott-Strachey Style Denotational Semantics, Parallelism Implies Nondeterminism 1982 15 MST Berman, Semantics of Looping Programs in Propositional Logic 1982 15 MST Book & Wrathall, A Note on Complete Sets and Transitive Closure 1982 15 MST Engelfriet, Three Hierarchies of Transducers 1982 15 MST Goldstine & Price & Wotschke, On Reducing the Number of States in a PDA 1982 15 MST Gurari & Ibarra, (Semi)Alternating Stack Automata 1982 15 MST Hermann & Martin, Lie and Morse Theory for Periodic Orbits of Vector Fields and Matrix Riccati Equations, I: General Lie-Theoretic Methods 1982 15 MST Hermann, The Theory of Equivalence of Pfaffian Systems and Input Systems Under Feedback 1982 15 MST Ito, Some Classes of Automata as Partially Ordered Sets 1982 15 MST Johnson, A Priority Queue in Which Initialization and Queue Operations Take O(log log D) Time 1982 15 MST Kalouptsidis & Elliott, Stability Analysis of the Orbits of Control Systems 1982 15 MST Kamimura & Slutzki, Transductions of Dags and Trees 1982 15 MST Lubin, A Note on Single Input Controllability for Normal Systems 1982 15 MST Lynch, Complexity Classes and Theories of Finite Models 1982 15 MST Maurer & Salomaa & Wood, Finitary and Infinitary Interpretations of Languages 1982 15 MST Savitch, Parallel Random Access Machines with Powerful Instruction Sets 1982 15 MST van der Schaft, Hamiltonian Dynamics with External Forces and Observations 1982 15 MST Yamamoto, Realization Theory of Infinite-Dimensional Linear Systems. Part II 1981 15 MST Bonnard, Controlabilite des Systems Bilineaires 1981 15 MST Carstens & Golze, Recursive Paths in Cross-connected Trees and an Application to Cell Spaces 1981 15 MST Feintuch & Saeks & Neil, A New Performance Measure for Stochastic Optimization in Hilbert Space 1981 15 MST Mehlhorn, Lower Bounds on the Efficiency of Transforming Static Data Structures into Dynamic Structures 1981 15 MST Riis & Skyum, k-visit Attribute Grammars 1981 15 MST Yamamoto, Realization Theory of Infinite-dimensional Linear Systems. Part I 1981 14 MST Adleman & Loui, Space-Bounded Simulation of Multitape Turing Machines 1981 14 MST Beauquier, A Remark About a Substitution Property 1981 14 MST Bertuzzi & Gandolfi & Germani, Causal Polynomial Approximation for Input-Output Maps on Hilbert Spaces 1981 14 MST Brandenburg, Three Write Heads Are as Good as k 1981 14 MST Ehrig & Kreowski & Maggiolo-Schettini & Rosen & Winkowski, Transformations of Structures: An Algebraic Approach 1981 14 MST Eising & Hautus, Realization Algorithms for Systems over a Principal Ideal Domain 1981 14 MST Frazho, Abstract Bilinear Systems: The Forward Shift Approach 1981 14 MST Ginsburg & Kintala, Strict Interpretations of Deterministic Pushdown Acceptors 1981 14 MST Ibarra & Rosier, On Restricted One-Counter Machines 1981 14 MST Jantzen & Opp, A Normal Form Theorem for Label Grammars 1981 14 MST Krom, An Unsolvable Problem with Products of Matrices 1981 14 MST Lehmann & Smyth, Algebraic Specification of Data Types: A Synthetic Approach 1981 14 MST Lewis, A Note on Context Free Languages, Complexity Classes, and Diagonalization 1981 14 MST Lynch & Blum, Relative Complexity of Algebras 1981 14 MST Olbrot & Sosnowski, Duality Theorems on Control and Observation of Discrete-time Infinite-dimensional Systems 1981 14 MST Porter, On Factoring the Polyvariance Operator 1981 14 MST Sakarovitch, Sur une Propriete d'Iteration des Langages Algebriques Deterministes 1981 14 MST Stroock, The Malliavin Calculus and Its Application to Second Order Parabolic Differential Equations: Part II 1981 14 MST Stroock, The Malliavin Calculus and Its Application to Second Order Parabolic Differential Equations: Part I 1981 14 MST Toffoli, Bicontinuous Extensions of Invertible Combinatorial Functions 1981 14 MST Wimmer, The Structure of Nonsingular Polynomial Matrices 1980 13 MST Angluin, On Relativizing Auxiliary Pushdown Machines 1980 13 MST Arnold & Nivat, Formal Computations of Non Deterministic Recursive Program Schemes 1980 13 MST Arnold, Le Theoreme de Transversale Rationelle dans les Langages d'Arbres 1980 13 MST Gallier, On the Existence of Optimal Fixpoints 1980 13 MST Hunt, Global Controllability of Nonlinear Systems in Two Dimensions 1980 13 MST Luker, Control Sets on Grammars Using Depth-First Derivations 1980 13 MST Lynch & Blum, Relative Complexity of Operations on Numeric and Bit-String Algebras 1980 13 MST Nelson, Categorical and Topological Aspects of Formal Languages 1980 13 MST Porter, Mutliple Signal Extraction by Polynomial Filtering 1980 13 MST Rodriguez, Compelled Operations and Operations of Degree P 1980 13 MST Shamir & Snir, On the Depth Complexity of Formulas 1980 13 MST Soisalon-Soininen, On Comparing LL(k) and LR(k) Grammars 1979 13 MST Chirica & Martin, An Order-Algebraic Definition of Knuthian Semantics 1979 13 MST Courcelle, Infinite Trees in Normal Form and Recursive Equations Having a Unique Solution 1979 13 MST DeMillo & Lipton, A Constructive Generalization of the Borel-Cantelli Lemma with Application to the Complexity of Infinite Strings 1979 13 MST Ibarra, Restricted One-Counter Machines with Undecidable Universe Problems 1979 13 MST Jones & Skyum, Complexity of Some Problems Concerning L Systems 1979 13 MST Lewis, Satisfiability Problems for Propositional Calculi 1979 13 MST Nasu, Indecomposable Local Maps of Tessellation Automata 1979 13 MST Rosenberg & Wood & Galil, Storage Representations for Tree-Like Data Structures 1979 13 MST Selman, P-selective Sets, Tally Languages, and the Behavior of Polynomial Time Reducibilities on NP 1979 13 MST Sen & Chidambara, Dolezal's Theorem Revisited 1979 12 MST Baker, On ``Provable'' Analogs of P and NP 1979 12 MST Doberkat, Convergence Theorems for Stochastic Automata and Learning Systems 1979 12 MST Fischer & Kintala, Real-Time Computations with Restricted Nondeterminism 1979 12 MST Ginsburg & Leong & Mayer & Wotschke, On Strict Interpretations of Grammar Forms 1979 12 MST Hunt, Controllability of General Nonlinear Systems 1979 12 MST Lew, Polynomial Enumeration of Multidimensional Lattices 1979 12 MST Lindquist & Picci & Ruckebusch, On Minimal Splitting Subspaces and Markovian Representations 1979 12 MST Lynch & Blum, A Difference in Expressive Power Between Flowcharts and Recursion Schemes 1979 12 MST Maurer & Penttonen & Salomaa & Wood, On Non Context-Free Grammar Forms 1979 12 MST Pippenger, The Minimum Number of Edges in Graphs with Prescribed Paths 1979 12 MST Scarpellini, Predicting the Future of Functions on Flows 1979 12 MST Sussmann, Single-Input Observability of Continuous-Time Systems 1978 12 MST Arnold & Dauchet, Une Relation d'Equivalence Decidable sur la Classe des Forets Reconnaissables 1978 12 MST Breidbart, A Short Note on Simultaneous Splitting 1978 12 MST Cliff & Burns, Euclidean Controllable Realizations of Linear Hereditary Systems 1978 12 MST Cremers & Hibbard, Data Spaces with Indirect Addressing 1978 12 MST DeSantis & Saeks & Tung, Basic Optimal Estimation and Control Problems in Hilbert Space 1978 12 MST Foo, Closure Properties and Homomorphisms of Time-varying Systems 1978 12 MST Fornasini & Marchesini, Doubly-Indexed Dynamical Systems: State-Space Models and Structural Properties 1978 12 MST Kintala, Refining Nondeterminism in Context-free Languages 1978 12 MST Rosenberg & Snyder, Bounds on the Costs of Data Encodings 1978 12 MST Rothenberg, A Model for Pattern Perception with Musical Applications Part III: The Graph Embedding of Pitch Structures 1978 11 MST Cobham, Representations of a Word Function as the Sum of Two Functions 1978 11 MST Dorfler, The Cartesian Composition of Automata 1978 11 MST Feintuch, Causal C_0 Operators and Feedback Stability 1978 11 MST Jones, Corrigendum: Context Free Languages and Rudimentary Attributes 1978 11 MST Latteux, Une Note sur la Propriete de Prefixe 1978 11 MST Lind & Thouvenot, Measure-Preserving Homeomorphisms of the Torus Represent All Finite Entropy Ergodic Transformations 1978 11 MST Luker, A Generalization of Leftmost Derivations 1978 11 MST Nasu, Local Maps Inducing Surjective Global Maps of One-Dimensional Tessellation Automata 1978 11 MST Pippenger, The Complexity of Monotone Boolean Functions 1978 11 MST Porter, Approximation of Bernstein Systems 1978 11 MST Rothenberg, A Model for Pattern Perception with Musical Applications Part II: The Information Content of Pitch Structures 1978 11 MST Rothenberg, A Model for Pattern Recognition with Musical Applications. Part I: Pitch Structures as Order-Preserving Maps 1977 11 MST Autebert, Non-Principalite du Cylindre des Langages a Comteur 1977 11 MST Boasson & Nivat, Le Cylindre des Langages Lineaires 1977 11 MST Book & Wrathall & Selman & Dobkin, Inclusion Complete Tally Languages and the Hartmanis-Berman Conjecture 1977 11 MST Courcelle, On Jump-Deterministic Pushdown Automata 1977 11 MST Friedman, Simple Context-Free Languages and Free Monadic Recursion Schemes 1977 11 MST Goldstine, Continuous Operations on Languages 1977 11 MST Gossel & Poschel, On the Characterization of Linear and Linearizable Automata by a Superposition Principle 1977 11 MST Lee & Padgett, On Random Nonlinear Contractions 1977 11 MST Seiferas & Galil, Real-Time Recognition of Substring Repetition and Reversal 1977 11 MST Sontag, The Lattice of Minimal Realizations of Response Maps over Rings 1977 11 MST Ward, The Existence of Solutions, Stability, and Linearization of Volterra Systems 1977 11 MST Wotschke & Wotschke & Downey, Size, Index, and Context-Sensitivity of Controlled Partition Grammars 1977 10 MST Aggarwal, Deterministic Representation of Probabilistic Systems by Ergodic Machines 1977 10 MST Blattner & Cremers, Observations about Bounded Languages and Developmental Systems 1977 10 MST Book, On Languages With a Certain Prefix Property 1977 10 MST Engelfriet, Top-down Tree Transducers with Regular Look-ahead 1977 10 MST Feldman & Shields, Total Complexity and the Inference of Best Programs 1977 10 MST Galil, Some Open Problems in the Theory of Computation as Questions about Two-Way Deterministic Pushdown Automaton Languages 1977 10 MST Gronski, Perturbations of Open Sets of Attainability 1977 10 MST Hazewinkel, Moduli and Canonical Forms for Linear Dynamical Systems II: The Topological Case 1977 10 MST Itoga, Comparing Language Operations 1977 10 MST Manes, On the Point Transitivity of Symbolic Flows 1977 10 MST Paul & Tarjan & Celoni, Space Bounds for a Game on Graphs 1977 10 MST Pippenger, Information Theory and the Complexity of Boolean Functions 1977 10 MST Rosenberg, On Storing Ragged Arrays by Hashing 1977 10 MST Stockmeyer, On the Combinational Complexity of Certain Symmetric Boolean Functions 1977 10 MST Sussmann, Existence and Uniqueness of Minimal Realizations of Nonlinear Systems 1977 10 MST van Emde Boas & Kaas & Zijlstra, Design and Implementation of an Efficient Priority Queue 1977 10 MST Willson, The Growth of Configurations 1977 10 MST Winograd, Some Bilinear Forms Whose Mutliplicative Complexity Depends on the Field of Constants 1977 10 MST Yu, Rudimentary Relations and Stack Languages 1976 10 MST Hahn, On the Asymptotic Behaviour of Solutions of Differential Equations in a Banach Space 1976 10 MST Hunt, On the Complexity of Finite, Pushdown, and Stack Automata 1976 10 MST Jones & Lien & Laaser, New Problems Complete for Nondeterministic Log Space 1976 10 MST Ladner & Lynch, Relativization of Questions About Log Space Computability 1976 10 MST Lakshmikantham & Leela, On Perturbing Lyapunov Functions 1976 10 MST Padgett, Almost Surely Continuous Solutions of a Nonlinear Stochastic Integral Equation 1976 10 MST Parr, A Class of Infinite Dimensional Linear Systems 1976 10 MST Trotter, A Forbidden Subposet Characterization of an Order-Dimension Inequality 1975 9 MST Kosaraju, Context-free Preserving Functions 1975 9 MST Monien, Relationships between Pushdown Automata with Counters and Complexity Classes 1974 8 MST McNaughton, Algebraic Decision Procedures for Local Testability 1973 6 MST Levy & Joshi, Some Results in Tree Automata 1970 4 MST Book & Greibach, Quasi-Realtime Languages 1970 4 MST Book & Greibach & Wegbreit, Time- and Tape-Bounded Turing Acceptors and AFLs 1970 4 MST Book & Greibach & Ibarra & Wegbreit, Tape-Bounded Turing Acceptors and Principal AFLs 1969 3 MST Landweber, Decision Problems for omega-Automata 1969 3 MST Hopcroft, On the Equivalence and Containment Problems for Context-Free Languages 1969 3 MST Hartmanis & Shank, Two Memory Bounds for the Recognition of Primes by Automata 1969 3 MST Cobham, On the Base-Dependence of Sets of Numbers Recognizable by Finite Automata 1969 3 MST Aho & Hopcroft & Ullman, A General Theory of Translation 1969 3 MST Jones, Context-Free Languages and Rudimentary Attributes 1969 3 MST Meyer & Thompson, Remarks on Algebraic Decomposition of Automata 1968 2 MST Fischer & Rosenberg, Real-Time Solutions of the Origin-Crossing Problem 1968 2 MST Fischer & Meyer & Rosenberg, Counter Machines and Counter Languages 1994 NAP committee, Academic Careers for Experimental Computer Scientists and Engineers 1992 NAP panel, Probability and Algorithms 1990 NAP Tuckman & Coyle & Bae, On Time to the Doctorate: A Study of the Increased Time to Complete Doctorates in Science and Engineering 1986 14 NAR Clift & Haussler & McConnell & Schneider & Stormo, Sequence Landscapes 1985 NATO Galil, Open Problems in Stringology 1985 NATO Pinter, Efficient String Matching with Don't-care Patterns 1985 NATO Crochemore, Optimal Factor Transducers 1985 NATO Barth, Relating the Average-case Cost of the Brute-force and the Knuth-Morris-Pratt String Matching Algorithm 1985 NATO Capocelli & Hoffmann, Algorithms for Factorizing and Testing Subsemigroups 1985 NATO Apostolico, The Myriad Virtues of Subword Trees 1985 NATO Chen & Seiferas, Efficient and Elegant Subword-Tree Construction 1985 NATO Storer, Textual Substitution Techniques for Data Compression 1985 NATO Miller & Wegman, Variations on a Theme by Ziv and Lempel 1985 NATO Lempel & Ziv, Compression of Two-dimensional Images 1985 NATO Hartman & Rodeh, Optimal Parsing of Strings 1985 NATO Fraenkel & Klein, Novel Compression of Sparse Bit Strings 1985 NATO Fraenkel, The Use and Usefulness of Numeration Systems 1985 NATO Odlyzko, Enumeration of Strings 1985 NATO Broder, Two Counting Problems Solved via String Encodings 1985 NATO Flajolet & Regnier & Sedgewick, Some Uses of the Mellin Integral Transform in the Analysis of Algorithms 1985 NATO Guibas, Periodicities in Strings 1985 NATO Main & Lorentz, Linear Time Recognition of Square-free Strings 1985 NATO Rabin, Discovering Repetitions in Strings 1985 NATO Restivo & Salemi, Some Decision Results on Nonrepetitive Words 1985 NATO Even, On the Complexity of Some Word Problems Which Arise in Testing the Security of Protocols 1985 NATO Head & Wilkinson, Code Properties and Derivatives of D0L Systems 1985 NATO Perrin, Words over a Partially Commutative Alphabet 1985 NATO Rytter, The Complexity of Two-way Pushdown Automata and Recursive Programs 1985 NATO Yao, On Context Free Grammars and Random Number Generation 1987 NATO2 Bird, An Introduction to the Theory of Lists 1987 NATO2 Dijkstra, A Heuristic Explanation of Batcher's Baffler 1987 NATO2 Robinson, Notes on Logic Programming 1987 NATO2 Hehner, Logic Based on Programming 1973 NATO3 De Luca & Fischetti, Outline of a New Logical Approach to Information Theory 1991 NATO4 Tucker, theory of Computation and Specification over Abstract Data Types, and its Applications 1991 NATO4 Manna & Waldinger, Fundamentals of Deductive Program Synthesis 1991 NATO4 Robinson, Notes on Resolution 1991 NATO4 Huet, Introduction au lambda-Calcul Pur 1991 NATO4 Schwichtenberg, Normalization 1991 NATO4 Wainer, Computability -- Logical and Recursive Complexity 1991 NATO4 Constable & Allen & Howe, Reflecting the Open-Ended Computation System of Constructive Type Theory 1991 NATO4 Nerode, Some Lectures on Modal Logic 1991 NATO4 Brauer, Formal Approaches to Concurrency 1991 NATO4 Shapiro, The Family of Concurrent Logic Programming Languages 1997 385 NATURE Koch, Computation and the Single Neuron 1997 385 NATURE Hughes, Quantum Security is Spookily Certain 1997 385 NATURE Skorecki & Selig & Blazer & Bradman & Bradman & Waburton & Ismajlowicz & Hammer, Y Chromosomes of Jewish Priests 1996 383 NATURE Bollobas, Paul Erdos (1913-96) 1996 382 NATURE Ziman, Is Science Losing Its Objectivity? 1996 382 NATURE Bennett, Freely Communicating 1996 379 NATURE Stewart, review of Kauffman, At Home in the Universe: The Search for Laws of Self-Organization and Complexity (Oxford, 1995) 1996 379 NATURE Sutherland, review of Goleman, Emotional Intelligence: Why It Can Matter More Than IQ (Bloomsbury, 1995) 1995 377 NATURE Bennett & DiVincenzo, Quantum Computing: Towards an Engineering Era? 1995 376 NATURE Bray, Protein Molecules as Computational Elements in Living Cells 1995 376 NATURE Maddox, Restoring Good Manners in Research 1995 375 NATURE Butler, Science in Israel 1995 375 NATURE Galloway, review of Anholt, Dazzle 'em with Style: The Art of Oral Scientific Presentation (Freeman, 1995) 1994 369 NATURE Maddox, Directed Motion from Random Noise 1994 369 NATURE Baldwin, Protein Folding: Matching Speed and Stability 1993 364 NATURE Kotzin, Twins and T-Cell Responses 1993 364 NATURE Milinski, Cooperation Wins and Stays 1993 364 NATURE Swinnerton-Dyer, The End of the Last Theorem? 1993 364 NATURE Nowak & Sigmund, A Strategy of Win-Stay, Lose-Shift that Outperforms Tit-for-Tat in the Prisoner's Dilemma Game 1993 362 NATURE Bennett, Quantum Computers: Certainty from Uncertainty 1993 362 NATURE Sudbery, Instant Teleportation 1993 362 NATURE Penrose, review of Mackey, Time's Arrow: The Origins of Thermodynamic Behaviour (Springer, 1992) 1993 362 NATURE Shlesinger, review of Applied Chaos Theory: A Paradigm for Complexity (Academic, 1993) 1993 361 NATURE Maddox, Can Quantum Theory Be Understood? 1993 361 NATURE Stewart, review of Complexity: The Emerging Science at the Edge of Order and Chaos (Simon and Schuster/Viking, 1992) 1993 361 NATURE Stewart, review of Complexity: Life at the Edge of Chaos (Macmillan, 1993) 1992 360 NATURE Schweber, review of Gleick, Genius: Richard Feynman and Modern and Modern Physics (Pantheon/Little, Brown, 1992) 1992 360 NATURE Sutherland, review of Searle, The Rediscovery of the Mind (MIT Press, 1992) 1992 360 NATURE Aleksander, review of Harrison & Minsky, The Turing Option (Warner/Viking, 1992) 1992 360 NATURE Gregory, The Infectiousness of Pompous Prose 1992 359 NATURE Sigmund, On Prisoners and Cells 1992 359 NATURE Campbell, Teaching Programs (review of Aho & Ullman, Foundations of Computer Science, W. H. Freeman, 1992) 1992 358 NATURE Gray, Consciousness on the Scientific Agenda 1992 358 NATURE Maddox, Long-range Correlations within DNA 1992 358 NATURE Ekert, Beating the Code Breakers 1992 358 NATURE Gardner, review of King, The Art of Mathematics (Plenum, 1992) 1992 356 NATURE Maddox, Ready or Not, Here Comes Electronic Publishing 1992 356 NATURE Maddox, The Endless Search for Primality 1992 355 NATURE Godfray, Animal Behaviour: The Evolution of Forgiveness 1992 355 NATURE Nowak & Sigmund, Tit for Tat in Heterogeneous Populations 1991 353 NATURE Sarkar & Tauber, Fallacious Claims for HGP 1991 353 NATURE Ceulemans & Fowler, Extension of Euler's Theorem to Symmetry Properties of Polyhedra 1991 353 NATURE Stewart, Quantum Cryptography: Schrodinger's Catflap 1991 353 NATURE Taylor, Sequence Analysis: Spinning in Hyperspace 1991 353 NATURE Hannabuss, Bell's Inequality 1991 352 NATURE Stewart, Dynamics: Deciding the Undecidable 1991 352 NATURE Cohen & Horowitz, Paradoxical Behaviour of Mechanical and Electrical Networks 1991 352 NATURE Mackenzie, The Fangs of the VIPER 1991 350 NATURE Stewart, All Together Now... 1991 349 NATURE Clarke, review of Banchoff, Beyond the Third Dimension (Freeman, 1990) 1991 349 NATURE Landsberg, review of Leff & Rex (Eds.), Maxwell's Demon: Entropy, Information, Computing (Princeton University Press, 1990) 1991 349 NATURE Landsberg, review of Zurek (Ed.), Complexity, Entropy and the Physics of Information (Addison-Wesley, 1990) 1991 349 NATURE Hofstadter, review of Boden, The Creative Mind: Myths and Mechanisms (Basic Books, 1990) 1990 347 NATURE Stewart, review of Dunham, Journey Through Genius: The Great Theorems of Mathematics (Wiley, 1990) 1990 346 NATURE Shakhnovich & Gutin, Implications of Thermodynamics of Protein Folding for Evolution of Primary Sequences 1990 346 NATURE Bennett, Computation: Undecidable Dynamics 1990 346 NATURE Little, Genome Mapping: Clone Maps Made Simple 1990 344 NATURE Maddox, Towards the Electronic Journal? 1990 344 NATURE Maddox, Complicated Measures of Complexity 1990 343 NATURE Reed, review of Edelman, The Remembered Present: A Biological Theory of Consciousness (Basic Books, 1990) 1990 343 NATURE Psaltis & Brady & Gu & Lin, Holography in Artificial Neural Networks 1989 341 NATURE Longuet-Higgins, review of Penrose, The Emperor's New Mind: Concerning Computers, Minds, and the Laws of Physics (1989) 1989 341 NATURE Zurek, Thermodynamic Cost of Computation, Algorithmic Complexity and the Information Metric 1989 340 NATURE Biedermann & Landauer, Dissipation in Computation (letter and reply) 1989 340 NATURE Buchdahl, What Is Entropy? (letter) 1989 340 NATURE Keyes, Computation: Making Light Work of Logic 1989 340 NATURE Hentschel, Spin-Glass Theory: Correcting Errors with Glasses 1989 339 NATURE Sourlas, Spin-Glass Models as Error-Correcting Codes 1989 337 NATURE Abramowicz & Ellis, Cosmology: The Elusive Anthropic Principle 1989 337 NATURE Crick, The Recent Excitement about Neural Networks 1989 337 NATURE Stewart, Computation: Highly Distributed Processing 1988 336 NATURE Landauer, A Simple Measure of Complexity 1988 335 NATURE Muggleton, review of Herken (ed.), The Universal Turing Machine: A Half-Century Survey 1988 334 NATURE McDermott, review of Genesereth & Nilsson, Logical Foundations of Artificial Intelligence 1988 333 NATURE von Heijne, Getting Sense out of Sequence Data 1988 333 NATURE Maddox, Why the Pressure to Publish? 1988 332 NATURE Stewart, The Ultimate in Undecidability 1987 330 NATURE Johnson, More Approaches to the Travelling Salesman Guide (letter) 1987 328 NATURE Packel & Traub, Information-based Complexity 1987 328 NATURE North, A Celebration of Connectionism 1987 328 NATURE North, Shell Patterns Simulated 1987 327 NATURE Maddox, Quantum Information Storage 1987 326 NATURE Hillis & Barnes, Programming a Highly Parallel Computer 1987 325 NATURE Sutherland, review of Holland et al., Induction: Processes of Inference, Learning, and Discovery 1987 325 NATURE Stewart, Geometry Finds Factors Faster 1985 318 NATURE Erber & Putterman, Randomness in Quantum Mechanics--Nature's Ultimate Cryptogram? 1985 316 NATURE Maddox, Towards the Quantum Computer? 1983 NATURE Wootters & Zurek, A Single Quantum Cannot Be Cloned 1996 14 NAW van der Put, On the Work of Hendrik W. Lenstra, Jr. 1996 14 NAW van der Vlugt, An Application of Elementary Algebraic Geometry in Coding Theory 1989 7 NAW de Bruijn, Mathematics and Computers 1989 7 NAW Cohen, Computer Algebra, Theory and Practice 1989 NCARCHS Aleksander, Why Neural Computing? A Personal View 1989 NCARCHS Caianiello, A Theory of Neural Networks 1989 NCARCHS Patarnello & Carnevali, Learning Capabilities of Boolean Networks 1989 NCARCHS Aleksander, The Logic of Connectionist Systems 1989 NCARCHS Kan & Aleksander, A Probabilistic Logic Neuron Network for Associative Learning 1989 NCARCHS Martland, Dynamic Behaviour of Boolean Networks 1989 NCARCHS Aleksander, A Review of Parallel Distributed Processing 1975 NCTPIP Winograd, On the Speed Gained in Parallel Methods 1996 37 NDAME Hemaspaandra, The Price of Universality 1995 36 NDAME Seetapun & Slaman, On the Strength of Ramsey's Theorem 1995 36 NDAME Belle & Parlamento, Decidability and Completeness for Open Formulas of Membership Theories 1995 36 NDAME Joy & Rayward-Smith, NP-Completeness of a Combinator Optimization Problem 1994 35 NDAME Schindler, A Dilemma in the Philosophy of Set Theory 1993 34 NDAME White, Are We Finite? 1992 33 NDAME Isles, What Evidence Is There That 2^65536 Is a Natural Number? 1992 33 NDAME Lepage, Partial Functions in Type Theory 1992 33 NDAME Hansson, The Difference Model of Voting 1992 33 NDAME Purdy, On the Question `Do We Need Identity?' 1992 33 NDAME Marquis, Approximations and Logic 1992 33 NDAME Zanardo, A Note about the Axioms for Branching-Time Logic 1992 33 NDAME McColm, Eventual Periodicity and ``One-Dimensional'' Queries 1991 32 NDAME Leblanc & Roeper & Thau & Weaver, Henkin's Completeness Proof: Forty Years Later 1991 32 NDAME Habart, Bounds in Weak Truth-table Reducibility 1991 32 NDAME Schlechta, Theory Revision and Probability 1990 31 NDAME Schumm & Shapiro, Expressive Completeness and Decidability 1990 31 NDAME Kreisel, Review of Goedel's `Collected works, Volume II' 1990 31 NDAME Harkleroad, Recursive Surreal Numbers 1990 31 NDAME Pelletier & Martin, Post's Functional Completeness Theorem 1990 31 NDAME Townsend, Complexity for Type-2 Relations 1988 29 NDAME Dahlhaus & Israeli & Makowsky, On the Existence of Polynomial Time Algorithms for Interpolation Problems in Propositional Logic 1988 29 NDAME Shannon, Equivalent Versions of a Weak Form of the Axiom of Choice 1988 29 NDAME Smith, A Note on Arbitrarily Complex Recursive Functions 1987 28 NDAME Goodman, Intensions, Church's Thesis, and the Formalization of Mathematics 1987 28 NDAME Kleene, Reflections on Church's Thesis 1987 28 NDAME Kreisel, Church's Thesis and the Ideal of Informal Rigour 1987 28 NDAME McCarthy & Shapiro, Turing Projectability 1987 28 NDAME McCarty, Variations on a Thesis: Intuitionism and Computability 1987 28 NDAME Nelson, Church's Thesis and Cognitive Science 1987 28 NDAME Shanker, Wittgenstein versus Turing on the Nature of Church's Thesis 1993 NES Gourman, The Gourman Report: A Rating of Undergraduate Programs in American and International Universities, Eighth Edition, Revised 1994 5 NETCNS Romaniuk, Theoretical Results for Applying Neural Networks to Lossless Image Compression 1993 4 NETCNS Idiart & Abbott, Propagation of Excitation in Neural Network Models 1993 4 NETCNS Ferran, On Kohonen's Ordering Theorem for One-dimensional Self-organized Mappings 1993 4 NETCNS Galland, The Limitations of Deterministic Boltzmann Machine Learning 1993 4 NETCNS Meir & Fontanari, On the Precision Constraints of Threshold Elements 1991 2 NETCNS Fontanari & Meir, Evolving a Learning Algorithm for the Binary Perceptron 1991 2 NETCNS Treves & Rolls, What Determines the Capacity of Autoassociative Memories in the Brain? 1991 2 NETCNS Burgess & Shapiro & Moore, Neural Network Models of List Learning 1991 2 NETCNS Meunier & Yanai & Amari, Sparsely Coded Associative Memories: Capacity and Dynamical Properties 1991 2 NETCNS Lewenstein & Olko, `Quantum' Neural Networks 1991 2 NETCNS Lisboa & Perantonis, Complete Solution of the Local Minima in the XOR Problem 1991 2 NETCNS Hartstein, The Role of Dimensionality in a Threshold-Controlled Neural Network 1990 1 NETCNS Braitenberg, Reading the Structure of Brains 1990 1 NETCNS Abeles & Vaadia & Bergman, Firing Patterns of Single Units in the Prefrontal Cortex and Neural Network Models 1990 1 NETCNS Hopfield, The Effectiveness of Analogue `Neural Network' Hardware 1990 1 NETCNS Nadal & Toulouse, Information Storage in Sparsely Coded Memory Nets 1996 3 NETGUIDE Stevenson & Perry, ISDN Adapters: It's About Time! (February) 1997 29 NETWORKS Penrice, Balanced Graphs and Network Flows 1997 29 NETWORKS Chang & Wu, A Secure Voting System on a Public Network 1997 29 NETWORKS Duin & Voss, Efficient Path and Vertex Exchange in Steiner Tree Algorithms 1997 29 NETWORKS Shioura & Shigeno, The Tree Center Problems and the Relationship with the Bottleneck Knapsack Problems 1997 29 NETWORKS Chen & Powell, A Note on Bertsekas' Small-Label-First Strategy 1997 29 NETWORKS AboElFotoh, Algorithms for Computing Message Delay for Wireless Networks 1997 29 NETWORKS Pallottino & Scutella, Dual Algorithms for the Shortest Path Tree Problem 1997 29 NETWORKS Bar-Noy & Kipnis, Multiple Message Broadcasting in the Postal Model 1997 29 NETWORKS Orda & Rom, Optimal Packet Fragmentation and Routing in Computer Networks 1997 29 NETWORKS Sankaranarayana, Tracking the P-NP Boundary for Well-Covered Graphs 1997 29 NETWORKS Hasunuma & Shibata, Counting Small Cycles in Generalized De Bruijn Digraphs 1997 29 NETWORKS Tse & Lau, A Lower Bound for Interval Routing in General Networks 1997 29 NETWORKS Fischetti & Vigo, A Branch-and-Cut Algorithm for the Resource-Constrained Minimum-Weight Arboresence Problem 1997 29 NETWORKS Kalpakis & Yesha, On the Bisection Width of the Transposition Network 1996 28 NETWORKS Manoussakis & Tuza, Optimal Routings in Communication Networks with Linearly Bounded Forwarding Index 1996 28 NETWORKS Chartrand & Schultz & Winters, On Eccentric Vertices in Graphs 1996 28 NETWORKS Wang & Jiang, An Approximation Scheme for Some Steiner Tree Problems in the Plane 1996 28 NETWORKS Chen & Sasaki, Routing in Quasi Torus Networks 1996 28 NETWORKS Kalantari & Khosrovshahi, Magic Labeling in Graphs: Bounds, Complexity, and an Application to a Variant of TSP 1996 28 NETWORKS Hochbaum & Pathria, The Bottleneck Graph Partition Problem 1996 28 NETWORKS Berman, Vulnerability of Scheduled Networks and a Generalization of Menger's Theorem 1996 28 NETWORKS Knisely & Laskar, Cyclic Gossiping Times for Some Classes of Graphs 1996 28 NETWORKS Pelc, Fault-Tolerant Broadcasting and Gossiping in Communication Networks 1996 28 NETWORKS Aboelaze, MLH: A Hierarchical Hypercube Network 1996 28 NETWORKS Kim & Lowe & Tamir & Ward, On the Location of a Tree-Shaped Facility 1996 28 NETWORKS Swaminathan, Divide-and-Conquer Algorithms for Graph-Layout Problems 1996 28 NETWORKS Humenik & Matthews & Stephens & Yesha, Minimizing Message Complexity of Partially Replicated Data on Hypercubes 1996 28 NETWORKS Chardaire & Sutter & Costa, Solving the Dynamic Facility Location Problem 1996 28 NETWORKS Berman & Drezner & Wesolowsky, Minimum Covering Criterion for Obnoxious Facility Location on a Network 1996 28 NETWORKS Li & Sotteau & Xu, 2-Diameter of de Bruijn Graphs 1996 28 NETWORKS Zheng, Maximum Independent Sets of Circular-Arc Graphs: Simplified Algorithm and Proofs 1996 28 NETWORKS Lin & Pippenger, Routing Algorithms for Switching Networks with Probabilistic Traffic 1996 28 NETWORKS Castillo & Gutierrez & Hadi, A New Method for Efficient Symbolic Propagation in Discrete Bayesian Networks 1996 28 NETWORKS Ghoshal & Laskar & Pillone, Minimal Rankings 1996 28 NETWORKS Smith, Topological Network Design of State-Dependent Queueing Networks 1996 27 NETWORKS Ishigami, The Wide-Diameter of the n-Dimensional Toroidal Mesh 1996 27 NETWORKS Yan, Approximating Reduced Costs under Degeneracy in a Network Flow Problem with Side Constraints 1996 27 NETWORKS Kishimoto, A Method for Obtaining the Maximum Multirout Flows in a Network 1996 27 NETWORKS Ahlswede & Gargano & Haroutunian & Khachatrian, Fault-Tolerant Minimum Broadcast Networks 1996 27 NETWORKS Chlebus & Diks & Pelc, Broadcasting in Synchronous Networks with Dynamic Faults 1996 27 NETWORKS Nobert & Picard, An Optimal Algorithm for the Mixed Chinese Postman Problem 1996 27 NETWORKS Talluri, Network Synthesis with Few Edges 1996 27 NETWORKS Granot & Penn & Queyranne, Disconnecting Sets in Single and Two-Terminal-Pair Networks 1996 27 NETWORKS Petingi & Saccoman & Schoppmann, Uniformly Least Reliable Graphs 1996 27 NETWORKS Polychronopoulos & Tsitsiklis, Stochastic Shortest Path Problems with Recourse 1996 27 NETWORKS Ho & Hsu & Sung, Transmitting on Various Network Topologies 1996 27 NETWORKS Park & Choi, Circuit-Switched Row-Column Broadcasting in Torus and Mesh Networks 1996 27 NETWORKS Gavish & Sridhar, Erratum: Computing the 2-Median on Tree Networks in O(n lg n) Time 1996 27 NETWORKS Sritharan, A Linear Time Algorithm to Recognize Circular Permutation Graphs 1996 27 NETWORKS Dell'Amico & Labbe & Maffioli, Complexity of Spanning Tree Problems with Leaf-Dependent Objectives 1996 27 NETWORKS Diks & Pelc, Broadcasting with Universal Lists 1996 27 NETWORKS Gunther & Hartnell & Rall, Star-Factors and k-Bounded Total Domination 1996 27 NETWORKS Ku & Hayes, Optimally Edge Fault-Tolerant Trees 1996 27 NETWORKS Mirchandani, A Simple O(n^2) Algorithm for the All-Pairs Shortest Path Problem on an Interval Graph 1996 27 NETWORKS Melachrinoudis & Helander, A Single Facility Location Problem on a Tree with Unreliable Edges 1996 27 NETWORKS Fraigniaud & Laforest, Minimum Gossip Bus Networks 1996 27 NETWORKS Volgenant, An Addendum to The Most Vital Edges of Matching in a Bipartite Graph 1996 27 NETWORKS Hung & Hsu & Sung, A Response to Volgenant's Addendum on the Most Vital Edges 1996 27 NETWORKS Ellis, Embedding Grids into Grids: Techniques for Large Compression Ratios 1996 27 NETWORKS Harary & Hayes, Node Fault Tolerance in Graphs 1996 27 NETWORKS Blanchini & Queyranne & Rinaldi & Ukovich, A Feedback Strategy for Periodic Network Flows 1996 27 NETWORKS Hotzel, Components and Graph Automorphisms of Standard 2x2-Switch Banyan Networks 1996 27 NETWORKS Underwood, A Modified Melzak Procedure for Computing Node-Weighted Steiner Trees 1996 27 NETWORKS Greenwald & Dean, Package Routing in Transportation Networks with Fixed Vehicle Schedules 1995 26 NETWORKS Stivaros & Sutner, The Intractability of the Reliable Assignment Problem in Split Networks 1995 26 NETWORKS Esbensen, Computing Near-Optimal Solutions to the Steiner Problem in a Graph Using a Genetic Algorithm 1995 26 NETWORKS Winter, Reductions for the Rectilinear Steiner Tree Problem 1995 26 NETWORKS Marin, Restricted Simplicial Decomposition with Side Constraints 1995 26 NETWORKS Roccetti, Reliability Analysis of Tree-Based Networks and Its Application to Fault-Tolerant VLSI Systems 1995 26 NETWORKS Myung & Lee & Tcha, On the Generalized Minimum Spanning Tree Problem 1995 26 NETWORKS Mosheiov, The Pickup Delivery Location Problem on Networks 1995 26 NETWORKS Kwon & Chwa, Multiple Message Broadcasting in Communication Networks 1995 26 NETWORKS Li & Tsao & Ulular, The Shortest Path with at Most I Nodes in Each of the Series/Parallel Clusters 1995 26 NETWORKS Smith & Weiss & Patel, An O(N^2) Heuristic for Steiner Minimal Trees in E^3 1995 26 NETWORKS Erwig, Encoding Shortest Paths in Spatial Networks 1995 26 NETWORKS Gavish & Sridhar, Computing the 2-Median on Tree Networks in O(n lg n) Time 1995 26 NETWORKS Bermond & Fraigniaud & Peters, Antepenultimate Broadcasting 1995 26 NETWORKS Grigoriadis & Khachiyan, An Exponential-Function Reduction for Block-Angular Convex Programs 1995 26 NETWORKS Somani & Thatte, The Helical Cube Network 1995 26 NETWORKS Coorg & Rangan, Feedback Vertex Set on Cocomparability Graphs 1995 26 NETWORKS Fischetti & Gonzalez & Toth, The Symmetric Generalized Traveling Salesman Polytope 1995 26 NETWORKS Philpott & Craddock, An Adaptive Discretization Algorithm for a Class of Continuous Network Programs 1995 26 NETWORKS Topkis, Repeated Uncoordinated Information Dissemination by Flooding 1995 26 NETWORKS Chao & Golden & Wasil, An Improved Heuristic for the Period Vehicle Routing Problem 1995 26 NETWORKS Paik & Sahni, Network Upgrading Problems 1995 25 NETWORKS Ball & Hagstrom & Provan, Threshold Reliability of Networks with Small Failure Sets 1995 25 NETWORKS Buchsbaum & Mihail, Monte Carlo and Markov Chain Techniques for Network Reliability and Sampling 1995 25 NETWORKS Lin & Jane & Yuan, On Reliability Evaluation of a Capacitated-Flow Network in Terms of Minimal Pathsets 1995 25 NETWORKS Lingner & Politof & Satyanarayana, A Forbidden Minor Characterization and Reliability of a Class of Partial 4-Trees 1995 25 NETWORKS Rai & Veeraraghavan & Trivedi, A Survey of Efficient Reliability Computation Using Disjoint Products Approach 1995 25 NETWORKS Strayer & Colbourn, Consecutive Cuts and Paths, and Bounds on k-Terminal Reliability 1995 25 NETWORKS Fulman & Hanson & MacGillivray, Vertex Domination-Critical Graphs 1995 25 NETWORKS Averbakh & Berman, Sales-Delivery Man Problems on Treelike Networks 1995 25 NETWORKS Marathe & Breu & Hunt & Ravi & Rosenkrantz, Simple Heuristics for Unit Disk Graphs 1995 25 NETWORKS Salowe & Warme, Thirty-Five-Point Rectilinear Steiner Minimal Trees in a Day 1995 25 NETWORKS Ahuja & Orlin, A Capacity Scaling Algorithm for the Constrained Maximum Flow Problem 1995 25 NETWORKS Piazza & Roberts & Stueckle, Edge-Tenacious Networks 1995 25 NETWORKS Elmallah & Culberson, Multicommodity Flows in Simple Multistage Networks 1995 25 NETWORKS Rodrigues & Ural, Lower Bounds for the Length of Test Sequences Using UIOs 1994 24 NETWORKS Ravada & Sherman, Experimental Evaluation of a Partitioning Algorithm for the Steiner Tree Problem in R^2 and R^3 1994 24 NETWORKS Berman & Pelc, Reliable Distributed Diagnosis for Multiprocessor Systems with Random Faults 1994 24 NETWORKS Harada & Sun & Nagamochi, An Exact Lower Bound on the Number of Cut-Sets in Multigraphs 1994 24 NETWORKS Arthur & Frendewey, An Algorithm for Generating Minimum Cost Network Flow Problems with Specific Structure and Known Optimal Solutions 1994 24 NETWORKS Dinneen & Hafner, New Results for the Degree/Diameter Problem 1994 24 NETWORKS Katoh & Iwano, Efficient Algorithms for Minimum Range Cut Problems 1994 24 NETWORKS Chen & Duh, Topological Properties, Communication, and Computation on WK-Recursive Networks 1994 24 NETWORKS Carpinelli & Oruc, Applications of Matching and Edge-Coloring Algorithms to Routing in Clos Networks 1994 24 NETWORKS Miller & Sudborough, Compressing Grids into Small Hypercubes 1994 24 NETWORKS Swaminathan, A Bad Submatrix Is Easy to Find 1994 24 NETWORKS Fernandez de le Vega & Manoussakis, Computation of the Forwarding Index via Flows: A Note 1994 24 NETWORKS Wang, A Proof of Boesch's Conjecture 1994 24 NETWORKS Gautier & Granot, Ripples, Complements, and Substitutes in Singly Constrained Monotropic Parametric Network Flow Problems 1994 24 NETWORKS Hagstrom & Hagstrom & Overbeek & Price & Schrage, Maximum Likelihood Genetic Sequence Reconstruction from Oligo Content 1994 24 NETWORKS Bienstock & Gunluk, A Degree Sequence Problem Related to Network Design 1994 24 NETWORKS Goddard, Measures of Vulnerability--The Integrity Family 1994 24 NETWORKS Beasley & Goffinet, A Delaunay Triangulation-Based Heuristic for the Euclidean Steiner Problem 1994 24 NETWORKS Cai & Keil, Spanners in Graphs of Bounded Degree 1994 24 NETWORKS Goldschmidt & Jaillet & LaSota, On Reliability of Graphs with Node Failures 1994 24 NETWORKS Althofer, Note: Small Integral Flows Need Only Sparse Networks 1994 24 NETWORKS Lee & Ryan, Local Bipartite Turan Graphs and Graph Partitioning 1994 24 NETWORKS Kalpakis & Sherman, Probabilistic Analysis of an Enhanced Partitioning Algorithm for the Steiner Tree Problem 1994 24 NETWORKS Powell & Cheung, Stochastic Programs over Trees with Random Arc Capacities 1994 24 NETWORKS Fuller & Lan, A Fast Algorithm for Bounded Generalized Processing Networks 1994 24 NETWORKS Goldschmidt & Takvorian, An Efficient Graph Planarization Two-Phase Heuristic 1994 24 NETWORKS Heydemann & Meyer & Sotteau & Opatrny, Forwarding Indices of Consistent Routings and Their Complexity 1994 24 NETWORKS Cockayne & Mynhardt & Yu, Universal Minimal Total Dominating Functions in Graphs 1994 24 NETWORKS Krishna & Hajek & Pietracaprina, Sharper Analysis of Packet Routing on a Butterfly 1994 24 NETWORKS Du & Hwang & Odlyzko & Zhang, Minimal-Distance Routing for KYKLOS II 1994 24 NETWORKS Xue, Edge-Maximal Triangulated Subgraphs and Heuristics for the Maximum Clique Problem 1994 24 NETWORKS Sung & Joo, Locating an Obnoxious Facility on a Euclidean Network to Minimize Neighborhood Damage 1994 24 NETWORKS Fischetti & Hamacher & Jornsten & Maffiolio, Weighted k-Cardinality Trees: Complexity and Polyhedral Structure 1994 24 NETWORKS Gerstel & Zaks, A New Characterization of Tree Medians with Applications to Distributed Sorting 1994 24 NETWORKS Berman & Ingco & Odoni, Improving the Location of Minimax Facilities Through Network Modification 1994 24 NETWORKS Hall & Du & Lin, Use of Continuous Approximations within Discrete Algorithms for Routing Vehicles: Experimental Results and Interpretation 1993 23 NETWORKS Geetha & Nair, On Stochastic Spanning Tree Problem 1993 23 NETWORKS Blough & Pelc, Optimal Communication in Networks with Randomly Distributed Byzantine Faults 1993 23 NETWORKS Bertsekas, A Simple and Fast Label Correcting Algorithm for Shortest Paths 1993 23 NETWORKS de Werra & Solot, Some Graph-Theoretical Models for Scheduling in Automated Production Systems 1993 23 NETWORKS Taillard, Parallel Iterative Search Methods for Vehicle Routing Problems 1993 23 NETWORKS Geetha & Nair, On Stochastic Spanning Tree Problem 1993 23 NETWORKS Sanso & Soumis, The Dynamic Predicate Stashing Copy Problem 1993 23 NETWORKS Blough & Pelc, Optimal Communication in Networks with Randomly Distributed Byzantine Faults 1993 23 NETWORKS Bertsekas, A Simple and Fast Label Correcting Algorithm for Shortest Paths 1993 23 NETWORKS Langevin & Desrochers & Derosiers & Gelinas & Soumis, A Two-Commodity Flow Formulation for the Traveling Salesman and the Makespan Problems with Time Windows 1993 23 NETWORKS Faber & Moore & Chen, Cycle Prefix Digraphs for Symmetric Interconnection Networks 1993 23 NETWORKS Trietsch, Optimal Multifacility Defensive Location on Planes with Rectilinear Distances 1993 23 NETWORKS Malik & Yu, A Branch and Bound Algorithm for the Capacitated Minimum Spanning Tree Problem 1993 23 NETWORKS Kanevsky, Finding All Minimum-Size Separating Vertex Sets in a Graph 1993 23 NETWORKS Hakimi & Schmeichel & Labbe, On Locating Path- or Tree-Shaped Facilities on Networks 1993 23 NETWORKS Wie, A Differential Game Model of Nash Equilibrium on a Congested Traffic Network 1993 23 NETWORKS Hartmann & Orlin, Finding Minimum Cost to Time Ratio Cycles with Small Integral Transit Times 1993 23 NETWORKS Hu & Hwang & Li, Most Reliable Double Loop Networks in Survival Reliability 1993 23 NETWORKS Sha & Steiglitz, Maintaining Bipartite Matchings in the Presence of Failures 1993 23 NETWORKS Haynes & Lawson, Applications of E-Graphs in Network Design 1993 23 NETWORKS Ventura & Weng, A New Method for Constructing Minimal Broadcast Networks 1993 23 NETWORKS Akl & Qiu & Stojmenovic, Fundamental Algorithms for the Star and Pancake Interconnection Networks with Applications to Computational Geometry 1993 23 NETWORKS Ananchuen & Caccetta, On the Adjacency Properties of Paley Graphs 1993 23 NETWORKS Bakker & van Leeuwen, Uniform d-Emulations of Rings, with an Application to Distributed Virtual Ring Construction 1993 23 NETWORKS Bouabdallah & Sotteau, On the Edge Forwarding Index Problem for Small Graphs 1993 23 NETWORKS Chen & Jia, Undirected Loop Networks 1993 23 NETWORKS Chen & Lee & Liu, mu-Star: An Indirect Star Network 1993 23 NETWORKS Gargano & Rescigno & Vaccaro, Fault-Tolerant Hypercube Broadcasting via Information Dispersal 1993 23 NETWORKS Hamidoune, The Minimum Order of a Cayley Graph with Given Degree and Diameter 1993 23 NETWORKS Harms & Colbourn, Renormalization of Two-Terminal Reliability 1993 23 NETWORKS Hu & Yang & Chern, A Unidirectional Ring Partition Problem 1993 23 NETWORKS Hung & Hsu & Sung, The Most Vital Edges of Matching in a Bipartite Graph 1993 23 NETWORKS Jwo & Lakshmivarahan & Dhall, A New Class of Interconnection Networks Based on the Alternating Group 1993 23 NETWORKS Katona & Woyczynski, Optimization of the Reliability Polynomial in Presence of Mediocre Elements 1993 23 NETWORKS Labahn, Some Minimum Gossip Graphs 1993 23 NETWORKS Liestman & Shermer, Additive Graph Spanners 1993 23 NETWORKS Lyuu, Fast Fault-Tolerant Parallel Communication for de Bruijn and Digit-Exchange Networks Using Information Dispersal 1993 23 NETWORKS Pradhan & Meyer, Communication Structures in Fault-Tolerant Distributed Systems 1993 23 NETWORKS Ramras, Routing Permutations on a Graph 1993 23 NETWORKS Shen & Back, Construction of Large-Size Interconnection Networks with High Performance 1993 23 NETWORKS Trahan & Rai, Reliability Evaluation and Decision Problems in Extra Stage Shuffle-Exchange MINs 1993 23 NETWORKS Varma & Chalasani, Asymmetrical Multiconnection Three-Stage Clos Networks 1993 23 NETWORKS Youssef, Off-Line Permutation Routing on Circuit-Switched Fixed-Routing Networks 1993 23 NETWORKS Zhang & Xu, A Very Short Proof of a Conjecture Concerning Set-to-Set Broadcasting 1993 23 NETWORKS Traldi, On the Star-Delta Transformation in Network Reliability 1993 23 NETWORKS Broersma & Faudree & van den Heuvel & Veldman, Decomposition of Bipartite Graphs under Degree Constraints 1993 23 NETWORKS Jansen, Bounds for the General Capacitated Routing Problem 1993 23 NETWORKS Corea & Kulkarni, Shortest Paths in Stochastic Networks with Arc Lengths Having Discrete Distributions 1993 23 NETWORKS Amin & Siegrist & Slater, On Uniformly Optimally Reliable Graphs for Pair-Connected Reliability 1993 23 NETWORKS Coullard & Rais & Rardin & Wagner, Linear-Time Algorithms for the 2-Connected Steiner Subgraph Problem on Special Classes of Graphs 1993 23 NETWORKS Farber & Hujter & Tuza, An Upper Bound on the Number of Cliques in a Graph 1993 23 NETWORKS Bianco & Mingozzi & Ricciardelli, The Traveling Salesman Problem with Cumulative Costs 1993 23 NETWORKS de Werra & Hell & Kameda & Katoh & Solot & Yamashita, Graph Endpoint Coloring and Distributed Processing 1993 23 NETWORKS Hansen & Zheng, Sharp Bounds on the Order, Size, and Stability Number of Graphs 1993 23 NETWORKS Magnanti & Mirchandani, Shortest Paths, Single Origin-Destination Network Design, and Associated Polyhedra 1993 23 NETWORKS Liestman & Shermer, Grid Spanners 1993 23 NETWORKS Harary & Hayes, Edge Fault Tolerance in Graphs 1993 23 NETWORKS Guisewite & Pardalos, A Polynomial Time Solvable Concave Network Flow Problem 1993 23 NETWORKS Brown & Colbourn & Devitt, Network Transformations and Bounding Network Reliability 1993 23 NETWORKS Goemans & Myung, A Catalog of Steiner Tree Formulations 1993 23 NETWORKS Chen & Yesha, Efficient Parallel Algorithms for Bipartite Permutation Graphs 1993 23 NETWORKS Ervolina & McCormick, Canceling Most Helpful Total Cuts for Minimum Cost Network Flow 1993 23 NETWORKS Hwang & Richards, A Two-Stage Network with Dual Partial Concentrators 1993 23 NETWORKS Moscarini, Doubly Chordal Graphs, Steiner Trees, and Connected Domination 1993 23 NETWORKS Koh & Tcha, Local Broadcasting in a Tree under Minisum Criterion 1992 22 NETWORKS Csaba & Faudree & Gyarfas & Lehel & Schelp, Networks Communicating for Each Pairing of Terminals 1992 22 NETWORKS Choi & Esfahanian, A Message-Routing Strategy for Multicomputer Systems 1992 22 NETWORKS Myrvold, Counting k-Component Forests of a Graph 1992 22 NETWORKS Li & McCormick & Simchi-Levi, Finding Disjoint Paths with Different Path-Costs: Complexity and Algorithms 1992 22 NETWORKS Benavent & Campos & Corberan & Mota, The Capacitated Arc Routing Problem: Lower Bounds 1992 22 NETWORKS Shapiro & Waxman & Nir, Level Graphs and Approximate Shortest Path Algorithms 1992 22 NETWORKS Rabinovitch & Tamir, On a Tree-Shaped Facility Location Problme of Minieka 1992 22 NETWORKS Etzion & Bar-David, An Explicit Construction of Euler Circuits in Shuffle Nets and Related Networks 1992 22 NETWORKS Rubinstein & Thomas & Weng, Degree-Five Steiner Points Cannot Reduce Network Costs for Planar Sets 1992 22 NETWORKS Ben-Natan & Barak, Parallel Contractions of Grids for Task Assignment to Processor Networks 1992 22 NETWORKS Rivera-Vega & Varadarajan & Navathe, Scheduling File Transfers in Fully Connected Networks 1992 22 NETWORKS Jaillet, Shortest Path Problems with Node Failures 1992 22 NETWORKS Elmallah & Colbourn, Series-Parallel Subgraphs of Planar Graphs 1992 22 NETWORKS Hamburger & Pippert & Weakley, On a Leverage Problem in the Hypercube 1992 22 NETWORKS Pelc, Reliable Communication in Networks with Byzantine Link Failures 1992 22 NETWORKS Fukuda & Matsui, Finding All Minimum-Cost Perfect Matchings in Bipartite Graphs 1992 22 NETWORKS Gargano, Tighter Time Bounds on Fault-Tolerant Broadcasting 1992 22 NETWORKS Hu & Hwang, Reliabilities of Chordal Rings 1992 22 NETWORKS Boyd, A Pseudopolynomial Network Flow Formulation for Exact Knapsack Separation 1992 22 NETWORKS Bagchi & Schmeichel & Hakimi, Sequential Information Dissemination by Packets 1992 22 NETWORKS Weng, Degenerate Gilbert-Steiner Trees 1992 22 NETWORKS Coffman & Gilbert, Paths through a Maze of Rectangles 1992 22 NETWORKS Elmallah, Algorithms for K-Terminal Reliability Problems with Node Failures 1992 22 NETWORKS Prisner, Two Algorithms for the Subset Interconnection Design Problem 1992 22 NETWORKS Kelly & Golden & Assad, Cell Suppression: Disclosure Protection for Sensitive Tabular Data 1992 22 NETWORKS Anily & Hassin, The Swapping Problem 1992 22 NETWORKS Tamir & Lowe, The Generalized P-Forest Problem on a Tree Network 1992 22 NETWORKS Eiselt & Gendreau & Laporte, Location of Facilities on a Network Subject to a Single-Edge Failure 1992 22 NETWORKS Sankaranarayana & Stewart, Complexity Results for Well-Covered Graphs 1992 22 NETWORKS Tsitsiklis, Special Cases of Traveling Salesman and Repairman Problems with Time Windows 1992 22 NETWORKS Polak, On a Parametric Shortest Path Problem from Primal-Dual Multicommodity Network Optimization 1992 22 NETWORKS Cheng, The Optimal Partitioning of Networks 1992 22 NETWORKS Roberts & Xu, On the Optimal Strongly Connected Orientations of City Street Graphs. III. three East-West Avenues or North-South Streets 1992 22 NETWORKS Yee & Lin, A Routing Algorithm for Virtual Circuit Data Networks with Multiple Sessions Per O-D Pair 1992 22 NETWORKS Satyanarayana & Schoppmann & Suffel, A Reliability-Improving Graph Transformation with Applications to Network Reliability 1992 22 NETWORKS Miller & Perkel, The Steiner Problem in the Hypercube 1992 22 NETWORKS Ravi & Marathe & Rangan, An Optimal Algorithm to Solve the All-Pair Shortest Path Problem on Interval Graphs 1992 22 NETWORKS Erkut & Francis & Tamir, Distance-Constrained Multifacility Minimax Location Problems on Tree Networks 1992 22 NETWORKS Hwang & Richards, Steiner Tree Problems 1992 22 NETWORKS Rote, The N-Line Traveling Salesman Problem 1991 21 NETWORKS Yang & Jin, A Primal-Dual Algorithm for the Minimum Average Weighted Length Circuit Problem 1991 21 NETWORKS Lin & Ma, Sensitivity Analysis of 0-1 Multiterminal Network Flows 1991 21 NETWORKS Russell & Gribbin, A Multiphase Approach to the Period Routing Problem 1991 21 NETWORKS Adlakha & Gladysz & Kamburowski, Minimum Flows in (s,t) Planar Networks 1991 21 NETWORKS Alexopoulos & Fishman, Characterizing Stochastic Flow Networks Using the Monte Carlo Method 1991 21 NETWORKS Avis & Deza, The Cut Cone, L^1 Embeddability, Complexity, and Multicommodity Flows 1991 21 NETWORKS Nagamochi & Ibaraki, Maximum Flows in Probabilistic Networks 1991 21 NETWORKS Ali & Huang, Balanced Spanning Forests and Trees 1991 21 NETWORKS Khang & Fujiwara, Approximate Solutions of Capacitated Fixed-Charge Minimum Cost Network Flow Problems 1991 21 NETWORKS Sidney & Sidney & Warburton, Average Properties of Two-Dimensional Partial Orders 1991 21 NETWORKS Gusfield & Naor, Efficient Algorithms for Generalized Cut-Trees 1991 21 NETWORKS Egeland & Huseby, On Dependence and Reliability Computations 1991 21 NETWORKS Ichimori & Katoh, A Two-Commodity Sharing Problem on Networks 1991 21 NETWORKS Dawson & Farrag, Fault-Tolerant Extensions of Star Networks 1991 21 NETWORKS Myrvold & Cheung & Page & Perry, Uniformly-Most Reliable Networks Do Not Always Exist 1991 21 NETWORKS Chen & Ramanan, Euclidean Shortest Path in the Presence of Obstacles 1991 21 NETWORKS Choi & Somani, The Generalized Folding-Cube Network 1991 21 NETWORKS Orda & Rom, Minimum Weight Paths in Time-Dependent Networks 1991 21 NETWORKS Mata-Montero, Resilience of Partial k-tree Networks with Edge and Node Failures 1991 21 NETWORKS Ball & Provan & Shier, Reliability Covering Problems 1991 21 NETWORKS Amin & Siegrist & Slater, On the Nonexistence of Uniformly Optimal Graphs for Pair-Connected Reliability 1991 21 NETWORKS Balinski & Gonzalez, Maximum Matchings in Bipartite Graphs via Strong Spanning Trees 1991 21 NETWORKS Boesch & Li & Suffel, On the Existence of Uniformly Optimally Reliable Networks 1991 21 NETWORKS Kashiwabara & Masuda & Nakajima & Fujisawa, Polynomial Time Algorithms on Circular-Arc Overlap Graphs 1991 21 NETWORKS Young & Tarjan & Orlin, Faster Parametric Shortest Path Minimum-Balance Algorithms 1991 21 NETWORKS Brandeau & Chiu, Parametric Analysis of Optimal Facility Locations 1991 21 NETWORKS Bermond & Tzvieli, Minimal Diameter Double-Loop Networks: Dense Optimal Families 1991 21 NETWORKS Reid, Centroids to Centers in Trees 1991 21 NETWORKS Gusfield, Efficient Algorithms for Inferring Evolutionary Trees 1991 21 NETWORKS Goldfarb & Hao & Kai, Shortest Path Algorithms Using Dynamic Breadth-First Search 1991 21 NETWORKS Chopra & Rao, On the Multiway Cut Polyhedron 1990 20 NETWORKS Simchi-Levi & Berman, Optimal Locations and Districts of Two Traveling Salesmen on a Tree 1990 20 NETWORKS Anderson & Aramendia, The Search Game on a Network with Immobile Hider 1990 20 NETWORKS Peters, The Network Simplex Method on a Multiprocessor 1990 20 NETWORKS Arbib & Italiano & Panconesi, Predicting Deadlock in Store-and-Forward Networks 1990 20 NETWORKS AboElFotoh & Colbourn, Efficient Algorithms for Computing the Reliability of Permutation and Interval Graphs 1990 20 NETWORKS Ball & Derigs & Hilbrand & Metz, Matching Problems with Generalized Upper Bound Side Constraints 1990 20 NETWORKS Smith & Doty, On the construction of Optimally Reliable Graphs 1990 20 NETWORKS Iyer & Jarvis & Ratliff, Hierarchical Solution to Network Flow Problems 1990 20 NETWORKS Lucena, Time-Dependent Traveling Salesman Problem--The Deliveryman Case 1990 20 NETWORKS Liu, A Lower Bound for the Steiner Tree Problem in Directed Graphs 1990 20 NETWORKS Snyder & Steele, Worst-Case Greedy Matchings in the Unit d-Cube 1990 20 NETWORKS Wagner, Disjoint (s,t)-Cuts in a Network 1990 20 NETWORKS Richey, Optimal Location of a Path or Tree on a Network with Cycles 1990 20 NETWORKS Nagamochi & Fukushima & Ibaraki, Relaxation Methods for the Strictly Convex Multicommodity Flow Problem with Capacity Constraints on Individual Commodities 1990 20 NETWORKS Yamada & Foulds, A Graph-Theoretic Approach to Investigate Structural and Qualitative Properties of Systems: A Survey 1990 20 NETWORKS Bertsimas, The Probabilistic Minimum Spanning Tree Problem 1990 20 NETWORKS de Simone & Lucertini & Pallottino & Simeone, Fair Dissections of Spiders, Worms, and Caterpillars 1990 20 NETWORKS Guignard & Rosenwein, An Application of Lagrangean Decomposition to the Resource-Constrained Minimum Weighted Arborescence Problem 1990 20 NETWORKS Moran & Newman & Wolfstahl, Approximation Algorithms for Covering a Graph by Vertex-Disjoint Paths of Maximum Total Weight 1990 20 NETWORKS Trietsch, Interconnecting Networks in the Plane: The Steiner Case 1990 20 NETWORKS Bern, Faster Exact Algorithms for Steiner Trees in Planar Networks 1989 19 NETWORKS Agarwal & Mathur & Salkin, A Set-Partitioning-Based Exact Algorithm for the Vehicle Routing Problem 1989 19 NETWORKS Peleg & Schaffer, Time Bounds on Fault-Tolerant Broadcasting 1989 19 NETWORKS Balas, The Prize Collecting Traveling Salesman Problem 1989 19 NETWORKS Miller & Pritikin, On the Separation Number of a Graph 1989 19 NETWORKS Lesniak & Pippert, On the Edge-Connectivity Vector of a Graph 1989 19 NETWORKS Gargano & Vaccaro, On the Construction of Minimal Broadcast Networks 1989 19 NETWORKS Martel, A Comparison of Phase and Nonphase Network Flow Algorithms 1989 19 NETWORKS Favaron & Kouider & Maheo, Edge-Vulnerability and Mean Distance 1989 19 NETWORKS Moran, Message Complexity Versus Space Complexity in Fault Tolerant Broadcast Protocols 1989 19 NETWORKS Brecht & Colbourn, Multiplicative Improvements in Network Reliability 1989 19 NETWORKS Carpaneto & Dell'Amico & Fischetti & Toth, A Branch and Bound Algorithm for the Multiple Depot Vehicle 1989 19 NETWORKS Gilbert, A Solvable Routing Problem 1989 19 NETWORKS Vande Vate, The Path Set Polytope of an Acyclic, Directed Graph with an Application to Machine Sequencing 1989 19 NETWORKS Beasley & Christofides, An Algorithm for the Resource Constrained Shortest Path Problem 1989 19 NETWORKS Anderson & Philpott, A Continuous-Time Network Simplex Algorithm 1989 19 NETWORKS Lessard & Rousseau & Minoux, A New Algorithm for General Matching Problems Using Network Flow Subproblems 1989 19 NETWORKS Provan & Kulkarni, Exact Cuts in Networks 1989 19 NETWORKS Hochbaum & Segev, Analysis of a Flow Problem with Fixed Charges 1989 19 NETWORKS Fiat & Shamir, How to Find a Battleship 1989 19 NETWORKS Burns, The Maximum Independent Set Problem for Cubic Planar Graphs 1989 19 NETWORKS Roberts & Xu, On the Optimal Strongly Connected Orientations of City Street Graphs. II 1989 19 NETWORKS Shi & Juels, Connected Reorientations of Mixed Multigraphs 1989 19 NETWORKS Balas & Yu, On Graphs with Polynomially Solvable Maximum-Weight Clique Problem 1989 19 NETWORKS Beasley, An SST-Based Algorithm for the Steiner Problem in Graphs 1989 19 NETWORKS Mrozek, Transitively Reduced and Transitively Closed Event Networks 1989 19 NETWORKS Bienstock & Monma, Optimal Enclosing Regions in Planar Graphs 1988 18 NETWORKS Manber & McVoy, Efficient Storage of Nonadaptive Routing Tables 1988 18 NETWORKS Dembo & Tulowitzki, Computing Equilibria on Large Multicommodity Networks: An Application of Truncated Quadratic Programming Algorithms 1988 18 NETWORKS Federgruen & Groenevelt, Polymatroidal Flow Network Models with Multiple Sinks 1988 18 NETWORKS Ogier, Minimum-Delay Routing in Continuous-Time Dynamic Networks with Piecewise-Constant Capacities 1988 18 NETWORKS Hedetniemi & Hedetniemi & Liestman, A Survey of Gossiping and Broadcasting in Communication Networks 1988 18 NETWORKS Brigham & Chinn & Dutton, Vertex Domination-Critical Graphs 1988 18 NETWORKS Pearn, New Lower Bounds for the Capacitated Arc Routing Problem 1988 18 NETWORKS Iwano & Steiglitz, Planarity Testing of Doubly Periodic Infinite Graphs 1988 18 NETWORKS Yamada, A Network Flow Algorithm to Find an Elementary I/O Matching 1988 18 NETWORKS Richards & Liestman, Generalizations of Broadcasting and Gossiping 1988 18 NETWORKS Hagstrom, Computational Complexity of PERT Problems 1987 17 NETWORKS Winter, Steiner Problem in Networks: A Survey 1987 17 NETWORKS Bongiovanni & Bovet, Minimal Deadlock-Free Store-and-Forward Communication Networks 1987 17 NETWORKS Wu & Chan, On the Properties of Directed Switching Networks 1987 17 NETWORKS Gunther & Hartnell & Nowakowski, Neighbor-Connected Graphs and Projective Planes 1986 16 NETWORKS Choukhmane & Franco, An Approximation Algorithm for the Maximum Independent Set Problem in Cubic Planar Graphs 1986 16 NETWORKS Hansen & Thisse & Wendell, Efficient Points on a Network 1986 16 NETWORKS Brecht & Colbourn, Improving Reliability Bounds in Computer Networks 1986 16 NETWORKS Awerbuch & Even, Reliable Broadcast Protocols in Unreliable Networks 1986 16 NETWORKS Pullen, A Random Network Model of Message Transmission 1986 16 NETWORKS Bienstock, An Algorithm for Reliability Analysis of Planar Graphs 1986 16 NETWORKS Richey & Parker, On Multiple Steiner Subgraph Problems 1982 12 NETWORKS Segall, Decentralized Maximum-Flow Protocols 1975 5 NETWORKS Karp, On the Computational Complexity of Combinatorial Problems 1996 8 NEURCOMP Maass, Lower Bounds for the Computational Power of Networks of Spiking Neurons 1995 7 NEURCOMP Budinich, Sorting with Self-Organizing Maps 1995 7 NEURCOMP Holden & Niranjan, On the Practical Applicability of VC Dimension Bounds 1995 7 NEURCOMP Lee & Bartlett & Williamson, Lower Bounds on the VC Dimension of Smoothly Parameterized Function Classes 1995 7 NEURCOMP Maass, Agnostic PAC Learning of Functions on Analog Neural Nets 1995 7 NEURCOMP Cannas, Arithmetic Perceptrons 1994 6 NEURCOMP Sima, Loading Deep Networks Is Hard 1994 6 NEURCOMP Vapnik & Levin & Le Cun, Measuring the VC-Dimension of a Learning Machine 1994 6 NEURCOMP Maass, Neural Nets with Superliinear VC-Dimension 1994 6 NEURCOMP Cardell & Joerding & Li, Why Some Feedforward Networks Cannot Learn Some Polynomials 1994 6 NEURCOMP Gee & Prager, Polyhedral Combinatorics and Neural Networks 1993 5 NEURCOMP Redlich, Supervised Factorial Learning 1993 5 NEURCOMP Floreen & Orponen, Attraction Radii in Binary Hopfield Nets are Hard to Compute 1992 4 NEURCOMP Schmidhuber, Learning Complex, Extended Sequences Using the Principle of History Compression 1992 4 NEURCOMP Schmidhuber, A Fixed Size Storage O(n^3) Time Complexity Learning Algorithm for Fully Recurrent Continually Running Networks 1992 4 NEURCOMP Cohn & Tesauro, How Tight Are the Vapnik-Chervonenkis Bounds? 1991 3 NEURCOMP Baum & Lyuu, The Transition to Perfect Generalization in Perceptrons 1991 3 NEURCOMP Apolloni & de Falco, Learning by Asymmetric Parallel Boltzmann Machines 1991 3 NEURCOMP Al-Mashouq & Reed, Including Hints in Training Neural Nets 1990 2 NEURCOMP Kruglyak, How to Solve the N Bit Encoder Problem with Just Two Hidden Units 1990 2 NEURCOMP Obradovic & Yan, Small Depth Polynomial Size Neural Networks 1990 2 NEURCOMP Brady, Guaranteed Learning Algorithm for Network with Units Having Periodic Threshold Output Function 1990 2 NEURCOMP Whitehead & Ballard, Active Perception and Reinforcement Learning 1990 2 NEURCOMP Baum, A Polynomial Time Algorithm That Learns Two Hidden Unit Nets 1993 NEWFRONT Szymanski, Graph-Theoretic Models for Photonic Networks 1993 NEWFRONT Siegel & Antonio & Liszka, Metrics for Metrics: Why it is Difficult to Compare Interconnection Networks OR How Would You Compare an Alligator to an Armadillo 1993 NEWFRONT Youssef & Scherson, Randomized Routing on Benes-Clos Networks 1997 15 NEWGEN Abe, Towards Realistic Theories of Learning 1997 15 NEWGEN Globig & Jantke & Lange & Sakakibara, On Case-Based Learnability of Languages 1997 15 NEWGEN Brazma & Cerans, Noise-Tolerant Efficient Inductive Synthesis of Regular Expressions from Good Examples 1995 13 NEWGEN Cohen & Page, Polynomial Learnability and Inductive Logic Programming: Methods and Results 1995 13 NEWGEN Wolff, Computing As Compression: An Overview of the SP Theory and System 1994 12 NEWGEN Wiehagen, From Inductive Inference to Algorithmic Learning Theory 1994 12 NEWGEN Balcazar & Diaz & Gavalda & Watanabe, The Query Complexity of Learning DFA 1994 12 NEWGEN Akutsu & Takasu, On PAC Learnability of Functional Dependencies 1994 12 NEWGEN Bezem & Keuzenkamp, Undecidable Goals for Completed Acyclic Programs 1991 8 NEWGEN Arikawa & Jantke & Yokomori, Introduction: Special Issue on Algorithmic Learning Theory 1991 8 NEWGEN Amaa, Mathematical Theory of Neural Learning 1991 8 NEWGEN Muggleton, Inductive Logic Programming 1991 8 NEWGEN Abe, Learning Commutative Deterministic Finite State Automata in Polynomial Time 1991 8 NEWGEN Shinohara & Miyano, Teachability in Computational Learning 1991 8 NEWGEN Jantke, Monotonic and Non-monotonic Inductive Inference 1991 8 NEWGEN Lange & Wiehagen, Polynomial-time Inference of Arbitrary Pattern Languages 1991 8 NEWGEN Shinohara, Inductive Inference of Monotonic Formal Systems from Positive Data 1991 8 NEWGEN Indurkhya, On the Role of Interpretive Analogy in Learning 1991 8 NEWGEN Hagiya, Synthesis of Rewrite Programs by Higher-order and Semantic Unification 1989 NEWSCIENT Deutsch, Quantum Communication Thwarts Eavesdroppers 1996 9 NNETS Horne & Hush, Bounds on the Complexity of Recurrent Neural Network Implementations of Finite State Machines 1995 8 NNETS Jagota, review of Parberry, Circuit Complexity and Neural Networks (MIT Press, 1994) 1994 7 NNETS Horne, On the Node Complexity of Neural Networks 1994 7 NNETS Krishnamurthy, Unsolvability, Complexity, and Neural Networks 1994 7 NNETS Judd & Aihara, Response to Letter by E. V. Krishnamurthy 1993 6 NNETS Brown & Korn, N-Bit Parity Networks 1993 6 NNETS Stork, N-Bit Parity Networks: A Reply to Brown and Korn 1993 6 NNETS Elsberry, Neural Network Experiments on Personal Computers and Workstations 1991 4 NNETS Stowell, review of Penrose, The Emperor's New Mind (1989) 1991 4 NNETS Xu & Tsai, Effective Neural Algorithms for the Traveling Salesman Problem 1990 3 NNR Gallant, A Connectionist Learning Algorithm with Provable Generalization and Scaling Bounds 1988 2 NNR Will, review of Minsky and Papert, Perceptrons, Expanded edition (1988) 1991 NNTA Brockett, An Estimation Theoretic Basis for The Design of Sorting and Classification Networks 1991 NNTA Hanson & Burr, What Connectionist Models Learn: Learning and Representation in Connectionist Networks 1994 7 NONLIN Wang & Xie, Grammatical Complexity of Unimodal Maps with Eventually Periodic Kneading Sequences 1995 25 NETWORKS Sundaram & Skiena, Recognizing Small Subgraphs 1995 25 NETWORKS Ding, Graphs with Not Too Many Spanning Trees 1995 25 NETWORKS Balas, The Prize Collecting Traveling Salesman Problem: II. Polyhedral Results 1994 NORTHHOLLAND Joubert & Trystram & Peters & Evans (Eds.), Parallel Computing: Trends and Applications, Proceedings of the International Conference ParCo93 1994 NORTHHOLLAND Pehrson & Simon (Eds.), Technology and Foundations: Information Processing '94, Proceedings of the IFIP 13th World Computer Congress 1993 NORTHHOLLAND Gruber & Wills, Handbook of Convex Geometry, Volumes A and B 1992 NORTHHOLLAND Evans & Joubert & Liddell (Eds.), Parallel Computing '91: Proceedings of the International Conference on Parallel Computing '91 (PICPC) 1992 NORTHHOLLAND van Leeuwen (Ed.), Algorithms, Software, Architecture: Information Processing 92, Proceedings of the IFIP 12th World Computer Congress, Volume I 1992 NORTHHOLLAND Aiken (Ed.), Education and Society: Information Processing 92, Proceedings of the IFIP 12th World Computer Congress, Volume II 1992 NORTHHOLLAND Nivat & Podelski (Eds.), Tree Automata and Languages 1992 NORTHHOLLAND Pardalos (Ed.), Advances in Optimization and Parallel Computing 1992 NORTHHOLLAND Alizadeh, Optimization Over the Positive Semi-Definite Cone: Interior-Point Methods and Combinatorial Applications (in Pardalos, Advances ...) 1992 NORTHHOLLAND Grigoriadis & Khachiyan, Approximate Solution of Matrix Games in Parallel (in Pardalos, Advances ...) 1992 NORTHHOLLAND Hager, The Dual Active Set Algorithm (in Pardalos, Advances ...) 1992 NORTHHOLLAND Li & Zenios, A Massively Parallel epsilon-Relaxation Algorithm for Linear Transportation Problems (in Pardalos, Advances ...) 1992 NORTHHOLLAND Li & Pardalos, Parallel Algorithms for the Quadratic Assignment Problem (in Pardalos, Advances ...) 1992 NORTHHOLLAND Lustig & Marsten & Shanno, The Interaction of Algorithms and Architectures for Interior Point Methods (in Pardalos, Advances ...) 1992 NORTHHOLLAND Rosen & Xue & Phillips, Efficient Computation of Extreme Points of Convex Hulls in R^d1 (in Pardalos, Advances ...) 1992 NORTHHOLLAND Yackel & Meyer, Optimal Tilings for Parallel Database Design (in Pardalos, Advances ...) 1992 NORTHHOLLAND Ye, A Further Result on the Potential Reduction Algorithm for the P-Matrix Linear Complimentarity Problem (in Pardalos, Advances ...) 1992 NORTHHOLLAND Ince (Ed.), Collected Works of A. M. Turing: Mechanical Intelligence 1992 NORTHHOLLAND Britton (Ed.), Collected Works of A. M. Turing: Pure Mathematics 1991 NORTHHOLLAND Lenstra & Kan & Schrijver (Eds.), History of Mathematical Programming 1991 NORTHHOLLAND Boyanov (Ed.), Parallel and Distributed Processing: Proceedings of the Second Workshop on Parallel and Distributed Processing (WP&DP '90) 1991 NORTHHOLLAND Dittrich & Rautakivi & Saari (Eds.), Proceedings of the Sixth IFIP International Conference on Computer Security and Information Integrity in our Changing World IFIP/Sec'90 1990 NORTHHOLLAND Chang & Keisler, Model Theory, Third edition 1990 NORTHHOLLAND , Directory of Portable Databases 1989 NORTHHOLLAND Borger, Computability, Complexity, Logic 1989 NORTHHOLLAND Miklosko & Vajtersic & Vrto & Klette, Fast Algorithms and Their Implementation on Specialized Parallel Computers 1988 NORTHHOLLAND Nishizeki & Chiba, Planar Graphs: Theory and Algorithms 1987 NORTHHOLLAND Takeuti, Proof Theory, Second edition 1987 NORTHHOLLAND Alling, Foundations of Analysis over Surreal Number Fields 1986 NORTHHOLLAND Lovasz, Matching Theory 1985 NORTHHOLLAND Lovasz & Recski (eds.), Matroid Theory 1979 NORTHHOLLAND Lovasz, Combinatorial Problems and Exercises 1977 NORTHHOLLAND MacWilliams & Sloane, The Theory of Error-Correcting Codes, Parts I and II 1997 NORTON Schey, Div, Grad, Curl, and All That: An Informal Text on Vector Calculus, Third Edition 1993 NORTON Cooper, Teaching Introductory Programming 1989 NORTON Patterson & Kiser & Smith, Computing Unbound: Using Computers in the Arts and Sciences 1989 NORTON Kiser & Patterson, Instructor's Manual for Computing Unbound 1985 NORTON Cooper, Teaching Introductory Programming (with Oh! Pascal!) 1991 NOTES Finkel & LeBlanc & Ramanath, Hints on Writing Style; Comments on `Hints on Writing Style'; Reply to Ramanath's Comments on Style 1989 NOTES Royer, History of the Cantor-Bernstein Theorem 1988 NOTES Li & Vitanyi, Formal Language Theory by Kolmogorov (Working Notes) 1987 NOTES Simon, Mazes 1985 NOTES Karp, lecture notes on parallel algorithms 1985 NOTES Lovasz, lecture notes on Matroids, etc. 1978 NOTES Pratt, Axioms for Adverbs 1978 NOTES Solovay, randomness 1977 NOTES Knuth, Hints for Referees 1975 NOTES Pratt, Improvements and Applications for the Weiner Repetition Finder 1973 NOTES Pratt, Weiner's Multiword Finder--Impressions 1997 44 NOTICES Rota, Ten Lessons I Wish I Had Been Taught 1997 44 NOTICES Babbitt, Mathematical Journals: Past, Present and Future--A Personal View 1996 43 NOTICES Pomerance, A Tale of Two Sieves 1996 43 NOTICES Shmoys, The Contributions of Richard M. Karp to Computer Science 1996 43 NOTICES Batterson, The Mathematical Work of Stephen Smale 1996 43 NOTICES Zucker, Teaching at the University Level 1996 43 NOTICES Ross & Barker & Wu & Andrews & Millett & Tucker & Roitman & Hunt & Howe & Askey & Bass & Sah & Conway & Johnson & Henkin, Views on High School Mathematics Education 1996 43 NOTICES Barnsley, Fractal Image Compression 1996 43 NOTICES Denning, Undergraduate Education in Computer Science & Engineering 1996 43 NOTICES Faris, Shadows of the Mind: A Search for the Missing Science of Consciousness 1996 43 NOTICES Okerson, Whose Article Is It Anyway? 1996 43 NOTICES Steinberger, Electronic Mathematics Journals 1995 42 NOTICES Immerman, Descriptive Complexity: A Logician's Approach to Computation 1995 42 NOTICES Hoppensteadt, Getting Started in Mathematical Biology 1995 42 NOTICES Lander, Mapping Heredity: Using Probabilistic Models and Algorithms to Map Genes and Genomes 1995 42 NOTICES Hwang, Writing in the Age of LaTeX 1995 42 NOTICES Faltings, The Proof of Fermat's Last Theorem by R. Taylor and A. Wiles 1995 42 NOTICES Epstein & Levy, Experimentation and Proof in Mathematics 1995 42 NOTICES Roberts, A Partnership in Mathematics Education: School and University Faculty Working Together 1995 42 NOTICES Radin, Symmetry and Tilings 1995 42 NOTICES Odlyzko, Tragic Loss or Good Riddance? The Impending Demise of Traditional Scholarly Journals 1995 42 NOTICES Quinn, Roadkill on the Electronic Highway: The Threat to the Mathematical Literature 1994 41 NOTICES Pippenger, Avi Wigderson 1994 41 NOTICES Baker, review of Exploring Interior-Point Linear Programming 1994 41 NOTICES Duren, The Most Urgent Problem for the Mathematics Profession 1994 41 NOTICES Gratzer, Advances in TeX Implementations. III. A New Version of LaTeX, Finally 1994 41 NOTICES Fishel, Computational Laboratories in Number Theory 1994 41 NOTICES Babai, Probably True Theorems, Cry Wolf? 1994 41 NOTICES Jackson, Update on Proof of Fermat's Last Theorem: Gap Appears in Proof but Experts Laud Wiles's Accomplishment 1993 40 NOTICES Devlin, The Death of Proof? 1993 40 NOTICES Pinch, Some Primality Testing Algorithms 1993 40 NOTICES Zeilberger, Theorems for a Price: Tomorrow's Semi-Rigorous Mathematical Culture 1993 40 NOTICES Jackson, Fermat Fest Draws a Crowd 1993 40 NOTICES Phillips & Levy & Munzner, Geomview: An Interactive Geometry Viewer 1993 40 NOTICES Ribet, Wiles Proves Taniyama's Conjecture; Fermat's Last Theorem Follows 1993 40 NOTICES Devlin, Software Reviews 1993 40 NOTICES Shapiro, The Arnold Ross Lecture Series 1993 40 NOTICES Casti, Bitmap-free TeX (review) 1993 40 NOTICES Davis & Dray & Weideman, The Student Edition of MATLAB (review) 1993 40 NOTICES Goldson & Reeves, Using Programs to Teach Logic to Computer Scientists 1993 40 NOTICES Gratzer, AmS-LaTeX 1993 40 NOTICES Darling, review of FrameMaker 3.0 1993 40 NOTICES Molzon, For Flat-Rate Funding: Best Use of Budget to Support Mathematics 1993 40 NOTICES Polking, Against Flat-Rate Funding: Deleterious Long-Term Effects 1993 40 NOTICES Wos, Automated Reasoning Answers Open Questions 1993 40 NOTICES Ruckle, Mathcad 3.1: Calculations for the Rest of Us (review) 1993 40 NOTICES Pinkham, The TI-85 (review) 1992 39 NOTICES Devlin, What Constitutes an Acceptable Mathematical Proof? 1992 39 NOTICES Mackenzie, Computers, Formal Proofs, and the Law Courts 1992 39 NOTICES Crannell, Applying for Jobs: Advice from the Front 1992 39 NOTICES AMS, Pilot Assessment of the Mathematical Sciences, Prepared for the House Committee on Science, Space, and Technology 1991 38 NOTICES Doob, TeX and the Single CPU, II 1991 38 NOTICES McClure, 1991 Annual AMS-MAA Survey (First Report) 1991 38 NOTICES Farmer & Thayer, Two Computer-Supported Proofs in Metric Space Topology 1991 38 NOTICES Riddle, review of freeware Plot 1991 38 NOTICES Gleason, What Every Mathematics Graduate Student Should Know about Looking for a Job (But was too busy to ask) 1991 38 NOTICES Levy, Symbolic vs. Numerical Computations in Mathematical Research 1991 38 NOTICES National Research Council, Moving Beyond Myths: Revitalizing Undergraduate Mathematics 1991 38 NOTICES Silverman, A Perspective on Computational Number Theory 1991 38 NOTICES Turner, Will the ``Real'' Real Arithmetic Please Stand Up? 1991 38 NOTICES Pickover, Mathematics and Beauty: Several Short Classroom Experiments 1991 38 NOTICES Casti, VTeX Typesetting Package: A TeX for Tomorrow 1991 38 NOTICES de Bruijn, Checking Mathematics with Computer Assistance 1991 38 NOTICES Barwise, Some Thoughts on Mathematics, Logic, and Computers 1990 37 NOTICES , The Mathematics Job Market: Are New Ph.D.s Having Trouble Getting Jobs? 1990 37 NOTICES , The David II National Plan 1990 37 NOTICES Devlin, Computers and Research at Four-Year Colleges 1990 37 NOTICES , Renewing U. S. Mathematics: A Plan for the 1990s (``David II''), Appendix B 1990 37 NOTICES Jackson, Commentary on David II 1990 37 NOTICES Milne, Four Word Processors with TeX Capabilities 1990 37 NOTICES Dudley, Program Verification (letter) 1990 37 NOTICES Maurer, Homework Assignments by Computer Mail 1990 37 NOTICES Barwise, Computers and Visual Representations in Mathematics 1990 37 NOTICES James, Computers-in-Calculus: The Dearborn Project 1989 36 NOTICES Palais, A Differing View on Mathematics Education Reform 1989 36 NOTICES anonymous, Survey of American Research Journals 1989 36 NOTICES Gilchrist, TeX and Typesetting - A Publisher's View 1989 36 NOTICES Doob, TeX and Typesetting - An Author's View 1989 36 NOTICES Gardner & Wagon, At Long Last, The Circle Has Been Squared 1989 36 NOTICES committee, How Should Mathematicians Prepare for College Teaching? 1989 36 NOTICES Vesley, The Last Word on Boolos' Proof of Goedel's Theorem 1989 36 NOTICES Fetzer, Mathematical Proofs of Computer System Correctness: A Response 1989 36 NOTICES Delahaye, Chaitin's Equation: An Extension of Goedel's Theorem 1989 36 NOTICES Barwise, Mathematical Proofs of Computer System Correctness 1989 36 NOTICES Boolos, New Proof of the Goedel Incompleteness Theorem (follow-up) 1989 36 NOTICES Boolos, A New Proof of the Goedel Incompleteness Theorem 1989 36 NOTICES Barwise, TeX LaTeX, and AMS-TeX 1989 36 NOTICES Barwise & Etchemendy, Creating Courseware 1988 35 NOTICES Simon & Wilson, Supercalculators on the PC 1988 35 NOTICES Shankar, Observations on the Use of Computers in Proof Checking 1988 35 NOTICES Hastad, Lower Bounds in Computational Complexity Theory 1988 35 NOTICES Landau, Zero Knowledge and the Department of Defense 1987 34 NOTICES Goldstein & Loomis & Tetewsky, Technical Wordprocessors for the IBM PC and Compatibles: Report by the Boston Computer Society, Part IIB--Reviews 1974 NOTICES Halmos, How to Talk Mathematics 1991 NRNTCS Barth, What Is All the Fuss About Neural Networks? 1991 NRNTCS Brauer, The New Paradigm of Informatics 1991 NRNTCS Carlson, Virtual Text and New Habits of Mind 1991 NRNTCS Cremers & Hibbard, Axioms for Concurrent Processes 1991 NRNTCS Culik & Dube, New Methods for Image Generation and Compression 1991 NRNTCS Edelsbrunner & Seidel & Sharir, On the Zone Theorem for Hyperplane Arrangements 1991 NRNTCS Estivill-Castro & Wood, Sorting, Measures of Disorder, and Worst-case Performance 1991 NRNTCS Hambrusch & Tu, New Algorithms and Approaches for 1-Dimensional Layout Compaction 1991 NRNTCS Kriegel, Query Processing in Spatial Database Systems 1991 NRNTCS Moret & Shapiro, How to Find a Minimum Spanning Tree in Practice 1991 NRNTCS Muller, Current Trends in Distributed Systems 1991 NRNTCS Ottmann, Trees -- a Personal View 1991 NRNTCS Rozenberg, Labeled 2-Structures 1991 NRNTCS Salomaa, Verifying and Recasting Secret Ballots in Computer Networks 1991 NRNTCS Schaer & Stone, Face Traverses and a Volume Algorithm for Polyhedra 1991 NRNTCS Tomek & Maurer, Hypermedia -- from the Past to the Future 1991 NRNTCS Welzl, Smallest Enclosing Disks (Balls and Ellipsoids) 1983 NRREVIEWS Bentley & Kung, An Introduction to Systolic Algorithms and Architectures 1991 58 NUMMATH Shroff, A Parallel Algorithm for the Eigenvalues and Eigenvectors of a General Complex Matrix 1989 56 NUMMATH Eichenauer-Herrmann & Grothe, A Remark on Long-Range Correlations in Multiplicative Congruential Pseudo Random Number Generators 1994 144 NYTIMES Kolata, Leonard Adleman: Hitting the High Spots of Computer Theory (Dec. 13) 1994 143 NYTIMES Kolata, A Year Later, Snag Persists In Math Proof (6/28/94) 1994 NYTIMES Kolata, The Assault on 114,381,625,757,888,867,669,235,779,976,146,612,010,218,296,721,242,362,562,561,842,935,706,935,245,733,897,830,597,123,563,958,705,058,989,075,147,599,290,026,879,543,541 (3/22/94) 1992 141 NYTIMES Kolata, New Short Cut Found For Long Math Proofs 1991 141 NYTIMES Kolata, Tied Up in Knots, Cryptographers Test Their Limits 1991 141 NYTIMES Markoff, Scientists Devise Math Tool To Break a Protective Code 1988 NYTIMES Gleick, The Quest for True Randomness Finally Appears Successful 1987 NYTIMES Gleick, A New Approach to Protecting Secrets Is Discovered 1984 NYTIMES Friedman, Computer Digests the Talmud to Help Rabbis 1980 NYTIMES , A Russian's Solution in Math Questioned 1979 NYTIMES Browne, Mathematic Problem-Solving Discovery Reported 1979 NYTIMES Friendly, Shazam! A Shortcut for Computers 1977 NYTIMES Browne, Scientist Urges New Laws to Curb Misuse of Computer Technology 1977 NYTIMES Browne, Scientists Accuse Security Agency of Harassment over Code Studies 1996 NYTMAG Menand, How to Make a Ph.D. Matter (9/22/96) 1987 136 NYTMAG Johnson, Memory: Learning How It Works 1984 NYTMAG Asbell, Writers' Workshop At Age 5 1994 OCHDWR Cloonan, Architectural Considerations for Optical Computing and Photonic Switching 1994 OCHDWR Smith & Murdocca & Stone, Parallel Optical Interconnections 1994 OCHDWR Dvornikov & Esener & Rentzepis, Three-Dimensional Optical Storage Memory by Means of Two-Photon Interaction 1995 19 OLMAG Courtois & Baer & Stark, Cool Tools for Searching the Web: A Performance Evaluation 1995 19 OLMAG Crawford, Bargain-Basement PCs: Sensible Savings? 1994 18 OLMAG Courtois, How To Find Information Using Internet Gophers 1994 18 OLMAG Makulowich, Tips On How To Teach The Internet 1993 ONLINE O'Rourke, computational geometry bibliography, orourke-col.ps at cs.usask.ca 1992 ONLINE Grosse, encrypted SIAM membership list, /research/siamdb at research.att.com (login netlib, password email address) 1992 ONLINE Davie, functional bibliography, /pub/staple/pubs.txt at tamdhu@dcs.st-and.ac.uk 1992 ONLINE Barron, LIBRARIES.TXT, list of electronic libraries on internet, ftp.unt.edu, library directory 1991 ONLINE bibliography for Annual IEEE Symposium on Logic in Computer Science, theory.lcs.mit.edu (18.52.0.92), pub/meyer/lics.bib 1991 ONLINE Meyer, Information and Computation bibliography, volumes 52-94, 1982-1991, theory.lcs.mit.edu 1990 ONLINE Zimmerman, 850-entry algorithm-analysis bibliography misc/algo.bib.Z (compressed) at nuri.inria.fr (128.93.1.26), available by anonymous ftp 1987 ONLINE Miya, 8000-entry MP (multiprocessor?) bibliography at eugene@pioneer.arpa or eugene@ames-aurora.arpa (NASA Ames Research Center), available by anonymous ftp in the evening PDT 1993 4 OOPSM Baker, Equal Rights for Functional Objects or, The More Things Change, The More They Are the Same 1990 1 OOPSM Wegner, Concepts and Paradigms of Object-Oriented Programming 1990 OPTOP Kong & Litherland & Rosenfeld, Problems in the Topology of Binary Digital Images 1990 OPTOP Meyer & de Vink, On Relating Denotational and Operational Semantics for Programming Languages with Recursion and Concurrency 1988 OPTSOFT Gabasov & Kirillova, Methods of Optimization 1996 13 ORDER Duffus & Goddard, The Complexity of the Fixed Point Property 1996 13 ORDER Liu & Sidney, Ordinal Algorithms for Packing with Target Center of Gravity 1996 13 ORDER Caro, Two Combinatorial Problems on Posets 1996 13 ORDER Mitas & Reuter, Subgraphs of Hypercubes and Subdiagrams of Boolean Lattices 1995 12 ORDER Rodl & Thoma, The Complexity of Cover Graph Recognition for Some Varieties of Finite Lattices 1995 12 ORDER Chenier & Urrutia & Zaguia, Scheduling Tasks with Communication Delays on Parallel Processors 1995 12 ORDER Garg & Tamassia, Upward Planarity Testing 1995 12 ORDER Canfield & Williamson, A Loop-Free Algorithm for Generating the Linear Extensions of a Poset 1994 11 ORDER Isaak, Scheduling Rooted Forests with Communication Delays 1994 11 ORDER Kratsch & Rampon, Towards the Reconstruction of Posets 1994 11 ORDER Lonc, Chain Partitions of Ordered Sets 1994 11 ORDER Jourdan & Rampon & Jard, Computing On-Line the Lattice of Maximal Antichains of Posets 1994 11 ORDER Ryter & Schmid, Deciding Frattini is NP-Complete 1993 10 ORDER Brightwell, On the Complexity of Diagram Testing 1993 10 ORDER Nesetril & Rodl, Complexity of Diagrams (Corrigendum) 1993 10 ORDER Steiner, Finding the Largest Suborder of Fixed Width (Corrigendum) 1993 10 ORDER Pruesse & Ruskey, Gray Codes from Antimatroids 1993 10 ORDER Atkinson, Transforming Binary Sequences Using Priority Queues 1993 10 ORDER Ginsburg, On the Dimension of Ordered Sets with the 2-Cutset Property 1993 10 ORDER Behrendt, Homogeneity in Finite Ordered Sets 1992 9 ORDER Brightwell, Random k-Dimensional Orders: Width and Number of Linear Extensions 1992 9 ORDER Steiner, Finding the Largest Suborder of Fixed Width 1992 9 ORDER Gimbel, Sources in Posets and Comparability Graphs 1992 9 ORDER Storcken & De Swart, Towards an Axiomatization of Orderings 1992 9 ORDER Brightwell & Scheinerman, Fractional Dimension of Partial Orders 1992 9 ORDER Bekkali & Bonnet & Rubin, Compact Interval Spaces in which All Closed Subsets Are Homeomorphic to Clopen Ones, II 1992 8 ORDER Koppelberg & Monk, Pseudo-Trees and Boolean Algebras 1992 8 ORDER Bokowski & Kollewe, On Representing Contexts in Line Arrangements 1991 8 ORDER Brightwell & Winkler, Counting Linear Extensions 1991 8 ORDER Ma & Spinrad, Transitive Closure for Restricted Classes of Partial Orders 1991 8 ORDER Karzanov & Khachiyan, On the Conductance of Order Markov Chains 1991 7 ORDER Spencer, Nonconvergence in the Theory of Random Orders 1991 7 ORDER Banaschewski & Pultr, Tarski's Fixpoint Lemma and Combinatorial Games 1990 7 ORDER Komlos, A Strange Pigeon-Hole Principle 1990 7 ORDER Bandelt & Meletiou, An Algebraic Setting for Near-Unanimity Consensus 1989 6 ORDER Nowakowski & Parker, Ordered Sets, Pagenumbers and Planarity 1989 6 ORDER Kierstead & Trotter, The Number of Depth-First Searches of an Ordered Set 1989 6 ORDER Kierstead & Penrice, Computing the Dimension of N-Free Ordered Sets is NP-Complete 1989 6 ORDER Albert & Frieze, Random Graph Orders 1989 5 ORDER Sauer & Stone, Preemptive Scheduling of Interval Orders is Polynomial 1988 5 ORDER Schaffer, Computing the Bump Number with Techniques from Two-Processor Scheduling 1988 5 ORDER Kahn & Lagarias & Witsenhausen, Single-Suit Two-Person Card Play II. Dominance 1987 4 ORDER Abraham, A Note on Dilworth's Theorem in the Infinite Case 1987 4 ORDER Bouchitte & Habib, NP-Completeness Properties About Linear Extensions 1987 4 ORDER Alon & Trotter & West, Regressions and Monotone Chains II: The Poset of Integer Intervals 1987 3 ORDER Nesetril & Rodl, Complexity of Diagrams 1987 3 ORDER Freese, Free Lattice Algorithms 1987 3 ORDER Ganter & Nevermann & Reuter & Stahl, How Small can a Lattice of Order-Dimension n be? 1987 3 ORDER Milner & Wang & Li, Some Inequalities for Partial Orders 1986 3 ORDER Bollobas & Brightwell & Nesetril, Random Graphs and Covering Graphs of Posets 1986 3 ORDER Kierstead, NP-Completeness Results Concerning Greedy and Super Greedy Linear Extensions 1986 3 ORDER Pretzel, On Reorienting Graphs by Pushing Down Maximal Vertices 1986 3 ORDER Furedi & Kahn, On the Dimensions of Ordered Sets of Bounded Degree 1985 2 ORDER Aigner, A Note on Merging 1985 2 ORDER Linial & Saks & Shor, Largest Induced Suborders Satisfying the Chain Condition 1985 2 ORDER Saks, Balancing Linear Extensions of Ordered Sets 1985 2 ORDER Chang & Edmonds, The Poset Scheduling Problem 1985 2 ORDER Sali, A Sperner-Type Theorem 1985 2 ORDER Kierstead & Trotter, Inequalities for the Greedy Dimensions of Ordered Sets 1985 2 ORDER Winkler, Connectedness and Diameter for Random Orders of Fixed Dimension 1985 2 ORDER Engel, Recognition of Order-Preserving Maps 1985 1 ORDER Chung & Fishburn & Wei, Cross-Monotone Subsequences 1985 1 ORDER Holland & Mekler & Shelah, Lawless Order 1985 1 ORDER Monjardet, A Use for Frequently Rediscovering a Concept 1985 1 ORDER Skilton, Imbedding Posets in the Integers 1984 1 ORDER Kahn & Saks, Balancing Poset Extensions 1984 1 ORDER Kierstead & McNulty & Trotter, A Theory of Recursive Dimension for Ordered Sets 1996 OREILLY Garfinkel & Spafford, Practical UNIX and Internet Security, Second Edition 1994 OREILLY Frey & Adams, !%@:: A Directory of Electronic Mail Addressing & Networks, Fourth Edition 1993 OREILLY Estrada, Connecting to the Internet: A Buyer's Guide 1992 OREILLY Krol, The Whole Internet User's Guide & Catalog 1990 OREILLY Frey & Adams, !%@:: A Directory of Electronic Mail Addressing and Networks 1991 ORYX Gastel, Teaching Science: A Guide for College and Professional School Instructors 1996 3 OS2MAG Callaway, Java Meets REXX (September) 1996 3 OS2MAG Goran, Info-ZIP's UnZip REXX Interface (September) 1996 3 OS2MAG Schindler, The Net's in the Mail (September) 1996 3 OS2MAG Schindler, Scanning in OS/2 (August) 1996 3 OS2MAG Proffit, The Preload Situation: Where Can You Buy a PC with OS/2 Already Installed? (July) 1996 3 OS2MAG Proffit, review of Adaptec AHA-2940UW Bus Master and Seagate Hawk 2XL 2.0GB Disk (July) 1996 3 OS2MAG Reich, Tip 233: WebExplorer through CompuServe (June) 1996 3 OS2MAG Reich, Tip 237: Drag-and-Drop Unzip (June) 1996 3 OS2MAG Schindler, Extending the Enhanced Editor: Adding REXX Functionality to EPM (June) 1996 3 OS2MAG Proffit, review of File Manager/2 2.40a (June) 1996 3 OS2MAG Proffit, review of Xit 2.1 (June) 1996 3 OS2MAG Antoniades, review of FontFolder 2.0 (June) 1996 3 OS2MAG Goran, LaunchPad Revisited (June) 1996 3 OS2MAG Schindler, Learning the Enhanced Editor (May) 1996 3 OS2MAG Gould, Mathematica for OS/2 (May) 1996 3 OS2MAG Turner, Hacking the OS/2 Migration Database (March) 1996 3 OS2MAG Miranda, Not Your Father's C Compiler: Exploring the Functions within IBM VisualAge C++ (March) 1996 3 OS2MAG Kruer, Hockware's VisPro/REXX 3.0: Visual REXX Keeps Getting Better (March) 1996 3 OS2MAG Eidswick & Eidswick, Everything You Always Wanted To Know about HPFS... (February) 1996 3 OS2MAG White, Enhancing the Workplace Shell: Object Desktop (review) (February) 1995 2 OS2MAG Proffit, review of Visual Slickedit 1.72 (December) 1995 2 OS2MAG Proffit, Back Again/2 Professional 3.0A (review) (November) 1995 2 OS2MAG Proffit, UniMaint 4.0 (review) (November) 1995 2 OS2MAG Bailes, Copy, Cut, and Paste: Manipulating graphics using the OS/2 Clipboard (November) 1995 2 OS2MAG Wright, Creating CD-ROMs from the Desktop: Unite CD-Master (review) (November) 1995 2 OS2MAG Kruer, Disk Compression Shootout: DCF/2, Stacker, Zipstream (October) 1995 2 OS2MAG Wright, The American Heritage Dictionary Deluxe Third Edition with Roget's II Thesaurus: Great Content, Poor Presentation (October) 1995 2 OS2MAG Schindler, Enhanced Editor Tips (September) 1995 2 OS2MAG Reich, Customizing Tips (September) 1995 2 OS2MAG Schindler, Impos/2 (review) 1995 2 OS2MAG Bailes, Stretching The Internet 1995 2 OS2MAG Love, Xbase for OS/2: OnCmd Version 1.1.4 (review) 1995 2 OS2MAG Miranda, Exploring IBM Works: The Integrated Application in the OS/2 Warp BonusBak 1995 2 OS2MAG Halbert, The Path to \nowhere: A Guided Tour Around OS/2's Directories 1995 2 OS2MAG Goran, Drag & Drop with REXX: Using REXX to Create and Manipulate Program Objects 1995 2 OS2MAG Reich, Pass the DOS Settings, Please 1995 2 OS2MAG Bailes, High Resolution Graphics: Configuring Graphics Subsystems for OS/2 Warp with Fewer Headaches and Crashes 1995 2 OS2MAG Ivens, A New OS/2 Spreadsheet: Mesa 2 from Athena Design (review) 1995 2 OS2MAG Goran, REXX Components 1995 2 OS2MAG Panza, Inside TCP/IP For OS/2: Understanding and Using the Transmission Control Protocol/Internet Protocol 1995 2 OS2MAG Zeichick & Moskowitz & Proffit & Schindler & Antoniades, OS/2 Warp: The Next Generation 1995 2 OS2MAG Metz, Practicing Safe REXX 1995 2 OS2MAG Bailes, Tape Backup Under OS/2: High End, Low End and Everything in Between (no. 1) 1995 2 OS2MAG Minasi, Dueling With Dual Boot: Converting an Existing OS/2 System to Dual Boot (no. 1) 1994 1 OS2MAG Moskowitz, Faster, Better, Neater 1994 1 OS2MAG Pinnell, Game-playing with OS/2 1994 1 OS2MAG Johnson, Object-Oriented Productivity 1994 1 OS2MAG Vaughan-Nichols, Cruising the Internet 1994 1 OS2MAG Bailes, Preserving your Desktop 1994 1 OS2MAG Minasi, Understanding DOS Settings 1994 1 OS2MAG Kelly-Bootle, Workplace Power (review of Brown & Howard, Using WorkPlace OS/2, The Power User's Guide to IBM OS/2 Version 2.1, Van Nostrand Reinhold, 1993) 1994 1 OS2MAG Bailes, Configurations Made Simple: Working with DOS and Win-OS/2 Settings 1994 1 OS2MAG Conklin, Need Help? Here's Where to Go: The Hitchhiker's Guide to IBM's OS/2 Tech Support 1994 1 OS2MAG Cook, X Windows on the Desktop 1994 1 OS2MAG Johnson, Building a Customized VDM 1994 1 OS2MAG Sipples, Presenting On-line Information: An Introduction to Writing .inf Files 1994 1 OS2MAG Meigs, Mysteries of config.sys: An Inside Look at OS/2's Configuration File 1994 1 OS2MAG Bailes, Desktop Tuning Tips 1994 1 OS2MAG Lane, REXX Program Structure: How to Organize Your Program 1996 4 OS2PROF Byfield, Upgrading Without Going Pentium (January) 1995 3 OS2PROF Reddy, Look It Up: The Deluxe American Heritage Dictionary (review) (November/December) 1995 3 OS2PROF Tyson, Crash-Proof Windows (November/December) 1995 3 OS2PROF Hollander, 17-Inch Monitors: Stretching Your OS/2 Desktop (October) 1995 3 OS2PROF Kliewer & Willis & Black, DeScribe: Ahead by a Nose 1995 3 OS2PROF Nicholls, Info-Mining with OnCmd 1995 3 OS2PROF Hollander, Fiddling with Your Fonts 1995 3 OS2PROF Dorfman, SLIP with a Click 1995 3 OS2PROF Wagner, OS/2 Goes to College: Implementing OS/2 in a Public Access Environment 1995 3 OS2PROF Dorfman, Slipping By Without Advantis 1995 3 OS2PROF Tyson, Not Yet Ready for Prime Time: Mesa 2 Version 2.0 for OS/2 1994 2 OS2PROF Hollander, The Coming Crash 1994 2 OS2PROF Kliewer, Building Your Own 1994 2 OS2PROF Scott & Steele, Chemistry Set (DOS-based communications) 1994 2 OS2PROF Ostrow, review of Dvorak & Whittle & McElroy, Dvorak's Guide to OS/2, Version 2.1 (Random House, 1993) 1993 1 OS2PROF Pereira, Getting Started in OS/2 REXX 1993 1 OS2PROF Moskowitz & Wees, Now That I Have C++... 1993 1 OS2PROF Moskowitz, An Introduction to C++ 1988 20 OUTLOOK Heebner, Integrating Word Processing with Writing Instruction: A Review of Research 1988 20 OUTLOOK Watt, The Computer as Microworld and Microworld Maker: A Rationale and Plan for the Inclusion of Logo in an Introductory, Preservice Course on Educational Computing 1988 20 OUTLOOK Jacobs, Social Implications of Computers: Ethical and Equity Issues 1996 OXFORD Hart (Ed.), The Philosophy of Mathematics 1996 OXFORD Courant & Robbins & Stewart, What Is Mathematics? An Elementary Approach to Ideas and Methods, Second Edition 1996 OXFORD Blum, Beyond Programming: To a New Era of Design 1995 OXFORD Kowalski & Sikorski & Stenger, Selected Topics in Approximation and Computation 1995 OXFORD Hofri, Analysis of Algorithms: Computational Methods & Mathematical Tools 1995 OXFORD Davy & Dew (Eds.), Abstract Machine Models for Highly Parallel Computers 1995 OXFORD Greenlaw & Hoover & Ruzzo, Limits to Parallel Computation: P-Completeness Theory 1994 OXFORD Crochemore & Rytter, Text Algorithms 1994 OXFORD Penrose, Shadows of the Mind: A Search for the Missing Science of Consciousness 1994 OXFORD Brown, Machines That Learn, Based on the Principles of Empirical Control 1993 OXFORD Wise & Hall, Counterexamples in Probability and Real Analysis 1993 OXFORD Hassoun (Ed.), Associative Neural Memories: Theory and Implementation 1993 OXFORD Smith, The Design and Analysis of Parallel Algorithms 1993 OXFORD Smullyan, Recursion Theory for Metamathematics 1992 OXFORD Oxley, Matroid Theory 1992 OXFORD Field & Golubitsky, Symmetry in Chaos: A Search for Pattern in Mathematics, Art and Nature 1991 OXFORD Werschulz, The Computational Complexity of Differential and Integral Equations: An Information-Based Approach 1990 OXFORD Clapham, A Concise Dictionary of Mathematics 1989 OXFORD Beasley, The Mathematics of Games 1989 OXFORD Penrose, The Emperor's New Mind: Concerning Computers, Minds, and The Laws of Physics 1988 OXFORD David, The Method of Paired Comparisons, Second Edition, Revised 1987 OXFORD Rubik & Varge & Keri & Marx & Vekerdy, Rubik's Cubic Compendium 1987 OXFORD O'Rourke, Art Gallery Theorems and Algorithms 1987 OXFORD Vitter & Chen, Design and Analysis of Coalesced Hashing 1986 OXFORD Goedel, Kurt Goedel: Collected Works, Volume I, Publications 1929-1936 1987 PAA Alt & Hagerup & Mehlhorn & Preparata, Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones 1987 PAA Dwyer & Kannan, Convex Hull of Randomly Chosen Points from a Polytope 1987 PAA Apostolico & Iliopoulos & Paige, On O(n log n) Cost Parallel Algorithm for the Single Function Coarsest Partition Problem 1987 PAA Asano & Umeo, Systolic Algorithms for Computing the Visibility Polygon and Triangulation of a Polygonal Region 1987 PAA Diks, Parallel Recognition of Outerplanar Graphs 1987 PAA Ferment & Rozoy, Solutions for the Distributed Termination Problem 1987 PAA Rytter, A Note on Optimal Parallel Transformations of Regular Expressions to Nondeterministic Finite Automata 1987 PAA Rytter & Giancarlo, Optimal Parallel Parsing of Bracket Languages 1987 PAA Uhlig, On Reliable Networks from Unreliable Gates 1987 PAA Vrto, Area-Time Tradeoffs for Selection 1987 PAA Wachter, Optimization of Special Permutation Networks Using Simple Algebraic Relations 1987 PAA Thomborson & Deneen & Shute, Computing a Rectilinear Steiner Minimal Tree in n^O(sqrt(n)) Time 1987 PAA Yap, What Can Be Parallelized in Computational Geometry? 1986 PAA Quinton & Joinnault & Gachet, A New Matrix Multiplication Systolic Array 1986 PAA Melkemi & Tchuente, Algebraic and Combinatorial Aspects of Systolic Algorithms for Some Linear Problems 1986 PAA Schmeck, A Comparison-based Instruction Systolic Array 1986 PAA Delosme & Ipsen, Systolic Array Synthesis: Computability and Time Cones 1986 PAA Rosenberg, The DIOGENES Design Methodology: Toward Automatic Physical Layout 1979 85 PACJMATH Bean & Ehrenfeucht & McNulty, Avoidable Patterns in Strings of Symbols 1995 3 PACT Achasova, Synchronous-Asynchronous Cellular Computations 1995 3 PACT Agibalov, Parallel Computations and Finite Automata on Semilattices 1995 3 PACT Anisimov, Linear Fibonacci Forms and Parallel Algorithms 1995 3 PACT Bandman, Cellular-Neural Computations. Formal Model and Possible Applications 1995 3 PACT Bianchi & Coluccini & Degano & Priami, An Efficient Verifier of Truly Concurrent Properties 1995 3 PACT Gasperoni & Schwiegelshohn & Turek, Optimal Loop Scheduling on Multiprocessors: A Pumping Lemma for p-Processor Schedules 1995 3 PACT Hartmann, Parallel and Distributed Processing of Cellular Hypergraphs 1995 3 PACT Markova & Piskunov, Computer Models of 3D Cellular Structures 1995 3 PACT Nepomniaschaya, Comparison of Two MST Algorithms for Associative Parallel Processors 1995 3 PACT Nepomniaschy & Alekseev & bystrov & Churina & Mylnikov & Okunishnikova, Petri Net Modeling of Estell-specified Communication Protocols 1995 3 PACT Schnor, Dynamic Scheduling of Parallel Applications 1995 3 PACT Vesselovski & Kupriyanova, A Method for Analyzing Combinatorial Properties of Static Connecting Topologies 1991 PACT Handler, Nature Needed Billions of Years... 1991 PACT Lengauer, A View of Systolic Design 1991 PACT Manner & Glass & Klefenz, Massively Parallel Systolic Processors for High-Speed Recognition of Simple Patterns 1991 PACT Wyrzykowski, On the Design of Systolic Array Architectures for the Iterative Solution of Linear Systems 1991 PACT Kanevsky & Korchev, A Systematic Approach to the Design of Processor Arrays 1991 PACT Likhoded & Sobolevskii & Tiountchik, Design of Systolic Arrays for Iterative Algorithms: Eigenvalue Computations 1991 PACT Kosyanchuk & Yakush, The Design of a Linear Systolic Array for the Gauss-Jordan Algorithm with Partial Pivoting 1991 PACT Powers, Parallelized Quicksort and Radixsort with Optimal Speedup 1991 PACT Bandman, Space-Time Transformation of Cellular Computations 1991 PACT Wabishchevich & Kovalenko & Ovseets & Shevchenko, Parallel Algorithms for Graph Topology Analysis and their Implementation for a Vector Supercomputer 1991 PACT Malyshkin, Linearized Mass Computation 1991 PACT Stojcev & Milovanovic & Milovanovic, Algorithm Based Fault-Tolerant Technique for Matrix Inversion 1991 PACT Creutzburg & Andrews, Parallel Isotropic Access to Tree-Like Data Structures 1991 PACT Monakhov, Parallel Algorithm for Mapping of Program Graphs into Parallel Computers 1991 PACT Anisimov & Boreisha, Dynamic Parallelism in Transputer Systems 1997 125 PAMS Brams & Taylor & Zwicker, A Moving-Knife Solution to the Four-Person Envy-free Cake-Division Problem 1996 124 PAMS Petrich & Reis & Thierrin, The Syntactic Monoid of the Semigroup Generated by a Maximal Prefix Code 1995 123 PAMS Skandalis, On the Characterization of Recursively Enumerable Sets as Pseudo-diophantine 1994 121 PAMS Bernstein, A Non-iterative 2-adic Statement of the 3N + 1 Conjecture 1994 121 PAMS Jech, On Godel's Second Incompleteness Theorem 1992 116 PAMS Loebl & Nesetril, An Unprovable Ramsey-type Theorem 1992 115 PAMS Hurley, Attractors in Restricted Cellular Automata 1991 112 PAMS Kraaikamp & Liardet, Good Approximations and Continued Fractions 1990 110 PAMS Friedman, On the Road Coloring Problem 1990 110 PAMS Agarwal, Antihook Differences and Some Partition Identities 1990 110 PAMS Mansfield, The Irrationals Are Not Recursively Enumerable 1990 109 PAMS Petrich & Thierrin, The Syntactic Monoid of an Infix Code 1990 109 PAMS Weinbaum, Unique Subwords in Nonperiodic Words 1989 PAMS Zaslavsky, Matroids Determine the Embeddability of Graphs in Surfaces 1988 104 PAMS Hildebrand & Maier, On Gaps between Prime Numbers 1988 102 PAMS Petrich & Thierren, Congruences Associated with D0L-Schemes 1987 99 PAMS Lipshitz & Rubel, A Differentially Algebraic Replacement Theorem, and Analog Computability 1973 PAMS Young, Easy Constructions in Complexity Theory: Gap and Speed-Up Theorems 1969 21 PAMS Turakainen, Generalized Automata and Stochastic Languages 1965 16 PAMS Fine & Wilf, Uniqueness Theorems for Periodic Functions 1964 15 PAMS Milnor, On the Betti Numbers of Real Varieties 1994 1 PARA Berkhin & Brown, A Transform Approach to Fast Matrix Multiplication 1994 1 PARA Gajecki & Moscinski, A New Algorithm for the Traveling Salesman Problem on Networked Workstations 1994 1 PARA Geist, Cluster Computing: The Wave of the Future? 1994 1 PARA Johnsson & Mathur, Scientific Software Libraries for Scalable Architectures 1994 1 PARA Vazhenin, Efficient High-Accuracy Computations in Massively Parallel Systems 1993 1 PARAA Akl, Parallel Synergy 1993 1 PARAA Levene & Loizou, A Modal Logic Formalism for Distributed and Parallel Knowledge Bases 1993 1 PARAA Olariu & Schwing & Shen & Wilson & Zhang, A Simple Selection Algorithm for Reconfigurable Meshes 1993 1 PARAA Tollenaere & Orban & Roose, Decomposition and Mapping of Locally Connected Layered Neural Networks on Message-Passing Multiprocessors 1993 1 PARAA Gusev & Evans, The Fastest Matrix Vector Multiplication 1993 1 PARAA Thune, A Partitioning Algorithm for Composite Grids 1993 PARCO Traff, Parallel and Distributed Algorithms for the Single-Source Shortest Path Problem Based on Moore's Algorithm 1993 PARCO Verhoefen & Aarts, A Parallel Lin-Kernighan Algorithm for the Travelling Salesman Problem 1993 PARCO Hiromoto, Are We Expecting Too Much from Parallelism? 1993 PARCO Aluru & Gustafson, Subtle Issues of SIMD Tree Search 1993 PARCO Fraigniaud & Laforest, Disjoint Spanning Trees of Small Depth 1993 PARCO Megson & Eyoh, Implementation and Evaluation of Parallel n-D Convex Hull Algorithms 1993 PARCO Smith & Renshaw, Parallel-Prefix Remapping for Efficient Data-Parallel Implementation of Unbalanced Simulations 1993 PARCO Umeo, A Fault-Tolerant Scheme for Optimum-Time Firing Squad Synchronization 1993 PARCO Cole, Parallel Programming, List Homomorphism and the Maximum Segment Sum Problem 1991 PARCO Cosnard & Ferreira, Designing Parallel Non Numerical Algorithms 1991 PARCO DeGroot, Throttling Speculative Computation: Issues and Problems 1991 PARCO Evans, Design of Parallel Numerical Algorithms 1991 PARCO Gustafson, Compute-Intensive Applications on Advanced Computer Architectures 1991 PARCO Muhlenbein, Parallel Genetic Algorithms and Neural Networks as Learning Machines 1991 PARCO Gayraud & Authie, A Parallel Algorithm for the All Pairs Shortest Path Problem 1991 PARCO Hsu & Lee & Chang, Parallel Algorithms for Computing the Minimum Visible Vertex Distance between Two Polygons 1991 PARCO Lu & Lin & Abello, An Efficient Parallel Algorithm for Longest Common Subsequence Problem 1991 PARCO Ng & Barros, Parallel Symbolic Processing Algorithms for Text Retrieval 1991 PARCO Shen, A Universal Algorithm for Parallel k-selection in Hypercubes 1990 PARCO Kashko, Reconstructing Large Images on a 32x32 Processor Dap: Simulated Annealing and Graduated Non-Convexity 1990 PARCO Langlois, Parallel Parsing Via the Backward Trace of Systolic Computations 1990 PARCO Petkov, Time-Optimal Systolic Algorithms for Some Proximity Problems 1990 PARCO Das, Systolic Dynamic Programming Algorithms 1990 PARCO Miguet, Optimal Parenthesization of a Matrix Chain Product on a Hypercube 1990 PARCO Zhang & Grant, A Parallel Sorting Scheme on Transputer Networks 1990 PARCO Peretti & Sutti, Parallel Algorithms for Non-Smooth Optimization 1990 PARCO Braschi & Ferreira & Zerovnik, On the Behaviour of Parallel Simulated Anealing 1990 PARCO Corana & Rolando & Ridella, Use of Level 3 BLAS Kernels in Neural Networks: The Back-Propagation Algorithm 1990 PARCO Heistermann & Eckardt, Parallel Algorithms for Learning in Neural Networks with Evolution Strategy 1990 PARCO Li & Fang & Wilson, Parallel Approximate Solution of 0/1 Knapsack Optimization on Competitive Neural Networks 1990 PARCO Muralidharan & Harmer & Boyle, Parallel Enumeration of All Spanning Trees of a Graph on the Encore MIMD Parallel Processor 1990 PARCO Tvrdik, On Hamiltonian Circuits, Paths and Spanning Trees of Hypercubes 1990 PARCO Sadayappan & Ercal & Ramanujam, Distributed Generation of Pairwise Combinations on a Hypercube 1990 PARCO Blough & Bagherzadeh, An Efficient Fault-Tolerant Routing Algorithm for Hypercube Systems 1990 PARCO Sloboda, Toeplitz Matrices, Curvature and Least Squares Approximation 1990 PARCO Oosthuizen, A Production System Based on Massively Parallel Marker Propagation 1990 PARCO Dekel & Shyu, A Fast Parallel Algorithm for Preemptive Scheduling of Uniform Machines 1990 PARCO Shen, A Fast Parallel Algorithm for Integer Sorting 1997 22 PARCOMP Lou & Chang, A Parallel Two-List Algorithm for the Knapsack Problem 1997 22 PARCOMP Barth, Parallel Matrix Product Algorithm in the de Bruijn Network Using Emulation of Meshes of Trees 1997 22 PARCOMP Kim & Shim & Park, A Link-disjoint Subcube for Processor Allocation in Hypercube Computers 1996 22 PARCOMP Fragopoulou & Akl, Spanning Subgraphs with Applications to Communication on the Multidimensional Torus Network 1996 22 PARCOMP Chandwani & Chaudhari, Formulation and Analysis of Parallel Context-free Recognition and Parsing on a PRAM Model 1996 22 PARCOMP Brorsson & Stenstrom, Characterising and Modelling Shared Memory Accesses in Multiprocessor Programs 1996 22 PARCOMP Gasieniec & Pelc, Adaptive Broadcasting with Faulty Nodes 1996 22 PARCOMP Boldon & Deo & Kumar, Minimum-Weight Degree-Constrained Spanning Tree Problem: Heuristics and Implementation on an SIMD Parallel Machine 1996 22 PARCOMP Ahmad & Dhodhi, Multiprocessor Scheduling in a Genetic Paradigm 1996 22 PARCOMP Colombet & Michallon & Trystram, Parallel Matrix-Vector Product on Rings with a Minimum of Communications 1996 22 PARCOMP Lee & Horng & Kao & Jaung & Chen & Tsai, Parallel Computation of Exact Euclidean Distance Transform 1996 22 PARCOMP Arguello & Amor & Zapata, FFTs on Mesh Connected Computers 1996 22 PARCOMP Savari & Bertsekas, Finite Termination of Asynchronous Iterative Algorithms 1996 22 PARCOMP Gupta & Sadayappan, Communication-efficient Matrix Multiplication on Hypercubes 1995 21 PARCOMP Dehn & Eiermann & Giebermann & Sperling, Structured Sparse Matrix-Vector Multiplication on Massively Parallel SIMD Architectures 1995 21 PARCOMP Lee, Techniques for Compiling Programs on Distributed Memory Multicomputers 1995 21 PARCOMP Yang & Tsai & Chi & Shi, Adaptive Wormhole Routing in k-ary n-Cubes 1995 21 PARCOMP Blazewicz & Drozdowski, Scheduling Divisible Jobs on Hypercubes 1995 21 PARCOMP De Agostino, A Parallel Decoding Algorithm for LZ2 Data Compression 1995 21 PARCOMP Dow, Transposing a Matrix on a Vector Computer 1995 21 PARCOMP Bhandarkar & Arabnia, The REFINE Multiprocessor -- Theoretical Properties and Algorithms 1995 21 PARCOMP Vaidyanathan & Padmanabhan, Bus-based Networks for Fan-In and Uniform Hypercube Algorithms 1995 21 PARCOMP Choi & Dongarra & Walker, Parallel Matrix Transpose Algorithms on Distributed Memory Concurrent Computers 1995 21 PARCOMP Traff, An Experimental Comparison of Two Distributed Single-Source Shortest Path Algorithms 1995 21 PARCOMP Olson, Parallel Algorithms for Hierarchical Clustering 1995 21 PARCOMP Altman & Igarashi & Obokata, Hyper-ring Connection Machines 1995 21 PARCOMP Embrechts & Roose, MIMD Divide-and-Conquer Algorithms for the Distance Transformation. Part I: City Block Distance 1995 21 PARCOMP Embrechts & Roose, MIMD Divide-and-Conquer Algorithms for the Distance Transformation. Part II: Chamfer 3-4 Distance 1995 21 PARCOMP Kanevsky & Feng, On the Embedding of Cycles in Pancake Graphs 1995 21 PARCOMP Kao & Horng, Optimal Algorithms for Computing Articulation Points and Some Related Problems on a Circular-Arc Graph 1995 21 PARCOMP Makino & Miyamura, Parallelized Feedback Shift Register Generators of Pseudorandom Numbers 1995 21 PARCOMP Saikia & Sen, Order Preserving Communication on a Star Network 1995 21 PARCOMP Cannataro & Di Gregorio & Rongo & Spataro & Spezzano & Talia, A Parallel Cellular Automata Environment on Multicomputers for Computational Science 1995 21 PARCOMP Margaritis, On the Systolic Implementation of Associative Memory Artificial Neural Networks 1995 21 PARCOMP Chen & Chuang, An Efficient Algorithm for Complete Euclidean Distance Transform on Mesh-Connected SIMD 1995 21 PARCOMP Nicol, Noncommittal Barrier Synchronization 1995 21 PARCOMP Romero & Zapata, Data Distributions for Sparse Matrix Vector Multiplication 1995 21 PARCOMP Bekakos, A Notational Approach to Formulation of Systolic Array Programs 1995 21 PARCOMP Crivelli & Jessup, The Cost of Eigenvalue Computation on Distributed-Memory MIMD Multiprocessors 1995 21 PARCOMP Sridhar & Chandrasekharan, Highly Parallelizable Problems on Sorted Intervals 1995 21 PARCOMP Kumar & Skillicorn, Data Parallel Geometric Operations on Lists 1995 21 PARCOMP Wen, Fast Parallel Algorithms for the Maximum Sum Problem 1995 21 PARCOMP Smith & Thompson, A Parallel Implementation of the Column Subtraction Algorithm 1995 21 PARCOMP Tanno & Taketa & Horiguchi, Parallel FFT Algorithms Using Radix 4 Butterfly Computation on an Eight-Neighbor Processor Array 1994 20 PARCOMP Dubey & Zubair & Grosch, A General Purpose Subroutine for Fast Fourier Transform on a Distributed Memory Parallel Machine 1994 20 PARCOMP Ostermark & Saarinen, Parallel Implementation of a VARMAX Algorithm 1994 20 PARCOMP Hu & Chen, An Effective Routing Algorithm in Incomplete Hypercubes 1994 20 PARCOMP Horng & Chen & Ku, Parallel Routing Algorithms for Incomplete Hypercube Interconnection Networks 1994 20 PARCOMP Efe & Blackwell & Slough & Shiau, Topological Properties of the Crossed Cube Architecture 1994 20 PARCOMP Polymenakos & Bertsekas, Parallel Shortest Path Auction Algorithms 1994 20 PARCOMP Farrag, Tolerating Faulty Edges in a Multi-dimensional Mesh 1994 20 PARCOMP Jain & Chaudhari, Efficient Parallel Recognition of Context-free Languages 1994 20 PARCOMP Lin, New Systolic Arrays for the Longest Common Subsequence Problem 1994 20 PARCOMP Makino, Lagged-Fibonacci Random Number Generators on Parallel Computers 1994 20 PARCOMP Kim & Yi, A Two-Pass Scheduling Algorithm for Parallel Programs 1994 20 PARCOMP Huang & Wu, Alternate Resolution Strategy in Multistage Interconnection Networks 1994 20 PARCOMP Lee & Tsay, A Systolic Design for Generating Permutations in Lexicographic Order 1994 20 PARCOMP Montagne & Rukoz & Suros & Breant, Modeling Optimal Granularity When Adapting Systolic Algorithms to Transputer Based Supercomputers 1994 20 PARCOMP Hu & Blake, Numerical Experiences with Partitioning of Unstructured Meshes 1994 20 PARCOMP Chen & Krishnamurthy & Macleod, Generalised Matrix Inversion and Rank Computation by Successive Matrix Powering 1994 20 PARCOMP Li, Multiscattering on the Cube-Connected Cycles 1994 20 PARCOMP Hong & Tseng, An Optimal Parallel Perceptron Learning Algorithm for a Large Training Set 1994 20 PARCOMP Tsay & Lee, An Optimal Parallel Algorithm for Generating Permutations in Minimal Change Order 1994 20 PARCOMP Chang & Chen & Shyu, A Parallel Algorithm for the Knapsack Problem Using a Generation and Searching Technique 1994 20 PARCOMP d'Acierno & Vaccaro, On Parallelizing Recursive Neural Networks on Coarse-Grained Parallel Computers: A General Algorithm 1994 20 PARCOMP Evans & Gusev, New Linear Systolic Arrays for Digital Filters and Convolution 1994 20 PARCOMP Seguel & Bollman, Fast Digit-Reversal Algorithms on a Shared-Memory Machine 1994 20 PARCOMP Yuan, An Efficient Fault-Tolerant Decentralized Commit Protocol 1994 20 PARCOMP Umland, Parallel Sorting Revisited 1993 19 PARCOMP Johnsson, Minimizing the Communication Time for Matrix Multiplication on Multiprocessors 1993 19 PARCOMP Amodio & Mastronardi, A Parallel Version of the Cyclic Reduction Algorithm on a Hypercube 1993 19 PARCOMP Dhrif & Sarkar, Fuzzy Arithmetic on Systolic Arrays 1993 19 PARCOMP Koc & Cappello, Systolic Arrays for Integer Chinese Remaindering 1993 19 PARCOMP Li & Lu & Schaeffer & Shillington & Wong & Shi, On the Versatility of Parallel Sorting by Regular Sampling 1993 19 PARCOMP Bossomaier & Loeff, Parallel Computation of the Hausdorff Distance between Images 1993 19 PARCOMP Gusev & Evans, New Linear Systolic Arrays for the String Comparison Algorithm 1993 19 PARCOMP Czech & Konopka & Majewski, Parallel Algorithms for Finding a Suboptimal Fundamental-Cycle Set in a Graph 1993 19 PARCOMP Chan & Friesen, Parallel Algorithm for Segment Visibility Reporting 1993 19 PARCOMP Shen, A High Performance Interconnection Network for Multiprocessor Systems 1993 19 PARCOMP Boissin & Lutton, A Parallel Simulated Annealing Algorithm 1993 19 PARCOMP Ibarra & Richards, Efficient Parallel Graph Algorithms Based on Open Ear Decomposition 1993 19 PARCOMP Wei, Parallel Asynchronous Iterations of Least Fixed Points 1993 19 PARCOMP Horng, Computing Dominators on a Cube-connected Machine 1993 19 PARCOMP Zhang & Li & Jayakumar, A Systematic Approach for Designing Concurrent Error-Detecting Systolic Arrays Using Redundancy 1993 19 PARCOMP Cheng & Chung, Reaching Approximate Agreement on Hypercube 1993 19 PARCOMP Nelson, Hypercube Matrix Multiplication 1993 19 PARCOMP El-Amawy & Raja, Split Sequence Generation Algorithms for Efficient Identification of Operational Subcubes in Faulty Hypercubes 1993 19 PARCOMP Aboelaze & Lee, A Method for Data Allocation and Manipulation in Hypercube Computers 1993 19 PARCOMP Krishnamurthy & Pin, Data Parallel Evaluation-Interpretation Algorithm for Polynomial Matrix Inversion 1993 19 PARCOMP Lakshmivarahan & Jwo & Dhall, Symmetry in Interconnection Networks Based on Cayley Graphs of Permutation Groups: A Survey 1993 19 PARCOMP Mantharam & Eberlein, New Jacobi-sets for Parallel Computations 1993 19 PARCOMP Wan & Evans, A Systolic Array Architecture for Linear and Inverse Matrix Systems 1993 19 PARCOMP Liu & You, Conflict-free Routing for BPC-Permutations on Synchronous Hypercubes 1993 19 PARCOMP Chalmers & Gregory, Constructing Minimum Path Configurations for Multiprocessor Systems 1993 19 PARCOMP Sakai & Kodama & Yamaguchi, Design and Implementation of a Circular Omega Network in the EM-4 1993 19 PARCOMP Laursen, Simple Approaches to Parallel Branch and Bound 1993 19 PARCOMP Olariu & Schwing & Zhang, Applications of Reconfigurable Meshes to Constant-Time Computations 1993 19 PARCOMP Edmonds & Chu & George, Dynamic Programming on a Shared-Memory Multiprocessor 1993 19 PARCOMP Barada & El-Amawy, A Methodology for Algorithm Regularization and Mapping into Time-Optimal VLSI Arrays 1993 19 PARCOMP Akl & Qiu, A Novel Routing Scheme on the Star and Pancake Networks and its Applications 1992 18 PARCOMP Ribeiro & Baz, A Parallel Optimal Routing Algorithm 1992 18 PARCOMP Varvarigos & Bertsekas, Communication Algorithms for Isotropic Tasks in Hypercubes and Wraparound Meshes 1992 18 PARCOMP Aluru & Prabhu & Gustafson, A Random Number Generator for Parallel Computers 1992 18 PARCOMP Kumar & Kumar & Basu, A Parallel Algorithm for Elimination Tree Computation and Symbolic Factorization 1992 18 PARCOMP Gusev & Tasic, Comparative Analysis of Methods for Broadcast Elimination 1992 18 PARCOMP Thune, The Partitioning Problem for a Class of Data Parallel Algorithms 1992 18 PARCOMP Zerovnik & Kaufman, A Parallel Variant of a Heuristical Algorithm for Graph Coloring -- Corrigendum 1992 18 PARCOMP Gupta & Hambrusch, Load Balanced Tree Embeddings 1992 18 PARCOMP Bermond & Michallon & Trystram, Broadcasting in Wraparound Meshes with Parallel Monodirectional Links 1992 18 PARCOMP Egecioglu & Koc, A Parallel Algorithm for Generating Discrete Orthogonal Polynomials 1992 18 PARCOMP Robert & Song, Revisiting Cycle Shrinking 1992 18 PARCOMP Lin & Olariu, A Fast Cost-Optimal Parallel Algorithm for the Lowest Common Ancestor Problem 1992 18 PARCOMP Adamides & Tsalides & Thanailakis, Hierarchical Cellular Automata Structures 1992 18 PARCOMP Evans & Gusev, Implementation of Folding Transformations on Linear VLSI Processor Arrays 1992 18 PARCOMP Francis & Pannan, A Parallel Partition for Enhanced Parallel QuickSort 1992 18 PARCOMP Suraweera & Bhattacharya, A Parallel Cost-Optimal Algorithm to Compute the Supremum of Max-Min Powers 1992 18 PARCOMP Dontje & Lippert & Petkov & Schilling, Statistical Analysis of Simulation-generated Time Series: Systolic vs. Semi-systolic Correlation on the Connection Machine 1992 18 PARCOMP Worley, The Effect of Multiprocessor Radius on Scaling 1992 18 PARCOMP Hsu & Hsieh & Huang, A Fully-Pipelined Systolic Algorithm for Finding Bridges on an Undirected Connected Graph 1992 18 PARCOMP Megson & Brudaru & Comish, Systolic Designs for Aitken's Root Finding Method 1992 18 PARCOMP Chen & Liang, Conflict-Free Broadcasting Algorithms for Graph Traversals and their Applications 1992 18 PARCOMP Thompson & Cowell & Leaf, On the Parallelization of an Adaptive Multigrid Algorithm for a Class of Flow Problems 1992 18 PARCOMP Holey & Ibarra, Iterative Algorithms for the Planar Convex Hull Problem on Mesh-connected Arrays 1992 18 PARCOMP Casiccia & Castangia & Cincotti & Parodi, Simulation of a Molecular Cellular Array on a Transputer-based Parallel Computer 1992 18 PARCOMP Margaritis & Evans, Systolic Implementation of Neural Networks for Searching Sets of Properties 1992 18 PARCOMP Loots & Smith, A Parallel Three Phase Sorting Procedure for a k-Dimensional Hypercube and a Transputer Implementation 1992 18 PARCOMP Goles & Kiwi, A Lower Bound on the Computational Complexity of the QR Decomposition on a Shared Memory SIMD Computer 1992 18 PARCOMP Megson & Evans, More on Systolic Line Drawing 1992 18 PARCOMP Hanxleden & Scott, Correctness and Determinism of Parallel Monte Carlo Processes 1992 18 PARCOMP Hong & Tseng, Parallel Perceptron Learning on a Single-channel Broadcast Communication Model 1992 18 PARCOMP Marrakchi, Optimal Parallel Scheduling for the 2-Steps Graph with Constant Task Cost 1992 18 PARCOMP Shen, Improved Universal k-Selection in Hypercubes 1992 18 PARCOMP Clauss & Mongenet & Perrin, Synthesis of Size-Optimal Toroidal Arrays for the Algebraic Path Problem: A New Contribution 1992 18 PARCOMP Jeong & Choi & Lee, Parallel Enclosing Rectangle on SIMD Machines 1992 18 PARCOMP Chu & George, A Balanced Submatrix Merging Algorithm for Multiprocessor Architectures 1992 18 PARCOMP Neusius & Olszewski & Scheerer, An Efficient Distributed Thinning Algorithm 1992 18 PARCOMP Wheat & Evans, An Efficient Parallel Sorting Algorithm for Shared Memory Multiprocessors 1992 18 PARCOMP El-Horbaty & Mohamed, A Synchronous Algorithm for Shortest Paths on a Tree Machine 1991 17 PARCOMP Hutchinson & Khalaf, Parallel Algorithms for Solving Initial Value Problems: Front Broadening and Embedded Parallelism 1991 17 PARCOMP De Gloria & Faraboschi, A Boltzmann Machine Approach to Code Optimization 1991 17 PARCOMP Chen & Fang, An Efficient Procedure for Theorem Proving in Propositional Logic on Vector Computers 1991 17 PARCOMP Horiguchi, Hybrid Systolic Sorters 1991 17 PARCOMP Wheat & Evans, Asynchronous Parallel Merging 1991 17 PARCOMP Swarztrauber & Sweet & Briggs & Henson & Otto, Bluestein's FFT for Arbitrary N on the Hypercube 1991 17 PARCOMP Osiakwan & Akl, Parallel Computation of Matchings in Trees 1991 17 PARCOMP Schimmler, Parallel Strong Orientation on a Mesh Connected Computer 1991 17 PARCOMP Freeman & Bane, Asynchronous Polynomial Zero-finding Algorithms 1991 17 PARCOMP Olariu & Wen, An Efficient Parallel Algorithm for Multiselection 1991 17 PARCOMP Fischer, On Superlinear Speedups 1991 17 PARCOMP Tollenaere & Orban, Simulating Modular Neural Networks on Message-Passing Multiprocessors 1991 17 PARCOMP Li, Nearest Neighbor Classification on Two Types of SIMD Machines 1991 17 PARCOMP Bar-On, Efficient Logarithmic Time Parallel Algorithms for the Cholesky Decomposition and Gram-Schmidt Process 1991 17 PARCOMP Mahjoub & Karoui-Sahtout, Parallel Algorithms for Redundant Precedence Relations Elimination in Task Systems 1991 17 PARCOMP Schroder & Murthy & Krishnamurthy, Systolic Algorithm for Polynomial Interpolation and Related Problems 1991 17 PARCOMP Jeong, An Improved Parallel Algorithm for Constructing Voronoi Diagram on a Mesh-connected Computer 1991 17 PARCOMP Lin, Array Size Anomaly of Problem-Size Independent Systolic Arrays for Matrix-Vector Multiplication 1991 17 PARCOMP Storoy & Sorevik, A Note on an Orthogonal Systolic Design for the Assignment Problem 1991 17 PARCOMP Rabhi & Manson, Divide-and-Conquer and Parallel Graph Reduction 1991 17 PARCOMP Schroeder & Strazdins, Program Compression on the Instruction Systolic Array 1991 17 PARCOMP Jeong & Kim, Fast Parallel Simulated Annealing for Traveling Salesman Problem on SIMD Machines with Linear Interconnections 1991 17 PARCOMP Shih & Feng, An Application of Neural Networks on Channel Routing Problem 1991 17 PARCOMP Jeong, Parallel Voronoi Diagram in L_1 (L_infty) Metric on a Mesh-connected Computer 1991 17 PARCOMP Chen & Chern, Synthesis of Algorithms on Processor Arrays 1991 17 PARCOMP Hake & Homberg, The Impact of Memory Organization on the Performance of Matrix Calculations 1991 17 PARCOMP Bampis & Konig & Trystram, Impact of Communications on the Complexity of the Parallel Gaussian Elimination 1991 17 PARCOMP Torralba, A Systolic Array with Applications to Image Processing and Wire-Routing in VLSI Circuits 1991 17 PARCOMP Dzwinel, The Search for an Optimal Multiprocessor Interconnection Network 1991 17 PARCOMP Wheat & Evans, Maintenance of Shared Data Structures on Tightly Coupled Multiprocessors 1991 17 PARCOMP Simmen, Comments on Broadcast Algorithms for Two-dimensional Grids 1990 16 PARCOMP Conroy, Parallel Nested Dissection 1990 16 PARCOMP Dowling, Optimal Code Parallelization Using Unimodular Transformations 1990 16 PARCOMP Veltman & Lageweg & Lenstra, Multiprocessor Scheduling with Communication Delays 1990 16 PARCOMP Huang & Kleinrock, Distributed Selectsort Sorting Algorithms on Broadcast Communication Networks 1990 16 PARCOMP Megson & Evans, Systolic Arrays for Group Explicit Methods for Solving First Order Hyperbolic Equations 1990 16 PARCOMP Megson & Evans, An Orthogonal Systolic Design for the Assignment Problem 1990 16 PARCOMP Lin & Lin, Parallel Sorting with Cooperating Heaps in a Linear Array of Processors 1990 16 PARCOMP Evans & Adamopoulos & Kortesis & Tsouros, Searching Sets of Properties with Neural Networks 1990 16 PARCOMP Risset, Implementing Gaussian Elimination on a Matrix-Matrix Multiplication Systolic Array 1990 16 PARCOMP Levin, A Fully Vectorized Quicksort 1990 16 PARCOMP Douglas & Miranker, Beyond Massive Parallelism: Numerical Computation Using Associative Tables 1990 16 PARCOMP Stewart, Communication and Matrix Computations on Large Message Passing Systems 1990 16 PARCOMP Gu & Takaoka, A Sharper Analysis of a Parallel Algorithm for the All Pairs Shortest Path Problem 1990 16 PARCOMP Manoharan & Topham, A General Bound on Schedule Length for Independent Tasks 1990 16 PARCOMP Dehne & Gastaldo, A Note on the Load Balancing Problem for Coarse Grained Hypercube Dictionary Machines 1990 16 PARCOMP Van Swaaij & Catthoor & De Man, Deriving ASIC Architectures for the Hough Transform 1990 15 PARCOMP Deak, Uniform Random Number Generators for Parallel Computers 1990 15 PARCOMP Varman & Iyer & Haderle & Dunn, Parallel Merging: Algorithm and Implementation Results 1990 15 PARCOMP Das & Deo & Prasad, Two Minimum Spanning Forest Algorithms on Fixed-Size Hypercube Computers 1990 15 PARCOMP Benaini & Robert, Spacetime-Minimal Systolic Arrays for Gaussian Elimination and the Algebraic Path Problem 1990 15 PARCOMP Tyrtyshnikov, New Approaches to Deriving Parallel Algorithms 1990 15 PARCOMP Lin, Parallel Generation of Permutations on Systolic Arrays 1990 14 PARCOMP Muhlenbein, Limitations of Multi-layer Perceptron Networks -- Steps towards Genetic Neural Networks 1990 14 PARCOMP Smieja & Muhlenbein, The Geometry of Multi-layer Perceptron Solutions 1990 14 PARCOMP Zhang & Mckenna & Mesirov & Waltz, The Backpropagation Algorithm on Grid and Hypercube Architectures 1990 14 PARCOMP Rajopadhye & Fujimoto, Synthesizing Systolic Arrays from Recurrence Equations 1990 14 PARCOMP Louka & Tchuente, Triangular Matrix Inversion on Systolic Arrays 1990 14 PARCOMP Li, Systolic Computation with Fault Diagnosis 1990 14 PARCOMP Huang & Kleinrock, Optimal Parallel Merging and Sorting Algorithms Using sqrt(N) Processors without Memory Contention 1990 14 PARCOMP Evans, A Parallel Sorting-Merging Algorithm for Tightly Coupled Multiprocessors 1990 13 PARCOMP Shih & Lee & Yang, A Parallel Algorithm for Finding Congruent Regions 1990 13 PARCOMP Das & Deo & Prasad, Parallel Graph Algorithms for Hypercube Computers 1990 13 PARCOMP De Matteis & Pagnutti, A Class of Parallel Random Number Generators 1990 13 PARCOMP Sheu & Kuo & Chen, Graph Search Algorithms and Maximum Bipartite Matching Algorithm on the Hypercube Network Model 1990 13 PARCOMP Shyu, A Parallel Algorithm for Finding a Maximum Weight Clique of an Interval Graph 1990 13 PARCOMP Sadayappan & Ercal & Ramanujam, Cluster Partitioning Approaches to Mapping Parallel Programs onto a Hypercube 1990 13 PARCOMP Zubair, An Optimal Speedup Algorithm for the Measure Problem 1990 13 PARCOMP Leach & Atogi & Stephen, The Actual Complexity of Parallel Evaluation of Low Degree Polynomials 1990 13 PARCOMP Megson, Rank Annihilation on a Ring of Processors 1990 13 PARCOMP Zerovnik, A Parallel Variant of a Heuristical Algorithm for Graph Colouring 1990 13 PARCOMP Chen & Chern & Jang, Pipeline Architectures for Dynamic Programming Algorithms 1990 13 PARCOMP Tsay & Lin, A Systolic Design for Generating Combinations in Lexicographic Order 1989 12 PARCOMP Umeo, A Design of Time-Optimum and Register-Number-Minimum Systolic Convolvers 1989 12 PARCOMP Fernandes & Girdinio, A New Storage Scheme for an Efficient Implementation of the Sparse Matrix-Vector Product 1989 12 PARCOMP Berntsen, Communication Efficient Matrix Multiplication on Hypercubes 1989 12 PARCOMP Huang & Wang & Yang & Lee, Graph Theoretic Characterization and Reliability of the Generalized Boolean n-Cube Network 1989 12 PARCOMP Arenstorf & Jordan, Comparing Barrier Algorithms 1989 12 PARCOMP Papatheodorou & Saridakis, Parallel Algorithms and Architectures for Multisplitting Iterative Methods 1989 12 PARCOMP Marrakchi & Robert, Optimal Algorithms for Gaussian Elimination on an MIMD Computer 1989 12 PARCOMP Guerra & Melhem, Synthesis of Systolic Algorithm Design 1989 12 PARCOMP Dehne & Hassenklover & Sack, Computing the Configuration Space for a Robot on a Mesh-of-Processors 1989 12 PARCOMP Benaini & Robert, An Even Faster Systolic Array for Matrix Multiplication 1989 12 PARCOMP Schimmler & Schroeder, A Simple Systolic Method to Find All Bridges of an Undirected Graph 1989 11 PARCOMP Saad & Schultz, Data Communication in Parallel Architectures 1989 11 PARCOMP Frieze & Yadegar & El-Horbaty & Parkinson, Algorithms for Assignment Problems on an Array Processor 1989 11 PARCOMP Adamides & Tsalides & Thanailakis, Synchronization of Asynchronous Concurrent Processes Using Cellular Automata 1989 11 PARCOMP Li & Fang, Parallel Clustering Algorithms 1989 11 PARCOMP Pawley & Baillie & Tenenbaum & Celmaster, The BBN Butterfly Used To Simulate a Molecular Liquid 1989 11 PARCOMP Murthy & Schroeder, Systolic Arrays for Parallel Matrix g-Inversion and Finding Petri Net Invariants 1989 11 PARCOMP Jou, Linear Rotation Based Algorithm and Systolic Architecture for Solving Linear System Equations 1989 11 PARCOMP Carlson & Sugla, Adapting Shuffle-Exchange Like Parallel Processing Organizations to Work as Systolic Arrays 1989 10 PARCOMP Greenbaum, Synchronization Costs on Multiprocessors 1989 10 PARCOMP Horiguchi & Miranker, A Parallel Algorithm for Finding the Maximum Value 1989 10 PARCOMP Cosnard & Tchuente & Tourancheau, Systolic Gauss-Jordan Elimination for Dense Linear Systems 1989 9 PARCOMP Wagner, Parallel Solution of Arbitrarily Sparse Linear Systems 1989 9 PARCOMP Aarts & Korst, Computations in Massively Parallel Networks Based on the Boltzmann Machine: A review 1989 9 PARCOMP Bevan, An Efficient Reference Counting Solution to the Distributed Garbage Collection Problem 1988 8 PARCOMP Jordan, Programming Language Concepts for Multiprocessors 1988 8 PARCOMP Treleaven, Parallel Architecture Overview 1988 8 PARCOMP Forrest & Roweth & Stroud & Wallace & Wilson, Neural Network Models 1988 8 PARCOMP Baillie, Comparing Shared and Distributed Memory Computers 1988 7 PARCOMP Stojmenovic & Miyakawa, An Optimal Parallel Algorithm for Solving the Maximal Elements Problem in the Plane 1988 7 PARCOMP Muhlenbein & Gorges-Schleuter & Kramer, Evolution Algorithms in Combinatorial Optimization 1988 6 PARCOMP Zubair & Madan, Efficient Systolic Algorithm for Finding Bridges in a Connected Graph 1988 6 PARCOMP Quinn, Parallel Sorting Algorithms for Tightly Coupled Multiprocessors 1988 6 PARCOMP Kak, A Two-layered Mesh Array for Matrix Multiplication (Short Communication) 1987 5 PARCOMP Stojmenovic & Evans, Comments on Two Parallel Algorithms for the Planar Convex Hull Problem 1987 4 PARCOMP Cheng & Sahni, VLSI Systems for Band Matrix Multiplication 1987 4 PARCOMP Pogue & Willett, Use of Text Signatures for Document Retrieval in a Highly Parallel Environment 1987 4 PARCOMP Muhlenbein & Gorges-Schleuter & Kramer, New Solutions to the Mapping Problem of Parallel Systems: The Evolution Approach 1987 4 PARCOMP Frederickson & Hiromoto & Larson, A Parallel Monte Carlo Transport Algorithm Using a Pseudo-Random Tree to Guarantee Reproducibility 1987 4 PARCOMP Srikant & Shankar, A New Parallel Algorithm for Parsing Arithmetic Infix Expressions 1987 4 PARCOMP Suros & Montagne, Optimizing Systolic Networks by Fitting Diagonals 1987 4 PARCOMP Faber & Lubeck & White, Comments on the Paper ``Parallel Efficiency Can Be Greater than Unity'' (Short Communication) 1987 4 PARCOMP Janssen, A Note on Superlinear Speedup (Short Communication) 1987 4 PARCOMP Umeo & Nakatsuka, A Design of Pipeline-Interval-Optimum Systolic Stack (Short Communication) 1987 4 PARCOMP Bekakos & Evans, A `Rotating' and `Folding' Algorithm Using a Two-Dimensional `Systolic' Communication Geometry (Short Communication) 1986 PARCOMP Katona, A Lattice Model for Cellular (Systolic) Algorithms 1994 6 PARLE Ferreira & Grammatikakis, Improved Probabilistic Routing on Generalized Hypercubes 1994 6 PARLE Liu & Hsu, Efficient Data Communication in Incomplete Hypercubes 1994 6 PARLE Ohring & Das, Efficient Communication in the Folded Petersen Interconnection Networks 1994 6 PARLE Hopkins, Voting on Synchronous Communications 1994 6 PARLE Benslimane, Protocol Validation: A Parallel Technique to Reduce the Reachability Tree 1994 6 PARLE Bampis & Konig & Trystram, Optimal Parallel Execution of Complete Binary Trees and Grids into Most Popular Interconnection Networks 1994 6 PARLE Olariu & Stojmenovic, Time-Optimal Nearest-Neighbor Computations on Enhanced Meshes 1994 6 PARLE Leppanen & Penttonen, Simulation of PRAM Models on Meshes 1994 6 PARLE Atallah & Fabri, On the Multisearching Problem for Hypercubes 1994 6 PARLE Dai, An Improvement in the Size-Depth Tradeoff for Strictly Non-Blocking Generalized-Concentration Networks 1994 6 PARLE Ishikawa, Bypass Strategy in Hypercube Multiprocessors by Adding Bus Connections 1994 6 PARLE Ertel, On the Definition of Speedup 1994 6 PARLE Wakatani & Wolfe, A New Approach to Array Redistribution: Strip Mining Redistribution 1994 6 PARLE Papadopoulos, A Dynamic Algorithm for Online Scheduling of Parallel Processes 1994 6 PARLE Gupta & Photiou, Load-Balanced Priority Queues on Distributed Memory Machines 1994 6 PARLE Roch & Villard, Parallel Computations with Algebraic Numbers -- A Case Study: Jordan Normal Form of Matrices 1994 6 PARLE Ferragina & Luccio, Batch Dynamic Algorithms for Two Graph Problems 1994 6 PARLE Schollmeyer & McMillin, A General Method for Maximizing the Error-Detecting Ability of Distributed Algorithms 1994 6 PARLE Lam, An Iterative Array Processor Architecture for Matrix Computation 1994 6 PARLE Johansson & Bengtsson, A New Parallel MIND Connected Component Labeling Algorithm 1994 6 PARLE Markatos & Chronaki, Using Reference Counters in Update-Based Coherent Memory 1994 6 PARLE Seo & Feng, A New Routing Scheme for Concatenating Two Omega Networks 1994 6 PARLE Ghose, OPTIMUL: A Hybrid Multiprocessor for Distributed and Shared Memory Multiprocessing with WDM Optical Fiber Interconnections 1993 5 PARLE Engelmann & Keller, Simulation-Based Comparison of Hash Functions for Emulated Shared Memory 1993 5 PARLE O'Donnell, Data Parallel Implementation of Extensible Sparse Functional Arrays 1993 5 PARLE Ohring & Das, Embeddings of Tree-Related Networks in Incomplete Hypercubes 1993 5 PARLE Cull & Larson, Static and Dynamic Performance of the Mobius Cubes 1993 5 PARLE Mou & Wang, Optimal Mappings of m Dimensional FFT Communication to k Dimensional Mesh for Arbitrary m and k 1993 5 PARLE Lin & McKinley & Esfahanian, Adaptive Multicast Wormhole Routing in 2D Mesh Multicomputers 1993 5 PARLE Kim & Chien, The Impact of Packetization in Wormhole-Routed Networks 1993 5 PARLE Liu & Duato & Thorelli, Grouping Virtual Channels for Deadlock-Free Adaptive Wormhole Routing 1993 5 PARLE Prasad, A Calculus of Value Broadcasts 1993 5 PARLE Coroyer & Liu, Effectiveness of Heuristics and Simulated Annealing for the Scheduling of Concurrent Tasks -- An Empirical Comparison 1993 5 PARLE Ecker & Hirschberg, Task Scheduling with Restricted Preemptions 1993 5 PARLE Min & Mutka, Effects of Job Size Irregularity on the Dynamic Resource Scheduling of a 2-D Mesh Multicomputer 1993 5 PARLE Norre, Static Allocation of Tasks on Multiprocessor Architectures with Interprocessor Communication Delays 1993 5 PARLE Bampis & El Haddad & Manoussakis & Santha, A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments 1993 5 PARLE Bhagavathi & Olariu & Shen & Wilson, A Unifying Look at Semigroup Computations on Meshes with Multiple Broadcasting 1993 5 PARLE Francis & Mathieson & Pannan, A Fast, Simple Algorithm to Balance a Parallel Multiway Merge 1993 5 PARLE Traff, Precis: Distributed Shortest Path Algorithms 1993 5 PARLE Heckler & Thiele, Parallel Complexity of Lattice Basis Reduction and a Floating-Point Parallel Algorithm 1991 PARLE Janicki & Koutny, Invariants and Paradigms of Concurrency Theory 1991 PARLE de la Torre & Kruskal, Towards a Single Model of Efficient Computation in Real Parallel Machines 1991 PARLE Piquer, Indirect Reference Counting: A Distributed Garbage Collection Algorithm 1991 PARLE Baumslag & Heydemann & Opatrny & Sotteau, Embeddings of Shuffle-Like Graphs in Hypercubes 1991 PARLE Ferianc & Sykora, Area Complexity of Multilective Merging 1991 PARLE Zhong & Rajopadhye, Deriving Fully Efficient Systolic Arrays by Quasi-Linear Allocation Functions 1991 PARLE Parberry, On the Computational Complexity of Optimal Sorting Network Verification 1991 PARLE Das & Horng, Managing a Parallel Heap Efficiently 1991 PARLE Alvarez & Balcazar & Gabarro & Santha, Parallel Complexity in the Design and Analysis of Concurrent Systems 1991 PARLE Hagerup & Schmitt & Seidl, FORK: A High-Level Language for PRAMs 1991 PARLE Duato, On the Design of Deadlock-Free Adaptive Routing Algorithms for Multicomputers: Design Methodologies 1989 1 PARLE Lester, An Efficient Distributed Garbage Collection Algorithm 1989 1 PARLE Queinnec & Beaudoing & Queille, Mark DURING Sweep Rather Than Mark THEN Sweep 1992 PATBOOL Dunne, Relationships Between Monotone and Non-Monotone Network Complexity 1992 PATBOOL Newman, On Read-Once Boolean Functions 1992 PATBOOL Beynon, Boolean Function Complexity: a Lattice-Theoretic Perspective 1992 PATBOOL Grigni & Sipser, Monotone Complexity 1992 PATBOOL Razborov, On Submodular Complexity Measures 1992 PATBOOL Valiant, Why is Boolean Complexity Theory so Difficult? 1992 PATBOOL Mirwald & Schnorr, The Multiplicative Complexity of Boolean Quadratic Forms, a Survey 1992 PATBOOL Barrington, Some Problems Involving Razborov-Smolensky Polynomials 1992 PATBOOL Wegener & Wurm & Yi, Symmetry Functions in AC^0 can be Computed in Constant Depth 1992 PATBOOL Ajtai, Boolean Complexity and Probabilistic Constructions 1992 PATBOOL Uhlig, Networks Computing Boolean Functions for Multiple Input Values 1992 PATBOOL Paterson & Pippenger & Zwick, Optimal Carry Save Networks 1997 30 PATREC Alquezar & Sanfeliu, Recognition and Learning of a Class of Context-Sensitive Languages Described by Augmented Regular Expressions 1996 29 PATREC Lee & Horng & Tsai & Tsai, Building a Quadtree and its Applications on a Reconfigurable Mesh 1996 29 PATREC Wong & Chan & Chiu, Pattern Detection in Biomolecules Using Synthesized Random Sequence 1996 29 PATREC Gregor & Thomason, Efficient Dynamic Programming Alignment of Cyclic Strings by Shift Elimination 1996 29 PATREC Roman-Roldan & Bernaola-Galvan & Oliver, Application of Information Theory to DNA-Sequence Analysis: A Review 1996 29 PATREC Seni & Kripasundar & Srihari, Generalizing Edit Distance to Incorporate Domain Information: Handwritten Text Recognition as a Case Study 1996 29 PATREC Diaz-de-Leon & Sossa-Azuela, On the Computation of the Euler Number of a Binary Object 1995 28 PATREC Ogniewicz & Kubler, Voronoi Tessellation of Points with Integer Coordinates: Time-Efficient Implementation and Online Edge-List Generation 1995 28 PATREC Tanimoto, Fast Median Filtering Algorithms for Mesh Computers 1995 28 PATREC Devroye & Lugosi, Lower Bounds in Pattern Recognition and Learning 1995 28 PATREC Tanaka, Theoretical Aspects of Syntactic Pattern Recognition 1995 28 PATREC Sabharwal & Bhatia, Perfect Hash Table Algorithm for Image Databases Using Negative Associated Values 1995 28 PATREC Cinque & Levialdi & Rosenfeld, Fast Pyramidal Algorithms for Image Thresholding 1995 28 PATREC Yuan & Suen, An Optimal O(n) Algorithm for Identifying Line Segments from a Sequence of Chain Codes 1995 28 PATREC Ogniewicz & Kubler, Hierarchic Voronoi Skeletons 1995 28 PATREC Zhang, Algorithms for the Constrained Editing Distance between Ordered Labeled Trees and Related Problems 1994 27 PATREC Bhatia & Sabharwal, A Fast Implementation of a Perfect Hash Function for Picture Objects 1994 27 PATREC Tsai, Geometric Hashing with Line Features 1993 26 PATREC Philips, A New Fast Algorithm for Momemt Computation 1993 26 PATREC Cho & Kurita, Comments on ``An Efficient Agglomerative Clustering Algorithm Using a Heap'' 1993 26 PATREC Chiu & Harauz, A Method for Inferring Probabilistic Consensus Structure with Applications to Molecular Sequence Data 1993 26 PATREC Kao & Horng & Wang & Chung, A Constant Time Algorithm for Computing Hough Transform 1992 25 PATREC Chung, A Randomized Parallel Algorithm for String Matching on Hypercube 1992 25 PATREC Choudhary & Ranka, Mesh and Pyramid Algorithms for Iconic Indexing 1992 25 PATREC Chaudhuri & Murthy & Chaudhuri, A Modified Metric to Compute Distance 1992 25 PATREC Shankar & Ranka, Hypercube Algorithms for Operations on Quadtrees 1992 25 PATREC Goldfarb, What Is Distance and Why Do We Need the Metric Model for Pattern Learning? 1992 25 PATREC Kooshesh & Moret, Three-Coloring the Vertices of a Triangulated Simple Polygon 1991 24 PATREC Dinstein & Landau & Guy, Parallel (PRAM EREW) Algorithms for Contour-based 2D Shape Recognition 1991 24 PATREC Selim & Alsultan, A Simulated Annealing Algorithm for the Clustering Problem 1991 24 PATREC Rao, On Similarity between Finite Sets in Plane 1991 24 PATREC Mitra & Murthy, Elastic, Maximal Matching 1991 24 PATREC Atallah & Ribeiro & Lifschitz, Computing Some Distance Functions between Polygons 1991 24 PATREC Mitra & Murthy, Elastic, Maximal Matching 1991 24 PATREC Atallah & Ribeiro & Lifschitz, Computing Some Distance Functions between Polygons 1991 24 PATREC Kuo & Cross, A Two-step String-matching Procedure 1991 24 PATREC Hecquard & Acharya, Connected Component Labeling with Linear Octree 1991 24 PATREC Kiryati & Eldar & Bruckstein, A Probabilistic Hough Transform 1991 24 PATREC Kurita, An Efficient Agglomerative Clustering Algorithm Using a Heap 1991 24 PATREC Likforman-Sulem & Maitre & Sirat, An Expert Vision System for Analysis of Hebrew Characters and Authentication of Manuscripts 1991 24 PATREC Toussaint, A Counter-example to a Convex Hull Algorithm for Polygons 1991 24 PATREC Barrero, Inference of Tree Grammars Using Negative Samples 1991 24 PATREC Barrero, Unranked Tree Languages 1991 24 PATREC Chitoor & Murty & Bhandaru, A New Data Structure HC-Expression for Learning from Examples 1991 24 PATREC Ranka & Heywood, Two-Dimensional Pattern Matching with k Mismatches 1990 23 PATREC Govindan & Shivaprasad, Character Recognition--A Review 1990 23 PATREC Kundu & Sridhar, An O(kn log N) Algorithm for Decomposing a Set of Polygons into D-Separable Components 1990 23 PATREC Pedrycz, Fuzzy Sets in Pattern Recognition: Methodology and Methods 1990 23 PATREC Raiha, Approximate Sequence Comparison: A Study with Histograms 1990 23 PATREC Broder, Strategies for Efficient Incremental Nearest Neighbor Search 1989 22 PATREC Sitaraman & Rosenfeld, Probabilistic Analysis of Two Stage Matching 1988 21 PATREC Wu & Rosenfeld, Parallel Processing of Encoded Bit Strings 1981 13 PATREC Tanimoto, A Method for Detecting Structure in Polygons 1991 20 PCIT Farago & Linder & Lugosi, Nearest Neighbor Search and Classification in O(1) Time 1991 20 PCIT Yang, Universal Almost Sure Data Compression for Abstract Alphabets and Arbitrary Fidelity Criterions 1990 19 PCIT Shields, Universal Almost Sure Data Compression Using Markov Types 1973 2 PCIT Gacs & Korner, Common Information is Far Less than Mutual Information 1996 15 PCMAG Schindler, Understanding the OS/2 CONFIG.SYS File: The first step toward optimizing your OS/2 system (May 14) 1994 13 PCMAG Proffit, Tuning Your DOS Applications Under OS/2 3.0 1994 13 PCMAG Prosise, How Secure Is Encrypted Data? 1994 13 PCMAG Ayre, Making the Internet Connection (10/11) 1994 13 PCMAG Stevenson, The Internet: Tools for Connecting (10/11) 1994 13 PCMAG Proffit, Tuning Windows Applications Under Personal OS/2 (9/27) 1993 12 PCMAG Christian, Making Exceptions With C++ 1993 12 PCMAG Petzold, Unicode, Wide Characters, and C 1993 12 PCMAG Boling, Understanding and Using Pointers in C 1993 12 PCMAG Petzold, Move Over, ASCII! Unicode Is Here 1993 12 PCMAG Salemi, Tuning DOS and WIN-OS/2 Sessions Under OS/2 2.x 1993 12 PCMAG Simon, How Lossy Compression Shrinks Image Files 1993 12 PCMAG Simon, Lossless Compression: How It Works 1993 12 PCMAG Barr, Caveat XA 1993 12 PCMAG Seymour, PC Sound: Eight Isn't Enough 1993 12 PCMAG Howard, Laptop Buyers' Checklist 1993 12 PCMAG Petzold, OS/2 Paths and Fonts: The Versatile Connection 1993 12 PCMAG Prosise, Understanding Data Compression 1993 12 PCMAG Vaughn-Nichols, The Internet: Access to Everywhere 1993 12 PCMAG Salemi, Demystifying CONFIG.SYS in OS/2 2.0, Part 1 1993 12 PCMAG Petzold, What Can We Do With OS/2 Bitmapped Fonts? 1993 12 PCMAG IBM, The OS/2 100 (advertisement and tips) 1992 11 PCMAG Rosch, Minicartridge Tape Backup 1992 11 PCMAG Nine Desktop Scanners That Do It All 1992 11 PCMAG Derfler, Maximum Modems: 14,400 bps and Rising 1991 10 PCMAG Mendelson, Scalable Fonts for the PC 1991 10 PCMAG Duncan, A Look at the Differences Between C and C++ 1991 10 PCMAG Munro, Using HPPCL to Get The Most from Your LaserJet Printer 1991 10 PCMAG Munro, LZSELECT: Laser Printer Control The Easy Way 1984 PCO Korte & Lovasz, Greedoids--A Structural Framework for the Greedy Algorithm 1994 1 PCRCW Karamcheti & Chien, Do Faster Routers Imply Faster Communication? 1994 1 PCRCW Chinn, The Performance of Adaptive Routers on Worst Case Permutations 1994 1 PCRCW Wills & Lacy & Cruz-Rivera, The Offset Cube: An Optoelectronic Interconnection Network 1994 1 PCRCW Nguyen & Pezaris & Pratt & Ward, Three-Dimensional Network Topologies 1994 1 PCRCW Panda & Singal & Prabhakaran, Multidestination Message Passing Mechanism Conforming to Base Wormhole Routing Scheme 1994 1 PCRCW Nesson & Johnsson, ROMM Routing: A Class of Efficient Minimal Routing Algorithms 1994 1 PCRCW Chong & Brewer & Leighton & Knight, Packaging and Multiplexing of Hierarchical Scalable Expanders 1994 1 PCRCW Eslick & DeHon & Knight, Guaranteeing Idempotence for Tightly-Coupled, Fault-Tolerant Networks 1989 PCREV Smith, Some Perspectives on the Early History of Computers (1970) 1989 PCREV Babbage, Of the Analytical Engine (1864) 1989 PCREV Aiken, Proposed Automatic Calculating Machine (1937) 1989 PCREV Burks & Goldstine & von Neumann, Preliminary Discussion of the Logical Design of an Electronic Computing Instrument (1946) 1989 PCREV Bush, As We May Think (1945) 1989 PCREV Mazlish, The Fourth Discontinuity (1967) 1989 PCREV Turing, Computing Machinery and Intelligence (1950) 1989 PCREV Newell & Simon, Computer Science as Empirical Inquiry: Symbols and Search (1976) 1989 PCREV Pylyshyn et al., What is Artificial Intelligence? (1980) 1989 PCREV Trakhtenbrot, Algorithms (1960) 1989 PCREV Pylyshyn, Computers, Knowledge, and the Human Mind (1987) 1989 PCREV Norman, The Trouble with UNIX (1981) 1989 PCREV Norman, Reflections on ``The Trouble with UNIX''--Postscript 1987 1989 PCREV Smith & Irby & Kimball & Verplank & Harslem, Designing the Star User Interface (1982) 1989 PCREV Carroll & Carrithers, Training wheels in a User Interface (1984); Carroll, Postscript: 1987 1989 PCREV Bannon, The Pioneering Work of Douglas C. Engelbart (1987) 1989 PCREV Ayres & Miller, Industrial Robots on the Line (1982) 1989 PCREV Miller, Robots on the Line Revisited--Postscript, 1988 1989 PCREV Howard, Utopia: Where Workers Craft New Technology (1985) 1989 PCREV Hammer & Sirbu, What is Office Automation? (1980) 1989 PCREV Levin & Kareev, Personal Computers and Education (1980, 1984); Levin, Postscript: September 1987 1989 PCREV Butler, The Destruction of Machines in Erewhon (1872) 1989 PCREV Ellul, The Technological Society (1954) 1989 PCREV Weizenbaum, On the Impact of the Computer on Society (1972) 1989 PCREV Simon, What Computers Mean for Man and Society (1977) 1989 PCREV Kling, Theoretical Perspectives in Social Analyses of Computerization (1988); Kling, Postscript 1988 1989 PCREV Rosenbrock, Engineers and the Work that People Do (1981) 1989 PCREV Cousins, The Computer and the Poet (1966) 1996 9 PCSFW Boyd, A Class of Flexible and Efficient Key Management Protocols 1996 9 PCSFW Malki & Reiter, A High-Throughput Secure Reliable Multicast Protocol 1996 9 PCSFW D'haeseleer, An Immunological Approach to Change Detection: Theoretical Results 1996 9 PCSFW Roscoe, Intensional Specification of Security Protocols 1996 9 PCSFW Millen & Ko, Narrowing Terminates for Encryption 1996 9 PCSFW Meadows, Language Generation and Verification in the NRL Protocol Analyzer 1996 9 PCSFW Brackin, A HOL Extension of GNY for Automatically Analyzing Cryptographic Protocols 1996 9 PCSFW Zaba, E-Commerce Payment Protocols: Requirements and Analysis 1996 9 PCSFW Peri & Wulf & Kienzle, A Logic of Composition for Information Flow Predicates 1996 9 PCSFW Zakinthinos & Lee, How and Why Feedback Composition Fails 1996 9 PCSFW Sinclair, Action Systems for Security Specification 1996 9 PCSFW Focardi, Comparing Two Information Flow Security Properties 1996 9 PCSFW Cuppens & Saurel, Specifying a Security Policy: A Case Study 1996 9 PCSFW Giuri & Iglio, A Formal Model for Role-Based Access Control with Constraints 1996 9 PCSFW Spalka, The Non-Primitiveness of the Simple-Security Property and its Non-Applicability to Relational Databases 1996 9 PCSFW Ryan, A Genealogy of Non-Interference 1996 9 PCSFW Lowe, Some New Attacks upon Security Protocols 1996 9 PCSFW Desmedt, Simmons' Protocol is Not Free of Subliminal Channels 1996 9 PCSFW McDermott & Goldschlag, Towards a Model of Storage Jamming 1992 5 PCSFW Campbell & Safavi-Naini & Pleasants, Partial Belief and Probabilistic Reasoning in the Analysis of Secure Protocols 1992 5 PCSFW Calvelli & Varadharajan, An Analysis of Some Delegation Protocols for Distributed Systems 1992 3 PCSRCS Rosch, Making Connections: The SCSI Upgrade 1992 3 PCSRCS Hill & Mace, Scan the Possibilities 1987 5 PCTECHJ Schwartz & Shostak, What Computers Cannot Do 1984 PCTECHJ Woteki & Freiden & Levy & Bestul & Stine, Introducing Modula-2: Modular Constructions 1984 PCTECHJ Woteki & Freiden & Levy & Bestul & Stine, Modular Implementations (comparative Modula-2 review) 1996 PCTP Nation & Saghi & Siegel, Properties of a Variety of Interconnection Networks for Large-scale Parallelism 1996 PCTP McMillin & Liu, Parallel Algorithm Fundamentals and Analysis 1996 PCTP McMillin & Tsai & Lutfiyya, Formal Methods to Generate and Understand Distributed Computing Systems 1996 14 PCWORLD Li-Ron, The No-Nonsense Guide to Internet Providers (July) 1996 PCWORLD Angus & Thornton, Do-It-Yourself CD-ROMs 19?? PERGAMON Hargittai (Ed.), Symmetry 2: Unifying Human Understanding 1991 PERGAMON Kampis, Self-Modifying Systems in Biology and Cognitive Science: A New Framework for Dynamics, Information and Complexity 1993 27 PERMATHHUNG Vizvari, An Application of an Optimal Behaviour of the Greedy Solution in Number Theory 1993 27 PERMATHHUNG Chatrand & Holley & Kubicki & Schultz, Greatest Common Divisors and Least Common Multiples of Graphs 1993 27 PERMATHHUNG Dassow & marcus & Paun, Iterative Reading of Numbers and ``Black-Holes'' 1993 26 PERMATHHUNG Freud, Paul Erdos -- A Personal Account 1993 26 PERMATHHUNG Bollobas & Scott, Judicious Partitions of Graphs 1990 21 PERMATHHUNG Ciesielski & Laver, A Game of D. Gale in Which One of the Players Has Limited Memory 1973 3 PERMATHHUNG Gacs, Hausdorff-Dimension and Probability Distributions 1988 23 PERSPEC Boyer & Moore, A computational Logic Handbook 1987 15 PERSPEC Karp, An Upper Bound on the Expected Cost of an Optimal Assignment 1987 15 PERSPEC Ozawa & Kajitani & Ueno, The Principal Partition of Vertex-Weighted Graphs and Its Applications 1987 15 PERSPEC Albertson, Generalized Colorings 1987 15 PERSPEC Asano & Asano, Voronoi Diagram for Points in a Simple Polygon 1987 15 PERSPEC Asano & Toussaint, Computing the Geodesic Center of a Simple Polygon 1987 15 PERSPEC Hutchinson & Miller, On Deleting Vertices to Make a Graph of Positive Genus Planar 1987 15 PERSPEC Suzuki & Nishizeki & Saito, Algorithms for Routing around a Rectangle (Extended Abstract) 1987 15 PERSPEC Machida, A Remark on the Complexity of the Knapsack Problem 1987 15 PERSPEC Pomerance, Fast, Rigorous Factorization and Discrete Logarithm Algorithms 1987 15 PERSPEC Yasuura & Takagi & Yajima, Redundant Coding for Local Computability 1987 15 PERSPEC Sado & Igarashi, Mesh-Connected Processor Array 1987 15 PERSPEC Ibaraki, Game Solving Procedure H* Is Unsurpassed 1987 15 PERSPEC Hopcroft, Algorithmic Problems in Modeling and Electronic Prototyping 1987 15 PERSPEC Iwama, Complementary Approaches to CNF Boolean Equations 1987 15 PERSPEC Adleman & McCurley, Open Problems in Number Theoretic Complexity (Preliminary Version) 1987 15 PERSPEC Fujiwara & Taniguchi & Kasami, Decision Problem of the Security for Cryptographic Protocols 1987 15 PERSPEC Goldwasser & Micali & Rivest, A Digital Signature Scheme Secure Against Adaptive Chosen Message Attack (Extended Abstract) 1987 15 PERSPEC Adachi & Kasai, Are Problems Having a Polynomial Time Upper Bound Actually Thought to Be Feasible? 1987 15 PERSPEC Kobayashi, On Probability that a Randomly Selected Set Has Some Complexity Theoretical Property 1987 15 PERSPEC Wilf & Yoshimura, Ranking Rooted Trees and a Graceful Application 1987 15 PERSPEC Chung & Graham & Saks, Dynamic Search in Graphs 1987 15 PERSPEC Inoue & Takanami & Hromkovic, A Leaf-Size Hierarchy of Two-Dimensional Alternating Turing Machines 1987 15 PERSPEC Iwata & Kasai, Simple Programs with a Fixed Number of Variables Seem Still Hard to Analyze 1987 15 PERSPEC Iri & Imai, Theory of the Multiplicative Penalty Function Method for Linear Programming 1987 15 PERSPEC Hare & Hedetniemi & Laskar & Peters & Wimer, Linear-Time Computability of Combinatorial Problems on Generalized Series-Parallel Graphs 1987 15 PERSPEC Karlin & Manasse & Rudolphe & Sleator, Competitive Snoopy Caching 1987 7 PERSPEC Abercrombie, Graphics Display of Foreign Scripts 1996 PETERS Petkovsek & Wilf & Zeilberger, A = B 1995 PETERS Goldberg & Halperin & Latombe & Wilson (Eds.), Algorithmic Foundations of Robotics 1995 PETERS Eck, The Most Complex Machine: A Survey of Computers and Computing 1994 PETERS Berlekamp & Wolfe, Mathematical Go: Chilling Gets the Last Point 1993 PETERS Peruggia, Discrete Iterated Function Systems 1993 PETRI Smith, Comparability Orders and Measurement 1992 PETRI Bernardinello & De Cindio, A Survey of Basic Net Models and Modular Net Classes 1992 PETRI Campos & Silva, Structural Techniques and Performance Bounds of Stochastic Petri Net Models 1992 PETRI Gastin & Petit, A Survey of Recognizable Languages with Infinite Traces 1992 PETRI Pomello & Rozenberg & Simone, A Survey of Equivalence Notions for Net Based Systems 1991 PETRI Carstensen, The Complexity of Testing the Equivalence of Transition Sequences 1991 PETRI Janicki & Koutny, Optimal Simulations, Nets and Reachability Graphs 1991 PETRI Plunnecke & Reisig, Bibliography on Petri Nets 1990 1990 PETRI Brauer & Gold & Vogler, A Survey of Behaviour and Equivalence Preserving Refinements of Petri Nets 1990 PETRI Butler & Esser & Mattmann, A Distributed Simulator for High Order Petri Nets 1990 PETRI Cardoso & Valette & Dubois, Petri Nets with Uncertain Markings 1990 PETRI Colom & Silva, Convex Geometry and Semiflows in P/T Nets. A Comparative Study of Algorithms for Computation of Minimal P-Semiflows 1990 PETRI Colom & Silva, Improving the Linearly Based Characterization of P/T Nets 1990 PETRI Couvreur & Martinez, Linear Invariants in Commutative High Level Nets 1990 PETRI Desel & Merceron, Vicinity Respecting Net Morphisms 1990 PETRI Dutheillet & Haddad, Regular Stochastic Petri Nets 1990 PETRI Esparza & Silva, Circuits, Handles, Bridges and Nets 1990 PETRI Esparza & Silva, On the Analysis and Synthesis of Free Choice Systems 1990 PETRI Florin & Kaiser & Natkin, Petri Net Modesl of a Distributed Election Protocol on a Unidirectional Ring 1990 PETRI Huber & Jensen & Shapiro, Hierarchies in Coloured Petri Nets 1990 PETRI Jensen, Coloured Petri Nets: A High Level Language for System Design and Analysis 1990 PETRI Nutt, A simulation System Architecture for Graph Models 1990 PETRI Pomello & Simone, A State Transformation Preorder over a Class of EN Systems 1990 PETRI Souissi & Memmi, Composition of Nets via a Communication Medium 1990 PETRI Stotts & Furuta, alphaTrellis: A System for Writing and Browsing Petri-Net-based Hypertext 1990 PETRI Valmari, Stubborn Sets for Reduced State Space Generation 1989 PETRI Marson, Stochastic Petri Nets: An Elementary Introduction 1989 PETRI Tuominen, Elementary Net Systems and Dynamic Logic 1988 PETRI Finkel & Rosier, A Survey on the Decidability Questions for Classes of FIFO Nets 1988 PETRI Haus & Rodriguez, Music Description and Processing by Petri Nets 1988 PETRI Howell & Rosier, On Questions of Fairness and Temporal Logic for Conflict-free Petri Nets 1988 PETRI Kiehn, Infinitary Partial Petri Net Languages and Their Relationship to Other Petri Net Semantics 1988 PETRI Lambert, Some Consequences of the Decidability of the Reachability Problem for Petri Nets 1987 PETRI Girault & Chatelain & Haddad, Specification and Properties of a Cache Coherence Protocol Model 1987 PETRI De Cindio & De Michelis & Simone, GAMERU: A Language for the Analysis and Design of Human Communication Pragmatics within Organizational Systems 1987 PETRI Howell & Rosier, Recent Results on the Complexity of Problems Related to Petri Nets 1987 PETRI Haddad & Girault, Algebraic Structure of Flows of a Regular Coloured Net 1987 PETRI Janicki & Koutny, On Equivalent Execution Semantics of Concurrent Systems 1987 PETRI Kruckeberg & Jaxy, Mathematical Methods for Calculating Invariants in Petri Nets 1987 PETRI Ajmone Marsan & Chiola, On Petri Nets with Deterministic and Exponentially Distributed Firing Times 1987 PETRI Ajmone Marsan & Chiola & Fumagalli, An Accurate Performance Model of CSMA/CD Bus LAN 1987 PETRI Meijer, Petri Net Models for the lambda-Calculus 1987 PETRI Merceron, Fair Processes 1987 PETRI Olderog, Operational Petri Net Semantics for CCSP 1987 PETRI Pelz, Infinitary Languages of Petri Nets and Logical Sentences 1987 PETRI Reisig, A Strong Part of Concurrency 1987 PETRI Petri & Smith, Concurrency and Continuity 1987 PETRI Vautherin, Parallel Systems Specifications with Coloured Petri Nets and Algebraic Specifications 1987 PETRI Drees & Gomm & Plunnecke & Reisig & Walter, Bibliography of Petri Nets 1986 PETRI Petri, Concurrency Theory 1986 PETRI Thiagarajan, Elementary Net Systems 1986 PETRI Rozenberg, Behaviour of Elementary Net Systems 1986 PETRI Fernandez, Non-sequential Processes 1986 PETRI Reisig, Place/Transition Systems 1986 PETRI Lautenbach, Linear Algebraic Techniques for Place/Transition Nets 1986 PETRI Best, Structure Theory of Petri Nets: The Free Choice Hiatus 1986 PETRI Genrich, Predicate/Transition Nets 1986 PETRI Jensen, Coloured Petri Nets 1986 PETRI Memmi & Vautherin, Analysing Nets by the Invariant Method 1986 PETRI Goltz, Synchronic Distance 1986 PETRI Berthelot, Transformations and Decompositions of Nets 1986 PETRI Valk, Infinite Behaviour and Fairness 1986 PETRI Jantzen, Language Theory of Petri Nets 1986 PETRI Jantzen, Complexity of Place/Transition Nets 1986 PETRI Roucairol, FIFO-Nets 1986 PETRI Pagnoni, Stochastic Nets and Performance Evaluation 1986 PETRI Mazurkiewicz, Trace Theory 1986 PETRI Winskel, Event Structures 1986 PETRI Nielsen, CCS and its Relationship to Net Theory 1986 PETRI Best, COSY: Its Relation to Nets and to CSP 1986 PETRI Olderog, TCSP: Theory of Communicating Sequential Processes 1986 PETRI Kluge, Reduction, Data Flow and Control Flow Models of Computation 1986 PETRI Petri, ``Forgotten Topics'' of Net Theory 1984 PETRI Carstensen & Valk, Infinite Behavior and Fairness in Petri Nets 1984 PETRI Valk & Jantzen, The Residue of Vector Sets with Applications to Decidability Problems in Petri Nets 1984 PETRI Jensen, The Design of a Program Package for an Introductory Petri Net Course 1984 PETRI Muller, The Reachability Problem for VAS 1984 PETRI Thiagarajan & Voss, In Praise of Free Choice Nets 1995 PHGENALGS Alander, An Indexed Bibliography of Genetic Algorithms 1991 PHMLOG Anellis, The First Russell Paradox 1991 PHMLOG Dawson, The Reception of Goedel's Incompleteness Theorems 1991 PHMLOG Wang, Goedel's and Some Other Examples of Problem Transmutation 1991 PHMLOG Ruitenburg, The Unintended Interpretations of Intuitionistic Logic 1991 PHMLOG Kleene, The Writing of Introduction to Metamathematics 1991 PHMLOG Siefkes, The Work of J. Richard Buchi 1983 7d PHYSICA Farmer & Ott & Yorke, The Dimension of Chaotic Attractors 1995 83 PIEEE Director & Khosla & Rohrer & Rutenbar, Reengineering the Curriculum: Design and Analysis of a New Undergraduate Electrical and Computer Engineering Degree at Carnegie Mellon University 1993 81 PIEEE Jacquin, Fractal Image Coding: A Review 1993 81 PIEEE Chua & Brown & Hamilton, Fractals in the Twist-and-Flip Circuit 1993 81 PIEEE Christie, A Fractal Analysis of Interconnection Complexity 1993 81 PIEEE Willems, review of Cover & Thomas, Elements of Information Theory (Wiley, 1991) 1993 81 PIEEE Combettes, The Foundations of Set Theoretic Estimation 1993 81 PIEEE Robert, review of Rawlings, Compared to What? An Introduction to the Analysis of Algorithms 1988 76 PIEEE Massey, An Introduction to Contemporary Cryptography 1988 76 PIEEE Smid & Branstad, The Data Encryption Standard: Past and Future 1988 76 PIEEE Diffie, The First Ten Years of Public-Key Cryptography 1988 76 PIEEE Brickell & Odlyzko, Cryptanalysis: A Survey of Recent Results 1988 76 PIEEE Moore, Protocol Failures in Cryptosystems 1988 76 PIEEE Simmons, A Survey of Information Authentication 1988 76 PIEEE Simmons, How to Insure that Data Acquired to Verify Treaty Compliance are Trustworthy 1979 67 PIEEE Diffie & Hellman, Privacy and Authentication: An Introduction to Cryptography 1968 PIEEE Rader, Discrete Fourier Transforms When the Number of Data Samples Is Prime 1994 29 PINFTRANS Fedorenko, Decoding Complexity of Linear Block Codes 1994 29 PINFTRANS Polesski, Lower Bounds on Full Rank Probability in Random Matroids 1994 29 PINFTRANS Zyablov & Sidorenko, Bounds on Complexity of Trellis Decoding of Linear Block Codes 1993 29 PINFTRANS Zinoviev & Katsman, Universal Code Families 1993 29 PINFTRANS Dodunekov & Encheva & Ivanov, New Bounds for the Minimum Length of Binary Linear Block Codes 1993 28 PINFTRANS Tsybakov & Privalov, Lower Bound on Delay in an RMA System with N-Conflicts and Errors 1993 28 PINFTRANS Ryabko, A Universal Search Scheme for a Single Significant Factor in a Disjunctive Model 1992 27 PINFTRANS Bassalygo & Gel'fand & Pinsker, Simple Methods for Deriving Lower Bounds in the Theory of Codes 1992 27 PINFTRANS Blinovskii, Lower Bound on Error Probability in Fixed-Volume List Decoding 1992 27 PINFTRANS Dodunekov & Zinov'ev & Erikson, Concatenation Method for Construction of Spherical Codes in n-Dimensional Euclidean Space 1992 27 PINFTRANS Zyablov & Portnoi, Fast Maximum-Likelihood Decoding of Reed-Muller Codes 1992 27 PINFTRANS Kovalev, Decoding of Low-Density Codes 1991 27 PINFTRANS Kel'bert & Mazel', Fast Computation of Multidimensional DFT 1991 26 PINFTRANS Ryabko, Fast Adaptive Coding Algorithm 1990 26 PINFTRANS Polesskii, Bounds on Probability of Group Connectedness of a Random Graph 1990 25 PINFTRANS Zinov'ev & Litsyn & Portnoi, Concatenated Codes in Euclidean Space 1990 25 PINFTRANS Kruk, Decoding Complexity Bound for Linear Block Codes 1988 24 PINFTRANS Kabatyanskii & Panchenko, Unit Sphere Packings and Coverings of the Hamming Space 1988 24 PINFTRANS Panchenko, Packings and Coverings over an Arbitrary Alphabet 1988 24 PINFTRANS Rykov & D'yachkov, On a Model of Associative Memory 1988 24 PINFTRANS , Obituary: Andrei Nikolaevich Kolmogorov 1988 24 PINFTRANS Margulis, Explicit Group-Theoretical Constructions of Combinatorial Schemes and Their Application to the Design of Expanders and Concentrators 1988 23 PINFTRANS Tsybakov & Likhanov, Upper Bound on the Capacity of a Random Multiple-Access System 1988 23 PINFTRANS Polesskii, Obstacles to Partitioning a Graph into Trees 1987 23 PINFTRANS Sagalovich & Shalyto, Binary Programs and Their Realization by Asynchronous Automata 1987 23 PINFTRANS Tsybakov & Bakirov & Zhukov & Kalashnikov & Martynov & Sokolov, A Multiaccess Stack Algorithm for an Asynchronous System 1986 22 PINFTRANS Ryabko, Noiseless Coding of Combinatorial Sources, Hausdorff Dimension, and Kolmogorov Complexity 1986 22 PINFTRANS Beznikova & Ryabko, Analysis of the Language of Ants by Information-Theoretical Methods 1984 19 PINFTRANS Andzhan, Capabilities of Automata upon Traversing a Plane 1980 15 PINFTRANS Freivald, Language Recognition Using Finite Probabilistic Multitape and Multihead Automata 1978 14 PINFTRANS Gacs & Kurdyumov & Levin, One-Dimensional Uniform Arrays that Wash out Finite Islands 1976 12 PINFTRANS Toom, Monotonic Binary Cellular Automata 1974 10 PINFTRANS Toom, Nonergodic Multidimensional Systems of Automata 1975 9 PINFTRANS Bassalygo & Pinsker, Complexity of an Optimum Nonblocking Switching Network without Reconnections 1973 9 PINFTRANS Levin, Universal Sequential Search Problems 1969 5 PINFTRANS Kolmogorov, On the Logical Foundations of Information Theory and Probability Theory 1965 1 PINFTRANS Kolmogorov, Three Approaches to the Quantitative Definition of Information 1989 PITMAN Cottrell, A Connectionist Approach to Word Sense Disambiguation 1989 PITMAN Algorithmic Skeletons: Structured Management of Parallel Computation 1988 PITMAN Stoughton, Fully Abstract Models of Programming Languages 1987 PITMAN Parberry, Parallel Complexity Theory 1986 PITMAN Hong, Computation: Computability, Similarity and Duality 1983 PITMAN Bogart, Introductory Combinatorics 1981 PITMAN Salomaa, Jewels of Formal Language Theory 1952 3 PLMS Higman, Ordering by Divisibility in Abstract Algebras 1992 PLENUM Potter, Associative Computing: A Programming Paradigm for Massively Parallel Computers 1990 PLENUM Smith, Graduate Research: A Guide for Students in the Sciences, Second Edition 1988 PLENUM Feder, Fractals 1986 PLENUM Pin, Varieties of Formal Languages 1984 PLENUM Preston & Duff, Modern Cellular Automata: Theory and Applications 1996 15 PODC Satyanarayanan, Fundamental Challenges in Mobile Computing 1996 15 PODC Tygar, Atomicity in Electronic Commerce 1996 15 PODC Dolev & Gouda & Schneider, Memory Requirements for Silent Stabilization (Extended Abstract) 1996 15 PODC Costello & Varghese, Self-Stabilization by Window Washing 1996 15 PODC Ghosh & Gupta & Herman & Pemmaraju, Fault-Containing Self-Stabilizing Algorithms 1996 15 PODC Alvisi & Marzullo, Trade-Offs in Implementing Causal Message Logging Protocols 1996 15 PODC Keidar & Dolev, Efficient Message Ordering in Dynamic Networks 1996 15 PODC Rhee & Lee, An Efficient Recovery-Based Spin Lock Protocol for Preemptive Shared-Memory Multiprocessors (Extended Abstract) 1996 15 PODC Attie & Emerson, Synthesis of Concurrent Systems for an Atomic Read / Atomic Write Model of Computation (Extended Abstract) 1996 15 PODC Gavoille & Perennes, Memory Requirement for Routing in Distributed Networks (Extended Abstract) 1996 15 PODC Buhrman & Hoepman & Vitanyi, Optimal Routing Tables 1996 15 PODC Aspnes & Hurwood, Spreading Rumors Rapidly Despite an Adversary 1996 15 PODC Joung, On Strong-Feasibilities of Equivalence-Completions 1996 15 PODC Chandra, Polylog Randomized Wait-Free Consensus 1996 15 PODC Haldar & Vidyasankar, Space-Efficient Construction of Buffer-Optimal 1-Writer 1-Reader Multivalued Atomic Variable 1996 15 PODC Kushilevitz & Mansour, Randomness in Private Computations 1996 15 PODC Bellare & Garay & Rabin, Distributed Pseudo-Random Bit Generators -- A New Way to Speed-Up Shared Coin Tossing 1996 15 PODC Zamsky, A Randomized Byzantine Agreement Protocol with Constant Expected Time and Guaranteed Termination in Optimal (Deterministic) Time 1996 15 PODC Afek & Merritt & Taubenfeld, The Power of Multi-Objects (Extended Abstract) 1996 15 PODC Attiya & Dagan, Universal Operations: Unary versus Binary (Extended Abstract) 1996 15 PODC Jayanti & Tan & Toueg, Time and Space Lower Bounds for Non-Blocking Implementations (Preliminary Version) 1996 15 PODC Michael & Scott, Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms 1996 15 PODC Lynch & Shavit & Shvartsman & Touitou, Counting Networks are Practically Linearizable 1996 15 PODC Peleg & Wool, How to be an Efficient Snoop, or the Probe Complexity of Quorum Systems (Extended Abstract) 1996 15 PODC Fekete & Gupta & Luchangco & Lynch & Shvartsman, Eventually-Serializable Data Services 1996 15 PODC Chandra & Hadzilacos & Toueg & Charron-Bost, On the Impossibility of Group Membership 1996 15 PODC Neiger, A New Look at Membership Services (Extended Abstract) 1996 15 PODC Dwork & Ho & Strong, Collective Consistency, Work in Progress 1996 15 PODC Ricciardi, Impossibility of (Repeated) Reliable Broadcast 1996 15 PODC Dolev & Malki & Strong, A Framework for Partionable Membership Service 1995 14 PODC Turner, Issues in Distributed Control for ATM Networks 1995 14 PODC Patterson, A Case for NOW (Networks of Workstations) 1995 14 PODC Kutten & Peleg, Universal Fault-Local Mending 1995 14 PODC Thurimella, Sub-linear Distributed Algorithms for Sparse Certificates and Biconnected Components 1995 14 PODC Ostrovsky & Wilkerson, Faster Computation on Directed Networks of Automata 1995 14 PODC Neiger, Failure Detectors and the Wait-free Hierarchy 1995 14 PODC Lo, More on t-resilience vs. Wait-freedom 1995 14 PODC Peleg & Wool, Crumbling Walls: A Class of Practical and Efficient Quorum Systems 1995 14 PODC Fetzer & Cristian, Optimal Convergence Function Based Clock Synchronization 1995 14 PODC Fagin & Halpern & Moses & Vardi, Knowledge-based Programs 1995 14 PODC Pogosyants & Segala, Formal Verification of Timed Properties for Randomized Distributed Algorithms 1995 14 PODC Valois, Lock-free Linked Lists Using Compare-and-Swap 1995 14 PODC Fraigniaud & Gavoille, Memory Requirement for Universal Routing Schemes 1995 14 PODC Faloutsos & Molle, Optimal Distributed Algorithm for Minimum Spanning Trees Revisited 1995 14 PODC Kutten & Peleg, Fast Distributed Construction of k-dominating Sets and Applications 1993 12 PODC Owicki, A Perspective on AN2: Local Area Network as Distributed System 1993 12 PODC Lazowska, Recent Trends in Experimental Operating Systems Research 1993 12 PODC Snir, Issues and Directions in Scalable Parallel Computing 1993 12 PODC Attiya & Rachman, Atomic Snapshots in O(n log n) Operations 1993 12 PODC Borowsky & Gafni, Immediate Atomic Snapshots and Fast Renaming 1993 12 PODC Dwork & Herlihy & Waarts, Bounded Round Numbers 1993 12 PODC Kushilevitz & Mansour, An Omega(D log (N/D)) Lower Bound for Broadcast in Radio Networks 1993 12 PODC Bar-Noy & Raghavan & Schieber & Tamaki, Fast Deflection Routing for Packets and Worms 1993 12 PODC Juurlink & Wijshoff, Experiences with a Model for Parallel Computation 1993 12 PODC Dolev & Welch, Wait-Free Clock Synchronization 1993 12 PODC Attiya & Herzberg & Rajsbaum, Optimal Clock Synchronization under Different Delay Assumptions 1993 12 PODC Chaudhuri & Gawlick & Lynch, Designing Algorithms for Distributed Systems with Partially Synchronized Clocks 1993 12 PODC Kleinberg & Mullainathan, Resource Bounds and Combinations of Consensus Objects 1993 12 PODC Jayanti, On the Robustness of Herlihy's Hierarchy 1993 12 PODC Afek & Weisberger & Weisman, A Completeness Theorem for a Class of Synchronization Objects 1993 12 PODC Yang & Anderson, Fast, Scalable Synchronization with Minimal Hardware Support 1993 12 PODC Choy & Singh, Adaptive Solutions to the Mutual Exclusion Problem 1993 12 PODC Gopal & Perry, Unifying Self-Stabilization and Fault-Tolerance 1993 12 PODC Krawczyk, Distributed Fingerprints and Secure Information Dispersal 1993 12 PODC Abdel-Ghaffar & El Abbadi, Efficient Detection of Corrupted Pages in a Replicated File 1993 12 PODC Friedman, Implementing Hybrid Consistency with High-Level Synchronization Operations 1993 12 PODC Fich & Herlihy & Shavit, On the Space Complexity of Randomized Synchronization 1993 12 PODC Moran & Taubenfeld, A Lower Bound on Wait-Free Counting 1993 12 PODC Moses & Kislev, Knowledge-Oriented Programming 1992 11 PODC Cohen & Segall, Distributed Priority Algorithms Under One-Bit-Delay Constraint 1992 11 PODC Herzberg, Connection-Based Communcation in Dynamic Networks 1992 11 PODC Cypher & Gravano, Requirements for Deadlock-Free, Adaptive Packet Routing 1992 11 PODC Afek & Gafni & Rosen, The Slide Mechanism with Applications in Dynamic Networks 1992 11 PODC Afek & Greenberg & Merritt & Taubenfeld, Computing with Faulty Shared Memory 1992 11 PODC Taubenfeld & Moran & Yadin, Concurrent Counting 1992 11 PODC Israeli & Shaham, Optimal Multi-Writer Multi-Reader Atomic Register 1992 11 PODC Upfal, Tolerating Linear Number of Faults in Networks of Bounded Degree 1992 11 PODC Dwork & Halpern & Waarts, Performing Work Efficiently in the Presence of Faults 1992 11 PODC Goldreich & Sneh, On the Complexity of Global Computation in the Presence of Link Failures: The Case of Uni-Directional Faults 1992 11 PODC Lin & Simon, Observing Self-Stabilization 1992 11 PODC Alemany & Felten, Performance Issues in Non-blocking Synchronization on Shared-Memory Multiprocessors 1992 11 PODC Shapiro & Dickman & Plainfosse, Robust Distributed References and Acyclic Garbage Collection 1992 11 PODC Chandra & Hadzilacos & Toueg, The Weakest Failure Detector for Solving Consensus 1992 11 PODC Styer, Improving Fast Mutual Exclusion 1992 11 PODC Awerbuch & Berger & Cowen & Peleg, Fast Network Decomposition 1992 11 PODC Singh, Leader Election in Complete Networks 1992 11 PODC Rhee & Welch, The Impact of Time on the Session Problem 1992 11 PODC Bazzi & Neiger, The Possibility and the Complexity of Achieving Fault-Tolerant Coordination 1992 11 PODC Janssen & Zwiers, From Sequential Layers to Distributed Processes: Deriving a Distributed Minimum Weight Spanning Tree Algorithm 1992 11 PODC Klarlund, Progress Measures and Stack Assertions for Fair Termination 1992 11 PODC Varghese & Lynch, A Tradeoff Between Safety and Liveness for Randomized Coordinated Attack Protocols 1992 11 PODC Panconesi & Srinivasan, Fast Randomized Algorithms for Distributed Edge Coloring 1992 11 PODC Saias, Proving Probabilistic Correctness Statements: The Case of Rabin's Algorithm for Mutual Exclusion 1992 11 PODC Kushilevitz & Rabin, Randomized Mutual Exclusion Algorithms Revisited 1992 11 PODC Merritt & Taubenfeld, Errata: Knowledge in Shared Memory Systems (PODC 1991) 1991 10 PODC Liskov, Practical Uses of Synchronized Clocks in Distributed Systems 1991 10 PODC Herlihy, Randomized Wait-Free Concurrent Objects (Extended Abstract) 1991 10 PODC Kanellakis & Shvartsman, Efficient Parallel Algorithms on Restartable Fail-stop Processors 1991 10 PODC Chor & Nelson, Resiliency of Interactive Distributed Tasks (Extended Abstract) 1991 10 PODC Ostrovsky & Yung, How to Withstand Mobile Virus Attacks (Extended Abstract) 1991 10 PODC Papadimitriou & Yannakakis, On the Value of Information in Distributed Decision-Making (Extended Abstract) 1991 10 PODC Saks & Zaharoglou, Optimal Space Distributed Move-To-Front Lists 1991 10 PODC Papadimitriou & Sideri, Optimal Coteries 1991 10 PODC Gilon & Peleg, Compact Deterministic Distributed Dictionaries (Extended Abstract) 1991 10 PODC Levy & Korth & Silberschatz, A Theory of Relaxed Atomicity (Extended Abstract) 1991 10 PODC Wang & Zuck, Real-Time Sequence Transmission Problem 1991 10 PODC Ponzio, Consensus in the Presence of Timing Uncertainty: Omission and Byzantine Failures (Extended Abstract) 1991 10 PODC Alur & Feder & Henzinger, The Benefits of Relaxing Punctuality 1991 10 PODC Awerbuch & Cidon & Kutten & Mansour & Peleg, Broadcast with Partial Knowledge (Preliminary Version) 1991 10 PODC Mansour & Patt-Shamir, Greedy Packet Scheduling on Shortest Paths (Preliminary Version) 1991 10 PODC Awerbuch & Kutten & Peleg, Efficient Deadlock-Free Routing 1991 10 PODC Merritt & Taubenfeld, Knowlege in Shared Memory Systems (Preliminary Version) 1991 10 PODC Abadi & Tuttle, A Semantics for a Logic Authentication (Extended Abstract) 1991 10 PODC Sanders, A Predicate Transformer Approach to Knowledge and Knowledge-based Protocols (Extended Abstract) 1991 10 PODC Meldal & Sankar & Vera, Exploiting Locality in Maintaining Potential Causality 1991 10 PODC Gaifman & Maher & Shapiro, Replay, Recovery, Replication, and Snapshots of Nondeterministic Concurrent Programs 1991 10 PODC Gopal & Toueg, Inconsistency and Contamination (Preliminary Version) 1991 10 PODC Tetali & Winkler, On a Random Walk Problem Arising in Self-Stabilizing Token Management 1991 10 PODC Dolev & Israeli & Moran, Resource Bounds for Self-Stabilizing Message Driven Protocols (Extended Abstract) 1991 10 PODC Afek & Gafni, Bootstrap Network Resynchronization (Extended Abstract) 1991 10 PODC Hadzilacos & Halpern, Message-Optimal Protocols for Byzantine Agreement (Extended Abstract) 1991 10 PODC Chandra & Toueg, Unreliable Failure Detectors for Asynchronous Systems (Preliminary Version) 1991 10 PODC Ricciardi & Birman, Using Process Groups to Implement Failure Detection in Asynchronous Environments 1990 9 PODC Afek & Attiya & Dolev & Gafni & Merritt & Shavit, Atomic Snapshots of Shared Memory 1990 9 PODC Anderson, Composite Registers 1990 9 PODC Critchlow & Taylor, The Inhibition Spectrum and the Achievement of Causal Consistency 1990 9 PODC Ladin & Liskov & Shrira, Lazy Replication: Exploiting the Semantics of Distributed Services 1990 9 PODC Kleinman & Moses & Shapiro, Distributed Variable Server for Atomic Unification 1990 9 PODC Jefferson, Virtual Time II: Storage Management in Conservative and Optimistic Systems 1990 9 PODC Katz & Perry, Self-Stabilizing Extensions for Message-Passing Systems 1990 9 PODC Dolev & Israeli & Moran, Self-Stabilization of Dynamic Systems Assuming Only Read/Write Atomicity 1990 9 PODC Israeli & Jalfon, Token Management Schemes and Random Walks Yield Self-Stabilizing Mutual Exclusion 1990 9 PODC Schmuck & Cristian, Continuous Clock Amortization Need Not Affect the Precision of a Clock Synchronization Algorithm 1990 9 PODC Awerbuch & Cidon & Gopal & Kaplan & Kutten, Distributed Control for PARIS 1990 9 PODC Ofek & Yung, Principles for High Speed Network Control: Congestion- and Deadlock-Freeness, Self-Routing, and a Single Buffer per Link 1990 9 PODC Awerbuch & Baratz & Peleg, Cost-Sensitive Analysis of Communication Protocols 1990 9 PODC Awerbuch & Goldreich & Herzberg, A Quantitative Approach to Dynamic Networks 1990 9 PODC Tempero & Ladner, Tight Bounds for Weakly Bounded Protocols 1990 9 PODC Orlitsky, Two Messages are Almost Optimal for Conveying Information 1990 9 PODC Emerson & Srinivasan, A Decidable Temporal Logic to Reason About Many Processes 1990 9 PODC Rao, Reasoning about Probabilistic Algorithms 1990 9 PODC Lynch & Attiya, Using Mappings to Prove Timing Properties 1990 9 PODC Henzinger, Half-Order Modal Logic: How to Prove Real-Time Properties 1990 9 PODC Gopal & Strong & Toueg & Cristian, Early-Delivery Atomic Broadcast 1990 9 PODC Chaudhuri, Agreement is Harder than Consensus: Set Consensus Problems in Totally Asynchronous Systems 1990 9 PODC Aspnes, Time- and Space-Efficient Randomized Consensus 1990 9 PODC Halpern & Moses & Waarts, A Characterization of Eventual Byzantine Agreement 1990 9 PODC Herlihy & Tuttle, Lower Bounds for Wait-Free Computation in Message-Passing Systems 1990 9 PODC Attiya & Bar-Noy & Dolev, Sharing Memory Robustly in Message-Passing Systems 1990 9 PODC Manna & Pnueli, A Hierarchy of Temporal Properties 1990 9 PODC Moses & Roth, Erratum on the paper: On Reliable Message Diffusion, Eighth PODC (1989) 1989 8 PODC Lynch, A Hundred Impossibility Proofs for Distributed Computing 1989 8 PODC Misra, Equational Reasoning About Nondeterministic Processes 1989 8 PODC Peng & Purushothaman, Towards Dataflow Analysis of Communicating Finite State Machines 1989 8 PODC Mansour & Schieber, The Intractability of Bounded Protocols for non-FIFO Channels 1989 8 PODC Wang & Zuck, Tight Bounds for the Sequence Transmission Problem 1989 8 PODC Goldreich & Herzberg & Mansour, Source to Destination Communication in the Presence of Faults 1989 8 PODC Halpern & Tuttle, Knowledge, Probability, and Adversaries 1989 8 PODC Moses & Roth, On Reliable Message Diffusion 1989 8 PODC Michel, A Categorical Approach to Distributed Systems Expressibility and Knowledge 1989 8 PODC Burns & Peterson, The Ambiguity of Choosing 1989 8 PODC Plotkin, Sticky Bits and Universality of Consensus 1989 8 PODC Styer & Peterson, Tight Bounds for Shared Memory Symmetric Mutual Exclusion Problems 1989 8 PODC Agrawal & El Abbadi, Efficient Solution to the Distributed Mutual Exclusion Problem 1989 8 PODC Bar-Ilan & Beaver, Non-Cryptographic Fault-Tolerant Computing in a Constant Number of Rounds of Interaction 1989 8 PODC Kanellakis & Shvartsman, Efficient Parallel Algorithms Can Be Made Robust 1989 8 PODC Sistla & Welch, Efficient Distributed Recovery Using Message Logging 1989 8 PODC Kurshan & McMillan, A Structural Induction Theorem for Processes 1989 8 PODC Jutla & Knapp & Rao, A Predicate Transformer Approach to Semantics of Parallel Programs 1989 8 PODC Zwiers & de Roever, Predicates are Predicate Transformers: A Unified Compositional Theory for Concurrency 1989 8 PODC Attiya & Dolev & Shavit, Bounded Polynomial Randomized Consensus 1989 8 PODC Coan & Welch, Modular Construction of Nearly Optimal Byzantine Agreement Protocols 1989 8 PODC Bar-Noy & Dolev, Shared-Memory vs. Message-Passing in an Asynchronous Distributed Environment 1989 8 PODC Schieber & Snir, Calling Names on Nameless Networks 1989 8 PODC Bar-Yehuda & Israeli & Itai, Multiple Communication in Multi-Hop Radio Networks 1989 8 PODC Herzberg & Kutten, Fast Isolation of Arbitrary Forwarding Faults 1988 7 PODC Gray, The Cost of Messages 1988 7 PODC Oki & Liskov, Viewstamped Replication: A General Primary Copy Method to Support Highly-Available Distributed Systems 1988 7 PODC Griefer & Strong, Fault Tolerant Distributed Services 1988 7 PODC Welch & Lamport & Lynch, A Lattice-Structured Proof of a Minimum Spanning Tree Algorithm 1988 7 PODC Chou & Gafni, Understanding and Verifying Distributed Algorithms Using Stratified Decomposition 1988 7 PODC Bar-Noy & Naor & Naor, One Bit Algorithms 1988 7 PODC Cidon & Gopal & Kutten, New Models and Algorithms for Future Networks 1988 7 PODC Afek & Landau & Schieber & Yung, The Power of Multimedia: Combining Point-to-Point and Multi-access Networks 1988 7 PODC Styer & Peterson, Improved Algorithms for Distributed Resource Allocation 1988 7 PODC Yamashita & Kameda, Computing on an Anonymous Network 1988 7 PODC Gafni & Afek, End-to-End Communication in Unreliable Networks 1988 7 PODC Lynch & Mansour & Fekete, Data Link Layer: Two Impossibility Results 1988 7 PODC Johnson & Zwaenepoel, Recovery in Distributed Systems Using Asynchronous Message Logging and Checkpointing 1988 7 PODC Huang & Teng, Secure and Verifiable Schemes for Election and General Distributed Computing Problems 1988 7 PODC Panangaden & Taylor, Concurrent Common Knowledge: A New Definition of Agreement for Asynchronous Systems 1988 7 PODC Saraswat & Kahn & Shapiro & Weinbaum, Detecting Stable Properties of Networks in Concurrent Logic Programming Languages 1988 7 PODC Ben-David, The Global Time Assumption and Semantics for Concurrent Systems 1988 7 PODC Nguyen & Strom, Process Semantics: Universal Axioms, Compositional Rules, and Applications 1988 7 PODC Neiger & Toueg, Automatically Increasing the Fault-Tolerance of Distributed Systems 1988 7 PODC Biran & Moran & Zaks, A Combinatorial Characterization of the Distributed Tasks Which are Solvable in the Presence of One Faulty Processor 1988 7 PODC Herlihy, Impossibility and Universality Results for Wait-Free Synchronization 1988 7 PODC Abrahamson, On Achieving Consensus Using a Shared Memory 1987 6 PODC Demers & Greene & Hauser & Irish & Larson & Shenker & Sturgis & Swinehart & Terry, Epidemic Algorithms for Replicated Database Maintenance 1987 6 PODC Kogan & Garcia-Molina, Update Propagation in Bakunin Data Networks 1987 6 PODC Goldman & Lynch, Quorum Consensus in Nested Transaction Systems 1987 6 PODC Bar-Noy & Dolev & Dwork & Strong, Shifting Gears: Changing Algorithms on the Fly to Expedite Byzantine Agreement 1987 6 PODC Bridgland & Watro, Fault-Tolerant Decision Making in Totally Asynchronous Distributed Systems 1987 6 PODC Fekete, Asynchronous Approximate Agreement 1987 6 PODC Peleg & Ullman, An Optimal Synchronizer for the Hypercube 1987 6 PODC Chor & Israeli & Li, On Processor Coordination Using Asynchronous Hardware 1987 6 PODC Bar-Yehuda & Goldreich & Itai, On the Time-Complexity of Broadcast in Radio Networks: An Exponential Gap Between Determinism and Randomization 1987 6 PODC Afek & Saks, Detecting Global Termination Conditions in the Face of Uncertainty 1987 6 PODC Helary & Jard & Plouzeau & Raynal, Detection of Stable Properties in Distributed Applications 1987 6 PODC Lynch & Tuttle, Hierarchical Correctness Proofs for Distributed Algorithms 1987 6 PODC Jonsson, Modular Verification of Asynchronous Networks 1987 6 PODC Herlihy & Wing, Specifying Graceful Degradation in Distributed Systems 1987 6 PODC Katz & Peled, Interleaving Set Temporal Logic 1987 6 PODC Koymans, Specifying Message Passing Systems Requires Extending Temporal Logic 1987 6 PODC Manna & Pnueli, A Hierarchy of Temporal Properties 1987 6 PODC Singh & Anderson & Gouda, The Elusive Atomic Register Revisited 1987 6 PODC Burns & Peterson, Constructing Multi-reader Atomic Values from Non-atomic Values 1987 6 PODC Newman-Wolfe, A Protocol for Wait-Free, Atomic, Multi-Reader Shared Variables 1987 6 PODC Bloom, Constructing Two-Writer Atomic Registers 1987 6 PODC Chor & Rabin, Achieving Independence in Logarithmic Number of Rounds 1987 6 PODC Halpern & Zuck, A Little Knowledge Goes a Long Way: Simple Knowledge-bases Derivations and Correctness Proofs for a Family of Protocols 1987 6 PODC Neiger & Toueg, Substituting for Real Time and Common Knowledge in Asynchronous Distributed Systems 1987 6 PODC Clarke & Grumberg, Avoiding the State Explosion Problem in Temporal Logic Model Checking Algorithms 1986 5 PODC Abrahamson & Adler & Higham & Kirkpatrick, Probabilistic Solitude Verification on a Ring 1986 5 PODC Afrati & Papadimitriou & Papageorgiou, The Synthesis of Communication Protocols 1986 5 PODC Barbara & Garcia-Molina & Spauster, Protocols for Dynamic Vote Reassignment 1986 5 PODC Chang & Simon, Continuous Routing and Batch Routing on the Hypercube 1986 5 PODC Clarke & Grumberg & Browne, Reasoning About Networks with Many Identical Finite-State Processes 1986 5 PODC Coan & Lundelius, Transaction Commit in a Realistic Fault Model 1986 5 PODC Coan, A Communication-Efficient Canonical Form for Fault-Tolerant Distributed Protocols 1986 5 PODC Cohen & Yung, Distributing the Power of a Government to Enhance the Privacy of Voters 1986 5 PODC Fekete, Asymptotically Optimal Algorithms for Approximate Agreement 1986 5 PODC Fowler, The Complexity of Using Forwarding Addresses for Decentralized Object Finding 1986 5 PODC Frederickson & Janardan, Optimal Message Routing Without Complete Routing Tables 1986 5 PODC Goldreich & Shrira, The Effects of Link Failures on Computations in Asynchronous Rings 1986 5 PODC Herlihy, Optimistic Concurrency Control for Abstract Data Types 1986 5 PODC Kaplan & Kaiser, Incremental Attribute Evaluation in Distributed Language-Based Environments 1986 5 PODC Katz & Taubenfeld, What Processes Know: Definitions and Proof Methods 1986 5 PODC Kruskal & Rudolph & Snir, Efficient Synchronization of Processors With Shared Memory 1986 5 PODC Li & Hudak, Memory Coherence in Shared Virtual Memory Systems 1986 5 PODC Liskov & Ladin, Highly-Available Distributed Services and Fault-Tolerant Distributed Garbage Collection 1986 5 PODC Lynch & Blaustein & Siegel, Correctness Conditions for Highly Available Replicated Databases 1986 5 PODC Mansour & Zaks, On the Bit Complexity of Distributed Computations in a Leader with a Ring 1986 5 PODC Moran & Warmuth, Gap Theorems for Distributed Computing 1986 5 PODC Oki & Coan & Kolodner, Limitations on Database Availability When Networks Partition 1986 5 PODC Peleg & Simons, On Fault Tolerant Routings in General Networks 1986 5 PODC Rabin, Randomization in Distributed and Parallel Systems 1986 5 PODC Shieber & Moran, Slowing Sequential Algorithms for Obtaining Fast Distributed and Parallel Algorithms: Maximum Matching 1985 4 PODC Chandy, Concurrent Programming for the Masses 1985 4 PODC Johnson & Schneider, Symmetry and Similarity in Distributed Systems 1985 4 PODC Kanellakis & Smolka, On the Analysis of Cooperation and Antagonism in Networks of Communicating Processes 1985 4 PODC Sistla, On Characterization of Safety and Liveness Properties in Temporal Logic 1985 4 PODC Johnson, A Model and Proof System for Asynchronous Networks 1985 4 PODC Fischer & Lynch & Merritt, Easy Impossibility Proofs for Distributed Consensus Problems 1985 4 PODC Srikanth & Toueg, Optimal Clock Synchronization 1985 4 PODC Toueg & Perry & Srikanth, Fast Distributed Agreement 1985 4 PODC Herlihy, Comparing How Atomicity Mechanisms Support Replication 1985 4 PODC Cheung & Kameda, Site-Optimal Termination Protocols for a Distributed Database Under Networking Partitioning 1985 4 PODC Weihl, Distributed Version Management for Read-Only Actions 1985 4 PODC Broder, A Provably Secure Polynomial Approximation Scheme for the Distributed Lottery Problem 1985 4 PODC Ben-Or, Fast Asynchronous Byzantine Agreement 1985 4 PODC Chor & Merritt & Shmoys, Simple Constant-Time Consensus Protocols in Realistic Failure Models 1985 4 PODC Korach & Kutten & Moran, A Modular Technique for the Design of Efficient Distributed Leader Finding Algorithms 1985 4 PODC Gafni, Improvements in the Time Complexity of Two Message-Optimal Election Algorithms 1985 4 PODC Afek & Gafni, Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks 1985 4 PODC Attiya & Snir & Warmuth, Computing on an Anonymous Ring 1985 4 PODC Chandy & Misra, How Processes Learn 1985 4 PODC Moses & Dolev & Halpern, Cheating Husbands and Other Stories: A Case Study of Knowledge, Action, and Communication 1985 4 PODC Halpern & Fagin, A Formal Model of Knowledge, Action, and Communication in Distributed Systems 1985 4 PODC Mahaney & Schneider, Inexact Agreement: Accuracy, Precision, and Graceful Degradation 1985 4 PODC Lantz & Edighoffer & Hitson, Towards a Universal Directory Service 1985 4 PODC Mullender & Vitanyi, Distributed Match-Making for Processes in Computer Networks 1985 4 PODC Awerbuch, Communication-Time Trade-offs in Network Synchronization 1985 4 PODC Korach & Moran & Zaks, The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors 1985 4 PODC Szymanski & Shi & Prywes, Terminating Iterative Solution of Simultaneous Equations in Distributed Message Passing Systems 1985 4 PODC Itai, Parallel Arithmetic with Concurrent Writes 1985 4 PODC Greenberg & Lobachevsky & Odlyzko, Simple, Efficient Asynchronous Parallel Algorithms for Maximization 1985 4 PODC Bar-Noy & Ben-Or & Dolev, Choice Coordination with Bounded Failure 1984 3 PODC Lamport, Solved Problems, Unsolved Problems and Non-Problems in Concurrency 1984 3 PODC Pnueli & Zuck, Verification of Multiprocess Probabilistic Protocols 1984 3 PODC Pinter & Wolper, A Temporal Logic for Reasoning about Partially Ordered Computations 1984 3 PODC Gouda & Chang, A Technique for Proving Liveness of Communicating Finite State Machines with Examples 1984 3 PODC Halpern & Moses, Knowledge and Common Knowledge in a Distributed Environment 1984 3 PODC Lehmann, Knowledge, Common Knowledge and Related Puzzles 1984 3 PODC Lamport & Melliar-Smith, Byzantine Clock Synchronization 1984 3 PODC Lundelius & Lynch, A New Fault-Tolerant Algorithm for Clock Synchronization 1984 3 PODC Halpern & Simons & Strong & Dolev, Fault-Tolerant Clock Synchronization 1984 3 PODC Dwork & Lynch & Stockmeyer, Consensus in the Presence of Partial Synchrony 1984 3 PODC Attiya & Dolev & Gill, Asynchronous Byzantine Consensus 1984 3 PODC Merritt, Elections in the Presence of Faults 1984 3 PODC Dwork & Skeen, Patterns of Communication in Consensus Protocols 1984 3 PODC Bracha, An Asynchronous floor((n-1)/3)-Resilient Consensus Protocol 1984 3 PODC Toueg, Randomized Byzantine Agreements 1984 3 PODC Fich & Ragde & Wigderson, Relations Between Concurrent-Write Models of Parallel Computation 1984 3 PODC Gafni & Afek, Election and Traversal in Unidirectional Networks 1984 3 PODC Korach & Moran & Zaks, Tight Lower and Upper Bounds for Some Distributed Algorithms for a Complete Network of Processors 1984 3 PODC Kepecs & Solomon, SODA: A Simplified Operating System for Distributed Applications 1984 3 PODC Cooper, Replicated Procedure Call 1984 3 PODC Wuu & Bernstein, Efficient Solutions to the Replicated Log and Dictionary Problems 1984 3 PODC Jefferson & Witkowski, An Approach to Performance Analysis of Timestamp-driven Synchronization Mechanisms 1984 3 PODC Grumberg & Francez & Katz, Fair Termination of Communicating Processes 1984 3 PODC Sistla, Distributed Algorithms for Ensuring Fair Interprocess Communications 1984 3 PODC Awerbuch & Even, Efficient and Reliable Broadcast is Achievable in an Eventually Connected Network 1984 3 PODC Mitchell & Merritt, A Distributed Algorithm for Deadlock Detection and Resolution 1984 3 PODC Bracha & Toueg, A Distributed Algorithm for Generalized Deadlock Detection 1983 2 PODC Dwork & Skeen, The Inherent Cost of Nonblocking Commitment 1983 2 PODC Bracha & Toueg, Resilient Consensus Protocols 1983 2 PODC Ben-Or, Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols 1983 2 PODC Allchin & McKendry, Synchronization and Recovery of Actions 1983 2 PODC Beeri & Bernstein & Goodman & Lai & Shasha, A Concurrency Control Theory for Nested Transactions 1983 2 PODC Weihl, Data-dependent Concurrency Control and Recovery 1983 2 PODC Mohan & Lindsay, Efficient Commit Protocols for the Tree of Processes Model of Distributed Transactions 1983 2 PODC Mohan & Strong & Finkelstein, Method for Distributed Transaction Commit and Recovery Using Byzantine Agreement Within Clusters of Processors 1983 2 PODC Daniels & Spector, An Algorithm for Replicated Directories 1983 2 PODC Bernstein & Goodman, The Failure and Recovery Problem for Replicated Databases 1983 2 PODC Moitra, Synthesis of Communicating Processes 1983 2 PODC Back & Kurki-Suonio, Decentralization of Process Nets with Centralized Control 1983 2 PODC Shrira & Francez & Rodeh, Distributed k-Selection: From a Sequential to a Distributed Algorithm 1983 2 PODC Frederickson, Tradeoffs for Selection in Distributed Networks 1983 2 PODC Dowd & Perl & Rudolph & Saks, The Balanced Sorting Network 1983 2 PODC Schwartz & Melliar-Smith & Vogt, An Interval Logic for Higher-Level Temporal Reasoning 1983 2 PODC Koymans & Vytopil & de Roever, Real-Time Programming and Asynchronous Message Passing 1983 2 PODC Lansky & Owicki, GEM: A Tool for Concurrency Specification and Verification 1983 2 PODC Francez & Hailpern, Script: A Communication Abstraction Mechanism 1983 2 PODC Kanellakis & Smolka, CCS Expressions, Finite State Processes, and Three Problems of Equivalence 1983 2 PODC Doeppner & Giacalone, A Formal Description of the UNIX Operating System 1983 2 PODC Coffman & Garey & Johnson & LaPaugh, Scheduling File Transfers in a Distributed Network 1983 2 PODC Tirri, Freedom from Deadlock of Locked Transactions in a Distributed Database 1983 2 PODC Hudak, Distributed Task and Memory Management 1983 2 PODC Misra, Detecting Termination of Distributed Computations Using Markers 1983 2 PODC Marzullo & Owicki, Maintaining the Time in a Distributed System 1982 1 PODC Ellis & Feldman & Heliotis, Language Constructs and Support for Distributed Computing 1982 1 PODC Gelernter & Bernstein, Distributed Communication via Global Buffer 1982 1 PODC Mehrotra & Pratt, Language Concepts for Distributed Processing of Large Arrays 1982 1 PODC Cohen & Lehmann, Dynamic Systems and their Distributed Termination 1982 1 PODC Leach & Stumpf & Hamilton & Levine, UIDS as Internal Names in a Distributed File System 1982 1 PODC Zave, Testing Incomplete Specifications of Distributed Systems 1982 1 PODC Jaffe, Distributed Multi-Destination Routing: The Constraints of Local Information 1982 1 PODC Upfal, Efficient Schemes for Parallel Communication 1982 1 PODC Aleliunas, Randomized Parallel Communication 1982 1 PODC Andrews & Dobkin & Downey, Distributed Allocation with Pools of Servers 1982 1 PODC Reif & Spirakis, Real Time Resource Allocation in a Distributed System 1982 1 PODC Dolev & Meseguer & Pease, Finding Safe Paths in a Faulty Environment 1982 1 PODC Milner, Four Combinators for Concurrency 1982 1 PODC Back & Mannila, A Refinement of Kahn's Semantics to Handle Non-Determinism and Communication 1982 1 PODC Carvalho & Roucairol, On the Distribution of an Assertion 1982 1 PODC Dolev & Reischuk, Bounds on Information Exchange for Byzantine Agreement 1982 1 PODC Schlichting & Schneider, Understanding and Using Asynchronous Message-Passing 1982 1 PODC Sistla & Clarke & Francez & Gurevich, Can Message Buffers be Characterized in Linear Temporal Logic? 1982 1 PODC Chandy & Misra, A Distributed Algorithm for Detecting Resource Deadlocks in Distributed Systems 1982 1 PODC Andrews & Levin, On-the-Fly Deadlock Prevention 1982 1 PODC Korth, Edge Locks and Deadlock Avoidance in Distributed Systems 1982 1 PODC Balter & Berard & Decitre, Why Control of the Concurrency Level in Distributed Systems is More Fundamental than Deadlock Management 1982 1 PODC Fle & Roucairol, On Serializability of Iterated Transactions 1982 1 PODC Misra & Chandy & Smith, Proving Safety and Liveness of Communicating Processes with Examples 1982 1 PODC Bernstein & Goodman, Concurrency Control Algorithms for Multiversion Database Systems 1982 1 PODC Silberschatz, A Multi-Version Concurrency Control Scheme with No Rollbacks 1982 1 PODC Breitwieser & Leszak, A Distributed Transaction Processing Protocol Based on Majority Consensus 1982 1 PODC Shamir & Upfal, N-Processor Graphs Distributively Achieve Perfect Matchings in O(log^2 n) Beats 1982 1 PODC Snir, On Parallel Searching 1982 1 PODC Culik & Pachl, Folding and Unrolling Systolic Arrays 1992 11 PODS Beeri, New Data Models and Languages--The Challenge 1992 11 PODS Papadimitriou & Yannakakis, Tie-Breaking Semantics and Structural Totality 1992 11 PODS Rabinovich & Lazowska, A Fault-Tolerant Commit Protocol for Replicated Databases 1990 9 PODS Kim, Research Directions in Object-Oriented Database Systems 1990 9 PODS Yu & Rosenkrantz, Representability of Design Objects by Ancestor-Controlled Hierarchical Specifications 1990 9 PODS Lipton & Naughton, Query Size Estimation by Adaptive Sampling 1990 9 PODS Yannakakis, Graph-Theoretic Methods in Database Theory 1990 9 PODS Willard, Quasilinear Algorithms for Processing Relational Calculus Expressions 1990 9 PODS Chomicki, Polynomial Time Query Processing in Temporal Deductive Databases 1990 9 PODS Kabanza & Stevenne & Wolper, Handling Infinite Temporal Data 1989 8 PODS Vardi, Automata Theory for Database Theoreticians 1989 8 PODS Ullman, Bottom-up Beats Top-down for Datalog 1989 8 PODS Ramakrishnan & Sagiv & Ullman & Vardi, Proof-tree Transformation Theorems and Their Applications 1989 8 PODS Johnson & Shasha, Utilization of B-trees with Inserts, Deletes and Modifies 1989 8 PODS Faloutsos & Metaxas, Declustering Using Error Correcting Codes 1989 8 PODS Lakshmanan & Mendelzon, Inductive Pebble Games and the Expressive Power of Datalog 1988 7 PODS Chandra, Theory of Database Queries 1988 7 PODS Ullman & Vardi, The Complexity of Ordering Subgoals 1988 7 PODS Ramakrishna & Mukhopadhyay, Analysis of Bounded Disorder File Organization 1988 7 PODS Bancilhon, Object-Oriented Database Systems 1988 7 PODS Huang & Langston, Stable Set and Multiset Operations in Optimal Time and Space 1988 7 PODS Yu & Rosenkrantz, Minimizing Time-Space Cost for Database Version Control 1987 6 PODS Ullman, Database Theory--Past and Future 1987 6 PODS Fekete & Lynch & Merrit & Weihl, Nested Transactions and Read-Write Locking 1987 6 PODS Selinger, Chickens and Eggs--The Interrelationship of Systems and Theory 1985 4 PODS Ellis, Concurrency and Linear Hashing 1985 4 PODS Shasha, Semantically Based Concurrency Control for Search Structures 1985 4 PODS Ouksel, The Interpolation-Based Grid File 1985 4 PODS Sagiv, Concurrent Operations on B*-Trees with Overtaking 1985 4 PODS Ozsoyoglu & Matos, On Optimizing Summary-Table-By-Example Queries 1985 4 PODS Gadia & Vaishnav, A Query Language for a Homogenous Temporal Database 1985 4 PODS Vardi, Querying Logical Databases 1985 4 PODS Brosda & Vossen, Updating a Relational Database through a Universal Schema Interface 1985 4 PODS Stein & Maier, Relaxing the Universal Scheme Assumption 1985 4 PODS Spirakis & Tuzhilin, A Semantic Approach to Correctness of Concurrent Transaction Executions 1985 4 PODS Hadzilacos & Papadimitriou, Some Algorithmic Aspects of Multiversion Concurrency Control 1985 4 PODS Wolfson & Yannakakis, Deadlock-Freedom (and Safety) of Transactions in a Distributed Database 1985 4 PODS Garcia-Molina & Kent, An Experimental Evaluation of Crash Recovery Mechanisms 1985 4 PODS Casanova & Moura & Tucherman, On the Correctness of a Local Recovery Subsystem 1985 4 PODS Page & Popek, Distributed Data Management in Local Area Networks 1985 4 PODS Connors, Equivalence of Views by Query Capacity 1985 4 PODS Bancilhon & Spyratos, Algebraic Versus Probabilistic Independence in Data Bases 1985 4 PODS Keller, Algorithms for Translating View Updates to Database Updates for Views Involving Selections, Projections, and Joins 1985 4 PODS Ausiello & D'Atri, Chordality Properties on Graphs and Minimal Conceptual Connections in Semantic Data Models 1985 4 PODS Sagiv, On Computing Restricted Projections of Representative Instances 1985 4 PODS Atzeni & Chan, Efficient Query Answering in the Representative Instance Approach 1985 4 PODS Kundu, An Improved Algorithm for Finding a Key of a Relation 1985 4 PODS Abiteboul & Vianu, Transactions and Integrity Constraints 1985 4 PODS Gyssens, Embedded Join Dependencies as a Tool for Decomposing Full Join Dependencies 1985 4 PODS Skeen & Cristian & El Abbadi, An Efficient Fault-Tolerant Algorithm for Replicated Data Management 1985 4 PODS Yannakakis & Papadimitriou, The Complexity of Reliable Concurrency Control 1985 4 PODS Ramarao, On the Complexity of Commit Protocols 1985 4 PODS Mannila & Raiha, Small Armstrong Relations for Database Design 1985 4 PODS Ozsoyoglu & Yuan, A Normal Form for Nested Relations 1985 4 PODS Cosmadakis & Kanellakis, Partition Semantics for Relations 1995 POLITY Button & Coulter & Lee & Sharrock, Computers, Minds and Conduct 1996 23 POPL Pippenger, Pure versus Impure LISP 1995 22 POPL Brookes & Dancanet, Sequential Algorithms, Deterministic Parallelism, and Intensional Expressiveness 1995 22 POPL Reps & Horwitz & Sagiv, Precise Interprocedural Dataflow Analysis via Graph Reachability 1995 22 POPL Hoang & Mitchell, Lower Bounds on Type Inference with Subtypes 1995 22 POPL Ariola & Felleisen & Maraist & Odersky & Wadler, The Call-by-Need Lambda Calculus 1995 22 POPL Castagna & Pierce, Corrigendum: Decidable Bounded Quantification 1993 20 POPL Leivant, Stratified Functional Programs and Computational Complexity 1993 20 POPL Kozen, Efficient Recursive Subtyping 1993 20 POPL Consel, Tutorial Notes on Partial Evaluation 1993 20 POPL Ramalingam & Reps, A Categorized Bibliography on Incremental Computation 1990 17 POPL Field, On Laziness and Optimality in Lambda Interpreters: Tools for Specification and Analysis 1990 17 POPL Lamping, An Algorithm for Optimal Lambda Calculus Reduction 1990 17 POPL Abadi & Cardelli & Curien & Levy, Explicit Substitutions 1990 17 POPL Griffin, A Formulae-as-Types Notion of Control 1990 17 POPL Asperti & Ferrari & Gorrieri, Implicative Formulae in the Proofs of Computations' Analogy 1990 17 POPL Moschovakis, Computable Process 1990 17 POPL Berry & Boudol, The Chemical Abstract Machine 1990 17 POPL Lafont, Interaction Nets 1990 17 POPL Mitchell, Toward a Typed Foundation for Method Specialization and Inheritance 1990 17 POPL Cook & Hill & Canning, Inheritance is Not Subtyping 1990 17 POPL Graver & Johnson, A Type System for Smalltalk 1990 17 POPL Hughes, Introduction to Abstract Interpretation 1990 17 POPL Burn, A Relationship Between Abstract Interpretation and Projection Analysis 1990 17 POPL Deutsch, On Determining Lifetime and Aliasing of Dynamically Allocated Data in Higher-order Functional Specifications 1990 17 POPL Sekar & Pawagi & Ramarkrishnan, Small Domains Spell Fast Strictness Analysis 1990 17 POPL Marlowe & Ryder, An Efficient Hybrid Algorithm for Incremental Data Flow Analysis 1990 17 POPL Heintze & Jaffar, A Finite Presentation Theorem for Approximating Logic Programs 1990 17 POPL Williams & Aiken & Wimmers, Program Transformation in the Presence of Errors 1990 17 POPL Steele, Making Asynchronous Parallelism Safe for the World 1990 17 POPL Saraswat & Rinard, Concurrent Constraint Programming 1990 17 POPL Ramakrishnan, Parallelism in Logic Programs 1990 17 POPL Demers & Weiser & Hayes & Boehm & Bobrow & Shenker, Combining Generational and Conservative Garbage Collection: Framework and Implementations 1990 17 POPL Palem & Simons, Scheduling Time-Critical Instructions on RISC Machines 1990 17 POPL Ramesh & Ramakrishnan & Warren, Automata-Driven Indexing of Prolog Clauses 1990 17 POPL Attie & Francez & Grumberg, Fairness and Hyperfairness in Multi-Party Interactions 1990 17 POPL Gunter, Relating Total and Partial Correctness Interpretations of Non-Deterministic Programs 1990 17 POPL Russell, On Oraclizable Networks and Kahn's Principle 1990 17 POPL Stark, On the Relations Computable by a Class of Concurrent Automata 1990 17 POPL Harper & Mitchell & Moggi, Higher-Order Modules and the Phase Distinction 1990 17 POPL Rouaix, Safe Run-time Overloading 1990 17 POPL Thatte, Quasi-static Typing 1990 17 POPL Mairson, Deciding ML Typability is Complete for Deterministic Exponential Time 1989 16 POPL Ferrante, The Program Dependence Graph and its Uses 1989 16 POPL Baxter & Bauer, The Program Dependence Graph and Vectorization 1989 16 POPL Selke, A Rewriting Semantics for Program Dependence Graphs 1989 16 POPL Cytron & Ferrante & Rosen & Wegman & Zadeck, An Efficient Method of Computing Static Single Assignment Form 1989 16 POPL Sagiv & Edelstein & Francez & Rodeh, Resolving Circularity in Attribute Grammars with Applications to Data Flow Analysis 1989 16 POPL Cooper & Kennedy, Fast Interprocedural Alias Analysis 1989 16 POPL Wadler & Blott, How To Make Ad-hoc Polymorphism Less Ad Hoc 1989 16 POPL Re'my, Typechecking Records and Variants in a Natural Extension of ML 1989 16 POPL Paulin-Mohring, Extracting F_omega's Programs from Proofs in the Calculus of Constructions 1989 16 POPL Kanellakis & Mitchell, Polymorphic Unification and ML Typing 1989 16 POPL Yelick & Zachary, Moded Type Systems for Logic Programming 1989 16 POPL Hickey, CLP* and Constraint Abstraction 1989 16 POPL Gaifman & Shapiro, Fully Abstract Compositional Semantics for Logic Programs 1989 16 POPL Abramsky, Concurrent Processes 1989 16 POPL Thompsen, A Calculus of Higher Order Communicating Systems 1989 16 POPL Jonsson, A Fully Abstract Trace Model for Dataflow Networks 1989 16 POPL Emerson & Sadler & Srinivasan, Efficient Temporal Reasoning 1989 16 POPL Pnueli & Rosner, On the Synthesis of a Reactive Module 1989 16 POPL Attie & Emerson, Synthesis of Concurrent Systems with Many Similar Sequential Processes 1989 16 POPL Cardelli & Nelson & Kalsow & Donahue & Jordan, The Modula-3 Type System 1989 16 POPL Abadi & Cardelli & Pierce & Plotkin, Dynamic Typing in a Statically-typed Language 1989 16 POPL Meseguer, Relating Models of Polymorphism 1989 16 POPL Monteleone, Generalized Conjunctive Types 1989 16 POPL Dershowitz & Kaplan, Rewrite, Rewrite, Rewrite, Rewrite, Rewrite,... 1989 16 POPL Parker, Partial Order Programming 1989 16 POPL Baudinet, Temporal Logic Programming is Complete and Expressive 1989 16 POPL Kelsey & Hudak, Realistic Compilation by Program Transformation 1989 16 POPL Appel & Jim, Continuation-passing, Closure-passing Style 1989 16 POPL Gopinath & Hennessy, Copy Elimination in Functional Languages 1989 16 POPL Pugh & Teitelbaum, Incremental Computation by Function Caching 1989 16 POPL Mosses, Unified Algebras and Modules 1989 16 POPL Larsen & Skou, Bisimulation through Probabilistic Testing 1988 15 POPL Alpern & Wegman & Zadeck, Detecting Equality of Variables in Programs 1988 15 POPL Williams & Wimmers, Sacrificing Simplicity for Convenience: Where Do You Draw the Line? 1988 15 POPL Meyer & Sieber, Towards Fully Abstract Semantics for Local Variables: Preliminary Report 1988 15 POPL Lam, Compiler Optimizations for Asynchronous Systolic Array Programs 1987 14 POPL Manna & Pnueli, Specification and Verification of Concurrent Programs by forall-Automata 1987 14 POPL Herlihy & Wing, Axioms for Concurrent Objects 1987 14 POPL Kohlbecker & Wand, Macro-by-Example: Deriving Syntactic Transformations from their Specifications 1987 14 POPL Chase, An Improvement to Bottom-up Tree Pattern Matching 1987 14 POPL Apt & Francez & Katz, Appraising Fairness in Distributed Languages 1987 14 POPL Breazu-Tannen & Meyer, Computable Values Can Be Classical 1987 14 POPL Leivant & Fernando, Skinny and Fleshy Failures of Relative Completeness 1987 14 POPL Meyer & Mitchell & Moggi & Statman, Empty Types in Polymorphic Lambda Calculus 1987 14 POPL Neirynck & Panangaden & Demers, Computation of Aliases and Support Sets 1986 13 POPL Wand, Finding the Source of Type Errors 1986 13 POPL Walz & Johnson, A Maximum Flow Approach to Anomaly Isolation in Unification-Based Incremental Type Inference 1986 13 POPL Jones & Simon, Hierarchical VLSI Design Systems Based on Attribute Grammars 1986 13 POPL Barringer & Kuiper & Pnueli, A Really Abstract Concurrent Model and Its Temporal Logic 1986 13 POPL Wolper, Expressing Interesting Properties of Programs in Propositional Temporal Logic 1986 13 POPL Meyer & Reinhold, `Type' Is Not a Type 1986 13 POPL Huang & Lengauer, A Mechanically Certified Theorem About Optimal Concurrency of Sorting Networks 1984 11 POPL Reps & Alpern, Interactive Proof Checking 1984 11 POPL Francez & Kozen, Generalized Fair Termination 1984 11 POPL Thiel, Stop Losing Sleep over Incomplete Data Type Specifications 1984 11 POPL Raoult & Sethi, The Global Storage Needs of a Subcomputation 1984 11 POPL Halpern & Meyer & Trakhtenbrot, The Semantics of Local Storage, or What Makes the Free-List Free? 1984 11 POPL Grabowski, On Relative Completeness of Programming Logics 1983 10 POPL Pratt, Five Paradigm Shifts in Programming Language Design and Their Realization in a Programming Language 1983 10 POPL Lamport, Reasoning about Nonatomic Operations 1983 10 POPL Nelson, Verifying Reachability Invariants of Linked Structures 1983 10 POPL Paige, TRansformational Programming--Applications to Algorithms and Systems 1983 10 POPL Leivant, Polymorphic Type Inference 1983 10 POPL Emerson & Halpern, ``Sometimes'' and ``Not Never'' Revisited; On Branching versus Linear Time 1983 10 POPL Manna & Pnueli, How to Cook a Temporal Proof System for Your Pet Language 1983 10 POPL Leivant, Structural Semantics for Polymorphic Data Types 1983 10 POPL Wegman, Summarizing Graphs by Regular Expressions 1983 10 POPL Minsky, Locality in Software Systems 1982 9 POPL Hart & Sharir & Pnueli, Termination of Probabilistic Concurrent Programs 1982 9 POPL Reif & Spirakis, Unbounded Speed Variability in Distributed Communication Systems 1982 9 POPL Lipton & Valdes & Sedgewick, Programming Aspects of VLSI (Preliminary Version) 1982 9 POPL Sippu & Soisalon-Soininen, Practical Error Recovery in LR Parsing 1982 9 POPL Pratt, On the Composition of Processes 1982 9 POPL Meyer & Mitchell, Axiomatic Definability and Completeness for Recursive Programs 1982 9 POPL Sherman & Pnueli & Harel, Is the Interesting Part of Process Logic Uninteresting?: A Translation from PL to PDL 1981 8 POPL Chandra, Programming Primitives for Database Languages 1981 8 POPL Owicki, Making the World Safe for Garbage Collection 1981 8 POPL Rosen, Linear Cost Is Sometimes Quadratic 1981 8 POPL Rabin & Lehmann, On the Advantages of Free Choice: A Symmetric and Fully Distributed Solution to The Dining Philosophers Problem 1981 8 POPL Meyer & Halpern, Axiomatic Definitions of Programming Languages, II 1981 8 POPL Pratt, Program Logic Without Binding Is Decidable 1981 8 POPL Ben-Ari & Manna, The Temporal Logic of Branching Time 1980 7 POPL Suzuki, Analysis of Pointer Rotation 1980 7 POPL Pratt, On Specifying Verifiers 1980 7 POPL Gabbay & Pnueli & Shelah & Stavi, On the Temporal Analysis of Fairness 1980 7 POPL Lamport, ``Sometime'' is Sometimes ``Not Never''--On the Temporal Logic of Programs 1980 7 POPL Parikh, Propositional Logics of Programs: Systems, Models, and Complexity 1980 7 POPL Reif & Peterson, A Dynamic Logic of Multiprocessing with Incomplete Information 1980 7 POPL Meyer & Halpern, Axiomatic Definitions of Programming Languages: A Theoretical Assessment 1980 7 POPL Hunt & Rosenkrantz, Efficient Algorithms for Structural Similarity of Grammars 1980 7 POPL Guttag & Horning, Formal Specification as a Design Tool 1978 5 POPL Reif, Symbolic Program Analysis in Almost Linear Time 1978 5 POPL Downey & Samet & Sethi, Off-line and On-line Algorithms for Deducing Equalities 1977 4 POPL Clarke, Programming Language Constructs for which it is Impossible to Obtain ``Good'' Hoare-like Axiom Systems 1977 4 POPL Paige & Schwartz, Reduction in Strength of High Level Operations 1977 4 POPL Reif & Lewis, Symbolic Evaluation and the Global Value Graph 1977 4 POPL Pratt, The Competence/Performance Dichotomy in Programming 1977 4 POPL Hehner, Structuring 1977 4 POPL DeMillo & Lipton & Perlis, Social Processes and Proofs of Theorems and Programs 1977 4 POPL Lewis, The Equivalence Problem for Program Schemata with Nonintersecting Loops 1976 3 POPL Leong & Wotschke, The Influence of Productions on Derivations and Parsing 1976 3 POPL Hunt, A Complexity Theory of Grammar Problems 1976 3 POPL Aho & Johnson & Ullman, Code Generation for Expressions with Common Subexpressions 1976 3 POPL Low & Rovner, Techniques for the Automatic Selection of Data Structures 1976 3 POPL Geller, Test Data as an Aid in Proving Program Correctness 1975 2 POPL Schwartz, Automatic Data Structure Choice in a Language of Very High Level 1975 2 POPL Lipton, Reduction: A New Method of Proving Properties of Systems of Processes 1975 2 POPL Jones & Muchnick, Even Simple Programs are Hard to Analyze 1975 2 POPL Cook & Oppen, An Assertion Language for Data Structures 1975 2 POPL Lester, Program Schemas with Concurrency: Execution Time and Hangups 1975 2 POPL Symes, New Control Structures to Aid Gotolessness 1975 2 POPL Goodenough, Structured Exception Handling 1973 1 POPL Morris, Types are Not Sets 1973 1 POPL Fischer & Fischer, Mode Modules as Representations of Domains 1973 1 POPL Rosenberg, Transitions in Extendible Arrays 1990 POPOFMATH Steen, Mathematical News that's Fit to Print 1986 3 PPCAA Hellwagner, A Fault Detection Method in Partially Utilized Cellular (Systolic) Arrays 1986 3 PPCAA Hemmerling, On the Power of Cellular Parallelism 1986 3 PPCAA Mizuno, A Neural Network Model for Pattern Recognition 1993 4 PPOPP Culler & Karp & Patterson & Sahay & Schauser & Santos & Subramonian & von Eicken, LogP: Towards a Realistic Model of Parallel Computation 1996 4 PPSN Back & Dornemann & Hammel & Frankhauser, Modeling Urban Growth by Cellular Automata 1996 4 PPSN Dittes, Democratic Optimization for Discrete and Continuous Systems 1996 4 PPSN Pelillo & Bomze, Parallelizable Evolutionary Dynamics Principles for Solving the Maximum Clique Problem 1996 4 PPSN Zauner & Conrad, Parallel Computing with DNA: Toward the Anti-Universal Machine 1990 1 PPSN Goldberg, The Theory of Virtual Alphabets 1990 1 PPSN Hesser & Manner, An Alternative Genetic Algorithm 1990 1 PPSN Gerrits & Hogeweg, Redundant Coding of an NP-Complete Problem Allows Effective Genetic Algorithm Search 1990 1 PPSN Hulin, Circuit Partitioning with Genetic Algorithms Using a Coding Scheme to Preserve the Structure of a Circuit 1990 1 PPSN Ulder & Aarts & Bandelt & van Laarhoven & Pesch, Genetic Local Search Algorithms for the Travelling Salesman Problem 1990 1 PPSN Braun, On Solving Travelling Salesman Problems by Genetic Algorithms 1990 1 PPSN Kroger & Schwenderling & Vornberger, Parallel Genetic Packing of Rectangles 1990 1 PPSN Hoffmann & Christoff & Hanf, Optimizing Simulated Annealing 1990 1 PPSN Roussel-Ragot & Kouicem & Dreyfus, Error-Free Parallel Implementation of Simulated Annealing 1990 1 PPSN Paton & Nwana & Shave & Bench-Capon & Hughes, Transfer of Natural Metaphors to Parallel Problem Solving Applications 1990 1 PPSN Adachi & Matsuo, Ecological Dynamics under Different Selection Rules in Distributed and Iterated Prisoner's Dilemma Games 1990 1 PPSN Lopez & Caulfield, A Principle of Minimum Complexity in Evolution 1990 1 PPSN Paredis, The Emergence of Data Structures from Local Interactions 1990 1 PPSN de Groot & Wurtz & Hoffmann, Optimizing Complex Problems by Nature's Algorithms: Simulated Annealing and Evolution Strategy -- A Comparative Study 1990 1 PPSN Hoffmeister & Back, Genetic Algorithms and Evolution Strategies -- Similarities and Differences 1997 PRENHALL Akl, Parallel Computation: Models and Methods 1995 PRENHALL Hodges, An Introduction to Berkeley UNIX and ANSI C 1996 PRENHALL Clark, A Student's Guide to the Internet 1996 PRENHALL Kehoe, Zen and the Art of the Internet: A Beginner's Guide, Fourth Edition 1996 PRENHALL Fristrup, The Essential Web Surfer Survival Guide 1996 PRENHALL Brassard & Bratley, Fundamentals of Algorithmics 1995 PRENHALL Plauger, The Draft Standard C++ Library 1995 PRENHALL Stansifer, The Study of Programming Languages 1995 PRENHALL Stallings, Protect Your Privacy: The PGP User's Guide 1995 PRENHALL Harbison & Steele, C: A Reference Manual, Fourth Edition 1995 PRENHALL Tanenbaum, Distributed Operating Systems 1995 PRENHALL Russell & Norvig, Artificial Intelligence: A Modern Approach 1995 PRENHALL Kaufman & Perlman & Speciner, Network Security: PRIVATE Communication in a PUBLIC World 1995 PRENHALL Comer, Internetworking With TCP/IP, Volume I: Principles, Protocols, and Architecture, Third Edition 1995 PRENHALL Parberry, Problems on Algorithms 1994 PRENHALL Deitel & Deitel, C: How to Program, Second Edition 1994 PRENHALL Model, Data Structures, Data Abstraction: A Contemporary Introduction Using C++ 1994 PRENHALL Barclay & Gordon, C++ Problem Solving and Programming 1994 PRENHALL Hillam, Introduction to Abstract Data Types Using Ada 1994 PRENHALL Shultis, LaTeX Notes: Practical Tips for Preparing Technical Documents 1994 PRENHALL Johnson, Computer Ethics, Second Edition 1994 PRENHALL Morgan, Programming from Specifications, Second Edition 1994 PRENHALL Rozenberg & Salomaa, Cornerstones of Undecidability 1994 PRENHALL Bovet & Crescenzi, Introduction to the Theory of Complexity 1994 PRENHALL Hardie & Neou (Eds.), Internet: Mailing Lists, Updated 1993 Edition 1994 PRENHALL Mulmuley, Computational Geometry: An Introduction Through Randomized Algorithms 1993 PRENHALL Ben-Ari, Mathematical Logic for Computer Science 1993 PRENHALL Fischer & Grodzinsky, The Anatomy of Programming Languages 1993 PRENHALL Glass, UNIX for Programmers and Users: A Complete Guide 1993 PRENHALL Koren, Computer Arithmetic Algorithms 1993 PRENHALL Nievergelt & Hinrichs, Algorithms and Data Structures: With Applications to Graphics and Geometry 1993 PRENHALL Akl & Lyons, Parallel Computational Geometry 1992 PRENHALL Chaudhuri, Parallel Algorithms: Design and Analysis 1992 PRENHALL Freeman & Phillips, Parallel Numerical Algorithms 1992 PRENHALL Poli & Huguet, Error Correcting Codes: Theory and Applications 1992 PRENHALL Tanenbaum, Modern Operating Systems 1992 PRENHALL Blachman, Mathematica: A Practical Approach 1992 PRENHALL Plauger, The Standard C Library 1991 PRENHALL Nelson (Ed.), Systems Programming with Modula-3 1991 PRENHALL Shapiro, A C++ Toolkit 1991 PRENHALL Pagan, Partial Computation and the Construction of Language Processors 1991 PRENHALL Antognetti & Milutinovic (Eds.), Neural Networks: Concepts, Applications, and Implementations, Volume I 1990 PRENHALL Ben-Ari, Principles of Concurrent and Distributed Programming 1990 PRENHALL Angus & Fox & Kim & Walker, Solving Problems On Concurrent Processors, Volume II: Software for Concurrent Processors 1990 PRENHALL Kaldewaij, Programming: The Derivation of Algorithms 1990 PRENHALL Hekmatpour, C++: A Guide for C Programmers 1989 PRENHALL Bertsekas & Tsitsiklis, Parallel and Distributed Computation: Numerical Methods 1989 PRENHALL Carroll & Long, Theory of Finite Automata, with an Introduction to Formal Languages 1989 PRENHALL Milner, Communication and Concurrency 1989 PRENHALL Young, X Window System: Applications and Programming with Xt 1989 PRENHALL Seberry & Pieprzyk, Cryptography: An Introduction to Computer Security 1989 PRENHALL Tondo & Gimpel, The C Answer Book, Second Edition 1989 PRENHALL Alagar, Fundamentals of Computing: Theory and Practice (Instructor's Manual) 1989 PRENHALL Alagar, Fundamentals of Computing 1988 PRENHALL Fox & Johnson & Lyzenga & Otto & Salmon & Walker, Solving Problems On Concurrent Processors, Volume I: General Techniques and Regular Problems 1988 PRENHALL Brigham, The Fast Fourier Transform and Its Applications 1988 PRENHALL Mark Williams Company, ANSI C: A Lexical Guide 1988 PRENHALL Kernighan & Ritchie, The C Programming Language, Second Edition 1988 PRENHALL Holt & Matthews & Rosselet & Cordy, The Turing Programming Language: Design and Definition 1988 PRENHALL Brassard & Bratley, Algorithmics: Theory & Practice 1987 PRENHALL Fladung, The XLISP Primer 1987 PRENHALL Miller, A Software Tools Sampler 1987 PRENHALL Dybvig, The SCHEME Programming Language 1986 PRENHALL Penna & Patterson, Projective Geometry and Its Applications to Computer Graphics 1985 PRENHALL Lew, Computer Science: A Mathematical Introduction 1984 PRENHALL Tourlakis, Computability 1984 PRENHALL Roberts, Applied Combinatorics 1982 PRENHALL McNaughton, Elementary Computability, Formal Languages, and Automata 1982 PRENHALL Dromey, How To Solve It by Computer 1996 17 PRL Boxer, Point Set Pattern Matching in 3-D 1996 17 PRL Tarhio, A Sublinear Algorithm for Two-dimensional String Matching 1996 17 PRL Al-Sultan & Khan, Computational Experience on Four Algorithms for the Hard Clustering Problem 1996 17 PRL Chaudhuri, A New Definition of Neighborhood of a Point in Multi-dimensional Space 1995 16 PRL Chung, Finding Shape Numbers in Parallel 1995 16 PRL Nohre, Computer Vision: Compress To Comprehend 1995 16 PRL Mobasseri, A Generalized Solution to the Quadtree Expected Complexity Problem 1995 16 PRL Ye, A Fast Algorithm for Convex Hull Extraction in 2D Images 1995 16 PRL Rosenfeld, ``Geometric Properties'' of Sets of Lines 1995 16 PRL Chen & Chang & Lee, A Near Pattern-Matching Scheme Based upon Principal Component Analysis 1995 16 PRL Hsieh & Ho & Fan, An Extension of the Bipartite Weighted Matching Problem 1995 16 PRL Gotsman & Lindenbaum, Euclidean Voronoi Labeling on the Multidimensional Grid 1995 16 PRL Cinque & Bongiovanni, Parallel Prefix Computation on a Pyramid Computer 1994 15 PRL Jumarie, Informational Similarity of Graphs in Syntactic Pattern Recognition 1994 15 PRL Boninsegna & Rossi, Similarity Measures in Computer Vision 1994 15 PRL Rosenfeld, Fuzzy Plane Geometry: Triangles 1994 15 PRL Chung & Lin, Leftmost-One Finding on Meshes with Segmented Row Buses 1994 15 PRL Chaudhuri, How to Choose a Representative Subset from a Set of Data in Multi-dimensional Space 1994 15 PRL Schmitt & Mattioli, Strong and Weak Convex Hulls in Non-Euclidean Metric: Theory and Application 1994 15 PRL Han & Koczy & Poston, Fuzzy Hough Transform 1994 15 PRL Held & Abe, On Approximate Convexity 1994 15 PRL Seong & Choi & Kim & Park, An Algorithm for Optimal Isomorphism between Two Random Graphs 1994 15 PRL Sprinzak & Werman, Affine Point Matching 1993 14 PRL Chiavetta & Di Gesu, Parallel Computation of the Euler Number via Connectivity Graph 1993 14 PRL Ragnemalm, The Euclidean Distance Transform in Arbitrary Dimensions 1993 14 PRL Milun & Sher, Improving Sampled Probability Distributions for Markov Random Fields 1993 14 PRL Avis, The m-Core Properly Contains the m-Divisible Points in Space 1993 14 PRL Capoyleas, Clamping of Polygonal Objects 1993 14 PRL Eades & Rappaport, The Complexity of Computing Minimum Separating Polygons 1993 14 PRL ElGindy & Everett & Toussaint, Slicing an Ear Using Prune-and-Search 1993 14 PRL Fortune, A Note on Delaunay Diagonal Flips 1993 14 PRL Jennings & Lenhart, An Art Gallery Theorem for Line Segments in the Plane 1993 14 PRL Robert, Maximum Distance between Two Sets of Points in E^d 1993 14 PRL Shermer, On Recognizing Unions of Two Convex Polygons and Related Problems 1993 14 PRL Tsikopoulos, A Unimodal Counterexample to a Diameter Algorithm 1993 14 PRL Chang & Wu, A Hashing-Oriented Nearest Neighbor Searching Scheme 1993 14 PRL Jiang & Zhang, An Improved Method for Finding Nearest Neighbors 1993 14 PRL Ventura & Chen, Optimal Matching of Nonconvex Polygons 1993 14 PRL Toivanen, Image Compression by Selecting Control Points Using Distance Function on Curved Space 1993 14 PRL Xu & Kamath & Capson, Selection of Partitions from a Hierarchy 1993 14 PRL Boxer & Miller, Parallel Algorithms for All Maximal Equally-Spaced Collinear Sets and All Maximal Regular Coplanar Lattices 1992 13 PRL Seong & Kim & Park, Formal Definition and Entropy Calculation of Hierarchical Attributed Random Graph 1992 13 PRL Mitra, Answering Gabriel Neighbour Queries 1992 13 PRL Brunelli, Optimal Histogram Partitioning Using a Simulated Annealing Technique 1992 13 PRL Ramasubramanian & Paliwal, An Efficient Approximation-Elimination Algorithm for Fast Nearest-Neighbor Search Based on a Spherical Distance Coordinate Formulation 1992 13 PRL Chaudhuri & Chaudhuri & Murthy, A New Split-and-Merge Clustering Technique 1992 13 PRL Bonnin & Pallo, A Shortest Path Metric on Unlabeled Binary Trees 1992 13 PRL Cimikowski, Properties of Some Euclidean Proximity Graphs 1992 13 PRL Bhandarkar, Parallelizing Object Recognition on the Hypercube 1992 13 PRL Aladjem & Dinstein, Linear Mappings of Local Data Structures 1992 13 PRL Pavlidis, Why Progress in Machine Vision is So Slow 1992 13 PRL Faloutsos, Analytical Results on the Quadtree Decomposition of Arbitrary Rectangles 1991 12 PRL Chattopadhyay & Das, Counting Thin and Bushy Triangulations of Convex Polygons 1991 12 PRL Bhattacharya & Everett & Toussaint, A Counterexample to a Dynamic Algorithm for Convex Hulls of Line Arrangements 1992 92 PROBABTH Aldous & Steele, Asymptotics for Euclidean Minimal Spanning Trees on Random Points 1992 91 PROBABTH Novak, Longest Runs in a Sequence of m-Dependent Random Variables 1989 82 PROBABTH Telcs, Random Walks on Graphs, Electric Networks and Fractals 1988 77 PROBABTH Barany & Furedi, On the Shape of the Convex Hull of Random Points 1992 PROBALGS Steele & Aldous, Introduction (to Probabity and Algorithms) 1992 PROBALGS Bertsimas & Tsitsiklis, Simulated Annealing 1992 PROBALGS Aldous, Approximate Counting via Markov Chains 1992 PROBALGS Feigenbaum & Lagarias, Probabilistic Algorithms for Speedup 1992 PROBALGS Feigenbaum, Probabilistic Algorithms for Defeating Adversaries 1992 PROBALGS Lagarias, Pseudorandom Numbers 1992 PROBALGS Coffman & Johnson & Shor & Lueker, Probabilistic Analysis of Packing and Related Partitioning Problems 1992 PROBALGS Steele, Probability and Problems in Euclidean Combinatorial Optimization 1992 PROBALGS Shamir, Probabilistic Analysis in Linear Programming 1992 PROBALGS Ramachandran, Randomization in Parallel Algorithms 1992 PROBALGS Maggs, Randomly Wired Multistage Networks 1992 PROBALGS Steele, Missing Pieces, Derandomization, and Concluding Remarks 1990 4 PROBEIS Lalley, Travelling Salesman with a Self-similar Itinerary 1990 4 PROBEIS Courcoubetis & Weber, The Move-to-Front Rule for Multiple Lists 1988 2 PROBEIS Avis & Davis & Steele, Probabilistic Analysis of a Greedy Heuristic for Euclidean Matching 1994 PROMETHEUS Smith, Humble Pi: The Role Mathematics *Should* Play in American Education 1985 400 PRSLA Deutsch, Quantum Theory, the Church-Turing Principle and the Universal Quantum Computer 1995 50 PSAM Calderbank (Ed.), Different Aspects of Coding Theory 1995 50 PSAM Calderbank, Coding Theory as Discrete Applied Mathematics 1995 50 PSAM Marcus & Roth & Siegel, Modulation Codes for Digital Data Storage 1995 50 PSAM Marcus, Symbolic Dynamics and Connections to Coding Theory, Automata Theory and System Theory 1995 50 PSAM Forney & Marcus & Sindhushayana & Trott, Multilingual Dicitionary 1995 50 PSAM Stichtenoth, Algebraic Geometric Codes 1995 50 PSAM Kantor, Codes, Quadratic Forms and Finite Geometries 1995 50 PSAM Hardin & Sloane, Codes (Spherical) and Designs (Experimental) 1995 50 PSAM Feigenbaum, The Use of Coding Theory in Computational Complexity 1994 48 PSAM Gautschi (Ed.), Mathematics of Computation 1943-1993: A Half-Century of Computational Mathematics 1994 48 PSAM Rojas, Who Invented the Computer? The Debate from the Viewpoint of Computer Architecture 1994 48 PSAM Odlyzko, Analytic Computations in Number Theory 1994 48 PSAM Pomerance, The Number Field Sieve 1994 48 PSAM Williams & Shallit, Factoring Integers before Computers 1994 48 PSAM Bach & Sorenson, Explicit Bounds for Primes in Residue Classes 1994 48 PSAM Brent, Ramanujan and Euler's Constant 1994 48 PSAM Lazarus, Implications of Computational Mathematics for the Philosophy of Mathematics 1992 46 PSAM Schroeder, The Unreasonable Effectiveness of Number Theory in Physics, Communication and Music 1992 46 PSAM Andrews, The Reasonable and Unreasonable Effectiveness of Number theory in Statistical Mechanics 1992 46 PSAM Lagarias, Number Theory and Dynamical Systems 1992 46 PSAM Marsaglia, The Mathematics of Random Number generators 1992 46 PSAM Pless, Cyclotomy and Cyclic Codes 1992 46 PSAM McIlroy, Number Theory in Computer Graphics 1991 44 PSAM Bollobas, Random Graphs 1991 44 PSAM Chung, Constructing Random-Like Graphs 1991 44 PSAM Leader, Discrete Isoperimetric Inequalities 1991 44 PSAM Bollobas, Random Graphs Revisited 1991 44 PSAM Vazirani, Rapidly Mixing Markov Chains 1991 44 PSAM Dyer & Frieze, Computing the Volume of Convex Bodies: A Case Where Randomness Provably Helps 1991 44 PSAM Diaconis, Finite Fourier Methods: Access to Tools 1990 43 PSAM Guy (Ed.), Combinatorial Games 1990 43 PSAM Guy, What is a Game? 1990 43 PSAM Conway, Numbers and Games 1990 43 PSAM Guy, Impartial Games 1990 43 PSAM Conway, More Ways of Combining Games 1990 43 PSAM Berlekamp, Introductory Overview of Mathematical Go Endgames 1990 43 PSAM Pless, Games and Codes 1990 43 PSAM Fraenkel, Complexity of Games 1990 43 PSAM Nowakowski, ..., Welter's Game, Sylver Coinage, Dots-and-Boxes, ... 1990 43 PSAM Guy, Unsolved Problems in Combinatorial Games 1990 43 PSAM Fraenkel, Selected Bibliography on Combinatorial Games and Some Related Material 1991 42 PSAM Pomerance (Ed.), Cryptology and Computational Number Theory, Proceedings of Symposia in Applied Mathematics 1991 42 PSAM Pomerance, Cryptology and Computational Number Theory--An Introduction 1991 42 PSAM Lenstra, Primality Testing 1991 42 PSAM Pomerance, Factoring 1991 42 PSAM McCurley, The Discrete Logarithm Problem 1991 42 PSAM Odlyzko, The Rise and Fall of Knapsack Cryptosystems 1991 42 PSAM Goldwasser, The Search for Provably Secure Cryptosystems 1991 42 PSAM Lagarias, Pseudorandom Number Generators in Cryptography and Number Theory 1991 42 PSAM McCurley, Odds and Ends from Cryptology and Computational Number Theory 1990 41 PSAM Brockett, Some Mathematical Aspects of Robotics 1990 41 PSAM Murray & Sastry, Grasping and Manipulation using Multifingered Robot Hands 1990 41 PSAM Brockett, Formal Languages for Motion Description and Map Making 1995 1 PTAT Wren, Scheduling, Timetabling and Rostering -- A Special Relationship? 1995 1 PTAT Cooper & Kingston, The Complexity of Timetable Construction Problems 1995 1 PTAT de Werra, Some Combinatorial Models for Course Scheduling 1996 11 PUBLSH Borzo, Laying Down the Law: Digital Typesetting Project Beautifully Restores the Appearance of the Ancient Jewish Talmud (June) 1991 35 PUBMAT Jones, The Traveling Salesman Problem and Harmonic Analysis 1996 PUP Acton, Real Computing Made Real: Preventing Errors in Scientific and Engineering Calculations 1995 PUP Changeux & Connes, Conversations on Mind, Matter, and Mathematics (edited and translated by M. B. DeBevoise) 1994 PUP Golomb, Polyominoes: Puzzles, Patterns, Problems, and Packings, Second Edition 1994 PUP Maor, The Story of a Number 1993 PUP Davis, The Nature and Power of Mathematics 1992 PUP Jacobs, Invitation to Mathematics 1992 PUP Penner & Harer, Combinatorics of Train Tracks 1991 PUP Ruelle, Chance and Chaos 1996 30 RAIRO Allender & Ogihara, Relationships among PL, #L, and the Determinant 1991 25 RAIRO Buntrock & Drewes & Lautemann & Mossakowski, Some Modifications of Auxiliary Pushdown Automata 1991 25 RAIRO Coupet-Grimal, Prolog Infinite Trees and Automata 1991 25 RAIRO Ito, A Note on the Paper ``Disjunctive Languages and Compatible Orders'' 1991 25 RAIRO Krob, Matrix Versions of Aperiodic K-Rational Identities 1991 25 RAIRO Hoffmann & Plump, Implementing Term Rewriting by Jungle Evaluation 1991 25 RAIRO Geffert, Normal Forms for Phrase-structure Grammars 1991 25 RAIRO Madonia & Salemi & Sportelli, On z-Submonoids and z-Codes 1991 25 RAIRO Waack, On the Parallel Complexity of Linear Groups 1991 25 RAIRO Arnold, An Extension of the Notions of Traces and of Asynchronous Automata 1991 25 RAIRO Bossut & Warin, On a Code Problem Concerning Planar Acyclic Graphs 1991 25 RAIRO Arques & Jacques, Solides non Organises: Definition, Implantation et Plongement 1991 25 RAIRO Herbst, On a Subclass of Context-free Groups 1991 25 RAIRO Tang & Book, Reducibilities on Tally and Sparse Sets 1991 25 RAIRO Matousek, Spanning Trees with Low Crossing Number 1991 25 RAIRO Heuter, First-order Properties of Trees, Star-free Expressions, and Aperiodicity 1991 25 RAIRO Vogler, A Generalization of Traces 1991 25 RAIRO Kirschenhofer & Prodinger, Approximate Counting: An Alternative Approach 1991 25 RAIRO Anselmo, Automates et Codes Zigzag 1991 25 RAIRO Rosler, A Limit Theorem for ``Quicksort'' 1990 24 RAIRO Cori & Formisano, Partially Abelian Squarefree Words 1990 24 RAIRO Blanchet-Sadri, On Dot-depth Two 1990 24 RAIRO Morain & Olivos, Speeding Up the Computations on an Elliptic Curve Using Addition-Subtraction Chains 1990 24 RAIRO Le Saec, Saturing Right Congruences 1990 24 RAIRO Gagliardi & Tulipani, On Algebraic Specifications of Computable Algebras with the Discriminator Technique 1990 24 RAIRO Lam & Van, On a Class of Infinitary Codes 1990 24 RAIRO Neraud, Elementariness of a Finite Set of Words Is Co-NP-Complete 1990 24 RAIRO Huckenbeck, On Geometric Automata Which Can Nondeterministically Choose Auxiliary Points 1990 24 RAIRO Kudlek, Comparison of Basic Language Generating Devices (Nondeterministic Systems) 1990 24 RAIRO Culik & Karhumaki, Loops in Automata and HDT0L Relations 1990 24 RAIRO de Luca & Varricchio, A Combinatorial Theorem on p-Power-free Words and an Application to Semigroups 1990 24 RAIRO Ko, A Note on Separating the Relativized Polynomial Time Hierarchy by Immune Sets 1990 24 RAIRO Milani & Workman, Epsilon Weak Precedence Grammars and Languages 1990 24 RAIRO Engelfriet & Leih, Complexity of Boundary Graph Languages 1990 24 RAIRO Pierre & Farinone, Context-free Languages with Rational Index in Theta(n^lambda) for Algebraic Numbers lambda 1990 24 RAIRO Abdulrab, Solving Word Equations 1990 24 RAIRO Gaibisso & Gambosi & Talamo, A Partially Persistent Data Structure for the Set-Union Problem 1990 24 RAIRO Allouche & Dress, Tours de Hanoi et Automates 1990 24 RAIRO Fournier, Pour en Finir avec la Derecursivation du Probleme des Tours de Hanoi 1990 24 RAIRO Birget, Two-way Automaton Computations 1988 22 RAIRO Leonard, A Property of Biprefix Codes 1988 22 RAIRO Salomaa, Yield-Languages Recognized by Alternating Tree Recognizers 1980 14 RAIRO Duval, Mots de Lyndon et Periodicite 1980 14 RAIRO Monien, Two-way Multihead Automata over a One-letter Alphabet 1992 2 RANDGR Berg & Jaworski, Probability Distributions Related to the Local Structure of a Random Mapping 1992 2 RANDGR Chung & Graham, Maximum Cuts and Quasirandom Graphs 1992 2 RANDGR Devroye & Sbihi, Inequalities for Random Walks on Trees 1992 2 RANDGR Dolan, Spanning Trees in Random Graphs 1992 2 RANDGR Erdos & Luczak & Spencer, Subgraphs of Large Minimal Degree 1992 2 RANDGR Frieze, On Small Subgraphs of Random Graphs 1992 2 RANDGR Holst, On the Number of Vertices in the Complete Graph with a Given Vertex as Nearest Neighbor 1992 2 RANDGR Jerrum & McKay & Sinclair, When Is a Graphical Sequence Stable? 1992 2 RANDGR Kemp, On the Stack Ramification of Binary Trees 1992 2 RANDGR Kolchin, The Number of Permutations with Cycle Lengths from a Fixed Set 1992 2 RANDGR Kordecki, On the Rank of a Random Submatroid of Projective Geometry 1992 2 RANDGR Luczak, Sparse Random Graphs with a Given Degree Sequence 1992 2 RANDGR Mahmoud, A Law of Large Numbers for Path Lengths in Search Trees 1992 2 RANDGR Mutafchiev, On Random Mappings of Finite Sets 1992 2 RANDGR Rucinski, Proving Normality in Combinatorics 1992 2 RANDGR Shamir, Remarks on the Stochastic Travelling Salesman 1992 2 RANDGR Skoviera, Random Signed Graphs with an Application to Topological Graph Theory 1992 2 RANDGR Vahidi-Asl & Wierman, A Shape Result for First-Passage Percolation on the Voronoi Tessellation and Delaunay Triangulation 1992 2 RANDGR Weber, On Components of Random Subgraphs of the n-Cube 1992 2 RANDGR Balinska & Quintas & Chung & Graham & Erdos & Godehardt & Grimmett & Rucinski & Weber, Random Graphs '89: Open Problems 1971 RDSWITCH Mukhopadhyay, Complete Sets of Logic Primitives 1988 REIDEL Chou, Mechanical Geometry Theorem Proving 1987 REIDEL van Laarhoven & Aarts, Simulated Annealing: Theory and Applications 1986 REIDEL Wagner & Wechsung, Computational Complexity 1986 REIDEL Szekely, Paradoxes in Probability Theory and Mathematical Statistics 1993 REIFSPA Blelloch, Prefix Sums and Their Applications 1993 REIFSPA Baase, Introduction to Parallel Connectivity, List Ranking, and Euler Tour Techniques 1993 REIFSPA Reid-Miller & Miller & Modugno, List Ranking and Parallel Tree Contraction 1993 REIFSPA Gazit, Randomized Parallel Connectivity 1993 REIFSPA Vishkin, Advanced Parallel Prefix-sums, List Ranking and Connectivity 1993 REIFSPA Schieber, Parallel Lowest Common Ancestor Computation 1993 REIFSPA Ramachandran, Parallel Open Ear Decomposition with Applications to Graph Biconnectivity and Triconnectivity 1993 REIFSPA Klein, Parallel Algorithms for Chordal Graphs 1993 REIFSPA Sen & Rajasekaran, Random Sampling Techniques and Parallel Algorithm Design 1993 REIFSPA Cole, Parallel Merge Sort 1993 REIFSPA Atallah & Goodrich, Deterministic Parallel Computational Geometry 1993 REIFSPA Tate, Newton Iteration and Integer Division 1993 REIFSPA von zur Gathen, Parallel Linear Algebra 1993 REIFSPA Pan, Parallel Solution of Sparse Linear and Path Systems 1993 REIFSPA Ierardi & Kozen, Parallel Resultant Computation 1993 REIFSPA Kaltofen, Dynamic Parallel Evaluation of Computation DAGs 1993 REIFSPA Ullman, The Parallel Complexity of Logical Inference 1993 REIFSPA Vazirani, Parallel Graph Matching 1993 REIFSPA Goldberg, Parallel Algorithms for Network Flow Problems 1993 REIFSPA Fich, The Complexity of Computation on the Parallel Random Access Machine 1993 REIFSPA Greenlaw, Polynomial Completeness and Parallel Computation 1993 REIFSPA Gibbons, Asynchronous PRAM Algorithms 1995 RESCORP Tobias & Chubin & Aylesworth, Rethinking Science as a Career: Perceptions and Realities in the Physical Sciences 1990 RESCORP Tobias, They're Not Dumb, They're Different: Stalking the Second Tier 1991 REX Abadi & Lamport, An Old-Fashioned Recipe for Real Time 1991 REX Alur & Courcoubetis & Dill, Verifying Automata Specifications of Probabilistic Real-Time Systems 1991 REX Alur & Dill, The Theory of Timed Automata 1991 REX Alur & Henzinger, Logics and Models of Real Time: A Survey 1991 REX Koymans, (Real) Time: A Philosophical Perspective 1991 REX Lynch & Vaandrager, Forward and Backward Simulations for Timing-Based Systems 1991 REX Maler & Manna & Pnueli, From Timed to Hybrid Systems 1983 55 RMPHYSICS Wolfram, Statistical Mechanics of Cellular Automata 1995 50 RMS Maryukov, Construction of Some Computational Algorithms on Finite Sets of Points in the Plane 1993 48 RMS Dodson, Geometric and Probabilistic Ideas in Metric Diophantine Approximation 1992 47 RMS Vorobets & Gal'perin & Stepin, Periodic Billiard Trajectories in Polygons: Generating Mechanisms 1992 47 RMS Ivanov & Tuzhilin, Geometry of Minimal Networks and the One-dimensional Plateau Problem 1990 45 RMS Uspenskii & Semenov & Shen, Can an Individual Sequence of Zeros and Ones Be Random? 1989 44 RMS Kfoury & Stolboushkin & Urzyczyn, Some Open Questions in the Theory of Program Schemes and Dynamic Logics 1983 38 RMS Kolmogorov, Combinatorial Foundations of Information Theory and the Calculus of Probabilities 1970 25 RMS Zvonkin & Levin, The Complexity of Finite Objects and the Development of the Concepts of Information and Randomness by Means of the Theory of Algorithms 1990 9 ROBRES Markenscoff & Ni & Papadimitriou, The Geometry of Grasping 1997 10 RSA Flajolet & Szpankowski, Analysis of Algorithms 1997 10 RSA Frieze & McDiarmid, Algorithmic Theory of Random Graphs 1997 10 RSA Boucheron & Gardy, An Urn Model from Learning Theory 1997 10 RSA Coffman & Johnson & Shor & Weber, Bin Packing with Discrete Item Sizes, Part II: Tight Bounds On First Fit 1997 10 RSA Drmota, Systems of Functional Equations 1997 10 RSA Janson & Knuth, Shellsort with Three Increments 1997 10 RSA Kirschenhofer & Prodinger & Martinez, Analysis of Hoare's FIND Algorithm with Median-of-Three Partition 1997 10 RSA Louchard, Probabilistic Analysis of Adaptive Sampling 1997 10 RSA Mahmoud & Smythe & Regnier, Analysis of Boyer-Moore-Horspool String-matching Heuristic 1997 10 RSA McDiarmid & Johnson & Stone, On Finding a Minimum Spanning Tree in a Network with Random Weights 1997 10 RSA Mehlhorn & Priebe, On the All-Pairs Shortest-Path Algorithm of Moffat and Takaota 1997 10 RSA Poblete & Viola & Munro, The Diagonal Poisson Transform and its Application to the Analysis of a Hashing Scheme 1997 10 RSA Schmid, Static Priority Scheduling of Aperiodic Real-Time Tasks 1996 9 RSA Shelah, Very Weak Zero One Law for Random Graphs with Order and Random Binary Functions 1996 9 RSA Chen & Frieze, Analysis of Parallel Algorithms for Finding a Maximal Independent Set in a Random Hypergraph 1996 9 RSA Kirschenhofer & Prodinger & Szpankowski, Analysis of a Splitting Process Arising in Probabilistic Counting and Other Related Algorithms 1996 9 RSA Winkler & Zuckerman, Multiple Cover Time 1996 9 RSA Alon, Independence Numbers of Locally Sparse Graphs and a Ramsey Type Problem 1996 9 RSA Kreuter, Threshold Functions for Asymmetric Ramsey Properties with Respect to Vertex Colorings 1996 9 RSA Alonso & Chassaing & Schott, The Average Complexity of a Coin-Weighing Problem 1996 9 RSA Beck, Foundations of Positional Games 1996 9 RSA Gal & Wigderson, Boolean Complexity Classes vs. Their Arithmetic Analogs 1996 9 RSA Garmo, Random Railways Modeled as Random 3-Regular Graphs 1996 9 RSA Hofmeister & Lefmann, A Combinatorial Design Approach to MAXCUT 1996 9 RSA Komlos & Sarkozy & Szemeredi, On the Square of a Hamiltonian Cycle in Dense Graphs 1996 8 RSA Kesten & Pittel, A Local Limit Theorem for the Number of Nodes, the Height, and the Number of Final Leaves in a Critical Branching Process Tree 1996 8 RSA Hildebrand, Random Walks on Random Simple Graphs 1996 8 RSA Hwang, Limit Theorems for Mergesort 1996 8 RSA Rodl & Thoma, Asymptotic Packing and the Random Greedy Algorithm 1996 8 RSA Fill & Holst, On the Distribution of Search Cost for the Move-to-Front Rule 1996 8 RSA de la Vega, MAX-CUT Has a Randomized Approximation Scheme in Dense Graphs 1996 8 RSA Sidorenko, Randomness Friendly Graphs 1996 8 RSA Furedi, Scrambling Permutations and Entropy of Hypergraphs 1996 8 RSA de Jong, A Central Limit Theorem with Applications to Random Hypergraphs 1996 8 RSA McDiarmid, A Random Bit-Flipping Method for Seeking Agreement 1996 8 RSA Fundia, Derandomizing Chebyshev's Inequality to Find Independent Sets in Uncrowded Hypergraphs 1996 8 RSA Kahn, A Linear Programming Perspective on the Frankl-Rodl-Pippenger Theorem 1996 8 RSA Molloy, A Gap between the Appearances of a k-Core and a (k+1)-Chromatic Graph 1996 8 RSA Fill, On the Distribution of Binary Search Trees under the Random Permutation Model 1996 8 RSA Srivastav & Stangier, Algorithmic Chernoff-Hoeffding Inequalities in Integer Programming 1996 8 RSA Howard, Detecting Defects in Periodic Scenery by Random Walks on Z 1996 8 RSA Simons & Yao, Asymptotic Sine Laws Arising from Alternating Random Permutations and Sequences 1995 7 RSA Bender & Richmond & Wormald, Largest 4-Connected Components of 3-Connected Planar Triangulations 1995 7 RSA McGeoch & Tygar, Optimal Sampling Strategies for Quicksort 1995 7 RSA Cai & Chari, On the Impossibility of Amplifying the Independence of Random Variables 1995 7 RSA DeLaurentis, Appearance of Complex Components in a Random Bigraph 1995 7 RSA Janson, The Minimal Spanning Tree in a Complete Graph and a Functional Limit Theorem for Trees in a Random Graph 1995 7 RSA Kim, The Ramsey Number R(3,t) Has Order of Magnitude t^2/log t 1995 7 RSA Molloy & Reed, The Dominating Number of a Random Cubic Graph 1995 7 RSA Duffus & Ginn & Rodl, On the Computational Complexity of Ordered Subgraph Recognition 1995 7 RSA Shearer, On the Independence Number of Sparse Graphs 1995 7 RSA Karp & Zhang, Bounded Branching Process and AND/OR Tree Evaluation 1995 7 RSA Flajolet & Labelle & Laforest & Salvy, Hypergeometrics and the Cost of Quadtrees 1995 7 RSA Krivelevich, Bounding Ramsey Numbers through Large Deviation Inequalities 1995 7 RSA Jerrum, A Very Simple Algorithm for Estimating the Number of k-Colorings of a Low-Degree Graph 1995 7 RSA Spencer, Asymptotic Packing via a Branching Process 1995 7 RSA Devroye & Lu, The Strong Convergence of Maximal Degrees in Uniform Random Recursive Trees and Dags 1995 7 RSA Krajicek & Pudlak & Woods, An Exponential Lower Bound to the Size of Bounded Depth Frege Proofs of the Pigeonhole Principle 1995 7 RSA Frieze & Janson, Perfect Matchings in Random s-Uniform Hypergraphs 1995 7 RSA Kamath & Motwani & Palem & Spirakis, Tail Bounds for Occupancy and the Satisfiability Threshold Conjecture 1995 7 RSA Schachinger, The Variance of Partial Match Retrieval in a Multidimensional Symmetric Trie 1995 6 RSA Luczak & Shelah, Convergence in Homogeneous Random Graphs 1995 6 RSA Tokuyama & Nakano, Geometric Algorithms for the Minimum Cost Assignment Problem 1995 6 RSA Savicky, Improved Boolean Formulas for the Ramsey Graphs 1995 6 RSA Feige, A Tight Lower Bound on the Cover Time for Random Walks on Graphs 1995 6 RSA Dancik & Paterson, Upper Bounds for the Expected Length of a Longest Common Subsequence of Two Binary Sequences 1995 6 RSA Alon & Frieze & Welsh, Polynomial Time Randomized Approximation Schemes for Tutte-Grothendieck Invariants: The Dense Case 1995 6 RSA miscellaneous, Proceedings of the Sixth International Seminar on Random Graphs and Probabilistic Methods in Combinatorics and Computer Science, ``Random Graphs '93'' 1995 6 RSA Rodl & Thomas, On the Genus of a Random Graph 1995 6 RSA Alon & Sudakov, Disjoint Systems 1995 6 RSA Promel & Steger, Random l-Colorable Graphs 1995 6 RSA Naor & Roth, Constructions of Permutation Arrays for Certain Scheduling Cost Measures 1995 6 RSA Feige, A Tight Upper Bound on the Cover Time for Random Walks on Graphs 1995 6 RSA Aronson & Dyer & Frieze & Suen, Randomized Greedy Matching. II 1995 6 RSA Santha, On the Monte Carlo Boolean Decision Tree Complexity of Read-Once Formulae 1995 6 RSA Canfield & Harper, Large Antichains in the Partition Lattice 1995 6 RSA Preater, A Passage Time for Greedy-Coloring Cycles 1995 6 RSA Blei & Peres & Schmerl, Fractional Product Sets 1994 5 RSA Pemantle, A Shuffle that Mixes Sets of Any Fixed Size Much Faster than It Mixes the Whole Deck 1994 5 RSA Bollobas & Kohayakawa & Luczak, On the Diameter and Radius of Random Subgraphs of the Cube 1994 5 RSA Frieze & Suen, On the Independence Number of Random Cubic Graphs 1994 5 RSA Louchard, Trie Size in a Dynamic List Structure 1994 5 RSA Aldous & Pitman, Brownian Bridge Asymptotics for Random Mappings 1994 5 RSA Biane, Some Comments on the Paper ``Brownian Bridge Asymptotics for Random Mappings'' 1994 5 RSA Hansen, Order Statistics for Decomposable Combinatorial Structures 1994 5 RSA Deneen & Shute & Thomborson, A Probably Fast, Provably Optimal Algorithm for Rectilinear Steiner Trees 1994 5 RSA Broder & Frieze & Shamir & Upfal, Near-perfect Token Distribution 1994 5 RSA Balister & Bollobas & Stacey, Improved Upper Bounds for the Critical Probability of Oriented Percolation in Two Dimensions 1994 5 RSA Matousek, Lower Bounds for a Subexponential Optimization Algorithm 1994 5 RSA Shelah & Spencer, Random Sparse Unary Predicates 1994 5 RSA Broder & Frieze & Shamir, Finding Hidden Hamiltonian Cycles 1994 5 RSA Goh & Schmutz, Unlabeled Trees: Distribution of the Maximum Degree 1994 5 RSA Awerbuch & Berger & Cowen & Peleg, Low-Diameter Graph Decomposition Is in NC 1994 5 RSA Kenyon & King, On Boolean Decision Trees with Faulty Nodes 1994 5 RSA Pittel & Irving, An Upper bound for the Solvability Probability of a Random Stable Roommates Instance 1994 5 RSA Alon & Roichman, Random Cayley Graphs and Expanders 1994 5 RSA Condon & Hernek, Random Walks on Colored Graphs 1994 5 RSA Pittel, Note on the Heights of Random Recursive Trees and Random m-ary Search Trees 1994 5 RSA Rasmussen, Approximating the Permanent: A Simple Approach 1994 5 RSA Balinska & Quintas & Szymanski, Random Recursive Forests 1994 5 RSA Carr & Goh & Schmutz, The Maximum Degree in a Random Tree and Related Problems 1994 5 RSA Cooper, The Threshold for Hamilton Cycles in the Square of a Random Graph 1994 5 RSA Drmota, The Instability Time Distribution Behavior of Slotted ALOHA 1994 5 RSA Frieze & McKay, Multicolored Trees in Random Graphs 1994 5 RSA Gutjahr, Connection Reliabilities in Stochastic Acyclic Networks 1994 5 RSA Jaworski & Mutatchiev, The Largest Connected Component in a Random Mapping 1994 5 RSA Karrman, An Example of a Superproportional Graph 1994 5 RSA Kemp, Balanced Ordered Trees 1994 5 RSA Kirschenhofer & Prodinger, Multidimentional Digital Searching -- Alternative Data Structures 1994 5 RSA Kolchin, Random Graphs and Systems of Linear Equations in Finite Fields 1994 5 RSA Kostochka, On the Number of Connected Subgraphs with Small Edge-Boundary in Regular Graphs 1994 5 RSA Lynch, An Extension of 0-1 Laws 1994 5 RSA Palacios, Expected Hitting and Cover Times of Random Walks on Some Special Graphs 1994 5 RSA Rodl & Sinajova, Note on Independent Sets in Steiner Systems 1994 5 RSA Shelah & Spencer, Can You Feel the Double Jump? 1994 5 RSA Tomescu, On the Number of Subtrees for Almost All Graphs 1994 5 RSA Tyszkiewicz, Infinitary Queries and Their Asymptotic Probabilities. II. Properties Definable in Least Fixed Point Logic 1994 5 RSA Schmutz, Matchings in Superpositions of (n,n)-Bipartite Trees 1994 5 RSA Erdos & Luczak, Changes of Leadership in a Random Graph Process 1993 4 RSA Lovasz & Simonovits, Random Walks in a Convex Body and an Improved Volume Algorithm 1993 4 RSA Brightwell & Kohayakawa, Ramsey Properties of Orientations of Graphs 1993 4 RSA Dolan & Lynch, The Logic of Ordered Random Structures 1993 4 RSA Gutjahr, Expectation Transfer between Branching Processes and Random Trees 1993 4 RSA Cooper, A Note on the Connectivity of 2-Regular Digraphs 1993 4 RSA Impagliazzo & Nisan, The Effect of Random Restrictions on Formula Size 1993 4 RSA Paterson & Zwick, Shrinkage of de Morgan Formulae under Restriction 1993 4 RSA Mahmoud & Smythe & Szymanski, On the Structure of Random Plane-oriented Recursive Trees and Their Branches 1993 4 RSA Burton & Meester, Long Range Percolation in Stationary Point Processes 1993 4 RSA Atallah & Jacquet & Szpankowski, A Probabilistic Analysis of a Pattern Matching Problem 1993 4 RSA Kostochka & Sapozhenko & Weber, Radius and Diameter of Random Subgraphs of the Hypercube 1993 4 RSA Karlin & Lindqvist & Yao, Markov Chains on Hypercubes: Spectral Representations and Several Majorization Relations 1993 4 RSA Estivill-Castro & Wood, Randomized Adaptive Sorting 1993 4 RSA Mori, How Much Homogeneous Can the Appearing Pattern Be? 1993 4 RSA Janson, Multicyclic Components in a Random Graph Process 1993 4 RSA Ke, The Size Ramsey Number of Trees with Bounded Degree 1993 4 RSA Grabner, Searching for Losers 1993 4 RSA Randall, Efficient Generation of Random Nonsingular Matrices 1993 4 RSA Alon & Goldreich & Hastad & Peralta, Addendum to ``Simple Construction of Almost k-wise Independent Random Variables'' 1992 3 RSA Jerrum, Large Cliques Elude the Metropolis Process 1992 3 RSA Gutjahr, The Variance of Level Numbers in Certain Families of Trees 1992 3 RSA Promel & Steger, Coloring Clique-free Graphs in Linear Expected Time 1992 3 RSA Eaton & Rodl, A Canonical Ramsey Theorem 1992 3 RSA Rhee, On the Travelling Salesperson Problem in Many Dimensions 1992 3 RSA Frieze & Suen, Counting the Number of Hamilton Cycles in Random Digraphs 1992 3 RSA Newman, Chain Lengths in Certain Random Directed Graphs 1992 3 RSA Mahmoud & Smythe, Asymptotic Joint Normality of Outdegrees of Nodes in Random Recursive Trees 1992 3 RSA Barbour, Refined Approximations for the Ewens Sampling Formula 1992 3 RSA Cooper, 1-Pancyclic Hamilton Cycles in Random Graphs 1992 3 RSA Alon & Goldreich & Hastad & Peralta, Simple Constructions of Almost k-wise Independent Random Variables 1992 3 RSA Flajolet & Richmond, Generalized Digital Trees and Their Difference--Differential Equations 1992 3 RSA Arratia & Tavare, Limit Theorems for Combinatorial Structures via Discrete Process Approximations 1992 3 RSA Janson & Spencer, Probabilistic Construction of Proportional Graphs 1992 3 RSA Mazza, Parallel Simulated Annealing 1992 3 RSA Zuyev, Estimates for Distributions of the Voronoi Polygon's Geometric Characteristics 1992 3 RSA Goldreich & Krawczyk, Sparse Pseudorandom Distributions 1992 3 RSA Devroye, A Note on the Probabilistic Analysis of Patricia Trees 1992 3 RSA Calkin & Frieze & Kucera, On the Expected Performance of a Parallel Algorithm for Finding Maximal Independent Subsets of a Random Graph 1992 3 RSA Alon, The Strong Chromatic Number of a Graph 1992 3 RSA Lynch, Probabilities of Sentences about Very Sparse Random Graphs 1992 3 RSA Bollobas & Kohayakawa & Luczak, The Evolution of Random Subgraphs of the Cube 1991 2 RSA Beck, An Algorithmic Approach to the Lovasz Local Lemma. I 1991 2 RSA Alon, A Parallel Algorithmic Version of the Local Lemma 1991 2 RSA Maier, Colliding Stacks: A Large Deviations Analysis 1991 2 RSA Luczak, Cycles in a Random Graph Near the Critical Point 1991 2 RSA Erdos & Kierstead & Trotter, The Dimension of Random Ordered Sets 1991 2 RSA Alon & McDiarmid & Reed, Acyclic Coloring of Graphs 1991 2 RSA Beck, Quasi-Random 2-Colorings of Point Sets 1991 2 RSA Devroye, Limit Laws for Local Counters in Random Binary Search Trees 1991 2 RSA Dolan, A Zero-One Law for a Random Subset 1991 2 RSA Luczak & Cohen, Stability of Vertices in Random Boolean Cellular Automata 1991 2 RSA van den Berg & Meester, Stability Properties of a Flow Process in Graphs 1991 2 RSA Pippenger, The Blocking Probability of Spider-Web Networks 1991 2 RSA Louchard & Schott, Probabilistic Analysis of Some Distributed Algorithms 1991 2 RSA Drmota & Kirschenhofer, On Generalized Independent Subsets of Trees 1991 2 RSA Janson & Kratochvil, Proportional Graphs 1991 2 RSA Bollobas & Frieze, Spanning Maximal Planar Subgraphs of Random Graphs 1991 2 RSA Dyer & Frieze, Probabilistic Analysis of a Parallel Algorithm for Finding the Lexicographically First Depth First Search Tree in a Dense Random Graph 1991 2 RSA Chung, Regularity Lemmas for Hypergraphs and Quasi-randomness 1991 2 RSA Szemeredi's Partition and Quasirandomness 1991 2 RSA Chvatal, Almost All Graphs with 1.44n Edges are 3-Colorable 1991 2 RSA Dyer & Frieze, Randomized Greedy Matching 1991 2 RSA Goh & Schmutz, A Central Limit Theorem on GL_n (F_q) 1991 2 RSA Promel & Steger, Excluding Induced Subgraphs: Quadrilaterals 1991 2 RSA Sidorenko, Inequalities in Probability Theory and Turan-Type Problems for Graphs with Colored Vertices 1991 2 RSA Zhang, A Power Law for Connectedness of Some Random Graphs at the Critical Point 1990 1 RSA Chung, Quasi-random Classes of Hypergraphs 1990 1 RSA Aldous, A Random Tree Model Associated with Random Graphs 1990 1 RSA Barbour & Janson & Karonski & Rucinski, Small Cliques in Random Graphs 1990 1 RSA McDiarmid, On the Chromatic Number of Random Graphs 1990 1 RSA McDiarmid & Reed, Linear Arboricity of Random Regular Graphs 1990 1 RSA Feige & Peleg & Raghavan & Upfal, Randomized Broadcast in Networks 1990 1 RSA Brightwell & Winkler, Maximum Hitting Time for Random Walks on Graphs 1990 1 RSA Szabo, An Application of Lovasz' Local Lemma--A New Lower bound for the van der Waerden Number 1990 1 RSA Bender & Canfield & McKay, The Asymptotic Number of Labeled Connected Graphs with a Given Number of Vertices and Edges 1990 1 RSA Luczak, On the Number of Sparse Connected Graphs 1990 1 RSA Alon, The Number of Spanning Trees in Regular Graphs 1990 1 RSA Furedi, Competition Graphs and Clique Dimensions 1990 1 RSA Devroye, On the Height of Random m-ary Search Trees 1990 1 RSA Spencer, Countable Sparse Random Graphs 1990 1 RSA Bohus, On the Discrepancy of 3 Permutations 1990 1 RSA Janson, Poisson Approximation for Large Deviations 1990 1 RSA Suen, A Correlation Inequality and a Poisson Limit Theorem for Nonoverlapping Balanced Subgraphs of a Random Graph 1990 1 RSA Knuth & Motwani & Pittel, Stable Husbands 1990 1 RSA Janson, A Functional Limit Theorem for Random Graphs with Applications to Subgraph Count Statistics 1990 1 RSA Calkin & Frieze, Probabilistic Analysis of a Parallel Algorithm for Finding Maximal Independent Sets 1990 1 RSA Diaconis & Graham & Morrison, Asymptotic Analysis of a Random Walk on a Hypercube with Many Dimensions 1990 1 RSA Karp, The Transitive Closure of a Random Digraph 1990 1 RSA Bollobas, Complete Matchings in Random Subgraphs of the Cube 1990 1 RSA Chung & Graham, Quasi-Random Hypergraphs 1996 17 RSP Fine, Defining Noninterference in the Temporal Logic of Actions 1996 17 RSP Gollmann, What Do We Mean by Entity Authentication? 1996 17 RSP Zhou & Gollmann, A Fair Non-repudiation Protocol 1996 17 RSP Syverson, Limitations on Design Principles for Public Key Protocols 1996 17 RSP Ammann & Jajodia & Ray, Ensuring Atomicity of Multilevel Transactions 1996 17 RSP D'haeseleer & Forrest & Helman, An Immunological Approach to Change Detection: Algorithms, Analysis, and Implications 1996 17 RSP Young & Yung, Cryptovirology: Extortion-Based Security Threats and Countermeasures 1996 17 RSP Blaze & Feigenbaum & Lacy, Decentralized Trust Management 1996 17 RSP Schneider, Security Properties and CSP 1996 17 RSP Dean & Felten & Wallach, Java Security: From HotJava to Netscape and Beyond 1996 17 RSP Mao, On Two Proposals for On-line Bankcard Payments using Open Networks: Problems and Solutions 1996 17 RSP van Doorn & Abadi & Burrows & Wobber, Secure Network Objects 1995 RSP Franklin & Reiter, The Design and Implementation of a Secure Auction Service 1995 RSP Anderson & Bezuidenhout, Cryptographic Credit Control in Pre-Payment Metering Systems 1993 RSP Reiter & Gong, Preventing Denial and Forgery of Causal Relationships in Distributed Systems 1993 RSP Stubblebine & Gligor, Protocol Design for Integrity Protection 1993 RSP Molva & Tsudik, Authentication Method with Impersonal Token Cards 1993 RSP Piessens & De Decker & Janson, Interconnecting Domains with Heterogeneous Key Distribution and Authentication Protocols 1993 RSP Cuppens, A Logical Analysis of Authorized and Prohibited Information Flows 1993 RSP Horton & Harland & Ashby & Cooper & Hyslop & Nickerson & Stewart & Ward, The Cascade Vulnerability Problem 1993 RSP Yahalom & Klein & Beth, Trust Relationships in Secure Systems--A Distributed Authentication Perspective 1993 RSP Syverson & Meadows, A Logical Language for Specifying Cryptographic Protocol Requirements 1993 RSP Woo & Lam, A Semantic Model for Authentication Protocols 1992 RSP Bellovin & Merritt, Encrypted Key Exchange: Password-Based Protocols Secure Against Dictionary Attacks 1992 RSP Stubblebine & Gligor, On Message Integrity in Cryptographic Protocols 1992 RSP Snekkenes, Roles in Cryptographic Protocols 1992 RSP Gray & Syverson, A Logical Approach to Multilevel Security of Probabilistic Systems 1992 RSP Benson, An Optimal Solution to the Secure Reader-Writer Problem 1991 RSP Gray, Toward a Mathematical Foundation for Information Flow Security 1991 RSP Foley, A Taxonomy for Information Flow Policies and Models 1991 RSP Syverson, The Use of Logic in the Analysis of Cryptographic Protocols 1991 RSP Snekkenes, Exploring the BAN Approach to Protocol Analysis 1991 RSP Tardo & Alagappan, SPX: Global Authentication Using Public Key Certificates 1991 RSP Fritzner & Nilsen & Skomedal, Protecting Security Information in Distributed Systems 1991 RSP Varadharajan & Allen & Black, An Analysis of the Proxy Problem in Distributed Systems 1991 RSP Brown, The Turing Test and Non-Information Flow 1990 RSP Gusfield, A Little Knowledge Goes a Long Way: Faster Detection of Compromised Data in 2-D Tables 1990 RSP Wittbold & Johnson, Information Flow in Nondeterministic Systems 1990 RSP Gray, Probabilistic Interference 1990 RSP Cheng & Gligor, On the Formal Specification and Verification of a Multiparty Session Protocol 1990 RSP Gong & Needham & Yahalom, Reasoning about Belief in Cryptographic Protocols 1990 RSP Turn, Information Privacy Issues for the 1990s 1995 6 RTA Matiyasevich, On Some Mathematical Logic Contributions to Rewriting Techniques: Lost Heritage 1995 6 RTA Stickel, Term Rewriting in Contemporary Resolution Theorem Proving 1995 6 RTA Senizergues, A Polynomial Algorithm Testing Partial Confluence of Basic Semi-Thue Systems 1995 6 RTA Nipkow, Higher-Order Rewrite Systems 1995 6 RTA Walters & Zantema, Rewrite Systems for Integer Arithmetic 1995 6 RTA Abdulrab & Maksimenko, General Solution of Systems of Linear Diophantine Equations and Inequations 1995 6 RTA Otto & Narendran & Dougherty, Some Independence Results for Equational Unification (Extended Abstract) 1993 5 RTA Bachmair, Rewrite Techniques in Theorem Proving 1993 5 RTA Gallier, Proving Properties of Typed Lambda Terms: Realizability, Covers, and Sheaves 1993 5 RTA Dershowitz & Hoot, Topics in Termination 1993 5 RTA Adian, On Some Algorithmic Problems for Groups and Monoids 1993 5 RTA Martin, Linear Interpretations by Counting Patterns 1993 5 RTA Senizergues, Some Undecidable Termination Problems for Semi-Thue Systems 1993 5 RTA Dershowitz & Jouannaud & Klop, More Problems in Rewriting 1991 4 RTA Graf, Left-to-Right Tree Pattern Matching 1991 4 RTA Dershowitz & Jouannand & Klop, Open Problems in Rewriting 1987 RTA O'Donnell, Term-Rewriting Implementation of Equational Logic Programming 1987 RTA Martin, How to Choose the Weights in the Knuth Bendix Ordering 1987 RTA Purdom, Detecting Looping Simplifications 1987 RTA Sopena, Combinatorial Hypermap Rewriting 1987 RTA Otto & Squier, The Word Problem for Finitely Presented Monoids and Finite Canonical Rewriting Systems 1987 RTA Dauchet & De Comite, A Gap Between Linear and Non-Linear Term-Rewriting Systems 1987 RTA Benois, Descendants of Regular Language in a Class of Rewriting Systems: Algorithms and Complexity of an Automata Construction 1987 RTA Madlener & Otto, Groups Presented by Certain Classes of Finite Length-Reducing String Rewriting Systems 1987 RTA Otto, Some Results about Confluence on a Given Congruence Class 1987 RTA Ramesh & Ramakrishnan, Optimal Speedups for Parallel Pattern Matching in Trees 1997 12 RTSYSTS Fetzer & Cristian, Integrating External and Internal Clock Synchronization 1997 12 RTSYSTS Schmid & Schossmaier, Interval-based Clock Synchronization 1997 12 RTSYSTS Dolev, Possible and Impossible Self-Stabilizing Digital Clock Synchronization in General Graphs 1996 11 RTSYSTS Blieberger & Lieger, Worst-Case Space and Time Complexity of Recursive Procedures 1996 10 RTSYSTS Tia & Liu & Shankar, Algorithms and Optimality of Scheduling Soft Aperiodic Requests in Fixed-Priority Preemptive Systems 1992 4 RTSYSTS Baruah & Koren & Mao & Mishra & Raghunathan & Rosier & Shasha & Wang, On the Competitiveness of On-Line Real-Time Task Scheduling 1992 4 RTSYSTS Tindell & Burns & Wellings, Allocating Hard Real-Time Tasks: An NP-Hard Problem Made Easy 1991 3 RTSYSTS Baker, Stack-Based Scheduling of Realtime Processes 1973 RUSTIN9 Hopcroft & Ullman, Fast Algorithms for Set Manipulation 1973 RUSTIN9 Hu, Some Results and Problems in Binary Trees 1973 RUSTIN9 Karp, Two Combinatorial Problems Associated with External Sorting 1973 RUSTIN9 Pratt, A Least Upper Bound on Conventional Shellsort 1973 RUSTIN9 Garey & Graham & Ullman, An Analysis of Some Packing Algorithms 1973 RUSTIN9 Lawler, Polynomial-Bounded and (Apparently) Non-Polynomial-Bounded Matroid Computations 1973 RUSTIN9 O'Neil & O'Neil, A Fast Expected Time Algorithm for Boolean Matrix Multiplication and Transitive Closure 1973 RUSTIN9 Rivest & Floyd, Bounds on the Expected Time for Median Computations (Extended Abstract) 1973 RUSTIN9 Frazer, On Testing a Binary Operation for Associativity 1973 RUSTIN9 Edmonds, Edge-Disjoint Branchings 1973 RUSTIN9 Kleitman, Some Combinatorial Construction Problems 1973 RUSTIN9 Whitehead, Algorithms Associated with Ramsey's Theorem 1973 RUSTIN7 Fischer, Trends in Computational Complexity Theory 1973 RUSTIN7 Blum & Gill, Some Fruitful Areas for Research into Complexity Theory 1973 RUSTIN7 Constable, Two Types of Hierarchy Theorem for Axiomatic Complexity Classes 1973 RUSTIN7 Symes, Two Extensions of Abstract Computational Complexity Theory: To Operators, and To Finite Functions 1973 RUSTIN7 Lynch, A Universally Helped Recursive Set 1973 RUSTIN7 Davis, Speed-Up Theorems and Diophantine Equations 1973 RUSTIN7 Filotti, Generators for the Group of Recursive Permutations 1973 RUSTIN7 Savage, Computational Work and Time 1973 RUSTIN7 Daley, Complexity and Randomness 1973 RUSTIN7 Pager, Further Results on the Problem of Finding Minimal Length Programs for Decision Tables 1973 RUSTIN7 Munro, Problems Related to Matrix Multiplication 1973 RUSTIN7 Spira, On the Number of Comparisons Necessary to Rank an Element 1973 RUSTIN7 Rosenberg, Exploiting Addressability in Data Graphs 1973 RUSTIN7 Young, Easy Constructions in Complexity Theory: Speed-Up and Gap Theorems 1973 RUSTIN7 Irland & Fischer, A Bibliography on Computational Complexity 1972 RUSTIN4 Schwartz, Principles of Specification Language Design with Some Observations Concerning the Utility of Specification Languages 1972 RUSTIN4 Harrison, Declarative and Extendable Languages 1972 RUSTIN4 Manacher, Low Level Data Structure Handling in a High Level Language 1972 RUSTIN4 Strong, Flowchartable Recursive Specification 1972 RUSTIN4 Bruno & Steiglitz, The Expression of Algorithms by Charts 1972 RUSTIN4 Lyons & Bruno, An Interactive System for Program Verification 1985 SALOMAA Salomaa, Computation and Automata 1994 SAMS , The Internet Unleashed 1984 SAMS Waite & Prata & Martin, C Primer Plus 1983 SANKKRUSK Kruskal, An Overview of Sequence Comparison I 1983 SANKKRUSK Erickson & Sellers, Recognition of Patterns in Genetic Sequences 1983 SANKKRUSK Sankoff & Kruskal & Mainville & Cedergren, Fast Algorithms to Determine RNA Secondary Structures Containing Multiple Loops 1983 SANKKRUSK Kruskal & Liberman, The Symmetric Time-Warping Problem: From Continuous to Discrete 1983 SANKKRUSK Hunt & Lennig & Mermelstein, Use of Dynamic Programming in a Syllable-Based Continuous Speech Recognition System 1983 SANKKRUSK Bradley & Bradley, Application of Sequence Comparison to the Study of Bird Songs 1983 SANKKRUSK Wagner, On the Complexity of the Extended String-to-String Correction Problem 1983 SANKKRUSK Noetzel & Selkow, An Analysis of the General Tree-Editing Problem 1983 SANKKRUSK Sankoff & Cedergren, Simultaneous Comparison of Three or More Sequences Related by a Tree 1983 SANKKRUSK Kruskal & Sankoff, An Anthology of Algorithms and Concepts for Sequence Comparison 1983 SANKKRUSK Coggins, Dissimilarity Measures for Clustering Strings 1983 SANKKRUSK Hirschberg, Recent Results on the Complexity of Common-Subsequence Problems 1983 SANKKRUSK Wagner, Formal-Language Error Correction 1983 SANKKRUSK Masek & Paterson, How to Compute String-Edit Distances Quickly 1983 SANKKRUSK Chvatal & Sankoff, An Upper-Bound Technique for Lengths of Common Subsequences 1983 SANKKRUSK Deken, Probabilistic Behavior of Longest-Common-Subsequence Length 1983 SANKKRUSK Sankoff & Mainville, Common Subsequences and Monotone Subsequences 1992 86 SAPM Venturini, Iterates of Number Theoretic Functions with Periodic Rational Coefficients (Generalization of the 3x+1 Problem) 1992 86 SAPM Bonetti & Rota & Senato & Venezia, On the Foundation of Combinatorial Theory. X. A Categorial Setting for Symmetric Functions 1991 84 SAPM Cohen, Moebius Inversion of Random Acyclic Directed Graphs 1970 49 SAPM Paterson, Unsolvability in 3 x 3 matrices 1973 6 SAUTOCONT Vyshyns'kyy & Petushchak, Algorithm for Determination of the Reciprocal of a Number in a Residue Class System 1996 13 SBIA da Costa & Doria, H-Computation 1996 13 SBIA Rocha, Toward a Theory of Molecular Computing 1995 186 SBORNIK Ivanov, The Geometry of Plane Locally Minimal Binary Trees 1994 77 SBORNIK Ivanov & Ptitsyna & Tuzhilin, Classification of Closed Minimal Networks on Flat Two-dimensional Tori 1993 74 SBORNIK Ivanov & Tuzhilin, The Steiner Problem in the Plane or in Plane Minimal Nets 1992 SCARECROW Liang, Mathematical Journals: An Annotated Guide 1996 SCHOLPUB Peek, Scholarly Publishing, Facing the New Frontiers 1996 SCHOLPUB Kling & Lamb, Analyzing Alternate Visions of Electronic Publishing and Digital Libraries 1996 SCHOLPUB Silverman, The Impact of Electronic Publishing on the Academic Community 1996 SCHOLPUB Guedon, The Seminar, the Encyclopedia, and the Eco-Museum as Possible Future Forms of Electronic Publishing 1996 SCHOLPUB Odlyzko, Tragic Loss or Good Riddance? The Impending Demise of Traditional Scholarly Journals 1996 SCHOLPUB Harnad, Implementing Peer Review on the Net: Scientific Quality Control in Scholarly Electronic Journals 1996 SCHOLPUB Hayes, The Economic Quandary of the Network Publisher 1996 SCHOLPUB Lynch, Integrity Issues in Electronic Publishing 1996 SCHOLPUB Freeman, The University Press in the Electronic Future 1996 SCHOLPUB Fuchs, Networked Information Is Not Free 1996 SCHOLPUB Okerson, University Libraries and Scholarly Communication 1996 SCHOLPUB Hurtado, A Consortium for Refereed Electronic Journals 1996 SCHOLPUB Manoff, Revolutionary or Regressive? The Politics of Electronic Collection Development 1996 SCHOLPUB Fisher, Traditional Publishers and Electronic Journals 1996 SCHOLPUB Rowland, The Need for Management of Electronic Journals 1996 SCHOLPUB Guenther, The Challenges of Electronic Texts in the Library: Bibliographic Control and Access 1996 SCHOLPUB Kahin, Scholarly Communication in the Networked Environment: Issues of Principle, Policy, and Practice 1996 SCHOLPUB Lyons, Where Electronic Publications and Television Programs Are Really Computer Programs: Some Copyright Implications 1996 SCHOLPUB Rothman, TeleRead: A Virtual Central Database without Big Brother 1997 276 SCIAM Susskind, Black Holes and the Information Paradox 1997 276 SCIAM Matthews, The Science of Murphy's Law 1997 276 SCIAM Horgan, Profile: Ronald L. Graham 1997 276 SCIAM Editors, The Internet: Bringing Order from Chaos 1997 276 SCIAM Carlson, Algorithm of the Gods 1997 276 SCIAM Crandall, The Challenge of Large Numbers 1996 275 SCIAM Casti, Confronting Science's Logical Limits 1996 275 SCIAM Hawking & Penrose, The Nature of Space and Time 1996 275 SCIAM Leffell & Brash, Sunlight and Skin Cancer 1996 275 SCIAM Okerson, Who Owns Digital Works? 1996 275 SCIAM Fancher, Smart Cards 1996 275 SCIAM Hawking & Penrose, The Nature of Space and Time 1996 275 SCIAM Leffell & Brash, Sunlight and Skin Cancer 1996 275 SCIAM Okerson, Who Owns Digital Works? 1996 274 SCIAM Birman & van Renesse, Software for Reliable Networks 1996 274 SCIAM Stewart, Proof of Purchase on the Internet 1996 274 SCIAM Williams & Woessner, The Real Threat of Nuclear Smuggling 1996 274 SCIAM Mukerjee, Explaining Everything 1995 273 SCIAM Chalmers, The Puzzle of Conscious Experience 1995 273 SCIAM Beth, Confidential Communication on the Internet 1995 273 SCIAM Dawkins, God's Utility Function 1995 273 SCIAM Beek & Lewbel, The Science of Juggling 1995 273 SCIAM Lloyd, Quantum-Mechanical Computers 1995 273 SCIAM Patterson, Microprocessors in 2020 1995 273 SCIAM Zysman, Wireless Networks 1995 273 SCIAM Chan, All-Optical Networks 1995 273 SCIAM Lenat, Artificial Intelligence 1995 273 SCIAM Maes, Intelligent Software 1995 273 SCIAM Laurel, Commentary: Virtual Reality 1995 273 SCIAM Daggatt, Commentary: Satellites for a Developing World 1995 273 SCIAM Whitesides, Self-Assembling Materials 1995 273 SCIAM Prabhakar, Technology Infrastructure 1995 273 SCIAM Norman, Designing the Future 1995 273 SCIAM Lanham, Digital Literacy 1995 273 SCIAM Varian, The Information Economy 1995 273 SCIAM Zuboff, The Emperor's New Workplace 1995 273 SCIAM Lucky, What Technology Alone Cannot Do 1995 273 SCIAM Stewart, Election Fever in Blockvotia 1995 272 SCIAM Nowak & May & Sigmund, The Arithmetics of Mutual Help 1995 272 SCIAM Horgan, From Complexity to Perplexity 1995 272 SCIAM Abu-Mostafa, Machines That Learn from Hints 1995 272 SCIAM Schwartz, The Art Historian's Computer 1995 272 SCIAM Moore, A Brief History of Infinity 1995 272 SCIAM Birge, Protein-Based Computers 1995 272 SCIAM Rothenberg, Ensuring the Longevity of Digital Documents 1994 271 SCIAM Englert & Scully & Walther, The Duality in Matter and Light 1994 271 SCIAM Stix, The Speed of Write 1994 271 SCIAM Linde, The Self-Reproducing Inflationary Universe 1994 271 SCIAM Schattschneider, Escher's Metaphors 1994 271 SCIAM Schiller, Secure Distributed Computing 1994 271 SCIAM McLaughlin, Resolving Zeno's Paradoxes 1994 271 SCIAM Weinberg, Life in the Universe 1994 271 SCIAM Peebles & Schramm & Turner & Kron, The Evolution of the Universe 1994 271 SCIAM Minsky, Will Robots Inherit the Earth? 1994 271 SCIAM Gibbs, Software's Chronic Crisis 1994 270 SCIAM Albert, Bohm's Alternative to Quantum Mechanics 1994 270 SCIAM Krugman & Lawrence, Trade, Jobs and Wages 1994 270 SCIAM Deutsch & Lockwood, The Quantum Physics of Time Travel 1994 270 SCIAM Traub & Wozniakowski, Breaking Intractability 1994 270 SCIAM Renfrew, World Linguistic Diversity 1993 269 SCIAM Strogatz & Stewart, Coupled Oscillators and Biological Synchronization 1993 269 SCIAM Hinton & Plaut & Shallice, Simulating Brain Damage 1993 269 SCIAM Horgan, The Death of Proof 1993 269 SCIAM Chiao & Kwiat & Steinberg, Faster than Light? 1993 269 SCIAM Ditto & Pecora, Mastering Chaos 1993 269 SCIAM Kosko & Isaka, Fuzzy Logic 1993 268 SCIAM Keyes, The Future of the Transistor 1993 268 SCIAM Frith, Autism 1993 268 SCIAM Abramowicz, Black Holes and the Centrifugal Force Paradox 1993 268 SCIAM Rennie, DNA's New Twists 1993 268 SCIAM Ruthen, Adapting to Complexity 1992 267 SCIAM Seyfarth & Cheney, Meaning and Mind in Monkeys 1992 267 SCIAM Littlewood & Strigini, The Risks of Software 1992 267 SCIAM Levinton, The Big Bang of Animal Evolution 1992 267 SCIAM Bennett & Brassard & Ekert, Quantum Cryptography 1992 267 SCIAM Beardsley, Teaching Real Science 1992 267 SCIAM Fischbach, Mind and Brain 1992 267 SCIAM Shatz, The Developing Brain 1992 267 SCIAM Zeki, The Visual Image in Mind and Brain 1992 267 SCIAM Kandel & Hawkins, The Biological Basis of Learning and Individuality 1992 267 SCIAM Damasio & Damasio, Brain and Language 1992 267 SCIAM Goldman-Rakic, Working Memory and the Mind 1992 267 SCIAM Kimura, Sex Differences in the Brain 1992 267 SCIAM Gershon & Rieder, Major Disorders of Mind and Brain 1992 267 SCIAM Selkoe, Aging Brain, Aging Mind 1992 267 SCIAM Hinton, How Neural Networks Learn from Experience 1992 267 SCIAM Crick & Koch, The Problem of Consciousness 1992 267 SCIAM Deutsch, Paradoxes of Musical Pitch 1992 267 SCIAM Chaum, Achieving Electronic Privacy 1992 267 SCIAM Holland, Genetic Algorithms 1992 267 SCIAM Horgan, Quantum Philosophy 1992 266 SCIAM Gutzwiller, Quantum Chaos 1991 265 SCIAM Wallich, Silicon Babies 1991 265 SCIAM Ruthen, Quantum Pinball 1991 265 SCIAM Ross, Endless Endgame? 1991 265 SCIAM Dertouzos, Communications, Computers and Networks 1991 265 SCIAM Cerf, Networks 1991 265 SCIAM Tesler, Networked Computing in the 1990s 1991 265 SCIAM Weiser, The Computer for the 21st Century 1991 265 SCIAM Negroponte, Products and Services for Computer Networks 1991 265 SCIAM Sproull & Kiesler, Computers, Networks and Work 1991 265 SCIAM Malone & Rockart, Computers, Networks and the Corporation 1991 265 SCIAM Kay, Computers, Networks and Education 1991 265 SCIAM Gore, Infrastructure for the Global Village 1991 265 SCIAM Branscomb, Common Law for the Electronic Frontier 1991 265 SCIAM Kapor, Civil Liberties in Cyberspace 1991 264 SCIAM Mahowald & Mead, The Silicon Retina 1991 264 SCIAM Hubbard, The Real Cost of Energy 1991 264 SCIAM Freeman, The Physiology of Perception 1991 264 SCIAM Greenberg, Computers and Architectures 1991 264 SCIAM Richards, The Protein Folding Problem 1991 264 SCIAM Corcoran, Calculating Reality 1990 263 SCIAM Jones, Knot Theory and Statistical Mechanics 1990 263 SCIAM Hsu & Anantharaman & Campbell & Nowatzyk, A Grandmaster Chess Machine 1990 263 SCIAM Horgan, Trends in Cosmology: Universal Truths 1990 263 SCIAM Jurgens & Peitgen & Saupe, The Language of Fractals 1990 263 SCIAM Graham & Spencer, Ramsey Theory 1990 262 SCIAM Corcoran, Not Just a Pretty Face: Compressing Pictures with Fractals 1990 262 SCIAM Wright, The Road to the Global Village 1990 262 SCIAM Searle, Is the Brain's Mind a Computer Program? 1990 262 SCIAM Churchland & Churchland, Could a Machine Think? 1989 SCIAM Wallich, Quantum Cryptography: Single-Photon Communications Can Outwit Eavesdroppers 1989 261 SCIAM Dewdney, Computer Recreations: A Tinkertoy Computer That Plays Tic-Tac-Toe 1989 261 SCIAM Dewdney, Computer Recreations: A Pandora's Box of Minds, Machines and Metaphysics (review of Penrose, The Emperor's New Mind (1989)) 1989 261 SCIAM Gelernter, The Metamorphosis of Information Management 1989 261 SCIAM Alkon, Memory Storage and Neural Systems 1989 261 SCIAM Stein, Spin Glasses 1989 260 SCIAM Bracewell, The Fourier Transform 1989 260 SCIAM Wallich, Beyond Understanding? Computers are Changing the Spirit of Mathematics 1989 260 SCIAM Ottino, The Mixing of Fluids 1989 260 SCIAM Bern & Graham, The Shortest-Network Problem 1988 259 SCIAM Dewdney, Random Walks That Lead to Fractal Crowds 1988 259 SCIAM Dewdney, Computer Recreations: On Making and Breaking Codes: Part II 1988 259 SCIAM Dewdney, Computer Recreations: On Making and Breaking Codes: Part I 1988 259 SCIAM Dewdney, Computer Recreations: Old and New Three-dimensional Mazes 1988 259 SCIAM Chaitin, Randomness in Arithmetic 1988 259 SCIAM Dewdney, Computer Recreations: How To Pan for Primes in Numerical Gravel 1988 258 SCIAM Borwein & Borwein, Ramanujan and Pi 1988 258 SCIAM Bennett, (letter) 1987 257 SCIAM Tank & Hopfield, Collective Computation in Neuronlike Circuits 1987 257 SCIAM Bennett, Demons, Engines and the Second Law 1987 257 SCIAM Dewdney, Computer Recreations: Beauty and Profundity: The Mandelbrot Set and a Flock of its Cousins Called Julia 1987 257 SCIAM Fox & Messina, Advanced Computer Architectures 1987 257 SCIAM Gelernter, Programming for Advanced Computing 1987 257 SCIAM Kahn, Networks for Advanced Computing 1987 257 SCIAM Walker, The Amateur Scientist: Now there is Rubik's Magic, a New Puzzle that Provides a Study in Permutation Operators 1987 257 SCIAM Dewdney, Computer Recreations: ``After MAD'': A Computer Game of Nuclear Strategy that Ends in a Prisoner's Dilemma 1987 256 SCIAM Mishkin & Appenzeller, The Anatomy of Memory 1987 256 SCIAM Hillis, The Connection Machine 1987 256 SCIAM Abu-Mostafa & Psaltis, Optical Neural Computers 1987 256 SCIAM Dewdney, Computer Recreations: The Game Life Acquires Some Successors in Three Dimensions 1987 256 SCIAM Mathews & Pierce, The Computer as a Musical Instrument 1987 256 SCIAM Sander, Fractal Growth 1986 255 SCIAM Crutchfield & Farmer & Packard & Shaw, Chaos 1986 SCIAM Nelson, Quasicrystals 1986 SCIAM Dewdney, Computer Recreations: Wallpaper for the Mind: Computer Images that are Almost, But Not Quite, Repetitive 1986 254 SCIAM Dewdney, Computer Recreations: A Program for Rotating Hypercubes Induces Four-dimensional Dementia 1985 253 SCIAM Gorenstein, The Enormous Theorem 1985 253 SCIAM Berridge, The Molecular Basis of Communication within the Cell 1985 253 SCIAM Wilson, The Molecular Basis of Evolution 1985 253 SCIAM Bennett & Landauer, The Fundamental Physical Limits of Computation 1985 252 SCIAM McEliece, The Reliability of Computer Memories 1984 251 SCIAM Lederman, The Value of Fundamental Science 1984 251 SCIAM Dewdney, Computer Recreations: Yin and Yang: Recursion and Iteration, the Tower of Hanoi and the Chinese Rings 1984 251 SCIAM Becker, Multilingual Word Processing 1984 251 SCIAM Thurston & Weeks, The Mathematics of Three-dimensional Manifolds 1984 251 SCIAM Kay, Computer Software 1984 251 SCIAM Wirth, Data Structures and Algorithms 1984 251 SCIAM Tesler, Programming Languages 1984 251 SCIAM Denning & Brown, Operating Systems 1984 251 SCIAM Winograd, Computer Software for Working with Language 1984 251 SCIAM van Dam, Computer Software for Graphics 1984 251 SCIAM Lesk, Computer Software for Information Management 1984 251 SCIAM Spector, Computer Software for Process Control 1984 251 SCIAM Wolfram, Computer Software in Science and Mathematics 1984 251 SCIAM Lenat, Computer Software for Intelligent Systems 1984 250 SCIAM Hopcroft, Turing Machines 1984 250 SCIAM Friberg, Numbers and Measures in the Earliest Written Records 1984 250 SCIAM Hayes, Computer Recreations: Turning Turtle Gives One a View of Geometry from the Inside Out 1984 250 SCIAM Sloane, The Packing of Spheres 1984 250 SCIAM Hayes, Computer Recreations: On the Ups and Downs of Hailstone Numbers 1980 SCIAM Gardner, Mathematical Games: On the Fine Art of Putting Players, Pills and Points into their Proper Pigeonholes 1980 SCIAM , Fascinatin' Algorithm 1980 SCIAM Matisoo, The Superconducting Computer 1979 241 SCIAM Hellman, The Mathematics of Public-Key Cryptography 1979 241 SCIAM Feldman, Programming Languages 1979 241 SCIAM Gardner, Mathematical Games: The Random Number Omega Bids Fair to Hold the Mysteries of the Universe 1979 241 SCIAM Calder, Constructive Mathematics 1979 240 SCIAM Neuwirth, The Theory of Knots 1979 240 SCIAM Stockmeyer & Chandra, Intrinsically Difficult Problems 1978 SCIAM Graham, The Combinatorial Mathematics of Scheduling 1978 238 SCIAM Lewis & Papadimitriou, The Efficiency of Algorithms 1978 SCIAM Pippenger, Complexity Theory 1978 SCIAM Freedman & van Nieuwenhuizen, Supergravity and the Unification of the Laws of Physics 1977 SCIAM Gardner, Mathematical Games: A New Kind of Cipher that Would Take Millions of Years to Break 1977 SCIAM Appel & Haken, The Solution of the Four-Color-Map Problem 1977 SCIAM Gardner, Mathematical Games: In Which Joining Sets of Points by Lines Leads into Diverse (and Diverting) Paths 1977 SCIAM Gardner, Mathematical Games: On the Paradoxical Situations that Arise from Nontransitive Relations 1977 SCIAM Stewart, Gauss 1977 237 SCIAM Cole & Rubin & Cole, Peer Review and the Support of Science 1977 237 SCIAM Sutherland & Mead, Microelectronics and Computer Science 1977 237 SCIAM Kay, Microelectronics and the Personal Computer 1977 237 SCIAM Knuth, Algorithms 1977 237 SCIAM Fiddes, The Nucleotide Sequence of a Viral DNA 1976 235 SCIAM Gardner, Mathematical Games: In Which ``Monster'' Curves Force Redefinition of the Word ``Curve'' 1976 SCIAM Gardner, Mathematical Games: John Horton Conway's Book Covers an Infinity of Games 1975 233 SCIAM Layzer, The Arrow of Time 1975 232 SCIAM Chaitin, Randomness and Mathematical Proof 1975 232 SCIAM Gardner, Mathematical Games: How the Absence of Anything Leads to Thoughts of Nothing 1993 43 SCIAMLIB Kaufmann & Smarr, Supercomputing and the Transformation of Science 1997 275 SCIENCE Cipra, Taking `Hard' Problems to the Limit 1997 275 SCIENCE Seidenberg, Language Acquisition and Use: Learning and Applying Probabilistic Constraints 1997 275 SCIENCE Prince & Smolensky, Optimality: From Neural Networks to Universal Grammar 1997 275 SCIENCE Trombulak, Teaching Quality (letter) 1997 275 SCIENCE Brassard, Searching a Quantum Phone Book 1997 275 SCIENCE Taubes, Putting a Quantum Computer to Work in a Cup of Coffee 1997 275 SCIENCE Schatz, Information Retrieval in Digital Libraries: Bringing Search to the Net 1997 275 SCIENCE Gershenfeld & Chuang, Bulk Spin-Resonance Quantum Computation 1997 275 SCIENCE Seife, Hedging Bets on Hard Problems 1997 275 SCIENCE Huberman & Lukose & Hogg, An Economics Approach to Hard Computational Problems 1996 274 SCIENCE Cipra, Prime Formula Weds Number Theory and Quantum Physics 1996 274 SCIENCE Bates & Elman, Learning Rediscovered 1996 274 SCIENCE Saffran & Aslin & Newport, Statistical Learning by 8-Month-Old Infants 1996 274 SCIENCE Seife, New Attacks Breach Computer Codes 1996 274 SCIENCE Taubes, To Send Data, Physicists Resort to Quantum Voodoo 1996 274 SCIENCE Barrie & Presti, The World Wide Web as an Instructional Tool 1996 274 SCIENCE Parsons, A Warped View of Time Travel 1996 273 SCIENCE Taubes, All Together for Quantum Computing 1996 273 SCIENCE Lloyd, Universal Quantum Simulators 1996 273 SCIENCE Kardar, Which Came First, Protein Sequence or Structure? 1996 273 SCIENCE Holm & Sander, Mapping the Protein Universe 1996 273 SCIENCE Guarnieri & Fliss & Bancroft, Making DNA Add 1996 272 SCIENCE Marshall, Hot Property: Biologists Who Compute 1996 272 SCIENCE Roush, URI Tries Downsizing by Formula 1996 272 SCIENCE Roush, How Much Is a Program Worth? 1996 272 SCIENCE Cipra, Error-Correcting Code Keeps Quantum Computers on Track 1995 270 SCIENCE Chuang & Laflamme & Shor & Zurek, Quantum Computers, Factoring, and Decoherence 1995 270 SCIENCE Rotberg, Myths About Test Score Comparisons 1995 270 SCIENCE Mann, Security Schemes Aspire to No-Fuss System Protection 1995 270 SCIENCE Noam, Electronics and the Dim Future of the University 1995 270 SCIENCE DiVincenzo, Quantum Computation 1995 269 SCIENCE Taubes, Indexing the Internet 1995 269 SCIENCE Waldrop, On-Line Archives Let Biologists Interrogate the Genome 1995 269 SCIENCE Glanz, Computer Scientists Rethink Their Discipline's Foundations 1995 269 SCIENCE Williams & Steinbock & Showalter, Minimal Path Algorithms (letters) 1995 269 SCIENCE Glanz, A Quantum Leap for Computers? 1995 269 SCIENCE Glanz, Keeping Secrets Safe From Quantum Code-Cracking 1995 268 SCIENCE Cohen, The Culture of Credit 1995 268 SCIENCE Pool, A Boom in Plans for DNA Computing 1995 268 SCIENCE Pool, Getting Satisfaction From DNA 1995 268 SCIENCE Lipton, DNA Solution of Hard Computational Problems 1995 268 SCIENCE Siegelmann, Computation Beyond the Turing Limit 1995 267 SCIENCE Cipra, At Math Meetings, Enormous Theorem Eclipses Fermat 1995 267 SCIENCE Germain, Guarding Against Internet Intruders 1995 267 SCIENCE Germain, Learning to Live With a Fire Wall 1994 266 SCIENCE Gifford, On the Path to Computation with DNA 1994 266 SCIENCE Fox & Lancaster, Neuroscience on the Net 1994 266 SCIENCE Adleman, Molecular Computation of Solutions to Combinatorial Problems 1994 264 SCIENCE Cipra, Pinning Down a Treacherous Border in Logical Statements 1994 264 SCIENCE Kirkpatrick & Selman, Critical Behavior in the Satisfiability of Random Boolean Expressions 1994 264 SCIENCE Salton & Allan & Buckley & Singhal, Automatic Analysis, Theme Generation, and Summarization of Machine-Readable Texts 1992 257 SCIENCE Barton & Benner & Cohen & Gonnet, Computer Speed and Sequence Comparison (letters) 1992 257 SCIENCE Marshall & Palca, Cracks in the Ivory Tower 1992 255 SCIENCE ISI, The World's Most Prolific Scientists 1991 254 SCIENCE Mac Lane, The Need for Mandatory Retirement for Tenured Faculty (letter) 1991 254 SCIENCE Pearson & Maidak & Chipperfield & Robbins, The Human Genome Initiative--Do Databases Reflect Current Progress? 1991 253 SCIENCE Hoffman, Straightening Out the Protein Folding Puzzle 1991 253 SCIENCE Freedman, A Painless Route to Parallel Computing? 1991 253 SCIENCE Brooks, New Approaches to Robotics 1991 253 SCIENCE Fisher & Rau, Instruction-Level Parallel Processing 1991 253 SCIENCE Joshi, Natural Language Processing 1991 253 SCIENCE Aloimonos & Rosenfeld, Computer Vision 1991 253 SCIENCE Major & Turcotte & Gautheret & Lapalme & Fillion & Cedergren, The Combination of Symbolic and Numerical Computation for Three-Dimensional Modeling of RNA 1991 253 SCIENCE Salton, Developments in Automatic Text Retrieval 1991 253 SCIENCE Rees & Smith, The End of Mandatory Retirement for Tenured Faculty 1991 253 SCIENCE Schrage, Computer Tools for Thinking in Tandem 1991 253 SCIENCE Anderson, Networks for Thinking in Cliques? 1991 253 SCIENCE Bowie & Luthy & Eisenberg, A Method to Identify Protein Sequences That Fold into a Known Three-Dimensional Structure 1991 253 SCIENCE Flam, Quantum Cryptography's Only Certainty: Secrecy 1991 252 SCIENCE Anderson, No Citation Analyses Please, We're British 1991 252 SCIENCE Cipra, Mathematician, Heal Thyself 1991 251 SCIENCE Borstel, An Analysis of Citation Analysis (letter) 1991 251 SCIENCE Moffat, Early Detection Nips Math Problems in the Bud 1991 251 SCIENCE Holden, Ph.D.'s: Do We Need More, or Is Fewer Better? 1991 251 SCIENCE Feldman, review of Newell, Unified Theories of Cognition (Harvard University Press, 1990) 1991 251 SCIENCE Koshland, Teaching and Research 1991 251 SCIENCE Pool, Science Literacy: The Enemy Is Us; Science's Top 20 Greatest Hits 1991 251 SCIENCE Cipra, The Breaking of a Mathematical Curse 1990 250 SCIENCE Hamilton, Publishing by--and for?--the Numbers 1990 250 SCIENCE Denning & Tichy, Highly Parallel Computation 1990 249 SCIENCE Cipra, A New Wave in Applied Mathematics 1990 248 SCIENCE Cipra, How to Catch a Cheating Computer 1990 248 SCIENCE Palca, Getting Together Bit by Bit 1990 247 SCIENCE Bowie & Reidhaar-Olson & Lim & Sauer, Deciphering the Message in Protein Sequences: Tolerance to Amino Acid Substitutions 1990 247 SCIENCE Cipra, Packing Your n-Dimensional Marbles 1990 247 SCIENCE Cipra, Mathematics Untwists the Double Helix 1990 247 SCIENCE Barinaga, Neuroscience Models the Brain 1989 245 SCIENCE Cipra, Say It Again in Plain Algebra 1989 245 SCIENCE Parthenopoulos & Rentzepis, Three-Dimensional Optical Storage Memory 1989 245 SCIENCE Cipra, How the Grinch Stole Mathematics 1989 245 SCIENCE Marshall, NSF Peer Review Under Fire from Nader Group 1989 245 SCIENCE Pool, Chaos Theory: How Big an Advance? 1989 244 SCIENCE Abelson, Combating High Journal Costs 1989 244 SCIENCE Holden, Computers Make Slow Progress in Class 1989 244 SCIENCE Cipra, Do Mathematicians Still Do Math? 1989 244 SCIENCE Cipra, The Sorcerer's Apprentice 1989 244 SCIENCE Pool, Can You Help the Mets by Watching on TV? 1989 244 SCIENCE Cipra, The Circle Can Be Squared! 1989 243 SCIENCE Skinner, Teaching Machines (letter) 1989 243 SCIENCE Cipra, From Real Numbers to Strings of Zeros: Computing over the Reals; Information-Based Complexity; Progress in Progressions; Zeta Zero 1989 243 SCIENCE Foster & Bau, Software Reviews: Symbolic Manipulation Programs for the Personal Computer 1989 243 SCIENCE Roberts, Are Neural Nets Like the Human Brain? 1989 243 SCIENCE Ornstein, Ergodic Theory, Randomness, and ``Chaos'' 1989 243 SCIENCE Marshall, NSF Opens High-Speed Computer Network 1989 243 SCIENCE Foster & Bau, Symbolic Manipulation Programs for the Personal Computer (comparative review) 1988 242 SCIENCE Cipra, PCs Factor a ``Most Wanted'' Number 1988 242 SCIENCE Cipra, Souping Up the Sieve 1988 242 SCIENCE Rivest, Factoring and Cryptography (letter) 1988 242 SCIENCE Cipra, Computer Search Solves an Old Math Problem 1988 242 SCIENCE Axelrod & Dion, The Further Evolution of Cooperation 1988 242 SCIENCE Odum, Self-Organization, Transformity, and Information 1988 242 SCIENCE Cipra, Mathematicians Reach Factoring Milestone 1988 241 SCIENCE Waldrop, Soar: A Unified Theory of Cognition? 1988 241 SCIENCE Waldrop, Toward a Unified Theory of Cognition 1988 241 SCIENCE Cipra, To Have and Have Knot: When Are Knots Alike? 1988 241 SCIENCE Sejnowski & Koch & Churchland, Computational Neuroscience 1988 240 SCIENCE Cipra, Fermat's Last Theorem Remains Unproved 1988 240 SCIENCE Foster, Software Reviews: Equation-Solving Programs for the Personal Computer 1988 240 SCIENCE Steen, The Science of Patterns 1988 240 SCIENCE DeLisi, Computers in Molecular Biology: Current Applications and Emerging Trends 1987 237 SCIENCE Steen, Mathematics Education: A Predictor of Scientific Competitiveness 1987 236 SCIENCE Stewart, Solving Linear Equations (letter) 1987 236 SCIENCE Pan & Reif, Solving Linear Equations (letter) 1987 235 SCIENCE Kolata, Progress on Fermat's Famous Math Problem 1987 SCIENCE Kolata, Order Out of Chaos 1986 233 SCIENCE Kolata, Prime Tests and Keeping Proofs Secret 1986 233 SCIENCE Kolata, Faster Division with Computers 1986 232 SCIENCE Kolata, Factoring on Microcomputers 1986 231 SCIENCE Kolata, What Does It Meat to Be Random? 1984 225 SCIENCE Kolata, A Fast Way to Solve Hard Problems 1983 221 SCIENCE Kolata, Number Theory Problem Is Solved 1983 SCIENCE Kolata, Scheme to Foil Software Pirates 1982 218 SCIENCE Kolata, Does Goedel's Theorem Matter to Mathematics? 1982 216 SCIENCE Kolata, New Code Is Broken 1982 215 SCIENCE Branscomb, Electronics and Computers: An Overview 1982 215 SCIENCE Birnbaum, Computers: A Survey of Trends and Limitations 1982 215 SCIENCE Whitted, Some Recent Advances in Computer Graphics 1982 215 SCIENCE Bacon, Software 1982 215 SCIENCE Kernighan & Morgan, The UNIX Operating System: A Model for Software Design 1981 214 SCIENCE Kolata, Cryptographers Gather to Discuss Research 1980 210 SCIENCE Inman, Cryptography Research Funding (letter to the editor) 1980 209 SCIENCE Kolata, Testing for Primes Gets Easier 1980 209 SCIENCE Kolata, Cryptography: A New Clash Between Academic Freedom and National Security 1980 208 SCIENCE Kolata, Prior Restraints on Cryptography Considered 1979 206 SCIENCE Kolata, Mathematicians Amazed by Russian's Discovery 1979 206 SCIENCE Wolfe, The ``Ellipsoid Algorithm'' (letter to the editor) 1979 206 SCIENCE Blum & Gacs & Levin, Contribution to the Ellipsoid Algorithm (letter to the editor) 1979 203 SCIENCE Branscomb, Information: The Ultimate Frontier 1978 202 SCIENCE Kolata, Computer Science: Surprisingly Fast Algorithms 1978 200 SCIENCE Kolata, Cryptology: A Secret Meeting at IDA 1978 199 SCIENCE Kolata, Information Theory: A Surprising Proof 1978 199 SCIENCE Kolata, A New, Rapid Method for Fourier Transforms 1976 193 SCIENCE Kolata, the Four-Color Conjecture: A Computer-Aided Proof 1969 165 SCIENCE Newell, review of Minsky and Papert (1969) 1965 150 SCIENCE Forscher, Rules for Referees 1996 150 SCINEWS Peterson, Computing with DNA: Getting DNA-based Computers Off the Drawing Board and Into the Wet Lab 1996 149 SCINEWS Peterson, Cutting the Energy of Communicating Bits 1990 137 SCINEWS Peterson, Bitws of Uncertainty: Quantum Security 1988 133 SCINEWS Peterson, Computing a Bit of Security 1987 131 SCINEWS Peterson, Zeroing in on Chaos 1981 120 SCINEWS Peterson, Whom Do You Trust? 1976 109 SCINEWS Steen, Computational Unsolvability 1996 27 SCIPROG Watson & Zwaan, A Taxonomy of Sublinear Multiple Keyword Pattern Matching Algorithms 1996 27 SCIPROG Katoen & Schoenmakers, Systolic Arrays for the Recognition of Permutation-Invariant Segments 1996 27 SCIPROG Segers & Ebergen, Design and Analysis of Up-Down Counters 1996 27 SCIPROG Duggan & Bent, Explaining Type Inference 1996 26 SCIPROG Bird, Functional Algorithm Design 1996 26 SCIPROG Achatz & Schulte, Massive Parallelization of Divide-and-Conquer Algorithms 1996 26 SCIPROG Berghammer & von Karger, Towards a Design Calculus for CSP 1996 26 SCIPROG Apt, Arrays, Bounded Quantification and Iteration in Logic and Constraint Logic Programming 1996 26 SCIPROG Coquand, An Algorithm for Type-Checking Dependent Types 1996 26 SCIPROG Monin, Exceptions Considered Harmless 1996 26 SCIPROG Curtis & Lowe, Proofs with Graphs 1996 26 SCIPROG Doornbos & Backhouse, Reductivity 1996 26 SCIPROG Stolen, Refinement Principles Supporting the Transition from Asynchronous Unbounded to Synchronous Communication 1995 25 SCIPROG Abadi & Cardelli, A Theory of Primitive Objects: Second Order Systems 1995 25 SCIPROG Andrews, Foundational Issues in Implementing Constraint Logic Programming Systems 1995 25 SCIPROG Bidoit & Hennicker & Wirsing, Behavioural and Abstractor Specifications 1995 25 SCIPROG Giegerich & Kurtz, A Comparison of Imperative and Purely Functional Suffix Tree Constructions 1995 25 SCIPROG Hankin & Le Metayer, Lazy Type Inference and Program Analysis 1995 25 SCIPROG Jay, A Semantics for Shape 1995 25 SCIPROG Prasad, A Calculus of Broadcasting Systems 1995 25 SCIPROG Moir & Anderson, Wait-free Algorithms for Fast, Long-lived Renaming 1995 25 SCIPROG Madhukar & Kumar & Rangan & Sundar, Systematic Design of an Algorithm for Biconnected Components 1995 24 SCIPROG Bloom & Paige, Transformational Design and Implementation of a New Efficient Solution to the Ready Simulation Problem 1995 24 SCIPROG Banach, On Regularity in Software Design 1995 24 SCIPROG Kaldewaij & de Vries, The Matrix as In-Situ Data Structure 1995 24 SCIPROG Scholefield, Proving Properties of Real-time Semaphores 1995 24 SCIPROG van Emde Boas, review of Rawlins, Compared to what? An Introduction to the Analysis of Algorithms (Freeman, 1992) 1995 24 SCIPROG Liu & Teitelbaum, Systematic Derivation of Incremental Programs 1994 23 SCIPROG Gibbons & Cai & Skillicorn, Efficient Parallel Algorithms for Tree Accumulations 1994 22 SCIPROG Backhouse & van den Eijnde & van Gasteren, Calculating Path Algorithms 1994 22 SCIPROG Gardiner & Martin & de Moor, An Algebraic Construction of Predicate Transformers 1994 22 SCIPROG Lukkien, Operational Semantics and Generalized Weakest Preconditions 1994 22 SCIPROG Moller & Russling, Shorter Paths to Graph Algorithms 1993 21 SCIPROG Singh & Gouda, Rankers: A Classification of Synchronization Problems 1993 21 SCIPROG De Francesco & Montanari & Yankelevich, Axiomatizing CCS, Nets and Processes 1993 21 SCIPROG Abadi & Burrows & Kaufman & Lampson, Authentication and Delegation with Smart-Cards 1993 21 SCIPROG Steffen, Generating Data Flow Analysis Algorithms from Modal Specifications 1993 21 SCIPROG Mitchell, On Abstraction and the Expressive Power of Programming Languages 1993 21 SCIPROG Nishizaki, Programs with Continuations and Linear Logic 1993 21 SCIPROG Gribomont, Concurrency Without Toil: A Systematic Method for Parallel Program Design 1993 21 SCIPROG Moller, Towards Pointer Algebra 1992 19 SCIPROG Anderson & Groselj, Beyond Atomic Registers: Bounded Wait-free Implementations of Nontrivial Objects 1992 18 SCIPROG Bouajjani & Fernandez & Halbwachs & Raymond & Ratel, Minimal State Graph Generation 1992 18 SCIPROG Gardiner & Pandya, Reasoning Algebraically about Recursion 1992 18 SCIPROG Bird, The Smallest Upravel 1992 18 SCIPROG Boiten & Reade, Balanced Trees with Removals: An Exercise in Rewriting and Proof 1992 18 SCIPROG Maassen, Parallel Programming with Data Structures and Higher Order Functions 1992 18 SCIPROG Zantema, Longest Segment Problems 1992 18 SCIPROG Mili & Mili, Heuristics for Constructing While Loops 1992 18 SCIPROG Heisel, Formalizing and Implementing Gries' Program Development in Dynamic Logic 1991 16 SCIPROG Montenyohl & Wand, Correctness of Static Flow Analysis in Continuation Semantics 1990 15 SCIPROG Hofstee & Martin & van de Snepscheut, Distributed Sorting 1990 15 SCIPROG Benaini & Quinton & Robert & Saouter & Tourancheau, Synthesis of a New Systolic Architecture for the Algebraic Path Problem 1990 15 SCIPROG Kaldewaij & Zwaan, A Systolic Design for Acceptors of Regular Languages 1990 15 SCIPROG Ebergen & Hoogerwoord, A Derivation of a Serial-Parallel Multiplier 1990 15 SCIPROG Chen & Udding, Program Inversion: More than Fun 1990 15 SCIPROG van den Eijnde, Left-Bottom and Right-Top Segments 1990 15 SCIPROG Bush, review of van Amstel & Poirters, The Design of Data Structures and Algorithms, Prentice-Hall, 1989 1990 15 SCIPROG Pratt, review of Penrose, The Emperor's New Mind, Oxford University Press, 1989 1990 14 SCIPROG Chandy, Reasoning about Continuous Systems 1990 14 SCIPROG Hehner, A Practical Theory of Programming 1990 14 SCIPROG Misra, Specifying Concurrent Objects as Communicating Processes 1990 14 SCIPROG Gribomont, Stepwise Refinement and Concurrency: The Finite-State Case 1990 14 SCIPROG Kaldewaij & Rem, The Derivation of Systolic Computations 1990 14 SCIPROG Kaldewaij & Schoenmakers, Searching by Elimination 1990 14 SCIPROG Malcolm, Data Structures and Program Transformation 1990 14 SCIPROG Morgan & Vickers, Types and Invariants in the Refinement Calculus 1990 14 SCIPROG Smith & Lowry, Algorithm Theories and Design Tactics 1990 13 SCIPROG Back & Sere, Stepwise Refinement of Parallel Algorithms 1990 13 SCIPROG Fernandez, An Implementation of an Efficient Algorithm for Bisimulation Equivalence 1989 13 SCIPROG Andrews, A Method for Solving Synchronization Problems 1989 13 SCIPROG Arnold, An Example of Sequentialization of a Parallel Algorithm 1989 12 SCIPROG van der Woude, Playing with Patterns, Searching for Strings 1989 12 SCIPROG Shawe-Taylor, review of Seberry and Pieprzyk, Cryptography: An Introduction to Computer Security (1988) 1989 12 SCIPROG Bird & Gibbons & Jones, Formal Derivation of a Pattern Matching Algorithm 1989 12 SCIPROG Aretz, A New Approach to Earley's Parsing Algorithm 1989 12 SCIPROG Nipkow, Equational Reasoning in Isabelle 1989 12 SCIPROG Gries & Martin & van de Snepscheut & Udding, An Algorithm for Transitive Reduction of an Acyclic Graph 1989 12 SCIPROG Wallis, review of Wirth, algorithms and Data Structures (1986) 1989 12 SCIPROG Bailes, review of Bird and Wadler, Introduction to Functional Programming (1988) 1989 12 SCIPROG Mili, review of Dijkstra and Feijen, A Method of Programming (1988) 1989 12 SCIPROG Hall, review of Hennessy, Algebraic Theory of Processes (1988) 1989 12 SCIPROG Jackson, review of Mills, Software Productivity (1988) 1988 11 SCIPROG Xue & Gries, Developing a Linear Algorithm for Cubing a Cyclic Permutation 1988 11 SCIPROG Martin, review of Gallier (1986) 1988 11 SCIPROG Brookes, review of Schmidt (1986) 1988 11 SCIPROG Mateti & Manghirmalani, Morris' Tree Traversal Algorithm Reconsidered 1988 10 SCIPROG Tel & Tan & van Leeuwen, The Derivation of Graph Marking Algorithms from Distributed Termination Detection Protocols 1988 10 SCIPROG Mason, Verification of Programs that Destructively Manipulate Data 1987 9 SCIPROG Dijkstra, A Heuristic Explanation of Batcher's Baffler 1987 9 SCIPROG Pepper, A Simple Calculus for Program Transformation (Inclusive of Induction) 1987 9 SCIPROG Fokkinga, A Correctness Proof of Sorting by Means of Formal Procedures 1987 9 SCIPROG Boullier & Jourdan, A New Error Repair and Recovery Scheme for Lexical and Syntactic Analysis 1987 9 SCIPROG Morris, A Theoretical Basis for Stepwise Refinement and the Programming Calculus 1987 9 SCIPROG Sun & Huang, Deriving Some Expansion Theorems for Nonlinear Functional Equations by an Algorithm 1987 9 SCIPROG Pritchard, Linear Prime-Number Sieves: A Family Tree 1987 9 SCIPROG Manna & Waldinger, The Origin of a Binary-Search Paradigm 1987 9 SCIPROG Kaldewaij, Some Algorithms Based on the Dual of Dilworth's Theorem 1987 8 SCIPROG Smith, Applications of a Strategy for Designing Divide-and-Conquer Algorithms 1987 8 SCIPROG Harel, Statecharts: A Visual Formalism for Complex Systems 1987 8 SCIPROG Emerson & Lei, Modalities for Model Checking: Branching Time Logic Strikes Back 1987 8 SCIPROG Gries & Prins, McLaren's Masterpiece 1996 11 SCT Agrawal & Allender, An Isomorphism Theorem for Circuit Complexity 1996 11 SCT Caussinus & McKenzie & Therien & Vollmer, Nondeterministic NC^1 Computation 1996 11 SCT Iwama & Iwamoto, Parallel Complexity Hierarchies Based on PRAMs and DLOGTIME-Uniform Circuits 1996 11 SCT Gottlob, Collapsing Oracle-Tape Hierarchies 1996 11 SCT Nisan, Extracting Randomness: How and Why -- A survey 1996 11 SCT Feigenbaum & Fortnow & Laplante & Naik, On Coherence, Random-self-reducibility, and Self-correction 1996 11 SCT Feige & Verbitsky, Error Reduction by Parallel Repetition -- A Negative Result (Preliminary version) 1996 11 SCT Schafer, Deciding the Vapnik-Cervonenkis Dimension is Sigma^p_3-complete 1996 11 SCT Koiran, VC Dimension in Circuit Complexity 1996 11 SCT van Melkebeek, Reducing P to a Sparse Set using a Constant Number of Queries Collapses P to L 1996 11 SCT Fortnow & Goldsmith & Mahaney, L-Printable Sets (Extended Abstract) 1996 11 SCT Vinay, Hierarchies of Circuit Classes that are Closed under Complement 1996 11 SCT Veith, Succinct Representation, Leaf Languages, and Projection Reductions 1996 11 SCT Saks, Randomization and Derandomization in Space-Bounded Computation 1996 11 SCT Ko & Weihrauch, On the Measure of Two-Dimensional Regions with Polynomial-Time Computable Boundaries 1996 11 SCT Lautemann & Schwentick & Stewart, On Positive P 1996 11 SCT Ambos-Spies & Mayordomo & Zheng, A Comparison of Weak Completeness Notions 1996 11 SCT Wang, The Law of the Iterated Logarithm for p-Random Sequences 1996 11 SCT Schuler, Truth-table Closure and Turing Closure of Average Polynomial Time Have Different Measures in EXP 1996 11 SCT Selman, Much Ado about Functions 1996 11 SCT Fenner & Fortnow & Naik & Rogers, Inverting Onto Functions 1996 11 SCT Naik & Selman, A Note on P-selective sets and on Adaptive versus Nonadaptive Queries to NP 1996 11 SCT Buss & Pitassi, Good Degree Bounds on Nullstellensatz Refutations of the Induction Principle 1996 11 SCT Papadimitriou, The Complexity of Knowledge Representation 1996 11 SCT Barland & Kolaitis & Thakur, Integer Programming as a Framework for Optimization and Approximability 1996 11 SCT Fenner & Green & Homer & Selman & Thierauf & Vollmer, Complements of Multivalued Functions 1996 11 SCT Agrawal & Arvind, A Note on Decision versus Search for Graph Automorphism 1996 11 SCT Feige & Kilian, Zero Knowledge and the Chromatic Number (Preliminary Version) 1996 11 SCT Bach & Condon & Glaser & Tanguay, DNA Models and Algorithms for NP-complete Problems 1996 11 SCT Li & Vitanyi, Reversible Simulation of Irreversible Computation 1995 10 SCT Etessami, Counting Quantifiers, Successor Relations, and Logarithmic Space 1995 10 SCT Zimand, Weighted NP Optimization Problems: Logical Definability and Approximatin Properties 1995 10 SCT Iwama & Miyano, Intractability of Read-Once Resolution 1995 10 SCT Royer, Semantics versus Syntax versus Computations 1995 10 SCT Regan, On Superlinear Lower Bounds in Complexity Theory 1995 10 SCT Gal & Szegedy, Fault Tolerant Circuits and Probabilistically Checkable Proofs 1995 10 SCT Ben-Asher & Newman, Decision Trees with AND, OR Queries (Extended Abstract) 1995 10 SCT Gal, Semi-unbounded Fan-in Circuits: Boolean vs. Arithmetic 1995 10 SCT Rogers, The Isomorphism Conjecture Holds and One-way Functions Exist Relative to an Oracle 1995 10 SCT Fenner, Inverting the Turing Jump in Complexity Theory 1995 10 SCT Kummer, The Instance Complexity Conjecture (Preliminary version) 1995 10 SCT Beigel & Gasarch & Kinber, Frequency Computation and Bounded Queries 1995 10 SCT Impagliazzo, A Personal View of Average-Case Complexity 1995 10 SCT Schuler & Watanabe, Towards Average-Case Complexity Analysis of NP Optimization Problems 1995 10 SCT Ambos-Spies, Resource-Bounded Genericity 1995 10 SCT Fenner, Resource-Bounded Baire Category: A Stronger Approach 1995 10 SCT Balcazar & Mayordomo, A Note on Genericity and Bi-Immunity 1995 10 SCT Buhrman & Mayordomo, An Excursion to the Kolmogorov Random Strings 1995 10 SCT Han & Thierauf, Restricted Information from Nonadaptive Queries to NP 1995 10 SCT Agarwal & Condon, On Approximation Algorithms for Hierarchical MAX-SAT 1995 10 SCT Feigenbaum & Koller & Shor, A Game-Theoretic Classification of Interactive Complexity Classes (Extended Abstract) 1995 10 SCT Lin, Optimizing TRIEs for Ordered Pattern Matching is Pi_2^P-Complete 1995 10 SCT Kobler, On the Structure of Low Sets 1995 10 SCT Tran, On P-Immunity of Nondeterministic Complete Sets 1995 10 SCT Agrawal & Arvind, Reductions of Self-Reducible Sets to Depth-1 Weighted Threshold Circuit Classes, and Sparse Sets 1995 10 SCT Beigel & Straubing, The Power of Local Self-Reductions 1995 10 SCT Chang & Gasarch & Toran, On Finding the Number of Graph Automorphisms 1995 10 SCT Hertrampf & Vollmer & Wagner, On the Power of Number-Theoretic Operations with Respect to Counting 1995 10 SCT Agrawal, DSPACE(n) =? NSPACE(n): A Degree Theoretic Characterization 1995 10 SCT Lutz, A Small Span Theorem for P/Poly-Turing Reductions 1994 9 SCT Ogihara, Polynomial-time Membership Comparable Sets 1994 9 SCT Beigel & Kummer & Stephan, Approximable Sets (Preliminary version) 1994 9 SCT Agrawal & Arvind, Polynomial Time Truth-table Reductions to P-selective Sets 1994 9 SCT Chang, On the Query Complexity of Clique Size and Maximum Satisfiability 1994 9 SCT Buhrman & Kadin & Thierauf, On Functions Computable with Nonadaptive Queries to NP 1994 9 SCT Mocas, Using Bounded Query Classes to Separate Classes in the Exponential Time Hierarchy from Classes in PH 1994 9 SCT Wigderson, NL/poly subseteq parity-L/poly (Preliminary Version) 1994 9 SCT Liskiewicz & Reischuk, The Complexity World below Logarithmic Space 1994 9 SCT Lipton, Some Consequences of Our Failure to Prove Non-Linear Lower Bounds on Explicit Functions 1994 9 SCT Impagliazzo & Raz & Wigderson, A Direct Product Theorem 1994 9 SCT Ben-David & Karchmer & Kushilevitz, On Ultrafilters and NP 1994 9 SCT Lange & Rossmanith, Unambiguous Polynomial Hierarchies and Exponential Size 1994 9 SCT Buhrman & Torenvliet, On the Structure of Complete Sets 1994 9 SCT Beigel & Goldsmith, Downward Separation Fails Catastrophically for Limited Nondeterminism Classes 1994 9 SCT Fortnow & Yamakami, Generic Separations 1994 9 SCT Lutz, Weakly Hard Problems 1994 9 SCT Kautz & Miltersen, Relative to a Random Oracle, NP Is Not Small 1994 9 SCT Barrington & Immerman, Time, Hardware, and Uniformity 1994 9 SCT Yu & Yung, Space Lower-Bounds for Pseudorandom-Generators 1994 9 SCT Meyer, Constructive Separation of Classes of Indistinguishable Ensembles 1994 9 SCT Watanabe, Test Instance Generation for Promised NP Search Problems 1994 9 SCT Buhrman & Orponen, Random Strings Make Hard Instances 1994 9 SCT Hertrampf, Complexity Classes Defined via k-valued Functions 1994 9 SCT Borchert, Predicate Classes and Promise Classes 1994 9 SCT Jenner & McKenzie & Therien, Logspace and Logtime Leaf Languages 1994 9 SCT Compton & Gradel, Logical Definability of Counting Functions 1994 9 SCT Allender & Ogihara, Relationships Among PL, #L, and the Determinant 1994 9 SCT Condon & Feigenbaum & Lund & Shor, Random Debaters and the Hardness of Approximating Stochastic Functions (Extended Abstract) 1994 9 SCT Kiwi & Lund & Russell & Spielman & Sundaram, Alternation in Interaction 1994 9 SCT Verbitsky, Towards the Parallel Repetition Conjecture 1994 9 SCT Tardos, Multi-Prover Encoding Schemes and Three-Prover Proof Systems 1994 9 SCT Papadimitriou & Tsitsiklis, The Complexity of Optimal Queueing Network Control 1994 9 SCT Gavalda, The Complexity of Learning with Queries 1994 9 SCT Agrawal, On the Isomorphism Problem for Weak Reducibilities (Extended Abstract) 1994 9 SCT Hunt & Marathe & Stearns, Generalized CNF Satisfiability Problems and Non-Efficient Approximability (Preliminary Version) 1994 9 SCT Joseph & Pruim & Young, Collapsing Degrees In Subexponential Time 1994 9 SCT Pudlak, Complexity Theory and Genetics (preliminary version) 1993 8 SCT Cai, Towards Uncheatable Benchmarks 1993 8 SCT Papadimitriou & Yannakakis, On Limited Nondeterminism and the Complexity of the V-C Dimension (Extended Abstract) 1993 8 SCT Fagin & Stockmeyer & Vardi, On Monadic NP versus Monadic co-NP (Extended Abstract) 1993 8 SCT Kolaitis & Thakur, Polynomial-Time Optimization, Parallel Approximation, and Fixpoint Logic (Extended Abstract) 1993 8 SCT Buhrman & van Helden & Torenvliet, P-Selective Self-Reducible Sets: A New Characterization of P 1993 8 SCT Naik & Ogiwara & Selman, P-Selective Sets, and Reducing Search to Decision vs. Self-Reducibility 1993 8 SCT Belanger & Wang, Isomorphisms of NP Complete Problems on Random Instances 1993 8 SCT Agrawal & Biswas, Polynomial Isomorphism of 1-L-Complete Sets 1993 8 SCT Beigel, The Polynomial Method in Circuit Complexity 1993 8 SCT Tsai, Lower Bounds on Representing Boolean Functions as Polynomials in Z_m 1993 8 SCT Karchmer & Wigderson, On Span Programs 1993 8 SCT Karchmer, On Proving Lower Bounds for Circuit Size 1993 8 SCT Fenner & Fortnow & Kurtz & Li, An Oracle Builder's Toolkit 1993 8 SCT Vereshchagin, Relationships between NP-sets, Co-NP-sets, and P-sets Relative to Random Oracles 1993 8 SCT Ogiwara & Thierauf & Toda & Watanabe, On Closure Properties of #P in the Context of PF.#P 1993 8 SCT Kobler & Toda, On the Power of Generalized MOD-Classes 1993 8 SCT Lutz, The Quantitative Structure of Exponential Time 1993 8 SCT Chari & Rohatgi, On Completeness under Random Reductions 1993 8 SCT Fu, With Quasi-linear Queries, EXP is not Polynomial Time Turing Reducible to Sparse Sets 1993 8 SCT Crescenzi & Silvestri, Sperner's Lemma and Robust Machines 1993 8 SCT Hertrampf & Lautemann & Schwentick & Vollmer & Wagner, On the Power of Polynomial Time Bit-Reductions (Extended ABSTRACT) 1993 8 SCT Buhrman & Longpre & Spaan, SPARSE Reduces Conjunctively to TALLY 1993 8 SCT Saluja, Relativized Limitations of Left Set Technique and Closure Classes of Sparse Sets (Extended Abstract) 1993 8 SCT Lange, Complexity and Structure in Formal Language Theory 1993 8 SCT Dymond & Fich & Nishimura & Ragde & Ruzzo, Pointers versus Arithmetic in PRAMs 1993 8 SCT Balcazar & Gavalda & Siegelmann & Sontag, Some Structural Complexity Aspects of Neural Computation 1993 8 SCT Gupta, Alternating Time Versus Deterministic Time: A Separation 1993 8 SCT Jenner & Toran, Computing Functions with Parallel Queries to NP (Extended Abstract) 1993 8 SCT Hirst & Harel, Taking it to the Limit: On Infinite Variants of NP-Complete Problems 1993 8 SCT Zuckerman, NP-Complete Problems Have a Version That's Hard to Approximate 1993 8 SCT Chen & Toda, The Complexity of Selecting Maximal Solutions 1992 7 SCT Goldmann & Hastad & Razborov, Majority Gates vs. General Weighted Threshold Gates 1992 7 SCT Beigel, Perceptrons, PP, and the Polynomial Hierarchy 1992 7 SCT Hofmeister, The Power of Negative Thinking in Constructing Threshold Circuits for Addition 1992 7 SCT Barnes & Buss & Ruzzo & Schieber, A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity 1992 7 SCT Downey & Fellows, Fixed-Parameter Intractability (Extended Abstract) 1992 7 SCT Fu & Li & Zhong, Some Properties of Exponential Time Complexity Classes 1992 7 SCT Ramachandran, Set Bit Enumeration is Hard 1992 7 SCT Rohatgi, Saving Queries with Randomness 1992 7 SCT Barrington, Quasipolynomial Size Circuit Classes 1992 7 SCT Beaudry & McKenzie, Circuits, Matrices, and Nonassociative Computation 1992 7 SCT Fellows & Koblitz, Self-Witnessing Polynomial-Time Complexity and Prime Factorization 1992 7 SCT Green & Kobler & Toran, The Power of the Middle Bit 1992 7 SCT Lozano & Toran, On the Nonuniform Complexity of the Graph Isomorphism Problem 1992 7 SCT Berthiaume & Brassard, The Quantum Challenge to Structural Complexity Theory 1992 7 SCT Vereshchagin, On The Power of PP 1992 7 SCT Li, Formal Power Series: An Algebraic Approach to the GapP and #P Functions 1992 7 SCT Abiteboul & Vardi & Vianu, Fixpoint Logics, Relational Machines, and Computational Complexity 1992 7 SCT Saluja & Subrahmanyam & Thakur, Descriptive Complexity of #P Functions 1992 7 SCT Lindell, A Purely Logical Characterization of Circuit Uniformity (Extended Draft) 1992 7 SCT Bloch, Functional Characterizations of Uniform Log-depth and Polylog-depth Circuit Families 1992 7 SCT Agrawal & Biswas, Universal Relations 1992 7 SCT Hemachandra & Ogiwara & Watanabe, How Hard Are Sparse Sets? 1992 7 SCT Ranjan & Rohatgi, On Randomized Reductions to Sparse Sets 1992 7 SCT Fu & Li, On Closeness of NP-hard Sets to Other Complexity Classes 1992 7 SCT Gavalda, Bounding the Complexity of Advice Functions 1992 7 SCT Book & Lutz, On Languages with Very High Information Content 1992 7 SCT Karchmer & Kushilevitz & Nisan, Fractional Covers and Communication Complexity (Extended Abstract) 1992 7 SCT Karchmer & Newman & Saks & Wigderson, Non-deterministic Communication Complexity with Few Witnesses (preliminary version) 1992 7 SCT Condon & Ladner, Interactive Proof Systems with Polynomially Bounded Strategies 1992 7 SCT Vatan, Some Lower Bounds and Upper Bounds for Algebraic Decision Trees and the Separation Problem 1992 7 SCT Kurtz & Mahaney & Royer, Average Dependence and Random Oracles (Preliminary Report) 1992 7 SCT Wang & Belanger, On Average P vs. Average NP 1992 7 SCT Ko, A Note on the Instance Complexity of Pseudorandom Sets 1992 7 SCT Feigenbaum & Fortnow & Lund & Spielman, The Power of Adaptiveness and Additional Queries in Random-Self-Reductions 1991 6 SCT Toda & Ogiwara, Counting Classes are At Least as Hard as the Polynomial-Time Hierarchy 1991 6 SCT Fortnow & Reingold, PP is Closed Under Truth-Table Reductions 1991 6 SCT Ogiwara & Hemachandra, A Complexity Theory for Feasible Closure Properties (Extended Abstract) 1991 6 SCT Fenner & Fortnow & Kurtz, Gap-Definable Counting Classes 1991 6 SCT Gupta, The Power of Witness Reduction 1991 6 SCT Gasarch, Bounded Queries in Recursion Theory: A Survey 1991 6 SCT Homer & Longpre, On Reductions of NP Sets to Sparse Sets 1991 6 SCT Gavalda & Watanabe, On the Computational Complexity of Small Descriptions 1991 6 SCT Bovet & Crescenzi & Silvestri, Complexity Classes and Sparse Oracles 1991 6 SCT Cai & Condon & Lipton, PSPACE Is Provable By Two Provers in One Round 1991 6 SCT Feige, On the Success Probability of the Two Provers in One-Round Proof Systems 1991 6 SCT Feigenbaum & Fortnow, On the Random-Self-Reducibility of Complete Sets (Preliminary Version) 1991 6 SCT Ostrovsky, One-Way Functions, Hard on Average Problems, and Statistical Zero-Knowledge Proofs 1991 6 SCT Ogiwara & Lozano, On One Query Self-Reducible Sets 1991 6 SCT Li & Vitanyi, Combinatorics and Kolmogorov Complexity 1991 6 SCT Miltersen, The Complexity of Malign Ensembles 1991 6 SCT Heiman & Wigderson, Randomized vs. Deterministic Decision Tree Complexity for Read-Once Boolean Functions 1991 6 SCT Santha, On the Monte Carlo Boolean Decision Tree Complexity of Read-Once Formulae 1991 6 SCT Lutz, A Pseudorandom Oracle Characterization of BPP 1991 6 SCT Fenner, Notions of Resource-Bounded Category and Genericity 1991 6 SCT Babai & Fortnow & Nisan & Wigderson, BPP has Subexponential Time Simulations unless EXPTIME has Publishable Proofs (Extended Abstract) 1991 6 SCT Allender & Hemachandra & Ogiwara & Watanabe, Relating Equivalence and Reducibility to Sparse Sets (Extended Abstract) 1991 6 SCT Tang & Fu & Lu, Exponential Time and Subexponential Time Sets 1991 6 SCT Balcazar, Adaptive Logspace and Depth-Bounded Reducibilities 1991 6 SCT Chang & Kadin & Rohatgi, Connections between the Complexity of Unique Satisfiability and the Threshold Behavior of Randomized Reductions 1991 6 SCT Vinay, Counting Auxiliary Pushdown Automata and Semi-Unbounded Arithmetic Circuits 1991 6 SCT Tarui, Degree Complexity of Boolean Functions and Its Applications to Relativized Separations 1991 6 SCT Beigel & Reingold & Spielman, The Perceptron Strikes Back 1991 6 SCT Grigni & Sipser, Monotone Separation of Logspace from NC^1 1991 6 SCT Karchmer & Raz & Wigderson, Super-logarithmic Depth Lower Bounds via Direct Sum in Communication Complexity (Preliminary Version) 1991 6 SCT Barrington & Straubing, Superlinear Lower Bounds for Bounded-Width Branching Programs 1991 6 SCT Krause, Geometric Arguments Yield Better Bounds for Threshold Circuits and Distributed Computing 1991 6 SCT Edmonds, Lower Bounds With Smaller Domain Size on Concurrent Write Parallel Machines 1991 6 SCT Immerman, DSPACE[n^k] = VAR[k+1] (Preliminary Version) 1991 6 SCT Gradel, Capturing Complexity Classes by Fragments of Second Order Logic 1991 6 SCT Kolaitis & Thakur, Approximation Properties of NP Minimization Classes 1991 6 SCT Bellantoni & Pitassi & Urquhart, Approximation and Small Depth Frege Proofs 1991 6 SCT Lutz & Schmidt, Errata for Circuit Size Relative to Pseudorandom Oracles 1990 5 SCT Ogiwara & Watanabe, On Polynomial Bounded Truth-Table Reducibility of NP Sets to Sparse Sets 1990 5 SCT Homer, Structural Properties of Nondeterministic Complete Sets 1990 5 SCT Hemachandra & Hoene, On Sets with Efficient Implicit Membership Tests 1990 5 SCT Orponen, On the Instance Complexity of NP-Hard Problems 1990 5 SCT Babai, Email and the Unexpected Power of Interaction 1990 5 SCT Cai & Condon & Lipton, On Bounded Round Multi-Prover Interactive Proof Systems 1990 5 SCT Bar-Yehuda & Chor & Kushilevitz, Privacy, Additional Information, and Communication 1990 5 SCT Hajnal, On the Power of Randomness in the Decision Tree Model 1990 5 SCT Heiman & Newman & Wigderson, On Read-Once Threshold Formulae and Their Randomized Decision Tree Complexity 1990 5 SCT Mansour & Nisan & Tiwari, The Computational Complexity of Universal Hashing 1990 5 SCT Newman & Ragde & Wigderson, Perfect Hashing, Graph Entropy, and Circuit Complexity 1990 5 SCT Feigenbaum & Kannan & Nisan, Lower Bounds on Random-Self-Reducibility 1990 5 SCT Mundhenk & Schuler, Non-Uniform Complexity Classes and Random Languages 1990 5 SCT Allender & Wilson, Width-Bounded Reducibility and Binary Search over Complexity Classes 1990 5 SCT Lange, Unambiguity of Circuits 1990 5 SCT Gundermann & Nasser & Wechsung, A Survey on Counting Classes 1990 5 SCT Alvarez & Jenner, A Very Hard Log Space Counting Class 1990 5 SCT Chang & Kadin, The Boolean Hierarchy and the Polynomial Hierarchy: A Closer Connection 1990 5 SCT Nisan, On Read-Once vs. Multiple Access to Randomness in Logspace 1990 5 SCT Clote, Bounded Arithmetic and Computational Complexity 1990 5 SCT Bedard & Lemieux & McKenzie, Extensions to Barrington's M-Program Model 1990 5 SCT Lynch, The Quantifier Structure of Sentences that Characterize Nondeterministic Time Complexity 1990 5 SCT Vinay & Venkateswaran & Madhavan, Circuits, Pebbling and Expressibility (Extended Abstract) 1990 5 SCT Amir & Beigel & Gasarch, Some Connections between Bounded Query Classes and Non-Uniform Complexity 1990 5 SCT Panconesi & Ranjan, Quantifiers and Approximation 1990 5 SCT Lischke, Impossibilities and Possibilities of Weak Separation Between NP and Exponential Time 1990 5 SCT Wang, P-Productivity and Polynomial Time Approximations 1990 5 SCT Lutz & Schmidt, Circuit Size Relative to Pseudorandom Oracles 1990 5 SCT Hemachandra & Rubinstein, A Note on Relativizing Complexity Classes with Tally Oracles 1990 5 SCT Green, An Oracle Separating Parity-P from PP^PH 1990 5 SCT Book, On Separating Complexity Classes 1990 5 SCT Kobler & Thierauf, Complexity Classes with Advice 1990 5 SCT Fortnow & Rompel & Sipser, Errata for On the Power of Multi-Prover Interactive Protocols 1989 4 SCT Homer & Selman, Oracles for Structural Properties: The Isomorphism Problem and Public-Key Cryptography 1989 4 SCT Watanabe & Tang, On Polynomial Time Turing and Many-One Completeness in PSPACE (Extended Abstract) 1989 4 SCT Wang, P-Creative Sets vs. P-Completely Creative Sets (Extended Abstract) 1989 4 SCT Lutz, Almost Everywhere High Nonuniform Complexity 1989 4 SCT Clote & Kranakis, Boolean Functions, Invariance Groups, and Parallel Complexity (Extended Abstract) 1989 4 SCT Shore & Slaman, The P-T-Degrees of the Recursive Sets: Lattice Embeddings, Extensions of Embeddings and the Two Quantifier Theory (Extended Abstract) 1989 4 SCT Marcoux, Composition Is Almost as Good as S-1-1 (Extended Abstract) 1989 4 SCT Regan, Finitary Substructure Languages with Application to the Theory of NP-Completeness 1989 4 SCT Trahan & Ramachandran & Loui, The Power of Parallel Random Access Machines with Augmented Instruction Sets 1989 4 SCT Immerman & Landau, The Complexity of Iterated Multiplication 1989 4 SCT Mayr & Subramanian, The Complexity of Circuit Value and Network Stability 1989 4 SCT Wilson, Decomposing NC and AC 1989 4 SCT Krentel, On Finding Locally Optimal Solutions 1989 4 SCT Cai & Hartmanis, The Complexity of the Real Line Is a Fractal 1989 4 SCT Lam & Ruzzo, Results on Communication Complexity Classes 1989 4 SCT Feige & Shamir, Multi-Oracle Interactive Protocols with Space Bounded Verifiers 1989 4 SCT Li & Vitanyi, Inductive Reasoning and Kolmogorov Complexity 1989 4 SCT Allender, The Generalized Kolmogorov Complexity of Sets 1989 4 SCT Downey & Gasarch & Homer & Moses, On Honest Polynomial Reductions, Relativizations, and P=NP 1989 4 SCT Kobler & Schoning & Toda & Toran, Turing Machines with Few Accepting Computations and Low Sets for PP 1989 4 SCT Beigel, On the Relativized Power of Additional Accepting Paths 1989 4 SCT Beigel & Hemachandra & Wechsung, On the Power of Probabilistic Polynomial Time: P^NP[log] subset PP 1989 4 SCT Maass & Slaman, The Complexity Types of Computable Sets 1989 4 SCT Krause & Meinel & Waack, Separating Complexity Classes Related to Certain Input Oblivious Logarithmic Space-Bounded Turing Machines 1989 4 SCT Chang, On the Structure of Bounded Queries to Arbitrary NP Sets 1989 4 SCT Balcazar, Nondeterministic Witnesses and Nonuniform Advice 1988 3 SCT Schoening, The Power of Counting 1988 3 SCT Tang & Watanabe, On Tally Relativizations of BP-Complexity Classes (Preliminary Report) 1988 3 SCT Halstenberg & Reischuk, Relations between Communication Complexity Classes (Extended Abstract) 1988 3 SCT Impagliazzo & Naor, Decision Trees and Downward Closures (Extended Abstract) 1988 3 SCT Balcazar, Logspace Self-Reducibility (Extended Abstract) 1988 3 SCT Barrington & Immerman & Straubing, On Uniformity within NC^1 1988 3 SCT Pitt & Warmuth, Reductions among Prediction Problems: On the Difficulty of Predicting Automata 1988 3 SCT Ibarra & Jiang, Trading Reversals for Alternation 1988 3 SCT Li & Vitanyi, Two Decades of Applied Kolmogorov Complexity: In Memoriam Andrei Nikolaevich Kolmogorov 1903-1987 1988 3 SCT Allender & Watanabe, Kolmogorov Complexity and Degrees of Tally Sets 1988 3 SCT Immerman, Nondeterministic Space Is Closed under Complementation 1988 3 SCT Borodin & Cook & Dymond & Ruzzo & Tompa, Two Applications of Complementation via Inductive Counting 1988 3 SCT Stearns, Juris Hartmanis: The Beginnings of Computational Complexity 1988 3 SCT Borodin, Juris Hartmanis: Building a Department--Building a Discipline (Very Preliminary Abstract) 1988 3 SCT Young, Juris Hartmanis: Fundamental Contributions to Isomorphism Problems (Working Draft) 1988 3 SCT Fortnow & Rompel & Sipser, On the Power of Multi-Prover Interactive Protocols 1988 3 SCT Condon, Space Bounded Probabilistic Game Automata 1988 3 SCT Lutz, Pseudorandom Sources for BPP 1988 3 SCT Ko, Distinguishing Bounded Reducibilities by Sparse Sets 1988 3 SCT Cai & Hemachandra, Enumerative Counting Is Hard 1988 3 SCT Huynh, The Complexity of Ranking 1988 3 SCT Toran, An Oracle Characterization of the Counting Hierarchy 1988 3 SCT Buss & Hay, On Truth-Table Reducibility to SAT and the Difference Hierarchy over NP 1988 3 SCT Book & Du & Russo, On Polynomial and Generalized Complexity Cores 1988 3 SCT Ko, Relativized Polynomial Time Hierarchies Having Exactly K Levels 1988 3 SCT Shinoda & Slaman, On the Theory of the PTIME Degrees of the Recursive Sets 1988 3 SCT Wagner, Bounded Query Computations 1988 3 SCT Kadin, The Polynomial Time Hierarchy Collapses If the Boolean Hierarchy Collapses 1988 3 SCT Longpre & Young, Cook Is Faster Than Karp: A Study of Reducibilities in NP (Extended Abstract) 1987 2 SCT Schoening, Probabilistic Complexity Classes and Lowness 1987 2 SCT Ephremidis & Papadimitriou & Sideris, Complexity Characterizations of Attribute Grammar Languages 1987 2 SCT Chen & Yap, Reversal Complexity 1987 2 SCT Amir & Gasarch, Polynomial Terse Sets (Extended Abstract) 1987 2 SCT Beigel, A Structural Theorem That Depends Quantitatively on the Complexity of SAT 1987 2 SCT Kadin, P^{NP[log n]} and Sparse Turing-Complete Sets for NP 1987 2 SCT Kalyanasundaram & Schnitger, The Probabilistic Communication Complexity of Set Intersection (Preliminary Version) 1987 2 SCT Goldsmith & Joseph & Young, Self-Reducible, P-Selective, Near-Testable, and P-Cheatable Sets: The Effect of Internal Structure on the Complexity of a Set 1987 2 SCT Ambos-Spies, Honest Polynomial Reducibilities, Recursively Enumerable Sets, and the P =? NP Problem 1987 2 SCT Regan, Unprovably Intractable Languages (Preliminary Version) 1987 2 SCT Lutz, Resource-Bounded Baire Category and Small Circuits in Exponential Space 1987 2 SCT Cai & Furst, PSPACE Survives Three-Bit Bottlenecks 1987 2 SCT Hemachandra, On Ranking 1987 2 SCT Reif, On Threshold Circuits and Polynomial Computation 1987 2 SCT Kurtz & Mahaney & Royer, Progress on Collapsing Degrees (Extended Abstract) 1987 2 SCT Chung & Ravikumar, Strong Nondeterministic Turing Reduction: A Technique for Proving Intractability 1987 2 SCT Watanabe, Polynomial Time Reducibility to a Set of Small Density (Extended Abstract) 1987 2 SCT Book & Ko, On Sets Reducible to Sparse Sets (Extended Abstract) 1987 2 SCT Hartmanis & Hemachandra, One-Way Functions, Robustness, and the Non-Isomorphism of NP-Complete Sets 1987 2 SCT Buss, A Theory of Oracle Machines (Preliminary Version) 1987 2 SCT Ko, On Helping by Robust Oracle Machines 1987 2 SCT Immerman, Expressibility as a Complexity Measure: Results and Directions 1987 2 SCT Leivant, Characterization of Complexity Classes in Higher-Order Logic 1987 2 SCT Nerode & Remmel, Complexity Theoretic Algebra I: Vector Spaces Over Finite Fields 1986 1 SCT Allender, Isomorphisms and 1-L Reductions 1986 1 SCT Allender, The Complexity of Sparse Sets in P 1986 1 SCT Ambos-Spies, Randomness, Relativizations, and Polynomial Reducibilities 1986 1 SCT Balcazar & Diaz & Gabarro, On Nonuniform Polynomial Space 1986 1 SCT Boppana & Lagarias, One-Way Functions and Circuit Complexity 1986 1 SCT Buss, Relativized Alternation 1986 1 SCT Buss, The Polynomial Hierarchy and Intuitionistic Bounded Arithmetic 1986 1 SCT Cai & Hemachandra, The Boolean Hierarchy: Hardware over NP 1986 1 SCT Clote & Takeuti, Exponential Time and Bounded Arithmetic 1986 1 SCT Condon & Ladner, Probabilistic Game Automata 1986 1 SCT Dietzfelbinger & Maass, Two Lower Bound Arguments with ``Inaccessible'' Numbers 1986 1 SCT Huynh, Resource-Bounded Kolmogorov Complexity of Hard Languages 1986 1 SCT Ko & Orponen & Schoning & Watanabe, What Is a Hard Instance of a Computational Problem? 1986 1 SCT Li & Longpre & Vitanyi, The Power of the Queue 1986 1 SCT Lynch, A Depth-Size Tradeoff for Boolean Circuits with Unbounded Fan-In 1986 1 SCT Maass & Schnitger, An Optimal Lower Bound for Turing Machines with One Work Tape and a Two-Way Input Tape 1986 1 SCT McAloon, Separation Results for Bounded Alternation 1986 1 SCT Parberry & Schnitger, Parallel Computation with Threshold Functions 1986 1 SCT Regan, The Topology of Provability in Complexity Theory 1986 1 SCT Russo, Optimal Approximations of Complete Sets 1986 1 SCT Sipser, Expanders, Randomness, or Time versus Space 1986 1 SCT Torenvliet & van Emde Boas, Diagonalization Methods in a Polynomial Setting 1986 1 SCT Tretkoff, Bounded Oracles and Complexity Classes Inside Linear Space 1986 1 SCT Wilson, Parallel Computation and the NC Hierarchy Relativized 1986 1 SCT Zachos, Probabilistic Quantifiers, Adversaries, and Complexity Classes: An Overview 1989 13 SEABM Cheng, A New Algorithm for Transportation Problem 1988 SEENG Bentley, Teaching the Tricks of the Trade 1994 19 SENOTES Kilov, On Understanding Hypertext: Are Links Essential? 1994 19 SENOTES Lea, Christopher Alexander: An Introduction for Object-Oriented Designers 1993 18 SENOTES Hoare, Algebra and Models 1993 18 SENOTES Terwilliger, An Example of Process Verification: The Gries/Dijkstra Design Method 1993 18 SENOTES Gorecki, Reliable Programs Must Not Be Written... 1990 15 SENOTES Tahvanainen & Smolander, An Annotated CASE Bibliography 1988 13 SENOTES Schneider & Lamport, Another Position Paper on ``Fairness'' 1988 13 SENOTES Chandy & Misra, Another View of ``Fairness'' 1988 13 SENOTES Dijkstra, Position Paper on ``Fairness'' 1996 28 SESST Joshi & Hosseini & Vairavan, Stability Analysis of a Load-Balancing Algorithm 1996 28 SESST Li & Zheng, Prefix Computation Using a Segmented Bus 1996 28 SESST Cong & Zheng, Near-Optimal Embeddings of Trees into Fibonacci Cubes 1996 28 SESST Abachi & Walker, Network Expandability and Cost Analysis of Torus, Hypercube and Tree Multi-Processor Systems 1996 28 SESST Nong & Hu & Gao, A Parallelizing Translator for Object-Oriented Large-Grain Data Flow Model 1990 SFCHRON Clark & Siegmann, IBM Makes Light of Solving Code Conundrum 1996 52 SGFORUM Neto & Sezinando, Trees, Band Monoids and Formal Languages 1996 52 SGFORUM VanderWerf, Wreath Products of Algebras: Generalizing the Krohn-Rhodes Theorem to Arbitrary Algebras 1992 45 SGFORUM Karner, On Limits in Complete Semirings 1991 42 SGFORUM Justin & Pirillo, Corrigendum to ``Infinite Words and Permutation Properties'' 1990 41 SGFORUM Neraud, On the Deficit of a Finite Set of Words 1990 SHOULDERS Steen, Pattern 1990 SHOULDERS Banchoff, Dimension 1990 SHOULDERS Fey, Quantity 1990 SHOULDERS Moore, Uncertainty 1990 SHOULDERS Senechal, Shape 1990 SHOULDERS Stewart, Change 1994 SIAM Spencer, Ten Lectures on the Probabilistic Method, Second Edition 1993 SIAM Higham, Handbook of Writing for the Mathematical Sciences 1992 SIAM Niederreiter, Random Number Generation and Quasi-Monte Carlo Methods 1974 SIAMAMS Aanderaa, On k-Tape Versus (k-1)-Tape Real Time Computation 1974 SIAMAMS Fagin, Generalized First-Order Spectra and Polynomial-Time Recognizable Sets 1974 SIAMAMS Fischer & Paterson, String-Matching and Other Products 1974 SIAMAMS Fischer & Rabin, Super-Exponential Complexity of Presburger Arithmetic 1974 SIAMAMS Gentleman & Johnson, The Evaluation of Determinants by Expansion by Minors and the General Problem of Substitution 1974 SIAMAMS Hartmanis & Hunt, The LBA Problem and Its Importance in the Theory of Computing 1974 SIAMAMS Kung & Traub, Computational Complexity of One-Point and Multi-Point Iteration 1974 SIAMAMS Paterson & Fischer & Meyer, An Improved Overlap Argument for On-Line Multiplication 1974 SIAMAMS Schultz, The Complexity of Linear Approximation Algorithms 1994 35 SIBERMJ Alexandrov, Minimal Foundations of Geometry 1994 35 SIBERMJ Pobedin, Computability with Two-Place Oracle 1994 35 SIBERMJ Husainov, The Hochschild-Mitchell Dimension of Linearly Ordered Sets 1993 34 SIBERMJ Goncharov, Computable Classes of Constructivizations for Models of Finite Computability Type 1993 34 SIBERMJ Ganov, Recursion on Generalized Computable Ordinals 1991 31 SIBERMJ Belyakin, Computations with Oracles: Generalized Selection 1990 30 SIBERMJ Belyakin, Iterated Kleene Computability 1997 26 SICOMP Pedersen & Pfitzmann, Fail-Stop Signatures 1997 26 SICOMP Ripphausen-Lipa & Wagner & Weihe, The Vertex-Disjoint Menger Problem in Planar Graphs 1997 26 SICOMP Panconesi & Srinivasan, Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds 1997 26 SICOMP Condon & Feigenbaum & Lund & Shor, Random Debaters and the Hardness of Approximating Stochastic Functions 1997 26 SICOMP Steinberg, A Strip-Packing Algorithm with Absolute Performance Bound 2 1997 26 SICOMP Teng & Yao, Approximating Shortest Superstrings 1997 26 SICOMP Dolev & Shavit, Bounded Concurrent Time-Stamping 1997 26 SICOMP Purdom & Haven, Probe Order Backtracking 1997 26 SICOMP Frederickson, Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees 1997 26 SICOMP Alur & Attiya & Taubenfeld, Time-Adaptive Algorithms for Synchronization 1997 26 SICOMP Allender & Balcazar & Immerman, A First-Order Isomorphism Theorem 1997 26 SICOMP Verma, General Techniques for Analyzing Recursive Algorithms with Applications 1997 26 SICOMP Sebo, Potentials in Unidirected Graphs and Planar Multiflows 1997 26 SICOMP Alonso & Reingold & Schott, The Average-Case Complexity of Determining the Majority 1997 26 SICOMP Dubiner & Zwick, Amplification by Read-Once Formulas 1997 26 SICOMP Nivat & Podelski, Minimal Ascending and Descending Tree Automata 1997 26 SICOMP Han & Hemaspaandra & Thierauf, Threshold Computation and Cryptographic Security 1997 26 SICOMP Ge & Hakimi, Disjoint Rooted Spanning Trees with Small Depths in deBruijn and Kautz Graphs 1997 26 SICOMP Boros & Hammer & Ibaraki & Kawakami, Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle 1997 26 SICOMP Blum & Raghavan & Schieber, Navigating in Unfamiliar Geometric Terrain 1997 26 SICOMP Beaudry & McKenzie & Peladeau & Therien, Finite Monoids: From Word to Circuit Evaluation 1997 26 SICOMP Mak, Parallelism Always Helps 1997 26 SICOMP Liu & Sanlaville, Stochastic Scheduling with Variable Profile and Precedence Constraints 1997 26 SICOMP Chang & Gasarch & Lund, On Bounded Queries and Approximation 1997 26 SICOMP Farach & Thorup, Sparse Dynamic Programming for Evolutionary-Tree Comparison 1997 26 SICOMP Kao, Total Protection of Analytic-Invariant Information in Cross-Tabulated Tables 1997 26 SICOMP Cucker & Grigoriev, On the Power of Real Turing Machines Over Binary Inputs 1997 26 SICOMP Karger & Motwani, An NC Algorithm for Minimum Cuts 1997 26 SICOMP Dolev & Israeli & Moran, Resource Bounds for Self-Stabilizing Message-Driven Protocols 1996 25 SICOMP Kummer, Kolmogorov Complexity and Instance Complexity of Recursively Enumerable Sets 1996 25 SICOMP Cheriyan & Hagerup & Mehlhorn, An o(n^3)-Time Maximum-Flow Algorithm 1996 25 SICOMP Ajtai & Megiddo, A Deterministic poly(log log N)-Time N-Processor Algorithm for Linear Programming in Fixed Dimensions 1996 25 SICOMP Dietzfelbinger & Kutylowski & Reischuk, Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write Parallel Random-Access Machines 1996 25 SICOMP Sellen, Lower Bounds for Geometrical and Physical Problems 1996 25 SICOMP Allenberg-Navony & Itai & Moran, Average and Randomized Complexity of Distributed Problems 1996 25 SICOMP Bergadano & Varricchio, Learning Behaviors of Automata from Multiplicity and Equivalence Queries 1996 25 SICOMP Golin & Young, Prefix Codes: Equiprobable Words, Unequal Letter Costs 1996 25 SICOMP Zuckerman, On Unapproximable Versions of NP-Complete Problems 1996 25 SICOMP Bodlaender, A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth 1996 25 SICOMP Apostolico & Breslauer, An Optimal O(log log N)-Time Parallel Algorithm for Detecting All Squares in a String 1996 25 SICOMP Fischer & Moran & Rudich & Taubenfeld, The Wakeup Problem 1996 25 SICOMP Bini & Gemignani, Erratum: Fast Parallel Computation of the Polynomial Remainder Sequence via Bezout and Hankel Matrices 1996 25 SICOMP Galil & Park, Alphabet-Independent Two-Dimensional Witness Computation 1996 25 SICOMP Gil & Meyer auf der Heide & Wigderson, The Tree Model for Hashing: Lower and Upper Bounds 1996 25 SICOMP Di Battista & Tamassia, On-Line Planarity Testing 1996 25 SICOMP Kedem & Landau & Palem, Parallel Suffix-Prefix-Matching Algorithm and Applications 1996 25 SICOMP Aspnes & Waarts, Randomized Consensus in Expected O(n log^2 n) Operations Per Processor 1996 25 SICOMP Fujita & Yamashita, Optimal Group Gossiping in Hypercubes under a Circuit-Switching Model 1996 25 SICOMP Pellegrini, On Point Location and Motion Planning among Simplices 1996 25 SICOMP Cypher & Konstantinidou, Bounds on the Efficiency of Message-Passing Protocols for Parallel Computers 1996 25 SICOMP Shih & Liu, On-Line Scheduling of Imprecise Computations to Minimize Error 1996 25 SICOMP Hemaspaandra & Naik & Ogihara & Selman, Computing Solutions Uniquely Collapses the Polynomial Hierarchy 1996 25 SICOMP Jimbo & Maruoka, A Method of Constructing Selection Networks with O(log n) Depth 1996 25 SICOMP Hastad & Leighton & Rogoff, Analysis of Backoff Protocols for Multiple Access Channels 1996 25 SICOMP Kapoor & Smid, New Techniques for Exact and Approximate Dynamic Closest-Point Problems 1996 25 SICOMP Klein, Efficient Parallel Algorithms for Chordal Graphs 1996 25 SICOMP Liskiewicz & Reischuk, The Sublogarithmic Alternating Space World 1996 25 SICOMP Rajasekaran, Tree-Adjoining Language Parsing in o(n^6) Time 1996 25 SICOMP Ramanan, An Efficient Parallel Algorithm for the Matrix-Chain-Product Problem 1996 25 SICOMP Rhee & Talagrand, Convergence in Distribution for Best-Fit Decreasing 1996 25 SICOMP Irani & Karlin & Phillips, Strongly Competitive Algorithms for Paging with Locality of Reference 1996 25 SICOMP Irani & Rabani, On the Value of Coordination in Distributed Decision Making 1996 25 SICOMP Condon & Ladner & Lampe & Sinha, Complexity of Sub-Bus Mesh Computations 1996 25 SICOMP Kaplan & Shamir, Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques 1996 25 SICOMP Friedman & Hershberger & Snoeyink, Efficiently Planning Compliant Motion in the Plane 1996 25 SICOMP Arora & Leighton & Maggs, On-Line Algorithms for Path Selection in a Nonblocking Network 1996 25 SICOMP Kirousis & Thilikos, The Linkage of a Graph 1996 25 SICOMP Kannan & Myers, An Algorithm for Locating Nonoverlapping Regions of Maximum Alignment Score 1996 25 SICOMP Jim & Meyer, Full Abstraction and the Context Lemma 1996 25 SICOMP Garg & Vazirani & Yannakakis, Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications 1996 25 SICOMP Rubinfeld & Sudan, Robust Characterizations of Polynomials with Applications to Program Testing 1996 25 SICOMP Bafna & Pevzner, Genome Rearrangements and Sorting by Reversals 1996 25 SICOMP Satyanarayana & Wood & Camarinopoulos & Pampoukis, Note on ``A Linear-Time Algorithm for Computing K-Terminal Reliability in a Series-Parallel Network'' 1996 25 SICOMP Hutton & Lubiw, Upward Planning of Single-Source Acyclic Digraphs 1996 25 SICOMP Ramachandran & Yang, An Efficient Parallel Algorithm for the General Planar Monotone Circuit Value Problem 1996 25 SICOMP Chang & Kadin, The Boolean Hierarchy and the Polynomial Hierarchy: A Closer Connection 1996 25 SICOMP Khuller & Raghavachari & Young, Low-Degree Spanning Trees of Small Weight 1996 25 SICOMP Attiya & Herzberg & Rajsbaum, Optimal Clock Synchronization under Different Delay Assumptions 1996 25 SICOMP Deng & Hell & Huang, Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs 1996 25 SICOMP Rhee & Liang & Dhall & Lakshmivarahan, An O(N+M)-Time Algorithm for Finding a Minimum-Weight Dominating Set in a Permutation Graph 1996 25 SICOMP Mathur & Reingold, Generalized Kraft's Inequality and Discrete k-Modal Search 1996 25 SICOMP Stearns & Hunt, An Algebraic Model for Combinatorial Problems 1996 25 SICOMP Grove & Halpern & Koller, Asymptotic Conditional Probabilities: The Unary Case 1996 25 SICOMP Han, A Fast Derandomization Scheme and Its Applications 1996 25 SICOMP Agarwala & Fernandez-Baca, Weighted Multidimensional Search and Its Application to Convex Optimization 1996 25 SICOMP Agarwal & Sharir, Ray Shooting amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions 1996 25 SICOMP Kapron & Cook, A New Characterization of Type-2 Feasibility 1996 25 SICOMP Regan, Linear Time and Memory-Efficient Computation 1996 25 SICOMP Goldreich & Krawczyk, On the Composition of Zero-Knowledge Proof Systems 1996 25 SICOMP Fenner & Fortnow & Kurtz, The Isomorphism Conjecture Holds Relative to an Oracle 1996 25 SICOMP Chiang & Preparata & Tamassia, A Unified Approach to Dynamic Point Location, Ray Shooting, and Shortest Paths in Planar Maps 1995 24 SICOMP Devroye & Robson, On the Generation of Random Binary Search Trees 1995 24 SICOMP Devroye & Reed, On the Variance of the Height of Random Binary Search Trees 1995 24 SICOMP Larmore & Przytycka, Constructing Huffman Trees in Parallel 1995 24 SICOMP Lutz, Weakly Hard Problems 1995 24 SICOMP Buchsbaum & Sundar & Tarjan, Data-Structural Bootstrapping, Linear Path Compression, and Catenable Heap-Ordered Double-Ended Queues 1995 24 SICOMP Sekar & Ramesh & Ramakrishnan, Adaptive Pattern Matching 1995 24 SICOMP Mendelzon & Wood, Finding Regular Simple Paths in Graph Databases 1995 24 SICOMP Naor & Stockmeyer, What Can be Computed Locally? 1995 24 SICOMP Eiter & Gottlob, Identifying the Minimal Transversals of a Hypergraph and Related Problems 1995 24 SICOMP Kalorkoti, On the Reuse of Additions in Matrix Multiplication 1995 24 SICOMP Shmoys & Wein & Williamson, Scheduling Parallel Machines On-Line 1995 24 SICOMP Han & Kelsen & Ramachandran & Tarjan, Computing Minimal Spanning Subgraphs in Linear Time 1995 24 SICOMP Chou & Ko, Computational Complexity of Two-Dimensional Regions 1995 24 SICOMP Giesbrecht, Nearly Optimal Algorithms for Canonical Matrix Forms 1995 24 SICOMP Cohen & Battista & Tamassia & Tollis, Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar ST-Digraphs 1995 24 SICOMP Miller & Naor, Flow in Planar Graphs with Multiple Sources and Sinks 1995 24 SICOMP Gartner, A Subexponential Algorithm for Abstract Optimization Problems 1995 24 SICOMP Chari & Rohatgi & Srinivasan, Randomness-Optimal Unique Element Isolation with Applications to Perfect Matching and Related Problems 1995 24 SICOMP Hofting & Wanke, Minimum Cost Paths in Periodic Graphs 1995 24 SICOMP Ogihara, Polynomial-Time Membership Comparable Sets 1995 24 SICOMP Fu, With Quasilinear Queries EXP Is Not Polynomial Time Turing Reducible to Sparse Sets 1995 24 SICOMP Andersson & Ottmann, New Tight Bounds on Uniquely Represented Dictionaries 1995 24 SICOMP Han & Lin & Liu, Scheduling Jobs with Temporal Distance Constraints 1995 24 SICOMP Jiang & Li, On the Approximation of Shortest Common Supersequences and Longest Common Subsequences 1995 24 SICOMP Buhrman & Hemaspaandra & Longpre, SPARSE Reduces Conjunctively to TALLY 1995 24 SICOMP Bshouty & Cleve & Eberly, Size-Depth Tradeoffs for Algebraic Formulas 1995 24 SICOMP Bshouty & Hancock & Hellerstein, Learning Arithmetic Read-Once Formulas 1995 24 SICOMP Feder & Kushilevitz & Naor & Nisan, Amortized Communication Complexity 1995 24 SICOMP Lennerstad & Lundberg, An Optimal Execution Time Estimate of Static Versus Dynamic Allocation in Multiprocessor Systems 1995 24 SICOMP Murota, Computing the Degree of Determinants Via Combinatorial Relaxation 1995 24 SICOMP Gillies & Liu, Scheduling Tasks with AND/OR Precedence Constraints 1995 24 SICOMP Pan & Preparata, Work-Preserving Speed-Up of Parallel Matrix Computations 1995 24 SICOMP Poljak, Integer Linear Programs and Local Search for Max-Cut 1995 24 SICOMP Hemaspaandra & Silvestri, Easily Checked Generalized Self-Reducibility 1995 24 SICOMP Khuller & Raghavachari & Young, Approximating the Minimum Equivalent Digraph 1995 24 SICOMP Downey & Fellows, Fixed-Parameter Tractability and Completeness I: Basic Results 1995 24 SICOMP Hsu, O(MN) Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs 1995 24 SICOMP Agrawal & Klein & Ravi, When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks 1995 24 SICOMP Yang & Lee & Wong, Rectilinear Path Problems among Rectilinear Obstacles Revisited 1995 24 SICOMP Ganz, Evaluation of Polynomials Using the Structure of the Coefficients 1995 24 SICOMP Frieze & Karp & Reed, When Is the Assignment Bound Tight for the Asymmetric Traveling-Salesman Problem? 1995 24 SICOMP Goldberg, Scaling Algorithms for the Shortest Paths Problem 1995 24 SICOMP Benczur, Counterexamples for Directed and Node Capacitated Cut-Trees 1995 24 SICOMP Kannan & Warnow, Tree Reconstruction from Partial Orders 1995 24 SICOMP Giancarlo, A Generalization of the Suffix Tree to Square Matrices, with Applications 1995 24 SICOMP Tokuyama & Nakano, Efficient Algorithms for the Hitchcock Transportation Problem 1995 24 SICOMP Cohen, Approximate Max-Flow on Small Depth Networks 1995 24 SICOMP Duke & Lefmann & Rodl, A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph 1995 24 SICOMP Mejean & Morel & Reynaud, A Variational Method for Analysing Unit Clause Search 1995 24 SICOMP Emiris & Canny, A General Approach to Removing Degeneracies 1995 24 SICOMP Snyder & Steele, A Priori Bounds on the Euclidean Traveling Salesman 1995 24 SICOMP Cheriyan & Hagerup, A Randomized Maximum-Flow Algorithm 1995 24 SICOMP Natarajan, Sparse Approximate Solutions to Linear Systems 1995 24 SICOMP Wang & Leiss, A Heuristic Scheduling of Independent Tasks with Bottleneck Resource Constraints 1995 24 SICOMP Grigoriev & Singer & Yao, On Computing Algebraic Functions Using Logarithms and Exponentials 1995 24 SICOMP Kapoor & Ramesh, Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs 1995 24 SICOMP Fich & Munro & Poblete, Permuting in Place 1995 24 SICOMP Juedes & Lutz, The Complexity and Distribution of Hard Problems 1995 24 SICOMP Goemans & Williamson, A General Approximation Technique for Constrained Forest Problems 1995 24 SICOMP Koren & Shasha, D^over: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems 1995 24 SICOMP Kilpelainen & Mannila, Ordered and Unordered Tree Inclusion 1995 24 SICOMP Mansour, Randomized Interpolation and Approximation of Sparse Polynomials 1995 24 SICOMP Delcher & Kosaraju, An NC Algorithm for Evaluating Monotone Planar Circuits 1995 24 SICOMP Chor & Gereb-Graus & Kushilevitz, Private Computations over the Integers 1995 24 SICOMP Lakshman & Saunders, Sparse Polynomial Interpolation in Nonstandard Bases 1995 24 SICOMP Li & Vitanyi, A New Approach to Formal Language Theory by Kolmogorov Complexity 1995 24 SICOMP Blass & Gurevich, Matrix Transformation Is Complete for the Average Case 1995 24 SICOMP Cole & Hariharan & Paterson & Zwick, Tighter Lower Bounds on the Exact Complexity of String Matching 1995 24 SICOMP Kao, Planar Strong Connectivity Helps in Parallel Depth-First Search 1995 24 SICOMP Bini & Gemignani, Fast Parallel Computation of the Polynomial Remainder Sequence Via Bezout and Hankel Matrices 1995 24 SICOMP Alon & Karp & Peleg & West, A Graph-Theoretic Game and Its Application to the k-Server Problem 1995 24 SICOMP Saran & Vazirani, Finding k Cuts within Twice the Optimal 1995 24 SICOMP Bonet & Buss, The Serial Transitive Closure Problem for Trees 1995 24 SICOMP Ibarra & Jiang & Tran & Wang, New Decidability Results Concerning Two-Way Counter Machines 1995 24 SICOMP Zhang, On the Optimality of Randomized alpha-beta Search 1995 24 SICOMP Cidon & Kutten & Mansour & Peleg, Greedy Packet Scheduling 1995 24 SICOMP Naor & Roth, Optimal File Sharing in Distributed Networks 1995 24 SICOMP Heffernan & Mitchell, An Optimal Algorithm for Computing Visibility in the Plane 1994 23 SICOMP Gyssens & Paredaens & Van Gucht, A Grammar-Based Approach Towards Unifying Hierarchical Data Models 1994 23 SICOMP Chazelle & Edelsbrunner & Guibas & Hershberger & Seidel & Sharir, Selecting Heavily Covered Points 1994 23 SICOMP Afek & Gafni, Distributed Algorithms for Unidirectional Networks 1994 23 SICOMP Hochbaum & Naor, Simple And Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality 1994 23 SICOMP Kim & McNaughton, Computing the Order of a Locally Testable Automaton 1994 23 SICOMP Agarwala & Fernandez-Baca, A Polynomial-Time Algorithm for the Perfect Phylogeny Problem When the Number of Character States is Fixed 1994 23 SICOMP Atkinson & Beals, Priority Queues and Permutations 1994 23 SICOMP Nishimura, A Model for Asynchronous Shared Memory Parallel Computation 1994 23 SICOMP Chaudhuri, Tight Bounds on Oblivious Chaining 1994 23 SICOMP Cypher & Gravano, Requirements for Deadlock-Free, Adaptive Packet Routing 1994 23 SICOMP Book, On Languages Reducible to Algorithmically Random Languages 1994 23 SICOMP Larmore & Przytycka, A Fast Algorithm for Optimum Height-Limited Alphabetic Binary Trees 1994 23 SICOMP Cohen & Megiddo, Improved Algorithms for Linear Inequalities with Two Variables Per Inequality 1994 23 SICOMP Das & Thulasiraman & Agarwal, Diagnosis of t/(t+1)-Diagnosable Systems 1994 23 SICOMP Ahuja & Orlin & Stein & Tarjan, Improved Algorithms for Bipartite Network Flow 1994 23 SICOMP Pan, New Resultant Inequalities and Complex Polynomial Factorization 1994 23 SICOMP Westbrook, Randomized Algorithms for Multiprocessor Page Migration 1994 23 SICOMP Yao, Near-Optimal Time-Space Tradeoff for Element Distinctness 1994 23 SICOMP Broder & Frieze & Upfal, Existence and Construction of Edge-Disjoint Paths on Expander Graphs 1994 23 SICOMP Blum, Separating Distribution-Free and Mistake-Bound Learning Models Over the Boolean Domain 1994 23 SICOMP Feige & Raghavan & Peleg & Upfal, Computing with Noisy Information 1994 23 SICOMP Du & Park, On Competitive Group Testing 1994 23 SICOMP Allender & Gore, A Uniform Circuit Lower Bound for the Permanent 1994 23 SICOMP Lew & Mahmoud, The Joint Distribution of Elastic Buckets in Multiway Search Trees 1994 23 SICOMP Cole, Tight Bounds on the Complexity of the Boyer-Moore String Matching Algorithm 1994 23 SICOMP Subramanian, A New Approach to Stable Matching Problems 1994 23 SICOMP Chor & Israeli & Li, Wait-Free Consensus Using Asynchronous Hardware 1994 23 SICOMP Kannan & Warnow, Inferring Evolutionary History from DNA Sequences 1994 23 SICOMP Dietzfelbinger & Karlin & Mehlhorn & Meyer Auf Der Heide & Rohnert & Tarjan, Dynamic Perfect Hashing: Upper and Lower Bounds 1994 23 SICOMP Lutz & Mayordomo, Measure, Stochasticity, and the Density of Hard Languages 1994 23 SICOMP Schrijver, Finding k Disjoint Paths in a Directed Planar Graph 1994 23 SICOMP Culik & Karhumaki, Finite Automata Computing Real Functions 1994 23 SICOMP Bshouty, On the Complexity of Bilinear Forms Over Associative Algebras 1994 23 SICOMP Ramanan, A New Lower Bound Technique and its Application: Tight Lower bound for a Polygon Triangulation Problem 1994 23 SICOMP Aceto, On ``Axiomatising Finite Concurrent Processes'' 1994 23 SICOMP Dahlhaus & Johnson & Papadimitriou & Seymour & Yannakakis, The Complexity of Multiterminal Cuts 1994 23 SICOMP Berkman & Ja'Ja' & Krishnamurthy & Thurimella & Vishkin, Top-Bottom Routing Around a Rectangle is as Easy as Computing Prefix Minima 1994 23 SICOMP Klein & Plotkin & Stein & Tardos, Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem With Applications to Routing and Finding Sparse Cuts 1994 23 SICOMP Sheu & Long, The Extended Low Hierarchy is an Infinite Hierarchy 1994 23 SICOMP Johnson & Raab, Complexity of Network Reliability and Optimal Resource Placement Problems 1994 23 SICOMP Deogun & Steiner, Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs 1994 23 SICOMP Pestien & Ramakrishnan & Sarkar, Packet Transmission in a Noisy-Channel Ring Network 1994 23 SICOMP Cai & Lipton, Subquadratic Simulations of Balanced Formulae by Branching Programs 1994 23 SICOMP Grandjean, Linear Time Algorithms and NP-Complete Problems 1994 23 SICOMP Kirschenhofer & Prodinger & Szpankowski, Digital Search Trees Again Revisited: The Internal Path Length Perspective 1994 23 SICOMP Shmoys & Stein & Wein, Improved Approximation Algorithms for Shop Scheduling Problems 1994 23 SICOMP Reif & Sen, Randomized Algorithms for Binary Search and Load Balancing on Fixed Connection Networks with Geometric Applications 1994 23 SICOMP Beame & Tompa & Yan, Communication-Space Tradeoffs for Unrestricted Protocols 1994 23 SICOMP Braschi & Trystram, A New Insight into the Coffman-Graham Algorithm 1994 23 SICOMP Kaufmann & Mehlhorn, A Linear-Time Algorithm for the Homotopic Routing Problem in Grid Graphs 1994 23 SICOMP Triesch, Some Results on Elusive Graph Properties 1994 23 SICOMP Fu & Li, Closeness of NP-Hard Sets to Other Complexity Classes 1994 23 SICOMP Kobler & Thierauf, Complexity-Restricted Advice Functions 1994 23 SICOMP Herley & Bilardi, Deterministic Simulations of PRAMs on Bounded Degree Networks 1994 23 SICOMP Karloff & Rabani & Ravid, Lower Bounds for Randomized k-Server and Motion-Planning Algorithms 1994 23 SICOMP Amir & Benson & Farach, An Alphabet Independent Approach to Two-Dimensional Pattern Matching 1994 23 SICOMP Broder & Karlin & Raghavan & Upfal, Trading Space for Time in Undirected s-t Connectivity 1994 23 SICOMP Chaudhuri & Welch, Bounds on the Costs of Multivalued Register Implementations 1994 23 SICOMP Bagchi & Schmeichel & Hakimi, Parallel Information Dissemination by Packets 1994 23 SICOMP Pruesse & Ruskey, Generating Linear Extensions Fast 1994 23 SICOMP Narayanan & Saran & Vazirani, Randomized Parallel Algorithms for Matroid Union and Intersection, With Applications to Arboresences and Edge-Disjoint Spanning Trees 1994 23 SICOMP Swaminathan & Wagner, On the Consecutive-Retrieval Problem 1994 23 SICOMP Kim & Sutherland, Polynomial Root-Finding Algorithms and Branched Covers 1994 23 SICOMP de Berg & Overmars & Schwarzkopf, Computing and Verifying Depth Orders 1994 23 SICOMP Reif & Sen, Erratum: Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems 1994 23 SICOMP Grigoriev & Karpinski & Singer, Computational Complexity of Sparse Rational Interpolation 1994 23 SICOMP De Santis & Persiano, Tight Upper and Lower Bounds on the Path Length of Binary Trees 1994 23 SICOMP Sundar & Tarjan, Unique Binary-Search-Tree Representations and Equality Testing of Sets and Sequences 1994 23 SICOMP Boros & Crama & Hammer & Saks, A Complexity Index for Satisfiability Problems 1994 23 SICOMP Apostolico & Italiano & Gambosi & Talamo, The Set Union Problem with Unlimited Backtracking 1994 23 SICOMP Kuo & Chang, The Profile Minimization Problem in Trees 1994 23 SICOMP Du & Xue & Sun & Cheng, Modifications of Competitive Group Testing 1994 23 SICOMP Bellare & Goldwasser, The Complexity of Decision Versus Search 1994 23 SICOMP Shawe-Taylor & Pisanski, Homeomorphism of 2-Complexes Is Graph Isomorphism Complete 1994 23 SICOMP Pellegrini, On Collision-Free Placements of Simplices and the Closest Pair of Lines in 3-Space 1994 23 SICOMP Matousek & Pach & Sharir & Sifrony & Welzl, Fat Triangles Determine Linearly Many Holes 1994 23 SICOMP Irving & Jerrum, Three-Dimensional Statistical Data Security Problems 1994 23 SICOMP Frederickson & Rodger, An NC Algorithm for Scheduling Unit-Time Jobs with Arbitrary Release Times and Deadlines 1994 23 SICOMP Bermond & Fraigniaud, Broadcasting and Gossiping in de Bruijn Networks 1993 22 SICOMP Jiang & Ravikumar, Minimal NFA Problems Are Hard 1993 22 SICOMP Cai & Han & Tarjan, An O(m log n)-Time Algorithm for the Maximal Planar Subgraph Problem 1993 22 SICOMP Goldreich & Krawczyk & Luby, On the Existence of Pseudorandom Generators 1993 22 SICOMP Szpankowski, A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors 1993 22 SICOMP Karger & Koller & Phillips, Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths 1993 22 SICOMP He, On Finding the Rectangular Duals of Planar Triangular Graphs 1993 22 SICOMP Pan & Reif, Fast and Efficient Parallel Solution of Sparse Linear Systems 1993 22 SICOMP Rhee & Talagrand, On-Line Bin Packing of Items of Random Sizes, II 1993 22 SICOMP Gavalda & Watanabe, On the Computational Complexity of Small Descriptions 1993 22 SICOMP Karpinski & Werther, VC Dimension and Uniform Learnability of Sparse Polynomials and Rational Functions 1993 22 SICOMP Chazelle & Edelsbrunner & Guibas & Sharir & Snoeyink, Computing a Face in an Arrangement of Line Segments and Related Problems 1993 22 SICOMP Chen, A Better Heuristic for Preemptive Parallel Machine Scheduling with Batch Setup Times 1993 22 SICOMP Chu & Knott, A New Method for Computing Page-Fault Rates 1993 22 SICOMP Kushilevitz & Mansour, Learning Decision Trees Using the Fourier Spectrum 1993 22 SICOMP Cole, Correction: Parallel Merge Sort 1993 22 SICOMP Hsu & Ramachandran, Finding a Smallest Augmentation to Biconnect a Graph 1993 22 SICOMP Halstenberg & Reischuk, Different Modes of Communication 1993 22 SICOMP Manber & Myers, Suffix Arrays: A New Method for On-Line String Searches 1993 22 SICOMP Blass & Gurevich, Randomizing Reductions of Search Problems 1993 22 SICOMP Lou & Sarrafzadeh, An Optimal Algorithm for the Maximum Three-Chain Problem 1993 22 SICOMP Feigenbaum & Fortnow, Random-Self-Reducibility of Complete Sets 1993 22 SICOMP Goldman & Rivest & Schapire, Learning Binary Relations and Total Orders 1993 22 SICOMP Formann & Hagerup & Haralambides & Kaufmann & Leighton & Symvonis & Welzl & Woeginger, Drawing Graphs in the Plane with High Resolution 1993 22 SICOMP Bollobas & Simon, Probabilistic Analysis of Disjoint Set Union Algorithms 1993 22 SICOMP Lutz, A Pseudorandom Oracle Characterization of BPP 1993 22 SICOMP Jerrum & Sinclair, Polynomial-Time Approximation Algorithms for the Ising Model 1993 22 SICOMP Goerdt, Regular Resolution versus Unrestricted Resolution 1993 22 SICOMP Niederreiter & Schnorr, Local Randomness in Polynomial Random Number and Random Function Generators 1993 22 SICOMP Dur & Grabmeier, Applying Coding Theory to Sparse Interpolation 1993 22 SICOMP Goldman & Kearns & Schapire, Exact Identification of Read-Once Formulas Using Fixed Points of Amplification Functions 1993 22 SICOMP Moser & Melliar-Smith & Agrawala, Asynchronous Fault-Tolerant Total Ordering Algorithms 1993 22 SICOMP Goldstein & Reingold, A Fibonacci Version of Kraft's Inequality Applied to Discrete Unimodal Search 1993 22 SICOMP Agarwal & Pellegrini & Sharir, Counting Circular Arc Intersections 1993 22 SICOMP Agarwal & Matousek, Ray Shooting and Parametric Search 1993 22 SICOMP Kearns & Li, Learning in the Presence of Malicious Errors 1993 22 SICOMP Naor & Naor, Small-Bias Probability Spaces: Efficient Constructions and Applications 1993 22 SICOMP Harel & Raz, Deciding Properties of Nonregular Programs 1993 22 SICOMP Bar-Yehuda & Israeli & Itai, Multiple Communication in Multihop Radio Networks 1993 22 SICOMP Kao, Linear-Processor NC Algorithms for Planar Directed Graphs I: Strongly Connected Components 1993 22 SICOMP Kao & Shannon, Linear Processor NC Algorithms for Planar Directed Graphs II: Directed Spanning Trees 1993 22 SICOMP Bienstock & Diaz, Blocking Small Cuts in a Network, and Related Problems 1993 22 SICOMP Yeap & Sarrafzadeh, Floor-Planning by Graph Dualization: 2-Concave Rectilinear Modules 1993 22 SICOMP Edelsbrunner & Tan, A Quadratic Time Algorithm for the Minimax Length Triangulation 1993 22 SICOMP Kalorkoti, Inverting Polynomials and Formal Power Series 1993 22 SICOMP Buss & Goldsmith, Nondeterminism Within P 1993 22 SICOMP Kirousis & Serna & Spirakis, Parallel Complexity of the Connected Subgraph Problem 1993 22 SICOMP Fussell & Ramachandran & Thurimella, Finding Triconnected Components by Local Replacement 1993 22 SICOMP Bini & Pan, Improved Parallel Polynomial Division 1993 22 SICOMP Rosenkrantz & Hunt, The Complexity of Processing Hierarchical Specifications 1993 22 SICOMP Coffman & Flatto & Wright, A Stochastic Checkpoint Optimization Problem 1993 22 SICOMP Berkman & Vishkin, Recursive Star-Tree Parallel Data Structure 1993 22 SICOMP Tarhio & Ukkonen, Approximate Boyer-Moore String Matching 1993 22 SICOMP Fernandez de la Vega & Kannan & Santha, Two Probabilistic Results on Merging 1993 22 SICOMP Goddard & Kenyon & King & Schulman, Optimal Randomized Algorithms for Local Sorting and Set-Maxima 1993 22 SICOMP Karmarkar & Karp & Lipton & Lovasz & Luby, A Monte-Carlo Algorithm for Estimating the Permanent 1993 22 SICOMP Santha & Wilson, Limiting Negations in Constant Depth Circuits 1993 22 SICOMP Bugrara & Purdom, Average Time Analysis of Clause Order Backtracking 1993 22 SICOMP Bajaj & Canny & Garrity & Warren, Factoring Rational Polynomials over the Complex Numbers 1993 22 SICOMP Coffman & Flatto & Wright, Optimal Stochastic Allocation of Machines under Waiting-Time Constraints 1993 22 SICOMP Galambos & Woeginger, An On-Line Scheduling Heuristic with Better Worst Case Ratio Than Graham's List Scheduling 1993 22 SICOMP Cypher, Theoretical Aspects of VLSI Pin Limitations 1993 22 SICOMP Moran & Warmuth, Gap Theorems for Distributed Computation 1993 22 SICOMP Book & Lutz, On Languages With Very High Space-Bounded Kolmogorov Complexity 1993 22 SICOMP Alon & Naor, Coin-Flipping Games Immune against Linear-Sized Coalitions 1993 22 SICOMP Edelsbrunner & Seidel & Sharir, On the Zone Theorem for Hyperplane Arrangements 1993 22 SICOMP Fiat & Naor, Implicit O(1) Probe Search 1993 22 SICOMP Galil & Italiano, Maintaining the 3-Edge-Connected Components of a Graph On-Line 1993 22 SICOMP Hernandez & Wang, On the Boundedness of Constant-Time-Maintainable Database Schemes 1993 22 SICOMP Mao, Tight Worst-Case Performance Bounds for Next-k-Fit Bin Packing 1993 22 SICOMP Frederickson, A Note on the Complexity of a Simple Transportation Problem 1993 22 SICOMP Cypher, A Lower Bound on the Size of Shellsort Sorting Networks 1993 22 SICOMP Friedman, A Note on Poset Geometries 1993 22 SICOMP Kundu, An O(n) Algorithm for Determining the Subregion-Tree Representation of a Rectangular Dissection 1993 22 SICOMP Geffert, Tally Versions of the Savitch and Immerman-Szelepcsenyi Theorems for Sublogarithmic Space 1993 22 SICOMP Oyamaguchi, NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term-Rewriting Systems 1993 22 SICOMP Iwama, ASPACE(o(log log n)) Is Regular 1993 22 SICOMP Miltersen, The Complexity of Malign Measures 1993 22 SICOMP Cheriyan & Kao & Thurimella, Scan-First Search and Sparse Certificates: An Improved Parallel Algorithms for k-Vertex Connectivity 1993 22 SICOMP Weber, Decomposing Finite-Valued Transducers and Deciding Their Equivalence 1993 22 SICOMP Kratochvil & Savicky & Tuza, One More Occurrence of Variables Makes Satisfiability Jump from Trivial to NP-Complete 1993 22 SICOMP Nisan & Wigderson, Rounds in Communication Complexity Revisited 1992 21 SICOMP Du & Hwang, Reducing the Steiner Problem in a Normed Space 1992 21 SICOMP Renegar, On the Computational Complexity of Approximating Solutions for Real Algebraic Formulae 1992 21 SICOMP Shih & Chern & Hsu, An O(n^2 log n) Algorithm for the Hamiltonian Cycle Problem on Circular-Arc Graphs 1992 21 SICOMP Galil & Italiano, Fully Dynamic Algorithms for 2-Edge Connectivity 1992 21 SICOMP Martel & Park & Subramonian, Work-Optimal Asynchronous Algorithms for Shared Memory Parallel Computers 1992 21 SICOMP Wang, Polynomial Time Productivity, Approximations, and Levelability 1992 21 SICOMP Bein & Kamburowski & Stallmann, Optimal Reductions of Two-Terminal Directed Acyclic Graphs 1992 21 SICOMP Frederickson & Guan, Preemptive Ensemble Motion Planning on a Tree 1992 21 SICOMP Tompa, Lower Bounds on Universal Traversal Sequences for Cycles and Other Low Degree Graphs 1992 21 SICOMP Bellantoni & Pitassi & Urquhart, Approximation and Small-Depth Frege Proofs 1992 21 SICOMP Prodinger, External Internal Nodes in Digital Search Trees via Mellin Transforms 1992 21 SICOMP Dixon & Rauch & Tarjan, Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time 1992 21 SICOMP Shokrollahi, Optimal Algorithms for Multiplication in Certain Finite Fields Using Elliptic Curves 1992 21 SICOMP Koch, Increasing the Size of a Network by a Constant Factor Can Increase Performance by More Than a Constant Factor 1992 21 SICOMP Yu & Rosenkrantz, Representability of Design Objects by Ancestor-Controlled Hierarchical Specifications 1992 21 SICOMP Breslauer & Galil, A Lower Bound for Parallel String Matching 1992 21 SICOMP Suzuki & Yamashita, Searching for a Mobile Intruder in a Polygonal Region 1992 21 SICOMP Dolev & Feder, Determinism vs. Nondeterminism in Multiparty Communication Complexity 1992 21 SICOMP Reif & Tate, On Threshold Circuits and Polynomial Computation 1992 21 SICOMP Just, Generalizing the Continued Fraction Algorithm to Arbitrary Dimensions 1992 21 SICOMP Heath & Rosenberg, Laying Out Graphs Using Queues 1992 21 SICOMP Loui & Luginbuhl, Optimal On-Line Simulations of Tree Machines by Random Access Machines 1992 21 SICOMP Cheng & Janardan, New Results on Dynamic Planar Point Location 1992 21 SICOMP Balas & Xue, Addendum: Minimum Weighted Coloring of Triangulated Graphs, With Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs 1992 21 SICOMP Melissaratos & Souvaine, Shortest Paths Help Solve Geometric Optimization Problems in Planar Regions 1992 21 SICOMP Leighton & Newman & Ranade & Schwabe, Dynamic Tree Embeddings in Butterflies and Hypercubes 1992 21 SICOMP Venkateswaran, Circuit Definitions of Nondeterministic Complexity Classes 1992 21 SICOMP Chazelle, An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra 1992 21 SICOMP Li & Longpre & Vitanyi, The Power of the Queue 1992 21 SICOMP Aldous & Hofri & Szpankowski, Maximum Size of a Dynamic Data Structure: Hashing with Lazy Deletion Revisited 1992 21 SICOMP Ganesan & Homer, Complete Problems and Strong Polynomial Reducibilities 1992 21 SICOMP Chang, On the Structure of Bounded Queries to Arbitrary NP Sets 1992 21 SICOMP Buss & Cook & Gupta & Ramachandran, An Optimal Parallel Algorithm for Formula Evaluation 1992 21 SICOMP Bini & Gemignani, On the Complexity of Polynomial Zeros 1992 21 SICOMP Galil & Giancarlo, On the Exact Complexity of String Matching: Upper Bounds 1992 21 SICOMP Natarajan, Probably Approximate Learning over Classes of Distributions 1992 21 SICOMP Papadimitriou, The Complexity of the Lin-Kernighan Heuristic for the Traveling Salesman Problem 1992 21 SICOMP Reif & Sen, Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems 1992 21 SICOMP Khuller & Mitchell & Vazirani, Processor Efficient Parallel Algorithms for the Two Disjoint Paths Problem and for Finding a Kuratowski Homeomorph 1992 21 SICOMP Gatterdam, Algorithms for Splicing Systems 1992 21 SICOMP Allender & Hemachandra & Ogiwara & Watanabe, Relating Equivalence and Reducibility to Sparse Sets 1992 21 SICOMP Agarwal, Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number 1992 21 SICOMP Kari, The Nilpotency Problem of One-Dimensional Cellular Automata 1992 21 SICOMP Gu & Maruoka, Learning Monotone Boolean Functions by Uniformly Distributed Examples 1992 21 SICOMP Bui & Peck, Partitioning Planar Graphs 1992 21 SICOMP Tzeng, A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata 1992 21 SICOMP Menezes & van Oorschot & Vanstone, Subgroup Refinement Algorithms for Root Finding in GF(q) 1992 21 SICOMP Helmbold & Sloan & Warmuth, Learning Integer Lattices 1992 21 SICOMP Preparata & Tamassia, Efficient Point Location in a Convex Spatial Cell-Complex 1992 21 SICOMP Wang & Cheng, A Heuristic of Scheduling Parallel Tasks and Its Analysis 1992 21 SICOMP Chen, Heuristic Sampling: A Method for Predicting the Performance of Tree Searching Programs 1992 21 SICOMP Toda & Ogiwara, Counting Classes Are at Least as Hard as the Polynomial-Time Hierarchy 1992 21 SICOMP Azar, Lower Bounds for Threshold and Symmetric Functions in Parallel Computation 1992 21 SICOMP Bajaj & Dey, Convex Decomposition of Polyhedra and Robustness 1992 21 SICOMP Krumme, Fast Gossiping for the Hypercube 1992 21 SICOMP Jamison & Olariu, Recognizing P_4 Sparse Graphs in Linear Time 1992 21 SICOMP Halperin & Overmars & Sharir, Efficient Motion Planning for an L-Shaped Object 1992 21 SICOMP Baeza-Yates & Casas & Diaz & Martinez, On the Average Size of the Intersection of Binary Trees 1992 21 SICOMP Bruck & Smolensky, Polynomial Threshold Functions, AC^0 Functions, and Spectral Norms 1992 21 SICOMP Gereb-Graus & Krizanc, The Average Complexity of Parallel Comparison Merging 1992 21 SICOMP Devroye & Szpankowski & Rais, A Note on the Height of Suffix Trees 1992 21 SICOMP Ben-Or & Cleve, Computing Algebraic Formulas Using a Constant Number of Registers 1992 21 SICOMP Tsai, Asymptotic Analysis of an Algorithm for Balanced Parallel Processor Scheduling 1992 21 SICOMP Hendrickson, Conditions for Unique Graph Realizations 1992 21 SICOMP Landau, Simplification of Nested Radicals 1992 21 SICOMP Krumme & Cybenko & Venkataraman, Gossiping in Minimal Time 1992 21 SICOMP Goldberg & Plotkin & Shmoys & Tardos, Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems 1992 21 SICOMP Bhatt & Chung & Leighton & Rosenberg, Efficient Embeddings of Trees in Hypercubes 1992 21 SICOMP Snyder, On the Exact Location of Steiner Points in General Dimension 1992 21 SICOMP Fischer & Simon, On Learning Ring-Sum-Expansions 1992 21 SICOMP Linial, Locality in Distributed Graph Algorithms 1991 20 SICOMP Nisan, CREW PRAMs and Decision Trees 1991 20 SICOMP Galil & Giancarlo, On the Exact Complexity of String Matching: Lower Bounds 1991 20 SICOMP Rubinstein, Self-P-Printability and Polynomial Time Turing Equivalence to a Tally Set 1991 20 SICOMP Overmars & Yap, New Upper Bounds in Klee's Measure Problem 1991 20 SICOMP Gazit, An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph 1991 20 SICOMP Hafner & McCurley, Asymptotically Fast Triangularization of Matrices over Rings 1991 20 SICOMP Blum & De Santis & Micali & Persiano, Noninteractive Zero-Knowledge 1991 20 SICOMP Franco, Elimination of Infrequent Variables Improves Average Case Performance of Satisfiability Algorithms 1991 20 SICOMP Miller & Reif, Parallel Tree Contraction, Part 2: Further Applications 1991 20 SICOMP Hemachandra & Hoene, On Sets with Efficient Implicit Membership Tests 1991 20 SICOMP Galil & Margalit, An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem 1991 20 SICOMP Kenyon-Mathieu & Vitter, The Maximum Size of Dynamic Data Structures 1991 20 SICOMP Kutylowski, Time Complexity of Boolean Functions on CREW PRAMs 1991 20 SICOMP Chan, Embedding of Grids into Optimal Hypercubes 1991 20 SICOMP Toda, PP Is as Hard as the Polynomial-Time Hierarchy 1991 20 SICOMP Pippenger, Selection Networks 1991 20 SICOMP Ghosh & Mount, An Output-Sensitive Algorithm for Computing Visibility Graphs 1991 20 SICOMP Li & Vitanyi, Learning Simple Concept under Simple Distributions 1991 20 SICOMP Luo & Tsitsiklis, On the Communication Complexity of Solving a Polynomial Equation 1991 20 SICOMP Friedman, The Spectra of Infinite Hypertrees 1991 20 SICOMP Ko, On the Complexity of Learning Minimum Time-Bounded Turing Machines 1991 20 SICOMP Ho & Lee & Chang & Wong, Minimum Diameter Spanning Trees and Related Problems 1991 20 SICOMP Landau, Erratum: Factoring Polynomials over Algebraic Number Fields 1991 20 SICOMP Mehlhorn & Yap, Constructive Whitney-Graustein Theorem: Or How to Untangle Closed Planar Curves 1991 20 SICOMP Chen & Yap, Reversal Complexity 1991 20 SICOMP Gusfield, Computing the Strength of a Graph 1991 20 SICOMP Yao, Lower Bounds for Algebraic Computation Trees with Integer Inputs 1991 20 SICOMP Reutenauer & Schutzenberger, Minimization of Rational Word Functions 1991 20 SICOMP Sutter, The Fast m-Transform: A Fast Computation of Cross-Correlations with Binary m-Sequences 1991 20 SICOMP Dyer, On Counting Lattice Points in Polyhedra 1991 20 SICOMP Tamassia & Vitter, Parallel Transitive Closure and Point Location in Planar Structures 1991 20 SICOMP Chung & Ross, On Nonblocking Multirate Interconnection Networks 1991 20 SICOMP Goodrich, Intersecting Line Segments in Parallel with an Output-Sensitive Number of Processors 1991 20 SICOMP Davida & Litow, Fast Parallel Arithmetic via Modular Representation 1991 20 SICOMP Pigozzi, Equality-Test and If-Then-Else Algebras: Axiomatization and Specification 1991 20 SICOMP Marcotte & Suri, Fast Matching Algorithms for Points on a Polygon 1991 20 SICOMP Wolfson & Segall, The Communication Complexity of Atomic Commitment and of Gossiping 1991 20 SICOMP Baum & Clausen, Some Lower and Upper Complexity Bounds for Generalized Fourier Transforms and Their Inverses 1991 20 SICOMP Pach & Sharir, On Vertical Visibility in Arrangements of Segments and the Queue Size in the Bentley-Ottmann Line Sweeping Algorithm 1991 20 SICOMP Ogiwara & Watanabe, On Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets 1991 20 SICOMP Geffert, Nondeterministic Computations in Sublogarithmic Space and Space Constructibility 1991 20 SICOMP Zwick, A 4n Lower Bound on the Combinational Complexity of Certain Symmetric Boolean Functions over the Basis of Unate Dyadic Boolean Functions 1991 20 SICOMP Goldsmith & Hemachandra & Joseph & Young, Near-Testable Sets 1991 20 SICOMP Goldberg & Sipser, Compression and Ranking 1991 20 SICOMP Shih & Liu & Chung, Algorithms for Scheduling Imprecise Computations with Timing Constraints 1991 20 SICOMP Clote & Kranakis, Boolean Functions, Invariance Groups, and Parallel Complexity 1991 20 SICOMP von zur Gathen, Tests for Permutation Polynomials 1991 20 SICOMP Balas & Xue, Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs 1991 20 SICOMP Matousek, Approximate Levels in Line Arrangements 1991 20 SICOMP Ja'Ja' & Chang, Parallel Algorithms for Channel Routing in the Knock-Knee Model 1991 20 SICOMP Book, Some Observations on Separating Complexity Classes 1991 20 SICOMP Edelsbrunner & Shi, An O(n log^2 h) Time Algorithm for the Three-Dimensional Convex Hull Problem 1991 20 SICOMP Beame, A General Sequential Time-Space Tradeoff for Finding Unique Elements 1991 20 SICOMP Ibarra & Jiang, The Power of Alternating One-Reversal Counters and Stacks 1991 20 SICOMP Roth & Benedek, Interpolation and Approximation of Sparse Multivariate Polynomials over GF(2) 1991 20 SICOMP Mansour & Schieber & Tiwari, Lower Bounds for Computations with the Floor Operation 1991 20 SICOMP Natarajan, Probably Approximate Learning of Sets and Functions 1991 20 SICOMP Khuller & Schieber, Efficient Parallel Algorithms for Testing k-Connectivity and Finding Disjoint s-t Paths in Graphs 1991 20 SICOMP Afek & Gafni, Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks 1991 20 SICOMP Gritzmann & Habsieger & Klee, Good and Bad Radii of Convex Polygons 1991 20 SICOMP Kadin, Erratum: The Polynomial Time Hierarchy Collapses If the Boolean Hierarchy Collapses 1991 20 SICOMP Duval, Absolute Factorization of Polynomials: A Geometric Approach 1991 20 SICOMP Vishkin, Deterministic Sampling--A New Technique for Fast Pattern Matching 1991 20 SICOMP Gu & Maruoka, Amplification of Bounded Depth Monotone Read-Once Boolean Formulae 1991 20 SICOMP Schaffer & Yannakakis, Simple Local Search Problems that are Hard to Solve 1991 20 SICOMP Parberry & Yan, Improved Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes 1991 20 SICOMP Ullman & Yannakakis, High-Probability Parallel Transitive-Closure Algorithms 1991 20 SICOMP Tung, Complexity of Sentences over Number Rings 1991 20 SICOMP Chrobak & Larmore, An Optimal On-Line Algorithm for k-Servers on Trees 1991 20 SICOMP Sutner & Satyanarayana & Suffel, The Complexity of the Residual Node Connectedness Reliability Problem 1991 20 SICOMP Reingold & Shen, More Nearly Optimal Algorithms for Unbounded Searching, Part I: The Finite Case 1991 20 SICOMP Reingold & Shen, More Nearly Optimal Algorithms for Unbounded Searching, Part II: The Transfinite Case 1990 19 SICOMP Galil & Park, An Improved Algorithm for Approximate String Matching 1990 19 SICOMP Lueker & Megiddo & Ramachandran, Linear Programming with Two Variables Per Inequality in Poly-Log Time 1990 19 SICOMP Dwork & Stockmeyer, A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata 1990 19 SICOMP Sugihara & Suzuki & Yamashita, The Seqrchlight Scheduling Problem 1990 19 SICOMP Lee & Sarrafzadeh & Wu, Minimum Cuts for Circular-Arc Graphs 1990 19 SICOMP Breslauer & Galil, An Optimal O(log log n) Time Parallel String Matching Algorithm 1990 19 SICOMP Grigoriev & Karpinski & Singer, Fast Parallel Algorithms for sparse Multivariate Polynomial Interpolation Over Finite Fields 1990 19 SICOMP Alon & Karchmer & Wigderson, Linear Circuits Over GF(2) 1990 19 SICOMP Friedman, Random Polynomials and Approximate Zeros of Newton's Method 1990 19 SICOMP Lutz, Category and Measure in Complexity Classes 1990 19 SICOMP Murota, Computing Puiseux-Series Solutions to Determinantal Equations via Combinatorial Relaxation 1990 19 SICOMP Schmidt & Siegel, The Spatial Complexity of Oblivious k-Probe Hash Functions 1990 19 SICOMP Gradel, Domino Games and Complexity 1990 19 SICOMP Cypher & Sanz & Snyder, The Hough Transform has O(N) Complexity on N x N Mesh Connected Computers 1990 19 SICOMP Devroye & Laforest, An Analysis of Random d-Dimensional Quad Trees 1990 19 SICOMP Wagner, Bounded Query Classes 1990 19 SICOMP Li & Cheng, On Three-Dimensional Packing 1990 19 SICOMP Lucas, Postorder Disjoint Set Union is Linear 1990 19 SICOMP Iwano & Steiglitz, A Semiring on Convex Polygons and Zero-Sum Cycle Problems 1990 19 SICOMP Mehlhorn & Naher & Rauch, On the Complexity of a Game Related to the Dictionary Problem 1990 19 SICOMP Bienstock, Linear-Time Test for Small Face Covers in any Fixed Surface 1990 19 SICOMP Reif & Tate, Optimal Size Integer Division Circuits 1990 19 SICOMP Johnstone & Bajaj, Sorting Points Along an Algebraic Curve 1990 19 SICOMP Apostolico & Atallah & Larmore & McFaddin, Efficient Parallel Algorithms for String Editing and Related Problems 1990 19 SICOMP Mount, The Number of Shortest Paths on the Surface of a Polyhedron 1990 19 SICOMP Chin & Ting, Improving the Time Complexity of Message-Optimal Distributed Algorithms for Minimum-Weight Spanning Trees 1990 19 SICOMP Jover & Kailath & Lev-Ari & Rao, On the Analysis of Synchronous Computing Systems 1990 19 SICOMP Dezani-Ciancaglini & Venneri, Partial Types and Intervals 1990 19 SICOMP Jackson, Shortest Circuit Covers and Postman Tours in Graphs with a Nowhere Zero 4-Flow 1990 19 SICOMP Frieze & McDiarmid & Reed, Greedy Matching on the Line 1990 19 SICOMP Levin & Sherman, A Note on Bennett's Time-Space Tradeoff for Reversible Computation 1990 19 SICOMP Hagerup, Planar Depth-First Search in O(log n) Parallel Time 1990 19 SICOMP Rhee, A Note on Optimal Bin Packing and Optimal Bin Covering with Items of Random Size 1990 19 SICOMP Stinson, Some Observations on Parallel Algorithms for Fast Exponentiation in GF(2^n) 1990 19 SICOMP Fich & Wigderson, Toward Understanding Exclusive Read 1990 19 SICOMP Munshi & Simons, Scheduling Sequential Loops on Parallel Processors 1990 19 SICOMP Krentel, On Finding and Verifying Locally Optimal Solutions 1990 19 SICOMP Dube, The Structure of Polynomial Ideals and Grobner Bases 1990 19 SICOMP Molzan, Expressibility and Nonuniform Complexity Classes 1990 19 SICOMP Seidl, Deciding Equivalence of Finite Tree Automata 1990 19 SICOMP Grandjean, A Nontrivial Lower Bound for an NP Problem on Automata 1990 19 SICOMP Bshouty & Kaminski, Multiplication of Polynomials over Finite Fields 1990 19 SICOMP Ye, A Class of Projective Transformations for Linear Programming 1990 19 SICOMP Bshouty, Maximal Rank of m x n x (mn - k) Tensors 1990 19 SICOMP Dwork & Shmoys & Stockmeyer, Flipping Persuasively in Constant Time 1990 19 SICOMP Eppstein, Reset Sequences for Monotonic Automata 1990 19 SICOMP Liskiewicz & Lorys, Fast Simulations of Time-Bounded One-Tape Turing Machines by Space-Bounded Ones 1990 19 SICOMP Beigel, Unbounded Searching Algorithms 1990 19 SICOMP Sakkalis, The Euclidean Algorithm and the Degree of the Gauss Map 1990 19 SICOMP Annexstein & Baumslag & Rosenberg, Group Action Graphs and Parallel Architectures 1990 19 SICOMP Wagner & Corneil, Embedding Trees in a Hypercube is NP-Complete 1990 19 SICOMP Vaishnavi, Erratum: Weighted Leaf AVL-Trees 1990 19 SICOMP Kutylowski & Liskiewicz & Lorys, Reversal Complexity Classes for Alternating Turing Machines 1990 19 SICOMP Whitehead, The Complexity of File Transfer Scheduling with Forwarding 1990 19 SICOMP Bilardi & Preparata, Characterization of Associative Operations with Prefix Circuits of Constant Depth and Linear Size 1990 19 SICOMP Peleg & Upfal, A Time-Randomness Trade-Off for Oblivious Routing 1990 19 SICOMP Plaisted, A Heuristic Algorithm for Small Separators in Arbitrary Graphs 1990 19 SICOMP Sanchis & Fulk, On the Efficient Generation of Language Instances 1990 19 SICOMP Agarwal & Sharir, Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection 1990 19 SICOMP Papadimitriou & Yannakakis, Towards an Architecture-Independent Analysis of Parallel Algorithms 1990 19 SICOMP Floyd & Knuth, Addition Machines 1990 19 SICOMP Rutten, Semantic Correctness for a Parallel Object-Oriented Language 1990 19 SICOMP Wilson, On the Decomposability of NC and AC 1990 19 SICOMP Aggarwal & Anderson & Kao, Parallel Depth-First Search in General Directed Graphs 1990 19 SICOMP Palis & Shende & Wei, An Optimal Linear-Time Parallel Parser for Tree Adjoining Languages 1990 19 SICOMP Hentzel & Jacobs, Complexity and Unsolvability Properties of Nilpotency 1990 19 SICOMP Hunt & Stearns, The Complexity of Very Simple Boolean Formulas with Applications 1990 19 SICOMP Ng & Hirschberg, Lower Bounds for the Stable Marriage Problem and Its Variants 1990 19 SICOMP Yokouchi & Hikita, A Rewriting System for Categorical Combinators with Multiple Arguments 1990 19 SICOMP Labahn & Choi & Cabay, The Inverses of Block Hankel and Block Toeplitz Matrices 1990 19 SICOMP Friedman, A Density Theorem for Purely Iterative Zero Finding Methods 1990 19 SICOMP Dowling, A Fast Parallel Horner Algorithm 1990 19 SICOMP Gusfield, Very Simple Methods for all Pairs Network Flow Analysis 1990 19 SICOMP Scheinerman, On the Expected Capacity of Binomial and Random Concentrators 1990 19 SICOMP Frederickson & Janardan, Space-Efficient Message Routing in c-Decomposable Networks 1990 19 SICOMP Hoover, Feasible Real Functions and Arithmetic Circuits 1990 19 SICOMP Frederickson & Johnson, Erratum: Generalized Selection and Ranking: Sorted Matrices 1989 18 SICOMP Cheriyan & Maheshwari, Analysis of Preflow Push Algorithms for Maximum Network Flow 1989 18 SICOMP Ladner, Polynomial Space Counting Problems 1989 18 SICOMP Bernstein & Jaffe & Rodeh, Scheduling Arithmetic and Load Operations in Parallel with No Spilling 1989 18 SICOMP Rappaport, Computing Simple Circuits from a Set of Line Segments Is NP-Complete 1989 18 SICOMP Vazirani & Vazirani, The Two-Processor Scheduling Problem Is in Random NC 1989 18 SICOMP Jerrum & Sinclair, Approximating the Permanent 1989 18 SICOMP Schimmler & Starke, A Correction Network for N-Sorters 1989 18 SICOMP Li & Reingold, Solution of a Divide-and-Conquer Maximin Recurrence 1989 18 SICOMP Vaidya, Geometry Helps in Matching 1989 18 SICOMP Chen & Shin, On Relaxed Squashed Embedding of Graphs into a Hypercube 1989 18 SICOMP Zhang & Shasha, Simple Fast Algorithms for the Editing Distance Between Trees and Related Problems 1989 18 SICOMP Ravikumar & Ibarra, Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation 1989 18 SICOMP Borodin & Cook & Dymond & Ruzzo & Tompa, Erratum: Two Applications of Inductive Counting for Complementation Problems 1989 18 SICOMP Hastad & Just & Lagarias & Schnorr, Polynomial Time Algorithms for Finding Integer Relations among Real Numbers 1989 18 SICOMP Anily & Hassin, Ranking the Best Binary Trees 1989 18 SICOMP Cherry, An Analysis of the Rational Exponential Integral 1989 18 SICOMP Verma & Reyner, An Analysis of a Good Algorithm for the Subtree Problem, Corrected 1989 18 SICOMP Rhee & Talagrand, The Complete Convergence of Best Fit Decreasing 1989 18 SICOMP Rhee & Talagrand, The Complete Convergence of First Fit Decreasing 1989 18 SICOMP Ahuja & Orlin & Tarjan, Improved Time Bounds for the Maximum Flow Problem 1989 18 SICOMP Eberly, Very Fast Parallel Polynomial Arithmetic 1989 18 SICOMP Doberkat, Topological Completeness in an Ideal Model for Polymorphic Types 1989 18 SICOMP Coan & Dolev & Dwork & Stockmeyer, The Distributed Firing Squad Problem 1989 18 SICOMP Gabow & Tarjan, Faster Scaling Algorithms for Network Problems 1989 18 SICOMP Brown & Finkelstein & Purdom, A New Base Change Algorithm for Permutation Groups 1989 18 SICOMP Humenik, Ratio Estimators Are Maximum-Likelihood Estimators for Non-Context-Free Grammars 1989 18 SICOMP Labahn & Cabay, Matrix Pade Fractions and Their Computation 1989 18 SICOMP Iliopoulos, Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Finite Abelian Groups and the Hermite and Smith Normal Forms of an Integer Matrix 1989 18 SICOMP Iliopoulos, Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Infinite Abelian Groups and Solving Systems of Linear Diophantine Equations 1989 18 SICOMP Yao, On the Complexity of Partial Order Productions 1989 18 SICOMP Simons & Warmuth, A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs 1989 18 SICOMP Galil & Haber & Yung, Minimum-Knowledge Interactive Proofs for Decision Problems 1989 18 SICOMP Peleg & Ullman, An Optimal Synchronizer for the Hypercube 1989 18 SICOMP Vaidya, Space-Time Trade-Offs for Orthogonal Range Queries 1989 18 SICOMP Bshouty, A Lower Bound for Matrix Multiplication 1989 18 SICOMP Bennett, Time/Space Trade-Offs for Reversible Computation 1989 18 SICOMP Jacquet & Szpankowski, Ultimate Characterizations of the Burst Response of an Interval Searching Algorithm: A Study of a Functional Equation 1989 18 SICOMP Cole & Salowe & Steiger & Szemeredi, An Optimal-Time Algorithm for Slope Selection 1989 18 SICOMP Preparata & Tamassia, Fully Dynamic Point Location in a Monotone Subdivision 1989 18 SICOMP Culik & Pachl & Yu, On the Limit Sets of Cellular Automata 1989 18 SICOMP Frederickson & Janardan, Efficient Message Routing in Planar Networks 1989 18 SICOMP Chan, A Design Theory for Solving the Anomalies Problem 1989 18 SICOMP Tang & Watanabe, On Tally Relativizations of BP-Complexity Classes 1989 18 SICOMP Li, Dynamic Programming by Exchangeability 1989 18 SICOMP Rhee & Talagrand, Optimal Bin Packing with Items of Random Sizes III 1989 18 SICOMP Rhee & Talagrand, Optimal Bin Covering with Items of Random Size 1989 18 SICOMP Atallah & Cole & Goodrich, Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms 1989 18 SICOMP Venkateswaran & Tompa, A New Pebble Game That Characterizes Parallel Complexity Classes 1989 18 SICOMP Furst & Kannan, Succinct Certificates for Almost All Subset Sum Problems 1989 18 SICOMP Borodin & Cook & Dymond & Ruzzo & Tompa, Two Applications of Inductive Counting for Complementation Problems 1989 18 SICOMP Barahona & Tardos, Note on Weintraub's Minimum-Cost Circulation Algorithm 1989 18 SICOMP Clausen, Fast Fourier Transforms for Metabelian Groups 1989 18 SICOMP Rajasekaran & Reif, Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms 1989 18 SICOMP Norton, Precise Analyses of the Right- and Left-Shift Greatest Common Divisor Algorithms for GF(q)[x] 1989 18 SICOMP Immerman, Expressibility and Parallel Complexity 1989 18 SICOMP Lickteig, A Lower Bound on the Complexity of Division in Finite Extension Fields and Inversion in Quadratic Alternative Algebras 1989 18 SICOMP Bilardi & Nicolau, Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines 1989 18 SICOMP Peleg & Upfal, The Token Distribution Problem 1989 18 SICOMP Hwang & Chow & Anger & Lee, Scheduling Precedence Graphs in Systems with Interprocessor Communication Times 1989 18 SICOMP Alon & Azar, Finding an Approximate Maximum 1989 18 SICOMP Bar-Noy & Borodin & Karchmer & Linial & Werman, Bounds on Universal Sequences 1989 18 SICOMP Steele & Snyder, Worst-Case Growth Rates of Some Classical Problems of Combinatorial Optimization 1989 18 SICOMP Hagerup & Chrobak & Diks, Optimal Parallel 5-Colouring of Planar Graphs 1989 18 SICOMP Melen & Turner, Nonblocking Multirate Networks 1989 18 SICOMP Leung & Young, Minimizing Schedule Length Subject to Minimum Flow Time 1989 18 SICOMP Naor & Naor & Schaffer, Fast Parallel Algorithms for Chordal Graphs 1989 18 SICOMP Renegar, On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials 1989 18 SICOMP Yao & Dobkin & Edelsbrunner & Paterson, Partitioning Space for Range Queries 1989 18 SICOMP Iwama, CNF Satisfiability Test by Counting and Polynomial Average Time 1989 18 SICOMP Ko, Relativized Polynomial Time Hierarchies Having Exactly K Levels 1989 18 SICOMP Bugrara & Pan & Purdom, Exponential Average Time for the Pure Literal Rule 1989 18 SICOMP Goldberg & Spencer, A New Parallel Algorithm for the Maximal Independent Set Problem 1989 18 SICOMP Westbrook & Tarjan, Amortized Analysis of Algorithms for Set Union with Backtracking 1989 18 SICOMP Abrahamson & Adler & Gelbart & Higham & Kirkpatrick, The Bit Complexity of Randomized Leader Election on a Ring 1989 18 SICOMP Gallo & Grigoriadis & Tarjan, A Fast Parametric Maximum Flow Algorithm and Applications 1989 18 SICOMP Wilber, Lower Bounds for Accessing Binary Search Trees with Rotations 1989 18 SICOMP Korte & Mohring, An Incremental Linear-Time Algorithm for Recognizing Interval Graphs 1989 18 SICOMP Larmore, Minimum Delay Codes 1989 18 SICOMP Cai & Gundermann & Hartmanis & Hemachandra & Sewelson & Wagner & Wechsung, The Boolean Hierarchy II: Applications 1989 18 SICOMP Frederickson & Srinivas, Algorithms and Data Structures for an Expanded Family of Matroid Intersection Problems 1989 18 SICOMP Rhee & Talagrand, Optimal Bin Packing with Items of Random Sizes II 1989 18 SICOMP Ordman, Minimal Threshold Separators and Memory Requirements for Synchronization 1989 18 SICOMP Coffman & Lagarias, Algorithms for Packing Squares: A Probabilistic Analysis 1989 18 SICOMP Goldwasser & Micali & Rackoff, The Knowledge Complexity of Interactive Proof Systems 1988 17 SICOMP Lengauer & Wanke, Efficient Solution of Connectivity Problems on Hierarchically Defined Graphs 1988 17 SICOMP Ben-Or & Feig & Kozen & Tiwari, A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots 1988 17 SICOMP Mehlhorn & Naher & Alt, A Lower Bound on the Complexity of the Union-Split-Find Problem 1988 17 SICOMP Morris & Wong, A Short-Term Neural Network Memory 1988 17 SICOMP Bollobas & Brightwell, Transitive Orientations of Graphs 1988 17 SICOMP Bergstra & Klop & Olderog, Readies and Failures in the Algebra of Communicating Processes 1988 17 SICOMP Alon & Azar, The Average Complexity of Deterministic and Randomized Parallel Comparison-Sorting Algorithms 1988 17 SICOMP Allender & Rubinstein, P-Printable Sets 1988 17 SICOMP Knight, Search in an Ordered Array Having Variable Probe Cost 1988 17 SICOMP Kong & Mount & Roscoe, The Decomposition of a Rectangle into Rectangles of Minimal Perimeter 1988 17 SICOMP Cai & Gundermann & Hartmanis & Hemachandra & Sewelson & Wagner & Wechsung, The Boolean Hierarchy I: Structural Properties 1988 17 SICOMP Schieber & Vishkin, On Finding Lowest Common Ancestors: Simplification and Parallelization 1988 17 SICOMP Kadin, The Polynomial Time Hierarchy Collapses if the Boolean Hierarchy Collapses 1988 17 SICOMP Atallah & Kosaraju, Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel 1988 17 SICOMP Edelsbrunner & Skiena, Probing Convex Polygons with X-Rays 1988 17 SICOMP Karp & Motwani & Raghavan, Deferred Data Structuring 1988 17 SICOMP Book & Ko, On Sets Truth-Table Reducible to Sparse Sets 1988 17 SICOMP Provan, An Approximation Scheme for Finding Steiner Trees with Obstacles 1988 17 SICOMP Immerman, Nondeterministic Space Is Closed under Complementation 1988 17 SICOMP Bloom & Esik, Varieties of Iteration Theories 1988 17 SICOMP Dyer & Frieze, On the Complexity of Computing the Volume of a Polyhedron 1988 17 SICOMP Dwork & Peleg & Pippenger & Upfal, Fault Tolerance in Networks of Bounded Degree 1988 17 SICOMP Selman, Natural Self-Reducible Sets 1988 17 SICOMP Hennessy, Axiomatising Finite Concurrent Processes 1988 17 SICOMP Miller, A Linear Algorithm for Topological Bandwidth in Degree-Three Trees 1988 17 SICOMP Zellini, Optimal Bounds for Solving Tridiagonal Systems with Preconditioning 1988 17 SICOMP McDiarmid, Average-Case Lower Bounds for Searching 1988 17 SICOMP Tarjan & Van Wyk, Erratum: An O(n log log n)-Time Algorithm for Triangulating a Simple Polygon 1988 17 SICOMP Dershowitz & Marcus & Tarlecki, Existence, Uniqueness, and Construction of Rewrite Systems 1988 17 SICOMP John, A New Lower Bound for the Set-Partitioning Problem 1988 17 SICOMP Schaback, On the Expected Sublinearity of the Boyer-Moore Algorithm 1988 17 SICOMP Vitanyi, Locality, Communication, and Interconnect Length in Multicomputers 1988 17 SICOMP Kucera & Trnkova, Isomorphism Testing of Unary Algebras 1988 17 SICOMP Miller & Ramachandran & Kaltofen, Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits 1988 17 SICOMP Ravi & Lloyd, The Complexity of Near-Optimal Programmable Logic Array Folding 1988 17 SICOMP Dwork & Kanellakis & Stockmeyer, Parallel Algorithms for Term Matching 1988 17 SICOMP Avis & Lai, The Probabilistic Analysis of a Heuristic for the Assignment Problem 1988 17 SICOMP Gusfield, The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of all Stable Assignments 1988 17 SICOMP Cole, Parallel Merge Sort 1988 17 SICOMP Grandjean, A Natural NP-Complete Problem with a Nontrivial Lower Bound 1988 17 SICOMP Gabow, Scheduling UET Systems on Two Uniform Processors and Length Two Pipelines 1988 17 SICOMP Clarkson, A Randomized Algorithm for Closest-Point Queries 1988 17 SICOMP Chazelle, A Functional Approach to Data Structures and Its Use in Multidimensional Searching 1988 17 SICOMP Klein & Reif, Parallel Time O(log n) Acceptance of Deterministic CFLs on an Exclusive-Write P-RAM 1988 17 SICOMP He & Yesha, A Nearly Optimal Parallel Algorithm for Constructing Depth First Spanning Trees in Planar Graphs 1988 17 SICOMP Pittel & Yu, On Search Times for Early-Insertion Coalesced Hashing 1988 17 SICOMP Book & Orponen & Russo & Watanabe, Lowness Properties of Sets in the Exponential-Time Hierarchy 1988 17 SICOMP Yao, Monotone Bipartite Graph Properties Are Evasive 1988 17 SICOMP D'Atri & Moscarini, Distance-Hereditary Graphs, Steiner Trees, and Connected Domination 1988 17 SICOMP Hochbaum & Shmoys, A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach 1988 17 SICOMP Gusfield, A Graph Theoretic Approach to Statistical Data Security 1988 17 SICOMP Vaidya, Minimum Spanning Trees in k-Dimensional Space 1988 17 SICOMP Siegel & Dolev, Some Geometry for General River Routing 1988 17 SICOMP Fich & Ragde & Wigderson, Relations Between Concurrent-Write Models of Parallel Computation 1988 17 SICOMP Long, Erratum: On Restricting the Size of Oracles Compared with Restricting Access to Oracles 1988 17 SICOMP Bach, How to Generate Factored Random Numbers 1988 17 SICOMP Alexi & Chor & Goldreich & Schnorr, RSA and Rabin Functions: Certain Parts Are as Hard as the Whole 1988 17 SICOMP Bennett & Brassard & Robert, Privacy Amplification by Public Discussion 1988 17 SICOMP Chor & Goldreich, Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity 1988 17 SICOMP Frieze & Hastad & Kannan & Lagarias & Shamir, Reconstructing Truncated Integer Variables Satisfying Linear Congruences 1988 17 SICOMP Goldwasser & Micali & Rivest, A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks 1988 17 SICOMP Grollmann & Selman, Complexity Measures for Public-Key Cryptosystems 1988 17 SICOMP Hastad, Solving Simultaneous Modular Equations of Low Degree 1988 17 SICOMP Lagarias & Reeds, Unique Extrapolation of Polynomial Recurrences 1988 17 SICOMP Long & Wigderson, The Discrete Logarithm Hides O(log n) Bits 1988 17 SICOMP Luby & Rackoff, How to Construct Pseudorandom Permutations from Pseudorandom Functions 1988 17 SICOMP Pomerance & Smith & Tuler, A Pipeline Architecture for Factoring Large Integers with the Quadratic Sieve Algorithm 1988 17 SICOMP Reif & Tygar, Efficient Parallel Pseudorandom Number Generation 1988 17 SICOMP Micali & Rackoff & Sloan, The Notion of Security for Probabilistic Cryptosystems 1988 17 SICOMP Sagiv, On Bounded Database Schemes and Bounded Horn-Clause Programs 1988 17 SICOMP Friesen & Kuhl, Analysis of a Hybrid Algorithm for Packing Unequal Bins 1988 17 SICOMP Masuda & Nakajima, An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph 1988 17 SICOMP Bienstock & Monma, On the Complexity of Covering Vertices by Faces in a Planar Graph 1988 17 SICOMP Katajainen & van Leeuwen & Penttonen, Fast Simulation of Turing Machines by Random Access Machines 1988 17 SICOMP Fushimi, Designing a Uniform Random Number Generator Whose Subsequences are k-Distributed 1988 17 SICOMP Faigle & Turan, Sorting and Recognition Problems for Ordered Sets 1988 17 SICOMP Nicol, Expected Performance of m-Solution Backtracking 1988 17 SICOMP Cole & Vishkin, Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time 1988 17 SICOMP Tarjan & Van Wyk, An O(n log log n)-Time Algorithm for Triangulating a Simple Polygon 1987 16 SICOMP Paige & Tarjan, Three Partition Refinement Algorithms 1987 16 SICOMP Yang & Huang & Chow, Optimal Parallel Sorting Scheme by Order Statistics 1987 16 SICOMP Frederickson, Fast Algorithms for Shortest Paths in Planar Graphs, with Applications 1987 16 SICOMP Moffat & Takaoka, An All Pairs Shortest Path Algorithm with Expected Time O(n^2 log n) 1987 16 SICOMP Pippenger, Sorting and Selecting in Rounds 1987 16 SICOMP Abrahamson, Generalized String Matching 1987 16 SICOMP Frieze, On the Exact Solution of Random Travelling Salesman Problems with Medium Size Integer Coefficients 1987 16 SICOMP Hofri & Konheim, Padded Lists Revisited 1987 16 SICOMP Larmore, Height Restricted Optimal Binary Trees 1987 16 SICOMP Scheinerman, Almost Sure Fault Tolerance in Random Graphs 1987 16 SICOMP Ibarra & Jiang, On One-Way Cellular Arrays 1987 16 SICOMP Morrison & Shepp & Van Wyk, A Queueing Analysis of Hashing with Lazy Deletion 1987 16 SICOMP Rosier & Yen, Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning omega-Machines 1987 16 SICOMP Alt & Hagerup & Mehlhorn & Preparata, Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones 1987 16 SICOMP Huang & Yu, A DNF without Regular Shortest Consensus Path 1987 16 SICOMP Chan & Mendelzon, Independent and Separable Database Schemes 1987 16 SICOMP Kurtz, A Note on Randomized Polynomial Time 1987 16 SICOMP Lubiw, Doubly Lexical Orderings of Matrices 1987 16 SICOMP McKenzie & Cook, The Parallel Complexity of Abelian Permutation Group Problems 1987 16 SICOMP Hunt & Stearns, Nonlinear Algebra and Optimization on Rings Are ``Hard'' 1987 16 SICOMP von zur Gathen, Computing Powers in Parallel 1987 16 SICOMP Becker & Hotz, On the Optimal Layout of Planar Graphs with Fixed Boundary 1987 16 SICOMP Gusfield, Optimal Mixed Graph Augmentation 1987 16 SICOMP Gasarch, Oracles for Deterministic versus Alternating Classes 1987 16 SICOMP Hirschberg & Larmore, The Least Weight Subsequence Problem 1987 16 SICOMP Papadimitriou & Ullman, A Communication-Time Tradeoff 1987 16 SICOMP Mitchell & Mount & Papadimitriou, The Discrete Geodesic Problem 1987 16 SICOMP Gonzalez & Lee, A 1.6 Approximation Algorithm for Routing Multiterminal Nets 1987 16 SICOMP Oommen & Hansen, List Organizing Strategies Using Stochastic Move-to-Front and Stochastic Move-to-Rear Operations 1987 16 SICOMP Wormald, Generating Random Unlabelled Graphs 1987 16 SICOMP Widmayer & Wu & Wong, On Some Distance Problems in Fixed Orientations 1987 16 SICOMP Helmbold & Mayr, Two Processor Scheduling is in NC 1987 16 SICOMP Immerman, Languages that Capture Complexity Classes 1987 16 SICOMP Tamassia, On Embedding a Graph in the Grid with the Minimum Number of Bends 1987 16 SICOMP Toueg & Perry & Srikanth, Fast Distributed Agreement 1987 16 SICOMP Azar & Vishkin, Tight Comparison Bounds on the Complexity of Parallel Sorting 1987 16 SICOMP Mekler & Nelson, Equational Bases for If-Then-Else 1987 16 SICOMP Gurevich & Shelah, Expected Computation Time for Hamiltonian Path Problem 1987 16 SICOMP Vaishnavi, Weighted Leaf AVL-Trees 1987 16 SICOMP Papadimitriou & Yannakakis, The Complexity of Reliable Concurrency Control 1987 16 SICOMP Friesen, Tighter Bounds for LPT Scheduling on Uniform Processors 1987 16 SICOMP Sharir, On Shortest Paths Amidst Convex Polyhedra 1987 16 SICOMP Hu & Wachs, Binary Search on a Tape 1987 16 SICOMP Lenstra, Factoring Multivariate Polynomials over Algebraic Number Fields 1987 16 SICOMP Culik & Karhumaki, The Equivalence Problem for Single-Valued Two-Way Transducers (on NPDT0L Languages) is Decidable 1987 16 SICOMP Korach & Moran & Zaks, The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors 1987 16 SICOMP Gusfield & Martel & Fernandez-Baca, Fast Algorithms for Bipartite Network Flow 1987 16 SICOMP Bini & Capovani, Tensor Rank and Border Rank of Band Toeplitz Matrices 1987 16 SICOMP Cai & Meyer, Graph Minimal Uncolorability is D^P-Complete 1987 16 SICOMP Lickteig, The Computational Complexity of Division in Quadratic Extension Fields 1987 16 SICOMP Asano, An Application of Duality to Edge-Deletion Problems 1987 16 SICOMP Guessarian & Meseguer, On the Axiomatization of ``If-Then-Else'' 1987 16 SICOMP Horton, A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph 1987 16 SICOMP Ibarra & Palis, On Efficient Simulations of Systolic Arrays of Random-Access Machines 1987 16 SICOMP Knessl & Matkowsky & Schuss & Tier, Asymptotic Expansions for a Closed Multiple Access System 1987 16 SICOMP Hofri & Ross, On the Optimal Control of Two Queues with Server Setup Times and Its Analysis 1987 16 SICOMP Papadimitriou & Tsitsiklis, On Stochastic Scheduling with In-Tree Precedence Constraints 1987 16 SICOMP Kannan & Miller & Rudolph, Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers 1987 16 SICOMP Shmueli & Itai, Complexity of Views: Tree and Cyclic Schemas 1987 16 SICOMP Miller & Stout, Data Movement Techniques for the Pyramid Computer 1987 16 SICOMP Cole & Sharir & Yap, On k-Hulls and Related Problems 1987 16 SICOMP Aurenhammer, Power Diagrams: Properties, Algorithms and Applications 1987 16 SICOMP Borodin & Fich & Meyer auf der Heide & Upfal & Wigderson, A Time-Space Tradeoff for Element Distinctness 1987 16 SICOMP Meyer auf der Heide & Wigderson, The Complexity of Parallel Sorting 1987 16 SICOMP Jones, A Note on Bottom-Up Skew Heaps 1987 16 SICOMP Gusfield, Three Fast Algorithms for Four Problems in Stable Marriage 1987 16 SICOMP Hunt & Rosenkrantz & Bloniarz, On the Computational Complexity of Algebra on Lattices 1987 16 SICOMP Murgolo, An Efficient Approximation Scheme for Variable-Sized Bin Packing 1987 16 SICOMP Choi & Hakimi, Scheduling File Transfers for Trees and Odd Cycles 1987 16 SICOMP Courcoubetis & Reiman & Simon, Stability of a Queueing System with Concurrent Service and Locking 1987 16 SICOMP Mosses & Plotkin, On Proving Limiting Completeness 1987 16 SICOMP Maass & Schorr, Speed-Up of Turing Machines with One Work Tape and a Two-Way Input Tape 1987 16 SICOMP Soulie & Weisbuch, Random Iterations of Threshold Networks and Associative Memory 1986 15 SICOMP Davenport, The Risch Differential Equation Problem 1986 15 SICOMP Katz & Volper, Data Structures for Retrieval on Square Grids 1986 15 SICOMP Pang & El Gamal, Communication Complexity of Computing the Hamming Distance 1986 15 SICOMP Cunningham, Improved Bounds for Matroid Partition and Intersection Algorithms 1986 15 SICOMP Ambos-Spies, An Inhomogeneity in the Structure of Karp Degrees 1986 15 SICOMP Gonnet & Munro, Heaps on Heaps 1986 15 SICOMP Prill, On Approximations and Incidence in Cylindrical Algebraic Decompositions 1986 15 SICOMP Beame & Cook & Hoover, Log Depth Circuits for Division and Related Problems 1986 15 SICOMP Ja'Ja' & Takche, On the Validity of the Direct Sum Conjecture 1986 15 SICOMP Blum, On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem 1986 15 SICOMP Li, Ranking and Unranking of AVL-Trees 1986 15 SICOMP Luby, A Simple Parallel Algorithm for the Maximal Independent Set Problem 1986 15 SICOMP Balas & Yu, Finding a Maximum Clique in an Arbitrary Graph 1986 15 SICOMP Hirschberg & Larmore, Average Case Analysis of Marking Algorithms 1986 15 SICOMP Faigle & Lovasz & Schrader & Turan, Searching in Trees, Series-Parallel and Interval Orders 1986 15 SICOMP Gaver & Jacobs, Processor-Shared Time-Sharing Models in Heavy Traffic 1986 15 SICOMP Huynh, Some Observations about the Randomness of Hard Problems 1986 15 SICOMP Chao & Franco, Probabilistic Analysis of Two Heuristics for the 3-Satisfiability Problem 1986 15 SICOMP Kawaguchi & Kyan, Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem 1986 15 SICOMP Manber, On Maintaining Dynamic Information in a Concurrent Environment 1986 15 SICOMP Bach & Miller & Shallit, Sums of Divisors, Perfect Numbers and Factoring 1986 15 SICOMP Jouannaud & Kirchner, Completion of a Set of Rules Modulo a Set of Equations 1986 SICOMP Apostolico & Giancarlo, The Boyer-Moore-Galil String Searching Strategies Revisited 1986 SICOMP Arazi, A Binary Search with a Parallel Recovery of the Bits 1986 SICOMP Ausiello & D'Atri & Sacca, Minimal Representation of Directed Hypergraphs 1986 SICOMP Baker, A Provably Good Algorithm for the Two Module Routing Problem 1986 SICOMP Balcazar & Book & Schoening, Sparse Sets, Lowness and Highness 1986 SICOMP Berman & Bock & Dittert & O'Donnell & Plank, Collections of Functions for Perfect Hashing 1986 SICOMP Blum & Blum & Shub, A Simple Unpredictable Pseudo-Random Number Generator 1986 SICOMP Blum & Shub, Evaluating Rational Functions: Infinite Precision is Finite Cost and Tractable on Average 1986 SICOMP Borodin & Dolev & Fich & Paul, Bounds for Width Two Branching Programs 1986 SICOMP Bruno & Downey, Probabilistic Bounds on the Performance of List Scheduling 1986 SICOMP Cabay & Choi, Algebraic Computations of Scaled Pade Fractions 1986 SICOMP Chazelle & Drysdale & Lee, Computing the Largest Empty Rectangle 1986 SICOMP Chazelle, Filtering Search: A New Approach to Query-Answering 1986 SICOMP Cherry, Integration in Finite Terms with Special Functions: The Logarithmic Integral 1986 SICOMP Chin & Ramarao, Optimal Termination Protocols for Network Partitioning 1986 SICOMP Citrini & Crespi-Reghizzi & Mandrioli, On Deterministic Multi-Pass Analysis 1986 SICOMP Cook & Dwork & Reischuk, Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes 1986 SICOMP Coppersmith & Klawe & Pippenger, Alphabetic Minimax Trees of Degree at Most t 1986 SICOMP Dyer, On a Multidimensional Search Technique and its Application to the Euclidean One-Centre Problem 1986 SICOMP Edelsbrunner & Guibas & Stolfi, Optimal Point Location in a Monotone Subdivision 1986 SICOMP Edelsbrunner & O'Rourke & Seidel, Constructing Arrangements of Lines and Hyperplanes with Applications 1986 SICOMP Edelsbrunner & Welzl, Constructing Belts in Two-Dimensional Arrangements with Applications 1986 SICOMP Engelfriet, The Complexity of Languages Generated by Attribute Grammars 1986 SICOMP Etzion & Lempel, An Efficient Algorithm for Generating Linear Transformations in a Shuffle-Exchange Network 1986 SICOMP Feigenbaum & Schaffer, Recognizing Composite Graphs is Equivalent to Testing Graph Isomorphism 1986 SICOMP Flajolet & Prodinger, Register Allocation for Unary-Binary Trees 1986 SICOMP Flajolet & Sedgewick, Digital Search Trees Revisited 1986 SICOMP Friedman, Constructing O(n log n) Size Monotone Formulae for the kth Threshold Function of n Boolean Variables 1986 SICOMP Friesen & Langston, Variable Sized Bin Packing 1986 SICOMP Frieze, On the Lagarias-Odlyzko Algorithm for the Subset Sum Problem 1986 SICOMP Galil & Micali & Gabow, An O(EV log V) Algorithm for Finding a Maximal Weighted Matching in General Graphs 1986 SICOMP Geske & Grollmann, Relativizations of Unambiguous and Random Polynomial Time Classes 1986 SICOMP Hopcroft & Wilfong, Reducing Multiple Object Motion Planning to Graph Searching 1986 SICOMP Hull, Relative Information Capacity of Simple Relational Database Schemata 1986 SICOMP Hunt & Rosenkrantz, Recursion Schemes and Recursive Programs are Exponentially Hard to Analyze 1986 SICOMP Huynh, The Complexity of the Membership Problem for Two Subclasses of Polynomial Ideals 1986 SICOMP Imai & Asano, Efficient Algorithms for Geometric Graph Search Problems 1986 SICOMP Irving & Leather, The Complexity of Counting Stable Marriages 1986 SICOMP Johnson & McLoughlin, Noncommutative Bilinear Algorithms for 3 x 3 Matrix Multiplication 1986 SICOMP Kingston, Analysis of Henriksen's Algorithm for the Simulation Event Set 1986 SICOMP Kirkpatrick & Seidel, The Ultimate Planar Convex Hull Algorithm? 1986 SICOMP Langenhop & Wright, Probabilities Related to Father-Son Distances in Binary Search Trees 1986 SICOMP Leighton & Rosenberg, Three-Dimensional Circuit Layouts 1986 SICOMP Levin, Average Case Complete Problems 1986 SICOMP Maass, On the Complexity of Nonconvex Covering 1986 SICOMP Matsumoto & Nishizeki & Saito, Planar Multicommodity Flows, Maximum Matchings and Negative Cycles 1986 SICOMP Mehlhorn & Tsakalidis, An Amortized Analysis of Insertions into AVL-Trees 1986 SICOMP Meyer auf der Heide, Efficient Simulations Among Several Models of Parallel Computers 1986 SICOMP O'Rourke, The Signature of a Plane Curve 1986 SICOMP Orponen & Russo & Schoening, Optimal Approximations and Polynomially Levelable Sets 1986 SICOMP Otto, Church-Rosser Thue Systems that Present Free Monoids 1986 SICOMP Provan, The Complexity of Reliability Computations in Planar and Acyclic Graphs 1986 SICOMP Reif, Logarithmic Depth Circuits for Algebraic Functions 1986 SICOMP Sharir & Schorr, On Shortest Paths in Polyhedral Spaces 1986 SICOMP Shub & Smale, Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II 1986 SICOMP Sleator & Tarjan, Self-Adjusting Heaps 1986 SICOMP Smith, Parallel Algorithms for Depth-First Searches I. Planar Graphs 1986 SICOMP Turner, On the Probable Performance of Heuristics for Bandwidth Minimization 1986 SICOMP Valiant, Negation is Powerless for Boolean Slice Functions 1986 SICOMP von zur Gathen, Representations and Parallel Computations for Rational Functions 1986 SICOMP Willard, Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel 1986 SICOMP Wright & Richmond & Odlyzko & McKay, Constant Time Generation of Free Trees 1985 SICOMP Alblas, Finding Minimal Pass Sequences for Attribute Grammars 1985 SICOMP Alt & Mehlhorn, Searching Semisorted Tables 1985 SICOMP Balcazar, Simplicity, Relativizations and Nondeterminism 1985 SICOMP Bent & Sleator & Tarjan, Biased Search Trees 1985 SICOMP Boyce & Dobkin & Drysdale & Guibas, Finding Extremal Polygons 1985 SICOMP Chandra & Vardi, The Implication Problem for Functional and Inclusion Dependencies is Undecidable 1985 SICOMP Chiba & Nishizeki, Arboricity and Subgraph Listing Algorithms 1985 SICOMP Chung & Makedon & Sudborough & Turner, Polynomial Time Algorithms for the Min Cut Problem on Degree Restricted Trees 1985 SICOMP Coffman & Garey & Johnson & Lapaugh, Scheduling File Transfers 1985 SICOMP Coffman & Kadota & Shepp, A Stochastic Model of Fragmentation in Dynamic Storage Allocation 1985 SICOMP Cook & Hoover, A Depth-Universal Circuit 1985 SICOMP Corneil & Perl & Stewart, A Linear Recognition Algorithm for Cographs 1985 SICOMP Dolev & Warmuth, Scheduling Flat Graphs 1985 SICOMP El-Mallah & Colbourn, Optimum Communication Spanning Trees in Series-Parallel Networks 1985 SICOMP Faigle & Gierz & Schrader, Algorithmic Approaches to Setup Minimization 1985 SICOMP Fiduccia, An Efficient Formula for Linear Recurrences 1985 SICOMP Frederickson, Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications 1985 SICOMP Garey & Johnson, Composing Functions to Minimize Image Size 1985 SICOMP Gouda & Rosier, Priority Networks of Communicating Finite State Machines 1985 SICOMP Hambrusch & Simon, Solving Undirected Graph Problems on VLSI 1985 SICOMP Hart & Sharir, Concurrent Probabilistic Programs, Or: How to Schedule If You Must 1985 SICOMP Hartmann, On the Multiplicative Complexity of Modules Over Associative Algebras 1985 SICOMP Hassin & Johnson, An O(n log_2 n) Algorithm for Maximum Flow in Undirected Planar Networks 1985 SICOMP Hopcroft & Joseph & Whitesides, On the Movement of Robot Arms in 2-Dimensional Bounded Regions 1985 SICOMP Hsu, Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs 1985 SICOMP Ibarra & Kim & Moran, Sequential Machine Characterizations of Trellis and Cellular Automata and Applications 1985 SICOMP Imai & Iri & Murota, Voronoi Diagram in the Laguerre Geometry and Its Applications 1985 SICOMP Ito & Iwasaki & Kasami, Some Results on the Representative Instance in Relational Databases 1985 SICOMP Jaffe, Distributed Multi-Destination Routing: The Constraints of Local Information 1985 SICOMP Kalorkoti, A Lower Bound for the Formula Size of Rational Functions 1985 SICOMP Kaltofen, Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization 1985 SICOMP Kanellakis & Papadimitriou, The Complexity of Distributed Concurrency Control 1985 SICOMP Kapur & Narendran, The Knuth-Bendix Completion Procedure and Thue Systems 1985 SICOMP Kedem, Optimal Allocation of Area for Single-Chip Computations 1985 SICOMP Keil, Decomposing a Polygon into Simpler Components 1985 SICOMP Kirkpatrick & Klawe, Alphabetic Minimax Trees 1985 SICOMP Ko & Schoening, On Circuit-Size Complexity and the Low Hierarchy in NP 1985 SICOMP Kurtz, Sparse Sets in NP-P: Relativizations 1985 SICOMP Lagarias, The Computational Complexity of Simultaneous Diophantine Approximation Problems 1985 SICOMP Landau, Factoring Polynomials Over Algebraic Number Fields 1985 SICOMP Long, On Restricting the Size of Oracles Compared with Restricting Access to Oracles 1985 SICOMP Matsumoto & Nishizeki & Saito, An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks 1985 SICOMP McCreight, Priority Search Trees 1985 SICOMP Mitra, Probabilistic Models and Asymptotic Results for Concurrent Processing with Exclusive and Non-Exclusive Locks 1985 SICOMP Myers, An O(E log E+I) Expected Time Algorithm for the Planar Segment Intersection Problem 1985 SICOMP Ogden & Ross & Winklmann, An ``Interchange Lemma'' for Context-Free Languages 1985 SICOMP Parikh & Chandra & Halpern & Meyer, Equations Between Regular Terms and An Application to Process Logic 1985 SICOMP Purdom & Brown, The Pure Literal Rule and Polynomial Average Time 1985 SICOMP Reeds & Sloane, Shift-Register Synthesis (Modulo m) 1985 SICOMP Reif & Spirakis, Unbounded Speed Variability in Distributed Communications Systems 1985 SICOMP Reischuk, Probabilistic Parallel Algorithms for Sorting and Selection 1985 SICOMP Revesz, Axioms for the Theory of Lambda-Conversion 1985 SICOMP Risler, Additive Complexity and Zeros of Real Polynomials 1985 SICOMP Satyanarayana & Wood, A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks 1985 SICOMP Sharir, Intersection and Closest-Pair Problems for a Set of Planar Discs 1985 SICOMP Singer & Saunders & Caviness, An Extension of Liouville's Theorem on Integration in Finite Terms 1985 SICOMP Snir, On Parallel Searching 1985 SICOMP Spinrad, On Comparability and Permutation Graphs 1985 SICOMP Stearns & Hunt, On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata 1985 SICOMP Stockmeyer, On Approximation Algorithms for #P 1985 SICOMP Tarjan & Vishkin, An Efficient Parallel Biconnectivity Algorithm 1985 SICOMP Tarjan & Yannakakis, Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs 1985 SICOMP Veldhorst, Approximation of the Consecutive Ones Matrix Augmentation Problem 1985 SICOMP Vijayan & Wigderson, Rectilinear Graphs and their Embeddings 1985 SICOMP Vishkin & Wigderson, Trade-Offs Between Depth and Width in Parallel Computation 1985 SICOMP Vitanyi, An Optimal Simulation of Counter Machines: The ACM Case 1985 SICOMP Vitanyi, An Optimal Simulation of Counter Machines 1985 SICOMP Vitter & Chen, Optimum Algorithms for a Model of Direct Chaining 1985 SICOMP Willard, New Data Structures for Orthogonal Range Queries 1985 SICOMP Willard, Searching Unindexed and Nonuniformly Generated Files in log log N Time 1985 SICOMP Yao & Yao, On Fault-Tolerant Networks for Sorting 1985 SICOMP Yao, On the Complexity of Maintaining Partial Sums 1985 SICOMP Yao, On the Expected Performance of Path Compression Algorithms 1984 SICOMP Agarwal & Mittal & Sharma, Constrained Optimum Communication Trees and Sensitivity Analysis 1984 SICOMP Arnon & Collins & McCallum, Cylindrical Algebraic Decomposition I: The Basic Algorithm 1984 SICOMP Arnon & Collins & McCallum, Cylindrical Algebraic Decomposition II: An Adjacency Algorithm for the Plane 1984 SICOMP Baker & Coffman, Insertion and Compaction Algorithms in Sequentially Allocated Storage 1984 SICOMP Barz, The Power of Synchronization Mechanisms 1984 SICOMP Beeri & Vardi, Formal Systems for Tuple and Equality Generating Dependencies 1984 SICOMP Bini, Parallel Solution of Certain Toeplitz Linear Systems 1984 SICOMP Blass & Gurevich, Equivalence Relations, Invariants, and Normal Forms 1984 SICOMP Blum & Micali, How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits 1984 SICOMP Book & Long & Selman, Quantitative Relativizations of Complexity Classes 1984 SICOMP Cartwright, Recursive Programs as Definitions in First Order Logic 1984 SICOMP Chandra & Stockmeyer & Vishkin, Constant Depth Reducibility 1984 SICOMP Chazelle, Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm 1984 SICOMP Chiu & Bernstein & Ho, Optimizing Chain Queries in a Distributed Database System 1984 SICOMP Cosmadakis & Papadimitriou, The Traveling Salesman Problem with Many Visits to Few Cities 1984 SICOMP de Bruin, On the Existence of Cook Semantics 1984 SICOMP Dobson, Scheduling Independent Tasks on Uniform Processors 1984 SICOMP Duris & Galil, Two Tapes are Better than One for Nondeterministic Machines 1984 SICOMP Dyer, Linear Time Algorithms for Two- and Three-Variable Linear Programs 1984 SICOMP Frederickson & Johnson, Generalized Selection and Ranking: Sorted Matrices 1984 SICOMP Frederickson, Self-Organizing Heuristics for Implicit Data Structures 1984 SICOMP Friesen, Tighter Bounds for the Multifit Processor Scheduling Algorithm 1984 SICOMP Gallier, n-Rational Algebras II. Varieties and Logic of Inequalities 1984 SICOMP Gallier, n-Rational Algebras I. Basic Properties and Free Algebras 1984 SICOMP Grandjean, The Spectra of First-Order Sentences and Computational Complexity 1984 SICOMP Harel & Tarjan, Fast Algorithms for Finding Nearest Common Ancestors 1984 SICOMP Heller, On Relativized Polynomial and Exponential Computations 1984 SICOMP Heyman & Tsur, Disk Performance in a Transaction-Oriented System 1984 SICOMP Hopcroft & Joseph & Whitesides, Movement Problems for 2-Dimensional Linkages 1984 SICOMP Hu & Shing, Computation of Matrix Chain Products. Part II 1984 SICOMP Ja'Ja' & Kumar & Simon, Information Transfer under Different Sets of Protocols 1984 SICOMP Keane & Konheim & Meilijson, The Organ Pipe Permutation 1984 SICOMP Klawe, Limitations on Explicit Constructions of Expanding Graphs 1984 SICOMP Ladner & Lipton & Stockmeyer, Alternating Pushdown and Stack Automata 1984 SICOMP Lai & Sahni, Preemptive Scheduling of a Multiprocessor System with Memories to Minimize Maximum Lateness 1984 SICOMP Leung & Vornberger & Witthoff, On Some Variants of the Bandwidth Minimization Problem 1984 SICOMP Linial, The Information-Theoretic Bound is Good for Merging 1984 SICOMP Manber & Tompa, The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem 1984 SICOMP Mayr, An Algorithm for the General Petri Net Reachability Problem 1984 SICOMP Megiddo & Supowit, On the Complexity of Some Common Geometric Location Problems 1984 SICOMP Melhem & Rheinboldt, A Mathematical Model for the Verification of Systolic Networks 1984 SICOMP Ottman & Parker & Rosenberg & Six & Wood, Minimal-Cost Brother Trees 1984 SICOMP Pullman, Clique Covering of Graphs IV. Algorithms 1984 SICOMP Ramanan, Pushdown Permuter Characterization Theorem 1984 SICOMP Reif, On Synchronous Parallel Computations with Independent Probabilistic Choice 1984 SICOMP Robson, N by N Checkers is Exptime Complete 1984 SICOMP Rosenkrantz & Stearns & Lewis, Consistency and Serializability in Concurrent Database Systems 1984 SICOMP Schoening & Book, Immunity, Relativizations, and Nondeterminism 1984 SICOMP Sharir & Pnueli & Hart, Verification of Probabilistic Programs 1984 SICOMP Sherman & Pnueli & Harel, Is the Interesting Part of Process Logic Uninteresting: A Translation from PL to PDL 1984 SICOMP Stockmeyer & Vishkin, Simulation of Parallel Random Access Machines by Circuits 1984 SICOMP Tarjan & Yannakakis, Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs 1984 SICOMP Toueg & Babaoglu, On the Optimum Checkpoint Selection Problem 1984 SICOMP Tsin & Chin, Efficient Parallel Algorithms for a Class of Graph Theoretic Problems 1984 SICOMP von zur Gathen, Parallel Algorithms for Algebraic Problems 1983 SICOMP Atkinson & Lloyd, The Ranks of m x n x (mn-2) Tensors 1983 SICOMP Baker & Schwarz, Shelf Algorithms for Two-Dimensional Packing Problems 1983 SICOMP Bergstra & Tucker, Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems 1983 SICOMP Bloniarz, A Shortest-Path Algorithm with Expected Time O(n log n log* n) 1983 SICOMP Bloom & Tindell, Varieties of ``If-Then-Else'' 1983 SICOMP Chan & Ibarra, On the Space and Time Complexity of Functions Computable by Simple Programs 1983 SICOMP Chen & Vitter, Analysis of Early-Insertion Standard Coalesced Hashing 1983 SICOMP Choffrut & Culik, Properties of Finite and Pushdown Transducers 1983 SICOMP Choy & Wong, Construction of Optimal alpha-beta Leaf Trees with Applications to Prefix Code and Information Retrieval 1983 SICOMP Coffman & Garey & Johnson, Dynamic Bin Packing 1983 SICOMP Cohn, The Equivalence of Two Semantic Definitions: A Case Study in LCF 1983 SICOMP de Groote, Characterization of Division Algebras of Minimal Rank and the Structure of their Algorithm Varieties 1983 SICOMP Dolev & Strong, Authenticated Algorithms for Byzantine Agreement 1983 SICOMP Fagin & Maier & Ullman & Yannakakis, Tools for Template Dependencies 1983 SICOMP Fenner & Loizou, Tree Traversal Related Algorithms for Generating Integer Partitions 1983 SICOMP Fischer & Tsou, Whether a Set of Multivalued Dependencies Implies a Join Dependency is NP-Hard 1983 SICOMP Fleck & Limaye, Formal Semantics and Abstract Properties of String Pattern Operations and Extended Formal Language Description Mechanisms 1983 SICOMP Friesen & Langston, Bounds for Multifit Scheduling on Uniform Processors 1983 SICOMP Goodman & Pollack, Multidimensional Sorting 1983 SICOMP Gusfield, Simple Construction for Multi-Terminal Network Flow Synthesis 1983 SICOMP Guttag & Kapur & Musser, On Proving Uniform Termination and Restricted Termination of Rewriting Systems 1983 SICOMP Hanbrusch, VLSI Algorithms for the Connected Component Problem 1983 SICOMP Hickey & Cohen, Uniform Random Generation of Strings in a Context-Free Language 1983 SICOMP Ibarra & Moran, Some Time-Space Tradeoff Results Concerning Single-Tape and Offline TM's 1983 SICOMP Johnson & Klug, Optimizing Conjunctive Queries that Contain Untyped Variables 1983 SICOMP Kaltofen & Musser & Saunders, A Generalized Class of Polynomials that are Hard to Factor 1983 SICOMP Kirkpatrick & Hell, On the Complexity of General Graph Factor Problems 1983 SICOMP Kirkpatrick, Optimal Search in Planar Subdivisions 1983 SICOMP Lauer, Generalized p-adic Constructions 1983 SICOMP Leiserson & Pinter, Optimal Placement for River Routing 1983 SICOMP Lifschitz & Pittel, The Worst and the Most Probable Performance of a Class of Set-Covering Algorithms 1983 SICOMP Loos, Computing Rational Zeros of Integral Polynomials by p-adic Expansion 1983 SICOMP Loui, Optimal Dynamic Embedding of Trees into Arrays 1983 SICOMP Megiddo & Tamir, New Results on the Complexity of p-Center Problems 1983 SICOMP Megiddo, Linear-Time Algorithms for Linear Programming in R^3 and Related Problems 1983 SICOMP Megiddo, Towards a Genuinely Polynomial Algorithm for Linear Programming 1983 SICOMP Mitra & Morrison, Asymptotic Expansions of Moments of the Waiting Time in a Shared-Processor of an Interactive System 1983 SICOMP Papadimitriou, Concurrency Control by Locking 1983 SICOMP Peterson, A Technique for Establishing Completeness Results in Theorem Proving with Equality 1983 SICOMP Pfaltz, Convex Clusters in a Discrete m-Dimensional Space 1983 SICOMP Provan & Ball, The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected 1983 SICOMP Purdom & Brown, An Analysis of Backtracking with Search Rearrangement 1983 SICOMP Reif, Minimum s-t Cut of a Planar Undirected Network in O(n log^2(n)) Time 1983 SICOMP Rowland & Shader, On the Selection of Test Data for Vector-Valued Recursive Subroutines 1983 SICOMP Sagiv, Quadratic Algorithms for Minimizing Joins in Restricted Relational Expressions 1983 SICOMP Selman & Xu Mei-Rui & Book, Positive Relativizations of Complexity Classes 1983 SICOMP Simons, Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines 1983 SICOMP Strassen, The Computational Complexity of Continued Fractions 1983 SICOMP Supowit & Reingold & Plaisted, The Traveling Salesman Problem and Minimum Matching in the Unit Square 1983 SICOMP Supowit & Reingold, Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching 1983 SICOMP Ukkonen, Two Results on Polynomial Time Truth-Table Reductions to Sparse Sets 1983 SICOMP Valiant & Skyum & Berkowitz & Rackoff, Fast Parallel Computation of Polynomials Using Few Processors 1983 SICOMP Yamada & Imori, One Step Transformation of Periodic Sequences by Cellular Automata 1983 SICOMP Yesha, On Certain Polynomial-Time Truth-Table Reducibilities of Complete Sets to Sparse Sets 1982 SICOMP Achugbue & Chin, Scheduling the Open Shop to Minimize Mean Flow Time 1982 SICOMP Atallah, Finding the Cyclic Index of an Irreducible, Nonnegative Matrix 1982 SICOMP Atkin & Larson, On a Primality Test of Solovay and Strassen 1982 SICOMP Banaschewski & Nelson, Completions of Partially Ordered Sets 1982 SICOMP Bitner, An Asymptotically Optimal Algorithm for the Dutch National Flag Problem 1982 SICOMP Book & Wilson & Xu Mei-Rui, Relativizing Time, Space, and Time-Space 1982 SICOMP Booth & Johnson, Dominating Sets in Chordal Graphs 1982 SICOMP Borodin & Cook, A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation 1982 SICOMP Brent & Goldschlager, Some Area-Time Tradeoffs for VLSI 1982 SICOMP Burton & Smith, A Hidden-Line Algorithm for Hyperspace 1982 SICOMP Chiba & Nishizeki & Saito, An Approximation Algorithm for the Maximum Independent Set Problem on Planar Graphs 1982 SICOMP Chou & Collins, Algorithms for the Solution of Systems of Linear Diophantine Equations 1982 SICOMP Coffman & Hofri, On the Expected Performance of Scanning Disks 1982 SICOMP Cole & Hopcroft, On Edge Coloring Bipartite Graphs 1982 SICOMP Comer & O'Donnell, Geometric Problems with Application to Hashing 1982 SICOMP Coppersmith & Parker & Wong, Analysis of a General Mass Storage System 1982 SICOMP Coppersmith & Winograd, On the Asymptotic Complexity of Matrix Multiplication 1982 SICOMP Coppersmith, Rapid Multiplication of Rectangular Matrices 1982 SICOMP Davis & Winslow, Computational Power in Query Languages 1982 SICOMP Fischer & Meyer & Paterson, Omega(n log n) Lower Bounds on Length of Boolean Formulas 1982 SICOMP Friedman & Greibach, A Polynomial Time Algorithm for Deciding the Equivalence Problem for 2-Tape Deterministic Finite State Acceptors 1982 SICOMP Gabow & Kariv, Algorithms for Edge Coloring Bipartite Graphs and Multigraphs 1982 SICOMP Gligor & Maier, Finding Augmented-Set Bases 1982 SICOMP Gonzalez & Ja'Ja', Evaluation of Arithmetic Expressions with Algebraic Identities 1982 SICOMP Gouyou-Beauchamps, The Hamiltonian Circuit Problem is Polynomial for 4-Connected Planar Graphs 1982 SICOMP Gupta & Lee & Wong, Ranking and Unranking of 2-3 Trees 1982 SICOMP Gurari, The Equivalence Problem for Deterministic Two-Way Sequential Transducers is Decidable 1982 SICOMP Halton & Terada, A Fast Algorithm for the Euclidean Traveling Salesman Problem, Optimal with Probability One 1982 SICOMP Hochbaum, Approximation Algorithms for the Set Covering and Vertex Cover Problems 1982 SICOMP Hofri & Tzelnic, The Working Set Size Distribution for the Markov Chain Model of Program Behavior 1982 SICOMP Hong & Rosenberg, Graphs that are Almost Binary Trees 1982 SICOMP Hong, On Some Deterministic Space Complexity Problems 1982 SICOMP Hu & Shing, Computation of Matrix Chain Products. Part I 1982 SICOMP Ibarra & Leininger, Straight-Line Programs with One Input Variable 1982 SICOMP Ibarra & Leininger, The Complexity of the Equivalence Problem for Simple Loop-Free Programs 1982 SICOMP Itai & Papadimitriou & Szwarcfiter, Hamilton Paths in Grid Graphs 1982 SICOMP Ja'Ja' & Simon, Parallel Algorithms in Graph Theory: Planarity Testing 1982 SICOMP Jensen & Korte, Complexity of Matroid Property Algorithms 1982 SICOMP Karp & Papadimitriou, On Linear Characterizations of Combinatorial Optimization Problems 1982 SICOMP Keohane & Cherniavsky & Henderson, On Transforming Control Structures 1982 SICOMP Kou, Minimum Variance Huffman Codes 1982 SICOMP Lehmann, On Primality Tests 1982 SICOMP Levy & Maibaum, Continuous Data Types 1982 SICOMP Lichtenstein, Planar Formulae and their Uses 1982 SICOMP Linial & Tarsi, The Counterfeit Coin Problem Revisited 1982 SICOMP Mehlhorn, A Partial Analysis of Height-Balanced Trees Under Random Insertions and Deletions 1982 SICOMP Moran, On the Accepting Density Hierarchy in NP 1982 SICOMP Nakajima & Hakimi & Lenstra, Complexity Results for Scheduling Tasks in Fixed Intervals on Two Types of Machines 1982 SICOMP Noshita, Predicting the Number of Distinct Elements in a Multiset 1982 SICOMP Reif & Tarjan, Symbolic Program Analysis in Almost-Linear Time 1982 SICOMP Romani, Some Properties of Disjoint Sums of Tensors Related to Matrix Multiplication 1982 SICOMP Ronse, Optimization of Cost and Delay in Cellular Permutation Networks 1982 SICOMP Rosen, A Lubricant for Data Flow Analysis 1982 SICOMP Rosenthal, Dynamic Programming is Optimal for Nonserial Optimization Problems 1982 SICOMP Sedgewick & Szymanski & Yao, The Complexity of Finding Cycles in Periodic Functions 1982 SICOMP Smyth & Plotkin, The Category-Theoretic Solution of Recursive Domain Equations 1982 SICOMP Tenenbaum & Nemes, Two Spectra of Self-Organizing Sequential Search Algorithms 1982 SICOMP Tompa, Two Familiar Transitive Closure Algorithms Which Admit No Polynomial Time, Sublinear Space Implementations 1982 SICOMP Valdes & Tarjan & Lawler, The Recognition of Series Parallel Digraphs 1982 SICOMP Valiant, A Scheme for Fast Parallel Communication 1982 SICOMP Willard, Polygon Retrieval 1982 SICOMP Yannakakis, Freedom from Deadlock of Safe Locking Policies 1982 SICOMP Yao & Yao, On the Average-Case Complexity of Selecting the kth Best 1982 SICOMP Yao, On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems 1981 SICOMP Aho & Sagiv & Szymanski & Ullman, Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions 1981 SICOMP Barak & Downey, Distributed Processor Scheduling and User Countermeasures 1981 SICOMP Beeri & Honeyman, Preserving Functional Dependencies 1981 SICOMP Beeri & Mendelzon & Sagiv & Ullman, Equivalence of Relational Database Schemes 1981 SICOMP Bennett & Gill, Relative to a Random Oracle A, P^A \ne NP^A \ne co-NP^A with Probability 1 1981 SICOMP Bernstein & Goodman, Power of Natural Semijoins 1981 SICOMP Bitner & Huang, Key Comparison Optimal 2-3 Trees with Maximum Utilization 1981 SICOMP Boasson & Courcelle & Nivat, The Rational Index: A Complexity Measure for Languages 1981 SICOMP Bolour, Optimal Retrieval Algorithms for Small Region Queries 1981 SICOMP Brown & Purdom, An Average Time Analysis of Backtracking 1981 SICOMP Colbourn & Booth, Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs 1981 SICOMP Cook, Corrigendum: Soundness and Completeness of an Axiom System for Program Verification 1981 SICOMP Crespi-Reghizzi & Guida & Mandrioli, Operator Precedence Grammars and the Noncounting Property 1981 SICOMP Dekel & Nassimi & Sahni, Parallel Matrix and Graph Algorithms 1981 SICOMP Dessouky & Deogun, Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time 1981 SICOMP Downey & Leong & Sethi, Computing Sequences with Addition Chains 1981 SICOMP Ehrenfeucht & Parikh & Rozenberg, Pumping Lemmas for Regular Sets 1981 SICOMP Ehrenfeucht & Rozenberg & Vermeir, On ET0L Systems with Finite Tree-Rank 1981 SICOMP Ellis & Steele, Fast Sorting of Weyl Sequences Using Comparisons 1981 SICOMP Flon & Suzuki, The Total Correctness of Parallel Programs 1981 SICOMP Frederickson & Ja'Ja', Approximation Algorithm Algorithms for Several Graph Augmentation Problems 1981 SICOMP Fredman, Lower Bounds on the Complexity of Some Optimal Data Structures 1981 SICOMP Garey & Johnson & Simons & Tarjan, Scheduling Unit-Time Tasks with Arbitrary Release Times and Deadlines 1981 SICOMP Golan, Performance Bounds for Orthogonal Oriented Two-Dimensional Packing Algorithms 1981 SICOMP Gonnet & Munro & Suwanda, Exegesis of Self-Organizing Linear Search 1981 SICOMP Gotlieb, Optimal Multi-Way Search Trees 1981 SICOMP Haggkvist & Hell, Parallel Sorting with Constant Time for Comparisons 1981 SICOMP Hartmanis & Mahaney, Languages Simultaneously Complete for One-Way and Two-Way Log-Tape Automata 1981 SICOMP Holyer, The NP-Completeness of Some Edge-Partition Problems 1981 SICOMP Ibarra & Leininger, Characterizations of Presburger Functions 1981 SICOMP Itai & Lipton & Papadimitriou & Rodeh, Covering Graphs by Simple Circuits 1981 SICOMP Jones & Skyum, A Note on the Complexity of General D0L Membership 1981 SICOMP Katoh & Ibaraki & Mine, An Algorithm for Finding K Minimum Spanning Trees 1981 SICOMP Ko & Moore, Completeness, Approximation and Density 1981 SICOMP Kunde, Nonpreemptive LP-Scheduling on Homogeneous Multiprocessor Systems 1981 SICOMP Lee & Drysdale, Generalizion of Voronoi Diagrams in the Plane 1981 SICOMP Liu, On String Pattern Matching: A New Model with a Polynomial Time Algorithm 1981 SICOMP Lubiw, Some NP-Complete Problems Similar to Graph Isomorphism 1981 SICOMP Lueker, Optimization Problems on Graphs with Independent Random Edge Weights 1981 SICOMP Maurer & Salomaa & Wood, Uniform Interpretations of Grammar Forms 1981 SICOMP Mayoh, Attribute Grammars and Mathematical Semantics 1981 SICOMP Megiddo & Tamir & Zemel & Chandrasekaran, An O(n log^2 n) Algorithm for the kth Longest Path in a Tree with Applications to Location Problems 1981 SICOMP Papadimitriou, Worst-Case and Probabilistic Analysis of a Geometric Location Problem 1981 SICOMP Pnueli & Slutzki, Automatic Programming of Finite State Linear Programs 1981 SICOMP Preparata, A New Approach to Planar Point Location 1981 SICOMP Proskurowski, Recursive Graphs, Recursive Labelings and Shortest Paths 1981 SICOMP Rackoff & Seiferas, Limitations on Separating Nondeterministic Complexity Classes 1981 SICOMP Raiha & Ukkonen, Minimizing the Number of Evaluation Passes for Attribute Grammars 1981 SICOMP Reingold & Tarjan, On a Greedy Heuristic for Complete Matching 1981 SICOMP Rowland & Davis, On the Selection of Test Data for Recursive Mathematical Subroutines 1981 SICOMP Ruskey, Listing and Counting Subtrees of a Tree 1981 SICOMP Savage & Ja'Ja', Fast, Efficient Parallel Algorithms for Some Graph Problems 1981 SICOMP Schnorr, An Extension of Strassen's Degree Bound 1981 SICOMP Schoenhage, Partial and Total Matrix Multiplication 1981 SICOMP Schroeppel and Shamir, A T=O(2^{n/2}), S=O(2^{n/4}) Algorithm for Certain NP-Complete Problems 1981 SICOMP Slater & Cockayne & Hedetniemi, Information Dissemination in Trees 1981 SICOMP Syslo, An Efficient Cycle Vector Space Algorithm for Listing All Cycles of a Planar Graph 1981 SICOMP Toueg & Steiglitz, Some Complexity Results in the Design of Deadlock-Free Packet Switching Networks 1981 SICOMP Toueg & Ullman, Deadlock-Free Packet Switching Networks 1981 SICOMP Yannakakis, Edge-Deletion Problems 1981 SICOMP Yannakakis, Node-Deletion Problems on Bipartite Graphs 1981 SICOMP Yao, An Analysis of a Memory Allocation Scheme for Implementing Stacks 1980 SICOMP Apt & Meertens, Completeness with Finite Systems of Intermediate Assertions for Recursive Program Schemes 1980 SICOMP Aspvall & Shiloach, A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables per Inequality 1980 SICOMP Babai & Erdos & Selkow, Random Graph Isomorphism 1980 SICOMP Babai, On the Complexity of Canonical Labeling of Strongly Regular Graphs 1980 SICOMP Baker & Coffman & Rivest, Orthogonal Packings in Two Dimensions 1980 SICOMP Beyer & Hedetniemi, Constant Time Generation of Rooted Trees 1980 SICOMP Bini & Lotti & Romani, Approximate Solutions for the Bilinear Form Computational Problem 1980 SICOMP Bloom & Elgot & Wright, Solutions of the Iteration Equation and Extensions of the Scalar iteration Operation 1980 SICOMP Bloom & Elgot & Wright, Vector Iteration in Pointed Iterative Theories 1980 SICOMP Bloom & Tindell, Compatible Orderings on the Metric Theory of Trees 1980 SICOMP Book & Brandenburg, Equality Sets and Complexity Classes 1980 SICOMP Brent & Traub, On the Complexity of Composition and Generalized Composition of Power Series 1980 SICOMP Brown & Tarjan, Design and Analysis of a Data Structure for Representing Sorted Lists 1980 SICOMP Cho & Sahni, Bounds for List Schedules on Uniform Processors 1980 SICOMP Coffman & Garey & Johnson & Tarjan, Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms 1980 SICOMP Cook & Rackoff, Space Lower Bounds for Maze Threadability on Restricted Machines 1980 SICOMP Corneil & Kirkpatrick, A Theoretical Analysis of Various Heuristics for the Graph Isomorphism Problem 1980 SICOMP Dobkin & Lipton, Addition Chain Methods for the Evaluation of Specific Polynomials 1980 SICOMP Ehrig & Rosen, The Mathematics of Record Handling 1980 SICOMP Feldman & Nigam, A Model and Proof Technique for Message-Based Systems 1980 SICOMP Flajolet & Ramshaw, A Note on Gray Code and Odd-Even Merge 1980 SICOMP Galil & Seiferas, Saving Space in Fast String-Matching 1980 SICOMP Galil, Finding the Vertex Connectivity of Graphs 1980 SICOMP George & Liu, An Optimal Algorithm for Symbolic Factorization of Symmetric Matrices 1980 SICOMP Gilbert & Lengauer & Tarjan, The Pebbling Problem is Complete in Polynomial Space 1980 SICOMP Guibas & Odlyzko, A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm 1980 SICOMP Gurari & Ibarra, Path Systems: Constructions, Solutions and Applications 1980 SICOMP Hartmanis, On the Succinctness of Different Representations of Languages 1980 SICOMP Hehner & Horspool, Corrigendum. A New Representation of the Rational Numbers for Fast Easy Arithmetic 1980 SICOMP Hennessy, The Semantics of Call-By-Value and Call-By-Name in a Nondeterministic Environment 1980 SICOMP Hirschberg, On the Complexity of Searching a Set of Vectors 1980 SICOMP Hunt & Constable & Sahni, On the Computational Complexity of Program Scheme Equivalence 1980 SICOMP Hwang, Optimal Merging of 3 Elements with n Elements 1980 SICOMP Ja'Ja', On the Complexity of Bilinear Forms with Commutativity 1980 SICOMP Jaffe, Bounds on the Scheduling of Typed Task Systems 1980 SICOMP Joichi & White & Williamson, Combinatorial Gray Codes 1980 SICOMP Kintala & Fischer, Refining Nondeterminism in Relativized Polynomial-Time Bounded Computations 1980 SICOMP Lawler & Lenstra & Kan, Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms 1980 SICOMP Lee & Wong, Voronoi Diagrams in L_1 (L_infinity) Metrics with 2-Dimensional Storage Applications 1980 SICOMP Lipton & Tarjan, Applications of a Planar Separator Theorem 1980 SICOMP Majster & Reiser, Efficient On-Line Construction and Correction of Position Trees 1980 SICOMP Morgera, Efficient Synthesis and Implementation of Large Discrete Fourier Transformations 1980 SICOMP Nassimi & Sahni, Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer 1980 SICOMP Pan, New Fast Algorithms for Matrix Operations 1980 SICOMP Parker, Conditions for Optimality of the Huffman Algorithm 1980 SICOMP Pippenger, On the Evaluation of Powers and Monomials 1980 SICOMP Plaisted, The Application of Multivariate Polynomials to Inference Rules and Partial Tests for Unsatisfiability 1980 SICOMP Probst & Alagar, Corrigendum: A Family of Algorithms for Powering Sparse Polynomials 1980 SICOMP Rabin, Probabilistic Algorithms in Finite Fields 1980 SICOMP Reif, Code Motion 1980 SICOMP Rosen, Monoids for Rapid Data Flow Analysis 1980 SICOMP Rytter, A Correct Preprocessing Algorithm for Boyer-Moore String-Searching 1980 SICOMP Schoenhage, Storage Modification Machines 1980 SICOMP Seroussi & Lempel, Factorization of Symmetric Matrices and Trace-Orthogonal Bases in Finite Fields 1980 SICOMP Shiloach, A Multi-Terminal Minimum Cut Algorithm for Planar Graphs 1980 SICOMP Statman, Worst Case Exponential Lower Bounds for Input Resolution with Paramodulation 1980 SICOMP Stockmeyer & Yao, On the Optimality of Linear Merge 1980 SICOMP Tai, Predictors of Context-Free Grammars 1980 SICOMP Tucker, An Efficient Test for Circular-Arc Graphs 1980 SICOMP Weide, Random Graphs and Graph Optimization Problems 1980 SICOMP Winograd, On Multiplication of Polynomials Modulo a Polynomial 1980 SICOMP Wong & Easton, An Efficient Method for Weighted Sampling Without Replacement 1980 SICOMP Yao & Rivest, On the Polyhedral Decision Problem 1980 SICOMP Yao, Bounds on Selection Networks 1979 SICOMP Aggarwal & Burgmeier, A Round-Off Error Model with Applications to Arithmetic Expressions 1979 SICOMP Aho & Sagiv & Ullman, Equivalences Among Relational Expressions 1979 SICOMP Bagchi & Roy, On V-Optimal Trees 1979 SICOMP Bitner & Wong, Optimal and Near-Optimal Scheduling Algorithms for Batched Processing in Linear Storage 1979 SICOMP Bitner, Heuristics That Dynamically Organize Data Structures 1979 SICOMP Book, Polynomial Space and Transitive Closure 1979 SICOMP Brown, A Partial Analysis of Random Height-Balanced Trees 1979 SICOMP Carlson, A Counterexample to Reingold's Pushdown Permuter Characterization Theorem 1979 SICOMP Coffman & Leung, Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation 1979 SICOMP Donahue, On the Semantics of ``Data Type'' 1979 SICOMP Epstein, A Natural Structure Theorem for Complex Fields 1979 SICOMP Fortune, A Note on Sparse Complete Sets 1979 SICOMP Gonnet & Munro, Efficient Ordering of Hash Tables 1979 SICOMP Hagihara & Ito & Taniguchi & Kasami, Decision Problems for Multivalued Dependencies in Relational Databases 1979 SICOMP Harper & Savage, Lower Bounds on Synchronous Combinational Complexity 1979 SICOMP Hehner & Horspool, A New Representation of the Rational Numbers for Fast Easy Arithmetic 1979 SICOMP Hikita & Nozaki, Corrigenda: A Completeness Criterion for Spectra 1979 SICOMP Hyafil, On the Parallel Evaluation of Multivariate Polynomials 1979 SICOMP Itai & Shiloach, Maximum Flow in Planar Networks 1979 SICOMP Ja'Ja', Optimal Evaluation of Pairs of Bilinear Forms 1979 SICOMP Kannan & Bachem, Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix 1979 SICOMP Karp, A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem 1979 SICOMP Kasai & Adachi & Iwata, Classes of Pebble Games and Complete Problems 1979 SICOMP Klip, New Algorithms for Polynomial Multiplication 1979 SICOMP Krishnamoorthy & Deo, Node-Deletion NP-Complete Problems 1979 SICOMP Maier, An Efficient Method for Storing Ancestor Information in Trees 1979 SICOMP McDiarmid, Determining the Chromatic Number of a Graph 1979 SICOMP McKay, Some Remarks on Computing Galois Groups 1979 SICOMP Mehlhorn, Dynamic Binary Search 1979 SICOMP Miller & Pippenger & Rosenberg & Snyder, Optimal 2, 3-Trees 1979 SICOMP Opatrny, Total Ordering Problem 1979 SICOMP Papadimitriou & Yannakakis, Scheduling Interval-Ordered Tasks 1979 SICOMP Preparata, A Note on Locating a Set of Points in a Planar Subdivision 1979 SICOMP Priese, Towards a Precise Characterization of the Complexity of Universal and Nonuniversal Turing Machines 1979 SICOMP Probst & Alagar, A Family of Algorithms for Powering Sparse Polynomials 1979 SICOMP Rothstein & Caviness, A Structure Theorem for Exponential and Primitive Functions 1979 SICOMP Sahni & Cho, Nearly On Line Scheduling of a Uniform Processor System with Release Times 1979 SICOMP Schnorr, Bottlenecks and Edge Connectivity in Unsymmetrical Networks 1979 SICOMP Shamir, A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs 1979 SICOMP Shiloach, A Minimum Linear Arrangement Algorithm for Undirected Trees 1979 SICOMP Shiloach, Multi-Terminal 0-1 Flow 1979 SICOMP Stockmeyer & Chandra, Provably Difficult Combinatorial Games 1979 SICOMP Stockmeyer & Wong, On the Number of Comparisons to Find the Intersection of Two Relations 1979 SICOMP Stoutmyer, Automatic Asymptotic and Big-O Calculations Via Computer Algebra 1979 SICOMP Valiant, The Complexity of Enumeration and Reliability Problems 1979 SICOMP Walkup, On the Expected Value of a Random Assignment Problem 1979 SICOMP Wang & Trager, New Algorithms for Polynomial Square-Free Decomposition Over the Integers 1979 SICOMP Weyuker, Translatability and Decidability Questions for Restricted Classes of Program Schemas 1979 SICOMP Wirth, Symbolic Vector and Dyadic Analysis 1979 SICOMP Yao, The Complexity of Pattern Matching for a Random String 1979 SICOMP Yun, Uniform Bounds for a Class of Algebraic Mappings 1979 SICOMP Zaks & Richards, Generating Trees and Other Combinatorial Objects Lexicographically 1978 SICOMP Baker, A Technique for Extending Rapid Exact-Match String Matching to Arrays of More than One Dimension 1978 SICOMP Baker, Generalized Syntax Directed Translation, Tree Transducers, and Linear Space 1978 SICOMP Biskup, The Time Measure of One-Tape Turing Machines Does Not Have the Parallel Computation Property 1978 SICOMP Book & Nivat, Linear Languages and the Intersection Closures of Classes of Languages 1978 SICOMP Booth, Isomorphism Testing for Graphs, Semigroups, and Finite Automata Are Polynomially Equivalent Problems 1978 SICOMP Brockett & Dobkin, Errata: On the Number of Multiplications Required for Matrix Multiplication 1978 SICOMP Brown, Implementation and Analysis of Binomial Queue Algorithms 1978 SICOMP Bruno & Downey, Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs 1978 SICOMP Coffman & Garey & Johnson, An Application of Bin-Packing to Multiprocessor Scheduling 1978 SICOMP Cook, Soundness and Completeness of an Axiom System for Program Verification 1978 SICOMP Fagin & Price, Efficient Calculation of Expected Miss Ratios in the Independent Reference Model 1978 SICOMP Frederickson & Hecht & Kim, Approximation Algorithms for Some Routing Problems 1978 SICOMP Fredman, Observations on the Complexity of Generating Quasi-Gray Codes 1978 SICOMP Gabow & Myers, Finding All Spanning Trees of Directed and Undirected Graphs 1978 SICOMP Gold, Deadlock Prediction: Easy and Difficult Cases 1978 SICOMP Hunt & Rosenkrantz, Computational Parallels Between the Regular and Context-Free Languages 1978 SICOMP Ibarra, The Unsolvability of the Equivalence Problem for epsilon-Free NGSM's with Unary Input (Output) Alphabet and Applications 1978 SICOMP Itai & Rodeh, Finding a Minimum Circuit in a Graph 1978 SICOMP Johnson & Mizoguchi, Selecting the Kth Element in X+Y and X_1 + X_2 + ... + X_m 1978 SICOMP Konheim & Reiser, Finite Capacity Queuing Systems with Applications in Computer Modeling 1978 SICOMP Lipton, Polynomials with 0-1 Coefficients that Are Hard to Evaluate 1978 SICOMP Lynch & Lipton, On Structure Preserving Reductions 1978 SICOMP Machtey & Winklmann & Young, Simple Goedel Numberings, Isomorphisms, and Programming Properties 1978 SICOMP Maurer & Salomaa & Wood, On Good E0L Forms 1978 SICOMP Megiddo & Tamir, An O(N log N) Algorithm for a Class of Matching Problems 1978 SICOMP Pippenger, Generalized Connectors 1978 SICOMP Plaisted, Some Polynomial and Integer Divisibility Problems are NP-Hard 1978 SICOMP Probert, An Extension of Computational Duality to Sequences of Bilinear Computations 1978 SICOMP Purdom, Tree Size by Partial Backtracking 1978 SICOMP Reghbati & Corneil, Parallel Computations in Graph Theory 1978 SICOMP Rosenberg & Snyder, Minimal-Comparison 2,3-Trees 1978 SICOMP Rosenkrantz & Hunt, Polynomial Algorithms for Deterministic Pushdown Automata 1978 SICOMP Ruskey, Generating t-ary Trees Lexicographically 1978 SICOMP Schnorr, An Algorithm for Transitive Closure with Linear Expected Time 1978 SICOMP Sedgewick, Data Movement in Odd-Even Merging 1978 SICOMP Selman, Polynomial Time Enumeration Reducibility 1978 SICOMP Solovay & Strassen, Erratum: A Fast Monte-Carlo Test for Primality 1978 SICOMP Tanner, Minimean Merging and Sorting: An Algorithm 1978 SICOMP Trojanowski, Ranking and Listing Algorithms for k-ary Trees 1978 SICOMP Wadsworth, Approximate Reduction and Lambda Calculus Models 1978 SICOMP Wagner & Seiferas, Correcting Counter-Automaton-Recognizable Languages 1978 SICOMP Wrathall, Rudimentary Predicates and Relative Computation 1978 SICOMP Yao, On the Loop Switching Addressing Problem 1977 SICOMP Adolphson & Thomas, A Linear Time Algorithm for a 2 x n Transportation Problem 1977 SICOMP Adolphson, Single Machine Job Sequencing with Precedence Constraints 1977 SICOMP Aoshima & Iri, Comments on F. Hadlock's Paper: ``Finding a Maximum Cut of a Planar Graph in Polynomial Time'' 1977 SICOMP Benson, Some Preservation Properties of Normal Form Grammars 1977 SICOMP Berman & Hartmanis, On Isomorphisms and Density of NP and Other Complete Sets 1977 SICOMP Borodin, On Relating Time and Space to Size and Depth 1977 SICOMP Carson & Law, A Note on Spira's Algorithm for the All-Pairs Shortest-Path Problem 1977 SICOMP Chin, The Partial Fraction Expansion Problem and Its Inverse 1977 SICOMP Chvatal, Determining the Stability Number of a Graph 1977 SICOMP Fabri, Some Remarks on p-Way Merging 1977 SICOMP Fino & Algazi, A Unified Treatment of Discrete Fast Unitary Transforms 1977 SICOMP Gabow, Two Algorithms for Generating Weighted Spanning Trees in Order 1977 SICOMP Galil, On Resolution with Clauses of Bounded Size 1977 SICOMP Garey & Johnson, Two-Processor Scheduling with Start-Times and Deadlines 1977 SICOMP Garsia & Wachs, A New Algorithm for Minimum Cost Binary Trees 1977 SICOMP Gill, Computational Complexity of Probabilistic Turing Machines 1977 SICOMP Ginsburg & Lynch, Derivation Complexity in Context-Free Grammar Forms 1977 SICOMP Gonzalez & Ibarra & Sahni, Bounds for LPT Schedules on Uniform Processors 1977 SICOMP Henderson & Zalcstein, A Graph-Theoretic Characterization of the PVchunk Class of Synchronizing Primitives 1977 SICOMP Hikita & Nozaki, A Completeness Criterion for Spectra 1977 SICOMP Igarashi, The Tape Complexity of Some Classes of Szilard Languages 1977 SICOMP Joshi & Levy, Constraints on Structural Descriptions: Local Transformations 1977 SICOMP Kafura & Shen, Task Scheduling on a Multiprocessor System with Independent Memories 1977 SICOMP Kirkpatrick & Kedem, Adequate Requirements for Rational Functions 1977 SICOMP Knuth & Morris & Pratt, Fast Pattern Matching in Strings 1977 SICOMP Kou, Polynomial Complete Consecutive Information Retrieval Problems 1977 SICOMP Kundu & Misra, A Linear Tree Partitioning Algorithm 1977 SICOMP Kung & Tong, Fast Algorithms for Partial Fraction Decomposition 1977 SICOMP Ladner, The Computational Complexity of Provability in Systems of Modal Propositional Logic 1977 SICOMP Lam & Sethi, Worst Case Analysis of Two Scheduling Algorithms 1977 SICOMP Larson, Minimizing Garbage Collection as a Function of Region Size 1977 SICOMP Lee & Preparata, Location of a Point in a Planar Subdivision and Its Applications 1977 SICOMP McColl & Paterson, The Depth of All Boolean Functions 1977 SICOMP Mehlhorn, A Best Possible Bound for the Weighted Path Length of Binary Search Trees 1977 SICOMP Misra, Prospects and Limitations of Automatic Assertion Generation for Loop Programs 1977 SICOMP Miyakawa & Yuba & Sugito & Hoshi, Optimum Sequence Trees 1977 SICOMP Papadimitriou & Steiglitz, On the Complexity of Local Search for the Traveling Salesman Problem 1977 SICOMP Pardo, Stable Sorting and Merging with Optimal Space and Time Bounds 1977 SICOMP Paul, A 2.5n-Lower Bound on the Combinational Complexity of Boolean Functions 1977 SICOMP Pippenger, Superconcentrators 1977 SICOMP Reyner, An Analysis of a Good Algorithm for the Subtree Problem 1977 SICOMP Rivest, On the Worst-Case Behavior of String-Searching Algorithms 1977 SICOMP Rosenkrantz & Stearns & Lewis, An Analysis of Several Heuristics for the Traveling Salesman Problem 1977 SICOMP Rosenthal & Goldner, Smallest Augmentations to Biconnect a Graph 1977 SICOMP Ruskey & Hu, Generating Binary Trees Lexicographically 1977 SICOMP Russell, Implementation Correctness Involving a Language with goto Statements 1977 SICOMP Russell, Internal Fragmentation in a Class of Buddy Systems 1977 SICOMP Schmidt & Szymanski, Succinctness of Descriptions of Unambiguous Context-Free Languages 1977 SICOMP Sedgewick, Quicksort with Equal Keys 1977 SICOMP Seiferas, Linear-Time Computation by Nondeterministic Multidimensional Iterative Arrays 1977 SICOMP Solovay & Strassen, A Fast Monte-Carlo Test for Primality 1977 SICOMP Szymanski & Ullman, Evaluating Relational Expressions with Dense and Sparse Arguments 1977 SICOMP Tarjan & Trojanowski, Finding a Maximum Independent Set 1977 SICOMP Tsukiyama & Ide & Ariyoshi & Shirakawa, A New Algorithm for Generating All the Maximal Independent Sets 1977 SICOMP Zave, Optimal Polyphase Sorting 1976 SICOMP Aho & Hopcroft & Ullman, On Finding Lowest Common Ancestors in Trees 1976 SICOMP Asano & Shibui & Takanami, General Results on Tour Lengths in Machines and Digraphs 1976 SICOMP Ashcroft & Wadge, Lucid--A Formal System for Writing and Proving Programs 1976 SICOMP Barak & Shamir, On the Parallel Evaluation of Boolean Expressions 1976 SICOMP Bass, Errata: On Optimal Processor Scheduling for Multiprogramming 1976 SICOMP Bernstein, Synthesizing a Response Function with a Feedback Scheduling Algorithm 1976 SICOMP Bollman, On Preserving Proximity in Extendible Arrays 1976 SICOMP Borodin & Cook, On the Number of Additions to Compute Specific Polynomials 1976 SICOMP Brockett & Dobkin, On the Number of Multiplications Required for Matrix Multiplication 1976 SICOMP Chandra, Generalized Program Schemas 1976 SICOMP Cheriton & Tarjan, Finding Minimum Spanning Trees 1976 SICOMP Cherniavsky, Simple Programs Realize Exactly Presberger Formulas 1976 SICOMP Chin, A Generalized Asymptotic Upper Bound on Fast Polynomial Evaluation and Interpolation 1976 SICOMP Csanky, Fast Parallel Matrix Inversion Algorithms 1976 SICOMP Dobkin & Lipton, Multidimensional Searching Problems 1976 SICOMP Downey & Sethi, Correct Computation Rules for Recursive Languages 1976 SICOMP Eswaran & Tarjan, Augmentation Problems 1976 SICOMP Even & Itai & Shamir, On the Complexity of Timetable and Multicommodity Flow Problems 1976 SICOMP Fillmore & Williamson, Ranking Algorithms: The Symmetries and Colorations of the n-Cube 1976 SICOMP Fredman, New Bounds on the Complexity of the Shortest Path Problem 1976 SICOMP Garey & Johnson & Tarjan, The Planar Hamiltonian Circuit Problem is NP-Complete 1976 SICOMP Gerhart, Proof Theory of Partial Correctness Verification Systems 1976 SICOMP Goodman & Hedetniemi & Tarjan, b-Matchings in Trees 1976 SICOMP Hendricks, An Account of Self-Organizing Systems 1976 SICOMP Hyafil, Bounds for Selection 1976 SICOMP Itai, Optimal Alphabetic Trees 1976 SICOMP Kennedy, A Comparison of Two Algorithms for Global Data Flow Analysis 1976 SICOMP Kinariwala & Bhat, Theory of Output Set Assignments and Degree Switching Operations 1976 SICOMP Levy, Local Adjunct Languages and Regular Sets 1976 SICOMP Lien, Termination Properties of Generalized Petri Nets 1976 SICOMP Manna & Shamir, The Theoretical Aspects of the Optimal Fixedpoint 1976 SICOMP Mateti & Deo, On Algorithms for Enumerating All Circuits of a Graph 1976 SICOMP Mazlack, Machine Selection of Elements in Crossword Puzzles: An Application of Computational Linguistics 1976 SICOMP Miller, Graph Transformations for Roundoff Analysis 1976 SICOMP Muchnick, Computational Complexity of Multiple Recursive Schemata 1976 SICOMP Munro & Spira, Sorting and Searching in Multisets 1976 SICOMP Ohtsuki, A Fast Algorithm for Finding an Optimal Ordering for Vertex Elimination on a Graph 1976 SICOMP Plotkin, A Powerdomain Construction 1976 SICOMP Probert, On the Additive Complexity of Matrix Multiplication 1976 SICOMP Rivest, Partial-Match Retrieval Algorithms 1976 SICOMP Rose & Tarjan & Lueker, Algorithmic Aspects of Vertex Elimination on Graphs 1976 SICOMP Scott, Data Types as Lattices 1976 SICOMP Sethi, Scheduling Graphs on Two Processors 1976 SICOMP Skyum, Decomposition Theorems for Various Kinds of Languages Parallel in Nature 1976 SICOMP Smith, Analysis of the Optimal, Look-Ahead Demand Paging Algorithms 1976 SICOMP Solovay, On Sets Cook-Reducible to Sparse Sets 1976 SICOMP Strassen, Computational Complexity over Finite Fields 1976 SICOMP Sudborough & Zalcberg, On Families of Languages Defined by Time-Bounded Random Access Machines 1976 SICOMP Szymanski & Williams, Noncanonical Extensions of Bottom-Up Parsing Techniques 1976 SICOMP Wadsworth, The Relation Between Computational and Denotational Properties for Scott's D_infinity-Models of the Lambda-Calculus 1976 SICOMP Williamson, Ranking Algorithms for Lists of Partitions 1976 SICOMP Yao, On the Evaluation of Powers 1975 SICOMP Aho & Steiglitz & Ullman, Evaluating Polynomials at Fixed Sets of Points 1975 SICOMP Alder, A Convergence Theorem for Hierarchies of Model Neurones 1975 SICOMP Ashcroft & Manna, Translating Program Schemas to While-Schemas 1975 SICOMP Baker & Gill & Solovay, Relativizations of the P =? NP Question 1975 SICOMP Brand, Proving Theorems with the Modification Method 1975 SICOMP Bruno & Hofri, On Scheduling Chains of Jobs on One Processor with Limited Preemption 1975 SICOMP Bumby & Cooper & Latch, Interactive Computation of Homology of Finite Partially Ordered Sets 1975 SICOMP Chandra & Wong, Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation 1975 SICOMP Drysdale & Young, Improved Divide/Sort/Merge Sorting Networks 1975 SICOMP Eswaran, Faithful Representation of a Family of Sets By a Set of Intervals 1975 SICOMP Even & Tarjan, Network Flow and Testing Graph Connectivity 1975 SICOMP Even, An Algorithm for Determining Whether the Connectivity of a Graph is at Least k 1975 SICOMP Ferrante & Rackoff, A Decision Procedure for the First Order Theory of Real Addition with Order 1975 SICOMP Garey & Graham, Bounds for Multiprocessor Scheduling with Resource Constraints 1975 SICOMP Garey & Johnson, Complexity Results for Multiprocessor Scheduling under Resource Constraints 1975 SICOMP Gelenbe & Lenfant & Potier, Response Time of a Fixed-Head Disk to Transfers of Variable Length 1975 SICOMP Geller, Realization with Feedback Encoding. I: Analogues of the Classical Theory 1975 SICOMP Geller, Realization with Feedback Encoding. II: Applications to Distinguishing Sequences 1975 SICOMP Hadlock, Finding a Maximum Cut of a Planar Graph in Polynomial Time 1975 SICOMP Hall, Solving a Problem in Eigenvalue Approximation with a Symbolic Algebra System 1975 SICOMP Hartmanis & Baker, On Simple Goedel Numberings and Translations 1975 SICOMP Hecht & Ullman, A Simple Algorithm for Global Data Flow Analysis Problems 1975 SICOMP Horowitz & Sahni, The Computation of Powers of Symbolic Polynomials 1975 SICOMP Hosken, Optimum Partitions of Tree Addressing Structures 1975 SICOMP Jackson & Van Rees, The Enumeration of Generalized Double Stochastic Nonnegative Integer Square Matrices 1975 SICOMP Johnson, Finding All the Elementary Circuits of a Directed Graph 1975 SICOMP Karp & McKellar & Wong, Near-Optimal Solutions to a 2-Dimensional Placement Problem 1975 SICOMP Konheim, An Elementary Solution of the Queuing System G/G/1 1975 SICOMP Kosaraju, Speed of Recognition of Context-Free Languages by Array Automata 1975 SICOMP Kuck & Maruyama, Time Bounds on the Parallel Evaluation of Arithmetic Expressions 1975 SICOMP Lavenberg & Shedler, Derivation of Confidence Intervals for Work Rate Estimators in a Closed Queuing Network 1975 SICOMP Lempel, Matrix Factorization Over GF(2) and Trace-Orthogonal Bases on GF(2^n) 1975 SICOMP Mandl & Vari, Computational Complexity of Inner Products of Vectors (And That of Other Bilinear Forms) Over a Noncommutative Ring (Auxiliary Functions Allowed) 1975 SICOMP Miller, Computational Complexity and Numerical Stability 1975 SICOMP Opderbeck & Chu, The Renewal Model for Program Behavior 1975 SICOMP Pratt, Every Prime Has a Succinct Certificate 1975 SICOMP Pratt, The Power of Negative Thinking in Multiplying Boolean Matrices 1975 SICOMP Revah, On the Number of Multiplications/Divisions Evaluating a Polynomial with Auxiliary Functions 1975 SICOMP Rosenberg, Managing Storage for Extendible Arrays 1975 SICOMP Rosenberg, Preserving Proximity in Arrays 1975 SICOMP Santos, State-Splitting for Stochastic Machines 1975 SICOMP Sethi, Complete Register Allocation Problems 1975 SICOMP Spira & Pan, On Finding and Updating Spanning Trees and Shortest Paths 1975 SICOMP Strong & Maggiolo-Schettini & Rosen, Recursion Structure Simplification 1975 SICOMP Valiant, Parallelism in Comparison Problems 1975 SICOMP White & Williamson, Computational Algorithms for the Enumeration of Group Invariant Partitions 1974 SICOMP Adams & Phelan & Stark, A Note on the Hecht-Ullman Characterization of Nonreducible Flow Graphs 1974 SICOMP Book & Nivat & Paterson, Reversal-Bounded Acceptors and Intersections of Linear Languages 1974 SICOMP Chua & Bernstein, Analysis of a Feedback Scheduler 1974 SICOMP Collins, The Computing Time of the Euclidean Algorithm 1974 SICOMP Cook, First Order Graph Grammars 1974 SICOMP Fateman, Polynomial Multiplication, Powers and Asymptotic Analysis: Some Comments 1974 SICOMP Fillmore & Williamson, On Backtracking: A Combinatorial Description of the Algorithm 1974 SICOMP Garey, Optimal Binary Search Trees with Restricted Maximal Depth 1974 SICOMP Goodman & Hedetniemi, On Hamiltonian Walks in Graphs 1974 SICOMP Graham, On Bounded Right Context Languages and Grammars 1974 SICOMP Greibach, Jump PDA's and Hierarchies of Deterministic Context-Free Languages 1974 SICOMP Holland, Erratum: Genetic Algorithms and the Optimal Allocation of Trials 1974 SICOMP Hu, Optimum Communication Spanning Trees 1974 SICOMP Ibarra, A Hierarchy Theorem for Polynomial-Space Recognition 1974 SICOMP Johnson & Demers & Ullman & Garey & Graham, Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms 1974 SICOMP Kleitman, A Note on Perfect Elimination Digraphs 1974 SICOMP Kundu, Existence of Graphs with Three Spanning Trees and Given Degree Sequence 1974 SICOMP McIlroy, The Number of 1's in Binary Integers: Bounds and Extremal Properties 1974 SICOMP Muntz & Opderbeck, Stack Replacement Algorithms for Two-Level Directly Addressable Paged Memories 1974 SICOMP Osteen & Lin, Picture Skeletons Based on Eccentricities of Points of Minimum Spanning Trees 1974 SICOMP Pecault, Computing the Weak Components of a Directed Graph 1974 SICOMP Perlman, Isomorph Rejection on Power Sets 1974 SICOMP Sahni, Computationally Related Problems 1974 SICOMP Savage, An Algorithm for the Computation of Linear Forms 1974 SICOMP Strassen, Polynomials with Rational Coefficients Which Are Hard to Compute 1974 SICOMP Tarjan, Finding Dominators in Directed Graphs 1973 SICOMP Aho & Ullman, A Technique for Speeding Up LR(k) Parsers 1973 SICOMP Akkoyunlu, The Enumeration of Maximal Cliques of Large Graphs 1973 SICOMP Bass, On Optimal Processor Scheduling for Multiprogramming 1973 SICOMP Chang & Lee & Dixon, The Specialization of Programs by Theorem Proving 1973 SICOMP Chase, Transposition Graphs 1973 SICOMP Corneil & Graham, An Algorithm for Determining the Chromatic Number of a Graph 1973 SICOMP Dunn, Continuous Group Averaging and Pattern Classification Problems 1973 SICOMP Gaver & Shedler, Approximate Models for Processor Utilization in Multiprogrammed Computer Systems 1973 SICOMP Goodman & Hedetniemi, Eulerian Walks in Graphs 1973 SICOMP Greibach, The Hardest Context-Free Language 1973 SICOMP Haskins & Rose, Toward Characterization of Perfect Elimination Digraphs 1973 SICOMP Holland, Genetic Algorithms and the Optimal Allocation of Trials 1973 SICOMP Hopcroft & Karp, An n^{5/2} Algorithm for Maximum Matchings in Bipartite Graphs 1973 SICOMP Hopcroft & Musinski, Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms 1973 SICOMP Hopcroft & Tarjan, Dividing a Graph into Triconnected Components 1973 SICOMP Hopcroft & Ullman, Set Merging Algorithms 1973 SICOMP Ibaraki, Finite State Representations of Discrete Optimization Problems 1973 SICOMP Jump & Thiagarajan, On the Equivalence of Asynchronous Control Structures 1973 SICOMP Lavenberg, Queuing Analysis of a Multiprogrammed Computer System Having a Multilevel Storage Hierarchy 1973 SICOMP McRae & Davidson, An Algorithm for the Extreme Rays of a Pointed Convex Polyhedral Cone 1973 SICOMP Nievergelt & Reingold, Binary Search Trees of Bounded Balance 1973 SICOMP Paterson & Stockmeyer, On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials 1973 SICOMP Savitch, How to Make Arbitrary Grammars Look Like Context-Free Grammars 1973 SICOMP Spira, A New Algorithm for Finding All Shortest Paths in a Graph of Positive Arcs in Average Time O(n^2 log^2 n) 1973 SICOMP Tarjan, Enumeration of the Elementary Circuits of a Directed Graph 1973 SICOMP Williamson, Isomorph Rejection and a Theorem of De Bruijn 1972 SICOMP Aho & Garey & Ullman, The Transitive Reduction of a Directed Graph 1972 SICOMP Aho & Peterson, A Minimum Distance Error-Correcting Parser for Context-Free Languages 1972 SICOMP Aho & Ullman, Optimization of Straight Line Programs 1972 SICOMP Bass, A Note on the Intersection of Complexity Classes of Functions 1972 SICOMP Book, On Languages Accepted in Polynomial Time 1972 SICOMP Book, Terminal Context in Context-Sensitive Grammars 1972 SICOMP Brown & Gries & Szymanski, Program Schemes with Pushdown Stores 1972 SICOMP Coffman & Klimko & Ryan, Analysis of Scanning Policies for Reducing Disk Seek Times 1972 SICOMP Constable & Gries, On Classes of Program Schemata 1972 SICOMP Gaver, Asymptotic Service System Output, with Application to Multiprogramming 1972 SICOMP Gavril, Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph 1972 SICOMP Harrison & Havel, Real-Time Strict Deterministic Languages 1972 SICOMP Hecht & Ullman, Flow Graph Reducibility 1972 SICOMP Hwang & Lin, A Simple Algorithm for Merging Two Disjoint Linearly Ordered Sets 1972 SICOMP Jackson, Expectations of Functions of Sequences over Finite Alphabets with Given Transition Probabilities by Methods Independent of Sequence Length 1972 SICOMP Kieburtz & Luckham, Compatibility and Complexity of Refinements of the Resolution Principle 1972 SICOMP Konheim, A Note on Merging 1972 SICOMP Liu, Analysis and Synthesis of Sorting Algorithms 1972 SICOMP Miller, Some Undecidability Results for Parallel Program Schemata 1972 SICOMP Reingold, Infix to Prefix Translation: The Insufficiency of a Pushdown Stack 1972 SICOMP Rosenberg, Symmetries in Data Graphs 1972 SICOMP Shedler & Tung, Locality in Page Reference Strings 1972 SICOMP Tarjan, Depth-First Search and Linear Graph Algorithms 1972 SICOMP Traub, Computational Complexity of Iterative Processes 1997 28 SIGACTN Ross, Animating Finite State Automata: Having Fun with Theory 1997 28 SIGACTN Yang & Ding & Xu, Some Better Results Estimating the Shift Function in Terms of Busy Beaver Function 1997 28 SIGACTN Shen, Correcting an Error in a ``Cheat Sheet'' 1996 27 SIGACTN Rudich, A Grand Challenge 1996 27 SIGACTN Pitassi, Two Steps Regarding the Future 1996 27 SIGACTN Goldsmith, Crisis or Opportunity? 1996 27 SIGACTN Feigenbaum, Goals for Computational Complexity Theory 1996 27 SIGACTN Allender, Whither Complexity? 1996 27 SIGACTN Ross, Loops and Induction Proofs 1996 27 SIGACTN Wirth, Compiler Construction (contents) 1996 27 SIGACTN Seiden, Theoretical Computer Science Cheat Sheet 1996 27 SIGACTN , Paul Erdos (1913-1996) 1996 27 SIGACTN Papadimitriou, On Extroverted Complexity Theory 1996 27 SIGACTN Goldreich & Wigderson, On The Usefulness of Hard Problems 1996 27 SIGACTN Razborov, Proofs, Computations and Practical Applications 1996 27 SIGACTN Sipser, Is the Handwriting on the Wall? 1996 27 SIGACTN Brassard & Crepeau, 25 Years of Quantum Cryptography 1996 27 SIGACTN Yannakakis, Perspectives on Database Theory 1996 27 SIGACTN Dwork, Distributed Computing Column (on PODC '96 result by Aspnes and Hurwood) 1996 27 SIGACTN O'Rourke, Computational Geometry Column 29 (perspective) 1996 27 SIGACTN Lynch, Distributed Algorithms (contents) 1996 27 SIGACTN Fagin & Halpern & Moses & Vardi, Reasoning About Knowledge (contents) 1996 27 SIGACTN Hofri, Analysis of Algorithms (contents) 1996 27 SIGACTN Garzon, Models of Massive Parallelism (contents) 1996 27 SIGACTN Levin, Fundamentals of Computing (a cheat-list) 1996 27 SIGACTN Johnson, A Brief History of SIGACT News and its Editors 1996 27 SIGACTN Fenner & Fortnow & Gasarch, Complexity Theory Newsflash 1996 27 SIGACTN Goldsmith & Levy & Mundhenk, Limited Nondeterminism 1996 27 SIGACTN Grumbach & Libkin & Milo & Wong, Query Languages for Bags: Expressive Power and Complexity 1996 27 SIGACTN Khuller, Nearest Neighbor Interchange Distance 1996 27 SIGACTN Khuller, Geometric k-MST Problem 1996 27 SIGACTN Gasarch, Lower Bounds for Selection 1996 27 SIGACTN Khuller, Minimum Weight Euclidean Matching 1996 27 SIGACTN Ross, Making Theory Come Alive 1996 27 SIGACTN Sedgewick & Flajolet, An Introduction to the Analysis of Algorithms (contents) 1996 27 SIGACTN Johnson, How to do Experiments (Extended Advertisement) 1996 27 SIGACTN Gasarch & Kelly & Pugh, Finding the ith Largest of n for Small i, n 1996 27 SIGACTN Bellare, Proof Checking and Approximation: Towards Tight Results 1996 27 SIGACTN Harrow, review of Davis & Sigal & Weyuker, Computability, Complexity, and Languages (2nd ed.): Fundamentals of Theoretical Computer Science (Academic Press, 1994) 1996 27 SIGACTN Ross, Java...Hot Java! What is that Brewing on the Web? 1996 27 SIGACTN Sipser, preview of Introduction to the Theory of Computation (PWS, 1996) 1996 27 SIGACTN Buhrman, A Short Note on Shor's Factoring Algorithm 1995 26 SIGACTN Amir & Blum & Loui & Savage & Smith, Contributions of Theoretical Computer Science 1995 26 SIGACTN Hemaspaandra & Ramachandran & Zimand, Worlds to Die For 1995 26 SIGACTN O'Rourke, Computational Geometry Column 27 (perfect matchings between triangulations) 1995 26 SIGACTN Latch, NSF Announcements: Theory of Computing Program 1995 26 SIGACTN Weiss, Journal Backlog Report 1995 26 SIGACTN Ross, Beware the Backlash: The Teaching vs. Research Conundrum Revisited 1995 26 SIGACTN Weiss, Algorithms, Problem Solving, and Data Structures with C++ (Addison-Wesley, 1996) (contents) 1995 26 SIGACTN Willhelm & Maurer, Compiler Design (Addison-Wesley, 1995) (contents) 1995 26 SIGACTN Baeza-Yates, Teaching Algorithms 1995 26 SIGACTN Macarie, Space-Bounded Probabilistic Computation: Old and New Stories 1995 26 SIGACTN Papadimitriou, Database Metatheory: Asking the Big Queries 1995 26 SIGACTN Van den Bussche, review of Floyd & Beigel, The Language of Machines: An Introduction to Computability and Formal Languages (Computer Science Press, 1994) 1995 26 SIGACTN Harrow, review of Straubing, Finite Automata, Formal Logic, and Circuit Complexity (Birkhauser, 1994) 1995 26 SIGACTN Latch, NSF Announcements: Theory of Computing Program 1995 26 SIGACTN Ross, Education and the World Wide Web 1995 26 SIGACTN Condon, Approximate Solutions to Problems in PSPACE 1995 26 SIGACTN O'Rourke, Computational Geometry Column 26 (Conway's thrackle conjecture) 1995 26 SIGACTN Brassard, The Book I've Always Wanted To Write (Almost) (review of Stinson, Cryptography Theory and Practice (CRC Press)) 1995 26 SIGACTN Harel, Will I be Pretty, Will I be Rich? Some Thoughts on Theory vs. Practice in Systems Engineering 1995 26 SIGACTN Tate, review of Bini & Pan, Polynomial and Matrix Computations -- Volume 1: Fundamental Algorithms (Birkhauser, 1994) 1995 26 SIGACTN Benson, review of Bloom, Iteration Theories -- The Equational Logic of Iterative Processes (Springer-Verlag, 1993) 1995 26 SIGACTN Goldstine, review of Floyd & Beigel, The Language of Machines -- An Introduction to Computability and Formal Languages (Computer Science Press, 1994) 1995 26 SIGACTN Stolboushkin, review of Ben-Ari, Mathematical Logic for Computer Science (Prentice-Hall, 1993) 1995 26 SIGACTN Chester, review of Lalement & Plaice, Computation as Logic (Prentice-Hall, 1993) 1995 26 SIGACTN Latch, NSF Announcements: Theory of Computing Program 1995 26 SIGACTN Weiss, Journal Backlog Report 1995 26 SIGACTN Parberry, Problems on Algorithms (Prentice-Hall, 1995) (contents) 1995 26 SIGACTN Kelley, Automata and Formal Languages (Prentice-Hall, 1995) (contents) 1995 26 SIGACTN Weiss, Efficient C Programming (Prentice-Hall, 1995) (contents) 1995 26 SIGACTN Levin, STOC Criteria 1995 26 SIGACTN Subramanian, Two Recent Algorithms for the Global Minimum Cut Problem 1995 26 SIGACTN Ben-Amram, What is a ``Pointer Machine''? 1995 26 SIGACTN Goldwasser, A Survey of Linear Programming in Randomized Subexponential Time 1995 26 SIGACTN Denny-Brown & Han & Hemaspaandra, corrections to Semi-Membership Algorithms: Some Recent Advances 1995 26 SIGACTN Hemaspaandra & Vollmer, The Satanic Notations: Counting Classes Beyond #P and Other Definitional Adventures 1995 26 SIGACTN O'Rourke, Computational Geometry Column 25 (Halperin and Sharir on complexity of lower envelopes of surfaces) 1995 26 SIGACTN Dwork, Distributed Computing Column (Lotus Notes cryptographic tools) 1995 26 SIGACTN Tin & Akman, review of Nerode & Shore, Logic for Applications (Springer, 1993) 1995 26 SIGACTN Khuller, Open Problems: 11 (median selection, all-pairs short paths) 1995 26 SIGACTN Ross, review of CD-ROM version of Cormen & Leiserson & Rivest, Introduction to Algorithms (MIT Press, 1993) 1995 26 SIGACTN Kearns & Vazirani, contents of Computational Learning Theory (MIT Press, 1994) 1995 26 SIGACTN Parberry, Surfing the Web 1994 25 SIGACTN Hemaspaandra, Complexity Theory Column 7: Teaching Computational Complexity: Resources to Treasure 1994 25 SIGACTN O'Rourke, Computational Geometry Column 24 (open problems) 1994 25 SIGACTN Brassard, Cryptology Column -- Quantum Computing: The End of Classical Cryptography? 1994 25 SIGACTN Kanellakis, Database Theory Column: Database Querying and Constraint Programming 1994 25 SIGACTN Drysdale, review of O'Rourke, Computational Geometry in C (Cambridge University Press, 1994) 1994 25 SIGACTN Rauff, review of Doets, From Logic to Logic Programming (MIT Press, 1994) 1994 25 SIGACTN Cull, review of Bridges, Computability: A Mathematical Sketchbook (Springer-Verlag, 1994) 1994 25 SIGACTN Warford, review of Gries & Schneider, A Logical Approach to Discrete Math (Springer-Verlag, 1993) 1994 25 SIGACTN Landau, Universities and the Two-body Problem 1994 25 SIGACTN Khuller, Open Problems: 10 1994 25 SIGACTN Zeugmann, Report on COLT 1994 1994 25 SIGACTN Parberry, A Form for Referees in Theoretical Computer Science 1994 25 SIGACTN Denny-Brown & Han & Hemaspaandra & Torenvliet, Semi-Membership Algorithms: Some Recent Advances 1994 25 SIGACTN O'Rourke, Computational Geometry Column 23 (on triangulation, tetrahedralization) 1994 25 SIGACTN Gasarch, review of Straubing, Finite Automata, Formal Logic, and Circuit Complexity (Birkhauser, 1994) 1994 25 SIGACTN Cohn, review of Rawlins, Compared to What?: An Introduction to the Analysis of Algorithms (Computer Science Press, 1992) 1994 25 SIGACTN Lorentz, contents of Recursive Algorithms (Ablex, 1994) 1994 25 SIGACTN Parberry, contents of Circuit Complexity and Neural Networks (MIT Press, 1994) 1994 25 SIGACTN Schmidt, contents of The Structure of Typed Programming Languages (MIT Press, 1994) 1994 25 SIGACTN Petersen, Two-Way One-Counter Automata Accepting Bounded Languages 1994 25 SIGACTN Regan & Wang, The Quasilinear Isomorphism Challenge 1994 25 SIGACTN Lopez-Ortiz, Linear Pattern Matching of Repeated Substrings 1994 25 SIGACTN Hallett & Wareham, A Compendium of Parameterized Complexity Results 1994 25 SIGACTN French & Fox & Maly & Selman, Wide Area Technical Report Service--technical reports online 1994 25 SIGACTN Hemaspaandra, Complexity Theory Column 5: The Not-Ready-For-Prime-Time Conjectures 1994 25 SIGACTN Gurevich, Logic Activities in Europe 1994 25 SIGACTN Richards, NSF Report: Theory of Computing Program 1994 25 SIGACTN Khuller, Open Problems: 9 1994 25 SIGACTN Wells, review of Nievergelt & Klaus, Algorithms and Data Structures: With Applications to Graphics and Geometry (Prentice-Hall, 1993) 1994 25 SIGACTN Ross, Animation in Computer Science Education 1994 25 SIGACTN Rodger, Tools for Automata, Parsing, and Parallel Mergesort 1994 25 SIGACTN Bloch & Buss & Goldsmith, How Hard Are n^2-Hard Problems? 1994 25 SIGACTN Raman, A Simpler Analysis of Algorithm 65 (Find) 1994 25 SIGACTN da Rocha Costa, Inspecting Continuations 1994 25 SIGACTN Goldreich, A Taxonomy of Proof Systems (part 2) 1994 25 SIGACTN O'Rourke, Computational Geometry Column 22 (n^2-hard problems) 1994 25 SIGACTN Zimand, review of Ko, Complexity Theory of Real Functions (Birkhauser Boston, 1991) 1994 25 SIGACTN Lee, Algorithms and Data Structures in Computer Engineering (contents) 1994 25 SIGACTN Straight, Combinatorics: An Invitation (contents) 1994 25 SIGACTN van Lint & Wilson, A Course in Combinatorics (contents) 1994 25 SIGACTN Manna & Waldinger, The Deductive Foundations of Computer Programming: A One-Volume Version of ``The Logical Basis for Computer Programming'' (contents) 1994 25 SIGACTN Gibbons & Spirakis, Lectures on Parallel Computation (contents) 1994 25 SIGACTN Fortnow & Kurtz & Whang, The Infinite Version of an Open Communication Complexity Problem is Independent of the Axioms of Set Theory 1994 25 SIGACTN Matos, An Introduction to Ultimately Periodic Sets of Integers 1993 24 SIGACTN Goldreich, A Taxonomy of Proof Systems (part 1) 1993 24 SIGACTN O'Rourke, Computational Geometry Column 21 (open problems) 1993 24 SIGACTN Goodrich, Parallel Algorithms Column 1: Models of Computation 1993 24 SIGACTN Ramanan, review of Bjorner & Lovasz & Yao, Linear Decision Trees: Volume Estimates and Topological Bounds (STOC 1992) 1993 24 SIGACTN Richards, NSF Report: Theory of Computing Program 1993 24 SIGACTN Khuller, Open Problems: 7 1993 24 SIGACTN Ross, Computer Science Laboratories in the Lower Division Undergraduate Curriculum 1993 24 SIGACTN Diderich, A Bibliography on Minimax Trees 1993 24 SIGACTN Spencer, Content-Free Languages 1993 24 SIGACTN Regan, Machine Models and Linear Time Complexity 1993 24 SIGACTN Brassard, Cryptology Column -- Quantum Cryptography: A Bibliography 1993 24 SIGACTN O'Rourke, Computational Geometry Column 20 (open problems from Ninth ACM Symposium on Computational Geometry) 1993 24 SIGACTN Ross, Lecture and Lab Syllabus for a Breadth-First Introductory Computer Science Course Sequence following the Data Structures and Algorithms Paradigm 1993 24 SIGACTN Ahuja & Magnanti & Orlin, contents of Network Flows: Theory, Algorithms, and Applications (Prentice Hall, 1993) 1993 24 SIGACTN Horowitz & Sahni & Anderson-Freed, contents of Fundamentals of Data Structures in C (Computer Science Press, 1993) 1993 24 SIGACTN Goldreich, Impressions from the ISTCS93 Conference 1993 24 SIGACTN Xiao-Long, The Representation of a Program in the Blum-Shub-Smale Theory of Computation over an Arbitrary Ring 1993 24 SIGACTN Parberry, Available on the Internet 1993 24 SIGACTN Hemaspaandra, Lowness: A Yardstick for NP-P 1993 24 SIGACTN O'Rourke, Computational Geometry Column 19 (community bibliography) 1993 24 SIGACTN Toynbee, On the Outer: Women in Computer Science Courses 1993 24 SIGACTN Ross, An Introductory Computer Science Curriculum Incorporating Theory 1993 24 SIGACTN Wood, contents of Data Structures, Algorithms, and Performance (Addison Wesley, 1993) 1993 24 SIGACTN Lyuu, contenst of Information Dispersal and Parallel Computation (Cambridge University Press, 1992) 1993 24 SIGACTN Bernstein & Lewis, contents of Concurrency in Programming and Database Systems (Jones and Bartlett, 1993) 1993 24 SIGACTN Colton, A Restated Pumping Lemma for Context-Free Languages 1993 24 SIGACTN Chaudhuri & Hoft, Splaying a Search Tree in Preorder Takes Linear Time 1993 24 SIGACTN Parberry, The Theory of Computation Ph. D. Genealogy 1993 24 SIGACTN Shallit, letter on Randomized Algorithms in ``Primitive'' Cultures, or What is the Oracle Complexity of a Dead Chicken? 1993 24 SIGACTN O'Rourke, Computational Geometry Column 18 (visibility graphs) 1993 24 SIGACTN Anthony & Biggs, contents of Computational Learning Theory (Cambridge University Press, 1992) 1993 24 SIGACTN Tel, contents of Topics in Distributed Algorithms (Cambridge University Press, 1991) 1993 24 SIGACTN Gunter, contents of Semantics of Programming Languages (MIT Press, 1992) 1993 24 SIGACTN Escardo, On Lazy Natural Numbers with Applications to Computability Theory and Functional Programming 1993 24 SIGACTN Davison, Vague Text Compression 1992 23 SIGACTN Dwork, Distributed Computing Column (fault-tolerant computation in networks of bounded degree) 1992 23 SIGACTN Brassard, Cryptology Column -- New and Coming Books 1992 23 SIGACTN Raghunathan, review of Borodin & Raghavan & Irani & Schieber, Competitive Paging with Locality of Reference (1991 STOC) 1992 23 SIGACTN Klein, review of Leighton & Stein & Makedon & Tardos & Plotkin & Spyros, Fast Approximation Algorithms for Multicommodity Flow Problems (1991 STOC) 1992 23 SIGACTN Singh, review of Tel, Topics in Distributed Algorithms (Cambridge University Press, 1991) 1992 23 SIGACTN Nievergelt, contents of Algorithms and Data Structures, With Applications to Graphics and Geometry (Prentice-Hall, 1993) 1992 23 SIGACTN Fellows, Megamath: Discrete Mathematics and Computer Science for Children 1992 23 SIGACTN Shallit, Randomized Algorithms in ``Primitive'' Cultures, or What is the Oracle Complexity of a Dead Chicken? 1992 23 SIGACTN Young, How Reductions to Sparse Sets Collapse The Polynomial-time Hierarchy: A Primer; Part II: Restricted Polynomial-time Reductions 1992 23 SIGACTN Young, Corrigendum: How Reductions to Sparse Sets Collapse The Polynomial-time Hierarchy: A Primer; Part I: Polynomial-time Turing Reductions 1992 23 SIGACTN Goldreich, (letter to the editor) 1992 23 SIGACTN Lambert, review of Karloff, Linear Programming (Birkhauser, 1991) 1992 23 SIGACTN Powers, review of Vishkin, Deterministic Sampling: A New Technique for Fast Pattern Matching (SICOMP, 1991) 1992 23 SIGACTN O'Rourke, Computational Geometry Column 16: Summaries of COMPGEOM 8 1992 23 SIGACTN Das, review of Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes (Morgan Kauffman, 1992) 1992 23 SIGACTN Ross, Bugs in Computer Science Courses? 1992 23 SIGACTN Karloff, contents of Linear Programming (Birkhauser, 1991) 1992 23 SIGACTN Thompson, contents of Type Theory & Functional Programming (Addison-Wesley, 1991) 1992 23 SIGACTN Litow, On Rat_infty 1992 23 SIGACTN Julstrom, A Bound on the Shift Function in Terms of the Busy Beaver Function 1992 23 SIGACTN Young, How Reductions to Sparse Sets Collapse the Polynomial-time Hierarchy: A Primer; Part I: Polynomial-time Turing Reductions 1992 23 SIGACTN Richards, NSF Report: Theory of Computing Program 1992 23 SIGACTN Blum, A Report on LATIN '92: The First Latin American Symposium on Theoretical INformatics 1992 23 SIGACTN Zeugmann, review of Reingold & Shen, More Nearly Optimal Algorithms for Unbounded Searching (1991) 1992 23 SIGACTN Zwarico, review of Shapiro, Separating Concurrent Languages with Categories of Language Embeddings (1991) 1992 23 SIGACTN O'Rourke, Computational Geometry Column 15 (art gallery problem solutions) 1992 23 SIGACTN Lincoln, Linear Logic 1992 23 SIGACTN Dwork, Distributed Computing Column (importance of synchrony) 1992 23 SIGACTN Ross, Theoretical Computer Science for Pre-college Students 1992 23 SIGACTN Tucker & Bradley & Cupper & Garnick, Fundamentals of Computing I: Logic, Problem Solving, Programs, and Computers (contents) 1992 23 SIGACTN Ja'Ja', An Introduction to Parallel Algorithms (contents) 1992 23 SIGACTN Thompson, Type Theory & Functional Programming (contents) 1992 23 SIGACTN Nisan, Using Hard Problems to Create Pseudorandom Generators (contents) 1992 23 SIGACTN Stasko, Animating Algorithms with XTANGO 1992 23 SIGACTN Luccio & Pagli, The p-Shovelers Problem (Computing with time-varying data) 1992 23 SIGACTN Allender, review of Beigel & Reingold & Spielman, PP is Closed under Intersection (1991 STOC) 1992 23 SIGACTN Pruhs, review of Blum & Raghavan & Schrieber, Navigating in Unfamiliar Geometric Terrain (1991 STOC) 1992 23 SIGACTN Kozen, The Design and Analysis of Algorithms (contents) 1992 23 SIGACTN Harel, Algorithmics: The Spirit of Computing, Second Edition (contents) 1992 23 SIGACTN O'Rourke, review of Agarwal, Intersection and Decomposition Algorithms for Planar Arrangements (Cambridge University Press, 1991) 1992 23 SIGACTN Mc Beth, The Turing Machine of Ackermann's Function 1992 23 SIGACTN Goldreich, Critique of Some Trends in the TCS Community in Light of Two Controversies 1991 22 SIGACTN Cull, review of Dunne, The Complexity of Boolean Networks (Academic Press, 1988) 1991 22 SIGACTN Kilov, review of Dijkstra (Ed.), Formal Development Programs and Proofs (Addison-Wesley, 1990) 1991 22 SIGACTN Franzblau, Teaching Students to Read Papers 1991 22 SIGACTN Pierce, contents of Basic Category Theory for Computer Scientists (MIT Press, 1991) 1991 22 SIGACTN Asperti & Longo, Categories, Types, and Structures: An Introduction to Category Theory for the Working Computer Scientist (MIT Press, 1991) 1991 22 SIGACTN Rivest, letter on the key size of DSA 1991 22 SIGACTN Rupert, Commutative Regular Languages 1991 22 SIGACTN Aurenhammer & Stockl, On the Peeper's Voronoi Diagram 1991 22 SIGACTN Ben-Amram, Some Notions on Notations 1991 22 SIGACTN Vishkin, Can Parallel Algorithms Enhance Serial Implementation? 1991 22 SIGACTN Alur & Henzinger, Time for Logic 1991 22 SIGACTN O'Rourke, Computational Geometry Column 13 (open problems) 1991 22 SIGACTN Ross, Science Teaching Institute in the Rockies (STIR) 1991 22 SIGACTN Loui, Theory of Computing: Achievements, Challenges, and Opportunities 1991 22 SIGACTN Parikh, A Test for Fuzzy Logic 1991 22 SIGACTN Birget, Errata to ``Intersection of Regular Languages and State Complexity'' 1991 22 SIGACTN Yu & Zhuang, On the State Complexity of Intersection of Regular Languages 1991 22 SIGACTN McBeth, Finite Types, Exponential Forms and Complete Trees 1991 22 SIGACTN Laplante, The Heisenberg Uncertainty Principle and the Halting Problem 1991 22 SIGACTN Brassard, Cryptology Column: From Moskva with Love 1991 22 SIGACTN Dwork, Distributed Computing Column 1991 22 SIGACTN Loui, NSF Report: Theory of Computing Program 1991 22 SIGACTN O'Rourke, review of Clarkson & Edelsbrunner & Guibas & Sharir & Welzl, Combinatorial Complexity Bounds for Arrangements of Curves and Spheres (1990) 1991 22 SIGACTN O'Rourke, review of Edelsbrunner & Guibas & Sharir, The Complexity and Construction of Many Faces in Arrangements of Lines and of Segments (1990) 1991 22 SIGACTN O'Rourke, review of Edelsbrunner & Guibas & Sharir, The Complexity of Many Cells in Arrangements of Planes and Related Problems (1990) 1991 22 SIGACTN O'Rourke, Computational Geometry Column 12 (on open problems from recent conferences) 1991 22 SIGACTN Ravi, Journal Backlog Report 1991 22 SIGACTN Gonnet & Baeza-Yates, contents of Handbook of Algorithms and Data Structures, 2nd Edition (Addison-Wesley, 1991) 1991 22 SIGACTN Birget, Intersection of Regular Languages and State Complexity 1991 22 SIGACTN Sherman, On Superpolylogarithmic Subexponential Functions (Part II) 1991 22 SIGACTN Brassard, Cryptology Column: How Convincing is Your Protocol? 1991 22 SIGACTN Loui, NSF Report: Computer and Computation Theory Program 1991 22 SIGACTN Sistla, reviews of Brookes & Hoare & Roscoe, A Theory of Communicating Sequential Processes, and Hennessy & Milnor, Algebraic Laws for Nondeterminism and Concurrency 1991 22 SIGACTN Parberry, reviews of the journals Neural Computation, and Neural Networks 1991 22 SIGACTN Lewis & Denenberg, comments on Data Structures and Their Algorithms (1991) 1991 22 SIGACTN Levin, Theory of Computation: How to Start. 1991 22 SIGACTN Galil & Italiano, Reducing Edge Connectivity to Vertex Connectivity 1991 22 SIGACTN Ibarra, On Resetting DLBA's 1991 22 SIGACTN Leiss, Some Comments on a Recent Note by Ravikumar 1991 22 SIGACTN Sherman, On Superpolylogarithmic Subexponential Functions (Part I) 1990 21 SIGACTN O'Rourke, Computational Geometry Column 11 1990 21 SIGACTN Sherk, Splay Trees (open problem) 1990 21 SIGACTN Petersson, Inversions in a Permutation (open problem) 1990 21 SIGACTN Bodlaender, Succinct Representations of Maps (open problem) 1990 21 SIGACTN Dietz, A Data Structure Game (solved by Dietz and Raman) (open problem) 1990 21 SIGACTN Kingston, contents of Algorithms and Data Structures: Design, Correctness, Analysis 1990 21 SIGACTN Martin, contents of Introduction to Languages and the Theory of Computation 1990 21 SIGACTN Palopoli, A New Proof of Undecidability of Safety of Logic Queries 1990 21 SIGACTN Ravikumar, Some Applications of a Technique of Sakoda and Sipser 1990 21 SIGACTN Tompa, Figures of Merit: The Sequel 1990 21 SIGACTN , NSF Offers U. S. Scientists Free Access To Japanese Databases 1990 21 SIGACTN Abiteboul & Kanellakis, Database Theory Column: Query Languages for Complex Object Databases 1990 21 SIGACTN Allender, review of Beame & Hastad, Optimal Bounds for Decision Problems on the CRCW PRAM (1989) 1990 21 SIGACTN O'Rourke, open problems from Sixth ACM Symposium on Computational Geometry 1990 21 SIGACTN Baase, Combinatorial Algorithms Textbooks 1990 21 SIGACTN Greenberg, Library Cataloging of Conference Proceedings 1990 21 SIGACTN Greenberg, Towards an Online Rolodex 1990 21 SIGACTN Brassard, Cryptology -- Column 4: Hiding Information from Oracles 1990 21 SIGACTN Dwork, Distributed Computing Column (on secret sharing) 1990 21 SIGACTN Harrow, review of Carroll & Darrell, Theory of Finite Automata with an Introduction to Formal Languages (1989) 1990 21 SIGACTN Ross, Writing a Textbook 1990 21 SIGACTN Carroll & Darrell, contents of Theory of Finite Automata with an Introduction to Formal Languages (1989) 1990 21 SIGACTN Cormen & Leiserson & Rivest, contents of Introduction to Algorithms (1990) 1990 21 SIGACTN Gallier, contents of Logic for Computer Science: Foundations of Automatic Theorem Proving (1986) 1990 21 SIGACTN Linz, contents of An Introduction to Formal Languages and Automata (1990) 1990 21 SIGACTN Manna & Waldinger, contents of The Logical Basis for Computer Programming; Volume 2: Deductive Systems (1990) 1990 21 SIGACTN Dwyer, Kinder, Gentler Average-Case Analysis for Convex Hulls and Maximal Vectors 1990 21 SIGACTN Brassard, Cryptology -- Column 3: Hot News on Interactive Protocols 1990 21 SIGACTN Parberry, reviews of Ajtai-Komlos-Szemeredi, Leighton, Bilardi-Preparata, and Cole 1990 21 SIGACTN O'Rourke, Computational Geometry Column 9 1990 21 SIGACTN Lakshmivarahan & Dhall, contents of Analysis and Design of Paralel Algorithms: Arithmetic and Matrix Problems (1990) 1990 21 SIGACTN Grossman, contents of Discrete Mathematics: An Introduction to Concepts, Methods, and Applications (1990) 1990 21 SIGACTN Ward & Halstead, contents of Computation Structures (1990) 1989 20 SIGACTN Anderson, Has the Science Funding System Broken Down? 1989 20 SIGACTN Brassard, Cryptology--Column 2 1989 20 SIGACTN Dwork, Distributed Computing Column 1989 20 SIGACTN Kanellakis & Abiteboul, Database Theory Column: Deciding Bounded Recursion in Database Logic Programs 1989 20 SIGACTN Khuller, Open Problems: 3 1989 20 SIGACTN Lee, NSF Report - Computer and Computation Research 1989 20 SIGACTN Martel, review of 4 articles on network flow 1989 20 SIGACTN O'Rourke, Computational Geometry Column 8 (correction of errors from Column 6) 1989 20 SIGACTN Ravi, Journal Backlog Report 1989 20 SIGACTN Ross, Education Forum: Theory in the Computer Science Curriculum 1989 20 SIGACTN Akl, contents of The Design and Analysis of Parallel Algorithms 1989 20 SIGACTN Gusfield & Irving, contents of The Stable Marriage Problem: Structure and Algorithms 1989 20 SIGACTN Mandrioli & Ghezzi, Theoretical Foundations of Computer Science 1989 20 SIGACTN Seitz, contents of Advanced Research in VLSI: Proceedings of the 1989 Decennial Caltech Conference 1989 20 SIGACTN Stallmann, course blurb on Surviving Intractability 1989 20 SIGACTN Bennett & Brassard, The Dawn of a New Era for Quantum Cryptography: The Experimental Prototype is Working! 1989 20 SIGACTN Chrobak & Karloff, A Lower Bound on the Size of Universal Sets for Planar Graphs 1989 20 SIGACTN Fischer & Fischer & Beigel, Primitive Recursion without Implicit Predecessor 1989 20 SIGACTN Parberry, A Guide for New Referees in Theoretical Computer Science 1989 20 SIGACTN Brassard, Cryptology -- Column 1 1989 20 SIGACTN Steinby, review of Moll, Arbib, and Kfoury, An Introduction to Formal Language Theory, 1988 1989 20 SIGACTN O'Rourke, Computational Geometry Column 7 1989 20 SIGACTN Parberry, The Journal Review Column 1989 20 SIGACTN Harel, contents of Algorithmics: The Spirit of Computing, and of The Science of Computing: Exploring the Nature and Power of Algorithms 1989 20 SIGACTN Drobot, contents of Formal Languages and Automata Theory, 1989 1989 20 SIGACTN Gurari, contents of An Introduction To The Theory of Computation, 1989 1989 20 SIGACTN Smith, contents of Design and Analysis of Algorithms, 1989 1989 20 SIGACTN Engelfriet, The Complexity of the Circularity Problem for Attribute Grammars: A Note on a Counterexample for a Simpler Construction 1989 20 SIGACTN Salenieks & Farringdon, How To Answer It 1989 20 SIGACTN Zeugmann, review of Baase, Computer Algorithms: Introduction to Design and Analysis (2nd ed.) (1988) 1989 20 SIGACTN O'Rourke, Computational Geometry Column 6 1989 20 SIGACTN Brassard & Bratley, contents of Algorithmics: Theory & Practice 1989 20 SIGACTN Brookshear, contents of Theory of Computation: Formal Languages, Automata, and Complexity 1989 20 SIGACTN Gumb, contents of Programming Logics: An Introduction to Verification and Semantics 1989 20 SIGACTN Manber, contents of Introduction to Algorithms: A Creative Approach 1988 20 SIGACTN Ryan, review of O'Rourke, Art Gallery Theorems and Algorithms, 1987 1988 20 SIGACTN Kunze, review of Weihrauch, Computability, 1987 1988 20 SIGACTN Simons, Excerpts from the AAAS Panel on the Funding of the Academic Physical Sciences 1988 20 SIGACTN Graham & Knuth & Patashnik, Textbook Announcement: Concrete Mathematics: A Foundation for Computer Science 1988 20 SIGACTN Parberry, A Short Errata to ``Parallel Complexity Theory'' 1988 20 SIGACTN Ramshaw, Suitening our Nomenclature 1988 20 SIGACTN Tompa, Figures of Merit 1988 20 SIGACTN Source Translation & Optimization, Galois Field Cryptography Software Library 1988 20 SIGACTN Khuller, Disjoint Paths in Parallel 1988 20 SIGACTN Khuller, Ear Decompositions 1988 19 SIGACTN O'Rourke, Computational Geometry Column 5 1988 19 SIGACTN Angluin, Report on COLT '88 1988 19 SIGACTN Ciesinger, Neural Nets as Powerful as Game of Life (as Powerful as Turing Machines) 1988 19 SIGACTN O'Rourke, Computational Geometry Column 4 1988 19 SIGACTN Kantabutra, review of Hastad (1987) 1988 19 SIGACTN Leighton & Leiserson, Theory of Parallel and VLSI Computation: Outline of Lectures 1988 19 SIGACTN Parberry, Sequential and Parallel Complexity Theory: Course Announcement 1988 19 SIGACTN Parberry, How to Present a Paper in Theoretical Computer Science: A Speaker's Guide for Students 1988 19 SIGACTN Kantabutra, A Natural Derivation of a Lower Bound on the Weighted Path Length of Binary Trees 1988 19 SIGACTN Moret, Planar NAE3SAT is in P 1988 19 SIGACTN Trickey, Using the SIAM LaTeX Style 1988 19 SIGACTN Wiedemann, priority acknowledgment 1988 19 SIGACTN Broder, Errata to ``How hard is it to marry at random? (On the approximation of the permanent)'' 1987 19 SIGACTN Simons & Yudken, Federal Funding in Computer Science: A Preliminary Report 1987 18 SIGACTN Smith, Funding Guidelines: NSF Computer and Computation Theory Program 1987 18 SIGACTN O'Rourke, Computational Geometry Column 3 1987 18 SIGACTN Swenson, A Constructive Proof of the Countability of Sigma* 1987 18 SIGACTN Bennett & Brassard, Quantum Public Key Distribution Reinvented 1987 18 SIGACTN Teng, The Construction of Huffman-Equivalent Prefix Code in NC 1987 18 SIGACTN Vitanyi & Awerbuch, Errata to ``Atomic Shared Register Access to Asynchronous Hardware'' 1987 18 SIGACTN Tarjan & Van Wyk, Correction to ``A Linear-Time Algorithm for Triangulating a Simple Polygon'' 1987 18 SIGACTN Williams & Meybodi, Representing Problems as String Transformations 1987 18 SIGACTN McBeth, A Proof of Generalized Induction 1987 18 SIGACTN Dunham, Pessimization is Unsolvable 1987 18 SIGACTN Epstein, On the NP-Completeness of Cryptarithms 1987 18 SIGACTN Dos Reis, Regular Languages Under F-gsm Mappings 1987 18 SIGACTN Dos Reis, Regular Languages Do Not Form a Lattice Under GSM Mappings 1987 18 SIGACTN Burkholder, The Halting Problem 1987 18 SIGACTN Staples, The Tower of Hanoi Problem with Arbitrary Start and End Positions 1987 18 SIGACTN O'Rourke, Computational Geometry Column 2 1987 18 SIGACTN Kozen, Fast Parallel Orthogonalization 1987 18 SIGACTN Wiedemann, Quantum Cryptography 1987 18 SIGACTN Gallaire & Minker & Nicolas, Logic and Databases: A Response 1987 18 SIGACTN Qiang, An O(ln n) Parallel Algorithm for the Subset Sum Problem 1987 18 SIGACTN McBeth, Addendum to ``The Tree Structure of Exponential Calculations'' 1986 18 SIGACTN O'Rourke, The Computational Geometry Column 1986 18 SIGACTN Richards, Parallel Sorting--A Bibliography 1986 18 SIGACTN Bernstein, Testing for Semilattices 1986 18 SIGACTN Dunham, The Cycle Burning Problem 1986 18 SIGACTN Wilson, The Halting Problem for Turing Machines 1986 18 SIGACTN Atkinson & Santoro & Urrutia, On the Integer Complexity of Boolean Matrix Multiplication 1986 18 SIGACTN Parberry, Parallel Speedup of Sequential Machines: A Defense of the Parallel Computation Thesis 1986 18 SIGACTN Harel, Logic and Databases: A Critique 1986 18 SIGACTN Dewdney, Experiments with a Generic Reduction Computer 1986 18 SIGACTN Gerety & Cull, Time Complexity of the Towers of Hanoi Problem 1986 17 SIGACTN Wegman, What It's Like To Be a POPL Referee 1986 17 SIGACTN Galil & Giancarlo, Improved String Matching with k Mismatches 1986 17 SIGACTN Fass, On the Inference of Canonical Context-Free Grammars 1986 17 SIGACTN Gurevich, What Does O(n) Mean? 1986 17 SIGACTN Dunham, A Simpler Approach to the Busy Beaver Problem 1986 17 SIGACTN Chibnik, Algorithmic Elimination of Spurious Nondeterminism from Mealy Machines 1986 17 SIGACTN Nirenberg, A Practical Turing Machine Representation 1985 17 SIGACTN Hastings, Maps of the Interval, Polynomial Time and Polynomial Space 1985 17 SIGACTN Hastings, Convergence of Simulated Annealing 1985 17 SIGACTN Franco, Sensitivity of Probabilistic Results on Algorithms for NP-Complete Problems to Input Distributions 1985 17 SIGACTN Brassard, Crusade for a Better Notation 1985 17 SIGACTN McBeth, The Tree Structure of Exponential Calculations 1985 17 SIGACTN Egyhazy & Ramsay, Generating a Set of Fundamental Cycles in a Graph 1985 16 SIGACTN Simons, Some Thoughts on Running a Conference 1985 16 SIGACTN Ornstein & Suchman, Reliability and Responsibility 1985 16 SIGACTN Vitanyi & Meertens, Big Omega versus the Wild Functions 1985 16 SIGACTN Morgenstern, How to Compute Fast a Function and All Its Derivatives 1984 16 SIGACTN Dunham, A Sequence of Uncomputable Functions 1984 16 SIGACTN Broder & Stolfi, Pessimal Algorithms and Simplexity Analysis 1984 16 SIGACTN Rosenberg, References to the Literature on VLSI Algorithmics and Related Mathematical and Practical Issues 1984 16 SIGACTN Johnson, The Genealogy of Theoretical Computer Science 1984 16 SIGACTN Santoro, Sense of Direction, Topological Awareness, and Communication Complexity 1983 15 SIGACTN Fass, Learning Context-Free Languages from Their Structural Sentences 1983 15 SIGACTN Cooke, On Non-Hierarchical Systems of Binary Operators 1983 15 SIGACTN Guessarian, Survey on Classes of Interpretations and Some of Their Applications 1983 15 SIGACTN Guessarian & Parisi-Presicce, Iterative vs. Regular Factor Algebras 1983 15 SIGACTN Moffat, The Effect of Paged Memory upon Algorithm Performance 1983 15 SIGACTN Calude, On a Class of Independent Problems Related to Rice's Theorem 1983 15 SIGACTN Coren, The Game of Academe 1983 15 SIGACTN Angluin, How to Prove it 1983 15 SIGACTN Amirazizi & Hellman, Time-Memory-Processor Tradeoffs 1983 15 SIGACTN Amirazizi & Karnin & Reyneri, Compact Knapsacks are Polynomially Solvable 1983 15 SIGACTN Blum, Coin Flipping by Telephone: A Protocol for Solving Impossible Problems 1983 15 SIGACTN Brassard, An Optimally Secure Relativized Cryptosystem (Extended Summary) 1983 15 SIGACTN Even, A Protocol for Signing Contracts 1983 15 SIGACTN Hellman & Karnin & Reyneri, On the Necessity of Cryptanalytic Exhaustive Search 1983 15 SIGACTN Henze, The Solution of a General Equation for the Public Key System 1983 15 SIGACTN Herlestam, On the Feasibility of Computing Discrete Logarithms Using Adleman's Subexponential Algorithm (Summary) 1983 15 SIGACTN Ingemarsson, Are All Injective Knapsacks Partly Solvable after Multiplication Modulo q? 1983 15 SIGACTN Jordan, A Variant of a Public Key Cryptosystem Based on Goppa Codes 1983 15 SIGACTN Morrison, Subtractive Encryptors--Alternatives to the DES 1983 15 SIGACTN Wiesner, Conjugate Coding 1982 14 SIGACTN Diffie, Cryptographic Technology: Fifteen Year Forecast 1982 14 SIGACTN Mandrioli, On Teaching Theoretical Foundations of Computer Science, Part II 1982 14 SIGACTN Tsou & Fischer, Decomposition of a Relation Scheme into Boyce-Codd Normal Form 1982 14 SIGACTN Grandjean, Number of Universal Quantifiers and Computational Complexity, preliminary report 1982 14 SIGACTN Afshar, On the Complexity of Permutation Network Design 1982 14 SIGACTN Mandrioli, On Teaching Theoretical Foundations of Computer Science, Part I 1982 14 SIGACTN Nijholt, Precedence Relations: A Bibliography 1982 14 SIGACTN Schoening, On NP-Decomposable Sets 1982 14 SIGACTN Culik, Theory of Computation on Abstract/Concrete Computer Automata 1982 14 SIGACTN Stanat & Weiss, A Pumping Theorem for Regular Languages 1982 14 SIGACTN Walsh, The Busy Beaver on a One-Way Infinite Tape 1981 13 SIGACTN Greibach, Comments on the Roots of Theorems and Languages Both Easy and Hard 1981 13 SIGACTN Schoening, A Note on Complete Sets for the Polynomial-Time Hierarchy 1981 13 SIGACTN Kruskal & Weixelbaum, A Note on the Worst Case of Heapsort 1980 12 SIGACTN Bentley & Haken & Saxe, A General Method for Solving Divide-and-Conquer Recurrences 1980 12 SIGACTN Gaifman & Shamir, Roots of the Hardest Context Free Language and Other Constructs 1980 12 SIGACTN Gens & Levner, Complexity of Approximation Algorithms for Combinatorial Problems: A Survey 1980 12 SIGACTN Gottlieb & Kruskal, A Note on Sorting Integers from a Bounded Range 1980 12 SIGACTN Harel, On Folk Theorems 1980 12 SIGACTN Leiss, Constructing a Finite Automaton for a Given Regular Expression 1980 12 SIGACTN Nourani, A Note on the Constructors of the Computable Universe 1980 12 SIGACTN Porto & Matos, Ackermann and the Superpowers 1979 11 SIGACTN Borodin & Fischer & Kirkpatrick & Lynch & Tompa, A Time-Space Tradeoff for Sorting and Related Non-Oblivious Computations: Erratum 1979 11 SIGACTN Ehrig & Kreowski & Padawitz, Algebraic Implementation of Abstract Data Types: An Announcement 1979 11 SIGACTN Derus & Hansen, Propositions with Multiple Dispositions and Multiple Truth Values 1979 11 SIGACTN Bentley & Saxe, Algorithms on Vector Sets 1979 11 SIGACTN Derus & Hansen, Logics of Truth and Disposition 1979 10 SIGACTN Dewdney, Logic Circuits in the Plane: Minimal Crossovers 1979 10 SIGACTN Krishnamoorthy & Biswas, The Generalized Towers of Hanoi 1978 10 SIGACTN Fischer, How SIGACT Began 1978 10 SIGACTN Harrison, SIGACT--the Early Years 1978 10 SIGACTN Burns, Mutual Exclusion with Linear Waiting Using Binary Shared Variables 1978 10 SIGACTN Jaffe, A Necessary and Sufficient Pumping Lemma for Regular Languages 1978 10 SIGACTN Kozen, A Clique Problem Equivalent to Graph Isomorphism 1978 10 SIGACTN Litow & Sudborough, On Non-Erasing Oracle Tapes in Space Bounded Reducibility 1978 10 SIGACTN Velu, Tests for Primality under the Riemann Hypothesis 1978 10 SIGACTN Wood, One-Sided Height-Balanced Search Trees 1978 10 SIGACTN Wood, Bibliography of Grammatical Similarity 1978 10 SIGACTN van Leeuwen, Evaluating a Polynomial and its Reverse 1978 10 SIGACTN Galil, Killing Two Birds with One Stone 1978 10 SIGACTN Colbourn & Colbourn, Graph Isomorphism and Self Complementary Graphs 1978 10 SIGACTN Yelowitz, A Note on ``A Note on the Transitive Closure of a Boolean Matrix'' 1978 10 SIGACTN Shyamasundar, A Note on the Multiplicaiton of 4x4 Matrices 1978 9 SIGACTN Nisselbaum, On Merging n Ordered Elements with Three Elements 1978 9 SIGACTN Garey & Johnson, A Note on ``A Note on `Some Simplified NP-Complete Graph Problems' '' 1978 9 SIGACTN Shyamasundar, A Note on the Transitive Closure of a Boolean Matrix 1977 9 SIGACTN Booth, Boolean Matrix Multiplication 1977 9 SIGACTN Krishnamoorthy, A Note on ``Some Simplified NP-Complete Graph Problems'' 1977 9 SIGACTN Rosen, Arcs in Graphs are NOT Pairs of Nodes 1977 9 SIGACTN Knuth, The Complexity of Songs 1977 9 SIGACTN Goldschlager, The Monotone and Planar Circuit Value Problems 1977 9 SIGACTN Britton & McLaughlin & Orgass, A Note Concerning Intermittent Assertions 1977 9 SIGACTN Carter, A Four-Gadget 1977 9 SIGACTN Knuth, The Samson-Mueller Algorithm 1977 9 SIGACTN van Leeuwen, A Regularity Condition for Parallel Rewriting Systems: Typographical Error 1976 8 SIGACTN Hartmanis & Hopcroft, Independence Results in Computer Science 1976 8 SIGACTN van Leeuwen, A Regularity Condition for Parallel Rewriting Systems 1976 8 SIGACTN Cook, A Short Proof of the Pigeon Hole Principle Using Extended Resolution 1976 8 SIGACTN Morgan, A Prime Decomposition Result for Parallel Systems 1976 8 SIGACTN van Leunen & Lipton, How to Have Your Abstract Rejected 1976 8 SIGACTN Yuval, The Geometric Mean Distance 1976 8 SIGACTN Knuth, Big Omicron and Big Omega and Big Theta 1976 8 SIGACTN Hamlet, Application of Dovetailing to Program Testing 1976 8 SIGACTN Kugel, Digital to Analog Conversion 1976 8 SIGACTN Kugel, On Uninteresting Theorems 1976 8 SIGACTN Angluin, The Four Russians' Algorithm for Boolean Matrix Multiplication is Optimal in its Class 1976 8 SIGACTN Simon, Two Results on Polynomial-Time Reducibilities 1976 8 SIGACTN Pyster, A Language Construct for ``Dovetailing'' 1975 7 SIGACTN Schneider, Automata Theory: What is it Used for? 1975 7 SIGACTN Lipton & Lynch, A Quantifier Characterization for Nondeterministic Log Space 1975 7 SIGACTN Galil, On Converting On-line Algorithms into Real-time and on Real-time Algorithms for String-matching and Palindrome Recognition: Preliminary version 1975 7 SIGACTN Alt & Mehlhorn, A Language over a One Symbol Alphabet Requiring only O(log log n) Space 1975 7 SIGACTN Gabow, How to Gracefully Number Certain Symmetric Trees 1975 7 SIGACTN Rosen, A Church-Rosser Theorem for Graph Grammars 1975 7 SIGACTN de Jong & van Leeuwen, An Improved Bound on the Number of Multiplications and Divisions Necessary to Evaluate a Polynomial and all its Derivatives 1975 7 SIGACTN Kugel, Trees 1975 7 SIGACTN Ladner, The Circuit Value Problem is Log Space Complete for P 1975 7 SIGACTN Lien, Periodic Properties of Strings 1975 7 SIGACTN Krishnamoorthy, An NP-Hard Problem in Bipartite Graphs 1974 6 SIGACTN van Leeuwen, A Forgotten Connection between Tag Systems and Parallel Rewriting 1974 6 SIGACTN Germano & Maggiolo-Schettini, Loops in ALGOL 60 and in Category Theory 1974 6 SIGACTN Cheriton, An Extension to On-line Multiplication Lower Bound Results 1974 6 SIGACTN Cook & Reckhow, Corrections for ``On the Lengths of Proofs in the Propositional Calculus'' 1974 6 SIGACTN Kosaraju, Correction to ``Regularity Preserving Functions'' 1974 6 SIGACTN Smith & van Leeuwen, Microprogrammed Random Access Stored Program Machines 1974 6 SIGACTN Knuth, Postscript about NP-Hard Problems 1974 6 SIGACTN Kosaraju, Regularity Preserving Functions 1974 6 SIGACTN Havel, Automata Theory Motivated by Problem Solving 1974 6 SIGACTN Bennison, Saving Tapes in the Simulation of Multihead Turing Machines 1974 6 SIGACTN Meyer, Computational Complexity: A Discussion 1974 6 SIGACTN Knuth, A Terminological Proposal 1974 6 SIGACTN Galil, On Some Direct Encodings of Nondeterministic Turing Machines Operating in Polynomial Time into P-Complete Problems 1974 6 SIGACTN Seiferas, A Note on Prefixes of Regular Languages 1974 6 SIGACTN Lipton & Snyder, On the Aanderaa-Rosenberg Conjecture 1974 6 SIGACTN Wegner, Modification of Aho and Ullman's Correctness Proof of Warshall's Algorithm 1973 5 SIGACTN Jones, Microprogramming--An Opportunity for SIGACT 1973 5 SIGACTN Benson, An Alternative Proof of Aho & Ullman's LR(k) Viable Prefix Theorem 1973 5 SIGACTN Rosenberg, On the Time Required to Recognize Properties of Graphs: A Problem 1973 5 SIGACTN Stockmeyer, Planar 3-Colorability is Polynomial Complete 1973 5 SIGACTN Lind & Meyer, A Characterization of Log-Space Computable Functions 1973 5 SIGACTN Ricci, Some Further Comments about Nothing 1973 5 SIGACTN Bauer & Brand & Fischer & Meyer & Paterson, A Note on Disjunctive Form Tautologies 1973 5 SIGACTN Chaitin, Philosophical Implications of Information-Theoretic Complexity 1973 5 SIGACTN Benson, Another Comment on the Null Word Definition Problem 1972 SIGACTN Ricci, An Observation on a Formal Language Notation 1972 SIGACTN Schreiber, Quasi-Dycklanguages 1995 6 SIGARTN Bradford & Wollowski, A Formalization of the Turing Test (The Turing Test as an Interactive Proof System) 1995 6 SIGARTN Ingargolio & Wilson, The Introductory Undergraduate AI Course as Observed on the WWW 1994 5 SIGARTN Orgun, Annotated Bibliography: Temporal and Modal Logic Programming 1993 4 SIGARTN Fostel, The Turing Test is For the Birds 1992 3 SIGARTN Johnson, Needed: A New Test of Intelligence (letter) 1992 3 SIGARTN Harnad, The Turing Test Is Not a Trick: Turing Indistinguishability Is A Scientific Criterion (letter) 1992 3 SIGARTN Shapiro, The Turing Test and The Economist (letter) 1991 2 SIGARTN Valtorta, Response to ``Explicit Solutions to the N-Queens Problem for all N'' 1990 1 SIGARTN Sosic & Gu, A Polynomial Time Algorithm for the N-Queens Problem 1989 107 SIGARTN Isper, The Infinite State Acceptor and Its Application to AI 1991 SIGCOMM Keshav, A Control-Theoretic Approach to Flow Control 1991 SIGCOMM Zaumen & Garcia-Luna Aceves, Dynamics of Distributed Shortest-Path Routing Algorithms 1991 SIGCOMM Sidhu & Nair & Abdallah, Finding Disjoint Paths in Networks 1991 SIGCOMM Tsuchiya, Efficient and Robust Policy Routing Using Multiple Hierarchical Addresses 1991 SIGCOMM Zhang & Shenker & Clark, Observations on the Dynamics of a Congestion Control Algorithm: The Effects of Two-Way Traffic 1991 SIGCOMM Awerbuch & Peleg, Concurrent Online Tracking of Mobile Users 1991 SIGCOMM Ioannidis & Duchamp & Maguire, IP-based Protocols for Mobile Internetworking 1990 20 SIGCOMM Awerbuch, Shortest Paths & Loop-Free Routing in Dynamic Networks 1990 20 SIGCOMM Bar-Noy & Gopal, Topology Distribution Cost vs. Efficient Routing in Large Networks 1989 SIGCOMM Merritt, A Top Down Unification of Minimum Cost Spanning Tree Algorithms 1989 SIGCOMM Garcia-Luna-Aceves, A Unified Approach to Loop-Free Routing using Distance Vectors or Link States 1989 SIGCOMM Cheng & Riley & Kumar & Garcia-Luna-Aceves, A Loop-Free Extended Bellman-Ford Routing Protocol Without Bouncing Effect 1989 SIGCOMM Rajagopalan & Faiman, A New Responsive Distributed Shortest-Path Routing Algorithm 1997 29 SIGCSEB Bilska & Leider & Procopiuc & Procopiuc & Rodger & Salemme & Tsang, A Collection of Tools for Making Automata Theory and Formal Languages Come Alive 1997 29 SIGCSEB Stasko, Using Student-Built Algorithm Animations as Learning Aids 1997 29 SIGCSEB Fell & Proulx, Exploring Martian Planetary Images: C++ Exercises for CS1 1997 29 SIGCSEB Rasala, Function Objects, Function Templates, and Passage By Behavior in C++ 1997 29 SIGCSEB Pattis, Teaching OOP in C++ Using an Artificial Life Framework 1997 29 SIGCSEB Goldberg, CALOS: First Results From an Experiment in Computer-Aided Learning for Operating Systems 1997 29 SIGCSEB Holliday, System Calls and Interrupt Vectors in an Operating Systems Course 1997 29 SIGCSEB Holland & Griffiths & Woodman, Avoiding Object Misconceptions 1997 29 SIGCSEB Starkey & Babcock & DeFrance, An Accelerated Introductory Computer Science Course Sequence for Non-Traditional Master's Students 1997 29 SIGCSEB Spooner & Skolnik, Science and Engineering Case Studies in Introductory Computing Courses for Non-Majors 1997 29 SIGCSEB Mallozzi, Binary Trees a la STL 1997 29 SIGCSEB Weiss, Experiences Teaching Data Structures With Java 1997 29 SIGCSEB Holmes & Smith, Adding Some Spice to CS1 Curricula 1997 29 SIGCSEB Walker, Collaborative Learning: A Case Study for CS1 at Grinnell College and UT-Austin 1997 29 SIGCSEB Astrachan & Smith & Wilkes, Application-based Modules using Apprentice Learning for CS 2 1997 29 SIGCSEB Haddad & Tesser & Wartik, Megaprogramming Education 1997 29 SIGCSEB McCauley & Manaris, Report on the Annual Survey of Departments Offering SCAC/CSAB-Accredited Computer Science Degree Programs 1997 29 SIGCSEB Gersting & Young, Content + Experiences = Curriculum 1997 29 SIGCSEB Jackson & Manaris & McCauley, Strategies for Effective Integration of Software Engineering Concepts and Techniques into the Undergraduate Computer Science Curriculum 1997 29 SIGCSEB Kay & Carrasquel & Clancy & Roberts & Zachary, Managing Large Introductory Courses 1997 29 SIGCSEB Culwin, Java in the C. S. Curriculum 1996 28 SIGCSEB Lemone & Ching, Easing into C++: Experineces with RoBOTL 1996 28 SIGCSEB Kay, Bandwagons Considered Harmful, or The Past as Prologue in Curriculum Change 1996 28 SIGCSEB Proulx & Rasala & Fell, Foundations of Computer Science: What are they and how do we teach them? 1996 28 SIGCSEB Bradley, Analyzing Multi-Phase Searching Algorithms 1996 28 SIGCSEB Evans, A New Emphasis & Pedagogy for a CS1 Course 1996 28 SIGCSEB Winslow, Programming Pedagogy -- A Psychological Overview 1996 28 SIGCSEB Fienup, Rethinking the CS-2 Course with an Object-Oriented Focus 1996 28 SIGCSEB Mitzenmacher, Designing Stimulating Programming Assignments for an Algorithms Course: A Collection of Exercises Based on Random Graphs 1996 28 SIGCSEB Paprzycki & Zalewski, Shaping the Focus of the Undergraduate Curriculum 1996 28 SIGCSEB Hosch, Java as a First Language: an Evaluation 1996 28 SIGCSEB Ben-Ari, Structure Exits, Not Loops 1996 28 SIGCSEB Coon, A Sequence of Lab Exercises for an Introductory Compiler Construction Course 1996 28 SIGCSEB Grout & Strader & Hanks, Essential C++ 1996 28 SIGCSEB Ross, Learning to Teach C++ 1996 28 SIGCSEB Resler, The Prisoner's Dilemma Tournament Revisited 1996 28 SIGCSEB Cook, A Computer Science Freshman Orientation Course 1996 28 SIGCSEB Chavey, Songs and the Analysis of Algorithms 1996 28 SIGCSEB Denman, Derivation of Recursive Algorithms for CS2 1996 28 SIGCSEB Reek, Teaching Inheritance versus Inclusion to First Year Computer Science Students 1996 28 SIGCSEB Wallingford, Toward a First Course Based on Object-Oriented Patterns 1996 28 SIGCSEB Adams, Object-Oriented Design: A Five-Phase Introduction to Object-Oriented Programming in CS1-2 1996 28 SIGCSEB Woodman & Davies & Holland, The Joy of Software--Starting with Objects 1996 28 SIGCSEB Fekete, Preparation for Research: Instruction in Interpreting and Evaluating Research 1996 28 SIGCSEB Cunningham, Internet-accessible Information Retrieval Tools for Advanced DB/IR Courses 1996 28 SIGCSEB goelman, The INGRES Tutorial as a Tool in Teaching Database *Theory* (or, I Can't Believe It's Not Training) 1996 28 SIGCSEB Reek, A Software Infrastructure to Support Introductory Computer Science Courses 1996 28 SIGCSEB Wise, YAP3: Improved Detection of Similarities in Computer Program and Other Texts 1996 28 SIGCSEB Boroni & Eneboe & Goosey & Ross & Ross, Dancing with DynaLab: Endearing the Science of Computing to Students 1996 28 SIGCSEB Shaffer & Heath & Yang, Using the Swan Data Structure Visualization System for Computer Science Education 1996 28 SIGCSEB Ben-Ari, Using Inheritance to Implement Concurrency 1996 28 SIGCSEB Berman & Duvall, Thinking about Binary Trees in an Object-Oriented World 1996 28 SIGCSEB Kolling & Rosenberg, Blue -- A Language for Teaching Object-Oriented Programming 1996 28 SIGCSEB Fell & Proulx & Casey, Writing across the Computer Science Curriculum 1996 28 SIGCSEB Biddle & Tempero, Explaining Inheritance: A Code Reusability Perspective 1996 28 SIGCSEB Baldwin, Discovery Learning in Computer Science 1996 28 SIGCSEB McCauley & Jackson & Manaris, Documentation Standards in the Undergraduate Computer Science Curriculum 1996 28 SIGCSEB Ginat, Efficiency of Algorithms for Programming Beginners 1996 28 SIGCSEB Webber, The Pascal Trainer 1996 28 SIGCSEB Paxton, Webucation: Using the Web as a Classroom Tool 1996 28 SIGCSEB Fekete & Greening, Designing Closed Laboratories for a Computer Science Course 1996 28 SIGCSEB Freund & Roberts, Thetis: An ANSI C Programming Environment Designed for Introductory Use 1996 28 SIGCSEB Feldman & Zelenski, The Quest for Excellence in Designing CS1/CS2 Assignments 1996 28 SIGCSEB Brilliant & Wiseman, The First Programming Paradigm and Language Dilemma 1995 27 SIGCSEB Cunningham, An Introduction to Research and the CS/IS Professional Literature for Undergraduates 1995 27 SIGCSEB Hartel & Hertzberger, Paradigms and Laboratories in the Core Computer Science Curriculum: An Overview 1995 27 SIGCSEB McCloskey, An Analysis of Algorithms Laboratory Utilizing the Maximum Segment Sum Problem 1995 27 SIGCSEB Yerion & Rinehart, Guidelines for Collaborative Learning in Computer Science 1995 27 SIGCSEB Benham, A Geometric Approach to Integer Condition Codes and Branch Instructions 1995 27 SIGCSEB Van Wyk, Programming as Writing: Using Portfolios 1995 27 SIGCSEB Haynes, Explaining Recursion to the Unsophisticated 1995 27 SIGCSEB Schaller & Kitchen, Experiences in Teaching Parallel Computing -- Five Years Later 1995 27 SIGCSEB Warford, An Experience Teaching Formal Methods in Discrete Mathematics 1995 27 SIGCSEB Martin-Sanchez & Pareja-Flores, A Gentle Introduction to Algorithm Complexity for CS1 with Nine Variations on a Theme by Fibonacci 1995 27 SIGCSEB Astrachan & Reed, AAA and CS 1: The Applied Apprenticeship Approach to CS 1 1995 27 SIGCSEB Reek, A Top-Down Approach to Teaching Programming 1995 27 SIGCSEB Roberts & Lilly & Rollins, Using Undergraduates as Teaching Assistants in Introductory Programming Courses: An Update on the Stanford Experience 1995 27 SIGCSEB Kay, Training Computer Science Teaching Assistants: A Seminar for New TAs 1995 27 SIGCSEB Liang, Teaching Dynamic Programming Techniques Using Permutation Graphs 1995 27 SIGCSEB Kooshesh, Solving a Problem Using Cooperating Data Structures 1995 27 SIGCSEB Yang & Jin, Integrating Parallel Algorithm Design with Parallel Machine Models 1995 27 SIGCSEB Roberts, A C-Based Graphics Library for CS1 1995 27 SIGCSEB Kolling & Koch & Rosenberg, Requirements for a First Year Object-Oriented Teaching Language 1995 27 SIGCSEB Guzdial, Centralized Mindset: A Student Problem with Object-Oriented Programming 1995 27 SIGCSEB Herrmann & Popyack, Creating an Authentic Learning Experience in Introductory Programming Courses 1995 27 SIGCSEB Lambert, Restructuring the Introductory Computer Science Course for Engineers 1995 27 SIGCSEB Reinfelds, A Three Paradigm First Course for CS Majors 1995 27 SIGCSEB Ginat, Loop Invariants and Mathematical Games 1995 27 SIGCSEB Roberts, Loop Exits and Structured Programming: Reopening the Debate 1995 27 SIGCSEB Rodger, An Interactive Lecture Approach to Teaching Computer Science 1995 27 SIGCSEB Paxton, A Novel Approach to Teaching Artificial Intelligence 1995 27 SIGCSEB Rubinstein, Computer Science Projects with Music 1995 27 SIGCSEB Wadkins, Rigorous Proofs of Program Correctness without Formal Logic 1995 27 SIGCSEB Hitz & Hudec, Modula-2 versus C++ as a First Programming Language -- Some Empirical Results 1995 27 SIGCSEB Wick, On Using C++ and Object-Orientation in CS1: The Message is Still More Important than the Medium 1995 27 SIGCSEB Noyes, Teaching a Modern Numerical Analysis Course 1995 27 SIGCSEB Nevison & Corica & Kmoch & Fix & Noonan & Kay, Changes in the Advanced Placement Computer Science Course: Case Studies and C++ (panel) 1995 27 SIGCSEB Walker & Baxter & Cupper & Schneider, Teh Computer Science Major within a Liberal Arts Environment (panel) 1995 27 SIGCSEB Baldwin & Barker & Mead & Tucker & Ziegler, Visions of Breadth in Introductory Computing Curricula (panel) 1995 27 SIGCSEB Burd & Brookshear & Decker & Gustavson & Lintner & Scragg, Revitalizing the Computer Science Course for Non-majors (panel) 1994 26 SIGCSEB Lloyd, Exploring the Byzantine Generals Problem With Beginning Computer Science Students 1994 26 SIGCSEB Konstam & Howland, Teaching Computer Science Principles to Liberal Arts Students Using Scheme 1994 26 SIGCSEB Becker, Inexpensive Teaching Techniques with Rich Rewards 1994 26 SIGCSEB Ford, The Progress of Undergraduate Software Engineering Education 1994 26 SIGCSEB Howatt, On Criteria for Grading Student Programs 1994 26 SIGCSEB Cull & Pandey, Isomorphism and the N-Queens Problem 1994 26 SIGCSEB Freeman, Do Students Test Their Software? 1994 26 SIGCSEB Jarc, Data Structures: A Unified View 1994 26 SIGCSEB Bloom & Fekete, Self-sufficiency and Critical Thinking in the Programming Languages Course 1994 26 SIGCSEB Magno, A New Approach to Computer Science in the Community College: Negotiated Teaching and Learning 1994 26 SIGCSEB Silver, Mathematizing Abstract Data Types 1994 26 SIGCSEB Paxton & Ross & Starkey, A Methodology for Teaching an Integrated Computer Science Curriculum 1994 26 SIGCSEB Shackelford & LeBlanc, Integrating ``Depth First'' and ``Breadth First'' Models of Computing Curricula 1994 26 SIGCSEB Tucker & Wegner, New Directions in the Introductory Computer Science Curriculum 1994 26 SIGCSEB Mili & Mili, Teaching a First Course on Data Structures: A Software Engineering Approach 1994 26 SIGCSEB Luker & Rothermel, The Philosophy of Artificial Intelligence: A General Studies Course with Particular Benefits to Computer Science Majors 1994 26 SIGCSEB Decker & Hirshfield, The Top 10 Reasons Why Object-Oriented Programming Can't Be Taught in CS 1 1994 26 SIGCSEB Luker, There's More to OOP Than Syntax! 1994 26 SIGCSEB Rasala & Proulx & Fell, From Animation to Analysis in Introductory Computer Science 1994 26 SIGCSEB Shum & Cook, Using Literate Programming to Teach Good Programming Practices 1994 26 SIGCSEB Etlinger & Lutz, Professional Literacy: Labs for Advanced Programming Courses 1994 26 SIGCSEB Denman & Naumann & Potter & Richter, Derivation of Programs for Freshmen 1994 26 SIGCSEB Lau & Bush & Jinks, Towards an Introductory Formal Programming Course 1994 26 SIGCSEB Goldweber & Barr & Leska, A New Perspective on Teaching Computer Literacy 1994 26 SIGCSEB Zachary, Tutorial-Based Teaching of Introductory Programming Classes 1994 26 SIGCSEB Arnow, Teaching Programming to Liberal Arts Students: Using Loop Invariants 1994 26 SIGCSEB Rozanski, Accreditation: Does It Enhance Quality? 1994 26 SIGCSEB Scragg & Baldwin & Koomen, Computer Science Needs an Insight-Based Curriculum 1994 26 SIGCSEB Knight & Prey & Wulf, Undergraduate Computer Science Education: A New Curriculum Philosophy & Overview 1994 26 SIGCSEB Geitz, Concepts in the Classroom, Programming in the Lab: A Report on a Broad-based CS1 an CS2 with Structured Labs 1994 26 SIGCSEB Oliver & Dalbey, A Software Development Process Laboratory for CS1 and CS2 1994 26 SIGCSEB Wolz & Conjura, Integrating Mathematics and Programming into a Three Tiered Model for Computer Science Education 1994 26 SIGCSEB Gersting, A Software Engineering ``Frosting'' on a Traditional CS-1 Course 1994 26 SIGCSEB Astrachan, Self-Reference is an Illustrative Essential 1994 26 SIGCSEB Bruce, Attracting (& Keeping) the Best and the Brightest: An Entry-Level Course for Experienced Introductory Students 1994 26 SIGCSEB Hafen, Developing Writing Skills in Computer Science Students 1994 26 SIGCSEB Finkel & Hooker & Salvidio & Sullivan & Thomas, Teaching C++ to High School Students 1994 26 SIGCSEB Baldwin & Scragg & Koomen, A Three-Fold Introduction to Computer Science 1994 26 SIGCSEB Biermann & Fahmy & Guinn & Pennock & Ramm & Wu, Teaching a Hierarchical Model of Computation with Animation Software in the First Course 1994 26 SIGCSEB Pattis, Teaching EBNF First in CS 1 1994 26 SIGCSEB Wills & Finkel & Gennert & Ward, Peer Learning in an Introductory Computer Science Course 1994 26 SIGCSEB Holt, Introducing Undergraduates to Object Orientation Using the Turing Language 1994 26 SIGCSEB Meter & Miller, Engaging Students and Teaching Modern Concepts: Literate, Situated, Object-Oriented Programming 1994 26 SIGCSEB Berman & Decker & Nguyen & Reid & Wallingford, Using C++ in CS1/CS2 1994 26 SIGCSEB McCormick & Culwin & DeLillo & Feldman & Pattis & Savitch, Teaching Ada by the Book: The Pedagogy of Ada in CS1 1993 25 SIGCSEB Biernat, Teaching Tools for Data Structures and Algorithms 1993 25 SIGCSEB Brown, Discrete Mathematics II 1993 25 SIGCSEB Shiau, Using A Heuristic Algorithm to Help Analyze Graph Problems 1993 25 SIGCSEB Miller, MIS as a Discipline: A Structured Definition 1993 25 SIGCSEB Keating, Hopfield Networks, Neural Data Structures and the Nine Flies Problem: Neural Network Programming Projects for Undergraduates 1993 25 SIGCSEB Higginbotham, The Integer Square Root of N via a Binary Search 1993 25 SIGCSEB Staehr, Debating: Its Use in Teaching Social Aspects of Computing 1993 25 SIGCSEB Moses, Our Computer Science Classrooms: Are They ``Friendly'' to Female Students? 1993 25 SIGCSEB Radenski, A Voyage to Oberon 1993 25 SIGCSEB Hein, A Declarative Laboratory Approach for Discrete Structures, Logic, and Computability 1993 25 SIGCSEB Deremer, Improving the Learning Environment in CS I -- Experiences with Communication Strategies 1993 25 SIGCSEB Pruhs, The SPIN-OUT Puzzle 1993 25 SIGCSEB Gray, Is Eight Enough? -- The Eight Queens Problem Re-examined 1993 25 SIGCSEB Homkes & Ross, Clarifying 'C' 1993 25 SIGCSEB Mazaitis, The Object-Oriented Paradigm in the Undergraduate Curriculum: A Survey of Implementations and Issues 1993 25 SIGCSEB Morton & Norgaard, A Survey of Programming Languages in CS Programs 1993 25 SIGCSEB Bryant & De Palma, A First Course in Computer Science for Small Four Year CS Programs 1993 25 SIGCSEB Kelsh, Levels of Abstraction in CS2 1993 25 SIGCSEB Nute & Page & Perry & Rinewalt & Ryan & White & Wileman, Results and Problems from the 1992 ACM Scholastic Programming Contest Finals 1993 25 SIGCSEB Chandra, A Set of Programming Projects for a Second Programming Course 1993 25 SIGCSEB Chaudhuri & Dempster, A Note on Slowing Quicksort 1993 25 SIGCSEB Carrasquel, Necessity Is The Mother of Language Features 1993 25 SIGCSEB Ruckert & Helpern, Educational C 1993 25 SIGCSEB Mancoridis & Holt & Penny, A ``Curriculum-Cycle'' Environment for Teaching Programming 1993 25 SIGCSEB Noyes, Teaching AI: A Breadth-First Approach 1993 25 SIGCSEB LaRusch, Teaching Artificial Intelligence As The Year 2000 Approaches 1993 25 SIGCSEB Erickson, USENET as a Teaching Tool 1993 25 SIGCSEB Hilburn, A Top-Down Approach to Teaching an Introductory Computer Science Course 1993 25 SIGCSEB Moore & Rich & Wick, Scientific Investigation in a Breadth-First Approach to Introductory Computer Science 1993 25 SIGCSEB Paxton & Ross & Starkey, An Integrated, Breadth-First Computer Science Curriculum Based on Computing Curricula 1991 1993 25 SIGCSEB Using C in CS1 -- Evaluating the Stanford Experience 1993 25 SIGCSEB Pattis, The ``Procedures Early'' Approach in CS 1: A Heresy 1993 25 SIGCSEB Dyck, Emphasizing the Process in Delivering CS-1 1993 25 SIGCSEB Curl & Hussin, Introductory Computing: A New Approach 1993 25 SIGCSEB Kay, An Honors Computer Science Seminar for Undergraduate Non-Majors 1993 25 SIGCSEB Witten & Bell, Getting Research Students Started: A Tale of Two Courses 1993 25 SIGCSEB Goh & Leong, Laboratories and Other Educational Experiences based on Curricula '91 1993 25 SIGCSEB Cowley & Scragg & Baldwin, Gateway Laboratories: Integrated, Interactive Learning Modules 1993 25 SIGCSEB Fekete, Reasoning about Programs: Integrating Verification and Analysis of Algorithms Into The Introductory Programming Course 1993 25 SIGCSEB Trahan & Rodger, Simulation and Visualization Tools for Teaching Parallel Merge Sort 1993 25 SIGCSEB Reid, The Object-Oriented Paradigm in CS1 1993 25 SIGCSEB Decker & Hirshfield, Top-Down Teaching: Object-Oriented Programming in CS 1 1993 25 SIGCSEB Taylor & Paine, An Inter-Disciplinary Approach to the Development of Writing Skills in Computer Science Students 1993 25 SIGCSEB McDonald & McDonald, Developing Oral Communication Skills of Computer Science Undergraduates 1992 24 SIGCSEB Curl, Writing About Programming in CS1 1992 24 SIGCSEB Julstrom, Slow Sorting: A Whimsical Inquiry 1992 24 SIGCSEB Hilzer, Concurrency with Semaphores 1992 24 SIGCSEB Krone, Student Designed Machines for a Theory of Computation Course 1992 24 SIGCSEB Trono, An Undergraduate Project to Compute Minimal Perfect Hashing Functions 1992 24 SIGCSEB Shiflet, The Publication Process for Computer Science Textbooks 1992 24 SIGCSEB Rout, The Culture of Quality and Software Engineering Education 1992 24 SIGCSEB Plouzeau & Raynal, Elements for a Course on the Design of Distributed Algorithms 1992 24 SIGCSEB Hannay, Hypercard Automata Simulation: Finite-State, Pushdown and Turing Machines 1992 24 SIGCSEB Prather, Computer Science in an Undergraduate Liberal Arts and Sciences Setting 1992 24 SIGCSEB McCracken, Programming Languages in the Computer Science Curriculum 1992 24 SIGCSEB Rubio, A First Computing Course Based on Curricula 1991 1992 24 SIGCSEB Dey & Mand, Current Trends in Computer Science Curriculum: A Survey of Four-Year Programs 1992 24 SIGCSEB Kay, A Balanced Approach To First-Year Computer Science 1992 24 SIGCSEB Cote & Custeau, An Integrating Pedagogical Tool Based on Writing Articles 1992 24 SIGCSEB Kiper & Lutz & Etlinger, Undergraduate Software Engineering Laboratories: A Progress Report from Two Universities 1992 24 SIGCSEB Abunawass, Biologically Based Machine Learning Paradigms: An Introductory Course 1992 24 SIGCSEB Baldwin & Koomen, Using Scientific Experiments in Early Computer Science Laboratories 1992 24 SIGCSEB Astrachan, On Finding a Stable Roommate, Job, or Spouse: A Case Study Crossing the Boundaries of Computer Science Courses 1992 24 SIGCSEB Warford, Good Pedagogical Random Number Generators 1992 24 SIGCSEB King, The Evolution of the Programming Languages Course 1992 24 SIGCSEB Clancy & Linn, Case Studies in the Classroom 1992 24 SIGCSEB Hartfield & Winograd & Bennett, Learning HCI Design: Mentoring Project Groups in a Course on Human-computer Interaction 1992 24 SIGCSEB Kay, A Course in Computer Law 1992 24 SIGCSEB Wise, Detection of Similarities in Student Programs: YAP'ing may be preferable to Plague'ing 1992 24 SIGCSEB Feldman, The Portable Dining Philosophers: A Movable Feast of Concurrency and Software Engineering 1991 23 SIGCSEB Jones & McGuirt, Telecommunications and Computer Science: Tw9o Merging Paradigms 1991 23 SIGCSEB Walker & Tucker, Managing Hard-disk PCs in the Introductory Laboratory 1991 23 SIGCSEB Osborne, OZ: A Syntax Generating Editor 1991 23 SIGCSEB Messersmith, Student Created User Manuals for a Course on Programming Languages 1991 23 SIGCSEB Chu & Johnsonbaugh, The Four-Peg Tower of Hanoi Puzzle 1991 23 SIGCSEB Trono, Average Case Analysis When Merging Two Ordered Lists of Different Length 1991 23 SIGCSEB Chan, Computing Average Path Lengths of Binary Search Trees 1991 23 SIGCSEB Narayanan, Pattern Matching for Everyone 1991 23 SIGCSEB Ford, A Bibliography of Broad-Coverage Software Engineering Textbooks 1991 23 SIGCSEB Yue, Dining Philosophers Revisited, Again 1991 23 SIGCSEB Owens (Ed.), Twenty-Second SIGCSE Technical Symposium on Computer Science Education 1991 23 SIGCSEB Wallace & Wallace, Two Neural Network Programming Assignments Using Arrays 1991 23 SIGCSEB Fisher & Gross, Teaching the Programming of Parallel Computers 1991 23 SIGCSEB Astrachan, Pictures as Invariants 1991 23 SIGCSEB Almstrum, The Relationship Between Pre-college Mathematics and Undergraduate Computer Science Curricula 1991 23 SIGCSEB Scott, Mathematics and Computer Science at Odds over Real Numbers 1991 23 SIGCSEB Haggard, A Project for Data Structures and Algorithms Courses 1991 23 SIGCSEB Lelewer & Ng, An Honors Course in Data Compression 1991 23 SIGCSEB Johnsonbaugh & Kalin, A Graph Generation Software Package 1991 23 SIGCSEB Pesante, Integrating Writing into Computer Science Courses 1991 23 SIGCSEB McKim & Martyn & Brown & Danchak & Farrell & Higginbotham & Ilovici & Matelski & McCartin, An Alternative Culminating Experience for Master's Students in Computer Science 1991 23 SIGCSEB Motil, Begin-BIG: An Approach to the Introductory Computing Course 1991 23 SIGCSEB Skublics & White, Teaching Smalltalk as a First Programming Language 1991 23 SIGCSEB Locklair, The Introductory Computer Science Course 1991 23 SIGCSEB Hill & Wayne, A CYK Approach to Parsing in Parallel: A Case Study 1991 23 SIGCSEB Harlan, Searching in Parallel: A Case Study with the Single-Source Shortest Path Problem 1991 23 SIGCSEB Scragg, Most Computer Organization Courses are Built Upside Down 1990 22 SIGCSEB Comer & Perry & Poucher & Rinewalt & Wileman, Results and Problems from the 1990 ACM Scholastic Programming Contest Finals, Sponsored by AT&T Computer Systems 1990 22 SIGCSEB Sabin, Using CS2 Projects to Introduce Computer Science Concepts 1990 22 SIGCSEB Wildenberg, Using a Stack Assembler Language in a Compiler Course 1990 22 SIGCSEB Meredith, An Effective Lisp Project for a Programming Languages Course 1990 22 SIGCSEB Hvorecky, On a Connection between Programming and Mathematics 1990 22 SIGCSEB Anderson, My Five Favourite First Year Pascal Programs 1990 22 SIGCSEB Gingras, Dining Philosophers Revisited 1990 22 SIGCSEB Silver, A Better Queue Design 1990 22 SIGCSEB Sigle, Dynamic Display of Computing Processes 1990 22 SIGCSEB Feldman, Teaching Data Structures with Ada: An Eight-Year Perspective 1990 22 SIGCSEB Frank & Smith, Ada as a CS1-CS2 Language 1990 22 SIGCSEB Dadamo, The Correlation Quiz: An Aid in Curbing Cheating in Programming Assignments 1990 22 SIGCSEB Henderson, Discrete Mathematics as a Precursor to Programming 1990 22 SIGCSEB Myers, The Central Role of Mathematical Logic in Computer Science 1990 22 SIGCSEB Johnsonbaugh & Miller, Converses of Pumping Lemmas 1990 22 SIGCSEB Pournaghshband, The Students' Problems in Courses with Team Projects 1990 22 SIGCSEB Baldwin, Teaching Introductory Computer Science as the Science of Algorithms 1990 22 SIGCSEB Clancy & Linn, Functional Fun 1990 22 SIGCSEB Pratt, Upgrading CS1: An Alternative to the Proposed COCS Survey Course 1990 22 SIGCSEB Dale, If You Were Lost on a Desert Island, What One ADT Would You Like To Have with You? 1990 22 SIGCSEB Merritt & Nauck, Inventing a New Sorting Algorithm: A Case Study 1990 22 SIGCSEB DePano & Boudreau & Katner & Li, Algorithmic Paradigms: Examples in Computational Geometry II 1990 22 SIGCSEB Jackowitz & Plishka & Sidbury, Teaching Writing and Research Skills in the Computer Science Curriculum 1990 22 SIGCSEB Hartman & White, ``Real World'' Skills vs. ``School Taught'' Skills for the Undergraduate Computer Major 1990 22 SIGCSEB Greenleaf, Computability and Data Types 1990 22 SIGCSEB Dunning & Lancaster, The Millionth Computer Program 1990 22 SIGCSEB Decker & Hirshfield, A Survey Course in Computer Science Using HyperCard 1990 22 SIGCSEB Biermann, An Overview Course in Academic Computer Science: A New Approach for Teaching Nonmajors 1989 21 SIGCSEB Schneider, A Quantitative Evaluation Of Graduate Programs In Computer Science in The United States and Canada 1989 21 SIGCSEB Sanders, Teaching Load and the Quality of Education 1989 21 SIGCSEB Stone, Using Cumulative Graphic Traces in the Visualization of Sorting Algorithms 1989 21 SIGCSEB Schweller & Plagman, Neural Nets and Alphabets: Introducing Students to Neural Networks 1989 21 SIGCSEB Goldenson, The Impact of Structure Editing on Introductory Computer Science Education: The Results So Far 1989 21 SIGCSEB Behforooz & Sharma, A Comprehensive Mathematics Curriculum for the Computer Science Undergraduate Program 1989 21 SIGCSEB Mohr, Using Modula-2 to Teach Data Abstraction 1989 21 SIGCSEB Lessman, Changes and Extensions in the C Family of Languages 1989 21 SIGCSEB Danilowicz, Demonstrating the Dangers of Pseudo-Random Numbers 1989 21 SIGCSEB McCracken, Three ``Lab Assignments'' for an Algorithms Course 1989 21 SIGCSEB Dijkstra, On the Cruelty of Really Teaching Computing Science 1989 21 SIGCSEB Carrasquel & Roberts & Pane, The Design Tree: A Visual Approach to Top-Down Design and Data Flow 1989 21 SIGCSEB Gantenbein, Programming as Process: A ``Novel'' Approach to Teaching Programming 1989 21 SIGCSEB Henderson & Romero, Teaching Recursion as a Problem-Solving Tool Using Standard ML 1989 21 SIGCSEB Hartman, Writing to Learn and Communicate in a Data Structures Course 1989 21 SIGCSEB Werth, Preparing Students for Programming-in-the-Large 1989 21 SIGCSEB Wilson & Greenleaf & Trenary, Algorithms and Software: Integrating Theory and Practice in the Undergraduate Computer Science Curriculum 1989 21 SIGCSEB Kumar & Beidler, Using Generics Modules to Enhance the CS2 Course 1989 21 SIGCSEB Kurtz & Pfeiffer, Developing Programming Quizzes to Support Instruction in Abstract Data Types 1989 21 SIGCSEB Lang & Maruyama, Teaching the Abstract Data Type in CS2 1989 21 SIGCSEB McGlinn & Britt & Woolard, APEX1, A Library of Dynamic Programming Examples 1989 21 SIGCSEB Reek, The TRY System -or- How to Avoid Testing Student Programs 1989 21 SIGCSEB Mynatt & Leventhal, A CASE Primer for Computer Science Educators 1989 21 SIGCSEB Mitchell, What is to Become of Programming? 1989 21 SIGCSEB Gumb, A First Course in Program Verification and the Semantics of Programming Languages 1989 21 SIGCSEB Bagert, A Core Course in Computer Theory: Design and Implementation Issues 1989 21 SIGCSEB Smotherman, Examining Compiled Code 1989 21 SIGCSEB Myers, The New Generation of Computer Literacy 1989 21 SIGCSEB Lambert, A Language-Only Course in LISP with PC Scheme 1989 21 SIGCSEB Sondak & Sondak, Neural Networks and Artificial Intelligence 1989 21 SIGCSEB Wells & Kurtz, Teaching Multiple Programming Paradigms: A Proposal for a Paradigm-General Pseudocode 1989 21 SIGCSEB Luker, Never Mind the Language, What About the Paradigm? 1989 21 SIGCSEB Greenleaf, Algorithms and Proofs: Mathematics in the Computing Curriculum 1989 21 SIGCSEB Marion, Discrete Mathematics for Computer Science Majors--Where Are We? How Do We Proceed? 1988 20 SIGCSEB Lewis, The 15-Pegs Puzzle and the Conceptual Tree 1988 20 SIGCSEB Tabak, Giving Engineers a Positive View of Social Responsibility 1988 20 SIGCSEB Bagert & Cohen & Ford & Friesen & McCracken & Wood, The Increasing Role of Computer Theory in Undergraduate Curricula 1988 20 SIGCSEB Shaffer, Counseling the Computer Science Major 1988 20 SIGCSEB Christiaen, Novice Programming Errors: Misconceptions or Misrepresentations? 1988 20 SIGCSEB Eckert, Microprogrammed versus Hardwired Control Units: How Computers Really Work 1988 20 SIGCSEB Poirot & Taylor & Norris, A Framework for Developing Pre-College Computer Science Retraining Programs 1988 20 SIGCSEB Van Dyke, Binary Jargon: The Metaphoric Language of Computing 1988 20 SIGCSEB Schaller, The Modula-2 Experience 1988 20 SIGCSEB Searls, Teaching Computer Ethics 1988 20 SIGCSEB Joyce, A Unifying Project for CS1 1988 20 SIGCSEB Walters, Computer Science--A Mathematical Science and Accreditation 1988 20 SIGCSEB Foley & Standish, Report of the NSF Undergraduate Computer Science Education Workshop 1988 20 SIGCSEB Denton, Culture Shock: Transferring into the Professional Work Force 1988 20 SIGCSEB Piotrowski, The Small Computer Assisted Lecturing System 1988 20 SIGCSEB Price & Archer & Moressi, A Successful Approach to the Computer Literacy Course 1988 20 SIGCSEB Sanders, Computer Science Homework and Grading Practices: An Alternative to the Popular Model 1988 20 SIGCSEB Quirk, Teaching Computer Networks as a Writing Intensive Course 1988 20 SIGCSEB Dooley, An Artificial Intelligence Course in a Liberal Arts Program 1988 20 SIGCSEB Sellars, Why a College Course in Computer Literacy? 1988 20 SIGCSEB Reges & McGrory & Smith, The Effective Use of Undergraduates to Staff large Introductory CS Courses 1988 20 SIGCSEB Denning & Comer & Gries & Mulder & Tucker & Turner & Young, Computing as a Discipline, Preliminary Report, ACM Task Force on the Core of Computer Science 1988 20 SIGCSEB Warford, Introductory Computer Science: The Case for a Unified View 1988 20 SIGCSEB Koffman, The Case for Modula-2 in CS1 and CS2 1988 20 SIGCSEB Whitson, An Introduction to the Parallel Distributed Processing Model of Cognition and Some Examples of How it is Changing the Teaching of Artificial Intelligence 1988 20 SIGCSEB Finkel & Haggard, Program Complexity: A Tutorial 1988 20 SIGCSEB Chua & Winton, Undergraduate Theory of Computation: An Approach Using Simulation Tools 1988 20 SIGCSEB De Pano, Algorithmic Paradigms: Examples in Computational Geometry 1988 20 SIGCSEB Bradley, The Role of Mathematics in the Computer Science Curriculum 1988 20 SIGCSEB Pattis, Textbook Errors in Binary Searching 1988 20 SIGCSEB Kurtz & Adams, Using Concept Expansion and Level Integration in an Introductory Computer Science Course 1988 20 SIGCSEB Pratt, Teaching Programming: A New Approach Based on Analysis Skills 1988 20 SIGCSEB Wiedenbeck, Learning Recursion As a Concept and As a Programming Technique 1988 20 SIGCSEB Bagert, Should Computer Science Examinations Contain ``Programming'' Problems? 1987 19 SIGCSEB Ashbacher, Two Undergraduate Courses in the Theory of Computation 1987 19 SIGCSEB Ferchichi & Jaoua, Teaching First Year Programming: A Proposal 1987 19 SIGCSEB Wirth, Extension of Record Types 1987 19 SIGCSEB Thompson, On Constructing Karnaugh Maps 1987 19 SIGCSEB Baird, Tailoring UNIX for Introductory CS Courses 1987 19 SIGCSEB Scrugg, A Crisis in Computer Science Education at Liberal Arts Colleges 1987 19 SIGCSEB Distad & Gatterdam, A Problem in Counting Digits 1987 19 SIGCSEB Bell & Scott, A First Course in Programming 1987 19 SIGCSEB Seilheimer, Teaching All Essential Elements in a One Semester Database Course 1987 19 SIGCSEB Cote, Teaching Oral Communication in Computer Science 1987 19 SIGCSEB Pattis, Abstraction in Pascal: Data and Control 1987 19 SIGCSEB Pugh & LaLonde & Thomas, Introducing Object-Oriented Programming into the Computer Science Curriculum 1987 19 SIGCSEB Liss & McMillan, Fractals with Turtle Graphics: A CS2 Programming Exercise for Introducing Recursion 1987 19 SIGCSEB Henderson, Modern Introductory Computer Science 1987 19 SIGCSEB Shub, The Decline and Fall of Operating Systems I 1987 19 SIGCSEB Joel, Realistic Student Projects 1987 19 SIGCSEB Owen, Using Ada on Microcomputers in the Undergraduate Curriculum 1987 19 SIGCSEB Hagelgans, A Computer Science/Mathematics Major for Liberal Arts Colleges 1987 19 SIGCSEB Tharp, Let's Motivate! 1987 19 SIGCSEB Parker & Schneider, Problems With and Proposals For Service Courses in Computer Science 1987 19 SIGCSEB Dyck & Black & Fenton, Beyond Traditional Computer Literacy 1986 18 SIGCSEB Abshire, The Skills Needed to Teach Computer-Science Courses 1986 18 SIGCSEB Taffe, Teaching Computer Science Through Writing 1986 18 SIGCSEB Kerstetter, A KWIC Permuted List of Articles in the SIGCSE Bulletin 1985 1986 18 SIGCSEB Schneider, A Proposed Redesign of the Introductory Service Course in Computer Science 1986 18 SIGCSEB Ourusoff, The Computational View of Nature: A Liberal Arts Course in Computer Science 1986 18 SIGCSEB Moffat, Teaching a Modern Data Structures Course 1985 17 SIGCSEB Carrasquel, Competency Testing in Introductory Computer Science: The Mastery Examination at Carnegie-Mellon University 1984 16 SIGCSEB Fischer, Computer Literacy Scope and Sequence Models: A Critical Review of Two Approaches 1984 16 SIGCSEB McCracken, A Skeptical View of Computer Literacy 1984 16 SIGCSEB Heuring, The Teaching of Assembly Language to Computer Science and Computer Engineering Majors 1983 15 SIGCSEB Barker & Unger, A Predictor for Success in an Introductory Programming Class Based upon Abstract Reasoning Development 1983 15 SIGCSEB D'heedene, Invitation to Artificial Intelligence 1983 15 SIGCSEB Brown & Meyrowitz & van Dam, Personal Computer Networks and Graphical Animation: Rationale and Practice for Education 1995 29 SIGGRAPHB Horton, Top Ten Blunders by Visual Designers 1995 29 SIGGRAPHB Overmars, Teaching Computational Geometry 1991 25 SIGGRAPHB Carlson, A Survey of Computer Graphics Image Encoding and Storage Formats 1989 23 SIGGRAPHB Miya, Obtaining Machine Readable Computer Graphics Bibliographies 1987 21 SIGGRAPHB O'Rourke, Computational Geometry Column #3 1990 SIGMODIC Lipton & Naughton & Schneider, Practical Selectivity Estimation through Adaptive Sampling 1990 SIGMODIC Ullman & Yannakakis, The Input/Output Complexity of Transitive Closure 1990 SIGMODIC Salzberg & Tsukerman & Gray & Stewart & Uren & Vaughan, FastSort: A Distributed Single-Input Single-Output External Sort 1990 SIGMODIC Breitbart & Silberschatz & Thompson, Reliable Transaction Management in a Multidatabase System 1990 SIGMODIC Ioannidis & Kang, Randomized Algorithms for Optimizing Large Join Queries 1990 SIGMODIC Beckmann & Kriegel & Schneider & Seeger, The R*-tree: An Efficient and Robust Access Method for Points and Rectangles 1990 SIGMODIC Jagadish, Linear Clustering of Objects with Multiple Attributes 1990 SIGMODIC Orenstein, A Comparison of Spatial Query Processing Techniques for Native and Parameter Spaces 1990 SIGMODIC Lomet & Salzberg, The Performance of a Multiversion Access Method 1990 SIGMODIC Olken & Rotem & Xu, Random Sampling from Hash Files 1988 SIGMODIC Kim & Pramanik, Optimal File Distribution for Partial Match Retrieval 1988 SIGMODIC Ramakrishna, Hashing in Practice: Analysis of Hashing and Universal Hashing 1986 SIGMODIC Willard, Good Worst-Case Algorithms for Inserting and Deleting Records in Dense Sequential Files 1996 25 SIGMODREC Zobel & Moffat & Ramamohanarao, Guidelines for Presentation and Comparison of Indexing Techniques 1996 25 SIGMODREC Norman & Zurek & Thanisch, Much Ado About Shared-Nothing 1996 25 SIGMODREC Tsotras & Kumar, Temporal Database Bibliography Update 1996 25 SIGMODREC Silberschatz & Stonebraker & Ullman, Database Research: Achievements and Opportunities into the 21st Century 1995 24 SIGMODREC Ulosoy, An Annotated Bibliography on Real-Time Database Systems 1995 24 SIGMODREC Maelbrancke & Olivie, Optimizing Jan Jannink's Implementation of B+-tree Deletion 1995 24 SIGMODREC Jannink, Implementing Deletion in B+-Trees 1993 22 SIGMODREC Kline, An Update of the Temporal Database Bibliography 1993 22 SIGMODREC Buff, Remarks on Two New Theorems of Date and Fagin 1993 22 SIGMODREC Date & Fagin, Response to ``Remarks on Two New Theorems of Date and Fagin'' 1993 22 SIGMODREC Al-Taha & Snodgrass & Soo, Bibliography on Spatiotemporal Databases 1991 20 SIGMODREC Salzberg & Lomet, Spatial Database Access Methods 1991 20 SIGMODREC Soo, Bibliography on Temporal Databases 1991 20 SIGMODREC Vossen, Bibliography on Object-Oriented Database Management 1986 15 SIGMODREC Proceedings of SIGMOD '86, International Conference on Management of Data 1995 30 SIGNUMN Branham, Algorithms for Julian Dates 1992 27 SIGNUMN Carroll, The Role of Computer Software in Numerical Analysis Teaching 1996 3 SIGSAC Samar, Unified Login with Pluggable Authentication Modules (PAM) 1996 3 SIGSAC Wiegel, Secure External References in Multimedia Email Messages 1996 3 SIGSAC Chuang, Securing ATM Networks 1996 3 SIGSAC Steiner & Tsudik & Waidner, Diffie-Hellman Key Distribution Extended to Group Communication 1996 3 SIGSAC Reiter & Franklin & Lacy & Wright, The Omega Key Management Service 1996 3 SIGSAC Mambo & Usuda & Okamoto, Proxy Signatures for Delegating Signing Operation 1996 3 SIGSAC M'Raihi & Naccache, Batch Exponentiation -- A Fast DLP-based Signature Generation Strategy 1996 3 SIGSAC Lau & Lam & Cheung, The Failure of Anti-Hacking Legislation: a Hong Kong Perspective 1996 3 SIGSAC Matsumoto, Human-Computer Cryptography: An Attempt 1996 3 SIGSAC Jakobsson & Yung, Revokable and Versatile Electronic Money (Extended Abstract) 1996 3 SIGSAC Camenisch & Piveteau & Stadler, An Efficient Fair Payment System 1996 3 SIGSAC Stubblebine & Wright, An Authentication Logic Supporting Synchronization, Revocation, and Recency 1996 3 SIGSAC Bolignano, An Approach to the Formal Verification of Cryptographic Protocols 1996 3 SIGSAC Ray & Bertino & Jajodia & Mancini, An Advanced Commit Protocol for MLS Distributed Database Systems 1996 3 SIGSAC Goldschlag, Several Secure Store and Forward Devices 1996 3 SIGSAC Vaudenay, An Experiment on DES Statistical Cryptanalysis 1996 3 SIGSAC Michels & Petersen & Horster, Breaking and Repairing a Convertible Undeniable Signature Scheme 1996 3 SIGSAC Sun & Shieh, Cryptanalysis of Private-Key Encryption Schemes Based on Burst-Error-Correcting Codes 1996 3 SIGSAC Naor & Wool, Access Control and Signatures via Quorum Secret Sharing 1996 3 SIGSAC Bertino & Jajodia & Samarati, A Non-Timestamped Authorization Model for Data Management Systems 1993 27 SIGSAMB Kaltofen, Direct Proof of a Theorem by Kalkbrener, Sweedler, and Taylor 1993 27 SIGSAMB Baker, Sparse Polynomials and Linear Logic 1993 27 SIGSAMB Landau, Finding Maximal Subfields 1993 27 SIGSAMB Beutelspacher & Ueberberg, Symbolic Incidence Geometry Proposal for Doing Geometry with a Computer (Part 2 of 2) 1993 27 SIGSAMB Shallit & Sorenson, A Binary Algorithm for the Jacobi System 1992 26 SIGSAMB Abdali & Cherry & Soiffer, Spreadsheet Computations in Computer Algebra 1992 26 SIGSAMB Sasaki & Sasaki, An Integer-to-Rational Conversion Algorithm 1992 26 SIGSAMB von zur Gathen, A Polynomial Factorization Challenge 1991 25 SIGSAMB Buchanan, Some Theoretical Problems When Solving Systems of Polynomial Equations Using Grobner Bases 1990 24 SIGSAMB Buchberger, Should Students Learn Integration Rules? 1988 22 SIGSAMB Gregory & Kaltofen, Analysis of the Binary Complexity of Asymptotically Fast Algorithms for Linear System Solving 1987 21 SIGSAMB Kapur & Narendran, Matching, Unification and Complexity 1987 21 SIGSAMB Ponder, Applications of Hashing in Algebraic Manipulation (an Annotated Bibliography) 1996 21 SIGSMALL Crow, The MS-DOS Memory Environment 1995 21 SIGSMALL Mengel, K12 and the Web 1995 21 SIGSMALL Bouvier, The State of HTML 1995 21 SIGSMALL Warkentin & Sayeed, Establishing a Web Site: Some Managerial Issues 1995 21 SIGSMALL Berghel, The Inevitable Demise of the Web 1995 21 SIGSMALL McKenna, Surfin on the Net 1991 17 SIGSMALL Varney, Adequacy of Checksum Algorithms for Computer Virus Detection 1990 20 SIGUCCS Gedney, Understanding E-Mail Addresses 1987 8 SIJADM Lewandowski & Liu, SS/TDMA Satellite Communications with k-Permutation Switching Modes 1987 8 SIJADM Corneil & Keil, A Dynamic Programming Approach to the Dominating Set Problem on k-Trees 1987 8 SIJADM Kilby & Sloane, On the Covering Radius Problem for Codes I. Bounds on Normalized Covering Radius 1987 8 SIJADM Kilby & Sloane, On the Covering Radius Problem for Codes II. Codes of Low Dimension; Normal and Abnormal Codes 1987 8 SIJADM Lingas, A New Heuristic for Minimum Weight Triangulation 1987 8 SIJADM Cozzens & Wu, On Minimum Critically n-Edge-Connected Graphs 1987 8 SIJADM Wendel, The General Minimum Fill-In Problem 1987 8 SIJADM Matthews, Mixing Rates for a Random Walk on the Cube 1987 8 SIJADM Du & Ko, Some Completeness Results on Decision Trees and Group Testing 1987 8 SIJADM Liu, An Application of Generalized Tree Pebbling to Sparse Matrix Factorization 1987 8 SIJADM Colbourn, Network Resilience 1987 8 SIJADM Ehrenfeucht & Haemer & Haussler, Quasi-Monotonic Sequences: Theory, Algorithms and Applications 1987 8 SIJADM Haddad & Roy & Schaffer, On Gossiping with Faulty Telephone Lines 1987 8 SIJADM Gilbert & Heath, Computing a Sparse Basis for the Null Space 1987 8 SIJADM Chung & Leighton & Rosenberg, Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design 1987 8 SIJADM Buchta, On the Number of Vertices of Random Polyhedra with a Given Number of Facets 1986 7 SIJADM Monien, The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete 1986 7 SIJADM Coleman & Pothen, The Null Space Problem I. Complexity 1986 7 SIJADM Korner, Fredman-Komlos Bounds and Information Theory 1986 7 SIJADM Mitchison & Durbin, Optimal Numberings of an N x N Array 1986 7 SIJADM Griggs & Hanlon & Waterman, Sequence Alignments with Matched Sections 1986 7 SIJADM Buck, Expanders and Diffusers 1986 7 SIJADM Coleman & Cai, The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices 1986 7 SIJADM Hochbaum & Shmoys, A Packing Problem You Can Almost Solve by Sitting on Your Suitcase 1986 7 SIJADM Linial, Hard Enumeration Problems in Geometry and Combinatorics 1985 6 SIJADM Kirkpatrick & Klawe & Pippenger, Some Graph-Colouring Theorems with Applications to Generalized Connection Networks 1985 6 SIJADM Dolev & Warmuth, Profile Scheduling of Opposing Forests and Level Orders 1985 6 SIJADM Hochbaum & Shmoys, An O(||V||^2) Algorithm for the Planar 3-Cut Problem 1985 6 SIJADM Alon & Tarsi, Covering Multigraphs by Simple Circuits 1985 6 SIJADM Homer & Goldman, Doubly-Periodic Sequences and Two-Dimensional Recurrences 1985 6 SIJADM Bagchi & Pal, Asymptotic Normality in the Generalized Polya-Eggenberger Urn Model, with an Application to Computer Data Structures 1985 6 SIJADM Makedon & Papadimitriou & Sudborough, Topological Bandwidth 1985 6 SIJADM Tchuente, Permutation Factorization on Star-Connected Networks of Binary Automata 1985 6 SIJADM Zemel, Probabilistic Analysis of Geometric Location Problems 1985 6 SIJADM Chung, On the Cutwidth and the Topological Bandwidth of a Tree 1985 6 SIJADM Peskin & Richman, A Method to Compute Minimal Polynomials 1985 6 SIJADM Robertson & Seymour, Disjoint Paths--A Survey 1985 6 SIJADM Helman & Rosenthal, A Comprehensive Model of Dynamic Programming 1985 6 SIJADM Ciancutti, On Discrete Search for a Multiple Number of Objects 1985 6 SIJADM Goldman, Polya's Urn Model and Computer Aided Geometric Design 1985 6 SIJADM Walter, Complexity and Stability in Compartmental Models 1985 6 SIJADM Plumstead & Plumstead, Bounds for Cube Coloring 1985 6 SIJADM Kano & Sakamoto, Ranking the Vertices of a Paired Comparison Digraph 1985 6 SIJADM Goldberg & West, Bisection of Circle Colorings 1985 6 SIJADM Chang & Nemhauser, Covering, Packing and Generalized Perfection 1985 6 SIJADM Abello, Intrinsic Limitations of the Majority Rule, An Algorithmic Approach 1985 6 SIJADM Randic, On the Characteristic Equations of the Characteristic Polynomial 1985 6 SIJADM Hwang & Sun & Yao, Optimal Set Partitioning 1985 6 SIJADM Tarjan, Amortized Computational Complexity 1985 6 SIJADM Chung & Tarjan & Paul & Reischuk, Coding Strings by Pairs of Strings 1992 52 SIJAM Pevzner, Multiple Alignment, Communication Cost, and Graph Matching 1990 50 SIJAM Trietsch & Hwang, An Improved Algorithm for Steiner Trees 1989 49 SIJAM Friedel & Widmayer, A Simple Proof of the Steiner Ratio Conjecture for Five Points 1988 48 SIJAM Carrillo & Lipman, The Multiple Sequence Alignment Problem in Biology 1979 36 SIJAM Lipton & Tarjan, A Separator Theorem for Planar Graphs 1978 35 SIJAM Guibas & Odlyzko, Maximal Prefix-Synchronized Codes 1978 35 SIJAM Nussinov & Pieczenik & Griggs & Kleitman, Algorithms for Loop Matchings 1971 20 SIJAM Hopcroft & Kerr, On Minimizing the Number of Multiplications Necessary for Matrix Multiplication 1996 34 SIJCO Chernorutskii & Izmailov & Pokrovskii, Superior Information Is Insufficient to Win in Games Between Finite Automata 1995 33 SIJCO Alpern, The Rendezvous Search Problem 1994 32 SIJCO Thistle & Wonham, Control of Infinite Behavior of Finite Automata 1994 32 SIJCO Baston & Bostock, An Evasion Game with an Infinite Number of States 1994 32 SIJCO Philpott, Continuous-Time Shortest Path Problems and Linear Programming 1992 30 SIJCO Hassin & Tamir, Minimal Length Curves That Are Not Embeddable in an Open Planar Set: The Problem of a Lost Swimmer with a Compass 1990 28 SIJCO Aubin, Differential Games: A Viability Approach 1988 26 SIJCO Tzuu-Shuh & Yunshyong, On the Convergence Rate of Annealing Processes 1997 10 SIJDM Urbaniak & Weismantel & Ziegler, A Variant of the buchberger Algorithm for Integer Programming 1997 10 SIJDM Frank & Karzanov & Sebo, On Integer Multiflow Maximization 1996 9 SIJDM Shen & Lombardi, Graph Algorithms for Conformance Testing Using the Rural Chinese Postman Tour 1996 9 SIJDM Murota, Valuated Matroid Intersection I: Optimality Criteria 1996 9 SIJDM Murota, Valuated Matroid Intersection II: Algorithms 1996 9 SIJDM Proskurowski & Syslo & Winter, Plane Embeddings of 2-Trees and Biconnected Partial 2-Trees 1996 9 SIJDM Chopra & Rinaldi, The Graphical Asymmetric Traveling Salesman Polyhedron: Symmetric Inequalities 1996 9 SIJDM Wang & Savage, A Gray Code for Necklaces of Fixed Density 1996 9 SIJDM Di Battista & Vismara, Angles of Planar Triangular Graphs 1996 9 SIJDM Golic, Constrained Embedding Probability for Two Binary Strings 1996 9 SIJDM Boyd, On the Complexity of a Cutting Plane Algorithm for Solving Combinatorial Linear Programs 1996 9 SIJDM Brown & Colbourn & Wagner, Cohen-Macaulay Rings in Network Reliability 1996 9 SIJDM Cohen & Litsyn & Vardy & Zemor, Tilings of Binary Spaces 1996 9 SIJDM Etzion, Nonequivalent q-ary Perfect Codes 1996 9 SIJDM Bierbrauer & Gopalakrishnan & Stinson, Orthogonal Arrays, Resilient Functions, Error-Correcting Codes, and Linear Programming Bounds 1996 9 SIJDM Connelly & Whiteley, Second-Order Rigidity and Prestress Stability for Tensegrity Frameworks 1996 9 SIJDM Goldschmidt & Hochbaum & Hurkens & Yu, Approximation Algorithms for the k-Clique Covering Problem 1996 9 SIJDM Manacher & Mankus, Finding a Domatic Partition of an Interval Graph in Time O(n) 1996 9 SIJDM Coppersmith & Phillips, On a Question of Erdos on Subsequence Sums 1996 9 SIJDM Ravi & Sundaram & Marathe & Rosenkrantz & Ravi, Spanning Trees--Short or Small 1996 9 SIJDM Etzion, On the Nonexistence of Perfect Codes in the Johnson Scheme 1996 9 SIJDM Hoffmann & Kriegel, A Graph-Coloring Result and its Consequences for Polygon-Guarding Problems 1996 9 SIJDM Aichholzer & Aurenhammer, Classifying Hyperplanes in Hypercubes 1996 9 SIJDM Grotschel & Martin & Weismantel, Packing Steiner Trees: Separation Algorithms 1996 9 SIJDM Mayoraz, On the Power of Democratic Networks 1996 9 SIJDM Albertson & Haas, Bounding Functions and Rigid Graphs 1996 9 SIJDM Bhattacharya & Hell & Huang, A Linear Algorithm for Maximum Weight Cliques in Proper Circular Arc Graphs 1996 9 SIJDM Brown & Nowakowski & Rall, The Ultimate Categorical Independence Ratio of a Graph 1996 9 SIJDM Coppersmith & Feige & Shearer, Random Walks on Regular and Irregular Graphs 1996 9 SIJDM Chang & Kuo, The L(2,1)-Labeling Problem on Graphs 1996 9 SIJDM Arikati & Maheshwari, Realizing Degree Sequences in Parallel 1996 9 SIJDM Kratzke & West, The Total Interval Number of a Graph II: Trees and Complexity 1996 9 SIJDM Faigle & Hoffman & Kern, A Characterization of Nonnegative Box-Greedy Matrices 1996 9 SIJDM Diks & Pelc, Efficient Gossiping by Packets in Networks With Random Faults 1996 9 SIJDM Barnes & Feige, Short Random Walks on Graphs 1996 9 SIJDM Boppana & Narayanan, The Biased Coin Problem 1996 9 SIJDM Heydemann & Peters & Sotteau, Spanners of Hypercube-Derived Networks 1996 9 SIJDM Tsai, Lower Bounds on Representing Boolean Functions as Polynomials in Z_m 1996 9 SIJDM Haglin & Wolf, On Convex Subsets in Tournaments 1996 9 SIJDM Iwata & Murota, Horizontal Principal Structure of Layered Mixed Matrices: Decomposition of Discrete Systems by Design-Variable Selections 1996 9 SIJDM Kao, Data Security Equals Graph Connectivity 1996 9 SIJDM Sanders, On Linear Recognition of Tree-Width At Most Four 1996 9 SIJDM Eriksson, Chip-Firing Games on Mutating Graphs 1996 9 SIJDM Aleksandrov & Djidjev, Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus 1996 9 SIJDM Alspach & Liu & Zhang, Nowhere-Zero 4-Flows and Cayley Graphs on Solvable Groups 1996 9 SIJDM Luby & Naor & Orda, Tight Bounds for Dynamic Storage Allocation 1995 8 SIJDM Kierstead & Penrice & Trotter, On-Line and First-Fit Coloring of Graphs That Do Not Induce P_5 1995 8 SIJDM Whittlesey & Georges & Mauro, On the lambda-Number of Q_n and Related Graphs 1995 8 SIJDM McMorris & Powers, The Median Procedure in a Formal Theory of Consensus 1995 8 SIJDM Bandelt & Steel, Symmetric Matrices Representable by Weighted Trees Over a Cancellative Abelian Monoid 1995 8 SIJDM Althofer & Leader, Correlation of Boolean Functions and Pathology in Recursion Trees 1995 8 SIJDM Newman & Wigderson, Lower Bounds on Formula Size of Boolean Functions Using Hypergraph Entropy 1995 8 SIJDM Greenberg & Shih, Feasible Offset and Optimal Offset for General Single-Layer Channel Routing 1995 8 SIJDM Ashley & Marcus, Canonical Encoders for Sliding Block Decoders 1995 8 SIJDM Bodlaender & Kloks & Kratsch, Treewidth and Pathwidth of Permutation Graphs 1995 8 SIJDM Bhatt & Chung & Leighton & Rosenberg, Salvage-Embeddings of Complete Trees 1995 8 SIJDM Klawe & Mumey, Upper and Lower Bounds on Constructing Alphabetic Binary Trees 1995 8 SIJDM Jevtic, On Families of Sets of Integral Vectors Whose Representatives Form Sum-Distinct Sets 1995 8 SIJDM Krishnamurti & Narahari, An Approximation Algorithm for Preemptive Scheduling on Parallel-Task Systems 1995 8 SIJDM Bokowski & Schuchert, Altshuler's Sphere M^9_963 Revisited 1995 8 SIJDM Snyder & Steele, Equidistribution in All Dimensions of Worst-Case Point Sets for the Traveling Salesman Problem 1995 8 SIJDM Cai & Corneil, Tree Spanners 1995 8 SIJDM Franzblau, Combinatorial Algorithm for a Lower Bound on Frame Rigidity 1995 8 SIJDM Kortsarz & Peleg, Approximation Algorithms for Minimum-Time Broadcast 1995 8 SIJDM Alonso & Reingold & Schott, Multidimensional Divide-and-Conquer Maximin Recurrences 1995 8 SIJDM Jamison & Olariu, P-Components and the Homogeneous Decomposition of Graphs 1995 8 SIJDM Pitassi & Urquhart, The Complexity of the Hajos Calculus 1995 8 SIJDM Fraughnaugh & Lundgren & Merz & Maybee & Pullman, Competition Graphs of Strongly Connected and Hamiltonian Digraphs 1995 8 SIJDM Gonzalez & Landaeta, A Competitive Strong Spanning Tree Algorithm for the Maximum Bipartite Matching Problem 1995 8 SIJDM Hamalainen & Honkala & Litsyn & Ostergard, Bounds for Binary Codes That Are Multiple Coverings of the Farthest-Off Points 1995 8 SIJDM Schmidt & Siegel & Srinivasan, Chernoff-Hoeffding Bounds for Applications with Limited Independence 1995 8 SIJDM Spinrad, Nonredundant 1's in Gamma-Free Matrices 1995 8 SIJDM Yeap & Sarrafzadeh, Sliceable Floorplanning by Graph Dualization 1995 8 SIJDM Knuth, Two-Way Rounding 1995 8 SIJDM Pippenger, Analysis of a Recurrence Arising from a Construction for Nonblocking Networks 1995 8 SIJDM Andreae & Bandelt, Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle Inequalities 1995 8 SIJDM Karchmer & Kushilevitz & Nisan, Fractional Covers and Communication Complexity 1995 8 SIJDM Kushilevitz & Mansour & Rabin, On Lotteries with Unique Winners 1995 8 SIJDM Lin & Skiena, Algorithms for Square Roots of Graphs 1995 8 SIJDM Lovasz & Naor & Newman & Wigderson, Search Problems in the Decision Tree Model 1994 7 SIJDM Boros & Hammer & Hooker, Predicting Cause-Effect Relationships from Incomplete Discrete Observations 1994 7 SIJDM Dankelmann & Niessen & Schiermeyer, On Path-Tough Graphs 1994 7 SIJDM van der Veen, A New Class of Pyramidally Solvable Symmetric Traveling Salesman Problems 1994 7 SIJDM Zitnik, Drawing Graphs on Surfaces 1994 7 SIJDM Raychaudhuri, Further Results on T-Coloring and Frequency Assignment Problems 1994 7 SIJDM Chen, A Linear-Time Algorithm for Isomorphism of Graphs of Bounded Average Genus 1994 7 SIJDM Kao & Furer & He & Raghavachari, Optimal Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs 1994 7 SIJDM Goemans & Williamson, New 3/4-Approximation Algorithms for the Maximum Satisfiability Problem 1994 7 SIJDM Desmedt & Frankel, Homomorphic Zero-Knowledge Threshold Schemes over Any Finite Abelian Group 1994 7 SIJDM Hartvigsen & Mardon, The All-Pairs Min Cut Problem and the Minimum Cycle Basis Problem on Planar Graphs 1994 7 SIJDM Chung & Faber & Manteuffel, An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with Its Laplacian 1994 7 SIJDM Lynch, Random Resource Allocation Graphs and the Probability of Deadlock 1994 7 SIJDM Chung & Goddard & Kleitman, Even Cycles in Directed Graphs 1994 7 SIJDM Hastad, On the Size of Weights for Threshold Gates 1994 7 SIJDM Alon & Chung & Graham, Routing Permutations on Graphs Via Matchings 1994 7 SIJDM Sen & Sanyal, Indifference Digraphs: A Generalization of Indifference Graphs and Semiorders 1994 7 SIJDM Zhang, Some New Bounds on Single-Change Covering Designs 1994 7 SIJDM Malitz & Papakostas, On the Angular Resolution of Planar Graphs 1994 7 SIJDM Alon & Seymour & Thomas, Planar Separators 1994 7 SIJDM Constantine & Savits, A Stochastic Process Interpretation of Partition Identities 1994 7 SIJDM Fan & Haggkvist, The Square of a Hamiltonian Cycle 1994 7 SIJDM Sprague, An O(n log n) Algorithm for Bandwidth of Interval Graphs 1994 7 SIJDM Grone & Merris, The Laplacian Spectrum of a Graph II 1994 7 SIJDM Leighton, A 2d-1 Lower Bound for Two-Layer Knock-Knee Channel Routing 1994 7 SIJDM Carlet, The Divisors of x^{2^m} + x of Constant Derivatives and Degree 2^{m-2} 1994 7 SIJDM Chopra, The k-Edge-Connected Spanning Subgraph Polyhedron 1994 7 SIJDM Koller & Megiddo, Constructing Small Sample Spaces Satisfying Given Constraints 1994 7 SIJDM Kohli & Krishnamurti & Mirchandani, The Minimum Satisfiability Problem 1994 7 SIJDM Siu & Roychowdhury, An Optimal Depth threshold Circuits for Multiplication and Related Problems 1994 7 SIJDM Ageev, On Finding Critical Independent and Vertex Sets 1994 7 SIJDM McMorris & Warnow & Wimer, Triangulating Vertex-Colored Graphs 1994 7 SIJDM Poljak & Tuza, Bipartite Subgraphs of Triangle-Free Graphs 1994 7 SIJDM Gao & Steele, Sums of Squares of Edge Lengths and Spacefilling Curve Heuristics for the Traveling Salesman Problem 1994 7 SIJDM Babai & Oral & Phelps, Eulerian Self-Dual Codes 1994 7 SIJDM Szwarcfiter & Bornstein, Clique Graphs of Chordal and Path Graphs 1994 7 SIJDM Alon & Bruck, Explicit Constructions of Depth-2 Majority Circuits for Comparison and Addition 1994 7 SIJDM Felsner & Habib & Mohring, On the Interplay between Interval Dimension and Dimension 1994 7 SIJDM Fellows & Fricke & Hedetniemi & Jacobs, The Private Neighbor Cube 1994 7 SIJDM Hsu & Jia, Extremal Problems in the Construction of Distributed Loop Networks 1994 7 SIJDM Kierstead & Penrice & Trotter, On-Line Coloring and Recursive Graph Theory 1994 7 SIJDM Mitchell & Walker & Wild, The Combinatorics of Perfect Authentication Schemes 1994 7 SIJDM Pippenger & Lin, Fault-Tolerant Circuit-Switching Networks 1994 7 SIJDM Chlebus & Diks & Pelc, Sorting on a Mesh-Connected Computer with Delaying Links 1994 7 SIJDM Yen, A Note on Multiset Permutations 1993 6 SIJDM Dahlhaus, Fast Parallel Recognition of Ultrametrics and Tree Metrics 1993 6 SIJDM Hwang & Rothblum & Shepp, Monotone Optimal Multipartitions Using Schur Convexity with Respect to Partial Orders 1993 6 SIJDM Orlitsky, Interactive Communication of Balanced Distributions and of Correlated Files 1993 6 SIJDM Ueno & Bagchi & Hakimi & Schmeichel, On Minimum Fault-Tolerant Networks 1993 6 SIJDM Woeginger, Improved Space for Bounded-Space, On-Line Bin-Packing 1993 6 SIJDM Ashley & Marcus & Perrin & Tuncel, Surjective Extensions of Sliding-Block Codes 1993 6 SIJDM Boyd & Hao, An Integer Polytope Related to the Design of Survivable Communication Networks 1993 6 SIJDM de Werra & Mahadev & Peled, Edge-Chromatic Scheduling with Simultaneity Constraints 1993 6 SIJDM Obrenic, Embedding de Bruijn and Shuffle-Exchange Graphs in Five Pages 1993 6 SIJDM Tang & Arden, Representations of Borel Cayley Graphs 1993 6 SIJDM Goles & Martinez, Errata: Lyapunov Functionals for Automata Networks Defined by Cyclically Monotone Functions 1993 6 SIJDM Cai, Counting Embeddings of Planar Graphs Using DFS Trees 1993 6 SIJDM Coppersmith & Tetali & Winkler, Collisions among Random Walks on a Graph 1993 6 SIJDM Horton & Kilakos, Minimum Edge Dominating Sets 1993 6 SIJDM Saad, Complexity of the Forwarding Index Problem 1993 6 SIJDM Zhang, Parity Subgraph, Shortest Cycle Cover, and Postman Tour 1993 6 SIJDM Feigenbaum & Kahn & Lund, Complexity Results for POMSET Languages 1993 6 SIJDM Goldberg & Spencer, An Efficient Parallel Algorithm That Finds Independent Sets of Guaranteed Size 1993 6 SIJDM Kao & Gusfield, Efficient Detection and Protection of Information in Cross Tabulated Tables I: Linear Invariant Test 1993 6 SIJDM Khuller & Naor & Klein, The Lattice Structure of Flow in Planar Graphs 1993 6 SIJDM Torocsik, n+1 Segments Beat n 1993 6 SIJDM Vince, Replicating Tessellations 1993 6 SIJDM Rais & Jacquet & Szpankowski, Limiting Distribution for the Depth in Patricia Tries 1993 6 SIJDM Brightwell & Scheinerman, Representations of Planar Graphs 1993 6 SIJDM Brightwell & Trotter, The Order Dimension of Convex Polytopes 1993 6 SIJDM Gritzmann & Sturmfels, Minkowski Addition of Polytopes: Computational Complexity and Applications to Grobner Bases 1993 6 SIJDM Gutin, Finding a Longest Path in a Complete Multipartite Digraph 1993 6 SIJDM Helman & Moret & Shapiro, An Exact Characterization of Greedy Structures 1993 6 SIJDM Idury & Schaffer, Triangulating Three-Colored Graphs 1993 6 SIJDM Jedwab, Barker Arrays I: Even Number of Elements 1993 6 SIJDM Jedwab & Lloyd & Mowbray, Barker Arrays II: Odd Number of Elements 1993 6 SIJDM Calderbank & Delsarte, On Error-Correcting Codes and Invariant Linear Forms 1993 6 SIJDM Chang & Farber & Tuza, Algorithmic Aspects of Neighborhood Numbers 1993 6 SIJDM Machi & Mignosi, Garden of Eden Configurations for Cellular Automata on Cayley Graphs of Groups 1993 6 SIJDM McCormick & Chang, The Weighted Sparsity Problem: Complexity and Algorithms 1993 6 SIJDM Chung & Tetali, Communication Complexity and Quasi Randomness 1993 6 SIJDM Gordon, Discrete Logarithms in GF(P) Using the Number Field Sieve 1992 5 SIJDM Kalyanasundaram & Schnitger, The Probabilistic Communication Complexity of Set Intersection 1992 5 SIJDM Klawe & Leighton, A Tight Lower Bound on the Size of Planar Permutation Networks 1992 5 SIJDM Kanan & Naor & Rudich, Implicit Representation of Graphs 1992 5 SIJDM Diks & Pelc, Almost Safe Gossiping in Bounded Degree Networks 1992 5 SIJDM Ronyai, Galois Groups and Factoring Polynomials Over Finite Fields 1992 5 SIJDM Bang-Jensen & Thomassen, A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs 1992 5 SIJDM Benjamin & Juhnke, Another Way of Counting N^N 1992 5 SIJDM Heath & Leighton & Rosenberg, Comparing Queues and Stacks as Mechanisms for Laying Out Graphs 1992 5 SIJDM Knuth & Raghunathan, The Problem of Compatible Representatives 1992 5 SIJDM Sleator & Tarjan & Thurston, Short Encodings of Evolving Structures 1992 5 SIJDM Awerbuch & Peleg, Routing with Polynomial Communication-Space Trade-Off 1992 5 SIJDM Boros & Crama & Hammer, Chvatal Cuts and Odd Cycle Inequalities in Quadratic 0-1 Optimization 1992 5 SIJDM Gargano & Vaccaro, Minimum Time Broadcast Networks Tolerating a Logarithmic Number of Faults 1992 5 SIJDM Stachowiak, Hamilton Paths in Graphs of Linear Extensions for Unions of Posets 1992 5 SIJDM Zhou, On the Nonmultiplicativity of Oriented Cycles 1992 5 SIJDM Gardy, Normal Limiting Distributions for Projection and Semijoin Sizes 1992 5 SIJDM Kannan & Warnow, Triangulating 3-Colored Graphs 1992 5 SIJDM Karp, Three-Stage Generalized Connectors 1992 5 SIJDM Kushilevitz, Privacy and Communication Complexity 1992 5 SIJDM Lou & Sarrafzadeh & Lee, An Optimal Algorithm for the Maximum Two-Chain Problem 1992 5 SIJDM Bar-Noy & Motwani & Naor, A Linear Time Approach to the Set Maxima Problem 1992 5 SIJDM Bermond & Hell & Liestman & Peters, Broadcasting in Bounded Degree Graphs 1992 5 SIJDM Frank, Augmenting Graphs to Meet Edge-Connectivity Requirements 1992 5 SIJDM Nagamochi & Ibaraki, Computing Edge-Connectivity in Multigraphs and Capacitated Graphs 1992 5 SIJDM Olesky & Slater, A Forward Lower Restricted Ordering Algorithm for Digraphs 1992 5 SIJDM Scheinerman, Generalized Chromatic Numbers of Random Graphs 1992 5 SIJDM Zuckerman, A Technique for Lower Bounding the Cover Time 1992 5 SIJDM Babai, Bounded Round Interactive Proofs in Finite Groups 1992 5 SIJDM Ding & Schrijver & Seymour, Disjoint Paths in a Planar Graph--A General Theorem 1992 5 SIJDM Fellows & Langston, On Well-Paritial-Order Theory and Its Application to Combinatorial Problems of VLSI Design 1992 5 SIJDM Pemantle & Propp & Ullman, On Tensor Powers of Integer Programs 1992 5 SIJDM Guichard & Krussel, Pair Labelings of Graphs 1991 4 SIJDM Alles & Nesetril & Poljak, Extendability, Dimensions, and Diagrams of Cyclic Orders 1991 4 SIJDM Assaf & Upfal, Fault Tolerant Sorting Networks 1991 4 SIJDM Borie & Parker & Tovey, Deterministic Decomposition of Recursive Graph Classes 1991 4 SIJDM Brickell & Stinson, The Detection of Cheaters in Threshold Schemes 1991 4 SIJDM Chan & Lee, On the Existence of Hamiltonian Circuits in Faulty Hypercubes 1991 4 SIJDM de Werra & Solot, Compact Cylindrical Chromatic Scheduling 1991 4 SIJDM Dress & Havel, Bound Smoothing under Chirality Constraints 1991 4 SIJDM Tamir, Obnoxious Facility Location on Graphs 1991 4 SIJDM Dowd, Erratum: An Integer Program for Codes 1991 4 SIJDM Barthelemy & Janowitz, A Formal Theory of Consensus 1991 4 SIJDM Chrobak & Larmore, A New Approach to the Server Problem 1991 4 SIJDM Erdos & Fishburn & Furedi, Midpoints of Diagonals of Convex n-Gons 1991 4 SIJDM NC Algorithms for Recognizing Partial 2-Trees and 3-Trees 1991 4 SIJDM Graver, Rigidity Matroids 1991 4 SIJDM Imase & Waxman, Dynamic Steiner Tree Problem 1991 4 SIJDM Kim, Optimal Parallel Algorithms for Region Labeling and Medial Axis Transform of Binary Images 1991 4 SIJDM MacGillivray, On the Complexity of Colouring by Vertex-Transitive and Arc-Transitive Digraphs 1991 4 SIJDM Naor, A Lower Bound on Probabilistic Algorithms for Distributive Ring Coloring 1991 4 SIJDM Pruesse & Ruskey, Generating the Linear Extensions of Certain Posets by Transpositions 1991 4 SIJDM Siu & Bruck, On the Power of Threshold Circuits with Small Weights 1991 4 SIJDM Onn, On the Geometry and Computational Complexity of Radon Partitions in the Integer Lattice 1991 4 SIJDM Scheinerman, A Note on Planar Graphs and Circle Orders 1991 4 SIJDM Al-Thukair & Pelc & Rival & Urrutia, Motion Planning, Two-Directional Point Representations, and Ordered Sets 1991 4 SIJDM Blake & Kith, On the Complete Weight Enumerator of Reed-Solomon Codes 1991 4 SIJDM Chrobak & Karloff & Payne & Vishwanathan, New Results on Server Problems 1991 4 SIJDM Etzion & Hartman, Towards a Large Set of Steiner Quadruple Systems 1991 4 SIJDM Furedi, Maximal Independent Subsets in Steiner Systems and in Planar Sets 1991 4 SIJDM Goles & Martinez, Lyapunov Functionals for Automata Networks Defined by Cyclically Monotone Functions 1991 4 SIJDM Grigni & Peleg, Tight Bounds on Minimum Broadcast Networks 1991 4 SIJDM Kratochvil & Lubiw & Nesetril, Noncrossing Subgraphs in Topological Layouts 1991 4 SIJDM Ng & Hirschberg, Three-Dimensional Stable Matching Problems 1991 4 SIJDM Remmel & Yang, Special Rim Hook Tabloids and Some New Multiplicity-Free S-Series 1991 4 SIJDM Shapiro & Stephens, Bootstrap Percolation, the Schroeder Numbers, and the N-Kings Problem 1991 4 SIJDM McKinley & Hasan & Libeskind-Hadas & Liu, Disjoint Covers in Replicated Heterogeneous Arrays 1991 4 SIJDM Dowd, An Integer Program for Codes 1991 4 SIJDM Bonuccelli, A Polynomial Time Optimal Algorithm for Satellite-Switched Time-Division Multiple Access Satellite Communications with General Switching Modes 1991 4 SIJDM Chor & Kushilevitz, A Zero-One Law for Boolean Privacy 1991 4 SIJDM Coffman & Shor, A Simple Proof of the O(sqrt(n) log^{3/4} n) Upright Matching Bound 1991 4 SIJDM Flajolet & Soria, The Cycle Construction 1991 4 SIJDM Friesen & Langston, Analysis of a Compound Bin Packing Algorithm 1991 4 SIJDM Kleitman & West, Spanning Trees with Many Leaves 1991 4 SIJDM Luczak & Rucinski, Tree-Matchings in Graph Processes 1991 4 SIJDM Pippenger, The Expected Capacity of Concentrators 1991 4 SIJDM Schrijver, Edge-Disjoint Homotopic Paths in Straight-Line Planar Graphs 1991 4 SIJDM Tamassia & Tollis, Representations of Graphs on a Cylinder 1990 3 SIJDM Aigner & Triesch, Irregular Assignments of Trees and Forests 1990 3 SIJDM Aldous, The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees 1990 3 SIJDM Bolger, A Characterization of an Extension of the Banzhaf Value to Multicandidate Voting Games 1990 3 SIJDM Fishburn, Binary Probabilities Induced by Rankings 1990 3 SIJDM Fishburn, Thicknesses of Ordered Sets 1990 3 SIJDM Grotschel & Monma, Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints 1990 3 SIJDM Hamidoune & Tindell, Vertex Transitivity and Super Line Connectedness 1990 3 SIJDM Lu & Ho & Chang, The Domatic Number Problem in Interval Graphs 1990 3 SIJDM Manoussakis & Tuza, Polynomial Algorithms for Finding Cycles and Paths in Bipartite Tournaments 1990 3 SIJDM Pretzel & Youngs, Cycle Lengths and Graph Orientations 1990 3 SIJDM Ramachandran, A Minimax Arc Theorem for Reducible Flow Graphs 1990 3 SIJDM Savage, Generating Permutations with k-Differences 1990 3 SIJDM Takacs, On the Number of Distinct Forests 1990 3 SIJDM Tovey, A Simplified Anomaly and Reduction for Precedence Constrained Multiprocessor Scheduling 1990 3 SIJDM Tuan & Hakimi, River Routing with a Small Number of Jogs 1990 3 SIJDM Berman & Konsowa, Random Paths and Cuts, Electrical Networks, and Reversible Markov Chains 1990 3 SIJDM Bienstock & Brickell & Monma, On the Structure of Minimum-Weight k-Connected Spanning Networks 1990 3 SIJDM Bshouty & Seroussi, Generalizations of the Normal Basis Theorem of Finite Fields 1990 3 SIJDM Cremona & Landau, Shrinking Lattic Polyhedra 1990 3 SIJDM Du & Hwang, Optimal Assembly of an s-Stage k-Out-of-n System 1990 3 SIJDM Frankl, Canonical Antichains on the Circle and Applications 1990 3 SIJDM Khosrovshahi & Ajoodani-Namini, A New Basis for Trades 1990 3 SIJDM Kleitman & Vohra, Computing the Bandwidth of Interval Graphs 1990 3 SIJDM Moran & Wolfstahl, One-Page Book Embedding Under Vertex-Neighborhood Constraints 1990 3 SIJDM Nishizeki & Kashiwagi, On the 1.1 Edge-Coloring of Multigraphs 1990 3 SIJDM Sherali & Adams, A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems 1990 3 SIJDM Zhang, Finding Critical Independent Sets and Critical Vertex Subsets are Polynomial Problems 1990 3 SIJDM Flajolet & Odlyzko, Singularity Analysis of Generating Functions 1990 3 SIJDM Jacopini & Mentrasti & Sontacchi, Reversible Turing Machines and Polynomial Time Reversibly Computable Functions 1990 3 SIJDM Karchmer & Wigderson, Monotone Circuits for Connectivity Require Super-Logarithmic Depth 1990 3 SIJDM Przytycka & Przytycki, On a Lower Bound for Short Noncontractible Cycles in Embedded Graphs 1990 3 SIJDM Simon, On Approximate Solutions for Combinatorial Optimization Problems 1990 3 SIJDM Bar-Noy & Naor, Sorting, Minimal Feedback Sets, and Hamilton Paths in Tournaments 1990 3 SIJDM Bollobas & Brightwell, Parallel Selection with High Probability 1990 3 SIJDM Goldschmidt & Hochbaum, A Fast Perfect-Matching Algorithm in Random Graphs 1990 3 SIJDM Goldschmidt & Hochbaum, Asymptotically Optimal Linear Algorithm for the Minimal k-Cut in a Random Graph 1990 3 SIJDM Hajnal & Szemeredi, Brooks Coloring in Parallel 1990 3 SIJDM Klawe & Kleitman, An Almost Linear Time Algorithm for Generalized Matrix Searching 1990 3 SIJDM Lubiw, The Boolean Basis Problem and How to Cover Some Polygons by Rectangles 1990 3 SIJDM Petit & Terouanne, A Theory of Proportional Representation 1990 3 SIJDM Wang & Blake, Bit Serial Multiplication in Finite Fields 1989 2 SIJDM Balas, The Asymmetric Assignment Problem and Some New Facets of the Traveling Salesman Polytope on a Directed Graph 1989 2 SIJDM Chung, Pebbling in Hypercubes 1989 2 SIJDM Du & Leung, Complexity of Scheduling Parallel Task Systems 1989 2 SIJDM Furedi & Griggs & Kleitman, Pair Labellings with Given Distance 1989 2 SIJDM Kohli & Krishnamurti, Average Performance of Heuristics for Satisfiability 1989 2 SIJDM Pittel, The Average Number of Stable Matchings 1989 2 SIJDM Serafini & Ukovich, A Mathematical Model for Periodic Scheduling Problems 1989 2 SIJDM Servatius, Birigidity in the Plane 1989 2 SIJDM Ajtai & Karabeg & Komlos & Szemeredi, Sorting in Average Time o(log n) 1989 2 SIJDM Altschul, Leaf Pairs and Tree Dissections 1989 2 SIJDM Franzblau, Performance Guarantees on a Sweep-Line Heuristic for Covering Rectilinear Polygons with Rectangles 1989 2 SIJDM Goldberg & Spencer, Constructing a Maximal Independent Set in Parallel 1989 2 SIJDM Kahn & Lagarias & Witsenhausen, Single-Suit Two-Person Card Play III. The Misere Game 1989 2 SIJDM Kleitman, Divisors Without Unit-Congruent Ratios 1989 2 SIJDM Lind, Perturbations of Shifts of Finite Type 1989 2 SIJDM Motwani & Raghunathan & Saran, Perfect Graphs and Orthogonally Convex Graphs 1989 2 SIJDM Pippenger, Random Sequential Adsorption on Graphs 1989 2 SIJDM Rodl & Winkler, A Ramsey-Type Theorem for Orderings of a Graph 1989 2 SIJDM Tipnis & Trotter, Node-Packing Problems with Integer Rounding Properties 1989 2 SIJDM Vavasis, Gaussian Elimination with Pivoting is P-Complete 1989 2 SIJDM Bhatt & Chung & Leighton & Rosenberg, Universal Graphs for Bounded-Degree Trees and Planar Graphs 1989 2 SIJDM Buss & Rosenberg & Knott, Vertex Types in Book-Embeddings 1989 2 SIJDM Du & Leung, Scheduling Tree-Structured Tasks on Two Processors to Minimize Schedule Length 1989 2 SIJDM Feigenbaum & Haddad, On Factorable Extensions and Subgraphs of Prime Graphs 1989 2 SIJDM Saks, A Robust Noncryptographic Protocol for Collective Coin Flipping 1989 2 SIJDM Santoro & Sidney & Sidney & Urrutia, Geometric Containment and Partial Orders 1989 2 SIJDM Todd, A k-tree Generalization that Characterizes Consistency of Dimensional Engineering Drawings 1989 2 SIJDM Allouche & Hajnal & Shallit, Analysis of an Infinite Product Algorithm 1989 2 SIJDM Camerini & Hamacher, Intersection of Two Matroids: (Condensed) Border Graphs and Ranking 1989 2 SIJDM Cheng & Sloane, Codes From Symmetry Groups, and a [32, 17, 8] code 1989 2 SIJDM Choi & Nakajima & Rim, Graph Bipartization and Via Minimization 1989 2 SIJDM De Caen & Hoffman, Impossibility of Decomposing the Complete Graph on n Points into n-1 Isomorphic Complete Bipartite Graphs 1989 2 SIJDM Delsarte & Kamp, Low Rank Matrices with a Given Sign Pattern 1989 2 SIJDM Hakimi & Schmeichel, A Note on the Vertex Arboricity of a Graph 1989 2 SIJDM Hurkens & Schrijver, On the Size of Systems of Sets Every t of Which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems 1989 2 SIJDM Jaeschke, On Solving Rational Congruences 1989 2 SIJDM Karloff, How Long Can a Euclidean Traveling Salesman Tour Be? 1989 2 SIJDM Liu & Mirzaian, A Linear Reordering Algorithm for Parallel Pivoting of Chordal Graphs 1989 2 SIJDM Nisan & Soroker, Parallel Algorithms for Zero-One Supply-Demand Problems 1989 2 SIJDM Sugihara & Suzuki, Optimal Algorithms for a Pursuit-Evasion Problem in Grids 1988 1 SIJDM Chor & Gereb-Graus, On the Influence of Single Participant in Coin Flipping Schemes 1988 1 SIJDM Goldberg & Plotkin & Shannon, Parallel Symmetry-Breaking in Sparse Graphs 1988 1 SIJDM Haddad & Schaffer, Recognizing Bellman-Ford-Orderable Graphs 1988 1 SIJDM Hell & Kirkpatrick & Kratochvil & Kriz, On Restricted Two-Factors 1988 1 SIJDM Liestman & Peters, Broadcast Networks of Bounded Degree 1988 1 SIJDM Alon & Azar, Sorting, Approximate Sorting, and Searching in Rounds 1988 1 SIJDM Bang-Jensen & Hell & MacGillivray, The Complexity of Colouring by Semicomplete Digraphs 1988 1 SIJDM Barnes & Vannelli & Walker, A New Heuristic for Partitioning the Nodes of a Graph 1988 1 SIJDM Bertolazzi & Sassano, A Class of Polynomially Solvable Set-Covering Problems 1988 1 SIJDM Bertossi & Gori, Total Domination and Irredundance in Weighted Interval Graphs 1988 1 SIJDM Bollobas & Chung, The Diameter of a Cycle Plus a Random Matching 1988 1 SIJDM Fishburn & Marcus-Roberts & Roberts, Unique Finite Difference Measurement 1988 1 SIJDM Korner & Simonyi, Separating Partition Systems and Locally Different Sequences 1988 1 SIJDM Langenhop & Wright, Certain Occupancy Numbers Via an Algorithm for Computing Their Ratios 1988 1 SIJDM Poljak & Rodl & Spencer, Tournament Ranking with Expected Profit in Polynomial Time 1988 1 SIJDM Tamir, Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures 1988 1 SIJDM Tardos, Polynomial Bound for a Chip Firing Game on Graphs 1988 1 SIJDM Ragde & Steiger & Szemeredi & Wigderson, The Parallel Complexity of Element Distinctness is Omega(sqrt(log n)) 1988 1 SIJDM Feldman & Friedman & Pippenger, Wide-Sense Nonblocking Networks 1988 1 SIJDM Hutchinson, On Short Noncontractible Cycles in Embedded Graphs 1988 1 SIJDM Stinson & Vanstone, A Combinatorial Approach to Threshold Schemes 1988 1 SIJDM Whiteley, The Union of Matroids and the Rigidity of Frameworks 1988 1 SIJDM Zhou, Almost Every Randomly Near-Traceable Graph has Diameter at Most Two 1988 1 SIJDM Baldi, Neural Networks, Acyclic Orientations of the Hypercube, and Sets of Orthogonal Vectors 1988 1 SIJDM Bienstock, Asymptotic Analysis of Some Network Reliability Models 1988 1 SIJDM Carlson, Upper and Lower Bounds on Time-Space Tradeoffs for Computations with Embedded Fast Fourier Transforms 1988 1 SIJDM Chang & Hwang & Weng, Optimal Detection of Two Defectives with a Parity Check Device 1988 1 SIJDM Ko, Searching for Two Objects by Underweight Feedback 1988 1 SIJDM Korner & Marton, Graphs that Split Entropies 1988 1 SIJDM Paterson, Universal Chains and Wiring Layouts 1988 1 SIJDM Rawlins & Widmayer & Wood, Hole Problems for Rectangles in the Plane 1988 1 SIJDM Sagan, A Note on Independent Sets in Trees 1988 1 SIJDM Seress, Quick Gossiping by Conference Calls 1996 33 SIJNA Dutt & Gu & Rokhlin, Fast Algorithms for Polynomial Interpolation, Integration, and Differentiation 1996 17 SIJSSC Li & Hu & Nakamura, A Simple Parallel Algorithm for Polynomial Evaluation 1995 16 SIJSSC Mathias, The Instability of Parallel Prefix Matrix Multiplication 1995 16 SIJSSC Hendrickson & Leland, An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations 1994 15 SIJSSC Hendrickson & Womble, The Torus-Wrap Mapping for Dense Matrix Calculations on Massively Parallel Computers 1993 14 SIJSSC Dutt & Rokhlin, Fast Fourier Transforms for Nonequispaced Data 1993 14 SIJSSC Joe, Construction of K-Dimensional Delaunay Triangulations Using Local Transformations 1992 13 SIJSSC Edelsbrunner & Tan & Waupotitsch, An O(n^2 log n) Time Algorithm for the Minmax Angle Triangulation 1992 13 SIJSSC Termperton, A Generalized Prime Factor FFT Algorithm for Any N=2^p3^q5^r 1992 13 SIJSSC Mu & Rice, A Grid-Based Subtree-Subcube Assignment Strategy for Solving Partial Differential Equations on Hypercubes 1991 12 SIJSSC Vesely, Fast Cell-Structured Algorithm for Digit Reversal of Arbitrary Length 1990 11 SIJSSC Yakowitz & Lugosi, Random Search in the Presence of Noise, with Application to Machine Learning 1990 11 SIJSSC Bank & Rose, On the Complexity of Sparse Gaussian Elimination Via Bordering 1990 11 SIJSSC An O(N^2) Method for Computing the Eigensystem of N x N Symmetric Tridiagonal Matrices by the Divide and Conquer Approach 1988 SIMANDSCHU Pagels, The Dreams of Reason: The Computer and the Rise of the Sciences of Complexity 1982 SIMMONS Williams, Computationally ``Hard'' Problems as a Source for Cryptosystems 1982 SIMMONS Diffie, Conventional Versus Public Key Cryptosystems 1982 SIMMONS Merkle, Protocols for Public Key Cryptosystems 1982 SIMMONS Simmons, Message Authentication Without Secrecy 1982 SIMMONS Diffie & Hellman, New Directions in Cryptography 1982 SIMMONS Merkle, Secure Communications over Insecure Channels 1982 SIMMONS Merkle & Hellman, Hiding Information and Signatures in Trapdoor Knapsacks 1982 SIMMONS Rivest & Shamir & Adleman, A Method for Obtaining Digital Signatures and Public Key Cryptosystems 1982 SIMMONS Simmons, Symmetric and Asymmetric Encryption 1982 SIMMONS Diffie, Cryptographic Technology: Fifteen-Year Forecast 1995 28 SINEWS Cipra, Stamping Out Fraud on the Information Superhighway (October) 1995 28 SINEWS Van Loan, Using Examples to Build Computational Intuition (October) 1995 28 SINEWS Block, Scholars or Problem Solvers, or Both? 1995 28 SINEWS Moler, A Tale of Two Numbers (January) 1995 28 SINEWS Cipra, Are Eigenvalues Overvalued? 1994 27 SINEWS Herlihy & Shavit, Applications of Algebraic Topology To Concurrent Computation (no. 10) 1994 27 SINEWS Davis, Function Follows Form: Finding Local Alignment Patterns in Proteins and DNA (no. 8) 1994 27 SINEWS Lennerstad & Lundberg, Optimal Scheduling Results for Parallel Computing (no. 7) 1994 27 SINEWS Cipra, AAAS '94: Random Numbers, Art and Math (no. 7) 1994 27 SINEWS Cipra, ``The Magic Words Are Squeamish Ossifrage'' (July) 1994 27 SINEWS Grosse, Navigating Netlib With a WWW Browser (July) 1994 27 SINEWS Cipra, Coding Theorists Wring Linearity out of Nonlinear Codes 1993 26 SINEWS Cipra, The FFT: Making Technology Fly 1993 26 SINEWS Davis, Linear Graph Algorithms Have Big Payoffs 1993 26 SINEWS Davis, American Colleges: Basket Cases or Examples of National Style? 1993 26 SINEWS Davis, Industrial Problems: Sources and Solutions 1993 26 SINEWS White & Torney, Use of a Workstation Cluster for the Physical Mapping of Chromosomes 1993 26 SINEWS Case, Darwinism, Religious Challenges and Mathematical Doubts (book reviews) 1993 26 SINEWS Block, Journal Publication Costs: Are They Controllable? 1993 26 SINEWS Kwong, MATLAB 4.0: New Features, A Few Upward Incompatibilities (review) 1993 26 SINEWS Cipra, The Ubiquitous Reed-Solomon Codes 1992 25 SINEWS McIlroy, New NRC Report Proposes Broader Horizons for Computing Disciplines 1992 25 SINEWS Trefethen, The Definition of Numerical Analysis 1992 25 SINEWS , NRC CS&E Report Engenders Controversy 1992 25 SINEWS Grosse, Encrypted SIAM Membership List Is Now Available 1992 25 SINEWS Cipra, All Theorems Great and Small 1992 25 SINEWS Cipra, Theoretical Computer Scientists Develop Transparent Proof Technique 1992 25 SINEWS IEB, Standard Graduate Programs Aren't Working--New Approach Is Needed 1992 25 SINEWS Douglas, Parallel Multilevel and Multigrid Methods 1992 25 SINEWS Karp, Are Signed Referee Reports the Answer? 1991 24 SINEWS Beichl & Sullivan, Parallelizing Computational Geometry: First Steps 1991 24 SINEWS Roman, Technical Desktop Publishing 1991 24 SINEWS Landau, The Secret of Life is a Nontrivial Computation 1991 24 SINEWS Griewank, The Chain Rule Revisited in Scientific Computing 1991 24 SINEWS Vavasis, Complexity Issues for Numerical Optimization: Connecting the Discrete and the Continuous 1991 24 SINEWS Cipra, Euclidean Geometry Alive and Well in the Computer Age 1991 24 SINEWS Davis, The Crisis in Mathematical Education--Salvation from Within? (review of Steen (Ed.), On the Shoulders of Giants: New Approaches to Numeracy, National Academy Press, 1990) 1990 23 SINEWS Higham, Is Fast Matrix Multiplication of Practical Use? 1990 23 SINEWS Cipra, Computational Complexity Theorists Tackle the Cheating Computer Conundrum 1990 23 SINEWS , Number Field Sieve Produces Factoring Breakthrough 1990 23 SINEWS Davis, review of Penrose, The Emperor's New Mind (1989) 1990 23 SINEWS Davis, What Are Mathematical Colloquia For? 1989 22 SINEWS Erisman & Grimes, Sparse Matrices Today 1989 22 SINEWS Wright, Linear Programming Today: Part I: A Brief History of Linear Programming--From Fourier to the Ellipsoid Algorithm 1989 22 SINEWS Anstreicher, Linear Programming Today: Part II: Progress in Interior Point Algorithms Since 1984 1989 22 SINEWS Monma, Linear Programming Today: Part III: Successful Implementations of Interior Algorithms 1988 21 SINEWS Haber, Minimum-Knowledge Interactive Proofs 1987 20 SINEWS Sandefur, Discrete Dynamical Systems--An Alternative to Calculus 1987 20 SINEWS Sandefur, Discrete Dynamical Systems--An Alternative to Calculus? 1987 20 SINEWS Trotter, Applications of Finite Partially Ordered Sets 1987 20 SINEWS Byrne, How to Improve Technical Presentations 1986 SINEWS Wagstaff, Computers in Education: Using Computers to Teach Number Theory 1986 SINEWS Trotter, Complexity Theory & Discrete Math 1985 SINEWS Dubinsky & Hilton, On the Links Between Teaching Mathematics and Computing: Two Views 1980 13 SINEWS Dantzig, Khachian's Algorithm: A Comment by George Dantzig 1977 SINEWS Perlis, In Praise of APL: A Language for Lyrical Programming 1997 39 SIREV Edelman, The Mathematics of the Pentium Division Bug 1996 38 SIREV Koch & Schenkel & Wittwer, Computer-Assisted Proofs in Analysis and Programming in Logic: A Case Study 1996 38 SIREV Hajnal, review of Sharir & Agarwal, Davenport-Schinzel Sequences and Their Geometric Applications (Cambridge, 1995) 1996 38 SIREV Saari, review of Straffin, Game Theory and Strategy (MAA, 1993) 1996 38 SIREV Saari, review of Taylor, Mathematics and Politics (Springer, 1995) 1996 38 SIREV Borwein & Corless, review of Sloane & Plouffe, The Encyclopedia of Integer Sequences (Academic Press, 1995) 1996 38 SIREV Karp, Bit Reversal on Uniprocessors 1996 38 SIREV Vandenberghe & Boyd, Semidefinite Programming 1996 38 SIREV Stensholt, Circle Pictograms for Vote Vectors 1996 38 SIREV Beineke, review of Hartsfield & Ringel, Pearls in Graph Theory: A Comprehensive Introduction (Academic Press, 1994) 1996 38 SIREV Eberly, review of Bini & Pan, Polynomial and Matrix Computations Volume 1: Fundamental Algorithms (Birkhauser, 1994) 1996 38 SIREV McAllister, review of McNeill & Thro, Fuzzy Logic: A Practical Approach (AP Professional, 1995) 1996 38 SIREV McAllister, review of Ross, Fuzzy Logic with Engineering Applications (McGraw-Hill, 1995) 1995 37 SIREV Ypma, Historical Development of the Newton-Raphson Method 1995 37 SIREV Berry & Dumais & O'Brien, Using Linear Algebra for Intelligent Information Retrieval 1995 37 SIREV Rosenthal, Convergence Rates for Markov Chains 1995 37 SIREV Dongarra & Walker, Software Libraries for Linear Algebra Computations on High Performance Computers 1995 37 SIREV Heijmans, Mathematical Morphology: A Modern Approach in Image Processing Based on Algebra and Geometry 1995 37 SIREV Saari, A Chaotic Exploration of Aggregation Paradoxes 1995 37 SIREV Keller, How Many Shuffles to Mix a Deck? 1995 37 SIREV Hall, review of Shasha, Codes, Puzzles, and Conspiracy (W. H. Freeman, 1992) 1995 37 SIREV Hoffmann, review of O'Rourke, Computational Geometry in C (Cambridge University Press, 1994) 1995 37 SIREV Holmes, review of Lorenz, The Essence of Chaos (University of Washington Press, 1993) 1994 36 SIREV Fenstad, review of Matiyasevich, Hilbert's Tenth Problem (MIT Press, 1993) 1994 36 SIREV Ye, review of Nesterov & Nemirovskii, Interior-Point Polynomial Algorithms in Convex Programming (SIAM, 1994) 1994 36 SIREV Kieffer, review of Cover & Thomas, Elements of Information Theory (Wiley, 1991) 1994 36 SIREV Novak, review of Traub & Wasilkowski & Wozniakowski, Information-Based Complexity (Academic Press, 1988) 1994 36 SIREV Book, Relativizations of the P =? NP and Other Problems: Developments in Structural Complexity Theory 1994 36 SIREV Mattson, review of Poli & Huguet, Error Correcting Codes--Theory and Applications (Prentice Hall, 1992) 1993 35 SIREV Moskowitz, review of Ash, Information Theory (Dover, 1990) 1993 35 SIREV Sloan, review of Niederreiter, Random Number Generation and Quasi-Monte Carlo Methods (SIAM, 1992) 1993 35 SIREV Sommese, review of Cox & Little & O'Shea, Ideals, Varieties, and Algorithms--An Introduction to Computational Algebraic Geometry and Commutative Algebra (Springer, 1992) 1993 35 SIREV Vance, review of Martello & Toth, Knapsack Problems: Algorithms and Computer Implementations (Wiley, 1990) 1993 35 SIREV Hettich & Kortanek, Semi-Infinite Programming: Theory, Methods, and Applications 1993 35 SIREV Watkins, Some Perspectives on the Eigenvalue Problem 1993 35 SIREV Hughes, review of Stolfi, Oriented Projective Geometry: A Framework for Geometric Computations (Academic Press, 1991) 1993 35 SIREV Lenstra, review of Kilian, Uses of Randomness in Algorithms and Protocols (MIT Press, 1990) 1993 35 SIREV Mitchell, review of Apt & Olderog, Verification of Sequential and Concurrent Programs (Springer-Verlag, 1991) 1993 35 SIREV Singpurwalla & Wilson, The Warranty Problem: Its Statistical and Game Theoretic Aspects 1993 35 SIREV Keener, The Perron-Frobenius Theorem and the Ranking of Football Teams 1993 35 SIREV Cohen, Erratum: Subadditivity, Generalized Products of Random Matrices and Operations Research 1993 35 SIREV Bailey, review of Van Loan, Computational Frameworks for the Fast Fourier Transform (SIAM, 1992) 1993 35 SIREV Kan & van Vliet, review of Coffman & Lueker, Probabilistic Analysis of Packing and Partitioning Algorithms (Wiley, 1991) 1993 35 SIREV Willoughby, review of Hammerline & Hoffman, Numerical Mathematics (Springer-Verlag, 1991) 1992 34 SIREV Wester, review of Wolfram, Mathematica: A System for Doing Mathematics by Computer, Second Edition (Addison-Wesley, 1991) 1992 34 SIREV Gonzaga, Path-Following Methods for Linear Programming 1992 34 SIREV Pan, Complexity of Computations with Matrices and Polynomials 1992 34 SIREV Liu, The Multifrontal Method for Sparse Matrix Solution: Theory and Practice 1992 34 SIREV Goldberg & Powers, A Machine-Tool Design 1992 34 SIREV Antonelli, review of Przemyslaw, The Algorithmic Beauty of Plants, Springer-Verlag, 1990 1991 33 SIREV Maybee, review of Hartsfield & Ringel, Pearls in Graph Theory: A Comprehensive Introduction (Academic Press, 1990) 1991 33 SIREV Heath & Ng & Peyton, Parallel Algorithms for Sparse Linear Systems 1991 33 SIREV Stone & Tovey, Erratum: The Simplex and Projective Scaling Algorithms as Iteratively Reweighted Least Squares 1991 33 SIREV Buck, review of Brassard, Modern Cryptology: A Tutorial (1988) 1991 33 SIREV Ahuja & Magnanti & Orlin, Some Recent Advances in Network Flows 1991 33 SIREV Stone & Tovey, The Simplex and Projective Scaling Algorithms as Iteratively Reweighted Least Squares Methods 1991 33 SIREV Mathis, A Generalized Birthday Problem 1991 33 SIREV Aref, review of Prusinkiewicz & Hanan, Lindenmayer Systems, Fractals, and Plants (1989) 1991 33 SIREV Boltyanski, review of Steward, Games, Set, & Math: Enigmas and Conundrums (1989) 1991 33 SIREV Boltyanski, review of Soifer, How Does One Cut a Triangle? (1990) 1991 33 SIREV Goldberg & Gusfield, review of Adel'son-Vel'ski & Dinits & Karzanov, Flow Algorithms (1975) 1991 33 SIREV Kern, review of Aarts & Korst, Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinarial Optimization and Neural Computing (1989) 1991 33 SIREV Krishnamoorthy, review of Gusfield & Irving, The Stable Marriage Problem: Structure and Algorithms (1989) 1991 33 SIREV Peterson, Searching for New Mathematics 1991 33 SIREV Padberg & Rinaldi, A Branch-and-Cut Algorithm for the Resolution of Large-scale Symmetric Traveling Salesman Problems 1990 32 SIREV Jeffries, Code Recognition with Neural Network Dynamical Systems 1990 32 SIREV Smale, Some Remarks on the Foundations of Numerical Analysis 1990 32 SIREV Anderson, Random Number Generators on Vector Supercomputers and Other Advanced Architectures 1990 32 SIREV Briggs & Henson, The FFT as a Multigrid 1990 32 SIREV Blair, review of Nemhauser & Wolsey, Integer and Combinatorial Optimization (1988) 1990 32 SIREV Zimmerman, review of Parker & Rardin, Discrete Optimization (1988) 1990 32 SIREV Gallivan & Plemmons & Sameh, Parallel Algorithms for Dense Linear Algebra Computations 1989 31 SIREV Lax, The Flowering of Applied Mathematics in America 1989 31 SIREV Regalia & Mitra, Kronecker Products, Unitary Matrices, and Signal Processing Applications 1989 31 SIREV Ghandehari, review of Welsh, Codes and Cryptography (1988) 1989 31 SIREV Blair, review of Grotschel, Lovasz, and Schrijver, Geometric Algorithms and Combinatorial Optimization (1988) 1989 31 SIREV Blair, review of Murty, Linear Complementarity, Linear and Nonlinear Programming (1988) 1989 31 SIREV Greenspan & Bowman, review of O'Rourke, Art Gallery Theorems and Algorithms (1987) 1989 31 SIREV McNaughton, review of Pin, Varieties of Formal Languages (1986) 1989 31 SIREV McNaughton, review of Revesz, Introduction to Formal Languages (1983) 1989 31 SIREV George & Liu, The Evolution of the Minimum Degree Ordering Algorithm 1989 31 SIREV Manacher, review of Gibbons, Algorithmic Graph Theory (1985) 1988 30 SIREV Borwein & Borwein, On the Complexity of Familiar Functions and Numbers 1988 30 SIREV Blair, review of Hofri (1987) 1988 30 SIREV Blakley, review of Chor (1986) 1988 30 SIREV Franklin, review of Preparata and Shamos (1985) 1988 30 SIREV Chu, On the Continuous Realization of Iterative Processes 1988 30 SIREV Packel, Do Linear Problems have Linear Optimal Algorithms? 1988 30 SIREV Blakley, review of Kranakis (1986) 1988 30 SIREV Liu, review of Tucker (1984) 1988 30 SIREV Stenger, review of Wagner and Wechsung (1986) 1988 30 SIREV Mattson, review of Hill (1987), A First Course in Coding Theory 1988 30 SIREV Ullman, review of Anshel and Gewirtz (1986), Mathematics of Information Processing 1987 29 SIREV Shub, review of Traub, Wasilkowski, and Wozniakowski (1983) 1987 29 SIREV Hamacher, review of Sakarovitch (1984) 1987 29 SIREV Pless, review of Tomescu (1985) 1986 28 SIREV Chao, review of Gondran and Minoux (1984) 1986 28 SIREV Ralston, review of Shaw (1985) 1986 28 SIREV Wolf, review of Leighton (1983) 1986 28 SIREV Pan, Author's Comments on Don Coppersmith's Review of ``How to Multiply Matrices Faster'' 1986 28 SIREV Kulisch & Miranker, The Arithmetic of the Digital Computer: A New Approach 1986 28 SIREV Luchins, WHAT IS DISCRETE MATHEMATICS? A Comparative Review 1985 27 SIREV Alspach, review of Bogart (1983) 1985 27 SIREV Berzsenyi, review of Larson (1983) 1985 27 SIREV Hunt, review of Kohonen (1984) 1984 26 SIREV Pan, How Can We Speed Up Matrix Multiplication? 1984 26 SIREV Cohn, review of Shapiro (1983) 1984 26 SIREV Slepian, review of Burr (1982) 1982 24 SIREV Fredricksen, A Survey of Full Length Nonlinear Shift Register Cycle Algorithms 1978 SIREV Tarjan, Complexity of Combinatorial Algorithms 1972 SJCC Dijkstra, A Class of Allocation Strategies Inducing Bounded Delays Only 1991 29 SJCSS Rudel'son, Possibilities for Merging Sorting and Searching in Certain Data Organization Problems 1991 29 SJCSS Volkovich & Kolenov, A Distributed Solution Method for Interrelated Optimization Problems 1997 18 SJMAEL Kalantari & Khachiyan & Shokoufandeh, On the Complexity of Matrix Balancing 1996 17 SJMAEL George & Ikramov, Is the Polar Decomposition Finitely Computable? 1995 16 SJMAEL Rohn & Kreinovich, Computing Exact Componentwise Bounds on Solutions of Linear Systems with Interval Data is NP-Hard 1995 16 SJMAEL Bakonyi & Johnson, The Euclidean Distance Matrix Completion Problem 1995 16 SJMAEL Guler & Hoffman & Rothblum, Approximations to Solutions to Systems of Linear Inequalities 1993 14 SJMAEL Higham, Optimization by Direct Search in Matrix Computations 1992 13 SJMAEL Kuczynski & Wozniakowski, Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start 1992 13 SJMAEL Higham, Stability of a Method for Multiplying Complex Matrices with Three Real Matrix Multiplications 1991 12 SJMAEL Pang, Iterative Descent Algorithms for a Row Sufficient Linear Complementarity Problem 1991 12 SJMAEL Marchi, The Effective Computation of Equilibrium Point for N-Person Games Cyclic to the Next Person 1991 12 SJMAEL Holmes, On Random Correlation Matrices 1991 12 SJMAEL Gould, On Growth in Gaussian Elimination with Complete Pivoting 1991 12 SJMAEL Watkins & Elsner, Chasing Algorithms for the Eigenvalue Problem 1993 SMALEFEST Shub, On the Work of Steve Smale on the Theory of Computation 1993 SMALEFEST Batterson, Smale's Work on the Dynamics of Numerical Analysis 1993 SMALEFEST Demmel, Steve Smale and the Geometry of Ill-Conditioning 1993 SMALEFEST Traub, On Smale's Work in the Theory of Computation: From Polynomial Zeros to Continuous Complexity 1993 SMALEFEST Blum & Smale, The Godel Incompleteness Theorem and Decidability over a Ring 1993 SMALEFEST Renegar, Ill-Posed Problem Instances 1993 SMALEFEST Vassil'ev, Cohomology of Braid Groups and Complexity 1993 SMALEFEST Batterson, The Dynamics of Eigenvalue Computation 1993 SMALEFEST Gao, On the Role of Computable Error Estimates in the Analysis of Numerical Approximation Algorithms 1993 SMALEFEST Hirsch, Applications of Topology to Lower Bound Estimates in Computer Science 1993 SMALEFEST Kostlan, On the Distribution of Roots of Random Polynomials 1993 SMALEFEST Megiddo, A General NP-Completeness Theorem 1993 SMALEFEST Shub, Some Remarks on Bezout's Theorem and Complexity Theory 1979 10 SMITHSNN Kolata, Trial-and-Error Game that Puzzles Fast Computers 1992 11 SMS Lando & Zvonkin, Meanders 1992 11 SMS Vershik & Sporyshev, Asymptotic Behavior of the Number of Faces of Random Polyhedra and the Neighbourliness Problem 1989 8 SMS Krichevsky, Optimum Information Searching 1987 6 SMS Petri, Unsolvability of the Recognition Problem for Annihilating Iterative Networks 1996 7 SODA Vishwanathan, An O(log* n) Approximation Algorithm for the Asymmetric p-Center Problem 1996 7 SODA Srinivasan, An Extension of the Lovasz Local Lemma, and its Applications to Integer Programming 1996 7 SODA Calinescu & Fernandes & Finkler & Karloff, A Better Approximation Algorithm for Finding Planar Subgraphs 1996 7 SODA Chong & Lam, Improving Biconnectivity Approximation via Local Optimization 1996 7 SODA Karpinski & Larmore & Rytter, Sequential and Parallel Subquadratic Work Algorithms for Constructing Approximately Optimal Binary Search Trees 1996 7 SODA Muthukrishnan & Muller, Time and Space Efficient Method-Lookup for Object-Oriented Programs (Extended Abstract) 1996 7 SODA Brodal, Worst-Case Efficient Priority Queues 1996 7 SODA Thorup, On RAM Priority Queues 1996 7 SODA Awerbuch & Azar & Bartal, On-line Generalized Steiner Problem 1996 7 SODA Berman & Blum & Fiat & Karloff & Rosen, Randomized Robot Navigation Algorithms 1996 7 SODA Irani & Leung, Scheduling with Conflicts, and Applications to Traffic Signal Control 1996 7 SODA Bartal & Leonardi & Marchetti-Spaccamela & Sgall & Stougie, Multiprocessor Scheduling with Rejection 1996 7 SODA Asano & Chen & Katoh & Tokuyama, Polynomial-Time Solutions to Image Segmentation 1996 7 SODA Dickerson & Scharstein, Optimal Placement of Convex Polygons to Maximize Point Containment 1996 7 SODA Agarwal & de Berg & Halperin & Sharir, Efficient Generation of k-Directional Assembly Sequences 1996 7 SODA Goodrich, Fixed-Dimensional Parallel Linear Programming via Relative epsilon-Approximation 1996 7 SODA Hall & Shmoys & Wein, Scheduling To Minimize Average Completion Time: Off-line and On-line Algorithms 1996 7 SODA Goemans & Kleinberg, An Improved Approximation Ratio for the Minimum Latency Problem 1996 7 SODA Deng & Gu & Brecht & Lu, Preemptive Scheduling of Parallel Jobs on Multiprocessors 1996 7 SODA Remila, Tiling a Figure Using a Height in a Tree 1996 7 SODA Bern & Hayes, The Complexity of Flat Origami 1996 7 SODA Pellegrini, Electrostatic Fields without Singularities: Theory and Algorithms 1996 7 SODA Alberts & Cattaneo & Italiano, An Empirical Study of Dynamic Graph Algorithms (Extended Abstract) 1996 7 SODA Cheng & Ng, Isomorphism Testing and Display of Symmetries in Dynamic Trees 1996 7 SODA Frigioni & Marchetti-Spaccamela & Nanni, Fully Dynamic Output Bounded Single Source Shortest Path Problem (Extended Abstract) 1996 7 SODA Khanna & Motwani & wilson, On Certificates and Lookahead in Dynamic Graph Problems 1996 7 SODA Komlos & Ma & Szemeredi, Matching Nuts and Bolts in O(n log n) Time (Extended Abstract) 1996 7 SODA Piotrow, Depth Optimal Sorting Networks Resistant to k Passive Faults 1996 7 SODA Golin, Limit Theorems for Minimum-Weight Triangulations, Other Euclidean Functionals, and Probabilistic Recurrence Relations (Extended Abstract) 1996 7 SODA Broder & Frieze & Suen & Upfal, An Efficient Algorithm for the Vertex-Disjoint Paths Problem in Random Graphs 1996 7 SODA Kamath & Palmon & Plotkin, Routing and Admission Control in General Topology Networks with Poisson Arrivals 1996 7 SODA Mihail & Shallcross & Dean & Mostrel, A Commercial Application of Survivable Network Design: ITP/INPLANS CCS Network Topology Analyzer 1996 7 SODA Buchsbaum & van Santen, Selecting Training Inputs via Greedy Rank Covering 1996 7 SODA Lupton & Maley & Young, Data Collection for the Sloan Digital Sky Survey -- A Network-Flow Heuristic 1996 7 SODA Hannenhalli & Pevzner, To Cut ... Or Not To Cut (applications of comparative physical maps in molecular evolution) 1996 7 SODA Warnow & Ringe & Taylor, Reconstructing the Evolutionary History of Natural Languages 1996 7 SODA Cole & Hariharan, An O(n log n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees 1996 7 SODA Henzinger & King & Warnow, Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology 1996 7 SODA Johnson & McGeoch & Rothberg, Asymptotic Experimental Analysis for the Held-Karp Traveling Salesman Bound 1996 7 SODA Kenyon & Rabani & Sinclair, Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing (Preliminary Version) 1996 7 SODA Kenyon, Best-Fit Bin-Packing with Random Order 1996 7 SODA Agarwala & Bafna & Farach & Narayanan & Paterson & Thorup, On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics) 1996 7 SODA Ferragina & Grossi, Fast String Searching in Secondary Storage: Theoretical Developments and Experimental Results 1996 7 SODA Clark & Munro, Efficient Suffix Trees on Secondary Storage (extended abstract) 1996 7 SODA Levcopoulos & Krznaric, Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation 1996 7 SODA Mitchell, Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple New Method for the Geometric k-MST Problem 1996 7 SODA Wang & Agarwal, Approximation Algorithms for Curvature-Constrained Shortest Paths 1996 7 SODA Arkin & Held & Smith, Optimization Problems Related to Zigzag Pocket Machining (Extended Abstract) 1996 7 SODA Zito & Pu & Amos & Gibbons, RNC Algorithms for the Uniform Generation of Combinatorial Structures 1996 7 SODA Halperin & Zwick, Optimal Randomized EREW PRAM Algorithms for Finding Spanning Forests and for other Basic Graph Connectivity Problems 1996 7 SODA Wilson & Propp, How to Get an Exact Sample From a Generic Markov Chain and Sample a Random Spanning Tree From a Directed Graph, Both Within the Cover time 1996 7 SODA Karp & Kenyon & Waarts, Error-Resilient DNA Computation (Preliminary Version) 1996 7 SODA Kalai, Games, Computers, and O. R. 1996 7 SODA Orlin, A Polynomial time Primal Network Simplex Algorithm for Minimum Cost Flows (An Extended Abstract) 1996 7 SODA Iwata, A Capacity Scaling Algorithm for Convex Cost Submodular Flows 1996 7 SODA McCormick, A Polynomial Algorithm for Abstract Maximum Flow 1996 7 SODA Babai & Beals & Cai & Ivanyos & Luks, Multiplicative Equations over Commuting Matrices 1996 7 SODA Huang & Rao, Interpolation of Sparse Multivariate Polynomials over Large Finite Fields with Applications 1996 7 SODA Pan, A New Approach to Parallel Computation of Polynomial GCD and to Related Parallel Computations over Fields and Integer Rings 1996 7 SODA Gabow, Perfect Arborescence Packing in Preflow Mincut Graphs 1996 7 SODA Frederickson & Solis-Oba, Increasing the Weight of Minimum Spanning Trees 1996 7 SODA Aingworth & Chekuri & Motwani, Fast Estimation of Diameter and Shortest Paths (without Matrix Multiplication) 1996 7 SODA Goldberg & MacKenzie, Analysis of Practical Backoff Protocols for Contention Resolution with Multiple Servers 1996 7 SODA Mayer & Ostrovsky & Yung, Self-Stabilizing Algorithms for Synchronous Unidirectional Rings 1996 7 SODA Awerbuch & Bartal & Fiat, Distributed Paging for General Networks 1995 6 SODA Aiello & Rajagopalan & Venkatesan, Design of Practical and Provably Good Random Number Generators (Extended Abstract) 1995 6 SODA Siegel, On the Statistical Dependencies of Coalesced Hashing and Their Implications for Both Full and Limited Independence 1995 6 SODA Andersson & Petersson, On-line Approximate List Indexing with Applications 1995 6 SODA Dor & Zwick, Selecting the Median 1995 6 SODA Myers & Miller, Chaining Multiple-Alignment Fragments in Sub-Quadratic Time 1995 6 SODA Farach & Noordewier & Savari & Shepp & Wyner & Ziv, On the Entropy of DNA: Algorithms and Measurements Based on Memory and Rapid Convergence 1995 6 SODA Berger & Wilson, Improved Algorithms for Protein Motif Recognition 1995 6 SODA Kannan & Warnow & Yooseph, Computing the Local Consensus of Trees 1995 6 SODA Karzanov & McCormick, Polynomial Methods for Separable Convex Optimization in Unimodular Spaces 1995 6 SODA Gabow, Algorithms for Graphic Polymatroids and Parametric s-Sets 1995 6 SODA Queyranne, A Combinatorial Algorithm for Minimizing Symmetric Submodular Functions 1995 6 SODA Bertsimas & Teo, From Valid Inequalities to Heuristics: A Unified View of Primal-Dual Approximation Algorithms in Covering Problems 1995 6 SODA Coudert, Doing Two-Level Logic Minimization 100 Times Faster 1995 6 SODA Zhou & Nishizeki, Finding Optimal Edge-Rankings of Trees 1995 6 SODA Eberly, Efficient Parallel Computations for Singular Band Matrices 1995 6 SODA Chiang & Goodrich & Grove & Tamassia & Vengroff & Vitter, External-Memory Graph Algorithms 1995 6 SODA Halldorsson & Iwano & Katoh & Tokuyama, Finding Subsets Maximizing Minimum Structures 1995 6 SODA Halldorsson, Approximating Discrete Collections via Local Improvements 1995 6 SODA Young, Randomized Rounding Without Solving the Linear Program 1995 6 SODA Lueker, Average-Case Analysis of Off-Line and On-Line Knapsack Problems 1995 6 SODA Bern & Chew & Eppstein & Ruppert, Dihedral Bounds for Mesh Generation in High Dimensions 1995 6 SODA Chew & Kedem & Sharir & Tagansky & Welzl, Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions 1995 6 SODA Daniels & Milenkovic, Multiple Translational Containment: Approximate and Exact Algorithms 1995 6 SODA Das & Narasimhan & Salowe, A New Way to Weigh Malnourished Euclidean Graphs 1995 6 SODA Berry & Goldberg, Path Optimization and Near-Greedy Analysis for Graph Partitioning: An Empirical Study 1995 6 SODA Guattery & Miller, On the Performance of Spectral Graph Partitioning Methods 1995 6 SODA Bar-Noy & Mayer & Schieber & Sudan, Guaranteeing Fair Service to Persistent Dependent Tasks 1995 6 SODA Maslen & Rockmore, Adapted Diameters and the Efficient Computation of Fourier Transforms on Finite Groups 1995 6 SODA Callahan & Kosaraju, Algorithms for Dynamic Closest Pair and n-Body Potential Fields 1995 6 SODA Boissonnat & Czyzowicz & Devillers & Yvinec, Circular Separability of Polygon 1995 6 SODA Chan & Snoeyink & Yap, Output-Sensitive Construction of Polytopes in Four Dimensions and Clipped Voronoi Diagrams in Three 1995 6 SODA Chen, On the All Pairs Euclidean Short Path Problem 1995 6 SODA Dinitz & Vainshtein, Locally Orientable Graphs, Cell Structures, and a New Algorithm for the Incremental Maintenance of Connectivity Carcasses 1995 6 SODA Alberts & Henzinger, Average Case Analysis of Dynamic Graph Algorithms 1995 6 SODA Cimikowski, An Analysis of Some Heuristics for the Maximum Planar Subgraph Problem 1995 6 SODA Ravi & Williamson, An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems 1995 6 SODA Chandru & Dattasharma & Keerthi & Sancheti & Vinay, Algorithms for the Optimal Loading of Recursive Neural Nets 1995 6 SODA Mohring & Muller-Hannemann & Weihe, Using Network Flows for Surface Modeling 1995 6 SODA Kannan & Proebsting, Register Allocation in Structured Programs 1995 6 SODA Knill, Lower Bounds for Identifying Subset Members with Subset Queries 1995 6 SODA Subramanian & Ramaswamy, The P-range Tree: A New Data Structure for Range Searching in Secondary Memory 1995 6 SODA Erickson, Lower Bounds for Linear Satisfiability Problems 1995 6 SODA Hershberger & Suri, Morphing Binary Trees 1995 6 SODA Schieber, Computing a Minimum-Weight k-Link Path in Graphs with the Concave Monge Property 1995 6 SODA Albers, Improved Randomized On-Line Algorithms for the List Update Problem 1995 6 SODA Burley & Irani, On Algorithm Design for Metrical Task Systems 1995 6 SODA Grove, Online Bin Packing with Lookahead 1995 6 SODA Dudek & Romanik & Whitesides, Localizing a Robot with Minimum Travel 1995 6 SODA Hershberger & Suri, Practical Methods for Approximating Shortest Paths on a Convex Polytope in R^3 1995 6 SODA Brickell & Gemmell & Kravitz, Trustee-based Tracing Extensions to Anonymous Cash and the Making of Anonymous Change 1995 6 SODA Chou & Cooperstock & El-Yaniv & Klugerman & Leighton, The Statistical Adversary Allows Optimal Money-Making Trading Strategies 1995 6 SODA Ajtai & Aspnes & Naor & Rabani & Schulman & Waarts, Fairness in Scheduling 1995 6 SODA Radzik, Fast Deterministic Approximation for the Multicommodity Flow Problem 1995 6 SODA Kamath & Palmon & Plotkin, Fast Approximation Algorithm for Minimum Cost Multicommodity Flow 1995 6 SODA Kamath & Palmon, Improved Interior Point Algorithms for Exact and Approximate Solution of Multicommodity Flow Problems 1995 6 SODA Hoppe & Tardos, The Quickest Transshipment Problem 1995 6 SODA Grinberg & Rajagopalan & Venkatesan & Wei, Splay Trees for Data Compression 1995 6 SODA Ferragina & Grossi, Fast Incremental Text Editing 1995 6 SODA Baker, Parameterized Pattern Matching by Boyer-Moore-type Algorithms 1995 6 SODA Kannan & Sweedyk & Mahaney, Counting and Random Generation of Strings in Regular Languages 1995 6 SODA Kahale & Leighton, Greedy Dynamic Routing on Arrays 1995 6 SODA Aumann & Rabani, Improved Bounds for All Optical Routing 1995 6 SODA Gaber & Mansour, Broadcast in Radio Networks 1995 6 SODA Fix & Ladner, Optimal One-Way Sorting on a One-Dimensional Sub-Bus Array 1995 6 SODA Kannan & Warnow, A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies when the Number of Character States is Fixed 1995 6 SODA Kececioglu & Ravi, Of Mice and Men: Algorithms for Evolutionary Distances Between Genomes with Translocation 1995 6 SODA Bafna & Pevzner, Sorting Permutations by Transpositions 1995 6 SODA Furer, Graph Isomorphism Testing without Numerics for Graphs of Bounded Eigenvalue Multiplicity 1995 6 SODA Eppstein, Subgraph Isomorphism in Planar Graphs and Related Problems 1995 6 SODA Hagerup & Katajainen & Nishimura & Ragde, Characterizations of k-Terminal Flow Networks and Computing Network Flows in Partial k-Trees 1994 5 SODA Huttenlocher & Kleinberg, Comparing Point Sets Under Projection 1994 5 SODA Kleinberg, On-Line Search in a Simple Polygon 1994 5 SODA Burnikel & Mehlhorn & Schirra, On Degeneracy in Geometric Computations 1994 5 SODA Agarwal & Suri, Surface Approximation and Geometric Partitions 1994 5 SODA Ar & Cai, Reliable Benchmarks Using Numerical Instability 1994 5 SODA Kolountzakis, An Effective Additive Basis for the Integers 1994 5 SODA Bach, Exact Analysis of a Priority Queue Algorithm for Random Variate Generation 1994 5 SODA Friedl & Hatsagi & Shen, Low-degree Tests 1994 5 SODA Buss & Yianilos, Linear and O(n log n) Time Minimum-Cost Matching Algorithms for Quasi-convex Tours 1994 5 SODA Eppstein, Average Case Analysis of Dynamic Geometric Optimization 1994 5 SODA Efrat & Sharir, A Near-Linear Algorithm for the Planar Segment Center Problem 1994 5 SODA Dwyer & Eddy, Maximal Empty Ellipsoids 1994 5 SODA Conforti & Cornuejols & Kapoor & Vuskovic, Recognizing Balanced 0, +/-1 Matrices 1994 5 SODA Turek & Schwiegelshohn & Wolf & Yu, Scheduling Parallel Tasks to Minimize Average Response Time 1994 5 SODA Johnson & LaPaugh & Pinter, Minimizing Channel Density by Lateral Shifting of Components 1994 5 SODA Karger & Phillips & Torng, A Better Algorithm for an Ancient Scheduling Problem 1994 5 SODA Aronson & Dyer & Frieze & Suen, On the Greedy Heuristic for Matchings 1994 5 SODA Chandra & Karloff & Tovey, New Results on the Old k-Opt Algorithm for the TSP 1994 5 SODA Eppstein, Clustering for Faster Network Simplex Pivots 1994 5 SODA Ludwig & Tiwari, Scheduling Malleable and Nonmalleable Parallel Tasks 1994 5 SODA Khuller & Raghavachari & Young, Approximating the Minimum Equivalent Digraph 1994 5 SODA Matias & Vitter & Young, Approximate Data Structures with Applications 1994 5 SODA Kosaraju, An Optimal RAM Implementation of Catenable Min Double-ended Queues 1994 5 SODA La Poutre & Westbrook, Dynamic Two-Connectivity with Backtracking 1994 5 SODA Mehlhorn & Sundar & Uhrig, Maintaining Dynamic Sequences Under Equality-Tests in Polylogarithmic Time 1994 5 SODA Goemans & Goldberg & Plotkin & Shmoys & Tardos & Williamson, Improved Approximation Algorithms for Network Design Problems 1994 5 SODA Aggarwal & Garg, A Scaling Technique for Better Network Design 1994 5 SODA Goodrich & Matias & Vishkin, Optimal Parallel Approximation Algorithms for Prefix Sums and Integer Sorting 1994 5 SODA Dolev & Harari & Linial & Nisan & Parnas, Neighborhood Preserving Hashing and Approximate Queries 1994 5 SODA Pan, New Techniques for Approximating Complex Polynomial Zeros 1994 5 SODA Coppersmith & Neff, Roots of a Polynomial and its Derivatives 1994 5 SODA Gallo & Mishra, The Complexity of Resolvent Resolved 1994 5 SODA Reif & Tate, Dynamic Algebraic Algorithms 1994 5 SODA Lipton & Tomkins, Online Interval Scheduling 1994 5 SODA Awerbuch & Bartal & Fiat & Rosen, Competitive Non-Preemptive Call Control 1994 5 SODA Awerbuch & Azar & Plotkin & Waarts, Competitive Routing of Virtual Circuits with Unknown Duration 1994 5 SODA Hellerstein & Coullard, Learning Binary Matroid Ports 1994 5 SODA Dyer & Frieze & Jerrum, Approximately Counting Hamilton Cycles in Dense Graphs 1994 5 SODA Bar-Yehuda & Geiger & Naor & Roth, Approximation Algorithms for the Vertex Feedback Set Problem with Applications to Constraint Satisfaction and Bayesian Inference 1994 5 SODA Williamson & Goemans, Computational Experience with an Approximation Algorithm on Large-Scale Euclidean Matching Instances 1994 5 SODA Berman & Furer, Approximating Maximum Independent Set in Bounded Degree Graphs 1994 5 SODA Kao & Ma & Sipser & Yin, Optimal Constructions of Hybrid Algorithms 1994 5 SODA Lund & Reingold, Linear Programs for Randomized On-Line Algorithms 1994 5 SODA Krishnan & Vitter, Optimal Prediction for Prefetching in the Worst Case 1994 5 SODA Tetali, Design of On-line Algorithms using Hitting Times 1994 5 SODA Aggarwal & Bar-Noy & Coppersmith & Ramaswami & Schieber & Sudan, Efficient Routing and Scheduling Algorithms for Optical Networks 1994 5 SODA Karger, Using Randomized Sparsification to Approximate Minimum Cuts 1994 5 SODA Hoppe & Tardos, Polynomial Time Algorithms for Some Evacuation Problems 1994 5 SODA Cheriyan, A Las Vegas 0(N^{2.38}) Algorithm for the Cardinality of a Maximum Matching 1994 5 SODA Gremban & Miller & Teng, Moments of Inertia and Graph Separators 1994 5 SODA Plotkin & Rao & Smith, Shallow Excluded Minors and Improved Graph Decompositions 1994 5 SODA Kececioglu & Gusfield, Reconstructing a History of Recombinations from a Set of Sequences 1994 5 SODA Farach & Thorup, Fast Comparison of Evolutionary Trees 1994 5 SODA Alizadeh & Karp & Weisser & Zweig, Physical Mapping of Chromosomes Using Unique Probes 1994 5 SODA Ben-Amram & Berkman & Iliopoulos & Park, The Subtree Max Gap Problem with Application to Parallel String Covering 1994 5 SODA Moore & Smyth, Computing the Covers of a String in Linear Time 1994 5 SODA Cherkassky & Goldberg & Radzik, Shortest Paths Algorithms: Theory and Experimental Evaluation 1994 5 SODA Goldberg & Karzanov, Path Problems in Skew-Symmetric Graphs 1994 5 SODA McConnell & Spinrad, Linear-Time Modular Decomposition and Efficient Transitive Orientation of Comparability Graphs 1994 5 SODA Ravi & Sundaram & Marathe & Rosenkrantz & Ravi, Spanning Trees Short or Small 1994 5 SODA Kortsarz & Peleg, Generating Low-Degree 2-Spanners 1994 5 SODA Adler & Gemmell & Harchol-Balter & Karp & Kenyon, Selection in the Presence of Noise: The Design of Playoff Systems 1994 5 SODA Arya & Mount & Netanyahu & Silverman & Wu, An Optimal Algorithm for Approximate Nearest Neighbor Searching 1994 5 SODA Harchol-Balter & Black, Queueing Analysis of Oblivious Packet-Routing Networks 1994 5 SODA Randall & Sinclair, Testable Algorithms for Self-Avoiding Walks 1994 5 SODA Broder & Frieze & Suen & Upfal, Optimal Construction of Edge-Disjoint Paths in Random Graphs 1994 5 SODA Raman & Vishkin, Optimal Randomized Parallel Algorithms for Computing the Row Maxima of a Totally Monotone Matrix 1994 5 SODA Ramachandran & Yang, An Efficient Parallel Algorithm for the General Planar Monotone Circuit Value Problem 1994 5 SODA Feder & Megiddo & Plotkin, A Sublinear Parallel Algorithm for Stable Matching 1994 5 SODA Gibbons & Matias & Ramachandran, The QRQW PRAM: Accounting for Contention in Parallel Algorithms 1994 5 SODA Pan & Sobze & Atinkpahoun, Optimum Parallel Computations with Banded Matrices 1994 5 SODA Aggarwal & Plaxton, Optimal Parallel Sorting in Multi-Level Storage 1994 5 SODA Kaufmann & Sibeyn & Suel, Derandomizing Algorithms for Routing and Sorting on Meshes 1994 5 SODA Muthukrishnan, On Optimal Strategies for Searching in Presence of Errors 1994 5 SODA Alon & Blum & Fiat & Kannan & Naor & Ostrovsky, Matching Nuts and Bolts 1994 5 SODA Gu & Farach & Beigel, An Efficient Algorithm for Dynamic Text Indexing 1994 5 SODA Amir & Benson & Farach, Let Sleeping Files Lie: Pattern Matching in Z-compressed Files 1994 5 SODA Karkkainen & Ukkonen, Two and Higher Dimensional Pattern Matching in Optimal Expected Time 1994 5 SODA Luby & Naor & Orda, Tight Bounds for Dynamic Storage Allocation 1993 4 SODA Hagerup, Fast Deterministic Processor Allocation 1993 4 SODA Chong & Lam, Finding Connected Components in O(log n log log n) Time on the EREW PRAM 1993 4 SODA Karger, Global Min-cuts in RNC, and Other Ramifications of a Simple Min-Cut Algorithm 1993 4 SODA Cheriyan, Random Weighted Laplacians, Lovasz Minimum Digraphs and Finding Minimum Separators 1993 4 SODA Knuth, The Stanford GraphBase: A Platform for Combinatorial Algorithms 1993 4 SODA Chiang & Preparata & Tamassia, A Unified Approach to Dynamic Point Location, Ray Shooting, and Shortest Paths in Planar Maps 1993 4 SODA Hershberger & Suri, A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk 1993 4 SODA Eppstein & Erickson, Iterated Nearest Neighbors and Finding Minimal Polytopes 1993 4 SODA Matousek & Mount & Netanyahu, Efficient Randomized Algorithms for the Repeated Median Line Estimator 1993 4 SODA Ruppert, A New and Simple Algorithm for Quality 2-Dimensional Mesh Generation 1993 4 SODA Hobby, Polygonal Approximations that Minimize the Number of Inflections 1993 4 SODA Garg & Santosh & Singla, Improved Approximation Algorithms for Biconnected Subgraphs via Better Lower Bounding Techniques 1993 4 SODA Ripphausen-Lipa & Wagner & Weihe, The Vertex-Disjoint Menger Problem in Planar Graphs 1993 4 SODA McMorris & Warnow & Wimer, Triangulating Vertex Colored Graphs 1993 4 SODA Eschen & Spinrad, An O(n^2) Algorithm for Circular-Arc Graph Recognition 1993 4 SODA de la Torre & Greenlaw & Schaffer, Optimal Edge Ranking of Trees in Polynomial Time 1993 4 SODA Fredman & Johnson & McGeoch & Ostheimer, Data Structures for Traveling Salesmen 1993 4 SODA Buchsbaum & Tarjan, Confluently Persistent Deques via Data Structural Bootstrapping 1993 4 SODA Galperin & Rivest, Scapegoat Trees 1993 4 SODA Frederickson, A Data Structure for Dynamically Maintaining Rooted Trees 1993 4 SODA Klawe & Mumey, Upper and Lower Bounds on Constructing Alphabetic Binary Trees 1993 4 SODA Dietz & Mehlhorn & Raman & Uhrig, Lower Bounds for Set Intersection Queries 1993 4 SODA Gabow, A Representation for Crossing Set Families with Applications to Submodular Flow Problems 1993 4 SODA Lang & Rao, Finding Near-Optimal Cuts: An Empirical Evaluation 1993 4 SODA Goldberg, Scaling Algorithms for the Shortest Paths Problem 1993 4 SODA Balas & Ceria & Cornuejols, Solving Mixed 0-1 Programs by a Lift-and-Project Method 1993 4 SODA Khuller & Raghavachari & Young, Balancing Minimum Spanning and Shortest Path Trees 1993 4 SODA Heistermann & Lengauer, Efficient Automatic Part Nesting on Irregular and Inhomogeneous Surfaces 1993 4 SODA Agarwal & Sharir, Ray Shooting Amidst Convex Polytopes in Three Dimensions 1993 4 SODA Arya & Mount, Approximate Nearest Neighbor Queries in Fixed Dimensions 1993 4 SODA Chazelle & Matousek, On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension 1993 4 SODA Callahan & Kosaraju, Faster Algorithms for Some Geometric Graph Problems in Higher Dimensions 1993 4 SODA Golin & Raman & Schwarz & Smid, Randomized Data Structures for the Dynamic Closest-Pair Problem 1993 4 SODA Yianilos, Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces 1993 4 SODA Broder & Frieze & Upfal, On the Satisfiability and Maximum Satisfiability of Random 3-CNF Formulas 1993 4 SODA Schmidt & Siegel & Srinivasan, Chernoff-Hoeffding Bounds for Applications with Limited Independence 1993 4 SODA Frieze & Radcliffe & Suen, Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs 1993 4 SODA Golin, Maxima in Convex Regions 1993 4 SODA Matias & Vitter & Ni, Dynamic Generation of Discrete Random Variates 1993 4 SODA Alizadeh & Karp & Newberg & Weisser, Physical Mapping of Chomosomes: A Combinatorial Problem in Molecular Biology 1993 4 SODA Warnow, Tree Compatibility and Inferring Evolutionary History 1993 4 SODA Amir & Farach & Idury & La Poutre & Schaffer, Improved Dynamic Dictionary Matching 1993 4 SODA Giancarlo, The Suffix Tree of a Square Matrix, with Applications 1993 4 SODA Ramesh, On Traversing Layered Graphs On-line 1993 4 SODA Motwani & Phillips & Torng, Non-Clairvoyant Scheduling 1993 4 SODA Azar & Broder & Manasse, On-line Choice of On-line Algorithms 1993 4 SODA Kao & Reif & Tate, Searching in an Unknown Environment: An Optimal Randomized Algorithm for the Cow-Path Problem 1993 4 SODA Shmoys & Tardos, Scheduling Unrelated Machines with Costs 1993 4 SODA Deng & Koutsoupias, Competitive Implementation of Parallel Programs 1993 4 SODA Snyder & Steele, Equidistribution of Point Sets for the Traveling Salesman and Related Problems 1993 4 SODA McIlroy, Optimistic Sorting and Information Theoretic Complexity 1993 4 SODA Fischer & Wright, An Efficient Protocol for Unconditionally Secure Secret Key Exchange 1993 4 SODA Shoup, Fast Construction of Irreducible Polynomials over Finite Fields 1993 4 SODA Hofting & Wanke, Polynomial Algorithms for Minimum Cost Paths in Periodic Graphs 1993 4 SODA Matula, A Linear Time 2 + epsilon Approximation Algorithm for Edge Connectivity 1992 3 SODA Yannakakis, On the Approximation of Maximum Satisfiability 1992 3 SODA Pittel, On Likely Solutions of a Stable Matching Problem 1992 3 SODA Dhagat & Gacs & Winkler, On Playing ``Twenty Questions'' with a Liar 1992 3 SODA Rubinfeld & Sudan, Self-Testing Polynomial Functions Efficiently and Over Rational Domains 1992 3 SODA Babai, Deciding Finiteness of Matrix Groups in Las Vegas Polynomial Time 1992 3 SODA Spencer, The Probabilistic Method 1992 3 SODA Eppstein, Approximating the Minimum Weight Triangulation 1992 3 SODA Agarwal & Matousek, Relative Neighborhood Graphs in Three Dimensions 1992 3 SODA Amenta, Finding a Line Transversal of Axial Objects in Three Dimensions 1992 3 SODA Agarwal & Sharir & Toledo, Applications of Parametric Searching in Geometric Optimization 1992 3 SODA Eppstein, New Algorithms for Minimum Area k-gons 1992 3 SODA Mehlhorn & Sharir & Welzl, Tail Estimates for the Space Complexity of Randomized Incremental Algorithms 1992 3 SODA MacKenzie, Load Balancing Requires Omega(log* n) Expected Time 1992 3 SODA Albers & Hagerup, Improved Parallel Integer Sorting without Concurrent Writing 1992 3 SODA Mathies, Percolation Theory and Computing with Faulty Arrays of Processors 1992 3 SODA Aharonson & Attiya, Counting Networks with Arbitrary Fan-Out 1992 3 SODA Tsay, Searching Tree Structures on a Mesh of Processors 1992 3 SODA Lin-Kriz & Pan, On Parallel Complexity of Integer Linear Programming, GCD and the Iterated Mod Function 1992 3 SODA Milhail & Winkler, On the Number of Eulerian Orientations of a Graph 1992 3 SODA Han & Kelsen & Ramachandran & Tarjan, Computing Minimal Spanning Subgraphs in Linear Time 1992 3 SODA King & Rao & Tarjan, A Faster Deterministic Maximum Flow Algorithm 1992 3 SODA Hao & Orlin, A Faster Algorithm for Finding the Minimum Cut in a Graph 1992 3 SODA Tokuyama & Nakano, Efficient Algorithms for the Hitchcock Transportation Problem 1992 3 SODA Radzik, Minimizing Capacity Violations in a Transshipment Network 1992 3 SODA Groetschel, Theoretical and Practical Aspects of Combinatorial Problem Solving 1992 3 SODA Chrobak & Larmore, Generosity Helps, or An 11-Competitive Algorithm for Three Servers 1992 3 SODA Azar & Naor & Rom, The Competitiveness of On-Line Assignments 1992 3 SODA Halldorsson & Szegedy, Lower Bounds for On-Line Graph Coloring 1992 3 SODA Hui & Martel, On Efficient Unsuccessful Search 1992 3 SODA Irani & Karlin & Phillips, Strongly Competitive Algorithms for Paging with Locality of Reference 1992 3 SODA Bar-Eli & Berman & Fiat & Yan, On-line Navigation in a Room 1992 3 SODA Baumgarten & Jung & Mehlhorn, Dynamic Point Location in General Subdivisions 1992 3 SODA Guibas & Motwani & Raghavan, The Robot Localization Problem in Two Dimensions 1992 3 SODA Arkin & Mitchell & Suri, Optimal Link Path Queries in a Simple Polygon 1992 3 SODA Schwarz & Smid, An O(n log n log log n) Algorithm for the On-Line Closest Pair Problem 1992 3 SODA Willard, Applications of the Fusion Tree Method to Computational Geometry and Searching 1992 3 SODA Mitchell & Suri, Separation and Approximation of Polyhedral Surfaces 1992 3 SODA Goemans & Williamson, A General Approximation Technique for Constrained Forest Problems 1992 3 SODA Furer & Raghavachari, Approximating the Minimum Degree Spanning Tree to within One from the Optimal Degree 1992 3 SODA Berman & Ramaiyer, Improved Approximations for the Steiner Tree Problem 1992 3 SODA Cheriyan & Reif, Directed s-t Numberings, Rubber Bands, and Testing Digraph k-Vertex Connectivity 1992 3 SODA Kezdy & McGinness, Sequential and Parallel Algorithms to Find a K_5 Minor 1992 3 SODA Narayanan & Saran & Vazirani, Fast Parallel Algorithms for Matroid Union and Intersection, with Applications to Arboresences and Edge-Disjoint Spanning Trees 1992 3 SODA Munro & Papadakis & Sedgewick, Deterministic Skip Lists 1992 3 SODA Gonzalez, The On-line d-Dimensional Dictionary Problem 1992 3 SODA Yellin, Algorithms for Subset Testing and Finding Maximal Sets 1992 3 SODA Carlsson & Chen, The Complexity of Heaps 1992 3 SODA Alon & Azar, Comparison-Sorting and Selecting in Totally Monotone Matrices 1992 3 SODA Stein & Werman, Finding the Repeated Median Regression Line 1992 3 SODA McDiarmid & Hayward, Strong Concentration for Quicksort 1992 3 SODA Szpankowski, (Un)Expected Behavior of Typical Suffix Trees 1992 3 SODA Gusfield & Balasubramanian & Naor, Parametric Optimization of Sequence Alignment 1992 3 SODA Amir & Benson, Two-Dimensional Periodicity and its Applications 1992 3 SODA Landau & Vishkin, Pattern Matching in a Digitized Image 1992 3 SODA Albers & Hagerup, Improved Parallel Integer Sorting without Concurrent Writing 1991 2 SODA Smid, Maintaining the Minimal Distance of a Point Set in Polylogarithmic Time 1991 2 SODA Cheng & Janardan, Space-efficient Ray-shooting and Intersection Searching: Algorithms, Dynamization, and Applications 1991 2 SODA Clarkson, Approximation Algorithms for Planar Traveling Salesman Tours and Minimum-Length Triangulations 1991 2 SODA Pellegrini & Shor, Finding Stabbing Lines in 3-Dimensional Space 1991 2 SODA Hershberger & Suri, Offline Maintenance of Planar Configurations 1991 2 SODA Arkin & Kedem & Mitchell & Sprinzak & Werman, Matching Points into Noise Regions: Combinatorial Bounds and Algorithms 1991 2 SODA Cohen & Tamassia, Dynamic Expression Trees and Their Applications (Extended Abstract) 1991 2 SODA Chen & Carlsson, On Partitions and Presortedness of Sequences 1991 2 SODA Lai & Wood, Adaptive Heuristics for Binary Search Trees and Constant Linkage Cost 1991 2 SODA Dietz & Raman, Persistence, Amortization and Randomization 1991 2 SODA Driscoll & Sleator & Tarjan, Fully Persistent Lists with Catenation 1991 2 SODA Flajolet & Gonnet & Puech & Robson, The Analysis of Multidimensional Searching in Quad-Trees 1991 2 SODA Radzik & Goldberg, Tight Bounds on the Number of Minimum-Mean Cycle Cancellations and Related Results 1991 2 SODA Cohen & Megiddo, Algorithms and Complexity Analysis for Some Flow Problems 1991 2 SODA Kodialam & Orlin, Recognizing Strong Connectivity in (Dynamic) Periodic Graphs and its Relation to Integer Programaming 1991 2 SODA Berger & Cowen, Complexity Results and Algorithms for {<,<=,=}-Constrained Scheduling 1991 2 SODA Shmoys & Stein & Wein, Improved Approximation Algorithms for Shop Scheduling Problems 1991 2 SODA Chrobak & Eppstein & Italiano & Yung, Efficient Sequential and Parallel Algorithms for Computing Recovery Points in Trees and Paths 1991 2 SODA Frederickson, Optimal Algorithms for Tree Partitioning 1991 2 SODA Kelsen & Ramachandran, On Finding Minimal 2-Connected Subgraphs 1991 2 SODA Alizadeh, A Sublinear-Time Randomized Parallel Algorithm for the Maximum Clique Problem in Perfect Graphs 1991 2 SODA Heath, Edge Coloring Planar Graphs with Two Outerplanar Subgraphs 1991 2 SODA Hutton & Lubiw, Upward Planar Drawing of Single Source Acyclic Digraphs 1991 2 SODA Amir & Farach, Efficient 2-Dimensional Approximate Matching of Non-rectangular Figures 1991 2 SODA Cole, Tight Bounds on the Complexity of the Boyer-Moore String Matching Algorithm 1991 2 SODA Kalyanasundaram & Pruhs, On-Line Weighted Matching 1991 2 SODA Young, On-Line Caching as Cache Size Varies 1991 2 SODA Irani & Reingold & Westbrook & Sleator, Randomized Competitive Algorithms for the List Update Problem 1991 2 SODA Bar-Noy & Schieber, The Canadian Traveller Problem 1991 2 SODA Gil & Matias, Fast Hashing on a PRAM -- Designing by Expectation 1991 2 SODA Ramanan, A New Lower Bound Technique and Its Application: Tight Lower Bound for a Polygon Triangulation Problem 1991 2 SODA Aiello & Mihail, Learning the Fourier Spectrum of Probabilistic Lists and Trees 1991 2 SODA Karpinski & Luby, Approximating the Number of Zeroes of a GF[2] Polynomial 1991 2 SODA McKay & Radziszowski, The First Classical Ramsey Number for Hypergraphs is Computed 1991 2 SODA Csirik & Johnson, Bounded Space On-Line Bin Packing: Best is Better than First 1991 2 SODA Linial & Saks, Decomposing Graphs into Regions of Small Diameter 1991 2 SODA Miller & Vavasis, Density Graphs and Separators 1991 2 SODA Kannan & Warnow, Triangulating Three-Colored Graphs 1991 2 SODA Bhatt & Greenberg & Leighton & Liu, Tight Bounds for On-Line Tree Embeddings 1991 2 SODA Saks & Shavit & Woll, Optimal Time Randomized Consensus -- Making Resilient Algorithms Fast in Practice 1991 2 SODA Ma & Spinrad, An O(n^2) Time Algorithm for the 2-Chain Cover Problem and Related Problems 1991 2 SODA Berger, The Fourth Moment Method 1991 2 SODA Bini & Pan, Parallel Complexity of Tridiagonal Symmetric Eigenvalue Problem 1991 2 SODA Atallah & Kosaraju, An Efficient Parallel Algorithm for the Row Minima of a Totally Monotone Matrix 1991 2 SODA Broder & Karlin & Raghavan & Upfal, On the Parallel Complexity of Evaluating Game Trees 1991 2 SODA MacKenzie & Stout, Ultra-Fast Expected Time Parallel Algorithms 1991 2 SODA Spencer, Time-Work Tradeoffs for Parallel Graph Algorithms 1991 2 SODA Chandru & Venkataraman, Circular Hulls and Orbiforms of Simple Polygons 1991 2 SODA Chazelle & Edelsbrunner & Guibas & Sharir & Snoeyink, Computing a Face in an Arrangement of Line Segments 1991 2 SODA Agarwal & Sharir, Planar Geometric Location Problems and Maintaining the Width of a Planar Set 1991 2 SODA Czyzowicz & Egyed & Everett & Rappaport & Shermer & Souvaine & Toussaint & Urrutia, The Aquarium Keeper's Problem 1991 2 SODA Birk & Lotspiech, A Fast Algorithm for Connecting Grid Points to the Boundary With Nonintersecting Straight Lines 1991 2 SODA Formann & Wagner & Wagner, Routing through a Dense Channel With Minimum Total Wire Length 1990 1 SODA Eppstein & Italiano & Tamassia & Tarjan & Westbrook & Yung, Maintenance of a Minimum Spanning Forest in a Dynamic Planar Graph 1990 1 SODA Ausiello & Nanni & Italiano & Marchetti Spaccamela & Nanni, Incremental Algorithms for Minimal Length Paths 1990 1 SODA Buchsbaum & Kanellakis & Vitter, A Data Structure for Arc Insertion and Regular Path Finding 1990 1 SODA Alpern & Hoover & Rosen & Sweeney & Zadeck, Incremental Evaluation of Computational Circuits 1990 1 SODA Broder & Karlin, Multilevel Adaptive Hashing 1990 1 SODA La Poutre, New Techniques for the Union-Find Problem 1990 1 SODA Yellin, Representing Sets with Constant Time Equality Testing 1990 1 SODA Cheng & Janardan, Efficient Maintenance of the Union Intervals on a Line, with Applications 1990 1 SODA Supowit, New Techniques for Some Dynamic Closest-Point and Farthest-Point Problems 1990 1 SODA Bentley, Experiments on Traveling Salesman Heuristics 1990 1 SODA Paterson & Yao, Optimal Binary Space Partitions for Orthogonal Objects 1990 1 SODA Bern & Dobkin & Eppstein & Grossman, Visibility with a Moving Point of View 1990 1 SODA Goodrich, Applying Parallel Processing Techniques to Classification Problems in Constructive Solid Geometry 1990 1 SODA Arkin & Chew & Huttenlocher & Kedem & Mitchell, An Efficiently Computable Metric for Comparing Polygonal Shapes 1990 1 SODA Schnyder, Embedding Planar Graphs on the Grid 1990 1 SODA Lou & Sarrafzadeh & Lee, An Optimal Algorithm for the Maximum Two-Chain Problem 1990 1 SODA Drysdale, A Practical Algorithm for Computing the Delaunay Triangulation for Convex Distance Functions 1990 1 SODA Guibas & Hershberger & Snoeyink, Compact Interval Trees: A Data Structure for Convex Hulls 1990 1 SODA Bentley & Clarkson & Levine, Fast Linear Expected-Time Algorithms for Computing Maxima and Convex Hulls 1990 1 SODA Cremona & Landau, Shrinking Lattice Polyhedra 1990 1 SODA Hafner & McCurley, Asymptotically Fast Triangularization of Matrices Over Rings 1990 1 SODA Bach & Driscoll & Shallit, Factor Refinement 1990 1 SODA Beame & Luby, Parallel Search for Maximal Independence Given Minimal Dependence 1990 1 SODA Goldberg & Spencer, An Efficient Parallel Algorithm that Finds Independent Sets of Guaranteed Size 1990 1 SODA Morgenstern & Shapiro, Coloration Neighborhood Structures for General Graph Coloring 1990 1 SODA Berger & Shor, Approximation Algorithms for the Maximum Acyclic Subgraph Problem 1990 1 SODA Dahlhaus & Karpinski & Novick, Fast Parallel Algorithms for the Clique Separator Decomposition 1990 1 SODA Ma & Spinrad, Split Decomposition of Undirected Graphs 1990 1 SODA Rhee & Talagrand, Packing Random Items of Three Colors 1990 1 SODA Coffman & Flatto & Leighton, First-Fit Storage of Linear Lists: Tight Probabilistic Bounds on Wasted Space 1990 1 SODA Berman & Karloff & Tardos, A Competitive 3-Server Algorithm 1990 1 SODA Chrobak & Karloff & Payne & Vishwanathan, New Results on Server Problems 1990 1 SODA Karlin & Manasse & McGeoch & Owicki, Competitive Randomized Algorithms for Non-Uniform Problems 1990 1 SODA Larmore & Hirschberg, Length-Limited Coding 1990 1 SODA Manber & Myers, Suffix Arrays: A New Method for On-Line String Searches 1990 1 SODA Baeza-Yates & Gonnet & Regnier, Analysis of Boyer-Moore-Type String Searching Algorithms 1990 1 SODA Amir & Landau & Vishkin, Efficient Pattern Matching with Scaling 1990 1 SODA Shamir & Dietrich, Characterization and Algorithms for Greedily Solvable Transportation Problems 1990 1 SODA Plotkin & Tardos, Improved Dual Network Simplex 1990 1 SODA Norton & Plotkin & Tardos, Using Separation Algorithms in Fixed Dimension 1990 1 SODA Goemans & Bertsimas, On the Parsimonious Property of Connectivity Problems 1990 1 SODA Knuth & Motwani & Pittel, Stable Husbands 1990 1 SODA Papadimitriou & Sideri, The Bisection Width of Grid Graphs 1990 1 SODA Kanevsky, On the Number of Minimum Size Separating Vertex Sets of a Graph and How to Find All of Them 1990 1 SODA Gusfield & Naor, Efficient Algorithms for Generalized Cut Trees 1990 1 SODA Gabow, Data Structures for Weighted Matching and Nearest Common Ancestors with Linking 1990 1 SODA Suzuki & Akama & Nishizeki, Finding Steiner Forests in Planar Graphs 1990 1 SODA Roychowdhury & Bruck, On Finding Non-Intersecting Paths in Grids and Its Application in Reconfiguring VLSI/WSI Arrays 1990 1 SODA Wieners-Lummer, Manhattan Channel Routing with Good Theoretical and Practical Performance 1990 1 SODA Kannan & Lawler & Warnow, Determining the Evolutionary Tree 1990 1 SODA Klawe, Superlinear Bounds on Matrix Searching 1990 1 SODA Kravets & Park, Selection and Sorting in Totally Monotone Arrays 1990 1 SODA Larmore & Schieber, On-Line Dynamic Programming with Applications to the Prediction of RNA Secondary Structure 1990 1 SODA Eppstein & Galil & Giancarlo & Italiano, Sparse Dynamic Programming 1986 SODERSETAL Banerji & Brzozowski, On Translation Algorithms in Residue Number Systems 1986 SODERSETAL O'Keefe, A Note on Fast Base Extension for Residue Number Systems with Three Moduli 1986 SODERSETAL Gregory & Matula, Base Conversion in Residue Number Systems 1986 SODERSETAL Jenkins, Techniques for Residue-to-Analog Conversion for Residue-Enclosed Digital Filters 1986 SODERSETAL Baraniecka & Jullien, On Decoding Techniques for Residue Number System Realizations of Digital Signal Processing 1986 SODERSETAL Taylor & Ramnarayanan, An Efficient Residue-to-Decimal Converter 1986 SODERSETAL Soderstrand & Vernia & Chang, An Improved Residue Number System Digital-to-Analog Converter 1986 SODERSETAL Kinoshita & Kosako & Kojima, General Division in the Symmetric Residue Number System 1986 SODERSETAL Yau & Chung, On the Design of Modulo Arithmetic Units Based on Cyclic Groups 1986 SODERSETAL Agrawal & Rao, Modulo (2^n + 1) Arithmetic Logic 1986 SODERSETAL Miller & Polky & King, A Survey of Soviet Developments in Residue Number Theory Applied to Digital Filtering 1986 SODERSETAL Miller & Altschul & King & Polky, Analysis of the Residue Class Core Function of Akushskii, Burcev, and Pak 1986 SODERSETAL , Residue Number System Arithmetic Bibliography 1995 22 SOFSEM Wiedermann, Parallel Machine Models: How They Are and Where Are They Going 1995 22 SOFSEM Hajek, Fuzzy Logic From the Logical Point of View 1995 22 SOFSEM Tel, Sense of Direction in Processor Networks 1995 22 SOFSEM Siegelmann, Welcoming the Super Turing Theories 1995 22 SOFSEM Horne & Siegelmann & Giles, What NARX Networks Can Compute 1995 22 SOFSEM Jeffery, Database: Introduction to Problems 1995 22 SOFSEM Grimson, Distributed Information Systems 1995 22 SOFSEM Paton, Extending Database Technology 1995 22 SOFSEM Marshall, WWW -- The World Wide Web 1995 22 SOFSEM Li, A Simple and Efficient Incremental LL(1) Parsing 1995 22 SOFSEM Lucas, Fundamentals of Context-Sensitive Rewriting 1995 22 SOFSEM Motyckova, Maximum Flow Problem in Distributed Environment 1995 22 SOFSEM Sima, Hopfield Languages 1997 27 SOFTPREX Kantorowitz, Algorithm Simplification through Object Orientation 1996 26 SOFTPREX Jokinen & Tarhio & Ukkonen, A Comparison of Approximate String Matching Algorithms 1996 26 SOFTPREX Yu, Data Compression for PC Software Distribution 1996 26 SOFTPREX Goodwin & Wilken, Optimal and Near-optimal Global Register Allocation Using 0-1 Integer Programming 1995 25 SOFTPREX Madsen, Open Issues in Object-oriented Programming--A Scandinavian Perspective 1995 25 SOFTPREX Koenig & Stroustrup, Foundations for Native C++ Styles 1995 25 SOFTPREX Boehm & Atkinson & Plass, Ropes: An Alternative to Strings 1995 25 SOFTPREX Luders & Ernst & Stille, An Approach to Automatic Display Layout Using Combinatorial Optimization Algorithms 1995 25 SOFTPREX Hsu & Zwarico, Automatic Synthesis of Compression Techniques for Heterogeneous Files 1995 25 SOFTPREX Yehudai & Libedinsky, On Tuning Recursive Procedures 1995 25 SOFTPREX Zobel & Moffat, Adding Compression to a Full-text Retrieval System 1995 25 SOFTPREX Lecroq, Experimental Results on String Matching Algorithms 1995 25 SOFTPREX Mazzeo & Villano, Parallel 1D-FFT Computation on Constant-valence Multicomputers 1995 25 SOFTPREX Zobel & Dart, Finding Approximate Matches in Large Lexicons 1995 25 SOFTPREX Andersson & Nilsson, Efficient Implementation of Suffix Trees 1995 25 SOFTPREX Brinch Hansen, The Long Division Algorithm of Linger, Mills and Witt 1994 24 SOFTPREX Henderson & Zorn, A Comparison of Object-oriented Programming in Four Modern Languages 1994 24 SOFTPREX Asthagiri & Potter, Parallel Context-sensitive Compilation 1994 24 SOFTPREX MacGregor & Grover, Optimized k-shortest-paths Algorithm for Facility Restoration 1994 24 SOFTPREX Buhr & Till & Zarnke, Assignments as the Sole Means of Updating Objects 1994 24 SOFTPREX Brinch Hansen, Multiple-length Division Revisited: a Tour of the Minefield 1994 24 SOFTPREX Snow & Whitfield, Simple Authentication 1994 24 SOFTPREX Brinch Hansen, The Programming Language SuperPascal 1994 24 SOFTPREX Wright, Approximate String Matching using Within-word Parallelism 1994 24 SOFTPREX Smith, On Tuning the Boyer-Moore-Horspool String Searching Algorithm 1994 24 SOFTPREX Morimoto & Iriguchi & Aoe, A Method of Compressing Trie Structures 1994 24 SOFTPREX Gordon, A Faster Scrabble Move Generation Algorithm 1994 24 SOFTPREX Kim & Shawe-Taylor, Fast String Matching using an n-gram Algorithm 1994 24 SOFTPREX Dyreson & Snodgrass, Efficient Timestamp Input and Output 1993 23 SOFTPREX Bentley & McIlroy, Engineering a Sort Function 1993 23 SOFTPREX Abuali & Wainwright, ISA[k] Trees: a Class of Binary Search Trees with Minimal or Near Minimal Internal Path Length 1993 23 SOFTPREX Bloesch, Aesthetic Layout of Generalized Trees 1993 23 SOFTPREX Bell & Kulp, Longest-match String Searching for Ziv-Lempel Compression 1993 23 SOFTPREX Drizis, A Method for Fast Tape Backups and Restores 1993 23 SOFTPREX Bell & Gupta, An Evaluation of Self-adjusting Binary Search Tree Techniques 1993 23 SOFTPREX Reingold & Dershowitz & Clamen, Calendrical Calculations, II: Three Historical Calendars 1993 23 SOFTPREX Darragh & Cleary & Witten, Bonsai: A Compact Representation of Trees 1992 22 SOFTPREX Raita, Tuning the Boyer-Moore-Horspool String Searching Algorithm 1992 22 SOFTPREX Aoe & Morimoto & Sato, An Efficient Implementation of Trie Structures 1992 22 SOFTPREX Ogle & Sullivan & Williams, Practical Experience with OS/2 Installable File Systems 1992 22 SOFTPREX Hashemi & Leach, Issues in Porting Software from C to C++ 1992 22 SOFTPREX Cunto & Munro & Rey, Selecting the Median and Two Quartiles in a Set of Numbers 1991 21 SOFTPREX Fruchterman & Reingold, Graph Drawing by Force-directed Placement 1991 21 SOFTPREX Hume & Sunday, Fast String Searching 1991 21 SOFTPREX Dundas, Implementing Dynamic Minimal-prefix Tries 1991 21 SOFTPREX Smith, Experiments with a Very Fast Substring Search Algorithm 1991 21 SOFTPREX Andersson, A Note on Searching in a Binary Search Tree 1991 21 SOFTPREX Ramachandran & Khalidi, An Implementation of Distributed Shared Memory 1991 21 SOFTPREX Norvig, Correcting a Widespread Error in Unification Algorithms 1991 21 SOFTPREX Chang & Wu, A Letter-oriented Perfect Hashing Scheme Based upon Sparse Table Compression 1990 20 SOFTPREX Du & Wadge, The Eductive Implementation of a Three-dimensional Spreadsheet 1990 20 SOFTPREX Burton & Yang, Manipulating Multilinked Data Structures in a Pure Functional Language 1990 20 SOFTPREX Barbosa & Lima, On the Distributed Parallel Simulation of Hopfield's Neural Networks 1990 20 SOFTPREX Dershowitz & Reingold, Calendrical Calculations 1990 20 SOFTPREX Walker, A Node-positioning Algorithm for General Trees 1990 20 SOFTPREX Mullin & Margoliash, A Tale of Three Spelling Checkers 1990 20 SOFTPREX McKenzie & Harries & Bell, Selecting a Hashing Algorithm 1989 19 SOFTPREX Leblanc & Mellor-Crummey & Gafter & Crowl & Dibble, The Elmwood Multiprocessor Operating System 1989 19 SOFTPREX Grosch, Efficient Generation of Lexical Analysers 1989 19 SOFTPREX Park & Kim, A Selection Algorithm with a Practical Upper Bound on Expected Number of Comparisons 1989 19 SOFTPREX McGlinn, A Parallel Version of Cook and Kim's Algorithm for Presorted Lists 1989 19 SOFTPREX Brain & Tharp, Near-perfect Hashing of Large Word Sets 1989 19 SOFTPREX Knuth, The Errors of TeX 1989 19 SOFTPREX Baeza-Yates, Improved String Searching 1989 19 SOFTPREX Thimbleby, Using Sentinels in Insert Sort 1989 19 SOFTPREX Allison, Circular Programs and Self-referential Structures 1989 19 SOFTPREX Appel, Simple Generational Garbage Collection and Fast Allocation 1989 19 SOFTPREX Moffat, Word-based Text Compression 1988 18 SOFTPREX Cornelius, Problems with the Language Modula-2 1988 18 SOFTPREX Owolabi & McGregor, Fast Approximate String Matching 1986 SOFTPREX Davies & Bowsher, Algorithms for Pattern Matching 1985 15 SOFTPREX Miller & Myers, A File Comparison Program 1980 10 SOFTPREX Horspool, Practical Fast Searching in Strings 1996 8 SPAA Goudreau & Lang & Tsantilas, Towards Efficiency and Portability: Programming with the BSP Model 1996 8 SPAA Wijshoff & Juurlink, A Quantitative Comparison of Parallel Computation Models 1996 8 SPAA Bilardi & Herley & Pietracaprina & Pucci & Spirakis, BSP vs LogP 1996 8 SPAA Shavit & Upfal & Zemach, A Steady State Analysis of Diffracting Trees 1996 8 SPAA Adler, Asynchronous Shared Memory Search Structures 1996 8 SPAA Andrews & Leighton & Metaxas & Zhang, Improved Methods for Hiding Latency in High Bandwidth Networks 1996 8 SPAA Subhlok & Vondran, Optimal Latency-Throughput Tradeoffs for Data Parallel Pipelines 1996 8 SPAA Ghosh & Muthukrishnan & Schultz, First and Second Order Diffusive Methods for Rapid, Coarse, Distributed Load Balancing 1996 8 SPAA Deng & Dymond, On Multiprocessor System Scheduling 1996 8 SPAA Squillante & Wang & Papaefthymiou, An Analysis of Gang Scheduling for Multiprogrammed Parallel Computing 1996 8 SPAA Schwabe & Sutherland, Flexible Usage of Parity Storage Space in Disk Arrays 1996 8 SPAA Barve & Grove & Vitter, Simple Randomized Mergesort on Parallel Disks 1996 8 SPAA Sarkar & Simons, Anticipatory Instruction Scheduling 1996 8 SPAA Cole & Maggs & Sitaraman, On the Benefit of Supporting Virtual Channels in Wormhole Routers 1996 8 SPAA Scheideler & Vocking, Universal Continuous Routing Strategies 1996 8 SPAA Rehrmann & Monien & Luling & Diekmann, On the Communication Throughput of Buffered Multistage Interconnection Networks 1996 8 SPAA Mitzenmacher, Constant Time per Edge is Optimal on Rooted Tree Networks 1996 8 SPAA Avior & Calamoneri & Even & Litman & Rosenberg, A Tight Layout of the Butterfly Network 1996 8 SPAA Rappoport, On the Slowdown of Efficient Simulations of Multibutterflies on Butterflies and Butterfly-Derived Networks 1996 8 SPAA Fraigniaud & Gavoille, Local Memory Requirement of Universal Routing Schemes 1996 8 SPAA Sohn & Biswas & Simon, A Dynamic Load Balancing Framework for Unstructured Adaptive Computations on Distributed-Memory Multiprocessors 1996 8 SPAA Kessler & Traff, A Library of Basic PRAM Algorithms and its Implementation in FORK 1996 8 SPAA Buhr & Goel & Nishimura & Ragde, muDatabase: Parallelism in a Memory-Mapped Environment 1996 8 SPAA Stricker & Hardwick, From AAPC Algorithms to High Performance Permutation Routing and Sorting 1996 8 SPAA Hutchinson & Kuttner & Lanthier & Maheshwari & Nussbaum & Roytenberg & Sack, Parallel Neighborhood Modeling 1996 8 SPAA Cherkasova & Davis & Hodgson & Kotov & Robinson & Rokicki, Components of Congestion Control 1996 8 SPAA Helman & Bader & JaJa, Parallel Algorithms for Personalized Communication and Sorting with an Experimental Study 1996 8 SPAA Gerbessiotis & Siniolakis, Deterministic Sorting and Randomized Median Finding on the BSP Model 1996 8 SPAA Baumker & Dittrich, Fully Dynamic Search Trees for an Extension of the BSP Model 1996 8 SPAA Cole & Klein & Tarjan, Finding Minimum Spanning Forests in Logarithmic Time and Linear Work Using Random Sampling 1996 8 SPAA Sen, Parallel Multidimensional Search Using Approximation Algorithms: With Applications to Linear-Programming and Related Problems 1996 8 SPAA Stemann, Parallel Balanced Allocations 1996 8 SPAA Aumann & Bender & Zhang, Efficient Execution of Nondeterministic Parallel Programs on Asynchronous Systems 1996 8 SPAA Iftode & Singh & Li, Scope Consistency: A Bridge Between Release Consistency and Entry Consistency 1996 8 SPAA Park & Dill, Verification of FLASH Cache Coherence Protocol by Aggregation of Distributed Transactions 1996 8 SPAA Blumofe & Frigo & Joerg & Leiserson & Randall, An Analysis of Dag-Consistent Distributed Shared-Memory Algorithms 1996 8 SPAA Gao & Rosenberg & Sitaraman, On Trading Task Reallocation for Thread Management in Partitionable Multiprocessors 1996 8 SPAA Hummel & Schmidt & Uma & Wein, Load-Sharing via Weighted Factoring 1996 8 SPAA Chakrabarti & Muthukrishnan, Resource Scheduling for Parallel Database and Scientific Applications 1995 7 SPAA Blelloch & Gibbons & Matias, Provably Efficient Scheduling for Languages with Fine-Grained Parallelism 1995 7 SPAA Leiserson & Randall, Parallel Algorithms for the Circuit Value Update Problem 1995 7 SPAA Dyer & Nash & Dew, An Optimal Randomized Planar Convex Hull Algorithm with Good Empirical Performance 1995 7 SPAA Dehne & Deng & Dymond & Fabri & Khokhar, A Randomized Parallel 3D Convex Hull Algorithm For Coarse Grained Multicomputers 1995 7 SPAA Park & Dill, An Executable Specification, Analyzer and Verifier for RMO (Relaxed Memory Order) 1995 7 SPAA Brewer & Chong & Liu & Sharma & Kubiatowicz, Remote Queues: Exposing Message Queues for Optimization and Atomicity 1995 7 SPAA Shavit & Touitou, Elimination Trees and the Construction of Pools and Stacks (Preliminary Version) 1995 7 SPAA Bruck & Dolev & Ho & Rosu & Strong, Efficient Message Passing Interface (MPI) for Parallel Computing on Clusters of Workstations 1995 7 SPAA Chakrabarti & Demmel & Yelick, Modeling the Benefits of Mixed Data and Task Parallelism 1995 7 SPAA Blelloch & Gibbons & Matias & Zagha, Accounting for Memory Bank Contention and Delay in High-Bandwidth Multiprocessors 1995 7 SPAA Alexandrov & Ionescu & Schauser & Scheiman, LogGP: Incorporating Long Messages into the LogP Model -- One step closer towards a realistic model for parallel computation 1995 7 SPAA Leighton & Ma & Suel, On Probabilistic Networks for Selection, Merging, and Sorting 1995 7 SPAA Meyer auf der Heide & Storch & Wanka, Optimal Trade-Offs Between Size and Slowdown for Universal Parallel Networks 1995 7 SPAA Adler & Byers & Karp, Parallel Sorting With Limited Bandwidth 1995 7 SPAA Meyer auf der Heide & Scheideler, Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract) 1995 7 SPAA Cypher, The Communication Requirements of Mutual Exclusion 1995 7 SPAA Ramakrishnan & Scherson & Subramanian, Efficient Techniques for Fast Nested Barrier Synchronization 1995 7 SPAA Stamatopoulos & Solworth, Universal Congestion Control for Meshes 1995 7 SPAA Schwiebert & Jayasimha, A Universal Proof Technique for Deadlock-Free Routing in Interconnection Networks 1995 7 SPAA Bilardi & Preparata, Upper Bounds to Processor-Time Tradeoffs under Bounded-Speed Message Propagation 1995 7 SPAA Greenberg, Finding Connected Components on a Scan Line Array Processor 1995 7 SPAA Sundaram & Eager, Future Applicability of Bus-Based Shared Memory Multiprocessors 1995 7 SPAA Reif, Parallel Molecular Computation 1995 7 SPAA Chong & Lam, Approximating Biconnectivity in Parallel 1995 7 SPAA Annexstein & Swaminathan, On Testing Consecutive-Ones Property in Parallel 1995 7 SPAA Farach & Muthukrishnan, Optimal Parallel Dictionary Matching and Compression (Extended Abstract) 1995 7 SPAA MacKenzie, Lower Bounds for Randomized Exclusive Write PRAMs 1995 7 SPAA Durand & Jain & Tseytlin, Applying Randomized Edge Coloring Algorithms to Distributed Communication: An Experimental Study 1995 7 SPAA Nesson & Johnsson, ROMM Routing on Mesh and Torus Networks 1995 7 SPAA Cormen & Bruhl, Don't Be Too Clever: Routing BMMC Permutations on the MasPar MP-2 (Extended Abstract) 1995 7 SPAA Kim & Veidenbaum, On Shortest Path Routing in Single Stage Shuffle-Exchange Networks 1994 6 SPAA Halperin & Zwick, An Optimal Randomized Logarithmic Time Connectivity Algorithm for the EREW PRAM 1994 6 SPAA Cole & Klein & Tarjan, A Linear-Work Parallel Algorithm for Finding Minimum Spanning Trees 1994 6 SPAA Greiner, A Comparison of Parallel Algorithms for Connected Components 1994 6 SPAA Suel, Improved Bounds for Routing and Sorting on Multi-Dimensional Meshes 1994 6 SPAA Ierardi, 2D-Bubblesorting in Average Time O(sqrt(N lg N)) 1994 6 SPAA Li & Sevcik, Parallel Sorting by Overpartitioning 1994 6 SPAA Suciu & Tannen, Efficient Compilation of High-Level Data Parallel Algorithms 1994 6 SPAA Rockoff, SIMD Instruction Cache 1994 6 SPAA Schwabe & Sutherland, Improved Parity-Declustered Layouts for Disk Arrays 1994 6 SPAA Bhatt & Chung & Leighton & Rosenberg, Scheduling Trees Using FIFO Queues: A Control-Memory Tradeoff 1994 6 SPAA Feldmann & Mysliwietz & Monien, Studying Overheads in Massively Parallel MIN/MAX-Tree Evaluation 1994 6 SPAA Reid-Miller, List Ranking and List Scan on the CRAY C-90 1994 6 SPAA Reif & Tate, Dynamic Parallel Tree Contraction 1994 6 SPAA Liu & Bhatt, Experiences with Parallel N-body Simulation 1994 6 SPAA Kruskal & Rappoport, Bandwidth-Based Lower Bounds on Slowdown for Efficient Emulations of Fixed-Connection Networks 1994 6 SPAA Adler & Byers, AT^2 Bounds for a Class of VLSI Problems and String Matching 1994 6 SPAA Goldberg & Jerrum & MacKenzie, An Omega(sqrt log log n) Lower Bound for Routing in Optical Networks 1994 6 SPAA Attiya & Friedman, Programming DEC-Alpha Based Multiprocessors The Easy Way 1994 6 SPAA Shavit & Zemach, Diffracting Trees 1994 6 SPAA Gibbons & Korach, On Testing Cache-Coherent Shared Memories 1994 6 SPAA Singh & Rothberg & Gupta, Modeling Communication in Parallel Algorithms: A Fruitful Interaction between Theory and Systems? 1994 6 SPAA Turek & Ludwig & Wolf & Fleischer & Tiwari & Glasgow & Schweigelshohn & Yu, Scheduling Parallelizable Tasks to Minimize Average Response Time 1994 6 SPAA Fizzano & Karger & Stein & Wein, Job Scheduling in Rings 1994 6 SPAA Subramanian & Scherson, An Analysis of Diffusive Load-Balancing 1994 6 SPAA Ghosh & Muthukrishnan, Dynamic Load Balancing in Parallel and Distributed Networks by Random Matchings 1994 6 SPAA Gibbons & Matias & Ramachandran, Efficient Low-Contention Parallel Algorithms 1994 6 SPAA Pietracaprina & Pucci & Sibeyn, Constructive Deterministic PRAM Simulation on a Mesh-Connected Computer 1994 6 SPAA Goldberg & Matias & Rao, An Optical Shared Memory Simulation 1994 6 SPAA Tamaki, Construction of the Mesh and the Torus Tolerating a Large Number of Faults 1994 6 SPAA Reif, O(log^2 n) Time Efficient Parallel Factorization of Dense, Sparse Separable, and Banded Matrices 1994 6 SPAA Leoncini, How Much Can We Speedup Gaussian Elimination with Pivoting? 1994 6 SPAA Bruck & Ho & Kipnis & Weathersby, Efficient Algorithms for All-to-All Communications in Multi-Port Message-Passing Systems 1994 6 SPAA Hinrichs & Kosak & O'Hallaron & Stricker & Take, An Architecture for Optimal All-to-All Personalized Communication 1994 6 SPAA Gupta & Sadayappan, Communication Efficient Matrix Multiplication on Hypercubes 1994 6 SPAA Savage, A Model for Multi-Grained Parallelism 1994 6 SPAA Stamatopoulos & Solworth, Increasing Network Bandwidth on Meshes 1994 6 SPAA Mitzenmacher, Bounds on the Greedy Routing Algorithm for Array Networks 1994 6 SPAA Chinn & Leighton & Tompa, Minimal Adaptive Routing on the Mesh with Bounded Queue Size 1994 6 SPAA Konstantinidou, Segment Router: A Novel Router Design for Parallel Computers 1992 4 SPAA Berman & Gravano & Pifarre & Sanz, Adaptive Deadlock- and Livelock-Free Routing with All Minimal Paths in Torus Networks 1992 4 SPAA Bar-Noy & Kipnis, Designing Broadcasting Algorithms in the Postal Model for Message-Passing Systems (Extended Abstract) 1992 4 SPAA Kaklamanis & Krizanc & Rao, Simple Path Selection for Optimal Routing on Processor Arrays (Extended Abstract) 1992 4 SPAA Kaufmann & Rajasekaran & Sibeyn, Matching the Bisection Bound for Routing and Sorting on the Mesh (extended abstract) 1992 4 SPAA Gereb-Graus & Tsantilas, Efficient Optical Communication in Parallel Computers 1992 4 SPAA Kaklamanis & Krizanc, Optimal Sorting on Mesh-Connected Processor Arrays (Extended Abstract) 1992 4 SPAA Even & Litman, Layered Cross Product -- A Technique to Construct Interconnection Networks 1992 4 SPAA Plaxton & Suel, A Lower Bound for Sorting Networks Based on the Shuffle Permutation 1992 4 SPAA Chamberlain & Fiduccia, Universality of Iterated Networks 1992 4 SPAA Brady & Yong, Fast Parallel Discrete Approximation Algorithms for the Radon Transform 1992 4 SPAA Hambrusch & He & Miller, Parallel Algorithms for Gray-Scale Image Component Labeling on a Mesh-Connected Computer 1992 4 SPAA Mayr & Werchner, Optimal Routing of Parentheses on the Hypercube 1992 4 SPAA Kaklamanis & Persiano, Branch-and-Bound and Backtrack Search on Mesh-Connected Arrays of Processors (Extended Abstract) 1992 4 SPAA Ranade, Maintaining Dynamic Ordered Sets on Processor Networks 1992 4 SPAA Yu & Ghosal, Optimal Dynamic Scheduling of Task Tree on Constant-dimensional Architectures (Extended Abstract) 1992 4 SPAA Stricker, Supporting the Hypercube Programming Model on Mesh Architectures (A Fast Sorter for iWarp Tori) 1992 4 SPAA Hightower & Prins & Reif, Implementations of Randomized Sorting on Large Parallel Machines (Preliminary Version) 1992 4 SPAA Anderson & Setubal, On the Parallel Implementation of Goldberg's Maximum Flow Algorithm 1992 4 SPAA Narendran & Tiwari, Polynomial Root-Finding: Analysis and Computational Investigation of a Parallel Algorithm (Extended Abstract) 1992 4 SPAA Subramonian, Designing Synchronous Algorithms for Asynchronous Processors 1992 4 SPAA Anderson, Primitives for Asynchronous List Compression 1992 4 SPAA Feldmann & Gross & O'Hallaron & Stricker, Subset Barrier Synchronization on a Private-Memory Parallel System 1992 4 SPAA Herlihy & Lim & Shavit, Low Contention Load Balancing on Large-Scale Multiprocessors 1992 4 SPAA Pippenger & Lin, Fault-Tolerant Circuit-Switching Networks 1992 4 SPAA Toledo, Competitive Fault-Tolerance in Area-Universal Networks 1992 4 SPAA Tamaki, Robust Bounded-Degree Networks with Small Diameters 1992 4 SPAA Gibbons & Paterson, Dense Edge-Disjoint Embedding of Binary Trees in the Mesh 1992 4 SPAA Wilson, Embedding Leveled Hypercube Algorithms into Hypercubes (Extended Abstract) 1992 4 SPAA Leiserson & Abuhamdeh & Douglas & Feynmann & Ganmukhi & Hill & Hillis & Kuszmaul & St. Pierre & Wells & Wong & Yang & Zak, The Network Architecture of the Connection Machine CM-5 (Extended Abstract) 1992 4 SPAA Chong & Knight, Design and Performance of Multipath MIN Architectures 1992 4 SPAA Dickey & Kenner, Hardware Combining and Scalability 1992 4 SPAA Gibbons & Merritt, Specifying Nonblocking Shared Memories (Extended Abstract) 1992 4 SPAA Arnold & Buell & Davis, Splash 2 1992 4 SPAA Turek & Wolf & Yu, Approximate Algorithms for Scheduling Parallelizable Tasks 1992 4 SPAA Backes & Schwiegelshohn & Thiele, Analysis of Free Schedule in Periodic Graphs 1992 4 SPAA Armon & Reif, Space and Time Efficient Implementations of Parallel Nested Dissection 1992 4 SPAA Han & Pan & Reif, Efficient Parallel Algorithms for Computing All Pair Shortest Paths in Directed Graphs 1992 4 SPAA Johnson & Metaxas, A Parallel Algorithm for Computing Minimum Spanning Trees 1992 4 SPAA Karger & Nisan & Parnas, Fast Connected Components Algorithms for the EREW PRAM 1992 4 SPAA Grove, Connected Components and the Interval Graph 1992 4 SPAA Vemuri & Varadarajan & Mayya, An Efficient Expected Time Parallel Algorithm for Voronoi Construction 1992 4 SPAA Pan & Preparata, Supereffective Slow-Down of Parallel Algorithms 1992 4 SPAA Furer & He & Kao & Raghavachari, O(n log log n)-Work Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs 1992 4 SPAA Frieze & Miller & Teng, Separator Based Parallel Divide and Conquer in Computational Geometry 1992 4 SPAA Guattery & Miller, A Contraction Procedure for Planar Directed Graphs 1991 3 SPAA Blelloch & Leiserson & Maggs & Plaxton & Smith & Zagha, A Comparison of Sorting Algorithms for the Connection Machine CM-2 1991 3 SPAA Kaklamanis & Krizanc & Narayanan & Tsantilas, Randomized Sorting and Selection on Mesh-Connected Processor Arrays (Preliminary Version) 1991 3 SPAA Nodine & Vitter, Large-Scale Sorting in Parallel Memories (extended abstract) 1991 3 SPAA Ranade, Optimal Speedup for Backtrack Search on a Butterfly Network 1991 3 SPAA Bast & Hagerup, Fast and Reliable Parallel Hashing 1991 3 SPAA Chaudhuri, Tight Bounds for the Chaining Problem 1991 3 SPAA Larmore & Przytycka, Parallel Construction of Trees with Optimal Weighted Path Length 1991 3 SPAA Spencer, More Time-Work Tradeoffs for Parallel Graph Algorithms 1991 3 SPAA Draper, An Overview of Supertoroidal Networks 1991 3 SPAA Lee & Ramachandran, Architectural Primitives for a Scalable Shared Memory Multiprocessor 1991 3 SPAA Lee & Flynn, Architectural Mechanisms to Support Three-Dimensional Lattice Gas Simulations 1991 3 SPAA Aiello & Leighton, Coding Theory, Hypercube Embeddings, and Fault Tolerance 1991 3 SPAA Obrenic, Embedding de Bruijn and Shuffle-Exchange Graphs in Five Pages (preliminary version) 1991 3 SPAA Monien, Simulating Binary Trees on X-Trees (Extended Abstract) 1991 3 SPAA Obrenic, An Approach to Emulating Separable Graphs (preliminary version) 1991 3 SPAA Goodrich, Constructing Arrangements Optimally in Parallel (Preliminary Version) 1991 3 SPAA Kaltofen & Pan, Processor Efficient Parallel Solution of Linear Systems over an Abstract Field 1991 3 SPAA Ghouse & Goodrich, In-Place Techniques for Parallel Convex Hull Algorithms (Preliminary Version) 1991 3 SPAA Atallah & Dehne & Miller & Rau-Chaplin & Tsay, Multisearch Techniques for Implementing Data Structures on a Mesh-Connected Computer (Preliminary Version) 1991 3 SPAA Prasanna & Musicus, Generalised Multiprocessor Scheduling Using Optimal Control 1991 3 SPAA Herlihy & Moss, Lock-Free Garbage Collection for Multiprocessors 1991 3 SPAA Rudolph & Slivkin-Allalouf & Upfal, A Simple Load Balancing Scheme for Task Allocation in Parallel Machines 1991 3 SPAA Stamoulis & Tsitsiklis, The Efficiency of Greedy Routing in Hypercubes and Butterflies 1991 3 SPAA Kunde, Balanced Routing: Towards the Distance Bound on Grids 1991 3 SPAA Lin & Pippenger, Parallel Algorithms for Routing in Non-blocking Networks 1991 3 SPAA Pifarre & Gravano & Felperin & Sanz, Fully-Adaptive Minimal Deadlock-Free Packet Routing in Hypercubes, Meshes, and Other Networks 1991 3 SPAA Gibbons & Merritt & Gharachorloo, Proving Sequential Consistency of High-Performance Shared Memories (extended abstract) 1991 3 SPAA Attiya & Welch, Sequential Consistency versus Linearizability (Extended Abstract) 1991 3 SPAA Gharachorloo & Gibbons, Detecting Violations of Sequential Consistency 1991 3 SPAA Herlihy, Impossibility Results for Asynchronous PRAM (extended abstract) 1991 3 SPAA Papaefthymiou, Understanding Retiming through Maximum Average-Weight Cycles 1991 3 SPAA Stallmann, A One-Way Array Algorithm for Matroid Scheduling 1991 3 SPAA Even & Litman, On the Capabilities of Systolic Systems (extended abstract) 1990 2 SPAA Leighton, Average Case Analysis of Greedy Routing Algorithms on Arrays (Extended Abstract) 1990 2 SPAA Herbordt & Weems & Corbett, Message-Passing Algorithms for a SIMD Torus with Coteries 1990 2 SPAA Konstantinidou & Snyder, The Chaos Router: A Practical Application of Randomization in Network Routing 1990 2 SPAA Kaklamanis & Krizanc & Tsantilas, Tight Bounds for Oblivious Routing in the Hypercube 1990 2 SPAA Bruck & Cypher & Soroker, Running Algorithms Efficiently on Faulty Hypercubes (Extended Abstract) 1990 2 SPAA Greenberg & Bhatt, Routing Multiple Paths in Hypercubes 1990 2 SPAA Aiello & Leighton & Maggs & Newman, Fast Algorithms for Bit-Serial Routing on a Hypercube (Extended Abstract) 1990 2 SPAA Anderson & Beame & Ruzzo, Low Overhead Parallel Schedules for Task Graphs (Extended Abstract) 1990 2 SPAA Nishimura, Asynchronous Shared Memory Parallel Computation (preliminary version) 1990 2 SPAA Cole & Zajicek, The Expected Advantage of Asynchrony 1990 2 SPAA Anderson, Parallel Algorithms for Generating Random Permutations on a Shared Memory Machine 1990 2 SPAA Buss, Processor Networks and Alternating Machines 1990 2 SPAA Fich & Ramachandran, Lower Bounds for Parallel Computation on Linked Structures 1990 2 SPAA Hagerup & Radzik, Every Robust CRCW PRAM Can Efficiently Simulate a PRIORITY PRAM 1990 2 SPAA Dietzfelbinger & Kutylowski & Reischuk, Exact Time Bounds for Computing Boolean Functions on PRAMs Without Simultaneous Writes 1990 2 SPAA Shand & Bertin & Vuillemin, Hardware Speedups in Long Integer Multiplication 1990 2 SPAA Becker & Hartmann, Optimal-Time Multipliers and C-Testability 1990 2 SPAA Thapar & Delagi, Cache Coherence for Large Scale Shared Memory Multiprocessors 1990 2 SPAA Grabienski, FLIP-FLOP: A Stack-Oriented Multiprocessing System 1990 2 SPAA Saavedra-Barrera & Culler & von Eicken, Analysis of Multithreaded Architectures for Parallel Computing 1990 2 SPAA Vin & Berman, Architectural Support for the Efficient Data-Driven Evaluation Scheme 1990 2 SPAA Maples, Utilizing Virtual Shared Memory in a Topology Independent, Multicomputer Environment 1990 2 SPAA Ullman & Yannakakis, High-Probability Parallel Transitive Closure Algorithms 1990 2 SPAA Gazit & Reif, A Randomized Parallel Algorithm for Planar Graph Isomorphism 1990 2 SPAA Bini & Benedetto, A New Preconditioner for the Parallel Solution of Positive Definite Toeplitz Systems 1990 2 SPAA Brady & Brown & McGuinness, Disjoint Paths Through a 3-Dimensional Grid (Preliminary Version) 1990 2 SPAA Kirkpatrick & Przytycka, Parallel Construction of Near Optimal Binary Trees 1990 2 SPAA Pan, Parallel Least-Squares Solution of General and Toeplitz-like Linear Systems 1990 2 SPAA Bini & Gemignani, On the Euclidean Scheme for Polynomials Having Interlaced Real Zeros 1990 2 SPAA Aggarwal & Kravets & Park & Sen, Parallel Searching in Generalized Monge Arrays with Applications (extended abstract) 1990 2 SPAA Atallah & Chen, Parallel Rectilinear Shortest Paths with Rectangular Obstacles 1990 2 SPAA Goodrich & Ghouse & Bright, Generalized Sweep Methods for Parallel Computational Geometry (Preliminary Version) 1990 2 SPAA Hagerup & Jung & Welzl, Efficient Parallel Computation of Arrangements of Hyperplanes in d Dimensions 1990 2 SPAA Anderson & Beame & Brisson, Parallel Algorithms for Arrangements 1990 2 SPAA Tamassia & Vitter, Optimal Cooperative Search in Fractional Cascaded Data Structures (Extended Abstract) 1990 2 SPAA Atallah & Callahan & Goodrich, P-Complete Geometric Problems (Preliminary Version) 1990 2 SPAA Reif & Sen, Randomized Algorithms for Binary Search and Load Balancing with Geometric Applications (Preliminary Version) 1990 2 SPAA Aspnes & Herlihy, Wait-Free Data Structures in the Asynchronous PRAM Model 1990 2 SPAA Simons & Alpern & Ferrante, A Foundation for Sequentializing Parallel Code (Extended Abstract) 1990 2 SPAA Lisper, Preconditioning Index Set Transformations for Time-Optimal Affine Scheduling 1990 2 SPAA Roychowdhury & Kailath, Study of Parallelism in Regular Iterative Algorithms 1990 2 SPAA Lyuu, Fast Fault-Tolerant Parallel Communication and On-Line Maintenance Using Information Dispersal 1990 2 SPAA Schwabe, On the Computational Equivalence of Hypercube-Derived Networks 1990 2 SPAA Annexstein & Baumslag, A Unified Approach to Off-Line Permutation Routing on Parallel Networks 1990 2 SPAA Herley, Space-Efficient Representations of Shared Data for Parallel Computers 1989 1 SPAA Ngai & Seitz, A Framework for Adaptive Routing in Multicomputer Networks 1989 1 SPAA Aggarwal & Chandra & Snir, On Communication Latency in PRAM Computations 1989 1 SPAA Chu & Schnitger, The Communication Complexity of Several Problems in Matrix Computation 1989 1 SPAA Kruskal & Snir, Cost-Bandwidth Tradeoffs for Communication Networks 1989 1 SPAA Beigel & Kruskal, Processor Networks and Interconnection Networks without Long Wires 1989 1 SPAA Chan, Embedding of d-Dimensional Grids into Optimal Hypercubes 1989 1 SPAA Cypher, A Lower Bound on the Size of Shellsort Sorting Networks 1989 1 SPAA Plaxton, Load Balancing, Selection and Sorting on the Hypercube 1989 1 SPAA Fich & Wigderson, Towards Understanding Exclusive Read 1989 1 SPAA Bellantoni, Parallel RAMs with Bounded Memory Wordsize 1989 1 SPAA Lam & Ruzzo, The Power of Parallel Pointer Manipulation 1989 1 SPAA Hornick & Preparata, Deterministic P-RAM Simulation with Constant Redundancy 1989 1 SPAA Deng, On the Parallel Complexity of Integer Programming 1989 1 SPAA Shasha & Zhang, Fast Parallel Algorithms for the Unit Cost Editing Distance Between Trees 1989 1 SPAA Goodrich, Intersecting Line Segments in Parallel with an Output-Sensitive Number of Processors 1989 1 SPAA Bar-Noy & Peleg, Square Meshes are not always Optimal 1989 1 SPAA Phillips, Parallel Graph Contraction 1989 1 SPAA Gibbons, A More Practical PRAM Model 1989 1 SPAA Cole & Zajicek, The APRAM: Incorporating Asynchrony into the PRAM Model 1989 1 SPAA Annexstein, Fault Tolerance in Hypercube-derivative Networks 1989 1 SPAA Beigel & Kosaraju & Sullivan, Locating Faults in a Constant Number of Parallel Testing Rounds 1989 1 SPAA Fujimoto, The Virtual Time Machine 1989 1 SPAA Afek & Brown & Merritt, A Lazy Cache Algorithm 1989 1 SPAA Leighton & Newman & Ranade & Schwabe, Dynamic Tree Embeddings in Butterflies and Hypercubes 1989 1 SPAA Shannon, Optimal On-line Load Balancing 1989 1 SPAA Han, Matching Partition a Linked List and Its Optimization 1989 1 SPAA Jung & Kirousis & Spirakis, Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of Dags with Communication Delays 1989 1 SPAA Bilardi & Hornick & Sarrafzadeh, Optimal VLSI Architectures for Multidimensional DFT 1989 1 SPAA Gao & Kaufmann & Maley, Advances in Homotopic Layout Compaction 1989 1 SPAA Thomborson & Wei, Systolic Implementations of a Move-to-Front Text Compressor 1989 1 SPAA Agrawal & Blelloch & Krawitz & Phillips, Four Vector-Matrix Primitives 1989 1 SPAA Baxter & Mirchandaney & Saltz, Run-Time Parallelization and Scheduling of Loops 1989 1 SPAA Lee & Wang, Conflict-free Access of Arrays in a Parallel Processor 1989 1 SPAA Even & Monien, On the Number of Rounds Necessary to Disseminate Information 1989 1 SPAA Leighton & Makedon & Tollis, A 2n-2 Step Algorithm for Routing in an n x n Array With Constant Size Queues 1989 1 SPAA Kunde & Tensi, Multi-Packet-Routing on Mesh Connected Arrays 1989 1 SPAA Raghavan, Robust Algorithms for Packet Routing in a Mesh 1989 1 SPAA Knight, Technologies for Low Latency Interconnection Switches 1989 1 SPAA Dietzfelbinger & Meyer auf der Heide, An Optimal Parallel Dictionary 1989 1 SPAA Lucas & Sackrowitz, Efficient Parallel Algorithms for Path Problems in Directed Graphs 1989 1 SPAA Chrobak & Naor, An Efficient Parallel Algorithm for Computing a Large Independent Set in a Planar Graph 1989 1 SPAA Kedem & Landau & Palem, Optimal Parallel Suffix-Prefix Matching Algorithm and Applications 1989 1 SPAA Tamassia & Vitter, Optimal Parallel Algorithms for Transitive Closure and Point Location in Planar Structures 1989 1 SPAA Karp & Zhang, On Parallel Evaluation of Game Trees 1989 1 SPAA Atallah & Kosaraju & Larmore & Miller & Teng, Constructing Trees in Parallel 1995 7 SPDP Guerraoui & Schiper, The Decentralized Non-Blocking Atomic Commitment Protocol 1995 7 SPDP Chen & Deng & Sun & Rishe, Efficient Algorithms for Detection and Resolution of Distributed Deadlocks 1995 7 SPDP Mayo & Kearns, Global Predicates in Rough Real Time 1995 7 SPDP Park & Agrawal, Efficient Deadlock-Free Wormhole Routing in Shuffle-Based Networks 1995 7 SPDP Sayeed & Abu-Amara, Perfectly Secure Message Transmission in Asynchronous Networks 1995 7 SPDP Chiang & Ni, Efficient Software Multicast in Wormhole-Routed Unidirectional Multistage Networks 1995 7 SPDP Huang & McKinley, An Adaptive Global Reduction Algorithm for Wormhole-Routed 2D Meshes 1995 7 SPDP Cypher, Minimal, Deadlock-Free Routing in Hypercubic and Arbitrary Networks 1995 7 SPDP Calvin & Perennes & Trystram, All-to-All Broadcast in Torus with Wormhole-Like Routing 1995 7 SPDP Czygrinow & Karonski & Sunderam, The Polling Primitive for Hypercube Networks 1995 7 SPDP Ben-Asher & Newman, Geometric Approach for Optimal Routing on Mesh with Buses 1995 7 SPDP Upadhyay & Mohapatra, An Efficient Processor Allocation Scheme for Mesh-Connected Parallel Computers 1995 7 SPDP Liang & Shen, Fully Dynamic Maintaining 2-Edge Connectivity in Parallel 1995 7 SPDP Jain, Parallel Search in Matrices with Sorted Columns 1995 7 SPDP MacKenzie, A Lower Bound for the QRQW PRAM 1995 7 SPDP Matias & Schuster, Fast, Efficient Mutual and Self-Simulations for Shared Memory and Reconfigurable Mesh 1995 7 SPDP Wu, Extended Fibonacci Cubes 1995 7 SPDP Yang & Ni, Incremental Design of Scalable Interconnection Networks Using Basic Building Blocks 1995 7 SPDP Choi & Batcher, Fault Detection in Bitonic Sorting Networks 1995 7 SPDP Johnson, Designing a Distributed Queue 1995 7 SPDP Papatriantafilou & Tsigas, Wait-free Consensus in ``In-Phase'' Multiprocessor Systems 1995 7 SPDP Prasad & Sawant, Parallel Heap: A Practical Priority Queue for Fine-to-Medium-Grained Applications on Small Multiprocessors 1995 7 SPDP Nassimi & Joshi & Sohn, H-PBS: A Hash-Based Scalable Technique for Parallel Bidirectional Search 1995 7 SPDP Brecht & Deng & Gu, Competitive Dynamic Multiprocessor Allocation for Parallel Applications 1995 7 SPDP Decker & Diekmann & Luling & Monien, Towards Developing Universal Dynamic Mapping Algorithms 1995 7 SPDP Rhee, Optimal Fault-Tolerant Resource Allocation in Distributed Systems 1995 7 SPDP Chen & Gupta, Weighted Selection on Coarse-Grain Hypercubes 1995 7 SPDP Ferriera & Rau-Chaplin & Ueda, Scalable 2d Convex Hull and Triangulation Algorithms for Coarse-Grained Multicomputers 1995 7 SPDP de la Torre & Kruskal, A Structural Theory of Recursively Decomposable Parallel Processor-Networks 1995 7 SPDP Chochia & Cole & Heywood, Implementing the Hierarchical PRAM on the 2D Mesh: Analyses and Experiments 1995 7 SPDP Gao & Rosenberg & Sitaraman, Optimal Architecture-Independent Scheduling of Fine-Grain Tree-Sweep Computations 1995 7 SPDP Yoo & Youn, An On-Line Scheduling and Allocation Scheme for Real-Time Tasks in 2D Meshes 1995 7 SPDP Wang & Korfhage, Process Scheduling Using Genetic Algorithms 1995 7 SPDP Zhang & Zheng, Design and Analysis of a Systolic Sorting Architecture 1995 7 SPDP Kranakis & Krizanc & Pelc, Hop-Congestion Trade-Offs for High-Speed Networks 1995 7 SPDP Kim & Chwa, Edge-Disjoint Embedding of Large Full Binary Trees into Hypercubes 1995 7 SPDP Gu & Peng, An Efficient Algorithm for k-Pairwise Node Disjoint Path Problem in Hypercubes 1995 7 SPDP Stacho & Vrt'o, Bisection Widths of Transposition Graphs 1995 7 SPDP Chang & Chang, A Fault-Tolerant Triangular Mesh Protocol for Distributed Mutual Exclusion 1995 7 SPDP Park & Yoon & Lee, The Cyclic Banyan Network: A Fault-Tolerant Multistage Interconnection Network with the Fully-Adaptive Self-Routing 1995 7 SPDP Ohring & Ibel & Das, Reliable Broadcasting in Product Networks in the Presence of Faulty Nodes 1994 6 SPDP Diekmann & Gehring & Luling & Monien & Nubel & Wanka, Sorting Large Data Sets on a Massively Parallel System 1994 6 SPDP Madhuram & Kumar, A Hybrid Approach for Mutual Exclusion in Distributed Computing Systems 1994 6 SPDP Bar-Noy & Kipnis & Schieber, Optimal Multiple Message Broadcasting in Telephone-Like Communication Systems 1994 6 SPDP Rescigno, Optimal Polling in Communication Networks 1994 6 SPDP Peterson & Yi, Election on Faulty Rings with Incomplete Size Information 1994 6 SPDP Fernandes & Friesen & Kanevsky, Embedding Rings in Recursive Networks 1994 6 SPDP Subramaniam & Cheng, Simultaneous Access Renegable Priority Queues 1994 6 SPDP Das & Sarkar, Conflict-Free Data Access of Arrays and Trees in Parallel Memory Systems 1994 6 SPDP Ravikumar & Manimaran, Star-Graph Based Multistage Interconnection Network for ATM Switch Fabric 1994 6 SPDP Chiang & Bhattacharya & Ni, Multicast in Extra-Stage Multistage Interconnection Networks 1994 6 SPDP Potlapalli & Agrawal, Bounds on the Number of Passes in Multistage Interconnection Networks 1994 6 SPDP Rosenberg & Scarano & Sitaraman, The Reconfigurable Ring of Processors: Fine-Grained Tree-Structured Computations 1994 6 SPDP Gao & Rosenberg, On Balancing Computational Load on Rings of Processors 1994 6 SPDP Rappoport, The Red-Blue Algorithm for Dynamic Programming on Linear Arrays 1994 6 SPDP Ranade & Cheng & Deprit & Jones & Shih, Parallelism and Locality in Priority Queues 1994 6 SPDP Narayanan & Condon, Upper and Lower Bounds for Selection on the Mesh 1994 6 SPDP Kravets & Plaxton, An Optimal Hypercube Algorithm for the All Nearest Smaller Values Problem 1994 6 SPDP Dietz & Raman, Very Fast Optimal Parallel Algorithms for Heap Construction 1994 6 SPDP Zhang & Ortynski, The Efficiency of Randomized Parallel Backtrack Search 1994 6 SPDP Luccio, On the Convergence of a Parallel Algorithm for Finding Polynomial Zeros 1994 6 SPDP Luccio & Pagli, Computational Bounds for the Simple and the MRMW PRAM 1994 6 SPDP Ponnuswamy & Chaudhary, Embedding of Cycles in Rotator and Incomplete Rotator Graphs 1994 6 SPDP Ding & Ho & Tsay, Matrix Transpose on Meshes with Wormhole and XY Routing 1994 6 SPDP Kaufmann & Meyer & Sibeyn, Towards Practical Permutation Routing on Meshes 1994 6 SPDP Ho & Kao, Efficient Submesh Permutations in Wormhole-Routed Meshes 1994 6 SPDP Lin & Lin, Minimal Turn Restrictions for Designing Deadlock-Free Adaptive Routing 1994 6 SPDP Liu & Chien, Hierarchical Adaptive Routing: A Framework for Fully Adaptive and Deadlock-Free Wormhole Routing 1994 6 SPDP Cull & Larson, Wormhole Routing Algorithms for Twisted Cube Networks 1994 6 SPDP Al-Hajery & Batcher, On the Role of K-Bits Bitonic Sorting Network 1994 6 SPDP Cheung & Lau, Routing with Locality in Partitioned-Bus Meshes 1994 6 SPDP Boppana & Chalasani & Raghavendra, On Multicast Wormhole Routing in Multicomputer Networks 1992 4 SPDP Raghavendra & Sridhar, Broadcasting Algorithms in Faulty SIMD Hypercubes 1992 4 SPDP Bruck & Cypher & Ho, Tolerating Faults in a Mesh with a Row of Spare Nodes 1992 4 SPDP Wang & Cypher, Fault-Tolerant Embeddings of Rings, Meshes, and Tori in Hypercubes 1992 4 SPDP Miguet & Poty, Revisiting the Allocation of Regular Data Arrays to a Mesh of Processors 1992 4 SPDP Krizanc & Narayanan, Optimal Algorithms for Selection on a Mesh-Connected Processor Array 1992 4 SPDP Tsay, Mapping Tree-Structured Computations onto Mesh-Connected Arrays of Processors 1992 4 SPDP Diekmann & Luling & Simon, A General Purpose Distributed Implementation of Simulated Annealing 1992 4 SPDP Skubiszewski, An Exact Hardware Implementation of the Boltzmann Machine 1992 4 SPDP Zhu & McCreary, Optimal and Near Optimal Tree Scheduling for Parallel Systems 1992 4 SPDP Sunder & He, An NC Algorithm for Finding Minimum Weighted Completion Time Schedule on Series Parallel Graphs 1992 4 SPDP Chen & Shang, On Uniformization of Affine Dependence Algorithms 1992 4 SPDP Kim & Youn & Kavi, Hierarchical Interconnection Networks: Routing Performance in the Presence of Faults 1992 4 SPDP Sairam & Tamassia & Vitter, A Divide and Conquer Approach to Shortest Paths in Planar Layered Digraphs 1992 4 SPDP Luccio & Pagli, The p-Shovelers Problem (Computing with Time-Varying Data) 1992 4 SPDP Robison & Soroker, An Algebraic Framework for Edge-Disjoint Permutations on Hypercubes 1992 4 SPDP Kranakis & Krizanc, Distributed Computing on Cayley Networks (Extended Abstract) 1992 4 SPDP Gupta & Wang, On Embedding Ternary Trees into Boolean Hypercubes 1992 4 SPDP Lai & Wu, An (N-1)-Resilient Algorithm for Distributed Termination Detection 1992 4 SPDP Higham & Schenk, The Parallel Asynchronous Recursion Model 1992 4 SPDP Gibbons & Korach, The Complexity of Sequential Consistency 1992 4 SPDP Leopold, A Fast Sort Using Parallelism within Memory 1992 4 SPDP Lin & Prasanna, A Tight Bound on the Diameter of One-Dimensional PEC Networks 1992 4 SPDP Kaufmann & Sibeyn, Deterministic Routing on Circular Arrays 1992 4 SPDP Jang & Park & Prasanna, An Optimal Multiplication Algorithm on Reconfigurable Mesh 1992 4 SPDP Bruck & Cypher & Ho, Multiple Message Broadcasting with Generalized Fibonacci Trees 1992 4 SPDP Posch & Posch, Residue Number Systems: A Key to Parallelism in Public Key Cryptography 1992 4 SPDP Gupta & Kaushik & Huang & Johnson & Johnson & Sadayappan, A Methodology for Generating Data Distributions to Optimize Communication 1992 4 SPDP Kim & Chien, An Evaluation of Planar-Adaptive Routing (PAR) 1992 4 SPDP Ramanathan & Clement & Crandall, Hyperweave: A Fault-Tolerant Expandable Interconnection Network 1992 4 SPDP Jwo & Lakshmivarahan & Dhall, A New Class of Interconnection Networks Based on Alternating Group 1992 4 SPDP Lu & Oruc, Efficient Networks for Realizing Point-to-Point Assignments in Parallel Processors 1992 4 SPDP Cypher & Sanz, Hierarchical Shuffle-Exchange and de Bruijn Networks 1991 3 SPDP Abolhassan & Keller & Paul, On the Cost-Effectiveness of PRAMs 1991 3 SPDP Gil, Fast Load Balancing on a PRAM 1991 3 SPDP Heywood & Ranka, A Practical Hierarchical Model of Parallel Computation 1991 3 SPDP Mills & Nyland & Prins & Reif & Wagner, Prototyping Parallel and Distributed Programs in Proteus 1991 3 SPDP Kotz & Ellis, Caching and Writeback Policies in Parallel File Systems 1991 3 SPDP Wagner, Embedding All Binary Trees in the Hypercube 1991 3 SPDP Wang & Cypher & Mayr, Embedding Complete Binary Trees in Faulty Hypercubes 1991 3 SPDP Padmanabhan, On the Tradeoff Bedtween Node Degree and Communication Channel Width in Shuffle-Exchange Networks 1991 3 SPDP Madabhushi & Lakshmivarahan & Dhall, Analysis of the Modified Even Networks 1991 3 SPDP Chaudhuri & Kosa & Welch, Upper and Lower bounds for One-Write Multivalued Regular Registers 1991 3 SPDP Weidman & Page & Pervin, Explicit Dynamic Exclusion Algorithm 1991 3 SPDP Ibaraki & Kameda, Boolean Theory of Coteries 1991 3 SPDP Yang, An NC Algorithm for the General Planar Monotone Circuit Value Problem 1991 3 SPDP Eberly, Efficient Parallel Independent Subsets and Matrix Factorizations 1991 3 SPDP Pan & Landowne & Sadikou, Univariate Polynomial Division with a Remainder by Means of Evaluation and Interpolation 1991 3 SPDP Goodman & Mou, DC Transpose: A Method for Reducing Communication in Divide-and-Conquer Algorithms on Mesh-Based Computers 1991 3 SPDP Powley & Ferguson & Korf, Parallel Tree Search on a SIMD Machine 1991 3 SPDP Arup & Badrinath, An Efficient Protocol for Ordering Broadcast Messages in Distributed Systems 1991 3 SPDP Bagchi & Schmeichel & Hakimi, Parallel Algorithms for Information Dissemination by Packets 1991 3 SPDP Shigeru & Kato & Masuda, Optimization of Distributed Communication in Multiprotocol Tuple Space 1991 3 SPDP Bruck & Cypher & Ho, Fault-Tolerant Meshes with Minimal Numbers of Spares 1991 3 SPDP Chlebus, Duplicating Keys to Streamline Sorting on a Mesh-Connected Computer 1991 3 SPDP Krizanc & Narayanan, Off-Line Routing with Small Queues on a Mesh-Connected Processor Array 1991 3 SPDP Rajasekaran & Raghavachari, Optimal Randomized Algorithms for Multipacket and Cut-through Routing on the Mesh 1991 3 SPDP Wan, New Divide-and-Conquer Techniques for Finding Disjoint Paths 1991 3 SPDP Ramachandran & Wang, Parallel Algorithms and Complexity Results for Telephone Link Simulation 1991 3 SPDP Tomassia & Tollis & Vitter, Lower Bounds and Parallel Algorithms for Planar Orthogonal Grid Drawings 1991 3 SPDP Zhang & Mackworth, Parallel and Distributed Algorithms for Finite Constraint Satisfaction Problems 1991 3 SPDP Dietzfelbinger & Madhavapeddy & Sudborough, Three Disjoint Path Paradigms in Star Networks 1991 3 SPDP Suri & Mendelson & Pradhan, BDG-Torus Union Graph - An Efficient Algorithmically Specialized Parallel Interconnect 1991 3 SPDP Akl & Qiu & Stojmenovic, Data Communication and Computational Geometry on the Star and Pancake Interconnection Networks 1991 3 SPDP Horng & Kleinrock, Two-Level Hierarchical Fault-Tolerant Routing with Regularity Restoration in Boolean n-Cube Interconnection Networks 1991 3 SPDP Lyuu, Fast Fault-Tolerant Parallel Communication for de Bruijn Networks Using Information Dispersal 1991 3 SPDP Liang & Bhattacharya & Tsai, Distributed Fault-Tolerant Routing on Hypercubes: Algorithms and Performance Study 1991 3 SPDP Barak & Schenfeld, Embedding Classical Communication Topologies in the OPAM Architecture 1991 3 SPDP Huang & Weihl, An Evaluation of Concurrent Priority Queue Algorithms 1991 3 SPDP Muhlenbein, Asynchronous Parallel Search by the Parallel Genetic Algorithm 1991 3 SPDP Bultan & Aykanat, Circuit Partitioning Using Parallel Mean Field Algorithms 1991 3 SPDP Heistermann, A Parallel Hybrid Learning Approach to Artificial Neural Nets 1991 3 SPDP Rai & Trahan, ATARIC: An Algebraic Technique to Analyze Reconfiguration for Fault Tolerance in a Hypercube 1991 3 SPDP Ouyang & Palem, Very Efficient Cyclic Shifts on Hypercubes 1991 3 SPDP Young & Yalamanchili, Adaptive Routing in Generalized Hypercube Architectures 1991 3 SPDP Crovella & Das & Dubnicki & LeBlanc & Markatos, Multiprogramming on Multiprocessors 1991 3 SPDP Lu & Lin, An Optimal Parallel Algorithm for the Longest Common Subsequence Problem 1991 3 SPDP Sha & Steiglitz, Explicit Constructions for Reliable Reconfigurable Array Architectures 1991 3 SPDP Scheiman & Cappello, A Period-Processor-Time-Minimal Systolic Array for Cubical Mesh Algorithms 1991 3 SPDP Annexstein, SIMD-Emulations of Hypercubes and Related Networks 1991 3 SPDP Markatos & Crovella & Das & Dubnicki & LeBlanc, The Effects of Multiprogramming on Barrier Synchronization 1991 3 SPDP Kranakis & Krizanc, Distributed Computing on Anonymous Hypercube Networks 1991 3 SPDP Chaudhuri, Towards a Complexity Hierarchy of Wait-Free Concurrent Objects 1991 3 SPDP Huynh & Tian, The Complexity of Deciding Readiness and Failure Equivalences for Processes 1991 3 SPDP Robison, A Group of Permutations with Edge-Disjoint Paths on Hypercubes 1991 3 SPDP Spencer, Parallel Matching on Expanders 1991 3 SPDP Lin & Olariu, An Optimal Parallel Matching Algorithm for Cographs 1991 3 SPDP de la Torre & Greenlaw, Super Critical Tree Numbering and Optimal Tree Ranking are in NC 1991 3 SPDP Haglin, On A Fast Deterministic Parallel Approximate Matching Algorithm 1991 3 SPDP Yang & Masson, Broadcast Ring Sandwich Networks 1991 3 SPDP Lau & Lau, Propagating Buffer: A New Approach to Deadlock Freedom in Store-and-Forward Networks 1991 3 SPDP Wang & Mou, A Divide-and-Conquer Method of Solving Tridiagonal Systems on Hypercube Massively Parallel Computers 1991 3 SPDP Ranganathan & Mehrotra & Subramaniam, A High Speed Systolic Architecture for Labeling Connected Components in an Image 1991 3 SPDP Tien & Ho & Yang, Broadcasting on Incomplete Hypercubes 1991 3 SPDP Leung & Shende, Packet Routing on Square Meshes with Row and Column Buses 1991 3 SPDP Duato, Deadlock-free Adaptive Routing Algorithms for Multi-computers: Evaluation of a New Algorithm 1991 3 SPDP Garcia & Duato, An Algorithm for Dynamic Reconfiguration of a Multicomputer Network 1991 3 SPDP Bernhard, Bounds on the Performance of Message Routing Heuristics 1991 3 SPDP Hsiao & Chen, Performance Analysis of Single-Buffered Multistage Interconnection Networks 1990 2 SPDP Lin & Olariu, On the Parallel Recognition of Some Tree-representable Graphs 1990 2 SPDP Osiakwan & Akl, The Maximum Weight Perfect Matching Problem for Complete Weighted Graphs is in PC 1990 2 SPDP Tyagi & Reif, Energy Complexity of Optical Computations 1990 2 SPDP Anani, LR-algorithm: Concurrent Operations on Priority Queues 1990 2 SPDP Liang & Dhall & Lakshmivarahan, Parallel Algorithms for Ranking of Trees 1990 2 SPDP Deng & Liu & Xiao, Deterministic Load Balancing in Computer Networks 1990 2 SPDP Arora & Gouda & Herman, Composite Routing Protocols 1990 2 SPDP Youssef & Arden, Topology of Efficiently Controllable Banyan Multistage Networks 1990 2 SPDP Chan & Lee, Subcube Recognition, Allocation/Deallocation and Relocation in Hypercubes 1990 2 SPDP Sibeyn, Routing Permutations on MESH Interconnection Networks 1990 2 SPDP Raghunath & Ranade, A Simulation-Based Comparison of Interconnection Networks 1990 2 SPDP Ramarao & Brahmadathan, Divide and Conquer for Distributed Mutual Exclusion 1990 2 SPDP Esonu & Al-Khalili & Hariri, Design of Optimal Systolic Arrays: A Systematic Approach 1990 2 SPDP Zito-Wolf, A Broadcast/Reduce Architecture for High-Speed Data Compression 1990 2 SPDP Heywood & Ghafoor & Chan, Deterministic Simulation of PRAMs on Hypercube Networks Without Look-up Tables 1990 2 SPDP Ko, Parallel Execution of Lanczos Algorithm in a CAM Systolic Ring 1990 2 SPDP Robison, Optimistic Regulation of Concurrency 1990 2 SPDP Hudson & van de Geijn, An Asymptotically 100% Efficient Parallel Implementation of the Nonsymmetric QR Algorithm 1990 2 SPDP Krizanc, Integer Sorting on a Mesh-connected Array of Processors 1990 2 SPDP Wang & Cheng, Parallel Time Complexity of a Heuristic Algorithm for the k-Center Problem with Usage Weights 1990 2 SPDP Henriques & Ranganathan, A Parallel Architecture for Data Compression 1990 2 SPDP Kaufmann, Allowing Overlaps Makes Switchbox Layouts Nice 1990 2 SPDP Provence & Naganathan, A Parallel Distributed Processing Approach to VLSI Global Routing 1990 2 SPDP Gouda & Evangelist, Convergence/Response Tradeoffs in Concurrent Systems 1990 2 SPDP Kirkpatrick & Przytycks, An Optimal Parallel Minimax Tree Algorithm 1990 2 SPDP Haralambides & Makedon & Monien, Approximation Algorithms for the Bandwidth Minimization Problem for Caterpillar Graphs 1990 2 SPDP Weems & Ullah & Gonzalez, Analysis of Parallel Algorithms Using Continuous Job Profiles 1990 2 SPDP Ji & Jeng, Bin-Packing Adjustable Rectangles and Applications to Task Scheduling on Partitionable Parallel Computers 1990 2 SPDP Johnson & Rand & Rausch, The Application of Parallel Processing to the Simplified Marker and Cell Method 1990 2 SPDP Barnett, The Formal Derivation of Distributed Programs from Systolic Arrays 1990 2 SPDP Sandberg, Design of the PRAM Network 1990 2 SPDP Elrad & Kumar & Kenevan, Modeling Distributed Termination with Pre-Defined Partial Termination Ordering 1990 2 SPDP Kamimura, Recognition and Restoration of Periodic Patterns with Neural Network 1990 2 SPDP Lee & Davis, On Linear Speedup of a Class of Neighborhood Functions in an Array Processor 1990 2 SPDP Ibarra & Wang & Jiang, Efficient Parallel Algorithms for Solving Set Recurrence Equations and Applications 1990 2 SPDP Dehne & Hambrusch, Parallel Algorithms for Determining k-Width-Connectivity in Binary Images 1990 2 SPDP Viswanathan & Huang & Liu, Parallel Dynamic Programming 1990 2 SPDP Bestavros & Cheatham & Stefanescu, Parallel Bin Packing Using First Fit and K-delayed Best-Fit Heuristics 1990 2 SPDP Wagner, Randomized Fault-Detecting Leader Election in a Bi-directional Ring 1990 2 SPDP Lombardi & Shen & Muzio, On the Testability of Array Structures for FFT Computation 1990 2 SPDP Madhavapeddy & Sudborough, A topological Property of Hypercubes: Node Disjoint Paths 1990 2 SPDP Jwo & Lakshmivarahan & Dhall, Embedding of Cycles and Grids in Star Graphs 1990 2 SPDP Anand & Agrawal & Kini, Efficient Routing and Conflict Resolution in F and IADM Networks 1990 2 SPDP Tsotras & Gopinath & Hart, Using Universe Knowledge and Arithmetic to Get Faster Parallel Algorithms 1990 2 SPDP Jeong, An Improved Parallel Algorithm for Constructing Voronoi Diagram on a Mesh-Connected Computer 1990 2 SPDP Rao, Synthesis of Simple Distributed Detection Networks 1990 2 SPDP Weihl & Wang, Multi-version Memory: Software Cache Management for Concurrent B-Trees 1990 2 SPDP Lim & Park, Solving the Processor Identity Problem in O(n) Space 1990 2 SPDP Chern & Jacob & Page, Variations on the Drinking Philosophers Algorithm 1990 2 SPDP Agrawal, Fault-Tolerant Computing on Trees 1990 2 SPDP Stumm & Zhou, Fault-Tolerant Distributed Shared Memory Algorithms 1990 2 SPDP Hoffmann, On Computational Limitations of Neural Network Architectures 1990 2 SPDP Raad & Varghese, On Parallel Processing in Computational Fluid Dynamics 1990 2 SPDP Greenlaw, The Parallel Complexity of Que Versus Stack Breadth-First Search 1990 2 SPDP Ullman & Narahari, Mapping Binary Precedence Trees to Hypercubes and Meshes 1990 2 SPDP Luo & Chow & Newman-Wolfe, Near-Optimal Heuristics for Schedulings on Task-Dependent Machines 1990 2 SPDP Tao & Ma, Simulating Parallel Neighboring Communications Among Square Meshes and Square Toruses 1990 2 SPDP Klasing & Luling & Monien, Compressing Cube-Connected Cycles and Butterfly Networks 1990 2 SPDP Sridhar & Raghavendra, On Finding Maximal Subcubes in Residual Hypercubes 1996 SPECLIBS Zhang, File Formats on the Internet: A Guide for PC Users 1995 SPIE Thomas, The Internet for Scientists and Engineers: Online Tools and Resources 1994 19 SPLETS Cabrera & Maguluri & Singh, An Odd Property of the Sample Median 1997 32 SPNOTICES Baker, Garbage In/Garbage Out: When Bad Programs Happen to Good People 1997 32 SPNOTICES MacLennan, ``Who Cares About Elegance?'' The Role of Aesthetics in Programming Language Design 1997 32 SPNOTICES Winkler & Kauer, Proving Assertions is Also Useful 1997 32 SPNOTICES Trott, Programming Languages: Past, Present, and Future 1996 31 SPNOTICES Bergin, Java as a Better C++ 1996 31 SPNOTICES Marin, Effective Use of Assertions in C++ 1996 31 SPNOTICES Loui, Why GAWK for AI? 1996 31 SPNOTICES Andersson & Brodnik, Comment on ``Self-Indexed Sort'' 1996 31 SPNOTICES Sabry, A Reflection on Call-by-Value 1996 31 SPNOTICES Okasaki, The Role of Lazy Evaluation in Amortized Data Structures 1996 31 SPNOTICES Lawall & Mairson, Optimality and Inefficiency: What Isn't a Cost Model of the Lambda Calculus? 1996 31 SPNOTICES Chuang & Hwang, A Probabilistic Approach to the Problem of Automatic Selection of Data Representations 1996 31 SPNOTICES Blelloch & Greiner, A Provable Time and Space Efficient Implementation of NESL 1996 31 SPNOTICES Parr & Quong, LL and LR Translators Need k>1 Lookahead 1995 30 SPNOTICES Brinch Hansen, Efficient Parallel Recursion 1995 30 SPNOTICES Noyelle, Disciplined C 1995 30 SPNOTICES Traunmuller, The Checkers Problem: A Solution with Linear Time Complexity 1994 29 SPNOTICES Sankaran, A Bibliography on Garbage Collection and Related Topics 1994 29 SPNOTICES Wu & Wang, Is Circularity Problem for Attribute Grammars Exponential-Time Complete? 1994 29 SPNOTICES Zivkova, Experiance in Teaching Object-Oriented Programming with C++ 1994 29 SPNOTICES Frost, Using Memoization to Achieve Polynomial Complexity of Purely Functional Executable Specifications of Non-deterministic Top-Down Parsers 1994 29 SPNOTICES Baker, Thermodynamics and Garbage Collection 1994 29 SPNOTICES Yuen & Feng, Parallel Multiplication: A Case Study in Parallel Programming 1994 29 SPNOTICES Srinivasan, A Critical Look At Some Ada Features 1994 29 SPNOTICES Baker, A ``Linear Logic'' Quicksort 1994 29 SPNOTICES Berman, Does Scheme Enhance an Introductory Programming Course? Some Preliminary Empirical Results 1994 29 SPNOTICES Alblas & al., A Bibliography on Parallel Parsing 1993 28 SPNOTICES Jones & Hughes & Launchbury, How To Give a Good Research Talk 1993 28 SPNOTICES Bielak, Object Oriented Programming: The Fundamentals 1993 28 SPNOTICES Bell & Parr, Spreadsheets: A Research Agenda 1993 28 SPNOTICES Liffers, Inheritance versus Containment 1993 28 SPNOTICES Muller, Is Object-Oriented Programming Structured Programming 1993 28 SPNOTICES Marlowe & alia, Pointer-Induced Aliasing: A Clarification 1993 28 SPNOTICES Chandra, C++ in Eight Weeks 1993 28 SPNOTICES Grune, Two-level Grammars Are More Expressive than Type 0 Grammars; Or Are They? 1993 28 SPNOTICES , Proceedings of the Fourth ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming: PPOPP 1992 27 SPNOTICES Casimir, Real Programmers Don't Use Spreadsheets 1992 27 SPNOTICES Ponder & Bush, Polymorphism Considered Harmful 1992 27 SPNOTICES Mody, On Understanding Type Declarations in C 1992 27 SPNOTICES Sakkinen, Where is the Evidence against Arrays and Pointers? 1992 27 SPNOTICES Wu & Wang & Young, Scanning Regular Languages by Dual Finite Automata 1992 27 SPNOTICES Angele & Kupper, Modula-2 an Alternative C? 1992 27 SPNOTICES Fischer, Two Flaws of the Current C++ Language Definition 1992 27 SPNOTICES van den Bosch, A Bibliography on Syntax Error Handling in Context Free Languages 1992 27 SPNOTICES Report, Is POPL Mathematics or Science? 1992 27 SPNOTICES Baker, CONS Should not CONS its Arguments, or, a Lazy Alloc is a Smart Alloc 1992 27 SPNOTICES Baker, The Treadmill: Real-Time Garbage Collection Without Motion Sickness 1992 27 SPNOTICES Baker, Computing A*B (mod N) Efficiently in ANSI C 1991 26 SPNOTICES Snir, The Right Programming Languages for Parallel Machines -- Does Complexity Theory Offer Any Useful Insight? 1991 26 SPNOTICES Nicolau & Wang, Optimal Schedules for Parallel Prefix Computation with Bounded Resources 1991 26 SPNOTICES Bacon & Strom, Optimistic Parallelization of Communicating Sequential Processes 1991 26 SPNOTICES Pugh, Advice to Authors of Extended Abstracts 1991 26 SPNOTICES Rekers & Koorn, Substring Parsing for Arbitrary Context-Free Grammars 1991 26 SPNOTICES Smith & Samadzadeh, An Annotated Bibliography of Literate Programming 1991 26 SPNOTICES Pancake & Utter, A Bibliography of Parallel Debuggers, 1990 Edition 1990 25 SPNOTICES Yovev, Universal Editor Unattainable 1990 25 SPNOTICES Thomas & Oman, A Bibliography of Programming Style 1989 24 SPNOTICES Herring & Palmore, Random Number Generators are Chaotic 1988 23 SPNOTICES Kaelbling, Programming Languages Should NOT Have Comment Statements 1988 23 SPNOTICES Abrahams, Some Sad Remarks About String Handling in C 1988 23 SPNOTICES Ponder & McGeer & Ng, Are Applicative Languages Inefficient? 1984 19 SPNOTICES Mayer & Perkins, Towers of Hanoi Revisited: A Nonrecursive Surprise 1984 19 SPNOTICES Stadel, Another Nonrecursive Algorithm for the Towers of Hanoi 1982 17 SPNOTICES Perlis, Epigrams on Programming 1974 SPNOTICES Lecarme & Desjardins, Reply to a Paper by A. N. Habermann on the Programming Language Pascal 1985 SPON Turk, Effective Speaking: Communicating in Speech 1997 SPRINGER COMAP, Principles and Practice of Mathematics 1996 SPRINGER Gardner, The Universe in a Handkerchief: Lewis Carroll's Mathematical Recreations, Games, Puzzles, and Word Plays 1996 SPRINGER Conway & Guy, The Book of Numbers 1996 SPRINGER Lorentz & Golitschek & Makovoz, Constructive Approximation: Advanced Problems 1996 SPRINGER Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, Third, Revised and Extended Edition 1996 SPRINGER Devroye & Gyorfi & Lugosi, A Probabilistic Theory of Pattern Recognition 1996 SPRINGER Axler, Linear Algebra Done Right 1996 SPRINGER Ribenboim, The New Book of Prime Number Records 1996 SPRINGER Exner, An Accompaniment to Higher Mathematics 1995 SPRINGER Diener & Diener (Eds.), Nonstandard Analysis in Practice 1995 SPRINGER Brucker, Scheduling Algorithms 1995 SPRINGER Shasha & Lazere, Out Of Their Minds: The Lives and Discoveries of 15 Great Computer Scientists 1995 SPRINGER Bonnington & Little, The Foundations of Topological Graph Theory 1995 SPRINGER Travis & Waldt, The SGML Implementation Guide: A Blueprint for SGML Migration 1995 SPRINGER Aldous & Diaconis & Spencer & Steele (Eds.), Discrete Probability and Algorithms 1995 SPRINGER Garzon, Models of Massive Parallelism: Analysis of Cellular Automata and Neural Networks 1995 SPRINGER Brzozowski & Seger, Asynchronous Circuits 1995 SPRINGER Hoffman (Ed.), Building in Big Brother: The Cryptographic Policy Debate 1995 SPRINGER Balcazar & Diaz & Gabarro, Structural Complexity I, Second, Revised Edition 1995 SPRINGER Tricot, Curves and Fractal Dimension, With a Foreward by Michel Mendes France 1994 SPRINGER Anglin, Mathematics: A Concise History and Philosophy 1994 SPRINGER Moschovakis, Notes on Set Theory 1994 SPRINGER Bunde & Havlin (Eds.), Fractals in Science 1994 SPRINGER Calude, Information and Randomness: An Algorithmic Perspective 1994 SPRINGER Smith, A Recursive Introduction to the Theory of Computation 1994 SPRINGER Saari, Geometry of Voting 1994 SPRINGER Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, Second, Extended Edition 1994 SPRINGER Capper, C++ for Scientists, Engineers and Mathematicians 1994 SPRINGER Morris, Introduction to Game Theory 1994 SPRINGER Karr, Probability 1994 SPRINGER Bridges, Computability: A Mathematical Sketchbook 1993 SPRINGER Mitchell, C++ Object-Oriented Programming 1993 SPRINGER von Bechtolsheim, TeX in Practice, Volume I: Basics 1993 SPRINGER von Bechtolsheim, TeX in Practice, Volume II: Paragraphs, Math and Fonts 1993 SPRINGER von Bechtolsheim, TeX in Practice, Volume III: Tokens, Macros 1993 SPRINGER von Bechtolsheim, TeX in Practice, Volume IV: Output Routines, Tables 1993 SPRINGER Lister & Eager, Fundamentals of Operating Systems, Fifth Edition 1993 SPRINGER Shoenfield, Recursion Theory 1993 SPRINGER Grotschel & Lovasz & Schrijver, Geometric Algorithms and Combinatorial Optimization, Second Corrected Edition 1993 SPRINGER Devlin, The Joy of Sets: Fundamentals of Contemporary Set Theory, Second Edition 1993 SPRINGER DeVore & Lorentz, Constructive Approximation 1993 SPRINGER Nerode & Shore, Logic for Applications 1993 SPRINGER Mishra, Algorithmic Algebra 1993 SPRINGER Hehner, A Practical Theory of Programming 1993 SPRINGER Biham & Shamir, Differential Cryptanalysis of the Data Encryption Standard 1993 SPRINGER Cohen, A Course in Computational Algebraic Number Theory 1993 SPRINGER Gries & Schneider, A Logical Approach to Discrete Math 1993 SPRINGER Li & Vitanyi, An Introduction to Kolmogorov Complexity and Its Applications 1993 SPRINGER Hirsch & Marsden & Shub (Eds.), From Topology to Computation: Proceedings of the Smalefest 1993 SPRINGER van de Snepscheut, What Computing Is All About 1993 SPRINGER Becker & Weispfenning & Kredel, Grobner Bases: A Computational Approach to Commutative Algebra 1993 SPRINGER Tolle & Yasner & Pieper, Study and Research Guide in Computer Science: Profiles of Universities in the USA 1993 SPRINGER Book & Otto, String-Rewriting Systems 1992 SPRINGER Bolc & Borowik, Many-Valued Logics 1: Theoretical Foundations 1992 SPRINGER Cox & Little & O'Shea, Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra 1992 SPRINGER Peitgen & Jurgens & Saupe, Chaos and Fractals: New Frontiers of Science 1992 SPRINGER Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs 1992 SPRINGER Peitgen & Jurgens & Saupe, Fractals for the Classroom, Part II: Complex Systems and Mandelbrot Set 1992 SPRINGER Roman, Coding and Information Theory 1992 SPRINGER Whittle, Probability via Expectation, Third Edition 1992 SPRINGER Banchoff & Wermer, Linear Algebra Through Geometry, Second Edition 1992 SPRINGER Moschovakis (Ed.), Logic from Computer Science 1992 SPRINGER Kozen, The Design and Analysis of Algorithms 1991 SPRINGER Croft & Falconer & Guy, Unsolved Problems in Geometry (Unsolved Problems in Intuitive Mathematics, Volume II) 1991 SPRINGER Korte & Lovasz & Schrader, Greedoids 1991 SPRINGER Gray, Entropy and Information Theory 1991 SPRINGER Neuhold & Paul (Eds.), Formal Description of Programming Concepts 1991 SPRINGER Apt & Olderog, Verification of Sequential and Concurrent Programs 1991 SPRINGER Heermann & Burkitt, Parallel Algorithms in Computational Science 1990 SPRINGER Ranka & Sahni, Hypercube Algorithms, with Applications to Image Processing and Pattern Recognition 1990 SPRINGER Muller & Reinhardt, Neural Networks: An Introduction 1990 SPRINGER Hall & Barry (Eds.), The SunTechnology Papers 1990 SPRINGER Lloyd (Ed.), Computational Logic: Symposium Proceedings 1990 SPRINGER Selman (Ed.), Complexity Theory Retrospective, In Honor of Juris Hartmanis on the Occasion of His Sixtieth Birthday, July 5, 1988 1990 SPRINGER Nesetril & Rodl (Eds.), Mathematics of Ramsey Theory 1990 SPRINGER Nesetril & Rodl (Eds.), Mathematics of Ramsey Theory 1990 SPRINGER Bundy (Ed.), Catalogue of Artificial Intelligence Techniques, Third, Revised Edition 1990 SPRINGER Cohen, Programming in the 1990s: An Introduction to the Calculation of Programs 1990 SPRINGER Ireland & Rosen, A Classical Introduction to Modern Number Theory, Second Edition 1990 SPRINGER Sacks, Higher Recursion Theory 1990 SPRINGER Jumarie, Relative Information: Theories and Applications 1990 SPRINGER Lee & Anderson, Fault Tolerance: Principles and Practice, Second, revised edition 1990 SPRINGER Edgar, Measure, Topology, and Fractal Geometry 1990 SPRINGER Fitting, First-Order Logic and Automated Theorem Proving 1990 SPRINGER Dijkstra & Scholten, Predicate Calculus and Program Semantics 1989 SPRINGER Stillwell, Mathematics and Its History 1989 SPRINGER Tolimieri & An & Lu, Algorithms for Discrete Fourier Transform and Convolution 1989 SPRINGER Parker & Chua, Practical Numerical Algorithms for Chaotic Systems 1989 SPRINGER Resnikoff, The Illusion of Reality 1989 SPRINGER Hausser, Computation of Language: An Essay on Syntax, Semantics and Pragmatics in Natural Man-Machine Communication 1989 SPRINGER Gosling & Rosenthal & Arden, The NeWS Book: An Introduction to the Network/extensible Window System 1989 SPRINGER Walk, Theory of Duality in Mathematical Programming 1989 SPRINGER Cacoullos, Exercises in Probability 1988 SPRINGER Levy (Ed.), Computer Chess Compendium 1988 SPRINGER Tzeng, A Theory of Heuristic Information in Game-Tree Search 1988 SPRINGER Ribenboim, The Book of Prime Number Records 1988 SPRINGER Darnell & Margolis, Software Engineering in C 1988 SPRINGER Garding & Tambour, Algebra for Computer Science 1988 SPRINGER Wirth, Programming in Modula-2, Fourth Edition 1988 SPRINGER Levy (ed.), Computer Games 1988 SPRINGER Haken, Information and Self-Organization: A Macroscopic Approach to Complex Systems 1988 SPRINGER Moll & Arbib & Kfoury & Pustejovsky, An Introduction to Formal Language Theory 1988 SPRINGER Kohonen, Self-Organization and Associative Memory, Second Edition 1988 SPRINGER Adelson-Velsky & Arlazov & Donskoy, Algorithms for Games 1987 SPRINGER Marcotty & Ledgard, The World of Programming Languages 1987 SPRINGER Arbib, Brains, Machines, and Mathematics, Second Edition 1987 SPRINGER Koblitz, A Course in Number Theory and Cryptography 1987 SPRINGER Haken, Computational Systems--Natural and Artificial: Proceedings of the International Symposium on Synergetics at Schloss Elmau, Bavaria, May 4-9, 1987 1987 SPRINGER McCauley, Chaotic Dynamical Systems as Machines (in Haken (1987)) 1987 SPRINGER Hofri, Probabilistic Analysis of Algorithms: On Computing Methodologies for Computer Algorithms Performance Evaluation 1987 SPRINGER Lang, Linear Algebra (third edition) 1987 SPRINGER Soare, Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets 1987 SPRINGER Husemoller, Elliptic Curves 1986 SPRINGER Lang, Introduction to Linear Algebra, Second Edition 1986 SPRINGER Manes & Arbib, Algebraic Approaches to Program Semantics 1986 SPRINGER Schroeder, Number Theory in Science and Communication, Second Enlarged Edition 1986 SPRINGER Henle, An Outline of Set Theory 1986 SPRINGER Francez, Fairness 1985 SPRINGER Lang, The Beauty of Doing Mathematics: Three Public Dialogues 1985 SPRINGER Shaw, The Carnegie-Mellon Curriculum for Undergraduate Computer Science 1984 SPRINGER Ebbinghaus & Flum & Thomas, Mathematical Logic 1984 SPRINGER Berger & Pansu & Berry & Saint-Raymond, Problems in Geometry 1984 SPRINGER Kohonen, Self-Organization and Associative Memory 1984 SPRINGER Foulds, Combinatorial Optimization for Undergraduates 1983 SPRINGER Larson, Problem-Solving Through Problems 1982 SPRINGER Kfoury & Moll & Arbib, A Programming Approach to Computability 1982 SPRINGER van Lint, Introduction to Coding Theory 1982 SPRINGER Newman, A Problem Seminar 1981 SPRINGER Arbib & Kfoury & Moll, A Basis for Theoretical Computer Science 1980 SPRINGER Oxtoby, Measure and Category: A Survey of the Analogies between Topological and Measure Spaces, Second Edition 1995 14 SRDS Venkaiah & Jalote, An Integer Programming Approach for Assigning Votes in a Distributed System 1995 14 SRDS Hilderman & Hamilton, Performance Analysis of a Regeneration-Based Dynamic Voting Algorithm 1993 12 SRDS Soufi & Belford, An O(1) Quorum Consensus Protocol Tailored for the Client/Server Architecture 1993 12 SRDS Hiltunen & Schlichting, An Approach to Constructing Modular Fault-Tolerant Protocols 1993 12 SRDS Verissimo & Casimiro & Rodrigues, Using Atomic Broadcast to Implement a posteriori Agreement for Clock Synchronization 1993 12 SRDS David & Son, A Secure Two Phase Locking Protocol 1993 12 SRDS Van Herreweghen & Tsudik, Some Remarks on Protecting Weak Keys and Poorly-Chosen Secrets from Guessing Attacks 1993 12 SRDS Shi & McDermid, Constructing Secure Distributed Systems Using Components 1992 11 SRDS Wu & Fernandez, Reliable Broadcasting in Faulty Hypercube Computers 1992 11 SRDS Pfluegl & Blough, Communication Protocols for Fault-Tolerant Clock Synchronization in Not-Completely Connected Networks 1995 4 SSD Kuijpers & Paredaens & Van den Bussche, Lossless Representation of Topological Spatial Data 1995 4 SSD Vandeurzen & Gyssens & Van Gucht, On the Desirability and Limitations of Linear Spatial Database Models 1995 4 SSD Finke & Hinrichs, The Quad View Data Structure -- A Representation for Planar Subdivisions 1993 3 SSD Kim & Garza & Keskin, Spatial Data Management in Database Systems: Research Directions 1993 3 SSD Pagel & Six & Toben, The Transformation Technique for Spatial Objects Revisited 1993 3 SSD Shaffer & Brown, A Paging Scheme for Pointer-based Quadtrees 1993 3 SSD Bruzzone & De Floriani & Pellegrinelli, A Hierarchical Spatial Index for Cell Complexes 1993 3 SSD Becker & Gschwind & Ohler & Seeger & Widmayer, On Optimal Multiversion Access Structures 1993 3 SSD Ng & Kameda, Concurrent Accesses to R-Trees 1993 3 SSD Finke & Hinrichs, A Spatial Data Model and a Topological Sweep Algorithm for Map Overlay 1993 3 SSD Ang, An Optimal Quadtree Translation Algorithm 1993 3 SSD Baumann, Database Support for Multidimensional Discrete Data 1993 3 SSD Clementini & di Felice & van OOsterom, A Small Set of Formal Topological Relationships Suitable for End-user Interaction 1993 3 SSD Cui & Cohn & Randell, Qualitative and Topological Relationships in Spatial Databases 1993 3 SSD Egenhofer & Sharma, Topological Relations between Regions in R^2 and Z^2 1993 3 SSD Droege & Schek, Query-adaptive Data Space Partitioning Using Variable-size Storage Clusters 1993 3 SSD Brinkhoff & Horn & Kriegel & Schneider, A Storage and Access Architecture for Efficient Query Processing in Spatial Database Systems 1993 3 SSD Schiwietz & Kriegel, Query Processing of Spatial Objects: Complexity versus Redundancy 1991 2 SSD Ottmann, Geometric Algorithms and Their Complexity 1991 2 SSD Kriegel & Brinkhoff & Schneider, The Combination of Spatial Access Methods and Computational Geometry 1991 2 SSD Cheiney & Touir, FI-Quadtree: A New Data Structure for Content-Oriented Retrieval and Fuzzy Search 1991 2 SSD Hoel & Samet, Efficient Processing of Spatial Queries in Line Segment Databases 1991 2 SSD Vanecek & Ferrucci, A Spatial Index for Convex Simplicial Complexes in d Dimensions 1991 2 SSD Orenstein, An Algorithm for Computing the Overlay of k-Dimensional Spaces 1989 24 SSMHUNG Mori, On the Number of Different Patterns Preceding a Given One 1996 6 SSPR Sanfeliu & Alquezar, Efficient Recognition of a Class of Context-Sensitive Languages Described by Augmented Regular Expressions 1996 6 SSPR Oommen & Kashyap, Optimal and Information Theoretic Syntactic Pattern Recognition for Traditional Errors 1996 6 SSPR Sanchez & Benedi & Casacuberta, Comparison Between the Inside-Outside Algorithm and the Viterbi Algorithm for Stochastic Context-Free Grammars 1996 13 STACS Brassard, New Trends in Quantum Computing 1996 13 STACS Buhrman & Longpre, Compressibility and Resource Bounded Measure 1996 13 STACS Kummer, On the Complexity of Random Strings 1996 13 STACS Harju & Karhumaki, Remarks on Generalized Post Correspondence Problem 1996 13 STACS Beal & Carton & Reutenauer, Cyclic Languages and Strongly Cyclic Languages 1996 13 STACS Ambos-Spies & Mayordomo & Wang & Zheng, Resource-Bounded Balanced Genericity, Stochasticity and Weak Randomness 1996 13 STACS Buhrman & Thierauf, The Complexity of Generating and Checking Proofs of Membership 1996 13 STACS Lutz, Observations on Measures and Lowness for Delta^p_2 1996 13 STACS Arvind & Vinodchandran, Solvable Black-Box Group Problems Are Low for PP 1996 13 STACS Beaudry, Languages Recognized by Finite Aperiodic Groupoids 1996 13 STACS Bassino, Star-Height of an IN-Rational Series 1996 13 STACS Culik & Kari, An Aperiodic Set of Wang Cubes 1996 13 STACS Melancon, Lyndon Factorization of Infinite Words 1996 13 STACS Heun & Mayr, Embedding Graphs with Bounded Treewidth into Optimal Hypercubes 1996 13 STACS Morvan & Viennot, Parallel Comparability Graph Recognition and Modular Decomposition 1996 13 STACS Berenbrink & Meyer auf der Heide & Stemann, Fault-Tolerant Shared Memory Simulations 1996 13 STACS Indyk, On Word-Level Parallelism in Fault-Tolerant Computing 1996 13 STACS Barzdins & Freivalds & Smith, Learning with Confidence 1996 13 STACS Tateishi & Maruyama & Miyano, Extracting Best Consensus Motifs from Positive and Negative Examples 1996 13 STACS Denis & D'Halluin & Gilleron, PAC Learning with Simple Examples 1996 13 STACS Ambainis & Freivalds & Smith, General Inductive Inference Types Based on Linearly-Ordered Sets 1996 13 STACS Berard & Gastin & Petit, On the Power of Non-observable Actions in Timed Automata 1996 13 STACS Bertol & Diekert, Trace Rewriting: Computing Normal Forms in Time O(n log n) 1996 13 STACS Durr & Le Thanh & Santha, A Decision Procedure for Well-Formed Linear Quantum Cellular Automata 1996 13 STACS Jacoby & Schindelhauer, On the Complexity of Worst Case and Expected Time in a Circuit 1996 13 STACS Cai & Naik & Sivakumar, On the Existence of Hard Sparse Sets under Weak Reductions 1996 13 STACS Andreev & Clementi & Rolim, Optimal Bounds on the Approximation of Boolean Functions with Consequences on the Concept of Hardness 1996 13 STACS Cai & Selman, Fine Separation of Average Time Complexity Classes 1996 13 STACS Sifakis & Yovine, Compositional Specification of Timed Systems 1996 13 STACS Bleichenbacher & Maurer, Optimal Tree-Based One-time Digital Signature Schemes 1996 13 STACS Friedman & Joux & Roichman & Stern & Tillich, The Action of a Few Random Permutations on r-Tuples and an Application to Cryptography 1996 13 STACS Maurer, A Unified and Generalized Treatment of Authentication Theory 1996 13 STACS Walukiewicz, Monadic Second Order Logic on Tree-Like Structures 1996 13 STACS Schwentick, On Bijections vs. Unary Functions 1996 13 STACS Marcinkowski, The 3 Frenchmen Method Proves Undecidability of the Uniform Boundedness for Single Recursive Rule Ternary DATALOG Programs 1996 13 STACS Hofmeister & Lefmann, A Combinatorial Design Approach to MAXCUT 1996 13 STACS Gupta & Nishimura, Characterizing the Complexity of Subgraph Isomorphism for Graphs of Bounded Path-Width 1996 13 STACS Mitchell, A Characterization of the Quadrilateral Meshes of a Surface which Admit a Compatible Hexahedral Mesh of Enclosed Volume 1996 13 STACS Bradfield, On the Expressivity of the Modal Mu-Calculus 1996 13 STACS Bollig & Wegener, Read-once Projections and Formal Circuit Verification with Binary Decision Diagrams 1996 13 STACS Giacobazzi, ``Optimal'' Collecting Semantics for Analysis in a Hierarchy of Logic Program Semantics 1996 13 STACS Schmitt, Flip-Flop Nets 1996 13 STACS Kranakis & Krizanc, Lower Bounds for Compact Routing 1996 13 STACS Frougny, On the Successor Function in Non-classical Numeration Systems 1996 13 STACS Beal & Mignosi & Restivo, Minimal Forbidden Words and Symbolic Dynamics 1996 13 STACS Dietzfelbinger, Universal Hashing and k-wise Independent Random Variables via Integer Arithmetic without Primes 1996 13 STACS Kelsen, Ranking and Unranking Trees Using Regular Reductions 1996 13 STACS Breslauer, On Competitive On-Line Paging with Lookahead 1996 13 STACS Lagergren, Hypothesis Testing in Perfect Phylogeny for a Bounded Number of Characters 1996 13 STACS Meinel & Waack, The ``log Rank'' Conjecture for Modular Communication Complexity 1996 13 STACS Ambainis, Upper Bounds on Multiparty Communication Complexity of Shifts 1996 13 STACS Damm & Jukna & Sgall, Some Bounds on Multiparty Communication Complexity of Pointer Jumping 1996 13 STACS Bampis & Delorme & Konig, Optimal Schedules for d-D Grid Graphs with Communication Delays 1996 13 STACS Gartner & Welzl, Linear Programming -- Randomization and Abstract Frameworks 1995 12 STACS Thomas, On the Synthesis of Strategies in Infinite Games 1995 12 STACS Louchard, Finding the Maximum with Linear Error Probabilities: A Sequential Analysis Approach 1995 12 STACS Juedes & Lutz, Completeness and Weak Completeness Under Polynomial-Size Circuits 1995 12 STACS Cai & Lipton & Longpre & Ogihara & Regan & Sivakumar, Communication Complexity of Key Agreement on Small Ranges 1995 12 STACS Han & Hemaspaandra, Pseudorandom Generators and the Frequency of Simplicity 1995 12 STACS Hertrampf, Classes of Bounded Counting Type and their Inclusion Relations 1995 12 STACS Green, Lower Bounds for Depth-Three Circuits With Equals and Mod-Gates 1995 12 STACS Krause, On Realizing Iterated Multiplication by Small Depth Threshold Circuits 1995 12 STACS Durand, A Random NP-Complete Problem for Inversion of 2D Cellular Automata 1995 12 STACS Fagnot, On the Subword Equivalence Problem for Infinite Words 1995 12 STACS Garel, On the Separators on an Infinite Word Generated by a Morphism 1995 12 STACS Monti & Peron, Systolic Tree omega-Languages 1995 12 STACS Krishnan & Puri & Brayton, Structural Complexity of omega-Automata 1995 12 STACS Minkwitz, Algorithms Explained by Symmetries 1995 12 STACS Fischer & Preparata & Savage, Generalized Scans and Tri-Diagonal Systems 1995 12 STACS Crochemore & Gasieniec & Plandowski & Rytter, Two-Dimensional Pattern Matching in Linear Time and Small Space 1995 12 STACS Djidjev & Pantziou & Zaroliagis, On-line and Dynamic Algorithms for Shortest Path Problems 1995 12 STACS Cadoli & Donini & Schaerf, On Compact Representations of Propositional Circumscription 1995 12 STACS D'Agostino & Montanari & Policriti, A Set-Theoretic Translation Method for (Poly)modal Logics 1995 12 STACS Maler & Pnueli & Sifakis, On the Synthesis of Discrete Controllers for Timed Systems 1995 12 STACS Boreale & Sangiorgi, A Fully Abstract Semantics for Causality in the pi-Calculus 1995 12 STACS Hromkovic & Lorys & Kanarek & Klasing & Unger & Wagener, On the Sizes of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks 1995 12 STACS Meyer auf der Heide & Scheideler & Stemann, Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations 1995 12 STACS Flammini & Gambosi & Salomone, Interval Routing Schemes 1995 12 STACS Meyer auf der Heide & Vocking, A Packet Routing Protocol for Arbitrary Networks 1995 12 STACS Bercoff, A Family of Tag Systems for Paperfolding Sequences 1995 12 STACS Buntrock & Otto, Growing Context-Sensitive Languages and Church-Rosser Languages 1995 12 STACS Giammarresi & Montalbano, Deterministic Generalized Automata 1995 12 STACS Indyk, Optimal Simulation of Automata by Neural Nets 1995 12 STACS Duris & Rolim, Optimal Lower Bounds on the Multiparty Communication Complexity 1995 12 STACS Babai & Kimmel & Lokam, Simultaneous Messages vs. Communication 1995 12 STACS Bruyere & De Felice, Coding and Strong Coding in Trace Monoids 1995 12 STACS Diekert & Muscholl & Reinhardt, On Codings of Traces 1995 12 STACS Gupta & Nishimura, Finding Largest Common Embeddable Subtrees 1995 12 STACS Kaller & Gupta & Shermer, The Xi_t-Coloring Problem 1995 12 STACS Nikoletseas & Spirakis, Expander Properties in Random Regular Graphs with Edge Faults 1995 12 STACS Gardy & Louchard, Dynamic Analysis of the Sizes of Relations 1995 12 STACS Raz, On Slender Context-free Languages 1995 12 STACS Antimirov, Partial Derivatives of Regular Expressions and Finite Automata Constructions 1995 12 STACS Bracho & Droste & Kuske, Dependence Orders for Computations of Concurrent Automata 1995 12 STACS Fabret & Petit, On the Undecidability of Deadlock Detection in Families of Nets 1995 12 STACS Rub, On the Average Running Time of Odd-Even Merge Sort 1995 12 STACS Kunde & Niedermeier & Reinhardt & Rossmanith, Optimal Average Case Sorting on Arrays 1995 12 STACS Strauss, Normal Numbers and Sources for BPP 1995 12 STACS Hancock & Jiang & Li & Tromp, Lower Bounds on Learning Decision Lists and Trees 1995 12 STACS Damaschke, Line Segmentation of Digital Curves in Parallel 1995 12 STACS Kummer & Schafer, Computability of Convex Sets 1995 12 STACS Ottmann & Schuierer & Soundaralakshmi, Enumerating Extreme Points in Higher Dimensions 1995 12 STACS Petitjean, The Number of Views of Piecewise-Smooth Algebraic Objects 1995 12 STACS Macarie, On the Structure of log-Space Probabilistic Complexity Classes 1995 12 STACS Fortnow & Kummer, Resource-Bounded Instance Complexity 1995 12 STACS Buhrman & Hermo, On the Sparse Set Conjecture for Sets with Low Density 1995 12 STACS Fenner & Fortnow, Beyond P^NP = NEXP 1995 12 STACS Jakoby & Reischuk & Schindelhauer, Malign Distributions for Average Case Circuit Complexity 1995 12 STACS Arques & Michel, A Possible Code in the Genetic Code 1994 11 STACS Seidel, The Nature and Meaning of Perturbations in Geometric Computing 1994 11 STACS Devienne & Lebegue & Routier, One Binary Horn Clause is Enough 1994 11 STACS Bensaou & Guessarian, Transforming Constraint Logic Programs 1994 11 STACS Laroussinie & Schnoebelen, A Hierarchy of Temporal Logics with Past (Extended Abstract) 1994 11 STACS Goubault, The Complexity of Resource-Bounded First-Order Classical Logic 1994 11 STACS Benhamou & Sais & Siegel, Two Proof Procedures for a Cardinality Based Language in Propositional Calculus 1994 11 STACS von Braunmuhl & Gengler & Rettinger, The Alternation Hierarchy for Machines with Sublogarithmic Space is Infinite 1994 11 STACS Naik & Regan & Sivakumar, Quasilinear Time Complexity Theory 1994 11 STACS Macarie, Space-Efficient Deterministic Simulation of Probabilistic Automata (extended abstract) 1994 11 STACS Etessami & Immerman, Reachability and the Power of Local Ordering 1994 11 STACS Mak, Are Parallel Machines Always Faster than Sequential Machines? (Preliminary Version) 1994 11 STACS Comon & Jacquemard, Ground Reducibility and Automata with Disequality Constraints 1994 11 STACS Khasidashvili, Perpetuality and Strong Normalization in Orthogonal Term Rewriting Systems 1994 11 STACS Sattler-Klein, About Changing the Ordering During Knuth-Bendix Completion 1994 11 STACS Ringeissen, Combination of Matching Algorithms 1994 11 STACS Kik & Kutylowski & Stachowiak, Periodic Constant Depth Sorting Networks 1994 11 STACS Chlebus & Gasieniec, Optimal Pattern Matching on Meshes 1994 11 STACS Kunde & Niedermeier & Rossmanith, Faster Sorting and Routing on Grids with Diagonals 1994 11 STACS Sibeyn & Kaufmann, Deterministic 1-k Routing on Meshes, With Applications to Worm-Hole Routing 1994 11 STACS Hofmann & Pierce, A Unifying Type-Theoretic Framework for Objects 1994 11 STACS Avenhaus & Becker, Operational Specifications with Built-Ins 1994 11 STACS Gribomont & Hagelstein, Reactive Variables for System Specification and Design 1994 11 STACS Regan, A New Parallel Vector Model, with Exact Characterization of NC^k 1994 11 STACS Alvarez & Jenner, On Adaptive Dlogtime and Polylogtime Reductions (Extended Abstract) 1994 11 STACS Ogiwara, NC^k(NP) = AC^{k-1}(NP) 1994 11 STACS Arnold, Hypertransition Systems 1994 11 STACS Metivier & Richomme, On the Star Operation and the Finite Power Property in Free Partially Commutative Monoids (Extended Abstract) 1994 11 STACS Bruyere & De Felice & Guaiana, Coding with Traces 1994 11 STACS Giammarresi & Restivo & Seibert & Thomas, Monadic Second-order Logic over Pictures and Recognizability by Tiling Systems 1994 11 STACS Delest & Dubernard, q-Grammars: Results, Implementation 1994 11 STACS Karner, A Topology for Complete Semirings 1994 11 STACS Book & Lutz & Martin, The Global Power of Additional Queries to Random Oracles 1994 11 STACS Lutz & Mayordomo, Cook Versus Karp-Levin: Separating Completeness Notions if NP Is not Small (Extended Abstract) 1994 11 STACS Thierauf & Toda & Watanabe, On Sets Bounded Truth-Table Reducible to P-selective Sets 1994 11 STACS Selivanov, Two Refinements of the Polynomial Hierarchy 1994 11 STACS Vollmer, On Different Reducibility Notions for Function Classes 1994 11 STACS Luby & Ertel, Optimal Parallelization of Las Vegas Algorithms 1994 11 STACS Datta, Efficient Parallel Algorithms for Geometric k-Clustering Problems (Extended Abstract) 1994 11 STACS Maheshwari & Lingas, A Simple Optimal Parallel Algorithm for Reporting Paths in a Tree 1994 11 STACS Apostolico & Breslauer & Galil, Parallel Detection of all Palindromes in a String 1994 11 STACS Cai & Chen & Downey & Fellows, On the Structure of Parameterized Problems in NP (Extended Abstract) 1994 11 STACS Amaldi & Kann, On the Approximability of Finding Maximum Feasible Subsystems of Linear Systems 1994 11 STACS Borchert, On the Acceptance Power of Regular Languages 1994 11 STACS Hertrampf, Complexity Classes with Finite Acceptance Types 1994 11 STACS Parrow & Sjodin, The Complete Axiomatization of Cs-congruence 1994 11 STACS van Oostrom & de Vink, Transition System Specifications in Stalk Format with Bisimulation as a Congruence 1994 11 STACS Jancar, Decidability Questions for Bisimilarity of Petri Nets and Some Related Problems 1994 11 STACS Buntrock & Lorys, The Variable Membership Problem: Succinctness Versus Complexity 1994 11 STACS Weber & Klemm, Economy of Description for Single-valued Transducers 1994 11 STACS Shallit & Breitbart, Automaticity: Properties of a Measure of Descriptional Complexity (Extended Abstract) 1994 11 STACS Harel, Towards a Theory of Recursive Structures 1994 11 STACS Arimura & Shinohara & Otsuki, Finding Minimal Generalizations for Unions of Pattern Languages and Its Application to Inductive Inference from Positive Data 1994 11 STACS Mateescu & Salomaa, Nondeterminism in Patterns 1994 11 STACS Dancik & Paterson, Upper Bounds for the Expected Length of a Longest Common Subsequence of Two Binary Sequences 1994 11 STACS Petersen, The Ambiguity of Primitive Words 1994 11 STACS Lam, On Codes Having No Finite Completion 1994 11 STACS Lipton, A New Approach To Information Theory 1994 11 STACS Le, On Voronoi Diagrams in the L_p-Metric in Higher Dimensions 1994 11 STACS Kao, Total Protection of Analytic Invariant Information in Cross Tabulated Tables 1994 11 STACS Dragan & Brandstadt, Dominating Cliques in Graphs with Hypertree Structure 1994 11 STACS Deogun & Kloks & Kratsch & Muller, On Vertex Ranking for Permutation and Other Graphs 1994 11 STACS Kloks & Kratsch, Finding All Minimal Separators of a Graph 1994 11 STACS Bodlaender & Jansen, On the Complexity of the Maximum Cut Problem 1993 10 STACS Castellani, Causal and Distributed Semantics for Concurrent Processes 1993 10 STACS von Braunmuehl, Alternation for Two-way Machines with Sublogarithmic Space 1993 10 STACS Liskiewicz & Reischuk, Separating the Lower Levels of the Sublogarithmic Space Hierarchy 1993 10 STACS Koebler, Locating P/poly Optimally in the Extended Low Hierarchy 1993 10 STACS Lutz & Mayordomo, Measure, Stochasticity, and the Density of Hard Languages 1993 10 STACS Devienne & Lebegue & Routier, Halting Problem of one Binary Horn Clause is Undecidable 1993 10 STACS Chaochen & Hansen & Sestoft, Decidability Results for Duration Calculus 1993 10 STACS de Groote, Defining lambda-typed lambda-calculi by Axiomatizing the Typing Relation 1993 10 STACS Eiter & Gottlob, The Complexity of Logic-based Abduction 1993 10 STACS Kloks & Kratsch, Treewidth of Chordal Bipartite Graphs 1993 10 STACS Huckenbeck, On Paths in Networks with Valves 1993 10 STACS Sunder & He, Scheduling Interval Ordered Tasks in Parallel 1993 10 STACS Pietracaprina & Preparata, An O(sqrt(n))-Worst-Case-Time Solution to the Granularity Problem 1993 10 STACS Desel & Reisig, The Synthesis Problem of Petri Nets 1993 10 STACS Best & Devillers & Esparza, General Refinement and Recursion Operators for the Petri Box Calculus 1993 10 STACS Bonacina & Hsiang, On Fairness in Distributed Automated Deduction 1993 10 STACS Mayr & Werchner, Divide-and-Conquer Algorithms on the Hypercube 1993 10 STACS Allender & Balcazar & Immerman, A First-order Isomorphism Theorem 1993 10 STACS Buhrmann & Hoene & Torenvliet, Splittings, Robustness and Structure of Complete Sets 1993 10 STACS Hemachandra & Jha, Defying Upward and Downward Separation 1993 10 STACS Hoene & Nickelsen, Counting, Selecting, and Sorting by Query-bounded Machines 1993 10 STACS Jantzen & Petersen, Cancellation in Context-free Languages: Enrichment by Reduction 1993 10 STACS Cassaigne, Counting Overlap-free Binary Words 1993 10 STACS Narbel, The Limit Set of Recognizable Substitution Systems 1993 10 STACS Krob & Lalonde, Partially Commutative Lyndon Words 1993 10 STACS Monien & Feldmann & Klasing & Luling, Parallel Architectures: Design and Efficient Use 1993 10 STACS Formann, Weighted Closest Pairs 1993 10 STACS Schuierer, Rectilinear Path Queries in a Simple Rectilinear Polygon 1993 10 STACS Czumaj, Parallel Algorithm for the Matrix Chain Product and the Optimal Triangulation Problem 1993 10 STACS Dessmark & Lingas & Maheshwari, Multi-list Ranking: Complexity and Applications 1993 10 STACS Kucera & Mehlhorn & Preis & Schwarzenecker, Exact Algorithms for a Geometric Packing Problem 1993 10 STACS Maler, A Decomposition Theorem for Probabilistic Transition Systems 1993 10 STACS Montalbano, Local Automata and Completion 1993 10 STACS Culik & Dube, Efficient Compression of Wavelet Coefficients for Smooth and Fractal-like Data 1993 10 STACS Ibarra & Jiang & Tran & Wang, On the Equivalence of Two-way Pushdown Automata and Counter Machines over Bounded Languages 1993 10 STACS Cosnard & Garzon & Koiran, Computability Properties of Low-dimensional Dynamical Systems 1993 10 STACS Abrahamson & Downey & Fellows, Fixed-Parameter Intractability II 1993 10 STACS Fich & Impagliazzo & Kapron & King & Kutylowski, Limits on the Power of Parallel Random Access Machines with Weak Forms of Write Conflict Resolution 1993 10 STACS Fenner & Homer & Ogiwara & Selman, On Using Oracles that Compute Values 1993 10 STACS Gengler, Multicounter Automata with Sublogarithmic Reversal Bounds 1993 10 STACS Uselton, Structured Operational Semantics for Concurrency and Hierarchy 1993 10 STACS Hungar, The Complexity of Verifying Functional Programs 1993 10 STACS Lentfert & Swierstra, Towards the Formal Design of Self-stabilizing Distributed Algorithms 1993 10 STACS Penczek, Axiomatizations of Temporal Logics on Trace Systems 1993 10 STACS Luerwer-Brueggemeier & Meyer auf der Heide, Capabilities and Complexity of Computations with Integer Division 1993 10 STACS Niedermeier & Rossmanith, Extended Locally Definable Acceptance Types 1993 10 STACS Fenner & Fortnow & Li, Gap-definability as a Closure Property 1993 10 STACS Choffrut & Guerra, On the Logical Definability of Some Rational Trace Languages 1993 10 STACS Gilleron & Tison & Tommasi, Solving Systems of Set Constraints Using Tree Automata 1993 10 STACS Lugiez & Moysset, Complement Problems and Tree Automata in AC-like Theories 1993 10 STACS Babai, Transparent (Holographic) Proofs 1993 10 STACS Zhang & Barrington & Tarui, Computing Symmetric Functions with AND/OR Circuits and a Single MAJORITY Gate 1993 10 STACS Maciel & Therien, Threshold Circuits for Iterated Multiplication: Using AC^0 for Free 1993 10 STACS Beaudry & McKenzie & Peladeau, Circuits with Monoidal Gates 1993 10 STACS Istrail & Zivkovic, A Non-probabilistic Switching Lemma for the Sipser Function 1993 10 STACS Gergov & Meinel, Frontiers of Feasible and Probabilistic Feasible Boolean Manipulation with Branching Programs 1993 10 STACS Maler & Staiger, On Syntactic Congruences for omega-Languages 1993 10 STACS Varricchio, A Polynomial Time Algorithm for the Equivalence of Two Morphisms on omega-Regular Languages 1993 10 STACS Wilke, Locally Threshold Testable Languages of Infinite Words 1993 10 STACS Diekert & Muscholl, Deterministic Asynchronous Automata for Infinite Traces 1993 10 STACS Staiger, Recursive Automata on Infinite Words 1993 10 STACS Sairam & Vitter & Tamassia, A Complexity Theoretic Approach to Incremental Computation 1993 10 STACS Reischuk & Schindelhauer, Precise Average Case Complexity 1993 10 STACS Miltersen, The Bit Probe Complexity Measure Revisited 1993 10 STACS Baliga & Case & Jain, Language Learning with Some Negative Information 1993 10 STACS Lange & Zeugmann, Language Learning with a Bounded Number of Mind Changes 1993 10 STACS Blundo & De Santis & Vaccaro, Efficient Sharing of Many Secrets 1993 10 STACS Naher, LEDA -- A Library of Efficient Data Types and Algorithms 1992 9 STACS Gaudel, Structuring and Modularizing Algebraic Specifications: The PLUSS Specification Language, Evolution and Perspectives 1992 9 STACS Gupta & Nishimura, The Parallel Complexity of Tree Embedding Problems 1992 9 STACS Condon, A Theory of Strict P-completeness 1992 9 STACS Hagerup, Fast and Optimal Simulations between CRCW PRAMs 1992 9 STACS Nassor & Vidal-Naquet, Suitability of the Propositional Temporal Logic to Express Properties of Real-Time Systems 1992 9 STACS Billaud, Axiomatizations of Backtracking 1992 9 STACS Villemaire, Joining k- and l-recognizable Sets of Natural Numbers 1992 9 STACS Meyer auf der Heide & Pham, On the Performance of Networks with Multiple Busses 1992 9 STACS Radhakrishnan & Hunt & Stearns, Efficient Algorithms for Solving Systems of Linear Equations and Path Problems 1992 9 STACS Larmore & Rytter, Efficient Sublinear Time Parallel Algorithms for Dynamic Programming and Context-Free Recognition 1992 9 STACS Preparata & Vitter, Simplified Technique for Hidden-Line Elimination in Terrains 1992 9 STACS Kalyanasundaram & Pruhs, A Competitive Analysis of Nearest Neighbor Based Algorithms for Searching Unknown Scenes 1992 9 STACS Bogaert & Tison, Equality and Disequality Constraints on Direct Subterms in Tree Automata 1992 9 STACS Bruggemann-Klein & Wood, Deterministic Regular Languages 1992 9 STACS Sheu & Long, The Extended Low Hierarchy Is an Infinite Hierarchy 1992 9 STACS Hertrampf, Locally Definable Acceptance Types for Polynomial Time Machines 1992 9 STACS Ambos-Spies & Nies, The Theory of Polynomial Many-One Degrees of Recursive Sets is Undecidable 1992 9 STACS Bartling & Hinrichs, A Plane-sweep Algorithm for Finding a Closest Pair Among Convex Planar Objects 1992 9 STACS Robert & Toussaint, Linear Approximation of Simple Objects 1992 9 STACS Kapur & Bilardi, Language Learning without Overgeneralization 1992 9 STACS Hagerup, The Log-Star Revolution 1992 9 STACS Damm & Meinel & Krause & Waack, Separating Counting Communication Complexity Classes 1992 9 STACS Gubas & Hromkovic & Waczulik, A Nonlinear Lower Bound on the Practical Combinational Complexity 1992 9 STACS Castro & Seara, Characterization of some Complexity Classes Between Q_2^p and /\_2^p 1992 9 STACS Book & Lutz & Wagner, On Complexity Classes and Algorithmically Random Languages 1992 9 STACS Lorys, New Time Hierarchy Results for Deterministic TMs 1992 9 STACS Pfitemann & Waidner, Unconditional Byzantine Agreement for any Number of Faulty Processors 1992 9 STACS Klasing & Monien & Peine & Stohr, Broadcasting in Butterfly and DeBruijn Networks 1992 9 STACS Diehl & Jard, Interval Approximations of Message Causality in Distributed Executions 1992 9 STACS Kann, On the Approximability of the Maximum Common Subgraph Problem 1992 9 STACS Unger, The Complexity of Colouring Circle Graphs 1992 9 STACS Kobler & Schoning & Toran, Graph Isomorphism is Low for PP 1992 9 STACS Bodlaender & Kloks, A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs 1992 9 STACS Blum, On Locally Optimal Alignments in Genetic Sequences 1992 9 STACS Ostrovsky & Venkatesan & Yung, Secure Commitment Against A Powerful Adversary 1992 9 STACS De Santis & Persiano, Communication Efficient Zero-Knowledge Proofs of Knowledge (With Applications to Electronic Cash) 1992 9 STACS Clarkson & Mehlhorn & Seidel, Four Results on Randomized Incremental Constructions 1992 9 STACS Becker & Gschwind & Ohler & Thiemt & widmayer & Franciosa, Enclosing Many Boxes by an Optimal Pair of Boxes 1992 9 STACS Kaufmann & Molitor & vogelgesang, Performance Driven k-Layer Wiring 1992 9 STACS Hansel & Perrin & Simon, Compression and Entropy 1992 9 STACS Culik & Karhumaki, Interactive Devices Generating Infinite Words 1992 9 STACS De Felice, On the Factorization Conjecture 1992 9 STACS Deiss, Conditional Semi-Thue Systems for Presenting Monoids 1992 9 STACS Sharir & Welzl, A Combinatorial Bound for Linear Programming and Related Problems 1992 9 STACS Carlsson & Katajainen & Teuhola, In-place Linear Probing Sort 1992 9 STACS Czumaj & Gasieniec & Jarominek & Plandowski & Rytter, Speeding Up Two String-Matching Algorithms 1992 9 STACS Billaud, The ANIGRAF System 1992 9 STACS Champarnaud, A Programming Language for Symbolic Computation of Regular Languages, Automata and Semigroups 1992 9 STACS Collavizza, microSPEED: a System for the Specification and Verification of Microprocessors 1992 9 STACS Grammatikakis & Jwo, A Discrete Event Simulator of Communication Algorithms in Interconnection Networks 1992 9 STACS Le Verge, ALPHA DU CENTAUR: An Environment for the Design of Systolic Arrays 1992 9 STACS Madelaine & Vergamini, Verification of Communicating Processes by Means of Automata Reduction and Abstraction 1992 9 STACS Spirakis & Tampakas & Papatriantafillou & Konstantoulis & Vlaxodimitropoulos & Antonopoulos & Kazazis & Metallidou & Spartiotis, Distributed Systme Simulator (DSS) 1992 9 STACS Lin, An Interactive Proof Tool for Process Algebras 1992 9 STACS Bachmann & Drescher & Nieke, SPECI90 -- A Term Rewriting and Narrowing System 1991 8 STACS Leszczylowski & Wirsing, Polymorphism, Parameterization and Typing: An Algebraic Specification Perspective 1991 8 STACS Jouannaud, Executable Higher-order Algebraic Specifications 1991 8 STACS Vitter, Efficient Memory Access in Large-scale Computation 1991 8 STACS Roth, l-Occurrences of Avoidable Patterns 1991 8 STACS Frougny & Sakarovitch, Rational Relations with Bounded Delay 1991 8 STACS Schmidt, On the Power of Several Queues 1991 8 STACS Guaiana & Restivo & Salemi, On Aperiodic Trace Languages 1991 8 STACS Gastin, Recognizable and Rational Languages of Finite and Infinite Traces 1991 8 STACS Diekert, On the Concatenation of Infinite Traces 1991 8 STACS Serna & Spirakis, Tight RNC Approximations to Max Flow 1991 8 STACS Godau, A Natural Metric for Curves -- Computing the Distance for Polygonal Chains and Approximation Algorithms 1991 8 STACS Wegener, The Worst Case Complexity of the McDiarmid and Reed's Variant of BOTTOM-UP-HEAP SORT is Less than n log n + 1.1 n 1991 8 STACS Gilleron, Decision Problems for Term Rewriting Systems and Recognizable Tree Languages 1991 8 STACS Madlener & Otto, Decidable Sentences for Context-free Groups 1991 8 STACS Rossmanith, The Owner Concept for PRAMs 1991 8 STACS Baude & Vidal-Naquet, Actors as a Parallel Programming Model 1991 8 STACS Albert & Casas & Fages & Torrecillas & Zimmermann, Average Case Analysis of Unification Algorithms 1991 8 STACS Wang & Shyamasundar, Methodology for Proving the Termination of Logic Programs 1991 8 STACS Santha & Wilson, Polynomial Size constant Depth Circuits with a Limited Number of Negations 1991 8 STACS Tarui, Randomized Polynomials, Threshold Circuits, and the Polynomial Hierarchy 1991 8 STACS Brassard & Crepeau & Laplante & Leger, Computationally Convincing Proofs of Knowledge 1991 8 STACS Fortnow & Lund, Interactive Proof Systems and Alternating Time-Space Complexity 1991 8 STACS Schmeltz, Optimal Tradeoffs between Time and Bit Complexity in Distributed Synchronous Rings 1991 8 STACS Baum-Waidner & Pfitzmann & Waidner, Unconditional Byzantine Agreement with Good Majority 1991 8 STACS Carlsson & Mattsson & Poblete & Bengtsson, A New Compacting Garbage-Collection Algorithm with a Good Average-Case Performance 1991 8 STACS Vogler, Bisimulation and Action Refinement 1991 8 STACS Jeron, Testing for Unboundedness of FIFO Channels 1991 8 STACS Beauquier & Choquet & Petit & Vidal-Naquet, Detection of Deadlocks in an Infinite Family of Nets 1991 8 STACS Buss & Goldsmith, Nondeterminism within P 1991 8 STACS Buntrock & Damm & Hertrampf & Meinel, Structure and Importance of Logspace-MOD-Classes 1991 8 STACS Rutenburg, Complexity Classification of Truth Maintenance Systems 1991 8 STACS Desel & Esparza, Reachability in Reversible Free Choice Systems 1991 8 STACS Best & Cherkasova & Desel, Compositional Generation of Home States in Free Choice Systems 1991 8 STACS Buhrman & Spaan & Torenvliet, Bounded Reductions 1991 8 STACS Alvarez & Balcazar & Jenner, Functional Oracle Queries as a Measure of Parallel Time 1991 8 STACS Pitsch & Schomer, Optimal Parallel Recognition of Bracket Languages on Hypercubes 1991 8 STACS Rajasekaran & Overholt, constant Queue Routing on a Mesh 1991 8 STACS Condon, The Complexity of the Max Word Problem and the Power of One-way Interactive Proof Systems 1991 8 STACS Gradel, The Expressive Power of Second Order Horn Logic 1991 8 STACS De Santis & Persiano, Tight Bounds on the Path Length of Binary Trees 1991 8 STACS Hartmann, The Random Testability of the n-Input AND Gate 1991 8 STACS Schoett, An Observational subset of First-order Logic Cannot Specify the Behaviour of a Counter (Extended Abstract) 1991 8 STACS Densi & Delahaye, Unfolding, Procedural and Fixpoint Semantics of Logic Programs 1991 8 STACS Balbiani, A Modal Semantics for the Negation as Failure and the Closed World Assumption Rules 1991 8 STACS Jeron, Prototype of a Verification Tool 1991 8 STACS Kroeger & Schmitz, IPG - An Interactive Parser Generator 1990 7 STACS Allender & Beigel & Hertrampf & Homer, A Note on the Almost-Everywhere Hierarchy for Nondeterministic Time 1990 7 STACS Allouche & Shallit, The Ring of k-Regular Sequences 1990 7 STACS Ambos-Spies & Homer & Soare, Minimal Pairs and Complete Problems 1990 7 STACS Beaver & Feigenbaum, Hiding Instances in Multioracle Queries 1990 7 STACS Beigel & Gill & Hertrampf, Counting Classes: Thresholds, Parity, Mods, and Fewness 1990 7 STACS Cai & Condon & Lipton, Playing Games of Incomplete Information 1990 7 STACS Chytil & Monien, Caterpillars and Context-Free Languages 1990 7 STACS Clerbout & Roos, Semi-Commutations and Algebraic Languages 1990 7 STACS Corradini & Montanari, Towards a Process Semantics in the Logic Programming Style 1990 7 STACS Crochemore & Rytter, Parallel Computations on Strings and Arrays 1990 7 STACS Das & Joseph, Minimum Vertex Hulls for Polyhedral Domains 1990 7 STACS Diekert, Combinatorial Rewriting on Traces 1990 7 STACS Joseph & Sitharam, Kolmogorov Complexity, Restricted Nondeterminism and Generalized Spectra 1990 7 STACS Kreowski & Qian, Relation-Sorted Algebraic Specifications with Built-in Coercers: Basic Notions and Results 1990 7 STACS Kutylowski, Computational Power of One-way Multihead Finite Automata 1990 7 STACS Lai & Wood, Updating Almost Complete Trees or One Level Makes All the Difference 1990 7 STACS Lambert, Sorting the Sums (x_i + y_j) in O(n^2) Comparisons 1990 7 STACS Lipton, Efficient Checking of Computations 1990 7 STACS Longpre & Selman, Hard Promise Problems and Nonuniform Complexity 1990 7 STACS Mehlhorn & Meiser & O'Dunlaing, On the Construction of Abstract Voronoi Diagrams 1990 7 STACS Schwarzkopf & Fuchs & Rote & Welzl, Approximation of Convex Figures by Pairs of Rectangles 1990 7 STACS Schwill, Nonblocking Graphs: Greedy Algorithms to Compute Disjoint Paths 1990 7 STACS Thomas, Infinite Trees and Automaton Definable Relations over omega-Words 1990 7 STACS Viennot, Enumerative Combinatorics and Computer Science 1990 7 STACS Vogler, Failures Semantics Based on Interval Semiwords is a Congruence for Refinement 1990 7 STACS Yannakakis, The Analysis of Local Search Problems and Their Heuristics 1989 6 STACS Meyer auf der Heide, On Genuinely Time-Bounded Computations 1989 6 STACS Mosses, Unified Algebras and Action Semantics 1989 6 STACS Berstel, Properties of Infinite Words: Recent Results 1989 6 STACS Lucio-Carrasco & Gavilanes-Franco, A First Order Logic for Partial Functions 1989 6 STACS Hennicker, Observational Implementations 1989 6 STACS Alevizos & Boissonnat & Preparata, On the Boundary of a Union of Rays 1989 6 STACS Preparata & Tamassia, Dynamic Planar Point Location with Optimal Query Time 1989 6 STACS Djidjev & Lingas & Sack, An O(n log n) Algorithm for Computing a Link Center in a Simple Polygon 1989 6 STACS Gutjahr & Welzl & Woeginger, Polynomial Graph-Colorings 1989 6 STACS Meyer auf der Heide & Wanka, Time-Optimal Simulations of Networks by Universal Parallel Computers 1989 6 STACS Hinz, Classes of Picture Languages that Cannot Be Distinguished in the Chain Code Concept and Deletion of Redundant Retreats 1989 6 STACS Frougny, Linear Numeration Systems, Theta-Developments and Finite Automata 1989 6 STACS Shallit, A Generalization of Automatic Sequences 1989 6 STACS Diekert, Word Problems Over Traces Which Are Solvable in Linear Time 1989 6 STACS Meyer auf der Heide, Computing Minimum Spanning Forests on 1- and 2-Dimensional Processor Arrays 1989 6 STACS Schwarzkopf, Parallel Computation of Discrete Voronoi Diagrams 1989 6 STACS Fussell & Thurimella, Successive Approximation in Parallel Graph Algorithms 1989 6 STACS Buntrock & Hoene, Reversals and Alternation 1989 6 STACS Cai & Hemachandra, On the Power of Parity Polynomial Time 1989 6 STACS Ganesan & Homer, Complete Problems and Strong Polynomial Reducibilities 1989 6 STACS Szepietowski, If Deterministic and Nondeterministic Space Complexities Are Equal for log log n Then They Are Also Equal for log n 1989 6 STACS Berman & Schnitger, On the Complexity of Approximating the Independent Set Problem 1989 6 STACS Lavault, Average Number of Messages for Distributed Leader Finding in Rings of Processors 1989 6 STACS Overmars & Santoro, Time vs. Bits 1989 6 STACS Beame & Bodlaender, Distributed Computing on Transitive Networks: The Torus 1989 6 STACS Santoro & Widmayer, Time is not a Healer 1989 6 STACS Reischuk & Schmeltz, Area Efficient Methods to Increase the Reliability of Combinatorial Circuits 1989 6 STACS Doenhardt, Fault Masking Probabilities with Single and Multiple Signature Analysis 1989 6 STACS Hermann, Chain Properties of Rule Closures 1989 6 STACS Narendran & Stillman, It is Undecidable Whether the Knuth-Bendix Completion Procedure Generates a Crossed Pair 1989 6 STACS Nickl, Algebraic Specifications for Domain Theory 1989 6 STACS Batarekh & Subrahmanian, The Query Topology in Logic Programming 1989 6 STACS Beaudry & McKenzie & Therien, Testing Membership: Beyond Permutation Groups 1989 6 STACS Mayr, Membership in Polynomial Ideals over Q Is Exponential Space Complete 1989 6 STACS Verma & Ramakrishnan, Some Complexity Theoretic Aspects of AC Rewriting 1989 6 STACS Jonsson & Parrow, Deciding Bisimulation Equivalences for a Class of Non-Finite-State Programs 1989 6 STACS Charron-Bost, Measure of Parallelism of Distibuted Computations 1989 6 STACS Jancar, Decidability of Weak Fairness in Petri Nets 1989 6 STACS Pin & Straubing & Therien, New Results on the Generalized Star-Height Problem 1989 6 STACS Culik & Karhumaki, On the Equivalence Problem for Deterministic Multitape Automata and Transducers 1989 6 STACS Seidl, Deciding Equivalence of Finite Tree Automata 1989 6 STACS van Kreveld & Overmars, Concatenable Segment Trees 1989 6 STACS Schwill, Shortest Edge-Disjoint Paths in Graphs 1989 6 STACS Kalyanasundaram & Schnitger, Rounds versus Time for the Two Person Pebble Game 1989 6 STACS Himsolt, Graph^Ed: An Interactive Graph Editor 1989 6 STACS Kell & Maier & Potthoff & Thomas & Wermuth, AMORE: A System for Computing Automata, MOnoids, and Regular Expressions 1988 5 STACS Schnorr, Geometry of Numbers and Integer Programming 1988 5 STACS Gambosi & Italiano & Talamo, Getting Back to the Past in the Union-Find Problem 1988 5 STACS Becker & Kolla, On the Construction of Optimal Time Adders 1988 5 STACS Just & Meyer auf der Heide & Wigderson, On Computations with Integer Division 1988 5 STACS Overmars & Smid, Maintaining Range Trees in Secondary Memory 1988 5 STACS Fernandez-Baca & Slutzki, Solving Parametric Problems on Trees 1988 5 STACS Unger, On the k-Colouring of Circle-Graphs 1988 5 STACS Bergeron & Labelle & Leroux, Functional Equations for Data Structures 1988 5 STACS Meinel, The Power of Polynomial Size Omega-branching Programs 1988 5 STACS Schoening & Wagner, Collapsing Oracle Hierarchies, Census Functions and Logarithmically Many Queries 1988 5 STACS Gradel, Domino Games with an Application to the Complexity of Boolean Algebras with Bounded Quantifier Alternations 1988 5 STACS Wald, An Automatic Speed-up of Random Access Machines with Powerful Arithmetic Instructions 1988 5 STACS Jenner & Kirsig, Characterizing the Polynomial Hierarchy by Alternating Auxiliary Pushdown Automata 1988 5 STACS Diekert & Moebus, Hotz-Isomorphism Theorems in Formal Language Theory 1988 5 STACS Heuter, First-order Properties of Trees, Star-free Expressions and Aperiodicity 1988 5 STACS Terlutte, Cyclic Rational Transductions and Polynomials of Rational Functions 1988 5 STACS De Felice, Construction of a Family of Finite Maximal Codes 1988 5 STACS Allouch & Rande & Thimonier, Fonctions Generatrices Transcendantes a Coefficients Engendres par Automates 1988 5 STACS File, The Relation of Two Patterns with Comparable Languages 1988 5 STACS Bousdira & Remy, Hierarchical Contextual Rewriting with Several Levels 1988 5 STACS Astesiano & Giovini & Reggio, Generalized Bisimulation in Relational Specifications 1988 5 STACS Brandenburg, On Polynomial Time Graph Grammars 1988 5 STACS Courcelle, An Axiomatic Definition of Context-Free Rewriting and its Application to NLC Graph Grammars 1988 5 STACS Spirakis & Tampakas, Efficient Distributed Algorithms by Using the Archimedean Time Assumption 1988 5 STACS Abadi & Feigenbaum, A Simple Protocol for Secure Circuit Evaluation 1988 5 STACS Chen & Lai, Scheduling Independent Jobs on Hypercubes 1988 5 STACS Klein & Wood, Voronoi Diagrams based on General Metrics in the Plane 1988 5 STACS Santoro & Sidney & Sidney & Urrutia, Geometric Containment, Common Roots of Polynomials and Partial Orders 1988 5 STACS Lienhardt, Extension of the Notion of Map and Subdivisions of a Three-Dimensional Space 1988 5 STACS Sack & Suri, An Optimal Algorithm for Detecting Weak Visibility of a Polygon 1988 5 STACS Avnaim & Boissonnat, Polygon Placement under Translation and Rotation 1988 5 STACS Bruschi & Pighizzini & Sabadini, On the Existence of the Minimum Asynchronous Automaton and on Decision Problems for Unambiguous Regular Trace Languages 1988 5 STACS Ochmanski, On Morphisms of Trace Monoids 1988 5 STACS Guessarian & Niar-Dinedane, An Automaton Characterization of Fairness in SCCS 1988 5 STACS Kok, A Compositional Semantics for Concurrent Prolog 1987 4 STACS Book, Towards a Theory of Relativizations: Positive Relativizations 1987 4 STACS Kahn, Natural Semantics 1987 4 STACS Mehlhorn & Kaufmann, On Local Routing of Two-Terminal Nets 1987 4 STACS Aurenhammer & Imai, Geometric Relations among Voronoi Diagrams 1987 4 STACS Brock, Finding the Largest Empty Rectangle on a Grated Surface 1987 4 STACS Koshi & Varman, Efficient Graph Algorithms Using Limited Communication on a Fixed-Size Array of Processors 1987 4 STACS Ravikumar & Ganesan & Lakshmanan, On Selecting the Largest Element in Spite of Erroneous Information 1987 4 STACS Lengauer & Wagner, The Correlation between the Complexities of the Non-Hierarchical and Hierarchical Versions of Graph Problems 1987 4 STACS Schoening, Graph Isomorphism is in the Low Hierarchy 1987 4 STACS Geske & Huynh & Selman, A Hierarchy Theorem for Almost Everywhere Complex Sets with Application to Polynomial Complexity Degrees 1987 4 STACS Balcazar, Self-Reducibility 1987 4 STACS Cai, Probability One Separation of the Boolean Hierarchy 1987 4 STACS Hromkovic, Reversal Complexity of Multicounter and Multihead Machines 1987 4 STACS Bertoni & Goldwurm & Sabadini, Computing the Counting Function of Context-free Languages 1987 4 STACS Keranen, On the k-Freeness of Morphisms on Free Monoids 1987 4 STACS Schmidt, Avoidable Patterns on 2 Letters 1987 4 STACS Arfi, Polynomial Operations on Rational Languages 1987 4 STACS Habel & Kreowski, Some Structural Aspects of Hypergraph Languages Generated by Hyperedge Replacement 1987 4 STACS Kaplan & Pnueli, Specification and Implementation of Concurrently Accessed Data Structures: An Abstract Data Type Approach 1987 4 STACS Beierle & Voss, On Implementation of Loose Abstract Data Type Specifications and their Vertical Composition 1987 4 STACS Nipkow, Are Homomorphisms Sufficient for Behavioural Implementations of Deterministic and Nondeterministic Data Types? 1987 4 STACS Diekert, Some Remarks on Presentations by Finite Church-Rosser Thue Systems 1987 4 STACS Ganzinger, Ground Term Confluence in Parametric Conditional Equational Specifications 1987 4 STACS Schmidt & Berghammer & Zierer, Describing Semantic Domains with Sprouts 1987 4 STACS Astesiano & Reggio, Comparing Direct and Continuation Semantics Styles for Concurrent Languages 1987 4 STACS Arvind & Biswas, Expressibility of First Order Logic with a Nondeterministic Inductive Operator 1987 4 STACS van Glabbeek, Bounded Nondeterminism and the Approximation Induction Principle in Process Algebra 1987 4 STACS Taubner & Vogler, The Step Failure Semantics 1987 4 STACS Howell & Huynh & Rosier & Yen, On the Complexity of Containment, Equivalence and Reachability for Finite and 2-Dimensional Vector Addition Systems with States 1987 4 STACS Pelz, Closure Properties of Deterministic Petri Nets 1987 4 STACS Priese & Rehrmann & Willecke-Klemme, Some Results on Fairness: The Regular Case 1987 4 STACS Carstensen, Decidability Questions for Fairness in Petri Nets 1987 4 STACS Kunde, Optimal Sorting on Multi-Dimensionally Mesh-Connected Computers 1987 4 STACS Molitor, On the Contact-Minimization Problem 1987 4 STACS Bar-Yehuda & Kutten & Wolfstahl & Zaks, Making Distributed Spanning Tree Algorithms Fault-Resilient 1987 4 STACS Tel & Tan & van Leeuwen, The Derivation of On-the-Fly Garbage Collection Algorithms from Distributed Termination Detection Protocols 1987 4 STACS Santoro & Sidney & Sidney, On the Expected Complexity of Distributed Selection 1986 3 STACS Aarts & de Bont & Habers & van Laarhoven, A Parallel Statistical Cooling Algorithm 1986 3 STACS Balcazar & Book, On Generalized Kolmogorov Complexity 1986 3 STACS Bernot & Bidoit & Choppy, Abstract Implementations and Correctness Proofs 1986 3 STACS Bodlaender & van Leeuwen, New Upper Bounds for Decentralized Extrema-Finding in a Ring of Processors 1986 3 STACS Borodin & Fich & Meyer auf der Heide & Upfal & Wigderson, A Time-Space Tradeoff for Element Distinctness 1986 3 STACS Caucal, Decidabilite de l'Egalite des Langages Algebriques Infinitaires Simples 1986 3 STACS Choffrut & Schutzenberger, Decomposition de Fonctions Rationnelles 1986 3 STACS Darondeau, Separating and Testing 1986 3 STACS Duboc, Equations in Free Partially Commutative Monoids 1986 3 STACS Emerson & Lei, Temporal Reasoning under Generalized Fairness Constraints 1986 3 STACS Frutos Escrig, Some Probabilistic Powerdomains in the Category SFP 1986 3 STACS Gamatie, Towards Specification and Proof of Asynchronous Systems 1986 3 STACS Hartmanis & Hemachandra, On Sparse Oracles Separating Feasible Complexity Classes 1986 3 STACS Hastad & Helfrich & Lagarias & Schnorr, Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers 1986 3 STACS Hunt & Stearns, Monotone Boolean Formulas, Distributive Lattices, and the Complexities of Logics, Algebraic Structures, and Computation Structures 1986 3 STACS Ibarra & Ravikumar, On Sparseness, Ambiguity and Other Decision Problems for Acceptors and Transducers 1986 3 STACS Kelter, Strictness and Serializability 1986 3 STACS Kintala & Wotschke, Concurrent Conciseness of Degree, Probabilistic, Nondeterministic and Deterministic Finite Automata 1986 3 STACS Lengauer, Efficient Algorithms for Finding Minimum Spanning Forests of Hierarchically Defined Graphs 1986 3 STACS Lingas, Subgraph Isomorphism for Biconnected Outerplanar Graphs in Cubic Time 1986 3 STACS Mehlhorn & Preparata, Area-Time Optimal Division for T = Omega((log n)^{1+e}) 1986 3 STACS Meyer auf der Heide, Speeding up Random Access Machines by a Few Processors 1986 3 STACS Nait Abdallah, Ions and Local Definitions in Logic Programming 1986 3 STACS Nielson, Abstract Interpretation of Denotational Definitions 1986 3 STACS Pecuchet, Varietes de Semis Groupes et Mots Infinis 1986 3 STACS Reischuk, Parallel Machines and their Communication Theoretical Limits 1986 3 STACS Rosier & Yen, Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning omega-Machines 1986 3 STACS Schmidt, Long Unavoidable Patterns 1986 3 STACS Spirakis, Input Sensitive, Optimal Parallel Randomized Algorithms for Addition and Identification 1986 3 STACS Tamassia & Tollis, Algorithms for Visibility Representations of Planar Graphs 1985 2 STACS Ambos-Spies, On the Relative Complexity of Subproblems of Intractable Problems 1985 2 STACS Babai, On Lovasz' Lattice Reduction and the Nearest Lattice Point Problem 1985 2 STACS Becker & Osthof, Layouts with Wires of Balanced Length 1985 2 STACS Blum, On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem 1985 2 STACS Boasson & Petit, Deterministic Languages and Non-Generators 1985 2 STACS Bodlaender & van Leeuwen, Simulation of Large Networks on Smaller Networks 1985 2 STACS Boudol & Roucairol & de Simone, Petri Nets and Algebraic Calculi of Processes 1985 2 STACS Brauer & Lange, Non-Deterministic Two-Tape Automata are More Powerful than Deterministic Ones 1985 2 STACS de Felice, Construction of a Family of Factorizing Codes 1985 2 STACS Diekert, On Hotz Groups and Homomorphic Images of Sentential Form Languages 1985 2 STACS Dybjer, Using Domain Algebras to Prove the Correctness of a Compiler 1985 2 STACS Faigle & Turan, Sorting and Recognition Problems for Ordered Sets 1985 2 STACS File, Tree Automata and Logic Programs 1985 2 STACS Fischer & van Gucht, Structure of Relations Satisfying Certain Families of Dependencies 1985 2 STACS Frederickson, A Single Source Shortest Path Algorithm for a Planar Distributed Network 1985 2 STACS Gao, An Algorithm for Two-Layer Channel Routing 1985 2 STACS Guting & Ottmann, New Algorithms for Special Cases of the Hidden Line Elimination Problem 1985 2 STACS Helfrich, An Algorithm to Construct Minkowski-Reduced Lattice-Bases 1985 2 STACS Irastorza, Base Non Finie de Varietes 1985 2 STACS Karlsson & Munro, Proximity on a Grid 1985 2 STACS Kucera, An O(N^{1.5+epsilon}) Expected Time Algorithm for Canonization and Isomorphism Testing of Trivalent Graphs 1985 2 STACS Leung & Monien, On the Complexity of Deadlock Recovery 1985 2 STACS McColl, On the Planar Monotone Computation of Threshold Functions 1985 2 STACS McColl, Planar Circuits have Short Specifications 1985 2 STACS O'Rourke & Suri & Booth, Shortest Paths on Polyhedral Surfaces 1985 2 STACS Porat & Francez, Fairness in Context-Free Grammars under Canonical Derivations 1985 2 STACS Richier, Distributed Termination in CSP: Symmetric Solutions with Minimal Storage 1985 2 STACS Rohnert, A Dynamization of the All Pairs Least Cost Path Problem 1985 2 STACS Rosier & Yen, Boundedness, Empty Channel Detection and Synchronization for Communicating Finite State Machines 1985 2 STACS Royer, Deriving Stack Semantics Congruent to Standard Denotational Semantics 1985 2 STACS Sack & Toussaint, Translating Polygons in the Plane 1985 2 STACS Santoro & Sidney & Sidney & Urrutia, Geometric Containment is not Reducible to Pareto Dominance 1985 2 STACS Spirakis, The Volume of the Union of Many Spheres and Point Inclusion Problems 1985 2 STACS Torenvliet & van Emde Boas, Combined Simplicity and Immunity in Relativized NP 1985 2 STACS Weil, Groups, Codes and Unambiguous Automata 1985 2 STACS Willard, Reduced Memory Space for Multi-Dimensional Search Trees 1984 1 STACS Edelsbrunner, Key-Problems and Key-Methods in Computational Geometry 1984 1 STACS Berstel, Some Recent Results on Squarefree Words 1984 1 STACS Olderog & Apt, Transformations Realizing Fairness Assumptions for Parallel Programs 1984 1 STACS Chazelle & Drysdale & Lee, Computing the Largest Empty Rectangle 1984 1 STACS Hochbaum & Maass, Approximation Schemes for Covering and Packing Problems in Robotics and VLSI 1984 1 STACS Levcopoulos & Lingas, Covering Polygons with Minimum Number of Rectangles 1984 1 STACS Josko, On Expressive Interpretation of a Hoare-Logic for Clarke's Language L_4 1984 1 STACS Drosten, Towards Executable Specifications Using Conditional Axioms 1984 1 STACS Perdrix, Proprietes Church-Rosser de Systemes de Reecriture Equationnels Ayant la Propriete de Terminaison Faible 1984 1 STACS Kemp, On a General Weight of Trees 1984 1 STACS Shamir, From Expanders to Better Superconcentrators without Cascading 1984 1 STACS Belaga, Locally Synchronous Complexity in the Light of the Trans-Box Method 1984 1 STACS Winskel, A New Definition of Morphism on Petri Nets 1984 1 STACS Finkel, Blocage et Vivacite dans les Reseaux a Pile-File 1984 1 STACS Broy, Denotational Semantics of Concurrent Programs with Shared Memory 1984 1 STACS Poigne, Higher Order Data Structures--Cartesian Closure versus lambda-Calculus 1984 1 STACS Longo & Martini, Computability in Higher Types and the Universal Domain P_omega 1984 1 STACS Ambos-Spies, On the Structure of Polynomial Time Degrees 1984 1 STACS Sykora & Vrto, Optimal Layouts of the Tree of Meshes with Vertices on the Perimeter of the Bounding Convex Region 1984 1 STACS Meyer, Efficient Simulations among Several Models of Parallel Computers 1984 1 STACS Pansiot, Bornes Inferieures sur la Complexite des Facteurs des Mots Infinis Engendres par Morphismes Iteres 1984 1 STACS Head, Adherence Equivalence is Decidable for D0L Languages 1984 1 STACS Gabarro, Pushdown Space Complexity and Related Full-A.F.L.s 1984 1 STACS Idt, Automates a Pile sur des Alphabets Infinis 1984 1 STACS Mycroft, Logic Programs and Many-Valued Logic 1984 1 STACS Michel, Algebre de Machines et Logique Temporelle 1984 1 STACS Rhodes, Algebraic and Topological Theory of Languages and Computation 1984 1 STACS Karhumaki, A Property of Three-Element Codes 1984 1 STACS Jantke, Polynomial Time Inference of General Pattern Languages 1984 1 STACS Choffrut & Culik, On Extendibility of Unavoidable Sets 1996 STALLINGS , The Data Encryption Standard: An Update, from National Institute of Standards and Technology CSL Bulletin, February, 1995 1996 STALLINGS Coppersmith, The Data Encryption Standard (DES) and its Strength Against Attacks, from IBM Journal of Research and Development, May, 1994 1996 STALLINGS Wiener, Efficient DES Key Search, Technical Report TR-244, Carleton University 1996 STALLINGS Rivest, The RC5 Encryption Algorithm, from Dr. Dobb's Journal, January, 1995 1996 STALLINGS Hellman, The Mathematics of Public-Key Cryptography, from Scientific American, August, 1979 1996 STALLINGS Uehling, Cracking the Uncrackable Code, from Popular Science, September, 1994 1996 STALLINGS Fumy & Landrock, Principles of Key Management, from IEEE Journal on Selected Areas in Communications, June, 1993 1996 STALLINGS Woo & Lam, Authentication for Distributed Systems, from Computer, January, 1992 1996 STALLINGS Lampson & Abadi & Burrows & Wobber, Authentication in Distributed Systems: Theory and Practice, from ACM Transactions on Computer Systems, November, 1992 1996 STALLINGS Burrows & Abadi & Needham, A Logic of Authentication, from Proceedings of the Royal Society, Volume 426, Number 1871, 1989 1996 STALLINGS Odlyzko, Public Key Cryptography, from AT&T Technical Journal, September/October, 1994 1996 STALLINGS Akl, Digital Signatures: A Tutorial Survey, from Computer, February, 1983 1996 STALLINGS , Digital Signature Standard, from National Institute of Standards and Technology CSL Bulletin, November, 1994 1996 STALLINGS Schneier, One-Way Hash Functions, from Dr. Dobb's Journal, September, 1991 1996 STALLINGS D'Angelo & McNair & Wilkes, Security in Electronic Messaging Systems, from AT&T Technical Journal, May/June, 1994 1996 STALLINGS Kent, Internet Privacy Enhanced Mail, from Communications of the ACM, August, 1993 1996 STALLINGS Sherman & Skibo & Murray, Secure Network Access Using Multiple Applications of AT&T's Smart Card, from AT&T Technical Journal, September/October, 1994 1996 STALLINGS Neuman & Ts'o, Kerberos: An Authentication Service for Computer Networks, from IEEE Communications Magazine, September, 1994 1996 STALLINGS Krajewski & Chipchak & Chodorow & Trostle, Applicability of Smart Cards to Network User Authentication, from Computing Systems, Winter, 1994 1996 STALLINGS Anderson, Why Cryptosystems Fail, from Communications of the ACM, November, 1994 1996 STALLINGS Simmons, Cryptanalysis and Protocol Failures, from Communications of the ACM, November, 1994 1996 STALLINGS Kent, Internet Security Standards: Past, Present, and Future, from StandardView, June, 1994 1993 STANFUP Rotman, Ad Infinitum: The Ghost in Turing's Machine 1994 9 STATSCI Witztum & Rips & Rosenberg, Equidistant Letter Sequences in the Book of Genesis 1993 1 STDVIEW Adams, Internationalization and Character Sets 1986 STEKLOV Adyan & Makanin, Investigations on Algorithmic Questions of Algebra 1986 STEKLOV Matiyasevich, On Investigations on Some Algorithmic Problems in Algebra and Number Theory 1970 113 STEKLOV Freidzon, A Characterization of the Complexity of Recursive Predicates 1988 3 STGT Read & Tutte, Chromatic Polynomials 1988 3 STGT Welsh, Matroids and their Applications 1988 3 STGT Jaeger, Nowhere-zero Flow Problems 1988 3 STGT Thomassen, Paths, Circuits and Subdivisions 1988 3 STGT Graham, Isometric Embeddings of Graphs 1988 3 STGT Chung, Labelings of Graphs 1988 3 STGT Malkevitch, Polytopal Graphs 1988 3 STGT Berge, Hypergraphs 1993 STMARTIN vos Savant, The World's Most Famous Math Problem [The Proof of Fermat's Last Theorem and Other Mathematical Mysteries] 1996 28 STOC Kushilevitz & Linial & Ostrovsky, The Linear-Array Conjecture in Communication Complexity is False 1996 28 STOC Hastad, Testing of the Long Code and Hardness for Clique 1996 28 STOC Alon & Matias & Szegedy, The Space Complexity of Approximating the Frequency Moments 1996 28 STOC Chaudhuri & Radhakrishnan, Deterministic Restrictions in Circuit Complexity 1996 28 STOC Cheriyan & Thurimella, Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation (Extended Abstract) 1996 28 STOC Benczur & Karger, Approximating s-t Minimum Cuts in O~(n^2) Time 1996 28 STOC Karger, Minimum Cuts in Near-Linear Time 1996 28 STOC Nagamochi & Ibaraki, Deterministic O~(nm) Time Edge-Splitting in Undirected Graphs 1996 28 STOC Naor, Evaluation May Be Easier Than Generation (Extended Abstract) 1996 28 STOC Ogihara, The PL Hierarchy Collapses 1996 28 STOC Afek & Mansour & Ostfeld, Convergence Complexity of Optimistic Rate Based Flow Control Algorithms (Extended Abstract) 1996 28 STOC Ajtai, Generating Hard Instances of Lattice Problems (Extended abstract) 1996 28 STOC Milenkovic, Translational Polygon Containment and Minimal Enclosure using Linear Programming Based Restriction 1996 28 STOC Bern & Sahai, Pushing Disks Together--The Continuous-Motion Case 1996 28 STOC Bergadano & Catalano & Varricchio, Learning Sat-k-DNF Formulas from Membership Queries 1996 28 STOC Bshouty, Towards the Learnability of DNF Formulae 1996 28 STOC Cesa-Bianchi & Dichterman & Fischer & Simon, Noise-tolerant Learning Near the Information-theoretic Bound 1996 28 STOC Bshouty & Goldman & Mathias & Suri & Tamaki, Noise-Tolerant Distribution-Free Learning of General Geometric Concepts 1996 28 STOC Allender & Beals & Ogihara, The Complexity of Matrix Rank and Feasible Systems of Linear Equations (Extended Abstract) 1996 28 STOC Basu & Pollack & Roy, Computing Roadmaps of Semi-algebraic Sets (Extended Abstract) 1996 28 STOC Clegg & Edmonds & Impagliazzo, Using the Groebner Basis Algorithm to Find Proofs of Unsatisfiability 1996 28 STOC Kapur & Saxena, Sparsity Considerations in Dixon Resultants 1996 28 STOC Vengroff & Vitter, Efficient 3-D Range Searching in External Memory 1996 28 STOC Kaplan & Tarjan, Purely Functional Representations of Catenable Sorted Lists 1996 28 STOC Grover, A Fast Quantum Mechanical Algorithm for Database Search 1996 28 STOC Bonet & Phillips & Warnow & Yooseph, Constructing Evolutionary Trees in the Presence of Polymorphic Characters 1996 28 STOC Farach & Kannan, Efficient Algorithms for Inverting Evolution 1996 28 STOC Aspnes & Waarts, Modular Competitiveness for Distributed Algorithms 1996 28 STOC Goodrich, Communication-Efficient Parallel Sorting (Preliminary Version) 1996 28 STOC Andrews & Leighton & Metaxas & Zhang, Automatic Methods for Hiding Latency in High Bandwidth Networks (Extended Abstract) 1996 28 STOC Ma, An O(n log n)-Size Fault-Tolerant Sorting Network (Extended Abstract) 1996 28 STOC Ta-Shma, On Extracting Randomness From Weak Random Sources (Extended Abstract) 1996 28 STOC Zuckerman, Randomness-Optimal Sampling, Extractors, and Constructive Leader Election 1996 28 STOC Wilson, Generating Random Spanning Trees More Quickly than the Cover Time 1996 28 STOC Dimitriou & Impagliazzo, Towards an Analysis of Local Optimization Algorithms 1996 28 STOC Feige, A Threshold of ln n for Approximating Set Cover (Preliminary version) 1996 28 STOC McCormick, Fast Algorithms for Parametric Scheduling Come from Extensions to Parametric Maximum Flow 1996 28 STOC Khanna & Motwani, Towards a Syntactic Characterization of PTAS 1996 28 STOC Klein & Lu, Efficient Approximation Algorithms for Semidefinite Programs Arising from MAX CUT and COLORING 1996 28 STOC Broder & Upfal, Dynamic Deflection Routing on Arrays (Preliminary version) 1996 28 STOC Cypher & Meyer auf der Heide & Scheideler & vocking, Universal Algorithms for Store-and-Forward and Wormhole Routing 1996 28 STOC Rabani & Tardos, Distributed Packet Switching in Arbitrary Networks 1996 28 STOC Borodin & Kleinberg & Raghavan & Sudan & Williamson, Adversarial Queueing Theory 1996 28 STOC Friedman, Computing Betti Numbers via Combinatorial Laplacians 1996 28 STOC Mohar, Embedding Graphs in an Arbitrary Surface in Linear Time 1996 28 STOC Dey & Guha, Algorithms for Manifolds and Simplicial Complexes in Euclidean 3-Space (Preliminary Version) 1996 28 STOC Basu, On Bounding the Betti Numbers and Computing the Euler Characteristic of Semi-algebraic Sets 1996 28 STOC Kellerer & Tautenhahn & Woeginger, Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine 1996 28 STOC Karloff, How Good is the Goemans-Williamson MAX CUT Algorithm? 1996 28 STOC Slavik, A Tight Analysis of the Greedy Algorithm for Set Cover 1996 28 STOC Blum & Ravi & Vempala, A Constant-factor Approximation Algorithm for the k-MST Problem (Extended Abstract) 1996 28 STOC Berger & Kleinberg & Leighton, Reconstructing a Three-Dimensional Model with Arbitrary Errors 1996 28 STOC Kearns & Mansour, On the Boosting Ability of Top-Down Decision Tree Learning Algorithms 1996 28 STOC Angluin & Westbrook & Zhu, Robot Navigation with Range Queries 1996 28 STOC Beaver, Correlated Pseudorandomness and the Complexity of Private Communications 1996 28 STOC Dwork & Lotspiech & Naor, Digital Signets: Self-Enforcing Protection of Digital Information (Preliminary Version) 1996 28 STOC Frankel & Gemmell & Yung, Witness-Based Cryptographic Program Checking and Robust Function Sharing 1996 28 STOC Linial & Sasson, Non-Expansive Hashing 1996 28 STOC Awerbuch & Azar & Fiat & Leighton, Making Commitments in the Face of Uncertainty: How to Pick a Winner Almost Every Time (Extended Abstract) 1996 28 STOC Bartal & Fiat & Leonardi, Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing 1996 28 STOC Kushilevitz & Ostrovsky & Rosen, Characterizing Linear Size Circuits in Terms of Privacy 1996 28 STOC Hromkovic & Schnitger, Nondeterministic Communication with a Limited Number of Advice Bits 1996 28 STOC Newman & Szegedy, Public vs. Private Coin Flips in One Round Communication Games (Extended Abstract) 1996 28 STOC Robertson & Sanders & Seymour & Thomas, Efficiently Four-coloring Planar Graphs 1996 28 STOC Spielman, Faster Isomorphism Testing of Strongly Regular Graphs 1996 28 STOC Aggarwal & Kleinberg & Williamson, Node-Disjoint Paths on the Mesh and a New Trade-Off in VLSI Layout 1996 28 STOC Fu, Modular Coloring Formulas Are Hard for Cutting Planes Proofs 1996 28 STOC Babai & Gal & Kollar & Ronyai & Szabo & Wigderson, Extremal Bipartite Graphs and Superpolynomial Lower Bounds for Monotone Span Programs 1996 28 STOC Grigoriev & Karpinski & Meyer auf der Heide & Smolensky, A Lower Bound for Randomized Algebraic Decision Trees 1996 28 STOC Evans & Pippenger, Lower Bounds for Noisy Boolean Decision Trees 1996 28 STOC Beaver, Adaptive Zero Knowledge and Computational Equivocation (Extended Abstract) 1996 28 STOC Canetti & Feige & Goldreich & Naor, Adaptively Secure Multi-party Computation 1996 28 STOC Okamoto, On Relationships between Statistical Zero-Knowledge Proofs 1996 28 STOC Kosaraju & Delcher, Large-Scale Assembly of DNA Strings and Space-Efficient Construction of Suffix Trees (Correction) 1995 27 STOC Khuller & Raghavachari, Improved Approximation Algorithms for Uniform Connectivity Problems 1995 27 STOC Karger, A Randomized Fully Polynomial Time Approximation Scheme for the All Terminal Network Reliability Problem 1995 27 STOC Karger & Plotkin, Adding Multiple Cost Constraints to Combinatorial Optimization Problems, with Applications to Multicommodity Flows 1995 27 STOC Kleinberg & Tardos, Approximations for the Disjoint Paths Problem in High-Diameter Planar Networks 1995 27 STOC Franklin & Yung, Secure Hypergraphs: Privacy from Partial Broadcast (Extended Abstract) 1995 27 STOC Bellare & Goldreich & Goldwasser, Incremental Cryptography and Application to Virus Protection 1995 27 STOC Bellare & Rogaway, Provably Secure Session Key Distribution--The Three Party Case 1995 27 STOC Yao, Security of Quantum Protocols Against Coherent Measurements 1995 27 STOC Lovasz & Winkler, Efficient Stopping Rules for Markov Chains (Extended Abstract) 1995 27 STOC Rabani & Rabinovich & Sinclair, A Computational View of Population Genetics (preliminary version) 1995 27 STOC Kaplan & Tarjan, Persistent Lists with Catenation via Recursive Slow-Down 1995 27 STOC Milterson & Nisan & Safra & Wigderson, On Data Structures and Asymmetric Communication Complexity 1995 27 STOC Diaconis & Saloff-Coste, What Do We Know about the Metropolis Algorithm? 1995 27 STOC Ponzio, A Lower Bound for Integer Multiplication with Read-Once Branching Programs 1995 27 STOC Nisan & Ta-Shma, Symmetric Logspace is Closed Under Complement 1995 27 STOC Edmonds & Poon, A Nearly Optimal Time-Space Lower Bound for Directed st-Connectivity on the NNJAG Model 1995 27 STOC Hart & Istrail, Fast Protein Folding in the Hydrophobic-hydrophilic Model Within Three-eights of Optimal (Extended Abstract) 1995 27 STOC Kosaraju & Delcher, Large-Scale Assembly of DNA Strings and Space-Efficient Construction of Suffix Trees (Preliminary Version) 1995 27 STOC Hannenhalli & Pevzner, Transforming Cabbage into Turnip (polynomial algorithm for sorting signed permutations by reversals) 1995 27 STOC Hellerstein & Pillaipakkamnatt & Raghavan & Wilkins, How Many Queries are Needed to Learn? 1995 27 STOC Karpinski & Macintyre, Polynomial Bounds for VC Dimension of Sigmoidal Neural Networks 1995 27 STOC Kivinen & Warmuth, Additive Versus Exponentiated Gradient Updates for Linear Prediction 1995 27 STOC Bshouty & Tamon, On the Fourier Spectrum of Monotone Functions (Extended Abstract) 1995 27 STOC Raghavan & Upfal, Stochastic Contention Resolution With Short Delays 1995 27 STOC Adler & Chakrabarti & Mitzenmacher & Rasussen, Parallel Randomized Load Balancing (Preliminary Version) 1995 27 STOC Balter & Wolfe, Bounding Delays in Packet-Routing Networks 1995 27 STOC Mansour & Patt-Shamir, Many-to-One Packet Routing on Grids (Extended Abstract) 1995 27 STOC Srinivasan, Improved Approximations of Packing and Covering Problems 1995 27 STOC Awerbuch & Azar & Blum & Vempala, Improved Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen 1995 27 STOC Arora & Karger & Karpinski, Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems 1995 27 STOC Blum & Chalasani & Vempala, A Constant-Factor Approximation for the k-MST Problem in the Plane 1995 27 STOC Beame & Cook & Edmonds & Impagliazzo & Pitassi, The Relative Complexity of NP Search Problems 1995 27 STOC Gradel & Meer, Descriptive Complexity Theory over the Real Numbers 1995 27 STOC Wang, Average-Case Completeness of a Word Problem for Groups 1995 27 STOC Cucker & Karpinski & Koiran & Lickteig & Werther, On Real Turing Machines that Toss Coins 1995 27 STOC Agarwal & Raghavan & Tamaki, Motion Planning for a Steering-constrained Robot through Moderate Obstacles 1995 27 STOC Kavraki & Latombe & Motwani & Raghavan, Randomized Query Processing in Robot Path Planning (Extended Abstract) 1995 27 STOC Alur & Courcoubetis & Yannakakis, Distinguishing Tests for Nondeterministic and Probabilistic Machines 1995 27 STOC Henzinger & Kopke & Puri & Varaiya, What's Decidable about Hybrid Automata? 1995 27 STOC Pulleyblank, Two Steiner Tree Packing Problems (Extended Abstract) 1995 27 STOC Spielman, Linear-Time Encodable and Decodable Error-Correcting Codes 1995 27 STOC Kaltofen & Shoup, Subquadratic-Time Factoring of Polynomials over Finite Fields 1995 27 STOC Ergun, Testing Multivariate Linear Functions: Overcoming the Generator Bottleneck 1995 27 STOC Andersson & Hastad & Petersson, A Tight Lower Bound for Searching a Sorted Array 1995 27 STOC Andersson & Hagerup & Nilsson & Raman, Sorting in Linear Time? 1995 27 STOC Kahale & Leighton & Ma & Plaxton & Suel & Szemeredi, Lower Bounds for Sorting Networks 1995 27 STOC Raz, A Parallel Repetition Theorem 1995 27 STOC Feige & Kilian, Impossibility Results for Recycling Random Bits in Two-Prover Proof Systems 1995 27 STOC Aiello & Bellare & Venkatesan, Knowledge on the Average--Perfect, Statistical and Logarithmic 1995 27 STOC Saks & Srinivasan & Zhou, Explicit Dispersers with Polylog Degree 1995 27 STOC Arya & Das & Mount & Salowe & Smid, Euclidean Spanners: Short, Thin, and Lanky 1995 27 STOC Galil & Yu, Short Length Versions of Menger's Theorem (Extended Abstract) 1995 27 STOC Dinitz & Nutov, A 2-level Cactus Model for the System of Minimum and Minimum+1 Edge-Cuts in a Graph and Its Incremental Maintenance 1995 27 STOC Henzinger & King, Randomized Dynamic Graph Algorithms with Polylogarithmic Time per Operation 1995 27 STOC Dolev & Kranakis & Krizanc & Peleg, Bubbles: Adaptive Routing Scheme for High-Speed Dynamic Networks (Extended Abstract) 1995 27 STOC Afek & Dauber & Touitou, Wait-Free Made Fast (Extended Abstract) 1995 27 STOC Ghosh & Leighton & Maggs & Muthukrishnan & Plaxton & Rajaraman & Richa & Tarjan & Zuckerman, Tight Analyses of Two Local Load Balancing Algorithms 1995 27 STOC Kushilevitz & Ostrovsky & Rosen, Log-Space Polynomial End-to-End Communication 1995 27 STOC Goldmann & Hastad, Monotone Circuits for Connectivity Have Depth (log n)^{2-o(1)} (Extended Abstract) 1995 27 STOC Bonet & Pitassi & Raz, Lower Bounds for Cutting Planes Proofs with Small Coefficients 1995 27 STOC Beals & Nishino & Tanaka, More on the Complexity of Negation-Limited Circuits 1995 27 STOC Kremer & Nisan & Ron, On Randomized One-Round Communication Complexity 1995 27 STOC Canetti & Irani, Bounding the Power of Preemption in Randomized Scheduling 1995 27 STOC Bar-Noy & Canetti & Kutten & Mansour & Schieber, Bandwidth Allocation with Preemption (Extended Summary) 1995 27 STOC Fiat & Karlin, Randomized and Multipointer Paging with Locality of Reference 1995 27 STOC Feige, Randomized Graph Products, Chromatic Numbers, and the Lovasz theta-Function (Extended Abstract) 1995 27 STOC Borchers & Du, The k-Steiner Ratio in Graphs 1995 27 STOC Raschle & Simon, Recognition of Graphs with Threshold Dimension Two 1995 27 STOC Eppstein, Geometric Lower Bounds for Parametric Matroid Optimization 1995 27 STOC Amato & Goodrich & Ramos, Computing Faces in Segment and Simplex Arrangements (Preliminary Version) 1995 27 STOC Miller & Talmor & Teng & Walkington, A Delaunay Based Numerical Method for Three Dimensions: generation, formulation, and partition 1995 27 STOC Ferragina & Grossi, A Fully-Dynamic Data Structure for External Substring Search (Extended Abstract) 1995 27 STOC Farach & Thorup, String Matching in Lempel-Ziv Compressed Strings 1995 27 STOC Czumaj & Galil & Gasieniec & Park & Plandowski, Work-Time-Optimal Parallel Algorithms for String Problems (Extended Abstract) 1995 27 STOC Nisan & Wigderson, On the Complexity of Bilinear Forms 1995 27 STOC Chazelle, Lower Bounds for Off-Line Range Searching 1995 27 STOC Pan, Optimal (up to Polylog Factors) Sequential and Parallel Algorithms for Approximating Complex Polynomial Zeros 1995 27 STOC Reif, Work Efficient Parallel Solution of Toeplitz Systems and Polynomial GCD 1994 26 STOC Chung & Yau, A Near Optimal Algorithm for Edge Separators (Preliminary Version) 1994 26 STOC Klein & Tarjan, A Randomized Linear-Time Algorithm for Finding Minimum Spanning Trees 1994 26 STOC Cohen, Polylog-Time and Near-Linear Work Approximation Scheme for Undirected Shortest Paths 1994 26 STOC Klein & Rao & Rauch & Subramanian, Faster Shortest-Path Algorithms for Planar Graphs 1994 26 STOC Tanaka & Nishino, On the Complexity of Negation-Limited Boolean Networks (Preliminary Version) 1994 26 STOC Krause & Pudlak, On the Computational Power of Depth 2 Circuits with Threshold and Modulo Gates 1994 26 STOC Jakoby & Reischuk & Schindelhauer, Circuit Complexity: from the Worst Case to the Average Case 1994 26 STOC Grolmusz, A Weight-Size Trade-Off for Circuits with MOD m Gates 1994 26 STOC Chazelle, Computational Geometry: A Retrospective 1994 26 STOC Pellegrini, On Point Location and Motion Planning among Simplices (extended abstract) 1994 26 STOC de Berg & Dobrindt & Schwarzkopf, On Lazy Randomized Incremental Construction 1994 26 STOC Kalyanasundaram & Pruhs, Fault-Tolerant Scheduling (Extended Abstract) 1994 26 STOC Karlin & Nelson & Tamaki, On the Fault Tolerance of the Butterfly 1994 26 STOC Raghavan & Upfal, Efficient Routing in All-Optical Networks 1994 26 STOC Brewer & Chong & Leighton, Scalable Expanders: Exploiting Hierarchical Random Wiring 1994 26 STOC Mackenzie & Plaxton & Rajaraman, On Contention Resolution Protocols and Associated Probabilistic Phenomena 1994 26 STOC Blum & Chalasani & Coppersmith & Pulleyblank & Raghavan & Sudan, The Minimum Latency Problem 1994 26 STOC Feige & Kilian, Two Prover Protocols -- Low Error at Affordable Rates (Preliminary Version) 1994 26 STOC Bellare & Sudan, Improved Non-Approximability Results 1994 26 STOC Polishchuk & Spielman, Nearly-linear Size Holographic Proofs 1994 26 STOC Razborov & Rudich, Natural Proofs 1994 26 STOC Awerbuch & Cowen & Smith, Efficient Asynchronous Distributed Symmetry Breaking 1994 26 STOC Yang & Anderson, Time Bounds for Mutual Exclusion and Related Problems (Extended Abstract) 1994 26 STOC Ostrovsky & Rajagopalan & Vazirani, Simple and Efficient Leader Election in the Full Information Model 1994 26 STOC Herlihy & Shavit, A Simple Constructive Computability Theorem for Wait-free Computation 1994 26 STOC Blum & Furst & Jackson & Kearns & Mansour & Rudich, Weakly Learning DNF and Characterizing Statistical Query Learning Using Fourier Analysis 1994 26 STOC Auer & Long, Simulating Access to Hidden Information while Learning 1994 26 STOC Kearns & Mansour & Ron & Rubinfeld & Schapire & Sellie, On the Learnability of Discrete Distributions (Extended Abstract) 1994 26 STOC Apsitis & Freivalds & Smith, Choosing a Learning Team: a Topological Approach 1994 26 STOC Hariharan, Optimal Parallel Suffix Tree Construction (Extended Abstract) 1994 26 STOC Sahinalp & Vishkin, Symmetry Breaking for Suffix Tree Construction (extended abstract) 1994 26 STOC Kosaraju, Real-Time Pattern Matching and Quasi-Real-Time Construction of Suffix Trees (Preliminary Version) 1994 26 STOC Andersson & Hagerup & Hastad & Petersson, The Complexity of Searching a Sorted Array of Strings 1994 26 STOC Alon & Yuster & Zwick, Color-Coding: A New Method for Finding Simple Paths, Cycles and Other Small Subgraphs within Large Graphs (Extended Abstract) 1994 26 STOC Odlyzko, Search for the Maximum of a Random Walk (Extended abstract) 1994 26 STOC Alon & Kahale, A Spectral Technique for Coloring Random 3-colorable Graphs (Preliminary Version) 1994 26 STOC Impagliazzo & Nisan & Wigderson, Pseudorandomness for Network Algorithms 1994 26 STOC Kurshan, The Complexity of Verification 1994 26 STOC Mansour & Nisan & Vishkin, Trade-offs Between Communication Throughput and Parallel Time 1994 26 STOC Hagerup, Optimal Parallel String Algorithms: Merging, Sorting and Computing the Minimum 1994 26 STOC Ma & von zur Gathen, The Computational Complexity of Recognizing Permutation Functions (Extended Abstract) 1994 26 STOC Ajtai, The Independence of the Modulo p Counting Principles 1994 26 STOC Khuller & Raghavachari & Young, Low Degree Spanning Trees of Small Weight 1994 26 STOC Goemans & Williamson, .878-Approximation Algorithms for MAX CUT and MAX 2SAT 1994 26 STOC Garg & Hochbaum, An O(log k) Approximation Algorithm for the k Minimum Spanning Tree Problem in the Plane 1994 26 STOC Halldorsson & Radhakrishnan, Greed is Good: Approximating Independent Sets in Sparse and Bounded-degree Graphs 1994 26 STOC Bodlaender & Fellows & Hallett, Beyond NP-Completeness for Problems of Bounded Width: Hardness for the W Hierarchy (Extended Abstract) 1994 26 STOC Arora & Rabani & Vazirani, Simulating Quadratic Dynamical Systems is PSPACE-complete (preliminary version) 1994 26 STOC Marathe & Hunt & Stearns & Radhakrishnan, Approximation Schemes for PSPACE-Complete Problems for Succinct Specifications (Preliminary Version) 1994 26 STOC Sitharam, Pseudorandom Generators and Learning Algorithms for AC^0 1994 26 STOC Awerbuch & Leighton, Improved Approximation Algorithms for the Multi-Commodity Flow Problem and Local Competitive Routing in Dynamic Networks 1994 26 STOC Karger & Motwani, Derandomization through Approximation: An NC Algorithm for Minimum Cuts 1994 26 STOC Koutsoupias & Papadimitriou, On the k-Server Conjecture 1994 26 STOC Vavasis & Ye, An Accelerated Interior Point Method Whose Running Time Depends Only on A (extended abstract) 1994 26 STOC De Santis & Desmedt & Frankel & Yung, How to Share a Function Securely (extended summary) 1994 26 STOC Goldreich & Ostrovsky & Petrank, Computational Complexity and Knowledge Complexity (Extended Abstract) 1994 26 STOC Benaloh & Tuinstra, Receipt-Free Secret-Ballot Elections (Extended Abstract) 1994 26 STOC Feige & Kilian & Naor, A Minimal Model for Secure Computation (extended abstract) 1994 26 STOC Karloff & Mansour, On Construction of k-wise Independent Random Variables 1994 26 STOC Goldreich & Wigderson, Tiny Families of Functions with Random Properties: A Quality-Size Trade-off for Hashing (Preliminary Version) 1994 26 STOC Chari & Rohatgi & Srinivasan, Improved Algorithms via Approximations of Probability Distributions (Extended Abstract) 1994 26 STOC Azar & Broder & Karlin & Upfal, Balanced Allocations (Extended abstract) 1994 26 STOC Mulmuley, Lower Bounds for Parallel Linear Programming and Other Problems 1994 26 STOC Yao, Decision Tree Complexity and Betti Numbers 1994 26 STOC Miltersen, Lower Bounds for Union-Split-Find Related Problems on Random Access Machines 1994 26 STOC Grigoriev & Karpinski & Vorobjov, Lower Bounds on Testing Membership to a Polyhedron by Algebraic Decision Trees 1994 26 STOC Wigderson, The Amazing Power of Pairwise Independence 1994 26 STOC Karger, Random Sampling in Cut, Flow, and Network Design Problems 1994 26 STOC Benczur, Augmenting Undirected Connectivity in RNC and in Randomized O~(n^3) Time 1994 26 STOC Jiang & Seiferas & Vitanyi, Two Heads are Better than Two Tapes 1994 26 STOC Condon & Hellerstein & Pottle & Wigderson, On the Power of Finite Automata with both Nondeterministic and Probabilistic States (Preliminary Version) 1994 26 STOC Rauch, Improved Data Structures for Fully Dynamic Biconnectivity 1994 26 STOC Gabow, Efficient Splitting Off Algorithms for Graphs 1994 26 STOC La Poutre, Alpha-Algorithms for Incremental Planarity Testing (Extended Abstract) 1994 26 STOC Dinitz & Vainshtein, The Connectivity Carcass of a Vertex Subset in a Graph and its Incremental Maintenance 1994 26 STOC Papadimitriou & Yannakakis, On Complexity as Bounded Rationality (Extended Abstract) 1994 26 STOC Lipton & Young, Simple Strategies for Large Zero-Sum Games with Applications to Complexity Theory 1994 26 STOC Fortnow & Whang, Optimality and Domination in Repeated Games with Bounded Players 1994 26 STOC Koller & Megiddo & von Stengel, Fast Algorithms for Finding Randomized Strategies in Game Trees 1994 26 STOC Jiang & Lawler & Wang, Aligning Sequences via an Evolutionary Tree: Complexity and Approximation (Extended Abstract) 1994 26 STOC Muthukrishnan & Palem, Non-standard Stringology: Algorithms and Complexity 1994 26 STOC Jacquet & Szpankowski, A Functional Equation Arising in the Analysis of Algorithms (Extended Abstract) 1994 26 STOC Rajagopalan & Schulman, A Coding Theorem for Distributed Computation 1994 26 STOC Alur & Attiya & Taubenfeld, Time-Adaptive Algorithms for Synchronization 1994 26 STOC Patt-Shamir & Rajsbaum, A Theory of Clock Synchronization (Extended Abstract) 1994 26 STOC Bellare & Goldwasser & Lund & Russell, Efficient Probabilistically Checkable Proofs and Applications to Approximation (corrections) 1993 25 STOC Chou & Ko, Some Complexity Issues on the Simply Connected Regions of the Two-Dimensional Plane (Extended Abstract) 1993 25 STOC Bernstein & Vazirani, Quantum Complexity Theory (Preliminary Abstract) 1993 25 STOC Bennett & Gacs & Li & Vitanyi & Zurek, Thermodynamics of Computation and Information Distance 1993 25 STOC Garay & Moses, Fully Polynomial Byzantine Agreement in t+1 Rounds (Extended Abstract) 1993 25 STOC Canetti & Rabin, Fast Asynchronous Byzantine Agreement with Optimal Resilience (Extended Abstract) 1993 25 STOC Ben-Or & Canetti & Goldreich, Asynchronous Secure Computation (Extended Abstract) 1993 25 STOC Jiang & Li, k One-Way Heads Cannot Do String-Matching 1993 25 STOC Baker, A Theory of Parameterized Pattern Matching: Algorithms and Applications (Extended Abstract) 1993 25 STOC Idury & Schaffer, Multiple Matching of Rectangular Patterns (Extended Abstract) 1993 25 STOC Borowsky & Gafni, Generalized FLP Impossibility Result for t-resilient Asynchronous Computations (Extended Abstract) 1993 25 STOC Saks & Zaharoglou, Wait-Free k-set Agreement is Impossible: The Topology of Public Knowledge (Extended Abstract) 1993 25 STOC Herlihy & Shavit, The Asynchronous Computability Theorem for t-Resilient Tasks (Preliminary Version) 1993 25 STOC Papadimitriou & Yannakakis, Linear Programming Without the Matrix (Extended Abstract) 1993 25 STOC Borgstrom & Kosaraju, Comparison-based Search in the Presence of Errors (Preliminary Version) 1993 25 STOC Farach & Kannan & Warnow, A Robust Model for Finding Optimal Evolutionary Trees (Extended Abstract) 1993 25 STOC Felsner & Wernisch, Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms 1993 25 STOC Kushilevitz & Mansour & Rabin & Zuckerman, Lower Bounds for Randomized Mutual Exclusion (Extended Abstract) 1993 25 STOC Awerbuch & Bartal & Fiat, Competitive Distributed File Allocation 1993 25 STOC Dwork & Herlihy & Waarts, Contention in Shared Memory Algorithms 1993 25 STOC Naor & Stockmeyer, What Can be Computed Locally? (Extended Abstract) 1993 25 STOC Cohen & Battista & Kanevsky & Tamassia, Reinventing the Wheel: An Optimal Data Structure for Connectivity Queries (Extended Abstract) 1993 25 STOC Szegedy & Vishwanathan, Locality Based Graph Coloring 1993 25 STOC Eppstein & Galil & Italiano & Spencer, Separator Based Sparsification for Dynamic Planar Graph Algorithms (Extended Abstract) 1993 25 STOC Goldberg, Polynomial Space Polynomial Delay Algorithms for Listing Families of Graphs 1993 25 STOC Bodlaender, A Linear Time Algorithm for Finding Tree-Decompositions of Small Treewidth 1993 25 STOC Nisan & Zuckerman, More Deterministic Simulation in Logspace 1993 25 STOC Wigderson & Zuckerman, Expanders that Beat the Eigenvalue Bound: Explicit Construction and Applications 1993 25 STOC Boppana & Narayanan, The Biased Coin Problem 1993 25 STOC Linial & Luby & Saks & Zuckerman, Efficient Construction of a Small Hitting Set for Combinatorial Rectangles in High Dimension 1993 25 STOC Koller & Megiddo, Constructing Small Sample Spaces Satisfying Given Constraints 1993 25 STOC Karp, Mapping the Genome: Some Combinatorial Problems Arising in Molecular Biology 1993 25 STOC Lund & Yannakakis, On the Hardness of Approximating Minimization Problems (Extended abstract) 1993 25 STOC Bellare & Goldwasser & Lund & Russell, Efficient Probabilistically Checkable Proofs and Applications to Approximation 1993 25 STOC Condon & Feigenbaum & Lund & Shor, Probabilistically Checkable Debate Systems and Approximation Algorithms for PSPACE-Hard Functions (Extended Abstract) 1993 25 STOC Freund & Kearns & Ron & Rubinfeld & Schapire & Sellie, Efficient Learning of Typical Finite Automata from Random Walks (Extended Abstract) 1993 25 STOC Macintyre & Sontag, Finiteness Results for Sigmoidal ``Neural'' Networks (Extended Abstract) 1993 25 STOC Maass, Bounds for the Computational Power and Learning Complexity of Analog Neural Nets (Extended Abstract) 1993 25 STOC Baruah & Cohen & Plaxton & Varvel, Proportionate Progress: A Notion of Fairness in Resource Allocation 1993 25 STOC Pippenger, Self-Routing Superconcentrators 1993 25 STOC Blumofe & Leiserson, Space-Efficient Scheduling of Multithreaded Computations (extended abstract) 1993 25 STOC Kharitonov, Cryptographic Hardness of Distribution-specific Learning 1993 25 STOC Cesa-Bianchi & Freund & Haussler & Helmbold & Schapire & Warmuth, How to Use Expert Advice (Extended Abstract) 1993 25 STOC Kearns, Efficient Noise-Tolerant Learning from Statistical Queries 1993 25 STOC Phillips & Westbrook, Online Load Balancing and Network Flow 1993 25 STOC Coffman & Johnson & Shor & Weber, Markov Chains, Computer Proofs, and Average-Case Analysis of Best Fit Bin Packing 1993 25 STOC Bern & Greene & Raghunathan, On-line Algorithms for Cache Sharing 1993 25 STOC Di Battista & Vismara, Angles of Planar Triangular Graphs (extended abstract) 1993 25 STOC Ravi & Marathe & Ravi & Rosenkrantz & Hunt, Many Birds with One Stone: Multi-Objective Approximation Algorithms (Extended Abstract) 1993 25 STOC Luby & Nisan, A Parallel Approximation Algorithm for Positive Linear Programming 1993 25 STOC Chari & Rohatgi & Srinivasan, Randomness-Optimal Unique Element Isolation, with Applications to Perfect Matching and Related Problems 1993 25 STOC Fleischer, Decision Trees: Old and New Results 1993 25 STOC Matousek & Schwarzkopf, A Deterministic Algorithm for the Three-Dimensional Diameter Problem 1993 25 STOC Hershberger & Suri, Matrix Searching with the Shortest Path Metric 1993 25 STOC Chazelle & Edelsbrunner & Grigni & Guibas & Sharir & Welzl, Improved Bounds on Weak epsilon-Nets for Convex Sets 1993 25 STOC de Berg & Matousek & Schwarzkopf, Piecewise Linear Paths Among Convex Obstacles 1993 25 STOC Allender & Jiao, Depth Reduction for Noncommutative Arithmetic Circuits (Extended Abstract) 1993 25 STOC Pudlak & Rodl, Modified Ranks of Tensors and the Size of Circuits 1993 25 STOC Karchmer & Wigderson, Characterizing Non-Deterministic Circuit Size 1993 25 STOC Impagliazzo & Paturi & Saks, Size-Depth Trade-Offs for Threshold Circuits 1993 25 STOC Goldmann & Karpinski, Simulating Threshold Circuits by Majority Circuits 1993 25 STOC Cole & Maggs & Sitaraman, Multi-Scale Self-Emulation: A Technique for Reconfiguring Arrays with Faults 1993 25 STOC Borodin & Raghavan & Schieber & Upfal, How Much Can Hardware Help Routing? (Extended Abstract) 1993 25 STOC Alon & Chung & Graham, Routing Permutations on Graphs via Matchings (extended abstract) 1993 25 STOC Alur & Henzinger & Vardi, Parametric Real-time Reasoning 1993 25 STOC Jones, Constant Time Factors Do Matter (Extended abstract) 1993 25 STOC Feder & Vardi, Monotone Monadic SNP and Constraint Satisfaction 1993 25 STOC Aspnes & Azar & Fiat & Plotkin & Waarts, On-Line Load Balancing with Applications to Machine Scheduling and Virtual Circuit Routing 1993 25 STOC Aiello & Awerbuch & Maggs & Rao, Approximate Load Balancing on Dynamic and Asynchronous Networks 1993 25 STOC Feldmann & Kao & Sgall & Teng, Optimal Online Scheduling of Parallel Jobs with Dependencies 1993 25 STOC Awerbuch & Kutten & Mansour & Patt-Shamir & Varghese, Time Optimal Self-Stabilizing Synchronization (Extended Abstract) 1993 25 STOC Cooper & Linial, Fast Perfect-Information Leader-Election Protocol with Linear Immunity 1993 25 STOC Rackoff & Simon, Cryptographic Defense Against Traffic Analysis 1993 25 STOC Klein & Plotkin & Rao, Excluded Minors, Network Decomposition, and Multicommodity Flow 1993 25 STOC Plotkin & Tardos, Improved Bounds on the Max-Flow Min-Cut Ratio for Multicommodity Flows 1993 25 STOC Garg & Vazirani & Yannakakis, Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications 1993 25 STOC Williamson & Goemans & Mihail & Vazirani, A Primal-Dual Approximation Algorithm for Generalized Steiner Network Problems 1993 25 STOC Edmonds, Time-Space Trade-Offs for Undirected ST-Connectivity on a JAG 1993 25 STOC Barnes & Feige, Short Random Walks on Graphs (Extended Abstract) 1993 25 STOC Kenyon & Randall & Sinclair, Matchings in Lattice Graphs (Preliminary Version) 1993 25 STOC Schulman, Deterministic Coding for Interactive Communication 1993 25 STOC Karger & Stein, An O~(n^2) Algorithm for Minimum Cuts 1993 25 STOC Park & Phillips, Finding Minimum-Quotient Cuts in Planar Graphs (extended abstract) 1993 25 STOC Phillips, The Network Inhibition Problem (extended abstract) 1993 25 STOC Ar & Blum & Codenotti & Gemmell, Checking Approximate Computations Over the Reals 1993 25 STOC Shamir, On the Generation of Multivariate Polynomials which are Hard to Factor 1993 25 STOC von zur Gathen & Karpinski & Shparlinski, Counting Curves and Their Projections (Extended Abstract) 1992 24 STOC Azar & Broder & Karlin & Linial & Phillips, Biased Random Walks 1992 24 STOC Even & Goldreich & Luby & Nisan & Velickovic, Approximations of General Independent Distributions 1992 24 STOC Schulman, Sample Spaces Uniform on Neighborhoods 1992 24 STOC Feder & Mihail, Balanced Matroids 1992 24 STOC Bartal & Fiat & Rabani, Competitive Algorithms for Distributed Data Management (Extended Abstract) 1992 24 STOC Bartal & Fiat & Karloff & Vohra, New Algorithms for an Ancient Scheduling Problem 1992 24 STOC Amir & Benson & Farach, Alphabet Independent Two Dimensional Matching 1992 24 STOC Galil, A Constant-Time Optimal Parallel String-Matching Algorithm 1992 24 STOC Leighton, Methods for Message Routing in Parallel Machines 1992 24 STOC von zur Gathen & Shoup, Computing Frobenius Maps and Factoring Polynomials (Extended Abstract) 1992 24 STOC Cai, Parallel Computation Over Hyperbolic Groups 1992 24 STOC Beals & Seress, Structure Forest and Composition Factors for Small Base Groups in Nearly Linear Time 1992 24 STOC Barvinok, Feasibility Testing for Systems of Real Quadratic Equations 1992 24 STOC Lin, Fault Tolerant Planar Communication Networks 1992 24 STOC Broder & Frieze & Upfal, Existence and Construction of Edge Disjoint Paths on Expander Graphs 1992 24 STOC Maggs & Sitaraman, Simple Algorithms for Routing on Butterfly Networks with Bounded Queues (Extended Abstract) 1992 24 STOC Aumann & Ben-Or, Computing with Faulty Arrays 1992 24 STOC Bjorner & Lovasz & Yao, Linear Decision Trees: Volume Estimates and Topological Bounds 1992 24 STOC Kahn & Kim, Entropy and Sorting 1992 24 STOC Beame & Lawry, Randomized versus Nondeterministic Communication Complexity 1992 24 STOC Beame & Impagliazzo & Krajicek & Pitassi & Pudlak & Woods, Exponential Lower Bounds for the Pigeonhole Principle 1992 24 STOC Reed, Finding Approximate Separators and Computing Tree Width Quickly 1992 24 STOC Rao, Faster Algorithms for Finding Small Edge Cuts in Planar Graphs (Extended Abstract) 1992 24 STOC Dahlhaus & Johnson & Papadimitriou & Seymour & Yannakakis, The Complexity of Multiway Cuts (Extended Abstract) 1992 24 STOC Dor & Tarsi, Graph Decomposition is NPC -- A Complete Proof of Holyer's Conjecture 1992 24 STOC Lee & Yannakakis, Online Minimization of Transition Systems (Extended Abstract) 1992 24 STOC Safra, Exponential Determinization for omega-Automata with Strong-Fairness Acceptance Condition (Extended Abstract) 1992 24 STOC Bellantoni & Cook, A New Recursion-Theoretic Characterization of the Polytime Functions (Extended Abstract) 1992 24 STOC Grove & Halpern & Koller, Asymptotic Conditional Probabilities for First-Order Logic 1992 24 STOC Kedem & Palem & Rabin & Raghunathan, Efficient Program Transformations for Resilient Parallel Computation via Randomization (Preliminary Version) 1992 24 STOC Karp & Luby & Meyer auf der Heide, Efficient PRAM Simulation on a Distributed Memory Machine 1992 24 STOC Ajtai & Megiddo, A Deterministic Poly(log log N)-Time N-Processor Algorithm for Linear Programming in Fixed Dimension 1992 24 STOC Kelsen, On the Parallel Complexity of Computing a Maximal Independent Set in a Hypergraph 1992 24 STOC Angluin, Computational Learning Theory: Survey and Selected Bibliography 1992 24 STOC Bashouty & Hancock & Hellerstein, Learning Arithmetic Read-Once Formulas 1992 24 STOC Blum & Rudich, Fast Learning of k-Term DNF Formulas with Queries 1992 24 STOC Ben-David, Can Finite Samples Detect Singularities of Real-Valued Functions? 1992 24 STOC Lindell, A Logspace Algorithm for Tree Canonization (Extended Abstract) 1992 24 STOC Plaxton, A Hypercubic Sorting Network with Nearly Logarithmic Depth 1992 24 STOC Klugerman & Plaxton, Small-Depth Counting Networks 1992 24 STOC Paterson & Zwick, Shallow Multiplication Circuits and Wise Financial Investments 1992 24 STOC Babai & Beals & Takacsi-Nagy, Symmetry and Complexity 1992 24 STOC Lin & Olariu & Schwing & Zhang, Sorting in O(1) Time on an n-by-n Reconfigurable Mesh 1992 24 STOC Beigel, When Do Extra Majority Gates Help? Polylog(n) Majority Gates are Equivalent to One 1992 24 STOC Barrington & Beigel & Rudich, Representing Boolean Functions as Polynomials Modulo Composite Numbers (Extended Abstract) 1992 24 STOC Nisan & Szegedy, On the Degree of Boolean Functions as Real Polynomials 1992 24 STOC Paturi, On the Degree of Polynomials that Approximate Symmetric Boolean Functions 1992 24 STOC Kalai, A Subexponential Randomized Simplex Algorithm (Extended Abstract) 1992 24 STOC Adler & Beling, Polynomial Algorithms for Linear Programming over the Algebraic Numbers 1992 24 STOC Galil & Italiano & Sarnak, Fully Dynamic Planarity Testing (Extended Abstract) 1992 24 STOC Goodrich, Planar Separators and Parallel Polygon Triangulation (Preliminary Version) 1992 24 STOC Agarwal & Matousek, Ray Shooting and Parametric Search 1992 24 STOC Malitz & Papakostas, On the Angular Resolution of Planar Graphs 1992 24 STOC Lo & Matousek & Steiger, Ham-Sandwich Cuts in R^d 1992 24 STOC Callahan & Kosaraju, A Decomposition of Multi-Dimensional Point-Sets with Applications to k-Nearest-Neighbors and n-Body Potential Fields (Preliminary Version) 1992 24 STOC Awerbuch & Patt-Shamir & Peleg & Saks, Adapting to Asynchronous Dynamic Networks (Extended Abstract) 1992 24 STOC Awerbuch & Kutten & Peleg, Competitive Distributed Job Scheduling (Extended Abstract) 1992 24 STOC Panconesi & Srinivasan, Improved Distributed Algorithms for Coloring and Network Decomposition Problems 1992 24 STOC Choy & Singh, Efficient Fault Tolerant Algorithms for Resource Allocation in Distributed Systems 1992 24 STOC Sipser, The History and Status of the P versus NP Question 1992 24 STOC Nisan, RL subseteq SC 1992 24 STOC Simon & Szegedy, On the Complexity of RAM with Various Operation Sets 1992 24 STOC Venkatesan & Rajagopalan, Average Case Intractability of Matrix and Diophantine Problems (Extended Abstract) 1992 24 STOC Feige & Lund, On the Hardness of Computing the Permanent of Random Matrices (Extended Abstract) 1992 24 STOC Dwork & Waarts, Simple and Efficient Bounded Concurrent Timestamping Or Bounded Concurrent Timestamp Systems are Comprehensible! 1992 24 STOC Mayer & Ofek & Ostrovsky & Yung, Self-Stabilizing Symmetry Breaking in Constant-Space (extended abstract) 1992 24 STOC Attiya & Friedman, A Correctness Condition for High-Performance Multiprocessors (Extended Abstract) 1992 24 STOC Brightwell & Ott & Winkler, Target Shooting With Programmed Random Variables 1992 24 STOC Franklin & Yung, Communication Complexity of Secure Computation (Extended Abstract) 1992 24 STOC Bellare & Petrank, Making Zero-Knowledge Provers Efficient 1992 24 STOC Kilian, A Note on Efficient Zero-Knowledge Proofs and Arguments (extended abstract) 1992 24 STOC Feige & Lovasz, Two-Prover One-Round Proof Systems: Their Power and Their Problems (Extended Abstract) 1992 24 STOC Seidel, On the All-Pairs-Shortest-Path Problem 1992 24 STOC Klein & Sairam, A Parallel Randomized Approximation Scheme for Shortest Paths 1992 24 STOC Khuller & Vishkin, Biconnectivity Approximations and Graph Carvings 1992 24 STOC Lin & Vitter, epsilon-Approximations with Minimum Packing Constraint Violation (extended abstract) 1991 23 STOC Beigel & Reingold & Spielman, PP is Closed Under Intersection (Extended Abstract) 1991 23 STOC Ko, Integral Equations, System of Quadratic Equations, and Exponential Time Completeness (Extended Abstract) 1991 23 STOC Babai & Fortnow & Levin & Szegedy, Checking Computations in Polylogarithmic Time 1991 23 STOC Gemmell & Lipton & Rubinfeld & Sudan & Wigderson, Self-Testing/Correcting for Polynomials and for Approximate Functions 1991 23 STOC Barnes & Ruzzo, Deterministic Algorithms for Undirected s-t Connectivity Using Polynomial Time and Sublinear Space (Extended Abstract) 1991 23 STOC Kaltofen, Effective Noether Irreducibility Forms and Applications (Extended Abstract) 1991 23 STOC Adleman, Factoring Numbers Using Singular Integers 1991 23 STOC Buchmann & Shoup, Constructing Nonresidues in Finite Fields and the Extended Riemann Hypothesis (Preliminary Version) 1991 23 STOC Menezes & Vanstone & Okamoto, Reducing Elliptic Curve Logarithms to Logarithms in a Finite Field 1991 23 STOC Babai & Cooperman & Finkelstein & Luks & Seress, Fast Monte Carlo Algorithms for Permutation Groups 1991 23 STOC Leighton & Makedon & Plotkin & Stein & Tardos & Tragoudas, Fast Approximation Algorithms for Multicommodity Flow Problems 1991 23 STOC Gabow, A Matroid Approach to Finding Edge Connectivity and Packing Arborescences 1991 23 STOC Feder & Motwani, Clique Partitions, Graph Compression and Speeding-up Algorithms 1991 23 STOC Agrawal & Klein & Ravi, When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks 1991 23 STOC Cohen & Megiddo, Improved Algorithms for Linear Inequalities with Two Variables per Inequality (Extended Abstract) 1991 23 STOC Applegate & Kannan, Sampling and Integration of Near Log-Concave Functions 1991 23 STOC Babai, Local Expansion of Vertex-Transitive Graphs and Random Generation in Finite Groups 1991 23 STOC Brightwell & Winkler, Counting Linear Extensions Is #P-Complete 1991 23 STOC Broder & Frieze & Shamir, Finding Hidden Hamiltonian Cycles (Extended abstract) 1991 23 STOC Karp, Probabilistic Recurrence Relations 1991 23 STOC Shapiro, Separating Concurrent Languages with Categories of Language Embeddings (Extended Abstract) 1991 23 STOC Abiteboul & Vianu, Generic Computation and Its Complexity 1991 23 STOC Harel, Hamiltonian Paths in Infinite Graphs 1991 23 STOC Coffman & Courcoubetis & Garey & Johnson & McGeoch & Shor & Weber & Yannakakis, Fundamental Discrepancies Between Average-Case Analyses Under Discrete and Continuous Distributions: A Bin Packing Case Study 1991 23 STOC Coffman & Garey, Proof of the 4/3 Conjecture for Preemptive vs. Nonpreemptive Two-Processor Scheduling 1991 23 STOC Borodin & Irani & Raghavan & Schieber, Competitive Paging with Locality of Reference (Preliminary Version) 1991 23 STOC Grove, The Harmonic Online K-Server Algorithm is Competitive 1991 23 STOC Kahan, A Model for Data in Motion 1991 23 STOC Karloff & Rabani & Ravid, Lower Bounds for Randomized k-Server and Motion-Planning Algorithms 1991 23 STOC Deng & Mahajan, Infinite Games: Randomization, Computability, and Applications to Online Problems (Preliminary Version) 1991 23 STOC Hagerup, Constant-Time Parallel Integer Sorting (extended abstract) 1991 23 STOC Matias & Vishkin, Converting High Probability into Nearly-Constant Time - with Applications to Parallel Hashing (Extended Abstract) 1991 23 STOC Galil & Italiano, Fully Dynamic Algorithms for Edge Connectivity Problems (Extended Abstract) 1991 23 STOC Blum & Jiang & Li & Tromp & Yannakakis, Linear Approximation of Shortest Superstrings 1991 23 STOC Djidjev & Reif, An Efficient Algorithm for the Genus Problem with Explicit Construction of Forbidden Subgraphs 1991 23 STOC Aspnes & Herlihy & Shavit, Counting Networks and Muli-Processor Coordination 1991 23 STOC Attiya & Dwork & Lynch & Stockmeyer, Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty (Extended Abstract) 1991 23 STOC Anderson & Woll, Wait-free Parallel Algorithms for the Union-Find Problem 1991 23 STOC Kedem & Palem & Raghunathan & Spirakis, Combining Tentative and Definite Executions for Very Fast Dependable Parallel Computing (extended abstract) 1991 23 STOC Cheriyan & Thurimella, Algorithms for Parallel k-Vertex Connectivity and Sparse Certificates (Extended Abstract) 1991 23 STOC Aspnes & Beigel & Furst & Rudich, The Expressive Power of Voting Polynomials 1991 23 STOC Nisan, Lower Bounds for Non-Commutative Computation: Extended Abstract 1991 23 STOC Nisan & Wigderson, Rounds in Communication Complexity Revisited 1991 23 STOC Luby & Velickovic, On Deterministic Approximation of DNF 1991 23 STOC Breslauer & Galil, A Lower Bound for Parallel String Matching 1991 23 STOC Angluin & Kharitonov, When Won't Membership Queries Help? (Extended Abstract) 1991 23 STOC Kushilevitz & Mansour, Learning Decision Trees Using the Fourier Sprectrum (extended abstract) 1991 23 STOC Littlestone & Long & Warmuth, On-Line Learning of Linear Functions 1991 23 STOC Yannakakis & Lee, Testing Finite State Machines (Extended Abstract) 1991 23 STOC Aslam & Dhagat, Searching in the Presence of Linearly Bounded Errors (Extended Abstract) 1991 23 STOC Blum & Raghavan & Schieber, Navigating in Unfamiliar Geometric Terrain (Preliminary Version) 1991 23 STOC Matousek, Approximations and Optimal Geometric Divide-and-Conquer 1991 23 STOC Mulmuley, Hidden Surface Removal With Respect to a Moving View Point (Extended abstract) 1991 23 STOC Goodrich & Tamassia, Dynamic Trees and Dynamic Point Location (Preliminary Version) 1991 23 STOC Fiat & Naor, Rigorous Time/Space Tradeoffs for Inverting Functions 1991 23 STOC Dolev & Dwork & Naor, Non-Malleable Cryptography (Extended Abstract) 1991 23 STOC Kilian, A General Completeness Theorem for Two-Party Games 1991 23 STOC Maurer, Perfect Cryptographic Security from Partially Independent Channels 1990 22 STOC Fredman & Willard, BLASTING Through the Information Theoretic Barrier with FUSION TREES 1990 22 STOC Cole, On the Dynamic Finger Conjecture for Splay Trees (Extended Abstract) 1990 22 STOC Sundar & Tarjan, Unique Binary Search Tree Representations and Equality-testing of Sets and Sequences 1990 22 STOC Frederickson, The Information Theory Bound is Tight for Selection in a Heap 1990 22 STOC La Poutre, Lower Bounds for the Union-Find and the Split-Find Problem on Pointer Machines (Extended Abstract) 1990 22 STOC Goddard & King & Schulman, Optimal Randomized Algorithms for Local Sorting and Set-Maxima 1990 22 STOC Board & Pitt, On the Necessity of Occam Algorithms 1990 22 STOC Blum, Learning Boolean Functions in an Infinite Attribute Space (Extended Abstract) 1990 22 STOC Blum & Luby & Rubinfeld, Self-testing/Correcting Programs with Applications to Numerical Problems 1990 22 STOC Yao, Coherent Functions and Program Checkers (Extended Abstract) 1990 22 STOC Even & Rajsbaum, The Use of a Synchronizer Yields Maximum Computation Rate in Distributed Networks (Extended Abstract) 1990 22 STOC Fischer & Moran & Rudich & Taubenfeld, The Wakeup Problem (Extended Abstract) 1990 22 STOC Dietzfelbinger & Meyer auf der Heide, How to Distribute a Dictionary in a Complete Network 1990 22 STOC Feige & Peleg & Raghavan & Upfal, Computing with Unreliable Information (Preliminary Version) 1990 22 STOC Kedem & Palem & Spirakis, Efficient Robust Parallel Computations (Extended Abstract) 1990 22 STOC Arora & Leighton & Maggs, On-line Algorithms for Path Selection in a Nonblocking Network (Extended Abstract) 1990 22 STOC Vitter & Shriver, Optimal Disk I/O with Parallel Block Transfer (Extended Abstract) 1990 22 STOC Vishkin, Deterministic Sampling - A New Technique for Fast Pattern Matching 1990 22 STOC Kao & Klein, Towards Overcoming the Transitive-closure Bottleneck: Efficient Parallel Algorithms for Planar Digraphs (Extended Abstract) 1990 22 STOC Cypher & Plaxton, Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related Computers 1990 22 STOC Nisan, Pseudorandom Generators for Space-Bounded Computation 1990 22 STOC Naor & Naor, Small-bias Probability Spaces: Efficient Constructions and Applications 1990 22 STOC Schmidt & Siegel, The Analysis of Closed Hashing Under Limited Randomness (Extended Abstract) 1990 22 STOC Mansour & Nisan & Tiwari, The Computational Complexity of Universal Hashing 1990 22 STOC Gil & Meyer auf der Heide & Wigderson, Not All Keys Can Be Hashed in Constant Time (Preliminary Version) 1990 22 STOC Zuckerman, A Technique for Lower Bounding the Cover Time 1990 22 STOC Linial & Nisan, Approximate Inclusion-Exclusion 1990 22 STOC Cleve, Towards Optimal Simulations of Formulas by Bounded-Width Programs 1990 22 STOC Szegedy, Functions with Bounded Symmetric Communication Complexity and Circuits with mod m Gates 1990 22 STOC Raz & Wigderson, Monotone Circuits for Matching Require Linear Depth 1990 22 STOC Alon & Seymour & Thomas, A Separator Theorem for Graphs with an Excluded Minor and its Applications 1990 22 STOC Miller & Thurston, Separators in Two and Three Dimensions 1990 22 STOC Klein & Stein & Tardos, Leighton-Rao Might be Practical: Faster Approximation Algorithms for Concurrent Flow with Uniform Capacities 1990 22 STOC Mulmuley, Output Sensitive Construction of Levels and Voronoi Diagrams in R^d of Order 1 to k 1990 22 STOC Aggarwal & Hansen & Leighton, Solving Query-Retrieval Problems by Compacting Voronoi Diagrams (Extended Abstract) 1990 22 STOC Kirkpatrick & Mishra & Yap, Quantitative Steinitz's Theorems with Applications to Multifingered Grasping 1990 22 STOC Karp & Vazirani & Vazirani, An Optimal Algorithm for On-line Bipartite Matching 1990 22 STOC Bern & Greene & Raghunathan & Sudan, Online Algorithms for Locating Checkpoints 1990 22 STOC Coppersmith & Doyle & Raghavan & Snir, Random Walks on Weighted Graphs, and Applications to On-line Algorithms (Preliminary Version) 1990 22 STOC Ben-David & Borodin & Karp & Tardos & Wigderson, On the Power of Randomization in Online Algorithms (Extended Abstract) 1990 22 STOC Rompel, One-Way Functions are Necessary and Sufficient for Secure Signatures 1990 22 STOC Hastad, Pseudo-Random Generators under Uniform Assumptions 1990 22 STOC Schrift & Shamir, The Discrete Log is Very Discreet 1990 22 STOC Feige & Shamir, Witness Indistinguishable and Witness Hiding Protocols 1990 22 STOC Naor & Yung, Public-key Cryptosystems Provably Secure against Chosen Ciphertext Attacks (Extended Abstract) 1990 22 STOC Papadimitriou & Schaffer & Yannakakis, On the Complexity of Local Search (Extended Abstract) 1990 22 STOC Panconesi & Ranjan, Quantifiers and Approximation (Extended Abstract) 1990 22 STOC Ogiwara & Watanabe, On Polynomial Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets 1990 22 STOC Kfoury & Tiuryn & Urzyczyn, The Undecidability of the Semi-unification Problem (Preliminary Report) 1990 22 STOC Harju & Karhumaki, Decidability of the Multiplicity Equivalence of Multitape Finite Automata 1990 22 STOC Bellare & Micali & Ostrovsky, Perfect Zero-Knowledge in Constant Rounds 1990 22 STOC Bellare & Micali & Ostrovsky, The (True) Complexity of Statistical Zero Knowledge 1990 22 STOC Beaver & Micali & Rogaway, The Round Complexity of Secure Protocols (Extended Abstract) 1990 22 STOC Ostrovsky, Efficient Computation on Oblivious RAMs (Extended Abstract) 1990 22 STOC Kantor & Luks, Computing in Quotient Groups 1990 22 STOC Borodin & Tiwari, On the Decidability of Sparse Univariate Polynomial Interpolation (Preliminary Version) 1990 22 STOC Shoup, Searching for Primitive Roots in Finite Fields 1990 22 STOC Lakshman, On the Complexity of Computing a Grobner Basis for the Radical of a Zero Dimensional Ideal 1990 22 STOC Lenstra & Lenstra & Manasse & Pollard, The Number Field Sieve 1989 21 STOC Babai & Nisan & Szegedy, Multiparty Protocols and Logspace-Hard Pseudorandom Sequences 1989 21 STOC Impagliazzo & Levin & Luby, Pseudo-Random Number Generation from One-Way Functions 1989 21 STOC Goldreich & Levin, A Hard-Core Predicate for All One-Way Functions 1989 21 STOC Naor & Yung, Universal One-Way Hash Functions and their Cryptographic Applications 1989 21 STOC Impagliazzo & Rudich, Limits on the Provable Consequences of One-Way Permutations 1989 21 STOC Chor & Kushilevitz, A Zero-One Law for Boolean Privacy 1989 21 STOC Rabin & Ben-Or, Verifiable Secret Sharing and Multiparty Protocols with Honest Majority (Extended Abstract) 1989 21 STOC Blum & Kannan, Designing Programs that Check Their Work 1989 21 STOC Vallee, Provably Fast Integer Factoring with Quasi-Uniform Small Quadratic Residues 1989 21 STOC Cook & Urquhart, Functional Interpretations of Feasibly Constructive Arithmetic 1989 21 STOC Afrati & Cosmadakis, Expressiveness of Restricted Recursive Queries 1989 21 STOC Safra & Vardi, On omega-Automata and Temporal Logic 1989 21 STOC Ierardi, Quantifier Elimination in the Theory of an Algebraically-Closed Fields 1989 21 STOC Fortnow & Sipser, Probabilistic Computation and Linear Time 1989 21 STOC Kurtz & Mahaney & Royer, The Isomorphism Conjecture Fails Relative to a Random Oracle 1989 21 STOC Razborov, On the Method of Approximations 1989 21 STOC Bshouty, On the Extended Direct Sum Conjecture 1989 21 STOC Yao, Circuits and Local Computation 1989 21 STOC Beame, A General Sequential Time-Space Tradeoff for Finding Unique Elements 1989 21 STOC Ben-David & Chor & Goldreich & Luby, On the Theory of Average Case Complexity 1989 21 STOC Lam & Tiwari & Tompa, Tradeoffs Between Communication and Space 1989 21 STOC Koch & Leighton & Maggs & Rao & Rosenberg, Work-Preserving Emulations of Fixed-Connection Networks 1989 21 STOC Upfal, An O(log N) Deterministic Packet Routing Scheme 1989 21 STOC Hastad & Leighton & Newman, Fast Computation Using Faulty Hypercubes 1989 21 STOC Reif & Tate, Optimal Size Integer Division Circuits 1989 21 STOC Alon & Bar-Noy & Linial & Peleg, On the Complexity of Radio Communication 1989 21 STOC Kao & Shannon, Local Reorientation, Global Order, and Planar Topology 1989 21 STOC Aggarwal & Anderson & Kao, Parallel Depth-First Search in General Directed Graphs 1989 21 STOC Berkman & Breslauer & Galil & Schieber & Vishkin, Highly Parallelizable Problems 1989 21 STOC Boppana, Optimal Separations Between Concurrent-Write Parallel Machines 1989 21 STOC Nisan, CREW PRAMs and Decision Trees 1989 21 STOC Fiat & Naor, Implicit O(1) Probe Search 1989 21 STOC Fredman & Saks, The Cell Probe Complexity of Dynamic Data Structures 1989 21 STOC Schmidt & Siegel, On Aspects of Universality and Performance for Closed Hashing 1989 21 STOC Kenyon-Mathieu & King, Verifying Partial Orders 1989 21 STOC Dyer & Frieze & Kannan, A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies 1989 21 STOC Chazelle & Edelsbrunner & Guibas & Sharir, Lines in Space--Combinatorics, Algorithms and Applications 1989 21 STOC Reif & Sen, Polling: A New Randomized Sampling Technique for Computational Geometry 1989 21 STOC Goodman & Pollack & Sturmfels, Coordinate Representation of Order Types Requires Exponential Storage 1989 21 STOC Rivest & Schapire, Inference of Finite Automata Using Homing Sequences 1989 21 STOC Pitt & Warmuth, The Minimum Consistent DFA Problem Cannot be Approximated within any Polynomial 1989 21 STOC Kearns & Valiant, Cryptographic Limitations on Learning Boolean Formulae and Finite Automata 1989 21 STOC Birget, Proof of a Conjecture of R. Kannan 1989 21 STOC Dolev & Shavit, Bounded Concurrent Time-Stamp Systems Are Constructible 1989 21 STOC Graham & Yao, On the Improbability of Reaching Byzantine Agreements 1989 21 STOC Awerbuch & Bar-Noy & Linial & Peleg, Compact Distributed Data Structures for Adaptive Routing 1989 21 STOC Awerbuch, Randomized Distributed Shortest Paths Algorithms 1989 21 STOC Fellows & Langston, On Search, Decision and the Efficiency of Polynomial-Time Algorithms 1989 21 STOC Feder , A New Fixed Point Approach for Stable Networks and Stable Marriages 1989 21 STOC Cohen & Megiddo, Strongly Polynomial-Time and NC Algorithms for Detecting Cycles in Dynamic Graphs 1989 21 STOC Blum, An O(n^0.4)-Approximation Algorithm for 3-Coloring 1989 21 STOC Broder & Karlin & Raghavan & Upfal, Trading Space for Time in Undirected s-t Connectivity 1989 21 STOC Motwani, Expanding Graphs and the Average-case Analysis of Algorithms for Matchings and Related Problems 1989 21 STOC Borodin & Ruzzo & Tompa, Lower Bounds on the Length of Universal Traversal Sequences 1989 21 STOC Chandra & Raghavan & Ruzzo & Smolensky & Tiwari, The Electrical Resistance of a Graph Captures its Commute and Cover Times 1989 21 STOC Friedman & Kahn & Szemeredi, On the Second Eigenvalue of Random Regular Graphs 1988 20 STOC Ben-Or & Goldwasser & Wigderson, Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation 1988 20 STOC Chaum & Crepeau & Damgard, Multiparty Unconditionally Secure Protocols 1988 20 STOC Kilian, Founding Cryptography on Oblivious Transfer 1988 20 STOC Bellare & Micali, How to Sign Given Any Trapdoor Function 1988 20 STOC Peleg & Upfal, A Tradeoff Between Space and Efficiency for Routing Tables 1988 20 STOC Halpern & Vardi, Reasoning About Knowledge and Time in Asynchronous Systems 1988 20 STOC Berman & Simon, Investigations of Fault-Tolerant Networks of Computers 1988 20 STOC Dolev & Gafni & Shavit, Toward a Non-Atomic Era: l-Exclusion as a Test Case 1988 20 STOC Krizanc & Peleg & Upfal, A Time-Randomness Tradeoff for Oblivious Routing 1988 20 STOC Blum & Feldman & Micali, Non-Interactive Zero-Knowledge and its Applications 1988 20 STOC Ben-Or & Goldwasser & Kilian & Wigderson, Multi-Prover Interactive Proofs: How to Remove Intractability 1988 20 STOC Halpern & Moses & Tuttle, A Knowledge-Based Analysis of Zero Knowledge 1988 20 STOC Feldman & Micali, Optimal Algorithms for Byzantine Agreement 1988 20 STOC Halstenberg & Reischuk, On Different Modes of Communication 1988 20 STOC Aggarwal & Chandra, Virtual Memory Algorithms 1988 20 STOC Hajnal & Maass & Turan, On the Communication Complexity of Graph Properties 1988 20 STOC Bhatt & Chung & Hong & Leighton & Rosenberg, Optimal Simulations by Butterfly Networks 1988 20 STOC Aggarwal & Chandra & Raghavan, Energy Consumption in VLSI Circuits 1988 20 STOC Venkatesan & Levin, Random Instances of a Graph Coloring Problem are Hard 1988 20 STOC Yannakakis, Expressing Combinatorial Optimization Problems by Linear Programs 1988 20 STOC Papadimitriou & Yannakakis, Optimization, Approximation, and Complexity Classes 1988 20 STOC Jerrum & Sinclair, Conductance and the Rapid Mixing Property for Markov Chains: The Approximation of the Permanent Resolved 1988 20 STOC Ko, Relativized Polynomial Time Hierarchies Having Exactly K Levels 1988 20 STOC Ben-Or & Cleve, Computing Algebraic Formulas with a Constant Number of Registers 1988 20 STOC Kalyanasundaram & Schnitger, On the Power of White Pebbles 1988 20 STOC Kearns & Li, Learning in the Presence of Malicious Errors 1988 20 STOC Gurevich & Shelah, Nondeterministic Linear Tasks May Require Substantially Nonlinear Deterministic Time in the Case of Sublinear Work Space 1988 20 STOC Karp & Zhang, A Randomized Parallel Branch-and-Bound Procedure 1988 20 STOC Ben-Or & Tiwari, A Deterministic Algorithm for Sparse Multivariate Polynomial Interpolation 1988 20 STOC Karloff & Raghavan, Randomized Algorithms and Pseudorandom Numbers 1988 20 STOC Manasse & McGeoch & Sleator, Competitive Algorithms for On-line Problems 1988 20 STOC Kannan & Naor & Rudich, Implicit Representation of Graphs 1988 20 STOC Fiat & Naor & Schaffer & Schmidt & Siegel, Storing and Searching a Multikey Table 1988 20 STOC Lueker & Molodowitch, More Analysis of Double Hashing 1988 20 STOC Loebl & Nesetril, Linearity and Unprovability of Set Union Problem Strategies 1988 20 STOC Fiat & Naor & Schmidt & Siegel, Non-Oblivious Hashing 1988 20 STOC Orlin, A Faster Strongly Polynomial Minimum Cost Flow Algorithm 1988 20 STOC Goldberg & Tarjan, Finding Minimum-Cost Circulations by Canceling Negative Cycles 1988 20 STOC Kosaraju & Sullivan, Detecting Cycles in Dynamic Graphs in Polynomial Time 1988 20 STOC Gabow & Westermann, Forests, Frames, and Games: Algorithms for Matroid Sums and Applications 1988 20 STOC Vaidya, Geometry Helps in Matching 1988 20 STOC de Fraysseix & Pach & Pollack, Small Sets Supporting Fary Embeddings of Planar Graphs 1988 20 STOC Feder & Greene, Optimal Algorithms for Approximate Clustering 1988 20 STOC Fortune & Wilfong, Planning Constrained Motion 1988 20 STOC Canny, Some Algebraic and Geometric Computations in PSPACE 1988 20 STOC King, Lower Bounds on the Complexity of Graph Properties 1988 20 STOC Cosmadakis & Gaifman & Kanellakis & Vardi, Decidable Optimization Problems for Database Logic Programs 1988 20 STOC Istrail, Polynomial Universal Traversing Sequences for Cycles Are Constructible 1988 20 STOC Pintz & Steiger & Szemeredi, Two Infinite Sets of Primes with Fast Primality Tests 1988 20 STOC Papadimitriou & Yannakakis, Towards an Architecture-Independent Analysis of Parallel Algorithms 1988 20 STOC Gabow & Tarjan, Almost-Optimum Speed-ups of Algorithms for Bipartite Matching and Related Problems 1988 20 STOC Adleman & Kompella, Using Smoothness to Achieve Parallelism 1988 20 STOC Karchmer & Wigderson, Monotone Circuits for Connectivity Require Super-logarithmic Depth 1988 20 STOC Broder, Errata to ``How hard is it to marry at random? (On the approximation of the permanent)'' (STOC 18) 1987 19 STOC Coppersmith & Winograd, Matrix Multiplication via Arithmetic Progressions 1987 19 STOC Goldberg & Tarjan, Solving Minimum-Cost Flow Problems by Successive Approximation 1987 19 STOC Frederickson, A New Approach to All Pairs Shortest Paths in Planar Graphs 1987 19 STOC Vaidya, An Algorithm for Linear Programming which Requires O(((m+n)n^2 + (m+n)^1.5 n)L) Arithmetic Operations 1987 19 STOC Aggarwal & Guibas & Saxe & Shor, A Linear Time Algorithm for Computing the Voronoi Diagram of a Convex Polygon 1987 19 STOC Iwano & Steiglitz, Testing for Cycles in Infinite Graphs with Periodic Structure 1987 19 STOC Clarkson, Approximation Algorithms for Shortest Path Motion Planning 1987 19 STOC Chazelle & Edelsbrunner & Guibas, The Complexity of Cutting Convex Polytopes 1987 19 STOC Smolensky, Algebraic Methods in the Theory of Lower Bounds for Boolean Circuit Complexity 1987 19 STOC Beame & Hastad, Optimal Bounds for Decision Problems on the CRCW PRAM 1987 19 STOC Maass & Schnitger & Szemeredi, Two Tapes Are Better than One for Off-line Turing Machines 1987 19 STOC Barrington & Therien, Finite Monoids and the Fine Structure of NC^1 1987 19 STOC Hemachandra, The Strong Exponential Hierarchy Collapses 1987 19 STOC Buss, The Boolean Formula Value Problem is in ALOGTIME 1987 19 STOC Ajtai & Komlos & Szemeredi, Deterministic Simulation in LOGSPACE 1987 19 STOC Venkateswaran, Properties that Characterize LOGCFL 1987 19 STOC Allender, Some Consequences of the Existence of Pseudorandom Generators 1987 19 STOC Vazirani, Efficiency Considerations in Using Semi-random Sources 1987 19 STOC Lichtenstein & Linial & Saks, Imperfect Random Sources and Discrete Controlled Processes 1987 19 STOC Furer, The Power of Randomness for Communication Complexity 1987 19 STOC Goldreich, Towards a Theory of Software Protection and Simulation by Oblivious RAMs 1987 19 STOC Abadi & Feigenbaum & Kilian, On Hiding Information from an Oracle 1987 19 STOC Fortnow, The Complexity of Perfect Zero-Knowledge 1987 19 STOC Feige & Fiat & Shamir, Zero Knowledge Proofs of Identity 1987 19 STOC Goldreich & Micali & Wigderson, How to Play ANY Mental Game, or A Completeness Theorem for Protocols with Honest Majority 1987 19 STOC Awerbuch, Optimal Distributed Algorithms for Minimum Weight Spanning Tree, Counting, Leader Election and Related Problems 1987 19 STOC Hastad & Leighton & Rogoff, Analysis of Backoff Protocols for Multiple Access Channels 1987 19 STOC Miller & Teng, Dynamic Parallel Complexity of Computational Circuits 1987 19 STOC Peleg & Upfal, Constructing Disjoint Paths on Expander Graphs 1987 19 STOC Hastad & Leighton & Newman, Reconfiguring a Hypercube in the Presence of Faults 1987 19 STOC Kearns & Li & Pitt & Valiant, On the Learnability of Boolean Formulae 1987 19 STOC Natarajan, On Learning Boolean Functions 1987 19 STOC Aggarwal & Alpern & Chandra, An Hierarchical Memory Model 1987 19 STOC Goldberg & Plotkin & Shannon, Parallel Symmetry-Breaking in Sparse Graphs 1987 19 STOC Aggarwal & Alpern & Chandra & Snir, A Model for Hierarchical Memory 1987 19 STOC Miller & Ramachandran, A New Graph Triconnectivity Algorithm and Its Parallelization 1987 19 STOC Mulmuley & Vazirani & Vazirani, Matching is as Easy as Matrix Inversion 1987 19 STOC Naor & Naor & Schaffer, Fast Parallel Algorithms for Chordal Graphs 1987 19 STOC Dietz & Sleator, Two Algorithms for Maintaining Order in a List 1987 19 STOC Borodin & Linial & Saks, An Optimal Online Algorithm for Metrical Task Systems 1987 19 STOC Munro, Searching a Two Key Table Under a Single Key 1987 19 STOC Heath & Istrail, The Pagenumber of Genus g Graphs is O(g) 1987 19 STOC Ronyai, Simple Algebras are Difficult 1987 19 STOC Babai & Luks & Seress, Permutation Groups in NC 1987 19 STOC Shelah & Spencer, Threshold Spectra for Random Graphs 1987 19 STOC Kolaitis & Vardi, The Decision Problem for the Probabilities of Higher-Order Properties 1987 19 STOC Bilardi & Preparata, Size-Time Complexity of Boolean Networks for Prefix Computations 1987 19 STOC Kaltofen, Single-Factor Hensel Lifting and its Application to the Straight-Line Complexity of Certain Polynomials 1987 19 STOC Bach, Realistic Analysis of Some Randomized Algorithms 1987 19 STOC Adleman & Huang, Recognizing Primes in Random Polynomial Time 1986 18 STOC Kosaraju, Parallel Evaluation of Division-free Arithmetic Expressions 1986 STOC Adleman & Lenstra, Finding Irreducible Polynomials Over Finite Fields 1986 STOC Ajtai & Babai & Hajnal & Komlos & Pudlak & Rodl & Szemeredi & Turan, Two Lower Bounds for Branching Programs 1986 STOC Ajtai & Komlos & Steiger & Szemeredi, Deterministic Selection in O(loglog N) Parallel Time 1986 STOC Barany & Furedi, Computing the Volume is Difficult 1986 STOC Barrington, Bounded-Width Polynomial-Size Branching Programs Recognize Exactly Those Languages in NC^1 1986 STOC Beame, Limits on the Power of Concurrent-Write Parallel Machines 1986 STOC Ben-Or & Feig & Kozen & Tiwari, A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots 1986 STOC Bern, Two Probabilistic Results on Rectilinear Steiner Trees 1986 STOC Blumer & Ehrenfeucht & Haussler & Warmuth, Classifying Learnable Geometric Concepts with the Vapnik-Chervonenkis Dimension 1986 STOC Broder, How Hard is it to Marry at Random? (On the Approximation of the Permanent) 1986 STOC Clarkson, Further Applications of Random Sampling to Computational Geometry 1986 STOC Cleve, The Impossibility of Secure Coin Flips When Half the Processors are Faulty 1986 STOC Coffman & Leighton, A Provably Efficient Algorithm for Dynamic Storage Allocation 1986 STOC Cole & Vishkin, Deterministic Coin Tossing and Accelerating Cascades: Micro and Macro Techniques for Designing Parallel Algorithms 1986 STOC Courcoubetis & Vardi & Wolper, Reasoning about Fair Concurrent Programs 1986 STOC Dobkin & Edelsbrunnner & Yap, Probing Convex Polytopes 1986 STOC Driscoll & Sarnak & Sleator & Tarjan, Making Data Structures Persistent 1986 STOC Dwork & Peleg & Pippenger & Upfal, Fault Tolerance in Networks of Bounded Degree 1986 STOC Edelsbrunner & Guibas, Topologically Sweeping an Arrangement 1986 STOC Feldman & Friedman & Pippenger, Non-Blocking Networks 1986 STOC Galil & Kannan & Szemeredi, On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing Machines 1986 STOC Goldberg & Tarjan, A New Approach to the Maximum Flow Problem 1986 STOC Goldwasser & Kilian, Almost All Primes Can be Quickly Certified 1986 STOC Goldwasser & Sipser, Private Coins versus Public Coins in Interactive Proof Systems 1986 STOC Halpern & Vardi, The Complexity of Reasoning About Knowledge and Time 1986 STOC Hastad, Almost Optimal Lower Bounds for Small Depth Circuits 1986 STOC Jin-Yi Cai, With Probability One, a Random Oracle Separates PSPACE from the Polynomial-Time Hierarchy 1986 STOC Kaltofen, Uniform Closure Properties of P-Computable Functions 1986 STOC Kapoor & Vaidya, Fast Algorithms for Convex Quadratic Programming and Multicommodity Flows 1986 STOC Karlin & Upfal, Parallel Hashing--An Efficient Implementation of Shared Memory 1986 STOC Ko & Long & Du, A Note on the One-Way Functions and Polynomial-Time Isomorphisms 1986 STOC Kosaraju & Atallah, Optimal Simulations Between Mesh-Connected Arrays of Processors 1986 STOC Krentel, The Complexity of Optimization Problems 1986 STOC Landau & Vishkin, Introducing Efficient Parallelism into Approximate String Matching and a New Serial Algorithm 1986 STOC Leighton & Shor, Tight Bounds for Minimax Grid Matching, With Applications to the Average Case Analysis of Algorithms 1986 STOC Li & Yesha, New Lower Bounds for Parallel Computation 1986 STOC Lubotzky & Phillips & Sarnak, Explicit Expanders and the Ramanujan Conjectures 1986 STOC Luby & Rackoff, Pseudo-Random Permutation Generators and Cryptographic Composition 1986 STOC Lueker & Megiddo & Ramachandran, Linear Programming with Two Variables per Inequality in Poly-Log Time 1986 STOC Schnorr & Shamir, An Optimal Sorting Algorithm for Mesh Connected Computers 1986 STOC Seidel, Constructing Higher-Dimensional Convex Hulls at Logarithmic Cost per Face 1986 STOC Siegel, Aspects of Information Flow in VLSI Circuits 1986 STOC Sleator & Tarjan & Thurston, Rotation Distance, Triangulations, and Hyperbolic Geometry 1986 STOC Tarjan & Van Wyk, A Linear-Time Algorithm for Triangulating Simple Polygons 1986 STOC Yannakakis, Four Pages are Necessary and Sufficient for Planar Graphs 1985 STOC Aggarwal, Tradeoffs for VLSI Models with Subpolynomial Delay 1985 STOC Aharoni & Erdos & Linial, Dual Integer Linear Programs and the Relationship Between Their Optima 1985 STOC Alon, Expanders, Sorting in Rounds and Superconcentrators of Limited Depth 1985 STOC Anderson, A Parallel Algorithm for the Maximal Path Problem 1985 STOC Babai, Trading Group Theory for Randomness 1985 STOC Baker & Fortune & Grosse, Stable Prehension with Three Fingers 1985 STOC Bent & John, Finding the Median Requires 2n Comparisons 1985 STOC Bollobas & Fenner & Frieze, An Algorithm for Finding Hamilton Cycles in Random Graphs 1985 STOC Bollobas & Simon, On the Expected Behavior of Disjoint Set Union Algorithms 1985 STOC Bracha, An O(lg n) Expected Rounds Randomized Byzantine Generals Algorithms 1985 STOC Bruce & Longo, Provable Isomorphisms and Domain Equations in Models of Typed Languages 1985 STOC Buss, The Polynomial Hierarchy and Fragments of Bounded Arithmetic 1985 STOC Carter & Stockmeyer & Wegman, The Complexity of Backtrack Searches 1985 STOC Chung & Hajela & Seymour, Self-Organizing Sequential Search and Hilbert's Inequalities 1985 STOC Clarkson, A Probabilistic Algorithm for the Post Office Problem 1985 STOC Coan & Dolev & Dwork & Stockmeyer, The Distributed Firing Squad Problem 1985 STOC Cosmadakis & Kanellakis, Equational Theories and Database Constraints 1985 STOC Culberson, The Effect of Updates in Binary Search Trees 1985 STOC de Bakker & Meyer & Olderog & Zucker, Transition Systems, Infinitary Languages and the Semantics of Uniform Concurrency 1985 STOC Fagin & Vardi, An Internal Semantics for Modal Logic 1985 STOC Feldman, Fault Tolerance of Minimal Path Routings in a Network 1985 STOC Fich & Meyer auf der Heide & Ragde & Wigderson, One, Two, Three ... Infinity: Lower Bounds for Parallel Computation 1985 STOC Fich & Tompa, The Parallel Complexity of Exponentiating Polynomials over Finite Fields 1985 STOC Friedl & Ronyai, Polynomial Time Solutions of Some Problems of Computational Algebra 1985 STOC Gacs & Reif, A Simple Three-Dimensional Real-Time Reliable Cellular Array 1985 STOC Goldberg & Sipser, Compression and Ranking 1985 STOC Goldwasser & Micali & Rackoff, The Knowledge Complexity of Interactive Proof-Systems 1985 STOC Goodman & Greenberg & Madras & March, On the Stability of the Ethernet 1985 STOC Halpern & Megiddo & Munshi, Optimal Precision in the Presence of Uncertainty 1985 STOC Harel, A Linear Algorithm for Finding Dominators in Flow Graphs and Related Problems 1985 STOC Hastad & Shamir, The Cryptographic Security of Truncated Linearly Related Variables 1985 STOC Huang, Riemann Hypothesis and Finding Roots over Finite Fields 1985 STOC Huynh, The Complexity of the Equivalence Problem for Commutative Semigroups and Symmetric Vector Addition Systems 1985 STOC Jimbo & Maruoka, Expanders Obtained from Affine Transformations 1985 STOC Kaltofen, Computing with Polynomials Given by Straight-Line Programs I: Greatest Common Divisors 1985 STOC Karp & Upfal & Wigderson, Are Search and Decision Problems Computationally Equivalent? 1985 STOC Karp & Upfal & Wigderson, Constructing a Perfect Matching Is in Random NC 1985 STOC Leiserson & Maley, Algorithms for Routing and Testing Routability of Planar VLSI Layouts 1985 STOC Levin, One-Way Functions and Pseudorandom Generators 1985 STOC Lubiw, Doubly Lexical Orderings of Matrices 1985 STOC Luby, A Simple Parallel Algorithm for the Maximal Independent Set Problem 1985 STOC Meyer auf der Heide, Fast Algorithms for n-Dimensional Restrictions of Hard Problems 1985 STOC Pan & Reif, Efficient Parallel Solution of Linear Systems 1985 STOC Peleg, Concurrent Dynamic Logic 1985 STOC Raghavan & Thompson, Provably Good Routing in Graphs: Regular Arrays 1985 STOC Suzuki & Nishizeki & Saito, Multicommodity Flows in Planar Undirected Graphs and Shortest Paths 1985 STOC Vaidya, Space-Time Tradeoffs for Orthogonal Range Queries 1985 STOC Valiant & Vazirani, NP Is as Easy as Detecting Unique Solutions 1985 STOC Vardi & Stockmeyer, Improved Upper and Lower Bounds for Modal Logics of Programs 1985 STOC Vazirani & Vazirani, The Two-Processor Scheduling Problem Is in R-NC 1985 STOC Vazirani, Towards a Strong Communication Complexity Theory or Generating Quasi-Random Sequences from Two Communicating Slightly-Random Sources 1985 STOC Wilber, White Pebbles Help 1985 STOC Yao & Yao, A General Approach to d-Dimensional Geometric Queries 1984 STOC Adler & Megiddo, A Simplex Algorithm Whose Average Number of Steps is Bounded Between Two Quadratic Functions of the Smaller Dimension 1984 STOC Ajtai & Ben-Or, A Theorem on Probabilistic Constant Depth Computations 1984 STOC Alt, Comparison of Arithmetic Functions with Respect to Boolean Circuit Depth 1984 STOC Awerbuch & Israeli & Shiloach, Finding Euler Circuits in Logarithmic Parallel Time 1984 STOC Awerbuch, An Efficient Network Synchronization Protocol 1984 STOC Bach & Miller & Shallit, Sums of Divisors, Perfect Numbers, and Factoring 1984 STOC Barringer & Kuiper & Pnueli, Now You May Compose Temporal Logic Specifications 1984 STOC Ben-Or & Kozen & Reif, The Complexity of Elementary Algebra and Geometry 1984 STOC Bentley & Johnson & Leighton & McGeoch & McGeoch, Some Unexpected Expected Behavior Results for Bin Packing 1984 STOC Bilardi & Preparata, A Minimum Area VLSI Network for O(log N) Time Sorting 1984 STOC Blum, An Area-Maximum Edge Length Tradeoff for VLSI Layout 1984 STOC Blumer & Blumer & Haussler & McConnell & Ehrenfeucht, Building a Complete Inverted File for a Set of Text Files in Linear Time 1984 STOC Boppana, Threshold Functions and Bounded Depth Monotone Circuits 1984 STOC Broder & Simons & Fischer & Dolev, Efficient Fault-Tolerant Routings in Networks 1984 STOC Buss & Shor, On the Pagenumber of Planar Graphs 1984 STOC Chazelle, Intersecting Is Easier Than Sorting 1984 STOC Clarkson, Fast Expected-Time and Approximation Algorithms for Geometric Minimum Spanning Trees 1984 STOC Cole & Yap & Sharir, On k-hulls and Related Problems 1984 STOC Coppersmith, Evaluating Logarithms in GF(2^n) 1984 STOC Cunto & Munro, Average Case Selection 1984 STOC de Rougemont, Uniform Definability on Finite Structures with Successor 1984 STOC Degano & Montanari, Liveness Properties as Convergence in Metric Spaces 1984 STOC Dolev & Halpern & Simons & Strong, A New Look at Fault Tolerant Network Routing 1984 STOC Dolev & Halpern & Strong, On the Possibility and Impossibility of Achieving Clock Synchronization 1984 STOC Dolev & Maier & Mairson & Ullman, Correcting Faults in a Write-Once Memory 1984 STOC Duris & Galil & Schnitger, Lower Bounds on Communication Complexity 1984 STOC Emerson & Sistla, Deciding Branching Time Logic 1984 STOC Franzblau & Kleitman, An Algorithm for Constructing Regions with Rectangles: Independence and Minimum Generating Sets for Collections of Intervals 1984 STOC Frederickson & Lynch, The Impact of Synchronous Communication on the Problem of Electing a Leader in a Ring 1984 STOC Frederickson & Srinivas, Data Structures for On-Line Updating of Matroid Intersection Solutions 1984 STOC Gabow & Bentley & Tarjan, Scaling and Related Techniques for Geometry Problems 1984 STOC Galil, Optimal Parallel Algorithms for String Matching 1984 STOC Gerth, Transition Logic 1984 STOC Goldberg & Marchetti-Spaccamela, On Finding the Exact Solution of a Zero-One Knapsack Problem 1984 STOC Gonnet, Determining Equivalence of Expressions in Random Polynomial Time 1984 STOC Harel, A General Result on Infinite Trees and Its Applications 1984 STOC Hart & Sharir, Probabilistic Temporal Logics for Finite and Bounded Models 1984 STOC Hennessy, Modelling Fair Processes 1984 STOC Hochbaum & Shmoys, Powers of Graphs: A Powerful Approximation Technique for Bottleneck Problems 1984 STOC Huang, Factorization of Polynomials Over Finite Fields and Factorization of Primes in Algebraic Number Fields 1984 STOC Kahn & Saks, Every Poset Has a Good Comparison 1984 STOC Kannan & Lenstra & Lovasz, Polynomial Factorization and Non-Randomness of Bits of Algebraic and Some Transcendental Numbers 1984 STOC Karmarkar, A New Polynomial-Time Algorithm for Linear Programming 1984 STOC Karp & Luby & Marchetti-Spaccamela, Probabilistic Analysis of Multidimensional Bin Packing Problems 1984 STOC Karp & Wigderson, A Fast Parallel Algorithm for the Maximal Independent Set Problem 1984 STOC Kim & Anderson, Digital Disks and a Digital Compactness Measure 1984 STOC Klawe & Paul & Pippenger & Yannakakis, On Monotone Formulae With Restricted Depth 1984 STOC Kozen, Pebblings, Edgings, and Equational Logic 1984 STOC Leighton, Tight Bounds on the Complexity of Parallel Sorting 1984 STOC Levin, Problems Complete in "Average" Instance 1984 STOC Maass, Quadratic Lower Bounds for Deterministic and Nondeterministic One-Tape Turing Machines 1984 STOC Manber, On Maintaining Dynamic Information in a Concurrent Environment 1984 STOC Miller, Finding Small Simple Cycle Separators for 2-Connected Planar Graphs 1984 STOC Mirzaian, Channel Routing in VLSI 1984 STOC Ong & Schnorr & Shamir, An Efficient Signature Scheme Based on Quadratic Equations 1984 STOC Orlitsky & El Gamal, Communication with Secrecy Constraints 1984 STOC Post, Minimum Spanning Ellipsoids 1984 STOC Sharir & Schorr, On Shortest Paths in Polyhedral Spaces 1984 STOC Sleator & Tarjan, Amortized Efficiency of List Update Rules 1984 STOC Slot & van Emde Boas, On Tape Versus Core: An Application of Space Efficient Perfect Hash Functions to the Invariance of Space 1984 STOC Upfal, A Probabilistic Relation Between Desirable and Feasible Models of Parallel Computation 1984 STOC Valiant, A Theory of the Learnable 1984 STOC Vardi, Automata Theoretic Techniques for Modal Logics of Programs 1984 STOC Vishkin, Randomized Speed-Ups in Parallel Computation 1984 STOC Vitanyi, Distributed Elections in an Archimedean Ring of Processors 1984 STOC Willard, Log-logarithmic Protocols for Resolving Ethernet and Semaphore Conflicts 1983 STOC Adleman, On Breaking Generalized Knapsack Public Key Cryptosystems 1983 STOC Aho & Ullman & Yannakakis, On Notions of Information Transfer in VLSI Circuits 1983 STOC Ajtai & Komlos & Szemeredi, An O(n log n) Sorting Network 1983 STOC Babai & Luks, Canonical Labeling of Graphs 1983 STOC Bach, How To Generate Random Integers with Known Factorization 1983 STOC Baker & Bhatt & Leighton, An Approximation Algorithm for Manhattan Routing 1983 STOC Ben-Or & Chor & Shamir, On the Cryptographic Security of Single RSA Bits 1983 STOC Ben-Or, Lower Bounds for Algebraic Computation Trees 1983 STOC Blum, How To Exchange (Secret) Keys 1983 STOC Borodin & Dolev & Fich & Paul, Bounds for Width Two Branching Programs 1983 STOC Chandra & Fortune & Lipton, Unbounded Fan-in Circuits and Associative Functions 1983 STOC Chandra & Furst & Lipton, Multi-Party Protocols 1983 STOC Dolev & Dwork & Pippenger & Wigderson, Superconcentrators, Generalizers and Generalized Connectors with Limited Depth 1983 STOC Driscoll & Furst, On the Diameter of Permutation Groups 1983 STOC Duris & Galil & Paul & Reischuk, Two Nonlinear Lower Bounds 1983 STOC Dymond & Tompa, Speedups of Deterministic Machines by Synchronous Parallel Machines 1983 STOC Engelfriet, Iterated Pushdown Automata and Complexity Classes 1983 STOC Feldman, A Decidable Propositional Probabilistic Dynamic Logic 1983 STOC Fich, New Bounds for Parallel Prefix Circuits 1983 STOC Frederickson, Data Structures for On-Line Updating of Minimum Spanning Trees 1983 STOC Furer & Schnyder & Specker, Normal Forms for Trivalent Graphs and Graphs of Bounded Valence 1983 STOC Gabow & Tarjan, A Linear-Time Algorithm for a Special Case of Disjoint Set Union 1983 STOC Gabow, An Efficient Reduction Technique for Degree-Constrained Subgraph and Bidirected Network Flow Problems 1983 STOC Gacs, Reliable Computation with Cellular Automata 1983 STOC Goldwasser & Micali & Yao, Strong Signature Schemes 1983 STOC Guibas & Stolfi, Primitives for the Manipulation of General Subdivisions and the Computation of Voronoi Diagrams 1983 STOC Halpern & Rabin, A Logic To Reason about Likelihood 1983 STOC Hartmanis & Sewelson & Immerman, Sparse Sets in NP-P: EXPTIME versus NEXPTIME 1983 STOC Immerman, Languages which Capture Complexity Classes 1983 STOC Iwama, Unique Decomposability of Shuffled Strings: A Formal Treatment of Asynchronous Time-Multiplexed Communication 1983 STOC Kanellakis & Cosmadakis & Vardi, Unary Inclusion Dependencies Have Polynomial Time Inference Problems 1983 STOC Kannan, Alternation and the Power of Nondeterminism 1983 STOC Kannan, Improved Algorithms for Integer Programming and Related Lattice Problems 1983 STOC Kozen, A Probabilistic PDL 1983 STOC Landau & Miller, Solvability by Radicals Is in Polynomial Time 1983 STOC Lenstra, Factoring Multivariate Polynomials over Finite Fields 1983 STOC Long & Wigderson, How Discreet is the Discrete Log? 1983 STOC Meyer auf der Heide, A Polynomial Linear Search Algorithm for the n-Dimensional Knapsack Problem 1983 STOC Myers, The Random Access Hierarchy 1983 STOC O'Dunlaing & Sharir & Yap, Retraction: A New Approach to Motion-Planning 1983 STOC Olderog, A Characterization of Hoare's Logic for Programs with Pascal-Like Procedures 1983 STOC Pnueli, On the Extremely Fair Treatment of Probabilistic Algorithms 1983 STOC Reif & Valiant, A Logarithmic Time Sort for Linear Size Networks 1983 STOC Sipser, A Complexity Theoretic Approach to Randomness 1983 STOC Sipser, Borel Sets and Circuit Complexity 1983 STOC Sleator & Tarjan, Self-Adjusting Binary Trees 1983 STOC Spinrad, Transitive Orientation in O(n^2) Time 1983 STOC Stockmeyer, The Complexity of Approximate Counting 1983 STOC Stout, Topological Matching 1983 STOC Turner, Probabilistic Analysis of Bandwidth Minimization Algorithms 1983 STOC Valiant, Exponential Lower Bounds for Restricted Monotone Circuits 1983 STOC von zur Gathen, Parallel Algorithms for Algebraic Problems 1983 STOC Yao, A 3-Space Partition and its Applications 1983 STOC Young, Some Structural Properties of Polynomial Reducibilities and Sets in NP 1982 STOC Asano & Hirata, Edge-Deletion & Edge-Contraction Problems 1982 STOC Atallah & Kosaraju, Graph Problems on a Mesh-Connected Processor Array 1982 STOC Babai & Grigoriev & Mount, Isomorphism of Graphs with Bounded Eigenvalue Multiplicity 1982 STOC Bach, Fast Algorithms under the Extended Riemann Hypothesis: A Concrete Estimate 1982 STOC Bar-Yehuda & Even, On Approximating a Vertex Cover for Planar Graphs 1982 STOC Bhatt & Leiserson, How To Assemble Tree Machines 1982 STOC Borodin & Hopcroft, Routing, Merging, and Sorting on Parallel Models of Computation 1982 STOC Boyce & Dobkin & Drysdale & Guibas, Finding Extremal Polygons 1982 STOC Carter, The Theory of Signature Testing for VLSI 1982 STOC Cook & Dwork, Bounds on the Time for Parallel RAM's To Compute Simple Functions 1982 STOC de Bakker & Zucker, Denotational Semantics of Concurrency 1982 STOC DeMillo & Lynch & Merritt, Cryptographic Protocols 1982 STOC Dietz, Maintaining Order in a Linked List 1982 STOC Dolev & Strong, Polynomial Algorithms for Multiple Processor Agreement 1982 STOC Duris & Galil, Two Tapes Are Better than One for Nondeterministic Machines 1982 STOC Emerson & Halpern, Decision Procedures and Expressiveness in the Temporal Logic of Branching Time 1982 STOC Feldman & Harel, A Probabilistic Dynamic Logic 1982 STOC Furer, The Tight Deterministic Time Hierarchy 1982 STOC Goldwasser & Micali, Probabilistic Encryption & How To Play Mental Poker Keeping Secret All Partial Information 1982 STOC Greenberg, On the Time Complexity of Broadcast Communication Schemes 1982 STOC Gurevich & Harrington, Trees, Automata, and Games 1982 STOC Hong & Sedgewick, Notes on Merging Networks 1982 STOC Immerman, Relational Queries Computable in Polynomial Time 1982 STOC Inoue & Takanami & Taniguchi, Two-Dimensional Alternating Turing Machines 1982 STOC Kaltofen, A Polynomial Reduction from Multivariate to Bivariate Integral Polynomial Factorization 1982 STOC Kissin, Measuring Energy Consumption in VLSI Circuits: A Foundation 1982 STOC Kosaraju, Decidability of Reachability in Vector Addition Systems 1982 STOC Kurtz, On the Random Oracle Hypothesis 1982 STOC Leighton, A Layout Strategy for VLSI Which Is Provably Good 1982 STOC Manber & Tompa, Probabilistic, Nondeterministic, and Alternating Decision Trees 1982 STOC Mehlhorn & Schmidt, Las Vegas Is Better than Determinism in VLSI and Distributed Computing 1982 STOC Nivat & Perrin, Ensembles Reconnaissables de Mots Biinfinis 1982 STOC Pachl & Korach & Rotem, A Technique for Proving Lower Bounds for Distributed Election Algorithms 1982 STOC Papadimitriou & Sipser, Communication Complexity 1982 STOC Papadimitriou & Yannakakis, The Complexity of Facets (and Some Facets of Complexity) 1982 STOC Pippenger, Probabilistic Simulations 1982 STOC Reif, Symmetric Complementation 1982 STOC Rivest & Shamir, How To Reuse a `Write-Once' Memory 1982 STOC Ruzzo & Simon & Tompa, Space-Bounded Hierarchies and Probabilistic Computations 1982 STOC Sistla & Clarke, The Complexity of Propositional Linear Temporal Logics 1982 STOC Vardi, The Complexity of Relational Query Languages 1982 STOC Vitanyi, Real-Time Simulations of Multicounters by Oblivious One-tape Turing Machines 1982 STOC Widgerson, A New Approximate Graph Coloring Algorithm 1982 STOC Willard, Maintaining Dense Sequential Files in a Dynamic Environment 1982 STOC Yao, Space-Time Tradeoff for Answering Range Queries 1981 STOC Adachi & Iwata & Kasai, Low Level Complexity for Combinatorial Games 1981 STOC Arjomandi & Fischer & Lynch, A Difference in Efficiency Between Synchronous and Asynchronous Systems 1981 STOC Beeri & Fagin & Maier & Mendelzon & Ullman & Yannakakis, Properties of Acyclic Database Schemes 1981 STOC Bertoni & Mauri & Sabadini, A Characterization of the Class of Functions Computable in Polynomial Time on Random Access Machines 1981 STOC Chan, Reversal Complexity of Counter Machines 1981 STOC Chandra & Halpern & Meyer & Parikh, Equations Between Regular Terms and an Application to Process Logic 1981 STOC Chandra & Lewis & Makowsky, Embedded Implicational Dependencies and Their Inference Problem 1981 STOC Chazelle & Monier, Model of Computation for VLSI with Related Complexity Results 1981 STOC Chazelle, Convex Decompositions of Polyhedra 1981 STOC Chew, Unique Normal Forms in Term Rewriting Systems with Repeated Variables 1981 STOC Culik & Harju, The Omega-Sequence Equivalence Problem for D0L Systems Is Decidable 1981 STOC Dolev & Karplus & Strong & Ullman, Optimal Wiring Between Rectangles 1981 STOC Duris & Galil, Fooling a Two-Way Automaton or One Pushdown Store Is Better than One Counter for Two-Way Machines 1981 STOC Fich, Lower Bounds for the Cycle Detection Problem 1981 STOC Galil & Paul, An Efficient General-Purpose Parallel Computer 1981 STOC Galil & Seiferas, Time-Space-Optimal String Matching 1981 STOC Gonnet & Munro, A Linear Probing Sort and Its Analysis 1981 STOC Hawrusik & Venkataraman & Yasuhara, Classes of Functions for Computing on Binary Trees 1981 STOC Hong & Kung, I/O Complexity: The Red-Blue Pebble Game 1981 STOC Hong & Rosenberg, Graphs That Are Almost Binary Trees 1981 STOC Joseph & Young, Fast Programs for Initial Segments and Polynomial Time Computation in Weak Models of Arithmetic 1981 STOC Kim & Rosenfeld, Digital Straightness and Convexity 1981 STOC King, Measures of Parallelism in Alternating Computation Trees 1981 STOC Kleitman & Leighton & Lepley & Miller, New Layouts for the Shuffle-Exchange Graph 1981 STOC Kosaraju, Localized Search in Sorted Lists 1981 STOC Krishnamurthy & Moll, Examples of Hard Tautologies in the Propositional Calculus 1981 STOC Leivant, The Complexity of Parameter Passing in Polymorphic Procedures 1981 STOC Lipton & Sedgewick, Lower Bounds for VLSI 1981 STOC Mayr, An Algorithm for the General Petri Net Reachability Problem 1981 STOC Monien & Sudborough, Bandwidth-Constrained NP-Complete Problems 1981 STOC Muller & Schupp, Pushdown Automata, Graphs, Ends, Second-Order Logic, and Reachability Problems 1981 STOC Orlin, The Complexity of Dynamic Languages and Dynamic Optimization Problems 1981 STOC Parisi-Presicce, On the Faithful Regular Extensions of Iterative Algebras 1981 STOC Paterson & Ruzzo & Snyder, Bounds on Minimax Edge Length for Complete Binary Trees 1981 STOC Reif & Spirakis, Distributed Algorithms for Synchronizing Interprocess Communication Within Real Time 1981 STOC Simon, Space-Bounded Probabilistic Turing Machine Complexity Classes Are Closed Under Complement 1981 STOC Sleator & Tarjan, A Data Structure for Dynamic Trees 1981 STOC Streett, Propositional Dynamic Logic of Looping and Converse 1981 STOC Ukkonen & Soisalon-Soininen, LALR(k) Testing is PSPACE-Complete 1981 STOC Valiant & Brebner, Universal Schemes for Parallel Communication 1981 STOC Yannakakis, Issues of Correctness in Database Concurrency Control by Locking 1981 STOC Yao, On the Parallel Computation for the Knapsack Problem 1981 STOC Yao, The Entropic Limitations on VLSI Computations 1980 STOC Angluin, Local and Global Properties in Networks of Processors 1980 STOC Bloniarz, A Shortest-Path Algorithm with Expected Time O(n^2 log n log* n) 1980 STOC Borodin & Cook, A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation 1980 STOC Brent & Kung, The Chip Complexity of Binary Arithmetic 1980 STOC Brown, Kraft Storage and Access for List Implementations 1980 STOC Carlson & Savage, Graph Pebbling with Many Free Pebbles Can Be Difficult 1980 STOC Chazelle & Dobkin, Detection Is Easier than Computation 1980 STOC Cypher, An Approach to the K Paths Problem 1980 STOC DeMillo & Lipton, The Consistency of "P=NP" and Related Problems with Fragments of Number Theory 1980 STOC Ehrig & Mahr, Complexity of Implementations on the Level of Algebraic Specifications 1980 STOC Fagin, Horn Clauses and Database Dependencies 1980 STOC Filotti & Mayer, A Polynomial-time Algorithm for Determining the Isomorphism of Graphs of Fixed Genus 1980 STOC Fischer & Paterson, Optimal Tree Layout 1980 STOC Frederickson & Johnson, Generalized Selection and Ranking 1980 STOC Guibas & Yao, On Translating a Set of Rectangles 1980 STOC Heintz & Schnorr, Testing Polynomials Which Are Easy To Compute 1980 STOC Hoffmann, Testing Isomorphism of Cone Graphs 1980 STOC Hong, On Some Deterministic Space Complexity Problems 1980 STOC Ibarra & Leininger, The Complexity of the Equivalence Problem for Straight-Line Programs 1980 STOC Ja'Ja', Time-Space Tradeoffs for Some Algebraic Problems 1980 STOC Joseph & Young, Independence Results in Computer Science? 1980 STOC Kannan & Lipton, The Orbit Problem Is Decidable 1980 STOC Karp & Lipton, Some Connections Between Nonuniform and Uniform Complexity Classes 1980 STOC Karp & Tarjan, Linear Expected-Time Algorithms for Connectivity Problems 1980 STOC Lichtenstein, Isomorphism for Graphs Embeddable on the Projective Plane 1980 STOC Lloyd, Critical Path Scheduling of Task Systems with Resource and Processor Constraints 1980 STOC Lynch, Fast Allocation of Nearby Resources in a Distributed System 1980 STOC Meyer & Parikh, Definability in Dynamic Logic 1980 STOC Miller, Isomorphism Testing for Graphs of Bounded Genus 1980 STOC Mirkowska, Complete Axiomatization of Algorithmic Properties of Program Schemes with Bounded Nondeterministic Interpretations 1980 STOC Overmars & van Leeuwen, Dynamically Maintaining Configurations in the Plane 1980 STOC Paul & Seiferas & Simon, An Information-Theoretic Approach to Time Bounds for On-Line Computation 1980 STOC Pippenger, Comparative Schematology and Pebbling with Auxiliary Pushdowns 1980 STOC Plaisted, On the Distribution of Independent Formulae of Number Theory 1980 STOC Pratt, Dynamic Algebras and the Nature of Induction 1980 STOC Reif & Spirakis, Random Matroids 1980 STOC Reif, Logics for Probabilistic Programming 1980 STOC Sadri & Ullman, A Complete Axiomatization for a Large Class of Dependencies in Relational Databases 1980 STOC Storer, The Node Cost Measure for Embedding Graphs on the Planar Grid 1980 STOC Strong, Vector Execution of Flow Graphs 1980 STOC Supowit & Plaisted & Reingold, Heuristics for Weighted Perfect Matching 1980 STOC Tompa, An Optimal Solution to a Wire-Routing Problem 1980 STOC Tompa, Two Familiar Transitive Closure Algorithms which Admit No Polynomial Time, Sublinear Space Implementations 1980 STOC Toueg, Deadlock- and Livelock-Free Packet Switching Networks 1980 STOC Ukkonen, A Decision Method for the Equivalence of Some Non-Real-Time Deterministic Pushdown Automata 1980 STOC Yao, Efficient Dynamic Programming Using Quadrangle Inequalities 1980 STOC Yap, Space-time Tradeoffs and First Order Problems in a Model of Programs 1979 STOC Angluin, Finding Patterns Common to a Set of Strings 1979 STOC Beeri & Mendelzon & Sagiv & Ullman, Equivalence of Relational Database Schemes 1979 STOC Berman, A Completeness Technique for D-Axiomatizable Semantics 1979 STOC Chandra & Harel, Computable Queries for Relational Data Bases 1979 STOC Chazelle & Dobkin, Decomposing a Polygon into Its Convex Parts 1979 STOC Cook, Deterministic CFL's Are Accepted Simultaneously in Polynomial Time and Log Squared Space 1979 STOC DeMillo & Lipton, Some Connections between Mathematical Logic and Complexity Theory 1979 STOC Fillotti & Miller & Reif, On Determining the Genus of a Graph in O(v^O(g)) Steps 1979 STOC Flajolet & Francon & Vuillemin, Computing Integrated Costs of Sequences of Operations 1979 STOC Fredman, A Near Optimal Data Structure for a Type of Range Query Problem 1979 STOC Galil & Naamad, Network Flow and Generalized Path Compression 1979 STOC Gilbert & Lengauer & Tarjan, The Pebbling Problem Is Complete in Polynomial Space 1979 STOC Gurari & Ibarra, The Complexity of the Equivalence Problem for Counter Machines, Semilinear Sets and Simple Programs 1979 STOC Ja'Ja', On the Complexity of Bilinear Forms with Commutativity 1979 STOC Kosaraju, Fast Parallel Processing Array Algorithms for Some Graph Problems 1979 STOC Kosaraju, On a Multidimensional Search Problem 1979 STOC Kosaraju, Real-time Simulation of Concatenable Double-ended Queues by Double-ended Queues 1979 STOC Ladner, The Complexity of Problems in Systems of Communicating Sequential Processes 1979 STOC Lengauer & Tarjan, Upper and Lower Bounds on Time-Space Tradeoffs 1979 STOC Long, On Gamma-Reducibility Versus Polynomial Time Many-One Reducibility 1979 STOC Maier, Minimum Covers in the Relational Database Model 1979 STOC Meyer & Winklmann, On the Expressive Power of Dynamic Logic 1979 STOC Munro & Suwanda, Implicit Data Structures 1979 STOC O'Donnell, A Programming Language Theorem Which Is Independent of Peano Arithmetic 1979 STOC Peterson, Time-Space Trade-Offs for Asynchronous Parallel Models--Reducibilities and Equivalences 1979 STOC Reif, Universal Games of Incomplete Information 1979 STOC Rosenberg & Wood & Galil, Storage Representations for Tree-Like Data Structures 1979 STOC Ruzzo, Tree-Size Bounded Alternation 1979 STOC Sedgewick & Szymanski, The Complexity of Finding Periods 1979 STOC Shamir, On the Cryptocomplexity of Knapsack Systems 1979 STOC Sipser, Lower Bounds on the Size of Sweeping Automata 1979 STOC Thompson, Area-Time Complexity for VLSI 1979 STOC Toueg & Ullman, Deadlock-Free Packet Switching Networks 1979 STOC Valdes & Tarjan & Lawler, The Recognition of Series Parallel Digraphs 1979 STOC Valiant, Completeness Classes in Algebra 1979 STOC Valiant, Negation Can Be Exponentially Powerful 1979 STOC Yao, Some Complexity Questions Related to Distributive Computing 1978 STOC Baudet, An Analysis of the Full Alpha-Beta Pruning Algorithm 1978 STOC Brown & Tarjan, A Representation for Linear Lists with Movable Fingers 1978 STOC Bruss & Meyer, On Time-Space Classes and Their Relation to the Theory of Real Addition 1978 STOC Carter & Floyd & Gill & Markovsky & Wegman, Exact and Approximate Membership Testers 1978 STOC Case & Smith, Anomaly Hierarchies of Mechanized Inductive Inference 1978 STOC Data Type Specification: Parameterization and the Power of Specification Techniques 1978 STOC Dowd, Propositional Representation of Arithmetic Proofs 1978 STOC Engelfriet & Rozenberg & Slutzki, Tree Transducers, L Systems and Two-Way Machines 1978 STOC Filotti, An Efficient Algorithm for Determining Whether a Cubic Graph is Toroidal 1978 STOC Fortune & Wyllie, Parallelism in Random Access Machines 1978 STOC Gabow & Kariv, Algorithms for Edge Coloring Bipartite Graphs 1978 STOC Goldschlager, A Unified Approach to Models of Synchronous Parallel Machines 1978 STOC Gurari & Ibarra, An NP-Complete Number-Theoretic Problem 1978 STOC Hyafil, On the Parallel Evaluation of Multi-Variate Polynomials 1978 STOC Ja'Ja', Optimal Evaluation of Pairs of Bilinear Forms 1978 STOC Katseff, A New Solution to the Critical Section Problem 1978 STOC Kirkpatrick & Hell, On the Completeness of a Generalized Matching Problem 1978 STOC Kleitman & Meyer & Rivest & Spencer & Winklmann, Coping with Errors in Binary Search Procedures 1978 STOC Kozen, Indexing of Subrecursive Classes 1978 STOC LaPaugh & Rivest, The Subgraph Homeomorphism Problem 1978 STOC Lewis, On the Complexity of the Maximum Subgraph Problem 1978 STOC Lueker, Maximization Problems on Graphs with Edge Weights Chosen from a Normal Distribution 1978 STOC Lynch, Straight-Line Program Lenght as a Parameter for Complexity Measures 1978 STOC Megiddo, Combinatorial Optimization with Rational Objective Functions 1978 STOC Miller & Yap, On Formulating Simultaneity for Studying Parallelism and Synchronization 1978 STOC Miller, On the n^{log n} Isomorphism Technique 1978 STOC Pan, Computational Complexity of Computing Polynomials Over the Field of Real and Complex Numbers 1978 STOC Pratt, A Practical Decision Method for Propositional Dynamic Logic 1978 STOC Rackoff, Relativized Questions Involving Probabilistic Algorithms 1978 STOC Raoult & Vuillemin, Operational and Semantic Equivalence Between Recursive Programs 1978 STOC Reddy & Loveland, Presburger Arithmetic with Bounded Quantifier Alternation 1978 STOC Sakoda & Sipser, Nondeterminism and the Size of Two Way Finite Automata 1978 STOC Schaefer, The Complexity of Satisfiability Problems 1978 STOC Sciore & Tang, Computability Theory in Admissible Domains 1978 STOC Storer & Szymanski, The Macro Model for Data Compression 1978 STOC Tompa, Time-Space Tradeoffs for Computing Functions, Using Connectivity Properties of Their Circuits 1978 STOC Wegener, Switching Functions Whose Monotone Complexity Is Nearly Quadratic 1978 STOC Yannakakis, Node- and Edge-Deletion NP-Complete Problems 1977 STOC Adleman & Manders, Reducibility, Randomness, and Intractibility 1977 STOC Angluin & Valiant, Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings 1977 STOC Beatty, Iteration Theorems for LL(k) Languages 1977 STOC Brown, The Complexity of Priority Queue Maintenance 1977 STOC Carter & Wegman, Universal Classes of Hash Functions 1977 STOC Chandra & Merlin, Optimal Implementation of Conjunctive Queries in Relational Data Bases 1977 STOC Constable, On the Theory of Programming Logics 1977 STOC Fischer & Ladner, Propositional Modal Logic of Programs 1977 STOC Gonnet & Munro, The Analysis of an Improved Hashing Technique 1977 STOC Guibas & McCreight & Plass & Roberts, A New Representation for Linear Lists 1977 STOC Harel & Meyer & Pratt, Computability and Completeness in Logics of Programs 1977 STOC Harel & Pnueli & Stavi, A Complete Axiomatic System for Proving Deductions about Recursive Programs 1977 STOC Hartmanis, Relations Between Diagonalization, Proof Systems and Complexity Gaps 1977 STOC Hennessy & Ashcroft, Parameter-Passing Mechanisms and Nondeterminism 1977 STOC Itai & Rodeh, Finding a Minimum Circuit in a Graph 1977 STOC Kintala & Fischer, Computations with a Restricted Number of Nondeterministic Steps 1977 STOC Kozen, Complexity of Finitely Presented Algebras 1977 STOC Leong & Seiferas, New Real-Time Simulations of Multihead Tape Units 1977 STOC Lynch & Blum, Efficient Reducibility Between Programming Systems: Preliminary Report 1977 STOC Miller, Graph Isomorphism, General Remarks 1977 STOC O'Donnell, Subtree Replacement Systems: A Unifying Theory for Recursive Equations, LISP, Lucid and Combinatory Logic 1977 STOC Paul, On Time Hierarchies 1977 STOC Peterson & Fischer, Economical Solutions to the Critical Section Problem in a Distributed System 1977 STOC Prabhala & Sethi, A Comparison of Instruction Sets for Stack Machines 1977 STOC Rosenthal, Nonserial Dynamic Programming Is Optimal 1977 STOC Sacerdote & Tenney, The Decidability of the Reachability Problem for Vector Addition Systems 1977 STOC Simon & Gill, Polynomial Reducibilities and Upward Diagonalizations 1977 STOC Simon, On Feasible Numbers 1977 STOC Sudborough, Separating Tape Bounded Auxiliary Pushdown Automata Classes 1977 STOC Tarjan, Reference Machines Require Non-Linear Time To Maintain Disjoint Sets 1977 STOC Yao & Avis & Rivest, An Omega(n^2 log n) Lower Bound to the Shortest Paths Problem 1976 STOC Bentley & Shamos, Divide-and-Conquer in Multidimensional Space 1976 STOC Burkhard, Associative Retrieval Trie Hash-Coding 1976 STOC Cardoza & Lipton & Meyer, Exponential Space Complete Problems for Petri Nets and Commutative Subgroups 1976 STOC Doeppner, On Abstractions of Parallel Programs 1976 STOC Fong & Ullman, Finding the Depth of a Flow Graph 1976 STOC Galil, Real-Time Algorithms for String-Matching and Palindrome Recognition 1976 STOC Garey & Graham & Johnson, Some NP-Complete Geometric Problems 1976 STOC Graham & Harrison & Ruzzo, On Line Context Free Language Recognition in Less than Cubic Time 1976 STOC Guibas & Szemeredi, The Analysis of Double Hashing 1976 STOC Hartmanis & Berman, On Isomorphisms and Density of NP and Other Complete Sets 1976 STOC Hirshberg, Parallel Algorithms for the Transitive Closure and the Connected Component Problems 1976 STOC Hunt & Szymanski, Dichotomization, Reachability, and the Forbidden Subgraph Problem 1976 STOC Ibarra & Kim, A Useful Device for Showing the Solvability of Some Decision Problems 1976 STOC Kimura, An Algebraic System for Process Structuring and Interprocess Communication 1976 STOC Kosaraju, On Structuring Flowcharts 1976 STOC Lee & Preparata, Location of a Point in a Planar Subdivision and its Applications 1976 STOC Lipton & Stockmeyer, Evaluation of Polynomials with Super-Preconditioning 1976 STOC Machtey & Young, Simple Goedel Numberings, Translations, and the P-Hierarchy: Preliminary Report 1976 STOC Manders & Adleman, NP-Complete Decision Problems for Quadratic Polynomials 1976 STOC Owicki, A Consistent and Complete Deductive System for the Verification of Parallel Programs 1976 STOC Papadimitriou & Steiglitz, Some Complexity Results for the Traveling Salesman Problem 1976 STOC Paterson & Wegman, Linear Unification 1976 STOC Paul & Tarjan & Celoni, Space Bounds for a Game on Graphs 1976 STOC Pippenger, The Realization of Monotone Boolean Functions 1976 STOC Schaefer, Complexity of Decision Problems Based on Finite Two-Person Perfect-Information Games 1976 STOC Sudborough, On Deterministic Context-Free Languages, Multihead Automata, and the Power of an Auxiliary Pushdown Store 1976 STOC Thompson & Kung, Sorting on a Mesh-Connected Parallel Computer 1976 STOC Valiant, Universal Circuits 1976 STOC Wand, A New Incompleteness Result for Hoare's System 1976 STOC Yao, On the Average Behavior of Set Merging Algorithms 1975 STOC Aho & Johnson, Optimal Code Generation for Expression Trees 1975 STOC Aho & Ullman, Node Listings for Reducible Flow Graphs 1975 STOC Cook & Oppen, Proving Assertions about Programs That Manipulate Data Structures 1975 STOC Cook, Feasibly Constructive Proofs and the Propositional Calculus 1975 STOC De Millo & Eisenstat & Lipton, The Complexity of Control Structures and Data Structures 1975 STOC Dobkin & Lipton, Complexity Measures and Hierarchies for the Evaluation of Integers, Polynomials, and N-Linear Forms 1975 STOC Egli & Constable, Computability Concepts for Programming Language Semantics 1975 STOC Ehrenfeucht & Rozenberg, On (Un)Predictability of Formal Languages 1975 STOC Ehrenfeucht & Rozenberg, On the (Combinatorial) Structure of L Languages Without Interactions 1975 STOC Even & Tarjan, A Combinatorial Problem Which Is Complete in Polynomial Space 1975 STOC Fischer & Meyer & Paterson, Lower Bounds on the Size of Boolean Formulas 1975 STOC Fredman, Two Applications of a Probabilistic Search Technique: Sorting X + Y and Building Balanced Search Trees 1975 STOC Galil, On the Validity and Complexity of Bounded Resolution 1975 STOC Ginsburg & Lynch, Comparative Complexity of Grammar Forms 1975 STOC Hunt & Szymanski, On the Complexity of Grammar and Related Problems 1975 STOC Hyafil & Kung, The Complexity of Parallel Evaluation of Linear Recurrences 1975 STOC Lueker & Booth, Linear Algorithms To Recognize Interval Graphs and Test for the Consecutive Ones Property 1975 STOC Manna & Shamir, The Optimal Fixedpoint of Recursive Programs 1975 STOC Miller, Riemann's Hypothesis and Tests for Primality 1975 STOC Paul, A 2.5 N-Lower Bound for the Combinational Complexity of Boolean Functions 1975 STOC Perrault, Intercalation Lemmas for Tree Transducer Languages 1975 STOC Pratt, Four Models for the Analysis and Optimization of Program Control Structures 1975 STOC Rivest & Vuillemin, A Generalization and Proof of the Aanderaa-Rosenberg Conjecture 1975 STOC Rose & Tarjan, Algorithmic Aspects of Vertex Elimination 1975 STOC Rosenberg & Stockmeyer, Hashing Schemes for Extendible Arrays 1975 STOC Shamos, Geometric Complexity 1975 STOC Skyum, On Decomposing Languages Defined by Parallel Devices 1975 STOC Valiant, On Non-Linear Lower Bounds in Computational Complexity 1975 STOC Wagner, On the Complexity of the Extended String-to-String Correction Problem 1975 STOC Wotschke, Degree-Languages, Polynomial Time Recognition, and the LBA Problem 1975 STOC Yao, On Computing the Minima of Quadratic Forms 1974 STOC Book & Nivat & Paterson, Intersections of Linear Context-Free Languages and Reversal-Bounded Multipushdown Machines 1974 STOC Borodin & Cook, On the Number of Additions To Compute Specific Polynomials 1974 STOC Chandra, Degrees of Translatability and Canonical Forms in Program Schemas: Part I 1974 STOC Cook & Reckhow, On the Lengths of Proofs in the Propositional Calculus 1974 STOC Cook & Sethi, Storage Requirements for Deterministic Polynomial Time Recognizable Languages 1974 STOC Courcelle & Vuillemin, Semantics and Axiomatics of a Simple Recursive Language 1974 STOC Dobkin & Lipton, On Some Generalizations of Binary Search 1974 STOC Ehrenfeucht & Zeiger, Complexity Measures for Regular Expressions 1974 STOC Garey & Johnson & Stockmeyer, Some Simplified NP-Complete Problems 1974 STOC Gill, Computational Complexity of Probabilistic Turing Machines 1974 STOC Greibach, Some Restrictions on W-Grammars 1974 STOC Hammer, A New Grammatical Transformation into LL(k) Form 1974 STOC Hopcroft & Wong, Linear Time Algorithm for Isomorphism of Planar Graphs 1974 STOC Horvath, Some Efficient Stable Sorting Algorithms 1974 STOC Hunt & Rosenkrantz, Computational Parallels Between the Regular and Context-Free Languages 1974 STOC Hyafil & Prusker & Vuillemin, An Efficient Algorithm for Computing Optimal Disk Merge Patterns 1974 STOC Jones & Laaser, Complete Problems for Deterministic Polynomial Time 1974 STOC Kedem, Combining Dimensionality and Rate of Growth Arguments for Establishing Lower Bounds on the Number of Multiplications 1974 STOC Kirkpatrick, Determining Graph Properties from Matrix Representations 1974 STOC Kung, Some Complexity Bounds for Parallel Computation 1974 STOC Ladner & Lynch & Selman, Comparison of Polynomial-Time Reducibilities 1974 STOC Lipton, Limitations of Synchronization Primitives with Conditional Branching and Global Variables 1974 STOC Mehlhorn, Polynomial and Abstract Subrecursive Classes 1974 STOC Millen, Construction with Parallel Derivatives of the Closure of a Parallel Program Schema 1974 STOC Miller, Computational Complexity and Numerical Stability 1974 STOC Pratt & Rabin & Stockmeyer, A Characterization of the Power of Vector Machines 1974 STOC Pratt, The Power of Negative Thinking in Multiplying Boolean Matrices 1974 STOC Rackoff, On the Complexity of the Theories of Weak Direct Products 1974 STOC Robertson, Structure of Complexity in the Weak Monadic Second-Order Theories of the Natural Numbers 1974 STOC Rosenberg, Managing Storage for Extendible Arrays 1974 STOC Seiferas, Observations on Nondeterministic Multidimensional Iterative Arrays 1974 STOC Tarjan, Testing Graph Connectivity 1974 STOC Vairavan & DeMillo, Parallel Scheduling of Programs in a Restricted Model of Computation 1974 STOC Valiant, The Decidability of Equivalence for Deterministic Finite-Turn Pushdown Automata 1974 STOC van Leeuwen, A Partial Solution to the Reachability-Problem for Vector-Addition Systems 1973 STOC Aho & Hopcroft & Ullman, On Finding Lowest Common Ancestors in Trees 1973 STOC Baker, Tree Transductions and Families of Tree Languages 1973 STOC Brockett & Dobkin, On the Optimal Evaluation of a Set of Bilinear Forms 1973 STOC Constable, Type Two Computational Complexity 1973 STOC Cook, An Observation of Time-Storage Trade Off 1973 STOC Eilenberg, Classes of Semigroups and Classes of Sets 1973 STOC Fischer & Stockmeyer, Fast On-Line Integer Multiplication 1973 STOC Gentleman & Johnson, Analysis of Algorithms, A Case Study: Determinants of Polynomials 1973 STOC Greibach, Jump PDA's, Deterministic Context-Free Languages, Principal AFDL's and Polynomial Time Recognition 1973 STOC Hopcroft & Musinski, Duality in Determining the Complexity of Noncommutative Matrix Multiplication 1973 STOC Hunt, On the Time and Tape Complexity of Languages I 1973 STOC Johnson, Approximation Algorithms for Combinatorial Problems 1973 STOC Kosaraju, Analysis of Structured Programs 1973 STOC Kung, The Computational Complexity of Algebraic Numbers 1973 STOC Ladner, Polynomial Time Reducibility 1973 STOC Lewis & Rosenkrantz & Stearns, Attributed Translations 1973 STOC Lynch & Meyer & Fischer, Sets That Don't Help 1973 STOC Meyer & Stockmeyer, Word Problems Requiring Exponential Time 1973 STOC Miller, Towards Mechanical Verification of Properties of Roundoff Error Propagation 1973 STOC Moenck, Fast Computation of GCD's 1973 STOC Oppen, Elementary Bounds for Presburger Arithmetic 1973 STOC Pager, The Lane Tracing Algorithm for Constructing LR(k) Parsers 1973 STOC Pratt, Computing Permutations with Double-Ended Queues, Parallel Stacks, and Parallel Queues 1973 STOC Sethi, Complete Register Allocation Problems 1973 STOC Tarjan, Testing Flow Graph Reducibility 1973 STOC Teitelbaum, Context-Free Error Correction by Evaluation of Algebraic Power Series 1973 STOC Vuillemin, Correct and Optimal Implementations of Recursion in a Simple Programming Language 1973 STOC Wagner, From Algebras to Programming Languages 1973 STOC Wand, An Unusual Application of Program-Proving 1973 STOC Weiner & Savage & Bagchi, Neighborhood Search Algorithms for Finding Optimal Traveling Salesman Tours 1972 STOC Aho & Ullman, A Technique for Speeding Up LR(k) Parsers 1972 STOC Blum & Floyd & Pratt & Rivest & Tarjan, Linear Time Bounds for Median Computations 1972 STOC Carlyle-Greibach & Ginsburg & Goldstine, Uniformly Erasable AFL 1972 STOC Chandra & Manna, Program Schemas with Equality 1972 STOC Constable & Muchnick, Subrecursive Program Schemata I and II 1972 STOC Cook & Reckhow, Time-Bounded Random Access Machines 1972 STOC Cook, A Hierarchy for Nondeterministic Time Complexity 1972 STOC Fiduccia, Polynomial Evaluation via the Division Algorithm: The Fast Fourier Transform Revisited 1972 STOC Garey & Graham & Ullman, Worst-Case Analysis of Memory Allocation Algorithms 1972 STOC Garland & Luckham, On the Equivalence of Schemes 1972 STOC Hamlet, A Patent Problem for Abstract Programming Languages: Machine-Independent Computations 1972 STOC Hecht & Ullman, Flow Graph Reducibility 1972 STOC Horowitz, Algorithms for Rational Function Arithmetic Operations 1972 STOC Jones & Selman, Turing Machines and the Spectra of First-Order Formulas with Equality 1972 STOC Karp & Miller & Rosenberg, Rapid Identification of Repeated Patterns in Strings, Trees, and Arrays 1972 STOC Kirkpatrick, On the Additions Necessary To Compute Certain Functions 1972 STOC Kung, A Bound on the Multiplication Efficiency of Iteration 1972 STOC Lindenmayer & Rozenberg, Developmental Systems and Languages 1972 STOC Meyer & Bagchi, Program Size and Economy of Descriptions 1972 STOC Morris, Recursion Schemes with Lists 1972 STOC Nievergelt & Reingold, Binary Search Trees of Bounded Balance 1972 STOC Ogden & Rounds, Compositions of n Tree Transducers 1972 STOC Plaisted, Flowchart Schemata with Counters 1972 STOC Savitch, Maze Recognizing Automata 1972 STOC Schnorr, Process Complexity and Effective Random Tests 1972 STOC Sethi, Validating Register Allocations for Straight Line Programs 1972 STOC Symes, The Computation of Finite Functions 1972 STOC Walker & Strong, Characterizations of Flowchartable Recursions 1972 STOC Warkentin & Fischer, Predecessor Machines and Regressing Functions 1971 STOC Aho & Ullman, The Care and Feeding of LR(k) Grammars 1971 STOC Berry, Block Structure: Retention or Deletion? 1971 STOC Boasson, An Iteration Theorem for One-Counter Languages 1971 STOC Buttelmann, On Generalized Finite Automata and Unrestricted Generative Grammars 1971 STOC Chang, On the Parallel Computation of Local Operations 1971 STOC Constable & Hartmanis, Complexity of Formal Translations and Speed-Up Results 1971 STOC Constable, Loop Schemata 1971 STOC Cook, The Complexity of Theorem-Proving Procedures 1971 STOC Fiduccia, Fast Matrix Multiplication 1971 STOC Ginsburg & Goldstine, Intersection-Closed Full AFL and the Recursively Enumerable Languages 1971 STOC Levy & Joshi, Some Results in Tree Automata 1971 STOC Machtey, Classification of Computable Functions by Primitive Recursive Classes 1971 STOC McNaughton, A Decision Procedure for Generalized Sequential Mapability-onto of Regular Sets 1971 STOC Meyers, Linear Representation of Tree Structure 1971 STOC Munro, Some Results Concerning Efficient and Optimal Algorithms 1971 STOC Rabin, Proving Simultaneous Positivity of Linear Forms--Invited Address--No written paper prepared 1971 STOC Rajlick, Absolutely Parallel Grammars and Two Way Deterministic Finite-State Transducers 1971 STOC Robertson, Complexity Classes of Partial Recursive Functions 1971 STOC Rosenberg, Addressable Data Graphs 1971 STOC Santos, Algebraic Structure Theory of Stochastic Machines 1971 STOC Stanat, Formal Languages and Power Series 1971 STOC Terrine, An Algorithm Generating the Decision Table of a Deterministic Bottom-Up Parser for a Subset of Context Free Grammars 1971 STOC Wagner, An Algebraic Theory of Recursive Definitions and Recursive Languages 1971 STOC Wise, Domolki's Algorithm Applied to Generalized Overlap 1970 STOC Aho & Ullman, Transformations on Straight Line Programs 1970 STOC Ausiello, On Bounds on the Number of Steps To Compute Functions 1970 STOC Bass & Young, Hierarchies Based on Computational Complexity and Irregularities of Class Determined Measured Sets 1970 STOC Book & Greibach & Wegbreit, Tape- and Time-Bounded Turing Acceptors and AFL's 1970 STOC Burkhard, Complexity Problems in Real Time Computation 1970 STOC Chang, The Analysis and Synthesis of Two-Dimensional Patterns Using Picture-Processing Grammars 1970 STOC Constable, On the Size of Programs in Subrecursive Formalisms 1970 STOC Cook, Path Systems and Language Recognition 1970 STOC Cudia, The Degree Hierarchy of Undecidable Problems of Formal Grammars 1970 STOC Ellis, Probabilistic Languages and Automata 1970 STOC Johansen, A Standard Form for Strongly Connected Regular Events 1970 STOC King & Floyd, Interpretation Oriented Theorem Prover Over Integers 1970 STOC Landin, Computing with Algebras 1970 STOC Landweber & Robertson, Recursive Properties of Abstract Complexity Classes 1970 STOC Lewis, Closure of Families of Languages Under Substitution Operators 1970 STOC Lewis, Decision Problems for Complexity Classes of Computable Functions 1970 STOC Lindstrom, The Design of Parsers for Incremental Language Translators 1970 STOC Manna, Second Order Mathematical Theory of Computation 1970 STOC Martin & Vere, On Syntax-Directed Transduction and Tree Transducers 1970 STOC McGowan, The Correctness of a Modified SECD Machine 1970 STOC Morris, A Result on the Relationship Between Simple Precedence Languages and Reducing Transition Languages 1970 STOC Nivat, On Some Families of Languages Related to the Dyck Language 1970 STOC Pager, A Solution to an Open Problem by Knuth (not received in time for printing) 1970 STOC Perrot, On the Relationship Between Finite Automata, Finite Monoids, and Prefix Codes 1970 STOC Reiter, The Predicate Elimination Strategy in Theorem-Proving 1970 STOC Rosen, Tree-Manipulating Systems and Church-Rosser Theorems 1970 STOC Rosenberg, Data Graphs and Addressing Schemes 1970 STOC Rounds, Tree-oriented Proofs of Some Theorems on Context-free and Indexed Languages 1970 STOC Strong, Translating Recursion Equations into Flow Charts 1970 STOC Ullian, Three Theorems on AFL's 1969 STOC Aho & Ullman, Translations on a Context Free Grammar 1969 STOC Amoroso & Lieblein & Yamada, A Unifying Framework for the Theory of Iterative Arrays of Machines 1969 STOC Avizienis, On the Problem of Computational Complexity of Arithmetic Functions 1969 STOC Basu, On Classes of Computable Functions 1969 STOC Blum, On Effective Procedures for Speeding Up Algorithms 1969 STOC Blum, Towards a Theory of Semantics and Compilers for Programming Languages 1969 STOC Book & Greibach, Quasi Realtime Languages 1969 STOC Borodin, Complexity Classes of Recursive Functions and the Existence of Complexity Gaps 1969 STOC Chandler, Abstract Families of Deterministic Languages 1969 STOC Cole, Pushdown Store Machines and Real-Time Computation 1969 STOC Cook, Variations on Pushdown Machines 1969 STOC Fischer, Some Properties of Precedence Languages 1969 STOC Herman & Isard, Computability over Arbitrary Fields 1969 STOC Hodes, The Logical Complexity of Geometric Properties in the Plane 1969 STOC Johansen, Free Groups and Regular Expressions 1969 STOC Korenjak, Efficient LR(1) Processor Construction 1969 STOC Loveland, On Minimal Program Complexity Measures 1969 STOC Manna & Pnueli, Formalization of Properties of Recursively Defined Functions 1969 STOC McCreight & Meyer, Classes of Computable Functions Defined by Bounds on Computation 1969 STOC Ogden, Intercalation Theorems for Stack Languages 1969 STOC Peters & Ritchie, Context Sensitive Immediate Constituent Analysis--Context Free Languages Revisited 1969 STOC Rose, Abstract Families of Processors 1969 STOC Rosenkrantz & Stearns, Properties of Deterministic Top Down Grammars 1969 STOC Rounds, Context Free Grammars on Trees 1969 STOC Savitch, Deterministic Simulation of Nondeterministic Turing Machines 1969 STOC Shepard, Languages in General Algebras 1969 STOC Spira, On the Computation Time of Certain Classes of Boolean Functions 1969 STOC Thatcher, Transformations and Translations from the Point of View of Generalized Finite Automata Theory 1969 STOC Ullian, The Inherent Ambiguity Partial Algorithm Problem for Context Free Languages 1969 STOC Young, Speed-Ups by Changing the Order in Which Sets Are Enumerated 1969 STOC Zeiger, Formal Models for Some Standard Features of Programming Languages 1987 20 STOCHASTICS Rosenkrantz, Approximate Counting: A Martingale Approach 1990 36 STOCHPA Coffman & Flatto & Leighton, First-Fit Allocation of Queues: Tight Probabilistic Bounds on Wasted Space 1990 35 STOCHPA Gantert, Laws of Large Numbers for the Annealing Algorithm 1990 35 STOCHPA Klein Haneveld & Pittenger, Escape Time for a Random Walk from an Orthant 1957 5 STROJEZI Svoboda, Rational Numerical System of Residual Classes 1956 4 STROJEZI Valach, The Translation of Numbers from the System of Remainder Classes to a Polyadic System by Change of Scale of Period (Czech) 1955 3 STROJEZI Valach, Origin of the Code and Number System of Remainder Classes (Czech) 1955 3 STROJEZI Svoboda & Valach, Operational Circuits (Czech) 1955 3 STROJEZI Svoboda, Single Impulse Time Dyadic Relay Adders (Czech) 1988 1 SUGAKU Takeuti, Computational Complexity and Proof Theory 1990 SUNTECH Lazarus & Lerner, DOS on the Sun386i 1990 SUNTECH Lazarus, Address Space in the Sun386i 1995 SUNYPRESS Appelbaum, Popular Culture, Educational Discourse, and Mathematics 1988 1 SUPCOMP Caron & Silverman, Parallel Implementation of the Quadratic Sieve 1995 SURVCOMB Hill, Searching with Lies 1995 SURVCOMB Jerrum, Computational Polya Theory 1995 SURVCOMB Lovasz & Winkler, Mixing of Random Walks and Other Diffusions on a Graph 1995 SURVCOMB Lubotzky, Cayley Graphs: Eigenvalues, Expanders and Random Walks 1995 SURVCOMB Spencer, Modern Probabilistic Methods in Combinatorics 1993 SURVCOMB Alon, Restricted Colorings of Graphs 1993 SURVCOMB Blokhuis, Polynomials in Finite Geometries and Combinatorics 1993 SURVCOMB Brightwell, Models of Random Partial Orders 1993 SURVCOMB Frank, Applications of Submodular Functions 1993 SURVCOMB Hilton & Wojciechowski, Weighted Quasigroups 1993 SURVCOMB Ivanov, Graphs with Projective Subconstituents which Contain Short Cycles 1993 SURVCOMB Jackson, On Circuit Covers, Circuit Decompositions, and Euler Tours of Graphs 1993 SURVCOMB Saks, Slicing the Hypercube 1993 SURVCOMB Stinson, Combinatorial Designs and Cryptography 1996 5 SWAT Alon, Derandomization Via Small Sample Spaces 1996 5 SWAT Brodal & Chaudhuri & Radhakrishnan, The Randomized Complexity of Maintaining the Minimum 1996 5 SWAT Rauch Henzinger & Telle, Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning 1996 5 SWAT Marathe & Ravi & Sundaram, Service-Constrained Network Design Problems 1996 5 SWAT Kelsen & Mahajan & Ramesh, Approximate Hypergraph Coloring 1996 5 SWAT Chandra & Halldorsson, Facility Dispersion and Remote Subgraphs 1996 5 SWAT Ravi & Goemans, The Constrained Minimum Spanning Tree Problem 1996 5 SWAT Lau & Watanabe, Randomized Approximation of the Constraint Satisfaction Problem 1996 5 SWAT Klauck, On the Hardness of Global and Local Approximation 1996 5 SWAT Asano & Ono & Hirata, Approximation Algorithms for the Maximum Satisfiability Problem 1996 5 SWAT Hirata & Shimozono & Shinohara, On the Hardness of Approximating the Minimum Consistent OBDD Problem 1996 5 SWAT Lam & Sung & Ting, Computing the Unrooted Maximum Agreement Subtree in Sub-quadratic Time 1996 5 SWAT Asahiro & Iwama & Tamaki & Tokuyama, Greedily Finding a Dense Subgraph 1996 5 SWAT Fernandez-Baca & Slutzki & Eppstein, Using Sparsification for Parametric Minimum Spanning Tree Problems 1996 5 SWAT Gupta & Kaller & Mahajan & Shermer, Vertex Partitioning Problems On Partial k-Trees 1996 5 SWAT Blair & Heggernes & Telle, Making an Arbitrary Filled Graph Minimal by Removing Fill Edges 1996 5 SWAT Andersson, Sorting and Searching Revisited 1996 5 SWAT Husfeldt & Rauhe & Skyum, Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parentheses Matching 1996 5 SWAT Alstrup & Thorup, Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees 1996 5 SWAT Kelsen, Neighborhood Graphs and Distributed Delta+1-Coloring 1996 5 SWAT Gargano & Rescigno & Vaccaro, Communication Complexity of Gossiping by Packets 1996 5 SWAT Przytycka & Higham, Optimal Cost-Sensitive Distributed Minimum Spanning Tree Algorithm 1996 5 SWAT Auletta & Monti & Parente & Persiano, A Linear time Algorithm for the Feasibility of Pebble Motion on Trees 1996 5 SWAT Levcopoulos & Ostlin, Linear-Time Heuristics for Minimum Weight Rectangulation 1996 5 SWAT Aronov & Davis & Dey & Pal & Prasad, Visibility with Multiple Reflections 1996 5 SWAT Levcopoulos & Krznaric, A Fast Heuristic for Approximating the Minimum Weight Triangulation 1996 5 SWAT Brodnik & Munro, Neighbours on a Grid 1996 5 SWAT Azar & Epstein, On Two Dimensional Packing 1996 5 SWAT Biedl, Optimal Orthogonal Drawings of Triconnected Plane Graphs 1996 5 SWAT Lopez-Ortiz & Schuierer, Walking Streets Faster 1996 5 SWAT Preminger & Upfal, Safe and Efficient Traffic Laws for Mobile Robots 1996 5 SWAT Paterson, Progress in Selection 1996 5 SWAT Gonnet & Benner, Probabilistic Ancestral Sequences and Multiple Alignments 1996 5 SWAT Gasieniec & Karpinski & Plandowski & Rytter, Efficient Algorithms for Lempel-Ziv Encoding 1996 5 SWAT Baumker & Dittrich & Pietracaprina, The Deterministic Complexity of Parallel Multisearch 1996 5 SWAT Brodal, Priority Queues on Parallel Machines 1996 5 SWAT Fagerberg, Binary Search Trees: How Low Can You Go? 1996 5 SWAT Boros & Ibaraki & Makino, Boolean Analysis of Incomplete Examples 1994 4 SWAT Agarwal & Katz & Sharir, Computing Depth Orders and Related Problems 1994 4 SWAT Agarwal & Sen, Selection in Monotone Matrices and Computing kth Nearest Neighbors 1994 4 SWAT Albers & Koga, New On-Line Algorithms for the Page Replication Problem 1994 4 SWAT Ausiello & Feuerstein & Leonardi & Stougie & Talamo, Serving Requests with On-line Routing 1994 4 SWAT Becker, A New Algorithm for the Construction of Optimal B-Trees 1994 4 SWAT de Berg & de Groot & Overmars, New Results on Binary Space Partitions in the Plane (extended abstract) 1994 4 SWAT Berman & Lingas, A Nearly Optimal Parallel Algorithm for the Voronoi Diagram of a Convex Polygon 1994 4 SWAT Biedl & Kant & Kaufmann, On Triangulating Planar Graphs under the Four-Connectivity Constraint 1994 4 SWAT Czumaj & Gasieniec & Piotrow & Rytter, Parallel and Sequential Approximation of Shortest Superstrings 1994 4 SWAT Czyzowicz & Everett & Robert, Separating Translates in the Plane: Combinatorial Bounds and an Algorithm 1994 4 SWAT Das & Heffernan & Narasimhan, Finding All Weakly-Visible Chords of a Polygon in Linear Time (Extended Abstract) 1994 4 SWAT Dietz & Seiferas & Zhang, A Tight Lower Bound for On-line Monotonic List Labeling 1994 4 SWAT Felsner & Muller & Wernisch, Trapezoid Graphs and Generalizations, Geometry and Algorithms 1994 4 SWAT Fernandez-Baca & Slutzki, Optimal Parametric Search on Graphs of Bounded Tree-width 1994 4 SWAT Fredman, Lower Bounds for Dynamic Algorithms 1994 4 SWAT Gupta & Nishimura, Sequential and Parallel Algorithms for Embedding Problems on Classes of Partial k-Trees 1994 4 SWAT Gupta & Janardan & Smid, On Intersection Searching Problems Involving Curved Objects 1994 4 SWAT Halldorsson & Radhakrishnan, Improved Approximations of Independent Sets in Bounded-Degree Graphs 1994 4 SWAT Higham & Przytycka, Asymptotically Optimal Election on Weighted Rings 1994 4 SWAT Hromkovic & Klasing & Unger & Wagener, Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes (Extended Abstract) 1994 4 SWAT Hastad, Recent Results in Hardness of Approximation 1994 4 SWAT Juurlink & Wijshoff, The Parallel Hierarchical Memory Model 1994 4 SWAT Mulmuley, Randomized Geometric Algorithms (abstract) 1994 4 SWAT Palios, Connecting the Maximum Number of Grid Nodes to the Boundary with Non-intersecting Line Segments 1994 4 SWAT Papatriantafilou & Tsigas, On Self-Stabilizing Wait-Free Clock Synchronization 1994 4 SWAT Peinado, Hard Graphs for Randomized Subgraph Exclusion Algorithms 1994 4 SWAT Phillips & Stein & Wein, Task Scheduling in Networks (Extended Abstract) 1994 4 SWAT Schenk, Parallel Dynamic Lowest Common Ancestors 1994 4 SWAT Schuierer, An O(log log n) Algorithm to Compute the Kernel of a Polygon 1994 4 SWAT Schuierer, Computing the L_1-Diameter and Center of a Simple Rectilinear Polygon in Parallel 1994 4 SWAT Sibeyn & Harris, Exploiting Locality in LT-RAM Computations 1994 4 SWAT Thorup, Efficient Preprocessing of Simple Binary Pattern Forests 1994 4 SWAT Zhou & Nakano & Nishizeki, A Parallel Algorithm for Edge-Coloring Partial k-Trees 1994 4 SWAT Dragan, Dominating Cliques in Distance-Hereditary Graphs 1992 3 SWAT Gerbessiotis & Valiant, Direct Bulk-Synchronous Parallel Algorithms 1992 3 SWAT Freivalds & Smith, Memory Limited Inductive Inference Machines 1992 3 SWAT Fich & Kowaluk & Lorys & Kutylowski & Ragde, Retrieval of Scattered Information by EREW, CREW and CRCW PRAMs 1992 3 SWAT Razborov, On Small Depth Threshold Circuits 1992 3 SWAT Pippenger, An Elementary Approach to Some Analytic Asymptotics 1992 3 SWAT Czumaj, An Optimal Parallel Algorithm for Computing a Near-Optimal Order of Matrix Multiplications 1992 3 SWAT Kortsarz & Peleg, Generating Sparse 2-spanners 1992 3 SWAT Awerbuch & Berger & Cowen & Peleg, Low-Diameter Graph Decomposition is in NC 1992 3 SWAT He, Parallel Algorithm for Cograph Recognition with Applications 1992 3 SWAT Ghosh & Maheshwari, Parallel Algorithms for All Minimum Link Paths and Link Center Problems 1992 3 SWAT Kaufmann & Sibeyn, Optimal Multi-Packet Routing on the Torus 1992 3 SWAT Pinotti & Pucci, Parallel Algorithms for Priority Queue Operations 1992 3 SWAT Dietz, Heap Construction in the Parallel Comparison Tree Model 1992 3 SWAT Boyar & Larsen, Efficient Rebalancing of Chromatic Search Trees 1992 3 SWAT Jakoby & Reischuk, The Complexity of Scheduling Problems with Communication Delays for Trees 1992 3 SWAT d'Amore & Liberatore, The List Update Problem and the Retrieval of Sets 1992 3 SWAT Cunto & Yriarte, GKD-Trees: Binary Trees that Combine Multi-dimensional Data Handling, Node Size and Fringe Reorganization 1992 3 SWAT Sen, Fractional Cascading Simplified 1992 3 SWAT Giammarresi & Italiano, Dynamic 2- and 3-Connectivity on Planar Graphs (Preliminary Version) 1992 3 SWAT Hershberger & Rauch & Suri, Fully Dynamic 2-Edge-Connectivity in Planar Graphs 1992 3 SWAT McDiarmid & Reed & Schrijver & Shepherd, Non-Interfering Network Flows 1992 3 SWAT Kant & Bodlaender, Triangulating Planar Graphs While Minimizing the Maximum Degree 1992 3 SWAT Bertolazzi & Cohen & Di Battista & Tamassia & Tollis, How To Draw a Series-Parallel Digraph (Extended Abstract) 1992 3 SWAT Furer & Subramanian, Coloring Random Graphs 1992 3 SWAT Kloks & Bodlaender, Testing Superperfection of k-Trees 1992 3 SWAT Fernandez-Baca & Slutzki, Parametric Problems on Graphs of Bounded Tree-width 1992 3 SWAT Gonnet, Efficient Two-dimensional Searching 1992 3 SWAT Chew & Kedem, Improvements on Approximate Pattern Matching Problems 1992 3 SWAT Joseph & Meidanis & Tiwari, Determining DNA Sequence Similarity Using Maximum Independent Set Algorithms for Interval Graphs 1992 3 SWAT Welzl, New Results on Linear Programming and Related Problems 1992 3 SWAT Golin, Dynamic Closest Pairs -- A Probabilistic Approach 1992 3 SWAT de Berg & van Kreveld & Snoeyink, Two- and Three-Dimensional Point Location in Rectangular Subdivisions (Extended Abstract) 1992 3 SWAT Chazelle & Palios, Decomposing the Boundary of a Nonconvex Polyhedron 1992 3 SWAT Hersberger & Snoeyink, Convex Polygons Made from Few Lines and Convex Decompositions of Polyhedra 1992 3 SWAT Lenhof & Smid, Maintaining the Visibility Map of Spheres while Moving the Viewpoint on a Circle at Infinity 1992 3 SWAT Albers & Roos, Voronoi Diagrams of Moving Points in Higher Dimensional Spaces 1992 3 SWAT Katajainen & Pasanen, Sorting Multisets Stably in Minimum Space 1992 3 SWAT Petersson & Moffat, A Framework for Adaptive Sorting 1990 2 SWAT Hartmanis & Chang & Ranjan & Rohatgi, Structural Complexity Theory: Recent Surprises 1990 2 SWAT Boppana & Halldorsson, Approximating Maximum Independent Sets by Excluding Subgraphs 1990 2 SWAT Althoefer & Das & Dobkin & Joseph, Generating Sparse Spanners for Weighted Graphs 1990 2 SWAT Eppstein, Finding the k Smallest Spanning Trees 1990 2 SWAT Kant & van Leeuwen, The File Distribution Problem for Processor Networks 1990 2 SWAT de Berg, Translating Polygons with Applications to Hidden Surface Removal 1990 2 SWAT Preparata & Vitter & Yvinec, Output-Sensitive Generation of the Perspective View of Isothetic Parallelepipeds (extended abstract) 1990 2 SWAT Pocchiola, Graphics in Flatland Revisited 1990 2 SWAT Vegter, The Visibility Diagram: A Data Structure for Visibility Problems and Motion Planning 1990 2 SWAT Andersson & Lai, Fast Updating of Well-balanced Trees 1990 2 SWAT Ottmann & Wood, How to Update a Balanced Binary Tree with a Constant Number of Rotations 1990 2 SWAT Bent, Ranking Trees Generated by Rotations 1990 2 SWAT Baeza-Yates & Gonnet & Ziviani, Expected Behavior Analysis of AVL Trees 1990 2 SWAT Papadakis & Munro & Poblete, Analysis of the Expected Search Cost in Skip Lists 1990 2 SWAT Dietz & Zhang, Lower Bounds for Monotonic List Labeling 1990 2 SWAT Levcopoulos & Petersson, Sorting Shuffled Monotone Sequences 1990 2 SWAT Atallah, A Faster Parallel Algorithm for a Matrix Searching Problem 1990 2 SWAT Richards & Salowe, A Rectilinear Steiner Minimal Tree Algorithm for Convex Point Sets 1990 2 SWAT de Berg & van Kreveld & Nilsson & Overmars, Finding Shortest Paths in the Presence of Orthogonal Obstacles Using a Combined L_1 and Link Metric 1990 2 SWAT Friedman & Hershberger & Snoeyink, Input-Sensitive Compliant Motion in the Plane 1990 2 SWAT Levcopoulos & Lingas, Fast Algorithms for Greedy Triangulation 1990 2 SWAT Agarwal & Aronov & O'Rourke & Schevon, Star Unfolding of a Polytope with Applications (extended abstract) 1990 2 SWAT Fernandez-Baca, Space-Sweep Algorithms for Parametric Optimization (extended abstract) 1990 2 SWAT Korneenko & Martini, Approximating Finite Weighted Point Sets by Hyperplanes 1990 2 SWAT Johnson, Data Structures for Traveling Salesmen (abstract) 1990 2 SWAT Pantziou & Spirakis & Zaroliagis, Efficient Parallel Algorithms for Shortest Paths in Planar Graphs 1990 2 SWAT Bodlaender & Moehring, The Pathwidth and Treewidth of Cographs 1990 2 SWAT Arnborg & Proskurowski, Canonical Representations of Partial 2- and 3-Trees 1990 2 SWAT Fernandez-Baca & Williams, On Matroids and Hierarchical Graphs 1990 2 SWAT Baeza-Yates & Regnier, Fast Algorithms for Two-dimensional and Multiple Pattern Matching (preliminary version) 1990 2 SWAT Tarhio & Ukkonen, Boyer-Moore Approach to Approximate String Matching (extended abstract) 1990 2 SWAT Grape, Complete Problems with L-Samplable Distributions 1990 2 SWAT Hershberger, Upper Envelope Onion Peeling 1990 2 SWAT Hershberger & Suri, Applications of a Semi-Dynamic Convex Hull Algorithm 1990 2 SWAT van Kreveld & Overmars & Agarwal, Intersection Queries in Sets of Disks 1990 2 SWAT Schipper & Overmars, Dynamic Partition Trees 1997 10 SYLLCS Tennant, Building and Maintaining an Academic Web Service, Part 1: The Organization's Perspective (April) 1996 9 SYLLCS Stern & Lettieri, Distributing Your Video on CD-ROM: How Faculty Can Prepare Video Resources for Distribution on CD-ROM 1996 9 SYLLCS Martin, Computer Science: The Nature of a Good and Accreditable Computer Science Program 1993 7 SYLLCS , I Compute, Therefore I Am: an Overview of Artificial Life 1993 7 SYLLCS Koch, Oberlin College, Ohio: Minoring in Computer Science 1993 7 SYLLCS Goldberg, The OOP Debate 1993 5 SYLLCS Harrington, Overview of Advanced Computer Science Curricula 1992 4 SYLLCS Harrington, Teaching Intermediate Computer Science 1992 4 SYLLCS Lewis, Harvard's Introductory Computer Science Courses 1992 4 SYLLCS Booch, Software Engineering with Object-Oriented Programming 1992 3 SYLLCS , Teaching CS1: What Is the Best Language? 1992 3 SYLLCS Burton, Teaching Computer Science with Closed Laboratories 1992 1 SYLLCS Abelson, Introductory Computer Science: Three Approaches 1992 1 SYLLCS Crabb, Technology and Computer Science Instruction 1992 1 SYLLCS Frailey, CS Employers: What They Want 19?? SYMM Pickover, Mathematics and Beauty--VIII. Tesselation Automata Derived from a Single Defect 19?? SYNERGETICS Farmer, Dimension, Fractal Measure and Chaotic Dynamics 1986 SYSARRAYS Lipton & Lopresti, Comparing Long Strings on a Short Systolic Array 1997 36 SYSTSOFT Chang & Tsai, A Generalized Secret Sharing Scheme 1996 35 SYSTSOFT Jayaprakash & Muthukrishnan, Critical Analysis of ``A Fault-Tolerant Algorithm for Mutual Exclusion in a Distributed System'' 1996 35 SYSTSOFT Chang & Buehrer & Kowng, An Improvement to Ziegler's Sparse Matrix Compression Algorithm 1996 35 SYSTSOFT Nechvatal, A Public-Key-Based Key Escrow System 1996 35 SYSTSOFT Glass, An Assessment of Systems and Software Engineering Scholars and Institutions (1993-1995) 1996 34 SYSTSOFT Glass, Mathematics and the Computer Scientist 1996 34 SYSTSOFT Mathews, Organizational Foundations of Object-Oriented Programming 1996 34 SYSTSOFT Owolabi, Dictionary Organizations for Efficient Similarity Retrieval 1996 34 SYSTSOFT Wong & Mitra, A Nonblocking Timed Atomic Commit Protocol for Distributed Real-Time Database Systems 1996 33 SYSTSOFT Jmaiel, Specification of Communication Protocols Using Temporal Logic 1996 32 SYSTSOFT Jeffrey, Addressing the Essential Difficulties of Software Engineering 1995 31 SYSTSOFT Hwang & Yang, A Two-Phase Encryption Scheme for Enhancing Database Security 1995 30 SYSTSOFT Fletcher, The Role of Experiments in Computer Science 1995 29 SYSTSOFT Wong & Thambu & Stoen, A Fault-Tolerant Algorithm for Mutual Exclusion in a Distributed System 1995 29 SYSTSOFT Brown & Wu, Snooping Fault-Tolerant Distributed Shared Memories 1995 28 SYSTSOFT Thambu & Wong, An Efficient Token-Based Mutual Exclusion Algorithm in a Distributed System 1995 28 SYSTSOFT Tang & Louis, The Study of Letter-Oriented Hashing Schemes 1994 27 SYSTSOFT Yang, How to Merge Program Texts 1994 26 SYSTSOFT Glass, The Faking of Software Design 1994 26 SYSTSOFT DeMent & Srimani, A New Algorithm for k Mutual Exclusions in Distributed Systems 1993 22 SYSTSOFT Chang, A String Pattern-Matching Algorithm 1992 19 SYSTSOFT Glass, A Comparative Analysis of the Topic Areas of Computer Science, Software Engineering, and Information Systems 1992 18 SYSTSOFT Humenik & Pinkham, Transposition Errors in Context-Free Languages 1992 17 SYSTSOFT Spafford, Are Computer Hacker Break-ins Ethical? 1992 17 SYSTSOFT Gotterbarn, The Use and Abuse of Computer Ethics 1992 17 SYSTSOFT Summers & Markusen, Controversy Corner: Computers, Ethics, and Collective Violence 1991 15 SYSTSOFT Chang, Data Compression Using Hierarchical Dictionaries 1991 15 SYSTSOFT Yellen & Nunamaker, Increasing the Willingness of Novices to Use Computer Application Software 1991 15 SYSTSOFT Oman & Cook, A Programming Style Taxonomy 1991 14 SYSTSOFT Pintelas & Tragoudas, A Comparative Study of Five Language Independent Programming Environments 1990 13 SYSTSOFT Litecky, Spreadsheet Macro Programming: A Critique with Emphasis on Lotus 1-2-3 1990 13 SYSTSOFT Glass, Editor's Corner: At Last--Some Measured Results of the ``Structured Revolution'' 1990 11 SYSTSOFT Yuasa, Real-Time Garbage Collection on General-Purpose Machines 1990 11 SYSTSOFT Davis & Taylor, Local Correction of Mod(k) Lists 1990 11 SYSTSOFT Mishra & Srimani, Fault-Tolerant Mutual Exclusion Algorithms 1990 11 SYSTSOFT Ramarao, Efficient Fault-Tolerant Broadcasts 1989 10 SYSTSOFT Verkamo, Performance Comparison of Distributive and Mergesort as External Sorting Algorithms 1989 9 SYSTSOFT Ammar, Stack-Based Sorting Algorithms 1986 6 SYSTSOFT Dupuis & Hebuterne & Pitie, A Comparison of Two Mutual-Exclusion Algorithms for Computer Networks 1986 6 SYSTSOFT Fraisse, An Efficient Parallel Algorithm for the Transitive Closure of a Graph 1995 1 TACAS Roscoe & Gardiner & Goldsmith & Hulance & Jackson & Scattergood, Hierarchical Compression for Model-Checking CSP or How to Check 10^20 Dining Philosophers for Deadlock 1995 1 TACAS De Francesco & Fantechi & Gnesi & Inverardi, Model Checking of Non-finite State Processes by Finite Approximations 1995 1 TACAS Knoop & Steffen & Vollmer, Parallelism for Free: Bitvector Analyses ==> No State Explosion! 1994 TACS Kanellakis & Goldin, Constraint Programming and Database Query Languages 1994 TACS Vardi, Nontraditional Applications of Automata Theory 1991 TACS Plotkin, A Semantics for Type Checking 1991 TACS Giannini & Ronchi Della Rocca, Type Inference in Polymorphic Type Discipline 1991 TACS Tatsuta, Monotone Recursive Definition of Predicates and its Realizability Interpretation 1991 TACS Sato, Adding Proof Objects and Inductive Definition Mechanisms to Frege Structures 1991 TACS Phoa, From Term Models to Domains 1991 TACS Gunter & Gunter & MacQueen, An Abstract Interpretation of ML Equality Kinds 1991 TACS Jim & Meyer, Full Abstraction and the Context Lemma 1991 TACS Arun-Kumar & Hennessy, An Efficiency Preorder for Processes 1991 TACS Rabinovich & Trakhtenbrot, On Nets, Algebras and Modularity 1991 TACS Jonsson & Kok, Towards a Complete Hierarchy of Compositional Dataflow Models 1991 TACS Constable, Type Theory as a Foundation for Computer Science 1991 TACS Pnueli & Shalev, What is in a Step: On the Semantics of Statecharts 1991 TACS Apt & Pedreschi, Proving Termination of General Prolog Programs 1991 TACS Mitchell, On Abstraction and the Expressive Power of Programming Languages 1991 TACS Fuchi & Furukawa, Role of Logic Programming in the FGCS Project 1991 TACS Abadi & Burrows & Kaufman & Lampson, Authentication and Delegation with Smart-cards 1991 TACS Steffen, Data Flow Analysis as Model Checking 1991 TACS Pfeiffer & Parsons Selke, On the Adequacy of Dependence-Based Representations for Programs with Heaps 1991 TACS Hagiya, From Programming-by-Example to Proving-by-Example 1991 TACS Lassez, From LP to LP: Programming with Constraints 1991 TACS Armbruster, Polynomial Recursion Analysis in Pascal Like Programs 1991 TACS Hungar, Complexity of Proving Program Correctness 1991 TACS Basin & Howe, Some Normalization Properties of Martin-Lof's Type Theory, and Applications 1991 TACS Hasegawa, Parametricity of Extensionally Collapsed Term Models of Polymorphism and Their Categorical Properties 1991 TACS Nishizaki, Programs with Continuations and Linear Logic 1991 TACS Walker, pi-Calculus Semantics of Object-Oriented Programming Languages 1991 TACS Hense, Wrapper Semantics of an Object-Oriented Programming Language with State 1991 TACS Ryan & Fiadeiro & Maibaum, Sharing Actions and Attributes in Modal Action Logic 1991 TACS Treinen, First Order Data Types and First Order Logic 1991 TACS Kanovich, Efficient Program Synthesis: Semantics, Logic, Complexity 1991 TACS Hirokawa, Principal Type-Schemes of BCI-Lambda-Terms 1991 TACS Barbanera & Dezani-Ciancaglini, Intersection and Union Types 1991 TACS Reynolds, The Coherence of Languages with Intersection Types 1991 TACS Hayashi, Singleton, Union and Intersection Types for Program Extraction 1991 TACS Curien & Ghelli, Subtyping + Extensionality: Confluence of beta eta Top Reduction in F_{<=} 1991 TACS Cardelli & Martini & Mitchell & Scedrov, An Extension of System F with Subtyping 1991 TACS Scott, Will Logicians be Replaced by Machines? (Abstract) 1992 TALANG Nivat, Binary Tree Codes 1992 TALANG Aigrain & Nivat, Suffix, Prefix and Maximal Tree Codes 1992 TALANG Podelski, A Monoid Approach to Tree Automata 1992 TALANG Steinby, A Theory of Tree Language Varieties 1992 TALANG Seese, Interpretability and Tree Automata: A Simple Way to Solve Algorithmic Problems on Graphs Closely Related to Trees 1992 TALANG Litovsky & Metivier, Computing Trees with Graph Rewriting Systems with Priorities 1992 TALANG Courcelle, Recognizable Sets of Unrooted Trees 1992 TALANG Arnold & Niwinski, Fixed Point Characterization of Weak Monadic Logic Definable Sets of Trees 1992 TALANG Saoudi & Bonizzoni, Automata on Infinite Trees and Rational Control 1992 TALANG Bonizzoni & Mauri & Pighizzini & Sabadini, Recognizing Sets of Labelled Acyclic Graphs 1992 TALANG Saoudi, Rational and Recognizable Infinite Tree Sets 1992 TALANG Grosse-Rhode & Dimitrovici, Algebraic Specification of Action Trees and Recursive Processes 1992 TALANG Guessarian, Trees and Algebraic Semantics 1992 TALANG Raoult, A Survey of Tree Transductions 1992 TALANG Dauchet & Tison, Structural Complexity of Classes of Tree Languages 1992 TALANG Seidl, Ambiguity and Valuedness 1992 TALANG Fulop & Vagvolgyi, Decidability of the Inclusion in Monoids Generated by Tree Transformation Classes 1992 TALANG Joshi & Schabes, Tree-Adjoining Grammars and Lexicalized Grammars 1992 TALANG Simon, A Short Proof of the Factorization Forest Theorem 1992 TALANG Gallier, Unification Procedures in Automated Deduction Methods based on Matings: A Survey 1997 349 TAMS Johnsgard, The Conjugacy Problem for Groups of Alternating Prime Tame Links is Polynomial-Time 1996 TAMS Hell & Nesetril & Zhu, Duality and Polynomial Testing of Tree Homomorphisms 1994 341 TAMS Fraenkel, Iterated Floor Function, Algebraic Numbers, Discrete Chaos, Beatty Subsequences, Semigroups 1994 341 TAMS Luczak & Pittel & Wierman, The Structure of a Random Graph at the Point of the Phase Transition 1993 335 TAMS Margolis & Meakin, Inverse Monoids, Trees, and Context-free Languages 1992 334 TAMS Rushing, Hausdorff Dimension of Wild Fractals 1992 332 TAMS Friedman & Mansfield, Algorithmic Procedures 1992 332 TAMS Hajnal & Komjath, Corrigendum to ``Embedding Graphs into Colored Graphs'' 1991 326 TAMS Hurley, Varieties of Periodic Attractor in Cellular Automata 1990 320 TAMS Lagarias, The Nonlinear Geometry of Linear Programming. III: Projective Legendre Transform Coordinates and Hilbert Geometry 1989 314 TAMS Bayer & Lagarias, The Nonlinear Geometry of Linear Programming. I. Affine and Projective Scaling Trajectories 1989 314 TAMS Bayer & Lagarias, The Nonlinear Geometry of Linear Programming. II. Legendre Transform Coordinates and Central Trajectories 1987 303 TAMS Kolaitis & Promel & Rothschild, K_{l+1}-free Graphs: Asymptotic Structure and a 0-1 Law 1985 292 TAMS Maass, Combinatorial Lower Bound Arguments for Deterministic and Nondeterministic Turing Machines 1983 279 TAMS Maass, Characterization of Recursively Enumerable Sets with Supersets Effectively Isomorphic to All Recursively Enumerable Sets 1976 220 TAMS Lynch & Meyer & Fischer, Relativization of the Theory of Computational Complexity 1969 142 TAMS Cook & Aanderaa, On the Minimum Computation Time of Functions 1965 117 TAMS Hartmanis & Stearns, On the Computational Complexity of Algorithms 1963 106 TAMS Ritchie, Classes of Predictably Computable Functions 1994 TANCL Roychowdhury & Siu & Orlitsky, Neural Models and Spectral Methods 1994 TANCL Hofmeister, Depth-Efficient Threshold Circuits for Arithmetic Functions 1994 TANCL Goldmann, Communication Complexity and Lower Bounds for Threshold Circuits 1994 TANCL Maass & Schnitger & Sontag, A Comparison of the Computational Power of Sigmoid and Boolean Threshold Circuits 1994 TANCL Maass, Computing on Analog Neural Nets with Arbitrary Real Weights 1994 TANCL Venkatesh, Connectivity versus Capacity in the Hebb Rule 1994 TANCL Turan, Computational Learning Theory and Neural Networks: A Survey of Selected Topics 1994 TANCL Maass, Perspectives of Current Research about the Complexity of Learning on Neural Nets 1994 TANCL Blum & Kannan, Learning an Intersection of K Halfspaces over a Uniform Distribution 1994 TANCL DasGupta & Siegelmann & Sontag, On the Intractability of Loading Neural Networks 1994 TANCL Mansour, Learning Boolean Functions via the Fourier Transform 1994 TANCL Hassibi & Sayed & Kailath, LMS and Backpropagation are Minimax Filters 1994 TANCL Werbos, Supervised Learning: Can It Escape Its Local Minimum 1995 6 TAPSOFT Ehrig & Mahr, A Decade of TAPSOFT: Aspects of Progress and Prospects in Theory and Practice of Software Development 1995 6 TAPSOFT Floyd, Theory and Practice of Software Development -- Stages in a Debate 1995 6 TAPSOFT Kozen, Rational Spaces and Set Constraints 1995 6 TAPSOFT Goguen & Luqi, Formal Methods and Social Context in Software Development 1995 6 TAPSOFT Gaudel, Testing Can Be Formal, Too 1995 6 TAPSOFT Pratt, Anatomy of the Pentium Bug 1995 6 TAPSOFT Pratt, Rational Mechanics and Natural Mathematics 1995 6 TAPSOFT Potthoff, First-Order Logic on Finite Trees 1995 6 TAPSOFT Salomaa, Decidability of Equivalence for Deterministic Synchronized Tree Automata 1995 6 TAPSOFT Andre & Bossut, The Equivalence Problem for Letter-to-Letter Bottom-up Tree Transducers is Solvable 1995 6 TAPSOFT Selivanov, Fine Hierarchy of Regular omega-Languages 1995 6 TAPSOFT Wilke & Yoo, Computing the Wadge Degree, the Lifschitz Degree, and the Rabin Index of a Regular Language of Infinite Words in Polynomial Time 1995 6 TAPSOFT Wacrenier, Semi-Trace Morphisms and Rational Transductions 1995 6 TAPSOFT Bloom & Esik, Nonfinite Axiomatizability of Shuffle Inequalities 1995 6 TAPSOFT Peron, Statecharts, Transition Structures and Transformations 1993 4 TAPSOFT Dershowitz, Trees, Ordinals and Termination 1993 4 TAPSOFT Seidl, When is a Functional Tree Transduction Deterministic? 1993 4 TAPSOFT Beauquier & Niwinski, Automata on Infinite Trees with Counting Constraints 1993 4 TAPSOFT Barcucci & Pinzani & Sprugnoli, Directed Column-Convex Polyominoes by Recurrence Relations 1993 4 TAPSOFT Boudet & Comon, About the Theory of Tree Embedding 1993 4 TAPSOFT Thomas, On the Ehrenfeucht-Fraisse Game in Theoretical Computer Science 1993 4 TAPSOFT Tyszkiewicz, On Asymptotic Probabilities in Logics that Capture DSPACE(log n) 1993 4 TAPSOFT Trier, (Un)expected Path Lengths of Asymmetric Binary Search Trees 1993 4 TAPSOFT Louchard, Trie Size in a Dynamic List Structure 1993 4 TAPSOFT Gribomont & Van Dongen, Generic Systolic Arrays: A Methodology for Systolic Design 1991 TAPSOFT Halpern, Knowledge and Probability in Distributed Systems (Abstract) 1991 TAPSOFT Caron, Linear Bounded Automata and Rewrite Systems: Influence of Initial Configurations 1991 TAPSOFT Luccio & Pagli, Simple Solutions for Approximate Tree Matching Problems 1991 TAPSOFT Kilpelainen & Mannila, The Tree Inclusion Problem 1991 TAPSOFT Prasad, A Calculus of Broadcasting Systems 1989 TAPSOFT Hoare, The Varieties of Programming Language 1989 TAPSOFT Baeza-Yates, The Subsequence Graph of a Text (Preliminary version) 1987 2 TAPSOFT Wegener, On the Complexity of Branching Programs and Decision Trees for Clique Functions 1987 2 TAPSOFT Szpankowski, Average Complexity of Additive Properties for Multiway Tries: A Unified Approach 1987 2 TAPSOFT Crochemore, Longest Common Factor of Two Words 1987 2 TAPSOFT Ronchi della Rocca, A Unification Semi-Algorithm for Intersection Type Schemes 1987 2 TAPSOFT Steffen, Optimal Run Time Optimization Proved by a New Look at Abstract Interpretations 1987 2 TAPSOFT Bellegarde & Lescanne, Transformation Ordering 1987 2 TAPSOFT Gogolla, On Parametric Algebraic Specifications with Clean Error Handling 1987 2 TAPSOFT Sannella & Tarlecki, Toward Formal Development of Programs from Algebraic Specifications: Implementations Revisited 1987 2 TAPSOFT Marongiu & Tulipani, Finite Algebraic Specifications of Semicomputable Data Types 1987 2 TAPSOFT Boudol & Castellani, On the Semantics of Concurrency: Partial Orders and Transition Systems 1987 2 TAPSOFT De Nicola & Hennessy, CCS without tau's 1987 2 TAPSOFT Darondeau & Gamatie, A Fully Observational Model for Infinite Behaviours of Communicating Systems 1987 2 TAPSOFT Astesiano & Reggio, SMoLCS-Driven Concurrent Calculi 1987 2 TAPSOFT Navarro & Orejas, Parameterized Horn Clause Specifications: Proof Theory and Correctness 1987 2 TAPSOFT Parisi-Presicce, Partial Composition and Recursion of Module Specifications 1987 2 TAPSOFT Gambosi & Talamo & Nesetril, Efficient Representation of Taxonomies 1987 2 TAPSOFT Meyer & de Vink, Applications of Compactness in the Smyth Powerdomain of Streams 1987 2 TAPSOFT Browne & Clarke & Grumberg, Characterizing Kripke Structures in Temporal Logic 1987 2 TAPSOFT Milner, Dialogue with a Proof System 1987 2 TAPSOFT Huet, Induction Principles Formalized in the Calculus of Constructions 1990 3 TARK Konolige, Nonmonotonic Reasoning 1990 3 TARK Parikh, Recent Issues in Reasoning about Knowledge 1990 3 TARK Fagin & Halpern & Vardi, A Nonstandard Approach to the Logical Omniscience Problem 1990 3 TARK Pearl, System Z: A Natural Ordering of Defaults with Tractable Applications to Nonmonotonic Reasoning 1990 3 TARK Stalnaker, Semantics for Conditionals 1990 3 TARK Krasucki, Reaching Consensus on Decisions 1990 3 TARK Moses & Nachum, Agreeing to Disagree After All 1990 3 TARK Skyrms, Dynamic Models of Deliberation and the Theory of Games 1990 3 TARK Gilboa, A Note on the Consistency of Game Theory 1990 3 TARK Lipman, On the Strategic Advantages of a Lack of Common Knowledge 1990 3 TARK Jain & Sharma, Hypothesis Formation and Language Acquisition with an Infinitely-Often Correct Teacher 1990 3 TARK Spaan, Nexttime is not Necessary 1990 3 TARK Artemov, Kolmogorov's Logic of Problems and a Provability Interpretation of Intuitionistic Logic 1990 3 TARK Mazer, A Link Between Knowledge and Communication in Faulty Distributed Systems 1988 2 TARK Tompa, Zero Knowledge Interactive Proofs of Knowledge (A Digest) 1988 2 TARK Rivest & Sloan, A New Model for Inductive Inference 1988 2 TARK Koons, Doxastic Paradoxes without Self-Reference 1988 2 TARK Gaifman, Operational Pointer Semantics: Solution to Self-Referential Puzzles I 1988 2 TARK Asher, Reasoning about Belief and Knowledge with Self-Reference and Time 1988 2 TARK Halpern, Reasoning About Knowledge: A Tutorial 1988 2 TARK Tan & Werlang, A Guide to Knowledge and Games 1988 2 TARK Moses, Resource-bounded Knowledge 1988 2 TARK Fagin & Halpern, Reasoning about Knowledge and Probability 1988 2 TARK Neiger, Knowledge Consistency: A Useful Suspension of Disbelief 1988 2 TARK Mazer, A Knowledge Theoretic Account of Recovery in Distributed Systems: The Case of Negotiated Commitment 1988 2 TARK Burrows & Abadi & Needham, Authentication: A Practical Study in Belief and Action 1988 2 TARK Barwise, Three Views of Common Knowledge 1988 2 TARK Bicchieri, Common Knowledge and Backward Induction: A Solution to the Paradox 1988 2 TARK Reny, Extensive Games and Common Knowledge (abstract) 1988 2 TARK Gilboa & Schmeidler, Information-Dependent Games: Can Common Sense Be Common Knowledge? (abstract) 1986 TARK Asher & Kamp, The Knower's Paradox and Representational Theories of Attitudes 1986 TARK Aumann, Reasoning About Knowledge in Economics 1986 TARK des Rivieres & Levesque, The Consistency of Syntactical Treatments of Knowledge 1986 TARK Dwork & Moses, Knowledge and Common Knowledge in a Byzantine Environment I: Crash Failures (Extended Abstract) 1986 TARK Fagin & Vardi, Knowledge and Implicit Knowledge in a Distributed Environment: Preliminary Report 1986 TARK Fischer & Immerman, Foundations of Knowledge for Distributed Systems 1986 TARK Gaifman, A Theory of Higher Order Probabilities 1986 TARK Geissler & Konolige, A Resolution Method for Quantified Modal Logics of Knowledge and Belief 1986 TARK Halpern, Reasoning About Knowledge: An Overview 1986 TARK Hintikka, Reasoning About Knowledge in Philosophy: The Paradigm of Epistemic Logic 1986 TARK Konolige, What Awareness Isn't: A Sentential View of Implicit and Explicit Belief (postion paper) 1986 TARK Ladner & Reif, The Logic of Distributed Protocols (Preliminary Report) 1986 TARK Lakemeyer, Steps Towards a First-Order Logic of Explicit and Implicit Belief 1986 TARK Landman, Pegs and Alecs 1986 TARK Martins & Shapiro, Theoretical Foundations for Belief Revision 1986 TARK McCarthy, Mental Situation Calculus 1986 TARK Megiddo & Wigderson, On Play by Means of Computing Machines (Preliminary Version) 1986 TARK Micali, Knowledge and Efficient Computation 1986 TARK Mitchell & O'Donnell, Realizability Semantics for Error-Tolerant Logics (Preliminary Version) 1986 TARK Moore, Reasoning About Knowledge in Artificial Intelligence 1986 TARK Morgenstern, A First Order Theory of Planning, Knowledge, and Action 1986 TARK panel, Panel: Objects of Knowledge and Belief: Sentences vs. Propositions? 1986 TARK Plotkin & Stirling, A Framework for Intuitionistic Modal Logics (Extended Abstract) 1986 TARK Rosenschein & Kaelbling, The Synthesis of Digital Machines With Provable Epistemic Properties 1986 TARK Smith, Varieties of Self-Reference 1986 TARK Smullyan, Logicians Who Reason About Themselves 1986 TARK Tan & Werlang, Summary of ``On Aumann's Notion of Common Knowledge--An Alternative Approach'' 1986 TARK Thomason, Paradoxes and Semantic Representation (position paper) 1986 TARK Vardi, On Epistemic Logic and Logical Omniscience 1983 TARCHER Guillen, Bridges to Infinity: The Human Side of Mathematics 1997 175 TCS Ershov, The Bounded-Complete Hull of an a-space 1997 175 TCS Shilov, Program Schemata vs. Automata for Decidability of Program Logics 1997 175 TCS Kobayashi, Monad as Modality 1997 175 TCS Sato, Intuitionistic and Classical Natural Deduction Systems with the Catch and the Throw Rules 1997 175 TCS Kennaway & Klop & Sleep & de Vries, Infinitary Lambda Calculus 1997 175 TCS Middeldorp & Zantema, Simple Termination of Rewrite Systems 1997 175 TCS van Oostrom, Developing Developments 1997 175 TCS Lisitsa & Sazonov, Delta-Languages for Sets and LOGSPACE Computable Graph Transformers 1997 174 TCS Litovsky & Staiger, Finite Acceptance of Infinite Words 1997 174 TCS Marathe & Radhakrishnan & Hunt & Ravi, Hierarchically Specified Unit Disk Graphs 1997 174 TCS Bracho & Droste & Kuske, Representation of Computations in Concurrent Automata by Dependence Orders 1997 174 TCS Arora & Fagin, On Winning Strategies in Ehrenfeucht-Fraisse Games 1997 174 TCS Orponen, Computing with Truly Asynchronous Threshold Logic Networks 1997 174 TCS Krause & Pudlak, On the Computational Power of Depth-2 Circuits with Threshold and Modulo Gates 1997 174 TCS Favati & Lotti & Margara, Additive One-dimensional Cellular Automata are Chaotic According to Devaney's Definition of Chaos 1997 174 TCS Santini-Bouchard, Echanges de Trois Intervalles et Suites Minimales 1997 174 TCS Berman & Lingas, A Nearly Optimal Parallel Algorithm for the Voronoi Diagram of a Convex Polygon 1997 174 TCS Kurka, On Topological Dynamics of Turing Machines 1997 174 TCS Finkel & McKenzie, Verifying Identical Communicating Processes is Undecidable 1997 174 TCS Mullins, On an Effective Hierarchy of Communicating Processes: Separation Principle and Testing 1997 174 TCS Yamasaki, The Arithmetic of Reversed Positional Games 1997 174 TCS Kobayashi & Yokomori, Learning Approximately Regular Languages with Reversible Languages 1997 174 TCS Takahashi, Various Hierarchies of omega-Regular Sets 1997 174 TCS Turakainen, The Undecidability of Some Equivalence Problems Concerning ngsm's and Finite Substitutions 1997 174 TCS Zhang & Canfield, The End of Pumping? 1997 173 TCS Cerioli & Meseguer, May I Borrow Your Logic? (Transporting Logical Structures along Maps) 1997 173 TCS Jouannaud & Okada, Abstract Data Type Systems 1997 173 TCS Hennicker & Wirsing & Bidoit, Proof Systems for Structured Specifications with Observability Operators 1997 173 TCS Kahrs & Sannella & Tarlecki, The Definition of Extended ML: A Gentle Introduction 1997 173 TCS Orejas & Pino & Ehrig, Institutions for Logic Programming 1997 173 TCS Costa & Reggio, Specification of Abstract Dynamic-Data Types: A Temporal Logic Approach 1997 173 TCS Michel & Hentenryck, Helios: A Modeling Language for Global Optimization and its Implementation in Newton 1997 173 TCS Bjorner & Browne & Manna, Automatic Generation of Invariants and Intermediate Assertions 1997 173 TCS Koubarakis, From Local to Global Consistency in Temporal Constraint Networks 1997 173 TCS Maher, Constrained Dependencies 1997 173 TCS Grumbach & Su, queries with Arithmetical Constraints 1997 173 TCS Ajili & Contejean, Avoiding Slack Variables in the Solving of Linear Diophantine Equations and Inequations 1997 173 TCS Marriott & Odersky, A Confluent Calculus for Concurrent Constraint Programming 1997 173 TCS Podelski & Smolka, Situated Simplification 1997 173 TCS Girodias & Cerny & Older, Solving Linear, Min and Max Constraint Systems Using CLP Based on Relational Interval Arithmetic 1997 173 TCS Dechter & van Beek, Local and Global Relational Consistency 1997 172 TCS Edmonds, Removing Ramsey Theory: Lower Bounds with Smaller Domain Size 1997 172 TCS Fischer & Hoffgen & Lefmann, PAC-Learning from General Examples 1997 172 TCS Fagnot, Sur les Facteurs de Mots Automatiques 1997 172 TCS Apolloni & Chiaravalli, PAC Learning of Concept Classes through the Boundaries of their Items 1997 172 TCS Goles & Margenstern, Universality of the Chip-Firing Game 1997 172 TCS Handley, Deterministic Summation Modulo B_n, the Semigroup of Binary Relations on {0,1,...,n-1} 1997 172 TCS Kant & He, Regular Edge Labeling of 4-connected Plane Graphs and its Applications in Graph Drawing Problems 1997 172 TCS Ambos-Spies & Terwijn & Zheng, Resource Bounded Randomness and Weakly Complete Problems 1997 172 TCS Brandstadt & Dragan & Nicolai, Homogeneously Orderable Graphs 1997 172 TCS Dendris & Kirousis & Thilikos, Fugitive-Search Games on Graphs and Related Parameters 1997 172 TCS Hohl, Massively Parallel Factorizations of Polynomials with Many Non-commuting Variables 1997 172 TCS Shimozono, Finding Optimal Subgraphs by Local Search 1997 172 TCS Rystsov, Reset Words for Commutative and Solvable Automata 1997 172 TCS Iliopoulos & Moore & Smyth, A Characterization of the Squares in a Fibonacci String 1997 172 TCS Savicky & Zak, A Lower Bound on Branching Programs Reading Some Bits Twice 1997 172 TCS Rote, Finding a Shortest Vector in a Two-Dimensional Lattice Modulo m 1997 172 TCS Hoogeboom & Muscholl, The Code Problem for Traces -- Improving the Boundaries 1997 171 TCS Ausiello & Giaccio, On-line Algorithms for Satisfiability Problems with Uncertainty 1997 171 TCS Koubarakis, The Complexity of Query Evaluation in Indefinite Temporal Constraint Databases 1997 171 TCS Ruet & Fages, Combining Explicit Negation and Negation by Failure via Belnap's Logic 1997 171 TCS Mobasher & Pigozzi & Slutzki, Multi-valued Logic Programming Semantics: An Algebraic Approach 1997 171 TCS Nerode & Remmel & Subrahmanian, Annotated Nonmonotonic Rule Systems 1997 171 TCS Nago & Haddawy, Answering Queries from Context-sensitive Probabilistic Knowledge Bases 1997 171 TCS Zimanyi, Query Evaluation in Probabilistic Relational Databases 1997 171 TCS Kohlas, Allocation of Arguments and Evidence Theory 1997 171 TCS Chatalic & Froidevaux & Schwind, Graded Hypothesis Theories 1997 171 TCS Bosc & Dubois & Pivert & Prade, Flexible Queries in Relational Databases -- The Example of the Division Operator 1996 170 TCS Ramakrishna & Melliar-Smith & Moser & Dillon & Kutty, Interval Logics and their Decision Procedures. Part II: A Real-time Interval Logic 1996 170 TCS Groote & Sellink, Confluence for Process Verification 1996 170 TCS Dezani-Ciancaglini & de-Liguoro & Piperno, Filter Models for Conjunctive-Disjunctive lambda-Calculi 1996 170 TCS Arai, Tractability of Cut-free Gentzen Type Propositional Calculus with Permutation Inference 1996 170 TCS Majster-Cederbaum & Baier, Metric Completion versus Ideal Completion 1996 170 TCS Barbanera & Fernandez, Intersection Type Assignment Systems with Higher-order Algebraic Rewriting 1996 170 TCS Dimopoulos & Torres, Graph Theoretical Structures in Logic Programs and Default Theories 1996 170 TCS Bouhoula, Using Induction and Rewriting to Verify and Complete Parameterized Specifications 1996 170 TCS Sassone, An Axiomatization of the Algebra of Petri Net Concatenable Processes 1996 170 TCS Sassone & Nielsen & Winskel, Models for Concurrency: Towards a Classification 1996 170 TCS Rutten, Elements of Generalized Ultrametric Domain Theory 1996 170 TCS You & Cartwright & Li, Iterative Belief Revision in Extended Logic Programming 1996 170 TCS Hilken, Towards a Proof Theory of Rewriting: The Simply Typed 2lambda-Calculus 1996 170 TCS Yen & Jian & Lao, Deciding Bisimulation and Trace Equivalences for Systems with Many Identical Processes 1996 169 TCS Muscholl, On the Complementation of Asynchronous Cellular Buchi Automata 1996 169 TCS Feige, A Fast Randomized LOGSPACE Algorithm for Graph Connectivity 1996 169 TCS Globerman & Harel, Complexity Results for Two-way and Multi-pebble Automata and their Logics 1996 169 TCS Pin, Polynomial Closure of Group Languages and Open Sets of the Hall Topology 1996 169 TCS Di Cosmo & Kesner, Combining Algebraic Rewriting, Extensional Lambda Calculi, and Fixpoints 1996 169 TCS Bunder, Lambda Terms Definable as Combinators 1996 169 TCS Eades & Whitesides, The Logic Engine and the Realization Problem for Nearest Neighbor Graphs 1996 169 TCS Farrell & Kieronska, Formal Specification of Parallel SIMD Execution 1996 169 TCS Gibbons, Computing Downwards Accumulations on Trees Quickly 1996 169 TCS Nickolas & Robinson, The Qu-Prolog Unification Algorithm: Formalisation and Correctness 1996 169 TCS Yarroll, See More through Lenses than Bananas 1996 168 TCS Rogozhin, Small Universal Turing Machines 1996 168 TCS Kudlek, Small Deterministic Turing Machines 1996 168 TCS Pavlotskaya, On Machines, Universal by Extensions 1996 168 TCS Korec, Small Universal Register Machines 1996 168 TCS Morita, Universality of a Reversible Two-counter Machine 1996 168 TCS Paun & Rozenberg & Salomaa, Computing by Splicing 1996 168 TCS Morita & Imai, Self-reproduction in a Reversible Cellular Space 1996 168 TCS Mazoyer, On Optimal Solutions to the Firing Squad Synchronization Problem 1996 168 TCS Goles & Matamala, Symmetric Discrete Universal Neural Networks 1996 168 TCS Bournez & Cosnard, On the Computational Power of Dynamical Systems and Hybrid Systems 1996 168 TCS Siegelmann, The Simple Dynamics of Super Turing Theories 1996 168 TCS Ambos-Spies & Neis & Terwijn, Genericity and Measure for Exponential Time 1996 168 TCS Baeza-Yates, Bounded Disorder: The Effect of the Index 1996 168 TCS Dietzfelbinger & Hromkovic & Schnitger, A Comparison of Two Lower-Bound Methods for Communication Complexity 1996 168 TCS Ferrari & Montanari & Quaglia, A pi-Calculus with Explicit Substitutions 1996 168 TCS Karhumaki & Plandowski, On the Size of Independent Systems of Equations in Semigroups 1996 168 TCS Kavvadias & Pantziou & Spirakis & Zaroliagis, Hammock-on-Ears Decomposition: A Technique for the Efficient Parallel Solution of Shortest Paths and other Problems 1996 168 TCS Sieber, Full Abstraction for the Second Order Subset of an ALGOL-like Language 1996 167 TCS Hofmann & Sannella, On Behavioural Abstraction and Behavioural Satisfaction in Higher-order Logic 1996 167 TCS Jonsson & Tsay, Assumption/Guarantee Specifications in Linear-time Temporal Logic 1996 167 TCS Kozen, Rational Spaces and Set Constraints 1996 167 TCS Middeldorp & Okui & Ida, Lazy Narrowing: Strong Completeness and Eager Variable Elimination 1996 167 TCS Sagiv & Reps & Horwitz, Precise Interprocedural Dataflow Analysis with Applications to Constant Propagation 1996 167 TCS Salomaa, Decidability of Equivalence for Deterministic Synchronized Tree Automata 1996 167 TCS Sands, Proving the Correctness of Recursion-based Automatic Program Transformations 1996 167 TCS Sangiorgi, pi-Calculus, Internal Mobility, and Agent-passing Calculi 1996 166 TCS Ramakrishna & Melliar-Smith & Moser & Dillon & Kutty, Interval Logics and their Decision Procedures. Part I: An Interval Logic 1996 166 TCS Park, An Algebraic Formulation of the Aggregative Closure Query 1996 166 TCS Shen & Tian, Monadic Partition Logics and Finite Automata 1996 166 TCS Hoofman, Comparing Models of the Intensional Typed lambda-Calculus 1996 166 TCS Etalle & Gabbrielli, Transformations of CLP Modules 1996 166 TCS Fouks & Spehner, Meta-resolution: An Algorithmic Formalisation 1996 166 TCS Demri & Orlowska, Logical Analysis of Demonic Nondeterministic Programs 1996 166 TCS Zhang, The Largest Cartesian Closed Category of Stable Domains 1996 166 TCS Gottlob & Marcus & Nerode & Salzer & Subrahmanian, A Non-ground Realization of the Stable and Well-founded Semantics 1996 166 TCS Meinke, Topological Methods for Algebraic Specification 1996 166 TCS Degtyarev & Voronkov, The Undecidability of Simultaneous Rigid E-Unification 1996 165 TCS Fraser, Consistent Subsequences and Supersequences 1996 165 TCS Maurin, Exact Complexity Bounds for Ordinal Addition 1996 165 TCS Pelecq, Automorphism Groups of Context-free Graphs 1996 165 TCS Berthe, Frequences des Facteurs des Suites Sturmiennes 1996 165 TCS Munro & Raman, Selection from Read-only Memory and Sorting with Minimum Data Movement 1996 165 TCS Morcrette, Sur l'Equivalence de Descriptions de Figures Iterees 1996 165 TCS Kulkarni & Shankar, Linear Time Parsers for Classes of Non Context Free Languages 1996 165 TCS Habib & Nourine, Tree Structure for Distributive Lattices and its Applications 1996 165 TCS Blundo & Cresti & De Santis & Vaccaro, Fully Dynamic Secret Sharing Schemes 1996 165 TCS Auletta & Parente & Persiano, Dynamic and Static Algorithms for Optimal Placement of Resource in a Tree 1996 165 TCS Dumitrescu, Nonreturning PC Grammar Systems can be Simulated by Returning Systems 1996 165 TCS Imai & Morita, Firing Squad Synchronization Problem in Reversible Cellular Automata 1996 165 TCS Brimkov & Codenotti & Leoncini & Resta, Strong NP-completeness of a Matrix Similarity Problem 1996 165 TCS Bidoit & Hennicker, Behavioural Theories and the Proof of Behavioural Properties 1996 165 TCS Codish & Mashevitzky, Proving Implications by Algebraic Approximation 1996 165 TCS Antoy & Middeldorp, A Sequential Reduction Strategy 1996 165 TCS Gramlich, On Termination and Confluence Properties of Disjoint and Constructor-sharing Conditional Rewrite Systems 1996 165 TCS Alpuente & Falaschi & Vidal, A Compositional Semantic Basis for the Analysis of Equational Horn Programs 1996 165 TCS Teusink, Three-valued Completion for Abductive Logic Programs 1996 165 TCS Miller, Forum: A Multiple-Conclusion Specification Logic 1996 164 TCS Carlsson & Chen & Mattsson, Heaps with Bits 1996 164 TCS Case & Jain & Sharma, Anomalous Learning Helps Succinctness 1996 164 TCS Harrison, On Almost Cylindrical Languages and the Decidability of teh D0L and PWD0L Primitivity Problems 1996 164 TCS Sirvent, Relationships between the Dynamical Systems Associated to the Rauzy Substitutions 1996 164 TCS Picouleau, Worst-Case Analysis of Fast Heuristics for Packing Squares into a Square 1996 164 TCS Middendorf, Two-Dimensional Partitioning Problems 1996 164 TCS Diks & Pelc, Reliable Computations on Faulty EREW PRAM 1996 164 TCS Salomaa & Wood & Yu, Structural Equivalence and ET0L Grammars 1996 164 TCS Lutz & Mayordomo, Cook versus Karp-Levin: Separating Completeness Notions if NP is not Small 1996 164 TCS Hubert, Proprietes Combinatoires des Suites Definies par le Billard dans les Triangles Pavants 1996 164 TCS Fill, Limits and Rates of Convergence for the Distribution of Search Cost under the Move-to-Front Rule 1996 164 TCS Finkel & Tellier, A Polynomial Algorithm for the Membership Problem with Categorial Grammars 1996 164 TCS De Felice, An Application of Hajos Factorizations to Variable-Length Codes 1996 164 TCS Moews, Coin-sliding and Go 1996 164 TCS Tomescu, On the Asymptotic Average Length of a Maximum Common Subsequence for Words over a Finite Alphabet 1996 164 TCS Gupta & Nishimura, The Complexity of Subgraph Isomorphism for Classes of Partial k-Trees 1996 164 TCS Iliopoulos & Park, A Work-Time Optimal Algorithm for Computing All String Covers 1996 163 TCS Courcelle, Basic Notions of Universal Algebra for Language Theory and Graph Grammars 1996 163 TCS Bloom & Esik, Free Shuffle Algebras in Language Varieties 1996 163 TCS Niwinski & Walukiewicz, Games for the mu-Calculus 1996 163 TCS Colussi & Toniolo, How the Character Comparison Order Shapes the Shift Function of On-line Pattern Matching Algorithms 1996 163 TCS Derencourt, A Three-Word Code which is not Prefix-Suffix Composed 1996 163 TCS Hausen-Tropper, A Framework for a Theory of Automated Learning 1996 163 TCS Beigel & Gasarch & Kinber, Frequency Computation and Bounded Queries 1996 163 TCS Lehr & Shallit & Tromp, On the Vector Space of the Automatic Reals 1996 163 TCS Levcopoulos & Petersson, Exploiting Few Inversions When Sorting: Sequential and Parallel Algorithms 1996 163 TCS Gu & Zhu, Optimal Heapsort Algorithm 1996 163 TCS Vollmer & Wagner, Recursion Theoretic Characterizations of Complexity Classes of Counting Functions 1996 163 TCS Long, On Group Codes 1996 163 TCS Fredholm, Computing Minimum with Primitive Recursion over Lists 1996 163 TCS Gilman, A Shrinking Lemma for Indexed Languages 1996 163 TCS Tsukiji, On a Small Class of Boolean Sums 1996 163 TCS Blanchard & Maass, Dynamical Behaviour of Coven's Aperiodic Cellular Automata 1996 163 TCS Malgouyres, There is no Local Characterization of Separating and Thin Objects in Z^3 1996 163 TCS Ziadi, Regular Expression for a Language without Empty Word 1996 162 TCS Pan, Parallel Computation of Polynomial GCD and Some Related Parallel Computations 1996 162 TCS Baker & Coffman, Mutual Exclusion Scheduling 1996 162 TCS Meyer auf der Heide & Scheideler & Stemann, Exploiting Storage Redundancy to Speed Up Randomized Shared Memory 1996 162 TCS Mayr & Werchner, Divide-and-Conquer Algorithms on the Hypercube 1996 162 TCS Hsu & Ramachandran, Efficient Massively Parallel Implementation of Some Combinatorial Algorithms 1996 162 TCS Finta & Liu & Milis & Bampis, Scheduling UET-UCT Series-Parallel Graphs on Two Processors 1996 162 TCS Chakrabarti, Random Allocation of Jobs with Weights and Precedence 1996 162 TCS Garcia, Massively Parallel Approximation of Irregular Triangular Meshes of Arbitrary Topology with Smooth Parametric Surfaces 1996 162 TCS Vigna, On the Relations between Distributive Computability and the BSS Model 1996 162 TCS Moore, Recursion Theory on the Reals and Continuous-Time Computation 1996 162 TCS Brattka, Recursive Characterization of Computable Real-valued Functions and Relations 1996 162 TCS Escardo, PCF Extended with Real Numbers 1996 162 TCS Pelibossian, On the Linearity of On-line Computable Functions 1996 162 TCS Revol & Roch, Parallel Evaluation of Arithmetic Circuits 1996 162 TCS Mikov, Large-scale Addition of Machine Real Numbers: Accuracy Estimates 1996 161 TCS Chen, Parallel Constructions of Maximal Path Sets and Applications to Short Superstrings 1996 161 TCS Carrere, On the Kleijn-Rozenberg k-Adjacent Languages 1996 161 TCS Labhalla & Lombardi & Marlin, Algorithmes de Calcul de la Reduction de Hermite d'une Matrice a Coefficients Polynomiaux 1996 161 TCS Harju & Lipponen & Mateescu, Flatwords and Post Correspondence Problem 1996 161 TCS Mayer & Stockmeyer, The Complexity of PDL with Interleaving 1996 161 TCS Fortnow & Kummer, On Resource-bounded Instance Complexity 1996 161 TCS Petersen, On the Language of Primitive Words 1996 161 TCS Selmi, Over Testable Languages 1996 161 TCS Carton, Chain Automata 1996 161 TCS Hotz & Pitsch, On Parsing Coupled-Context-Free Languages 1996 161 TCS Fulk & Jain, Learning in the Presence of Inaccurate Information 1996 161 TCS Regan, Index Sets and Presentations of Complexity Classes 1996 161 TCS Maruyama & Miyano, Inferring a Tree from Walks 1996 161 TCS Cucker & Shub, Generalized Knapsack Problems and Fixed Degree Separations 1996 161 TCS Andreev & Clementi & Rolim, Constructing the Highest Degree Subgraph for Dense Graphs is in NCAS 1996 160 TCS Maddux, Relation-Algebraic Semantics 1996 160 TCS Courcelle, The Monadic Second-order Logic of Graphs X: Linear Orderings 1996 160 TCS Tronci, Equational Programming in lambda-Calculus via SL-Systems. Part 1 1996 160 TCS Tronci, Equational Programming in lambda-Calculus via SL-Systems. Part 2 1996 160 TCS Tuijn & Gyssens, CGOOD, a Categorical Graph-oriented Object Datamodel 1996 160 TCS Baaz & Leitsch & Zach, Completeness of a First-order Temporal Logic with Time-Gaps 1996 160 TCS Kaminski & Wong, The Power of the ``Always'' Operator in First-order Temporal Logic 1996 160 TCS Yamasaki, SLDNF Resolution with Non-safe Rule and Fixpoint Semantics for General Logic Programs 1996 160 TCS Durand & Ranaivoson, First-order Spectra with One Binary Predicate 1996 160 TCS Bonatti & Eiter, Querying Disjunctive Databases through Nonmonotonic Logics 1996 160 TCS Marriott & Odersky, Negative Boolean Constraints 1996 159 TCS Bundgen, Buchberger's Algorithm: The Term Rewriter's Point of View 1996 159 TCS Asperti & Laneve, Interaction Systems II: The Practice of Optimal Reductions 1996 159 TCS Gritzner & Berghammer, A Relation Algebraic Model of Robust Correctness 1996 159 TCS Erdogmus & Johnston & Ferguson, On the Operational Semantics of Nondeterminism and Divergence 1996 159 TCS Sambin & Valentini & Virgili, Constructive Domain Theory as a Branch of Intuitionistic Pointfree Topology 1996 159 TCS Arai, A Proper Hierarchy of Propositional Sequent Calculi 1996 159 TCS Ying, When is the Ideal Completion of Abstract Basis Algebraic 1996 159 TCS Wilf, Recents Developpements et Problemes dans le Domaine de la Generation Aleatoire 1996 159 TCS Alonso & Schott, A Parallel Algorithm for the Generation of a Permutation and Applications 1996 159 TCS Barcucci & Del Lungo & Pinzani, ``Deco'' Polyominoes, Permutations and Random Generation 1996 159 TCS Denise, Generation Aleatoire Uniforme de Mots de Langages Rationnels 1996 159 TCS Louchard, Probabilistic Analysis of Some (Un)directed Animals 1996 159 TCS Mosbah, Probabilistic Hyperedge Replacement Grammars 1996 159 TCS Fournier, Pavage des Figures Planes sans Trous par des Dominos: Fondement Graphique de l'Algorithme de Thurston, Parallelisation, Unicite et Decomposition 1996 159 TCS Barcucci & Del Lungo & Pinzani & Sprugnoli, Polyominoes Defined by their Vertical and Horizontal Projections 1996 159 TCS Chaboud, Domino Tiling in Planar Graphs with Regular and Bipartite Dual 1996 158 TCS Gabarro & Martinez & Messeguer, A Design of a Parallel Dictionary Using Skip Lists 1996 158 TCS Koskas, About the p-Paperfolding Words 1996 158 TCS Ferreira & Grammatikakis, Randomized Routing on Generalized Hypercubes 1996 158 TCS Fabre, Dependance de Systemes de Numeration Associes a des Puissances d'un Nombre de Pisot 1996 158 TCS Jonoska, Sofic Shifts with Synchronizing Presentations 1996 158 TCS Demange & Paschos, On an Approximation Measure Founded on the Links between Optimization and Polynomial Approximation Theory 1996 158 TCS Hirshfeld & Jerrum & Moller, A Polynomial Algorithm for Deciding Bisimilarity of Normed Context-Free Processes 1996 158 TCS Nishida & Salomaa, Slender 0L Languages 1996 158 TCS Breslauer, Saving Comparisons in the Crochemore-Perrin String Matching Algorithm 1996 158 TCS Agrawal & Arvind, Geometric Sets of Low Information Content 1996 158 TCS Mocas, Separating Classes in the Exponential Time Hierarchy from Classes in PH 1996 158 TCS Ramalingam & Reps, On the Computational Complexity of Dynamic Graph Problems 1996 158 TCS Takahashi, Solving Optimization Problems with Variable-Constraint by an Extended Cohen-Grossberg Model 1996 158 TCS Zwick & Paterson, The Complexity of Mean Payoff Games on Graphs 1996 158 TCS Agrawal & Arvind, Quasi-linear Truth-table Reductions to p-Selective Sets 1996 158 TCS Burckel, Closed Iterative Calculus 1996 157 TCS Ablayev, Lower Bounds for One-Way Probabilistic Communication Complexity and their Application to Space Complexity 1996 157 TCS Burago & de Rougemont & Slissenko, On the Complexity of Partially Observed Markov Decision Processes 1996 157 TCS Grigoriev & Vorobjov, Complexity Lower Bounds for Computation Trees with Elementary Transcendental Function Gates 1996 157 TCS Karzanov, How to tidy Up a Symmetric Set-system by Use of Uncrossing Operations 1996 157 TCS Muchnik & Vereshchagin, A General Method to Construct Oracles Realizing Given Relationships between Complexity Classes 1996 157 TCS Karpinski & Shparlinski, On some Approximation Problems Concerning Sparse Polynomials over Finite Fields 1996 157 TCS Levin, Computational Complexity of Functions 1996 157 TCS Shparlinski, On Finding Primitive Roots in Finite Fields 1996 157 TCS Verbitsky, Towards the Parallel Repetition Conjecture 1996 157 TCS Bronstein & Petkovsek, An Introduction to Randomization in Computational Geometry 1996 157 TCS Elihai & Yomdin, Flexible High-order Discretization of Geometric Data for Global Motion Planning 1996 157 TCS Grigoriev, NC Solving of a System of Linear Ordinary Differential Equations in Several Unknowns 1996 157 TCS Grigoriev & Karpinski, Computability of the Additive Complexity of Algebraic Circuits with Root Extracting 1996 157 TCS Laumond & Risler, Nonholonomic Systems: Controllability and Complexity 1996 157 TCS Ollagnier, Algorithms and Methods in Differential Algebra 1996 157 TCS Risler, A Bound for the Degree of Nonholonomy in the Plane 1996 156 TCS Nehlig, Applications Quasi Affines: Pavages par Images Reciproques 1996 156 TCS Kemp, Binary Search Trees Constructed from Nondistinct Keys with/without Specified Probabilities 1996 156 TCS Gyenizse & Vagvolgyi, Compositions of Deterministic Bottom-Up, Top-Down, and Regular Look-ahead Tree Transformations 1996 156 TCS Krause, Geometric Arguments Yield Better Bounds for Threshold Circuits and Distributed Computing 1996 156 TCS Bedon, Finite Automata and Ordinals 1996 156 TCS Louscou-Bozapalidou, Stochastically Costed Tree Automata: Turakainen's Theorem 1996 156 TCS Francon, Sur la Topologie d'un Plan Arithmetique 1996 156 TCS Schwartzbach, Static Correctness of Hierarchical Procedures 1996 156 TCS Forti & Honsell, A General Construction of Hyperuniverses 1996 156 TCS Takahashi, A Unified Constructive Network Model for Problem-Solving 1996 156 TCS Kim, New Values in Domineering 1996 156 TCS Terrier, Language Not Recognizable in Real Time by One-way Cellular Automata 1996 156 TCS Arnold & Castellani, An Algebraic Characterization of Observational Equivalence 1996 156 TCS Manzini, On the Ordering of Sparse Linear Systems 1996 156 TCS De Prisco & De Santis, New Lower Bounds on the Cost of Binary Search Trees 1996 155 TCS Antimirov, Partial Derivatives of Regular Expressions and Finite Automaton Constructions 1996 155 TCS Barcucci & Del Lungo & Nivat & Pinzani, Reconstructing Convex Polyominoes from Horizontal and Vertical Projections 1996 155 TCS Keller, Fast Rehashing in PRAM Emulations 1996 155 TCS Lange & Zeugmann & Kapur, Monotonic and Dual Monotonic Language Learning 1996 155 TCS Iwama & Iwamoto & Morshed, Time Lower Bounds Do Not Exist for CRCW PRAMs 1996 155 TCS Ehrenfeucht & ten Pas & Rozenberg, A Note on Binary Grammatical Codes of Trees 1996 155 TCS Berstel & Pin, Local Languages and the Berry-Sethi Algorithm 1996 155 TCS Hemaspaandra & Hoene & Ogihara, Reducibility Classes of P-Selective Sets 1996 155 TCS Bloom & Esik, Fixed-point Operations on ccc's. Part I 1996 155 TCS Sangiorgi, Locality and Interleaving Semantics in Calculi for Mobile Processes 1996 155 TCS Kamareddine & Nederpelt, A Useful lambda-Notation 1996 155 TCS Immerman & Patnaik & Stemple, The Expressiveness of a Family of Finite Set Languages 1996 155 TCS Fourneau & Gelenbe & Suros, G-Networks with Multiple Classes of Negative and Positive Customers 1996 155 TCS Kagan & Nerode & Subrahmanian, Computing Minimal Models by Partial Instantiation 1996 155 TCS Nielson & Nielson, From CML to its Process Algebra 1996 155 TCS Zhang, Quasi-prime Algebraic Domains 1996 155 TCS Bunder & Hindley, Two Beta-Equal lambda-l-terms with No Types in Common 1996 155 TCS Drakengren, Uniqueness of Scott's Reflexive Domain in P^omega 1996 155 TCS Zhang, Number of Models and Satisfiability of Sets of Clauses 1996 154 TCS Sureson, P, NP, Co-NP and Weak Systems of Arithmetic 1996 154 TCS Fiorio & Gustedt, Two Linear Time Union-Find Strategies for Image Processing 1996 154 TCS Mitrana & Paun & Rozenberg & Salomaa, Pattern Systems 1996 154 TCS Idury & Schaffer, Multiple Matching of Parameterized Patterns 1996 154 TCS Jaja & Ryu & Vishkin, Sorting Strings and Constructing Digital Search Trees in Parallel 1996 154 TCS Engelfriet & Harju & Proskurowski & Rozenberg, Characterization and Complexity of Uniformly Nonprimitive Labeled 2-Structures 1996 154 TCS Blundo & De Santis & Gargano & Vaccaro, On the Information Rate of Secret Sharing Schemes 1996 154 TCS Calude & Zimand, Effective Category and Measure in Abstract Complexity Theory 1996 154 TCS Lafaye de Micheaus & Rambaud, Confluence for Graph Transformations 1996 154 TCS Barua & Ramakrishnan, sigma-Game, sigma^+-Game and Two-dimensional Additive Cellular Automata 1996 154 TCS Hemaspaandra & Torenvliet, Optimal Advice 1996 154 TCS Ramesh & Srinivas, A Direct Characterization of Completion 1996 154 TCS Justin & Pirillo, On a Combinatorial Property of Sturmiam Words 1996 154 TCS Czumaj & Gibbons, Guthrie's Problem: New Equivalences and Rapid Reductions 1996 154 TCS Karpinski & Verbeek, On Randomized versus Deterministic Computation 1996 154 TCS Jaromczyk & Swiatek, A Theory of Even Functionals and their Algorithmic Applications 1996 154 TCS Cohen & Fredman, Products of Finite State Machines with Full Coverage 1996 154 TCS Ebinger & Muscholl, Logical Definability on Infinite Traces 1996 154 TCS Wilke, An Algebraic Characterization of Frontier Testable Tree Languages 1996 154 TCS Jategaonkar & Meyer, Deciding True Concurrency Equivalences on Safe, Finite Nets 1996 153 TCS Petri, Nets, Time and Space 1996 153 TCS Desel & Neuendorf & Radola, Proving Nonreachability by Modulo-Invariants 1996 153 TCS Engelfriet, A Multiset Semantics for the Pi-Calculus with Replication 1996 153 TCS Esparza & Bruns, Trapping Mutual Exclusion in the Box Calculus 1996 153 TCS Hoogers & Kleijn & Thiagarajan, An Event Structure Semantics for General Petri Nets 1996 153 TCS Meseguer & Montanari & Sassone, Process versus Unfolding Semantics for Place/Transition Petri Nets 1996 153 TCS Nielsen & Winskel, Petri Nets and Bisimulation 1996 153 TCS Smith, On the Border of Causality: Contact and Confusion 1996 153 TCS Teruel & Silva, Structure Theory of Equal Conflict Systems 1995 152 TCS Benveniste & Levy & Fabre & Le Guernic, A Calculus of Stochastic Systems for the Specification, Simulation, and Hidden State Estimation of Mixed Stochastic/Non-stochastic Systems 1995 152 TCS Seidel, Probabilistic Communicating Processes 1995 152 TCS Aceto & Jeffrey, A Complete Axiomatization of Timed Bisimulation for a Class of Timed Regular Behaviours 1995 152 TCS Verma, Transformations and Confluence for Rewrite Systems 1995 152 TCS Inverardi & Nesi, Infinite Normal Forms for Non-linear Term Rewriting Systems 1995 152 TCS Banach, Locating the Contractum in the Double Pushout Approach 1995 152 TCS Mislove & Nivat & Papadimitriou, Editorial on the Electronic Notes in Theoretical Computer Science 1995 152 TCS Fredholm, Intensional Aspects of Function Definitions 1995 152 TCS Hodges, The Meaning of Specifications I: Domains and Initial Models 1995 152 TCS Astesiano & Cerioli, Free Objects and Equational Deduction for Partial Conditional Specifications 1995 152 TCS Kurihara & Ohuchi, Modularity in Noncopying Term Rewriting 1995 151 TCS Castagna, A Meta-language for Typed Object-oriented Languages 1995 151 TCS Ait-Kaci & Garrigue, Label-Selective lambda-Calculus Syntax and Confluence 1995 151 TCS van Bakel, Intersection Type Assignment Systems 1995 151 TCS Honda & Yoshida, On Reduction-based Process Semantics 1995 151 TCS Rao, Modular Proofs for Completeness of Hierarchical Term Rewriting Systems 1995 151 TCS Ambler & Kwiatkowska & Measor, Duality and the Completeness of the Modal mu-Calculus 1995 151 TCS Arnold, A Topological Property of Rational omega-Languages 1995 151 TCS De Boer & Di Pierro & Palamidessi, Nondeterminism and Infinite Computations in Constraint Programming 1995 151 TCS Bonsangue & Jacobs & Kok, Duality beyond Sober Spaces: Topological Spaces and Observation Frames 1995 151 TCS Courcelle, The Monadic Second-Order Logic of Graphs IX: Machines and their Behaviours 1995 151 TCS Edalat, Domain Theory and Integration 1995 151 TCS Matthews, An Extensional Treatment of Lazy Data Flow Deadlock 1995 151 TCS Mislove & Oles, Full Abstraction and Recursion 1995 151 TCS Smyth, Semi-metrics, Closure Spaces and Digital Topology 1995 151 TCS Sunderhauf, A Faithful Computational Model of the Real Numbers 1995 150 TCS Hazewinkel, Editorial to the Subject Index Volumes 101-150 1995 150 TCS Ausiello & Crescenzi & Protasi, Approximate Solution of NP Optimization Problems 1995 150 TCS Adamek & Koubek, On the Greatest Fixed Point of a Set Functor 1995 150 TCS Droste, Recognizable Languages in Concurrency Monoids 1995 150 TCS Naumann, Predicate Transformers and Higher-Order Programs 1995 150 TCS Gardiner, Algebraic Proofs of Consistency and Completeness 1995 149 TCS Brogi & Turini, Fully Abstract Compositional Semantics for an Algebra of Logic Programs 1995 149 TCS Costantini, Contributions to the Stable Model Semantics of Logic Programs with Negation 1995 149 TCS Abraham, On Interprocess Communication and the Implementation of a Multi-writer Atomic Register 1995 149 TCS Montanari & Yankelevich, Location Equivalence in a Parametric Setting 1995 149 TCS Desharnais & Belkhiter & Sghaier & Tchier & Jaoua & Mili & Zaguia, Embedding a Demonic Semilattice in a Relation Algebra 1995 149 TCS Schmidt-Schauss & Marchiori & Panitz, Modular Termination of r-Consistent and Left-Linear Term Rewriting Systems 1995 149 TCS Buneman & Naqvi & Tannen & Wong, Principles of Programming with Complex Objects and Collection Types 1995 149 TCS Van den Bussche & Van Gucht, The Expressive Power of Cardinality-Bounded Set Values in Object-Based Data Models 1995 149 TCS Grumbach & Tollu, On the Expressive Power of Counting 1995 149 TCS Abiteboul & Vardi & Vianu, Computing with Infinitary Logic 1995 149 TCS Kivinen & Mannila, Approximate Inference of Functional Dependencies from Relations 1995 149 TCS Fekete & Lynch & Weihl, Hybrid Atomicity for Nested Transactions 1995 149 TCS Wong & Agrawal, Context-Specific Synchronization for Atomic Data Types in Object-Based Databases 1995 148 TCS Alvarez & Jenner, On Adaptive DLOGTIME and POLYLOGTIME Reductions 1995 148 TCS Borchert, On the Acceptance Power of Regular Languages 1995 148 TCS Bruyere & De Felice & Guaiana, On Some Decision Problems for Trace Codings 1995 148 TCS Etessami & Immerman, Reachability and the Power of Local Ordering 1995 148 TCS Jancar, Undecidability of Bisimilarity for Petri Nets and Some Related Problems 1995 148 TCS Laroussinie & Schnoebelen, A Hierarchy of Temporal Logics with Past 1995 148 TCS Naik & Regan & Sivakumar, On Quasilinear-Time Complexity Theory 1995 148 TCS Diamond & Kloeden & Kozyakin & Pokrovskii, On the Fragmentary Complexity of Symbolic Sequences 1995 148 TCS Durand, A Random NP-complete Problem for Inversion of 2D Cellular Automata 1995 148 TCS Cai & Chen, On Input Read-Modes of Alternating Turing Machines 1995 148 TCS Shoudai & Miyano, Using Maximal Independent Sets to Solve Problems in Parallel 1995 148 TCS Kumar & Garg, Extremal Solutions of Inequations over Lattices with Applications to Supervisory Control 1995 148 TCS Bodlaender & Jansen, Restrictions of Graph Partition Problems. Part I 1995 148 TCS Althofer & Bultermann, Superlinear Period Lengths in Some Subtraction Games 1995 148 TCS Arnold, An Initial Semantics for the mu-Calculus on Trees and Rabin's Complementation Theorem 1995 148 TCS Dubhashi & Pantziou & Spirakis & Zaroliagis, The Fourth Moment in Luby's Distribution 1995 148 TCS Kimber & Long, On-line Learning of Smooth Functions of a Single Variable 1995 148 TCS Morita, Reversible Simulation of One-dimensional Irreversible Cellular Automata 1995 148 TCS Zwick, The Smallest Networks on which the Ford-Fulkerson Maximum Flow Procedure May Fail to Terminate 1995 148 TCS Pinotti & Pucci, Parallel Algorithms for Priority Queue Operations 1995 147 TCS Bampis & Konig & Trystram, Optimal Parallel Execution of Complete Binary Trees and Grids into Most Popular Interconnection Networks 1995 147 TCS Gasieniec & Plandowski & Rytter, The Zooming Methods: A Recursive Approach to Time-Space Efficient String-Matching 1995 147 TCS Bodlaender & Downey & Fellows & Wareham, The Parameterized Complexity of Sequence Alignment and Consensus 1995 147 TCS Sureson, NP != Co-NP and Models of Arithmetic 1995 147 TCS Jansen & Muller, The Minimum Broadcast Time Problem for Several Processor Networks 1995 147 TCS Nishida, Quasi-deterministic 0L Systems and their Representation 1995 147 TCS Cheng & Esparza & Palsberg, Complexity Results for 1-Safe Nets 1995 147 TCS Zimand, On the Topological Size of p-m-Complete Degrees 1995 147 TCS Schurz, Most General First Order Theorems are not Recursively Enumerable 1995 147 TCS Aigrain & Beaquier, Polyomino Tilings, Cellular Automata and Codicity 1995 147 TCS Amaldi & Kann, The Complexity and Approximability of Finding Maximum Feasible Subsystems of Linear Relations 1995 147 TCS Arques & Grange, A Fast Scan-Line Algorithm for Topological Filling of Well-nested Objects in 2.5D Digital Pictures 1995 147 TCS Yu & Chen, Efficient Parallel Algorithms for Doubly Convex-Bipartite Graphs 1995 147 TCS Blot & Fernandez de la Vega & Paschos & Saad, Average Case Analysis of Greedy Algorithms for Optimisation Problems on Set Systems 1995 146 TCS Alimohamed, A Characterization of Lambda Definability in Categorical Models of Implicit Polymorphism 1995 146 TCS Bloom, Structural Operational Semantics for Weak Bisimulations 1995 146 TCS Ariola & Arvind, Properties of a First-Order Functional Language with Sharing 1995 146 TCS Cassez & roux, Compilation of the ELECTRE Reactive Language into Finite Transition Systems 1995 146 TCS Kemp & Srivastava & Stuckey, Bottom-Up Evaluation and Query Optimization of Well-Founded Models 1995 146 TCS Berghammer & Elbl & Schmerl, Formalizing Dijkstra's Predicate Transformer wp in Weak Second-Order Logic 1995 146 TCS Bonacina & Hsiang, Towards a Foundation of Completion Procedures as Semidecision Procedures 1995 146 TCS Backofen & Smolka, A Complete and Recursive Feature Theory 1995 146 TCS Naughton & Ramakrishnan & Sagiv & Ullman, Argument Reduction by Factoring 1995 146 TCS Alessi & Baldan & Belle, A Fixed-Point Theorem in a Category of Compact Metric Spaces 1995 146 TCS Kobayashi, A Finitely Presented Monoid Which Has Solvable Word Problem But Has No Regular Complete Presentation 1995 146 TCS Zhang, On Maximal Stable Functions 1995 146 TCS Ingolfsdottir, Late and Early Semantics Coincide for Testing 1995 145 TCS Braga & Cattaneo & Flocchini & Vogliotti, Pattern Growth in Elementary Cellular Automata 1995 145 TCS Srikrishna & Rangan, Optimal Parallel Algorithms for Path Problems on Planar Graphs 1995 145 TCS Breitbart & Hunt & Rosenkrantz, On the Size of Binary Decision Diagrams Representing Boolean Functions 1995 145 TCS Leiss, Implicit Language Equations: Existence and Uniqueness of Solutions 1995 145 TCS Diks & Kranakis & Malinowski & Pelc, Anonymous Wireless Rings 1995 145 TCS Creignou, The Class of Problems That are Linearly Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness 1995 145 TCS Stewart, Complete Problems for Monotone NP 1995 145 TCS Drewes & Habel & Kreowski & Taubenberger, Generating Self-Affine Fractals by Collage Grammars 1995 145 TCS Cai & Paige, Using Multiset Discrimination to Solve Language Processing Problems without Hashing 1995 145 TCS Reutenauer & Schutzenberger, Varietes et Fonctions Rationnelles 1995 145 TCS Ko, A Polynomial-Time Computable Curve Whose Interior Has a Nonrecursive Measure 1995 145 TCS Biran & Moran & Zaks, Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks 1995 145 TCS Ginsburg & Tanaka, Interval Queries on Object Histories 1995 145 TCS Middendorf, On Finding Various Minimal, Maximal, and Consistent Sequences over a Binary Alphabet 1995 145 TCS Jamison & Olariu, A Linear-Time Recognition Algorithm for P_4-Reducible Graphs 1995 145 TCS Zhang & Shen, Completion of Recognizable Bifix Codes 1995 145 TCS Benson, A Space Efficient Algorithm for Finding the Best Nonoverlapping Alignment Score 1995 145 TCS Hemaspaandra & Jiang, P-Selectivity: Intersections and Indices 1995 145 TCS Teng, Independent Sets versus Perfect Matchings 1995 145 TCS Maler, A Decomposition Theorem for Probabilistic Transition Systems 1995 144 TCS Flajolet & Gourdon & Dumas, Mellin Transforms and Asymptotics: Harmonic Sums 1995 144 TCS Bergeron & Sattler, Constructible Differentially Finite Algebraic Series in Several Variables 1995 144 TCS Drmota & Soria, Marking in Combinatorial Constructions: Generating Functions and Limiting Distributions 1995 144 TCS Flajolet & Sedgewick, Mellin Transforms and Asymptotics: Finite Differences and Rice's Integrals 1995 144 TCS Gardy & Louchard, Dynamic Analysis of Some Relational Databases Parameters 1995 144 TCS Jacquet & Szpankowski, Asymptotic Behaviour of the Lempel-Ziv Parsing Scheme in Digital Search Trees 1995 144 TCS Kirschenhofer & Martinez & Prodinger, Analysis of an Optimized Search Algorithm for Skip Lists 1995 144 TCS Mahmoud & Smythe, Probabilistic Analysis of Bucket Recursive Trees 1995 144 TCS Schachinger, On the Variance of a Class of Inductive Valuations of Data Structures for Digital Search 1995 144 TCS Schmid, Random Trees in Queueing Systems with Deadlines 1995 143 TCS Malgouyres, Graphs Generalizing Closed Curves with Linear Construction of the Hamiltonian Cycle. Parametrization of Discretized Curves 1995 143 TCS Matamala, Recursive Construction of Periodic Steady State for Neural Networks 1995 143 TCS Harrison, Dynamical Properties of PWD0L Systems 1995 143 TCS Slutzki & Vagvolgyi, Deterministic Top-Down Tree Transducers with Iterated Look-ahead 1995 143 TCS Chen, The Maximal f-Dependent Set Problem for Planar Graphs is in NC 1995 143 TCS Fraenkel & Jaffray & Kotzig & Sabidussi, Modular Nim 1995 143 TCS Gubas & Hromkovic & Waczulik, A Nonlinear Lower Bound on the Practical Combinational Complexity 1995 143 TCS Rytter, Context-free Recognition via Shortest Paths Computation: A Version of Valiant's Algorithm 1995 143 TCS Zhang, On the Approximation of Longest Common Nonsupersequences and Shortest Common Nonsubsequences 1995 143 TCS Van & Le Saec & Litovsky, Characterizations of Rational omega-Languages by Means of Right Congruences 1995 143 TCS Krithivasan & Mahajan, Nondeterministic, Probabilistic and Alternating Computations on Cellular Array Models 1995 143 TCS Antimirov & Mosses, Rewriting Extended Regular Expressions 1995 143 TCS Bender & Gastaldo & Morvan, Parallel Interval Order Recognition and Construction of Interval Representations 1995 143 TCS Goldstein & Reingold, The Complexity of Pursuit on a Graph 1995 143 TCS Jiang & Timkovsky, Shortest Consistent Superstrings Computable in Polynomial Time 1995 143 TCS Ito & Inoue & Takanami & Wang, Optimal Simulation of Two-dimensional Alternating Finite Automata by Three-way Nondeterministic Turing Machines 1995 143 TCS Jiang & Wang & Zhang, Alignment of Trees -- An Alternative to Tree Edit 1995 143 TCS Juedes & Lutz, Weak Completeness in E and E2 1995 143 TCS Crescenzi & Papadimitriou, Reversible Simulation of Space-bounded Computations 1995 143 TCS Miltersen, On the Cell Probe Complexity of Polynomial Evaluation 1995 143 TCS De Prisco & Parlati & Persiano, Minimal Path Length of Trees with Known Fringe 1995 142 TCS Lynch & Snyder, Redundancy Criteria for Constrained Completion 1995 142 TCS Dershowitz & Hoot, Natural Termination 1995 142 TCS Rubio & Nieuwenhuis, A Total AC-compatible Ordering Based on RPO 1995 142 TCS Baader & Schulz, Combination Techniques and Decision Problems for Disunification 1995 142 TCS Senizergues, Some Undecidable Termination Problems for Semi-Thue Systems 1995 142 TCS Asperti & Laneve, Paths, Computations and Labels in the lambda-Calculus 1995 142 TCS Gallier, Proving Properties of Typed lambda-Terms Using Realizability, Covers, and Sheaves 1995 142 TCS Aasa, Precedences in Specifications and Implementations of Programming Languages 1995 142 TCS Alpuente & Falaschi & Levi, Incremental Constraint Satisfaction for Equational Logic Programming 1995 142 TCS Loogen & Winkler, Dynamic Detection of Determinism in Functional Logic Languages 1995 142 TCS Proietti & Pettorossi, Unfolding-Definition-Folding, in this Order, for Avoiding Unnecessary Variables in Logic Programs 1995 142 TCS Nilsson, Abstract Interpretation: A Kind of Magic 1995 141 TCS Johansen, On-line String Matching with Feedback 1995 141 TCS Muller & Schupp, Simulating Alternating Tree Automata by Nondeterministic Automata: New Results and New Proofs of the Theorems of Rabin, McNaughton and Safra 1995 141 TCS Downey & Fellows, Fixed-Parameter Tractability and Completeness II: On Completeness for W[1] 1995 141 TCS Yao, Algebraic Decision Trees and Euler Characteristics 1995 141 TCS Kapur & Bilardi, Language Learning without Overgeneralization 1995 141 TCS Apostolico & Breslauer & Galil, Parallel Detection of all Palindromes in a String 1995 141 TCS Jenner & Toran, Computing Functions with Parallel Queries to NP 1995 141 TCS Gorrieri & Montanari, On the Implementation of Concurrent Calculi in Net Calculi: Two Case Studies 1995 141 TCS Kari & Mateescu & Paun & Salomaa, Multi-pattern Languages 1995 141 TCS Hastad & Razborov & Yao, On the Shrinkage Exponent for Read-Once Formulae 1995 141 TCS Sieling & Wegener, Graph Driven BDDs -- A New Data Structure for Boolean Functions 1995 141 TCS Mizoguchi & Kawahara, Relational Graph Rewritings 1995 141 TCS Petersen, A Remark on a Paper by A. B. Matos 1995 141 TCS Terrier, On Real Time One-Way Cellular Array 1995 141 TCS Dessmark & Lingas & Maheshwari, Multi-list Layering: Complexity and Applications 1995 141 TCS Justin & Pirillo, On a Question about Factorization Forests 1995 140 TCS Dattasharma & Keerthi, An Augmented Voronoi Roadmap for 3D Translational Motion Planning for a Convex Polyhedron Moving amidst Convex Polyhedral Obstacles 1995 140 TCS Sarrafzadeh & Maddila, Discrete Warehouse Problem 1995 140 TCS Prasad & Iyengar, A Note on the Combinatorial Structure of the Visibility Graph in Simple Polygons 1995 140 TCS Rao, On Fast Planning of Suboptimal Paths amidst Polygonal Obstacles in Plane 1995 140 TCS Sridhar & Han & Chandrasekharan, Efficient Algorithms for Shortest Distance Queries on Special Classes of Polygons 1995 140 TCS De Berg & Guibas & Halperin & Overmars & Schwarzkopf & Sharir & Teillaud, Reaching a Goal with Directional Uncertainty 1995 140 TCS Seetharaman, A Simplified Design Strategy for Mapping Image Processing Algorithms on a SIMD Torus 1995 140 TCS Bettayeb, On the k-ary Hypercube 1995 140 TCS Pigozzi & Salibra, Lambda Abstraction Algebras: Representation Theorems 1995 140 TCS Laroussinie & Pinchinat & Schnoebelen, Translations between Modal Logics of Reactive Systems 1995 140 TCS Gorrieri & Roccetti & Stancampiano, A Theory of Processes with Durational Actions 1995 140 TCS Mokkedem & Mery, On Using Temporal Logic for Refinement and Compositional Verification 1995 140 TCS Navarro & Orejas & Sanchez, On the Correctness of Modular Systems 1995 140 TCS Wagner, On the Role of Memory in Object-based and Object-oriented Languages 1995 139 TCS Hodkinson, On Gabbay's Temporal Fixed Point Operator 1995 139 TCS Pappinghaus, On the Logic of UNITY 1995 139 TCS Cockett & Spencer, Strong Categorical Datatypes II: A Term Logic for Categorical Programming 1995 139 TCS Barr, Nonsymmetric *-Autonomous Categories 1995 139 TCS Ghelli, Divergence of F_{<=} Type Checking 1995 139 TCS Bergeron, Sharing Out Control in Distributed Processes 1995 139 TCS Malacaria, Studying Equivalences of Transition Systems with Algebraic Tools 1995 139 TCS Dougherty & Johann, A Combinatory Approach to Higher-Order E-Unification 1995 139 TCS Moschovakis, Computable Concurrent Processes 1995 139 TCS Bernot & Bidoit & Knapik, Observational Specifications and the Indistinguishability Assumption 1995 139 TCS Inverardi & Nesi, Deciding Observational Congruence of Finite-State CCS Expressions by Rewriting 1995 139 TCS Weiermann, Termination Proofs for Term Rewriting Systems by Lexicographic Path Orderings Imply Multiply Recursive Derivation Lengths 1995 138 TCS Davies & Schneider, A Brief History of Timed CSP 1995 138 TCS Mislove & Roscoe & Schneider, Fixed Points without Completeness 1995 138 TCS Lowe, Probabilistic and Prioritized Models of Timed CSP 1995 138 TCS Hennessy & Lin, Symbolic Bisimulations 1995 138 TCS De Nicola & Segal, A Process Algebraic View of Input/Output Automata 1995 138 TCS Pinna & Poigne, On the Nature of Events: Another Perspective in Concurrency 1995 138 TCS Alur & Courcoubetis & Halbwachs & Henzinger & Ho & Nicollin & Olivero & Sifakis & Yovine, The Algorithmic Analysis of Hybrid Systems 1995 138 TCS Asarin & Maler & Pnueli, Reachability Analysis of Dynamical Systems Having Piecewise-Constant Derivatives 1995 138 TCS Branicky, Universal Computation and Other Capabilities of Hybrid and Continuous Dynamical Systems 1995 138 TCS Grossman & Larson, An Algebraic Approach to Hybrid Systems 1995 138 TCS Hansen & Pandya & Chaochen, Finite Divergence 1995 138 TCS Kohn & Nerode & Remmel & Yakhnis, Viability in Hybrid Systems 1995 138 TCS Lakhneche & Hooman, Metric Temporal Logic with Durations 1995 138 TCS Lemmon & Antsaklis, Inductively Inferring Valid Logical Models of Continuous-State Dynamical Systems 1995 138 TCS Zhang & Mackworth, Constraint Nets: A Semantic Model for Hybrid Dynamic Systems 1995 137 TCS Fernau, Valuations of Languages, with Applications to Fractal Geometry 1995 137 TCS Fabre, Substitutions et beta-Systemes de Numeration 1995 137 TCS Esik & Bernatsky, Equational Properties of Kleene Algebras of Relations with Conversion 1995 137 TCS Takahashi & Ueno & Kajitani, Mixed Searching and Proper-Path-Width 1995 137 TCS Breslauer, Fast Parallel String Prefix-Matching 1995 137 TCS Arvind & Kobler & Schoning & Schuler, If NP Has Polynomial-Size Circuits then MA=AM 1995 137 TCS Hagiya, A Typed lambda-Calculus for Proving-by-Example and Bottom-Up Generalization Procedure 1995 137 TCS Jantke & Lange, Case-based Representation and Learning of Pattern Languages 1995 137 TCS Mukouchi & Arikawa, Towards a Mathematical Theory of Machine Discovery from Facts 1995 137 TCS Jain & Sharma, On Aggregating Teams of Learning Machines 1995 137 TCS Sakurai, On the VC-Dimension of Depth Four Threshold Circuits and the Complexity of Boolean-valued Functions 1995 137 TCS Shinohara, Complexity of Computing Vapnik-Chervonenkis Dimension and Some Generalized Dimensions 1995 137 TCS Hasegawa & Imai & Ishiguro, epsilon-Approximations of k-Label Spaces 1995 137 TCS Nakamura & Abe, Exact Learning of Linear Combinations of Monotone Terms from Function Value Queries 1994 136 TCS Remilia, Recognition of Graphs by Automata 1994 136 TCS Ohlebusch, On the Modularity of Termination of Term Rewriting Systems 1994 136 TCS De Luca & Mignosi, Some Combinatorial Properties of Sturmian Words 1994 136 TCS Senoussi & Saoudi, A Quadtree Algorithm for Template Matching on a Pyramid Computer 1994 136 TCS Stetsenko, On ``Almost Bad'' Boolean Bases 1994 136 TCS Ito & Thierrin, Congruences, Infix and Cohesive Prefix Codes 1994 136 TCS Mayordomo, Almost Every Set in Exponential Time is P-Bi-Immune 1994 136 TCS Chrobak & Rytter, Two Results on Linear Embeddings on Complete Binary Trees 1994 136 TCS Kiwi & Ndoundam & Tchuente & Goles, No Polynomial Bound for the Period of the Parallel Chip Firing Game on Graphs 1994 136 TCS Johnstone, Variations on the Bagdomain Theme 1994 136 TCS Heckmann, Stable Power Domains 1994 136 TCS Fiech & Huth, Algebraic Domains of Natural Transformations 1994 136 TCS Melton & Schroder & Strecker, Lagois Connections -- A Counterpart to Galois Connections 1994 136 TCS Mulry, Partial Map Classifiers and Partial Cartesian Closed Categories 1994 136 TCS Ritter, Categorical Abstract Machines for Higher-order Typed lambda-Calculi 1994 136 TCS Robinson, Parametricity as Isomorphism 1994 136 TCS kamareddine & Nederpelt, A Unified Approach to Type Theory through a Refined lambda-Calculus 1994 136 TCS Crole, Computational Adequacy of the FIX-Logic 1994 136 TCS Blaaberg & Clausen, Adequacy for a Lazy Functional Language with Recursive and Polymorphic Types 1994 136 TCS Wolfram, A Semantics for lambdaProlog 1994 135 TCS Baier & Majster-Cederbaum, Denotational Semantics in the cpo and Metric Approach 1994 135 TCS Ehrig & Grosse-Rhode, Functorial Theory of Parameterized Specifications in a General Specification Framework 1994 135 TCS Lastovetsky & Gaissaryan, An Algebraic Approach to Semantics of Programming Languages 1994 135 TCS Bracho & Droste, Labelled Domains and Automata with Concurrency 1994 135 TCS Manoury & Simonot, Automatizing Termination Proofs of Recursively Defined Functions 1994 135 TCS Scott, Weights for Total Division Orderings on Strings 1994 135 TCS Hiraishi, Some Complexity Results on Transition Systems and Elementary Net Systems 1994 135 TCS Suzuki & Yamashita, Fair Petri Nets and Structural Induction for Rings of Processes 1994 135 TCS Trigg & Hindley & Bunder, Combinatory Abstraction Using B, B' and Friends 1994 135 TCS David, The Inf Function in the System F 1994 135 TCS Abramsky, Proofs as Processes 1994 135 TCS Bellin & Scott, On the pi-Calculus and Linear Logic 1994 135 TCS Galmiche & Perrier, On Proof Normalization in Linear Logic 1994 135 TCS Mascari & Pedicini, Head Linear Reduction and Pure Proof Net Extraction 1994 135 TCS Lincoln & Scedrov, First-order Linear Logic without Modalities is NEXPTIME-Hard 1994 135 TCS Lincoln & Winkler, Constant-only Multiplicative Linear Logic is NP-Complete 1994 134 TCS Kobler, Locating P/poly Optimally in the Extended Low Hierarchy 1994 134 TCS Chan, Testing Satisfiability of a Class of Object-oriented Conjunctive Queries 1994 134 TCS Fulop, Undecidable Properties of Deterministic Top-Down Tree Transducers 1994 134 TCS Kaminski & Francez, Finite-Memory Automata 1994 134 TCS Tiplea & Ene & Lonesco & Procopiuc, Some Decision Problems for Parallel Communicating Grammar Systems 1994 134 TCS Durand, Inversion of 2D Cellular Automata: Some Complexity Results 1994 134 TCS Harju & Kleijn & Latteux & Terlutte, Representation of Rational Functions with Prefix and Suffix Codings 1994 134 TCS Remila, On the Tiling of a Torus with Two Bars 1994 134 TCS Mak, Speedup of Determinism by Alternation for Multidimensional Turing Machines 1994 134 TCS Matus, Stochastic Independence, Algebraic Independence and Abstract Connectedness 1994 134 TCS Jiang & Li, Approximating Shortest Superstrings with Constraints 1994 134 TCS Dahlhaus & Karpinski, An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO) of an Arbitrary Graph 1994 134 TCS Alonso, Uniform Generation of a Motzkin Word 1994 134 TCS Harrison, Morphic Congruences and D0L Languages 1994 134 TCS Fortnow & Rompel & Sipser, On the Power of Multi-prover Interactive Protocols 1994 134 TCS Gu & Zhu, Asymptotic Optimal HEAPSORT Algorithm 1994 134 TCS Anderson, Semiretracts of a Free Monoid 1994 134 TCS Beauquier & Podelski, Rabin Tree Automata and Finite Monoids 1994 134 TCS Bonnier-Rigny & Krob, A Complete System of Identities for One-Letter Rational Expressions with Multiplicities in the Tropical Semiring 1994 134 TCS Botelho & Garzon, Boolean Neural Nets are Observable 1994 134 TCS Capocelli & Gargano & Vaccaro, A Fast Algorithm for the Unique Decipherability of Multivalued Encodings 1994 134 TCS Crvenkovic & Madarasz, On Dynamic Algebras 1994 134 TCS Diekert, A Partial Trace Semantics for Petri Nets 1994 134 TCS Jurgensen & Salomaa & Yu, Transducers and the Decidability of Independence in Free Monoids 1994 134 TCS Kelemenova & Csuhaj-Varju, Languages of Colonies 1994 134 TCS Mora, An Introduction to Commutative and Non-commutative Grobner Bases 1994 134 TCS Otto & Narendran, Codes Modulo Finite Monadic String-Rewriting Systems 1994 134 TCS Reilly, Bounds on the Variety Generated by Completely Regular Syntactic Monoids from Finite Prefix Codes 1994 134 TCS Spehner, A Bijection between Cliques in Graphs and Factorizations in Free Monoids 1994 134 TCS Weber, Finite-valued Distance Automata 1994 134 TCS Weber, Exponential Upper and Lower Bounds for the Order of a Regular Language 1994 133 TCS Bonner & Kifer, An Overview of Transaction Logic 1994 133 TCS Dong & Lakshmanan, Intuitionistic Interpretation of Deductive Databases with Incomplete Information 1994 133 TCS Kapur & Nie & Musser, An Overview of the Tecton Proof System 1994 133 TCS Ramanathan, Refinement of Events in the Development of Real-time Distributed Systems 1994 133 TCS Han, Towards Efficient Induction Mechanisms in Database Systems 1994 133 TCS Godin & Missaoui, An Incremental Concept Formation Approach for Learning from Databases 1994 133 TCS Sadri, Aggregate Operations in the Information Source Tracking Method 1994 133 TCS Cucker & Shub & Smale, Separation of Complexity Classes in Koiran's Weak Model 1994 133 TCS Emerson, Relativizations of the P =? NP Question over the Reals (and Other Ordered Rings) 1994 133 TCS Grigoriev, Deviation Theorems for Solutions of Differential Equations and Applications to Lower Bounds on Parallel Complexity of Sigmoids 1994 133 TCS Koiran, Computing over the Reals with Addition and Order 1994 133 TCS Kurka, Regular Unimodal Systems and Factors of Finite Automata 1994 133 TCS Malajovich, On Generalized Newton Algorithms: Quadratic Convergence, Path-Following and Error Analysis 1994 133 TCS Meer, On the Complexity of Quadratic Programming in Real Number Models of Computation 1994 133 TCS Michaux, P != NP over the Nonstandard Reals implies P != NP over R 1994 133 TCS Rojas, A Convex Geometric Approach to Counting the Roots of a Polynomial System 1994 133 TCS Shub & Smale, Complexity of Bezout's Theorem V: Polynomial Time 1994 133 TCS Verschelde & Haegemans, Homotopies for Solving Polynomial Systems within a Bounded Domain 1994 132 TCS Flajolet & Zimmerman & Van Cutsem, A Calculus for the Random Generation of Labelled Combinatorial Structures 1994 132 TCS Juedes & Lathrop & Lutz, Computational Depth and Reducibility 1994 132 TCS Leiss, Unrestricted Complementation in Language Equations over a One-Letter Alphabet 1994 132 TCS Kim, Retreat Bounded Picture Languages 1994 132 TCS Koiran & Cosnard & Garzon, Computability with Low-dimensional Dynamical Systems 1994 132 TCS Kari, On Language Equations with Invertible Operations 1994 132 TCS Bonizzoni, Primitive 2-Structures with the (n-2)-Property 1994 132 TCS Pighizzini, Asynchronous Automata versus Asynchronous Cellular Automata 1994 132 TCS Ehrenfeucht & McConnell, A k-Structure Generalization of the Theory of 2-Structures 1994 132 TCS Ambos-Spies & Homer & Soare, Minimal Pairs and Complete Problems 1994 132 TCS Birget & Stephen, Formal Languages Defined by Uniform Substitutions 1994 132 TCS Roka, One-Way Cellular Automata on Cayley Graphs 1994 132 TCS De Santis & Di Crescenzo & Persiano, The Knowledge Complexity of Quadratic Residuosity Language 1994 132 TCS Hromkovic & Rovan & Slobodova, Deterministic versus Nondeterministic Space in Terms of Synchronized Alternating Machines 1994 132 TCS Diestel & Leader, Domination Games on Infinite Graphs 1994 132 TCS Shufelt & Berliner, Generating Hamiltonian Circuits without Backtracking from Errors 1994 132 TCS Ben-Amram, Unit-Cost Pointers versus Logarithmic-Cost Addresses 1994 132 TCS Bridges & Calude, On Recursive Bounds for the Exceptional Values in Speed-up 1994 132 TCS Lescanne, On Termination of One Rule Rewrite Systems 1994 132 TCS Crochemore & Rytter, On Two-dimensional Pattern Matching by Optimal Parallel Algorithms 1994 132 TCS Berstel & Pocchiola, Average Cost of Duval's Algorithm for Generating Lyndon Words 1994 132 TCS Ilie, On a Conjecture about Slender Context-free Languages 1994 132 TCS Duris & Rolim, A Note on the Density of Oracle Decreasing Time-Space Complexity 1994 131 TCS Etzion-Petruschka & Harel & Myers, On the Solvability of Domino Snake Problems 1994 131 TCS Squier & Otto & Kobayashi, A Finiteness Condition for Rewriting Systems 1994 131 TCS Idury & Schaffer, Dynamic Dictionary Matching with Failure Functions 1994 131 TCS Leiss, Language Equations over a One-Letter Alphabet with Union, Concatenation and Star: A Complete Solution 1994 131 TCS Siegelmann & Sontag, Analog Computation via Neural Networks 1994 131 TCS Eades & Whitesides, Drawing Graphs in Two Layers 1994 131 TCS Gardy, Join Sizes, Urn Models, and Normal Limiting Distributions 1994 131 TCS Spencer, Randomization, Derandomization and Antirandomization: Three Games 1994 131 TCS Eriksson, Reachability is Decidable in the Numbers Game 1994 131 TCS Huynh & Tian, A Note on the Complexity of Deciding Bisimilarity of Normed Unary Processes 1994 131 TCS Bergey & Cori, On the Orbits of a Product of Two Permutations 1994 131 TCS Picouleau, Complexity of the Hamiltonian Cycle in Regular Graph Problem 1994 131 TCS Anderson & Manley, A Matrix Extension of Winograd's Inner Product Algorithm 1994 131 TCS Murray & Rosenthal, On the Relative Merits of Path Dissolution and the Method of Analytic Tableaux 1994 131 TCS Banach, Term Graph Rewriting and Garbage Collection Using Opfibrations 1994 131 TCS Compton, Stratified Least Fixpoint Logic 1994 131 TCS Kobayashi & Tatsuta, Realizability Interpretation of Generalized Inductive Definitions 1994 131 TCS Fix & Francez & Grumberg, Program Composition via Unification 1994 131 TCS Aceto, GSOS and Finite Labelled Transition Systems 1994 131 TCS Mathieu & Delahaye, A Kind of Logical Compilation for Knowledge Bases 1994 131 TCS Scholefield & Zedan & Jifeng, A Specification-oriented Semantics for the Refinement of Real-time Systems 1994 130 TCS Uspensky, Godel's Incompleteness Theorem 1994 130 TCS Woeginger, On-line Scheduling of Jobs with Fixed Start and End Times 1994 130 TCS Motwani & Phillips & Torng, Nonclairvoyant Scheduling 1994 130 TCS Feldmann & Sgall & Teng, Dynamic Scheduling on Parallel Machines 1994 130 TCS Azar & Broder & Karlin, On-line Load Balancing 1994 130 TCS Fiat & Ricklin, Competitive Algorithms for the Weighted Server Problem 1994 130 TCS d'Amore & Liberatore, The List Update Problem and the Retrieval of Sets 1994 130 TCS Kalyanasundaram & Pruhs, Constructing Competitive Tours from Local Information 1994 130 TCS Hershberger & Rauch & Suri, Data Structures for Two-Edge Connectivity in Planar Graphs 1994 130 TCS Halldorsson & Szegedy, Lower Bounds for On-line Graph Coloring 1994 130 TCS Alon & Kalai & Ricklin & Stockmeyer, Lower Bounds on the Competitive Ratio for Mobile User Tracking and Distributed Job Scheduling 1994 130 TCS Miltersen & Subramanian & Vitter & Tamassia, Complexity Models for Incremental Computation 1994 129 TCS Deutz & Ehrenfeucht & Rozenberg, Clans and Regions in 2-Structures 1994 129 TCS Allouche & Bousquet-Melou, Canonical Positions for the Factors in Paperfolding Sequences 1994 129 TCS Delyon & Maler, On the Effects of Noise and Speed on Computations 1994 129 TCS Ja'Ja' & Ryu, An Efficient Parallel Algorithm for the Single Function Coarsest Partition Problem 1994 129 TCS Ganesan, One-way Functions and the Isomorphism Conjecture 1994 129 TCS Rich & Slutzki, The Complexity of Optimizing Finite-State Transducers 1994 129 TCS Knuutila & Steinby, The Inference of Tree Languages from Finite Samples: An Algebraic Approach 1994 129 TCS Ferenczi, Tiling and Local Rank Properties of the Morse Sequence 1994 129 TCS Scheepers, Variations on a Game of Gale (II): Markov Strategies 1994 129 TCS Yellin, An Algorithm for Dynamic Subset and Intersection Testing 1994 129 TCS Egecioglu & Koc, Exponentiation Using Canonical Recoding 1994 129 TCS Margenstern, Nonerasing Turing Machines: A Frontier between a Decidable Halting Problem and Universality 1994 129 TCS Abraham & Magidor, On the Mutual-Exclusion Problem -- A Quest for Minimal Solutions 1994 129 TCS Yokouchi, F-Semantics for Type Assignment Systems 1994 129 TCS Krivine, A General Storage Theorem for Integers in Call-by-Name lambda-Calculus 1994 129 TCS Chen & Lin, The Computational Complexity of the Satisfiability of Modal Horn Clauses for Modal Propositional Logics 1994 129 TCS Wei, Correctness of Fixpoint Transformations 1994 129 TCS Shepherdson, The Role of Standardising Apart in Logic Programming 1994 129 TCS Ognjanovic, A Tableau-like Proof Procedure for Normal Modal Logics 1994 129 TCS Banach, Regular Relations and Bicartesian Squares 1994 129 TCS Zhang, Depth of Proofs, Depth of Cut-Formulas and Complexity of Cut-Formulas 1994 128 TCS Aumann & Rabin, Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation 1994 128 TCS Leighton, Methods for Message Routing in Parallel Machines 1994 128 TCS Garofalakis & Spirakis & Tampakas & Rajsbaum, Tentative and Definite Distributed Computations: An Optimistic Approach to Network Synchronization 1994 128 TCS Koren & Shasha, MOCA: A Multiprocessor On-line Competitive Algorithm for Real-time System Scheduling 1994 128 TCS Peled & Joseph, A Compositional Framework for Fault Tolerance by Specification Transformation 1994 128 TCS Schepers & Hooman, A Trace-Based Compositional Proof Theory for Fault Tolerant Distributed Systems 1994 128 TCS Krishnan, A Semantic Characterisation for Faults in Replicated Systems 1994 128 TCS de Meer & Trivedi & Dal Cin, Guarded Repair of Dependable Systems 1994 128 TCS Pai & Schaffer & Varman, Markov Analysis of Multiple-Desk Prefetching Strategies for External Merging 1994 128 TCS Bruck & Cypher & Ho, Tolerating Faults in a Mesh with a Row of Spare Nodes 1994 127 TCS Cameron & Wood, Balance in AVL Trees and Space Cost of Brother Trees 1994 127 TCS Kari, Rice's Theorem for the Limit Sets of Cellular Automata 1994 127 TCS Khuller & Mitchell & Vazirani, On-line Algorithms for Weighted Bipartite Matching and Stable Marriages 1994 127 TCS Honkala, On Generalized DT0L Systems and their Fixed Points 1994 127 TCS Matos, Periodic Sets of Integers 1994 127 TCS Yunes, Seven-State Solutions to the Firing Squad Synchronization Problem 1994 127 TCS Barcucci & Pinzani & Sprugnoli, The Random Generation of Directed Animals 1994 127 TCS Jain & Sharma, Program Size Restrictions in Computational Learning 1994 127 TCS Deutz & Ehrenfeucht & Rozenberg, Hyperedge Channels are Abelian 1994 127 TCS Hromkovic & Jeschke & Monien, Note on Optimal Gossiping in Some Weak-Connected Graphs 1994 127 TCS Hosono & Ikeda, A Formal Derivation of the Decidability of the Theory of SA 1994 127 TCS Salomaa, Synchronized Tree Automata 1994 127 TCS Daykin & Iliopoulos & Smyth, Parallel RAM Algorithms for Factorizing Words 1994 127 TCS Coquide & Dauchet & Gilleron & Vagvolgyi, Bottom-up Tree Pushdown Automata: Classification and Connection with Rewrite Systems 1994 127 TCS Codenotti & Leoncini & Resta, Oracle Computations in Parallel Numerical Linear Algebra 1994 127 TCS Hromkovic & Kari & Kari, Some Hierarchies for the Communication Complexity Measures of Cooperating Grammar Systems 1994 127 TCS Jantzen & Petersen, Cancellation in Context-free Languages: Enrichment by Reduction 1994 127 TCS Inoue & Ito & Takanami, On 1-Inkdot Alternating Turing Machines with Small Space 1994 127 TCS De Agostino, P-Complete Problems in Data Compression 1994 127 TCS Del Lungo, Polynominoes Defined by Two Vectors 1994 126 TCS Peled & Pnueli, Proving Partial Order Properties 1994 126 TCS Alur & Dill, A Theory of Timed Automata 1994 126 TCS Gerhard & Petrich, Unification in Free Distributive Lattices 1994 126 TCS van Oostrom, Confluence by Decreasing Diagrams 1994 126 TCS Regnier, Une Equivalence sur les Lambda-Termes 1994 126 TCS Anderson, Model Checking and Boolean Graphs 1994 126 TCS Caron & Coquide, Decidability of Reachability for Disjoint Union of Term Rewriting Systems 1994 126 TCS Courcelle, Monadic Second-order Definable Graph Transductions: A Survey 1994 126 TCS Dam, CTL* and ECTL* as Fragments of the Modal mu-Calculus 1994 126 TCS Potthoff, Modulo-Counting Quantifiers over Finite Trees 1994 126 TCS Seidl, Finite Tree Automata with Cost Functions 1994 125 TCS Gastin & Petit & Zielonka, An Extension of Kleene's and Ochmanski's Theorems to Infinite Traces 1994 125 TCS Middendorf, More on the Complexity of Common Superstring and Supersequence Problems 1994 125 TCS Lempel & Paz, An Algorithm for Finding a Shortest Vector in a Two-Dimensional Modular Lattice 1994 125 TCS Jiang & Ibarra & Wang, Some Results Concerning 2-D On-line Tessellation Acceptors and 2-D Alternating Finite Automata 1994 125 TCS Ehrenfeucht & ten Pas & Rozenberg, Properties of Grammatical Codes of Trees 1994 125 TCS Wolf, Nondeterministic Circuits, Space Complexity and Quasigroups 1994 125 TCS Yu & Zhuang & Salomaa, The State Complexities of Some Basic Operations on Regular Languages 1994 125 TCS Goles, Lyapunov Operators to Study the Convergence of Extremal Automata 1994 125 TCS Litow, A Context-free Language Decision Problem 1994 125 TCS Bafna & Kalyanasundaram & Pruhs, Not All Insertion Methods Yield Constant Approximate Tours in the Euclidean Plane 1994 125 TCS Matthews, An Inherently Iterative Algorithm for the Grzegorczyk Hierarchy 1994 125 TCS Mateescu, Scattered Deletion and Commutativity 1994 125 TCS Chen, The Communication Complexity of Computing Differentiable Functions in a Multicomputer Network 1994 125 TCS Coffman & Flatto & Poonen & Wright, The Processor Minimization Problem with Independent Waiting-Time Constraints 1994 125 TCS Combe & Boxma, Optimization of Static Traffic Allocation Policies 1994 125 TCS Louth & Mitzenmacher & Kelly, Computational Complexity of Loss Networks 1994 125 TCS Hofri & Kogan, Asymptotic Analysis of Product-form Distributions Related to Large Interconnection Networks 1994 125 TCS Chakka & Mitrani, Heterogeneous Multiprocessor Systems with Breakdowns: Performance and Optimal Repair Strategies 1994 125 TCS Akyildiz & von Brand, Exact Solutions for Networks of Queues with Blocking-after-service 1994 125 TCS Gelenbe & Hernandez, Virus Tests to Maximize Availability of Software Systems 1994 125 TCS Baccelli & Massey & Wright, Determining the Exit Time Distribution for a Closed Cyclic Network 1994 124 TCS Pitts, A Co-induction Principle for Recursively Defined Domains 1994 124 TCS More, Investigation of Binary Spectra by Explicit Polynomial Transformations of Graphs 1994 124 TCS Hesselink, Nondeterminacy and Recursion via Stacks and Games 1994 124 TCS Bossi & Cocco & Fabris, Norms on Terms and their Use in Proving Universal Termination of a Logic Program 1994 124 TCS Park & Chwa, On the Construction of Regular Minimal Broadcast Digraphs 1994 124 TCS Hebrard, A Linear Algorithm for Renaming a Set of Clauses as a Horn Set 1994 124 TCS Majster-Cederbaum & Zetzsche, The Comparison of a cpo-based Semantics with a cms-based Semantics 1994 124 TCS Berard, Global Serializability of Concurrent Programs 1994 124 TCS Yamasaki, A Denotational Semantics and Dataflow Construction for Logic Programs 1994 124 TCS Codish & Dams & Yardeni, Bottom-Up Abstract Interpretation of Logic Programs 1994 124 TCS Thatte, Type Inference with Partial Types 1994 124 TCS Bergstra & Heering, Which Data Types Have omega-complete Initial Algebra Specifications? 1994 124 TCS Goltz & Rensink, Finite Petri Nets as Models for Recursive Causal Behaviour 1994 124 TCS Doets, Left Termination Turned into Termination 1994 124 TCS Barr, Additions and Corrections to ``Terminal Coalgebras in Well-founded Set Theory 1994 123 TCS Huynh & Tian, Deciding Bisimilarity of Normed Context-free Processes is in Sigma^p_2 1994 123 TCS Martin, A Universal Cellular Automaton in Quasi-linear Time and its S-m-n Form 1994 123 TCS Blanchet-Sadri, Equations and Monoid Varieties of Dot-Depth One and Two 1994 123 TCS Clerbout & Gonzalez, Atomic Semicommutations 1994 123 TCS Birget & Margolis & Meakin, The Word Problem for Inverse Monoids Presented by One Idempotent Relator 1994 123 TCS Flajolet & Grabner & Kirschenhofer & Prodinger & Tichy, Mellin Transforms and Asymptotics: Digital Sums 1994 123 TCS Aoki & Shinoda & Tsuda, On Pi^2 Theories of hp-T Degrees of Low Sets 1994 123 TCS Iwata & Kasai, The Othello Game on an n x n Board is PSPACE-Complete 1994 123 TCS Mey, Finite Games for a Predicate Logic without Contractions 1994 123 TCS Bennett, Double Dipping: The Case of the Missing Binomial Coefficient Identities 1994 123 TCS Kozen & Zaks, Optimal Bounds for the Change-Making Problem 1994 123 TCS Klawe, Shallow Grates 1994 123 TCS Burckel, Functional Equations Associated with Congruential Functions 1994 123 TCS Hemaspaandra & Hemaspaandra, Quasi-injective Reductions 1994 123 TCS Nishimura, Restricted CRCW PRAMs 1994 123 TCS Monien & Rytter & Schapers, Corrigendum: Fast Recognition of Deterministic cfl's with Smaller Number of Processors 1994 123 TCS Allouche, Note on the Cyclic Towers of Hanoi 1994 123 TCS Assous & Bouchitte & Charretton & Rozoy, Finite Labelling Problem in Event Structures 1994 123 TCS Bertrand, Sur une Conjecture d'Yves Metivier 1994 123 TCS Bertrand, A Natural Semantics of First-order Type Dependency 1994 123 TCS Blanchard & Fabre, Quelques Procedes Engendrant des Suites Infinies 1994 123 TCS Borel, Symbolic Representation of Piecewise Linear Functions on the Unit Interval and Application to Discrepancy 1994 123 TCS Chaunier & Lygeros, Le Nombre de Posets a Isomorphie pres ayant 12 Elements 1994 123 TCS Daude & Vallee, An Upper Bound on the Average Number of Iterations of the LLL Algorithm 1994 123 TCS Duval & Senechaud, Sketches and Parametrization 1994 123 TCS Faure, Methodes Quasi-Monte-Carlo Multidimensionnelles 1994 123 TCS Kowalski, Multiple Returns under a Bounded Number of Iterations 1994 123 TCS Mignotte, Sur l'Equation de Catalan, II 1994 123 TCS Remila, A Linear Algorithm to Tile the Trapezes with h_m and v_n 1994 123 TCS Ye, Coexistence of Uniquely Ergodic Subsystems of Interval Mappings 1994 122 TCS Bossi & Gabrielli & Levi & Meo, A Compositional Semantics for Logic Programs 1994 122 TCS Pereira & Alferes & Aparicio, Adding Closed World Assumptions to Well-founded Semantics 1994 122 TCS Kawamura, Logic Program Synthesis from First-order Logic Specifications 1994 122 TCS Martens & De Schreye & Horvath, Sound and Complete Partial Deduction with Unfolding Based on Well-founded Measures 1994 122 TCS Tatsuta, Realizability Interpretation of Coinductive Definitions and Program Synthesis with Streams 1994 122 TCS Takayama, Defining Concurrent Processes Constructively 1994 122 TCS Corradini & Montanari & Rossi, An Abstract Machine for Concurrent Modular Systems: CHARM 1994 122 TCS Poirriez, MLOG: A Strongly Typed Confluent Functional Language with Logical Variables 1994 122 TCS Denecker & De Schreye, On the Duality of Abduction and Model Generation in a Framework for Model Generation with Equality 1994 122 TCS Ait-Kaci & Podelski & Smolka, A Feature Constraint System for Logic Programming with Entailment 1993 121 TCS Abadi & Cardelli & Curien, Formal Parametric Polymorphism 1993 121 TCS Barendregt, Constructive Proofs of the Range Property in Lambda Calculus 1993 121 TCS Berarducci & Intrigila, Some New Results on Easy Lambda-Terms 1993 121 TCS Constable & Smith, Computational Foundations of Basic Recursive Function Theory 1993 121 TCS Coppo & Ferrari, Type Inference, Abstract Interpretation and Strictness Analysis 1993 121 TCS Huet, An Analysis of Bohm's Theorem 1993 121 TCS Jacopini & Sontacchi, General Recursive Functions in a Very Simply Interpretable Typed lambda-Calculus 1993 121 TCS Brookes, Historical Introduction to ``Concrete Domains'' by G. Kahn and G. D. Plotkin 1993 121 TCS Kahn & Plotkin, Concrete Domains 1993 121 TCS Klop & van Oostrom & van Raamsdonk, Combinatory Reduction Systems: Introduction and Survey 1993 121 TCS Leivant, Functions over Free Algebras Definable in the Simply Typed Lambda Calculus 1993 121 TCS Longo & Milsted & Soloviev, The Genericity Theorem and Parametricity in the Polymorphic lambda-Calculus 1993 121 TCS Plotkin, Set-theoretical and Other Elementary Models of the lambda-Calculus 1993 121 TCS Scott, A Type-theoretical Alternative to ISWIM, CUCH, OWHY 1993 121 TCS Statman, Some Examples of Non-existent Combinators 1993 120 TCS Marcoux, Composition is Almost (But Not Quite) as Good as s-1-1 1993 120 TCS Bruggemann-Klein, Regular Expressioins into Finite Automata 1993 120 TCS Chen & Wang & Li, Deriving Algorithms on Reconfigurable Networks Based on Function Decomposition 1993 120 TCS Honkala, On D0L Systems with Immigration 1993 120 TCS Kim & Lee, Separating k-Separated eNCE Graph Languages 1993 120 TCS Subbiah & Iyengar & Radhakrishnan & Kashyap, An Optimal Distributed Algorithm for Recognizing Mesh-connected Networks 1993 120 TCS Fu & Li, On Symmetric Differences of NP-Hard Sets with Weakly P-Selective Sets 1993 120 TCS Paun & Salomaa, Closure Properties of Slender Languages 1993 120 TCS Sikkel, Parallel On-line Parsing in Constant Time per Word 1993 120 TCS Ferreira, On Space-Efficient Algorithms for Certain NP-Complete Problems 1993 120 TCS Knill & Cox & Pietrzykowski, Equality and Abductive Residua for Horn Clauses 1993 120 TCS Nota & Orefice & Pacini & Ruggiero & Tortora, Legality Concepts for Three-valued Logic Programs 1993 120 TCS Grabowski, On the Status of Proving Program Properties in Effective Interpretations 1993 120 TCS Baratella, A Class of Programs for which SLDNF Resolution and NAF Rule are Complete 1993 120 TCS Gastin & Rozoy, The Poset of Infinitary Traces 1993 120 TCS Cousot & Cousot, ``A la Burstall'' Intermittent Assertions Induction Principles for Proving Inevitability Properties of Programs 1993 120 TCS Zhang, Cut-Formulas in Propositional Logic 1993 119 TCS Kutylowski, Stack versus Sensitivity for One-way Automata 1993 119 TCS Apostolico & Ehrenfeucht, Efficient Detection of Quasiperiodicities in Strings 1993 119 TCS Birget, Partial Orders on Words, Minimal Elements of Regular Languages and State Complexity 1993 119 TCS Zimand, If Not Empty, NP-P Is Topologically Large 1993 119 TCS Stromquist & Ullman, Sequential Compounds of Combinatorial Games 1993 119 TCS Wolfe, Snakes in Domineering Games 1993 119 TCS Tamassia & Tollis, Dynamic Reachability in Planar Digraphs with One Source and One Sink 1993 119 TCS Litow & Dumas, Additive Cellular Automata and Algebraic Series 1993 119 TCS Oommen & Ng, An Optimal Absorbing List Organization Strategy with Constant Memory Requirements 1993 119 TCS Jiang & Li, On the Complexity of Learning Strings and Sequences 1993 119 TCS Barbar, Attributed Tree Grammars 1993 119 TCS Corsini & Musumbu, Type Inference in Prolog: A New Approach 1993 119 TCS Devienne & Lebegue & Dauchet, Weighted Systems of Equations 1993 119 TCS Dikovsky, On the Computational Complexity of Prolog Programs 1993 119 TCS Dosch, On a Generalized Product for Domains 1993 119 TCS Habbas, A Complete Modal Proof for HAL: The Herbrand Agent Language 1993 119 TCS Letichevsky & Kapitonova & Konozenko, Computations in APS 1993 119 TCS Nepomniaschy & Sulimov, Problem-oriented Verification System and its Application to Linear Algebra Programs 1993 119 TCS Sazonov, Hereditarily-Finite Sets, Data Bases and Polynomial-Time Computability 1993 119 TCS Slissenko, On Fault Tolerance of Syntax 1993 119 TCS Valiev, Pi^1_1-Universality of Some Propositional Logics of Concurrent Programs 1993 118 TCS Deransart, Proof Methods of Declarative Properties of Definite Programs 1993 118 TCS Comon, Complete Axiomatizations of Some Quotient Term Algebras 1993 118 TCS Stewart, Methods for Proving Completeness via Logical Reductions 1993 118 TCS Draghicescu & Purushothaman, A Uniform Treatment of Order of Evaluation and Aggregate Update 1993 118 TCS Groote, Transition System Specifications with Negative Premises 1993 118 TCS Simpson, A Characterisation of the Least-Fixed-Point Operator by Dinaturality 1993 118 TCS Eiter & Gottlob, Propositional Circumscription and Extended Closed-World Reasoning are Pi^p_2-Complete (Addendum) 1993 118 TCS Baruah & Howell & Rosier, Feasibility Problems for Recurring Tasks on One Processor 1993 118 TCS Darondeau & Degano, Refinement of Actions in Event Structures and Causal Trees 1993 118 TCS Geffert, A Speed-up Theorem without Tape Compression 1993 118 TCS Walukiewicz, Gentzen-type Axiomatization for PAL 1993 118 TCS Wegener, BOTTOM-UP-HEAPSORT, a New Variant of HEAPSORT, Beating, on an Average, QUICKSORT (if n is not Very Small) 1993 117 TCS Labelle, Sur la Symetrie et l'Asymetrie des Structures Combinatoires 1993 117 TCS Zeilberger, Identities in Search of Identity 1993 117 TCS Anselmo, The Operation ^ on Formal Series 1993 117 TCS Arques & Jacques, Classification des Cartes Pointees de Genre 1 et Relation Fonctionelle Associee 1993 117 TCS Betrema & Penaud, Animaux et Arbres Guingois 1993 117 TCS Bjorner, The Mobius Function of Factor Order 1993 117 TCS Casas & Diaz & Martinez, Average-Case Analysis on Simple Families of Trees Using a Balanced Probability Model 1993 117 TCS Chen, Context-free Grammars, Differential Operators and Formal Power Series 1993 117 TCS Chiricota, Representation Symbolique d'Especes Moleculaires 1993 117 TCS Choi & Gouyou-Beauchamps, Enumeration of Generalized Young Tableaux with Bounded Height 1993 117 TCS Constantineau, Auto-Similarite dans la Combinatoire des Polynomes Orthogonaux 1993 117 TCS Decoste, Series Indicatrices et q-Series 1993 117 TCS Dulucq & Gire, Complexite d'Algorithmes et Operations sur les Arbres 1993 117 TCS Ekhad, A Short, Elementary and Easy WZ Proof of the Askey-Gasper Inequality that was Used by de Branges in his Proof of the Bieberbach Conjecture 1993 117 TCS Lalanne, Sur une Involution sur les Chemins de Dyck 1993 117 TCS Lalonde, Bases de Lyndon des Algebres de Lie Libres Partiellement Commutatives 1993 117 TCS Lando & Zvonkin, Plane and Projective Meanders 1993 117 TCS Mantaci, Sur la Distribution des Anti-Excedances dans le Groupe Symetrique et dans ses Sous-Groupes 1993 117 TCS Melancon, Constructions des Bases Standard des K-Modules a Droite 1993 117 TCS Sagan, Combinatorial Proofs of Hook Generating Functions for Skew Plane Partitions 1993 117 TCS Svrtan, New Plethysm Operation, Chern Characters of Exterior and Symmetric Powers with Applications to Stiefel-Whitney Classes of Grassmannians 1993 117 TCS West, Sorting Twice through a Stack 1993 116 TCS Ehrenfeucht & Rozenberg, T-Structures, T-Functions, and Texts 1993 116 TCS Bruderlin, Using Geometric Rewrite Rules for Solving Geometric Problems Symbolically 1993 116 TCS Karhumaki & Rytter & Jarominek, Efficient Constructions of Test Sets for Regular and Context-free Languages 1993 116 TCS Saouter & Quinton, Computability of Recurrence Equations 1993 116 TCS Andrasiu & Paun & Dassow & Salomaa, Language-theoretic Problems Arising from Richelieu Cryptosystems 1993 116 TCS Feuerstein & Marchetti-Spaccamela, Dynamic Algorithms for Shortest Paths in Planar Graphs 1993 116 TCS Culik & Dube, Affine Automata and Related Techniques for Generation of Complex Images 1993 116 TCS Koutsoupias, Improvements on Khrapchenko's Theorem 1993 116 TCS Kleine Buning, On Generalized Horn Formulas and k-Resolution 1993 116 TCS Pudlak & Savicky, On Shifting Networks 1993 116 TCS Monien & Rytter & Schapers, Fast Recognition of Deterministic cfl's with a Smaller Number of Processors 1993 116 TCS Fagin, Finite-Model Theory -- A Personal Perspective 1993 116 TCS Kuper & Vardi, On the Complexity of Queries in the Logical Data Model 1993 116 TCS Beeri & Kornatzky, Algebraic Optimization of Object-Oriented Query Languages 1993 116 TCS Consens & Mendelzon, Low Complexity Aggregation in GraphLog and Datalog 1993 116 TCS Revesz, A Closed-Form Evaluation for Datalog Queries with Integer (Gap)-Order Constraints 1993 116 TCS van der Meyden, Recursively Indefinite Databases 1993 116 TCS Lipton & Naughton & Schneider & Seshadri, Efficient Sampling Strategies for Relational Database Operations 1993 115 TCS Litovsky & Metivier, Computing with Graph Rewriting Systems with Priorities 1993 115 TCS Allender & Beigel & Hertrampf & Homer, Almost-everywhere Complexity Hierarchies for Nondeterministic Time 1993 115 TCS Carpi, Overlap-free Words and Finite Automata 1993 115 TCS Ibarra & Tran, Synchronized Finite Automata and 2DFA Reductions 1993 115 TCS Longpre & Selman, Hard Promise Problems and Nonuniform Complexity 1993 115 TCS Troesch, Interpretation Geometrique de l'Algorithme d'Euclide et Reconnaissance de Segments 1993 115 TCS Goles & Kiwi, Games on Line Graphs and Sand Piles 1993 115 TCS Srikant & Sundaram & Sher & Singh & Rangan, Optimal Path Cover Problem on Block Graphs and Bipartite Permutation Graphs 1993 115 TCS Katsura & Kobayashi, The Shuffle Algebra and its Derivations 1993 115 TCS Tang & Fu & Liu, Exponential-Time and Subexponential-Time Sets 1993 115 TCS Homer & Kurtz & Royer, On 1-Truth-Table-Hard Languages 1993 115 TCS Vagvolgyi, A Fast Algorithm for Constructing a Tree Automaton Recognizing a Congruential Tree Language 1993 115 TCS Blute, Linear Logic, Coherence and Dinaturality 1993 115 TCS Burroni, Higher-dimensional Word Problems with Applications to Equational Logic 1993 115 TCS Coquand, Another Proof of the Intuitionistic Ramsey Theorem 1993 115 TCS Edalat & Smyth, 1-Categories as a Framework for Solving Domain Equations 1993 115 TCS Freyd, Structural Polymorphism 1993 115 TCS Jarzembski, Programs in Partial Algebras 1993 115 TCS Jay, Tail Recursion through Universal Invariants 1993 114 TCS Vickers, Information Systems for Continuous Posets 1993 114 TCS Eiter & Gottlob, Propositional Circumscription and Extended Closed-World Reasoning are Pi_2^p-Complete 1993 114 TCS Desharnais & Jaoua & Mili & Boudriga & Mili, A Relation Division Operator: The Conjugate Kernel 1993 114 TCS Dougherty, Higher-order Unification via Combinators 1993 114 TCS Barr, Terminal Coalgebras in Well-founded Set Theory 1993 114 TCS Elvang-Goransson & Owe, A Simple Sequent Calculus for Partial Functions 1993 114 TCS Abadi & Plotkin, A Logical View of Composition 1993 114 TCS Boudol & Castellani & Hennessy & Kiehn, Observing Localities 1993 114 TCS Degano & De Nicola & Montanari, Universal Axioms for Bisimulations 1993 114 TCS Desel & Esparza, Reachability in Cyclic Extended Free-Choice Systems 1993 114 TCS Larsen, The Expressive Power of Implicit Specifications 1993 114 TCS Milner & Parrow & Walker, Modal Logics for Mobile Processes 1993 114 TCS Vogler, Bisimulation and Action Refinement 1993 113 TCS Weihrauch, Computability on Computable Metric Spaces 1993 113 TCS Yi & Xu, Analogy Calculus 1993 113 TCS Ruqian, A True Concurrency Model of CCS Semantics 1993 113 TCS Lu & Xu, Analogical Program Derivation Based on Type Theory 1993 113 TCS Bucciarelli & Ehrhard, A Theory of Sequentiality 1993 113 TCS van Glabbeek & Vaandrager, Modular Specification of Process Algebras 1993 113 TCS Masseron & Tollu & Vauzeilles, Generating Plans in Linear Logic I. Actions as Proofs 1993 113 TCS Masseron, Generating Plans in Linear Logic II. A Geometry of Conjuctive Actions 1993 113 TCS Albert & Casas & Fages, Average-Case Analysis of Unification Algorithms 1993 113 TCS Diekert, On the Concatenation of Infinite Traces 1993 113 TCS Fortnow & Lund, Interactive Proof Systems and Alternating Time-Space Complexity 1993 113 TCS Huhne, On the Power of Several Queues 1993 113 TCS Jeron & Jard, Testing for Unboundedness of fifo Channels 1993 113 TCS Madlener & Narendran & Otto & Zhang, On Weakly Confluent Monadic String-Rewriting Systems 1993 113 TCS Tarui, Probabilistic Polynomials, AC^0 Functions, and the Polynomial-Time Hierarchy 1993 112 TCS Herbst & Thomas, Group Presentations, Formal Languages and Characterizations of One-Counter Groups 1993 112 TCS Bourgin & Howe, Shortest Curves in Planar Regions with Curved Boundary 1993 112 TCS Ogiwara & Lozano, On Sparse Hard Sets for Counting Classes 1993 112 TCS Csuhaj-Varju & Kelemenova, Descriptional Complexity of Context-free Grammar Forms 1993 112 TCS Sturtivant & Frandsen, The Computational Effect of Finite-Field Arithmetic 1993 112 TCS Neraud, Deciding Whether a Finite Set of Words Has Rank At Most Two 1993 112 TCS Boissonnat & Teillaud, On the Randomized Construction of the Delaunay Tree 1993 112 TCS Aslam & Dhagat, On-line Algorithms for 2-Coloring Hypergraphs via Chip Games 1993 112 TCS Fraenkel & Scheinerman & Ullman, Undirected Edge Geography 1993 112 TCS Calude & Campeanu, Note on the Topological Structure of Random Strings 1993 112 TCS Ibarra & Tran, A Note on Simple Programs with Two Variables 1993 112 TCS Korec, Irrational Speeds of Configurations Growth in Generalized Pascal Triangles 1993 112 TCS Skurczynski, The Borel Hierarchy is Infinite in the Class of Regular Sets of Trees 1993 112 TCS Sykora & Vrto, Edge Separators for Graphs of Bounded Genus with Applications 1993 112 TCS Janicki & Koutny, Structure of Concurrency 1993 112 TCS Srinivas, A Sheaf-theoretic Approach to Pattern Matching and Related Problems 1993 112 TCS Talcott, A Theory of Binding Structures and Applications to Rewriting 1993 112 TCS Thomas & Watson, Solving Divergence in Knuth-Bendix Completion by Enriching Signatures 1993 111 TCS Abramsky, Computational Interpretations of Linear Logic 1993 111 TCS Heckmann, Power Domains and Second-order Predicates 1993 111 TCS Droste, On Stable Domains 1993 111 TCS Lamarche, Stable Domains are Generalized Topological Spaces 1993 111 TCS Main, Complete Proof Rules for Strong Fairness and Strong Extreme Fairness 1993 111 TCS Dybkjaer & Melton, Comparing Hagino's Categorical Programming Language and Typed Lambda-Calculi 1993 111 TCS Moss & Thatte, Modal Logic and Algebraic Specifications 1993 111 TCS Gilmore & Tsiknis, A Logic for Category Theory 1993 111 TCS Gilmore & Tsiknis, Logical Foundations for Programming Semantics 1993 110 TCS Gallier, Constructive Logics Part I: A Tutorial on Proof Systems and Typed lambda-Calculi 1993 110 TCS Charron-Bost, Coupling Coefficients of a Distributed Execution 1993 110 TCS Maher, A Transformation System for Deductive Database Modules with Perfect Model Semantics 1993 110 TCS Forster, A Semantic Characterization of the Well-Typed Formulae of lambda-Calculus 1993 110 TCS Sprenger & Wymann-Boni, How to Decide the Lark 1993 110 TCS Engelfriet & Hoogeboom, X-Automata on omega-Words 1993 110 TCS Goles & Maass & Martinez, On the Limit Set of Some Universal Cellular Automata 1993 110 TCS Blizard, Dedekind Multisets and Function Shells 1993 110 TCS Patt-Shamir & Peleg, Time-Space Tradeoffs for Set Operations 1993 110 TCS Freivalds & Kinber & Wiehagen, On the Power of Inductive Inference from Good Examples 1993 110 TCS Habel & Kreowski & Lautemann, A Comparison of Compatible, Finite, and Inductive Graph Properties 1993 110 TCS Zwick & Paterson, The Memory Game 1993 110 TCS Fraenkel & Simonson, Geography 1993 110 TCS Bodlaender, Complexity of Path-forming Games 1993 109 TCS Ehrig & Lowe, The ESPRIT Basic Research Working Group COMPUGRAPH ``Computing by Graph Transformation'': A Survey 1993 109 TCS Corradini & Rossi, Hyperedge Replacement Jungle Rewriting for Term-Rewriting Systems and Logic Programming 1993 109 TCS Courcelle & Mosbah, Monadic Second-order Evaluations on Tree-decomposable Graphs 1993 109 TCS Drewes, Recognising k-Connected Hypergraphs in Cubic Time 1993 109 TCS Ehrig & Lowe, Parallel and Distributed Derivations in the Single-Pushout Approach 1993 109 TCS Janssens, Equivalence of Computations in Actor Grammars 1993 109 TCS Lowe, Algebraic Approach to Single-Pushout Graph Transformation 1993 109 TCS Montanari & Rossi, Graph Rewriting for a Partial Ordering Semantics of Concurrent Constraint Programming 1993 109 TCS Schneider, On Categorical Graph Grammars Integrating Structural Transformations and Operations on Labels 1993 108 TCS Fulop & Herrmann & Vagvolgyi & Vogler, Tree Transducers with External Functions 1993 108 TCS Long Van & Le Saec & Litovsky, Stability for the Zigzag Submonoids 1993 108 TCS Madonia & Salemi & Sportelli, A Generalization of Sardinas and Patterson's Algorithm to z-Codes 1993 108 TCS Dietzfelbinger & Maass, The Complexity of Matrix Transposition on One-Tape Off-line Turing Machines with Output Tape 1993 108 TCS Schmid, The Average CRI-Length of a Controlled ALOHA Collision Resolution Algorithm 1993 108 TCS Bar Yehuda & Etzion & Moran, Rotating-Table Games and Derivatives of Words 1993 108 TCS Apostolico, Efficient CRCW-PRAM Algorithms for Universal Substring Searching 1993 108 TCS Grossi, On Finding Common Subtrees 1993 108 TCS Slowinski, Picture Words with Invisible Lines 1993 108 TCS Middendorf, The Shortest Common Nonsubsequence Problem is NP-Complete 1993 108 TCS d'Amore & Marchetti-Spaccamela & Nanni, The Weighted List Update Problem and the Lazy Adversary 1993 108 TCS Lehr, Sums and Rational Multiples of q-Automatic Sequences are q-Automatic 1993 108 TCS Hromkovic & Inoue, A Note on Realtime One-way Synchronized Alternating One-Counter Automata 1993 108 TCS Almeida, Locally Commutative Power Semigroups and Counting Factors of Words 1993 108 TCS Crvenkovic & Madarasz, On Kleene Algebras 1993 108 TCS Diekert, Mobius Functions and Confluent Semi-commutations 1993 108 TCS Frougny & Sakarovitch, Synchronized Rational Relations of Finite and Infinite Words 1993 108 TCS Garzon, Cayley Automata 1993 108 TCS Karhumaki, Equations over Finite Sets of Words and Equivalence Problems in Automata Theory 1993 108 TCS Katsura & Tanaka, Groups of Finite Elementary Codes 1993 108 TCS Kunze, Standard Automata and Semidirect Products of Transformation Semigroups 1993 108 TCS Zhang & Qiu, Decompositions of Recognizable Strong Maximal Codes 1993 107 TCS Jacobs, Comprehension Categories and the Semantics of Type Dependency 1993 107 TCS Bellia & Occhiuto, C-Expressions: A Variable-free Calculus for Equational Logic Programming 1993 107 TCS Hirokawa, Principal Types of BCK-Lambda-Terms 1993 107 TCS Cortesi & File, Graph Properties for Normal Logic Programs 1993 107 TCS Main & Black, Semantic Models for Total Correctness and Fairness 1993 107 TCS Sreedhar & Taghva, Capturing Strong Reduction in Director String Calculus 1993 107 TCS Dowek, The Undecidability of Pattern Matching in Calculi Where Primitive Recursive Functions are Representable 1993 107 TCS Milner & Moller, Unique Decomposition of Processes 1993 107 TCS Alvarez & Jenner, A Very Hard Log-Space Counting Class 1993 107 TCS Bedard & Lemieux & McKenzie, Extensions to Barrington's M-Program Model 1993 107 TCS Heiman & Newman & Wigderson, On Read-Once Threshold Formulae and their Randomized Decision Tree Complexity 1993 107 TCS Lange, Unambiguity of Circuits 1993 107 TCS Lutz & Schmidt, Circuit Size Relative to Pseudorandom Oracles 1993 107 TCS Mansour & Nisan & Tiwari, The Computational Complexity of Universal Hashing 1993 107 TCS Nisan, On Read-Once vs. Multiple Access to Randomness in Logspace 1993 107 TCS Panconesi & Ranjan, Quantifiers and Approximation 1992 106 TCS Boudol & Larsen, Graphical versus Logical Specifications 1992 106 TCS Cai & Paige & Tarjan, More Efficient Bottom-Up Multi-Pattern Matching in Trees 1992 106 TCS Caucal, On the Regular Structure of Prefix Rewriting 1992 106 TCS Kounalis, Testing for the Ground (Co-)Reducibility Property in Term-Rewriting Systems 1992 106 TCS Schwartzbach, Interpretations of Recursively Defined Types 1992 106 TCS Seidl, Single-Valuedness of Tree Transducers is Decidable in Polynomial Time 1992 106 TCS Frougny, Confluent Linear Numeration Systems 1992 106 TCS Michel, Complexity of Logical Theories Involving Coprimality 1992 106 TCS El-Taha & Stidham, Deterministic Analysis of Queueing Systems with Heterogeneous Servers 1992 106 TCS Bern & Karloff & Raghavan & Schieber, Fast Geometric Approximation Techniques and Geometric Embedding Problems 1992 106 TCS Hausser, Complexity in Left-Associative Grammar 1992 106 TCS Bodlaender & Kratsch, The Complexity of Coloring Games on Perfect Graphs 1992 106 TCS Robson, More Languages of Generalised Star Height 1 1992 106 TCS Villemaire, The Theory of is Undecidable 1992 106 TCS Damm & Meinel, Separating Complexity Classes Related to Omega-Decision Trees 1992 106 TCS Huang & Liu & Viswanathan, A Sublinear Parallel Algorithm for Some Dynamic Programming Problems 1992 106 TCS Subramanian & Siromoney & Mathew, Lyndon Trees 1992 106 TCS Razborov, On the Distributed Complexity of Disjointness 1992 106 TCS Andersson, Comments on ``On the Balance Property of Patricia Tries: External Path Length Viewpoint'' 1992 106 TCS Kirschenhofer & Prodinger & Szpankowski, Probabilistic Modeling of Data Structures on Words: A Reply to Professor Andersson's Letter 1992 105 TCS Mason & Talcott, Inferring the Equivalence of Functional Programs that Mutate Data 1992 105 TCS Goguen & Meseguer, Order-Sorted Algebra I: Equational Deduction for Multiple Inheritance, Overloading, Exceptions and Partial Operations 1992 105 TCS Zhang, Data Types with Errors and Exceptions 1992 105 TCS Dung, On the Relations between Stable and Well-founded Semantics of Logic Programs 1992 105 TCS Kanchanasut & Stuckey, Transforming Normal Logic Programs to Constraint Logic Programs 1992 105 TCS Sato, Equivalence-Preserving First-Order Unfold/Fold Transformation Systems 1992 105 TCS Gabbrielli & Levi, Unfolding and Fixpoint Semantics of Concurrent Constraint Logic Programs 1992 105 TCS Hofbauer, Termination Proofs by Multiset Path Orderings Imply Primitive Recursive Derivation Lengths 1992 105 TCS Debart & Enjalbert & Lescot, Multimodal Logic Programming Using Equational and Order-Sorted Logic 1992 104 TCS Straubing & Weil, On a Conjecture Concerning Dot-Depth Two Languages 1992 104 TCS Kim & Sudborough, On Reversal-Bounded Picture Languages 1992 104 TCS Takada, Learning Semilinear Sets from Examples and via Queries 1992 104 TCS Weir, A Geometric Hierarchy beyond Context-free Languages 1992 104 TCS Bovet & Crescenzi & Silvestri, A Uniform Approach to Define Complexity Classes 1992 104 TCS Jansen, Processor Optimization for Flow Graphs 1992 104 TCS Leermakers, Recursive Ascent Parsing: From Earley to Marcus 1992 104 TCS Leermakers & Augusteijn & Kruseman Aretz, A Functional LR-Parser 1992 104 TCS Bol, Generalizing Completeness Results for Loop Checks in Logic Programming 1992 104 TCS Jouannaud & Marche, Termination and Completion Modulo Associativity, Commutativity and Identity 1992 104 TCS Hennicker, A Semi-Algorithm for Algebraic Implementation Proofs 1992 104 TCS Limongelli & Temperini, Abstract Specification of Structures and Methods in Symbolic Mathematical Computation 1992 104 TCS Stickel, A Prolog Technology Theorem Prover: A New Exposition and Implementation in Prolog 1992 104 TCS Talcott, A Theory for Program and Data Type Specification 1992 103 TCS Bauderon, Infinite Hypergraphs II. Systems of Recursive Equations 1992 103 TCS Hamaguchi & Hiraishi & Yajima, infinite-Regular Temporal Logic and Its Model Checking Problem 1992 103 TCS Palopoli, Testing Logic Programs for Local Stratification 1992 103 TCS Felleisen & Hieb, The Revised Report on the Syntactic Theories of Sequential Control and State 1992 103 TCS Kurihara & Ohuchi, Modularity of Simple Termination of Term Rewriting Systems with Shared Constructors 1992 103 TCS Kim & Cho, A New Subsumption Method in the Connection Graph Proof Procedure 1992 103 TCS Gunter, The Mixed Power Domain 1992 103 TCS Maggiolo-Schettini & Winkowski, Towards an Algebra for Timed Behaviours 1992 103 TCS Marek & Subrahmanian, The Relationship between Stable, Supported, Default and Autoepistemic Semantics for General Logic Programs 1992 103 TCS Mairson, A Simple Proof of a Theorem of Statman 1992 103 TCS Streicher, Independence of the Induction Principle and the Axiom of Choice in the Pure Calculus of Constructions 1992 103 TCS Dauchet, Simulation of Turing Machines by a Regular Rewrite Rule 1992 103 TCS Beigel & Gill, Counting Classes: Thresholds, Parity, Mods, and Fewness 1992 103 TCS Cai & Condon & Lipton, On Games of Incomplete Information 1992 103 TCS Clerbout & Roos, Semicommutations and Algebraic Languages 1992 103 TCS Corradini & Montanari, An Algebraic Semantics for Structured Transition Systems and Its Applications to Logic Programs 1992 103 TCS Das & Joseph, Minimum Vertex Hulls for Polyhedral Domains 1992 103 TCS Lambert, Sorting the Sums (x_i + y_j) in O(n^2) Comparisons 1992 103 TCS Thomas, Infinite Trees and Automaton-Definable Relations over omega-Words 1992 102 TCS Bruschi, Strong Separations of the Polynomial Hierarchy with Oracles: Constructive Separations by Immune and Simple Sets 1992 102 TCS Skubiszewski, Binary Periodic Synchronizing Sequences 1992 102 TCS Dagum & Luby, Approximating the Permanent of Graphs with Large Factors 1992 102 TCS Mirwald & Schnorr, The Multiplicative Complexity of Quadratic Boolean Forms 1992 102 TCS Halpenny & Smyth, A Classification of Minimal Standard-Path 2 x 2 Switching Networks 1992 102 TCS Prasad & Iyengar, An Asymptotic Equality for the Number of Necklaces in a Shuffle-Exchange Network 1992 102 TCS Grue, Map Theory 1992 102 TCS van Bakel, Complete Restrictions of the Intersection Type Discipline 1992 102 TCS Devillers, Maximality Preserving Bisimulation 1992 102 TCS Esparza & Silva, A Polynomial-Time Algorithm to Decide Liveness of Bounded Free Choice Nets 1992 102 TCS Dosen, Nonmodal Classical Linear Predicate Logic is a Fragment of Intuitionistic Linear Logic 1992 101 TCS Best & Desel & Esparza, Traps Characterize Home States in Free Choice Systems 1992 101 TCS Brookes & Geva, Towards a Theory of Parallel Algorithms on Concrete Data Structures 1992 101 TCS Bloom & Meyer, Experimenting with Process Equivalence 1992 101 TCS de Boer & Kok & Palamidessi & Rutten, From Failure to Success: Comparing a Denotational and a Declarative Semantics for Horn Clause Logic 1992 101 TCS Gunawardena, Causal Automata 1992 101 TCS Hooman & Ramesh & de Roever, A Compositional Axiomatization of Statecharts 1992 101 TCS Katz & Peled, Defining Conditional Independence Using Collapses 1992 101 TCS Courcelle, The Monadic Second-Order Logic of Graphs VII: Graphs as Relational Structures 1992 101 TCS Gradel, Capturing Complexity Classes by Fragments of Second-Order Logic 1992 101 TCS Mazoyer & Reimen, A Linear Speed-up Theorem for Cellular Automata 1992 101 TCS Michel, A Survey of Space Complexity 1992 101 TCS Peladeau, Formulas, Regular Languages and Boolean Circuits 1992 101 TCS de Rougemont, The Functional Dimension of Inductive Definitions 1992 100 TCS Moss & Meseguer & Goguen, Final Algebras, Cosemicomputable Algebras and Degrees of Unsolvability 1992 100 TCS Dezani-Ciancaglini & Hindley, Intersection Types for Combinatory Logic 1992 100 TCS Bartha, Foundations of a Theory of Synchronous Systems 1992 100 TCS Wang, On Characterizing Boundedness of Database Schemes with Bounded Dependencies 1992 100 TCS Back & Von Wright, Combining Angles, Demons and Miracles in Program Specifications 1992 100 TCS Meinke, Universal Algebra in Higher Types 1992 100 TCS Trahan & Loui & Ramachandran, Multiplication, Division and Shift Instructions in Parallel Random Access Machines 1992 100 TCS Goerdt, Characterizing Complexity Classes by Higher Type Primitive Recursive Definitions 1992 100 TCS De Luca & Varricchio, On Noncounting Regular Classes 1992 100 TCS Holte & Rosier & Tulchinsky & Varvel, Pinwheel Scheduling with Two Distinct Numbers 1992 100 TCS Benninger & Schmid, Effective Subdirect Decomposition: A Case Study 1992 100 TCS Board & Pitt, On the Necessity of Occam Algorithms 1992 100 TCS Santoro & Sidney & Sidney, A Distributed Selection Algorithm and its Expected Communication Complexity 1992 100 TCS Toda & Watanabe, Polynomial Time 1-Turing Reductions from #PH to #P 1992 100 TCS Erdos & Hsu, Distributed Loop Network with Minimum Transmission Delay 1992 100 TCS Prodinger, Hypothetical Analyses: Approximate Counting in the Style of Knuth, Path Length in the Style of Flajolet 1992 100 TCS Beame & Brisson & Ladner, The Complexity of Computing Symmetric Functions Using Threshold Circuits 1992 99 TCS Bozapalidis, Alphabetic Tree Relations 1992 99 TCS Nummenmaa, Constructing Compact Rectilinear Planar Layouts Using Canonical Representation of Planar Graphs 1992 99 TCS Neraud, On the Rank of the Subsets of a Free Monoid 1992 99 TCS Ibarra & Tran, On Space-bounded Synchronized Alternating Turing Machines 1992 99 TCS Zhang, Efficient Simplicity Testing of Automata 1992 99 TCS Balcazar & Schoening, Logarithmic Advice Classes 1992 99 TCS Varricchio, On the Decidability of the Equivalence Problem for Partially Commutative Rational Power Series 1992 99 TCS Ibarra & Jiang & Wang, A Characterization of Exponential-Time Languages by Alternating Context-free Grammars 1992 99 TCS Fouks, Tseitin's Formulas Revisited 1992 99 TCS Mosse, Puissances de Mots et Reconnaissabilite des Points Fixes d'une Substitution 1992 99 TCS Hoang, A Parallel Algorithm for Minimum Weighted Colouring of Triangulated Graphs 1992 99 TCS Cazanescu & Stefanescu, A General Result on Abstract Flowchart Schemes with Applications to the Study of Accessibility, Reduction and Minimization 1992 99 TCS Hein, Completions of Perpetual Logic Programs 1992 99 TCS Lambert, A Structure to Decide Reachability in Petri Nets 1992 99 TCS Hesselink, Processes and Formalisms for Unbounded Choice 1992 99 TCS Priese & Nolte, Strong Fairness and Ultra Metrics 1992 99 TCS Mulry, Monads and Algebras in the Semantics of Partial Data Types 1992 99 TCS Rajasekaran & Reif, Nested Annealing: A Provable Improvement to Simulated Annealing 1992 98 TCS Allouche & Shallit, The Ring of k-Regular Sequences 1992 98 TCS Schwer, The Context-freeness of the Languages Associated with Vector Addition Systems is Decidable 1992 98 TCS Santean & Kari, The Impact of the Number of Cooperating Grammars on the Generative Power 1992 98 TCS Yen, A Multiparameter Analysis of Domino Tiling with an Application to Concurrent Systems 1992 98 TCS Palis & Shende, Upper Bounds on Recognition of a Hierarchy of Non-Context-free Languages 1992 98 TCS Van & Huy, Varieties of Finite Monoids and Buchi-McNaughton Theorem 1992 98 TCS Chrobak & Larmore, HARMONIC is 3-Competitive for Two Servers 1992 98 TCS Amtoft & Traff, Partial Memoization for Obtaining Linear Time Behavior of a 2DPDA 1992 98 TCS Choffrut, Rational Relations and Rational Series 1992 98 TCS Karhumaki, Multiplicities: A Deterministic View of Nondeterminism 1992 98 TCS Karner, On Transductions of Formal Power Series over Complete Semirings 1992 98 TCS Varricchio, Rational Series with Coefficients in a Commutative Ring 1992 98 TCS Bjorner & Reutenauer, Rationality of the Mobius Function of Subword Order 1992 98 TCS Delest & Fedou, Attribute Grammars are Useful for Combinatorics 1992 98 TCS Cauchon, Series de Malcev-Neumann sur le Groupe Libre et Questions de Rationalite 1992 98 TCS Dumas, Skew Power Series Rings with General Commutation Formula 1992 98 TCS Mourrain, Computable Identities in the Algebra of Formal Matrices 1992 98 TCS Diop, Differential-Algebraic Decision Methods and Some Applications to System Theory 1992 97 TCS Krentel, Generalizations of Opt P to the Polynomial Hierarchy 1992 97 TCS Watanabe & Tang, On Polynomial-Time Turing and Many-One Completeness in PSPACE 1992 97 TCS Yoo & Hashiguchi, Extended Regular Expressions of Arbitrary Star Degrees 1992 97 TCS Muller & Saoudi & Schupp, Alternating Automata, the Weak Monadic Theory of Trees and Its Complexity 1992 97 TCS Karner, Nivat's Theorem for Pushdown Transducers 1992 97 TCS Shore & Slaman, The p-T-Degrees of the Recursive Sets: Lattice Embeddings, Extensions of Embeddings and the Two-Quantifier Theory 1992 97 TCS Hromkovic & Lozkin & Rybko & Sapozenko & Skalikova, Lower Bounds on the Area Complexity of Boolean Circuits 1992 97 TCS Guaiana & Restivo & Salemi, Star-free Trace Languages 1992 97 TCS Girard & Scedrov & Scott, Bounded Linear Logic: A Modular Approach to Polynomial-Time 1992 97 TCS German, Semantics and Reasoning with Free Procedures 1992 97 TCS Perraud & Roux & Huou, Operational Semantics of a Kernel of the Language ELECTRE 1992 97 TCS Monfroglio, Integer Programs for Logic Constraint Satisfaction 1992 97 TCS Darondeau & Nolte & Priese & Yoccoz, Fairness, Distances and Degrees 1992 97 TCS Baratella, A Completeness Result for Allowed Semi-strict Programs with Respect to Well-behaved and Allowed Query Clauses 1992 97 TCS Weibel, Extension of Combinatory Logic to a Theory of Combinatory Representation 1992 97 TCS Doets, A Slight Strengthening of a Theorem of Blair and Kunen 1992 96 TCS Garg & Ragunath, Concurrent Regular Expressions and their Relationships to Petri Nets 1992 96 TCS Huynh, Nonuniform Complexity and the Randomness of Certain Complete Languages 1992 96 TCS Ito & Jurgensen & Shyr & Thierrin, Languages Whose n-Element Subsets are Codes 1992 96 TCS Barua, The Hausdorff-Kuratowski Hierarchy of omega-Regular Languages and a Hierarchy of Muller Automata 1992 96 TCS Plambeck, Daisies, Kayles, and the Sibert-Conway Decomposition in Misere Octal Games 1992 96 TCS Ferguson, Mate with Bishop and Knight in Kriegspiel 1992 96 TCS Duchamp & Krob, On the Partially Commutative Shuffle Product 1992 96 TCS Slobodova, Some Properties of Space-bounded Synchronized Alternating Turing Machines with Universal States Only 1992 96 TCS Nielsen & Rozenberg & Thiagarajan, Elementary Transition Systems 1992 96 TCS Mukund & thiagarajan, A Logical Characterization of Well Branching Event Structures 1992 96 TCS Meseguer, Conditioned Rewriting Logic as a Unified Model of Concurrency 1992 96 TCS Bradfield & Stirling, Local Model Checking for Infinite State Spaces 1992 96 TCS Best & Koutny, Petri Net Semantics of Priority Systems 1992 96 TCS Berry & Boudol, The Chemical Abstract Machine 1992 96 TCS Astesiano & Giovini & Reggio, Observational Structures and their Logics 1992 95 TCS Moulin & Ollagnier, Proof of Dejean's Conjecture for Alphabets with 5, 6, 7, 8, 9, 10 and 11 Letters 1992 95 TCS Quinton & Robert, Systolic Convolution of Arithmetic Functions 1992 95 TCS Rabani & Galil, On the Space Complexity of Some Algorithms for Sequence Comparison 1992 95 TCS Ausiello & Italiano & Marchetti Spaccamela & Nanni, On-line Computation of Minimal and Maximal Length Paths 1992 95 TCS Zhang, Polynomial-Time Algorithms for Testing Strong Isomorphism and Computing the Automorphism Group of R-Strongly Connected Automata 1992 95 TCS Pierre, Rational Indexes of Generators of the Cone of Context-free Languages 1992 95 TCS Spencer, Ulam's Searching Game with a Fixed Number of Lies 1992 95 TCS Akl & Cosnard & Ferreira, Data-Movement-Intensive Problems: Two Folk Theorems in Parallel Computation Revisited 1992 95 TCS Shankar & Adiga, Corrigendum: A Graph-based Regularity Test for Deterministic Context-free Languages 1992 95 TCS Vianu & Vossen, Conceptual Level Concurrency Control of Relational Update Transactions 1992 95 TCS Giordano & Martelli & Rossi, Extending Horn Clause Logic with Implication Goals 1992 95 TCS Sain, Temporal Logics Need Their Clocks 1992 95 TCS Arikawa & Shinohara & Yamamoto, Learning Elementary Formal Systems 1992 95 TCS Bellin & Ketonen, A Decision Procecure Revisited: Notes on Direct Logic, Linear Logic and its Implementation 1992 95 TCS Jacobs & Margaria & Zacchi, Filter Models with Polymorphic Types 1992 95 TCS Schwer, Fine Covers of a VAS Language 1992 95 TCS Beauquier, Two Distributed Problems Involving Byzantine Processes 1992 94 TCS Allouche & Morton & Shallit, Pattern Spectra, Substring Enumeration, and Automatic Sequences 1992 94 TCS Baratchart & Olivi & Wielonsky, On a Rational Approximation Problem in the Real Hardy Space H_2 1992 94 TCS Dehornoy, Probleme de Mots dans les Gerbes Libres 1992 94 TCS Ferenczi, Tiling the Morse Sequence 1992 94 TCS Frougny, Systemes de Numeration Lineaires et theta-Representations 1992 94 TCS Galmiche, Program Development in Constructive Type Theory 1992 94 TCS Gardy, Methode de Col et Lois Limites en Analyse Combinatoire 1992 94 TCS Gil, Complete Extension of General Logic Programs 1992 94 TCS Lachaud, Artin-Schreier Curves, Exponential Sums, and Coding Theory 1992 94 TCS Mery, The NU System as a Development System for Concurrent Programs: delta NU 1992 94 TCS Parigot, Recursive Programming with Proofs 1992 94 TCS Perrin, On Positive Matrices 1992 94 TCS Restivo, A Note on Renewal Systems 1992 94 TCS Wen & Wen, Some Studies on the (p,q)-type Sequences 1992 94 TCS Waldmann, Semantics of Order-sorted Specifications 1992 94 TCS Lamarche, Quantitative Domains and Infinitary Algebras 1992 94 TCS Filippenko & Morris, Domains for Logic Programming 1992 94 TCS Manca & Salibra, Soundness and Completeness of the Birkhoff Equational Calculus for Many-sorted Algebras with Possibly Empty Carrier Sets 1992 94 TCS Caspi, Clocks in Dataflow Languages 1992 94 TCS Koutny, Adequacy-preserving Transformations of COSY Path Programs 1992 93 TCS Peladeau, Logically Defined Subsets of N^k 1992 93 TCS Hiraishi & Ichikawa, On Structural Conditions for Weak Persistency and Semilinearity of Petri Nets 1992 93 TCS Louchard & Randrianarimanana & Schott, Dynamic Algorithms in D. E. Knuth' Model: A Probabilistic Analysis 1992 93 TCS Bonizzoni & Mauri, On Automata on Infinite Trees 1992 93 TCS Kedem & Palem, Optimal Parallel Algorithms for Forest and Term Matching 1992 93 TCS Toda, Restricted Relativizations of Probabilistic Polynomial Time 1992 93 TCS Ramanan, Testing the Optimality of Alphabetic Trees 1992 93 TCS Boyar & Frandsen & Sturtivant, An Arithmetic Model of Computation Equivalent to Threshold Circuits 1992 93 TCS Dehornoy, A Criterion for Proving Noetherianity of a Relation 1992 93 TCS Herbst, On a Kind of Fatou Property of Context-free Groups 1992 93 TCS Kfoury & Tiuryn & Urzyczyn, On the Expressive Power of Finitely Typed and Universally Polymorphic Recursive Procedures 1992 93 TCS Vagvolgyi, Top-down Tree Transducers with Two-way Tree Walking Look-ahead 1992 93 TCS Revesz, A List-oriented Extension of the Lambda-Calculus Satisfying the Church-Rosser Theorem 1992 93 TCS Harrison & Khoshnevisan, A New Approach to Recursion Removal 1992 93 TCS Subrahmanian, Paraconsistent Disjunctive Deductive Databases 1992 93 TCS Zhang, Stable Neighbourhoods 1992 93 TCS Goerdt, Unrestricted Resolution versus N-Resolution 1992 92 TCS Ehrenfeucht & Rozenberg, Angular 2-Structures 1992 92 TCS Goldwurm, Probabilistic Estimation of the Number of Prefixes of a Trace 1992 92 TCS Hebisch & Weinert, Generalized Semigroup Semirings which are Zero-Divisor-Free or Multiplicatively Left-Cancellative 1992 92 TCS Bitar & Goles, Parallel Chip Firing Games on Graphs 1992 92 TCS Lutz, On Independent Random Oracles 1992 92 TCS Hemachandra & Rubinstein, Separating Complexity Classes with Tally Oracles 1992 92 TCS Edelsbrunner & Guibas & Pach & Pollack & Seidel & Sharir, Arrangements of Curves in the Plane -- Topology, Combinatorics and Algorithms 1992 92 TCS Apostolico & Browne & Guerra, Fast Linear-Space Computations of Longest Common Subsequences 1992 92 TCS Baeza-Yates & Regnier, Average Running Time of the Boyer-Moore-Horspool Algorithm 1992 92 TCS Crochemore, String-Matching on Ordered Alphabets 1992 92 TCS Galil & Park, Dynamic Programming with Convexity, Concavity, and Sparsity 1992 92 TCS Hashiguchi & Yamada, Two Recognizable String-Matching Problems over Free Partially Commutative Monoids 1992 92 TCS Iliopoulos & Smyth, Optimal Algorithms for Computing the Canonical Form of a Circular String 1992 92 TCS Kim & Shawe-Taylor, An Approximate String-Matching Algorithm 1992 92 TCS Lecroq, A Variation of the Boyer-Moore Algorithm 1992 92 TCS Neraud & Crochemore, A String Matching Interpretation of the Equation x^m y^n = z^p 1992 92 TCS Quong, Fast Average-Case Pattern Matching by Multiplexing Sparse Tables 1992 92 TCS Revuz, Minimisation of Acyclic Deterministic Automata in Linear Time 1992 92 TCS Ukkonen, Approximate String Matching with q-grams and Maximal Matches 1992 92 TCS Zipstein, Data Compression with Factor Automata 1991 91 TCS Kearney & Staples, An Extensional Fixed-Point Semantics for Nondeterministic Data Flow 1991 91 TCS Knijnenburg & van Leeuwen, On Models for Propositional Dynamic Logic 1991 91 TCS Vogler, Executions: A New Partial-Order Semantics of Petri Nets 1991 91 TCS Tarlecki & Burstall & Goguen, Some Fundamental Algebraic Tools for the Semantics of Computation: Part 3. Indexed Categories 1991 91 TCS Zhang, Cut Elimination and Automatic Proof Procedures 1991 91 TCS Rozoy & Thiagarajan, Event Structures and Trace Monoids 1991 91 TCS Srinivasan & Rangan, Efficient Algorithms for the Minimum Weighted Dominating Clique Problem on Permutation Graphs 1991 91 TCS Buneman & Jung & Ohori, Using Powerdomains to Generalize Relational Databases 1991 91 TCS Culik & Dube, An Efficient Solution of the Firing Mob Problem 1991 91 TCS Arfi, Operations Polynomiales et Hierarchies de Concatenation 1991 91 TCS Hashiguchi, Algorithms for Determining Relative Inclusion Star Height and Inclusion Star Height 1991 91 TCS Kinber, On Complete Sets of Samples for Generalized Regular Expressions 1991 90 TCS Rus, Algebraic Construction of Compilers 1991 90 TCS Tatsuta, Program Synthesis Using Realizability 1991 90 TCS Saito, Dynamics of Equivalence Relations in Automata Networks 1991 90 TCS Toyama, How To Prove Equivalence of Term Rewriting Systems without Induction 1991 90 TCS Dong & Ginsburg, Localizable Constraints for Object Histories 1991 90 TCS Vakarelov, Modal Logics for Knowledge Representation Systems 1991 90 TCS Knuth, Theory and Practice 1991 90 TCS Pottosin, Analysis of Program Optimization Possibilities and Further Development 1991 90 TCS Kasyanov, Transformational Approach to Program Concretization 1991 90 TCS Bulyonkov, From Partial Evaluation to Mixed Computation 1991 90 TCS Futamura & Nogi & Takano, Essence of Generalized Partial Computation 1991 90 TCS Itkin, An Algebra of Mixed Computation 1991 90 TCS Jones, Static Semantics, Types, and binding Time Analysis 1991 90 TCS Turski, Prescribing Behaviours 1991 90 TCS de Bakker & Warmerdam, Four Domains for Concurrency 1991 90 TCS Cherkasova & Kotov, An Algebra of Concurrent Non-deterministic Processes 1991 90 TCS Mazurkiewicz & Rabinovich & Trakhtenbrot, Connectedness and Synchronization 1991 90 TCS Tyugu, Higher Order Dataflow Schemas 1991 90 TCS Barzdin & Barzdin, Rapid Constructions of Algebraic Axioms from Samples 1991 90 TCS Blikle & Tarlecki & Thorup, On Conservative Extensions of Syntax in System Development 1991 90 TCS Hoare, A Theory for the Derivation of Combinational C-mos Circuit Designs 1991 90 TCS Nepejvoda, A Bridge between Constructive Logic and Computer Programming 1991 89 TCS Krob, Complete Systems of B-Rational Identities 1991 89 TCS Ganzinger, Order-sorted Completion: The Many-sorted Way 1991 89 TCS Habel & Kreowski & Vogler, Decidable Boundedness Problems for Sets of Graphs Generated by Hyperedge-replacement 1991 89 TCS Hanus, Horn Clause Programs with Polymorphic Types: Semantics and Resolution 1991 89 TCS Harper & Pollack, Type Checking with Universes 1991 89 TCS Pfenning & Lee, Metacircularity in the Polymorphic lambda-Calculus 1991 89 TCS Stirling & Walker, Local Model Checking in the Modal mu-Calculus 1991 89 TCS Vissers & Scollo & van Sinderen & Brinksma, Specification Styles in Distributed Systems Design and Verification 1991 88 TCS Gavalda & Balcazar, Strong and Robustly Strong Polynomial-Time Reducibilities to Sparse Sets 1991 88 TCS Larsen & Thomsen, Partial Specifications and Compositional Verification 1991 88 TCS Miyano, Delta_2^P-Complete Lexicographically First Maximal Subgraph Problems 1991 88 TCS Crochemore & Rytter, Usefulness of the Karp-Miller-Rosenberg Algorithm in Parallel Computations on Strings and Arrays 1991 88 TCS Garzon & Zalcstein, The Complexity of Grigorchuk Groups with Application to Cryptography 1991 88 TCS Cho & Huynh, Finite-Automaton Aperiodicity is PSPACE-Complete 1991 88 TCS Shankar & Adiga, A Graph-based Regularity Test for Deterministic Context-free Languages 1991 88 TCS Salomaa, A Deterministic Algorithm for Modular Knapsack Problems 1991 88 TCS Engelfriet, A Regular Characterization of Graph Languages Definable in Monadic Second-order Logic 1991 88 TCS Aizawa & Nakamura, Graph Grammars with Path-controlled Embedding 1991 88 TCS Labhalla & Lombardi, Representations des Nombres Reels par Developpements en Base Entiere et Complexite 1991 88 TCS Khuller & Vazirani, Planar Graph Coloring is not Self-reducible, Assuming P != NP 1991 88 TCS Seki & Matsumura & Fujii & Kasami, On Multiple Context-free Grammars 1991 88 TCS Huckenbeck, A Result about the Power of Geometric Oracle Machines 1991 88 TCS Fulop, A Complete Description for a Monoid of Deterministic Bottom-Up Tree Transformation Classes 1991 88 TCS Peeva, Equivalence, Reduction and Minimization of Finite Automata over Semirings 1991 88 TCS Inoue & Ito & Takanami, A Note on Real-time One-way Alternating Multicounter Machines 1991 88 TCS Bebjak & Stefanekova, Separation of Deterministic, Nondeterministic and Alternating Complexity Classes 1991 88 TCS Baur, On the Algebraic Complexity of Rational Iteration Procedures 1991 88 TCS Weber & Seidl, On the Degree of Ambiguity of Finite Automata 1991 88 TCS Yoo & Hashiguchi, Extended Automata-like Regular Expressions of Star Degree At Most (2,1) 1991 88 TCS Seebold, Fibonacci Morphisms and Sturmian Words 1991 87 TCS Esik, Results on Homomorphic Realization of Automata by alpha_0-Products 1991 87 TCS Diks & Rytter, On Optimal Parallel Computations for Sequences of Brackets 1991 87 TCS Gyssens & Van Gucht, A Comparison between Algebraic Query Languages for Flat and Nested Databases 1991 87 TCS Csuhaj-Varju & Dassow, On Bounded Interpretations of Grammar Forms 1991 87 TCS de Luca & Varricchio, Finiteness and Iteration Conditions for Semigroups 1991 87 TCS Nirmal & Rama, Machine Characterization of (E0L-E0L) Array Languages 1991 87 TCS Calude, Relativized Topological Size of Sets of Partial Recursive Functions 1991 87 TCS Stoltenberg-Hansen & Tucker, Algebraic and Fixed Point Equations over Inverse Limits of Algebras 1991 87 TCS Farmer, Simple Second-order Languages for which Unification is Undecidable 1991 87 TCS Heibig, Control Machines: A New Model of Parallelism for Compositional Specifications and Their Effective Compilation 1991 87 TCS Balsters & Fokkinga, Subtyping Can Have a Simple Semantics 1991 87 TCS Fournier & von Bochmann, The Equivalence in the DCP Model 1991 87 TCS Hallnas, Partial Inductive Definitions 1991 87 TCS Gardiner & Morgan, Data Refinement of Predicate Transformers 1991 87 TCS Zierer, Relation Algebraic Domain Constructions 1991 87 TCS Wilm, Determinism and Non-determinism in PDL 1991 87 TCS Mezghiche, Weak Completeness of Type Assignment in lambda-Calculus Models: A Generalization of Hindley's Result 1991 87 TCS Milner & Tofte, Co-induction in Relational Semantics 1991 87 TCS McCune & Wos, The Absence and the Presence of Fixed Point Combinators 1991 86 TCS Averbuch & Galil & Winograd, Classification of All the Minimal Bilinear Algorithms for Computing the Coefficients of the Product of Two Polynomials Modulo a Polynomial. Part II: The Algebra G[u]/ 1991 86 TCS Spehner, Merging in Maps and in Pavings 1991 86 TCS Hashiguchi, Recognizable Closures and Submonoids of Free Partially Commutative Monoids 1991 86 TCS Chrobak & Eppstein, Planar Orientations with Low Out-degree and Compaction of Adjacency Matrices 1991 86 TCS Krause & Meinel & Waack, Separating the Eraser Turing Machine Classes L_e, NL_e, co-NL_e and P_e 1991 86 TCS Gire & Nivat, Langages Algebriques de Mots Biinfinis 1991 86 TCS Bertoni & Goldwurm & Sabadini, The complexity of Computing the Number of Strings of Given Length in Context-free Languages 1991 86 TCS Seger, On the Existence of Speed-independent Circuits 1991 86 TCS Capocelli & Gargano & Vaccaro, Decoders with Initial State Invariance for Multivalued Encodings 1991 86 TCS Benedek & Itai, Learnability with Respect to Fixed Distributions 1991 86 TCS de Boer & Rutten & Kok & Palamidessi, Semantic Models for Concurrent Logic Languages 1991 86 TCS Bol & Apt & Klop, An Analysis of Loop Checking Mechanisms for Logic Programs 1991 86 TCS Cavedon, Acyclic Logic Programs and the Completeness of SLDNF-Resolution 1991 86 TCS Lobo & Rajasekar & Minker, Semantics of Horn and Disjunctive Logic Programs 1991 86 TCS Seki, Unfold/Fold Transformations of Stratified Programs 1991 85 TCS Cialdea, Resolution for Some First-order Model Systems 1991 85 TCS Doggaz & Kirchner, Completion for Unification 1991 85 TCS Sopena, Hypermap Rewriting: A Combinatorial Approach 1991 85 TCS Tennent & Tobin, Continuations in Possible-World Semantics 1991 85 TCS Kamper, Nonuniform Proof Systems: A New Framework to Describe Nonuniform and Probabilistic Complexity Classes 1991 85 TCS Goto, Proof Normalization with Nonstandard Objects 1991 85 TCS Bethke, Coherence Spaces are Untopological 1991 85 TCS Wang, On p-Creative Sets and p-Completely Creative Sets 1991 85 TCS Devolder & Litovsky, Finitely Generated bi omega-Languages 1991 85 TCS Ibarra & Jiang & Wang, Parallel Parsing on a One-way Linear Array of Finite-state Machines 1991 85 TCS Lindell, An Analysis of Fixed-Point Queries on Binary Trees 1991 85 TCS Rodenburg, Algebraic Specifiability of Data Types with Minimal Computable Parameters 1991 85 TCS Szpankowski, A Characterization of Digital Search Trees from the Successful Search Viewpoint 1991 85 TCS Kutylowski, Multihead One-way Finite Automata 1991 85 TCS Wegener, The Complexity of the Parity Function in Unbounded Fan-in, Unbounded Depth Circuits 1991 85 TCS Cherubini & Citrini & Crespi Reghizzi & Mandrioli, QRT FIFO Automata, Breadth-first Grammars and their Relations 1991 85 TCS Michel, An NP-Complete Language Accepted in Linear Time by a One-tape Turing Machine 1991 84 TCS Clausen & Dress & Grabmeier & Karpinski, On Zero-Testing and Interpolation of k-Sparse Multivariate Polynomials over Finite Fields 1991 84 TCS Saoudi, Generalized Automata on Infinite Trees and Muller-McNaughton's Theorem 1991 84 TCS Moran & Wolfstahl, Optimal Covering of Cacti by Vertex-disjoint Paths 1991 84 TCS Beigel, Bounded Queries to SAT and the Boolean Hierarchy 1991 84 TCS Becker & Sparmann, Computations over Finite Monoids and their Test Complexity 1991 84 TCS Rupert, Which Kleene Semigroups are Finite? 1991 84 TCS Maurer & Salomaa & Wood, Bounded Delay L Codes 1991 84 TCS Dassow & Jurgensen, Deterministic Soliton Automata with a Single Exterior Node 1991 84 TCS Baldwin & Strawn, Multidimensional Trees 1991 84 TCS Beauquier & Pin, Languages and Scanners 1991 84 TCS Brassard & Crepeau & Yung, Constant-Round Perfect Zero-Knowledge Computationally Convincing Protocols 1991 84 TCS Bruyere, Maximal Codes with Bounded Deciphering Delay 1991 84 TCS Chazelle & Edelsbrunner & Guibas & Sharir, A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and its Applications 1991 84 TCS Gambosi & Nardelli & Talamo, A Pointer-free Data Structure for Merging Heaps and min-max Heaps 1991 84 TCS Papadimitriou & Yannakakis, Shortest Paths Without a Map 1991 83 TCS Luckhardt, New Formally Undecidable Propositions: Non-trivial Lower Bounds on Proof Complexity and Related Theorems 1991 83 TCS Mauro, Derived Linear Systems of Context-free Grammars 1991 83 TCS de Boer & Lindenmayer & Tuza, A Periodic Division Pattern that Cannot be Generated by D0L Systems 1991 83 TCS Labhalla, Complexite du Calcul du Developpement d'un Nombre Reel en Fractions Continues 1991 83 TCS Seki & Kobuchi, On Standard Locally Catenative L Schemes 1991 83 TCS Fachini & Schettini & Resta & Sangiorgi, Nonacceptability Criteria and Closure Properties for the Class of Languages Accepted by Binary Systolic Tree Automata 1991 83 TCS Kuster, On the Hurwitz Product of Formal Power Series and Automata 1991 83 TCS Azar, Parallel Comparison Merging of Many-Ordered Lists 1991 83 TCS Kundu, Minimal Strings in a Regular Language with Respect to a Partial Order on the Alphabet 1991 83 TCS Cohen-Chesnot, On the Expressive Power of Temporal Logic for Infinite Words 1991 83 TCS Hemachandra & Wechsung, Kolmogorov Characterizations of Complexity Classes 1991 83 TCS Mostowski, Hierarchies of Weak Automata and Weak Monadic Formulas 1991 83 TCS Watanabe, On the p-Isomorphism Conjecture 1991 83 TCS Breazu-Tannen & Gallier, Polymorphic Rewriting Conserves Algebraic Strong Normalization 1991 83 TCS Cardone, Recursive Types for Fun 1991 83 TCS Colson, About Primitive Recursive Algorithms 1991 83 TCS Dershowitz & Kaplan & Plaisted, Rewrite, Rewrite, Rewrite, Rewrite, Rewrite... 1991 83 TCS Manna & Pnueli, Completing the Temporal Picture 1991 83 TCS Parisi-Presicce, Foundations of Rule-based Design of Modular Systems 1991 83 TCS Winskel, A Note on Model Checking the Model nu-Calculus 1991 82 TCS Bauderon, Infinite Hypergraphs I. Basic Properties 1991 82 TCS Germano & Mazzanti, Closure Functions and General Iterates as Reflectors 1991 82 TCS Abadi & Lamport, The Existence of Refinement Mappings 1991 82 TCS Baeten & Bergstra, Recursive Process Definitions with the State Operator 1991 82 TCS Lukassen & Vossen, A Formal Framework for Independence with Respect to Transactions in the Universal Relation Model 1991 82 TCS Szwast, On Horn Spectra 1991 82 TCS Howell & Rosier & Yen, A Taxonomy of Fairness and Temporal Logic Problems for Petri Nets 1991 82 TCS Denis & Delahaye, Is there an Axiomatic Semantics for Standard Pure Prolog? 1991 82 TCS Curien, An Abstract Framework for Environment Machines 1991 82 TCS Badouel & Darondeau, On Guarded Recursion 1991 82 TCS Hoofman, Weakly Expressive Models for Hoare Logic 1991 82 TCS Weihrauch & Kreitz, Type 2 Computational Complexity of Functions on Cantor Space 1991 82 TCS Lando, Periodicity and Ultimate Periodicity of D0L Systems 1991 82 TCS Hebrard, An Algorithm for Distinguishing Efficiently Bit-Strings by their Subsequences 1991 82 TCS Ko, On Adaptive versus Nonadaptive Bounded Query Machines 1991 82 TCS Mignosi, On the Number of Factors of Sturmian Words 1991 82 TCS Snir, Size-Depth Trade-offs for Monotone Arithmetic Circuits 1991 82 TCS Engelfriet & Leih & Rozenberg, Nonterminal Separation in Graph Grammars 1991 82 TCS Dietzfelbinger & Maass & Schnitger, The Complexity of Matrix Transposition on One-tape Off-line Turing Machines 1991 82 TCS Salomaa & Yu, Decidability of Structural Equivalence of E0L Grammars 1991 82 TCS Robson, An O(T log T) Reduction from RAM Computations to Satisfiability 1991 82 TCS Calude & Istrate, Determining and Stationary Sets for Some Classes of Partial Recursive Functions 1991 82 TCS Palko & Sykora & Vrto, Area Complexity of Merging 1991 82 TCS Leo, A General Context-free Parsing Algorithm Running in Linear Time on Every LR(k) Grammar without Using Lookahead 1991 81 TCS Fulop & Vagvolgyi, A Complete Classification of Deterministic Root-to-Frontier Tree Transformation Classes 1991 81 TCS Boe, Les Boites 1991 81 TCS Tang & Book, Polynomial-Time Reducibilities and `Almost All' Oracle Sets 1991 81 TCS Dubois, Counting the Number of Solutions for Instances of Satisfiability 1991 81 TCS Dubois & Carlier, Probabilistic Approach to the Satisfiability Problem 1991 81 TCS Piotrow, On the Complexity of Counting in the Polynomial Hierarchy 1991 81 TCS Amir & Landau, Fast Parallel and Serial Multidimensional Approximate Array Matching 1991 81 TCS Matus, Abstract Functional Dependency Structures 1991 81 TCS Lutz, An Upward Measure Separation Theorem 1991 81 TCS Leung, Limitedness Theorem on Finite Automata with Distance Functions: An Algebraic Proof 1991 81 TCS Cori & Formisano, On the Number of Partially Abelian Square-free Words on a Three-Letter Alphabet 1991 81 TCS Hartmanis & Hemachandra, One-way functions and the Nonisomorphism of NP-Complete Sets 1991 80 TCS Andreka & Nemeti & Sain, On the Strength of Temporal Proofs 1991 80 TCS Courcelle, The Monadic Second-order Logic of Graphs V: On Closing the Gap between Definability and Recognizability 1991 80 TCS Hemachandra & Hoene & Siefkes & Young, On Sets Polynomially Enumerable by Iteration 1991 80 TCS Iwanowski, Testing Approximate Symmetry in the Plane is NP-hard 1991 80 TCS Olderog, Correctness of Concurrent Processes 1991 80 TCS Ranjan & Chang & Hartmanis, Space Bounded Computations: Review and New Separation Results 1991 80 TCS Steffen & Knoop, Finite Constants: Characterizations of a New Decidable Set of Constants 1991 80 TCS Szczepanska, A Hoare-like Verification System for a Language with an Exception Handling Mechanism 1991 80 TCS Wiedermann, On the Computational Efficiency of Symmetric Neural Networks 1991 80 TCS Reisig, Petri Nets and Algebraic Specifications 1991 80 TCS Gecseg & Jurgensen, On alpha_0-nu_1-Products of Automata 1991 80 TCS Heilbrunner & Schmitz, An Efficient Recognizer for the Boolean Closure of Context-free Languages 1991 80 TCS Howell & Rosier & Yen, Global and Local Views of State Fairness 1991 80 TCS Powell & Ngo, Complexity of Optimal Vector Code Generation 1991 80 TCS Hofer, Experiments and Stability in Group Automata 1991 79B TCS Vaandrager, Determinism --> (Event Structure Isomorphism = Step Sequence Equivalence) 1991 79B TCS Holden, Weak Logic Theory 1991 79B TCS Jaoua & Mili & Boudriga & Durieux, Regularity of Relations: A Measure of Uniformity 1991 79B TCS Szalas, On Strictly Arithmetical Completeness in Logics of Programs 1991 79B TCS Stoughton, Interdefinability of Parallel Operations in PCF 1991 79B TCS Jung, The Dependent Product Construction in Various Categories of Domains 1991 79B TCS Koletsos, Polymorphic Lambda Calculus: The Church-Rosser Property 1991 79A TCS Anselmo, The Zig-zag Power Series: A Two-way Version of the * Operator 1991 79A TCS Bertoni & Bruschi & Goldwurm, Ranking and Formal Power Series 1991 79A TCS Flajolet & Salvy & Zimmerman, Automatic Average-case Analysis of Algorithms 1991 79A TCS Krob, Some Examples of Formal Series Used in Non-commutative Algebra 1991 79A TCS Kuich, Automata and Languages Generalized to omega-continuous Semirings 1991 79A TCS Hespel & Jacob, Approximation of Nonlinear Dynamic Systems by Rational Series 1991 79A TCS Minh, Evaluation Transform 1991 79A TCS Leroux & Viennot, A Combinatorial Approach to Nonlinear Functional Expansions: An Introduction with an Example 1991 79A TCS Oussous, Computation, on Macsyma, of the Minimal Differential Representation of Noncommutative Polynomials 1991 79A TCS Delest, Enumeration of Polyominoes Using Macsyma 1991 79A TCS Duchamp, Orthogonal Projection onto the Free Lie Algebra 1991 79A TCS Koseleff, Jeux de Mots dans les Algebres de Lie Libres: Quelques Bases et Formules 1991 79A TCS Rotella, Shuffle Product of Generating Series 1991 79A TCS Honkala, On Algebraic Generalized Zeta Functions of Formal Power Series 1991 78A TCS Engelfriet & Vogler, Modular Tree Transducers 1991 78A TCS Downey, On Computational Complexity and Honest Polynomial Degrees 1991 78A TCS Koenig, Graphs and Free Partially Commutative Monoids 1991 78A TCS Harju & Karhumaki, The Equivalence Problem of Multitape Finite Automata 1991 78A TCS Barrington & Corbett, A Note on Some Languages in Uniform ACC^0 1991 78A TCS Baeza-Yates, Searching Subsequences 1991 78A TCS Borosch & Demetrovics & Katona & Kleitman & Sapozhenko, On the Number of Databases and Closure Operations 1991 78B TCS Bidoit, Negation in Rule-based Database Languages: A Survey 1991 78B TCS Bidoit & Froidevaux, Negation by Default and Unstratifiable Logic Programs 1991 78B TCS Royer, The Semantics of Incomplete Databases as an Expression of Preferences 1991 78B TCS Abiteboul & Simon, Fundamental Properties of Deterministic and Nondeterministic Extensions of Datalog 1991 78B TCS Abiteboul & Kanellakis & Grahne, On the Representation and Querying of Sets of Possible Worlds 1991 78B TCS Delahaye & Thibau, Programming in Three-valued Logic 1991 78B TCS Courcelle, Recursive Queries and Context-free Graph Grammars 1991 78B TCS Demolombe, An Efficient Strategy for Non-Horn Deductive Databases 1990 77 TCS Toda, Positive Relativizations for Log Space Computability 1990 77 TCS Bozapalides, Constructions Effectives sur les Series Formelles d'Arbres 1990 77 TCS Smith & Velauthapillai, On the Inference of Approximate Programs 1990 77 TCS Kawahara, Pushout-Complements and Basic Concepts of Grammars in Toposes 1990 77 TCS Atzeni & Chan, Efficient and Optimal Query Answering on Independent Schemes 1990 77 TCS Dowling & Kline, The Fixed Points of Logic Programs with Herbrand Base N 1990 77 TCS Fahmy, Analysis of Petri Nets by Partitioning: Splitting Transactions 1990 77 TCS Elbaz & Spehner, Construction of Voronoi Diagrams in the Plane by Using Maps 1990 77 TCS Bradley, Abstract Language Design 1990 77 TCS Ehrig & Fey & Hansen & Lowe & Jacobs & Parisi-Presicce, Compatibility Problems in the Development of Algebraic Module Specifications 1990 77 TCS Even & Schmidt, Category-sorted Algebra-based Action Semantics 1990 77 TCS Janicki & Muldner, Transformations of Sequential Specifications into Concurrent Specifications by Synchronization Guards 1990 77 TCS Manca & Salibra & Scollo, Equational Type Logic 1990 77 TCS Pigozzi, Data Types over Multiple-valued Logics 1990 77 TCS Wagner, An Algebraically Specified Language for Data Directed Design 1990 76 TCS Kok & Rutten, Contractions in Comparing Concurrency Semantics 1990 76 TCS Sakakibara, Learning Context-free Grammars from Structural Data in Polynomial Time 1990 76 TCS Timmerman, The Three Subfamilies of Rational omega-Languages Closed under omega-Transduction 1990 76 TCS Weil, Products of Languages with Counter 1990 76 TCS Tirri, The Congruence Theory of Closure Properties of Regular Tree Languages 1990 76 TCS Hashiguchi & Yoo, Extended Regular Expressions of Star Degree at Most Two 1990 76 TCS Petit, Distribution and Synchronized Automata 1990 76 TCS Yamasaki, Recursion Equation Sets Computing Logic Programs 1990 76 TCS Jiang, On the Complexity of 1-tape ATMs and Off-line 1-tape ATMs Running in Constant Reversals 1990 76 TCS Gannett & Kothari & Yen, On Optimal Parallelization of Sorting Networks 1990 76 TCS Sarnath & He, A P-Complete Graph Partition Problem 1990 76 TCS Bonner, Hypothetical Datalog: Complexity and Expressibility 1990 76 TCS Ohori, Semantics of Types for Database Objects 1990 76 TCS Karabeg & Vianu, Parallel Update Transactions 1990 76 TCS Lipeck, Transformation of Dynamic Integrity Constraints into Transaction Specifications 1990 76 TCS Dong & Ginsburg, On the Decomposition of Datalog Program Mappings 1990 75 TCS Degano & De Nicola & Montanari, A Partial Ordering Semantics for CCS 1990 75 TCS Katz & Peled, Interleaving Set Temporal Logic 1990 75 TCS Droste & Gobel, Non-deterministic Information Systems and their Domains 1990 75 TCS Blass & Fraenkel, The Sprague-Grundy Function for Wythoff's Game 1990 75 TCS Allender & Wilson, Downward Translations of Equality 1990 75 TCS Du & Leung & Young, Minimizing Mean Flow Time with Release Time Constraint 1990 75 TCS Lengauer & Wagner, The Binary Network Flow Problem is Logspace Complete for P 1990 75 TCS Milner, Interpreting One Concurrent Calculus in Another 1990 75 TCS de Bakker & Kok, Comparative Metric Semantics for Concurrent Prolog 1990 75 TCS Falaschi & Levi, Finite Failures and Partial Computations in Concurrent Logic Languages 1990 75 TCS Murakami, A Declarative Semantics of Flat Guarded Horn Clauses for Programs with Perpetual Processes 1990 75 TCS Holldobler, Conditional Equational Theories and Complete Sets of Transformations 1990 75 TCS Dershowitz & Okada, A Rationale for Conditional Equational Programming 1990 75 TCS Kawamura & Kanamori, Preservation of Stronger Equivalence in Unfold/Fold Logic Program Transformation 1990 75 TCS Devienne, Weighted Graphs: A Tool for Studying the Halting Problem and Time Complexity in Term Rewriting Systems and Logic Programming 1990 74 TCS Zhang & Yang & Deng, The Parallel Numerical Method of Mechanical Theorem Proving 1990 74 TCS Casas & Fernandez-Camacho & Steyaert, Algebraic Simplification in Computer Algebra: An Analysis of Bottom-Up Algorithms 1990 74 TCS He, An Efficient Algorithm for Edge Coloring Planar Graphs with Delta Colors 1990 74 TCS Babai & Pudlak & Rodl & Szemeredi, Lower Bounds to the Complexity of Symmetric Boolean Functions 1990 74 TCS Hertrampf, Relations among MOD-Classes 1990 74 TCS Romeuf, A Polynomial Algorithm for Solving Systems of Two Linear Diophantine Equations 1990 74 TCS Anselmo, Sur les Codes Zigzag et leur Decidabilite 1990 74 TCS Szymanski, On the Complexity of Algorithms on Recursive Trees 1990 74 TCS Gastin, Un Modele Asynchrone pour les Systemes Distribues 1990 74 TCS Gecseq & Jurgensen, Automata Represented by Products of Soliton Automata 1990 74 TCS Oommen & Hansen & Munro, Deterministic Optimal and Expedient Move-to-Rear List Organizing 1990 74 TCS Okulicka, On Priority in COSY 1990 74 TCS Hartmanis & Hemachandra, Robust Machines Accept Easy Sets 1990 74 TCS Bezem, Completeness of Resolution Revisited 1990 74 TCS Huttel, SnS can be Modally Characterized 1990 74 TCS Kummer, An Easy Priority-free Proof of a Theorem of Friedberg 1990 74 TCS Diekert, Word Problems over Traces which are Solvable in Linear Time 1990 74 TCS Fussell & Thurimella, Successive Approximation in Parallel Graph Algorithms 1990 74 TCS Gavilanes-Franco & Lucio-Carrasco, A First Order Logic for Partial Functions 1990 74 TCS Jancar, Decidability of a Temporal Logic Problem for Petri Nets 1990 74 TCS Preparata & Tamassia, Dynamic Planar Point Location with Optimal Query Time 1990 74 TCS Szepietowski, If Deterministic and Nondeterministic Space Complexities are Equal for log log n, then They are Also Equal for log n 1990 73 TCS Beigel, Bi-immunity Results for Cheatable Sets 1990 73 TCS Chen, The Difference between One Tape and Two Tapes: With Respect to Reversal Complexity 1990 73 TCS Hoffmann & Main, Results on NLC Grammars with One-Letter Terminal Alphabets 1990 73 TCS Kim, Complexity and Decidability for Restricted Classes of Picture Languages 1990 73 TCS Robson, Strong Time Bounds: Non-computable Bounds and a Hierarchy Theorem 1990 73 TCS Bertossi & Luccio & Lodi & Pagli, String Matching with Weighted Errors 1990 73 TCS Head, The Set of Strings Mapped into a Submonoid by Iterates of a Morphism 1990 73 TCS Schmitt, Hopf Algebras and Identities in Free Partially Commutative Monoids 1990 73 TCS Aiken, A Theory of Compaction-based Parallelization 1990 73 TCS Fuh & Mishra, Type Inference with Subtypes 1990 73 TCS Giegerich, Code Selection by Inversion of Order-Sorted Derivors 1990 73 TCS Horwitz, Adding Relational Query Facilities to Software Development Environments 1990 73 TCS Wadler, Deforestation: Transforming Programs to Eliminate Trees 1990 73 TCS Jacopini & Sontacchi, Reversible Parallel Computation: An Evolving Space-Model 1990 73 TCS Kroger, On the Interpretability of Arithmetic in Temporal Logic 1990 73 TCS Lavault, Exact Average Message Complexity Values for Distributed Election on Bidirectional Rings of Processors 1990 73 TCS Varricchio, Factorizations of Free Monoids and Unavoidable Regularities 1990 73 TCS Jerrum & Sinclair, Fast Uniform Generation of Regular Graphs 1990 73 TCS Huwig & Poigne, A Note on Inconsistencies Caused by Fixpoint in a Cartesian Closed Category 1990 72 TCS Ausiello & Nanni & Italiano, Dynamic Maintenance of Directed Hypergraphs 1990 72 TCS Engeler, Combinatory Differential Fields 1990 72 TCS Echahed, On Completeness of Narrowing Strategies 1990 72 TCS Francon & Randrianarimanana & Schott, Analysis of Dynamic Algorithms in Knuth's Model 1990 72 TCS Gnaedig & Krichner & Kirchner, Equational Completion in Order-sorted Algebras 1990 72 TCS Gorrieri & Marchetti & Montanari, A^2 CCS: Atomic Actions for CCS 1990 72 TCS Kennaway, Implementing Term Rewrite Languages in Dactl 1990 72 TCS Klein & Wood, A Tight Upper Bound for the Path Length of AVL Trees 1990 72 TCS Larsen, Proof Systems for Satisfiability in Hennessy-Milner Logic with Recursion 1990 72 TCS Budach, Topological Invariants of Classification Problems 1990 72 TCS Hashiguchi, Improved Limitedness Theorems of Finite Automata with Distance Functions 1990 72 TCS Carpi & de Luca, Non-repetitive Words Relative to a Rewriting System 1990 72 TCS Restivo, Codes and Local Constraints 1990 72 TCS Simon, Factorization Forests of Finite Height 1990 71 TCS Senizergues, Some Decision Problems about Controlled Rewriting Systems 1990 71 TCS Ehrig & Parisi-Presicce & Boehm & Rieckhoff & Dimitrovici & Grosse-Rhode, Combining Data Type and Recursive Process Specifications Using Projection Algebras 1990 71 TCS Dulucq & Gouyou-Beauchamps, Sur les Facteurs des Suites de Sturm 1990 71 TCS Gibbons & Rytter, Optimally Edge-Colouring Outerplanar Graphs is in NC 1990 71 TCS Manes, A Transformational Characterization of if-then-else 1990 71 TCS Chrobak & Szymacha & Krawczyk, A Data Structure Useful for Finding Hamiltonian Cycles 1990 71 TCS Skandalis, Non-recursiveness of the Operations on Real Numbers 1990 71 TCS Bainbridge & Freyd & Scedrov & Scott, Functorial Polymorphism (Corrigendum) 1990 71 TCS Arcangeli & Pomain, Principles of Plasma Pattern and Alternative Structure Compilation 1990 71 TCS Billaud, Simple Operational and Denotational Semantics for Prolog with Cut 1990 71 TCS Bulyonkov, Mixed Computation and Compilation: New Approaches to Old Problems 1990 71 TCS Galmiche, Constructive System for Automatic Program Synthesis 1990 71 TCS Penjam, Computational and Attribute Models of Formal Languages 1990 71 TCS Sabelfeld, An Algorithm Deciding Functional Equivalence in a New Class of Program Schemes 1990 71 TCS Aggarwal & Chandra & Snir, Communication Complexity of PRAMs 1990 71 TCS Culik, New Techniques for Proving the Decidability of Equivalence Problems 1990 71 TCS Gruska, Synthesis, Structure and Power of Systolic Computations 1990 71 TCS Hartmanis, New Developments in Structural Complexity Theory 1990 71 TCS Kruskal & Rudolph & Snir, A Complexity Theory of Efficient Parallel Algorithms 1990 71 TCS Thiagarajan, Some Behavioural Aspects of Net Theory 1990 71 TCS Weijland, Semantics for Logic Programs without Occur Check 1990 70 TCS Ehrenfeucht & Rozenberg, Theory of 2-Structures, Part I: Clans, Basic Subclasses, and Morphisms 1990 70 TCS Ehrenfeucht & Rozenberg, Theory of 2-Structures, Part II: Representation through Labeled Tree Families 1990 70 TCS Ehrenfeucht & Rozenberg, Primitivity is Hereditary for 2-Structures 1990 70 TCS Tiuryn & Benson, Fixed Points in Free Process Algebras, Part II 1990 70 TCS Longo & Moggi, A Category-theoretic Characterization of Functional Completeness 1990 70 TCS Senizergues, A Characterisation of Deterministic Context-free Languages by Means of Right-Congruences 1990 70 TCS Jung, Cartesian Closed Categories of Algebraic Cpos 1990 70 TCS Gambosi & Nesetril & Talamo, On Locally Presented Posets 1990 70 TCS Terlutte, Cyclic Rational Transductions and Polynomials of Rational Functions 1990 70 TCS Vyskoc, An O(n^lg k 2^n/2) Time and O(k 2^n/k) Space Algorithm for Certain NP-Complete Problems (Corrigendum) 1990 70 TCS Abadi, The Power of Temporal Proofs (Corrigendum) 1990 70 TCS Wagner, Algebras, Polynomials and Programs 1990 70 TCS Bainbridge & Freyd & Scedrov & Scott, Functorial Polymorphism 1990 70 TCS Barr, Fixed Points in Cartesian Closed Categories 1990 70 TCS Bloom, A Note on Guarded Theories 1990 70 TCS Mulry, Categorical Fixed Point Semantics 1990 70 TCS Nielson & Nielson, Functional Completeness of the Mixed lambda-Calculus and Combinatory Logic 1990 70 TCS Pasztor, Recursive Programs and Denotational Semantics in Absolute Logics of Programs 1990 70 TCS Bottinger, On Scott's Thesis for Domains of Information and Well-Quasi-Orderings 1990 70 TCS Wells, A Generalization of the Concept of Sketch 1989 69 TCS Felleisen & Friedman, A Syntactic Theory of Sequential State 1989 69 TCS Falaschi & Levi & Palamidessi & Martelli, Declarative Modeling of the Operational Behavior of Logic Languages 1989 69 TCS Baker & McNulty & Taylor, Growth Problems for Avoidable Words 1989 69 TCS Nielson, Two-level Semantics and Abstract Interpretation 1989 69 TCS Vieille, Recursive Query Processing: The Power of Logic 1989 69 TCS Kerisit, A Relational Approach to Logic Programming: The Extended Alexander Method 1989 69 TCS Kaplan, Algebraic Specification of Concurrent Systems 1989 68 TCS Coquand, Categories of Embeddings 1989 68 TCS Gutbrod, A Transformation System for Generating Description Languages of Chain Code Pictures 1989 68 TCS Blanchard, Codes Engendrant Certains Systemes Sofiques 1989 68 TCS Immerman & Mahaney, Relativizing Relativized Computations 1989 68 TCS Hortala-Gonzalez & Rodriguez-Artalejo, Hoare's Logic for Nondeterministic Regular Programs: A Nonstandard Approach 1989 68 TCS Bracho, Continuously Generated Fixed Points 1989 68 TCS Narendran & Otto, Some Polynomial-Time Algorithms for Finite Monadic Church-Rosser Thue Systems 1989 68 TCS Solitro, A Typed Calculus Based on a Fragment of Linear Logic 1989 68 TCS Gafni & Naor & Ragde, On Separating the EREW and CREW PRAM Models 1989 68 TCS Rupert, Comment on a Remark of Forys 1989 68 TCS Arvind & Biswas, On Some Bandwidth Restricted Versions of the Satisfiability Problem of Propositional CNF Formulas 1989 68 TCS Blair & Subrahmanian, Paraconsistent Logic Programming 1989 68 TCS Lingas & Proskurowski, On Parallel Complexity of the Subgraph Homeomorphism and the Subgraph Isomorphism Problem for Classes of Planar Graphs 1989 68 TCS Parrow, Submodule Construction as Equation Solving in CCS 1989 68 TCS Ramanujam, Semantics of Distributed Definite Clause Programs 1989 68 TCS Kirschenhofer & Prodinger & Szpankowski, On the Balance Property of Patricia Tries: External Path Length Viewpoint 1989 68 TCS Chang & Ibarra & Palis, Efficient Simulations of Simple Models of Parallel Computation by Time-bounded ATMs and Space-bounded TMs 1989 68 TCS Droste, Event Structures and Domains 1989 68 TCS Hofer, Left Ideals and Reachability in Machines 1989 68 TCS Gambosi & Italiano & Talamo, Worst-case Analysis of the Set-Union Problem with Extended Backtracking 1989 68 TCS Huckenbeck, Euclidean Geometry in Terms of Automata Theory 1989 68 TCS Karloff, An NC Algorithm for Brooks' Theorem 1989 68 TCS Josephs, The Semantics of Lazy Functional Languages 1989 68 TCS Chlebus, A Hierarchy of Propositional Horn Formulas 1989 67 TCS Madlener & Otto, About the Descriptive Power of Certain Classes of Finite String-Rewriting Systems 1989 67 TCS Bachmair & Dershowitz, Completion for Rewriting Modulo a Congruence 1989 67 TCS Gallier & Snyder, Complete Sets of Transformations for General E-Unification 1989 67 TCS Choppy & Kaplan & Soria, Complexity Analysis of Term-Rewriting Systems 1989 67 TCS Baeten & Bergstra & Klop & Weijland, Term-Rewriting Systems with Rule Priorities 1989 67 TCS Kirchner, Schematization of Infinite Sets of Rewrite Rules Generated by Divergent Completion Processes 1989 67 TCS Swart & Richards, On the Inference of Strategies 1989 67 TCS Otto, On Deciding Confluence of Finite String-Rewriting Systems Modulo Partial Commutativity 1989 67 TCS Martin, A Geometrical Approach to Multiset Orderings 1989 67 TCS Clausen, Fast Generalized Fourier Transforms 1989 67 TCS Beauquier, Minimal Automation for a Factorial, Transitive, and Rational Language 1989 67 TCS Moriya, A Grammatical Characterization of Alternating Pushdown Automata 1989 67 TCS Marongiu & Tulipani, On a Conjecture of Bergstra and Tucker 1989 67 TCS Inoue & Takanami & Hromkovic, A Leaf-Size Hierarchy of Two-dimensional Alternating Turing Machines 1989 67 TCS Pardubska & Stefanekova, Nondeterministic Multicounter Machines and Complementation 1989 67 TCS Cosnard & Duprat & Ferreira, Complexity of Selection in X + Y 1989 67 TCS Petuaud, Entropie Topologique des Systemes Specifies 1989 67 TCS Perez, Decidability of the Restriction Equational Theory in the Partial Lambda Calculus 1989 66 TCS Diekert, On the Knuth-Bendix Completion for Concurrent Processes 1989 66 TCS Dietzfelbinger, Lower Bounds for Sorting of Sums 1989 66 TCS Edelsbrunner & Rote & Welzl, Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane 1989 66 TCS Levcopoulos & Lingas & Sack, Heuristics for Optimum Binary Search Trees and Minimum Weight Triangulation Problems 1989 66 TCS Abdallah, A Logico-Algebraic Approach to the Model Theory of Knowledge 1989 66 TCS Weil, Inverse Monoids of Dot-depth Two 1989 66 TCS Yamasaki, Language-theoretical Representations of omega-Languages 1989 66 TCS Angluin & Gasarch & Smith, Training Sequences 1989 66 TCS Ito & Inoue & Takanami, Deterministic Two-dimensional On-line Tessellation Acceptors are Equivalent to Two-way Two-dimensional Alternating Finite Automata Through 180-degree Rotation 1989 66 TCS Jacopini & Mentrasti, Generation of Invertible Functions 1989 66 TCS Makowsky & Sain, Weak Second Order Characterizations of Various Program Verification Systems 1989 66 TCS Mezghiche, On Pseudo-c beta Normal Form in Combinatory Logic 1989 66 TCS Tiomkin, Probabilistic Termination versus Fair Termination 1989 66 TCS Honkala, A Necessary Condition for the Rationality of the Zeta Function of a Regular Language 1989 66 TCS Lehmkuhl & Lickteig, On the Order of Approximation in Approximative Triadic Decompositions of Tensors 1989 66 TCS Dunne, On Monotone Simulations of Nonmonotone Networks 1989 66 TCS Piperno, Abstraction Problems in Combinatory Logic: A Compositive Approach 1989 66 TCS Kari, Observations Concerning a Public-key Cryptosystem Based on Iterated Morphisms 1989 66 TCS Xin, An Efficient Algorithm To Decide Whether a Monoid Presented by a Regular Church-Rosser Thue System is a Group 1989 66 TCS Op Den Akker, On LC(0) Grammars and Languages 1989 66 TCS Urquhart, The Complexity of Gentzen Systems for Propositional Logic 1989 66 TCS Statman, On Sets of Solutions to Combinator Equations 1989 66 TCS Pelc, Weakly Adaptive Comparison Searching 1989 66 TCS Mundici, Functions Computed by Monotone Boolean Formulas with No Repeated Variables 1989 65 TCS Yokouchi, Church-Rosser Theorem for a Rewriting System on Categorical Combinators 1989 65 TCS Hardin, Confluence Results for the Pure Strong Categorical Logic CCL. lambda-Calculi as Subsystems of CCL 1989 65 TCS Shepherdson, A Sound and Complete Semantics for a Version of Negation as Failure 1989 65 TCS Allouche, On a Sequence of Rational Functions 1989 65 TCS Blanchard, beta-Expansions and Symbolic Dynamics 1989 65 TCS Bleuzen-Guernalec, On a Possible Classification of Real-time Constructed Sequences 1989 65 TCS Dekking, On the Probability of Occurrence of Labelled Subtrees of a Randomly Labelled Tree 1989 65 TCS Dumont & Thomas, Systemes de Numeration et Fonctions Fractales Relatifs aux Substitutions 1989 65 TCS Hansel & Perrin, Rational Probability Measures 1989 65 TCS Hellekalek & Larcher, On Weyl Sums and Skew Products over Irrational Rotations 1989 65 TCS Kraaikamp, Statistics and Ergodic Properties of Minkowski's Diagonal Continued Fraction 1989 65 TCS Mendes France & van der Poorten, From Geometry to Euler Identities 1989 65 TCS Mignosi, Infinite Words with Linear Subword Complexity 1989 65 TCS Mori, On the Fredholm Determinant of a Piecewise Linear Transformation 1989 65 TCS Mosse, q-Adic Spectral Analysis of Some Arithmetic Sequences 1989 65 TCS Restivo, Finitely Generated Sofic Systems 1989 65 TCS Enjalbert & Farinas del Cerro, Modal Resolution in Clausal Form 1989 65 TCS Abadi, The Power of Temporal Proofs 1989 65 TCS Thatte, Full Abstraction and Limiting Completeness in Equational Languages 1989 64 TCS Stark, Concurrent Transition Systems 1989 64 TCS Therien, Programs over Aperiodic Monoids 1989 64 TCS Mazurkiewicz & Ochmanski & Penczek, Concurrent Systems and Inevitability 1989 64 TCS Howell & Rosier, Problems Concerning Fairness and Temporal Logic for Conflict-free Petri Nets 1989 64 TCS Alon & Zwick, On Neciporuk's Theorem for Branching Programs 1989 64 TCS Kleine Buning & Lettmann & Mayr, Projections of Vector Addition System Reachability Sets are Semilinear 1989 64 TCS Kruskal & Rudolph & Snir, Techniques for Parallel Manipulation of Sparse Matrices 1989 64 TCS Robert & Trystram, Optimal Scheduling Algorithms for Parallel Gaussian Elimination 1989 64 TCS Lyon, Design Factors for Parallel Processing Benchmarks 1989 64 TCS Bermond & Fourneau, Independent Connections: An Easy Characterization of Baseline-equivalent Multistage Interconnection Networks 1989 64 TCS Akyildiz & Von Brand, Exact Solutions for Open, Closed and Mixed Queueing Networks with Rejection Blocking 1989 64 TCS Stoss, On the Representation of Rational Functions of Bounded Complexity 1989 64 TCS Stoss, Lower Bounds for the Complexity of Polynomials 1989 64 TCS Jojczyk & Konieczny & Kuzak, On Interleaving Behaviour of PT-Nets 1989 64 TCS Tomita & Seino, A Direct Branching Algorithm for Checking the Equivalence of Two Deterministic Pushdown Transducers, One of Which is Real-time Strict 1989 64 TCS Sato, E-ccc: Between ccc and Topos 1989 64 TCS Hung & Knuth, Semi-Commutations and Petri Nets 1989 64 TCS Shamir & Schuster, Communication Aspects of Networks Based on Geometric Incidence Relations 1989 64 TCS Hindley, BCK-Combinators and Linear lambda-Terms Have Types 1989 64 TCS Galil & Giancarlo, Speeding Up Dynamic Programming with Applications to Molecular Biology 1989 64 TCS Protasi & Talamo, On the Number of Arithmetical Operations for Finding Fibonacci Numbers 1989 64 TCS Korach & Moran & Zaks, Optimal Lower Bounds for Some Distributed Algorithms for a Complete Network of Processors 1989 63 TCS Du & Book, On Inefficient Special Cases of NP-Complete Problems 1989 63 TCS Gardarin & Guessarian & De Maindreville, Translation of Logic Programs into Functional Fixpoint Equations 1989 63 TCS Benson & Tiuryn, Fixed Points in Free Process Algebras, Part I 1989 63 TCS Lingas, Subgraph Isomorphism for Biconnected Outerplanar Graphs in Cubic Time 1989 63 TCS Bloom & Esik, Equational Logic of Circular Data Type Specification 1989 63 TCS De Luca & Varricchio, Some Combinatorial Properties of the Thue-Morse Sequence and a Problem in Semigroups 1989 63 TCS Hagiya, Generalization from Partial Parametrization in Higher-order Type Theory 1989 63 TCS Birget, Concatenation of Inputs in a Two-way Automaton 1989 63 TCS De Felice, Construction of a Family of Finite Maximal Codes 1989 63 TCS Pelc, Searching with Known Error Probability 1989 63 TCS Hromkovic, Tradeoffs for Language Recognition on Alternating Machines 1989 63 TCS Saito & Nishio, Structural and Behavioral Equivalence Relations in Automata Networks 1989 63 TCS Schmidt, Avoidable Patterns on Two Letters 1989 63 TCS Livesey, Stable Families of Behavioural Equivalences 1989 63 TCS Ambos-Spies, On the Relative Complexity of Hard Problems for Complexity Classes without Complete Problems 1989 63 TCS Ginsburg & Tang, Cohesion of Object Histories 1989 63 TCS Johnson, A Unified Framework for Disambiguating Finite Transductions 1988 62 TCS Geffert, A Representation of Recursively Enumerable Languages by Two Homomorphisms and a Quotient 1988 62 TCS Rao & Iyengar & Kashyap, An Average-Case Analysis of MAT and Inverted File 1988 62 TCS Salomaa, A Pumping Result for 2-Context-free Languages 1988 62 TCS Zeugmann, On the Power of Recursive Optimizers 1988 62 TCS Buss & Turan, Resolution Proofs of Generalized Pigeonhole Principles 1988 62 TCS Meinel, The Power of Nondeterminism in Polynomial-size Bounded-width Branching Programs 1988 62 TCS Lafont, The Linear Abstract Machine (Corrigenda) 1988 62 TCS Abitboul & Hull, Restructuring Hierarchical Database Objects 1988 62 TCS Atzeni & Parker, Set Containment Inference and Syllogisms 1988 62 TCS Chan & Hernandez, On the Desirability of gamma-Acyclic BCNF Database Schemes 1988 62 TCS Lakshmanan, Split-Freedom and MVD-Intersection: A New Characterization of Multivalued Dependencies Having Conflict-free Covers 1988 62 TCS Lynch & Merritt, Introduction to the Theory of Nested Transactions 1988 62 TCS Sacca & Zaniolo, The Generalized Counting Method for Recursive Logic Queries 1988 62 TCS van Gucht, Interaction-free Multivalued Dependency Sets 1988 61 TCS Book & Du, The Structure of Generalized Complexity Cores 1988 61 TCS Dahlhaus & Karpinski, Parallel Construction of Perfect Matchings and hamiltonian Cycles on Dense Graphs 1988 61 TCS Moriya & Yamasaki, Accepting Conditions for Automata on omega-Languages 1988 61 TCS King, Alternating Multihead Finite Automata 1988 61 TCS Di Battista & Tamassia, Algorithms for Plane Representations of Acyclic Digraphs 1988 61 TCS Gischer, The Equational Theory of Pomsets 1988 61 TCS Alexi, Extraction and Verification of Programs by Analysis of Formal Proofs 1988 61 TCS Gargov & Passy, Determinism and Looping in PDL 1988 61 TCS Staiger, A Theorem on the Entropy of Submonoids 1988 61 TCS Kretschmer, A Closure Property of Regular Languages 1988 61 TCS Arnold, Logical Definability of Fixed Points 1988 61 TCS Belaga, Bilinear Mincing Rank 1988 61 TCS Megiddo & Vishkin, On Finding a Minimum Dominating Set in a Tournament 1988 61 TCS Kennaway, On ``On Graph Rewritings'' (Corrigendum) 1988 61 TCS Shallit, A Generalization of Automatic Sequences 1988 61 TCS Domosi & Esik, Critical Classes for the alpha_0-Product 1988 61 TCS Meznik, On a Subclass of infinite-Regular Languages 1988 61 TCS He, A Nearly Optimal Parallel Algorithm for Constructing Maximal Independent Set in Planar Graphs 1988 61 TCS Seger & Brzozowski, An Optimistic Ternary Simulation of Gate Races 1988 61 TCS Van Den Broek, Comparison of Two Graph-Rewrite Systems 1988 61 TCS Thatte, Implementing First-order Rewriting with Constructor Systems 1988 61 TCS Cori & Sopena & Latteux & Roos, 2-Asynchronous Automata 1988 60 TCS Eilam-Tzoreff & Vishkin, Matching Patterns in Strings Subject to Multi-linear Transformations 1988 60 TCS Duval, Generation d'une Section des Classes de Conjugaison et Arbre des Mots de Lyndon de Longueur Bornee 1988 60 TCS Carpi, On Synchronizing Unambiguous Automata 1988 60 TCS Beeson, Towards a Computation System Based on Set Theory 1988 60 TCS Spehner, La Reconnaissance des Facteurs d'un Langage Fini dans un Text en Temps Lineaire 1988 60 TCS America & De Bakker, Designing Equivalent Semantic Models for Process Creation 1988 60 TCS Roscoe & Hoare, The Laws of Occam Programming 1988 59 TCS Hesselink, Interpretations of Recursion under Unbounded Nondeterminacy 1988 59 TCS Hesselink, Deadlock and Fairness in Morphisms of Transition Systems 1988 59 TCS Hodel & Loui, Optimal Dynamic Embedding of X-Trees into Arrays 1988 59 TCS Kalorkoti, The Trace Invariant and Matrix Inversion 1988 59 TCS Schmidt-Schauss, Implication of Clauses is Undecidable 1988 59 TCS Rytter, On Efficient Parallel Computations for Some Dynamic Programming Problems 1988 59 TCS Engelfriet & Leih, Nonterminal Bounded NLC Graph Grammars 1988 59 TCS Stoughton, Substitution Revisited 1988 59 TCS Bosco & Giovannetti & Moiso, Narrowing vs. SLD-Resolution 1988 59 TCS Boudol & Castellani, Concurrency and Atomicity 1988 59 TCS Breazu-Tannen & Coquand, Extensional Models for Polymorphism 1988 59 TCS Browne & Clarke & Grumberg, Characterizing Finite Kripke Structures in Propositional Temporal Logic 1988 59 TCS Drabent & Maluszynski, Inductive Assertion Method for Logic Programs 1988 59 TCS Lafont, The Linear Abstract Machine 1988 59 TCS Ronchi Della Rocca, Principal Type Scheme and Unification for Intersection Type Discipline 1988 58 TCS Arques & Francon & Guichet & Guichet, Comparison of Algorithms Controlling Concurrent Access to a Database: A Combinatorial Approach 1988 58 TCS Averbuch & Galil & Winograd, Classification of All the Minimal Bilinear Algorithms for Computing the Coefficients of the Product of Two Polynomials Modulo a Polynomial, Part I: The Algebra G[u]/, l>1 1988 58 TCS Borodin & Fich & Meyer auf der Heide & Upfal & Wigderson, A Tradeoff between Search and Update Time for the Implicit Dictionary Problem 1988 58 TCS Brandenburg, On the Intersection of Stacks and Queues 1988 58 TCS Choffrut & Schutzenberger, Counting with Rational Functions 1988 58 TCS De Felice, Finite Biprefix Sets of Paths in a Graph 1988 58 TCS Hartmanis & Hemachandra, Complexity Classes without Machines: On Complete Languages for UP 1988 58 TCS Kirschenhofer & Prodinger, Further Results on Digital Search Trees 1988 58 TCS Kraus & Lehmann, Knowledge, Belief and Time 1988 58 TCS Lange, Decompositions of Nondeterministic Reductions 1988 58 TCS Lisper, Synthesis and Equivalence of Concurrent Systems 1988 58 TCS Metivier, On Recognizable Subsets of Free Partially Commutative Monoids 1988 58 TCS Monien & Sudborough, Min Cut is NP-Complete for Edge Weighted Trees 1988 58 TCS Pecuchet, Etude Syntaxique des Parties Reconnaissables de Mots Infinis 1988 58 TCS Reed & Roscoe, A Timed Model for Communicating Sequential Processes 1988 58 TCS Rosier & Yen, On the Complexity of Deciding Fair Termination of Probabilistic Concurrent Finite-State Programs 1988 58 TCS Simon, An Improved Algorithm for Transitive Closure on Acyclic Digraphs 1988 58 TCS Stirling, A Generalization of Owicki-Gries's Hoare Logic for a Concurrent While Language 1988 58 TCS Straubing, Semigroups and Languages of Dot-Depth Two 1988 58 TCS Varman & Doshi, An Efficient Parallel Algorithm for Updating Minimum Spanning Trees 1988 57 TCS Avron, The Semantics and Proof Theory of Linear Logic 1988 57 TCS Pierre & Farinone, Rational Index of Context-free Languages in exp Theta(n^{1/p}) and n^{Theta((ln n)^{1/p})} 1988 57 TCS Velinov, An Algebraic Structure for Derivations in Rewriting Systems 1988 57 TCS Ibarra & Jiang, Relating the Power of Cellular Arrays to their Closure Properties 1988 57 TCS Duchamp & Thibon, Theoremes de Transfert pour les Polynomes Partiellement Commutatifs 1988 57 TCS Meyer & de Vink, Applications of Compactness in the Smyth Powerdomain of Streams 1988 57 TCS Beal, Codes Circulaires, Automates Locaux et Entropie 1988 57 TCS Hashiguchi, Notes on Congruence Relations and Factor Pumping Conditions for Rational Languages 1988 57 TCS Szalas & Holenderski, Incompleteness of First-order Temporal Logic with Until 1988 57 TCS Grossman & Zeitman, An Inherently Iterative Computation of Ackermann's Function 1988 57 TCS Broy, Equational Specification of Partial Higher-order Algebras 1988 57 TCS Ibarra & Palis, Two-dimensional Iterative Arrays: Characterizations and Applications 1988 57 TCS Ablyv, The Complexity Properties of Probabilistic Automata with Isolated Cut Point 1988 57 TCS Hromkovic, The Advantages of a New Approach to Defining the Communication Complexity for VLSI 1988 57 TCS Jukna, Entropy of Contact Circuits and Lower Bounds on Their Complexity 1988 57 TCS Tarhio & Ukkonen, A Greedy Approximation Algorithm for Constructing Shortest Common Superstrings 1988 57 TCS Kuich, Matrix Systems and Principal Cones of Algebraic Power Series 1988 57 TCS Skarbek, Generating Ordered Trees 1988 56 TCS Tretkoff, Complexity, Combinatorial Group Theory and the Language of Palutators 1988 56 TCS Staples, Delaying Unification Algorithms for Lambda Calculi 1988 56 TCS Gradel, Subclasses of Presburger Arithmetic and the Polynomial-Time Hierarchy 1988 56 TCS Martino, A Quantitative Interpretation of Girard's System F 1988 56 TCS Boonyavatana & Slutzki, The Interchange or Pump (Di)Lemmas for Context-free Languages 1988 56 TCS Bruyere, An Answer to a Question about Finite Maximal Prefix Sets of Words 1988 56 TCS Baader & Buttner, Unification in Commutative Idempotent Monoids 1988 56 TCS Fachini & Napoli, C-Tree Systolic Automata 1988 56 TCS Marek, A Natural Semantics for Modal Logic over Databases 1988 56 TCS Iliopoulos, On the Computational Complexity of the Abelian Permutation Group Structure, Membership and Intersection Problems 1988 56 TCS Sekimoto & Hirokawa, One-Step Recurrent Terms in lambda-beta-Calculus 1988 56 TCS Carpi, Multidimensional Unrepetitive Configurations 1988 56 TCS Mohrherr, A Remark on the Length Problem 1988 56 TCS Armbruster, A Polynomial Determination of the Most-Recent Property in Pascal-like Programs 1988 56 TCS Hankin & Burn & Jones, A Safe Approach to Parallel Combinator Reduction 1988 56 TCS Kaplan, Rewriting with a Nondeterministic Choice Operator 1988 56 TCS Nielson & Nielson, Two-level Semantics and Code Generation 1988 56 TCS Stark, Proving Entailment between Conceptual State Specifications 1987 55 TCS Courcelle, An Axiomatic Definition of Context-free Rewriting and its Application to NLC Graph Grammars 1987 55 TCS Brandenburg, Representations of Language Families by Homomorphic Equality Operations and Generalized Equality Sets 1987 55 TCS Bartha, An Equational Axiomatization of Systolic Systems 1987 55 TCS Lehmann, A Universal Machine without Change of State 1987 55 TCS Peleg, Concurrent Program Schemes and Their Logics 1987 55 TCS Seidl, Parameter Reduction of Higher Level Grammars 1987 55 TCS Best & Devillers, Sequential and Concurrent Behaviour in Petri Net Theory 1987 54 TCS Priese & Rehrmann & Willecke-Klemme, An Introduction to the Regular Theory of Fairness 1987 54 TCS Rindone, Construction d'une Famille de Codes Associes a Certains Groupes Finis 1987 54 TCS Brandstadt & Kratsch, On Domination Problems for Permutation and Other Graphs 1987 54 TCS Szalas, A Complete Axiomatic Characterization of First-Order Temporal Logic of Linear Time 1987 54 TCS Cockett, Discrete Decision Theory: Manipulations 1987 54 TCS Bertolazzi & Sassano, An O(mn) Algorithm for Regular Set-Covering Problems 1987 54 TCS Watanabe, A Comparison of Polynomial Time Completeness Notions 1987 54 TCS Muller & Schupp, Alternating Automata on Infinite Trees 1987 54 TCS Fauconnier, Semantique Asynchrone et Comportements Infinis en CSP 1987 54 TCS Ginsburg & Tang, Canonical Forms for Interval Functions 1987 54 TCS Sado & Igarashi, A Function for Evaluating the Computing Time of a Bubbling System (Note) 1987 54 TCS Iwata & Kasai, Simultaneous (poly-Time, log-Space) Lower Bounds (Note) 1987 54 TCS Liskiewicz & Lorys & Piotrow, On Reversal Bounded Alternating Turing Machines (Note) 1987 54 TCS Ko, On the Continued Fraction Representation of Computable Real Numbers (Corrigenda) 1987 54 TCS Hsiang & Srivas, Automatic Inductive Theorem Proving Using Prolog 1987 54 TCS Jensen & Larsen, Recursively Defined Domains and Their Induction Principles 1987 54 TCS Marchetti-Spaccamela, New Protocols for the Election of a Leader in a Ring 1987 54 TCS Pan, Complexity of Parallel Matrix Computations 1987 54 TCS Bajaj, Geometric Optimization and the Polynomial Hierarchy 1987 54 TCS Lakshmanan & Veni Madhavan, An Algebraic Theory of Functional and Multivalued Dependencies in Relational Databases 1987 54 TCS Venkatesan, Approximation Algorithms for Weighted Matching 1987 53 TCS Attiya & Mansour, Language Complexity on the Synchronous Anonymous Ring 1987 53 TCS Litovsky & Timmerman, On Generators of Rational omega-Power Languages 1987 53 TCS Schnorr, A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms 1987 53 TCS Abramsky, Observation Equivalence as a Testing Equivalence 1987 53 TCS Esik & Gecseg, On a Representation of Tree Automata 1987 53 TCS Muller & Brandstadt, The NP-Completeness of STEINER TREE and DOMINATING SET for Chordal Bipartite Graphs 1987 53 TCS Beynon & Buckle, On the Planar Monotone Computation of Boolean Functions 1987 53 TCS Peleg & Upfal, The Generalized Packet Routing Problem 1987 53 TCS Rytter & Giancarlo, Optimal Parallel Parsing of Bracket Languages 1987 53 TCS Garzon, Cyclic Automata 1987 53 TCS Nishida & Kobuchi, Repeatable Words for Substitution 1987 53 TCS Hallnas, An Intensional Characterization of the Largest Bisimulation (Note) 1987 53 TCS Santoro & Sidney & Sidney & Urrutia, Geometric Containment and Vector Dominance (Note) 1987 53 TCS Wagner, A Categorical Treatment of Pre- and Post-Conditions 1987 53 TCS File, Classical and Incremental Attribute Evaluation by Means of Recursive Procedures 1987 53 TCS Escrig, Probabilistic Ianov's Schemes 1987 53 TCS Louchard, Random Walks, Gaussian Processes and List Structures 1987 53 TCS Pelin & Gallier, Building Exact Computation Sequences 1987 53 TCS Pettorossi, Derivation of Efficient Programs for Computing Sequences of Actions 1987 52 TCS Kim & Sudborough, The Membership and Equivalence Problems for Picture Languages 1987 52 TCS Marberg & Gafni, Distributed Sorting Algorithms for Multi-Channel Broadcast Networks 1987 52 TCS Felleisen & Friedman & Kohlbecker & Duba, A Syntactic Theory of Sequential Control 1987 52 TCS Nigmatullin, Models of Lower-Bound Proofs 1987 52 TCS Balcazar & Diaz & Gabarro, On Characterizations of the Class PSPACE/poly 1987 52 TCS Gelenbe & Finkel, Stationary Deterministic Flows: II. The Single-Server Queue 1987 52 TCS Topor, Domain-independent Formulas and Databases 1987 52 TCS Stefanescu, On Flowchart Theories: Part II. The Nondeterministic Case 1987 52 TCS Brandenburg, A Note on: `Deque Automata and a Subfamily of Context-sensitive Languages which Contains All Semilinear Bounded Languages' (by K. Ayers) (Note) 1987 52 TCS Zaionc, Word Operation Definable in the Typed lambda-Calculus 1987 52 TCS Ko, On Helping by Robust Oracle Machines 1987 52 TCS Kennaway, On ``On Graph Rewritings'' 1987 52 TCS Sakarovitch, On Regular Trace Languages 1987 52 TCS von zur Gathen, Factoring Polynomials and Primitive Elements for Special Primes 1987 52 TCS Seite, A YACC Extension for LRR Grammar Parsing 1987 52 TCS Mundici, Satisfiability in Many-valued Sentential Logic is NP-Complete (Note) 1987 52 TCS Spirakis, The Parallel Complexity of Deadlock Detection (Note) 1987 52 TCS Moriya, Topological Characterizations of Infinite Tree Languages (Note) 1987 51 TCS Head & Lando, Bounded D0L Languages 1987 51 TCS Homer & Long, Honest Polynomial Degrees and P =? NP 1987 51 TCS Berard, Literal Shuffle 1987 51 TCS Yokomori, On Purely Morphic Characterizations of Context-free Languages 1987 51 TCS Yamasaki & Yoshida & Doshita, A Fixpoint Semantics of Horn Sentences Based on Substitution Sets 1987 51 TCS Hromkovic, Reversal-bounded Nondeterministic Multicounter Machines and Complementation (Note) 1987 51 TCS Beth, On the Computational Complexity of the General Discrete Fourier Transform (Note) 1987 51 TCS Galil & Giancarlo, Parallel String Matching with k Mismatches (Note) 1987 51 TCS Troelstra, On the Syntax of Martin-Lof's Type Theories 1987 51 TCS Le Chenaded, Analysis of Dehn's Algorithm by Critical Pairs 1987 51 TCS Wagner, More Complicated Questions about Maxima and Minima, and Some Closures of NP 1987 51 TCS Habel & Kreowski, Characteristics of Graph Languages Generated by Edge Replacement 1987 51 TCS Beauquier & Gire, Une Note sur le Theoreme de Caracterisation des Generateurs Algebriques 1987 51 TCS Baeten & Bergstra & Klop, On the Consistency of Koomen's Fair Abstraction Rule 1987 51 TCS Ambos-Spies & Fleischhack & Huwig, Diagonalizations over Polynomial Computable Sets 1987 51 TCS Orejas, A Characterization of Passing Compatibility for Parameterized Specifications 1987 51 TCS Carpi, On Unambiguous Reductions of Monoids of Unambiguous Relations (Note) 1987 51 TCS Vyskoc, An O(n^{lg k} 2^{n/2}) Time and O(k 2^{n/k}) Space Algorithm for Certain NP-Complete Problems (Note) 1987 51 TCS Belaga, Constructive Universal Algebra: An Introduction (Note) 1987 51 TCS Parberry, On the Time Required to Sum n Semigroup Elements on a Parallel Machine with Simultaneous Writes (Note) 1987 50 TCS Phillips, Refusal Testing 1987 50 TCS Sain, Total Correctness in Nonstandard Logics of Programs 1987 50 TCS Wagner & Ehrig, Canonical Constraints for Parameterized Data Types 1987 50 TCS Gray, Categorical Aspects of Data Type Constructors 1987 50 TCS Bergstra & Tucker, Algebraic Specifications of Computable and Semicomputable Data Types 1987 50 TCS Mazoyer, A Six-State Minimal Time Solution to the Firing Squad Synchronization Problem 1987 50 TCS Girard, Linear Logic 1987 49 TCS de Bakker & Meyer & Olderog, Infinite Streams and Finite Observations in the Semantics of Uniform Concurrency 1987 49 TCS Main & Bucher & Haussler, Applications of an Infinite Square-Free Co-CFL 1987 49 TCS Hennessy, An Algebraic Theory of Fair Asynchronous Communicating Processes 1987 49 TCS Bouge, Repeated Snapshots in Distributed Systems with Synchronous Communications and their Implementation in CSP 1987 49 TCS Galil & Landau & Yung, Distributed Algorithms in Synchronous Broadcasting Networks 1987 49 TCS Larsen, A Context Dependent Equivalence between Processes 1987 49 TCS Sistla & Vardi & Wolper, The Complementation Problem for Buchi Automata with Applications to Temporal Logic 1987 49 TCS Cole, Partitioning Point Sets in Arbitrary Dimension 1987 49 TCS Kurtz & Manber, A Probabilistic Distributed Algorithm for Set Intersection and its Analysis 1987 49 TCS Flajolet, Analytic Models and Ambiguity of Context-Free Languages 1987 49 TCS Stirling, Modal Logics for Communicating Systems 1987 49 TCS Takahashi, Brzozowski Hierarchy of omega-Languages 1987 49 TCS Squier, Units of Special Church-Rosser Monoids 1987 49 TCS Parchmann & Duske, Grammars, Derivation Modes and Properties of Indexed and Type-0 Languages 1987 49 TCS Oyamaguchi, The Church-Rosser Property for Ground Term-Rewriting Systems is Decidable 1987 49 TCS Guibas & Stolfi & Clarkson, Solving Related Two- and Three-Dimensional Linear Programming Problems in Logarithmic Time (Note) 1986 48 TCS Tchuente, Sequential Simulation of Parallel Iterations and Applications 1986 48 TCS Marek & Rasiowa, Approximating Sets with Equivalence Relations 1986 48 TCS Chrobak, Hierarchies of One-way Multihead Automata Languages 1986 48 TCS Duboc, Mixed Product and Asynchronous Automata 1986 48 TCS Ehrenfeucht & Hoogeboom & Rozenberg, On the Active and Full Use of Memory in Right-Boundary Grammars and Push-down Automata 1986 48 TCS Fitting, Partial Models and Logic Programming 1986 48 TCS Danko, First-order Approximation of Algorithmic Theories 1986 48 TCS Italiano, Amortized Efficiency of a Path Retrieval Data Structure 1986 48 TCS Salomaa & Yu, On a Public-Key Cryptosystem Based on Iterated Morphisms and Substitutions 1986 48 TCS Ginsburg & Tang, Projection of Object Histories 1986 48 TCS Gibbons & Rytter, On the Decidability of Some Problems about Rational Subsets of Free Partially Commutative Monoids (Note) 1986 48 TCS Engelfriet & Vogler, Pushdown Machines for the Macro Tree Transducer (Corrigenda) 1987 48 TCS Esik & Gecseg, On alpha_0-Products and alpha_2-Products 1987 48 TCS Ko, On the Notion of Infinite Pseudorandom Sequences 1987 48 TCS Spehner, La Reconnaissance des Facteurs d'un Mot dans un Texte 1987 48 TCS Bublitz & Schurfeld & Wegener & Voigt, Properties of Complexity Measures for PRAMs and WRAMs 1987 48 TCS Kruskal & Snir, A Unified Theory of Interconnection Network Structure 1987 48 TCS Statman, Every Countable Poset is Embeddable in the Poset of Unsolvable Terms 1987 48 TCS Head & Lando, Regularity of Sets of Initial Strings of Periodic D0L-Systems 1987 48 TCS Hromkovic, Communication Complexity Hierarchy 1987 48 TCS Berry & Sethi, From Regular Expressions to Deterministic Automata (Note) 1987 48 TCS Weispfenning, The Complexity of the Word Problem for Abelian l-Groups (Note) 1986 47 TCS Karchmer, Two Time-Space Tradeoffs for Element Distinctness 1986 47 TCS Maon & Yehudai, Balance of Many-Valued Transductions and Equivalence Problems 1986 47 TCS Ko & Long & Du, On One-way Functions and Polynomial-Time Isomorphisms 1986 47 TCS Maon & Schieber & Vishkin, Parallel Ear Decomposition Search (EDS) and st-Numbering in Graphs 1986 47 TCS Ko, On the Continued Fraction Representation of Computable Real Numbers 1986 47 TCS Rytter, On the Complexity of Parallel Parsing of General Context-free Languages (Note) 1986 47 TCS Hong & Zuo, Lower bounds on Communication Overlap of Networks (Note) 1986 47 TCS Szalas, Concerning the Semantic Consequence Relation in First-Order Temporal Logic (Note) 1986 47 TCS Deleage & Pierre, The Rational Index of the Dyck Language D'^*_1 (Note) 1986 47 TCS Farinas del Cerro & Orlowska, 0AL--A Logic for Data Analysis (Corrigendum) 1986 47 TCS Dymond, On Nondeterminism in Parallel Computation 1986 47 TCS Orponen, A Classification of Complexity Core Lattices 1986 47 TCS Wagner, Some Observations on the Connection between Counting and Recursion 1986 47 TCS Chrobak, Finite Automata and Unary Languages 1986 47 TCS Dare & Siromoney, Subword Topology 1986 47 TCS Homer, On Simple and Creative Sets in NP 1986 47 TCS Spehner, Le Calcul Rapide des Melanges de Deux Mots 1986 47 TCS Kirousis & Papadimitriou, Searching and Pebbling 1986 47 TCS Parchmann & Duske, Self-Embedding for Finite Semi-Thue and Thue Systems (Note) 1986 47 TCS Esik & Domosi, Complete Classes of Automata for the alpha_0-Product 1986 47 TCS Culik & Yu, Real-time Pseudo Real-time, and Linear-time ITA 1986 47 TCS Narendran & Otto, The Problems of Cyclic Equality and Conjugacy for Finite Complete Rewriting Systems 1986 47 TCS Johnson, Rational Equivalence Relations 1986 47 TCS Pelc, Lie Patterns in Search Procedures 1986 47 TCS Culik & Karhumaki, The Equivalence of Finite Valued Transducers (on HDT0L Languages) is Decidable 1986 47 TCS Valiant & Vazirani, NP is as Easy as Detecting Unique Solutions 1986 47 TCS Pecuchet, On the Complementation of Buchi Automata (Note) 1986 47 TCS Heintz, On Polynomials with Symmetric Galois Group Which are Easy to Compute (Note) 1986 47 TCS Wyrostek, On the Size of Unambiguous Context-free Grammars (Note) 1986 46 TCS Howell & Rosier & Huynh & Yen, Some Complexity Bounds for Problems Concerning Finite and 2-Dimensional Vector Addition Systems with States 1986 46 TCS Jaffar & Stuckey, Semantics of Infinite Tree Logic Programming 1986 46 TCS Duboc, On Some Equations in Free Partially Commutative Monoids 1986 46 TCS Brazma & Kinber, Generalized Regular Expressions--A Language for Synthesis of Programs with Branching in Loops 1986 46 TCS Longo & Martini, Computability in Higher Types, P_omega and the Completeness of Type Assignment 1986 46 TCS Phan Dinh Dieu & Le Cong Thanh & Le Tuan Hoa, Average Polynomial Time Complexity of Some NP-Complete Problems 1986 46 TCS Hajek, A Simple Dynamic Logic 1986 46 TCS Huang & Lengauer, The Automated Proof of a Trace Transformation for a Bitonic Sort 1986 46 TCS Dicky, An Algebraic and Algorithmic Method for Analysing Transition Systems 1986 46 TCS Hardin & Laville, Proof of Termination of the Rewriting System SUBST on CCL (Note) 1986 46 TCS Diekert, On Some Variants of the Ehrenfeucht Conjecture (Note) 1986 46 TCS Diekert, Commutative Monoids Have Complete Presentations by Free (Non-commutative) Monoids (Note) 1986 46 TCS Griesser, Lower Bounds for the Approximative Complexity (Note) 1986 46 TCS Mauduit, Morphismes, Unispectraux 1986 46 TCS Bernot & Bidoit & Choppy, Abstract Data Types with Exception Handling: An Initial Approach Based on a Distinction Between Exceptions and Errors 1986 46 TCS Guo & Xu & Thierrin, Disjunctive Decomposition of Languages 1986 46 TCS Hashiguchi, Notes on Finitely Generated Semigroups and Pumping Conditions for Regular Languages 1986 46 TCS Lerat & Lipski, Nonapplicable Nulls 1986 46 TCS Head & Lando, Periodic D0L Languages 1986 46 TCS Yamasaki & Takahashi & Kobayashi, Characterizations of omega-Regular Languages by Monadic Second-Order Formulas 1986 46 TCS Latteux & Timmerman, Two Characterizations of Rational Adherences (Note) 1986 45 TCS Huber & Jensen & Jepsen & Jensen, Reachability Trees for High-level Petri Nets 1986 45 TCS Ait-Kaci, An Algebraic Semantics Approach to the Effective Resolution of Type Equations 1986 45 TCS Dezani-Ciancaglini & Margaria, A Characterization of F-complete Assignments 1986 45 TCS Girard, The System F of Variable Types, Fifteen Years Later 1986 45 TCS Meyer, Merging Regular Processes by Means of Fixed-point Theory 1986 45 TCS Broy, A Theory for Nondeterminism, Parallelism, Communication, and Concurrency 1986 45 TCS Crochemore, Transducers and Repetitions 1986 45 TCS Gonczarowski & Warmuth, Manipulating Derivation Forests by Scheduling Techniques 1986 44 TCS Dunne, The Complexity of Central Slice Functions 1986 44 TCS Takahashi, The Greatest Fixed-Points and Rational Omega-Tree Languages 1986 44 TCS Kreowski & Wilharm, Net Processes Correspond to Derivation Processes in Graph Grammars 1986 44 TCS Dowling & Gallier, Continuation Semantics for Flowgraph Equations 1986 44 TCS Poulsen, The Ehrenfeucht Conjecture: An Algebra-Framework for its Proof (Note) 1986 44 TCS Paul, On Solving the Equality Problem in Theories Defined by Horn Clauses 1986 44 TCS Leiss, Generalized Language Equations with Multiple Solutions 1986 44 TCS Kobayashi, Repetition-free Words 1986 44 TCS Diekert, Complete Semi-Thue Systems for Abelian Groups 1986 44 TCS Etzion, An Algorithm for Generating Shift-Register Cycles 1986 44 TCS Okawa & Hirose & Yoneda, On the Impossibility of the Homomorphic Characterization of Context-sensitive Languages (Note) 1986 44 TCS Urbanek, On Greibach Normal Form Construction (Note) 1986 44 TCS Narendran, On the Equivalence Problem for Regular Thue Systems (Note) 1986 44 TCS Ritzmann, A Fast Numerical Algorithm for the Composition of Power Series with Complex Coefficients 1986 44 TCS Blanchard & Hansel, Systemes Codes 1986 44 TCS Leivant, Typing and Computational Properties of Lambda Expressions 1986 44 TCS Rosier & Yen, Boundedness, Empty Channel Detection, and Synchronization for Communicating Finite Automata 1986 44 TCS Blanchard & Martinez, Points d'Orbite Dense de Certains Langages de Mots Infinis (Note) 1986 44 TCS Chang & Ibarra & Palis & Ravikumar, On Pebble Automata (Note) 1986 43 TCS Adamek & Reiterman & Nelson, Continuous Semilattices 1986 43 TCS Albert & Lawrence, Test Sets for Finite Substitutions (Note) 1986 43 TCS Berghammer & Zierer, Relational Algebraic Semantics of Deterministic and Nondeterministic Programs 1986 43 TCS Clote, On the Finite Containment Problem for Petri Nets (Note) 1986 43 TCS de Luca & Restivo, Star-free Sets of Integers 1986 43 TCS Edwards, The Complexity of Colouring Problems on Dense Graphs (Note) 1986 43 TCS Fages & Huet, Complete Sets of Unifiers and Matchers in Equational Theories 1986 43 TCS Goldschlager & Parberry, On the Construction of Parallel Computers from Various Bases of Boolean Functions 1986 43 TCS Grzymala-Busse & Bavel, Characterization of State-Independent Automata 1986 43 TCS Hansel, Une Demonstration Simple du Theoreme de Skolem-Mahler-Lech (Note) 1986 43 TCS Heering, Partial Evaluation and omega-Completeness of Algebraic Specifications 1986 43 TCS Janicki & Lauer & Koutny & Devillers, Concurrent and Maximally Concurrent Evolution of Nonsequential Systems 1986 43 TCS Jerrum & Valiant & Vazirani, Random Generation of Combinatorial Structures from a Uniform Distribution 1986 43 TCS Johnson, A Simple Proof of a Time-Space Trade-off for Sorting with Linear Comparisons (Note) 1986 43 TCS Landau & Vishkin, Efficient String Matching with k Mismatches 1986 43 TCS Lindsay, Alternation and omega-Type Turing Acceptors (Note) 1986 43 TCS Orlowska, Semantic Analysis of Inductive Reasoning 1986 43 TCS Pasztor & Statman, Scott Induction and Closure under omega-Sups 1986 43 TCS Redziejowski, Infinite-Word Languages and Continuous Mappings 1986 43 TCS Ronse, A Topological Characterization of Thinning 1986 43 TCS Saoudi, Varietes d'Automates Descendants d'Arbres Infinis 1986 43 TCS Scheuing, Decomposition of Linear Automata over Residue Rings into Shift-Registers 1986 43 TCS Suzuki & Motohashi & Taniguchi & Kasami & Okamoto, Specification and Verification of Decentralized Daisy Chain Arbiters with omega-Extended Regular Expressions 1986 43 TCS Wegener, More on the Complexity of Slice Functions 1986 42 TCS Engelfriet & Vogler, Pushdown Machines for the Macro Tree Transducer 1986 42 TCS Wirsing, Structured Algebraic Specifications: A Kernel Language 1986 42 TCS Courcelle, Equivalences and Transformations of Regular Systems--Applications to Recursive Program Schemes and Grammars 1985 41 TCS Albert & Lawrence, A Proof of Ehrenfeucht's Conjecture (Note) 1985 41 TCS Barbin-Le Rest & Le Rest, Sur la Combinatoire des Codes a Deux Mots 1985 41 TCS Bunder, Possible Forms of Evaluation or Reduction in Martin-Lof Type Theory (Note) 1985 41 TCS Cazanescu, On Context-Free Trees 1985 41 TCS Dahlhaus & Gaifman, Concerning Two-Adjacent Context-Free Languages 1985 41 TCS Gohon, An Algorithm to Decide Whether a Rational Subset of N^k is Recognizable 1985 41 TCS Goles Ch., Dynamics of Positive Automata Networks 1985 41 TCS Grant & Minker, Inferences for Numerical Dependencies 1985 41 TCS Hayashi, Adjunction of Semifunctors: Categorical Structures in Nonextensional Lambda Calculus 1985 41 TCS Helfrich, Algorithms to Construct Minkowski Reduced and Hermite Reduced Lattice Bases 1985 41 TCS Hirokawa, Complexity of the Combinator Reduction Machine 1985 41 TCS Ibarra & Palis & Kim, Fast Parallel Language Recognition by Cellular Automata 1985 41 TCS Iliopoulos, Computing in General Abelian Groups is Hard 1985 41 TCS Inoue & Takanami & Vollmar, Alternating On-line Turing Machines with Only Universal States and Small Space Bounds (Note) 1985 41 TCS Karhumaki, A Property of Three-Element Codes 1985 41 TCS Maon, On the Equivalence Problem of Compositions of Morphisms and Inverse Morphisms on Context-Free Languages (Note) 1985 41 TCS Meyer auf der Heide, Simulating Probabilistic by Deterministic Algebraic Computation Trees (Note) 1985 41 TCS Monien & Sudborough, Bandwidth Constrained NP-Complete Problems 1985 41 TCS Paun, A Variant of Random Context Grammars: Semi-Conditional Grammars 1985 41 TCS Pelz, On the Complexity of Theories of Permutations 1985 41 TCS Reisig, Petri Nets with Individual Tokens 1985 41 TCS Slutzki, Alternating Tree Automata 1985 41 TCS Stoss, The Complexity of Evaluating Interpolation Polynomials (Note) 1985 41 TCS Thibon, Integrite des Algebres de Series Formelles sur un Alphabet Partiellement Commutatif (Note) 1985 41 TCS Tomita & Seino, A Weaker Sufficient Condition for the Equivalence of a Pair of dpda's to be Decidable 1985 40 TCS Aalbersberg & Rozenberg, cts Systems and Petri Nets 1985 40 TCS Abdali & Saunders, Transitive Closure and Related Semiring Properties via Eliminants 1985 40 TCS Ayers, Deque Automata and a Subfamily of Context-Sensitive Languages Which Contains All Semilinear Bounded Languages 1985 40 TCS Balcazar & Book & Schoening, On Bounded Query Machines 1985 40 TCS Bauer, n-Level Rewriting Systems 1985 40 TCS Blumer & Blumer & Haussler & Ehrenfeucht & Chen & Seiferas, The Smallest Automaton Recognizing the Subwords of a Text 1985 40 TCS Book & Otto, On the Verifiability of Two-Party Algebraic Protocols 1985 40 TCS Bucher & Ehrenfeucht & Haussler, On Total Regulators Generated by Derivation Relations 1985 40 TCS Fogelman-Soulie, Parallel and Sequential Computation on Boolean Networks 1985 40 TCS Ginzburg & Yoeli, Reducibility of Synchronization Structures 1985 40 TCS Gonthier, Algebraic Calculi of Processes and Net Expressions (Note) 1985 40 TCS Huang & Lieberherr, Implications of Forbidden Structures for Extremal Algorithmic Problems 1985 40 TCS Kaminski, A Lower Bound for Polynomial Mutliplication (Note) 1985 40 TCS Kanaoka & Tomita, Homogeneous Decomposition of Stochastic Systems 1985 40 TCS Karhumaki, On Three-Element Codes 1985 40 TCS Kobayashi, On the Structure of One-Tape Nondeterministic Turing Machine Time Hierarchy 1985 40 TCS Krishnamoorthy & Narendran, On Recursive Path Ordering (Note) 1985 40 TCS Mascari & Venturini Zilli, While-Programs with Nondeterministic Assignments and the Logic ALNA 1985 40 TCS Paige & Tarjan & Bonic, A Linear Time Solution to the Single Function Coarsest Partition Problem 1985 40 TCS Restivo & Reutenauer, Rational Languages and the Burnside Problem 1985 40 TCS Schoening, Robust Algorithms: A Different Approach to Oracles 1985 40 TCS Urbanek, On Greibach Normal Form Construction (Note) 1985 39 TCS Arnold, A Syntactic Congruence for Rational omega-Languages (Note) 1985 39 TCS Artalejo, Some Questions about Expressiveness and Relative Completeness in Hoare's Logic 1985 39 TCS Back & Mannila, On the Suitability of Trace Semantics for Modular Proofs of Communicating Processes 1985 39 TCS Bohm & Berarducci, Automatic Synthesis of Typed Lambda-Programs on Term Algebras 1985 39 TCS Book & Otto, On the Security of Name-Stamp Protocols (Note) 1985 39 TCS Bunder, An Extension of Klop's Counterexample to the Church-Rosser Property to lambda-Calculus with Other Ordered Pair Combinators 1985 39 TCS Frougny, Context-Free Grammars with Cancellation Properties 1985 39 TCS Ginsburg & Spanier, On Completing Tables to Satisfy Functional Dependencies 1985 39 TCS Haken, The Intractability of Resolution 1985 39 TCS Heintz, Corrigendum: Definability and Fast Quantifier Elimination in Algebraically Closed Fields 1985 39 TCS Hull, Non-Finite Specifiability of Projections of Functional Dependency Families 1985 39 TCS Ibarra & Palis & Chang, On Efficient Recognition of Transductions and Relations 1985 39 TCS Joseph & Young, Some Remarks on Witness Functions for Nonpolynomial and Noncomplete Sets in NP 1985 39 TCS Kannan, Solving Systems of Linear Equations over Polynomials 1985 39 TCS Kapur & Narendran & Krishnamoorthy & McNaughton, The Church-Rosser Property and Special Thue Systems 1985 39 TCS Lassez & Maher, Optimal Fixedpoints of Logic Programs 1985 39 TCS Leiss, On Solving Star Equations (Note) 1985 39 TCS Mahaney & Young, Reductions among Polynomial Isomorphism Types 1985 39 TCS Parigot & Pelz, A Logical Approach of Petri Net Languages 1985 39 TCS Priese, On a Fast Decomposition Method in Some Models of Concurrent Computations 1985 39 TCS Siromoney & Dare, On Infinite Words Obtained by Selective Substitution Grammars 1985 39 TCS Spehner, Systemes Entiers d'Equations sur un Alphabet Fini et Conjecture d'Ehrenfeucht 1985 39 TCS Stirling, A Proof-Theoretic Characterization of Observational Equivalence 1985 39 TCS Vogel & Wagner, Two-Way Automata with More than One Storage Medium 1985 38 TCS Asano, An Approach to the Subgraph Homeomorphism Problem 1985 38 TCS Beeri & Vardi, Formal Systems for Join Dependencies 1985 38 TCS Burkhard, An Investigation of Controls for Concurrent Systems Based on Abstract Control Languages 1985 38 TCS Finkel, Une Generalisation des Theoremes de Higman et de Simon aux Mots Infinis (Note) 1985 38 TCS Fle & Roucairol, Maximal Serializability of Iterated Transactions 1985 38 TCS Gonzalez, Clustering to Minimize the Maximum Intercluster Distance 1985 38 TCS Harel & Peleg, Process Logic with Regular Formulas 1985 38 TCS Imori & Yamada, Periodic Character Sequences Where Identifying Two Characters Strictly Reduces the Period 1985 38 TCS Jantzen, Extending Regular Expressions with Iterated Shuffle 1985 38 TCS Kreitz & Weihrauch, Theory of Representations 1985 38 TCS Leconte, A Characterization of Power-Free Morphisms (Note) 1985 38 TCS Leiss, Succinct Representation of Regular Languages by Boolean Automata II (Note) 1985 38 TCS Linial & Tarsi, Deciding Hypergraph 2-Colourability by H-Resolution (Note) 1985 38 TCS Mishra & Clarke, Hierarchical Verification of Asynchronous Circuits Using Temporal Logic 1985 38 TCS Ramanan & Liu, Permutation Representation of k-ary Trees 1985 38 TCS Rosenkrantz & Hunt, Testing for Grammatical Coverings 1985 38 TCS Schmidt, The Recursion-Theoretic Structure of Complexity Classes 1985 38 TCS Snir, Lower Bounds on Probabilistic Linear Decision Trees 1985 38 TCS Van, Ensembles Code-Compatibles et une Generalisation du Theoreme de Sardinas-Patterson (Note) 1985 38 TCS Watanabe, On One-One Polynomial Time Equivalence Relations 1985 38 TCS Wegener, On the Complexity of Slice Functions 1985 38 TCS Weihrauch, Type 2 Recursion Theory 1985 37 TCS Bergstra & Klop, Algebra of Communicating Processes with Abstraction 1985 37 TCS Bouge, A Contribution to the Theory of Program Testing 1985 37 TCS Culik & Fris, Topological Transformations as a Tool in the Design of Systolic Networks 1985 37 TCS Darondeau, About Fair Asynchrony 1985 37 TCS de Simone, Higher-Level Synchronising Devices in MEIJE-SCCS 1985 37 TCS Ehrenfeucht & Kleijn & Rozenberg, Adding Global Forbidding Context to Context-Free Grammars 1985 37 TCS Gallier & Book, Reductions in Tree Replacement Systems 1985 37 TCS Gonczarowski & Warmuth, Applications of Scheduling Theory to Formal Language Theory 1985 37 TCS Ko, On Some Natural Complete Operators 1985 37 TCS Muller & Schupp, The Theory of Ends, Pushdown Automata, and Second-Order Logic 1985 37 TCS Rozenberg, On Coordinated Selective Substitutions: Towards a Unified Theory of Grammars and Machines 1985 37 TCS Tarlecki, On the Existence of Free Models in Abstract Algebraic Institutions 1985 36 TCS Allender & Klawe, Improved Lower Bounds for the Cycle Detection Problem 1985 36 TCS Alt, Mutliplication is the Easiest Nontrivial Arithmetic Function (Note) 1985 36 TCS Blum, An Omega(n^{4/3}) Lower Bound on the Monotone Network Complexity of the n^{th} Degree Convolution 1985 36 TCS Broy, On the Herbrand-Kleene Universe for Nondeterministic Computations 1985 36 TCS de Felice, Construction de Codes Factorisants (Note) 1985 36 TCS Demel & Demlova & Koubek, Fast Algorithms Constructing Minimal Subalgebras, Congruences, and Ideals in a Finite Algebra 1985 36 TCS Diks, Embeddings of Binary Trees in Lines 1985 36 TCS Engelfriet, Determinacy --> (Observation Equivalence = Trace Equivalence) 1985 36 TCS Fagin & Klawe & Pippenger & Stockmeyer, Bounded-Depth, Polynomial-Size Circuits for Symmetric Functions 1985 36 TCS Farinas del Cerro & Orlowska, DAL--A Logic for Data Analysis 1985 36 TCS Farr & McDiarmid, The Complexity of Counting Homeomorphs (Note) 1985 36 TCS Finton & Whitty & Kaposi, A Generalised Mathematical Theory of Structured Programming 1985 36 TCS Hirose & Yoneda, On the Chomsky and Stanley's Homomorphic Characterization of Context-Free Languages (Note) 1985 36 TCS Igarashi, A Pumping Lemma for Real-Time Deterministic Context-Free Languages 1985 36 TCS Janicki, Transforming Sequential Systems into Concurrent Systems 1985 36 TCS Jerrum, The Complexity of Finding Minimum-Length Generator Sequences 1985 36 TCS Kaminski, A Classification of omega-Regular Languages 1985 36 TCS Keller-Gehrig, Fast Algorithms for the Characteristic Polynomial 1985 36 TCS Matsuno & Inoue & Taniguchi & Takanami, Alternating Simple Multihead Finite Automata 1985 36 TCS Ruohonen, On Equality of Mutliplicity Sets of Regular Languages (Note) 1985 36 TCS Rytter & Chrobak, A Characterization of Reversal-Bounded Multipushdown Machine Languages (Note) 1985 36 TCS Sudborough & Welzl, Complexity and Decidability for Chain Code Picture Languages 1985 36 TCS Tiomkin & Makowsky, Propositional Dynamic Logic with Local Assignments 1985 36 TCS Winskel, On Powerdomains and Modality (Note) 1985 35 TCS Ausiello & d'Atri & Moscarini, On the Existence of Acyclic Views in a Database Scheme 1985 35 TCS Benoit, Axiomatisation des Tests 1985 35 TCS Bloom & Troeger, A Logical Characterization of Observation Equivalence 1985 35 TCS Cori & Metivier, Recognizable Subsets of Some Partially Abelian Monoids 1985 35 TCS Edelsbrunner, Finding Transversals for Sets of Simple Geometric Figures 1985 35 TCS Fribourg, A Superposition Oriented Theorem Prover 1985 35 TCS Head & Wilkinson, Code Properties and Homomorphisms of D0L Systems 1985 35 TCS Hirose & Okawa & Yoneda, A Homomorphic Characterization of Recursively Enumerable Languages 1985 35 TCS Kapur & Krishnamoorthy & McNaughton & Narendran, An O(/T/^3) Algorithm for Testing the Church-Rosser Property of Thue Systems (Note) 1985 35 TCS Kapur & Narendran, A Finite Thue System with Decidable Word Problem and without Equivalent Finite Canonical System (Note) 1985 35 TCS Kobayashi, On Proving Time Constructibility of Functions 1985 35 TCS Lange & Welzl, Recurrent Words and Simultaneous Growth in T0L Systems 1985 35 TCS Leiss, On Classes of Tractable Unrestricted Regular Expressions 1985 35 TCS Memmi & Finkel, An Introduction to FIFO Nets--Monogeneous Nets: A Subclass of FIFO Nets 1985 35 TCS Metivier, Calcul de Longueurs de Chaines de Reecriture dans le Monoide Libre 1985 35 TCS Narendran & Otto, Complexity Results on the Conjugacy Problem for Monoids 1985 35 TCS Oyamaguchi, On the Data Type Extension Problem for Algebraic Specifications 1985 35 TCS Pecuchet, Automates Boustrophedon et Mots Infinis (Note) 1985 35 TCS Pin & Sakarovitch, Une Application de la Representation Matricielle des Transductions 1985 35 TCS Plaisted, Complete Divisibility Problems for Slowly Utilized Oracles 1985 35 TCS Sain, A Simple Proof for the Completeness of Floyd's Method (Note) 1985 35 TCS Stern, Characterizations of Some Classes of Regular Events 1984 34 TCS Bancilhon & Richard, A Sound and Complete Axiomatization of Embedded Cross Dependencies (Note) 1984 34 TCS Clerbout & Latteux, Partial Commutations and Faithful Rational Transductions 1984 34 TCS Cohen & Lehmann & Pnueli, Symmetric and Economical Solutions to the Mutual Exclusion Problem in a Distributed System 1984 34 TCS de Bakker & Bergstra & Klop & Meyer, Linear Time and Branching Time Semantics for Recursion with Merge 1984 34 TCS de Nicola & Hennessy, Testing Equivalences for Processes 1984 34 TCS Delest & Viennot, Algebraic Languages and Polyominoes Enumeration 1984 34 TCS Gogolla & Drosten & Lipeck & Ehrich, Algebraic and Operational Semantics of Specifications Allowing Exceptions and Errors 1984 34 TCS Hartmanis & Yesha, Computation Times of NP Sets of Different Densities 1984 34 TCS Ito & Iwasaki & Taniguchi & Kasami, Membership Problems for Data Dependencies in Relational Expressions 1984 34 TCS Itzhaik & Yehudai, New Families of Non Real Time dpda's and Their Decidability Results 1984 34 TCS Kamimura & Tang, Total Objects of Domains 1984 34 TCS Lenstra, Factoring Multivariate Integral Polynomials 1984 34 TCS Nesetril, Some Nonstandard Ramsey Like Applications 1984 34 TCS Sato & Tamaki, Enumeration of Success Patterns in Logic Programs 1984 34 TCS Schoening, On Small Generators (Note) 1984 34 TCS Vitanyi, On the Simulation of Many Storage Heads by One 1984 34 TCS Winskel, Synchronization Trees 1984 33 TCS Apt & Pnueli & Stavi, Fair Termination Revisited--with Delay 1984 33 TCS Astesiano & Zucca, Parametric Channels via Label Expressions in CCS 1984 33 TCS Broy & Wirsing & Pair, A Systematic Study of Models of Abstract Data Types 1984 33 TCS Dybjer, Some Results on the Deductive Structure of Join Dependencies 1984 33 TCS Fehr, Expressive Power of Typed and Type-Free Programming Languages 1984 33 TCS Girault-Beauquier, Bilimites de Langages Reconnaissables (Note) 1984 33 TCS Harju & Linna, The Equations h(w) = w^n in Binary Alphabets (Note) 1984 33 TCS Huynh, Deciding the Inequivalence of Context-Free Grammars with 1-Letter Terminal Alphabet is Sigma^p_2-Complete 1984 33 TCS Jantzen & Kudlek, Homomorphic Images of Sentential Form Languages Defined by Semi-Thue Systems 1984 33 TCS Kaplan, Conditional Rewrite Rules 1984 33 TCS Maon & Yehudai, On Test Sets for Checking Morphism Equivalence on Languages with Fair Distribution of Letters 1984 33 TCS Otto, Some Undecidability Results for Non-Monadic Church-Rosser Thue Systems 1984 33 TCS Pan, The Techniques of Trilinear Aggregating and the Recent Progress in the Asymptotic Acceleration of Matrix Operations 1984 33 TCS Perrin & Schupp, Sur les Monoides a un Relateur Qui sont des Groupes (Note) 1984 33 TCS Ravikumar & Lakshmanan, Coping with Known Patterns of Lies in a Search Game 1984 33 TCS Siromoney & Subramanian & Dare, Infinite Arrays and Controlled Deterministic Table 0L Array Systems 1984 33 TCS Soundararajan, Denotational Semantics of CSP 1984 33 TCS Veni Madhavan, Secondary Attribute Retrieval Using Tree Data Structures 1984 32 TCS Astesiano & Costa, Distributive Semantics for Nondeterministic Typed lambda-Calculi 1984 32 TCS Avenhaus & Madlener, On the Complexity of Intersection and Conjugacy Problems in Free Groups 1984 32 TCS Avenhaus & Madlener, The Nielsen Reduction and P-Complete Problems in Free Groups 1984 32 TCS Chin & Kossowski & Loh, Efficient Inference Control for Range SUM Queries 1984 32 TCS Culik & Yu, Iterative Tree Automata 1984 32 TCS de Bruijn, Some Machines Defined by Directed Graphs 1984 32 TCS Duske & Parchmann, Linear Indexed Languages 1984 32 TCS Francez & Lehmann & Pnueli, A Linear-History Semantics for Languages for Distributed Programming 1984 32 TCS Hall, Biprefix Codes, Inverse Semigroups and Syntactic Monoids of Injective Automata 1984 32 TCS Hong, A Tradeoff Theorem for Space and Reversal (Note) 1984 32 TCS Jacob & Reutenauer, On Formal Power Series Defined by Infinite Linear Systems (Note) 1984 32 TCS Ketonen & Weyhrauch, A Decidable Fragment of Predicate Calculus 1984 32 TCS Maier & Ullman, Connections in Acyclic Hypergraphs 1984 32 TCS McAloon, Petri Nets and Large Finite Sets 1984 32 TCS Meshulam, A Geometric Construction of a Superconcentrator of Depth 2 (Note) 1984 32 TCS Miyano & Hayashi, Alternating Finite Automata on omega-Words 1984 32 TCS Niemi, The Undecidability of Form Equivalence for Context-Free and E0L Forms 1984 32 TCS Otto, Finite Complete Rewriting Systems for the Jantzen Monoid and the Greendlinger Group 1984 32 TCS Raoult, On Graph Rewritings 1984 32 TCS Staiger, Projection Lemmas for omega-Languages (Note) 1984 32 TCS Tomita, An Extended Direct Branching Algorithm for Checking Equivalence of Deterministic Pushdown Automata 1984 32 TCS Vishkin, A Parallel-Design Distributed-Implementation (PDDI) General-Purpose Computer 1984 31 TCS Alaiwan, Equivalence of Infinite Behavior of Finite Automata 1984 31 TCS Autebert & Beauquier & Boasson & Senizergues, Remarques sur les Langages de Parentheses 1984 31 TCS Bruce & Longo, On Combinatory Algebras and Their Expansions 1984 31 TCS de Simone, Langages Infinitaires et Produit de Mixage 1984 31 TCS Ehrenfeucht & Main & Rozenberg, Restrictions on NLC Graph Grammars 1984 31 TCS Frutos Escrig, A Characterization of Plotkin's Order in Powerdomains, and Some of Its Properties 1984 31 TCS Goguen & Burstall, Some Fundamental Algebraic Tools for the Semantics of Computation. Part 2: Signed and Abstract Theories 1984 31 TCS Goguen & Burstall, Some Fundamental Algebraic Tools for the Semantics of Computation. Part 1: Comma Categories, Colimits, Signatures and Theories 1984 31 TCS Head, Adherences of D0L Languages 1984 31 TCS Honkala, Bases and Ambiguity of Number Systems 1984 31 TCS Ko, Reducibilities on Real Numbers 1984 31 TCS Mahr & Makowsky, Characterizing Specification Languages Which Admit Initial Semantics 1984 31 TCS Mezghiche, Une Nouvelle Cbeta-Reduction dans la Logique Combinatoire 1984 31 TCS Narendran & McNaughton, The Undecidability of the Preperfectness of Thue Systems 1984 31 TCS Oyamaguchi, Some Results on Subclass Containment Problems for Special Classes of dpda's Related to Nonsingular Machines 1984 31 TCS Plaisted, New NP-Hard and NP-Complete Polynomial and Integer Divisibility Problems 1984 31 TCS Schoening, Minimal Pairs for P 1984 31 TCS Soundararajan, A Proof Technique for Parallel Programs 1984 31 TCS Uchimura, Truncations of Infinite Matrices and Algebraic Series Associated with Some CF Grammars 1984 31 TCS Yamasaki & Takahashi, Generalized Parenthesis Languages and Minimization of Their Parenthesis Parts 1984 31 TCS Yamasaki, Normal Petri Nets 1984 30 TCS Austry & Boudol, Algebre de Processus et Synchronisation 1984 30 TCS Bergstra & Klop, Proving Program Inclusion Using Hoare's Logic 1984 30 TCS Braquelaire & Courcelle, The Solutions of Two Star-Height Problems for Regular Trees 1984 30 TCS de Simone, On Meije and SCCS: Infinite Sum Operators vs. Non-Guarded Definitions (Note) 1984 30 TCS Denenberg & Lewis, The Complexity of the Satisfiability Problem for Krom Formulas 1984 30 TCS Genrich & Thiagarajan, A Theory of Bipolar Synchronization Schemes 1984 30 TCS Klaeren, A Constructive Method for Abstract Algebraic Software Specification 1984 30 TCS Olderog, Correctness of Programs with Pascal-Like Procedures without Global Variables 1984 29 TCS Coppo, Completeness of Type Assignment in Continuous Lambda Models 1984 29 TCS de Bakker & Meyer & Zucker, Corrigendum to ``On Infinite Computations in Denotational Semantics'' 1984 29 TCS Eisman, On the Ratio of Growth Functions in EDT0L Languages 1984 29 TCS Elrad & Francez, A Weakest Precondition Semantics for Communicating Processes 1984 29 TCS Fachini & Napoli, Hierarchies of Primitive Recursive Wordsequence Functions: Comparisons and Decision Problems 1984 29 TCS Fraenkel, Wythoff Games, Continued Fractions, Cedar Trees and Fibonacci Searches 1984 29 TCS Frederickson, Recursively Rotated Orders and Implicit Data Structures: A Lower Bound 1984 29 TCS Ibarra & Kim, Characterizations and Computational Complexity of Systolic Trellis Automata 1984 29 TCS Janicki, Nets, Sequential Components and Concurrency Relations 1984 29 TCS Kamimura & Tang, Effectively Given Spaces 1984 29 TCS Karhumaki, The Ehrenfeucht Conjecture: A Compactness Claim for Finitely Generated Free Monoids 1984 29 TCS Lassez & Maher, Closures and Fairness in the Semantics of Programming Logic 1984 29 TCS Orlowska & Pawlak, Representation of Nondeterministic Information 1984 29 TCS Potts, Remarks on an Example of Jantzen 1984 29 TCS Rozenberg & Verraedt, On Simulation and Propagating E0L Forms 1984 29 TCS Traub & Wasilkowski & Wozniakowski, Average Case Optimality for Linear Problems 1984 29 TCS Venturini Zilli, Reduction Graphs in the Lambda Calculus 1984 28 TCS Apt, Ten Years of Hoare's Logic: A Survey--Part II: Nondeterminism 1984 28 TCS Bergstra & Tucker, Hoare's Logic for Programming Languages with Two Data Types (Note) 1984 28 TCS Bini, On Commutativity and Approximation 1984 28 TCS Blum, A Boolean Function Requiring 3n Network Size (Note) 1984 28 TCS Bucher & Maurer & Culik, Context-Free Complexity of Finite Languages 1984 28 TCS Cox & Pietrzykowski, A Complete, Nonredundant Algorithm for Reversed Skolemization 1984 28 TCS Ehrenfeucht & Rozenberg & Verraedt, On Inherently Ambiguous E0L Languages 1984 28 TCS Ehrig & Kreowski & Thatcher & Wagner & Wright, Parameter Passing in Algebraic Specification Languages 1984 28 TCS Fernandez & Thiagarajan, D-Continuous Causal Nets: A Model of Non-Sequential Processes 1984 28 TCS Grefenstette, Corrigendum to ``Stability in L Systems'' 1984 28 TCS Hindley, Coppo-Dezani Types Do Not Correspond to Propositional Logic (Note) 1984 28 TCS Kanaoka & Tomita, The Decomposition of Stochastic Systems (Note) 1984 28 TCS Kelemenova, Complexity of Normal Form Grammars 1984 28 TCS Kirkpatrick & Reisch, Upper Bounds for Sorting Integers on Random Access Machines 1984 28 TCS Kobayashi & Takahashi & Yamasaki, Characterization of omega-Regular Languages by First-Order Formulas 1984 28 TCS Maluszynski, Towards a Programming Language Based on the Notion of Two-Level Grammar 1984 28 TCS Parisi-Presicce, Iterative Factor Algebras and Induced Metrics 1984 28 TCS Paul, On Heads versus Tapes 1984 28 TCS Perrin, Completing Biprefix Codes (Note) 1984 28 TCS Ronchi Della Rocca & Venneri, Principal Type Schemes for an Extended Type Theory 1984 28 TCS Wiehagen & Freivalds & Kinber, On the Power of Probabilistic Strategies in Inductive Inference 1983 27 TCS Adamek & Nelson, Separately Continuous Algebras (Note) 1983 27 TCS Blum, More on the Power of Chain Rules in Context-Free Grammars 1983 27 TCS Bozapalidis & Louscou-Bozapalidou, The Rank of a Formal Tree Power Series (Note) 1983 27 TCS Dobkin & Kirkpatrick, Fast Detection of Polyhedral Intersection 1983 27 TCS Duris & Hromkovic, One-Way Simple Multihead Finite Automata are not Closed under Concatenation 1983 27 TCS Ehrenfeucht & Haussler & Rozenberg, On Regularity of Context-Free Languages 1983 27 TCS Ehrich & Lipeck, Algebraic Domain Equations 1983 27 TCS Ehrig & Kreowski, Compatibility of Parameter Passing and Implementation of Parameterized Data Types 1983 27 TCS Halpern & Reif, The Propositional Dynamic Logic of Deterministic, Well-Structured Programs 1983 27 TCS Hunt & Rosenkrantz, The Complexity of Monadic Recursion Schemes: Executability Problems, Nesting Depth, and Applications 1983 27 TCS Inoue & Takanami & Taniguchi, Two-Dimensional Alternating Turing Machines 1983 27 TCS Kamimura & Tang, Algebraic Relations and Presentations 1983 27 TCS Kozen, Results on the Propositional mu-Calculus 1983 27 TCS Maruoka, Open Maps for Tessellation Automata (Note) 1983 27 TCS Rozenberg & Verraedt, Subset Languages of Petri Nets--Part II: Closure Properties 1983 27 TCS Smyth, The Largest Cartesian Closed Category of Domains 1983 27 TCS Stolboushkin & Taitslin, The Comparison of the Expressive Power of First-Order Dynamic Logics 1983 27 TCS Tennent, Semantics of Interference Control 1983 26 TCS Arnold, Rational omega-Languages are Non-Ambiguous (Note) 1983 26 TCS Bucher & Hagauer, It is Decidable Whether a Regular Language is Pure Context-Free (Note) 1983 26 TCS de Bakker & Meyer & Zucker, On Infinite Computations in Denotational Semantics 1983 26 TCS Emerson, Alternative Semantics for Temporal Logics 1983 26 TCS Ginsburg & Hull, Characterizations for Functional Dependency and Boyce-Codd Normal Form Families 1983 26 TCS Ginsburg & Hull, Order Dependency in the Relational Model 1983 26 TCS Hartmanis, On Goedel Speed-Up and Succinctness of Language Representations (Note) 1983 26 TCS Hehner & Hoare, A More Complete Model of Communicating Processes 1983 26 TCS Ibarra & Rosier, Simple Programming Languages and Restricted Classes of Turing Machines 1983 26 TCS Istrail & Masalagiu, Nivat's Processing Systems: Decision Problems Related to Protection and Synchronization 1983 26 TCS Kinber, The Inclusion Problem for Some Classes of Deterministic Multitape Automata 1983 26 TCS Rajlich, Determinism in Parallel Systems (Note) 1983 26 TCS Rozenberg & Verraedt, Subset Languages of Petri Nets--Part I: The Relationship to String Languages and Normal Forms 1983 26 TCS Staples & Nguyen, Computing the Behaviour of Asynchronous Processes (Note) 1983 26 TCS Sudborough, Bandwidth Constraints on Problems Complete for Polynomial Time 1983 26 TCS Weihrauch & Schafer, Admissible Representations of Effective cpo's 1983 26 TCS Yap, Some Consequences of Non-Uniform Conditions on Uniform Classes 1983 26 TCS Zak, A Turing Machine Time Hierarchy (Note) 1983 25 TCS Case & Smith, Comparison of Identification Criteria for Machine Inductive Inference 1983 25 TCS Courcelle, Fundamental Properties of Infinite Trees 1983 25 TCS Kfoury, Definability by Programs in First-Order Structures 1983 25 TCS Milner, Calculi for Synchrony and Asynchrony 1983 25 TCS Nelson, Iterative Algebras 1983 25 TCS O'Dunlaing, Infinite Regular Thue Systems 1983 25 TCS Priese, Automata and Concurrency 1983 25 TCS Valk, Infinite Behaviour of Petri Nets 1983 24 TCS Bagchi & Mahanti, Admissible Heuristic Search in AND/OR Graphs 1983 24 TCS Book, Decidable Sentences of Church-Rosser Congruences 1983 24 TCS Chazelle & Monier, Unbounded Hardware is Equivalent to Deterministic Turing Machines 1983 24 TCS Daley, On the Error Correcting Power of Pluralism in BC-Type Inductive Inference 1983 24 TCS de Luca & Restivo & Salemi, On the Centers of a Language 1983 24 TCS Fischer & Jou & Tsou, Succinctness in Dependency Systems (Note) 1983 24 TCS Grefenstette, Stability in L Systems 1983 24 TCS Heintz, Definability and Fast Quantifier Elimination in Algebraically Closed Fields 1983 24 TCS Homer & Maass, Oracle-Dependent Properties of the Lattice of NP Sets 1983 24 TCS Ibarra & Moran & Rosier, On the Control Power of Integer Division 1983 24 TCS Ibarra, On Some Decision Questions Concerning Pushdown Machines 1983 24 TCS Inoue & Takanami & Taniguchi, A Relationship between Two-Dimensional Finite Automata and Three-Way Tape-Bounded Two-Dimensional Turing Machines (Note) 1983 24 TCS Nakamura & Aizawa, On a Relationship between Graph L-Systems and Picture Languages 1983 24 TCS Nambiar & Radhakrishnan & Tikekar, Representation of Functional Dependencies in Relational Databases Using Linear Graphs 1983 24 TCS Olderog, On the Notion of Expressiveness and the Rule of Adaptation (Note) 1983 24 TCS Schmidt, Approximation Properties of Abstract Data Types 1983 24 TCS Siromoney & Dare & Subramanian, Infinite Arrays and Infinite Computations 1983 24 TCS Soundararajan, Correctness Proofs of CSP Programs 1983 24 TCS Storer, Toward an Abstract Theory of Data Compression 1983 24 TCS Toda & Inoue & Takanami, Two-Dimensional Pattern Matching by Two-Dimensional On-Line Tessellation Acceptors 1983 24 TCS Vazirani & Vazirani, A Natural Encoding Scheme Proved Probabilistic Polynomial Complete 1983 24 TCS Watanabe, The Time-Precision Tradeoff Problem on On-Line Probabilistic Turing Machines 1983 24 TCS Wedde, An Iterative and Starvation-Free Solution for a General Class of Distributed Control Problems Based on Interaction Primitives 1983 23 TCS Back, A Continuous Semantics for Unbound Nondeterminism 1983 23 TCS Brandenburg, Uniformly Growing k-th Power-Free Homomorphisms 1983 23 TCS Chan & Ibarra, On the Finite-Valuedness Problem for Sequential Machines (Note) 1983 23 TCS Culik & Gruska & Salomaa, On a Family of L Languages Resulting from Systolic Tree Automata 1983 23 TCS Eisman, On Depth in EDT0L Languages 1983 23 TCS Etzion & Yoeli, Super-Nets and Their Hierarchy 1983 23 TCS Finn & Lieberherr, Primality Testing and Factoring (Note) 1983 23 TCS Freund, Real Functions and Numbers Defined by Turing Machines 1983 23 TCS Gelenbe, Stationary Deterministic Flows in Discrete Systems: I 1983 23 TCS Gordon & Shamir, Computation of Recursive Functionals Using Minimal Initial Segments 1983 23 TCS Head & Thierrin & Wilkinson, D0L Schemes and the Periodicity of String Embeddings (Note) 1983 23 TCS Heilbrunner, A Metatheorem for Undecidable Properties of Formal Languages and Its Application to LRR and LLR Grammars and Languages 1983 23 TCS Jankowski & Rauszer, Logical Foundation Approach to Users' Domain Restriction in Data Bases 1983 23 TCS Kamimura & Tang, Kleene Chain Completeness and Fixedpoint Properties 1983 23 TCS Lee & Liu & Wong, Corrigendum: (g_0, g_1,..., g_k)-Trees and Unary 0L Systems 1983 23 TCS Lotti & Romani, On the Asymptotic Complexity of Rectangular Matrix Mutliplication 1983 23 TCS Marchetti-Spaccamela & Protasi, The Largest Tree in a Random Graph 1983 23 TCS Nakamura & Ono, Pictures of Functions and Their Acceptibility by Automata 1983 23 TCS Nijholt, On Satisfying the LL-Iteration Theorem (Note) 1983 23 TCS O'Dunlaing, Undecidable Questions Related to Church-Rosser Thue Systems (Note) 1983 23 TCS Ramanan, A Counterexample of Shyamasundar's Characterization of Pushdown Permuters (Note) 1983 23 TCS Takahashi & Yamasaki, A Note on omega-Regular Languages (Note) 1983 23 TCS Tang & Zhang, The Limited Regular Languages 1983 23 TCS Tomita, A Direct Branching Algorithm for Checking Equivalence of Strict Deterministic vs. LL(k) Grammars 1983 23 TCS Volger, Turing Machines with Linear Alternation, Theories of Bounded Concatenation and the Decision Problem of First Order Theories (Note) 1983 22 TCS Apostolico & Preparata, Optimal Off-Line Detection of Repetitions in a String 1983 22 TCS Baur & Strassen, The Complexity of Partial Derivatives 1983 22 TCS Bergstra & Tucker, Hoare's Logic and Peano's Arithmetic 1983 22 TCS Boudol & Kott, Recursion Induction Principle Revisited 1983 22 TCS Gacs, On the Relation Between Descriptional Complexity and Algorithmic Probability 1983 22 TCS Hindley, Curry's Type-Rules are Complete with Respect to the F-Semantics Too 1983 22 TCS Hindley, The Completeness Theorem for Typing lambda-Terms 1983 22 TCS Ito & Taniguchi & Kasami, Membership Problem for Embedded Multivalued Dependencies under Some Restricted Conditions 1983 22 TCS Kuich & Urbanek, Infinite Linear Systems and One Counter Languages 1983 22 TCS Lee & Liu & Wong, (g_0, g_1,..., g_k)-Trees and Unary 0L Systems (Note) 1983 22 TCS Lempel & Seroussi & Winograd, On the Complexity of Mutliplication in Finite Fields 1983 22 TCS Lev & Valiant, Size Bounds for Superconcentrators 1983 22 TCS Maurer & Salomaa & Wood, L Codes and Number Systems 1983 22 TCS Pittl & Yehudai, Constructing a Realtime Deterministic Pushdown Automaton from a Grammar 1983 22 TCS Sato, Theory of Symbolic Expressions, I 1983 22 TCS Steinby, Systolic Trees and Systolic Language Recognition by Tree Automata (Note) 1983 22 TCS Takahashi, Nest Sets and Relativized Closure Properties 1983 22 TCS Wasilkowski, Any Iteration for Polynomial Equations Using Linear Information Has Infinite Complexity 1982 21 TCS Ainhirn, Marvellous Interpretations Differ Litter But Decisively from Ordinary Interpretations of E0L Forms 1982 21 TCS Berenguer & Diaz & Harper, A Solution of the Sperner-Erdos Problem (Note) 1982 21 TCS Bergstra & Meyer, On the Elimination of Iteration Quantifiers in a Fragment of Algorithmic Logic 1982 21 TCS Chlebus, On the Computational Complexity of Satisfiability in Propositional Logics of Programs 1982 21 TCS Cori & Machi, Construction of Maps with Prescribed Automorphism Group (Note) 1982 21 TCS Csirmaz, Determinateness of Program Equivalence over Peano Axioms (Note) 1982 21 TCS Duris & Galil, Fooling a Two Way Automaton or One Pushdown Store is Better than One Counter for Two Way Machines 1982 21 TCS Ehrenfeucht & Karhumaki & Rozenberg, The (Generalized) Post Correspondence Problem with Lists Consisting of Two Words is Decidable 1982 21 TCS Ehrenfeucht & Rozenberg, Representation Theorems Using D0S Languages 1982 21 TCS Goldschlager & Shaw & Staples, The Maximum Flow Problem is Log Space Complete for P (Note) 1982 21 TCS Head & Wilkinson, Finite D0L Languages and Codes (Note) 1982 21 TCS Indermark, On Rational Definitions in Complete Algebras without Rank 1982 21 TCS Istrail, Some Remarks on Non-Algebraic Adherences (Note) 1982 21 TCS Janssens & Rozenberg, Graph Grammars with Neighborhood-Controlled Embedding 1982 21 TCS Kent & Hodgson, An Arithmetical Characterization of NP 1982 21 TCS Kurka, Ergodic Languages (Note) 1982 21 TCS Long, Strong Nondeterministic Polynomial-Time Reducibilities 1982 21 TCS Loui, Simulations Among Multidimensional Turing Machines 1982 21 TCS Margolis, On the Syntactic Transformation Semigroup of a Language Generated by a Finite Biprefix Code (Note) 1982 21 TCS Miyano, Two-Way Deterministic Multi-Weak-Counter Machines 1982 21 TCS Monien & Sudborough, On Eliminating Nondeterminism from Turing Machines Which Use Less than Logarithm Worktape Space 1982 21 TCS Wegener, Boolean Functions Whose Monotone Complexity is of Size n^2/log n 1982 21 TCS Winkowski, An Algebraic Description of System Behaviours 1982 20 TCS Arnold & Dauchet, Morphismes et Bimorphismes d'Arbres 1982 20 TCS Berry & Curien, Sequential Algorithms on Concrete Data Structures 1982 20 TCS Damm, The IO- and OI-Hierarchies 1982 20 TCS Ehrig & Kreowski & Mahr & Padawitz, Algebraic Implementation of Abstract Data Types 1982 20 TCS Ko & Friedman, Computational Complexity of Real Functions 1982 20 TCS Wand, Specifications, Models, and Implementations of Data Abstractions 1982 19 TCS Atzeni & Ausiello & Batini & Moscarini, Inclusion and Equivalence between Rational Database Schemata 1982 19 TCS Book & Jantzen & Wrathall, Monadic Thue Systems 1982 19 TCS Cardon & Chrochemore, Partitioning a Graph in O(/A/ log_2 /V/) 1982 19 TCS Culik & Salomaa, On Infinite Words Obtained by Iterating Morphisms 1982 19 TCS Frederickson & Ja'Ja', On the Relationship between the Biconnectivity Augmentation and Travelling Salesman Problems 1982 19 TCS Gallier, Corrigendum: DPDA's in ``Atomic Normal Form'' and Applications to Equivalence Problems 1982 19 TCS Grigor'ev, Additive Complexity in Directed Computations 1982 19 TCS Hodgson, On Direct Products of Automaton Decidable Theories (Note) 1982 19 TCS Holcombe, On the Holonomy Decomposition of Transformation Semigroups (Note) 1982 19 TCS Ibarra & Leininger & Moran, On the Complexity of Simple Arithmetic Expressions 1982 19 TCS Ibarra, 2DST Mappings on Languages and Related Problems (Note) 1982 19 TCS Ito & Nishitani, On Universality of Concurrent Expressions with Synchronization Primitives (Note) 1982 19 TCS Lewis & Papadimitriou, Symmetric Space-Bounded Computation 1982 19 TCS Megiddo, Is Binary Encoding Appropriate for the Problem-Language Relationship? (Note) 1982 19 TCS Padawitz, Graph Grammars and Operational Semantics 1982 19 TCS Paredaens, A Universal Formalism to Express Decompositions, Functional Dependencies and Other Constraints in a Relational Database 1982 19 TCS Perl & Zaks, On the Complexity of Edge Labelings for Trees 1982 19 TCS Reischuk, A Fast Implementation of a Multidimensional Storage into a Tree Storage 1982 19 TCS Selman, Reductions on NP and P-Selective Sets 1982 19 TCS Sethi, Pebble Games for Studying Storage Sharing 1982 19 TCS Snir, Comparisons between Linear Functions Can Help 1982 19 TCS Szwerinski, Time-Optimal Solution of the Firing-Squad-Synchronization Problem for n-Dimensional Rectangles with the General at an Arbitrary Position 1982 19 TCS Yao, On the Time-Space Tradeoff for Sorting with Linear Queries 1982 18 TCS Berstel & Reutenauer, Recognizable Formal Power Series on Trees 1982 18 TCS Best, Adequacy Properties of Path Programs 1982 18 TCS Book, When is a Monoid a Group? The Church-Rosser Case is Tractable (Note) 1982 18 TCS Boussinot, Proposition de Semantique Denotationnelle pour des Resaux de Processus avec Operateur de Melange Equitable 1982 18 TCS Crochemore, Sharp Characterizations of Squarefree Morphisms (Note) 1982 18 TCS Culik & Harju, Dominoes over a Free Monoid 1982 18 TCS Ershov, Mixed Computation: Potential Applications and Problems for Study 1982 18 TCS Furer, The Complexity of Presburger Arithmetic with Bounded Quantifier Alternation Depth (Note) 1982 18 TCS Goldstine & Price & Wotschke, A Pushdown Automaton or a Context-Free Grammar--Which is More Economical? 1982 18 TCS Hagauer, On Form-Equivalence of Deterministic Pure Grammar Forms 1982 18 TCS Istrail, Generalization of the Ginsburg-Rice Schutzenberger Fixed-Point Theorem for Context-Sensitive and Recursive-Enumerable Languages (Note) 1982 18 TCS Leivant, Unprovability of Theorems of Complexity Theory in Weak Number Theories 1982 18 TCS Maruoka & Kimura, Strong Surjectivity is Equivalent to C-Injectivity 1982 18 TCS Meyer & Winklmann, Expressing Program Looping in Regular Dynamic Logic 1982 18 TCS Pair, Abstract Data Types and Algebraic Semantics of Programming Languages 1982 18 TCS Schnitger, A Family of Graphs with Expensive Depth-Reduction (Note) 1982 18 TCS Schoening, A Uniform Approach to Obtain Diagonal Sets in Complexity Classes (Note) 1982 18 TCS Sifakis, A Unified Approach for Studying the Properties of Transition Systems 1982 18 TCS Uchimura, Properties of Structure Generating Functions of Automata and Their Applications for Linear Systems 1982 17 TCS Andreka & Nemeti & Sain, A Complete Logic for Reasoning about Programs via Nonstandard Model Theory I 1982 17 TCS Andreka & Nemeti & Sain, A Complete Logic for Reasoning about Programs via Nonstandard Model Theory II 1982 17 TCS Bergstra & Tiuryn & Tucker, Floyd's Principle, Correctness Theories and Program Equivalence 1982 17 TCS Bergstra & Tucker, Some Natural Structures Which Fail to Possess a Sound and Decidable Hoare-Like Logic for Their While-Programs 1982 17 TCS Blattner & Ginsburg, Position-Restricted Grammar Forms and Grammars 1982 17 TCS Courcelle & Franchi-Zannettacci, Attribute Grammars and Recursive Program Schemes I 1982 17 TCS Courcelle & Franchi-Zannettacci, Attribute Grammars and Recursive Program Schemes II 1982 17 TCS Dershowitz, Orderings for Term-Rewriting Systems 1982 17 TCS Dutton & Brigham, The Complexity of a Multiprocessor Task Assignment Problem without Deadlines (Note) 1982 17 TCS Fellner, On Minimal Graphs (Note) 1982 17 TCS Gallier, Corrigendum: DPDA's in ``Atomic Normal Form'' and Applications to Equivalence Problems 1982 17 TCS Gurari & Ibarra, Some Simplified Undecidable and NP-Hard Problems for Simple Programs 1982 17 TCS Hartmanis, A Note on Natural Complete Sets and Goedel Numberings 1982 17 TCS Karpinski, Decidability of ``Skolem Matrix Emptiness Problem'' Entails Constructibility of Exact Regular Expression (Note) 1982 17 TCS Lehmann & Pasztor, Epis Need Not Be Dense 1982 17 TCS Nemeti, Every Free Algebra in the Variety Generated by the Representable Dynamic Algebras is Separable and Representable (Note) 1982 17 TCS Sadri & Ullman, The Theory of Functional and Template Dependencies 1982 17 TCS Shepherdson, Graph Theoretic Characterization of G-Schemes and TL-Schemes (Note) 1982 17 TCS Shyamasundar, On a Characterization of Pushdown Permuters (Note) 1982 17 TCS Squier & Wrathall, A Note on Representations of a Certain Monoid (Note) 1982 17 TCS Syslo, The Subgraph Isomorphism Problem for Outerplanar Graphs (Note) 1982 17 TCS Ukkonen, Structure Preserving Elimination of Null Productions from Context-Free Grammars 1982 17 TCS Welzl, Color-Families are Dense 1981 16 TCS Albert & Wegner, Languages with Homomorphic Replacements 1981 16 TCS Berman & Paterson, Propositional Dynamic Logic is Weaker without Tests (Note) 1981 16 TCS Book & O'Dunlaing, Testing for the Church-Rosser Property (Note) 1981 16 TCS Burkhard & Fredman & Kleitman, Inherent Complexity Trade-Offs for Range Query Problems 1981 16 TCS Carter & Fagin, A Note on the Existence of Continuous Functionals (Note) 1981 16 TCS Csirmaz, Programs and Program Verifications in a General Setting 1981 16 TCS Edelsbrunner & Maurer, A Space-Optimal Solution of General Region Location (Note) 1981 16 TCS Ehrenfeucht & Rozenberg, On the Subword Complexity of Square-Free D0L Languages 1981 16 TCS Galbiati & Fischer, On the Complexity of 2-Output Boolean Networks 1981 16 TCS Gupta & Lee & Leung & Pruitt & Wong, Record Allocation for Minimizing Seek Delay 1981 16 TCS Jantzen, On a Special Monoid with a Single Defining Relation 1981 16 TCS Kleijn & Rozenberg, Context-Free Like Restrictions on Selective Rewriting 1981 16 TCS Lam & Siu & Yu, A Generalized Counter Scheme 1981 16 TCS Lieberherr, Uniform Complexity and Digital Signatures (Note) 1981 16 TCS Main & Benson, Free Upper Regular Bands (Note) 1981 16 TCS Nguyen & Lassez, A Dual Problem to Least Fixed Points (Note) 1981 16 TCS Pecuchet, Sur la Determination du Rang d'une Equation dans le Monoide Libre (Note) 1981 16 TCS Pittl, On LLP(k) Grammars and Languages 1981 16 TCS Raiha & Ukkonen, The Shortest Common Supersequence Problem over Binary Alphabet is NP-Complete 1981 16 TCS Simon, On Tape-Bounded Probabilistic Turing Machine Acceptors 1981 16 TCS Takasu & Kawabata, A Logical Basis for Programming Methodology 1981 16 TCS Tao, On the Computational Power of Automata with Time or Space Bounded by Ackermann's or Superexponential Functions 1981 16 TCS Vazenin, Sur la Liaison entre Problemes Combinatoires et Algorithmiques 1981 16 TCS Weihrauch & Schreiber, Embedding Metric Spaces into CPO's 1981 15 TCS Alder & Strassen, On the Algorithmic Complexity of Associative Algebras 1981 15 TCS Araki & Kagimasa & Tokura, Relations of Flow Languages to Petri Net Languages 1981 15 TCS Benzaken & Foldes, Complexity of Graph Embeddability Problems (Note) 1981 15 TCS Book & Wrathall, Bounded Query Machines: On NP() and NPQUERY() 1981 15 TCS Book, Bounded Query Machines: On NP and PSPACE 1981 15 TCS Germano & Maggiolo-Schettini, Sequence Recursiveness without Cylindrification and Limited Register Machines 1981 15 TCS Heilbrunner, A Parsing Automata Approach to LR Theory 1981 15 TCS Hughes & Selkow, The Finite Power Property for Context-Free Languages (Note) 1981 15 TCS Katseff & Sipser, Several Results in Program Size Complexity 1981 15 TCS Landweber & Lipton & Robertson, On the Structure of Sets in NP and Other Complexity Classes 1981 15 TCS Lazard, Resolution des Systemes d'Equations Algebriques 1981 15 TCS Leggett & Moore, Optimization Problems and the Polynomial Hierarchy 1981 15 TCS Loui, A Space Bound for One-Tape Multidimensional Turing Machines (Note) 1981 15 TCS Paz & Moran, Non Deterministic Polynomial Optimization Problems and Their Approximations 1981 15 TCS Schmidt, Programs as Partial Graphs I: Flow Equivalence and Correctness 1981 15 TCS Schmidt, Programs as Partial Graphs II: Recursion 1981 15 TCS Statman, On the Existence of Closed Terms in the Typed lambda Calculus II: Transformations of Unification Problems (Note) 1981 15 TCS Thatcher & Wagner & Wright, More on Advice on Structuring Compilers and Proving Them Correct 1981 14 TCS Beauquier, Substitution of Semi-AFL's 1981 14 TCS Bucher & Maurer & Culik & Wotschke, Concise Description of Finite Languages 1981 14 TCS Bucher, A Note on a Problem in the Theory of Grammatical Complexity (Note) 1981 14 TCS Callegarin & Pacini, About the Implementability and the Power of Equationally Defined Data Abstractions 1981 14 TCS Galil, On the Theoretical Efficiency of Various Network Flow Algorithms 1981 14 TCS Gallier, DPDA's in `Atomic Normal Form' and Applications to Equivalence Problems 1981 14 TCS Gati, Some Elements of a Galois Theory of the Structure and Complexity of the Tree Automorphism Problem 1981 14 TCS Jantzen, The Power of Synchronizing Operations on Strings 1981 14 TCS Jensen, Coloured Petri Nets and the Invariant-Method 1981 14 TCS Kozen & Parikh, An Elementary Proof of the Completeness of PDL (Note) 1981 14 TCS Latteux, A Propos du Lemme de Substitution (Note) 1981 14 TCS Leiss, On Generalized Language Equations 1981 14 TCS Long, On gamma-Reducibility versus Polynomial Time Many-One Reducibility 1981 14 TCS Maruoka & Kimura & Shoji, Pattern Decomposition for Tessellation Automata 1981 14 TCS Moran, General Approximation Algorithms for Some Arithmetical Combinatorial Problems 1981 14 TCS Nishitani & Honda, The Firing Squad Synchronization Problem for Graphs 1981 14 TCS Plaisted, Erratum: Fast Verification, Testing, and Generation of Large Primes 1981 14 TCS Rosenthal, Optimal Algorithms for Sensitivity Analysis in Associative Mutliplication Problems 1981 14 TCS Rozenberg & Verraedt, On Pure, Terminal Invariant and Nonterminal Invariant Interpretations of E0L Forms 1981 14 TCS Schulte Monting, Merging of 4 or 5 Elements with n Elements 1981 14 TCS Stoklosa & Zakowski, Computations of (alpha,k)-Machines 1981 14 TCS Therien, Classification of Finite Monoids: The Language Approach 1981 13 TCS Engeler, Generalized Galois Theory and Its Applications to Complexity 1981 13 TCS Galil & Seiferas, Linear-Time String-Matching Using Only a Fixed Number of Local Storage Locations (Note) 1981 13 TCS Gallier, Nondeterministic Flowchart Programs with Recursive Procedures: Semantics and Correctness II 1981 13 TCS Gallier, Nondeterministic Flowchart Programs with Recursive Procedures: Semantics and Correctness I 1981 13 TCS Genrich & Lautenbach, System Modelling with High-Level Petri Nets 1981 13 TCS Goldfarb, The Undecidability of the Second-Order Unification Problem (Note) 1981 13 TCS Gurari & Ibarra, The Complexity of the Equivalence Problem for Two Characterizations of Presburger Sets 1981 13 TCS Harel, On the Total Correctness of Nondeterministic Programs 1981 13 TCS Leiss, Succinct Representation of Regular Languages by Boolean Automata (Note) 1981 13 TCS Lynch & Fischer, On Describing the Behavior and Implementation of Distributed Systems 1981 13 TCS Maggiolo-Schettini & Wedde & Winkowski, Modeling a Solution for a Control Problem in Distributed Systems by Restrictions 1981 13 TCS Meyer auf der Heide, A Comparison of Two Variations of a Pebble Game on Graphs (Note) 1981 13 TCS Nielsen & Plotkin & Winksel, Petri Nets, Event Structures and Domains, Part I 1981 13 TCS Pnueli, The Temporal Semantics of Concurrent Programs 1981 13 TCS Stoy, The Congruence of Two Programming Language Definitions 1981 13 TCS Straubing, A Generalization of the Schutzenberger Product of Finite Monoids 1981 13 TCS Thomas, Remark on the Star-Height-Problem (Note) 1981 13 TCS Wadge, An Extensional Treatment of Dataflow Deadlock 1980 12 TCS Angluin, On Counting Problems and the Polynomial-Time Hierarchy 1980 12 TCS Ausiello & Marchetti-Spaccamela & Protasi, Toward a Unified Approach for the Classification of NP-Complete Optimization Problems 1980 12 TCS Beatty, Two Iteration Theorems for the LL(k) Languages 1980 12 TCS Boe & de Luca & Restivo, Minimal Complete Sets of Words (Note) 1980 12 TCS Cousineau, An Algebraic Definition for Control Structures 1980 12 TCS Dobkin & Munro, Determining the Mode 1980 12 TCS Ehrenfeucht & Rozenberg, On a Bound for the D0L Sequence Equivalence Problem (Note) 1980 12 TCS Ehrenfeucht & Rozenberg, On Ambiguity in E0L Systems 1980 12 TCS Gill & Hunt & Simon, Deterministic Simulation of Tape-Bounded Probabilistic Turing Machine Transducers (Note) 1980 12 TCS Grant, Some More Independence Results in Complexity Theory 1980 12 TCS Harel, Proving the Correctness of Regular Deterministic Programs: A Unifying Survey Using Dynamic Logic 1980 12 TCS Jaffe, Efficient Scheduling of Tasks without Full Use of Processor Resources 1980 12 TCS Joshi & Levy & Yueh, Local Constraints in Programming Languages--Part I: Syntax 1980 12 TCS Maurer & Salomaa & Wood, Synchronized E0L Forms 1980 12 TCS Mignotte, Test de Primalite 1980 12 TCS Monier, Evaluation and Comparison of Two Efficient Probabilistic Primality Testing Algorithms 1980 12 TCS Munro & Paterson, Selection and Sorting with Limited Storage 1980 12 TCS Oppen, Complexity, Convexity and Combinations of Theories 1980 12 TCS Saheb-Djahromi, CPO's of Measures for Nondeterminism 1980 12 TCS Tiuryn, Unique Fixed Points vs. Least Fixed Points 1980 12 TCS Valiant, Negation Can Be Exponentially Powerful 1980 12 TCS Winkowski, Behaviours of Concurrent Systems 1980 11 TCS , Introduction: On Space, Time and Alternation 1980 11 TCS Arnold & Nivat, Metric Interpretations of Infinite Trees and Semantics of Non Deterministic Recursive Programs 1980 11 TCS Ben-Ari, Comments on ``Tautology Testing with a Generalized Matrix Reduction Method'' (Note) 1980 11 TCS Bergstra & Klop, Invertible Terms in the Lambda Calculus 1980 11 TCS Berman, The Complexity of Logical Theories 1980 11 TCS Beynon, On the Structure of Free Finite State Machines 1980 11 TCS Blum & Mehlhorn, On the Average Number of Rebalancing Operations in Weight-Balanced Trees 1980 11 TCS Borger & Kleine Buning, The Reachability Problem for Petri Nets and Decision Problems for Skolem Arithmetic 1980 11 TCS Bougaut, Algorithme Explicite pour la Recherche du P. G. C. D. dans Certains Anneaux Principaux d'Entiers de Corps de Nombres 1980 11 TCS Bruss & Meyer, On Time-Space Classes and Their Relation to the Theory of Real Addition 1980 11 TCS Dobkin & Reiss, The Complexity of Linear Programming 1980 11 TCS Ehrig & Rosen, Parallelism and Concurrency of Graph Manipulations 1980 11 TCS Harary, Graph Theoretic Models (Invited Address) 1980 11 TCS Heintz & Sieveking, Lower Bounds for Polynomials with Algebraic Coefficients 1980 11 TCS Hennessy & Ashcroft, A Mathematical Semantics for a Nondeterministic Typed lambda-Calculus 1980 11 TCS Hotz, Eine Neue Invariante fur Kontextfreie Sprachen 1980 11 TCS Kozen, Indexings of Subrecursive Classes 1980 11 TCS Kucera & Nesetril & Pultr, Complexity of Dimension Three and Some Related Edge-Covering Characteristics of Graphs 1980 11 TCS Morisaki & Sakai, A Complete Axiom System for Rational Sets with Mutliplicity 1980 11 TCS Netto, There are Infinitely Many Complete Prefix Codes of Constant Length l (l >= 3) (Note) 1980 11 TCS Pippenger, On Another Boolean Matrix 1980 11 TCS Rosenberg & Snyder & Stockmeyer, Uniform Data Encodings 1980 11 TCS Staples, Speeding Up Subtree Replacement Systems 1980 11 TCS Vauquelin & Franchi-Zannettacci, Automates a File (Note) 1980 11 TCS von zur Gathen & Strassen, Some Polynomials That are Hard to Compute (Note) 1980 10 TCS Biskup, Inferences of Multivalued Dependencies in Fixed and Undetermined Universes 1980 10 TCS Brzozowski & Leiss, On Equations for Regular Languages, Finite Automata, and Sequential Networks 1980 10 TCS Cohen & Gold, On the Complexity of omega-Type Turing Acceptors 1980 10 TCS de Luca & Restivo, On Some Properties of Very Pure Codes 1980 10 TCS Ehrenfeucht & Rozenberg, Every Two Equivalent D0L Systems Have a Regular True Envelope 1980 10 TCS Fortune & Hopcroft & Wyllie, The Directed Subgraph Homeomorphism Problem 1980 10 TCS Hartmann & Schuster, Mutliplicative Complexity of Some Rational Functions 1980 10 TCS Havel, On Branching and Looping, Part II 1980 10 TCS Havel, On Branching and Looping, Part I 1980 10 TCS King, Iteration Theorems for Families of Strict Deterministic Languages 1980 10 TCS Kozen, Complexity of Boolean Algebras 1980 10 TCS Kurka, Applicability of a Production in a Categorical Grammar 1980 10 TCS Lieberherr, P-Optimal Heuristics 1980 10 TCS Prodinger, On the Interpolation of D0L-Sequences (Note) 1980 10 TCS Schnorr & Van de Wiele, On the Additive Complexity of Polynomials 1980 10 TCS Schnorr, A 3n-Lower Bound on the Network Complexity of Boolean Functions 1980 10 TCS Sipser, Halting Space-Bounded Computations (Note) 1980 10 TCS Staples, Computation on Graph-Like Expressions 1980 10 TCS Staples, Optimal Evaluations of Graph-Like Expressions 1980 10 TCS Wiedmer, Computing with Infinite Objects 1980 10 TCS Zaks, Lexicographic Generation of Ordered Trees 1979 9 TCS Ashcroft & Fich, A Generalized Setting for Fixpoint Theory 1979 9 TCS Aubin, Mechanizing Structural Induction Part II: Strategies 1979 9 TCS Aubin, Mechanizing Structural Induction Part I: Formal System 1979 9 TCS Bergstra & Klop, Church-Rosser Strategies in the Lambda Calculus 1979 9 TCS Bloom & Tindell, Algebraic and Graph Theoretic Characterizations of Structured Flowchart Schemes 1979 9 TCS Christol, Ensembles Presque Periodiques k-Reconnaissables (Note) 1979 9 TCS Duval, Periodes et Repetitions des Mots du Monoide Libre 1979 9 TCS Flajolet & Raoult & Vuillemin, The Number of Registers Required for Evaluating Arithmetic Expressions 1979 9 TCS Guessarian, Program Transformations and Algebraic Semantics 1979 9 TCS Harrison & Havel & Yehudai, On Equivalence of Grammars through Transformation Trees 1979 9 TCS Inoue & Takanami & Nakamura & Ae, One-Way Simple Multihead Finite Automata 1979 9 TCS Karhumaki, On Commutative DT0L Systems 1979 9 TCS Nijholt, Simple Chain Grammars and Languages 1979 9 TCS Perrin, La Representation Ergodique d'un Automate Fini 1979 9 TCS Plaisted, Fast Verification, Testing, and Generation of Large Primes 1979 9 TCS Reutenauer, Sur les Series Associees a Certains Systemes de Lindenmayer 1979 9 TCS Rodriguez, Familles de Langages Fermee par Crochet Ouvert 1979 9 TCS Ruohonen, On Some Decidability Problems for HD0L Systems with Nonsingular Parikh Matrices 1979 9 TCS Statman, Intuitionistic Propositional Logic is Polynomial-Space Complete 1979 9 TCS Statman, The Typed lambda-Calculus is Not Elementary Recursive 1979 9 TCS Tang, Chain Properties in P_omega 1979 9 TCS Wechsung & Brandstadt, A Relation between Space, Return and Dual Return Complexities 1979 9 TCS Wegener, A Counterexample to a Conjecture of Schnorr Referring to Monotone Networks (Note) 1979 9 TCS Wegener, Switching Functions Whose Monotone Complexity is Nearly Quadratic 1979 8 TCS Apt & Bergstra & Meertens, Recursive Assertions Are Not Enough--Or Are They? 1979 8 TCS Arnold & Latteux, A New Proof of Two Theorems about Rational Transductions (Note) 1979 8 TCS Autebert, Une Note sur le Cylindre des Langages Deterministes (Note) 1979 8 TCS Baker & Selman, A Second Step Toward the Polynomial Hierarchy 1979 8 TCS Beauquier, Generateurs Algebriques et Systemes de Paires Iterantes 1979 8 TCS Bibel, Tautology Testing with a Generalized Matrix Reduction Method 1979 8 TCS Bohm & Dezani-Ciancaglini & Peretti & Ronchi Della Rocca, A Discrimination Algorithm inside lambda-beta-Calculus 1979 8 TCS Dolev, Commutation Properties and Generating Sets Characterize Slices of Various Synchronization Primitives 1979 8 TCS Elgot & Shepherdson, A Semantically Meaningful Characterization of Reducible Flowchart Schemes 1979 8 TCS Hajek, Arithmetical Hierarchy and Complexity of Computation 1979 8 TCS Hartmanis, Relations between Diagonalization, Proof Systems, and Complexity Gaps 1979 8 TCS Hashigushi, A Decision Procedure for the Order of Regular Events (Note) 1979 8 TCS Hindley, The Discrimination Theorem Holds for Combinatory Weak Reduction (Note) 1979 8 TCS Hopcroft & Pansiot, On the Reachability Problem for 5-Dimensional Vector Addition Systems 1979 8 TCS Johansen, The Generating Function of the Number of Subpatterns of a D0L Sequence 1979 8 TCS Majster, Data Types, Abstract Data Types and Their Specification Problem 1979 8 TCS Morgenstern, Une Extension du Theoreme de Winograd (Note) 1979 8 TCS Preparata & Muller, Finding the Intersection of n Half-Spaces in Time O(n log n) 1979 8 TCS Prodinger & Urbanek, Language Operators Related to Init 1979 8 TCS Pudlak & Springsteel, Complexity in Mechanized Hypothesis Formation 1979 8 TCS Soisalon-Soininen, On the Covering Problem for Left-Recursive Grammars 1979 8 TCS Valiant, The Complexity of Computing the Permanent 1979 8 TCS Wand, Fixed-Point Constructions in Order-Enriched Categories 1979 8 TCS Winograd, On Mutliplication in Algebraic Extension Fields 1978 7 TCS Book & Wrathall, On Languages Specified by Relative Acceptance 1978 7 TCS Courcelle, A Representation of Trees by Languages II 1978 7 TCS de Groote, On Varieties of Optimal Algorithms for the Computation of Bilinear Mappings III. Optimal Algorithms for the Computation of xy and yx, where x, y \in M_2(K) 1978 7 TCS de Groote, On Varieties of Optimal Algorithms for the Computation of Bilinear Mappings I. The Isotropy Group of a Bilinear Mapping 1978 7 TCS de Groote, On varieties of Optimal Algorithms for the Computation of Bilinear Mappings II. Optimal Algorithms for 2x2-Matrix Mutliplication 1978 7 TCS Ehrenfeucht & Rozenberg, Elementary Homomorphisms and a Solution of the D0L Sequence Equivalence Problem 1978 7 TCS Friedman, A Note on Non-Singular Deterministic Pushdown Automata 1978 7 TCS Greibach, Remarks on Blind and Partially Blind One-Way Multicounter Machines 1978 7 TCS Hartmanis, On Log-Tape Isomorphisms of Complete Sets 1978 7 TCS Ibarra, On Two-Way Sequential Transductions of Full Semi-AFL's 1978 7 TCS Kleiman & Pippenger, An Explicit Construction of Short Monotone Formulae for the Monotone Symmetric Functions 1978 7 TCS Kobayashi, On the Minimal Firing Time of the Firing Squad Synchronization Problem for Polyautomata Networks 1978 7 TCS Mignotte, Intersection des Images de Certaines Suites Recurrentes Lineaires 1978 7 TCS Muller & Preparata, Finding the Intersection of Two Convex Polyhedra 1978 7 TCS Perrot, Varietes de Langages et Operations 1978 7 TCS Pin, Sur le Monoide Syntactique de L* lorsque L est un Langage Fini 1978 7 TCS Schnorr, Improved Lower Bounds on the Number of Mutliplications/Divisions Which are Necessary to Evaluate Polynomials 1978 7 TCS Skyum, On Good ET0L Forms 1978 7 TCS van Emde Boas, Some Applications of the McCreight-Meyer Algorithm in Abstract Complexity Theory 1978 7 TCS Verbeek & Weihrauch, Data Representation and Computational Complexity 1978 7 TCS Wright & Wagner & Thatcher, A Uniform Approach to Inductive Posets and Inductive Closure 1978 6 TCS Abelson, Corrigendum: Towards a Theory of Local and Global in Computation 1978 6 TCS Abelson, Towards a Theory of Local and Global in Computation 1978 6 TCS Bennison & Soare, Some Lowness Properties and Computational Complexity Sequences 1978 6 TCS Bollman & Laplaza, Some Decision Problems for Polynomial Mappings 1978 6 TCS Cohen & Gold, omega-Computations on Turing Machines 1978 6 TCS Courcelle, A Representation of Trees by Languages I 1978 6 TCS Culik & Maurer & Ottmann & Ruohonen & Salomaa, Isomorphism, Form Equivalence and Sequence Equivalence of PD0L Forms 1978 6 TCS Culik & Maurer & Ottmann, On Two-Symbol Complete E0L Forms 1978 6 TCS Ehrenfeucht & Rozenberg, E0L Languages are not Codings of FP0L Languages 1978 6 TCS Greibach, One Way Finite Visit Automata 1978 6 TCS Johnson & Preparata, The Densest Hemisphere Problem 1978 6 TCS Knuth & Schoenhage, The Expected Linearity of a Simple Equivalence Algorithm 1978 6 TCS Lynch, Log Space Machines with Mutliple Oracle Tapes 1978 6 TCS Manna & Shamir, The Convergence of Functions to Fixedpoints of Recursive Definitions 1978 6 TCS Rackoff, The Covering and Boundedness Problems for Vector Addition Systems 1977 5 TCS Aiello & Aiello & Weyhrauch, PASCAL in LCF: Semantics and Examples of Proof 1977 5 TCS Atkinson, The Complexity of Group Algebra Computations 1977 5 TCS Burkhard, Non-Uniform Partial-Match File Designs 1977 5 TCS Choffrut, Une Caracterisation des Fonctions Sequentielles et des Fonctions Sous-Sequentielles en tant que Relations Rationnelles 1977 5 TCS Chottin Etude Syntaxique de Certains Langages Solutions d'Equations avec Operateurs 1977 5 TCS Cremers & Hibbard, On the Formal Definition of Dependencies between the Control and Information Structure of a Data Space 1977 5 TCS Elgot & Snyder, On the Many Facets of Lists 1977 5 TCS Engelfriet, Iterating Iterated Substitution 1977 5 TCS Galil & Megiddo, Cyclic Ordering is NP-Complete 1977 5 TCS Ginsburg & Spanier, Pushdown Acceptor Forms 1977 5 TCS Jacob, Un Algorithme Calculant le Cardinal, Fini ou Infini, des Demi-Groupes de Matrices 1977 5 TCS Karhumaki, Remarks on Commutative N-Rational Series 1977 5 TCS Kwong, On Reduction of Asynchronous Systems 1977 5 TCS Latteux, Produit dans le Cone Rationnel Engendre par D_1* 1977 5 TCS Luckhardt, A Fundamental Effect in Computations on Real Numbers 1977 5 TCS Mandel & Simon, On Finite Semigroups of Matrices 1977 5 TCS Plotkin, LCF Considered as a Programming Language 1977 5 TCS Reutenauer, On a Question of S. Eilenberg (Note) 1977 5 TCS Rozenberg & Penttonen & Salomaa, Bibliography of L Systems 1977 5 TCS Smyth, Effectively Given Domains 1977 4 TCS Araki & Kasami, Decidable Problems on the Strong Connectivity of Petri Net Reachability Sets 1977 4 TCS Daley, On the Inference of Optimal Descriptions 1977 4 TCS Even & Tarjan, Corrigendum: Computing an st-Numbering 1977 4 TCS Ferrante & Geiser, An Efficient Procedure for the Theory of Rational Order (Note) 1977 4 TCS Francon, On the Analysis of Algorithms for Trees 1977 4 TCS Galil, On the Complexity of Regular Resolution and the Davis-Putnam Procedure 1977 4 TCS Geller & Harrison, On LR(k) Grammars and Languages 1977 4 TCS Geller & Hunt & Szymanski & Ullman, Economy of Description by Parsers, DPDA's and PDA's 1977 4 TCS Hosono & Sato, The Retracts in P_omega Do Not Form a Continuous Lattice--A Solution to Scott's Problem 1977 4 TCS Jones & Landweber & Lien, Complexity of Some Problems in Petri Nets 1977 4 TCS Lehmann, A Note on Schnorr's Separatedness (Note) 1977 4 TCS Lehmann, Algebraic Structures for Transitive Closure 1977 4 TCS Linna, A Decidability Result for Deterministic omega-Context-Free Languages 1977 4 TCS Markowsky, Categories of Chain-Complete Posets 1977 4 TCS Maurer & Ottmann & Salomaa, On the Form Equivalence of L-Forms 1977 4 TCS Milner, Fully Abstract Models of Typed lambda-Calculi 1977 4 TCS Olshansky & Pnueli, A Direct Algorithm for Checking Equivalence of LL(k) Grammars 1977 4 TCS Papadimitriou, The Euclidean Traveling Salesman Problem is NP-Complete 1977 4 TCS Schutzenberger, Sur une Variante des Fonctions Sequentielles 1977 4 TCS Stork, On the Paging-Complexity of Periodic Arrangements 1977 4 TCS Vuillemin, Comment Verifier l'Associativite d'un Table de Groupe 1976 3 TCS Araki & Kasami, Some Decision Problems Related to the Reachability Problem for Petri Nets 1976 3 TCS Barendregt, A Global Representation of the Recursive Functions in the lambda-Calculus 1976 3 TCS Beeri, An Improvement on Valiant's Decision Procedure for Equivalence of Deterministic Finite Turn Pushdown Machines 1976 3 TCS Chandra & Hirschberg & Wong, Approximate Algorithms for Some Generalized Knapsack Problems 1976 3 TCS Culik, On the Decidability of the Sequence Equivalence Problem for D0L-Systems 1976 3 TCS Hartmanis & Berman, On Tape Bounds for Single Letter Alphabet Language Processing 1976 3 TCS Hotz, Schranken fur Balanced Trees bei Ausgewogenen Verteilungen 1976 3 TCS Jensen & Pietrzykowski, Mechanizing omega-Order Type Theory Through Unification 1976 3 TCS Jones & Laaser, Complete Problems for Deterministic Polynomial Time 1976 3 TCS Knuth & Trabb Pardo, Analysis of a Simple Factorization Algorithm 1976 3 TCS Lallement, Regular Semigroups with D = R as Syntactic Monoids of Prefix Codes 1976 3 TCS Lipski, Information Storage and Retrieval--Mathematical Foundations II (Combinatorial Problems) 1976 3 TCS Lipton & Dobkin, Complexity Measures and Hierarchies for the Evaluation of Integers and Polynomials 1976 3 TCS Monien, A Recursive and a Grammatical Characterization of the Exponential-Time Languages 1976 3 TCS Park, Finiteness is Mu-Ineffable 1976 3 TCS Preparata, Corrigendum: A Fast Stable Sorting Algorithm with Absolutely Minimum Storage 1976 3 TCS Rivest & Vuillemin, On Recognizing Graph Properties from Adjacency Matrices 1976 3 TCS Ruohonen, Zeros of Z-Rational Functions and D0L Equivalence 1976 3 TCS Schoenhage, An Elementary Proof for Strassen's Degree Bound 1976 3 TCS Schutzenberger, Sur les Relations Rationnelles entre Monoides Libres 1976 3 TCS Starke, Analyse und Synthese von Asynchronen ND-Automaten 1976 3 TCS Stockmeyer, The Polynomial-Time Hierarchy 1976 3 TCS Szymanski, Concerning Bounded-Right-Context Grammars 1976 3 TCS Wise, A Strong Pumping Lemma for Context-Free Languages 1976 3 TCS Wrathall, Complete Sets and the Polynomial-Time Hierarchy 1976 2 TCS Boasson, Langages Algebriques, Paires Iterantes et Transductions Rationnelles 1976 2 TCS Chaitin, Information-Theoretic Characterizations of Recursive Infinite Strings 1976 2 TCS De Bakker, Least Fixed Points Revisited 1976 2 TCS Dezani-Ciancaglini, Characterization of Normal Forms Possessing Inverse in the lambda-beta-eta-Calculus 1976 2 TCS Egli & Constable, Computability Concepts for Programming Language Semantics 1976 2 TCS Engelfriet, Surface Tree Languages and Parallel Derivation Trees 1976 2 TCS Even & Tarjan, Computing an st-Numbering 1976 2 TCS Ginsburg & Goldstine & Greibach, Some Uniformly Erasable Families of Languages 1976 2 TCS Hack, The Equality Problem for Vector Addition Systems is Undecidable 1976 2 TCS Herman & Walker, On the Stability of Some Biological Schemes with Cellular Interactions 1976 2 TCS Hunt & Rosenkrantz & Szymanski, The Covering Problem for Linear Context-Free Grammars 1976 2 TCS Ibarra & Sahni & Kim, Finite Automata with Mutliplication 1976 2 TCS Levy, An Algebraic Interpretation of the lambda beta kappa-Calculus; and an Application of a Labelled lambda-Calculus 1976 2 TCS Machtey, Minimal Pairs of Polynomial Degrees with Subexponential Complexity 1976 2 TCS Meznik, On Some Subclasses of the Class of Generable Languages 1976 2 TCS Minicozzi, Some Natural Properties of Strong-Identification in Inductive Inference 1976 2 TCS Paterson & Valiant, Circuit Size is Nonlinear in Depth (Note) 1976 2 TCS Paul, Realizing Boolean Functions on Disjoint Sets of Variables 1976 2 TCS Rosen, Correctness of Parallel Programs: The Church-Rosser Approach 1976 2 TCS Schnorr, A Lower Bound on the Number of Additions in Monotone Computations 1976 2 TCS Seiferas & McNaughton, Regularity-Preserving Relations 1976 2 TCS Soittola, Positive Rational Sequences 1976 2 TCS Springsteel, On the Pre-AFL of [log n] Space and Related Families of Languages 1976 2 TCS Trakhtenbrot, Relationships between Classes of Monotonic Functions 1976 2 TCS Vilfan, Lower Bounds for the Size of Expressions for Certain Functions in d-ary Logic 1976 2 TCS Vitanyi, Deterministic Lindenmayer Languages, Nonterminals and Homomorphisms 1976 1 TCS Book, Translational Lemmas, Polynomial Time, and (log n)^j-Space 1976 1 TCS Ehrenfeucht & Rozenberg & Skyum, A Relationship between ET0L and EDT0L Languages 1976 1 TCS Fredman, How Good is the Information Theory Bound in Sorting? 1976 1 TCS Friedman, The Inclusion Problem for Simple Languages 1976 1 TCS Garey & Johnson & Stockmeyer, Some Simplified NP-Complete Graph Problems 1976 1 TCS Greibach, Remarks on the Complexity of Nondeterministic Counter Languages 1976 1 TCS Karhumaki, Two Theorems Concerning Recognizable N-Subsets of sigma* 1976 1 TCS Marek & Pawlak, Information Storage and Retrieval Systems: Mathematical Foundations 1976 1 TCS Mignotte, Algorithmes Relatifs a la Decomposition des Polynomes 1976 1 TCS Moll, An Operator Embedding Theorem for Complexity Classes of Recursive Functions 1976 1 TCS Schnorr, The Combinational Complexity of Equivalence 1976 1 TCS van Leeuwen & Wood, A Decomposition Theorem for Hyper-Algebraic Extensions of Language Families 1975 1 TCS Ehrenfeucht & Lee & Rozenberg, Subword Complexities of Various Classes of Deterministic Developmental Languages without Interactions 1975 1 TCS Harper & Hsieh & Savage, A Class of Boolean Functions with Linear Combinational Complexity 1975 1 TCS Huet, A Unification Algorithm for Typed lambda-Calculus 1975 1 TCS Ladner & Lynch & Selman, A Comparison of Polynomial Time Reducibilities 1975 1 TCS Paterson, Complexity of Monotone Networks for Boolean Matrix Product 1975 1 TCS Plotkin, Call-by-Name, Call-by-Value and the lambda-Calculus 1975 1 TCS Preparata, A Fast Stable Sorting Algorithm with Absolutely Minimum Storage 1975 1 TCS Reedy & Savitch, The Turing Degree of the Inherent Ambiguity Problem for Context-Free Languages 1975 1 TCS Restivo, A Combinatorial Property of Codes Having Finite Synchronization Delay 1975 1 TCS Schoenhage, A Lower Bound for the Length of Addition Chains 1975 1 TCS Strassen, Die Berechnungskomplexitat der Symbolischen Differentiation von Interpolationspolynomen 1997 100 TECHREV Strauss, Kosher Sound 1996 99 TECHREV Technology Review, The Web Maestro: An Interview with Tim Berners-Lee 1996 99 TECHREV Horgan, The Twilight of Science 1995 98 TECHREV Denning, The Case for ``Clipper'' 1995 98 TECHREV McClellan, Desktop Counterfeiting 1994 97 TECHREV Steinberg, Travels on the Net 1994 97 TECHREV Resnick, Changing the Centralized Mind 1992 95 TECHREV Haavind, Software's New Object Lesson 1992 95 TECHREV Brody, Machine Dreams: An Interview with Nicholas Negroponte 1991 94 TECHREV McCutchen, Peer Review: Treacherous Servant, Disastrous Master 1991 94 TECHREV Horning, Language Busters 1991 94 TECHREV Garfinkel, Programs to the People 1991 94 TECHREV Dertouzos, Building the Information Marketplace 1991 94 TECHREV Rosenberg, Debunking Computer Literacy 1987 90 TECHREV Allman, Designing Computers That Think the Way We Do 1986 TECHREV Athanasiou, Encryption: Technology, Privacy, and National Security 1977 TECHREV Cowen, New Cryptography to Protect Computer Data 1990 TELEG Berry, Scientists Use Light Particles to Perfect the Secret Code 1994 TEXTR Crescenzi & Kann, A Compendium of NP Optimization Problems (/pub/crescenzi/compendium.ps.Z at encore.dsi.uniroma1.it, or Theory/Viggo-Kann/compendium.ps.Z at nada.kth.se) 1991 TEXTR Greenlaw & Hoover & Ruzzo, A Compendium of Problems Complete for P (tr91-11.dvi) 1991 TEXTR van der Laan, Review: Michael Doob's A Gentle ... 1990 TEXTR Doob, A Gentle Introduction to TeX 1967 THGRAPHS Lempel & Even & Cederbaum, An Algorithm for Planarity Testing of Graphs 1957 THSWITCH Moore, The Shortest Path Through a Maze 1997 E80 TIEICE Xu & Inoue & Wang & Ito, On Multi-Inkdot Two-Way Alternating Turing Machines and Pushdown Automata with Sublogarithmic Space and Constant Leaf-Size 1997 E80 TIEICE Sung & Nishino, The Complexity of Threshold Circuits for Parity Functions 1997 E80 TIEICE Aoki & Ohta, Strict Evaluation of the Maximum Average of Differential Probability and the Maximum Average of Linear Probability 1997 E80 TIEICE Moriai & Aoki & Ohta, Key-Dependency of Linear Probability of RC5 1997 E80 TIEICE Sakurai & Zheng, On Non-Pseudorandomness from Block Ciphers with Provable Immunity Against Linear Cryptanalysis 1997 E80 TIEICE Kuwakado & Koyama, Improved Elliptic Curve Methods for Factoring and Their Performance 1997 E80 TIEICE Tsuruoka & Koyama, Fast Exponentiation Algorithms Based on Batch-Processing and Precomputation 1997 E80 TIEICE Satoh & Araki, On Construction of Signature Scheme over a Certain Non-Commutative Ring 1997 E80 TIEICE Laih & Kuo, New Signature Schemes Based on Factoring and Discrete Logarithms 1997 E80 TIEICE Mambo & Okamoto, Proxy Cryptosystems: Delegation of the Power to Decrypt Ciphertexts 1997 E80 TIEICE Juang & Lei, A Secure and Practical Electronic Voting Scheme for Real World Environments 1997 E80 TIEICE Kurosawa & Katayama & Ogata, Reshufflable and Laziness Tolerant Mental Card Game Protocol 1997 E80 TIEICE Satoh & Kurosawa, Information Theoretic Approach to Privacy for Multi-Party Protocols 1997 E80 TIEICE Okada & Ogata & Sakano & Kurosawa, Analysis on Secret Sharing Schemes with Non-Graphical Access Structures 1997 E80 TIEICE Itoh, On the Oracle Entropy and the Average Case Oracle Measure of Knowledge Complexity 1997 E80 TIEICE Mori & Itoh, On the Power of Self-Testers and Self-Correctors 1997 E80 TIEICE Kurosawa & Satoh, Attack on Yagisawa Cryptosystme 1997 E80 TIEICE Tayu & Ueno, Efficient Embeddings of Binary Trees with Bounded Proper Pathwidth into Paths and Grids 1997 E80 TIEICE Ohguro, The Closure Class of MIN Sigma_0 Is NPO-PB 1996 E79 TIEICE Wang & Inoue & Ito, On Simple One-Way Multihead Pushdown Automata 1996 E79 TIEICE Akutsu, Protein Structure Alignment Using Dynamic Programming and Iterative Improvement 1996 E79 TIEICE Kaneko & Miyauchi, A Systematic Design of Fault Tolerant Systolic Arrays Based on Triple Modular Redundancy in Time-Processor Space 1996 E79 TIEICE Yamamoto, On the Power of Reversals Over the Input Tape of Off-Line Turing Machines 1996 E79 TIEICE Tanida & Yokomori, Inductive Inference of Monogenic Pure Context-Free Languages 1996 E79 TIEICE Takagi, A Hardware Algorithm for Modular Division Based on the Extended Euclidean Algorithm 1996 E79 TIEICE Wang & Inoue & Ito & Okazaki, Sensing Two-Way Three Heads are Better than Two 1996 E79 TIEICE Kamiura & Hata & Yamato, Design and Fault Masking of Two-Level Cellular Arrays on Multiple-Valued Logic 1996 E79 TIEICE Akutsu, Approximate String Matching with Variable Length Don't Care Characters 1996 E79 TIEICE Tanaka & Nishino, A Relationship between the Number of Negations and the Circuit Size 1996 E79 TIEICE Tanaka & Masuda, Two Dimensional Largest Common Subpatterns between Pictures 1996 E79 TIEICE Kurihara & Sakata & Kobayashi, On a Class of Byte-Error-Correcting Codes from Algebraic Curves and Their Fast Decoding Algorithm 1996 E79 TIEICE Mambo & Usuda & Okamoto, Proxy Signatures: Delegation of the Power to Sign Messages 1996 E79 TIEICE Kiyohara & Kawabata, A Note on Lempel-Ziv-Yokoo Algorithm 1996 E79 TIEICE Watanabe & Tamura & Sengoku, The Problem of where to Locate p-Sinks in a Flow Network: Complexity Approach 1996 E79 TIEICE Hwang & Chang & Yang, Two Efficient Server-Aided RSA Secret Computation Protocols Against Active Attacks 1996 E79 TIEICE Akl & Chen, Efficient Parallel Algorithms on Proper Circular Arc Graphs 1996 E79 TIEICE Lu & Yuasa, Time-Optimal 2D Convolution on Mesh-Connected SIMD Computers with Bounded Number of PEs 1996 E79 TIEICE Takesue, Algorithm Transformation for Cube-Type Networks 1996 E79 TIEICE Iwasaki & Furuta, Mesh Spiral and Mesh Random Networks 1996 E79 TIEICE Horng, Generalized Mesh-Connected Computers with Hyperbus Broadcasting for a Computer Network 1996 E79 TIEICE Ravindran & Stumm, A Comparison of Blocking and Non-blocking Packet Switching Techniques in Hierarchical Ring Networks 1996 E79 TIEICE Shigei & Miyajima & Ishizaka, On Methods for Reconfiguring Processor Arrays 1996 E79 TIEICE Hardjono & Seberry, Security Issues in Mobile Information Networks 1996 E79 TIEICE Watanabe & Fujiwara & Kasami, An Improved Method for Formal Verification of Cryptographic Protocols 1996 E79 TIEICE Yamasaki, Note on Inclusion Properties of Subclasses of Context-Free Tree Language 1996 E79 TIEICE Higuchi & Wakatsuki & Tomita, Some Properties of Deterministic Restricted One-Counter Automata 1996 E79 TIEICE Chung & Lee & Eum, An O(|E|) Hypercube Recognition Algorithm 1996 E79 TIEICE Yokoo & Takahashi, Data Compression by Context Sorting 1996 E79 TIEICE Tanaka, Information Geometry of Mean Field Theory 1996 E79 TIEICE Mihara, On the Complexity of Finding Cycles in Periodic Functions Using the Quantum Turing Machine 1996 E79 TIEICE Xu & Inoue & Wang & Ito, A Note on Alternating Pushdown Automata with Sublogarithmic Space 1996 E79 TIEICE Tani & Hamaguchi & Yajima, The Complexity of the Optimal Variable Ordering Problems of a Shared Binary Decision Diagram 1996 E79 TIEICE Gu & Peng, Set-To-Set Fault Tolerant Routing in Star Graphs 1996 E79 TIEICE Takesue, A Unified Method of Mutual Exclusion in Parallel and Distributed Systems 1996 E79 TIEICE Mihara, Are Measurements Effective on Quantum Computation? 1996 E79 TIEICE Liu & Tanaka, Efficient Algorithms for Finding Largest Similar Substructures in Unordered Trees 1996 E79 TIEICE Tanaka, Metrics between Trees Embedded in a Plane and Their Computing Methods 1996 E79 TIEICE Funabiki & Nishikawa, Comparisons of Energy-Descent Optimization Algorithms for Maximum Clique Problems 1996 E79 TIEICE Miwa & Ito, Complexity and Algorithm for Reallocation Problem 1996 E79 TIEICE Matsubayashi & Ueno, On the Complexity of Embedding of Graphs into Grids with Minimum Congestion 1996 E79 TIEICE Hamada & Bao & Mei & Igarashi, Nonadaptive Fault Tolerant File Transmission in Rotator Graphs 1996 E79 TIEICE Gu & Okawa & Peng, Set-To-Set Fault Tolerant Routing in Hypercubes 1996 E79 TIEICE Peralta & Okamoto, Faster Factoring of Integers of a Special Form 1996 E79 TIEICE Fujii & Kachen & Kurosawa, Combinatorial Bounds and Design of Broadcast Authentication 1996 E79 TIEICE Sako, Generating Statistical Information in Anonymous Surveys 1996 E79 TIEICE Tsukiji, Some Lower Bounds of Cyclic Shift on Boolean Circuits 1996 E79 TIEICE Onishi & Takayama, Construction of Voronoi Diagram on the Upper Half-Plane 1996 E79 TIEICE Atsumi & Masuyama, An Efficient Parallel Parsing Algorithm for Context-Free Languages Based on Earley's Method 1996 E79 TIEICE Togawa & Sato & Ohtsuki, A Simultaneous Technology Mapping, Placement, and Global Routing Algorithm for FPGAs with Path Delay Constraints 1996 E79 TIEICE Yamauchi & Ishiura & Takahashi, Implicit Representation and Manipulation of Binary Decision Diagrams 1996 E79 TIEICE Bao & Igarashi & Yu, Some Results on Decomposability of Weakly Invertible Finite Automata 1996 E79 TIEICE Bao & Igarashi & Ohring, Reliability of Hypercubes for Broadcasting with Random Faults 1996 E79 TIEICE Otsuki & Ito & Makino & Ohtomo, The Performance Prediction on Sentence Recognition Using a Finite State Word Automaton 1996 E79 TIEICE Moriai & Aoki & Ohta, The Best Linear Expression Search of FEAL 1996 E79 TIEICE Nakao & Kaneko & Koyama & Terada, The Security of an RDES Cryptosystem against Linear Cryptanalysis 1996 E79 TIEICE Aoki & Ohta, Differential-Linear Cryptanalysis of FEAL-8 1996 E79 TIEICE Terada & Pinheiro & Koyama, A New Version of FEAL, Stronger against Differential Cryptanalysis 1996 E79 TIEICE Kusuda & Matsumoto, Optimization of Time-Memory Trade-Off Cryptanalysis and Its Application to DES, FEAL-32, and Skipjuck 1996 E79 TIEICE Kuwakado & Koyama, A New RSA-Type Scheme Based on Singular Cubic Curves (y - alpha x) (y - beta x) congruent x^3 (mod n) 1996 E79 TIEICE Chida & Nishizeki & Ohmori & Shizuya, On the One-Way Algebraic Homomorphism 1996 E79 TIEICE Okamoto & Sakurai & Shizuya, On the Complexity of the Discrete Logarithm for a General Finite Group 1996 E79 TIEICE Tsujii & Araki & Kasahara & Okamoto & Sakai, On Ambiguity in Coppersmith' Attacking Method against NIKS-TAS Scheme 1996 E79 TIEICE Wang & Chang, A Hierarchical and Dynamic Group-Oriented Cryptographic Scheme 1996 E79 TIEICE Park & Kurosawa, New ElGamal Type Threshold Digital Signature Scheme 1996 E79 TIEICE Usuda & Mambo & Uyematsu & Okamoto, Proposal of an Automatic Signature Scheme Using a Compiler 1996 E79 TIEICE Shimbo & Takahashi & Murota, Security Mechanism of Privacy Enhanced Shared File System Suitable for Mobile Access 1996 E79 TIEICE Odagiri & Dohi & Kaio & Osaki, An Economical Analysis for a Hybrid Data Backup System 1996 E79 TIEICE Song & Kurosawa & Tsujii, Authentication Codes Based on Association Schemes 1995 E78 TIEICE Yamasaki, Control Problem of a Class of Pushdown Automata Based on Posets and Its Application to Resolution Deductions 1995 E78 TIEICE Nagata & Mukaidono & Afuso, An Optimum Half-Hot Code Assignment Algorithm for Input Encoding and Its Application to Finite State Machines 1995 E78 TIEICE Takagi, A Multiple-Precision Modular Multiplication Algorithm with Triangle Additions 1995 E78 TIEICE Muramatsu & Kanaya, A Universal Data-Base for Data Compression 1995 E78 TIEICE Tokita & Sorimachi & Matsui, On Applicability of Linear Cryptanalysis to DES-like Cryptosystems--LOKI89, LOKI91 and s^2 DES-- 1995 E78 TIEICE Hada & Tanaka, A New Approach to Constructing a Provably Secure Variant of Schnorr's Identification Scheme 1995 E78 TIEICE Gu & Peng, Linear Time Algorithms for Fault Tolerant Routing in Hypercubes and Star Graphs 1995 E78 TIEICE Yoshinaga & Inoue, Alternating Finite Automata with Counters and Stack-Counters Operating in Realtime 1995 E78 TIEICE Higuchi & Wakatsuki & Tomita, A Polynomial-Time Algorithm for Checking the Inclusion for Real-Time Deterministic Restricted One-Counter Automata Which Accept by Final State 1995 E78 TIEICE Kutrib & Vollmar, The Firing Squad Synchronization Problem in Defective Cellular Automata 1995 E78 TIEICE Tsuchida, The Complexity of Drawing Tree-Structured Diagrams 1995 E78 TIEICE Wang & Xu & Inoue & Ito, A Note on One-way Auxiliary Pushdown Automata 1995 E78 TIEICE Takimoto & Maruoka, On the Sample Complexity of Consistent Learning with One-Sided Error 1995 E78 TIEICE Takeuchi, Improved Sample Complexity Bounds for Parameter Estimation 1995 E78 TIEICE Moriyama & Sato, Properties of Language Classes with Finite Elasticity 1995 E78 TIEICE Kundu, On Construction of Non-systematic t-Symmetric Error Correcting/All Unidirectional Error Detecting Codes 1995 E78 TIEICE Takahashi & Ueno & Kajitani, Universal Graphs for Graphs with Bounded Path-Width 1995 E78 TIEICE Zhou & Nishizeki, Optimal Parallel Algorithms for Edge-Coloring Partial k-Trees with Bounded Degrees 1995 E78 TIEICE Hirose & Ikeda, Complexity of Boolean Functions Satisfying the Propagation Criterion 1995 E78 TIEICE Tonomura, Efficient Radix-2 Divider for Selecting Quotient Digit Embedded in Partial Remainder Calculation 1995 E78 TIEICE Higuchi & Tomita & Wakatsuki, A Polynomial-Time Algorithm for Checking the Inclusion for Strict Deterministic Restricted One-Counter Automata 1995 E78 TIEICE Kurihara & Ohuchi, Decomposable Termination of Composable Term Rewriting Systems 1995 E78 TIEICE Akutsu, A Parallel Algorithm for Determining the Congruence of Point Sets in Three-Dimensions 1995 E78 TIEICE Nakajima, Decentralized Voting Protocols and their Communication Structures 1995 E78 TIEICE Yun & Park, The Optimal Routing Algorithm in Hierarchical Cubic Network and Its Properties 1995 E78 TIEICE Ito, Connectivity Problems on Area Graphs for Locally Striking Disasters--Direct NA-Connection-- 1995 E78 TIEICE Mei & Igarashi, A Shortest Path Algorithm for Banded Matrices by a Mesh Connection without Processor Penalty 1995 E78 TIEICE Koyama, On the Solutions of the Diophantine Equation x^3 + y^3 + z^3 = n 1995 E78 TIEICE Hirose & Ikeda, Relationships among Nonlinearity Criteria of Boolean Functions 1995 E78 TIEICE Okamoto & Uyematsu & Mambo, Permutation Cipher Scheme Using Polynomials over a Field 1995 E78 TIEICE Mahesh & Murthy & Rangan, Efficient Dynamic Job Scheduling Algorithms for Multiprocessor Systems 1995 E78 TIEICE Shimozono & Miyano, Complexity of Finding Alphabet Indexing 1995 E78 TIEICE Nishino & Tanaka, On the Negation-Limited Circuit Complexity of Clique Functions 1995 E78 TIEICE Nishino & Radhakrishnan, On the Number of Negations Needed to Compute Parity Functions 1995 E78 TIEICE Chida & Shizuya & Nishizeki, One-Way Functions over Finite Near-Rings 1995 E78 TIEICE Hirose & Ikeda, Propagation Characteristics of Boolean Functions and Their Balancedness 1995 E78 TIEICE Itoh & Hayashi, Alternative Necessary and Sufficient Conditions for Collision Intractable Hashing 1995 E78 TIEICE Kuwakado & Koyama & Tsuruoka, A New RSA-Type Scheme Based on Singular Cubic Curves y^2 = x^3 + bx^2 (mod n) 1995 E78 TIEICE Kurosawa & Ogata & Tsujii, 4-Move Perfect ZKIP for Some Promise Problems 1995 E78 TIEICE Itoh & Takei, Checkers for Adaptive Programs 1995 E78 TIEICE Sakai & Kasahara, A New Class of Non-interactive ID-Based Key Sharing Schemes and Its Performances 1995 E78 TIEICE Kawamura, Information Leakage Measurement in a Distributed Computation Protocol 1995 E78 TIEICE Matsumoto, An Electronic Retail Payment System with Distributed Control--A Conceptual Design-- 1995 E78 TIEICE Park & Kurosawa & Tsujii, A Key Distribution Protocol for Mobile Communication Systems 1995 E78 TIEICE Dimitrov & Cooklev, Two Algorithms for Modular Exponentiation Using Nonstandard Arithmetics 1995 E78 TIEICE Takahashi & Ueno & Kajitani, On the Proper-Path-Decomposition of Trees 1994 E77 TIEICE Asano & Tokuyama, Partial Contstruction of an Arrangement of Lines nad Its Application to Optimal Partitioning of Bichromatic Point Set 1994 E77 TIEICE Tan & Hirata & Inagaki, Designing Efficient Geometric Search Algorithms Using Persistent Binary-Binary Search Trees 1994 E77 TIEICE Kagami & Edahiro & Asano, Practical Efficiencies of Planar Point Location Algorithms 1994 E77 TIEICE Wang & Inoue & Takanami, Multihead Finite Automata with Markers 1994 E77 TIEICE Yoshinaga & Inoue & Takanami, Hierarchical Properties of Realtime One-Way Alternating Multi-Stack-Counter Automata 1994 E77 TIEICE Miyaji, On Secure and Fast Elliptic Curve Cryptosystems over F_p 1994 E77 TIEICE Cerecedo & Matsumoto & Imai, Shared Pseudo-Random Secret Generation Protocols 1994 E77 TIEICE Mei & Igarashi, A Robot Navigation Strategy in Unknown Environment and Its Efficiency 1994 E77 TIEICE Nakano, An Efficient Algorithm for Summing up Binary Values on a Reconfigurable Mesh 1994 E77 TIEICE Kakuda & Takada & Kikuno, On the Complexity of Protocol Validation Problems for Protocols with Bounded Capacity Channels 1994 E77 TIEICE Hsu, On Container Width and Length in Graphs, Groups, and Networks 1994 E77 TIEICE Goldschmidt & Takvorian, An Efficient Algorithm for Finding a Maximum Weight Independent Set of a Circle Graph 1994 E77 TIEICE Chen & Nakano & Masuzawa & Tokura, A Parallel Method for the Prefix Convex Hulls Problem 1994 E77 TIEICE Ando & Nakanishi & Seki & Kasami, A Polynomial-Time Recognizable Subclass of Lexical-Functional Grammars 1994 E77 TIEICE Ohnishi & Seki & Kasami, A Polynomial Time Learning Algorithm for Recognizable Series 1994 E77 TIEICE Moriya, Stack Tree Automata and Their Relation to Context-Free Grammars with Memory 1994 E77 TIEICE Liu & Tanaka & Masuda, The Distances between Unrooted and Cyclically Ordered Trees and Their Computing Methods 1994 E77 TIEICE Haidar & Morisue, Logic Synthesis and Optimization Algorithm of Multiple-Valued Logic Functions 1994 E77 TIEICE Masuyama, Algorithms to Realize an Arbitrary BPC Permutation in Chordal Ring Networks and Mesh Connected Networks 1994 E77 TIEICE Hwang & Tzeng & Yang, A Two-Key-Lock-Pair Acces Control Method Using Prime Factorization and Time Stamp 1994 E77 TIEICE Sakoe & Ali & Katayama, One Dimensional-Two Dimensional Dynamic Programming Matching Algorithm for Character Recognition 1994 E77 TIEICE Nakano & Yahagi & Okada & Yoshida, Highly Efficient Universal Coding with Classifying to Subdirectories for Text Compression 1994 E77 TIEICE Arizono & Kanagawa, Graphical Analysis for k-out-of-n : G Repairable System and Its Application 1994 E77 TIEICE Kuwakado & Koyama, Efficient Cryptosystems over Elliptic Curves Based on a Product of Form-Free Primes 1994 E77 TIEICE Mambo & Nishikawa & Okamoto & Tsujii, A Secure Broadcast Communication Method with Short Messages 1994 E77 TIEICE Kaneko & Koyama & Terada, Dynamic Swapping Schemes and Differential Cryptanalysis 1994 E77 TIEICE Kamiura & Hata & Yamato, Design of Repairable Cellular Cellular Arrays on Multiple-Valued Logic 1994 E77 TIEICE Senda & Minoh & Ikeda, Fast String Searching in a Character Lattice 1994 E77 TIEICE Mei & Igarashi, Navigating in Unknown Environment with Rectangular Obstacles 1994 E77 TIEICE Ohta & Gong & Haneda, Polygon Interval Arithmetic and Interval Evaluation of Value Sets of Transfer Functions 1994 E77 TIEICE Sawada & Takenaga & Yajima, On the Computational Power of Binary Decision Diagrams 1994 E77 TIEICE Kaji & Seki & Kasami, Finite State Translation Systems and Parallel Multiple Context-Free Grammars 1994 E77 TIEICE Takenaga & Yajima, Computational Complexity of Manipulating Binary Decision Diagriams 1994 E77 TIEICE Nakajima, 2n ceil(sqrt n) Symmetric Communication Structure for Decentralized Consensus Protocols Using a Duality of Indices 1994 E77 TIEICE Nishino, A Simulation Result for Simultaneously Bounded AuxPDAs 1994 E77 TIEICE Sakamoto & Inoue & Takanami, Three-Dimensionally Fully Space Constructible Functions 1994 E77 TIEICE Takahashi, Convergence of the Simple Genetic Algorithm to the Two-bit Problems 1994 E77 TIEICE Nakamura, Asynchronous and Synchronous Parallel Derivation of Formal Languages 1994 E77 TIEICE Kawaguchi & Tamura & Utsumiya, A Tast Mapping Algorithm for Linear Array Processors 1994 E77 TIEICE Muguruma & Tanaka & Masuda, A Metric between Unrooted and Unordered Trees and Its Top-down Computing Method 1994 E77 TIEICE Nishino, The Emptiness Problem for Lexical-Functional Grammars is Undecidable 1994 E77 TIEICE Ishihara & Negishi & Fujii, A New Method for Lock Waiting in Mutual-Exclusions 1994 E77 TIEICE Takahashi, Balanced k-Coloring of Polyominos 1994 E77 TIEICE Miyauchi, An O(mn) Algorithm for Embedding Graphs into a 3-Page Book 1994 E77 TIEICE Watanabe & Sengoku & Tamura & Yamaguchi, Realization Problems of a Tree with a Transmission Number Sequence 1994 E77 TIEICE Takahashi & Imai & Asano, Graphical Degree Sequence Problems 1994 E77 TIEICE Akutsu, A Linear Time Pattern Matching Algorithm between a String and a Tree 1994 E77 TIEICE Matsuno & Inoue & Takanami, Leaf-Size Bounded Real-Time Synchronized Alternating One-Way Multicounter Machines 1994 E77 TIEICE Moriya, A Note on a Completely Linearly Nested Context-Free Grammar and Its Generalization 1993 E76 TIEICE Morita & Kobayashi, Data Compression of ECG Based on the Edit Distance Algorithms 1993 E76 TIEICE Kuroda & Tanaka, An Error-Correcting Version of the Leiss's Parser for Context-Free Languages 1993 E76 TIEICE Nakano, Optimal Sorting Algorithms on Bus-Connected Processor Arrays 1993 E76 TIEICE Wakatsuki & Tomita, A Fast Algorithm for Checking the Inclusion for Very Simple Deterministic Pushdown Automata 1993 E76 TIEICE Yamasaki, Fundamental Properties of Pushdown Tree Transducer (PDTT)--A Top-Down Case-- 1993 E76 TIEICE Yamamoto & Miyazaki, A Note on Leaf Reduction Theorem for Reversal- and Leaf-Bounded Alternating Turing Machines 1993 E76 TIEICE Wang & Inoue & Takanami, A Note on One-Way Multicounter Machines and Cooperating Systems of One-Way Finite Automata 1993 E76 TIEICE Suzuki & Arimoto, A Method of Managing Perfectly-Balanced Trees for Solving Quickly the Nearest Point Problems 1993 E76 TIEICE Marvasti & Nafie, Sampling Theorem: A Unified Outlook on Information Theory, Block and Convolutional Codes 1993 E76 TIEICE Uehara & Imamura, Some Properties of Partial Autocorrelation of Binary M-Sequences 1993 E76 TIEICE Akutsu, A Polynomial Time Algorithm for Finding a Largest Common Subgraph of Almost Trees of Bounded Degree 1993 E76 TIEICE Chang & Song & Kim & Cho, Cross-Joins in de Bruijn Sequences and Maximum Length Linear Sequences 1993 E76 TIEICE Liao & Devadas, Automatic Generation and Verification of Sufficient Correctness Properties of Synchronous Array Processors 1993 E76 TIEICE Takagi, A Modular Inversion Hardware Algorithm with a Redundant Binary Representation 1993 E76 TIEICE Itoh & Sakurai, Constant Round Perfect ZKIP of Computational Ability 1993 E76 TIEICE Wang & Inoue & Takanami, Some Hierarchy Results on Multihead Automata over a One-Letter Alphabet 1993 E76 TIEICE Kobayashi, On Malign Input Distributions for Algorithms 1993 E76 TIEICE Geske, Nondeterminism, Bi-Immunity and Almost-Everywhere Complexity 1993 E76 TIEICE Akutsu & Kobayashi & Hori & Ohsuga, Algorithms for Finding the Largest Subtree whose Copies Cover All the Leaves 1993 E76 TIEICE Nakashima & Takagi, Fundamental Properties of Multiple-Valued Logic Functions Monotonic with Respect to Ambiguity 1993 E76 TIEICE Maeda & Aoki & Higuchi, Optical Multiplex Computing Based on Set-Valued Logic and Its Application to Parallel Sorting Networks 1993 E76 TIEICE Horiuchi & Endo, A Mathematical Theory of System Fluctuations Using Fuzzy Mapping 1993 E76 TIEICE Werbos, Quantum Theory, Computing and Chaotic Solitons 1993 E76 TIEICE Makino & Kashiwagi & Oishi & Horiuchi, A Sufficient Condition of A Priori Estimation for Computational Complexity of the Homotopy Method 1993 E76 TIEICE Inoue & Kashiwagi & Oishi & Makino, A Modified Newton Method with Guaranteed Accuracy Based on Rational Arithmetic 1993 E76 TIEICE Hashimoto, Comparison of Erasure-and-Error Threshold Decoding Schemes 1993 E76 TIEICE Lin, On the Specification for VLSI Systolic Arrays 1993 E76 TIEICE Awashima & Sato & Ohtsuki, Optimal Constraint Graph Generation Algorithm for Layout Compaction Using Enhanced Plane-Sweep Method 1993 E76 TIEICE Nagamochi & Watanabe, Computing k-Edge-Connected Components of a Multigraph 1993 E76 TIEICE Watanabe & Yamakado, A Linear Time Algorithm for Smallest Augmentation to 3-Edge-Connect a Graph 1993 E76 TIEICE Cerecedo & Matsumoto & Imai, Efficient and Secure Multiparty Generation of Digital Signatures Based on Discrete Logarithms 1993 E76 TIEICE Sakurai, A Characterization of Languages in Constant Round Perfect Zero-Knowledge Interactive Proofs 1993 E76 TIEICE Pecht & She & Barbe, Evaluating Terminal Pair System Reliability 1993 E76 TIEICE Shedler & Moriguchi, Diagnosis of Computer Systems by Stochastic Petri Nets Part II (Theory) 1993 E76 TIEICE Onaga & Sil;va & Watanabe, Qualitative Analysis of Periodic Schedules for Deterministically Timed Petri Net Systems 1993 E76 TIEICE Tonomura, Simple Quotient-Digit-Selection Radix-4 Divider with Scaling Operation 1993 E76 TIEICE Imai, Geometric Algorithms for Linear Programming 1993 E76 TIEICE Watanabe, A Basic Theory of Information Network 1993 E76 TIEICE Amemiya & Yamamoto, A New Class of the Universal Representation for the Positive Integers 1993 E76 TIEICE Kasai & Iwata, Some EXPTIME Complete Problems on Context-Free Languages 1993 E76 TIEICE Maruyama, A New kth-Shortest Path Algorithm 1993 E76 TIEICE Urahama, Unsupervised Learning Algorithm for Fuzzy Clustering 1992 E75 TIEICE Moriya, Context-Free Grammars with Memory 1992 E75 TIEICE Takahashi, Derivation of a Parallel Bottom-Up Parser from a Sequential Parser 1992 E75 TIEICE Kim & Kim, An Algorithm for the K-Selection Problem Using Special-Purpose Sorters 1992 E75 TIEICE Arikawa & Miyano & Shinohara & Shinohara & Yamamoto, Algorithmic Learning Theory with Elementary Formal Systems 1992 E75 TIEICE Sato & Umayahara, Inductive Inferability for Formal Languages from Positive Data 1992 E75 TIEICE Mukouchi, Containment Problems for Pattern Languages 1992 E75 TIEICE Arimura & Shinohara & Otsuki, Polynomial Time Inference of Unions of Two Tree Pattern Languages 1992 E75 TIEICE Tani, On the Role of Equivalence Queries in Learning via Queries 1992 E75 TIEICE Takimoto & Maruoka, Relationships between PAC-Learning Algorithms and Weak Occam Algorithms 1992 E75 TIEICE Abe & Watanabe, Polynomially Sparse Variations and Reducibility among Prediction Problems 1992 E75 TIEICE Kaji & Nakanishi & Seki & Kasami, The Universal Recognition Problems for Parallel Multiple Context-Free Grammars and for Their Subclasses 1992 E75 TIEICE Takahashi & Iuchi & Takamatsu, A Method of Generating Tests for Combinational Circuits with Multiple Faults 1992 E75 TIEICE Kurokawa, Error Analysis of Circle Drawing Using Logarithmic Number Systems 1992 E75 TIEICE Ebara & Fukuyama & Nakano & Nakanishi, A Practical Algorithm for Computing the Roundness 1992 E75 TIEICE Lee & Oh & Kim & Chung & Kim, A Distributed Mutual Exclusion Algorithm Based on Weak Copy Consistency 1992 E75 TIEICE Gaye & Amano, A Batcher-Double-Omega Network with Combining 1992 E75 TIEICE Sugihara & Kikuno, Analysis of Fault Tolerance of Reconfigurable Arrays Using Spare Processors 1992 E75 TIEICE Horiguchi, New Classes of Majority-Logic Decodable Double Error Correcting Codes for Computer Memories 1992 E75 TIEICE Matsuba, Fractal Dimension of Neural Networks 1992 E75 TIEICE Amari, Information Geometry of Neural Networks 1992 E75 TIEICE Oishi, The Self-Validating Numerical Method--A New Tool for Computer Assisted Proofs of Nonlinear Problems 1992 E75 TIEICE Ohta, An Approximate Algorithm for Decision Tree Design 1992 E75 TIEICE Sugihara, A Simple Method for Avoiding Numerical Errors and Degeneracy in Voronoi Diagram Construction 1992 E75 TIEICE Watanabe & Kato & Onaga, Proof Procedures and Axiom Sets in Petri Net Models of Horn Clause Propositional Logic 1992 E75 TIEICE Guo & Watanabe, Graph-Theoretical Construction of Uniquely Decodable Code Pair for the Two-User Binary Adder Channel 1992 E75 TIEICE Morita & Ohta, A Switching Closure Test to Analyze Cryptosystems 1992 E75 TIEICE Cho & Lee & Kim, Optimal Task Assignment in Hypercube Networks 1992 E75 TIEICE Akutsu, An NC Algorithm for Computing Canonical Forms of Graphs of Bounded Separator 1992 E75 TIEICE Taoka & Watanabe & Onaga, A Linear-Time Algorithm for Computing All 3-Edge-Connected Components of a Multigraph 1992 E75 TIEICE Maruoka, Circuit Complexity and Approximation Method 1992 E75 TIEICE Igarashi & Kanai & Miura & Osawa, Optimal Schemes for Disseminating Information and Their Fault Tolerance 1992 E75 TIEICE Chen & Kasai, Parallel Algorithms for the Maximal Tree Cover Problems 1992 E75 TIEICE Kawaguchi, Optimal Grain Size Determination for Tree-Structured Parallel Programs 1992 E75 TIEICE Ogiwara, A Characterization of P^{C_= P} 1992 E75 TIEICE Koyama & Okamoto, Elliptic Curve Cryptosystems and Their Applications 1992 E75 TIEICE Nakano & Masuzawa & Tokura, Distributed Leader Election on Chordal Ring Networks 1992 E75 TIEICE Horita, Fully Abstract Models for Communicating Processes with Respect to Weak Linear Semantics with Divergence 1992 E75 TIEICE Kaji & Nakanisi & Seki & Kasami, The Universal Recognition Problems for Multiple Context-Free Grammars and for Linear Context-Free Rewriting Systems 1992 E75 TIEICE Takenaga & Yajima, Computational Power of Memory-Based Parallel Computation Models with Communication 1992 E75 TIEICE Akutsu, An RNC Algorithm for Finding a Largest Common Subtree of Two Trees 1992 E75 TIEICE Fujioka & Okamoto & Ohta, Interactive Bi-proof Systems and Undeniable Signature Schemes 1992 E75 TIEICE Ikekawa, On Depth-Bounded Planar Circuits 1992 E75 TIEICE Toda, Classes of Arithmetic Circuits Capturing the Complexity of Computing the Determinant 1992 E75 TIEICE Tanida & Yokomori, Polynomial-Time Identification of Strictly Regular Languages in the Limit 1992 E75 TIEICE Yamamoto, Leaf Reduction Theorem on Time- and Leaf-Bounded Alternating Turing Machines 1992 E75 TIEICE Morita & Ueno, Computation-Universal Models of Two-Dimensional 16-State Reversible Cellular Automata 1991 E74 TIEICE Zheng & Matsumoto & Imai, Proving Identity in Three Moves 1991 E74 TIEICE Ishima & Tsukiyama, On an Algorithm to Detect Positive Cycles in a Constraint Graph for Layout Compaction 1991 E74 TIEICE Nakano & Masuzawa & Tokura, A Sub-Logarithmic Time Sorting Algorithm on a Reconfigurable Array 1991 E74 TIEICE Yamamoto, Information Theory in Cryptography 1991 E74 TIEICE Imai, Recent Applications of Error-Correcting Codes 1991 E74 TIEICE Miyakawa & Saitoh & Imai, New Binary Encoding Schemes of Positive Integers 1991 E74 TIEICE Ohta & Kanaya, Optimal Decision Tree Design Based on Information Theoretical Cost Bound 1991 E74 TIEICE Ohta & Okamoto & Fujioka, Abuses of Undeniable Signatures and Their Countermeasures 1991 E74 TIEICE Kurosawa & Kasai & Tsujii, Collision Free Hash Function Based on the r-th Residue Cryptosystem 1991 E74 TIEICE Sakurai & Itoh, Language Membership versus Possession of Knowledge in Constant Round ZKIP 1991 E74 TIEICE Kurosawa, Zero Knowledge Interactive Proof System for Modulo Operations 1991 E74 TIEICE Shizuya & Itoh & Sakurai, On the Complexity of Hyperelliptic Discrete Logarithm Problem 1991 E74 TIEICE Kawamura & Takabayashi & Shimbo, A Fast Modular Exponentiation Algorithm 1991 E74 TIEICE Morita & Yamane, Hardware Approach to Fast Encipherment Processing and Its Implementation 1991 E74 TIEICE Takaragi & Hashimoto & Nakamura, On Differential Cryptanalysis 1991 E74 TIEICE Morizumi & Nagase & Takenaka & Yamashita, An Evaluation of Security Requirements Based on the Capability Model 1991 E74 TIEICE Araki & Morizumi & Nagase & Takenaka & Yamashita, Security Level Assignment by Graph Analysis 1991 E74 TIEICE Araki & Sekine, On the Conspiracy Problem of the Generalized Tanaka's Cryptosystem 1991 E74 TIEICE Nohama, On Some Properties of Multiplication Operator and Its Generation 1991 E74 TIEICE Kohda, A New Theoretical Test for Pseudorandom Number Generators Which Is Based on Perron-Frobenius Operator 1991 E74 TIEICE Kohda, Note on Transformation of Nonuniform Distributed Pseudorandom Number Sequence into Uniform One 1991 E74 TIEICE Watanabe, Graph Augmentation Problems 1991 E74 TIEICE Shimizu & Sakamoto & Tsukiyama & Numata & Kawabata, A Consideration on a Sliding Palette Problem in a Two-Dimensional Automatic Warehouse 1991 E74 TIEICE Iwano, Strong Minkowski Decomposition is NP-Complete 1991 E74 TIEICE Kobayashi & Masuda & Kashiwabara, Algorithms to Obtain a Maximal Planar Hamilton Subgraph 1991 E74 TIEICE Imai, A Geometric Fitting Problem of Two Corresponding Sets of Points on a Line 1991 E74 TIEICE Imai, On the Polynomiality of the Multiplicative Penalty Function Method for Linear Programming and Related Inscribed Ellipsoids 1991 E74 TIEICE Sengoku & Shinoda & Abe, A Theory and an Algorithm for Fault Diagnosis by Measuring Transmission Numbers in a Directed Network 1991 E74 TIEICE Ueno & Tsuji & Kajitani, A Note on the Graph Augmentation Problem 1991 E74 TIEICE Asano & Imai & Mukaiyama, Finding a Maximum Weight Independent Set of a Circle Graph 1991 E74 TIEICE Araki & Fujita, Modified Euclidean Algorithm Having High Modularity and Minimum Register Organization 1991 E74 TIEICE Iwadare & Fujiwara & Iwasaki, Coding Theory Applications in Fault Tolerant Computing 1990 E73 TIEICE Ogiwara, A Method for Generating Cryptographically Strong Primes 1988 TIMES Wright, Three Scientists and their Gods: Looking for Meaning in an Age of Information 1986 TIMES Johnson, Machinery of the Mind 1988 4 TMO Zimmermann, On Recent Developments in Linear Programming 1994 58 TOPAPPS Kechris, Topology and Descriptive Set Theory 1985 TOUSSAINT Akl, Optimal Parallel Algorithms for Selection, Sorting and Computing Convex Hulls 1985 TOUSSAINT Asano & Edahiro & Imai & Iri & Murota, Practical Use of Bucketing Techniques in Computational Geometry 1985 TOUSSAINT Avis & El Gindy & Seidel, Simple On-Line Algorithms for Convex Polygons 1985 TOUSSAINT Bhattacharya & Toussaint, On Geometric Algorithms that Use the Furthest-Point Voronoi Diagram 1985 TOUSSAINT Chazelle & Dobkin, Optimal Convex Decompositions 1985 TOUSSAINT Devroye, Expected Time Analysis of Algorithms in Computational Geometry 1985 TOUSSAINT Keil & Sack, Minimum Decompositions of Polygonal Objects 1985 TOUSSAINT Kirkpatrick & Radke, A Framework for Computational Morphology 1985 TOUSSAINT Lee & Chen, Display of Visible Edges of a Set of Convex Polygons 1985 TOUSSAINT Melville, An Implementation Study of Two Algorithms for the Minimum Spanning Circle Problem 1985 TOUSSAINT O'Rourke & Washington, Curve Similarity via Signatures 1985 TOUSSAINT Seidel, A Method for Proving Lower Bounds for Certain Geometric Problems 1985 TOUSSAINT Toussaint, Movable Separability of Sets 1985 TOUSSAINT Whitesides, Computational Geometry and Motion Planning 1985 TOUSSAINT Wood, An Isothetic View of Computational Geometry 1994 TPPP Pratt, Time and Information in Sequential and Concurrent Computation 1994 TPPP Kamada & Matsuoka & Yonezawa, An Algorithm for Efficient Global Garbage Collection on Massively Parallel Computers 1997 41 TPRBAU Ivchenko & Medvedev, Random Polynomials over a Finite Field 1996 TR Jones, Computability and Complexity from a Programming Perspective (DRAFT) 1996 TR Aho & Johnson & Karp & Kosaraju & McGeoch & Papadimitriou & Pevzner, Theory of Computing: Goals and Directions 1995 TR Hemaspaandra & Hempel & Wechsung, Query Order and Self-specifying Machines 1995 TR Hemaspaandra & Ramachandran & Zimand, Worlds To Die For 1995 TR Wigderson, Lectures on the Fusion Method and Derandomization 1995 TR Ogihara, Functions Computable with Limited Access to NP 1995 TR Cai & Selman, Average Time Complexity Classes 1995 TR Ogihara, Sparse Hard Sets for P Give Space-Efficient Algorithms 1994 TR Macarie & Ogihara, Properties of Probabilistic Pushdown Automata 1994 TR Arora, Probabilistic Checking of Proofs and Hardness of Approximation Problems (revised thesis) 1994 TR Ke & Feldman, Single Flux Quantum Circuits Using the Residue Number System 1994 TR Shor, Algorithms for Quantum Computation: Discrete Log and Factoring (Extended Abstract) 1994 TR Regan, Linear Speed-Up, Information Vicinity, and Finite-State Machines 1994 TR Regan, Linear-Time Algorithms in Memory Hierarchies 1994 TR Regan, Linear Time and Memory-Efficient Computation 1994 TR Regan, A New Parallel Vector Model, With Exact Characterizations of NC^k 1994 TR Green & Kobler & Regan & Schwentick & Toran, The Power of the Middle Bit of a #P Function 1994 TR Li & Ogihara & Regan, On Information From #P Functions 1994 TR Naik & Regan & Sivakumar, Quasilinear Time Complexity Theory 1994 TR Gries & Schneider, Teaching Math More Effectively, Through the Design of Calculational Proofs 1994 TR Gries & Schneider, A New Approach to Teaching Mathematics 1994 TR Cronauer, A Criterion to Separate Complexity Classes by Oracles 1994 TR desJardins, How to Be a Good Graduate Student/Advisor 1993 TR Parberry, A Checklist for Referees in Theoretical Computer Science 1993 TR Ogiwara, NC^k(NP) = AC^{k-1}(NP) 1993 TR Radziszowski, Small Ramsey Numbers 1993 TR Regan, The Complexity of Instance Contraction (extended abstract) 1993 TR Even, A Real-Time Systolic Integer Multiplier (Extended Abstract) 1993 TR Even, A New Proof of the Retiming Lemma and Applications (Preliminary Version) 1993 TR Macarie, Closure Properties of Stochastic Languages 1992 TR Fraenkel, Selected Bibliography on Combinatorial Games and Some Related Material--Update 2 1992 TR Ogiwara & Thierauf & Toda & Watanabe, On Closure Properties of #P in the Context of PF o #P 1992 TR Jiang & Li, On the Approximation of Shortest Common Supersequences and Longest Common Subsequences 1992 TR Ibarra & Jiang & Tran & Wang, New Decidability Results Concerning Two-way Counter Machines and Applications 1992 TR Jiang & Salomaa & Salomaa & Yu, Inclusion is Undecidable for Pattern Languages 1992 TR Jiang & Li, k One-way Heads Cannot Do String-Matching 1992 TR Han & Hemachandra & Thierauf, Threshold Computation and Cryptographic Security 1992 TR Jiang & Li, k One-way Heads Cannot Do String-Matching 1992 TR Gismondi & Swart, A Polynomial-Time Procedure for Resolving the Graph Isomorphism Problem 1992 TR Gismondi & Swart, A Polynomial-Time Solution to the Travelling Salesperson Problem 1992 TR Swart & Gismondi, N=1 1992 TR Raman, Eliminating Amortization: On Data Structures with Guaranteed Response Time (thesis) 1992 TR Klass & Yakir, The Distribution of the FFD Bin Packing Algorithm 1992 TR Hagerup & Raman, Waste Makes Haste: Tight Bounds for Loose Parallel Sorting 1992 TR Brown & Hershberger (Eds.), Animation of Geometric Algorithms: A Video Review 1992 TR Kahan, Real-Time Closest Pairs of Moving Points (included in Brown-Hershberger video review) 1992 TR Schorn & Brungger & De Lorenzi, The XYZ GeoBench: Animation of Geometric Algorithms (included in Brown-Hershberger video review) 1992 TR Edelsbrunner & Waupotitsch, Optimal Two-Dimensional Triangulations (included in Brown-Hershberger video review) 1992 TR Hershberger & Brown, Boolean Formulae for Simple Polygons (included in Brown-Hershberger video review) 1992 TR Bajaj, SHASTRA: A Distributed and Collaborative Design Environment (included in Brown-Hershberger video review) 1992 TR Palios & Phillips, Tetrahedral Break-Up (included in Brown-Hershberger video review) 1992 TR Friedman, Compliant Motion in a Simple Polygon (included in Brown-Hershberger video review) 1992 TR Epstein & Kavanagh & Knight & May & Nguyen & Sack, Workbench for Computational Geometry (included in Brown-Hershberger video review) 1992 TR Brown & Rosenberger, Topologically Sweeping an Arrangement: A Parallel Implementation (included in Brown-Hershberger video review) 1992 TR Tal & Chazelle & Dobkin, The New Jersey Line-Segment-Saw Massacre (included in Brown-Hershberger video review) 1992 TR Fraenkel, Selected Bibliography on Combinatorial Games and Some Related Material--Update 1 1992 TR Impagliazzo & Paturi & Saks, Size-Depth Trade-offs for Threshold Circuits 1992 TR Li & Vitanyi, An Introduction to Kolmogorov Complexity and Its Applications 1992 TR Gereb-Graus & Li, Three One-way Heads Cannot Do String Matching 1992 TR Vyskoc, Unambiguous Computations (area paper) 1992 TR Fenner & Fortnow & Kurtz, An Oracle Relative to which the Isomorphism Conjecture Holds 1992 TR Miltersen & Paterson & Tarui, The Asymptotic Complexity of Merging Networks (Extended Abstract) 1992 TR Li & Vitanyi, Mathematical Theory of Thermodynamics of Computation 1992 TR Arora & Lund & Motwani & Sudan & Szegedy, On the Intractability of Approximation Problems (early draft) 1992 TR Calude & Zimand, On Three Theorems in Abstract Complexity Theory: A Topological Glimpse 1992 TR Zimand, If Not Empty, NP-P is Topologically Large 1992 TR Goldmann & Hastad, Majority Gates vs. General Weighted Threshold Gates 1991 TR Brinch Hansen, The Fast Fourier Transform 1991 TR Brinch Hansen, Parallel Divide and Conquer 1991 TR Brinch Hansen, Do Hypercubes Sort Faster Than Tree Machines? 1991 TR Amir & Benson & Farach, Alphabet Independent Two Dimensional Matching 1991 TR Regan & Royer, On Closure Properties of Bounded 2-Sided Error Complexity Classes 1991 TR Sanchis, Multiple-Way Network Partitioning with Different Cost Functions 1991 TR Sanchis, Some Results on Characterizing the Edges of Connected Graphs with a Given Domination Number 1991 TR Amir & Farach, Adaptive Dictionary Matching 1991 TR Amir & Farach, Two Dimensional Dictionary Matching 1991 TR Amir & Benson, Two-Dimensional Periodicity in Rectangular Arrays 1991 TR Amir & Benson, Efficient Two-Dimensional Compressed Matching 1991 TR Broder & Karlin & Raghavan & Upfal, Trading Space for Time in Undirected s-t Connectivity 1991 TR Abadi & Halpern, Decidability and Expressiveness for First-Order Logics of Probability 1991 TR Bennett & Brassard & Crepeau, Practical Quantum Oblivious Transfer and Bit Commitment 1991 TR Bennett & Brassard & Mermin, Quantum Cryptography Without Bell's Theorem and Without EPR 1991 TR Bennett & Bessette & Brassard & Salvail & Smolin, Experimental Quantum Cryptography 1991 TR Galil, Hunting Lions in the Desert Optimally, or A Constant-Time Optimal Parallel String-Matching Algorithm 1991 TR Dietz & Raman, On Some Combinatorial Games with Applications to Data Structuring Problems 1991 TR Wu & Manber, Fast Text Searching With Errors 1991 TR Birget, Intersection and Union of Regular Languages, and State Complexity (Corrected form of an earlier Note that will appear in SIGACT News 1991) 1991 TR Birget, Partial Orders on Words, Minimal Elements of Regular Languages, and State Complexity 1991 TR Spaan, Census Techniques on Relativized Space Classes 1991 TR Krizanc & Narayanan, Off-Line Routing with Small Queues on a Mesh-connected Processor Array (Preliminary Version) 1991 TR Wang, NLIN noteq coNLIN (Preliminary Version) 1991 TR Kaklamanis & Krizanc & Narayanan & Tsantilas, Randomized Sorting and Selection on Mesh-Connected Processor Arrays 1991 TR Krizanc & Narayanan & Raman, Fast Deterministic Selection on a Mesh-Connected Processor Array 1991 TR Raman, Generating Random Graphs Efficiently 1991 TR Cai & Paige & Tarjan, More Efficient Bottom-Up Multi-Pattern Matching in Trees 1991 TR Kranakis & Krizanc, Computing Boolean Functions on Cayley Networks (Extended Abstract) 1991 TR Kurtz & Mahaney & Royer, Average Dependence and Random Oracles, Preliminary Report 1990 TR Sanchis, Parallel Algorithms for Counting and Randomly Generating Integer Partitions 1990 TR Regan, Minimum-Complexity Pairing Functions 1990 TR Dubiner & Galil & Magen, Faster Tree Pattern Matching 1990 TR Abadi & Burrows & Kaufman & Lampson, Authentication and Delegation with Smart-cards 1990 TR Jerrum & Sinclair, Polynomial-Time Approximation Algorithms for the Ising Model 1990 TR Ogiwara & Lozano, On One Word-Decreasing Self-Reducible Sets 1990 TR Regan & Royer, A Simpler Proof of PH subseteq BP[xor P] 1990 TR Hemachandra & Hoene, Collapsing Degrees via Strong Computation 1990 TR Krizanc, A Note on Off-line Permutation Routing on a Mesh-Connected Processor Array 1990 TR Makedon & Simvonis, Many-to-One Packet Routing for the Mesh 1990 TR Makedon & Simvonis, Fast Parallel Communication on Mesh Connected Machines with Low Buffer Requirements 1990 TR Makedon & Simvonis, On Bit-Serial Packet Routing for the Mest and the Torus (Extended Abstract) 1990 TR Aspnes & Beigel & Furst & Rudich, The Expressive Power of Voting Polynomials 1990 TR Krizanc & Narayanan, Randomized Selection on the Mesh-Connected Processor Array 1990 TR Amir & Farach, Efficient Dictionary Matching 1990 TR Amir & Farach, Matching Multiple Matrices of Different Sizes 1990 TR Fischer & Paterson & Rackoff, Secret Bit Transmission Using a Random Deal of Cards 1990 TR Ogiwara & Hemachandra, A Complexity Theory for Closure Properties 1990 TR Fraenkel, Selected Bibliography on Combinatorial Games and Some Related Material 1990 TR Dietz & Raman, Persistence, Amortization and Randomization 1990 TR Blum & Jiang & Li & Tromp & Yannakakis, Linear Approximation of Shortest Superstrings (Extended Abstract) 1990 TR Birget, State-Complexity of Finite-State Devices, State Compressibility and Incompressibility 1990 TR Birget, Two-way Automata and Length-preserving Homomorphisms 1990 TR Ramanan, A New Lower Bound Technique and its Application: Tight Lower Bound for a Polygon Triangulation Problem 1990 TR Kyburg, Giving up uncertainties 1990 TR Dietz, Finding ancestors in trees 1990 TR Hartman, Decision theory and the cost of planning (thesis) 1990 TR Cox, Fowler, and Veenstra, Interprocessor invocation on a NUMA multiprocessor 1990 TR Jain, Learning in the presence of additional information and inaccurate information (thesis) 1990 TR Allender & Hemachandra & Ogiwara & Watanabe, Relating equivalence and reducibility to sparse sets 1990 TR Jan & Oruc, Permutation Networks Using Radix Sorting 1990 TR Oruc & Peris, Fast Modular Arithmetic on a Permutation Network 1990 TR Berkman & Vishkin, Recursive Star-Tree Parallel Data-Structure 1990 TR Ryu, Efficient Parallel Algorithms on the Network Model 1990 TR Towell & Lehrer & Shavlik, A Model of Learning Geometric Reasoning 1990 TR Anderson & Ferris, A Genetic Algorithm for the Assembly Line Balancing Problem 1990 TR Middeldorp, Unique Normal Forms for Disjoint Unions of Conditional Term Rewriting Systems 1990 TR Meertens, Paramorphisms 1990 TR Jeuring, Algorithms from Theorems 1990 TR de Boor & Ron, Computational Aspects of Polynomial Interpolation in Several Variables 1990 TR Ferris & Vlach, Scheduling with Earliness and Tardiness Penalties 1990 TR Rich & Solomon, A Logic Based Approach to System Modelling 1990 TR Larus, Parallelism in Numeric and Symbolic Programs 1990 TR Clark, The Efficient Parallel Solution of Generalized Network Flow Problems 1990 TR Lamport, A Temporal Logic of Actions 1990 TR Schultz & Meyer, A Structured Interior Point Method 1990 TR Bach, Carmichael Functions 1990 TR Melekopoglou & Condon, On the Complexity of the Policy Iteration Algorithm 1990 TR Braschi & Trystram, A New Insight into the Coffman-Graham Algorithm 1990 TR Keil, The Complexity of Domination Problem in Circle Graphs 1990 TR Alon, The Strong Chromatic Number of a Graph 1990 TR Hertley, Deterministic Simulation of Shared Memory on Bounded Degree Networks 1990 TR Chandra & Toueg, Time and Message Efficient Reliable Broadcasts 1990 TR Novick, Parallel Algorithms for Intersection Graphs 1990 TR Vavasis, Quadratic Programming is in NP 1990 TR Klarlund, Limit Operators and Convergence Measures for Omega-Languages with Applications to Extreme Fairness 1990 TR Gries & Wadkins, An Introduction to Proofs of Program Correctness for Teachers of College-level Introductory Programming Courses 1990 TR Klarlund, Convergence Measures 1990 TR Gries, Teaching Calculation and Discrimination Early in the Curriculum 1990 TR Baraff, Determining Frictional Inconsistency for Rigid Bodies is NP-Complete 1990 TR Kozen, A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events 1990 TR Salton & Buckley, approaches to Global Text Analysis 1990 TR Hartmanis & Chang & Ranjan & Rohatgi, Structural Complexity Theory: Recent Surprises 1990 TR Chang & Kadin, On Computing Boolean Connectives of Characteristic Functions 1990 TR Coleman & Li, A Quadratically-Convergent Algorithm for the Linear Programming Problem with Lower and Upper Bounds 1990 TR Hartmanis & Chang & Ranjan & Rohatgi, On IP=PSPACE and Theorems with Narrow Proofs 1990 TR Kozen, On Kleene Algebras and Closed Semirings 1990 TR Kranakis & Krizanc & van den Berg, Computing Boolean Functions on Anonymous Networks 1990 TR Klop, Term Rewriting Systems from Church-Rosser to Knuth-Bendix and Beyond 1990 TR Tromp & van Emde Boas, Associative Storage Modification Machines 1990 TR Apt & de Boer & Olderog, Proving Termination of Parallel Programs 1990 TR Wolf, Limited Nondeterminism in Parallel Models of Computation 1990 TR Bennett & Mangasarian, Neural Network Training via Linear Programming 1990 TR Setiono, Interior Proximal Point Algorithm for Linear Programs 1990 TR Setiono, Interior Dual Least 2-Norm Algorithm for Linear Programs 1990 TR Setiono, Interior Dual Proximal Point Algorithm Using Preconditioned Conjugate Gradient 1990 TR Condon, The Complexity of the Max Word Problem and the Power of One-way Interactive Proof Systems 1990 TR Stewart & Zhang, On a Direct Method for the Solution of Nearly Uncoupled Markov Chains 1990 TR Lakshman, A New Symmetric O(N) Multiple Copy Update Algorithm and its Performance, Evaluation 1990 TR Amir & Mintz, An Efficient Algorithm for Point Selection for Image Surface Recovery Computation 1990 TR Gelenbe, Theory of the Random Neural Networks 1990 TR Beigel & Reingold & Spielman, The Perceptron Strikes Back 1990 TR Beigel & Feigenbaum, Improved Bounds on Coherence and Checkability 1990 TR Hasofer, Codes in the Torah: A Rejoinder 1990 TR Jiang & Ibarra & Wang, Some Results Concerning 2-D On-line Tessellation Acceptors and 2-D Alternating Finite Automata 1990 TR Janicki & Koutny, On Some Implementation of Optimal Simulations 1990 TR Janicki & Koutny, Net Implementation of Optimal Simulations 1990 TR Jiang & Ibarra & Wang & Zheng, A Hierarchy Result for 2-Dimensional TM's Operating in Small Space 1990 TR Levine & Sherman, A Note on bennett's Time-Space Tradeoff for Reversible Computation 1990 TR Levine & Sherman & Baldwin & Sherman, How We Solved the $100,000 Decipher Puzzle (16 Hrs Too Late) 1990 TR Romanik & Smith, Testing Geometric Objects 1990 TR Gasarch & Pleszkoch & Solovay, Learning via Queries in [+,<] 1990 TR Raghavan, Lecture Notes on Randomized Algorithms 1990 TR Alon & Megiddo, Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time 1990 TR Alon, Generating Pseudo-random Permutations and Maximum Flow Algorithms 1990 TR Sheinwald & Lempel & Ziv, Two Dimensional Encoding by Finite State Encoders 1990 TR Driscoll, Ordinary Mathematical Notation: Some Characteristics and their Implications for Programming 1990 TR Jessup & Ipsen, Improving the Accuracy of Inverse Iteration 1990 TR Ipsen, Some Remarks on the Generalized Bareiss and Levinson Algorithms 1990 TR Simon, Palavras, Automatos e Algoritmos -- uma Bibliografia 1990 TR Basye & Dean & Vitter, Coping with Uncertainty in Map Learning 1990 TR Cohen & Megiddo, Recognizing Properties of Periodic Graphs 1990 TR Beigel & Reingold & Spielman, PP is Closed Under Intersection 1990 TR Cohen & Wigderson, Multigraph Amplification 1990 TR Goldsmith & Hemachandra & Kunen, On the Structure and Complexity of Infinite Sets with Minimal Perfect Hash Functions 1990 TR Mellor-Crummey & Scott, Algorithms for Scalable Synchronization on Shared-Memory Multiprocessors 1990 TR Hemachandra, Algorithms from Complexity Theory: Polynomial-Time Operations for Complex Sets 1990 TR Schubert, Semantic Nets are in the Eye of the Beholder 1990 TR Hemachandra & Ogiwara & Toda, Space-Efficient Recognition of Sparse Self-Reducible Languages 1990 TR Neiger & Toueg, Automatically Increasing the Fault-Tolerance of Distributed Algorithms 1990 TR Neiger & Toueg, Simulating Synchronized Clocks and Common Knowledge in Distributed Systems 1990 TR Ierardi & Kozen, Parallel Resultant Computation 1990 TR Khuller & Naor, Flow in Planar Graphs with Vertex Capacities 1990 TR Lister, On Leaping Tall Maxima in a Single Bound: Learning in an Energy Minimization Network 1990 TR Douglass, Self-Routing and Route Balancing in Connection Networks 1990 TR Berkman & Vishkin, On Parallel Integer Merging 1990 TR Cai, Exponential Lower Bounds for Constant Depth Circuits in the Presence of Help Bits 1990 TR Jain & Sharma, Learning in the Presence of Partial Explanations 1990 TR Jablonowski, GMB: Graph Manager/Browser 1990 TR Amir & Landau & Vishkin, Efficient Pattern Matching with Scaling 1990 TR Stotts, A Mills-Style Iteration Theorem for Nondeterministic Concurrent Programs 1990 TR Cook & Kapron, Characterizations of the Basic Feasible Functionals of Finite Type 1990 TR Feigenbaum & Merritt, DIMACS Workshop on Distributed Computing and Cryptography: Open Questions, Talk Abstracts, and Summary of Discussions 1990 TR Allender & Wagner, Counting Hierarchies: Polynomial Time and Constraint Depth Circuits 1990 TR Dunn & Fedyna & Peters, Efficient Parallel Implementation of Sequence Analysis Algorithms Using a Global Address Space Model 1990 TR Pach & Steiger & Szemeredi, An Upper Bound on the Number of Planar K-sets 1990 TR Raman, The Power of Collision: Randomized Parallel Algorithms for Chaining and Integer Sorting 1990 TR Chang & Kadin, On the Structure of Uniquely Satisfiable Formulas 1990 TR Davis & Yew, A Stable Non-deterministic Parallel Algorithm for General Unsymmetric Sparse LU Factorization 1990 TR Harrison & Ammarguellat, A Comparison of Automatic Versus Manual Parallelization of the Boyer-Moore Theorem Prover 1990 TR Willick & Eager, An Analytical Model of Multistage Interconnection Networks 1990 TR Dietz & Sleator, Amortized Analysis of a Pebble Game 1990 TR Gasarch & Hemachandra & Hoene, On Checking versus Evaluation of Multiple Queries 1990 TR Das & Joseph, Minimum Vertex Hulls for Polyhedral Domains 1990 TR Sidhu & Chung & Blumer, Experience with Formal Methods in Protocol Development 1990 TR Greenberg & Maley, Finding Minimum Width for Single-layer Channel Routing in Linear Time 1990 TR Vishkin, A Parallel Blocking Flow Algorithm for Acyclic Networks 1990 TR Matias & Vishkin, On Parallel Hashing and Integer Sorting 1990 TR Anagnostou, Progress in Minimum Weight Triangulation 1990 TR Sherk, Self-Adjusting k-ary Search Trees and Self-Adjusting Balanced Search Trees 1990 TR Krizanc, Integer Sorting on a Mesh-connected Array of Processors 1990 TR Hemachandra & Hoene & Siefkes & Young, On Sets Polynomially Enumerable by Iteration 1990 TR Eppstein & Hemachandra & Tisdall & Yener, Simultaneous Strong Separations of Probabilistic and Unambiguous Complexity Classes 1990 TR Regan & Royer, A Quick Proof of PH subseteq BP (xor P) 1990 TR Babai & Fortnow & Lund, Non-Deterministic Exponential Time has Two-Prover Interactive Protocols (Version 2) 1990 TR Babai & Fortnow, A Characterization of #P by Straight Line Programs of Polynomials, with Applications to Interactive Proofs and Toda's Theorem (Preliminary version) 1990 TR Fortnow & Lund, Interactive Proof Systems and Alternating Time-Space Complexity 1990 TR Raxborov, On the Distributional Complexity of Disjointness 1990 TR Fraenkel, Selected Bibliography on Two-Player Combinatorial Games and Some Related Material 1990 TR Beigel & Feigenbaum, On the Complexity of Coherent Sets 1990 TR Feigenbaum & Kannan & Nisan, Lower Bounds on Random-Self-Reducibility (Extended Abstract) 1990 TR Beaver & Feigenbaum & Kilian & Rogaway, Security with Low Communication Overhead (Extended Abstract) 1990 TR Buntrock & Hemachandra & Siefkes, Using Inductive Counting to Simulate Nondeterministic Computation 1990 TR Rohl, Ord-Smith's Pseudo-Lexicographical Permutation Procedure Is the Tompkins-Paige Algorithm 1990 TR Leighton, Parallel Computation 1990 TR Netzer & Miller, On the Complexity of Event Ordering for Shared-Memory Parallel Program Executions 1990 TR Sorenson, An Introduction to Prime Number Sieves 1990 TR De Leone & Ow, Parallel Implementation of Lemeke's Algorithm on the Hypercube 1990 TR Ragde, The Parallel Simplicity of Compaction and Chaining 1990 TR Kalyanasundaram & Schnitger, The Probabilistic Communication Complexity of Set Intersection 1990 TR Szegedy, Functions with Bounded Symmetric Communication Complexity and Circuits with mod m Gates 1990 TR Goldmann & Hastad, A Simple Lower Bound for Monotone Clique Using a Communication Game 1990 TR Jain & Sharma, Program Size Restrictions in Inductive Learning 1990 TR Luginbuhl, Computational Complexity of Random Access Models (thesis) 1989 TR Sanchis, On the Effective Generation of Set Elements within Specified Ranges 1989 TR Althofer & Das & Dobkin & Joseph, Generating Sparse Spanners for Weighted Graphs 1989 TR Olderog & Apt, Using Transformations to Verify Parallel Programs 1989 TR Ponse & de Vries, Strong Completeness for Hoare Logics of Recursive Processes: An Infinitary Approach 1989 TR Bergstra & Heering, Which Data Types Have omega-Complete Initial Algebra Specifications? 1989 TR Middledorp, Termination of Disjoint Unions of Conditional Term Rewriting Systems 1989 TR Martens & Willems, Readings in Knowledge Representation: A Survey 1989 TR Scott, Factoring Large Integers on Small Computers 1989 TR Smith, The Task of the Referee 1989 TR Raghunathan, Algorithms for Weakly Triangulated Graphs 1989 TR Clausen & Dress, On Zero-Testing and Interpolation of k-Sparse Multivariate Polynomials over Finite Fields 1989 TR Dahlhaus & Karpinski, An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO) of an Arbitrary Graph 1989 TR Bar-Noy & Dolev, Shared Memory vs. Message-Passing in an Asynchronous Distributed Environment 1989 TR Iyer & Ricard & Varman, An Efficient Percentile Partitioning Algorithm for Parallel Sorting 1989 TR Moreno, Matrix Computations on Mesh Arrays 1989 TR Jacquet & Szpankowski, Autocorrelation on Words and its Applications 1989 TR Cristian, Understanding Fault-Tolerant Distributed Systems 1989 TR Attiya & Bar-Noy & Dolev & Peleg & Reischuk, Renaming in an Asynchronous Environment 1989 TR Birk & Gibbons & Sanz & Soroker, A Simple Mechanism for Efficient Barrier Synchronization in MIMD Machines 1989 TR Aggarwal & Vitter, The Input/Output Complexity of Sorting and Related Problems 1989 TR Aggarwal & Anderson & Kao, Parallel Depth-First Search in General Directed Graphs 1989 TR Aggarwal & Guibas & Saxe & Shor, A Linear Time Algorithm for Computing the Voronoi Diagram of a Convex Polygon 1989 TR Aggarwal & Kravets, A Linear Time Algorithm for Finding All Farthest Neighbors in a Convex polygon 1989 TR Aggarwal & Klawe, Application of Generalized Matrix Searching to Geometric Algorithms 1989 TR Aggarwal & Moran & Shor & Suri, Computing the Minimum Visible Vertex Distance between Two Polygons 1989 TR Aggarwal, Research Topics in Computational Geometry 1989 TR Borodin & Tiwari, On the Decidability of Sparse Univariate Polynomial Interpolation 1989 TR Khuller & Schieber, Efficient Parallel Algorithms for Testing Connectivity and Finding Disjoint s-t Paths in Graphs 1989 TR Aggarwal & Suri, Computing the Longest Diagonal of a Simple Polygon 1989 TR Attiya & Dolev & Shavit, Bounded Polynomial Randomized Consensus 1989 TR Fowler & Slator & Balogh, On Psychological Plausibility in Artificial Intelligence 1989 TR Kershenbaum & Kermani & Grover, Mentor: An Algorithm for Mesh Network Topological Optimization and Routing 1989 TR Greening, A Taxonomy of Parallel Simulated Annealing Techniques 1989 TR Coppersmith & Davenport, Polynomials Whose Powers are Sparse 1989 TR Stone, An Algorithm for Finding a Minimum Weighted 2-Matching 1989 TR Hafner & McCurley, Asymptotically Fast Triangularization of Matrices over Rings 1989 TR Kozima & Megiddo, The Relation between the Path of Centers and Smale's ``Regularized'', Linear Programming Problem 1989 TR Dolev & Feder, Multiparty Communication Complexity 1989 TR Cheng & Soroker, The Net-Crossing Theorem and its Applications 1989 TR Broder & Karlin & Raghavan & Upfal, Trading Space for Time in Undirected s-t Connectivity 1989 TR Hilditch & Thomson, Distributed Deadlock Detection: Algorithms and Proofs 1989 TR Freeman, An Approach for Proving that P is Not Equal to NP 1989 TR Osherson & Stob & Weinstein, A Universal Inductive Inference Machine 1989 TR Palis & Shende, A Pumping Lemma Scheme for the Control Language Hierarchy 1989 TR Shastri, The Relevance of Connectionism to AI: A Representation and Reasoning 1989 TR Osherson & Stob & Weinstein, Uniform Inductive Improvement 1989 TR Palis & Rajasekaran & Wei, General Routing Algorithms for Star Graphs 1989 TR Abe, Polynomial Learnability of Semilinear Sets 1989 TR Jiang, The Synchronization of Nonuniform Networks of Finite Automata 1989 TR Jiang, On the Complexity of 1-Tape ATM's and Off-line 1-Tape ATM's Running in Constant Reversals 1989 TR Milenkovic & Nackman, Finding Compact Coordinate Representation for Polygons and Polyhedra 1989 TR Cypher & Plaxton, Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related Computers 1989 TR Halpern & Fagin, Two Views of Belief: Belief as Generalized Probability and Belief as Evidence 1989 TR Gibbons & Soroker & Sanz, A Study on Massively Parallel Shared Memory Computing 1989 TR Bruck, On the Convergence Properties of the Hopfield Model 1989 TR Fagin & Halpern & Vardi, A Nonstandard Approach to the Logical Omniscience Problem 1989 TR Fagin & Halpern, A New Approach to Updating Beliefs 1989 TR Bruck & Roychowdhury, How to Play Bowling in Parallel on the Grid? 1989 TR Abadi & Halpern, Decidability and Expressiveness for First-order Logics of Probability 1989 TR Halpern & Tuttle, Knowledge, Probability and Adversaries 1989 TR Halpern, Presburger Arithmetic with Unary Predicates is Pi Complete 1989 TR Stamos & Cristian, A Low-Cost Atomic Commit Protocol 1989 TR Bruck & Cypher & Soroker, Running Ascend-Descend Algorithms on Faulty Hypercubes 1989 TR Megiddo, On Probabilistic Machines, Bounded Rationality and Average-Case Complexity 1989 TR Birk & Lotspiech, On Finding Non-intersecting Straight-line Connections of Grid Points to the Boundary 1989 TR Naor, Succint Representation of General Unlabeled Graphs 1989 TR Ho & Johnsson, Dilation d Embedding of a Hyper-Pyramid into a Hypercube 1989 TR Ajtai & Gurevich, Datalog versus First Order Logic 1989 TR Cristian, Synchronous Atomic Broadcast for Redundant Broadcast Channels 1989 TR Ramakrishnan & Sagiv & Ullman & Vardi, Logical Query Optimization by Proof-Tree Transformation 1989 TR Chaitin, Undecidability and Randomness in Pure Mathematics 1989 TR Aggarwal & Chandra & Snir, On Communications Latency in PRAM Computations 1989 TR Palmer, An Introduction to the C Programming Language 1989 TR Aggarwal & Chandra & Snir, Communication Complexity of PRAMs 1989 TR Revesz, On Translating Ordinary Mathematical Notation 1989 TR Philips & Franaszek, Clock Synchronization in Broadcast Networks 1989 TR Bernstein & Chaitin, A Computer Gallery of Mathematical Physics 1989 TR Greening, Parallel Simulated Annealing Techniques 1989 TR Natarajan & Kirkpatrick, Evaluation of Parallel Placement by Simulated Annealing: Part II 1989 TR Chaitin, Algorithmic Information and Evolution 1989 TR Madden, The Specialization and Transformation of Constructive Existence Proofs 1989 TR Pritchard, Opportunistic Algorithms for Covering with Subsets 1989 TR Singh & Anderson & Gouda, The Elusive Atomic Register 1989 TR Singh & Gouda, Rankers: A Panacea for Synchronization 1989 TR Case, Effecivizing Inseparability 1989 TR Meseguer & Montanari, Petri Nets are Monoids 1989 TR Goguen & Meseguer & Leinwand & Winkler & Aida, The Rewrite Rule Machine Project 1989 TR Meseguer, General Logics 1989 TR Rushby & von Henke, Formal Verification of the Interactive Convergence Clock Synchronization Algorithm Using EHDM 1989 TR Yeh, Odd Cycles, Bipartite Subgraphs and Approximate Graph Coloring 1989 TR Friedman, Data Structure for Formal Verification of Circuit Designs 1989 TR Lipton, Fingerprinting Sets 1989 TR Lipton, Recursively Enumerable Languages Have Finite State Interactive Proofs 1989 TR Heng & Lin & LaPaugh & Pinter, Decreasing Channel Width Lower Bounds by Channel Lengthening 1989 TR Barbara & Palacios, Random Walk Techniques for Protocol Validation 1989 TR Gabow & Tarjan, Faster Scaling Algorithms for General Graph Matching Problems 1989 TR Feige & Shamir, Zero Knowledge Proofs of Knowledge in Two Rounds 1989 TR Fraenkel & Klein, Security Aspects of Prefix Codes 1989 TR Hirst & Harel, On the Power of Bounded Concurrency II: The Pushdown Automata Level 1989 TR Davidor, Epistasis Variance - Suitability of a Representation to Genetic Algorithms 1989 TR Patt & Peleg, Time-Space Tradeoffs for Set Operations 1989 TR Blass & Fraenkel, The Sprague-Grundy Function of Wythoff's Game 1989 TR Fraenkel, Combinatorics and Algorithms 1989 TR Peleg, Complexity Considerations for Distributed Data Structures 1989 TR Dahlhaus & Hajnal & Karpinski, Optimal Parallel Algorithms for the Hamiltonian Cycle Problem on Dense Graph 1989 TR Omohundro, Geometric Learning Algorithms 1989 TR Ladkin, The Possibility of an Executable Specification Language 1989 TR Dahlaus & Karpinski & Novick, Fast Parallel Algorithms for the Clique Separator Decomposition 1989 TR Karpinski, Boolean Circuit Complexity of Algebraic Interpolation Problems 1989 TR Dagum & Luby, Approximating the Permanent of Graphs with Large Factors 1989 TR Hellerstein & Karpinski, Learning Read-once Formulas Using Membership Queries 1989 TR Gupta & Hambrusch, Multiple Network Embeddings into Hypercubes 1989 TR Gibbons, A More Practical PRAM Model 1989 TR Kay, The Establishment of the International Computer Science Institute - Berkeley 1989 TR Bourlard & Morgan, Merging Multilayer Perceptrons and Hidden Markov Models: Some Experiments in Continuous Speech Recognition 1989 TR Stolcke, A Connectionist Model of Unification 1989 TR Impagliazzo & Luby, One Way Functions are Essential for Complexity Based Cryptography 1989 TR Luby, Removing Randomness in Parallel Computation without a Processor Penalty 1989 TR Hambrusch & Luby, Parallel Asynchronous Connected Components in a Mesh 1989 TR Goldreich, A Note on Computational Indistinguishability 1989 TR Angluin & Hellerstein & Karpinski, Learning Read-once Formulas with Queries 1989 TR Guesgen, Spatial Reasoning Based on Allen's Temporal Logic 1989 TR Hambrusch & Winkel, Parallel Heuristics for the Steiner Tree Problem in Images without Sorting or Routing 1989 TR Karp, The Transitive Closure of a Random Digraph 1989 TR Aggarwal & Park, Parallel Searching in Multidimensional Monotone Arrays 1989 TR Goli & Heidelberger & Towsley & Yu, Processor Assignment and Synchronization in Parallel Simulation of Multistage Interconnection Networks 1989 TR Hooke, Multiple Splitting of Numerical Variables in Inductive Learning 1989 TR Bos & Coster, Addition Chain Heuristics 1989 TR Kranakis & Pocchiola, Enumeration and Visibility Problems in Integer Lattices 1989 TR Barrington & Corbett, On the Relative Complexity of Some Languages in NC 1989 TR Ramamritham & Stankovic & Zhao, Disributed Scheduling of Tasks with Deadlines and Resource Requirements 1989 TR Rosenberg, Efficient Emulations of Interconnection Networks: A Formal Framework and a Case Study 1989 TR Rosenberg, Computer Literacy Education 1989 TR Aiello, Proofs, Knowledge, and Oracles--Three Complexity Results for Interactive Proofs and Zero-Knowledge 1989 TR Berger & Rompel & Shor, Efficient NC Algorithms for Set Cover with Applications to Learning and Geometry 1989 TR Cherian, A Study of Backoff Barrier Synchronization 1989 TR Kravets, Finding Farthest Neighbors in a Convex Polygon and Related Problems 1989 TR Berger & Rompel, Simulating (log cn)-wise Independence in NC 1989 TR Lopresti & Hughey, The B-sys Programmable Systolic Array 1989 TR Kenyon-Mathieu & Vitter, The Maximum Size of Dynamic Data Structures 1989 TR Tamassia & Preparata, Dynamic Planar Point Location with Optimal Query Time 1989 TR Tamassia, Dynamic Planar Graph Embedding 1989 TR Zadeck, An Efficient Algorithm for Incremental Data-flow Analysis 1989 TR Tamassia & Vitter, Optimal Parallel Algorithms for Transitive Closures and Point Location in Planar Structures 1989 TR Buchsbaum & Kanellakis & Vitter, A Data Structure for Arc Insertion and Regular Path Finding 1989 TR Dean & Kanazawa, A Model for Reasoning about Persistence and Causation 1989 TR Hughey & Lopresti, An Architecture for Programmable Systolic Arrays 1989 TR Eades & Tamassia, Algorithms for Drawing Graphs: An Annotated Bibliography 1989 TR Graham, Massive Information Storage, Management and Use 1989 TR Beynon & Russ, Variables in Mathematics and Computer Science 1989 TR Sloan, Computational Learning Theory: New Models and Algorithms 1989 TR Blum, On the Computational Complexity of Training Simple Neural Networks 1989 TR Heller, Efficient Lazy Data-Structures on a Dataflow Machine 1989 TR Fortnow, Complexity-theoretic Aspects of Interactive Proof Systems 1989 TR Leighton & Leiserson & Schwabe, Theory of Parallel and VLSI Computation 1989 TR Lynch & Goldman, Distributed Algorithms 1989 TR Di Battista & Tamassia, On-line Planarity Testing 1989 TR Paterson & Yao, Binary Partitions with Applications to Hidden-Surface Removal and Solid Modelling 1989 TR Roucairol, Parallel Branch and Bound Algorithms - An Overview 1989 TR Lister, Segment Reversal and the Traveling Salesman Problem 1989 TR Drusinsky & Harel, On the Power of Bounded Concurrency I: The Finite Automata Level 1989 TR Regnier, Knuth-Morris-Pratt Algorithm: An Analysis 1989 TR Quinton & Robert, Systolic Convolution of Arithmetic Functions 1989 TR Morain & Olivos, Speeding Up the Computations on an Elliptic Curve Using Addition-Subtraction Chains 1989 TR Raynal, Prime Numbers as a Tool to Design Distributed Algorithms 1989 TR Le Chenadec, On the Logic of Unification 1989 TR Tetali, Probabilistic Methods: Algorithmic Aspects 1989 TR Cantone & Cutello & Policriti, Set-Theoretic Reductions of Hibert's Tenth Problem 1989 TR Cantone, On the Decidability of Presburger Arithmetic with Homogeneous Exponentiation 1989 TR Johnson & Shasha, Random B-Trees with Inserts and Deletes 1989 TR Gabow & Xu, Efficient Theoretic and Practical Algorithms for Linear Matroid Intersection Problems 1989 TR Davidson & Harel, Drawing Graphs Nicely Using Simulated Annealing 1989 TR Chandy & Sherman, Space-Time and Simulation 1989 TR Donald & Pai & Xavier, What Should a Robotist Do Next? A Progress Report from the Cornell Computer Science Robotics Laboratory 1989 TR Kapur, Inductive Inference without Overgeneralization from Positive Examples 1989 TR Chang, An Example of a Theorem That Has Contradictory Realtivizations and a Diagonalization Proof 1989 TR Panconesi & Ranjan, Quantifiers and Approximation 1989 TR Sambandan & Kedem & Wang, Generalized Planar Sweeping of Polygons 1989 TR Khuller, Planar Graph Coloring Is Not Self-Reducible Assuming P != NP 1989 TR Shah & Marzullo, Trade-offs between Replication and Availability in Distributed Databases 1989 TR Novick, Generalized PQ-Trees 1989 TR Novick, Parallel Algorithms for the Split Decomposition 1989 TR Lipton & Naughton, Clocked Adversaries for Hashing 1989 TR Gallivan & Sameh & Plemmons, Parallel Algorithms for Dense Linear Algebra Computations 1989 TR Kamburowski & Stallmann, Reducing Transitive Vertex Cover to Bipartite Vertex Cover 1989 TR Hirschberg & Lelewer, Efficient Decoding of Prefix Codes 1989 TR Jha & Slutzki, An O(n^2log n) Algorithm for Recognizing Median Graphs 1989 TR Wong & Delosme, Transformation of Broadcasts into Propogations in Systolic Algorithms 1989 TR Wong & Delosme, Optimization of Computation Time for Systolic Arrays 1989 TR Agarwal, Patitioning Arrangements of Lines: I. An Efficient Deterministic Algorithm 1989 TR Sharir, On k-Sets in Arrangements of Curves and Surfaces 1989 TR Guibas & Overmars & Sharir, Counting and Reporting Intersections in Arrangements of Line Segments 1989 TR Guibas & Overmars & Sharir, Ray Shooting, Implicit Point Location, and Related Queries in Arrangements of Segments 1989 TR Agarwal, Partitioning Arrangements of Lines: II. Applications 1989 TR Chazelle, An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra 1989 TR Lovasz, Communication Complexity: A Survey 1989 TR Shub & Weiss, Can One Always Lower Topological Entropy 1989 TR Alpern & Hoover & Rosen & Sweeney & Zadeck, Incremental Evaluation of Computational Circuits 1989 TR Shamir & Dietrich, Characterization and Algorithms for Greedily Solvable Transportation Problems 1989 TR Herley, Improved Bounds for the Token Distribution Problem 1989 TR Birman, How Robust Are Distributed Systems? 1989 TR Novick, Logarithmic Time Parallel Algorithms for Comparability and Interval Graphs 1989 TR Novick, Fast Parallel Algorithms for the Modular Decomposition 1989 TR Rohl, Recursive and Iterative Functions for Generating Fibonacci Numbers 1989 TR Basin & Del Vecchio, Verification of Combinational Logic in Nuprl 1989 TR Rohl, Reversing Is Not Inherent in Lexicographical Permutation Generation 1989 TR Basin, Equality of Terms Containing Associative-Commutative Functions and Commutative Binding Operators Is Isomorphism Complete 1989 TR Dickerson, The Functional Decomposition of Polynomials 1989 TR McCurley & Schneider, An Assertional Characterization of Serializability 1989 TR Higham, How Accurate Is Gaussian Elimination? 1989 TR Casley & Crew & Meseguer & Pratt, Temporal Structures 1989 TR Bronstein, MLP: String-functional Semantics and Boyer-Moore Mechanization for the Formal Verification of Synchronous Circuits 1989 TR Manber & Myers, Suffix Arrays: A New Method for On-line String Searches 1989 TR Shih & Liu & Chung, Fast Algorithms for Scheduling Imprecise Computations with Timing Constraint 1989 TR Soneoka, Super Edge-connectivity of Dense Digraphs and Graphs 1989 TR Akl & Gries & Stojmenovic, An Optimal Parallel Algorithm for Generating Combinations 1989 TR Ierardi, The Complexity of Quantifier Elimination in the Theory of an Algebraically Closed Field 1989 TR Salton, A Comparison of Book Indexing Methods 1989 TR Peckham, Maintaining Tree Projections in Amortized O(log n) Time 1989 TR Vazirani, A Theory of Alternating Paths and Blossoms for Proving Correctness of the O General Graph Matching Algorithm 1989 TR Klarlund & Schneider, Verifying Safety Properties Using Non-deterministic Infinite-State Automata 1989 TR Schneider, Simpler Proofs for Concurrent Reading and Writing 1989 TR Aizikowitz, Designing Distributed Services Using Refinement Mappings 1989 TR Hyatt & Suter & Nelson, A Parallel Alpha/Beta Tree-Searching Algorithm 1989 TR Purdom, Backtracking and Random Constraint Satisfaction 1989 TR Edelsbrunner, An Acyclicity Theorem for Cell Complexes in d Dimensions 1989 TR Plaxton, Load Balancing on the Hypercube and Shuffle-Exchange 1989 TR Pitt & Warmuth, The Minimum Consistent dfa Problem Cannot Be Approximated Within Any Polynomial 1989 TR Knuth, Theory and Practice 1989 TR Plaxton, Efficient Computation on Sparse Interconnection Networks 1989 TR Anderson, Using (N-1)-process Election to Solve N-process Election 1989 TR Grunwald & Reed, Analysis of Backtracking Routing in Binary Hypercube Computers 1989 TR Cypher, A Lower Bound on the Size of Shellsort Sorting Networks 1989 TR Henry, Encoding Optimal Pattern Selection in a Table-driven Bottom-Up Tree-Pattern Matcher 1989 TR Chandra & Raghavan & Ruzzo & Smolensky & Tiwari, The Electrical Resistance of a Graph Captures Its Commute and Cover Times 1989 TR Lam & Ruzzo, Results on Communication Complexity Classes 1989 TR Anderson, The Performance of Spin Lock Alternatives for Shared-Memory Multiprocessors 1989 TR Cypher & Sanz, Algorithms for Reduced Hypercubes and Related Computers 1989 TR Ranade, Fluent Parallel Computation 1989 TR Ho & Johnsson, Embedding Meshes in Boolean Cubes by Graph Decomposition 1989 TR Brown & Nelson, IO Streams: Abstract Types, Real Programs 1989 TR Cardelli & Donahue & Glassman & Jordan & Kalsow & Nelson, Modula-3 Report (revised) 1989 TR Schmidt & Steger & Guntzer & Kiessling & Azone & Bayer, Combining Deduction by Certainty with the Power of Magic 1989 TR Fang & Li & Zhu, A New Parallel Sorting Approach with Sorting Memory Module 1989 TR Cox, The Implementation of a Coherent Memory Abstraction on a NUMA Multiprocessor Experiences with PLATINUM 1989 TR Kranakis & Krizanc & van den Berg, Computing Boolean Functions on Anonymous Networks 1989 TR Hemachandra & Hoene, On Sets with Efficient Implicit Membership Tests 1989 TR Hauser, Communication Complexity 1989 TR Dietz & Raman, A Constant Update Time Finger Search Tree 1989 TR Baudon, A Linear Algorithm for Embedding Planar Graphs, Where Certain Rotations Are Arbitrarily Fixed 1989 TR Salem, Formal Verification of the Janus On-line Multiplier 1989 TR Kaufmann, A Parallel Algorithm for Surface/Plane Intersection 1989 TR Rybowicz, Search of Primitive Polynomials over Finite Fields 1989 TR Hu & Chassery, Diagrammes de Voronoi Generalises: Premiers Resultats 1989 TR Holstege, Marking and the Design of Notations 1989 TR Ross & Knuth, A Programming and Problem Solving Seminar 1989 TR Alur & Henzinger, A Really Temporal Logic 1989 TR Plotkin, Sticky Bits and Universality of Consensus 1989 TR Mayr & Subramanian, The Complexity of Circuit Value and Network Stability 1989 TR Plaxton, On the Network Complexity of Selection 1989 TR Subramanian, A New Approach to Stable Matching Problems 1989 TR Karp, Hypothesis Formation and Qualitative Reasoning in Molecular Biology 1989 TR Li & Vitanyi, A Theory of Learning Simple Concepts under Simple Distributions and Average Case Complexity for the Universal Distribution 1989 TR Buhman & Homer & Torenvliet, Honest Reductions, Completeness and Nondeterministic Complexity Classes 1989 TR Buhrman & Spaan & Torenvliet, On Adaptive Resource Bounded Computations 1989 TR Geiger & Verma & Pearl, d-Separation: From Theorems to Algorithms 1989 TR Geiger & Paz & Pearl, Axioms and Algorithms for Inferences Involving Probabilistic Independence 1989 TR Pearl, Probabilistic Semantics for Nomonotonic Reasoning: A Survey 1989 TR Hopcroft & Kahn, A Paradigm for Robust Geometric Algorithms 1989 TR Borodin & Ruzzo & Tompa, Lower Bounds on the Length of Universal Traversal Sequences 1989 TR Makowski & Philips, Simple Proofs of Some Folk Theorems for Parallel Queues 1989 TR Burshtein & Pietra & Kanevsky & Nadas, A Splitting Theorem for Tree Construction 1989 TR Ben-Or & Linial & Saks, Collective Coin Flipping and Other Models of Imperfect Randomness 1989 TR Halpern, The Relationship between Knowledge, Belief, and Certainty 1989 TR Aiken, A theory of Compaction-based Parallelization 1989 TR Bar-Noy & Dolev & Koller & Peleg, Fault-tolerant Critical Section Management in Asynchronous Environments 1989 TR Dolev & Shavit, Bounded Concurrent Time-Stamp Systems are Constructible! 1989 TR Cover & Gacs & Gray, Komogorov's Contributions to Information Theory and Algorithmic Complexity 1989 TR Dwork & Stockmeyer, A Time Complexity Gap for 2-way Probabilistic Finite State Automata 1989 TR Aiken & Nicolau, Fine-grain Parallelization and the Wavefront Method 1989 TR McCurley, The Discrete Logarithm Problem 1989 TR Halpern, An Analysis of First-order Logics of Probability 1989 TR Ben-Or & Tiwari, Simple Algorithms for Approximating All Roots of a Polynomial with Real Roots 1989 TR Wolf & Rhyne & Ellozy, The Paper-like Interface 1989 TR Greening & Darema, Rectangular Spatial Decomposition Methods for Parallel Simulated Annealing 1989 TR van Ginneken, Polynomial-Time, Minimal-Area Slicing of Point Placements 1989 TR Strenski & Kirkpatrick, Analysis of Finite Length Annealing Schedules 1989 TR Corella, Mechanizing Set Theory 1989 TR Douglas & Miranker, Mutilevel Sorting 1989 TR Raghavan, Robust Algorithms for Packet Routing in a Mesh 1989 TR Aggarwal & Carter, Optimal Tradeoffs for Addition on Systolic Arrays 1989 TR Messinger & Rowe & Henry, A Divide-and-Conquer Algorithm for the Automatic Layout of Large Directed Graphs 1989 TR Vardi, On the Complexity of Epistemic Reasoning 1989 TR Dolev & Halpern & Simmons & Strong, Dynamic Fault-tolerant Clock Synchronization 1989 TR Kolaitis & Vardi, 0-1 Laws and Decision Problems for Fragments of Second-order Logic 1989 TR Vardi, Endmarkers Can Make a Difference 1989 TR Dai, Size-Depth Trade-offs for Synchronous Strictly Non-blocking Fixed Ratio Concentrators 1989 TR Bach & Driscoll & Shallit, Factor Refinement 1989 TR Knight, A Gentle Introduction to Subsymbolic Computation: Connectionism for the A.I. Researcher 1989 TR Leivant, Inductive Definitions over Finite Structures 1989 TR Menzilcioglu & Kung & Song, Comprehensive Evaluation of a Two-dimensional Configurable Array 1989 TR Leivant, Contracting Proofs to Programs 1989 TR Pothen & Sun, Compact Clique Tree Data Structures in Sparse Matrix Factorizations 1989 TR Joseph & Sitharam, Kolmogorov Complexity, Restricted Nondeterminism and Generalized Spectra 1989 TR Yang & Horwitz & Reps, A New Program Integration Algorithm 1989 TR Fischer & Mauney, A Simple, Fast, and Effective LL(1) Error Repair Algorithm 1989 TR Kalantari, Derivation of a Generalized and Strengthened Jordan Theorem from Generalized Karmarkar Potenial and Logarithmic Barrier Functions 1989 TR Kalantari, Generalized of Karmarkar's Algorithm to Convex Homogeneous Functions 1989 TR Dobkin & Souvaine, Detecting the Intersection of Convex Objects in the Plane 1989 TR Allender, Limitations of the Upward Separation Technique 1989 TR Nelken, Parallelization for MIMD Multiprocessors with Applications to Linear Algebra Algorithms 1989 TR Allender & Beigel & Hertrampf & Homer, A Note on the Almost-Everywhere Hierarchy for Nondeterministic Time 1989 TR Mittleman & Souvaine, Shortest Area-Bisector of a Convex Polygon 1989 TR Chvatal & Sun, Recognizing Dart-free Perfect Graphs 1989 TR Allender & Hemachandra, Lower Bounds for the Low Hierarchy 1989 TR Sharir, A Note on the Papadimitriou-Silverberg Algorithm for Planning Optimal Piecewise-linear Motion of a Ladder 1989 TR Aronov, Combinatorial and Algorithmic Analysis of Space Decomposition Problems 1989 TR Hirst, A New Algorithm Solving Membership of Extended Regular Expressions 1989 TR Cybenko, Designing Neural Networks 1989 TR Bramley & Chen & Meier & Sameh, On Some Parallel Preconditioned CG Schemes 1989 TR Impagliazzo & Luby, Pseudo-random Number Generation from ANY One-way Function 1989 TR Beame & Luby, Parallel Search for Maximal Independence Given Minimal Dependence 1989 TR Ben-David & Chor & Goldreich & Luby, Towards a Theory of Average Case Complexity 1989 TR Luby & Rackoff, A Study of Password Security 1989 TR Chen & Shin, Fault-tolerant Routing in Hypercube Multicomputers Using Depth-First Search 1989 TR Dagum, A Linear-time Algorithm for Enumerating Perfect Matchings in Skew Bipartite Graphs 1989 TR Cleve & Paul Dagum, A Constructive Lower Bound for the Ramsey Number R(3,t) 1989 TR Frederickson & Guan, Preemptive Ensemble Motion Planning on a Tree 1989 TR Frederickson & Guan, Nonpreemptive Ensemble Motion Planning on a Tree 1989 TR Gibbons & Karp & Miller & Soroker, Subtree Isomorphism is in Random NC 1989 TR Frederickson, Planar Graph Decomposition and All Pairs Shortest Paths 1989 TR Dobkin & Guibas & Hershberger & Snoeyink, An Efficient Algorithm for Finding the CSG Representation of a Simple Polygon 1989 TR Cardelli & Donahue & Glassman & Jordan & Kalsow & Nelson, Modula-3 Report 1989 TR Brown & Nelson, IO Streams: Abstract Types, Real Programs 1989 TR Neiger & Sam Toueg, Automatially Increasing the Fault-tolerance of Distributed Systems 1989 TR Styer & Peterson, Tight Bounds for Shared Memory Symmetric Mutual Exclusion Problems 1989 TR Burns & Peterson, The Ambiguity of Choosing 1989 TR Karasick & Lieber & Nackman, Efficient Delaunay Triangulation Using Rational Arithmetic 1989 TR Kranakis & Krizanc, Computing Boolean Functions on Anonymous Networks 1989 TR Kirousis & Kranakis, A Survey of Concurrent Readers and Writers 1989 TR Tromp, How to Construct an Atomic Variable 1989 TR Klop & Middeldorp, Sequentiality in Orthogonal Term Rewriting Systems 1989 TR Benaloh & Leichter, Generalized Secret Sharing and Monotone Functions 1989 TR Derome, A New Search Time Update Time Tradeoff for the Implicit Dictionary 1989 TR Shaw & Giuse & Reddy, What a Software Engineer Needs To Know: I. Program Volcabulary 1989 TR Barklund & Millroth, A Parallel Unification Algorithm 1989 TR Ramsay, Extended Graph Unification 1989 TR Ramsay, The Logic of 'Most' 1989 TR Condon & Lipton, Upper Bounds on the Complexity of Space Bounded Interactive Proofs 1989 TR Toda, On the Power of #P Functions 1989 TR Toda, Restricted Relativizations of Probabilistic Polynomial-Time 1989 TR Toda, PP is le^p_T-Hard for the Polynomial-Time Hierarchy 1989 TR Annexstein & Baumslag & Rosenberg, Group Action Graphs and Parallel Architectures (Revised Version) 1989 TR Lamport, The Part-Time Parliament 1989 TR Sen, Finding an Approximate-Median with High Probability in Constant Parallel Time 1989 TR Reingold & Dershowitz, Calendrical Calculations 1989 TR Shamir, IP = PSPACE (preliminary version) 1989 TR Lund & Fortnow & Karloff & Nisan, The Polynomial Time Hierarchy has Interactive Proofs (Note) 1989 TR Seymour & Thomas, Graph Searching, and a Minimax Theorem for Tree-width 1989 TR Blair, The Computational Complexity of Multi-level Linear Programs 1989 TR Lee, Alternating Iterative Arrays (thesis) 1989 TR Cypher, An O(log^1.5 N) Time Algorithm for Sorting on Hypercubes and Related Computer 1989 TR Lam & Ruzzo, The Power of Parallel Pointer Manipulation 1989 TR Belew, Evolution, Learning and Culture: Computational Metaphors for Adaptive Algorithms 1989 TR Goldberg & Grigoriadis & Tarjan, Efficiency of the Network Simplex Algorithm for the Maximum Flow Problem 1989 TR Mason & Talcott, A Sound and Complete Axiomatization of Operational Equivalence Between Programs with Memory 1989 TR Goldberg & Tardos & Tarjan, Network Flow Algorithms 1989 TR Vavasis, Complexity of Fixed Point Computations 1989 TR Floyd & Knuth, Addition Machines 1989 TR Knuth & Rokicki & Samuel, METAFONTware 1989 TR Goldberg & Plotkin & Shmoys & Tardos, Interior-Point Methods in Parallel Computation 1989 TR Mayr & Plaxton, Pipelined Parallel Computations, and Sorting on a Pipelined Hypercube 1989 TR Sundar, Twists, Turns, Cascades, Deque Conjecture, and Scanning Theorem 1989 TR Shavlik, Acquiring Recursive and Iterative Concepts with Explanation-based Learning 1989 TR Steinbery & Solomon, Searching Game Trees in Parallel 1989 TR Setiono, An Interior Dual Proximal Point Algorithm for Linear Programs 1989 TR Morales, Inductive Learning of First-order Horn Clauses 1989 TR Li & Tromp & Vitanyi, How To Share Concurrent Wait-free Variables 1989 TR Li & Vitanyi, A New Approach to Formal Language Theory by Kolmogorov Complexity 1989 TR Lamport, The Part-time Parliament 1989 TR Milosavljevic, A Model of Learning Based on the Principle of Cognitive Economy 1989 TR Edelson & Pohl, C++: Solving C's Shortcomings? 1989 TR Kipnis, Priority Arbitration with Busses (Extended Abstract) 1989 TR Fulk, Robustly Outdoing Identification by Enumeration 1989 TR Fulk & Jain, Approximate Inference and Scientific Method 1989 TR Akl, Reflections on a Parallel Model of Computation 1989 TR Allouche & Shallit, The Ring of k-Regular Sequences (Rough Draft) 1989 TR Johnson, A Catalog of Complexity Classes 1989 TR Kedem & Landau & Palem, Optimal Parallel Algorithms for Matching Problems 1989 TR Jain, Effects of Inaccurate Information and Additional Information on Inductive Inference 1989 TR Hemachandra & Wechsung, Using Randomness To Characterize the Complexity of Computation 1989 TR Sanchis, Language Instance Generation and Test Case Construction for NP-Hard Problems 1989 TR Dietz, Elimination of Amortization from Breu's Algorithm 1989 TR Marlowe & Ryder, An Efficient Hybrid Algorithm for Incremental Data Flow Analysis 1989 TR Allender, A Note on the Power of Threshold Circuits 1989 TR Capoyleas, Clamping of Polygonal Objects 1989 TR Allender & Wilson, Downward Translations of Equality 1989 TR Paterson & Yao, Efficient Binary Space Partitions for Hidden-Surface Removal and Solid Modeling 1989 TR Iwano, An Improvemnt of Goldberg, Plotkin, and Vaidja's Maximal Node Disjoint Paths Algorithm 1989 TR Lorie & Young, A Low Communication Sort Algorithm for a Parallel Database Machine 1989 TR Vardi, Automata Theory for Database Theoreticians 1989 TR Lingas, Voronoi Diagrams with Barriers and the Shortest Diagonal Problems 1989 TR Lingas & Syslo, A Polynomial-Time Algorithm for Subgraph Isomorphism of Two-Connected Series-Parallel Graphs 1989 TR Lingas, Greedy Triangulation Can Be Efficiently Implemented in the Average Case 1989 TR Lingas, Subgraph Isomorphism for Connected Graphs of Bounded Valence and Bounded Separator Is in NC 1989 TR Levcopoulos & Katajainen & Lingas, An Optimal Expected-Time Parallel Algorithm for Voronoi Diagrams 1989 TR Djidjev & Lingas & Sack, An O(n log n) Algorithm for Computing a Link Center in a Simple Polygon 1989 TR Dahlhaus & Karpinski & Lingas, A Parallel Algorithm for Maximum Matching in Planar Graphs 1989 TR Lingas, An Efficient Parallel Algorithm for Planar Directed Reachability 1989 TR McGeoch & Sleator, A Strongly Competitive Randomized Paging Algorithm 1989 TR Chrisman, Extending the Valiant Framework To Detect Incorrect Bias 1989 TR Kung, Network-based Multicomputers: Redefining High Performance Computing in the 1990s 1989 TR Teng, Matching Randomly in Parallel 1989 TR Kunde, Bounds for t-Selection and Related Problems on Grids of Processors 1989 TR Loui & Luginbuhl, Efficient On-line Simulations of Tree Machines and Multidimensional Turing Machines by Random Access Machines 1989 TR Beaver & Feigenbaum, Encrypted Queries to Multiple Oracles (Extended Abstract) 1989 TR Boppana, The Average-Case Parallel Complexity of Sorting (to appear in IPL) 1989 TR Amir & Landau & Vishkin, Efficient Pattern Matching with Scaling 1989 TR Grahne, The Problem of Incomplete Information in Relational Databases 1989 TR Satyanarayanan, A Survey of Distributed File Systems 1989 TR Anantharaman, A Delay Insensitive Regular Expression Recognizer 1989 TR Jacobson, Succinct Static Data Structures 1989 TR Browne, Automatic verification of Finite State Machines Using Temporal Logic 1989 TR Teng, Space Efficient Processor Identity Protocols 1989 TR Bruschi & Joseph & Young, A Structural Overview of NP Optimization Problems 1989 TR Allender, The Generalized Kolmogorov Complexity of Sets 1989 TR Nisan, Using Hard Problems to Create Pseudorandom Generators 1989 TR Peleg, Sparse Graph Partitions 1989 TR Upfal, An O(log N) Deterministic Packet Routing Scheme 1989 TR Feldman, Finite-state Machines (A Survey) 1989 TR Manna & Pnueli, Completing the Temporal Picture 1989 TR Harel & Kahana, On Statecharts with Overlapping 1989 TR Harel, A Thesis for Bounded Concurrency 1989 TR Peleg, Distance-dependent Distributed Directories 1989 TR Moitra, Efficient Parallel Algorithms for Covering Binary Images 1989 TR Bilardi & Moitra, Time Lower Bounds for CREW-PRAM Computation of Monotone Functions 1989 TR Panangaden & Taylor, Concurrent Common Knowledge: A New Definition of Agreement for Asynchronous Systems 1989 TR Volpano, Towards a Notion of Module for Data Abstraction 1989 TR Salton & Buckley, On the Automatic Generation of Content Links in Hypertext 1989 TR Hartmanis, Godel, von Neumann and the P=?NP Problem 1989 TR Haldar & Subramanian & Gries, One-bounded Mutual Exclusion Using Two Blocked-set Binary Semaphores and Two Shared Bits 1989 TR Arkin & Chew & Huttenlocher & Kedem & Mitchell, An Efficiently Computable Metric for Comparing Polygonal Shapes 1989 TR Chang & Kadin, The Boolean Hierarchy and the Polynomial Hierarchy: A Closer Connection 1989 TR Khuller, Parallel Algorithms for the Subgraph Homeomorphism Problem 1989 TR McAllester & Panangaden & Shanbhogue, Nonexpressibility of Fairness and Signaling 1989 TR Dubhashi, On p-Separability 1989 TR Novick, NC Algorithms for the Clique Separator Decomposition 1989 TR Chrobak & Naor & Novick, Using Bounded Degree Spanning Trees in the Design of Efficient Algorithms on Claw Free Graphs 1989 TR Salton, A Syntactic Approach to Automatic Book Indexing 1989 TR Yang, An Improved Algorithm for Labeling Connected Components in a Binary Image 1989 TR Constable & Howe, Implementing Metamathematics as an Approach to Automatic Theorem Proving 1989 TR Chew, Guaranteed-quality Triangular Meshes 1989 TR Higham, Exploiting Fast Matrix Multiplication within the Level 3 BLAS 1989 TR Wong & Yao, Information Retrieval Based on Axiomatic Decision Theory 1989 TR Hopcroft & Huttenlocher, On Planar Point Matching under Affine Transformation 1989 TR Vazirani & Vazirani, The Two-processor Scheduling Problem is in Random NC 1989 TR Birman & Marzullo, The Role of Order in Distributed Programs 1989 TR Hartmanis & Ranjan, Space Bounded Computations: Review and New Separation Results 1989 TR Elster & Li, Hypercube Algorithms on the Polymorphic Torus 1989 TR Palmer, Computational Complexity of Motion and Stability of Polygons 1989 TR Narasimhan, The Maximum K-colorable Subgraph Problem 1989 TR Shoup, Removing Randomness from Computational Number Theory 1989 TR Shoup, A Theorem on Factoring Polynomials over Finite Fields 1989 TR Wolf, Nondeterministic Circuits, Space Complexity and Quasigroups 1989 TR Sorenson, Polylog Depth Circuits for Integer Factoring and Discrete Logarithms 1989 TR Vishkin, Deterministic Sampling for Fast Pattern Matching 1989 TR Hemachandra & Hoene & Siefkes, Polynomial-Time Functions Generate SAT: On P-Splinters 1989 TR Dietz, Fully Persistent Arrays 1989 TR Dietz, Optimal Algorithms for List Indexing and Subset Rank 1989 TR Dietz & Sleator, Two Algorithms for Maintaining Order in a List 1989 TR Sanchis, Language Instance Generation and Test Case Construction for NP-Hard Problems (thesis) 1989 TR Vitter & Flajolet, Average-case Analysis of Algorithms and Data Structures 1989 TR Savage & Wloka, A Parallel Algorithm for Channel Routing 1989 TR Lamport & Schneider, Pretending Atomicity 1989 TR Marlowe, Restarting Fixed Point Iteration: Sources of Imprecision 1989 TR Kalantari, Derivation of a Generalized and Strengthened Gordan Theorem from Generalized Karmarkar Potential and Logarithmic Barrier Functions 1989 TR Narasimhan, A Note on the Hamiltonian Circuit Problem on Directed Path Graphs 1989 TR Ferris, Parallel Solution of Extremely Large Knapsack Problems 1989 TR Bach, Number-theoretic Algorithms 1989 TR Bruschi & Joseph & Young, Strong Separation of the Boolean Hierarchy over RP 1989 TR Hartel & Smid & Torenvliet & Vree, A Parallel Functional Implementation of Range Queries 1989 TR Buhrman & Torenvliet, A Comparison of Reductions on Nondeterministic Space 1989 TR Li & Neufeglise & Torenvliet & van Emde Boas, On Space Efficient Simulations 1989 TR van Emde Boas, Machine Models and Simulations 1989 TR Smid, Dynamic Deferred Data Structures 1989 TR Kranakis & Krizanc & Meertens, Placing Mirrors in Grids 1989 TR Li & Vitanyi, Inductive Reasoning and Kolmogorov Complexity (preliminary version) 1989 TR Fiala & Greene, Data Compression with Finite Windows 1989 TR Demers & Gealy & Greene & Hauser & Irish & Larson & Manning & Shenker & Sturgis & Swinehart & Terry & Woods, Epidemic Algorithms for Replicated Database Maintenance 1989 TR Moser, A Logic of Knowledge and Belief for Reasoning about Computer Security 1989 TR Egecioglu & Koc, Parallel Prefix Computation with Few Processors 1989 TR Melliar-Smith & Moser, Broadcast Agreement Protocols for Distributed Systems 1989 TR Koc & Cappello, Systolic Arrays for Integer Chinese Remaindering 1989 TR Koc & Cappello & Gallopoulos, Decomposing Polynomial Interpolation for Systolic Arrays 1989 TR Razborov, Applications of Matrix Methods to the Theory of Lower Bounds in Computational Complexity 1989 TR Jain & Sharma, Recursion Theoretic Characterizations of Language Learning 1989 TR Hemachandra & Jain, On the Limitations of Locally Robust Positive Reductions 1989 TR Stolfi, Primitives for Computational Geometry (thesis) 1989 TR Guibas & Stolfi, Ruler, Compass, and Computer: The Design and 1989 TR Hemachandra & Jain, On Relativization and the Existence of Turing Complete Sets 1989 TR Birget, Proof of a Conjecture of R. Kannan, and Generalizations (revised and expanded) 1989 TR Lin & Shoham, Argument Systems: A Uniform Basis for Nonmonotonic Reasoning 1989 TR Kanatani, Hypothesizing and Testing Geometric Properties of Image Data 1989 TR Gibbons & Rytter, Optimally Edge-colouring Outerplanar Graphs is in NC 1989 TR Amir & Farach, The Whole Is Faster Than Its Parts: Efficient Matching of Nonrectangular Shapes 1989 TR Guibas & Stolfi, Ruler, Compass, and Computer: The Design and Analysis of Geometric Algorithm 1989 TR Broy & Nelson, Can Fair Choice Be Added to Dijkstra's Calculus? 1989 TR Burrows & Abadi & Needham, A Logic of Authentication 1989 TR Dyn & Ron, On Multivariate Polynomial Interpolation 1989 TR de Boor & Ron, On Multivariate Polynomial Interpolation 1989 TR Shavlik & DeJong, Learning in Mathematically-based Domains: Understanding and Generalizing Obstacle Cancellations 1989 TR Urquhart, The Complexity of Decision Procedures in Relevance Logic 1989 TR Khuller & Mitchell & Vazirani, Processor Efficient Parallel Algorithms for the Two Disjoint Paths Problem, and for Finding a Kuratowski Homeomorph 1989 TR Hartmanis, On the Importance of Being Pi_2-Hard 1989 TR Kozen & Tiuryn, Logics of Programs 1989 TR Zippel, Interpolating Polynomials from their Values 1989 TR Chew & Kedem, Placing the Largest Similar Copy of a Convex Polygon Among Polygonal Obstacles 1989 TR Zippel, An Explicit Separation of Relativised Random Polynomial Time and Relativised Deterministic Polynomial Deterministic Polynomial Time 1989 TR Gries & Schneider & Widom, Trace-based Network Proof Systems: Expressiveness and Completeness 1989 TR Beck, TransFig: Portable Figures for TeX 1989 TR Lister, A Discrete Neural Matrix Approach to the Traveling Salesman Problem with Low Connectivity 1989 TR Main & Black, Semantic Models for Total Correctness and Fairness 1989 TR Gabow & Tarjan, Almost-Optimum Parallel Speed-ups of Algorithms for Bipartite Matching and Related Problems 1989 TR Fulk & Jain, Learning in the Presence of Inaccurate Information 1989 TR Fulk & Jain, Open Problems in Systems that Learn 1989 TR Jain & Sharma, Knowledge of an Upper Bound on Grammar Size Helps Language Learning 1989 TR Jain & Sharma, Learning with an Infinitely Often Correct Teacher 1989 TR Birget, Proof of a Conjecture of R. Kannan, and Generalizations 1989 TR Kurtz & Mahaney & Royer, On the Structure of Complete Sets 1989 TR Chlebus & Diks & Hagerup & Radzik, New simulations between CRCW PRAMs 1989 TR Chlebus, Turing Machines with Access to History (to appear in INFCTRL) 1989 TR Chlebus, Parallel Iterated Bucket Sort (to appear in IPL) 1989 TR Maass & Slaman, The Complexity Types of Computable Sets (extended abstract) 1989 TR Maass & Slaman, Extensional Properties of Sets of Time Bounded Complexity (extended abstract) 1989 TR Dietzfelbinger & Maass & Schnitger, The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines 1989 TR Boppana, Amplification of Probabilistic Boolean Formulas 1989 TR Pitt & Warmuth, The Minimum Consistent DFA Problem Cannot Be Approximated Within Any Polynomial 1989 TR Markatos, Parallel Prefix in the Hypercube 1989 TR Beigel & Hemachandra & Wechsung, On the Power of Probabilistic Polynomial Time 1989 TR Ramshaw, Blossoms Are Polar Forms 1989 TR Stolfi, Primitives for Computational Geometry 1989 TR Drastal & Raatz, Empirical Results on Learning in an Abstraction Space 1989 TR Goldsmith, Polynomial Isomorphism and Near-testable Sets 1989 TR Kurtz & Mahaney & Royer, The Isomorphism Conjecture Fails Relative to a Random Oracle 1989 TR Goldsmith, Polynomial Isomorphisms and Near-Testable Sets (thesis) 1988 TR Sinclair, Randomized Algorithms for Counting and Generating Combinatorial Structures 1988 TR Ritchie, The Design and Implementation of an Interactive Proof Editor 1988 TR Cole, Algorithmic Skeletons: A Structured Approach to the Management of Parallel Computation 1988 TR Moggi, The Partial lambda-Calculus 1988 TR Masuda & Nakajima & Kashiwabara & Fujisawa, Efficient Algorithms for Finding Maximum Cliques of an Overlap Graph 1988 TR Masuda & Nakajima & Kashiwabara & Fujisawa, Crossing Minimization Linear Embedding of Graphs 1988 TR Basseville, Distance Measures for Signal Processing and Pattern Recognition 1988 TR Choi & Chwa, Finding the Largest Rectangle Contained in a Rectilinear Polygon 1988 TR Wilks, Philosophy of Language and Artificial Intelligence 1988 TR Palis & Shende, Sublinear Parallel Time Recognition of Tree Adjoining Languages 1988 TR Ma & Tao, Embeddings among Toruses and Meshes 1988 TR Ibarra, An Efficient All-Parses Systolic Algorighm for General Context-free Parsing 1988 TR Han & Igarashi & Truszczynski, Indexing Functions and Time Lower Bounds for Sorting on a Mesh-connected Computer 1988 TR Gopinath & Hennessy, Copy Elimination in Functional Languages 1988 TR Goguen, What is Unification? A Categorical View of Substitution, Equation and Solution 1988 TR Neuhold & Stonebraker, Future Directions in DBMS Research 1988 TR Muggleton & Buntine, Towards Constructive Induction in First-order Predicate Calculus 1988 TR Buntine & Stirling, Interactive Induction 1988 TR Bhatt & Chung & Leighton & Rosenberg, Universal Graphs for Bounded-degree Trees and Planar Graphs 1988 TR Barrington & Straubing & Therien, Non-uniform Automata over Groups 1988 TR Rosenberg, Shuffle-oriented Interconnection Networks 1988 TR Bhatt & Chung & Leighton & Rosenberg, Efficient Embeddings of Trees in Hypercubes 1988 TR Hong & Tan, Connectionist and Other Computation Models 1988 TR Jerrum & Sinclair, Fast Uniform Generation of Regular Graphs 1988 TR Jerrum & Sinclair, Approximating the Permanent 1988 TR Ritchie & Taylor, The Interactive Proof Editor: An Experiment in Interactive Theorem 1988 TR Perlman, Network Layer Protocols with Byzantine Robustness 1988 TR Berger, Data Structures for Removing Randomness 1988 TR Plotkin, Graph-theoretic Techniques for Parallel, Distributed, and Sequential Computation 1988 TR Kaliski, Elliptic Curves and Cryptography: A Pseudorandom Bit Generator and Other Tools 1988 TR Rosenberg, Graph Embedding 1988: Recent Breakthroughs, New Directions 1988 TR Aggarwal & Wein, Computational Geometry 1988 TR Leighton & Leiserson & Maggs & Plotkin & Wein, Theory of Parallel and VLSI Computation 1988 TR Klein, Efficient Parallel Algorithms for Planar, Chordal, and Interval Graphs 1988 TR Leiserson & Saxe, Retiming Synchronous Circuitry 1988 TR Gifford, Natural Random Numbers 1988 TR Awerbuch & Bar-Noy & Linial & Peleg, Memory-balanced Routing Strategies 1988 TR Goldman, A Space Efficient Greedy Triangulation Algorithm 1988 TR Awerbuch & Goldreich & Peleg & Vainish, A Tradeoff between Information and Communication in Broadcast Protocols 1988 TR Lynch & Meritt & Weihl & Fekete, A Theory of Atomic Transactions 1988 TR Welch, Simulating Synchronous Processors 1988 TR Goldberg & Plotkin & Vaidya, Sublinear-time Parallel Algorithms for Matching and Related Problems 1988 TR Goldberg & Plotkin & Shannon, Parallel Symmetry-breaking in Sparse Graphs 1988 TR Lynch & Mansour & Fekete, The Data Link Layer: Two Impossibility Results 1988 TR Meyer & Cosmadakis, Semantical Paradigms: Notes for an Invited Lecture 1988 TR Greenberg & Heath & Rosenberg, Optimal Embedding of the FFT Graph in the Hypercube 1988 TR Bhatt & Chung & Hong & Leighton & Rosenberg, Optimal Simulations by Butterfly Networks 1988 TR Blair & England & Thomason, Cliques and their Separators in Triangulated Graphs 1988 TR Briggs & Sale, Fast Fourier Transforms on Multiprocessor Architectures 1988 TR Radack, Tidy Drawing of M-ary Trees 1988 TR Lewis, Some Learnability Results for Analogical Generalization 1988 TR McMillan & Smolensky, Analyzing a Connectionist Model as a System of Soft Rules 1988 TR McBryan, New Architectures: Performance Highlights and New Algorithms 1988 TR Larmore, Length Limited Coding and Optimal Height-Limited Binary Trees 1988 TR Ng & Hirschberg, Lower Bounds for the Stable Marriage Problem and its Variants 1988 TR Shaffer & Samet, Set Operations for Unaligned Linear Quadtrees 1988 TR Cai & Hemachandra, Enumerative Counting is Hard 1988 TR Michael, Efficient Protocols for Attaining Common Knowledge and Simultaneous Byzantine Agreement 1988 TR Immerman & Lander, Descibing Graphs: A First-order Approach to Graph Canonization 1988 TR Cai, On Projections of Determinant to Permanent 1988 TR Fischer & Zuck, Reasoning about Uncertainty in Fault-Tolerant Distributed Systems 1988 TR Angluin, Requests for Hints that Return No Hints 1988 TR Angluin, Negative Results for Equivalence Queries 1988 TR Cai & Hartmanis, The Complexity of the Real Line is a Fractal 1988 TR Core & Edmiston & Saltz & Smith, Parallel Processing of Biological Sequence Comparison Algorithms 1988 TR Gropp & Ipsen, Recursive Mesh Refinement on Hypercubes 1988 TR Cook, Functional Interpretations of Feasibly Constructive Arithmetic 1988 TR Bailey & Snyder, Towards a Unified Theory of the Parallelism Available for Circuit Simulation 1988 TR Celis, External Robin Hood Hashing 1988 TR Merrill & Port, Fractally Configured Neural Networks 1988 TR Aggarwal & Anderson & Kao, Parallel Depth-First Search in Directed Graphs 1988 TR Aggarwal & Anderson & Kao, Parallel Depth-First Search in General Directed Graphs 1988 TR Mumme, Storage Capacity of the Linear Associator: Beginnings of a Theory of Computational Memory 1988 TR Greenlaw, The Complexity of Parallel Computations: Inherently Sequential Algorithms and P-Complete Problems 1988 TR Lam, Some Topics in Communication Complexity Theory 1988 TR Almquist & McKenzie & Sloan, Parallel Algorithms for Searching Game Trees 1988 TR Choo & Chen, A Theory of Parallel-Program Optimization 1988 TR Johnsson & Ho & Jacquemin & Ruttenberg, Systolic FFT Algorithms on Boolean Cube Networks 1988 TR Ho & Johnsson, Embedding Hyper-pyramids into Hypercubes 1988 TR He, Efficient Parallel Algorithms for Series Parallel Graphs 1988 TR Taubner, The Finite Representation of Abstract Programs by Automata and Petri Nets 1988 TR Humphrey, Efficient Computation of Voronoi Diagrams 1988 TR Fox & Chen & Heath & Datta, A More Cost Effective Algorithm for Finding Perfect Hash Functions 1988 TR Berman & Carter & Day, The Fanout Problem: From Theory to Practice 1988 TR Clarkson & Edelsbrunner & Guibas & Sharir & Welzl, Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces 1988 TR Goodman & Sharir, Common Tangents and Common Transversals 1988 TR Yap, A Double Exponential Lower Bound for Degree-compatible Grobner Bases 1988 TR Yap, A New Lower Bound Construction for the Word Problem for Commutative Thue Systems 1988 TR Aronov & Fortune & Wilfong, The Furthest-Site Geodesic Voronoi Diagram 1988 TR Cox & Yap, On-line Motion Planning: Case of a Planar Rod 1988 TR Palis & Shende, Upper Bounds on Recognition of a Hierarchy of Non-context-free Languages 1988 TR Nadathur & Miller, An Overview of Prolog 1988 TR Shin & Peng, Static Allocation of Periodic Tasks with Precedence Constraints in Distributed Real-time Systems 1988 TR Shin & Chang, Load Sharing in Distributed Real-time Systems with Broadcast of State Changese 1988 TR Bourlard & Wellekens, Links between Markov Models and Multilayer Perceptrons 1988 TR Blum, Designing Programs To Check Their Work 1988 TR Blum & Shub & Smale, On a Theory of Computation and Complexity over the Real Numbers: NP Completeness, Recursive Functions and Universal Machines 1988 TR Blum & Kannan, Program Correctness Checking ..and the Design of Programs that Check Their Work 1988 TR Duran, Concept Learning with Incomplete Data Sets 1988 TR Chow & Kim, Paper Like Interface for Eduational Applications 1988 TR Raghavan & Snir, Memory versus Randomization in On-line Algorithms 1988 TR Whitley & Shaner, Representation Issues in Genetic Algorithms 1988 TR Whitley, Applying Genetic Algorithms to Neural Net Learning 1988 TR Whitley & Starkweather, Genetic Algorithm Applications: Neural Nets, Traveling Salesmen and Schedules 1988 TR Regnier, Enumeration of Bordered Words 1988 TR Kirchner, Order-sorted Equational Unification 1988 TR Darondeau & Degano, Causal Trees 1988 TR Bloniarz & Ravi, An ..Lower Bound for Decomposing a Set of Points into Chains 1988 TR Bernhard & Hunt & Rosenkrantz, Compaction of Message Patterns into Space-efficient Representation for Multiprocessor Interconnection Networks 1988 TR Willard & Reif, Parallel Processing Can Be Harmful: The Unusual Behavior of Interpolation Search 1988 TR John Keohane & Stearns, Routing Linear Permutations through the Omega Network in Two Passes 1988 TR Hunt & Stearns & Ravi, SAT, Nonserial Dynamic Programming, Finite Algebra, and the Structure of NP 1988 TR Murray & Rosenthal, Short Proofs of the Pigeonhole Formulas Using Path Dissolution 1988 TR Rosenkrantz & Ravi, Improved Bounds for Algorithm-based Fault Tolerance 1988 TR Kapur & Musser & Narendran & Stillman, Semi-Unification 1988 TR Blair & Ravi, On Clique Graphs of Undirected Graphs 1988 TR Stearns & Hunt, Power Indices and Easier NP-Complete Problems 1988 TR Wee & Chaiken & Willard, Angle Restricted Nearest Neighbors and its Applications to Proximity Problem 1988 TR Wee & Chaiken & Willard, General Metrics and Angle Restricted Voronoi Diagrams 1988 TR Hunt & Stearns, On the Complexity of Satisfiability Problems for Algebraic Structures 1988 TR Hunt & Ravi & Stearns, Separators, Graph Homomorphisms and Chromatic Polynomials 1988 TR Awerbuch & Cidon & Kutten, Communication-optimal Maintenance of Dynamic Trees or Memory Helps To Reduce Communication 1988 TR Israeli, Bounded Time-Stamps 1988 TR Li & Vitanyi, Two Decades of Applied Kolmogorov Complexity 1988 TR Sabot, An Architecture-independent Model for Parallel Programming 1988 TR Krizanc, Merging and Routing on Parallel Models of Computation 1988 TR Bestavros & McKeeman, Parallel Bin Packing Using First-Fit and K-Delayed Best-Fit Heuristics 1988 TR Beaver, Secure Multiparty Protocols Tolerating Half Faulty Processors 1988 TR Boyar & Frandsen & Sturtivant, An Algebraic Model for Bounding Threshold Circuit Depth 1988 TR Frandsen & Sturtivant, The Depth Efficacy of Unbounded Characteristic Finite Field Arithmetic 1988 TR Frandsen & Sturtivant, An Exact and Efficient Implementation of Threshold Gates with Arbitrary Real Weights 1988 TR Knudsen & Madsen, Teaching Object-oriented Programming is More than Teaching Object-oriented Programming Languages 1988 TR Matthews & Sturtivant, A Note on the Complexity of the Transpose of a Matrix 1988 TR Damgard, The Application of Claw Free Functions in Cryptography 1988 TR Nylen, List and Tree Matching on Fine-grained Parallel SIMD Computers 1988 TR Nishimura, Complexity Issues in Tree-based Version Control 1988 TR Pan, Fast and Efficient Parallel Evaluation of the Zeros of a Polynomial Having Only Real Zeros 1988 TR Pan, New Methods for Computations with Toeplitz-like Matrices 1988 TR Pan, On Some Computations with Dense Structured Matrices 1988 TR Pan, Fast and Efficient Parallel Inversion of Toeplitz and Block Toeplitz Matricee 1988 TR Pan & Schreiber, An Improved Newton Iteration for the Generalized Inverse of a Matrix, with Applications 1988 TR Barak & Galler & Farber, A Holographic File System for a Multicomputer with Many Disk Nodes 1988 TR Knoblock, A Formal Metalanguage for NUPRL 1988 TR Cooper, Probabilistic Inference Using Belief Networks Is NP-Hard 1988 TR Bar-Yehuda & Etzion, Connections between Two Cycles - A New Design of Dense Processor Interconnection Networks 1988 TR Even & Rajsbaum, Lack of Global Clock Does Not Slow Down the Computation in Distributed Network 1988 TR Hofri & Shachnai, Self-Organizing Lists and Independent References - A Statistical Synergy 1988 TR Cook & Kissin, Energy Bound on Parity 1988 TR Korach & Ostfeld, Recognition of DFS Trees: Sequential and Parallel Algorithms with Refined Verifications 1988 TR Korach & Penn, Tight Integral Duality Gap in the Chinese Postman Problem 1988 TR Goldreich, Towards a Theory of Average Case Complexity 1988 TR Ng & Hirschberg, Complexity of the Stable Marriage and Stable Roommate Problems in Three Dimensions 1988 TR Guibas & Sharir & Sifrony, On the General Motion Planning Problem with Two Degrees of Freedom 1988 TR Sharir & Sifrony, Coordinated Motion Planning for Two Independent Robots 1988 TR Chazelle & Sharir, An Algorithm for Generalized Point Location and Its Applications 1988 TR Hong, Gap Theorems 1988 TR Edelsbrunner & Guibas & Hershberger & Seidel & Sharir & Snoeyink & Welzl, Implicitly Representing Arrangements of Lines or Segments 1988 TR Aronov & Fortune & Wilfong, Minimum Speed Motions 1988 TR Aronov, On the Geodesic Voronoi Diagram of Point Sites in a Simple Polygon 1988 TR Aronov & Sharir, Triangles in Space or Building and Analyzing Castles in the Air 1988 TR Kedem & Landau & Palem, Optimal Parallel Algorithms for Matching Problems 1988 TR Toussaint, Snapshots of Computational and Discrete Geometry 1988 TR Cailton, Constrained Back-Propagation, An Algorithm for Learning in Artificial Neural Networks 1988 TR Ratner & Warmuth, The (n2 - 1) Puzzle and Related Relocation Problems 1988 TR Pitt & Warmuth, Prediction Preserving Reducibility 1988 TR Bodlaender & Moran & Warmuth, The Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous Case 1988 TR Ehrenfeucht & Haussler & Kearns & Valiant, A General Lower Bound on the Number of Examples Needed for Learning 1988 TR Haussler & Kearns & Littlestone & Warmuth, Equivalence of Models for Polynomial Learnability 1988 TR Milosavljevic, Learning in the Presence of Background Knowledge 1988 TR Levinson, Towards More Optimal Vertex Covers 1988 TR Moran & Warmuth, Gap Theorems for Distributed Computation 1988 TR Haussler, Learning Conjunctive Concepts in Structural Domains 1988 TR Baum & Haussler, What Size Net Gives Valid Generalization? 1988 TR Kang & Wong, Distributed and Fail-safe Routing Algorithms in Toroidal-based Metropolitan Area Network 1988 TR Jha & Slutzki, On Minimum Cardinality Maximal Independent Sets of a Hypercube 1988 TR Lutz, Almost Everywhere High Nonuniform Complexity 1988 TR Howell & Rosier & Yen, Global and Local Views of State Fairness 1988 TR Das & Deo & Prasad, Two Minimum Spanning Forest Algorithms on Hypercube Computers 1988 TR Das & Deo & Prasad, Parallel Graph Algorithms for Hypercube Computers 1988 TR Couzi, Distributed Computing - A Survey 1988 TR Kibler & Aha, Comparing Instance-averaging with Instance Saving Learning Algorithms 1988 TR Canny, Some Algebraic and Geometric Computations in PSPACE 1988 TR Canny, Generalized Characteristic Polynomials 1988 TR Segal & Sequin, Maintaining Topology in Geometric Descriptions with Numerical Uncertainty 1988 TR Coker, Internals of VORTEX: The Source Editor 1988 TR Rudich, Limits on the Provable Consequences of One-way Functions 1988 TR Caianiello, Inductive Infeerence and Encoding 1988 TR Cantone, Decision Procedures for Elementary Sublanguages of Set Theory. X. Multilevel Syllogistic Extended by the Singleton and Powerset Operators 1988 TR Cantone & Schwartz, Decision Procedures for Elementary Sublanguages of Set Theory. XI. Multi-level Syllogistic Extended by Some Elementary Map Constructs 1988 TR Cantone & Cutello & Ferro, Decision Procedures for Elementary Sublanguages of Set Theory. XIV. Three Languages Involving Rank Related Constructs 1988 TR Cantone & Cutello, Some Decidability Results on Quantified Sublangauges of Set Theory 1988 TR Sundar, Worst Case Data Structures for the Priority Queue with Attrition 1988 TR Widlund, Optimal Iterative Refinement Methods 1988 TR Cantone & Omodeo & Policriti, The Automation of Syllogistic. II. Optimization and Complexity Issues 1988 TR Bernstein, Some Comments on Highly Dynamic Network Routing 1988 TR Souvaine & Van Wyk, Clamping a Polygon 1988 TR Rabin, Robust Sharing of Secrets When the Dealer is Honest or Cheating 1988 TR Clarkson & Edelsbrunner & Guibas & Sharir & Welzl, Combinatorial Complexity Bounds and Arrangements of Curves and Surfaces 1988 TR Reingold & Shen, More Nearly Optimal Algorithms for Unbounded Searching 1988 TR Edelsbrunner & Guibas & Sharir, The Complexity of Many Cells in Arrangements of Planes and Related Problems 1988 TR Edelsbrunner & Guidas & Pach & Pollack & Seidel & Sharir, Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms 1988 TR Paterson & Razborov, The Set of Minimal Braids Is Co-NP-Complete 1988 TR Gibbons, Dynamic Expression Evaluation Is One of a Class of Problems Which Are Efficiently Solvable on Mesh-connected Computers 1988 TR Brisson, Representing Geometric Structures in d Dimensions: Topology and Order 1988 TR Beame, A General Sequential Time-Space Tradeoff for Finding Unique Elements 1988 TR Woll, Zero Knowledge Proofs and Secret Sharing Problems 1988 TR Kim, Parallel Computational Geometry of Rectangles 1988 TR Greenlaw, Parallel Complexity Results about Greedy Breadth-first Search 1988 TR Goldberg & Tarjan, A Parallel Algorithm for Finding a Blocking Flow in an Acyclic Network 1988 TR Tarjan, Efficiency of the Primal Network Simplex Algorithm for the Minimum-cost Circulation Problem 1988 TR Fung & Nicholl & Tarjan & Van Wyk, Simplified Linear-time Jordan Sorting and Polygon Clipping 1988 TR Dobkin & Silver, Applied Computational Geometry: Towards Robust Solutions of Basic Problems 1988 TR Goldberg & Grigoriadis & Tarjan, Efficiency of the Network Simplex Algorithm for the Maximum Flow Problem 1988 TR Golin, Probabilistic Analysis of a Closest Pair Algorithm 1988 TR Dobkin & Suri, Maintenance of Geometric Extrema 1988 TR Myers, A Four-Russians Algorithm for Regular Expression Pattern Matching 1988 TR Wu & Manber, Algorithms for Generalized Matching 1988 TR Garcia-Molina & Kogan, An Implementation of Reliable Broadcast Using an Unreliable Multicast Facility 1988 TR Gibbons & Karp & Ramachandran & Soroker & Tarjan, Transitive Reduction in Parallel Via Branchings 1988 TR Friedman, On the Second Eigenvalue and Random Walks in Random d-Regular Graphs 1988 TR Heng, Two-dimensional Compaction: Computing the Shape Function of a Slicing Layout 1988 TR Barbara & Lipton, A Class of Randomized Strategies for Low-cost Comparison of File Copies 1988 TR Silver, Geometry, Graphics, and Numerical Analysis 1988 TR Lipton & Sandberg, PRAM: A Scalable Shared Memory 1988 TR Chazelle, A Deterministic View of Random Sampling and its Use in Geometry 1988 TR Yao, On Straight Selection Sort 1988 TR Flajolet & Knuth & Pittel, The First Cycles in an Evolving Graph 1988 TR Morain, Implementation of the Atking-Goldwasser-Kilian Primality Testing Algorithm 1988 TR Lang, Complete Evaluation of Horn Clauses: An Automata Theoretic Approach 1988 TR Vitter & Lin, Learning in Parallel 1988 TR Kanellakis, Elements of Relational Database Theory 1988 TR Cosmadakis & Gaifman & Kanellakis & Vardi, Decidable Optimization Problems for Database Logic Programs 1988 TR Bhattacharya & Toussaint, Computing Minimal Sets of External Visibility 1988 TR Toussaint, Computing Geodesic Properties inside a Simple Polygon 1988 TR Avis & Imai, Locating a Robot with Angle Measurements 1988 TR LaForge, Extremally Fault Tolerant Arrays 1988 TR Shermer, Link Guarding Simple Polygons 1988 TR Toussaint, An Output-complexity-sensitive Polygon Triangulation Algorithm 1988 TR Toussaint, Computing Visibility Properties of Polygons 1988 TR Toussaint, On Separating Two Simple Polygons by a Single Triangulation 1988 TR Sack & Toussaint, Guard Placement in Rectilinear Polygons 1988 TR Souvaine & VanWyck, Clamping a Polygon 1988 TR Smid & Overmars & Torenvliet & van Emde Boas, Maintaining Multiple Representations of Dynamic Data Structures 1988 TR van Lambalgen, Algorithmic Information Theory 1988 TR Smid, General Lower Bounds for the Partitioning of Range Trees 1988 TR Spaan & Torenvliet & van Emde Boas, Nondeterminism, Fairness and a Fundamental Analogy 1988 TR Smid & Overmars & Torenvliet & van Emde Boas, Multiple Representations of Dynamic Data Structures 1988 TR van Benthem, Time, Logic and Computation 1988 TR Smid, A Data Structure for the Union-Find Problem Having Good Single-Operation Complexity 1988 TR Marcus & Smith, A Note on the Determinants and Eigenvalues of Distance Matrices 1988 TR Moser & Melliar-Smith, Impossibility of Asynchronous Fault-tolerant Broadcast Protocols for Reaching Agreement 1988 TR Gunther & Bilmes, The Implementation of the Cell Tree: Design Alternatives and Performance Evaluation 1988 TR Hayes-Roth & Hewett & Washington & Hewett & Seiver, Distributing Intelligence within an Individual 1988 TR Shoham & Moses, Belief as Defeasible Knowledge 1988 TR Bar-Noy & Naor, Sorting, Minimal Feedback Sets and Hamilton Paths in Tournaments 1988 TR Gafni & Naor & Ragde, On Separating the EREW and CREW PRAM Models 1988 TR Knuth & Motwani & Pittel, Stable Husbands 1988 TR Shoham, Time for Action: On the Relation between Time, Knowledge, and Action 1988 TR Knuth, Concrete Mathematics Errata 1988 TR Pittel, The Average Number of Stable Matchings 1988 TR Manna & Pnueli, Specification and Verification of Concurrent Programs by (for all)-Automata 1988 TR Bennett & Edwards, A Graph Isomorphism Algorithm Using Pseudoinverses 1988 TR Butler, Computational Group Theory 1988 TR Butler & Cannon, The Design of Cayley--A Language for Modern Algebra 1988 TR Sullins, Distributed Learning: Motion in Constraint Space 1988 TR Webber & Dillencourt, Compressing Quadtrees via Common Subtree Merging 1988 TR Parker, Partial Order Programming: Extended Abstract 1988 TR Dolan & Smolensky, Implementing a Connectionist Production System Using Tensor Products 1988 TR Pearl, On Probability Intervals 1988 TR Paz & Schulhoff, Closure Algorithms and Decision Problems for Graphoids Generated by Two Undirected Graphs--Abridged Version 1988 TR Levin, Proofs in Three Envelops 1988 TR Homer & Selman, Oracles for Structural Properties: The Isomorphism Problem and Public-key Cryptography Extended Abstract 1988 TR Viscuso & Anderson & Spoehr, Representing Simple Arithmetic in Neural Networks 1988 TR Chang, On the Structure of Bounded Queries to Arbitrary NP Sets 1988 TR Moitra, Finding a Minimal Cover for Binary Images: An Optimal Parallel Algorithm 1988 TR Donald & Xavier, A Provably Good Approximation Algorithm for Optimal-Time Trajectory Planning 1988 TR Ierardi, Quantifier Elimination in the First-order Theory of Algebraically Closed Fields 1988 TR Hendrickson, Conditions for Unique Graph Embeddings 1988 TR Herley & Bilardi, Deterministic Simulations of PRAMs on Bounded Degree Networks 1988 TR Dickerson, Computing Polynomial Composition Factors and Inverses of Automorphisms in Polynomial Time 1988 TR Panangaden & Russell, A Category-theoretic Semantics for Unbounded Indeterminacy 1988 TR Vazirani & Vazirani, Random Polynomial Time Is Equal to Semi-Random Polynomial Time 1988 TR Fagin & Halpern & Vardi, A Model-theoretic Analysis of Knowledge 1988 TR Ajtai, Parity and the Pigeonhole Principle 1988 TR Varman & Iyer & Haderle, Parallel Merge on an Arbitrary Number of Processors 1988 TR Ramakrishnan & Sagiv & Ullman & Vardi, Proof-tree Transformation Theorems and their Applications 1988 TR Kuper & McAlon & Palem & Perry, An Efficient Parallel Algorithm for Anti-unification 1988 TR Capocelli & Santis, A Note on D-ary Huffman Codes 1988 TR Santis & Micali & Persiano, Non-interactive Zero-knowledge with Preprocessing 1988 TR Lm & Lam & Tiwari & Tompa, Tradeoffs Between Communication and Space 1988 TR Cahn, An Algorithm to Draw Networks and Graphs 1988 TR Vijayan, Generalization of Min-Cut Partitioning to Tree Structures and its Appliations 1988 TR Berman, Circuit Width, Register Allocation, and Reduced Function Graphs 1988 TR Capocelli & Santis, Improved Bounds on the Redundancy of Huffman Codes 1988 TR Capocelli, On the Redudancy of Optimal Codes with Limited Word Length 1988 TR Natarajan, A Parallel Algorithm for the Generalized Symmetric Eigenvalue Problem Using Fetch-and-Add Synchronization 1988 TR Apt, Efficient Computing of Least Fixpoints 1988 TR Lengauer, Towards Systolizing Compilation: An Overview 1988 TR Soparkar, Hopfield Nets--More Formally 1988 TR Fussell & Thurimella, Successive Approximation in Parallel Graph Algorithms 1988 TR Main & Mislove, Research Trends in Formal Semantics 1988 TR Yang Lu, A New Method of Automated Theorem Proving 1988 TR Karp & Ramachandran, A Survey of Parallel Algorithms for Shared-Memory Machines 1988 TR Kruskal & Rudolph & Snir, A Complexity Theory of Efficient Parallel Algorithms 1988 TR Ajtai & Wigderson, Deterministic Simulation of Probabilistic Constant Depth Circuits 1988 TR Denning, Computer Viruses 1988 TR Denning, Speeding Up Parallel Processing 1988 TR Choppy & Kaplan & Soria, Complexity Analysis of Term Rewriting Systems 1988 TR Inoue, A Model Theory for Hypothetical Reasoning 1988 TR Sakai, Toward Mechanization of Mathematics 1988 TR Yokomori, Learning Simple Languages in Polynomial Time 1988 TR Sakai & Aiba, CAL: A Theoretical Background of Constraint Logic Programming and its Applications 1988 TR Feldman, Time, Space and Form in Vision 1988 TR Kyburg, In Defense of Intervals 1988 TR Moran & Newman & Wolfstahl, Approximation Algorithms for Covering Graph by Vertex-Disjoint Paths of maof, Maximum Total Weight 1988 TR Etzion, On Pseudo-random Arrays Constructed from Patterns with Distinct Differences 1988 TR Etzion, On the Shuffle-Exchange Network as a Permutations Generator 1988 TR Taubenfeld & Katz & Moran, Impossibility Results in the Presence of Multiple Faulty Processes 1988 TR Babai & Moran, Proving Properties of Interactive Proofs by a Generalized Counting Technique 1988 TR Goldreich & Krawczyk & Luby, On the Existence of Pseudorandom Generators 1988 TR Tiomkin, Probabilistic Termination versus Fair Termination 1988 TR Sheinwald & Lempel & Ziv, Compression of Pictures by Finite State Encoders 1988 TR Goldreich & Micali & Wigderson, Proofs That Yield Nothing But Their Validity; All Languages in NP Have Zero-Knowledge Proofs 1988 TR Moran & Wolfstahl, Optimal Covering of Cacti by Vertex-Disjoint Paths 1988 TR Goldreich, Towards a Theory of Average Case Complexity (A Survey) 1988 TR Clote & Kranakis, Boolean Functions, Invariance Groups and Parallel Complexity 1988 TR Bezem, Completeness of Resolution by Transfinite Induction 1988 TR Fiat & Karp & Luby & McGeoch & Sleator & Young, Competitive Paging Algorithms 1988 TR Manasse & McGeoch & Sleator, Competitive Algorithms for Server Problems 1988 TR Pierce, A Taste of Category Theory for Computer Scientists 1988 TR Sipelstein & Smith & Tygar, Median Separators in d Dimensions 1988 TR Motwani & Raghunatham & Saran, Perfect Graphs and Orthogonally Convex Covers 1988 TR Sabatella, Barking Up the Wrong Tree: Why Optimizing Compilers Are Still Unable to Match Assembly Language 1988 TR Irani & Naor & Rubinfeld, On the Time and Space Complexity of Computation Using Write-Once Memory 1988 TR Blum & Raghavan, Program Correctness: Can One Test for It? 1988 TR Blum & Shub & Smale, On a Theory of Computation over the Real Numbers; NP Completeness, Recursive Functions and Universal Machines 1988 TR Corella, An Approach to the Mechanization of Set Theory 1988 TR Langdon, Further Developments in Lossless Gray-scale Image Compression 1988 TR Onton, Learning in Recursive Neural Networks 1988 TR Cristian, Probabilistic Clock Synchronization 1988 TR McCurley, Cryptographic Key Distribution and Computation in Class Groups 1988 TR Gallier & Narendran & Plaisted & Snyder, Rigid E-Unification: NP-Completeness and Applications to Equational Matings 1988 TR Felty & Miller, Proof Explanation and Revision 1988 TR Felty & Hager, Explaining Modal Logic Proofs 1988 TR Tao, Mapping Parallel Programs onto Parallel Systems with Torus and Mesh Based Communication Structures 1988 TR Abrahamson, On Achieving Consensus Using a Shared Memory 1988 TR Benson, Bialgebras: Some Foundations for Distributed and Concurrent Computation 1988 TR Langston & Stojmenovic, On a Proposed Divide-and-Conquer Minimal Spanning Tree Algorithm 1988 TR Fellows & Langston, On Well-Partial-Order Theory and Its Application to Combinatorial Problems of VLSI Design 1988 TR Fellows & Langston, Fast Search Algorithms for Graph Layout Permutation Problems 1988 TR Fellows & langston, On Search, Decision and the Efficiency of Polynomial-Time Algorithms 1988 TR Abrahamson & Fellows & Langston & Moret, Constructive Complexity 1988 TR Goldberg & Grigoriadis & Tarjan, Efficiency of the Network Simplex Algorithm for the Maximum Flow Problem 1988 TR Hayward & McDiarmid, Average Case Analysis of Heap Building by Repeated Insertion 1988 TR Lucas, Canonical Forms for Competitive Binary Search Tree Algorithms 1988 TR Lavault, Average Number of Messages for Distributed Leader Finding in Rings of Processors 1988 TR Camion, An Iterative Euclidean Algorithm 1988 TR OConnor, The Cycle Colouring Problem Is NP-Complete 1988 TR Pippenger, Developments in ``The Synthesis of Reliable Organisms from Unreliable Components'' 1988 TR Lutz, An Elementary Combinatorial Derivation of ``The'' Chernoff Bound 1988 TR Rich & Slutzki, The Complexity of a Counting Finite-State Automation 1988 TR Gallier & Narendran & Raatz & Snyder, Theorem Proving Using Equational Matings and Rigid E-Unification 1988 TR Norton, Julia Sets in the Quaternions 1988 TR Kalishki, Elliptic Curves and Cryptography: A Pseudorandom Bit Generator and Other Tools 1988 TR Moitra & Johnson, Parallel Algorithms for Maximum Matching and Other Problems on Interval Graphs 1988 TR Howe, Computational Metatheory in Nuprl 1988 TR Hartmanis & Chang & Kadin & Mitchell, Structural Complexity Column-Some Observations about Relativization of Space Bounded Computations 1988 TR Schmuck, The Use of Efficient Broadcast Protocols in Asynchronous Distributed Systems 1988 TR Griffin, Notational Definition and Top-Down Refinement for Interactive Proof Development Systems 1988 TR Mamrak & Joseph, Computerized Systems to Support Scholarly Writing: A Survey and Assessment 1988 TR Gries & Xue, the Hopcroft-Tarjan Planarity Algorithm, Presentations and Improvements 1988 TR Constable & Smith, Computational Foundations of Basic Recursive Function Theory 1988 TR Hartmanis, New Developments in Structural Complexity Theory 1988 TR Bilardi & Preparata, Characterization of Associative Operations with Prefix Circuits of Constant Depth and Linear Size 1988 TR Aiken, Compaction-based Parallelization 1988 TR Khuller, On Computing Graph Closures 1988 TR Belmonte, A Practical Attribute Grammar Circularity Test 1988 TR Gries & Burkhardt, Presenting an Algorithm to Find the Minimum Edit Distance 1988 TR Khuller, Extending Planar Graph Algorithms to K3,3-free Graphs 1988 TR Kadin, Restricted Turing Reducibilities and the Structure of the Polynomial Time Hierarchy 1988 TR Halpern & Vardi, The Complexity of Reasoning about Knowledge and Time: Synchronous Systems 1988 TR Schaffer, A Faster Algorithm to Recognize Undirected Path Graphs 1988 TR Rissanen, Coding and Complexity 1988 TR Rao & Kumar, Parallel Depth First Search, Part I: Implementation 1988 TR Kumar & Rao, Parallel Depth First Search, Part II: Analysis 1988 TR Pickover, A Ranking of the Ten Most Influential Scientists in History 1988 TR Fiat & Munro & Naor & Schaffer & Schmidt & Siegel, An Implicit Data Structure for Searching a Multikey Table in Logarithmic Time 1988 TR Milenkovic, Verifiable Implementations of Geometric Algorithms Using Finite Precision Arithmetic 1988 TR Dyer & Frieze & Kannan, A Random Polynomial Time Algorithm for Estimating Volumes of Convex Bodies 1988 TR Thornton, Links between Content and Information-Content 1988 TR Thornton, A Computational Model for the Data Compression Metaphor 1988 TR Royer & Case, Intensional Subrecursion and Complexity Theory 1988 TR Brooks, A Two-view Document Editor with User-definable Document Structure (thesis) 1988 TR Gasarch & Smith, Learning via Queries 1988 TR Amir & Beigel & Gasarch, Cheatable, P-terse, and P-superterse Sets 1988 TR Broder & Karlin, Bounds on the Cover Time 1988 TR Fortnow & Sipser, Probabilistic Computation and Linear Time 1988 TR Eppstein, Reset Sequences for Finite Automata with Application to Design of Parts Orienters 1988 TR Eppstein & Galil & Giancarlo, Speeding up Dynamic Programming with Application to the Computation of RNA Structure 1988 TR Eppstein & Galil & Giancarlo & Italiano, Sparse Dynamic Programming (Extended Abstract) 1988 TR Dwyer, Average-Case Analysis of Algorithms for Convex Hulls and Voronoi Diagrams 1988 TR Cook & Urquhart, Functional Interpretations of Feasibly Constructive Arithmetic 1988 TR McColl & Paterson, Planar Acyclic Computation 1988 TR Yao & Dobkin & Edelsbrunner & Paterson, Partitioning Space for Range Queries 1988 TR O'Connor, The Cycle Colouring Problem is NP-Complete 1988 TR OConnor, An Approximation to the One Time Pad 1988 TR Fagin & Halpern, Uncertainty, Belief and Probability 1988 TR Halpern & Vardi, Reasoning about Knowledge and Time in Asynchronous Systems 1988 TR Fagin & Halpern & Vardi, What Can Machines Know? On the Properties of Knowledge in Distributed Systems 1988 TR Howell & Rosier & Yen, A Taxonomy of Fairness and Temporal Logic Problems for Petri Nets 1988 TR Lutz, An Elementary Combinatorial Derivation of ``the'' Chernoff Bound 1988 TR Fernandez-Baca, Bad Examples for Maximum Flow Algorithms on Bipartite Networks 1988 TR Rich & Slutzki, The Complexity of a Counting Finite-state Automation 1988 TR Amarel, Artificial Intelligence and Design: Opportunities, Challenges, Research Problems and Directions 1988 TR Lucas, Postorder Disjoint Set Union Is Linear 1988 TR Vichnevetsky, An Analogy between Dispersive Wave Propagation and Special Relativity 1988 TR Hoang, On the Sibling-Structure of Perfect Graphs 1988 TR Vernon & Leutenegger, Fairness Analysis of Multiprocessor Bus Arbitration Protocols 1988 TR Ferris, Iterative Linear Programming Solution of Convex Programs 1988 TR Bach, A Note on Square Roots in Finite Fields 1988 TR Narasimhan & Manber, A Generalization of Lovasz's Sandwich Theorem 1988 TR Ioannidis & Wong, Towards an Algebraic Theory of Recursion 1988 TR Ferris & Mangasarian, Finite Perturbation of Convex Programs 1988 TR Ioannidis, Commutativity and Its Role in the Processing of Linear Recursion 1988 TR Megiddo, On Computable Beliefs of Rational Machines 1988 TR Kim, The Role of Visual Imagery in Geometry Theorem Proving 1988 TR Lynch & Stark, A Proof of the Kahn Principle for Input/Output Automata 1988 TR Awerbuch, Linear Time Algorithm for Minimum Network Partition 1988 TR Lynch, I/O Automata: A Model for Discrete Event Systems 1988 TR Awerbuch & Bar-Noy & Linial & Peleg, Improved Routing Strategies with Succinct Tables 1988 TR Apt, Introduction to Logic Programming 1988 TR Kalishki, Elliptic Curves and Cryptography: A Pseudorandom Bit Generator and Other Tools 1988 TR Smith & Velauthapillai, On the Inference of Approximate Programs 1988 TR Dietz, Fully Persistent Arrays (Extended Abstract) 1988 TR Cypher, Valiant's Maximum Algorithm with Sequential Memory Accesses 1988 TR Karloff & Ruzzo, The Iterated Mod Problem 1988 TR Aggarwal & Huang, Network Complexity of Sorting and Graph Problems and Simulating CRCW PRAMs by Interconnection Networks 1988 TR Buning & Lettmann & Mayr, Projections of Vector Addition System Reachability Sets Are Semilinear 1988 TR Anderson & Mayr & Warmuth, Parallel Approximation Algorithms for Bin Packing 1988 TR Flajolet & Odlyzko, Singularity Analysis of Generating Functions 1988 TR Shamir, A Slightly Random Source Confronts a Random Witness Set 1988 TR Bar-Noy & Linial & Peleg, A Lower Bound for Radio Broadcast 1988 TR Abadi & Lamport, The Existence of Refinement Mappings 1988 TR Egecioglu & Koc, An O(N log N) Parallel Algorithm for Rational Interpolation 1988 TR Agrawal & Abbadi, Reducing Storage for Quorum Consensus Algorithms 1988 TR Ramanan, O(n log n) Lower Bound for Computing the Width of a Planar Point Set 1988 TR Agrawal & Abbadi, Quorum Consensus Algorithms Secure and Reliable Data 1988 TR Cappello, A Bijection between Natural Numbers and Rooted Trees 1988 TR Preparata & Vuillemin, Practical Cellular Dividers 1988 TR Peleg & Schaffer, Graph Spanners 1988 TR Fagin & Halpern & Megiddo, A Logic for Reasoning about Probabilities 1988 TR Pippenger, Random Sequential Adsorption on Graphs 1988 TR Pippenger, Knots in Random Walks 1988 TR Klawe & Kleitman, Am Almost Linear Time Algorithm for Generalized Matrix Searching 1988 TR Pippenger, Invariance of Complexity Measures for Networks with Unreliable Gates 1988 TR Attiya & Snir, Better Computing on the Anonymous Ring 1988 TR Sorkin, Combinatorial Optimization, Simulated Annealing, and Fractals 1988 TR Karloff & Raghavan, Randomized Algorithms and Pseudorandom Numbers 1988 TR Snir, Size-Depth Trade-offs for Monotone Arithmetic Circuits 1988 TR Mansour & Schieber, Finding the Edge Connectivity of Directed Graphs 1988 TR Rosenberger, Order-k Voronoi Diagrams of Sites with Additive Weights in the Plane 1988 TR Edelsbrunner & Souvaine, Computing Median-of-Squares Regression Lines and Guided Topological Sweep 1988 TR Edelsbrunner & Hasan & Seidel & Shen, Circles through Two Points That Always Enclose Many Points 1988 TR Gear, Logarithmically Connected, Repetitive Computer Networks and Numerical Applications 1988 TR Edelsbrunner & Hajnal, A Lower Bound on the Number of Unit Distances between the Vertices of a Convex Polygon 1988 TR Dobkin & Edelsbrunner & Overmars, Searching for Empty Convex Polygons 1988 TR Edelsbrunner & Guibas & Sharir, The Complexity of Many Faces in Arrangements of Lines and of Segments 1988 TR Chazelle & Edelsbrunner, An Optimal Algorithm for Intersecting Line Segments in the Plane 1988 TR Skiena, Geometric Probing 1988 TR Pollard & Sag, An Information-based Theory of Agreement 1988 TR Abadi, The Power of Temporal Proofs 1988 TR Cardelli & Donahue & Glassman & Jordan & Kalsow & Nelson, Modula-3 Report 1988 TR Buntrock & Hemachandra & Siefkes, Unambiguous Computation May be Better than Determinism at Simulating Nondeterminism (Extended Abstract) 1988 TR Allender & Hemachandra, Lower Bounds for the Low Hierarchy (Extended Abstract) 1988 TR Beigel & Hemachandra & Wechsung, On the Power of Probabilistic Polynomial Time: P^{NP[log]} \subseteq PP (Extended Abstract) 1988 TR Cai & Hemachandra, On the Power of Parity Polynomial Time (to appear in STACS '89) 1988 TR Kanevsky, Finding All Minimum Size Separating Vertex Sets in a Graph 1988 TR Furst, Recent Advances in the Theory of Feasible Computation: Circuit Complexity 1988 TR Knuth & Larrabee & Roberts, Mathematical Writing 1988 TR van Emde Boas, Machine Models and Simulations (Revised Version) 1988 TR Galil & Park, An Improved Algorithm for Approximate String Matching 1988 TR Pugh, Skip Lists: A Probabilistic Alternative to Balanced Trees (preliminary version) 1988 TR Krizanc, Merging and Routing on Parallel Models of Computation (thesis) 1988 TR Breslauer & Galil, An Optimal O(log log n) Time Parallel String Matching Algorithm (preliminary version) 1988 TR Bar-Noy & Dolev, Families of Consensus Algorithms 1988 TR Dolev & Gafni & Shavit, Toward a Non-atomic Era: l-Exclusion as a Test Case 1988 TR Chandra & Tompa, The Complexity of Short Two-Person Games 1988 TR Fowler, The Rectilinear Voronoi Diagram with Barriers 1988 TR Bach & Shoup, Factoring Polynomials Using Fewer Random Bits 1988 TR Peters, A Parallel Algorithm for Minimal Cost Network Flow Problems 1988 TR Shoup, New Algorithms for Finding Irreducible Polynomials over Finite Fields 1988 TR Ioannidis & Ramakrishnan, Efficient Transitive Closure Algorithms 1988 TR Lamport, Concurrent Reading and Writing of Clocks 1988 TR Ehrenfeucht & Haussler, Learning Decision Trees from Random Examples 1988 TR Yaacoby & Cappello, Bounded Broadcast in Systolic Arrays 1988 TR Kwok & Carter, Multiple Decision Trees 1988 TR Rao & Kumar, Concurrent Access of Priority Queues 1988 TR Samet, Hierarchical Representations of Collections of Small Rectangles 1988 TR Porat & Feldman, Learning Automata from Ordered Examples 1988 TR Sanchis, Some Experiments on Multiple-way Network Partitioning Algorithms 1988 TR Allender & Watanabe, Kolmogorov Complexity and Degrees of Tally Sets 1988 TR Allender, Some Consequences of the Existence of Pseudorandom Generators 1988 TR Lucas, Arbitrary Splitting in Splay Trees 1988 TR Cohen, Generalizing Number and Learning from Multiple Examples in Explanation Based Learning 1988 TR Godbeer & Lipscomb & Luby, On the Computational Complexity of Finding Stable State Vectors in Connectionist Models (Hopfield Nets) 1988 TR Tuzhilin & Kedem, Complex System: Using Complex Objects for Predicting and Controlling the Future 1988 TR Chen & Cox & Mishra, NL Hierarchy 1988 TR Pan & Reif, Fast and Efficient Parallel Solution of Dense Linear Systems 1988 TR Pintz & Steiger & Szemeredi, Infinite Sets of Primes with Fast Primality Tests and Quick Generation of Large Primes 1988 TR Chvatal & McDiarmid, Small Transversals in Hypergraphs 1988 TR Akiyama & Chvatal, Packing Paths Perfectly 1988 TR Chvatal & Cook & Hartmann, On Cutting-Plane Proofs in Combinatorial Optimization 1988 TR Roesler, Associative Multiplications of Generalized Matrices 1988 TR Ho & Johnsson, Spanning Balanced Trees in Boolean Cubes 1988 TR Shoup, On the Deterministic Complexity of Factoring Polynomials over Finite Fields 1988 TR Herlihy, Impossibility and Universality Results for Wait-free Synchronization 1988 TR Goldsmith & Joseph & Young, Using Self-reducibilities to Characterize Polynomial Time 1988 TR Souvaine & Van Wyk, Grasping a Polygon 1988 TR Luginbuhl & Loui, Hierarchies and Space Measures for Pointer Machines 1988 TR Kurtz & Mahaney & Royer, The Isomorphism Conjecture Fails Relative to a Random Oracle 1988 TR Komlos & Paturi, Effect of Connectivity in Associative Memory Models 1988 TR Immerman, Expressibility and Parallel Complexity 1988 TR Gacs, Algorithmic Information Theory (by G. J. Chaitin, Cambridge University Press 1987) (review) 1988 TR Srinivas, Annotated Bibliography on Technical Presentation 1988 TR Srinivas, Guidelines for Giving a Technical Talk Using the Blackboard or the Overhead Projector 1988 TR Immerman, Nondeterministic Space is Closed Under Complementation 1988 TR Lamport, A Theorem on Atomicity in Distributed Algorithms 1988 TR Young, Juris Hartmanis: Fundamental Contributions to Isomorphism Problems (Draft of June 15, 1988) 1988 TR Cai & Immerman, An Optimal Lower Bound on the Number of Variables for Graph Identification 1988 TR Immerman, Descriptive and Computational Complexity 1988 TR Immerman & Lander, Describing Graphs: A First-Order Approach to Graph Canonization 1988 TR Pan Si, Approximate String Matching 1988 TR Dietzfelbinger & Maass, The Complexity of Matrix Transposition on One-Tape Off-line Turing Machines with Output Tape (Extended Abstract) 1988 TR Dietz & Sleator, Two Algorithms for Maintaining Order in a List 1988 TR Rivest, Cryptography (draft) 1988 TR Johnson, A Child's Garden of Complexity Classes 1988 TR Rajasekaran & Tsantilas & Krizanc, Optimal Routing Algorithms for Mesh-Connected Processor Arrays (Extended Abstract) 1988 TR Rajasekaran & Tsantilas, An Optimal Randomized Routing for the Mesh and A Class of Efficient Mesh-like Routing Networks (Extended Abstract) 1988 TR Weber, A Decomposition Theorem for Finite-Valued Transducers and an Application to the Equivalence Problem 1988 TR Boppana & Sipser, The Complexity of Finite Functions (Preliminary Draft) 1988 TR Amir & Landau, Fast Parallel and Serial Multidimensional Approximate Array Matching 1988 TR Afek & Landau & Schieber & Yung, The Power of Multimedia: Combining Point-to-Point and Multiaccess Networks 1988 TR Royer, Two Recursion Theoretic Characterizations of Proof Speed-ups 1988 TR Valiant, General Purpose Parallel Architectures (Draft) 1988 TR Li & Vitanyi, Two Decades of Applied Kolmogorov Complexity (Draft) 1988 TR Trahan & Loui, Multiplication and Division Instructions in Parallel Random Access Machines 1988 TR Trahan & Loui, Shift Instructions in Parallel Random Access Machines 198? TR Smeaton, Information Retrieval: Advances in the Last 5 Years 198? TR Smith & Velauthapillai, On the inference of approximate programs 198? TR Reinfelds, A brief introduction to the derivation of programs 1987 TR Beigel & Gasarch & Hay, Bounded Query Classes and the Difference Hierarchy 1987 TR Chang & Ja'ja', Parallel Algorithms for River Routing 1987 TR Lakshman, Message-Complexity vs. Delay Tradeoffs in Decentralized Consensus Protocols 1987 TR Hung & Rosenfeld, Parallel Processing of Linear Quadtrees on a Mesh-Connected Computer 1987 TR Naclerio & Masuda & Nakajima, The Via Minimization Problem is NP-Complete 1987 TR Hoare, Formal Methods in Software Engineering: A Tutorial Survey 1987 TR Harper & Honsell & Plotkin, A Framework for Defining Logics 1987 TR Gasarch & Homer, Recursion Theoretic Properties of Minimal Honest Polynomial Degrees 1987 TR Beigel & Gasarch, Supportive and Parallel-supportive Sets 1987 TR Gasarch, Application of Binary Search to Recursive Graph Theory 1987 TR Beigel & Gill & Gasarch & Owings, Terse, Superterse, and Verbose Sets 1987 TR Thomason & Cole, Parallel Computation in Dynamic Programming for Optimal String-to-Network Alignments 1987 TR Mann & Thompson, Rhetorical Structure Theory: A Theory of Text Organization 1987 TR Benaloh, Verifiable Secret-Ballot Elections 1987 TR Halpern & Zuck, A Little Knowledge Goes a Long Way: Simple Knowledge-based Derivations and Correctness Proofs for a Family of Protocols 1987 TR Fischer & Zuck, Relative Knowledge and Belief 1987 TR Schank & Owens, Ten Problems in Artificial Intelligence 1987 TR McAnulty & Reilly & Amthor, Principles of Distributed and Parallel Processing in Neural and Biological Models Introduction and Tutorial 1987 TR McMahen & Reilly, A Paradigm for Seeking Intelligence in Machines through Combined Use of Neural and Molecular Models 1987 TR Ranade & Johnsson, The Communication Efficiency of Meshes, Boolean Cubes and Cube Connected Cycles for Wafer Scale Integration 1987 TR Johnsson & Ho & Jacquemin & Ruttenberg, Computing Fast Fourier Transforms on Boolean Cubes and Related Networks 1987 TR Immerman, Nondeterministic Space Is Closed under Complement 1987 TR Zhang & Hsu, Unsafe Operations in B-Trees 1987 TR Ramachandran, A Minimax Arc Theorem for Reducible Flow Graphs 1987 TR Murray, Multiple Convergence: An Experiment in Disjunctive Concept Acquisition 1987 TR Cypher & Sanz, The Hough Transform has O(N) Complexity on SIMD NxN Mesh Array Architecture 1987 TR Littlestone, Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm 1987 TR Pohl & Edelson, A to Z: C Language Shortcomings 1987 TR Blumer & Ehrenfeucht & Haussler & Warmuth, Learnability and the Vapnik-Chervonenkis Dimension 1987 TR Ehrenfeucht & Haussler, Learning Decision Trees from Random Examples 1987 TR Haussler, Applying Valiant's Learning Framework to AI Concept Learning Problems 1987 TR Hadzilacos, A Knowledge Theoretic Analysis of Atomic Commitment Protocols (Preliminary Report) 1987 TR Pugh, Efficient Concatenable Ordered Lists 1987 TR Shoup, Finding Witnesses Using Fewer Random Bits 1987 TR Wolf, Nondeterministic Circuits 1987 TR Brinck, Traversing Binary Trees via Rotations 1987 TR Gnaedig, Knuth-Bendix Procedure and Non Deterministic Behavior--An Example 1987 TR Frison & Lavenier, A Systolic Machine for String Correction 1987 TR Dean, A Taxonomy of Map Learning Problems 1987 TR Hammerstrom, A Connectionist/Neural Network Bibliography, Volume Two 1987 TR Rosenblatt-Roth, Contributions to the Problem of Approximation of Probability Measures 1987 TR Ghosh, A Few Applications of the Set-visibility Algorithm 1987 TR Faloutsos, Gray Codes for Partial Match and Range Queries 1987 TR Narendran & Krithivasan, On the Membership Problem for Some Grammars 1987 TR Krithivasan & Sitalakshmi, Efficient Two Dimensional Parallel and Serial Approximate Pattern Matching 1987 TR Amir & Gasarch, Polynomial Terse Sets 1987 TR Sekar, Design and Study of Parallel Set Covering Algorithms 1987 TR Krithivasan, Efficient Two Dimensional Pattern Matching in the Presence of Errors 1987 TR Melter, Some Characterizations of City Block Distance 1987 TR Bishop, A Fast Version of the DES and a Password Encryption Algorithm 1987 TR Denning, Baffling Big Brother 1987 TR Denning, Paradigms Crossed 1987 TR Denning, A New Paradigm for Science 1987 TR Takayama, Proof Compiling Technique Based on Realizability and Proof Normalization 1987 TR Sakakibara, Inferring Parsers of Context-free Languages from Structural Examples 1987 TR Purdom, The Analysis of Algorithms: Errata and Answers to the Exercises 1987 TR Langley & Carbonell, Machine Learning: Techniques and Foundations 1987 TR King, An Omega (n^{8/7}) Lower Bound on the Randomized Complexity of Graph Properties 1987 TR Motwani & Raghunatham & Saran, Covering Orthogonal Polygons with Star Polygons: The Perfect Graph Approach 1987 TR Tappert & Suen & Wakahara, On-line Handwriting Recognition--A Survey 1987 TR Robinson & Kim, Point Symmetry of Convex Digital Regions 1987 TR Stojmenovic & Kim, On Approximate Convex Hull Algorithms 1987 TR Stojmenovic, Parallel Computational Geometry 1987 TR Cross & Kuo, An Improved Algorithm to Find the Length of the Longest Common Subsequence of Two Strings 1987 TR Kim & Stojmenovic, Parallel Algorithms for Digital Geometry 1987 TR Stojmenovic, Computational Geometry on a Hypercube 1987 TR Goldreich, Randomness, Interactive Proofs and Zero-Knowledge 1987 TR Ajtai, Approximate Counting with Uniform Constant Depth Circuits 1987 TR Awerbuch & Goldreich & Vainish, On the Message Complexity of Broadcast: A Basic Lower Bound 1987 TR Goldberg & Tarjan, Finding Minimum-Cost Circulations by Successive Approximation 1987 TR Goldberg & Tarjan, Finding Minimum-Cost Circulations by Canceling Negative Cycles 1987 TR Fellows & Langston, Fast Self-reduction Algorithms for Combinatorial Problems of VLSI Design 1987 TR Doctors, Babbling and Early Speech: The Continuity Issue 1987 TR Dean & Kanazawa, Persistence and Probabilistic Inference 1987 TR Kung, Computational Models for Parallel Computers 1987 TR Brinn, A Polygon Matching Problem in Computer Vision 1987 TR Hofri, On Searching an Ordered List: Are Two Yardsticks Better than One? 1987 TR Ben-David, The Global Time Assumption and Semantics for Concurrent Systems 1987 TR Benedek & Itai, Nonuniform Learnability 1987 TR Tiomkin, Proving Unprovability 1987 TR Ajtai, Approximate Counting with Uniform Constant Depth 1987 TR Kruskal & Rudolph & Snir, Techniques for Parallel Manipulation of Sparse Matrices 1987 TR Herlihy & Lynch & Merritt & Weihl, On the Correctness of Orphan Elimination Algorithms 1987 TR Goldberg & Tarjan, Finding Minimum-cost Circulations by Successive Approxiamtion 1987 TR Goldberg & Tarjan, Finding Mimimum-cost Circulations by Canceling Negative Cycles 1987 TR Beame, Lower Bounds for Recognizing Small Cliques on CRCW PRAM's 1987 TR Quinlan & Rivest, Inferring Decision Trees Using the Minimum Description Length Principle 1987 TR Fekete, Approximate Agreement 1987 TR Leiserson & Saxe, A Mixed-Integer Linear Programming Problem Which Is Efficiently Solvable 1987 TR Meyer & Sieber, Towards Fully Abstract Semantics for Local Variables: Preliminary Report 1987 TR Bloom & Istrail & Meyer, Bisimulation Can't Be Traced: Preliminary Report 1987 TR Awerbuch, Space Efficient Dynamic Protocols: Part 1 1987 TR Awerbuch, Space Efficient Dynamic Protocols: Part 2 1987 TR Bodlaender, Dynamic Programming on Graphs with Bounded Treewidth 1987 TR Miller, Multischeme: A Parallel Processing System Based on MIT Scheme 1987 TR Pippenger, Correction to "Computational Complexity of Algebraic Functions" 1987 TR Lawler & Lenstra & Martel & Simons, Pipeline Scheduling: A Survey 1987 TR Megiddo, On the Complexity of Some Geometric Problems in Unbounded Dimension 1987 TR Megiddo, On Finding a Minimum Dominating Set in a Tournament 1987 TR Pippenger, Parallel Selection 1987 TR Megiddo, On the Ball Spanned by Balls 1987 TR Halpern & Vardi, The Complexity of Reasoning about Knowledge and Time, I: Lower Bounds 1987 TR Peleg & Upfal, Efficient Message Passing Using Succinct Routing Tables 1987 TR Cypher & Sanz & Snyder, Hypercube and Shuffle-Exchange Algorithms for Image Component Labeling 1987 TR Cypher & Sanz & Snyder, An EREW PRAM Algorithm for Image Component Labeling 1987 TR Linial, Locality as an Obstacle to Distributed Computing 1987 TR Ben-Or & Linial, Collective Coin Flipping 1987 TR Kraus & Lehmann, Knowledge, Belief and Time 1987 TR Lehmann, Memory and the Formation of Associations in Neural Nets 1987 TR Goldreich & Mansour, Interactive Proof Systems: Provers That Never Fail and Random Selection 1987 TR Chlamtac & Elazar & Gold, Highly Parallel Distributed Algorithm for Shortest Path Routing in Dynamically Reconfigurable Networks 1987 TR Korach & Markowitz, Algorithms for Distributed Spanning Tree Construction in Dynamic Networks 1987 TR Benedek & Itai, Learnability by Fixed Distributions 1987 TR Goldszmidt & Katz & Yemeni, Interactive Blackbox Debugging for Concurrent Languages 1987 TR Korach & Ostfeld, DFS Tree Construction Algorithms and Characterizations 1987 TR Moran & Wolfstahl, Extended Impossibility Results for Asynchronous Complete Network 1987 TR Goldreich, Zero-knowledge and the Design of Secure Protocols 1987 TR Bar-Yehuda & Goldreich & Itai, On the Time-Complexity of Broadcast in Radio Networks: An Exponential Gap Between Determinism and Randomization 1987 TR Biran & Moran & Zaks, A Combinational Characterization of the Distributed Tasks Which are Solvable in the Presence of One Faulty Processor 1987 TR Block, Sport-Sort 1987 TR Gerstel & Mansour & Zaks, Bit Complexity of Order Statistics on a Distributed Star Network 1987 TR Edelsbrunner, The Upper Envelope of Piecewise Linear Functions: Tight Bounds on the Number of Faces 1987 TR Landauer, Computation, Measurement, Communication and Energy Dissipation 1987 TR Agerwala & Harvey, A Perspective on Parallel Processing 1987 TR Pugh & Shub, Ergodic Attractors 1987 TR Aggarwal & Chandra, Hierarchical Memory with Block Transfer 1987 TR May, The Parallel Assignment Problem Redefined 1987 TR Landauer, Energy Requirements in Communication 1987 TR Coppersmith & Raghavan & Tompa, Parallel Graph Algorithms That are Efficient on Average 1987 TR Tompa & Woll, Random Self-reducibility and Zero Knowledge Interactive Proofs of Possession of Information 1987 TR Horiguchi & Miranker, Noisy Sort, A Memory Intensive Sorting Algorithm 1987 TR Lindsay & Moore & Ritchie, Review of Existing Theorem Provers 1987 TR Goldreich, Zero-Knowledge and the Design of Secure Protocols (an Exposition for Engineers) 1987 TR de Bruijn, The Mathematical Vernacular, A Language for Mathematics with Typed Sets 1987 TR Levcopoulos & Overmars, A Balanced Search Tree with O(1) Worst-Case Update Time 1987 TR Pawagi, A Parallel Algorithm for Multiple Updates of Minimum Spanning Trees 1987 TR Alon & Azar, The Average Complexity of Deterministic and Randomized Parallel Comparison Sorting Algorithms 1987 TR Galil & Kannan & Szemeredi, On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-tape Turing Machines 1987 TR Alon & Azar, Sorting, Approximate Sorting and Searching in Rounds 1987 TR Alon & Chung, Explicit Construction of Linear Sized Tolerant Networks 1987 TR Cole & Vishkin, Approximate Parallel Scheduling 1987 TR Guibas & Hershbrger & Leven, Linear Time Algorithms for Visibility and Shortest Path Problems inside Simple Polygons 1987 TR Sharir, Improved Lower Bounds on the Length of Davenport-Schinzel Sequences 1987 TR Rutten & Zucker, A Semantic Approach to Fairness 1987 TR Israeli & Vitanyi, Simple Multireader Registers Using Time-stamp Schemes 1987 TR Jerrum, A Data Structure for Systems of Orthogonal, Non-overlapping Rectangles 1987 TR Sinclair & Jerrum, Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains 1987 TR Edelsbrunner & Sharir, The Maximum Number of Ways to Stab n Convex Non-intersecting Objects in the Plane Is 2n-2 1987 TR Lelewer & Hirschberg, Data Compression 1987 TR Canny & Donald, Simplified Voronoi Diagrams 1987 TR Hartmanis & Hemachandra, One-way Functions, Robustness, and the Non-isomorphism of NP-Complete Sets 1987 TR Bilardi & Preparata, Size-Time Complexity of Boolean Networks for Prefix Computations 1987 TR Dill, Optimal Trie Compaction Is NP-Complete 1987 TR Bilardi, Merging and Sorting Networks with the Topology of the Omega Network 1987 TR Hartmanis, Some Observations about NP Complete Sets 1987 TR Immerman & Kozen, Definability with Bounded Number of Bound Variables 1987 TR Dain, Minimum Distance Error Correction 1987 TR Rytter, On Efficient Parallel Computations for Some Dynamic Programming Problems 1987 TR Gibbons & Israeli & Rytter, Parallel 0(log(N)) Time Edge-colouring of Trees and Halin Graphs 1987 TR Beynon, Monotone Boolean Functions as Combinatorially Piecewise Linear Maps 1987 TR Agrawal & Bernstein, A Family of Optimistic Algorithms for Replicated Data 1987 TR Pawagi, Parallel Algorithm for Maximum Weight Matching in Trees 1987 TR Brown & Fellows & Langston, Polynomial-time Self-reducibility: Theoretical Motivations and Practical Results 1987 TR Huang & Langston, Fast Stable Merging and Sorting in Constant Extra Space 1987 TR Huang & Langston, Stable Set and Multiset Operations in Optimal Time and Space 1987 TR Kinnersley & Langston, On-line Variable Sized Bin Packing 1987 TR Flajolet & Vitter, Average-case Analysis of Algorithms and Data Structures 1987 TR Flajolet & Kirschenhofer & Tichy, Deviations from Normality in Random Strings 1987 TR Flajolet & Gardy & Thimonier, Birthday Paradox, Coupon Collectors, Caching Algorithms and Self-organizing Search 1987 TR Aggarwal & Vitter, The Input/Output Complexity of Sorting and Related Problems 1987 TR Flajolet, Random Tree Models in the Analysis of Algorithms 1987 TR Holt & Cordy, The Turing Plus Report 1987 TR Winograd, Thinking Machines: Can There Be? Are We? 1987 TR Rokicki & Knuth, A Programming and Problem Solving Seminar 1987 TR Finkelstein & Pieprzyk, Nonlinear Permutations in Symmetric Cryptosystems 1987 TR Abramson & Kirkpatrick & Dadoun & Przytycka, A Simple Optimal Randomized Parallel List Ranking Algorithm 1987 TR Hartmanis, The Collapsing Hierarchies 1987 TR Gries, What Programmers Don't and Should Know 1987 TR Hoffmann & Hopcroft & Karasick, Robust Set Operations on Polyhedral Solids 1987 TR Hemachandra, On Parity and Near Testability PA Does Not Equal NTA with Probability 1 1987 TR Schneider, Understanding Protocols for Byzantine Clock Synchronization 1987 TR Vazirani, NC Algorithms for Computing the Number of Perfect Matchings in K3,3-free Graphs and Related Problems 1987 TR Gacs & Reif, A Simple Three-dimensional Real-time Reliable Cellular Array 1987 TR Gacs, Self-correcting Two-dimensional Arrays 1987 TR Homer & Wang, Absolute Results Concerning One-way Functions and Their Applications 1987 TR Laird, Learning from Good and Bad Data 1987 TR Apt, Introduction to Logic Programming 1987 TR Kirkpatrick, Establishing Order in Planar Subdivisions 1987 TR Dadoun & Kirkpatrick, Parallel Construction of Subdivision Hierarchies 1987 TR Gallo, A Fast Parametric Maximum Flow Algorithm 1987 TR Goldberg & Tarjan, Finding Minimum-cost Circulations by Successive Approximation 1987 TR Gabow & Tarjan, A Linear-time Algorithm for Finding a Minimum Spanning Pseudoforest 1987 TR Goldberg & Tarjan, Finding Minimum-cost Circulations by Canceling Negative Cycles 1987 TR Driscoll & Gabow & Shrairman & Tarjan, Relaxed Heaps: An Alternative to Fibonacci Heaps 1987 TR Aggarwal & Alonso & Courcoubetis, Distributed Reachability Analysis for Protocol Verification Environments 1987 TR Gabow & Tarjan, Faster Scaling Algorithms for Network Problems 1987 TR Dobkin & Friedman & Supowit, Delaunay Graphs Are Almost as Good as Complete Graphs 1987 TR Friedman, Random Polynomials and Approximate Zeros of Newton's Method 1987 TR Kannan & Lovasz, Covering Minima and Lattice Point Free Convex Bodies 1987 TR Barbara & Garcia-Molina, Exploiting Symmetries for Low-cost Comparison of File Copies 1987 TR Ahuja & Orlin & Tarjan, Improved Time Bounds for the Maximum Flow Problem 1987 TR Yao, On Selecting the Second Largest with Median Tests 1987 TR Laszlo, A Data Structure for Manipulating Three-dimensional Subdivisions 1987 TR Chvatal & Szemeredi, Many Hard Examples for Resolution 1987 TR Downey, Analysis of Parallel Iteration 1987 TR Myers & Miller, Optimal Alignments in Linear Space 1987 TR Han, An Optimal Parallel Algorithm for Computing Linked List Prefix 1987 TR Han & Igarashi, Time Lower Bounds for Parallel Sorting on a Mesh-connected Processor Array 1987 TR Whitesides & Zhao, On the Placement of Euclidean Weighted Trees I. The Hardness 1987 TR Whitesides & Zhao, An NP-Hardness Result for Moving Robot Arms with Rectangular Links 1987 TR Tanik, A Partially Annotated Bibliography on Cryptography 1987 TR Edelsbrunner, Minimum Diameter Partitioning of a Planar Point Set in Quadratic Time 1987 TR Gentner & Jeziorski, Historical Shifts in the Use of Analogy in Science 1987 TR Edelsbrunner & Guibas & Sharir, The Upper Envelope of Piecewise Linear Functions: Algorithms and Applications 1987 TR Ng, Using Histories to Implement Atomic Objects 1987 TR Edelsbrunner & Mucke, Simulation of Simplicity: A Technique to Cope with Degenerate Cases in Geometric Algorithms 1987 TR Matheus & Hohensee, Learning in Artificial Neural Systems 1987 TR Johansen & Jorgensen & Nielsen & Nielsen & Skyum, A Distributed Spanning Tree Algorithm 1987 TR Skyum, A Distributed Election and Spanning Tree Algorithm Based on Depth First Search Traversals 1987 TR Rosenfeld & Melter, Digital Geometry 1987 TR Rabin, Efficient Dispersal of Information for Security Load Balancing and Fault Tolerance 1987 TR Chor & Gereb-Graus, On the Influence of Single Participant in Coin Flipping Schemes 1987 TR Gereb-Graus & Krizanc, The Complexity of Parallel Comparison - Merging 1987 TR Mihail, The Approximation of the Permanent Is Still Open - A Flaw in Broder's Proof 1987 TR Chrobak & Li, k+1 Heads Are Better than k for PDA's 1987 TR Beaver, Oblivious Secret Computation 1987 TR Beaver, Polynomially Sized Boolean Circuits Are Not Learnable 1987 TR Krizanc, Oblivious Routing with Limited Buffer Capacity 1987 TR Allender & Rubinstein, P-printaale Sets 1987 TR Smolensky, On the Proper Treatment of Connectionism 1987 TR Smolensky, Putting Together Connectionism - Again: Response to Commentary on BBS Target Article: On the Proper Treatment of Connectionism 1987 TR Case, Turing Machines 1987 TR Bates, Shuffle Automata: A Formal Model for Behavior Recognition in Distributed Systems 1987 TR Saxena, Learning from Derived Oracles 1987 TR Nisan & Soroker, Parallel Algorithms for Zero-One Supply-Demand Problems 1987 TR Soroker, Optimal Parallel Construction of Prescribed Tournaments 1987 TR Gibbons & Karp & Miller & Soroker, Subtree Isomorphism Is in Random NC 1987 TR Soroker, Fast Parallel Algorithms for Graphs and Networks 1987 TR Karp & Motwani & Nisan, Probabilistic Analysis of Network Flow Algorithms 1987 TR Chang & Ibarra & Palis, Efficient Simulations of Simple Computation by Time-bounded ATM's and Space-bounded TM's 1987 TR Cole, Parallel Merge Sort 1987 TR Cole & Zajicek, On Optimal Parallel Algorithm for Building a Data Structure for Planar Point Location 1987 TR Atallah & Cole & Goodrich, Cascading Divide and Conquer: A Technique for Designing Parallel Algorithms 1987 TR Zhao, An 0(N) Algorithm for Three-dimensional N-Body Simulations 1987 TR Vuillemin, Exact Real Computer Arithmetic with Continued Fractions 1987 TR Dadoun & Kirkpatrick, A Parallel Algorithm for Finding Maximal Independent Sets in Planar Graphs 1987 TR Abrahamson, Time-Space Tradeoffs for Branching Programs Contrasted with Those for Straight-line Programs 1987 TR Abrahamson & Adler & Higham & Kirkpatrick, Randomized Function Evaluation on a Ring 1987 TR Abrahamson & Dadoun & Kirkpatrick & Przytycka, A Simple Parallel Tree Contraction Algorithm 1987 TR Schieber & Vishkin, The Parallel Complexity of Finding All Nearest Neighbors in Convex Polygons 1987 TR Tzoreff-Eliam & Vishkin, Matching Patterns in Strings Subject to Multi-linear Transformations 1987 TR Cait, An Iterative Version of Hopcroft and Tarjan's Planarity Testing Algorithm 1987 TR Aggarwal & Chazelle & Guibas & O'Dunlaing & Yap, Parallel Computational Geometry 1987 TR Abrahamson & Fellows & Langston & Moret, Constructive Complexity 1987 TR Moret, Planar NAE3SAT Is in P 1987 TR Gries & van de Snepscheut, Inorder Traversal of a Binary Tree and Its Inversion 1987 TR Chu, The Fast Fourier Transform on Hypercube Parallel Computers 1987 TR Panagaden & Stark, Computations, Residuals, and the Power of Indeterminacy 1987 TR Pan & Reif, Fast and Efficient Solution of Path Algebra Problems 1987 TR Pan & Bini, Acceleration of Parallel Computations of the Minimum Cost Paths in an Undirected Graph Having a Small Separator Family 1987 TR Bernhard & Rosenkrantz, The Complexity of Routing Through an Omega Network 1987 TR Stearns & Hunt, On SAT and the Relative Complexities of NP-Hard Problems 1987 TR Hunt & Stearns, The Complexity of Equivalence for Commutative Rings 1987 TR Hunt & Stearns, The Complexity of Very Simple Boolean Formulas with Applications 1987 TR Kapur & Narendran & Rosenkrantz & Zhang, Sufficient-Completeness, Quasi-Reducibility and Their Complexity 1987 TR Biswas, Inference of Minimal DFA from a Finite Sample: A Formal Power Series Approach 1987 TR Ranade, How To Emulate Shared Memory 1987 TR Johnsson & Ho, Optimum Broadcasting and Personalized Communication in Hypercubes 1987 TR Fellows & Langston, Non-constructive Tools for Proving Polynomial-Time Decidability 1987 TR Thau & Ferguson, Context-free Parsing on the Connection Machine System 1987 TR Stanfill, Communications Architecture in the Connection Machine System 1987 TR Peleg & Upfal, A Tradeoff between Space and Efficiency for Routing Tables 1987 TR Megiddo, On the Complexity of Solving the Generalized Set Packing Problem Approximately 1987 TR Pippenger & Spencer, Asymptotic Behavior of the Chromatic Index for Hypergraphs 1987 TR Williams & Wimmers, Sacrificing Simplicity for Convenience: Where Do You Draw the Line? 1987 TR Sanz & Cypher, Data Reduction and Fast Routing: A Strategy for Efficient Algorithms for Parallel Message-Passing Computers 1987 TR Cypher & Sanz, Optimal Sorting on Feasible Parallel Computers 1987 TR Hafner & McCurley, On the Distribution of Running Times of Certain Integer Factoring Algorithms 1987 TR Peleg & Schaffer, Time Bounds on Fault Tolerant Broadcasting 1987 TR Aggarwal & Klawe, Applications of Generalized Matrix Searching to Geometric Algorithms 1987 TR Dwork & Shmoys & Stockmeyer, Flipping Persuasively in Constant Time 1987 TR Bruck & Blaum, Neural Networks, Error-correcting Codes and Polynomials over the Binary n-Cube 1987 TR Ajtai, The Complexity of the Pigeonhole Principle 1987 TR Hassin & Megiddo, On Orientations and Shortest Paths 1987 TR Tompa, Zero Knowledge Interactive Proofs of Knowledge (A Digest) 1987 TR Henderson & Miranker, synergy in Parallel Algorithms 1987 TR Douglas & Miranker, Aggregation Sorting Algorithms 1987 TR Wong & Delosme, Transformation of Broadcasting into Pipelining 1987 TR Brassard, Introduction to Modern Cryptology 1987 TR Dietzfelbinger, Lower Bounds on Computation Time for Various Models in Computational Complexity Theory (Ph. D. Thesis) 1987 TR Goldsmith & Hemachandra & Joseph & Young, Near-Testable Sets 1987 TR Longpre & Young, Cook Is Faster Than Karp: A Study of Reducibilities in NP 1987 TR Chor & Goldreich, Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity 1987 TR Weber & Seidl, On Finitely Generated Monoids of Matrices with Entries in N 1987 TR Karchmer & Wigderson, Monotone Circuits for Connectivity Require Super-logarithmic Depth 1987 TR Paterson, Improved Sorting Networks with O(log n) Depth 1987 TR Bhatt & Cai, Take a Walk, Grow a Tree (Preliminary Version) 1987 TR Cai & Hemachandra, Enumerative Counting is Hard 1987 TR Pin, On the Languages Accepted by Finite Reversible Automata 1987 TR Simon, The Nondeterministic Complexity of a Finite Automata 1987 TR Dobkin & Souvaine, Computational Geometry in a Curved World 1987 TR Kalantari, Solving Linear Programs in the Standard Form by Bisection and a Projective Feasibility Algorithm 1987 TR Kalantari, Karmarkar's Algorithm with Improved Steps 1987 TR Grigoriadis & Kalantari, A New Class of Heuristic Algorithms for Weighted Perfect Matching 1987 TR Kalyanasundaram & Schnitger, On the Power of White Pebbles (Extended Abstract) 1987 TR Goldsmith & Joseph & Young, A Note on Bi-immunity and P-Closeness of P-Cheatable Sets in P/poly 1987 TR Goldsmith & Joseph & Young, Using Self-Reducibilities To Characterize Polynomial Time 1987 TR Krizanc, Oblivious Routing with Limited Buffer 1987 TR Peleg & Upfal, A Time-Randomness Tradeoff for Oblivious Routing 1987 TR Karloff & Paturi & Simon, Universal Sequences of Length n^O(log n) for Cliques 1987 TR Salton, Historical Note: The Past Thirty Years in Information Retrieval 1987 TR von zur Gathen, Feasible Arithmetic Computations: Valiant's Hypothesis 1987 TR Bach & Shallit, Factoring with Cyclotomic Polynomials 1987 TR Shallit, A Generalization of Automatic Sequences 1987 TR Allouche & Betrema & Shallit, Sur des Points Fixes de Morphismes du Monoide Libre 1987 TR Rubinstein & Shallit & Szegedy, A Subset Coloring Algorithm and Its Applications to Computer Graphics 1987 TR Istrail, Polynomial Universal Traversing Sequences for Cycles Are Constructible (Extended Abstract) 1987 TR van Lambalgen, Random Sequences (thesis) 1987 TR Borodin & Cook & Dymond & Ruzzo & Tompa, Two Applications of Complementation via Inductive Counting 1987 TR Schieber & Vishkin, On Finding Lowest Common Ancestors: Simplification and Parallelization 1987 TR Landau & Vishkin, Fast String Matching with k Differences 1987 TR Landau & Vishkin, Fast Parallel and Serial Approximate String Matching 1987 TR Myers, Incremental Alignment Algorithms and Their Applications 1987 TR Angluin, A Note on Diversity 1987 TR Angluin, Debugging a DAG Efficiently 1987 TR Angluin, Learning Propositional Horn Sentences With Hints 1987 TR Wagner, Number-of-Query Hierarchies 1987 TR Wagner, Bounded Query Classes 1987 TR Birrell & Guttag & Horning & Levin, Synchronization Primitives for a Multiprocessor: A Formal Specification 1987 TR Immerman, Nondeterministic Space is Closed Under Complement 1987 TR Brassard & Bratley, Algorithmics: Theory and Practice 1987 TR Hemachandra, Counting in Structural Complexity Theory (Ph. D. Thesis) 1987 TR Nelson, A Generalization of Dijkstra's Calculus 1987 TR Kadin, The Polynomial Time Hierarchy Collapses if the Boolean Hierarchy Collapses 1987 TR Is One NP Question as Powerful as Two? 1987 TR Goldsmith & Joseph & Young, Self-Reducible, P-Selective, Near-Testable, and P-Cheatable Sets: The Effect of Internal Structure on the Complexity of a Set 1987 TR van Emde Boas, Machine Models and Simulations 1987 TR Lamport, win and sin: Predicate Transformers for Concurrency 1987 TR Aggarwal & Shor, A Linear Time Algorithm for Computing the Voronoi Diagram of Convex Polygons 1987 TR Haber, The Theory of Minimum-Knowledge Protocols (Preliminary Version) 1987 TR Galil & Haber & Yung, Cryptographic Computation: Secure Fault-Tolerant Protocols in the Public-Key Model 1987 TR Kearns & Li & Pitt & Valiant, Recent Results on Boolean Concept Learning 1987 TR Kearns & Li & Pitt & Valiant, On the Learnability of Boolean Formulae 1987 TR Li & Yesha, The Probabilistic and Deterministic Parallel Complexity of Symmetric Functions 1987 TR Chor & Israeli & Li, On Processor Coordination Using Asynchronous Hardware 1987 TR Israeli & Li, Bounded Time-Stamps (Extended Abstract) 1987 TR Venkateswaran, Properties that Characterize LOGCFL 1987 TR Goldwasser & Micali & Rackoff, The Knowledge Complexity of Interactive Proof Systems 1987 TR Hong, On Connectionist Models 1987 TR Porat, Stability and Looping in Connectionist Models with Asymmetric Weights 1987 TR Dietzfelbinger & Maass, Three Lower Bound Arguments with ``Inaccessible'' Numbers 1987 TR Dietzfelbinger, Lower Bounds for Sorting of Sums 1987 TR Wagner, Log Query Classes 1987 TR Schoening & Wagner, Collapsing Oracle Hierarchies, Census Functions and Logarithmically Many Queries 1987 TR Lamport, Synchronizing Time Servers 1987 TR Johnson & Aragon & McGeoch & Schevon, Optimization by Simulated Annealing: An Experimental Evaluation (Part I) 1986 TR Ja'ja' & Wu, A New Approach to Realize Partially Symmetric Functions 1986 TR Masuda & Nakajima, An Optional Algorithm for Finding a Maximum Independent Set of a Circular Arc Graph 1986 TR Dobosiewicz, Optimal Binary Search Trees 1986 TR Zadeh, Is Probability Theory Sufficient for Dealing with Uncertainty in AI: A Negative View 1986 TR Main, Trace, Failure and Testing Equivalences for Communicating Processes 1986 TR Levcopoulos, Minimum Length and "Thickest-First" Rectangular Partitions of Polygons 1986 TR Feldman & Volper, Computers in Introductgory Programming Classes--An Appraisal of a Management Decision 1986 TR Bailey, How to Make a Billion Connections 1986 TR Hammerstrom, A Connectionist/Neural Network Bibliography 1986 TR Maier, A Logic for Objects 1986 TR Bestul & Davis, On Computing Histograms of Images in log n Time Using Fat Pyramids 1986 TR Krithivasan & Sitalakshmi, An Efficient Two Dimensional Pattern Matching Algorithm 1986 TR Blumer & Blumer, Online Construction of a Complete Inverted File 1986 TR Ajtai & Komlos & Steiger & Szemeredi, Almost Sorting in One Round 1986 TR Franco, Search Rearrangement Backtracking Often Requires Exponential Time to Verify Unsatisfiability 1986 TR Langley & Jones, A Computational Model of Scientific Insight 1986 TR Stearns & Hunt, On the Complexity of the Satisfiability Problem and the Structure of NP 1986 TR Ravi, A Solution to an Open Problem Due to Stearns and Hunt 1986 TR Ballard, Interpolation Coding: A Representation for Numbers in Neural Models 1986 TR Scheifler & Gettys, The X Window System 1986 TR Hirschberg & Larmore & Molodowitch, Subtree Weight Ratios for Optimal Binary Search Trees 1986 TR Larmore, A Subquadratic Algorithm for Constructing Approximately Optimal Binary Search Trees 1986 TR Megiddo, Extending NC and RNC Algorithms 1986 TR Wolfram, Cellular Automaton Fluids 1: Basic Theory 1986 TR Schieber & Moran, Slowing Sequential Algorithms for Obtaining Fast Distributed and Parallel Algorithms: Maximum Matchings 1986 TR Landau & Schieber & Vishkin, Parallel Construction of a Suffix Tree 1986 TR Azar & Vishkin, Tight Comparison Bounds on the Complexity of Parallel Sorting 1986 TR Tan, Reduced Distance Routing in Single-stage Shuffle-Exchange Interconnection Networks 1986 TR Milner, Is Computing an Experimental Science 1986 TR Neiger & Toueg, Substituting for Real Time and Common Knowledge in Distributed Systems 1986 TR Babaoglu & Drummond, (Almost) No Cost Clock Synchronization 1986 TR Hemachandra, Can P and NP Manufacture Randomness? 1986 TR Holt, Features of the Turing Language 1986 TR Halton, On a New Class of Independent Families of Linear Congruential Pseudo-random Sequences 1986 TR Halton, The Properties of Random Trees 1986 TR Holt & Matthews, The Formal Semantics of Turing Programs 1986 TR Holt & Cordy, The Turing Language Report 1986 TR Tadepalli, Learning Approximate Plans in Games 1986 TR Gamboa, Lower Bounds on Approximation Algorithms 1986 TR Barrington, A Note on a Theorem of Razborov 1986 TR Chandran & Rosenfeld, Order Statistics on a Hypercube 1986 TR Cole, An Optimal Selection Algorithm 1986 TR Minoura, Serializability Test by Pebbling 1986 TR Fellows & Langston, Non-constructive Tools for Proving Polynomial-Time Decidability 1986 TR Chen & Yap, Reversal Complexity 1986 TR Cole & Vishkin, Faster Optimal Parallel Prefix Sums and List Ranking 1986 TR Chen, GNU Emacs TEX Mode Versson 1.5 1986 TR Sanders, Information Structure of Distributed Mutual Exclusion Algorithms 1986 TR Gasarch, A Hierarchy of Functions with Applications to Recursive Graph Theory 1986 TR Knott, Linear Open Addressing and Peterson's Theorem Rehashed 1986 TR Alon & Ravid, Universal Sequences for Complete Graphs 1986 TR Bar-Noy & Borodin & Karchmer & Linial & Werman, Bounds on Universal Sequences 1986 TR Holt, Design Goals for the Turing Programming Language 1986 TR Du & Book, Generalized Complexity Cores 1986 TR Aggarwal & Klawe & Lichtenstein & Linial & Wigderson, A Lower Bound on the Area of Permutation Layouts 1986 TR Hershberger & Guibas, An O(n^2) Shortest Path Algorithm for a Non-Rotating Convex Body 1986 TR Harel, Statecharts: A Visual Formalism for Complex Systems (to appear in Science of Computer Programming) 1986 TR Longpre, Resource Bounded Kolmogorov Complexity, A Link Between Computational Complexity and Information Theory 1986 TR Lamport, A Simple Approach to Specifying Concurrent Systems 1986 TR Adleman & Huang, Recognizing Primes in Random Polynomial Time (abstract) 1986 TR Fortnow, Perfect Zero-Knowledge is co-AM (early draft) 1986 TR Fortnow, The Complexity of Perfect Zero-Knowledge (extended abstract) 1986 TR Micali & Rackoff & Sloan, The Notion of Security for Probabilistic Cryptosystems 1986 TR Babai, Arthur-Merlin Games: A Randomized Proof System, and a Short Hierarchy of Complexity Classes 1986 TR Babai, Random Oracles Separate PSPACE from the Polynomial Time Hierarchy 1986 TR Hemachandra, On Ranking 1986 TR Ajtai & Komlos & Steiger & Szemeredi, Optimal Parallel Selection Has Complexity O(log log n) 1986 TR Allender, P-Uniform Circuit Complexity 1986 TR Van der Mude, Only the Complements of Recursively Enumerable Sets Can Be Reliably Identified in the Limit 1986 TR Snyder, Type Architectures, Shared Memory and the Corollary of Modest Potential 1986 TR Swart, P = NP 1986 TR Hemachandra, The Sky is Falling: The Strong Exponential Hierarchy Collapses 1986 TR Cai & Hemachandra, Exact Counting is as Easy as Approximate Counting 1986 TR Hodel, Optimal Dynamic Embedding of X-trees into Arrays 1986 TR Trahan, Simulations among Multidimensional Iterative Arrays, Iterative Tree Automata, and Alternating Turing Machines 1986 TR Moran, An Improvement of the Hastad-Yao Lower Bound on Parity Circuits 1986 TR Gasarch, The Complexity of Optimization Functions 1986 TR Amir & Gasarch, The Complexity of Functions (And Some Functions of Complexity) 1986 TR Goldberg, Parallel Algorithms for Three Graph Problems 1986 TR Goldberg, A New Max-Flow Algorithm 1986 TR Natarajan, The Complexity of Fine Motion Planning 1986 TR Iwama, Low-Level Tradeoffs between Cross and Alternation 1986 TR Schneider, A Paradigm for Reliable Clock Synchronization 1986 TR Howell & Rosier & Yen, The Boundedness Problem for Conflict-Free Vector Replacement Systems is PTIME-Complete 1986 TR Iwama, ASPACE(o(log log n)) Is Regular 1986 TR Li, Lower Bounds on String-Matching 1986 TR Galil & Kannan & Szemeredi, On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing Machines 1986 TR Miller & Stout, Mesh Computer Algorithms for Computational Geometry 1986 TR Leiserson & Saxe, Retiming Synchronous Circuitry 1986 TR Fich, Notes on Boolean Circuit Complexity 1986 TR Sipser, Lecture Notes on Complexity 1986 TR Royer & Case, Progressions of Relatively Succinct Programs in Subrecursive Hierarchies 1986 TR Abadi & Feigenbaum, Encrypted Questions: How Much Do You Really Have to Trust Your Oracle? (Extended Abstract) 1986 TR Smolensky, Algebraic Methods in the Theory of Lower Bounds for Boolean Circuit Complexity 1986 TR Prill, On Approximations and Incidence in Cylindrical Algebraic Decompositions 1986 TR Awerbuch & Vitanyi, Atomic Shared Register Access by Asynchronous Hardware II 1986 TR Vitanyi & Awerbuch, Atomic Shared Register Access by Asynchronous Hardware using Unbounded Tags 1986 TR Venkateswaran & Tompa, A New Pebble Game that Characterizes Parallel Complexity Classes 1986 TR Homer & Long, Honest Polynomial Degrees and P =? NP 1986 TR Edelsbrunner & Guibas, Topologically Sweeping an Arrangement 1986 TR Geske & Huynh, Hierarchies of Almost Everywhere Complex Sets 1986 TR Torenvliet, Structural Concepts in Relativised Hierarchies 1986 TR Chazelle & Guibas, Fractional Cascading 1986 TR Orponen, The Structure of Polynomial Complexity Cores 1986 TR Reckhow, Physical Realizability of Abstract Machines or How Schoenhage's Machines Cheat (Draft) 1986 TR Ballard & Gardner & Srinivas, Graph Problems and Connectionist Architectures 1985 TR Cohen, Distributed Computation in Neural Networks and their Optical Analogs 1985 TR Kuipers, The Map-Learning Critter 1985 TR Kumar, Branch-and-Bound Search 1985 TR Willard, A Density Control Algorithm for Doing Insertions and Deletions in a Sequentially Ordered File in Good Worst Case Time 1985 TR Haussler, Space Efficient Learning Algorithms 1985 TR Lingas, Advances in Minimum Weight Triangulation 1985 TR Hirschberg & Larmore, The Least Weight Subsequence Problem 1985 TR Hirschberg & Volperg, Improved Update/Query Algorithms for the Interval Valuation Problem 1985 TR Hester & Hirschberg, Generation of Optimal Binary Split Trees 1985 TR Karmarkar & Karp & Lueker & Odlyzko, Probabilistic Analysis of Optimum Partitioning 1985 TR Moret & Shapiro, Using Symmetry and Rigidity: A Simpler Approach to NP-Completeness Proofs 1985 TR Angel, From Dynamic Programming to Fast Transforms 1985 TR Desmedt, Unconditionally Secure Authentication Schemes and Practical and Theoretical Consequences 1985 TR Vishkin & Cole, Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking 1985 TR Gabow & Nishizeki & Kariv, Algorithms for Edge-coloring Graphs 1985 TR Reif & Sharir, Motion Planning in the Presence of Moving Obstacles 1985 TR Manna & Waldinger, The Origin of a Binary-Search Paradigm 1985 TR Nicol, Modelling Solids in Four Dimensions 1985 TR Alpern & Schneider, Verifying Temporal Properties without Using Temporal Logic 1985 TR Shapiro & Anderson, Toward an Ethics and Etiquette for Electronic Mail 1985 TR Galil & Landau & Yung, Distributed Algorithms in Synchronous Broadcasting Networks 1985 TR Li, Lower Bounds in Computational Complexity (thesis) 1985 TR Cull & Gerety, Two Notes on the Complexity of the Towers of Hanoi 1985 TR Cull & Gerety, Is Towers of Hanoi Really Hard? 1985 TR Cull & Gerety, Time Complexity of the Towers of Hanoi Problem 1985 TR Haddad & Knuth, A Programming and Problem-Solving Seminar 1985 TR Maass, On the Use of Inaccessible Numbers and Order Indiscernibles in Lower Bound Arguments for Random Access Machines 1985 TR Lamport, A Fast Mutual Exclusion Algorithm 1985 TR Russo, Structural Properties of Complexity Classes 1985 TR Tiwari, Lower Bounds on Communication Complexity in Distributed Computer Networks 1985 TR Bracha, Randomized Agreement Protocols and Distributed Deadlock Detection Algorithms 1985 TR Hastad, Improved Lower Bounds for Small Depth Circuits 1985 TR Goldwasser & Sipser, Arthur Merlin Games versus Interactive Proof Systems 1985 TR Ambos-Spies, On the Structure of the Polynomial Time Degrees of Recursive Sets (Habilitationsschrift) 1985 TR Ding-Zhu Du, Generalized Complexity Cores and Levelability of Intractable Sets 1985 TR Grollmann & Selman, Complexity Measures for Public-Key Cryptosystems 1985 TR Mannila, Instance Complexity for Sorting and NP-Complete Problems 1985 TR Rovner & Levin & Wick, On Extending Modula-2 for Building Large, Integrated Systems 1985 TR Hoffman & Hopcroft, Quadratic Blending Surfaces 1985 TR Hoffman & Hopcroft, Automatic Surface Generation in Computer Aided Design 1985 TR Babai, A Las-Vegas-NC Algorithm for Finding Pointwise Set-Stabilizers in Permutation Groups with Restricted Composition Factors 1985 TR Babai, On the Length of Subgroup Chains in the Symmetric Group 1984 TR Karp et al., Open Problems Proposed at NSF Regional Conference on Complexity Theory 1984 TR Pitt, A Characterization of Probabilistic Inference 1984 TR Fritzson, Towards a Distributed Programming Environment Based on Incremental Compilation 1984 TR Levcopoulos & Lingas, Bounds on the Length of Convex Partitions of Polygons 1984 TR Levcopoulos & Lingas, Covering Polygons with Minimum Number of Rectangles 1984 TR Tarjan & Vishkin, An Efficient Parallel Biconnectivity Algorithm 1984 TR Atallah & Vishkin, Finding Euler Tours in Parallel 1984 TR Alon & Tarsi, Covering Multigraphs by Simple Circuits 1984 TR Smith & Wolf, Image-to-Image Correspondence: Linear-structure Matching 1984 TR Hirschberg & Larmore, New Applications of Failure Functions 1984 TR Chiang, Towards Concurrent Arithmetic: Residue Arithmetic and VLSI 1984 TR Murgolo, On the Monotonicity of Certain Bin Packing Algorithms 1984 TR Vishkin, On Optimal Parallel Algorithm for Selection 1984 TR Srinivas, Updating Solutions to a Class of Matroid Intersection Problems (thesis) 1984 TR Toueg, Randomized Asynchronous Byzantine Agreements 1984 TR Bracha, An Asynchronous floor((n-1)/3)-Resilient Consensus Protocol 1984 TR Dwork, Bounds on Fundamental Problems in Parallel and Distributed Computation 1984 TR Kranakis, Theoretical Aspects of the Security of Public Key Cryptography 1984 TR Lawson, Addressing Fundamental Problems in Computer Related Education and Training 1984 TR Miller & Stout, Geometric Algorithms for Digitized Pictures on a Mesh-Connected Computer 1984 TR Srikanth & Toueg, Clock Synchronization (Preliminary Version) 1984 TR Vitanyi, Circuit Topology, Signal Propagation Delay and the Efficiency of VLSI Circuits 1984 TR Vitanyi, Signal Propagation Delay, Wire Length Distribution and the Efficiency of VLSI Circuits 1984 TR Goldschlager, A Computational Theory of Higher Brain Function 1984 TR Dwork & Skeen, Patterns of Communication in Consensus Protocols 1984 TR Perry & Toueg, The Byzantine Monkeys Problem 1984 TR Bajaj, Geometric Optimization and Computational Complexity 1984 TR Bajaj, Reducibility among Geometric Location-Allocation Optimization Problems 1984 TR Sipser, A Topological View of Some Problems in Complexity Theory 1984 TR Balcazar, Simplicity for Relativized Complexity Classes (Book collection) 1984 TR Balcazar & Russo, Immunity and Simplicity in Relativizations of Probabilistic Complexity Classes (Book collection) 1984 TR Fraenkel, Systems of Numeration 1984 TR Galil, Open Problems in Stringology 1984 TR Hopcroft & Wilfong, On the Motion of Objects in Contact 1984 TR Li, Universal Separation of Complexity Classes (Detailed Abstract) 1984 TR Li, On the Power of One Tape, and Probabilistic & Nondeterministic Alternation (Extended Abstract) 1984 TR Li, On One Tape versus Two Stacks 1984 TR Maass, Are Recursion Theoretic Arguments Useful in Complexity Theory? 1984 TR Maass, An Optimal Quadratic Lower bound for Random Access Machines and Other Applications of Ramsey's Theorem (Abstract) 1984 TR Simon, An Algorithm to Distinguish Words Efficiently by their Subwords 1984 TR Vitanyi, One Queue or Two Pushdown Stores Take Square Time on a One-Head Tape Unit 1984 TR Narendran & Otto & Winklmann, The Conjugacy Problem for String-Rewriting Systems with Length-Reducing Rules 1984 TR Kannan & Lovasz, Predicting Bits of Algebraic Numbers and Polynomial Factorisation 1984 TR Huang & Steiglitz, A Hierarchical Compaction Algorithm with Low Page-Fault Complexity 1984 TR Huang, On a Simple Primality Testing Algorithm (Abstract) 1984 TR Dietzfelbinger & Maass, Strong Reducibilities in alpha- and beta-Recursion Theory 1984 TR Maass, On the Use of Inaccessible Numbers and Ramsey's Theorem in Lower Bound Arguments for Random Access Machines (Extended Abstract) 1984 TR Vitanyi, Distributed Elections in a Ring of Processors Using Archimedean Time 1983 TR Dreyfus, Why Current Studies of Human Capacities Can Never Be Scientific 1983 TR Angluin & Smith, Inductive Inference: Theory and Methods 1983 TR Jerrum, The Complexity of Finding Minimum-Length Generator Sequences 1983 TR Periera, Can Drawing Be Liberated from the Von Neumann Style? 1983 TR Porter, A Survey of Induction Algorithms for Machine Learning 1983 TR Galil, Efficient Algorithms for Finding Maximal Matching in Graphs 1983 TR Perl, The Bitonic and Odd-Even Networks are More than Merging 1983 TR Chapiro, Sorting by Recursive Partitioning 1983 TR Srihari & Bozinovic, Use of Knowledge in the Visual Interpretation of Cursive Script 1983 TR Traub, Coping with Complexity 1983 TR Galil, Computing D-Optimum Weighing Designs: Where Statistics, Combinatorics, and Computation Meet 1983 TR Traub & Wozniakowski, Information and Computation 1983 TR Halpern, An Efficient Fault-Tolerant Algorithm for Clock Synchronization 1983 TR Chung & Tarjan & Paul & Reischuk, Coding Strings by Pairs of Strings 1983 TR Chen & Schlag & Wong, The Hypercube Connection Network 1983 TR Fischer, The Consensus Problem in Unreliable Distributed Systems (A Brief Survey) 1983 TR Angluin & Lichtenstein, Provable Security of Cryptosystems: A Survey 1983 TR Edelsbrunner & van Leeuwen, Multidimensional Data Structures and Algorithms: A Bibliography 1983 TR Conway, The Case for PL/I as the Language for Instruction in Programming 1983 TR Freivalds, Space and Reversal Complexity of Probabilistic One-Way Turing Machines 1983 TR Hartmanis, On Non-Isomorphic NP Complete Sets 1983 TR Joseph & Young, A Survey of Some Recent Results on Computational Complexity in Weak Theories of Arithmetic 1983 TR Hobby & Knuth, A Programming and Problem-Solving Seminar 1983 TR Knuth & Weening, A Programming and Problem-Solving Seminar 1983 TR Bajaj & Li, On the Duality of Intersections and Closest Points 1983 TR Mahaney & Young, Orderings of Polynomial Isomorphism Types 1983 TR Pippenger, Explicit Constructions of Highly Expanding Graphs (Extended Abstract) 1983 TR Tompa, Probabilistic Factoring Algorithms Can Be Made Errorless 1983 TR van Leeuwen & Wijshoff, Data Mappings in Large Parallel Computers 1983 TR Kramer & van Leeuwen, Systolic Computation and VLSI 1983 TR van Leeuwen, Distributed Computing 1983 TR Wijshoff & van Leeuwen, Periodic Storage Schemes with a Minimum Number of Memory Banks 1983 TR Trum & Wotschke, Descriptional Complexity for Programs 1983 TR Young, Goedel Theorems, Exponential Difficulty and Undecidability of Arithmetic Theories: An Exposition 1983 TR Ullman, Some Thoughts about Supercomputer Organization 1983 TR Berztiss, Towards a Rigorous Curriculum for Computer Science 1982 TR Carroll & Mack, Actively Learning To Use a Word Processor 1982 TR Carroll & Mack, Learning To Use a Word Processor: By Doing, By Thinking, and By Knowing 1982 TR Jefferson & Sowizral, Fast Concurrent Simulation Using the Time Warp Mechanism, Part I, Local Control 1982 TR Trakhtenbrot, A Survey of Russian Approaches to ``Perebor'': Brute Force Search 1982 TR Dowd & Perl & Rudolph & Saks, The Balanced Sorting Network 1982 TR Soloway & Ehrlich & Bonar & Greenspan, What Do Novices Know About Programming? 1982 TR Lenstra, Testing for Algebraicity (extended abstract) 1982 TR Miranker & Winkler, Spacetime Representations of Systolic Computational Structures 1982 TR Miller, How To Write: A Barely Annotated Bibliography 1982 TR Apostolico, On Context Constrained Squares and Repetitions in a String 1982 TR Apostolico & Preparata, A Structure for the Statistics of All Substrings of a Textstring with or without Overlap 1982 TR Bent, Dynamic Weighted Data Structures 1982 TR Reps, Generating Language-Based Environments 1982 TR Baer, Whither a Taxonomy of Computer Systems 1982 TR Schorr, Separation of Deterministic and Non-Deterministic Time Classes of One-Tape Turing Machines 1982 TR Purdom & Brown, Evaluating Search Methods Analytically 1982 TR Baudet, Design and Complexity of VLSI Algorithms 1982 TR Kramer & van Leeuwen, Systolic Computation and VLSI 1982 TR de Bakker & Zucker, Notes on the Denotational Semantics of Concurrency (preliminary version) 1982 TR Angluin, Lecture Notes on the Complexity of Some Problems in Number Theory 1982 TR Micali & Goldwasser, The Information Content of Proof Systems 1982 TR Sipser, On Polynomial versus Exponential Growth 1982 TR Dolev & Strong, Distributed Commit with Bounded Waiting 1982 TR Dolev & Strong, Requirements for Agreement in a Distributed System 1982 TR Dowd, Forcing and the P Hierarchy 1982 TR Greenberg & Fischer, On Computing Weak Transitive Closure in O(log n) Expected Random Parallel Time 1982 TR Gries, The Science of Programming Answer Book 1982 TR Gries, A Note on the Standard Strategy for Developing Loop Invariants and Loops 1982 TR Hartmanis, On the Structure of Feasible Computations 1982 TR Hopcroft & Joseph & Whitesides, Determining Points of a Circular Region Reachable by Joints of a Robot Arm 1982 TR Levin, Do Chips Need Wires? 1982 TR Pan, Trilinear Aggregating is the Basis for the Asymptotically Fastest Known Algorithms for Matrix Multiplication (Extended Abstract) 1982 TR Pan, How To Speed Up Matrix Multiplication? 1982 TR Park, Nondeterministic Networks: Notes on Some Anomalies 1982 TR Valiant, Optimality of a Two-Phase Strategy for Routing in Interconnection Networks 1982 TR Kramer & van Leeuwen, Wire-Routing is NP-Complete 1982 TR Brent & Kung, Systolic Arrays for Linear-Time Polynomial and Integer GCD Computation (Extended Abstract) 1982 TR Kurtz, The Fine Structure of NP: Relativizations (Extended Abstract) 1982 TR Ko, Resource-Bounded Program-Size Complexity and Pseudorandom Sequences (Extended Abstract) 1982 TR Richards & Swart, Traversing Unknown Graphs (Extended Abstract) 1982 TR Bennett & Brassard & Breidbart, Quantum Cryptography II: How to Re-Use a One-Time Pad Safely even if P=NP (Extended Abstract) 1981 TR Sheil, Coping with Complexity 1981 TR Nilsson, Artificial Intelligence: Engineering, Science, or Slogan? 1981 TR Itai & Konheim & Rodeh, A Sparse Table Implementation of Sorted Lists 1981 TR Book, Patterns in Strings 1981 TR Pippenger & Yao, Rearrangeable Networks with Limited Depth 1981 TR Kadin, A Note on the Complexity of Goedel Numberings and Isomorphisms 1981 TR Schlichting & Schneider, An Approach to Designing Fault-Tolerant Computing Systems 1981 TR Duval, Lexicographically Maximal and Minimal Segments of a Word, Linear String Searching Algorithms 1981 TR Duval, Relationship between the Period of a Finite Word and the Length of its Unbordered Segments 1981 TR Melville, Asymptotic Complexity of Iterative Computations (thesis) 1981 TR Cooley, Some Applications of Computational Complexity Theory to Digital Signal Processing 1981 TR Mate, Nondeterministic Polynomial Time Computations and Nonstandard Models of Arithmetic 1981 TR Barzilai & Coppersmith & Rosenberg, Exhaustive Bit Pattern Generation in Discontiguous Positions, with Applications to VLSI Self-Testing 1981 TR Conrad & Rossler, Example of a System which is Computation Universal but not Effectively Programmable 1981 TR Carroll, Modularity and Naturalness in Cognitive Science 1981 TR Haskin & Hollaar, Operational Characteristics of a Hardware-based Pattern Matcher 1981 TR Dolev & Yao, On the Security of Public Key Protocols 1981 TR Fich & Goldwasser, Compression and the Deterministic Time Hierarchy 1981 TR Gacs, Randomness and Probability--Complexity of Description 1981 TR Kedem, A First In, First Out and a Priority Queue 1981 TR Knuth & Miller, A Programming and Problem-Solving Seminar 1981 TR Leiserson, Area-Efficient VLSI Computation (thesis) 1981 TR Lenstra, Integer Programming with a Fixed Number of Variables 1981 TR Mayr, An Effective Representation of the Reachability Set of Persistent Petri Nets 1981 TR Nelson, Techniques for Program Verification 1981 TR Pan, Fast Matrix Multiplication Without APA-Algorithms 1981 TR Park, A Predicate Transformer for Weak Fair Iteration 1981 TR Peterson, Update to: An O(n log n) Unidirectional Algorithm for the Circular Extrema Problem (Rough Draft) 1981 TR Ottmann & Rosenberg & Stockmeyer, A Dictionary Machine (for VLSI) 1981 TR Trakhtenbrot, On Denotational Semantics and Axiomatization of Partial-Correctness for Languages with Procedures as Parameters and with Aliasing 1981 TR van Leeuwen, Graphics and Computational Geometry 1981 TR van Leeuwen, The Bounded Aspect Ratio Problem for VLSI-Layouts of Perfect Binary Trees 1981 TR Ross & Winklmann, Repetitive Strings Are Not Context-free 1981 TR Auslander & Feig & Winograd, New Algorithms for the Multi-dimensional Discrete Fourier Transform 1981 TR Yao, An Optimal Data-Structure for One-Dimensional Range Queries 1981 TR Mayr, Well Structured Parallel Programs Are Not Easier to Schedule 1981 TR Knuth, The Last Whole Errata Catalog 1981 TR Rabin, Fingerprinting by Random Polynomials 1981 TR Karp & Rabin, Efficient Randomized Pattern-Matching Algorithms 1981 TR Hong, On Sorting Almost Sorted Data (draft) 1980 TR Choueka & Schreiber & Slae, The Responsa Project: Computerization of Traditional Jewish Case Law (maybe from Yez (Ed.), Legal and Legislative Information Processing, Greenwood Press, 1980) 1980 TR Quam, A Storage Representation for Efficient Access to Large Multidimensional Arrays 1980 TR Furst & Hopcroft & Luks, A Subexponential Algorithm for Trivalent Graph Isomorphism 1980 TR Pippenger, Pebbling 1980 TR Tredennick & Shimamoto, On Systematic Generation of Scientific Papers (or How To Write a Crummy Paper) 1980 TR Melville, Two-Dimensional Turing Machines with Uninitialized Workspaces 1980 TR Bland & Goldfarb & Todd, The Ellipsoid Method: A Survey 1980 TR Cammack & Cooper, A Classroom Note on Topological Ordering 1980 TR Rubin & West, An Improved Protocol Validation Technique 1980 TR Gould, Composing Letters with Computer-Based Text Editors 1980 TR Chan, Reversal-Bounded Computations 1980 TR Lew, Number Theory Notes 1980 TR Shamir, The Cryptographic Security of Compact Knapsacks (Preliminary Report) 1980 TR Lehmann & Rabin, On the Advantages of Free Choice: A Symmetric and Fully Distributed Solution to the Dining Philosophers Problem 1980 TR Rabin, N-Process Synchronization by 4 log_2 N-Valued Shared Variable 1980 TR Rabin, The Choice Coordination Problem 1980 TR Fischer, On Developing a Theory of Distributed Computing: Summary of Current Research 1980 TR Friedman & Greibach, What a Difference a Da(ta Structure) Makes 1980 TR Gilbert, Graph Separator Theorems and Sparse Gaussian Elimination (thesis) 1980 TR Gries, Educating the Programmer: Notation, Proofs and the Development of Programs 1980 TR Guibas & Odlyzko, Long Repetitive Patterns in Random Sequences 1980 TR Hartmanis, A Note on Natural Creative Sets and Goedel Numberings 1980 TR Immerman, First Order Expressibility as a New Complexity Measure (thesis) 1980 TR Jaffe & Moss, A Responsive Distributed Routing Algorithm for Computer Networks 1980 TR Goldfarb & Todd, Modifications and Implementation of the Shor-Khachian Algorithm for Linear Programming 1980 TR Knuth, Deciphering a Linear Congruential Encryption 1980 TR Aleliunas & Rosenberg, On Embedding Rectangular Grids in Square Grids 1980 TR Borodin, Structured vs. General Models in Computational Complexity 1980 TR Leivant, Implicational Complexity in Intuitionistic Arithmetic 1980 TR Loui, Simulations among Multidimensional Turing Machines (thesis) 1980 TR Meyer & Winklmann, On the Expressive Power of Dynamic Logic 1980 TR Parikh, A Survey of Propositional Dynamic Logics of Programs 1980 TR Peterson, Concurrent Reading While Writing 1980 TR Peterson, A Test-Depth Hierarchy in Propositional Dynamic Logic 1980 TR Peterson, A New Solution to Lamport's Concurrent Programming Problem Using Small Shared Variables 1980 TR Pippenger, Pebbling with an Auxiliary Pushdown 1980 TR Rosenberg, Issues in the Study of Data Encodings (Extended Abstract) 1980 TR Simon, Machine-based Computational Complexity: A Brief and Biased Survey (preliminary version) 1980 TR Sleator, An O(nm log n) Algorithm for Maximum Network Flow 1980 TR Schoone & van Leeuwen, Triangulating a Star-Shaped Polygon 1980 TR Vilfan, A New 4 x 4 Matrix Product Algorithm with 55 Multiplications 1980 TR Vilfan, A Note on Strassen's Matrix Multiplication Algorithm 1980 TR Vitanyi, Real-Time Turing Machines under Varying Specifications II 1980 TR Wand, Different Advice on Structuring Compilers and Proving Them Correct 1980 TR Wand, Deriving Target Code as a Representation of Continuation Semantics 1980 TR Wand, Continuation-Based Multiprocessing 1980 TR Tarjan, Recent Developments in the Complexity of Combinatorial Algorithms 1980 TR Baratz, The Complexity of the Maximum Network Flow Problem (thesis) 1979 TR Manna & Pnueli, The Modal Logic of Programs 1979 TR Harel & Lueker, A Data Structure with Movable Fingers and Deletions 1979 TR Hemmerling, On the Space Complexity of Multidimensional Turing Automata 1979 TR Loui, Minimum Register Allocation is Complete in Polynomial Space 1979 TR Gacs & Kurdiumov & Levin, One-Dimensional Homogenuous Media, Dissolving Finite Islands (Abstract) 1979 TR Gacs, Exact Expressions for Some Randomness Tests 1979 TR Bennett, On Random and Hard-to-Describe Numbers 1979 TR Kemperman, On Multiplying Large Periodic Integers 1979 TR Goldberg, On the Complexity of the Satisfiability Problem 1979 TR Bertoni & Mauri, On Efficient Computation of the Coefficients of Some Polynomials with Applications to Some Counting Problems 1979 TR Shamir, On the Cryptocomplexity of Knapsack Systems 1979 TR Shamir & Rivest & Adleman, Mental Poker 1979 TR Rabin, Digitalized Signatures and Public-Key Functions as Intractable as Factorization 1979 TR Rabin, Probabilistic Algorithms in Finite Fields 1979 TR Meyer & Paterson, With What Frequency are Apparently Intractable Problems Difficult? 1979 TR Alt & van Leeuwen, The Complexity of Basic Complex Operations 1979 TR Adleman, Time, Space and Randomness 1979 TR Abramson & Breitbart & Lewis, Complex Properties of Grammars 1979 TR Abramson, A Simplicity Theorem for Amoebas Over Random Reals 1979 TR Abelson, Structural Complexity of Distributed Computations (grant proposal) 1979 TR Book, On Relativizations of the NP =? PSPACE Question 1979 TR Booth & Colbourn, Problems Polynomially Equivalent to Graph Isomorphism 1979 TR Breidbart, APL and the Grzegorczyk Hierarchy 1979 TR Dietz & Furst & Hopcroft, A Linear Time Algorithm for the Generalized Consecutive Retrieval Problem 1979 TR Elgot & Miller, On Coordinated Sequential Processes 1979 TR Euler, Leonhard Euler and the Koenigsberg Bridges 1979 TR Fischer & van Leeuwen, Reducing 3DM to CLIQUE and HAMILTONIAN CIRCUIT 1979 TR Furer, Generalized Iterative Arrays (Extended Abstract) 1979 TR Gacs, Khachian's Algorithm for Linear Programming 1979 TR Greif & Meyer, Specifying the Semantics of While-Programs: A Tutorial and Critique of a Paper by Hoare and Lauer 1979 TR Gries, Yet Another Exercise: Using Two Shared Variables in Two Processes to Provide Starvation-Free Mutual Exclusion 1979 TR Grigoriev, Time Complexity of Multidimensional Turing Machines 1979 TR Guibas & Odlyzko, String Overlaps, Pattern Matching, and Nontransitive Games 1979 TR Kamin, Rationalizing Many-Sorted Algebraic Theories 1979 TR Van Wyk & Knuth, A Programming and Problem-Solving Seminar 1979 TR Foster & Kung, Design of Special-Purpose VLSI Chips: Example and Opinions 1979 TR Leivant, On Easily Infinite Sets and on a Statement of R. Lipton 1979 TR Leivant, Proof Theoretic Maximality of Logical Calculi 1979 TR Leivant, On Linear Natural Deduction 1979 TR Majster, A Unified View of Semantics 1979 TR Mehlhorn, Pebbling a Mountain Range with O((log n)^2/log log n) Space and Polynomial Time Simultaneously 1979 TR Perry, An Improved Proof of the Rabin-Hartmanis-Stearns Conjecture 1979 TR Peterson, Concurrency and Complexity (thesis reprint) 1979 TR Rosenberg, On Embedding Graphs in Grids 1979 TR Salton & Bergmark, A Citation Study of the Computer Science Literature 1979 TR Semeniuk, Groups with Solvable Word Problems 1979 TR Kowaltowski & Simon, More about Traversing Trees without Auxiliary Storage 1979 TR Spirn & Tsur, Memory Management for B-Trees 1979 TR Falkoff, A Note on Pattern-Matching: Where Do You Find the Match to an Empty Array? 1979 TR Griesmer, The State of Symbolic Computation 1979 TR Overmars & van Leeuwen, Rapid Subtree Identification Revisited 1979 TR van Leeuwen, On Program Efficiency and Algebraic Complexity 1979 TR Vitanyi, Multihead and Multitape Real-Time Turing Machines 1979 TR Woods, Notes on Introductory Combinatorics 1979 TR Wyllie, The Complexity of Parallel Computations (thesis) 1979 TR Graham & Yao & Yao, Some Monotonicity Properties of Partial Orders 1979 TR Graham & Sloane, On Constant Weight Codes and Harmonious Graphs 1979 TR West, Gossiping without Duplicate Transmissions 1979 TR Shiloach, Union-Member Algorithms for Non-Disjoint Sets 1979 TR Knuth, The Errata of Computer Programming 1979 TR Liang, Qualifying Examinations in Computer Science, 1965-1978 1979 TR Ramshaw, Formalizing the Analysis of Algorithms (thesis) 1979 TR Ad Hoc Committee on Applied Mathematics Training & Assembly of Mathematical and Physical Sciences & National Research Council, The Role of Applications in the Undergraduate Mathematics Curriculum 1979 TR Yap, On Lifted Problems 1978 TR Shamir & Zippel, On the Security of the Merkle-Hellman Cryptographic Scheme 1978 TR Shamir, A Fast Signature Scheme 1978 TR Rabin, Probabilistic Algorithm for Testing Primality 1978 TR Rabin, Digitalized Signatures 1978 TR Baratz, An Analysis of the Solovay and Strassen Test for Primality 1978 TR Barth, One Pass and Extended String Matching 1978 TR Book, On Polynomial Time vs. Polynomial Space 1978 TR Conway, A Survey of Graduate Programs in Computer Science 1978 TR Gudes, Data Base System/Operating System Interface 1978 TR Gray, Notes on Data Base Operating Systems 1978 TR Laskowski & Dobkin, The Structure and Rank of m x p x q Tensors: The Heuristic Approach 1978 TR Dyer, One-Way Bounded Cellular Acceptors 1978 TR Dyer, Memory-Augmented Cellular Automata for Image Analysis 1978 TR Crowder & Dembo & Mulvey, On Reporting Computational Experiments with Mathematical Software 1978 TR Burns & Fischer & Jackson & Lynch & Peterson, Shared Data Requirements for Implementation of Mutual Exclusion Using a Test-and-Set Primitive 1978 TR Brassard & Fortune & Hopcroft, A Note on Cryptography and NP intersect CoNP minus P 1978 TR Grigoriev, Some New Bounds on Tensor Rank 1978 TR Harel, Characterizing Second Order Logic with First Order Quantifiers 1978 TR Hoffman, Some Greedy Ideas 1978 TR Jacobs, alpha-Naming and alpha-Speedup Theorems 1978 TR Jaffe, An Analysis of Preemptive Multiprocessor Job Scheduling 1978 TR Jaffe, The Use of Queues in the Parallel Data Flow Evaluation of ``if-then-while'' Programs 1978 TR Katseff, A Solution to the Critical Section Problem with a Totally Wait-Free FIFO Doorway 1978 TR Konheim, Cryptographic Methods for Data Protection 1978 TR Lee & de Roever & Gerhart, The Evolution of List-Copying Algorithms and the Need for Structured Program Verification 1978 TR Loui, Adleman's Proof 1978 TR Lynch, Insert-Search Tradeoff: Very Rough Draft 1978 TR Megiddo & Galil, On Fulkerson's Conjecture about Consistent Labeling Processes 1978 TR Mehlhorn, Arbitrary Weight changes in Dynamic Trees 1978 TR Miller & Rosenberg, On Computing Distances between Leaves 1978 TR Ottmann & Wood, 1-2 Brother Trees or AVL Trees Revisited 1978 TR Parikh, A Completeness Result for a Propositional Dynamic Logic 1978 TR Parikh, Effectiveness 1978 TR Peterson, An Upper bound on the Size of Formulae for Symmetric Boolean Functions (extended abstract) 1978 TR Pippenger, On the Application of Coding Theory to Hashing 1978 TR Pratt, Applications of Modal Logic to Programming 1978 TR Pratt, Six Lectures on Dynamic Logic 1978 TR Reif, A Note on the Complexity of Imbedding Extension Problems 1978 TR Reischuk, Pebbling the Jellyfish-Graph 1978 TR Rosenberg, The Hardest Natural Languages 1978 TR Saxe, On the Number of Range Queries in k-Space 1978 TR Schwartz, A Survey of Program Proof Technology 1978 TR Sethi, Semantics of the C Programming Language, Part 1: Statements 1978 TR Shiloach, An O(n log^2 n) Maximum-Flow Algorithm 1978 TR Gilbert & Tarjan, Variations of a Pebble Game on Graphs 1978 TR van Emde Boas & van Leeuwen, Move Rules and Trade-offs in the Pebble Game 1978 TR van Leeuwen, Linear Time Generation of a New Fixed-Length Data-Compression Code 1978 TR Winograd, On the Multiplicative Complexity of the Discrete Fourier Transform 1978 TR Vaishnavi & Wood, The Optimal Encoding of Search Trees in Single-Forward-Reference Lists 1978 TR Wood, Lecture Notes on Top-Down Syntax Analysis 1978 TR Harel, Logics of Programs: Axiomatics and Descriptive Power (thesis) 1978 TR Kosaraju, Real-time Simulation of Multihead Reset Tape Units (Preliminary Version) 1978 TR Lang, Comprehensive Examinations in Computer Science, 1972-1978 1978 TR Manna, Six Lectures on the Logic of Computer Programming 1978 TR McCarthy et al., Recent Research in AI and Foundations of Programming 1978 TR Kung & Leiserson, Systolic Arrays for (VLSI) 1978 TR Bermond & Germa & Heydemann, Hamiltonian Cycles in Strong Products of Graphs 1978 TR Fagin & Nievergelt & Pippenger & Strong, Extendible Hashing--A Fast Access Method for Dynamic Files 1977 TR Monien, Hierarchies for Unary Languages 1977 TR Chaitin, An Information-Theoretic Proof that There are Infinitely Many Primes 1977 TR Chaitin & Schwartz, A Note on Monte Carlo Primality Tests and Algorithmic Information Theory 1977 TR Shamir, Factoring Numbers in O(log n) Arithmetic Steps 1977 TR Shamir, Finding Minimum Cutsets in Reducible Graphs 1977 TR Rivest, Remarks on a Proposed Cryptanalytic Attack of the ``M. I. T. Public-Key Cryptosystem'' 1977 TR Rivest & Shamir & Adleman, On Digital Signatures and Public-Key Cryptosystems 1977 TR Chaitin, Algorithmic Information Theory 1977 TR Agarwal & Cooley, New Algorithms for Digital Convolution 1977 TR Apers, Average Case Analysis of Dinic-Karzanov Network Flow Algorithm 1977 TR Baratz, Construction and Analysis of Network Flow Problem Which Forces Karzanov Algorithm to O(n^3) Running Time 1977 TR Burge, A Correspondence between Two Sorting Methods 1977 TR Dobkin & Munro, A Minimal Space Selection Algorithm That Runs in Linear Time 1977 TR Galil, Relating Two Graph Problems 1977 TR Gilmore, Cutting Stock, Linear Programming, Knapsacking, Dynamic Programming and Integer Programming, Some Interconnections 1977 TR Gries, A Note on Iteration 1977 TR Gries, Assignment to Subscripted Variables 1977 TR Guibas & Odlyzko, On the Correlations of Strings 1977 TR Harel & Meyer & Pratt, Computability and Completeness in Logics of Programs 1977 TR Hoffman, The Role of Unimodularity in Applying Linear Inequalities to Combinatorial Theorems 1977 TR Igarashi, Analysis of Dunham and Fridshal's Formulas Consisting of Large Numbers of Prime Implicants 1977 TR Clancy & Knuth, A Programming and Problem-Solving Seminar 1977 TR Kozen, First Order Predicate Logic without Negation is NP-Complete 1977 TR Kozen, Finitely Presented Algebras and the Polynomial Time Hierarchy 1977 TR Lew, Two Dozen Problems 1977 TR Lipton & Miller, Linear Time Coloring of Planar Graphs 1977 TR Liu, General Flow Problems and Graph Grammars 1977 TR Miller & Yap, Formal Specification and Analysis of Loosely Connected Processes 1977 TR Pippenger, Selecting without Random-Access Storage 1977 TR Pohl, Improvements to the Dinic-Karzanov Network Flow Algorithm 1977 TR Simmons & Norris, Preliminary comments on the M. I. T. Public-Key Cryptosystem 1977 TR Blum & Sakoda, On the Capability of Finite Automata in 2 and 3 Dimensional Space 1977 TR Simon, On Some Subrecursive Reducibilities 1977 TR Simon, On Tape-bounded Probabilistic Computations 1977 TR Simon, Physical Limits on the Speed of Computing 1977 TR Storer, NP-Completeness Results Concerning Data Compression 1977 TR Belady & Lehman, The Characteristics of Large Systems 1977 TR van Leeuwen & van der Weide, Alternative Path Compression Techniques 1977 TR Wand & Friedman, Compiling Lambda Expressions Using Continuations and Factorizations 1977 TR Wand, Algebraic Theories and Tree Rewriting Systems 1977 TR McCarthy, Recent Research in Computer Science 1977 TR Leung, Fast Algorithms for Packing Problems (thesis) 1977 TR Slisenko, String-Matching in Real Time (Russian) 1976 TR Rabin, Probabilistic Algorithms 1976 TR Chaitin, A Toy Version of the LISP Language 1976 TR Allen, Annotated Bibliography of Selected Papers on Program Optimization 1976 TR Angluin, An Application of the Theory of Computational Complexity to the Study of Inductive Inference (thesis) 1976 TR Chandra, Maximal Parallelism in Matrix Multiplication 1976 TR Constable, Language Features that Support Program Verification (illustrated in PL/C) 1976 TR Conway, PL/CS--A Highly Disciplined Subset of PL/C 1976 TR Demers & Kelemen & Reusch, On Encryption Systems Realized by Finite Transducers 1976 TR DeMillo & Eisenstat & Lipton, Preserving Average Proximity in Arrays 1976 TR Dobkin & Lipton & Reiss, Excursions into Geometry 1976 TR Dowd, Primitive Recursive Arithmetic with Recursion on Notation and Boundedness (thesis) 1976 TR Even, The Max Flow Algorithm of Dinic and Karzanov: An Exposition 1976 TR Friedman & Wise, The Impact of Applicative Programming on Multiprocessing 1976 TR Goguen & Thatcher & Wagner & Wright, A Junction between Computer Science and Category Theory, I: Basic Concepts and Examples (Part 2) 1976 TR Griffiths & Steele, Automatic Synthesis of Semaphore Solutions to Synchronization Problems 1976 TR Hoffman & Schwartz, On Partitions of a Partially Ordered Set 1976 TR Igarashi, Tape Bounds for Some Subclasses of Deterministic Context-Free Languages 1976 TR Kosaraju, Recognition of Context-free Languages by Random Access Machines 1976 TR Kou & Stockmeyer & Wong, The Complexity of the Minimal Edge Clique Cover Problem with Application to Keyword Conflicts and Intersection Graphs 1976 TR Lempel & Cohn & Eastman, A New Class of Balanced Binary Sequences with Optimal Autocorrelation Properties 1976 TR DeMillo & Dobkin & Lipton, Even Data Bases That Lie Can Be Compromised 1976 TR Lipton, The Reachability Problem Requires Exponential Space 1976 TR Manacher, An Improved Version of the Cocke-Younger-Kasami Algorithm (Preliminary Draft) 1976 TR Moshell & Rothstein, Immediate Languages 1976 TR Nelson, One-way Automata on Bounded Languages 1976 TR Pratt, Semantical Considerations on Floyd-Hoare Logic 1976 TR Rivest, On the Worst-Case Behavior of String-Searching Algorithms 1976 TR Rodeh & Pratt & Even, A Linear Algorithm for Finding Repetitions and its Applications in Data Compression 1976 TR Rosen, The Toy Language Syndrome 1976 TR Schoenhage, The Production of Partial Orders 1976 TR Seiferas & Weicker, Linear-Time Simulation of an Iterative Array of Finite-State Machines by a Boolean RAM with Uniform Cost Criterion 1976 TR Seiferas, A Note on Notions of Tape Constructibility 1976 TR Stephenson, A Method for Constructing Binary Search Trees by Making Insertions at the Root 1976 TR Stockmeyer, Arithmetic versus Boolean Operations in Idealized Register Machines 1976 TR Kieburtz & Cherniavsky, Axioms for Structural Induction on Programs Containing Block Exits 1976 TR Winograd, On Computing the Discrete Fourier Transform 1976 TR Friedman & Wise & Wand, Recursive Programming through Table Look-up 1976 TR Baker, Multi-level String Matching--A Technique for Rapid Exact-Match Subarray Identification in More than One Dimension 1976 TR Abramson & Harrington, Models without Indiscernibles 1976 TR Heller, A Survey of Parallel Algorithms in Numerical Linear Algebra 1976 TR Schneider, Synchronization of Finite State Shared Resources (thesis) 1976 TR Chung & Liu, A Generalization of Ramsey Theory for Graphs 1976 TR McCord, A Survey of Uniformly Structured Automata (thesis) 1976 TR Abramson, Interpolation in the Model Theory of Schemata 1976 TR Kintala & Basu, Crossing Automata and Context-free Languages 1975 TR Shamos, Problems in Computational Geometry 1975 TR Hartmanis, On Effective Speed-Up and Long Proofs of Trivial Theorems in Formal Theories 1975 TR Ausiello, Simple Programs on Strings and Their Decision Problems 1975 TR Bayer, Improved Bounds on the Costs of Optimal and Balanced Binary Search Trees 1975 TR Booth, PQ-Tree Algorithms (thesis) 1975 TR Cardoza, Computational Complexity of the Word Problem for Commutative Semigroups (thesis) 1975 TR Coffman & Sethi, A Generalized Bound on LPT Sequencing 1975 TR Fischer, The Complexity of Negation-Limited Networks--A Brief Survey 1975 TR Hack, Decision Problems for Petri nets and Vector Addition Systems 1975 TR Jacobs, alpha-Computational Complexity (thesis) 1975 TR Lamport, On Concurrent Reading and Writing 1975 TR Lipton, On Groups with Logspace Word Problems (extended abstract) 1975 TR Lipton, The Reachability Problem Requires Exponential Space 1975 TR Patil, An Asynchronous Logic Array 1975 TR Hopcroft & Paul, A Graph Theoretical Approach to Time versus Space and Other Results 1975 TR Paul, Time <> Space for Multitape Turing Machine Computations 1975 TR Paul, Lower Bound and Optimal Strategy for a Pebble Game 1975 TR Paul, On Trade-off between On-line and Off-line Turing Machine Computations 1975 TR Pippenger, Short Monotone Formulae for Threshold Functions 1975 TR Pippenger, The Distribution of Numbers with a Prescribed Number of Prime Factors among Residue Classes 1975 TR Rosenberg & Stockmeyer, Techniques for Storing Extendible Arrays 1975 TR Schnorr, Exponential Lower Bounds on Monotone Boolean Computations 1975 TR Simon, On Some Central Problems in Computational Complexity 1975 TR Stockmeyer, The Set Basis Problem is NP-Complete 1975 TR van Leeuwen & van Emde Boas, Some Elementary Proofs of Lower-Bounds in Complexity Theory 1975 TR Wrathall, Subrecursive Predicates and Automata (thesis) 1975 TR Barto, Cellular Automata as Models of Natural Systems (thesis) 1975 TR Owicki, Axiomatic Proof Techniques for Parallel Programs (thesis) 1975 TR Fischer, On Parsing Context Free Languages in Parallel Environments (thesis) 1975 TR Lamagna, The Complexity of Monotone Functions (thesis) 1975 TR Goguen & Thatcher & Wagner & Wright, An Introduction to Categories, Algebraic Theories and Algebras 1974 TR Downey, Formal Languages and Recursion Schemes (thesis) 1974 TR Kedem, The Reduction Method for Establishing Lower Bounds on the Number of Additions 1974 TR Kosaraju, Context-free Preserving Functions 1974 TR Kosaraju, Regularity Preserving Functions 1974 TR Lind, Computing in Logarithmic Space 1974 TR Meyer, Discrete Computation: Theory and Open Problems 1974 TR Pless, Mathematical Foundations of Flip-Flops 1974 TR Rosenberg, On Storing Arbitrarily Many Extendible Arrays of Arbitrary Dimensions 1974 TR Schoenhage, The 1.75n Lower Bound for a Variant of the Median Problem 1974 TR Wand, The Frame Model of Computation 1974 TR Wotschke, Boolean Operators on Languages (thesis) 1974 TR Seiferas, Nondeterministic Time and Space Complexity Classes (thesis) 1974 TR Stockmeyer, The Complexity of Decision Problems in Automata Theory and Logic 1974 TR van Emde Boas, Abstract Resource-Bound Classes (thesis) 1974 TR Wand, Lectures on Induction and Recursion 1974 TR Friedman, Deterministic Languages and Monadic Recursion Schemes (thesis) 1974 TR Abramson, Flipping Properties and Equiconsistency Results for Large Cardinals (thesis) 1973 TR Kedem, Studies in Algebraic Computational Complexity (thesis) 1973 TR Kfoury, A Short Bibliography on Program Schemas 1973 TR Knuth, Sorting and Searching--Errata and Addenda 1973 TR Kung, Fast Evaluation and Interpolation 1973 TR Rosenberg, Generalized Addressing Schemes for Data Graphs 1973 TR Schoenhage, Real-Time Simulation of Multidimensional Turing Machines by Storage Modification Machines 1973 TR Schoenhage, How to Determine the Median of n Elements by ~3n Steps 1973 TR Traub, Theory of Optimal Algorithms 1973 TR Traub, An Introduction to Some Current Research in Numerical Computational Complexity 1973 TR Valiant, Decision Procedures for Families of Deterministic Pushdown Automata (thesis) 1973 TR Johnson, Near-Optimal Bin Packing Algorithms 1973 TR Hoare, Hints on Programming Language Design 1973 TR Lamagna & Savage, On the Logical Complexity of Symmetric Switching Functions in Monotone and Complete Bases 1973 TR Cousineau & Rifflet, Interpretation Languages of Recursive Schemes 1972 TR Baker & Book, Context-Sensitive Grammars Generating Context Free Languages 1972 TR Filotti, The Primitive Recursive Permutations Generate the Group of Recursive Permutations 1972 TR Bagchi, Economy of Descriptions and Minimal Indices 1972 TR Baker, An Extended Linear Pattern Matching Algorithm Applied to Rectangular Arrays 1972 TR Chvatal & Klarner & Knuth, Selected Combinatorial Research Problems 1972 TR Martin, The Priority Method of Sacks 1972 TR Paterson, Decision Problems in Computational Models 1972 TR Rosenberg, Quasi-Addressable Data Graphs 1972 TR Rosenberg, An Extrinsic Characterization of Addressable Data Graphs 1972 TR Rosenberg, Suffixes of Addressable Data Graphs 1972 TR Shamir, Relations between Time and Storage Complexity via Pushdown Machines 1972 TR Schnorr, Does Speed-Ups of Recursive Functions Concern Practical Programming? 1972 TR Monien, A T(n) Time-bounded Turing Machine May Be Simulated by a (log T(n))^2 Tape-bounded Deterministic Turing Machine 1972 TR Traub, Numerical Mathematics and Computer Science 1971 TR Rothstein, Patterns and Algorithms 1971 TR Cobham, A Relation between Real-Time Recognizable Sets and Real-Time Generable Sequences 1971 TR Knuth, The Art of Computer Programming--Errata et Addenda 1971 TR Schwartz, What is Programming? 1971 TR Knuth & Pratt, Automata Theory Can Be Useful (rough draft) 1971 TR Simpson, Admissible Ordinals and Recursion Theory (thesis) 1970 TR Siklossy, On a Distant Function for Ordered Lists 1970 TR Bruere-Dawson, Pseudo-Random Sequences 1970 TR Cook, Linear Time Simulation of Deterministic Two-Way Pushdown Automata 1970 TR Winograd, On Multiplication of 2 x 2 Matrices 1969 TR Beyer, Recognition of Topological Invariants by Iterative Arrays (thesis) 1969 TR Graham, Use of High Level Languages for Systems Programming 1969 TR Meyer, Theories of Computational Complexity 1969 TR Kosaraju, Computations on Iterative Automata (thesis) 1969 TR Dijkstra, Notes on Structured Programming 196? TR Blum & Hewitt, Automata on a 2-Dimensional Tape 196? TR Hopcroft & Ullman, A Note on Real Time Computation 1966 TR Cobham, Time and Memory Capacity Bounds for Machines which Recognize Squares or Palindromes 1965 TR Ofman, A Universal Automaton 1964 TR Cole, Real-Time Computation by Iterative Arrays of Finite-State Machines (thesis) 1960 TR Rabin, Degree of Difficulty of Computing a Function and a Partial Ordering of Recursive Sets 1976 TRAUB Karp, The Probabilistic Analysis of Some Combinatorial Search Algorithms 1976 TRAUB Rabin, Probabilistic Algorithms 1976 TRAUB Garey & Johnson, Approximation Algorithms for Combinatorial Problems: An Annotated Bibliography 1976 TRAUB Ullman, The Complexity of Code Generation 1976 TRAUB Tarjan, Iterative Algorithms for Global Flow Analysis 1976 TRAUB Traub & Wozniakowski, Optimal Linear Information for the Solution of Non-Linear Operator Equations 1976 TRAUB Gosper, A Calculus of Rearrangements 1976 TRAUB Kung, Synchronized and Asynchronous Parallel Algorithms for Multiprocessors 1976 TRAUB Bank & Rose, Extrapolated Fast Direct Algorithms for Elliptic Boundary Value Problems 1976 TRAUB Shamos, Geometry and Statistics: Problems at the Interface 1976 TRAUB Simon & Kadane, Problems of Computational Complexity in Artificial Intelligence 1976 TRAUB Moses, Algebraic Structures and Their Algorithms 1976 TRAUB Brent, Analysis of the Binary Euclidean Algorithm 1976 TRAUB Knuth & Yao, The Complexity of Nonuniform Random Number Generation 1992 TSCS Knuth, Context-Free Multilanguages 1992 TSCS Harrison, Proving Nonmembership in Certain Families of Context-Free Languages 1992 TSCS Greibach & Shi & Simonson, Single Tree Grammars 1992 TSCS Rosenkrantz & Hunt, The Complexity of Structural Containment and Equivalence 1992 TSCS Ullman, The Interface Between Language Theory and Database Theory 1992 TSCS Vardi, Automata Theory for Database Theoreticians 1992 TSCS Dong, On Datalog Linearization of Chain Queries 1992 TSCS Abiteboul & Vianu, Expressive Power of Query Languages 1992 TSCS Hull & Yoshikawa, Object Identity and Query Equivalences 1992 TSCS Chen & McLeod, A Unified Approach to Data and Meta-Data Modification for Data/Knowledge Bases 1992 TSCS Horowitz & Papa, Polygon Clipping: Analysis and Experiences 1993 2 TTN Morin, UK TeX Archive on CD-ROM 1993 2 TTN Greenwade, The CTAN Archives 1993 2 TTN Jones, Jones Index of TeX Macros 1993 2 TTN Becker, How Do I Print Envelopes? 1993 2 TTN Haralambous, DC Fonts -- Questions and Answers (II) 1993 2 TTN Thiele, Files To Print Up Font Tables 1992 1 TTN Haralambous, What are DC Fonts? 1992 1 TTN Thiele, Correction Notice: Margin Marks from TTN 1,3 1992 1 TTN Haralambous, DC Fonts -- Questions and Answers (I) 1992 1 TTN Eijkhout, Lollipop Now Available 1992 1 TTN Schmitt, Marking Lines in the Margin 1995 16 TUGBOAT Childs & Dunn & Lively, Teaching CS/1 Courses in a Literate Manner 1995 16 TUGBOAT Goossens & Saarela, TeX to HTML and Back 1994 15 TUGBOAT Haralambous, Typesetting the Holy Bible in Hebrew, with TeX 1994 15 TUGBOAT Patashnik, BIBTeX 1.0 1994 15 TUGBOAT Kawaguti & Kitajima, Concurrent Use of Interactive TeX Previewer with an Emacs-type Editor 1994 15 TUGBOAT Walsh, A World Wide Web Interface to CTAN 1994 15 TUGBOAT Ramasubramanian & Nickalls & Reed, ASCII.sty (version 1): A New Style-Option and Encoded Font with IBM Graphics Control Characters for Use with TeX & LaTeX 1994 15 TUGBOAT Eijkhout, review of Walsh, Making TeX Work (O'Reilly & Associates, 1994) 1993 14 TUGBOAT Becker, Two Extensions to GNU Emacs that Are Useful when Editing TeX Documents 1993 14 TUGBOAT Aslaksen, Ten TeX Tricks for the Mathematician 1993 14 TUGBOAT Doob & Platt, Virtual Fonts in a Production Environment 1993 14 TUGBOAT Horn, Where Are the Math Fonts? 1993 14 TUGBOAT Jeffrey, A PostScript Font Installation Package Written in TeX 1993 14 TUGBOAT Fine, Galleys, Space, and Automata 1993 14 TUGBOAT van der Laan, Syntactic Sugar 1993 14 TUGBOAT van der Laan, Sorting within TeX 1993 14 TUGBOAT Reese, How to Set Up and Maintain a TeX System 1993 14 TUGBOAT Greenwade, The Comprehensive TeX Archive Network (CTAN) 1993 14 TUGBOAT Poppelier, Review of Recent LaTeX Books 1993 14 TUGBOAT Collins, ET -- A TeX-Compatible Editor for MSDOS Computers 1993 14 TUGBOAT Taylor, A Pragmatic Approach to Paragraphs 1993 14 TUGBOAT Vesilo & Dunn, A Multimedia Document System Based on TeX and DVI Documents 1993 14 TUGBOAT Radel, Review of: Modern TeX and Its Applications (by Vulis, CRC Press, 1993) 1993 14 TUGBOAT Taylor, Review of: Mathematical TeX by Example (by Borde, Academic Press, 1993) 1993 14 TUGBOAT Saludes, Using TeX to make Agendas and Calendars with Astronomical Events 1993 14 TUGBOAT Zbikowski, Hacker's Guide to AmSFonts and NFSS in the Context of LaTeX 1992 13 TUGBOAT Taylor, The Future of TeX 1992 13 TUGBOAT Chapman, Searching in a DVI File 1992 13 TUGBOAT Sauter, Postnet Codes Using METAFONT 1992 13 TUGBOAT Eijkhout, review of Snow TeX for the Beginner (Addison-Wesley, 1992) 1992 13 TUGBOAT Greenwade, review of TeX by Example: A Beginner's Guide (Academic Press, 1992) 1992 13 TUGBOAT Anagnostopoulos, ZzTeX: A Macro Package for Books 1992 13 TUGBOAT Piff, Text Merges in TeX and LaTeX 1992 13 TUGBOAT Rahtz, A Style File for Printing Sheets of Labels 1992 13 TUGBOAT Clark, Portable Graphics in TeX 1992 13 TUGBOAT Bennett, T-EDIT, A Collection of Editing Macros for TeX 1992 13 TUGBOAT Thorup, GNU Emacs as a Front End to LaTeX 1992 13 TUGBOAT Damrau, Discovering Graphics in LaTeX Documents 1992 13 TUGBOAT Harris, Preparing Halftones for Use in TeX 1992 13 TUGBOAT Burbank & Burnette, Using TeX for a Publications Database 1992 13 TUGBOAT Rahtz & Barroca, A Style Option for Rotated Objects in LaTeX 1992 13 TUGBOAT Poppelier, review of Hahn, LaTeX for Everyone (Personal TeX Inc., 1991) 1992 13 TUGBOAT Poppelier, review of van Herwijnen, Practical SGML (Kluwer, 1990) 1992 13 TUGBOAT Taylor, review of Eijkhout, TeX by Topic (Addison-Wesley, 1991) 1992 13 TUGBOAT Jones, A TeX Macro Index 1992 13 TUGBOAT Luvisetto & Ugolini, From TeX to LaTeX 1992 13 TUGBOAT Wonneberger & Mittelbach, SGML -- Questions and Answers 1992 13 TUGBOAT The TUG DVI Driver Standards Committee, The DVI Driver Standard, Level 0 1992 13 TUGBOAT Hoenig, Controlling Interline Spacing in TeX and LaTeX 1992 13 TUGBOAT Siebenmann, Elementary Text Processing and Parsing in TeX -- the appreciation of tokens -- 1992 13 TUGBOAT van der Laan, Tower of Hanoi, revisited 1992 13 TUGBOAT Mittelbach & Rowley, LaTeX --> LaTeX3 1991 12 TUGBOAT Laan, Math into BLUes, Part I: Mourning 1991 12 TUGBOAT Damrau & Wester, Form Letters with 3-Across Labels Capability 1991 12 TUGBOAT Sowa, Bitmaps and Halftones with BM2FONT 1991 12 TUGBOAT Haralambous, TeX and Those Other Languages 1991 12 TUGBOAT Bartlett, Contra-LaTeX, or What Really Works in the Publishing World 1991 12 TUGBOAT Weiss, Producing a Book using TeX: How the Process Works 1991 12 TUGBOAT Nieland, Sources of TeX Software 1991 12 TUGBOAT Hosek, TeX Output Devices 1991 12 TUGBOAT , TeX Archives 1991 12 TUGBOAT Beebe, Publications about TeX and Typography 1991 12 TUGBOAT Fossmeier, X Bitmaps in TeX 1991 12 TUGBOAT Eijkhout, The Structure of the TeX Processor 1991 12 TUGBOAT De Smet, TeX Macros for Producing Multiple-Choice Tests 1991 12 TUGBOAT Vulis, TeX and Envelopes 1991 12 TUGBOAT Mittelbach & Schopf, Towards LaTeX 3.0 1991 12 TUGBOAT Clark, Post Congress Tristesse 1991 12 TUGBOAT van der Laan, SGML (, TeX and ...) 1991 12 TUGBOAT Poppelier, SGML and TeX in Scientific Publishing 1991 12 TUGBOAT Wonneberger & Mittelbach, BibTeX Reconsidered 1991 12 TUGBOAT Guenther & Winter, An International Phonetic Alphabet 1991 12 TUGBOAT Barden, Some TeX Manuals 1991 12 TUGBOAT Neuwirth, TeX in Schools: Just Say No 1990 11 TUGBOAT Yanai & Berry, Environment for Translating METAFONT to POSTSCRIPT 1990 11 TUGBOAT Berry, Eplain 1990 11 TUGBOAT Lavagnino & Wujastyk, An Overview of EDMAC: A Plain TeX Format for Critical Editions 1990 11 TUGBOAT Mittelbach, E-TeX: Guidelines for Future TeX Extensions 1990 11 TUGBOAT Vulis, VTeX Enhancements to the TeX Language 1990 11 TUGBOAT Taylor, A Nestable Verbatim Mode 1990 11 TUGBOAT Beeton, A Proto-TUG Bibliography 1990 11 TUGBOAT DeCorte, Contents of the Clarkson Archive Server as of 26 January 1990 1990 11 TUGBOAT Guenther, TeXT1 Goes Public Domain 1990 11 TUGBOAT Salomon, Output Routines: Examples and Techniques. Part I: Introduction and Examples 1989 10 TUGBOAT Ballantyne & Spivak & Lee, HI-TeX Cutting & Pasting 1989 10 TUGBOAT Henderson, Introduction to METAFONT 1989 10 TUGBOAT Knuth, The Errors of TeX 1989 10 TUGBOAT Doob, Of the Computer Scientist, by the Computer Scientist, for the Computer Scientist 1989 10 TUGBOAT Hamilton, Mastering TeX with Templates 1989 10 TUGBOAT Mittelbach & Schopf, With LaTeX into the Nineties 1988 9 TUGBOAT Vanderburg, Some Useful Variations of Standard Fonts 1988 9 TUGBOAT Tobin, Designing for Low-Res Devices 1988 9 TUGBOAT Childs, TeX Fonts and Suggested Magnifications 1988 9 TUGBOAT Wujastyk, The Many Faces of TeX: A Survey of Digital METAfonts 1988 9 TUGBOAT Wichura, PiCTeX: Macros for Drawing PiCtures 1987 TURLECTS Perlis, The Synthesis of Algorithmic Systems (1966) 1987 TURLECTS Dijkstra, The Humble Programmer (1972) 1987 TURLECTS Knuth, Computer Programming as an Art (1974) 1987 TURLECTS Scott, Logic and Programming Languages (1976) 1987 TURLECTS Backus, Can Programming Be Liberated from the von Neumann Style? A Functional Style and Its Algebra of Programs (1977) 1987 TURLECTS Floyd, The Paradigm of Programming (1978) 1987 TURLECTS Hoare, The Emperor's Old Clothes (1980) 1987 TURLECTS Ritchie, Reflections on Software Research (1983) 1987 TURLECTS Thompson, Reflections on Trusting Trust (1983) 1987 TURLECTS Wirth, From Programming Language Design to Computer Construction (1984) 1987 TURLECTS Wilkes, Computers, Then and Now (1967) 1987 TURLECTS Hamming, One Man's View of Computer Science (1968) 1987 TURLECTS Minsky, Form and Content in Computer Science (1969) 1987 TURLECTS Wilkinson, Some Comments from a Numerical Analyst (1970) 1987 TURLECTS McCarthy, Generality in Artificial Intelligence (Postscript) (1971) 1987 TURLECTS Bachman, The Programmer as Navigator (1973) 1987 TURLECTS Newell & Simon, Computer Science as Empirical Inquiry: Symbols and Search (1975) 1987 TURLECTS Rabin, Complexity of Computations (1976) 1987 TURLECTS Iverson, Notation as a Tool of Thought (1979) 1987 TURLECTS Codd, Relational Database: A Practical Foundation for Productivity (1981) 1987 TURLECTS Cook, An Overview of Computation Complexity (1982) 1987 TURLECTS Karp, Combinatorics, Complexity, and Randomness (1985) 1987 TURLECTS Frenkel, Piecing Together Complexity (Postscript) 1987 TURLECTS Frenkel, An Interview with Richard Karp (Postscript) 1995 TYPES Berger & Schwichtenberg, The Greatest Common Divisor: A Case Study for Program Extraction from Classical Proofs 1995 TYPES Cederquist & Negri, A Constructive Proof of the Heine-Borel Covering Theorem for Formal Reals 1995 TYPES Padovani, Decidability of All Minimal Models 1995 TYPES Ranta, Context-Relative Syntactic Categories and the Formalization of Mathematical Text 1995 TYPES von Plato, Organization and Development of a Constructive Axiomatization 1987 UCPRESS Turabian, A Manual for Writers of Term Papers, Theses, and Dissertations, Fifth Edition 1995 UDDS Ramanathan & Shin & Butler, Fault-Tolerant Clock Synchronization in Distributed Systems 1995 UDDS Pease & Shostak & Lamport, Reaching Agreement in the Presence of Faults 1995 UDDS Lamport & Shostak & Pease, The Byzantine Generals Problem 1995 UDDS Meyer & Pradhan, Consensus with Dual Failure Modes 1995 UDDS Dolev & Lynch & Pinter & Stark & Weihl, Reaching Approximate Agreement in the Presence of Faults 1995 UDDS Vasanthavada & Marinos, Synchronization of Fault-Tolerant Clocks in the Presence of Malicious Failures 1995 UDDS Shin & Ramanathan, Clock Synchronization of a Large Multiprocessor System in the Presence of Malicious Faults 1992 UIPRESS Bauer, Scientific Literacy and the Myth of the Scientific Method 1993 45 UKRMJ Korneichuk, On Passive and Active Algorithms of Reconstruction of Functions 1993 44 UKRMJ Tyrygin, epsilon-Entropy Data Compression 1993 44 UKRMJ Skobelev, Representation of Automata by Groups 1991 42 UKRMJ Korneichuk, Approximation Theory and Optimization Problems 1996 17 UMAP Meijer, Cryptology and the Birthday Paradox 1995 16 UMAP Ernst, Playing Konane Mathematically: A Combinatorial Game-Theoretic Analysis 1995 16 UMAP Loeb, Bidding Optimally on ``The Price Is Right'' 1995 16 UMAP Wardrop, A New Approach to Introductory Statistics 1995 16 UMAP Wolfe, Undergraduate Research Opportunities in Combinatorial Games 1994 15 UMAP Mann, How Many Times Should You Shuffle a Deck of Cards? 1994 15 UMAP Prochazka & Schaub & Amende, Talking Fast: Finding the Makespan 1994 15 UMAP Mills & Subramaniam & Pakrashi, Network Makespans 1994 15 UMAP Gill & Holm & Thiara, Where Are the High-Capacity Computers When You Need Them? 1994 15 UMAP Negi & Taft & Woodward, Optimum File Transfer Schedule for a Network 1994 15 UMAP Liu & Tam & Wu, Synchronizing File Transfers in a Computer Network 1994 15 UMAP Driscoll, Judge's Commentary: The Outstanding Communications Network Papers 1994 15 UMAP McCarthy, Participant's Commentary: Finding Makespans Is NP-Complete 1994 15 UMAP Julstrom, The Busy Beaver and Related Problems (2nd ed.) 1994 15 UMAP Wampler, Elementary Cryptology 1994 15 UMAP Meijer, Digital Signatures 1993 14 UMAP Bach, Timing the Blind Watchmaker 1993 14 UMAP Hamming, Hamming Distance and Its Discovery 1993 14 UMAP Gadbois, Mr. Markov Plays Chutes and Ladders 1993 14 UMAP Julstrom, Noncomputability and the Busy Beaver Problem 1992 13 UMAP Meijer, Sharing a Secret 1992 13 UMAP Garfunkel & Meyer, A New Start for College Mathematics 1992 13 UMAP Aarfs, Simulated Annealing 1991 12 UMAP Shafroth, A New Course for Liberal-Arts Students with Emphasis on Applications 1991 12 UMAP Meijer, Coin Flipping by Telephone 1991 12 UMAP McGrath & Menzies & Smith, Iterative and Constructive Models for Minimal Rectilinear Steiner Trees 1991 12 UMAP Melody & Moore & Wood, The Construction of a Minimal-Cost Steiner Tree 1991 12 UMAP Margaliot & Pruss & Surry, Finding Optimal Steiner Tree 1991 12 UMAP Caulkins, Practitioner's Commentary: The Outstanding Steiner Tree Papers 1991 12 UMAP Bern, Practitioner's Commentary: The Outstanding Steiner Tree Papers 1991 12 UMAP Lindstrom, What's Wrong with College Algebra? 1991 12 UMAP Sullivan, Toward a Clean and Lively Calculus 1991 12 UMAP Cao & Ferris, Genetic Algorithms in Optimization 1990 11 UMAP Malkevitch, Everybody Counts: Does Everybody Need Algebra? 1990 11 UMAP Kolmes & Mitchell, Information Theory and Biological Diversity 1989 10 UMAP Woodside, Winning Streaks, Shutouts, and the Length of the World Series 1988 9 UMAP Prosser, What Good is Mathematics? A Fireside Chat for Mathematical Sciences Majors 1987 8 UMAP Horowitz, Elliptic Curves 1986 7 UMAP Zaslavsky & Movshovitz-Hadar, Independent Learning of College Mathematics: An Inductive Approach (Editorial) 1968 23 UMN Kolmogorov, Some Theorems on Algorithmic Entropy and the Algorithmic Quantity of Information (abstract, Meetings of the Moscow Mathematical Society) 1965 UNDECIDABLE Goedel, On Formally Undecidable Propositions of the Principia Mathematica and Related Systems. I. 1965 UNDECIDABLE Goedel, On Undecidable Propositions of Formal Mathematical Systems 1965 UNDECIDABLE Goedel, On Intuitionistic Arithmetic and Number Theory 1965 UNDECIDABLE Goedel, On the Length of Proofs 1965 UNDECIDABLE Goedel, Remarks Before the Princeton Bicentennial Conference on Problems in Mathematics 1965 UNDECIDABLE Church, An Unsolvable Problem of Elementary Number Theory 1965 UNDECIDABLE Church, A Note on the Entscheidungsproblem 1965 UNDECIDABLE Turing, On Computable Numbers, with an Application to the Entscheidungsproblem 1965 UNDECIDABLE Turing, Systems of Logic Based on Ordinals 1965 UNDECIDABLE Rosser, An Informal Exposition of Proofs of Goedel's Theorem and Church's Theorem 1965 UNDECIDABLE Rosser, Extensions of Some Theorems of Goedel and Church 1965 UNDECIDABLE Kleene, General Recursive Functions of Natural Numbers 1965 UNDECIDABLE Kleene, Recursive Predicates and Quantifiers 1965 UNDECIDABLE Post, Finite Combinatory Processes. Formulation I. 1965 UNDECIDABLE Post, Recursive Unsolvability of a Problem of Thue 1965 UNDECIDABLE Post, Recursively Enumerable Sets of Positive Integers and Their Decision Problems 1965 UNDECIDABLE Post, Absolutely Unsolvable Problems and Relatively Undecidable Propositions--Account of an Anticipation 1991 URCSERR Hemachandra & Spaan, Quasi-Injective Reductions 1991 31 USSRCMMP Grigoryan, An Algorithm for Computing a Two-dimensional Discrete Fourier Transform of Arbitrary Order 1991 31 USSRCMMP Kabanovich & Kurbatov, An Algorithm for Computing the Potential of a Simple Random Walk on a Cubic Grid 1991 31 USSRCMMP Shishkin, An Algorithm for Inverting Non-Singular Matrices with Guaranteed Accuracy 1991 31 USSRCMMP Mikheyev, A Cyclic Method for Channel Routing 1991 31 USSRCMMP Babayev & Mardanov, A Parallel Algorithm for Linear Programming Problems 1990 30 USSRCMMP Krot, Computational Complexity of Generalized K_N-Convolutions and the Fast Vandermonde Transform Algorithm 1989 29 USSRCMMP Vavriv & Ryabov, Fractal Dimensions: Computational Problems 1989 29 USSRCMMP Korotayeva & Sesekin & Chentsov, A Modification of the Dynamic Programming Method for the Travelling Salesman Problem 1988 28 USSRCMMP Sigal, An Algorithm for the Approximate Solution of a Large-scale Travelling Salesman Problem in a Plane 1985 25 USSRCMMP Ivanisov & Polishchuk, A Method of Finding the Roots of Polynomials which Converge for Any Initial Approximation 1995 VANNOST Kovacs, The Internet Trainer's Guide 1991 VANNOST Davis (Ed.), Handbook of Genetic Algorithms 1989 VANNOST Douglas, Book Design: A Practical Introduction 1989 VANNOST Wasserman, Neural Computing: Theory and Practice 1988 VANNOST Pyster, Compiler Design and Construction: Tools and Techniques (With C and Pascal), Second Edition 1994 3 VAPP Hwang, Scalability and Programmability of Massively Parallel Processors 1994 3 VAPP Amor & Martin & Blanco & Plata & Rivera & Arguello, Vectorization of the Radix r Self-Sorting FFT 1994 3 VAPP Jebelean, Systolic Algorithms for Long Integer GCD Computation 1994 3 VAPP Zimmermann & Lowe, An Approach to Machine-Independent Parallel Programming 1994 3 VAPP Chen, Parallel Heap Construction Using Multiple Selection 1994 3 VAPP Ohring & Das & Hohndel, Asymptotically Optimal Communication Algorithms on Faulty Folded Petersen Networks 1994 3 VAPP Trobec & Jerebic, Optimization of Diagnostic Examination 1994 3 VAPP Chen & Lau, Laying Out Midimew Networks with Constant Dilation 1994 3 VAPP Fraigniaud & Gavoille, Optimal Interval Routing 1994 3 VAPP Ferreira & Goldman vel Lejbman & Song, Broadcasting in Bus Interconnection Networks 1994 3 VAPP Deserable, Broadcasting in the Arrowhead Torus 1992 5 VAPP Bhatt & Chung & Leighton & Rosenberg, Tolerating Faults in Synchronization Networks 1992 5 VAPP Tvrdik, On Incomplete Hypercubes 1992 5 VAPP Ziavras, Connection Machine Results for Pyramid Embedding Algorithms 1992 5 VAPP Hatz, Interconnection Networks Based on Block Designs 1992 5 VAPP Munthe-Kaas, Generalized Shuffle-Exchange Networks 1992 5 VAPP Lavault, Analysis of an Efficient Distributed Algorithm for Mutual Exclusion (Average-Case Analysis of Path Reversal) 1992 5 VAPP Schepers, Invariance Properties in Distributed Systems 1992 5 VAPP Makhaniok & Manner, Synchronization of Parallel Processes in Distributed Systems 1992 5 VAPP Moukeli, Statistical Probabilistic Clock Synchronization Algorithm 1992 5 VAPP Lin & Olariu, Computing the Inner Product on Reconfigurable Buses with Shift Switching 1992 5 VAPP Lam, A Novel Sorting Array Processor 1992 5 VAPP Andonov & Quinton, Efficient Linear Systolic Array for the Knapsack Problem 1992 5 VAPP Xue, On the Loading, Recovery and Access of Stationary Data in Systolic Arrays 1992 5 VAPP Lino de Campos, Asynchronous Polycyclic Architecture 1992 5 VAPP Hellwagner, On the Practical Efficiency of Randomized Shared Memory 1992 5 VAPP Murer & Farber, A Scalable Distributed Shared Memory 1992 5 VAPP Roche & Vermeerbergen & Villard, Cost Prediction for Load Balancing: Application to Algebraic Computations 1992 5 VAPP Gengler & Coray, A Parallel Best-First B&B with Synchronous Phases 1992 5 VAPP Wu, On Tests of Uniform Tree Circuits 1992 5 VAPP Chen & Levcopoulos, Improved Parallel Sorting of Presorted Sequences 1992 5 VAPP Duboux & Ferreira & Gastaldo, MIMD Dictiionary Machines: From Theory to Practice 1992 5 VAPP Klingspor & Luhofer & Rottke, Parallel Searching for 3D-Objects 1992 5 VAPP Roch & Villard, Parallel gcd and Lattice Basis Reduction 1992 5 VAPP Akl & Qiu, Parallel Minimum Spanning Forest Algorithms on the Star and Pancake Interconnection Networks 1992 5 VAPP Embrechts & Roose, Parallel Algorithms for the Distance Transformation 1992 5 VAPP Olariu & Schwing & Zhang, Efficient Image Computations on Reconfigurable Meshes 1992 5 VAPP Levaire & Ubeda, A Multiscale Parallel Thinning Algorithm 1992 5 VAPP Van Dongen & Gao & Ning, A Polynomial Time Method for Optimal Software Pipelining 1992 5 VAPP Unger & Ben Achour, A Petri-Net-Based Method to the Design of Parallel Programs for a Multiprocessor System 1992 5 VAPP Ohring, Dynamic Tree Embeddings into de Bruijn Graphs 1992 5 VAPP Tan & Chin, Load Balancing in a Neighborhood-Based Multiprocessor 1992 5 VAPP Wu & Fernandez, Broadcasting in Faulty Cube-Connected-Cycles with Minimum Recovery Time 1992 5 VAPP Mackenzie & Ould-Khaoua & Sutherland & Kelly, A Hypergraph-Based Interconnection Network for Large Multicomputers 1992 5 VAPP Grammatikakis & Jwo, Greedy Permutation Routing on Cayley Graphs 1992 5 VAPP Barth, An Algorithm of Broadcasting in the Mesh of Trees 1992 5 VAPP Freisleben & Kielmann, Automatic Parallelization of Divide-and-Conquer Algorithms 1990 4 VAPP Harissis & Jam & Ambler, Analysis and Design of Circuit Switching Interconnection Networks Using 4x4 Nodes 1990 4 VAPP Boillat & Kropf, A Fast Distributed Mapping Algorithm 1990 4 VAPP Dehne & Gastaldo, A Note on the Load Balancing Problem for Coarse Grained Hypercube Dictionary Machines 1990 4 VAPP Eklund & Kaufmann, Hierarchical Wiring in Multigrids 1990 4 VAPP Blanc & Trystram, Implementation of Parallel Numerical Routines Using Broadcast Communication 1990 4 VAPP Mugwaneza & Muntean & Sakho, A Deadlock Free Routing Algorithm with Network Size Independent Buffering Space 1989 VCH Kaye, A Random Walk Through Fractal Dimensions 1991 24 VESTNIK Nasr & Tchirkov, On Relative Complexity of Stochastic Automata Reduced Forms 1990 23 VESTNIK Petrov & Ture, A Pursuit Problem on a Graph 1990 23 VESTNIK Golovach, Node-Search Number and Search Number of the Coupling of Graphs 1994 VIEWEG Ebeling, Lattices and Codes: A Course Partially Based on Lectures by F. Hirzebruch 1987 3 VISCOMP Houthuys, Box Sort, a Multidimensional Binary Sorting Method for Rectangular Boxes, Used for Quick Range Searching 1987 3 VISCOMP Earnshaw, The Mathematics of Computer Graphics 1987 VISIONETC Feldman, A Functional Model of Vision and Space 1987 VISIONETC Ballard, Cortical Connections and Parallel Processing: Structure and Function 1990 VLSIPC Mayr, Theoretical Aspects of Parallel Computation 1990 VLSIPC Johnsson, Communication in Network Architectures 1990 VLSIPC Abu-Mostafa & Schweizer, Neural Networks 1990 VONNEU Goldstine & von Neumann, On the Principles of Large Scale Computing Machines 1990 VONNEU Cowan, Von Neumann and Neural Networks 1990 VONNEU Berlekamp, Two-Person, Perfect-Information Games 1990 VONNEU Aspray, The Origins of John von Neumann's Theory of Automata 1990 VONNEU Pippenger, Developments in ``The Synthesis of Reliable Organisms from Unreliable Components'' 1996 1 WACG Hoffmann, How Solid is Solid Modeling? 1996 1 WACG Fortune, Robustness Issues in Geometric Algorithms 1996 1 WACG Guibas, Implementing Geometric Algorithms Robustly 1996 1 WACG Preparata, Robustness in Geometric Algorithms 1996 1 WACG Pratt, Applications of Computational Geometry in Mechanical Engineering Design and Manufacture 1996 1 WACG Mitchell, On Some Applications of Computational Geometry in Manufacturing and Virtual Environments 1996 1 WACG Dobkin, Visualizing Geometric Algorithms -- State of the Art 1996 1 WACG Lee, Geometric Algorithm Visualization, Current Status and Future 1996 1 WACG Overmars, Designing the Computational Geometry Algorithms Library CGAL 1996 1 WACG Chazelle, The Computational Geometry Impact Task Force Report: An Executive Summary 1996 1 WACG Finn & Halperin & Kavraki & Latombe & Motwani & Shelton & Venkatasubramanian, Geometric Manipulation of Flexible Ligands 1996 1 WACG Prisant, Ray-Representation Formalism for Geometric Computations on Protein Solid Models 1996 1 WACG Daniels & Milenkovic, Column-Based Strip Packing Using Ordered and Compliant Containment 1996 1 WACG Majhi & Gupta & Janardan, Computing a Flattest, Undercut-Free Parting Line for a Convex Polyhedron, with Applicatoin to Mold Design 1996 1 WACG Dobkin & Gunopulos, Geometric Problems in Machine Learning 1996 1 WACG Basri & Jacobs, Matching Convex Polygons and Polyhedra, Allowing for Occlusion 1996 1 WACG Hung & Ierardi, Stably Placing Piecewise Smooth Objects 1996 1 WACG Fortune, A Beam-Tracing Algorithm for Prediction of Indoor Radio Propagation 1996 1 WACG Kernighan & Van Wyk, Extracting Geometric Information from Architectural Drawings 1996 1 WACG Orti & Durand & Riviere & Puech, Using the Visibility Complex for Radiosity Computation 1996 1 WACG Fabri & Giezeman & Kettner & Schirra & Schonherr, The CGAL Kernel: A Basis for Geometric Computation 1996 1 WACG Shewchuk, Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator 1987 WADBROOKS Mendelson, Introduction to Mathematical Logic, Third Edition 1986 WADBROOKS Stanley, Enumerative Combinatorics, Volume I 1995 4 WADS Bilardi & Preparata, Lower Bounds to Processor-Time Tradeoffs Under Bounded Speed Message Propagation 1995 4 WADS Jaromczyk & Kowaluk, The Two-Line Center Problem from a Polar View: a New Algorithm and Data Structure 1995 4 WADS Glozman & Kedem & Shpitalnik, On some Geometric Selection and Optimization Problems via Sorted Matrices 1995 4 WADS Holzman & Marcus & Peleg, Load Balancing in Quorum Systems 1995 4 WADS Kroll & Widmayer, Balanced Distributed Search Trees Do Not Exist 1995 4 WADS Estivill-Castro & Urrutia, Two-Floodlight Illumination of Convex Polygons 1995 4 WADS Das & Goodrich, On the Complexity of Approximating and Illuminating Three-Dimensional Convex Polyhedra 1995 4 WADS Phillips & Stein & Wein, Scheduling Jobs that Arrive Over Time 1995 4 WADS Frandsen & Husfeldt & Miltersen & Rauhe & Skyum, Dynamic Algorithms for the Dyck Languages 1995 4 WADS Sharir, Arrangements in Higher Dimensions: Voronoi Diagrams, Motion Planning, and Other Applications 1995 4 WADS Carlsson & Jonsson, Computing a Shortest Watchman Path in a Simple Polygon in Polynomial Time 1995 4 WADS Lopez-Ortiz & Schuierer, Going Home Through an Unknown Street 1995 4 WADS Albers & Koga, Page Migration with Limited Local Memory Capacity 1995 4 WADS Irani & Seiden, Randomized Algorithms for Metrical Task Systems 1995 4 WADS Gupta & Janardan & Majhi & Woo, Efficient Geometric Algorithms for Workpiece Orientation in 4- and 5-Axis NC Machining 1995 4 WADS Kirkpatrick & Snoeyink, Computing Common Tangents Without a Separating Line 1995 4 WADS Grove & Kao & Krishnan & Vitter, Online Perfect Matching and Mobile Computing 1995 4 WADS Ausiello & Feuerstein & Leonardi & Stougie & Talamo, Competitive Algorithms for the On-line Traveling Salesman 1995 4 WADS Toussaint, Quadrangulations of Planar Sets 1995 4 WADS Lingas & Mukhopadhyay, A Linear-time Construction of the Relative Neighborhood Graph within a Histogram 1995 4 WADS Liotta & Di Battista, Computing Proximity Drawings of Trees in the 3-Dimensional Space 1995 4 WADS Roberts & Symvonis & Zhang, Routing on Trees via Matchings 1995 4 WADS Annexstein & Kuchko, A Ranking Algorithm for Hamilton Paths in Shuffle-Exchange Graphs 1995 4 WADS Boyar & Fagerberg & Larsen, Amortization Results for Chromatic Search Trees, with an Application to Priority Queues 1995 4 WADS Brodal, Fast Meldable Priority Queues 1995 4 WADS Kagaris & Pantziou & Tragoudas & Zaroliagis, On the Computation of Fast Data Transmissions in Networks with Capacities and Delays 1995 4 WADS Baruah & Pruesse, Routing with Delays when Storage is Costly 1995 4 WADS Vitanyi & Li, Algorithmic Arguments in Physics of Computation 1995 4 WADS Arge, The Buffer Tree: A New Technique for Optimal I/O-Algorithms 1995 4 WADS Chiang, Experiments on the Practical I/O Efficiency of Geometric Algorithms: Distribution Sweep vs. Plane Sweep 1995 4 WADS Corneil & Olariu & Stewart, Computing a Dominating Pair in an Asteroidal Triple-free Graph in Linear Time 1995 4 WADS Djidjev, A Linear Algorithm for the Maximal Planar Subgraph Problem 1995 4 WADS Callahan & Goodrich & Ramaiyer, Topology B-Trees and their Applications 1995 4 WADS Moffat & Katajainen, In-Place Calculation of Minimum-Redundancy Codes 1995 4 WADS Kaller & Gupta & Shermer, Regular-Factors in the Complements of Partial k-Trees 1995 4 WADS Cattell & Dinneen & Fellows, Obstructions to Within a Few Vertices or Edges of Acyclic 1995 4 WADS Hariharan & Kapoor & Kumar, Faster Enumeration of All Spanning Trees of a Directed Graph 1995 4 WADS King, A Simpler Minimum Spanning Tree Verification Algorithm 1995 4 WADS Berman & Fujito, On Approximation Properties of the Independent Set Problem in Degree 3 Graphs 1995 4 WADS Lau, Approximation of Constraint Satisfaction via Local Search 1995 4 WADS Andersson & Swanson, On the Difficulty of Range Searching 1995 4 WADS Fich & Miltersen, Tables Should Be Sorted (On Random Access Machines) 1995 4 WADS Armen & Stein, Improved Length Bounds for the Shortest Superstring Problem 1995 4 WADS Bafna & Narayanan & Ravi, Non-Overlapping Local Alignments 1995 4 WADS Mehlhorn, Experiences with the Implementation of Geometric Algorithms 1993 3 WADS Atallah & Chen, Computing the All-Pairs Longest Chains in the Plane 1993 3 WADS Borodin, Towards a Better Understanding of Pure Packet Routing 1993 3 WADS Karp, A Generalization of Binary Search 1993 3 WADS Agarwal & van Kreveld, Connected Component and Simple Polygon Intersection Searching 1993 3 WADS Amato, An Optimal Algorithm for Finding the Separation of Simple Polygons 1993 3 WADS Andersson, Balanced Search Trees Made Simple 1993 3 WADS Aoki & Imai & Imai & Rappaport, Probing a Set of Hyperplanes by Lines and Related Problems 1993 3 WADS Arge & Knudsen & Larsen, A General Lower Bound on the I/O-Complexity of Comparison-based Algorithms 1993 3 WADS Arkin & Goodrich & Mitchell & Mount & Piatko & Skiena, Point Probe Decision Trees for Geometric Concept Classes 1993 3 WADS Armon & Reif, A Dynamic Separator Algorithm 1993 3 WADS Azar & Kalyanasundaram & Plotkin & Pruhs & Waarts, Online Load Balancing of Temporary Tasks 1993 3 WADS Balakrishnan & Rajaraman & Rangan, Connected Domination and Steiner Set on Asteroidal Triple-Free Graphs 1993 3 WADS Balasubramanian & Raman & Srinivasaraghavan, The Complexity of Finding Certain Trees in Tournaments 1993 3 WADS Di Battista & Liotta & Vargiu, Spirality of Orthogonal Representations and Optimal Drawings of Series-Parallel Graphs and 3-Planar Graphs (Extended Abstract) 1993 3 WADS Beame & Fich & Sinha, Separating the Power of EREW and CREW PRAMs with Small Communication Width 1993 3 WADS Berkman & Matias & Ragde, Triply-Logarithmic Upper and Lower Bounds for Minimum, Range Minima, and Related Problems with Integer Inputs 1993 3 WADS Bern & Eppstein & Teng, Parallel Construction of Quadtrees and Quality Triangulations 1993 3 WADS Bose & Buss & Lubiw, Pattern Matching for Permutations 1993 3 WADS Bose & van Kreveld & Toussaint, Filling Polyhedral Molds 1993 3 WADS Chang & Peng & Liaw, Deferred-Query -- An Efficient Approach for Problems on Interval and Circular-Arc Graphs (Extended Abstract) 1993 3 WADS Chen & Kanchi & Kanevsky, On the Complexity of Graph Embeddings (Extended Abstract) 1993 3 WADS Clarkson, Algorithms for Polytope Covering and Approximation 1993 3 WADS Codenotti & Manzini & Margara & Resta, Global Strategies for Augmenting the Efficiency of TSP Heuristics 1993 3 WADS Datta & Lenhof & Schwarz & Smid, Static and Dynamic Algorithms for k-Point Clustering Problems 1993 3 WADS Devillers & Fabri, Scalable Algorithms for Bichromatic Line Segment Intersection Problems on Coarse Grained Multicomputers 1993 3 WADS Dietz & Raman, Persistence, Randomization and Parallelization: On some Combinatorial Games and their Applications (Abstract) 1993 3 WADS Ding & Weiss, The K-D Heap: An Efficient Multi-dimensional Priority Queue 1993 3 WADS Dobrindt & Mehlhorn & Yvinec, A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron 1993 3 WADS Efrat & Sharir & Ziv, Computing the Smallest k-Enclosing Circle and Related Problems 1993 3 WADS Giancarlo, An Index Data Structure for Matrices, with Applications to Fast Two-Dimensional Pattern Matching (Extended Abstract) 1993 3 WADS Graf & Hinrichs, A Plane Sweep Algorithm for the All-Nearest-Neighbors Problem for a Set of Convex Planar Objects 1993 3 WADS Gupta & Janardan & Smid, Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization 1993 3 WADS Heffernan, Generalized Approximate Algorithms for Point Set Congruence 1993 3 WADS Jiang & Li, Approximating Shortest Superstrings with Constraints (Extended Abstract) 1993 3 WADS Kannan & Warnow, Tree Reconstruction from Partial Orders 1993 3 WADS Kao & Teng & Toyama, Improved Parallel Depth-First Search in Undirected Planar Graphs 1993 3 WADS Karger & Motwani & Ramkumar, On Approximating the Longest Path in a Graph (Preliminary Version) 1993 3 WADS Khuller & Raghavachari & Young, Designing Multi-Commodity Flow Trees 1993 3 WADS Klein & Subramanian, A Fully Dynamic Approximation Scheme for All-Pairs Shortest Paths in Planar Graphs 1993 3 WADS van Kreveld, On Fat Partitioning, Fat Covering, and the Union Size of Polygons (extended abstract) 1993 3 WADS Krizanc, A Time-Randomness Tradeoff for Selection in Parallel 1993 3 WADS Lu & Klein & Netzer, Detecting Race Conditions in Parallel Programs that Use One Semaphore 1993 3 WADS Maggs & Rauch, An Algorithm for Finding Predecessors in Integer Sets 1993 3 WADS Maier & Schott, The Exhaustion of Shared Memory: Stochastic Results 1993 3 WADS Mirzaian, Minimum Weight Euclidean Matching and Weighted Relative Neighborhood Graphs 1993 3 WADS Mitra & Bhattacharya, Efficient Approximate Shortest-Path Queries Among Isothetic Rectangular Obstacles 1993 3 WADS Palazzi & Snoeyink, Counting and Reporting Red/Blue Segment Intersections 1993 3 WADS Pellegrini, Repetitive Hidden-Surface-Removal for Polyhedral Scenes 1993 3 WADS De Prisco & Monti, On Reconfigurability of VLSI Linear Arrays 1993 3 WADS Skiena & Sundaram, Reconstructing Strings from Substrings (Extended Abstract) 1993 3 WADS Souvaine & Yap, Combinatorial Complexity of Signed Discs (Extended Abstract) 1993 3 WADS Stallmann & Hughes, Fast Algorithms for One-Dimensional Compaction with Jog Insertion 1993 3 WADS Swanson, An Optimal Algorithm for Roundness Determination on Convex Polygons 1993 3 WADS Telle & Proskurowski, Practical Algorithms on Partial k-Trees with an Application to Domination-like Problems 1993 3 WADS Westbrook & Yan, Greedy Algorithms for the On-Line Steiner Tree and Generalized Steiner Problems 1991 2 WADS Cunto & Munro & Poblete, A Case Study in Comparison Based Complexity: Finding the Nearest Value(s) 1991 2 WADS Aronov & Sharir, On the Zone of a Surface in a Hyperplane Arrangement 1991 2 WADS Pellegrini, Ray-shooting and Isotopy Classes of Lines in 3-Dimensional Space 1991 2 WADS Dietz, Finding Level-Ancestors in Dynamic Trees 1991 2 WADS Devillers & Meiser & Teillaud, Fully Dynamic Delaunay Triangulation in Logarithmic Expected Time Per Operation 1991 2 WADS Djidjev & Lingas, On Computing the Voronoi Diagram for Restricted Planar Figures 1991 2 WADS Diaz & Gibbons & Paterson & Toran, The MINSUMCUT Problem 1991 2 WADS Katoh & Iwano, Efficient Algorithms For The Minimum Range Cut Problems (Extended Abstract) 1991 2 WADS Akl, Memory Access in Models of Parallel Computation: From Folklore to Synergy and Beyond 1991 2 WADS Agarwal & Matousek & Suri, Farthest Neighbbors, Maximum Spanning Trees and Related Problems in Higher Dimensions 1991 2 WADS Salowe, Shallow Interdistance Selection and Interdistance Enumeration 1991 2 WADS Aguilar & Datta & Ghosh, Sharing Memory in Asynchronous Message Passing Systems 1991 2 WADS Yu & Rosenkrantz, A Linear-Time Scheme for Version Reconstruction (Extended Abstract) 1991 2 WADS Hanson, The Interval Skip List: A Data Structure for Finding All Intervals That Overlap a Point 1991 2 WADS Arkin & Khuller & Mitchell, Geometric Knapsack Problems 1991 2 WADS Han, A Fast Derandomization Scheme and Its Applications 1991 2 WADS Lengauer & Theune, Unstructured Path Problems and the Making of Semirings (Preliminary Version) 1991 2 WADS Mitchell & Wynters, Finding Optimal Bipartitions of Points and Polygons 1991 2 WADS Czyzowicz & Ivan Stojmenovic & Urrutia, Immobilizing a Polytope 1991 2 WADS Jacquet & Szpankowski, What Can We Learn About Suffix Trees From Indepenent Tries? 1991 2 WADS d'Amore & Marchetti-Spaccamela & Nanni, Competitive Algorithms for the Weighted List Update Problem 1991 2 WADS Nilsson & Schuierer, An Optimal Algorithm for the Rectilinear Link Center of a Rectilinear Polygon 1991 2 WADS Das & Narasimhan, Geometric Searching and Link Distance (Extended Abstract) 1991 2 WADS Naor & Vazirani, Representing and Enumerating Edge Connectivity Cuts in RNC 1991 2 WADS Kant & Bodlaender, Planar Graph Augmentation Problems (Extended Abstract) 1991 2 WADS Frederickson, Parametric Search and Locating Supply Centers in Trees 1991 2 WADS Yang & Lee & Wong, On Bends and Lengths of Rectilinear Paths: A Graph-Theoretic Approach 1991 2 WADS Hershberger & Snoeyink, Computing Minimum Length Paths of a Given Homotopy Class (Extended Abstract) 1991 2 WADS Bar-Ilan & Peleg, Approximation Algorithms for Selecting Network Centers 1991 2 WADS Ravi & Rosenkrantz & Tayi, Facility Dispersion Problems: Heuristics and Special Cases (Extended Abstract) 1991 2 WADS Carlsson & Nilsson & Ntafos, Optimum Guard Covers and m-Watchmen Routes for Restricted Polygons 1991 2 WADS Agarwal & Sharir, Applications of a New Space Partitioning Technique 1991 2 WADS Eppstein, Offline Algorithms for Dynamic Minimum Spanning Tree Problems 1991 2 WADS Moret & Shapiro, An Empirical Analysis of Algoritms for Constructing a Minimum Spanning Tree 1991 2 WADS Bhattacharya & Mukhopadhyay & Toussaint, A Linear Time Algorithm for Computing the Shortest Line Segment From Which a Polygon is Weakly Externally Visible 1991 2 WADS Vegter, Dynamically Maintaining the Visibility Graph 1991 2 WADS Heffernan & Mitchell, An Optimal Algorithm for Computing Visibility in the Plane 1991 2 WADS Italiano & Sarnak, Fully Persistent Data Structures for Disjoint Set Union Problems 1991 2 WADS Kapoor & Ramesh, Algorithms For Generating All Spanning Trees Of Undirected, Directed And Weighted Graphs 1991 2 WADS Munro & Raman, Sorting Multisets and Vectors In-Place 1991 2 WADS Abrahamson & Adler & Higham & Kirkpatrick, Probabilistic Leader Election on Rings of Known Size 1989 1 WADS Baeza-Yates & Gonnet, Efficient Text Searching of Regular Expressions 1989 1 WADS Preparata & Tamassia, Efficient Spatial Point Location 1989 1 WADS Goodrich & O'Dunlaing & Yap, Constructing the Voronoi Diagram of a Set of Line Segments in Parallel 1989 1 WADS Cunto & Lau & Flajolet, Analysis of KDT-Trees: KD-Trees Improved by Local Reorganisations 1989 1 WADS Dietz, Optimal Algorithms for List Indexing and Subset Rank 1989 1 WADS Keil & Gutwin, The Delaunay Triangulation Closely Approximates the Complete Euclidean Graph 1989 1 WADS Rappaport, Computing the Furthest Site Voronoi Diagram for a Set of Discs 1989 1 WADS Dietz, Fully Persistent Arrays 1989 1 WADS Baeza-Yates, String Searching Algorithms Revisited 1989 1 WADS Atallah & Hambrusch, Optimal Channel Placement for Multi-Terminal Nets 1989 1 WADS Aggarwal & Moran & Shor & Suri, Computing the Minimum Visible Vertex Distance Between Two Polygons 1989 1 WADS Ke & O'Rourke, Computing the Kernel of a Point Set in a Polygon 1989 1 WADS Chrobak & Naor & Novick, Using Bounded Degree Spanning Trees in the Design of Efficient Algorithms on Claw Free Graphs 1989 1 WADS Zhao, Linear Time Algorithms for Computing Reachability Regions from Polygonal Figures 1989 1 WADS Diaz & O'Rourke, Computing the Center of Area of a Polygon 1989 1 WADS Houle & Imai & Imai & Robert, Weighted Orthogonal Linear L_infinity Approximation and Applications 1989 1 WADS Luccio & Regnier & Schott, Disc and Other Related Data Structures 1989 1 WADS Szpankowski, Digital Data Structures and Order Statistics 1989 1 WADS Gardy & Flajolet & Puech, On the Performance of Orthogonal Range Queries in Multiattribute and Doubly Chained Trees 1989 1 WADS Goodrich & Snoeyink, Stabbing Parallel Segments with a Convex Polygon 1989 1 WADS Salowe, Selecting the k-th Largest-Area Convex Polygon 1989 1 WADS Hwang & Chang & Tu, Finding All Shortest Path Edge Sequences on a Convex Polyhedron 1989 1 WADS Rao & Rangan, Linear Algorithms for Parity Path and Two Path Problems on Circular-Arc Graphs 1989 1 WADS Chen, NC Algorithms for Circular-Arc Graphs 1989 1 WADS Khuller, Parallel Algorithms for the Subgraph Homeormorphism Problem 1989 1 WADS Czyzowicz & Rival & Urrutia, Galleries, Light Matchings and Visibility Graphs 1989 1 WADS Kirkpatrick & Wismath, Weighted Visibility Graphs of Bars and Related Flow Problems 1989 1 WADS Adhar & Peng, Parallel Algorithms for Cographs: Recognition and Applications 1989 1 WADS Italiano & Spaccamela & Nanni, Dynamic Data Structures for Series Parallel Digraphs 1989 1 WADS Yap & Alt, Motion Planning in the CL Environment (Extended Abstract) 1989 1 WADS Sherk, Self-Adjusting k-ary Search Trees 1989 1 WADS Andersson, Improving Partial Rebuilding by Using Simple Balance Criteria 1989 1 WADS Ibarra & Palis, An Efficient All-Parses Systolic Algorithm for General Context-Free Parsing 1989 1 WADS Kim & McNaughton & McCloskey, A Polynomial Time Algorithm for the Local Testability Problem of Deterministic Finite Automata 1989 1 WADS Pugh, Skip Lists: A Probabilistic Alternative to Balanced Trees 1989 1 WADS Moffat & Port, A Fast Algorithm for Melding Splay Trees 1989 1 WADS Breu, An Efficient Algorithm for Finding all Maximal Square Blocks in a Matrix 1989 1 WADS Nishimura, Complexity Issues In Tree-Based Version Control 1989 1 WADS Scholten & van Leeuwen, Structured NC 1989 1 WADS Levcopoulos & Petersson, Heapsort - Adapted for Presorted Files 1989 1 WADS Weiss & Navlakha, The Distribution of Keys in a Binary Heap 1989 1 WADS Miller & Stout, Optimal Hypercube Algorithms for Labeled Images 1989 1 WADS Dingle & Sudborough, On the Complexity of Single Row Routing Problems 1989 1 WADS Derome, A New Search Time Update Time Tradeoff for the Implicit Dictionary 1989 1 WADS Munro & Raman, Sorting with Minimum Data Movement 1989 1 WADS Fernandez-Baca & Williams, Augmentation Problems on Hierarchically Defined Graphs 1989 1 WADS Bodlaender, On Linear Time Minor Tests and Depth First Search 1995 WAFR Overmars & Svestka, A Probabilistic Learning Approach to Motion Planning 1995 WAFR Guibas & Motwani & Raghavan, The Robot Localization Problem 1995 WAFR Jia & Erdmann, The Complexity of Sensing by Point Sampling 1995 WAFR Farahat & Stiller & Trinkle, On the Algebraic Geometry of a Class of Contact Formation Cells 1995 WAFR Halperin & Sharir, Arrangements and Their Applications in Robotics: Recent Developments 1995 WAFR Canny, A Toolkit for Non-Linear Algebra 1995 WAFR Basu & Pollack & Roy, Computing a Set of Points Meeting Every Cell Defined by a Family of Polynomials on a Variety 1993 WAPADS Kalpakis & Yesha, Optimal Within a Constant Schedules for Forest Dags on Parallel Architectures 1993 WAPADS Makki & Pissinou & Yesha, A New Token Based Distributed Mutual Exclusion Algorithm 1977 WATERLOO Lipton & Tarjan, A Separator Theorem for Planar Graphs 1977 WATERLOO Reif, Code Motion 1977 WATERLOO Eckstein & Alton, Parallel Graph Processing Using Depth-First Search 1977 WATERLOO Miller & Pippenger & Rosenberg & Snyder, Optimal 2,3-Trees 1977 WATERLOO Bitner, Self-Modifying Data Structures 1977 WATERLOO Lipton & Snyder, On the Halting of Tree Replacement Systems 1977 WATERLOO McColl, Some Problems Concerning Complete Bases 1977 WATERLOO Dolev, Local Characterization of Models of Synchronization Primitives 1977 WATERLOO Meyer & Mattheyses, Modular Control Schemata for Parallel Asynchronous Systems 1977 WATERLOO Cohen & Cimet, A Scheme for Constructing On-Line Linear Time Recognition Algorithms 1977 WATERLOO Ehrenfeucht & Rozenberg, On Simplifications of PD0L Systems 1977 WATERLOO Sakarovitch, On Deterministic Commutative Context-Free Languages 1977 WATERLOO Lewis, A Measure of Complexity for Combinatorial Decision Problems of the Tiling Variety 1977 WATERLOO Bennison, On the Problem of Determining Measure-Independence 1977 WATERLOO Verbeek & Weihrauch, Data Presentation and Computational Complexity 1977 WATERLOO Maier, The Complexity of Some Problems on Subsequences and Supersequences 1977 WATERLOO Boasson & Courcelle & Nivat, A New Complexity Measure for Languages 1977 WATERLOO Hunt & Rosenkrantz, Complexity of Grammatical Similarity Relations 1977 WATERLOO Dobkin & Lipton, Addition Chain Methods for the Evaluation of Specific Polynomials 1977 WATERLOO Brent & Kung, Fast Algorithms for Composition and Reversion of Multivariate Power Series 1977 WATERLOO Gonnet, Average Lower Bounds for Open-Addressing Hash Coding 1977 WATERLOO Sedgewick, Data Movement in Odd-Even Merging 1977 WATERLOO Galil & Megiddo, A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort 1977 WATERLOO Cremers & Hibbard, Orthogonal Information Structures 1977 WATERLOO van Emden, Relational Equations, Grammars, and Programs 1977 WATERLOO Suzuki & Jefferson, Verification Decidability of Presburger Array Programs 1977 WATERLOO Jacob, Demi-Groupes de Matrices Localement Testables Caracterisation et Decidabilite 1977 WATERLOO Goodrich & Ladner & Fischer, Straight-Line Programs to Compute Finite Languages 1977 WATERLOO Cox, A Graphical Proof Procedure for First-Order Logic 1977 WATERLOO Goldstine, Automata with Data Storage 1977 WATERLOO Perrin, Codes Asynchrones 1977 WATERLOO Rosenberg & Snyder, Toward a Theory of Data Encoding 1977 WATERLOO Dobkin & Lipton & Reiss, Aspects of the Database Security Problem 1977 WATERLOO Papadimitriou & Bernstein & Rothnie, Some Computational Problems Related to Database Concurrency Control 1988 WATGUPT White, Graphic Design for the Electronic Age 1988 WATGUPT , Xerox Publishing Standards: A Manual of Style and Design 1992 WATKOLM Allender, Applications of Time-Bounded Kolmogorov Complexity in Complexity Theory 1992 WATKOLM Book, On Sets with Small Information Content 1992 WATKOLM Juedes & Lutz, Kolmogorov Complexity, Complexity Cores, and the Distribution of Hardness 1992 WATKOLM Longpre, Resource Bounded Kolmogorov Complexity and Statistical Tests 1992 WATKOLM Uspensky, Complexity and Entropy: An Introduction to the Theory of Kolmogorov Complexity 1988 WCDP Ordman, A Byzantine Firing Squad Algorithm for Networks 1988 WCDP Mazer, Characterizing Negotiation Protocols for Faulty Distributed Environments 1988 WCDP Mancini & Pappalardo, On Resolving Nondeterminism in Replicated Distributed Systems 1988 WCDP Farrag & Dawson, On Designing Efficient Consensus Protocols 1988 WCDP Seshadri & Small & Wortman, Concurrent Compilation 1996 10 WDAG Lampson, How to Build a Highly Available System Using Consensus 1996 10 WDAG Ferrari, Distributed Admission Control Algorithms for Real-Time Communication 1996 10 WDAG Aguilera & Toueg, Randomization and Failure Detection: A Hybrid Approach to Solve Consensus 1996 10 WDAG Borcherding, Levels of Authentication in Distributed Agreement 1996 10 WDAG Attiya, Efficient and Robust Sharing of Memory in Message-Passing Systems 1996 10 WDAG Torres-Rojas & Ahamad, Plausible Clocks: Constant Size Logical Clocks for Distributed Systems 1996 10 WDAG Charpentier & Filali & Mauran & Padiou & Queinnec, Abstracting Communication to Reason about Distributed Algorithms 1996 10 WDAG Basu & Charron-Bost & Toueg, Simulating Reliable Links with Unreliable Links in the Presence of Process Crashes 1996 10 WDAG Rodrigues & Jones, A Cyclic Distributed Garbage Collector for Network Objects 1996 10 WDAG Dickman, Incremental, Distributed Orphan Detection and Actor Garbage Collection Using Graph Partitioning and Euler Cycles 1996 10 WDAG Fonseca & Mammeri, A Framework for the Analysis of Non-Deterministic Clock Synchronization Algorithms 1996 10 WDAG Mei & Bao & Hamada & Igarashi, Optimal Time Broadcasting in Faulty Star Networks 1996 10 WDAG Eilam & Moran & Zaks, A Lower Bound for Linear Interval Routing 1996 10 WDAG Gambosi & Vocca, Topological Routing Schemes 1996 10 WDAG Fujita & Yamashita, Maintaining a Dynamic Set of Processors in a Distributed System 1996 10 WDAG Dwork & Ho & Strong, Collective Consistency 1996 10 WDAG Bazzi, Planar Quorums 1996 10 WDAG Guerraoui & Schiper, ``Gamma-Accurate'' Failure Detectors 1996 10 WDAG Moir & Garay, Fast Long-Lived Renaming Improved and Simplified 1996 10 WDAG Mizuno & Kakugawa, A Timestamp Based Transformation of Self-Stabilizing Programs for Distributed Computing Environments 1996 10 WDAG Attiya & Rajsbaum, The Combinatorial Structure of Wait-Free Solvable Tasks 1996 10 WDAG Moran & Rappoport, On the Robustness of h^r_m 1996 10 WDAG Chaudhuri & Reiners, Understanding the Set Consensus Partial Order Using the Borowsky-Gafni Simulation 1995 9 WDAG Gouda, The Triumph and Tribulation of System Stabilization 1995 9 WDAG Jayanti, Wait-Free Computing 1995 9 WDAG Le Lann, On Real-Time and Non Real-Time Distributed Computing 1995 9 WDAG Dolev, Theory and Practice in Distributed Systems (abstract) 1995 9 WDAG Babaoglu & Davoli & Giachini & Sabattini, The Inherent Cost of Strong-Partial View-Synchronous Communication 1995 9 WDAG Guerraoui, Revisiting the Relationship Between Non-Blocking Atomic Commitment and Consensus 1995 9 WDAG Ricciardi, Dissecting Distributed Coordination 1995 9 WDAG Awerbuch & Kutten & Mansour & Peleg, Optimal Broadcast with Partial Knowledge 1995 9 WDAG Flammini & Gambosi & Nanni & Tan, Multi-Dimensional Interval Routing Schemes 1995 9 WDAG Jakoby & Reischuk, Data Transmission in Processor Networks 1995 9 WDAG Spirakis & Tampakas & Antonopoulou, Distributed Protocols Against Mobile Eavesdroppers 1995 9 WDAG Anderson & Moir, Universal Constructions for Large Objects 1995 9 WDAG Arora & Gouda, Load Balancing: an Exercise in Constrained Convergence 1995 9 WDAG Shapiro & Ferreira, Larchant-RDOSS: a Distributed Shared Persistent Memory and Its Garbage Collector 1995 9 WDAG Bao & Igarashi & Katano, Broadcasting in Hypercubes with Randomly Distributed Byzantine Faults 1995 9 WDAG Borcherding, On the Number of Authenticated Rounds in Byzantine Agreement 1995 9 WDAG Moser & Melliar-Smith, Total Ordering Algorithms for Asynchronous Byzantine Systems 1995 9 WDAG Butelle & Lavault & Bui, A Uniform Self-Stabilizing Minimum Diameter Tree Algorithm 1995 9 WDAG Hoepman & Papatriantafilou & Tsigas, On Self-Stabilization in Wait-Free Shared Memory Objects 1995 9 WDAG Itkis & Lin & Simon, Deterministic, Constant Space, Self-Stabilizing Leader Election on Uniform Rings 1995 9 WDAG Chase & Garg, Efficient Detection of Restricted Classes of Global Predicates 1995 9 WDAG Stoller & Schneider, Faster Possibility Detection by Combining Two Approaches 1994 8 WDAG Babaoglu & Bartoli & Dini, Replicated File Management in Large-scale Distributed Systems 1994 8 WDAG Keller & Paul & Scheerer, Realization of PRAMs: Processor Design 1994 8 WDAG Lenstra, Factoring 1994 8 WDAG Schiper & Sandoz, Primary Partition ``Virtually-synchronous Communication'' Harder than Consensus 1994 8 WDAG Yung, Secure Distributed Computing: Theory and Practice 1994 8 WDAG Chaudhuri & Tuttle, Fast Increment Registers 1994 8 WDAG Choy & Singh, Coping with Contention 1994 8 WDAG Cori & Moran, Exotic Behavior of Consensus Numbers 1994 8 WDAG Haldar & Subramanian, Space-optimum Conflict-free Construction of 1-Writer 1-Reader Multivalued Atomic Variable 1994 8 WDAG Inoue & Chen & Masuzawa & Tokura, Linear-time Snapshot Using Multi-writer Multi-reader Registers 1994 8 WDAG Moir & Anderson, Fast, Long-lived Renaming 1994 8 WDAG Rachman, Anomalies in the Wait-free Hierarchy 1994 8 WDAG Alimonti & Flocchini & Santoro, Finding the Extrema of a Distributed Multiset 1994 8 WDAG Attiya & Rappoport, The Level of Handshake Required for Establishing a Connection 1994 8 WDAG Attiya & Shachnai & Tamir, Local Labeling and Resource Allocation Using Preprocessing 1994 8 WDAG Cidon & Gerstel & Zaks, A Scalable Approach to Routing in ATM Networks 1994 8 WDAG Shabtay & Segall, Low Complexity Network Synchronization 1994 8 WDAG Swaminathan & Goldman, An Incremental Distributed Algorithm for Computing Biconnected Components 1994 8 WDAG Garay, Reaching (and Maintaining) Agreement in the Presence of Mobile Faults 1994 8 WDAG Hoepman, Uniform Deterministic Self-stabilizing Ring-orientation on Odd-length Rings 1994 8 WDAG Lo & Hadzilacos, Using Failure Detectors to Solve Consensus in Asynchronous Shared-memory Systems 1994 8 WDAG Tsay & Bagrodia, An Algorithm with Optimal Failure Locality for the Dining Philosophers Problem 1994 8 WDAG Allenberg-Navony & Itai & Moran, Average and Randomized Complexity of Distributed Problems 1994 8 WDAG Awerbuch & Patt-Shamir & Varghese & Dolev, Self-stabilization by Local Checking and Global Reset 1994 8 WDAG Basten, Breakpoints and Time in Distributed Computations 1994 8 WDAG Ruget, Cheaper Matrix Clocks 1993 7 WDAG Israeli & Rappoport, Efficient Wait-Free Implementation of a Concurrent Priority Queue 1993 7 WDAG Hoepman & Tromp, Binary Snapshots 1993 7 WDAG Israeli & Shaham & Shirazi, Linear-Time Snapshot Protocols for Unbalanced Systems 1993 7 WDAG Anderson & Moir, Towards a Necessary and Sufficient Condition for Wait-free Synchronization 1993 7 WDAG Kirousis & Veneris, Efficient Algorithms for Checking the Atomicity of a Run of Read and Write Operations 1993 7 WDAG Afek & Merritt & Taubenfeld, Benign Failure Models for Shared Memory 1993 7 WDAG Burns & Cruz & Loui, Generalized Agreement Between Concurrent Fail-Stop Processes 1993 7 WDAG Kanellakis & Michailidis & Shvartsman, Controlling Memory Access Concurrency in Efficient Fault-Tolerant Parallel Algorithms 1993 7 WDAG Rabinovich & Lazowska, Asynchronous Epoch Management in Replicated Databases 1993 7 WDAG Dolev & Welch, Crash Resilient Communication in Dynamic Networks 1993 7 WDAG Choy & Singh, Distributed Job Scheduling Using Snapshots 1993 7 WDAG Dolev, Optimal Time Self Stabilization in Dynamic Systems 1993 7 WDAG Anagnostou & Hadzilacos, Tolerating Transient and Permanent Failures 1993 7 WDAG Berman & Bharali, Quick Atomic Broadcast 1993 7 WDAG Attiya & Djerassi-Shintel, Time Bounds for Decision Problems in the Presence of Timing Uncertainty and Failures 1993 7 WDAG Flammini & Gambosi & Salomone, Boolean Routing 1993 7 WDAG Hardavellas & Karakos & Mavronicolas, Notes on Sorting and Counting Networks 1993 7 WDAG Higham & Przytycka, A Simple, Efficient Algorithm for Maximum Finding on Rings 1993 7 WDAG Syrotiuk & Colbourn & Pachl, Wang Tilings and Distributed Orientation on Anonymous Torus Networks 1993 7 WDAG Wu & Bochmann & Yao, Fairness of N-party Synchronization and Its Implementation in a Distributed Environment 1993 7 WDAG Boniol & Adelantado, Programming Distributed Reactive Systems: A Strong and Weak Synchronous Coupling 1993 7 WDAG Leong & Agrawal & Agre, Using Message Semantics to Reduce Rollback in the Time Warp Mechanism 1992 6 WDAG Afek & Ricklin, Sparser: A Paradigm for Running Distributed Algorithms 1992 6 WDAG Lubitch & Moran, Closed Schedulers: Constructions and Applications to Consensus Protocols 1992 6 WDAG Attiya & Herlihy & Rachman, Efficient Atomic Snapshots Using Lattice Agreement 1992 6 WDAG Greenberg & Taubenfeld & Wang, Choice Coordination with Multiple Alternatives 1992 6 WDAG Jayanti & Toueg, Some Results on the Impossibility, Universality, and Decidability of Consensus 1992 6 WDAG Afek & Gafni & Tromp & Vitanyi, Wait-free Test-and-Set 1992 6 WDAG Israeli & Pinhasov, A Concurrent Time-stamp Scheme which is Linear in Time and Space 1992 6 WDAG Garofalakis & Rajsbaum & Spirakis & Tampakas, Tentative and Definite Distributed Computations: An Optimistic Approach to Network Synchronization 1992 6 WDAG Ponzio & Strong, Semisynchrony and Real Time 1992 6 WDAG Zamsky & Israeli & Pinter, Optimal Time Byzantine Agreement for t < n/8 with Linear Messages 1992 6 WDAG Garay & Perry, A Continuum of Failure Models for Distributed Computing 1992 6 WDAG Bazzi & Neiger, Simulating Crash Failures with Many Faulty Processors 1992 6 WDAG Awerbuch & Mansour, An Efficient Topology Update Protocol for Dynamic Networks 1992 6 WDAG Anagnostou & El-Yaniv & Hadzilacos, Memory Adaptive Self-Stabilizing Protocols 1992 6 WDAG Berman & Garay & Perry, Optimal Early Stopping in Distributed Consensus 1992 6 WDAG Kortsarz & Peleg, Traffic-Light Scheduling on the Grid 1992 6 WDAG Kranakis & Santoro, Distributed Computing on Anonymous Hypercubes with Faulty Components 1992 6 WDAG Cidon & Shavitt, Message Terminate Algorithms for Anonymous Rings of Unknown Size 1992 6 WDAG Bar-Ilan & Peleg, Distributed Resource Allocation Algorithms 1992 6 WDAG Amir & Dolev & Kramer & Malki, Membership Algorithms for Multicast Communication Groups 1992 6 WDAG Anderson & Yang & Gouda, The Granularity of Waiting 1992 6 WDAG Ricciardi & Birman & Stephenson, The Cost of Order in Asynchronous Systems 1992 6 WDAG Mavronicolas & Roth, Efficient, Strongly Consistent Implementations of Shared Memory 1992 6 WDAG Budhiraja & Marzullo & Schneider & Toueg, Optimal Primary-Backup Protocols 1991 5 WDAG Abraham & Ben-David & Moran, On the Limitations of the Global Time Assumption in Distributed Systems 1991 5 WDAG Ahamad & Burns & Hutto & Neiger, Causal Memory 1991 5 WDAG Anagnostou & El-Yaniv, More on the Power of Random Walks: Uniform Self-Stabilizing Randomized Algorithms 1991 5 WDAG Anderson & Groselj, Pseudo Read-Modify-Write Operations: Bounded Wait-Free Implementations 1991 5 WDAG Arora & Dolev & Gouda, Maintaining Digital Clocks in Step 1991 5 WDAG Attiya, Implementing FIFO Queues and Stacks 1991 5 WDAG Bar-Noy & Deng & Garay & Kameda, Optimal Amortized Distributed Consensus 1991 5 WDAG Bazzi & Neiger, Optimally Simulating Crash Failures in a Byzantine Environment 1991 5 WDAG Berman & Garay, Efficient Distributed Consensus with n = (3+epsilon)t Processors 1991 5 WDAG Bracha & Rachman, Randomized Consensus in Expected O(n^2 log n) Operations 1991 5 WDAG Chaudhuri & Coan & Welch, Using Adaptive Timeouts to Achieve At-Most-Once Message Delivery 1991 5 WDAG Dolev & Israeli & Moran, Uniform Dynamic Self-Stabilizing Leader Election 1991 5 WDAG Hung & Chen, The Quickest Path Problem in Distributed Computing Systems 1991 5 WDAG Itai, The Communication Complexity of the Two-List Problem 1991 5 WDAG Italiano, Distributed Algorithms for Updating Shortest Paths 1991 5 WDAG Jayanti & Sethi & Lloyd, Minimal Shared Information for Concurrent Reading and Writing 1991 5 WDAG Kirousis & Spirakis & Tsigas, Reading Many Variables in One Atomic Operation: Solutions With Linear or Sublinear Complexity 1991 5 WDAG Malka & Rajsbaum, Analysis of Distributed Algorithms Based on Recurrence Relations 1991 5 WDAG Marzullo & Neiger, Detection of Global State Predicates 1991 5 WDAG Marzullo & Sabel, Using Consistent Subcuts for Detecting Stable Properties 1991 5 WDAG Merritt & Taubenfeld, Atomic m-registers Operations 1991 5 WDAG Rangarajan & Tripathi, A Robust Distributed Mutual Exclusion Algorithm 1991 5 WDAG Shabtay & Segall, Message Delaying Synchronizers 1990 4 WDAG Israeli & Jalfon, Self-Stabilizing Ring Orientation 1990 4 WDAG Afek & Kutten & Yung, Memory-Efficient Self-Stabilizing Protocols for General Networks 1990 4 WDAG Itai, On the Computational Power Needed to Elect a Leader 1990 4 WDAG Lavallee & Lavault, Spanning Tree Construction for Nameless Networks 1990 4 WDAG Beauquier & Gastin & Villain, A Linear Fault-Tolerant Naming Algorithm 1990 4 WDAG Peleg, Distributed Data Structures: A Complexity-Oriented View 1990 4 WDAG Kroger & Luling & Monien & Vornberger, An Improved Algorithm to Detect communication Deadlocks in Distributed Systems 1990 4 WDAG Rajsbaum & Sidi, On the Average Performance of Synchronized Programs in Distributed Networks 1990 4 WDAG Park & Masuzawa & Hagihara & Tokura, Distributed Algorithms for Reconstructing MST after Topology Change 1990 4 WDAG Janardan & Cheng, Efficient Distributed Algorithms for Single-Source Shortest Paths and Related Problems on Plane Networks 1990 4 WDAG Gronning & Nielsen & Lovengreen, Stepwise Development of a Distributed Load Balancing Algorithm 1990 4 WDAG Cidon & Kutten & Mansour & Peleg, Greedy Packet Scheduling 1990 4 WDAG Cidon & Gopal & Kutten, Optimal Computation of Global Sensitive Functions in Fast Networks 1990 4 WDAG Ofek & Yung, Efficient Mechanism for Fairness and Deadlock-Avoidance in High-Speed Networks 1990 4 WDAG Dwork, Strong Verifiable Secret Sharing 1990 4 WDAG Sandoz & Schiper, Weak Consistency and Pessimistic Replica Control 1990 4 WDAG Agrawal & Abbadi, Localized-Access Protocols for Replicated Databases 1990 4 WDAG Obradovic & Berman, Weighted Voting for Operation Dependent Management of Replicated Data 1990 4 WDAG Jayanti & Toueg, Wakeup under Read/Write Atomicity 1990 4 WDAG Chandra & Toueg, Time and Message Efficient Reliable Broadcasts 1990 4 WDAG Budhiraja & Gopal & Toueg, Early-Stopping Distributed Bidding and Applications 1990 4 WDAG Berman & Garay, Fast Consensus in Networks of Bounded Degree 1990 4 WDAG Neiger & Tuttle, Common Knowledge and Consistent Simultaneous Coordination 1990 4 WDAG de Lemos & Ezhilchelvan, Agreement on the Group Membership in Synchronous Distributed Systems 1990 4 WDAG Biran & Moran & Zaks, Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks 1990 4 WDAG Fleischer & Jung & Mehlhorn, A Time-Randomness Tradeoff for Communication Complexity 1990 4 WDAG Chaudhuri & Welch, Bounds on the Costs of Register Implementations 1990 4 WDAG Afek & Dolev & Gafni & Merritt & shavit, A Bounded First-In, First-Enabled Solution to the 1-Exclusion Problem 1989 3 WDAG Bar-Ilan & Zernik, Random Leaders and Random Spanning Trees 1989 3 WDAG Bar-Noy & Dolev & Koller & Peleg, Fault-tolerant Critical Section Management in Asynchronous Networks 1989 3 WDAG Bar-Yehuda & Goldreich & Itai, Efficient Emulation of Single-Hop Radio Network with Collision Detection on Multi-Hop Radio Network with No Collision Detection 1989 3 WDAG Bernabeu-Auban & Ahamad, Applying a Path-Compression Technique to Obtain an Efficient Distributed Mutual Exclusion Algorithm 1989 3 WDAG Charron-Bost, Combinatorics and Geometry of Consistent Cuts: Application to Concurrency Theory 1989 3 WDAG Cidon & Ofek, Distributed Fairness Algorithms for Local Area Networks with Concurrent Transmissions 1989 3 WDAG Cohen & Segall, An Efficient Reliable Ring Protocol 1989 3 WDAG Ginat & Shankar & Agrawala, An Efficient Solution to the Drinking Philosophers Problem and its Extensions 1989 3 WDAG Goldman, Highly Concurrent Logically Synchronous Multicast 1989 3 WDAG Gopal & Toueg, Reliable Broadcast in Synchronous and Asynchronous Environments 1989 3 WDAG Helary, Observing Global States of Asynchronous Distributed Applications 1989 3 WDAG Jezequel, Building a Global Time on Parallel Machines 1989 3 WDAG Kranakis, Functional Dependencies of Variables in Wait-free Programs 1989 3 WDAG Luling & Monien, Two Strategies for Solving the Vertex Cover Problem on a Transputer Network 1989 3 WDAG Masuzawa & Nishikawa & Hagihara & Tokura, Optimal Fault-tolerant Distributed Algorithms for Election in Complete Networks with a Global Sense of Direction 1989 3 WDAG Matias & Afek, Simple and Efficient Election Algorithms for Anonymous Networks 1989 3 WDAG Rukoz, A Distributed Solution for Detecting Deadlock in Distributed Nested Transaction Systems 1989 3 WDAG Sanders & Heuberger, Distributed Deadlock Detection and Resolution with Probes 1989 3 WDAG Schiper & Eggli & Sandoz, A New Algorithm to Implement Causal Ordering 1989 3 WDAG Spirakis & Tampakas & Tsiolis, Symmetry Breaking in Asynchronous Rings with O(n) Messages 1989 3 WDAG Stomp & de Roever, Designing Distributed Algorithms by Means of Formal Sequentially Phased Reasoning 1989 3 WDAG Taubenfeld & Moran, Possibility and Impossibility Results in a Shared Memory Environment 1989 3 WDAG Taudes, Communication Heuristics in Distributed Combinatorial Search Algorithms 1989 3 WDAG Taylor, The Role of Inhibition in Asynchronous Consistent-Cut Protocols 1989 3 WDAG Tromp, How To Construct an Atomic Variable 1989 3 WDAG Yamashita & Kameda, Electing a Leader When Processor Identity Numbers are not Distinct 1987 2 WDAG Johansen & Jorgensen & Nielsen & Nielsen & Skyum, A Distributed Spanning Tree Algorithm 1987 2 WDAG Tel, Directed Network Protocols 1987 2 WDAG Segall & Gopal & Baratz, Query Algorithms in Computer Networks 1987 2 WDAG Bermond & Konig & Raynal, General and Efficient Decentralized Consensus Protocols 1987 2 WDAG Perry, A Framework for Agreement 1987 2 WDAG Ordman, Byzantine Firing Squad using a Faulty External Source 1987 2 WDAG Vogler, An Improved Multiple Identification Algorithm for Synchronous Broadcasting 1987 2 WDAG Singh & Smolka & Ramakrishnan, Distributed Algorithms for Tree Pattern Matching 1987 2 WDAG Negro & Santoro & Urrutia, On the Packet Complexity of Distributed Selection 1987 2 WDAG Vornberger, Load Balancing in a Network of Transputers 1987 2 WDAG Mattern, Experience with a New Distributed Termination Detection Algorithm 1987 2 WDAG Belik, A Distributed Deadlock Avoidance Technique 1987 2 WDAG Naimi & Trehel, How to Detect a Failure and Regenerate the Token in the Log(N) Distributed Algorithm for Mutual Exclusion 1987 2 WDAG Schoone, Verification of Connection Management Protocols 1987 2 WDAG Gafni, Generalized Scheme for Topology Update in Dynamic Networks 1987 2 WDAG Chou & Cidon & Gopal & Zaks, Synchronizing Asynchronous Bounded Delay Networks 1987 2 WDAG Fekete & Lynch & Shrira, A Modular Proof of Correctness for a Network Synchronizer 1987 2 WDAG Lakshmanan & Thulasiraman, On the Use of Synchronizers for Asynchronous Communication Networks 1987 2 WDAG Kirousis & Kranakis & Vitanyi, Atomic Multireader Register 1987 2 WDAG Vidyasankar & Minoura, An Optimistic Resilience Control Scheme for Distributed Database Systems 1987 2 WDAG Kerboul & Kung & Richard, A Failsafe Scheme for Replicated Information 1987 2 WDAG Abrahamson & Adler & Higham & Kirkpatrick, Randomized Function Evaluation on a Ring 1987 2 WDAG Syrotiuk & Pachl, A Distributed Ring Orientation Algorithm 1987 2 WDAG Attiya, Constructing Efficient Election Algorithms from Efficient Traversal Algorithms 1987 2 WDAG Chan & Chin, Optimal Resilient Ring Election Algorithms 1987 2 WDAG Abu-Amara, Fault-Tolerant Distributed Distributed Algorithm for Election in Complete Networks 1987 2 WDAG Reischuk & Koshors, Lowerbounds for Synchronous Systems and the Advantage of Local Information 1987 2 WDAG Bouge, On the Existence of Generic Broadcast Algorithms in Networks of Communicating Sequential Processes 1987 2 WDAG Sere, Stepwise Removal of Virtual Channels in Distributed Algorithms: A Case Study 1987 WEST Naps & Singh, Program Design with Pascal: Principles, Algorithms, and Data Structures 1946 49 WETEN de Bruijn, A Combinatorial Problem 1995 21 WG Kranakis & Krizanc & Ruf & Urrutia & Woeginger, VC-Dimensions for Graphs 1995 21 WG Kloks & Kratsch & Muller, Finding and Counting Small Induced Subgraphs Efficiently 1995 21 WG Babel & Olariu, On the Isomorphism of Graphs with Few P_4s 1995 21 WG Degiorgi & Simon, A Dynamic Algorithm for Line Graph Recognition 1995 21 WG d'Amore & Giaccio, Incremental Hive Graph 1995 21 WG Djidjev & Venkatesan, Planarization of Graphs Embedded on Surfaces 1995 21 WG Krumke & Noltemeier & Ravi & Marathe, Complexity and Approximability of Certain Bicriteria Location Problems 1995 21 WG Plump, On Termination of Graph Rewriting 1995 21 WG Bauderon, A Uniform Approach to Graph Rewriting: The Pullback Approach 1995 21 WG Fracchia, Visualizing Two- and Three-Dimensional Models of Meristematic Growth 1995 21 WG Hartmann, Graph-Theoretical Methods to Construct Entity-Relationship Databases 1995 21 WG Schiermeyer, An Approximation Algorithm for 3-Colourability 1995 21 WG Fischer & Torenvliet, The Malleability of TSP_2Opt 1995 21 WG Alimonti, Non-Oblivious Local Search for Graph and Hypergraph Coloring Problems 1995 21 WG Bodlaender & Tan & Thilikos & van Leeuwen, On Interval Routing Schemes and Treewidth 1995 21 WG Wada & Ikeo & Kawaguchi & Chen, Highly Fault-Tolerant Routings and Diameter Vulnerability for Generalized Hypercube Graphs 1995 21 WG Mey auf der Heide & Westermann, Hot-Potato Routing on Multi-Dimensional Tori 1995 21 WG Flammini & Gambosi & Salomone, On Devising Boolean Routing Schemes 1995 21 WG Birchler & Esfahanian & Torng, Toward a General Theory of Unicast-Based Multicast Communication 1995 21 WG Rolim & Sykora & Vrt'o, Optimal Cutwidths and Bisection Widths of 2- and 3-Dimensional Meshes 1995 21 WG Damaschke, Searching for Faulty Leaves in Binary Trees 1995 21 WG Chen & He, NC Algorithms for Partitioning Planar Graphs into Induced Forests and Approximating NP-Hard Problems 1995 21 WG Dahlhaus, Efficient Parallel Modular Decomposition 1995 21 WG Bonizzoni & Della Vedova, Modular Decomposition of Hypergraphs 1995 21 WG Pfaltz, Partition Coefficients of Acyclic Graphs 1995 21 WG Takaoka, Sub-Cubic Cost Algorithms for the All Pairs Shortest Path Problem 1995 21 WG Deogun & Kratsch, Diametral Path Graphs 1995 21 WG Galinier & Habib & Paul, Chordal Graphs and their Clique Graphs 1995 21 WG Gustedt & Morvan & Viennot, A Compact Data Structure and Parallel Algorithms for Permutation Graphs 1995 21 WG Brandstadt & Dragan & Nicolai, Homogeneously Orderable Graphs and the Steiner Tree Problem 1994 20 WG Ramachandramurthi, A Lower Bound for Treewidth and Its Consequences 1994 20 WG Kratochvil & Proskurowski & Telle, Complexity of Graph Covering Problems 1994 20 WG Crescenzi & Trevisan, Minimum Vertex Cover, Distributed Decision-Making, and Communication Complexity 1994 20 WG Andreae & Nolle & Schreiber, Cartesian Products of Graphs as Spanning Subgraphs of De Bruijn Graphs 1994 20 WG Bhagavathi & Bokka & Gurla & Olariu & Schwing, Time-Optimal Tree Computations on Sparse Meshes 1994 20 WG Chaudhuri & Hagerup, Prefix Graphs and Their Applications 1994 20 WG Jakoby & Reischuk & Schindelhauer, The Complexity of Broadcasting in Planar and Decomposable Graphs 1994 20 WG Chen, The Maximal f-Dependent Set Problem for Planar Graphs is in NC 1994 20 WG Di Battista & Tamassia & Vismara, On-Line Convex Planarity Testing 1994 20 WG Shahrokhi & Sykora & Szekely & Vft'o, Book Embeddings and Crossing Numbers 1994 20 WG Golin & Zaks, Labelled Trees and Pairs of Input-Output Permutations in Priority Queues 1994 20 WG Bodlaender & Deogun & Jansen & Kloks & Kratsch & Muller & Tuza, Rankings of Graphs 1994 20 WG Dorr, Bypass Strong V-Structures and Find an Isomorphic Labelled Subgraph in Linear Time 1994 20 WG Wada & Takaki & Kawaguchi, Efficient Algorithms for a Mixed k-partition Problem of Graphs without Specifying Bases 1994 20 WG Dendris & Kirousis & Thilikos, Fugitive-Search Games on Graphs and Related Parameters 1994 20 WG Kajitani & Cho & Sarrafzadeh, New Approximation Results on Graph Matching and Related Problems 1994 20 WG Sieling & Wegener, New Lower Bounds and Hierarchy Results for Restricted Branching Programs 1994 20 WG Giaccio, On-line Algorithms for Satisfiability Problems with Uncertainty 1994 20 WG Bampis & Manoussakis & Milis, NC Algorithms for Antidirected Hamiltonian Paths and Cycles in Tournaments 1994 20 WG Babel & Ponomarenko & Tinhofer, Directed Path Graph Isomorphism 1993 19 WG Nikoletseas & Spirakis, Near-Optimal Dominating Sets in Dense Random Graphs in Polynomial Expected Time 1993 19 WG Holloway & Ravindran & Gibbons, Approximating Minimum Weight Perfect Matchings for Complete Graphs Satisfying the Triangle Inequality 1993 19 WG Marathe & Radhakrishnan & Hunt & Ravi, Hierarchically Specified Unit Disk Graphs 1993 19 WG Wanke, Bounded Treewidth and LOGCFL 1993 19 WG Bodlaender, On Reduction Algorithms for Graphs with Small Treewidth 1993 19 WG Golumbic & Kaplan & Shamir, Algorithms and Complexity of Sandwich Problems in Graphs 1993 19 WG Marchetti-Spaccamela & Nanni & Rohnert, On-line Graph Algorithms for Incremental Compilation 1993 19 WG Alimonti & Leonardi & Marchetti-Spaccamela & Messeguer, Average Case Analysis of Fully Dynamic Connectivity for Directed Graphs 1993 19 WG Ivkovic & Lloyd, Fully Dynamic Maintenance of Vertex Cover 1993 19 WG Bodlaender, Dynamic Algorithms for Graphs with Treewidth 2 1993 19 WG Brandstadt & Voss, Short Disjoint Cycles in Graphs with Degree Constraints 1993 19 WG Wada & Kawaguchi, Efficient Algorithms for Tripartitioning Triconnected Graphs and 3-Edge-Connected Graphs 1993 19 WG Lonc, Towards a Solution of the Holyer's Problem 1993 19 WG Havas & Majewski & Wormald & Czech, Graphs, Hypergraphs and Hashing 1993 19 WG Kucera, Coloring k-Colorable Graphs in Constant Expected Parallel Time 1993 19 WG Schiermeyer, Deciding 3-Colorability in Less than O(1.415^n) Steps 1993 19 WG Jansen, A Rainbow about T-Colorings for Complete Graphs 1993 19 WG Lin, Approximating the Chromatic Polynomial of a Graph 1993 19 WG Corneil & Olariu & Stewart, Asteroidal Triple-Free Graphs 1993 19 WG Dahlhaus, The Parallel Complexity of Elimination Ordering Procedures 1993 19 WG Brandstadt & Dragon & Chepoi & Voloshin, Dually Chordal Graphs 1993 19 WG Wegener, The Size of Reduced OBDDs and Optimal Read-Once Branching Programs for Almost All Boolean Functions 1993 19 WG Desel, Regular Marked Petri Nets 1993 19 WG Esparza & von Stengel, The Asynchronous Committee Meeting Problem 1993 19 WG Hromkovic & Klasing & Stohr, Gossiping in Vertex-Disjoint Paths Mode in Interconnection Networks 1993 19 WG Ohring & Das, The Folded Petersen Network: A New Versatile Multiprocessor Interconnection Topology 1993 19 WG Boillat, Fast Load Balancing in Cayley Graphs and in Circuits 1993 19 WG Shahrokhi & Szekely, Concurrent Flows and Packet Routing in Cayley Graphs 1993 19 WG Kranakis & Krizanc & Ravi, On Multi-Lable Linear Interval Routing Schemes 1993 19 WG Haldar, An `All Pairs Shortest Paths' Distributed Algorithm Using 2n^2 Messages 1993 19 WG Nakano, Linear Layouts of Generalized Hypercubes 1993 19 WG Chen & Kanchi, Graph Ear Decompositions and Graph Embeddings 1993 19 WG Shahrokhi & Szekely & Sykora & Vrt'o, Improved Bounds for the Crossing Numbers on Surfaces of Genus g 1993 19 WG Kant & He, Two Algorithms for Finding Rectangular Duals of Planar Graphs 1993 19 WG Kant, A More Compact Visibility Representation 1992 18 WG Brandstadt, On Improved Time Bounds for Permutation Graph Problems 1992 18 WG Hsu, A Simple Test for Interval Graphs 1992 18 WG Felsner, Tolerance Graphs and Orders 1992 18 WG Jansen, On Scheduling Problems Restricted to Interval Orders 1992 18 WG Bodlaender & Jansen & Woeginger, Scheduling with Incompatible Jobs 1992 18 WG Jansen & Scheffler, Generalized Coloring for Tree-like Graphs 1992 18 WG Dahlhaus, Optimal (Parallel) Algorithms for the All-to-All Vertices Distance Problem for Certain Graph Classes 1992 18 WG Hromkovic, Topology of Parallel Networks and Computational Complexity 1992 18 WG Preilowski, Parallel Triangulation of Nonconvex Polytopes 1992 18 WG Bodlaender, Kayles on Special Classes of Graphs -- An Application of Sprague-Grundy Theory 1992 18 WG Chen, A Linear Time Algorithm for Isomorphism of Graphs of Bounded Average Genus 1992 18 WG Bhatia, Improved Algorithms for Routing on Two-dimensional Grids 1992 18 WG Ihler, Minimum Rectlinear Steiner Trees for Intervals on Two Parallel Lines 1992 18 WG Gerstel & Zaks, A New Characterization of Tree Medians with Applications to Distributed Algorithms 1992 18 WG Dinitz, The 3-Edge-Components and a Structural Description of all 3-Edge-Cuts in a Graph 1992 18 WG Chen & Kanevsky, On Assembly of 4-Connected Graphs 1992 18 WG Jamison & Olariu, On the Homogeneous Decomposition of Graphs 1992 18 WG Das & Mao, Embeddings in Recursive Combinatorial Networks 1992 18 WG Thorup, On Shortcutting Digraphs 1992 18 WG Cournier & Habib, An Efficient Algorithm to Recognize Prime Undirected Graphs 1992 18 WG Felsner & Wagner, On the Complexity of Partial Orders Properties 1992 18 WG Mosbah, Probabilistic Graph Grammars 1992 18 WG Parisi-Presicce, Single vs. Double Pushout Derivations of Graphs 1992 18 WG Kant, Hexagonal Grid Drawings 1992 18 WG Erwig, Graph Algorithms = Iteration + Data Structures ? The Structure of Graph Algorithms and a Corresponding Style of Programming 1992 18 WG Alimonti & Feuerstein, Petri Nets, Hypergraphs and Conflicts 1992 18 WG Gergov & Meinel, Analysis and Manipulation of Boolean Functions in Terms of Decision Graphs 1992 18 WG O'Reilly & Santoro, The Expressiveness of Silence: Tight Bounds for Synchronous Communication of Information Using Bits and Silence 1992 18 WG Litovsky & Metivier & Zielonka, The Power and the Limitations of Local Computations on Graphs 1991 17 WG Bodlaender & Gilbert & Hafsteinsson & Kloks, Approximating Treewidth, Pathwidth and Minimum Elimination Tree Height 1991 17 WG Courcelle & Mosbah, Monadic Second-order Evaluations on Tree-decomposable Graphs 1991 17 WG Heckmann & Klasing & Monien & Unger, Optimal Embedding of Complete Binary Trees into Lines and Grids 1991 17 WG Okada & Hayashi, Graph Rewriting Systems and their Application to Network Reliability Analysis 1991 17 WG Schurr & Zundorf, Nondeterministic Control Structures for Graph Rewriting Systems 1991 17 WG Andries & Paredaens, A Language for Generic Graph-transformations 1991 17 WG Freund & Haberstroh, Attributed Elementary Programmed Graph Grammars 1991 17 WG Ihler, The Complexity of Approximating the Class Steiner Tree Problem 1991 17 WG Lonc, On the Complexity of Some Chain and Antichain Partition Problems 1991 17 WG Czyzowicz & Rivera-Campo & Santoro & Urrutia & Zaks, Tight Bounds for the Rectangular Art Gallery Problem 1991 17 WG Guibas & Mitchell & Roos, Voronoi Diagrams of Moving Points in the Plane 1991 17 WG Shoudai & Miyano, Using Maximal Independent Sets to Solve Problems in Parallel 1991 17 WG Kedem & Palem & Pantziou & Spirakis & Zaroliagis, Fast Parallel Algorithms for Coloring Random Graphs 1991 17 WG Jiang & Bunke, Optimal Vertex Ordering of a Graph and its Application to Symmetry Detection 1991 17 WG Sykora & Vrto, Edge Separators for Graphs of Bounded Genus with Applications 1991 17 WG Du & Lyuu & Hsu, Line Digraph Iterations and the Spread Concept -- with Application to Graph Theory, Fault Tolerance, and Routing 1991 17 WG Kucera, A Generalized Encryption Scheme Based on Random Graphs 1991 17 WG Feuerstein & Marchetti-Spaccamela, Dynamic Algorithms for Shortest Paths in Planar Graphs 1991 17 WG Stewart, Complete Problems for Logspace Involving Lexicographic First Paths in Graphs 1991 17 WG Takaoka, A New Upper Bound on the Complexity of the All Pairs Shortest Path Problem 1991 17 WG Sykora & Vrto, On the Crossing Number of the Hypercube and the Cube Connected Cycles 1991 17 WG Damaschke, Logic Arrays for Interval Indicator Functions 1991 17 WG Stohr, On the Broadcast Time of the Butterfly Network 1991 17 WG Bodlaender, On Disjoint Cycles 1991 17 WG Brandstadt, Short Disjoint Cycles in Cubic Bridgeless Graphs 1990 16 WG Pantziou & Spirakis & Zaroliagis, Optimal Parallel Algorithms for Sparse Graphs 1990 16 WG Plehn & Voigt, Finding Minimally Weighted Subgraphs 1990 16 WG Bodlaender, On the Complexity of Some Coloring Games 1990 16 WG Huckenbeck & Ruland, A Generalized Best-first Search Method in Graphs 1990 16 WG Ma & Spinrad, Avoiding Matrix Multiplication 1990 16 WG Damaschke, Induced Subgraph Isomorphism for Cographs is NP-Complete 1990 16 WG Stamm, On Feedback Problems in Planar Digraphs 1990 16 WG Aurenhammer & Hagauer, Recognizing Binary Hamming Graphs in O(n^2 log n) Time 1990 16 WG Liao & Sarrafzadeh, Vertex-disjoint Trees and Boundary Single-layer Routing 1990 16 WG Ihler, Bounds on the Quality of Approximate Solutions to the Group Steiner Problem 1990 16 WG Arbib, Two Polynomial Problems in PLA Folding 1990 16 WG Formann & Wagner, The VLSI Layout Problem in Various Embedding Models 1990 16 WG Makedon & Tragoudas, Approximating the Minimum Net Expansion: Near Optimal Solutions to Circuit Partitioning Problems 1990 16 WG Madhavapeddy & Sudborough, Deterministic Message Routing in Faulty Hypercubes 1990 16 WG Choi & Esfahanian, On Complexity of a Message-Routing Strategy for Multicomputer Systems 1990 16 WG Zienicke, Embeddings of Treelike Graphs into 2-Dimensional Meshes 1990 16 WG Das & Thulasiraman, Diagnosis of t/s-Diagnosable Systems 1990 16 WG Biran & Moran & Zaks, Deciding 1-Solvability of Distributed Task is NP-Hard 1990 16 WG Habib & Morvan & Rampon, Remards on Some Concurrency Measures 1990 16 WG Hoffmann & Kaufmann, On the Rectilinear Art Gallery Problem - Algorithmic Aspects 1990 16 WG Fischer & Simon, Separation Problems and Circular Arc Systems 1990 16 WG Reuter & Rival, Genus of Orders and Lattices 1990 16 WG Stewart, Comparing the Expressibility of Two Languages Formed Using NP-Complete Graph Operators 1990 16 WG Seipel, Decomposition of Linear Recursive Logic Programs 1990 16 WG Caucal & Monfort, On the Transition Graphs of Automata and Grammars 1990 16 WG Lowe & Ehrig, Algebraic Approach to Graph Transformation Based on Single Pushout Derivations 1989 15 WG Madhavapeddy & Sudborough, Disjoint Paths in the Hypercube 1989 15 WG Capocelli & Gargano & Vaccaro, Time Bounds for Broadcasting in Bounded Degree Graphs 1989 15 WG Das & Thulasiraman & Agarwal & Lakshmanan, t/s-Diagnosable Systems: A Characterization and Diagnosis Algorithm 1989 15 WG Vogler, On Hyperedge Replacement and BNCL Graph Grammars 1989 15 WG Billaud & Lafon & Metivier & Sopena, Graph Rewriting Systems with Priorities 1989 15 WG Habel & Kreowski, Filtering Hyperedge-Replacement Languages Through Compatible Properties 1989 15 WG Schneider, Describing Distributed Systems by Categorical Graph Grammars 1989 15 WG Bunke & Haller, A Parser for Context Free Plex Grammars 1989 15 WG Schurr, Introduction to PROGRESS, an Attribute Graph Grammar Based Specification Language 1989 15 WG Brandenburg, On the Complexity of Optimal Drawings of Graphs 1989 15 WG Syslo, Bounds to the Page Number of Partially Ordered Sets 1989 15 WG Reich & Widmayer, Beyond Steiner's Problem: A VLSI Oriented Generalization 1989 15 WG Schiermeyer, A Fast Sequential and Parallel Algorithm for the Computation of the k-Closure of a Graph 1989 15 WG Speckenmeyer, On Feedback Problems in Digraphs 1989 15 WG Bodlaender, Improved Self-Reduction Algorithms for Graphs with Bounded Treewidth 1989 15 WG Simon, Finding a Minimal Transitive Reduction in a Strongly Connected Digraph within Linear Time 1989 15 WG Henrich & Six & Widmayer, Paging Binary Trees with External Balancing 1989 15 WG Lozano & Balcazar, The Complexity of Graph Problems for Succinctly Represented Graphs 1989 15 WG Anderson & Kahan & Schlag, An O(n log n) Algorithm for 1-D Tile Compaction 1989 15 WG Menzel & Monien, Weighted Parallel Triangulation of Simple Polygons 1989 15 WG Dehne & Rau-Chaplin, Implementing Data Structures on a Hypercube Multiprocessor, and Applications in Parallel Computational Geometry 1989 15 WG Roos, k-Nearest-Neighbor Voronoi Diagrams for Sets of Convex Polygons, Line Segments and Points 1989 15 WG van Kreveld & de Berg, Finding Squares and Rectangles in Sets of Points 1989 15 WG Klein, Combinatorial Properties of Abstract Voronoi Diagrams 1989 15 WG , List of WG-Proceedings 1976-1989 1989 WG Bodlaender, NC-Algorithms for Graphs with Small Treewidth 1989 WG Habel, Graph-Theoretic Properties Compatible with Graph Derivations 1989 WG Courcelle, The Monadic Second-Order Logic of Graphs: Definable Sets of Finite Graphs 1989 WG Bauderon, On Systems of Equations Defining Infinite Graphs 1989 WG Meijer & Dawes, Fault Tolerant Networks of Specified Diameter 1989 WG Korach & Ostfeld, DFS Tree Construction: Algorithms and Characterizations 1989 WG Vidyasankar, Serializable Graphs 1989 WG Biskup & Stiefeling, Transitive Closure Algorithms for Very Large Databases 1989 WG Seipel, A Graph-Based Decomposition Approach for Recursive Query Processing 1989 WG Lipeck & Feng, Construction of Deterministic Transition Graphs from Dynamic Integrity Constraints 1989 WG Santoro, (Time x Space)-Efficient Implementations of Hierarchical Conceptual Models 1989 WG de Berg & Overmars, Dominance in the Presence of Obstacles 1989 WG Nurmi & Sack, Separating a Polyhedron by One Translation from a Set of Obstacles 1989 WG Iwanowski, Linear Time Algorithms for Testing Approximate Congruence in the Plane 1989 WG Abramowski & Lang & Muller, Moving Regular k-Gons in Contact 1989 WG Woginger, Epsilon-Nets for Halfplanes 1989 WG Lingas, Greedy Triangulation Can be Efficiently Implemented in the Average Case 1989 WG Schimmler & Schroder, A Simple Systolic Method to Find All Bridges of an Undirected Graph 1989 WG Stewart, Colouring Perfect Planar Graphs in Parallel 1989 WG Takaoka, An Efficient Parallel Algorithm for the All Pairs Shortest Path Problem 1989 WG Savage & Wloka, A Parallel Algorithm for Channel Routing 1989 WG Kaeslin, Application of Graph Theory to Topology Generation for Logic Gates 1989 WG Marchetti-Spaccamela, On the Estimate of the Size of a Directed Graph 1989 WG Hartel, The Average Size of Ordered Binary Subgraphs 1989 WG Jayakumar & Thulasiraman & Swamy, O(n^2) Algorithms for Graph Planarization 1989 WG Wiegers & Monien, Bandwidth and Profile Minimization 1989 WG Mayr & Plaxton, On the Spanning Trees of Weighted Graphs 1989 WG Huckenbeck, On Paths in Search or Decision Trees Which Require Almost Worst-Case Time 1989 WG Preilowski & Mumbeck, A Time-Optimal Parallel Algorithm for the Computing of Voronoi-Diagrams 1989 WG Klein, Voronoi Diagrams in the Moscow Metric (Extended Abstract) 1989 WG Hinrichs & Nievergelt & Schorn, A Sweep Algorithm and Its Implementation: The All-Nearest-Neighbors Problem Revisited 1988 WG Dehne & Klein, A Sweepcircle Algorithm for Voronoi Diagrams (Extended Abstract) 1988 WG Govindan & Rangan, Competitive Location in the L_I and L_INF Metrics 1988 WG Icking & Klein & Ottmann, Priority Search Trees in Secondary Memory (Extended Abstract) 1988 WG Rottke & Six & Widmayer, On the Analysis of Grid Structures for Spatial Objects of Non-Zero Size 1988 WG Poutre & van Leeuwen, Maintenance of Transitive Closures and Transitive Reductions of Graphs (Extended Abstract) 1988 WG Sinclair & Jerrum, Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains (Extended Abstract) 1988 WG Berghammer & Ehler & Zierer, Development of Several Reachability Algorithms for Directed Graphs 1987 WG Korte & Mohring, A Simple Linear-Time Algorithm to Recognize Interval Graphs 1987 WG Widmayer, On Approximation Algorithms for Steiner's Problem in Graphs 1987 WG Kaul, Specification of Error Distances for Graphs by Precedence Graph Grammars and Fast Recognition of Similarity 1987 WG Vogler, Behaviour Preserving Refinements of Petri Nets 1987 WG Faigle & Gierz, The Bandwidth of Planar Distributive Lattices 1987 WG Klein & Wood, The Node Visit Cost of Brother Trees 1987 WG Abramowski & Muller, Searching Connected Components in Very Large Grid Graphs 1987 WG Dewangan & Rangan, A Simple Implementation of Warshall's Algorithm on a VLSI Chip 1987 WG Syslo, On Some Generalizations of Outerplanar Graphs: Results and Open Problems 1987 WG Wiegers, Recognizing Outerplanar Graphs in Linear Time 1987 WG Helmbold & Mayr, Applications of Parallel Scheduling to Perfect Graphs 1987 WG Wedde, A Graph-Theoretic Approach for Designing Fair Distributed Resource Scheduling Algorithms 1987 WG Schoone & Bodlaender & van Leeuwen, Improved Diameter Bounds for Altered Graphs 1987 WG Dehne & Sack, Separability of Sets of Polygons 1987 WG Tamassia & Tollis, Centipede Graphs and Visibility on a Cylinder 1987 WG Spirakis, The Diameter of Connected Components of Random Graphs 1987 WG Battista & Nardelli, An Algorithm for Testing Planarity of Hierarchical Graphs 1980 WG Mahr, A Birds Eye View to Path Problems 1980 WG Even & Yacobi, An Observation Concerning the Complexity of Problems with Few Solutions and Its Application to Cryptography 1980 WG Mehlhorn, A New Data Structure for Representing Sorted Lists 1980 WG Rosenberg, Issues in the Study of Graph Embeddings 1990 WHFREEMAN Dewdney, The Magic Machine: A Handbook of Computer Sorcery 1989 WHFREEMAN Nicolis & Prigogine, Exploring Complexity: An Introduction 1989 WHFREEMAN Nicolis & Prigogine, Exploring Complexity: An Introduction 1989 WHFREEMAN Dewdney, The Turing Omnibus: 61 Excursions in Computer Science 1989 WHFREEMAN Gardner, Penrose Tiles to Trapdoor Ciphers 1987 WHFREEMAN Grunbaum & Shephard, Tilings and Patterns 1982 WHFREEMAN Gardner, Aha! Gotcha: Paradoxes to Puzzle and Delight 1997 WILEY Cohen, Introduction to Computer Theory, Second Edition 1996 WILEY Chong & Zak, An Introduction to Optimization 1996 WILEY Horstmann, Mastering C++, Second Edition: An Introduction to C++ and Object-Oriented Programming for C and Pascal Programmers 1995 WILEY Schneier, E-Mail Security: How to Keep Your Electronic Messages Private 1995 WILEY Pach & Agarwal, Combinatorial Geometry 1995 WILEY Daskin, Network and Discrete Location: Models, Algorithms, and Applications 1995 WILEY Jensen & Toft, Graph Coloring Problems 1995 WILEY Tucker, Applied Combinatorics, Third Edition 1995 WILEY Karel the Robot: A Gentle Introduction to the Art of Programming 1994 WILEY Gray, Programming with Class: A Practical Introduction to Object-Oriented Programming with C++ 1994 WILEY Cooper & Lam, A Jump Start Course in C++ Programming 1994 WILEY Cohen, It's Alive! The New Breed of Living Computer Programs 1994 WILEY Schneier, Applied Cryptography: Protocols, Algorithms, and Source Code in C 1993 WILEY Winder, Developing C++ Software, Second Edition 1993 WILEY Lewis & Moore, Best Resumes for Scientists and Engineers, Second Edition 1993 WILEY Flamig, Practical Data Structures in C++ 1993 WILEY Miller & Quilici, The Joy of C: Programming in C, Second Edition 1993 WILEY Cressie, Statistics for Spatial Data, Revised Edition 1993 WILEY Chatelin, Eigenvalues of Matrices 1993 WILEY Pitas (Ed.), Parallel Algorithms for Digital Image Processing, Computer Vision and Neural Networks 1993 WILEY Williams, Model Solving in Mathematical Programming 1992 WILEY Baccelli & Cohen & Olsder & Quadrat, Synchronization and Linearity: An Algebra for Discrete Event Systems 1992 WILEY Thompson, Sampling 1992 WILEY Frieze & Luczak (Eds.), Random Graphs, Volume 2 1992 WILEY Stewart & Stewart, Proposal Preparation, Second Edition 1992 WILEY Kronsjo & Shumsheruddin (Eds.), Advances in Parallel Algorithms 1992 WILEY Azencott (Ed.), Simulated Annealing: Parallelization Techniques 1992 WILEY Glover & Klingman & Phillips, Network Models in Optimization and Their Applications in Practice 1992 WILEY Soucek & Iris Group, Fuzzy, Holographic, and Parallel Intelligence: The Sixth-Generation Breakthrough (includes Sutherland, The Holographic Neural Method) 1992 WILEY Alon & Spencer, The Probabilistic Method 1991 WILEY Duffy, Principles of Automated Theorem Proving 1991 WILEY Barthelemy & Guenoche, Trees and Proximity Representations 1991 WILEY Ledermann (Ed.), Handbook of Applicable Mathematics: Contents and General Index 1991 WILEY Coffman & Lueker, Probabilistic Analysis of Packing and Partitioning Algorithms 1991 WILEY Alavi & Chartrand & Oellermann & Schwenk (Eds.), Graph Theory, Combinatorics, and Applications, 2 volumes, proceedings of the Sixth Quadrennial International Conference on the Theory and Applications of Graphs 1991 WILEY Cohen, Introduction to Computer Theory, Revised Printing 1991 WILEY Niven & Zuckerman & Montgomery, An Introduction to the Theory of Numbers, Fifth Edition 1990 WILEY Falconer, Fractal Geometry: Mathematical Foundations and Applications 1990 WILEY Martello & Toth, Knapsack Problems: Algorithms and Computer Implementations 1990 WILEY Berlioux & Bizard, Algorithms 2: Data Structures and Search Algorithms 1990 WILEY Guddat & Vazquez & Jongen, Parametric Optimization: Singularities, Pathfollowing and Jumps 1990 WILEY Raynal & Helary, Synchronization and Control of Distributed Systems and Programs 1990 WILEY Adamek & Herrlich & Strecker, Abstract and Concrete Categories: The Joy of Cats 1990 WILEY Falconer, Fractal Geometry: Mathematical Foundations and Applications 1990 WILEY Roitman, Introduction to Modern Set Theory 1989 WILEY Arbib, The Metaphorical Brain 2: Neural Networks and Beyond 1989 WILEY Akritas, Elements of Computer Algebra with Applications 1989 WILEY Pless, Introduction to the Theory of Error-Correcting Codes, Second Edition 1988 WILEY Jones, Data Structures Using Modula-2 1988 WILEY Aarts & Korst, Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing 1988 WILEY Mortimer & Craig, The Logic of Induction 1988 WILEY Tichy & Fourdrinier, Effective Writing, For Engineers, Managers, Scientists, Second Edition 1988 WILEY Johnson & Brown, Cognizers: Neural Networks and Machines That Think 1988 WILEY Albertson & Hutchinson, Discrete Mathematics with Algorithms 1988 WILEY Paull, Algorithm Design: A Recursion Transformation Framework 1987 WILEY Ammeraal, Programs and Data Structures in C 1987 WILEY Cohen, Computability and Logic 1987 WILEY Stoyanov, Counterexamples in Probability 1987 WILEY Held & Marshall, Data Compression: Techniques and Applications; Hardware and Software Considerations (Second Edition) 1987 WILEY Slade, The T Programming Language: A Dialect of LISP 1987 WILEY Wegener, The Complexity of Boolean Functions 1987 WILEY Jones, Modula-2: Problem Solving & Programming with Style 1987 WILEY Pinson & Sincovec & Wiener, A First Course in Computer Science with M 1987 WILEY McCracken & Salmon, A Second Course in Computer Science with Modula-2 1987 WILEY Anderson & Nash, Linear Programming in Infinite-Dimensional Spaces: Theory and Applications 1987 WILEY Gross & Tucker, Topological Graph Theory 1987 WILEY Mandrioli & Ghezzi, Theoretical Foundations of Computer Science 1987 WILEY Constantine, Combinatorial Theory and Statistical Design 1987 WILEY Borwein & Borwein, Pi and the AGM: A Study in Analytic 1986 WILEY Billingsley, Probability and Measure, Second Edition 1986 WILEY Minoux, Mathematical Programming: Theory and Algorithms 1986 WILEY Hall, Combinatorial Theory, second edition 1986 WILEY Hall, Combinatorial Theory, 2d ed. 1986 WILEY Sincovec & Wiener, Data Structures Using Modula-2 1986 WILEY Schrijver, Theory of Linear and Integer Programming 1985 WILEY Lawler & Lenstra & Kan & Shmoys (Eds.), The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (authors Hoffman, Wolfe, Garfinkel, Johnson, Papadimitriou, Gilmore, Lawler, Schmoys, Johnson, Papadimitriou, Karp, Steele, Golden, Stewart, Grotschel, Padberg, Padberg, Grotschel, Balas, Toth, Chvatal, Christofides) 1985 WILEY Tomescu, Problems in Combinatorics and Graph Theory 1985 WILEY Palmer, Graphical Evolution: An Introduction to the Theory of Random Graphs 1984 WILEY Renyi, A Diary on Information Theory 1984 WILEY Gondran & Minoux, Graphs and Algorithms 1983 WILEY Shapiro, Introduction to the Theory of Numbers 1983 WILEY Bonomi & Lutton, The N-City Travilling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm 1983 WILEY Newman, In a Random Walk the Number of ``Unique Experiences'' is Two on the Average 1982 WILEY Solow, How To Read and Do Proofs 1982 WILEY Ghezzi, Programming Language Concepts 1979 WILEY Kronsjo, Algorithms: Their Complexity and Efficiency 1968 WILEY Feller, An Introduction to Probability Theory and Its Applications, 3d ed., 2 vol. 1962 WILEY Hoffmann (Ed.), Digital Information Processors: Selected Articles on Problems of Information Processing 1962 WILEY Svoboda, Computer Progress in Czechoslovakia II. The Numerical System of Residual Classes (SRC) (in Hoffmann) 1986 WILF Wilf, Algorithms and Complexity 1996 WIRED Levy, Clipper Chick (September) 1995 WITS Cover, Information Theory and Statistics 1995 WITS Ziv & Hershkovits, Bounds on Universal Coding: The Next Generation 1995 WITS Shields, When is the Weak Rate Equal to the Strong Rate? 1995 WITS Lipton, Coding for Noisy Feasible Channels 1995 WITS Schulman, Coding for Distributed Computation 1995 WITS Steinberg & Verdu, Finite Precision Intrinsic Randomness and Source Resolvability 1995 WITS Zhang & Ahlswede & Yang, Identification via Compressed Data 1995 WITS Burnashev & Verdu, Testing of Composite Hypotheses and ID-Codes 1995 WITS Vetterli, Signal Expansions for Compression 1986 WOLFRAM Wolfram, Theory and Applications of Cellular Automata 1989 WOPPLOT Gernert, Cellular Automata and the Concept of Space 1989 WOPPLOT Knecht, Implementation of Divide-and-Conquer Algorithms on Multiprocessors 1989 WOPPLOT Vollmar, Some Remarks on Synchronization Problems 1989 WOPPLOT Pensini & Mauri & Gardin, Flowshop and Travelling Salesman Problem 1989 WOPPLOT Dalenoort, Self-Organization of Informational Systems 1989 WOPPLOT Mundemann, Self-Organization in Computational Systems 1989 WOPPLOT Schuster, Optimization and Complexity in Molecular Biology and Physics 1989 WOPPLOT Schwefel, Understanding Evolution as a Collective Strategy for Groping in the Dark 1989 WOPPLOT Muhlenbein, Parallel Genetic Algorithms, Population Genetics, and Combinatorial Optimization 1989 WOPPLOT Allen & Lesser, Evolution: Travelling in an Imaginary Landscape 1989 WOPPLOT Hesser & Manner & Stucky, On Steiner Trees and Genetic Algorithms 1987 WOPPLOT Forshaw, Pattern Storage and Associative Memory in Quasi-Neural Networks 1987 WOPPLOT Caianiello & Marinaro, Neural Nets and Cellular Automata 1987 WOPPLOT Bertoni & Goldwurm & Mauri & Sabadini, Parallel Algorithms and the Classification of Problems 1983 WORDS Perrin, Words 1983 WORDS Berstel & Reutenauer, Square-Free Words and Idempotent Semigroups 1983 WORDS Pin, Van der Waerden's Theorem 1983 WORDS Pirillo, Repetitive Mappings and Morphisms 1983 WORDS Perrin, Factorizations of Free Monoids 1983 WORDS Sakarovitch and Simon, Subwords 1983 WORDS Reutenauer, Unavoidable Regularities in Words and Algebras with Polynomial Identities 1983 WORDS Schutzenberger, The Critical Factorization Theorem 1983 WORDS Choffrut, Equations in Words 1983 WORDS Foata, Rearrangements of Words 1983 WORDS Cori, Words and Trees 1996 WORLDSC Petrosjan & Zenkevich, Game Theory 1996 WORLDSC Voorhees, Computational Analysis of One-Dimensional Cellular Automata 1995 WORLDSC Bouchon-Meunier & Yager & Zadeh (Eds.), Fuzzy Logic and Soft Computing 1994 WORLDSC Zhu, Solving Partial Differential Equations on Parallel Computers 1994 WORLDSC Zhang & Debenham & Lukose (Eds.), Artificial Intelligence: Sowing the Seeds for the Future, AI'94, Proceedings of the 7th Australian Joint Conference on Artificial Intelligence 1994 WORLDSC Stephen, String Searching Algorithms 1993 WORLDSC Pardalos (Ed.), Complexity in Numerical Optimization 1992 WORLDSC Du & Hwang (Eds.), Computing in Euclidean Geometry 1991 WORLDSC Clark & Holton, A First Look at Graph Theory 1991 WORLDSC Pinsky, Lectures on Random Evolution 1991 WORLDSC Rassias, Counter Examples in Differential Equations and Related Topics 1991 25 WORLDSC Vamos, Computer Epistemology: A Treatise on the Feasibility of the Unfeasible, or Old Ideas Brewed New 1990 2 WPDP Krapp & Jossifov, Formal Specification of a Distributed Router for nD Hypercube 1990 2 WPDP Cosnard & Fraigniaud, On the Analysis of Polynomials Roots -- Finding Parallel Algorithms 1990 2 WPDP Velichkov, A Parallel Tesselation Based on Transputers 1990 2 WPDP Aleksandrov & Andonov, A Systolic Linear Array for the Knapsack Problem 1992 9 WSADT Goguen & Diaconescu, Towards an Algebraic Semantics for the Object Paradigm 1992 9 WSADT Jouannaud, Rewriting Techniques for Software Engineering 1992 9 WSADT Poigne, Identity and Existence, and Types in Algebra -- A Survey of Sorts 1992 9 WSADT Wagner, Overloading and Inheritance 1994 WWW Fraenkel, Selected Bibliography on Combinatorial Games and Some Related Material (http://ejc.math.gatech.edu:8080/Journal/Surveys/index.html) 1990 6 YOUNGCS Culik & Dube, Methods for Generating Deterministic Fractals and Image Compression 1990 6 YOUNGCS Cong & Miller & Sudborough, Optimum Simulation of Meshes by Small Hypercubes 1990 6 YOUNGCS Kodratoff, Seven Hard Problems in Symbolic Background Knowledge Acquisition 1990 6 YOUNGCS Reutenauer, Subsequential Functions: Characterizations, Minimization, Examples 1990 6 YOUNGCS Sain, Past Proves More Invariance Properties But Not PCA's 1990 6 YOUNGCS Wiedermann, Complexity Issues in Discrete Neurocomputing 1990 6 YOUNGCS Anselmo, Two-Way Reading on Words 1990 6 YOUNGCS Coquide & Gilleron, Proofs and Reachability Problem for Ground Rewrite Systems 1990 6 YOUNGCS Damm, Problems Complete for +L 1990 6 YOUNGCS Franova, Constructive Matching - Explanation Based Methodology for Inductive Theorem Proving 1990 6 YOUNGCS Goerdt & Seidl, Characterizing Complexity Classes by Higher Type Primitive Recursive Definitions, Part II 1990 6 YOUNGCS Gomm & Walter, The Distributed Termination Problem: Formal Solution and Correctness Based on Petri Nets 1990 6 YOUNGCS Loebl, Greedy Compression Systems 1990 6 YOUNGCS Mnuk, A div(n) Depth Boolean Circuit for Smooth Modular Inverse 1990 6 YOUNGCS Moller, Learning by Conjugate Gradients 1990 6 YOUNGCS Pelletier, Monoids Described by Pushdown Automata 1990 6 YOUNGCS Rajcani, Optimal Parallel 3-Colouring Algorithm for Rooted Trees and its Application 1990 6 YOUNGCS Reinhardt, Hierarchies over the Context-Free Languages 1990 6 YOUNGCS Santean, A Hierarchy of Unary Primitive Recursive String-Functions 1990 6 YOUNGCS Seebold & Slowinski, Minimizing Picture Words 1990 6 YOUNGCS Skodny, Remarks on the Frequency-Coded Neural Nets Complexity 1990 6 YOUNGCS Stiebe, Picture Generation Using Matrix Systems 1990 6 YOUNGCS Suttner, Representing Heuristic-Relevant Information for an Automated Theorem Prover 1990 6 YOUNGCS Unger, A New Method for Proving Lower Bounds in the Model of Algebraic Decision Trees 1990 6 YOUNGCS Waczulik, Area Time Squared and Area Complexity of VLSI Computations is Strongly Unclosed Under Union and Intersection 1990 6 YOUNGCS Walukiewicz, Decision Procedure for Checking Validity of PAL Formulas 1989 5 YOUNGCS Hinz, Questions of Decidability for Context-Free Chain Code Picture Languages 1989 5 YOUNGCS Jiraskova, Chomsky Hierarchy and Communication Complexity 1989 5 YOUNGCS Lange, Complexity Theory and Formal Languages 1989 5 YOUNGCS Latteux, Rational Cones and Communications 1989 5 YOUNGCS Reichel, A Remark on Some Classifications of Indian Parallel Languages 1989 5 YOUNGCS Esik, An Extension of the Krohn-Rhodes Decomposition of Automata 1989 5 YOUNGCS Inoue & Takanami, A Survey of Two-Dimensional Automata Theory 1989 5 YOUNGCS Ito & Inoue & Takanami, The Simulation of Two-Dimensional One_marker Automata by Three-Way Turing Machines 1989 5 YOUNGCS Slobodova, Some Properties of Space-Bounded Synchronized Alternating Turing Machines with Only Universal States 1989 5 YOUNGCS Cortolezzis, The Virtual Floating Gride File 1989 5 YOUNGCS Gaibisso, A Partially Persistent Data Structure for the Set-Union Problem with Backtracking 1989 5 YOUNGCS Krivanek, A Note on the Computational Complexity of Bracketing and Related Problems 1989 5 YOUNGCS Loebl & Nesetril, Postorder Hierarchy for Path Compressions and Set Union 1989 5 YOUNGCS Unger, The Convex Hull Problem on Grides -- Computational and Combinatorial Aspects 1989 5 YOUNGCS Wood, The Riches of Rectangles 1989 5 YOUNGCS van Harmelen, The Limitations of Partial Evaluation 1989 5 YOUNGCS Jantke, Algorithmic Learning from Incomplete Information -- Principles and Problems 1989 5 YOUNGCS Kari, A Cryptosystem Based on Propositional Logic 1989 5 YOUNGCS Salomaa, Cryptography and Data Security (Tutorial) 1986 4 YOUNGCS Hromkovic, Lower Bound Techniques for VLSI Algorithms 1986 4 YOUNGCS Karhumaki, The Equivalence of Mappings on Languages 1986 4 YOUNGCS Sakarovitch, Kleene's Theorem Revisited 1986 4 YOUNGCS Tuza, Some Combinatorial Problems Concerning Finite Languages 1986 4 YOUNGCS Csuhaj-Varju, A Connection between Descriptional Complexity of Context-free Grammars and Grammar Form Theory 1986 4 YOUNGCS Kleijn, Basic Ideas of Selective Substitution Grammars 1986 4 YOUNGCS Paun, Some Recent Restrictions in the Derivation of Context-free Grammars 1986 4 YOUNGCS Aladyev, Recent Results on the Theory of Homogeneous Structures 1986 4 YOUNGCS Kralova, A Note on the Ratio Function in D0L Systems 1986 4 YOUNGCS Lindenmayer, Models for Multicellular Development: Characterization, Inference and Complexity of L-systems 1986 4 YOUNGCS Kalas, A Formal Model of Knowledge-based Systems 1986 4 YOUNGCS Springsteel, Basic Complexity Analysis of 1986 4 YOUNGCS Szeredi, Perspectives of Logic Programming 1993 YOURDON Yourdon, Decline & Fall of the American Programmer 1996 43 YOVITS Gasarch, The Complexity of Problems 1994 39 YOVITS Lo, Operating Systems Enhancements for Distributed Shared Memory 1994 38 YOVITS Pernul, Database Security 1993 37 YOVITS Rich & Waters, Approaches to Automatic Programming 1993 37 YOVITS Nievergelt, Experiments in Computational Heuristics and Their Lessons for Software and Knowledge Engineering 1993 37 YOVITS Lee & Hurson, Issues in Dataflow Computing 1993 37 YOVITS Olazaran, A Sociological History of the Neural Network Controversy 1992 34 YOVITS Duncan, Parallel Computer Architectures 1992 34 YOVITS Chisvin & Duckworth, Content-Addressable and Associative Memory 1991 33 YOVITS Weide & Ogden & Zweben, Reusable Software Components 1991 33 YOVITS Gulati & Barhen & Iyengar, Neurocomputing Formalisms for Computational Learning and Machine Intelligence 1990 30 YOVITS Davida & Desmedt, Cryptography Based Data Security 1988 27 YOVITS Iyengar & Kashyap & Vaishnavi & Rao, Multidimensional Data Structures: Review and Outlook 1988 27 YOVITS Hevner & Rao, Distributed Data Allocation Strategies 1988 27 YOVITS Rosenfeld, Computer Vision 1987 26 YOVITS Poppelbaum & Dollas & Glickman & O'Toole, Unary Processing 1987 26 YOVITS Moitra & Iyengar, Parallel Algorithms for Some Computational Problems 1987 26 YOVITS Kothari, Multistage Interconnection Networks for Multiprocessor Systems 1987 26 YOVITS Toy, Fault-Tolerant Computing 1976 14 YOVITS Graham & Harrison, Parsing of General Context-Free Languages 1976 14 YOVITS Hartmanis & Simon, On the Structure of Feasible Computations 1983 YUP Williamson, Methods of Book Design (3rd edition) 1994 ZDPRESS Aronson, HTML Manual of Style 1994 ZDPRESS Browne, The Internet via Mosaic and World-Wide Web 1982 37a ZEITNATUR Farmer, Information Dimension and the Probabilistic Structure of Chaos 1997 43 ZEITSCHR Stewart, Regular Subgraphs in Graphs and Rooted Graphs and Definability in Monadic Second-Order Logic 1997 43 ZEITSCHR Mazzanti, Iterative Characterizations of Computable Unary Functions: A General Method 1997 43 ZEITSCHR Yamaguchi, Effective Nonrecursiveness 1997 43 ZEITSCHR Gakwaya, Characterization of the Relations in Grzegorczyk's Hierarchy Revisited 1996 42 ZEITSCHR Maguolo & Valentini, An Intuitionistic Version of Cantor's Theorem 1996 42 ZEITSCHR Tourlakis, Recursion in Partial Type-1 Objects With Well-Behaved Oracles 1996 42 ZEITSCHR Valentini, Decidability in Intuitionistic Type Theory is Functionally Decidable 1996 42 ZEITSCHR Bonanno, On the Logic of Common Belief 1996 42 ZEITSCHR Petersen, The Computation of Partial Recursive Word-Functions Without Read Instructions 1996 42 ZEITSCHR Kanovei & Reeken, Loeb Measure from the Point of View of a Coin Flipping Game 1996 42 ZEITSCHR Omodeo & Parlamento & Policriti, Decidability of Exists*Forall-Sentences in Membership Theories 1996 42 ZEITSCHR Labhalla & Lombardi, Analyse de Complexite pour un Theoreme de Hall sur les Fractions Continues 1995 41 ZEITSCHR Bulitko, On Some Complexity Characteristics of Immune Sets 1995 41 ZEITSCHR Palmgren, The Friedman-Translation for Martin-Lof's Type Theory 1995 41 ZEITSCHR Cenzer & Remmel, Feasible Graphs and Colorings 1995 41 ZEITSCHR Pambuccian, Ternary Operations as Primitive Notions for Constructive Plane Geometry VI 1995 41 ZEITSCHR Baratella & Ferro, Non Standard Regular Finite Set Theory 1995 41 ZEITSCHR Burris, Polynomial Time Uniform Word Problems 1995 41 ZEITSCHR Schuchardt & Hecker, Two NP-Hard Art-Gallery Problems for Ortho-Polygons 1995 41 ZEITSCHR Meer, On the Relations Between Discrete and Continuous Complexity Theory 1994 40 ZEITSCHR Nies, Recursively Enumerable Equivalence Relations Modulo Finite Differences 1994 40 ZEITSCHR Kikuchi, A Note on Boolos' Proof of the Incompleteness Theorem 1994 40 ZEITSCHR Korner, Cofinal Indiscernibles and some Applications to New Foundations 1994 40 ZEITSCHR Ash, A Conjecture Concerning the Spectrum of a Sentence 1994 40 ZEITSCHR Deutsch, A Note on the Theorems of Church-Turing and Trachtenbrot 1994 40 ZEITSCHR Kummer & Stephan, Effective Search Problems 1994 40 ZEITSCHR Fontani & Montagna & Sorbi, A Note on Relative Efficiency of Axiom Systems 1994 40 ZEITSCHR Sui, A New Reducibility between Turing- and wtt-Reducibility 1994 40 ZEITSCHR Stewart, Monotonicity and the Expressibility of NP Operators 1993 39 ZEITSCHR Solomon, Measure Independent Godel Speed-Ups and the Relative Difficulty of Recognizing Sets 1993 39 ZEITSCHR Pambuccian, Ternary Operations as Primitive Notions for Constructive Plane Geometry III 1992 38 ZEITSCHR Koszmider, A Formalism for Some Class of Forcing Notions 1992 38 ZEITSCHR Habart, Bounds in the Turing Reducibility of Functions 1992 38 ZEITSCHR Brunner & Howard, Russell's Alternative to the Axiom of Choice 1992 38 ZEITSCHR Schechter, Two Topological Equivalents of the Axiom of Choice 1992 38 ZEITSCHR Tanaka, A Game-Theoretic Proof of Analytic Ramsey Theorem 1992 38 ZEITSCHR Kontostathis, Topological Framework for Finite Injury 1992 38 ZEITSCHR Preller, An Interpretation of Martin-Lof's Theory of Types in Elementary Topos Theory 1992 38 ZEITSCHR McColm, Some Ramsey Theory in Boolean Algebra for Complexity Classes 1992 38 ZEITSCHR Bull, Cut Elimination for Propositional Dynamic Logic Without * 1992 38 ZEITSCHR Calude & Istrate & Zimand, Recursive Baire Classification and Speedable Functions 1991 37 ZEITSCHR Case, Effectivizing Inseparability 1991 37 ZEITSCHR Levitz & Nichols & Smith, A Macro Program for the Primitive Recursive Functions 1991 37 ZEITSCHR Banaschewski, Fixpoints without the Natural Numbers 1991 37 ZEITSCHR de Queiroz & Maibaum, Abstract Data Types and Type Theory: Theories as Types 1991 37 ZEITSCHR Keremedis, A Note on Shoenfield's Unramified Forcing 1991 37 ZEITSCHR Oberschelp, On Pairs and Tuples 1991 37 ZEITSCHR Luckhardt, Complexity versus the Church-Rosser Property and Confluence 1990 36 ZEITSCHR Clivio, Algorithmic Aspects of Z[x_1,...,x_n] with Application to Tiling Problems 1990 36 ZEITSCHR de Queiroz & Maibaum, Proof Theory and Computer Programming 1990 36 ZEITSCHR Negri, Fixed Points and Diagonal Method 1990 36 ZEITSCHR Solomon, Relativized Goedel Speed-Up and the Degree of Succinctness of Representations 1989 35 ZEITSCHR Orlowska, Logic for Reasoning about Knowledge 1989 35 ZEITSCHR Zhixiang, On Splitting of a Recursive Set with Polynomial Time Minimal Pairs 1989 35 ZEITSCHR Krom & Krom, Recursive Solvability of Problems with Matrices 1989 35 ZEITSCHR Stark, A Logic for Distributed Processes 1989 35 ZEITSCHR Castro & Cucker, Nondeterministic omega-Computations and the Analytical Hierarchy 1989 35 ZEITSCHR Felscher, A Linear Parsing Algorithm for Parenthesis Terms 1989 35 ZEITSCHR de Jongh & Montagna, Much Shorter Proofs 1989 35 ZEITSCHR Leitsch, On Different Concepts of Resolution 1988 34 ZEITSCHR Freivalds & Kinber & Wiehagen, Probabilistic versus Deterministic Inductive Inference in Nonstandard Numberings 1988 34 ZEITSCHR Levitz, A Natural Variant of Ackermann's Function 1987 33 ZEITSCHR Babai & Turan, The Complexity of Defining a Relation on a Finite Graph 1986 32 ZEITSCHR Schnorr, A Goedel Theorem on Network Complexity Lower Bounds 1986 32 ZEITSCHR Hemmerling, 1-Pointer Automata Searching Finite Plane Graphs 1986 32 ZEITSCHR Lischke, Oracle-Constructions to Prove All Possible Relationships between Relativizations of P, NP, EL, NEL, EP and NEP 1976 22 ZEITSCHR Jockusch & Paterson, Completely Autoreducible Degrees 1975 21 ZEITSCHR Schnorr & Stumpf, A Characterization of Complexity Sequences 1972 18 ZEITSCHR Meyer & Ritchie, A Classification of the Recursive Functions 1971 17 ZEITSCHR Siefkes, Undecidable Extensions of Monadic Second Order Successor Arithmetic 1971 17 ZEITSCHR Dinh Dieu, On a Class of Stochastic Languages 1971 17 ZEITSCHR Dinh Dieu, On the Languages Representable by Finite Probabilistic Automata 1971 17 ZEITSCHR Herman, The Equivalence of Different Hierarchies of Elementary Functions 1966 12 ZEITSCHR Starke, Stochastische Ereignisse und Wortmengen 1980 ZUERICH Paul & Simon, Decision Trees and Random Access Machines 1988 AWOC Atallah & Goodrich & Kosaraju, On the Parallel Complexity of Evaluating Some Sequences for Set Manipulation Operation 1988 AWOC Chrobak & Yung, Fast Parallel and Sequential Algorithms for Edge Coloring Planar Graphs 1988 AWOC Hagerup, Optimal Parallel Algorithms on Planar Graphs 1988 AWOC Ramachandran & Vishkin, Efficient Parallel Triconnectivity in Logarithmic Time 1988 AWOC Gibbons & Karp & Soroker & Miller, Subtree Isomorphism is in Random NC 1988 AWOC Kao, Deterministic NC Depth First Search for Planar Digraphs 1988 AWOC Ibarra & Jiang & Ravikumar & Chang, On Some Languages in NC 1988 AWOC Litow, O(log (n)) Parallel Time Finite Field Inversion 1988 AWOC Anderson & Miller, Deterministic Parallel List Ranking 1988 AWOC Cole & Vishkin, Optimal Parallel Algorithms for Expression Tree Evaluation and List Ranking 1988 AWOC Kosaraju & Delcher, Optimal Parallel Evaluation of Tree Structured Computations by Ranking 1988 AWOC Schieber & Vishkin, On Finding Lowest Common Ancestors: Simplification and Parallelization 1988 AWOC Anderson & Munshi & Simons, Scheduling Sequential Loops on Parallel Processors 1988 AWOC Papadimitriou & Afrati & Papageorgiou, Scheduling DAGs To Minimize Time and Communication 1988 AWOC Naor, Computing a Perfect Matching in a Line Graph 1988 AWOC Fussell & Thurimella, Seperation Pair Detection 1988 AWOC Monien & Sudborough, Simulating Trees on Cubes and Cube Connected Cycles 1988 AWOC Ellis, Embedding Rectangular Grids into Square Grids 1988 AWOC Codenotti & Tamassia, Efficient Reconfiguration of VLSI Arrays 1988 AWOC Bettayeb & Sudborough & Miller, Embedding Grids into Hypercubes 1988 AWOC Mehlorn & Rulling, Compaction on the Torus 1988 AWOC Kaufmann & Tollis, Channel Routing with Short Wires 1988 AWOC Gonzales & Zheng, Simple Three Layer Channel Routing Algorithms 1988 AWOC Lodi & Luccio & Pagli, A 4D Channel Router for a Two Layer Diagonal Model 1988 AWOC Finkelstein & Kleitman & Leighton, Applying the Classification Theorem for Finite Simple Groups to Minimize Pin Count in Uniform Permutation Architectures 1988 AWOC Tollis, A New Algorithm for Wiring Layouts 1988 AWOC Sherlekar & Ja'ja', Input Sensitive VLSI Layouts for Graphs of Arbitrary Degree 1988 AWOC Fellows & Langston, Fast Self-reduction Algorithms for Combinatorial Problems of VLSI Design 1988 AWOC Becker & Sparmann, Regular Structures and Testing: RCC-Adders 1988 AWOC Bose, Parallel Simulation and Test of VLSI Array Logic 1988 AWOC Furer, Universal Hashing in VLSI 1988 AWOC Yaacoby & Cappello, Converting Affine Recurrence Equations to Quasi-Uniform Recurrence Equations 1988 AWOC Attiya & Snir, Bounds for the Average Message Complexity of Distributed Algorithms 1988 AWOC Aggarwal & Huang, Network Complexity of Sorting and Graph Problems and Simulation CRCW PRAMS by Interconnection Networks 1988 AWOC Malka & Moran & Zaks, A Simple Distributed Scheduler--Analysis and Applications 1988 AWOC Kranakis & Vitanyi, Weighted Distributed Match-making 1988 AWOC Awerbuch & Goldreich & Vainish & Peleg, Trade-off between Information and Communication in Broadcast Protocols 1988 AWOC Bar-Noy & Dolev, Families of Consensus Algorithms 1988 AWOC Burns & Pachl, Uniform Self Stabilizing Rings 1988 AWOC Martel & Vadya, The Complexity of Selection Resolution Conflict Resolution and Maximum Finding on Multiple Access Channels 1988 AWOC Rajasekaran & Tsantilas & Krizanc, Optimal Routing Algorithms for Mesh Connected Processor Arrays 1988 AWOC Kunde, Routing and Sorting on Mesh Connected Arrays 1988 AWOC Han & Igarashi, Time Lower Bounds for Parallel Sorting on a Mesh Connected Processor Array 1988 AWOC Schimmler & Starke, A Correction Network for N-Sorters 1988 AWOC Cypher & Sanz, A New Sorting Algorithm for Distributed Memory Parallel Computers 1992 8 BCTCS Savage, VLSI Analysis, Synthesis and Theory 1992 8 BCTCS Fairtlough, Formal Design of Synchronous Concurrent Algorithms 1992 8 BCTCS Igarashi, Periodic Schemes for Disseminating Information in Processor Networks 1992 8 BCTCS Duan, An Interpreter for a Subset of FITL with Concurrent Operators 1992 8 BCTCS Scholefield & Zedan, Refinement of Real-time Systems in TAM 1992 8 BCTCS Maibaum, Design Structures: Configuring Specifications 1992 8 BCTCS Gurevich, Evolving Algebras 1992 8 BCTCS Anderson & de Lemos & Saeed, Formality in the Analysis of Timeliness Requirements 1992 8 BCTCS Preston, Graphical Methods for Information Commodity Assessment 1992 8 BCTCS Rossiter & Heather, Database Theory: Sets versus Categories 1992 8 BCTCS Holt, Visualizing Mathematical Structures 1992 8 BCTCS Tucker, Algebraic Specifications and Computable Functions 1992 8 BCTCS Sun, Axiomatization of Calculus of Constructions with Infinite Type Hierarchy 1992 8 BCTCS Measor, Consistent Closed Sets and Logical Inference 1992 8 BCTCS Matthews, Partial Metrics 1992 8 BCTCS Balcazar, The Structural Approach to Complexity Theory 1992 8 BCTCS Jerrum, Simple Translation-invariant Concepts are Hard to Learn 1992 8 BCTCS Goldberg, Listing First Order Graph Properties 1992 8 BCTCS Gay, Confluent CCS and Interaction Nets 1992 8 BCTCS Ho-Stuart & Fang & Zedan, PARTY: A Realistic Real-time Process Algebra 1992 8 BCTCS Hodges, The Logical Background to Specification 1992 8 BCTCS Gibbons, Implementing P-RAM Algorithms on Feasible Distributed Memory Models of Parallel Computation 1992 8 BCTCS Paterson & Zwick, Fast Multipliers and Wise Investments 1992 8 BCTCS Dunne & Gittings & Leng, Analysis of Speed-up Ratios in Demand Driven Multiprocessor Simulation Algorithms 1992 8 BCTCS Baude, PRAM Implementation on Fine-grained MIMD Multicomputers 1992 8 BCTCS Pellegrini, New Results on Lines in 3-space 1992 8 BCTCS Thomas & Herbst, One-Counter Groups 1992 8 BCTCS Banach, Universal Properties of Term Graph Rewriting 1992 8 BCTCS Sorkin, Simulated Annealing on Fractal Energy Landscapes 1992 8 BCTCS Gault, From Dijkstra's Fusc to Lucas Fractions 1992 8 BCTCS Stirling, Verification via Model Checking 1992 8 BCTCS Kono, Automatic Verification of Interval Temporal Logic 1992 8 BCTCS Pinchinat & Schnoebelen, Modal Logics with Past for True Concurrency 1992 8 BCTCS Park, Fast String Matching on the Average 1992 8 BCTCS Czumaj, Speeding up Two String Matching Algorithms 1992 8 BCTCS Kamareddine & Nederpelt, On Stepwise Explicit Substitution 1992 8 BCTCS Yakovlev, Modelling Concurrent Processes in Logical Circuits 1992 8 BCTCS Stonebridge, Match-free Permuations of Multistrings: An Algorithmic Analysis of Derangements 1992 8 BCTCS Dasgupta & McGregor, A Structured Genetic Algorithm 1991 1 CGTA Atallah & Chen, Parallel Rectilinear Shortest Paths with Rectangular Obstacles 1991 1 CGTA Avis & Erdos & Pach, Distinct Distances Determined by Subsets of a Point Set in Space 1991 1 CGTA de Berg, On Rectilinear Link Distance 1991 1 CGTA Overmars & Sharir, Merging Visibility Maps 1991 1 CGTA Seidel, A Simple and Fast Incremental Randomized Algorithm for Computing Trapezoidal Decompositions and for Triangulating Polygons 1991 1 CGTA Shermer, Computing Bushy and Thin Triangulations 1993 DCC Oehler & Gray, Combining Image Classification and Image Compression Using Vector Quantization 1993 DCC Miller & Rose, An Improved Sequential Search Multistage Vector Quantizer 1993 DCC Wu, Globally Optimal Bit Allocation 1993 DCC Constantinescu & Storer, On-Line Adaptive Vector Quantization with Variable Size Codebook Entries 1993 DCC Chang & Gersho & Soong, Joint Codebook Design for Summation Product-Code Vector Quantizers 1993 DCC Abrahams, Codes with Monotonic Codeword Lengths 1993 DCC Natarajan, Filtering Random Noise via Data Compression 1993 DCC Bookstein & Rao & Patil, Can Random Fluctuation Be Exploited in Data Compression 1993 DCC Freeman, Divergence and the Contruction of Variable-to-Variable-Length Lossless Codes by Source-Word Extensions 1993 DCC Linder & Lugose & Zeger, Universality and Rates of Convergence in Lossy Source Coding 1993 DCC Howard & Vitter, Design and Analysis of Fast Text Compression Based on Quasi-Arithmetic Coding 1993 DCC Moffat & Sharman & Witten & Bell, An Empirical Evaluation of Coding Techniques for Multi-Symbol Alphabets 1993 DCC Feygin & Gulak & Chow, Minimizing Error and VLSI Complexity in the Multiplication-Free Approximation of Arithmetic Coding 1993 DCC Printz & Stubley, Multialphabet Arithmetic Coding at 16 MBytes/sec 1993 DCC Fenwick, Ziv-Lempel Encoding with Multi-Bit Flags 1993 DCC Sadeh, On Approximate String Matching 1993 DCC Connor, Coding Theory and Regularization 1993 DCC Bhaskaran & Natarajan & Konstantinides, Optimal Piecewise-Linear Compression of Images 1993 DCC Watson, Visually Optimal DCT Quantization Matrices for Individual Images 1993 DCC Monro & Sherlock, Optimum DCT Quantization 1993 DCC Villasenor, Full-Frame Compression of Tomographic Images Using the Discrete Fourier Transform 1993 DCC Rios & Kabuka, A High Performance Adaptive Image Compression System Using a Generative Neural Network: Dynamic Neural Network II 1993 DCC Shapiro, An Embedded Hierarchical Image Coder using Zerotrees of Wavelet Coefficients 1993 DCC Bradley & Brislawn, Wavelet Transform-Vector Quantization Compression of Supercomputer Ocean Model Simulation Output 1993 DCC Culik & Dube & Rajcani, Efficient Compression of Wavelet Coefficients for Smooth and Fractal-like Data 1993 DCC Raittinen & Kaski, Fractal Based Image Compression with Affine Transformations 1993 DCC Monro & Dudbridge, Generalized Fractal Transforms: Complexity Issues 1993 2 GDRAWING Bergey, Automorphisms and Genus on Generalised Maps 1993 2 GDRAWING Bose & Lenhart & Liotta, Characterizing Proximity Trees 1993 2 GDRAWING Bose & Everett & Fekete & Lubiw & Meijer & Romanik & Shermer & Whitesides, On a Visibility Representation for Graphs in Three Dimensions 1993 2 GDRAWING Brandenburg & Eades, A Note on free Drawings of Binary Trees on a Square 1993 2 GDRAWING Bousset, A Flow Model of Low Complexity for Twisting a Layout 1993 2 GDRAWING Chen & Kanchi & Gross, On Graph Drawings with Smallest Number of Faces 1993 2 GDRAWING Coleman & Parker, Aesthetics-based Graph Layout for Human Consumption 1993 2 GDRAWING Dehne & Djidjev & Sack, An Optimal PRAM Algorithms for Planar Convex Embedding 1993 2 GDRAWING Denise & Penaud, Generation of Random Planar Maps 1993 2 GDRAWING Di Battista & Liotta & Vargiu, Convex and non-Convex Cost Functions of Orthogonal Representations 1993 2 GDRAWING Di Battista & Vismara, Topology and Geometry of Planar Triangular Graphs 1993 2 GDRAWING Eades & Lin, Algorithmic and Declarative Approaches to Aesthetic Layout 1993 2 GDRAWING Eades & Mendonca, Heuristics for Planarization by Vertex Splitting 1993 2 GDRAWING ElGindy & Houle & Lenhart & Miller & Rappaport & Whitesides, Dominance Drawings of Bipartite Graphs 1993 2 GDRAWING Finke & Hinrichs, Computing the Overlay of Regular Planar Subdivisions in Linear Time 1993 2 GDRAWING Fossmeier & Kaufmann, An Approach for Bend-Minimal Upward Drawing 1993 2 GDRAWING Foubister & Runciman, The Display, Browsing and Filtering of Graph-Trees 1993 2 GDRAWING Garg & Tamassia, Efficient Computation of Planar Straight-Line Upward Drawings 1993 2 GDRAWING Himsolt, A View to Graph Drawing Algorithms through Graph^Ed 1993 2 GDRAWING Johansen, Implementation of the Planarity Testing Algorithm by Demoucron et al 1993 2 GDRAWING Jnger & Mutzel, Maximum Planar Subgraphs and Nice Embeddings: Practical Layout Tools 1993 2 GDRAWING Kant, A More Compact Visibility Representation 1993 2 GDRAWING Kant & He, Rectangular Duals and Visibility Representations 1993 2 GDRAWING Kant & Liotta & Tamassia & Tollis, Area Requirement of Visibility Representations of Trees 1993 2 GDRAWING Kratochvil, Complexity of Intersection Classes of Graphs 1993 2 GDRAWING Lubiw, Cone Visibility Graphs 1993 2 GDRAWING Manning, Symmetric Drawings of Graphs 1993 2 GDRAWING McCreary & Combs & Gill & Warren, An Automated Graph Drawing System Using Graph Decomposition 1993 2 GDRAWING Miyauchi, Algorithms for 3-Book Embeddings of Graphs 1993 2 GDRAWING Mohar, Generalizing Kuratowski's Theorem 1993 2 GDRAWING North, Drawing Ranked Digraphs with Recursive Clusters 1993 2 GDRAWING Ozawa, Planar Graph Embedding with Specified Set of Face-Independent Vertices 1993 2 GDRAWING Pach, New Developments in Geometric Graph Theory 1993 2 GDRAWING Pimont, Characterization and Construction of the Rectangular Dual of a Graph 1993 2 GDRAWING Pisanski, Recognizing Symmetric Graphs 1993 2 GDRAWING Przytycka & Przytycki, A Simple Construction of High Representativity Triangulations 1993 2 GDRAWING Regan, Two Algorithms for Drawing Trees in Three Dimensions 1993 2 GDRAWING Rival, Upward Drawing on Surfaces 1993 2 GDRAWING Small, A Unified Approach to Testing, Embedding and Drawing Planar Graphs 1993 2 GDRAWING Stamm-Wilbrandt, A Simple Linear-Time Algorithm for Embedding Maximal Planar Graphs 1993 2 GDRAWING Tollis & Xia, Graph Drawing Algorithms for the Design and Analysis of Telecommunication Networks 1993 2 GDRAWING Tunkelang, A Layout Algorithm for Undirected Graphs 1993 2 GDRAWING Zinssmeister, Layout of Trees with Attribute Graph Grammars 1993 2 GDRAWING Cruz & Tamassia & Van Hentenryck, A Visual Approach to Graph Drawing 1993 2 GDRAWING de Mendez, Connexity of Bipolar Orientations 1993 2 GDRAWING de Fraysseix & Rosenstiehl, The Left-Right Algorithm for Planarity Testing and Embedding 1993 2 GDRAWING Mohar & Rosenstiehl, Visibility on a Torus 1993 2 GDRAWING de Fraysseix & de Mendez & Rosenstiehl, Maximal Planar Graphs are Triangle-Contact Graphs 1993 2 GDRAWING Representations of Planar Graphs, Thomassen 1992 2 IPCO Goemans, Polyhedral Description of Trees and Arborescences 1992 2 IPCO Chopra, The K-Edge Connected Spanning Subgraph Polyhedron 1992 2 IPCO Barahona & Mahjoub, On 2-Connected Subgraph Polytopes 1992 2 IPCO Hochbaum & Naor, Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality 1992 2 IPCO Kanamaru & Nishizeki & Asano, Efficient Enumeration of Grid Points in a Polygon and its Application to Integer Programming 1992 2 IPCO Dyer & Frieze, Random Walks, Totally Unimodular Matrices and Randomised Dual Simplex Algorithm 1992 2 IPCO Frank & Karzanov & Sebo, On Multiflow Problems 1992 2 IPCO Shahrokhi & Szekely, Effective Lower Bounds for Crossing Number, Bisection Width and Balanced Vertex Separator in Terms of Symmetry 1992 2 IPCO Deng & Hell & Huang, Recognition and Representation of Proper Circular Arc Graphs 1992 2 IPCO Hoogeveen & Oosterhout & van de Velde, New Lower and Upper Bounds for Scheduling Around a Small Common Due Date 1992 2 IPCO Lasserre & Queyranne, Generic Scheduling Polyhedra and a New Mixed-Integer Formulation for Single-Machine Scheduling 1992 2 IPCO Pochet & Wolsey, Capacitated Lot-Sizing and Network Design with Divisible Capacities: Analysis of Subproblems, Valid Inequalities and Separation Algorithms 1992 2 IPCO Hansen & Jaumard & Poggi de Aragao, Mixed-Integer Column Generation Algorithms and the Probabilistic Maximum Satisfiability Problem 1992 2 IPCO Martello & Soumis & Toth, An Exact Algorithm for Makespan Minimization on Unrelated Parallel Machines 1992 2 IPCO Nobili & Sassano, A Separation Routine for the Set Covering Polytope 1992 2 IPCO Boros & Crama & Hammer & Saks, A Complexity Index for Satisfiability Problems 1992 2 IPCO Xue & Rosen & Pardalos, A Polynomial Time Dual Algorithm for the Euclidean Multifacility Location Problem 1992 2 IPCO Ageev, A Criterion of Polynomial-Time Solvability for the Network Location Problem 1992 2 IPCO Cunningham & Zhang, Subgraph Degree-Sequence Polyhedra 1992 2 IPCO Fischetti, Three Facet-Lifting Theorems for the Asymmetric Traveling Salesman Polytope 1992 2 IPCO Laurent & Poljak, The Metric Polytope 1992 2 IPCO Helman & Moret & Shapiro, An Exact Characterization of Greedy Structures 1992 2 IPCO Bhattacharya & Georgiadis & Tsoucas, Extended Polymatroids: Properties and Optimization 1992 2 IPCO Barvinok, Optimization Problems on Matroids and Exponential Sums 1992 2 IPCO Erdos & Szekely, Algorithms and Min-max Theorems for Certain Multiway Cuts 1992 2 IPCO Hurkens, Nasty TSP Instances for Farthest Insertion 1992 2 IPCO Sebo, Forcing Colorations and the Perfect Graph Conjecture 1992 2 IPCO Grover, Fast Parallel Algorithms for Bipartite Matching 1992 2 IPCO Alizadeh, Combinatorial Optimization with Semi-Definite Matrices 1992 2 IPCO Karmarkar & Thakur, An Interior Point Approach to Upper Bounds in Integer Quadratic Optimization Problems 1992 2 IPCO Bienstock, A Lot-Sizing Problem on Trees, Related to Network Design 1992 2 IPCO Bertsimas & Orlin, A Technique for Speeding up the Solution of the Lagrangian Dual 1992 2 IPCO Frieze & Karp & Reed, When is the Assignment Bound Tight for the Asymmetric Traveling Salesman Problem? 1990 1 ISAAC Galil, Recent Progress in String Algorithms 1990 1 ISAAC Pippenger, Selection Networks 1990 1 ISAAC Nagamochi & Ibaraki, Computing Edge-Connectivity in Multiple and Capacitated Graphs 1990 1 ISAAC Imai & Iwano, Efficient Sequential and Parallel Algorithms for Planar Minimum Cost Flow 1990 1 ISAAC Watanabe & Toda, Structural Analysis on the Complexity of Inverting Function 1990 1 ISAAC Allender, Oracles versus Proof Techniques That Do Not Relativize 1990 1 ISAAC Chang & Tang & Lee, 20-Relative Neighborhood Graphs Are Hamiltonian 1990 1 ISAAC Su & Chang, The K-Gabriel Graphs and Their Applications 1990 1 ISAAC Djokic & Miyakawa & Sekiguchi & Semba & Stojmenovic, Parallel Algorithms for Generating Subsets and Set Partitions 1990 1 ISAAC Han, Parallel Algorithms for Linked List and Beyond 1990 1 ISAAC Bang-Jensen & Hell & Huang, Local Tournaments and Recognition of Proper Circular Arc Graphs 1990 1 ISAAC Tsai & Hsu, Fast Algorithms for the Dominating Set Problem on Permutation Graphs 1990 1 ISAAC de la Vega & Kannan & Santha, Two Probabilistic Results on Merging 1990 1 ISAAC Feige & Peleg & Raghavan & Upfal, Randomized Broadcast in Networks 1990 1 ISAAC Klein & Mehlhorn & Meiser, On the Construction of Abstract Voronoi Diagrams, II 1990 1 ISAAC Chazelle, Searching in Higher Dimension 1990 1 ISAAC Kirkpatrick & Gao, Finding Extrema with Unary Predicates 1990 1 ISAAC Dobkin & Hershberger & Kirkpatrick & Suri, Implicitly Searching Convolutions and Computing Depth of Collision 1990 1 ISAAC Itoh, Characterization for a Family of Infinitely Many Irreducible Equally Spaced Polynomials 1990 1 ISAAC Cosnard & Philippe, Distributed Algorithms for Deciphering 1990 1 ISAAC Iwano & Yeh, An Efficient Algorithm for Optimal Loop Parallelization 1990 1 ISAAC Pijls & de Bruin, Another View on the SSS* Algorithm 1990 1 ISAAC Hemachandra, Algorithms from Complexity Theory: Polynomial-Time Operations for Complex Sets 1990 1 ISAAC Schoening, Complexity Cores and Hard Problem Instances 1990 1 ISAAC Tan & Hirata & Inagaki, Spatial Point Location and Its Applications 1990 1 ISAAC Carlsson & Levcopoulos & Petersson, Sublinear Merging and Natural Merge Sort 1990 1 ISAAC Guibas & Salesin & Stolfi, Constructing Strongly Convex Approximate Hulls with Inaccurate Primitives 1990 1 ISAAC Murota, Computing Puiseux-Series Solutions to Determinantal Equations via Combinatorial Relaxation 1990 1 ISAAC Freivalds, Complexity of Probabilistic Versus Deterministic Automata 1990 1 ISAAC Klawe & Leighton, A Tight Lower Bound on the Size of Planar Permutation Networks 1990 1 ISAAC Hassin, Simultaneous Solution of Families of Problems 1990 1 ISAAC Asano & Tokuyama, Algorithms for Projecting Points to Give the Most Uniform Distribution with Applications to Hashing 1990 1 ISAAC Anagnostou & Guibas & Polimenis, Topological Sweeping in Three Dimensions 1990 1 ISAAC Chan & Lam, Finding Least-Weight Subsequence with Few Processors 1990 1 ISAAC Han & Igarashi, Derandomization by Exploiting Redundancy and Mutual Independence 1990 1 ISAAC Gazit & Miller, Planar Separators and the Euclidean Norm 1990 1 ISAAC Avis, On the Complexity of Isometric Embedding in the Hypercube 1990 1 ISAAC Santoro & Widmayer, Distributed Function Evaluation in the Presence of Transmission Faults 1990 1 ISAAC Bitan & Zaks, Optimal Linear Broadcast 1990 1 ISAAC Watanabe & Higashi & Nakamura, Graph Augmentation Problems for a Specified Set of Vertices 1990 1 ISAAC Wang & Cheng, A Heuristic for the k-Center Problem with Vertex Weight 1990 1 ISAAC Alnuweiri & Kumar, Parallel Convexity Algorithms for Digitized Images on a Linear Array of Processors 1990 1 ISAAC Hsu & Lin, Parallel Algorithms for Labeling Image Components 1990 1 ISAAC Edelsbrunner & Sharir, A Hyperplane Incidence Problem with Applications to Counting Distances 1990 1 ISAAC Numata & Tokuyama, Splitting a Configuration in a Simplex 1990 1 ISAAC Pach & Pollack & Welzl, Weaving Patterns of Lines and Line Segments in Space 1990 1 ISAAC Lingas, Efficient Parallel Algorithms for Path Problems in Planar Directed Graphs 1990 1 ISAAC Suzuki & Yamanaka & Nishizeki, Parallel Algorithms for Finding Steiner Forests in Planar Graphs 1990 1 ISAAC Tsotras & Gopinath & Hart, Optimally Managing the History of an Evolving Forest 1992 2 LFCS Nerode, Hybrid Systems 1992 2 LFCS Reif, Correctness of Generic Modules 1992 2 LFCS Cerans, Feasibility of Finite and Infinite Paths in Data Dependent Programs 1992 2 LFCS Lesske, On Constructive Specifications of Abstract Data Types Using Temporal Logic 1992 2 LFCS Plaza, Operators on Lattices of Omega-Herbrand Interpretations 1992 2 LFCS Brown & Mantha & Wakayama, Preference Logics and Non-Monotonicity in Logic Programming 1992 2 LFCS King & Soper, Ordering Optimisations for Concurrent Logic Programs 1992 2 LFCS Remmel, Nonmonotonic Rule Systems 1992 2 LFCS Sannella, Toward a Formal Development of Programs from Algebraic Specifications: Parametrization Revisited 1992 2 LFCS Sadi & Mounier, An And-parallelism Cooperative Scheme for Full PROLOG Interpreters on a Transputer-based Architecture 1992 2 LFCS Knijnenburg & Nordemann, A Categorical Interpretation of Partial Function Logic and Hoare Logic 1992 2 LFCS Kotov, Typed Lambda-Calculus with Recursive Definitions 1992 2 LFCS Gurevich, Logic and the Challenge of Computer Science 1992 2 LFCS Pliuskeviciene, Sequential Calculus for Proving the Properties of Regular Programs 1992 2 LFCS Hoek & Meyer, Graded Modalities in Epistemic Logic 1992 2 LFCS Sakalauskaite, A Sequent Calculus for a First Order Linear Temporal Logic with Equality 1992 2 LFCS Dershowitz & Reingold, Ordinal Arithmetic with List Structure 1992 2 LFCS Gupta, A Constructive Proof that Tree are Well-Quasi-Ordered Under Minors 1992 2 LFCS Lano, Set Theoretic Foundations for Fuzzy Set Theory, and their Applications 1992 2 LFCS Lassez, Reasoning with Constraints 1992 2 LFCS Fitting, Many-Valued Non-Monotonic Logics 1992 2 LFCS Luo, A Unifying Theory of Dependent Types 1992 2 LFCS Tiuryn, Solving Equational Constraints in Polymorphic Types 1992 2 LFCS Mycroft, Online Polymorphic Type Checking with Update 1992 2 LFCS Soare, Coding Information into Recursively Enumerable Sets 1992 2 LFCS Edelat, Continuous I-categories 1992 2 LFCS de Groote, Denotations for Classical Proofs 1992 2 LFCS Benton, Strictness Logic and Polymorphic Invariance 1992 2 LFCS Shilov, Propositional Dynamic Logic with Fixed Points: Algorithmic Tools for Verification of Finite State Machines 1992 2 LFCS Christensen, A Logical Characterization of Asynchronously Communicated Agents 1992 2 LFCS Schlingloff, On the Expressive Power of Modal Logic on Trees 1992 2 LFCS Vaandrager, Expressiveness Results for Process Algebras 1992 2 LFCS Stewart, Logical Characterizations of Bounded Query Classes I: logspace Oracle Machines 1992 2 LFCS Tupailo, Gentzen-style and Novikov-style cuteliminations 1992 2 LFCS Calo & Makowsky, The Ehrenfeucht-Fraisse Games for Transitive Closure 1992 2 LFCS Pratt, Rigging Birkhoff-Stone Duality for Extra Performance 1992 2 LFCS Megrelis, Partial Algebra + Order-Sorted Algebra = Galactic Algebra 1992 2 LFCS Makarov, MSL--A Mathematical Specification Language 1992 2 LFCS Spreen, Effective Operators and Continuity Revisited 1992 2 LFCS Gamatie, Intensionally Stable Functions 1992 2 LFCS Hirokawa, Balanced Formulas, BCK-minimal Formulas and Their Proofs 1992 2 LFCS Momigliano, Minimal Negation and Hereditary Harrop Formulas 1992 2 LFCS Parikh, Reasoning About Knowledge-Applications to Computer Science, Topology, and Economics 1992 2 LFCS Kanovich, Possible Applications of Linear Logic in Computer Science 1992 2 LFCS Hoofman, Non-stable Model of Linear Logic 1992 2 LFCS Archangelsky & Taitslin, Modal Linear Logic 1992 2 LFCS Galmiche & Perrier, Automated Deduction in Additive and Multiplicative Linear Logic 1992 2 LFCS Slisenko, On Computational Complexity 1992 2 LFCS Baliga & Case & Jain & Suraj, Machine Learning of Higher Order Programs 1992 2 LFCS Kossovsky & Prokkhoroff, The Polynomial Complexity of Conjunctive Normal Form Satisfiability, when the Number of Conjunctions and Negations is Limited 1992 2 LFCS Hemachandra & Jain & Vereshchagin, Banishing Robust Turing Completeness 1992 2 LFCS Mullins, Kleene Automata and Recursion Theory 1992 2 LFCS Beigel & Kummer & Stephan, Quantifying the Amount of Verboseness 1992 2 LFCS Pliuskevicius, Complete Sequential Calculi for the First Order Symmetrical Linear Temporal Logic with UNTIL and SINCE 1992 2 LFCS Rabinovich, Non Modularity and Expressibility for Nets of Relations 1992 2 LFCS Chen, An Interleaving Model for Real-Time Systems 1992 2 LFCS Li & Carmo, An Interval-Based Modal Logic for System Specifications 1992 LMMCS Kapron, Feasible Functionals and Reducibilities 1992 LMMCS Takeuti, Essentially Sharply Bounded Formulas, Rank of Proof, and Parallel Computation 1992 LMMCS Clote, Cutting Planes and Constant Depth Frege Proofs 1992 LMMCS Remmel, Polynomial-Time Categorical Models 1992 LMMCS Downey, Parameterized Tractability and PSPACE 1992 LMMCS Cenzer, Feasible Structures and Isomorphisms 1992 LMMCS Carbone, Terms and Complexity of Proofs 1992 LMMCS Staples, Resolution Representations of Rejectors of SAT 1992 LMMCS Razborov, Lower Bounds in Boolean Complexity 1992 LMMCS Pitassi, The Complexity of the Hajos Calculus 1992 LMMCS Bonet-Carbonell, Proof Lengths and the Deduction Rule 1992 LMMCS Krajicek, Counting Problems in Bounded Arithmetic and Propositional Logic Revisited 1992 LMMCS Reagan, Bounded Recursion for Linear Time Computation 1992 LMMCS Otto, P-time from Categorical Comprehension: Bellantoni-Cook Translated 1992 LMMCS Buss, On Godel's Theorems on Lengths of Proofs 1992 LMMCS Sommer, Feasible Aspects of Functions in the Fast-growing Hierarchy 1992 LMMCS Kolaitis, Infinitary Logic for Computer Science 1992 LMMCS Leivant, Abstraction Complexity and Computational Complexity 1992 LMMCS Nerode, Computing Nonmonotonic Logics 1992 LMMCS Huang, A Realistic Approach for Tackling NP-Hard Problems 1992 LMMCS Husainov, Effective Properties of Finitely Generated Equivalence Relations 1991 SEQS Rabin, Optimal Parallel Pattern Matching via Randomization 1991 SEQS Gusfield & Landau & Schieber, An Efficient Algorithm for the All Pairs Suffix-Prefix Problem 1991 SEQS Capocelli & De Santis & Gargano & Vaccaro, Minimum Share Size in Secret Sharing Schemes 1991 SEQS Breslauer & Galil, Parallel String Matching Algorithms 1991 SEQS Chor & Shani, Private Computation of Dense Symmetric Functions 1991 SEQS Haber & Stornetta, How to Time-Stamp a Digital Document 1991 SEQS Ostrovsky, On the Security of Cryptographic Primitives 1991 SEQS Crepeau & Santha, Optimal Reduction among Oblivious Transfer Protocols 1991 SEQS Desmedt & Frankel, Perfect Zero-knowledge Sharing Schemes over any Finite Abelian Group 1991 SEQS Massey & Mittelholzer, On Sequence Sets for Code-Division Multiple Accessing 1991 SEQS Orlitsky, Interactive Communication 1991 SEQS Cohen & Litsyn & Mattson, Binary Perfect Weighted Coverings 1991 SEQS Lachaud & Stern, Polynomial-time Construction of Spherical Codes 1991 SEQS Bose & Cunningham, Asymmetric Error Correcting Codes 1991 SEQS Even & Litman, A Systematic Design and Explanation of the Atrubin Multiplier 1991 SEQS Yung, On Cryptographic Protocols 1991 SEQS Elia, Some Comments on the Computation of nth roots in Z_n and their Cryptographic Significance 1991 SEQS Sgarro, An Asymptotic Coding Theorem for Authentification and Secrecy 1991 SEQS Lempel, On the Derivation of B-Splines 1991 SEQS Cohn, Code Rates for a Read/Write Isolated Channel 1991 SEQS Head & Weber, Deciding Code Related Properties by Means of Finite Transducers 1991 SEQS Broder, Some Applications of Rabin's Fingerprinting Method 1991 SEQS Cull & Holloway, Reconstructing Sequences from Shotgun Data 1991 SEQS Korner, Extremal Set Theory as Information Theory 1991 SEQS Korner & Vaccaro & Gargano, Qualitatively Independent Partitions and Beyond 1991 SEQS Blaum & Bruck, Detection of Skew in a Sequence of Subsets 1991 SEQS Blake, The Enumeration of Huffman Distributions 1991 SEQS Perrin, Synchronizing Words and the Road Coloring Problem 1991 SEQS Crochemore, Prefix Periods in Strings 1991 SEQS de Luca & Varricchio, On Some New Unavoidable Regularities in Free Monoids 1991 SEQS Montalbano & Restivo, The Star Height One Problem for Irreducible Automata 1991 SEQS Cummings, Gray Codes and Strongly Square-Free Strings 1991 SEQS Merhav & Ziv, Universal Discrimination for Individual Sequences via Finite-State Classifiers 1991 SEQS Storer, Adaptive Lossless Data Compression 1991 SEQS Eppstein & Galil & Giancarlo & Italiano, Efficient Algorithms for Sequence Analysis 1991 SEQS Grossi & Luccio & Pagli, Efficient Algorithms for Tree Matching Problems 1991 SEQS Cuoco, Speach Processing Applications for Public Switching System 1993 5 SPAA Bruck & Cypher & Ho, Fault-Tolerant Meshes with Small Degree 1993 5 SPAA Pong & Dubois, The Verification of Cache Coherence Protocols 1993 5 SPAA Beigel & Margulis & Spielman, Fault Diagnosis in a Small Constant Number of Parallel Testing Rounds 1993 5 SPAA Leighton & Ma, Tight Bounds on the Size of Fault-Tolerant Merging and Sorting Networks with Destructive Faults 1993 5 SPAA Snir, Scalable Parallel Computing -- The SP1 product 1993 5 SPAA Klein, On Gazit and Miller's Parallel Algorithm for Planar Separators: Achieving Greater Efficiency through Random Sampling 1993 5 SPAA Cheriyan & Reif, Parallel and Output Sensitive Algorithms for Combinatorial and Linear Algebra Problems 1993 5 SPAA Cohen, Efficient Parallel Shortest-Paths in Digraphs with a Separator Decomposition 1993 5 SPAA May, Components for Computing and Communications 1993 5 SPAA Muthukrishnan & Palem, Highly Efficient Dictionary Matching in Parallel 1993 5 SPAA Amir & Benson & Farach, Optimal Parallel Two Dimensional Pattern Matching 1993 5 SPAA Giancarlo & Grossi, Parallel Construction and Query of Suffix Trees for Two-Dimensional Matrices 1993 5 SPAA Reusch, The Autonomous SIMD Systems MP-1 and MP-2 1993 5 SPAA Pietracaprina & Preparata, A Practical Constructive Scheme for Deterministic Shared-Memory Access 1993 5 SPAA Dietzfelbinger & Meyer auf der Heide, Simple, Efficient Shared Memory Simulations 1993 5 SPAA Nodine & Vitter, Deterministic Distribution Sort in Shared and Distributed Memory Multiprocessors 1993 5 SPAA Cormen & Wisniewski, Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems 1993 5 SPAA Monger & Nowatzyk & Parkin & Kelly & Browne & Lee, The S3.mp Architecture: A Local Area Multiprocessor 1993 5 SPAA Karp & Sahay & Santos & Schauser, Optimal Broadcast and Summation in the LogP Model 1993 5 SPAA Liu & Aiello & Bhatt, An Atomic Model for Message-Passing 1993 5 SPAA Lueling & Monien, A Dynamic Distributed Load Balancing Algorithm with Provable Good Performance 1993 5 SPAA Cypher & Konstantinidou, Bounds on the Efficiency of Message-Passing Protocols for Parallel Computers 1993 5 SPAA Brandenburg, Technology Advances in the Intel Paragon System 1993 5 SPAA Narendran & De Leone & Tiwari, An Implementation of the epsilon-Relaxation Algorithm on CM-5 1993 5 SPAA Greenberg & Lubachevsky & Wang, Experience In Massively Parallel Discrete Event Simulation 1993 5 SPAA Feldmann & Stricker & Warfel, Supporting Sets of Arbitrary Connections on the iWarp through Communication Context Switches 1993 5 SPAA Chesney, The Meiko CS-2 System Architecture 1993 5 SPAA Larmore & Przytycka & Rytter, Parallel Construction of Optimal Alphabetic Trees 1993 5 SPAA MacKenzie & Stout, Optimal Parallel Construction of Hamiltonian Cycles and Spanning Trees in Random Graphs 1993 5 SPAA Ja'Ja' & Ryu, An Efficient Algorithm for the Single Function Coarsest Partition Problem 1993 5 SPAA Wiesen, Scalable Hardware and Scalable Software: The nCube System 1993 5 SPAA Attiya & Friedman & Chaudhuri & Welch, Shared Memory Consistency Conditions for Non-Sequential Execution: Definitions and Programming Strategies 1993 5 SPAA Ahamad & Bazzi & John & Kohli & Neiger, The Power of Processor Consistency 1993 5 SPAA Barnes, A Method for Implementing Lock-Free Data Structures 1993 5 SPAA Oed & Walker, An Overview of Cray Research Computers incl. the new C-90 and MPP TD3 1993 5 SPAA Kaklamanis & Krizanc & Rao, Hot-Potato Routing on Processor Arrays 1993 5 SPAA Upfal & Feleprin & Snir, Randomized Routing with Shorter Paths 1993 5 SPAA Kelson, Fast Parallel Matching in Expander Graphs 1993 5 SPAA Goldberg & Jerrum & Leighton & Rao, A Doubly Logarithmic Communication Algorithm for the Completely Connected Optical Communication Parallel Computer 1993 5 SPAA Langhammer, The Scalable Parallel Operating System PARIX 1993 5 SPAA Heath, Lower Bounds for Graphic Embedding Via Algebraic Topology 1993 5 SPAA Greenberg, Efficient Wiring of Reconfigurable Parallel Processors 1993 5 SPAA Kaklamanis & Krizanc & Rao, New Graph Decompositions and Fast Emulations in Hypercubes and Butterflies 1993 5 SPAA Frank, KSR1: High Performance and Ease of Programming, No Longer an Oxymoron 1993 5 SPAA Savari, Average Case Analysis of Five Two-Dimensional Bubbles Sorting Algorithms 1993 5 SPAA Hagerup & Raman, Fast Deterministic Approximate and Exact Parallel Sorting 1993 5 SPAA Becker & Nassimi & Perl, The New Class of g-Chain Periodic Sorters 1993 5 SPAA Johnsson, The Connection Machine System CM-5 1993 5 SPAA Reps, Scan Grammars: Parallel Attribute Evaluation via Data-parallelism 1993 5 SPAA Sheffler, Implementing the Multiprefix Operation on Parallel a. Vector Computers 1993 5 SPAA Ladner & Lampe & Rogers, Vector Prefix Addition on Sub-Bus Mesh Computer 1993 5 SPAA Tricot, VOLVOX: An Operating System for Massively Parallel Computers