Остановите войну!
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 47 matches
- 2007
- Gildas Avoine, Serge Vaudenay:
How to safely close a discussion. Inf. Process. Lett. 102(4): 138-142 (2007) - Mauricio Ayala-Rincón, Bruno T. de Abreu, José de Siqueira:
A variant of the Ford-Johnson algorithm that is more space efficient. Inf. Process. Lett. 102(5): 201-207 (2007) - Oren Ben-Zwi, Oded Lachish, Ilan Newman:
Lower bounds for testing Euclidean Minimum Spanning Trees. Inf. Process. Lett. 102(6): 219-225 (2007) - Peter Brass:
Multidimensional heaps and complementary range searching. Inf. Process. Lett. 102(4): 152-155 (2007) - Henrik Brosenne, Carsten Damm, Matthias Homeister, Stephan Waack:
On approximation by XOR-OBDDs. Inf. Process. Lett. 102(1): 17-21 (2007) - Joseph Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Yong Zhang, Hong Zhu:
Greedy online frequency allocation in cellular networks. Inf. Process. Lett. 102(2-3): 55-61 (2007) - Edward Chlebus, Jordy Brazier:
Nonstationary Poisson modeling of web browsing session arrivals. Inf. Process. Lett. 102(5): 187-190 (2007) - Vaston G. Costa, Edward Hermann Haeusler, Eduardo Sany Laber, Loana Tito Nogueira:
A note on the size of minimal covers. Inf. Process. Lett. 102(2-3): 124-126 (2007) - Narsingh Deo, Aurel Cami:
Preferential deletion in dynamic models of web-like networks. Inf. Process. Lett. 102(4): 156-162 (2007) - Laurent Doyen:
Robust parametric reachability for timed automata. Inf. Process. Lett. 102(5): 208-213 (2007) - Travis Gagie:
Dynamic Shannon coding. Inf. Process. Lett. 102(2-3): 113-117 (2007) - Partha P. Goswami, Sandip Das, Subhas C. Nandy:
Chromatic distribution of k-nearest neighbors of a line segment in a planar colored point set. Inf. Process. Lett. 102(4): 163-168 (2007) - Jiong Guo, Falk Hüffner, Hannes Moser:
Feedback arc set in bipartite tournaments is NP-complete. Inf. Process. Lett. 102(2-3): 62-65 (2007) - Richard H. Hammack:
Minimum cycle bases of direct products of complete graphs. Inf. Process. Lett. 102(5): 214-218 (2007) - Wim H. Hesselink:
A linear-time algorithm for Euclidean feature transform sets. Inf. Process. Lett. 102(5): 181-186 (2007) - Iiro S. Honkala, Tero Laihonen:
On a new class of identifying codes in graphs. Inf. Process. Lett. 102(2-3): 92-98 (2007) - Ken S. Hu, Shyun-Shyun Yeoh, Chiuyuan Chen, Lih-Hsing Hsu:
Node-pancyclicity and edge-pancyclicity of hypercube variants. Inf. Process. Lett. 102(1): 1-7 (2007) - Kuo-Si Huang, Chang-Biau Yang, Kuo-Tsung Tseng, Yung-Hsing Peng, Hsing-Yen Ann:
Dynamic programming algorithms for the mosaic longest common subsequence problem. Inf. Process. Lett. 102(2-3): 99-103 (2007) - Min Ji, T. C. Edwin Cheng:
An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan. Inf. Process. Lett. 102(2-3): 41-47 (2007) - Ming Jiang, Yupin Luo, Shiyuan Yang:
Stochastic convergence analysis and parameter selection of the standard particle swarm optimization algorithm. Inf. Process. Lett. 102(1): 8-16 (2007) - Lukasz Kowalik:
Adjacency queries in dynamic sparse graphs. Inf. Process. Lett. 102(5): 191-195 (2007) - Wen-Hung Kuo, Dar-Li Yang:
Single machine scheduling with past-sequence-dependent setup times and learning effects. Inf. Process. Lett. 102(1): 22-26 (2007) - Fabien Laguillaumie, Damien Vergnaud:
Multi-designated verifiers signatures: anonymity without encryption. Inf. Process. Lett. 102(2-3): 127-132 (2007) - François Laroussinie, Jeremy Sproston:
State explosion in almost-sure probabilistic reachability. Inf. Process. Lett. 102(6): 236-241 (2007) - Shahram Latifi:
A study of fault tolerance in star graph. Inf. Process. Lett. 102(5): 196-200 (2007) - Thierry Lecroq:
Fast exact string matching algorithms. Inf. Process. Lett. 102(6): 229-235 (2007) - Min-Sheng Lin:
Fast and simple algorithms to count the number of vertex covers in an interval graph. Inf. Process. Lett. 102(4): 143-146 (2007) - Cho-Chin Lin, Hao-Yun Yin:
Bounds on the multi-clients incremental computing for homogeneous decreasing computation sequences. Inf. Process. Lett. 102(1): 35-40 (2007) - Fabrizio Luccio, Antonio Mesa Enriques, Linda Pagli:
k-Restricted rotation distance between binary trees. Inf. Process. Lett. 102(5): 175-180 (2007) - Jaume Martí-Farré:
A note on secret sharing schemes with three homogeneous access structure. Inf. Process. Lett. 102(4): 133-137 (2007)
skipping 17 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-04-23 16:52 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