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 38 matches
- 2005
- Méziane Aïder, Mustapha Aouchiche:
Distance monotonicity and a new characterization of Hamming graphs. Inf. Process. Lett. 96(6): 207-213 (2005) - K. Alagarsamy:
A mutual exclusion algorithm with optimally bounded bypasses. Inf. Process. Lett. 96(1): 36-40 (2005) - Greg Aloupis, Erin McLeish:
A lower bound for computing Oja depth. Inf. Process. Lett. 96(4): 151-153 (2005) - Dariusz Biernacki, Olivier Danvy, Chung-chieh Shan:
On the dynamic extent of delimited continuations. Inf. Process. Lett. 96(1): 7-17 (2005) - Elmar Böhler, Steffen Reith, Henning Schnoor, Heribert Vollmer:
Bases for Boolean co-clones. Inf. Process. Lett. 96(2): 59-66 (2005) - Walter A. Burkhard:
Double hashing with passbits. Inf. Process. Lett. 96(5): 162-166 (2005) - Agostino Capponi, Concetta Pilotto:
Bounded families for the on-line t-relaxed coloring. Inf. Process. Lett. 96(4): 141-145 (2005) - Alberto Caprara, Ulrich Pferschy:
Modified subset sum heuristics for bin packing. Inf. Process. Lett. 96(1): 18-23 (2005) - Kuan-Yu Chen, Kun-Mao Chao:
Optimal algorithms for locating the longest and shortest segments satisfying a sum or an average constraint. Inf. Process. Lett. 96(6): 197-201 (2005) - Vassilios V. Dimakopoulos, Leonidas Palios, Athanasios S. Poulakidas:
On the hamiltonicity of the cartesian product. Inf. Process. Lett. 96(2): 49-53 (2005) - Jywe-Fei Fang, Kuan-Chou Lai:
Embedding the incomplete hypercube in books. Inf. Process. Lett. 96(1): 1-6 (2005) - Alain Finkel, Jérôme Leroux:
The convex hull of a regular set of integer vectors is polyhedral and effectively computable. Inf. Process. Lett. 96(1): 30-35 (2005) - Rosario Gennaro, Mario Di Raimondo:
Secure multiplication of shared secrets in the exponent. Inf. Process. Lett. 96(2): 71-79 (2005) - Stasys Jukna:
On the P versus NP intersected with co-NP question in communication complexity. Inf. Process. Lett. 96(6): 202-206 (2005) - Swastik Kopparty, Chinya V. Ravishankar:
A framework for pursuit evasion games in Rn. Inf. Process. Lett. 96(3): 114-122 (2005) - Pangfeng Liu:
Minimum degree triangulation for rectangular domains. Inf. Process. Lett. 96(4): 128-135 (2005) - Moritz G. Maaß, Johannes Nowak:
A new method for approximate indexing and dictionary lookup with one error. Inf. Process. Lett. 96(5): 185-191 (2005) - Jérôme Monnot:
The labeled perfect matching in bipartite graphs. Inf. Process. Lett. 96(3): 81-88 (2005) - Eduardo Moreno:
De Bruijn sequences and De Bruijn graphs for a general language. Inf. Process. Lett. 96(6): 214-219 (2005) - Gonzalo Navarro, Nieves R. Brisaboa:
New bounds on D-ary optimal codes. Inf. Process. Lett. 96(5): 178-184 (2005) - Sahadeo Padhye:
Partial known plaintext attack on Koyama scheme. Inf. Process. Lett. 96(3): 96-100 (2005) - Andrea Pietracaprina, Geppino Pucci:
Optimal many-to-one routing on the mesh with constant queues. Inf. Process. Lett. 96(1): 24-29 (2005) - Dieter Rautenbach:
Lower bounds on treespan. Inf. Process. Lett. 96(2): 67-70 (2005) - Yuriy A. Reznik:
On the average depth of asymmetric LC-tries. Inf. Process. Lett. 96(3): 106-113 (2005) - Rocco A. Servedio, Andrew Wan:
Computing sparse permanents faster. Inf. Process. Lett. 96(3): 89-92 (2005) - Ali Sezgin, Ganesh Gopalakrishnan:
On the definition of sequential consistency. Inf. Process. Lett. 96(6): 193-196 (2005) - Igor E. Shparlinski, Arne Winterhof:
On the linear complexity of bounded integer sequences over different moduli. Inf. Process. Lett. 96(5): 175-177 (2005) - Bostjan Slivnik, Bostjan Vilfan:
Producing the left parse during bottom-up parsing. Inf. Process. Lett. 96(6): 220-224 (2005) - Nikhil Srivastava, Alan D. Taylor:
Tight bounds on plurality. Inf. Process. Lett. 96(3): 93-95 (2005) - Tadao Takaoka:
An O(n3loglogn/logn) time algorithm for the all-pairs shortest path problem. Inf. Process. Lett. 96(5): 155-161 (2005)
skipping 8 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-10-09 06:12 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