2013

  • M. May, F. Mayer-Lindenberg: modHDL - A modular and expandable language for developing synchronous hardware, ReConFig'13, Cancun/Mexiko, 2013
  • M. Saleemi, K.-H. Zimmermann: Minimal decompositions of linear codes, submitted.
  • N. Dück, K.-H. Zimmermann: On binomial ideals associated to linear codes, submitted
  • S. Torgasin, K.-H. Zimmermann: An all-pairs shortest path algorithm for bipartite graphs, Central European J. Comp. Sci., to appear.
  • N. Dück, K.-H. Zimmermann: Singleton codes, Int. J. Pure Appl. Math., to appear.
  • N. Dück, K.-H. Zimmermann: Gröbner bases for perfect binary codes, Int. J. Pure Appl. Math., to appear.
  • K.-H. Zimmermann: Computability Theory, TU Hamburg, urn:nbn:de:gvb:830-tubdok-12189, 3rd edition, 2013.
  • W. Retter: Topics in Abstract Order Geometry, PhD thesis, Verlag Dr. Hut, 2013.
  • N. Dück, K.-H. Zimmermann: Universal Gröbner bases for linear codes, Int. J. Pure Appl. Math., vol. 86, no. 2, 345-358, 2013.
  • N. Dück, K.-H. Zimmermann: Computing generating sets for quaternary codes using Gröbner bases, Int. J. Pure Appl. Math., vol. 84, no. 1, 99-109, 201
  • D. Sitzmann, D.P.F. Möller, K. Becker and H. Richter: TIO - A Software Toolset for Mobile Learning in MINT Disciplines, Proceedings of the 9th International Conference on ICT in Education, Research and Industrial Applications: Integration, Harmonization and Knowledge Transfer (ICTERI 2013), Kherson, Ukraine, June 19-22, 2013, pp. 424-435, edited by Vadim Ermolayev, Heinrich C. Mayr, Mykola Nikichenko, Aleksander Spivakowsky, Grygoriy Zholtkevych, Mikhail Zavileysky, Hennadiy Kravtsov, Vitaliy Kobets, Vladimir Peschanenko, published on CEUR-WA: 13-Jun-2013, ONLINE: http://ceur-ws.org/Vol-1000/, URN: urn:nbn:de:0074-1000-9,  ftp://SunSITE.Informatik.RWTH-Aachen.DE/pub/publications/CEUR-WS/Vol-1000.zip,  June 2013.

