Works matching IS 14324350 AND DT 2017 AND VI 61 AND IP 2

Results: 17
    1

    Processing Succinct Matrices and Vectors.

    Published in:
    Theory of Computing Systems, 2017, v. 61, n. 2, p. 322, doi. 10.1007/s00224-015-9666-9
    By:
    • Lohrey, Markus;
    • Schmidt-Schauß, Manfred
    Publication type:
    Article
    2
    3
    4
    5
    6

    The Query Complexity of Witness Finding.

    Published in:
    Theory of Computing Systems, 2017, v. 61, n. 2, p. 305, doi. 10.1007/s00224-016-9708-y
    By:
    • Kawachi, Akinori;
    • Watanabe, Osamu;
    • Rossman, Benjamin
    Publication type:
    Article
    7
    8
    9

    Separation Logic with One Quantified Variable.

    Published in:
    Theory of Computing Systems, 2017, v. 61, n. 2, p. 371, doi. 10.1007/s00224-016-9713-1
    By:
    • Demri, Stéphane;
    • Galmiche, Didier;
    • Méry, Daniel;
    • Larchey-Wendling, Dominique
    Publication type:
    Article
    10

    On Compiling Structured CNFs to OBDDs.

    Published in:
    Theory of Computing Systems, 2017, v. 61, n. 2, p. 637, doi. 10.1007/s00224-016-9715-z
    By:
    • Bova, Simone;
    • Slivovsky, Friedrich
    Publication type:
    Article
    11
    12
    13

    Preface.

    Published in:
    2017
    By:
    • Bulatov, Andrei;
    • Hirsch, Edward;
    • Pin, Jean-Éric
    Publication type:
    Editorial
    14

    Optimizing Binary Heaps.

    Published in:
    Theory of Computing Systems, 2017, v. 61, n. 2, p. 606, doi. 10.1007/s00224-017-9760-2
    By:
    • Edelkamp, Stefan;
    • Elmasry, Amr;
    • Katajainen, Jyrki
    Publication type:
    Article
    15

    Rewriting Higher-Order Stack Trees.

    Published in:
    Theory of Computing Systems, 2017, v. 61, n. 2, p. 536, doi. 10.1007/s00224-017-9769-6
    By:
    • Penelle, Vincent
    Publication type:
    Article
    16
    17