David W. Matula - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 100 from 100

2020

Bounds on maximum concurrent flow in random bipartite graphsFernando E. Vilas, Eli V. Olinick, David W. Matula. ol, 14(8):2197-2209, 2020. [doi]

2019

Precise and Concise Graphical Representation of the Natural NumbersDavid W. Matula, Zizhen Chen. arith 2019: 100-103 [doi]

Metrics Matter in Community DetectionArya D. McCarthy, Tongfei Chen, Rachel Rudinger, David W. Matula. complexnetworks 2020: 164-175 [doi]

2017

Bipartite Grid Partitioning of a Random Geometric GraphZizhen Chen, David W. Matula. dcoss 2017: 163-169 [doi]

2015

A compact linear programming formulation of the maximum concurrent flow problemYuanyuan Dong, Eli V. Olinick, T. Jason Kratz, David W. Matula. networks, 65(1):68-87, 2015. [doi]

Multiplicative Division Employing Independent FactorsDavid W. Matula, Mihai T. Panu, Jonathan Y. Zhang. TC, 64(7):2012-2019, 2015. [doi]

2013

Low power floating-point multiplication and squaring units with shared circuitryJason Moore, Mitchell A. Thornton, David W. Matula. mwscas 2013: 1395-1398 [doi]

2012

Constructing efficient rotating backbones in wireless sensor networks using graph coloringDhia Mahjoub, David W. Matula. comcom, 35(9):1086-1097, 2012. [doi]

2011

A Prescale-Lookup-Postscale Additive Procedure for Obtaining a Single Precision Ulp Accurate ReciprocalDavid W. Matula, Mihai T. Panu. arith 2011: 177-183 [doi]

2010

Building (1 - ::::epsilon::::) Dominating Sets Partition as Backbones in Wireless Sensor Networks Using Distributed Graph ColoringDhia Mahjoub, David W. Matula. dcoss 2010: 144-157 [doi]

Employing (1 - epsilon) Dominating Set Partitions as Backbones in Wireless Sensor NetworksDhia Mahjoub, David W. Matula. alenex 2010: 98-111 [doi]

Approximating the independent domatic partition problem in random geometric graphs - an experimental studyDhia Mahjoub, Angelika Leskovskaya, David W. Matula. cccg 2010: 195-198 [doi]

2009

2008

2006

Performance Evaluation of a Novel Direct Table Lookup Method and Architecture with Application to 16-bit Integer FunctionsLun Li, Alex Fit-Florea, Mitchell A. Thornton, David W. Matula. asap 2006: 99-104 [doi]

A digit serial algorithm for the integer power operationLun Li, Mitchell A. Thornton, David W. Matula. glvlsi 2006: 302-307 [doi]

A formal model and efficient traversal algorithm for generating testbenches for verification of IEEE standard floating point divisionDavid W. Matula, Lee D. McFearin. date 2006: 1134-1138 [doi]

2005

2004

A Digit-Serial Algorithm for the Discrete Logarithm Modulo 2:::k:::Alex Fit-Florea, David W. Matula. asap 2004: 236-246 [doi]

2003

Further Reducing the Redundancy of a Notation Over a Minimally Redundant Digit SetMarc Daumas, David W. Matula. vlsisp, 33(1-2):7-18, 2003. [doi]

Prescaled Integer DivisionDavid W. Matula, Alex Fit-Florea. arith 2003: 63 [doi]

Computer Arithmetic - An Algorithm Engineer?s PerspectiveDavid W. Matula. arith 2003: 2 [doi]

A p×p bit fraction model of binary floating point division and extremal rounding casesDavid W. Matula, Lee D. McFearin. TCS, 291(2):159-182, 2003.

2002

Regular Triangulated Toroidal Graphs with Applications to Cellular and Interconnection NetworksMihaela Iridon, David W. Matula. jgaa, 6(4):373-404, 2002. [doi]

Evaluating Products of Non Linear Functions by Indirect Bipartite Table LookupDavid W. Matula, Alex Fit-Florea, Lee D. McFearin. asap 2002: 120-129 [doi]

2001

2000

1999

1998

Symmetric Cellular Network Embeddings on a TorusMihaela Iridon, David W. Matula. icccn 1998: 732-736 [doi]

1997

1995

LCF: A Lexicagraphic Binary representation of the RationalsPeter Kornerup, David W. Matula. jucs, 1(7):484-503, 1995. [doi]

Redundant Binary Booth RecodingChung Nan Lyu, David W. Matula. arith 1995: 50 [doi]

Faithful Bipartite ROM Reciprocal TablesDebjit Das Sarma, David W. Matula. arith 1995: 17 [doi]

1994

Measuring the Accuracy of ROM Reciprocal TablesDebjit Das Sarma, David W. Matula. TC, 43(8):932-940, 1994.

1993

1991

Semantics for exact floating point operationsGerd Bohlender, Wolfgang Walter, Peter Kornerup, David W. Matula. arith 1991: 22-26 [doi]

A redundant binary Euclidean GCD algorithmShrikant N. Parikh, David W. Matula. arith 1991: 220-225 [doi]

