Остановите войну!
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 46 matches
- 1994
- Noga Alon, Raphael Yuster, Uri Zwick:
Finding and Counting Given Length Cycles (Extended Abstract). ESA 1994: 354-364 - Arne Andersson, Stefan Nilsson:
Faster Searching in Tries and Quadtrees - An Analysis of Level Compression. ESA 1994: 82-93 - Esther M. Arkin, Martin Held, Joseph S. B. Mitchell, Steven Skiena:
Hamilton Triangulations for Fast Rendering. ESA 1994: 36-47 - Sunil Arya, Michiel H. M. Smid:
Efficient Construction of a Bounded Degree Spanner with Low Weight. ESA 1994: 48-59 - Tetsuo Asano, Naoki Katoh, Takeshi Tokuyama:
A Unified Scheme for Detecting Fundamental Curves in Binary Edge Images. ESA 1994: 215-226 - Ishai Ben-Aroya, Assaf Schuster:
Greedy Hot-Potato Routing on the Mesh. ESA 1994: 365-376 - Piotr Berman, Ulrich Fößmeier, Marek Karpinski, Michael Kaufmann, Alexander Zelikovsky:
Approaching the 5/4-Approximation for Rectilinear Steiner Trees. ESA 1994: 60-71 - Therese C. Biedl, Goos Kant:
A Better Heuristic for Orthogonal Graph Drawings. ESA 1994: 24-35 - Gianfranco Bilardi, Paul Bay:
An Area Lower Bound for a Class of Fat-Trees (Extended Abstract). ESA 1994: 413-423 - Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jean-Marc Robert, Mariette Yvinec:
Convex Tours on Bounded Curvature. ESA 1994: 254-265 - Dany Breslauer, Livio Colussi, Laura Toniolo:
On the Exact Complexity of the String Prefix-Matching Problem (Extended Abstract). ESA 1994: 483-494 - Andrej Brodnik, J. Ian Munro:
Membership in Constant Time and Minimum Space. ESA 1994: 72-81 - Christoph Burnikel, Kurt Mehlhorn, Stefan Schirra:
How to Compute the Voronoi Diagram of Line Segments: Theoretical and Experimental Results. ESA 1994: 227-239 - Svante Carlsson, Jingsen Chen:
Some Lower Bounds for Comparison-Based Algorithms. ESA 1994: 106-117 - Bo Chen, André van Vliet, Gerhard J. Woeginger:
An Optimal Algorithm for Preemptive On-line Scheduling. ESA 1994: 300-306 - Victor Chepoi, Feodor F. Dragan:
A Linear-Time Algorithm for Finding a Central Vertex of a Chordal Graph. ESA 1994: 159-170 - Yi-Jen Chiang, Roberto Tamassia:
Optimal Shortest Path and Minimum-Link Path Queries in the Presence of Obstacles (Extended Abstract). ESA 1994: 266-277 - Bogdan S. Chlebus, Anna Gambin, Piotr Indyk:
PRAM Computations Resilient to Memory Faults. ESA 1994: 401-412 - Jun Dong Cho, Salil Raje, Majid Sarrafzadeh:
Approximation Algorithm on Multi-Way Maxcut Partitioning. ESA 1994: 148-158 - Sajal K. Das, Paolo Ferragina:
An o(n) Work EREW Parallel Algorithm for Updating MST. ESA 1994: 331-342 - Paolo Ferragina:
Incremental Text Editing: A New Data Structure. ESA 1994: 495-507 - Paolo Giulio Franciosa, Giorgio Gambosi, Umberto Nanni:
On the Structure of DFS-Forests on Directed Graphs and the Dynamic Maintenance of DFS on DAG's. ESA 1994: 343-353 - Ashim Garg, Roberto Tamassia:
Planar Drawings and Angular Resolution: Algorithms and Bounds (Extended Abstract). ESA 1994: 12-23 - Leszek Gasieniec, Kunsoo Park:
Work-Time Optimal Parallel Prefix Matching (Extended Abstract). ESA 1994: 471-482 - Andrew V. Goldberg:
Optimization Algorithms For Large Networks. ESA 1994: 1-9 - Gaston H. Gonnet:
Wanna Buy an Algorithm? Cheap! or: Algorithms for Text Searching Which Could Have Commercial Value (Abstract). ESA 1994: 10-11 - Raymond Greenlaw, Jonathan Machta:
The Parallel Complexity of Eden Growth, Solid-on-Solid Groth and Ballistic Deposition (Extended Abstract). ESA 1994: 436-447 - Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid:
Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric Objects. ESA 1994: 278-289 - Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns:
A Unified Approach to Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs. ESA 1994: 424-435 - Amos Israeli, Asaf Shirazi:
The Time Complexity of Updating Snapshot Memories. ESA 1994: 171-182
skipping 16 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-20 02:06 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