Demo Data from EDBT 2026 / reviewers in the wild / expert
Hans P. Schlaeppi
dblp:71/4827
· DBLP profile ↗
2ranked-venue papers
2as first author
0since 2021 · last 1964
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2 · 2 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
2 papers |
Electronic design automation · 64% Memory systems · 36% | |
| Software engineering, system software, and programming languages
1 paper |
Programming languages and type systems · 100% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Electronic design automation
hardware description language |
0.0 | 1 | 1964 | A Formal Language for Describing Machine Logic, Timing, and Sequencing (LOTIS) · IEEE Trans. Electron. Comput. 1964 |
Memory systems
magnetic core memory |
0.0 | 1 | 1960 | Submicrosecond Core Memories Using Multiple Coincidence · IRE Trans. Electron. Comput. 1960 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1964 | A Formal Language for Describing Machine Logic, Timing, and Sequencing (LOTIS)abstractAn informal description of the LOTIS language is presented. LOTIS is intended for formally describing the logical structure, the sequencing, and the timing of digital machines. An effort has been made to produce a hardware notation that is convenient and lucid, precise and flexible. In a LOTIS machine description, every linguistic constituent corresponds to a unique machine element. Timing can be specified in the synchronous or asynchronous mode or in any combination of both. Autonomous control units have a notational counterpart by which, concurrency of several machine sequences, timesharing of facilities by several control units, and interlocks, can be concisely expressed. A machine description has a hierarchical structure with an arbitrary number of levels; this permits it to be readily segmented. Depending on the focus of interest, the level of descriptive detail can be varied over the different segments. Hans P. Schlaeppi |
IEEE Trans. Electron. Comput. | 1 |
| 1960 | Submicrosecond Core Memories Using Multiple CoincidenceabstractMemories using toroidal ferrite cores with cycle timies less than a microsecond are described; the selection ratio is increased by the use of biasing and the multiple coincidence principles of Minnick and Ashenhurst.1 It is shown that this mode of operation leads to important changes in the structure of the store; in particular, the classical core switch does not fulfll the new requirements. The ``two-core switch'' is then briefly described; it permits an elegant and economic solution of the problems arising at high selection ratios. Details of the design and operation of memories embodying these ideas are given; it is shown, for example, that standard core memory matrices can be used very efficiently at a selection ratio of 3:1 to achieve a cycle time of 2 microseconds. Further illustrations are given from a model of a 100×100 store operated at 4:1 and 7:1 selection ratios, and it is shown that a store of 10,000 8-bit characters with a cycle time of 0.25 microsecond is feasible. Hans P. Schlaeppi, Ivan P. V. Carter |
IRE Trans. Electron. Comput. | 1 |