Остановите войну!
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 134 matches
- 1974
- Oliver Aberth:
A Precise Numerical Analysis Program. Commun. ACM 17(9): 509-513 (1974) - Paul W. Abrahams:
Some Remarks on Lookup of Structured Variables. Commun. ACM 17(4): 209-210 (1974) - A. F. Ackerman:
Quadratic Search for Hash Tables of Size pn. Commun. ACM 17(3): 164 (1974) - Forman S. Acton:
Recurrence Relations for the Fresnel Integral xxx and Similar Integrals. Commun. ACM 17(8): 480-481 (1974) - Thomas L. Adam, K. Mani Chandy, J. R. Dickson:
A Comparison of List Schedules for Parallel Processing Systems. Commun. ACM 17(12): 685-690 (1974) - John Adams, John Gary:
Compact Representation of Contour Plots for Phone Line Transmission. Commun. ACM 17(6): 333-336 (1974) - Hiroshi Akima:
A Method of Bivariate Interpolation and Smooth Surface Fitting Based on Local Procedures. Commun. ACM 17(1): 18-20 (1974) - Hiroshi Akima:
Bivariate Interpolation and Smooth Surface Fitting Based on Local Procedures [E2] (Algorithm 474). Commun. ACM 17(1): 26-31 (1974) - A. Balfour:
An Alternative Approach to Mutual Recursion in Algol 60 Using Restricted Compilers. Commun. ACM 17(4): 210 (1974) - E. Balkovich, W. Chiu, Leon Presser, R. Wood:
Dynamic Memory Repacking. Commun. ACM 17(3): 133-138 (1974) - Ronald Curtis Barrett, B. W. Jordan Jr.:
Scan Conversion Algorithms for a Cell Organized Raster Display. Commun. ACM 17(3): 157-163 (1974) - Ian Barrodale, F. D. K. Roberts:
Solution of an Overdetermined System of Equations in the L1 Norm [F4] (Algorithm 478). Commun. ACM 17(6): 319-320 (1974) - Ian J. Barton, Susan E. Creasey, Michael F. Lynch, Michael J. Snell:
An Information-Theoretic Approach to Text Searching in Direct Access Systems. Commun. ACM 17(6): 345-350 (1974) - Nancy E. Bosten, E. L. Battiste:
Incomplete Beta Ratio (Remark on Algorithm 179). Commun. ACM 17(3): 156-157 (1974) - D. M. Boulton:
Exact Probabilities for R x C Contingency Tables (Remark on Algorithm 434). Commun. ACM 17(6): 326 (1974) - John W. Boyse:
Execution Characteristics of Programs in a Page-on-Demand System. Commun. ACM 17(4): 192-196 (1974) - Richard P. Brent:
A Gaussian Pseudo-Random Number Generator (Algorithm 488). Commun. ACM 17(12): 704-706 (1974) - Coenraad Bron:
Merge Sort Algorithm (Remark on Algorithm 426). Commun. ACM 17(12): 706 (1974) - James A. Brown, Bernard Werner:
An On-Site Data Management System Application in Field Archaeology. Commun. ACM 17(11): 644-646 (1974) - John L. Bruno, Edward G. Coffman Jr., Ravi Sethi:
Scheduling Independent Tasks to Reduce Mean Finishing Time. Commun. ACM 17(7): 382-387 (1974) - Adhemar Bultheel:
Rosenbrock Function Minimization (Remark on Algorithm 450). Commun. ACM 17(8): 470 (1974) - Keith H. Burrell:
Evaluation of the Modified Bessel Functions K0(Z) and K1(Z) for Complex Arguments [S17] (Algorithm 484). Commun. ACM 17(9): 524-525 (1974) - Rudd H. Canaday, R. D. Harrison, Evan L. Ivie, J. L. Ryder, L. A. Wehr:
A Back-end Computer for Data Base Management. Commun. ACM 17(10): 575-582 (1974) - John C. Cavouras:
On the Conversion of Programs to Decision Tables: Method and Objectives. Commun. ACM 17(8): 456-462 (1974) - Abraham Charnes, William M. Raike, Joel David Stutz, Anthony S. Walters:
On Generation of Test Problems for Linear Programming Codes. Commun. ACM 17(10): 583-586 (1974) - To-Yat Cheung:
An Interactive Graphic Display for Region Partitioning by Linear Programming. Commun. ACM 17(9): 513-516 (1974) - Sherwood C. Chu, Mones Berman:
An Exponential Method for the Solution of Systems of Ordinary Differential Equations. Commun. ACM 17(12): 699-702 (1974) - A. K. Cline:
Scalar- and Planar- Valued Curve Fitting Using Splines Under Tension. Commun. ACM 17(4): 218-220 (1974) - A. K. Cline:
Six Subprograms for Curve Fitting Using Splines Under Tension [E2] (Algorithm 476). Commun. ACM 17(4): 220-223 (1974) - Jacques Cohen, Carl Zuckerman:
Two Languages for Estimating Program Efficiency. Commun. ACM 17(6): 301-308 (1974)
skipping 104 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-06-04 00:18 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