David W. Matula

发表

An Optimal Algorithm for the Majority Element Problem

David W. Matula, 1990 .

Symmetric cellular network embeddings on a torus

David W. Matula, Mihaela Iridon, 1998, Proceedings 7th International Conference on Computer Communications and Networks (Cat. No.98EX226).

Base conversion in residue number systems

David W. Matula, Robert T. Gregory, D. Matula, 1975, 1975 IEEE 3rd Symposium on Computer Arithmetic (ARITH).

Prescaled integer division

Alex Fit-Florea, David W. Matula, 2003, Proceedings 2003 16th IEEE Symposium on Computer Arithmetic.

Analysis of Reciprocal and Square Root Reciprocal Instructions in the AMD K6-2 Implementation of 3DNow!

David W. Matula, Cristina S. Iordache, 1999, Electron. Notes Theor. Comput. Sci..

Preface

Abbas Edalat, David W. Matula, Philipp Sünderhauf, 1999, Electron. Notes Theor. Comput. Sci..

A Formal Model and Efficient Traversal Algorithm for Generating Testbenches for Verification of IEEE Standard Floating Point Division

David W. Matula, Lee D. McFearin, 2006, Proceedings of the Design Automation & Test in Europe Conference.

IEEE Standard for Floating-Point Arithmetic

James Demmel, William Kahan, Guillaume Melquiond, 2008 .

Foundations of Higher Radix Numeric Computation

David W. Matula, 2008, 38th International Symposium on Multiple Valued Logic (ismvl 2008).

Building (1 - epsilon) Dominating Sets Partition as Backbones in Wireless Sensor Networks Using Distributed Graph Coloring

David W. Matula, Dhia Mahjoub, D. Matula, 2010, DCOSS.

Computer Arithmetic - An Algorithm Engineer's Perspective (invited keynote)

David W. Matula, 2003 .

k-Blocks and ultrablocks in graphs

David W. Matula, D. Matula, 1978, J. Comb. Theory, Ser. B.

Metrics matter in community detection pdf

Rachel Rudinger, Arya D. McCarthy, Tongfei Chen, 2019, COMPLEX NETWORKS.

On infinitely precise rounding for division, square root, reciprocal and square root reciprocal

David W. Matula, Cristina Iordache, D. Matula, 1999, Proceedings 14th IEEE Symposium on Computer Arithmetic (Cat. No.99CB36336).

Pipelined packet-forwarding floating point. II. An adder

Guy Even, David W. Matula, Asger Munk Nielsen, 1997, Proceedings 13th IEEE Sympsoium on Computer Arithmetic.

Secondary radix recodings for higher radix multipliers

Peter-Michael Seidel, David W. Matula, Lee D. McFearin, 2005, IEEE Transactions on Computers.

Graph‐Theoretic Cluster Analysis

David W. Matula, 2004 .

Improving Goldschmidt Division, Square Root, and Square Root Reciprocal

Milos D. Ercegovac, Jean-Michel Muller, Laurent Imbert, 2000, IEEE Trans. Computers.

An approximate rational arithmetic system with intrinsic recovery of simple fractions during expression evaluation

Peter Kornerup, David W. Matula, 1979, EUROSAM.

Design of a fast validated dot product operation

David W. Matula, Marc Daumas, M. Daumas, 1993, Proceedings of IEEE 11th Symposium on Computer Arithmetic.

Fixed-slash and floating-slash rational arithmetic

David W. Matula, 1975, 1975 IEEE 3rd Symposium on Computer Arithmetic (ARITH).

Cluster Validity by Concurrent Chaining

David W. Matula, D. Matula, 1983 .

The cohesive strength of graphs

David W. Matula, D. Matula, 1969 .

Determining all pairs edge connectivity of a 4-regular graph in O(|V|)

Alex Fit-Florea, David W. Matula, A. Fit-Florea, 2005, The 3rd ACS/IEEE International Conference onComputer Systems and Applications, 2005..

An order preserving finite binary encoding of the rationals

Peter Kornerup, David W. Matula, 1983, 1983 IEEE 6th Symposium on Computer Arithmetic (ARITH).

The emergence of computational arithmetic as a component of the computer science curriculum

David W. Matula, 1970, SIGCSE '70.

An integrated rational arithmetic unit

Peter Kornerup, David W. Matula, 1981, 1981 IEEE 5th Symposium on Computer Arithmetic (ARITH).

Finite precision lexicographic continued fraction number systems

