Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "min-wise independent permutation"
download as .bib file
@article{DBLP:journals/rsa/AlonIN07,
author = {Noga Alon and
Toshiya Itoh and
Tatsuya Nagatani},
title = {On (epsilon, k)-min-wise independent permutations},
journal = {Random Struct. Algorithms},
volume = {31},
number = {3},
pages = {384--389},
year = {2007},
url = {https://doi.org/10.1002/rsa.20184},
doi = {10.1002/RSA.20184},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AlonIN07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR06-017,
author = {Toshiya Itoh},
title = {Improved Lower Bounds for Families of epsilon-Approximate k-Restricted
Min-Wise Independent Permutations},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-017}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-017/index.html},
eprinttype = {ECCC},
eprint = {TR06-017},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR06-017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Vsemirnov04,
author = {Maxim Vsemirnov},
title = {Automorphisms of Projective Spaces and Min-Wise Independent Sets of
Permutations},
journal = {{SIAM} J. Discret. Math.},
volume = {18},
number = {3},
pages = {592--607},
year = {2004},
url = {https://doi.org/10.1137/S089548010241818X},
doi = {10.1137/S089548010241818X},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Vsemirnov04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BroderCM03,
author = {Andrei Z. Broder and
Moses Charikar and
Michael Mitzenmacher},
title = {A derandomization using min-wise independent permutations},
journal = {J. Discrete Algorithms},
volume = {1},
number = {1},
pages = {11--20},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00003-0},
doi = {10.1016/S1570-8667(03)00003-0},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/BroderCM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/random/TaruiIT03,
author = {Jun Tarui and
Toshiya Itoh and
Yoshinori Takei},
editor = {Sanjeev Arora and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Amit Sahai},
title = {A Nearly Linear Size 4-Min-Wise Independent Permutation Family by
Finite Geometries},
booktitle = {Approximation, Randomization, and Combinatorial Optimization: Algorithms
and Techniques, 6th International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems, {APPROX} 2003 and 7th International
Workshop on Randomization and Approximation Techniques in Computer
Science, {RANDOM} 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2764},
pages = {396--408},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-45198-3\_33},
doi = {10.1007/978-3-540-45198-3\_33},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/random/TaruiIT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ItohTT03,
author = {Toshiya Itoh and
Yoshinori Takei and
Jun Tarui},
editor = {Lawrence L. Larmore and
Michel X. Goemans},
title = {On the sample size of k-restricted min-wise independent permutations
and other k-wise distributions},
booktitle = {Proceedings of the 35th Annual {ACM} Symposium on Theory of Computing,
June 9-11, 2003, San Diego, CA, {USA}},
pages = {710--719},
publisher = {{ACM}},
year = {2003},
url = {https://doi.org/10.1145/780542.780645},
doi = {10.1145/780542.780645},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ItohTT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BroderM01,
author = {Andrei Z. Broder and
Michael Mitzenmacher},
title = {Completeness and robustness properties of min-wise independent permutations},
journal = {Random Struct. Algorithms},
volume = {18},
number = {1},
pages = {18--30},
year = {2001},
url = {https://doi.org/10.1002/1098-2418(200101)18:1\<18::AID-RSA2\>3.0.CO;2-M},
doi = {10.1002/1098-2418(200101)18:1\<18::AID-RSA2\>3.0.CO;2-M},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BroderM01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/BohmanCF00,
author = {Tom Bohman and
Colin Cooper and
Alan M. Frieze},
title = {Min-Wise Independent Linear Permutations},
journal = {Electron. J. Comb.},
volume = {7},
year = {2000},
url = {https://doi.org/10.37236/1504},
doi = {10.37236/1504},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/combinatorics/BohmanCF00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SaksSZZ00,
author = {Michael E. Saks and
Aravind Srinivasan and
Shiyu Zhou and
David Zuckerman},
title = {Low discrepancy sets yield approximate min-wise independent permutation
families},
journal = {Inf. Process. Lett.},
volume = {73},
number = {1-2},
pages = {29--32},
year = {2000},
url = {https://doi.org/10.1016/S0020-0190(99)00163-5},
doi = {10.1016/S0020-0190(99)00163-5},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/SaksSZZ00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BroderCFM00,
author = {Andrei Z. Broder and
Moses Charikar and
Alan M. Frieze and
Michael Mitzenmacher},
title = {Min-Wise Independent Permutations},
journal = {J. Comput. Syst. Sci.},
volume = {60},
number = {3},
pages = {630--659},
year = {2000},
url = {https://doi.org/10.1006/jcss.1999.1690},
doi = {10.1006/JCSS.1999.1690},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/BroderCFM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Broder00,
author = {Andrei Z. Broder},
editor = {Ugo Montanari and
Jos{\'{e}} D. P. Rolim and
Emo Welzl},
title = {Min-wise Independent Permutations: Theory and Practice},
booktitle = {Automata, Languages and Programming, 27th International Colloquium,
{ICALP} 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1853},
pages = {808},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-45022-X\_67},
doi = {10.1007/3-540-45022-X\_67},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Broder00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/random/BroderM99,
author = {Andrei Z. Broder and
Michael Mitzenmacher},
editor = {Dorit S. Hochbaum and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Alistair Sinclair},
title = {Completeness and Robustness Properties of Min-Wise Independent Permutations},
booktitle = {Randomization, Approximation, and Combinatorial Algorithms and Techniques,
Third International Workshop on Randomization and Approximation Techniques
in Computer Science, and Second International Workshop on Approximation
Algorithms for Combinatorial Optimization Problems RANDOM-APPROX'99,
Berkeley, CA, USA, August 8-11, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1671},
pages = {1--10},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/978-3-540-48413-4\_1},
doi = {10.1007/978-3-540-48413-4\_1},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/random/BroderM99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/random/SaksSZZ99,
author = {Michael E. Saks and
Aravind Srinivasan and
Shiyu Zhou and
David Zuckerman},
editor = {Dorit S. Hochbaum and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Alistair Sinclair},
title = {Low Discrepancy Sets Yield Approximate Min-Wise Independent Permutation
Families},
booktitle = {Randomization, Approximation, and Combinatorial Algorithms and Techniques,
Third International Workshop on Randomization and Approximation Techniques
in Computer Science, and Second International Workshop on Approximation
Algorithms for Combinatorial Optimization Problems RANDOM-APPROX'99,
Berkeley, CA, USA, August 8-11, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1671},
pages = {11--15},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/978-3-540-48413-4\_2},
doi = {10.1007/978-3-540-48413-4\_2},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/random/SaksSZZ99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/random/BroderCM98,
author = {Andrei Z. Broder and
Moses Charikar and
Michael Mitzenmacher},
editor = {Michael Luby and
Jos{\'{e}} D. P. Rolim and
Maria J. Serna},
title = {A Derandomization Using Min-Wise Independent Permutations},
booktitle = {Randomization and Approximation Techniques in Computer Science, Second
International Workshop, RANDOM'98, Barcelona, Spain, October 8-10,
1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1518},
pages = {15--24},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/3-540-49543-6\_2},
doi = {10.1007/3-540-49543-6\_2},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/random/BroderCM98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BroderCFM98,
author = {Andrei Z. Broder and
Moses Charikar and
Alan M. Frieze and
Michael Mitzenmacher},
editor = {Jeffrey Scott Vitter},
title = {Min-Wise Independent Permutations (Extended Abstract)},
booktitle = {Proceedings of the Thirtieth Annual {ACM} Symposium on the Theory
of Computing, Dallas, Texas, USA, May 23-26, 1998},
pages = {327--336},
publisher = {{ACM}},
year = {1998},
url = {https://doi.org/10.1145/276698.276781},
doi = {10.1145/276698.276781},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BroderCFM98.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.
retrieved on 2024-05-15 07:31 CEST from data curated 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:
