Opportunity at National Institute of Standards and Technology (NIST)
Combinatorial and Discrete Algorithms
Information Technology Laboratory, Applied and Computational Mathematics Division
Please note: This Agency only participates in the February and August reviews.
|Beichl, Isabel M.
We combine probabilistic methods with combinatorics to solve problems in the physical sciences, which can be formulated as combinatorial counting questions on graphs. We have devised novel formulations of statistical techniques such as importance sampling and Monte Carlo time that can be applied to these graph problems. We plan to extend these techniques to other fundamental problems related to measurement science and optimization of communications.
Graph theory; Monte Carlo methods; Probabilistic algorithm;
Open to U.S. citizens
Open to Regular applicants