Остановите войну!
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 53 matches
- 2003
- Elvira Albert, Michael Hanus, Germán Vidal:
A residualizing semantics for the partial evaluation of functional logic programs. Inf. Process. Lett. 85(1): 19-25 (2003) - Noga Alon:
A simple algorithm for edge-coloring bipartite multigraphs. Inf. Process. Lett. 85(6): 301-302 (2003) - Yash P. Aneja, R. Chandrasekaran, Kunhiraman Nair:
Parametric analysis of overall min-cuts and applications in undirected networks. Inf. Process. Lett. 85(2): 105-109 (2003) - Amitai Armon, Yossi Azar, Leah Epstein, Oded Regev:
On-line restricted assignment of temporary tasks with unknown durations. Inf. Process. Lett. 85(2): 67-72 (2003) - Therese C. Biedl, Timothy M. Chan, Alejandro López-Ortiz:
Drawing K2, n: A lower bound. Inf. Process. Lett. 85(6): 303-305 (2003) - Markus Bläser:
Computing small partial coverings. Inf. Process. Lett. 85(6): 327-331 (2003) - Chin-Chen Chang, Chi-Yien Chung:
An efficient protocol for anonymous multicast and reception. Inf. Process. Lett. 85(2): 99-103 (2003) - Edgar Chávez, Gonzalo Navarro:
Probabilistic proximity search: Fighting the curse of dimensionality in metric spaces. Inf. Process. Lett. 85(1): 39-46 (2003) - Francis Y. L. Chin, Hong Shen, Fu Lee Wang:
Transversal of disjoint convex polygons. Inf. Process. Lett. 85(1): 55-60 (2003) - Francis Y. L. Chin, Fu Lee Wang:
Erratum to: "Efficient algorithm for transversal of disjoint convex polygons". Inf. Process. Lett. 85(1): 53 (2003) - Ferdinando Cicalese, Ugo Vaccaro:
Binary search with delayed and missing answers. Inf. Process. Lett. 85(5): 239-247 (2003) - Richard Cole, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter:
On special families of morphisms related to [delta]-matching and don't care symbols. Inf. Process. Lett. 85(5): 227-233 (2003) - Mayur Datar, Tomás Feder, Aristides Gionis, Rajeev Motwani, Rina Panigrahy:
A combinatorial algorithm for MAX CSP. Inf. Process. Lett. 85(6): 307-315 (2003) - Dhananjay M. Dhamdhere, K. Gururaja, Prajakta G. Ganu:
A compact execution history for dynamic slicing. Inf. Process. Lett. 85(3): 145-152 (2003) - Doratha E. Drake, Stefan Hougardy:
A simple approximation algorithm for the weighted matching problem. Inf. Process. Lett. 85(4): 211-213 (2003) - Marianne Durand:
Asymptotic analysis of an optimized quicksort algorithm. Inf. Process. Lett. 85(2): 73-77 (2003) - Guillaume Fertin, André Raspaud, Arup Roychowdhury:
On the oriented chromatic number of grids. Inf. Process. Lett. 85(5): 261-266 (2003) - Guilherme Dias da Fonseca, Celina M. H. de Figueiredo:
Kinetic heap-ordered trees: Tight analysis and improved algorithms. Inf. Process. Lett. 85(3): 165-169 (2003) - Satoshi Fujita:
On-line grid-packing with a single active grid. Inf. Process. Lett. 85(4): 199-204 (2003) - Amparo Fúster-Sabater, Pedro García-Mochales:
On the balancedness of nonlinear generators of binary sequences. Inf. Process. Lett. 85(2): 111-116 (2003) - Chris Giannella, Edward L. Robertson:
A note on approximation measures for multi-valued dependencies in relational databases. Inf. Process. Lett. 85(3): 153-158 (2003) - Jurriaan Hage:
Enumerating submultisets of multisets. Inf. Process. Lett. 85(4): 221-226 (2003) - Takashi Horiyama, Toshihide Ibaraki:
Translation among CNFs, characteristic models and ordered binary decision diagrams. Inf. Process. Lett. 85(4): 191-198 (2003) - Tsung-Chuan Huang, Slo-Li Chu:
A statement based parallelizing framework for processor-in-memory architectures. Inf. Process. Lett. 85(3): 159-163 (2003) - Po-Hsueh Huang, Yin-Te Tsai, Chuan Yi Tang:
A fast algorithm for the alpha-connected two-center decision problem. Inf. Process. Lett. 85(4): 205-210 (2003) - Dimitris J. Kavvadias, Elias C. Stavropoulos:
Monotone Boolean dualization is in co-NP[log2n]. Inf. Process. Lett. 85(1): 1-6 (2003) - Sinichiro Kawano, Koichi Yamazaki:
Worst case analysis of a greedy algorithm for graph thickness. Inf. Process. Lett. 85(6): 333-337 (2003) - Idit Keidar, Sergio Rajsbaum:
A simple proof of the uniform consensus synchronous lower bound. Inf. Process. Lett. 85(1): 47-52 (2003) - Jae-Hoon Kim, Kyung-Yong Chwa:
Online deadline scheduling on faster machines. Inf. Process. Lett. 85(1): 31-37 (2003) - Jong Min Kim, Donghee Lee, Sam H. Noh, Sang Lyul Min, Yookun Cho, Chong-Sang Kim:
An accurate and practical buffer allocation model for the buffer cache based on marginal gains. Inf. Process. Lett. 85(2): 93-97 (2003)
skipping 23 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-25 02:29 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