David L. Schweizer
Highly Influential Citations1
Claim Your Author Page
Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage publications (all current information on this profile has been aggregated automatically from publisher and metadata sources).
AbstractWe study the classic binary search problem, with a delay between query and answer. For all constant delays, we give matching upper and lower bounds on the number of queries.
For every binary sequence A, there is an infinite binary sequence S such that A ⩽ttP S and S is stochastic in the sense of Kolmogorov and Loveland.
We study the classic binary search problem, with a delay between query and answer. For all constant delays, we give upper and lower bounds, matching up to an additive constant.
This thesis is an investigation into structures and strategies for fault-tolerant communication. We assume the existence of some set of nodes -- people, telephones, processors -- with a need to pass… Continue Reading
Wind power has been highlighted as the most successful renewable energy resource in today's competitive electricity markets. Wind power project interconnection and integration are challenges for wind… Continue Reading
An obvious extension of the KolmogorovChaitin notion of complexity is to require that the program which generates a string terminate within a prespecified time bound. We show that given a computable… Continue Reading
For every binary sequence A, there is an innnite binary sequence S such that A P tt S and S is stochastic in the sense of Kolmogorov and Loveland.