Остановите войну!
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 20 matches
- 2003
- Micah Adler, Sanjeev Khanna, Rajmohan Rajaraman, Adi Rosén:
Time-Constrained Scheduling of Weighted Packets on Trees and Meshes. Algorithmica 36(2): 123-152 (2003) - Amitai Armon, Yossi Azar, Leah Epstein:
Temporary Tasks Assignment Resolved. Algorithmica 36(3): 295-314 (2003) - Amotz Bar-Noy, Ari Freund, Shimon Landa, Joseph Naor:
Competitive On-Line Switching Policies. Algorithmica 36(3): 225-247 (2003) - Hannah Bast, Kurt Mehlhorn, Guido Schäfer:
A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms. Algorithmica 36(1): 75-88 (2003) - Louay Bazzi, Sanjoy K. Mitter:
The Solution of Linear Probabilistic Recurrence Relations. Algorithmica 36(1): 41-57 (2003) - Avrim Blum, Shuchi Chawla, Adam Kalai:
Static Optimality and Dynamic Search-Optimality in Lists and Trees. Algorithmica 36(3): 249-260 (2003) - Hans L. Bodlaender, Udi Rotics:
Computing the Treewidth and the Minimum Fill-In with the Modular Decomposition. Algorithmica 36(4): 375-408 (2003) - Gruia Calinescu, Cristina G. Fernandes, Howard J. Karloff, Alexander Zelikovsky:
A New Approximation Algorithm for Finding Heavy Planar Subgraphs. Algorithmica 36(2): 179-205 (2003) - Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting:
Escaping a Grid by Edge-Disjoint Paths. Algorithmica 36(4): 343-359 (2003) - Frank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson:
Efficient External Memory Algorithms by Simulating Coarse-Grained Parallel Algorithms. Algorithmica 36(2): 97-122 (2003) - Jeff Edmonds, Kirk Pruhs:
Multicast Pull Scheduling: When Fairness Is Fine. Algorithmica 36(3): 315-330 (2003) - Pascal Ferraro, Christophe Godin:
An Edit Distance between Quotiented Trees. Algorithmica 36(1): 1-39 (2003) - Anna Galluccio, Guido Proietti:
Polynomial Time Algorithms for 2-Edge-Connectivity Augmentation Problems. Algorithmica 36(4): 361-374 (2003) - Seok-Hee Hong, Peter Eades:
Drawing Trees Symmetrically in Three Dimensions. Algorithmica 36(2): 153-178 (2003) - Satoru Iwata:
Computing the Maximum Degree of Minors in Matrix Pencils via Combinatorial Relaxation. Algorithmica 36(4): 331-341 (2003) - Anna R. Karlin, Claire Kenyon, Dana Randall:
Dynamic TCP Acknowledgment and Other Stories about e/(e-1). Algorithmica 36(3): 209-224 (2003) - Matthew J. Katz, Frank Nielsen, Michael Segal:
Maintenance of a Piercing Set for Intervals with Applications. Algorithmica 36(1): 59-73 (2003) - Steven S. Seiden, Rob van Stee:
New Bounds for Multidimensional Packing. Algorithmica 36(3): 261-293 (2003) - Xiaoming Sun:
A 3-Party Simultaneous Protocol for SUM-INDEX. Algorithmica 36(1): 89-111 (2003) - Ying Xu:
An O(n1.5) Deterministic Gossiping Algorithm for Radio Networks. Algorithmica 36(1): 93-96 (2003)
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-21 18:49 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