Karl-Heinz Zimmermann
Affiliations:- Hamburg-Harburg University of Technology, Institute of Computer Technology
According to our database1,
Karl-Heinz Zimmermann
authored at least 49 papers
between 1988 and 2022.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on id.loc.gov
-
on d-nb.info
-
on tuhh.de
-
on isni.org
On csauthors.net:
Bibliography
2022
Accelerating all-pairs shortest path algorithms for bipartite graphs on graphics processing units.
Multim. Tools Appl., 2022
2021
2020
2019
2018
Proceedings of the 25th Annual Network and Distributed System Security Symposium, 2018
2017
Proceedings of the 2017 on Workshop on Privacy in the Electronic Society, Dallas, TX, USA, October 30, 2017
Proceedings of the International Conference Recent Advances in Natural Language Processing, 2017
Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics, 2017
Towards a new privacy-preserving social media advertising architecture (invited position paper).
Proceedings of the 2017 IEEE Conference on Communications and Network Security, 2017
2016
D-Bees: A novel method inspired by bee colony optimization for solving word sense disambiguation.
Swarm Evol. Comput., 2016
2015
Des. Codes Cryptogr., 2015
2014
2013
Central Eur. J. Comput. Sci., 2013
2012
Central Eur. J. Comput. Sci., 2012
Central Eur. J. Comput. Sci., 2012
2010
J. Signal Process. Syst., 2010
J. Signal Process. Syst., 2010
Int. J. Bioinform. Res. Appl., 2010
2009
J. Parallel Distributed Comput., 2009
Int. J. Bioinform. Res. Appl., 2009
Key Exchange Protocol using Permutation Parity Machines.
Proceedings of the IJCCI 2009, 2009
2007
Computational genes: a tool for molecular diagnosis and therapy of aberrant mutational phenotype.
BMC Bioinform., 2007
2005
Biomolecular autonomous solution of the Hamiltonian path problem via hairpin formation.
Int. J. Bioinform. Res. Appl., 2005
Solving constrained combinatorial optimization problems via importance sampling in the grand canonical ensemble.
Comput. Phys. Commun., 2005
2003
A Special Purpose Array Processor Architecture for the Molecular Dynamics Simulation of Point-Mutated Proteins.
J. VLSI Signal Process., 2003
2002
IEEE Trans. Inf. Theory, 2002
2001
2000
Finding Quadratic Schedules for Affine Recurrence Equations Via Nonsmooth Optimization.
J. VLSI Signal Process., 2000
1999
Parallelizing the Search for Good Linear Codes.
Proceedings of the Workshops zur Architektur von Rechensystemen, 1999
1998
On Time Optimal Implementation of Uniform Recurrences onto Array Processors via Quadratic Programming.
J. VLSI Signal Process., 1998
1997
Finding Space-Time Transformations for Uniform Recurrences via Branching Parametric Linear Programming.
J. VLSI Signal Process., 1997
A Unifying Lattice-Based Approach for the Partitioning of Systolic Arrays via LPGS and LSGP.
J. VLSI Signal Process., 1997
1996
Linear mappings of<i>n</i>-dimensional uniform recurrences onto<i>k</i>-dimensional systolic arrays.
J. VLSI Signal Process., 1996
Synthesizing Regular Arrays from Single Affine Recurrences via Quadratic and Branching Parametric Linear Programming.
Proceedings of the Parcella 1996, 1996
1994
On Weight Spaces of Polynomial Representations of the General Linear Group as Linear Codes.
J. Comb. Theory, Ser. A, 1994
1993
J. VLSI Signal Process., 1993
1992
The Weight Distribution of Indecomposable Cyclic Codes over 2-Groups.
J. Comb. Theory, Ser. A, 1992
1991
1990
1988
Proceedings of the Parcella '88, 1988