Остановите войну!
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 39 matches
- 1996
- Noga Alon:
Derandomization Via Small Sample Spaces (Abstract). SWAT 1996: 1-3 - Stephen Alstrup, Mikkel Thorup:
Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees. SWAT 1996: 212-222 - Arne Andersson:
Sorting and Searching Revisted. SWAT 1996: 185-197 - Boris Aronov, Alan R. Davis, Tamal K. Dey, Sudebkumar Prasant Pal, D. Chithra Prasad:
Visibility with Multiple Reflections. SWAT 1996: 284-295 - Yuichi Asahiro, Kazuo Iwama, Hisao Tamaki, Takeshi Tokuyama:
Greedily Finding a Dense Subgraph. SWAT 1996: 136-148 - Takao Asano, Takao Ono, Tomio Hirata:
Approximation Algorithms for the Maximum Satisfiability Problem. SWAT 1996: 100-111 - Vincenzo Auletta, Angelo Monti, Domenico Parente, Giuseppe Persiano:
A Linear Time Algorithm for the Feasibility of Pebble Motion on Trees. SWAT 1996: 259-270 - Yossi Azar, Leah Epstein:
On Two Dimensional Packing. SWAT 1996: 321-332 - Armin Bäumker, Wolfgang Dittrich, Andrea Pietracaprina:
The Deterministic Complexity of Parallel Multisearch (Extended Abstract). SWAT 1996: 404-415 - Therese C. Biedl:
Optimal Orthogonal Drawings of Triconnected Plane Graphs. SWAT 1996: 333-344 - Jean R. S. Blair, Pinar Heggernes, Jan Arne Telle:
Making an Arbitrary Filled Graph Minimal by Removing Fill Edges. SWAT 1996: 173-184 - Endre Boros, Toshihide Ibaraki, Kazuhisa Makino:
Boolean Analysis of Incomplete Examples. SWAT 1996: 440-451 - Gerth Stølting Brodal:
Priority Queues on Parallel Machines. SWAT 1996: 416-427 - Gerth Stølting Brodal, Shiva Chaudhuri, Jaikumar Radhakrishnan:
The Randomized Complexity of Maintaining the Minimum. SWAT 1996: 4-15 - Andrej Brodnik, J. Ian Munro:
Neighbours on a Grid. SWAT 1996: 309-320 - Barun Chandra, Magnús M. Halldórsson:
Facility Dispersion and Remote Subgraphs. SWAT 1996: 53-65 - Rolf Fagerberg:
Binary Search Trees: How Low Can You Go? SWAT 1996: 428-439 - David Fernández-Baca, Giora Slutzki, David Eppstein:
Using Sparsification for Parametric Minimum Spanning Tree Problems. SWAT 1996: 149-160 - Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro:
Communication Complexity of Gossiping by Packets. SWAT 1996: 234-245 - Leszek Gasieniec, Marek Karpinski, Wojciech Plandowski, Wojciech Rytter:
Efficient Algorithms for Lempel-Zip Encoding (Extended Abstract). SWAT 1996: 392-403 - Gaston H. Gonnet, Steven A. Benner:
Probabilistic Ancestral Sequences and Multiple Alignments. SWAT 1996: 380-391 - Arvind Gupta, Damon Kaller, Sanjeev Mahajan, Thomas C. Shermer:
Vertex Partitioning Problems On Partial k-Trees. SWAT 1996: 161-172 - Monika Rauch Henzinger, Jan Arne Telle:
Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning. SWAT 1996: 16-27 - Kouichi Hirata, Shinichi Shimozono, Ayumi Shinohara:
On the Hardness of Approximating the Minimum Consistent OBDD Problem. SWAT 1996: 112-123 - Thore Husfeldt, Theis Rauhe, Søren Skyum:
Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parentheses Matching. SWAT 1996: 198-211 - Pierre Kelsen:
Neighborhood Graphs and Distributed Delta+1-Coloring. SWAT 1996: 223-233 - Pierre Kelsen, Sanjeev Mahajan, Ramesh Hariharan:
Approximate Hypergraph Coloring. SWAT 1996: 41-52 - Hartmut Klauck:
On the Hardness of Global and Local Approximation. SWAT 1996: 88-99 - Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting:
Computing the Unrooted Maximum Agreement Subtree in Sub-quadratic Time. SWAT 1996: 124-135 - Hoong Chuin Lau, Osamu Watanabe:
Randomized Approximation of the Constraint Satisfaction Problem (Extended Abstract). SWAT 1996: 76-87
skipping 9 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-08 04:26 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