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 16 matches
- 2003
- Sharon Flynn, Ted Hurley, Mícheál Mac an Airchinnigh, Niall Madden, Michael McGettrick, Michel P. Schellekens, Anthony Karel Seda:
Second Irish Conference on the Mathematical Foundations of Computer Science and Information Technology, MFCSIT 2002, Galway, Ireland, July 18-19, 2002. Electronic Notes in Theoretical Computer Science 74, Elsevier 2003 [contents] - 2002
- Andrew Butterfield, Jim Woodcock:
Semantic domains for Handel-C. MFCSIT 2002: 1-20 - Nils Anders Danielsson, Michael B. Smyth:
Matroids from modules. MFCSIT 2002: 21-38 - Lluís Miquel Garcia-Raffi, Salvador Romaguera, Enrique Alfonso Sánchez-Pérez:
The supremum asymmetric norm on sequence algebras: a general framework to measure complexity distances. MFCSIT 2002: 39-50 - Roland Heinze:
Topological investigations of the operators of the well-founded, and alternating fixed-point semantics of normal logic programs. MFCSIT 2002: 51-68 - Ted Hurley:
Preface. MFCSIT 2002: 224-225 - C. M. W. Little:
Parametrized quotation and self-reference. MFCSIT 2002: 69-88 - David J. C. MacKay, Christopher P. Hesketh:
Performance of low density parity check codes as a function of actual and assumed noise levels. MFCSIT 2002: 89-96 - David J. C. MacKay, Michael S. Postol:
Weaknesses of Margulis and Ramanujan-Margulis low-density parity-check cCodes. MFCSIT 2002: 97-104 - Colm Ó'Dúnlaing:
Inorder traversal of splay trees. MFCSIT 2002: 134-157 - Maria O'Keeffe, Salvador Romaguera, Michel P. Schellekens:
Norm-weightable Riesz spaces and the dual complexity space. MFCSIT 2002: 105-121 - Maria O'Keeffe, Michel P. Schellekens:
Average merge time: an intuitive interpretation. MFCSIT 2002: 122-133 - Salvador Romaguera, Enrique Alfonso Sánchez-Pérez, Óscar Valero:
The complexity space of a valued linearly ordered set. MFCSIT 2002: 158-171 - Michael B. Smyth:
The constructive maximal point space. MFCSIT 2002: 172-188 - Mark Sofroniou, Giulia Spaletta:
On the construction of a new generalization of Runge-Kutta methods. MFCSIT 2002: 189-206 - Rueiher Tsaur, Michael B. Smyth:
Fixed points in digital topology (via Helly posets). MFCSIT 2002: 207-223
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-08 00: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