default search action
Bruce E. Litow
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j31]Bruce E. Litow:
Existential Diophantine definability of string length. Theor. Comput. Sci. 776: 114-116 (2019) - 2018
- [j30]Bruce E. Litow:
A transfer method from bounded existential Diophantine equations to Tarski algebra formulas. Theor. Comput. Sci. 708: 91-95 (2018) - 2010
- [c7]Bruce E. Litow:
On Sums of Roots of Unity. ICALP (1) 2010: 420-425
2000 – 2009
- 2009
- [j29]George I. Davida, Bruce E. Litow, Guangwu Xu:
Fast arithmetics using Chinese remaindering. Inf. Process. Lett. 109(13): 660-662 (2009) - 2008
- [j28]David Laing, Bruce E. Litow:
Census algorithms for chinese remainder pseudorank. RAIRO Theor. Informatics Appl. 42(2): 309-322 (2008) - [j27]Bruce E. Litow, Dmitry A. Konovalov
:
Phenotype space and kinship assignment for the simpson index. RAIRO Theor. Informatics Appl. 42(2): 323-333 (2008) - [i4]George I. Davida, Bruce E. Litow, Guangwu Xu:
Fast Arithmetics Using Chinese Remaindering. CoRR abs/0806.1722 (2008) - 2006
- [j26]Bruce E. Litow:
A Special Case of a Unary Regular Language Containment. Theory Comput. Syst. 39(5): 743-751 (2006) - 2005
- [j25]Dmitry A. Konovalov
Partition-distance via the assignment problem. Bioinform. 21(10): 2463-2468 (2005) - [j24]Dmitry A. Konovalov
Modified SIMPSON O(n3) algorithm for the full sibship reconstruction problem. Bioinform. 21(20): 3912-3917 (2005) - 2004
- [j23]Bruce E. Litow, Narsingh Deo:
Graph compression and the zeros of polynomials. Inf. Process. Lett. 92(1): 39-44 (2004) - 2003
- [j22]Bruce E. Litow:
Inequality of finite behaviors of rational weight finite automata is in R. Inf. Process. Lett. 87(3): 139-145 (2003) - [j21]Bruce E. Litow:
A note on commutative multivariate rational series. Inf. Process. Lett. 87(6): 283-285 (2003) - [j20]Bruce E. Litow:
The Hamiltonian circuit problem and automaton theory. SIGACT News 34(2): 91-94 (2003) - [j19]Zhuhan Jiang, Olivier Y. de Vel, Bruce E. Litow:
Unification and extension of weighted finite automata applicable to image compression. Theor. Comput. Sci. 302(1-3): 275-294 (2003) - [i3]Bruce E. Litow:
Polynomial equation elimination via Tarski Algebra. Electron. Colloquium Comput. Complex. TR03 (2003) - 2001
- [j18]Peter Stephenson, Bruce E. Litow:
Running the line: Line drawing using runs and runs of runs. Comput. Graph. 25(4): 681-690 (2001) - [j17]Bruce E. Litow:
Computing a Context-Free Grammar-Generating Series. Inf. Comput. 169(2): 174-185 (2001) - [j16]Andrew Chiu, George I. Davida, Bruce E. Litow:
Division in logspace-uniform NC1. RAIRO Theor. Informatics Appl. 35(3): 259-275 (2001) - [c6]Zhuhan Jiang, Bruce E. Litow, Olivier Y. de Vel:
An Inference Implementation Based on Extended Weighted Finite Automata. ACSC 2001: 100-108 - [c5]Peter Stephenson, Bruce E. Litow:
Making the DDA Run: Two-Dimensional Ray Traversal Using Runs and Runs of Runs. ACSC 2001: 177-183 - 2000
- [j15]Bruce E. Litow, Narsingh Deo:
Forbidden pairs combinatorics. Australas. J Comb. 22: 91-100 (2000) - [j14]Peter Stephenson, Bruce E. Litow:
Why Step When You Can Run? Iterative Line Digitization Algorithms Based On Hierarchies Of Runs. IEEE Computer Graphics and Applications 20(6): 76-84 (2000) - [j13]Bruce E. Litow:
On Hadamard square roots of unity. Theor. Comput. Sci. 237(1-2): 447-454 (2000) - [c4]Zhuhan Jiang, Bruce E. Litow, Olivier Y. de Vel:
Similarity Enrichment in Image Compression through Weighted Finite Automata. COCOON 2000: 447-456
1990 – 1999
- 1998
- [j12]Bruce E. Litow, Bernard Mans:
A Note on the Ádám Conjecture for Double Loops. Inf. Process. Lett. 66(3): 149-153 (1998) - [i2]Bruce E. Litow:
Parallel complexity of integer coprimality. Electron. Colloquium Comput. Complex. TR98 (1998) - 1997
- [i1]Bruce E. Litow:
A Decision Method for the Rational Sequence Problem. Electron. Colloquium Comput. Complex. TR97 (1997) - 1996
- [c3]Bruce E. Litow:
Bounded Length UCFG Equivalence. ISAAC 1996: 239-246 - 1995
- [j11]Bruce E. Litow:
The Influence of Graph Structure on Generalized Dimension Exchange. Inf. Process. Lett. 54(6): 347-353 (1995) - [j10]Bruce E. Litow, S. Hossein Hosseini, K. Vairavan, Gregory S. Wolffe:
Performance Characteristics of a Load Balancing Algorithm. J. Parallel Distributed Comput. 31(2): 159-165 (1995) - 1994
- [j9]Bruce E. Litow:
A Context-Free Language Decision Problem. Theor. Comput. Sci. 125(2): 339-343 (1994) - 1993
- [j8]Bruce E. Litow, Philippe Dumas:
Additive Cellular Automata and Algebraic Series. Theor. Comput. Sci. 119(2): 345-354 (1993) - 1992
- [j7]Bruce E. Litow:
On Iterated Integer Product. Inf. Process. Lett. 42(5): 269-272 (1992) - [j6]Bruce E. Litow:
On Rat∔. SIGACT News 23(3): 98-99 (1992) - 1991
- [j5]George I. Davida, Bruce E. Litow:
Fast Parallel Arithmetic via Modular Representation. SIAM J. Comput. 20(4): 756-765 (1991) - 1990
- [j4]Bruce E. Litow:
Parallel Complexity of the Regular Code Problem. Inf. Comput. 86(1): 107-114 (1990) - [j3]Seyed H. Hosseini, Bruce E. Litow, M. I. Malkawi, J. McPherson, K. Vairavan:
Analysis of a Graph Coloring Based Distributed Load Balancing Algorithm. J. Parallel Distributed Comput. 10(2): 160-166 (1990)
1980 – 1989
- 1988
- [c2]Bruce E. Litow, George I. Davida:
O(log(n)) Parallel Time Finite Field Inversion. AWOC 1988: 74-80 - 1987
- [c1]Seyed H. Hosseini, Bruce E. Litow, M. I. Malkawi, K. Vairavan:
Distributed algorithms for load balancing in very large homogeneous systems. FJCC 1987: 397-404 - 1985
- [j2]Bruce E. Litow:
On Efficient Deterministic Simulation of Turing Machine Computations Below Logspace. Math. Syst. Theory 18(1): 11-18 (1985)
1970 – 1979
- 1978
- [j1]Bruce E. Litow, Ivan Hal Sudborough:
On non-erasing oracle tapes in space bounded reducibility. SIGACT News 10(2): 53-57 (1978)
Coauthor Index
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-04-25 05:49 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: