`Travelled to:`

1 × France

1 × Poland

15 × USA

`Collaborated with:`

∅ S.Teng W.P.Thurston V.Ramachandran S.Landau R.Peng D.Talmor N.Walkington J.A.Kelner T.Phillips D.Sheehy E.Bach J.Shallit I.S.Filotti J.H.Reif C.E.Tsourakakis U.Kang C.Faloutsos D.J.Kleitman F.T.Leighton M.Lepley M.B.Cohen R.Kyng J.W.Pachocki A.Rao S.C.Xu H.Edelsbrunner X.Li A.Stathopoulos A.Üngör

`Talks about:`

graph (8) isomorph (3) parallel (2) dimens (2) three (2) separ (2) genus (2) time (2) test (2) solv (2)

## Person: Gary L. Miller

### DBLP: Miller:Gary_L=

### Facilitated 1 volumes:

### Contributed to:

### Wrote 19 papers:

- STOC-2014-CohenKMPPRX #linear
- Solving SDD linear systems in nearly mlog1/2n time (MBC, RK, GLM, JWP, RP, AR, SCX), pp. 343–352.
- STOC-2013-Miller #graph #optimisation #problem #scalability #using
- Solving large optimization problems using spectral graph theory (GLM), p. 981.
- STOC-2012-KelnerMP #approximate #multi #performance #using
- Faster approximate multicommodity flow using quadratically coupled flows (JAK, GLM, RP), pp. 1–18.
- KDD-2009-TsourakakisKMF #graph #named
- DOULION: counting triangles in massive graphs with a coin (CET, UK, GLM, CF), pp. 837–846.
- ICALP-2007-MillerPS #scalability
- Size Competitive Meshing Without Large Angles (GLM, TP, DS), pp. 655–666.
- STOC-2000-EdelsbrunnerLMSTTUW
- Smoothing and cleaning up slivers (HE, XYL, GLM, AS, DT, SHT, AÜ, NW), pp. 273–277.
- STOC-1995-MillerTTW #generative
- A Delaunay based numerical method for three dimensions: generation, formulation, and partition (GLM, DT, SHT, NW), pp. 683–692.
- STOC-1990-MillerT
- Separators in Two and Three Dimensions (GLM, WPT), pp. 300–309.
- STOC-1987-MillerR #algorithm #graph #parallel
- A New Graph Triconnectivity Algorithm and Its Parallelization (GLM, VR), pp. 335–344.
- STOC-1987-MillerT #complexity #parallel
- Dynamic Parallel Complexity of Computational Circuits (GLM, SHT), pp. 254–263.
- STOC-1984-BachMS
- Sums of Divisors, Perfect Numbers, and Factoring (EB, GLM, JS), pp. 183–190.
- STOC-1984-Miller #graph
- Finding Small Simple Cycle Separators for 2-Connected Planar Graphs (GLM), pp. 376–382.
- STOC-1983-LandauM #polynomial
- Solvability by Radicals is in Polynomial Time (SL, GLM), pp. 140–151.
- STOC-1981-KleitmanLLM #graph
- New Layouts for the Shuffle-Exchange Graph (DJK, FTL, ML, GLM), pp. 278–292.
- STOC-1980-Miller #bound #graph #morphism #testing
- Isomorphism Testing for Graphs of Bounded Genus (GLM), pp. 225–235.
- STOC-1979-FilottiMR #graph #on the
- On Determining the Genus of a Graph in O(v^O(g)) Steps (ISF, GLM, JHR), pp. 27–37.
- STOC-1978-Miller #morphism #on the
- On the n^log n Isomorphism Technique: A Preliminary Report (GLM), pp. 51–58.
- STOC-1977-Miller #graph #morphism
- Graph Isomorphism, General Remarks (GLM), pp. 143–150.
- STOC-1975-Miller #testing
- Riemann’s Hypothesis and Tests for Primality (GLM), pp. 234–239.