Остановите войну!
for scientists:
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 35 matches
- 2006
- Keith Briggs:
Implementing exact real arithmetic in python, C++ and C. Theor. Comput. Sci. 351(1): 74-81 (2006) - Hervé Brönnimann, Guillaume Melquiond, Sylvain Pion:
The design of the Boost interval arithmetic library. Theor. Comput. Sci. 351(1): 111-118 (2006) - David Bryant, Jens Lagergren:
Compatibility of unrooted phylogenetic trees is FPT. Theor. Comput. Sci. 351(3): 296-302 (2006) - Jonathan F. Buss, Tarique Islam:
Simplifying the weft hierarchy. Theor. Comput. Sci. 351(3): 303-313 (2006) - Yijia Chen, Jörg Flum:
On miniaturized problems in parameterized complexity theory. Theor. Comput. Sci. 351(3): 314-336 (2006) - Alberto Ciaffaglione, Pietro Di Gianantonio:
A certified, corecursive implementation of exact real numbers. Theor. Comput. Sci. 351(1): 39-51 (2006) - Peter Damaschke:
Parameterized enumeration, transversals, and imperfect phylogeny reconstruction. Theor. Comput. Sci. 351(3): 337-350 (2006) - Marc Daumas, Nathalie Revol:
Preface. Theor. Comput. Sci. 351(1): 1 (2006) - Nicolas Delanoue, Luc Jaulin, Bertrand Cottenceau:
Using interval arithmetic to prove that a set is path-connected. Theor. Comput. Sci. 351(1): 119-128 (2006) - Rod Downey, Michael A. Langston, Rolf Niedermeier:
Editorial. Theor. Comput. Sci. 351(3): 295 (2006) - Michael R. Fellows, Stefan Szeider, Graham Wrightson:
On finding short resolution refutations and small unsatisfiable subsets. Theor. Comput. Sci. 351(3): 351-359 (2006) - Hubert Garavel, Wendelin Serwe:
State space reduction for process algebra specifications. Theor. Comput. Sci. 351(2): 131-145 (2006) - Robert Haas, Michael Hoffmann:
Chordless paths through three vertices. Theor. Comput. Sci. 351(3): 360-371 (2006) - M. Hill, I. Robinson:
Quadrature using 64-bit IEEE arithmetic for integrands over [0, 1] with a singularity at 1. Theor. Comput. Sci. 351(1): 82-100 (2006) - Gillian Hill, Steven Vickers:
A language for configuring multi-level specifications. Theor. Comput. Sci. 351(2): 146-166 (2006) - Petr Hlinený, Detlef Seese:
Trees, grids, and MSO decidability: From graphs to matroids. Theor. Comput. Sci. 351(3): 372-393 (2006) - Joris van der Hoeven:
Computations with effective real numbers. Theor. Comput. Sci. 351(1): 52-60 (2006) - Jesse Hughes, Milad Niqui:
Admissible digit sets. Theor. Comput. Sci. 351(1): 61-73 (2006) - Abdessamad Imine, Michaël Rusinowitch, Gérald Oster, Pascal Molli:
Formal design and verification of operational transformation algorithms for copies convergence. Theor. Comput. Sci. 351(2): 167-183 (2006) - Alexander Knapp, Stephan Merz, Martin Wirsing, Júlia Zappe:
Specification and refinement of mobile systems in MTLA and mobile UML. Theor. Comput. Sci. 351(2): 184-202 (2006) - Peter Kornerup, Jean-Michel Muller:
Choosing starting values for certain Newton-Raphson iterations. Theor. Comput. Sci. 351(1): 101-110 (2006) - Juliana Küster Filipe:
Modelling concurrent interactions. Theor. Comput. Sci. 351(2): 203-220 (2006) - Savi Maharaj, Carron Shankland, Charles Rattray:
Preface. Theor. Comput. Sci. 351(2): 129-130 (2006) - Dániel Marx:
Parameterized graph separation problems. Theor. Comput. Sci. 351(3): 394-406 (2006) - Dániel Marx:
Parameterized coloring problems on chordal graphs. Theor. Comput. Sci. 351(3): 407-424 (2006) - Sun Meng, Luís Soares Barbosa:
Components as coalgebras: The refinement dimension. Theor. Comput. Sci. 351(2): 276-294 (2006) - Bernhard Möller, Georg Struth:
Algebras of modal operators and partial correctness. Theor. Comput. Sci. 351(2): 221-239 (2006) - Matthias Müller-Hannemann, Karsten Weihe:
Moving policies in cyclic assembly line scheduling. Theor. Comput. Sci. 351(3): 425-436 (2006) - Matthew W. Parker:
Three concepts of decidability for general subsets of uncountable spaces. Theor. Comput. Sci. 351(1): 2-13 (2006) - Elena Prieto-Rodriguez, Christian Sloper:
Looking at the stars. Theor. Comput. Sci. 351(3): 437-445 (2006)
skipping 5 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-05-14 11:09 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