Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID11th ICALP 1984: Antwerp, Belgium
- Jan Paredaens:
Automata, Languages and Programming, 11th Colloquium, Antwerp, Belgium, July 16-20, 1984, Proceedings. Lecture Notes in Computer Science 172, Springer 1984, ISBN 3-540-13345-3 - Ronald Fagin, Moshe Y. Vardi:
The Theory of Data Dependencies - An Overview. 1-22 - Arnold L. Rosenberg:
The VLSI Revolution in Theoretical Circles. 23-40 - Serge Abiteboul, Seymour Ginsburg:
Tuple Sequences and Indexes. 41-50 - Foto N. Afrati, Christos H. Papadimitriou, George Papageorgiou:
The Complexity of Cubical Graphs (Extended Abstract). 51-57 - Klaus Ambos-Spies:
P-Generic Sets. 58-68 - Paolo Atzeni, Nicola M. Morfuni:
Functional Dependencies and Disjunctive Existence Constraints in Database Relations with Null Values. 69-81 - Jan A. Bergstra, Jan Willem Klop:
The Algebra of Recursively Defined Processes and the Algebra of Regular Processes. 82-94 - Michel Bidoit:
Algebraic Specification of Exception Handling and Error Recovery by Means of Declarations and Equations. 95-108 - Anselm Blumer, J. Blumer, Andrzej Ehrenfeucht, David Haussler, Ross M. McConnell:
Building the Minimal DFA for the Set of all Subwords of a Word On-line in Linear Time. 109-118 - Bernard Chazelle, Thomas Ottmann, Eljas Soisalon-Soininen, Derick Wood:
The Complexity and Decidability of Separation. 119-127 - Charles J. Colbourn, Andrzej Proskurowski:
Concurrent Transmissions in Broadcast Networks. 128-136 - Maxime Crochemore:
Linear Searching for a Squre in a Word (Abstract). 137 - Peter Dybjer:
Domain Algebras. 138-150 - Didier Ferment:
Principality Results About Some Matrix Languages Families. 151-161 - Laurent Fribourg:
Oriented Equational Clauses as a Programming Language. 162-173 - Danièle Gardy, Claude Puech:
Relational Algebra Operations and Sizes of Relations. 174-186 - Danièle Beauquier:
Some Results About Finite and Infinite Behaviours of a Pushdown Automaton. 187-195 - Ursula Goltz, Alan Mycroft:
On the Relationship of CCS and Petri Nets. 196-208 - Mohamed G. Gouda, Louis E. Rosier:
Communicating Finite State Machines with Priority Channnels. 209-221 - Susanne Graf, Joseph Sifakis:
A Modal Characterization of Observational Congruence on Finite Terms of CCS. 222-234 - Juraj Hromkovic:
Communication Complexity. 235-246 - Oscar H. Ibarra, Sam M. Kim, Louis E. Rosier:
Space and Time Efficient Simulations and Characterizations of Some Restricted Classes of PDAs. 247-259 - Hiroyuki Izumi, Yasuyoshi Inagaki, Namio Honda:
A Complete Axiom System for Algebra of Closed-Regular Expression. 260-269 - Mark Jerrum:
The Complexity of Finding Minimum-Length Generator Sequences (Extended Abstract). 270-280 - Hermann Jung:
On Probabilistic Tape Complexity and Fast Circuits for Matrix Inversion Problems (Extended Abstract). 281-291 - Juhani Karhumäki:
On Three-Element Codes. 292-302 - Peter Kirschenhofer, Helmut Prodinger:
Recursion Depth Analysis for Specail Tree Traversal Algorithms. 303-311 - J. C. Lagarias:
Performance Analysis of Shamir's Attack on the Basic Merkle-Hellman Knapsack Cryptosystem. 312-323 - Heikki Mannila:
Measures of Presortedness and Optimal Sorting Algorithms (Extended Abstract). 324-336 - Stuart W. Margolis, Jean-Eric Pin:
Languages and Inverse Semigroups. 337-346 - Kurt Mehlhorn, Franco P. Preparata:
Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time. 347-357 - M. A. Nait Abdallah:
On the Interpretation of Infinite Computations in Logic Programming. 358-370 - Robert Paige, Robert Endre Tarjan:
A Linear Time Algorithm to Solve the Single Function Coarsest Partition Problem. 371-379 - Jean-Jacques Pansiot
:
Complexité des Facteurs des Mots Infinis Engendrés par Morphimes Itérés. 380-389 - Jean-Pierre Pécuchet:
Automates Boustrophendon, Semi-Groupe de Birget et Monoide Inversiv Libre (Abstract/ Résumé). 390 - John H. Reif, Paul G. Spirakis:
Probabilistic Bidding Gives Optimal Distributed Resource Allocation. 391-402 - Wolfgang Reisig:
Partial Order Semantics versus Interleaving Semantics for CSP-like Languages and its Impact on Fairness. 403-413 - Antonio Restivo, Christophe Reutenauer:
Cancellation, Pumping and Permutation in Formal Languages. 414-422 - Dorit Ron, Flavia Rosemberg, Amir Pnueli:
A Hardware Implementation of the CSP Primitives and its Verification. 423-435 - Arnold Schönhage:
Factorization of Univariate Integer Polynomials by Diophantine Aproximation and an Improved Basis Reduction Algorithm. 436-447 - Uwe Schöning:
Robust Algorithms: A Different Approach to Oracles. 448-453 - Thomas H. Spencer, Ernst W. Mayr:
Node Weighted Matching. 454-464 - Robert S. Streett, E. Allen Emerson:
The Propositional Mu-Calculus is Elementary. 465-472 - Athanasios K. Tsakalidis:
AVL-Trees for Localized Search. 473-485 - Paul M. B. Vitányi:
The Simple Roots of Real-Time Computation Hierarchies (Preliminary Version). 486-489 - Jeffrey Scott Vitter:
Computational Complexity of an Optical Disk Interface (Extended Abstract). 490-502 - Emo Welzl:
Encoding Graphs by Derivations and Implications for the Theory of Graph Grammars. 503-513 - Dan E. Willard:
Sampling Algorithms for Differential Batch Retrieval Problems (Extended Abstract). 514-526
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 05:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
