Practical Access to Dynamic Programming on Tree Decompositions by Max Bannach, Sebastian Berndt

Get full text

Efficient Money Burning in General Domains by Fotakis, Dimitris, Tsipras, Dimitris, Tzamos, Christos, Zampetakis, Emmanouil

Get full text
Get full text
Get full text
Get full text

Randomized algorithms for finding the shortest negative cost cycle in networks by Orlin, James B, Subramani, K., Wojciechowki, Piotr

“…NCCD is an extremely well-studied problem within the domains of operations research and theoretical computer science. SNCC is important in its own right and finds several applications in program verification (Satisfiability modulo theories), abstract interpretation and real-time scheduling. …”
Get full text

Robust Estimators in High-Dimensions Without the Computational Intractability by Diakonikolas, Ilias, Kamath, Gautam, Kane, Daniel, Li, Jerry, Moitra, Ankur, Stewart, Alistair

Get full text

A Dual Perspective on Computational Complexity by Chapman, Brynmor

“…One central aim of theoretical computer science is to understand the limits of computation. …”
Get full text
Get full text

The Traveling Salesman Problem for Systems with Dynamic Constraints by Adler, Aviv

“…The Traveling Salesman Problem (TSP) is a foundational problem in the fields of theoretical computer science and optimization in which an agent is tasked with visiting a set of 𝑛 target locations (in any order) in the shortest amount of time, either on a graph or in a space. …”
Get full text
Get full text

Efficient algorithms for new computational models by Ruhl, Jan Matthias, 1973-

Get full text

Robustly Leveraging Collusion in Combinatorial Auctions by Chen, Jing, Micali, Silvio, Valiant, Paul

Get full text
Get full text

Compression without a common prior: An information-theoretic justification for ambiguity in language by Juba, Brendan Andrew, Kalai, Adam Tauman, Khanna, Sanjeev, Sudan, Madhu

Get full text

A Faster Algorithm for the Single Source Shortest Path Problem with Few Distinct Positive Lengths by Orlin, James B., Madduri, Kamesh, Subramani, K., Williamson, M.

“…The SSSPP is one of the most widely studied problems in theoretical computer science and operations research. On a graph with n vertices, m edges and K distinct edge lengths, our algorithm runs in O(m) time if nK=<2m, and O(mlognKm) time, otherwise. …”
Get full text
Get full text

Quantitative rational verification by Steeples, T

“…These are real world problems which also invoke rich questions in theoretical computer science.</p> <p>In this thesis, we introduce quantitative aspects to the framework of rational verification. …”

Decidability boundaries in linear dynamical systems by de Sousa Pinto, J

“…<p>The object of this thesis is the study of the decidability properties of linear dynamical systems, which have fundamental ties to theoretical computer science, software verification, linear hybrid systems, and control theory. …”

Watson-crick petri net and place-labelled petri net controlled grammar using formal language theory by Mohamad Jan, Nurhidaya

“…formal language theory is a branch of applied discrete mathematics and theoretical computer science. a watson-crick automaton is an automaton that works on tapes which are double-stranded sequences of symbols related by watson-crick complementarity that are similar to the dna molecules. a petri net is a model of information flow in systems that provides a useful mathematical formalism for modelling concurrent systems. in this thesis, the relation between watson-crick automata and petri nets is investigated to consider the massive parallelism in watson- crick automata. thus, a new concept called watson-crick petri net is introduced. besides that, the structural properties of watson-crick petri net are found, namely a single start place, a run place and the stop transition. also, the generative power of watson-crick petri net is determined. besides using watson-crick complementarity in petri nets, a context-free grammar is also considered in this research. a petri net controlled grammar is a type of a context-free grammar equipped with petri nets, where the successful derivation of the grammar can be simulated by the sequence of occurrences of the net. the production rules of a grammar, for all variants of petri net controlled grammars that have been introduced, are associated only with transitions of a petri net. therefore, a place-labelled petri net controlled grammar is introduced in this research. the place labelling enables the parallel application of production rules in petri net controlled grammars to be considered. the effects of labelling strategies and the set of final markings, along with lower and upper bounds are chosen in order to increase the generative power of place-labelled petri net controlled grammar. besides that, the structural properties and structural subclass of place-labelled petri net controlled grammar are also found in this thesis.…”
Get full text

Bishop-Phelps Theorem for Normed Cones by Ildar Sadeghi, Ali Hassanzadeh

“…Introduction In the last few years there is a growing interest in the theory of quasi-metric spaces and other related structures such as quasi-normed cones and asymmetric normed linear spaces, because such a theory provides an important tool in the study of several problems in theoretical computer science, approximation theory, applied physics, convex analysis and optimization. …”
Get full text

Temporal dendritic heterogeneity incorporated with spiking neural networks for learning multi-timescale dynamics by Hanle Zheng, Zhong Zheng, Rui Hu, Bo Xiao, Yujie Wu, Fangwen Yu, Xue Liu, Guoqi Li, Lei Deng

Get full text

Decoding Neuropathic Pain: Can We Predict Fluctuations of Propagation Speed in Stimulated Peripheral Nerve? by Ekaterina Kutafina, Ekaterina Kutafina, Alina Troglio, Roberto de Col, Roberto de Col, Rainer Röhrig, Peter Rossmanith, Barbara Namer, Barbara Namer

Get full text

A dynamic architecture of life [version 1; referees: 2 approved] by Beatrix P. Rubin, Jeremy Brockes, Brigitte Galliot, Ueli Grossniklaus, Daniel Lobo, Marco Mainardi, Marie Mirouze, Alain Prochiantz, Angelika Steger

Get full text

The features of game mechanics use in teaching computer science for the development of creative thinking of students by Elena A. Mikhlyakova, Ekaterina K. Starkova, Evgeniy L. Batakova

“…The mechanics “Achievement,” “Reckoning on trust,” “Fun once - always fun,” “User progress” are implemented with game elements and methods in the study of theoretical computer science. Resources of digital services (interactive whiteboards, random selection generators) are used for gamification. …”
Get full text

A Novel Approach for Multiplicative Linguistic Group Decision Making Based on Symmetrical Linguistic Chi-Square Deviation and VIKOR Method by Zhiwei Gong, Jian Lin, Ling Weng

Get full text

D-PFA: A Discrete Metaheuristic Method for Solving Traveling Salesman Problem Using Pathfinder Algorithm by Poria Pirozmand, Ali Asghar Rahmani Hosseinabadi, Maedeh Jabbari Chari, Faezeh Pahlavan, Seyedsaeid Mirkamali, Gerhard-Wilhelm Weber, Summera Nosheen, Ajith Abraham

“…The Traveling Salesman Problem (TSP) which is a theoretical computer science and operations research problem, has several applications even in its purest formulation, such as the manufacture of microchips, planning, and logistics. …”
Get full text