Concepedia

Jordan Gergov

JG

Statistics

Publications

6

Citations

314

H-Index

6

Active since

1994

Affiliations

Universität Trier(Current)

Max Planck Society

Max Planck Institute for Informatics

Jordan Gergov is an author at Universität Trier specializing in computer science, engineering, and computational complexity.

Top concepts

EngineeringComputer ScienceComputational ComplexityCircuit ComplexityAutomated ReasoningFormal MethodsProgram AnalysisSoftware AnalysisParallel ComputingFormal Verification

Publications per year

1994–2002

6

Publications

6

Efficient Boolean manipulation with OBDD's can be extended to FBDD's

Jordan Gergov, Christoph Meinel · IEEE Transactions on Computers · 1994 · 111 citations

Circuit Complexity, Engineering, Boolean Function +16

Algorithms for compile-time memory optimization

Jordan Gergov · Symposium on Discrete Algorithms · 1999 · 66 citations

Engineering, Program Analysis, Compiler Technology +10

Approximation algorithms for dynamic storage allocation

Jordan Gergov · Lecture notes in computer science · 1996 · 44 citations

Engineering, Storage Management, Computer Architecture +7

Mod-2-OBDDs—A data structure that generalizes EXOR-sum-of-products and ordered binary decision diagrams

Jordan Gergov, Christoph Meinel · Formal Methods in System Design · 1996 · 38 citations

Circuit Complexity, Decision Procedure, Engineering +11

Time–space tradeoffs for integer multiplication on various types of input oblivious sequential machines

Jordan Gergov · Information Processing Letters · 1994 · 33 citations

Theory Of Computing, Computational Complexity Theory, Engineering +7

1–5 of 6