2019

  • Robert Leppert and Karl-Heinz Zimmermann.
    Inference in Graded Bayesian Networks.
    In arXiv, January 2019.
    [Abstract] [pdf]

  • Vincent Knapps and Karl-Heinz Zimmermann.
    Distributed Monitoring of Topological Events via Homology.
    In arXiv, January 2019.
    [Abstract] [pdf]

2018

  • Karl-Heinz Zimmermann.
    Computability Theory.
    8. Edition, Hamburg University of Technology, July 2018.
    [Abstract] [pdf] [doi: 10.15480/882.1714]

  • Karl-Heinz Zimmermann.
    Computations in Stochastic Acceptors.
    In arXiv, December 2018.
    [Abstract] [pdf]

  • Daniela Becker.
    LWE-based encryption schemes and their applications in privacy-friendly data aggregation.
    pages 94, TubDok, Hamburg University of Technology, PhD thesis, 2018.
    [doi: 10.15480/882.1720]

  • Daniela Becker, Jorge Guajardo, Karl-Heinz Zimmermann.
    Revisiting Private Stream Aggregation: Lattice-Based PSA.
    In Proceedings of the Network and Distributed System Security Symposium, 2018.
    [doi: 10.14722/ndss.2018.23124]

2017

  • Karl-Heinz Zimmermann.
    Computability Theory.
    7. Edition, Hamburg University of Technology, July 2017.
    [Abstract] [pdf] [doi: 10.15480/882.1401]

  • Karl-Heinz Zimmermann.
    101 Discrete Algebraic Structures - Stack Exchange.
    Hamburg University of Technology, 2017.
    [doi: 10.15480/882.1437]

  • Karl-Heinz Zimmermann, Kashif Hanif.
    Accelerating Viterbi algorithm on graphics processing units.
    In Computing, 2017.
    [doi: 10.1007/s00607-017-0557-6]

  • Daniela Becker, Jorge Guajardo, Karl-Heinz Zimmermann.
    SOMAR: Privacy-Preserving SOcial Media Advertising ARchitecture.
    In Proceedings of the 2017 on Workshop on Privacy in the Electronic Society, pages 21-30, October 2017.
    [doi: 10.1145/3139550.3139563]

  • Daniela Becker, Jorge Guajardo, Karl-Heinz Zimmermann.
    Towards a new privacy-preserving social media advertising architecture.
    In IEEE Conference on Communications and Network Security, pages 450-457, 2017.
    [doi: 10.1109/ CNS.2017.8228712]

  • Sallam Abualhaija, Tristan Miller, Judith Eckle-Kohler, Iryna Gurevych, Karl-Heinz Zimmermann.
    Metaheuristic approaches to lexial substitution and simplification.
    In Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics (EACL), pages 870–880, Association for Computational Linguistics, 2017.
    [doi: 10.18653/v1/E17-1082]

  • Sallam Abualhaija, Nina Tahmasebi, Diane Forin, Karl-Heinz Zimmermann.
    Parameter transfer across domains for word sense disambiguation.
    In Proceedings of Recent Advances in Natural Language Processing (RANLP), 2017.
    [doi: 10.26615/978-954-452-049-6_001]

  • Karl-Heinz Zimmermann.
    Inference and Learning in Stochastic Automata.
    In International Journal of Pure and Applied Mathematics, Vol. 115, No. 3, pages 621-639, 2017.
    [doi: 10.12732/ijpam.v115i3.1]

2016

  • Karl-Heinz Zimmermann.
    Computability Theory.
    6. Edition, Hamburg University of Technology, July 2016.
    [Abstract] [pdf] [doi: 10.15480/882.1309]

  • Sallam Abualhaija, Karl-Heinz Zimmermann.
    D-Bees: A novel method inspired by bee colony optimization for solving word sense disambiguation.
    In Swarm and Evolutionary Computation, Vol. 27, pages 188-195, 2016.
    [doi: 10.1016/j.swevo.2015.12.002]

  • Karl-Heinz Zimmermann.
    Algebraic Statistics.
    3. Edition, Hamburg University of Technology, January 2016.
    [pdf] [doi: 10.15480/882.1273]

