VLDB 2026 Research / reviewers in the wild / expert
John Lamping
dblp:42/1676
· DBLP profile ↗
18ranked-venue papers
5as first author
0since 2021 · last 2000
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 6 · 3 first-authorHuman-computer interaction and ubiquitous computing · 6 · 2 first-authorArtificial intelligence and machine learning · 5Databases, data management, data science and information retrieval · 1Graphics, computer vision, multimedia, augmented reality and games · 1
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.
| Software engineering, system software, and programming languages
4 papers |
Programming languages and type systems · 57% Requirements engineering and software design · 40% Software maintenance and evolution · 3% | |
| Computer graphics and multimedia
2 papers |
Visualization and visual analytics · 100% | |
| Theoretical computer science
2 papers |
Automata and formal languages · 43% Logic in computer science · 38% Graph algorithms and graph theory · 19% | |
| Computer architecture, parallel and distributed computing, and storage systems
4 papers |
Distributed systems · 69% Parallel and multicore computing · 31% | |
| Human-computer interaction and pervasive computing
3 papers |
Interaction techniques and input · 54% Collaborative and social computing · 46% | |
| Artificial intelligence
2 papers |
Knowledge representation and reasoning · 50% Planning, search and constraint satisfaction · 27% Information extraction and text analysis · 23% | |
| Databases, data mining, and information retrieval
2 papers |
Data models and query languages · 100% |
Topics — the 22 heaviest of 26, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Programming languages and type systems
programming models |
0.0 | 1 | 2000 | A programming model for active documents · UIST 2000 |
Requirements engineering and software design
software architecture |
0.0 | 2 | 1997 | Open Implementation Design Guidelines · ICSE 1997 Issues in the Design and Documentation of Class Libraries · OOPSLA 1992 |
Visualization and visual analytics
focus+context visualization |
0.0 | 1 | 1995 | A Focus+Context Technique Based on Hyperbolic Geometry for Visualizing Large Hierarchies · CHI 1995 |
Visualization and visual analytics
hierarchical data visualization |
0.0 | 1 | 1995 | A Focus+Context Technique Based on Hyperbolic Geometry for Visualizing Large Hierarchies · CHI 1995 |
Distributed systems
distributed coordination |
0.0 | 1 | 1995 | High-Latency, Low-Bandwidth Windowing in the Jupiter Collaboration System · ACM Symposium on User Interface Software and Technology 1995 |
Interaction techniques and input › interactive graphics
focus+context interaction |
0.0 | 1 | 1994 | Laying Out and Visualizing Large Trees Using a Hyperbolic Space · ACM Symposium on User Interface Software and Technology 1994 |
Programming languages and type systems
type systems |
0.0 | 1 | 1993 | Typing the Specialization Interface · OOPSLA 1993 |
Programming languages and type systems › metaprogramming
metaobject protocol |
0.0 | 1 | 1992 | Issues in the Design and Documentation of Class Libraries · OOPSLA 1992 |
Parallel and multicore computing › parallel algorithms › parallel string algorithms
parallel parsing |
0.0 | 1 | 1991 | Compose-Reduce Parsing · ACL 1991 |
Automata and formal languages › parsing
context-free grammar parsing |
0.0 | 1 | 1991 | Compose-Reduce Parsing · ACL 1991 |
Automata and formal languages
parsing |
0.0 | 1 | 1991 | Compose-Reduce Parsing · ACL 1991 |
Graph algorithms and graph theory › graph theory
graph transformation |
0.0 | 1 | 1990 | An Algorithm for Optimal Lambda Calculus Reduction · POPL 1990 |
Logic in computer science
lambda calculus |
0.0 | 1 | 1990 | An Algorithm for Optimal Lambda Calculus Reduction · POPL 1990 |
Logic in computer science › lambda calculus
optimal reduction |
0.0 | 1 | 1990 | An Algorithm for Optimal Lambda Calculus Reduction · POPL 1990 |
Requirements engineering and software design › software architecture › architectural design
module interface design |
0.0 | 1 | 1997 | Open Implementation Design Guidelines · ICSE 1997 |
Interaction techniques and input
interactive manipulation |
0.0 | 1 | 1995 | A Focus+Context Technique Based on Hyperbolic Geometry for Visualizing Large Hierarchies · CHI 1995 |
Software maintenance and evolution
software documentation |
0.0 | 1 | 1992 | Issues in the Design and Documentation of Class Libraries · OOPSLA 1992 |
Knowledge, reasoning and agents › Knowledge representation and reasoning › epistemic reasoning
metaknowledge |
0.0 | 1 | 1983 | Meta-Knowledge and Meta-Reasoning · IJCAI 1983 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
metareasoning |
0.0 | 1 | 1983 | Meta-Knowledge and Meta-Reasoning · IJCAI 1983 |
Knowledge, reasoning and agents › Knowledge representation and reasoning › semantic representation
logical form |
0.0 | 1 | 1982 | Processing English with a Generalized Phrase Structure Grammar · ACL 1982 |
Natural language and speech › Information extraction and text analysis
semantic parsing |
0.0 | 1 | 1982 | Processing English with a Generalized Phrase Structure Grammar · ACL 1982 |
Parallel and multicore computing
parallel programming models |
0.0 | 1 | 1990 | An Algorithm for Optimal Lambda Calculus Reduction · POPL 1990 |
Methods — techniques the papers use, named apart from their topics
property-based programming · 0.1active properties · 0.1windowing protocol · 0.0proxy architecture · 0.0laboratory experiment · 0.0executable code properties · 0.0hyperbolic space layout · 0.0fisheye projection · 0.0lévy optimality · 0.0graph rewriting · 0.0montague semantics · 0.0generalized phrase structure grammar · 0.0meta-reasoning · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2000 | A programming model for active documentsabstractTraditionally, designers organize software system as active end-points (e.g.applications) linked by passive infrastructures (e.g.networks).Increasingly, however, networks and infrastructures are becoming active components that contribute directly to application behavior.Amongst the various problems that this presents is the question of how such active infrastructures should be programmed.We have been developing an active document management system called Placeless Documents.Its programming model is organized in terms of properties that actively contribute to the functionality and behavior of the documents to which they are attached.This paper discusses active properties and their use as a programming model for active infrastructures.We have found that active properties enable the creation of persistent, autonomous active entities in document systems, independent of specific repositories and applications, but present challenges for managing problems of composition. Paul Dourish, W. Keith Edwards, Jon Howell, Anthony LaMarca, John Lamping, Karin Petersen, Michael Salisbury, Douglas B. Terry, James D. Thornton |
UIST | 5 |
| 2000 | Extending document management systems with user-specific active propertiesabstractDocument properties are a compelling infrastructure on which to develop document management applications. A property-based approach avoids many of the problems of traditional heierarchical storage mechanisms, reflects document organizations meaningful to user tasks, provides a means to integrate the perspectives of multiple individuals and groups, and does this all within a uniform interaction framework. Document properties can reflect not only categorizations of documents and document use, but also expressions of desired system activity, such as sharing criteria, replication management, and versioning. Augmenting property-based document management systems with active properties that carry executable code enables the provision of document-based services on a property infrastructure. The combination of document properties as a uniform mechanism for document management, and active properties as a way of delivering document services, represents a new paradigm for document management infrastructures. The Placeless Documents system is an experimental prototype developed to explore this new paradigm. It is based on the seamless integration of user-specific, active properties. We present the fundamental design approach, explore the challenges and opportunities it presents, and show our architectures deals with them. Paul Dourish, W. Keith Edwards, Anthony LaMarca, John Lamping, Karin Petersen, Michael Salisbury, Douglas B. Terry, James D. Thornton |
ACM Trans. Inf. Syst. | 4 |
| 1999 | Taking the work out of workflow: Mechanisms for document-centered collaboration
Anthony LaMarca, W. Keith Edwards, Paul Dourish, John Lamping, Ian E. Smith, James D. Thornton |
ECSCW | 4 |
| 1999 | Building bridges: customisation and mutual intelligibility in shared category managementabstractResearch into collaborative document use often concentrates on how people share document content. However, studies of real-world document practices reveal that the structures by which document corpora are organised may also, themselves, be important sites of collaborative activity. Unfortunately, this poses a problem. When category structures are used to understand a set of documents, the manipulation of those structures can interfere with shared understanding and intelligibility of the document space.We show how this problem arises in real-world settings, using a case arising from some recent field work. We outline a solution to the customisation/intelligibility problem, and show how it has been implemented in a system for personal and workgroup document management. Paul Dourish, John Lamping, Tom Rodden |
GROUP | 2 |
| 1997 | Aspect-Oriented Programming
Gregor Kiczales, John Lamping, Anurag Mendhekar, Chris Maeda, Cristina V. Lopes, Jean-Marc Loingtier, John Irwin |
ECOOP | 2 |
| 1997 | Open Implementation Design GuidelinesabstractDesigning reusable software modules can be extremely difficult.The design must be balanced between being general enough to address the needs of a wide range of clients and being focused enough to truly satisfy the requirements of each specific client One area where it can be particularly difficult to strike this balance is in the implementation strategy of the module.The problem is that generalpurpose implementation strategies, tuned for a wide range of clients, aren't necessarily optimal for each specific client-this is especially an issue for modules that are intended to be reusable and yet provide high-performance.An examination of existing software systems shows that an increasingly important technique for handling this problem is to design the module's interface in such a way that the client can assist or participate in the selection of the module's implementation strategy.We call this approach open implementation.When designing the interface to a module that allows its clients some control over its implementation strategy, it is important to retain, as much as possible, the advantages of traditional closed implementation modules.This paper explores issues in the design of interfaces to open implementation modules.We identify key design choices, and present guidelines for deciding which choices are likely to work best in particular situations. Gregor Kiczales, John Lamping, Cristina V. Lopes, Chris Maeda, Anurag Mendhekar, Gail C. Murphy |
ICSE | 2 |
| 1995 | A Focus+Context Technique Based on Hyperbolic Geometry for Visualizing Large HierarchiesabstractWe present a new focus+context (fisheye) technique for visualizing and manipulating large hierarchies. Our technique assigns more display space to a portion of the hierarchy while still embedding it in the context of the entire hierarchy. The essence of this scheme is to lay out the hierarchy in a uniform way on a hyperbolic plane and map this plane onto a circular display region. This supports a smooth blending between focus and context, as well as continuous redirection of the focus. We have developed effective procedures for manipulating the focus using pointer clicks as well as interactive dragging, and for smoothly animating transitions across such manipulation. A laboratory experiment comparing the hyperbolic browser with a conventional hierarchy browser was conducted. John Lamping, Ramana Rao, Peter Pirolli |
CHI | 1 |
| 1995 | The Semantics of Resource Sharing in Lexical-Functional Grammar
Andrew Kehler, Mary Dalrymple, John Lamping, Vijay A. Saraswat |
EACL | 3 |
| 1995 | High-Latency, Low-Bandwidth Windowing in the Jupiter Collaboration SystemabstractArticle High-latency, low-bandwidth windowing in the Jupiter collaboration system Share on Authors: David A. Nichols Xerox PARC, 3333 Coyote Hill Rd., Palo Alto, CA Xerox PARC, 3333 Coyote Hill Rd., Palo Alto, CAView Profile , Pavel Curtis Xerox PARC, 3333 Coyote Hill Rd., Palo Alto, CA Xerox PARC, 3333 Coyote Hill Rd., Palo Alto, CAView Profile , Michael Dixon Xerox PARC, 3333 Coyote Hill Rd., Palo Alto, CA Xerox PARC, 3333 Coyote Hill Rd., Palo Alto, CAView Profile , John Lamping Xerox PARC, 3333 Coyote Hill Rd., Palo Alto, CA Xerox PARC, 3333 Coyote Hill Rd., Palo Alto, CAView Profile Authors Info & Claims UIST '95: Proceedings of the 8th annual ACM symposium on User interface and software technologyDecember 1995 Pages 111–120https://doi.org/10.1145/215585.215706Online:01 December 1995Publication History 99citation2,591DownloadsMetricsTotal Citations99Total Downloads2,591Last 12 Months44Last 6 weeks3 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 AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access David A. Nichols, Pavel Curtis, Michael Dixon, John Lamping |
ACM Symposium on User Interface Software and Technology | 4 |
| 1994 | Methods as Assertions
John Lamping, Martín Abadi |
ECOOP | 1 |
| 1994 | Laying Out and Visualizing Large Trees Using a Hyperbolic SpaceabstractWe present a new focus+context (fisheye) scheme for visualizing and manipulating large hierarchies. The essence of our approach is to lay out the hierarchy uniformly on the hyperbolic plane and map this plane onto a circular display region. The projection onto the disk provides a natural mechanism for assigning more space to a portion of the hierarchy while still embedding it in a much larger context. Change of focus is accomplished by translating the structure on the hyperbolic plane, which allows a smooth transition without compromising the presentation of the context. John Lamping, Ramana Rao |
ACM Symposium on User Interface Software and Technology | 1 |
| 1993 | LFG Semantics via Constraints
Mary Dalrymple, John Lamping, Vijay A. Saraswat |
EACL | 2 |
| 1993 | Typing the Specialization Interfaceabstractall of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. John Lamping |
OOPSLA | 1 |
| 1992 | Issues in the Design and Documentation of Class LibrariesabstractThe design and specification of an extensible class library presents a difficult challenge:because extensibility comes from allowing the user to override parts of the implementation, more of the internal structure must be exposed to the user than in a typical procedure library.This raises issues in both how the library is designed and how its specification is written.Specification of the CLOS Metaobject Protocol required a combination of new and existing techniques to address these issues.We present those techniques, and discuss their relation to the underlying issues."This CLOS-like syntax indicates that draw is a one argument generic function; that the argument is called button; and that this method is specialized to the class text-button. Gregor Kiczales, John Lamping |
OOPSLA | 2 |
| 1991 | Compose-Reduce ParsingabstractTwo new parsing algorithms for context-free phrase structure grammars are presented which perform a bounded amount of processing per word per analysis path, independently of sentence length. They are thus capable of parsing in real-time in a parallel implementation which forks processors in response to non-deterministic choice points. Henry S. Thompson, Michael Dixon, John Lamping |
ACL | 3 |
| 1990 | An Algorithm for Optimal Lambda Calculus ReductionabstractWe present an algorithm for lambda expression reduction that avoids any copying that could later cause duplication of work. It is optimal in the sense defined by Lévy. The basis of the algorithm is a graphical representation of the kinds of commonality that can arise from substitutions; the idea can be adapted to represent other kinds of expressions besides lambda expressions. The algorithm is also well suited to parallel implementations, consisting of a fixed set of local graph rewrite rules. John Lamping |
POPL | 1 |
| 1983 | Meta-Knowledge and Meta-Reasoning
Robert E. Filman, John Lamping, Fanya S. Montalvo |
IJCAI | 2 |
| 1982 | Processing English with a Generalized Phrase Structure GrammarabstractThis paper describes a natural language processing system implemented at Hewlett-Packard's Computer Research Center. The system's main components are: a Generalized Phrase Structure Grammar (GPSG); a top-down parser; a logic transducer that outputs a first-order logical representation; and a "disambiguator" that uses sortal information to convert "normal-form" first-order logical expressions into the query language for HIRE, a relational database hosted in the SPHERE system. We argue that theoretical developments in GPSG syntax and in Montague semantics have specific advantages to bring to this domain of computational linguistics. The syntax and semantics of the system are totally domain-independent, and thus, in principle, highly portable. We discuss the prospects for extending domain-independence to the lexical semantics as well, and thus to the logical semantic representations. Jean Mark Gawron, Jonathan King, John Lamping, Egon E. Loebner, E. Anne Paulson, Geoffrey K. Pullum, Ivan A. Sag, Thomas Wasow |
ACL | 3 |