Остановите войну!
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 51 matches
- 1985
- Andrejs J. Auzins, Efim B. Kinber:
On Separation of the Emptiness and Equivalence Problems for Program Schemes. Inf. Process. Lett. 20(2): 91-93 (1985) - Baruch Awerbuch:
A New Distributed Depth-First-Search Algorithm. Inf. Process. Lett. 20(3): 147-150 (1985) - Danièle Beauquier, Dominique Perrin:
Codeterministic Automata on Infinite Words. Inf. Process. Lett. 20(2): 95-98 (1985) - W. M. Beynon, Costas S. Iliopoulos:
Computing a Basis for a Finite Abelian p-Group. Inf. Process. Lett. 20(3): 161-163 (1985) - Gianfranco Bilardi, Franco P. Preparata:
The VLSI Optimality of the AKS Sorting Network. Inf. Process. Lett. 20(2): 55-59 (1985) - James R. Bitner:
Storing Matrices on Disk for Efficient Row and Column Retrieval. Inf. Process. Lett. 20(5): 249-254 (1985) - Ronald V. Book, Friedrich Otto:
Cancellation Rules and Extended Word Problems. Inf. Process. Lett. 20(1): 5-11 (1985) - Adam C. Bounas:
Direct Determination of a 'Seed' Binary Matrix. Inf. Process. Lett. 20(1): 47-50 (1985) - Mee Yee Chan:
A Note on Redundant Disk Modulo Allocation. Inf. Process. Lett. 20(3): 121-123 (1985) - Richard Cole, Chee-Keng Yap:
A Parallel Median Algorithm. Inf. Process. Lett. 20(3): 137-139 (1985) - Luc Devroye:
A Note on the Expected Time Required to Construct the Outer Layer. Inf. Process. Lett. 20(5): 255-257 (1985) - Christine Duboc:
Some Properties of Commutation in Free Partially Commutative Monoids. Inf. Process. Lett. 20(1): 1-4 (1985) - W. J. Van Gils:
How to Cope with Faulty Processors in a Completely Connected Network of Communicating Processors. Inf. Process. Lett. 20(4): 207-213 (1985) - David Harel, David Peleg:
More on Looping vs. Repeating in Dynamic Logic. Inf. Process. Lett. 20(2): 87-90 (1985) - Juris Hartmanis:
Independence Results About Context-Free Languages and Lower Bounds. Inf. Process. Lett. 20(5): 241-248 (1985) - Costas S. Iliopoulos:
Analysis of Algorithms on Problems in General Abelian Groups. Inf. Process. Lett. 20(4): 215-220 (1985) - Sushil Jajodia:
On Equivalence of Relational and Network Database Models. Inf. Process. Lett. 20(1): 51-54 (1985) - Mathai Joseph:
On a Problem in Real-Time Computing. Inf. Process. Lett. 20(4): 173-177 (1985) - Subhash C. Kak:
How to Detect Tampering of Data. Inf. Process. Lett. 20(2): 109-110 (1985) - J. Mark Keil:
Finding Hamiltonian Circuits in Interval Graphs. Inf. Process. Lett. 20(4): 201-206 (1985) - Elena Lodi, Fabrizio Luccio:
Split Sequence Hash Search. Inf. Process. Lett. 20(3): 131-136 (1985) - Michael G. Main:
An Infinite Square-Free co-CFL. Inf. Process. Lett. 20(2): 105-107 (1985) - Erkki Mäkinen:
A Note on Undercover Relation. Inf. Process. Lett. 20(1): 19-21 (1985) - Erkki Mäkinen:
An Undecidable Problem for Context-Free Grammars. Inf. Process. Lett. 20(3): 141-142 (1985) - Alain J. Martin:
The Probe: An Addition to Communication Primitives. Inf. Process. Lett. 20(3): 125-130 (1985) - Geoff P. McKeown:
A Special Purpose MIMD Parallel Processor. Inf. Process. Lett. 20(1): 23-27 (1985) - John McLean:
A Comment on the 'Basic Security Theorem' of Bell and LaPadula. Inf. Process. Lett. 20(2): 67-70 (1985) - Silvio Romero de Lemos Meira:
A Linear Applicative Solution for the Set Union Problem. Inf. Process. Lett. 20(1): 43-45 (1985) - Andranik Mirzaian, Eshrat Arjomandi:
Selection in X+Y and Matrices With Sorted Rows and Columns. Inf. Process. Lett. 20(1): 13-17 (1985) - Carroll Morgan:
Global and Logical Time in Distributed Algorithms. Inf. Process. Lett. 20(4): 189-194 (1985)
skipping 21 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 22: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