Остановите войну!
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 21 matches
- 2008
- Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upton:
A graph approach to the threshold all-against-all substring matching problem. ACM J. Exp. Algorithmics 12: 1.10:1-1.10:26 (2008) - Paul Biggar, Nicholas Nash, Kevin Williams, David Gregg:
An experimental study of sorting and branch prediction. ACM J. Exp. Algorithmics 12: 1.8:1-1.8:39 (2008) - Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz:
On the adaptiveness of Quicksort. ACM J. Exp. Algorithmics 12: 3.2:1-3.2:20 (2008) - Bruno Codenotti, Benton McCune, Sriram V. Pemmaraju, Rajiv Raman, Kasturi R. Varadarajan:
An experimental study of different approaches to solve the market equilibrium problem. ACM J. Exp. Algorithmics 12: 3.3:1-3.3:21 (2008) - Roman Dementiev, Juha Kärkkäinen, Jens Mehnert, Peter Sanders:
Better external memory suffix array construction. ACM J. Exp. Algorithmics 12: 3.4:1-3.4:24 (2008) - Camil Demetrescu, Roberto Tamassia:
Papers from ALENEX 2005. ACM J. Exp. Algorithmics 12: 3.1:1 (2008) - Martin Dietzfelbinger, Martin Hühne, Christoph Weidling:
A dictionary implementation based on dynamic perfect hashing. ACM J. Exp. Algorithmics 12: 1.11:1-1.11:25 (2008) - Thomas Hazel, Laura Toma, Jan Vahrenhold, Rajiv Wickremesinghe:
Terracost: Computing least-cost-path surfaces for massive grid terrains. ACM J. Exp. Algorithmics 12: 1.9:1-1.9:31 (2008) - Ioannis Krommidas, Christos D. Zaroliagis:
An experimental study of algorithms for fully dynamic transitive closure. ACM J. Exp. Algorithmics 12: 1.6:1-1.6:22 (2008) - Keqin Li:
Experimental average-case performance evaluation of online algorithms for routing and wavelength assignment and throughput maximization in WDM optical networks. ACM J. Exp. Algorithmics 12: 1.7:1-1.7:24 (2008) - Gonzalo Navarro, Nora Reyes:
Dynamic spatial approximation trees. ACM J. Exp. Algorithmics 12: 1.5:1-1.5:68 (2008) - Krister M. Swenson, Mark Marron, Joel V. Earnest-DeYoung, Bernard M. E. Moret:
Approximating the true evolutionary distance between two genomes. ACM J. Exp. Algorithmics 12: 3.5:1-3.5:17 (2008) - 2007
- Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Karem A. Sakallah:
Symmetry breaking for pseudo-Boolean formulas. ACM J. Exp. Algorithmics 12: 1.3:1-1.3:14 (2007) - Lars Arge, Giuseppe F. Italiano:
Preface. ACM J. Exp. Algorithmics 12: 2.1:1 (2007) - Michael A. Bender, Bryan Bradley, Geetha Jagannathan, Krishnan Pillaipakkamnatt:
Sum-of-squares heuristics for bin packing and memory allocation. ACM J. Exp. Algorithmics 12: 2.3:1-2.3:19 (2007) - Ulrik Brandes, Marco Gaertler, Dorothea Wagner:
Engineering graph clustering: Models and experimental evaluation. ACM J. Exp. Algorithmics 12: 1.1:1-1.1:26 (2007) - Gerth Stølting Brodal, Rolf Fagerberg, Kristoffer Vinther:
Engineering a cache-oblivious sorting algorithm. ACM J. Exp. Algorithmics 12: 2.2:1-2.2:23 (2007) - Andrew Leaver-Fay, Yuanxin Liu, Jack Snoeyink, Xueyi Wang:
Faster placement of hydrogens in protein structures by dynamic programming. ACM J. Exp. Algorithmics 12: 2.5:1-2.5:16 (2007) - Michael A. Maniscalco, Simon J. Puglisi:
An efficient, versatile approach to suffix sorting. ACM J. Exp. Algorithmics 12: 1.2:1-1.2:23 (2007) - Marco Pellegrini, Giordano Fusco:
Efficient IP table lookup via adaptive stratified trees with selective reconstructions. ACM J. Exp. Algorithmics 12: 1.4:1-1.4:28 (2007) - Evangelia Pyrga, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis:
Efficient models for timetable information in public transportation systems. ACM J. Exp. Algorithmics 12: 2.4:1-2.4:39 (2007)
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-27 03:53 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