Martin Luther University Halle-Wittenberg

Büste von Homer

Further settings

Login for editors

Publications by themes



Copyright notice

The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.


Combinatorial Optimization and Data Structures

  • A. Fischer, F. Fischer, G. Jäger, J. Keilwagen, P.l Molitor, and I. Grosse. Computational Recognition of RNA Splice Sites by Exact Algorithms for the Quadratic Traveling Salesman Problem. Computation 2015:3(2):285-298, Special Issue „Genomes and Evolution: Computational Approaches“, edited by R. Breitling and M. Medema, June 2015. (DOI: 10.3390/computation3020285   )
  • Ch. Dong, B. Goldengorin, G. Jäger, P. Molitor, and P. Molitor. A Backbone Based TSP Heuristic for Large Instances. In: Journal of Heuristics 20:107-124, 2014. (DOI 10.1007/s10732-013-9233-y   )
  • A. Fischer, F. Fischer, G. Jäger, J. Keilwagen, P. Molitor, and I. Große. Exact Algorithms and Heuristics for the Quadratic Traveling Salesman Problem with an Application in Bioinformatics.In: Discrete Applied Mathematics, vol. 166, pp.97-144,  2014;  http://dx.doi.org/10.1016/j.dam.2013.09.011   

  • C. Ernst, C. Dong, D. Richter, G. Jäger, and  P. Molitor. Finding Good Tours for Huge Euclidean TSP Instances by Iterative  Backbone Contraction. In:  Proceedings of the 6th International Conference on Algorithmic Aspects  in Information and Management (AAIM'10), LNCS 6124,  pp. 119-130, July 19 - 21  2010, Weihai, China. (Acception Rate: 62%)
  • C. Dong, C. Ernst, G. Jaeger, D. Richter and P. Molitor: Effective Heuristics for Large Euclidean TSP Instances Based on Pseudo-Backbones. In: S. Cafieri, A. Mucherino, G. Nannicini, F. Tarissan, and L. Liberti (Eds.), Proceedings of the 8th Cologne Twente Workshop on Graphs and Combinatorial Optimization, pp. 3-6, June 2 -5 2009, Paris, France.
  • C. Dong, G. Jäger, D. Richter, and P. Molitor: Effective Tour Searching for TSP by Contraction of Pseudo Backbone Edges. In: Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management (AAIM 2009), pp. 175-187, June 15 - 17 2009, San Francisco, USA. (Acception rate: 60%)
  • G. Jäger und P. Molitor: Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order. In: Proceedings of the 2nd Annual International Conference on Combinatorial Optimization and Applications (COCOA 2008), LNCS 5165, pp.211-224, St. John`s, Newfoundland, Aug 21-24, 2008.
  • D. Richter, B. Goldengorin, G. Jäger, and P. Molitor: Improving the Efficiency of Helsgaun`s Lin-Kernighan Heuristic for the Symmetric TSP. In: Proceedings of the 4th Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN 2007), LNCS 4852, pp. 99-110, Halifax, Canada, August 2007.
  • C. Dong and P. Molitor. What Graphs Can Be Efficiently Represented by BDDs. In: Proceedings of the International Conference on Computing: Theory and Applications (ICCTA 2007), pp. 128-134, Kolkata, India, March 2007. IEEE Computer Society.
  • B. Goldengorin, G. Jäger, and P. Molitor. Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP. In: Proceedings of the 3rd Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN 2006), LNCS 4235, pp. 86-97, Chester, United Kingdom, July 2006
  • B. Goldengorin, G. Jäger, and P. Molitor. Tolerances applied in combinatorial optimization. In: Journal of Computer Science 2(9): 716-734, ISSN 1549-3636, Science Publications 2006.
  • B. Goldengorin,  G. Jäger, and P. Molitor. Some basics on tolerances (Extended Abstract). In: Proceedings of the 2nd International Conference on Algorithmic Aspects in Information and Management (AAIM`06), LNCS 4041, pp. 194-206, Hong Kong, China, June 2006.
  • R. Schönfeld, W. Günther, B. Becker, and P. Molitor. K-Layer Straightline Crossing Minimization by Speeding up Sifting. In: Proceedings of 8th Graph Drawing Conference, Lecture Notes in Computer Science 1984:253-258, Colonial Williamsburg, September 2000.
  • L. Heinrich-Litan and P. Molitor. Least Upper Bounds for the Size of OBDDs using Symmetries. In: IEEE Transactions on Computers, vol 49, no. 4, pp.360-368, April 2000.
  • R. Forth and P. Molitor. An Efficient Heuristic For State Encoding Minimizing The BDD Representations Of The Transition Relations Of Finite State Machines. In: Proceedings of the IEEE/ACM Asia and South Pacific Design Automation Conference ASP-DAC, pp.61-66,Tokyo, Japan, January 2000.
  • Chr. Matuszewski, P. Molitor, and R. Schönfeld. Using Sifting For k-Layer Straightline Crossing Minimization. In: Proceedings of 7th Graph Drawing Conference,  Lecture Notes in Computer Science 1731:217-224, Prague, September 1999.
  • R. Drechsler, P. Molitor, D. Möller, and Chr. Scholl. BDD Minimization Using Symmetries. In: IEEE Transactions on Computer-Aided Design of Circuits and Systems, CAD-18(2):81-100, February 1999.
  • L. Litan and P. Molitor. Least Upper Bounds On The Sizes Of Symmetric Variable Order Based OBDDS. In: Proceedings of the 6th Great Lakes Symposium on VLSI, pp.126-129, Iowa, March 1996.
  • T. Asveren and P. Molitor. New Crossover Methods for Sequencing Problems. Proceedings of the 4th International Conference on Parallel Problem Solving from Nature (PPSN IV), September 1996.
  • D. Möller, P. Molitor, and R. Drechsler. Symmetry Based Variable Ordering For ROBDDs Boolean Functions, In:  Novel Approaches in Logic and Architecture Synthesis edited by G. Saucier and A. Mignotte, pp.70-81, Chapman-Hall 1995.
  • P. Molitor. A survey on wiring. In: EIK Journal of Information Processing and Cybernetics, EIK 27(1):3-19, 1991.
  • P. Molitor. On the contact minimization problem. In: Proceedings of the 4th Annual Symposium on Theoretical Aspects of Computer Science (STACS). Lecture Notes in Computer Science LNCS247:420-431, Passau, Germany, February 1987.
  • P. Molitor. Layer assignment by simulated annealing. In: The EuroMicro Journal, Microprocessing and Microprogramming, 16:245-350, 1985.

Synthesis of Digital Circuits

  • R. Schönfeld and P. Molitor. What are the Samples for Learning Efficient Routing Heuristics? In: Proceedings of the 2002 IEEE Asia Pacific Conference on Circuits and Systems, Bali/Indonesia, October 2002.
  • P. Molitor und Chr. Scholl. Datenstrukturen und effiziente Algorithmen für die Logiksynthese kombinatorischer Schaltungen. B. G. Teubner, Stuttgart / Leipzig 1999, ISBN: 3-519-02945-6, 298 Seiten.
  • Chr. Scholl, St. Melchior, G. Hotz, and P. Molitor. Minimizing OBDD Sizes Of Incompletely Specified Boolean Functions By Exploiting Strong Symmetries. In: Proceedings of the European Design and Test Conference, pp.229-234, Paris, France, March 1997.
  • I. Peters, P. Molitor, and M. Weber. On OTC Routing With Vertical Floating Pins. In: Proceedings of the IEEE Asia Pacific Conference on Circuits and Systems,  pp.385-388, Seoul, Korea, November 1996.
  • P. Molitor. Recent Developments In Wiring and Via Minimization. In: Advanced Routing of Electronic Modules edited by M. Pecht and Y. Wong, pp.285-311, CRC Press, Boca Raton / New York / London / Tokyo, January 1996.
  • Chr. Scholl and P. Molitor. Communication Based FPGA Synthesis For Multioutput Boolean Functions. In: Proceedings of the IEEE/ACM Asia and South Pacific Design Automation Conference ASP-DAC, pp.279-287, Chiba, Japan, August 1995.
  • I. Peters and P. Molitor. Priority Driven Channel Pin Assignment. In: Proceedings of the 5th Great Lakes Symposium on VLSI,  pp.132-135, Buffalo, New York, March 1995.
  • Chr. Scholl and P. Molitor. ROBBD Based Computation of Common Decomposition Functions Of Multioutput Boolean Functions, In:  Novel Approaches in Logic and Architecture Synthesis edited by G. Saucier and A. Mignotte, pp.57-63, Chapman-Hall 1995.
  • P. Molitor, U. Sparmann, and D. Wagner. Two Layer Assignment With Pin Preassignment Is Easier If Power Supply Is Already Generated. In: Proceedings of the 7th International Conference on VLSI Design, pp.149-154, Calcutta, India, January 1994.
  • P. Molitor and Chr. Scholl. Communication Based Multilevel Synthesis For Multioutput Boolean Functions. In: Proceedings of the 4th Great Lakes Symposium on VLSI, pp.101-104,  Notre Dame, Indiana, March 1994.
  • P. Molitor. A hierarchy preserving hierarchical bottom-up 2-layer wiring algorithm with respect to via minimization. In: INTEGRATION, the VLSI journal, 15:73-95, 1993.
  • M. Kaufmann, P. Molitor, and W. Vogelgesang. Performance driven k-layer wiring. In: Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science (STACS), Lecture Notes in Computer Science LNCS577:489-500, Cachan, France, February 1992.
  • M. Kaufmann and P. Molitor. Minimal stretching of a layout to ensure 2-layer wirability. In: INTEGRATION, the VLSI journal, 12:339-352, 1991.
  • P. Molitor. A survey on wiring. In: EIK Journal of Information Processing and Cybernetics, EIK 27(1):3-19, 1991.
  • P. Molitor. Constrained via minimization for systolic arrays In: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, CAD-9(5):537-542, June 1990.
  • R. Kolla and P. Molitor. A note on hierarchical layer assignment. In: INTEGRATION, the VLSI journal, 7:213-230, 1989.
  • R. Kolla, P. Molitor und H.-G. Osthof. Einführung in den VLSI-Entwurf. B. G. Teubner, Stuttgart 1989, ISBN 3-519-02273-7, 352 Seiten (vergriffen).
  • P. Molitor. On the contact minimization problem. In: Proceedings of the 4th Annual Symposium on Theoretical Aspects of Computer Science (STACS). Lecture Notes in Computer Science LNCS247:420-431, Passau, Germany, February 1987.
  • P. Molitor. Layer assignment by simulated annealing. In: The EuroMicro Journal, Microprocessing and Microprogramming, 16:245-350, 1985.

Test and Formal Verification of Digital Circuits

  • A. Gießler, J. Ritter, and P. Molitor. Model Checking for PLC based Railway Interlocking Systems. In: Tagungsband des 16. Workshops “Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen”, pp. 71-82, Rostock, March 2013.
  • A. Gießler, J. Ritter, and P. Molitor. BDD based analysis of test cases for PLC based railway interlocking systems. In: Tagungsband des 14. Workshops "Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen", S. 133-143, Oldenburg, 21.-23. Februar 2011, ISBN 978-3-00-033820-5.
  • R. Hoffmann and P. Molitor. Guiding Property Development with SAT-based Coverage Calculation. Will appear in: Proceedings of the 52nd IEEE International Midwest Symposium on Circuits and Systems (MWSCAS 2009), August 2-5 2009, Cancun, Mexico.
  • P. Molitor and J. Mohnke. Equivalence Checking of Digital Circuits. Kluwer Academic Publishers, Boston / Dordrecht / London, January 2004, ISBN: 1-4020-7725-4, 263 pages.
  • P. Molitor and S. Ruppe: A Coverage Measure for Bounded Model Checking. Technical Report of the Institute for Computer Science, Martin-Luther-University Halle-Wittenberg 2003
  • M. Keim, R. Drechsler, B. Becker, M. Martin, and P. Molitor: Formal Verification of Multipliers. In: Formal Methods in System Design 22(1):39-58, Kluwer Academic Publishers, January 2003.
  • J. Mohnke, Sh. Malik, and P. Molitor. Limits of using Signatures for Permutation Independent Boolean Comparison. In: Formal Methods in System Design 21(2):98-11, September 2002.
  • H.-M. Hanisch, P. Molitor und Wolf Zimmermann. Nachweisbar zuverlässige Hardware und Software - Interdisziplinäre Projekte in der Informationstechnologie. In: scientia halensis 2002(3):25-26, Halle (Saale).
  • J. Mohnke, Sh. Malik, and P. Molitor. Application of BDDs in Boolean Matching Techniques for Formal Logic Combinational Verification. In: International Journal on Software Tools for Technology Transfer 3(2):207-216, Springer Verlag 2001.
  • R. Forth and P. Molitor. Permutation Independent Comparison of Pseudo Boolean Functions. In: Notes of the International Workshop on Logic Synthesis (IWLS), pp.123-130, Dana Point, CA, May 2000.
  • S. Wefel and P. Molitor. Prove that a Faulty Multiplier is Faulty!? In. Proceedings of the 10th Great Lakes Symposium on VLSI, GLS-VLSI, pp.43-46; Chicago, Illinois, March 2000
  • R. Forth and P. Molitor. An Efficient Heuristic For State Encoding Minimizing The BDD Representations Of The Transition Relations Of Finite State Machines. In: Proceedings of the IEEE/ACM Asia and South Pacific Design Automation Conference ASP-DAC, pp.61-66,Tokyo, Japan, January 2000.
  • S. Wefel, P. Molitor, and M. Rost. Simulating Field Programmable Analog Devices. In: Proceedings of 42th Midwest Symposium on Circuits and Systems, pp.300-303, New Mexico, August 1999.
  • J. Mohnke, Sh. Malik, and P. Molitor. Establishing Latch Correspondence For Sequential Circuits Using Distinguishing Signatures. In: INTEGRATION, the VLSI Journal 27:33-46, 1999.
  • B. Becker, R. Drechsler, and P. Molitor. On Generation Of Area-Time Optimal Testable Adders. In: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, CAD-14(9):1049-1066, September 1995.
  • J. Mohnke, P. Molitor, and Sh. Malik. Limits of Using Signatures for Permutation Indepedent Boolean Comparison. In: Proceedings of IEEE/ACM Asia and South Pacific Design Automation Conference ASP-DAC, August 1995.
  • B. Becker and P. Molitor. A performance driven generator for efficient testable adders. In: Proceedings of the 1st IEEE European Design Automation Conference (EURO-DAC), pp.370-375, Hamburg, Germany, September 1992.
  • R. Drechsler, B. Becker, and P. Molitor. A performance oriented generator for robust path-delay-fault testable adders. In: Tagungsband des 4. ITG/GI-Workshops über Testmethoden und Zuverlässigkeit von Schaltungen und Systemen, 1992.
  • B. Becker, Th. Burch, G. Hotz, D. Kiel, R. Kolla, P. Molitor, H.-G. Osthof, G. Pitsch, and U. Sparmann. A graphical system for hierarchical specifications and checkups of VLSI circuits. In: Proceedings of EDAC’90, pp.174-179, Glasgow, Great-Britain, March 1990.

Specification of Digital Circuits

  • P. Molitor und J. Ritter. Kompaktkurs VHDL mit vielen anschaulichen Beispielen. Lehrbuch über 280 Seiten. Oldenbourg. Wissenschaftsverlag München 2013, ISBN 978-3-486-71292-6.
  • D. Große, U. Kühne, Chr. Genz, F. Schmiedle, B. Becker und P. Molitor. Modellierung eines Mikroprozessors in SystemC. In: Tagungsband des GI/ITG/GMM Workshop Modellierung und Verifikation von Schaltungen und Systemen, München, Apr. 2005.
  • P. Molitor und J. Ritter. VHDL -- Eine Einführung. Pearson Studium München, April 2004, ISBN: 3-8273-7047, 287 Seiten.
  • G. Hotz, P. Molitor, and W. Zimmer. On the construction of very large integer multipliers. In: Proceedings of EURO-ASIC, pp.266-269, Paris, France, May 1991.
  • B. Becker, Th. Burch, G. Hotz, D. Kiel, R. Kolla, P. Molitor, H.-G. Osthof, G. Pitsch, and U. Sparmann. A graphical system for hierarchical specifications and checkups of VLSI circuits. In: Proceedings of EDAC’90, pp.174-179, Glasgow, Great-Britain, March 1990.
  • R. Kolla, P. Molitor und H.-G. Osthof. Einführung in den VLSI-Entwurf. B. G. Teubner, Stuttgart 1989, ISBN 3-519-02273-7, 352 Seiten (vergriffen).
  • P. Molitor. Free net algebras in VLSI-theory. In: Fundamenta Informaticae, Annales Societatis Mathematicae Polonae XI:117-142, 1988.
  • G. Hotz, R. Kolla, and B. Becker. On network algebras and recursive equations. In: Proceedings of the 3rd International Workshop on Graph Grammars and their Applications to Computer Science (GRAGRA), Lecture Notes in Computer Science LNCS291: 250-261, Warrenton 1987.
  • B. Becker, G. Hotz, R. Kolla, P. Molitor, and H.-G. Osthof.Hierarchical design based on an calculus of nets. In: Proceedings of the 24th Design Automation Conference (DAC), pp.649-653, Miami, Florida, June 1987.
  • B. Becker, G. Hotz, R. Kolla, P. Molitor und H.-G. Osthof. CADIC — Ein System zum hierarchischen Entwurf integrierter Schaltkreise. In: Tagungsband des 3. Workshops über Entwurf Integrierter Schaltungen (E.I.S.-Workshop), S. 235-245, Wissenschaftszentrum Bonn, Oktober 1987.
  • G. Hotz, B. Becker, R. Kolla und P. Molitor. Ein logischer Kalkül zur Konstruktion von integrierten Schaltkreisen. In: Informatik: Forschung und Entwicklung, 1(1,2):38-47,72-82, 1986.

Computer Architecture / Hardware Algorithms

  • B. Becker und P. Molitor. Technische Informatik - Eine einführende Darstellung. 419 Seiten, ISBN 978-3-486-58650-3, Oldenbourg Wissenschaftsverlag München 2008.
  • B. Becker, R. Drechsler und P. Molitor. Technische Informatik -- Eine Einführung. Pearson Studium München, Februar 2005, ISBN: 3-8273-7092-2, 400 Seiten.
  • J. Ritter, G. Fey, and P. Molitor. SPIHT implemented in a XC4000 Device. In: Proceedings of 45th IEEE International Midwest Symposium on Circuits and Systems, pp.239-242,Tulsa, Oklahoma, August 2002.
  • J. Ritter, G. Fey, and P. Molitor. An Efficient  FPGA Implementation of the SPIHT Algorithm. Poster at the 10th ACM International Symposium on Field-Programmable Gate Array`s, Monterey, California, February 2002.
  • P. Molitor und Th. Rauber. Von der Z3 zum Höchstleistungsrechner - Der lange Weg von Konrad Zuse zum Blue-Gene-Projekt.. In: scientia halensis 2002(3):9, Halle (Saale).
  • J. Ritter and P. Molitor. A Pipelined Architecture For Partitioned DWT Based Lossy Image Compression Using FPGAs. In: Proceedings of the 9th ACM International Symposium on Field-Programmable Gate Array`s,  Monterey, California, February 2001.
  • J. Ritter und P. Molitor. Ein partitionierter Ansatz zur hardware-basierten Bild- und Videokomprimierung mit Wavelets Im: Tagungsband der DSP2000, Seite 125-132, München, Oktober 2000.
  • J. Ritter and P. Molitor. Partitioned Wavelet-based Approach for Image Compression using FPGA`s. In: Proceedings of the 2000 IEEE Custom Integrated Circuits Conference (CICC), pp.547-550, Orlando, Florida, May 2000.
  • A. Küster, M. Legeler, and P. Molitor. Fixed Point Multiplication. has been selected as best math web site of the week (November 2, 1999)  by the Canadian Mathematical Society.
  • U. Fissgus, L. Heinrich-Litan, and P. Molitor. Modeling The Communication Behavior On Distributed Memory Machines By Genetic Programming In: Proceedings of the 4th International Euro-Par Conference, Lecture Notes in Computer Science 1470:273-278, Southhampton, Great-Britain, September 1998.
  • B. Becker, R. Drechsler, and P. Molitor. On Generation Of Area-Time Optimal Testable Adders. In: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, CAD-14(9):1049-1066, September 1995.
  • B. Becker, R. Drechsler, and P. Molitor. On the implementation of an efficient performance driven generator for conditional-sum adders. In: Proceedings of the 2nd IEEE European Design Automation Conference (EURO-DAC), pp.402-407. Hamburg, Germany, September 1993.
  • B. Becker and P. Molitor. A performance driven generator for efficient testable adders. In: Proceedings of the 1st IEEE European Design Automation Conference (EURO-DAC), pp.370-375, Hamburg, Germany, September 1992.
  • R. Drechsler, B. Becker, and P. Molitor. A performance oriented generator for robust path-delay-fault testable adders. In: Tagungsband des 4. ITG/GI-Workshops über Testmethoden und Zuverlässigkeit von Schaltungen und Systemen, 1992.
  • G. Hotz, P. Molitor, and W. Zimmer. On the construction of very large integer multipliers. In: Proceedings of EURO-ASIC, pp.266-269, Paris, France, May 1991.

IT-Security

  • H. Strack, S. Wefel, P. Molitor, M. Räckers, J. Becker, J. Dittmann, R. Altschaffel, J. M. Gómez, N. Brehm and A. Dieckmann. eID & eIDAS at University Management - Chances and Changes for Security and Legally Binding in Cross Boarder Electronization. Annual Congress of the European University Information Systems Organization, EUNIS'2017, Münster, June 2017.
  • S. Wefel and P. Molitor. Raising User Acceptance of Token based Authentication by Single Sign-On. In: International Journal of Information and Computer Science (IJICS), 1(3):070-077, 2012. (Open Access   )
  • S. Wefel and P. Molitor. Client Hardware-Token Based Single Sign-On Over Several Servers Without Trusted Online Third party Server. In: Proceedings of the 3rd International Conference on Security and Assurance (ISA), Advances in Information Security and Its Application, June 25 - 27 2009, Seoul, Korea. Communications in Computer and Information Science Series, CCIS 36, pp. 29-36, Springer Verlag, 2009.
  • S. Wefel and P. Molitor. Using Hardware Tokens for Authentication of Multiple Client Application  Making Single Sign-On Possible. Technical Report 2008/9, Institute for Computer Science, Martin-Luther-University of Halle-Wittenberg, 2008.

eHumanities

  • T. Bremer, P. Molitor, M. Pöckelmann, J. Ritter, S. Schütz. Zum Einsatz digitaler Methoden bei der Erstellung und Nutzung genetischer Editionen gedruckter Texte mit verschiedenen Fassungen – Das Fallbeispiel der Histoire philosophique des deux Indes von Guillaume Thomas Raynal. In: Editio, Internationales Jahrbuch für Editionswissenschaften, Band 29, Heft 1, S. 29-51, de Gruyter, 2015. http://dx.doi.org/10.1515/editio-2015-004   
  • A. Medek, J. Ritter, P. Molitor, and S. Koesser. Interactive Similarity Analysis of Early New High German Text Variants. Digital Humanities, DH2015, Sydney, Australia, 29.6.-3.7.2015.
  • M. Pöckelmann, A. Medek, P. Molitor, and J. Ritter. CATview_ - Supporting The Investigation Of Text Genesis Of Large Manuscripts By An Overall Interactive Visualization Tool. Digital Humanities, DH2015, Sydney, Australia, 29.6.-3.7.2015.
  • V. Hildenbrandt, R.S. Kamzelak, P. Molitor, und J. Ritter. "im Zentrum eines Netzes [...] geistiger Fäden". Erschließung und Erforschung thematischer Zusammenhänge in heterogenen Briefkorpora. In "Informationsmanagement für Digital Humanities", Hrsg.  G. Heyer und A. Henrich. Datenbank-Spektrum, 15(1):49-55, Springer Verlag, 2015. (http://dx.doi.org/10.1007/s13222-014-0177-7   )
  • A. Medek, M. Pöckelmann, T. Bremer, H.-J. Solms, P. Molitor und J. Ritter. Differenzanalyse komplexer Textvarianten - Diskussion und Werkzeuge. In "Informationsmanagement für Digital Humanities", Hrsg.  G. Heyer und A. Henrich. Datenbank-Spektrum, 15(1):25-31, Springer Verlag, 2015. (http://dx.doi.org/10.1007/s13222-014-0173-y   )
  • A. Gießler, J. Ritter, P. Molitor, M. Andert, S. Kösser, und A. Leipold. User-friendly lemmatization and morphological annotation of Early New High German manuscripts. Poster presentation, Digital Humanities, DH2014, Lausanne, 08.-12.07.2014.
  • A. Gießler, A. Leipold, S. Kösser, P. Molitor, J, Ritter und H.-J. Solms. Angewandte Sprachgeschichte: Neue Editionen spätmittelalterlicher und frühneuzeitlicher Texte – Die 'Wundarznei' des Heinrich von Pfalzpaint. Vortrag auf der 15. internationalen Tagung der 'Arbeitsgemeinschaft für germanistische Edition', Aachen, 19.-22.02.2014.
  • M. Andert, F. Berger, J. Ritter, and P. Molitor. Optimized Platform for Capturing Metadata of Historical Correspondences. Extended Abstract. In: Conference Abstracts of Digital Humanities 2013 (DH2013), pp. 88-89, 16-19 July 2013, University of Nebraska-Lincoln, USA. [Abstract, Slides]
  • M. Andert, J. Ritter and P. Molitor. A web-based application for rapid annotation of TEI documents. In: 2011 International Conference "Philology in the Digital Age" of the Text Encoding Initiative (TEI 2011), 10.10-16.10.2011, Würzburg, Germany.

Learning Management Systems and Information Systems in Academia

  • P. Molitor and A. Thüring. An Internet-Based Tool for Dynamical Electronic Practical Training. In: Proceedings of the 3rd International Conference on Education and Information Systems, Technologies and Applications (EISTA 2005), pp. 438-443, Orlando, U.S.A., July 14-17, 2005.
  • A. Both und P. Molitor. Multilingual im Internet — Web-CMS, eine Plattform für einen einheitlichen Internetauftritt der Universität. In: scientia halensis, p.3, Dezember 2005.
  • R. Geiling, C. Hempel und P. Molitor. Lehr- und Lernplattform Stud.IP — Universitätsweite Einführung des Systems in Halle. In: scientia halensis, p.3, Juli 2004.
  • A. Thüring, P. Jenke und P. Molitor. Ein System zur Erstellung elektronischer, über Multiple-Choice hinausgehender Übungsblätter. Im: Tagungsband des Workshops e-Learning der HTWK Leipzig, September 2002.
  • H. Bögel und P. Molitor. Neue Medien in der Lehre und Studium. In: scientia halensis 2002(3):13-14, Halle (Saale).
  • A. Küster, M. Legeler, and P. Molitor. Fixed Point Multiplication. has been selected as best math web site of the week (November 2, 1999)  by the Canadian Mathematical Society.

Miscellaneous

  • P. Molitor. Algorithmen -- Eine Einführung. 4. Auflage. Korrektur der Deutschen Übersetzung des Standardwerkes "Introduction to Algorithms (Third Edition)" von Th. Cormen, Ch. Leiserson, R. Rivest, und C. Stein. Oldenbourg Wissenschaftsverlag München, September 2013, 1319 Seiten.
  • P. Molitor. Algorithmen -- Eine Einführung. 3. Auflage. Überarbeitung und Aktualisierung der Deutschen Übersetzung des Standardwerkes "Introduction to Algorithms (Third Edition)" von Th. Cormen, Ch. Leiserson, R. Rivest, und C. Stein. Oldenbourg Wissenschaftsverlag München, Juni 2010, circa 1300 Seiten.
  • P. Molitor. Algorithmen -- Eine Einführung. 2. Auflage. Korrektur der Deutschen Übersetzung des Standardwerkes "Introduction to Algorithms (Third Edition)" von Th. Cormen, Ch. Leiserson, R. Rivest, und C. Stein. Oldenbourg Wissenschaftsverlag München, 2007, 1188 Seiten.
  • P. Molitor (Wissenschatliche Leitung). MPI - Eine Einführung. Wissenschaftliche Leitung der Übersetzung des englischsprachigen, bei The MIT Press im Jahre 1999 erschienenen Buches "Using MPI" von W. Gropp, E. Lusk und A. Skjellum. Oldenbourg Wissenschaftsverlag München, 2007.
  • P. Molitor. Allgegenwärtig und doch unsichtbar — Gedanken zum Jahr der Informatik 2006. In: scientia halensis, p.4, Dezember 2006.
  • P. Molitor. ... was wird mit übrigens?. In: it - Information Technology " des Oldenbourg Verlags München">it — Information Technology, Methoden und innovative Anwendungen der Informatik und Informationstechnik, Heft 4, Band 48, Jahrgang 2006, Oldenbourg Wissenschaftsverlag  München 2006.
  • P. Molitor (Wissenschaftliche Leitung). Algorithmen -- Eine Einführung. Wissenschaftliche Leitung bei der Übersetzung des englischsprachigen, bei The MIT Press im Jahre 2001 erschienenen Buches "Introduction to Algorithms" von Th. Cormen, Ch. Leiserson, R. Rivest, und C. Stein. Oldenbourg Wissenschaftsverlag München, September 2004, 1188 Seiten.
  • Chr. Bauer und P. Molitor. Informatik an der Martin-Luther-Universität. In: scientia halensis 2002(3):7, Halle (Saale).
  • P. Molitor und J. Ritter. Das Universitätszentrum für Informatik — Zum Profil des jüngsten Interdisziplinären Zentrums der MLU. In: scientia halensis 2002(3):8, Halle (Saale).
  • G. Walz (Hrsg.). Lexikon der Mathematik. Verantwortlich für die Teilgebiete "Boolesche Funktionen und ihre Darstellung", "Verbände und geordnete algebraische Strukturen", "Sortieralgorithmen" und "Informationstheorie".Spektrum Fachverlage GmbH, Stuttgart 1999/2000/2001/2002.
  • P. Molitor. Comskee — Textverarbeitungssprache mit integriertem Datenbankkonzept. In: iX 2/1989, Heise Verlag, pp. 68-71, 1989.

Editorships

  • P. Molitor (Editor-in-Chief): it - Information Technology, de Gruyter (Berlin) 2013, 2014, 2015, 2016. 2017. mehr...   
  • P. Molitor und K. Rothermel (Hauptherausgeber): it — Information Technology, Methoden und innovative Anwendungen der Informatik und Informationstechnik, Bände 49, 50, 51, 52, 53, 54 der Jahrgänge 2006, 2007, 2008, 2009, 2010, 2011, 2012, Oldenbourg Wissenschaftsverlag  München 2007-2012. mehr...   
  • P. Molitor, K. Küspert und K. Rothermel (Hauptherausgeber): it — Information Technology, Methoden und innovative Anwendungen der Informatik und Informationstechnik, Bände 45, 46, 47, 48 der Jahrgänge 2003, 2004, 2005, 2006, Oldenbourg Wissenschaftsverlag München 2003-2006.
  • St. Hölldorfer mit A. Bernstein, W. Effelsberg, F. Freiling, H.-P. Lehnhof, P. Molitor, G. Neumann, R. Reischuk, N. Schweickart, M. Spiliopoulou, H. Störrle, S. Süsstrunk (Herausgeber): Ausgezeichnete Dissertationen 2014, 2015, 2016. Lecture Notes in Informatics (LNI) - Dissertations, Volume D-14, D-15, D-16.
  • St. Hölldorfer mit A. Bernstein, G. Hotz, K. Löhr, P. Molitor, G. Neumann, R. Reischuk, D. Saupe, M. Spiliopoulou, H. Störrle, D. Wagner (Herausgeber): Ausgezeichnete Dissertationen 2009-2012. Lecture Notes in Informatics (LNI) - Dissertations, Volume D-10, D-11, D-12, D-13.
  • D. Wagner mit A. Bernstein, Th. Dreier, S. Hölldobler, G. Hotz, K. Löhr, P. Molitor, G. Neumann, R. Reischuk, D. Saupe, M. Spiliopoulou, H. Störrle (Herausgeber): Ausgezeichnete Dissertationen 2004-2008. Lecture Notes in Informatics (LNI) - Dissertations, Volumes D-5, D-6, D-7, D-8, D-9.
  • P. Molitor et al. (Hrsg.). Tagungsband des Abschlussworkshops zu den EFRE-Projekten der Maßnahme 11.03/41.03 „Förderung des Einsatzes neuer Technologien im Wissenschaftsbereich und zur Schaffung von Informations- und Wissenschaftsmanagementsystemen“ vom 02.12.2011. 118 Seiten, Januar 2012.

Up