2012

  • M.K. Hanif, K.-H. Zimmermann: GPU algorithms for profile-profile alignment, Central European J. Comp. Sci., vol. 2, no. 4, 367-388, 2012.
  • N. Dück, K.-H. Zimmermann: A variant of the Gröbner basis algorithm for computing Hilbert bases, Int. J. Pure Appl. Math, vol. 81, no. 1, 145-156, 2012.
  • K.-H. Zimmermann: Computability Theory, TU Hamburg, URN:urn:nbn:de:gbv:830-tubdok-11600, 2012.
  • N. Dück, K.-H. Zimmermann: Standard bases for linear codes, Int. J. Pure Appl. Math, vol. 80, no. 3, 315-330, 2012.
  • O. Reyes: Neural synchronization and light-weight cryptography in embedded systems, PhD thesis, Shaker, 2012.
  • W. Kramper, R. Wanker, K.-H. Zimmermann: Swarm simulation using intelligent agents based on neural networks. Central European J. Comp. Sci., vol. 2, no. 1, 16-32, 2012.
  • M. Saleemi: Algebraic coding via Groebner bases, PhD thesis, Verlag Dr. Hut, 2012.
  • S. Torgasin: Graph-based Methods for the Design of DNA computations, PhD thesis, mbv Berlin, 2012.
  • P. Batra: Deriving inequalities in the Laguerre-Polya class from properties of half-plane mappings. In 'Inequalities and Applications `10', vol.161 of ISNM, Birkhäuser, Basel.
  • J. Lampe, C. Bassoy: Fast reconstruction in magnetic particle imaging. Physics in Medicine and Biology, Vol. 57, No. 4, 2012.
  • Mayer-Lindenberg: A Modular Processor Architecture for High-Performance Computing Applications on FPGA, CDES`12, Conference on Computer Design, Las Vegas, USA

2011

2010

2009

2008

  • P. Batra: Newton's method and the computational complexity of the fundamental theorem of algebra. Electronic Notes in Theoretical Computer Science (ENTCS).
  • A.Hanoun, F. Mayer-Lindenberg, B.Soudan: Reconfigurable cell architecture for systolic and pipelined computing datapaths. Reconfig08, Mexico.
  • I. Martinez-Perez, Z. Ignatova, K.-H. Zimmermann: DNA Computing Models. Springer, 300 p.
  • I. Martinez-Perez, Z. Ignatova, K.-H. Zimmermann: Computational genes. Wikipedia.

2007

  • P. Batra: On Goldberg's constant A_2. Computational Methods and Function Theory Vol. 7, No.1, pp.33-41.
  • A. Hanoun, H. Manteuffel, F. Mayer-Lindenberg, W. Galjan: Architecture of a pipelined datapath coarse-grain reconfigurable coprocessor array. IEEE Int Conf Signal Proc Comm, Dubai, United Arab Emirates.
  • I. Martinez-Perez: Biomolecular Computing Models for Graph Problems and Finite State Automata. PhD thesis, mbv Berlin.
  • I. Martinez-Perez, Z. Ignatova, K.-H. Zimmermann: Rechengene. Deutsches Patent.
  • I. Martinez-Perez, Z. Ignatova, K.-H. Zimmermann: Computational genes: A tool for molecular diagnosis and therapy of aberrant mutational phenotype. BMC Bioinformatics, 8:365.
  • B. Saballus, M. Volkmer, S. Wallner: Secure group communication in ad-hoc networks using tree parity machines. Proc. 4th Workshop on Mobile Ad-Hoc Networks (WMAN), Bern, Schweiz.
  • F. Mayer-Lindenberg: A design language supporting mixed processor and FPGA systems. 10. Workshop, Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen, ISBN 978-3-8322-5945-3, Shaker.

2006

  • W. Adi, A. Hanoun, R. Ernst, B. Soudan : VLSI design exchange with intellectual property protection in FPGA environment using both secret and public-key cryptography. ISVLSI, Karlsruhe, Germany.
  • A. Hanoun, W. Adi, F. Mayer-Lindenberg, B. Soudan: Fuzzy modular multiplication architecture and low complexity IPR-protection for FPGA technology. ICFPT, Bangkok, Thailand.
  • P. Batra: Some Applications of Complex Analysis to Questions of Stability and Stabilizability, Habilitationsschrift, TUHH.
  • P. Batra: Subordination and stabilization of plant families. Proc. IFAC Symposium RoConD 06, IFAC Symposium Robust Control '06 - Toulouse.
  • P. Batra: Necessary stability conditions for differential-difference systems. GAMM, Berlin.
  • P. Batra: On upper bounds for proportional stabilizing controllers. ZAMM 86, 78-84.
  • A. Hanoun, W. Galjan, W.H. Krautschneider, F. Mayer-Lindenberg: Distributed processor network on single chip. ProRISC Workshop, Veldhoven (The Netherlands).
  • F. Grewe, P. Owotoki: Automated model selection with AMSF in a production process of the automotive industry. 15th Workshop on Knowledge Discovery, Data Mining, and Machine Learning (KDML) Hildesheim, Germany.
  • I. Martinez-Perez, Z. Ignatova, K.-H. Zimmermann: An autonomous DNA model for finite state automata. Techn. Report, 06.1, TUHH.
  • I. Martinez-Perez, Z. Ignatova, K.-H. Zimmermann: Solving the maximum clique problem via DNA haiprin formation. Techn. Report, 06.3, TUHH.
  • I. Martinez-Perez, Z. Ignatova, Z. Gong, K.-H. Zimmermann: Solving the Hamiltonian path problem via DNA hairpin formation. Int. J. Bioinformatics Research Applications, 1, 389-398.
  • I. Martinez-Perez, Z. Ignatova, K.-H. Zimmermann: An autonomous DNA model for stochastic finite state automata. Techn. Report, 06.2, TUHH.
  • P. Owotoki, N. Manojlovic, F. Mayer-Lindenberg, E. Pasche: A Data Mining Approach for Capacity Building of Stakeholders in Integrated Flood Management, The Sixth IEEE International Conference on Data Mining (ICDM) Hong Kong, China.
  • P. Owotoki, F. Mayer-Lindenberg: Transparency of computational intelligence models. 26th SGAI Int Conf Innovative Techniques Applications of Artificial Intelligence, Cambridge, UK.
  • S. Mühlbach, M. Volkmer, S. Wallner: Encrypted and authenticated communication via tree-parity machines in AMBA bus systems. 4. Krypto-Tag der Gesellschaft für Informatik e.V. - Fachgruppe KRYPTO, Ruhr-Universität Bochum, Horst-Görtz-Institut für IT-Sicherheit, Technical Report No. NDS-1/06, Ulrich Greveler (Hrsg.), p.10.
  • A. Ruttor, M. Volkmer: Theorie und Anwendungen von Tree Parity Machines für die Kryptographie, Kryptowochenende 2006 - Workshop über Kryptographie, Gesellschaft für Informatik e.V. - Fachgruppe KRYPTO 2006, Universität Mannheim, Institut für Informatik, Technical Report TR-2006-013, Reihe Informatik, Frederik Armknecht, Dirk Stegemann (Hrsg.), 20-22
  • K. Tyss: Generatoren für echte Zufallszahlen auf FPGAs für eingebettete Systeme. 5. Krypto-Tag Gesellschaft für Informatik e.V. - Fachgruppe KRYPTO 2006, Universität Kassel, Fachbereich Mathematik/Informatik, Mathematische Schriften Kassel 06/06, Heiko Stamer (Hrsg.), p.4.
  • M. Volkmer, S. Wallner: Ein IP-Core Design für Schlüsselaustausch, Stromchiffre und Identifikation auf ressourcenbeschränkten Geräten. Workshop Kryptographie in Theorie und Praxis, LNCI, Vol. P-770, 294-298.
  • M. Volkmer: On proving completeness, soundness and security of authenticated tree parity machine key exchange. 4. Krypto-Tag der Gesellschaft für Informatik e.V. - Fachgruppe KRYPTO 2006, Ruhr-Universität Bochum, Horst-Görtz-Institut für IT-Sicherheit, Technical Report No. NDS-1/06, Ulrich Greveler (Hrsg.), p.5.
  • M. Volkmer: Entity Authentication and Authenticated Key Exchange with Tree Parity Machines, http://eprint.iacr.org/2006/112.
  • M. Volkmer: A pulsed neural network model of spectro-temporal receptive fields and its application to speech enhancement. Dissertation, Hamburg University of Technology, Mensch und Buch Verlag, Berlin, ISBN 3-86664-155-9 / 978-3-86664-155-6.
  • K.-H. Zimmermann: Diskrete Mathematik, BoD, Norderstedt, 300 S.
  • F. Mayer-Lindenberg: Design and application of a scalable embedded systems architecture and related OS support. DSD 2006, Cavtat, Kroatien.
  • V. Beller, F. Mayer-Lindenberg: A floating point processor arry supporting a high-precision dot product. ICFPT 2006.

2005

  • M. Volkmer, S. Wallner, K.-H. Zimmermann: Tree Parity Machines - Ein Verfahren zum sicheren Datentransfer mittels neuronaler Netze. Deutsches Patent.
  • K.-H. Zimmermann: Solving constrained combinatorial optimization problems via importance sampling in the grand canonical ensemble. Comp Phys Comm, 165, 243-259.
  • K. Elssel, K.-H. Zimmermann: Two new nonlinear binary codes. IEEE Trans Inform Theory, 51, 1189-1190.
  • I. Martinez-Perez, Z. Ignatova, K.-H. Zimmermann: Self assembly of DNA molecules. Techn. Report, 05.1, TUHH.
  • I. Martinez-Perez, Z. Ignatova, K.-H. Zimmermann: A programmable computing machine operating autonomously at the molecular scale. Techn. Report, 05.2 , TUHH.
  • P. Batra: Value-restricted functions and robust control requirements. GAMM, Luxemburg.
  • B. Soudan, W. Adi, A. Hanoun: Novel secret-key IPR protection in FPGA environment. SOC Conf Proc IEEE Int.
  • B. Soudan, W. Adi, A. Hanoun: Customer-IP provider centric secret-key IPR protection for FPGA IP cores. IEEE 2005 Conf Field-Programmable Technology (FPT).
  • S. Wallner: Micro-task Processing in heterogeneous reconfigurable systems. J Comp Sci Techn (JCST), Special Section on Advanced Computer Systems Architecture (ACSAC), Vol. 20, No. 5, pp. 624-634.
  • S. Wallner: A configurable system-on-chip architecture for embedded and real-time applications: concepts, design and realization. J Syst Arch, 51, 350-367.
  • M. Volkmer, S. Wallner: Tree parity machine rekeying architectures. IEEE Trans Comp, 54, 421-427.
  • M. Volkmer, S. Wallner: A Key Establishment IP-Core for Ubiquitous Computing, Proceedings of the 1st International Workshop on Secure and Ubiquitous Networks, SUN'05 , Copenhagen Business School, Copenhagen, Denmark, IEEE Computer Society, pp. 241-245, ISBN 0-7695-2424-9.
  • M. Volkmer, S. Wallner: Lightweight Key Exchange and Stream Cipher based solely on Tree Parity Machines, ECRYPT (European Network of Excellence for Cryptology) Workshop on RFID and Lightweight Crypto, Graz University of Technology, Graz, Austria pp. 102-113.
  • P. Owotoki, F. Mayer-Lindenberg: Degree of Confidence Measure for Integrating Non Monolithic Intelligence Models. in Proc. of the 3rd International Conference on Computational Intelligence, Robotics and Autonomous Systems (CIRAS), Singapore.
  • P. Owotoki: Embedded Intelligence in Wireless Sensor Networks, in Proc. of the Wireless Congress 2005, ZVEI Elektronika, Munich.
  • P. Owotoki, F. Mayer-Lindenberg: Comprehensible Hierarchical Intelligent (CHI) Framework for Monitoring and Preventive Maintenance of Aircraft Systems, in Proceedings of the 3rd IEEE WISES, Hamburg.
  • M. Volkmer, F. Grewe: Runners, Starting Lines and Mutual Distances: On the Security of Tree Parity Machine Key Exchange, 3. Krypto-Tag der Gesellschaft für Informatik e.V. - Fachgruppe KRYPTO 2005, Technische Universität Darmstadt, Fachbereich Informatik, Technical Report No. TI-1/05, Ralf-Philipp Weinmann ed., p.5.
  • B. Saballus: Secure Group Communication in WLAN Ad-Hoc Networks with Tree Parity Machines, 2. Krypto-Tag der Gesellschaft für Informatik e.V. - Fachgruppe KRYPTO 2005, Universität Ulm, Ulmer Informatik-Berichte Nr. 2005-02, K.U.Leuven, Technical Report ESAT-COSIC 2005-CW-1, Wolfgang Lindner and Christopher Wolf eds. , p.12.
  • N. Behroozi: Immediate Rekeying by Tree Parity Machines in a WLAN-System, 2. Krypto-Tag der Gesellschaft für Informatik e.V. - Fachgruppe KRYPTO 2005, Universität Ulm, Ulmer Informatik-Berichte Nr. 2005-02, K.U.Leuven, Technical Report ESAT-COSIC 2005-CW-1, Wolfgang Lindner and Christopher Wolf eds. , p.10.
  • M. Volkmer, S. Wallner: Tree Parity Machine Rekeying Architectures for Embedded Security, 2005.
  • M. Volkmer, S. Wallner: Lightweight Key Exchange and Stream Cipher based solely on Tree Parity Machines, ECRYPT (European Network of Excellence for Cryptology) Workshop on RFID and Lightweight Crypto, Graz University of Technology, Graz, Austria, pp. 102-113.
  • M. Volkmer: Theoretical Analysis of a Time-Frequency-PCNN Auditory Cortex Model, The International Journal of Neural Systems, 15 (5), World Scientific Publishing Co. Pte Ltd, pp. 339-348.

2004

  • W. Achtziger, K.-H. Zimmermann: Optimization and parallelization of loop nests via linear vector-valued schedules. Techn. Report, No. 264, Uni Dortmund, 2004.
  • P. Batra: Bound for all coefficient diameters of real Schur-stable interval polynomials, IEEE Transactions on Automatic Control, vol.49, no.10, pp.1851-1852, 2004.
  • P. Batra: On Small Circles Containing the Zeros and Ones of Analytic Functions, Complex Variables: Theory and Applications, vol.49, no.11, pp.787-791, 2004.
  • P. Batra: Real interpolating units via positive functions, Proc. MTNS 2004, LEUWEN, BELGIUM, 2004.
  • P. Batra: A property of the nearly optimal root-bound, Journal of Computational and Applied Mathematics, vol.167 (2),pp.489-491, 2004.
  • M. Volkmer, S. Wallner: A Low-Cost Solution for Frequent Symmetric Key Exchange in Ad-hoc Networks, Proc. of the 2nd German Workshop on Mobile Ad-hoc Networks, WMAN 2004, Beiträge der 34. Jahrestagung der Gesellschaft für Informatik e.V. (GI)GI Jahrestagung Informatik 2004, 2. Deutscher Workshop über Mobile Ad-hoc Netzwerke (WMAN 2004), Ulm, Germany, 2004.
  • S. Wallner: A Configurable System-on-Chip Architecture for Embedded Devices, Ninth Asia-Pacific Computer Systems Architecture Conference (ACSAC'2004), Beijing, China, Sep. 7-9, Lecture Notes in Computer Science 3189, pp. 58-71, Springer, 2004.
  • S. Wallner: Configurable System-on-Chip Architecture with Descriptors for Dynamic Reconfiguration, In Proceedings of the 3rd International Conference on Embedded Systems and Applications (ESA'04), CSREA Press, Las Vegas, Volume 1, pp. 157-163, 2004.
  • S. Wallner: Design Methodology of a Configurable System-on-Chip Architecture, Proceedings of IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM'04), Computer Society Press, Napa, CA, 2004.
  • P.Owotoki, A. Grimm: Convergence of clients of communications systems, in Proc. of the International Wireless Congress 2004: Systems & Applications, ZVEI Elektronika, ICM Munich, 2004.
  • A. Schaumburg: Authentication within Tree Parity Machine Rekeying, 1. Krypto-Tag der Gesellschaft für Informatik e.V. - Fachgruppe KRYPTO 2004, Universität Mannheim, Reihe Informatik, Technical Report TR 2004-10, Stefan Lucks and Christopher Wolf eds. , p.13, 2004.
  • M. Volkmer: A pulsed neural network model of spectro-temporal receptive fields and population coding in auditory cortex (extended version), Natural Computing - An International Journal, 3 (2), Kluwer Academic Publishers, pp. 177-193, 2004.

2003

  • K.-H. Zimmermann: An Introduction to Protein Informatics. Kluwer, Boston, 304 p., 2003.
  • K.-H. Zimmermann: A special purpose array processor architecture for the molecular dynamics simulation of point-mutated proteins. J Sig Proc Syst, 35, 297-309, 2003.
  • P. Batra: On coefficient diameters of real Schur-stable interval polynomials, Proc. IFAC Symposium RoCoND 03, IFAC Symposium Robust Control New Developments '03 - Milano, Junio, 25-27, Robust Control Design 2003, Editors: S. Bittanti & P. Colaneri, Elsevier Ltd 2004. pp.259-262, 2003.
  • P. Batra: On upper bounds for real proportional stabilising controllers, Proc. ECC '03, European Control Conference '03 - Cambridge, 2003.
  • P. Batra: On necessary conditions for real robust Schur-stability , IEEE Transactions on Automatic Control, vol. 48, no. 2, pp. 259-261, 2003.
  • S. Wallner: A Reconfigurable Multi-threaded Architecture Model", Eighth Asia-Pacific Computer Systems Architecture Conference (ACSAC'2003), Fukushima, Japan, A. Omondi & S. Sedukhin (eds.), Lecture Notes in Computer Science 2823, pp. 193-207, Springer, 2003.
  • M. Volkmer: Neural Speech Enhancement in the Time-Frequency Domain, Proceedings of the 2003 IEEE Signal Processing Society International Workshop on Neural Networks for Signal Processing, NNSP2003, Toulouse, France, pp. 617, IEEE Catalog Number: 03TH8718C, ISBN: 0-7803-8178-5, ISSN: 1089-3555, 2003.
  • M. Volkmer: A pulsed neural network model of spectro-temporal receptive fields and population coding in auditory cortex, Proceedings of the Workshop on the FUture of Neural Networks, FUNN2003, Eindhoven, The Netherlands, 2003.

2002

  • K.-H. Zimmermann: On applying molecular computation to binary linear codes. IEEE Trans. Inform. Theory, 48, 505-509, 2002.
  • K.-H. Zimmermann: Efficient DNA sticker algorithms for graph theoretic problems. Computer Physics Communications, 144, 297-309, 2002.
  • P. Batra: Simultaneous Point Estimates for Newton's Method, BIT Numerical Mathematics, vol.42, no.3, pp.467-476, 2002.
  • M. Volkmer, B. Banke: Pulse-induced masking of sonagrams for the enhancement of speech, Proceedings of the XI European Signal Processing Conference, EUSIPCO'2002, Toulouse, France, Vol. 1, pp. 483-486, 2002.

2001

  • S. Babu, K.-H. Zimmermann: A general decoding scheme for linear codes over galois rings. IEEE Trans. Inform. Theory, 47, 1599-1604, 2001.
  • K.-H. Zimmermann, W. Achtziger: Optimal piecewise linear schedules for LSGP- and LPGS-decomposed array processors via quadratic programming. Computer Physics Communications, 139, 64-89, 2001.
  • K.-H. Zimmermann: The patch selection problem and discrete stochastic dynamic programming. Techn. Report, No. 2001.1, TU Hamburg-Harburg, 2001.
  • T. Lai, K.-H. Zimmermann: A software platform for the DNA sticker model. Techn. Report, No. 2001.2, TU Hamburg-Harburg, 2001.
  • A. Popp, K.-H. Zimmermann: On loop transformations of loop nests with affine dependencies. Computer Physics Communications, 139, 90-103, 2001.
  • S. Wallner, K. von der Heide: A Universal Processor for High Speed Communication, Proceedings of the International Conference on Communications in Computing (CIC'2001), Las Vegas, Nevada USA, CSREA Press, Volume 1 pp. 86-92, 2001.

2000

  • W. Achtziger, K.-H. Zimmermann: Optimal quadratic schedules for affine recurrence equations via nonsmooth optimization. J Sig Proc Syst, 25 , 235-260, 2000.
  • S. Babu, K.-H. Zimmermann: New good codes via CQuest: A system for the silicon search of linear codes. Proc. Alcoma '99, LNCS, Springer, 273-285, 200 0.
  • K.-H. Zimmermann: DNA algorithms for binary linear codes. Techn. Report, No. 2000.1, TU Hamburg-Harburg, 2000.
  • M. Volkmer: Distributed Object Recognition through Reactive Search Agents, Proceedings of the 16th IFIP World Computer Congress 2000, IIP2000: Intelligent Information Processing, Beijing, China, pp. 155, Edited by Zhongzhi Shi, Boi Faltings, Mark Musen (ISBN: 7-5053-6109-0), 2000.

1999

  • W. Achtziger, K.-H. Zimmermann: Optimal schedules for recurrence equations via continuous optimization methods. Reports and Scripts No. 5, Univ. Erlangen-Nuremberg, 1999.
  • K.-H. Zimmermann: Parallelizing the search for good linear codes. Proc. ARCS '99, Workshop zur Architektur von Rechensystemen, Jena, 203-210, 1999.
  • S. Babu, K.-H. Zimmermann: A short introduction to quaternary codes. Techn. Report No. 99.3, TU Hamburg-Harburg, 1999.
  • F. Mayer-Lindenberg: Passive Crossbar Interconnection for Parallel DSP Systems, SHARC'99, Hatfield, 1999.
  • P. Batra: Abschätzungen und Iterationsverfahren für Polynom-Nullstellen, Dissertation, Hamburg, 1999.
  • Ludger Solbach: Partial Tone Tracking and Onset Localization in Single Channel Audio Signal Mixes, 106th AES convention, Munich, 1999.

1998

  • W. Achtziger, K.-H. Zimmermann: On the time optimal implementation of uniform recurrences onto array processors via quadratic programming. J Sig Proc Syst, 19, 19-38, 1998.
  • G. Ehlers, K.-H. Zimmermann: Introduction to Hardware Design with ELLA. Techn. Report No. 98.2, TU Hamburg-Harburg, 1998.
  • W. Achtziger, K.-H. Zimmermann: Computing time-optimal quadratic schedules for affine recurrence equations. Techn. Report No. 243, Univ. Erlangen-Nuremberg, 1998.
  • A. Betten, H. Fripertinger, A. Kerber, A. Wassermann, K.-H. Zimmermann: Codierungstheorie -- Konstruktion und Anwendung linearer Codes. Springer, 1998.
  • F. Mayer-Lindenberg: A Universal Architecture for Parallel Embedded Systems. PDPTA'98, Las Vegas, 1998.
  • F. Mayer-Lindenberg: Crossbar Design for a Super FPGA Architecture. PACT'98, Paris, 1998.
  • O. Wohlmuth: A General Method for the Configuration of Crossbar Networks. International Conference Signal Processing and Communication, Gran Canaria, Spain, 1998.
  • O. Wohlmuth, F. Mayer-Lindenberg: A Method for the Embedding of Arbitrary Communication Topologies into Configurable Parallel Computers. 1998 ACM Symposium on Applied Computing , Special Track on Coordination Models, Languages and Applications, Atlanta, Georgia, USA, 1998.
  • O. Wohlmuth, F. Mayer-Lindenberg: Application-specific Configuration of Crossbar Networks Parallel Computers. IASTED International Conference on Networks and Communication Systems, Pittsburgh, PA, USA, 1998.
  • P. Batra: Improvement of a convergence condition for the Durand-Kerner iteration, Journal of Computational and Applied Mathematics, vol.96, pp.117-125, 1998.
  • A. Knoll, M. Volkmer, A. Wolfram: Image segmentation through Fuzzy Feature Space Analysis, Proceedings of the 6th European Congress on Intelligent Techniques and Soft Computing EUFIT'98, Aachen, Germany, Vol. 2, pp. 1335, Edited by Prof. Dr. Dr. h. c. Hans-Jürgen Zimmermann (ISBN 3-89653-500-5), 1998.
  • Ludger Solbach: An Architecture for Robust Partial Tracking and Onset Localization in Single Channel Audio Signal Mixes, Dissertation, Hamburg, 1998.

1997

  • W. Achtziger, K.-H. Zimmermann: A branching linear programming approach for the mapping of systems of n-dimensional affine recurrences onto k-dimensi onal systolic arrays. Proc. 4th Workshop PASA '96, World Scientific, Singapore, 247-258, 1997.
  • G. Ehlers, K.-H. Zimmermann: Das ELLA 2000 Mikrocontroller-Projekt. Techn. Report No. 97.1, TU Hamburg-Harburg, 1997.
  • K.-H. Zimmermann: On a class of double coset codes. Techn. Report No. 97.2, TU Hamburg-Harburg, 1997.
  • W. Achtziger, K.-H. Zimmermann: Finding space-time transformations for uniform recurrences via branching parametric linear programming. J Sig Proc Syst, 15, 259-274, 1997.
  • K.-H. Zimmermann: A unified lattice-based approach for the decomposition of systolic arrays via LSGP and LPGS. J Sig Proc Syst, 17, 21-42, 1997.
  • W. Achtziger, K.-H. Zimmermann: Optimal polynomial schedules for recurrence equations: An approach via non-smooth optimization. Proc. First Int. Work shop Approximate Reasoning in Scheduling (ARS `97), (Ed.) W. Slany, Int. Comp. Sci. Conventions (ICSC), Academic Press, Millet, Alberta, Kanada, 4-10, 1997 .
  • F. Mayer-Lindenberg: A Heterogenous Parallel System employing a Configurable Interconnection Network. PDSC'97, Washington, 1997.