2015

  • Karl-Heinz Zimmermann.
    Computability Theory.
    5. Edition, Hamburg University of Technology, July 2015.
    [Abstract] [pdf] [doi: 10.15480/882.1247]

  • Natalia Schmidt.
    Gröbner Bases in Coding Theory.
    pages 180, Dr. Huth Verlag, 2015.
    [doi: ISBN 978-3843921657]

  • Natalia Schmidt, Karl-Heinz Zimmermann.
    Graver bases and universal Gröbner bases for linear codes.
    In IJPAM, Vol. 98, No. 4, pages 419-441, 2015.
    [doi: 10.12732/ijpam.v98i4.2]

2014

  • Muhammad Kashif Hanif.
    Mapping Dynamic Programming Algorithms on Graphics Processing Units.
    Ph.D. Thesis. Hamburg University of Technology, School of Electrical Engineering, Computer Science and Mathematics, Hamburg / Germany, July 2014.
    [Abstract] [pdf] [doi: 10.15480/882.1184]

  • Natalia Dück and Karl-Heinz Zimmermann.
    Heuristic decoding of linear codes using commutative algebra.
    In Designs, Codes and Cryptography (DCC), Vol. 76, No. 1, pages 23-35, Springer, July 2014.
    [Abstract] [doi: 10.1007/s10623-014-0008-8]

  • Karl-Heinz Zimmermann.
    Computability Theory.
    4. Edition, Hamburg University of Technology, July 2014.
    [Abstract] [pdf] [doi: 10.15480/882.1177]

  • Natalia Dück and Karl-Heinz Zimmermann.
    Vector space bases for the homogeneous parts in homogeneous ideals and graded modules over a polynomial ring.
    In International Journal of Pure and Applied Mathematics (IJPAM), Vol. 93, No. 6, pages 835-844, AP, June 2014.
    [Abstract] [pdf] [doi: 10.12732/ijpam.v93i6.9]

  • Natalia Dück and Karl-Heinz Zimmermann.
    Gröbner bases for perfect binary codes.
    In International Journal of Pure and Applied Mathematics (IJPAM), Vol. 91, No. 2, pages 155-167, AP, February 2014.
    [Abstract] [pdf] [doi: 10.12732/ijpam.v91i2.2]

  • Natalia Dück and Karl-Heinz Zimmermann.
    Singleton codes.
    In International Journal of Pure and Applied Mathematics (IJPAM), Vol. 91, No. 3, pages 273-290, AP, January 2014.
    [Abstract] [pdf] [doi: 10.12732/ijpam.v91i3.1]

2013

  • Svetlana Torgasin and Karl-Heinz Zimmermann.
    An all-pairs shortest path algorithm for bipartite graphs.
    In Central European Journal of Computer Science (CEJCS), Vol. 3, No. 4, pages 149-157, De Gruyter Open, December 2013.
    [Abstract] [doi: 10.2478/s13537-013-0110-4]

  • Wolfram Retter.
    Topics in Abstract Order Geometry.
    Ph.D. Thesis. Hamburg University of Technology, School of Electrical Engineering, Computer Science and Mathematics, Hamburg / Germany, September 2013.
    [Abstract] [pdf] [doi: 10.15480/882.1154]

  • Karl-Heinz Zimmermann.
    Computability Theory.
    3. Edition, Hamburg University of Technology, July 2013.
    [Abstract] [pdf] [doi: 10.15480/882.1121]

  • Natalia Dück and Karl-Heinz Zimmermann.
    Universal Gröbner bases for linear codes.
    In International Journal of Pure and Applied Mathematics (IJPAM), Vol. 86, No. 2, pages 345-358, AP, July 2013.
    [Abstract] [pdf] [doi: 10.12732/ijpam.v86i2.9]

  • Natalia Dück and Karl-Heinz Zimmermann.
    Computing generating sets for quaternary codes using Gröbner bases.
    In International Journal of Pure and Applied Mathematics (IJPAM), Vol. 84, No. 1, pages 99-109, AP, April 2013.
    [Abstract] [pdf] [doi: 10.12732/ijpam.v84i1.7]

