Ulrich Speidel
Ulrich Speidel
Senior Lecturer in Computer Science, University of Auckland
Verified email at aucklanduni.ac.nz - Homepage
Cited by
Cited by
Deterministic complexity and entropy
MR Titchener, R Nicolescu, L Staiger, A Gulliver, U Speidel
Fundamenta Informaticae 64 (1-4), 443-461, 2005
Detecting network events via T-entropy
U Speidel, R Eimann, N Brownlee
2007 6th International Conference on Information, Communications & Signal …, 2007
A T-decomposition algorithm with O (n log n) time and space complexity
J Yang, U Speidel
Proceedings. International Symposium on Information Theory, 2005. ISIT 2005 …, 2005
How well do practical information measures estimate the Shannon entropy
U Speidel, M Titchener, J Yang
Proc. of the Fifth International Symposium on Communication Systems …, 2006
Network event detection with T-entropy
R Eimann, U Speidel, N Brownlee, J Yang
CDMTCS-266, University of Auckland, 2005
On the generation of aperiodic and periodic necklaces via T-augmentation
TA Gulliver, I Makwakwa, U Speidel
Fundamenta Informaticae 83 (1-2), 91-107, 2008
A T-entropy analysis of the Slammer worm outbreak
R Eimann, U Speidel, N Brownlee
Proceedings of the 8th Asia-Pacific Network Operations and Management …, 2005
A note on the estimation of string complexity for short strings
U Speidel
2009 7th International Conference on Information, Communications and Signal …, 2009
Measurement of buffer requirement trends for real time traffic over TCP
E Cocker, F Ghazzi, U Speidel, MC Dong, V Wong, AJH Vinck, ...
2014 IEEE 15th international conference on high performance switching and …, 2014
Information technology & tourism enterprise collaboration: cases from rural New Zealand
S Milne, V Clark, U Speidel, C Nodder, N Dobbin
Handbook of research on electronic collaboration & organizational synergy …, 2008
Tourism, ICT and regional economic development: The case of Kiwitrails
S Milne, U Speidel, T Goodman, V Clark
Information and Communication Technologies in Tourism 2005, 114-124, 2005
An improved T-decomposition algorithm
J Yang, U Speidel
Fourth International Conference on Information, Communications and Signal …, 2003
A Fast T-decomposition Algorithm.
J Yang, U Speidel
J. UCS 11 (6), 1083-1101, 2005
Can network coding bridge the digital divide in the Pacific?
U Speidel, E Cocker, P Vingelmann, J Heide, M Médard
2015 International Symposium on Network Coding (NetCod), 86-90, 2015
String parsing-based similarity detection
J Yang, U Speidel
IEEE Information Theory Workshop, 2005., 5 pp., 2005
Community informatics in tourism
D Mason, U Speidel, S Milne
Information and Communication Technologies in Tourism-Australia 2003 …, 2003
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
PHP 5 Kochbuch
D Sklar, A Trachtenberg, C Lucke, M Brusdeylins, U Speidel, S Schmidt
O'Reilly Germany, 2009
A comparison of practical information measures
MR Titchener, U Speidel, J Yang
Department of Computer Science, The University of Auckland, New Zealand, 2005
An analytic upper bound on T-complexity
U Speidel, TA Gulliver
2012 IEEE International Symposium on Information Theory Proceedings, 2706-2710, 2012
The system can't perform the operation now. Try again later.
Articles 1–20