1996

  • K.-H. Zimmermann: On generalizations of repeated-root cyclic codes. IEEE Trans. Inform. Theory, 42, 641-649, 1996.
  • K.-H. Zimmermann: Linear mappings of n-dimensional uniform recurrences onto k-dimensional systolic arrays. J Sig Proc Syst, 12, 187-202, 19 96.
  • W. Achtziger, K.-H. Zimmermann: Synthesizing regular arrays from single affine recurrences via quadratic and branching parametric linear programming. Parcella '96, Akademie Verlag, Leipzig, 224-231, 1996. W. Achtziger, K.-H. Zimmermann: A branching linear programming approach for the mapping of systems of n-dimensional affine recurrences onto k-dimensional systolic arrays. Techn. Report No. 172, Univ. Erlangen-Nuremberg, 1996.
  • W. Achtziger, K.-H. Zimmermann: Synthesizing regular arrays from single affine recurrences via quadratic and branching parametric linear programming. Techn. Report No. 174, Univ. Erlangen-Nuremberg, 1996.
  • W. Achtziger, K.-H. Zimmermann: The scheduling problem for recurrence equations: A computational approach via non-smooth optimization. Techn. Report No. 200, Univ. Erlangen-Nuremberg, 1996.
  • W. Achtziger, K.-H. Zimmermann: On optimal piecewise linear schedules for LSGP- and LPGS-partitioning of array processors via quadratic programming. Techn. Report No. 202, Univ. Erlangen-Nuremberg, 1996.
  • K.-H. Zimmermann: Integral Hecke modules, integral generalized Reed-Muller codes and linear codes. Techn. Report No. 96.3, TU Hamburg-Harburg, 1996.
  • W. Achtziger, K.-H. Zimmermann: On time optimal implementation of uniform recurrences onto array processors via quadratic programming. Techn. Report No. 204, Univ. Erlangen-Nuremberg, 1996.
  • W. Achtziger, K.-H. Zimmermann: Finding space-time transformations for uniform recurrences via branching parametric linear programming. Techn. Report No. 168, Univ. Erlangen-Nuremberg, 1996.
  • O. Wohlmuth: A New Dense Group Graph Discovered by an Evolutionary Approach. 4. Workshop: Paralleles und Verteiltes Rechnen, Technische Universität Braunschweig, Institut für Wissenschaftliches Rechnen, 1996.
  • L. Solbach, R. Wöhrmann: Sound Onset Localization and Partial Tracking in Gaussian White Noise, ICMC-96, Hong Kong, 1996.

