10. ICALP 1983: Barcelona, Spain

• Samson Abramsky:
  On Semantic Foundations for Applicative Multiprogramming. 1-14
  
• Krzysztof R. Apt, Carole Delporte:
  An Axiomatization of the Intermittent Assertion Method Using Temporal Logic (Extended Abstract). 15-27
  
• André Arnold:
  Topological Characterizations of Infinite Behaviours of Transition Systems. 28-38
  
• J. W. de Bakker, Jan A. Bergstra, Jan Willem Klop, John-Jules Ch. Meyer:
  Linear Time and Branching Time Semantics for Recursion with Merge. 39-51
  
• J. W. de Bakker, Jeffery I. Zucker:
  Processes and a Fair Semantics for the Ada Rendez-Vous. 52-66
  
• Paul De Bra, Jan Paredaens:
  Conditional Dependencies for Horizontal Decompositions. 67-82
  
• Stephen D. Brookes:
  On the Relationship of CCS and CSP. 83-96
  
• Stephen D. Brookes, William C. Rounds:
  Behavioural Equivalence Relations Induced by Programming Logics. 97-108
  
• Ashok K. Chandra, Steven Fortune, Richard J. Lipton:
  Lower Bounds for Constant Depth Circuits for Prefix Problems. 109-117
  
• Christian Choffrut, Juhani Karhumäki:
  Test Sets for Morphisms with Bounded Delay. 118-127
  
• Shimon Cohen, Daniel J. Lehmann, Amir Pnueli:
  Symmetric and Economical Solutions to the Mutual Exclusion Problem in a Distributed System (Extended Abstract). 128-136
  
• Karel Culik II, Arto Salomaa:
  Ambiguity and Decision Problems Concerning Number Systems. 137-146
  
• Philippe Darondeau, Laurent Kott:
  On the Observational Semantics of Fair Parallelism. 147-159
  
• Frank K. H. A. Dehne:
  On O(N^4) Algorithm to Contstruct all Vornoi Diagrams for K Nearest Neighbor Searching. 160-172
  
• Marie-Pierre Delest, Gérard Viennot:
  Algebraic Languages and Polyominoes Enumeration. 173-181
  
• Herbert Edelsbrunner, Emo Welzl:
  On the Number of Equal-Sized Semisapces of a Set of Points in the Plane (Extended Abstract). 182-187
  
• Hartmut Ehrig, Eric G. Wagner, James W. Thatcher:
  Algebraic Specifications with Generating Constraints. 188-202
  
• Aviezri S. Fraenkel:
  Wythoff Games, Continued Fractions, Cedar Trees and Fibonacci Searches. 203-225
  
• Joaquim Gabarró:
  Initial Index: A New Complexity Function for Languages. 226-236
  
• Harald Ganzinger:
  Modular Compiler Descriptions Based on Abstract Semantic Data Types (Extended Abstract). 237-249
  
• Joachim von zur Gathen, Erich Kaltofen:
  Polynomial-Time Factorization of Multivariate Polynomials over Finite Fields. 250-263
  
• Ursula Goltz, Wolfgang Reisig:
  Processes of Place/Transition-Nets. 264-277
  
• Joseph Y. Halpern, Zohar Manna, Ben C. Moszkowski:
  A Hardware Semantics Based on Temporal Intervals. 278-291
  
• Susanne E. Hambrusch, Janos Simon:
  Lower Bounds for Solving Undirected Graph Problems on VLSI. 292-303
  
• Sergiu Hart, Micha Sharir:
  Concurrent Probabilistic Program, or: How to Schedule if You Must. 304-318
  
• Juris Hartmanis, Yaacov Yesha:
  Computation Times of NP Sets of Different Densities. 319-330
  
• Jieh Hsiang, Nachum Dershowitz:
  Rewrite Methods for Clausal and Non-Clausal Theorem Proving. 331-346
  
• Klaus Indermark:
  Complexity of Infinite Trees. 347-360
  
