![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
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 48 matches
- 2008
- József Balogh, Sergei L. Bezrukov, L. H. Harper, Ákos Seress:
On the bandwidth of 3-dimensional Hamming graphs. Theor. Comput. Sci. 407(1-3): 488-495 (2008) - Katherine P. Benedetto, Nicholas A. Loehr:
Tiling problems, automata, and tiling graphs. Theor. Comput. Sci. 407(1-3): 400-411 (2008) - Andrew Beveridge, Tom Bohman
, Alan M. Frieze
, Oleg Pikhurko:
Game chromatic index of graphs with given restrictions on degrees. Theor. Comput. Sci. 407(1-3): 242-249 (2008) - Mieczyslaw Borowiecki, Katarzyna Jesse-Józefczyk:
Matching cutsets in graphs of diameter 2. Theor. Comput. Sci. 407(1-3): 574-582 (2008) - Alin Bostan, Claude-Pierre Jeannerod, Éric Schost:
Solving structured linear systems with large displacement rank. Theor. Comput. Sci. 407(1-3): 155-181 (2008) - Tian-Ming Bu, Xiaotie Deng
, Qi Qi
:
Arbitrage opportunities across sponsored search markets. Theor. Comput. Sci. 407(1-3): 182-191 (2008) - Adam L. Buchsbaum, Raffaele Giancarlo, Balázs Rácz:
New results for finding common neighborhoods in massive graphs in the data stream model. Theor. Comput. Sci. 407(1-3): 302-309 (2008) - Hans Kleine Büning, Xishun Zhao:
Computational complexity of quantified Boolean formulas with fixed maximal deficiency. Theor. Comput. Sci. 407(1-3): 448-457 (2008) - Frédéric Cazals
, Chinmay Karande:
A note on the problem of reporting maximal cliques. Theor. Comput. Sci. 407(1-3): 564-568 (2008) - Rongjun Chen, Wanzhen Huang, Guochun Tang:
Dense open-shop schedules with release times. Theor. Comput. Sci. 407(1-3): 389-399 (2008) - Jiang Chen, Ke Yi:
A dynamic data structure for top-k queries on uncertain data. Theor. Comput. Sci. 407(1-3): 310-317 (2008) - Marco Chiarandini
, Ilias S. Kotsireas, Christos Koukouvinos, Luís Paquete
:
Heuristic algorithms for Hadamard matrices with two circulant cores. Theor. Comput. Sci. 407(1-3): 274-277 (2008) - Ye Du:
On the complexity of deciding bimatrix games similarity. Theor. Comput. Sci. 407(1-3): 583-586 (2008) - Stefan Eckhardt, Sven Kosub
, Moritz G. Maaß, Hanjo Täubig, Sebastian Wernicke:
Combinatorial network abstraction by trees and distances. Theor. Comput. Sci. 407(1-3): 1-20 (2008) - Charilaos Efthymiou, Paul G. Spirakis:
Random sampling of colourings of sparse random graphs with a constant number of colours. Theor. Comput. Sci. 407(1-3): 134-154 (2008) - Leah Epstein, Meital Levy:
Online interval coloring with packing constraints. Theor. Comput. Sci. 407(1-3): 203-212 (2008) - Leah Epstein, Asaf Levin
, Rob van Stee:
Online unit clustering: Variations on a theme. Theor. Comput. Sci. 407(1-3): 85-96 (2008) - Paola Flocchini, Giuseppe Prencipe
, Nicola Santoro
, Peter Widmayer:
Arbitrary pattern formation by asynchronous, anonymous, oblivious robots. Theor. Comput. Sci. 407(1-3): 412-447 (2008) - Hervé Fournier, Guillaume Malod:
Universal relations and #P-completeness. Theor. Comput. Sci. 407(1-3): 97-109 (2008) - Jung-Sheng Fu:
Fault-free Hamiltonian cycles in twisted cubes with conditional link faults. Theor. Comput. Sci. 407(1-3): 318-329 (2008) - Pedro García, Manuel Vazquez de Parga, Gloria Inés Alvarez, José Ruiz:
Universal automata and NFA learning. Theor. Comput. Sci. 407(1-3): 192-202 (2008) - Marion Le Gonidec:
On complexity functions of infinite words associated with generalized Dyck languages. Theor. Comput. Sci. 407(1-3): 117-133 (2008) - Jin-Ju Hong, Gen-Huey Chen:
Efficient on-line repetition detection. Theor. Comput. Sci. 407(1-3): 554-563 (2008) - Gábor Horváth, Chrystopher L. Nehaniv
, Csaba A. Szabó:
An assertion concerning functionally complete algebras and NP-completeness. Theor. Comput. Sci. 407(1-3): 591-595 (2008) - Scott C.-H. Huang, F. Frances Yao, Minming Li
, Weili Wu:
Lower bounds and new constructions on secure group communication schemes. Theor. Comput. Sci. 407(1-3): 511-523 (2008) - Ondrej Klíma, Libor Polák:
On varieties of meet automata. Theor. Comput. Sci. 407(1-3): 278-289 (2008) - Marcin Kozik:
A finite set of functions with an EXPTIME-complete composition problem. Theor. Comput. Sci. 407(1-3): 330-341 (2008) - Sven Oliver Krumke, Willem de Paepe, Jörg Rambau, Leen Stougie:
Bincoloring. Theor. Comput. Sci. 407(1-3): 231-241 (2008) - Matthieu Latapy:
Main-memory triangle computations for very large (sparse (power-law)) graphs. Theor. Comput. Sci. 407(1-3): 458-473 (2008) - Jonathan K. Lee, Jens Palsberg, Fernando Magno Quintão Pereira:
Aliased register allocation for straight-line programs is NP-complete. Theor. Comput. Sci. 407(1-3): 258-273 (2008)
skipping 18 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-08-28 20:21 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