You have Guest access.
Log In
Jianer Chen and S. Barry Cooper
Front matter
1-2
Neural Computations That Support Long Mixed Sequences of Knowledge Acquisition Tasks
3
Constraints, Graphs, Algebra, Logic, and Complexity
4-5
Distributed Systems and Their Environments
6-17
Co-evolution and Information Signals in Biological Sequences
18-28
The Extended Turing Model as Contextual Tool
29-38
Strong Positive Reducibilities
39-48
Fixed-Parameter Algorithms for Graph-Modeled Date Clustering
49-58
On Spanners of Geometric Graphs
59-70
Searching Trees: An Essay
71-80
Approximability and Fixed-Parameter Tractability for the Exemplar Genomic Distance Problems
81-87
A Quadratic Kernel for 3-Set Packing
88-97
Quantitative Aspects of Speed-Up and Gap Phenomena
98-107
Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG
108-117
On the Connection between Interval Size Functions and Path Counting
118-127
On the Red/Blue Spanning Tree Problem
128-137
Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata
138-149
A Computational Proof of Complexity of Some Restricted Counting Problems
150-157
Block-Graph Width
158-167
Minimum Vertex Ranking Spanning Tree Problem on Permutation Graphs
168-177
On Parameterized Exponential Time Complexity
178-191
Best-Order Streaming Model
192-200
Behavioral and Logical Equivalence of Stochastic Kripke Models in General Measurable Spaces
201-210
Influence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data
211-220
Improved Deterministic Algorithms for Weighted Matching and Packing Problems
221-230
Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover (Extended Abstract)
231-240
Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability
241-250
A Complete Characterisation of the Linear Clique-Width of Path Powers
251-260
Preserving Privacy versus Data Retention
261-270
Kolmogorov Complexity and Combinatorial Methods in Communication Complexity
271-280
An Almost Totally Universal Tile Set
281-290
Linear Kernel for Planar Connected Dominating Set
291-300
A Simple Greedy Algorithm for the k-Disjoint Flow Problem
301-310
Minimizing AND-EXOR Expressions for Multiple-Valued Two-Input Logic Functions (Extended Abstract)
311-324
Exact and Experimental Algorithms for a Huffman-Based Error Detecting Code
325-334
Terminal Coalgebras for Measure-Polynomial Functors
335-344
High Minimal Pairs in the Enumeration Degrees
345-359
Searching a Circular Corridor with Two Flashlights
360-369
On the Complexity of the Multiple Stack TSP, kSTSP
370-379
Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments
380-389
An Online Algorithm for Applying Reinforcement Learning to Handle Ambiguity in Spoken Dialogues
390-399
A Fixed-Parameter Enumeration Algorithm for the Weighted FVS Problem
400-409
On the Tractability of Maximal Strip Recovery
410-419
Greedy Local Search and Vertex Cover in Sparse Random Graphs (Extended Abstract)
420-429
Embedding the Diamond Lattice in the c.e. tt-Degrees with Superhigh Atoms
430-439
Feasibility of Motion Planning on Directed Graphs
440-449
Polynomial-Time Algorithm for Sorting by Generalized Translocations
450-459
The Two-Guard Polygon Walk Problem (Extended Abstract)
460-469
Approximation and Hardness Results for Label Cut and Related Problems
470-479
An Observation on Non-Malleable Witness-Indistinguishability and Non-Malleable Zero-Knowledge
Back matter
This page requires script.
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info