John L. Pfaltz

John L. Pfaltz: Finding the Mule in the Network. ASONAM 2012: 668-673

John L. Pfaltz: Entropy in Social Networks. CoRR abs/1212.2917 (2012)

John L. Pfaltz: Mathematical Continuity in Dynamic Social Networks. SocInfo 2011: 36-50

John L. Pfaltz: Establishing Logical Rules from Empirical Data. International Journal on Artificial Intelligence Tools 17(5): 985-1001 (2008)

John L. Pfaltz: Representing Numeric Values in Concept Lattices. CLA 2007

John L. Pfaltz: Establishing Logical Rules from Empirical Data. ICTAI (2) 2007: 202-209

John L. Pfaltz: What Constitutes a Scientific Database? SSDBM 2007: 2

John L. Pfaltz: Closure and Causality. Computational Structures for Modelling Space, Time and Causality 2006

John L. Pfaltz: Using Concept Lattices to Uncover Causal Dependencies in Software. ICFCA 2006: 233-247

Robert E. Jamison, John L. Pfaltz: Closure spaces that are not uniquely generated. Discrete Applied Mathematics 147(1): 69-79 (2005)

John L. Pfaltz: A Category of Discrete Closure Spaces. Spatial Representation 2005

Ralph Kopperman, John L. Pfaltz: Jordan Surfaces in Discrete Antimatroid Topologies. IWCIA 2004: 334-350

John L. Pfaltz, Manfred Nagl, Boris Böhlen (Eds.): Applications of Graph Transformations with Industrial Relevance, Second International Workshop, AGTIVE 2003, Charlottesville, VA, USA, September 27 - October 1, 2003, Revised Selected and Invited Papers. Lecture Notes in Computer Science 3062, Springer 2004, isbn 3-540-22120-4

John L. Pfaltz: Incremental Transformation of Lattices: A Key to Effective Knowledge Discovery. ICGT 2002: 351-362

Yves Lépouchard, John L. Pfaltz, Ratko Orlandic: Performance of KDB-Trees with Query-Based Splitting. ITCC 2002: 218-223

John L. Pfaltz, Christopher M. Taylor: Closed Set Mining of Biological Data. BIOKDD 2002: 43-48

John L. Pfaltz: Transformations of Concept Graphs: An Approach to Empirical Induction. Electr. Notes Theor. Comput. Sci. 50(3): 318-324 (2001)

Ratko Orlandic, John L. Pfaltz: Preventing Mismatch of Homogeneous Components in the Design of Software Architecture. International Journal of Software Engineering and Knowledge Engineering 11(6): 731-759 (2001)

John L. Pfaltz, Robert E. Jamison: Closure systems and their structure. Inf. Sci. 139(3-4): 275-286 (2001)

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

Robert E. Jamison, John L. Pfaltz: Closure Systems and their Structure. RelMiCS 2000: 121-132

John L. Pfaltz: Data Providers - A Language Experiment. DNIS 2000: 33-44

John L. Pfaltz, Ratko Orlandic: A Scalable DBMS for Large Scientific Simulations. DANTE 1999: 271-

John L. Pfaltz, Russell F. Haddleton, James C. French: Scalable, Parallel, Scientific Databases. SSDBM 1998: 4-11

John L. Pfaltz: Neighborhood Expansion Grammars. TAGT 1998: 30-44

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

Russell F. Haddleton, John L. Pfaltz: Client/Server Architecture in the ADAMS Parallel Object-Oriented Database System. ISCOPE 1997: 257-266

John L. Pfaltz: Closure lattices. Discrete Mathematics 154(1-3): 217-236 (1996)

John L. Pfaltz: Partition Coefficients of Acyclic Graphs. WG 1995: 318-322

John L. Pfaltz, James C. French: Scientific Database Management with ADAMS. IEEE Data Eng. Bull. 16(1): 14-18 (1993)

John L. Pfaltz: A Functional Approach to Scientific Database Implementation. SSDBM 1992: 132-143

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

James C. French, Anita K. Jones, John L. Pfaltz: Summary of the Final Report of the NSF Workshop on Scientific Database Management. SIGMOD Record 19(4): 32-40 (1990)

John L. Pfaltz, James C. French: Implementing Subscripted Identifiers in Scientific Databases. SSDBM 1990: 80-91

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

Ratko Orlandic, John L. Pfaltz: Compact 0-Complete Trees. VLDB 1988: 372-381

John L. Pfaltz: Convex Clusters in a Discrete m-Dimensional Space. SIAM J. Comput. 12(4): 734-750 (1983)

John L. Pfaltz: Transformation of structures by convex homomorphisms. Graph-Grammars and Their Application to Computer Science 1982: 297-313

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

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

John L. Pfaltz: Representing Graphs by Knuth Trees. J. ACM 22(3): 361-366 (1975)

John L. Pfaltz: Graph Structures. J. ACM 19(3): 411-422 (1972)

John L. Pfaltz, Azriel Rosenfeld: Web Grammars. IJCAI 1969: 609-620

Azriel Rosenfeld, John L. Pfaltz: Distance functions on digital pictures. Pattern Recognition 1(1): 33-61 (1968)

John L. Pfaltz, Azriel Rosenfeld: Computer representation of planar regions by their skeletons. Commun. ACM 10(2): 119-122 (1967)

Azriel Rosenfeld, John L. Pfaltz: Sequential Operations in Digital Picture Processing. J. ACM 13(4): 471-494 (1966)

John L. Pfaltz: Algorithm 98: Evaluation of definite complex line integrals. Commun. ACM 5(6): 345 (1962)