Algorithm 98: Evaluation of definite complex line integrals. - John L. Pfaltz (Commun. ACM, 1962)

Sequential Operations in Digital Picture Processing. - Azriel Rosenfeld; John L. Pfaltz (J. ACM, 1966)

Computer representation of planar regions by their skeletons. - John L. Pfaltz; Azriel Rosenfeld (Commun. ACM, 1967)

Distance functions on digital pictures. - Azriel Rosenfeld; John L. Pfaltz (Pattern Recognit., 1968)

Web Grammars. - John L. Pfaltz; Azriel Rosenfeld (IJCAI, 1969)

Web grammars and picture description. - John L. Pfaltz (Comput. Graph. Image Process., 1972)

Graph Structures. - John L. Pfaltz (J. ACM, 1972)

Representing Graphs by Knuth Trees. - John L. Pfaltz (J. ACM, 1975)

A Graph Grammar that Describes the Set of Two-Dimensional Surface Networks. - John L. Pfaltz (Graph-Grammars and Their Application to Computer Science and Biology, 1978)

Partial-Match Retrieval Using Indexed Descriptor Files. - John L. Pfaltz; William J. Berman; Edgar M. Cagley (Commun. ACM, 1980)

Transformation of structures by convex homomorphisms. - John L. Pfaltz (Graph-Grammars and Their Application to Computer Science, 1982)

Convex Clusters in a Discrete m-Dimensional Space. - John L. Pfaltz (SIAM J. Comput., 1983)

Reliability mechanisms for ADAMS. - Sang H. Son 001; John L. Pfaltz (C³P, 1988)

ADAMS interface language. - John L. Pfaltz; Sang H. Son 001; James C. French (C³P, 1988)

Compact 0-Complete Trees. - Ratko Orlandic; John L. Pfaltz (VLDB, 1988)

Analysis of Compact 0-Complete Trees: A New Access Method to Large Databases. - Ratko Orlandic; John L. Pfaltz (FCT, 1989)

Implementing Subscripted Identifiers in Scientific Databases. - John L. Pfaltz; James C. French (SSDBM, 1990)

A Summary of the NSF Scientific Database Workshop. - James C. French; Anita K. Jones; John L. Pfaltz (IEEE Data Eng. Bull., 1990)

Summary of the Final Report of the NSF Workshop on Scientific Database Management. - James C. French; Anita K. Jones; John L. Pfaltz (SIGMOD Rec., 1990)

A Functional Approach to Scientific Database Implementation. - John L. Pfaltz (SSDBM, 1992)

Scientific Database Management with ADAMS. - John L. Pfaltz; James C. French (IEEE Data Eng. Bull., 1993)

Partition Coefficients of Acyclic Graphs. - John L. Pfaltz (WG, 1995)

Closure lattices. - John L. Pfaltz (Discret. Math., 1996)

Automating the Construction of Authority Files in Digital Libraries: A Case Study. - James C. French; Allison L. Powell; Eric Schulman; John L. Pfaltz (ECDL, 1997)

Client/Server Architecture in the ADAMS Parallel Object-Oriented Database System. - Russell F. Haddleton; John L. Pfaltz (ISCOPE, 1997)

Scalable, Parallel, Scientific Databases. - John L. Pfaltz; Russell F. Haddleton; James C. French (SSDBM, 1998)

Neighborhood Expansion Grammars. - John L. Pfaltz (TAGT, 1998)

A Scalable DBMS for Large Scientific Simulations. - John L. Pfaltz; Ratko Orlandic (DANTE, 1999)

Data Providers - A Language Experiment. - John L. Pfaltz (DNIS, 2000)

Exploring the Behavior of the Spring Ecosystem Model Using An Object-Oriented Database System. - David R. Mikesell; John L. Pfaltz (SSDBM, 2001)

Transformations of Concept Graphs: An Approach to Empirical Induction. - John L. Pfaltz (GT-VMT@ICALP, 2001)

Preventing Mismatch of Homogeneous Components in the Design of Software Architecture. - Ratko Orlandic; John L. Pfaltz (Int. J. Softw. Eng. Knowl. Eng., 2001)

Closure systems and their structure. - John L. Pfaltz; Robert E. Jamison (Inf. Sci., 2001)

Incremental Transformation of Lattices: A Key to Effective Knowledge Discovery. - John L. Pfaltz (ICGT, 2002)

Performance of KDB-Trees with Query-Based Splitting. - Yves Lépouchard; John L. Pfaltz; Ratko Orlandic (ITCC, 2002)

Closed Set Mining of Biological Data. - John L. Pfaltz; Christopher M. Taylor (BIOKDD, 2002)

Jordan Surfaces in Discrete Antimatroid Topologies. - Ralph Kopperman; John L. Pfaltz (IWCIA, 2004)

A Category of Discrete Closure Spaces. - John L. Pfaltz (Spatial Representation, 2005)

Closure spaces that are not uniquely generated. - Robert E. Jamison; John L. Pfaltz (Discret. Appl. Math., 2005)

Closure and Causality. - John L. Pfaltz (Computational Structures for Modelling Space, Time and Causality, 2006)

Using Concept Lattices to Uncover Causal Dependencies in Software. - John L. Pfaltz (ICFCA, 2006)

Representing Numeric Values in Concept Lattices. - John L. Pfaltz (CLA, 2007)

What Constitutes a Scientific Database? - John L. Pfaltz (SSDBM, 2007)

Establishing Logical Rules from Empirical Data. - John L. Pfaltz (Int. J. Artif. Intell. Tools, 2008)

Mathematical Continuity in Dynamic Social Networks. - John L. Pfaltz (SocInfo, 2011)

Finding the Mule in the Network. - John L. Pfaltz (ASONAM, 2012)

Entropy in Social Networks - John L. Pfaltz (CoRR, 2012)

Chordless cycles in networks. - John L. Pfaltz (ICDE Workshops, 2013)

The Irreducible Spine(s) of Undirected Networks. - John L. Pfaltz (WISE (2), 2013)

A mathematical model of dynamic social networks. - John L. Pfaltz (Soc. Netw. Anal. Min., 2013)

A Functional Database Representation of Large Sets of Objects. - Ratko Orlandic; John L. Pfaltz; Christopher M. Taylor (ADC, 2014)

Using Closed Sets to Model Cognitive Behavior. - John L. Pfaltz (ACALCI, 2016)

Computational Processes that Appear to Model Human Memory. - John L. Pfaltz (AlCoB, 2017)

A Role for Chordless Cycles in the Representation and Retrieval of Information. - John L. Pfaltz (EDBT/ICDT Workshops, 2017)

An Algorithmic Approach to the Representation of Biological Information and Long-term Memory. - John L. Pfaltz (BCB, 2018)

A Category of "Undirected Graphs" - A Tribute to Hartmut Ehrig. - John L. Pfaltz (Graph Transformation, Specifications, and Nets, 2018)

Humans Have a Distributed, Molecular Long-Term Memory. - John L. Pfaltz (BI, 2018)

The Interior of a Network. - John L. Pfaltz (ASONAM, 2020)

A Set-Theoretic Approach to Modeling Network Structure. - John L. Pfaltz (Algorithms, 2021)