David W. Matula

Affiliations:
  • Southern Methodist University, Dallas, Texas, USA


According to our database1, David W. Matula authored at least 99 papers between 1967 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Bounds on maximum concurrent flow in random bipartite graphs.
Optim. Lett., 2020

2019
Metrics Matter in Community Detection.
Proceedings of the Complex Networks and Their Applications VIII, 2019

Precise and Concise Graphical Representation of the Natural Numbers.
Proceedings of the 26th IEEE Symposium on Computer Arithmetic, 2019

2017
Bipartite Grid Partitioning of a Random Geometric Graph.
Proceedings of the 13th International Conference on Distributed Computing in Sensor Systems, 2017

2015
Multiplicative Division Employing Independent Factors.
IEEE Trans. Computers, 2015

A compact linear programming formulation of the maximum concurrent flow problem.
Networks, 2015

2013
Low power floating-point multiplication and squaring units with shared circuitry.
Proceedings of the IEEE 56th International Midwest Symposium on Circuits and Systems, 2013

2012
Constructing efficient rotating backbones in wireless sensor networks using graph coloring.
Comput. Commun., 2012

2011
A Prescale-Lookup-Postscale Additive Procedure for Obtaining a Single Precision Ulp Accurate Reciprocal.
Proceedings of the 20th IEEE Symposium on Computer Arithmetic, 2011

2010
Building (1 - <i>epsilon</i>) Dominating Sets Partition as Backbones in Wireless Sensor Networks Using Distributed Graph Coloring.
Proceedings of the Distributed Computing in Sensor Systems, 2010

Approximating the independent domatic partition problem in random geometric graphs - an experimental study.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

Employing (1 - epsilon) Dominating Set Partitions as Backbones in Wireless Sensor Networks.
Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments, 2010

2009
A Discrete Logarithm Number System for Integer Arithmetic Modulo 2<sup>k</sup>: Algorithms and Lookup Structures.
IEEE Trans. Computers, 2009

Experimental Study of Independent and Dominating Sets in Wireless Sensor Networks Using Graph Coloring Algorithms.
Proceedings of the Wireless Algorithms, 2009

A Low Power High Performance Radix-4 Approximate Squaring Circuit.
Proceedings of the 20th IEEE International Conference on Application-Specific Systems, 2009

Higher Radix Squaring Operations Employing Left-to-Right Dual Recoding.
Proceedings of the 19th IEEE Symposium on Computer Arithmetic, 2009

2008
The use of sparsest cuts to reveal the hierarchical community structure of social networks.
Soc. Networks, 2008

Quantum Logic Implementation of Unary Arithmetic Operations.
Proceedings of the 38th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2008), 2008

Foundations of Higher Radix Numeric Computation.
Proceedings of the 38th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2008), 2008

2006
A digit serial algorithm for the integer power operation.
Proceedings of the 16th ACM Great Lakes Symposium on VLSI 2006, Philadelphia, PA, USA, April 30, 2006

A formal model and efficient traversal algorithm for generating testbenches for verification of IEEE standard floating point division.
Proceedings of the Conference on Design, Automation and Test in Europe, 2006

Performance Evaluation of a Novel Direct Table Lookup Method and Architecture with Application to 16-bit Integer Functions.
Proceedings of the 2006 IEEE International Conference on Application-Specific Systems, 2006

2005
Secondary Radix Recodings for Higher Radix Multipliers.
IEEE Trans. Computers, 2005

Hardware Implementation of an Additive Bit-Serial Algorithm for the Discrete Logarithm Modulo 2<sup>k</sup>.
Proceedings of the 2005 IEEE Computer Society Annual Symposium on VLSI (ISVLSI 2005), 2005

Table Lookup Structures for Multiplicative Inverses Modulo 2<sup>k</sup>.
Proceedings of the 17th IEEE Symposium on Computer Arithmetic (ARITH-17 2005), 2005

Single Precision Reciprocals by Multipartite Table Lookup.
Proceedings of the 17th IEEE Symposium on Computer Arithmetic (ARITH-17 2005), 2005

Determining all pairs edge connectivity of a 4-regular graph in O(|V|).
Proceedings of the 2005 ACS / IEEE International Conference on Computer Systems and Applications (AICCSA 2005), 2005

2004
A Digit-Serial Algorithm for the Discrete Logarithm Modulo 2<sup>k</sup>.
Proceedings of the 15th IEEE International Conference on Application-Specific Systems, 2004

2003
Further Reducing the Redundancy of a Notation Over a Minimally Redundant Digit Set.
J. VLSI Signal Process., 2003

A p×p bit fraction model of binary floating point division and extremal rounding cases.
Theor. Comput. Sci., 2003

