Остановите войну!
for scientists:
default search action
Anna Slobodová
- > Home > Persons > Anna Slobodová
Publications
- 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
- [c13]Anna Slobodová, Christoph Meinel:
Sample Method for Minimization of OBDDs. SOFSEM 1998: 419-428 - [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
- [j12]Christoph Meinel, Anna Slobodová:
A Unifying Theoretical Background for Some Bdd-based Data Structures. Formal Methods Syst. Des. 11(3): 223-237 (1997) - [j11]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 - [c10]Christoph Meinel, Anna Slobodová:
Speeding up Variable Reordering of OBDDs. ICCD 1997: 338-343 - [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
- [j10]Jochen Bern, Christoph Meinel, Anna Slobodová:
Some heuristics for generating tree-like FBDD types. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 15(1): 127-130 (1996) - [j9]Jochen Bern, Christoph Meinel, Anna Slobodová:
Global rebuilding of OBDD's avoiding memory requirement maxima. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 15(1): 131-134 (1996) - [i10]Christoph Meinel, Anna Slobodová:
An Adequate Reducibility Concept for Problems Defined in Terms of Ordered Binary Decision Diagrams. Electron. Colloquium Comput. Complex. TR96 (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
- [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
- [j7]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]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) - 1991
- [j3]Juraj Hromkovic, Juhani Karhumäki, Branislav Rovan, Anna Slobodová:
On the power of synchronization in parallel computations. Discret. Appl. Math. 32(2): 155-182 (1991) - 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-09-28 03:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint