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