• Jean-Pierre Jouannaud, Claude Kirchner, Hélène Kirchner:
  Incremental Construction of Unification Algorithms in Equational Theories. 361-373
  
• Tsutomu Kamimura:
  Tree Automata and Attribute Grammars. 374-384
  
• Tsutomu Kamimura, Adrian Tang:
  Effectively Given Spaces. 385-396
  
• Juhani Karhumäki:
  A Note on Intersections of Free Submonoids of a Free Monoid. 397-407
  
• Hans-Werner Lang, Manfred Schimmler, Hartmut Schmeck, Heiko Schröder:
  A Fast Sorting Algorithm for VLSI. 408-419
  
• Michel Latteux, Jeannine Leguy:
  On the Composition of Morphisms and Inverse Morphisms. 420-432
  
• Evelyne Barbin-Le Rest, Stuart W. Margolis:
  On the Group Complexity of a Finite Language. 433-444
  
• Daniel J. Lehmann, Saharon Shelah:
  Reasoning with Time and Chance (Extended Abstract). 445-457
  
• Arjen K. Lenstra:
  Factoring Multivariate Integral Polynomials. 458-465
  
• Pierre Lescanne, Jean-Marc Steyaert:
  On the Study Data Structures: Binary Tournaments with Repeated Keys. 466-477
  
• Fillia Makedon, Ivan Hal Sudborough:
  Minimizing Width in Linear Layouts. 478-490
  
• Zohar Manna, Amir Pnueli:
  Proving Precedence Properties: The Temporal Way. 491-512
  
• Bernhard Möller:
  An Algebraic Semantics for Busy (Data-Driven) and Lazy (Demand-Driven) Evaluation and its Application to a Functional Language. 513-526
  
• J. Ian Munro, Patricio V. Poblete:
  Searchability in Merging and Implicit Data Structures. 527-535
  
• Alan Mycroft, Flemming Nielson:
  Strong Abstract Interpretation Using Power Domains (Extended Abstract). 536-547
  
• Rocco De Nicola, Matthew Hennessy:
  Testing Equivalence for Processes. 548-560
  
• Ernst-Rüdiger Olderog, C. A. R. Hoare:
  Specification-Oriented Semantics for Communicating Processes. 561-572
  
• Pekka Orponen:
  Complexity Classes of Alternating Machines with Oracles. 573-584
  
• Jean-Jacques Pansiot:
  A Propos d'une Conjecture de F. Dejean sur les Répétitions dans les Mots. 585-596
  
• Wolfgang J. Paul, Uzi Vishkin, Hubert Wagener:
  Parallel Dictionaries in 2-3 Trees. 597-609
  
• Dominique Perrin:
  Varietes de Semigroupes et Mots Infinis. 610-616
  
• Jean-Eric Pin:
  Arbres et Hierarchies de Concatenation. 617-628
  
• John H. Reif, A. Prasad Sistla:
  A Multiprocess Network Logic with Temporal and Spatial Modalities. 629-639
  
• Taisuke Sato, Hisao Tamaki:
  Enumeration of Success Patterns in Logic Programs. 640-652
  
• Uwe Schöning, Ronald V. Book:
  Immunity (Extended Abstract). 653-661
  
• Michael B. Smyth:
  Power Domains and Predicate Transformers: A Topological View. 662-675
  
• Jeremy Spinrad, Jacobo Valdes:
  Recognition and Isomorphism of Two Dimensional Partial Orders. 676-686
  
• Paul M. B. Vitányi:
  On the Simulation of Many Storage Heads by a Single One (Extended Abstract). 687-694
  
• Glynn Winskel:
  Synchronisation Trees. 695-711
  
• Mihalis Yannakakis, Paris C. Kanellakis, Stavros S. Cosmadakis, Christos H. Papadimitriou:
  Cutting and Partitioning a Graph aifter a Fixed Pattern (Extended Abstract). 712-722
  
• Klaus-Jörn Lange:
  Context-Free Controlled ETOL Systems. 723-733
  

Last update Fri May 25 08:16:28 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page