Peter Kornerup, David W. Matula, 1985, 1985 IEEE 7th Symposium on Computer Arithmetic (ARITH).

A simulative study of correlated error propagation in various finite arithmetics

David W. Matula, John D. Marasa, 1972, IEEE Symposium on Computer Arithmetic.

Exploiting redundancy in bit-pipelined rational arithmetic

Peter Kornerup, David W. Matula, 1989, Proceedings of 9th Symposium on Computer Arithmetic.

Quantum Logic Implementation of Unary Arithmetic Operations

D. Michael Miller, Mitchell A. Thornton, David W. Matula, 2008, 38th International Symposium on Multiple Valued Logic (ismvl 2008).

Significant Digits: Numerical Analysis or Numerology

David W. Matula, 1971, IFIP Congress.

Recoders for Partial Compression and Rounding

David W. Matula, Marc Daumas, 1997 .

A 17 /spl times/ 69 bit multiply and add unit with redundant binary feedback and single cycle latency

David W. Matula, W. S. Briggs, 1993, Proceedings of IEEE 11th Symposium on Computer Arithmetic.

Low power floating-point multiplication and squaring units with shared circuitry

Jason Moore, Mitchell A. Thornton, David W. Matula, 2013, 2013 IEEE 56th International Midwest Symposium on Circuits and Systems (MWSCAS).

Performance analysis of a graph model for channel assignment in a cellular network

David W. Matula, Mihaela Iridon, Hakki C. Cankaya, 1999, Proceedings. Twenty-Third Annual International Computer Software and Applications Conference (Cat. No.99CB37032).

Semantics for exact floating point operations

Peter Kornerup, David W. Matula, Wolfgang Walter, 1991, [1991] Proceedings 10th IEEE Symposium on Computer Arithmetic.

Improved table lookup algorithms for postscaled division

David W. Matula, 2001, Proceedings 15th IEEE Symposium on Computer Arithmetic. ARITH-15 2001.

Further Reducing the Redundancy of a Notation Over a Minimally Redundant Digit Set

David W. Matula, Marc Daumas, 2003, J. VLSI Signal Process..

A feasibility analysis of fixed-slash rational arithmetic

Peter Kornerup, David W. Matula, 1978, 1978 IEEE 4th Symposium onomputer Arithmetic (ARITH).

LCF: A Lexicagraphic Binary representation of the Rationals

Peter Kornerup, David W. Matula, D. Matula, 1995, J. Univers. Comput. Sci..

Ramsey theory for graph connectivity

David W. Matula, 1983, J. Graph Theory.

Cluster Analysis, Graph-Theoretic

David W. Matula, 2006 .

A Linear Time 2+epsilon Approximation Algorithm for Edge Connectivity

David W. Matula, 1993, SODA.

Finite Precision Number Systems and Arithmetic

Peter Kornerup, David W. Matula, D. Matula, 2010 .

A Formalization of Floating-Point Numeric Base Conversion

David W. Matula, D. Matula, 1970, IEEE Transactions on Computers.

A bit-serial arithmetic unit for rational arithmetic

Peter Kornerup, David W. Matula, 1987, 1987 IEEE 8th Symposium on Computer Arithmetic (ARITH).

Bounds on maximum concurrent flow in random bipartite graphs

Eli V. Olinick, David W. Matula, Fernando E. Vilas, 2020, Optimization Letters.

A p×p bit fraction model of binary floating point division and extremal rounding cases

David W. Matula, Lee D. McFearin, D. Matula, 2003, Theor. Comput. Sci..

Higher Radix Squaring Operations Employing Left-to-Right Dual Recoding

David W. Matula, 2009, 2009 19th IEEE Symposium on Computer Arithmetic.

Computer Arithmetic - An Algorithm Engineer's Perspective

David W. Matula, 2003, Proceedings 2003 16th IEEE Symposium on Computer Arithmetic.

A Periodic Optimal Search

David W. Matula, 1964 .

A Booth multiplier accepting both a redundant or a non redundant input with no additional delay

David W. Matula, Marc Daumas, 2000, Proceedings IEEE International Conference on Application-Specific Systems, Architectures, and Processors.

A methodology and model to develop complex systems from requirement networks

David W. Matula, Jerrell Stracener, William Evan Westermann, 2008 .

A Simulative Study of Correlated Error Propagation in Various Finite-Precision Arithmetics

David W. Matula, John D. Marasa, 1973, IEEE Transactions on Computers.

