| 2006 |
|---|
| 42 | EE | Anna Slobodová:
Challenges for Formal Verification in Industrial Setting.
FMICS/PDMC 2006: 1-22 |
| 2001 |
|---|
| 41 | EE | Anna Slobodová:
Formal Verification Methods for Industrial Hardware Design.
SOFSEM 2001: 116-135 |
| 1999 |
|---|
| 40 | EE | Christoph Meinel,
Klaus Schwettmann,
Anna Slobodová:
Application Driven Variable Reordering and an Example Implementation in Reachability Analysis.
ASP-DAC 1999: 327-330 |
| 1998 |
|---|
| 39 | EE | Anna Slobodová:
On the Composition Problem for OBDDs with Multiple Variable Orders.
MFCS 1998: 645-655 |
| 38 | EE | Anna Slobodová,
Christoph Meinel:
Sample Method for Minimization of OBDDs.
SOFSEM 1998: 419-428 |
| 37 | | Gianpiero Cabodi,
Stefano Quer,
Christoph Meinel,
Harald Sack,
Anna Slobodová,
Christian Stangier:
Binary Decision Diagrams and the Multiple Variable Order Problem
Universität Trier, Mathematik/Informatik, Forschungsbericht 98-22: (1998) |
| 36 | | Christoph Meinel,
Klaus Schwettmann,
Anna Slobodová:
Application Driven Variable Reordering and an Example in Reachability Analysis
Universität Trier, Mathematik/Informatik, Forschungsbericht 98-24: (1998) |
| 35 | | Christoph Meinel,
Anna Slobodová:
Accelerating OBDD-Minimization by Means of Structural and Semantical Properties
Universität Trier, Mathematik/Informatik, Forschungsbericht 98-25: (1998) |
| 1997 |
|---|
| 34 | | Anna Slobodová:
Multivalued Extension of Conditional Belief Functions.
ECSQARU-FAPR 1997: 568-573 |
| 33 | | Christoph Meinel,
Anna Slobodová:
Speeding up Variable Reordering of OBDDs.
ICCD 1997: 338-343 |
| 32 | EE | Martin Mundhenk,
Anna Slobodová:
Optimal Non-approximability of MAXCLIQUE.
Lectures on Proof Verification and Approximation Algorithms 1997: 235-248 |
| 31 | | Christoph Meinel,
Anna Slobodová:
A Reducibility Concept for Problems Defined in Terms of Ordered Binary Decision Diagrams.
STACS 1997: 213-224 |
| 30 | | Christoph Meinel,
Anna Slobodová:
A Unifying Theoretical Background for Some Bdd-based Data Structures.
Formal Methods in System Design 11(3): 223-237 (1997) |
| 29 | | Christoph Meinel,
Anna Slobodová:
A Reducibility Concept for Problems Defined in Terms of Ordered Binary Decision Diagrams.
Theory Comput. Syst. 30(5): 495-518 (1997) |
| 28 | | Christoph Meinel,
Anna Slobodová,
Peter Willems:
Block-Restricted Reordering - Extended Experiments
Universität Trier, Mathematik/Informatik, Forschungsbericht 97-27: (1997) |
| 1996 |
|---|
| 27 | EE | Christoph Meinel,
Anna Slobodová:
An Adequate Reducibility Concept for Problems Defined in Terms of Ordered Binary Decision Diagrams
Electronic Colloquium on Computational Complexity (ECCC) 3(10): (1996) |
| 26 | EE | Jochen Bern,
Christoph Meinel,
Anna Slobodová:
Some heuristics for generating tree-like FBDD types.
IEEE Trans. on CAD of Integrated Circuits and Systems 15(1): 127-130 (1996) |
| 25 | EE | Jochen Bern,
Christoph Meinel,
Anna Slobodová:
Global rebuilding of OBDD's avoiding memory requirement maxima.
IEEE Trans. on CAD of Integrated Circuits and Systems 15(1): 131-134 (1996) |
| 24 | | Christoph Meinel,
Anna Slobodová:
An Adequate Reducibility Concept for Problems Defined in Terms of Ordered Binary Decision Diagrams
Universität Trier, Mathematik/Informatik, Forschungsbericht 96-02: (1996) |
| 23 | | Christoph Meinel,
Anna Slobodová:
Speeding up Variable Reordering of OBDDs
Universität Trier, Mathematik/Informatik, Forschungsbericht 96-40: (1996) |
| 1995 |
|---|
| 22 | | Jochen Bern,
Christoph Meinel,
Anna Slobodová:
Global rebuilding of OBDDs Avoiding Memory Requirement Maxima.
CAV 1995: 4-15 |
| 21 | EE | Jochen Bern,
Christoph Meinel,
Anna Slobodová:
Efficient OBDD-Based Boolean Manipulation in CAD beyond Current Limits.
DAC 1995: 408-413 |
| 20 | | Anna Slobodová:
On the Power of One-Way Globally Deterministic Synchronized Alternating Turing Maschines and Multihead Automata.
Int. J. Found. Comput. Sci. 6(4): 431-446 (1995) |
| 19 | | Jochen Bern,
Christoph Meinel,
Anna Slobodová:
Global Rebuilding of OBDD's - Tunneling Memory Requirement Maxima
Universität Trier, Mathematik/Informatik, Forschungsbericht 95-03: (1995) |
| 1994 |
|---|
| 18 | | Jochen Bern,
Jordan Gergov,
Christoph Meinel,
Anna Slobodová:
Boolean Manipulation with Free BDD's. First Experimental Results.
EDAC-ETC-EUROASIC 1994: 200-207 |
| 17 | | Christoph Meinel,
Anna Slobodová:
On the Complexity of Constructing Optimal Ordered Binary Decision Diagrams.
MFCS 1994: 515-524 |
| 16 | | Juraj Hromkovic,
Branislav Rovan,
Anna Slobodová:
Deterministic versus Nondeterministic Space in Terms of Synchronized Alternating Machines.
Theor. Comput. Sci. 132(2): 319-336 (1994) |
| 15 | | Jochen Bern,
Christoph Meinel,
Anna Slobodová:
Some Heuristics for Generating Tree-like FBDD Types
Universität Trier, Mathematik/Informatik, Forschungsbericht 94-03: (1994) |
| 14 | | Christoph Meinel,
Anna Slobodová:
On the Complexity of Constructing Optimal OBDD's
Universität Trier, Mathematik/Informatik, Forschungsbericht 94-05: (1994) |
| 13 | | Jochen Bern,
Christoph Meinel,
Anna Slobodová:
Efficient OBDD-Based Boolean Manipulation in CAD Beyond Current Limits
Universität Trier, Mathematik/Informatik, Forschungsbericht 94-16: (1994) |
| 12 | | Christoph Meinel,
Anna Slobodová:
A Unifying Theoretical Background for Some BDD-based Data Structures
Universität Trier, Mathematik/Informatik, Forschungsbericht 94-17: (1994) |
| 1993 |
|---|
| 11 | | Juraj Hromkovic,
Branislav Rovan,
Anna Slobodová:
Deterministic Versus Nondeterministic Space in Terms of Synchronized Alternating Machines.
Developments in Language Theory 1993: 314-325 |
| 10 | | Anna Slobodová,
Christoph Meinel:
Efficient Manipulation of FBDDs by Means of a Modified OBDD-Package
Universität Trier, Mathematik/Informatik, Forschungsbericht 93-09: (1993) |
| 9 | | Jochen Bern,
Jordan Gergov,
Christoph Meinel,
Anna Slobodová:
Boolean Manipulation with Free BDD's - First Experimental Results
Universität Trier, Mathematik/Informatik, Forschungsbericht 93-20: (1993) |
| 1992 |
|---|
| 8 | | Anna Slobodová:
Communication for Alternating Machines.
Acta Inf. 29(5): 425-441 (1992) |
| 7 | | Juraj Hromkovic,
Katsushi Inoue,
Branislav Rovan,
Anna Slobodová,
Itsuo Takanami,
Klaus W. Wagner:
On the Power of One-Way Synchronized Alternating Machines with Small Space.
Int. J. Found. Comput. Sci. 3(1): 65-79 (1992) |
| 6 | | Anna Slobodová:
Some Properties of Space-Bounded Synchronized Alternating Turin Machines with Universal States ONly.
Theor. Comput. Sci. 96(2): 411-419 (1992) |
| 1991 |
|---|
| 5 | EE | Juraj Hromkovic,
Juhani Karhumäki,
Branislav Rovan,
Anna Slobodová:
On the power of synchronization in parallel computations.
Discrete Applied Mathematics 32(2): 155-182 (1991) |
| 1990 |
|---|
| 4 | | Anna Slobodová:
One-Way Globally Deterministic Synchronized Alternating Finite Automata Recognize Exactly Deterministic Context-Sensitive Languages.
Inf. Process. Lett. 36(2): 69-72 (1990) |
| 1989 |
|---|
| 3 | | Jürgen Dassow,
Juraj Hromkovic,
Juhani Karhumäki,
Branislav Rovan,
Anna Slobodová:
On the Power of Synchronization in Parallel Computations.
MFCS 1989: 196-206 |
| 1988 |
|---|
| 2 | | Anna Slobodová:
Some Properties of Space-Bounded Synchronized Alternating Turing Machines with Only Universal States.
IMYCS 1988: 102-113 |
| 1 | | Anna Slobodová:
On the Power of Communication in Alternating Machines.
MFCS 1988: 518-528 |