Prescaled Integer Division.
Proceedings of the 16th IEEE Symposium on Computer Arithmetic (Arith-16 2003), 2003

Computer Arithmetic - An Algorithm Engineer's Perspective.
Proceedings of the 16th IEEE Symposium on Computer Arithmetic (Arith-16 2003), 2003

2002
Regular Triangulated Toroidal Graphs with Applications to Cellular and Interconnection Networks.
J. Graph Algorithms Appl., 2002

Evaluating Products of Non Linear Functions by Indirect Bipartite Table Lookup.
Proceedings of the 13th IEEE International Conference on Application-Specific Systems, 2002

2001
A Graph Theoretic Approach for Channel Assignment in Cellular Networks.
Wirel. Networks, 2001

Selecting A Well Distributed Hard Case Test Suite for IEEE Standard Floating Point Division.
Proceedings of the 19th International Conference on Computer Design (ICCD 2001), 2001

Binary Multiplication Radix-32 and Radix-256.
Proceedings of the 15th IEEE Symposium on Computer Arithmetic (Arith-15 2001), 2001

Generation and Analysis of Hard to Round Cases for Binary Floating Point Division.
Proceedings of the 15th IEEE Symposium on Computer Arithmetic (Arith-15 2001), 2001

Improved Table Lookup Algorithms for Postscaled Division.
Proceedings of the 15th IEEE Symposium on Computer Arithmetic (Arith-15 2001), 2001

2000
An IEEE Compliant Floating-Point Adder that Conforms with the Pipelined Packet-Forwarding Paradigm.
IEEE Trans. Computers, 2000

Improving Goldschmidt Division, Square Root, and Square Root Reciprocal.
IEEE Trans. Computers, 2000

A Booth Multiplier Accepting Both a Redundant or a Non-Redundant Input with No Additional Delay.
Proceedings of the 12th IEEE International Conference on Application-Specific Systems, 2000

1999
Analysis of Reciprocal and Square Root Reciprocal Instructions in the AMD K6-2 Implementation of 3DNow!
Electron. Notes Theor. Comput. Sci., 1999

Preface.
Electron. Notes Theor. Comput. Sci., 1999

