Search results for "Robert Endre Tarjan"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, Robert Endre Tarjan	Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance.	ACM Transactions on Algorithms	2012	DBLP DOI BibTeX RDF
1	Pankaj K. Agarwal, Lars Arge, Haim Kaplan, Eyal Molad, Robert Endre Tarjan, Ke Yi	An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries.	SIAM J. Comput.	2012	DBLP DOI BibTeX RDF
1	Gerth Stølting Brodal, George Lagogiannis, Robert Endre Tarjan	Strict fibonacci heaps.	STOC	2012	DBLP DOI BibTeX RDF
1	Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robert Endre Tarjan, Renato Fonseca F. Werneck	Data structures for mergeable trees.	ACM Transactions on Algorithms	2011	DBLP DOI BibTeX RDF
1	Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Robert Endre Tarjan	A New Approach to Incremental Cycle Detection and Related Problems	CoRR	2011	DBLP BibTeX RDF
1	Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, Robert Endre Tarjan	Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance	CoRR	2011	DBLP BibTeX RDF
1	Bernhard Haeupler, Siddhartha Sen, Robert Endre Tarjan	Rank-Pairing Heaps.	SIAM J. Comput.	2011	DBLP DOI BibTeX RDF
1	Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Robert Endre Tarjan, Renato Fonseca F. Werneck	Maximum Flows by Incremental Breadth-First Search.	ESA	2011	DBLP DOI BibTeX RDF
1	Robert Endre Tarjan	Theory vs. Practice in the Design and Analysis of Algorithms.	WADS	2011	DBLP DOI BibTeX RDF
1	Julie Ward, Bin Zhang 0004, Shailendra Jain, Chris Fry, Thomas Olavson, Holger Mishal, Jason Amaral, Dirk Beyer 0002, Ann Brecht, Brian Cargille, Russ Chadinha, Kathy Chou, Gavin DeNyse, Qi Feng, Cookie Padovani, Sesh Raj, Kurt Sunderbruch, Robert Endre Tarjan, Krishna Venkatraman, Joseph Woods, Jing Zhou	HP Transforms Product Portfolio Management with Operations Research.	Interfaces	2010	DBLP DOI BibTeX RDF
1	Siddhartha Sen, Robert Endre Tarjan	Deletion Without Rebalancing in Balanced Binary Trees.	SODA	2010	DBLP BibTeX RDF
1	Bernhard Haeupler, Siddhartha Sen, Robert Endre Tarjan	Heaps Simplified	CoRR	2009	DBLP BibTeX RDF
1	Robert Endre Tarjan, Renato Fonseca F. Werneck	Dynamic trees in practice.	ACM Journal of Experimental Algorithmics	2009	DBLP DOI BibTeX RDF
1	Boris V. Cherkassky, Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck	Shortest-path feasibility algorithms: An experimental evaluation.	ACM Journal of Experimental Algorithmics	2009	DBLP DOI BibTeX RDF
1	Bernhard Haeupler, Siddhartha Sen, Robert Endre Tarjan	Rank-Pairing Heaps.	ESA	2009	DBLP DOI BibTeX RDF
1	Andrew Byde, Terence Kelly, Yunhong Zhou, Robert Endre Tarjan	Efficiently Generating k-Best Solutions to Procurement Auctions.	AAIM	2009	DBLP DOI BibTeX RDF
1	Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck	An Experimental Study of Minimum Mean Cycle Algorithms.	ALENEX	2009	DBLP BibTeX RDF
1	Bernhard Haeupler, Siddhartha Sen, Robert Endre Tarjan	Rank-Balanced Trees.	WADS	2009	DBLP DOI BibTeX RDF
1	Siddhartha Sen, Robert Endre Tarjan	Deletion without Rebalancing in Multiway Search Trees.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Bernhard Haeupler, Robert Endre Tarjan	Finding a feasible flow in a strongly connected network.	Oper. Res. Lett.	2008	DBLP DOI BibTeX RDF
1	Bernhard Haeupler, Robert Endre Tarjan	Planarity Algorithms via PQ-Trees (Extended Abstract).	Electronic Notes in Discrete Mathematics	2008	DBLP DOI BibTeX RDF
1	Haim Kaplan, Robert Endre Tarjan	Thin heaps, thick heaps.	ACM Transactions on Algorithms	2008	DBLP DOI BibTeX RDF	binomial queue, decrease key operation, fibonacci heap, melding, thick heap, thin heap, Data structure, priority queue, heap
1	Nina Mishra, Robert Schreiber, Isabelle Stanton, Robert Endre Tarjan	Finding Strongly Knit Clusters in Social Networks.	Internet Mathematics	2008	DBLP DOI BibTeX RDF
1	Bernhard Haeupler, Siddhartha Sen, Robert Endre Tarjan	Incremental Topological Ordering and Strong Component Maintenance	CoRR	2008	DBLP BibTeX RDF
1	Adam L. Buchsbaum, Loukas Georgiadis, Haim Kaplan, Anne Rogers, Robert Endre Tarjan, Jeffery Westbrook	Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems.	SIAM J. Comput.	2008	DBLP DOI BibTeX RDF
1	Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, Robert Endre Tarjan	Faster Algorithms for Incremental Topological Ordering.	ICALP	2008	DBLP DOI BibTeX RDF
1	Boris V. Cherkassky, Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck	Shortest Path Feasibility Algorithms: An Experimental Evaluation.	ALENEX	2008	DBLP BibTeX RDF
1	Alina Ene, William G. Horne, Nikola Milosavljevic, Prasad Rao, Robert Schreiber, Robert Endre Tarjan	Fast exact and heuristic methods for role minimization problems.	SACMAT	2008	DBLP DOI BibTeX RDF	role-based access control, role mining
1	Robert Endre Tarjan	Reachability Problems on Directed Graphs.	ISAAC	2008	DBLP DOI BibTeX RDF
1	Kamalika Chaudhuri, Anshul Kothari, Rudi Pendavingh, Ram Swaminathan, Robert Endre Tarjan, Yunhong Zhou	Server Allocation Algorithms for Tiered Systems.	Algorithmica	2007	DBLP DOI BibTeX RDF
1	Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robert Endre Tarjan, Renato Fonseca F. Werneck	Data Structures for Mergeable Trees	CoRR	2007	DBLP BibTeX RDF
1	Bernhard Haeupler, Robert Endre Tarjan	Finding a Feasible Flow in a Strongly Connected Network	CoRR	2007	DBLP BibTeX RDF
1	Maxim A. Babenko, Jonathan Derryberry, Andrew V. Goldberg, Robert Endre Tarjan, Yunhong Zhou	Experimental Evaluation of Parametric Max-Flow Algorithms.	WEA	2007	DBLP DOI BibTeX RDF
1	Robert Endre Tarjan, Renato Fonseca F. Werneck	Dynamic Trees in Practice.	WEA	2007	DBLP DOI BibTeX RDF
1	Nina Mishra, Robert Schreiber, Isabelle Stanton, Robert Endre Tarjan	Clustering Social Networks.	WAW	2007	DBLP DOI BibTeX RDF
1	Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup, Uri Zwick	Melding priority queues.	ACM Transactions on Algorithms	2006	DBLP DOI BibTeX RDF	disjoint set union, minimum directed spanning trees, optimum branchings, word RAM model, Priority queues, heaps, union-find
1	Loukas Georgiadis, Robert Endre Tarjan, Renato Fonseca F. Werneck	Finding Dominators in Practice.	J. Graph Algorithms Appl.	2006	DBLP BibTeX RDF
1	Robert Endre Tarjan, Julie Ward, Bin Zhang 0004, Yunhong Zhou, Jia Mao	Balancing Applied to Maximum Network Flow Problems.	ESA	2006	DBLP DOI BibTeX RDF
1	Loukas Georgiadis, Robert Endre Tarjan, Renato Fonseca F. Werneck	Design of data structures for mergeable trees.	SODA	2006	DBLP DOI BibTeX RDF
1	Robert Endre Tarjan	Results and Problems on Self-adjusting Search Trees and Related Data Structures.	SWAT	2006	DBLP DOI BibTeX RDF
1	Robert Endre Tarjan, Renato Fonseca F. Werneck	Self-adjusting top trees.	SODA	2005	DBLP DOI BibTeX RDF
1	Loukas Georgiadis, Robert Endre Tarjan	Dominator tree verification and vertex-disjoint paths.	SODA	2005	DBLP DOI BibTeX RDF
1	Eric Anderson, Dirk Beyer 0002, Kamalika Chaudhuri, Terence Kelly, Norman Salazar, Cipriano A. Santos, Ram Swaminathan, Robert Endre Tarjan, Janet L. Wiener, Yunhong Zhou	Value-maximizing deadline scheduling and its application to animation rendering.	SPAA	2005	DBLP DOI BibTeX RDF	animation rendering, multiprocessor job scheduling, simulation, deadline scheduling
1	Kamalika Chaudhuri, Anshul Kothari, Rudi Pendavingh, Ram Swaminathan, Robert Endre Tarjan, Yunhong Zhou	Server Allocation Algorithms for Tiered Systems.	COCOON	2005	DBLP DOI BibTeX RDF
1	Eric Anderson, Dirk Beyer 0002, Kamalika Chaudhuri, Terence Kelly, Norman Salazar, Cipriano A. Santos, Ram Swaminathan, Robert Endre Tarjan, Janet L. Wiener, Yunhong Zhou	Deadline scheduling for animation rendering.	SIGMETRICS	2005	DBLP DOI BibTeX RDF	animation rendering, simulation, deadline scheduling
1	Loukas Georgiadis, Renato Fonseca F. Werneck, Robert Endre Tarjan, Spyridon Triantafyllis, David I. August	Finding Dominators in Practice.	ESA	2004	DBLP DOI BibTeX RDF
1	Loukas Georgiadis, Robert Endre Tarjan	Finding dominators revisited: extended abstract.	SODA	2004	DBLP DOI BibTeX RDF
1	Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup, Uri Zwick	Melding Priority Queues.	SWAT	2004	DBLP DOI BibTeX RDF
1	Gary William Flake, Robert Endre Tarjan, Kostas Tsioutsiouliklis	Graph Clustering and Minimum Cut Trees.	Internet Mathematics	2003	DBLP DOI BibTeX RDF
1	Stuart Haber, Bill G. Horne, Joe Pato, Tomas Sander, Robert Endre Tarjan	If Piracy Is the Problem, Is DRM the Answer?	Digital Rights Management	2003	DBLP DOI BibTeX RDF
1	Haim Kaplan, Eyal Molad, Robert Endre Tarjan	Dynamic rectangular intersection with priorities.	STOC	2003	DBLP DOI BibTeX RDF	rectangular intersection, rectangular point location, packet classification, orthogonal range searching
1	Neal E. Young, Robert Endre Tarjan, James B. Orlin	Faster Parametric Shortest Path and Minimum Balance Algorithms	CoRR	2002	DBLP BibTeX RDF
1	Haim Kaplan, Nira Shafrir, Robert Endre Tarjan	Union-find with deletions.	SODA	2002	DBLP DOI BibTeX RDF
1	Haim Kaplan, Nira Shafrir, Robert Endre Tarjan	Meldable heaps and boolean union-find.	STOC	2002	DBLP DOI BibTeX RDF
1	Harold N. Gabow, Haim Kaplan, Robert Endre Tarjan	Unique Maximum Matching Algorithms.	J. Algorithms	2001	DBLP DOI BibTeX RDF
1	Haim Kaplan, Robert Endre Tarjan, Kostas Tsioutsiouliklis	Faster kinetic heaps and their use in broadcast scheduling.	SODA	2001	DBLP DOI BibTeX RDF
1	Bill G. Horne, Lesley R. Matheson, Casey Sheehan, Robert Endre Tarjan	Dynamic Self-Checking Techniques for Improved Tamper Resistance.	Digital Rights Management Workshop	2001	DBLP DOI BibTeX RDF
1	Haim Kaplan, Chris Okasaki, Robert Endre Tarjan	Simple Confluently Persistent Catenable Lists.	SIAM J. Comput.	2000	DBLP DOI BibTeX RDF
1	Haim Kaplan, Ron Shamir, Robert Endre Tarjan	Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs.	SIAM J. Comput.	1999	DBLP DOI BibTeX RDF
1	Haim Kaplan, Ron Shamir, Robert Endre Tarjan	A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals.	SIAM J. Comput.	1999	DBLP DOI BibTeX RDF
1	Bhaskar Ghosh, Frank Thomson Leighton, Bruce M. Maggs, S. Muthukrishnan, C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa, Robert Endre Tarjan, David Zuckerman	Tight Analyses of Two Local Load Balancing Algorithms.	SIAM J. Comput.	1999	DBLP DOI BibTeX RDF
1	Robert Endre Tarjan, Tandy Warnow (eds.)	Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 17-19 January 1999, Baltimore, Maryland.	SODA	1999	DBLP BibTeX RDF
1	Harold N. Gabow, Haim Kaplan, Robert Endre Tarjan	Unique Maximum Matching Algorithms.	STOC	1999	DBLP DOI BibTeX RDF
1	Lesley R. Matheson, Robert Endre Tarjan	Culturally Induced Information Impactedness: A Prescription for Failure in Software Ventures.	J. of Management Information Systems	1998	DBLP BibTeX RDF
1	Lesley R. Matheson, Stephen G. Mitchell, Talal Shamoon, Robert Endre Tarjan, Francis Zane	Robustness and Security of Digital Watermarks.	Financial Cryptography	1998	DBLP DOI BibTeX RDF
1	Lesley R. Matheson, Talal Shamoon, Robert Endre Tarjan	Culturally-Induced Information Impactedness: A Prescription for Failure in Software Ventures. (PDF / PS)	HICSS	1998	DBLP DOI BibTeX RDF
1	Haim Kaplan, Chris Okasaki, Robert Endre Tarjan	Simple Confluently Persistent Catenable Lists (Extended Abstract).	SWAT	1998	DBLP DOI BibTeX RDF
1	Brandon Dixon, Robert Endre Tarjan	Optimal Parallel Verification of Minimum Spanning Trees in Logarithmic Time.	Algorithmica	1997	DBLP DOI BibTeX RDF
1	Robert Endre Tarjan	Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm.	Math. Program.	1997	DBLP DOI BibTeX RDF
1	Haim Kaplan, Ron Shamir, Robert Endre Tarjan	Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals.	SODA	1997	DBLP DOI BibTeX RDF
1	Haim Kaplan, Ron Shamir, Robert Endre Tarjan	Faster and simpler algorithm for sorting signed permutations by reversals.	RECOMB	1997	DBLP DOI BibTeX RDF
1	Lesley R. Matheson, Robert Endre Tarjan	Parallelism in multigrid methods: How much is too much?	International Journal of Parallel Programming	1996	DBLP DOI BibTeX RDF
1	Lesley R. Matheson, Robert Endre Tarjan	Dominating Sets in Planar Graphs.	Eur. J. Comb.	1996	DBLP DOI BibTeX RDF
1	Lesley R. Matheson, Robert Endre Tarjan	Analysis of Multigrid Algorithms on Massively Parallel Computers: Architectural Implications.	J. Parallel Distrib. Comput.	1996	DBLP DOI BibTeX RDF
1	Susan E. Dorward, Lesley R. Matheson, Robert Endre Tarjan	Toward Efficient Unstructured Multigrid Preprocessing (Extended Abstract).	IRREGULAR	1996	DBLP DOI BibTeX RDF
1	Richard Cole, Philip N. Klein, Robert Endre Tarjan	Finding Minimum Spanning Forests in Logarithmic Time and Linear Work Using Random Sampling.	SPAA	1996	DBLP BibTeX RDF
1	Haim Kaplan, Robert Endre Tarjan	Purely Functional Representations of Catenable Sorted Lists.	STOC	1996	DBLP DOI BibTeX RDF
1	Adam L. Buchsbaum, Rajamani Sundar, Robert Endre Tarjan	Lazy Structure Sharing for Query Optimization.	Acta Inf.	1995	DBLP DOI BibTeX RDF
1	Adam L. Buchsbaum, Robert Endre Tarjan	Confluently Persistent Deques via Data-Structural Bootstrapping.	J. Algorithms	1995	DBLP DOI BibTeX RDF
1	David R. Karger, Philip N. Klein, Robert Endre Tarjan	A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees.	J. ACM	1995	DBLP DOI BibTeX RDF	randomized algorithm, minimum spanning tree, matroid
1	Adam L. Buchsbaum, Rajamani Sundar, Robert Endre Tarjan	Data-Structural Bootstrapping, Linear Path Compression, and Catenable Heap-Ordered Double-Ended Queues.	SIAM J. Comput.	1995	DBLP DOI BibTeX RDF
1	Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, Robert Endre Tarjan	Computing Minimal Spanning Subgraphs in Linear Time.	SIAM J. Comput.	1995	DBLP DOI BibTeX RDF
1	Bruce M. Maggs, Lesley R. Matheson, Robert Endre Tarjan	Models of parallel computation: a survey and synthesis.	HICSS	1995	DBLP DOI BibTeX RDF	unifying parallel model, machine diversity, machine design, design community, unifying paradigm, model design philosophy, prescriptivity, abstract computational models, performance, parallel processing, survey, language design, reviews, algorithm design, computation theory, simplicity, descriptivity, parallel computation models
1	Bhaskar Ghosh, Frank Thomson Leighton, Bruce M. Maggs, S. Muthukrishnan, C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa, Robert Endre Tarjan, David Zuckerman	Tight analyses of two local load balancing algorithms.	STOC	1995	DBLP DOI BibTeX RDF
1	Haim Kaplan, Robert Endre Tarjan	Persistent lists with catenation via recursive slow-down.	STOC	1995	DBLP DOI BibTeX RDF
1	V. King, S. Rao, Robert Endre Tarjan	A Faster Deterministic Maximum Flow Algorithm.	J. Algorithms	1994	DBLP DOI BibTeX RDF
1	James R. Driscoll, Daniel Dominic Sleator, Robert Endre Tarjan	Fully Persistent Lists with Catenation.	J. ACM	1994	DBLP DOI BibTeX RDF	catenation, data structures, functional programming, LISP, queue, stack, list, concatenation, amortization
1	Ravindra K. Ahuja, James B. Orlin, Clifford Stein, Robert Endre Tarjan	Improved Algorithms for Bipartite Network Flow.	SIAM J. Comput.	1994	DBLP DOI BibTeX RDF
1	Rajamani Sundar, Robert Endre Tarjan	Unique Binary-Search-Tree Representations and Equality Testing of Sets and Sequences.	SIAM J. Comput.	1994	DBLP DOI BibTeX RDF
1	Martin Dietzfelbinger, Anna R. Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, Robert Endre Tarjan	Dynamic Perfect Hashing: Upper and Lower Bounds.	SIAM J. Comput.	1994	DBLP DOI BibTeX RDF
1	Brandon Dixon, Robert Endre Tarjan	Optimal Parallel Verification of Minimum Spanning Trees in Logarithmic Time.	Canada-France Conference on Parallel and Distributed Computing	1994	DBLP DOI BibTeX RDF
1	Susan E. Dorward, Lesley R. Matheson, Robert Endre Tarjan	Unstructured Multigrid Strategies on Massively Parallel Computers: A Case for Integrated Design.	HICSS	1994	DBLP BibTeX RDF
1	Haim Kaplan, Ron Shamir, Robert Endre Tarjan	Tractability of parameterized completion problems on chordal and interval graphs: Minimum Fill-in and Physical Mapping	FOCS	1994	DBLP DOI BibTeX RDF	added edges, parameterized completion problems, minimum fill-in, NP-Hard graph completion problem, interval graphs, parameterized complexity, tractability, vertex coloring, physical mapping
1	Philip N. Klein, Robert Endre Tarjan	A randomized linear-time algorithm for finding minimum spanning trees.	STOC	1994	DBLP DOI BibTeX RDF
1	David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery Westbrook, Moti Yung	Corrigendum: Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph.	J. Algorithms	1993	DBLP BibTeX RDF
1	Heather Booth, Robert Endre Tarjan	Finding the Minimum-Cost Maximum Flow in a Series-Parallel Network.	J. Algorithms	1993	DBLP DOI BibTeX RDF
1	Jiazhen Cai, Xiaofeng Han, Robert Endre Tarjan	An O(m log n)-Time Algorithm for the Maximal Planar Subgraph Problem.	SIAM J. Comput.	1993	DBLP DOI BibTeX RDF
1	Adam L. Buchsbaum, Robert Endre Tarjan	Confluently Persistent Deques via Data Structural Bootstrapping.	SODA	1993	DBLP DOI BibTeX RDF
1	Jiazhen Cai, Robert Paige, Robert Endre Tarjan	More Efficient Bottom-Up Multi-Pattern Matching in Trees.	Theor. Comput. Sci.	1992	DBLP DOI BibTeX RDF
1	Bhubaneswar Mishra, Robert Endre Tarjan	A Linear-Time Algorithm for Finding an Ambitus.	Algorithmica	1992	DBLP DOI BibTeX RDF

Publications of "Robert Endre Tarjan" ( http://dblp.L3S.de/Authors/Robert_Endre_Tarjan )