Остановите войну!
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 176 matches
- 1968
- Russell J. Abbott:
Letters to the editor: gathering of misleading data with little regard for privacy. Commun. ACM 11(5): 377-378 (1968) - Paul W. Abrahams:
Letters to the editor: On "prime phrase" in Feldman and Gries paper. Commun. ACM 11(10): 657 (1968) - Gary B. Anderson, David W. Rogers:
An inexpensive braille terminal device. Commun. ACM 11(6): 417-418 (1968) - William F. Atchison, Samuel D. Conte, John W. Hamblen, Thomas E. Hull, Thomas A. Keenan, William B. Kehl, Edward J. McCluskey, Silvio O. Navarro, Werner C. Rheinboldt, Earl J. Schweppe, William Viavant, David M. Young:
Curriculum 68: Recommendations for academic programs in computer science: a report of the ACM curriculum committee on computer science. Commun. ACM 11(3): 151-197 (1968) - Knut Bahr:
Letters to the editor: An auxiliary program to analyze LISP 1.5 programs. Commun. ACM 11(6): 392 (1968) - John F. Banzhaf:
When your computer needs a lawyer. Commun. ACM 11(8): 543-549 (1968) - Richard H. Bartels, Gene H. Golub:
Numerical Analysis: Stable numerical methods for obtaining the Chebyshev solution to an overdetermined system of equations. Commun. ACM 11(6): 401-406 (1968) - Richard H. Bartels, Gene H. Golub:
Algorithms: Algorithm 328: Chebyshev solution to an overdetermined linear system. Commun. ACM 11(6): 428-430 (1968) - G. Bayer:
Algorithms: Algorithm 324: Maxflow. Commun. ACM 11(2): 117-118 (1968) - G. Bayer:
Algorithms: Remark on algorithm 293: Transportation problem. Commun. ACM 11(4): 271-272 (1968) - A. J. Bayes:
A generalized partial pass block sort. Commun. ACM 11(7): 491-492 (1968) - James R. Bell:
Algorithm 334: Normal random deviates. Commun. ACM 11(7): 498 (1968) - Richard Bellman, Harriet H. Kagiwada, Robert Kalaba, R. Vasudevan:
Numerical Analysis: Quasilinearization and the estimation of differential operators from eigenvalues. Commun. ACM 11(4): 255-256 (1968) - Richard K. Bennett:
Letters to the editor: A base for language definition. Commun. ACM 11(9): 594 (1968) - Glenn David Bergland:
Numerical Analysis: A fast fourier transform algorithm for real-valued series. Commun. ACM 11(10): 703-710 (1968) - A. Bergson:
Algorithms: Certification of and remark on algorithm 304: Normal curve integral. Commun. ACM 11(4): 271 (1968) - J. D. Beyer, Ward Douglas Maurer, Frank K. Bamberger:
Letters to the editor: Comments on "An Improved Hash Code for Scatter Storage". Commun. ACM 11(5): 378 (1968) - Daniel G. Bobrow, J. Bruce Fraser:
A phonological rule tester. Commun. ACM 11(11): 766-772 (1968) - Daniel G. Bobrow, Daniel L. Murphy:
A note on the efficiency of a LISP computation in a paged machine. Commun. ACM 11(8): 558 (1968) - Helen V. Braden, William A. Wulf:
The implementation of a BASIC system in a multiprogramming environment. Commun. ACM 11(10): 688-692 (1968) - Paul T. Brady:
Writing an online debugging program for the experienced user. Commun. ACM 11(6): 423-427 (1968) - T. A. Bray:
Algorithms: Remark on algorithm 248: Netflow. Commun. ACM 11(9): 633 (1968) - T. A. Bray, Christoph Witzgall:
Algorithms: Algorithm 336: netflow. Commun. ACM 11(9): 631-633 (1968) - Harold J. Breaux:
A modification of Efroymson's technique for stepwise regression analysis. Commun. ACM 11(8): 556-558 (1968) - J. L. Byrne, Les G. Proll:
Algorithms: Algorithm 341: solution of linear programs in 0-1 variables by implicit enumeration. Commun. ACM 11(11): 782 (1968) - Richard G. Canning:
Goals for 1970. Commun. ACM 11(4): 220 (1968) - S. R. Clark:
Letters to the editor: Endorsing the Illinois post mortem dump. Commun. ACM 11(3): 150 (1968) - Edward G. Coffman Jr., Lee C. Varian:
Further experimental data on the behavior of programs in a paging environment. Commun. ACM 11(7): 471-474 (1968) - Robert C. Daley, Jack B. Dennis:
Virtual Memory, Processes, and Sharing in MULTICS. Commun. ACM 11(5): 306-312 (1968) - Jeffrey L. DeVeber:
Letters to the editor: correction's to Stone's compiler procedures. Commun. ACM 11(8): 538 (1968)
skipping 146 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-05-25 07:03 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