Abstractions, Their Algorithms, and Their Compilers

被引：6

作者：

Aho, Alfred ^{[1
]}

Ullman, Jeffrey ^{[2
]}

机构：

[1] Columbia Univ, Comp Sci, New York, NY 10034 USA

[2] Stanford Univ, Stanford, CA 94305 USA

来源：

COMMUNICATIONS OF THE ACM | 2022年 / 65卷 / 02期

关键词：

MODEL; COMPUTATION;

D O I：

10.1145/3490685

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

COMPUTATIONAL THINKING, WHICH centers around devising abstractions for problems so they can be solved with computational steps and efficient algorithms, is a concept that serves not only computer science (CS) but progressively more of science and everyday life.

引用

页码：76 / 91

页数：16

共 46 条

[1]

Aaronson S., 2005, 10 SEMI GRAND CHALLE

[2]

ADELSONVELSKII GM, 1962, DOKL AKAD NAUK SSSR+, V146, P263

[3]

Afrati FN, 2013, PROC VLDB ENDOW, V6, P277

[4]

Aho A. V., 1973, Conference Record of ACM Symposium on Principles of Programming Languages, P1

[5]

Aho A.V, 1991, HDB THEORETICAL COMP, P255

[6]

Aho A.V., 1994, FDN COMPUTER SCI

[7]

Aho Alfred V., 2008, ACM SIGCSE Bulletin, V40, P6, DOI [10.1145/1473195.1473196, DOI 10.1145/1473195.1473196]

[8] EFFICIENT STRING MATCHING - AID TO BIBLIOGRAPHIC SEARCH [J].

AHO, AV ;

CORASICK, MJ .

COMMUNICATIONS OF THE ACM, 1975, 18 (06) :333-340

[9]

Allen F. E., 1970, SIGPLAN Not, V5, P1, DOI DOI 10.1145/390013.808479

[10]

[Anonymous], 1978, FOCS

← 1 2 3 4 5 →