Which author has a higher twoYearMeanCitedness, Tajana Rosing or Robert E. Tarjan?
Tajana Rosing
Robert E. Tarjan is the author of Wojciech Fraczak et al.: Corrections to "Finding Dominators via disjoint set union" (J. Discrete Algorithms 23 (2013) 2-20). Bernhard Haeupler et al.: Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance. (2012) authored by Robert E. Tarjan. Andrew V. Goldberg et al.: Minimum-C Robert E. Tarjan is the author of Ashish Goel et al.: Disjoint Set Union with Randomized Linking. (1998) and Michael A. Bender et al.: A New Approach to Incremental Cycle Detection and Related Problems. (2016). Robert E. Tarjan is the author of the book "An Auction Algorithm for Bipartite Matching in Streaming and Massively Parallel Computation Models.". (1991). Kamalika Chaudhuri et al.: Server Allocation Algorithms for Tiered Systems. (2007) authored by Robert E. Tarjan. authored by Robert E. Tarjan. Kamalika Chaudhuri et al.: Server Allocation Algorithms for Tiered Systems. (2005) authored by Robert E. Tarjan. M. R. Garey et al.: Scheduling Unit-Time Tasks with Arbitrary Release Times and Deadlines. (2011) authored by Robert E. Tarjan. Robert E. Tarjan is the author of the book "Linear Time Algorithms for Visibility and Shortest Path Problems Inside Triangulated Simple Polygons.". (1987) and "Bill G. Horne et al.: Dynamic Self-Checking Techniques for Improved Tamper Resistance". (2001) authored by Robert E. Tarjan. Robert E. Tarjan is the author of:'<unk>. S. D. D. The Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas'. (2001). <extra_id_0>:<unk>nFor seminal advances in the design and analysis of data structures and algorithms. He was the first to prove the optimal runtime involving the inverse Ackermann function. In April 2013 he joined Microsoft Research Silicon Valley in addition to the position at Princeton.
[INST]
Utilize the provided context information, to generate answers to the following question: 
- Generate the answer to the question based on the provided context.
- Avoid including any explanations or apologies in your responses.
- Only respond to questions that ask for the answer to the target question without any additional information.
- Strictly provide the answer without any additional text.
Question: Which author has a higher twoYearMeanCitedness, Tajana Rosing or Robert E. Tarjan?
Context: Robert E. Tarjan is the author of Wojciech Fraczak et al.: Corrections to "Finding Dominators via disjoint set union" (J. Discrete Algorithms 23 (2013) 2-20). Bernhard Haeupler et al.: Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance. (2012) authored by Robert E. Tarjan. Andrew V. Goldberg et al.: Minimum-C Robert E. Tarjan is the author of Ashish Goel et al.: Disjoint Set Union with Randomized Linking. (1998) and Michael A. Bender et al.: A New Approach to Incremental Cycle Detection and Related Problems. (2016). Robert E. Tarjan is the author of the book "An Auction Algorithm for Bipartite Matching in Streaming and Massively Parallel Computation Models.". (1991). Kamalika Chaudhuri et al.: Server Allocation Algorithms for Tiered Systems. (2007) authored by Robert E. Tarjan. authored by Robert E. Tarjan. Kamalika Chaudhuri et al.: Server Allocation Algorithms for Tiered Systems. (2005) authored by Robert E. Tarjan. M. R. Garey et al.: Scheduling Unit-Time Tasks with Arbitrary Release Times and Deadlines. (2011) authored by Robert E. Tarjan. Robert E. Tarjan is the author of the book "Linear Time Algorithms for Visibility and Shortest Path Problems Inside Triangulated Simple Polygons.". (1987) and "Bill G. Horne et al.: Dynamic Self-Checking Techniques for Improved Tamper Resistance". (2001) authored by Robert E. Tarjan. Robert E. Tarjan is the author of:'<unk>. S. D. D. The Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas'. (2001). <extra_id_0>:<unk>nFor seminal advances in the design and analysis of data structures and algorithms. He was the first to prove the optimal runtime involving the inverse Ackermann function. In April 2013 he joined Microsoft Research Silicon Valley in addition to the position at Princeton.
[/INST] Answer:
