Остановите войну!
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 49 matches
- 2005
- Gill Barequet, Gershon Elber:
Optimal bounding cones of vectors in three dimensions. Inf. Process. Lett. 93(2): 83-89 (2005) - L. Sunil Chandran, Fabrizio Grandoni:
Refined memorization for vertex cover. Inf. Process. Lett. 93(3): 123-131 (2005) - Frédéric Chataigner:
Approximating the Maximum Agreement Forest on k trees. Inf. Process. Lett. 93(5): 239-244 (2005) - Stelvio Cimato, Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci:
Ideal contrast visual cryptography schemes with reversing. Inf. Process. Lett. 93(4): 199-206 (2005) - Tee Connie, Andrew Teoh Beng Jin, Michael Goh Kah Ong, David Ngo Chek Ling:
PalmHashing: a novel approach for cancelable biometrics. Inf. Process. Lett. 93(1): 1-5 (2005) - Raúl Durán Díaz, Jaime Muñoz Masqué:
Optimal strong primes. Inf. Process. Lett. 93(1): 47-52 (2005) - Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter:
The Helly property on subfamilies of limited size. Inf. Process. Lett. 93(2): 53-56 (2005) - Jianxi Fan, Xiaola Lin, Xiaohua Jia:
Node-pancyclicity and edge-pancyclicity of crossed cubes. Inf. Process. Lett. 93(3): 133-138 (2005) - Mirtha-Lina Fernández:
Relaxing monotonicity for innermost termination. Inf. Process. Lett. 93(3): 117-123 (2005) - Mirtha-Lina Fernández:
On proving CE-termination of rewriting by size-change termination. Inf. Process. Lett. 93(4): 155-162 (2005) - Celina M. H. de Figueiredo, Vinícius G. P. de Sá:
Note on the Homogeneous Set Sandwich Problem. Inf. Process. Lett. 93(2): 75-81 (2005) - Sibylle B. Fröschle:
The decidability border of hereditary history preserving bisimilarity. Inf. Process. Lett. 93(6): 289-293 (2005) - Akio Fujiyoshi:
Linearity and nondeletion on monadic context-free tree grammars. Inf. Process. Lett. 93(3): 103-107 (2005) - Daiji Fukagawa, Tatsuya Akutsu:
Performance analysis of a greedy algorithm for inferring Boolean functions. Inf. Process. Lett. 93(1): 7-12 (2005) - Thierry Garcia, David Semé:
A Coarse-Grained Multicomputer algorithm for the detection of repetitions. Inf. Process. Lett. 93(6): 307-313 (2005) - Daewan Han, Moonsik Lee:
An algebraic attack on the improved summation generator with 2-bit memory. Inf. Process. Lett. 93(1): 43-46 (2005) - Steffen Heber, Carla D. Savage:
Common intervals of trees. Inf. Process. Lett. 93(2): 69-74 (2005) - Jun-Ho Her, R. S. Ramakrishna:
External-memory depth-first search algorithm for solid grid graphs. Inf. Process. Lett. 93(4): 177-183 (2005) - Minghui Jiang:
UPS-k: a set partitioning problem with applications in UPS pickup-delivery system. Inf. Process. Lett. 93(4): 173-175 (2005) - Haejae Jung:
The d-deap ast: a fast and simple cache-aligned d-ary deap. Inf. Process. Lett. 93(2): 63-67 (2005) - Mikio Kano, Criel Merino, Jorge Urrutia:
On plane spanning trees and cycles of multicolored point sets with few intersections. Inf. Process. Lett. 93(6): 301-306 (2005) - Haim Kaplan, Nira Shafrir:
The greedy algorithm for shortest superstrings. Inf. Process. Lett. 93(1): 13-17 (2005) - Ryoichi Kato, Osamu Watanabe:
Substring search and repeat search using factor oracles. Inf. Process. Lett. 93(6): 269-274 (2005) - Sung Kwon Kim:
Finding a longest nonnegative path in a constant degree tree. Inf. Process. Lett. 93(6): 275-279 (2005) - Sandeep S. Kulkarni, Chase Bolen, John Oleszkiewicz, Andrew Robinson:
Alternators in read/write atomicity. Inf. Process. Lett. 93(5): 207-215 (2005) - K. Rustan M. Leino:
Efficient weakest preconditions. Inf. Process. Lett. 93(6): 281-288 (2005) - Franck Leprévost, Jean Monnerat, Sébastien Varrette, Serge Vaudenay:
Generating anomalous elliptic curves. Inf. Process. Lett. 93(5): 225-230 (2005) - Mingyan Li, Radha Poovendran, David A. McGrew:
Minimizing center key storage in hybrid one-way function based group key management with communication constraints. Inf. Process. Lett. 93(4): 191-198 (2005) - Andrzej Lingas, Martin Wahlen:
A note on maximum independent set and related problems on box graphs. Inf. Process. Lett. 93(4): 169-171 (2005) - Ruy Fabila Monroy, Jorge Urrutia:
Graham triangulations and triangulations with a center are hamiltonean. Inf. Process. Lett. 93(6): 295-299 (2005)
skipping 19 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-30 11:19 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