Russ Miller

Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

EDBT 2026 Demo / reviewers in the wild / expert

dblp:m/RussMiller · DBLP profile ↗

← Back

43ranked-venue papers

19as first author

0since 2021 · last 2008

—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 25 · 10 first-authorArtificial intelligence and machine learning · 9 · 4 first-authorTheory of computation · 8 · 4 first-authorDatabases, data management, data science and information retrieval · 3Graphics, computer vision, multimedia, augmented reality and games · 3 · 3 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems 11 papers		Parallel and multicore computing · 48% Distributed systems · 31% Reconfigurable computing and FPGAs · 10%
Theoretical computer science 6 papers		Computational geometry · 72% Graph algorithms and graph theory · 28%

Topics — the 16 heaviest of 18, each with the papers that count most for it

Topic	Papers	Last	Evidence papers
Distributed systems grid computing	1	2004	The Grid2003 Production Grid: Principles and Practice · HPDC 2004
Parallel and multicore computing parallel algorithms	6	1993	Parallel Computations on Reconfigurable Meshes · IEEE Trans. Computers 1993 Simulating Essential Pyramids · IEEE Trans. Computers 1988 Convexity algorithms for parallel machines · CVPR 1988
Reconfigurable computing and FPGAs › reconfigurable architecture reconfigurable mesh	2	1993	Parallel Computations on Reconfigurable Meshes · IEEE Trans. Computers 1993 Image computations on reconfigurable VLSI arrays · CVPR 1988
High-performance computing distributed computing infrastructure	1	2004	The Grid2003 Production Grid: Principles and Practice · HPDC 2004
Computational geometry convex hull	3	1988	Efficient Parallel Convex Hull Algorithms · IEEE Trans. Computers 1988 Convexity algorithms for parallel machines · CVPR 1988 Geometric Algorithms for Digitized Pictures on a Mesh-Connected Computer · IEEE Trans. Pattern Anal. Mach. Intell. 1985
Parallel and multicore computing › parallel algorithms graph algorithms	1	1993	Parallel Computations on Reconfigurable Meshes · IEEE Trans. Computers 1993
Parallel and multicore computing image processing	1	1993	Parallel Computations on Reconfigurable Meshes · IEEE Trans. Computers 1993
Parallel and multicore computing › parallel algorithms parallel image processing	2	1988	Simulating essential pyramids · CVPR 1988 Image computations on reconfigurable VLSI arrays · CVPR 1988
Computational geometry parallel geometric algorithms	1	1989	Mesh Computer Algorithms for Computational Geometry · IEEE Trans. Computers 1989
Parallel and multicore computing › parallel architecture pyramid computer	1	1988	Simulating essential pyramids · CVPR 1988
Graph algorithms and graph theory › graph connectivity connected components	1	1987	Data Movement Techniques for the Pyramid Computer · SIAM J. Comput. 1987
Graph algorithms and graph theory › graph theory › spanning forest minimum spanning forest	1	1987	Data Movement Techniques for the Pyramid Computer · SIAM J. Comput. 1987
Parallel and multicore computing › parallel architecture mesh-connected computer	1	1985	Geometric Algorithms for Digitized Pictures on a Mesh-Connected Computer · IEEE Trans. Pattern Anal. Mach. Intell. 1985
Parallel and multicore computing › parallel algorithms › distributed-memory parallel algorithms mesh computer algorithms	1	1989	Mesh Computer Algorithms for Computational Geometry · IEEE Trans. Computers 1989
Performance modeling and evaluation › simulation parallel architecture simulation	1	1988	Simulating Essential Pyramids · IEEE Trans. Computers 1988
Parallel and multicore computing › parallel algorithms parallel geometric algorithms	1	1988	Efficient Parallel Convex Hull Algorithms · IEEE Trans. Computers 1988

Methods — techniques the papers use, named apart from their topics

hypercube · 0.0modular programming · 0.0data encapsulation · 0.0automatic configuration · 0.0POSIX compliance · 0.0reconfigurable bus · 0.0mesh computer · 0.0all-nearest neighbor · 0.0essential pyramids · 0.0PRAM comparison · 0.0EREW PRAM · 0.0sorting networks · 0.0sorting network · 0.0pyramid simulation · 0.0parallel random-access machine · 0.0mesh-of-trees · 0.0PRAM simulation · 0.0mesh algorithm · 0.0

