Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Anna Slobodová
2010 – today
- 2011
[c20]Anna Slobodová, Jared Davis, Sol Swords, Warren A. Hunt Jr.: A flexible formal verification framework for industrial scale validation. MEMOCODE 2011: 89-97- [e1]Per Bjesse, Anna Slobodová (Eds.): International Conference on Formal Methods in Computer-Aided Design, FMCAD '11, Austin, TX, USA, October 30 - November 02, 2011. FMCAD Inc. 2011, ISBN 978-0-9835678-1-3
2000 – 2009
- 2009
- [c19]Roope Kaivola, Rajnish Ghughal, Naren Narasimhan, Amber Telfer, Jesse Whittemore, Sudhindra Pandav, Anna Slobodová, Christopher Taylor, Vladimir Frolov, Erik Reeber, Armaghan Naik: Replacing Testing with Formal Verification in Intel CoreTM i7 Processor Execution Engine Validation. CAV 2009: 414-429
- 2008
- [c18]Anna Slobodová: Formal Verification of Hardware Support for Advanced Encryption Standard. FMCAD 2008: 1-4
- 2006
- [c17]
- 2001
- [c16]
1990 – 1999
- 1999
- [c15]Christoph Meinel, Klaus Schwettmann, Anna Slobodová: Application Driven Variable Reordering and an Example Implementation in Reachability Analysis. ASP-DAC 1999: 327-330
- 1998
- [c14]Anna Slobodová: On the Composition Problem for OBDDs with Multiple Variable Orders. MFCS 1998: 645-655
- [c13]
- [i14]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)
- [i13]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)
- [i12]Christoph Meinel, Anna Slobodová: Accelerating OBDD-Minimization by Means of Structural and Semantical Properties. Universität Trier, Mathematik/Informatik, Forschungsbericht 98-25 (1998)
- 1997
- [j11]Christoph Meinel, Anna Slobodová: A Unifying Theoretical Background for Some Bdd-based Data Structures. Formal Methods in System Design 11(3): 223-237 (1997)
- [j10]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)
- [c12]Martin Mundhenk, Anna Slobodová: Optimal Non-approximability of MAXCLIQUE. Lectures on Proof Verification and Approximation Algorithms 1997: 235-248
- [c11]
- [c10]
- [c9]Christoph Meinel, Anna Slobodová: A Reducibility Concept for Problems Defined in Terms of Ordered Binary Decision Diagrams. STACS 1997: 213-224
- [i11]Christoph Meinel, Anna Slobodová, Peter Willems: Block-Restricted Reordering - Extended Experiments. Universität Trier, Mathematik/Informatik, Forschungsbericht 97-27 (1997)
- 1996
- [j9]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)
- [j8]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)
- [i10]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)
- [i9]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)
- [i8]Christoph Meinel, Anna Slobodová: Speeding up Variable Reordering of OBDDs . Universität Trier, Mathematik/Informatik, Forschungsbericht 96-40 (1996)
- 1995
- [j7]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)
- [c8]Jochen Bern, Christoph Meinel, Anna Slobodová: Global rebuilding of OBDDs Avoiding Memory Requirement Maxima. CAV 1995: 4-15
- [c7]Jochen Bern, Christoph Meinel, Anna Slobodová: Efficient OBDD-Based Boolean Manipulation in CAD beyond Current Limits. DAC 1995: 408-413
- [i7]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
- [j6]Juraj Hromkovic, Branislav Rovan, Anna Slobodová: Deterministic versus Nondeterministic Space in Terms of Synchronized Alternating Machines. Theor. Comput. Sci. 132(2): 319-336 (1994)
- [c6]Jochen Bern, Jordan Gergov, Christoph Meinel, Anna Slobodová: Boolean Manipulation with Free BDD's. First Experimental Results. EDAC-ETC-EUROASIC 1994: 200-207
- [c5]Christoph Meinel, Anna Slobodová: On the Complexity of Constructing Optimal Ordered Binary Decision Diagrams. MFCS 1994: 515-524
- [i6]Jochen Bern, Christoph Meinel, Anna Slobodová: Some Heuristics for Generating Tree-like FBDD Types. Universität Trier, Mathematik/Informatik, Forschungsbericht 94-03 (1994)
- [i5]Christoph Meinel, Anna Slobodová: On the Complexity of Constructing Optimal OBDD's. Universität Trier, Mathematik/Informatik, Forschungsbericht 94-05 (1994)
- [i4]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)
- [i3]Christoph Meinel, Anna Slobodová: A Unifying Theoretical Background for Some BDD-based Data Structures. Universität Trier, Mathematik/Informatik, Forschungsbericht 94-17 (1994)
- 1993
- [c4]Juraj Hromkovic, Branislav Rovan, Anna Slobodová: Deterministic Versus Nondeterministic Space in Terms of Synchronized Alternating Machines. Developments in Language Theory 1993: 314-325
- [i2]Anna Slobodová, Christoph Meinel: Efficient Manipulation of FBDDs by Means of a Modified OBDD-Package. Universität Trier, Mathematik/Informatik, Forschungsbericht 93-09 (1993)
- [i1]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
- [j5]
- [j4]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)
- [j3]Anna Slobodová: Some Properties of Space-Bounded Synchronized Alternating Turin Machines with Universal States ONly. Theor. Comput. Sci. 96(2): 411-419 (1992)
- 1991
- [j2]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
- [j1]Anna Slobodová: One-Way Globally Deterministic Synchronized Alternating Finite Automata Recognize Exactly Deterministic Context-Sensitive Languages. Inf. Process. Lett. 36(2): 69-72 (1990)
1980 – 1989
- 1989
- [c3]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
- [c2]Anna Slobodová: Some Properties of Space-Bounded Synchronized Alternating Turing Machines with Only Universal States. IMYCS 1988: 102-113
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 20:53 CET by the dblp team