swMATH5040MaRDI QIDQ17180FDOQ17180
Author name not available (Why is that?)
Official website: http://www.cs.sunysb.edu/~algorith/
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
- 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
- Approximations of arbitrary relations by partial orders
- Title not available (Why is that?)
- Computation of the greatest simulations and bisimulations between fuzzy automata
- Parallel computations on a graph
- 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
- Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
- Linear-space data structures for range mode query in arrays
- A localized approach for the method of approximate particular solutions
- DEMiCs
- TELOS
- ACM/EATCS
- PoSSo
- hfloat
- Binomials.m2
- Power measures and solutions for games under precedence constraints
- Hom4PS-3
- r-TuBound
- UMDES
- Henshin
- acss
- OACC
- XHSTT
- Spatial Sorting
- Smacc
- Omega
- Practical distribution-sensitive point location in triangulations
- SHOP2
- GraphLog
- OTAWA
- Scribble
- SPY
- Timed Conversation
- HAS-SOP
- CFOUR
- MudPie
- VortexCalculations
- yt
- treex
- Sequencing surgical cases in a day-care environment: an exact branch-and-price approach
- Mixed cell computation in HOM4ps
- GP 2
- point location strategies
- 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
- 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
- Anytime coalition structure generation in multi-agent systems with positive or negative externalities
- Identifying codes on directed de Bruijn graphs
- 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
- 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
- loki
- ESCO_OperatorInference_TimeDependentProblems
- STENCIL-NET
- Path length statistics in reservoir computers
- A quantum algorithm for Viterbi decoding of classical convolutional codes
- The secret life of keys: on the calculation of mechanical lock systems
- Method of searching for global extremum of a continuous function on a simplex
- An exact algorithm for the sequential ordering problem and its application to switching energy minimization in compilers
- The weight function in the subtree kernel is decisive
- Suboptimal Fault Tolerant Control Design with the Use of Discrete Optimization
- Detecting communities under constraints in directed acyclic networks
- 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
- 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
- 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
- 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
- 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
This page was built for software: Stony Brook
