Остановите войну!
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 105 matches
- 1975
- Alfred V. Aho, Margaret J. Corasick:
Efficient String Matching: An Aid to Bibliographic Search. Commun. ACM 18(6): 333-340 (1975) - Alfred V. Aho, Stephen C. Johnson, Jeffrey D. Ullman:
Deterministic Parsing of Ambiguous Grammars. Commun. ACM 18(8): 441-452 (1975) - Morton M. Astrahan, Donald D. Chamberlin:
Implementation of a Structured English Query Language. Commun. ACM 18(10): 580-588 (1975) - Alan F. Babich, John Grason, David Lorge Parnas:
Significant Event Simulation. Commun. ACM 18(6): 323-329 (1975) - Vladimir Batagelj:
The Quadratic Hash Method When the Table Size Is Not a Prime Number. Commun. ACM 18(4): 216-217 (1975) - Friedrich L. Bauer:
Positivity and Norms. Commun. ACM 18(1): 9-13 (1975) - Jon Louis Bentley:
Multidimensional Binary Search Trees Used for Associative Searching. Commun. ACM 18(9): 509-517 (1975) - Garrett Birkhoff:
Two Hadamard Numbers for Matrices. Commun. ACM 18(1): 25-29 (1975) - James R. Bitner, Edward M. Reingold:
Backtrack Programming Techniques. Commun. ACM 18(11): 651-656 (1975) - Daniel G. Bobrow:
A Note on Hash Linking. Commun. ACM 18(7): 413-415 (1975) - Raymond F. Boyce, Donald D. Chamberlin, W. Frank King III, Michael Hammer:
Specifying Queries as Relational Expressions: The SQUARE Data Sublanguage. Commun. ACM 18(11): 621-628 (1975) - I. C. Braid:
The Synthesis of Solids Bounded by Many Faces. Commun. ACM 18(4): 209-216 (1975) - Gordon J. van der Brug, Jack Minker:
State-Space, Problem-Reduction, and Theorem Proving-Some Relationships. Commun. ACM 18(2): 107-115 (1975) - G. J. Burnett, Edward G. Coffman Jr.:
Analysis of Interleaved Memory Systems Using Blockage Buffers. Commun. ACM 18(2): 91-95 (1975) - Alfonso F. Cardenas:
Analysis and Performance of Inverted Data Base Structures. Commun. ACM 18(5): 253-263 (1975) - Jack A. Chambers, Ray V. Poore:
Computer Networks in Higher Education: Socio-Economic-Political Factors. Commun. ACM 18(4): 193-199 (1975) - Tien Chi Chen, Irving T. Ho:
Storage-Efficient Representation of Decimal Data. Commun. ACM 18(1): 49-52 (1975) - R. Mark Claudson:
The Digital Simulation of River Plankton Population Dynamics. Commun. ACM 18(9): 517-523 (1975) - Ira W. Cotton:
Remark on Stably Updating Mean and Standard Deviation of Data. Commun. ACM 18(8): 458 (1975) - Pierre-Jacques Courtois:
Decomposability, Instabilities, and Saturation in Multiprogramming Systems. Commun. ACM 18(7): 371-377 (1975) - Ben Cranston, Rick Thomas:
A Simplified Recombination Scheme for the Fibonacci Buddy System. Commun. ACM 18(6): 331-332 (1975) - Robert B. K. Dewar:
Indirect Threaded Code. Commun. ACM 18(6): 330-331 (1975) - Edsger W. Dijkstra:
Guarded Commands, Nondeterminacy and Formal Derivation of Programs. Commun. ACM 18(8): 453-457 (1975) - C. J. Doran:
Visible Surface Plotting Program (Remark on Algorithm 475). Commun. ACM 18(5): 277 (1975) - A. M. Erisman, W. F. Tinney:
On Computing Certain Elements of the Inverse of a Sparse Matrix. Commun. ACM 18(3): 177-179 (1975) - David J. Evans, Michael Hatzopoulos:
A Note on the LU Factorization of a Symmetric Matrix. Commun. ACM 18(5): 278-279 (1975) - Aaron Finerman:
Professionalism in the Computing Field. Commun. ACM 18(1): 4-9 (1975) - David A. Fisher:
Copying Cyclic List Structures in Linear Time Using Bounded Workspace. Commun. ACM 18(5): 251-252 (1975) - Robert W. Floyd, Ronald L. Rivest:
Expected Time Bounds for Selection. Commun. ACM 18(3): 165-172 (1975) - Robert W. Floyd, Ronald L. Rivest:
The Algorithm SELECT - for Finding the ith Smallest of n Elements [M1] (Algorithm 489). Commun. ACM 18(3): 173 (1975)
skipping 75 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-04-28 15:58 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