Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Michael Huber
2010 – today
- 2013
[j12]Andreas Lehrmann, Michael Huber, Aydin Can Polatkan, Albert Pritzkau, Kay Nieselt: Visualizing dimensionality reduction of systems biology data. Data Min. Knowl. Discov. 27(1): 146-165 (2013)
[j11]Peter Hauck, Michael Huber, Juliane Bertram, Dennis Brauchle, Sebastian Ziesche: Efficient Majority-Logic Decoding of Short-Length Reed-Muller Codes at Information Positions. IEEE Transactions on Communications 61(3): 930-938 (2013)- 2012
[j10]Michael Huber: Perfect secrecy systems immune to spoofing attacks. Int. J. Inf. Sec. 11(4): 281-289 (2012)
[j9]Alexander Gruner, Michael Huber: New Combinatorial Construction Techniques for Low-Density Parity-Check Codes and Systematic Repeat-Accumulate Codes. IEEE Transactions on Communications 60(9): 2387-2395 (2012)
[i11]Alexander Gruner, Michael Huber: New Combinatorial Construction Techniques for Low-Density Parity-Check Codes and Systematic Repeat-Accumulate Codes. CoRR abs/1203.6566 (2012)
[i10]
[i9]Peter Hauck, Michael Huber, Juliane Bertram, Dennis Brauchle, Sebastian Ziesche: Efficient Majority-Logic Decoding of Short-Length Reed--Muller Codes at Information Positions. CoRR abs/1212.1139 (2012)- 2011
[j8]Michael Huber: Computational complexity of reconstruction and isomorphism testing for designs and line graphs. J. Comb. Theory, Ser. A 118(2): 341-349 (2011)
[i8]Michael Huber: Efficient Two-Stage Group Testing Algorithms for DNA Screening. CoRR abs/1106.3680 (2011)
[i7]Michael Huber: Information Theoretic Authentication and Secrecy Codes in the Splitting Model. CoRR abs/1112.0038 (2011)- 2010
[j7]Michael Huber: Combinatorial bounds and characterizations of splitting authentication codes. Cryptography and Communications 2(2): 173-185 (2010)
[j6]Michael Huber: Block-transitive designs in affine spaces. Des. Codes Cryptography 55(2-3): 235-242 (2010)
[j5]Michael Huber: On the existence of block-transitive combinatorial designs. Discrete Mathematics & Theoretical Computer Science 12(1): 122-132 (2010)
[j4]Michael Huber: Combinatorial Designs for Authentication and Secrecy Codes. Foundations and Trends in Communications and Information Theory 5(6): 581-675 (2010)
[j3]
[j2]Michael Huber: Almost simple groups with socle Ln(q) acting on Steiner quadruple systems. J. Comb. Theory, Ser. A 117(7): 1004-1007 (2010)
[c4]Falk Brauer, Michael Huber, Gregor Hackenbroich, Ulf Leser, Felix Naumann, Wojciech M. Barczynski: Graph-based concept identification and disambiguation for enterprise search. WWW 2010: 171-180
[i6]Michael Huber: Combinatorial Bounds and Characterizations of Splitting Authentication Codes. CoRR abs/1001.3780 (2010)
[i5]Michael Huber: Computational complexity of reconstruction and isomorphism testing for designs and line graphs. CoRR abs/1006.5892 (2010)
2000 – 2009
- 2009
[c3]Michael Huber: Authentication and secrecy codes for equiprobable source probability distributions. ISIT 2009: 1105-1109
[i4]Michael Huber: Authentication and Secrecy Codes for Equiprobable Source Probability Distributions. CoRR abs/0904.0109 (2009)
[i3]Michael Huber: Constructing Optimal Authentication Codes with Perfect Multi-fold Secrecy. CoRR abs/0912.0597 (2009)- 2008
[c2]
[i2]- 2002
[c1]Michael Huber, Steve King: Towards an Integrated Model Checker for Railway Signalling Data. FME 2002: 204-223- 2001
[j1]Michael Huber: Classification of Flag-Transitive Steiner Quadruple Systems. J. Comb. Theory, Ser. A 94(1): 180-190 (2001)- 2000
[i1]Manfred Schmidt-Schauß, Michael Huber: A Lambda-Calculus with letrec, case, constructors and non-determinism. CoRR cs.PL/0011008 (2000)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-01 23:01 CEST by the dblp team



