| Publication | Date of Publication | Type |
|---|
Theoretical foundations for parent divorcing transformations in Bayesian networks
Theoretical Computer Science | 2025-04-07 | Paper |
Fundamental limitations on efficiently forecasting certain epidemic measures in network models
Proceedings of the National Academy of Sciences of the United States of America | 2025-03-05 | Paper |
Synchronous dynamical systems on directed acyclic graphs: complexity and algorithms
ACM Transactions on Computation Theory | 2025-02-25 | Paper |
Symmetry properties of nested canalyzing functions
(available as arXiv preprint) | 2020-08-13 | Paper |
Inhibiting diffusion of complex contagions in social networks: theoretical and experimental results
Data Mining and Knowledge Discovery | 2019-01-17 | Paper |
Bicriteria network design problems
Lecture Notes in Computer Science | 2019-01-10 | Paper |
A characterization of nested canalyzing functions with maximum average sensitivity
Discrete Applied Mathematics | 2018-12-03 | Paper |
Inferring local transition functions of discrete dynamical systems from observations of system behavior
Theoretical Computer Science | 2017-06-19 | Paper |
Complexity of inferring local transition functions of discrete dynamical systems
Implementation and Application of Automata | 2015-09-23 | Paper |
Many birds with one stone
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Properties of deterministic top down grammars
Proceedings of the first annual ACM symposium on Theory of computing - STOC '69 | 2014-03-14 | Paper |
Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems
Theoretical Computer Science | 2011-07-18 | Paper |
| scientific article; zbMATH DE number 5504161 (Why is no real title available?) | 2009-02-09 | Paper |
Errata for the paper ``Predecessor existence problems for finite discrete dynamical systems''.
Theoretical Computer Science | 2008-05-19 | Paper |
Predecessor existence problems for finite discrete dynamical systems
Theoretical Computer Science | 2007-10-25 | Paper |
Complexity of reachability problems for finite discrete dynamical systems
Journal of Computer and System Sciences | 2006-12-07 | Paper |
Obtaining online approximation algorithms for facility dispersion from offline algorithms
Networks | 2006-09-12 | Paper |
| scientific article; zbMATH DE number 2102770 (Why is no real title available?) | 2004-09-24 | Paper |
Local base station assignment with time intervals in mobile computing environments
European Journal of Operational Research | 2004-08-16 | Paper |
| scientific article; zbMATH DE number 2077132 (Why is no real title available?) | 2004-07-01 | Paper |
On some special classes of sequential dynamical systems
Annals of Combinatorics | 2004-03-11 | Paper |
| scientific article; zbMATH DE number 2046041 (Why is no real title available?) | 2004-02-22 | Paper |
Reachability problems for sequential dynamical systems with threshold functions.
Theoretical Computer Science | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1940302 (Why is no real title available?) | 2003-06-26 | Paper |
| scientific article; zbMATH DE number 1848281 (Why is no real title available?) | 2003-03-10 | Paper |
Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems.
Information and Computation | 2003-01-14 | Paper |
| scientific article; zbMATH DE number 1741013 (Why is no real title available?) | 2002-06-10 | Paper |
Efficient construction of minimum makespan schedules for tasks with a fixed number of distinct execution times
Algorithmica | 2002-05-14 | Paper |
| scientific article; zbMATH DE number 1340882 (Why is no real title available?) | 2001-05-06 | Paper |
Approximation algorithms for degree-constrained minimum-cost network-design problems
Algorithmica | 2001-01-01 | Paper |
Alarm placement in systems with fault propagation
Theoretical Computer Science | 2000-08-21 | Paper |
Facility dispersion problems under capacity and cost constraints
Journal of Combinatorial Optimization | 2000-06-05 | Paper |
Algorithms for Path-Based Placement of Inspection Stations on Networks
INFORMS Journal on Computing | 2000-01-01 | Paper |
| scientific article; zbMATH DE number 1335885 (Why is no real title available?) | 1999-09-13 | Paper |
| scientific article; zbMATH DE number 1114007 (Why is no real title available?) | 1998-07-13 | Paper |
NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
Journal of Algorithms | 1998-04-26 | Paper |
Early comparison and decision strategies for datapaths that recover from transient faults
IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications | 1997-10-28 | Paper |
| scientific article; zbMATH DE number 1069491 (Why is no real title available?) | 1997-10-01 | Paper |
| scientific article; zbMATH DE number 1003287 (Why is no real title available?) | 1997-08-04 | Paper |
On the size of binary decision diagrams representing Boolean functions
Theoretical Computer Science | 1997-02-28 | Paper |
Spanning Trees—Short or Small
SIAM Journal on Discrete Mathematics | 1996-07-24 | Paper |
Simple heuristics for unit disk graphs
Networks | 1995-06-12 | Paper |
Heuristic and Special Case Algorithms for Dispersion Problems
Operations Research | 1995-01-31 | Paper |
Determining performance measures of algorithm-based fault tolerant systems
Journal of Parallel and Distributed Computing | 1994-03-22 | Paper |
Construction of check sets for algorithm-based fault tolerance
IEEE Transactions on Computers | 1994-01-01 | Paper |
The Complexity of Processing Hierarchical Specifications
SIAM Journal on Computing | 1993-09-01 | Paper |
| scientific article; zbMATH DE number 177561 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 176240 (Why is no real title available?) | 1993-05-18 | Paper |
Representability of Design Objects by Ancestor-Controlled Hierarchical Specifications
SIAM Journal on Computing | 1992-12-06 | Paper |
Matrix multiplication for finite algebraic systems
Information Processing Letters | 1992-06-25 | Paper |
Compaction of message patterns into succinct representations for multiprocessor interconnection networks
Journal of Parallel and Distributed Computing | 1992-06-25 | Paper |
Sufficient-completeness, ground-reducibility and their complexity
Acta Informatica | 1991-01-01 | Paper |
Minimizing time-space cost for database version control
Acta Informatica | 1990-01-01 | Paper |
On the Computational Complexity of Algebra on Lattices
SIAM Journal on Computing | 1987-01-01 | Paper |
Recursion Schemes and Recursive Programs are Exponentially Hard to Analyze
SIAM Journal on Computing | 1986-01-01 | Paper |
Testing for grammatical coverings
Theoretical Computer Science | 1985-01-01 | Paper |
Consistency and Serializability in Concurrent Database Systems
SIAM Journal on Computing | 1984-01-01 | Paper |
Algebraic Structures with Hard Equivalence and Minimization Problems
Journal of the ACM | 1984-01-01 | Paper |
The complexity of monadic recursion schemes: Exponential time bounds
Journal of Computer and System Sciences | 1984-01-01 | Paper |
The complexity of monadic recursion schemes: executability problems, nesting depth, and applications
Theoretical Computer Science | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3727586 (Why is no real title available?) | 1979-01-01 | Paper |
Computational Parallels between the Regular and Context-Free Languages
SIAM Journal on Computing | 1978-01-01 | Paper |
Polynomial Algorithms for Deterministic Pushdown Automata
SIAM Journal on Computing | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3671712 (Why is no real title available?) | 1977-01-01 | Paper |
An Analysis of Several Heuristics for the Traveling Salesman Problem
SIAM Journal on Computing | 1977-01-01 | Paper |
On Equivalence and Containment Problems for Formal Languages
Journal of the ACM | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3548373 (Why is no real title available?) | 1976-01-01 | Paper |
On the equivalence, containment, and covering problems for the regular and context-free languages
Journal of Computer and System Sciences | 1976-01-01 | Paper |
The covering problem for linear context-free grammars
Theoretical Computer Science | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3557271 (Why is no real title available?) | 1974-01-01 | Paper |
Attributed translations
Journal of Computer and System Sciences | 1974-01-01 | Paper |
| scientific article; zbMATH DE number 3480122 (Why is no real title available?) | 1973-01-01 | Paper |
| scientific article; zbMATH DE number 3408887 (Why is no real title available?) | 1971-01-01 | Paper |
Properties of deterministic top-down grammars
Information and Control | 1970-01-01 | Paper |
Programmed Grammars and Classes of Formal Languages
Journal of the ACM | 1969-01-01 | Paper |
Matrix Equations and Normal Forms for Context-Free Grammars
Journal of the ACM | 1967-01-01 | Paper |
Bicriteria network design problems
Journal of Algorithms | N/A | Paper |
