Tarján, Robert Endre 1948-
Tarjan, Robert Endre
Robert Endre Tarjan
Tarjan, Robert E. (Robert Endre), 1948-
Tarjan, Robert E. 1948-
Tarjan, Robert E.
טרג'אן, רוברט, 1948-
VIAF ID: 73933029 (Personal)
Permalink: http://viaf.org/viaf/73933029
Preferred Forms
- 100 0 _ ‡a Robert Endre Tarjan
- 200 _ | ‡a Tarjan ‡b Robert Endre ‡f 1948-....
-
- 100 1 _ ‡a Tarjan, Robert E. ‡d 1948-
- 100 1 0 ‡a Tarjan, Robert E. ‡q (Robert Endre), ‡d 1948-
-
-
-
-
- 100 1 _ ‡a Tarjan, Robert Endre
-
- 100 1 _ ‡a Tarjan, Robert Endre
-
-
-
-
- 100 1 _ ‡a Tarjan, Robert Endre, ‡d 1948-
- 100 1 _ ‡a Tarjan, Robert Endre, ‡d 1948-....
-
-
4xx's: Alternate Name Forms (47)
Works
Title | Sources |
---|---|
Algorithms for two bottleneck optimization problems | |
Amortized Computational Complexity | |
Amortized efficiency of list update and paging rules | |
Applications of a Planar Separator Theorem | |
Applications of Path Compression on Balanced Trees | |
Asymptotically Tight Bounds on Time-Space Trade-offs in a Pebble Game | |
A Back-to-Basics Empirical Study of Priority Queues | |
A class of algorithms which require nonlinear time to maintain disjoint sets | |
Computing an st-numbering | |
A data structure for dynamic trees | |
Data structures and network algorithms | |
Decomposition by clique separators | |
Depth-First Search and Linear Graph Algorithms | |
Dividing a Graph into Triconnected Components | |
Dynamic Perfect Hashing: Upper and Lower Bounds | |
Dynamic trees as search trees via euler tours, applied to the network simplex algorithm | |
Edge-disjoint spanning trees and depth-first search | |
Efficiency of a Good But Not Linear Set Union Algorithm | |
Efficient maximum flow algorithms | |
An Efficient Parallel Biconnectivity Algorithm | |
Efficient Planarity Testing | |
Enumeration of the Elementary Circuits of a Directed Graph | |
Fast Algorithms for Finding Nearest Common Ancestors | |
A fast las vegas algorithm for triangulating a simple polygon | |
Faster algorithms for the shortest path problem | |
A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals | |
Finding a Maximum Independent Set | |
Finding minimum-cost flows by double scaling | |
Finding Minimum Spanning Trees | |
Gauss codes, planar hamiltonian graphs, and stack-sortable permutations | |
Hollow Heaps | |
A linear-time algorithm for testing the truth of certain quantified boolean formulas | |
A locally adaptive data compression scheme | |
Maintaining bridge-connected and biconnected components on-line | |
Maintenance of a minimum spanning forest in a dynamic plane graph | |
Making data structures persistent | |
Mathematical games | |
Metric properties of large graphs. | |
A new approach to the maximum-flow problem | |
Notes on introductory combinatorics | |
The pairing heap: A new form of self-adjusting heap | |
Planar point location using persistent search trees | |
Polygon triangulation inO(n log logn) time with simple data structures | |
Prime subprogram parsing of a program | |
Princeton series in computer science | |
Propriétés métriques des grands graphes | |
Rank-Pairing Heaps | |
The Recognition of Series Parallel Digraphs | |
Rectilinear planar layouts and bipolar orientations of planar graphs | |
Rotation Distance, Triangulations, and Hyperbolic Geometry | |
Scaling and related techniques for geometry problems | |
Self-adjusting binary search trees | |
separation theorem for graphs of bounded genus. - | |
Shin'yaku dēta kōzō to nettowāku arugorizumu | |
Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs | |
Soft Heaps Simplified | |
Sorting Using Networks of Queues and Stacks | |
Strict fibonacci heaps | |
Three Partition Refinement Algorithms | |
Time bounds for selection | |
Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs | |
Worst-case Analysis of Set Union Algorithms | |
新訳データ構造とネットワークアルゴリズム |