default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDActa Informatica, Volume 38
Volume 38, Number 1, 2001
- Robert M. Colomb, Christopher N. G. Dampney, Michael Johnson:
Category-theoretic fibration as an abstraction mechanism in information systems. 1-44 - Karl Meinke, L. J. Steggles
:
Correctness of dataflow and systolic algorithms using algebras of streams. 45-88
Volume 38, Number 2, 2001
- Salvatore La Torre, Margherita Napoli:
Timed tree automata with an application to temporal logic. 89-116 - Masami Ito, Carlos Martín-Vide, Victor Mitrana:
Group weighted finite transducers. 117-129 - Jürgen Dassow, Gheorghe Paun, Gabriel Thierrin, Sheng Yu:
Tree-systems of morphisms. 131-153
Volume 38, Number 3, 2001
- Arend Rensink, Heike Wehrheim:
Process algebra with action dependencies. 155-234
Volume 38, Number 4, 2002
- Erkki Mäkinen, Tarja Systä:
Minimally adequate teacher synthesizes statechart diagrams. 235-259 - Michael Drmota:
The variance of the height of digital search trees. 261-276 - Huimin Lin, Wang Yi:
Axiomatising timed automata. 277-305
Volume 38, Number 5, 2002
- Dan A. Simovici, Dana Cristofor, Laurentiu Cristofor:
Impurity measures in databases. 307-324 - Jixue Liu, Millist W. Vincent:
Containment and disjointedness in partitioned normal form relations. 325-342 - Wim H. Hesselink:
An assertional criterion for atomicity. 343-366
Volume 38, Number 6, 2002
- Dominic Duggan:
Object type constructors. 367-408 - Arturo Carpi, Aldo de Luca, Stefano Varricchio:
Words, univalent factors, and boxes. 409-436
Volume 38, Number 7, 2002
- Paul J. M. Frederiks, Theo P. van der Weide:
Deriving and paraphrasing information grammars using object-oriented analysis models. 437-488 - Miguel R. Penabad, Nieves R. Brisaboa, Héctor J. Hernández, José R. Paramá:
A general procedure to check conjunctive query containment. 489-529
Volume 38, Number 8, 2002
- Antonella Santone:
Automatic verification of concurrent systems using a formula-based compositional approach. 531-564 - Kim S. Larsen:
Relaxed red-black trees with group updates. 565-586 - Venkatesan T. Chakaravarthy, Susan Horwitz:
On the non-approximability of points-to analysis. 587-598
Volume 38, Number 9, 2002
- Pablo Cordero, Manuel Enciso, Inman P. de Guzmán:
Bases for closed sets of implicants and implicates in temporal logic. 599-619 - Chris Giannella, Dirk Van Gucht:
Adding a path connectedness operator to FO+poly (linear). 621-648 - Jean Berstel, Luc Boasson:
Formal properties of XML grammars and languages. 649-671
Volume 38, Number 10, 2002
- Edward G. Coffman Jr., Peter J. Downey, Peter M. Winkler:
Packing rectangles in a strip. 673-693 - Paolo Bottoni, Carlos Martín-Vide, Gheorghe Paun, Grzegorz Rozenberg:
Membrane systems with promoters/inhibitors. 695-720 - Madhu Mutyam, Kamala Krithivasan:
Generalized normal form for rewriting P systems. 721-734
Volume 38, Number 11/12, 2002
- Flavio Corradini, Walter Vogler, Lars Jenner:
Comparing the worst-case efficiency of asynchronous systems with PAFAS. 735-792 - Vincent Vajnovszki:
Gray visiting Motzkins. 793-811 - Hosam M. Mahmoud:
The size of random bucket trees via urn models. 813-838 - Iiro S. Honkala, Antoine Lobstein:
On the complexity of the identification problem in Hamming spaces. 839-845 - Chuzo Iwamoto, Katsuyuki Tateishi, Kenichi Morita, Katsunobu Imai:
A quadratic speedup theorem for iterative arrays. 847-858
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-11-18 22:33 CET 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:
