Niko Rebenich
Title
Cited by
Cited by
Year
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
82014
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
82013
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
82013
Fast Low Memory T-Transform: string complexity in linear time and space with applications to Android app store security.
N Rebenich
52012
Fast Low Memory T-Transform: string complexity in linear time and space with applications to Android app store security.
N Rebenich
52012
Counting prime polynomials and measuring complexity and similarity of information
N Rebenich
22016
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, ...
The system can't perform the operation now. Try again later.
Articles 1–9