![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/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 23 matches
- 2008
- Eitan Bachmat
, Tao-Kai Lam, Avner Magen:
Analysis of set-up time models: A metric perspective. Theor. Comput. Sci. 401(1-3): 172-180 (2008) - Vincenzo Bonifaci
, Ugo Di Iorio, Luigi Laura
:
The complexity of uniform Nash equilibria and related regular subgraph problems. Theor. Comput. Sci. 401(1-3): 144-152 (2008) - Janina A. Brenner, Guido Schäfer:
Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems. Theor. Comput. Sci. 401(1-3): 96-106 (2008) - Ching-Lueh Chang, Yuh-Dauh Lyuu
, Yen-Wu Ti:
The complexity of Tarski's fixed point theorem. Theor. Comput. Sci. 401(1-3): 228-235 (2008) - Zhi-Zhong Chen, Ze Feng, Minming Li
, F. Frances Yao:
Optimizing deletion cost for secure multicast key management. Theor. Comput. Sci. 401(1-3): 52-61 (2008) - Victor Chepoi, Bertrand Estellon, Yann Vaxès:
Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length. Theor. Comput. Sci. 401(1-3): 131-143 (2008) - David A. Cohen, Martin C. Cooper
, Peter Jeavons:
Generalising submodularity and horn clauses: Tractable optimization problems defined by tournament pair multimorphisms. Theor. Comput. Sci. 401(1-3): 36-51 (2008) - José Carlos Costa
, Conceição Nogueira
:
On bases of identities for the omega-variety generated by locally testable semigroups. Theor. Comput. Sci. 401(1-3): 206-216 (2008) - Rodolphe Giroudeau, Jean-Claude König, Farida Kamila Moulai, Jérôme Palaysi:
Complexity and approximation for precedence constrained scheduling problems with large communication delays. Theor. Comput. Sci. 401(1-3): 107-119 (2008) - Lane A. Hemaspaandra
, Jörg Rothe, Amitabh Saxena:
Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for worst-case one-way functions. Theor. Comput. Sci. 401(1-3): 27-35 (2008) - André Hernich, Nicole Schweikardt:
Reversal complexity revisited. Theor. Comput. Sci. 401(1-3): 191-205 (2008) - Yumei Huo, Joseph Y.-T. Leung, Xin Wang:
Online scheduling of equal-processing-time task systems. Theor. Comput. Sci. 401(1-3): 85-95 (2008) - David Ilcinkas:
Setting port numbers for fast graph exploration. Theor. Comput. Sci. 401(1-3): 236-242 (2008) - Iyad A. Kanj, Luay Nakhleh, Cuong Than, Ge Xia:
Seeing the trees and their branches in the network is hard. Theor. Comput. Sci. 401(1-3): 153-164 (2008) - Gregory Karagiorgos, Nikolaos M. Missirlis:
Convergence of the diffusion method for weighted torus graphs using Fourier analysis. Theor. Comput. Sci. 401(1-3): 1-16 (2008) - Manuel Kauers:
Solving difference equations whose coefficients are not transcendental. Theor. Comput. Sci. 401(1-3): 217-227 (2008) - Dietrich Kuske:
Schützenberger's theorem on formal power series follows from Kleene's theorem. Theor. Comput. Sci. 401(1-3): 243-248 (2008) - Eduardo Sany Laber:
A randomized competitive algorithm for evaluating priced AND/OR trees. Theor. Comput. Sci. 401(1-3): 120-130 (2008) - Dániel Marx:
Complexity of unique list colorability. Theor. Comput. Sci. 401(1-3): 62-76 (2008) - Christian J. Michel, Giuseppe Pirillo, Mario A. Pirillo:
A relation between trinucleotide comma-free codes and trinucleotide circular codes. Theor. Comput. Sci. 401(1-3): 17-26 (2008) - Simon J. Puglisi, Jamie Simpson, William F. Smyth:
How many runs can a string contain? Theor. Comput. Sci. 401(1-3): 165-171 (2008) - Hing-Fung Ting:
A near optimal scheduler for on-demand data broadcasts. Theor. Comput. Sci. 401(1-3): 77-84 (2008) - Chang-Hsiung Tsai:
Embedding of meshes in Möbius cubes. Theor. Comput. Sci. 401(1-3): 181-190 (2008)
loading more results
failed to load more results, please try again later
![](https://dblp.org/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-06-17 19:02 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