BibTeX records: Laurent Hyafil

download as .bib file

@article{DBLP:journals/jal/RamananH84,
  author       = {Prakash V. Ramanan and
                  Laurent Hyafil},
  title        = {New Algorithms for Selection},
  journal      = {J. Algorithms},
  volume       = {5},
  number       = {4},
  pages        = {557--578},
  year         = {1984},
  url          = {https://doi.org/10.1016/0196-6774(84)90008-7},
  doi          = {10.1016/0196-6774(84)90008-7},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/RamananH84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/Hyafil79,
  author       = {Laurent Hyafil},
  title        = {On the Parallel Evaluation of Multivariate Polynomials},
  journal      = {{SIAM} J. Comput.},
  volume       = {8},
  number       = {2},
  pages        = {120--123},
  year         = {1979},
  url          = {https://doi.org/10.1137/0208010},
  doi          = {10.1137/0208010},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Hyafil79.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stoc/Hyafil78,
  author       = {Laurent Hyafil},
  editor       = {Richard J. Lipton and
                  Walter A. Burkhard and
                  Walter J. Savitch and
                  Emily P. Friedman and
                  Alfred V. Aho},
  title        = {On the Parallel Evaluation of Multivariate Polynomials},
  booktitle    = {Proceedings of the 10th Annual {ACM} Symposium on Theory of Computing,
                  May 1-3, 1978, San Diego, California, {USA}},
  pages        = {193--195},
  publisher    = {{ACM}},
  year         = {1978},
  url          = {https://doi.org/10.1145/800133.804347},
  doi          = {10.1145/800133.804347},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/Hyafil78.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/HyafilK77,
  author       = {Laurent Hyafil and
                  H. T. Kung},
  title        = {The Complexity of Parallel Evaluation of Linear Recurrences},
  journal      = {J. {ACM}},
  volume       = {24},
  number       = {3},
  pages        = {513--521},
  year         = {1977},
  url          = {https://doi.org/10.1145/322017.322030},
  doi          = {10.1145/322017.322030},
  timestamp    = {Tue, 28 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jacm/HyafilK77.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/focs/Hyafil77,
  author       = {Laurent Hyafil},
  title        = {The Power of Commutativity},
  booktitle    = {18th Annual Symposium on Foundations of Computer Science, Providence,
                  Rhode Island, USA, 31 October - 1 November 1977},
  pages        = {171--174},
  publisher    = {{IEEE} Computer Society},
  year         = {1977},
  url          = {https://doi.org/10.1109/SFCS.1977.31},
  doi          = {10.1109/SFCS.1977.31},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/Hyafil77.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/HyafilR76,
  author       = {Laurent Hyafil and
                  Ronald L. Rivest},
  title        = {Constructing Optimal Binary Decision Trees is NP-Complete},
  journal      = {Inf. Process. Lett.},
  volume       = {5},
  number       = {1},
  pages        = {15--17},
  year         = {1976},
  url          = {https://doi.org/10.1016/0020-0190(76)90095-8},
  doi          = {10.1016/0020-0190(76)90095-8},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/HyafilR76.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/Hyafil76,
  author       = {Laurent Hyafil},
  title        = {Bounds for Selection},
  journal      = {{SIAM} J. Comput.},
  volume       = {5},
  number       = {1},
  pages        = {109--114},
  year         = {1976},
  url          = {https://doi.org/10.1137/0205010},
  doi          = {10.1137/0205010},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Hyafil76.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/HyafilW75,
  author       = {Laurent Hyafil and
                  Jean{-}Paul Van de Wiele},
  title        = {On the Additive Complexity of Specific Polynomials},
  journal      = {Inf. Process. Lett.},
  volume       = {4},
  number       = {2},
  pages        = {45--47},
  year         = {1975},
  url          = {https://doi.org/10.1016/0020-0190(75)90012-5},
  doi          = {10.1016/0020-0190(75)90012-5},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/HyafilW75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stoc/HyafilK75,
  author       = {Laurent Hyafil and
                  H. T. Kung},
  editor       = {William C. Rounds and
                  Nancy Martin and
                  Jack W. Carlyle and
                  Michael A. Harrison},
  title        = {The Complexity of Parallel Evaluation of Linear Recurrence},
  booktitle    = {Proceedings of the 7th Annual {ACM} Symposium on Theory of Computing,
                  May 5-7, 1975, Albuquerque, New Mexico, {USA}},
  pages        = {12--22},
  publisher    = {{ACM}},
  year         = {1975},
  url          = {https://doi.org/10.1145/800116.803748},
  doi          = {10.1145/800116.803748},
  timestamp    = {Tue, 28 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stoc/HyafilK75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/ifip/HyafilPV74,
  author       = {Laurent Hyafil and
                  F. Prusker and
                  Jean Vuillemin},
  editor       = {Jack L. Rosenfeld},
  title        = {Design of Optimal Merge on Direct Access Devices},
  booktitle    = {Information Processing, Proceedings of the 6th {IFIP} Congress 1974,
                  Stockholm, Sweden, August 5-10, 1974},
  pages        = {979--982},
  publisher    = {North-Holland},
  year         = {1974},
  timestamp    = {Fri, 26 Jul 2019 22:58:40 +0200},
  biburl       = {https://dblp.org/rec/conf/ifip/HyafilPV74.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stoc/HyafilPV74,
  author       = {Laurent Hyafil and
                  F. Prusker and
                  Jean Vuillemin},
  editor       = {Robert L. Constable and
                  Robert W. Ritchie and
                  Jack W. Carlyle and
                  Michael A. Harrison},
  title        = {An Efficient Algorithm for Computing Optimal Desk Merge Patterns (Extended
                  Abstract)},
  booktitle    = {Proceedings of the 6th Annual {ACM} Symposium on Theory of Computing,
                  April 30 - May 2, 1974, Seattle, Washington, {USA}},
  pages        = {216--229},
  publisher    = {{ACM}},
  year         = {1974},
  url          = {https://doi.org/10.1145/800119.803899},
  doi          = {10.1145/800119.803899},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/HyafilPV74.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.