Остановите войну!
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 57 matches
- 1992
- Eliezer A. Albacea:
A Parallel Algorithm for Edge-Coloring of Graphs with Edge-Disjoint Cycles. Inf. Process. Lett. 43(6): 309-314 (1992) - Lloyd Allison:
Lazy Dynamic-Programming Can Be Eager. Inf. Process. Lett. 43(4): 207-212 (1992) - Leo Bachmair:
Associative-Commutative Reduction Orderings. Inf. Process. Lett. 43(1): 21-27 (1992) - A. Bagchi:
On Sorting in the Presence of Erroneous Information. Inf. Process. Lett. 43(4): 213-215 (1992) - Marshall W. Bern, John R. Gilbert:
Drawing the Planar Dual. Inf. Process. Lett. 43(1): 7-13 (1992) - Jean-Camille Birget:
Intersection and Union of Regular Languages and State Complexity. Inf. Process. Lett. 43(4): 185-190 (1992) - Michele Boreale, Paola Inverardi, Monica Nesi:
Complete Sets of Axioms for Finite Basic LOTOS Behavioural Equivalences. Inf. Process. Lett. 43(3): 155-160 (1992) - Barun Chandra:
Does Randomization Help in On-Line Bin Packing? Inf. Process. Lett. 43(1): 15-19 (1992) - Maw-Shang Chang, Fu-Hsing Wang:
Efficient Algorithms for the Maximum Weight Clique and Maximum Weight Independent Set Problems on Permutation Graphs. Inf. Process. Lett. 43(6): 293-295 (1992) - Yeow Meng Chee, Andrew Lim:
The Algorithmic Complexity of Colour Switching. Inf. Process. Lett. 43(2): 63-68 (1992) - Zhi-Zhong Chen:
A Fast and Efficient Parallel Algorithm for Finding a Satisfying Truth Assignment to a 2-CNF Formula. Inf. Process. Lett. 43(4): 191-193 (1992) - Hanxiong Chen, Xu Yu, Kazunori Yamaguchi, Hiroyuki Kitagawa, Nobuo Ohbo, Yuzuru Fujiwara:
Decomposition - An Approach for Optimizing Queries Including ADT Functions. Inf. Process. Lett. 43(6): 327-333 (1992) - Steven Cheung, Francis C. M. Lau:
Mesh Permutation Routing with Locality. Inf. Process. Lett. 43(2): 101-105 (1992) - Zbigniew J. Czech, George Havas, Bohdan S. Majewski:
An Optimal Algorithm for Generating Minimal Perfect Hash Functions. Inf. Process. Lett. 43(5): 257-264 (1992) - Robin W. Dawes:
Some Pursuit-Evasion Problems on Grids. Inf. Process. Lett. 43(5): 241-247 (1992) - Vassil S. Dimitrov, Todor Cooklev, B. D. Donevsky:
On the Multiplication of Reduced Biquaternions and Applications. Inf. Process. Lett. 43(3): 161-164 (1992) - V. I. Galiev, A. F. Polupanov, Igor E. Shparlinski:
Distances from Differences of Roots of Polynomials to the Nearest Integers. Inf. Process. Lett. 43(3): 143-146 (1992) - Peter Gemmell, Madhu Sudan:
Highly Resilient Correctors for Polynomials. Inf. Process. Lett. 43(4): 169-174 (1992) - Ronald I. Greenberg, F. Miller Maley:
Minimum Separation for Single-Layer Channel Routing. Inf. Process. Lett. 43(4): 210-205 (1992) - Torben Hagerup:
On a Compaction Theorem of Ragde. Inf. Process. Lett. 43(6): 335-340 (1992) - Thomas A. Henzinger:
Sooner is Safer Than Later. Inf. Process. Lett. 43(3): 135-141 (1992) - Ju Yuan Hsiao, Chuan Yi Tang, Ruay Shiung Chang:
An Efficient Algorithm for Finding a Maximum Weight 2-Independent Set on Interval Graphs. Inf. Process. Lett. 43(5): 229-235 (1992) - Su-Chu Hsu, Shing-Tsaan Huang:
A Self-Stabilizing Algorithm for Maximal Matching. Inf. Process. Lett. 43(2): 77-81 (1992) - Fang-Rong Hsu, Richard C. T. Lee, R. C. Chang:
Special Subgraphs of Weighted Visibility Graphs. Inf. Process. Lett. 43(2): 69-75 (1992) - Daniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg:
Voronoi Diagrams of Rigidly Moving Sets of Points. Inf. Process. Lett. 43(4): 217-223 (1992) - Tzonelih Hwang:
Attacks on Okamoto and Tanaka's One-Way ID-Based Key Distribution System. Inf. Process. Lett. 43(2): 81-86 (1992) - Katsushi Inoue, Akira Ito, Itsuo Takanami:
A Relationship Between Nondeterministic Turing Machines and 1-Inkdot Turing Machines with Small Space. Inf. Process. Lett. 43(4): 225-227 (1992) - Izidor Jerebic, Roman Trobec:
Optimal Routing in Toroidal Networks. Inf. Process. Lett. 43(6): 285-291 (1992) - Walter Kern:
Learning Convex Bodies under Uniform Distribution. Inf. Process. Lett. 43(1): 35-39 (1992) - Do-Hyung Kim, Kwang-Moo Choe:
Corrigenda: Yet Another Efficient Backward Execution Algorithm in the AND/OR Process Model. Inf. Process. Lett. 43(3): 165 (1992)
skipping 27 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-26 11:36 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