temp.bib

@article{ambainis12c,
  author = {A. Ambainis and A. Montanaro},
  title = {Quantum algorithms for search with wildcards and combinatorial group testing},
  journal = {Quantum Information & Computation},
  year = {5555},
  eprint = {1210.1148}
}
@article{montanaro11c,
  author = {A. Montanaro and R. Jozsa and G. Mitchison},
  title = {On exact quantum query complexity},
  journal = {Algorithmica},
  eprint = {1111.0475},
  year = {5555}
}
@article{montanaro13,
  author = {A. Montanaro},
  title = {A composition theorem for decision tree complexity},
  journal = {Chicago Journal of Theoretical Computer Science},
  year = {5555},
  eprint = {1302.4207}
}
@article{BGSV:2012journal,
  author = {P. Bille and I. G{\o}rtz and B. Sach and H. Vildh{\o}j},
  title = {Time-Space Trade-Offs for Longest Common Extensions},
  journal = {Journal of Discrete Algorithms},
  eprint = {1211.0270},
  year = {5555}
}
@inproceedings{CJS-soda:2015,
  author = {R. Clifford and M. Jalsenius and B. Sach},
  title = {Cell-Probe Bounds for Online Edit Distance and Other Pattern Matching Problems},
  eprint = {1407.6559},
  booktitle = {SODA '15: Proc. 26\textsuperscript{th} ACM-SIAM Symp.
		  on Discrete Algorithms},
  year = {2015}
}
@article{BCW:2013,
  author = {Paul Beame and
               Rapha{\"e}l Clifford and
               Widad Machmouchi},
  title = {Element Distinctness, Frequency Moments, and Sliding Windows},
  journal = {FOCS '13: Proc. 54\textsuperscript{st} Annual Symp.
		  Foundations of Computer Science},
  pdf = {papers/focs-2013.pdf},
  slides = {slides/focstalk.pdf},
  year = {2013}
}
@inproceedings{BFGKSV:2013,
  author = {P. Bille and J. Fischer and I. G{\o}rtz and T. Kopelowitz and B. Sach and H. Vildh{\o}j},
  title = {Sparse Suffix Tree Construction in Small Space},
  booktitle = {ICALP '13: Proc. 40\textsuperscript{th} International
		  Colloquium on Automata, Languages and Programming},
  year = {2013},
  slides = {slides/icalp13.pdf}
}
@inproceedings{BCGSVV:2013,
  author = {P. Bille and P. Cording and I.G{\o}rtz and B. Sach and H. Vildh{\o}j and S. Vind},
  title = {Fingerprints in Compressed Strings},
  booktitle = {WADS '13: Proc. 13\textsuperscript{th} Workshop on Algorithms and Data Structures},
  year = {2013}
}
@inproceedings{BGSV:2012,
  author = {P. Bille and I. G{\o}rtz and B. Sach and H. Vildh{\o}j},
  title = {Time-Space Trade-Offs for Longest Common Extensions},
  booktitle = {CPM '12: Proc. 23\textsuperscript{nd} Annual Symp. on
		  Combinatorial Pattern Matching},
  year = {2012},
  eprint = {1211.0270}
}
@article{CJPS:2012,
  author = {R. Clifford and M. Jalsenius and E. Porat and B. Sach},
  title = {Space Lower Bounds for Online Pattern Matching},
  journal = {Theoretical Computer Science},
  volume = {483},
  pages = {58-74},
  year = {2013},
  eprint = {1106.4412},
  slides = {slides/cpm12.pdf}
}
@article{DGJR:2010journal,
  author = {M. Dyer and L. A. Goldberg and M. Jalsenius and D. Richerby},
  title = {The Complexity of Approximating Bounded-Degree {B}oolean \#{C}{S}{P}},
  journal = {Information and Computation},
  volume = {220},
  pages = {1-14},
  year = {2012},
  eprint = {0907.2663}
}
@article{BCCJLPPS,
  author = {A. Butman and P. Clifford and R. Clifford and M. Jalsenius and N. Lewenstein and B. Porat and E. Porat and B. Sach},
  title = {Pattern Matching under Polynomial Transformation},
  journal = {SIAM Journal on Computing},
  volume = {42},
  number = {2},
  pages = {611-633},
  year = {2013},
  eprint = {1109.1494}
}
@inproceedings{JPS:2013,
  author = {Markus Jalsenius and Benny Porat and Benjamin Sach},
  title = {Parameterized Matching in the Streaming Model},
  booktitle = {STACS '13: Proc. 30\textsuperscript{th} Annual Symp. on Theoretical Aspects
		  of Computer Science},
  pages = {400-411},
  year = {2013},
  eprint = {1109.5269},
  slides = {slides/stacs13.pdf}
}
@inproceedings{CJS:2013,
  author = {Rapha\"{e}l Clifford and Markus Jalsenius and Benjamin Sach},
  title = {Tight Cell-Probe Bounds for Online Hamming Distance Computation},
  booktitle = {SODA '13: Proc. 24\textsuperscript{th} ACM-SIAM Symp.
		  on Discrete Algorithms},
  year = {2013},
  pages = {664--674},
  eprint = {1207.1885},
  slides = {slides/soda13.pdf}
}
@article{AACP:2011,
  title = {Speed scaling to manage temperature},
  author = {Atkins, L. and Aupy, G. and Cole, D. and Pruhs, K.},
  journal = {Theory and Practice of Algorithms in (Computer) Systems},
  pages = {9--20},
  year = {2011},
  pdf = {papers/tapas2011.pdf}
}
@inproceedings{CJPS:2012:multiple,
  author = {Rapha\"{e}l Clifford and Markus Jalsenius and Ely Porat and Benjamin Sach},
  title = {Pattern Matching in Multiple Streams},
  booktitle = {CPM '12: Proc. 23\textsuperscript{nd} Annual Symp. on
		  Combinatorial Pattern Matching},
  pages = {97--109},
  year = {2012},
  eprint = {1202.3470},
  slides = {slides/cpm12.pdf}
}
@inproceedings{CGLP:2011,
  author = {Rapha{\"e}l Clifford and
               Zvi Gotthilf and
               Moshe Lewenstein and
               Alexandru Popa},
  title = {Restricted Common Superstring and Restricted Common Supersequence},
  booktitle = {CPM '11: Proc. 22\textsuperscript{nd} Annual Symp. on
		  Combinatorial Pattern Matching},
  year = {2011},
  pages = {467-478},
  eprint = {1004.0424}
}
@article{CEPR:2012,
  author = {Rapha{\"e}l Clifford and
               Klim Efremenko and
               Benny Porat and
               Ely Porat and
               Amir Rothschild},
  title = {Mismatch sampling},
  journal = {Information and Computation},
  volume = {214},
  year = {2012},
  pages = {112-118},
  pdf = {papers/mismatchsampling-27jan12.pdf}
}
@inproceedings{DGJR:2010,
  author = {Martin Dyer and Leslie Ann Goldberg and Markus Jalsenius and David Richerby},
  title = {The Complexity of Approximating Bounded-Degree {B}oolean \#{C}{S}{P}},
  booktitle = {STACS '10: Proc. 27\textsuperscript{th} Annual Symp. on Theoretical Aspects
		  of Computer Science},
  pages = {323-334},
  year = {2010},
  eprint = {0907.2663}
}
@inproceedings{CJPS:2011,
  author = {Rapha\"{e}l Clifford and Markus Jalsenius and Ely Porat and Benjamin Sach},
  title = {Space Lower Bounds for Online Pattern Matching},
  booktitle = {CPM '11: Proc. 22\textsuperscript{nd} Annual Symp. on
		  Combinatorial Pattern Matching},
  pages = {184--196},
  year = {2011},
  eprint = {1106.4412}
}
@article{BDGJJR:2012,
  author = {A. Bulatov and M. Dyer and L. A. Goldberg and M. Jalsenius and M. Jerrum and D. Richerby},
  title = {The Complexity of Weighted and Unweighted \#{C}{S}{P}},
  journal = {Journal of Computer and System Sciences},
  volume = {78},
  number = {2},
  pages = {681-688},
  year = {2012},
  eprint = {1005.2678}
}
@article{Jal:2012,
  author = {Markus Jalsenius},
  title = {Sampling Colourings of the Triangular Lattice},
  journal = {Random Structures \& Algorithms},
  volume = {40},
  number = {4},
  pages = {501-533},
  year = {2012},
  eprint = {0706.0489}
}
@inproceedings{CJ:2011,
  author = {Rapha\"{e}l Clifford and Markus Jalsenius},
  title = {Lower Bounds for Online Integer Multiplication and Convolution in the Cell-Probe Model},
  booktitle = {ICALP '11: Proc. 38\textsuperscript{th} International
		  Colloquium on Automata, Languages and Programming},
  pages = {593--604},
  year = {2011},
  eprint = {1101.0768},
  slides = {slides/icalp11.pdf}
}
@article{CJMS:2011,
  author = {Clifford, Rapha\"el and Jalsenius, Markus and Montanaro, Ashley and Sach, Benjamin},
  title = {The Complexity of Flood Filling Games},
  journal = {Theory of Computing Systems},
  pages = {79-92},
  volume = {50},
  number = {1},
  year = {2012},
  eprint = {1001.4420},
  slides = {slides/fun10.pdf}
}
@article{CS:2010ipl,
  author = {Clifford, Rapha\"el and Sach, Benjamin},
  title = {Permuted Function Matching},
  journal = {Information Processing Letters},
  volume = {110},
  number = {22},
  year = {2010},
  pages = {1012-1015},
  pdf = {papers/PFM-preprint.pdf}
}
@inproceedings{ACJMS:2010,
  author = {David Arthur and
               Rapha{\"e}l Clifford and
               Markus Jalsenius and
               Ashley Montanaro and
               Benjamin Sach},
  title = {The Complexity of Flood Filling Games},
  booktitle = {FUN '10: Proc. 5\textsuperscript{th} International Conference on Fun with Algorithms},
  year = {2010},
  pages = {307-318},
  eprint = {1001.4420},
  slides = {slides/fun10.pdf}
}
@inproceedings{CS:2010,
  author = {Rapha{\"e}l Clifford and Benjamin Sach},
  title = {Pseudo-Realtime Pattern Matching: Closing the Gap},
  booktitle = {CPM '10: Proc. 21\textsuperscript{st} Annual Symp. on
		  Combinatorial Pattern Matching},
  year = {2010},
  pages = {101-111}
}
@inproceedings{CEPPR:2008,
  author = {Rapha{\"e}l Clifford and
               Klim Efremenko and
               Benny Porat and
               Ely Porat and
               Amir Rothschild},
  title = {Mismatch Sampling},
  booktitle = {SPIRE '08: Proc. 15\textsuperscript{th} International Symp.
		  on String Processing and Information Retrieval},
  year = {2008},
  pages = {99-108}
}
@inproceedings{CEPR:2007,
  author = {Rapha{\"e}l Clifford and Klim Efremenko and Ely Porat and
		  Amir Rothschild},
  title = {{$k$}-Mismatch with Don't Cares},
  booktitle = {ESA '07: Proc. 15\textsuperscript{th} Annual European
		  Symp. on Algorithms},
  year = {2007},
  pages = {151-162}
}
@inproceedings{CS:2007,
  author = {Rapha\"{e}l Clifford and Benjamin Sach},
  title = {Fast Approximate Point Set Matching for Information
		  Retrieval},
  booktitle = {SOFSEM '07: Proc. 33\textsuperscript{rd} Conference on Current Trends in
		  Theory and Practice of Computer Science},
  pages = {212--223},
  year = {2007}
}
@article{CS:2008,
  author = {Benjamin Sach and Rapha{\"e}l Clifford},
  title = {An Empirical Study of Cache-Oblivious Priority Queues and
		  their Application to the Shortest Path Problem},
  journal = {arXiv},
  eprint = {0802.1026},
  year = {2008},
  note = {Preprint}
}
@inproceedings{CS:2009,
  author = {Rapha{\"e}l Clifford and Benjamin Sach},
  title = {Online Approximate Matching with Non-local Distances},
  booktitle = {CPM '09: Proc. 20\textsuperscript{th} Annual Symp. on
		  Combinatorial Pattern Matching},
  year = {2009},
  pages = {142-153}
}
@article{CS:2011,
  author = {Rapha{\"e}l Clifford and
               Benjamin Sach},
  title = {Pattern Matching in Pseudo Real-Time},
  journal = {Journal of Discrete Algorithms},
  volume = {9},
  number = {1},
  year = {2011},
  pages = {67-81},
  pdf = {papers/CPMjournal.pdf}
}
@inproceedings{CEPR:2009,
  author = {Rapha\"{e}l Clifford and Klim Efremenko and Ely Porat and
		  Amir Rothschild},
  title = {From Coding Theory to Efficient Pattern Matching},
  booktitle = {SODA '09: Proc. 20\textsuperscript{th} ACM-SIAM Symp.
		  on Discrete Algorithms},
  year = {2009},
  pages = {778--784},
  pdf = {papers/codingtokmismatch.pdf}
}
@article{CEPR:2010,
  author = {Rapha{\"e}l Clifford and Klim Efremenko and Ely Porat and
		  Amir Rothschild},
  title = {Pattern Matching with Don't Cares and Few Errors},
  journal = {Journal of Computer System Sciences},
  volume = {76},
  number = {2},
  year = {2010},
  pages = {115-124},
  pdf = {papers/dontcaresfewerrors.pdf}
}
@inproceedings{CEPP:2008,
  author = {Rapha{\"e}l Clifford and Klim Efremenko and Benny Porat
		  and Ely Porat},
  title = {A Black Box for Online Approximate Pattern Matching},
  booktitle = {CPM '08: Proc. 19\textsuperscript{th} Annual Symp. on
		  Combinatorial Pattern Matching},
  year = {2008},
  pages = {143-151}
}
@article{CEPP:2011,
  author = {Rapha{\"e}l Clifford and Klim Efremenko and Benny Porat
		  and Ely Porat},
  title = {A Black Box for Online Approximate Pattern Matching},
  journal = {Information and Computation},
  year = {2011},
  volume = {209},
  number = {4},
  pages = {731-736},
  pdf = {papers/blackboxfinal-2009.pdf}
}
@article{CP:2011,
  author = {Rapha{\"e}l Clifford and
               Alexandru Popa},
  title = {Maximum Subset Intersection},
  journal = {Information Processing Letters},
  volume = {111},
  number = {7},
  year = {2011},
  pages = {323-325}
}
@inproceedings{CHPS:2009,
  author = {Rapha{\"e}l Clifford and
               Aram Wettroth Harrow and
               Alexandru Popa and
               Benjamin Sach},
  title = {Generalised Matching},
  booktitle = {SPIRE '09: Proc. 16\textsuperscript{th} International Symp.
		  on String Processing and Information Retrieval},
  year = {2009},
  pages = {295-301},
  pdf = {papers/spire2009.pdf}
}
@inproceedings{CC:2007,
  author = {Peter Clifford and Rapha\"{e}l Clifford},
  title = {Self-Normalised Distance with Don't Cares},
  booktitle = {CPM '07: Proc. 18\textsuperscript{th} Annual Symp. on
		  Combinatorial Pattern Matching},
  pages = {63--70},
  year = {2007}
}
@inproceedings{CP:2007,
  author = {Rapha\"{e}l Clifford and Ely Porat},
  title = {A Filtering Algorithm for \textit{k}-Mismatch with Don't Cares},
  optcrossref = {},
  optkey = {},
  booktitle = {SPIRE '07: Proc. 14\textsuperscript{th} International Symp.
		  on String Processing and Information Retrieval},
  pages = {130--136},
  year = {2007}
}
@article{CP:2010,
  author = {Rapha{\"e}l Clifford and Ely Porat},
  title = {A Filtering Algorithm for \textit{k}-Mismatch with Don't Cares},
  journal = {Information Processing Letters},
  volume = {110},
  number = {22},
  year = {2010},
  pages = {1021-1025},
  pdf = {papers/filteringkmismatch-draft.pdf}
}
@inproceedings{CCCMW:2006,
  author = {Rapha\"{e}l Clifford and M. Christodoulakis and T. Crawford and D.
		  Meredith and G. Wiggins},
  title = {A Fast, Randomised, Maximal Subset Matching Algorithm for
		  Document-Level Music Retrieval},
  booktitle = {ISMIR '06: Proc. 7\textsuperscript{th} International Conference on Music Information Retrieval},
  pages = {150--155},
  year = {2006}
}
@inproceedings{CCI:2005,
  author = {Peter Clifford and Rapha\"{e}l Clifford and C.S. Iliopoulos},
  title = {Faster Algorithms for {$\delta$},{$\gamma$}-Matching and Related Problems},
  booktitle = {CPM '05: Proc. 16\textsuperscript{th} Annual Symp. on
		  Combinatorial Pattern Matching},
  pages = {68--78},
  year = {2005}
}
@article{CGIB:2005,
  author = {Rapha\"{e}l Clifford and R. Groult and C. Iliopoulos and R. Byrd},
  title = {Music Retrieval Algorithms for the Lead Sheet Problem},
  journal = {Journal of New Music Research},
  year = {2005},
  optkey = {},
  volume = {34},
  number = {4},
  pages = {311--317},
  optmonth = {},
  note = {},
  optannote = {}
}
@article{Clifford:2005,
  author = {Rapha\"{e}l Clifford},
  title = {Distributed suffix trees},
  journal = {Journal of Discrete Algorithms},
  year = {2005},
  optkey = {},
  volume = {3},
  number = {2--4},
  pages = {176--197},
  optmonth = {},
  optnote = {},
  optannote = {}
}
@article{Clifford:2007,
  author = {Peter Clifford and Rapha\"{e}l Clifford},
  title = {Simple Deterministic Wildcard Matching},
  journal = {Information Processing Letters},
  year = {2007},
  optkey = {},
  volume = {101},
  number = {2},
  pages = {53--54},
  optmonth = {},
  optnote = {},
  optannote = {}
}
@article{BCT:2008,
  author = {Michael A. Bender and Rapha\"{e}l Clifford and Kostas Tsichlas},
  title = {Scheduling algorithms for procrastinators},
  journal = {Journal of Scheduling},
  year = {2008},
  volume = {11},
  number = {2},
  pages = {95-104},
  eprint = {cs/0606067}
}
@article{ACILM:2008,
  author = {Y. Ardila and R. Clifford and C. S. Iliopoulos and G. M. Landau and M. Mohamed},
  title = {Necklace Swap Problem for Rhythmic Similarity Measures},
  journal = {International Journal of Computational Methods},
  year = {2008},
  volume = {5},
  number = {3},
  pages = {1-13}
}
@inproceedings{CPopa:2010,
  author = {Rapha{\"e}l Clifford and Alexandru Popa},
  title = {({I}n)approximability results for pattern matching problems},
  booktitle = {Prague Stringology Conference (PSC)},
  year = {2010},
  pages = {52-62}
}
@inproceedings{LCK:2006,
  author = {Inbok Lee and Rapha{\"e}l Clifford and Sung-Ryul Kim},
  title = {Algorithms on Extended $(\delta, \gamma)$-Matching},
  booktitle = {ICCSA'06: International Conference on Computational Science and its Applications},
  year = {2006},
  volume = {3},
  pages = {1137-1142}
}
@inproceedings{ACM:2005,
  author = {Y. Ardila and R. Clifford and M. Mohamed},
  title = {Necklace Swap Problem for Rhythmic Similarity Measures},
  booktitle = {SPIRE '05: Proc. 12\textsuperscript{th} International Symp.
		  on String Processing and Information Retrieval},
  year = {2005},
  pages = {234-245}
}
@article{montanaro07,
  author = {A. Montanaro},
  title = {Quantum walks on directed graphs},
  journal = {Quantum Information and Computation},
  volume = {7},
  number = {1},
  pages = {93--102},
  year = {2007},
  eprint = {quant-ph/0504116}
}
@article{montanaro07a,
  author = {A. Montanaro},
  title = {On the distinguishability of random quantum states},
  journal = {Communications in Mathematical Physics},
  volume = {273},
  number = {3},
  pages = {619--636},
  year = {2007},
  eprint = {quant-ph/0607011}
}
@inproceedings{montanaro07c,
  author = {A. Montanaro and A. Winter},
  title = {A lower bound on entanglement-assisted quantum communication complexity},
  booktitle = {Proc.\ {I}nternational {C}onference on {A}utomata, {L}anguages and {P}rogramming 2007 (ICALP'07)},
  pages = {122�-133},
  eprint = {quant-ph/0610085},
  year = {2007}
}
@inproceedings{montanaro08,
  author = {A. Montanaro},
  title = {A lower bound on the probability of error in quantum state discrimination},
  booktitle = {Proc.\ {IEEE} {I}nformation {T}heory {W}orkshop 2008},
  pages = {378--380},
  eprint = {0711.2012},
  year = {2008}
}
@inproceedings{montanaro08b,
  author = {A. Montanaro and H. Nishimura and R. Raymond},
  title = {Unbounded error quantum query complexity},
  booktitle = {Proc. 19th {I}nternational {S}ymposium on {A}lgorithms and {C}omputation (ISAAC 2008)},
  eprint = {0712.1446},
  year = {2008}
}
@article{cameron07,
  author = {P. J. Cameron and A. Montanaro and M. W. Newman and S. Severini and A. Winter},
  title = {On the quantum chromatic number of a graph},
  journal = {Electronic Journal of Combinatorics},
  volume = {14},
  number = {1},
  year = {2007},
  eprint = {quant-ph/0608016}
}
@article{cubitt08,
  author = {T. Cubitt and A. Montanaro and A. Winter},
  title = {On the dimension of subspaces with bounded {S}chmidt rank},
  journal = {Journal of Mathematical Physics},
  volume = {49},
  pages = {022107},
  year = {2008},
  eprint = {0706.0705}
}
@article{cubitt08a,
  author = {T. Cubitt and A. W. Harrow and D. Leung and A. Montanaro and A. Winter},
  title = {Counterexamples to additivity of minimum output $p$-{R}enyi entropy for $p$ close to 0},
  journal = {Communications in Mathematical Physics},
  volume = {284},
  pages = {281--290},
  eprint = {0712.3628},
  year = {2008}
}
@inproceedings{harrow10,
  author = {A. Harrow and A. Montanaro},
  title = {An efficient test for product states, with applications to quantum {M}erlin-{A}rthur games},
  booktitle = {Proc. Foundations of Computer Science 2010 (FOCS'10)},
  pages = {633--642},
  year = {2010},
  eprint = {1001.0017}
}
@inproceedings{harrow11,
  author = {A. W. Harrow and A. Montanaro and A. J. Short},
  title = {Limitations on quantum dimensionality reduction},
  booktitle = {Proc. International Conference on Automata, Languages and Programming 2010 (ICALP'10)},
  pages = {86--97},
  eprint = {1012.2262},
  year = {2011}
}
@article{harrow13,
  author = {A. Harrow and A. Montanaro},
  title = {Testing product states, quantum {M}erlin-{A}rthur games and tensor optimisation},
  journal = {J. ACM},
  volume = {60},
  number = {1},
  year = {2013},
  eprint = {1001.0017}
}
@article{montanaro09,
  author = {A. Montanaro},
  title = {Quantum algorithms for shifted subset problems},
  journal = {Quantum Information and Computation},
  volume = {9},
  number = {5{\&}6},
  pages = {500--512},
  eprint = {0806.3362},
  year = {2009}
}
@article{montanaro09b,
  author = {A. Montanaro},
  title = {Quantum search of partially ordered sets},
  journal = {Quantum Information and Computation},
  volume = {9},
  number = {7{\&}8},
  pages = {628--647},
  eprint = {quant-ph/0702196},
  year = {2009}
}
@inproceedings{montanaro10,
  author = {A. Montanaro},
  title = {Quantum search with advice},
  booktitle = {Proc. Theory of Quantum Computing 2010 (TQC'10)},
  eprint = {0908.3066},
  year = {2010}
}
@article{montanaro10b,
  author = {A. Montanaro},
  title = {Nonadaptive quantum query complexity},
  journal = {Information Processing Letters},
  volume = {110},
  number = {24},
  pages = {1110--1113},
  eprint = {1001.0018},
  year = {2010}
}
@article{montanaro10c,
  author = {A. Montanaro and T. Osborne},
  title = {Quantum boolean functions},
  journal = {Chicago Journal of Theoretical Computer Science},
  volume = {2010},
  eprint = {0810.2435},
  year = {2010}
}
@article{montanaro11,
  author = {A. Montanaro},
  title = {A new exponential separation between quantum and classical one-way communication complexity},
  journal = {Quantum Information and Computation},
  volume = {11},
  number = {7{\&}8},
  pages = {574--591},
  eprint = {1007.3587},
  year = {2011}
}
@article{montanaro12b,
  author = {A. Montanaro},
  title = {The quantum query complexity of learning multilinear polynomials},
  journal = {Information Processing Letters},
  volume = {112},
  number = {11},
  pages = {438--442},
  eprint = {1105.3310},
  year = {2012}
}
@article{montanaro12,
  author = {A. Montanaro},
  title = {Some applications of hypercontractive inequalities in quantum information theory},
  journal = {Journal of Mathematical Physics},
  volume = {53},
  pages = {122206},
  eprint = {1208.0161},
  year = {2012}
}
@article{montanaro12d,
  author = {A. Montanaro},
  title = {Almost all decision trees do not allow significant quantum speed-up},
  journal = {Chicago Journal of Theoretical Computer Science},
  volume = {2012},
  year = {2012},
  eprint = {1209.4781}
}
@article{montanaro13b,
  author = {A. Montanaro},
  title = {Weak multiplicativity for random quantum channels},
  journal = {Communications in Mathematical Physics},
  volume = {319},
  number = {2},
  pages = {535--555},
  eprint = {1112.5271},
  year = {2013}
}

This file was generated by bibtex2html 1.97.