Corrigendum: 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

SyGuS-Comp 2017: Results and Analysis by Alur, Rajeev, Fisman, Dana, Singh, Rishabh, Solar-Lezama, Armando

Get full text

Big Toy Models: Representing Physical Systems As Chu Spaces by Abramsky, S

“…This approach has often been fruitful in Logic and Theoretical Computer Science. Rather than seeking to construct a simplified toy model, we aim for a 'big toy model', in which both quantum and classical systems can be faithfully representedandemdash;as well as, possibly, more exotic kinds of systems. …”

Improving Priority Promotion for Parity Games by Benerecetti, M, Dell'Erba, D, Mogavero, F

“…Parity games are two-player infinite-duration games on graphs that play a crucial role in various fields of theoretical computer science. Finding efficient algorithms to solve these games in practice is widely acknowledged as a core problem in formal verification, as it leads to efficient solutions of the model-checking and satisfiability problems of expressive temporal logics, e.g., the modal µCalculus. …”

Interviews with the 2021 CONCUR Test-of-Time Award recipients by Aceto, L, Bertrand, N, Yoshida, N

Operational axioms for diagonalizing states by Chiribella, G, Scandolo, C

Solving parity games via priority promotion by Benerecetti, M, Dell Erba, D, Mogavero, F

“…Parity games also have great practical interest, as they arise in many fields of theoretical computer science, most notably logic, automata theory, and formal verification. …”

Dorsolateral prefrontal cortex contributes to the impaired behavioral adaptation in alcohol dependence by Sinem Balta Beylergil, Anne Beck, Lorenz Deserno, Robert C. Lorenz, Michael A. Rapp, Florian Schlagenhauf, Andreas Heinz, Klaus Obermayer

Get full text

Calculating Kolmogorov complexity from the output frequency distributions of small Turing machines. by Fernando Soler-Toscano, Hector Zenil, Jean-Paul Delahaye, Nicolas Gauvrit

“…Drawing on various notions from theoretical computer science, we present a novel numerical approach, motivated by the notion of algorithmic probability, to the problem of approximating the Kolmogorov-Chaitin complexity of short strings. …”
Get full text

Models of Quantum Complexity Growth by Fernando G.S.L. Brandão, Wissam Chemissany, Nicholas Hunter-Jones, Richard Kueng, John Preskill

“…The concept of quantum complexity has far-reaching implications spanning theoretical computer science, quantum many-body physics, and high-energy physics. …”
Get full text

Earthquake Hazard Safety Assessment of Existing Buildings Using Optimized Multi-Layer Perceptron Neural Network by Ehsan Harirchian, Tom Lahmer, Shahla Rasulzade

Get full text

Testing Integration Effects Between the Cee and U.S. Stock Markets During the 2007–2009 Global Financial Crisis by Olbryś Joanna, Majewska Elżbieta

Get full text

The 2013 Newton Institute Programme on polynomial optimization by Letchford, Adam N, Lasserre, Jean B, Steurer, David, Letchford, Adam N., Lasserre, Jean B., Parrilo, Pablo A.

“…There are applications of PO in a surprisingly wide variety of contexts, including, for example, operational research, statistics, applied probability, quantitative finance, theoretical computer science and various branches of engineering and the physical sciences. …”
Get full text
Get full text

Swapping labeled tokens on graphs by Yamanaka, Katsuhisa, Demaine, Erik D, Ito, Takehiro, Kawahara, Jun, Kiyomi, Masashi, Okamoto, Yoshio, Saitoh, Toshiki, Suzuki, Akira, Uchizawa, Kei, Uno, Takeaki

Get full text

6.854J / 18.415J Advanced Algorithms, Fall 2001 by Goemans, Michel

“…It is especially designed for doctoral students interested in theoretical computer science.…”
Get full text

Robust learning for optimization: navigating samples and noise by Yang, Chunxue

“…This thesis applies robust learning for optimization to two theoretical computer science domains: auction design and combinatorial optimization, with the goal of developing robust algorithms that can efficiently output near-optimal solutions despite the presence of randomness or noise.…”
Get full text

A Provenance Tracking Model for Data Updates by Ciobanu, Gabriel, Horne, Ross

Get full text
Get full text

Encryption in TECB mode: modeling, simulation and synthesis by Ibrahimy, Muhammad Ibn

Get full text

Cycle detection in computation tree logic by Fontaine, G, Mogavero, F, Murano, A, Perelli, G, Sorrentino, L

Learning to round for discrete labeling problems by Mohapatra, P, Jawahar, C, Mudigonda, P

“…The problem of identifying an accurate rounding procedure has mainly been tackled in the theoretical computer science community through mathematical analysis of the worst-case. …”