default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel J. Rosenkrantz
Person information
- affiliation: State University at Albany, NY, USA
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j74]Daniel J. Rosenkrantz
, Madhav V. Marathe, S. S. Ravi, Richard Edwin Stearns:
Synchronous Dynamical Systems on Directed Acyclic Graphs: Complexity and Algorithms. ACM Trans. Comput. Theory 16(2): 11:1-11:34 (2024)- [c85]Zirou Qiu, Abhijin Adiga, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Anil Vullikanti:
Learning the Topology and Behavior of Discrete Dynamical Systems. AAAI 2024: 14722-14730 - [c84]Zirou Qiu, Abhijin Adiga, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Anil Kumar S. Vullikanti:
Efficient PAC Learnability of Dynamical Systems Over Multilayer Networks. ICML 2024 - [i10]Zirou Qiu, Abhijin Adiga, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Anil Vullikanti:
Learning the Topology and Behavior of Discrete Dynamical Systems. CoRR abs/2402.11686 (2024) - [i9]Zirou Qiu, Abhijin Adiga, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Anil Vullikanti:
Efficient PAC Learnability of Dynamical Systems Over Multilayer Networks. CoRR abs/2405.06884 (2024) - 2023
- [c83]Zirou Qiu, Chen Chen, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Anil Vullikanti:
Networked Anti-coordination Games Meet Graphical Dynamical Systems: Equilibria and Convergence. AAAI 2023: 11663-11671 - [c82]Yohai Trabelsi, Abhijin Adiga, Sarit Kraus, S. S. Ravi, Daniel J. Rosenkrantz:
Resource Sharing through Multi-Round Matchings. AAAI 2023: 11681-11690 - [c81]Zirou Qiu, Andrew Yuan, Chen Chen, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Anil Vullikanti:
Assigning Agents to Increase Network-Based Neighborhood Diversity. AAMAS 2023: 600-608 - [i8]Zirou Qiu, Andrew Yuan, Chen Chen, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Anil Vullikanti:
Assigning Agents to Increase Network-Based Neighborhood Diversity. CoRR abs/2301.02876 (2023) - [i7]Zirou Qiu, Chen Chen, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Anil Vullikanti:
Networked Anti-Coordination Games Meet Graphical Dynamical Systems: Equilibria and Convergence. CoRR abs/2301.02889 (2023) - [i6]Zirou Qiu, Chen Chen, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Anil Vullikanti:
Finding Nontrivial Minimum Fixed Points in Discrete Dynamical Systems. CoRR abs/2301.04090 (2023) - 2022
- [j73]Abhijin Adiga, Chris J. Kuhlman, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Using Active Queries to Infer Symmetric Node Functions of Graph Dynamical Systems. J. Mach. Learn. Res. 23: 251:1-251:43 (2022) - [j72]Henry L. Carscadden, Chris J. Kuhlman, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz:
Techniques for blocking the propagation of two simultaneous contagions over networks using a graph dynamical systems framework. Netw. Sci. 10(3): 234-260 (2022) - [j71]Daniel J. Rosenkrantz, Anil Vullikanti, S. S. Ravi, Richard Edwin Stearns, Simon A. Levin, H. Vincent Poor, Madhav V. Marathe:
Fundamental limitations on efficiently forecasting certain epidemic measures in network models. Proc. Natl. Acad. Sci. USA 119(4): e2109228119 (2022) - [c80]Zirou Qiu, Chen Chen, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Anil Vullikanti:
Finding Nontrivial Minimum Fixed Points in Discrete Dynamical Systems: Complexity, Special Case Algorithms and Heuristics. AAAI 2022: 9422-9430 - [c79]Daniel J. Rosenkrantz, Abhijin Adiga, Madhav V. Marathe, Zirou Qiu, S. S. Ravi, Richard Edwin Stearns, Anil Vullikanti:
Efficiently Learning the Topology and Behavior of a Networked Dynamical System Via Active Queries. ICML 2022: 18796-18808 - [i5]Yohai Trabelsi, Abhijin Adiga, Sarit Kraus, S. S. Ravi, Daniel J. Rosenkrantz:
Resource Sharing Through Multi-Round Matchings. CoRR abs/2211.17199 (2022) - 2021
- [c78]Daniel J. Rosenkrantz, Madhav V. Marathe, S. S. Ravi, Richard Edwin Stearns:
Synchronous Dynamical Systems on Directed Acyclic Graphs: Complexity and Algorithms. AAAI 2021: 11334-11342 - 2020
- [c77]Abhijin Adiga, Chris J. Kuhlman, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Anil Vullikanti:
Bounds and Complexity Results for Learning Coalition-Based Interaction Functions in Networked Social Systems. AAAI 2020: 3138-3145 - [c76]Henry L. Carscadden, Chris J. Kuhlman, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz:
Blocking the Propagation of Two Simultaneous Contagions over Networks. COMPLEX NETWORKS (1) 2020: 455-468 - [c75]Joshua D. Priest, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Evolution of Similar Configurations in Graph Dynamical Systems. COMPLEX NETWORKS (1) 2020: 544-555
2010 – 2019
- 2019
- [j70]Daniel J. Rosenkrantz, Madhav V. Marathe, S. S. Ravi, Richard Edwin Stearns:
Symmetry Properties of Nested Canalyzing Functions. Discret. Math. Theor. Comput. Sci. 21(4) (2019) - [c74]Abhijin Adiga, Samarth Swarup, Anil Vullikanti, Christopher L. Barrett, Stephen G. Eubank, Chris J. Kuhlman, Madhav V. Marathe, Henning S. Mortveit, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Validating Agent-Based Models of Large Networked Systems. WSC 2019: 2807-2818 - [i4]Daniel J. Rosenkrantz, Madhav V. Marathe, S. S. Ravi, Richard Edwin Stearns:
Symmetry Properties of Nested Canalyzing Functions. CoRR abs/1906.03752 (2019) - 2018
- [j69]Richard Edwin Stearns, Daniel J. Rosenkrantz, S. S. Ravi, Madhav V. Marathe:
A characterization of nested canalyzing functions with maximum average sensitivity. Discret. Appl. Math. 251: 5-14 (2018) - [c73]Abhijin Adiga, Chris J. Kuhlman, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Learning the Behavior of a Dynamical System Via a "20 Questions" Approach. AAAI 2018: 4630-4637 - [c72]Daniel J. Rosenkrantz, Madhav V. Marathe, S. S. Ravi, Richard Edwin Stearns:
Testing Phase Space Properties of Synchronous Dynamical Systems with Nested Canalyzing Local Functions. AAMAS 2018: 1585-1594 - [c71]Abhijin Adiga, Vanessa Cedeno-Mieles, Chris J. Kuhlman, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Inferring Probabilistic Contagion Models Over Networks Using Active Queries. CIKM 2018: 377-386 - [c70]Abhijin Adiga, Chris J. Kuhlman, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Using Active Queries to Learn Local Stochastic Behaviors in Social Networks. COMPLEX NETWORKS (2) 2018: 246-257 - [c69]Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Computational Aspects of Fault Location and Resilience Problems for Interdependent Infrastructure Networks. COMPLEX NETWORKS (1) 2018: 879-890 - [p2]S. S. Ravi, Daniel J. Rosenkrantz, Giri Kumar Tayi:
Approximation Algorithms for Facility Dispersion. Handbook of Approximation Algorithms and Metaheuristics (2) 2018 - 2017
- [j68]Abhijin Adiga, Chris J. Kuhlman, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Inferring local transition functions of discrete dynamical systems from observations of system behavior. Theor. Comput. Sci. 679: 126-144 (2017) - 2015
- [j67]Chris J. Kuhlman, V. S. Anil Kumar, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz:
Inhibiting diffusion of complex contagions in social networks: theoretical and experimental results. Data Min. Knowl. Discov. 29(2): 423-465 (2015) - [c68]Daniel J. Rosenkrantz, Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi, Richard Edwin Stearns:
Analysis Problems for Graphical Dynamical Systems: A Unified Approach Through Graph Predicates. AAMAS 2015: 1501-1509 - [c67]Abhijin Adiga, Chris J. Kuhlman, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Complexity of Inferring Local Transition Functions of Discrete Dynamical Systems. CIAA 2015: 21-34 - 2014
- [c66]Daniel J. Rosenkrantz, Madhav V. Marathe, Ravi Sundaram, Anil Vullikanti:
Bayesian Inference in Treewidth-Bounded Graphical Models Without Indegree Constraints. UAI 2014: 702-711 - 2013
- [c65]Daniel J. Rosenkrantz:
Matrix Equations and Normal Forms for Context-Free Grammars. Fundamental Problems in Computing 2013: 3-11 - [c64]Philip M. Lewis, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Attributed Translations. Fundamental Problems in Computing 2013: 13-43 - [c63]Daniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis:
An analysis of several heuristics for the traveling salesman problem. Fundamental Problems in Computing 2013: 45-69 - [c62]Daniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis:
System Level Concurrency Control for Distributed Database Systems. Fundamental Problems in Computing 2013: 71-98 - [c61]Daniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis:
Consistency and serializability in concurrent database systems. Fundamental Problems in Computing 2013: 99-132 - [c60]Philip J. Bernhard, Daniel J. Rosenkrantz:
An efficient method for representing and transmitting message patterns on multiprocessor interconnection networks. Fundamental Problems in Computing 2013: 133-162 - [c59]Lin Yu, Daniel J. Rosenkrantz:
Representability of Design Objects by Ancestor-Controlled Hierarchical Specifications. Fundamental Problems in Computing 2013: 163-208 - [c58]Daniel J. Rosenkrantz, Harry B. Hunt III:
The Complexity of Processing Hierarchical Specifications. Fundamental Problems in Computing 2013: 209-240 - [c57]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. Fundamental Problems in Computing 2013: 241-266 - [c56]Parvathi Chundi, Daniel J. Rosenkrantz:
Efficient Algorithms for Segmentation of Item-Set Time Series. Fundamental Problems in Computing 2013: 267-297 - 2011
- [j66]Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems. Theor. Comput. Sci. 412(30): 3932-3946 (2011) - [c55]Christopher James Kuhlman, V. S. Anil Kumar, Madhav V. Marathe, Samarth Swarup, Gaurav Tuli, S. S. Ravi, Daniel J. Rosenkrantz:
Inhibiting the Diffusion of Contagions in Bi-Threshold Systems: Analytical and Experimental Results. AAAI Fall Symposium: Complex Adaptive Systems 2011 - [c54]Chris J. Kuhlman, V. S. Anil Kumar, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz:
Effects of Opposition on the Diffusion of Complex Contagions in Social Networks: An Empirical Study. SBP 2011: 188-196 - [c53]Chris J. Kuhlman, V. S. Anil Kumar, Madhav V. Marathe, Henning S. Mortveit, Samarth Swarup, Gaurav Tuli, S. S. Ravi, Daniel J. Rosenkrantz:
A general-purpose graph dynamical system modeling framework. WSC 2011: 296-308 - 2010
- [c52]Chris J. Kuhlman, V. S. Anil Kumar, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz:
Finding Critical Nodes for Inhibiting Diffusion of Complex Contagions in Social Networks. ECML/PKDD (2) 2010: 111-127
2000 – 2009
- 2009
- [j65]Daniel J. Rosenkrantz, Sanjay Goel, S. S. Ravi, Jagdish Gangolly:
Resilience Metrics for Service-Oriented Networks: A Service Allocation Approach. IEEE Trans. Serv. Comput. 2(3): 183-196 (2009) - [r2]Parvathi Chundi, Daniel J. Rosenkrantz:
Segmentation of Time Series Data. Encyclopedia of Data Warehousing and Mining 2009: 1753-1758 - 2008
- [j64]Parvathi Chundi, Daniel J. Rosenkrantz:
Efficient algorithms for segmentation of item-set time series. Data Min. Knowl. Discov. 17(3): 377-401 (2008) - [j63]Harvey P. Siy, Parvathi Chundi, Daniel J. Rosenkrantz, Mahadevan Subramaniam:
A segmentation-based approach for temporal analysis of software version repositories. J. Softw. Maintenance Res. Pract. 20(3): 199-222 (2008) - [j62]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) - [i3]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) - 2007
- [j61]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) - [c51]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 - [c50]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 - [r1]Daniel J. Rosenkrantz, S. S. Ravi, Giri Kumar Tayi:
Approximation Algorithms for Facility Dispersion. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j60]Parvathi Chundi, Daniel J. Rosenkrantz:
Information Preserving Time Decompositions of Time Stamped Documents*. Data Min. Knowl. Discov. 13(1): 41-65 (2006) - [j59]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) - [j58]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) - [j57]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) - [p1]Harry B. Hunt III, Madhav V. Marathe, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Towards a Predictive Computational Complexity Theory. Computational Complexity and Statistical Physics 2006: 285- - 2005
- [j56]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 Rec. 34(1): 5-12 (2005) - [c49]Parvathi Chundi, Rui Zhang, Daniel J. Rosenkrantz:
Efficient Algorithms for Constructing Time Decompositions of Time Stamped Documents. DEXA 2005: 514-523 - [c48]Daniel J. Rosenkrantz, Sanjay Goel, S. S. Ravi, Jagdish Gangolly:
Structure-Based Resilience Metrics for Service-Oriented Networks. EDCC 2005: 345-362 - 2004
- [j55]Giri Kumar Tayi, Daniel J. Rosenkrantz, S. S. Ravi:
Local base station assignment with time intervals in mobile computing environments. Eur. J. Oper. Res. 157(2): 267-285 (2004) - [c47]Parvathi Chundi, Daniel J. Rosenkrantz:
On lossy time decompositions of time stamped documents. CIKM 2004: 437-445 - [c46]Parvathi Chundi, Daniel J. Rosenkrantz:
Constructing Time Decompositions for Analyzing Time-Stamped Documents. SDM 2004: 57-68 - 2003
- [j54]Daniel J. Rosenkrantz:
JACM 1986-1990. J. ACM 50(1): 18 (2003) - [j53]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) - [c45]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 - 2002
- [j52]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
- [j51]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) - [j50]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) - [j49]Kenneth A. Ross, Jiawei Han, Nick Koudas, Rajeev Rastogi, Daniel J. Rosenkrantz, Peter Scheuermann, Dan Suciu:
Reminiscences on Influential Papers. SIGMOD Rec. 30(3): 101-104 (2001) - [c44]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 - [c43]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 - 2000
- [j48]Daniel J. Rosenkrantz, Giri Kumar Tayi, S. S. Ravi:
Algorithms for Path-Based Placement of Inspection Stations on Networks. INFORMS J. Comput. 12(2): 136-149 (2000) - [j47]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) - [j46]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) - [c42]Daniel J. Rosenkrantz, Lenore M. R. Mullin, Harry B. Hunt III:
On Materializations of Array-Valued Temporaries. LCPC 2000: 127-141
1990 – 1999
- 1999
- [j45]Ragini Narasimhan, Daniel J. Rosenkrantz, S. S. Ravi:
Using Data Flow Information to Obtain Efficient Check Sets for Algorithm-Based Fault Tolerance. Int. J. Parallel Program. 27(4): 289-323 (1999) - [j44]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
- [j43]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) - [j42]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) - [c41]Madhav V. Marathe, Harry B. Hunt III, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Theory of Periodically Specified Problems: Complexity and Approximability. CCC 1998: 106- - [i2]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) - 1997
- [j41]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) - [c40]Parvathi Chundi, Daniel J. Rosenkrantz, S. S. Ravi:
Multi-site distributed database transactions utilizing deferred update. SAC 1997: 118-122 - 1996
- [j40]R. Ravi, Ravi Sundaram, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi:
Spanning Trees - Short or Small. SIAM J. Discret. Math. 9(2): 178-200 (1996) - [c39]Sandeep K. Shukla, Harry B. Hunt III, Daniel J. Rosenkrantz:
HORNSAT, Model Checking, Verification and games (Extended Abstract). CAV 1996: 99-110 - [c38]Sandeep K. Shukla, Daniel J. Rosenkrantz, S. S. Ravi:
A simulation and validation tool for self-stabilizing protocols. The Spin Verification System 1996: 153-164 - [c37]Sandeep K. Shukla, Daniel J. Rosenkrantz, Harry B. Hunt III, Richard Edwin Stearns:
The polynomial time decidability of simulation relations for finite processes: A HORNSAT based approach. Satisfiability Problem: Theory and Applications 1996: 603-641 - [c36]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 - [c35]Parvathi Chundi, Daniel J. Rosenkrantz, S. S. Ravi:
Deferred Updates and Data Placement in Distributed Databases. ICDE 1996: 469-476 - [c34]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 - 1995
- [j39]Madhav V. Marathe, Heinz Breu, Harry B. Hunt III, S. S. Ravi, Daniel J. Rosenkrantz:
Simple heuristics for unit disk graphs. Networks 25(2): 59-68 (1995) - [j38]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) - [c33]Ragini Narasimhan, Daniel J. Rosenkrantz, S. S. Ravi:
Efficient algorithms for analyzing and synthesizing fault-tolerant datapaths. DFT 1995: 81-89 - [c32]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 - [c31]Parvathi Chundi, Ragini Narasimhan, Daniel J. Rosenkrantz, S. S. Ravi:
Active Client Primary-Backup Protocols (Abstract). PODC 1995: 264 - 1994
- [j37]S. S. Ravi, Daniel J. Rosenkrantz, Giri Kumar Tayi:
Heuristic and Special Case Algorithms for Dispersion Problems. Oper. Res. 42(2): 299-310 (1994) - [j36]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) - [j35]Lin Yu, Daniel J. Rosenkrantz:
A Linear-Time Scheme for Version Reconstruction. ACM Trans. Program. Lang. Syst. 16(3): 775-797 (1994) - [j34]Philip J. Bernhard, Daniel J. Rosenkrantz:
Partitioning Message Patterns for Bundled Omega Networks. IEEE Trans. Parallel Distributed Syst. 5(4): 353-363 (1994) - [c30]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 - [c29]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 - [c28]Jeanette Bruno, Daniel J. Rosenkrantz:
Interactive control restructuring. SETA 1994: 36-53 - [c27]R. Ravi, Ravi Sundaram, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi:
Spanning Trees Short or Small. SODA 1994: 546-555 - [i1]Madhav V. Marathe, Heinz Breu, Harry B. Hunt III, S. S. Ravi, Daniel J. Rosenkrantz:
Geometry based heuristics for unit disk graphs. CoRR abs/math/9409226 (1994) - 1993
- [j33]Dechang Gu, Daniel J. Rosenkrantz, S. S. Ravi:
Determining Performance Measures of Algorithm-Based Fault Tolerant Systems. J. Parallel Distributed Comput. 18(1): 56-70 (1993) - [j32]Daniel J. Rosenkrantz, Harry B. Hunt III:
The Complexity of Processing Hierarchical Specifications. SIAM J. Comput. 22(3): 627-649 (1993) - [j31]Daniel J. Rosenkrantz, S. S. Ravi:
Improved Bounds for Algorithm-Based Fault Tolerance. IEEE Trans. Computers 42(5): 630-635 (1993) - [j30]Lin Yu, Daniel J. Rosenkrantz:
Ancestor Controlled Submodule Inclusion in Design Databases. IEEE Trans. Knowl. Data Eng. 5(2): 352-362 (1993) - [c26]Venkatesh Radhakrishnan, Sven Oliver Krumke, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi:
Compact Location Problems. FSTTCS 1993: 238-247 - [c25]Ragini Shamsunder, Daniel J. Rosenkrantz, S. S. Ravi:
Exploiting Data Flow Information in Algorithm-Based Fault Tolerance. FTCS 1993: 280-289 - [c24]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 - 1992
- [j29]Lin Yu, Daniel J. Rosenkrantz:
Representability of Design Objects by Ancestor-Controlled Hierarchical Specifications. SIAM J. Comput. 21(5): 824-855 (1992) - [c23]Daniel J. Rosenkrantz, Harry B. Hunt III:
The Complexity of STructural Containment and Equivalence. Theoretical Studies in Computer Science 1992: 101-132 - 1991
- [j28]Deepak Kapur, Paliath Narendran, Daniel J. Rosenkrantz, Hantao Zhang:
Sufficient-Completeness, Ground-Reducibility and their Complexity. Acta Informatica 28(4): 311-350 (1991) - [j27]Philip J. Bernhard, Daniel J. Rosenkrantz:
An Efficient Method for Representing and Transmitting Message Patterns on Multiprocessor Interconnection Networks. J. Parallel Distributed Comput. 11(1): 72-85 (1991) - [j26]Philip J. Bernhard, Harry B. Hunt III, Daniel J. Rosenkrantz:
Compaction of Message Patterns into Succinct Representations for Multiprocessor Interconnection Networks. J. Parallel Distributed Comput. 12(1): 39-49 (1991) - [j25]Philip J. Bernhard, Daniel J. Rosenkrantz:
Using the Dual Path Property of Omega Networks to Obtain Conflict-Free Message Routing. IEEE Trans. Parallel Distributed Syst. 2(4): 503-507 (1991) - [c22]Dechang Gu, Daniel J. Rosenkrantz, S. S. Ravi:
Construction and Analysis of Fault-Secure Multiprocessor Schedules. FTCS 1991: 120-127 - [c21]Lin Yu, Daniel J. Rosenkrantz:
A Linear-Time Scheme for Version Reconstruction (Extended Abstract). WADS 1991: 141-152 - [c20]S. S. Ravi, Daniel J. Rosenkrantz, Giri Kumar Tayi:
Facility Dispersion Problems: Heuristics and Special Cases (Extended Abstract). WADS 1991: 355-366 - [e3]Daniel J. Rosenkrantz:
Proceedings of the Tenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 29-31, 1991, Denver, Colorado, USA. ACM Press 1991, ISBN 0-89791-430-9 [contents] - 1990
- [j24]Lin Yu, Daniel J. Rosenkrantz:
Minimizing Time-Space Cost for Database Version Control. Acta Informatica 27(7): 627-663 (1990) - [j23]Daniel J. Rosenkrantz:
Half-Hot State Assignments for Finite State Machines. IEEE Trans. Computers 39(5): 700-702 (1990) - [c19]Dechang Gu, Daniel J. Rosenkrantz, S. S. Ravi:
Design and analysis of test schemes for algorithm-based fault tolerance. FTCS 1990: 106-113 - [c18]Lin Yu, Daniel J. Rosenkrantz:
Representability of Design Objects by Ancestor-Controlled Hierarchical Specifications. PODS 1990: 28-39 - [e2]Daniel J. Rosenkrantz, Yehoshua Sagiv:
Proceedings of the Ninth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, April 2-4, 1990, Nashville, Tennessee, USA. ACM Press 1990, ISBN 0-89791-352-3 [contents]
1980 – 1989
- 1989
- [j22]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) - [c17]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 - 1988
- [j21]Daniel J. Rosenkrantz, Harry B. Hunt III:
Matrix Multiplication for Finite Algebraic Systems. Inf. Process. Lett. 28(4): 189-192 (1988) - [c16]Lin Yu, Daniel J. Rosenkrantz:
Minimizing Time-Space Cost For Database Version Control. PODS 1988: 294-301 - 1987
- [j20]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) - [j19]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) - 1986
- [j18]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
- [j17]Daniel J. Rosenkrantz, Harry B. Hunt III:
Testing for Grammatical Coverings. Theor. Comput. Sci. 38: 323-341 (1985) - 1984
- [j16]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) - [j15]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) - [j14]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) - [e1]Daniel J. Rosenkrantz, Ronald Fagin:
Proceedings of the Third ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, April 2-4, 1984, Waterloo, Ontario, Canada. ACM 1984, ISBN 0-89791-128-8 [contents] - 1983
- [j13]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
- [c15]Richard Edwin Stearns, Daniel J. Rosenkrantz:
Distributed Database Concurrency Controls Using Before-Values. SIGMOD Conference 1981: 74-83 - 1980
- [c14]Harry B. Hunt III, Daniel J. Rosenkrantz:
The Complexity of Recursion Schemes and Recursive Programming Languages (Extended Abstract). FOCS 1980: 152-160 - [c13]Harry B. Hunt III, Daniel J. Rosenkrantz:
Efficient Algorithms for Structural Similarity of Grammars. POPL 1980: 213-219 - [c12]Daniel J. Rosenkrantz, Harry B. Hunt III:
Processing Conjunctive Predicates and Queries. VLDB 1980: 64-72
1970 – 1979
- 1979
- [c11]Harry B. Hunt III, Daniel J. Rosenkrantz:
The Complexity of Testing Predicate Locks. SIGMOD Conference 1979: 127-133 - 1978
- [j12]Harry B. Hunt III, Daniel J. Rosenkrantz:
Computational Parallels Between the Regular and Context-Free Languages. SIAM J. Comput. 7(1): 99-114 (1978) - [j11]Daniel J. Rosenkrantz, Harry B. Hunt III:
Polynomial Algorithms for Deterministic Pushdown Automata. SIAM J. Comput. 7(4): 405-412 (1978) - [j10]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) - [c10]Daniel J. Rosenkrantz:
Dynamic Database Dumping. SIGMOD Conference 1978: 3-8 - 1977
- [j9]Harry B. Hunt III, Daniel J. Rosenkrantz:
On Equivalence and Containment Problems for Formal Languages. J. ACM 24(3): 387-396 (1977) - [j8]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) - [c9]Daniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis II:
A System Level Concurrency Control for Distributed Database Systems. Berkeley Workshop 1977: 132-145 - 1976
- [j7]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) - [j6]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) - [c8]Richard Edwin Stearns, Philip M. Lewis II, Daniel J. Rosenkrantz:
Concurrency Control for Database Systems. FOCS 1976: 19-32 - 1974
- [j5]Philip M. Lewis II, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Attributed Translations. J. Comput. Syst. Sci. 9(3): 279-307 (1974) - [c7]Daniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis II:
Approximate Algorithms for the Traveling Salesperson Problem. SWAT 1974: 33-42 - [c6]Harry B. Hunt III, Daniel J. Rosenkrantz:
Computational Parallels between the Regular and Context-Free Languages. STOC 1974: 64-74 - 1973
- [c5]Philip M. Lewis II, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Attributed Translations. STOC 1973: 160-171 - 1970
- [j4]Daniel J. Rosenkrantz, Richard Edwin Stearns:
Properties of Deterministic Top-Down Grammars. Inf. Control. 17(3): 226-256 (1970) - [c4]Daniel J. Rosenkrantz, Philip M. Lewis II:
Deterministic Left Corner Parsing (Extended Abstract). SWAT 1970: 139-152
1960 – 1969
- 1969
- [j3]Daniel J. Rosenkrantz:
Programmed Grammars and Classes of Formal Languages. J. ACM 16(1): 107-131 (1969) - [c3]Richard Edwin Stearns, Daniel J. Rosenkrantz:
Table Machine Simulation. SWAT 1969: 118-128 - [c2]Daniel J. Rosenkrantz, Richard Edwin Stearns:
Properties of Deterministic Top Down Grammars. STOC 1969: 165-180 - 1967
- [j2]Daniel J. Rosenkrantz:
Matrix Equations and Normal Forms for Context-Free Grammars. J. ACM 14(3): 501-507 (1967) - [c1]Daniel J. Rosenkrantz:
Programmed Grammars: A New Device for Generating Formal Languages. SWAT 1967: 14-20 - 1966
- [j1]Daniel J. Rosenkrantz:
Synchronizing Sequences for Incompletely Specified Flow Tables. IEEE Trans. Electron. Comput. 15(1): 104-105 (1966)
Coauthor Index
[c68] [c58] [c57] [j66] [j62] [i3] [j61] [c50] [j59] [j57] [p1] [j53] [c45] [j52] [j50] [c44] [c43] [c42] [j43] [j42] [c41] [i2] [c39] [c37] [c36] [c34] [j39] [j38] [c32] [c30] [c29] [i1] [j32] [c24] [c23] [j26] [j22] [c17] [j21] [j20] [j19] [j18] [j17] [j16] [j15] [j13] [c14] [c13] [c12] [c11] [j12] [j11] [j9] [j7] [j6] [c6]
Chris J. Kuhlman
aka: Christopher James Kuhlman
aka: Christopher James Kuhlman
Philip M. Lewis
aka: Philip M. Lewis II
aka: Philip M. Lewis II
[j74] [c85] [c84] [i10] [i9] [c83] [c81] [i8] [i7] [i6] [j73] [j72] [j71] [c80] [c79] [c78] [c77] [c76] [c75] [j70] [c74] [i4] [j69] [c73] [c72] [c71] [c70] [c69] [j68] [j67] [c68] [c67] [c66] [c57] [j66] [c55] [c54] [c53] [c52] [j62] [j61] [c50] [j59] [p1] [j53] [c45] [j52] [j50] [c44] [c43] [j43] [j42] [c41] [i2] [j41] [j40] [j39] [c32] [c30] [c29] [c27] [i1] [c26] [c24]
[j74] [c85] [c84] [i10] [i9] [c83] [c82] [c81] [i8] [i7] [i6] [j73] [j72] [j71] [c80] [c79] [i5] [c78] [c77] [c76] [c75] [j70] [c74] [i4] [j69] [c73] [c72] [c71] [c70] [c69] [p2] [j68] [j67] [c68] [c67] [c57] [j66] [c55] [c54] [c53] [c52] [j65] [j62] [j61] [c50] [r1] [j59] [j58] [c48] [j55] [j53] [c45] [j52] [j51] [j50] [c44] [c43] [j48] [j47] [j46] [j45] [j44] [j43] [j42] [i2] [j41] [c40] [j40] [c38] [c35] [c34] [j39] [c33] [c32] [c31] [j37] [j36] [c30] [c29] [c27] [i1] [j33] [j31] [c26] [c25] [c24] [c22] [c20] [c19] [j22]
[j74] [c85] [c84] [i10] [i9] [c83] [c81] [i8] [i7] [i6] [j73] [j71] [c80] [c79] [c78] [c77] [c75] [j70] [c74] [i4] [j69] [c73] [c72] [c71] [c70] [c69] [j68] [c68] [c67] [c64] [c63] [c62] [c61] [j66] [j62] [j61] [c50] [j59] [p1] [j53] [c45] [j52] [c44] [c43] [j43] [c41] [c37] [c36] [c34] [c30] [c29] [j14] [c15] [j10] [j8] [c9] [c8] [j5] [c7] [c5] [j4] [c3] [c2]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-09 20:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
