Jordan Gergov

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2000
Algorithms for interval coloring, geometric packing and memory optimization.
PhD thesis, 2000

1999
Algorithms for Compile-Time Memory Optimization.
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.
Formal Methods Syst. Des., 1996

Approximation Algorithms for Dynamic Storage Allocations.
Proceedings of the Algorithms, 1996

1995
More Efficient Parallel Flow Algorithms.
Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

1994
On the Complexity of Analysis and Manipulation of Boolean Functions in Terms of Decision Graphs.
Inf. Process. Lett., 1994

Time-Space Tradeoffs for Integer Multiplication on Various Types of Input Oblivious Sequential Machines.
Inf. Process. Lett., 1994

Boolean Manipulation with Free BDDs: An Application in Combinational Logic Verification.
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
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1993

Boolean Manipulation with Free BDD's - First Experimental Results
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1993

Efficient Boolean Manipulation with OBDD's can be Extended to FBDD's
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1993

Combinational Logic Verification with FBDDs
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1993

Frontiers of Feasible and Probabilistic Feasible Boolean Manipulation with Branching Programs.
Proceedings of the STACS 93, 1993

1992
Efficient Analysis and Manipulation of OBDDs can be Extended to Read-once-only Branching Programs
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1992

Analysis and Manipulation of Boolean Functions in Terms of Decision Graphs
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1992


  Loading...