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 24 matches
- 2015
- Evangelos Bampas, Nikos Leonardos, Euripides Markou, Aris Pagourtzis, Matoula Petrolia:
Improved periodic data retrieval in asynchronous rings with a faulty host. Theor. Comput. Sci. 608: 231-254 (2015) - Amir Bannoura, Christian Ortolf, Leonhard M. Reindl, Christian Schindelhauer:
The wake up dominating set problem. Theor. Comput. Sci. 608: 120-134 (2015) - Roberto Barbuti, Pasquale Bove, Paolo Milazzo, Giovanni Pardini:
Minimal probabilistic P systems for modelling ecological systems. Theor. Comput. Sci. 608: 36-56 (2015) - Robert Brijder:
Recombination faults in gene assembly in ciliates modeled using multimatroids. Theor. Comput. Sci. 608: 27-35 (2015) - Jurek Czyzowicz, Leszek Gasieniec, Konstantinos Georgiou, Evangelos Kranakis, Fraser MacQuarrie:
The Beachcombers' Problem: Walking and searching with mobile robots. Theor. Comput. Sci. 608: 201-218 (2015) - Alberto Dennunzio, Enrico Formenti, Luca Manzoni, Antonio E. Porreca:
Ancestors, descendants, and gardens of Eden in reaction systems. Theor. Comput. Sci. 608: 16-26 (2015) - Dariusz Dereniowski, Ralf Klasing, Adrian Kosowski, Lukasz Kuszner:
Rendezvous of heterogeneous mobile agents in edge-weighted networks. Theor. Comput. Sci. 608: 219-230 (2015) - Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Standard and ordered zoom structures. Theor. Comput. Sci. 608: 4-15 (2015) - Yuval Emek, Tobias Langner, David Stolz, Jara Uitto, Roger Wattenhofer:
How many ants does it take to find the food? Theor. Comput. Sci. 608: 255-267 (2015) - Paola Flocchini, Jie Gao:
Preface. Theor. Comput. Sci. 608: 119 (2015) - Maxime Folschette, Loïc Paulevé, Morgan Magnin, Olivier F. Roux:
Sufficient conditions for reachability in automata networks with priorities. Theor. Comput. Sci. 608: 66-83 (2015) - Magnús M. Halldórsson:
Guest editorial: Structural Information and Communication Complexity. Theor. Comput. Sci. 608: 199-200 (2015) - James W. Hegeman, Sriram V. Pemmaraju:
Lessons from the Congested Clique applied to MapReduce. Theor. Comput. Sci. 608: 268-281 (2015) - Olga Hrydziuszko, Joanna Balbus, Magdalena Zulpo, Artur Wrona, Krystian Kubica:
Mathematical analyses of two-compartment model of human cholesterol circulatory transport in application to high blood cholesterol prevention, diagnosis and treatment. Theor. Comput. Sci. 608: 98-107 (2015) - Lila Kari:
Editorial. Theor. Comput. Sci. 608: 1 (2015) - Luis F. Macías-Ramos, Mario J. Pérez-Jiménez, Agustin Riscos-Núñez, Luis Valencia-Cabrera:
Membrane fission versus cell division: When membrane proliferation is not enough. Theor. Comput. Sci. 608: 57-65 (2015) - Emanuela Merelli, Ion Petre:
From Computer Science to Biology and Back. Theor. Comput. Sci. 608: 2-3 (2015) - Avery Miller:
On the complexity of neighbourhood learning in radio networks. Theor. Comput. Sci. 608: 135-145 (2015) - Avery Miller, Andrzej Pelc:
Fast rendezvous with advice. Theor. Comput. Sci. 608: 190-198 (2015) - Christian Ortolf, Christian Schindelhauer:
Strategies for parallel unaware cleaners. Theor. Comput. Sci. 608: 178-189 (2015) - Mihaela Paun, Yang Li, Yuan Cheng, Iris Tusa, Andrei Paun:
Segmenting microarray images using a contour-based method. Theor. Comput. Sci. 608: 108-118 (2015) - Gokarna Sharma, Costas Busch:
Optimal nearest neighbor queries in sensor networks. Theor. Comput. Sci. 608: 146-165 (2015) - Tigran Tonoyan:
Conflict graphs and the SINR-capacity of the mean power scheme. Theor. Comput. Sci. 608: 166-177 (2015) - Rocco Zaccagnino, Rosalba Zizza, Carlo Zottoli:
Testing DNA code words properties of regular languages. Theor. Comput. Sci. 608: 84-97 (2015)
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-09-19 03:55 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