2012

  • Muhammad Kashif Hanif and Karl-Heinz Zimmermann.
    Graphics card processing: accelerating profile-profile alignment.
    In Central European Journal of Computer Science (CEJCS), Vol. 2, No. 4, pages 367-388, De Gruyter Open, December 2012.
    [Abstract] [doi: 10.2478/s13537-012-0033-5]

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

  • Mehwish Saleemi.
    Coding Theory via Groebner Bases.
    Ph.D. Thesis. Hamburg University of Technology, School of Electrical Engineering, Computer Science and Mathematics, Hamburg / Germany, October 2012.
    [Abstract] [pdf] [doi: 10.15480/882.1081]

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

  • Oscar Mauricio Reyes Torres.
    Neural Synchronization and Light-weight Cryptography in Embedded Systems.
    Ph.D. Thesis. Hamburg University of Technology, School of Electrical Engineering, Computer Science and Mathematics, Shaker, Hamburg / Germany, August 2012.
    [Abstract] [doi: 10.2370/9783844012330]

  • Karl-Heinz Zimmermann.
    Computability Theory.
    2. Edition, Hamburg University of Technology, July 2012.
    [Abstract] [pdf] [doi: 10.15480/882.1064]

  • Wolfgang Kramper, Ralf Wanker and Karl-Heinz Zimmermann.
    Analysis of swarm behavior using compound eye and neural network control.
    In Central European Journal of Computer Science (CEJCS), Vol. 2, No. 1, pages 16-32, De Gruyter Open, March 2012.
    [Abstract] [doi: 10.2478/s13537-012-0004-x]

  • Svetlana Torgasin.
    Graph-based Methods for the Design of DNA Computations.
    Ph.D. Thesis. Hamburg University of Technology, School of Electrical Engineering, Computer Science and Mathematics, Hamburg / Germany, January 2012.
    [Abstract] [pdf] [doi: 10.15480/882.1049]

2011

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

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

  • Karl-Heinz Zimmermann.
    Computability Theory.
    1. Edition, Hamburg University of Technology, July 2011.
    [Abstract] [pdf] [doi: 10.15480/882.1012]

2010

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

  • Cem Savas Bassoy, Svetlana Torgasin, Mei Yang and Karl-Heinz Zimmermann.
    Accelerating Scalar-Product Based Sequence Alignment using Graphics Processor Units.
    In Journal of Signal Processing Systems, Vol. 61, No. 2, pages 117-125, Springer, November 2010.
    [Abstract] [doi: 10.1007/s11265-009-0409-5]

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

  • Oscar Mauricio Reyes and Karl-Heinz Zimmermann.
    Permutation parity machines for neural cryptography.
    In Physical Review E, Vol. 81, No. 6, American Physical Society, June 2010.
    [Abstract] [doi: 10.1103/PHYSREVE.81.066117]

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

  • Wolfgang Kramper.
    Simulation von Schwarmverhalten.
    Mensch & Buch, April 2010.


  • Israel Marck Martinez-Perez, Wolfgang Brandt, Michael Wild and Karl-Heinz Zimmermann.
    Bioinspired Parallel Algorithms for Maximum Clique Problem on FPGA Architectures.
    In Journal of Signal Processing Systems, Vol. 58, No. 2, pages 117-124, Springer, February 2010.
    [Abstract] [doi: 10.1007/s11265-008-0322-3]

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

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

  • Karl-Heinz Zimmermann.
    Und, wie hoch ist Ihre Erdös-Zahl?.
    In Spektrum Magazin, Technische Universität Hamburg-Harburg, 2010.


2009

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


  • Oscar Mauricio Reyes Torres, I. Kopitzke and Karl-Heinz Zimmermann.
    Permutation parity machines for neural synchronization.
    In Journal of Physics A: Mathematical and Theoretical, Vol. 42, No. 19, IOP Publishing, April 2009.
    [Abstract] [doi: 10.1088/1751-8113/42/19/195002]

  • Israel Marck Martinez-Perez and Karl-Heinz Zimmermann.
    Parallel bioinspired algorithms for NP complete graph problems.
    In Journal of Parallel and Distributed Computing (JPDC), Vol. 69, No. 3, pages 221-229, Elsevier, March 2009.
    [Abstract] [doi: 10.1016/j.jpdc.2008.06.014]

  • Israel Marck Martinez-Perez, Karl-Heinz Zimmermann and Zoya Ignatova.
    An autonomous DNA model for finite state automata.
    In International Journal of Bioinformatics Research and Applications (IJBRA), Vol. 5, No. 1, pages 81-96, Inderscience, 2009.
    [Abstract] [doi: 10.1504/IJBRA.2009.022465]

  • Israel Marck Martinez-Perez, Zoya Ignatova and Karl-Heinz Zimmermann.
    Exploiting the Features of the Finite State Automata for Biomolecular Computing.
    In Journal on Recent Patents on DNA & Gene Sequences, Vol. 3, No. 2, pages 130-138, Bentham Science, 2009.
    [Abstract] [doi: 10.2174/187221509788654142]

