Cited in
(only showing first 100 items - show all)- Median filtering: a new insight
- Rank-Balanced Trees
- Functional correctness of C implementations of Dijkstra's, Kruskal's, and Prim's algorithms
- Path length statistics in reservoir computers
- A quantum algorithm for Viterbi decoding of classical convolutional codes
- An exact algorithm for the sequential ordering problem and its application to switching energy minimization in compilers
- Homotopy continuation method for solving systems of nonlinear and polynomial equations
- Method of searching for global extremum of a continuous function on a simplex
- The secret life of keys: on the calculation of mechanical lock systems
- Suboptimal Fault Tolerant Control Design with the Use of Discrete Optimization
- The weight function in the subtree kernel is decisive
- Detecting communities under constraints in directed acyclic networks
- Bisimulations for fuzzy automata
- Fast point and element search method in adaptive remeshing procedure and its applications
- Safety in \(s\)-\(t\) paths, trails and walks
- scientific article; zbMATH DE number 1759394 (Why is no real title available?)
- Optimal design of electromagnetic devices: development of an efficient optimization tool based on smart mutation operations implemented in a genetic algorithm
- Tensors, matchings and codes
- Weak bisimulations for fuzzy automata
- Tensors in computations
- Local RBF algorithms for elliptic boundary value problems in annular domains
- Modeling and simulation of the production process of electrical energy in a geothermal power plant
- Quality analysis in acyclic production networks
- Approximations of arbitrary relations by partial orders
- On the number of reachable pairs in a digraph
- A distributed Kalman filtering algorithm with fast finite-time convergence for sensor networks
- Sparse data structure design for wavelet-based methods
- Computation of the greatest simulations and bisimulations between fuzzy automata
- Low dimensional manifolds in reservoir computers
- Searching for quicksand ideals in partially ordered sets
- Dynamic programming deconstructed: transformations of the Bellman equation and computational efficiency
- Parallel computations on a graph
- scientific article; zbMATH DE number 1064419 (Why is no real title available?)
- Numerical solution of two-dimensional nonlinear sine-Gordon equation using localized method of approximate particular solutions
- Using basis dependence distance vectors in the modified Floyd-Warshall algorithm
- Explicit physics-informed neural networks for nonlinear closure: the case of transport in tissues
- Nondeterministic automata: equivalence, bisimulations, and uniform relations
- Efficient algorithm for proper orthogonal decomposition of block-structured adaptively refined numerical simulations
- Enumerating a subset of the integer points inside a Minkowski sum
- An efficient method to evaluate intersections on big data sets
- Greedy algorithms for the minimization knapsack problem: average behavior
- Noise-robust modes of the retinal population code have the geometry of ``ridges and correspond to neuronal communities
- scientific article; zbMATH DE number 7649899 (Why is no real title available?)
- An obstruction to solvability of the reach control problem using affine feedback
- Shapley-Folkman-Lyapunov theorem and asymmetric first price auctions
- Approximation and online algorithms for multidimensional bin packing: a survey
- Bisimulation of type 2 for BL-general fuzzy automata
- Some problems and algorithms related to the weight order relation on the n-dimensional Boolean cube
- Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- Solving partition problems almost always requires pushing many vertices around
- The power of linear-time data reduction for maximum matching
- A resource-efficient algorithm for study the growth in finite two-generator groups of exponent 5
- Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
- DEMiCs
- MixedVol
- TELOS
- ACM/EATCS
- PoSSo
- hfloat
- Binomials.m2
- Hom4PS-3
- r-TuBound
- UMDES
- Henshin
- acss
- OACC
- XHSTT
- Spatial Sorting
- Smacc
- Omega
- SHOP2
- GraphLog
- OTAWA
- Scribble
- SPY
- Timed Conversation
- HAS-SOP
- CFOUR
- MudPie
- VortexCalculations
- yt
- treex
- GP 2
- point location strategies
- Fast three-valued abstract bit-vector arithmetic
- Linear-space data structures for range mode query in arrays
- Resource allocation for epidemic control across multiple sub-populations
- A localized approach for the method of approximate particular solutions
- Robust fixed-lag smoothing under model perturbations
- How difficult is nonlinear optimization? A practical solver tuning approach, with illustrative results
- Model reduction of distributed nonstationary LPV systems
- Multilevel approaches for large-scale proteomic networks
- scientific article; zbMATH DE number 7456056 (Why is no real title available?)
- Power measures and solutions for games under precedence constraints
- Exact and meta-heuristic approaches for the production leveling problem
- The Power of Linear-Time Data Reduction for Maximum Matching
- Variable moving average transform stitching waves
- Practical distribution-sensitive point location in triangulations
- Confluence up to garbage in graph transformation
This page was built for software: Stony Brook
