default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShang-Hua Teng
Person information
- affiliation: Boston University, USA
- award (2009): Fulkerson Prize
- award (2008,2015): Gödel Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j80]Kyle Burke, Matthew Ferland
, Shang-Hua Teng:
Nimber-preserving reduction: Game secrets and homomorphic Sprague-Grundy theorem. Theor. Comput. Sci. 1005: 114636 (2024)- [c113]Julian Asilis, Siddartha Devic, Shaddin Dughmi, Vatsal Sharan, Shang-Hua Teng:
Regularization and Optimal Multiclass Learning. COLT 2024: 260-310 - [c112]Julian Asilis, Siddartha Devic, Shaddin Dughmi, Vatsal Sharan, Shang-Hua Teng:
Open Problem: Can Local Regularization Learn All Multiclass Problems? COLT 2024: 5301-5305 - [c111]Kyle Burke, Matthew Ferland, Svenja Huntemann, Shang-Hua Teng:
A Tractability Gap Beyond Nim-Sums: It's Hard to Tell Whether a Bunch of Superstars Are Losers. FUN 2024: 8:1-8:14 - [i59]Julian Asilis, Siddartha Devic, Shaddin Dughmi, Vatsal Sharan, Shang-Hua Teng:
Learnability is a Compact Property. CoRR abs/2402.10360 (2024) - [i58]Kyle Burke, Matthew Ferland, Svenja Huntemann, Shang-Hua Teng:
A Tractability Gap Beyond Nim-Sums: It's Hard to Tell Whether a Bunch of Superstars Are Losers. CoRR abs/2403.04955 (2024) - [i57]Siwei Wang, Yifei Shen, Shi Feng, Haoran Sun, Shang-Hua Teng, Wei Chen:
ALPINE: Unveiling the Planning Capability of Autoregressive Learning in Language Models. CoRR abs/2405.09220 (2024) - 2023
- [j79]Shang-Hua Teng:
Technical Perspective: Maximum Flow through a Network: A Storied Problem and a Groundbreaking Solution. Commun. ACM 66(12): 84 (2023) - [j78]Rumi Ghosh, Kristina Lerman, Tawan Surachawala, Konstantin Voevodski, Shang-Hua Teng:
Non-conservative diffusion and its application to social network analysis. J. Complex Networks 12(1) (2023) - [j77]Shang-Hua Teng:
"Intelligent Heuristics Are the Future of Computing". ACM Trans. Intell. Syst. Technol. 14(6): 96:1-96:39 (2023) - [i56]Julian Asilis, Siddartha Devic, Shaddin Dughmi, Vatsal Sharan, Shang-Hua Teng:
Regularization and Optimal Multiclass Learning. CoRR abs/2309.13692 (2023) - 2022
- [c110]Kyle W. Burke, Matthew Ferland, Shang-Hua Teng:
Nimber-Preserving Reduction: Game Secrets And Homomorphic Sprague-Grundy Theorem. FUN 2022: 10:1-10:17 - [c109]Kyle W. Burke, Matthew Ferland, Shang-Hua Teng:
Quantum-Inspired Combinatorial Games: Algorithms and Complexity. FUN 2022: 11:1-11:20 - [c108]Shang-Hua Teng:
Beyond Traditional Characterizations in the Age of Data: Big Models, Scalable Algorithms, and Meaningful Solutions. KDD 2022: 3 - 2021
- [c107]Sina Dehghani, Hamed Saleh, Saeed Seddighin, Shang-Hua Teng:
Computational Analyses of the Electoral College: Campaigning Is Hard But Approximately Manageable. AAAI 2021: 5294-5302 - [c106]Kyle W. Burke, Matthew T. Ferland, Shang-Hua Teng:
Winning the War by (Strategically) Losing Battles: Settling the Complexity of Grundy-Values in Undirected Geography. FOCS 2021: 1217-1228 - [i55]Kyle Burke, Matthew Ferland, Shang-Hua Teng:
Transverse Wave: an impartial color-propagation game inspired by Social Influence and Quantum Nim. CoRR abs/2101.07237 (2021) - [i54]Kyle Burke, Matthew Ferland, Shang-Hua Teng:
Winning the War by (Strategically) Losing Battles: Settling the Complexity of Grundy-Values in Undirected Geography. CoRR abs/2106.02114 (2021) - [i53]Kyle Burke, Matthew Ferland, Shang-Hua Teng:
Nimber-Preserving Reductions and Homomorphic Sprague-Grundy Game Encodings. CoRR abs/2109.05622 (2021) - 2020
- [j76]Wei Chen, Shang-Hua Teng, Hanrui Zhang:
A graph-theoretical basis of stochastic-cascading network influence: Characterizations of influence-based centrality. Theor. Comput. Sci. 824-825: 92-111 (2020) - [c105]Jiaqing Jiang, Xiaoming Sun, Shang-Hua Teng, Bujiao Wu, Kewen Wu, Jialin Zhang:
Optimal Space-Depth Trade-Off of CNOT Circuits in Quantum Logic Synthesis. SODA 2020: 213-229 - [i52]Kyle Burke, Matthew Ferland, Shang-Hua Teng:
Quantum Combinatorial Games: Structures and Computational Complexity. CoRR abs/2011.03704 (2020) - [i51]Wei Chen, Shang-Hua Teng, Hanrui Zhang:
On the Equivalence Between High-Order Network-Influence Frameworks: General-Threshold, Hypergraph-Triggering, and Logic-Triggering Models. CoRR abs/2012.00355 (2020)
2010 – 2019
- 2019
- [c104]Wei Chen, Shang-Hua Teng, Hanrui Zhang:
Capturing Complementarity in Set Functions by Going Beyond Submodularity/Subadditivity. ITCS 2019: 24:1-24:20 - [i50]Jiaqing Jiang, Xiaoming Sun, Shang-Hua Teng, Bujiao Wu, Kewen Wu, Jialin Zhang:
Optimal Space-Depth Trade-Off of CNOT Circuits in Quantum Logic Synthesis. CoRR abs/1907.05087 (2019) - 2018
- [c103]Shang-Hua Teng:
Going Beyond Traditional Characterizations in the Age of Big Data and Network Sciences (Invited Talk). ISAAC 2018: 1:1-1:1 - [c102]Shang-Hua Teng:
Scalable Algorithms in the Age of Big Data and Network Sciences: Characterization, Primitives, and Techniques. WSDM 2018: 6-7 - [i49]Wei Chen, Shang-Hua Teng, Hanrui Zhang:
Capturing Complementarity in Set Functions by Going Beyond Submodularity/Subadditivity. CoRR abs/1805.04436 (2018) - [i48]Wei Chen, Shang-Hua Teng, Hanrui Zhang:
A Systematic Framework and Characterization of Influence-Based Network Centrality. CoRR abs/1810.09981 (2018) - 2017
- [c101]Xiaoran Yan, Shang-Hua Teng, Kristina Lerman:
Multi-layer Network Composition Under a Unified Dynamical Process. SBP-BRiMS 2017: 315-321 - [c100]Wei Chen, Shang-Hua Teng:
Interplay between Social Influence and Network Centrality: A Comparative Study on Shapley Centrality and Single-Node-Influence Centrality. WWW 2017: 967-976 - [r2]Feifei Li, Marios Hadjieleftheriou, George Kollios, Dihan Cheng, Shang-Hua Teng:
Trip Planning Queries in Road Network Databases. Encyclopedia of GIS 2017: 2338-2343 - [i47]Shang-Hua Teng:
Network Essence: PageRank Completion and Centrality-Conforming Markov Chains. CoRR abs/1708.07906 (2017) - 2016
- [j75]Shang-Hua Teng:
Scalable Algorithms for Data and Network Analysis. Found. Trends Theor. Comput. Sci. 12(1-2): 1-274 (2016) - [j74]Xiaoran Yan, Shang-Hua Teng, Kristina Lerman, Rumi Ghosh:
Capturing the interplay of dynamics and networks through parameterizations of Laplacian operators. PeerJ Comput. Sci. 2: e57 (2016) - [j73]Xingwu Liu, Shang-Hua Teng:
Maximum bipartite matchings with low rank data: Locality and perturbation analysis. Theor. Comput. Sci. 621: 82-91 (2016) - [c99]Christian Borgs, Jennifer T. Chayes, Adrian Marple, Shang-Hua Teng:
An Axiomatic Approach to Community Detection. ITCS 2016: 135-146 - [i46]Wei Chen, Shang-Hua Teng:
Interplay between Social Influence and Network Centrality: Shapley Values and Scalable Algorithms. CoRR abs/1602.03780 (2016) - [i45]Kristina Lerman, Shang-Hua Teng, Xiaoran Yan:
Network Composition from Multi-layer Data. CoRR abs/1609.01641 (2016) - 2015
- [c98]Dehua Cheng, Yu Cheng, Yan Liu, Richard Peng, Shang-Hua Teng:
Efficient Sampling for Gaussian Graphical Models via Spectral Sparsification. COLT 2015: 364-390 - [c97]Yu Cheng, Ho Yee Cheung, Shaddin Dughmi, Ehsan Emamjomeh-Zadeh, Li Han, Shang-Hua Teng:
Mixture Selection, Mechanism Design, and Signaling. FOCS 2015: 1426-1445 - [i44]Dehua Cheng, Yu Cheng, Yan Liu, Richard Peng, Shang-Hua Teng:
Spectral Sparsification of Random-Walk Matrix Polynomials. CoRR abs/1502.03496 (2015) - [i43]Yu Cheng, Ho Yee Cheung, Shaddin Dughmi, Ehsan Emamjomeh-Zadeh, Li Han, Shang-Hua Teng:
Mixture Selection, Mechanism Design, and Signaling. CoRR abs/1508.03679 (2015) - 2014
- [j72]Christian Borgs, Michael Brautbar, Jennifer T. Chayes, Shang-Hua Teng:
Multiscale Matrix Sampling and Sublinear-Time PageRank Computation. Internet Math. 10(1-2): 20-48 (2014) - [j71]Nikolaos Laoutaris, Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng:
Bounded Budget Connection (BBC) games or how to make friends and influence people, on a budget. J. Comput. Syst. Sci. 80(7): 1266-1284 (2014) - [j70]Daniel A. Spielman, Shang-Hua Teng:
Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems. SIAM J. Matrix Anal. Appl. 35(3): 835-885 (2014) - [c96]Rumi Ghosh, Shang-Hua Teng, Kristina Lerman, Xiaoran Yan:
The interplay between dynamics and networks: centrality, communities, and cheeger inequality. KDD 2014: 1406-1415 - [i42]Rumi Ghosh, Kristina Lerman, Shang-Hua Teng, Xiaoran Yan:
The Interplay Between Dynamics and Networks: Centrality, Communities, and Cheeger Inequality. CoRR abs/1406.3387 (2014) - [i41]Konstantin Voevodski, Maria-Florina Balcan, Heiko Röglin, Shang-Hua Teng, Yu Xia:
Efficient Clustering with Limited Distance Information. CoRR abs/1408.2045 (2014) - [i40]Yu Cheng, Ho Yee Cheung, Shaddin Dughmi, Shang-Hua Teng:
Signaling in Quasipolynomial time. CoRR abs/1410.3033 (2014) - [i39]Christian Borgs, Jennifer T. Chayes, Adrian Marple, Shang-Hua Teng:
Fixed-Points of Social Choice: An Axiomatic Approach to Network Communities. CoRR abs/1410.5152 (2014) - [i38]Dehua Cheng, Yu Cheng, Yan Liu, Richard Peng, Shang-Hua Teng:
Scalable Parallel Factorizations of SDD Matrices and Efficient Sampling for Gaussian Graphical Models. CoRR abs/1410.5392 (2014) - 2013
- [j69]Joshua D. Batson, Daniel A. Spielman, Nikhil Srivastava, Shang-Hua Teng:
Spectral sparsification of graphs: theory and algorithms. Commun. ACM 56(8): 87-94 (2013) - [j68]Daniel A. Spielman, Shang-Hua Teng:
A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning. SIAM J. Comput. 42(1): 1-26 (2013) - [j67]Shiva Kintali, Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng:
Reducibility among Fractional Stability Problems. SIAM J. Comput. 42(6): 2063-2113 (2013) - [c95]Xingwu Liu, Shang-Hua Teng:
Perturbation Analysis of Maximum-Weighted Bipartite Matchings with Low Rank Data. COCOON 2013: 705-712 - [c94]László Babai, Xi Chen, Xiaorui Sun, Shang-Hua Teng, John Wilmes:
Faster Canonical Forms for Strongly Regular Graphs. FOCS 2013: 157-166 - [c93]Maria-Florina Balcan, Christian Borgs, Mark Braverman, Jennifer T. Chayes, Shang-Hua Teng:
Finding Endogenously Formed Communities. SODA 2013: 767-783 - [c92]Xi Chen, Xiaorui Sun, Shang-Hua Teng:
Multi-stage design for quasipolynomial-time isomorphism testing of steiner 2-systems. STOC 2013: 271-280 - 2012
- [j66]Konstantin Voevodski, Maria-Florina Balcan, Heiko Röglin, Shang-Hua Teng, Yu Xia:
Active Clustering of Biological Sequences. J. Mach. Learn. Res. 13: 203-225 (2012) - [j65]Wei Chen, Christian Sommer, Shang-Hua Teng, Yajun Wang:
A compact routing scheme and approximate distance oracle for power-law graphs. ACM Trans. Algorithms 9(1): 4:1-4:26 (2012) - [c91]Weiyu Zhang, Stella X. Yu, Shang-Hua Teng:
Power SVM: Generalization with exemplar classification uncertainty. CVPR 2012: 2144-2151 - [c90]Christian Borgs, Michael Brautbar, Jennifer T. Chayes, Shang-Hua Teng:
A Sublinear Time Algorithm for PageRank Computations. WAW 2012: 41-53 - [i37]Maria-Florina Balcan, Christian Borgs, Mark Braverman, Jennifer T. Chayes, Shang-Hua Teng:
I Like Her more than You: Self-determined Communities. CoRR abs/1201.4899 (2012) - [i36]Christian Borgs, Michael Brautbar, Jennifer T. Chayes, Shang-Hua Teng:
Sublinear Time Algorithm for PageRank Computations and Related Applications. CoRR abs/1202.2771 (2012) - 2011
- [j64]John Dunagan, Daniel A. Spielman, Shang-Hua Teng:
Smoothed analysis of condition numbers and complexity implications for linear programming. Math. Program. 126(2): 315-350 (2011) - [j63]Michael A. Bender, Bradley C. Kuszmaul, Shang-Hua Teng, Kebin Wang:
Optimal Cache-Oblivious Mesh Layouts. Theory Comput. Syst. 48(2): 269-296 (2011) - [j62]Daniel A. Spielman, Shang-Hua Teng:
Spectral Sparsification of Graphs. SIAM J. Comput. 40(4): 981-1025 (2011) - [j61]Martin Hoefer, Vahab S. Mirrokni, Heiko Röglin, Shang-Hua Teng:
Competitive routing over time. Theor. Comput. Sci. 412(39): 5420-5432 (2011) - [j60]Xiaohui Bei, Wei Chen, Shang-Hua Teng, Jialin Zhang, Jiajie Zhu:
Bounded budget betweenness centrality game for strategic network formations. Theor. Comput. Sci. 412(52): 7147-7168 (2011) - [c89]Zornitsa Kozareva, Konstantin Voevodski, Shang-Hua Teng:
Class Label Enhancement via Related Instances. EMNLP 2011: 118-128 - [c88]Xi Chen, Shang-Hua Teng:
A Complexity View of Markets with Social Influence. ICS 2011: 141-154 - [c87]Konstantin Voevodski, Maria-Florina Balcan, Heiko Röglin, Shang-Hua Teng, Yu Xia:
Min-sum Clustering of Protein Sequences with Limited Distance Information. SIMBAD 2011: 192-206 - [c86]Paul F. Christiano, Jonathan A. Kelner, Aleksander Madry, Daniel A. Spielman, Shang-Hua Teng:
Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs. STOC 2011: 273-282 - [p1]Shang-Hua Teng:
Numerical Thinking in Algorithm Design and Analysis. Computer Science, The Hardware, Software and Heart of It 2011: 349-384 - [i35]Konstantin Voevodski, Maria-Florina Balcan, Heiko Röglin, Shang-Hua Teng, Yu Xia:
Clustering Protein Sequences Given the Approximation Stability of the Min-Sum Objective Function. CoRR abs/1101.3620 (2011) - [i34]Rumi Ghosh, Kristina Lerman, Tawan Surachawala, Konstantin Voevodski, Shang-Hua Teng:
Non-Conservative Diffusion and its Application to Social Network Analysis. CoRR abs/1102.4639 (2011) - 2010
- [j59]Xi Chen, Xiaoming Sun, Shang-Hua Teng:
Quantum Separation of Local Search and Fixed Point Computation. Algorithmica 56(3): 364-382 (2010) - [j58]Mohammad Taghi Hajiaghayi, Shang-Hua Teng:
Foreword to special issue on SODA 2008. ACM Trans. Algorithms 6(4): 58:1 (2010) - [c85]Xi Chen, Decheng Dai, Ye Du, Shang-Hua Teng:
On the complexity of equilibria in markets with additively separable utilities. BQGT 2010: 61:1 - [c84]Shang-Hua Teng:
Beyond convexity: local search and equilibrium computation. BQGT 2010: 63:1 - [c83]Alexandra Kolla, Yury Makarychev, Amin Saberi, Shang-Hua Teng:
Subgraph sparsification and nearly optimal ultrasparsifiers. STOC 2010: 57-66 - [c82]Shang-Hua Teng:
The Laplacian Paradigm: Emerging Algorithms for Massive Graphs. TAMC 2010: 2-14 - [c81]Konstantin Voevodski, Maria-Florina Balcan, Heiko Röglin, Shang-Hua Teng, Yu Xia:
Efficient Clustering with Limited Distance Information. UAI 2010: 632-640 - [i33]Jonathan A. Kelner, James R. Lee, Gregory N. Price, Shang-Hua Teng:
Metric uniformization and spectral bounds for graphs. CoRR abs/1008.3594 (2010) - [i32]Xi Chen, Shang-Hua Teng:
A Complexity View of Markets with Social Influence. CoRR abs/1009.0309 (2010) - [i31]Konstantin Voevodski, Maria-Florina Balcan, Heiko Röglin, Shang-Hua Teng, Yu Xia:
Efficient Clustering with Limited Distance Information. CoRR abs/1009.5168 (2010) - [i30]Paul F. Christiano, Jonathan A. Kelner, Aleksander Madry, Daniel A. Spielman, Shang-Hua Teng:
Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs. CoRR abs/1010.2921 (2010)
2000 – 2009
- 2009
- [j57]Konstantin Voevodski, Shang-Hua Teng, Yu Xia:
Finding local communities in protein networks. BMC Bioinform. 10: 297 (2009) - [j56]Konstantin Voevodski, Shang-Hua Teng, Yu Xia:
Spectral affinity in protein networks. BMC Syst. Biol. 3: 112 (2009) - [j55]Daniel A. Spielman, Shang-Hua Teng:
Smoothed analysis: an attempt to explain the behavior of algorithms in practice. Commun. ACM 52(10): 76-84 (2009) - [j54]Xi Chen, Xiaotie Deng, Shang-Hua Teng:
Settling the complexity of computing two-player Nash equilibria. J. ACM 56(3): 14:1-14:57 (2009) - [j53]Yingchao Zhao, Shang-Hua Teng:
Combinatorial and spectral aspects of nearest neighbor graphs in doubling dimensional and nearly-Euclidean spaces. Theor. Comput. Sci. 410(11): 1081-1092 (2009) - [j52]Xi Chen, Li-Sha Huang, Shang-Hua Teng:
Market equilibria with hybrid linear-Leontief utilities. Theor. Comput. Sci. 410(17): 1573-1580 (2009) - [j51]Yingchao Zhao, Wei Chen, Shang-Hua Teng:
The isolation game: A game of distances. Theor. Comput. Sci. 410(47-49): 4905-4919 (2009) - [c80]Maria-Florina Balcan, Heiko Röglin, Shang-Hua Teng:
Agnostic Clustering. ALT 2009: 384-398 - [c79]Xiaohui Bei, Wei Chen, Shang-Hua Teng, Jialin Zhang, Jiajie Zhu:
Bounded Budget Betweenness Centrality Game for Strategic Network Formations. ESA 2009: 227-238 - [c78]Wei Chen, Shang-Hua Teng, Yajun Wang, Yuan Zhou:
On the alpha-Sensitivity of Nash Equilibria in PageRank-Based Network Reputation Games. FAW 2009: 63-73 - [c77]Xi Chen, Decheng Dai, Ye Du, Shang-Hua Teng:
Settling the Complexity of Arrow-Debreu Equilibria in Markets with Additively Separable Utilities. FOCS 2009: 273-282 - [c76]Shiva Kintali, Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng:
Reducibility among Fractional Stability Problems. FOCS 2009: 283-292 - [c75]Adam Tauman Kalai, Alex Samorodnitsky, Shang-Hua Teng:
Learning and Smoothed Analysis. FOCS 2009: 395-404 - [c74]Heiko Röglin, Shang-Hua Teng:
Smoothed Analysis of Multiobjective Optimization. FOCS 2009: 681-690 - [c73]Jonathan A. Kelner, James R. Lee, Gregory N. Price, Shang-Hua Teng:
Higher Eigenvalues of Graphs. FOCS 2009: 735-744 - [c72]Jorge Londoño, Azer Bestavros, Shang-Hua Teng:
Colocation Games and Their Application to Distributed Resource Management. HotCloud 2009 - [c71]Xi Chen, Shang-Hua Teng:
Spending Is Not Easier Than Trading: On the Computational Equivalence of Fisher and Arrow-Debreu Equilibria. ISAAC 2009: 647-656 - [c70]Wei Chen, Christian Sommer, Shang-Hua Teng, Yajun Wang:
Compact Routing in Power-Law Graphs. DISC 2009: 379-391 - [c69]Martin Hoefer, Vahab S. Mirrokni, Heiko Röglin, Shang-Hua Teng:
Competitive Routing over Time. WINE 2009: 18-29 - [i29]Xi Chen, Decheng Dai, Ye Du, Shang-Hua Teng:
Settling the Complexity of Arrow-Debreu Equilibria in Markets with Additively Separable Utilities. CoRR abs/0904.0644 (2009) - [i28]Shiva Kintali, Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng:
Reducibility Among Fractional Stability Problems. CoRR abs/0904.1435 (2009) - [i27]Xi Chen, Shang-Hua Teng:
Spending is not Easier than Trading: On the Computational Equivalence of Fisher and Arrow-Debreu Equilibria. CoRR abs/0907.4130 (2009) - [i26]Alexandra Kolla, Yury Makarychev, Amin Saberi, Shang-Hua Teng:
Subgraph Sparsification and Nearly Optimal Ultrasparsifiers. CoRR abs/0912.1623 (2009) - [i25]Shiva Kintali, Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng:
Reducibility Among Fractional Stability Problems. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j50]Reid Andersen, Christian Borgs, Jennifer T. Chayes, John E. Hopcroft, Vahab S. Mirrokni, Shang-Hua Teng:
Local Computation of PageRank Contributions. Internet Math. 5(1): 23-45 (2008) - [j49]Kyle W. Burke, Shang-Hua Teng:
Atropos: A PSPACE-Complete Sperner Triangle Game. Internet Math. 5(4): 477-492 (2008) - [j48]Michael Elkin, Yuval Emek, Daniel A. Spielman, Shang-Hua Teng:
Lower-Stretch Spanning Trees. SIAM J. Comput. 38(2): 608-628 (2008) - [c68]Reid Andersen, Christian Borgs, Jennifer T. Chayes, John E. Hopcroft, Kamal Jain, Vahab S. Mirrokni, Shang-Hua Teng:
Robust PageRank and locally computable spam detection features. AIRWeb 2008: 69-76 - [c67]Xi Chen, Xiaoming Sun, Shang-Hua Teng:
Quantum Separation of Local Search and Fixed Point Computation. COCOON 2008: 170-179 - [c66]Yingchao Zhao, Wei Chen, Shang-Hua Teng:
The Isolation Game: A Game of Distances. ISAAC 2008: 148-158 - [c65]Reid Andersen, Christian Borgs, Jennifer T. Chayes, John E. Hopcroft, Vahab S. Mirrokni, Shang-Hua Teng:
On the Stability of Web Crawling and Web Search. ISAAC 2008: 680-691 - [c64]Nikolaos Laoutaris, Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng:
Bounded budget connection (BBC) games or how to make friends and influence people, on a budget. PODC 2008: 165-174 - [e5]Shang-Hua Teng:
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008. SIAM 2008 [contents] - [r1]Feifei Li, Marios Hadjieleftheriou, George Kollios, Dihan Cheng, Shang-Hua Teng:
Trip Planning Queries in Road Network Databases. Encyclopedia of GIS 2008: 1176-1181 - [i24]Nikolaos Laoutaris, Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng:
Bounded Budget Connection (BBC) Games or How to make friends and influence people, on a budget. CoRR abs/0806.1727 (2008) - [i23]Daniel A. Spielman, Shang-Hua Teng:
Spectral Sparsification of Graphs. CoRR abs/0808.4134 (2008) - [i22]Daniel A. Spielman, Shang-Hua Teng:
A Local Clustering Algorithm for Massive Graphs and its Application to Nearly-Linear Time Graph Partitioning. CoRR abs/0809.3232 (2008) - [i21]Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng:
Preference Games and Personalized Equilibria, with Applications to Fractional BGP. CoRR abs/0812.0598 (2008) - [i20]Adam Tauman Kalai, Shang-Hua Teng:
Decision trees are PAC-learnable from most product distributions: a smoothed analysis. CoRR abs/0812.0933 (2008) - 2007
- [j47]Shang-Hua Teng, Frances F. Yao:
k-Nearest-Neighbor Clustering and Percolation Theory. Algorithmica 49(3): 192-211 (2007) - [j46]Daniel A. Spielman, Shang-Hua Teng, Alper Üngör:
Parallel Delaunay Refinement: Algorithms and Analyses. Int. J. Comput. Geom. Appl. 17(1): 1-30 (2007) - [c63]Shang-Hua Teng:
Game and Market Equilibria: Computation, Approximation, and Smoothed Analysis. AAIM 2007: 424 - [c62]Li-Sha Huang, Shang-Hua Teng:
On the Approximation and Smoothed Complexity of Leontief Market Equilibria. FAW 2007: 96-107 - [c61]Xi Chen, Shang-Hua Teng:
Paths Beyond Local Search: A Tight Bound for Randomized Fixed-Point Computation. FOCS 2007: 124-134 - [c60]Xi Chen, Shang-Hua Teng, Paul Valiant:
The approximation complexity of win-lose games. SODA 2007: 159-168 - [c59]Yingchao Zhao, Shang-Hua Teng:
Combinatorial and Spectral Aspects of Nearest Neighbor Graphs in Doubling Dimensional and Nearly-Euclidean Spaces. TAMC 2007: 554-565 - [c58]Reid Andersen, Christian Borgs, Jennifer T. Chayes, John E. Hopcroft, Vahab S. Mirrokni, Shang-Hua Teng:
Local Computation of PageRank Contributions. WAW 2007: 150-165 - [c57]Kyle W. Burke, Shang-Hua Teng:
A PSPACE-complete Sperner Triangle Game. WINE 2007: 445-456 - [e4]Martin Dietzfelbinger, Shang-Hua Teng, Eli Upfal, Berthold Vöcking:
Probabilistic Methods in the Design and Analysis of Algorithms, 23.09. - 28.09.2007. Dagstuhl Seminar Proceedings 07391, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 [contents] - [i19]Martin Dietzfelbinger, Shang-Hua Teng, Eli Upfal, Berthold Vöcking:
07391 Abstracts Collection - Probabilistic Methods in the Design and Analysis of Algorithms. Probabilistic Methods in the Design and Analysis of Algorithms 2007 - [i18]Xi Chen, Xiaotie Deng, Shang-Hua Teng:
Settling the Complexity of Computing Two-Player Nash Equilibria. CoRR abs/0704.1678 (2007) - [i17]Michael A. Bender, Bradley C. Kuszmaul, Shang-Hua Teng, Kebin Wang:
Optimal Cache-Oblivious Mesh Layouts. CoRR abs/0705.1033 (2007) - [i16]Nikolaos Laoutaris, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng:
A bounded-degree network formation game. CoRR abs/cs/0701071 (2007) - [i15]Xi Chen, Shang-Hua Teng:
Paths Beyond Local Search: A Nearly Tight Bound for Randomized Fixed-Point Computation. CoRR abs/cs/0702088 (2007) - [i14]Kyle W. Burke, Shang-Hua Teng:
Games on the Sperner Triangle. CoRR abs/cs/0702153 (2007) - 2006
- [j45]Arvind Sankar, Daniel A. Spielman, Shang-Hua Teng:
Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices. SIAM J. Matrix Anal. Appl. 28(2): 446-476 (2006) - [j44]Jin Huang, Xiaohan Shi, Xinguo Liu, Kun Zhou, Li-Yi Wei, Shang-Hua Teng, Hujun Bao, Baining Guo, Heung-Yeung Shum:
Subspace gradient domain mesh deformation. ACM Trans. Graph. 25(3): 1126-1134 (2006) - [c56]Kebin Wang, Shang-Hua Teng:
Geometric Separator for d-Dimensional Ball Graphs. CCCG 2006 - [c55]Xi Chen, Xiaotie Deng, Shang-Hua Teng:
Computing Nash Equilibria: Approximation and Smoothed Complexity. FOCS 2006: 603-612 - [c54]Pinyan Lu, Shang-Hua Teng, Changyuan Yu:
Truthful Auctions with Optimal Profit. WINE 2006: 27-36 - [c53]Xi Chen, Xiaotie Deng, Shang-Hua Teng:
Sparse Games Are Hard. WINE 2006: 262-273 - [c52]Xi Chen, Li-Sha Huang, Shang-Hua Teng:
Market Equilibria with Hybrid Linear-Leontief Utilities. WINE 2006: 274-285 - [i13]Xi Chen, Xiaotie Deng, Shang-Hua Teng:
Computing Nash Equilibria: Approximation and Smoothed Complexity. CoRR abs/cs/0602043 (2006) - [i12]Li-Sha Huang, Shang-Hua Teng:
On the Approximation and Smoothed Complexity of Leontief Market Equilibria. CoRR abs/cs/0602090 (2006) - [i11]Daniel A. Spielman, Shang-Hua Teng:
Nearly-Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems. CoRR abs/cs/0607105 (2006) - [i10]Xi Chen, Xiaotie Deng, Shang-Hua Teng:
Computing Nash Equilibria: Approximation and Smoothed Complexity. Electron. Colloquium Comput. Complex. TR06 (2006) - [i9]Li-Sha Huang, Shang-Hua Teng:
On the Approximation and Smoothed Complexity of Leontief Market Equilibria. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [c51]Shang-Hua Teng:
Smoothed Analysis of Algorithms and Heuristics. COCOON 2005: 10-11 - [c50]Feifei Li, Dihan Cheng, Marios Hadjieleftheriou, George Kollios, Shang-Hua Teng:
On Trip Planning Queries in Spatial Databases. SSTD 2005: 273-290 - [c49]Michael Elkin, Yuval Emek, Daniel A. Spielman, Shang-Hua Teng:
Lower-stretch spanning trees. STOC 2005: 494-503 - 2004
- [j43]Daniel A. Spielman, Shang-Hua Teng:
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. J. ACM 51(3): 385-463 (2004) - [c48]Daniel A. Spielman, Shang-Hua Teng, Alper Üngör:
Parallel Delaunay Refinement with Off-Centers. Euro-Par 2004: 812-819 - [c47]Daniel A. Spielman, Shang-Hua Teng, Alper Üngör:
Time complexity of practical parallel steiner point insertion algorithms. SPAA 2004: 267-268 - [c46]Daniel A. Spielman, Shang-Hua Teng:
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. STOC 2004: 81-90 - [i8]Michael Elkin, Daniel A. Spielman, Shang-Hua Teng:
Lower-Stretch Spanning Trees. CoRR cs.DS/0411064 (2004) - 2003
- [j42]Daniel A. Spielman, Shang-Hua Teng:
Smoothed analysis of termination of linear programming algorithms. Math. Program. 97(1-2): 375-404 (2003) - [c45]Daniel A. Spielman, Shang-Hua Teng:
Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time 0(m1.31). FOCS 2003: 416-427 - [c44]Daniel A. Spielman, Shang-Hua Teng:
Smoothed Analysis (Motivation and Discrete Models). WADS 2003: 256-270 - [i7]Daniel A. Spielman, Shang-Hua Teng:
Smoothed Analysis of Interior-Point Algorithms: Termination. CoRR cs.DS/0301019 (2003) - [i6]John Dunagan, Daniel A. Spielman, Shang-Hua Teng:
Smoothed Analysis of Interior-Point Algorithms: Condition Number. CoRR cs.DS/0302011 (2003) - [i5]Daniel A. Spielman, Shang-Hua Teng:
Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time O(m1.31). CoRR cs.DS/0310036 (2003) - [i4]Arvind Sankar, Daniel A. Spielman, Shang-Hua Teng:
Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices. CoRR cs.NA/0310022 (2003) - 2002
- [j41]Shang-Hua Teng:
Guest Editor's Foreward. Theory Comput. Syst. 35(3): 249 (2002) - [j40]Andreas Stathopoulos, Shang-Hua Teng:
Recovering Mesh Geometry from a Stiffness Matrix. Numer. Algorithms 30(3-4): 303-322 (2002) - [c43]Daniel A. Spielman, Shang-Hua Teng, Alper Üngör:
Parallel Delaunay Refinement: Algorithms And Analyses. IMR 2002: 205-217 - [i3]Daniel A. Spielman, Shang-Hua Teng, Alper Üngör:
Parallel Delaunay Refinement: Algorithms and Analyses. CoRR cs.CG/0207063 (2002) - 2001
- [j39]Marcos A. Kiwi, Daniel A. Spielman, Shang-Hua Teng:
Min-max-boundary domain decomposition. Theor. Comput. Sci. 261(2): 253-266 (2001) - [c42]Xiang-Yang Li, Shang-Hua Teng:
Generating well-shaped Delaunay meshed in 3D. SODA 2001: 28-37 - [c41]Daniel A. Spielman, Shang-Hua Teng:
Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time. STOC 2001: 296-305 - [i2]Daniel A. Spielman, Shang-Hua Teng:
Smoothed Analysis of Algorithms: Why the Simplex Algorithm Usually Takes Polynomial Time. CoRR cs.DS/0111050 (2001) - 2000
- [j38]Nina Amenta, Marshall W. Bern, David Eppstein, Shang-Hua Teng:
Regression Depth and Center Points. Discret. Comput. Geom. 23(3): 305-323 (2000) - [j37]Shang-Hua Teng:
Guest Editor's Foreword. Int. J. Comput. Geom. Appl. 10(3): 225 (2000) - [j36]Shang-Hua Teng, Chi Wai Wong:
Unstructured Mesh Generation: Theory, Practice, and Perspectives. Int. J. Comput. Geom. Appl. 10(3): 227-266 (2000) - [j35]Siu-Wing Cheng, Tamal K. Dey, Herbert Edelsbrunner, Michael A. Facello, Shang-Hua Teng:
Sliver exudation. J. ACM 47(5): 883-904 (2000) - [c40]Herbert Edelsbrunner, Xiang-Yang Li, Gary L. Miller, Andreas Stathopoulos, Dafna Talmor, Shang-Hua Teng, Alper Üngör, Noel Walkington:
Smoothing and cleaning up slivers. STOC 2000: 273-277 - [e3]D. T. Lee, Shang-Hua Teng:
Algorithms and Computation, 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000, Proceedings. Lecture Notes in Computer Science 1969, Springer 2000, ISBN 3-540-41255-7 [contents] - [e2]Gary L. Miller, Shang-Hua Teng:
Proceedings of the Twelfth annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2000, Bar Harbor, Maine, USA, July 9-13, 2000. ACM 2000, ISBN 1-58113-185-2 [contents]
1990 – 1999
- 1999
- [j34]Xiang-Yang Li, Shang-Hua Teng, Alper Üngör:
Simultaneous Refinement and Coarsening for Adaptive Meshing. Eng. Comput. 15(3): 280-291 (1999) - [j33]Marshall W. Bern, David Eppstein, Shang-Hua Teng:
Parallel Construction of Quadtrees and Quality Triangulations. Int. J. Comput. Geom. Appl. 9(6): 517-532 (1999) - [j32]Gary L. Miller, Dafna Talmor, Shang-Hua Teng:
Data Generation for Geometric Algorithms on Non-Uniform Distributions. Int. J. Comput. Geom. Appl. 9(6): 577-598 (1999) - [j31]Shang-Hua Teng:
Low Energy and Mutually Distant Sampling. J. Algorithms 30(1): 52-67 (1999) - [j30]Gary L. Miller, Dafna Talmor, Shang-Hua Teng:
Optimal Coarsening of Unstructured Meshes. J. Algorithms 31(1): 29-65 (1999) - [j29]Xiang-Yang Li, Shang-Hua Teng:
Practical Human-Machine Identification over Insecure Channels. J. Comb. Optim. 3(4): 347-361 (1999) - [j28]Gary L. Miller, Shang-Hua Teng:
The Dynamic Parallel Complexity of Computational Circuits. SIAM J. Comput. 28(5): 1664-1688 (1999) - [j27]Feng Cao, Ding-Zhu Du, D. Frank Hsu, Shang-Hua Teng:
Fault Tolerance Properties of Pyramid Networks. IEEE Trans. Computers 48(1): 88-93 (1999) - [c39]Siu-Wing Cheng, Tamal K. Dey, Herbert Edelsbrunner, Michael A. Facello, Shang-Hua Teng:
Sliver Exudation. SCG 1999: 1-13 - [c38]Shang-Hua Teng, Qi Lu:
Efficient Large-Scale Access Control for Internet/Intranet Information Systems. HICSS 1999 - [c37]Shang-Hua Teng, Qi Lu, Matthias Eichstaedt, Daniel Alexander Ford, Tobin J. Lehman:
Collaborative Web Crawling: Information Gathering/Processing over Internet. HICSS 1999 - [c36]Xiang-Yang Li, Shang-Hua Teng, Alper Üngör:
Biting Spheres in 3D. IMR 1999: 85-95 - [c35]Xiang-Yang Li, Shang-Hua Teng, Alper Üngör:
Biting Ellipses to Generate Anisotropic Mesh. IMR 1999: 97-108 - 1998
- [j26]Shang-Hua Teng:
Combinatorial aspects of geometric graphs. Comput. Geom. 9(4): 277-287 (1998) - [j25]Anja Feldmann, Ming-Yang Kao, Jirí Sgall, Shang-Hua Teng:
Optimal On-Line Scheduling of Parallel Jobs with Dependencies. J. Comb. Optim. 1(4): 393-411 (1998) - [j24]Ming-Yang Kao, Neill Occhiogrosso, Shang-Hua Teng:
Simple and Efficient Graph Compression Schemes for Dense and Complement Graphs. J. Comb. Optim. 2(4): 351-359 (1998) - [j23]Gary L. Miller, Shang-Hua Teng, William P. Thurston, Stephen A. Vavasis:
Geometric Separators for Finite-Element Meshes. SIAM J. Sci. Comput. 19(2): 364-386 (1998) - [j22]Shang-Hua Teng:
Provably Good Partitioning and Load Balancing Algorithms for Parallel Adaptive N-Body Simulation. SIAM J. Sci. Comput. 19(2): 635-656 (1998) - [j21]John R. Gilbert, Gary L. Miller, Shang-Hua Teng:
Geometric Mesh Partitioning: Implementation and Experiments. SIAM J. Sci. Comput. 19(6): 2091-2110 (1998) - [c34]Marcos A. Kiwi, Daniel A. Spielman, Shang-Hua Teng:
Min-Max-Boundary Domain Decomposition. COCOON 1998: 137-146 - [c33]Xiang-Yang Li, Shang-Hua Teng, Alper Üngör:
Simultaneous Refinement and Coarsening: Adaptive Meshing with Moving Boundaries. IMR 1998: 201-210 - [c32]Matthias Eichstaedt, Qi Lu, Shang-Hua Teng:
Parallel Profile Matching for Large Scale Webcasting. IRREGULAR 1998: 17-28 - [c31]Xiang-Yang Li, Shang-Hua Teng:
Dynamic Load Balancing for Parallel Adaptive Mesh Refinement. IRREGULAR 1998: 144-155 - [e1]Afonso Ferreira, José D. P. Rolim, Horst D. Simon, Shang-Hua Teng:
Solving Irregularly Structured Problems in Parallel, 5th International Symposium, IRREGULAR '98, Berkeley, California, USA, August 9-11, 1998, Proceedings. Lecture Notes in Computer Science 1457, Springer 1998, ISBN 3-540-64809-7 [contents] - [i1]Nina Amenta, Marshall W. Bern, David Eppstein, Shang-Hua Teng:
Regression Depth and Center Points. CoRR cs.CG/9809037 (1998) - 1997
- [j20]Gary L. Miller, Shang-Hua Teng:
Tree-Based Parallel Algorithm Design. Algorithmica 19(4): 369-389 (1997) - [j19]Gary L. Miller, Shang-Hua Teng, William P. Thurston, Stephen A. Vavasis:
Separators for sphere-packings and nearest neighbor graphs. J. ACM 44(1): 1-29 (1997) - [j18]Keith D. Gremban, Gary L. Miller, Shang-Hua Teng:
Moments of Inertia and Graph Separators. J. Comb. Optim. 1(1): 79-104 (1997) - [j17]Shang-Hua Teng, F. Frances Yao:
Approximating Shortest Superstrings. SIAM J. Comput. 26(2): 410-417 (1997) - [j16]Shang-Hua Teng:
Fast Nested Dissection for Finite Element Meshes. SIAM J. Matrix Anal. Appl. 18(3): 552-565 (1997) - [j15]Horst D. Simon, Shang-Hua Teng:
How Good is Recursive Bisection? SIAM J. Sci. Comput. 18(5): 1436-1445 (1997) - [c30]Shang-Hua Teng:
Eigenvalues, Eigenvectors, and Graph Partitioning. COCOON 1997: 515 - [c29]Feng Cao, Ding-Zhu Du, Shang-Hua Teng:
Fault-tolerant Properties of Pyramid Network. PDPTA 1997: 1690-1693 - [c28]Y. Charlie Hu, S. Lennart Johnsson, Shang-Hua Teng:
High Performance FORTRAN for Highly Unstructured Problems. PPoPP 1997: 13-24 - [c27]Y. Charlie Hu, S. Lennart Johnsson, Shang-Hua Teng:
A Data-Parallel Adaptive N-body Method. PP 1997 - [c26]Y. Charlie Hu, Shang-Hua Teng, S. Lennart Johnsson:
A Data-Parallel Implementation of the Geometric Partitioning Algorithm. PP 1997 - [c25]Gary L. Miller, Dafna Talmor, Shang-Hua Teng:
Optimal Good-Aspect-Ratio Coarsening for Unstructured Meshes. SODA 1997: 538-547 - 1996
- [j14]Kenneth L. Clarkson, David Eppstein, Gary L. Miller, Carl Sturtivant, Shang-Hua Teng:
Approximating center points with iterative Radon points. Int. J. Comput. Geom. Appl. 6(3): 357-377 (1996) - [c24]Shang-Hua Teng:
Fast Separator Decomposition for Finite Element Meshes. COCOON 1996: 189-198 - [c23]Daniel A. Spielman, Shang-Hua Teng:
Disk Packings and Planar Separators. SCG 1996: 349-358 - [c22]Daniel A. Spielman, Shang-Hua Teng:
Spectral Partitioning Works: Planar Graphs and Finite Element Meshes. FOCS 1996: 96-105 - 1995
- [j13]Ming-Yang Kao, Shang-Hua Teng, Kentaro Toyama:
An Optimal Parallel Algorithm for Planar Cycle Separators. Algorithmica 14(5): 398-408 (1995) - [j12]David Eppstein, Gary L. Miller, Shang-Hua Teng:
A Deterministic Linear Time Algorithm for Geometric Separators and its Applications. Fundam. Informaticae 22(4): 309-329 (1995) - [j11]Siddhartha Chatterjee, John R. Gilbert, Fred J. E. Long, Robert Schreiber, Shang-Hua Teng:
Generating Local Address and Communication Sets for Data-Parallel Programs. J. Parallel Distributed Comput. 26(1): 72-84 (1995) - [j10]Shang-Hua Teng:
Independent Sets Versus Perfect Matchings. Theor. Comput. Sci. 145(1&2): 381-390 (1995) - [j9]Siddhartha Chatterjee, John R. Gilbert, Robert Schreiber, Shang-Hua Teng:
Optimal Evaluation of Array Expressions on Massively Parallel Machines. ACM Trans. Program. Lang. Syst. 17(1): 123-156 (1995) - [c21]John R. Gilbert, Gary L. Miller, Shang-Hua Teng:
Geometric mesh partitioning: implementation and experiments. IPPS 1995: 418-427 - [c20]Gary L. Miller, Dafna Talmor, Shang-Hua Teng, Noel Walkington:
A Delaunay based numerical method for three dimensions: generation, formulation, and partition. STOC 1995: 683-692 - 1994
- [j8]Alan M. Frieze, Shang-Hua Teng:
On the Complexity of Computing the Diameter of a Polytope. Comput. Complex. 4: 207-219 (1994) - [j7]Shang-Hua Teng:
Functional Inversion and Communication Complexity. J. Cryptol. 7(3): 153-170 (1994) - [j6]Anja Feldmann, Jirí Sgall, Shang-Hua Teng:
Dynamic Scheduling on Parallel Machines. Theor. Comput. Sci. 130(1): 49-72 (1994) - [c19]Ming-Yang Kao, Shang-Hua Teng:
Simple and Efficient Graph Compression Schemes for Dense and Complement Graphs. ISAAC 1994: 451-459 - [c18]Keith D. Gremban, Gary L. Miller, Shang-Hua Teng:
Moments of Inertia and Graph Separators. SODA 1994: 452-461 - 1993
- [c17]Kenneth L. Clarkson, David Eppstein, Gary L. Miller, Carl Sturtivant, Shang-Hua Teng:
Approximating Center Points with Iterated Radon Points. SCG 1993: 91-98 - [c16]David Eppstein, Gary L. Miller, Shang-Hua Teng:
A Deterministic Linear Time Algorithm for Geometric Separators and its Applications. SCG 1993: 99-108 - [c15]Shang-Hua Teng, F. Frances Yao:
Approximating Shortest Superstrings. FOCS 1993: 158-165 - [c14]Siddhartha Chatterjee, John R. Gilbert, Robert Schreiber, Shang-Hua Teng:
Automatic Array Alignment in Data-Parallel Programs. POPL 1993: 16-28 - [c13]Siddhartha Chatterjee, John R. Gilbert, Fred J. E. Long, Robert Schreiber, Shang-Hua Teng:
Generating Local Address and Communication Sets for Data-Parallel Programs. PPoPP 1993: 149-158 - [c12]Anja Feldmann, Ming-Yang Kao, Jirí Sgall, Shang-Hua Teng:
Optimal online scheduling of parallel jobs with dependencies. STOC 1993: 642-651 - [c11]Marshall W. Bern, David Eppstein, Shang-Hua Teng:
Parallel Construction of Quadtrees and Quality Triangulations. WADS 1993: 188-199 - [c10]Ming-Yang Kao, Shang-Hua Teng, Kentaro Toyama:
Improved Parallel Depth-First Search in Undirected Planar Graphs. WADS 1993: 409-420 - 1992
- [c9]Siddhartha Chatterjee, John R. Gilbert, Robert Schneider, Shang-Hua Teng:
Optimal Evaluation of Array Expressions on Massively Parallel Machines (Extended Abstract). SIGPLAN Workshop 1992: 68-71 - [c8]Alan M. Frieze, Gary L. Miller, Shang-Hua Teng:
Separator Based Parallel Divide and Conquer in Computational Geometry. SPAA 1992: 420-429 - 1991
- [c7]Shang-Hua Teng:
Functional Inversion and Communication Complexity. CRYPTO 1991: 232-241 - [c6]Anja Feldmann, Jirí Sgall, Shang-Hua Teng:
Dynamic Scheduling on Parallel Machines. FOCS 1991: 111-120 - [c5]Gary L. Miller, Shang-Hua Teng, Stephen A. Vavasis:
A Unified Geometric Approach to Graph Separators. FOCS 1991: 538-547 - 1990
- [j5]Shang-Hua Teng:
Space Efficient Processor Identity Protocol. Inf. Process. Lett. 34(3): 147-154 (1990) - [j4]Ming-Deh A. Huang, Shang-Hua Teng:
Security, Verifiability, and Universality in Distributed Computing. J. Algorithms 11(3): 492-521 (1990) - [j3]Shang-Hua Teng:
Adaptive Parallel Algorithms for Integral Knapsack Problems. J. Parallel Distributed Comput. 8(4): 400-406 (1990)
1980 – 1989
- 1989
- [c4]Mikhail J. Atallah, S. Rao Kosaraju, Lawrence L. Larmore, Gary L. Miller, Shang-Hua Teng:
Constructing Trees in Parallel. SPAA 1989: 421-431 - 1988
- [c3]Ming-Deh A. Huang, Shang-Hua Teng:
A Universal Problem in Secure and Verifiable Distributed Computation. CRYPTO 1988: 336-352 - [c2]Ming-Deh A. Huang, Shang-Hua Teng:
Secure and Verifiable Schemes for Election and General Distributed Computing Problems. PODC 1988: 182-196 - 1987
- [j2]Shang-Hua Teng, Bin Wang:
Parallel Algorithms for Message Decomposition. J. Parallel Distributed Comput. 4(3): 231-249 (1987) - [j1]Shang-Hua Teng:
The construction of Huffman-equivalent prefix code in NC. SIGACT News 18(4): 54-61 (1987) - [c1]Gary L. Miller, Shang-Hua Teng:
Dynamic Parallel Complexity of Computational Circuits. STOC 1987: 254-263
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:13 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
