FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W1551637440> ?p ?o ?g. }

• W1551637440 abstract "Polynomial equations-solving and its applications.- Quasi-random combinatorial structures.- Hamiltonian abstract Voronoi diagrams in linear time.- Every set of disjoint line segments admits a binary tree.- The traveling cameraman problem, with applications to automatic optical inspection.- On determining the congruity of point sets in higher dimensions.- On random hard sets for NP.- Computing solutions uniquely collapses the polynomial hierarchy.- Verifying the determinant in parallel.- Hardness of approximating graph transformation problem.- Randomized wait-free naming.- Unifying themes for network selection.- Robust asynchronous algorithms in networks with a fault detection ring.- Distributed algorithms for finding small cycle covers in arbitrary networks.- A neural network model for quadratic programming with simple upper and lower bounds and its application to linear programming.- Analysis of the convergency of topology preserving neural networks on learning.- On helping and interactive proof systems.- Average time complexity of the SAT 1.2 algorithm.- Average cost to produce partial orders.- Two notes on low-density subset sum algorithm.- Rotation distance, triangulations of planar surfaces and hyperbolic geometry.- Finitely representable spatial objects and efficient computation.- Computing all small cuts in undirected networks.- Edge-coloring and f-coloring for various classes of graphs.- Edge-disjoint paths in permutation graphs.- Minimum augmentation to k-edge-connect specified vertices of a graph.- Algorithmic Chernoff-Hoeffding inequalities in integer programming.- Approximate pattern matching with samples.- An efficient optimal algorithm for minimizing the overall communication cost in replicated data management.- Multispace search: A new optimization approach.- Realizing degree sequences in parallel.- Efficient sequential and parallel algorithms for the negative cycle problem.- Fast and efficient operations on Parallel Priority Queues.- Heaps with bits.- Components and projections of curves over finite fields.- On the approximation of finding various minimal, maximal, and consistent sequences.- A linear-time algorithm for computing characteristic strings.- The maximum latency and identification of positive Boolean functions.- Fast deterministic Hot-Potato routing on processor arrays.- k-pairwise cluster fault tolerant routing in hypercubes.- On Steiner minimal trees in grid graphs and its application to VLSI routing.- Optimal routing of permutations on rings.- Resource bounded randomness and weakly complete problems.- Deterministic ? automata vis-a-vis deterministic Buchi automata.- Quantum computation and NP-complete problems.- Separability and one-way functions.- On the approximation of largest common subtrees and largest common point sets.- An approximation scheme for some Steiner tree problems in the plane.- A chain decomposition algorithm for the proof of a property on minimum weight triangulations.- Generating algorithm for quasi-full Steiner tree.- Analysing deletions in competitive self-adjusting linear list algorithms.- Are Fibonacci heaps optimal?.- Simple and efficient graph compression schemes for dense and complement graphs.- Improved algorithms for coloring random graphs.- On the parallel complexity of solving recurrence equations.- Extended graph connectivity and its gradually increasing parallel complexity.- Parallel h-v drawings of binary trees.- An efficient parallel strategy for recognizing series-parallel graphs.- Orthogonal queries in segments and triangles.- Further computational geometry in secondary memory.- Shortest safari routes in simple polygons.- On greedy tetrahedralization of points in 3D.- The totally-perfect bipartite graph and its construction.- k Best Cuts for Circular-Arc graphs.- Revisiting circular arc graphs.- Weighted irredundance of interval graphs.- A reordering operation for an ordered binary decision diagram and an extended framework for combinatorics of graphs.- On the size of ordered binary decision diagrams representing threshold functions.- Nonuniform lowness and strong nonuniform lowness.- Definition and existence of super complexity cores.- Efficient algorithms for assigning chain-like tasks on a chain-like network computer.- Manpower scheduling with shift change constraints.- Fast algorithms for transversal matroid intersection problems.- A convex hull algorithm on coarse-grained multiprocessor.- A multiway merging network.- Reporting and counting intersections of lines within a polygon.- A new problem in string searching.- Achieving the shortest clock period by inserting the minimum amount of delay.- A randomized algorithm to Finite Automata Public Key Cryptosystem." @default.
• W1551637440 created "2016-06-24" @default.
• W1551637440 creator A5070776318 @default.
• W1551637440 creator A5073372450 @default.
• W1551637440 date "1994-09-01" @default.
• W1551637440 modified "2023-09-24" @default.
• W1551637440 title "Algorithms and Computation: 5th International Symposium, Isaac '94, Beijing, P.R. China, August 25-27, 1994 : Proceedings" @default.
• W1551637440 hasPublicationYear "1994" @default.
• W1551637440 type Work @default.
• W1551637440 sameAs 1551637440 @default.
• W1551637440 citedByCount "0" @default.
• W1551637440 crossrefType "book" @default.
• W1551637440 hasAuthorship W1551637440A5070776318 @default.
• W1551637440 hasAuthorship W1551637440A5073372450 @default.
• W1551637440 hasConcept C11413529 @default.
• W1551637440 hasConcept C114614502 @default.
• W1551637440 hasConcept C118615104 @default.
• W1551637440 hasConcept C132525143 @default.
• W1551637440 hasConcept C148764684 @default.
• W1551637440 hasConcept C311688 @default.
• W1551637440 hasConcept C33923547 @default.
• W1551637440 hasConcept C41008148 @default.
• W1551637440 hasConcept C47458327 @default.
• W1551637440 hasConcept C80444323 @default.
• W1551637440 hasConceptScore W1551637440C11413529 @default.
• W1551637440 hasConceptScore W1551637440C114614502 @default.
• W1551637440 hasConceptScore W1551637440C118615104 @default.
• W1551637440 hasConceptScore W1551637440C132525143 @default.
• W1551637440 hasConceptScore W1551637440C148764684 @default.
• W1551637440 hasConceptScore W1551637440C311688 @default.
• W1551637440 hasConceptScore W1551637440C33923547 @default.
• W1551637440 hasConceptScore W1551637440C41008148 @default.
• W1551637440 hasConceptScore W1551637440C47458327 @default.
• W1551637440 hasConceptScore W1551637440C80444323 @default.
• W1551637440 hasLocation W15516374401 @default.
• W1551637440 hasOpenAccess W1551637440 @default.
• W1551637440 hasPrimaryLocation W15516374401 @default.
• W1551637440 hasRelatedWork W1496228790 @default.
• W1551637440 hasRelatedWork W1499912543 @default.
• W1551637440 hasRelatedWork W1515008649 @default.
• W1551637440 hasRelatedWork W1518382011 @default.
• W1551637440 hasRelatedWork W1529198486 @default.
• W1551637440 hasRelatedWork W1539759504 @default.
• W1551637440 hasRelatedWork W1542326760 @default.
• W1551637440 hasRelatedWork W1544119083 @default.
• W1551637440 hasRelatedWork W1544961126 @default.
• W1551637440 hasRelatedWork W1558147216 @default.
• W1551637440 hasRelatedWork W1562916609 @default.
• W1551637440 hasRelatedWork W1567338926 @default.
• W1551637440 hasRelatedWork W1580029614 @default.
• W1551637440 hasRelatedWork W1583277250 @default.
• W1551637440 hasRelatedWork W1585638336 @default.
• W1551637440 hasRelatedWork W1588708382 @default.
• W1551637440 hasRelatedWork W1603063140 @default.
• W1551637440 hasRelatedWork W1605744855 @default.
• W1551637440 hasRelatedWork W1608783969 @default.
• W1551637440 hasRelatedWork W3147701688 @default.
• W1551637440 isParatext "false" @default.
• W1551637440 isRetracted "false" @default.
• W1551637440 magId "1551637440" @default.
• W1551637440 workType "book" @default.