Bob Burger
I will sing of the Lord’s unfailing love forever! I live by faith in the Son of God, who loved me and gave himself for me.
I enjoy using computers and mathematics to help people solve complex technical problems with simple, robust software that customers don’t think about because it works so well. I use paradigms best suited to the problems and domain-specific language embeddings in Scheme to provide simple, efficient solutions.
At Indigo BioAutomation I write software that helps scientists spend less time looking at non-relevant data, which improves the efficiency and effectiveness of clinical laboratories.
At Beckman Coulter I developed industry-leading software that plans and schedules laboratory automation equipment and controls automated liquid handlers. In medical device software I used fault isolation and message-passing concurrency to mitigate the risks of lock-ups and memory corruption of the typical shared memory approach.
I have extensive experience in multi-paradigm programming, applied mathematics, writing design documentation, making technical presentations, and mentoring software interns. Please contact me at my first name@burgerrg.com.
Education
- Ph.D. in Computer Science from Indiana University Computer Science Department, March 1997
- M.S. in Computer Science from Indiana University, January 1994
- B.S. Double-Major in Computer Science and Mathematics plus a German Technical Translator’s Certificate from Rose-Hulman Institute of Technology, February 1991
Publications
- Robert G. Burger and R. Kent Dybvig. An Infrastructure for Profile-Driven Dynamic Recompilation. In Proceedings of ICCL’98, the IEEE Computer Society International Conference on Computer Languages, May 1998.
- Robert G. Burger. Efficient Compilation and Profile-Driven Dynamic Recompilation in Scheme. PhD thesis, Indiana University Computer Science Department, March 1997.
- Robert G. Burger and R. Kent Dybvig. Printing Floating-Point Numbers Quickly and Accurately. In Proceedings of the ACM SIGPLAN ’96 Conference on Programming Language Design and Implementation, pages 108-116, May 1996. Sample code. For a much faster algorithm, see Russ Cox’s 2026 article “Floating-Point Printing and Parsing Can Be Simple and Fast” and fpfmt, an open-source implementation in C and C++.
- Robert G. Burger, Oscar Waddell, and R. Kent Dybvig. Register Allocation using Lazy Saves, Eager Restores, and Greedy Shuffling. In Proceedings of the ACM SIGPLAN ’95 Conference on Programming Language Design and Implementation, pages 130-138, June 1995.
- M. Esen Tuna, Steven D. Johnson, and Robert G. Burger. Continuations in Hardware-Software Codesign. In Proceedings of the International Conference on Computer Design, IEEE, pages 264-269, October 1994.
- Robert G. Burger. The Scheme Machine. Technical Report 413, Indiana University, Computer Science Department, August 1994.