An Algorithm for Redundant Binary Bit-Pipelined Rational Arithmetic

Peter Kornerup, David W. Matula, 1990, IEEE Trans. Computers.

Pipelined packet-forwarding floating point. I. Foundations and a rounder

David W. Matula, Asger Munk Nielsen, 1997, Proceedings 13th IEEE Sympsoium on Computer Arithmetic.

Finite Precision Rational Arithmetic: An Arithmetic Unit

Peter Kornerup, David W. Matula, D. Matula, 1983, IEEE Transactions on Computers.

A Graph Theoretic Approach for Channel Assignment in Cellular Networks

Cheng Yang, David W. Matula, Mihaela Iridon, 2001, Wirel. Networks.

Table lookup structures for multiplicative inverses modulo 2/sup k/

Mitchell A. Thornton, Alex Fit-Florea, David W. Matula, 2005, 17th IEEE Symposium on Computer Arithmetic (ARITH'05).

Faithful interpolation in reciprocal tables

Debjit Das Sarma, David W. Matula, 1997, Proceedings 13th IEEE Sympsoium on Computer Arithmetic.

Employing (1 - epsilon) Dominating Set Partitions as Backbones in Wireless Sensor Networks

David W. Matula, Dhia Mahjoub, 2010, ALENEX.

On solving large maximum concurrent flow problems

Farhad Shahrokhi, David W. Matula, D. Matula, 1987, CSC '87.

Hardware implementation of an additive bit-serial algorithm for the discrete logarithm modulo 2/sup k/

Lun Li, Mitchell A. Thornton, Alex Fit-Florea, 2005, IEEE Computer Society Annual Symposium on VLSI: New Frontiers in VLSI Design (ISVLSI'05).

Approximating the independent domatic partition problem in random geometric graphs - an experimental study

David W. Matula, Dhia Mahjoub, Angelika Leskovskaya, 2010, CCCG.

A Low Power High Performance Radix-4 Approximate Squaring Circuit

Mitchell A. Thornton, David W. Matula, Satyendra R. Datla, 2009, 2009 20th IEEE International Conference on Application-specific Systems, Architectures and Processors.

Experimental Study of Independent and Dominating Sets in Wireless Sensor Networks Using Graph Coloring Algorithms

David W. Matula, Dhia Mahjoub, 2009, WASA.

A Discrete Logarithm Number System for Integer Arithmetic Modulo 2^{k}: Algorithms and Lookup Structures

Lun Li, Mitchell A. Thornton, Alex Fit-Florea, 2009, IEEE Transactions on Computers.

The base conversion theorem

David W. Matula, 1968 .

A digit serial algorithm for the integer power operation

Lun Li, Mitchell A. Thornton, David W. Matula, 2006, GLSVLSI '06.

The use of sparsest cuts to reveal the hierarchical community structure of social networks

Eli V. Olinick, David W. Matula, Charles F. Mann, 2008, Soc. Networks.

Multiplicative Division Employing Independent Factors

David W. Matula, Mihai T. Panu, Jonathan Y. Zhang, 2015, IEEE Transactions on Computers.

LCF: A Lexicographic Binary Representation of the Rationals

Peter Kornerup, David W. Matula, D. Matula, 1996 .

Validated Roundings of Dot Products by Sticky Accumulation

David W. Matula, Marc Daumas, M. Daumas, 1997, IEEE Trans. Computers.

Base conversion mappings

David W. Matula, 1967, AFIPS '67 (Spring).

Measuring the accuracy of ROM reciprocal tables

Debjit Das Sarma, David W. Matula, 1993, Proceedings of IEEE 11th Symposium on Computer Arithmetic.

A compact linear programming formulation of the maximum concurrent flow problem

Eli V. Olinick, David W. Matula, Yuanyuan Dong, 2015, Networks.

A redundant binary Euclidean GCD algorithm

David W. Matula, Shrikant N. Parikh, 1991, [1991] Proceedings 10th IEEE Symposium on Computer Arithmetic.

Two linear-time algorithms for five-coloring a planar graph

Robert E. Tarjan, David W. Matula, Yossi Shiloach, 1980 .

A O(nm) Heuristic to the Hierarchical Maximum Concurrent Flow Problem

Eli V. Olinick, David W. Matula, Fernando E. Vilas, 2017 .

Bipartite Grid Partitioning of a Random Geometric Graph

David W. Matula, Zizhen Chen, 2017, 2017 13th International Conference on Distributed Computing in Sensor Systems (DCOSS).

A Prescale-Lookup-Postscale Additive Procedure for Obtaining a Single Precision Ulp Accurate Reciprocal

David W. Matula, Mihai T. Panu, 2011, 2011 IEEE 20th Symposium on Computer Arithmetic.

Single precision reciprocals by multipartite table lookup

Peter Kornerup, David W. Matula, 2005, 17th IEEE Symposium on Computer Arithmetic (ARITH'05).

Binary multiplication radix-32 and radix-256

Peter-Michael Seidel, David W. Matula, Lee D. McFearin, 2001, Proceedings 15th IEEE Symposium on Computer Arithmetic. ARITH-15 2001.

Selecting a well distributed hard case test suite for IEEE standard floating point division

David W. Matula, Lee D. McFearin, 2001, Proceedings 2001 IEEE International Conference on Computer Design: VLSI in Computers and Processors. ICCD 2001.

Faithful bipartite ROM reciprocal tables

Debjit Das Sarma, David W. Matula, 1995, Proceedings of the 12th Symposium on Computer Arithmetic.

Sparsest cuts and bottlenecks in graphs

Farhad Shahrokhi, David W. Matula, D. Matula, 1990, Discret. Appl. Math..

Calculating the Connectivity of a Directed Graph

Rakesh V. Vohra, David W. Matula, R. Vohra, 1987 .

Graph Coarsening for Runtime Improvements in the Maximum Concurrent Flow Problem

Eli V. Olinick, David W. Matula, Fernando E. Vilas, 2018 .

Design of a highly parallel IEEE standard floating point unit: the Cyrix 83D87 coprocessor

David W. Matula, 1990, Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990.

Constructing efficient rotating backbones in wireless sensor networks using graph coloring

David W. Matula, Dhia Mahjoub, 2012, Comput. Commun..

An On-Line Arithmetic Unit for Bit-Pipelined Rational Arithmetic

Peter Kornerup, David W. Matula, D. Matula, 1988, J. Parallel Distributed Comput..

A Digit-Serial Algorithm for the Discrete Logarithm Modulo 2k

Alex Fit-Florea, David W. Matula, 2004, ASAP.

Proceedings : 10th IEEE Symposium on Computer Arithmetic, June 26-28, 1991 , Grenoble, France

Peter Kornerup, David W. Matula, 1991 .

Two Flow Routing Algorithms for the Maximum Concurrent-Flow Problem

Jit Biswas, David W. Matula, D. Matula, 1986, FJCC.

Smallest-last ordering and clustering and graph coloring algorithms

Leland L. Beck, David W. Matula, D. Matula, 1983, JACM.

Evaluating products of nonlinear functions by indirect bipartite table lookup

Alex Fit-Florea, David W. Matula, Lee D. McFearin, 2002, Proceedings IEEE International Conference on Application- Specific Systems, Architectures, and Processors.

Towards an abstract mathematical theory of floating-point arithmetic

David W. Matula, 1969, AFIPS '69 (Spring).

Basic digit sets for radix representation of the integers

David W. Matula, 1978, 1978 IEEE 4th Symposium onomputer Arithmetic (ARITH).

Performance Evaluation of a Novel Direct Table Lookup Method and Architecture with Application to 16-bit Integer Functions

Mitchell A. Thornton, Lun Li, Alex Fit-Florea, 2006, IEEE 17th International Conference on Application-specific Systems, Architectures and Processors (ASAP'06).

Measuring the Accuracy of ROM Reciprocal Tables

Debjit Das Sarma, David W. Matula, 1994, IEEE Trans. Computers.

Regular Triangulated Toroidal Graphs with Applications to Cellular and Interconnection Networks

David W. Matula, Mihaela Iridon, D. Matula, 2002, J. Graph Algorithms Appl..

Redundant binary Booth recoding

David W. Matula, Chung Nan Lyu, 1995, Proceedings of the 12th Symposium on Computer Arithmetic.

A feasibility analysis of binary fixed-slash and floating-slash number systems

Peter Kornerup, David W. Matula, 1978, 1978 IEEE 4th Symposium onomputer Arithmetic (ARITH).

An IEEE Compliant Floating-Point Adder that Conforms with the Pipelined Packet-Forwarding Paradigm

Guy Even, David W. Matula, Asger Munk Nielsen, 2000, IEEE Trans. Computers.

In-and-out conversions

David W. Matula, D. Matula, 1968, CACM.