1995

  • R.A. Liebler, K.-H. Zimmermann: Combinatorial Sn-modules as codes. J. Algeb. Combinat., 4, 47-68, 1995.
  • K.-H. Zimmermann: Hecke modules as linear block codes and block m-PSK modulation codes. Proc. 1995th IEEE Symp. Inform. Theory, Whistler, 1995.
  • L. Solbach, R. Wöhrmann, J. Kliewer: The complex-valued continuous wavelet transform as a preprocessor for auditory scene analysis, Revised reprint of the paper presented at the IJCAI-95 workshop on Computational Auditory Scene Analysis, Montral; to be published by Erlbaum Publishers in "Readings in Computational Auditory Scene Analysis", edited by Hiroshi Okuno and David Rosenthal; the authors wish to thank Erlbaum Publishers for their kind permission of reproduction, 1995.
  • R. Wöhrmann, L. Solbach: Preprocessing for the automated transcription of polyphonic music: linking wavelet theory and auditory filtering, ICMC95, Banff, Canada, 1995.

1994

  • K.-H. Zimmermann: On weight spaces of polynomial representations of the general linear group as linear codes. J. Combinat. Theory A, 67, 1-22, 1994.
  • K.-H. Zimmermann: Beiträge zur algebraischen Codierungstheorie mittels modularer Darstellungstheorie, Bayreuther Math. Schriften, 48, 1994.

