Expression -- Spectral Clustering Gene Ontology Terms to Group Genes by Function -- Dynamic De-Novo Prediction of microRNAs Associated with Cell Conditions: A Search Pruned by Expression -- Clustering Gene Expression Series with Prior Knowledge -- A Linear Time Biclustering Algorithm for Time Series Gene Expression Data -- Time-Window Analysis of Developmental Gene Expression Data with Multiple…
Session 1 -- Towards a Theory of Algorithms -- Session 2A -- k-Restricted Rotation with an Application to Search Tree Rebalancing -- Heap Building Bounds -- Session 2B -- The Multi-radius Cover Problem -- Parameterized Complexity of Generalized Vertex Cover Problems -- The Complexity of Implicit and Space Efficient Priority Queues -- Analysis of a Class of Tries with Adaptive Multi-digit Branc…
Puzzles, Art, and Magic with Algorithms -- The ABCs of AVDs: Geometric Retrieval Made Simple -- Pareto Optimality in House Allocation Problems -- Property-Preserving Data Reconstruction -- On the Monotone Circuit Complexity of Quadratic Boolean Functions -- Generalized Function Matching -- Approximate Distance Oracles for Graphs with Dense Clusters -- Multicriteria Global Minimum Cuts -- Polyli…
Designing Reliable Algorithms in Unreliable Memories -- From Balanced Graph Partitioning to Balanced Metric Labeling -- Fearful Symmetries: Quantum Computing, Factoring, and Graph Isomorphism -- Exploring an Unknown Graph Efficiently -- Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio -- Heuristic Improvements for Computing Maximum Multicommodity Flow and Minim…
Invited Papers -- Recognizable Sets of Graphs, Hypergraphs and Relational Structures: A Survey -- Some New Directions and Questions in Parameterized Complexity -- Basic Notions of Reaction Systems -- A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms -- Algebraic and Topological Models for DNA Recombinant Processes -- Contributed Papers -- Regular Expressions for T…
Invited Lecture -- Robust Airline Fleet Assignment:Imposing Station Purity Using Station Decomposition -- Computing the Arrow-Debreu Competitive Market Equilibrium and Its Extensions -- Contributed Papers -- Complexity of Minimal Tree Routing and Coloring -- Energy Efficient Broadcasting and Multicasting in Static Wireless Ad Hoc Networks -- An Algorithm for Nonconvex Lower Semicontinuous Optim…
Classification and Taxonomy -- Single-Path and Standard Path Switching Fabrics -- Two Stage Swithching Fabrics -- Three-Stage Switching Fabrics -- Replicated Baseline Switching Fabrics.This state-of-the-art survey of switching fabric architectures gives special attention to combinatorial properties of switching fabrics – nonblockingness and rearrangeability. Also describing control algorithms…
Fundamentals -- Foiling the Adversary -- Fingerprinting -- Success Amplification and Random Sampling -- Abundance of Witnesses -- Optimization and Random Rounding.Randomness is a powerful phenomenon that can be harnessed to solve various problems in all areas of computer science. Randomized algorithms are often more efficient, simpler and, surprisingly, also more reliable than their determinist…
Invited Papers -- Abstract Models of Computation in Cryptography -- Pairing-Based Cryptography at High Security Levels -- Improved Decoding of Interleaved AG Codes -- Coding Theory -- Performance Improvement of Turbo Code Based on the Extrinsic Information Transition Characteristics -- A Trellis-Based Bound on (2,1)-Separating Codes -- Tessellation Based Multiple Description Coding -- Exploitin…