Остановите войну!
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 18 matches
- 1980
- Selim G. Akl:
A New Algorithm for Generating Derangements. BIT 20(1): 2-7 (1980) - Stefan Arnborg:
A Simple Query Language Based on Set Algebra. BIT 20(3): 265-278 (1980) - W. M. Chan, Alan George:
A Linear Time Implementation of the Reverse Cuthill-McKee Algorithm. BIT 20(1): 8-14 (1980) - D. Julian M. Davies:
The Fifty Percent Rule Revisited. BIT 20(3): 279-288 (1980) - Hannu Erkiö:
A Heuristic Approximation of the Worst Case of Shellsort. BIT 20(2): 130-136 (1980) - Stein Gjessing:
Monitors with Arrays of Condition Variables and Proof Rules Handling Local Quantities. BIT 20(2): 137-144 (1980) - Juha Hakola, Ari Heiskanen:
On the Distribution of Wasted Space at the End of File Blocks. BIT 20(2): 145-156 (1980) - Pieter W. Hemker:
On the Structure of an Adaptive Multi-Level Algorithm. BIT 20(3): 289-301 (1980) - Pertti Järvinen:
On Structuring Problems of Job Design Met in the Development and Maintenance of Information Systems. BIT 20(1): 15-24 (1980) - Anker Helms Jørgensen:
A Methodology for Measuring the Readability and Modifiability of Computer Programs. BIT 20(4): 393-405 (1980) - Rainer Kemp:
A Note on the Stack Size of Regularly Distributed Binary Trees. BIT 20(2): 157-162 (1980) - Per-Åke Larson:
Analysis of Repeated Hashing. BIT 20(1): 25-32 (1980) - John W. Lloyd:
Optimal Partial-Match Retrieval. BIT 20(4): 406-413 (1980) - Peter Naur:
Impressions of the Early Days of Programming. BIT 20(4): 414-425 (1980) - Thomas Ottmann, Wolffried Stucky:
Higher Order Analysis of Random 1-2 Brother Trees. BIT 20(3): 302-314 (1980) - Hans-Werner Six, Derick Wood:
The Rectangle Intersection Problem Revisited. BIT 20(4): 426-433 (1980) - Dan Strömberg, Peter Fritzson:
Transfer of Programs from Development to Runtime Environments. BIT 20(4): 434-442 (1980) - Jerker Wilander:
An Interactive Programming System for Pascal. BIT 20(2): 163-174 (1980)
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-29 19:29 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