Taking a walk on the wild side: teaching cloud computing on distributed research testbeds Y Zhuang, C Matthews, S Tredger, S Ness, J Short-Gershman, L Ji, ... Proceedings of the 45th ACM technical symposium on Computer science …, 2014 | 11 | 2014 |
Measurement of packet train arrival conditions in high latency networks E Cocker, U Speidel, N Rebenich, S Neville, A Gulliver, R Eimann, ... 2013 9th International Conference on Information, Communications & Signal …, 2013 | 10 | 2013 |
FLOTT—A Fast, Low Memory T-TransformAlgorithm for Measuring String Complexity N Rebenich, U Speidel, SW Neville, TA Gulliver IEEE Transactions on Computers 63 (4), 917-926, 2013 | 9 | 2013 |
Fast Low Memory T-Transform String Complexity in Linear Time and Space with Applications to Android App Store Security N Rebenich University of Victoria (Canada), 2012 | 5 | 2012 |
Counting prime polynomials and measuring complexity and similarity of information N Rebenich | 3 | 2016 |
A Note on Lempel-Ziv Parser Tails and Substring Lengths TA Gulliver, U Speidel, N Rebenich 2018 International Symposium on Information Theory and Its Applications …, 2018 | | 2018 |
An analog of the prime number theorem for finite fields via truncated polylogarithm expansions N Rebenich, T Gulliver, S Neville, U Speidel Mathematics of Computation 87 (310), 855-877, 2018 | | 2018 |
Measurement of Packet Train Arrival Conditions in High Latency Networks N Rebenich, S Neville, A Gulliver, R Eimann, K Nisar, S Hassan, Z Aziz, ... | | |