Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Seth
    Last name: Pettie
    DBLP: 77/888
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 25 of 109  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Amir Abboud, Gregory Bodwin, Seth Pettie.
    A Hierarchy of Lower Bounds for Sublinear Additive Spanners.
    Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19 2017 (0) 2017
    Conference paper
    Ran Duan, Seth Pettie, Hsin-Hao Su.
    Scaling Algorithms for Weighted Matching in General Graphs.
    Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19 2017 (0) 2017
    Conference paper
    Ran Duan, Seth Pettie.
    Connectivity Oracles for Graphs Subject to Vertex Failures.
    Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19 2017 (0) 2017
    Conference paper
    Shang-En Huang, Dawei Huang, Tsvi Kopelowitz, Seth Pettie.
    Fully Dynamic Connectivity in
    Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19 2017 (0) 2017
    Conference paper
    Yi-Jun Chang, Seth Pettie.
    A Time Hierarchy Theorem for the LOCAL Model.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Shang-En Huang, Seth Pettie.
    Thorup-Zwick Emulators are Universally Optimal Hopsets.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie, Ruosong Wang, Wei Zhan.
    Exponential separations in the energy complexity of leader election.
    Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017 2017 (0) 2017
    Journal article
    Dawei Huang, Seth Pettie.
    Approximate Generalized Matching: $f$-Factors and $f$-Edge Covers.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Kai-Min Chung, Seth Pettie, Hsin-Hao Su.
    Distributed algorithms for the Lovász local lemma and graph coloring.
    Distributed Computing 2017, Volume 30 (0) 2017
    Conference paper
    Yi-Jun Chang, Qizheng He, Wenzheng Li, Seth Pettie, Jara Uitto.
    The Complexity of Distributed Edge Coloring with Small Palettes.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Tsvi Kopelowitz, Seth Pettie, Ely Porat.
    Higher Lower Bounds from the 3SUM Conjecture.
    Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016 2016 (0) 2016
    Conference paper
    Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie.
    An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Seth Pettie.
    Minimum Spanning Trees.
    Encyclopedia of Algorithms 2016 (0) 2016
    Conference paper
    Seth Pettie.
    Single-Source Shortest Paths.
    Encyclopedia of Algorithms 2016 (0) 2016
    Conference paper
    Seth Pettie.
    All Pairs Shortest Paths in Sparse Graphs.
    Encyclopedia of Algorithms 2016 (0) 2016
    Conference paper
    Michael A. Bender, Tsvi Kopelowitz, Seth Pettie, Maxwell Young.
    Contention resolution with log-logstar channel accesses.
    Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18-21, 2016 2016 (0) 2016
    Conference paper
    Amir Abboud, Gregory Bodwin, Seth Pettie.
    A Hierarchy of Lower Bounds for Sublinear Additive Spanners.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Ran Duan, Seth Pettie.
    Connectivity Oracles for Graphs Subject to Vertex Failures.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie.
    Brief Announcement: An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model.
    Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, PODC 2016, Chicago, IL, USA, July 25-28, 2016 2016 (0) 2016
    Conference paper
    Casper Kejlberg-Rasmussen, Tsvi Kopelowitz, Seth Pettie, Mikkel Thorup.
    Faster Worst Case Deterministic Dynamic Connectivity.
    24th Annual European Symposium on Algorithms, ESA 2016, August 22-24, 2016, Aarhus, Denmark 2016 (0) 2016
    Conference paper
    Leonid Barenboim, Michael Elkin, Seth Pettie, Johannes Schneider.
    The Locality of Distributed Symmetry Breaking.
    J. ACM 2016, Volume 63 (0) 2016
    Conference paper
    Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie, Ruosong Wang, Wei Zhan.
    How to Elect a Low-energy Leader.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Shang-En Huang, Dawei Huang, Tsvi Kopelowitz, Seth Pettie.
    Fully Dynamic Connectivity in O(log n(log log n)
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Michael Elkin, Seth Pettie.
    A Linear-Size Logarithmic Stretch Path-Reporting Distance Oracle for General Graphs.
    ACM Transactions on Algorithms 2016, Volume 12 (0) 2016
    Conference paper
    Julian Wellman, Seth Pettie.
    Lower Bounds on Davenport-Schinzel Sequences via Rectangular Zarankiewicz Matrices.
    CoRR 2016, Volume 0 (0) 2016
    Show item 1 to 25 of 109  

    Your query returned 109 matches in the database.