1996 3 3CONLINE Shene, A Comparative Study of Linked List Sorting Algorithms 1994 1 3CONLINE Janik, Textbooks for Teaching C++ 1999 16 AAAI Bailleux & Marquis, DISTANCE-SAT: Complexity and Algorithms 1999 16 AAAI Gent & Walsh, Beyond NP: The QSAT Phase Transition 1999 16 AAAI Gent & Hoos & Prosser & Walsh, Morphing: Combining Structure and Randomness 1999 16 AAAI Koubarakis & Skiadopoulos, Querying Temporal Constraint Networks in PTIME 1998 15 AAAI Hogg, Which Search Problems Are Random? 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 1997 12 AAECC Barg, Minimum Distance Decoding Algorithms for Linear Codes 1997 12 AAECC Bernardin & Monagan, Efficient Multivariate Factorization over Finite Fields 1997 12 AAECC von zur Gathen & Nocker, Exponentiation in Finite Fields: Theory and Practice 1997 12 AAECC Mihaljevic, Security Examination of a Cellular Automata Based Pseudorandom Bit Generator Using an Algebraic Replica Approach 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 1999 ACADEMIC Theodoridis & Koutroumbas, Pattern Recognition 1998 ACADEMIC Schengili-Roberts & Silk-Copeland, The Advanced HTML Companion, Second Edition 1997 ACADEMIC Rogers, Object-Oriented Neural Networks in C++ 1997 ACADEMIC Lu, Fractal Imaging 1997 ACADEMIC Abell & Braselton, Mathematica By Example, Second Edition 1996 ACADEMIC Dean & Hinchey (Eds.), Teaching and Learning Formal Methods 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 1999 4 ACISP Millan & Clark & Dawson, Boolean Function Design Using Hill Climbing Methods 1999 4 ACISP Maitra & Sarkar, Enumeration of Correlation Immune Boolean Functions 1999 4 ACISP Qu & Seberry & Pieprzyk, On the Symmetric Property of Homogeneous Boolean Functions 1999 4 ACISP Viswanathan & Boyd & Dawson, Publicly Verifiable Key Escrow with Limited Time Span 1999 4 ACISP Lee & Hong & Yoon & Cho, Accelerating Key Establishment Protocols for Mobile Communication 1999 4 ACISP Li & Pieprzyk, Conference Key Agreement from Secret Sharing 1999 4 ACISP Fung & Gray, On m-Permutation Protection Scheme Against Modification Attack 1999 4 ACISP Golic & Clark & Dawson, Inversion Attack and Branching 1999 4 ACISP Susilo & Safavi-Naini & Pieprzyk, Fail-Stop Threshold Signature Schemes Based on Elliptic Cruves 1999 4 ACISP Nguyen & Mu & Varadharajan, Divertible Zero-Knowledge Proof of Polynomial Relations and Blind Group Signature 1999 4 ACISP Ghodosi & Pieprzyk, Repudiation of Cheating and Non-repudiation of Zhang's Proxy Signature Schemes 1999 4 ACISP Muller, On the Security of an RSA Based Encryption Scheme 1999 4 ACISP Gysin & Seberry, Generalised Cycling Attacks on RSA and Strong RSA Primes 1999 4 ACISP Tiountchik & Trichina, RSA Acceleration with Field Programmable Gate Arrays 1999 4 ACISP Martin & Pieprzyk & Safavi-Naini & Wang, Changing Thresholds in the Absence of Secure Channels 1999 4 ACISP Saeednia & Ghodosi, A Self-Certified Group-Oriented Cryptosystem Without a Combiner 1999 4 ACISP Horton & Seberry, Companion Viruses and the Macintosh: Threats and Countermeasures 1999 4 ACISP Ashley & Broom & Vandenwauver, An Implementation of a Secure Version of NFS Including RBAC 1999 4 ACISP Traore, Group Signatures and Their Relevance to Privacy-Protecting Off-Line Electronic Cash Systems 1999 4 ACISP Boyd & Foo & Pavlovski, Efficient Electronic Cash Using Batch Signatures 1999 4 ACISP Zhou & Deng & Bao, Evolution of Fair Non-repudiation with TTP 1999 4 ACISP Bai & Varadharajan, Authorization in Object Oriented Databases 1999 4 ACISP Saunders & Hitchens & Varadharajan, An Analysis of Access Control Models 1999 4 ACISP Lenstra, Efficient Identity Based Parameter Selection for Elliptic Curve Cryptosytems 1999 4 ACISP Pei & Li & Wang & Safavi-Naini, Characterization of Optimal Authentication Codes with Arbitration 1999 4 ACISP Yamamura, A Functional Cryptosystem Using a Group Action 1998 3 ACISP Kaijser, A Review of the SESAME Development 1998 3 ACISP Muller & Muller, The Security of Public Key Cryptosystems Based on Integer Factorization 1998 3 ACISP Ashley & Vandenwauver & Broom, A Uniform Approach to Securing Unix Applications Using SESAME 1998 3 ACISP Falk & Trommer, Integrated Management of Network and Host Based Security Mechanisms 1998 3 ACISP Horton & Seberry, Covert Distributed Computing Using Java Through Web Spoofing 1998 3 ACISP Yi & Lam & Han, Differential Cryptanalysis of a Block Cipher 1998 3 ACISP Sun & Shieh, On Private-Key Cryptosystems Based on Product Codes 1998 3 ACISP Carter & Dawson & Nielsen, Key Schedules of Iterative Block Ciphers 1998 3 ACISP Blumenthal & Hien & Rooney, Low-Cost Secure Server Connection with Limited-Privilege Clients 1998 3 ACISP He & Sycara & Su, A Solution to Open Standard of PKI 1998 3 ACISP Franz & Graubner & Jerichow & Pfitzmann, Comparison of Commitment Schemes Used in Mix-Mediated Anonymous Communication for Preventing Pool-Mode Attacks 1998 3 ACISP Golic & Menicocci, Correlation Attacks on Up/Down Cascades 1998 3 ACISP Rose, A Stream Cipher Based on Linear Feedback over GF(2^8) 1998 3 ACISP Simpson & Golic & Dawson, A Probabilistic Correlation Attack on the Shrinking Generator 1998 3 ACISP Safavi-Naini & Wany, Bounds and Constructions for A^3-code with Multi-senders 1998 3 ACISP Pieprzyk & Qu, Rotation-Symmetric Functions and Fast Hashing 1998 3 ACISP Millan, How to Improve the Nonlinearity of Bijective S-Boxes 1998 3 ACISP Kaksonen & Mahonen, Object Modeling of Cryptographic Algorithms with UML 1998 3 ACISP Manninger & Schischka, Adapting an Electronic Purse for Internet Payments 1998 3 ACISP Hanaoka & Zheng & Imai, LITESET: A Light-Weight Secure Electronic Transaction Protocol 1998 3 ACISP Henderson, Applications of Linearised and Sub-linearised Polynomials to Information Security 1998 3 ACISP Chen & Hughes, Protocol Failures Related to Order of Encryption and Signature: Computation of Discrete Logarithms in RSA Groups 1998 3 ACISP Fung & Gray, Protection Against EEPROM Modification Attacks 1998 3 ACISP Hruby, Trends in Quantum Cryptography in Czech Republic 1998 3 ACISP Bai & Varadharajan, A High Level Language for Conventional Access Control Models 1998 3 ACISP Aura, Fast Access Control Decisions from Delegation Certificate Databases 1998 3 ACISP Riechmann & Kleinoder, Meta Objects for Access Control: Role-Based Principals 1998 3 ACISP Tidswell & Potter, A Dynamically Typed Access Control Model 1998 3 ACISP Saeednia & Safavi-Naini, Efficient Identity-Based Conference Key Distribution Protocols 1998 3 ACISP Rudolph, A Formal Model for Systematic Design of Key Establishment Protocols 1998 3 ACISP Boyd & Mathuria, Key Establishment Protocols for Secure Mobile Communications: A Selective Survey 1998 3 ACISP Stabell-Kulo & Helme & Dini, Detecting Key-Dependencies 1998 3 ACISP Ghodosi & Pieprzyk & Safavi-Naini, Secret Sharing in Multilevel and Compartmented Groups 1998 3 ACISP Ghodosi & Pieprzyk & Safavi-Naini & Wang, On Construction of Cumulative Secret Sharing Schemes 1998 3 ACISP Desmedt & King & Kishimoto & Kurosawa, A Comment on the Efficiency of Secret Sharing Scheme over any Finite Abelian Group 1998 3 ACISP Syukri & Okamoto & Mambo, A User Identification System Using Signature Written with Mouse 1998 3 ACISP Lee & Hwang & Wang, On Zhang's Nonrepudiable Proxy Signature Schemes 1997 2 ACISP Piper, Trusted Third Parties for Secure Electronic Commerce -- Are They Needed? (one page only) 1997 2 ACISP Josang, Prospectives for Modelling Trust in Information Security 1997 2 ACISP Bai & Varadharajan, Analysis and Implementation of a Formal Authorisation Policy Design Approach 1997 2 ACISP Tidswell & Potter, An Approach to Dynamic Domain and Type Enforcement 1997 2 ACISP Tachikawa & Higaki & Takizawa, Purpose-oriented Access Control Model in Object-based Systems 1997 2 ACISP Terada & Murayama, User Access Domain Management System -- ADAMS 1997 2 ACISP Rubin & Boneh & Fu, Revocation of Unread Email in an Untrusted Network 1997 2 ACISP Shankaran & Varadharajan & Hitchens, Security Issues in Asynchronous Transfer Mode 1997 2 ACISP Leiwo & Zheng, A Method to Implement a Denial of Service Protection Base 1997 2 ACISP Holford & Mohay, ProtectOS: Operating System and Hardware Support for Small Objects 1997 2 ACISP Fischlin, Practical Memory Checkers for Stacks, Queues and Deques 1997 2 ACISP Lenstra, Using Cyclotomic Polynomials to Construct Efficient Discrete Logarithm Cryptosystems over Finite Fields 1997 2 ACISP Yi & Lam, A New Hash Function Based on Block Cipher 1997 2 ACISP Zhang & Zheng, New Lower Bounds on Nonlinearity and a Class of Highly Nonlinear Functions 1997 2 ACISP Millan & Dawson, On the Security of Self-synchronous Ciphers 1997 2 ACISP Sadowski, Inefficiency of Variant Characteristics for Substitution-Permutation Networks with Position Permutations 1997 2 ACISP Chen & Gollmann & Mitchell & Wild, Secret Sharing with Reusable Polynomials 1997 2 ACISP Bakhtiari & Safavi-Naini & Pieprzyk, A Message Authentication Code Based on Latin Squares 1997 2 ACISP Kurosawa & Obana, Characterisation of (k,n) Multi-receiver Authentication 1997 2 ACISP Lim & Boyd & Dawson, Cryptanalysis of Adaptive Arithmetic Coding Encryption Schemes 1997 2 ACISP Salmasizadeh & Simpson & Golic & Dawson, Fast Correlation Attacks and Multiple Linear Approximations 1997 2 ACISP Mao, Verifiable Escrowed Signature 1997 2 ACISP Man & Safavi-Naini, Democratic Key Escrow Scheme 1997 2 ACISP Bao & Deng & Han & Jeng, Design and Analyses of Two Basic Protocols for Use in TTP-based Key Escrow 1997 2 ACISP Mambo & Okamoto & Sakurai, Protection of Data and Delegated Keys in Digital Distribution 1997 2 ACISP Mu & Varadharajan & Lin, New Micropayment Schemes Based on PayWords 1997 2 ACISP Boyd, On Key Agreement and Conference Key Agreement 1997 2 ACISP Saeednia, Identity-based and Self-certified Key-exchange Protocols 1997 2 ACISP Dittmann & Steinmetz, Enabling Technology for the Trading of MPEG-encoded Video 1997 2 ACISP Abe & Fujii & Kushima, Image Distribution Method with Embedded Identifier Scheme for Copyright Protection 1996 1 ACISP Orlowski, The Changing Face of Information Technology Security 1996 1 ACISP Hardjono & Seberry, Replicating the Kuperee Authentication Server for Increased Security and Reliability 1996 1 ACISP Taylor, Non-repudiation without Public-Key 1996 1 ACISP Han, Investigation of Non-repudiation Protocols 1996 1 ACISP Hwang & Chang, A Dynamic Secret Sharing Scheme with Cheater Detection 1996 1 ACISP Renvall & Ding, A Nonlinear Secret Sharing Scheme 1996 1 ACISP Renvall & Ding, The Access Structure of Some Secret-Sharing Schemes 1996 1 ACISP Wu & Dawson, On Construction of Resilient Functions 1996 1 ACISP Dawson & He, Another Approach to Software Key Escrow Encryption 1996 1 ACISP Pieprzyk & Ghodosi & Charnes & Safavi-Naini, Cryptography Based on Transcendental Numbers 1996 1 ACISP Troy, Breakthroughs in Standardisation of IT Security Criteria 1996 1 ACISP Chen & Gollmann & Mitchell, Tailoring Authentication Protocols to Match Underlying Mechanisms 1996 1 ACISP Mu & Varadharajan, On the Design of Security Protocols for Mobile Communications 1996 1 ACISP Boyd, A Framework for Design of Key Establishment Protocols 1996 1 ACISP Golic, On Period of Multiplexed Sequences 1996 1 ACISP Golic, Edit Distance Correlation Attacks on Clock-controlled Combiners with Memory 1996 1 ACISP Mihaljevic, A Faster Cryptanalysis of the Self-Shrinking Generator 1996 1 ACISP Baraani-Dastjerdi & Pieprzyk & Safavi-Naini, Modeling a Multi-level Secure Object-oriented Database Using Views 1996 1 ACISP Varadharajan & Allen, Support for Joint Action Based Security Policies 1996 1 ACISP Sandhu, Access Control: The Neglected Frontier 1996 1 ACISP Jonsson & Andersson, On the Quantitative Assessment of Behavioural Security 1996 1 ACISP Gustafson & Jonsson & Olovsson, On the Modelling of Preventive Security Based on a PC Network Intrusion Experiment 1996 1 ACISP Esmaili & Safavi-Naini & Pieprzyk, Evidential Reasoning in Network Intrusion Detection Systems 1996 1 ACISP Lin & Wang & Chang, A Group-oriented (t,n) Undeniable Signature Scheme without Trusted Center 1996 1 ACISP Ghodosi & Pieprzyk & Charnes & Safavi-Naini, Cryptosystems for Hierarchical Groups 1996 1 ACISP Bakhtiari & Safavi-Naini & Pieprzyk, On Selectable Collisionful Hash Functions 1996 1 ACISP Bakhtiari & Safavi-Naini & Pieprzyk, On Password-based Authenticated Key Exchange Using Collisionful Hash Functions 1996 1 ACISP Sadeghiyan & Mohajeri, A New Universal Test for Bit Strings 1996 1 ACISP Mu & Zheng, An Alternative Model of Quantum Key Agreement via Photon Coupling 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 2000 30 ACMCCR Nyang & Song, Knowledge-Proof Based Versatile Smart Card Verification Protocol 2000 30 ACMCCR Zhou & Deng, On the Validity of Digital Signatures 1997 27 ACMCCR Wei & Naik, An Efficient Multicast Protocol Using de Bruijn Structure for Mobile Computing 1997 27 ACMCCR Taqqu & Willinger & Sherman, Proof of a Fundamental Result in Self-Similar Traffic Modeling 1997 27 ACMCCR Rizzo, Effective Erasure Codes for Reliable Computer Communication Protocols 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 2000 34 ACMOSR Trono & Taylor, Further Comments on ``A Correct and Unrestrictive Implementation of General Semaphores'' 2000 34 ACMOSR Xu, Tagged Semaphores 2000 34 ACMOSR Pei & Cui & Peng, On a Session Key Compromise Problem in [KC95] Protocol 2000 34 ACMOSR Sun & Wang, An Approach to Finding the Attacks on the Cryptographic Protocols 2000 34 ACMOSR Mitchell, Making Serial Number Based Authentication Robust Against Loss of State 2000 34 ACMOSR Bouabdallah & Laforest, A Distributed Token-based Algorithm for the Dynamic Resource Allocation Problem 2000 34 ACMOSR Creak & Sheehan, A Top-Down Operating Systems Course 1999 33 ACMOSR Bull & Otway, A Nested Mutual Authentication Protocol 1999 33 ACMOSR Zhang & Li & Xiao, An Approach to the Formal Verification of the Two-Party Cryptographic Protocols 1999 33 ACMOSR Ng, Comments on Xu, Zhang and Zhu's Paper on ``On the Security of Three-Party Cryptographic Protocols'' 1999 33 ACMOSR Lee, The Big Brother Ballot 1998 32 ACMOSR Anderson & Bergadano & Crispo & Lee & Manifavas & Needham, A New Family of Authentication Protocols 1998 32 ACMOSR Joye & Yen, ID-based Secret-Key Cryptography 1998 32 ACMOSR Xu & Zhang & Zhu, On the Security of Three-Party Cryptographic Protocols 1998 32 ACMOSR Kang & Lee, Analysis and Solution of Non-preemptive Policies for Scheduling Readers and Writers 1997 31 ACMOSR Xu & Zhang & Zhu, On the Properties of Cryptographic Protocols and the Weaknesses of the BAN-like Logics 1997 31 ACMOSR Auyong & Chee, Authentication Services for Computer Networks and Electronic Messaging Systems 1997 31 ACMOSR Chen & Gollmann & Mitchell, Authentjication Using Minimally Trusted Servers 1997 31 ACMOSR Chang & Chang, A Fault-tolerant Dynamic Triangular Mesh Protocol for Distributed Mutual Exclusion 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) 1999 19 ACMSIGBIO Hunter, Progress in Computational Molecular Biology 1999 19 ACMSIGBIO Miller, My Adventure in Using Computer Science in the Genome Project 1999 19 ACMSIGBIO Graham, Research and Career Development Opportunities for Meeting the Challenges Presented by the Human Genome Project 1998 18 ACMSIGBIO Jones (Ed.), Biomedical Applications of Knowledge Discovery in Databases: Research Project Descriptions 1999 6 ACMTCHI Hahn & Kim, Why Are Some Diagrams Easier to Work With? Effects of Diagrammatic Representation on the Cognitive Integration Process of Systems Analysis and Design 1997 4 ACMTCHI Cohen, Drawing Graphs to Convey Proximity: An Incremental Arrangement Method 2000 1 ACMTCL Paulson, Mechanizing UNITY in Isabelle 2000 1 ACMTCL Libkin, Logics with Counting and Local Properties 2000 1 ACMTCL Kozen, On Hoare Logic and Kleene Algebra with Tests 2000 1 ACMTCL Gurevich, Sequential Abstract-State Machines Capture Sequential Algorithms 2000 1 ACMTCL Grohe & Schwentick, Locality of Order-Invariant First-Order Formulas 2000 1 ACMTCL Liberatore, Compilability and Compact Representations of Revision of Horn Knowledge Bases 2000 1 ACMTCL Aziz & Sanwal & Singhal & Brayton, Model-Checking Continuous-Time Markov Chains 2000 1 ACMTCL Cohen & Kozen, A Note on the Complexity of Propositional Hoare Logic 1998 16 ACMTCS Juurlink & Wijshoff, A Quantitative Comparison of Parallel Computation Models 1998 16 ACMTCS Lamport, The Part-Time Parliament 1997 15 ACMTCS Mahmood & Lynch & Shaffer, Optimally Adaptive, Minimum-Distance, Circuit-Switched Routing in Hypercubes 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 2000 5 ACMTDAES Bommu & O'Neill, Retiming-Based Factorization for Sequential Logic Optimization 2000 5 ACMTDAES Yan, Three-Layer Bubble-Sorting-Based NonManhattan Channel Routing 2000 5 ACMTDAES Yang & Chen & Ho & Tsai, Efficient Routability Check Algorithms for Segmented Channel Routing 1999 4 ACMTDAES Kern & Greenstreet, Formal Verification In Hardware Design: A Survey 1999 4 ACMTDAES Song & Wang, On the Crossing Distribution Problem 1999 24 ACMTDS Bozkaya & Ozsoyoglu, Indexing Large Metric Spaces for Similarity Search Queries 1998 23 ACMTDS Zobel & Moffat & Ramamohanarao, Inverted Files Versus Signature Files for Text Indexing 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 2000 19 ACMTG Lee & Samet, Navigating through Triangle Meshes Implemented as Linear Quadtrees 1998 17 ACMTG Naiman, Jagged Edges: When Is Filtering Needed? 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 1999 2 ACMTISS Stubblebine & Syverson & Goldschlag, Unlinkable Serial Transactions: Protocols and Applications 1999 2 ACMTISS Gabber & Gibbons & Kristol & Matias & Mayer, On Secure and Pseudonymous Client-Relationships with Multiple Servers 1999 2 ACMTISS Hevia & Kiwi, Strength of Two Data Encryption Standard Implementations Under Timing Attacks 1999 2 ACMTISS Halevi & Krawczyk, Public-Key Cryptography and Password Protocols 1999 2 ACMTISS Paulson, Inductive Analysis of the Internet Protocol TLS 1999 2 ACMTISS Reiter & Stubblebine, Authentication Metric Analysis and Design 1999 2 ACMTISS Schneier & Kelsey, Secure Audit Logs to Support Computer Forensics 1998 1 ACMTISS Bergadano & Crispo & Ruffo, High Dictionary Compression for Proactive Password Checking 1998 1 ACMTISS Bertino & Vimercati & Ferrari & Samarati, Exception-Based Information Flow Control in Object-Oriented Systems 1998 1 ACMTISS Reiter & Rubin, Crowds: Anonymity for Web Transactions 1998 1 ACMTISS Sandhu & Chen, The Multilevel Relational (MLR) Data Model 1999 9 ACMTMCS Wegenkittl & Matsumoto, Getting Rid of Correlations Among Pseudorandom Numbers: Discarding versus Tempering 1998 8 ACMTMCS Matsumoto & Nishimura, Mersenne Twister: A 623-Dimensionally Equidistributed Uniform Pseudo-Random Number Generator 1998 8 ACMTMCS Matsumoto, Simple Cellular Automata as Pseudo-Random m-Sequence Generators for Built-In Self-Test 1998 8 ACMTMCS Hellekalek & Niederreiter, The Weighted Spectral Test: Diaphony 1998 8 ACMTMCS Entacher, Bad Subsequences of Well-Known Linear Congruential Pseudo-Random Number Generators 1998 8 ACMTMCS Owen, Latin Supercube Sampling for Very High-Dimensional Simulations 1997 7 ACMTMCS Ronngren & Ayani, A Comparative Study of Parallel and Sequential Priority Queue Algorithms 1997 7 ACMTMCS Leeb & Wegenkittl, Inverse and Linear Congruential Pseudorandom Number Generators in Empirical Tests 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 1999 25 ACMTMS Ribeiro & Resende, Algorithm 797: Fortran Subroutines for Approximate Solution of Graph Planarization Problems Using GRASP 1999 25 ACMTMS L'Ecuyer & Simard, Beware of Linear Congruential Generators with Multipliers of the Form a = +/- 2^q +/- 2^r 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 2000 18 ACMTOIS Clarke & Cormack, Shortest-Sutstring Retrieval and Ranking 1998 16 ACMTOIS Moffat & Neal & Witten, Arithmetic Coding Revisited 1998 16 ACMTOIS Stotts & Furuta & Cabarrus, Hyperdocuments as Automata: Verification of Trace-Based Browsing Properties by Model Checking 1997 15 ACMTOIS Bookstein & Klein & Raita, Modeling Word Occurrences for the Compression of Concordances 1997 15 ACMTOIS Cohen, Recursive Hashing Functions for n-Grams 1997 15 ACMTOIS Manber, A Text Compression Scheme that Allows Fast Searching Directly in the Compressed File 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 2000 22 ACMTOPLAS Kupferman & Vardi, An Automata-Theoretic Approach to Modular Model Checking 2000 22 ACMTOPLAS Reps, Undecidability of Context-Sensitive Data Dependence Analysis 1999 21 ACMTOPLAS Poletto & Sarkar, Linear Scan Register Allocation 1999 21 ACMTOPLAS Kobayashi & Pierce & Turner, Linearity and the Pi-Calculus 1999 21 ACMTOPLAS Butler & Hartel, Reasoning about Grover's Quantum Search Algorithm Using Probabilistic wp 1999 21 ACMTOPLAS Lamport & Paulson, Should Your Specification Language Be Typed? 1999 21 ACMTOPLAS Ramalingam, Identifying Loops in Almost Linear Time 1999 21 ACMTOPLAS Greiner & Blelloch, A Provably Time-Efficient Parallel Implementation of Full Speculation 1998 20 ACMTOPLAS Alur & Henzinger, Finitary Fairness 1998 20 ACMTOPLAS Buchsbaum & Kaplan & Rogers & Westbrook, A New, Simpler Linear-Time Dominators Algorithm 1998 20 ACMTOPLAS Wagner & Graham, Efficient and Flexible Incremental Parsing 1998 20 ACMTOPLAS Lee & Yi, Proofs about a Folklore Let-Polymorphic Type Inference Algorithm 1998 20 ACMTOPLAS Tofte & Birkedal, A Region Inference Algorithm 1998 20 ACMTOPLAS Kennedy & Kremer, Automatic Data Layout for Distributed-Memory Machines 1997 19 ACMTOPLAS Sabry & Wadler, A Reflection on Call-by-Value 1997 19 ACMTOPLAS Yu & Kaser, A Note on ``On the Conversion of Indirect to Direct Recursion'' 1997 19 ACMTOPLAS Clarke & Cormack, On the Use of Regular Expressions for Searching Text 1997 19 ACMTOPLAS Kozen, Kleene Algebra with Tests 1997 19 ACMTOPLAS Hu & Iwasaki & Takechi, Formal Derivation of Efficient Parallel Programs by Construction of List Homomorphisms 1997 19 ACMTOPLAS Pippenger, Pure versus Impure Lisp 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 1998 7 ACMTSEM Hunt & Vo & Tichy, Delta Algorithms: An Empirical Analysis 1996 5 ACMTSEM Harel & Naamad, The STATEMATE Semantics of Statecharts 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 1999 7 ACRVW Dijkstra, Computing Science: Achievements and Challenges 1999 7 ACRVW Raidl, The Multiple Container Packing Problem: A Genetic Algorithm with Weighted Codings 1999 5 ACSC Halbwachs & Raymond, Validation of Synchronous Reactive Systems: From Formal Verification to Automatic Testing 1999 5 ACSC Amadio & Prasad, The Game of the Name in Cryptographic Tables 1999 5 ACSC Calamoneri & Finocchi & Manoussakis & Petreschi, A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs 1999 5 ACSC Chantrapornchai & Tongsima & Sha, Rapid Prototyping Techniques for Fuzzy Controllers 1999 5 ACSC Chung & Hwang, Transactional Cache Management with Aperiodic Invalidation Scheme in Mobile Environments 1999 5 ACSC Claessen & Sands, Observable Sharing for Functional Circuit Description 1999 5 ACSC Diaz & de Frutos Escrig, Relating May and Must Testing Semantics for Discrete Timed Process Algebras 1999 5 ACSC Fredlund & Gurov, A Framework for Formal Reasoning about Open Distributed Systems 1999 5 ACSC Galmiche & Larchey-Wendling, Structural Sharing and Efficient Proof-Search in Propositional Intuitionistic Logic 1999 5 ACSC den Hartog, Verifying Probabilistic Programs Using a Hoare like Logic 1999 5 ACSC Henriksen, An Expressive Extension of TLC 1999 5 ACSC Van Hung & Guelev, Completeness and Decidability of a Fragment of Duration Calculus with Iteration 1999 5 ACSC Indrika, Logical Relations in Circuit Verification 1999 5 ACSC Iwanuma & Kishino, Lemma Generalization and Non-unit Lemma Matching for Model Elimination 1999 5 ACSC Kamareddine & Monin, On Automating Inductive and Non-inductive Termination Methods 1999 5 ACSC Klaudel & Pommereau, Asynchronous Links in the PBC and M-Nets 1999 5 ACSC Knoop, Demand-Driven Model Checking for Context-Free Processes 1999 5 ACSC Loke & Schmidt & Zaslavsky, Programming the Mobility Behaviour of Agents by Composing Itineraries 1999 5 ACSC Mukund & Kumar & Smolka, Faster Model Checking for Open Systems 1999 5 ACSC Nantajeewarawat & Wuwongse, An Argumentation Approach to Semantics of Declarative Programs with Defeasible Inheritance 1999 5 ACSC Niehren & Priesnitz, Entailment of Non-structural Subtype Constraints 1999 5 ACSC Ogata, A CPS-Transform of Constructive Classical Logic 1999 5 ACSC Ogata & Futatsugi, Formal Verification of the MCS List-Based Queuing Lock 1999 5 ACSC Reffel, BDD-Nodes Can Be More Expressive 1999 5 ACSC Ritter & Hinrichsen & Eveking, Formal Verification of Descriptions with Distinct Order of Memory Operations 1999 5 ACSC Roychoudhury & Kumar & Ramakrishnan & Ramakrishnan, Beyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs 1999 5 ACSC Seth, On L^k(Q) Types and Boundedness of IFP(Q) on Finite Structures 1999 5 ACSC Shen & Li & Zheng, Separators Are as Simple as Cutsets 1999 5 ACSC Tong & Lau & Lim, Ant Colony Optimization for the Ship Berthing Problem 1998 4 ACSC Ganzinger & Jacquemard & Veanes, Rigid Reachability 1998 4 ACSC Janowski, Semantics and Logic for Provable Fault-Tolerance, A Tutorial 1998 4 ACSC Ang & Tan & Tan, Tried Linear Hashing 1998 4 ACSC Raja & Shyamasundar, Mobile Computation: Calculus and Languages (A Tutorial) 1997 3 ACSC Rabin, Correctness of Programs and Protocols through Randomization (3 pages only) 1997 3 ACSC Mikk & Lakhnech & Siegel, Hierarchical Automata as Model for Statecharts 1997 3 ACSC Hasegawa, An Analysis of Divisibility Orderings and Recursive Path Orderings 1997 3 ACSC Fujita, A Fault Tolerant Broadcast Scheme in Star Graphs 1997 3 ACSC Ben-Asher & Stein, Basic Results in Automatic Transformations of Shared Memory Parallel Programs into Sequential Programs 1996 2 ACSC Dehne & Song, Randomized Parallel List Ranking for Distributed Memory Multiprocessors 1996 2 ACSC Shi, Suffix Arrays for Multiple Strings: A Method for On-line Multiple String Searches 1996 2 ACSC Vollmer, Relations Among Parallel and Sequential Computation Models 1996 2 ACSC Sun & Yang & Zhang & Chen, Distributed Concurrency Control in Real-time Cooperative Editing Systems 1996 2 ACSC Valarcher, Intensionality versus Extensionality and Primitive Recursion 1996 2 ACSC Vorobyov, On the Bounded Theories of Finite Trees 1996 2 ACSC Hamada & Mei & Bao & Igarashi, Broadcasting in Star Graphs with Byzantine Failures 1996 2 ACSC Juang & Lei, Blind Threshold Signatures Based on Discrete Logarithm 1996 2 ACSC Kaida & Uehara & Imamura, Computation of the k-Error Linear Complexity of Binary Sequences with Period 2^n 1996 2 ACSC Nicomette & Deswarte, Symbolic Rights and Vouchers for Access Control in Distributed Object Systems 1996 2 ACSC Yi, On Design and Analysis of a New Block Cipher 1996 2 ACSC Voicu, Synthesizing Parallel Divide-and-Conquer Algorithms Using the List Interleave Operator 1996 2 ACSC Tygar & Yee & Heintze, Cryptographic Postage Indicia 1995 1 ACSC Albacca, Leapfrogging Samplesort 1995 1 ACSC Cai, Spanning 2-Trees 1995 1 ACSC Kao, Minimal Linear Invariants 1995 1 ACSC Baffi & Petreschi, Parallel Maximal Matching on Minimal Vertex Series Parallel Digraphs 1995 1 ACSC Lam & Lee, Efficient Equality-Testing and Updating of Sets 1995 1 ACSC Nguyen & Widmayer, Binary Space Partitions for Sets of Hyperrectangles 2000 14 ACTACYB Schewe & Ripke & Drechsler, Hybrid Concurrency Control and Recovery for Multi-Level Transactions 2000 14 ACTACYB Tiplea & Badarau, A Note on Decidability of Reachability for Conditional Petri Nets 2000 14 ACTACYB Domosi, Unusual Algorithms for Lexicographical Enumeration 2000 14 ACTACYB Koshiba & Makinen & Takada, Inferring Pure Context-Free languages from Positive Data 2000 14 ACTACYB Makinen, On Inferring Zero-Reversible Languages 2000 14 ACTACYB Michalik, F Codes 2000 14 ACTACYB Pantovic, Note on the Cardinality of some Sets of Clones 2000 14 ACTACYB Imreh & Fulop & Friedler, A Note on the Equivalence of the Set Covering and Process Network Synthesis Problems 2000 14 ACTACYB Csaba, Note on the Work Function Algorithm 2000 14 ACTACYB Kalmar & Szepesvari & Lorincz, Modular Reinforcement Learning: A Case Study in a Robot Domain 1999 14 ACTACYB Csaba, On the Partitioning Algorithm 1999 14 ACTACYB Hakonen & Raita, A Family of Fast Constant-Space Substring Search Algorithms 1999 14 ACTACYB Kruzslicz, Improved Greedy Algorithms for Computing Approximate Median Strings 1999 14 ACTACYB Magyar & Johnsson & Nevalainen, On the Exact Solution of the Euclidean Three-Matching Problem 1999 14 ACTACYB Ortigosa & Balogh & Garcia, A Parallelized Sequential Random Search Global Optimization Algorithm 1999 14 ACTACYB Adam, On Some Cyclic Connectivity Properties of Directed Graphs (Examples and Problems) 1999 14 ACTACYB Csirik & Frenk & Labbe & Zhang, Two Simple Algorithms for Bin Covering 1999 14 ACTACYB Demetrovics & Petho & Ronyai, On +/-1-Representations of Integers 1999 14 ACTACYB Domosi & Nehaniv, Complete Finite Automata Network Graphs with Minimal Number of Edges 1999 14 ACTACYB Engelfriet & Hoogeboom & Van Best, Trips on Trees 1999 14 ACTACYB Esik, Axiomatizing Iteration Categories 1999 14 ACTACYB Fulop & Jurvanen & Steinby & Vagvolgyi, On One-Pass Term Rewriting 1999 14 ACTACYB Imreh & Ito, A Note on the Star-product 1999 14 ACTACYB Imreh & Steinby, Directable Nondeterministic Automata 1999 14 ACTACYB Jurgensen, Syntactic Monoids of Codes 1999 14 ACTACYB Kuich, Tree Transducers and Formal Tree Series 1999 14 ACTACYB Martin-Vide & Paun, Duplication Grammars 1999 14 ACTACYB Mitrana & Rozenberg, Some Properties of Duplication Grammars 1999 14 ACTACYB Salomaa, Watson-Crick Walks and Roads on D0L Graphs 1999 14 ACTACYB Salomaa & Yu, Generalized Fairness and Context-Free Languages 1998 13 ACTACYB Bottoni & Mauri & Mussio & Paun, Grammars Working on Layered Strings 1998 13 ACTACYB Csima, On Extended Simple Eco-grammar Systems 1998 13 ACTACYB Meduna, Descriptional Complexity of Multi-Continuous Grammars 1998 13 ACTACYB Petkovic & Ciric & Bogdanovic, Decompositions of Automata and Transition Semigroups 1998 13 ACTACYB Szabo, On Minimal and Maximal Clones II 1998 13 ACTACYB Csallner, Improving Storage Handling of Interval Methods for Global Optimization 1998 13 ACTACYB Rote & Woeginger, Minimizing the Number of Tardy Jobs 1998 13 ACTACYB Sali & Sali, Generalized Dependencies in Relational Databases 1998 13 ACTACYB Telek & Pfening Fodor, Analysis of the Completion Time of Markov Reward Models 1998 13 ACTACYB Lohrey, NP-completeness Results Concerning the Transformation of Logic Programs into Attribute Grammars 1998 13 ACTACYB Fulop & Imreh & Friedler, On the Reformulation of Some Classes of PNS-Problems as Set Covering Problems 1997 13 ACTACYB Mateescu, CD Grammar Systems and Trajectories 1997 13 ACTACYB Sosik, On Hybrid Connectionist-Symbolic Models 1997 13 ACTACYB Vaszil, Various Communications in PC Grammar Systems 1997 13 ACTACYB Bernatsky, Regular Expression Star-freeness is PSPACE-complete 1997 13 ACTACYB Csaba & Danyi, Server Problems and Regular Languages 1997 13 ACTACYB Imreh, On alpha_i-products of Nondeterministic Tree Automata 1997 13 ACTACYB Makinen, On Lexicographic Enumeration of Regular and Context-free Languages 1997 13 ACTACYB Burkard & Zhang, Bounded Space On-Line Variable-Sized Bin Packing 1997 13 ACTACYB Pluhar, Generalized Harary Games 1997 13 ACTACYB Achs, Evaluation Strategies of Fuzzy Datalog 1996 12 ACTACYB Dassow & Mitrana, Fairness in Grammar Systems 1996 12 ACTACYB Bordihn & Csuhaj-Varju, On Competence and Completeness in CD Grammar Systems 1996 12 ACTACYB Fernau & Holzer, Accepting Multi-Agent Systems II 1996 12 ACTACYB Paun, PC Grammar Systems: Recent Results, Open Problems 1996 12 ACTACYB Mihalache, PC Grammar Systems with Separated Alphabets 1996 12 ACTACYB Ilie & Salomaa, On Regular Characterizations of Languages by Grammar Systems 1996 12 ACTACYB ter Beek, Teams in Grammar Systems: Hybridity and Weak Rewriting 1996 12 ACTACYB Freund & Freund, Test Tube Systems or How to Bake a DNA Cake 1996 12 ACTACYB Martin-Vide, Natural Language Understanding: a New Challenge for Grammar Systems 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 2000 36 ACTAINF Tip & Sweeney, Class Hierarchy Specialization 2000 36 ACTAINF Carpi & de Luca, Special Factors, Periodicity, and an Application to Sturmian Words 2000 36 ACTAINF Middeldorp & Ohsaki, Type Introduction for Equational Rewriting 2000 36 ACTAINF Kesten & Manna & Pnueli, Verification of Clocked and Hybrid Systems 2000 36 ACTAINF Csuhaj-Varju & Mitrana, Evolutionary Systems: A Language Generating Device Inspired by Evolving Communities of Cells 2000 36 ACTAINF Cheng & Ding, Single Machine Scheduling with Deadlines and Increasing Rates of Processing Times 2000 36 ACTAINF Kinoshita & Power, Data Refinement and Algebraic Structure 2000 36 ACTAINF Forst & Thorup, Minimal Huffman Trees 2000 36 ACTAINF Mahmoud & Flajolet & Jacquet & Regnier, Analytic Variations on Bucket Selection and Sorting 2000 36 ACTAINF Gorlatch & Lengauer, Abstraction and Performance in the Design of Parallel Programs: An Overview of the SAT Approach 2000 36 ACTAINF Honkala, On Slender 0L Languages over the Binary Alphabet 2000 36 ACTAINF Intrigila & Varricchio, On the Generalization of Higman and Kruskal's Theorems to Regular Languages and Rational Trees 2000 36 ACTAINF Ehrich & Caleiro, Specifying Communication in Distributed Information Systems 2000 36 ACTAINF Leavens & Pigozzi, A Complete Algebraic Characterization of Behavioral Subtyping 2000 36 ACTAINF Ilie & Salomaa, On the Expressiveness of Subset-Sum Representations 2000 36 ACTAINF Bonner & Mecca, Querying Sequence Databases with Transducers 2000 36 ACTAINF Schmidt, How to Calculate Symmetries of Petri Nets 1999 36 ACTAINF Lundberg & Lennerstad, Optimal Bounds on the Gain of Permitting Dynamic Allocation of Communication Channels in Distributed Computing 1999 36 ACTAINF Dolev & Gouda & Schneider, Memory Requirements for Silent Stabilization 1999 36 ACTAINF Abolhassan & Keller & Paul, On the Cost-effectiveness of PRAMs 1999 36 ACTAINF Ravelo, Two Graph Algorithms Derived 1999 36 ACTAINF Degano & Priami & Leth & Thomsen, Causality for Debugging Mobile Agents 1999 36 ACTAINF Konikowska & Bialasik, Reasoning with First Order Nondeterministic Specifications 1999 36 ACTAINF Shen, Finding the k Most Vital Edges with respect to Minimum Spanning Tree 1999 36 ACTAINF Proietti, An Optimal Algorithm for Decomposing a Window into Maximal Quadtree Blocks 1999 36 ACTAINF Khardon & Mannila & Roth, Reasoning with Examples: Propositional Formulae and Database Dependencies 1999 36 ACTAINF Fiat & Woeginger, On-line Scheduling on a Single Machine: Minimizing the Total Completion Time 1999 36 ACTAINF Back & von Wright, Reasoning Algebraically about Loops 1999 36 ACTAINF Vincent, Semantic Foundations of 4NF in Relational Database Design 1999 36 ACTAINF Han & Igarashi, Parallel PROFIT/COST Algorithms through Fast Derandomization 1999 36 ACTAINF Cerna & Kretinsky & Kucera, Comparing Expressibility of Normed BPA and Normed BPP Processes 1999 36 ACTAINF Schewe & Thalheim, Towards a Theory of Consistency Enforcement 1999 36 ACTAINF Yen & Tang, An Optimal Algorithm for Solving the Searchlight Guarding Problem on Weighted Two-Terminal Series-Parallel Graphs 1999 36 ACTAINF Schenke & Olderog, Transformational Design of Real-time Systems. Part I: From Requirements to Program Specifications 1999 36 ACTAINF Schenke, Transformational Design of Real-time Systems. Part II: From Program Specifications to Programs 1998 35 ACTAINF Bijlsma & Nederpelt, Dijkstra-Scholten Predicate Calculus: Concepts and Misconceptions 1998 35 ACTAINF De Francesco & Santone, A Transformation System for Concurrent Processes 1998 35 ACTAINF Engelfriet & Gelsema, Axioms for Generalized Graphs, Illustrated by a Cantor-Bernstein Proposition 1998 35 ACTAINF Hwang, Asymptotic Expansions of the Mergesort Recurrences 1998 35 ACTAINF Back & Butler, Fusion and Simultaneous Execution in the Refinement Calculus 1998 35 ACTAINF Bidoit & Hennicker, Modular Correctness Proofs of Behavioural Implementations 1998 35 ACTAINF Sernadas & Sernadas & Caleiro, Denotational Semantics of Object Specification 1998 35 ACTAINF Moffat & Petersson & Wormald, A Tree-based Mergesort 1998 35 ACTAINF Sanlaville & Schmidt, Machine Scheduling with Availability Constraints 1998 35 ACTAINF Van den Bussche & Cabibbo, Converting Untyped Formulas to Typed Ones 1998 35 ACTAINF Beauquier & Slissenko, Polytime Model Checking for Timed Probabilistic Computation Tree Logic 1998 35 ACTAINF Caporaso & Zito, On a Relation between Uniform Coding and Problems of the Form DTIMEF(F) =? DSPACEF(F) 1998 35 ACTAINF Yen, Priority Conflict-free Petri Nets 1998 35 ACTAINF Shyr & Yu, Bi-catenation and Shuffle Product of Languages 1998 35 ACTAINF Fan & Shyr & Yu, d-Words and d-Languages 1998 35 ACTAINF Best & Fraczak & Hopkins & Klaudel & Pelz, M-Nets: An Algebra of High-Level Petri Nets, with an Application to the Semantics of Concurrent Programming Languages 1998 35 ACTAINF Larsen, Amortized Constant Relaxed Rebalancing Using Standard Rotations 1998 35 ACTAINF Wedler & Lengauer, On Linear List Recursion in Parallel 1998 35 ACTAINF Sibeyn, List Ranking on Meshes 1998 35 ACTAINF Diekert & Gastin, Approximating Traces 1998 35 ACTAINF Leung, On Finite Automata with Limited Nondeterminism 1998 35 ACTAINF Honkala, Decision Problems Concerning Thinness and Slenderness of Formal Languages 1998 35 ACTAINF Baldoni & Helary & Raynal, Consistent Records in Asynchronous Computations 1998 35 ACTAINF Sagiv & Francez & Rodeh & Wilhelm, A Logic-based Approach to Program Flow Analysis 1998 35 ACTAINF Esik & Bertol, Nonfinite Axiomatizability of the Equational Theory of Shuffle 1998 35 ACTAINF Laurent & Phan Luong & Spyratos, The Use of Deleted Tuples in Database Querying and Updating (Erratum) 1998 35 ACTAINF Boreale & Sangiorgi, A Fully Abstract Semantics for Causality in the pi-Calculus 1998 35 ACTAINF Kari & Paun & Rozenberg & Salomaa & Yu, DNA Computing, Sticker Systems, and Universality 1998 35 ACTAINF Yehuda & Fogel, Partitioning a Sequence into Few Monotone Subsequences 1998 35 ACTAINF Boreale & Sangiorgi, A Fully Abstract Semantics for Causality in the pi-Calculus 1998 35 ACTAINF Kari & Paun & Rozenberg & Salomaa & Yu, DNA Computing, Sticker Systems, and Universality 1998 35 ACTAINF Bar Yehuda & Fogel, Partitioning a Sequence into Few Monotone Subsequences 1998 35 ACTAINF Kourie & Oosthuizen, Lattices in Machine Learning: Complexity Issues 1998 35 ACTAINF Rabinovich, Modularity and Expressibility for Nets of Relations 1998 35 ACTAINF Buchholz & Kutrib, On Time Computability of Functions in One-Way Cellular Automata 1998 35 ACTAINF Locuratolo & Rabitti, Conceptual Classes and System Classes in Object Databases 1998 35 ACTAINF de la Vega & Paschos & Stafylopatis, Average-Case Complexity for the Execution of Recursive Definitions on Relational Databases 1998 35 ACTAINF Cheng & Kaminski, Context-free Languages over Infinite Alphabets 1998 35 ACTAINF Sanders, Data Refinement of Mixed Specifications. A Generalization of UNITY 1998 35 ACTAINF Back & Xu, Refinement of Fair Action Systems 1998 35 ACTAINF Andrei & Masalagiu, About the Collatz Conjecture 1998 35 ACTAINF Blondel, Structured Numbers. Properties of a Hierarchy of Operations on Binary Trees 1998 35 ACTAINF Kemp, Generating Words Lexicographically: An Average-Case Analysis 1997 34 ACTAINF Bruno & Coffman, Optimal Fault-Tolerant Computing on Multiprocessor Systems 1997 34 ACTAINF Laurent & Phan Luong & Spyratos, The Use of Deleted Tuples in Database, Querying and Updating 1997 34 ACTAINF ter Hofstede & Lippe & van der Weide, Applications of a Categorical Framework for Conceptual Data Modelling 1997 34 ACTAINF Corradini & Gorrieri & Roccetti, Performance Preorder and Competitive Equivalence 1997 34 ACTAINF Fernau, Unconditional Transfer in Regulated Rewriting 1997 34 ACTAINF Hemaspaandra & Rothe & Wechsung, Easy Sets and Hard Certificate Schemes 1997 34 ACTAINF Poetzsch-Heffter, Prototyping Realistic Programming Languages Based on Formal Specifications 1997 34 ACTAINF Engelfriet & Vereijken, Context-free Graph Grammars and Concatenation of Graphs 1997 34 ACTAINF Hsieh, A Fine-grained Data-Flow Analysis Framework 1997 34 ACTAINF Garg & Tomlinson, Using the Causal Domain to Specify and Verify Distributed Programs 1997 34 ACTAINF Burnetas & Solow & Agarwal, An Analysis and Implementation of an Efficient In-Place Bucket Sort 1997 34 ACTAINF Baier & Majster-Cederbaum, Metric Semantics from Partial Order Semantics 1997 34 ACTAINF Hui & Chanson, Minimal Communication Cost Software Construction in the Internet Environment 1997 34 ACTAINF Nymeyer & Katoen, Code Generation Based on Formal BURS Theory and Heuristic Search 1997 34 ACTAINF Aczel & Ertel, A New Formula for Speedup and Its Characterization 1997 34 ACTAINF Stephens, A Survey of Stream Processing 1997 34 ACTAINF Rangarajan & Huang & Tripathi, On the Scalability and Mean-Time to Failure of k Resilient Protocols 1997 34 ACTAINF Brisaboa & Hernandez, Testing Bag-Containment of Conjunctive Queries 1997 34 ACTAINF Trogemann & Gente, Performance Analysis of Parallel Programs Based on Directed Acyclic Graphs 1997 34 ACTAINF Efe & Eleser, An Optimal Emulator and VLSI Layout for Complete Binary Trees 1997 34 ACTAINF Barbuti & De Francesco & Santone, Algebraic Computational Models of OR-Parallel Execution of Prolog 1997 34 ACTAINF Yamazaki, A Hierarchy of the Class of Apex NLC Graph Languages by Bounds on the Number of Nonterminal Nodes in Productions 1997 34 ACTAINF Liang & Chang, Minimum Feedback Vertex Sets in Cocomparability Graphs and Convex Bipartite Graphs 1997 34 ACTAINF Culik & Dube, Implementing Daubechies Wavelet Transform with Weighted Finite Automata 1997 34 ACTAINF Janicki & Koutny, Fundamentals of Modelling Concurrency Using Discrete Relational Structures 1997 34 ACTAINF Morita & Nishihara & Yamamoto & Zhang, A Hierarchy of Uniquely Parsable Grammar Classes and Deterministic Acceptors 1997 34 ACTAINF Savicky & Wegener, Efficient Algorithms for the Transformation between Different Types of Binary Decision Diagrams 1997 34 ACTAINF Mitrana, On the Interdependence between Shuffle and Crossing-Over Operations 1997 34 ACTAINF Russmann, Dynamic LL(k) Parsing 1997 34 ACTAINF Corradini & De Nicola, Locality Based Semantics for Process Algebras 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 1997 74 ACTAMHUNG Benitez & Fernandez & Soriano, Suitable Norms for Simultaneous Approximation 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 1998 18 ADALTRS Brosgol, A Comparison of Ada and Java as a Foundation Teaching Language 1998 2 ADBIS Imielinski & Virmani, Association Rules... and What's Next? -- Towards Second Generation Data Mining Systems 1998 2 ADBIS Montebello, Optimizing Knowledge Discovery over the WWW 1984 2 ADCM Diffie & Hellman, An Introduction to Cryptography 1998 2 ADG Wu, Automatic Geometry Theorem-Proving and Automatic Geometry Problem-Solving 1998 2 ADG Dolzmann, Solving Geometric Problems with Real Quantifier Elimination 1998 2 ADG Yang & Hou & Xia, Automated Discovering and Proving for Geometric Inequalities 1998 2 ADG Fearnley-Sander, Plane Euclidean Reasoning 1998 2 ADG Yang & Zhang & Feng, A Clifford Algebraic Method for Geometric Reasoning 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 2000 25 ADVAM Cicalese & Mundici, Perfect Two-Fault Tolerant Search with Minimum Adaptiveness 2000 24 ADVAM Hagedorn, Determining the Number and Structure of Phylogenetic Invariants 1999 23 ADVAM Friedman, The Frequency Interpretation in Probability 1999 23 ADVAM Richter-Gebert, Testing Orientability for Matroids is NP-Complete 1999 22 ADVAM Althofer & Wenzel, k-Best Solutions under Distance Constraints in Valuated Delta-Matroids 1999 22 ADVAM Wenzel, A Unified Treatment of the Geometric Algebra of Matroids and Even Delta-Matroids 1999 22 ADVAM Cherlin & Shelah & Shi, Universal Graphs with Forbidden Subgraphs and Algebraic Closure 1998 21 ADVAM Peng & Yan, Balancing Game with a Buffer 1998 21 ADVAM Griggs & Ho, The Cycling of Partitions and Compositions under Repeated Shifts 1998 21 ADVAM Gravner & Griffeath, Cellular Automaton Growth on Z^2: Theorems, Examples, and Problems 1998 21 ADVAM Shao, Optimal Labellings of Rooted Directed Trees 1998 21 ADVAM Aguzzoli, The Complexity of McNaughton Functions of One Variable 1998 21 ADVAM Barnabei & Nicoletti & Pezzoli, Matroids on Partially Ordered Sets 1998 21 ADVAM Chen & Luk & Yau, Explicit Computation of Generalized Hamming Weights for Some Algebraic Geometric Codes 1998 21 ADVAM Morters, Symmetry Properties of Average Densities and Tangent Measure Distributions of Measures on the Line 1998 20 ADVAM Mavronicolas, A q-Analog of Approximate Inclusion-Exclusion 1997 19 ADVAM Venturini, On a Generalization of the 3x+1 Problem 1997 19 ADVAM Munarini, A Combinatorial Interpretation of the Generalized Fibonacci Numbers 1997 19 ADVAM Reidys, Random Induced Subgraphs of Generalized n-Cubes 1997 19 ADVAM Hwang & Yeh, Measures of Distinctness for Random Partitions and Compositions of an Integer 1997 19 ADVAM Konvalina, The Combinatorics of Discrete Self-Similarity 1997 19 ADVAM Talwar, On Calculating the Krohn-Rhodes Decomposition of Automata 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 1999 146 ADVMATH Voiculescu, The Analogues of Entropy and of Fisher's Information Measure in Free Probability Theory. VI. Liberation and Mutual Free Information 1999 143 ADVMATH Keisler, Randomizing a Model 1998 138 ADVMATH Chow, The Combinatorics behind Number-Theoretic Sieves 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 2000 ADWES Goossens & Rahtz & Gurari & Moore & Sutor, The LaTeX Web Companion, Integrating TeX, HTML, and XML 2000 ADWES Maruyama & Tamura & Uramoto, XML and Java: Developing Web Applications 2000 ADWES Andrews, Foundations of Multithreaded, Parallel, and Distributed Programming 2000 ADWES Brookshear, Computer Science: An Overview, Sixth Edition 1999 ADWES Budd, C++ for Java Programmers 1999 ADWES Rabhi & Lapalme, Algorithms: A Functional Programming Approach, Second Edition 1999 ADWES Lindholm & Yellin, The Java Virtual Machine Specification, Second Edition 1999 ADWES Kernighan & Pike, The Practice of Programming 1999 ADWES Thompson, Haskell: The Craft of Functional Programming, Second edition 1998 ADWES Sedgewick, Algorithms in C++, Third Edition, Parts 1-4 1998 ADWES Barnett, Discrete Mathematics: Numbers and Beyond 1998 ADWES Knuth, The Art of Computer Programming, Volume 3: Sorting and Searching, Second Edition 1998 ADWES Weiss, Data Structures and Problem Solving Using Java 1998 ADWES Savage, Models of Computation: Exploring the Power of Computing 1997 ADWES Lindholm & Yellin, The Java^TM Virtual Machine Specification 1997 ADWES Sudkamp, Languages and Machines: An Introduction to the Theory of Computer Science, Second Edition 1996 ADWES Gosling & Joy & Steele, The Java Language Specification 1996 ADWES Wirth, Compiler Construction 1996 ADWES Winograd (Ed.), Bringing Design to Software 1996 ADWES Francez & Forman, Interacting Processes: A Multiparty Approach to Coordinated Distributed Programming 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 1985 ADWES Kemeny & Kurtz & Snell, Computing for a Course in Finite Mathematics 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 2000 120 AIJ Kaplan & Schubert, A Computational Model of Belief 2000 119 AIJ Liberatore, The Complexity of Belief Update 2000 119 AIJ Boettcher & Percus, Nature's Way of Optimizing 2000 117 AIJ Valiant, Robust Logics 2000 117 AIJ Jonsson & Haslum & Backstrom, Towards Efficient Universal Planning: A Randomized Approach 2000 116 AIJ Rosati, On the Decidability and Complexity of Reasoning about Only Knowing 2000 116 AIJ Hirsch, Tractable Approximations for Temporal Constraint Handling 2000 116 AIJ del Val, On Some Tractable Classes in Deduction and Abduction 2000 116 AIJ Liberatore, On the Complexity of Choosing the Branching Literal in DPLL 1999 115 AIJ Drakengren & Bjareland, Reasoning about Action in Polynomial Time 1999 109 AIJ Jonsson & Drakengren & Backstrom, Computational Complexity of Relating Time Points with Intervals 1999 108 AIJ Cooper, Linear-Time Algorithms for Testing the Realisability of Line Drawings of Curved Objects 1999 108 AIJ Renz & Nebel, On the Complexity of Qualitative Spatial Reasoning: A Maximal Tractable Fragment of the Region Connection Calculus 1999 107 AIJ Greiner, The Complexity of Theory Revision 1999 107 AIJ Boros & Ibaraki & Makino, Logical Analysis of Binary Data with Missing Bits 1999 107 AIJ Chen & De Giacomo, Reasoning about Nondeterministic and Concurrent Actions: A Process Algebra Approach 1998 106 AIJ Korf, A Complete Anytime Algorithm for Number Partitioning 1998 106 AIJ Drakengren & Jonsson, A Complete Classification of Tractability in Allen's Algebra Relative to Subsets of Basic Relations 1998 106 AIJ Bylander, Worst-Case Analysis of the Perceptron and Exponentiated Update Algorithms 1998 105 AIJ Parodi & Lancewicki & Vijh & Tsotsos, Empirically-derived Estimates of the Complexity of Labeling Line Drawings of Polyhedral Scenes 1998 105 AIJ Schweikard & Schwarzer, Detecting Geometric Infeasibility 1998 102 AIJ Abdelbar & Hedetniemi, Approximating MAPs for Belief Networks is NP-hard and Other Theorems 1998 100 AIJ Mitchell, review of Davis, Handbook of Genetic Algorithms (Van Nostrand Reinhold, 1991) 1998 99 AIJ Jelasity & Dombi, GAS, a Concept on Modeling Species in Genetic Algorithms 1997 95 AIJ Friedman & Halpern, Modeling Belief in Dynamic Systems, Part I: Foundations 1997 95 AIJ Ammon, An Automatic Proof of Godel's Incompleteness Theorem (letter) 1997 93 AIJ Dagum & Luby, An Optimal Approximation Algorithm for Bayesian Inference 1997 91 AIJ Simon & Valdes-Perez & Sleeman, Scientific Discovery and Simplicity of Method (Editorial) 1997 91 AIJ Swanson & Smalheiser, An Interactive System for Finding Complementary Literatures: A Stimulus to Scientific Discovery 1997 91 AIJ Alberdi & Sleeman, ReTAX: A Step in the Automation of Taxonomic Revision 1997 91 AIJ de Ledesma & Perez & Borrajo & Laita, A Computational Approach to George Boole's Discovery of Mathematical Logic 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 1997 18 AIMAG Mitchell, Does Machine Learning Really Work? 1997 18 AIMAG Minker, Logic and Databases: Past, Present, and Future 1997 18 AIMAG Waltz, Artificial Intelligence: Realizing the Ultimate Promises of Computing 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 1998 4 AISMC Fitting, Bertrand Russell, Herbrand's Theorem, and the Assignment Statement 1998 4 AISMC Ballarin & Paulson, Reasoning About Coding Theory: The Benefits We Get from Computer Algebra 1998 4 AISMC Beeson, Automatic Generation of Epsilon-Delta Proofs of Continuity 1998 4 AISMC Fevre & Wang, Combining Algebraic Computing and Term-Rewriting for Geometry Theorem Proving 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 1997 2 AIZU Gu & Peng, The Shortest Routing Path in Star Graphs with Faulty Clusters 1997 2 AIZU Yoo & Youn, Finding Maximal Submeshes in 2D Mesh in the Presence of Failed Nodes 1997 2 AIZU Varshavsky & Marakhovsky, Global Synchronization of Asynchronous Arrays in Logical Time 1997 2 AIZU Bergogne & Cerin, A New Parallel Algorithm for the Parentheses-Matching Problem 1997 2 AIZU Huang & Ma & Kunii & Tsuboi, Parallel Genetic Algorithms for Communication Network Design 1997 2 AIZU Ma & Iwama & Takaoka & Gu, Efficient Parallel and Distributed Topological Sort Algorithms 1997 2 AIZU Ma & Iwama & Gu, A Parallel Algorithm for k-Minimum Spanning Trees 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 2000 36 ALGORITHMS Janssen & Krizanc & Narayanan & Shende, Distributed Online Frequency Assignment in Cellular Networks 2000 36 ALGORITHMS Barve & Kallahalla & Varman & Vitter, Competitive Parallel Disk Prefetching and Buffer Management 2000 36 ALGORITHMS Wu & Chao & Tang, A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees 2000 36 ALGORITHMS Dahlhaus, Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition 2000 36 ALGORITHMS Shparlinski, Computing Jacobi Symbols modulo Sparse Integers and Polynomials and Some Applications 2000 36 ALGORITHMS Havet, Finding an Oriented Hamiltonian Path in a Tournament 2000 36 ALGORITHMS Bhatia & Khuller & Naor, The Loading Time Scheduling Problem 2000 36 ALGORITHMS Amir & Calinescu, Alphabet-Independent and Scaled Dictionary Matching 2000 36 ALGORITHMS Niedermeier & Rossmanith, New Upper Bounds for Maximum Satisfiability 2000 36 ALGORITHMS Promel & Steger, A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3 2000 36 ALGORITHMS Allauzen & Raffinot, Simple Optimal String Matching Algorithm 2000 35 ALGORITHMS Blum, Speeding Up Dynamic Programming without Omitting any Optimal Solution and Some Applications in Molecular Biology 2000 35 ALGORITHMS Alstrup & Thorup, Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees 2000 35 ALGORITHMS Thorup, Floats, Integers, and Single Source Shortest Paths 2000 35 ALGORITHMS Hsu, On Four-Connecting a Triconnected Graph 2000 35 ALGORITHMS Nedev & Wood, A Polynomial-Time Algorithm for Finding Regular Simple Paths in Outerplanar Graphs 2000 35 ALGORITHMS Westbrook, Load Balancing for Response Time 2000 35 ALGORITHMS Dyer & Greenhill, On Markov Chains for Independent Sets 2000 35 ALGORITHMS Hsieh & Ho & Hsu & Ko & Chen, A Faster Implementation of a Parallel Tree Contraction Scheme and Its Application on Distance-Hereditary Graphs 2000 35 ALGORITHMS Amir & Lewenstein & Lewenstein, Pattern Matching in Hypertext 2000 35 ALGORITHMS Roelants van Baronaigien, A Loopless Gray-Code Algorithm for Listing k-ary Trees 2000 35 ALGORITHMS Berman & Charikar & Karpinski, On-Line Load Balancing for Related Machines 2000 35 ALGORITHMS Villard, Processor Efficient Parallel Solution of Linear Systems of Equations 2000 34 ALGORITHMS Asahiro & Iwama & Tamaki & Tokuyama, Greedily Finding a Dense Subgraph 2000 34 ALGORITHMS Henzinger & Rao & Gabow, Computing Vertex Connectivity: New Bounds from Old Techniques 2000 34 ALGORITHMS Frigioni & Marchetti-Spaccamela & Nanni, Fully Dynamic Algorithms for Maintaining Shortest Paths Trees 2000 34 ALGORITHMS Chrobak & Noga, Competitive Algorithms for Relaxed List Update and Multilevel Caching 2000 34 ALGORITHMS Korsh & LaFollette, Multiset Permutations and Loopless Generation of Ordered Trees with Specified Degree Sequence 2000 34 ALGORITHMS Chan & Chin, Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids 2000 34 ALGORITHMS Goldman & Parwatikar & Suri, Online Scheduling with Hard Deadlines 2000 34 ALGORITHMS Kapoor & Rizzi, Edge-Coloring Bipartite Graphs 2000 34 ALGORITHMS Muthukrishnan, Simple Optimal Parallel Multiple Pattern Matching 2000 34 ALGORITHMS Hofting & Wanke, Polynomial-Time Analysis of Toroidal Periodic Graphs 2000 34 ALGORITHMS Shahrokhi & Shi, On Crossing Sets, Disjoint Sets, and Pagenumber 2000 34 ALGORITHMS Jansen, Approximation Results for the Optimum Cost Chromatic Partition Problem 2000 34 ALGORITHMS Wang, Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network 2000 34 ALGORITHMS Attiya, Efficient and Robust Sharing of Memory in Message-Passing Systems 2000 34 ALGORITHMS Berthome & Hagerup & Newman & Schuster, Self-Simulation for the Passive Optical Star 2000 34 ALGORITHMS Galli, Average Costs of a Graph Exploration: Upper and Lower Bounds 2000 34 ALGORITHMS Ahuja & Orlin, A Faster Algorithm for the Inverse Spanning Tree Problem 2000 34 ALGORITHMS Jiang & Kearney & Li, Some Open Problems in Computational Molecular Biology 1999 33 ALGORITHMS Pritchard, On Computing the Subset Graph of a Collection of Sets 1999 33 ALGORITHMS Huang & Rao, Interpolation of Sparse Multivariate Polynomials over Large Finite Fields with Applications 1999 33 ALGORITHMS Thorup, Decremental Dynamic Connectivity 1999 33 ALGORITHMS Frederickson & Solis-Oba, Increasing the Weight of Minimum Spanning Trees 1999 33 ALGORITHMS Shamir & Tsur, Faster Subtree Isomorphism 1999 33 ALGORITHMS Panaite & Pelc, Exploring Unknown Undirected Graphs 1999 33 ALGORITHMS Bertsimas & Gamarnik, Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing 1999 33 ALGORITHMS Pisinger, Linear Time Algorithms for Knapsack Problems with Bounded Weights 1999 33 ALGORITHMS Cheriyan & Thurimella, Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation 1999 33 ALGORITHMS Fleischer, Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time 1999 33 ALGORITHMS Charikar & Chekuri & Cheung & Dai & Goel & Guha & Li, Approximation Algorithms for Directed Steiner Problems 1999 33 ALGORITHMS Krumke & Marathe & Noltemeier & Ravi & Ravi & Sundaram & Wirth, Improving Minimum Cost Spanning Trees by Upgrading Nodes 1999 33 ALGORITHMS Subramanian, Minimum Coloring k-Colorable Graphs in Polynomial Average Time 1999 33 ALGORITHMS Yeo, A Polynomial Time Algorithm for Finding a Cycle Covering a Given Set of Vertices in a Semicomplete Multipartite Digraph 1999 33 ALGORITHMS Lopez & Reisner, Algorithms for Polyhedral Approximation of Multidimensional Ellipsoids 1999 33 ALGORITHMS Frieze & Molloy, Splitting an Expander Graph 1999 33 ALGORITHMS Alon & Sudakov, On Two Segmentation Problems 1999 32 ALGORITHMS Bonizzoni & Della Vedova, An Algorithm for the Modular Decomposition of Hypergraphs 1999 32 ALGORITHMS Provan & Burk, Two-Connected Augmentation Problems in Planar Graphs 1999 32 ALGORITHMS Gil & Itai, How to Pack Trees 1999 32 ALGORITHMS Klarlund, An n log n Algorithm for Online BDD Refinement 1999 32 ALGORITHMS Li & Zhang, Twist-Rotation Transformations of Binary Trees and Arithmetic Expressions 1999 32 ALGORITHMS Bodlaender & Thilikos, Graphs with Branchwidth at Most Three 1999 32 ALGORITHMS Milidiu & Laber & Pessoa, Bounding the Compression Loss of the FGK Algorithm 1999 32 ALGORITHMS Bshouty, Lower Bounds for the Complexity of Functions in a Realistic RAM Model 1999 32 ALGORITHMS Auletta & Dinitz & Nutov & Parente, A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph 1999 32 ALGORITHMS Dinitz & Nutov, A 3-Approximation Algorithm for Finding Optimum 4,5-Vertex-Connected Spanning Subgraphs 1999 32 ALGORITHMS Kloks & Kratsch & Muller, Approximating the Bandwidth for Asteroidal Triple-Free Graphs 1999 32 ALGORITHMS Gobel & Walter, Bases for Polynomial Invariants of Conjugates of Permutation Groups 1999 32 ALGORITHMS Miller & Talmor & Teng, Erratum: ``Optimal Coarsening of Unstructured Meshes'' 1999 31 ALGORITHMS Bender & Canfield, An Approximate Probabilistic Model for Structured Gaussian Elimination 1999 31 ALGORITHMS Ferragina & Grossi, Improved Dynamic Text Indexing 1999 31 ALGORITHMS Saks & Zaharoglou, Optimal Space Distributed Order-Preserving Lists 1999 31 ALGORITHMS Mahajan & Raman, Parameterizing above Guaranteed Values: MaxSat and MaxCut 1999 31 ALGORITHMS Basch & Guibas & Hershberger, Data Structures for Mobile Data 1999 31 ALGORITHMS Miller & Talmor & Teng, Optimal Coarsening of Unstructured Meshes 1999 31 ALGORITHMS LaMarca & Ladner, The Influence of Caches on the Performance of Sorting 1999 31 ALGORITHMS Meyer auf der Heide & Vocking, Shortest-Path Routing in Arbitrary Networks 1999 31 ALGORITHMS Kantor & Luks & Mark, Sylow Subgroups in Parallel 1999 31 ALGORITHMS Faigle & Kern & Nawijn, A Greedy On-Line Algorithm for the k-Track Assignment Problem 1999 31 ALGORITHMS Fujito, Approximating Node-Deletion Problems for Matroidal Properties 1999 31 ALGORITHMS Guha & Khuller, Greedy Strikes Back: Improved Facility Location Algorithms 1999 31 ALGORITHMS Bazgan & Santha & Tuza, On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs 1999 30 ALGORITHMS Cohen & Lewis, Approximating Matrix Multiplication for Pattern Recognition Tasks 1999 30 ALGORITHMS Nagamochi & Ibaraki, Augmenting Edge-Connectivity over the Entire Range in O~(nm) Time 1999 30 ALGORITHMS Amenta & Bern & Eppstein, Optimal Point Placement for Mesh Smoothing 1999 30 ALGORITHMS Chudak & Shmoys, Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds 1999 30 ALGORITHMS Booth & Govindan & Langston & Ramachandramurthi, Fast Algorithms for K_4 Immersion Testing 1999 30 ALGORITHMS Dolev & Kranakis & Krizanc, Baked-Potato Routing 1999 30 ALGORITHMS Lustig & Shmueli, Acyclic Hypergraph Projections 1999 30 ALGORITHMS Chen & Hwang & Chen, The Cost Distribution of Queue-Mergesort, Optimal Mergesorts, and Power-of-2 Rules 1999 30 ALGORITHMS Andersson, General Balanced Trees 1999 30 ALGORITHMS Shi & Spencer, Time-Work Tradeoffs of the Single-Source Shortest Paths Problem 1999 30 ALGORITHMS Dietz & Raman, Small-Rank Selection in Parallel, with Applications to Heap Construction 1999 30 ALGORITHMS Teng, Low Energy and Mutually Distant Sampling 1999 30 ALGORITHMS Afek & Weisberger, The Instancy of Snapshots and Commuting Objects 1999 30 ALGORITHMS Afek & Mansour & Ostfeld, Convergence Complexity of Optimistic Rate-Based Flow-Control Algorithms 1999 30 ALGORITHMS Kutten & Peleg, Fault-Local Distributed Mending 1999 30 ALGORITHMS Brandstadt & Chepoi & Dragan, Distance Approximating Trees for Chordal and Dually Chordal Graphs 1999 30 ALGORITHMS Yanez & Montero, A Poset Dimension Algorithm 1998 29 ALGORITHMS Schieber, Computing a Minimum Weight k-Link Path in Graphs with the Concave Monge Property 1998 29 ALGORITHMS Kannan & Proebsting, Register Allocation in Structured Programs 1998 29 ALGORITHMS Chew & Kedem & Sharir & Tagansky & Welzl, Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions 1998 29 ALGORITHMS Andersson & Petersson, Approximate Indexed Lists 1998 29 ALGORITHMS Lueker, Average-Case Analysis of Off-Line and On-Line Knapsack Problems 1998 29 ALGORITHMS Ajtai & Aspnes & Naor & Rabani & Schulman & Waarts, Fairness in Scheduling 1998 29 ALGORITHMS Aiello & Rajagopalan & Venkatesan, Design of Practical and Provably Good Random Number Generators 1998 29 ALGORITHMS Kahale & Leighton, Greedy Dynamic Routing on Arrays 1998 29 ALGORITHMS Borchers & Du & Gao & Wan, The k-Steiner Ratio in the Rectilinear Plane 1998 29 ALGORITHMS Breslauer & Colussi & Toniolo, On the Comparison Complexity of the String Prefix-Matching Problem 1998 29 ALGORITHMS Rajasekaran, Selection on Mesh Connected Computers with Fixed and Reconfigurable Buses 1998 29 ALGORITHMS Arikati & Chaudhuri & Zaroliagis, All-Pairs Min-Cut in Sparse Networks 1998 29 ALGORITHMS Kearney & Corneil, Tree Powers 1998 29 ALGORITHMS Lu & Ravi, Approximating Maximum Leaf Spanning Trees in Almost Linear Time 1998 29 ALGORITHMS Kao & Ma & Sipser & Yin, Optimal Constructions of Hybrid Algorithms 1998 29 ALGORITHMS Walsh, Generation of Well-Formed Parenthesis Strings in Constant Worst-Case Time 1998 29 ALGORITHMS Hochbaum, Approximating Clique and Biclique Problems 1998 28 ALGORITHMS Berkman & Matias & Ragde, Triply-Logarithmic Parallel Upper Bounds for Minimum and Range Minima over Small Domains 1998 28 ALGORITHMS Ho & Sung & Hsu & Tsai & Hwang, The Recognition of Double Euler Trails in Series-Parallel Networks 1998 28 ALGORITHMS Chen, Quadripartite Sort 1998 28 ALGORITHMS Kloks & Kratsch & Wong, Minimum Fill-in on Circle and Circular-Arc Graphs 1998 28 ALGORITHMS Gazit & Reif, A Randomized Parallel Algorithm for Planar Graph Isomorphism 1998 28 ALGORITHMS Mitra & Nandy, Efficient Computation of Rectilinear Geodesic Voronoi Neighbor in the Presence of Obstacles 1998 28 ALGORITHMS Bar-Noy & Kortsarz, Minimum Color Sum of Bipartite Graphs 1998 28 ALGORITHMS Larmore & Przytycka, The Optimal Alphabetic Tree Problem Revisited 1998 28 ALGORITHMS Zhang, The Variance of Two Game Tree Algorithms 1998 28 ALGORITHMS Kutten & Peleg, Fast Distributed Construction of Small k-Dominating Sets and Applications 1998 28 ALGORITHMS Awerbuch & Bartal & Fiat, Distributed Paging for General Networks 1998 28 ALGORITHMS Fernandes, A Better Approximation Ratio for the Minimum Size k-Edge-Connected Spanning Subgraph Problem 1998 28 ALGORITHMS Kolliopoulos & Stein, Finding Real-Valued Single-Source Shortest Paths in o(n^3) Expected Time 1998 28 ALGORITHMS Marathe & Ravi & Sundaram & Ravi & Rosenkrantz & Hunt, Bicriteria Network Design Problems 1998 28 ALGORITHMS Foata & Han, Transformations on Words 1998 28 ALGORITHMS Khuller, Problems 1998 27 ALGORITHMS Propp & Wilson, How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph 1998 27 ALGORITHMS Kenyon & Rabani & Sinclair, Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing 1998 27 ALGORITHMS Kamath & Palmon & Plotkin, Routing and Admission Control in General Topology Networks with Poisson Arrivals 1998 27 ALGORITHMS Panigrahy & Vishwanathan, An O(log* n) Approximation Algorithm for the Asymmetric p-Center Problem 1998 27 ALGORITHMS Calinescu & Fernandes & Finkler & Karloff, A Better Approximation Algorithm for Finding Planar Subgraphs 1998 27 ALGORITHMS Levcopoulos & Krznaric, Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation 1998 27 ALGORITHMS Lupton & Maley & Young, Data Collection for the Sloan Digital Sky Survey--A Network-Flow Heuristic 1998 27 ALGORITHMS Gavoille & Guevremont, Worst Case Bounds for Shortest Path Interval Routing 1998 27 ALGORITHMS Galluccio & Loebl, Even Directed Cycles in H-Free Digraphs 1998 27 ALGORITHMS Dor, The Greedy Search Algorithm on Binary Vectors 1998 27 ALGORITHMS Motwani, Realization of Matrices and Directed Graphs 1998 27 ALGORITHMS Albers & Koga, New On-Line Algorithms for the Page Replication Problem 1998 27 ALGORITHMS Hebert, Cyclic Interlaced Quadtree Algorithms for Quincunx Multiresolution 1998 27 ALGORITHMS Gordon, A Survey of Fast Exponentiation Methods 1998 27 ALGORITHMS Chan, Deterministic Algorithms for 2-d Convex Programming and 3-d Online Linear Programming 1998 26 ALGORITHMS Mirolo, Convex Minimization on a Grid and Applications 1998 26 ALGORITHMS Hunt & Marathe & Radhakrishnan & Ravi & Rosenkrantz & Stearns, NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs 1998 26 ALGORITHMS Squire, Generating the Acyclic Orientations of a Graph 1998 26 ALGORITHMS Makino & Ibaraki, A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions 1998 26 ALGORITHMS McKay, Isomorph-Free Exhaustive Generation 1998 26 ALGORITHMS Narayanan & Nishimura, Interval Routing on k-Trees 1998 26 ALGORITHMS Chen, More Efficient Algorithm for Ordered Tree Inclusion 1998 26 ALGORITHMS Aspnes & Hurwood, Spreading Rumors Rapidly Despite an Adversary 1998 26 ALGORITHMS MacKenzie & Stout, Ultrafast Expected Time Parallel Algorithms 1998 26 ALGORITHMS Sunder & He, Scheduling Interval Ordered Tasks in Parallel 1998 26 ALGORITHMS Gabow, Algorithms for Graphic Polymatroids and Parametric s^bar-Sets 1998 26 ALGORITHMS Auletta & Parente & Persiano, Placing Resources on a Growing Line 1998 26 ALGORITHMS Elmallah & Stewart, Polygon Graph Recognition 1998 26 ALGORITHMS Agarwal & Condon, On Approximation Algorithms for Hierarchical MAX-SAT 1998 26 ALGORITHMS Chen, Efficient Approximation Schemes for Maximization Problems on K_{3,3}-free or K_5-free Graphs 1998 26 ALGORITHMS Goldberg & Goldberg & Phillips & Sorkin, Constructing Computer Virus Phylogenies 1997 25 ALGORITHMS Klein & Subramanian, A Randomized Parallel Algorithm for Single-Source Shortest Paths 1997 25 ALGORITHMS Hare, Computing the Principal Branch of log-Gamma 1997 25 ALGORITHMS Slavik, A Tight Analysis of the Greedy Algorithm for Set Cover 1997 25 ALGORITHMS Wang & Gusfield, Improved Approximation Algorithms for Tree Alignment 1997 25 ALGORITHMS Bekesi & Galambos & Pferschy & Woeginger, Greedy Algorithms for On-Line Data Compression 1997 25 ALGORITHMS Azar & Epstein, On Two Dimensional Packing 1997 25 ALGORITHMS Luczak & Szymanska, A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph 1997 25 ALGORITHMS Korsh & Lipschutz, Generating Multiset Permutations in Constant Time 1997 25 ALGORITHMS Bhattacharya & Kaller, An O(m + n log n) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs 1997 25 ALGORITHMS Berger & Shor, Tight Bounds for the Maximum Acyclic Subgraph Problem 1997 25 ALGORITHMS Dietzfelbinger & Hagerup & Katajainen & Penttonen, A Reliable Randomized Algorithm for the Closest-Pair Problem 1997 25 ALGORITHMS Habib & Nourine & Steiner, Gray Codes for the Ideals of Interval Orders 1997 25 ALGORITHMS Heydari & Sudborough, On the Diameter of the Pancake Network 1997 25 ALGORITHMS Afek & Stupp, Optimal Time-Space Tradeoff for Shared Memory Leader Election 1997 25 ALGORITHMS Krivelevich, Approximate Set Covering in Uniform Hypergraphs 1997 25 ALGORITHMS Barbeau & Kabanza & St-Denis, An Efficient Algorithm for Controller Synthesis under Full Observation 1997 25 ALGORITHMS Alon & Kozlov, Coins with Arbitrary Weights 1997 25 ALGORITHMS Bhattacharya & Sen, On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm 1997 25 ALGORITHMS Yao & Yao, Dictionary Look-Up with One Error 1997 24 ALGORITHMS Moran & Taubenfeld, A Lower Bound on Wait-Free Counting 1997 24 ALGORITHMS Haldar, An `All Pairs Shortest Paths' Distributed Algorithm Using 2n^2 Messages 1997 24 ALGORITHMS Frederickson, A Data Structure for Dynamically Maintaining Rooted Trees 1997 24 ALGORITHMS Hambrusch & Tu, Edge Weight Reduction Problems in Directed Acyclic Graphs 1997 24 ALGORITHMS Bodlaender & Engelfriet, Domino Treewidth 1997 24 ALGORITHMS Chrobak & Larmore & Reingold & Westbrook, Page Migration Algorithms Using Work Functions 1997 24 ALGORITHMS Even & Litman & Winkler, Computing with Snakes in Directed Networks of Automata 1997 24 ALGORITHMS Broder & Mayr, Counting Minimum Weight Spanning Trees 1997 24 ALGORITHMS Eppstein & Hirschberg, Choosing Subsets with Maximum Weighted Average 1997 24 ALGORITHMS Henzinger, A Static 2-Approximation Algorithm for Vertex Connectivity and Incremental Approximation Algorithms for Edge and Vertex Connectivity 1997 23 ALGORITHMS Loebl & Nesetril, Linearity and Unprovability of Set Union Problem Strategies. I. Linearity of Strong Postorder 1997 23 ALGORITHMS Plaxton & Suel, Lower Bounds for Shellsort 1997 23 ALGORITHMS Bartal & Rosen, The Distributed k-Server Problem--A Competitive Distributed Translator for k-Server Algorithms 1997 23 ALGORITHMS Halldorsson, Parallel and On-Line Graph Coloring 1997 23 ALGORITHMS Shioura & Uno, A Linear Time Algorithm for Finding a k-Tree Core 1997 23 ALGORITHMS Higham & Kirkpatrick & Abrahamson & Adler, Optimal Algorithms for Probabilistic Solitude Detection on Anonymous Rings 1997 23 ALGORITHMS Wang, Tighter Bounds on the Solution of a Divide-and-Conquer Maximin Recurrence 1997 23 ALGORITHMS Brinkmann & Dress, A Constructive Enumeration of Fullerenes 1997 23 ALGORITHMS Zhou & Suzuki & Nishizeki, An NC Parallel Algorithm for Edge-Coloring Series-Parallel Multigraphs 1997 23 ALGORITHMS Eppstein, Minimum Range Balanced Cuts via Dynamic Subset Sums 1997 23 ALGORITHMS Bradford & Fleischer & Smid, More Efficient Parallel Totally Monotone Matrix Searching 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 2000 28 ALGRTHMICA Seiden, Online Randomized Multiprocessor Scheduling 2000 28 ALGRTHMICA Chen & Chen & Wada & Kawaguchi, Parallel Algorithms for Partitioning Sorted Sets and Related Problems 2000 28 ALGRTHMICA Ruppert, Finding the k Shortest Paths in Parallel 2000 28 ALGRTHMICA Gonzalez, Simple Algorithms for the On-Line Multidimensional Dictionary and Related Problems 2000 28 ALGRTHMICA Blomer, Denesting by Bounded Degree Radicals 2000 28 ALGRTHMICA Brandes & Wagner, A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs 2000 28 ALGRTHMICA Diks & Pelc, Optimal Adaptive Broadcasting with a Bounded Fraction of Faulty Nodes 2000 28 ALGRTHMICA Djidjev, Partitioning Planar Graphs with Vertex Costs: Algorithms and Applications 2000 28 ALGRTHMICA Frigioni & Italiano, Dynamically Switching Vertices in Planar Graphs 2000 28 ALGRTHMICA Grebinski & Kucherov, Optimal Reconstruction of Graphs under the Additive Model 2000 28 ALGRTHMICA Kalyanasundaram & Pruhs, Fault-Tolerant Real-Time Scheduling 2000 28 ALGRTHMICA Trevisan, Approximating Satisfiable Satisfiability Problems 2000 27 ALGRTHMICA Chaudhuri & Zaroliagis, Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms 2000 27 ALGRTHMICA Zhou & Fuse & Nishizeki, A Linear Algorithm for Finding [g,f]-Colorings of Partial k-Trees 2000 27 ALGRTHMICA Alstrup & Lauridsen & Thorup, Generalized Dominators for Structured Programs 2000 27 ALGRTHMICA Gupta & Kaller & Shermer, Linear-Time Algorithms for Partial k-Tree Complements 2000 27 ALGRTHMICA Eppstein, Diameter and Treewidth in Minor-Closed Graph Families 2000 27 ALGRTHMICA Hagerup, Dynamic Algorithms for Graphs of Bounded Treewidth 2000 27 ALGRTHMICA Lucet & Manouvrier & Carlier, Evaluating Network Reliability and 2-Edge-Connected Reliability in Linear Time for Bounded Pathwidth Graphs 2000 27 ALGRTHMICA Dessmark & Lingas & Proskurowski, Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-Trees 2000 27 ALGRTHMICA Kaller, Definability Equals Recognizability of Partial 3-Trees and k-Connected Partial k-Trees 2000 27 ALGRTHMICA Aspvall & Telle & Proskurowski, Memory Requirements for Table Computations in Partial k-Tree Algorithms 2000 27 ALGRTHMICA Peng & Ko & Ho & Hsu & Tang, Graph Searching on Some Subclasses of Chordal Graphs 2000 27 ALGRTHMICA Trevisan, Erratum: A Correction to ``Parallel Approximation Algorithms by Positive Linear Programming'' 2000 27 ALGRTHMICA Kapoor & Ramesh, An Algorithm for Enumerating All Spanning Trees of a Directed Graph 2000 27 ALGRTHMICA Bar-Yehuda, One for the Price of Two: a Unified Approach for Approximating Covering Problems 2000 27 ALGRTHMICA Navarro & Barbosa & Baeza-Yates & Cunto & Ziviani, Binary Searching with Nonuniform Costs and Its Application to Text Retrieval 2000 27 ALGRTHMICA Schomer & Sellen & Teichmann & Yap, Smallest Enclosing Cylinders 2000 27 ALGRTHMICA Sajith & Saxena, Optimal Sublogarithmic Time Parallel Algorithms on Rooted Forests 2000 27 ALGRTHMICA Guttmann-Beck & Hassin, Approximation Algorithms for Minimum K -Cut 2000 27 ALGRTHMICA Sugihara & Iri & Inagaki & Imai, Topology-Oriented Implementation--An Approach to Robust Geometric Algorithms 2000 27 ALGRTHMICA Bronnimann & Yvinec, Efficient Exact Evaluation of Signs of Determinants 2000 27 ALGRTHMICA Milenkovic, Shortest Path Geometric Rounding 2000 27 ALGRTHMICA Burnikel & Fleischer & Mehlhorn & Schirra, A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Radicals 2000 27 ALGRTHMICA Bajaj & Royappa, Parameterization in Finite Precision 2000 26 ALGRTHMICA Akella & Huang & Lynch & Mason, Parts Feeding on a Conveyor with a One Joint Robot 2000 26 ALGRTHMICA Teichmann & Mishra, Probabilistic Algorithms for Efficient Grasping and Fixturing 2000 26 ALGRTHMICA Briggs & Donald, Visibility-Based Planning of Sensor Control Strategies 2000 26 ALGRTHMICA Bohringer & Bhatt & Donald & Goldberg, Algorithms for Sensorless Manipulation Using a Vibrating Surface 2000 26 ALGRTHMICA LaValle, Robot Motion Planning: A Game-Theoretic Foundation 2000 26 ALGRTHMICA Sudsang, Grasping and In-Hand Manipulation: Geometry and Algorithms 2000 26 ALGRTHMICA van der Stappen & Goldberg, Geometric Eccentricity and the Complexity of Manipulation Plans 2000 26 ALGRTHMICA Brown & Donald, Mobile Robot Self-Localization without Explicit Landmarks 2000 26 ALGRTHMICA Marigo & Ceccarelli & Piccinocchi & Bicchi, Planning Motions of Polyhedral Parts by Rolling 2000 26 ALGRTHMICA Halperin & Latombe & Wilson, A General Framework for Assembly Planning: The Motion Space Approach 2000 26 ALGRTHMICA Arkin & Held & Smith, Optimization Problems Related to Zigzag Pocket Machining 2000 26 ALGRTHMICA Berthome & Ferreira & Maggs & Perennes & Plaxton, Sorting-Based Selection Algorithms for Hypercubic Networks 2000 26 ALGRTHMICA Chang & Yap, A Simultaneous Search Problem 2000 26 ALGRTHMICA Andrews & Atallah & Chen & Lee, Parallel Algorithms for Maximum Matching in Complements of Interval Graphs and Related Problems 2000 26 ALGRTHMICA Uno & Yagiura, Fast Algorithms to Enumerate All Common Intervals of Two Permutations 2000 26 ALGRTHMICA Zhou & Tamura & Nishizeki, Finding Edge-Disjoint Paths in Partial k -Trees 2000 26 ALGRTHMICA Chaudhuri & Subrahmanyam & Wagner & Zaroliagis, Computing Mimicking Networks 2000 26 ALGRTHMICA Nagamochi & Nakamura & Ibaraki, A Simplified O~(nm) Time Edge-Splitting Algorithm in Undirected Graphs 2000 26 ALGRTHMICA Fossmeier & Kaufmann, On Exact Solutions for the Rectilinear Steiner Tree Problem, Part I: Theoretical Results 2000 26 ALGRTHMICA Papakostas & Tollis, Efficient Orthogonal Drawings of High Degree Graphs 2000 26 ALGRTHMICA Weihe & Willhalm, Reconstructing the Topology of a CAD Model--a Discrete Approach 2000 26 ALGRTHMICA Mohring & Muller-Hannemann, Complexity and Modeling Aspects of Mesh Refinement into Quadrilaterals 2000 26 ALGRTHMICA Junger & Rinaldi, Practical Performance of Efficient Minimum Cut Algorithms 1999 25 ALGRTHMICA Boyar & Larsen, The Seat Reservation Problem 1999 25 ALGRTHMICA Zachariasen & Winter, Concatenation-Based Greedy Heuristics for the Euclidean Steiner Tree Problem 1999 25 ALGRTHMICA Kunde & Niedermeier & Reinhardt & Rossmanith, Optimal Deterministic Sorting and Routing on Grids and Tori with Diagonals 1999 25 ALGRTHMICA Reif, Parallel Biomolecular Computation: Models and Simulations 1999 25 ALGRTHMICA DasGupta & He & Jiang & Li & Tromp, On the Linear-Cost Subtree-Transfer Distance between Phylogenetic Trees 1999 25 ALGRTHMICA Kearney & Hayward & Meijer, Evolutionary Trees and Ordinal Assertions 1999 25 ALGRTHMICA Beigel & Fu, Molecular Computing, Bounded Nondeterminism, and Efficient Recursion 1999 25 ALGRTHMICA Ogihara & Ray, Simulating Boolean Circuits on a DNA Computer 1999 25 ALGRTHMICA Atteson, The Performance of Neighbor-Joining Methods of Phylogenetic Reconstruction 1999 25 ALGRTHMICA Atkins & Hart, On the Intractability of Protein Folding with a Finite Alphabet of Amino Acids 1999 25 ALGRTHMICA Parida & Geiger, Mass Estimation of DNA Molecules and Extraction of Ordered Restriction Maps in Optical Mapping Imagery 1999 25 ALGRTHMICA Cryan & Goldberg & Phillips, Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem 1999 25 ALGRTHMICA Ip & Fischetti & Schmidt, An Algorithm for Identifying Similar Amino Acid Clusters among Different Alpha-Helical Coiled-Coil Proteins Using Their Secondary Structure 1999 25 ALGRTHMICA Finn & Kavraki, Computational Approaches to Drug Design 1999 25 ALGRTHMICA Emiris & Mourrain, Computer Algebra Methods for Studying and Computing Molecular Conformations 1999 25 ALGRTHMICA Chalasani & Jha & Saias, Approximate Option Pricing 1999 25 ALGRTHMICA Azar & Bartal & Feuerstein & Fiat & Leonardi & Rosen, On Capital Investment 1999 25 ALGRTHMICA Lambert & Harrington & Harvey & Glodjo, Efficient On-Line Nonparametric Kernel Density Estimation 1999 25 ALGRTHMICA Kontoghiorghes, Parallel Strategies for Computing the Orthogonal Factorizations Used in the Estimation of Econometric Models 1999 25 ALGRTHMICA Coyle & Yang, Analysis of the SSAP Method for the Numerical Valuation of High-Dimensional Multivariate American Securities 1999 25 ALGRTHMICA al-Binali, A Risk-Reward Framework for the Competitive Analysis of Financial Games 1999 25 ALGRTHMICA El-Yaniv & Kaniel & Linial, Competitive Optimal On-Line Leasing 1999 24 ALGRTHMICA Ferragina & Luccio, String Search in Coarse-Grained Parallel Computers 1999 24 ALGRTHMICA Ferreira & Kenyon & Rau-Chaplin & Ubeda, d-Dimensional Range Search on Multicomputers 1999 24 ALGRTHMICA Baumker & Dittrich & Pietracaprina, The Complexity of Parallel Multisearch on Coarse-Grained Machines 1999 24 ALGRTHMICA Blelloch & Hardwick & Miller & Talmor, Design and Implementation of a Practical Parallel Delaunay Algorithm 1999 24 ALGRTHMICA Deng & Zhu, A Randomized Algorithm for the Voronoi Diagram of Line Segments on Coarse-Grained Multiprocessors 1999 24 ALGRTHMICA McColl & Tiskin, Memory-Efficient Matrix Multiplication in the BSP Model 1999 24 ALGRTHMICA Lim & Bhat & Prasanna, Efficient Algorithms for Block-Cyclic Redistribution of Arrays 1999 24 ALGRTHMICA Kaltofen & Lobo, Distributed Matrix-Free Solution of Large Sparse Linear Systems over Finite Fields 1999 24 ALGRTHMICA Cormen & Clippinger, Performing BMMC Permutations Efficiently on Distributed-Memory Multiprocessors with MPI 1999 24 ALGRTHMICA Saukas & Song, A Note on Parallel Selection on Coarse-Grained Multicomputers 1999 24 ALGRTHMICA Adler & Gibbons & Matias & Ramachandran, Modeling Parallel Bandwidth: Local versus Global Restrictions 1999 24 ALGRTHMICA Bilardi & Herley & Pietracaprina & Pucci & Spirakis, BSP versus LogP 1999 24 ALGRTHMICA Fu & Beigel, A Comparison of Resource-Bounded Molecular Computation Models 1999 24 ALGRTHMICA Kaplan & Shamir, Bounded Degree Interval Sandwich Problems 1999 24 ALGRTHMICA Yamazaki & Bodlaender & de Fluiter & Thilikos, Isomorphism for Graphs of Bounded Distance Width 1999 24 ALGRTHMICA Kumar & Russell & Sundaram, Approximating Latin Square Extensions 1999 24 ALGRTHMICA Leighton & Schwabe, Efficient Algorithms for Dynamic Allocation of Distributed Memory 1999 24 ALGRTHMICA Henzinger & King & Warnow, Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology 1999 24 ALGRTHMICA Zhang & Ortynski, Efficiency of Randomized Parallel Backtrack Search 1999 24 ALGRTHMICA Leonardi & Marchetti-Spaccamela, On-Line Resource Management with Application to Routing and Scheduling 1999 24 ALGRTHMICA Carlsson & Nilsson, Computing Vision Points in Polygons 1999 24 ALGRTHMICA Pritchard, A Fast Bit-Parallel Algorithm for Computing the Subset Partial Order 1999 23 ALGRTHMICA Andrews & Goemans & Zhang, Improved Bounds for On-Line Load Balancing 1999 23 ALGRTHMICA Di Battista & Tamassia & Vismara, Output-Sensitive Reporting of Disjoint Paths 1999 23 ALGRTHMICA Grolmusz, Harmonic Analysis, Real Approximation, and the Communication Complexity of Boolean Functions 1999 23 ALGRTHMICA Xue & Du, An O(n log n) Average Time Algorithm for Computing the Shortest Network under a Given Topology 1999 23 ALGRTHMICA Belanger & Pavan & Wang, Reductions Do Not Preserve Fast Convergence Rates in Average Time 1999 23 ALGRTHMICA Farrahi & Lee & Sarrafzadeh, Two-Way and Multiway Partitioning of a Set of Intervals for Clique-Width Maximization 1999 23 ALGRTHMICA Pardalos & Xue, Algorithms for a Class of Isotonic Regression Problems 1999 23 ALGRTHMICA Auletta & Monti & Parente & Persiano, A Linear-Time Algorithm for the Feasibility of Pebble Motion on Trees 1999 23 ALGRTHMICA Andersson & Larsson & Swanson, Suffix Trees on Words 1999 23 ALGRTHMICA Ramalingam & Song & Joskowicz & Miller, Solving Systems of Difference Constraints Incrementally 1999 23 ALGRTHMICA Devroye, A Note on the Expected Time for Finding Maxima 1999 23 ALGRTHMICA Nicoloso & Sarrafzadeh & Song, On the Sum Coloring Problem on Interval Graphs 1999 23 ALGRTHMICA Baeza-Yates & Navarro, Faster Approximate String Matching 1999 23 ALGRTHMICA Kalpakis & Yesha, Upper and Lower Bounds on the Makespan of Schedules for Tree Dags on Linear Arrayss 1999 23 ALGRTHMICA Chrobak & Noga, LRU Is Better than FIFO 1999 23 ALGRTHMICA Moore & Smyth & Miller, Counting Distinct Strings 1999 23 ALGRTHMICA Deng & Koutsoupias & MacKenzie, Competitive Implementation of Parallel Programs 1999 23 ALGRTHMICA Krishnan & Long & Vitter, Adaptive Disk Spindown via Optimal Rent-to-Buy in Probabilistic Environments 1999 23 ALGRTHMICA Djidjev & Gilbert, Separators in Graphs with Negative and Multiple Vertex Weights 1999 23 ALGRTHMICA Narayanan & Opatrny, Compact Routing on Chordal Rings of Degree 4 1998 22 ALGRTHMICA Prodinger & Szpankowski, Philippe Flajolet's Research in Analysis of Algorithms and Combinatorics 1998 22 ALGRTHMICA Aldous, A Metropolis-Type Optimization Algorithm on the Infinite Tree 1998 22 ALGRTHMICA Bruss & Drmota & Louchard, The Complete Solution of the Competitive Rank Selection Problem 1998 22 ALGRTHMICA Coffman & Flatto & Jelenkovic & Poonen, Packing Random Intervals On-Line 1998 22 ALGRTHMICA Devroye & Mucke & Zhu, A Note on Point Location in Delaunay Triangulations of Random Points 1998 22 ALGRTHMICA Fernandez de la Vega & Frieze & Santha, Average-Case Analysis of the Merging Algorithm of Hwang and Lin 1998 22 ALGRTHMICA Flajolet & Poblete & Viola, On the Analysis of Linear Probing Hashing 1998 22 ALGRTHMICA Hofri & Jacquet, Saddle Points in Random Matrices: Analysis of Knuth Search Algorithms 1998 22 ALGRTHMICA Hwang, Asymptotics of Divide-and-Conquer Recurrences: Batcher's Sorting Algorithm and a Minimum Euclidean Matching Heuristic 1998 22 ALGRTHMICA Knessl, A Note on the Asymptotic Behavior of the Depth of Tries 1998 22 ALGRTHMICA Knuth, Linear Probing and Graphs 1998 22 ALGRTHMICA Mahmoud & Smythe, Probabilistic Analysis of MULTIPLE QUICK SELECT 1998 22 ALGRTHMICA Merlini & Sprugnoli & Verri, Average-Case Analysis of Priority Trees: A Structure for Priority Queue Administration 1998 22 ALGRTHMICA Regnier & Szpankowski, On Pattern Frequency Occurrences in a Markovian Sequence 1998 22 ALGRTHMICA Shachnai & Hofri, The List Update Problem: Improved Bounds for the Counter Scheme 1998 22 ALGRTHMICA Vallee, Dynamics of the Binary Euclidean Algorithm: Functional Analysis and Operators 1998 22 ALGRTHMICA Klein & Subramanian, A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs 1998 22 ALGRTHMICA Frigioni & Marchetti-Spaccamela & Nanni, Semidynamic Algorithms for Maintaining Single-Source Shortest Path Trees 1998 22 ALGRTHMICA Italiano & Ramaswami, Maintaining Spanning Trees of Small Diameter 1998 22 ALGRTHMICA Swaminathan & Goldman, An Incremental Distributed Algorithm for Computing Biconnected Components in Dynamic Graphs 1998 22 ALGRTHMICA Frederickson, Maintaining Regular Properties Dynamically in k-Terminal Graphs 1998 22 ALGRTHMICA Henzinger & Fredman, Lower Bounds for Fully Dynamic Connectivity Problems in Graphs 1998 22 ALGRTHMICA Ben-David, Can Finite Samples Detect Singularities of Real-Valued Functions? 1998 22 ALGRTHMICA Cenzer & Moser, A Good Oracle Is Hard to Beat 1998 22 ALGRTHMICA Blum & Frieze & Kannan & Vempala, A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions 1998 22 ALGRTHMICA Kwek & Pitt, PAC Learning Intersections of Halfspaces with Membership Queries 1998 22 ALGRTHMICA Beimel & Kushilevitz, Learning Boxes in High Dimension 1998 22 ALGRTHMICA Bshouty & Tamon & Wilson, Learning Matrix Functions over Rings 1998 22 ALGRTHMICA Cesa-Bianchi & Helmbold & Panizza, On Bayes Methods for On-Line Boolean Prediction 1998 22 ALGRTHMICA Hiraoka & Amari, Strategy Under the Unknown Stochastic Environment: the Nonparametric Lob-Pass Problem 1998 22 ALGRTHMICA Shawe-Taylor, Classification Accuracy Based on Observed Margin 1998 22 ALGRTHMICA Kamimura, Minimizing alpha-Information for Generalization and Interpretation 1998 22 ALGRTHMICA ruger, A Class of Asymptotically Stable Algorithms for Learning-Rate Adaptation 1998 22 ALGRTHMICA Smola & Scholkopf, On a Kernel-Based Method for Pattern Recogntion, Regression, Approximation, and Operator Inversion 1998 21 ALGRTHMICA Friedman, Computing Betti Numbers via Combinatorial Laplacians 1998 21 ALGRTHMICA Ben-Aroya & Chinn & Schuster, A Lower Bound for Nearly Minimal Adaptive and Hot Potato Algorithms 1998 21 ALGRTHMICA Khanna & Motwani & Wilson, On Certificates and Lookahead in Dynamic Graph Problems 1998 21 ALGRTHMICA Chong & Lam, Approximating Biconnectivity in Parallel 1998 21 ALGRTHMICA Phillips & Westbrook, On-Line Load Balancing and Network Flow 1998 21 ALGRTHMICA Jiang & Karp, Mapping Clones with a Given Ordering or Interleaving 1998 21 ALGRTHMICA Levcopoulos & Krznaric, A Linear-Time Approximation Scheme for Minimum Weight Triangulation of Convex Polygons 1998 21 ALGRTHMICA Albers & Mitzenmacher, Average Case Analysis of List Update Algorithms, with Applications to Data Compression 1998 21 ALGRTHMICA Fraigniaud & Gavoille, Interval Routing Schemes 1998 21 ALGRTHMICA Gupta & Nishimura, Finding Largest Subtrees and Smallest Supertrees 1998 21 ALGRTHMICA Chao & LaPaugh, Finding All Minimal Shapes in a Routing Channel 1998 21 ALGRTHMICA Czumaj & Kanarek & Kutylowski & Lorys, Fast Generation of Random Permutations Via Networks Simulation 1998 21 ALGRTHMICA Frieze & Szpankowski, Greedy Algorithms for the Shortest Common Superstring That Are Asymptotically Optimal 1998 21 ALGRTHMICA Viola & Poblete, The Analysis of Linear Probing Hashing with Buckets 1998 21 ALGRTHMICA Trevisan, Parallel Approximation Algorithms by Positive Linear Programming 1998 21 ALGRTHMICA Alt & Fuchs & Rote & Weber, Matching Convex Shapes with Respect to the Symmetric Difference 1998 21 ALGRTHMICA Alon & Azar & Csirik & Epstein & Sevastianov & Vestjens & Woeginger, On-Line and Off-Line Approximation Algorithms for Vector Covering Problems 1998 21 ALGRTHMICA Arkin & Chiang & Held & Mitchell & Sacristan & Skiena & Yang, On Minimum-Area Hulls 1998 21 ALGRTHMICA Karkkainen & Sutinen, Lempel-Ziv Index for q-Grams 1998 20 ALGRTHMICA Condon & Narayanan, Upper and Lower Bounds for Selection on the Mesh 1998 20 ALGRTHMICA Alberts & Henzinger, Average-Case Analysis of Dynamic Graph Algorithms 1998 20 ALGRTHMICA Aurenhammer & Hoffmann & Aronov, Minkowski-Type Theorems and Least-Squares Clustering 1998 20 ALGRTHMICA Bshouty & Tamon & Wilson, On Learning Decision Trees with Large Output Domains 1998 20 ALGRTHMICA Leung & Tam & Wong & Young, Minimizing Mean Flow Time with Error Constraint 1998 20 ALGRTHMICA Papadopoulou & Lee, A New Approach for the Geodesic Voronoi Diagram of Points in a Simple Polygon and Other Restricted Polygonal Domains 1998 20 ALGRTHMICA Crochemore & Iliopoulos & Korda, Two-Dimensional Prefix String Matching and Covering on Square Matrices 1998 20 ALGRTHMICA Guha & Khuller, Approximation Algorithms for Connected Dominating Sets 1998 20 ALGRTHMICA Farach & Thorup, String Matching in Lempel-Ziv Compressed Strings 1998 20 ALGRTHMICA Harel & Sardas, An Algorithm for Straight-Line Drawing of Planar Graphs 1998 20 ALGRTHMICA Matousek & Mount & Netanyahu, Efficient Randomized Algorithms for the Repeated Median Line Estimator 1998 20 ALGRTHMICA Even & Naor & Schieber & Sudan, Approximating Minimum Feedback Sets and Multicuts in Directed Graphs 1998 20 ALGRTHMICA Torng, A Unified Analysis of Paging and Caching 1998 20 ALGRTHMICA Kim & Yoo & Chwa & Shin, Efficient Algorithms for Computing a Complete Visibility Region in Three-Dimensional Space 1998 20 ALGRTHMICA Yoo & Kim & Shin & Chwa, Linear-Time Algorithms for Finding the Shadow Volumes from a Convex Area Light Source 1998 20 ALGRTHMICA Dinitz & Westbrook, Maintaining the Classes of 4-Edge-Connectivity in a Graph On-Line 1998 20 ALGRTHMICA Graf & Stumpf & Weissenfels, On Coloring Unit Disk Graphs 1998 20 ALGRTHMICA Cheng & Kaminski & Zaks, Minimum Dominating Sets of Intervals on Lines 1998 20 ALGRTHMICA Takaoka, Subcubic Cost Algorithms for the All Pairs Shortest Path Problem 1997 19 ALGRTHMICA Miller & Teng, Tree-Based Parallel Algorithm Design 1997 19 ALGRTHMICA Cherkassky & Goldberg, On Implementing the Push-Relabel Method for the Maximum Flow Problem 1997 19 ALGRTHMICA Lin & Lin, A Pinwheel Scheduler for Three Distinct Numbers with a Tight Schedulability Bound 1997 19 ALGRTHMICA Biedl & Kant & Kaufmann, On Triangulating Planar Graphs under the Four-Connectivity Constraint 1997 19 ALGRTHMICA Das & Kapoor & Smid, On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees 1997 19 ALGRTHMICA Brady & Brown & Powers, Hexagonal Models for Channel Routing 1997 19 ALGRTHMICA Aggarwal & Kravets & Park & Sen, Parallel Searching in Generalized Monge Arrays 1997 19 ALGRTHMICA Weng, Expansion of Linear Steiner Trees 1997 19 ALGRTHMICA Giegerich & Kurtz, From Ukkonen to McCreight and Weiner: A Unifying View of Linear-Time Suffix Tree Construction 1997 19 ALGRTHMICA Chen & He, Parallel Algorithms for Maximal Acyclic Sets 1997 18 ALGRTHMICA Burley & Irani, On Algorithm Design for Metrical Task Systems 1997 18 ALGRTHMICA Dolev & Welch, Wait-Free Clock Synchronization 1997 18 ALGRTHMICA Muthukrishnan, Detecting False Matches in String-Matching Algorithms 1997 18 ALGRTHMICA Beals, Equivalence of Binary and Ternary Algebraic Decision Trees 1997 18 ALGRTHMICA Bespamyatnikh, On Constructing Minimum Spanning Trees in R^k_1 1997 18 ALGRTHMICA Matsui, A Flexible Algorithm for Generating All the Spanning Trees in Undirected Graphs 1997 18 ALGRTHMICA Imielinska & Kalantari, A General Class of Heuristics for Minimum Weight Perfect Matching and Fast Special Cases with Doubly and Triply Logarithmic Errors 1997 18 ALGRTHMICA Pan & Dong & Liu, Optimal Graph Constraint Reduction for Symbolic Layout Compaction 1997 18 ALGRTHMICA Albers, On the Influence of Lookahead in Competitive Paging Algorithms 1997 18 ALGRTHMICA de Berg & van Kreveld, Trekking in the Alps Without Freezing or Getting Tired 1997 18 ALGRTHMICA Cohen & Tamassia, Combine and Conquer 1997 18 ALGRTHMICA Weihe, Multicommodity Flows in Even, Planar Networks 1997 18 ALGRTHMICA Ramachandran & Yang, An Efficient Parallel Algorithm for the Layered Planar Monotone Circuit Value Problem 1997 18 ALGRTHMICA Gerstel & Zaks, The Bit Complexity of Distributed Sorting 1997 18 ALGRTHMICA Kaufmann & Raman & Sibeyn, Routing on Meshes with Buses 1997 18 ALGRTHMICA Mayr & Werchner, Optimal Tree Contraction and Term Matching on the Hypercube and Related Networks 1997 18 ALGRTHMICA Chen & Ierardi, Time-Optimal Trajectories of a Rod in the Plane Subject to Velocity Constraints 1997 18 ALGRTHMICA Tsai & Lee, k Best Cuts for Circular-Arc Graphs 1997 18 ALGRTHMICA Chew & Fortune, Sorting Helps for Voronoi Diagrams 1997 18 ALGRTHMICA Tokuyama, Orthogonal Queries in Segments 1997 18 ALGRTHMICA Overmars & Santoro, Improved Bounds for Electing a Leader in a Synchronous Ring 1997 18 ALGRTHMICA King, A Simpler Minimum Spanning Tree Verification Algorithm 1997 18 ALGRTHMICA Rice & Bunke & Nartker, Classes of Cost Functions for String Edit Distance 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) 1999 10 ALT Morik, Tailoring Representations to Different Requirements 1999 10 ALT Schapire, Theoretical Views of Boosting and Applications 1999 10 ALT Yamanishi, Extended Stochastic Complexity and Minimax Relative Loss Analysis 1999 10 ALT Watanabe, Algebraic Analysis for Singular Statistical Estimation 1999 10 ALT Fukumizu, Generalization Error of Linear Neural Networks in Unidentifiable Cases 1999 10 ALT Wiedermann, The Computational Limits to the Cognitive Power of the Neuroidal Tabula Rasa 1999 10 ALT Balcazar & Castro & Guijarro & Simon, The Consistency Dimension and Distribution-Dependent Learning from Queries 1999 10 ALT Mitchell & Scheffer & Sharma & Stephan, The VC-Dimension of Subclasses of Pattern Languages 1999 10 ALT Evgeniou & Pontil, On the V_gamma Dimension for Regression in Reproducing Kernel Hilbert Spaces 1999 10 ALT Lange & Grieser, On the Strength of Incremental Learning 1999 10 ALT Rossmanith, Learning from Random Text 1999 10 ALT Watson, Inductive Learning with Corroboration 1999 10 ALT Hirata, Flattening and Implication 1999 10 ALT Sasaki, Induction of Logic Programs Based on psi-Terms 1999 10 ALT Nock, Complexity in the Case Against Accuracy: When Building One Function-Free Horn Clause Is as Hard as Any 1999 10 ALT Morita & Haraguchi & Okubo, A Method of Similarity-Driven Knowledge Revision for Type Specializations 1999 10 ALT Bshouty & Eiron & Kushilevitz, PAC Learning with Nasty Noise 1999 10 ALT De Comite & Denis & Gilleron & Letouzey, Positive and Unlabeled Examples Help Learning 1999 10 ALT Cheung, Learning Real Polynomials with a Turing Machine 1999 10 ALT Domingo, Faster Near-Optimal Reinforcement Learning: Adding Adaptiveness to the E^3 Algorithm 1999 10 ALT Rifkin & Pontil & Verri, A Note on Support Vector Machine Degeneracy 1999 10 ALT Nessel, Learnability of Enumerable Classes of Recursive Functions from ``Typical'' Examples 1999 10 ALT Stephan & Zeugmann, On the Uniform Learnability of Approximations to Non-recursive Functions 1999 10 ALT Hermo & Lavin, Learning Minimal Covers of Functional Dependencies with Queries 1999 10 ALT Dalmau, Boolean Formulas Are Hard to Learn for Most Gate Bases 1999 10 ALT Guijarro & Tarui & Tsukiji, Finding Relevant Variables in PAC Model with Membership Queries 1999 10 ALT Kalnishkan, General Linear Relations among Different Types of Predictive Complexity 1999 10 ALT Takimoto & Warmuth, Predicting Nearly as Well as the Best Pruning of a Planar Decision Graph 1999 10 ALT Goldman & Kwek, On Learning Unions of Pattern Languages and Tree Patterns 1998 9 ALT Wrobel, Scalability Issues in Inductive Logic Programming 1998 9 ALT Case & Ott & Sharma & Stephan, Learning to Win Process-Control Games Watching Game-Masters 1998 9 ALT Apsitis & Freivalds & Simanovskis & Smotrovs, Closedness Properties in EX-identification of Recursive Functions 1998 9 ALT Shevchenko & Zolotykh, Lower Bounds for the Complexity of Learning Half-Spaces with Membership Queries 1998 9 ALT Fischlin, Cryptographic Limitations on Parallelizing Membership and Equivalence Queries with Applications to Random Self-Reductions 1998 9 ALT Melideo & Varricchio, Learning Unary Output Two-Tape Automata from Multiplicity and Equivalence Queries 1998 9 ALT Damaschke, Computational Aspects of Parallel Attribute-Efficient Learning 1998 9 ALT Denis, PAC Learning from Positive Statistical Queries 1998 9 ALT Maruoka & Takimoto, Structured Weight-Based Prediction Algorithms 1998 9 ALT Rao & Sattar, Learning from Entailment of Logic Programs with Local Variables 1998 9 ALT Yamamoto, Logical Aspects of Several Bottom-Up Fittings 1998 9 ALT Sugimoto, Learnability of Translations from Positive Examples 1998 9 ALT Satoh, Analysis of Case-Based Representability of Boolean Functions by Monotone theory 1998 9 ALT Head & Kobayashi & Yokomori, Locality, Reversibility, and Beyond: Learning Languages from Positive Data 1998 9 ALT Case & Jain, Synthesizing Learners Tolerating Computable Noisy Data 1998 9 ALT Sato & Mukouchi & Zheng, Characteristic Sets for Unions of Regular Pattern Languages and Compactness 1998 9 ALT Sakamoto, Finding a One-Variable Pattern from Incomplete Data 1998 9 ALT Arimuar & Wataki & Fujino & Arikawa, A Fast Algorithm for Discovering Optimal String Patterns in Large Text Databases 1998 9 ALT Hirowatari & Arikawa, A Comparison of Identification Criteria for Inductive Inference of Recursive Real-Valued Functions 1998 9 ALT Case & Jain & Kaufmann & Sharma & Stephan, Predictive Learning Models for Concept Drift 1998 9 ALT Jain, Learning with Refutation 1998 9 ALT Meyer, Comparing the Power of Probabilistic Learning and Oracle Identification under Monotonicity Constraints 1998 9 ALT Stephan & Ventsov, Learning Algebraic Structures from Text Using Semantical Knowledge 1998 9 ALT McCreath & Sharma, LIME: A System for Learning Relations 1998 9 ALT Schmitt, On the Sample Complexity for Neural Trees 1998 9 ALT Verbeurgt, Learning Sub-classes of Monotone DNF on the Uniform Distribution 1998 9 ALT Sarkans & Barzdins, Using Attribute Grammars for Description of Inductive Inference Search Space 1998 9 ALT Grieser & Jantke & Lange, Towards the Validation of Inductive Learning Systems 1998 9 ALT Stein, Consistent Polynomial Identification in the Limit 1997 8 ALT Blum, Program Error Detection/Correction: Turning PAC Learning into PERFECT Learning (1 page) 1997 8 ALT Ambainis & Apsitis & Freivalds & Gasarch & Smith, Team Learning as a Game 1997 8 ALT Hirowatari & Arikawa, Inferability of Recursive Real-valued Functions 1997 8 ALT Jain & Lange & Nessel, Learning of r.e. Languages from Good Examples 1997 8 ALT Kobayashi & Yokomori, Identifiability of Subspaces and Homomorphic Images of Zero-Reversible Languages 1997 8 ALT Pitt, On Exploiting Knowledge and Concept Use in Learning Theory 1997 8 ALT Domingo & Tsukiji & Watanabe, Partial Occam's Razor and its Applications 1997 8 ALT Sitharam & Straney, Derandomized Learning of Boolean Functions 1997 8 ALT Parekh & Honavar, Learning DFA from Simple Examples 1997 8 ALT Denis & Gilleron, PAC Learning under Helpful Distributions 1997 8 ALT Qiao & Rao & Protopopescu, PAC Learning Using Nadaraya-Watson Estimator Based on Orthonormal Systems 1997 8 ALT Boros & Ibaraki & Makino, Monotone Extensions of Boolean Data Sets 1997 8 ALT Sato, Classical Brouwer-Heyting-Kolmogorov Interpretation 1997 8 ALT Mukouchi, Inferring a System from Examples with Time Passage 1997 8 ALT Matsumoto & Hayashi & Shoudai, Polynomial Time Inductive Inference of Regular Term Tree Languages from Positive Data 1997 8 ALT Case & Jain & Sharma, Synthesizing Noise-tolerant Language Learners 1997 8 ALT Ambainis & Apsitis & Calude & Freivalds & Karpinski & Larfeldt & Sala & Smotrovs, Effects of Kolmogorov Complexity Present in Inductive Inference as well 1997 8 ALT Erlebach & Rossmanith & Stadtherr & Steger & Zeugmann, Learning One-Variable Pattern Languages Very Efficiently on Average, in Parallel, and by Asking Queries 1997 8 ALT Kobler & Lindner, Oracles in Sigma_2^p are Sufficient for Exact Learning 1997 8 ALT Arvind & Vinodchandran, Exact Learning via Teaching Assistants 1997 8 ALT Nakamura, An Efficient Exact Learning Algorithm for Ordered Binary Decision Diagrams 1997 8 ALT Vovk, Probability Theory for the Brier Game 1997 8 ALT Zhang & Numao, Learning and Revising Theories in Noisy Domains 1997 8 ALT Gurvits, A Note on a Scale-sensitive Dimension of Linear Bounded Functionals in Banach Spaces 1997 8 ALT Maass, On the Relevance of Time in Neural Computation and Learning 1997 8 ALT Takimoto & Hirai & Maruoka, A Simple Algorithm for Predicting Nearly as well as the Best Pruning Labeled with the Best Prediction Values of a Decision Tree 1997 8 ALT Kwek, Learning Disjunctions of Features 1997 8 ALT Sakamoto, Learning Simple Deterministic Finite-Memory Automata 1997 8 ALT Arimura, Learning Acyclic First-order Horn Sentences from Entailment 1997 8 ALT Hegedus & Indyk, On Learning Disjunctions of Zero-One Threshold Functions with Queries 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 2000 8 AMAST Wing, Weaving Formal Methods into the Undergraduate Computer Science Curriculum 2000 8 AMAST Breitling & Philipps, Step by Step to Histories 2000 8 AMAST Guerra, Distance Functions for Defaults in Reactive Systems 2000 8 AMAST Heinemann, Generalizing the Modal and Temporal Logic of Linear Time 2000 8 AMAST Cerone, Process Algebra versus Axiomatic Specification of a Real-Time Protocol 2000 8 AMAST Lawford & McDougall & Froebel & Moum, Practical Application of Functional and Relational Methods for the Specification and Verification of Safety Critical Software 2000 8 AMAST Broy & Wirsing, Algebraic State Machines 2000 8 AMAST Van Wyk, Meta Languages in Algebraic Compilers 2000 8 AMAST Erwig, Random Access to Abstract Data Types 2000 8 AMAST Jacobs & Poll, A Monad for Basic Java Semantics 2000 8 AMAST Choppy & Poizat & Royer, A Global Semantics for Views 2000 8 AMAST Hill & Spoto, Analysis of Downward Closed Properties of Logic Programs 2000 8 AMAST Busi & Gorrieri & Zavattaro, Process Calculi for Coordination: From Linda to JavaSpaces 2000 8 AMAST Fidge, The Algebra of Multi-tasking 2000 8 AMAST Tini & Maggiolo-Schettini, A Causal Semantics for Timed Default Concurrent Constraint Programming 2000 8 AMAST Reggio & Repetto, CASL-CHART: A Combination of Statecharts and of the Algebraic Specification Language CASL 2000 8 AMAST Focardi & Gorrieri & Martinelli, Message Authentication through Non Interference 2000 8 AMAST Astesiano & Cerioli & Reggio, Plugging Data Constructs into Paradigm-Specific Languages: Towards an Application to UML 2000 8 AMAST Borger & Cavarra & Riccobene, An ASM Semantics for UML Activity Diagrams 2000 8 AMAST Ying & Wirsing, Approximate Bisimilarity 2000 8 AMAST Andova, Time and Probability in Process Algebra 2000 8 AMAST De Nicola & Loreti, A Modal Logic for KLAIM 2000 8 AMAST Desharnais & Moller & Tchier, Kleene under a Demonic Star 2000 8 AMAST de Moor & Gibbons, Pointwise Relational Programming 2000 8 AMAST Talcott, Towards a Toolkit for Actor System Specification 2000 8 AMAST de O. Braga & Haeusler & Meseguer & Mosses, Maude Action Tool: Using Reflection to Map Action Semantics to Rewriting Logic 2000 8 AMAST Duran, The Extensibility of Maude's Module Algebra 2000 8 AMAST Coudert & Le Gall, A Reuse-Oriented Framework for Hierarchical Specifications 2000 8 AMAST Ancona, MIX(FL): A Kernel Language of Mixin Modules 2000 8 AMAST Fischer & Wehrheim, Behavioural Subtyping Relations for Object-Oriented Formalisms 2000 8 AMAST Healy & Williamson, Applying Category Theory to Derive Engineering Software from Encoded Knowledge 2000 8 AMAST Adi & Debbabi & Mejri, A New Logic for Electronic Commerce Protocols 2000 8 AMAST Doche & Wiels, Extended Institutions for Testing 2000 8 AMAST Machado, Testing from Structured Algebraic Specifications 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 1999 38 AML Imhof, Logics That Define Their Own Semantics 1999 38 AML Gradel & Malmstrom, 0-1 Laws for Recursive Structures 1999 38 AML Lifsches & Shelah, Random Graphs in the Monadic Theory of Order 1998 37 AML Schaefer, A Guided Tour of Minimal Indices and Shortest Descriptions 1998 37 AML Baaz & Zach, Note on Generalizing Theorems in Algebraically Closed Fields 1998 37 AML Dekkers & Bunder & Barendregt, Completeness of Two Systems of Illative Combinatory Logic for First-order Propositional and Predicate Calculus 1998 37 AML Marzetta & Strahm, The mu Quantification Operator in Explicit Mathematics with Universes and Iterated Fixed Point Theories with Ordinals 1998 37 AML Weiermann, Bounding Derivation Lengths with Functions from the Slow Growing Hierarchy 1998 37 AML Avigad, An Effective Proof That Open Sets are Ramsey 1998 37 AML Halbeisen, Symmetries between Two Ramsey Properties 1997 37 AML Niggl, Non-definability of the Ackermann Function with Type 1 Partial Primitive 1997 37 AML Urquhart, The Number of Lines in Frege Proofs with Substitution 1997 37 AML Tada & Tatsuta, The Function lfloor a/m rfloor in Sharply Bounded Arithmetic 1997 36 AML Kikuchi, Kolmogorov Complexity and the Second Incompleteness Theorem 1997 36 AML Shore, Curriculum Vitae Gerald E. Sacks 1997 36 AML Shore, Conjectures and Questions from Gerald Sacks's Degrees of Unsolvability 1997 36 AML Lempp & Lerman, Iterated Trees of Strategies and Priority Arguments 1997 36 AML Owings, Rank, Join, and Cantor Singletons 1997 36 AML Cai & Chen & Downey & Fellows, On the Parameterized Complexity of Short Computation and Factorization 1997 36 AML Baratella & Berardi, A Parallel Game Semantics for Linear Logic 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 1999 12 AMLETS Chakraborty & Choudhury, Can Statistics Provide a Realistic Measure for an Algorithm's Complexity? 1999 12 AMLETS Demange & Monnot & Paschos, Bridging Gap Between Standard and Differential Polynomial Approximation: The Case of Bin-Packing 1999 12 AMLETS Wenzel, A Disturbed Version of the Greedy Algorithm 1999 12 AMLETS Nieminen & Peltola, A Generalization of Hypercubes: Complemented Graphs 1999 12 AMLETS Nieminen & Peltola, Hypertrees 1999 12 AMLETS Bryant & Moulton, A Polynomial Time Algorithm for Constructing the Refined Buneman Tree 1999 12 AMLETS Choudhury, An Information Theoretic Model of a Reliable Computer Network 1998 11 AMLETS Gulliver & Lin & Dehne, Fast Parallel Decoding of Double-Error-Correcting Binary BCH Codes 1998 11 AMLETS Pan, Single Precision Computation of the Sign of Algebraic Predicates 1997 10 AMLETS Harary & Raghavachari, The E-Mail Gossip Number and the Connected Domination Numbers 1997 10 AMLETS Tay & Nievergelt, A Minmax Relationship Between Embeddable and Rigid Graphs 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 2000 107 AMM Scheinerman, When Close Enough Is Close Enough 2000 107 AMM Borwein & Borwein & Marechal, Surprise Maximization 2000 107 AMM Pudlak, Proofs as Games 2000 107 AMM Romik, Stirling's Approximation for n!: the Ultimate Short Proof? 2000 107 AMM Kendig, Is a 2000-Year-Old Formula Still Keeping Some Secrets? 2000 107 AMM Frame & Johnson & Sauerberg,Fixed Points and Fermat: A Dynamical Systems Approach to Number Theory 2000 107 AMM Boute, Zeroless Positional Number Representation and String Ordering 2000 107 AMM Li, Norms, Isometries, and Isometry Groups 2000 107 AMM Calkin & Wilf, Recounting the Rationals 2000 107 AMM Fleron, review of Hahn, Basic Calculus: From Archimedes to Newton to Its Role in Science (Springer-Verlag, 1998) 2000 107 AMM Cusick, review of Koblitz, Algebraic Aspects of Cryptography (Springer-Verlag, 1998) 2000 107 AMM Schwenk, What Is the Correct Way to Seed a Knockout Tournament? 2000 107 AMM Su, review of Robertson & Webb, Cake-Cutting Algorithms: Be Fair If You Can (A. K. Peters, 1998) 2000 107 AMM Griffiths, Mathematics at the Turn of the Millennium 2000 107 AMM Reiter, Using Statistics to Determine Causal Relationships 2000 107 AMM Case, Paradoxes Involving Conflicts of Interest 2000 107 AMM McClure, Start Where They Are: Geometry as an Introduction to Proof 2000 107 AMM Tyszkiewicz, A Simple Construction for Tournaments With Every k Players Beaten by a Single Player 1999 106 AMM Borwein & Corless, Emerging Tools for Experimental Mathematics 1999 106 AMM Su, Rental Harmony: Sperner's Lemma in Fair Division 1999 106 AMM Pourciau, The Education of a Pure Mathematician 1999 106 AMM Koch, review of Fritsch & Fritsch, The Four-Color Theorem (Springer-Verlag, 1998) 1999 106 AMM Mullin, review of Schechter, My Brain Is Open: The Mathematical Journeys of Paul Erdos (Simon & Schuster, 1998) 1999 106 AMM Mullin, review of Hoffman, The Man Who Loved Only Numbers: The Story of Paul Erdos and the Search for Mathematical Truth (Hyperion, 1998) 1999 106 AMM Billera & Brown & Diaconis, Random Walks and Plane Arrangements in Three Dimensions 1999 106 AMM Francis & Weeks, Conway's ZIP Proof 1999 106 AMM Devaney, The Mandelbrot Set, the Farey Tree, and the Fibonacci Sequence 1999 106 AMM Richman, Existence Proofs 1999 106 AMM Granville & Roesler, The Set of Differences of a Given Set 1999 106 AMM Gold, review of Hersh, What Is Mathematics, Really? (Oxford, 1997) 1999 106 AMM Paradis & Viader & Bibiloni, A Mathematical Excursion: From the Three-Door Problem to a Cantor-Type Set 1999 106 AMM Staton, A Short Proof of Turan's Theorem 1999 106 AMM Kim, A Characterization of the Set of Points of Continuity of a Real Function 1999 106 AMM Feferman, Does Mathematics Need New Axioms? 1999 106 AMM Shallit, review of Menezes & van Oorschot & Vanstone, Handbook of Applied Cryptography (CRC Press, 1997) 1999 106 AMM Shallit, review of Rosenheim, The Cryptographic Imagination: Secret Writing from Edgar Poe to the Internet (Johns Hopkins University Press, 1997) 1998 105 AMM Fraenkel, Multivision: An Intractable Impartial Game With a Linear Winning Strategy 1998 105 AMM McCartin, Seven Deadly Sins of Numerical Computation 1998 105 AMM Guy, Nothing's New in Number Theory? 1998 105 AMM Lucas, review of Brams & Taylor, Fair Division: From Cake-Cutting to Dispute Resolution (Cambridge University Press, 1996) 1998 105 AMM Folland, review of Higham, Handbook of Writing for the Mathematical Sciences (SIAM, 1993) 1998 105 AMM Folland, review of Krantz, A Primer of Mathematical Writing (AMS, 1997) 1998 105 AMM Dosen, Functions Redefined 1998 105 AMM Hamming, Mathematics on a Distant Planet 1998 105 AMM Medvedev, Nonstandard Analysis and the History of Classical Analysis 1998 105 AMM Krantz, review of Gerstein, Introduction to Mathematical Structures and Proofs (Springer-Verlag, 1996) 1998 105 AMM Harel, Two Dual Assertions: The First on Learning and the Second on Teaching (or Vice Versa) 1998 105 AMM Lowenthal & Langsen & Benson, Merton's Partial Differential Equation and Fixed Point Theory 1998 105 AMM Balinski & Ratier, Graphs and Marriages 1998 105 AMM Sheard, Induction the Hard Way 1998 105 AMM Thomas, review of Hirsch, The Schools We Need (Doubleday, 1996) 1998 105 AMM Bollobas, To Prove and Conjecture: Paul Erdos and His Mathematics 1998 105 AMM Libeskind-Hadas, Sorting in Parallel 1998 105 AMM Ross, Doing and Proving: The Place of Algorithms and Proofs in School Mathematics 1998 105 AMM Snevily & West, The Bricklayer Problem and the Strong Cycle Lemma 1998 105 AMM Kuhn & Kuhn, Cutting High-Dimensional Cakes 1997 104 AMM Grabiner, Was Newton's Calculus a Dead End? The Continental Influence of Maclaurin's Treatise of Fluxions 1997 104 AMM Touhey, Yet Another Definition of Chaos 1997 104 AMM Laczkovich, On Lambert's Proof of the Irrationality of pi 1997 104 AMM Polezzi, A Geometrical Method for Finding an Explicit Formula for the Greatest Common Divisor 1997 104 AMM Laugwitz, On the Historical Development of Infinitesimal Mathematics 1997 104 AMM Bach, Energy Arguments in the Theory of Algorithms 1997 104 AMM Adamchik & Wagon, A Simple Formula for pi 1997 104 AMM Zagier, Newman's Short Proof of the Prime Number Theorem 1997 104 AMM Knisley, Calculus: A Modern Perspective 1997 104 AMM Ostebee & Zorn, Pro Choice 1997 104 AMM Kaput, Rethinking Calculus: Learning and Thinking 1997 104 AMM Askey, What Do We Do About Calculus? First, Do No Harm 1997 104 AMM Roberts, review of Morgan, Calculus Lite (A. K. Peters, 1995) 1997 104 AMM Boerlijst & Nowak & Sigmund, Equal Pay for All Prisoners 1997 104 AMM Velleman, Characterizing Continuity 1997 104 AMM Bruckstein & Mallows & Wagner, Probabilistic Pursuits on the Grid 1997 104 AMM Jones, A Note on a Cake Cutting Algorithm of Banach and Knaster 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 2000 AMS Knobel, An Introduction to the Mathematical Theory of Waves 1999 AMS Bennett & Crannell (Eds.), Starting Our Careers: A Collection of Essays and Advice on Professional Development from the Young Mathematicians' Network 1998 AMS Howard & Rubin, Consequences of the Axiom of Choice 1997 AMS Krantz, A Primer of Mathematical Writing: Being a Disquisition on Having Your Ideas Recorded, Typeset, Published, Read, and Appreciated 1996 AMS Renegar & Shub & Smale (Eds.), The Mathematics of Numerical Analysis: 1995 (25th) AMS-SIAM Summer Seminar in Applied Mathematics (Lectures in Applied Mathematics, Volume 32) 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 Krantz, How To Teach Mathematics: A Personal Perspective 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 1991 AMS Shashkin, Fixed Points 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 2000 27 ANNALSMAI Cadoli & Palopoli & Scarcello, Propositional Lower Bounds: Algorithms and Complexity 1999 26 ANNALSMAI Halpern, Set-theoretic Completeness for Epistemic and Conditional Logic 1999 26 ANNALSMAI Jonsson, Strong Bounds on the Approximability of Two PSPACE-hard Problems in Propositional Planning 1999 26 ANNALSMAI Halpern, Errata: ``The Relationship between Knowledge, Belief, and Certainty'' 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 1998 147 ANNALSMTH Shishikura, The Hausdorff Dimension of the Boundary of the Mandelbrot Set and Julia Sets 2000 104 ANNALSPAL Arai, Relative Efficiency of Propositional Proof Systems: Resolution vs. Cut-free LK 2000 104 ANNALSPAL Bellantoni & Niggl & Schwichtenberg, Higher Type Recursion, Ramification and Polynomial Time 2000 104 ANNALSPAL Burr, Functional Interpretation of Aczel's Constructive Set Theory 2000 104 ANNALSPAL Feferman & Strahm, The Unfolding of Non-finitist Arithmetic 2000 104 ANNALSPAL Hendriks, Doing Logic by Computer: Interpolation in Fragments of Intuitionistic Propositional Logic 2000 104 ANNALSPAL Hofmann, Safe Recursion with Higher Types and BCK-algebra 2000 104 ANNALSPAL Mints, Reduction of Finite and Infinite Derivations 2000 104 ANNALSPAL Moerdijk & Palmgren, Wellfounded Trees in Categories 2000 104 ANNALSPAL de Nivelle, Deciding the E^+-class by an a Posteriori, Liftable Order 2000 104 ANNALSPAL van Oosten & Simpson, Axioms and (Counter)examples in Synthetic Domain Theory 2000 104 ANNALSPAL Pollett, Multifunction Algebras and the Provability of PH_ 2000 104 ANNALSPAL Strahm, The Non-constructive mu Operator, Fixed Point Theories with Ordinals, and the Bar Rule 2000 104 ANNALSPAL Trevisan, Interactive and Probabilistic Proof-checking 2000 102 ANNALSPAL Kohlenbach, Things That Can and Things That Cannot Be Done in PRA 2000 102 ANNALSPAL Bucciarelli & Ehrhard, On Phase Semantics and Denotational Semantics in Multiplicative-Additive Linear Logic 1999 100 ANNALSPAL Carbone, Duplication of Directed Graphs and Exponential Blow Up of Proofs 1999 100 ANNALSPAL Todorcevic & Vaananen, Trees and Ehrenfeucht-Fraisse Games 1999 100 ANNALSPAL Blass & Gurevich & Shelah, Choiceless Polynomial Time 1999 100 ANNALSPAL Pollett, Structure and Definability in General Bounded Arithmetic Theories 1999 99 ANNALSPAL Chapuis & Koiran, Saturation and Stability in the Theory of Computation over the Reals 1999 99 ANNALSPAL Niggl, M^omega Considered as a Programming Language 1999 99 ANNALSPAL Buss & Mints, The Complexity of the Disjunction and Existential Properties in Intuitionistic Logic 1999 97 ANNALSPAL Baaz & Leitsch, Cut Normal Forms and Proof Complexity 1999 97 ANNALSPAL Gottlob & Leone & Veith, Succinctness as a Source of Complexity in Logical Formalisms 1999 96 ANNALSPAL Arlo-Costa, Belief Revision Conditionals: Basic Iterated Systems 1999 96 ANNALSPAL van Benthem, Modality, Bisimulation and Interpolation in Infinitary Logic 1999 96 ANNALSPAL Buss, Bounded Arithmetic, Proof Complexity and Two Papers of Parikh 1999 96 ANNALSPAL Carbone, Turning Cycles into Spirals 1999 96 ANNALSPAL Collins, Behaviorism and Belief 1999 96 ANNALSPAL Fagin & Halpern & Moses & Vardi, Common Knowledge Revisited 1999 96 ANNALSPAL Fitting A Simple Propositional S5 Tableau System 1999 96 ANNALSPAL Gaifman, Self-reference and the Acyclicity of Rational Choice 1999 96 ANNALSPAL Georgatos, To Preference via Entrenchment 1999 96 ANNALSPAL Hajek, Ten Questions and One Problem on Fuzzy Logic 1999 96 ANNALSPAL Harel & Singerman, Computation Paths Logic: An Expressive, Yet Elementary, Process Logic 1999 96 ANNALSPAL Henriksen & Thiagarajan, Dynamic Linear Time Temporal Logic 1999 96 ANNALSPAL Leivant, Ramified Recurrence and Computational Complexity III: Higher Type Recurrence and Elementary Complexity 1999 96 ANNALSPAL Marek & Nerode & Remmel, Logic Programs, Well-orderings, and Forward Chaining 1999 96 ANNALSPAL Moss, Coalgebraic Logic 1999 96 ANNALSPAL Pratt, Chu Spaces from the Representational Viewpoint 1999 96 ANNALSPAL Pudlak, A Note on Applicability of the Incompleteness Theorem to Human Mind 1999 96 ANNALSPAL Ramanujam, View-based Explicit Knowledge 1998 94 ANNALSPAL Cenzer & Remmel, Feasible Graphs with Standard Universe 1998 94 ANNALSPAL Goncharov, Decidable Boolean Algebras of Low Level 1998 94 ANNALSPAL Harrington & Soare, Definable Properties of the Computably Enumerable Sets 1998 94 ANNALSPAL Stephan, Learning via Queries and Oracles 1998 93 ANNALSPAL Downey & Furedi & Jockusch & Rubel, Difference Sets and Computability Theory 1998 93 ANNALSPAL Gasarch & Lee, On the Finiteness of the Recursive Chromatic Number 1998 93 ANNALSPAL Ko, On the Computability of Fractal Dimensions and Hausdorff Measure 1998 93 ANNALSPAL Moser, Approximation Methods in Inductive Inference 1998 93 ANNALSPAL Schmerl, What's the Difference? 1998 92 ANNALSPAL Fernando, In Conjunction with Qualitative Probability 1998 92 ANNALSPAL van den Berg, On the Relation between Elementary Partial Difference Equations and Partial Differential Equations 1998 92 ANNALSPAL Kojman, Exact Upper Bounds and their Uses in Set Theory 1998 92 ANNALSPAL Velickovic & Woodin, Complexity of Reals in Inner Models of Set Theory 1998 92 ANNALSPAL Setzer, Well-Ordering Proofs for Martin-Lof Type Theory 1998 92 ANNALSPAL Makowsky & Pnueli, Erratum to ``Arity and Alternation in Second-Order Logic'' 1998 91 ANNALSPAL Khoussainov, Randomness, Computability, and Algebraic Specifications 1998 91 ANNALSPAL Raffalli, A Semantical Storage Operator Theorem for All Types 1997 90 ANNALSPAL Riis, Count(q) Does Not Imply Count(p) 1997 90 ANNALSPAL Calude & Calude & Khoussainov, Deterministic Automata: Simulation, Universality and Minimality 1997 89 ANNALSPAL Andreka, Complexity of Equations Valid in Algebras of Relations. Part I: Strong Non-Finitizability 1997 89 ANNALSPAL Andreka, Complexity of Equations Valid in Algebras of Relations. Part II: Finite Axiomatizations 1997 89 ANNALSPAL Bloch, On Parallel Hierarchies and R^j_k 1997 89 ANNALSPAL Gallier, Erratum to ``What's So Special about Kruskal's Theorem and the Ordinal Gamma_0? A Survey of Some Results in Proof Theory'' 1997 89 ANNALSPAL Beltiukov, Intuitionistic Formal Theories with Realizability in Subrecursive Classes 1997 89 ANNALSPAL Korec, Theories of Generalized Pascal Triangles 1997 89 ANNALSPAL Maurin, Ehrenfeucht Games and Ordinal Addition 1997 87 ANNALSPAL Hella & Kolaitis & Luosto, How to Define a Linear Order on Finite Models 1997 87 ANNALSPAL Chong & Yang, Sigma_2 Induction and Infinite Injury Arguments, Part II: Tame Sigma_2 Coding and the Jump Operator 1997 86 ANNALSPAL Engberg & Winskel, Completeness Results for Linear Logic on Petri Nets 1997 85 ANNALSPAL Beklemishev, Induction Rules, Reflection Principles, and Provably Recursive Functions 1997 85 ANNALSPAL Japaridze, A Constructive Game Semantics for the Language of Linear Logic 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 1996 24 ANNALSSTAT Kleinberg, An Overtraining-resistant Stochastic Modeling Method for Pattern Recognition 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 1998 3 ANTS Elkies, Shimura Curve Computations 1998 3 ANTS Boneh, The Decision Diffie-Hellman Problem 1998 3 ANTS Cesari, Parallel Implementation of Schonhage's Integer GCD Algorithm 1998 3 ANTS Vallee, The Complete Analysis of the Binary Euclidean Algorithm 1998 3 ANTS Mihailescu, Cyclotomy Primality Proving -- Recent Developments 1998 3 ANTS Morain, Primality Proving Using Elliptic Curves: An Update 1998 3 ANTS Galway, Robert Bennion's ``Hopping Sieve'' 1998 3 ANTS Sorenson, Trading Time for Space in Prime Number Sieves 1998 3 ANTS te Riele & Saouter, New Experimental Results Concerning the Goldbach Conjecture 1998 3 ANTS Boneh & Horwitz, Generating a Product of Three Primes with an Unknown Factorization 1998 3 ANTS De Win & Mister & Preneel & Wiener, On the Performance of Signature Schemes Based on Elliptic Curves 1998 3 ANTS Hoffstein & Pipher & Silverman, NTRU: A Ring-Based Public Key Cryptosystem 1998 3 ANTS Young & Yung, Finding Length-3 Positive Cunningham Chains 1998 3 ANTS Huang & Wong, An Algorithm for Approximate Counting of Points on Algebraic Sets over Finite Fields 1998 3 ANTS Teske, Speeding Up Pollard's Rho Method for Computing Discrete Logarithms 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 1996 3 APARA Kim & Feng, New Graph Model and Its Routing Algorithm for Rearrangeable Networks 1998 APCRYPT De Schutter, Trends in the Fight Against Computer-Related Delinquency 1998 APCRYPT Knudsen, Block Ciphers -- A Survey 1998 APCRYPT Preneel, Cryptographic Primitives for Information Authentication -- State of the Art 1998 APCRYPT Preneel & Rijmen & Bosselaers, Recent Developments in the Design of Conventional Cryptographic Algorithms 1998 APCRYPT De Win & Preneel, Elliptic Curve Public-Key Cryptosystems -- An Introduction 1998 APCRYPT Fumy, Key Management Techniques 1998 APCRYPT Verschuren, Security of Computer Networks 1998 APCRYPT Fumy, Internet Security Protocols 1998 APCRYPT Vandenwauver & Jorissen, Securing Internet Electronic Mail 1998 APCRYPT Vedder, GSM: Security, Services, and the SIM 1998 APCRYPT Landrock, TTPs Overview -- Concepts and Review of the State of Art from a Technical Point of View 1998 APCRYPT Daemen, Management of Secret Keys: Dynamic Key Handling 1998 APCRYPT Hoyle & Mitchell, On Solutions to the Key Escrow Problem 1998 APCRYPT Vedder & Weikmann, Smart Cards -- Requirements, Properties, and Applications 1998 APCRYPT Ernst Bovelander, Smart Card Security 1998 APCRYPT Schoenmakers, Security Aspects of the Ecash^{TM} Payment System 1998 APCRYPT Vedder, International Standardisation of IT Security 1998 APCRYPT Roberts, Security Management -- The Process 1998 APCRYPT De Decker, Introduction to Computer Security 1997 APDC Huang, Parallel Recursive Algorithm for Tridiagonal Systems 1997 APDC Lee & Park & Park, An Improved Parallel Algorithm for Delaunay Triangulation on Distributed Memory Parallel Computers 1997 APDC Eisenbiegler & Lowe & Wehrenpfennig, On the Optimization by Redundancy Using an Extended LogP Model 1997 APDC Shen, Fast Parallel Algorithm for Finding the kth Longest Path in A Tree 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 1998 APPROX Halldorsson, Approximations of Independent Sets in Graphs 1998 APPROX Shmoys, Using Linear Programming in the Design and Analysis of Approximation Algorithms: Two Illustrative Problems 1998 APPROX Vazirani, The Steiner Tree Problem and Its Generalizations 1998 APPROX Azar & Epstein, Approximation Schemes for Covering and Scheduling on Related Machines 1998 APPROX Bar-Yehuda, One for the Price of Two: A Unified Approach for Approximating Covering Problems 1998 APPROX Baur & Fekete, Approximation of Geometric Dispersion Problems 1998 APPROX Cheriyan & Jordan & Nutov, Approximating k-outerconnected Subgraph Problems 1998 APPROX Epstein, Lower Bounds for On-line Scheduling with Precedence Constraints on Identical Machines 1998 APPROX Hochbaum, Instant Recognition of Half Integrality and 2-approximations 1998 APPROX Hochbaum, The t-Vertex Cover Problem: Extending the Half Integrity Framework with Budget Constraints 1998 APPROX Kellerer & Pferschy, A New Fully Polynomial Approximation Scheme for the Knapsack Problem 1998 APPROX Kortsarz, On the Hardness of Approximating Spanners 1998 APPROX Kumar, Approximating Circular Arc Colouring and Bandwidth Allocation in All-Optical Ring Networks 1998 APPROX Schiermeyer, Approximating Maximum Independent Set in k-Clique-free Graphs 1998 APPROX Spieksma, Approximating an Interval Scheduling Problem 1998 APPROX Srivastav & Wolf, Finding Dense Subraphs with Semidefinite Programming 1998 APPROX Sviridenko, Best Possible Approximation Algorithm for MAX SAT with Cardinal Constraint 1999 APRESS Zukowski, John Zukowski's Definitive Guide to Swing for Java 2 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 2000 6 ARTLIFE Teal & Taylor, Effects of Compression on Language Evolution 1999 5 ARTLIFE Sayama, A New Structurally Dissolvable Self-Reproducing Loop Evolving in a Simple Cellular Automata Space 1999 5 ARTLIFE Suzuki, An Approach to Biological Computation: Unicellular Core-Memory Creatures Evolved Using Genetic Algorithms 1999 5 ARTLIFE Yamamoto & Kaneko, Tile Automaton: A Model for an Architecture of a Living System 1998 4 ARTLIFE Sipper, Fifty Years of Research on Self-Replication: An Overview 1998 4 ARTLIFE Tempesti & Mange & Stauffer, Self-Replicating and Self-Repairing Multicellular Automata 1998 4 ARTLIFE Reggia & Lohn & Chou, Self-Replicating Structures: Evolution, Emergence, and Computation 1998 4 ARTLIFE Bedau, Four Puzzles About Life 1998 4 ARTLIFE Dittrich & Banzhaf, Self-Evolution in a Constructive Binary String System 1995 2 ARTLIFE Pesavento, An Implementation of von Neumann's Self-Reproducing Machine 1995 2 ARTLIFE Paredis, Coevolutionary Computation 1999 5 ARTS Jonsson & Yi, Fully Abstract Characterization of Probabilistic May Testing 1999 5 ARTS Vardi, Probabilistic Linear-Time Model Checking: An Overview of the Automata-Theoretic Approach 1999 5 ARTS Tripakis, Verifying Progress in Timed Systems 1995 ASASCS Wu, Random Shuffling: A New Approach to Matching Problem 1995 ASASCS Lent & Modarres, An Algorithm for Simultaneous Selection of Order Statistics 1998 6 ASIACRYPT Lenstra, Generating RSA Moduli with a Predetermined Portion 1998 6 ASIACRYPT Poupard & Stern, Generation of Shared RSA Keys by Two Parties 1998 6 ASIACRYPT Boneh & Durfee & Frankel, An Attack on RSA Given a Small Fraction of the Private Key Bits 1998 6 ASIACRYPT Patarin & Goubin & Courtois, C_{-+}^* and HM: Variations Around Two Schemes of T. Matsumoto and H. Imai 1998 6 ASIACRYPT Kaliski, ECC/DLP and Factoring-Based Cryptography: A Tale of Two Families (one page only) 1998 6 ASIACRYPT Cohen & Miyaji & Ono, Efficient Elliptic Curve Exponentiation Using Mixed Coordinates 1998 6 ASIACRYPT Izu & Kogure & Noro & Yokoyama, Efficient Implementation of Schoof's Algorithm 1998 6 ASIACRYPT Sakai & Sakurai, Design of Hyperelliptic Cryptosystems in Small Characteristic and a Software Implementation over F_2^n 1998 6 ASIACRYPT Chao & Nakamura & Sobataka & Tsujii, Construction of Secure Elliptic Cryptosystems Using CM Tests and Liftings 1998 6 ASIACRYPT Silverman & Suzuki, Elliptic Curve Discrete Logarithms and the Index Calculus 1998 6 ASIACRYPT Wu & Bao & Deng & Ye, Cryptanalysis of Rijmen-Preneel Trapdoor Cipher 1998 6 ASIACRYPT Wu & Bao & Deng & Ye, Improved Truncated Differential Attacks on SAFER 1998 6 ASIACRYPT Pornin, Optimal Resistance Against the Davies and Murphy Attack 1998 6 ASIACRYPT Camenisch & Michels, A Group Signature Scheme with Improved Efficiency 1998 6 ASIACRYPT Lim & Lee, A Study on the Proposed Korean Digital Signature Algorithm 1998 6 ASIACRYPT Canteaut & Sendrier, Cryptanalysis of the Original McEliece Cryptosystem 1998 6 ASIACRYPT Sun, Improving the Security of the McEliece Public-Key Cryptosystem 1998 6 ASIACRYPT Mao & Lim, Cryptanalysis in Prime Order Subgroups of Z^*_n 1998 6 ASIACRYPT Dai & Ye & Lam, Weak Invertibility of Finite Automata and Cryptanalysis on FAPKC 1998 6 ASIACRYPT Safavi-Naini & Wang, Bounds and Constructions for Multireceiver Authentication Codes 1998 6 ASIACRYPT Frankel & Tsiounis & Yung, Fair Off-Line e-Cash Made Easy 1998 6 ASIACRYPT Boyd & Foo, Off-Line Fair Payment Protocols Using Convertible Signatures 1998 6 ASIACRYPT Chen, Efficient Fair Exchange with Verifiable Confirmation of Signatures 1998 6 ASIACRYPT Beaver, Adaptively Secure Oblivious Transfer 1998 6 ASIACRYPT Qi & Yang & Zhou, ML-Sequences over Rings Z/(2^e) 1998 6 ASIACRYPT Knudsen & Meier & Preneel & Rijmen & Verdoolaege, Analysis Methods for (Alleged) RC4 1998 6 ASIACRYPT Johansson, Reduced Complexity Correlation Attacks on Two Clock-Controlled Generators 1998 6 ASIACRYPT Stern, A New and Efficient All-Or-Nothing Disclosure of Secrets Protocol 1998 6 ASIACRYPT Nguyen & Stern, The Beguin-quisquater Server-Aided RSA Protocol from Crypto '95 Is Not Secure 1998 6 ASIACRYPT Burmester & Desmedt & Seberry, Equitable Key Escrow with Limited Time Span (or How to Enforce Time Expiration Cryptographically) 1998 6 ASIACRYPT Desmedt & Hou & Quisquater, Audio and Optical Cryptography 1998 6 ASIACRYPT Wolf, Strong Security Against Active Attacks in Information-Theoretic Secret-Key Agreement 1998 6 ASIACRYPT Kurosawa & Yoshida & Desmedt & Burmester, Some Bounds and a Construction for Secure Broadcast Encryption 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 1997 30 ASILOMARSSC McIlhenny & Ercegovac, On Using 1-out-of-n Codes for (p,q) Counter Implementations 1997 30 ASILOMARSSC Garg & Mendis, On Fault-Tolerant Polynomial Residue Number Systems 1997 30 ASILOMARSSC Elleithy, Choosing the System Moduli of RNS Arithmetic Processors 1997 30 ASILOMARSSC Hashemian, Fast Addition Using a New Number System 1997 30 ASILOMARSSC Cotofana & Vassiliadis, 2 - 1 Redundant Addition with Threshold Logic 1997 30 ASILOMARSSC Parhami, Variations on Multi-Operand Addition for Faster Logarithmic-Time Tree Multipliers 1997 30 ASILOMARSSC Hashemian, A New Method for Conversion of a 2's Complement to Canonic Sign Digit Number System and its Representation 1997 30 ASILOMARSSC Bhatnagar, DFT Computation with Prime Ramanujan Numbers 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 2000 37 BAMS Di Francesco, Folding and Coloring Problems in Mathematics and Physics 2000 37 BAMS Kon, review of Traub & Werschulz, Complexity and Information (Cambridge University Press, 1998) 2000 37 BAMS Mignotte, review of Smart, The Algorithmic Resolution of Diophantine Equations (Cambridge University Press, 1998) 1999 36 BAMS Aldous & Diaconis, Longest Increasing Subsequences: From Patience Sorting to the Baik-Deift-Johansson Theorem 1997 34 BAMS Carbone & Semmes, Making Proofs without Modus Ponens: An Introduction to the Combinatorics and Complexity of Cut Elimination 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 2000 71 BEATCS panel, Future Themes in Theoretical Computer Science 2000 71 BEATCS Fischer & Wehrheim, Failure-Divergence Semantics as a Formal Basis for an Object-Oriented Integrated Formal Method 2000 71 BEATCS Fortnow, Diagonalization 2000 71 BEATCS Busch & Demetriou & Herlihy & Mavronicolas, A Combinatorial Characterization of Properties Preserved by Antitokens 2000 71 BEATCS Kok & Kosters, Natural Data Mining Techniques 2000 71 BEATCS Salomaa, Depth of Functional Compositions 2000 71 BEATCS Karp, The Genomics Revolution and its Challenges for Algorithmic Research 2000 71 BEATCS Kreinovich & Longpre, How Important Is Theory for Practical Problems? A Partial Explanation of Hartmanis' Observation 2000 71 BEATCS Schoning, Mastering the Master Theorem 2000 71 BEATCS Vagvolgyi, Intersection of Finitely Generated Congruences over the Term Algebra with Equal Trunks 2000 71 BEATCS Heckel & Engels, Graph Transformation and Visual Modeling Techniques 2000 71 BEATCS Morales-Bueno & Fortes & Mora & Triguero, Two Classical Theorems Revisited 2000 70 BEATCS Srinivasan, Low-discrepancy Sets for High-dimensional Rectangles: A Survey 2000 70 BEATCS Ehrig & Geisler & Grosse-Rhode & Klar & Mann, On Formal Semantics and Integration of Object-Oriented Modeling Languages 2000 70 BEATCS Blass & Gurevich, The Underlying Logic of Hoare Logic 2000 70 BEATCS Bodei & Degano & Nielson & Nielson, Security Analysis Using Flow Logics 2000 70 BEATCS Buhrman, Quantum Computing and Communication Complexity 2000 70 BEATCS Honkala, The D0L Problem Revisited 2000 70 BEATCS Salomaa, Automata: Glimpses from Past and Present 2000 70 BEATCS Makinen, A Conjecture on the Error Bound of the Barycenter Heuristic 2000 70 BEATCS Trejo & Kreinovich & Longpre, Choosing a Physical Model: Why Symmetries? 2000 70 BEATCS Wang, On the Irregularity of the Duplication Closure 2000 70 BEATCS Choppy & Plasmeijer & Schneider, The Joy of Teaching Theoretical Computer Science 1999 69 BEATCS Downey & Fellows & Stege, Computational Tractability: The View From Mars 1999 69 BEATCS Padbe