Demo Data from EDBT 2026 / reviewers in the wild / expert
Leslie M. Goldschlager
dblp:53/3015
· DBLP profile ↗
10ranked-venue papers
8as first author
0since 2021 · last 1997
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 6 · 5 first-authorSoftware engineering, systems software and programming languages · 2 · 2 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1Applied, interdisciplinary, general and emerging 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
3 papers |
Interconnection networks and networks-on-chip · 36% Parallel and multicore computing · 28% Integrated circuit design · 18% | |
| Theoretical computer science
2 papers |
Computational complexity · 100% |
Topics — the 8 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Electronic design automation › multi-objective optimization
area-time tradeoff |
0.0 | 1 | 1982 | Some Area-Time Tradeoffs for VLSI · SIAM J. Comput. 1982 |
Interconnection networks and networks-on-chip
network topology |
0.0 | 1 | 1982 | A universal interconnection pattern for parallel computers · J. ACM 1982 |
Parallel and multicore computing
parallel architecture |
0.0 | 1 | 1982 | A universal interconnection pattern for parallel computers · J. ACM 1982 |
Interconnection networks and networks-on-chip › interconnection networks
parallel computer interconnection |
0.0 | 1 | 1982 | A universal interconnection pattern for parallel computers · J. ACM 1982 |
Integrated circuit design › large-scale integration
VLSI circuits |
0.0 | 1 | 1982 | Some Area-Time Tradeoffs for VLSI · SIAM J. Comput. 1982 |
Computational complexity
circuit complexity |
0.0 | 1 | 1982 | Some Area-Time Tradeoffs for VLSI · SIAM J. Comput. 1982 |
Computational complexity › circuit complexity
VLSI complexity |
0.0 | 1 | 1982 | Some Area-Time Tradeoffs for VLSI · SIAM J. Comput. 1982 |
Parallel and multicore computing › parallel computation models
parallel machine model |
0.0 | 1 | 1978 | A Unified Approach to Models of Synchronous Parallel Machines · STOC 1978 |
Methods — techniques the papers use, named apart from their topics
upper bound construction · 0.0lower bound proof · 0.0simulation · 0.0graph-theoretic construction · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1997 | Integrating gestures into the user-interface management system
Xiao Yan Su, Leslie M. Goldschlager, Bala Srinivasan 0002 |
Vis. Comput. | 2 |
| 1986 | On the Construction of Parallel Computers from Various Bases of Boolean Functions
Leslie M. Goldschlager, Ian Parberry |
Theor. Comput. Sci. | 1 |
| 1982 | A universal interconnection pattern for parallel computersabstractarticle Free Access Share on A universal interconnection pattern for parallel computers Author: Leslie M. Goldschlager Basser Department of Computer Science, University of Sydney, N.S.W. Australia, 2006 Basser Department of Computer Science, University of Sydney, N.S.W. Australia, 2006View Profile Authors Info & Claims Journal of the ACMVolume 29Issue 4Oct. 1982 pp 1073–1086https://doi.org/10.1145/322344.322353Published:01 October 1982Publication History 137citation573DownloadsMetricsTotal Citations137Total Downloads573Last 12 Months15Last 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 Leslie M. Goldschlager |
J. ACM | 1 |
| 1982 | Some Area-Time Tradeoffs for VLSIabstractArea-time bounds on VLSI circuits for context-free language recognition, for the evaluation of propositional calculus formulae and for set equality and disjointness questions, are considered. In all cases, a lower bound $AT^{2\alpha } = \Omega (n^{1 + \alpha } )$ is proved, where A is the chip area, T the execution time, and $0 \leqq \alpha \leqq 1$. Similar results were known for computations with $\Omega (n)$-bit outputs, but the computations considered here have only 1-bit outputs. Upper bounds are also discussed. Richard P. Brent, Leslie M. Goldschlager |
SIAM J. Comput. | 2 |
| 1982 | The Maximum Flow Problem is Log Space Complete for P
Leslie M. Goldschlager, Ralph A. Shaw, John Staples |
Theor. Comput. Sci. | 1 |
| 1981 | Varepsilon-Productions in Context-Free Grammars
Leslie M. Goldschlager |
Acta Informatica | 1 |
| 1981 | Recursion in Small StorageabstractAbstract An implementation method for procedure calls is discussed which can lead to significant storage space reductions for recursive algorithms. Leslie M. Goldschlager |
Softw. Pract. Exp. | 1 |
| 1981 | Short Algorithms for Space-Filling Curves
Leslie M. Goldschlager |
Softw. Pract. Exp. | 1 |
| 1980 | A Space Efficient Algorithm for the Monotone Planar Circuit Value Problem
Leslie M. Goldschlager |
Inf. Process. Lett. | 1 |
| 1978 | A Unified Approach to Models of Synchronous Parallel MachinesabstractA number of different models of synchronous, unbounded parallel computers have appeared in recent literature. Without exception, running time on these models has been shown to be polynomially related to the classical space complexity measure. The general applicability of this relationship is called “the parallel computation thesis” and strong evidence of its truth is given in this paper by introducing the notion of “conglomerates” - a very large class of parallel machines, including all those which could feasibly be built. Leslie M. Goldschlager |
STOC | 1 |