Остановите войну!
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
- 2001
- Luca Aceto, Wan J. Fokkink:
Preface: Process Algebra. Inf. Process. Lett. 80(1): 1 (2001) - Roberto Baldoni, Jean-Michel Hélary, Achour Mostéfaoui, Michel Raynal:
Impossibility of scalar clock-based communication-induced checkpointing protocols ensuring the RDT property. Inf. Process. Lett. 80(2): 105-111 (2001) - Sanjoy K. Baruah:
Scheduling periodic tasks on uniform multiprocessors. Inf. Process. Lett. 80(2): 97-104 (2001) - Jan A. Bergstra, Alban Ponse:
Process algebra and conditional composition. Inf. Process. Lett. 80(1): 41-49 (2001) - Eberhard Bertsch, Mark-Jan Nederhof:
Size/lookahead tradeoff for LL(k)-grammars. Inf. Process. Lett. 80(3): 125-129 (2001) - Saad Biaz, Jennifer L. Welch:
Closed form bounds for clock synchronization under simple uncertainty assumptions. Inf. Process. Lett. 80(3): 151-157 (2001) - Laurence Boxer, Russ Miller:
A parallel algorithm for approximate regularity. Inf. Process. Lett. 80(6): 311-316 (2001) - Jorge Alberto Calvo, Danny Krizanc, Pat Morin, Michael A. Soss, Godfried T. Toussaint:
Convexifying polygons with simple projections. Inf. Process. Lett. 80(2): 81-86 (2001) - Diego Cazorla, Fernando Cuartero, Valentín Valero Ruiz, Fernando L. Pelayo:
A process algebra for probabilistic and nondeterministic processes. Inf. Process. Lett. 80(1): 15-23 (2001) - Ye-In Chang, Bor-Hsu Chen:
A generalized grid quorum strategy for k-mutual exclusion in distributed systems. Inf. Process. Lett. 80(4): 205-212 (2001) - Hung-Yu Chien, Tzong-Chen Wu, Jinn-ke Jan, Yuh-Min Tseng:
Cryptanalysis of Chang-Wu's group-oriented authentication and key exchange protocols. Inf. Process. Lett. 80(2): 113-117 (2001) - Gennaro Costagliola, Vincenzo Deufemia, Filomena Ferrucci, Carmine Gravino:
Decidability of the consistency problem for regular symbolic picture description languages. Inf. Process. Lett. 80(3): 119-124 (2001) - Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzón, James F. Reid:
A fast and practical bit-vector algorithm for the Longest Common Subsequence problem. Inf. Process. Lett. 80(6): 279-285 (2001) - Jovan Dj. Golic:
A probabilistic cryptanalytic method for a time-variant permutation generator. Inf. Process. Lett. 80(2): 67-73 (2001) - Frederic Green, Randall Pruim:
Relativized separation of EQP from PNP. Inf. Process. Lett. 80(5): 257-260 (2001) - Xudong Guan, Yiling Yang, Jinyuan You:
Typing evolving ambients. Inf. Process. Lett. 80(5): 265-270 (2001) - Refael Hassin, Shlomi Rubinstein:
Approximation algorithms for maximum linear arrangement. Inf. Process. Lett. 80(4): 171-177 (2001) - Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani:
Maximal matching stabilizes in time O(m). Inf. Process. Lett. 80(5): 221-223 (2001) - Shing-Tsaan Huang, Bau-Wen Chen:
Optimal 1-fair alternators. Inf. Process. Lett. 80(3): 159-163 (2001) - Ahmad Kadrie, V. Rajkumar Dare, D. Gnanaraj Thomas, K. G. Subramanian:
Algebraic properties of the shuffle over omega-trajectories. Inf. Process. Lett. 80(3): 139-144 (2001) - Goran Konjevod, R. Ravi, F. Sibel Salman:
On approximating planar metrics by tree metrics. Inf. Process. Lett. 80(4): 213-219 (2001) - Seok-Lyong Lee, Chin-Wan Chung:
On the effective clustering of multidimensional data sequences. Inf. Process. Lett. 80(2): 87-95 (2001) - Minkyu Lee, Dongsoo Han, Jaeyong Shim:
Set-based access conflict analysis of concurrent workflow definition. Inf. Process. Lett. 80(4): 189-194 (2001) - Hanwook Lee, Dae Woong Kim, Chan-Ik Park:
Phased RGSS: An improved disk array scheduling for continuous media retrieval. Inf. Process. Lett. 80(5): 225-231 (2001) - Z. C. Li, Lucas Chi Kwong Hui, Kam-Pui Chow, C. F. Chong, Wai Wan Tsang, H. W. Chan:
Security of Wang et al.'s group-oriented (t, n) threshold signature schemes with traceable signers. Inf. Process. Lett. 80(6): 295-298 (2001) - Erl-Huei Lu, Shao-Wei Wu, Yi-Chang Cheng:
A decoding algorithm for triple-error-correcting binary BCH codes. Inf. Process. Lett. 80(6): 299-303 (2001) - Clare E. Martin, Jeremy Gibbons:
On the semantics of nested datatypes. Inf. Process. Lett. 80(5): 233-238 (2001) - Jérôme Monnot:
The maximum f-depth spanning tree problem. Inf. Process. Lett. 80(4): 179-187 (2001) - Hiroshi Nagamochi, Toshimasa Ishii, Hiro Ito:
Minimum cost source location problem with vertex-connectivity requirements in digraphs. Inf. Process. Lett. 80(6): 287-293 (2001) - Flemming Nielson, Hanne Riis Nielson, Shmuel Sagiv:
Kleene's Logic with Equality. Inf. Process. Lett. 80(3): 131-137 (2001)
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-04 04:20 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