Performance Analysis of a Graph Model for Channel Assignment in a Cellular Network.
Proceedings of the 23rd International Computer Software and Applications Conference (COMPSAC '99), 1999

On Infinitely Precise Rounding for Division, Square Root, Reciprocal and Square Root Reciprocal.
Proceedings of the 14th IEEE Symposium on Computer Arithmetic (Arith-14 '99), 1999

1998
Symmetric Cellular Network Embeddings on a Torus.
Proceedings of the International Conference On Computer Communications and Networks (ICCCN 1998), 1998

1997
Validated Roundings of Dot Products by Sticky Accumulation.
IEEE Trans. Computers, 1997

Faithful Interpolation in Reciprocal Tables.
Proceedings of the 13th Symposium on Computer Arithmetic (ARITH-13 '97), 1997

Pipelined Packet-Forwarding Floating Point: II. An Adder.
Proceedings of the 13th Symposium on Computer Arithmetic (ARITH-13 '97), 1997

Pipelined Packet-Forwarding Floating Point: I. Foundations and a Rounder.
Proceedings of the 13th Symposium on Computer Arithmetic (ARITH-13 '97), 1997

1995
LCF: A Lexicagraphic Binary representation of the Rationals.
J. Univers. Comput. Sci., 1995

Faithful Bipartite ROM Reciprocal Tables.
Proceedings of the 12th Symposium on Computer Arithmetic (ARITH-12 '95), 1995

Redundant Binary Booth Recoding.
Proceedings of the 12th Symposium on Computer Arithmetic (ARITH-12 '95), 1995

1994
Measuring the Accuracy of ROM Reciprocal Tables.
IEEE Trans. Computers, 1994

1993
A Linear Time 2+epsilon Approximation Algorithm for Edge Connectivity.
Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993

Partitioning by Maximum Adjacency Search of Graphs.
Proceedings of the Partitioning Data Sets, Proceedings of a DIMACS Workshop, 1993

Design of a fast validated dot product operation.
Proceedings of the 11th Symposium on Computer Arithmetic, 29 June, 1993

A 17 × 69 bit multiply and add unit with redundant binary feedback and single cycle latency.
Proceedings of the 11th Symposium on Computer Arithmetic, 29 June, 1993

1991
A redundant binary Euclidean GCD algorithm.
Proceedings of the 10th IEEE Symposium on Computer Arithmetic, 1991

Semantics for exact floating point operations.
Proceedings of the 10th IEEE Symposium on Computer Arithmetic, 1991

1990
The Maximum Concurrent Flow Problem
J. ACM, April, 1990

An Algorithm for Redundant Binary Bit-Pipelined Rational Arithmetic.
IEEE Trans. Computers, 1990

Sparsest cuts and bottlenecks in graphs.
Discret. Appl. Math., 1990

Design of a highly parallel IEEE standard floating point unit: the Cyrix 83D87 coprocessor.
Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing, 1990

1989
Exploiting redundancy in bit-pipelined rational arithmetic.
Proceedings of the 9th Symposium on Computer Arithmetic, 1989

1988
An On-Line Arithmetic Unit for Bit-Pipelined Rational Arithmetic.
J. Parallel Distributed Comput., 1988

1987
Expose-and-merge exploration and the chromatic number of random graph.
Comb., 1987

Determining Edge Connectivity in O(nm)
Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

A bit-serial arithmetic unit for rational arithmetic.
Proceedings of the 8th IEEE Symposium on Computer Arithmetic, 1987

On solving large maximum concurrent flow problems.
Proceedings of the 15th ACM Annual Conference on Computer Science, 1987

1986
Two Flow Routing Algorithms for the Maximum Concurrent-Flow Problem.
Proceedings of the Fall Joint Computer Conference, November 2-6, 1986, Dallas, Texas, USA, 1986

1985
Finite Precision Rational Arithmetic Slash Number Systems.
IEEE Trans. Computers, 1985

Finite precision lexicographic continued fraction number systems.
Proceedings of the 7th IEEE Symposium on Computer Arithmetic, 1985

1983
Smallest-Last Ordering and clustering and Graph Coloring Algorithms
J. ACM, July, 1983

Finite Precision Rational Arithmetic: An Arithmetic Unit.
IEEE Trans. Computers, 1983

Ramsey theory for graph connectivity.
J. Graph Theory, 1983

An order preserving finite binary encoding of the rationals.
Proceedings of the 6th IEEE Symposium on Computer Arithmetic, 1983

1982
Basic digit sets for radix representation.
J. ACM, 1982

1981
An integrated rational arithmetic unit.
Proceedings of the 5th IEEE Symposium on Computer Arithmetic, 1981

1979
An approximate rational arithmetic system with intrinsic recovery of simple fractions during expression evaluation.
Proceedings of the Symbolic and Algebraic Computation, 1979

1978
k-Blocks and ultrablocks in graphs.
J. Comb. Theory, Ser. B, 1978

A feasibility analysis of binary fixed-slash and floating-slash number systems.
Proceedings of the 4th IEEE Symposium on Computer Arithmetic, 1978

Basic digit sets for radix representation of the integers.
Proceedings of the 4th IEEE Symposium on Computer Arithmetic, 1978

A feasibility analysis of fixed-slash rational arithmetic.
Proceedings of the 4th IEEE Symposium on Computer Arithmetic, 1978

1975
Fixed-slash and floating-slash rational arithmetic.
Proceedings of the 3rd IEEE Symposium on Computer Arithmetic, 1975

Base conversion in residue number systems.
Proceedings of the 3rd IEEE Symposium on Computer Arithmetic, 1975

1973
A Simulative Study of Correlated Error Propagation in Various Finite-Precision Arithmetics.
IEEE Trans. Computers, 1973

1972
Bounded color functions on graphs.
Networks, 1972

Foundations of finite precision arithmetic.
Proceedings of the 2nd IEEE Symposium on Computer Arithmetic, 1972

A simulative study of correlated error propagation in various finite arithmetics.
Proceedings of the 2nd IEEE Symposium on Computer Arithmetic, 1972

1971
Significant Digits: Numerical Analysis or Numerology.
Proceedings of the Information Processing, Proceedings of IFIP Congress 1971, Volume 2, 1971

1970
A Formalization of Floating-Point Numeric Base Conversion.
IEEE Trans. Computers, 1970

Course and program descriptions.
ACM SIGCSE Bull., 1970

The emergence of computational arithmetic as a component of the computer science curriculum.
Proceedings of the 1st SIGCSE Technical Symposium on Computer Science Education, 1970

1969
A term project given in the basic computer science course at Washington University.
ACM SIGCSE Bull., 1969

Towards an abstract mathematical theory of floating-point arithmetic.
Proceedings of the American Federation of Information Processing Societies: AFIPS Conference Proceedings: 1969 Spring Joint Computer Conference, 1969

1968
In-and-out conversions.
Commun. ACM, 1968

1967
Base conversion mappings.
Proceedings of the American Federation of Information Processing Societies: Proceedings of the AFIPS '67 Spring Joint Computer Conference, 1967


  Loading...