List of publications

Compact list of references

[PDF]    |    [BibTeX]

Abstracts, fulltexts, preprints, and slides

Published papers and reports

• Papp, D: On the complexity of local search in unconstrained quadratic binary optimization.  RUTCOR Research Report 1-2007, January 2007

  We show by construction that the procedure of local search for the problem of finding a local optimum of a quadratic pseudo-boolean function takes exponential time in the worst case, regardless of the neighbor selection and tie-breaking rules.

  [PDF]    |    [BibTeX]    |    [arXiv]
• Papp, D; Vizvári, B.: Effective solution of linear Diophantine equation systems with an application in chemistry.  Journal of Mathematical Chemistry 39(1), January 2006, pp.15-31.

  See RUTCOR research report 28-2004 below, and the journal link for the abstract and fulltext.

  [J Math Chem]    |    [BibTeX]
• Papp, D; Vizvári, B.: Effective solution of linear Diophantine equation systems with an application in chemistry.  RUTCOR Research Report 28-2004, September 2004

  Systematic methods of the solution of linear Diophantine systems of equations and their application in decomposing complex chemical reactions are presented. The earlier presented Contejean--Devie algorithm is improved. A new, linear programming based enumerative algorithm is described, which is applicable to large systems with large solutions. Mathematica implementations are tested and compared in important chemical examples.

  [PS]    |    [BibTeX]
• Molnár, E.; Papp, D.: Visualization of Nil-geometry.  Proceedings of the Dresden Symposium Geometry, November 2003

  Nil geometry is a homogeneous 3-space derived from the Heisenberg matrix group, where the matrix multiplication provides the (non-commutative) addition of translations. A challenging problem is to visualize this geometry in the 3-diemsional Euclidean space. The task was to develop a software that simulates the effects of translations in Nil run-time and lets the user "play” with the model and demonstrate the most important properties of Nil geometry.

  [PDF]    |    [BibTeX]
• Arató, P.; Juhász, S.; Mann, Z.Á., Orbán, A.; Papp, D.: Hardware-software partitioning in embedded system design.  Proceedings of the 2003 IEEE International Symposium on Intelligent Signal Processing, Budapest, 2003.

  One of the most crucial steps in the design of embedded systems is hardware-software partitioning, i.e. deciding which components of the system should be implemented in hardware and which ones in software. Different versions of the partitioning problem are defined, corresponding to real-time systems and cost-constrained systems, respectively. The authors provide a formal mathematic analysis of the complexity of the problems: it is proven that they are NP-hard in the general case, and some efficiently solvable special cases are also presented. An ILP (integer linear programming) based approach is presented that can solve the problem optimally even for quite big systems, and a genetic algorithm (GA) that finds near-optimal solutions for even larger systems. A specialty of the GA is that non-valid individuals are also allowed, but punished by the fitness function.

  [PDF]    |    [BibTeX]

Other projects, talks, theses

• Papp, D: Analysis of Petri net-based Models and their Applications in Reaction Kinetics.  M.Sc. thesis, May 2005
  (in Hungarian, with English summary: Petri-hálón alapuló modellek analízise és alkalmazásai a reakciókinetikában)
  Budapest University of Technology and Economics, Dept. of Measurement and Information Systems.

  Supervised by Szilvia Varró-Gyapay and János Tóth.

  The aim of this thesis is to study the structure and temporal evolution of Petri net-based reaction kinetic models using (and developing further) the techniques originally developed during the investigation of engineering models, and to describe and implement a computer application which supports the investigation of these reaction kinetic models. A computer program is presented, which supports reaction kinetic investigations. The problems which can be solved with the program include: decomposition of overall reactions into elementary steps, stochastic simulation of chemical reactions, generation and solution of kinetic differential equations, and the identification of certain qualitative properties of the solutions (without solving the equations).

  [PDF]    |   [BibTeX]    |   [slides]    |   [Mathematica notebook]
• Decompositions of overall chemical reactions by discrete mathematical means (in Hungarian: Bruttó reakciók felbontása diszkrét matematikai eszközökkel), seminar of the Society of Mathematical and Visualization Software Users, Szeged, November 2003

---

Home