Остановите войну!
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 32 matches
- 2004
- Boris Alexeev:
Minimal DFA for testing divisibility. J. Comput. Syst. Sci. 69(2): 235-243 (2004) - Noga Alon, Asaf Shapira:
Testing subgraphs in directed graphs. J. Comput. Syst. Sci. 69(3): 354-382 (2004) - Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, Harald Räcke:
Optimal oblivious routing in polynomial time. J. Comput. Syst. Sci. 69(3): 383-394 (2004) - Eric Bach, Susan N. Coppersmith, Marcel Paz Goldschen, Robert Joynt, John Watrous:
One-dimensional quantum walks with absorbing boundaries. J. Comput. Syst. Sci. 69(4): 562-592 (2004) - Reuven Bar-Yehuda, Zehavit Kehat:
Approximating the dense set-cover problem. J. Comput. Syst. Sci. 69(4): 547-561 (2004) - Howard Barnum, Michael E. Saks:
A lower bound on the quantum query complexity of read-once functions. J. Comput. Syst. Sci. 69(2): 244-258 (2004) - René Beier, Berthold Vöcking:
Random knapsack in expected polynomial time. J. Comput. Syst. Sci. 69(3): 306-329 (2004) - John Case, Sanjay Jain, Frank Stephan, Rolf Wiehagen:
Robust learning--rich and poor. J. Comput. Syst. Sci. 69(2): 123-165 (2004) - Deepak Chawla, Lin Li, Stephen Scott:
On approximating weighted sums with exponentially many terms. J. Comput. Syst. Sci. 69(2): 196-234 (2004) - Ning Chen, Xiaotie Deng, Xiaoming Sun:
On complexity of single-minded auction. J. Comput. Syst. Sci. 69(4): 675-687 (2004) - Anne Condon:
Guest editor's foreword. J. Comput. Syst. Sci. 69(1): 1-2 (2004) - Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack:
On relations between counting communication complexity classes. J. Comput. Syst. Sci. 69(2): 259-280 (2004) - Erik D. Demaine, Mohammad Taghi Hajiaghayi, Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos:
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors. J. Comput. Syst. Sci. 69(2): 166-195 (2004) - Jittat Fakcharoenphol, Satish Rao, Kunal Talwar:
A tight bound on approximating arbitrary metrics by tree metrics. J. Comput. Syst. Sci. 69(3): 485-497 (2004) - Uriel Feige, Daniele Micciancio:
The inapproximability of lattice and coding problems with preprocessing. J. Comput. Syst. Sci. 69(1): 45-67 (2004) - Frederic Green:
The correlation between parity and quadratic polynomials mod 3. J. Comput. Syst. Sci. 69(1): 28-44 (2004) - Leonid Gurvits:
Classical complexity and quantum entanglement. J. Comput. Syst. Sci. 69(3): 448-484 (2004) - Dan Gusfield, Jens Stoye:
Linear time algorithms for finding and representing all the tandem repeats in a string. J. Comput. Syst. Sci. 69(4): 525-546 (2004) - John M. Hitchcock, Jack H. Lutz, Elvira Mayordomo:
Scaled dimension and nonuniform complexity. J. Comput. Syst. Sci. 69(2): 97-122 (2004) - He Huang, Jinde Cao, Yuzhong Qu:
Global robust stability of delayed neural networks with a class of general activation functions. J. Comput. Syst. Sci. 69(4): 688-700 (2004) - T. S. Jayram, Subhash Khot, Ravi Kumar, Yuval Rabani:
Cell-probe lower bounds for the partial match problem. J. Comput. Syst. Sci. 69(3): 435-447 (2004) - Iordanis Kerenidis, Ronald de Wolf:
Exponential lower bound for 2-query locally decodable codes via a quantum argument. J. Comput. Syst. Sci. 69(3): 395-420 (2004) - Sanjeev Khanna, Aravind Srinivasan:
Special issue: 35th Annual ACM Symposium on Theory of Computing. J. Comput. Syst. Sci. 69(3): 305- (2004) - Andrew Lomonosov, Meera Sitharam, Kihong Park:
Network QoS games: stability vs optimality tradeoff. J. Comput. Syst. Sci. 69(2): 281-302 (2004) - Wolfgang Maass, Henry Markram:
On the computational power of circuits of spiking neurons. J. Comput. Syst. Sci. 69(4): 593-616 (2004) - Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio:
Learning functions of k relevant variables. J. Comput. Syst. Sci. 69(3): 421-434 (2004) - Ryan O'Donnell:
Hardness amplification within NP. J. Comput. Syst. Sci. 69(1): 68-94 (2004) - Mitsunori Ogihara, Till Tantau:
On the reducibility of sets inside NP to sets with low information content. J. Comput. Syst. Sci. 69(4): 499-524 (2004) - Alexander A. Razborov:
Resolution lower bounds for perfect matching principles. J. Comput. Syst. Sci. 69(1): 3-27 (2004) - Stefan Szeider:
Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable. J. Comput. Syst. Sci. 69(4): 656-674 (2004)
skipping 2 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-31 07:27 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