Остановите войну!
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 48 matches
- 1974
- Robert B. K. Dewar:
A Stable Minimum Storage Sorting Algorithm. Inf. Process. Lett. 2(6): 162-164 (1974) - A. Hansal:
"Software Devices" for Processing Graphs Using PL/I Compile Time Facilities. Inf. Process. Lett. 2(6): 171-179 (1974) - C. A. R. Hoare:
Optimization of Store Size for Garbage Collection. Inf. Process. Lett. 2(6): 165-166 (1974) - L. Wayne Jackson, Subrata Dasgupta:
The Identification of Parallel Micro-Operations. Inf. Process. Lett. 2(6): 180-184 (1974) - Donald E. Knuth, Jayme Luiz Szwarcfiter:
A Structured Program to Generate all Topological Sorting Arrangements. Inf. Process. Lett. 2(6): 153-157 (1974) - K. P. Lee, Grzegorz Rozenberg:
The Length Sets of D0L Languages are Uniformly Bounded. Inf. Process. Lett. 2(6): 185-188 (1974) - Anthony G. Middleton:
Cost-Oriented Program Optimisation. Inf. Process. Lett. 2(6): 167-170 (1974) - Nicholas Solntseff:
On a Notational Device for the Description of Pointer-Free Operations on Structured Data. Inf. Process. Lett. 2(6): 158-159 (1974) - Robert Endre Tarjan:
A Note on Finding the Bridges of a Graph. Inf. Process. Lett. 2(6): 160-161 (1974) - 1973
- Edward N. Adams III:
Another Representation of Binary Tree Traversal. Inf. Process. Lett. 2(2): 52-54 (1973) - J. K. R. Barnett:
A Technique for Reducing Comparison Times in Certain Applications of the Merging Method of Sorting. Inf. Process. Lett. 2(5): 127-128 (1973) - Luc Boasson:
The Inclusion of the Substitution Closure of Linear and One-Counter Languages in the Largest Sub-AFL of the Family of Algebraic Languages is Proper. Inf. Process. Lett. 2(5): 135-140 (1973) - T. Brian Boffey:
Applying the Minimax Rule Over Graphs Which Are Not Trees. Inf. Process. Lett. 2(3): 79-81 (1973) - Edward G. Coffman Jr.:
A Note on the Relative Performance of Two Disk Scanning Policies. Inf. Process. Lett. 2(1): 15-17 (1973) - Joël Coffy:
On Computing the Time Complexity of Transitive Closure Algorithms. Inf. Process. Lett. 2(2): 39-42 (1973) - Jacques Cohen:
Syntax-Directed Unit Conversion. Inf. Process. Lett. 2(4): 100-102 (1973) - Armin B. Cremers, Hermann A. Maurer, Otto Mayer:
A Note on Leftmost Restricted Random Context Grammars. Inf. Process. Lett. 2(2): 31-33 (1973) - Raymond R. Devillers, Guy Louchard:
Realization of Petri Nets Without Conditional Statements. Inf. Process. Lett. 2(4): 105-107 (1973) - Barry Dwyer:
Simple Algorithms for Traversing a Tree Without an Auxiliary Stack. Inf. Process. Lett. 2(5): 143-145 (1973) - Andrzej Ehrenfeucht, Grzegorz Rozenberg:
A Limit Theorem for Sets of Subwords in Deterministic T0L Languages. Inf. Process. Lett. 2(3): 70-73 (1973) - Robert W. Floyd, Alan Jay Smith:
A Linear Time Two Tape Merge. Inf. Process. Lett. 2(5): 123-125 (1973) - Nissim Francez, Giora Slutzki:
On the Non-Compactness of the Class of Program Schemas. Inf. Process. Lett. 2(5): 141-142 (1973) - Wolfgang Henhapl:
A Transformation of Marked Graphs. Inf. Process. Lett. 2(1): 26-29 (1973) - Gabor T. Herman:
On Universal Computer-Constructors. Inf. Process. Lett. 2(3): 61-64 (1973) - H. Heuer, I. N. Molchanov:
Numerical Solution of a Boundary Problem for Equations of Elastic Equilibrium of Bodies in Transferences. Inf. Process. Lett. 2(5): 148-151 (1973) - C. A. R. Hoare:
A General Conservation Law for Queueing Disciplines. Inf. Process. Lett. 2(3): 82-85 (1973) - D. Holnapy, Miklós Szöts, A. Botár:
A Generalization of the Method of Finite Differences. Inf. Process. Lett. 2(2): 55-59 (1973) - Ray A. Jarvis:
On the Identification of the Convex Hull of a Finite Set of Points in the Plane. Inf. Process. Lett. 2(1): 18-21 (1973) - Juhani Karhumäki:
An Example of a PD2L-System with the Growth Type 2½. Inf. Process. Lett. 2(5): 131-134 (1973) - Victor N. Kasyanov:
Some Properties of Fully Reducible Graphs. Inf. Process. Lett. 2(4): 113-117 (1973)
skipping 18 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-03-19 05:15 CET 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