June 10, 2014 article Open access The string guessing problem as a method to prove lower bounds on the advice complexity Theoretical Computer Science DOI: 10.1016/j.tcs.2014.06.006 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 2 stored of 48 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access On the advice complexity of the online dominating set problem 2021 Theoretical Computer Science article Computer Science Optimization and Search Problems Open access 3 citations The Secretary Problem with Reservation Costs 2021 Lecture notes in computer science conference-paper Computer Science Optimization and Search Problems 2 citations 2 results References 0