Search for

Bibliographia Humboldtiana Index

Bibliographia Humboldtiana

IV. Translations

Computer science, information science, statistics

Boerger, Prof. Dr. Egon

Universita di Pisa, Italy
Field of research: Applied computer science, applied information science
Host: Prof. Dr. Bernhard Thalheim Christian-Albrechts-Universität zu Kiel
  • Egon Boerger and Bernhard Thalheim: A Method for Verifiable and Validatable Business Process Modeling. In: Advances in Software Engineering (LNCS 5316). (Ed. Egon Boerger and Antonio Cisternino) Berlin, Heidelberg, New York etc.: Springer-Verlag, 2008, p. 59 - 115 [Business Process Modeling, Abstract State Machine, BPMN].

  • Egon Boerger and Bernhard Thalheim: Modeling Workflows, Interaction Patterns, Web Services and Business Processes: The ASM-Based Approach. In: Abstract State Machines, B and Z (LNCS 5238) . (Ed. Egon Boerger and Michael Butler and Jonathan Bowen and Paul Boca) Berlin, Heidelberg, New York, etc.: Springer-Verlag , 2008, p. 24 - 38 [Workflows, Web Services, Interaction Patterns, Business Processes, Abstract State Machines, ].

  • Egon Boerger Owe Soerensen Bernhard Thalheim: On defining the behavior of OR-joins in business process models. In: J. Universal Computer Science. 14, 2008, p. 1 - 22 [BPMN, OR-Join Problem, Synchronization of Parallel Workflows].

  • Egon Boerger and and Ove Soerensen: BPMN Core Modeling Concepts: Inheritance-Based Execution Semantics. In: Handbook of conceptual modelling. (Ed. D. Embley and B. Thalheim) Berlin Heidelberg New York etc.: Springer-Verlag, 2010, p. 1 - 46 [Business Process Modelling Notation, Abstract State Machines].

  • Michael Altenhofen, Egon Boerger: Concurrent Abstract State Machines and +CAL. In: Recent Trends in Algebraic Development Techniques (WADT 2008) (LNCS 5486). (Ed. A. Corradini and U. Montanari) Berlin, Heidelberg, New York: Springer, 2009, p. 1 - 17 [Abstract State Machines, concurrency, +CAL].

  • Egon Boerger: Approaches to Modeling Business Processes. A Critical Analysis of BPMN, Workflow Patterns and YAWL. In: J. SOFTWARE AND SYSTEMS MODELING. 11 (3), 2012, p. 305 - 318 [Business Process Modeling, BPMN, YAWL, Workflow Pattern, Petri nets].

  • Egon Boerger: The Subject-Oriented Approach to Software Design and the {A}bstract {S}tate {M}achines Method. In: Conceptual Modelling and Its Theoretical Foundations -- Essays Dedicated to Bernhard Thalheim on the Occasion of his 60th Birthday. (Ed. A. Duesterhoeft and M. Klettke and K.-D. Schewe) Berlin etc.: Springer, 2012, p. 52 - 72 [Business Procdess Modeling, S-BPM, Abstract State Machines].

  • Albert Fleischmann, W. Schmidt, C. Stary, Stefan Obermeier,Egon Boerger: Subjektorientiertes Prozessmanagement. Muenchen: Hanser, 2011, 434 pp. [S-BPM].

  • A. Fleischmann, W. Schmidt, C. Stary, S. Obermeier,Egon Boerger: Subject-Oriented Business Process Management. Berlin etc.: Springer Open Access Book, 2012, XV+375 pp. Original author: A. Fleischmann, W. Schmidt, C. Stary, S. Obermeier, E. Boerger (English) [S-BPM].

  • Egon Boerger, K.-D. Schewe: Specifying Transaction Control to Serialize Concurrent Program Executions. In: Proc. ABZ 2014 (LNCS 8477). (Ed. Y. Ait-Ameur, K.-D. Schewe) Berlin etc.: Springer, 2014, p. 142 - 157 [Transaction, Databses, Abstract State Machines].

  • Egon Boerger, Albert Fleischmann: Abstract State Machine Nets. Closing the Gap between Business Process Models and their Implementation . In: Proc. S-BPM ONE 2015. (Ed. Jens Ehlers, Bernhard Thalheim) USA: ACM Digital Library, 2015.

  • Egon Boerger, Simone Zenzaro: Modeling for Change via Component-Based Decomposition and ASM Refinement . In: Proc.S-BPM ONE 2015. (Ed. Jens Ehlers, Bernhard Thalheim) USA: ACM Digital Library, 2015.