1993

  • K.-H. Zimmermann: On the decoding of indecomposable binary group codes. Atti del Seminario Matematico e Fisico dell' Universita di Modena, XLI, 445-4 55, 1993.
  • S.Y. Kung, T.C. Lee, K.-H. Zimmermann: Implementational issues on neural network algorithms. J Sig Proc Syst, 6, 85-94, 1993.
  • K.-H. Zimmermann: On the majority decodable distance of codes in filtrations of characteristic $p>0$. Arch. Math., 61, 434-443, 1993.
  • Armin Nückel, O. Wohmuth: Automatic Design and Generation of Group Networks. 2.ITG/GI Workshop: Verbindungsnetzwerke fuer Parallelrechner und Breitbandsysteme, Institut für Mikroelektronik Stuttgart, 1993.

1992

  • K.-H. Zimmermann: The weight distribution of indecomposable cyclic codes over 2-groups. J. Combinat. Theory A, 60, 85-103, 1992.
  • K.-H. Zimmermann: An optimal partitioning method for parallel algorithms: LSGP. in: Fuzzy, Holographic, and Parallel Intelligence, The Sixth-Generati on Breakthrough, (Eds.) B. Soucek and The IRIS Group, Wiley, 233-266, 1992.
  • K.-H. Zimmermann: On the exponent of indecomposable abelian group codes. in: Coding Theory, Design Theory and Graph Theory, (Eds.) D. Jungnickel, S.A . Vanstone, Wiley & Sons, 291-295, 1992.
  • K.-H. Zimmermann: On a complete decoding scheme for binary radical codes. Arch. Math., 59, 513-520, 1992.
  • K.-H. Zimmermann: On the construction of majority-logic decodable group codes. in: Cryptography and Coding III, (Ed.) M.J. Ganley, Clarendon Press, Oxford, 367-377, 1992.

