Остановите войну!
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 45 matches
- 2006
- Mark Adcock, Richard Cleve, Kazuo Iwama, Raymond H. Putra, Shigeru Yamashita:
Quantum lower bounds for the Goldreich-Levin problem. Inf. Process. Lett. 97(5): 208-211 (2006) - Oswin Aichholzer, Franz Aurenhammer, Clemens Huemer, Hannes Krasser:
Transforming spanning trees and pseudo-triangulations. Inf. Process. Lett. 97(1): 19-22 (2006) - Christel Baier, Nathalie Bertrand, Philippe Schnoebelen:
A note on the attractor-property of infinite-state Markov chains. Inf. Process. Lett. 97(2): 58-63 (2006) - Amos Beimel, Enav Weinreb:
Monotone circuits for monotone weighted threshold functions. Inf. Process. Lett. 97(1): 12-18 (2006) - Srecko Brlek, Sardaouna Hamadou, John Mullins:
A flaw in the electronic commerce protocol SET. Inf. Process. Lett. 97(3): 104-108 (2006) - Salvatore Caporaso:
A decidable characterization of the classes between lintime and exptime. Inf. Process. Lett. 97(1): 36-40 (2006) - Zhenming Chen, Evanthia Papadopoulou, Jinhui Xu:
Robustness of k-gon Voronoi diagram construction. Inf. Process. Lett. 97(4): 138-145 (2006) - Jung Hee Cheon, Woo-Hwan Kim, Hyun Soo Nam:
Known-plaintext cryptanalysis of the Domingo-Ferrer algebraic privacy homomorphism scheme. Inf. Process. Lett. 97(3): 118-123 (2006) - Marek Chrobak, Claire Kenyon, Neal E. Young:
The reverse greedy algorithm for the metric k-median problem. Inf. Process. Lett. 97(2): 68-72 (2006) - Mirela Damian, Sriram V. Pemmaraju:
APX-hardness of domination problems in circle graphs. Inf. Process. Lett. 97(6): 231-237 (2006) - Stéphanie Delaune:
Easy intruder deduction problems with homomorphisms. Inf. Process. Lett. 97(6): 213-218 (2006) - Xiaotie Deng, Li-Sha Huang:
On the complexity of market equilibria with maximum social welfare. Inf. Process. Lett. 97(1): 4-11 (2006) - Jacques Dubrois, Jean-Guillaume Dumas:
Efficient polynomial time algorithms computing industrial-strength primitive roots. Inf. Process. Lett. 97(2): 41-45 (2006) - Pavlos S. Efraimidis, Paul G. Spirakis:
Weighted random sampling with a reservoir. Inf. Process. Lett. 97(5): 181-185 (2006) - Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos:
Weighted Coloring: further complexity and approximability results. Inf. Process. Lett. 97(3): 98-103 (2006) - Morteza Fayyazi, David R. Kaeli, Waleed Meleis:
An adjustable linear time parallel algorithm for maximum weight bipartite matching. Inf. Process. Lett. 97(5): 186-190 (2006) - Uriel Feige, Daniel Reichman:
On the hardness of approximating Max-Satisfy. Inf. Process. Lett. 97(1): 31-35 (2006) - Fedor V. Fomin, Kjartan Høie:
Pathwidth of cubic graphs and exact algorithms. Inf. Process. Lett. 97(5): 191-196 (2006) - Travis Gagie:
Compressing probability distributions. Inf. Process. Lett. 97(4): 133-137 (2006) - Hossein Ghodosi, Rahim Zaare-Nahandi:
Comments on the 'm out of n oblivious transfer'. Inf. Process. Lett. 97(4): 153-155 (2006) - Jiong Guo, Rolf Niedermeier:
A fixed-parameter tractability result for multicommodity demand flow in trees. Inf. Process. Lett. 97(3): 109-114 (2006) - Mohammad Taghi Hajiaghayi, Harald Räcke:
An O(sqrt(n))-approximation algorithm for directed sparsest cut. Inf. Process. Lett. 97(4): 156-160 (2006) - Mitsugu Iwamoto, Hirosuke Yamamoto:
Strongly secure ramp secret sharing schemes for general access structures. Inf. Process. Lett. 97(2): 52-57 (2006) - Bo Gyeong Kang, Je Hong Park:
On the relationship between squared pairings and plain pairings. Inf. Process. Lett. 97(6): 219-224 (2006) - Haim Kaplan, Nira Shafrir:
The greedy algorithm for edit distance with moves. Inf. Process. Lett. 97(1): 23-27 (2006) - Adam Kasperski, Pawel Zielinski:
An approximation algorithm for interval data minmax regret combinatorial optimization problems. Inf. Process. Lett. 97(5): 177-180 (2006) - Sangwon Kim, Joonwon Lee, Jinsoo Kim:
Runtime feasibility check for non-preemptive real-time periodic tasks. Inf. Process. Lett. 97(3): 83-87 (2006) - Wen-Hung Kuo, Dar-Li Yang:
Minimizing the makespan in a single machine scheduling problem with a time-based learning effect. Inf. Process. Lett. 97(2): 64-67 (2006) - Jeng Farn Lee, Meng Chang Chen, Ming-Tat Ko, Wanjiun Liao:
Bandwidth allocation algorithms for weighted maximum rate constrained link sharing policy. Inf. Process. Lett. 97(6): 238-243 (2006) - Neal Lesh, Michael Mitzenmacher:
BubbleSearch: A simple heuristic for improving priority-based greedy algorithms. Inf. Process. Lett. 97(4): 161-169 (2006)
skipping 15 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-06-06 00:18 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