Остановите войну!
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 52 matches
- 1975
- H. Asai, S. C. Lee:
Design of Queuing Buffer Register Size. Inf. Process. Lett. 3(5): 147-152 (1975) - Jon Louis Bentley, Donald F. Stanat:
Analysis of Range Searches in Quad Trees. Inf. Process. Lett. 3(6): 170-173 (1975) - Ivan Dal Bono, Mauro Diligenti, Concetta Mosca, Antonio Ricci, Antonio Villani:
A Simple FORTRAN Support for Computer-Assisted Instruction. Inf. Process. Lett. 3(3): 88-90 (1975) - Ibrahim Cahit, R. Cahit:
On the Graceful Numbering of Spanning Trees. Inf. Process. Lett. 3(4): 115-118 (1975) - Paolo M. Camerini, Francesco Maffioli:
Bounds for 3-Matroid Intersection Problems. Inf. Process. Lett. 3(3): 81-83 (1975) - Jacques Cohen:
Interpretation of Non-Deterministic Algorithms in Higher-Level Languages. Inf. Process. Lett. 3(4): 104-109 (1975) - Stefano Crespi-Reghizzi, Dino Mandrioli:
A Decidability Theorem for a Class of Vector-Addition Systems. Inf. Process. Lett. 3(3): 78-80 (1975) - Stefano Crespi-Reghizzi, Dino Mandrioli:
Erratum: A Decidability Theorem for a Class of Vector-Addition Systems. Inf. Process. Lett. 3(5): 164 (1975) - Subrata Dasgupta, John Tartar:
On the Minimization of Control Memories. Inf. Process. Lett. 3(3): 71-74 (1975) - S. Galand, G. Loncour:
Structured Implementation of Symbolic Execution: A First Part in a Program Verifier. Inf. Process. Lett. 3(4): 97-103 (1975) - Fanica Gavril:
An Algorithm for Testing Chordality of Graphs. Inf. Process. Lett. 3(4): 110-112 (1975) - Carlo Ghezzi:
LL(1) Grammars Supporting an Efficient Error Handling. Inf. Process. Lett. 3(6): 174-176 (1975) - Hans F. de Groote:
On the Complexity of Quaternion Multiplication. Inf. Process. Lett. 3(6): 177-179 (1975) - Per Brinch Hansen:
Universal Types in Concurrent Pascal. Inf. Process. Lett. 3(6): 165-166 (1975) - Chiharu Hosono:
On the Cardinality of Some Lattices. Inf. Process. Lett. 3(3): 67-68 (1975) - Tiko Kameda:
On the Vector Representation of the Reachability in Planar Directed Graphs. Inf. Process. Lett. 3(3): 75-77 (1975) - Roy A. Keir:
Should the Stable Rounding Rule be Radix-Dependent? Inf. Process. Lett. 3(6): 188-189 (1975) - Josef Kittler:
On the Divergence and the Joshi Dependence Measure in Feature Selection. Inf. Process. Lett. 3(5): 135-137 (1975) - Constantine Lazos:
A Comparison of Simulation Results and a Mathematical Model of a Multiprogramming System. Inf. Process. Lett. 3(5): 127-134 (1975) - Jan van Leeuwen:
The Membership Question for ET0L-Languages is Polynomially Complete. Inf. Process. Lett. 3(5): 138-143 (1975) - Richard J. Lipton, Robert W. Tuttle:
A Synchronization Anomaly. Inf. Process. Lett. 3(3): 65-66 (1975) - Stefan Pleszczynski:
On the Generation of Permutations. Inf. Process. Lett. 3(6): 180-183 (1975) - Franco P. Preparata, David E. Muller:
The Time Required to Evaluate Division-Free Arithmetic Expressions. Inf. Process. Lett. 3(5): 144-146 (1975) - John F. Reiser, Donald E. Knuth:
Evading the Drift in Floating-Point Addition. Inf. Process. Lett. 3(3): 84-87 (1975) - John F. Reiser, Donald E. Knuth:
Erratum: Evading the Drift in Floating-Point Addition. Inf. Process. Lett. 3(5): 164 (1975) - Martin Rem:
On the Programming of Elastic Stores. Inf. Process. Lett. 3(6): 184-187 (1975) - J. M. Robson:
A Simple Solution to the Interleaved Memory Bandwidth Problem. Inf. Process. Lett. 3(4): 125-126 (1975) - Sebastiaan H. von Solms:
On T0L Languages over Terminals. Inf. Process. Lett. 3(3): 69-70 (1975) - N. S. Sridharan:
Erratum: Computer Generation of Vertex Graphs. Inf. Process. Lett. 3(5): 164 (1975) - Antony Stevens:
An Elementary Computer Algorithm for the Calculation of the Coefficient of Inbreeding. Inf. Process. Lett. 3(5): 153-163 (1975)
skipping 22 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-24 15:44 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