Introduction to algorithms.
From MaRDI portal
Publication:3651735
Recommendations
Cited in
(only showing first 100 items - show all)- 1.61-approximation for min-power strong connectivity with two power levels
- Further analysis of the remedian algorithm
- Bounded-degree minimum-radius spanning trees in wireless sensor networks
- An analysis of chain characteristics in the cryptanalytic TMTO method
- Asymptotics and random sampling for BCI and BCK lambda terms
- A scalable approach to computing representative lowest common ancestor in directed acyclic graphs
- On the choice of a multiplication algorithm for polynomials and polynomial matrices
- Demand-aware network designs of bounded degree
- On representations of ternary order relations in numeric strings
- A Bayesian perspective of statistical machine learning for big data
- Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model
- Making change in 2048
- Gender-aware facility location in multi-gender world
- Solving jigsaw puzzles by the graph connection Laplacian
- A greedy algorithm for the DNA sequencing by hybridization with positive and negative errors and information about repetitions
- Succinct representations of permutations and functions
- Upper bounds on number of steals in rooted trees
- How to pack directed acyclic graphs into small blocks
- On the fast delivery problem with one or two packages
- Certain properties and applications of the 2D Sheffer and related polynomials
- Packing different cuboids with rotations and spheres into a cuboid
- Constrained synchronization and commutativity
- COOMA: a components overlaid mining algorithm for enumerating connected subgraphs with common itemsets
- A faster algorithm for cuckoo insertion and bipartite matching in large graphs
- Computing intersection numbers and bases of cohomology groups for triangulated closed three-dimensional manifolds
- Strategic network formation through an intermediary
- Minimizing the Spread of Rumor Within Budget Constraint in Online Network
- Facility location with tree topology and radial distance constraints
- Finding missing synchronization in a distributed computation using controlled re-execution
- 2-D lossless FIR filter design using synthesis of the paraunitary transfer function matrix
- Partial and simultaneous transitive orientations via modular decompositions
- Distributed delay-tolerant strategies for equality-constraint sum-preserving resource allocation
- Topological approach and analysis of clustering in consensus networks
- Graph spanners: a tutorial review
- A novel method for deadlock prevention of AMS by using resource-oriented Petri nets
- Computing weighted strength and applications to partitioning
- Tighter Fourier transform lower bounds
- Polynomial modular product verification and its implications
- OptORAMa: optimal oblivious RAM
- Answering UCQs under updates and in the presence of integrity constraints
- \textsc{Superset}: A (super)natural variant of the card game \textsc{Set}
- On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic
- Quasi-static filling of a disordered nanoporous medium with a non-wetting liquid as a process of self-organized criticality
- Application of high-performance computing to solve the Cauchy problem with the fractional Riccati equation using an nonlocal implicit finite-difference scheme
- Randomized low-rank approximation methods for projection-based model order reduction of large nonlinear dynamical problems
- Vehicle routing for connected service areas -- a versatile approach covering single, hierarchical, and bi-criteria objectives
- A \((1/2+1/60)\)-approximation algorithm for maximum weight series-parallel subgraph
- Incremental NFA minimization
- Parameterized complexity of the spanning tree congestion problem
- STR3: a path-optimal filtering algorithm for table constraints
- A stabilised immersed boundary method on hierarchical b-spline grids for fluid-rigid body interaction with solid-solid contact
- Approximation with a fixed number of solutions of some multiobjective maximization problems
- Weak heaps engineered
- SUSPECT: MINLP special structure detector for Pyomo
- Algorithms to test open set condition for self-similar set related to P.V. numbers
- Analysis of speedups in parallel evolutionary algorithms and (1 + ) EAs for combinatorial optimization
- Using link analysis technique with a modified shortest-path algorithm to fight money laundering
- An application of dynamic programming to assign pressing tanks at wineries
- Robust bounds on choosing from large tournaments
- A dynamic programming approach to multi-objective logic synthesis of quantum circuits
- Revisiting multiple pattern matching algorithms for multi-core architecture
- Constraining bridges between levels of analysis: a computational justification for locally Bayesian learning
- Computational classification of tubular algebras
- Genetic programming + proof search = automatic improvement
- Foundations of RDF Databases
- A generalized hypergreedy algorithm for weighted perfect matching
- Edge-Cuts of Optimal Average Weights
- Polynomial sequences: elementary basic methods and application hints. A survey
- Moving target search optimization -- a literature review
- Level-based analysis of the univariate marginal distribution algorithm
- Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles
- Computational approaches to non-convex, sparsity-inducing multi-penalty regularization
- Robust topological policy iteration for infinite horizon bounded Markov decision processes
- A biobjective Dijkstra algorithm
- An efficient and effective generic agglomerative hierarchical clustering approach
- Dynamical Systems Theory and Algorithms for NP-hard Problems
- Sorting real numbers in \(O(n \sqrt{\log n})\) time and linear space
- Branch‐and‐cut algorithms for the ‐arborescence star problem
- Communication-Efficient Private Protocols for Longest Common Subsequence
- Scaling behavior of diffusion on binary Archimedean electrical lattices and layers
- A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots
- \(K\)-Knuth equivalence for increasing tableaux
- Generalized SOR-like iteration method for solving weakly nonlinear systems
- Efficient execution of dynamically controllable simple temporal networks with uncertainty
- The Synergy of Finite State Machines
- Authenticated hash tables based on cryptographic accumulators
- Succinct dynamic cardinal trees
- Size-energy tradeoffs for unate circuits computing symmetric Boolean functions
- On computing the 2-vertex-connected components of directed graphs
- Computing newforms using supersingular isogeny graphs
- Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes
- Approximate pattern matching with the \(L_1\), \(L_2\) and \(L_\infty\) metrics
- On the parameterized complexity of associative and commutative unification
- A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints
- Analyzing the optimal neighborhood: algorithms for partial and budgeted connected dominating set problems
- On ultrametric 1-median selection
- Characterizing sets of jobs that admit optimal greedy-like algorithms
- Approximating TSP walks in subcubic graphs
- An improved quantum network communication model based on compressed tensor network states
- Hierarchical clustering of constrained dynamic systems using robust positively invariant sets
This page was built for publication: Introduction to algorithms.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3651735)
