Остановите войну!
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 63 matches
- 1995
- Amos Beimel, Anna Gál, Mike Paterson:
Lower Bounds for Monotone Span Programs. Electron. Colloquium Comput. Complex. TR95 (1995) - Detlef Sieling:
New Lower Bounds and Hierarchy Results for Restricted Branching Programs. Electron. Colloquium Comput. Complex. TR95 (1995) - Marek Karpinski, Alexander Zelikovsky:
1.757 and 1.267 - Approximation Algorithms for the Network and Rectilinear Steiner Tree Problems. Electron. Colloquium Comput. Complex. TR95 (1995) - Martin Dietzfelbinger, Miroslaw Kutylowski, Rüdiger Reischuk:
Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write PRAMs. Electron. Colloquium Comput. Complex. TR95 (1995) - Maciej Liskiewicz, Rüdiger Reischuk:
The Sublogarithmic Alternating Space World. Electron. Colloquium Comput. Complex. TR95 (1995) - Kenneth W. Regan, D. Sivakumar, Jin-yi Cai:
Pseudorandom Generators, Measure Theory, and Natural Proofs. Electron. Colloquium Comput. Complex. TR95 (1995) - Ulrich Faigle, Sándor P. Fekete, Winfried Hochstättler, Walter Kern:
The Nucleon of Cooperative Games and an Algorithm for Matching Games. Electron. Colloquium Comput. Complex. TR95 (1995) - Nader H. Bshouty:
Exact Learning Boolean Functions via the Monotone Theory. Electron. Colloquium Comput. Complex. TR95 (1995) - Matthias Krause:
A Note on Realizing Iterated Multiplication by Small Depth Threshold Circuits. Electron. Colloquium Comput. Complex. TR95 (1995) - Pavel Pudlák, Jirí Sgall:
An Upper Bound for a Communication Game Related to Time-Space Tradeoffs. Electron. Colloquium Comput. Complex. TR95 (1995) - Roman Bacik, Sanjeev Mahajan:
Semidefinite Programming and its Applications to NP Problems. Electron. Colloquium Comput. Complex. TR95 (1995) - Ulrich Faigle, Sándor P. Fekete, Winfried Hochstättler, Walter Kern:
On the Complexity of Testing Membership in the Core of min-Cost Spanning Tree Games. Electron. Colloquium Comput. Complex. TR95 (1995) - Oleg Verbitsky:
The Parallel Repetition Conjecture for Trees is True. Electron. Colloquium Comput. Complex. TR95 (1995) - Ulrich Faigle, Walter Kern, Martin Streng:
Note On the Computational Complexity of j-Radii of Polytopes in Rn. Electron. Colloquium Comput. Complex. TR95 (1995) - Nader H. Bshouty, Richard Cleve, Ricard Gavaldà, Sampath Kannan, Christino Tamon:
Oracles and Queries That Are Sufficient for Exact Learning. Electron. Colloquium Comput. Complex. TR95 (1995) - Ulrich Faigle, Sándor P. Fekete, Winfried Hochstättler, Walter Kern:
On Approximately Fair Cost Allocation in Euclidean TSP Games. Electron. Colloquium Comput. Complex. TR95 (1995) - Claudia Bertram-Kretzberg, Thomas Hofmeister:
Multiple Product Modulo Arbitrary Numbers. Electron. Colloquium Comput. Complex. TR95 (1995) - Jay Belanger, Jie Wang:
Rankable Distributions Do Not Provide Harder Instances Than Uniform Distributions. Electron. Colloquium Comput. Complex. TR95 (1995) - Jin-yi Cai, Alan L. Selman:
Average Time Complexity Classes. Electron. Colloquium Comput. Complex. TR95 (1995) - William Hurwood:
Dynamic Fault Diagnosis. Electron. Colloquium Comput. Complex. TR95 (1995) - Marek Karpinski, Rutger Verbeek:
On Randomized Versus Deterministic Computation. Electron. Colloquium Comput. Complex. TR95 (1995) - Marek Karpinski, Wojciech Rytter, Ayumi Shinohara:
Pattern-Matching for Strings with Short Descriptions. Electron. Colloquium Comput. Complex. TR95 (1995) - Sanjeev Khanna, Rajeev Motwani, Madhu Sudan, Umesh V. Vazirani:
On Syntactic versus Computational Views of Approximability. Electron. Colloquium Comput. Complex. TR95 (1995) - Mihir Bellare, Oded Goldreich, Madhu Sudan:
Free Bits, PCP and Non-Approximability - Towards Tight Results. Electron. Colloquium Comput. Complex. TR95 (1995) - Günter Hotz, Gero Vierke, Björn Schieffer:
Analytic Machines. Electron. Colloquium Comput. Complex. TR95 (1995) - Claus-Peter Schnorr, Horst Helmut Hörner:
Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction. Electron. Colloquium Comput. Complex. TR95 (1995) - Frederic Green:
Lower Bounds for Circuits with Mod Gates and One Exact Threshold Gate. Electron. Colloquium Comput. Complex. TR95 (1995) - Eric Allender, Martin Strauss:
Measure on P: Robustness of the Notion. Electron. Colloquium Comput. Complex. TR95 (1995) - Oded Goldreich, Leonid A. Levin, Noam Nisan:
On Constructing 1-1 One-Way Functions. Electron. Colloquium Comput. Complex. TR95 (1995) - Marek Karpinski, Alexander Zelikovsky:
New Approximation Algorithms for the Steiner Tree Problems. Electron. Colloquium Comput. Complex. TR95 (1995)
skipping 33 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-06-07 21:17 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