default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDUlrich Speidel
Person information
- affiliation: University of Auckland, New Zealand
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c40]Andrew Luxton-Reilly
, Ewan D. Tempero, Nalin A. G. Arachchilage, Angela Chang, Paul Denny, Allan Fowler, Nasser Giacaman, Igor Kontorovich, Danielle M. Lottridge, Sathiamoorthy Manoharan, Shyamli Sindhwani, Paramvir Singh, Ulrich Speidel, Sudeep Stephen, Valerio Terragni, Jacqueline Whalley, Burkhard Wuensche, Xinfeng Ye:
Automated Assessment: Experiences From the Trenches. ACE 2023: 1-10- [c39]Manuel Castro, Sathiamoorthy Manoharan, Ulrich Speidel, Xinfeng Ye, Jiayi Zu:
Observations of Cheating Behaviours in Online Examinations and Tools for Mitigation. FIE 2023: 1-7 - [c38]Lamees El Hiny, Xinfeng Ye, Sathiamoorthy Manoharan, Ulrich Speidel:
A multimodal approach to mitigate cheating in online assessments. TALE 2023: 1-4 - 2022
- [c37]Ulrich Speidel:
The Hunga Tonga Hunga Ha'apai Eruption - A Postmortem: What happened to Tonga's Internet in January 2022, and what lessons are there to be learned? AINTEC 2022: 70-78 - [c36]Jun O. Seo, Sathiamoorthy Manoharan, Ulrich Speidel:
On Viable Statistical Metrics for Re-Embedding Network Steganalysis. ITNAC 2022: 213-218 - [c35]Karolien Koorts, Ulrich Speidel, Xinfeng Ye, Sathiamoorthy Manoharan:
On Improving Academic Integrity Processes. MIPRO 2022: 1289-1294 - [c34]Josh Banning-Taylor, Murray Freeth-Edwards, Sathiamoorthy Manoharan, Ulrich Speidel, Xinfeng Ye:
Identity Verification for Examinations. TALE 2022: 806-809 - 2021
- [j12]Xiaojie Liu, Ulrich Speidel:
RAODV Routing Protocol for Congestion Detection and Relief in Ad Hoc Wireless Networks. Int. J. Interdiscip. Telecommun. Netw. 13(4): 21-34 (2021) - [c33]Ulrich Speidel:
What the Tropical Pacific Wants From Starlink for Christmas: Will LEO Networks Finally Bridge the Digital Divide to Remote Islands? AINTEC 2021: 34-40 - [c32]Daniel Roodt, Ulrich Speidel, Vimal Kumar, Ryan K. L. Ko:
On Random Editing in LZ-End. DCC 2021: 366 - [c31]Ulrich Speidel:
Improving goodput on shared satellite links with coded tunnels. GLOBECOM 2021: 1-6 - 2020
- [c30]Xiaojie Liu, Ulrich Speidel:
On an Alternative Approach to Congestion Detection in Ad Hoc Networks. ISITA 2020: 529-533 - [c29]Sathiamoorthy Manoharan, Ulrich Speidel:
Individualized Assessments using Dividni - Enhancing Learning via Assessments Unique to Every Student. SIGCSE 2020: 1419 - [c28]Sathiamoorthy Manoharan, Ulrich Speidel:
Contract Cheating in Computer Science: A Case Study. TALE 2020: 91-98 - [i2]Daniel Roodt, Ulrich Speidel, Vimal Kumar, Ryan K. L. Ko:
Local Editing in LZ-End Compressed Data. CoRR abs/2007.06167 (2020)
2010 – 2019
- 2019
- [c27]Ulrich Speidel, Lei Qian:
Rethinking TCP and UDP on Shared Satellite Links. GLOBECOM 2019: 1-5 - [c26]Jun O. Seo, Sathiamoorthy Manoharan, Ulrich Speidel:
Steganalysis of Storage-based Covert Channels Using Entropy. ITNAC 2019: 1-6 - [c25]Paul Denny, Sathiamoorthy Manoharan, Ulrich Speidel, Giovanni Russello, Angela Chang:
On the Fairness of Multiple-Variant Multiple-Choice Examinations. SIGCSE 2019: 462-468 - 2018
- [j11]Niko Rebenich, T. Aaron Gulliver, Stephen W. Neville, Ulrich Speidel:
An analog of the prime number theorem for finite fields via truncated polylogarithm expansions. Math. Comput. 87(310): 855-877 (2018) - [j10]Michael J. Dinneen, Ulrich Speidel:
Preface. Nat. Comput. 17(2): 295 (2018) - [c24]Ulrich Speidel, Lei Qian:
Striking a Balance between Bufferbloat and TCP Queue Oscillation in Satellite Input Buffers. GLOBECOM 2018: 1-6 - [c23]T. Aaron Gulliver, Ulrich Speidel, Niko Rebenich:
A Note on Lempel-Ziv Parser Tails and Substring Lengths. ISITA 2018: 550-554 - 2017
- [c22]Ulrich Speidel, Sven Puchinger, Martin Bossert:
Constraints for coded tunnels across long latency bottlenecks with ARQ-based congestion control. ISIT 2017: 271-275 - [c21]Xiaojie Liu, Ulrich Speidel:
Can observed entropy detect congestion in Ad-Hoc networks? ITNAC 2017: 1-6 - 2015
- [c20]Etuate Cocker, Firas Ghazzi, Ulrich Speidel:
Quality trend measurement of long-distance VoIP communication via estimated mean opinion score. ICICS 2015: 1-5 - [c19]Ulrich Speidel:
Classifying distributions via symbolic entropy estimation. ICICS 2015: 1-5 - [c18]Ulrich Speidel, Etuate Cocker, Péter Vingelmann, Janus Heide, Muriel Médard:
Can network coding bridge the digital divide in the pacific? NetCod 2015: 86-90 - [c17]Ulrich Speidel, Lei Qian, Etuate Cocker, Péter Vingelmann, Janus Heide, Muriel Médard:
Can Network Coding Mitigate TCP-induced Queue Oscillation on Narrowband Satellite Links? WISATS 2015: 301-314 - [i1]Ulrich Speidel, Etuate Cocker, Péter Vingelmann, Janus Heide, Muriel Médard:
Can network coding bridge the digital divide in the Pacific? CoRR abs/1506.01048 (2015) - 2014
- [j9]Niko Rebenich, Ulrich Speidel, Stephen W. Neville, T. Aaron Gulliver:
FLOTT - A Fast, Low Memory T-TransformAlgorithm for Measuring String Complexity. IEEE Trans. Computers 63(4): 917-926 (2014) - [c16]Etuate Cocker, Firas Ghazzi, Ulrich Speidel, M.-C. Dong, V. Wong, A. J. Han Vinck, H. Yamamoto, H. Yokoo, Hiroyoshi Morita, Hendrik C. Ferreira, Allan Emleh, R. McFadzien, S. Palelei, Raimund Eimann:
Measurement of buffer requirement trends for real time traffic over TCP. HPSR 2014: 120-124 - [c15]Sathiamoorthy Manoharan, Aquib Master, Ulrich Speidel:
Complexity-based steganalysis. ISITA 2014: 40-44 - [c14]Ulrich Speidel:
An extended similarity distance for use with computable information estimators. ISITA 2014: 304-308 - [c13]Ulrich Speidel, T. Aaron Gulliver, Ali Makhdoumi, Muriel Médard:
Using T-codes as locally decodable source codes. ITW 2014: 217-221 - 2013
- [c12]Etuate Cocker, Ulrich Speidel, Niko Rebenich, Stephen W. Neville, T. Aaron Gulliver, Raimund Eimann, Kashif Nisar, Suhaidi Hassan, Z. Aziz, M.-C. Dong, V. Wong:
Measurement of packet train arrival conditions in high latency networks. ICICS 2013: 1-5 - 2012
- [j8]Ulrich Speidel, T. Aaron Gulliver:
On the Codeword Length Distribution of T-Codes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 95-A(5): 909-917 (2012) - [c11]Ulrich Speidel, T. Aaron Gulliver:
An analytic upper bound on T-complexity. ISIT 2012: 2706-2710 - [c10]T. Aaron Gulliver, Ulrich Speidel:
On the ratio between the maximal T-complexity and the T-complexity of random strings. ISITA 2012: 498-500 - 2011
- [j7]Kazuo Ohzeki, Hiroki Okumura, Yuanyu Wei, Eizaburo Iwata, Ulrich Speidel:
A Lossless re-Encoding of MPEG-2 Coded file by Integrating Four Motion Vectors. Int. J. Comput. Sci. Appl. 8(1): 14-35 (2011) - [c9]Ulrich Speidel:
A forward-parsing randomness test based on the expected codeword length of T-codes. ICICS 2011: 1-5 - [c8]Thokozani Shongwe, Ulrich Speidel, Theo G. Swart, Hendrik C. Ferreira:
The effect of hamming distances on permutation codes for multiuser communication in the power line communications channel. AFRICON 2011: 1-5 - 2010
- [c7]Kazuo Ohzeki, Yuanyu Wei, Eizaburo Iwata, Ulrich Speidel:
Basic Consideration of MPEG-2 Coded File Entropy and Lossless Re-encoding. IMCSIT 2010: 741-748 - [c6]Ulrich Speidel, T. Aaron Gulliver:
A secure authentication system based on variable-length codes. ISITA 2010: 684-689
2000 – 2009
- 2009
- [c5]Ulrich Speidel:
A note on BSD codes constructed from T-codes. ISIT 2009: 2418-2421 - 2008
- [j6]T. Aaron Gulliver, Isaiah Makwakwa, Ulrich Speidel:
On the Generation of Aperiodic and Periodic Necklaces via T-augmentation. Fundam. Informaticae 83(1-2): 91-107 (2008) - 2007
- [c4]Ulrich Speidel, T. Aaron Gulliver:
Synchronizing block codes with a decoder for variable-length codes. ISIT 2007: 1661-1664 - 2005
- [j5]Mark R. Titchener, Radu Nicolescu, Ludwig Staiger, T. Aaron Gulliver, Ulrich Speidel:
Deterministic Complexity and Entropy. Fundam. Informaticae 64(1-4): 443-461 (2005) - [j4]Jia Yang, Ulrich Speidel:
A Fast T-decomposition Algorithm. J. Univers. Comput. Sci. 11(6): 1083-1101 (2005) - [c3]Simon Milne, Ulrich Speidel, Tony Goodman, Vanessa Clark:
Tourism, ICT and Regional Economic Development: The Case of kiwitrails. ENTER 2005: 114-124 - [c2]Jia Yang, Ulrich Speidel:
A T-decomposition algorithm with O(n log n) time and space complexity. ISIT 2005: 23-27 - [c1]Jia Yang, Ulrich Speidel:
String parsing-based similarity detection. ITW 2005: 263-267 - [e1]Michael J. Dinneen, Ulrich Speidel, Desmond P. Taylor:
Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, ITW 2005, Rotorua, New Zealand, August 29 - September 1, 2005. IEEE 2005 [contents]
1990 – 1999
- 1998
- [j3]Ileana Costea, Ulrich Günther, Radu Nicolescu:
Coping with file formats on the Internet. Comput. Commun. 20(16): 1437-1447 (1998) - 1997
- [j2]Ulrich Günther, Peter Hertling, Radu Nicolescu, Mark R. Titchener:
Representing Variable-Length Codes in Fixed-Length T-Depletion Format in Encoders and Decoders. J. Univers. Comput. Sci. 3(11): 1207-1225 (1997) - 1996
- [j1]Ulrich Günther:
Data Compression and Serial Cummunication with Generalized T-Codes. J. Univers. Comput. Sci. 2(11): 769-795 (1996)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
