Stony Brook
From MaRDI portal
Software:17180
swMATH5040MaRDI QIDQ17180FDOQ17180
Author name not available (Why is that?)
Cited In (only showing first 100 items - show all)
- Rank-Balanced Trees
- Median filtering: a new insight
- Functional correctness of C implementations of Dijkstra's, Kruskal's, and Prim's algorithms
- An exact algorithm for the sequential ordering problem and its application to switching energy minimization in compilers
- Suboptimal Fault Tolerant Control Design with the Use of Discrete Optimization
- Homotopy continuation method for solving systems of nonlinear and polynomial equations
- Bisimulations for fuzzy automata
- Fast point and element search method in adaptive remeshing procedure and its applications
- Tensors in computations
- Tensors, matchings and codes
- Weak bisimulations for fuzzy automata
- Quality analysis in acyclic production networks
- Approximations of arbitrary relations by partial orders
- A distributed Kalman filtering algorithm with fast finite-time convergence for sensor networks
- Title not available (Why is that?)
- Computation of the greatest simulations and bisimulations between fuzzy automata
- Numerical solution of two-dimensional nonlinear sine-Gordon equation using localized method of approximate particular solutions
- Parallel computations on a graph
- Efficient algorithm for proper orthogonal decomposition of block-structured adaptively refined numerical simulations
- Nondeterministic automata: equivalence, bisimulations, and uniform relations
- 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
- Title not available (Why is that?)
- Approximation and online algorithms for multidimensional bin packing: a survey
- An obstruction to solvability of the reach control problem using affine feedback
- Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
- The power of linear-time data reduction for maximum matching
- Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
- Linear-space data structures for range mode query in arrays
- 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
- A localized approach for the method of approximate particular solutions
- Power measures and solutions for games under precedence constraints
- Practical distribution-sensitive point location in triangulations
- Sequencing surgical cases in a day-care environment: an exact branch-and-price approach
- Mixed cell computation in HOM4ps
- Network DEA: efficiency analysis of organizations with complex internal structure
- Range Majority in Constant Time and Linear Space
- A note on testing axioms of revealed preference
- Timed runtime monitoring for multiparty conversations
- Distributed algorithms for matching in hypergraphs
- Polynomial approximations of electronic wave functions
- On implementing the symbolic preprocessing function over Boolean polynomial rings in Gröbner basis algorithms using linear algebra
- Toolgraph design of optimal and feasible control strategies for time-varying dynamical systems
- Anytime coalition structure generation in multi-agent systems with positive or negative externalities
- Identifying codes on directed de Bruijn graphs
- Decomposition methods based on articulation vertices for degree-dependent spanning tree problems
- Approximating a real number by a rational number with a limited denominator: a geometric approach
- On Nonparametric Maximum Likelihood Estimation with Interval Censoring and Left Truncation
- Parallel degree computation for binomial systems
- Replacing conjectures by positive knowledge: inferring proven precise worst-case execution time bounds using symbolic execution
- Wavelet deblurring algorithms for spatially varying blur from high-resolution image reconstruction
- Localized method of approximate particular solutions with polynomial basis functions
- Backtracking Algorithms for Constructing the Hamiltonian Decomposition of a 4-regular Multigraph
- Monte Carlo solution of combinatorial optimization problems
- MudPie: layers in the ball of mud
- Design tools for reporter strands and DNA origami scaffold strands
- Noise-Robust Modes of the Retinal Population Code Have the Geometry of “Ridges” and Correspond to Neuronal Communities
- Path length statistics in reservoir computers
- Variable Moving Average Transform Stitching Waves
- Solving Partition Problems Almost Always Requires Pushing Many Vertices Around
- A quantum algorithm for Viterbi decoding of classical convolutional codes
- Title not available (Why is that?)
- Safety in \(s\)-\(t\) paths, trails and walks
- Optimal design of electromagnetic devices: development of an efficient optimization tool based on smart mutation operations implemented in a genetic algorithm
- Modeling and simulation of the production process of electrical energy in a geothermal power plant
- On the number of reachable pairs in a digraph
- Sparse data structure design for wavelet-based methods
- Low dimensional manifolds in reservoir computers
- Searching for quicksand ideals in partially ordered sets
- 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
- Some problems and algorithms related to the weight order relation on the n-dimensional Boolean cube
- Shapley-Folkman-Lyapunov theorem and asymmetric first price auctions
- Bisimulation of type 2 for BL-general fuzzy automata
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- A resource-efficient algorithm for study the growth in finite two-generator groups of exponent 5
- Fast three-valued abstract bit-vector arithmetic
- Resource allocation for epidemic control across multiple sub-populations
- Multilevel approaches for large-scale proteomic networks
- Title not available (Why is that?)
- The Power of Linear-Time Data Reduction for Maximum Matching
- Exact and meta-heuristic approaches for the production leveling problem
- Confluence up to garbage in graph transformation
- Optimisation for multi-part flow-line configuration of reconfigurable manufacturing system using GA
- Об одном методе поиска глобального экстремума непрерывной функции на симплексе
- On the reliability of structures equipped with a class of friction-based devices under stochastic excitation
- Title not available (Why is that?)
- Title not available (Why is that?)
- A new approximate inverse preconditioner based on the Vaidya’s maximum spanning tree for matrix equation AXB = C
- Local RBF Algorithms for Elliptic Boundary Value Problems in Annular Domains
- On kernelization and approximation for the vector connectivity problem
- A Markov chain on the solution space of edge colorings of bipartite graphs
- The Secret Life of Keys: On the Calculation of Mechanical Lock Systems
- A constant-time algorithm for middle levels Gray codes
- Properties of the \(d\)-dimensional Earth mover's problem
- Dynamic Programming Deconstructed: Transformations of the Bellman Equation and Computational Efficiency
- \textsc{QualityCover}: efficient binary relation coverage guided by induced knowledge quality
This page was built for software: Stony Brook