2008

2007

  • Israel Marck Martinez-Perez.
    Biomolecular Computing Models for Graph Problems and Finite State Automata.
    Ph.D. Thesis. Hamburg University of Technology, School of Electrical Engineering, Computer Science and Mathematics, Hamburg / Germany, December 2007.


  • Karl-Heinz Zimmermann, Zoya Ignatova and Israel Marck Martinez-Perez.
    Rechengen.
    German Patent No. DE102006009000B3, Munich / Germany, September 2007.
    [www]

  • Israel Marck Martinez-Perez, Zoya Ignatova and Karl-Heinz Zimmermann.
    Computational genes: a tool for molecular diagnosis and therapy of aberrant mutational phenotype.
    In BMC Bioinformatics, Vol. 8, No. 365, BioMed Central, September 2007.
    [doi: 10.1186/1471-2105-8-365]

  • Björn Saballus, Markus Volkmer and Sebastian Wallner.
    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, March 2007.
    [Abstract]

2006

  • Israel Marck Martinez-Perez, Zhang Gong, Zoya Ignatova and Karl-Heinz Zimmermann.
    Solving the Maximum Clique Problem via DNA Hairpin Formation.
    Technical Report No. 06.3, Hamburg University of Technology, Computer Engineering Department, Hamburg / Germany, December 2006.
    [pdf] [doi: 10.15480/882.254]

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


  • Karl-Heinz Zimmermann.
    Diskrete Mathematik.
    Books on Demand, August 2006.


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


  • Israel Marck Martinez-Perez, Zoya Ignatova and Karl-Heinz Zimmermann.
    An Autonomous DNA Model for Stochastic Finite State Automata.
    Technical Report No. 06.2, Hamburg University of Technology, Computer Engineering Department, Hamburg / Germany, May 2006.
    [pdf] [doi: 10.15480/882.241]

  • Israel Marck Martinez-Perez, Zoya Ignatova and Karl-Heinz Zimmermann.
    An Autonomous DNA Model for Finite State Automata.
    Technical Report No. 06.1, Hamburg University of Technology, Computer Engineering Department, Hamburg / Germany, May 2006.
    [pdf] [doi: 10.15480/882.240]

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


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


  • Markus Volkmer.
    Entity Authentication and Authenticated Key Exchange with Tree Parity Machines.
    IACR Cryptology ePrint Archive Vol. 112, IACR, March 2006.
    [Abstract] [pdf]

  • Markus Volkmer and Sebastian Wallner.
    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), pages 294-297, Magdeburg / Germany, February 2006.
    [Abstract] [pdf]

2005

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


  • Markus Volkmer and Sebastian Wallner.
    A Key Establishment IP-Core for Ubiquitous Computing.
    In Proceedings of 16th International Workshop on Database and Expert Systems Applications, pages 241-245, Copenhagen / Denmark, August 2005.
    [Abstract] [doi: 10.1109/DEXA.2005.18]

  • Markus Volkmer and Sebastian Wallner.
    Tree Parity Machine Rekeying Architectures for Embedded Security.
    IACR Cryptology ePrint Archive Vol. 235, IACR, July 2005.
    [Abstract] [pdf]

  • Markus Volkmer and Sebastian Wallner.
    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, July 2005.
    [Abstract] [pdf]

  • Markus Volkmer and Sebastian Wallner.
    Tree parity machine rekeying architectures.
    In IEEE Transactions on Computers, Vol. 54, No. 4, pages 421-427, IEEE, April 2005.
    [Abstract] [doi: 10.1109/TC.2005.70]

  • Kolja Elssel and Karl-Heinz Zimmermann.
    Two New Nonlinear Binary Codes.
    In IEEE Transactions on Information Theory, Vol. 51, No. 3, pages 1189-1190, IEEE, March 2005.
    [Abstract] [doi: 10.1109/TIT.2004.842767]

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


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


  • Karl-Heinz Zimmermann.
    Solving constrained combinatorial optimization problems via importance sampling in the grand canonical ensemble.
    In Computer Physics Communications, Vol. 165, No. 3, pages 243-259, Elsevier, February 2005.
    [Abstract] [doi: 10.1016/j.cpc.2004.10.003]

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

