The following pages link to Algorithmica (Q96582):
Displaying 50 items.
- Smallest bipartite bridge-connectivity augmentation (Q834588) (← links)
- Speeding up HMM decoding and training by exploiting sequence repetitions (Q834590) (← links)
- A note on multiflows and treewidth (Q834591) (← links)
- I/O-efficient algorithms for graphs of bounded treewidth (Q834592) (← links)
- Graph spanners in the streaming model: An experimental study (Q834593) (← links)
- Optimal algorithms for \(k\)-search with application in option pricing (Q834594) (← links)
- Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts (Q834596) (← links)
- Exact Minkowksi sums of polyhedra and exact and efficient decomposition of polyhedra into convex pieces (Q834598) (← links)
- Linear data structures for fast ray-shooting amidst convex polyhedra (Q834599) (← links)
- Order statistics in the Farey sequences in sublinear time and counting primitive lattice points in polygons (Q834601) (← links)
- A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs (Q835643) (← links)
- Quantum information and the PCP theorem (Q835644) (← links)
- Error-detection-based quantum fault-tolerance threshold (Q835645) (← links)
- On the quantum query complexity of local search in two and three dimensions (Q835649) (← links)
- Random measurement bases, quantum state distinction and applications to the hidden subgroup problem (Q835652) (← links)
- In-place algorithms for computing (Layers of) maxima (Q848632) (← links)
- Collective tree spanners in graphs with bounded parameters (Q848633) (← links)
- Transactional contention management as a Non-clairvoyant scheduling problem (Q848634) (← links)
- A universal online caching algorithm based on pattern matching (Q848635) (← links)
- Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time (Q848637) (← links)
- Secure overlay network design (Q848639) (← links)
- A top-down approach to search-trees: Improved algorithmics for 3-hitting set (Q848640) (← links)
- Stability in the self-organized evolution of networks (Q848641) (← links)
- Analysis of evolutionary algorithms for the longest common subsequence problem (Q848642) (← links)
- Continuous lunches are free plus the design of optimal optimization algorithms (Q848643) (← links)
- Evolutionary algorithms and matroid optimization problems (Q848644) (← links)
- On independent vertex sets in subclasses of apple-free graphs (Q848838) (← links)
- A faster algorithm for computing the principal sequence of partitions of a graph (Q848839) (← links)
- Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs (Q848841) (← links)
- An algorithm for minimum cost arc-connectivity orientations (Q848842) (← links)
- Approximation algorithms for treewidth (Q848843) (← links)
- Capabilities and limits of compact error resilience methods for algorithmic self-assembly (Q848844) (← links)
- Bin packing with rejection revisited (Q848845) (← links)
- Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing (Q848846) (← links)
- A timing assumption and two \(t\)-resilient protocols for Implementing an eventual leader service in asynchronous shared memory systems (Q848847) (← links)
- \(\ell ^2_2\) spreading metrics for vertex ordering problems (Q848848) (← links)
- Random matrices and codes for the erasure channel (Q848850) (← links)
- An efficient algorithm for solving pseudo clique enumeration problem (Q848935) (← links)
- Minimum degree orderings (Q848936) (← links)
- Faster combinatorial algorithms for determinant and Pfaffian (Q848938) (← links)
- A constant-competitive algorithm for online OVSF code assignment (Q848939) (← links)
- On mixing and edge expansion properties in randomized broadcasting (Q848940) (← links)
- Integer representation and counting in the bit probe model (Q848941) (← links)
- Efficient algorithms for the problems of enumerating cuts by non-decreasing weights (Q848944) (← links)
- A practical exact algorithm for the individual haplotyping problem MEC/GI (Q848946) (← links)
- Quantum separation of local search and fixed point computation (Q848947) (← links)
- A better constant-factor approximation for selected-internal Steiner minimum tree (Q848949) (← links)
- Resource bounded frequency computations with three errors (Q848951) (← links)
- Structural identifiability in low-rank matrix factorization (Q848955) (← links)
- Geometric representation of graphs in low dimension using axis parallel boxes (Q848956) (← links)
