John L. Pfaltz - researchr alias

researchr

You are not signed in
Sign in
Sign up

2008

Establishing Logical Rules from Empirical DataJohn L. Pfaltz. ijait, 17(5):985-1001, 2008. [doi]

2007

Representing Numeric Values in Concept LatticesJohn L. Pfaltz. cla 2008: [doi]

What Constitutes a Scientific Database?John L. Pfaltz. ssdbm 2007: 2 [doi]

Establishing Logical Rules from Empirical DataJohn L. Pfaltz. ictai 2007: 202-209 [doi]

2006

Using Concept Lattices to Uncover Causal Dependencies in SoftwareJohn L. Pfaltz. icfca 2006: 233-247 [doi]

Closure and CausalityJohn L. Pfaltz. dagstuhl 2007: [doi]

2005

Closure spaces that are not uniquely generatedRobert E. Jamison, John L. Pfaltz. DAM, 147(1):69-79, 2005. [doi]

A Category of Discrete Closure SpacesJohn L. Pfaltz. dagstuhl 2005: [doi]

2004

Jordan Surfaces in Discrete Antimatroid TopologiesRalph Kopperman, John L. Pfaltz. iwcia 2004: 334-350 [doi]

Applications of Graph Transformations with Industrial Relevance, Second International Workshop, AGTIVE 2003, Charlottesville, VA, USA, September 27 - October 1, 2003, Revised Selected and Invited PapersJohn L. Pfaltz, Manfred Nagl, Boris Böhlen, editors, Volume 3062 of Lecture Notes in Computer Science, Springer, 2004.

2002

Performance of KDB-Trees with Query-Based SplittingYves Lépouchard, John L. Pfaltz, Ratko Orlandic. itcc 2002: 218-223 [doi]

Incremental Transformation of Lattices: A Key to Effective Knowledge DiscoveryJohn L. Pfaltz. gg 2002: 351-362 [doi]

Closed Set Mining of Biological DataJohn L. Pfaltz, Christopher M. Taylor. kdd 2002: 43-48 [doi]

2001

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

Preventing Mismatch of Homogeneous Components in the Design of Software ArchitectureRatko Orlandic, John L. Pfaltz. ijseke, 11(6):731-759, 2001.

Transformations of Concept Graphs: An Approach to Empirical InductionJohn L. Pfaltz. ENTCS, 50(3), 2001. [doi]

Closure systems and their structureJohn L. Pfaltz, Robert E. Jamison. isci, 139(3-4):275-286, 2001.

2000

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

Data Providers - A Language ExperimentJohn L. Pfaltz. dnis 2000: 33-44 [doi]

1999

A Scalable DBMS for Large Scientific SimulationsJohn L. Pfaltz, Ratko Orlandic. dante 1999: 271 [doi]

1998

Neighborhood Expansion GrammarsJohn L. Pfaltz. tagt 2000: 30-44

Scalable, Parallel, Scientific DatabasesJohn L. Pfaltz, Russell F. Haddleton, James C. French. ssdbm 1998: 4-11 [doi]

1997

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

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

1996

Closure latticesJohn L. Pfaltz. DM, 154(1-3):217-236, 1996. [doi]

1995

Partition Coefficients of Acyclic GraphsJohn L. Pfaltz. criwg 1995: 318-322

1993

Scientific Database Management with ADAMSJohn L. Pfaltz, James C. French. debu, 16(1):14-18, 1993. [doi]

1992

A Functional Approach to Scientific Database ImplementationJohn L. Pfaltz. ssdbm 1992: 132-143 [doi]

1990

A Summary of the NSF Scientific Database WorkshopJames C. French, Anita K. Jones, John L. Pfaltz. debu, 13(3):55-61, 1990. [doi]

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

Implementing Subscripted Identifiers in Scientific DatabasesJohn L. Pfaltz, James C. French. ssdbm 1990: 80-91 [doi]

1989

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

1988

Compact 0-Complete TreesRatko Orlandic, John L. Pfaltz. VLDB 1988: 372-381 [doi]

1983

Convex Clusters in a Discrete m-Dimensional SpaceJohn L. Pfaltz. siamcomp, 12(4):734-750, 1983.

1982

Transformation of structures by convex homomorphismsJohn L. Pfaltz. gg 1983: 297-313

1980

Partial-Match Retrieval Using Indexed Descriptor FilesJohn L. Pfaltz, William J. Berman, Edgar M. Cagley. CACM, 23(9):522-528, 1980. [doi]

1978

A Graph Grammar that Describes the Set of Two-Dimensional Surface NetworksJohn L. Pfaltz. gg 1979: 379-388

1975

Representing Graphs by Knuth TreesJohn L. Pfaltz. JACM, 22(3):361-366, 1975. [doi]

1972

Graph StructuresJohn L. Pfaltz. JACM, 19(3):411-422, 1972. [doi]

1969

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

1968

Distance functions on digital picturesAzriel Rosenfeld, John L. Pfaltz. PR, 1(1):33-61, 1968. [doi]

1967

Computer representation of planar regions by their skeletonsJohn L. Pfaltz, Azriel Rosenfeld. CACM, 10(2):119-122, 1967. [doi]

1966

Sequential Operations in Digital Picture ProcessingAzriel Rosenfeld, John L. Pfaltz. JACM, 13(4):471-494, 1966. [doi]

1962

Algorithm 98: Evaluation of definite complex line integralsJohn L. Pfaltz. CACM, 5(6):345, 1962. [doi]