2004

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


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

  • Wolfgang Achtziger, Andreas Popp and Karl-Heinz Zimmermann.
    Optimization and Parallelization of Loop Nests via Linear Vector-Valued Schedules.
    Technical Report No. #264, University of Dortmund, Faculty of Mathematics, Dortmund / Germany, June 2004.
    [Abstract]

2003

2002

  • Karl-Heinz Zimmermann.
    Efficient DNA sticker algorithms for NP-complete graph problems.
    In Computer Physics Communications, Vol. 144, No. 3, pages 297-309, Elsevier, April 2002.
    [Abstract] [doi: 10.1016/S0010-4655(02)00270-9]

  • Karl-Heinz Zimmermann.
    On applying molecular computation to binary linear codes.
    In IEEE Transactions on Information Theory, Vol. 48, No. 2, pages 505-510, IEEE, February 2002.
    [Abstract] [doi: 10.1109/18.979325]

2001

  • Andreas Popp and Karl-Heinz Zimmermann.
    On loop transformations of nested loops with affine dependencies.
    In Computer Physics Communications, Vol. 139, No. 1, pages 90-103, Elsevier, September 2001.
    [Abstract] [doi: 10.1016/S0010-4655(01)00232-6]

  • Karl-Heinz Zimmermann and Wolfgang Achtziger.
    Optimal piecewise linear schedules for LSGP- and LPGS-decomposed array processors via quadratic programming.
    In Computer Physics Communications, Vol. 139, No. 1, pages 64-89, Elsevier, September 2001.
    [Abstract] [doi: 10.1016/S0010-4655(01)00231-4]

  • N. Suresh Babu and Karl-Heinz Zimmermann.
    Decoding of linear codes over Galois rings.
    In IEEE Transactions on Information Theory, Vol. 47, No. 4, pages 1599-1603, IEEE, May 2001.
    [Abstract] [doi: 10.1109/18.923743]

2000

  • Wolfgang Achtziger and Karl-Heinz Zimmermann.
    Finding Quadratic Schedules for Affine Recurrence Equations Via Nonsmooth Optimization.
    In Journal of Signal Processing Systems, Vol. 25, No. 3, pages 235-260, Springer, July 2000.
    [Abstract] [doi: 10.1023/A:1008139706909]

  • Thomas Rehfinger, N. Suresh Babu and Karl-Heinz Zimmermann.
    New Good Codes via CQuest - A System for the Silicon Search of Linear Codes.
    In A. Betten, A. Kohnert, R. Laue and A. Wassermann (Eds.): Algebraic Combinatorics and Applications, pages 294-306, Springer, July 2000.
    [Abstract] [doi: 10.1007/978-3-642-59448-9_19]

1999

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


1998

  • Karl-Heinz Zimmermann and Wolfgang Achtziger.
    On Time Optimal Implementation of Uniform Recurrences onto Array Processors via Quadratic Programming.
    In Journal of Signal Processing Systems, Vol. 19, No. 1, pages 19-38, Springer, May 1998.
    [Abstract] [doi: 10.1023/A:1008008231304]

  • Anton Betten, Harald Fripertinger, Adalbert Kerber, Alfred Wassermann and Karl-Heinz Zimmermann.
    Codierungstheorie - Konstruktion und Anwendung linearer Codes.
    Springer, 1998.
    [Abstract] [doi: 10.1007/978-3-642-58973-7]

  • Wolfgang Achtziger and Karl-Heinz Zimmermann.
    Computing time-optimal quadratic schedules for affine recurrence equations.
    Technical Report No. 243, University of Erlangen Nuermberg, Institute of Applied Mathematics, Erlangen / Germany, 1998.


1997

  • Karl-Heinz Zimmermann.
    A Unifying Lattice-Based Approach for the Partitioning of Systolic Arrays via LPGS and LSGP.
    In Journal of Signal Processing Systems, Vol. 17, No. 1, pages 21-41, Springer, September 1997.
    [Abstract] [doi: 10.1023/A:1007944932429]

  • Karl-Heinz Zimmermann and Wolfgang Achtziger.
    Finding Space-Time Transformations for Uniform Recurrences via Branching Parametric Linear Programming.
    In Journal of Signal Processing Systems, Vol. 15, No. 3, pages 259-274, Springer, March 1997.
    [Abstract] [doi: 10.1023/A:1007963228049]

Displaying results 1 to 100 out of 127

Page 1

Page 2

Next >