Search dblp for Publications

export results for "toc:db/journals/jacm/jacm60.bht:"

 download as .bib file

@article{DBLP:journals/jacm/AlonY13,
  author       = {Noga Alon and
                  Raphael Yuster},
  title        = {Matrix sparsification and nested dissection over arbitrary fields},
  journal      = {J. {ACM}},
  volume       = {60},
  number       = {4},
  pages        = {25:1--25:18},
  year         = {2013},
  url          = {https://doi.org/10.1145/2508028.2505989},
  doi          = {10.1145/2508028.2505989},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/AlonY13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/AmelootNB13,
  author       = {Tom J. Ameloot and
                  Frank Neven and
                  Jan Van den Bussche},
  title        = {Relational transducers for declarative networking},
  journal      = {J. {ACM}},
  volume       = {60},
  number       = {2},
  pages        = {15:1--15:38},
  year         = {2013},
  url          = {https://doi.org/10.1145/2450142.2450151},
  doi          = {10.1145/2450142.2450151},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jacm/AmelootNB13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/AngelopoulosS13,
  author       = {Spyros Angelopoulos and
                  Pascal Schweitzer},
  title        = {Paging and list update under bijective analysis},
  journal      = {J. {ACM}},
  volume       = {60},
  number       = {2},
  pages        = {7:1--7:18},
  year         = {2013},
  url          = {https://doi.org/10.1145/2450142.2450143},
  doi          = {10.1145/2450142.2450143},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jacm/AngelopoulosS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/Arenas0R13,
  author       = {Marcelo Arenas and
                  Jorge P{\'{e}}rez and
                  Juan L. Reutter},
  title        = {Data exchange beyond complete data},
  journal      = {J. {ACM}},
  volume       = {60},
  number       = {4},
  pages        = {28:1--28:59},
  year         = {2013},
  url          = {https://doi.org/10.1145/2508028.2505985},
  doi          = {10.1145/2508028.2505985},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Arenas0R13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/BalcanBG13,
  author       = {Maria{-}Florina Balcan and
                  Avrim Blum and
                  Anupam Gupta},
  title        = {Clustering under approximation stability},
  journal      = {J. {ACM}},
  volume       = {60},
  number       = {2},
  pages        = {8:1--8:34},
  year         = {2013},
  url          = {https://doi.org/10.1145/2450142.2450144},
  doi          = {10.1145/2450142.2450144},
  timestamp    = {Wed, 18 Aug 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jacm/BalcanBG13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/BanerjeeN13,
  author       = {Anindya Banerjee and
                  David A. Naumann},
  title        = {Local Reasoning for Global Invariants, Part {II:} Dynamic Boundaries},
  journal      = {J. {ACM}},
  volume       = {60},
  number       = {3},
  pages        = {19:1--19:73},
  year         = {2013},
  url          = {https://doi.org/10.1145/2485981},
  doi          = {10.1145/2485981},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/BanerjeeN13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/BanerjeeNR13,
  author       = {Anindya Banerjee and
                  David A. Naumann and
                  Stan Rosenberg},
  title        = {Local Reasoning for Global Invariants, Part {I:} Region Logic},
  journal      = {J. {ACM}},
  volume       = {60},
  number       = {3},
  pages        = {18:1--18:56},
  year         = {2013},
  url          = {https://doi.org/10.1145/2485982},
  doi          = {10.1145/2485982},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/BanerjeeNR13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/BatuFRSW13,
  author       = {Tugkan Batu and
                  Lance Fortnow and
                  Ronitt Rubinfeld and
                  Warren D. Smith and
                  Patrick White},
  title        = {Testing Closeness of Discrete Distributions},
  journal      = {J. {ACM}},
  volume       = {60},
  number       = {1},
  pages        = {4:1--4:25},
  year         = {2013},
  url          = {https://doi.org/10.1145/2432622.2432626},
  doi          = {10.1145/2432622.2432626},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/BatuFRSW13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/BlumLR13,
  author       = {Avrim Blum and
                  Katrina Ligett and
                  Aaron Roth},
  title        = {A learning theory approach to noninteractive database privacy},
  journal      = {J. {ACM}},
  volume       = {60},
  number       = {2},
  pages        = {12:1--12:25},
  year         = {2013},
  url          = {https://doi.org/10.1145/2450142.2450148},
  doi          = {10.1145/2450142.2450148},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jacm/BlumLR13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/Bulatov13,
  author       = {Andrei A. Bulatov},
  title        = {The complexity of the counting constraint satisfaction problem},
  journal      = {J. {ACM}},
  volume       = {60},
  number       = {5},
  pages        = {34:1--34:41},
  year         = {2013},
  url          = {https://doi.org/10.1145/2528400},
  doi          = {10.1145/2528400},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Bulatov13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/BulatovDGJM13,
  author       = {Andrei A. Bulatov and
                  Martin E. Dyer and
                  Leslie Ann Goldberg and
                  Mark Jerrum and
                  Colin McQuillan},
  title        = {The expressibility of functions on the boolean domain, with applications
                  to counting CSPs},
  journal      = {J. {ACM}},
  volume       = {60},
  number       = {5},
  pages        = {32:1--32:36},
  year         = {2013},
  url          = {https://doi.org/10.1145/2528401},
  doi          = {10.1145/2528401},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/BulatovDGJM13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/ByrkaGRS13,
  author       = {Jaroslaw Byrka and
                  Fabrizio Grandoni and
                  Thomas Rothvo{\ss} and
                  Laura Sanit{\`{a}}},
  title        = {Steiner Tree Approximation via Iterative Randomized Rounding},
  journal      = {J. {ACM}},
  volume       = {60},
  number       = {1},
  pages        = {6:1--6:33},
  year         = {2013},
  url          = {https://doi.org/10.1145/2432622.2432628},
  doi          = {10.1145/2432622.2432628},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/ByrkaGRS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/ChazalGOS13,
  author       = {Fr{\'{e}}d{\'{e}}ric Chazal and
                  Leonidas J. Guibas and
                  Steve Y. Oudot and
                  Primoz Skraba},
  title        = {Persistence-Based Clustering in Riemannian Manifolds},
  journal      = {J. {ACM}},
  volume       = {60},
  number       = {6},
  pages        = {41:1--41:38},
  year         = {2013},
  url          = {https://doi.org/10.1145/2535927},
  doi          = {10.1145/2535927},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jacm/ChazalGOS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/CheungKL13,
  author       = {Ho Yee Cheung and
                  Tsz Chiu Kwok and
                  Lap Chi Lau},
  title        = {Fast matrix rank algorithms and applications},
  journal      = {J. {ACM}},
  volume       = {60},
  number       = {5},
  pages        = {31:1--31:25},
  year         = {2013},
  url          = {https://doi.org/10.1145/2528404},
  doi          = {10.1145/2528404},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/CheungKL13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/DrmotaS13,
  author       = {Michael Drmota and
                  Wojciech Szpankowski},
  title        = {A Master Theorem for Discrete Divide and Conquer Recurrences},
  journal      = {J. {ACM}},
  volume       = {60},
  number       = {3},
  pages        = {16:1--16:49},
  year         = {2013},
  url          = {https://doi.org/10.1145/2487241.2487242},
  doi          = {10.1145/2487241.2487242},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/DrmotaS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/DvorakKT13,
  author       = {Zdenek Dvor{\'{a}}k and
                  Daniel Kr{\'{a}}l and
                  Robin Thomas},
  title        = {Testing first-order properties for subclasses of sparse graphs},
  journal      = {J. {ACM}},
  volume       = {60},
  number       = {5},
  pages        = {36:1--36:24},
  year         = {2013},
  url          = {https://doi.org/10.1145/2499483},
  doi          = {10.1145/2499483},
  timestamp    = {Fri, 01 Dec 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/DvorakKT13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/FawziHS13,
  author       = {Omar Fawzi and
                  Patrick M. Hayden and
                  Pranab Sen},
  title        = {From Low-Distortion Norm Embeddings to Explicit Uncertainty Relations
                  and Efficient Information Locking},
  journal      = {J. {ACM}},
  volume       = {60},
  number       = {6},
  pages        = {44:1--44:61},
  year         = {2013},
  url          = {https://doi.org/10.1145/2518131},
  doi          = {10.1145/2518131},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jacm/FawziHS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/FraigniaudKP13,
  author       = {Pierre Fraigniaud and
                  Amos Korman and
                  David Peleg},
  title        = {Towards a complexity theory for local distributed computing},
  journal      = {J. {ACM}},
  volume       = {60},
  number       = {5},
  pages        = {35:1--35:26},
  year         = {2013},
  url          = {https://doi.org/10.1145/2499228},
  doi          = {10.1145/2499228},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/FraigniaudKP13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/GeorgiouGGK13,
  author       = {Chryssis Georgiou and
                  Seth Gilbert and
                  Rachid Guerraoui and
                  Dariusz R. Kowalski},
  title        = {Asynchronous gossip},
  journal      = {J. {ACM}},
  volume       = {60},
  number       = {2},
  pages        = {11:1--11:42},
  year         = {2013},
  url          = {https://doi.org/10.1145/2450142.2450147},
  doi          = {10.1145/2450142.2450147},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/GeorgiouGGK13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/GodoyG13,
  author       = {Guillem Godoy and
                  Omer Gim{\'{e}}nez},
  title        = {The {HOM} problem is decidable},
  journal      = {J. {ACM}},
  volume       = {60},
  number       = {4},
  pages        = {23:1--23:44},
  year         = {2013},
  url          = {https://doi.org/10.1145/2508028.2501600},
  doi          = {10.1145/2508028.2501600},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/GodoyG13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/GoosHS13,
  author       = {Mika G{\"{o}}{\"{o}}s and
                  Juho Hirvonen and
                  Jukka Suomela},
  title        = {Lower bounds for local approximation},
  journal      = {J. {ACM}},
  volume       = {60},
  number       = {5},
  pages        = {39:1--39:23},
  year         = {2013},
  url          = {https://doi.org/10.1145/2528405},
  doi          = {10.1145/2528405},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/GoosHS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/GottlobG13,
  author       = {Georg Gottlob and
                  Gianluigi Greco},
  title        = {Decomposing combinatorial auctions and set packing problems},
  journal      = {J. {ACM}},
  volume       = {60},
  number       = {4},
  pages        = {24:1--24:39},
  year         = {2013},
  url          = {https://doi.org/10.1145/2508028.2505987},
  doi          = {10.1145/2508028.2505987},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/GottlobG13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/GoyalOS13,
  author       = {Navin Goyal and
                  Neil Olver and
                  F. Bruce Shepherd},
  title        = {The {VPN} Conjecture Is True},
  journal      = {J. {ACM}},
  volume       = {60},
  number       = {3},
  pages        = {17:1--17:17},
  year         = {2013},
  url          = {https://doi.org/10.1145/2487241.2487243},
  doi          = {10.1145/2487241.2487243},
  timestamp    = {Sun, 22 Oct 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jacm/GoyalOS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/HansenMZ13,
  author       = {Thomas Dueholm Hansen and
                  Peter Bro Miltersen and
                  Uri Zwick},
  title        = {Strategy Iteration Is Strongly Polynomial for 2-Player Turn-Based
                  Stochastic Games with a Constant Discount Factor},
  journal      = {J. {ACM}},
  volume       = {60},
  number       = {1},
  pages        = {1:1--1:16},
  year         = {2013},
  url          = {https://doi.org/10.1145/2432622.2432623},
  doi          = {10.1145/2432622.2432623},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/HansenMZ13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/HarrowM13,
  author       = {Aram W. Harrow and
                  Ashley Montanaro},
  title        = {Testing Product States, Quantum Merlin-Arthur Games and Tensor Optimization},
  journal      = {J. {ACM}},
  volume       = {60},
  number       = {1},
  pages        = {3:1--3:43},
  year         = {2013},
  url          = {https://doi.org/10.1145/2432622.2432625},
  doi          = {10.1145/2432622.2432625},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jacm/HarrowM13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/HillarL13,
  author       = {Christopher J. Hillar and
                  Lek{-}Heng Lim},
  title        = {Most Tensor Problems Are NP-Hard},
  journal      = {J. {ACM}},
  volume       = {60},
  number       = {6},
  pages        = {45:1--45:39},
  year         = {2013},
  url          = {https://doi.org/10.1145/2512329},
  doi          = {10.1145/2512329},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jacm/HillarL13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/Kobayashi13,
  author       = {Naoki Kobayashi},
  title        = {Model Checking Higher-Order Programs},
  journal      = {J. {ACM}},
  volume       = {60},
  number       = {3},
  pages        = {20:1--20:62},
  year         = {2013},
  url          = {https://doi.org/10.1145/2487241.2487246},
  doi          = {10.1145/2487241.2487246},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jacm/Kobayashi13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/KolaitisK13,
  author       = {Phokion G. Kolaitis and
                  Swastik Kopparty},
  title        = {Random graphs and the parity quantifier},
  journal      = {J. {ACM}},
  volume       = {60},
  number       = {5},
  pages        = {37:1--37:34},
  year         = {2013},
  url          = {https://doi.org/10.1145/2528402},
  doi          = {10.1145/2528402},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/KolaitisK13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/KolmogorovZ13,
  author       = {Vladimir Kolmogorov and
                  Stanislav Zivn{\'{y}}},
  title        = {The complexity of conservative valued CSPs},
  journal      = {J. {ACM}},
  volume       = {60},
  number       = {2},
  pages        = {10:1--10:38},
  year         = {2013},
  url          = {https://doi.org/10.1145/2450142.2450146},
  doi          = {10.1145/2450142.2450146},
  timestamp    = {Mon, 03 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jacm/KolmogorovZ13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/Laird13,
  author       = {James Laird},
  title        = {Game semantics for a polymorphic programming language},
  journal      = {J. {ACM}},
  volume       = {60},
  number       = {4},
  pages        = {29:1--29:27},
  year         = {2013},
  url          = {https://doi.org/10.1145/2508028.2505986},
  doi          = {10.1145/2508028.2505986},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Laird13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/Levin13,
  author       = {Leonid A. Levin},
  title        = {Forbidden information},
  journal      = {J. {ACM}},
  volume       = {60},
  number       = {2},
  pages        = {9:1--9:9},
  year         = {2013},
  url          = {https://doi.org/10.1145/2450142.2450145},
  doi          = {10.1145/2450142.2450145},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Levin13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/LyubashevskyPR13,
  author       = {Vadim Lyubashevsky and
                  Chris Peikert and
                  Oded Regev},
  title        = {On Ideal Lattices and Learning with Errors over Rings},
  journal      = {J. {ACM}},
  volume       = {60},
  number       = {6},
  pages        = {43:1--43:35},
  year         = {2013},
  url          = {https://doi.org/10.1145/2535925},
  doi          = {10.1145/2535925},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/LyubashevskyPR13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/Marx13,
  author       = {D{\'{a}}niel Marx},
  title        = {Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive
                  Queries},
  journal      = {J. {ACM}},
  volume       = {60},
  number       = {6},
  pages        = {42:1--42:51},
  year         = {2013},
  url          = {https://doi.org/10.1145/2535926},
  doi          = {10.1145/2535926},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Marx13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/PeresSSZ13,
  author       = {Yuval Peres and
                  Dmitry Sotnikov and
                  Benny Sudakov and
                  Uri Zwick},
  title        = {All-pairs shortest paths in \emph{O}(\emph{n}\({}^{\mbox{2}}\)) time
                  with high probability},
  journal      = {J. {ACM}},
  volume       = {60},
  number       = {4},
  pages        = {26:1--26:25},
  year         = {2013},
  url          = {https://doi.org/10.1145/2508028.2505988},
  doi          = {10.1145/2508028.2505988},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/PeresSSZ13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/Raz13,
  author       = {Ran Raz},
  title        = {Tensor-Rank and Lower Bounds for Arithmetic Formulas},
  journal      = {J. {ACM}},
  volume       = {60},
  number       = {6},
  pages        = {40:1--40:15},
  year         = {2013},
  url          = {https://doi.org/10.1145/2535928},
  doi          = {10.1145/2535928},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jacm/Raz13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/SarmaNPT13,
  author       = {Atish Das Sarma and
                  Danupon Nanongkai and
                  Gopal Pandurangan and
                  Prasad Tetali},
  title        = {Distributed Random Walks},
  journal      = {J. {ACM}},
  volume       = {60},
  number       = {1},
  pages        = {2:1--2:31},
  year         = {2013},
  url          = {https://doi.org/10.1145/2432622.2432624},
  doi          = {10.1145/2432622.2432624},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jacm/SarmaNPT13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/SaxenaS13,
  author       = {Nitin Saxena and
                  C. Seshadhri},
  title        = {From sylvester-gallai configurations to rank bounds: Improved blackbox
                  identity test for depth-3 circuits},
  journal      = {J. {ACM}},
  volume       = {60},
  number       = {5},
  pages        = {33:1--33:33},
  year         = {2013},
  url          = {https://doi.org/10.1145/2528403},
  doi          = {10.1145/2528403},
  timestamp    = {Thu, 07 Jul 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jacm/SaxenaS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/SeshadhriPK13,
  author       = {C. Seshadhri and
                  Ali Pinar and
                  Tamara G. Kolda},
  title        = {An in-depth analysis of stochastic Kronecker graphs},
  journal      = {J. {ACM}},
  volume       = {60},
  number       = {2},
  pages        = {13:1--13:32},
  year         = {2013},
  url          = {https://doi.org/10.1145/2450142.2450149},
  doi          = {10.1145/2450142.2450149},
  timestamp    = {Thu, 07 Jul 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jacm/SeshadhriPK13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/SevcikVNJS13,
  author       = {Jaroslav Sevc{\'{\i}}k and
                  Viktor Vafeiadis and
                  Francesco Zappa Nardelli and
                  Suresh Jagannathan and
                  Peter Sewell},
  title        = {CompCertTSO: {A} Verified Compiler for Relaxed-Memory Concurrency},
  journal      = {J. {ACM}},
  volume       = {60},
  number       = {3},
  pages        = {22:1--22:50},
  year         = {2013},
  url          = {https://doi.org/10.1145/2487241.2487248},
  doi          = {10.1145/2487241.2487248},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jacm/SevcikVNJS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/Vianu13,
  author       = {Victor Vianu},
  title        = {Invited Article Foreword},
  journal      = {J. {ACM}},
  volume       = {60},
  number       = {1},
  pages        = {5:1},
  year         = {2013},
  url          = {https://doi.org/10.1145/2432622.2432627},
  doi          = {10.1145/2432622.2432627},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Vianu13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/Vianu13a,
  author       = {Victor Vianu},
  title        = {Invited article foreword},
  journal      = {J. {ACM}},
  volume       = {60},
  number       = {2},
  pages        = {14:1},
  year         = {2013},
  url          = {https://doi.org/10.1145/2450142.2450150},
  doi          = {10.1145/2450142.2450150},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Vianu13a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/Vianu13b,
  author       = {Victor Vianu},
  title        = {Invited Article Foreword},
  journal      = {J. {ACM}},
  volume       = {60},
  number       = {3},
  pages        = {21:1},
  year         = {2013},
  url          = {https://doi.org/10.1145/2487241.2487247},
  doi          = {10.1145/2487241.2487247},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Vianu13b.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/Vianu13c,
  author       = {Victor Vianu},
  title        = {Invited articles foreword},
  journal      = {J. {ACM}},
  volume       = {60},
  number       = {4},
  pages        = {27:1},
  year         = {2013},
  url          = {https://doi.org/10.1145/2508028.2508032},
  doi          = {10.1145/2508028.2508032},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Vianu13c.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/Vianu13d,
  author       = {Victor Vianu},
  title        = {Editorial: {JACM} redux},
  journal      = {J. {ACM}},
  volume       = {60},
  number       = {5},
  pages        = {30:1--30:2},
  year         = {2013},
  url          = {https://doi.org/10.1145/2528384.2528385},
  doi          = {10.1145/2528384.2528385},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Vianu13d.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/Vianu13e,
  author       = {Victor Vianu},
  title        = {Invited article foreword},
  journal      = {J. {ACM}},
  volume       = {60},
  number       = {5},
  pages        = {38:1},
  year         = {2013},
  url          = {https://doi.org/10.1145/2528384.2528386},
  doi          = {10.1145/2528384.2528386},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Vianu13e.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.