Indexed BDDs: Algorithmic Advances in Techniques to Represent and Verify Boolean Functions.

James R. Bitner

Jawahar Jain James R. Bitner Magdy S. Abadir Jacob A. Abraham Donald S. Fussell Indexed BDDs: Algorithmic Advances in Techniques to Represent and Verify Boolean Functions. 1230-1245 1997 46 IEEE Trans. Computers 11 db/journals/tc/tc46.html#JainBAAF97 https://doi.org/10.1109/12.644298 http://doi.ieeecomputersociety.org/10.1109/12.644298

Jawahar Jain Dinos Moundanos James R. Bitner Jacob A. Abraham Donald S. Fussell Don E. Ross Efficient variable ordering and partial representation algorithm. 81-86 1995 conf/vlsid/1995 VLSI Design https://doi.org/10.1109/ICVD.1995.512082 https://doi.ieeecomputersociety.org/10.1109/ICVD.1995.512082 db/conf/vlsid/vlsid1995.html#JainMBAFR95 James R. Bitner Jawahar Jain Magdy S. Abadir Jacob A. Abraham Donald S. Fussell Efficient Algorithmic Circuit Verification Using Indexed BDDs. 266-275 1994 conf/ftcs/1994 FTCS db/conf/ftcs/ftcs94.html#BitnerJAAF94 https://doi.org/10.1109/FTCS.1994.315633 Jawahar Jain James R. Bitner Dinos Moundanos Jacob A. Abraham Donald S. Fussell A new scheme to compute variable orders for binary decision diagrams. 105-108 1994 Great Lakes Symposium on VLSI https://doi.org/10.1109/GLSV.1994.289986 conf/glvlsi/1994 db/conf/glvlsi/glvlsi1994.html#JainBMAF94

Jawahar Jain Jacob A. Abraham James R. Bitner Donald S. Fussell Probabilistic Verification of Boolean Functions. 61-115 1992 1 Formal Methods Syst. Des. 1 db/journals/fmsd/fmsd1.html#JainABF92 https://doi.org/10.1007/BF00464357

Jawahar Jain James R. Bitner Donald S. Fussell Jacob A. Abraham Probabilistic Design Verification. 468-471 1991 conf/iccad/1991 ICCAD db/conf/iccad/iccad1991.html#JainBFA91 https://doi.org/10.1109/ICCAD.1991.185306 https://doi.ieeecomputersociety.org/10.1109/ICCAD.1991.185306

James R. Bitner Storing Matrices on Disk for Efficient Row and Column Retrieval. 249-254 1985 20 Inf. Process. Lett. 5 db/journals/ipl/ipl20.html#Bitner85 https://doi.org/10.1016/0020-0190(85)90027-4

James R. Bitner An Asymptotically Optimal Algorithm for the Dutch National Flag Problem. 243-262 1982 11 SIAM J. Comput. 2 db/journals/siamcomp/siamcomp11.html#Bitner82 https://doi.org/10.1137/0211019

James R. Bitner Shou-Hsuan Stephen Huang Key Comparison Optimal 2-3 Trees with Maximum Utilization. 558-570 1981 10 SIAM J. Comput. 3 db/journals/siamcomp/siamcomp10.html#BitnerH81 https://doi.org/10.1137/0210041

James R. Bitner Heuristics That Dynamically Organize Data Structures. 82-110 1979 8 SIAM J. Comput. 1 db/journals/siamcomp/siamcomp8.html#Bitner79 https://doi.org/10.1137/0208007

James R. Bitner C. K. Wong Optimal and Near-Optimal Scheduling Algorithms for Batched Processing in Linear Storage. 479-498 1979 8 SIAM J. Comput. 4 db/journals/siamcomp/siamcomp8.html#BitnerW79 https://doi.org/10.1137/0208039

James L. Peterson James R. Bitner John H. Howard The Selection of Optimal Tab Settings. 1004-1007 1978 21 Commun. ACM 12 db/journals/cacm/cacm21.html#PetersonBH78 https://doi.org/10.1145/359657.359661

James R. Bitner Heuristics That Dynamically Alter Data Structures to Reduce Their Access Time University of Illinois Urbana-Champaign, USA 1976 https://hdl.handle.net/2142/66387

James R. Bitner Gideon Ehrlich Edward M. Reingold Efficient Generation of the Binary Reflected Gray Code and Its Applications. 517-521 1976 19 Commun. ACM 9 db/journals/cacm/cacm19.html#BitnerER76 https://doi.org/10.1145/360336.360343

James R. Bitner Edward M. Reingold Backtrack Programming Techniques. 651-656 1975 18 Commun. ACM 11 db/journals/cacm/cacm18.html#BitnerR75 https://doi.org/10.1145/361219.361224 https://www.wikidata.org/entity/Q127705680

Magdy S. Abadir Jacob A. Abraham Gideon Ehrlich Donald S. Fussell John H. Howard Shou-Hsuan Stephen Huang Jawahar Jain Dinos Moundanos James L. Peterson Edward M. Reingold Don E. Ross Chak-Kuen WongC. K. Wong