Franc Brglez

Stallmann, M. F., & Brglez, F. (2007). High-contrast algorithm behavior. Proceedings of the 2007 workshop on Experimental computer science - ExpCS '07. Presented at the the 2007 workshop. https://doi.org/10.1145/1281700.1281712

Brglez, F., Li, X. Y., & Stallmann, M. F. (2005). On SAT instance classes and a method for reliable performance experiments with SAT solvers. ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 43(1-4), 1–34. https://doi.org/10.1007/s10472-005-0417-5

Li, X. Y., Stallmann, M. F., & Brglez, F. (2004). A Local search sat solver using an effective switching strategy and an efficient unit propagation. In Theory and applications of satisfiability testing: 6th International Conference, SAT 2003, Santa Margherita Ligure, Italy, May 5-8, 2003, Selected revised papers (Vol. 2919, pp. 53–68). Berlin; New York: Springer.

Brglez, F., & Drechsler, R. (1999). Design of experiments in CAD: context and new data sets for ISCAS'99. Proceedings of the 1999 IEEE International Symposium on Circuits and systems, 6, 424–427. https://doi.org/10.1109/iscas.1999.780185

Ghosh, D., & Brglez, F. (1999). Equivalence classes of circuit mutants for experimental design. Proceedings of the 1999 IEEE International Symposium on Circuits and systems, 6, 432–435. https://doi.org/10.1109/iscas.1999.780187

Stallmann, M., Brglez, F., & Ghosh, D. (1999). Heuristics and experimental design for bigraph crossing number minimization. In Algorithm Engineering and Experimentation: International workshop ALENEX '99, Baltimore, MD, USA, Jan. 15-16, 1999. (Vol. 1619, pp. 74–93). https://doi.org/10.1007/3-540-48518-x_5

Lavana, H., Khetawat, A., Brglez, F., & Kozminski, K. (1997). Executable workflows: a paradigm for collaborative design on the Internet. ACM IEEE Design Automation Conference. Proceedings, 34(June 1997), 553–558. https://doi.org/10.1109/dac.1997.597208