EDBT 2026 Demo / reviewers in the wild / expert
Arthur W. Burks
dblp:80/1244
· DBLP profile ↗
8ranked-venue papers
8as first author
0since 2021 · last 2002
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 4 · 4 first-authorTheory of computation · 2 · 2 first-authorSystems, architecture and hardware · 1 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Integrated circuit design · 93% Processor architecture and microarchitecture · 7% | |
| Theoretical computer science
4 papers |
Coding theory · 60% Graph algorithms and graph theory · 40% |
Topics — the 7 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Integrated circuit design › digital circuit design
arithmetic circuit design |
0.0 | 1 | 1997 | Electronic Computing Circuits Of The ENIAC · Proc. IEEE 1997 |
Integrated circuit design
digital circuit design |
0.0 | 1 | 1997 | Electronic Computing Circuits Of The ENIAC · Proc. IEEE 1997 |
Integrated circuit design › digital circuit design › sequential circuit design
flip-flop |
0.0 | 1 | 1997 | Electronic Computing Circuits Of The ENIAC · Proc. IEEE 1997 |
Integrated circuit design
memory circuit design |
0.0 | 1 | 1997 | Electronic Computing Circuits Of The ENIAC · Proc. IEEE 1997 |
Processor architecture and microarchitecture
instruction set architecture |
0.0 | 1 | 1997 | Electronic Computing Circuits Of The ENIAC · Proc. IEEE 1997 |
Coding theory › sequences
sequence generators |
0.0 | 1 | 1962 | Sequence Generators, Graphs, and Formal Languages · Inf. Control. 1962 |
Coding theory
transition matrix |
0.0 | 1 | 1957 | The Logic of Automata - Part II · J. ACM 1957 |
Methods — techniques the papers use, named apart from their topics
circuit analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2002 | The invention of the universal electronic computer--how the Electronic Computer Revolution began
Arthur W. Burks |
Future Gener. Comput. Syst. | 1 |
| 1999 | Introduction to "The ENIAC"abstractUniversity of Michigan Arthur W. Burks, Edward S. Davidson |
Proc. IEEE | 1 |
| 1997 | Electronic Computing Circuits Of The ENIACabstractThe ENIAC (Electronic Numerical Integrator and Computer), the first electronic computing machine to be built, is a very large device (containing 18000 vacuum tubes) compounded out of a few basic types of computing circuits. The design principles that were followed in order to insure reliable operation of the electronic computer are presented, and the basic types of computing circuits are analyzed. Most of the design work on component circuits was devoted to constructing reliable memory circuits (flip-flops) and adding circuits (counters). These are treated in detail. The ENIAC performs the operations of addition, subtraction, multiplication, division, square-rooting, and the looking up of function values automatically. The units which perform these operations, the units which take numerical data into and out of the machine, and those which control the over-all operation are described. The technique of combining the basic electronic circuits to perform these functions is illustrated by three typical computing circuits: the addition circuit, a programming circuit, and the multiplication circuit. Arthur W. Burks |
Proc. IEEE | 1 |
| 1975 | Logic, Biology and Automata - Some Historical Reflections
Arthur W. Burks |
Int. J. Man Mach. Stud. | 1 |
| 1975 | Models of Deterministic Systems
Arthur W. Burks |
Math. Syst. Theory | 1 |
| 1962 | Sequence Generators, Graphs, and Formal Languages
Arthur W. Burks, Jesse B. Wright |
Inf. Control. | 1 |
| 1957 | The Logic of Automata - Part Iabstractarticle Free Access Share on The Logic of Automata—Part I Authors: Arthur W. Burks University of Michigan, Ann Arbor, Mich. University of Michigan, Ann Arbor, Mich.View Profile , Hao Wang University of Michigan, Ann Arbor, Mich. University of Michigan, Ann Arbor, Mich.View Profile Authors Info & Claims Journal of the ACMVolume 4Issue 2April 1957 pp 193–218https://doi.org/10.1145/320868.320880Online:01 April 1957Publication History 33citation1,118DownloadsMetricsTotal Citations33Total Downloads1,118Last 12 Months36Last 6 weeks2 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF Arthur W. Burks, Hao Wang 0001 |
J. ACM | 1 |
| 1957 | The Logic of Automata - Part IIabstractTRANSITION MATRICES AND MATRIX FORM NETS Transition MatricesThe transition part of a net controls the passage of the net from state to state and is therefore the heart of the net.In this subsection we introduce "the transition matrix," a table which describes a net by showing the various ways in which it may pass from one delay state to another.We use a characterizing table with M input (state) words I, N internalstate words S, and M X N rows, each of the form < , S ' > , to define N 2 direct-transition expressions I~j as follows.I ~ is a disjunction of all those I~ * Arthur W. Burks, Hao Wang 0001 |
J. ACM | 1 |