Suchergebnisse
Suchergebnisse:
Miller ist Professor für Informatik an der Carnegie Mellon University. Miller beschäftigte sich mit Algorithmischer Zahlentheorie und ist hier vor allem für den Miller-Rabin-Test mit Michael O. Rabin bekannt.
Gary Lee Miller is a professor of Computer Science at Carnegie Mellon University, Pittsburgh, United States. In 2003 he won the ACM Paris Kanellakis Award (with three others) for the Miller–Rabin primality test .
Gary L Miller. Professor of Computer Science. glmiller cs cmu edu. (Office Hours: Monday 2-3 PM and Thursday 2-3 PM ) My office hours will be a ZOOM meeting ZOOM . Publications: Recent Talks: Projects: Orasis 3D Meshing Software Tumble Sangria Aladdin. Courses:
Gary L. Miller. Proceedings of the 15th ACM SIGKDD international conference on Knowledge …. Finding small simple cycle separators for 2-connected planar graphs. Proceedings of the sixteenth annual ACM symposium on Theory of computing …. 1991 Proceedings 32nd Annual Symposium of Foundations of Computer Science ….
- 2020
- 2019
- 2018
- 2017
- 2016
- 2015
- 2014
- 2013
- 2012
- 2011
Timothy Chu, Gary L. Miller, Noel J. Walkington, and Alex L. Wang. Weighted Cheeger and Buser Inequalities, with Applications to Clustering and Cutting Probability Densities. In arXiv, 2020. Detail...Timothy Chu, Gary L Miller, and Donald R Sheehy. Exact computation of a manifold metric, via Lipschitz Embeddings and Shortest Paths on a Graph. In SODA-20, Jan 2020. Details BibTeX Download: [pdf]...Gary L. Miller, Noel J. Walkington, and Alex L. Wang. Hardy-Muckenhoupt Bounds for Laplacian Eigenvalues. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques...
Timothy Chu, Gary L. Miller, and Donald Sheehy. Intrinsic Metrics: Nearest Neighbor and Edge Squared Distances. In arXiv, 2018. Details BibTeX Download: [HTML]Matthew Fahrbach, Gary L. Miller, Richard Peng, Saurabh Sawlani, Junxing Wang, and Shen Chen Xu. Graph Sketching Against Adaptive Adversaries Applied to the Minimum Degree Algorithm. In FOCS18, pp....Gary L. Miller, Noel J. Walkington, and Alex L. Wang. Hardy-Muckenhoupt Bounds for Laplacian Eigenvalues. In ARXIV, Dec 2018. Details BibTeX Download: [pdf] (669.4kB )Hui Han Chin. A New View on Cycle Toggling Based Laplacian Solvers. Master's Thesis, Carnegie Mellon University,2017. CMU CS Tech Report CMU-CS-17-*** Details BibTeX Download: [pdf] (650.8kB )Timothy Chu, Gary L. Miller, and Donald Sheehy. Exploration of a Graph-based Density-Sensitive Metric. In ARXIV, 2017. to appear Details BibTeX Download: [pdf] (355.5kB )Matthew Fahrbach, Gary L. Miller, Richard Peng, Saurabh Sawlani, Junxing Wang, and Shen Chen Xu. On Computing Min-Degree Elimination Orderings. In arXiv, 2017. Details BibTeX Download: (unavailable)Shen Chen Xu. Exponential Start Time Clustering and its Applications in Spectral Graphy Theory. Ph.D. Thesis, Carnegie Mellon University, Pittsburgh, 2017. CMU CS Tech Report CMU-CS-17-120 Details...Michael B. Cohen, Yin Tat Lee, Gary L. Miller, Jakub W. Pachocki, and Aaron Sidford. Geometric Median in Nearly Linear Time. In STOC16, 2016. Details BibTeX Download: [pdf] (1.2MB )Kevin Deweese, John R. Gilbert, Gary L. Miller, Richard Peng, Hao Ran Xu, and Shen Chen Xu. An Empirical Study of Cycle Toggling Based Laplacian Solvers. In CSC16, Albuquerque, OCT 2016. Details Bi...Alina Raluca Ene, Gary L. Miller, Jakub W. Pachocki, and Aaron Sidford. Routing under Balance. In STOC16, 2016. Details BibTeX Download: (unavailable)Jakub W. Pachocki. Graphs and Beyond: Faster Algorithms for High Dimensional Convex Optimization. Ph.D. Thesis, Carnegie Mellon University, Pittsburg, 2016. CMU CS Tech Report CMU-CS-16-107 Details...Michael B. Cohen, Brittany Terese Fasy, Gary L. Miller, Amir Nayyeri, Donald R. Sheehy, and Ameya Velingker. Approximating Nearest Neighbor Distances. In Proceedings of the Algorithms and Data Stru...Michael B. Cohen, Brittany Terese Fasy, Gary L. Miller, Amir Nayyeri, Donald Sheehy, and Ameya Velingker. Approximating Nearest Neighbor Distances. CoRR, abs/1502.08048, 2015. Details BibTeX Downlo...Gary L. Miller. The Revolution in Graph Theoretic Optimization Problems. In Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, Ju...Gary L. Miller, Richard Peng, Adrian Vladu, and Shen Chen Xu. Improved Parallel Algorithms for Spanners and Hopsets. In Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Arc...Guy E. Blelloch, Anupam Gupta, Ioannis Koutis, Gary L. Miller, Richard Peng, and Kanat Tangwongsan. Nearly-Linear Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs. T...Michael B. Cohen, Rasmus Kyng, Gary L. Miller, Jakub W. Pachocki, Richard Peng, Anup B. Rao, and Shen Chen Xu. Solving SDD Linear Systems in Nearly $m łog^1/2 n$ Time. In STOC 2014, pp. 343–352, Ne...Michael B. Cohen, Brittany Terese Fasy, Gary L. Miller, Amir Nayyeri, Richard Peng, and Noel Walkington. Solving $1$-Laplacians of Convex Simplicial Complexes in Nearly Linear Time: Collapsing and...Michael B. Cohen, Gary L. Miller, Jakub W. Pachocki, Richard Peng, and Shen Chen Xu. Stretching Stretch. CoRR, abs/1401.2454, 2014. Details BibTeX Download: [HTML]Hui Han Chin, Aleksander Madry, Gary L. Miller, and Richard Peng. Runtime guarantees for regression problems. In ITCS, pp. 269–282, 2013. Details BibTeX Download: [pdf] (850.1kB )Ioannis Koutis and Gary Lee Miller. Methods and Apparatuses for Solving Graph Laplacians. 08 2013. Details BibTeX Download: [pdf] (2.8MB )Mu Li, Gary L. Miller, and Richard Peng. Iterative Row Sampling. In FOCS 2013, pp. 127–136, 2013. Details BibTeX Download: [pdf] (552.4kB )Gary L. Miller, Richard Peng, and Shen Chen Xu. Parallel graph decompositions using random shifts. In SPAA, pp. 196–203, 2013. Details BibTeX Download: [pdf] (519.0kB )Jonathan A. Kelner, Gary L. Miller, and Richard Peng. Faster approximate multicommodity flow using quadratically coupled flows. In Proceedings of the 44th symposium on Theory of Computing, pp. 1–18...Mihail N. Kolountzakis, Gary L. Miller, Richard Peng, and Charalampos E. Tsourakakis. Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning. Internet Mathematics, 8(1-2):...Ioannis Koutis, Gary L. Miller, and Richard Peng. A fast solver for a class of linear systems. Commun. ACM, 55(10):99–107, 2012. Details BibTeX Download: (unavailable)Guy E. Blelloch, Anupam Gupta, Ioannis Koutis, Gary L. Miller, Richard Peng, and Kanat Tangwongsan. Near Linear-Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs. In...Ioannis Koutis, Gary L. Miller, and Richard Peng. Solving SDD linear systems in time $O(młognłogłog^2nłog(1/\epsilon))$. In FOCS, 2011. Details BibTeX Download: [pdf] (507.6kB )Gary L. Miller, Todd Phillips, and Donald R. Sheehy. Beating the Spread: Time-Optimal Point Meshing. In Twenty Seventh Annual Symposium on Computational Geometry, pp. 321–330, Paris, June 2011. Det...Gary L. Miller and Todd Phillips. Runtime-Efficient Meshing for Piecewise-Linear Complexes. 2011. submitted Details BibTeX Download: [pdf] (318.8kB )Gary Miller. Professor Emeritus. Website. Email gm2f@andrew.cmu.edu. Phone (412) 268-2631. Department Computer Science Department. Research Interests Theory Algorithms and Complexity. Research/Teaching Statement. My main interest is in sequential and parallel algorithm design.
Ioannis Koutis, Gary L. Miller, David Tolliver: Combinatorial Preconditioners and Multilevel Solvers for Problems in Computer Vision and Image Processing. ISVC (1) 2009 : 1067-1078
