Остановите войну!
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
- Eric Allender, Klaus-Jörn Lange:
StUSPACE(log n) <= DSPACE(log²n / log log n). ISAAC 1996: 193-202 - Andris Ambainis:
The Complexity of Probabilistic versus Deterministic Finite Automata. ISAAC 1996: 233-238 - Mikhail J. Atallah, Danny Z. Chen:
Applications of a Numbering Scheme for Polygonal Obstacles in the Plane. ISAAC 1996: 1-24 - Mark de Berg, Olivier Devillers, Marc J. van Kreveld, Otfried Schwarzkopf, Monique Teillaud:
Computing the Maximum Overlap of Two Convex Polygons Under Translations. ISAAC 1996: 126-135 - Alvis Brazma, Esko Ukkonen, Jaak Vilo:
Discovering Unbounded Unions of Regular Pattern Languages from Positive Examples (Extended Abstract). ISAAC 1996: 95-104 - David Bremner:
Incremental Convex Hull Algorithms Are Not Output Sensitive. ISAAC 1996: 26-35 - Maw-Shang Chang:
Algorithms for Maximum Matching and Minimum Fill-in on Chordal Bipartite Graphs. ISAAC 1996: 146-155 - Siu-Wing Cheng, Naoki Katoh, Manabu Sugai:
A Study of the LMT-Skeleton. ISAAC 1996: 256-265 - Ying Choi, Tak Wah Lam:
Two-Dimensional Dynamic Dictionary Matching. ISAAC 1996: 85-94 - Ka Wong Chong, Tak Wah Lam:
Towards More Precise Parallel Biconnectivity Approximation. ISAAC 1996: 223-232 - Olivier Devillers, Matthew J. Katz:
Optimal Line Bipartitions of Point Sets. ISAAC 1996: 45-54 - Tamal K. Dey, János Pach:
Extremal Problems for Geometric Hypergraphs. ISAAC 1996: 105-114 - Alon Efrat, Matthew J. Katz:
Computing Fair and Bottleneck Matchings in Geormetric Graphs. ISAAC 1996: 115-125 - Alon Efrat, Otfried Schwarzkopf:
Separating and Shattering Long Line Segments. ISAAC 1996: 36-44 - Panagiota Fatourou, Paul G. Spirakis:
Scheduling Algorithms for Strict Multithreaded Computations. ISAAC 1996: 407-416 - David Fernández-Baca, Jens Lagergren:
On the Approximability of the Steiner Tree Problem in Phylogeny. ISAAC 1996: 65-74 - Esteban Feuerstein, Alejandro Strejilevich de Loma:
On Multi-threaded Paging. ISAAC 1996: 417-426 - Takeshi Fukuda, Yasuhiko Morimoto, Shinichi Morishita, Takeshi Tokuyama:
Interval Finding and Its Application to Data Mining. ISAAC 1996: 55-64 - Magnús M. Halldórsson, Keisuke Tanaka:
Approximation and Special Cases of Common Subtrees and Editing Distance. ISAAC 1996: 75-84 - Kazuyoshi Hayase, Hiroshi Imai:
OBDDs of a Monotone Function and of Its Prime Implicants. ISAAC 1996: 136-145 - Tatsuya Hayashi, Koji Nakano, Stephan Olariu:
Efficient List Ranking on the Reconfigurable Mesh, with Applications. ISAAC 1996: 326-335 - Michael E. Houle, Gavin Turner:
Dimension-Exchange Token Distribution on the Mesh and the Torus. ISAAC 1996: 285-294 - Tsan-sheng Hsu, Ming-Yang Kao:
Optimal Augmentation for Bipartite Componentwise Biconnectiviy in Linear Time (Extended Abstract). ISAAC 1996: 213-222 - Tsan-sheng Hsu, Dian Rae Lopez:
Bounds and Algorithms for a Practical Task Allocation Model (Extended Abstract). ISAAC 1996: 397-406 - Ton Kloks, Haiko Müller, C. K. Wong:
Vertex Ranking of Asteroidal Triple-Free Graphs. ISAAC 1996: 174-182 - Miroslaw Kutylowski, Krzysztof Lorys, Brigitte Oesterdiekhoff:
Periodic Merging Networks. ISAAC 1996: 336-345 - D. T. Lee, C. F. Shen:
The Steiner Minimal Tree Problem in the lambda-Geormetry Plane. ISAAC 1996: 247-255 - Jae-Ha Lee, Chan-Su Shin, Kyung-Yong Chwa:
Directed Hamiltonian Packing in d-Dimensional Meshes and Its Application (Extended Abstract). ISAAC 1996: 295-304 - Andrzej Lingas, Valeriu Soltan:
Minimum Convex Partition of a Polygon with Holes by Cuts in Given Directions. ISAAC 1996: 315-325 - Bruce E. Litow:
Bounded Length UCFG Equivalence. ISAAC 1996: 239-246
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-04-27 13:46 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