Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Homin K. Lee
@article{DBLP:journals/corr/abs-2402-08604,
author = {Homin K. Lee and
Charles Masson},
title = {Sampling Space-Saving Set Sketches},
journal = {CoRR},
volume = {abs/2402.08604},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.08604},
doi = {10.48550/ARXIV.2402.08604},
eprinttype = {arXiv},
eprint = {2402.08604},
timestamp = {Mon, 19 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-08604.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-17549,
author = {Charles Masson and
Homin K. Lee},
title = {FlipHash: {A} Constant-Time Consistent Range-Hashing Algorithm},
journal = {CoRR},
volume = {abs/2402.17549},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.17549},
doi = {10.48550/ARXIV.2402.17549},
eprinttype = {arXiv},
eprint = {2402.17549},
timestamp = {Mon, 25 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-17549.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pvldb/MassonRL19,
author = {Charles Masson and
Jee E. Rim and
Homin K. Lee},
title = {DDSketch: {A} Fast and Fully-Mergeable Quantile Sketch with Relative-Error
Guarantees},
journal = {Proc. {VLDB} Endow.},
volume = {12},
number = {12},
pages = {2195--2205},
year = {2019},
url = {http://www.vldb.org/pvldb/vol12/p2195-masson.pdf},
doi = {10.14778/3352063.3352135},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pvldb/MassonRL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1908-10693,
author = {Charles Masson and
Jee E. Rim and
Homin K. Lee},
title = {DDSketch: {A} fast and fully-mergeable quantile sketch with relative-error
guarantees},
journal = {CoRR},
volume = {abs/1908.10693},
year = {2019},
url = {http://arxiv.org/abs/1908.10693},
eprinttype = {arXiv},
eprint = {1908.10693},
timestamp = {Thu, 29 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1908-10693.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CheraghchiKKL12,
author = {Mahdi Cheraghchi and
Adam R. Klivans and
Pravesh Kothari and
Homin K. Lee},
editor = {Yuval Rabani},
title = {Submodular functions are noise stable},
booktitle = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
pages = {1586--1592},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973099.126},
doi = {10.1137/1.9781611973099.126},
timestamp = {Tue, 02 Feb 2021 17:07:31 +0100},
biburl = {https://dblp.org/rec/conf/soda/CheraghchiKKL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DiakonikolasLMSW11,
author = {Ilias Diakonikolas and
Homin K. Lee and
Kevin Matulef and
Rocco A. Servedio and
Andrew Wan},
title = {Efficiently Testing Sparse \emph{GF}(2) Polynomials},
journal = {Algorithmica},
volume = {61},
number = {3},
pages = {580--605},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9426-9},
doi = {10.1007/S00453-010-9426-9},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DiakonikolasLMSW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/JacksonLSW11,
author = {Jeffrey C. Jackson and
Homin K. Lee and
Rocco A. Servedio and
Andrew Wan},
title = {Learning random monotone {DNF}},
journal = {Discret. Appl. Math.},
volume = {159},
number = {5},
pages = {259--271},
year = {2011},
url = {https://doi.org/10.1016/j.dam.2010.08.022},
doi = {10.1016/J.DAM.2010.08.022},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/JacksonLSW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijnsec/DiamentLKY11,
author = {Ted Diament and
Homin K. Lee and
Angelos D. Keromytis and
Moti Yung},
title = {The Efficient Dual Receiver Cryptosystem and Its Applications},
journal = {Int. J. Netw. Secur.},
volume = {13},
number = {3},
pages = {135--151},
year = {2011},
url = {http://ijns.jalaxy.com.tw/contents/ijns-v13-n3/ijns-2011-v13-n3-p135-151.pdf},
timestamp = {Mon, 04 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijnsec/DiamentLKY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KasiviswanathanLNRS11,
author = {Shiva Prasad Kasiviswanathan and
Homin K. Lee and
Kobbi Nissim and
Sofya Raskhodnikova and
Adam D. Smith},
title = {What Can We Learn Privately?},
journal = {{SIAM} J. Comput.},
volume = {40},
number = {3},
pages = {793--826},
year = {2011},
url = {https://doi.org/10.1137/090756090},
doi = {10.1137/090756090},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KasiviswanathanLNRS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:journals/jmlr/FeldmanLS11,
author = {Vitaly Feldman and
Homin K. Lee and
Rocco A. Servedio},
editor = {Sham M. Kakade and
Ulrike von Luxburg},
title = {Lower Bounds and Hardness Amplification for Learning Shallow Monotone
Formulas},
booktitle = {{COLT} 2011 - The 24th Annual Conference on Learning Theory, June
9-11, 2011, Budapest, Hungary},
series = {{JMLR} Proceedings},
volume = {19},
pages = {273--292},
publisher = {JMLR.org},
year = {2011},
url = {http://proceedings.mlr.press/v19/feldman11a/feldman11a.pdf},
timestamp = {Wed, 29 May 2019 08:41:47 +0200},
biburl = {https://dblp.org/rec/journals/jmlr/FeldmanLS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1106-0518,
author = {Mahdi Cheraghchi and
Adam R. Klivans and
Pravesh Kothari and
Homin K. Lee},
title = {Submodular Functions Are Noise Stable},
journal = {CoRR},
volume = {abs/1106.0518},
year = {2011},
url = {http://arxiv.org/abs/1106.0518},
eprinttype = {arXiv},
eprint = {1106.0518},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1106-0518.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/CheraghchiKKL11,
author = {Mahdi Cheraghchi and
Adam R. Klivans and
Pravesh Kothari and
Homin K. Lee},
title = {Submodular Functions Are Noise Stable},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR11-090}},
year = {2011},
url = {https://eccc.weizmann.ac.il/report/2011/090},
eprinttype = {ECCC},
eprint = {TR11-090},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/CheraghchiKKL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/Lee10,
author = {Homin K. Lee},
title = {Decision Trees and Influence: an Inductive Proof of the {OSSS} Inequality},
journal = {Theory Comput.},
volume = {6},
number = {1},
pages = {81--84},
year = {2010},
url = {https://doi.org/10.4086/toc.2010.v006a004},
doi = {10.4086/TOC.2010.V006A004},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/Lee10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/Lee10,
author = {Homin K. Lee},
editor = {Adam Tauman Kalai and
Mehryar Mohri},
title = {Learning Talagrand {DNF} Formulas},
booktitle = {{COLT} 2010 - The 23rd Conference on Learning Theory, Haifa, Israel,
June 27-29, 2010},
pages = {310--311},
publisher = {Omnipress},
year = {2010},
url = {http://colt2010.haifa.il.ibm.com/papers/COLT2010proceedings.pdf\#page=318},
timestamp = {Tue, 25 Jan 2022 13:23:33 +0100},
biburl = {https://dblp.org/rec/conf/colt/Lee10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/KlivansLW10,
author = {Adam R. Klivans and
Homin K. Lee and
Andrew Wan},
editor = {Adam Tauman Kalai and
Mehryar Mohri},
title = {Mansour's Conjecture is True for Random {DNF} Formulas},
booktitle = {{COLT} 2010 - The 23rd Conference on Learning Theory, Haifa, Israel,
June 27-29, 2010},
pages = {368--380},
publisher = {Omnipress},
year = {2010},
url = {http://colt2010.haifa.il.ibm.com/papers/COLT2010proceedings.pdf\#page=376},
timestamp = {Tue, 25 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/colt/KlivansLW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/FeldmanLS10,
author = {Vitaly Feldman and
Homin K. Lee and
Rocco A. Servedio},
title = {Lower Bounds and Hardness Amplification for Learning Shallow Monotone
Formulas},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-022}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/022},
eprinttype = {ECCC},
eprint = {TR10-022},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/FeldmanLS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KlivansLW10,
author = {Adam R. Klivans and
Homin K. Lee and
Andrew Wan},
title = {Mansour's Conjecture is True for Random {DNF} Formulas},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-023}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/023},
eprinttype = {ECCC},
eprint = {TR10-023},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KlivansLW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/Dachman-SoledLMSWW09,
author = {Dana Dachman{-}Soled and
Homin K. Lee and
Tal Malkin and
Rocco A. Servedio and
Andrew Wan and
Hoeteck Wee},
title = {Optimal Cryptographic Hardness of Learning Monotone Functions},
journal = {Theory Comput.},
volume = {5},
number = {1},
pages = {257--282},
year = {2009},
url = {https://doi.org/10.4086/toc.2009.v005a013},
doi = {10.4086/TOC.2009.V005A013},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/Dachman-SoledLMSWW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/JacksonLSW08,
author = {Jeffrey C. Jackson and
Homin K. Lee and
Rocco A. Servedio and
Andrew Wan},
editor = {Ashish Goel and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Ronitt Rubinfeld},
title = {Learning Random Monotone {DNF}},
booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms
and Techniques, 11th International Workshop, {APPROX} 2008, and 12th
International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27,
2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5171},
pages = {483--497},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-85363-3\_38},
doi = {10.1007/978-3-540-85363-3\_38},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/JacksonLSW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KasiviswanathanLNRS08,
author = {Shiva Prasad Kasiviswanathan and
Homin K. Lee and
Kobbi Nissim and
Sofya Raskhodnikova and
Adam D. Smith},
title = {What Can We Learn Privately?},
booktitle = {49th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2008, October 25-28, 2008, Philadelphia, PA, {USA}},
pages = {531--540},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/FOCS.2008.27},
doi = {10.1109/FOCS.2008.27},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KasiviswanathanLNRS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Dachman-SoledLMSWW08,
author = {Dana Dachman{-}Soled and
Homin K. Lee and
Tal Malkin and
Rocco A. Servedio and
Andrew Wan and
Hoeteck Wee},
editor = {Luca Aceto and
Ivan Damg{\aa}rd and
Leslie Ann Goldberg and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Anna Ing{\'{o}}lfsd{\'{o}}ttir and
Igor Walukiewicz},
title = {Optimal Cryptographic Hardness of Learning Monotone Functions},
booktitle = {Automata, Languages and Programming, 35th International Colloquium,
{ICALP} 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part
{I:} Tack {A:} Algorithms, Automata, Complexity, and Games},
series = {Lecture Notes in Computer Science},
volume = {5125},
pages = {36--47},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-70575-8\_4},
doi = {10.1007/978-3-540-70575-8\_4},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/Dachman-SoledLMSWW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DiakonikolasLMSW08,
author = {Ilias Diakonikolas and
Homin K. Lee and
Kevin Matulef and
Rocco A. Servedio and
Andrew Wan},
editor = {Luca Aceto and
Ivan Damg{\aa}rd and
Leslie Ann Goldberg and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Anna Ing{\'{o}}lfsd{\'{o}}ttir and
Igor Walukiewicz},
title = {Efficiently Testing Sparse {GF(2)} Polynomials},
booktitle = {Automata, Languages and Programming, 35th International Colloquium,
{ICALP} 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part
{I:} Tack {A:} Algorithms, Automata, Complexity, and Games},
series = {Lecture Notes in Computer Science},
volume = {5125},
pages = {502--514},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-70575-8\_41},
doi = {10.1007/978-3-540-70575-8\_41},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/DiakonikolasLMSW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0803-0924,
author = {Shiva Prasad Kasiviswanathan and
Homin K. Lee and
Kobbi Nissim and
Sofya Raskhodnikova and
Adam D. Smith},
title = {What Can We Learn Privately?},
journal = {CoRR},
volume = {abs/0803.0924},
year = {2008},
url = {http://arxiv.org/abs/0803.0924},
eprinttype = {arXiv},
eprint = {0803.0924},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0803-0924.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0805-1765,
author = {Ilias Diakonikolas and
Homin K. Lee and
Kevin Matulef and
Rocco A. Servedio and
Andrew Wan},
title = {Efficiently Testing Sparse {GF(2)} Polynomials},
journal = {CoRR},
volume = {abs/0805.1765},
year = {2008},
url = {http://arxiv.org/abs/0805.1765},
eprinttype = {arXiv},
eprint = {0805.1765},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0805-1765.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jmlr/ElbazLSW07,
author = {Ariel Elbaz and
Homin K. Lee and
Rocco A. Servedio and
Andrew Wan},
title = {Separating Models of Learning from Correlated and Uncorrelated Data},
journal = {J. Mach. Learn. Res.},
volume = {8},
pages = {277--290},
year = {2007},
url = {http://jmlr.org/papers/v8/elbaz07a.html},
timestamp = {Wed, 10 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jmlr/ElbazLSW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ml/LeeSW07,
author = {Homin K. Lee and
Rocco A. Servedio and
Andrew Wan},
title = {{DNF} are teachable in the average case},
journal = {Mach. Learn.},
volume = {69},
number = {2-3},
pages = {79--96},
year = {2007},
url = {https://doi.org/10.1007/s10994-007-5007-9},
doi = {10.1007/S10994-007-5007-9},
timestamp = {Mon, 02 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ml/LeeSW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DiakonikolasLMORSW07,
author = {Ilias Diakonikolas and
Homin K. Lee and
Kevin Matulef and
Krzysztof Onak and
Ronitt Rubinfeld and
Rocco A. Servedio and
Andrew Wan},
title = {Testing for Concise Representations},
booktitle = {48th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
2007), October 20-23, 2007, Providence, RI, USA, Proceedings},
pages = {549--558},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/FOCS.2007.32},
doi = {10.1109/FOCS.2007.32},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DiakonikolasLMORSW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/imc/LeeMN07,
author = {Homin K. Lee and
Tal Malkin and
Erich M. Nahum},
editor = {Constantine Dovrolis and
Matthew Roughan},
title = {Cryptographic strength of ssl/tls servers: current and recent practices},
booktitle = {Proceedings of the 7th {ACM} {SIGCOMM} Internet Measurement Conference,
{IMC} 2007, San Diego, California, USA, October 24-26, 2007},
pages = {83--92},
publisher = {{ACM}},
year = {2007},
url = {https://doi.org/10.1145/1298306.1298318},
doi = {10.1145/1298306.1298318},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/imc/LeeMN07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DiakonikolasLMORSW07,
author = {Ilias Diakonikolas and
Homin K. Lee and
Kevin Matulef and
Krzysztof Onak and
Ronitt Rubinfeld and
Rocco A. Servedio and
Andrew Wan},
title = {Testing for Concise Representations},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR07-077}},
year = {2007},
url = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-077/index.html},
eprinttype = {ECCC},
eprint = {TR07-077},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DiakonikolasLMORSW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/JacksonLSW07,
author = {Jeffrey C. Jackson and
Homin K. Lee and
Rocco A. Servedio and
Andrew Wan},
title = {Learning Random Monotone {DNF}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR07-129}},
year = {2007},
url = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-129/index.html},
eprinttype = {ECCC},
eprint = {TR07-129},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/JacksonLSW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/LeeSW06,
author = {Homin K. Lee and
Rocco A. Servedio and
Andrew Wan},
editor = {G{\'{a}}bor Lugosi and
Hans Ulrich Simon},
title = {{DNF} Are Teachable in the Average Case},
booktitle = {Learning Theory, 19th Annual Conference on Learning Theory, {COLT}
2006, Pittsburgh, PA, USA, June 22-25, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4005},
pages = {214--228},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11776420\_18},
doi = {10.1007/11776420\_18},
timestamp = {Fri, 08 Sep 2023 21:18:17 +0200},
biburl = {https://dblp.org/rec/conf/colt/LeeSW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bmcbi/LeeBKP05,
author = {Homin K. Lee and
William Braynen and
Kiran Keshav and
Paul Pavlidis},
title = {ErmineJ: Tool for functional analysis of gene expression data sets},
journal = {{BMC} Bioinform.},
volume = {6},
pages = {269},
year = {2005},
url = {https://doi.org/10.1186/1471-2105-6-269},
doi = {10.1186/1471-2105-6-269},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/bmcbi/LeeBKP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/ElbazLSW05,
author = {Ariel Elbaz and
Homin K. Lee and
Rocco A. Servedio and
Andrew Wan},
editor = {Peter Auer and
Ron Meir},
title = {Separating Models of Learning from Correlated and Uncorrelated Data},
booktitle = {Learning Theory, 18th Annual Conference on Learning Theory, {COLT}
2005, Bertinoro, Italy, June 27-30, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3559},
pages = {637--651},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11503415\_43},
doi = {10.1007/11503415\_43},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/colt/ElbazLSW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ccs/DiamentLKY04,
author = {Theodore Diament and
Homin K. Lee and
Angelos D. Keromytis and
Moti Yung},
editor = {Vijayalakshmi Atluri and
Birgit Pfitzmann and
Patrick D. McDaniel},
title = {The dual receiver cryptosystem and its applications},
booktitle = {Proceedings of the 11th {ACM} Conference on Computer and Communications
Security, {CCS} 2004, Washington, DC, USA, October 25-29, 2004},
pages = {330--343},
publisher = {{ACM}},
year = {2004},
url = {https://doi.org/10.1145/1030083.1030128},
doi = {10.1145/1030083.1030128},
timestamp = {Fri, 13 Nov 2020 16:10:44 +0100},
biburl = {https://dblp.org/rec/conf/ccs/DiamentLKY04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-03-27 00:11 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
