B. Litow

发表

Zhuhan Jiang, Olivier Y. de Vel, Bruce E. Litow, 2000, COCOON.

A Structural Approach to Graph CompressionNarsingh Deo xand

B. Litow, 1998 .

A Review of World Wide Web Searching Techniques, Focusing on Hits and Related Algorithms That Utilise the Link Topology of the World Wide Web to Provide the Basis for a Structure Based Search Technology

B. Litow, 2001 .

Graph compression and the zeros of polynomials

Narsingh Deo, Bruce E. Litow, N. Deo, 2004, Inf. Process. Lett..

The Weighted Finite Automaton Inference Problem

O. Vel, B. Litow, 1995 .

Decidable Cases of the Rational Sequence Problem

B. Litow, 1995 .

Forbidden Pairs

B. Litow, CombinatoricsDRAFTNarsingh, Deo, 1999 .

On non-erasing oracle tapes in space bounded reducibility

I. H. Sudborough, B. Litow, 1978, SIGA.

Deterring traitor using double encryption scheme

B. Litow, H. Ghodosi, A. C. Prihandoko, 2013, 2013 IEEE International Conference on Communication, Networks and Satellite (COMNETSAT).

The Innuence of Graph Structure on Generalized Dimension Exchange Title the Innuence of Graph Structure on Generalized Dimension Exchange Primary Author(s) Date

B. Litow, 1995 .

Fast evaluation of iterated multiplication of very large polynomials: An application to chinese remainder theory

B. Litow, D. Laing, 2007 .

Integer Coprimality I S I N N C

B. Litow, 2004 .

A Census Algorithm for Chinese Remainder Pseudorank with Experimental Results

B. Litow, D. Laing, 2005 .

Inequality of finite behaviors of rational weight finite automata is in R

Bruce E. Litow, B. Litow, 2003, Inf. Process. Lett..

Analysis of a Graph Coloring Based Distributed Load Balancing Algorithm

Seyed Hossein Hosseini, K. Vairavan, Bruce E. Litow, 1990, J. Parallel Distributed Comput..

On Rat_∔

B. Litow, B. Litow, 1992, SIGA.

Computing a Context-Free Grammar-Generating Series

Bruce E. Litow, B. Litow, 2001, Inf. Comput..

Distributed global state determination via graph coloring

K. Vairavan, B. Litow, S. H. Hosseini, 1991, [1991 Proceedings] Tenth Annual International Phoenix Conference on Computers and Communications.

Division in logspace-uniform NC1

Andrew Chiu, Bruce E. Litow, George I. Davida, 2001, RAIRO Theor. Informatics Appl..

Why Step When You Can Run? Iterative Line Digitization Algorithms Based On Hierarchies Of Runs

Peter Stephenson, Bruce E. Litow, B. Litow, 2000, IEEE Computer Graphics and Applications.

Partition-distance via the assignment problem

Dmitry A. Konovalov, Bruce E. Litow, Nigel Bajema, 2005, Bioinform..

Running the line: Line drawing using runs and runs of runs

Peter Stephenson, Bruce Litow, B. Litow, 2001, Comput. Graph..

Making the DDA run: two-dimensional ray traversal using runs and runs of runs

Peter Stephenson, Bruce E. Litow, B. Litow, 2001, Proceedings 24th Australian Computer Science Conference. ACSC 2001.

NC1 Division

B. Litow, DivisionA. Chiu, G. Davida, 2000 .

A Structural Approach to Graph Compression

Narsingh Deo, Bruce Litow, N. Deo, 1998 .

Compression of vertex transitive graphs

Narsingh Deo, Bruce Litow, Aurel Cami, 2004 .

Forbidden pairs combinatorics

Narsingh Deo, Bruce E. Litow, N. Deo, 2000, Australas. J Comb..

Additive Cellular Automata and Algebraic Series

Philippe Dumas, Bruce E. Litow, B. Litow, 1993, Theor. Comput. Sci..

On Hadamard square roots of unity

Bruce E. Litow, B. Litow, 2000, Theor. Comput. Sci..

A Context-Free Language Decision Problem

Bruce E. Litow, B. Litow, 1994, Theor. Comput. Sci..

A Randomised Approach to Formal Polynomial IdentitiesB

B. Litow, 1999 .

White-box Implementation to Advantage DRM

Hossein Ghodosi, Antonius Cahya Prihandoko, Bruce Litow, 2017 .