University of Oxford Logo University of OxfordDepartment of Computer Science - Home
On Facebook
Facebook
Follow us on twitter
Twitter
Linked in
Linked in
Flickr
Flickr
Google plus
Google plus
Digg
Digg
Pinterest
Pinterest
Stumble Upon
Stumble Upon

Computer Science Technical Reports

2018201720162015201420132012201120102009200820072006200520042003

1974

[RR-03-01]

Tractable conservative constraint satisfaction problems

Andrei A. Bulatov

No. RR−03−01. Oxford University Computing Laboratory. June, 2003.

[RR-03-02]

A game semantics for generic polymorphism

Samson Abramsky and Radha Jagadeesan

No. RR−03−02. Oxford University Computing Laboratory. January, 2003.

[RR-03-03]

B−sides

Keye Martin

No. RR−03−03. Oxford University Computing Laboratory. January, 2003.

[RR-03-05]

Entropy as a fixed point

Keye Martin

No. RR−03−05. Oxford University Computing Laboratory. February, 2003.

[RR-03-06]

Epistemic motion in quantum searching

Keye Martin

No. RR−03−06. Oxford University Computing Laboratory. March, 2003.

[RR-03-07]

Fractals and domain theory

Keye Martin

No. RR−03−07. Oxford University Computing Laboratory. April, 2003.

[RR-03-09]

Note on the use of statistical procedures as background predicates in ILP

Ashwin Srinivasan

No. RR−03−09. Oxford University Computing Laboratory. June, 2003.

[RR-03-10]

Deformation theory and the computation of zeta functions II

Alan G.B. Lauder

No. RR−03−10. Oxford University Computing Laboratory. April, 2003.

[RR-03-11]

Game−based software model checking: case studies and methodological considerations

Dan R. Ghica

No. RR−03−11. Oxford University Computing Laboratory. May, 2003.

[RR-03-12]

The Logic of Entanglement. An invitation. (Version 0.9999)

Bob Coecke

No. RR−03−12. Oxford University Computing Laboratory. October, 2003.

[RR-03-13]

Towards a dichotomy theorem for the counting constraint satisfaction problem

Andrei A. Bulatov and Victor Dalmau

No. RR−03−13. Oxford University Computing Laboratory. July, 2003.

[RR-03-14]

A BSP parallel model of the Göttfert algorithm for polynomial factorization over F2

Fatima Abu Salem

No. RR−03−14. Oxford University Computing Laboratory. July, 2003.

[RR-03-15]

A Critical Survey of Grid Security Requirements and Technologies

Philippa J. Broadfoot and Andrew P. Martin

No. RR−03−15. Oxford University Computing Laboratory. August, 2003.

[RR-03-16]

A Reflective Functional Language for Hardware Design and Theorem Proving

Jim Grundy‚ Tom Melham and John O'Leary

No. RR−03−16. Oxford University Computing Laboratory. October, 2003.

[RR-03-17]

Formalization and Execution of STE in HOL (Extended Version)

Ashish Darbari

No. RR−03−17. Oxford University Computing Laboratory. March, 2003.

[RR-03-18]

A New Sparse Gaussian Elimination Algorithm and the Niederreiter Linear System for Trinomials over F2

Fatima Abu Salem

No. RR−03−18. Oxford University Computing Laboratory. August, 2003.

[RR-03-19]

Architectures for Secure Delegation Within Grids

Philippa J. Broadfoot and Gavin Lowe

No. RR−03−19. Oxford University Computing Laboratory. September, 2003.

[RR-03-21]

Finding transcription factor binding sites in DNA Sequences: A template based approach

Sumedha Gunewardena and Peter Jeavons

No. RR−03−21. Oxford University Computing Laboratory. October, 2003.

[RR-03-08]

Translating CSP trace refinement to UNITY unreachability : a study in data independence

A. W. Roscoe‚ Xu Wang and R.S. Lazic

No. RR−03−08. Oxford University Computing Laboratory. April, 2003.