Shang-Hua Teng

267 papers A* 48A 8B 18C 5Misc 12Journal 141Unranked 30

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A tractability gap beyond nim-sums: It's hard to tell whether a bunch of superstars are losers. Theor. Comput. Sci. Kyle Burke, Matthew Ferland, Svenja Huntemann, Shang-Hua Teng
2026	A	`conf`	Semi-Random Graphs, Robust Asymmetry, and Reconstruction. ITCS Julian Asilis, Xi Chen, Dutch Hansen, Shang-Hua Teng
2025	J	`jnl`	Benefits and Pitfalls of Reinforcement Learning for Language Model Planning: A Theoretical Perspective. CoRR Siwei Wang, Yifei Shen, Haoran Sun, Shi Feng, Shang-Hua Teng, Li Dong, Yaru Hao, Wei Chen
2025	B	`conf`	Proper Learnability and the Role of Unlabeled Data. ALT Julian Asilis, Siddartha Devic, Shaddin Dughmi, Vatsal Sharan, Shang-Hua Teng
2025	J	`jnl`	Proper Learnability and the Role of Unlabeled Data. CoRR Julian Asilis, Siddartha Devic, Shaddin Dughmi, Vatsal Sharan, Shang-Hua Teng
2025	J	`jnl`	Semi-Random Graphs, Robust Asymmetry, and Reconstruction. CoRR Julian Asilis, Xi Chen, Dutch Hansen, Shang-Hua Teng
2024	Misc	`conf`	A Tractability Gap Beyond Nim-Sums: It's Hard to Tell Whether a Bunch of Superstars Are Losers. FUN Kyle Burke, Matthew Ferland, Svenja Huntemann, Shang-Hua Teng
2024	J	`jnl`	A Tractability Gap Beyond Nim-Sums: It's Hard to Tell Whether a Bunch of Superstars Are Losers. CoRR Kyle Burke, Matthew Ferland, Svenja Huntemann, Shang-Hua Teng
2024	A*	`conf`	ALPINE: Unveiling The Planning Capability of Autoregressive Learning in Language Models. NeurIPS Siwei Wang, Yifei Shen, Shi Feng, Haoran Sun, Shang-Hua Teng, Wei Chen
2024	J	`jnl`	ALPINE: Unveiling the Planning Capability of Autoregressive Learning in Language Models. CoRR Siwei Wang, Yifei Shen, Shi Feng, Haoran Sun, Shang-Hua Teng, Wei Chen
2024	J	`jnl`	Learnability is a Compact Property. CoRR Julian Asilis, Siddartha Devic, Shaddin Dughmi, Vatsal Sharan, Shang-Hua Teng
2024	J	`jnl`	Nimber-preserving reduction: Game secrets and homomorphic Sprague-Grundy theorem. Theor. Comput. Sci. Kyle Burke, Matthew Ferland, Shang-Hua Teng
2024	A*	`conf`	Open Problem: Can Local Regularization Learn All Multiclass Problems? COLT Julian Asilis, Siddartha Devic, Shaddin Dughmi, Vatsal Sharan, Shang-Hua Teng
2024	A*	`conf`	Regularization and Optimal Multiclass Learning. COLT Julian Asilis, Siddartha Devic, Shaddin Dughmi, Vatsal Sharan, Shang-Hua Teng
2024	A*	`conf`	Transductive Learning is Compact. NeurIPS Julian Asilis, Siddartha Devic, Shaddin Dughmi, Vatsal Sharan, Shang-Hua Teng
2023	J	`jnl`	"Intelligent Heuristics Are the Future of Computing". ACM Trans. Intell. Syst. Technol. Shang-Hua Teng
2023	J	`jnl`	Non-conservative diffusion and its application to social network analysis. J. Complex Networks Rumi Ghosh, Kristina Lerman, Tawan Surachawala, Konstantin Voevodski, Shang-Hua Teng
2023	J	`jnl`	Regularization and Optimal Multiclass Learning. CoRR Julian Asilis, Siddartha Devic, Shaddin Dughmi, Vatsal Sharan, Shang-Hua Teng
2023	J	`jnl`	Technical Perspective: Maximum Flow through a Network: A Storied Problem and a Groundbreaking Solution. Commun. ACM Shang-Hua Teng
2022	A*	`conf`	Beyond Traditional Characterizations in the Age of Data: Big Models, Scalable Algorithms, and Meaningful Solutions. KDD Shang-Hua Teng
2022	Misc	`conf`	Nimber-Preserving Reduction: Game Secrets And Homomorphic Sprague-Grundy Theorem. FUN Kyle W. Burke, Matthew Ferland, Shang-Hua Teng
2022	Misc	`conf`	Quantum-Inspired Combinatorial Games: Algorithms and Complexity. FUN Kyle W. Burke, Matthew Ferland, Shang-Hua Teng
2021	A*	`conf`	Computational Analyses of the Electoral College: Campaigning Is Hard But Approximately Manageable. AAAI Sina Dehghani, Hamed Saleh, Saeed Seddighin, Shang-Hua Teng
2021	J	`jnl`	Nimber-Preserving Reductions and Homomorphic Sprague-Grundy Game Encodings. CoRR Kyle Burke, Matthew Ferland, Shang-Hua Teng
2021	J	`jnl`	Transverse Wave: an impartial color-propagation game inspired by Social Influence and Quantum Nim. CoRR Kyle Burke, Matthew Ferland, Shang-Hua Teng
2021	A*	`conf`	Winning the War by (Strategically) Losing Battles: Settling the Complexity of Grundy-Values in Undirected Geography. FOCS Kyle W. Burke, Matthew T. Ferland, Shang-Hua Teng
2021	J	`jnl`	Winning the War by (Strategically) Losing Battles: Settling the Complexity of Grundy-Values in Undirected Geography. CoRR Kyle Burke, Matthew Ferland, Shang-Hua Teng
2020	J	`jnl`	A graph-theoretical basis of stochastic-cascading network influence: Characterizations of influence-based centrality. Theor. Comput. Sci. Wei Chen, Shang-Hua Teng, Hanrui Zhang
2020	J	`jnl`	On the Equivalence Between High-Order Network-Influence Frameworks: General-Threshold, Hypergraph-Triggering, and Logic-Triggering Models. CoRR Wei Chen, Shang-Hua Teng, Hanrui Zhang
2020	A*	`conf`	Optimal Space-Depth Trade-Off of CNOT Circuits in Quantum Logic Synthesis. SODA Jiaqing Jiang, Xiaoming Sun, Shang-Hua Teng, Bujiao Wu, Kewen Wu, Jialin Zhang
2020	J	`jnl`	Quantum Combinatorial Games: Structures and Computational Complexity. CoRR Kyle Burke, Matthew Ferland, Shang-Hua Teng
2019	A	`conf`	Capturing Complementarity in Set Functions by Going Beyond Submodularity/Subadditivity. ITCS Wei Chen, Shang-Hua Teng, Hanrui Zhang
2019	J	`jnl`	Optimal Space-Depth Trade-Off of CNOT Circuits in Quantum Logic Synthesis. CoRR Jiaqing Jiang, Xiaoming Sun, Shang-Hua Teng, Bujiao Wu, Kewen Wu, Jialin Zhang
2018	J	`jnl`	A Systematic Framework and Characterization of Influence-Based Network Centrality. CoRR Wei Chen, Shang-Hua Teng, Hanrui Zhang
2018	J	`jnl`	Capturing Complementarity in Set Functions by Going Beyond Submodularity/Subadditivity. CoRR Wei Chen, Shang-Hua Teng, Hanrui Zhang
2018	B	`conf`	Going Beyond Traditional Characterizations in the Age of Big Data and Network Sciences (Invited Talk). ISAAC Shang-Hua Teng
2018	A	`conf`	Scalable Algorithms in the Age of Big Data and Network Sciences: Characterization, Primitives, and Techniques. WSDM Shang-Hua Teng
2017	A*	`conf`	Interplay between Social Influence and Network Centrality: A Comparative Study on Shapley Centrality and Single-Node-Influence Centrality. WWW Wei Chen, Shang-Hua Teng
2017	—	`conf`	Multi-layer Network Composition Under a Unified Dynamical Process. SBP-BRiMS Xiaoran Yan, Shang-Hua Teng, Kristina Lerman
2017	J	`jnl`	Network Essence: PageRank Completion and Centrality-Conforming Markov Chains. CoRR Shang-Hua Teng
2017	—	`ch.`	Trip Planning Queries in Road Network Databases. Encyclopedia of GIS Feifei Li, Marios Hadjieleftheriou, George Kollios, Dihan Cheng, Shang-Hua Teng
2016	A	`conf`	An Axiomatic Approach to Community Detection. ITCS Christian Borgs, Jennifer T. Chayes, Adrian Marple, Shang-Hua Teng
2016	J	`jnl`	Capturing the interplay of dynamics and networks through parameterizations of Laplacian operators. PeerJ Comput. Sci. Xiaoran Yan, Shang-Hua Teng, Kristina Lerman, Rumi Ghosh
2016	J	`jnl`	Interplay between Social Influence and Network Centrality: Shapley Values and Scalable Algorithms. CoRR Wei Chen, Shang-Hua Teng
2016	J	`jnl`	Maximum bipartite matchings with low rank data: Locality and perturbation analysis. Theor. Comput. Sci. Xingwu Liu, Shang-Hua Teng
2016	J	`jnl`	Network Composition from Multi-layer Data. CoRR Kristina Lerman, Shang-Hua Teng, Xiaoran Yan
2016	J	`jnl`	Scalable Algorithms for Data and Network Analysis. Found. Trends Theor. Comput. Sci. Shang-Hua Teng
2015	A*	`conf`	Efficient Sampling for Gaussian Graphical Models via Spectral Sparsification. COLT Dehua Cheng, Yu Cheng, Yan Liu, Richard Peng, Shang-Hua Teng
2015	A*	`conf`	Mixture Selection, Mechanism Design, and Signaling. FOCS Yu Cheng, Ho Yee Cheung, Shaddin Dughmi, Ehsan Emamjomeh-Zadeh, Li Han, Shang-Hua Teng
2015	J	`jnl`	Mixture Selection, Mechanism Design, and Signaling. CoRR Yu Cheng, Ho Yee Cheung, Shaddin Dughmi, Ehsan Emamjomeh-Zadeh, Li Han, Shang-Hua Teng
2015	J	`jnl`	Spectral Sparsification of Random-Walk Matrix Polynomials. CoRR Dehua Cheng, Yu Cheng, Yan Liu, Richard Peng, Shang-Hua Teng
2014	J	`jnl`	Bounded Budget Connection (BBC) games or how to make friends and influence people, on a budget. J. Comput. Syst. Sci. Nikolaos Laoutaris, Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng
2014	J	`jnl`	Efficient Clustering with Limited Distance Information. CoRR Konstantin Voevodski, Maria-Florina Balcan, Heiko Röglin, Shang-Hua Teng, Yu Xia
2014	J	`jnl`	Fixed-Points of Social Choice: An Axiomatic Approach to Network Communities. CoRR Christian Borgs, Jennifer T. Chayes, Adrian Marple, Shang-Hua Teng
2014	J	`jnl`	Multiscale Matrix Sampling and Sublinear-Time PageRank Computation. Internet Math. Christian Borgs, Michael Brautbar, Jennifer T. Chayes, Shang-Hua Teng
2014	J	`jnl`	Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems. SIAM J. Matrix Anal. Appl. Daniel A. Spielman, Shang-Hua Teng
2014	J	`jnl`	Scalable Parallel Factorizations of SDD Matrices and Efficient Sampling for Gaussian Graphical Models. CoRR Dehua Cheng, Yu Cheng, Yan Liu, Richard Peng, Shang-Hua Teng
2014	J	`jnl`	Signaling in Quasipolynomial time. CoRR Yu Cheng, Ho Yee Cheung, Shaddin Dughmi, Shang-Hua Teng
2014	J	`jnl`	The Interplay Between Dynamics and Networks: Centrality, Communities, and Cheeger Inequality. CoRR Rumi Ghosh, Kristina Lerman, Shang-Hua Teng, Xiaoran Yan
2014	A*	`conf`	The interplay between dynamics and networks: centrality, communities, and cheeger inequality. KDD Rumi Ghosh, Shang-Hua Teng, Kristina Lerman, Xiaoran Yan
2013	J	`jnl`	A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning. SIAM J. Comput. Daniel A. Spielman, Shang-Hua Teng
2013	A*	`conf`	Faster Canonical Forms for Strongly Regular Graphs. FOCS László Babai, Xi Chen, Xiaorui Sun, Shang-Hua Teng, John Wilmes
2013	A*	`conf`	Finding Endogenously Formed Communities. SODA Maria-Florina Balcan, Christian Borgs, Mark Braverman, Jennifer T. Chayes, Shang-Hua Teng
2013	A*	`conf`	Multi-stage design for quasipolynomial-time isomorphism testing of steiner 2-systems. STOC Xi Chen, Xiaorui Sun, Shang-Hua Teng
2013	Misc	`conf`	Perturbation Analysis of Maximum-Weighted Bipartite Matchings with Low Rank Data. COCOON Xingwu Liu, Shang-Hua Teng
2013	J	`jnl`	Reducibility among Fractional Stability Problems. SIAM J. Comput. Shiva Kintali, Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng
2013	J	`jnl`	Spectral sparsification of graphs: theory and algorithms. Commun. ACM Joshua D. Batson, Daniel A. Spielman, Nikhil Srivastava, Shang-Hua Teng
2012	C	`conf`	A Sublinear Time Algorithm for PageRank Computations. WAW Christian Borgs, Michael Brautbar, Jennifer T. Chayes, Shang-Hua Teng
2012	J	`jnl`	A compact routing scheme and approximate distance oracle for power-law graphs. ACM Trans. Algorithms Wei Chen, Christian Sommer, Shang-Hua Teng, Yajun Wang
2012	J	`jnl`	Active Clustering of Biological Sequences. J. Mach. Learn. Res. Konstantin Voevodski, Maria-Florina Balcan, Heiko Röglin, Shang-Hua Teng, Yu Xia
2012	J	`jnl`	I Like Her more than You: Self-determined Communities CoRR Maria-Florina Balcan, Christian Borgs, Mark Braverman, Jennifer T. Chayes, Shang-Hua Teng
2012	A*	`conf`	Power SVM: Generalization with exemplar classification uncertainty. CVPR Weiyu Zhang, Stella X. Yu, Shang-Hua Teng
2012	J	`jnl`	Sublinear Time Algorithm for PageRank Computations and Related Applications CoRR Christian Borgs, Michael Brautbar, Jennifer T. Chayes, Shang-Hua Teng
2011	A	`conf`	A Complexity View of Markets with Social Influence. ICS Xi Chen, Shang-Hua Teng
2011	J	`jnl`	Bounded budget betweenness centrality game for strategic network formations. Theor. Comput. Sci. Xiaohui Bei, Wei Chen, Shang-Hua Teng, Jialin Zhang, Jiajie Zhu
2011	A*	`conf`	Class Label Enhancement via Related Instances. EMNLP Zornitsa Kozareva, Konstantin Voevodski, Shang-Hua Teng
2011	J	`jnl`	Clustering Protein Sequences Given the Approximation Stability of the Min-Sum Objective Function CoRR Konstantin Voevodski, Maria-Florina Balcan, Heiko Röglin, Shang-Hua Teng, Yu Xia
2011	J	`jnl`	Competitive routing over time. Theor. Comput. Sci. Martin Hoefer, Vahab S. Mirrokni, Heiko Röglin, Shang-Hua Teng
2011	A*	`conf`	Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs. STOC Paul F. Christiano, Jonathan A. Kelner, Aleksander Madry, Daniel A. Spielman, Shang-Hua Teng
2011	—	`conf`	Min-sum Clustering of Protein Sequences with Limited Distance Information. SIMBAD Konstantin Voevodski, Maria-Florina Balcan, Heiko Röglin, Shang-Hua Teng, Yu Xia
2011	J	`jnl`	Non-Conservative Diffusion and its Application to Social Network Analysis CoRR Rumi Ghosh, Kristina Lerman, Tawan Surachawala, Konstantin Voevodski, Shang-Hua Teng
2011	—	`ch.`	Numerical Thinking in Algorithm Design and Analysis. Computer Science, The Hardware, Software and Heart of It Shang-Hua Teng
2011	J	`jnl`	Optimal Cache-Oblivious Mesh Layouts. Theory Comput. Syst. Michael A. Bender, Bradley C. Kuszmaul, Shang-Hua Teng, Kebin Wang
2011	J	`jnl`	Smoothed analysis of condition numbers and complexity implications for linear programming. Math. Program. John Dunagan, Daniel A. Spielman, Shang-Hua Teng
2011	J	`jnl`	Spectral Sparsification of Graphs. SIAM J. Comput. Daniel A. Spielman, Shang-Hua Teng
2010	J	`jnl`	A Complexity View of Markets with Social Influence CoRR Xi Chen, Shang-Hua Teng
2010	—	`conf`	Beyond convexity: local search and equilibrium computation. BQGT Shang-Hua Teng
2010	J	`jnl`	Efficient Clustering with Limited Distance Information CoRR Konstantin Voevodski, Maria-Florina Balcan, Heiko Röglin, Shang-Hua Teng, Yu Xia
2010	A	`conf`	Efficient Clustering with Limited Distance Information. UAI Konstantin Voevodski, Maria-Florina Balcan, Heiko Röglin, Shang-Hua Teng, Yu Xia
2010	J	`jnl`	Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs CoRR Paul F. Christiano, Jonathan A. Kelner, Aleksander Madry, Daniel A. Spielman, Shang-Hua Teng
2010	J	`jnl`	Foreword to special issue on SODA 2008. ACM Trans. Algorithms Mohammad Taghi Hajiaghayi, Shang-Hua Teng
2010	J	`jnl`	Metric uniformization and spectral bounds for graphs CoRR Jonathan A. Kelner, James R. Lee, Gregory N. Price, Shang-Hua Teng
2010	—	`conf`	On the complexity of equilibria in markets with additively separable utilities. BQGT Xi Chen, Decheng Dai, Ye Du, Shang-Hua Teng
2010	J	`jnl`	Quantum Separation of Local Search and Fixed Point Computation. Algorithmica Xi Chen, Xiaoming Sun, Shang-Hua Teng
2010	A*	`conf`	Subgraph sparsification and nearly optimal ultrasparsifiers. STOC Alexandra Kolla, Yury Makarychev, Amin Saberi, Shang-Hua Teng
2010	C	`conf`	The Laplacian Paradigm: Emerging Algorithms for Massive Graphs. TAMC Shang-Hua Teng
2009	B	`conf`	Agnostic Clustering. ALT Maria-Florina Balcan, Heiko Röglin, Shang-Hua Teng
2009	A	`conf`	Bounded Budget Betweenness Centrality Game for Strategic Network Formations. ESA Xiaohui Bei, Wei Chen, Shang-Hua Teng, Jialin Zhang, Jiajie Zhu
2009	—	`conf`	Colocation Games and Their Application to Distributed Resource Management. HotCloud Jorge Londoño, Azer Bestavros, Shang-Hua Teng
2009	J	`jnl`	Combinatorial and spectral aspects of nearest neighbor graphs in doubling dimensional and nearly-Euclidean spaces. Theor. Comput. Sci. Yingchao Zhao, Shang-Hua Teng
2009	A	`conf`	Compact Routing in Power-Law Graphs. DISC Wei Chen, Christian Sommer, Shang-Hua Teng, Yajun Wang
2009	—	`conf`	Competitive Routing over Time. WINE Martin Hoefer, Vahab S. Mirrokni, Heiko Röglin, Shang-Hua Teng
2009	J	`jnl`	Finding local communities in protein networks. BMC Bioinform. Konstantin Voevodski, Shang-Hua Teng, Yu Xia
2009	A*	`conf`	Higher Eigenvalues of Graphs. FOCS Jonathan A. Kelner, James R. Lee, Gregory N. Price, Shang-Hua Teng
2009	A*	`conf`	Learning and Smoothed Analysis. FOCS Adam Tauman Kalai, Alex Samorodnitsky, Shang-Hua Teng
2009	J	`jnl`	Market equilibria with hybrid linear-Leontief utilities. Theor. Comput. Sci. Xi Chen, Li-Sha Huang, Shang-Hua Teng
2009	Misc	`conf`	On the alpha-Sensitivity of Nash Equilibria in PageRank-Based Network Reputation Games. FAW Wei Chen, Shang-Hua Teng, Yajun Wang, Yuan Zhou
2009	J	`jnl`	Reducibility Among Fractional Stability Problems CoRR Shiva Kintali, Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng
2009	J	`jnl`	Reducibility Among Fractional Stability Problems. Electron. Colloquium Comput. Complex. Shiva Kintali, Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng
2009	A*	`conf`	Reducibility among Fractional Stability Problems. FOCS Shiva Kintali, Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng
2009	J	`jnl`	Settling the Complexity of Arrow-Debreu Equilibria in Markets with Additively Separable Utilities CoRR Xi Chen, Decheng Dai, Ye Du, Shang-Hua Teng
2009	A*	`conf`	Settling the Complexity of Arrow-Debreu Equilibria in Markets with Additively Separable Utilities. FOCS Xi Chen, Decheng Dai, Ye Du, Shang-Hua Teng
2009	J	`jnl`	Settling the complexity of computing two-player Nash equilibria. J. ACM Xi Chen, Xiaotie Deng, Shang-Hua Teng
2009	A*	`conf`	Smoothed Analysis of Multiobjective Optimization. FOCS Heiko Röglin, Shang-Hua Teng
2009	J	`jnl`	Smoothed analysis: an attempt to explain the behavior of algorithms in practice. Commun. ACM Daniel A. Spielman, Shang-Hua Teng
2009	J	`jnl`	Spectral affinity in protein networks. BMC Syst. Biol. Konstantin Voevodski, Shang-Hua Teng, Yu Xia
2009	B	`conf`	Spending Is Not Easier Than Trading: On the Computational Equivalence of Fisher and Arrow-Debreu Equilibria. ISAAC Xi Chen, Shang-Hua Teng
2009	J	`jnl`	Spending is not Easier than Trading: On the Computational Equivalence of Fisher and Arrow-Debreu Equilibria CoRR Xi Chen, Shang-Hua Teng
2009	J	`jnl`	Subgraph Sparsification and Nearly Optimal Ultrasparsifiers CoRR Alexandra Kolla, Yury Makarychev, Amin Saberi, Shang-Hua Teng
2009	J	`jnl`	The isolation game: A game of distances. Theor. Comput. Sci. Yingchao Zhao, Wei Chen, Shang-Hua Teng
2008	J	`jnl`	A Local Clustering Algorithm for Massive Graphs and its Application to Nearly-Linear Time Graph Partitioning CoRR Daniel A. Spielman, Shang-Hua Teng
2008	J	`jnl`	Atropos: A PSPACE-Complete Sperner Triangle Game. Internet Math. Kyle W. Burke, Shang-Hua Teng
2008	J	`jnl`	Bounded Budget Connection (BBC) Games or How to make friends and influence people, on a budget CoRR Nikolaos Laoutaris, Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng
2008	A*	`conf`	Bounded budget connection (BBC) games or how to make friends and influence people, on a budget. PODC Nikolaos Laoutaris, Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng
2008	J	`jnl`	Decision trees are PAC-learnable from most product distributions: a smoothed analysis CoRR Adam Tauman Kalai, Shang-Hua Teng
2008	J	`jnl`	Local Computation of PageRank Contributions. Internet Math. Reid Andersen, Christian Borgs, Jennifer T. Chayes, John E. Hopcroft, Vahab S. Mirrokni, Shang-Hua Teng
2008	J	`jnl`	Lower-Stretch Spanning Trees. SIAM J. Comput. Michael Elkin, Yuval Emek, Daniel A. Spielman, Shang-Hua Teng
2008	B	`conf`	On the Stability of Web Crawling and Web Search. ISAAC Reid Andersen, Christian Borgs, Jennifer T. Chayes, John E. Hopcroft, Vahab S. Mirrokni, Shang-Hua Teng
2008	J	`jnl`	Preference Games and Personalized Equilibria, with Applications to Fractional BGP CoRR Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng
2008	A*	`ed.`	Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008 SODA Shang-Hua Teng
2008	Misc	`conf`	Quantum Separation of Local Search and Fixed Point Computation. COCOON Xi Chen, Xiaoming Sun, Shang-Hua Teng
2008	—	`conf`	Robust PageRank and locally computable spam detection features. AIRWeb Reid Andersen, Christian Borgs, Jennifer T. Chayes, John E. Hopcroft, Kamal Jain, Vahab S. Mirrokni, Shang-Hua Teng
2008	J	`jnl`	Spectral Sparsification of Graphs CoRR Daniel A. Spielman, Shang-Hua Teng
2008	B	`conf`	The Isolation Game: A Game of Distances. ISAAC Yingchao Zhao, Wei Chen, Shang-Hua Teng
2008	—	`ch.`	Trip Planning Queries in Road Network Databases. Encyclopedia of GIS Feifei Li, Marios Hadjieleftheriou, George Kollios, Dihan Cheng, Shang-Hua Teng
2007	—	`conf`	07391 Abstracts Collection - Probabilistic Methods in the Design and Analysis of Algorithms. Probabilistic Methods in the Design and Analysis of Algorithms Martin Dietzfelbinger, Shang-Hua Teng, Eli Upfal, Berthold Vöcking
2007	—	`conf`	A PSPACE-complete Sperner Triangle Game. WINE Kyle W. Burke, Shang-Hua Teng
2007	J	`jnl`	A bounded-degree network formation game CoRR Nikolaos Laoutaris, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng
2007	C	`conf`	Combinatorial and Spectral Aspects of Nearest Neighbor Graphs in Doubling Dimensional and Nearly-Euclidean Spaces. TAMC Yingchao Zhao, Shang-Hua Teng
2007	C	`conf`	Game and Market Equilibria: Computation, Approximation, and Smoothed Analysis. AAIM Shang-Hua Teng
2007	J	`jnl`	Games on the Sperner Triangle CoRR Kyle W. Burke, Shang-Hua Teng
2007	C	`conf`	Local Computation of PageRank Contributions. WAW Reid Andersen, Christian Borgs, Jennifer T. Chayes, John E. Hopcroft, Vahab S. Mirrokni, Shang-Hua Teng
2007	Misc	`conf`	On the Approximation and Smoothed Complexity of Leontief Market Equilibria. FAW Li-Sha Huang, Shang-Hua Teng
2007	J	`jnl`	Optimal Cache-Oblivious Mesh Layouts CoRR Michael A. Bender, Bradley C. Kuszmaul, Shang-Hua Teng, Kebin Wang
2007	J	`jnl`	Parallel Delaunay Refinement: Algorithms and Analyses. Int. J. Comput. Geom. Appl. Daniel A. Spielman, Shang-Hua Teng, Alper Üngör
2007	J	`jnl`	Paths Beyond Local Search: A Nearly Tight Bound for Randomized Fixed-Point Computation CoRR Xi Chen, Shang-Hua Teng
2007	A*	`conf`	Paths Beyond Local Search: A Tight Bound for Randomized Fixed-Point Computation. FOCS Xi Chen, Shang-Hua Teng
2007	—	`ed.`	Probabilistic Methods in the Design and Analysis of Algorithms, 23.09. - 28.09.2007 Probabilistic Methods in the Design and Analysis of Algorithms Martin Dietzfelbinger, Shang-Hua Teng, Eli Upfal, Berthold Vöcking
2007	J	`jnl`	Settling the Complexity of Computing Two-Player Nash Equilibria CoRR Xi Chen, Xiaotie Deng, Shang-Hua Teng
2007	A*	`conf`	The approximation complexity of win-lose games. SODA Xi Chen, Shang-Hua Teng, Paul Valiant
2006	J	`jnl`	Computing Nash Equilibria: Approximation and Smoothed Complexity CoRR Xi Chen, Xiaotie Deng, Shang-Hua Teng
2006	A*	`conf`	Computing Nash Equilibria: Approximation and Smoothed Complexity. FOCS Xi Chen, Xiaotie Deng, Shang-Hua Teng
2006	J	`jnl`	Computing Nash Equilibria: Approximation and Smoothed Complexity. Electron. Colloquium Comput. Complex. Xi Chen, Xiaotie Deng, Shang-Hua Teng
2006	—	`conf`	Geometric Separator for d-Dimensional Ball Graphs. CCCG Kebin Wang, Shang-Hua Teng
2006	—	`conf`	Market Equilibria with Hybrid Linear-Leontief Utilities. WINE Xi Chen, Li-Sha Huang, Shang-Hua Teng
2006	J	`jnl`	Nearly-Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems CoRR Daniel A. Spielman, Shang-Hua Teng
2006	J	`jnl`	On the Approximation and Smoothed Complexity of Leontief Market Equilibria CoRR Li-Sha Huang, Shang-Hua Teng
2006	J	`jnl`	On the Approximation and Smoothed Complexity of Leontief Market Equilibria. Electron. Colloquium Comput. Complex. Li-Sha Huang, Shang-Hua Teng
2006	J	`jnl`	Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices. SIAM J. Matrix Anal. Appl. Arvind Sankar, Daniel A. Spielman, Shang-Hua Teng
2006	—	`conf`	Sparse Games Are Hard. WINE Xi Chen, Xiaotie Deng, Shang-Hua Teng
2006	J	`jnl`	Subspace gradient domain mesh deformation. ACM Trans. Graph. Jin Huang, Xiaohan Shi, Xinguo Liu, Kun Zhou, Li-Yi Wei, Shang-Hua Teng, Hujun Bao, Baining Guo, Heung-Yeung Shum
2006	—	`conf`	Truthful Auctions with Optimal Profit. WINE Pinyan Lu, Shang-Hua Teng, Changyuan Yu
2005	A*	`conf`	Lower-stretch spanning trees. STOC Michael Elkin, Yuval Emek, Daniel A. Spielman, Shang-Hua Teng
2005	B	`conf`	On Trip Planning Queries in Spatial Databases. SSTD Feifei Li, Dihan Cheng, Marios Hadjieleftheriou, George Kollios, Shang-Hua Teng
2005	Misc	`conf`	Smoothed Analysis of Algorithms and Heuristics. COCOON Shang-Hua Teng
2004	J	`jnl`	Lower-Stretch Spanning Trees CoRR Michael Elkin, Daniel A. Spielman, Shang-Hua Teng
2004	A*	`conf`	Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. STOC Daniel A. Spielman, Shang-Hua Teng
2004	—	`conf`	Parallel Delaunay Refinement with Off-Centers. Euro-Par Daniel A. Spielman, Shang-Hua Teng, Alper Üngör
2004	J	`jnl`	Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. J. ACM Daniel A. Spielman, Shang-Hua Teng
2004	B	`conf`	Time complexity of practical parallel steiner point insertion algorithms. SPAA Daniel A. Spielman, Shang-Hua Teng, Alper Üngör
2003	B	`conf`	Smoothed Analysis (Motivation and Discrete Models). WADS Daniel A. Spielman, Shang-Hua Teng
2003	J	`jnl`	Smoothed Analysis of Interior-Point Algorithms: Condition Number CoRR John Dunagan, Daniel A. Spielman, Shang-Hua Teng
2003	J	`jnl`	Smoothed Analysis of Interior-Point Algorithms: Termination CoRR Daniel A. Spielman, Shang-Hua Teng
2003	J	`jnl`	Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices CoRR Arvind Sankar, Daniel A. Spielman, Shang-Hua Teng
2003	J	`jnl`	Smoothed analysis of termination of linear programming algorithms. Math. Program. Daniel A. Spielman, Shang-Hua Teng
2003	A*	`conf`	Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time 0(m FOCS Daniel A. Spielman, Shang-Hua Teng
2003	J	`jnl`	Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time O(m CoRR Daniel A. Spielman, Shang-Hua Teng
2002	J	`jnl`	Guest Editor's Foreward. Theory Comput. Syst. Shang-Hua Teng
2002	—	`conf`	Parallel Delaunay Refinement: Algorithms And Analyses. IMR Daniel A. Spielman, Shang-Hua Teng, Alper Üngör
2002	J	`jnl`	Parallel Delaunay Refinement: Algorithms and Analyses CoRR Daniel A. Spielman, Shang-Hua Teng, Alper Üngör
2002	J	`jnl`	Recovering Mesh Geometry from a Stiffness Matrix. Numer. Algorithms Andreas Stathopoulos, Shang-Hua Teng
2001	A*	`conf`	Generating well-shaped Delaunay meshed in 3D. SODA Xiang-Yang Li, Shang-Hua Teng
2001	J	`jnl`	Min-max-boundary domain decomposition. Theor. Comput. Sci. Marcos A. Kiwi, Daniel A. Spielman, Shang-Hua Teng
2001	J	`jnl`	Smoothed Analysis of Algorithms: Why the Simplex Algorithm Usually Takes Polynomial Time CoRR Daniel A. Spielman, Shang-Hua Teng
2001	A*	`conf`	Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time. STOC Daniel A. Spielman, Shang-Hua Teng
2000	B	`ed.`	Algorithms and Computation, 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000, Proceedings ISAAC D. T. Lee, Shang-Hua Teng
2000	J	`jnl`	Guest Editor's Foreword. Int. J. Comput. Geom. Appl. Shang-Hua Teng
2000	B	`ed.`	Proceedings of the Twelfth annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2000, Bar Harbor, Maine, USA, July 9-13, 2000 SPAA Gary L. Miller, Shang-Hua Teng
2000	J	`jnl`	Regression Depth and Center Points. Discret. Comput. Geom. Nina Amenta, Marshall W. Bern, David Eppstein, Shang-Hua Teng
2000	J	`jnl`	Sliver exudation. J. ACM Siu-Wing Cheng, Tamal K. Dey, Herbert Edelsbrunner, Michael A. Facello, Shang-Hua Teng
2000	A*	`conf`	Smoothing and cleaning up slivers. STOC Herbert Edelsbrunner, Xiang-Yang Li, Gary L. Miller, Andreas Stathopoulos, Dafna Talmor, Shang-Hua Teng, Alper Üngör, Noel Walkington
2000	J	`jnl`	Unstructured Mesh Generation: Theory, Practice, and Perspectives. Int. J. Comput. Geom. Appl. Shang-Hua Teng, Chi Wai Wong
1999	—	`conf`	Biting Ellipses to Generate Anisotropic Mesh. IMR Xiang-Yang Li, Shang-Hua Teng, Alper Üngör
1999	—	`conf`	Biting Spheres in 3D. IMR Xiang-Yang Li, Shang-Hua Teng, Alper Üngör
1999	—	`conf`	Collaborative Web Crawling: Information Gathering/Processing over Internet. HICSS Shang-Hua Teng, Qi Lu, Matthias Eichstaedt, Daniel Alexander Ford, Tobin J. Lehman
1999	J	`jnl`	Data Generation for Geometric Algorithms on Non-Uniform Distributions. Int. J. Comput. Geom. Appl. Gary L. Miller, Dafna Talmor, Shang-Hua Teng
1999	—	`conf`	Efficient Large-Scale Access Control for Internet/Intranet Information Systems. HICSS Shang-Hua Teng, Qi Lu
1999	J	`jnl`	Fault Tolerance Properties of Pyramid Networks. IEEE Trans. Computers Feng Cao, Ding-Zhu Du, D. Frank Hsu, Shang-Hua Teng
1999	J	`jnl`	Low Energy and Mutually Distant Sampling. J. Algorithms Shang-Hua Teng
1999	J	`jnl`	Optimal Coarsening of Unstructured Meshes. J. Algorithms Gary L. Miller, Dafna Talmor, Shang-Hua Teng
1999	J	`jnl`	Parallel Construction of Quadtrees and Quality Triangulations. Int. J. Comput. Geom. Appl. Marshall W. Bern, David Eppstein, Shang-Hua Teng
1999	J	`jnl`	Practical Human-Machine Identification over Insecure Channels. J. Comb. Optim. Xiang-Yang Li, Shang-Hua Teng
1999	J	`jnl`	Simultaneous Refinement and Coarsening for Adaptive Meshing. Eng. Comput. Xiang-Yang Li, Shang-Hua Teng, Alper Üngör
1999	—	`conf`	Sliver Exudation. SCG Siu-Wing Cheng, Tamal K. Dey, Herbert Edelsbrunner, Michael A. Facello, Shang-Hua Teng
1999	J	`jnl`	The Dynamic Parallel Complexity of Computational Circuits. SIAM J. Comput. Gary L. Miller, Shang-Hua Teng
1998	J	`jnl`	Combinatorial aspects of geometric graphs. Comput. Geom. Shang-Hua Teng
1998	—	`conf`	Dynamic Load Balancing for Parallel Adaptive Mesh Refinement. IRREGULAR Xiang-Yang Li, Shang-Hua Teng
1998	J	`jnl`	Geometric Mesh Partitioning: Implementation and Experiments. SIAM J. Sci. Comput. John R. Gilbert, Gary L. Miller, Shang-Hua Teng
1998	J	`jnl`	Geometric Separators for Finite-Element Meshes. SIAM J. Sci. Comput. Gary L. Miller, Shang-Hua Teng, William P. Thurston, Stephen A. Vavasis
1998	Misc	`conf`	Min-Max-Boundary Domain Decomposition. COCOON Marcos A. Kiwi, Daniel A. Spielman, Shang-Hua Teng
1998	J	`jnl`	Optimal On-Line Scheduling of Parallel Jobs with Dependencies. J. Comb. Optim. Anja Feldmann, Ming-Yang Kao, Jirí Sgall, Shang-Hua Teng
1998	—	`conf`	Parallel Profile Matching for Large Scale Webcasting. IRREGULAR Matthias Eichstaedt, Qi Lu, Shang-Hua Teng
1998	J	`jnl`	Provably Good Partitioning and Load Balancing Algorithms for Parallel Adaptive N-Body Simulation. SIAM J. Sci. Comput. Shang-Hua Teng
1998	J	`jnl`	Regression Depth and Center Points CoRR Nina Amenta, Marshall W. Bern, David Eppstein, Shang-Hua Teng
1998	J	`jnl`	Simple and Efficient Graph Compression Schemes for Dense and Complement Graphs. J. Comb. Optim. Ming-Yang Kao, Neill Occhiogrosso, Shang-Hua Teng
1998	—	`conf`	Simultaneous Refinement and Coarsening: Adaptive Meshing with Moving Boundaries. IMR Xiang-Yang Li, Shang-Hua Teng, Alper Üngör
1998	—	`ed.`	Solving Irregularly Structured Problems in Parallel, 5th International Symposium, IRREGULAR '98, Berkeley, California, USA, August 9-11, 1998, Proceedings IRREGULAR Afonso Ferreira, José D. P. Rolim, Horst D. Simon, Shang-Hua Teng
1997	—	`conf`	A Data-Parallel Adaptive N-body Method. PP Y. Charlie Hu, S. Lennart Johnsson, Shang-Hua Teng
1997	—	`conf`	A Data-Parallel Implementation of the Geometric Partitioning Algorithm. PP Y. Charlie Hu, Shang-Hua Teng, S. Lennart Johnsson
1997	J	`jnl`	Approximating Shortest Superstrings. SIAM J. Comput. Shang-Hua Teng, F. Frances Yao
1997	Misc	`conf`	Eigenvalues, Eigenvectors, and Graph Partitioning. COCOON Shang-Hua Teng
1997	J	`jnl`	Fast Nested Dissection for Finite Element Meshes. SIAM J. Matrix Anal. Appl. Shang-Hua Teng
1997	Misc	`conf`	Fault-tolerant Properties of Pyramid Network. PDPTA Feng Cao, Ding-Zhu Du, Shang-Hua Teng
1997	B	`conf`	High Performance FORTRAN for Highly Unstructured Problems. PPoPP Y. Charlie Hu, S. Lennart Johnsson, Shang-Hua Teng
1997	J	`jnl`	How Good is Recursive Bisection? SIAM J. Sci. Comput. Horst D. Simon, Shang-Hua Teng
1997	J	`jnl`	Moments of Inertia and Graph Separators. J. Comb. Optim. Keith D. Gremban, Gary L. Miller, Shang-Hua Teng
1997	A*	`conf`	Optimal Good-Aspect-Ratio Coarsening for Unstructured Meshes. SODA Gary L. Miller, Dafna Talmor, Shang-Hua Teng
1997	J	`jnl`	Separators for sphere-packings and nearest neighbor graphs. J. ACM Gary L. Miller, Shang-Hua Teng, William P. Thurston, Stephen A. Vavasis
1997	J	`jnl`	Tree-Based Parallel Algorithm Design. Algorithmica Gary L. Miller, Shang-Hua Teng
1996	J	`jnl`	Approximating center points with iterative Radon points. Int. J. Comput. Geom. Appl. Kenneth L. Clarkson, David Eppstein, Gary L. Miller, Carl Sturtivant, Shang-Hua Teng
1996	—	`conf`	Disk Packings and Planar Separators. SCG Daniel A. Spielman, Shang-Hua Teng
1996	Misc	`conf`	Fast Separator Decomposition for Finite Element Meshes. COCOON Shang-Hua Teng
1996	A*	`conf`	Spectral Partitioning Works: Planar Graphs and Finite Element Meshes. FOCS Daniel A. Spielman, Shang-Hua Teng
1995	A*	`conf`	A Delaunay based numerical method for three dimensions: generation, formulation, and partition. STOC Gary L. Miller, Dafna Talmor, Shang-Hua Teng, Noel Walkington
1995	J	`jnl`	A Deterministic Linear Time Algorithm for Geometric Separators and its Applications. Fundam. Informaticae David Eppstein, Gary L. Miller, Shang-Hua Teng
1995	J	`jnl`	An Optimal Parallel Algorithm for Planar Cycle Separators. Algorithmica Ming-Yang Kao, Shang-Hua Teng, Kentaro Toyama
1995	J	`jnl`	Generating Local Address and Communication Sets for Data-Parallel Programs. J. Parallel Distributed Comput. Siddhartha Chatterjee, John R. Gilbert, Fred J. E. Long, Robert Schreiber, Shang-Hua Teng
1995	—	`conf`	Geometric mesh partitioning: implementation and experiments. IPPS John R. Gilbert, Gary L. Miller, Shang-Hua Teng
1995	J	`jnl`	Independent Sets Versus Perfect Matchings. Theor. Comput. Sci. Shang-Hua Teng
1995	J	`jnl`	Optimal Evaluation of Array Expressions on Massively Parallel Machines. ACM Trans. Program. Lang. Syst. Siddhartha Chatterjee, John R. Gilbert, Robert Schreiber, Shang-Hua Teng
1994	J	`jnl`	Dynamic Scheduling on Parallel Machines. Theor. Comput. Sci. Anja Feldmann, Jirí Sgall, Shang-Hua Teng
1994	J	`jnl`	Functional Inversion and Communication Complexity. J. Cryptol. Shang-Hua Teng
1994	A*	`conf`	Moments of Inertia and Graph Separators. SODA Keith D. Gremban, Gary L. Miller, Shang-Hua Teng
1994	J	`jnl`	On the Complexity of Computing the Diameter of a Polytope. Comput. Complex. Alan M. Frieze, Shang-Hua Teng
1994	B	`conf`	Simple and Efficient Graph Compression Schemes for Dense and Complement Graphs. ISAAC Ming-Yang Kao, Shang-Hua Teng
1993	—	`conf`	A Deterministic Linear Time Algorithm for Geometric Separators and its Applications. SCG David Eppstein, Gary L. Miller, Shang-Hua Teng
1993	—	`conf`	Approximating Center Points with Iterated Radon Points. SCG Kenneth L. Clarkson, David Eppstein, Gary L. Miller, Carl Sturtivant, Shang-Hua Teng
1993	A*	`conf`	Approximating Shortest Superstrings FOCS Shang-Hua Teng, F. Frances Yao
1993	A*	`conf`	Automatic Array Alignment in Data-Parallel Programs. POPL Siddhartha Chatterjee, John R. Gilbert, Robert Schreiber, Shang-Hua Teng
1993	B	`conf`	Generating Local Address and Communication Sets for Data-Parallel Programs. PPoPP Siddhartha Chatterjee, John R. Gilbert, Fred J. E. Long, Robert Schreiber, Shang-Hua Teng
1993	B	`conf`	Improved Parallel Depth-First Search in Undirected Planar Graphs. WADS Ming-Yang Kao, Shang-Hua Teng, Kentaro Toyama
1993	A*	`conf`	Optimal online scheduling of parallel jobs with dependencies. STOC Anja Feldmann, Ming-Yang Kao, Jirí Sgall, Shang-Hua Teng
1993	B	`conf`	Parallel Construction of Quadtrees and Quality Triangulations. WADS Marshall W. Bern, David Eppstein, Shang-Hua Teng
1992	—	`conf`	Optimal Evaluation of Array Expressions on Massively Parallel Machines (Extended Abstract). SIGPLAN Workshop Siddhartha Chatterjee, John R. Gilbert, Robert Schneider, Shang-Hua Teng
1992	B	`conf`	Separator Based Parallel Divide and Conquer in Computational Geometry. SPAA Alan M. Frieze, Gary L. Miller, Shang-Hua Teng
1991	A*	`conf`	A Unified Geometric Approach to Graph Separators FOCS Gary L. Miller, Shang-Hua Teng, Stephen A. Vavasis
1991	A*	`conf`	Dynamic Scheduling on Parallel Machines FOCS Anja Feldmann, Jirí Sgall, Shang-Hua Teng
1991	A*	`conf`	Functional Inversion and Communication Complexity. CRYPTO Shang-Hua Teng
1990	J	`jnl`	Adaptive Parallel Algorithms for Integral Knapsack Problems. J. Parallel Distributed Comput. Shang-Hua Teng
1990	J	`jnl`	Security, Verifiability, and Universality in Distributed Computing. J. Algorithms Ming-Deh A. Huang, Shang-Hua Teng
1990	J	`jnl`	Space Efficient Processor Identity Protocol. Inf. Process. Lett. Shang-Hua Teng
1989	B	`conf`	Constructing Trees in Parallel. SPAA Mikhail J. Atallah, S. Rao Kosaraju, Lawrence L. Larmore, Gary L. Miller, Shang-Hua Teng
1988	A*	`conf`	A Universal Problem in Secure and Verifiable Distributed Computation. CRYPTO Ming-Deh A. Huang, Shang-Hua Teng
1988	A*	`conf`	Secure and Verifiable Schemes for Election and General Distributed Computing Problems. PODC Ming-Deh A. Huang, Shang-Hua Teng
1987	A*	`conf`	Dynamic Parallel Complexity of Computational Circuits STOC Gary L. Miller, Shang-Hua Teng
1987	J	`jnl`	Parallel Algorithms for Message Decomposition. J. Parallel Distributed Comput. Shang-Hua Teng, Bin Wang
1987	J	`jnl`	The construction of Huffman-equivalent prefix code in NC. SIGACT News Shang-Hua Teng