Queen's University
School of Computing

Technical Report List (part O)

Electronic copies of some reports are available in Adobe PDF and Postscript formats; click the appropriate link to download for display. Some postscript files may not display properly at your site, especially if they contain embedded font file descriptions.

O'Hearn, P. W.:

1991-304

"Semantical Analysis Of Specification Logic. Part 2", by P. W. O'Hearn and R.D. Tennent.

Ogilvie, J.E.:

1983-150

"Universal Relation Theory as Applied to Bibliographic Data", by R.G. Crawford, H.S. Becker and J.E. Ogilvie, September 1983. 13 pages.

1983-149

"A Relational Bibliographic Database", by R.G. Crawford and J.E. Ogilvie, September 1983. 12 pages.

Oh, Sam K.:

1994-365

"Task Behavior Monitoring for Adaptive Real-Time Communication", by Sam K. Oh and Glenn H. MacEwen, June 1994. 26 pages.

1994-364

"The Two-Phase Virtual-Time CSMA/CD Protocols for Critical Real-Time Systems with Dynamic Environment", by Sam K. Oh and Glenn H. MacEwen, June 1994. 21 pages.

1993-347 available in PDF (242.818 Kbytes) and Postscript (474.904 Kbytes)

"The Best-Effort Virtual-Time CSMA/CD Protocols with Run-Time Clairvoyancy Support", by Sam K. Oh and Glenn H. MacEwen.

1992-343 available in PDF (210.482 Kbytes) and Postscript (371.858 Kbytes)

"The Best-Effort Virtual-Time CSMA/CD Protocols for Real-Time Systems", by Sam K. Oh and Glenn H. MacEwen.

1992-325 available in PDF (158.766 Kbytes) and Postscript (356.706 Kbytes)

"Toward Fault-Tolerant Adaptive Real-Time Distributed Systems", by Sam K. Oh and Glenn H. MacEwen.

Okhotin, Alexander:

2004-486 available in PDF (255.641 Kbytes) and Postscript (755.375 Kbytes)

"A preliminary report on generalized LR parsing for Boolean grammars", by Alexander Okhotin, July 2004. 23 pages.

2004-478 available in PDF (372.981 Kbytes) and Postscript (544.841 Kbytes)

"A Boolean grammar for a simple programming language", by Alexander Okhotin, March 2004. 34 pages.

2004-475 available in PDF (176.846 Kbytes) and Postscript (188.441 Kbytes)

"An extension of recursive descent parsing for Boolean grammars", by Alexander Okhotin, March 2004. 21 pages.

2003-468 available in PDF (280.064 Kbytes) and Postscript (666.755 Kbytes)

"Conjunctive languages are closed under inverse homomorphism", by Alexander Okhotin, August 2003. 25 pages.

2002-460 available in PDF (261.174 Kbytes) and Postscript (970.893 Kbytes)

"A linear conjunctive grammar for the circuit value problem", by Alexander Okhotin, September 2002. 35 pages.

2002-459 available in PDF (233.667 Kbytes) and Postscript (591.132 Kbytes)

"One-Visit Caterpillar Tree Automata", by Alexander Okhotin, Kai Salomaa and Michael Domaratzki, August 2002. 20 pages.

2002-456 available in PDF (200.912 Kbytes) and Postscript (305.015 Kbytes)

"On a new family of automata", by Alexander Okhotin, March 2002. 13 pages.

2002-455 available in PDF (152.768 Kbytes) and Postscript (143.292 Kbytes)

"Linear conjunctive languages are closed under complement", by Alexander Okhotin, January 2002. 9 pages.

Olagunju, A.O.:

1980-112

"Investigation of a Distribution Model as a Basis for Keyword Detection", by A.O. Olagunju, October 1980. 112 pages.

Osiakwan, Constantine:

1991-300

"An EP Algorithm For Computing A Minimum Weight Perfect Matching For A Set Of Points On the Plane", by C. N.K. Osiakwan and Selim G. Akl.

1990-284

"Efficient Parallel Algorithms For The Assignment On The Plane", by Selim G. Akl and Constantine Osiakwan.

1990-274

"The Maximum Weight Perfect Matching Problem for Complete Weighted Graphs is in PC^*", by Constantine Osiakwan and Selim G. Akl, March 1990.

1989-258

"A Perfect Speedup Parallel Algorithm for the Assignment Problem on Complete Weighted Bipartite Graphs", by Constantine N.K. Osiakwan and Selim G. Akl, June 1989.

1988-241

"Optimal Parallel Algorithms for b-Matchings in Trees", by C. Osiakwan and S.G. Akl, December 1988. 46 pages.