On non-erasing oracle tapes in space bounded reducibility. - Bruce E. Litow; Ivan Hal Sudborough (SIGACT News, 1978)

On Efficient Deterministic Simulation of Turing Machine Computations Below Logspace. - Bruce E. Litow (Math. Syst. Theory, 1985)

Distributed algorithms for load balancing in very large homogeneous systems. - Seyed H. Hosseini; Bruce E. Litow; M. I. Malkawi; K. Vairavan (FJCC, 1987)

O(log(n)) Parallel Time Finite Field Inversion. - Bruce E. Litow; George I. Davida (AWOC, 1988)

Analysis of a Graph Coloring Based Distributed Load Balancing Algorithm. - Seyed H. Hosseini; Bruce E. Litow; M. I. Malkawi; J. McPherson; K. Vairavan (J. Parallel Distributed Comput., 1990)

Parallel Complexity of the Regular Code Problem - Bruce E. Litow (Inf. Comput., 1990)

Fast Parallel Arithmetic via Modular Representation. - George I. Davida; Bruce E. Litow (SIAM J. Comput., 1991)

On Iterated Integer Product. - Bruce E. Litow (Inf. Process. Lett., 1992)

On Rat∔. - Bruce E. Litow (SIGACT News, 1992)

Additive Cellular Automata and Algebraic Series. - Bruce E. Litow; Philippe Dumas 001 (Theor. Comput. Sci., 1993)

A Context-Free Language Decision Problem. - Bruce E. Litow (Theor. Comput. Sci., 1994)

The Influence of Graph Structure on Generalized Dimension Exchange. - Bruce E. Litow (Inf. Process. Lett., 1995)

Performance Characteristics of a Load Balancing Algorithm. - Bruce E. Litow; S. Hossein Hosseini; K. Vairavan; Gregory S. Wolffe (J. Parallel Distributed Comput., 1995)

Bounded Length UCFG Equivalence. - Bruce E. Litow (ISAAC, 1996)

A Decision Method for the Rational Sequence Problem - Bruce E. Litow (Electron. Colloquium Comput. Complex., 1997)

Parallel complexity of integer coprimality - Bruce E. Litow (Electron. Colloquium Comput. Complex., 1998)

A Note on the Ádám Conjecture for Double Loops. - Bruce E. Litow; Bernard Mans (Inf. Process. Lett., 1998)

Similarity Enrichment in Image Compression through Weighted Finite Automata. - Zhuhan Jiang; Bruce E. Litow; Olivier Y. de Vel (COCOON, 2000)

Forbidden pairs combinatorics. - Bruce E. Litow; Narsingh Deo (Australas. J Comb., 2000)

Why Step When You Can Run? Iterative Line Digitization Algorithms Based On Hierarchies Of Runs. - Peter Stephenson; Bruce E. Litow (IEEE Computer Graphics and Applications, 2000)

On Hadamard square roots of unity. - Bruce E. Litow (Theor. Comput. Sci., 2000)

An Inference Implementation Based on Extended Weighted Finite Automata. - Zhuhan Jiang; Bruce E. Litow; Olivier Y. de Vel (ACSC, 2001)

Making the DDA Run: Two-Dimensional Ray Traversal Using Runs and Runs of Runs. - Peter Stephenson; Bruce E. Litow (ACSC, 2001)

Running the line: Line drawing using runs and runs of runs. - Peter Stephenson; Bruce E. Litow (Comput. Graph., 2001)

Computing a Context-Free Grammar-Generating Series. - Bruce E. Litow (Inf. Comput., 2001)

Division in logspace-uniform NC1. - Andrew Chiu; George I. Davida; Bruce E. Litow (RAIRO Theor. Informatics Appl., 2001)

Polynomial equation elimination via Tarski Algebra - Bruce E. Litow (Electron. Colloquium Comput. Complex., 2003)

Inequality of finite behaviors of rational weight finite automata is in R. - Bruce E. Litow (Inf. Process. Lett., 2003)

A note on commutative multivariate rational series. - Bruce E. Litow (Inf. Process. Lett., 2003)

The Hamiltonian circuit problem and automaton theory. - Bruce E. Litow (SIGACT News, 2003)

Unification and extension of weighted finite automata applicable to image compression. - Zhuhan Jiang; Olivier Y. de Vel; Bruce E. Litow (Theor. Comput. Sci., 2003)

Graph compression and the zeros of polynomials. - Bruce E. Litow; Narsingh Deo (Inf. Process. Lett., 2004)

Modified SIMPSON O(n3) algorithm for the full sibship reconstruction problem. - Dmitry A. Konovalov; Nigel Bajema; Bruce E. Litow (Bioinform., 2005)

Partition-distance via the assignment problem. - Dmitry A. Konovalov; Bruce E. Litow; Nigel Bajema (Bioinform., 2005)

A Special Case of a Unary Regular Language Containment. - Bruce E. Litow (Theory Comput. Syst., 2006)

Census algorithms for chinese remainder pseudorank. - David Laing; Bruce E. Litow (RAIRO Theor. Informatics Appl., 2008)

Phenotype space and kinship assignment for the simpson index. - Bruce E. Litow; Dmitry A. Konovalov (RAIRO Theor. Informatics Appl., 2008)

Fast arithmetics using Chinese remaindering. - George I. Davida; Bruce E. Litow; Guangwu Xu (Inf. Process. Lett., 2009)

On Sums of Roots of Unity. - Bruce E. Litow (ICALP (1), 2010)

A transfer method from bounded existential Diophantine equations to Tarski algebra formulas. - Bruce E. Litow (Theor. Comput. Sci., 2018)

Existential Diophantine definability of string length. - Bruce E. Litow (Theor. Comput. Sci., 2019)