Leanne Rylands

According to our database, Leanne Rylands authored at least 17 papers between 1998 and 2022.

Collaborative distances:

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

2022

Protecting Private Information for Two Classes of Aggregated Database Queries.

Xuechao Yang, Xun Yi, Andrei Kelarev, Leanne Rylands, Yuqing Lin, Joe Ryan

Informatics, 2022

2021

Collusion-resistant protocols for private processing of aggregated queries in distributed databases.

Leanne Rylands, Jennifer Seberry, Xun Yi, Andrei Kelarev, Joe Ryan, Yuqing Lin

Distributed Parallel Databases, 2021

2019

A multistage protocol for aggregated queries in distributed cloud databases with privacy protection.

Andrei Kelarev, Xun Yi, Shahriar Badsha, Xuechao Yang, Leanne Rylands, Jennifer Seberry

Future Gener. Comput. Syst., 2019

2018

Discrete algorithms and methods for security of statistical databases related to the work of Mirka Miller.

Andrei Kelarev, Joe Ryan, Leanne Rylands, Jennifer Seberry, Xun Yi

J. Discrete Algorithms, 2018

2017

Combinatorial Algorithms and Methods for Security of Statistical Databases Related to the Work of Mirka Miller.

Andrei Kelarev, Jennifer Seberry, Leanne Rylands, Xun Yi

Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

2014

Antichains and completely separating systems - A catalogue and applications.

Martin Grüttmüller, Ian T. Roberts, Leanne J. Rylands

Discret. Appl. Math., 2014

2013

An Application of Completely Separating Systems to Graph Labeling.

Leanne Rylands, Oudone Phanalasy, Joe Ryan, Mirka Miller

Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

2012

α-Labelings and the Structure of Trees with Nonzero α-Deficit.

Gunnar Brinkmann, Simon Crevals, Hadrien Mélot, Leanne Rylands, Eckhard Steffen

Discret. Math. Theor. Comput. Sci., 2012

Antimagicness of some families of generalized graphs.

Mirka Miller, Oudone Phanalasy, Joe Ryan, Leanne Rylands

Australas. J Comb., 2012

2010

On the number of minimal completely separating systems and antichains in a Boolean lattice.

Ian T. Roberts, Leanne J. Rylands, Terry Montag, Martin Grüttmüller

Australas. J Comb., 2010

On Antimagic Labeling for Generalized Web and Flower Graphs.

Joe Ryan, Oudone Phanalasy, Mirka Miller, Leanne Rylands

Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

On a Relationship between Completely Separating Systems and Antimagic Labeling of Regular Graphs.

Oudone Phanalasy, Mirka Miller, Leanne Rylands, Paulette Lieby

Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

2009

Covering separating systems and an application to search theory.

Oudone Phanalasy, Ian T. Roberts, Leanne J. Rylands

Australas. J Comb., 2009

2005

Minimal (n) and (n, h, k) Completely Separating Systems.

Ian T. Roberts, Leanne J. Rylands

Australas. J Comb., 2005

2001

Matrix Generators for Exceptional Groups of Lie Type.

R. B. Howlett, Leanne J. Rylands, Donald E. Taylor

J. Symb. Comput., 2001

2000

Constructions for Octonion and Exceptional Jordan Algebras.

Leanne J. Rylands, Donald E. Taylor

Des. Codes Cryptogr., 2000

1998

Matrix Generators for the Orthogonal Groups.

Leanne J. Rylands, Donald E. Taylor

J. Symb. Comput., 1998