![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 43 matches
- 1998
- James Abello, Adam L. Buchsbaum, Jeffery R. Westbrook:
A Functional Approach to External Graph Algorithms. ESA 1998: 332-343 - Micah Adler, Petra Berenbrink, Klaus Schröder:
Analyzing an Infinite Parallel Job Allocation Process. ESA 1998: 417-428 - Brenda S. Baker, Raffaele Giancarlo:
Longest Common Subsequence from Fragments via Sparse Dynamic Programming. ESA 1998: 79-90 - Yair Bartal, Marek Chrobak, Lawrence L. Larmore:
A Randomized Algorithm for Two Servers on the Line (Extended Abstract). ESA 1998: 247-258 - Piotr Berman, Juan A. Garay:
Adaptability and the Usefulness of Hints (Extended Abstract). ESA 1998: 271-282 - Johannes Blömer:
A Probabilistic Zero-Test for Expressions Involving Root of Rational Numbers. ESA 1998: 151-162 - Vincent Bouchitté, Ioan Todinca:
Minimal Triangulations for Graphs with "Few" Minimal Separators. ESA 1998: 344-355 - Phillip G. Bradford, Mordecai J. Golin
, Lawrence L. Larmore, Wojciech Rytter:
Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property. ESA 1998: 43-54 - Bernard Chazelle:
Car-Pooling as a Data Structuring Device: The Soft Heap. ESA 1998: 35-42 - Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu
, Jinhui Xu:
Finding an Optimal Path without Growing the Tree. ESA 1998: 356-367 - Ka Wong Chong, Edgar A. Ramos:
Improved Deterministic Parallel Padded Sorting. ESA 1998: 405-416 - Edith Cohen, Balachander Krishnamurthy, Jennifer Rexford:
Evaluating Server-Assisted Cache Replacement in the Web. ESA 1998: 307-319 - Felipe Cucker, Steve Smale:
Complexity Estimates Depending on Condition and Round-Off Error. ESA 1998: 115-126 - Ralf Diekmann, Andreas Frommer, Burkhard Monien:
Nearest Neighbor Load Balancing on Graphs. ESA 1998: 429-440 - Stephan J. Eidenbenz, Christoph Stamm, Peter Widmayer:
Positioning Guards at Fixed Height Above a Terrain - An Optimum Inapproximability Result. ESA 1998: 187-198 - Daniel W. Engels, David R. Karger
, Stavros G. Kolliopoulos, Sudipta Sengupta, R. N. Uma, Joel Wein:
Techniques for Scheduling with Rejection. ESA 1998: 490-501 - Michael R. Fellows, Michael T. Hallett
, Chantal Korostensky, Ulrike Stege:
Analogs and Duals of the MAST Problem for Sequences and Trees. ESA 1998: 103-114 - Matthias Fischer, Tamás Lukovszki, Martin Ziegler:
Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time. ESA 1998: 163-174 - Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
:
Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights. ESA 1998: 320-331 - Daniele Frigioni, Tobias Miller, Umberto Nanni
, Giulio Pasqualone, Guido Schäfer, Christos D. Zaroliagis
:
An Experimental Study of Dynamic Algorithms for Directed Graphs. ESA 1998: 368-380 - Johan Håstad, Lars Ivansson, Jens Lagergren:
Fitting Points on the Real Line and Its Application to RH Mapping. ESA 1998: 465-476 - Christopher S. Helvig, Gabriel Robins, Alexander Zelikovsky
:
Moving-Target TSP and Related Problems. ESA 1998: 453-464 - Robert W. Irving:
Matching Medical Students to Pairs of Hospitals: A New Variation on a Well-Known Theme. ESA 1998: 381-392 - Kazuo Iwama, Yahiko Kambayashi, Eiji Miyano
:
New Bounds for Oblivious Mesh Routing. ESA 1998: 295-306 - Bala Kalyanasundaram, Kirk Pruhs:
Maximizing Job Completions Online. ESA 1998: 235-246 - Ravi Kannan, Andreas Nolte:
A Fast Random Greedy Algorithm for the Component Commonality Problem. ESA 1998: 223-234 - Philip N. Klein:
Computing the Edit-Distance between Unrooted Ordered Trees. ESA 1998: 91-102 - Petr Kolman:
On Nonblocking Properties on the Benes Network. ESA 1998: 259-270 - Evangelos Kranakis, Danny Krizanc, Andrzej Pelc:
Fault-Tolerant Broadcasting in Radio Networks (Extended Abstract). ESA 1998: 283-294 - Michael Krivelevich, Benny Sudakov:
Approximate Coloring of Uniform Hypergraphs (Extended Abstract). ESA 1998: 477-489
skipping 13 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-07-19 20:48 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