Fast spectral primitives for directed graphs
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2019
Main Author: | Peebles, John Lee Thompson,Jr. |
---|---|
Other Authors: | Jonathan A. Kelner and Ronitt Rubinfeld. |
Format: | Thesis |
Language: | eng |
Published: |
Massachusetts Institute of Technology
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/1721.1/124075 |
Similar Items
-
Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs
by: Peng, Richard, et al.
Published: (2018) -
Control primitives for fast helicopter maneuvers
by: Perk Barıṣ Eren
Published: (2007) -
Sublinear-time algorithms for counting star subgraphs with applications to join selectivity estimation
by: Peebles, John Lee Thompson, Jr
Published: (2016) -
Standards for graph algorithm primitives
by: Mattson, Tim, et al.
Published: (2014) -
Constructive synthesis of optimized cryptographic primitives
by: Sloan, Robert M., Jr
Published: (2018)