Остановите войну!
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 43 matches
- 1999
- Amihood Amir, Ayelet Butman, Moshe Lewenstein:
Real Scaled Matching. Inf. Process. Lett. 70(4): 185-190 (1999) - Srinivasa Rao Arikati, Kurt Mehlhorn:
A Correctness Certificate for the Stoer-Wagner Min-Cut Algorithm. Inf. Process. Lett. 70(5): 251-254 (1999) - M. D. Atkinson, Jörg-Rüdiger Sack:
Pop-Stacks in Parallel. Inf. Process. Lett. 70(2): 63-67 (1999) - Roberto Barbuti, Nicoletta De Francesco, Antonella Santone, Gigliola Vaglini:
Abstract Interpretation of Trace Semantics for Concurrent Calculi. Inf. Process. Lett. 70(2): 69-78 (1999) - Benjamin Barden, Ran Libeskind-Hadas, Janet Davis, William Williams:
On Edge-Disjoint Spanning Trees in Hypercubes. Inf. Process. Lett. 70(1): 13-16 (1999) - Anna Bernasconi:
On the Complexity of Balanced Boolean Functions. Inf. Process. Lett. 70(4): 157-163 (1999) - Elisa Bertino, Barbara Catania, Limsoon Wong:
Finitely Representable Nested Relations. Inf. Process. Lett. 70(4): 165-173 (1999) - Eli Biham, Dan Boneh, Omer Reingold:
Breaking Generalized Diffie-Hellmann Modulo a Composite is no Easier Than Factoring. Inf. Process. Lett. 70(2): 83-87 (1999) - Harry Buhrman, Ronald de Wolf:
A Lower Bound for Quantum Search of an Ordered List. Inf. Process. Lett. 70(5): 205-209 (1999) - Yangjun Chen:
Arc Consistency Revisited. Inf. Process. Lett. 70(4): 175-184 (1999) - Chun-yen Chou, D. J. Guan, Kuei-lin Wang:
A Dynamic Fault-Tolerant Message Routing Algorithm for Double-Loop Networks. Inf. Process. Lett. 70(6): 259-264 (1999) - Sinisa Crvenkovic, Igor Dolinka, Zoltán Ésik:
A Note on Equations for Commutative Regular Languages. Inf. Process. Lett. 70(6): 265-267 (1999) - Yefim Dinitz, Alon Itai, Michael Rodeh:
On an Algorithm of Zemlyachenko for Subtree Isomorphism. Inf. Process. Lett. 70(3): 141-146 (1999) - J. D. Emerald, K. G. Subramanian, D. Gnanaraj Thomas:
A Note on Inferring Uniquely Terminating Code Languages. Inf. Process. Lett. 70(5): 217-222 (1999) - Celina M. H. de Figueiredo, João Meidanis, Célia Picinin de Mello:
Total-Chromatic Number and Chromatic Index of Dually Chordal Graphs. Inf. Process. Lett. 70(3): 147-152 (1999) - Deborah S. Franzblau:
Ear Decomposition with Bounds on Ear Length. Inf. Process. Lett. 70(5): 245-249 (1999) - David Guijarro, Víctor Lavín, Vijay Raghavan:
Exact Learning when Irrelevant Variables Abound. Inf. Process. Lett. 70(5): 233-239 (1999) - Robert Harper, John C. Mitchell:
Parametricity and Variants of Girard's J Operator. Inf. Process. Lett. 70(1): 1-5 (1999) - Kuo-Chan Huang, Feng-Jian Wang, Jyun-Hwei Tsai:
Two Design Patterns for Data-Parallel Computation Based on Master-Slave Model. Inf. Process. Lett. 70(4): 197-204 (1999) - Wen-Ping Hwang, Ching-Lin Wang:
In-Place Random List Permutations. Inf. Process. Lett. 70(6): 255-257 (1999) - Sanjay Jain:
On a Question of Nearly Minimal Identification of Functions. Inf. Process. Lett. 70(3): 113-117 (1999) - Öjvind Johansson:
Simple Distributed Delta+1-coloring of Graphs. Inf. Process. Lett. 70(5): 229-232 (1999) - Jyrki Katajainen, Tomi Pasanen:
In-Place Sorting with Fewer Moves. Inf. Process. Lett. 70(1): 31-37 (1999) - Samir Khuller, Anna Moss, Joseph Naor:
The Budgeted Maximum Coverage Problem. Inf. Process. Lett. 70(1): 39-45 (1999) - Ekkart Kindler, Wil M. P. van der Aalst:
Liveness, Fairness, and Recurrence in Petri Nets. Inf. Process. Lett. 70(6): 269-27 (1999) - James F. Korsh, Paul LaFollette:
Loopless Generation of Gray Codes for k-Ary Trees. Inf. Process. Lett. 70(1): 7-11 (1999) - Antonín Kucera:
On Finite Representations of Infinite-State Behaviours. Inf. Process. Lett. 70(1): 23-30 (1999) - Narn-Yih Lee, Tzonelih Hwang, Chih-Hung Wang:
The Security of Two ID-Based Multisignature Protocols for Sequential and Broadcasting Architectures. Inf. Process. Lett. 70(2): 79-81 (1999) - K. Rustan M. Leino, Raymie Stata:
Virginity: A Contribution to the Specification of Object-Oriented Software. Inf. Process. Lett. 70(2): 99-105 (1999) - Yen-Chun Lin, Chun-Keng Liu:
Finding Optimal Parallel Prefix Circuits with Fan-Out 2 in Constant Time. Inf. Process. Lett. 70(4): 191-195 (1999)
skipping 13 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-19 10:02 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