-1991

  • K.-H. Zimmermann: On indecomposable abelian group codes and their vertices. IEEE Trans. Inform. Theory, 37, 1723-1731, 1991.
  • K.-H. Zimmermann: Spechtmoduln als Codes. Seminaire Lotharingien de Combinatoire, 27, 101-110, 1991.
  • K.-H. Zimmermann: The theory of acyclic systolic systems. J. Parallel and Distributed Computing, Academic Press, 9, 26-44, 1990.
  • K.-H. Zimmermann: An optimal partitioning method for parallel algorithms. Parcella '90, Akademie-Verlag Berlin, 2, 321-328, 1990.
  • K. Diamantaras, S.Y. Kung, K.-H. Zimmermann: Integrated fast implementation of mathematical morphology operations in image processing. Proc. Int. Sym p. Circuits Systems (ISCAS), 35-40, 1990.
  • K.-H. Zimmermann: On optimal linear LSGP-partitioning strategies. Techn. Report 1-90, Princeton Univ., Princeton, NJ, 1990.
  • K.-H. Zimmermann: Datenbanken, Informix ESQL/C - Schnittstelle zur Programmiersprache C. Kurshandbuch, Copyright Firchau Consulting, 1989.
  • K.-H. Zimmermann: Acyclic systolic systems. Parcella '88, Akademie-Verlag Berlin, 1, 279-286, 1988.
  • K.-H. Zimmermann: Pipeline-Automaten. Arbeitsbericht, IMMD, Univ. Erlangen, 20-7, 1987.