Search the dblp DataBase
Bruce E. Litow: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Zhuhan Jiang, Bruce E. Litow, Olivier Y. de Vel
An Inference Implementation Based on Extended Weighted Finite Automata. [Citation Graph (0, 0)][DBLP]
ACSC, 2001, pp:100-108 [Conf] - Peter Stephenson, Bruce E. Litow
Making the DDA Run: Two-Dimensional Ray Traversal Using Runs and Runs of Runs. [Citation Graph (0, 0)][DBLP]
ACSC, 2001, pp:177-183 [Conf] - Bruce E. Litow, George I. Davida
O(log(n)) Parallel Time Finite Field Inversion. [Citation Graph (0, 0)][DBLP]
AWOC, 1988, pp:74-80 [Conf] - Zhuhan Jiang, Bruce E. Litow, Olivier Y. de Vel
Similarity Enrichment in Image Compression through Weighted Finite Automata. [Citation Graph (0, 0)][DBLP]
COCOON, 2000, pp:447-456 [Conf] - Bruce E. Litow
Bounded Length UCFG Equivalence. [Citation Graph (0, 0)][DBLP]
ISAAC, 1996, pp:239-246 [Conf] - Dmitry A. Konovalov, Nigel Bajema, Bruce E. Litow
Modified SIMPSON O(n3) algorithm for the full sibship reconstruction problem. [Citation Graph (0, 0)][DBLP]
Bioinformatics, 2005, v:21, n:20, pp:3912-3917 [Journal] - Dmitry A. Konovalov, Bruce E. Litow, Nigel Bajema
Partition-distance via the assignment problem. [Citation Graph (0, 0)][DBLP]
Bioinformatics, 2005, v:21, n:10, pp:2463-2468 [Journal] - Peter Stephenson, Bruce E. Litow
Running the line: Line drawing using runs and runs of runs. [Citation Graph (0, 0)][DBLP]
Computers & Graphics, 2001, v:25, n:4, pp:681-690 [Journal] - Peter Stephenson, Bruce E. Litow
Why Step When You Can Run? Iterative Line Digitization Algorithms Based On Hierarchies Of Runs. [Citation Graph (0, 0)][DBLP]
IEEE Computer Graphics and Applications, 2000, v:20, n:6, pp:76-84 [Journal] - Bruce E. Litow
Polynomial equation elimination via Tarski Algebra [Citation Graph (0, 0)][DBLP]
Electronic Colloquium on Computational Complexity (ECCC), 2003, v:10, n:036, pp:- [Journal] - Bruce E. Litow
A Decision Method for the Rational Sequence Problem [Citation Graph (0, 0)][DBLP]
Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:55, pp:- [Journal] - Bruce E. Litow
Parallel complexity of integer coprimality [Citation Graph (0, 0)][DBLP]
Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:9, pp:- [Journal] - Bruce E. Litow
Computing a Context-Free Grammar-Generating Series. [Citation Graph (0, 0)][DBLP]
Inf. Comput., 2001, v:169, n:2, pp:174-185 [Journal] - Bruce E. Litow
Parallel Complexity of the Regular Code Problem [Citation Graph (0, 0)][DBLP]
Inf. Comput., 1990, v:86, n:1, pp:107-114 [Journal] - Bruce E. Litow
Inequality of finite behaviors of rational weight finite automata is in R. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2003, v:87, n:3, pp:139-145 [Journal] - Bruce E. Litow
A note on commutative multivariate rational series. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2003, v:87, n:6, pp:283-285 [Journal] - Bruce E. Litow
On Iterated Integer Product. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1992, v:42, n:5, pp:269-272 [Journal] - Bruce E. Litow
The Influence of Graph Structure on Generalized Dimension Exchange. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1995, v:54, n:6, pp:347-353 [Journal] - Bruce E. Litow, Narsingh Deo
Graph compression and the zeros of polynomials. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2004, v:92, n:1, pp:39-44 [Journal] - Bruce E. Litow, Bernard Mans
A Note on the Ádám Conjecture for Double Loops. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1998, v:66, n:3, pp:149-153 [Journal] - Andrew Chiu, George I. Davida, Bruce E. Litow
Division in logspace-uniform NC1. [Citation Graph (0, 0)][DBLP]
ITA, 2001, v:35, n:3, pp:259-275 [Journal] - Seyed H. Hosseini, Bruce E. Litow, M. Malkawi, J. McPherson, K. Vairavan
Analysis of a Graph Coloring Based Distributed Load Balancing Algorithm. [Citation Graph (0, 0)][DBLP]
J. Parallel Distrib. Comput., 1990, v:10, n:2, pp:160-166 [Journal] - Bruce E. Litow, S. Hossein Hosseini, K. Vairavan, Gregory S. Wolffe
Performance Characteristics of a Load Balancing Algorithm. [Citation Graph (0, 0)][DBLP]
J. Parallel Distrib. Comput., 1995, v:31, n:2, pp:159-165 [Journal] - Bruce E. Litow
On Efficient Deterministic Simulation of Turing Machine Computations Below Logspace. [Citation Graph (0, 0)][DBLP]
Mathematical Systems Theory, 1985, v:18, n:1, pp:11-18 [Journal] - George I. Davida, Bruce E. Litow
Fast Parallel Arithmetic via Modular Representation. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 1991, v:20, n:4, pp:756-765 [Journal] - Zhuhan Jiang, Olivier Y. de Vel, Bruce E. Litow
Unification and extension of weighted finite automata applicable to image compression. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2003, v:302, n:1-3, pp:275-294 [Journal] - Bruce E. Litow
On Hadamard square roots of unity. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2000, v:237, n:1-2, pp:447-454 [Journal] - Bruce E. Litow
A Context-Free Language Decision Problem. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1994, v:125, n:2, pp:339-343 [Journal] - Bruce E. Litow, Philippe Dumas
Additive Cellular Automata and Algebraic Series. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1993, v:119, n:2, pp:345-354 [Journal] - Bruce E. Litow
A Special Case of a Unary Regular Language Containment. [Citation Graph (0, 0)][DBLP]
Theory Comput. Syst., 2006, v:39, n:5, pp:743-751 [Journal]
On Sums of Roots of Unity. [Citation Graph (, )][DBLP]
Fast Arithmetics Using Chinese Remaindering [Citation Graph (, )][DBLP]
Search in 0.030secs, Finished in 0.031secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002