Institute of Embedded Systems

Menu

2020

  • Merve Cakir and Karl-Heinz Zimmermann (2020). Stochastic Automata over Monoids. arXiv. [Abstract]

  • Merve Cakir and Karl-Heinz Zimmermann (2020). On the Decomposition of Generalized Semiautomata. arXiv. [Abstract]

  • Mehwish Saleemi, Merve Cakir and Karl-Heinz Zimmermann (2020). Dynamic Programming in Topological Spaces. arXiv. [Abstract]

  • Karl-Heinz Zimmermann (2020). On Krohn-Rhodes Theory for Semiautomata. arXiv. [Abstract]

  • Karl-Heinz Zimmermann (2020). Berechenbarkeit. Springer: [Abstract]

  • Karl-Heinz Zimmermann (2020). Computability Theory. TuBib: [Abstract]

2019

  • Karl-Heinz Zimmermann (2019). Computability Theory. Hamburg University of Technology: [Abstract]

  • Karl-Heinz Zimmermann (2019). Curves, Cryptosystems and Quantum Computing. Hamburg University of Technology: [Abstract]

  • Robert Leppert and Karl-Heinz Zimmermann (2019). Inference in Graded Bayesian Networks. arXiv. [Abstract]

  • Vincent Knapps and Karl-Heinz Zimmermann (2019). Distributed Monitoring of Topological Events via Homology. arXiv. [Abstract]

2018

  • Karl-Heinz Zimmermann (2018). Computations in Stochastic Acceptors. arXiv. [Abstract]

  • Karl-Heinz Zimmermann (2018). Computability Theory. Hamburg University of Technology: [Abstract]

2017

  • Karl-Heinz Zimmermann (2017). Computability Theory. Hamburg University of Technology: [Abstract]

2016

  • Karl-Heinz Zimmermann (2016). Computability Theory. Hamburg University of Technology: [Abstract]

  • Sallam Abualhaija, Karl-Heinz Zimmermann (2016). D-Bees: A novel method inspired by bee colony optimization for solving word sense disambiguation. Swarm and Evolutionary Computation. 27. 188-195

2015

  • Karl-Heinz Zimmermann (2015). Computability Theory. Hamburg University of Technology: [Abstract]

2014

  • Muhammad Kashif Hanif (2014). Mapping Dynamic Programming Algorithms on Graphics Processing Units. Hamburg / Germany [Abstract]

  • Natalia Dück and Karl-Heinz Zimmermann (2014). Heuristic decoding of linear codes using commutative algebra. Designs, Codes and Cryptography (DCC). 76. (1), 23-35 [Abstract]

  • Karl-Heinz Zimmermann (2014). Computability Theory. Hamburg University of Technology: [Abstract]

  • Natalia Dück and Karl-Heinz Zimmermann (2014). Vector space bases for the homogeneous parts in homogeneous ideals and graded modules over a polynomial ring. International Journal of Pure and Applied Mathematics (IJPAM). 93. (6), 835-844 [Abstract]

  • Natalia Dück and Karl-Heinz Zimmermann (2014). Gröbner bases for perfect binary codes. International Journal of Pure and Applied Mathematics (IJPAM). 91. (2), 155-167 [Abstract]

  • Natalia Dück and Karl-Heinz Zimmermann (2014). Singleton codes. International Journal of Pure and Applied Mathematics (IJPAM). 91. (3), 273-290 [Abstract]

2013

  • Svetlana Torgasin and Karl-Heinz Zimmermann (2013). An all-pairs shortest path algorithm for bipartite graphs. Central European Journal of Computer Science (CEJCS). 3. (4), 149-157 [Abstract]

  • Wolfram Retter (2013). Topics in Abstract Order Geometry. Hamburg / Germany [Abstract]

  • Karl-Heinz Zimmermann (2013). Computability Theory. Hamburg University of Technology: [Abstract]

  • Natalia Dück and Karl-Heinz Zimmermann (2013). Universal Gröbner bases for linear codes. International Journal of Pure and Applied Mathematics (IJPAM). 86. (2), 345-358 [Abstract]

  • Natalia Dück and Karl-Heinz Zimmermann (2013). Computing generating sets for quaternary codes using Gröbner bases. International Journal of Pure and Applied Mathematics (IJPAM). 84. (1), 99-109 [Abstract]

