Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Daniel Krob

dblp:97/3247 · DBLP profile ↗
← Back
22ranked-venue papers
9as first author
0since 2021 · last 2013
0000-0003-4418-8300ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 16 · 8 first-authorComputer networks · 2 · 1 first-authorSoftware engineering, systems software and programming languages · 2 · 1 first-authorArtificial intelligence and machine learning · 1Systems, architecture and hardware · 1Databases, data management, data science and information retrieval · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
3 papers
Automata and formal languages · 45% Computational complexity · 19% Combinatorics and discrete mathematics · 16%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Automata and formal languages › formal power series
rational series
0.011992
The Equality Problem for Rational Series with Multiplicities in the Tropical Semiring is Undecidable · ICALP 1992
Computational complexity
undecidability
0.011992
The Equality Problem for Rational Series with Multiplicities in the Tropical Semiring is Undecidable · ICALP 1992
Combinatorics and discrete mathematics
algebraic combinatorics
0.011991
Lazard's Factorizations of Free Partially Commutative Monoids · ICALP 1991
Automata and formal languages › semigroup theory
monoid theory
0.011991
Lazard's Factorizations of Free Partially Commutative Monoids · ICALP 1991
Logic in computer science
process algebra
0.011990
A Complete System of B-Rational Identities · ICALP 1990
Automata and formal languages
weighted automata
0.011992
The Equality Problem for Rational Series with Multiplicities in the Tropical Semiring is Undecidable · ICALP 1992
Coding theory › error-correcting codes › block codes › linear code
parity-check matrix
0.011991
Lazard's Factorizations of Free Partially Commutative Monoids · ICALP 1991
Automata and formal languages › regular languages
regular expressions
0.011990
A Complete System of B-Rational Identities · ICALP 1990

Methods — techniques the papers use, named apart from their topics

semiring theory · 0.0equational logic · 0.0
YearPublicationVenuePosition
2013 An Adequate Logic for Heterogeneous Systems
abstract
We coalgebraically define a unified semantics for systems with an emphasis on the notion of time. Such a semantics intends to formalize system that underly system engineering (i.e. the discipline focusing on the integration mastery of large industrial systems).Moreover, we give a formal meaning to another important aspect of systems engineering: system requirements, constraining the expected properties of a system. To express such requirements, we define a logic that extends μ-calculus to our coalgebraic definition of systems. We establish an important property of this logic: adequacy.
Marc Aiguier, Boris Golden, Daniel Krob
ICECCS3
2009 Modelling of Complex Systems: Systems as Dataflow Machines
abstract
We develop a unified functional formalism for modelling complex systems, that is to say systems that are composed of a number of heterogeneous components, including typically software and physical devices. Our approach relies on non-standard analysis that allows us to model continuous time in a discrete way. S ystems are defined as generalized Turing machines with temporized input, internal and output mechanisms. Behaviors of systems are represented by transfer functions. A transfer function is said to be implementable if it is associated with a system. This notion leads us to define a new class – which is natural in our framework – of computable functions on (usual) real numbers. We show that our definitions are robust: on one hand, the class of implementable transfer functions is closed under composition; on the other hand, the class of computable functions in our meaning includes analytical functions whose coefficients are computable in the usual way, and is closed under addition, multiplication, differentiation and integration. Our class of computable functions also includes solutions of dynamical and Hamiltonian systems defined by computable functions. Hence, our notion of system appears to take suitably into account physical systems.
Simon Bliudze, Daniel Krob
Fundam. Informaticae2
2008 Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks
Giacomo Nannicini, Philippe Baptiste, Daniel Krob, Leo Liberti
COCOA3
2007 Fast point-to-point shortest path queries on dynamic road networks with interfal data
Giacomo Nannicini, Philippe Baptiste, Daniel Krob, Leo Liberti
CTW3
2006 Modelling of Complex Software Systems: A Reasoned Overview
Daniel Krob
FORTE1
2005 On optimal hybrid ARQ control schemes for HSDPA with 16QAM
abstract
We consider several hybrid ARQ (H-ARQ) control schemes for high speed downlink packet access (HSDPA) with 16 symbols quadrature amplitude modulation (16QAM). These schemes consist of a sequence of values for the X/sub rv/ parameter to be used at sequential retransmissions when a block is not decoded correctly. A choice of an H-ARQ control scheme influences two parameters: quality of service (QoS) and user equipment (UE) buffer requirements. Based on several link level simulations, we propose an optimal control scheme using maximum space, as well as two slightly suboptimal ones that allow to reduce the UE buffer size.
Simon Bliudze, Nicolas Billy, Daniel Krob
WiMob (1)3
2005 Performance evaluation of demodulation with diversity--a combinatorial approach II: bijective methods
Daniel Krob, Ekaterina A. Vassilieva
Discret. Appl. Math.1
2002 On the Average Parallelism in Trace Monoids
Daniel Krob, Jean Mairesse, Ioannis Michos
STACS1
2001 Some Algorithms for Synchronizing Clocks of Base Transceiver Stations in a Cellular Network
Jean-Louis Dornstetter, Daniel Krob, Michel Morvan, Laurent Viennot
J. Parallel Distributed Comput.2
2001 DIAL M for Mobility: Discrete Algorithms and Methods for Mobile Computing and Communications
Afonso Ferreira, Daniel Krob
Mob. Networks Appl.2
1997 Recognizable Subsets of the Two Letter Plactic Monoid
André Arnold, Mathias Kanta, Daniel Krob
Inf. Process. Lett.3
1996 Remarks on Generalized Post Correspondence Problem
Tero Harju, Juhani Karhumäki, Daniel Krob
STACS3
1994 A Complete System of Identities for One-Letter Rational Expressions with Multiplicities in the Tropical Semiring
Agnès Bonnier-Rigny, Daniel Krob
Theor. Comput. Sci.2
1993 Partially Commutative Lyndon Words
Daniel Krob, Pierre Lalonde
STACS1
1992 The Equality Problem for Rational Series with Multiplicities in the Tropical Semiring is Undecidable
Daniel Krob
ICALP1
1992 Models of a K-Rational Identity System
Daniel Krob
J. Comput. Syst. Sci.1
1992 On the Partially Commutative Shuffle Product
Gérard Duchamp, Daniel Krob
Theor. Comput. Sci.2
1991 Lazard's Factorizations of Free Partially Commutative Monoids
Gérard Duchamp, Daniel Krob
ICALP2
1991 Stochastic Automata and Length Distributions of Rational Languages
Georges Hansel, Daniel Krob, Christian Michaux
MFCS2
1991 Some Examples of Formal Series Used in Non-Commutative Algebra
Daniel Krob
Theor. Comput. Sci.1
1991 Complete Systems of B-Rational Identities
Daniel Krob
Theor. Comput. Sci.1
1990 A Complete System of B-Rational Identities
Daniel Krob
ICALP1