The following pages link to Information and Computation (Q259032):
Displaying 50 items.
- Combined schemes for signature and encryption: the public-key and the identity-based setting (Q259033) (← links)
- Parameterized complexity of the anchored \(k\)-core problem for directed graphs (Q259037) (← links)
- Finite state incompressible infinite sequences (Q259039) (← links)
- Hybrid behaviour of Markov population models (Q259041) (← links)
- Distance constraint satisfaction problems (Q259047) (← links)
- Efficient approximation of optimal control for continuous-time Markov games (Q259052) (← links)
- Re-visiting axioms of information systems (Q259056) (← links)
- A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots (Q259059) (← links)
- On the role of update constraints and text-types in iterative learning (Q259061) (← links)
- A framework for compositional verification of multi-valued systems via abstraction-refinement (Q259065) (← links)
- No future without (\textit{a hint of}) past. A finite basis for `almost future' temporal logic (Q259068) (← links)
- Existential second-order logic and modal logic with quantified accessibility relations (Q259071) (← links)
- Smoothed model checking for uncertain continuous-time Markov chains (Q259074) (← links)
- Topology recognition with advice (Q259077) (← links)
- On the isomorphism problem for Helly circular-arc graphs (Q259081) (← links)
- Approximate matching between a context-free grammar and a finite-state automaton (Q259082) (← links)
- Introduction to clarithmetic. II (Q259084) (← links)
- Logarithmic space and permutations (Q276248) (← links)
- A combination framework for complexity (Q276251) (← links)
- Higher-order interpretations and program complexity (Q276254) (← links)
- Two function algebras defining functions in \(\mathsf{NC}^k\) Boolean circuits (Q276257) (← links)
- A semantic account of strong normalization in linear logic (Q276260) (← links)
- The role of polymorphism in the characterisation of complexity by soft types (Q276263) (← links)
- Computation by interaction for space-bounded functional programming (Q276265) (← links)
- A type assignment for \(\lambda\)-calculus complete both for FPTIME and strong normalization (Q276268) (← links)
- Bounded combinatory logic and lower complexity (Q276270) (← links)
- Hardy is (almost) everywhere: nonlocality without inequalities for almost all entangled multipartite states (Q320194) (← links)
- Bridging the gap between general probabilistic theories and the device-independent framework for nonlocality and contextuality (Q320197) (← links)
- Pictures of complete positivity in arbitrary dimension (Q320199) (← links)
- A mathematical theory of resources (Q320201) (← links)
- The expectation monad in quantum foundations (Q320204) (← links)
- Symmetry constraints on temporal order in measurement-based quantum computation (Q320209) (← links)
- Strongly non-U-shaped language learning results by general techniques (Q342700) (← links)
- Regressive computations characterize logarithmic space (Q342702) (← links)
- Addendum to: ``Exponential time improvement for min-wise based algorithms'' (Q342703) (← links)
- The complexity of approximately counting in 2-spin systems on \(k\)-uniform bounded-degree hypergraphs (Q342704) (← links)
- Better abstractions for timed automata (Q342707) (← links)
- The parameterised complexity of list problems on graphs of bounded treewidth (Q342709) (← links)
- On temporal logics with data variable quantifications: decidability and complexity (Q342712) (← links)
- Prices matter for the parameterized complexity of shift bribery (Q342714) (← links)
- Network-formation games with regular objectives (Q342715) (← links)
- Parameterized algorithms for the module motif problem (Q342716) (← links)
- Enlarging learnable classes (Q342717) (← links)
- Randomised distributed MIS and colouring algorithms for rings with oriented edges in \(O(\sqrt{\log n})\) bit rounds (Q342718) (← links)
- Approximation of smallest linear tree grammar (Q342719) (← links)
- A generalization of Spira's theorem and circuits with small segregators or separators (Q342721) (← links)
- Finding all solutions of equations in free groups and monoids with involution (Q342722) (← links)
- Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers (Q342726) (← links)
- On teaching sets of \(k\)-threshold functions (Q342728) (← links)
- Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks (Q342731) (← links)
