Search
w/in this Title
for Titles
All Reviews
Information and Computation
Academic Press, Inc.
Options:
Date Reviewed
Title
Author
Publisher
Published Date
Descending Order
Ascending Order
1-10 of 98 reviews
Date Reviewed
FPT approximation schemes for maximizing submodular functions
Skowron P. Information and Computation 257(C): 65-78, 2017. Type: Article
A survey of techniques, this paper presents and analyzes algorithms and constructs fixed parameter tractable approximation schemes. These schemes are “collections of algorithms that run in [fixed parameter tractable, FPT] tim...
Jan 4 2019
On
k
-abelian palindromes
Cassaigne J., Karhumki J., Puzynina S. Information and Computation 260(C): 89-98, 2018. Type: Article
This paper explores words (finite strings over a fixed finite alphabet Σ with at least two letters) that are
k
-abelian equivalent to their reversals. Two words are
k
-abelian equivalent if ...
Oct 17 2018
Hitting forbidden subgraphs in graphs of bounded treewidth
Cygan M., Marx D., Pilipczuk M., Pilipczuk M. Information and Computation 256(C): 62-82, 2017. Type: Article
For a given linear transform
A
over a given vector space
Q
starting at point
x
, the orbit of
x
under
A
is an infinite sequence (
x
Jul 23 2018
A mathematical theory of resources
Coecke B., Fritz T., Spekkens R. Information and Computation 25059-86, 2016. Type: Article
Many of the physical sciences ultimately deal with resources. The important questions are: Can a given resource be converted into another? And if so, how? Examples abound:...
Apr 12 2017
Proving language inclusion and equivalence by coinduction
Rot J., Bonsangue M., Rutten J. Information and Computation 24662-76, 2016. Type: Article
Rot et al. present various operations on languages by using the mathematical theory approach in order to prove the similarity of two languages. Four operations are used for the proof of soundness on their technique, called bisimulation...
May 24 2016
On bounded languages and reversal-bounded automata
Ibarra O., Ravikumar B. Information and Computation 24630-42, 2016. Type: Article
A language
L
is bounded context-free if it is accepted by a pushdown automaton (PDA)
M
with a bounded number of reversals; that is, there is a constant upper bound for the number of times
...
May 2 2016
Position discovery for a system of bouncing robots
Czyzowicz J., Gąsieniec L., Kosowski A., Kranakis E., Morales-Ponce O., Pacheco E. Information and Computation 244(C): 122-133, 2015. Type: Article
Suppose you have a set of mobile robots that move on a ring or on a line segment at constant speed, bouncing when they run into another robot. The robots have no communication, no sensors, and no control of their motions, but they know...
Dec 22 2015
Entropy of regular timed languages
Asarin E., Basset N., Degorre A. Information and Computation 241(C): 142-176, 2015. Type: Article
Tackling unexplored issues in timed automata and timed languages, this paper formalizes the “quantitative analysis of the size of these languages and of the information content of timed words.”...
Oct 20 2015
Fast collaborative graph exploration
Dereniowski D., Disser Y., Kosowski A., Pajak D., Uznański P. Information and Computation 243(C): 37-49, 2015. Type: Article
Online graph exploration often requires one of the exploring agents to visit each vertex. The authors define and analyze such exploration for an undirected graph in the least numbers of steps for a multi-collaborating-agent scenario. T...
Sep 1 2015
Formative processes with applications to the decision problem in set theory: II. Powerset and singleton operators, finiteness predicate
Cantone D., Ursino P. Information and Computation 237215-242, 2014. Type: Article
In an effort to marry set theory and theoretical computer science, in 1970 the Computable Set Theory project was launched to study decidable fragments of set theory. A challenging question for researchers has been finding a way to over...
May 27 2015
Display
5
10
15
25
50
100
per column
Reproduction in whole or in part without permission is prohibited. Copyright 1999-2024 ThinkLoud
®
Terms of Use
|
Privacy Policy