BibTeX records: Ivan Mihajlin

download as .bib file

@inproceedings{DBLP:conf/coco/CarmosinoILM18,
  author    = {Marco L. Carmosino and
               Russell Impagliazzo and
               Shachar Lovett and
               Ivan Mihajlin},
  title     = {Hardness Amplification for Non-Commutative Arithmetic Circuits},
  booktitle = {33rd Computational Complexity Conference, {CCC} 2018, June 22-24,
               2018, San Diego, CA, {USA}},
  pages     = {12:1--12:16},
  year      = {2018},
  crossref  = {DBLP:conf/coco/2018},
  url       = {https://doi.org/10.4230/LIPIcs.CCC.2018.12},
  doi       = {10.4230/LIPIcs.CCC.2018.12},
  timestamp = {Mon, 04 Jun 2018 18:10:04 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/coco/CarmosinoILM18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HooverIMS18,
  author    = {Kenneth Hoover and
               Russell Impagliazzo and
               Ivan Mihajlin and
               Alexander Smal},
  title     = {Half-duplex communication complexity},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {25},
  pages     = {89},
  year      = {2018},
  url       = {https://eccc.weizmann.ac.il/report/2018/089},
  timestamp = {Tue, 22 May 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/HooverIMS18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/CarmosinoILM18,
  author    = {Marco Carmosino and
               Russell Impagliazzo and
               Shachar Lovett and
               Ivan Mihajlin},
  title     = {Hardness Amplification for Non-Commutative Arithmetic Circuits},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {25},
  pages     = {95},
  year      = {2018},
  url       = {https://eccc.weizmann.ac.il/report/2018/095},
  timestamp = {Tue, 22 May 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/CarmosinoILM18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CyganFGKMPS17,
  author    = {Marek Cygan and
               Fedor V. Fomin and
               Alexander Golovnev and
               Alexander S. Kulikov and
               Ivan Mihajlin and
               Jakub Pachocki and
               Arkadiusz Socala},
  title     = {Tight Lower Bounds on Graph Embedding Problems},
  journal   = {J. {ACM}},
  volume    = {64},
  number    = {3},
  pages     = {18:1--18:22},
  year      = {2017},
  url       = {http://doi.acm.org/10.1145/3051094},
  doi       = {10.1145/3051094},
  timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/jacm/CyganFGKMPS17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GolovnevKM16,
  author    = {Alexander Golovnev and
               Alexander S. Kulikov and
               Ivan Mihajlin},
  title     = {Families with Infants: Speeding Up Algorithms for NP-Hard Problems
               Using {FFT}},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {3},
  pages     = {35:1--35:17},
  year      = {2016},
  url       = {http://doi.acm.org/10.1145/2847419},
  doi       = {10.1145/2847419},
  timestamp = {Tue, 03 Jan 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/talg/GolovnevKM16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/CarmosinoGIMPS16,
  author    = {Marco L. Carmosino and
               Jiawei Gao and
               Russell Impagliazzo and
               Ivan Mihajlin and
               Ramamohan Paturi and
               Stefan Schneider},
  title     = {Nondeterministic Extensions of the Strong Exponential Time Hypothesis
               and Consequences for Non-reducibility},
  booktitle = {Proceedings of the 2016 {ACM} Conference on Innovations in Theoretical
               Computer Science, Cambridge, MA, USA, January 14-16, 2016},
  pages     = {261--270},
  year      = {2016},
  crossref  = {DBLP:conf/innovations/2016},
  url       = {http://doi.acm.org/10.1145/2840728.2840746},
  doi       = {10.1145/2840728.2840746},
  timestamp = {Mon, 18 Jan 2016 19:44:01 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/innovations/CarmosinoGIMPS16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CyganFGKMPS16,
  author    = {Marek Cygan and
               Fedor V. Fomin and
               Alexander Golovnev and
               Alexander S. Kulikov and
               Ivan Mihajlin and
               Jakub Pachocki and
               Arkadiusz Socala},
  title     = {Tight Bounds for Graph Homomorphism and Subgraph Isomorphism},
  booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
  pages     = {1643--1649},
  year      = {2016},
  crossref  = {DBLP:conf/soda/2016},
  url       = {https://doi.org/10.1137/1.9781611974331.ch112},
  doi       = {10.1137/1.9781611974331.ch112},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/CyganFGKMPS16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CyganFGKMPS16,
  author    = {Marek Cygan and
               Fedor V. Fomin and
               Alexander Golovnev and
               Alexander S. Kulikov and
               Ivan Mihajlin and
               Jakub W. Pachocki and
               Arkadiusz Socala},
  title     = {Tight Lower Bounds on Graph Embedding Problems},
  journal   = {CoRR},
  volume    = {abs/1602.05016},
  year      = {2016},
  url       = {http://arxiv.org/abs/1602.05016},
  archivePrefix = {arXiv},
  eprint    = {1602.05016},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/CyganFGKMPS16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/DemenkovKMM15,
  author    = {Evgeny Demenkov and
               Alexander S. Kulikov and
               Olga Melanich and
               Ivan Mihajlin},
  title     = {New Lower Bounds on Circuit Size of Multi-output Functions},
  journal   = {Theory Comput. Syst.},
  volume    = {56},
  number    = {4},
  pages     = {630--642},
  year      = {2015},
  url       = {https://doi.org/10.1007/s00224-014-9590-4},
  doi       = {10.1007/s00224-014-9590-4},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/mst/DemenkovKMM15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/FominGKM15,
  author    = {Fedor V. Fomin and
               Alexander Golovnev and
               Alexander S. Kulikov and
               Ivan Mihajlin},
  title     = {Lower Bounds for the Graph Homomorphism Problem},
  booktitle = {Automata, Languages, and Programming - 42nd International Colloquium,
               {ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {I}},
  pages     = {481--493},
  year      = {2015},
  crossref  = {DBLP:conf/icalp/2015-1},
  url       = {https://doi.org/10.1007/978-3-662-47672-7\_39},
  doi       = {10.1007/978-3-662-47672-7\_39},
  timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/FominGKM15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FominGKM15,
  author    = {Fedor V. Fomin and
               Alexander Golovnev and
               Alexander S. Kulikov and
               Ivan Mihajlin},
  title     = {Lower Bounds for the Graph Homomorphism Problem},
  journal   = {CoRR},
  volume    = {abs/1502.05447},
  year      = {2015},
  url       = {http://arxiv.org/abs/1502.05447},
  archivePrefix = {arXiv},
  eprint    = {1502.05447},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/FominGKM15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FominGKM15a,
  author    = {Fedor V. Fomin and
               Alexander Golovnev and
               Alexander S. Kulikov and
               Ivan Mihajlin},
  title     = {Tight Bounds for Subgraph Isomorphism and Graph Homomorphism},
  journal   = {CoRR},
  volume    = {abs/1507.03738},
  year      = {2015},
  url       = {http://arxiv.org/abs/1507.03738},
  archivePrefix = {arXiv},
  eprint    = {1507.03738},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/FominGKM15a},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/CarmosinoGIMPS15,
  author    = {Marco Carmosino and
               Jiawei Gao and
               Russell Impagliazzo and
               Ivan Mihajlin and
               Ramamohan Paturi and
               Stefan Schneider},
  title     = {Nondeterministic extensions of the Strong Exponential Time Hypothesis
               and consequences for non-reducibility},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {22},
  pages     = {148},
  year      = {2015},
  url       = {http://eccc.hpi-web.de/report/2015/148},
  timestamp = {Tue, 28 Nov 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/CarmosinoGIMPS15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GolovnevKM14,
  author    = {Alexander Golovnev and
               Alexander S. Kulikov and
               Ivan Mihajlin},
  title     = {Solving {SCS} for bounded length strings in fewer than 2\({}^{\mbox{n}}\)
               steps},
  journal   = {Inf. Process. Lett.},
  volume    = {114},
  number    = {8},
  pages     = {421--425},
  year      = {2014},
  url       = {https://doi.org/10.1016/j.ipl.2014.03.004},
  doi       = {10.1016/j.ipl.2014.03.004},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ipl/GolovnevKM14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GolovnevKM14,
  author    = {Alexander Golovnev and
               Alexander S. Kulikov and
               Ivan Mihajlin},
  title     = {Families with Infants: {A} General Approach to Solve Hard Partition
               Problems},
  booktitle = {Automata, Languages, and Programming - 41st International Colloquium,
               {ICALP} 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part
               {I}},
  pages     = {551--562},
  year      = {2014},
  crossref  = {DBLP:conf/icalp/2014-1},
  url       = {https://doi.org/10.1007/978-3-662-43948-7\_46},
  doi       = {10.1007/978-3-662-43948-7\_46},
  timestamp = {Tue, 23 May 2017 01:08:20 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/GolovnevKM14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GolovnevKM14,
  author    = {Alexander Golovnev and
               Alexander S. Kulikov and
               Ivan Mihajlin},
  title     = {Families with infants: speeding up algorithms for NP-hard problems
               using {FFT}},
  journal   = {CoRR},
  volume    = {abs/1410.2209},
  year      = {2014},
  url       = {http://arxiv.org/abs/1410.2209},
  archivePrefix = {arXiv},
  eprint    = {1410.2209},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/GolovnevKM14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/GolovnevKM13,
  author    = {Alexander Golovnev and
               Alexander S. Kulikov and
               Ivan Mihajlin},
  title     = {Approximating Shortest Superstring Problem Using de Bruijn Graphs},
  booktitle = {Combinatorial Pattern Matching, 24th Annual Symposium, {CPM} 2013,
               Bad Herrenalb, Germany, June 17-19, 2013. Proceedings},
  pages     = {120--129},
  year      = {2013},
  crossref  = {DBLP:conf/cpm/2013},
  url       = {https://doi.org/10.1007/978-3-642-38905-4\_13},
  doi       = {10.1007/978-3-642-38905-4\_13},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cpm/GolovnevKM13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/GolovnevKM13,
  author    = {Alexander Golovnev and
               Alexander S. Kulikov and
               Ivan Mihajlin},
  title     = {Solving 3-Superstring in 3 n/3 Time},
  booktitle = {Mathematical Foundations of Computer Science 2013 - 38th International
               Symposium, {MFCS} 2013, Klosterneuburg, Austria, August 26-30, 2013.
               Proceedings},
  pages     = {480--491},
  year      = {2013},
  crossref  = {DBLP:conf/mfcs/2013},
  url       = {https://doi.org/10.1007/978-3-642-40313-2\_43},
  doi       = {10.1007/978-3-642-40313-2\_43},
  timestamp = {Thu, 15 Jun 2017 21:43:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/mfcs/GolovnevKM13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GolovnevKM13,
  author    = {Alexander Golovnev and
               Alexander S. Kulikov and
               Ivan Mihajlin},
  title     = {Families with infants: a general approach to solve hard partition
               problems},
  journal   = {CoRR},
  volume    = {abs/1311.2456},
  year      = {2013},
  url       = {http://arxiv.org/abs/1311.2456},
  archivePrefix = {arXiv},
  eprint    = {1311.2456},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/GolovnevKM13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cie/KulikovMM12,
  author    = {Alexander S. Kulikov and
               Olga Melanich and
               Ivan Mihajlin},
  title     = {A 5n - o(n) Lower Bound on the Circuit Size over {U} 2 of a Linear
               Boolean Function},
  booktitle = {How the World Computes - Turing Centenary Conference and 8th Conference
               on Computability in Europe, CiE 2012, Cambridge, UK, June 18-23, 2012.
               Proceedings},
  pages     = {432--439},
  year      = {2012},
  crossref  = {DBLP:conf/cie/2012},
  url       = {https://doi.org/10.1007/978-3-642-30870-3\_44},
  doi       = {10.1007/978-3-642-30870-3\_44},
  timestamp = {Fri, 02 Jun 2017 20:50:24 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cie/KulikovMM12},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/DemenkovKMM12,
  author    = {Evgeny Demenkov and
               Alexander S. Kulikov and
               Ivan Mihajlin and
               Hiroki Morizumi},
  title     = {Computing All MOD-Functions Simultaneously},
  booktitle = {Computer Science - Theory and Applications - 7th International Computer
               Science Symposium in Russia, {CSR} 2012, Nizhny Novgorod, Russia,
               July 3-7, 2012. Proceedings},
  pages     = {81--88},
  year      = {2012},
  crossref  = {DBLP:conf/csr/2012},
  url       = {https://doi.org/10.1007/978-3-642-30642-6\_9},
  doi       = {10.1007/978-3-642-30642-6\_9},
  timestamp = {Tue, 19 Jun 2018 12:26:30 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/csr/DemenkovKMM12},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/2018,
  editor    = {Rocco A. Servedio},
  title     = {33rd Computational Complexity Conference, {CCC} 2018, June 22-24,
               2018, San Diego, CA, {USA}},
  series    = {LIPIcs},
  volume    = {102},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2018},
  url       = {http://www.dagstuhl.de/dagpub/978-3-95977-069-9},
  isbn      = {978-3-95977-069-9},
  timestamp = {Mon, 04 Jun 2018 18:10:04 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/coco/2018},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/innovations/2016,
  editor    = {Madhu Sudan},
  title     = {Proceedings of the 2016 {ACM} Conference on Innovations in Theoretical
               Computer Science, Cambridge, MA, USA, January 14-16, 2016},
  publisher = {{ACM}},
  year      = {2016},
  url       = {http://dl.acm.org/citation.cfm?id=2840728},
  isbn      = {978-1-4503-4057-1},
  timestamp = {Mon, 18 Jan 2016 19:44:01 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/innovations/2016},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2016,
  editor    = {Robert Krauthgamer},
  title     = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
  publisher = {{SIAM}},
  year      = {2016},
  url       = {https://doi.org/10.1137/1.9781611974331},
  doi       = {10.1137/1.9781611974331},
  isbn      = {978-1-61197-433-1},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/2016},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/icalp/2015-1,
  editor    = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
               Kazuo Iwama and
               Naoki Kobayashi and
               Bettina Speckmann},
  title     = {Automata, Languages, and Programming - 42nd International Colloquium,
               {ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {I}},
  series    = {Lecture Notes in Computer Science},
  volume    = {9134},
  publisher = {Springer},
  year      = {2015},
  url       = {https://doi.org/10.1007/978-3-662-47672-7},
  doi       = {10.1007/978-3-662-47672-7},
  isbn      = {978-3-662-47671-0},
  timestamp = {Tue, 23 May 2017 01:08:27 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/2015-1},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/icalp/2014-1,
  editor    = {Javier Esparza and
               Pierre Fraigniaud and
               Thore Husfeldt and
               Elias Koutsoupias},
  title     = {Automata, Languages, and Programming - 41st International Colloquium,
               {ICALP} 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part
               {I}},
  series    = {Lecture Notes in Computer Science},
  volume    = {8572},
  publisher = {Springer},
  year      = {2014},
  url       = {https://doi.org/10.1007/978-3-662-43948-7},
  doi       = {10.1007/978-3-662-43948-7},
  isbn      = {978-3-662-43947-0},
  timestamp = {Tue, 23 May 2017 01:08:20 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/2014-1},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cpm/2013,
  editor    = {Johannes Fischer and
               Peter Sanders},
  title     = {Combinatorial Pattern Matching, 24th Annual Symposium, {CPM} 2013,
               Bad Herrenalb, Germany, June 17-19, 2013. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {7922},
  publisher = {Springer},
  year      = {2013},
  url       = {https://doi.org/10.1007/978-3-642-38905-4},
  doi       = {10.1007/978-3-642-38905-4},
  isbn      = {978-3-642-38904-7},
  timestamp = {Fri, 26 May 2017 00:50:18 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cpm/2013},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/mfcs/2013,
  editor    = {Krishnendu Chatterjee and
               Jir{\'{\i}} Sgall},
  title     = {Mathematical Foundations of Computer Science 2013 - 38th International
               Symposium, {MFCS} 2013, Klosterneuburg, Austria, August 26-30, 2013.
               Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {8087},
  publisher = {Springer},
  year      = {2013},
  url       = {https://doi.org/10.1007/978-3-642-40313-2},
  doi       = {10.1007/978-3-642-40313-2},
  isbn      = {978-3-642-40312-5},
  timestamp = {Thu, 15 Jun 2017 21:43:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/mfcs/2013},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cie/2012,
  editor    = {S. Barry Cooper and
               Anuj Dawar and
               Benedikt L{\"{o}}we},
  title     = {How the World Computes - Turing Centenary Conference and 8th Conference
               on Computability in Europe, CiE 2012, Cambridge, UK, June 18-23, 2012.
               Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {7318},
  publisher = {Springer},
  year      = {2012},
  url       = {https://doi.org/10.1007/978-3-642-30870-3},
  doi       = {10.1007/978-3-642-30870-3},
  isbn      = {978-3-642-30869-7},
  timestamp = {Fri, 02 Jun 2017 20:50:24 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cie/2012},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/csr/2012,
  editor    = {Edward A. Hirsch and
               Juhani Karhum{\"{a}}ki and
               Arto Lepist{\"{o}} and
               Michail Kh. Prilutskii},
  title     = {Computer Science - Theory and Applications - 7th International Computer
               Science Symposium in Russia, {CSR} 2012, Nizhny Novgorod, Russia,
               July 3-7, 2012. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {7353},
  publisher = {Springer},
  year      = {2012},
  url       = {https://doi.org/10.1007/978-3-642-30642-6},
  doi       = {10.1007/978-3-642-30642-6},
  isbn      = {978-3-642-30641-9},
  timestamp = {Tue, 19 Jun 2018 12:26:30 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/csr/2012},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
maintained by Schloss Dagstuhl LZI at University of Trier