Boncz, Dr. Peter

Centrum voor Wiskunde en Informatica (CWI), Netherlands
Field of research: Computer and information science
Host: Prof. Dr. Alfons Kemper Technische Universität München
  • Harald Lang, Tobias Mühlbauer, Florian Funke, Peter Boncz, Thomas Neumann, Alfons Kemper: Data Blocks: Hybrid OLTP and OLAP on Compressed Storage using both Vectorization and Compilation. In: Proceedings of ACM SIGMOD. 2016, p. 1 - 12.

  • Minh Duc Pham, Linnea Passing, Orri Erling, Peter Boncz : Deriving an Emergent Relational Schema from RDF data . In: Proceedings of the WWW Conference. 2015, p. 1 - 12.

  • Orri Erling, Alex Averbuch, Josep Lluis Larriba-Pey, Hassan Chafi, Andrey Gubichev, Arnau Prat, Minh Duc Pham, Peter Boncz : The LDBC Social Network Benchmark: Interactive Workload. . In: Proceedings of the ACM SIGMOD Conference. 2015, p. 1 - 12.

  • Viktor Leis, Andrey Gubichev, Atanas Mirchev, Peter Boncz, Thomas Neumann, Alfons Kemper.: How Good Are Query Optimizers, Really? . In: Proceedings of the VLDB (PVLDB). 9, 2015, p. 204 - 215.

  • Andrey Gubichev, Peter Boncz: Parameter Curation for Benchmark Queries. In: Proceedings of the Technical Conference of the Transaction Processing Council (TPCTC). 2014, p. 1 - 12.

  • Renzo Angles Rojas, Peter Boncz, Josep LLuis Larriba-Pey, Irini Fundulaki, Thomas Neumann, Orri Erling, Peter Neubauer, Norbert Martinez Bazan, Venelin Kotsev, Ioan Toma: The Linked Data Benchmark Council: a Graph and RDF industry benchmarking effort. In: ACM SIGMOD Record . 43, 2014, p. 27 - 31.

  • Viktor Leis, Peter Boncz, Alfons Kemper, Thomas Neumann. : Morsel-Driven Parallelism: A NUMA-Aware Query Evaluation Framework for the Many-Core Age. In: Proceedings of SIGMOD. 2014, p. 1 - 12.

Rothe, Prof. Dr.

Heinrich-Heine-Universität Düsseldorf, Germany
Field of research: Theoretical computer and information science

  • Jörg Rothe: Komplexitätstheorie und Kryptologie. Eine Einführung in Kryptokomplexität. Berlin, Heidelberg: Springer-Verlag, 2008, xii+535 pp. Original author: Jörg Rothe (German) [complexity theory, cryptology].

  • G. Erdélyi, L. Hemaspaandra, J. Rothe, and H. Spakowski: Frequency of Correctness versus Average Polynomial Time. In: Information Processing Letters. 109, 2009, p. 946 - 949.

  • P. Faliszewski, E. Hemaspaandra, L. Hemaspaandra, and J. Rothe. : Llull and Copeland Voting Computationally Resist Bribery and Constructive Control. In: Journal of Artificial Intelligence Research. 35, 2009, p. 275 - 341.

  • E. Hemaspaandra, L. Hemaspaandra, and J. Rothe: Hybrid Elections Broaden Complexity-Theoretic Resistance to Control. In: Mathematical Logic Quarterly. 55 , 2009, p. 397 - 424.

  • G. Erdélyi, M. Nowak, and J. Rothe: Sincere-Strategy Preference-Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control. In: Mathematical Logic Quarterly. 55, 2009, p. 425 - 443.

  • D. Baumeister and J. Rothe: Satisfiability Parsimoniously Reduces to the Tantrix(TM) Rotation Puzzle Problem. In: Fundamenta Informaticae. 91, 2009, p. 33 - 51.