2012

  • Muhammad Kashif Hanif and Karl-Heinz Zimmermann (2012). Graphics card processing: accelerating profile-profile alignment. Central European Journal of Computer Science (CEJCS). 2. (4), 367-388 [Abstract]

  • Natalia Dück and Karl-Heinz Zimmermann (2012). A variant of the Gröbner basis algorithm for computing Hilbert bases. International Journal of Pure and Applied Mathematics (IJPAM). 81. (1), 145-155 [Abstract]

  • Mehwish Saleemi (2012). Coding Theory via Groebner Bases. Hamburg / Germany [Abstract]

  • Natalia Dück and Karl-Heinz Zimmermann (2012). Standard bases for linear codes. International Journal of Pure and Applied Mathematics (IJPAM). 80. (3), 315-329 [Abstract]

  • Oscar Mauricio Reyes Torres (2012). Neural Synchronization and Light-weight Cryptography in Embedded Systems. Shaker: Hamburg / Germany [Abstract]

  • Karl-Heinz Zimmermann (2012). Computability Theory. Hamburg University of Technology: [Abstract]

  • Wolfgang Kramper, Ralf Wanker and Karl-Heinz Zimmermann (2012). Analysis of swarm behavior using compound eye and neural network control. Central European Journal of Computer Science (CEJCS). 2. (1), 16-32 [Abstract]

  • Svetlana Torgasin (2012). Graph-based Methods for the Design of DNA Computations. Hamburg / Germany [Abstract]

2011

  • Mehwish Saleemi and Karl-Heinz Zimmermann (2011). Groebner bases for linear codes over GF(4). International Journal of Pure and Applied Mathematics (IJPAM). 73. (4), 435-442 [Abstract]

  • Robert Leppert, Mehwish Saleemi and Karl-Heinz Zimmermann (2011). Groebner bases for quaternary codes. International Journal of Pure and Applied Mathematics (IJPAM). 71. (4), 595-608 [Abstract]

  • Karl-Heinz Zimmermann (2011). Computability Theory. Hamburg University of Technology: [Abstract]

2010

  • Mehwish Saleemi and Karl-Heinz Zimmermann (2010). From ideals in polynomial rings to linear codes using Groebner bases. International Journal of Pure and Applied Mathematics (IJPAM). 65. (1), 41-54 [Abstract]

  • Cem Savas Bassoy, Svetlana Torgasin, Mei Yang and Karl-Heinz Zimmermann (2010). Accelerating Scalar-Product Based Sequence Alignment using Graphics Processor Units. Journal of Signal Processing Systems. 61. (2), 117-125 [Abstract]

  • Mehwish Saleemi and Karl-Heinz Zimmermann (2010). Groebner bases for linear codes. International Journal of Pure and Applied Mathematics (IJPAM). 62. (4), 481-491 [Abstract]

  • Oscar Mauricio Reyes and Karl-Heinz Zimmermann (2010). Permutation parity machines for neural cryptography. Physical Review E. 81. (6), [Abstract]

  • Mehwish Saleemi and Karl-Heinz Zimmermann (2010). Linear codes as binomial ideals. International Journal of Pure and Applied Mathematics (IJPAM). 61. (2), 147-156 [Abstract]

  • Wolfgang Kramper (2010). Simulation von Schwarmverhalten. Mensch & Buch:

  • Israel Marck Martinez-Perez, Wolfgang Brandt, Michael Wild and Karl-Heinz Zimmermann (2010). Bioinspired Parallel Algorithms for Maximum Clique Problem on FPGA Architectures. Journal of Signal Processing Systems. 58. (2), 117-124 [Abstract]

  • Mehwish Saleemi and Karl-Heinz Zimmermann (2010). Groebner bases for a class of ideals in commutative polynomial rings. International Journal of Pure and Applied Mathematics (IJPAM). 58. (1), 1-9 [Abstract]

  • Svetlana Torgasin and Karl-Heinz Zimmermann (2010). Algorithm for thermodynamically based prediction of DNA/DNA crosshybridization. International Journal of Bioinformatics Research and Applications (IJBRA). 6. (1), 82-97 [Abstract]

  • Karl-Heinz Zimmermann (2010). Und, wie hoch ist Ihre Erdös-Zahl?. Spektrum Magazin.

