default search action
David W. Matula
Person information
- affiliation: Southern Methodist University, Dallas, Texas, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2020
- [j33]Fernando E. Vilas
, Eli V. Olinick, David W. Matula:
Bounds on maximum concurrent flow in random bipartite graphs. Optim. Lett. 14(8): 2197-2209 (2020)
2010 – 2019
- 2019
- [c68]David W. Matula, Zizhen Chen:
Precise and Concise Graphical Representation of the Natural Numbers. ARITH 2019: 100-103 - [c67]Arya D. McCarthy, Tongfei Chen, Rachel Rudinger, David W. Matula:
Metrics Matter in Community Detection. COMPLEX NETWORKS (1) 2019: 164-175 - [i1]Arya D. McCarthy, Tongfei Chen, Rachel Rudinger, David W. Matula:
Metrics matter in community detection. CoRR abs/1901.01354 (2019) - 2017
- [c66]Zizhen Chen, David W. Matula:
Bipartite Grid Partitioning of a Random Geometric Graph. DCOSS 2017: 163-169 - 2015
- [j32]Yuanyuan Dong
A compact linear programming formulation of the maximum concurrent flow problem. Networks 65(1): 68-87 (2015) - [j31]David W. Matula, Mihai T. Panu, Jonathan Y. Zhang:
Multiplicative Division Employing Independent Factors. IEEE Trans. Computers 64(7): 2012-2019 (2015) - 2013
- [c65]Jason Moore, Mitchell A. Thornton
Low power floating-point multiplication and squaring units with shared circuitry. MWSCAS 2013: 1395-1398 - 2012
- [j30]Dhia Mahjoub, David W. Matula:
Constructing efficient rotating backbones in wireless sensor networks using graph coloring. Comput. Commun. 35(9): 1086-1097 (2012) - 2011
- [c64]David W. Matula, Mihai T. Panu:
A Prescale-Lookup-Postscale Additive Procedure for Obtaining a Single Precision Ulp Accurate Reciprocal. IEEE Symposium on Computer Arithmetic 2011: 177-183 - 2010
- [c63]Dhia Mahjoub, David W. Matula:
Employing (1 - epsilon) Dominating Set Partitions as Backbones in Wireless Sensor Networks. ALENEX 2010: 98-111 - [c62]Dhia Mahjoub, Angelika Leskovskaya, David W. Matula:
Approximating the independent domatic partition problem in random geometric graphs - an experimental study. CCCG 2010: 195-198 - [c61]Dhia Mahjoub, David W. Matula:
Building (1 - epsilon) Dominating Sets Partition as Backbones in Wireless Sensor Networks Using Distributed Graph Coloring. DCOSS 2010: 144-157
2000 – 2009
- 2009
- [j29]Alex Fit-Florea, Lun Li, Mitchell A. Thornton
A Discrete Logarithm Number System for Integer Arithmetic Modulo 2k: Algorithms and Lookup Structures. IEEE Trans. Computers 58(2): 163-174 (2009) - [c60]David W. Matula:
Higher Radix Squaring Operations Employing Left-to-Right Dual Recoding. IEEE Symposium on Computer Arithmetic 2009: 39-47 - [c59]Satyendra R. Datla, Mitchell A. Thornton
A Low Power High Performance Radix-4 Approximate Squaring Circuit. ASAP 2009: 91-97 - [c58]Dhia Mahjoub, David W. Matula:
Experimental Study of Independent and Dominating Sets in Wireless Sensor Networks Using Graph Coloring Algorithms. WASA 2009: 32-42 - 2008
- [j28]Charles F. Mann, David W. Matula, Eli V. Olinick:
The use of sparsest cuts to reveal the hierarchical community structure of social networks. Soc. Networks 30(3): 223-234 (2008) - [c57]Jason Moore, Mitchell A. Thornton
A low power radix-4 dual recoded integer squaring implementation for use in design of application specific arithmetic circuits. ACSCC 2008: 1819-1822 - [c56]David W. Matula:
Foundations of Higher Radix Numeric Computation. ISMVL 2008: 124 - [c55]Mitchell A. Thornton
Quantum Logic Implementation of Unary Arithmetic Operations. ISMVL 2008: 202-207 - 2006
- [c54]Lun Li, Alex Fit-Florea, Mitchell A. Thornton
Performance Evaluation of a Novel Direct Table Lookup Method and Architecture with Application to 16-bit Integer Functions. ASAP 2006: 99-104 - [c53]David W. Matula, Lee D. McFearin:
A formal model and efficient traversal algorithm for generating testbenches for verification of IEEE standard floating point division. DATE 2006: 1134-1138 - [c52]Lun Li, Mitchell A. Thornton, David W. Matula:
A digit serial algorithm for the integer power operation. ACM Great Lakes Symposium on VLSI 2006: 302-307 - 2005
- [j27]Peter-Michael Seidel, Lee D. McFearin, David W. Matula:
Secondary Radix Recodings for Higher Radix Multipliers. IEEE Trans. Computers 54(2): 111-123 (2005) - [c51]Alex Fit-Florea, David W. Matula:
Determining all pairs edge connectivity of a 4-regular graph in O(|V|). AICCSA 2005: 15 - [c50]David W. Matula, Alex Fit-Florea, Mitchell Aaron Thornton:
Table Lookup Structures for Multiplicative Inverses Modulo 2k. IEEE Symposium on Computer Arithmetic 2005: 156-163 - [c49]Peter Kornerup, David W. Matula:
Single Precision Reciprocals by Multipartite Table Lookup. IEEE Symposium on Computer Arithmetic 2005: 240-248 - [c48]Lun Li, Alex Fit-Florea, Mitchell A. Thornton, David W. Matula:
Hardware Implementation of an Additive Bit-Serial Algorithm for the Discrete Logarithm Modulo 2k. ISVLSI 2005: 130-135 - 2004
- [c47]Alex Fit-Florea, David W. Matula:
A Digit-Serial Algorithm for the Discrete Logarithm Modulo 2k. ASAP 2004: 236-246 - 2003
- [j26]David W. Matula, Lee D. McFearin:
A p×p bit fraction model of binary floating point division and extremal rounding cases. Theor. Comput. Sci. 291(2): 159-182 (2003) - [j25]Marc Daumas
Further Reducing the Redundancy of a Notation Over a Minimally Redundant Digit Set. J. VLSI Signal Process. 33(1-2): 7-18 (2003) - [c46]David W. Matula:
Computer Arithmetic - An Algorithm Engineer's Perspective. IEEE Symposium on Computer Arithmetic 2003: 2- - [c45]David W. Matula, Alex Fit-Florea:
Prescaled Integer Division. IEEE Symposium on Computer Arithmetic 2003: 63- - 2002
- [j24]Mihaela Iridon, David W. Matula:
Regular Triangulated Toroidal Graphs with Applications to Cellular and Interconnection Networks. J. Graph Algorithms Appl. 6(4): 373-404 (2002) - [c44]David W. Matula, Alex Fit-Florea, Lee D. McFearin:
Evaluating Products of Non Linear Functions by Indirect Bipartite Table Lookup. ASAP 2002: 120-129 - 2001
- [j23]Mihaela Iridon, David W. Matula, Cheng Yang:
A Graph Theoretic Approach for Channel Assignment in Cellular Networks. Wirel. Networks 7(6): 567-574 (2001) - [c43]Peter-Michael Seidel, Lee D. McFearin, David W. Matula:
Binary Multiplication Radix-32 and Radix-256. IEEE Symposium on Computer Arithmetic 2001: 23-32 - [c42]David W. Matula:
Improved Table Lookup Algorithms for Postscaled Division. IEEE Symposium on Computer Arithmetic 2001: 101- - [c41]Lee D. McFearin, David W. Matula:
Generation and Analysis of Hard to Round Cases for Binary Floating Point Division. IEEE Symposium on Computer Arithmetic 2001: 119-127 - [c40]Lee D. McFearin, David W. Matula:
Selecting A Well Distributed Hard Case Test Suite for IEEE Standard Floating Point Division. ICCD 2001: 89-97 - 2000
- [j22]Asger Munk Nielsen, David W. Matula, Chung Nan Lyu, Guy Even:
An IEEE Compliant Floating-Point Adder that Conforms with the Pipelined Packet-Forwarding Paradigm. IEEE Trans. Computers 49(1): 33-47 (2000) - [j21]Milos D. Ercegovac, Laurent Imbert, David W. Matula, Jean-Michel Muller
Improving Goldschmidt Division, Square Root, and Square Root Reciprocal. IEEE Trans. Computers 49(7): 759-763 (2000) - [c39]Marc Daumas, David W. Matula:
A Booth Multiplier Accepting Both a Redundant or a Non-Redundant Input with No Additional Delay. ASAP 2000: 205-214
1990 – 1999
- 1999
- [c38]Cristina Iordache, David W. Matula:
On Infinitely Precise Rounding for Division, Square Root, Reciprocal and Square Root Reciprocal. IEEE Symposium on Computer Arithmetic 1999: 233-240 - [c37]Hakki C. Cankaya, David W. Matula, Mihaela Iridon:
Performance Analysis of a Graph Model for Channel Assignment in a Cellular Network. COMPSAC 1999: 239-240 - [e2]Abbas Edalat, David W. Matula, Philipp Sünderhauf:
Workshop on Real Number Computation, RealComp 1998, Indianapolis, Indiana, USA, June 19-20, 1998. Electronic Notes in Theoretical Computer Science 24, Elsevier 1999 [contents] - 1998
- [c36]Mihaela Iridon, David W. Matula:
Symmetric Cellular Network Embeddings on a Torus. ICCCN 1998: 732-736 - [c35]Abbas Edalat, David W. Matula, Philipp Sünderhauf:
Preface. RealComp 1998: 1 - [c34]Cristina Iordache, David W. Matula:
Analysis of Reciprocal and Square Root Reciprocal Instructions in the AMD K6-2 Implementation of 3DNow! RealComp 1998: 34-62 - 1997
- [j20]Marc Daumas
Validated Roundings of Dot Products by Sticky Accumulation. IEEE Trans. Computers 46(5): 623-629 (1997) - [c33]Debjit Das Sarma, David W. Matula:
Faithful Interpolation in Reciprocal Tables. IEEE Symposium on Computer Arithmetic 1997: 82-91 - [c32]David W. Matula, Asger Munk Nielsen:
Pipelined Packet-Forwarding Floating Point: I. Foundations and a Rounder. IEEE Symposium on Computer Arithmetic 1997: 140-147 - [c31]Asger Munk Nielsen, David W. Matula, Chung Nan Lyu, Guy Even:
Pipelined Packet-Forwarding Floating Point: II. An Adder. IEEE Symposium on Computer Arithmetic 1997: 148-155 - 1995
- [j19]Peter Kornerup, David W. Matula:
LCF: A Lexicagraphic Binary representation of the Rationals. J. Univers. Comput. Sci. 1(7): 484-503 (1995) - [c30]Debjit Das Sarma, David W. Matula:
Faithful Bipartite ROM Reciprocal Tables. IEEE Symposium on Computer Arithmetic 1995: 17- - [c29]Chung Nan Lyu, David W. Matula:
Redundant Binary Booth Recoding. IEEE Symposium on Computer Arithmetic 1995: 50- - 1994
- [j18]Debjit Das Sarma, David W. Matula:
Measuring the Accuracy of ROM Reciprocal Tables. IEEE Trans. Computers 43(8): 932-940 (1994) - 1993
- [c28]Marc Daumas, David W. Matula:
Design of a fast validated dot product operation. IEEE Symposium on Computer Arithmetic 1993: 62-69 - [c27]Debjit Das Sarma, David W. Matula:
Measuring the accuracy of ROM reciprocal tables. IEEE Symposium on Computer Arithmetic 1993: 95-102 - [c26]W. S. Briggs, David W. Matula:
A 17 × 69 bit multiply and add unit with redundant binary feedback and single cycle latency. IEEE Symposium on Computer Arithmetic 1993: 163-170 - [c25]Weiqing Cai, David W. Matula:
Partitioning by Maximum Adjacency Search of Graphs. Partitioning Data Sets 1993: 55-63 - [c24]David W. Matula:
A Linear Time 2+epsilon Approximation Algorithm for Edge Connectivity. SODA 1993: 500-504 - 1991
- [c23]Gerd Bohlender, Wolfgang Walter, Peter Kornerup, David W. Matula:
Semantics for exact floating point operations. IEEE Symposium on Computer Arithmetic 1991: 22-26 - [c22]Shrikant N. Parikh, David W. Matula:
A redundant binary Euclidean GCD algorithm. IEEE Symposium on Computer Arithmetic 1991: 220-225 - 1990
- [j17]David W. Matula, Farhad Shahrokhi:
Sparsest cuts and bottlenecks in graphs. Discret. Appl. Math. 27(1-2): 113-123 (1990) - [j16]Farhad Shahrokhi, David W. Matula:
The Maximum Concurrent Flow Problem. J. ACM 37(2): 318-334 (1990) - [j15]Peter Kornerup, David W. Matula:
An Algorithm for Redundant Binary Bit-Pipelined Rational Arithmetic. IEEE Trans. Computers 39(8): 1106-1115 (1990) - [c21]David W. Matula:
Design of a highly parallel IEEE standard floating point unit: the Cyrix 83D87 coprocessor. SPDP 1990: 334
1980 – 1989
- 1989
- [c20]Peter Kornerup, David W. Matula:
Exploiting redundancy in bit-pipelined rational arithmetic. IEEE Symposium on Computer Arithmetic 1989: 119-126 - 1988
- [j14]Peter Kornerup, David W. Matula:
An On-Line Arithmetic Unit for Bit-Pipelined Rational Arithmetic. J. Parallel Distributed Comput. 5(3): 310-330 (1988) - 1987
- [j13]David W. Matula:
Expose-and-merge exploration and the chromatic number of random graph. Comb. 7(3): 275-284 (1987) - [c19]Farhad Shahrokhi, David W. Matula:
On solving large maximum concurrent flow problems. ACM Conference on Computer Science 1987: 205-209 - [c18]Peter Kornerup, David W. Matula:
A bit-serial arithmetic unit for rational arithmetic. IEEE Symposium on Computer Arithmetic 1987: 204-211 - [c17]David W. Matula:
Determining Edge Connectivity in O(nm). FOCS 1987: 249-251 - 1986
- [c16]Jit Biswas, David W. Matula:
Two Flow Routing Algorithms for the Maximum Concurrent-Flow Problem. FJCC 1986: 629-636 - 1985
- [j12]David W. Matula, Peter Kornerup:
Finite Precision Rational Arithmetic Slash Number Systems. IEEE Trans. Computers 34(1): 3-18 (1985) - [c15]Peter Kornerup, David W. Matula:
Finite precision lexicographic continued fraction number systems. IEEE Symposium on Computer Arithmetic 1985: 207-213 - 1983
- [j11]David W. Matula, Leland L. Beck:
Smallest-Last Ordering and clustering and Graph Coloring Algorithms. J. ACM 30(3): 417-427 (1983) - [j10]David W. Matula:
Ramsey theory for graph connectivity. J. Graph Theory 7(1): 95-103 (1983) - [j9]Peter Kornerup, David W. Matula:
Finite Precision Rational Arithmetic: An Arithmetic Unit. IEEE Trans. Computers 32(4): 378-388 (1983) - [c14]David W. Matula, Peter Kornerup:
An order preserving finite binary encoding of the rationals. IEEE Symposium on Computer Arithmetic 1983: 201-209 - 1982
- [j8]David W. Matula:
Basic digit sets for radix representation. J. ACM 29(4): 1131-1143 (1982) - 1981
- [c13]Peter Kornerup, David W. Matula:
An integrated rational arithmetic unit. IEEE Symposium on Computer Arithmetic 1981: 233-240
1970 – 1979
- 1979
- [c12]David W. Matula, Peter Kornerup:
An approximate rational arithmetic system with intrinsic recovery of simple fractions during expression evaluation. EUROSAM 1979: 383-397 - 1978
- [j7]David W. Matula:
k-Blocks and ultrablocks in graphs. J. Comb. Theory B 24(1): 1-13 (1978) - [c11]David W. Matula:
Basic digit sets for radix representation of the integers. IEEE Symposium on Computer Arithmetic 1978: 1-9 - [c10]David W. Matula, Peter Kornerup:
A feasibility analysis of binary fixed-slash and floating-slash number systems. IEEE Symposium on Computer Arithmetic 1978: 29-38 - [c9]Peter Kornerup, David W. Matula:
A feasibility analysis of fixed-slash rational arithmetic. IEEE Symposium on Computer Arithmetic 1978: 39-47 - 1975
- [c8]David W. Matula:
Fixed-slash and floating-slash rational arithmetic. IEEE Symposium on Computer Arithmetic 1975: 90-91 - [c7]Robert T. Gregory, David W. Matula:
Base conversion in residue number systems. IEEE Symposium on Computer Arithmetic 1975: 117-125 - [e1]T. R. N. Rao, David W. Matula:
3rd IEEE Symposium on Computer Arithmetic, ARITH 1975, Dallas, TX, USA, November 19-20, 1975. IEEE Computer Society 1975 [contents] - 1973
- [j6]John D. Marasa, David W. Matula:
A Simulative Study of Correlated Error Propagation in Various Finite-Precision Arithmetics. IEEE Trans. Computers 22(6): 587-597 (1973) - 1972
- [j5]David W. Matula:
Bounded color functions on graphs. Networks 2(1): 29-44 (1972) - [c6]John D. Marasa, David W. Matula:
A simulative study of correlated error propagation in various finite arithmetics. IEEE Symposium on Computer Arithmetic 1972: 1-44 - [c5]David W. Matula:
Foundations of finite precision arithmetic. IEEE Symposium on Computer Arithmetic 1972: 1-35 - 1971
- [c4]David W. Matula:
Significant Digits: Numerical Analysis or Numerology. IFIP Congress (2) 1971: 1278-1283 - 1970
- [j4]David W. Matula:
Course and program descriptions. ACM SIGCSE Bull. 2(1): 12-15 (1970) - [j3]David W. Matula:
A Formalization of Floating-Point Numeric Base Conversion. IEEE Trans. Computers 19(8): 681-692 (1970) - [c3]David W. Matula:
The emergence of computational arithmetic as a component of the computer science curriculum. SIGCSE 1970: 41-44
1960 – 1969
- 1969
- [j2]David W. Matula:
A term project given in the basic computer science course at Washington University. ACM SIGCSE Bull. 1(4): 16-19 (1969) - [c2]David W. Matula:
Towards an abstract mathematical theory of floating-point arithmetic. AFIPS Spring Joint Computing Conference 1969: 765-772 - 1968
- [j1]David W. Matula:
In-and-out conversions. Commun. ACM 11(1): 47-50 (1968) - 1967
- [c1]David W. Matula:
Base conversion mappings. AFIPS Spring Joint Computing Conference 1967: 311-318
Coauthor Index
Mitchell A. Thornton
aka: Mitchell Aaron Thornton
aka: Mitchell Aaron Thornton
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: