Person:549707: Difference between revisions

From MaRDI portal
Person:549707
m AuthorDisambiguator moved page Person:203743 to Daniel J. Rosenkrantz: Duplicate
m AuthorDisambiguator moved page Daniel J. Rosenkrantz to Daniel J. Rosenkrantz: Duplicate
 
(No difference)

Latest revision as of 04:05, 9 December 2023

Available identifiers

zbMath Open rosenkrantz.daniel-jDBLP80/6105WikidataQ102353197 ScholiaQ102353197MaRDI QIDQ549707

List of research outcomes





PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q51154652020-08-13Paper
Inhibiting diffusion of complex contagions in social networks: theoretical and experimental results2019-01-17Paper
Bicriteria Network Design Problems2019-01-10Paper
A characterization of nested canalyzing functions with maximum average sensitivity2018-12-03Paper
Inferring local transition functions of discrete dynamical systems from observations of system behavior2017-06-19Paper
Complexity of Inferring Local Transition Functions of Discrete Dynamical Systems2015-09-23Paper
Many birds with one stone2015-05-07Paper
Properties of deterministic top down grammars2014-03-14Paper
Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems2011-07-18Paper
https://portal.mardi4nfdi.de/entity/Q35971592009-02-09Paper
Errata for the paper ``Predecessor existence problems for finite discrete dynamical systems.2008-05-19Paper
Predecessor existence problems for finite discrete dynamical systems2007-10-25Paper
Complexity of reachability problems for finite discrete dynamical systems2006-12-07Paper
Obtaining online approximation algorithms for facility dispersion from offline algorithms2006-09-12Paper
https://portal.mardi4nfdi.de/entity/Q48188582004-09-24Paper
Local base station assignment with time intervals in mobile computing environments2004-08-16Paper
https://portal.mardi4nfdi.de/entity/Q44705172004-07-01Paper
On some special classes of sequential dynamical systems2004-03-11Paper
https://portal.mardi4nfdi.de/entity/Q44510172004-02-22Paper
Reachability problems for sequential dynamical systems with threshold functions.2003-08-17Paper
https://portal.mardi4nfdi.de/entity/Q44066832003-06-26Paper
https://portal.mardi4nfdi.de/entity/Q47854592003-03-10Paper
Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems.2003-01-14Paper
https://portal.mardi4nfdi.de/entity/Q43311972002-06-10Paper
Efficient construction of minimum makespan schedules for tasks with a fixed number of distinct execution times2002-05-14Paper
https://portal.mardi4nfdi.de/entity/Q42626922001-05-06Paper
Approximation algorithms for degree-constrained minimum-cost network-design problems2001-01-01Paper
Alarm placement in systems with fault propagation2000-08-21Paper
Facility dispersion problems under capacity and cost constraints2000-06-05Paper
Algorithms for Path-Based Placement of Inspection Stations on Networks2000-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42585761999-09-13Paper
Bicriteria Network Design Problems1998-12-02Paper
https://portal.mardi4nfdi.de/entity/Q43757751998-07-13Paper
NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs1998-04-26Paper
Early comparison and decision strategies for datapaths that recover from transient faults1997-10-28Paper
https://portal.mardi4nfdi.de/entity/Q43564441997-10-01Paper
https://portal.mardi4nfdi.de/entity/Q31289171997-08-04Paper
On the size of binary decision diagrams representing Boolean functions1997-02-28Paper
Spanning Trees—Short or Small1996-07-24Paper
Simple heuristics for unit disk graphs1995-06-12Paper
Heuristic and Special Case Algorithms for Dispersion Problems1995-01-31Paper
Determining performance measures of algorithm-based fault tolerant systems1994-03-22Paper
Construction of check sets for algorithm-based fault tolerance1994-01-01Paper
The Complexity of Processing Hierarchical Specifications1993-09-01Paper
https://portal.mardi4nfdi.de/entity/Q40353441993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40374321993-05-18Paper
Representability of Design Objects by Ancestor-Controlled Hierarchical Specifications1992-12-06Paper
Compaction of message patterns into succinct representations for multiprocessor interconnection networks1992-06-25Paper
Matrix multiplication for finite algebraic systems1992-06-25Paper
Sufficient-completeness, ground-reducibility and their complexity1991-01-01Paper
Minimizing time-space cost for database version control1990-01-01Paper
On the Computational Complexity of Algebra on Lattices1987-01-01Paper
Recursion Schemes and Recursive Programs are Exponentially Hard to Analyze1986-01-01Paper
Testing for grammatical coverings1985-01-01Paper
The complexity of monadic recursion schemes: Exponential time bounds1984-01-01Paper
Consistency and Serializability in Concurrent Database Systems1984-01-01Paper
Algebraic Structures with Hard Equivalence and Minimization Problems1984-01-01Paper
The complexity of monadic recursion schemes: executability problems, nesting depth, and applications1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39159931979-01-01Paper
Computational Parallels between the Regular and Context-Free Languages1978-01-01Paper
Polynomial Algorithms for Deterministic Pushdown Automata1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38687881977-01-01Paper
On Equivalence and Containment Problems for Formal Languages1977-01-01Paper
An Analysis of Several Heuristics for the Traveling Salesman Problem1977-01-01Paper
On the equivalence, containment, and covering problems for the regular and context-free languages1976-01-01Paper
The covering problem for linear context-free grammars1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41227301976-01-01Paper
Attributed translations1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41331631974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40626691973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56743871971-01-01Paper
Properties of deterministic top-down grammars1970-01-01Paper
Programmed Grammars and Classes of Formal Languages1969-01-01Paper
Matrix Equations and Normal Forms for Context-Free Grammars1967-01-01Paper

Research outcomes over time

This page was built for person: Daniel J. Rosenkrantz