2009

  • Oscar Mauricio Reyes Torres and Karl-Heinz Zimmermann (2009). Key exchange protocol using permutation parity machines. In Proceedings of the International Joint Conference on Computational Intelligence (IJCCI) Madeira / Portugal 496-501

  • Oscar Mauricio Reyes Torres, I. Kopitzke and Karl-Heinz Zimmermann (2009). Permutation parity machines for neural synchronization. Journal of Physics A: Mathematical and Theoretical. 42. (19), [Abstract]

  • Israel Marck Martinez-Perez and Karl-Heinz Zimmermann (2009). Parallel bioinspired algorithms for NP complete graph problems. Journal of Parallel and Distributed Computing (JPDC). 69. (3), 221-229 [Abstract]

  • Israel Marck Martinez-Perez, Karl-Heinz Zimmermann and Zoya Ignatova (2009). An autonomous DNA model for finite state automata. International Journal of Bioinformatics Research and Applications (IJBRA). 5. (1), 81-96 [Abstract]

  • Israel Marck Martinez-Perez, Zoya Ignatova and Karl-Heinz Zimmermann (2009). Exploiting the Features of the Finite State Automata for Biomolecular Computing. Journal on Recent Patents on DNA & Gene Sequences. 3. (2), 130-138 [Abstract]

2008

  • Zoya Ignatova, Israel Marck Martinez-Perez and Karl-Heinz Zimmermann (2008). DNA Computing Models. Springer: [Abstract]

2007

  • Israel Marck Martinez-Perez (2007). Biomolecular Computing Models for Graph Problems and Finite State Automata. Hamburg / Germany

  • Karl-Heinz Zimmermann, Zoya Ignatova and Israel Marck Martinez-Perez (2007). Rechengen. Munich / Germany [www]

  • Israel Marck Martinez-Perez, Zoya Ignatova and Karl-Heinz Zimmermann (2007). Computational genes: a tool for molecular diagnosis and therapy of aberrant mutational phenotype. BMC Bioinformatics. 8. (365),

  • Björn Saballus, Markus Volkmer and Sebastian Wallner (2007). Secure Group Communication in Ad-Hoc Networks using Tree Parity Machines. In Proceedings of the 4th Workshop on Mobile Ad-Hoc Networks (WMAN) Bern / Switzerland [Abstract]

2006

  • Israel Marck Martinez-Perez, Zhang Gong, Zoya Ignatova and Karl-Heinz Zimmermann (2006). Solving the Maximum Clique Problem via DNA Hairpin Formation. Hamburg / Germany

  • Karl Tyss (2006). Generatoren für echte Zufallszahlen auf FPGAs für eingebettete Systeme. In Proceedings of Workshop über Kryptographie (5. Krypto-Tag) Kassel / Germany 4

  • Karl-Heinz Zimmermann (2006). Diskrete Mathematik. Books on Demand:

  • Andreas Ruttor and Markus Volkmer (2006). Theorie und Anwendungen von Tree Parity Machines für die Kryptographie. In Proceedings of Workshop über Kryptographie (Kryptowochenende 2006) Mannheim / Germany 20-22

  • Israel Marck Martinez-Perez, Zoya Ignatova and Karl-Heinz Zimmermann (2006). An Autonomous DNA Model for Stochastic Finite State Automata. Hamburg / Germany

  • Israel Marck Martinez-Perez, Zoya Ignatova and Karl-Heinz Zimmermann (2006). An Autonomous DNA Model for Finite State Automata. Hamburg / Germany

  • Sascha Mühlbach, Markus Volkmer and Sebastian Wallner (2006). Encrypted and Authenticated Communication via Tree-Parity Machines in AMBA Bus Systems. In Proceedings of Workshop über Kryptographie (4. Krypto-Tag) Bochum / Germany 10

  • Markus Volkmer (2006). On proving Completeness, Soundness and Security of Authenticated Tree Parity Machine Key Exchange. In Proceedings of Workshop über Kryptographie (4. Krypto-Tag) Bochum / Germany 5

  • Markus Volkmer (2006). Entity Authentication and Authenticated Key Exchange with Tree Parity Machines. IACR: [Abstract]

  • Markus Volkmer and Sebastian Wallner (2006). Ein IP-Core Design für Schlüsselaustausch, Stromchiffre und Identifikation auf ressourcenbeschränkten Geräten. In Proceedings of Sicherheit - Schutz und Zuverlässigkeit (SICHERHEIT 2006) Magdeburg / Germany 294-297 [Abstract]

