Abstract is missing.
- On the Semantics of Logic ProgramsMaurizio Gabbrielli, Giorgio Levi. 1-19
- Logic Programming with Recurrence DomainsHong Chen, Jieh Hsiang. 20-34
- Extensional Embedding of a Strongly Stable Model of PCFAntonio Bucciarelli, Thomas Ehrhard. 35-46
- Uniform Ideals and Strictness AnalysisChristine Ernoult, Alan Mycroft. 47-59
- Logical and Computational Aspects of Programming with Sets/Bags/ListsVal Tannen, Ramesh Subrahmanyam. 60-75
- Safety for Branching Time SemanticsAhmed Bouajjani, Jean-Claude Fernandez, Susanne Graf, Carlos Rodriguez, Joseph Sifakis. 76-92
- Program Composition and Modular VerificationLimor Fix, Nissim Francez, Orna Grumberg. 93-114
- Model-Checking for Probabilistic Real-Time Systems (Extended Abstract)Rajeev Alur, Costas Courcoubetis, David L. Dill. 115-126
- Computing Behavioural Relations, LogicallyRance Cleaveland, Bernhard Steffen. 127-138
- The POwer of ReconfigurationYosi Ben-Asher, David Peleg, R. Ramaswami, Assaf Schuster. 139-150
- General Resolution of Tseitin Formulas is HardJean-Denis Fouks. 151-162
- Program Checkers for Probability GenerationSampath Kannan, Andrew Chi-Chih Yao. 163-173
- Running Time to Recognize Nonregular Languages by 2-Way Probabilistic AutomataJanis Kaneps, Rusins Freivalds. 174-185
- Static on Random TreesRafael Casas, Josep Díaz, Conrado Martinez. 186-203
- The Expressive Power of Implicit SpecificationsKim Guldstrand Larsen. 204-216
- CCS + Time = An Interleaving Model for Real Time SystemsWang Yi. 217-228
- On Confluent Semi-Commutations - Decidability and Complexity ResultsVolker Diekert, Edward Ochmanski, Klaus Reinhardt. 229-241
- Lazard s Factorizations of Free Partially Commutative MonoidsGérard Duchamp, Daniel Krob. 242-253
- A Kleene Theorem for Infinite Trace LanguagesPaul Gastin, Antoine Petit, Wieslaw Zielonka. 254-266
- Cononical Sets of Horn ClausesNachum Dershowitz. 267-278
- A Specialized Completion Procedure for Monadic String-Rewriting Systems Presenting GroupsKlaus Madlener, Paliath Narendran, Friedrich Otto. 279-290
- A Concluent Reduction for the Lambda-Calculus with Surjective Pairing and Terminal ObjectPierre-Louis Curien, Roberto Di Cosmo. 291-302
- Provably Recursive Programs and Program ExtractionTim Fernando. 303-313
- Efficient Algorithms for Path Problems with Gernal Cost CiteriaThomas Lengauer, Dirk Theune. 314-326
- Computing Shortest Paths and Distances in Planar GraphsHristo Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis. 327-338
- Maintaining Biconnected Components of Dynamic Planar GraphsZvi Galil, Giuseppe F. Italiano. 339-350
- Efficient Maximal Cubic Graph Cuts (Extended Abstract)Martin Loebl. 351-362
- Strutural Parallel AlgorithmicsUzi Vishkin. 363-380
- Improving Known Solutions is HardDesh Ranjan, Suresh Chari, Pankaj Rohatgi. 381-392
- Collapsing Degrees via Strong Computation (Extended Abstract)Lane A. Hemachandra, Albrecht Hoene. 393-404
- Fast Parallel Generation of Random PermutationsTorben Hagerup. 405-416
- A Parallel Algorithm for Two Processors Precedence Constraint SchedulingHermann Jung, Maria J. Serna, Paul G. Spirakis. 417-428
- An Efficient NC Algorithm for Finding Hamiltonian Cycles in Dense Directed GraphsMartin Fürer. 429-440
- On Logics, Tilings, and AutomataWolfgang Thomas. 441-454
- Satisfiability of Systems of Ordinal Notations with the Subterm Property is DecidableJean-Pierre Jouannaud, Mitsuhiro Okada. 455-468
- Complete Axiomatizations of Some Quotient Term AlgebrasHubert Comon. 469-480
- The Meaning of Negative Premises in Transition System SpecificationsRoland N. Bol, Jan Friso Groote. 481-494
- Deciding History Preserving BisimilarityWalter Vogler. 495-505
- Adding Action Refinement to a Finite Process AlgebraLuca Aceto, Matthew Hennessy. 506-519
- Improved Parallel Computations with Matrices and PolynomialsDario Bini, Luca Gemignani, Victor Y. Pan. 520-531
- Finding Minimal Forbidden Minors Using a Finite CongruenceJens Lagergren, Stefan Arnborg. 532-543
- Better Algorithms for the Pathwidth and Treewidth of GraphsHans Leo Bodlaender, Ton Kloks. 544-555
- Two P-Complete Problems in the Theory of the RealsFelipe Cucker, A. Torrecillas. 556-565
- L Morphisms: Bounded Delay and Regularity of AmbiguityJuha Honkala, Arto Salomaa. 566-574
- Degree and Decomposability of Variable-Length CodesVéronique Bruyère, Clelia de Felice. 575-587
- An Eilenberg Theorem for Infinity-LanguagesThomas Wilke. 588-599
- Balancing Order and Chaos in Image Generation (Extended Abstract)Karel Culik II, Simant Dube. 600-614
- Average Case ComplexityYuri Gurevich. 615-628
- Minimal NFA Problems Are HardTao Jiang, Bala Ravikumar. 629-640
- Algorithms for Determining the Smallest Number of Nonterminals (States) Sufficient for Generating (Accepting) a Regular LanguageKosaburo Hashiguchi. 641-648
- Computing Shortest TransversalsBinay K. Bhattacharya, Godfried T. Toussaint. 649-660
- Ray Shooting in Polygons Using Geodesic TriangulationsBernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink. 661-646
- The Expected Extremes in a Delaunay TriangulationMarshall W. Bern, David Eppstein, F. Frances Yao. 674-685
- Computational Geometry for the Gourmet: Old Fare and New DishesBernard Chazelle. 686-696
- On the Power of Multiple Reads in a ChipPavol Duris, Zvi Galil. 697-706
- On Linear Decision Trees Computing Boolean FunctionsHans Dietmar Gröger, György Turán. 707-718
- An Almost Linear-Time Algorithm for the Dense Subset-Sum ProblemZvi Galil, Oded Margalit. 719-727
- On-Line Algorithms for Weighted Bipartite Matching and Stable MarriagesSamir Khuller, Stephen G. Mitchell, Vijay V. Vazirani. 728-738
- String Matching with Preprocessing of Text and PatternMoni Naor. 739-750
- Ordering Problems Approximated: Single-Processor Scheduling and Interval Graph CompletionR. Ravi, Ajit Agrawal, Philip N. Klein. 751-762