Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Filters

Theory of computing systems

Showing results (1-10 of 18) with videos related to

Pageof 2
Sort By:
Theory of Computing Systems|July 2, 2019
Complexity and Expressive Power of Weakly Well-Designed SPARQLMark Kaminski, Egor V Kostylev
Theory of Computing Systems|October 28, 2024
Prediction and MDL for infinite sequencesAlexey Milovanov
Theory of Computing Systems|April 19, 2019
Finding Cactus Roots in Polynomial TimePetr A Golovach, Dieter Kratsch, Daniël Paulusma, et al.
Theory of Computing Systems|February 7, 2020
On Compiling Structured CNFs to OBDDsSimone Bova, Friedrich Slivovsky
Theory of Computing Systems|January 28, 2025
Rudin-Shapiro Sums Via Automata Theory and LogicNarad Rampersad, Jeffrey Shallit
Theory of Computing Systems|February 11, 2021
Characterizing Tractability of Simple Well-Designed Pattern Trees with ProjectionStefan Mengel, Sebastian Skritek
Theory of Computing Systems|April 23, 2019
Motivating Time-Inconsistent Agents: A Computational ApproachSusanne Albers, Dennis Kraft
Theory of Computing Systems|August 25, 2015
[Formula: see text]-Approximation for Graphic TSPMarcin Mucha
Theory of Computing Systems|November 24, 2025
The Ground-Set-Cost Budgeted Maximum Coverage ProblemIrving van Heuven van Staereling, Bart de Keijzer, Guido Schäfer
Theory of Computing Systems|March 16, 2019
Designing Cost-Sharing Methods for Bayesian GamesGeorge Christodoulou, Stefano Leonardi, Alkmini Sgouritsa
Pageof 2

Showing results (1-10 of 18) with videos related to

Sort By:
Pageof 2
Theory of Computing Systems|July 2, 2019
Complexity and Expressive Power of Weakly Well-Designed SPARQLMark Kaminski, Egor V Kostylev
Theory of Computing Systems|October 28, 2024
Prediction and MDL for infinite sequencesAlexey Milovanov
Theory of Computing Systems|April 19, 2019
Finding Cactus Roots in Polynomial TimePetr A Golovach, Dieter Kratsch, Daniël Paulusma, et al.
Theory of Computing Systems|February 7, 2020
On Compiling Structured CNFs to OBDDsSimone Bova, Friedrich Slivovsky
Theory of Computing Systems|January 28, 2025
Rudin-Shapiro Sums Via Automata Theory and LogicNarad Rampersad, Jeffrey Shallit
Theory of Computing Systems|February 11, 2021
Characterizing Tractability of Simple Well-Designed Pattern Trees with ProjectionStefan Mengel, Sebastian Skritek
Theory of Computing Systems|April 23, 2019
Motivating Time-Inconsistent Agents: A Computational ApproachSusanne Albers, Dennis Kraft
Theory of Computing Systems|August 25, 2015
[Formula: see text]-Approximation for Graphic TSPMarcin Mucha
Theory of Computing Systems|November 24, 2025
The Ground-Set-Cost Budgeted Maximum Coverage ProblemIrving van Heuven van Staereling, Bart de Keijzer, Guido Schäfer
Theory of Computing Systems|March 16, 2019
Designing Cost-Sharing Methods for Bayesian GamesGeorge Christodoulou, Stefano Leonardi, Alkmini Sgouritsa
Pageof 2