2005

  • Markus Volkmer and Florian Grewe (2005). Runners, Starting Lines and Mutual Distances: On the Security of Tree Parity Machine Key Exchange. In Proceedings of Workshop über Kryptographie (3. Krypto-Tag) Darmstadt / Germany 5

  • Markus Volkmer and Sebastian Wallner (2005). A Key Establishment IP-Core for Ubiquitous Computing. In Proceedings of 16th International Workshop on Database and Expert Systems Applications Copenhagen / Denmark 241-245 [Abstract]

  • Markus Volkmer and Sebastian Wallner (2005). Tree Parity Machine Rekeying Architectures for Embedded Security. IACR: [Abstract]

  • Markus Volkmer and Sebastian Wallner (2005). Lightweight Key Exchange and Stream Cipher based solely on Tree Parity Machines. In Proceedings of the ECRYPT Workshop on RFID and Lightweight Crypto Graz / Austria [Abstract]

  • Markus Volkmer and Sebastian Wallner (2005). Tree parity machine rekeying architectures. IEEE Transactions on Computers. 54. (4), 421-427 [Abstract]

  • Kolja Elssel and Karl-Heinz Zimmermann (2005). Two New Nonlinear Binary Codes. IEEE Transactions on Information Theory. 51. (3), 1189-1190 [Abstract]

  • Björn Saballus (2005). Secure Group Communication in WLAN Ad-Hoc Networks with Tree Parity Machines. In Proceedings of Workshop über Kryptographie (2. Krypto-Tag) Ulm / Germany 12

  • Nazita Behroozi (2005). Immediate Rekeying by Tree Parity Machines in a WLAN-System. In Proceedings of Workshop über Kryptographie (2. Krypto-Tag) Ulm / Germany 10

  • Karl-Heinz Zimmermann (2005). Solving constrained combinatorial optimization problems via importance sampling in the grand canonical ensemble. Computer Physics Communications. 165. (3), 243-259 [Abstract]

  • Israel Marck Martinez-Perez, Zhang Gong, Zoya Ignatova and Karl-Heinz Zimmermann (2005). Biomolecular autonomous solution of the Hamiltonian path problem via hairpin formation. International Journal of Bioinformatics Research and Applications (IJBRA). 1. (4), 389-398 [Abstract]

2004

  • André Schaumburg (2004). Authentication within Tree Parity Machine Rekeying. In Proceedings of Workshop über Kryptographie (1. Krypto-Tag) Mannheim / Germany 13

  • Markus Volkmer and Sebastian Wallner (2004). A Low-Cost Solution for Frequent Symmetric Key Exchange in Ad-hoc Networks. In Proceedings of the Workshop Mobile Ad-hoc Netzwerke (WMAN) Ulm / Germany 128-132 [Abstract]

  • Wolfgang Achtziger, Andreas Popp and Karl-Heinz Zimmermann (2004). Optimization and Parallelization of Loop Nests via Linear Vector-Valued Schedules. Dortmund / Germany [Abstract]

2003

  • Karl-Heinz Zimmermann (2003). A Special Purpose Array Processor Architecture for the Molecular Dynamics Simulation of Point-Mutated Proteins. Journal of Signal Processing Systems. 35. (3), 297-309 [Abstract]

  • Karl-Heinz Zimmermann (2003). An Introduction to Protein Informatics. Kluwer Academic Publishers: [Abstract]

