BibTeX records: Paul Pritchard

download as .bib file

@article{DBLP:journals/kais/ShenSCP00,
  author       = {Li Shen and
                  Hong Shen and
                  Ling Cheng and
                  Paul Pritchard},
  title        = {Fast Association Discovery in Derivative Transaction Collections},
  journal      = {Knowl. Inf. Syst.},
  volume       = {2},
  number       = {2},
  pages        = {147--160},
  year         = {2000},
  url          = {https://doi.org/10.1007/s101150050008},
  doi          = {10.1007/S101150050008},
  timestamp    = {Mon, 13 Nov 2017 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/kais/ShenSCP00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Pritchard99,
  author       = {Paul Pritchard},
  title        = {A Fast Bit-Parallel Algorithm for Computing the Subset Partial Order},
  journal      = {Algorithmica},
  volume       = {24},
  number       = {1},
  pages        = {76--86},
  year         = {1999},
  url          = {https://doi.org/10.1007/PL00009272},
  doi          = {10.1007/PL00009272},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Pritchard99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Pritchard99,
  author       = {Paul Pritchard},
  title        = {On Computing the Subset Graph of a Collection of Sets},
  journal      = {J. Algorithms},
  volume       = {33},
  number       = {2},
  pages        = {187--203},
  year         = {1999},
  url          = {https://doi.org/10.1006/jagm.1999.1032},
  doi          = {10.1006/JAGM.1999.1032},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/Pritchard99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pdpta/LiSP99,
  author       = {Jiuyong Li and
                  Hong Shen and
                  Paul Pritchard},
  editor       = {Hamid R. Arabnia},
  title        = {Mining Significant Association Rules (Short Version)},
  booktitle    = {Proceedings of the International Conference on Parallel and Distributed
                  Processing Techniques and Applications, {PDPTA} 1999, June 28 - Junlly
                  1, 1999, Las Vegas, Nevada, {USA}},
  pages        = {1458--1461},
  publisher    = {{CSREA} Press},
  year         = {1999},
  timestamp    = {Tue, 20 Apr 2004 14:47:51 +0200},
  biburl       = {https://dblp.org/rec/conf/pdpta/LiSP99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pdpta/LiSP99a,
  author       = {Jiuyong Li and
                  Hong Shen and
                  Paul Pritchard},
  editor       = {Hamid R. Arabnia},
  title        = {Knowledge Network Based Association Discovery (Preliminary Version)},
  booktitle    = {Proceedings of the International Conference on Parallel and Distributed
                  Processing Techniques and Applications, {PDPTA} 1999, June 28 - Junlly
                  1, 1999, Las Vegas, Nevada, {USA}},
  pages        = {1558--1563},
  publisher    = {{CSREA} Press},
  year         = {1999},
  timestamp    = {Tue, 20 Apr 2004 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/pdpta/LiSP99a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Pritchard97,
  author       = {Paul Pritchard},
  title        = {An Old Sub-Quadratic Algorithm for Finding Extremal Sets},
  journal      = {Inf. Process. Lett.},
  volume       = {62},
  number       = {6},
  pages        = {329--334},
  year         = {1997},
  url          = {https://doi.org/10.1016/S0020-0190(97)00084-7},
  doi          = {10.1016/S0020-0190(97)00084-7},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Pritchard97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Pritchard95,
  author       = {Paul Pritchard},
  title        = {A Simple Sub-Quadratic Algorithm for Computing the Subset Partial
                  Order},
  journal      = {Inf. Process. Lett.},
  volume       = {56},
  number       = {6},
  pages        = {337--341},
  year         = {1995},
  url          = {https://doi.org/10.1016/0020-0190(95)00165-4},
  doi          = {10.1016/0020-0190(95)00165-4},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Pritchard95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ants/Pritchard94,
  author       = {Paul Pritchard},
  editor       = {Leonard M. Adleman and
                  Ming{-}Deh A. Huang},
  title        = {Improved incremental prime number sieves},
  booktitle    = {Algorithmic Number Theory, First International Symposium, ANTS-I,
                  Ithaca, NY, USA, May 6-9, 1994, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {877},
  pages        = {280--288},
  publisher    = {Springer},
  year         = {1994},
  url          = {https://doi.org/10.1007/3-540-58691-1\_67},
  doi          = {10.1007/3-540-58691-1\_67},
  timestamp    = {Fri, 17 Jul 2020 16:12:48 +0200},
  biburl       = {https://dblp.org/rec/conf/ants/Pritchard94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/Pritchard91,
  author       = {Paul Pritchard},
  title        = {Opportunistic Algorithms for Eliminating Supersets},
  journal      = {Acta Informatica},
  volume       = {28},
  number       = {8},
  pages        = {733--754},
  year         = {1991},
  url          = {https://doi.org/10.1007/BF01261654},
  doi          = {10.1007/BF01261654},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/Pritchard91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jar/Pritchard91,
  author       = {Paul Pritchard},
  title        = {Algorithms for Finding Matrix Models of Propositional Calculi},
  journal      = {J. Autom. Reason.},
  volume       = {7},
  number       = {4},
  pages        = {475--487},
  year         = {1991},
  url          = {https://doi.org/10.1007/BF01880325},
  doi          = {10.1007/BF01880325},
  timestamp    = {Wed, 02 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jar/Pritchard91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cade/PritchardS90,
  author       = {Paul Pritchard and
                  John K. Slaney},
  editor       = {Mark E. Stickel},
  title        = {Tutorial on Computing Models of Propositional Logics},
  booktitle    = {10th International Conference on Automated Deduction, Kaiserslautern,
                  FRG, July 24-27, 1990, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {449},
  pages        = {685},
  publisher    = {Springer},
  year         = {1990},
  url          = {https://doi.org/10.1007/3-540-52885-7\_148},
  doi          = {10.1007/3-540-52885-7\_148},
  timestamp    = {Tue, 14 May 2019 10:00:39 +0200},
  biburl       = {https://dblp.org/rec/conf/cade/PritchardS90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/stp/Pritchard89,
  author       = {Paul Pritchard},
  title        = {A Display-oriented Syntax Notation},
  journal      = {Struct. Program.},
  volume       = {10},
  number       = {3},
  pages        = {165--168},
  year         = {1989},
  timestamp    = {Tue, 26 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/stp/Pritchard89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scp/Pritchard87,
  author       = {Paul Pritchard},
  title        = {Linear Prime-Number Sieves: {A} Family Tree},
  journal      = {Sci. Comput. Program.},
  volume       = {9},
  number       = {1},
  pages        = {17--35},
  year         = {1987},
  url          = {https://doi.org/10.1016/0167-6423(87)90024-4},
  doi          = {10.1016/0167-6423(87)90024-4},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/scp/Pritchard87.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cacm/Pritchard84,
  author       = {Paul Pritchard},
  title        = {Some Negative Results Concerning Prime Number Generators},
  journal      = {Commun. {ACM}},
  volume       = {27},
  number       = {1},
  pages        = {53--57},
  year         = {1984},
  url          = {https://doi.org/10.1145/69605.357970},
  doi          = {10.1145/69605.357970},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cacm/Pritchard84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Pritchard83,
  author       = {Paul Pritchard},
  title        = {Fast Compact Prime Number Sieves (among Others)},
  journal      = {J. Algorithms},
  volume       = {4},
  number       = {4},
  pages        = {332--344},
  year         = {1983},
  url          = {https://doi.org/10.1016/0196-6774(83)90014-7},
  doi          = {10.1016/0196-6774(83)90014-7},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/Pritchard83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scp/Pritchard83,
  author       = {Paul Pritchard},
  title        = {A Case Study of Number-Theoretic Computation: Searching for Primes
                  in Arithmetical Progression},
  journal      = {Sci. Comput. Program.},
  volume       = {3},
  number       = {1},
  pages        = {37--63},
  year         = {1983},
  url          = {https://doi.org/10.1016/0167-6423(83)90003-5},
  doi          = {10.1016/0167-6423(83)90003-5},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/scp/Pritchard83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/Pritchard82,
  author       = {Paul Pritchard},
  title        = {Explaining the Wheel Sieve},
  journal      = {Acta Informatica},
  volume       = {17},
  pages        = {477--485},
  year         = {1982},
  url          = {https://doi.org/10.1007/BF00264164},
  doi          = {10.1007/BF00264164},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/Pritchard82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/Pritchard81,
  author       = {Paul Pritchard},
  title        = {Another Look at the "Longest Ascending Subsequence" Problem},
  journal      = {Acta Informatica},
  volume       = {16},
  pages        = {87--91},
  year         = {1981},
  url          = {https://doi.org/10.1007/BF00289592},
  doi          = {10.1007/BF00289592},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/Pritchard81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cacm/Pritchard81,
  author       = {Paul Pritchard},
  title        = {A Sublinear Additive Sieve for Finding Prime Numbers},
  journal      = {Commun. {ACM}},
  volume       = {24},
  number       = {1},
  pages        = {18--23},
  year         = {1981},
  url          = {https://doi.org/10.1145/358527.358540},
  doi          = {10.1145/358527.358540},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cacm/Pritchard81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/computing/Pritchard79,
  author       = {Paul Pritchard},
  title        = {Comments on a paper by neuhold and studer},
  journal      = {Computing},
  volume       = {22},
  number       = {3},
  pages        = {279--282},
  year         = {1979},
  url          = {https://doi.org/10.1007/BF02243568},
  doi          = {10.1007/BF02243568},
  timestamp    = {Thu, 06 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/computing/Pritchard79.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ldpm/Pritchard79,
  author       = {Paul Pritchard},
  editor       = {Jeffrey M. Tobias},
  title        = {On the Prime Example of Programming},
  booktitle    = {Language Design and Programming Methodology, Proceedings of a Symposium
                  Held in Sydney, Australia, 10-11 September, 1979},
  series       = {Lecture Notes in Computer Science},
  volume       = {79},
  pages        = {85--94},
  publisher    = {Springer},
  year         = {1979},
  url          = {https://doi.org/10.1007/3-540-09745-7\_5},
  doi          = {10.1007/3-540-09745-7\_5},
  timestamp    = {Fri, 17 Jul 2020 16:12:45 +0200},
  biburl       = {https://dblp.org/rec/conf/ldpm/Pritchard79.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ifip/Pritchard77,
  author       = {Paul Pritchard},
  editor       = {Bruce Gilchrist},
  title        = {Program Proving-Expression Languages},
  booktitle    = {Information Processing, Proceedings of the 7th {IFIP} Congress 1977,
                  Toronto, Canada, August 8-12, 1977},
  pages        = {727--731},
  publisher    = {North-Holland},
  year         = {1977},
  timestamp    = {Fri, 26 Jul 2019 22:58:45 +0200},
  biburl       = {https://dblp.org/rec/conf/ifip/Pritchard77.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Pritchard76,
  author       = {Paul Pritchard},
  title        = {A Proof Rule for Multiple Coroutine Systems},
  journal      = {Inf. Process. Lett.},
  volume       = {4},
  number       = {6},
  pages        = {141--143},
  year         = {1976},
  url          = {https://doi.org/10.1016/0020-0190(76)90082-X},
  doi          = {10.1016/0020-0190(76)90082-X},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Pritchard76.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics