Остановите войну!
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 36 matches
- 1988
- Annika Aasa, Sören Holmström, Christina Nilsson:
An Efficiency Comparison of Some Representations of Purely Functional Arrays. BIT 28(3): 489-503 (1988) - Franz Aurenhammer:
On-Line Sorting of Twisted Sequences in Linear Time. BIT 28(2): 194-204 (1988) - J. W. de Bakker, John-Jules Ch. Meyer:
Metric Semantics for Concurrency. BIT 28(3): 504-529 (1988) - István Beck, Stein Krogdahl:
A Select and Insert Sorting Algorithm. BIT 28(4): 725-735 (1988) - Edward K. Blum:
The Semantics and Complexity of Parallel Programs for Vector Computations. Part I: A Case Study Using Ada. BIT 28(3): 530-551 (1988) - Chin-Chen Chang:
Application of Principal Component Analysis to Multi-Disk Concurrent Accessing. BIT 28(2): 205-214 (1988) - Pranay Chaudhuri:
Fast Parallel Graph Searching with Applications. BIT 28(1): 1-18 (1988) - Jens Clausen, Jakob Krarup:
Arranging Apples in an Array. BIT 28(3): 552-568 (1988) - Edsger W. Dijkstra:
On Binary Operators and Their Derived Relations. BIT 28(3): 377-382 (1988) - Bo Einarsson:
Tutorial on Analytical Methods as a Complement ot Numerical Computing. BIT 28(3): 383-390 (1988) - Paul Erdös, Hans Riesel:
On Admissible Constellations of Consecutive Primes. BIT 28(3): 391-396 (1988) - Andrei P. Ershov:
Basic Concepts of Algorithms and Programming to be Taught in a School Course in Informatics. BIT 28(3): 397-405 (1988) - Christos Faloutsos:
Signature Files: An Integrated Access Method for Text and Attributes, Sluitable for Optical Disk Storage. BIT 28(4): 736-754 (1988) - Carl-Erik Fröberg:
On a Combinatorial Problem Related to Permanents. BIT 28(3): 406-411 (1988) - J. K. Gibson:
A Generalisation of Brickell's Algorithm for Fast Modular Multiplication. BIT 28(4): 755-763 (1988) - David Gries, Jinyun Xue:
Generating a Random Cycle Permutation. BIT 28(3): 569-572 (1988) - Shou-Hsuan Stephen Huang:
A VLSI Partition Algorithm. BIT 28(2): 215-226 (1988) - Peter Johansen:
Inductive Inference of Ultimately Periodic Sequences. BIT 28(3): 573-580 (1988) - Rolf G. Karlsson:
Greedy Matching on a Grid. BIT 28(1): 19-26 (1988) - Rolf G. Karlsson, Mark H. Overmars:
Scanline Algorithms on a Grid. BIT 28(2): 227-241 (1988) - Reino Kurki-Suonio, T. Kankaanpää:
On the Design of Reactive Systems. BIT 28(3): 581-604 (1988) - Yannis Manolopoulos, John G. Kollias:
Estimating Disk Head Movement in Batched Searching. BIT 28(1): 27-36 (1988) - Brian H. Mayoh:
On Formalisms. BIT 28(3): 412-426 (1988) - P. P. Nicolaou, C. C. Lefas:
On the Recovery of Error Patterns from Signatures Obtained in Digital System Testing. BIT 28(2): 242-252 (1988) - Bengt Nordström:
Terminating General Recursion. BIT 28(3): 605-619 (1988) - Nageswara S. V. Rao, Vijay K. Vaishnavi, S. Sitharama Iyengar:
On the Dynamization of Data Structures. BIT 28(1): 37-53 (1988) - Anders P. Ravn, Hans Rischel, Hans Henrik Løvengreen:
A Design Method for Embedded Software Systems. BIT 28(3): 427-438 (1988) - Dana S. Richards, Pravin M. Vaidya:
On the Distribution of Comparisons in Sorting Algorithms. BIT 28(4): 764-774 (1988) - Steven Skiena:
Encroaching Lists as a Measure of Presortedness. BIT 28(4): 775-784 (1988) - Keith W. Smillie:
Array Theory and the Nial Programming Language. BIT 28(3): 439-449 (1988)
skipping 6 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-29 12:40 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