2002

  • Karl-Heinz Zimmermann (2002). Efficient DNA sticker algorithms for NP-complete graph problems. Computer Physics Communications. 144. (3), 297-309 [Abstract]

  • Karl-Heinz Zimmermann (2002). On applying molecular computation to binary linear codes. IEEE Transactions on Information Theory. 48. (2), 505-510 [Abstract]

2001

  • Andreas Popp and Karl-Heinz Zimmermann (2001). On loop transformations of nested loops with affine dependencies. Computer Physics Communications. 139. (1), 90-103 [Abstract]

  • Karl-Heinz Zimmermann and Wolfgang Achtziger (2001). Optimal piecewise linear schedules for LSGP- and LPGS-decomposed array processors via quadratic programming. Computer Physics Communications. 139. (1), 64-89 [Abstract]

  • Karl-Heinz Zimmermann and Wolfgang Achtziger (2001). Optimal piecewise linear schedules for LSGP- and LPGS-decomposed array processors via quadratic programming. Computer Physics Communications. 139. (1), 64-89 [Abstract]

  • N. Suresh Babu and Karl-Heinz Zimmermann (2001). Decoding of linear codes over Galois rings. IEEE Transactions on Information Theory. 47. (4), 1599-1603 [Abstract]

2000

  • Wolfgang Achtziger and Karl-Heinz Zimmermann (2000). Finding Quadratic Schedules for Affine Recurrence Equations Via Nonsmooth Optimization. Journal of Signal Processing Systems. 25. (3), 235-260 [Abstract]

  • Thomas Rehfinger, N. Suresh Babu and Karl-Heinz Zimmermann (2000). New Good Codes via CQuest - A System for the Silicon Search of Linear Codes. Springer: [Abstract]

1999

  • Thomas Rehfinger, N. Suresh Babu and Karl-Heinz Zimmermann (1999). Parallelizing the Search for Good Linear Codes. In Proceedings of Workshop zur Architektur von Rechensystemen Jena / Germany 203-210

1998

  • Karl-Heinz Zimmermann and Wolfgang Achtziger (1998). On Time Optimal Implementation of Uniform Recurrences onto Array Processors via Quadratic Programming. Journal of Signal Processing Systems. 19. (1), 19-38 [Abstract]

  • Anton Betten, Harald Fripertinger, Adalbert Kerber, Alfred Wassermann and Karl-Heinz Zimmermann (1998). Codierungstheorie - Konstruktion und Anwendung linearer Codes. Springer: [Abstract]

  • Wolfgang Achtziger and Karl-Heinz Zimmermann (1998). Computing time-optimal quadratic schedules for affine recurrence equations. Erlangen / Germany

1997

  • Karl-Heinz Zimmermann (1997). A Unifying Lattice-Based Approach for the Partitioning of Systolic Arrays via LPGS and LSGP. Journal of Signal Processing Systems. 17. (1), 21-41 [Abstract]

  • Karl-Heinz Zimmermann and Wolfgang Achtziger (1997). Finding Space-Time Transformations for Uniform Recurrences via Branching Parametric Linear Programming. Journal of Signal Processing Systems. 15. (3), 259-274 [Abstract]

  • Wolfgang Achtziger and Karl-Heinz Zimmermann (1997). Optimal Polynomial Schedules: An Approach via Non-smooth Optimization. In Proceedings of the First International Workshop on Approximate Reasoning in Scheduling (ARS) Zurich / Switzerland

1996

  • Karl-Heinz Zimmermann (1996). Linear mappings ofn-dimensional uniform recurrences ontok-dimensional systolic arrays. Journal of Signal Processing Systems. 12. (2), 187-202 [Abstract]

  • Karl-Heinz Zimmermann (1996). On generalizations of repeated-root cyclic codes. IEEE Transactions on Information Theory. 42. (2), 641-649 [Abstract]

Eintrag 1-100 von 126
12