Burkhard Monien - Academia.edu (original) (raw)

Papers by Burkhard Monien

Theory of Computing Systems / Mathematical Systems Theory, Sep 1, 1975

Lecture Notes in Computer Science, 1974

Acta Informatica, Mar 1, 1976

RAIRO. Informatique théorique, 1980

L'accès aux archives de la revue « RAIRO-Informatique théorique » implique l'accord avec les cond... more L'accès aux archives de la revue « RAIRO-Informatique théorique » implique l'accord avec les conditions générales d'utilisation (http://www.numdam. org/legal.php). Toute utilisation commerciale ou impression systématique est constitutive d'une infraction pénale. Toute copie ou impression de ce fichier doit contenir la présente mention de copyright. Article numérisé dans le cadre du programme Numérisation de documents anciens mathématiques http://www.numdam.org/ R.A.I.R.O. Informatique théorique/Theoretical Informaties (vol. 14, n° 1, 1980, p. 67 à 82) TWO-WAY MULTIHEAD AUTOMATA OVER A ONE-LETTER ALPHABET (*) by Burkhard MONIEN (*) Communicated by W. BRAUER Abstract.-Let H (k) and NH (k) dénote the classes of languages over a one-letter alphabet acceptable by deterministic {respectively nondeterministic) two-way k-headfinite automata. It will be shown that H (k) i H (/c+ 1) and NH (k) J NH (fc+1) holdsfor allk^l. Hierarchy results are also provedfor the classes oflanguages over a one-letter alphabet defined by k-counter automata with linear bounded counters and by k-register machines with linear bounded registers, respectively. Résumé.-On désigne par H (k) et NH {k) les familles des langages sur un alphabet à une seule lettre qui sont reconnaissables par des automates finis bilatères à k têtes déterministes (resp. non déterministes). On montre que H (k) J H {k + 1) et que NH (k) J NH (k + 1) pour tout k ^ 1. On donne également une hiérarchie dans les familles de langages définis par des automates à k-c ompteurs linéairement bornés et par des machines à k-registres linéairement bornés respectivement.

North-holland Mathematics Studies, 1985

Lecture Notes in Computer Science, 1981

ABSTRACT

Springer eBooks, Jan 25, 2006

Journal of Parallel and Distributed Computing, Nov 1, 2005

The generalized butterfly GBN(d, n) has recently gained some interest as a point-to-point interco... more The generalized butterfly GBN(d, n) has recently gained some interest as a point-to-point interconnection network rather than the well known multi-stage butterfly networks. We construct edges-disjoint spanning trees (abbreviated EDSTs) for the GBN(d, n). Our construction is based on the decomposition of the GBN(d, n) into d n vertex-disjoint cycles of length n. As an application, we propose an efficient broadcasting algorithm and its fault-tolerant version for the GBN(d, n). Our fault-tolerant broadcasting algorithm is optimal in terms of fault-tolerance, because it resists 2d − 1 edge failures (2d is the degree of the GBN(d, n)). We also propose an efficient scattering algorithm and its fault-tolerant version which resists 2d − 3 edge faults.

Lecture Notes in Computer Science, 2012

In this talk, we present a selection of important concepts and results in algorithmic game theory... more In this talk, we present a selection of important concepts and results in algorithmic game theory in recent years, some of which received the 2012 Godel Prize, along with some applications in distributed settings. A famous solution concept for non-cooperative games is the Nash equilibrium. In a Nash equilibrium, no selfish player can unilaterally deviate from his current strategy and improve his profit. Nash dynamics is a method to compute a Nash equilibrium. Here, in each round, a single player is allowed to perform a selfish step, i.e. unilaterally change his strategy and improve his cost. The Nash dynamics terminates if it does not run into a cycle. This is always the case if the game has a potential function. In this case, computing a Nash equilibrium is a mathcalPLS\mathcal{PLS}mathcalPLS problem (Polynomial Local Search) and belongs to the large class of well-studied local optimization problems. Inspired by real-world networks, network congestion games have been under severe scrutiny for the last years. Network congestion games model selfish routing of unsplittable units. These units may be weighted or unweighted. Weighted congestion games do not necessarily have a pure Nash equilibrium. Conversely, an unweighted congestion game has a potential function. Computing a pure Nash equilibrium for an unweighted congestion game is mathcalPLS\mathcal{PLS}mathcalPLS-complete. The absence of a central coordinating authority can result in a loss of performance due to the selfishness of the participants. This situation is formalized in the notion "Price of Anarchy". The Price of Anarchy is defined to be the worst case ratio between the maximal social cost in a Nash equilibrium and the optimal social cost. We present the recent results for congestion games and for the special case of load balancing. Classical game theory assumes that each player acts rationally and wants to improve his profit. This is not realistic in a distributed setting since it requires that each player has the complete information about the state of the system. We introduce the concept of selfish distributed load balancing and describe recent results. We will also consider distributed algorithms for network creation games. In the past, network creation games have mostly been studied under the assumption that the players have a global view on the network, or more precisely, that the players are able to compute the average distance or the maximum distance to the nodes they want to interact with in the given network, depending on the objective function. A player may then decide to add one or more edges for some extra cost or to drop an edge. We will look at network creation games from a different angle. In our case, the players have fixed distances to each other that are based on some underlying metric (determined by, for example, the geographic positions of the players), and the goal is to study the networks formed if players selfishly add and remove edges based on that metric. We show that for certain metrics like the line metric, tree metric, and the Euclidean metric, certain selfish behavior, that only requires a local view of the players on the network, will lead to stable networks that give a good approximation of the underlying metric.

