Остановите войну!
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 56 matches
- 1983
- Hitohisa Asai:
A Consideration of a Practical Implementation for a New Convergence Division. Inf. Process. Lett. 17(5): 273-281 (1983) - Mikhail J. Atallah:
A Linear Time Algorithm for the Hausdorff Distance Between Convex Polygons. Inf. Process. Lett. 17(4): 207-209 (1983) - David T. Barnard:
Recursive Descent Parsing Using Implementation Languages Requiring Definition Before Use. Inf. Process. Lett. 17(5): 255-258 (1983) - John J. Bartholdi III, Loren K. Platzman:
A Fast Heuristic Based on Spacefilling Curves for Minimum-Weight Matching in the Plane. Inf. Process. Lett. 17(4): 177-180 (1983) - Alan A. Bertossi:
Finding Hamiltonian Circuits in Proper Interval Graphs. Inf. Process. Lett. 17(2): 97-101 (1983) - Norbert Blum:
A Note on the 'Parallel Computation Thesis'. Inf. Process. Lett. 17(4): 203-205 (1983) - Paul De Bra, Jan Paredaens:
An Algorithm for Horizontal Decompositions. Inf. Process. Lett. 17(2): 91-95 (1983) - Manfred Broy:
Denotational Semantics of Communicating Processes Based on a Language for Applicative Multiprogramming. Inf. Process. Lett. 17(1): 29-35 (1983) - Francesca Cesarini, Giovanni Soda:
An Algorithm to Construct a Compact B-Tree in Case of Ordered Keys. Inf. Process. Lett. 17(1): 13-16 (1983) - Christian Choffrut, Karel Culík II:
Folding of the Plane and the Design of Systolic Arrays. Inf. Process. Lett. 17(3): 149-153 (1983) - W. F. Clocksin:
Real-Time Functional Queue Operations Using the Logical Variable. Inf. Process. Lett. 17(4): 173-175 (1983) - Cornelius Croitoru, Emilian Suditu:
Perfect Stables in Graphs. Inf. Process. Lett. 17(1): 53-56 (1983) - Andrzej Ehrenfeucht, Grzegorz Rozenberg:
On the Subword Complexity of m-Free D0L Languages. Inf. Process. Lett. 17(3): 121-124 (1983) - M. C. Er:
Computing Sums of Order-k Fibonacci Numbers in Log Time. Inf. Process. Lett. 17(1): 1-5 (1983) - Luis Fariñas del Cerro:
Space as Time. Inf. Process. Lett. 17(3): 113-115 (1983) - Michael J. Fischer, Mike Paterson:
Storage Requirements for Fair Scheduling. Inf. Process. Lett. 17(5): 249-250 (1983) - Anil R. Gangolli, Steven L. Tanimoto:
Two Pyramid Machine Algorithms for Sdge Detection in Noisy Binary Images. Inf. Process. Lett. 17(4): 197-202 (1983) - Leonidas J. Guibas, Jorge Stolfi:
On Computing All North-East Nearest Neighbors in the L1 Metric. Inf. Process. Lett. 17(4): 219-223 (1983) - Teruo Hikita:
Listing and Counting Subtrees of Equal Size of a Binary Tree. Inf. Process. Lett. 17(4): 225-229 (1983) - Tetsuo Ida:
Some FP Algebra with Currying Operation. Inf. Process. Lett. 17(5): 259-261 (1983) - Youichi Kobuchi:
Stability of Desynchronized 0L Systems. Inf. Process. Lett. 17(2): 85-90 (1983) - Reiner Kolla:
Where-Oblivious is not Sufficient. Inf. Process. Lett. 17(5): 263-268 (1983) - Clemens Lautemann:
BPP and the Polynomial Hierarchy. Inf. Process. Lett. 17(4): 215-217 (1983) - Vladimir Lifschitz, Leon Pesotchinsky:
A Note on the Complexity of a Partition Algorithm. Inf. Process. Lett. 17(3): 117-120 (1983) - Michael J. Magazine:
Optimality of Intuitive Checkpointing Policies. Inf. Process. Lett. 17(2): 63-66 (1983) - Erkki Mäkinen:
Boundedness Testing for Unambiguous Context-Free Grammars. Inf. Process. Lett. 17(4): 181-183 (1983) - Johannes J. Martin:
Precise Typing and Filters. Inf. Process. Lett. 17(3): 109-112 (1983) - Brian H. Mayoh:
Models of Programs and Processes. Inf. Process. Lett. 17(4): 211-214 (1983) - Ali Mili:
Verifying Programs by Induction on Their Data Structure: General Format and Applications. Inf. Process. Lett. 17(3): 155-160 (1983) - Eugene W. Myers:
An Applicative Random-Access Stack. Inf. Process. Lett. 17(5): 241-248 (1983)
skipping 26 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-28 06:00 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