Остановите войну!
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 45 matches
- 1996
- Oswin Aichholzer, Franz Aurenhammer:
Straight Skeletons for General Polygonal Figures in the Plane. COCOON 1996: 117-126 - Tatsuya Akutsu, Feng Bao:
Approximating Minimum Keys and Optimal Substructure Screens. COCOON 1996: 290-299 - Eric Allender:
A Note on Uniform Circuit Lower Bounds for the Counting Hierarchy (Extended Abstract). COCOON 1996: 127-135 - Matthew Andrews, Michel X. Goemans, Lisa Zhang:
Improved Bounds for On-line Load Balancing. COCOON 1996: 1-10 - Vikraman Arvind:
A Note on the Self-Witnessing Property of Computational Problems. COCOON 1996: 241-249 - Giuseppe Di Battista, Roberto Tamassia, Luca Vismara:
Output-Sensitive Reporting of Disjoint Paths (Extended Abstract). COCOON 1996: 81-91 - Jay Belanger, Jie Wang:
Reductions and Convergence Rates of Average Time. COCOON 1996: 300-309 - Hans L. Bodlaender, Babette de Fluiter:
Reduction Algorithms for Constructing Solutions in Graphs with Small Treewidth. COCOON 1996: 199-208 - Gruia Calinescu, Cristina G. Fernandes:
Finding Large Planar Subgraphs and Large Subgraphs of a Given Genus. COCOON 1996: 152-161 - Zhixiang Chen, Carlos Cunha, Steven Homer:
Finding a Hidden Code by Asking Questions. COCOON 1996: 50-55 - Seonghun Cho, Sartaj Sahni:
Weight Biased Leftist Trees and Modified Skip Lists. COCOON 1996: 361-370 - Andrea E. F. Clementi, Luca Trevisan:
Improved Non-approximability Results for Vertex Cover with Density Constraints. COCOON 1996: 333-342 - H. K. Dai, Kevin E. Flannery:
Improved Length Lower Bounds for Reflecting Sequences. COCOON 1996: 56-67 - Carlos Domingo:
Exact Learning of Subclasses of CDNF Formulas with Membership Queries. COCOON 1996: 179-188 - Michelangelo Grigni, Vincent Mirelli, Christos H. Papadimitriou:
On the Difficulty of Designing Good Classifiers. COCOON 1996: 273-279 - Vince Grolmusz:
Harmonic Analysis, Real Approximation, and the Communication Complexity of Boolean Functions (Preliminary Version). COCOON 1996: 142-151 - Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe:
The Join Can Lower Complexity. COCOON 1996: 260-267 - Thomas Hofmeister:
A Note on the Simulation of Exponential Threshold Weights. COCOON 1996: 136-141 - Tsan-sheng Hsu, Ming-Yang Kao:
Optimal Bi-Level Augmentation for Selectivity Enhancing Graph Connectivity with Applications. COCOON 1996: 169-178 - Tsan-sheng Hsu, Kuo-Hui Tsai, Da-Wei Wang, D. T. Lee:
Steiner Problems on Directed Acyclic Graphs. COCOON 1996: 21-30 - Oscar H. Ibarra, Pedro C. Diniz, Martin C. Rinard:
On the Complexity of Commutativity Analysis. COCOON 1996: 323-332 - Hiroshi Imai, Satoru Iwata, Kyoko Sekine, Kensyu Yoshida:
Combinatorial and Geometric Approaches to Counting Problems on Linear Matroids, Graphic Arrangements, and Partial Orders. COCOON 1996: 68-80 - Efstratios Karaivazoglou, Paul G. Spirakis, Vasilis Triantafilou:
Wormhole Versus Deflection Routing: A Case Study on the Mesh. COCOON 1996: 31-40 - Juha Kärkkäinen, Esko Ukkonen:
Sparse Suffix Trees. COCOON 1996: 219-230 - Dimitris J. Kavvadias, Martha Sideri:
The Inverse Satisfiability Problem. COCOON 1996: 250-259 - Ravi Kumar, Alexander Russell, Ravi Sundaram:
Approximating Latin Square Extensions. COCOON 1996: 280-289 - Kwok-Yan Lam, San Ling, Lucas Chi Kwong Hui:
Efficient Generation of Elliptic Curve Cryptosystems. COCOON 1996: 411-416 - Hoong Chuin Lau:
Probabilistic Analysis of Local Search and NP-Completeness Result for Constraint Satisfaction (Extended Abstract). COCOON 1996: 371-380 - Hanno Lefmann, Pavel Pudlák, Petr Savický:
On Sparse Parity Chack Matrices (Extended Abstract). COCOON 1996: 41-49 - Ming Li, John Tromp, Louxin Zhang:
Some Notes on the Nearest Neighbour Interchange Distance. COCOON 1996: 343-351
skipping 15 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-02 01:56 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