Jordan Gergov

According to our database, Jordan Gergov authored at least 15 papers between 1992 and 2000.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2000

Algorithms for interval coloring, geometric packing and memory optimization.

Jordan Gergov

PhD thesis, 2000

1999

Algorithms for Compile-Time Memory Optimization.

Jordan Gergov

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1996

Mod-2-OBDDs - A Data Structure that Generalizes EXOR-Sum-of-Products and Ordered Binary Decision Diagrams.

Jordan Gergov, Christoph Meinel

Formal Methods Syst. Des., 1996

Approximation Algorithms for Dynamic Storage Allocations.

Jordan Gergov

Proceedings of the Algorithms, 1996

1995

More Efficient Parallel Flow Algorithms.

Jürgen Dedorath, Jordan Gergov, Torben Hagerup

Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

1994

Efficient Boolean Manipulation With OBDD's can be Extended to FBDD's.

Jordan Gergov, Christoph Meinel

IEEE Trans. Computers, 1994

On the Complexity of Analysis and Manipulation of Boolean Functions in Terms of Decision Graphs.

Jordan Gergov, Christoph Meinel

Inf. Process. Lett., 1994

Time-Space Tradeoffs for Integer Multiplication on Various Types of Input Oblivious Sequential Machines.

Jordan Gergov

Inf. Process. Lett., 1994

Boolean Manipulation with Free BDDs: An Application in Combinational Logic Verification.

Jordan Gergov, Christoph Meinel

Proceedings of the Technology and Foundations - Information Processing '94, Volume 1, Proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 28 August, 1994

1993

Mod-2-OBDD's: A Generalization of OBDD's and EXOR-Sum-of-Products

Jordan Gergov, Christoph Meinel

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1993

Boolean Manipulation with Free BDD's - First Experimental Results

Jochen Bern, Jordan Gergov, Christoph Meinel, Anna Slobodová

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1993

Combinational Logic Verification with FBDDs

Jordan Gergov, Christoph Meinel

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1993

Frontiers of Feasible and Probabilistic Feasible Boolean Manipulation with Branching Programs.

Jordan Gergov, Christoph Meinel

Proceedings of the STACS 93, 1993

1992

Efficient Analysis and Manipulation of OBDDs can be Extended to Read-once-only Branching Programs

Jordan Gergov, Christoph Meinel

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1992

Analysis and Manipulation of Boolean Functions in Terms of Decision Graphs

Jordan Gergov, Christoph Meinel

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1992