{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T18:59:03Z","timestamp":1775242743396,"version":"3.50.1"},"reference-count":358,"publisher":"Emerald","issue":"1-2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,5,30]]},"abstract":"<jats:p>In the age of Big Data, efficient algorithms are now in higher demand more than ever before. While Big Data takes us into the asymptotic world envisioned by our pioneers, it also challenges the classical notion of efficient algorithms: Algorithms that used to be considered efficient, according to polynomial-time characterization, may no longer be adequate for solving today?s problems. It is not just desirable, but essential, that efficient algorithms should be scalable. In other words, their complexity should be nearly linear or sub-linear with respect to the problem size. Thus, scalability, not just polynomial-time computability, should be elevated as the central complexity notion for characterizing efficient computation.<\/jats:p>\n                  <jats:p>In this tutorial, I will survey a family of algorithmic techniques for the design of provably-good scalable algorithms. These techniques include local network exploration, advanced sampling, sparsification, and geometric partitioning. They also include spectral graph-theoretical methods, such as those used for computing electrical flows and sampling from Gaussian Markov random fields. These methods exemplify the fusion of combinatorial, numerical, and statistical thinking in network analysis. I will illustrate the use of these techniques by a few basic problems that are fundamental in network analysis, particularly for the identification of significant nodes and coherent clusters\/communities in social and information networks. I also take this opportunity to discuss some frameworks beyond graph-theoretical models for studying conceptual questions to understand multifaceted network data that arise in social influence, network dynamics, and Internet economics.<\/jats:p>","DOI":"10.1561\/0400000051","type":"journal-article","created":{"date-parts":[[2016,5,30]],"date-time":"2016-05-30T11:35:42Z","timestamp":1464608142000},"page":"1-274","source":"Crossref","is-referenced-by-count":70,"title":["Scalable Algorithms for Data and Network Analysis"],"prefix":"10.1561","volume":"12","author":[{"given":"Shang-Hua","family":"Teng","sequence":"first","affiliation":[{"name":"Computer Science and Mathematics, University of Southern California"}]}],"member":"140","published-online":{"date-parts":[[2016,5,30]]},"reference":[{"key":"2026040314123671200_ref001","article-title":"E\u02dacient computation of the Shapley value for centrality in networks","author":"Aadithya","journal-title":"Internet and Network Economics"},{"key":"2026040314123671200_ref002","article-title":"Community detection in general stochastic block models: fundamental limits and e\u02dacient recovery algorithms","author":"Abbe","journal-title":"CoRR"},{"key":"2026040314123671200_ref003","article-title":"Recovering communities in the general stochastic block model without knowing the parameters","author":"Abbe","journal-title":"CoRR"},{"key":"2026040314123671200_ref004","article-title":"Combinatorial auctions with restricted complements","author":"Abraham","journal-title":"Proceedings of the 13th ACM Conference on Electronic Commerce"},{"key":"2026040314123671200_ref005","article-title":"Nearly tight low stretch spanning trees","author":"Abraham","journal-title":"Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science"},{"key":"2026040314123671200_ref006","article-title":"PRIMES is in P","author":"Agrawal","journal-title":"Annals of Mathematics"},{"key":"2026040314123671200_ref007","author":"Aho","journal-title":"The Design and Analysis of Computer Algorithms"},{"key":"2026040314123671200_ref008","author":"Ahuja"},{"key":"2026040314123671200_ref009","author":"Aldous","journal-title":"Reversible Markov chains and random walks on graphs"},{"key":"2026040314123671200_ref010","article-title":"Problems and results in extremal combinatorics - I","author":"Alon","journal-title":"Discrete Mathematics"},{"key":"2026040314123671200_ref011","article-title":"A graph-theoretic game and its application to the k-server problem","author":"Alon","journal-title":"SIAM Journal on Computing"},{"key":"2026040314123671200_ref012","author":"Alon"},{"key":"2026040314123671200_ref013","article-title":"A separator theorem for graphs with an excluded minor and its applications","author":"Alon","journal-title":"Proceedings of the 22nd Annual ACM Symposium on Theory of Computing"},{"key":"2026040314123671200_ref014","author":"Alon"},{"key":"2026040314123671200_ref015","article-title":"Ranking systems: The PageRank axioms","author":"Altman","journal-title":"Proceedings of the 6th ACM Conference on Electronic Commerce"},{"key":"2026040314123671200_ref016","article-title":"An O(N log N) fast direct solver for partial hierarchically semi-separable matrices","author":"Ambikasaran","journal-title":"Journal of Scienti\ufb01c Computing"},{"key":"2026040314123671200_ref017","article-title":"Regression depth and center points","author":"Amenta","journal-title":"Discrete & Computational Geometry"},{"key":"2026040314123671200_ref018","article-title":"A local algorithm for \ufb01nding dense subgraphs","author":"Andersen","journal-title":"ACM Transactions on Algorithms"},{"key":"2026040314123671200_ref019","article-title":"Trust-based recommendation systems: An axiomatic approach","author":"Andersen","journal-title":"Proceedings of the 17th International Conference on World Wide Web"},{"key":"2026040314123671200_ref020","article-title":"Robust PageRank and locally computable spam detection features","author":"Andersen","journal-title":"Proceedings of the 4th International Workshop on Adversarial Information Retrieval on the Web"},{"key":"2026040314123671200_ref021","article-title":"Local computation of PageRank contributions","author":"Andersen","journal-title":"Internet Mathematics"},{"key":"2026040314123671200_ref022","doi-asserted-by":"crossref","article-title":"Using PageRank to locally partition a graph","author":"Andersen","DOI":"10.1080\/15427951.2007.10129139"},{"key":"2026040314123671200_ref023","article-title":"Almost optimal local graph clustering using evolving sets","author":"Andersen","journal-title":"Journal of the ACM"},{"key":"2026040314123671200_ref024","article-title":"Finding sparse cuts locally using evolving sets","author":"Andersen","journal-title":"Proceedings of the 41st Annual ACM Symposium on Theory of Computing"},{"key":"2026040314123671200_ref025","article-title":"Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions","author":"Andoni","journal-title":"Communications of the ACM"},{"key":"2026040314123671200_ref026","article-title":"Provable bounds for learning some deep representations","author":"Arora","journal-title":"Proceedings of the International Conference on Machine Learning"},{"key":"2026040314123671200_ref027","article-title":"A practical algorithm for topic modeling with provable guarantees","author":"Arora","journal-title":"Proceedings of the International Conference on Machine Learning"},{"key":"2026040314123671200_ref028","article-title":"Simple, e\u02dacient, and neural algorithms for sparse coding","author":"Arora","journal-title":"CoRR"},{"key":"2026040314123671200_ref029","article-title":"Provable ICA with unknown Gaussian noise, and implications for Gaussian mixtures and autoencoders","author":"Arora","journal-title":"Algorithmica"},{"key":"2026040314123671200_ref030","article-title":"The multiplicative weights update method: a meta-algorithm and applications","author":"Arora","journal-title":"Theory of Computing"},{"key":"2026040314123671200_ref031","article-title":"Proof veri\ufb01cation and the hardness of approximation problems","author":"Arora","journal-title":"Journal of the ACM"},{"key":"2026040314123671200_ref032","article-title":"A di\u02daculty in the concept of social welfare","author":"Arrow","journal-title":"Journal of Political Economy"},{"key":"2026040314123671200_ref033","author":"Arrow","journal-title":"Social Choice and Individual Values"},{"key":"2026040314123671200_ref034","article-title":"Smoothed analysis of the k-means method","author":"Arthur","journal-title":"Journal of the ACM"},{"key":"2026040314123671200_ref035","article-title":"Optimal oblivious routing in polynomial time","author":"Azar","journal-title":"Proceedings of the 35th Annual ACM Symposium on Theory of Computing"},{"key":"2026040314123671200_ref036","article-title":"Graph isomorphism in quasipolynomial time","author":"Babai","journal-title":"CoRR"},{"key":"2026040314123671200_ref037","article-title":"Checking computations in polylogarithmic time","author":"Babai","journal-title":"Proceedings of the 23rd Annual ACM Symposium on Theory of Computing"},{"key":"2026040314123671200_ref038","article-title":"Approximate clustering without the approximation","author":"Balcan","journal-title":"Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"2026040314123671200_ref039","article-title":"Finding endogenously formed communities","author":"Balcan","journal-title":"Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"2026040314123671200_ref040","article-title":"Finding low error clusterings","author":"Balcan","journal-title":"Conference on Learning Theory"},{"key":"2026040314123671200_ref041","article-title":"Weighted voting doesn\u2019t work: A mathematical analysis","author":"Banzhaf","journal-title":"Rutgers Law Review"},{"key":"2026040314123671200_ref042","article-title":"Emergence of scaling in random networks","author":"Barabasi","journal-title":"Science"},{"key":"2026040314123671200_ref043","article-title":"Spectral sparsi\ufb01cation of graphs: Theory and algorithms","author":"Batson","journal-title":"Communications of the ACM"},{"key":"2026040314123671200_ref044","article-title":"Twice-Ramanujan sparsi\ufb01ers","author":"Batson","journal-title":"Proceedings of the Annual ACM Symposium on Theory of Computing"},{"key":"2026040314123671200_ref045","author":"Battista"},{"key":"2026040314123671200_ref046","article-title":"Communication patterns in task oriented groups","author":"Bavelas","journal-title":"Journal of the Acoustical Society of America"},{"key":"2026040314123671200_ref047","article-title":"Laplacian eigenmaps for dimensionality reduction and data representation","author":"Belkin","journal-title":"Neural Computation"},{"key":"2026040314123671200_ref048","article-title":"Stable coalition structures with open membership and asymmetric \ufb01rms","author":"Belle\ufb02amme","journal-title":"Games and Economic Behavior"},{"key":"2026040314123671200_ref049","author":"Bencz\u00far"},{"key":"2026040314123671200_ref050","author":"Bern"},{"key":"2026040314123671200_ref051","article-title":"Parallel construction of quadtrees and quality triangulations","author":"Bern","journal-title":"International Journal of Computational Geometry & Applications"},{"key":"2026040314123671200_ref052","article-title":"Eigenvalue bounds, spectral partitioning, and metrical deformations via \ufb02ows","author":"Biswal","journal-title":"Journal of the ACM"},{"key":"2026040314123671200_ref053","article-title":"Coloring random and semi-random k-colorable graphs","author":"Blum","journal-title":"Journal of Algorithms"},{"key":"2026040314123671200_ref054","article-title":"On a theory of computation and complexity over the real numbers: NP -completeness, recursive functions and universal machines","author":"Blum","journal-title":"Bulletin of the American Mathematical Society"},{"key":"2026040314123671200_ref055","author":"Bollob\u00e1s","journal-title":"Modern graph theory"},{"key":"2026040314123671200_ref056","article-title":"On factor width and symmetric H-matrices","author":"Boman","journal-title":"Linear Algebra and Its Applications"},{"key":"2026040314123671200_ref057","article-title":"Solving elliptic \ufb01nite element systems in near-linear time with support preconditioners","author":"Boman","journal-title":"SIAM Journal Numerical Analysis"},{"key":"2026040314123671200_ref058","article-title":"Power and centrality: A family of measures","author":"Bonacich","journal-title":"American Journal of Sociology"},{"key":"2026040314123671200_ref059","article-title":"Simultaneous group and individual centralities","author":"Bonacich","journal-title":"Social Networks"},{"key":"2026040314123671200_ref060","article-title":"Some applications of the methods of linear programming to the theory of cooperative games","author":"Bondareva"},{"key":"2026040314123671200_ref061","article-title":"Eigenvalues and graph bisection: An average-case analysis","author":"Boppana","journal-title":"Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science"},{"key":"2026040314123671200_ref062","article-title":"Centrality and network \ufb02ow","author":"Borgatti","journal-title":"Social Networks"},{"key":"2026040314123671200_ref063","author":"Borgatti"},{"key":"2026040314123671200_ref064","article-title":"Maximizing social in\ufb02uence in nearly optimal time","author":"Borgs","journal-title":"Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"2026040314123671200_ref065","article-title":"Multi-scale matrix sampling and sublinear-time PageRank computation","author":"Borgs","journal-title":"Internet Mathematics"},{"key":"2026040314123671200_ref066","article-title":"An axiomatic approach to community detection","author":"Borgs","journal-title":"Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, Cambridge, MA, USA"},{"key":"2026040314123671200_ref067","author":"Brams"},{"key":"2026040314123671200_ref068","article-title":"Multi-level adaptive solutions to boundary-value problems","author":"Brandt","journal-title":"Mathematics of Computation"},{"key":"2026040314123671200_ref069","author":"Brandt"},{"key":"2026040314123671200_ref070","first-page":"1504","article-title":"ETH hardness for densest-k-subgraph with perfect completeness","volume":"arXiv","author":"Braverman","year":"2015","journal-title":"CoRR"},{"key":"2026040314123671200_ref071","article-title":"The parallel evaluation of general arithmetic expressions","author":"Brent","journal-title":"Journal of the ACM"},{"key":"2026040314123671200_ref072","author":"Briggs"},{"key":"2026040314123671200_ref073","article-title":"The anatomy of a large-scale hypertextual Web search engine","author":"Brin","journal-title":"Computer Networks"},{"key":"2026040314123671200_ref074","article-title":"On the resemblance and containment of documents","author":"Broder","journal-title":"Proceedings of the Compression and Complexity of Sequences"},{"key":"2026040314123671200_ref075","article-title":"\u00dc ber Abbildung von Mannigfaltigkeitn","author":"Brouwer","journal-title":"Math. Annale"},{"issue":"16","key":"2026040314123671200_ref076","doi-asserted-by":"crossref","first-page":"160602","DOI":"10.1103\/PhysRevLett.102.160602","article-title":"Localization of the maximal entropy random walk","volume":"102","author":"Burda","journal-title":"Physical Review Letters"},{"key":"2026040314123671200_ref077","article-title":"BGP routing policies in ISP networks","author":"Caesar"},{"key":"2026040314123671200_ref078","author":"Callahan"},{"key":"2026040314123671200_ref079","author":"Chakrabarti","journal-title":"Graph mining: laws, tools, and case studies"},{"key":"2026040314123671200_ref080","article-title":"Optimal output-sensitive convex hull algorithms in two and three dimensions","author":"Chan","journal-title":"Discrete & Computational Geometry"},{"key":"2026040314123671200_ref081","article-title":"Similarity estimation techniques from rounding algorithms","author":"Charikar","journal-title":"Proceedings of the 34th Annual ACM Symposium on Theory of Computing"},{"key":"2026040314123671200_ref082","article-title":"A lower bound for the smallest eigenvalue of the Laplacian","author":"Cheeger","journal-title":"Problems in Analysis, Edited by R. C. Gunning"},{"key":"2026040314123671200_ref083","author":"Chen"},{"key":"2026040314123671200_ref084","article-title":"Interplay between social in\ufb02uence and network centrality: Shapley values and scalable algorithms","author":"Chen","journal-title":"CoRR"},{"key":"2026040314123671200_ref085","article-title":"A complexity view of markets with social in\ufb02uence","author":"Chen","journal-title":"Proceedings in Innovations in Computer Science - Tsinghua University, Beijing, China"},{"key":"2026040314123671200_ref086","article-title":"E\u02dacient sampling for Gaussian graphical models via spectral sparsi\ufb01cation","author":"Cheng","journal-title":"Proceedings of the 28th Conference on Learning Theory"},{"key":"2026040314123671200_ref087","article-title":"Silver exudation","author":"Cheng","journal-title":"Journal of the ACM"},{"key":"2026040314123671200_ref088","article-title":"A measure of asymptotic e\u02daciency for tests of a hypothesis based on the sum of observations","author":"Cherno\u02d9","journal-title":"Annals of Mathematical Statistics"},{"key":"2026040314123671200_ref089","author":"Chew"},{"key":"2026040314123671200_ref090","article-title":"Stochastic block model and community detection in sparse graphs: A spectral algorithm with optimal rate of recovery","author":"Chin","journal-title":"Proceedings of The 28th Conference on Learning Theory"},{"key":"2026040314123671200_ref091","article-title":"Electrical \ufb02ows, Laplacian systems, and faster approximation of maximum \ufb02ow in undirected graphs","author":"Christiano","journal-title":"Proceedings of the 43rd annual ACM symposium on Theory of computing"},{"key":"2026040314123671200_ref092","article-title":"The heat kernel as the PageRank of a graph","author":"Chung","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"2026040314123671200_ref093","article-title":"A local graph partitioning algorithm using heat kernel Pager-ank","author":"Chung","journal-title":"Internet Mathematics"},{"key":"2026040314123671200_ref094","author":"Chung","journal-title":"Complex Graphs and Networks (CBMS Regional Conference Series in Mathematics)"},{"key":"2026040314123671200_ref095","author":"Chung","journal-title":"Spectral Graph Theory (CBMS Regional Conference Series in Mathematics, No. 92)"},{"key":"2026040314123671200_ref096","article-title":"Approximating center points with and without linear programming","author":"Clarkson","journal-title":"Proceedings of 9th ACM Symposium on Computational Geometry"},{"key":"2026040314123671200_ref097","author":"Cohen"},{"key":"2026040314123671200_ref098","article-title":"Geometric median in nearly linear time","author":"Cohen","journal-title":"Proceedings of the Annual ACM Symposium on Theory of Computing"},{"key":"2026040314123671200_ref099","author":"Conway"},{"key":"2026040314123671200_ref100","article-title":"The complexity of theorem-proving procedures","author":"Cook","journal-title":"Proceedings of the Third Annual ACM Symposium on Theory of Computing"},{"key":"2026040314123671200_ref101","author":"Cooley"},{"key":"2026040314123671200_ref102","doi-asserted-by":"crossref","article-title":"Matrix multiplication via arithmetic progressions","author":"Coppersmith","DOI":"10.1145\/28395.28396"},{"key":"2026040314123671200_ref103","author":"Cormen","journal-title":"Introduction to Algorithms"},{"key":"2026040314123671200_ref104","author":"Johnson"},{"key":"2026040314123671200_ref105","author":"Daitch"},{"key":"2026040314123671200_ref106","article-title":"Helly\u2019s theorem and its relatives","author":"Danzer","journal-title":"Proceedings of Symposia in Pure Mathematics, American Mathematical Society"},{"key":"2026040314123671200_ref107","author":"Datar"},{"key":"2026040314123671200_ref108","author":"Daubechies","journal-title":"Ten Lectures on Wavelets"},{"key":"2026040314123671200_ref109","author":"David","journal-title":"Networks, Crowds, and Markets: Reasoning About a Highly Connected World"},{"key":"2026040314123671200_ref110","author":"Debevec"},{"key":"2026040314123671200_ref111","article-title":"Indexing by latent semantic analysis","author":"Deerwester","journal-title":"Journal of the American Society for Information Science"},{"key":"2026040314123671200_ref112","author":"Deng"},{"key":"2026040314123671200_ref113","article-title":"Cover times, blanket times, and majorizing measures","author":"Ding","journal-title":"Proceedings of the 43rd Annual ACM Symposium on Theory of Computing"},{"key":"2026040314123671200_ref114","article-title":"Mining the network value of customers","author":"Domingos","journal-title":"Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"},{"key":"2026040314123671200_ref115","author":"Donath"},{"key":"2026040314123671200_ref116","author":"Donath"},{"key":"2026040314123671200_ref117","author":"Donetti"},{"key":"2026040314123671200_ref118","article-title":"Compressed sensing","author":"Donoho","journal-title":"IEEE Transactions on InformationTheory"},{"key":"2026040314123671200_ref119","author":"Doyle"},{"key":"2026040314123671200_ref120","doi-asserted-by":"crossref","article-title":"Smoothed analysis of condition numbers and complexity implications for linear programming","author":"Dunagan","DOI":"10.1007\/s10107-009-0278-5"},{"key":"2026040314123671200_ref121","article-title":"Calibrating noise to sensitivity in private data analysis","author":"Dwork","journal-title":"Proceedings of the 3rd Conference on Theory of Cryptography"},{"key":"2026040314123671200_ref122","article-title":"Maximum matching and a polyhedron with 0, 1 vertices","author":"Edmonds","journal-title":"Journal of Research at the National Bureau of Standards"},{"key":"2026040314123671200_ref123","article-title":"Inversion formulas and linear complexity algorithm for diagonal plus semiseparable matrices","author":"Eidelman","journal-title":"Computers & Mathematics with Applications"},{"key":"2026040314123671200_ref124","author":"Elias"},{"key":"2026040314123671200_ref125","article-title":"Lower-stretch spanning trees","author":"Elkin","journal-title":"SIAM Journal on Computing"},{"key":"2026040314123671200_ref126","author":"Even"},{"key":"2026040314123671200_ref127","article-title":"Centrality in a\u02daliation networks","author":"Faust","journal-title":"Social Networks"},{"key":"2026040314123671200_ref128","article-title":"A unifying hierarchy of valuations with complements and substitutes","author":"Feige","journal-title":"CoRR"},{"key":"2026040314123671200_ref129","article-title":"Pass approximation: A framework for analyzing and designing heuristics","author":"Feige","journal-title":"Algorithmica"},{"key":"2026040314123671200_ref130","article-title":"Welfare maximization and the supermodular degree","author":"Feige","journal-title":"Proceedings of the 4th Conference on Innovations in Theoretical Computer Science"},{"key":"2026040314123671200_ref131","first-page":"674","article-title":"Heuristics for \ufb01nding large independent sets, with applications to coloring semi-random graphs","author":"Feige","journal-title":"Proceedings of the 39th Annual Symposium on Foundations of Computer Science"},{"key":"2026040314123671200_ref132","article-title":"A polylogarithmic approximation of the minimum bisection","author":"Feige","journal-title":"SIAM Journal on Computing"},{"key":"2026040314123671200_ref133","article-title":"Algebraic connectivity of graphs","author":"Fiedler","journal-title":"Czechoslovak Mathematical Journal"},{"key":"2026040314123671200_ref134","article-title":"A property of eigenvectors of nonnegative symmetric matrices and its applications to graph theory","author":"Fiedler","journal-title":"Czechoslovak Mathematical Journal"},{"key":"2026040314123671200_ref135","author":"Ford"},{"key":"2026040314123671200_ref136","article-title":"The QR transformation a unitary analogue to the LR transformation: Part 1","author":"Francis","journal-title":"The Computer Journal"},{"key":"2026040314123671200_ref137","article-title":"A set of measures of centrality based upon betweenness","author":"Freeman","journal-title":"Sociometry"},{"key":"2026040314123671200_ref138","article-title":"Centrality in social networks: Conceptual clari\ufb01cation","author":"Freeman","journal-title":"Social Networks"},{"key":"2026040314123671200_ref139","article-title":"Separator based parallel divide and conquer in computational geometry","author":"Frieze","journal-title":"Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures"},{"key":"2026040314123671200_ref140","author":"Gale"},{"key":"2026040314123671200_ref141","author":"Garey"},{"key":"2026040314123671200_ref142","author":"Gazit"},{"key":"2026040314123671200_ref143","author":"Ge","journal-title":"Provable algorithms for machine learning problems"},{"key":"2026040314123671200_ref144","article-title":"Nested dissection of a regular \ufb01nite element mesh","author":"George","journal-title":"SIAMJournal on Numerical Analysis"},{"key":"2026040314123671200_ref145","article-title":"Predicting in\ufb02uential users in online social networks","author":"Ghosh","journal-title":"Proceedings of KDD workshop on Social Network Analysis (SNAKDD)"},{"key":"2026040314123671200_ref146","author":"Ghosh"},{"key":"2026040314123671200_ref147","author":"Gilbert"},{"key":"2026040314123671200_ref148","article-title":"Geometric mesh partitioning: Implementation and experiments","author":"Gilbert","journal-title":"SIAM Journal on Scienti\ufb01c Computing"},{"key":"2026040314123671200_ref149","article-title":"Sparse matrices in Matlab: design and implementation","author":"Gilbert","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"2026040314123671200_ref150","article-title":"Similarity search in high dimensions via hashing","author":"Gionis","journal-title":"Proceedings of the 25th International Conference on Very Large Data Bases"},{"key":"2026040314123671200_ref151","author":"Goemans"},{"key":"2026040314123671200_ref152","article-title":"Linear complexity algorithms for semiseparable matrices","author":"Gohberg","journal-title":"Integral Equations and Operator Theory"},{"key":"2026040314123671200_ref153","article-title":"Introduction to testing graph properties","author":"Goldreich"},{"key":"2026040314123671200_ref154","article-title":"Property testing and its connection to learning and approximation","author":"Goldreich","journal-title":"Journal of the ACM"},{"key":"2026040314123671200_ref155","author":"Golub"},{"key":"2026040314123671200_ref156","article-title":"Centrality and power in social networks: a game theoretic approach","author":"G\u00f3mez","journal-title":"Mathematical Social Sciences"},{"key":"2026040314123671200_ref157","article-title":"A fast algorithm for particle simulations","author":"Greengard","journal-title":"Journal of Computational Physics"},{"key":"2026040314123671200_ref158","author":"Greengard","journal-title":"The Rapid Evaluation of Potential Fields in ParticleSystems"},{"key":"2026040314123671200_ref159","article-title":"A game theoretic approach to measuring degree of centrality in social networks","author":"Grofman","journal-title":"Social Networks"},{"key":"2026040314123671200_ref160","author":"Gus\ufb01eld"},{"key":"2026040314123671200_ref161","article-title":"A sparse matrix arithmetic based on H-matrices. part I: Introduction to H-matrices","author":"Hackbusch","journal-title":"Computing"},{"key":"2026040314123671200_ref162","article-title":"An r-dimensional quadratic placement algorithm","author":"Hall","journal-title":"ManagementScience"},{"key":"2026040314123671200_ref163","author":"Hammersley","journal-title":"Markov \ufb01elds on \ufb01nite graphs and lattices"},{"key":"2026040314123671200_ref164","author":"Han","journal-title":"Data Mining: Concepts and Techniques"},{"key":"2026040314123671200_ref165","author":"Hanneke"},{"key":"2026040314123671200_ref166","article-title":"Endogenous formation of coalitions","author":"Hart","journal-title":"Econometrica"},{"key":"2026040314123671200_ref167","article-title":"On the computational complexity of algorithms","author":"Hartmanis","journal-title":"Transactions of the American Mathematical Society"},{"key":"2026040314123671200_ref168","article-title":"Topic-sensitive Pagerank: A context-sensitive ranking algorithm for web search","author":"Haveliwala","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"2026040314123671200_ref169","article-title":"Revealing multiple layers of hidden community structure in networks","author":"He","journal-title":"CoRR"},{"key":"2026040314123671200_ref170","author":"Heath"},{"key":"2026040314123671200_ref171","author":"Heinonen","journal-title":"Lectures on analysis on metric spaces"},{"key":"2026040314123671200_ref172","author":"Hubert"},{"key":"2026040314123671200_ref173","article-title":"A method for the construction of minimum-redundancy codes","author":"Hu\u02d9man","journal-title":"Proceedings of the Institute of Radio Engineers"},{"key":"2026040314123671200_ref174","article-title":"Approximate nearest neighbors: Towards removing the curse of dimensionality","author":"Indyk","journal-title":"Proceedings of the 30th Annual ACM Symposium on Theory of Computing"},{"key":"2026040314123671200_ref175","author":"Jackson","journal-title":"Social and Economic Networks"},{"key":"2026040314123671200_ref176","article-title":"On the identi\ufb01cation of the convex hull of a \ufb01nite set of points in the plane","author":"Jarvis","journal-title":"Information Processing Letters"},{"key":"2026040314123671200_ref177","article-title":"Scaling personalized Web search","author":"Jeh","journal-title":"WWW"},{"key":"2026040314123671200_ref178","article-title":"Conductance and the rapid mixing property for Markov chains: the approximation of permanent resolved","author":"Jerrum","journal-title":"Proceedings of the Annual ACM Symposium on Theory of Computing"},{"key":"2026040314123671200_ref179","article-title":"Analyzing hogwild parallel Gaussian Gibbs sampling","author":"Johnson","journal-title":"Advances in Neural Information Processing Systems 26"},{"key":"2026040314123671200_ref180","article-title":"Extensions of Lipschitz mappings into a Hilbert space","author":"Johnson","journal-title":"Contemporary Mathematics"},{"key":"2026040314123671200_ref181","author":"Jordan","journal-title":"Learning in Graphical Models"},{"key":"2026040314123671200_ref182","article-title":"Machine learning: Trends, perspectives, and prospects","author":"JordanEzhumala","journal-title":"Science"},{"key":"2026040314123671200_ref183","article-title":"Mining large graphs : Algorithms , inference , and discoveries","author":"Kang","journal-title":"Proceedings of the 2011 IEEE 27th International Conference on Data Engineering"},{"key":"2026040314123671200_ref184","article-title":"Big graph mining: Algorithms and discoveries","author":"Kang","journal-title":"SIGKDD Explorations Newsletter"},{"key":"2026040314123671200_ref185","article-title":"Spectral algorithms","author":"Kannan","journal-title":"Foundations and TrendsR[circlecopyrtclosebracketezhuezhu in Theoretical Computer Science"},{"key":"2026040314123671200_ref186","article-title":"On clusterings: Good, bad and spectral","author":"Kannan","journal-title":"Journal of the ACM"},{"key":"2026040314123671200_ref187","article-title":"Finding nearest neighbors in growth-restricted metrics","author":"Karger","journal-title":"Proceedings of the 34th Annual ACM Symposium on Theory of Computing"},{"key":"2026040314123671200_ref188","article-title":"A new polynomial-time algorithm for linear programming","author":"Karmarkar","journal-title":"Proceedings of the 16th Annual ACM Symposium on Theory of Computing"},{"key":"2026040314123671200_ref189","article-title":"Reducibility among combinatorial problems","author":"Karp"},{"key":"2026040314123671200_ref190","article-title":"A fast and high quality multilevel scheme for partitioning irregular graphs","author":"Karypis","journal-title":"SIAM Journal on Scienti\ufb01c Computing"},{"key":"2026040314123671200_ref191","article-title":"A new status index derived from sociometric analysis","author":"Katz","journal-title":"Psychometrika"},{"key":"2026040314123671200_ref192","author":"Kearns"},{"key":"2026040314123671200_ref193","author":"Kearns"},{"key":"2026040314123671200_ref194","author":"Kearns"},{"key":"2026040314123671200_ref195","author":"Kelner"},{"key":"2026040314123671200_ref196","doi-asserted-by":"crossref","article-title":"Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus","author":"Kelner","DOI":"10.1145\/1007352.1007357"},{"key":"2026040314123671200_ref197","article-title":"An almost-linear-time algorithm for approximate max \ufb02ow in undirected graphs, and its multicommodity generalizations","author":"Kelner","journal-title":"Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"2026040314123671200_ref198","article-title":"Spectral sparsi\ufb01cation in the semi-streaming setting","author":"Kelner","journal-title":"Theory of Computing Systems"},{"key":"2026040314123671200_ref199","article-title":"Faster generation of random spanning trees","author":"Kelner","journal-title":"Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science"},{"key":"2026040314123671200_ref200","author":"Kelner"},{"key":"2026040314123671200_ref201","article-title":"Maximizing the spread of in\ufb02uence through a social network","author":"Kempe","journal-title":"KDD \u201903"},{"key":"2026040314123671200_ref202","article-title":"A polynomial algorithm in linear programming","author":"Khachiyan","journal-title":"Dok-lady Akademii Nauk SSSR"},{"key":"2026040314123671200_ref203","article-title":"The network completion problem: Inferring missing nodes and edges in networks","author":"Kim","journal-title":"SDM"},{"key":"2026040314123671200_ref204","doi-asserted-by":"crossref","article-title":"The ultimate planar convex hull algorithm","author":"Kirkpatrick","DOI":"10.1137\/0215021"},{"key":"2026040314123671200_ref205","author":"Kirkpatrick"},{"key":"2026040314123671200_ref206","article-title":"Min-max-boundary domain decomposition","author":"Kiwi","journal-title":"Theoretical Computer Science"},{"key":"2026040314123671200_ref207","article-title":"An impossibility theorem for clustering","author":"Kleinberg","journal-title":"NIPS"},{"key":"2026040314123671200_ref208","article-title":"Segmentation problems","author":"Kleinberg","journal-title":"Journal of the ACM"},{"key":"2026040314123671200_ref209","author":"Kleinberg","journal-title":"Algorithm Design"},{"key":"2026040314123671200_ref210","article-title":"Balanced outcomes in social exchange networks","author":"Kleinberg","journal-title":"Proceedings of the 40th Annual ACM Symposium on Theory of Computing"},{"key":"2026040314123671200_ref211","article-title":"Authoritative sources in a hyperlinked environment","author":"Kleinberg","journal-title":"Journal of the ACM"},{"key":"2026040314123671200_ref212","article-title":"Geographic routing using hyperbolic space","author":"Kleinberg","journal-title":"Proceedings of the 26th Annual Joint Conference of the IEEE Computer and Communications Societies"},{"key":"2026040314123671200_ref213","article-title":"Kontaktprobleme der konformen abbildung","author":"Koebe","journal-title":"Ber. S\u00e4chs"},{"key":"2026040314123671200_ref214","author":"Koller","journal-title":"Probabilistic Graphical Models: Principles and Techniques - Adaptive Computa tion and Machine Learning"},{"key":"2026040314123671200_ref215","article-title":"A nearly-mlogn time solver for SDD linear systems","author":"Koutis","journal-title":"Proceedings of the 52nd Annual Symposium on Foundations of Computer Science"},{"key":"2026040314123671200_ref216","article-title":"Approaching optimality for solving SDD systems","author":"Koutis","journal-title":"Proceedings of the 51st Annual Symposium on Foundations of Computer Science"},{"key":"2026040314123671200_ref217","article-title":"Approximate gaussian elimination for laplacians: Fast, sparse, and simple","author":"Kyng","journal-title":"CoRR"},{"key":"2026040314123671200_ref218","author":"Lee"},{"key":"2026040314123671200_ref219","article-title":"Following the path of least resistance : An \u00d5(m sqrt(n)) algorithm for the minimum cost \ufb02ow problem","author":"Lee","journal-title":"CoRR"},{"key":"2026040314123671200_ref220","article-title":"Matching the universal barrier without paying the costs : Solving linear programs with \u00d5(sqrt(rank)) linear system solves","author":"Lee","journal-title":"CoRR"},{"key":"2026040314123671200_ref221","article-title":"Constructing linear-sized spectral sparsi\ufb01cation in almost-linear time","author":"Lee","journal-title":"Foundations of Computer Science (FOCS), 2015 IEEE 56th Annual Symposium on"},{"key":"2026040314123671200_ref222","article-title":"Combinatorial auctions with decreasing marginal utilities","author":"Lehmann","journal-title":"Proceedings of the 3rd ACM Conference on Electronic Commerce"},{"key":"2026040314123671200_ref223","author":"Leighton","journal-title":"Introduction to Parallel Algorithms and Architectures:Array, Trees, Hypercubes"},{"key":"2026040314123671200_ref224","article-title":"Multicommodity max-\ufb02ow min-cut theorems and their use in designing approximation algorithms","author":"Leighton","journal-title":"Journal of the ACM"},{"key":"2026040314123671200_ref225","article-title":"Fat-trees: universal networks for hardware-e\u02dacient supercomputing","author":"Leiserson","journal-title":"IEEE Transactions on Computers"},{"key":"2026040314123671200_ref226","author":"Leiserson","journal-title":"Area-E\u02dacient VLSI Computation"},{"key":"2026040314123671200_ref227","article-title":"Network structure, topology and dynamics in generalized models of synchronization","author":"Lerman","journal-title":"Physical Review E"},{"key":"2026040314123671200_ref228","author":"Lerman"},{"key":"2026040314123671200_ref229","author":"Leskovec","journal-title":"Dynamics of Large Networks"},{"key":"2026040314123671200_ref230","article-title":"Scalable modeling of real graphs using kronecker multiplication","author":"Leskovec","journal-title":"Proceedings of the 24th International Conference on Machine Learning"},{"key":"2026040314123671200_ref231","article-title":"Community structure in large networks: Natural cluster sizes and the absence of large well-de\ufb01ned clusters","author":"Leskovec","journal-title":"Internet Mathematics"},{"key":"2026040314123671200_ref232","author":"Leskovec"},{"key":"2026040314123671200_ref233","article-title":"Universal sorting problems","author":"Levin","journal-title":"Problems of Information Transmission"},{"key":"2026040314123671200_ref234","article-title":"Sliver-free three dimensional Delaunay mesh generation","author":"Li","journal-title":"Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"2026040314123671200_ref235","author":"Lipton"},{"key":"2026040314123671200_ref236","author":"Lipton"},{"key":"2026040314123671200_ref237","author":"Liu"},{"key":"2026040314123671200_ref238","article-title":"Least squares quantization in PCM","author":"Lloyd","journal-title":"IEEE Transactions onInformation Theory"},{"key":"2026040314123671200_ref239","article-title":"The mixing rate of Markov chains, an isoperimetric inequality, and computing the volume","author":"Lov\u00e1sz","journal-title":"Proceedings: 31st Annual Symposium on Foundations of Computer Science"},{"key":"2026040314123671200_ref240","article-title":"Random walks in a convex body and an improved volume algorithm","author":"Lov\u00e1sz","journal-title":"RSA: Random Structures & Algorithms"},{"key":"2026040314123671200_ref241","article-title":"Ramanujan graphs","author":"Lubotzky","journal-title":"Combinatorica"},{"key":"2026040314123671200_ref242","article-title":"Fast approximation algorithms for cut-based problems in undirected graphs","author":"M[aogonekclosebracketezhuezhudry","journal-title":"FOCS\u201910: Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science"},{"key":"2026040314123671200_ref243","article-title":"Navigating central path with electrical \ufb02ows: from \ufb02ows to matchings, and back","author":"M[aogonekclosebracketezhuezhudry","journal-title":"Proceedings of the 54th Annual Symposium on Foundations of Computer Science"},{"key":"2026040314123671200_ref244","article-title":"Explicit group theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators","author":"Margulis","journal-title":"Problems of Information Transmission"},{"key":"2026040314123671200_ref245","author":"Masrour"},{"key":"2026040314123671200_ref246","article-title":"Standards for graph algorithm primitives","author":"Mattson","journal-title":"CoRR"},{"key":"2026040314123671200_ref247","article-title":"Linear programming in linear time when the dimension is \ufb01xed","author":"Megiddo","journal-title":"Journal of the ACM"},{"key":"2026040314123671200_ref248","article-title":"Equation of state calculations by fast computing machines","author":"Metropolis","journal-title":"Journal of Chemical Physics"},{"key":"2026040314123671200_ref249","author":"Michalak"},{"key":"2026040314123671200_ref250","article-title":"Riemann\u2019s hypotheis and tests for primality","author":"Miller","journal-title":"Journal ofComputer and System Sciences"},{"key":"2026040314123671200_ref251","author":"Miller"},{"key":"2026040314123671200_ref252","author":"Miller"},{"key":"2026040314123671200_ref253","author":"Miller"},{"key":"2026040314123671200_ref254","article-title":"Finding strongly-knit clusters in social networks","author":"Mishra","journal-title":"Internet Mathematics"},{"key":"2026040314123671200_ref255","author":"Mitchell"},{"key":"2026040314123671200_ref256","author":"Morgenstern"},{"key":"2026040314123671200_ref257","article-title":"A Shapley value-based approach to discover in\ufb02uential nodes in social networks","author":"Narayanam","journal-title":"Automation Science and Engineering, IEEE Transactions on"},{"key":"2026040314123671200_ref258","article-title":"Equilibrium points in n-person games","author":"Nash","journal-title":"Proceedings of theNational Academy of the USA"},{"key":"2026040314123671200_ref259","article-title":"Noncooperative games","author":"Nash","journal-title":"Annals of Mathematics"},{"key":"2026040314123671200_ref260","author":"Newman","journal-title":"Networks: An Introduction"},{"key":"2026040314123671200_ref261","article-title":"Modularity and community structure in networks","author":"Newman","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"2026040314123671200_ref262","article-title":"Algorithmic mechanism design (extended abstract)","author":"Nisan","journal-title":"Proceedings of the 31st Annual ACM Symposium on Theory of Computing"},{"key":"2026040314123671200_ref263","author":"Niu"},{"key":"2026040314123671200_ref264","article-title":"The Akamai network: A platform for high-performance Internet applications","author":"Nygren","journal-title":"SIGOPS Operating Systems Review"},{"key":"2026040314123671200_ref265","author":"Orecchia"},{"key":"2026040314123671200_ref266","article-title":"The Pagerank citation ranking: Bringing order to the Web","author":"Page","journal-title":"Proceedings of the 7th International World Wide Web Conference"},{"key":"2026040314123671200_ref267","article-title":"The measurement of intellectual in\ufb02uence","author":"Palacios-Huerta","journal-title":"Econometrica"},{"key":"2026040314123671200_ref268","article-title":"On graph-theoretic lemmata and complexity classes","author":"Papadimitriou","journal-title":"Proceedings 31st Annual Symposium on Foundations of Computer Science"},{"key":"2026040314123671200_ref269","article-title":"On the complexity of the parity argument and other ine\u02dacient proofs of existence","author":"Papadimitriou","journal-title":"Journal of Computer and System Sciences"},{"key":"2026040314123671200_ref270","article-title":"Algorithms, games, and the internet","author":"Papadimitriou","journal-title":"Proceedings of the 33rd Annual ACM Symposium on Theory of Computing"},{"key":"2026040314123671200_ref271","article-title":"On the complexity of local search","author":"Papadimitriou","journal-title":"Proceedings of the 22th Annual ACM Symposium on Theory of Computing"},{"key":"2026040314123671200_ref272","article-title":"Multiobjective query optimization","author":"Papadimitriou","journal-title":"Proceedings of the 20th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems"},{"key":"2026040314123671200_ref273","author":"Peleg"},{"key":"2026040314123671200_ref274","author":"Peleg"},{"key":"2026040314123671200_ref275","article-title":"Approximate undirected maximum \ufb02ows in O(mpolylog(n)) time","author":"Peng","journal-title":"Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"2026040314123671200_ref276","article-title":"The elementary statistics of majority voting","author":"Penrose","journal-title":"Journal of the Royal Statistical Society"},{"key":"2026040314123671200_ref277","article-title":"Percolation centrality: Quantifying graph-theoretic impact of nodes during percolation in networks","author":"Piraveenan","journal-title":"PLoS ONE"},{"key":"2026040314123671200_ref278","article-title":"Partitioning sparse matrices with eigenvectors of graphs","author":"Pothen","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"2026040314123671200_ref279","author":"Preparata"},{"key":"2026040314123671200_ref280","author":"Rabin","journal-title":"Probabilistic Algorithms"},{"key":"2026040314123671200_ref281","article-title":"Optimal hierarchical decompositions for congestion minimization in networks","author":"R\u00e4cke","journal-title":"Proceedings of the 40th Annual ACM Symposium on Theory of Computing"},{"key":"2026040314123671200_ref282","article-title":"Computing cut-based hierarchical decompositions in almost linear time","author":"R\u00e4cke","journal-title":"Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"2026040314123671200_ref283","author":"Ray","journal-title":"A game-theoretic perspective on coalition formation"},{"key":"2026040314123671200_ref284","author":"Rekhter"},{"key":"2026040314123671200_ref285","article-title":"Incorporating condition measures into the complexity theory of linear programming","author":"Renegar","journal-title":"SIAM Journal on Optimization"},{"key":"2026040314123671200_ref286","article-title":"Mining knowledge-sharing sites for viral marketing","author":"Richardson","journal-title":"Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"},{"key":"2026040314123671200_ref287","article-title":"Smoothed analysis of multiobjective optimization","author":"R\u00f6glin","journal-title":"Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science"},{"key":"2026040314123671200_ref288","article-title":"Algorithmic and analysis techniques in property testing","author":"Ron","journal-title":"Foundations and TrendsR[circlecopyrtclosebracketezhuezhu in Theoretical Computer Science"},{"key":"2026040314123671200_ref289","article-title":"The evolution of the labor market for medical interns and residents: A case study in game theory","author":"Roth","journal-title":"Journal of Political Economy"},{"key":"2026040314123671200_ref290","author":"Roth"},{"key":"2026040314123671200_ref291","article-title":"Sublinear time algorithms","author":"Rubinfeld","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"2026040314123671200_ref292","article-title":"Random vectors in the isotropic position","author":"Rudelson","journal-title":"Journal ofFunctional Analysis"},{"key":"2026040314123671200_ref293","article-title":"A new and simple algorithm for quality 2-dimensional mesh generation","author":"Ruppert","journal-title":"The 4th ACM-SIAM Symposium on Discrete Algorithms"},{"key":"2026040314123671200_ref294","article-title":"The centrality index of a graph","author":"Sabidussi","journal-title":"Psychometirka"},{"key":"2026040314123671200_ref295","author":"Santha"},{"key":"2026040314123671200_ref296","article-title":"The core of an N person game","author":"Scarf","journal-title":"Econometrica"},{"key":"2026040314123671200_ref297","author":"Schrijver","journal-title":"Combinatorial Optimization, Volume A"},{"key":"2026040314123671200_ref298","article-title":"Constructing higher-dimensional convex hulls at logarithmic cost per face","author":"Seidel","journal-title":"Proceedings of the 18th Annual ACM Symposium on Theory of Computing"},{"key":"2026040314123671200_ref299","article-title":"Linear programming and convex hulls made easy","author":"Seidel","journal-title":"Proceedings of the 6th Annual Symposium on Computational Geometry"},{"key":"2026040314123671200_ref300","article-title":"A value for n-person games","author":"Shapley"},{"key":"2026040314123671200_ref301","article-title":"On balanced sets and cores","author":"Shapley","journal-title":"Naval Research Logistics"},{"key":"2026040314123671200_ref302","article-title":"Cores of convex games","author":"Shapley","journal-title":"International Journal of GameTheory"},{"key":"2026040314123671200_ref303","article-title":"Nearly maximum \ufb02ows in nearly linear time","author":"Sherman","journal-title":"Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science"},{"key":"2026040314123671200_ref304","article-title":"Delaunay re\ufb01nement algorithms for triangular mesh generation","author":"Shewchuk","journal-title":"Computational Geometry: Theory and Applications"},{"key":"2026040314123671200_ref305","article-title":"Normalized cuts and image segmentation","author":"Shi","journal-title":"IEEETransactions on Pattern Analysis and Machine Intelligence"},{"key":"2026040314123671200_ref306","author":"Simon"},{"key":"2026040314123671200_ref307","author":"Sipser","journal-title":"Introduction to the Theory of Computation"},{"issue":"4","key":"2026040314123671200_ref308","doi-asserted-by":"crossref","first-page":"042813","DOI":"10.1103\/PhysRevE.88.042813","article-title":"Spectral clustering with epidemic di\u02d9usion","volume":"88","author":"Smith","journal-title":"Physical Review E"},{"key":"2026040314123671200_ref309","article-title":"A fast Monte-Carlo test for primality","author":"Solovay","journal-title":"SIAM Journal on Computing"},{"key":"2026040314123671200_ref310","article-title":"Neuer Beweis fur die Invarianz der Dimensionszahl und des Gebietes","author":"Sperner","journal-title":"Abhandlungen aus dem Mathematischen Seminar Universitat Hamburg"},{"key":"2026040314123671200_ref311","article-title":"Graph sparsi\ufb01cation by e\u02d9ective resistances","author":"Spielman","journal-title":"Proceedings of the 40th ACM Symposium on the Theory of Computing"},{"key":"2026040314123671200_ref312","article-title":"Disk packings and planar separators","author":"Spielman","journal-title":"Proceedings of the 12th Annual Symposium on Computational Geometry"},{"key":"2026040314123671200_ref313","article-title":"Nearly-linear time algorithms for graph partitioning, graph sparsi\ufb01cation, and solving linear systems","author":"Spielman","journal-title":"Proceedings of the 36th Annual ACM Symposium on Theory of Computing"},{"key":"2026040314123671200_ref314","article-title":"Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time","author":"Spielman","journal-title":"Journal of the ACM"},{"key":"2026040314123671200_ref315","article-title":"Spectral partitioning works: Planar graphs and \ufb01nite element meshes","author":"Spielman","journal-title":"Linear Algebra and its Applications"},{"key":"2026040314123671200_ref316","article-title":"Smoothed analysis: an attempt to explain the behavior of algorithms in practice","author":"Spielman","journal-title":"Communications of the ACM"},{"key":"2026040314123671200_ref317","doi-asserted-by":"crossref","article-title":"Spectral sparsi\ufb01cation of graphs","author":"Spielman","DOI":"10.1137\/08074489X"},{"key":"2026040314123671200_ref318","doi-asserted-by":"crossref","article-title":"A local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning","author":"Spielman","DOI":"10.1137\/080744888"},{"key":"2026040314123671200_ref319","article-title":"Nearly-linear time algorithms for preconditioning and solving symmetric, diagonally dominant linear systems","author":"Spielman","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"2026040314123671200_ref320","author":"Strang","journal-title":"An Analysis of the Finite Element Method"},{"key":"2026040314123671200_ref321","article-title":"Survey of local algorithms","author":"Suomela","journal-title":"ACM Computing Surveys"},{"key":"2026040314123671200_ref322","article-title":"Determining the top-k nodes in social networks using the Shapley value","author":"Suri","journal-title":"Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 3"},{"key":"2026040314123671200_ref323","article-title":"A new approach to betweenness centrality based on the Shapley value","author":"Szczepa[nacuteclosebracketezhuezhuski","journal-title":"Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 1"},{"key":"2026040314123671200_ref324","article-title":"In\ufb02uence maximization in near-linear time: A martingale approach","author":"Tang","journal-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data"},{"key":"2026040314123671200_ref325","article-title":"In\ufb02uence maximization: near-optimal time complexity meets practical e\u02daciency","author":"Tang","journal-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data"},{"key":"2026040314123671200_ref326","article-title":"Combinatorial aspects of geometric graphs","author":"Teng","journal-title":"ComputationalGeometry: Theory and Applications"},{"key":"2026040314123671200_ref327","article-title":"Provably good partitioning and load balancing algorithms for parallel adaptive n-body simulation","author":"Teng","journal-title":"SIAM Journal on Scienti\ufb01c Computing"},{"key":"2026040314123671200_ref328","author":"Teng"},{"key":"2026040314123671200_ref329","article-title":"The Laplacian Paradigm: Emerging algorithms for massive graphs","author":"Teng","journal-title":"Proceedings of the 7th Annual Conference on Theory and Applications of Models of Computation"},{"key":"2026040314123671200_ref330","article-title":"Numerical thinking in algorithm design and analysis","author":"Teng","journal-title":"Computer Science: The Hardware, Software and Heart of It, ed by Blum"},{"key":"2026040314123671200_ref331","doi-asserted-by":"crossref","article-title":"Network essence: Pagerank completion and centrality-conforming Markov Chains","author":"Teng","DOI":"10.1007\/978-3-319-44479-6_31"},{"key":"2026040314123671200_ref332","article-title":"Collaborative Web crawling: Information gathering\/processing over Internet","author":"Teng","journal-title":"Proceedings of the 32nd Annual Hawaii International Conference on System Sciences-Volume 5 - Volume 5"},{"key":"2026040314123671200_ref333","article-title":"Coalition formation processes with belief revision among bounded-rational self-interested agents","author":"Tohm\u00e9","journal-title":"Journal of Logic and Computation"},{"key":"2026040314123671200_ref334","author":"Trefethen","journal-title":"Numerical Linear Algebra"},{"key":"2026040314123671200_ref335","article-title":"How to draw a graph","author":"Tutte","journal-title":"Proceedings London MathematicalSociety"},{"key":"2026040314123671200_ref336","article-title":"A generalization of Radon\u2019s theorem","author":"Tverberg","journal-title":"Journal LondonMathematical Society"},{"key":"2026040314123671200_ref337","author":"Urschel"},{"key":"2026040314123671200_ref338","article-title":"An optimal algorithm for the all-nearest-neighbors problem","author":"Vaidya","journal-title":"Proceedings of the 27th Annual Symposium on Foundations of Computer Science"},{"key":"2026040314123671200_ref339","article-title":"Universality consideration in VLSI circuits","author":"Valiant","journal-title":"IEEE Transactions on Computers"},{"key":"2026040314123671200_ref340","doi-asserted-by":"crossref","article-title":"A theory of the learnable","author":"Valiant","DOI":"10.1145\/800057.808710"},{"key":"2026040314123671200_ref341","article-title":"and G. J. Brebner. Universal schemes for parallel communication","author":"ValiantEzhumala","journal-title":"Proceedings of the 13th Annual ACM Symposium on Theory of Computing"},{"key":"2026040314123671200_ref342","author":"Vapnik"},{"key":"2026040314123671200_ref343","author":"Vempala","journal-title":"The random projection method, volume 65 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"2026040314123671200_ref344","article-title":"Lx = b","author":"Vishnoi","journal-title":"Foundations and TrendsR[circlecopyrtclosebracketezhuezhu in Theoretical Computer Science"},{"key":"2026040314123671200_ref345","author":"Voevodski"},{"key":"2026040314123671200_ref346","author":"Voevodski"},{"key":"2026040314123671200_ref347","author":"Voevodski"},{"key":"2026040314123671200_ref348","author":"Voevodski"},{"key":"2026040314123671200_ref349","article-title":"Scalable in\ufb02uence maximization for independent cascade model in large-scale social networks","author":"Wang","journal-title":"Data Mining and Knowledge Discovery"},{"key":"2026040314123671200_ref350","author":"Wilkinson","journal-title":"The algebraic eigenvalue problem"},{"key":"2026040314123671200_ref351","article-title":"Multiplying matrices faster than Coppersmith-Winograd","author":"Williams","journal-title":"Proceedings of the 44th Annual ACM Symposium on Theory of Computing"},{"key":"2026040314123671200_ref352","author":"Xia"},{"key":"2026040314123671200_ref353","article-title":"Fast and accurate algorithms for protein side-chain packing","author":"Xu","journal-title":"Journal of the ACM"},{"key":"2026040314123671200_ref354","author":"Yan"},{"key":"2026040314123671200_ref355","author":"Ye","journal-title":"Interior Point Algorithms: Theory and Analysis"},{"key":"2026040314123671200_ref356","article-title":"An axiomatization of Borda\u2019s rule","author":"Young","journal-title":"Journal of EconomicTheory"},{"key":"2026040314123671200_ref357","author":"Yu","journal-title":"Link Mining: Models, Algorithms, and Applications"},{"key":"2026040314123671200_ref358","article-title":"Learning from labeled and unlabeled data on a directed graph","author":"Zhou","journal-title":"Proceedings of the 22nd International Conference on Machine Learning"}],"container-title":["Foundations and Trends\u00ae in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/fttcs\/article-pdf\/12\/1-2\/1\/11150390\/0400000051en.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/www.emerald.com\/fttcs\/article-pdf\/12\/1-2\/1\/11150390\/0400000051en.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T18:13:10Z","timestamp":1775239990000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.emerald.com\/fttcs\/article\/12\/1-2\/1\/1332207\/Scalable-Algorithms-for-Data-and-Network-Analysis"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,30]]},"references-count":358,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2016,5,30]]}},"URL":"https:\/\/doi.org\/10.1561\/0400000051","relation":{},"ISSN":["1551-305X","1551-3068"],"issn-type":[{"value":"1551-305X","type":"print"},{"value":"1551-3068","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,5,30]]}}}