2008 |
40 | EE | Quentin F. Stout:
Unimodal regression via prefix isotonic regression.
Computational Statistics & Data Analysis 53(2): 289-297 (2008) |
2006 |
39 | EE | Quentin F. Stout,
Christiane Jablonowski:
S02 - Parallel computing 101.
SC 2006: 203 |
38 | EE | Julia Lipman,
Quentin F. Stout:
A performance analysis of local synchronization.
SPAA 2006: 254-260 |
37 | EE | Quentin F. Stout:
Minimizing peak energy on mesh-connected systems.
SPAA 2006: 331 |
2005 |
36 | EE | Ovsei Volberg,
Tamas I. Gombosi,
Kenneth G. Powell,
Aaron J. Ridley,
Kenneth C. Hansen,
Gábor Tóth,
Quentin F. Stout,
Darren De Zeeuw,
Kevin Kane,
David R. Chesney,
Robert H. Oehmke:
A High-Performance Framework for Sun-to-Earth Space Weather Modeling.
IPDPS 2005 |
2001 |
35 | | Robert H. Oehmke,
Quentin F. Stout:
Parallel Adaptive Blocks on a Sphere.
PPSC 2001 |
2000 |
34 | EE | Robert H. Oehmke,
Janis Hardwick,
Quentin F. Stout:
Scalable Algorithms for Adaptive Statistical Designs.
SC 2000 |
1999 |
33 | | Andrew A. Poe,
Quentin F. Stout:
Load Balancing 2-Phased Geometrically Based Problems.
PPSC 1999 |
1998 |
32 | | Philip D. MacKenzie,
Quentin F. Stout:
Ultafast Expected Time Parallel Algorithms.
J. Algorithms 26(1): 1-33 (1998) |
1996 |
31 | | David M. Pennock,
Quentin F. Stout:
Exploiting a Theory of Phase Transitions in Three-Satisfiability Problems.
AAAI/IAAI, Vol. 1 1996: 253-258 |
1993 |
30 | EE | Philip D. MacKenzie,
Quentin F. Stout:
Optimal Parallel Construction of Hamiltonian Cycles and Spanning Trees in Random Graphs.
SPAA 1993: 224-229 |
29 | | Russ Miller,
Viktor K. Prasanna,
Dionisios I. Reisis,
Quentin F. Stout:
Parallel Computations on Reconfigurable Meshes.
IEEE Trans. Computers 42(6): 678-692 (1993) |
28 | | Niall Graham,
Frank Harary,
Marilynn Livingston,
Quentin F. Stout:
Subcube Fault-Tolerance in Hypercubes
Inf. Comput. 102(2): 280-314 (1993) |
1992 |
27 | | Ed Cohen,
Russ Miller,
Elias M. Sarraf,
Quentin F. Stout:
Efficient Convexity and Domination Algorithms for Fine-and Medium-Grain Hypercube Computers.
Algorithmica 7(1): 51-75 (1992) |
1991 |
26 | | Philip D. MacKenzie,
Quentin F. Stout:
Ultra-Fast Expected Time Parallel Algorithms.
SODA 1991: 414-423 |
25 | | Russ Miller,
Quentin F. Stout:
Computing Convexity Properties of Images on a Pyramid Computer.
Algorithmica 6(5): 658-684 (1991) |
1990 |
24 | EE | Bruce R. Maxim,
Gregory F. Bachelis,
David James,
Quentin F. Stout:
Introducing parallel algorithms in undergraduate computer science courses (tutorial session).
SIGCSE 1990: 255 |
23 | | Quentin F. Stout,
Bruce Wagar:
Intensive Hypercube Communication. Prearranged Communication in Link-Bound Machines.
J. Parallel Distrib. Comput. 10(2): 167-181 (1990) |
22 | | Quentin F. Stout:
Special Issue on Algorithms for Hypercube Computers. Guest Editor's Introduction.
J. Parallel Distrib. Comput. 8(4): 301-302 (1990) |
21 | | Russ Miller,
Quentin F. Stout:
Seymour: a Portable Parallel Programming Language.
Structured Programming 11(4): 157-172 (1990) |
1989 |
20 | | Russ Miller,
Quentin F. Stout:
Writing Portable Parallel Programs in Seymour.
PPSC 1989: 419-424 |
19 | | Russ Miller,
Quentin F. Stout:
Optimal Hypercube Algorithms for Labeled Images (Preliminary Version).
WADS 1989: 517-528 |
18 | | Russ Miller,
Quentin F. Stout:
Mesh Computer Algorithms for Computational Geometry.
IEEE Trans. Computers 38(3): 321-340 (1989) |
1988 |
17 | | Russ Miller,
Viktor K. Prasanna,
Dionisios I. Reisis,
Quentin F. Stout:
Data Movement Operations and Applications on Reconfigurable VLSI Arrays.
ICPP (1) 1988: 205-208 |
16 | | Russ Miller,
Quentin F. Stout:
Efficient Parallel Convex Hull Algorithms.
IEEE Trans. Computers 37(12): 1605-1618 (1988) |
15 | | Russ Miller,
Quentin F. Stout:
Simulating Essential Pyramids.
IEEE Trans. Computers 37(12): 1642-1648 (1988) |
1987 |
14 | | Russ Miller,
Quentin F. Stout:
Mesh Computer Algorithms for Line Segments and Simple Polygons.
ICPP 1987: 282-285 |
13 | | Quentin F. Stout:
Supporting Divide-and-Conquer Algorithms for Image Processing.
J. Parallel Distrib. Comput. 4(1): 95-115 (1987) |
12 | | Russ Miller,
Quentin F. Stout:
Data Movement Techniques for the Pyramid Computer.
SIAM J. Comput. 16(1): 38-60 (1987) |
1986 |
11 | | Quentin F. Stout:
Meshes with Multiple Buses
FOCS 1986: 264-273 |
10 | | John P. Hayes,
Trevor N. Mudge,
Quentin F. Stout:
Architecture of a Hypercube Supercomputer.
ICPP 1986: 653-660 |
9 | | Quentin F. Stout,
Bette L. Warren:
Tree Rebalancing in Optimal Time and Space.
Commun. ACM 29(9): 902-908 (1986) |
1985 |
8 | | Russ Miller,
Quentin F. Stout:
Varying Diameter and Problem Size in Mesh-Connected Computers.
ICPP 1985: 697-699 |
7 | | Quentin F. Stout:
Tree-Based Graph Algorithms for Some Parallel Computers.
ICPP 1985: 727-730 |
6 | | Quentin F. Stout:
Pyramid Computer Solutions of the Closest Pair Problem.
J. Algorithms 6(2): 200-212 (1985) |
1983 |
5 | | Quentin F. Stout:
Sorting, Merging, Selecting, and Filtering on Tree and Pyramid Machines.
ICPP 1983: 214-221 |
4 | | Quentin F. Stout:
Topological Matching
STOC 1983: 24-31 |
3 | | Quentin F. Stout:
Mesh-Connected Computers with Broadcasting.
IEEE Trans. Computers 32(9): 826-830 (1983) |
1982 |
2 | | Quentin F. Stout:
Using Clerks in Parallel Processing
FOCS 1982: 272-279 |
1 | | Quentin F. Stout:
Drawing Straight Lines with a Pyramid Cellular Automaton.
Inf. Process. Lett. 15(5): 233-237 (1982) |