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 19 matches
- 2003
- Tibor Ásványi:
User's Functions in Standard Prolog. SPLST 2003: 103-114 - András A. Benczúr, Antal Buza:
The Effect of Non-execution and Part Task Result Integration in Distributed Data-intensive Computing Systems. SPLST 2003: 2-13 - Marko Hassinen, Smile Markovski:
Secure SMS messaging using Quasigroup encryption and Java SMS API. SPLST 2003: 187- - Risto Honkanen:
Systolic Routing in Sparse Optical Torus. SPLST 2003: 14-20 - Zoltán Horváth, Tamás Kozsik, Máté Tejfel:
Proving Invariants of Functional Programs. SPLST 2003: 115-126 - Zoltán Horváth, Zoltán Varga, Viktória Zsók:
Clean-CORBA Interface for Parallel Functional Programming on Clusters. SPLST 2003: 127-136 - Antti-Juhani Kaijanaho:
On Typechecking B. SPLST 2003: 34-44 - Miklós Kálmán, Ferenc Havasi, Tibor Gyimóthy:
Compacting XML Documents. SPLST 2003: 137-151 - Raine Kauppinen, Juha Taina:
RITA Environment for Testing Framework-based Software Product Lines. SPLST 2003: 58-69 - Pekka Kilpeläinen, Rauno Tuhkanen:
Regular Expressions with Numerical Occurrence Indicators - preliminary results. SPLST 2003: 163-173 - Vahur Kotkas:
Synthesis of Distributed Programs. SPLST 2003: 21-33 - Merik Meriste, Tõnis Kelder, Jüri Helekivi, Leo Motus:
Domain-Specific Language Agents. SPLST 2003: 82-90 - Y. C. Nuckchady, Jyrki Nummenmaa:
An architecture for building collaborative tools in Java. SPLST 2003: 174-186 - Martti Penttonen:
How to Program a Parallel Computer? SPLST 2003: 1 - Timo Poranen, Erkki Mäkinen, Jyrki Nummenmaa:
How to Draw a Sequence Diagram. SPLST 2003: 91-102 - Petri Selonen:
Set Operations for the Unified Modeling Language. SPLST 2003: 70-81 - Risto Vaarandi:
A Clustering Algorithm for Logfile Data Sets. SPLST 2003: 152-162 - László Vidács, Árpád Beszédes:
Opening Up The C/C++ Preprocessor Black Box. SPLST 2003: 45-57 - Pekka Kilpeläinen, Niina Päivinen:
Proceedings of the Eighth Symposium on Programming Languages and Software Tools, SPLST'03, Kuopio, Finland, June 17-18, 2003. University of Kuopio, Department of Computer Science 2003, ISBN 951-781-265-5 [contents]
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-14 17:28 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