default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDActa Informatica, Volume 34
Volume 34, Number 1, 1997
- Ke Wang, Weining Zhang, Siu-Cheung Chau:
Weakly Independent Database Schemes. 1-22 - N. W. Keesmaat, H. C. M. Kleijn:
Net-Based Control Versus Rational Control. The Relation Between ITNC Vector Languages and Rational Relations. 23-57 - Zoltán Fülöp
, Sándor Vágvölgyi:
Minimal Equational Representations of Recognizable Tree Languages. 59-84
Volume 34, Number 2, 1997
- Javier Esparza:
Decidability of Model Checking for Infinite-State Concurrent Systems. 85-107 - Thomas Eiter, Heikki Mannila:
Distance Measures for Point Sets and their Computation. 109-133 - Mark Levene, George Loizou:
The Additivity Problem for Functional Dependencies in Incomplete Relations. 135-149 - Karel Culík II, Jarkko Kari:
Computational Fractal Geometry with WFA. 151-166
Volume 34, Number 3, 1997
- Levent V. Orman:
Relational Database Constraints as Counterexamples. 167-189 - Teodor Rus, Sriram V. Pemmaraju:
Using Graph Coloring in an Algebraic Compiler. 191-209 - Alexander Shapiro:
A Generalized Distribution Model for Random Recursive Trees. 211-216 - Ismo Hakala, Juha Kortelainen:
On the System of word equations x^i_1 x^i_2 ... x^i_m = y^i_1 y^i_2 ...y^i_n (i=1, 2, ...) in a Free Monoid. 217-230 - Hristo N. Djidjev, Shankar M. Venkatesan:
Reduced Constants for Simple Cycle Graph Separation. 231-243
Volume 34, Number 4, 1997
- Petr Savický, Ingo Wegener:
Efficient Algorithms for the Transformation Between Different Types of Binary Decision Diagrams. 245-256 - Victor Mitrana:
On the Interdependence Between Shuffle and Crossing-Over Operations. 257-266 - Arnd Rußmann:
Dynamic LL(k) Parsing. 267-289 - Flavio Corradini, Rocco De Nicola:
Locality Based Semantics for Process Algebras. 291-324
Volume 34, Number 5, 1997
- Koichi Yamazaki:
A Hierarchy of the Class of Apex NLC Graph Languages by Bounds on the Number of Nonterminal Nodes in Productions. 325-335 - Y. Daniel Liang, Maw-Shang Chang:
Minimum Feedback Vertex Sets in Cocomparability Graphs and Convex Bipartite Graphs. 337-346 - Karel Culík II, Simant Dube:
Implementing Daubechies Wavelet Transform with Weighted Finite Automata. 347-366 - Ryszard Janicki, Maciej Koutny:
Fundamentals of Modelling Concurrency Using Discrete Relational Structures. 367-388 - Kenichi Morita, Noritaka Nishihara, Yasunori Yamamoto, Zhiguo Zhang:
A Hierarchy of Uniquely Parsable Grammar Classes and Deterministic Acceptors. 389-410
Volume 34, Number 6, 1997
- Georg Trogemann, Matthias Gente:
Performance Analysis of Parallel Programs Based on Directed Acyclic Graphs. 411-428 - Kemal Efe, Nancy Eleser:
An Optimal Emulator and VLSI Layout for Complete Binary Trees. 429-447 - Roberto Barbuti, Nicoletta De Francesco, Antonella Santone:
Algebraic Computational Models of OR-Parallel Execution of Prolog. 449-489
Volume 34, Number 7, 1997
- Robert Stephens:
A Survey of Stream Processing. 491-541 - Sampath Rangarajan, Yennun Huang, Satish K. Tripathi:
On the Scalability and Mean-Time to Failure of k Resilient Protocols. 543-556 - Nieves R. Brisaboa, Héctor J. Hernández:
Testing Bag-Containment of Conjunctive Queries. 557-578
Volume 34, Number 8, 1997
- Chi-Chung Hui, Samuel T. Chanson:
Minimal Communication Cost Software Construction in the Internet Environment. 579-595 - Albert Nymeyer, Joost-Pieter Katoen:
Code Generation Based on Formal BURS Therory and Heuristic Search. 597-635 - János Aczél, Wolfgang Ertel:
A New Formula for Speedup and its Characterization. 637-652
Volume 34, Number 9, 1997
- C. Samuel Hsieh:
A Fine-Grained Data-Flow Analysis Framework. 653-665 - Vijay K. Garg, Alexander I. Tomlinson:
Using the Causal Domain to Specify and verify Distributed Programs. 667-686 - Apostolos Burnetas, Daniel Solow, Rishi Agarwal:
An Analysis and Implementation of an Efficient In-Place Bucket Sort. 687-700 - Christel Baier, Mila E. Majster-Cederbaum:
Metric Semantics from Partial Order Semantics. 701-735
Volume 34, Number 10, 1997
- Arnd Poetzsch-Heffter:
Prototyping Realistic Programming Languages Based on Formal Specifications. 737-772 - Joost Engelfriet, Jan Joris Vereijken:
Context-Free Graph Grammars and Concatenation of Graphs. 773-803
Volume 34, Number 11, 1997
- Flavio Corradini, Roberto Gorrieri, Marco Roccetti:
Performance Preorder and Competitive Equivalence. 805-835 - Henning Fernau:
Unconditional Transfer in Regulated Rewriting. 837-857 - Lane A. Hemaspaandra, Jörg Rothe, Gerd Wechsung:
Easy Sets and Hard Certificate Schemes. 859-879
Volume 34, Number 12, 1997
- John L. Bruno, Edward G. Coffman Jr.:
Optimal Fault-Tolerant Computing on Multiprocessor Systems. 881-904 - Dominique Laurent, Viet Phan Luong, Nicolas Spyratos:
The Use of Deleted Tuples in Database, Querying and Updating. 905-925 - Arthur H. M. ter Hofstede, E. Lippe, Theo P. van der Weide:
Applications of a Categorical Framework for Conceptual Data Modelling. 927-963
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 2025-10-24 21:51 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:
