Conferences in DBLP

(tamc)
2009 (conf/tamc/2009)

1. 
   Neural Computations That Support Long Mixed Sequences of Knowledge Acquisition Tasks. [Citation Graph (, )][DBLP]
   
   
2. 
   Constraints, Graphs, Algebra, Logic, and Complexity. [Citation Graph (, )][DBLP]
   
   
3. 
   Distributed Systems and Their Environments. [Citation Graph (, )][DBLP]
   
   
4. 
   Co-evolution and Information Signals in Biological Sequences. [Citation Graph (, )][DBLP]
   
   
5. 
   The Extended Turing Model as Contextual Tool. [Citation Graph (, )][DBLP]
   
   
6. 
   Strong Positive Reducibilities. [Citation Graph (, )][DBLP]
   
   
7. 
   Fixed-Parameter Algorithms for Graph-Modeled Date Clustering. [Citation Graph (, )][DBLP]
   
   
8. 
   On Spanners of Geometric Graphs. [Citation Graph (, )][DBLP]
   
   
9. 
   Searching Trees: An Essay. [Citation Graph (, )][DBLP]
   
   
10. 
    Approximability and Fixed-Parameter Tractability for the Exemplar Genomic Distance Problems. [Citation Graph (, )][DBLP]
    
    
11. 
    A Quadratic Kernel for 3-Set Packing. [Citation Graph (, )][DBLP]
    
    
12. 
    Quantitative Aspects of Speed-Up and Gap Phenomena. [Citation Graph (, )][DBLP]
    
    
13. 
    Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG. [Citation Graph (, )][DBLP]
    
    
14. 
    On the Connection between Interval Size Functions and Path Counting. [Citation Graph (, )][DBLP]
    
    
15. 
    On the Red/Blue Spanning Tree Problem. [Citation Graph (, )][DBLP]
    
    
16. 
    Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata. [Citation Graph (, )][DBLP]
    
    
17. 
    A Computational Proof of Complexity of Some Restricted Counting Problems. [Citation Graph (, )][DBLP]
    
    
18. 
    Block-Graph Width. [Citation Graph (, )][DBLP]
    
    
19. 
    Minimum Vertex Ranking Spanning Tree Problem on Permutation Graphs. [Citation Graph (, )][DBLP]
    
    
20. 
    On Parameterized Exponential Time Complexity. [Citation Graph (, )][DBLP]
    
    
21. 
    Best-Order Streaming Model. [Citation Graph (, )][DBLP]
    
    
22. 
    Behavioral and Logical Equivalence of Stochastic Kripke Models in General Measurable Spaces. [Citation Graph (, )][DBLP]
    
    
23. 
    Influence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data. [Citation Graph (, )][DBLP]
    
    
24. 
    Improved Deterministic Algorithms for Weighted Matching and Packing Problems. [Citation Graph (, )][DBLP]
    
    
25. 
    Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover. [Citation Graph (, )][DBLP]
    
    
26. 
    Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability. [Citation Graph (, )][DBLP]
    
    
27. 
    A Complete Characterisation of the Linear Clique-Width of Path Powers. [Citation Graph (, )][DBLP]
    
    
28. 
    Preserving Privacy versus Data Retention. [Citation Graph (, )][DBLP]
    
    
29. 
    Kolmogorov Complexity and Combinatorial Methods in Communication Complexity. [Citation Graph (, )][DBLP]
    
    
30. 
    An Almost Totally Universal Tile Set. [Citation Graph (, )][DBLP]
    
    
31. 
    Linear Kernel for Planar Connected Dominating Set. [Citation Graph (, )][DBLP]
    
    
32. 
    A Simple Greedy Algorithm for the k-Disjoint Flow Problem. [Citation Graph (, )][DBLP]
    
    
33. 
    Minimizing AND-EXOR Expressions for Multiple-Valued Two-Input Logic Functions. [Citation Graph (, )][DBLP]
    
    
34. 
    Exact and Experimental Algorithms for a Huffman-Based Error Detecting Code. [Citation Graph (, )][DBLP]
    
    
35. 
    Terminal Coalgebras for Measure-Polynomial Functors. [Citation Graph (, )][DBLP]
    
    
36. 
    High Minimal Pairs in the Enumeration Degrees. [Citation Graph (, )][DBLP]
    
    
37. 
    Searching a Circular Corridor with Two Flashlights. [Citation Graph (, )][DBLP]
    
    
38. 
    On the Complexity of the Multiple Stack TSP, kSTSP. [Citation Graph (, )][DBLP]
    
    
39. 
    Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments. [Citation Graph (, )][DBLP]
    
    
40. 
    An Online Algorithm for Applying Reinforcement Learning to Handle Ambiguity in Spoken Dialogues. [Citation Graph (, )][DBLP]
    
    
41. 
    A Fixed-Parameter Enumeration Algorithm for the Weighted FVS Problem. [Citation Graph (, )][DBLP]
    
    
42. 
    On the Tractability of Maximal Strip Recovery. [Citation Graph (, )][DBLP]
    
    
43. 
    Greedy Local Search and Vertex Cover in Sparse Random Graphs. [Citation Graph (, )][DBLP]
    
    
44. 
    Embedding the Diamond Lattice in the c.e. tt-Degrees with Superhigh Atoms. [Citation Graph (, )][DBLP]
    
    
45. 
    Feasibility of Motion Planning on Directed Graphs. [Citation Graph (, )][DBLP]
    
    
46. 
    Polynomial-Time Algorithm for Sorting by Generalized Translocations. [Citation Graph (, )][DBLP]
    
    
47. 
    The Two-Guard Polygon Walk Problem. [Citation Graph (, )][DBLP]
    
    
48. 
    Approximation and Hardness Results for Label Cut and Related Problems. [Citation Graph (, )][DBLP]
    
    
49. 
    An Observation on Non-Malleable Witness-Indistinguishability and Non-Malleable Zero-Knowledge. [Citation Graph (, )][DBLP]