This book contains papers presented at a symposium on the theoretical aspects of computer science... more This book contains papers presented at a symposium on the theoretical aspects of computer science. Topics include the following: optimal parallel algorithms for computer calculations; speeding up random access machines by few processors.

A numerical approach based on 3D Computational Fluid Dynamics (CFD) for the simulation of the int... more A numerical approach based on 3D Computational Fluid Dynamics (CFD) for the simulation of the interfacial dynamics during the disintegration process of liquid in a resonant ultrasonic field is presented. Because of different length-and timescales of the nonlinear sound field and droplet dynamics phenomena, a decoupling is necessary for numerical feasibility. In a first step oscillating pressure-and velocity fields of the ultrasonic fields are computed. Direct Numerical Simulations of the disintegration process are then performed with an advanced Volume of Fluid (VOF)-method. The latter is extended by interfacial momentum source terms, taking into account ultrasonic forces, which lead to disintegration of the liquid phase. To resolve the small-sized fluid structures numerically, very fine computational grids are necessary. Therefore, numerical simulations are performed with parallel computing techniques. Disintegration inside the ultrasonic field is investigated experimentally with high-speed photography. For comparison purposes between numerical and experimental results, an acoustic levitator is used as a less complex system to study the behaviour of single drops in a resonant sound field. Results obtained from numerical computations will serve for optimisation of the ultrasonic standing wave atomization (USWA) technique used for powder coating production and for application of fluid coatings of high viscosity.

Proceedings of the first annual ACM symposium on Parallel algorithms and architectures

RAIRO. Informatique théorique, 1980

Bulletin of Eatcs, Oct 16, 2013

, the EATCS Council Election for ten new members took place. Zoltan Esik, Juhani Karhumäki, David... more , the EATCS Council Election for ten new members took place. Zoltan Esik, Juhani Karhumäki, David Peleg, Josep Díaz, Fedor Fomin and Gerhard Woeginger were re-elected; Jos Baeten, Elvira Mayordomo, Monika Henzinger and Roger Wattenhofer were elected for the first time. The term of office for all of these members is four years. Subsequently, the President reports on the results of the various elections during the EATCS Council meeting at July 9th, 2012. Burkhard Monien explains that every odd year, half of the members of the council are elected for a term of four years, and every even year, the officials are elected for a term of two years. The officials are the President (currently Burkhard Monien), the Vice Presidents (currently Giorgio Ausiello, Don Sannella, and Paul Spirakis), the Treasurer (currently Dirk Janssens), and the Bulletin Editor (currently Maria Serna). Moreover, in even years, the council has the right to nominate Appointed Council Members for a term of two years. Currently, Vladimiro Sassone and Jan van Leeuwen are the Appointed EATCS Council Members. Burkhard Monien, Giorgio Ausiello and Don Sannella decided not to stand for re-election; the remaining officials named above agreed to continue. The EATCS Council has elected Luca Aceto as new EATCS President for the term 2012 until 2014, beginning with the end of this year's ICALP. Moreover, the council has unanimously elected Burkhard Monien, Paul Spirakis, and Antonin Kucera as the new EATCS Vice Presidents, Dirk Janssens as the new Treasurer, and Maria Serna as the new Bulletin Editor for the term 2012 until 2014. Finally, the council has appointed Vladimiro Sassone, Lars Arge, and Moshe Vardi as the Appointed Council Members for the period of two years. The council has also decided about the composition of the various EATCS committees: The EATCS representatives in the ETAPS steering committee remain unchanged. Don Sannella and Catuscia Palamidessi are elected for these positions. Moreover, the President reports to the audience about the situation of the different chapters of EATCS. Tiziana Calamoneri is still the head of the Italian Chapter of EATCS, Jean-Pierre Jouannaud is still the head of the French Chapter of EATCS and Kazuo Iwama is still the head of the Japanese Chapter of EATCS. Within the Publication Committee Leslie Ann Goldberg replaces Luca Aceto as chair. The remaining members of this committee are Josep Díaz, Juhani Karhumäki, Catuscia Palamidessi, Vladimiro Sassone, and Maria Serna. Moreover, Luca Aceto leaves the ICALP Liaison Committee and the council has given the task of looking for a new candidate for this committee to the new President. The remaining members of the ICALP Liaison Committee are Giuseppe F. Italiano and Juhani Karhumäki.

Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures, 2003