Yazar

Andrzej Lingas

20 cilt bulundu.

Cilt sonuçları

Fundamentals of Computation Theory

Andrzej Lingas, Bengt J. Nilsson · Yayınevi bilinmiyor

452 sayfa · 2014-01-15

Kategori yok

Automata, Languages and Programming

Andrzej Lingas, Rolf Karlsson · Springer Science & Business Media

716 sayfa · 1993-06-23

Computers

Fundamentals of Computation Theory

Andrzej Lingas, Bengt J. Nilsson · Springer Science & Business Media

444 sayfa · 2003-07-29

Computers

SWAT 88

Rolf Karlsson · Springer

276 sayfa · 1988

Computers

Lupus in fabula

Andrzej Lam · Yayınevi bilinmiyor

438 sayfa · 1988

Literature

AlgorithmsGreedy Triangulation Can be Efficiently Implemented in the Average CaseLinkoeping University. Dept. of Computer and Information Science, A. Lingas

Greedy Triangulation Can be Efficiently Implemented in the Average Case

Linkoeping University. Dept. of Computer and Information Science, A. Lingas · Yayınevi bilinmiyor

9 sayfa · 1989

Algorithms

AlgorithmsOn Parallel Complexity of the Subgraph Isomorphism ProblemLinkoeping University. Dept. of Computer and Information Science, A. Lingas

On Parallel Complexity of the Subgraph Isomorphism Problem

Linkoeping University. Dept. of Computer and Information Science, A. Lingas · Yayınevi bilinmiyor

9 sayfa · 1987

Algorithms

Matching theoryA Parallel Algorithm for Maximum Matching in Planar GraphsInternational Computer Science Institute, Linkoeping University. Dept. of Computer and Information Science, E. Dahlhaus, M. Karpinski, A. Lingas

A Parallel Algorithm for Maximum Matching in Planar Graphs

International Computer Science Institute, Linkoeping University. Dept. of Computer and Information Science, E. Dahlhaus, M. Karpinski, A. Lingas · Yayınevi bilinmiyor

7 sayfa · 1989

Matching theory

GeometryOn Partitioning PolygonsA. Lingas

On Partitioning Polygons

A. Lingas · Yayınevi bilinmiyor

8 sayfa · 1985

Geometry

AlgorithmsAn Optimal Expected-time Parallel Algorithm for Voronoi DiagramsLinkoeping University. Dept. of Computer and Information Science, C. Levcopoulos, Jyrki Katajainen, A. Lingas

An Optimal Expected-time Parallel Algorithm for Voronoi Diagrams

Linkoeping University. Dept. of Computer and Information Science, C. Levcopoulos, Jyrki Katajainen, A. Lingas · Yayınevi bilinmiyor

8 sayfa · 1989

Algorithms

Voronoi polygonsVoronoi Diagrams with Barriers and the Shortest Diagonal ProblemLinkoeping University. Dept. of Computer and Information Science, A. Lingas

Voronoi Diagrams with Barriers and the Shortest Diagonal Problem

Linkoeping University. Dept. of Computer and Information Science, A. Lingas · Yayınevi bilinmiyor

12 sayfa · 1989

Voronoi polygons

AlgorithmsAn O(n Log N) Algorithm for Computing a Link Center in a Simple PolygonLinkoeping University. Dept. of Computer and Information Science, H. N. Djidjev, A. Lingas, Jörg-Rüdiger Sack

An O(n Log N) Algorithm for Computing a Link Center in a Simple Polygon

Linkoeping University. Dept. of Computer and Information Science, H. N. Djidjev, A. Lingas, Jörg-Rüdiger Sack · Yayınevi bilinmiyor

20 sayfa · 1989

Algorithms

Graph theoryA Polynomial-time Algorithm for Subgraph Isomorphism of Two-connected Series-parallel GraphsLinkoeping University. Dept. of Computer and Information Science, A. Lingas, M. M. Syslo

A Polynomial-time Algorithm for Subgraph Isomorphism of Two-connected Series-parallel Graphs

Linkoeping University. Dept. of Computer and Information Science, A. Lingas, M. M. Syslo · Yayınevi bilinmiyor

17 sayfa · 1989

Graph theory

Computational complexityA Linear-time Heuristic for Minimum Weight Triangulation of Convex PolygonsLinkoeping University. Dept. of Computer and Information Science, A. Lingas

A Linear-time Heuristic for Minimum Weight Triangulation of Convex Polygons

Linkoeping University. Dept. of Computer and Information Science, A. Lingas · Yayınevi bilinmiyor

6 sayfa · 1985

Computational complexity

Matching theorySubtree Isomorphism and Bipartite Perfect Matching are Mutually NC ReducibleLinkoeping University. Dept. of Computer and Information Science, A. Lingas, M. Karpinski

Subtree Isomorphism and Bipartite Perfect Matching are Mutually NC Reducible

Linkoeping University. Dept. of Computer and Information Science, A. Lingas, M. Karpinski · Yayınevi bilinmiyor

11 sayfa · 1987

Matching theory

Heuristic programmingNearly Optimal Heuristics for Binary Search Trees with Geometric GeneralizationsLinkoeping University. Dept. of Computer and Information Science, C. Levcopoulos, A. Lingas, Jörg-Rüdiger Sack

Nearly Optimal Heuristics for Binary Search Trees with Geometric Generalizations

Linkoeping University. Dept. of Computer and Information Science, C. Levcopoulos, A. Lingas, Jörg-Rüdiger Sack · Yayınevi bilinmiyor

15 sayfa · 1987

Heuristic programming

Voronoi polygonsOn Computing Voronoi Diagrams for Sorted Point SetsRice University. Dept. of Computer Science, Hristo N. Djidjev, Andrzej Lingas

On Computing Voronoi Diagrams for Sorted Point Sets

Rice University. Dept. of Computer Science, Hristo N. Djidjev, Andrzej Lingas · Yayınevi bilinmiyor

11 sayfa · 1994

Voronoi polygons

AlgorithmsAn Efficient Parallel Algorithm for Planar Directed ReachabilityLinkoeping University. Dept. of Computer and Information Science, A. Lingas

An Efficient Parallel Algorithm for Planar Directed Reachability

Linkoeping University. Dept. of Computer and Information Science, A. Lingas · Yayınevi bilinmiyor

10 sayfa · 1989

Algorithms

AlgorithmsAutomata, Languages and Programming - ICALP '93Bilinmeyen yazar

Automata, Languages and Programming - ICALP '93

Bilinmeyen yazar · Yayınevi bilinmiyor

Sayfa sayısı yok · 1991

Algorithms

Isomorphisms (Mathematics)Subgraph Isomorphism for Connected Graphs of Bounded Valence and Bounded Separator is in NC.Linkoeping University. Dept. of Computer and Information Science, A. Lingas

Subgraph Isomorphism for Connected Graphs of Bounded Valence and Bounded Separator is in NC.

Linkoeping University. Dept. of Computer and Information Science, A. Lingas · Yayınevi bilinmiyor

7 sayfa · 1989

Isomorphisms (Mathematics)