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 39 matches
- 1991
- Attahiru Sule Alfa, Mingyuan Chen:
Approximating Queue Lengths in M(t)/G/1 Queue Using the Maximum Entropy Principle. Acta Informatica 28(8): 801-815 (1991) - James H. Anderson, Mohamed G. Gouda:
A New Explanation of the Glitch Phenomenon. Acta Informatica 28(4): 297-309 (1991) - Paolo Atzeni, Edward P. F. Chan:
Independent Database Schemes under Functional and Inclusion Dependencies. Acta Informatica 28(8): 777-779 (1991) - José M. Bernabéu-Aubán, Mustaque Ahamad, Mostafa H. Ammar:
Resource Finding in Store-and-Forward Networks. Acta Informatica 28(7): 657-680 (1991) - Eike Best, Raymond R. Devillers, Astrid Kiehn, Lucia Pomello:
Concurrent Bisimulations in Petri Nets. Acta Informatica 28(3): 231-264 (1991) - Jan van den Bos, Chris Laffra:
PROCOL: A Concurrent Object-Oriented Language with Protocols Delegation and Constraints. Acta Informatica 28(6): 511-538 (1991) - Daniel P. Bovet, Pierluigi Crescenzi:
Minimum-Delay Schedules in Layered Networks. Acta Informatica 28(5): 453-461 (1991) - Symeon Bozapalidis:
Effective Construction of the Syntactic Algebra of a Recognizable Series on Trees. Acta Informatica 28(4): 351-363 (1991) - David G. Cantor, Erich L. Kaltofen:
On Fast Multiplication of Polynomials over Arbitrary Algebras. Acta Informatica 28(7): 693-701 (1991) - Carol Critchlow, Prakash Panangaden:
The Expressive Power of Delay Operators in SCCS. Acta Informatica 28(5): 447-452 (1991) - Joost Engelfriet:
Branching Processes of Petri Nets. Acta Informatica 28(6): 575-591 (1991) - Ulrich Faigle, Walter Kern:
Some Order Dimension Bounds for Communication Complexity Problems. Acta Informatica 28(6): 593-601 (1991) - Donald W. Gillies, Jane W.-S. Liu:
Greed in Resource Scheduling. Acta Informatica 28(8): 755-775 (1991) - A. Nico Habermann:
Alan J. Perlis 1922-1990. Acta Informatica 28(5): 409-410 (1991) - Peter G. Harrison:
On the Expansion of Non-Linear Functions. Acta Informatica 28(6): 559-574 (1991) - Rolf Hennicker:
Observational Implementation of Algebraic Specifications. Acta Informatica 28(3): 187-230 (1991) - Susan Horwitz, Thomas W. Reps:
Efficient Comparison of Program Slices. Acta Informatica 28(8): 713-732 (1991) - Klaus Hülsmann, Gunter Saake:
Theoretical Foundations of Handling Large Substitution Sets in Temporal Integrity Monitoring. Acta Informatica 28(4): 365-407 (1991) - Deepak Kapur, Paliath Narendran, Daniel J. Rosenkrantz, Hantao Zhang:
Sufficient-Completeness, Ground-Reducibility and their Complexity. Acta Informatica 28(4): 311-350 (1991) - Uwe Kastens, William M. Waite:
An Abstract Data Type for Name Analysis. Acta Informatica 28(6): 539-558 (1991) - Reiner Kolla, Bernd Serf:
The Virtual Feedback Problem in Hierarchical Representations of Combinational Circuits. Acta Informatica 28(5): 463-476 (1991) - Mark Levene, George Loizou:
Correction to Null Values in Nested Relational Databases by Mark A. Roth, H. F. Korth, and A. Silberschatz. Acta Informatica 28(6): 603-605 (1991) - Friedrich Otto, Louxin Zhang:
Decision Problems for Finite Special String-Rewriting Systems that are Confluent on Some Congruence Class. Acta Informatica 28(5): 477-510 (1991) - Werner Pohlmann:
A Fixed Point Approach to Parallel Discrete Event Simulation. Acta Informatica 28(7): 611-629 (1991) - Paul Pritchard:
Opportunistic Algorithms for Eliminating Supersets. Acta Informatica 28(8): 733-754 (1991) - Xiaolei Qian:
The Expressive Power of the Bounded-Iteration Construct. Acta Informatica 28(7): 631-656 (1991) - Mark A. Roth, Henry F. Korth, Abraham Silberschatz:
Addendum to Null Values in Nested Relational Databases. Acta Informatica 28(6): 607-610 (1991) - Gregor Snelting:
The Calculus of Context Relations. Acta Informatica 28(5): 411-445 (1991) - Panagiotis J. Tomaras, Demetres D. Kouvatsos:
MRE Hierarchical Decomposition of General Queueing Network Models. Acta Informatica 28(3): 265-295 (1991) - Thomas P. Whaley:
Postorder Trees and Eulerian Numbers. Acta Informatica 28(7): 703-712 (1991)
skipping 9 more matches
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 2024-10-04 17:54 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