Search results

From MaRDI portal
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • \(f\)-dependent set problem for planar graphs is in NC 1997-02-28 Paper A fast and efficient NC algorithm for maximal matching 1997-02-27 Paper Parallel complexity...
    10 bytes (17 words) - 00:03, 10 December 2023
  • Type NC algorithms for partitioning planar graphs into induced forests and approximating NP-hard problems 2024-02-28 Paper Fast RNC and NC algorithms for...
    10 bytes (16 words) - 19:41, 9 December 2023
  • on the Old k-opt Algorithm for the Traveling Salesman Problem 1999-10-28 Paper How Good is the Goemans--Williamson MAX CUT Algorithm? 1999-10-28 Paper...
    10 bytes (18 words) - 22:08, 10 December 2023
  • spaces in \(\mathcal{NC}\) 1998-08-04 Paper https://portal.mardi4nfdi.de/entity/Q4398367 1998-07-19 Paper A randomized linear-time algorithm to find minimum...
    10 bytes (19 words) - 15:50, 10 December 2023
  • parallel range-join algorithm on \(N\)-dimensional torus computers 1996-02-26 Paper An efficient permutation-based parallel algorithm for range-join in hypercubes...
    10 bytes (16 words) - 18:37, 8 December 2023
  • ``Sandwiching dense random regular graphs between binomial random graphs 2023-09-08 Paper Degree sequences of sufficiently dense random uniform hypergraphs...
    10 bytes (19 words) - 16:55, 7 December 2023
  • generating quasi-random sequences from two communicating semi-random sources 1987-01-01 Paper Generating quasi-random sequences from semi-random sources 1986-01-01...
    10 bytes (19 words) - 11:01, 12 December 2023
  • matchings in general graphs through randomization 1989-01-01 Paper The Two-Processor Scheduling Problem is in Random NC 1989-01-01 Paper https://portal.mardi4nfdi...
    10 bytes (19 words) - 11:01, 12 December 2023
  • On-line routing of random calls in networks 2003-07-08 Paper Concurrent threads and optimal parallel minimum spanning trees algorithm 2003-06-25 Paper A...
    10 bytes (17 words) - 02:11, 12 December 2023
  • 2012-02-11 Paper A numerical algorithm for zero counting. III: Randomization and condition 2011-12-08 Paper A numerical algorithm for zero counting. II: Distance...
    10 bytes (17 words) - 02:36, 9 December 2023
  • the reaction field 2010-10-18 Paper Best probability density function for random sampled data 2010-01-29 Paper Extending the fast multipole method to charges...
    10 bytes (19 words) - 15:11, 6 December 2023
  • Low-diameter graph decomposition is in NC 2022-12-09 Paper Random-walk based approximate \(k\)-nearest neighbors algorithm for diffusion state distance 2022-04-22...
    10 bytes (19 words) - 16:38, 12 December 2023
  • 2024-03-04 Paper Some stability and strong convergence results for the algorithm with perturbations for a T-Ciric quasicontraction in \(\mathrm{CAT}(0)\)...
    10 bytes (18 words) - 10:54, 9 December 2023
  • ] 1991-01-01 Paper Subtree isomorphism is in random NC 1990-01-01 Paper The transitive closure of a random digraph 1990-01-01 Paper https://portal.mardi4nfdi...
    10 bytes (19 words) - 05:05, 9 December 2023
  • languages in \(NC^ 1\) 1991-01-01 Paper The Power of Alternating One-Reversal Counters and Stacks 1991-01-01 Paper Systolic algorithms for some scheduling...
    10 bytes (17 words) - 12:23, 28 January 2024
  • Geometric Random-Walks 2011-10-28 Paper Flooding Time of Edge-Markovian Evolving Graphs 2011-07-18 Paper Approximation and Online Algorithms 2009-08-11...
    10 bytes (16 words) - 18:22, 9 December 2023
  • 1994-12-18 Paper Random fixed points and approximations in random convex metric spaces 1994-03-24 Paper Random fixed points of random multivalued operators...
    10 bytes (17 words) - 20:06, 8 December 2023
  • Publication Date of Publication Type NC algorithms for antidirected hamiltonian paths and cycles in tournaments 2024-01-05 Paper Tropical paths in vertex-colored...
    10 bytes (17 words) - 13:42, 28 January 2024
  • 1991-01-01 Paper A simple randomized parallel algorithm for list-ranking 1990-01-01 Paper Subtree isomorphism is in random NC 1990-01-01 Paper An improved...
    10 bytes (19 words) - 01:41, 12 December 2023
  • Paper Random shortest paths: non-Euclidean instances for metric optimization problems 2013-09-20 Paper Smoothed analysis of partitioning algorithms for Euclidean...
    10 bytes (20 words) - 03:38, 7 October 2023
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)