Publication | Date of Publication | Type |
---|
https://portal.mardi4nfdi.de/entity/Q5115465 | 2020-08-13 | Paper |
Inhibiting diffusion of complex contagions in social networks: theoretical and experimental results | 2019-01-17 | Paper |
Bicriteria Network Design Problems | 2019-01-10 | Paper |
A characterization of nested canalyzing functions with maximum average sensitivity | 2018-12-03 | Paper |
Inferring local transition functions of discrete dynamical systems from observations of system behavior | 2017-06-19 | Paper |
Complexity of Inferring Local Transition Functions of Discrete Dynamical Systems | 2015-09-23 | Paper |
Many birds with one stone | 2015-05-07 | Paper |
Properties of deterministic top down grammars | 2014-03-14 | Paper |
Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems | 2011-07-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q3597159 | 2009-02-09 | Paper |
Errata for the paper ``Predecessor existence problems for finite discrete dynamical systems. | 2008-05-19 | Paper |
Predecessor existence problems for finite discrete dynamical systems | 2007-10-25 | Paper |
Complexity of reachability problems for finite discrete dynamical systems | 2006-12-07 | Paper |
Obtaining online approximation algorithms for facility dispersion from offline algorithms | 2006-09-12 | Paper |
https://portal.mardi4nfdi.de/entity/Q4818858 | 2004-09-24 | Paper |
Local base station assignment with time intervals in mobile computing environments | 2004-08-16 | Paper |
https://portal.mardi4nfdi.de/entity/Q4470517 | 2004-07-01 | Paper |
On some special classes of sequential dynamical systems | 2004-03-11 | Paper |
https://portal.mardi4nfdi.de/entity/Q4451017 | 2004-02-22 | Paper |
Reachability problems for sequential dynamical systems with threshold functions. | 2003-08-17 | Paper |
https://portal.mardi4nfdi.de/entity/Q4406683 | 2003-06-26 | Paper |
https://portal.mardi4nfdi.de/entity/Q4785459 | 2003-03-10 | Paper |
Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems. | 2003-01-14 | Paper |
https://portal.mardi4nfdi.de/entity/Q4331197 | 2002-06-10 | Paper |
Efficient construction of minimum makespan schedules for tasks with a fixed number of distinct execution times | 2002-05-14 | Paper |
https://portal.mardi4nfdi.de/entity/Q4262692 | 2001-05-06 | Paper |
Approximation algorithms for degree-constrained minimum-cost network-design problems | 2001-01-01 | Paper |
Alarm placement in systems with fault propagation | 2000-08-21 | Paper |
Facility dispersion problems under capacity and cost constraints | 2000-06-05 | Paper |
Algorithms for Path-Based Placement of Inspection Stations on Networks | 2000-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4258576 | 1999-09-13 | Paper |
Bicriteria Network Design Problems | 1998-12-02 | Paper |
https://portal.mardi4nfdi.de/entity/Q4375775 | 1998-07-13 | Paper |
NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs | 1998-04-26 | Paper |
Early comparison and decision strategies for datapaths that recover from transient faults | 1997-10-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q4356444 | 1997-10-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3128917 | 1997-08-04 | Paper |
On the size of binary decision diagrams representing Boolean functions | 1997-02-28 | Paper |
Spanning Trees—Short or Small | 1996-07-24 | Paper |
Simple heuristics for unit disk graphs | 1995-06-12 | Paper |
Heuristic and Special Case Algorithms for Dispersion Problems | 1995-01-31 | Paper |
Determining performance measures of algorithm-based fault tolerant systems | 1994-03-22 | Paper |
Construction of check sets for algorithm-based fault tolerance | 1994-01-01 | Paper |
The Complexity of Processing Hierarchical Specifications | 1993-09-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4035344 | 1993-05-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q4037432 | 1993-05-18 | Paper |
Representability of Design Objects by Ancestor-Controlled Hierarchical Specifications | 1992-12-06 | Paper |
Compaction of message patterns into succinct representations for multiprocessor interconnection networks | 1992-06-25 | Paper |
Matrix multiplication for finite algebraic systems | 1992-06-25 | Paper |
Sufficient-completeness, ground-reducibility and their complexity | 1991-01-01 | Paper |
Minimizing time-space cost for database version control | 1990-01-01 | Paper |
On the Computational Complexity of Algebra on Lattices | 1987-01-01 | Paper |
Recursion Schemes and Recursive Programs are Exponentially Hard to Analyze | 1986-01-01 | Paper |
Testing for grammatical coverings | 1985-01-01 | Paper |
The complexity of monadic recursion schemes: Exponential time bounds | 1984-01-01 | Paper |
Consistency and Serializability in Concurrent Database Systems | 1984-01-01 | Paper |
Algebraic Structures with Hard Equivalence and Minimization Problems | 1984-01-01 | Paper |
The complexity of monadic recursion schemes: executability problems, nesting depth, and applications | 1983-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3915993 | 1979-01-01 | Paper |
Computational Parallels between the Regular and Context-Free Languages | 1978-01-01 | Paper |
Polynomial Algorithms for Deterministic Pushdown Automata | 1978-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3868788 | 1977-01-01 | Paper |
On Equivalence and Containment Problems for Formal Languages | 1977-01-01 | Paper |
An Analysis of Several Heuristics for the Traveling Salesman Problem | 1977-01-01 | Paper |
On the equivalence, containment, and covering problems for the regular and context-free languages | 1976-01-01 | Paper |
The covering problem for linear context-free grammars | 1976-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4122730 | 1976-01-01 | Paper |
Attributed translations | 1974-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4133163 | 1974-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4062669 | 1973-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5674387 | 1971-01-01 | Paper |
Properties of deterministic top-down grammars | 1970-01-01 | Paper |
Programmed Grammars and Classes of Formal Languages | 1969-01-01 | Paper |
Matrix Equations and Normal Forms for Context-Free Grammars | 1967-01-01 | Paper |