Abstract is missing.
- Reasoning About Linear Constraints Using Parametric QueriesTien Huynh, Leo Joskowicz, Catherine Lassez, Jean-Louis Lassez. 1-20
- Discriminant CircumscriptionLi-Yan Yuan, Jia-Huai You. 21-32
- Complexity of Algebraic SpecificationRamesh Subrahmanyam. 33-37
- A New Method for Undecidability Proofs of First Order TheoriesRalf Treinen. 48-62
- Generating Plans in Linear LogicM. Masseron, Christophe Tollu, Jacqueline Vauzeilles. 63-75
- Automata-Theoretic Techniques for Image Generation and CompressionKarel Culik II, Simant Dube. 76-90
- Recognizable Infinite Tree Sets and their ComplexityAbdellatif Saoudi. 91-103
- The Expressibility of Nondeterministic Auxiliary Stack Automata and its Relation to Treesize Bounded Alternating Auxiliary Pushdown AutomataV. Vinay, V. Chandru. 104-114
- Towards Constructive Program Derivation in VDMChristopher P. Lewington. 115-132
- A New Method for Proving Termination of AC-Rewrite SystemsDeepak Kapur, G. Sivakumar, Hantao Zhang. 133-148
- Efficient Parallel Algorithms for Optical Computing with the DFT PrimitiveJohn H. Reif, Akhilesh Tyagi. 149-160
- The Power of Collision: Randomized Parallel Algorithms for Chaining and Integer SortingRajeev Raman. 161-175
- Fast Parallel Algorithms for CographsRong Lin, Stephan Olariu. 176-189
- Optimally Representing Euclidean Space Discretely for Analogically Simulating Physical PhenomenaJohn Case, Dayanand S. Rajan, Anil M. Shende. 190-203
- Optimal Parallel Algorithms for Testing Isomorphism of Trees and Outerplanar GraphsChristos Levcopoulos, Andrzej Lingas, Ola Petersson, Wojciech Rytter. 204-214
- Randomized Parallel SelectionSanguthevar Rajasekaran. 215-224
- A Fast Parallel Algorithm for Finding a Maximal Bipartite SetDavid Pearson, Vijay V. Vazirani. 225-231
- On Parallel Evaluation of Classes of CircuitsS. Rao Kosaraju. 232-237
- Voronoi Diagrams of Moving Points in the PlaneJyh-Jong Fu, Richard C. T. Lee. 238-254
- Efficient algorithms for Identifying All Maximal Isothetic Empty Rectangles in VLSI Layout DesignSubhas C. Nandy, Bhargab B. Bhattacharya, Sibabrata Ray. 255-269
- On Some Largest Empty Orthoconvex Polygons in a Point SetAmitava Datta, G. D. S. Ramkumar. 270-285
- Defining Process Fairness for Non-Interleaving ConcurrencyMarta Z. Kwiatkowska. 286-300
- Observational Logics and Concurrency ModelsRocco De Nicola, Gian Luigi Ferrari. 301-315
- Distributed Reset (Extended Abstract)Anish Arora, Mohamed G. Gouda. 316-331
- Refinement and Composition of Transition-based Rely-Guarantee Specification with Auxiliary VariablesPeter Grønning, Thomas Qvist Nielsen, Hans Henrik Løvengreen. 332-348
- Efficient Algorithms for Crash Recovery in Distributed SystemsTong-Ying Tony Juang, Subbarayan Venkatesan. 349-361
- A Non-Standard Inductive SemanticsGianna Reggio. 362-372
- Relating Full Abstraction Results for Different Programming LanguagesKurt Sieber. 373-387
- Towards a Theory of Commonsense Visual ReasoningB. Chandrasekaran, N. Hari Narayanan. 388-409
- Natural Language Processing, Complexity Theory and Logic (Extended Abstract)Akshar Bharati, Rajeev Sangal, Vineet Chaitanya. 410-420