Bruce E. Litow

According to our database1, Bruce E. Litow authored at least 41 papers between 1978 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
Existential Diophantine definability of string length.
Theor. Comput. Sci., 2019

2018
A transfer method from bounded existential Diophantine equations to Tarski algebra formulas.
Theor. Comput. Sci., 2018

2010
On Sums of Roots of Unity.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009
Fast arithmetics using Chinese remaindering.
Inf. Process. Lett., 2009

2008
Phenotype space and kinship assignment for the simpson index.
RAIRO Theor. Informatics Appl., 2008

Census algorithms for chinese remainder pseudorank.
RAIRO Theor. Informatics Appl., 2008

2006
A Special Case of a Unary Regular Language Containment.
Theory Comput. Syst., 2006

2005
Partition-distance via the assignment problem.
Bioinform., 2005

Modified SIMPSON <i>O</i>(<i>n</i><sup>3</sup>) algorithm for the full sibship reconstruction problem.
Bioinform., 2005

2004
Graph compression and the zeros of polynomials.
Inf. Process. Lett., 2004

2003
Unification and extension of weighted finite automata applicable to image compression.
Theor. Comput. Sci., 2003

The Hamiltonian circuit problem and automaton theory.
SIGACT News, 2003

A note on commutative multivariate rational series.
Inf. Process. Lett., 2003

Inequality of finite behaviors of rational weight finite automata is in R.
Inf. Process. Lett., 2003

Polynomial equation elimination via Tarski Algebra
Electron. Colloquium Comput. Complex., 2003

2001
Division in logspace-uniform <i>NC</i><sup>1</sup>.
RAIRO Theor. Informatics Appl., 2001

Computing a Context-Free Grammar-Generating Series.
Inf. Comput., 2001

Running the line: Line drawing using runs and runs of runs.
Comput. Graph., 2001

Making the DDA Run: Two-Dimensional Ray Traversal Using Runs and Runs of Runs.
Proceedings of the 24th Australasian Computer Science Conference (ACSC 2001), 29 January, 2001

An Inference Implementation Based on Extended Weighted Finite Automata.
Proceedings of the 24th Australasian Computer Science Conference (ACSC 2001), 29 January, 2001

2000
On Hadamard square roots of unity.
Theor. Comput. Sci., 2000

Why Step When You Can Run? Iterative Line Digitization Algorithms Based On Hierarchies Of Runs.
IEEE Computer Graphics and Applications, 2000

Forbidden pairs combinatorics.
Australas. J Comb., 2000

Similarity Enrichment in Image Compression through Weighted Finite Automata.
Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

1998
A Note on the Ádám Conjecture for Double Loops.
Inf. Process. Lett., 1998

Parallel complexity of integer coprimality
Electron. Colloquium Comput. Complex., 1998

1997
A Decision Method for the Rational Sequence Problem
Electron. Colloquium Comput. Complex., 1997

1996
Bounded Length UCFG Equivalence.
Proceedings of the Algorithms and Computation, 7th International Symposium, 1996

1995
Performance Characteristics of a Load Balancing Algorithm.
J. Parallel Distributed Comput., 1995

The Influence of Graph Structure on Generalized Dimension Exchange.
Inf. Process. Lett., 1995

1994
A Context-Free Language Decision Problem.
Theor. Comput. Sci., 1994

1993
Additive Cellular Automata and Algebraic Series.
Theor. Comput. Sci., 1993

1992
On Rat<sub>∔</sub>.
SIGACT News, 1992

On Iterated Integer Product.
Inf. Process. Lett., 1992

1991
Fast Parallel Arithmetic via Modular Representation.
SIAM J. Comput., 1991

1990
Parallel Complexity of the Regular Code Problem
Inf. Comput., May, 1990

Analysis of a Graph Coloring Based Distributed Load Balancing Algorithm.
J. Parallel Distributed Comput., 1990

1988
O(log(n)) Parallel Time Finite Field Inversion.
Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

1987
Distributed algorithms for load balancing in very large homogeneous systems.
Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow, 1987

1985
On Efficient Deterministic Simulation of Turing Machine Computations Below Logspace.
Math. Syst. Theory, 1985

1978
On non-erasing oracle tapes in space bounded reducibility.
SIGACT News, 1978


  Loading...