1990

An Algorithm for Redundant Binary Bit-Pipelined Rational ArithmeticPeter Kornerup, David W. Matula. TC, 39(8):1106-1115, 1990.

Sparsest cuts and bottlenecks in graphsDavid W. Matula, Farhad Shahrokhi. DAM, 27(1-2):113-123, 1990. [doi]

Design of a highly parallel IEEE standard floating point unit: the Cyrix 83D87 coprocessorDavid W. Matula. spdp 1990: 334 [doi]

The Maximum Concurrent Flow ProblemFarhad Shahrokhi, David W. Matula. JACM, 37(2):318-334, April 1990. [doi]

1989

Exploiting redundancy in bit-pipelined rational arithmeticPeter Kornerup, David W. Matula. arith 1989: 119-126 [doi]

1988

An On-Line Arithmetic Unit for Bit-Pipelined Rational ArithmeticPeter Kornerup, David W. Matula. jpdc, 5(3):310-330, 1988.

1987

A bit-serial arithmetic unit for rational arithmeticPeter Kornerup, David W. Matula. arith 1987: 204-211 [doi]

Determining Edge Connectivity in O(nm)David W. Matula. focs 1987: 249-251

Expose-and-merge exploration and the chromatic number of random graphDavid W. Matula. combinatorica, 7(3):275-284, 1987.

On solving large maximum concurrent flow problemsFarhad Shahrokhi, David W. Matula. acm 1987: 205-209 [doi]

1986

Two Flow Routing Algorithms for the Maximum Concurrent-Flow ProblemJit Biswas, David W. Matula. fjcc 1986: 629-636

1985

Finite precision lexicographic continued fraction number systemsPeter Kornerup, David W. Matula. arith 1985: 207-213 [doi]

Finite Precision Rational Arithmetic Slash Number SystemsDavid W. Matula, Peter Kornerup. TC, 34(1):3-18, 1985.

1983

Finite Precision Rational Arithmetic: An Arithmetic UnitPeter Kornerup, David W. Matula. TC, 32(4):378-388, 1983.

Smallest-Last Ordering and clustering and Graph Coloring AlgorithmsDavid W. Matula, Leland L. Beck. JACM, 30(3):417-427, July 1983. [doi]

An order preserving finite binary encoding of the rationalsDavid W. Matula, Peter Kornerup. arith 1983: 201-209 [doi]

Ramsey theory for graph connectivityDavid W. Matula. jgt, 7(1):95-103, 1983. [doi]

1982

Basic digit sets for radix representationDavid W. Matula. JACM, 29(4):1131-1143, 1982. [doi]

1981

An integrated rational arithmetic unitPeter Kornerup, David W. Matula. arith 1981: 233-240 [doi]

1979

An approximate rational arithmetic system with intrinsic recovery of simple fractions during expression evaluationDavid W. Matula, Peter Kornerup. eurosam 1979: 383-397

1978

A feasibility analysis of fixed-slash rational arithmeticPeter Kornerup, David W. Matula. arith 1978: 39-47 [doi]

k-Blocks and ultrablocks in graphsDavid W. Matula. JCT, 24(1):1-13, 1978. [doi]

A feasibility analysis of binary fixed-slash and floating-slash number systemsDavid W. Matula, Peter Kornerup. arith 1978: 29-38 [doi]

Basic digit sets for radix representation of the integersDavid W. Matula. arith 1978: 1-9 [doi]

1975

Base conversion in residue number systemsRobert T. Gregory, David W. Matula. arith 1975: 117-125 [doi]

Fixed-slash and floating-slash rational arithmeticDavid W. Matula. arith 1975: 90-91 [doi]

1973

A Simulative Study of Correlated Error Propagation in Various Finite-Precision ArithmeticsJohn D. Marasa, David W. Matula. TC, 22(6):587-597, 1973. [doi]

1972

A simulative study of correlated error propagation in various finite arithmeticsJohn D. Marasa, David W. Matula. arith 1972: 1-44 [doi]

Bounded color functions on graphsDavid W. Matula. networks, 2(1):29-44, 1972. [doi]

1971

Significant Digits: Numerical Analysis or NumerologyDavid W. Matula. ifip 1971: 1278-1283

1970

A Formalization of Floating-Point Numeric Base ConversionDavid W. Matula. TC, 19(8):681-692, 1970. [doi]

Course and program descriptionsDavid W. Matula. SIGCSE, 2(1):12-15, 1970. [doi]

The emergence of computational arithmetic as a component of the computer science curriculumDavid W. Matula. sigcse 1970: 41-44 [doi]

1969

Towards an abstract mathematical theory of floating-point arithmeticDavid W. Matula. afips 1968: 765-772 [doi]

A term project given in the basic computer science course at Washington UniversityDavid W. Matula. SIGCSE, 1(4):16-19, 1969. [doi]

1968

In-and-out conversionsDavid W. Matula. CACM, 11(1):47-50, 1968. [doi]

1967

Base conversion mappingsDavid W. Matula. afips 1968: 311-318 [doi]

Sign in or sign up to see more results.

runs on WebDSL