Diameter, Width, Closest Line Pair, and Parametric Searching.
Diamètre de graphes et qualité de service d'un réseau de données
Dicovering spaces.
Die Analyse von empirisch verteilten Zufallsgrössen auf dem Analogrechner
Die Berechnungskomplexität von elementarsymmetrischen Funkit
Die mit Nestedstackautomaten berechenbaren Funktionen sind elementar.
Dies caniculares et tempestates čili reportáž o XII. mezinárodní matematické olympiádě
Difference metrics for interactive orthogonal graph drawing algorithms.
Different time solutions for the firing squad synchronization problem on basic grid networks
We present several solutions to the Firing Squad Synchronization Problem on grid networks of different shapes. The nodes are finite state processors that work in unison with other processors and in synchronized discrete steps. The networks we deal with are: the line, the ring and the square. For all of these models we consider one- and two-way communication modes and we also constrain the quantity of information that adjacent processors can exchange at each step. We first present synchronization...
Differential approximation of NP-hard problems with equal size feasible solutions
In this paper, we focus on some specific optimization problems from graph theory, those for which all feasible solutions have an equal size that depends on the instance size. Once having provided a formal definition of this class of problems, we try to extract some of its basic properties; most of these are deduced from the equivalence, under differential approximation, between two versions of a problem which only differ on a linear transformation of their objective functions. This is notably...
Differential approximation of NP-hard problems with equal size feasible solutions
In this paper, we focus on some specific optimization problems from graph theory, those for which all feasible solutions have an equal size that depends on the instance size. Once having provided a formal definition of this class of problems, we try to extract some of its basic properties; most of these are deduced from the equivalence, under differential approximation, between two versions of a problem π which only differ on a linear transformation of their objective functions. This is notably...
Differential equations, Spencer cohomology, and computing resolutions.
Diffusion models and their accelerated solution in image and surface processing.
Digital search trees and chaos game representation*
In this paper, we consider a possible representation of a DNA sequence in a quaternary tree, in which one can visualize repetitions of subwords (seen as suffixes of subsequences). The CGR-tree turns a sequence of letters into a Digital Search Tree (DST), obtained from the suffixes of the reversed sequence. Several results are known concerning the height, the insertion depth for DST built from independent successive random sequences having the same distribution. Here the successive inserted words...
Digital search trees with keys of variable length
Digital shapes, digital boundaries and rigid transformations: A topological discussion
Curvature is a continuous and infinitesimal notion. These properties induce geometrical difficulties in digital frameworks, and the following question is naturally asked: “How to define and compute curvatures of digital shapes?” In fact, not only geometrical but also topological difficulties are also induced in digital frameworks. The – deeper – question thus arises: “Can we still define and compute curvatures?” This latter question, that is relevant in the context of digitization, i.e., when passing...
Digitization of Mathematical Editions in Serbia
We describe an ongoing project carried out by the Mathematical Institute of Serbian Academy of Sciences and Arts, and the Faculty of Mathematics, Belgrade. The project concerns building of electronic resources and presentations of electronic editions of mathematical works in Serbia, including retro-digitization of old books, articles and the other mathematical works, and development of the corresponding virtual library. The resources built in the project are freely accessible through Internet.
Digits and continuants in euclidean algorithms. Ergodic versus tauberian theorems
We obtain new results regarding the precise average-case analysis of the main quantities that intervene in algorithms of a broad Euclidean type. We develop a general framework for the analysis of such algorithms, where the average-case complexity of an algorithm is related to the analytic behaviour in the complex plane of the set of elementary transformations determined by the algorithms. The methods rely on properties of transfer operators suitably adapted from dynamical systems theory and provide...
Dijkstra's Interpretation of the Approach to Solving a Problem of Program Correctness
Dines: A possibility of direct decision making within the frame of ines