Остановите войну!
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 64 matches
- 2002
- Tatsuya Akutsu, Sascha Ott:
Inferring a Union of Halfspaces from Examples. COCOON 2002: 117-126 - Tom Altman, Yoshihide Igarashi, Kazuhiro Motegi:
Fast and Dependable Communication in Hyper-rings. COCOON 2002: 350-359 - Abdullah N. Arslan, Ömer Egecioglu:
Dictionary Look-Up within Small Edit Distance. COCOON 2002: 127-136 - Gill Barequet:
The On-Line Heilbronn's Triangle Problem in Three and Four Dimensions. COCOON 2002: 360-369 - Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen:
Extending the Accommodating Function. COCOON 2002: 87-96 - Ljiljana Brankovic, Jozef Sirán:
2-Compromise Usability in 1-Dimensional Statistical Databases. COCOON 2002: 448-455 - Jin-yi Cai, Denis Charles, Aduri Pavan, Samik Sengupta:
On Higher Arthur-Merlin Classes. COCOON 2002: 18-27 - Casey Carter, Nicholas Q. Tran:
Cluster: A Fast Tool to Identify Groups of Similar Programs. COCOON 2002: 191-199 - L. Sunil Chandran, L. Shankar Ram:
On the Number of Minimum Cuts in a Graph. COCOON 2002: 220-229 - Duhong Chen, Oliver Eulenstein, David Fernández-Baca, Michael J. Sanderson:
Supertrees by Flipping. COCOON 2002: 391-400 - Danny Z. Chen, Shuang Luan, Jinhui Xu:
An Experimental Study and Comparison of Topological Peeling and Topological Walk. COCOON 2002: 456-466 - Gek Ling Chia, C. S. Gan:
On Crossing Numbers of 5-Regular Graphs. COCOON 2002: 230-237 - Jurek Czyzowicz, Wojciech Fraczak, Andrzej Pelc:
Transducers with Set Output. COCOON 2002: 300-309 - Vilhelm Dahllöf, Peter Jonsson, Magnus Wahlström:
Counting Satisfying Assignments in 2-SAT and 3-SAT. COCOON 2002: 535-543 - Evgeny Dantsin, Alexander Wolpert:
Solving Constraint Satisfaction Problems with DNA Computing. COCOON 2002: 171-180 - Amitava Datta, Albert Y. Zomaya:
New Energy-Efficient Permutation Routing Protocol for Single-Hop Radio Networks. COCOON 2002: 249-258 - Xiaotie Deng, Chan H. Lee, Yunlei Zhao, Hong Zhu:
(2+ f(n))-SAT and Its Properties. COCOON 2002: 28-36 - Yvo Desmedt, Yongge Wang:
Maximum Flows and Critical Vertices in AND/OR Graphs. COCOON 2002: 238-248 - William Duckworth, Bernard Mans:
On the Connected Domination Number of Random Regular Graphs. COCOON 2002: 210-219 - Leah Epstein, Lene M. Favrholdt:
On-Line Maximizing the Number of Items Packed in Variable-Sized Bins. COCOON 2002: 467-475 - Henning Fernau:
On Parameterized Enumeration. COCOON 2002: 564-573 - Satoshi Fujita:
On-Line Grid-Packing with a Single Active Grid. COCOON 2002: 476-483 - Harold N. Gabow, San Skulrattanakulchai:
Coloring Algorithms on Subcubic Graphs. COCOON 2002: 67-76 - Marats Golovkins, Maksim Kravtsev:
Probabilistic Reversible Automata and Quantum Automata. COCOON 2002: 574-583 - Vince Grolmusz:
Co-orthogonal Codes. COCOON 2002: 144-152 - Thanh Minh Hoang, Thomas Thierauf:
On the Minimal Polynomial of a Matrix. COCOON 2002: 37-46 - Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko:
Efficient Algorithms for the Hamiltonian Problem on Distance-Hereditary Graphs. COCOON 2002: 77-86 - Lucian Ilie, Sheng Yu, Kaizhong Zhang:
Repetition Complexity of Words. COCOON 2002: 320-329 - Ivaylo Ilinkin, Ravi Janardan, Michiel H. M. Smid:
Terrain Polygon Decomposition, with Application to Layered Manufacturing. COCOON 2002: 381-390 - Takehiro Ito, Takao Nishizeki, Xiao Zhou:
Algorithms for the Multicolorings of Partial k-Trees. COCOON 2002: 430-439
skipping 34 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-28 00:54 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