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 25 matches
- 2005
- Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances A. Rosamond, Ulrike Stege:
A refined search tree technique for Dominating Set on planar graphs. J. Comput. Syst. Sci. 71(4): 385-405 (2005) - Amos Beimel, Yuval Ishai, Eyal Kushilevitz:
General constructions for information-theoretic private information retrieval. J. Comput. Syst. Sci. 71(2): 213-247 (2005) - Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao:
Tight approximability results for test set problems in bioinformatics. J. Comput. Syst. Sci. 71(2): 145-162 (2005) - Nader H. Bshouty, Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio:
Learning DNF from random walks. J. Comput. Syst. Sci. 71(3): 250-265 (2005) - John Case, Sanjay Jain, Franco Montagna, Giulia Simi, Andrea Sorbi:
On learning to coordinate: random bits help, insightful normal forms, and competency isomorphisms. J. Comput. Syst. Sci. 71(3): 308-332 (2005) - Moses Charikar, Venkatesan Guruswami, Anthony Wirth:
Clustering with qualitative information. J. Comput. Syst. Sci. 71(3): 360-383 (2005) - Devdatt P. Dubhashi, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan, Aravind Srinivasan:
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons. J. Comput. Syst. Sci. 71(4): 467-479 (2005) - Sally A. Goldman:
Special Issue: Learning Theory 2003. J. Comput. Syst. Sci. 71(3): 249 (2005) - Jonathan Goldstine, Hing Leung, Detlef Wotschke:
Measuring nondeterminism in pushdown automata. J. Comput. Syst. Sci. 71(4): 440-466 (2005) - Roberta Gori, Giorgio Levi:
On the verification of finite failure. J. Comput. Syst. Sci. 71(4): 535-575 (2005) - Gregory Z. Gutin, Ton Kloks, Chuan-Min Lee, Anders Yeo:
Kernels in planar digraphs. J. Comput. Syst. Sci. 71(2): 174-184 (2005) - Matthias Hein, Olivier Bousquet, Bernhard Schölkopf:
Maximal margin classification for metric spaces. J. Comput. Syst. Sci. 71(3): 333-359 (2005) - Juha Honkala:
An n2-bound for the ultimate equivalence problem of certain D0L systems over an n-letter alphabet. J. Comput. Syst. Sci. 71(4): 506-519 (2005) - Tetz C. Huang:
A self-stabilizing algorithm for the shortest path problem assuming read/write atomicity. J. Comput. Syst. Sci. 71(1): 70-85 (2005) - Adam Tauman Kalai, Rocco A. Servedio:
Boosting in the presence of noise. J. Comput. Syst. Sci. 71(3): 266-290 (2005) - Adam Tauman Kalai, Santosh S. Vempala:
Efficient algorithms for online decision problems. J. Comput. Syst. Sci. 71(3): 291-307 (2005) - Mehmet Hakan Karaata:
An optimal self-stabilizing strarvation-free alternator. J. Comput. Syst. Sci. 71(4): 480-494 (2005) - Eike Kiltz, Hans Ulrich Simon:
Threshold circuit lower bounds on cryptographic functions. J. Comput. Syst. Sci. 71(2): 185-212 (2005) - Manuel Koch, Luigi V. Mancini, Francesco Parisi-Presicce:
Graph-based specification of access control policies. J. Comput. Syst. Sci. 71(1): 1-33 (2005) - Stavros G. Kolliopoulos, Neal E. Young:
Approximation algorithms for covering/packing integer programs. J. Comput. Syst. Sci. 71(4): 495-505 (2005) - Ruggero Lanotte, Andrea Maggiolo-Schettini:
Monotonic hybrid systems. J. Comput. Syst. Sci. 71(1): 34-69 (2005) - John H. Reif:
Efficient parallel factorization and solution of structured and unstructured linear systems. J. Comput. Syst. Sci. 71(1): 86-143 (2005) - Narayan Vikas:
A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results. J. Comput. Syst. Sci. 71(4): 406-439 (2005) - Philipp Woelfel:
Bounds on the OBDD-size of integer multiplication via universal hashing. J. Comput. Syst. Sci. 71(4): 520-534 (2005) - Baowen Xu, Yuming Zhou, Hongmin Lu:
An improved accuracy measure for rough sets. J. Comput. Syst. Sci. 71(2): 163-173 (2005)
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-22 18:44 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