Neil O'Connell

According to our database, Neil O'Connell authored at least 9 papers between 1994 and 2008.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2008

Complexity analysis of a decentralised graph colouring algorithm.

Ken R. Duffy, Neil O'Connell, Artëm Sapozhnikov

Inf. Process. Lett., 2008

2007

Queues, stores, and tableaux

Moez Draief, Jean Mairesse, Neil O'Connell

CoRR, 2007

2004

Big queues.

Ayalvadi J. Ganesh, Neil O'Connell, Damon Wischik

Lecture notes in mathematics 1838, Springer, ISBN: 978-3-540-20912-6, 2004

2003

Joint Burke's Theorem and RSK Representation for a Queue and a Store.

Moez Draief, Jean Mairesse, Neil O'Connell

Proceedings of the Discrete Random Walks, 2003

2002

Information Loss In Riffle Shuffling.

Dudley Stark, Ayalvadi Ganesh, Neil O'Connell

Comb. Probab. Comput., 2002

2001

Random Finite Topologies and their Thresholds.

C. F. Maclean, Neil O'Connell

Comb. Probab. Comput., 2001

1998

Bayesian network management.

Ayalvadi J. Ganesh, Peter Green, Neil O'Connell, Susan Pitts

Queueing Syst. Theory Appl., 1998

1995

Entropy of ATM Traffic Streams: A Tool for Estimating QoS Parameters.

Nick G. Duffield, John T. Lewis, Neil O'Connell, Raymond Russell, Fergal Toomey

IEEE J. Sel. Areas Commun., 1995

1994

Estimating QoS parameters for ATM traffic using its entropy.

Nick G. Duffield, John T. Lewis, Neil O'Connell, Raymond Russell, Fergal Toomey

Proceedings of the ATM Networks, 1994