Остановите войну!
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 17 matches
- 1981
- Harvey K. Brock, Barbara J. Brooks, Francis Sullivan:
Diamond - A Sorting Method for Vector Machines. BIT 21(2): 142-152 (1981) - Philippe Darondeau, Paul Le Guernic, Michel Raynal:
Types in a Mixed Language System. BIT 21(3): 245-254 (1981) - Ernst-Erich Doberkat:
Inserting a New Element in a Heap. BIT 21(3): 255-269 (1981) - Hannu Erkiö:
Speeding Sort Algorithms by Special Instructions. BIT 21(1): 2-19 (1981) - Trevor I. Fenner, George Loizou:
A Note on Traversal Algorithms for Triply Linked Binary Trees. BIT 21(2): 153-156 (1981) - Stephen Y. Itoga:
The String Merging Problem. BIT 21(1): 20-30 (1981) - Donald E. Knuth:
Verification of Link-Level Protocols. BIT 21(1): 31-36 (1981) - Bent Bruun Kristensen, Ole Lehrmann Madsen:
Diagnostics on LALR(k) Conflicts Based on a Method for LR(k) Testing. BIT 21(3): 270-293 (1981) - C. M. Lam, K. T. Fung:
A Quadratic Programming Model for Optimal Data Distribution. BIT 21(3): 294-304 (1981) - Bengt G. Lundberg:
On Consistency of Information Models. BIT 21(1): 37-45 (1981) - James K. Mullin:
Tightly Controlled Linear Hashing without Separate Overflow Storage. BIT 21(4): 390-400 (1981) - Olli Nevalainen, Jarmo Ernvall, Jyrki Katajainen:
Finding Minimal Spanning Trees in a Euclidean Coordinate Space. BIT 21(1): 46-54 (1981) - Aris M. Ouksel, Peter Scheuermann:
Multidimensional B-Trees: Analysis of Dynamic Behavior. BIT 21(4): 401-418 (1981) - Renzo Sprugnoli:
On the Allocation of Binary Trees to Secondary Storage. BIT 21(3): 305-316 (1981) - Markku Tamminen:
Order Preserving Extendible Hashing and Bucket Tries. BIT 21(4): 419-435 (1981) - Peter J. L. Wallis:
Some Primitives for the Portable Programming of Arrays and Vector Processors. BIT 21(4): 436-448 (1981) - Jin Kiu Wong:
Some Simple In-Place Merging Algorithms. BIT 21(2): 157-166 (1981)
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 11:51 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