BibTeX records: Vera Asodi

download as .bib file

@incollection{DBLP:reference/algo/Asodi16,
  author       = {Vera Asodi},
  title        = {Multiplex {PCR} for Gap Closing (Whole-Genome Assembly)},
  booktitle    = {Encyclopedia of Algorithms},
  pages        = {1383--1386},
  year         = {2016},
  url          = {https://doi.org/10.1007/978-1-4939-2864-4\_252},
  doi          = {10.1007/978-1-4939-2864-4\_252},
  timestamp    = {Wed, 12 Jul 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/reference/algo/Asodi16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/AsodiU09,
  author       = {Vera Asodi and
                  Christopher Umans},
  title        = {The complexity of the matroid-greedoid partition problem},
  journal      = {Theor. Comput. Sci.},
  volume       = {410},
  number       = {8-10},
  pages        = {859--866},
  year         = {2009},
  url          = {https://doi.org/10.1016/j.tcs.2008.11.019},
  doi          = {10.1016/J.TCS.2008.11.019},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/AsodiU09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@incollection{DBLP:reference/algo/Asodi08,
  author       = {Vera Asodi},
  editor       = {Ming{-}Yang Kao},
  title        = {Multiplex {PCR} for Gap Closing (Whole-genome Assembly)},
  booktitle    = {Encyclopedia of Algorithms - 2008 Edition},
  publisher    = {Springer},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-0-387-30162-4\_252},
  doi          = {10.1007/978-0-387-30162-4\_252},
  timestamp    = {Thu, 27 Jun 2019 16:25:31 +0200},
  biburl       = {https://dblp.org/rec/reference/algo/Asodi08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cpc/AlonA07,
  author       = {Noga Alon and
                  Vera Asodi},
  title        = {Edge Colouring with Delays},
  journal      = {Comb. Probab. Comput.},
  volume       = {16},
  number       = {2},
  pages        = {173--191},
  year         = {2007},
  url          = {https://doi.org/10.1017/S0963548306007851},
  doi          = {10.1017/S0963548306007851},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/AlonA07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tit/AlonA07,
  author       = {Noga Alon and
                  Vera Asodi},
  title        = {Tracing Many Users With Almost No Rate Penalty},
  journal      = {{IEEE} Trans. Inf. Theory},
  volume       = {53},
  number       = {1},
  pages        = {437--439},
  year         = {2007},
  url          = {https://doi.org/10.1109/TIT.2006.887089},
  doi          = {10.1109/TIT.2006.887089},
  timestamp    = {Tue, 10 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tit/AlonA07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@phdthesis{DBLP:phd/il/Asodi06,
  author       = {Vera Asodi},
  title        = {Search problems, codes and edge coloring},
  school       = {Tel Aviv University, Israel},
  year         = {2006},
  url          = {https://tau.primo.exlibrisgroup.com/permalink/972TAU\_INST/bai57q/alma990020799600204146},
  timestamp    = {Fri, 03 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/phd/il/Asodi06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ejc/AlonA06,
  author       = {Noga Alon and
                  Vera Asodi},
  title        = {Tracing a single user},
  journal      = {Eur. J. Comb.},
  volume       = {27},
  number       = {8},
  pages        = {1227--1234},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.ejc.2006.05.001},
  doi          = {10.1016/J.EJC.2006.05.001},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ejc/AlonA06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jcb/AlonACKR06,
  author       = {Noga Alon and
                  Vera Asodi and
                  Charles Cantor and
                  Simon Kasif and
                  John Rachlin},
  title        = {Multi-Node Graphs: {A} Framework for Multiplexed Biological Assays},
  journal      = {J. Comput. Biol.},
  volume       = {13},
  number       = {10},
  pages        = {1659--1672},
  year         = {2006},
  url          = {https://doi.org/10.1089/cmb.2006.13.1659},
  doi          = {10.1089/CMB.2006.13.1659},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jcb/AlonACKR06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamdm/AlonA05,
  author       = {Noga Alon and
                  Vera Asodi},
  title        = {Learning a Hidden Subgraph},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {18},
  number       = {4},
  pages        = {697--712},
  year         = {2005},
  url          = {https://doi.org/10.1137/S0895480103431071},
  doi          = {10.1137/S0895480103431071},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/AlonA05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/approx/AlonA04,
  author       = {Noga Alon and
                  Vera Asodi},
  editor       = {Klaus Jansen and
                  Sanjeev Khanna and
                  Jos{\'{e}} D. P. Rolim and
                  Dana Ron},
  title        = {Edge Coloring with Delays},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization, Algorithms
                  and Techniques, 7th International Workshop on Approximation Algorithms
                  for Combinatorial Optimization Problems, {APPROX} 2004, and 8th International
                  Workshop on Randomization and Computation, {RANDOM} 2004, Cambridge,
                  MA, USA, August 22-24, 2004, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3122},
  pages        = {237--248},
  publisher    = {Springer},
  year         = {2004},
  url          = {https://doi.org/10.1007/978-3-540-27821-4\_22},
  doi          = {10.1007/978-3-540-27821-4\_22},
  timestamp    = {Tue, 21 Sep 2021 09:36:24 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/AlonA04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/icalp/AlonA04,
  author       = {Noga Alon and
                  Vera Asodi},
  editor       = {Josep D{\'{\i}}az and
                  Juhani Karhum{\"{a}}ki and
                  Arto Lepist{\"{o}} and
                  Donald Sannella},
  title        = {Learning a Hidden Subgraph},
  booktitle    = {Automata, Languages and Programming: 31st International Colloquium,
                  {ICALP} 2004, Turku, Finland, July 12-16, 2004. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3142},
  pages        = {110--121},
  publisher    = {Springer},
  year         = {2004},
  url          = {https://doi.org/10.1007/978-3-540-27836-8\_12},
  doi          = {10.1007/978-3-540-27836-8\_12},
  timestamp    = {Tue, 14 May 2019 10:00:44 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/AlonA04.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.