A linear lower bound for incrementing a space-optimal integer representation in the bit-probe model

Research output: Research - peer-reviewArticle in proceedings

Documents

DOI

  • Mikhail Raskin
    Mikhail Raskin
Original languageEnglish
Title of host publication44th International Colloquium on Automata, Languages, and Programming, ICALP 2017
EditorsIoannis Chatzigiannakis, Piotr Indyk, Fabian Kuhn, Anca Muscholl
Number of pages12
Volume80
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Publication year2017
Pages88:1--88:12
Article number88
ISBN (Electronic)9783959770415
DOIs
StatePublished - 2017
Event44th International Colloquium on Automata, Languages, and Programming, ICALP 2017 - Warsaw, Poland
Duration: 10 Jul 201714 Jul 2017

Conference

Conference44th International Colloquium on Automata, Languages, and Programming, ICALP 2017
LandPoland
ByWarsaw
Periode10/07/201714/07/2017
SponsorAICA, Austrian, Department of Informatics, Sapienza University of Rome, Facebook, Microsoft, Microsoft Research
SeriesLeibniz International Proceedings in Informatics
Volume80
ISSN1868-8969

    Research areas

  • Binary counter, Bit-probe model, Data structure, Integer representation, Lower bound

See relations at Aarhus University Citationformats

ID: 118169313