Остановите войну!
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
- 1989
- Serge Abiteboul:
Boundedness is Undecidable for Datalog Programs with a Single Recursive Rule. Inf. Process. Lett. 32(6): 281-287 (1989) - Serge Abiteboul, Marc Gyssens, Dirk Van Gucht:
An Alternative Way to Represent the Cogroup of a Relation in the Context of Nested Databases. Inf. Process. Lett. 32(6): 317-324 (1989) - Henk Alblas:
Optimal Incremental Simple Multi-Pass Attribute Evaluation. Inf. Process. Lett. 32(6): 289-295 (1989) - Mikhail J. Atallah, Danny Z. Chen:
An Optimal Parallel Algorithm for the Minimum Circle-Cover Problem. Inf. Process. Lett. 32(4): 159-165 (1989) - Gerd Baron, Friedrich J. Urbanek:
Factorial Languages with Quadratically Upper Bounded Growth Functions and Nonlinearly Upper Bounded Subword Complexities. Inf. Process. Lett. 32(5): 267-269 (1989) - David A. Mix Barrington, James C. Corbett:
On the Relative Complexity of Some Languages in NC. Inf. Process. Lett. 32(5): 251-256 (1989) - Marshall W. Bern, Paul E. Plassmann:
The Steiner Problem with Edge Lengths 1 and 2. Inf. Process. Lett. 32(4): 171-176 (1989) - Joachim Biskup:
Boyce-Codd Normal Form and Object Normal Forms. Inf. Process. Lett. 32(1): 29-33 (1989) - Andreas Blass, Yuri Gurevich:
On Matijasevitch's Nontraditional Approach to Search Problems. Inf. Process. Lett. 32(1): 41-45 (1989) - Jan van den Bos:
PROCOL: A Protocol-Constrained Concurrent Object-Oriented Language. Inf. Process. Lett. 32(5): 221-227 (1989) - Laurence Boxer, Russ Miller:
A Parallel Circle-Cover Minimization Algorithm. Inf. Process. Lett. 32(2): 57-60 (1989) - P. P. Chakrabarti, Sujoy Ghose, A. Pandey, S. C. De Sarkar:
Increasing Search Efficiency Using Multiple Heuristics. Inf. Process. Lett. 32(5): 275 (1989) - Y. C. Chen, Z. C. Yen, G. H. Chen:
Using Fewer Processors to Reduce Time Complexities of Semigroup Computations. Inf. Process. Lett. 32(2): 89-93 (1989) - Maw-Sheng Chern, Gen-Huey Chen, Pangfeng Liu:
An LC Branch-and-Branch Algorithm for the Module Assignment Problem. Inf. Process. Lett. 32(2): 61-71 (1989) - Grant A. Cheston, Arthur M. Farley, Stephen T. Hedetniemi, Andrzej Proskurowski:
Centering a Spanning Tree of a Biconnected Graph. Inf. Process. Lett. 32(5): 247-250 (1989) - Hwang Kyu Choi, Myunghwan Kim:
Hybrid Join: An Improved Sort-Based Join Algorithm. Inf. Process. Lett. 32(2): 51-56 (1989) - A. Clouatre, Normand Laliberte, T. H. Merrett:
A General Implementation of Relational Recursion with Speedup Techniques for Programmers. Inf. Process. Lett. 32(5): 257-262 (1989) - Paul Cull, James L. Holloway:
Computing fibonacci numbers quickly. Inf. Process. Lett. 32(3): 143-149 (1989) - Peter Damaschke:
The Hamiltonian Circuit Problem for Circle Graphs is NP-Complete. Inf. Process. Lett. 32(1): 1-2 (1989) - Robert Demolombe, Arantza Illarramendi:
Heuristics for Syntactial Optimization of Relational Queries. Inf. Process. Lett. 32(6): 313-316 (1989) - Robert L. (Scot) Drysdale III, Jerzy W. Jaromczyk:
A Note on Lower Bounds for the Maximum Area and Maximum Perimeter (kappa)k-gon Problems. Inf. Process. Lett. 32(6): 301-303 (1989) - Ömer Egecioglu, Bahman Kalantari:
Approximating the Diameter of a Set of Points in the Euclidean Space. Inf. Process. Lett. 32(4): 205-211 (1989) - John A. Ellis, Manrique Mata, Gary MacGillivray:
A Linear Time Algorithm for Longest (s,t)-Paths in Weighted Outer Planar Graphs. Inf. Process. Lett. 32(4): 199-204 (1989) - Hazel Everett, A. Gupta:
Acyclic Directed Hypercubes may have Exponential Diameter. Inf. Process. Lett. 32(5): 243-245 (1989) - Dror G. Feitelson, Larry Rudolph:
Implementation of a Wait-Free Synchronization Primitive that Solves n-Process Consensus. Inf. Process. Lett. 32(2): 81-83 (1989) - Nissim Francez:
Cooperating Proofs for Distributed Programs with Multiparty Interactions. Inf. Process. Lett. 32(5): 235-242 (1989) - Alan Gibbons, Y. N. Srikant:
A Class of Problems Efficiently Solvable on Mesh-Connected Computers Including Dynamic Expression Evaluation. Inf. Process. Lett. 32(6): 305-311 (1989) - Andrzej M. Goscinski:
A synchronization algorithm for processes with dynamic priorities in computer networks with node failures. Inf. Process. Lett. 32(3): 129-136 (1989) - Neil J. Gunther:
Path Integral Methods for Computer Performance Analysis. Inf. Process. Lett. 32(1): 7-13 (1989) - Torben Hagerup:
Hybridsort Revisited and Parallelized. Inf. Process. Lett. 32(1): 35-39 (1989)
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-30 17:25 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