Stout, Quentin F. - Department of Electrical Engineering and Computer Science, University of Michigan

• Computational Statistics & Data Analysis 31 (1999) 397416 www.elsevier.com/locate/csda
• Response Adaptive Designs for Balancing Complex Objectives
• This appears in Journal of Sequential Planning and Inference 132 (2005), pp. 149162. Optimal Screening Designs with Flexible Cost and Constraint
• In Proc. 1985 International Conference on Parallel Processing, pp. 697699. Varying Diameter and Problem Size
• In Sequential Analysis 15 (1996), pp. 71--90. Optimal Allocation for Estimating the Mean of a
• Optimal Adaptive Designs for Delayed Response Models: Exponential Case
• OPTIMIZING A UNIMODAL RESPONSE FUNCTION FOR BINARY VARIABLES
• In Sequential Analysis 15 (1996), pp. 7190. (with black/white diagrams) Optimal Allocation for Estimating the Mean of a Bivariate
• Adaptive Blocks: A High Performance Data Quentin F. Stout
• In Biometrics 59 (2003), pp. 229--236 Directed Walk Designs for Dose Response Problems
• In SIAM Journal on Scientific Computing 21 (1999), pp. 67--87. Using Path Induction to Evaluate
• In Computing Science and Statistics 30 (1998), pp. 219223. Adaptive Allocation in the Presence of Missing Outcomes
• In Computing Science and Statistics 27 (1995), pp. 347351. Statistical Analysis of Communication Time
• In Computing Science and Statistics 30 (1998), pp. 309--314. Predicting Algorithm Performance
• In Congressus Numerantium 105 (1994), pp. 116128. Constant Time Computation of
• In Computing Science and Statistics 27 (1995), pp. 347-351. Statistical Analysis of Communication Time
• In SIAM Journal on Scientific Computing 21 (1999), pp. 6787. Using Path Induction to Evaluate
• This paper appears in J. of Parallel and Distributed Computing 10 (1990), pp. 167181. Intensive Hypercube Communication
• In Computing Science and Statistics 24 1992, pp. 597-601. Optimal Adaptive Equal Allocation Rules
• Adaptive Statistical Designs Janis Hardwick Quentin F. Stout
• SOME RESEARCH TOPICS FOR STUDENTS Quentin F. Stout
• In Handbook on Parallel Computing and Statistics (2006) E. Kontoghiorghes, ed., Marcel Dekker, pp. 347373.
• In Proc. DARPA Sortware Technology Conference 1992, pp. 184-188. Ultrafast Parallel Algorithms
• International Journal of Computer and Information Sciences, Vol. 11, No. 1, 1982 Searching and Encoding for
• A Microprocessor--based Hypercube Supercomputer
• In Journal American Statistical Association 93 (1998), pp. 1502--1511. Sequentially Deciding Between Two Experiments
• In Computing Science and Statistics 24 (1992), pp. 597601. Optimal Adaptive Equal Allocation Rules
• Algorithms Minimizing Peak Power on Mesh-Connected Systems Quentin F. Stout
• In Proc. 6th Distributed Memory Computing Conference (1991), IEEE, pp. 34--41. Fault Tolerance of the Cyclic Buddy Subcube Location Scheme in
• In Proc. 1985 International Conference on Parallel Processing, pp. 727--630. TreeBased Graph Algorithms for some Parallel Computers
• In Adaptive Designs: IMS Lecture Notes--Monograph Series 25, 1995, pp. 223237. Copyright c
• In Computing Science and Statistics 30 (1998), pp. 219--223. Adaptive Allocation in the Presence of Missing Outcomes
• Optimal Hypercube Algorithms for Labeled Images (Preliminary version)
• In Proceedings SC 2000 (Supercomputing), 16 p. Scalable Algorithms for Adaptive Statistical Designs
• To appear in Mathematical and Computational Modelling ShiftProduct Networks
• Exploiting a Theory of Phase Transitions in ThreeSatisfiability David M. Pennock and Quentin F. Stout
• Optimal Few-Stage Designs This appears in Journal of Statistical Planning and Inference 104 (2002), pp. 121-145.
• MULTISCALE MODELING OF HELIOSPHERIC PLASMAS T.I. Gombosi, K.G. Powell, Q.F. Stout, E.S. Davidson, D.L. DeZeeuw,
• In Proc. 1985 International Conference on Parallel Processing, pp. 727630. Tree-Based Graph Algorithms for some Parallel Computers
• In Proc. 2nd Symp. Frontiers Massively Parallel Computation (1988), pp. 491494. FAULT TOLERANCE OF ALLOCATION SCHEMES IN
• In Proceedings SC 2000 (Supercomputing), 16 p. Scalable Algorithms for Adaptive Statistical Designs
• In Scientific Programming 8 (2000), pp. 183193. Corrected reprint of article first appearing in Proceedings SC 2000 (Supercomputing).
• In Proc. 6th Distributed Memory Computing Conference (1991), IEEE, pp. 3441. Fault Tolerance of the Cyclic Buddy Subcube Location Scheme in Hypercubes
• In Proc. 9 th SIAM Conf. on Parallel Processing (1999). Load Balancing 2-Phased Geometrically Based Problems
• CVGIP: IMAGE UNDERSTANDING Vol. 54, No. 2, September, pp. 215-223, 1991
• JOURNAL OF ALGORITHMS 6, 200-212 (1985) Pyramid Computer Solutions of the Closest Pair
• In Computing Science and Statistics 23 (1991), pp. 421424. Bandit Strategies for Ethical Sequential Allocation
• Hypercube Message Routing in the Presence of Faults
• In New Developments and Applications in Experimental Design, N. Flournoy, W.F. Rosenberger, and W.K. Wong, eds., Institute of Math. Stat.
• In Adaptive Designs: IMS Lecture Notes Monograph Series 25, 1995, pp. 223-237. Copyright c 1995, Institute of Mathematical Statistics
• RESEARCHCONTRJBUTJONS Programming
• The Use of the MPI Communication Library in the NAS Parallel Benchmarks
• In Computing Science and Statistics 23 (1991), pp. 421-424. Bandit Strategies for Ethical Sequential Allocation
• Strict L Isotonic Regression Quentin F. Stout 1 2 3
• Adaptive Mesh Refinement for Global Magnetohydrodynamic Simulation
• SIAM J. COMPUT. Vol. 16, No. 1, February 1987
• In Proc. 2nd Symp. Frontiers Massively Parallel Computation (1988), pp. 195--198. Portable Parallel Algorithms for Geometric Problems
• In Proc. 2nd Symp. Frontiers Massively Parallel Computation (1988), pp. 491--494. FAULT TOLERANCE OF ALLOCATION SCHEMES IN
• To appear in Mathematical and Computational Modelling Shift-Product Networks
• In Mathematical and Computational Modelling 11 (1988), pp. 222-227. Embeddings in Hypercubes
• MULTISCALE MODELING OF HELIOSPHERIC PLASMAS T.I. Gombosi, K.G. Powell, Q.F. Stout, E.S. Davidson, D.L. DeZeeuw,
• In Proc. DARPA Sortware Technology Conference 1992, pp. 184188. Ultrafast Parallel Algorithms
• Isotonic Median Regression via Scaling Quentin F. Stout
• In Proceedings SC'98 Adaptive Parallel Computation of a Grand-Challenge Problem
• IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. PAMI-7, NO. 2, MARCH 1985 Geometric Algorithms for Digitized Pictures on a
• In Sequential Analysis 15 (1996), pp. 71--90. (with black/white diagrams) Optimal Allocation for Estimating the Mean of a Bivariate
• In Proc. 1985 International Conference on Parallel Processing, pp. 697--699. Varying Diameter and Problem Size
• In Proc. 5th ACM Symp. on Parallel Algorithms and Architectures 1993, pp. 224-229. Optimal Parallel Construction of Hamiltonian Cycles and
• ON LEVFS DUALITY BETWEEN PERMUTATIONS AND CONVERGENT SERIES
• An Approach to Computing Multidimensional Isotonic Regressions
• Volume 15, Number 5 INFORMATION PROCESSING LET-I-ERS IODecember f982 DRAWING STRAIGHT LINES WITH A PYRAMID CELLULAR AUTOMATON
• Analysis of Delays Caused by Local Synchronization Julia Lipman
• Block-Structured Adaptive Grids on the Sphere: Advection Experiments CHRISTIANE JABLONOWSKI, MICHAEL HERZOG,* AND JOYCE E. PENNER
• Journal of Sequential Planning and Inference (2006), vol. 136, pp. 19401955. New Adaptive Designs for Delayed Response
• A PHYSICS-BASED SOFTWARE FRAMEWORK FOR SUN-EARTH CONNECTION MODELING
• In Proc. 10 th SIAM Conf. Parallel Processing for Sci. Computing (2001).
• In Journal of Algorithms 26 (1998), pp. 133. Ultra-Fast Expected Time
• Algorithmica (1991) 6:658-684 Algorithmica9 1991Springer-VerlagNewYorkInc.
• In Proc. 4th Conf. on Hypercube Concurrent Computers and Applications (1989), ACM, pp. 5966. PARALLEL ALLOCATION ALGORITHMS FOR HYPERCUBES
• In Proc. 3rd Conf. on Hypercube Concurrent Computers and Applications (1988), ACM, pp. 222231.
• In Proc. 2nd Symp. Frontiers Massively Parallel Computation (1988), pp. 195198. Portable Parallel Algorithms for Geometric Problems
• JOURNAL OF PARALLEL AND DISTBIBUTED COMPUTING 4,95-115 ( 1987) Supporting Divide-and-Conquer Algorithms
• In Optimum Design 2000, A. Atkinson, B. Bogacka, and A. Zhigljavsky, eds., Kluwer, 2001, pp. 195208.
• In New Developments and Applications in Experimental Design, N. Flournoy, W.F. Rosenberger, and W.K. Wong, eds., Institute of Math. Stat.
• In Journal of Sequential Planning and Inference 137 (2007), 26542665 Response Adaptive Designs that Incorporate Switching
• In Biometrics 59 (2003), pp. 229236 Directed Walk Designs for Dose Response Problems
• Optimal Few-Stage Designs In Journal of Statistical Planning and Inference 104 (2002), pp. 121-145.
• In Journal American Statistical Association 93 (1998), pp. 15021511. Sequentially Deciding Between Two Experiments
• In Computing Science and Statistics 30 1998, pp. 309 314. Predicting Algorithm Performance
• In Sequential Analysis 15 1996, pp. 71 90. Optimal Allocation for Estimating the Mean of a
• Algorithms for L Isotonic Regression Quentin F. Stout
• In Computational Statistics and Data Analysis 53 (2008), pp. 289297 Unimodal Regression via Prefix Isotonic Regression
• Exploiting a Theory of Phase Transitions in Three-Satis ability David M. Pennock and Quentin F. Stout
• Congressus Numerantium 118 (1996), pp. 49-71. Unique Domination in Cross-Product Graphs
• In Information and Computation 102 (1993), pp. 280314. Subcube Fault-Tolerance in Hypercubes
• In Congressus Numerantium 97 (1993), pp. 5170. Perfect Dominating Sets on Cube-Connected Cycles
• In Congressus Numerantium 79 (1990), pp. 187-203. PERFECT DOMINATING SETS
• IEEETRANSACTIONSON INFORMATIONTHEORY,VOL.IT-26,NO. 5, SEPTEMRER1980 607 Improved Prefix Encodings of the Natural Numbers
• In J. of Parallel and Distributed Computing 10 (1990), pp. 167--181. Intensive Hypercube Communication
• In Proc. 4th Conf. on Hypercube Concurrent Computers and Applications (1989), ACM, pp. 59--66. PARALLEL ALLOCATION ALGORITHMS FOR
• Computational Statistics & Data Analysis 31 (1999) 397--416 www.elsevier.com/locate/csda
• TOPOLOGICAL MATCHING Quentin F. Stout
• Vita (as of March 2011) Quentin F. Stout
• a few random Or, at least, Questions.
• Weighted L Isotonic Regression Quentin F. Stout