Daniel J. Rosenkrantz

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2011
114Effects of Opposition on the Diffusion of Complex Contagions in Social Networks: An Empirical Study. Chris J. Kuhlman, V. S. Anil Kumar, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz. SBP 2011, 188-196. Web SearchBibTeXDownload
113Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems. Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns. Theor. Comput. Sci. (412): 3932-3946 (2011). Web SearchBibTeXDownload
2010
112Finding Critical Nodes for Inhibiting Diffusion of Complex Contagions in Social Networks. Chris J. Kuhlman, V. S. Anil Kumar, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz. ECML/PKDD (2) 2010, 111-127. Web SearchBibTeXDownload
2009
111Segmentation of Time Series Data. Parvathi Chundi, Daniel J. Rosenkrantz. Encyclopedia of Data Warehousing and Mining 2009, 1753-1758. Web SearchBibTeXDownload
110Resilience Metrics for Service-Oriented Networks: A Service Allocation Approach. Daniel J. Rosenkrantz, Sanjay Goel, S. S. Ravi, Jagdish Gangolly. IEEE T. Services Computing (2): 183-196 (2009). Web SearchBibTeXDownload
2008
109A Transformation--Based Approach for the Design of Parallel/Distributed Scientific Software: the FFT. Harry B. Hunt III, Lenore R. Mullin, Daniel J. Rosenkrantz, James E. Raynolds. CoRR (abs/0811.2535) (2008). Web SearchBibTeXDownload
108Efficient algorithms for segmentation of item-set time series. Parvathi Chundi, Daniel J. Rosenkrantz. Data Min. Knowl. Discov. (17): 377-401 (2008). Web SearchBibTeXDownload
107A segmentation-based approach for temporal analysis of software version repositories. Harvey P. Siy, Parvathi Chundi, Daniel J. Rosenkrantz, Mahadevan Subramaniam. Journal of Software Maintenance (20): 199-222 (2008). Web SearchBibTeXDownload
106Errata for the paper "Predecessor existence problems for finite discrete dynamical systems" [TCS 386 (1-2) (2007) 3-37]. Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Mayur Thakur. Theor. Comput. Sci. (395): 132-133 (2008). Web SearchBibTeXDownload
2007
105Discovering Dynamic Developer Relationships from Software Version Histories by Time Series Segmentation. Harvey P. Siy, Parvathi Chundi, Daniel J. Rosenkrantz, Mahadevan Subramaniam. ICSM 2007, 415-424. Web SearchBibTeXDownload
104Computational Aspects of Analyzing Social Network Dynamics. Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Mayur Thakur. IJCAI 2007, 2268-2273. Web SearchBibTeXDownload
103Predecessor existence problems for finite discrete dynamical systems. Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Mayur Thakur. Theor. Comput. Sci. (386): 3-37 (2007). Web SearchBibTeXDownload
2006
102On minimizing materializations of array-valued temporaries. Daniel J. Rosenkrantz, Lenore M. R. Mullin, Harry B. Hunt III. ACM Trans. Program. Lang. Syst. (28): 1145-1177 (2006). Web SearchBibTeXDownload
101Information Preserving Time Decompositions of Time Stamped Documents*. Parvathi Chundi, Daniel J. Rosenkrantz. Data Min. Knowl. Discov. (13): 41-65 (2006). Web SearchBibTeXDownload
100Complexity of reachability problems for finite discrete dynamical systems. Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns. J. Comput. Syst. Sci. (72): 1317-1345 (2006). Web SearchBibTeXDownload
99Obtaining online approximation algorithms for facility dispersion from offline algorithms. Daniel J. Rosenkrantz, Giri Kumar Tayi, S. S. Ravi. Networks (47): 206-217 (2006). Web SearchBibTeXDownload
2005
98Efficient Algorithms for Constructing Time Decompositions of Time Stamped Documents. Parvathi Chundi, Rui Zhang, Daniel J. Rosenkrantz. DEXA 2005, 514-523. Cited by 4Web SearchBibTeXDownload
97Structure-Based Resilience Metrics for Service-Oriented Networks. Daniel J. Rosenkrantz, Sanjay Goel, S. S. Ravi, Jagdish Gangolly. EDCC 2005, 345-362. Web SearchBibTeXDownload
96In memory of Seymour Ginsburg 1928 - 2004. Serge Abiteboul, Richard Hull, Victor Vianu, Sheila A. Greibach, Michael A. Harrison, Ellis Horowitz, Daniel J. Rosenkrantz, Jeffrey D. Ullman, Moshe Y. Vardi. SIGMOD Record (34): 5-12 (2005). Web SearchBibTeXDownload
2004
95On lossy time decompositions of time stamped documents. Parvathi Chundi, Daniel J. Rosenkrantz. CIKM 2004, 437-445. Web SearchBibTeXDownload
94Local base station assignment with time intervals in mobile computing environments. Giri Kumar Tayi, Daniel J. Rosenkrantz, S. S. Ravi. European Journal of Operational Research (157): 267-285 (2004). Web SearchBibTeXDownload
93Constructing Time Decompositions for Analyzing Time-Stamped Documents. Parvathi Chundi, Daniel J. Rosenkrantz. SDM 2004. Web SearchBibTeXDownload
2003
92Predecessor and Permutation Existence Problems for Sequential Dynamical Systems. Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns. DMCS 2003, 69-80. Web SearchBibTeXDownload
91JACM 1986-1990. Daniel J. Rosenkrantz. J. ACM (50): 18 (2003). Web SearchBibTeXDownload
90Reachability problems for sequential dynamical systems with threshold functions. Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns. Theor. Comput. Sci. (295): 41-64 (2003). Web SearchBibTeXDownload
2002
89Parallel Approximation Schemes for a Class of Planar and Near Planar Combinatorial Optimization Problems. Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns. Inf. Comput. (173): 40-63 (2002). Web SearchBibTeXDownload
2001
88Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems. R. Ravi, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III. Algorithmica (31): 58-78 (2001). Web SearchBibTeXDownload
87Efficient Construction of Minimum Makespan Schedules for Tasks with a Fixed Number of Distinct Execution Times. Daniel J. Rosenkrantz, Lin Yu, S. S. Ravi. Algorithmica (30): 83-100 (2001). Web SearchBibTeXDownload
86Gardens of Eden and Fixed Points in Sequential Dynamical Systems. Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Predrag T. Tosic. DM-CCG 2001, 95-110. Web SearchBibTeXDownload
85Analysis Problems for Sequential Dynamical Systems and Communicating State Machines. Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns. MFCS 2001, 159-172. Web SearchBibTeXDownload
84Reminiscences on Influential Papers. Kenneth A. Ross, Amr El Abbadi, Sophie Cluet, Kaladhar Voruganti, Guy M. Lohman, Moshe Y. Vardi, Gultekin Özsoyoglu, Gerhard Weikum, Philip S. Yu, Timos K. Sellis, Patrick Valduriez. SIGMOD Record (30): 90-91 (2001). Web SearchBibTeXDownload
2000
83Algorithms for Path-Based Placement of Inspection Stations on Networks. Daniel J. Rosenkrantz, Giri Kumar Tayi, S. S. Ravi. INFORMS Journal on Computing (12): 136-149 (2000). Web SearchBibTeXDownload
82Facility Dispersion Problems Under Capacity and Cost Constraints. Daniel J. Rosenkrantz, Giri Kumar Tayi, S. S. Ravi. J. Comb. Optim. (4): 7-33 (2000). Web SearchBibTeXDownload
81On Materializations of Array-Valued Temporaries. Daniel J. Rosenkrantz, Lenore M. R. Mullin, Harry B. Hunt III. LCPC 2000, 127-141. Web SearchBibTeXDownload
80Alarm placement in systems with fault propagation. K. B. Lakshmanan, Daniel J. Rosenkrantz, S. S. Ravi. Theor. Comput. Sci. (243): 269-288 (2000). Web SearchBibTeXDownload
1999
79Using Data Flow Information to Obtain Efficient Check Sets for Algorithm-Based Fault Tolerance. Ragini Narasimhan, Daniel J. Rosenkrantz, S. S. Ravi. International Journal of Parallel Programming (27): 289-323 (1999). Web SearchBibTeXDownload
78Path problems in networks with vector-valued edge weights. Giri Kumar Tayi, Daniel J. Rosenkrantz, S. S. Ravi. Networks (34): 19-35 (1999). Web SearchBibTeXDownload
1998
77Theory of Periodically Specified Problems: Complexity and Approximability. Madhav V. Marathe, Harry B. Hunt III, Daniel J. Rosenkrantz, Richard Edwin Stearns. IEEE Conference on Computational Complexity 1998, 106. Web SearchBibTeXDownload
76NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs. Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns. J. Algorithms (26): 238-274 (1998). Web SearchBibTeXDownload
75Bicriteria Network Design Problems. Madhav V. Marathe, R. Ravi, Ravi Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III. J. Algorithms (28): 142-171 (1998). Web SearchBibTeXDownload
1997
74Multi-site distributed database transactions utilizing deferred update. Parvathi Chundi, Daniel J. Rosenkrantz, S. S. Ravi. SAC 1997, 118-122. Web SearchBibTeXDownload
73Compact Location Problems. Venkatesh Radhakrishnan, Madhav V. Marathe, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz. Theor. Comput. Sci. (181): 379-404 (1997). Web SearchBibTeXDownload
1996
72HORNSAT, Model Checking, Verification and games (Extended Abstract). Sandeep K. Shukla, Harry B. Hunt III, Daniel J. Rosenkrantz. CAV 1996, 99-110. Web SearchBibTeXDownload
71On the Complexity of Relational Problems for Finite State Processes (Extended Abstract). Sandeep K. Shukla, Harry B. Hunt III, Daniel J. Rosenkrantz, Richard Edwin Stearns. ICALP 1996, 466-477. Web SearchBibTeXDownload
70Deferred Updates and Data Placement in Distributed Databases. Parvathi Chundi, Daniel J. Rosenkrantz, S. S. Ravi. ICDE 1996, 469-476. Web SearchBibTeXDownload
69I/O Automata Based Verification of Finite State Distributed Systems: Complexity Issues (Abstract). Sandeep K. Shukla, Harry B. Hunt III, Daniel J. Rosenkrantz, S. S. Ravi, Richard Edwin Stearns. PODC 1996, 122. Web SearchBibTeX
68Spanning Trees - Short or Small. R. Ravi, Ravi Sundaram, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi. SIAM J. Discrete Math. (9): 178-200 (1996). Web SearchBibTeXDownload
1995
67Bicriteria Network Design Problems. Madhav V. Marathe, R. Ravi, Ravi Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III. ICALP 1995, 487-498. Web SearchBibTeXDownload
66Active Client Primary-Backup Protocols (Abstract). Parvathi Chundi, Ragini Narasimhan, Daniel J. Rosenkrantz, S. S. Ravi. PODC 1995, 264. Web SearchBibTeX
65On the Size of Binary Decision Diagrams Representing Boolean Functions. Yuri Breitbart, Harry B. Hunt III, Daniel J. Rosenkrantz. Theor. Comput. Sci. (145): 45-69 (1995). Web SearchBibTeXDownload
1994
64A Linear-Time Scheme for Version Reconstruction. Lin Yu, Daniel J. Rosenkrantz. ACM Trans. Program. Lang. Syst. (16): 775-797 (1994). Web SearchBibTeXDownload
63A Unified Approach to Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs. Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns. ESA 1994, 424-435. Web SearchBibTeXDownload
62Approximation Schemes Using L-Reductions. Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns. FSTTCS 1994, 342-353. Web SearchBibTeXDownload
61Construction of Check Sets for Algorithm-Based Fault Tolerance. Dechang Gu, Daniel J. Rosenkrantz, S. S. Ravi. IEEE Trans. Computers (43): 641-650 (1994). Web SearchBibTeXDownload
60Partitioning Message Patterns for Bundled Omega Networks. Philip J. Bernhard, Daniel J. Rosenkrantz. IEEE Trans. Parallel Distrib. Syst. (5): 353-363 (1994). Web SearchBibTeXDownload
59Spanning Trees Short or Small. R. Ravi, Ravi Sundaram, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi. SODA 1994, 546-555. Web SearchBibTeXDownload
1993
58Compact Location Problems. Venkatesh Radhakrishnan, Madhav V. Marathe, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz. FSTTCS 1993, 238-247. Web SearchBibTeXDownload
57Exploiting Data Flow Information in Algorithm-Based Fault Tolerance. Ragini Shamsunder, Daniel J. Rosenkrantz, S. S. Ravi. FTCS 1993, 280-289. Web SearchBibTeXDownload
56Improved Bounds for Algorithm-Based Fault Tolerance. Daniel J. Rosenkrantz, S. S. Ravi. IEEE Trans. Computers (42): 630-635 (1993). Web SearchBibTeXDownload
55Ancestor Controlled Submodule Inclusion in Design Databases. Lin Yu, Daniel J. Rosenkrantz. IEEE Trans. Knowl. Data Eng. (5): 352-362 (1993). Web SearchBibTeXDownload
54Determining Performance Measures of Algorithm-Based Fault Tolerant Systems. Dechang Gu, Daniel J. Rosenkrantz, S. S. Ravi. J. Parallel Distrib. Comput. (18): 56-70 (1993). Web SearchBibTeXDownload
53The Complexity of Processing Hierarchical Specifications. Daniel J. Rosenkrantz, Harry B. Hunt III. SIAM J. Comput. (22): 627-649 (1993). Web SearchBibTeXDownload
52Many birds with one stone: multi-objective approximation algorithms. R. Ravi, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III. STOC 1993, 438-447. Web SearchBibTeXDownload
1992
51Representability of Design Objects by Ancestor-Controlled Hierarchical Specifications. Lin Yu, Daniel J. Rosenkrantz. SIAM J. Comput. (21): 824-855 (1992). Web SearchBibTeXDownload
50The Complexity of STructural Containment and Equivalence. Daniel J. Rosenkrantz, Harry B. Hunt III. Theoretical Studies in Computer Science 1992, 101-132. Web SearchBibTeX
1991
49Sufficient-Completeness, Ground-Reducibility and their Complexity. Deepak Kapur, Paliath Narendran, Daniel J. Rosenkrantz, Hantao Zhang. Acta Inf. (28): 311-350 (1991). Web SearchBibTeXDownload
48Construction and Analysis of Fault-Secure Multiprocessor Schedules. Dechang Gu, Daniel J. Rosenkrantz, S. S. Ravi. FTCS 1991, 120-127. Web SearchBibTeXDownload
47Using the Dual Path Property of Omega Networks to Obtain Conflict-Free Message Routing. Philip J. Bernhard, Daniel J. Rosenkrantz. IEEE Trans. Parallel Distrib. Syst. (2): 503-507 (1991). Web SearchBibTeXDownload
46An Efficient Method for Representing and Transmitting Message Patterns on Multiprocessor Interconnection Networks. Philip J. Bernhard, Daniel J. Rosenkrantz. J. Parallel Distrib. Comput. (11): 72-85 (1991). Web SearchBibTeXDownload
45Compaction of Message Patterns into Succinct Representations for Multiprocessor Interconnection Networks. Philip J. Bernhard, Harry B. Hunt III, Daniel J. Rosenkrantz. J. Parallel Distrib. Comput. (12): 39-49 (1991). Web SearchBibTeXDownload
44Facility Dispersion Problems: Heuristics and Special Cases (Extended Abstract). S. S. Ravi, Daniel J. Rosenkrantz, Giri Kumar Tayi. WADS 1991, 355-366. Web SearchBibTeXDownload
43A Linear-Time Scheme for Version Reconstruction (Extended Abstract). Lin Yu, Daniel J. Rosenkrantz. WADS 1991, 141-152. Web SearchBibTeXDownload
1990
42Design and analysis of test schemes for algorithm-based fault tolerance. Dechang Gu, Daniel J. Rosenkrantz, S. S. Ravi. FTCS 1990, 106-113. Web SearchBibTeXDownload
41Half-Hot State Assignments for Finite State Machines. Daniel J. Rosenkrantz. IEEE Trans. Computers (39): 700-702 (1990). Web SearchBibTeXDownload
40Representability of Design Objects by Ancestor-Controlled Hierarchical Specifications. Lin Yu, Daniel J. Rosenkrantz. PODS 1990, 28-39. Web SearchBibTeX
1989
39Minimizing Time-Space Cost for Database Version Control. Lin Yu, Daniel J. Rosenkrantz. Acta Inf. (27): 627-663 (1989). Web SearchBibTeXDownload
38Compaction of Message Patterns into Space-Efficient Representations for Multiprocessor Interconnection Networks. Philip J. Bernhard, Harry B. Hunt III, Daniel J. Rosenkrantz. ICPP (1) 1989, 111-115. Web SearchBibTeX
37The Complexity of Generating Minimum Test Sets for PLA's and Monotone Combinational Circuits. Sreejit Chakravarty, Harry B. Hunt III, S. S. Ravi, Daniel J. Rosenkrantz. IEEE Trans. Computers (38): 865-869 (1989). Web SearchBibTeXDownload
1988
36Matrix Multiplication for Finite Algebraic Systems. Daniel J. Rosenkrantz, Harry B. Hunt III. Inf. Process. Lett. (28): 189-192 (1988). Web SearchBibTeXDownload
35Minimizing Time-Space Cost For Database Version Control. Lin Yu, Daniel J. Rosenkrantz. PODS 1988, 294-301. Web SearchBibTeX
1987
34Efficient Algorithms for Automatic Construction and Compactification of Parsing Grammars. Daniel J. Rosenkrantz, Harry B. Hunt III. ACM Trans. Program. Lang. Syst. (9): 543-566 (1987). Web SearchBibTeXDownload
33On the Computational Complexity of Algebra on Lattices. Harry B. Hunt III, Daniel J. Rosenkrantz, Peter A. Bloniarz. SIAM J. Comput. (16): 129-148 (1987). Web SearchBibTeXDownload
1986
32Recursion Schemes and Recursive Programs are Exponentially Hard to Analyze. Harry B. Hunt III, Daniel J. Rosenkrantz. SIAM J. Comput. (15): 831-850 (1986). Web SearchBibTeXDownload
1985
31Testing for Grammatical Coverings. Daniel J. Rosenkrantz, Harry B. Hunt III. Theor. Comput. Sci. (38): 323-341 (1985). Web SearchBibTeXDownload
1984
30Algebraic Structures with Hard Equivalence and Minimization Problems. Peter A. Bloniarz, Harry B. Hunt III, Daniel J. Rosenkrantz. J. ACM (31): 879-904 (1984). Web SearchBibTeXDownload
29The Complexity of Monadic Recursion Schemes: Exponential Time Bounds. Harry B. Hunt III, Daniel J. Rosenkrantz. J. Comput. Syst. Sci. (28): 395-419 (1984). Web SearchBibTeXDownload
28Consistency and Serializability in Concurrent Database Systems. Daniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis II. SIAM J. Comput. (13): 508-530 (1984). Web SearchBibTeXDownload
1983
27The Complexity of Monadic Recursion Schemes: Executability Problems, Nesting Depth, and Applications. Harry B. Hunt III, Daniel J. Rosenkrantz. Theor. Comput. Sci. (27): 3-38 (1983). Web SearchBibTeXDownload
1981
26Distributed Database Concurrency Controls Using Before-Values. Richard Edwin Stearns, Daniel J. Rosenkrantz. SIGMOD Conference 1981, 74-83. Web SearchBibTeX
1980
25The Complexity of Recursion Schemes and Recursive Programming Languages (Extended Abstract). Harry B. Hunt III, Daniel J. Rosenkrantz. FOCS 1980, 152-160. Web SearchBibTeXDownload
24Efficient Algorithms for Structural Similarity of Grammars. Harry B. Hunt III, Daniel J. Rosenkrantz. POPL 1980, 213-219. Web SearchBibTeXDownload
23Processing Conjunctive Predicates and Queries. Daniel J. Rosenkrantz, Harry B. Hunt III. VLDB 1980, 64-72. Web SearchBibTeX
1979
22The Complexity of Testing Predicate Locks. Harry B. Hunt III, Daniel J. Rosenkrantz. SIGMOD Conference 1979, 127-133. Web SearchBibTeX
1978
21System Level Concurrency Control for Distributed Database Systems. Daniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis II. ACM Trans. Database Syst. (3): 178-198 (1978). Web SearchBibTeXDownload
20Polynomial Algorithms for Deterministic Pushdown Automata. Daniel J. Rosenkrantz, Harry B. Hunt III. SIAM J. Comput. (7): 405-412 (1978). Web SearchBibTeXDownload
19Computational Parallels Between the Regular and Context-Free Languages. Harry B. Hunt III, Daniel J. Rosenkrantz. SIAM J. Comput. (7): 99-114 (1978). Web SearchBibTeXDownload
18Dynamic Database Dumping. Daniel J. Rosenkrantz. SIGMOD Conference 1978, 3-8. Web SearchBibTeX
1977
17A System Level Concurrency Control for Distributed Database Systems. Daniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis II. Berkeley Workshop 1977, 132-145. Web SearchBibTeX
16On Equivalence and Containment Problems for Formal Languages. Harry B. Hunt III, Daniel J. Rosenkrantz. J. ACM (24): 387-396 (1977). Web SearchBibTeXDownload
15An Analysis of Several Heuristics for the Traveling Salesman Problem. Daniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis II. SIAM J. Comput. (6): 563-581 (1977). Web SearchBibTeXDownload
1976
14Concurrency Control for Database Systems. Richard Edwin Stearns, Philip M. Lewis II, Daniel J. Rosenkrantz. FOCS 1976, 19-32. Web SearchBibTeXDownload
13On the Equivalence, Containment, and Covering Problems for the Regular and Context-Free Languages. Harry B. Hunt III, Daniel J. Rosenkrantz, Thomas G. Szymanski. J. Comput. Syst. Sci. (12): 222-268 (1976). Web SearchBibTeXDownload
12The Covering Problem for Linear Context-Free Grammars. Harry B. Hunt III, Daniel J. Rosenkrantz, Thomas G. Szymanski. Theor. Comput. Sci. (2): 361-382 (1976). Web SearchBibTeXDownload
1974
11Attributed Translations. Philip M. Lewis II, Daniel J. Rosenkrantz, Richard Edwin Stearns. J. Comput. Syst. Sci. (9): 279-307 (1974). Web SearchBibTeXDownload
10Computational Parallels between the Regular and Context-Free Languages. Harry B. Hunt III, Daniel J. Rosenkrantz. STOC 1974, 64-74. Web SearchBibTeXDownload
9Approximate Algorithms for the Traveling Salesperson Problem. Daniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis II. SWAT (FOCS) 1974, 33-42. Web SearchBibTeXDownload
1973
8Attributed Translations. Philip M. Lewis II, Daniel J. Rosenkrantz, Richard Edwin Stearns. STOC 1973, 160-171. Web SearchBibTeXDownload
1970
7Properties of Deterministic Top-Down Grammars. Daniel J. Rosenkrantz, Richard Edwin Stearns. Information and Control (17): 226-256 (1970). Web SearchBibTeXDownload
6Deterministic Left Corner Parsing (Extended Abstract). Daniel J. Rosenkrantz, Philip M. Lewis II. SWAT (FOCS) 1970, 139-152. Web SearchBibTeXDownload
1969
5Programmed Grammars and Classes of Formal Languages. Daniel J. Rosenkrantz. J. ACM (16): 107-131 (1969). Web SearchBibTeXDownload
4Properties of Deterministic Top Down Grammars. Daniel J. Rosenkrantz, Richard Edwin Stearns. STOC 1969, 165-180. Web SearchBibTeXDownload
3Table Machine Simulation. Richard Edwin Stearns, Daniel J. Rosenkrantz. SWAT (FOCS) 1969, 118-128. Web SearchBibTeXDownload
1967
2Matrix Equations and Normal Forms for Context-Free Grammars. Daniel J. Rosenkrantz. J. ACM (14): 501-507 (1967). Web SearchBibTeXDownload
1Programmed Grammars: A New Device for Generating Formal Languages. Daniel J. Rosenkrantz. SWAT (FOCS) 1967, 14-20. Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research