default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJordan Gergov
Person information
- affiliation: Saarland University, Saarbrücken, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2000
[b1]Jordan Gergov:
Algorithms for interval coloring, geometric packing and memory optimization. Saarland University, Saarbrücken, Germany, 2000, pp. 1-225
1990 – 1999
- 1999
- [c7]Jordan Gergov:
Algorithms for Compile-Time Memory Optimization. SODA 1999: 907-908 - 1996
- [j4]Jordan Gergov, Christoph Meinel:
Mod-2-OBDDs - A Data Structure that Generalizes EXOR-Sum-of-Products and Ordered Binary Decision Diagrams. Formal Methods Syst. Des. 8(3): 273-282 (1996) - [c6]Jordan Gergov:
Approximation Algorithms for Dynamic Storage Allocations. ESA 1996: 52-61 - 1995
- [c5]Jürgen Dedorath, Jordan Gergov, Torben Hagerup:
More Efficient Parallel Flow Algorithms. ISAAC 1995: 234-243 - 1994
- [j3]Jordan Gergov, Christoph Meinel:
On the Complexity of Analysis and Manipulation of Boolean Functions in Terms of Decision Graphs. Inf. Process. Lett. 50(6): 317-322 (1994) - [j2]Jordan Gergov:
Time-Space Tradeoffs for Integer Multiplication on Various Types of Input Oblivious Sequential Machines. Inf. Process. Lett. 51(5): 265-269 (1994) - [j1]Jordan Gergov, Christoph Meinel:
Efficient Boolean Manipulation With OBDD's can be Extended to FBDD's. IEEE Trans. Computers 43(10): 1197-1209 (1994) - [c4]Jochen Bern, Jordan Gergov, Christoph Meinel, Anna Slobodová:
Boolean Manipulation with Free BDD's. First Experimental Results. EDAC-ETC-EUROASIC 1994: 200-207 - [c3]Jordan Gergov, Christoph Meinel:
Boolean Manipulation with Free BDDs: An Application in Combinational Logic Verification. IFIP Congress (1) 1994: 309-314 - 1993
- [c2]Jordan Gergov, Christoph Meinel:
Frontiers of Feasible and Probabilistic Feasible Boolean Manipulation with Branching Programs. STACS 1993: 576-585 - [i6]Jordan Gergov, Christoph Meinel:
Combinational Logic Verification with FBDDs. Universität Trier, Mathematik/Informatik, Forschungsbericht 93-08 (1993) - [i5]Jordan Gergov, Christoph Meinel:
Efficient Boolean Manipulation with OBDD's can be Extended to FBDD's. Universität Trier, Mathematik/Informatik, Forschungsbericht 93-12 (1993) - [i4]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) - [i3]Jordan Gergov, Christoph Meinel:
Mod-2-OBDD's: A Generalization of OBDD's and EXOR-Sum-of-Products. Universität Trier, Mathematik/Informatik, Forschungsbericht 93-21 (1993) - 1992
- [c1]Jordan Gergov, Christoph Meinel:
Analysis and Manipulation of Boolean Functions in Terms of Decision Graphs. WG 1992: 310-320 - [i2]Jordan Gergov, Christoph Meinel:
Analysis and Manipulation of Boolean Functions in Terms of Decision Graphs. Universität Trier, Mathematik/Informatik, Forschungsbericht 92-07 (1992) - [i1]Jordan Gergov, Christoph Meinel:
Efficient Analysis and Manipulation of OBDDs can be Extended to Read-once-only Branching Programs. Universität Trier, Mathematik/Informatik, Forschungsbericht 92-10 (1992)
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 2024-04-24 23:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