Year	Publication	Venue	Position
2008	Grid-based research, development, and deployment in New York State abstract In this paper, we present cyberinfrastructure and grid computing efforts in New York State. In particular, we focus on fundamental efforts in Binghamton and Buffalo, including the design, development, and deployment of the New York State Grid, as well as a grass-roots New York State Initiative. Russ Miller, Jonathan J. Bednasz, Kenneth Chiu, Steven M. Gallo, Madhusudhan Govindaraju	IPDPS	1
2004	Molecular structure determination on a computational and data Grid abstract The focus of this paper is on the design and implementation of a critical program in structural biology onto two computational and data Grids. The first is the Buffalo-based ACDC Grid, which uses facilities at SUNY-Buffalo and several research institutions that are under distinct control. The second is Grid2003, the iVDGL Grid established late in 2003 primarily for physics and astronomy applications. In this paper, we prevent an overview of the ACDC Grid and Grid2003, focusing on the implementation of several new ACDC computational and Grid tools. Mark L. Green, Russ Miller	CCGRID	2
2004	Evolutionary molecular structure determination using Grid-enabled data mining abstract A new computational framework is developed for the evolutionary determination of molecular crystal structures using the shake-and-bake methodology. Genetic algorithms are performed on the SnB results of known structures in order to optimize critical parameters of the program. The determination of efficient SnB input parameters can significantly reduce the time required to solve unknown molecular structures. Further, the Grid-enabled data mining approach that we introduce is able to exploit computational cycles that would otherwise go unused. Mark L. Green, Russ Miller	CCGRID	2
2004	The Grid2003 Production Grid: Principles and Practice Ian T. Foster, Jerry Gieraltowski, Scott Gose, Natalia Maltsev, Edward N. May, Alexis A. Rodriguez, Dinanath Sulakhe, A. Vaniachine, Jim Shank, Saul Youssef, David Adams, Richard Baker 0003, Wensheng Deng, Dantong Yu, Iosif Legrand, Conrad Steenberg, M. Anzar Afaq, Eileen Berman, James Annis, L. A. T. Bauerdick, Michael Ernst, Ian Fisk, Lisa Giacchetti, Gregory E. Graham, Anne Heavey, Joseph Kaiser, Nickolai Kuropatkin, Ruth Pordes, Vijay Sekhri, John Weigand, Yujun Wu, Keith Baker, Lawrence Sorrillo, John Huth, Matthew Allen, Leigh Grundhoefer, John Hicks, Fred Luehring, Steve Peck, Robert Quick, Stephen C. Simms, George Fekete, Jan vandenBerg, Kihyeon Cho, Kihwan Kwon, Dongchul Son, Hyoungwoo Park, Shane Canon, Keith R. Jackson, David E. Konerding, Jason Lee 0001, Doug Olson, Iwona Sakrejda, Brian Tierney, Mark Green 0001, Russ Miller, James Letts, Terrence Martin, David Bury, Catalin Dumitrescu, Daniel Engh, Robert W. Gardner, Marco Mambelli, Yuri Smirnov, Jens-S. Vöckler, Michael Wilde, Yong Zhao 0009, Paul Avery, Richard Cavanaugh, Bockjoo Kim, Craig Prescott, Jorge Rodríguez 0002, Andrew Zahn, Shawn McKee, Christopher T. Jordan, James E. Prewett, Timothy L. Thomas, Horst Severini, Ben Clifford, Ewa Deelman, Larry Flon, Carl Kesselman, Gaurang Mehta, Nosa Olomu, Karan Vahi, Kaushik De, Patrick McGuigan, Mark Sosebee, Dan Bradley, Peter Couvares, Alan DeSmet, Carey Kireyev, Erik Paulson 0001, Alain J. Roy, Scott Koranda, Brian Moe, Bobby Brown, Paul Sheldon	HPDC	59
2004	Coarse grained gather and scatter operations with applications Laurence Boxer, Russ Miller	J. Parallel Distributed Comput.	2
2004	Molecular structure determination on a computational and data grid Mark L. Green, Russ Miller	Parallel Comput.	2
2004	Evolutionary molecular structure determination using grid-enabled data mining Mark L. Green, Russ Miller	Parallel Comput.	2
2002	Corrigendum to "Efficient Computation of the Euclidean Distance Transform" Laurence Boxer, Russ Miller	Comput. Vis. Image Underst.	2
2001	A parallel algorithm for approximate regularity Laurence Boxer, Russ Miller	Inf. Process. Lett.	2
2000	Efficient Computation of the Euclidean Distance Transform Laurence Boxer, Russ Miller	Comput. Vis. Image Underst.	2
1999	Scalable Parallel Algorithms for Geometric Pattern Recognition Laurence Boxer, Russ Miller, Andrew Rau-Chaplin	J. Parallel Distributed Comput.	2
1998	Scaleable Parallel Algorithms for Lower Envelopes with Applications Laurence Boxer, Russ Miller, Andrew Rau-Chaplin	J. Parallel Distributed Comput.	2
1996	The Design of a Portable Scientific Tool: A Case Study Using SnB abstract Developing and maintaining a large software package is a complex task. Decisions are made early in the design process that affect i) the ability of a user to effectively exploit the package and ii) the ability of a software engineer to maintain it. This case study discusses issues in software development and maintainability of a scientific package called SnB, which is used to determine molecular crystal structures. The design of the user interface is discussed along with important software engineering concepts, including modular programming, data encapsulation, and internal code documentation. Fortran is a language that is still widely used in the scientific community. Issues concerning the integration of Fortran into a modern scientific application with a C-based user interface are also discussed. Scientific applications benefit from being available on a wide variety of platforms. Due to demand, SnB is available on a variety of sequential and parallel platforms. Methods used in the design of SnB for such portability are presented including POSIX compliance, automatic configuration scripts, and parallel programming techniques. Steven M. Gallo, Russ Miller, Charles M. Weeks	SC	2
1995	The Systolic Reconfigurable Mesh Mary Mehrnoosh Eshaghian-Wilner, Russ Miller	ICPP (3)	2
1994	Mesh Algorithms for Finding Repetitions and Parallel Symmetries in Arrays abstract The two-dimensional mesh computer architecture has proven to be an appropriate means to apply parallel computation to problems in image processing. However, this is most often done using local-neighbourhood operations to accomplish image filtering and morphological transformations. The discovery of structures in an image such as repetitions and symmetries is another form of visual analysis, and yet relatively little has been done to apply mesh computers to this problem. In this paper, we apply the primitive operations of prefix scanning and sorting to efficiently implement a repetition finding algorithm for arrays. The computational complexity of the algorithm on a n×n mesh is O(n log k) where k is the width of the largest repeated block in the array. The algorithm was implemented on a MasPar MP-1 computer. We describe variations of the algorithm for solving several related problems including the detection of partial symmetries in an image and repetitions in images modulo pixel-value transformations. Steven L. Tanimoto, Russ Miller	Int. J. Pattern Recognit. Artif. Intell.	2
1994	Multisearch Techniques: Parallel Data Structures on Mesh-Connected Computers Mikhail J. Atallah, Frank Dehne, Russ Miller, Andrew Rau-Chaplin, Jyh-Jong Tsay	J. Parallel Distributed Comput.	3
1994	Parallel Algorithms for Gray-Scale Digitized Picture Component Labeling on a Mesh-Connected Computer Susanne E. Hambrusch, Russ Miller	J. Parallel Distributed Comput.	3
1993	Polygonal approximation by boundary reduction Laurence Boxer, Chun-Shi Chang 0001, Russ Miller, Andrew Rau-Chaplin	Pattern Recognit. Lett.	3
1993	Parallel algorithms for all maximal equally-spaced collinear sets and all maximal regular coplanar lattices Laurence Boxer, Russ Miller	Pattern Recognit. Lett.	2
1993	Parallel Computations on Reconfigurable Meshes abstract The mesh with reconfigurable bus is presented as a model of computation. The reconfigurable mesh captures salient features from a variety of sources, including the CAAPP, CHiP, polymorphic-torus network, and bus automation. It consists of an array of processors interconnected by a reconfigurable bus system that can be used to dynamically obtain various interconnection patterns between the processors. A variety of fundamental data-movement operations for the reconfigurable mesh are introduced. Based on these operations, algorithms that are efficient for solving a variety of problems involving graphs and digitized images are also introduced. The algorithms are asymptotically superior to those previously obtained for the aforementioned reconfigurable architectures, as well as to those previously obtained for the mesh, the mesh with multiple broadcasting, the mesh with multiple buses, the mesh-of-trees, and the pyramid computer. The power of reconfigurability is illustrated by solving some problems, such as the exclusive OR, more efficiently on the reconfigurable mesh than is possible on the programmable random-access memory (PRAM).> Russ Miller, Viktor Prasanna 0001, Dionysios I. Reisis, Quentin F. Stout	IEEE Trans. Computers	1
1992	Parallel Algorithms for Gray-Scale Image Component Labeling on a Mesh-Connected Computer abstract We present two asymptotically optimal @(n) time algorithms for labeling the connected components of a gray-scale image on a mesh-connected computer.We assume that the input is an n x n gray-scale image mapped one pixel per processor onto an n x n mesh-connected computer.Our algorithms label the components so that every component is connected, the maximum difference in the gray-scale values of the pixels within any component does not exceed a given value, and no component can be merged with a neighboring component.The first algorithm is based on a divide-and-conquer approach.Although it is simple, this algorithm has the potential drawback of possibly assigning two adjacent pixels with the same gray-scale value to different components.The second algorithm avoids this potential drawback, and exploits the ability of a mesh-connected computer to efficiently determine a maximal independent set of a planar graph. Susanne E. Hambrusch, Russ Miller	SPAA	3
1992	Efficient Convexity and Domination Algorithms for Fine-and Medium-Grain Hypercube Computers Ed Cohen, Russ Miller, Elias M. Sarraf, Quentin F. Stout	Algorithmica	2
1991	Detecting Repeated Patterns on Mesh Computers Russ Miller, Steven L. Tanimoto	ICPP (3)	1
1991	Multisearch Techniques for Implementing Data Structures on a Mesh-Connected Computer (Preliminary Version) Mikhail J. Atallah, Frank Dehne, Russ Miller, Andrew Rau-Chaplin, Jyh-Jong Tsay	SPAA	3
1991	Computing Convexity Properties of Images on a Pyramid Computer Russ Miller, Quentin F. Stout	Algorithmica	1
1990	Common Intersections of Polygons Laurence Boxer, Russ Miller	Inf. Process. Lett.	2
1989	An introduction to the portable parallel programming language Seymour abstract Seymour, a high-level data parallel programming language that can be used to design, express, and implement efficient portable parallel algorithms, is introduced. Seymour is based on the approach of designing parallel algorithms based on standardized global operations such as prefix, broadcast, sort, compression, and associative read. Seymour also incorporates fundamental paradigms, such as divide-and-conquer, reduce-and-create-cross-product, and reduce-and-compress, which are derived from theoretical parallel algorithms. Seymour redirects the difficulties of portability and efficiency into similar difficulties for the global operations and paradigms. However, the cost of developing efficient implementations of standardized operations on the various target architectures can be amortized over numerous algorithms.> Russ Miller, Quentin F. Stout	COMPSAC	1
1989	Optimal Hypercube Algorithms for Labeled Images (Preliminary Version) Russ Miller, Quentin F. Stout	WADS	1
1989	A Parallel Circle-Cover Minimization Algorithm Laurence Boxer, Russ Miller	Inf. Process. Lett.	2
1989	Mesh Computer Algorithms for Computational Geometry abstract Asymptotically optimal parallel algorithms are presented for use on a mesh computer to determine several fundamental geometric properties of figures. For example, given multiple figures represented by the Cartesian coordinates of n or fewer planar vertices, distributed one point per processor on a two-dimensional mesh computer with n simple processing elements, Theta (n/sup 1/2/>or=-time algorithms are given for identifying the convex hull and smallest enclosing box of each figure. Given two such figures, a Theta (n/sup 1/2/>or=-time algorithm is given to decide if the two figures are linearly separable. Given n or fewer planar points, Theta (n/sup 1/2/>or=-time algorithms are given to solve the all-nearest neighbor problems for points and for sets of points. Given n or fewer circles, convex figures, hyperplanes, simple polygons, orthogonal polygons, or iso-oriented rectangles, Theta (n/sup 1/2/>or=-time algorithms are given to solve a variety of area and intersection problems. Since any serial computer has worst-case time of Omega (n) when processing n points, these algorithms show that the mesh computer provides significantly better solutions to these problems.> Russ Miller, Quentin F. Stout	IEEE Trans. Computers	1
1989	Dynamic computational geometry on meshes and hypercubes Laurence Boxer, Russ Miller	J. Supercomput.	2
1988	Image computations on reconfigurable VLSI arrays abstract The authors consider image computations on a mesh with reconfigurable bus (reconfigurable mesh). The architecture consists of an array of processors overlaid with a reconfigurable bus system. The reconfiguration scheme can be used to dynamically obtain various interconnection patterns among the processor elements. The reconfiguration scheme supports several parallel techniques developed on the CRCW PRAM (concurrent read, concurrent write parallel random-access machine) model, leading to asymptotically superior solution times to image problems compared to those on the mesh with multiple broadcasting, the mesh with multiple buses, the mesh-of-trees, and the pyramid computer.> Russ Miller, Viktor Prasanna 0001, Dionysios I. Reisis, Quentin F. Stout	CVPR	1
1988	Simulating essential pyramids abstract When an image contains multiple objects of interest simple algorithms try to simultaneously use the apex for each object, creating a severe bottleneck; previous asymptotically efficient algorithms have tended to be quite complicated. A novel approach is presented which systematically simulates a separate 'essential' pyramid over each object. This simplifies algorithm development, since algorithms can be written assuming that there is only a single object. This approach can yield optimal or nearly optimal algorithms for the pyramid computer, and can also be used for many nonpyramid architectures. For several of these, the simulated pyramids over all objects can perform an algorithm nearly as fast as pyramid computer over a single object.> Russ Miller, Quentin F. Stout	CVPR	1
1988	Convexity algorithms for parallel machines abstract The authors present a parallel algorithms to identify (i.e., detect and enumerate) the extreme points of the convex hull of a set of planar points using a hypercube, pyramid, tree, mesh-of-trees, mesh with reconfigurable bus, EREW PRAM (exclusive read, exclusive write parallel random-access machine) and AKS sorting network. For the situation where the input set of n planar points is given ordered one per processor on a machine with Theta (n) processors, the authors introduce a worst-case hypercube algorithm that finishes in Theta (log n) time, a worst-case algorithm for the pyramid, tree, and mesh-of-trees that finishes in Theta (log/sup 3/ n/log logn)-time, and a worst-case algorithm for the mesh with reconfigurable bus that finishes in Theta (log/sup 2/ n) time. For the situation where the input set is given unordered one per processor, several optimal worst-case algorithms are given. It is shown that the Theta (log n) time hypercube algorithm for ordered data will extend to yield a worst-case optimal EREW PRAM algorithm and AKS sorting network algorithm for the case where the set of planar points is distributed in random fashion one point per processor.> Russ Miller, Quentin F. Stout	CVPR	1
1988	Data Movement Operations and Applications on Reconfigurable VLSI Arrays Russ Miller, Viktor Prasanna 0001, Dionysios I. Reisis, Quentin F. Stout	ICPP (1)	1
1988	Efficient Parallel Convex Hull Algorithms abstract Parallel algorithms are presented to identify (i.e. detect and enumerate) the extreme points of the convex hull of a set of planar points using a hypercube, pyramid, tree, mesh-of-trees, mesh with reconfigurable bus, exclusive-read-exclusive-write parallel random-access machine (EREW PRAM), and modified AKS network. It is shown that the problem of identifying the convex hull for a set of planar points given arbitrarily, cannot be solved faster than sorting.> Russ Miller, Quentin F. Stout	IEEE Trans. Computers	1
1988	Simulating Essential Pyramids abstract Pyramid computers, and more generally pyramid algorithms, for image processing have the advantage of providing regular structure with a base naturally identified with an input image and a logarithmic height that permits rapid reduction of information. It is shown that it is possible to simulate systematically the effect of having a separate, so-called 'essential' pyramid over each object, greatly simplifying algorithm development since algorithms can be written assuming that there is only a single object. This approach can yield optimal or nearly optimal algorithms for the pyramid computer and can also be used on nonpyramid architectures such as the hypercube, mesh-of-trees, mesh, mesh with row and column buses, mesh with reconfigurable buses, and PRAM (parallel random-access machine). For several of these architectures, the simulated essential pyramids can simultaneously execute an algorithm nearly as fast as a pyramid computer over a single object.> Russ Miller, Quentin F. Stout	IEEE Trans. Computers	1
1987	Using Hypercube Multiprocessors to Determine Geometric Properties of Digitized Pictures Russ Miller, Susan E. Miller	ICPP	1
1987	Mesh Computer Algorithms for Line Segments and Simple Polygons Russ Miller, Quentin F. Stout	ICPP	1
1987	Data Movement Techniques for the Pyramid Computer abstract The pyramid computer was initially proposed for performing high-speed low-level image processing. However, its regular geometry can be adapted naturally to many other problems, providing effective solutions to problems more complex than those previously considered. We illustrate this by presenting pyramid computer solutions to problems involving component labeling, minimal spanning forests, nearest neighbors, transitive closure, articulation points, bridge edges, etc. Central to these algorithms is our collection of data movement techniques which exploit the pyramid’s mix of tree and mesh connections. Our pyramid algorithms are significantly faster than their mesh-connected computer counterparts. For example, given a black/white square picture with n pixels, we can label the connected components in $\theta (n^{{1 / 4}} )$ time, as compared with the $\Omega (n^{{1 / 2}} )$ time required on the mesh-connected computer. Russ Miller, Quentin F. Stout	SIAM J. Comput.	1
1985	Pyramid computer algorithms for determining geometric properties of images abstract This paper gives several pyramid computer algorithms for determining geometric properties of black/white digitized pictures stored in the base of the pyramid. These algorithms determine properties such as convexity and nearest neighbors of black figures. We show that the pyramid is faster than either a tree of mesh machine, but, like the tree, the time needed by algorithms is quite sensitive to the amount of data movement required. We also consider modified pyramids in which each base processor stores many pixels, and machine models which are related to the pyramid. Russ Miller, Quentin F. Stout	SCG	1
1985	Varying Diameter and Problem Size in Mesh-Connected Computers Russ Miller, Quentin F. Stout	ICPP	1
1985	Geometric Algorithms for Digitized Pictures on a Mesh-Connected Computer abstract Although mesh-connected computers are used almost exclusively for low-level local image processing, they are also suitable for higher level image processing tasks. We illustrate this by presenting new optimal (in the O-notational sense) algorithms for computing several geometric properties of figures. For example, given a black/white picture stored one pixel per processing element in an n × n mesh-connected computer, we give ¿(n) time algorithms for determining the extreme points of the convex hull of each component, for deciding if the convex hull of each component contains pixels that are not members of the component, for deciding if two sets of processors are linearly separable, for deciding if each component is convex, for determining the distance to the nearest neighboring component of each component, for determining internal distances in each component, for counting and marking minimal internal paths in each component, for computing the external diameter of each component, for solving the largest empty circle problem, for determining internal diameters of components without holes, and for solving the all-points farthest point problem. Previous mesh-connected computer algorithms for these problems were either nonexistent or had worst case times of ¿(n2). Since any serial computer has a best case time of ¿(n2) when processing an n × n image, our algorithms show that the mesh-connected computer provides significantly better solutions to these problems. Russ Miller, Quentin F. Stout	IEEE Trans. Pattern Anal. Mach. Intell.	1