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 37 matches
- 2006
- Anastasia Analyti, Ioannis Pachoulakis:
Logic Programming Representation of the Compound Term Composition Algebra. Fundam. Informaticae 73(3): 321-360 (2006) - Antonio Brogi, Jean-Marie Jacquet, Joost N. Kok:
Foundations on Coordination Languages and Software Architectures. Fundam. Informaticae 73(4) (2006) - Antonio Brogi, Jean-Marie Jacquet, Isabelle Linden:
Fully Abstract Semantics for a Coordination Model with Asynchronous Communication and Enhanced Matching. Fundam. Informaticae 73(4): 431-478 (2006) - Cristian S. Calude, Cezar Câmpeanu, Monica Dumitrescu:
Automata Recognizing No Words: A Statistical Approach. Fundam. Informaticae 73(1-2): 1-18 (2006) - Rodica Ceterchi:
An Algebraic Characterization of Semi-Simple Splicing. Fundam. Informaticae 73(1-2): 19-25 (2006) - Gabriel Ciobanu, Gheorghe Paun, Mario J. Pérez-Jiménez:
On the Branching Complexity of P Systems. Fundam. Informaticae 73(1-2): 27-36 (2006) - Erzsébet Csuhaj-Varjú, Alexandru Mateescu:
On a Connection Between Cooperating Distributed Grammar Systems and Basic Process Algebra. Fundam. Informaticae 73(1-2): 37-50 (2006) - Cunsheng Ding, Arto Salomaa:
Secret Sharing Schemes with Nice Access Structures. Fundam. Informaticae 73(1-2): 51-63 (2006) - Cunsheng Ding, Arto Salomaa:
On Some Problems of Mateescu Concerning Subword Occurrences. Fundam. Informaticae 73(1-2): 65-79 (2006) - Liviu Petrisor Dinu, Andrea Sgarro:
A Low-complexity Distance for DNA Strings. Fundam. Informaticae 73(3): 361-372 (2006) - Michael Domaratzki, Grzegorz Rozenberg, Kai Salomaa:
Interpreted Trajectories. Fundam. Informaticae 73(1-2): 81-97 (2006) - Manfred Droste, Jarkko Kari, Paula Steinby:
Observations on the Smoothness Properties of Real Functions Computed by Weighted Finite Automata. Fundam. Informaticae 73(1-2): 99-106 (2006) - Sorina Dumitrescu:
Faster Algorithm for Designing Optimal Prefix-Free Codes with Unequal Letter Costs. Fundam. Informaticae 73(1-2): 107-117 (2006) - Roberto Gorrieri, Roberto Lucchi, Gianluigi Zavattaro:
Supporting Secure Coordination in SecSpaces. Fundam. Informaticae 73(4): 479-506 (2006) - Vesa Halava, Tero Harju, Juhani Karhumäki:
Undecidability in omega-Regular Languages. Fundam. Informaticae 73(1-2): 119-125 (2006) - Juha Honkala:
On the Problem Whether the Image of an N-Rational Series Equals. Fundam. Informaticae 73(1-2): 127-132 (2006) - Yu-Chen Hu:
Multiple Images Embedding Scheme Based on Moment Preserving Block Truncation Coding. Fundam. Informaticae 73(3): 373-387 (2006) - Oscar H. Ibarra, Sara Woodworth, Hsu-Chun Yen, Zhe Dang:
On the Computational Power of 1-Deterministic and Sequential P Systems. Fundam. Informaticae 73(1-2): 133-152 (2006) - Lucian Ilie, Cristian Popescu:
The Shortest Common Superstring Problem and Viral Genome Compression. Fundam. Informaticae 73(1-2): 153-164 (2006) - Lila Kari, Elena Losseva:
Block Substitutions and Their Properties. Fundam. Informaticae 73(1-2): 165-178 (2006) - Miika Langille, Ion Petre:
Simple Gene Assembly Is Deterministic. Fundam. Informaticae 73(1-2): 179-190 (2006) - Weiru Liu, Guilin Qi, David A. Bell:
Adaptive Merging of Prioritized Knowledge Bases. Fundam. Informaticae 73(3): 389-407 (2006) - Florin Manea, Victor Mitrana, Daniel-Claudian Voinescu:
Synchronized Shuffle on Backbones. Fundam. Informaticae 73(1-2): 191-202 (2006) - Solomon Marcus:
Mild Context-Sensitivity, After Twenty Years. Fundam. Informaticae 73(1-2): 203-204 (2006) - Alexandru Mateescu, Rudolf Freund:
Routes and Products of Monoids. Fundam. Informaticae 73(1-2): 205-211 (2006) - Simona Orzan, Jaco van de Pol:
Distribution of a Simple Shared Dataspace Architecture. Fundam. Informaticae 73(4): 535-559 (2006) - Gheorghe Paun, Radu A. Paun:
Membrane Computing and Economics: Numerical P Systems. Fundam. Informaticae 73(1-2): 213-227 (2006) - Azaria Paz:
A Property of Independency Relations Induced by Probabilistic Distributions with Binary Variables. Fundam. Informaticae 73(1-2): 229-236 (2006) - G. Michele Pinna:
Event Structures with Disabling/Enabling Relation and Event Automata. Fundam. Informaticae 73(3): 409-430 (2006) - Nicolae Santean, Sheng Yu:
Nondeterministic Bimachines and Rational Relations with Finite Codomain. Fundam. Informaticae 73(1-2): 237-264 (2006)
skipping 7 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-11-26 06:16 CET 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