# Items where Subject is "08 INFORMATION AND COMPUTING SCIENCES > 0802 Computation Theory and Mathematics > 080201 Analysis of Algorithms and Complexity"

Up a level |

- Fields of Research (26386)
- 08 INFORMATION AND COMPUTING SCIENCES (570)
- 0802 Computation Theory and Mathematics (31)
**080201 Analysis of Algorithms and Complexity**(17)

- 0802 Computation Theory and Mathematics (31)

- 08 INFORMATION AND COMPUTING SCIENCES (570)

**17**.

## B

Breitkreutz, David, and Casey, Kate
(2008)
*Clusterers: a comparison of partitioning and density-based algorithms and a discussion of optimisations.*
Report.
UNSPECIFIED, Townsville, Australia.
(Unpublished)

Brown, Marianne Elizabeth
(2003)
*Guiding linear deductions with semantics.*
Masters (Research) thesis, James Cook University.

## C

Cranefield, Stephen, and Song, Insu
(2012)
*Agent Based Simulation for a Sustainable Society and Multi-Agent Smart Computing: international workshops, PRIMA 2011, Wollongong, Australia, November 14, 2011: revised selected papers.*
Lecture Notes in Artificial Intelligence, 7580
.
Springer, Berlin, Germany.

Chiu, Andrew, Davida, George, and Litow, Bruce
(2001)
*Division in logspace-uniform NC¹.*
RAIRO - Theoretical Informatics and Applications, 35 (3).
pp. 259-275.

## D

Davida, George, Litow, Bruce, and Xu, Guanguu
(2009)
*Fast arithmetics using Chinese remaindering.*
Information Processing Letters, 109 (13).
pp. 660-662.

## G

Ghodosi, Hossein
(2007)
*On insecurity of Naor–Pinkas’ distributed oblivious transfer.*
Information Processing Letters, 104 (5).
pp. 179-182.

Ghodosi, Hossein
(2007)
*A general model for oblivious transfer.*
In: Proceedings of the Sixth International Workshop for Applied PKC, pp. 79-87. From: Sixth International Workshop for Applied PKC (IWAP2007), 3-4 DEC 2007, Perth, WA, Australia.

Ghodosi, Hossein, and Zaare-Nahandi, Rahim
(2007)
*A non-interactive multiparty computation protocol.*
In: Proceedings of the Sixth International Workshop for Applied PKC, pp. 88-95. From: Sixth International Workshop for Applied PKC (IWAP2007), 3-4 DEC 2007, Perth, WA, Australia.

## L

Litow, B.
(2010)
*On sums of roots of unity.*
Lecture Notes in Computer Science, 6198.
pp. 420-425.

Litow, Bruce, and Konovalov, Dmitry
(2008)
*Phenotype space and kinship assignment for the Simpson index.*
RAIRO - Theoretical Informatics and Applications, 42 (2).
pp. 323-333.

Litow, B.
(2006)
*A special case of a unary regular language containment.*
Theory of Computing Systems, 39 (5).
pp. 743-751.

Litow, Bruce, Deo, Narsingh, and Cami, Aurel
(2004)
*Compression of vertex transitive graphs.*
Congressus Numerantium, 167.
pp. 161-173.

Litow, Bruce, and Stephenson, Peter
(2000)
*Why step when you can run? Iterative line digitization algorithms based on hierarchies of runs.*
IEEE Computer Graphics and Applications, 20 (6).
pp. 76-84.

## O

Orumiehchi, Mohammad Ali, Mohebbipoor, S. Fahimeh, and Ghodosi, Hossein
(2008)
*Cryptanalysis of MV 3 Stream Cipher.*
In: Franklin, Matthew K., Hui, Lucas Chi Kwong, and Wong, Duncan S., (eds.)
Cryptology and Network Security.
Lecture Notes in Computer Science
.
Springer, Berlin, Germany, pp. 240-251.

## S

Song, Insu, and Governatori, Guido
(2005)
*Nested rules in defeasible logic.*
Lecture Notes in Computer Science, 3791.
204-208 .

Stephenson, Peter, and Litow, Bruce
(2001)
*Running the line: Linedrawing using runs and runs of runs.*
Computers and Graphics, 25 (4).
pp. 681-690.

## T

Trevathan, Jarrod, and Read, Wayne
(2008)
*Variable quantity market clearing algorithms.*
In: Filipe, Joaquim, and Obaidat, Mohammad S., (eds.)
E-business and Telecommunications Networks.
Communications in Computer and Information Science, 9
(1).
Springer, Berlin, Germany, pp. 28-39.