default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 30 matches
- 2002
- Jean Berstel, Luc Boasson:
Formal properties of XML grammars and languages. Acta Informatica 38(9): 649-671 (2002) - Paolo Bottoni
, Carlos Martín-Vide, Gheorghe Paun, Grzegorz Rozenberg:
Membrane systems with promoters/inhibitors. Acta Informatica 38(10): 695-720 (2002) - Arturo Carpi, Aldo de Luca, Stefano Varricchio:
Words, univalent factors, and boxes. Acta Informatica 38(6): 409-436 (2002) - Venkatesan T. Chakaravarthy, Susan Horwitz:
On the non-approximability of points-to analysis. Acta Informatica 38(8): 587-598 (2002) - Edward G. Coffman Jr., Peter J. Downey, Peter M. Winkler:
Packing rectangles in a strip. Acta Informatica 38(10): 673-693 (2002) - Pablo Cordero, Manuel Enciso, Inman P. de Guzmán:
Bases for closed sets of implicants and implicates in temporal logic. Acta Informatica 38(9): 599-619 (2002) - Flavio Corradini, Walter Vogler, Lars Jenner:
Comparing the worst-case efficiency of asynchronous systems with PAFAS. Acta Informatica 38(11/12): 735-792 (2002) - Michael Drmota:
The variance of the height of digital search trees. Acta Informatica 38(4): 261-276 (2002) - Dominic Duggan:
Object type constructors. Acta Informatica 38(6): 367-408 (2002) - Paul J. M. Frederiks, Theo P. van der Weide:
Deriving and paraphrasing information grammars using object-oriented analysis models. Acta Informatica 38(7): 437-488 (2002) - Chris Giannella, Dirk Van Gucht:
Adding a path connectedness operator to FO+poly (linear). Acta Informatica 38(9): 621-648 (2002) - Wim H. Hesselink:
An assertional criterion for atomicity. Acta Informatica 38(5): 343-366 (2002) - Iiro S. Honkala, Antoine Lobstein:
On the complexity of the identification problem in Hamming spaces. Acta Informatica 38(11/12): 839-845 (2002) - Chuzo Iwamoto, Katsuyuki Tateishi, Kenichi Morita
, Katsunobu Imai:
A quadratic speedup theorem for iterative arrays. Acta Informatica 38(11/12): 847-858 (2002) - Kim S. Larsen
:
Relaxed red-black trees with group updates. Acta Informatica 38(8): 565-586 (2002) - Huimin Lin, Wang Yi:
Axiomatising timed automata. Acta Informatica 38(4): 277-305 (2002) - Jixue Liu
, Millist W. Vincent:
Containment and disjointedness in partitioned normal form relations. Acta Informatica 38(5): 325-342 (2002) - Hosam M. Mahmoud
:
The size of random bucket trees via urn models. Acta Informatica 38(11/12): 813-838 (2002) - Erkki Mäkinen
, Tarja Systä:
Minimally adequate teacher synthesizes statechart diagrams. Acta Informatica 38(4): 235-259 (2002) - Madhu Mutyam
, Kamala Krithivasan:
Generalized normal form for rewriting P systems. Acta Informatica 38(10): 721-734 (2002) - Miguel R. Penabad
, Nieves R. Brisaboa
, Héctor J. Hernández, José R. Paramá
:
A general procedure to check conjunctive query containment. Acta Informatica 38(7): 489-529 (2002) - Antonella Santone:
Automatic verification of concurrent systems using a formula-based compositional approach. Acta Informatica 38(8): 531-564 (2002) - Dan A. Simovici, Dana Cristofor, Laurentiu Cristofor:
Impurity measures in databases. Acta Informatica 38(5): 307-324 (2002) - Vincent Vajnovszki:
Gray visiting Motzkins. Acta Informatica 38(11/12): 793-811 (2002) - 2001
- Robert M. Colomb, Christopher N. G. Dampney, Michael Johnson:
Category-theoretic fibration as an abstraction mechanism in information systems. Acta Informatica 38(1): 1-44 (2001) - Jürgen Dassow, Gheorghe Paun, Gabriel Thierrin, Sheng Yu:
Tree-systems of morphisms. Acta Informatica 38(2): 131-153 (2001) - Masami Ito, Carlos Martín-Vide, Victor Mitrana
:
Group weighted finite transducers. Acta Informatica 38(2): 117-129 (2001) - Karl Meinke, L. J. Steggles
:
Correctness of dataflow and systolic algorithms using algebras of streams. Acta Informatica 38(1): 45-88 (2001) - Arend Rensink
, Heike Wehrheim:
Process algebra with action dependencies. Acta Informatica 38(3): 155-234 (2001) - Salvatore La Torre, Margherita Napoli
:
Timed tree automata with an application to temporal logic. Acta Informatica 38(2): 89-116 (2001)
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2025-08-18 16:41 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint