 | ftp://ftp.cs.su.oz.au/pub/tr/TR93_458.ps.Z, 19930510
Generalized Strongly Chordal Graphs Elias Dahlhaus Basser Dept. of Computer Science University of Sydney NSW 2006, Australia |
| ftp://ftp.cs.su.oz.au/pub/tr/TR93_457.ps.Z, 19930510
Efficient Parallel Algorithms on Chordal Graphs with a Sparse Tree Representation Elias Dahlhaus Basser Dept. of Computer Science University of Sydney NSW 2006, Australia e-mail: dahlhaus@cs.su.oz.au FAX: (+61)-2-692-3838 |
| ftp://ftp.cs.su.oz.au/pub/tr/TR93_456.ps.Z, 19930510
The Parallel Complexity of Elimination Ordering Procedures Elias Dahlhaus Basser Dept. of Computer Science University of Sydney, NSW 2006, Australia 1 |
| ftp://ftp.cs.su.oz.au/pub/tr/TR93_464.ps.Z, 19930510
A Simple Efficient Parallel Algorithms to Recognize Chordal Graphs as Interval Graphs Elias Dahlhaus Basser Dept. of Computer Science University of Sydney NSW 2006, Australia |
| ftp://ftp.cs.su.oz.au/pub/tr/TR93_466.ps.Z, 19930517
Optimal Stable Merging Antonios Symvonis Basser Department of Computer Science University of Sydney Sydney, N.S.W. 2006 Australia symvonis@cs.su.oz.au May 17, 1993 |
| ftp://ftp.cs.su.oz.au/pub/tr/TR93_465.ps.Z, 19930519
Efficient Parallel Algorithms for Modular Decomposition and Split Decomposition of Chordal Graphs Elias Dahlhaus Basser Dept. of Computer Science University of Sydney NSW 2006, Australia |
| ftp://ftp.cs.su.oz.au/pub/tr/TR93_468.ps.Z, 19930721
First Order Learning, Zeroth Order Data R.M.Cameron-Jones and J.R.Quinlan Basser Department of Computer Science The University of Sydney, NSW 2006 Australia mcj@cs.su.oz.au and quinlan@cs.su.oz.au |
| ftp://ftp.cs.su.oz.au/pub/tr/TR93_467.ps.Z, 19930727
Consistency Reasoning in Neural-Logic Belief Networks Boon Toh LOW Norman Y. FOO Knowledge Systems Group Basser Department of Computer Science University of Sydney NSW, Australia 2006 boontoh@cs.su.oz.au norman@cs.su.oz.au |
| ftp://ftp.cs.su.oz.au/pub/tr/TR93_469.ps.Z, 19930727
On Persistent Semantics for Knowledge Base Update Technical Report 469 July 1993 Yan Zhang and Norman Foo Knowledge Systems Group Basser Department of Computer Science University of Sydney NSW 2006, Australia E-mail: yan@cs.su.oz.au norman@cs.su.oz.au |
| ftp://ftp.cs.su.oz.au/pub/tr/TR93_471.ps.Z, 19930819
Routing on Trees Antonios Symvonis Basser Department of Computer Science University of Sydney Sydney, N.S.W. 2006 Australia symvonis@cs.su.oz.au TR-472 |- August 11, 1993 |
| ftp://ftp.cs.su.oz.au/pub/tr/TR93_473.ps.Z, 19931105
An ef cient algorithm for the shortest path problem Diab Abuaiadh and Jeffrey H. Kingston |
| ftp://ftp.cs.su.oz.au/pub/tr/TR93_476.ps.Z, 19940104
Are Fibonacci Heaps Optimal Diab Abuaiadh and Jeffrey H. Kingston |
| ftp://ftp.cs.su.oz.au/pub/tr/TR93_475.ps.Z, 19940104
Ef cient shortest path algorithms by graph decomposition Diab Abuaiadh and Jeffrey H. Kingston |
| ftp://ftp.cs.su.oz.au/pub/tr/TR93_477.ps.Z, 19940202
An Emperical Study of Off-Line Permutation Packet Routing on 2-Dimensional Meshes Based on the Multistage Routing Method Antonios Symvonis Jonathon Tidswell Basser Department of Computer Science Hydrographic Sciences Australia P/L University of Sydney PO Box 85 Sydney, N.S.W. 2006 Cammeray, NSW 2062 |
| ftp://ftp.cs.su.oz.au/pub/tr/TR93_472.ps.Z, 19940303
- 1 - Possible Worlds Semantics For Events Norman Y. Foo and Yan Zhang Knowledge Systems Group Basser Department of Computer Science University of Sydney, NSW 2006 Australia e-mail: norman@cs.su.oz.au yan@cs.su.oz.au |
| ftp://ftp.cs.su.oz.au/pub/tr/TR93_479.ps.Z, 19940308
- 1 - Convex Predicates and Induction Norman Y. Foo Knowledge Systems Group Basser Department of Computer Science University of Sydney, NSW 2006 Australia e-mail: norman@cs.su.oz.au |
| ftp://ftp.cs.su.oz.au/pub/tr/TR93_480.ps.Z, 19940325
Parallel h-v Drawings of Binary Trees Panagiotis T. Metaxas 1 Grammati E. Pantziou 2 Antonis Symvonis 3 Technical Report 480 March 9, 1994 (1) Department of Computer Science, Wellesley College, Wellesley MA 02181, USA (2) Department of Mathematics and Computer Science, Dartmouth College, Hanover NH |
| ftp://ftp.cs.su.oz.au/pub/tr/TR93_463.ps.Z, 19940325
Neweyes: A System for Comparing Biological Sequences Using the Running Karp-Rabin Greedy String-Tiling Algorithm1 Michael J. Wise Department of Computer Science, University of Sydney, Australia michaelw@cs.su.oz.au FAX: +61 2 692 3838 Keywords: Efficient sequence search, structure matrices, transposed |
| ftp://ftp.cs.su.oz.au/pub/tr/TR94_482.ps.Z, 19940610
Lies, damned lies and stereotypes: pragmatic approximations of users Judy Kay Basser Department of Computer Science University of Sydney judy@cs.su.oz.au |
| ftp://ftp.cs.su.oz.au/pub/tr/TR94_483.ps.Z, 19940610
The justified user model: a viewable, explained user model* R Cook and J Kay Basser Department of Computer Science University of Sydney ronny@tmx.mhs.oz.au,judy@cs.su.oz.au |
| ftp://ftp.cs.su.oz.au/pub/tr/TR93_474.ps.Z, 19940802
A BENCHMARK FOR CLASSIFIER LEARNING ZIJIAN ZHENG Technical Report 474 November 1993 Basser Department of Computer Science The University of Sydney N.S.W. Australia 2006 A BENCHMARK FOR CLASSIFIER LEARNING ZIJIAN ZHENG Basser Department of Computer Science, University of Sydney, NSW 2006 Email: |
| ftp://ftp.cs.su.oz.au/pub/tr/TR94_486.ps.Z, 19940804
Neural-Logic Belief Networks (NLBN) Boon Toh LOW Norman Y. FOO Knowledge Systems Group Basser Department of Computer Science University of Sydney NSW 2006, Australia email : boontoh@cs.su.oz.au norman@cs.su.oz.au |
| ftp://ftp.cs.su.oz.au/pub/tr/TR94_484.ps.Z, 19940819
Causal Group Multicast: A Formal Description P. Tyler Basser Department of Computer Science University of Sydney Sydney, N.S.W. 2006, Australia |
| ftp://ftp.cs.su.oz.au/pub/tr/TR94_489.ps.Z, 19941019
1 A toolkit for appraising the long term usability of a text editor Ronny Cook, Judy Kay, Greg Ryan, Richard C Thomas Basser Department of Computer Science, University of Sydney, 2006 Australia Department of Computer Science, The University of Western Australia, Nedlands, WA 6009, Australia |
| ftp://ftp.cs.su.oz.au/pub/tr/TR94_490.ps.Z, 19941027
On Deflection Worm Routing on Meshes Alan Roberts Antonios Symvonis Basser Department of Computer Science University of Sydney Sydney, N.S.W. 2006 Australia falanr,symvonisg@cs.su.oz.au Technical Report 490 October 1994 |
| ftp://ftp.cs.su.oz.au/pub/tr/TR94_493.ps.Z, 19941114
A Note on Deflection Routing on Undirected Graphs Antonios Symvonis Basser Department of Computer Science University of Sydney Sydney, N.S.W. 2006 Australia symvonis@cs.su.oz.au Technical Report 493 November 1994 |
| ftp://ftp.cs.su.oz.au/pub/tr/TR94_488.ps.Z, 19941128
- 1 - REQUIREMENTS FOR A FIRST YEAR OBJECT-ORIENTED TEACHING LANGUAGE Michael K lling, Bett Koch and John Rosenberg Basser Department of Computer Science University of Sydney, Australia {mik,bett,johnr}@cs.su.oz.au |
| ftp://ftp.cs.su.oz.au/pub/tr/TR94_491.ps.Z, 19941219
Discretization of Continuous-Valued Attributes and Instance-Based Learning Ting, Kai Ming Basser Department of Computer Science University of Sydney, NSW 2006, Australia E-mail: kaiming@cs.su.oz.au Technical Report No.491 October, 1994 |
| ftp://ftp.cs.su.oz.au/pub/tr/TR95_495.ps.Z, 19950207
The Complexity of Timetable Construction Problems Tim B. Cooper and Jeffrey H. Kingston Basser Department of Computer Science The University of Sydney 2006 Australia 3 February, 1995 |
| ftp://ftp.cs.su.oz.au/pub/tr/TR95_496.ps.Z, 19950306
A Program for Constructing High School Timetables Tim B. Cooper and Jeffrey H. Kingston Basser Department of Computer Science The University of Sydney 2006 Australia 6 March, 1995 |
| ftp://ftp.cs.su.oz.au/pub/tr/TR95_498.ps.Z, 19950528
Customised hyper text as an individualised learning environment JKay and R J Kummerfeld Department of Computer Science University of Sydney |
| ftp://ftp.cs.su.oz.au/pub/tr/TR95_499.ps.Z, 19950807
User model agents for distributed ltering J. Kay and R. J. Kummerfeld Department of Computer Science University of Sydney |
| ftp://ftp.cs.su.oz.au/pub/tr/TR95_500.ps.Z, 19951114
On the Hot-Potato Permutation Routing Algorithm of Borodin, Rabani and Schieber Richard Thomas Plunkett Antonis Symvonis Basser Department of Computer Science University of Sydney Sydney, N.S.W. 2006 Australia frichard,symvonisg@cs.su.oz.au Technical Report 500 August 1995 Updated: November 1995 |
| ftp://ftp.cs.su.oz.au/pub/tr/TR95_501.ps.Z, 19951204
1 1 Introduction Computer environments have changed dramatically in recent years, from the large centralised mainframe to the networked collections of workstation style machines. The power of workstations is increasing, but the common paradigms used to manage data on these workstations are still |
| ftp://ftp.cs.su.oz.au/pub/tr/TR95_503.ps.Z, 19951214
Visualisation of Entrenched User Preferences Judy Kay Department of Computer Science Sydney University NSW 2006, Australia +61 2 351 4502 judy@cs.su.oz.au Richard C. Thomas Department of Computer Science The University of Western Australia Nedlands, WA 6907, Australia +61 9 380 2733 |
| ftp://ftp.cs.su.oz.au/pub/tr/TR96_506.ps.Z, 19960529
Hierarchical Fair Queueing David Hogan dhog@plan9.cs.su.oz.au Basser Department of Computer Science University of Sydney |
| ftp://ftp.cs.su.oz.au/pub/tr/TR95_494.ps.Z, 19960529
Routing on Trees via Matchings Alan Roberts Antonis Symvonisy Louxin Zhangz |
| ftp://ftp.cs.su.oz.au/pub/tr/TR96_507.ps.Z, 19960711
Many-to-Many Routing on Trees via Matchings Grammati E. Pantziou a;1, Alan Roberts b and Antonis Symvonis b;2 a Computer Technology Institute, P.O. Box 1122, 26110 Patras, Greece. pantziou@cti.gr b Department of Computer Science, University of Sydney, N.S.W. 2006, Australia. falanr,symvonisg@cs.su.oz.au |
| ftp://ftp.cs.su.oz.au/pub/tr/TR96_508.ps.Z, 19960920
AWOCA'96 Seventh Australasian Workshop on Combinatorial Algorithms Magnetic Island, Queensland, Australia 15 July { 19 July 1996 Programme Monday 15 July 9:00 Opening, Bruce Litow 9:15 Narsingh Deo: Capacitated MST and Related Problems: Challenges in a Uni- fied Approach 10:15 Morning tea 10:45 Narsingh |
| ftp://ftp.cs.su.oz.au/pub/tr/TR96_509.ps.Z, 19961018
SIDERE MENS EADEM MUTATO 7KH 8QLYHUVLW RI 6GQH %DVVHU 'HSDUWPHQW RI &RPSXWHU 6FLHQFH $ 1(: 352&(66 0,*5$7,21 $/*25,7+0 %< 0,&+$(/ 5,&+021' 0,&+$(/ +,7&+(16 7(&+1,&$/ 5(3257 o 6(37(0%(5 <=ooss %$66(5 '(3$570(17 2) &20387(5 6&,(1&( 81,9(56,7< 2) 6<'1(< %DVVHU 'HSDUWPHQW RI &RPSXWHU 6FLHQFH 8QLYHUVLW |
| ftp://ftp.cs.su.oz.au/pub/tr/TR97_514.ps.Z, 19970602
On-line Matching Routing on Trees Alan Roberts and Antonios Symvonis 1 Department of Computer Science, University of Sydney, NSW 2006, Australia. falanr,symvonisg@cs.su.oz.au |
