David Matula
#113,936
Most Influential Person Now
American computer scientist
David Matula's AcademicInfluence.com Rankings
David Matulacomputer-science Degrees
Computer Science
#6321
World Rank
#6667
Historical Rank
Computational Linguistics
#2653
World Rank
#2680
Historical Rank
Artificial Intelligence
#5175
World Rank
#5244
Historical Rank
Database
#7528
World Rank
#7807
Historical Rank
Download Badge
Computer Science
Why Is David Matula Influential?
(Suggest an Edit or Addition)According to Wikipedia, David William Matula is an American mathematician and computer scientist known for his research on graph theory, graph algorithms, computer arithmetic, and algorithm engineering. He is a professor emeritus at Southern Methodist University, where he formerly held the Cruse C. and Marjorie F. Calahan Centennial Chair in Engineering.
David Matula's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- IEEE Standard for Floating-Point Arithmetic (2008) (1446)
- The maximum concurrent flow problem (1990) (462)
- Smallest-last ordering and clustering and graph coloring algorithms (1983) (459)
- Properties of Gabriel Graphs Relevant to Geographic Variation Research and the Clustering of Points in the Plane (2010) (389)
- Faithful bipartite ROM reciprocal tables (1995) (177)
- GRAPH COLORING ALGORITHMS (1972) (149)
- k-Components, Clusters and Slicings in Graphs (1972) (136)
- Subtree Isomorphism in O(n5/2) (1978) (107)
- Sparsest cuts and bottlenecks in graphs (1990) (105)
- Graph Theoretic Techniques for Cluster Analysis Algorithms (1977) (98)
- Determining edge connectivity in 0(nm) (1987) (97)
- Measuring the accuracy of ROM reciprocal tables (1993) (93)
- Improving Goldschmidt Division, Square Root, and Square Root Reciprocal (2000) (73)
- A linear time 2 + ε approximation algorithm for edge connectivity (1993) (66)
- Redundant binary Booth recoding (1995) (66)
- A Periodic Optimal Search (1964) (63)
- Basic digit sets for radix representation (1982) (62)
- An IEEE Compliant Floating-Point Adder that Conforms with the Pipelined Packet-Forwarding Paradigm (2000) (61)
- Molecular Distributions at Equilibrium. I. Theory of Equilibria in Scrambling Reactions and Interpretation of NMR Spectra (1964) (54)
- Finite Precision Rational Arithmetic: Slash Number Systems (1983) (46)
- Expose-and-merge exploration and the chromatic number of a random graph (1987) (42)
- Finite Precision Rational Arithmetic: An Arithmetic Unit (1983) (41)
- On infinitely precise rounding for division, square root, reciprocal and square root reciprocal (1999) (40)
- Semantics for exact floating point operations (1991) (40)
- In-and-out conversions (1968) (38)
- Two linear-time algorithms for five-coloring a planar graph (1980) (37)
- Binary multiplication radix-32 and radix-256 (2001) (36)
- Finite precision lexicographic continued fraction number systems (1985) (35)
- An Algorithm for Redundant Binary Bit-Pipelined Rational Arithmetic (1990) (34)
- Finite Precision Number Systems and Arithmetic (2010) (33)
- The use of sparsest cuts to reveal the hierarchical community structure of social networks (2008) (33)
- The cohesive strength of graphs (1969) (31)
- A Formalization of Floating-Point Numeric Base Conversion (1970) (31)
- Faithful interpolation in reciprocal tables (1997) (31)
- Foundations of Finite Precision Rational Arithmetic (1980) (30)
- k-Blocks and ultrablocks in graphs (1978) (29)
- Secondary radix recodings for higher radix multipliers (2005) (29)
- A Booth multiplier accepting both a redundant or a non redundant input with no additional delay (2000) (28)
- A Simulative Study of Correlated Error Propagation in Various Finite-Precision Arithmetics (1973) (24)
- A 17 /spl times/ 69 bit multiply and add unit with redundant binary feedback and single cycle latency (1993) (24)
- A Graph Theoretic Approach for Channel Assignment in Cellular Networks (2001) (23)
- An On-Line Arithmetic Unit for Bit-Pipelined Rational Arithmetic (1988) (22)
- Recoders for Partial Compression and Rounding (1997) (22)
- A Low Power High Performance Radix-4 Approximate Squaring Circuit (2009) (21)
- Validated Roundings of Dot Products by Sticky Accumulation (1997) (20)
- Further Reducing the Redundancy of a Notation Over a Minimally Redundant Digit Set (2003) (18)
- Concurrent flow and concurrent connectivity on graphs (1985) (17)
- Pipelined packet-forwarding floating point. II. An adder (1997) (17)
- Exchange of Parts between Molecules at Equilibrium. II. Polyarsenous Oxyhalides (1964) (17)
- Pipelined packet-forwarding floating point. I. Foundations and a rounder (1997) (16)
- Generation and analysis of hard to round cases for binary floating point division (2001) (15)
- Subgraph connectivity numbers of a graph (1978) (15)
- Analysis of Reciprocal and Square Root Reciprocal Instructions in the AMD K6-2 Implementation of 3DNow! (2000) (15)
- An order preserving finite binary encoding of the rationals (1983) (15)
- Fixed-slash and floating-slash rational arithmetic (1975) (14)
- Base conversion in residue number systems (1975) (12)
- The base conversion theorem (1968) (12)
- Employing (1 − ε) dominating set partitions as backbones in wireless sensor networks (2010) (12)
- On solving large maximum concurrent flow problems (1987) (12)
- Two Flow Routing Algorithms for the Maximum Concurrent-Flow Problem (1986) (12)
- Ramsey theory for graph connectivity (1983) (12)
- Improved table lookup algorithms for postscaled division (2001) (11)
- Bounded color functions on graphs (1972) (11)
- Table lookup structures for multiplicative inverses modulo 2/sup k/ (2005) (11)
- A feasibility analysis of fixed-slash rational arithmetic (1978) (11)
- A feasibility analysis of binary fixed-slash and floating-slash number systems (1978) (10)
- Additive bit-serial algorithm for discrete logarithm modulo 2k (2005) (10)
- An approximate rational arithmetic system with intrinsic recovery of simple fractions during expression evaluation (1979) (10)
- A Linear Time 2+epsilon Approximation Algorithm for Edge Connectivity (1993) (10)
- A digit-serial algorithm for the discrete logarithm modulo 2/sup k/ (2004) (9)
- A compact linear programming formulation of the maximum concurrent flow problem (2015) (9)
- Exploiting redundancy in bit-pipelined rational arithmetic (1989) (9)
- Higher Radix Squaring Operations Employing Left-to-Right Dual Recoding (2009) (9)
- A linear time 2 + &&egr;ε approximation algorithm for edge connectivity (1993) (9)
- Quantum Logic Implementation of Unary Arithmetic Operations (2008) (8)
- Symmetric cellular network embeddings on a torus (1998) (8)
- A low power radix-4 dual recoded integer squaring implementation for use in design of application specific arithmetic circuits (2008) (8)
- Addition-based exponentiation modulo 2k (2005) (8)
- Experimental Study of Independent and Dominating Sets in Wireless Sensor Networks Using Graph Coloring Algorithms (2009) (8)
- LCF: A Lexicographic Binary Representation of the Rationals (1996) (8)
- A Discrete Logarithm Number System for Integer Arithmetic Modulo 2^{k}: Algorithms and Lookup Structures (2009) (8)
- A redundant binary Euclidean GCD algorithm (1991) (7)
- Molecular Distributions at Equilibrium. VI. Some Relationships, Latent in Stochastic Graph Theory, Suitable for Simplified Data Treatment of Polymer Systems (1967) (7)
- A digit serial algorithm for the integer power operation (2006) (7)
- On the Number of Subtrees of a Symmetric n-Ary Tree (1970) (6)
- Rounding of Floating Point Intervals (1994) (6)
- Design of a fast validated dot product operation (1993) (6)
- Calculating the Connectivity of a Directed Graph (1987) (6)
- Single precision reciprocals by multipartite table lookup (2005) (6)
- Cluster Validity by Concurrent Chaining (1983) (6)
- Hardware implementation of an additive bit-serial algorithm for the discrete logarithm modulo 2/sup k/ (2005) (6)
- Multiplicative Division Employing Independent Factors (2015) (6)
- A Digit-Serial Algorithm for the Discrete Logarithm Modulo 2k (2004) (5)
- Significant digit (2003) (5)
- Building (1 - epsilon) Dominating Sets Partition as Backbones in Wireless Sensor Networks Using Distributed Graph Coloring (2010) (5)
- A p×p bit fraction model of binary floating point division and extremal rounding cases (2003) (5)
- Performance Evaluation of a Novel Direct Table Lookup Method and Architecture with Application to 16-bit Integer Functions (2006) (5)
- Constructing efficient rotating backbones in wireless sensor networks using graph coloring (2012) (5)
- Regular Triangulated Toroidal Graphs with Applications to Cellular and Interconnection Networks (2002) (4)
- Prescaled integer division (2003) (4)
- Foundations of finite precision arithmetic (1972) (4)
- An integrated rational arithmetic unit (1981) (4)
- A bit-serial arithmetic unit for rational arithmetic (1987) (4)
- Path-Regular Graphs. (1980) (4)
- Extensions of maximum concurrent flow to identify hierarchical community structure and hubs in networks (2008) (4)
- Addition-based exponentiation modulo 2 (2001) (4)
- Metrics matter in community detection (2019) (3)
- Building ( 1 − ) Dominating Sets Partition as Backbones in Wireless Sensor Networks Using Distributed Graph Coloring (3)
- Approximating the independent domatic partition problem in random geometric graphs - an experimental study (2010) (3)
- STOCHASTIC GRAPH THEORY AND EQUILIBRIUM CONSTANTS FOR FAMILIES OF MOLECULES (1969) (3)
- Number Theoretic Foundations of Finite Precision Arithmetic (1972) (3)
- Performance analysis of a graph model for channel assignment in a cellular network (1999) (3)
- A Formal Model and Efficient Traversal Algorithm for Generating Testbenches for Verification of IEEE Standard Floating Point Division (2006) (3)
- Selecting a well distributed hard case test suite for IEEE standard floating point division (2001) (2)
- Random geometric graphs, their properties and applications on the plane, sphere, and torus (2010) (2)
- A Prescale-Lookup-Postscale Additive Procedure for Obtaining a Single Precision Ulp Accurate Reciprocal (2011) (2)
- NORMALIZED MUTUAL INFORMATION EXAGGERATES COMMUNITY DETECTION PERFORMANCE (2018) (2)
- Graph‐Theoretic Cluster Analysis (2004) (2)
- Theory of mixed backbone scrambling as exemplified by exchange of chlorine and bridging sulfur atoms between dimethylgermanium and dimethylsilicon (1969) (2)
- An architecture for a rational arithmetic unit (1988) (1)
- Proceedings : 10th IEEE Symposium on Computer Arithmetic, June 26-28, 1991 , Grenoble, France (1991) (1)
- A simulative study of correlated error propagation in various finite arithmetics (1972) (1)
- Evaluating products of nonlinear functions by indirect bipartite table lookup (2002) (1)
- A term project given in the basic computer science course at Washington University (1969) (1)
- Design of a highly parallel IEEE standard floating point unit: the Cyrix 83D87 coprocessor (1990) (1)
- Preface: Volume 24 (2000) (1)
- Employing (1 - epsilon) Dominating Set Partitions as Backbones in Wireless Sensor Networks (2010) (1)
- A methodology and model to develop complex systems from requirement networks (2008) (1)
- Correction to ``Finite Precision Rational Arithmetic: An Arithmetic Unit'' (1984) (1)
- A O(nm) Heuristic to the Hierarchical Maximum Concurrent Flow Problem (2017) (1)
- Significant Digits: Numerical Analysis or Numerology (1971) (1)
- The emergence of computational arithmetic as a component of the computer science curriculum (1970) (1)
- Low power floating-point multiplication and squaring units with shared circuitry (2013) (1)
- LCF: A Lexicagraphic Binary representation of the Rationals (1995) (1)
- Precise and Concise Graphical Representation of the Natural Numbers (2019) (1)
- Towards an abstract mathematical (2010) (0)
- Numerical analysis II (1973) (0)
- Finite Precision Number Systems and Arithmetic: Multiplication (2010) (0)
- “Real world” arithmetic (tutorial) (1997) (0)
- Computer Arithmetic - An Algorithm Engineer's Perspective (invited keynote) (2003) (0)
- Basic digit sets for radix representation of the integers (1978) (0)
- Foundations of Higher Radix Numeric Computation (2008) (0)
- Network analysis of respiratory sensations during stress and sports using flowthrough centrality measurements (2008) (0)
- Modular arithmetic and residue number systems (2010) (0)
- Secondary Radix Recodings for (2005) (0)
- Computer Arithmetic - An Algorithm Engineer's Perspective (2003) (0)
- An Optimal Algorithm for the Majority Element Problem (1990) (0)
- Performance Enhancement Techniques for Phased Logic Circuits Performance Enhancement Techniques for Phased Logic Circuits (0)
- Bipartite Grid Partitioning of a Random Geometric Graph (2017) (0)
- Floating-point number systems (2010) (0)
- Ariothmetic for microcomputers—some recent trends (1986) (0)
- Partitioning by Maximum Adjacency Search of Graphs (1993) (0)
- The emergence of computational arithmetic as a component of the computer science curriculum (1970) (0)
- Determining all pairs edge connectivity of a 4-regular graph in O(|V|) (2005) (0)
- Circles in a square world: a problem in pattern analysis. (1967) (0)
- THE TOPOLOGICAL TREES WITH EXTREMAL MATULA NUMBERS (2018) (0)
- Course and program descriptions (1970) (0)
- On Minimum Weight Binary Representation of Integers and Continued Fractions with Application to Computer Arithmetic (1981) (0)
- Evaluating the leximin method for community detection (2018) (0)
- Network analysis of respiratory sensations in sports and stress using flowthrough centrality measurements (2008) (0)
- Finite Precision Number Systems and Arithmetic: Square root (2010) (0)
- Finite Precision Number Systems and Arithmetic: Radix polynomial representation (2010) (0)
- Base and digit set conversion (2010) (0)
- Bounds on maximum concurrent flow in random bipartite graphs (2020) (0)
- Finite Precision Number Systems and Arithmetic: Addition (2010) (0)
- Cluster Analysis, Graph-Theoretic (2006) (0)
- I. Introduction and summary. Utilizing a fixed number of digits and the power of a base to denote a real number is variously called a normalized, floating point, or scientific representation. Allowing (2016) (0)
- Flowthrough Centrality: A Stable Node Centrality Measure (2022) (0)
- Graph Coarsening for Runtime Improvements in the Maximum Concurrent Flow Problem (2018) (0)
- A uniform set covering lemma (1975) (0)
- Multilevel Variable Length Shifter Design for an Iterated Shift-and-Add Product Operation (2007) (0)
This paper list is powered by the following services:
Other Resources About David Matula
What Schools Are Affiliated With David Matula?
David Matula is affiliated with the following schools:
