Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Shlomo Zilberstein
2010 – today
- 2013
[i13]Daniel S. Bernstein, Shlomo Zilberstein, Neil Immerman: The Complexity of Decentralized Control of Markov Decision Processes. CoRR abs/1301.3836 (2013)- 2012
- [j37]Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein: Applicability conditions for plans with loops: Computability results and algorithms. Artif. Intell. 191-192: 1-19 (2012)
- [j36]Akshat Kumar, Shlomo Zilberstein, Marc Toussaint: Message-Passing Algorithms for MAP Estimation Using DC Programming. Journal of Machine Learning Research - Proceedings Track 22: 656-664 (2012)
- [c92]Akshat Kumar, XiaoJian Wu, Shlomo Zilberstein: Lagrangian Relaxation Techniques for Scalable Spatial Conservation Planning. AAAI 2012
- [i12]Akshat Kumar, Shlomo Zilberstein: Message-Passing Algorithms for Quadratic Programming Formulations of MAP Estimation. CoRR abs/1202.3739 (2012)
- [i11]Akshat Kumar, Shlomo Zilberstein: Anytime Planning for Decentralized POMDPs using Expectation Maximization. CoRR abs/1203.3490 (2012)
- [i10]Feng Wu, Shlomo Zilberstein, Xiaoping Chen: Rollout Sampling Policy Iteration for Decentralized POMDPs. CoRR abs/1203.3528 (2012)
- [i9]Christopher Amato, Daniel S. Bernstein, Shlomo Zilberstein: Optimizing Memory-Bounded Controllers for Decentralized POMDPs. CoRR abs/1206.5258 (2012)
- [i8]Sven Seuken, Shlomo Zilberstein: Improved Memory-Bounded Dynamic Programming for Decentralized POMDPs. CoRR abs/1206.5295 (2012)
- [i7]Daniel Szer, François Charpillet, Shlomo Zilberstein: MAA*: A Heuristic Search Algorithm for Solving Decentralized POMDPs. CoRR abs/1207.1359 (2012)
- [i6]Zhengzhu Feng, Shlomo Zilberstein: Region-Based Incremental Pruning for POMDPs. CoRR abs/1207.4116 (2012)
- [i5]Zhengzhu Feng, Eric A. Hansen, Shlomo Zilberstein: Symbolic Generalization for On-line Planning. CoRR abs/1212.2459 (2012)
- 2011
- [j35]Feng Wu, Shlomo Zilberstein, Xiaoping Chen: Online planning for multi-agent systems with bounded communication. Artif. Intell. 175(2): 487-511 (2011)
- [j34]Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein: A new representation and associated algorithms for generalized planning. Artif. Intell. 175(2): 615-647 (2011)
- [j33]Marek Petrik, Shlomo Zilberstein: Robust Approximate Bilinear Programming for Value Function Approximation. Journal of Machine Learning Research 12: 3027-3063 (2011)
- [c91]
- [c90]Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein: Termination and Correctness Analysis of Cyclic Control. AAAI 2011
- [c89]Siddharth Srivastava, Shlomo Zilberstein, Neil Immerman, Hector Geffner: Qualitative Numeric Planning. AAAI 2011
- [c88]Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein, Tianjiao Zhang: Directed Search for Generalized Plans Using Classical Planners. ICAPS 2011
- [c87]XiaoJian Wu, Akshat Kumar, Shlomo Zilberstein: Influence Diagrams with Memory States: Representation and Algorithms. ADT 2011: 306-319
- [c86]Alan Carlin, Shlomo Zilberstein: Decentralized monitoring of distributed anytime algorithms. AAMAS 2011: 157-164
- [c85]Akshat Kumar, Shlomo Zilberstein: Message-passing algorithms for large structured decentralized POMDPs. AAMAS 2011: 1087-1088
- [c84]Feng Wu, Shlomo Zilberstein, Xiaoping Chen: Online Planning for Ad Hoc Autonomous Agent Teams. IJCAI 2011: 439-445
- [c83]Akshat Kumar, Shlomo Zilberstein, Marc Toussaint: Scalable Multiagent Planning Using Probabilistic Inference. IJCAI 2011: 2140-2146
- [c82]Akshat Kumar, Shlomo Zilberstein: Message-Passing Algorithms for Quadratic Programming Formulations of MAP Estimation. UAI 2011: 428-435
- [i4]Claudia V. Goldman, Shlomo Zilberstein: Decentralized Control of Cooperative Systems: Categorization and Complexity Analysis. CoRR abs/1107.0047 (2011)
- [i3]Claudia V. Goldman, Shlomo Zilberstein: Communication-Based Decomposition Mechanisms for Decentralized MDPs. CoRR abs/1111.0065 (2011)
- 2010
- [j32]Christopher Amato, Daniel S. Bernstein, Shlomo Zilberstein: Optimizing fixed-size stochastic controllers for POMDPs and decentralized POMDPs. Autonomous Agents and Multi-Agent Systems 21(3): 293-320 (2010)
- [c81]Christopher Amato, Blai Bonet, Shlomo Zilberstein: Finite-State Controllers Based on Mealy Machines for Centralized and Decentralized POMDPs. AAAI 2010
- [c80]Feng Wu, Shlomo Zilberstein, Xiaoping Chen: Trial-Based Dynamic Programming for Multi-Agent Planning. AAAI 2010
- [c79]Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein: Computing Applicability Conditions for Plans with Loops. ICAPS 2010: 161-168
- [c78]Feng Wu, Shlomo Zilberstein, Xiaoping Chen: Point-based policy generation for decentralized POMDPs. AAMAS 2010: 1307-1314
- [c77]Akshat Kumar, Shlomo Zilberstein: Point-based backup for decentralized POMDPs: complexity and new algorithms. AAMAS 2010: 1315-1322
- [c76]Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein: Merging example plans into generalized plans for non-deterministic environments. AAMAS 2010: 1341-1348
- [c75]Abdel-Illah Mouaddib, Shlomo Zilberstein, Aurélie Beynier, Laurent Jeanpierre: A Decision-Theoretic Approach to Cooperative Control and Adjustable Autonomy. ECAI 2010: 971-972
- [c74]Marek Petrik, Gavin Taylor, Ronald Parr, Shlomo Zilberstein: Feature Selection Using Regularization in Approximate Linear Programs for Markov Decision Processes. ICML 2010: 871-878
- [c73]Akshat Kumar, Shlomo Zilberstein: MAP Estimation for Graphical Models by Likelihood Maximization. NIPS 2010: 1180-1188
- [c72]Akshat Kumar, Shlomo Zilberstein: Anytime Planning for Decentralized POMDPs using Expectation Maximization. UAI 2010: 294-301
- [c71]Feng Wu, Shlomo Zilberstein, Xiaoping Chen: Rollout Sampling Policy Iteration for Decentralized POMDPs. UAI 2010: 666-673
- [i2]Marek Petrik, Gavin Taylor, Ronald Parr, Shlomo Zilberstein: Feature Selection Using Regularization in Approximate Linear Programs for Markov Decision Processes. CoRR abs/1005.1860 (2010)
- [i1]Marek Petrik, Shlomo Zilberstein: Global Optimization for Value Function Approximation. CoRR abs/1006.2743 (2010)
2000 – 2009
- 2009
- [j31]Raphen Becker, Alan Carlin, Victor R. Lesser, Shlomo Zilberstein: Analyzing Myopic Approaches for Multi-Agent Communication. Computational Intelligence 25(1): 31-50 (2009)
- [j30]Daniel S. Bernstein, Christopher Amato, Eric A. Hansen, Shlomo Zilberstein: Policy Iteration for Decentralized Control of Markov Decision Processes. J. Artif. Intell. Res. (JAIR) 34: 89-132 (2009)
- [j29]Marek Petrik, Shlomo Zilberstein: A Bilinear Programming Approach for Multiagent Planning. J. Artif. Intell. Res. (JAIR) 35: 235-274 (2009)
- [c70]Christopher Amato, Jilles Steeve Dibangoye, Shlomo Zilberstein: Incremental Policy Generation for Finite-Horizon DEC-POMDPs. ICAPS 2009
- [c69]Feng Wu, Shlomo Zilberstein, Xiaoping Chen: Multi-Agent Online Planning with Communication. ICAPS 2009
- [c68]Akshat Kumar, Shlomo Zilberstein: Constraint-based dynamic programming for decentralized POMDPs with structured interactions. AAMAS (1) 2009: 561-568
- [c67]Christopher Amato, Shlomo Zilberstein: Achieving goals in decentralized POMDPs. AAMAS (1) 2009: 593-600
- [c66]Akshat Kumar, Shlomo Zilberstein: Dynamic Programming Approximations for Partially Observable Stochastic Games. FLAIRS Conference 2009
- [c65]Martin Allen, Shlomo Zilberstein: Agent Influence and Intelligent Approximation in Multiagent Problems. IAT 2009: 311-314
- [c64]Alan Carlin, Shlomo Zilberstein: Myopic and Non-myopic Communication under Partial Observability. IAT 2009: 331-338
- [c63]Marek Petrik, Shlomo Zilberstein: Constraint relaxation in approximate linear programs. ICML 2009: 102
- [c62]Akshat Kumar, Shlomo Zilberstein: Event-Detecting Multi-Agent MDPs: Complexity and Constant-Factor Approximations. IJCAI 2009: 201-207
- [c61]Martin Allen, Shlomo Zilberstein: Complexity of Decentralized Control: Special Cases. NIPS 2009: 19-27
- [c60]Marek Petrik, Shlomo Zilberstein: Robust Value Function Approximation Using Bilinear Programming. NIPS 2009: 1446-1454
- [c59]Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein: Abstract Planning with Unknown Object Quantities and Properties. SARA 2009
- 2008
- [j28]Sven Seuken, Shlomo Zilberstein: Formal models and algorithms for decentralized decision making under uncertainty. Autonomous Agents and Multi-Agent Systems 17(2): 190-250 (2008)
- [j27]Claudia V. Goldman, Shlomo Zilberstein: Communication-Based Decomposition Mechanisms for Decentralized MDPs. J. Artif. Intell. Res. (JAIR) 32: 169-202 (2008)
- [c58]Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein: Learning Generalized Plans Using Abstract Counting. AAAI 2008: 991-997
- [c57]Martin Allen, Marek Petrik, Shlomo Zilberstein: Interaction Structure and Dimensionality Reduction in Decentralized MDPs. AAAI 2008: 1440-1441
- [c56]Marek Petrik, Shlomo Zilberstein: Learning Heuristic Functions through Approximate Linear Programming. ICAPS 2008: 248-255
- [c55]Alan Carlin, Shlomo Zilberstein: Value-based observation compression for DEC-POMDPs. AAMAS (1) 2008: 501-508
- [c54]Marek Petrik, Shlomo Zilberstein: A Successive Approximation Algorithm for Coordination Problems. ISAIM 2008
- [c53]Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein: Using Abstraction for Generalized Planning. ISAIM 2008
- 2007
- [j26]Claudia V. Goldman, Martin Allen, Shlomo Zilberstein: Learning to communicate in a decentralized environment. Autonomous Agents and Multi-Agent Systems 15(1): 47-90 (2007)
- [j25]Daniel Szer, François Charpillet, Shlomo Zilberstein: Résolution optimale de DEC-POMDPs par recherche heuristique. Revue d'Intelligence Artificielle 21(1): 107-128 (2007)
- [c52]Martin Allen, Shlomo Zilberstein: Agent Influence as a Predictor of Difficulty for Decentralized Problem-Solving. AAAI 2007: 688-693
- [c51]Marek Petrik, Shlomo Zilberstein: Anytime Coordination Using Separable Bilinear Programs. AAAI 2007: 750-755
- [c50]Marek Petrik, Shlomo Zilberstein: Average-Reward Decentralized Markov Decision Processes. IJCAI 2007: 1997-2002
- [c49]Sven Seuken, Shlomo Zilberstein: Memory-Bounded Dynamic Programming for DEC-POMDPs. IJCAI 2007: 2009-2015
- [c48]Ron Bekkerman, Shlomo Zilberstein, James Allan: Web Page Clustering Using Heuristic Search in the Web Graph. IJCAI 2007: 2280-2285
- [c47]Christopher Amato, Daniel S. Bernstein, Shlomo Zilberstein: Solving POMDPs Using Quadratically Constrained Linear Programs. IJCAI 2007: 2418-2424
- [c46]Christopher Amato, Daniel S. Bernstein, Shlomo Zilberstein: Optimizing Memory-Bounded Controllers for Decentralized POMDPs. UAI 2007: 1-8
- [c45]Sven Seuken, Shlomo Zilberstein: Improved Memory-Bounded Dynamic Programming for Decentralized POMDPs. UAI 2007: 344-351
- 2006
- [j24]
- [j23]Marek Petrik, Shlomo Zilberstein: Learning parallel portfolios of algorithms. Ann. Math. Artif. Intell. 48(1-2): 85-106 (2006)
- [c44]Christopher Amato, Daniel S. Bernstein, Shlomo Zilberstein: Solving POMDPs using quadratically constrained linear programs. AAMAS 2006: 341-343
- [c43]Christopher Amato, Daniel S. Bernstein, Shlomo Zilberstein: Finding Optimal POMDP Controllers Using Quadratically Constrained Linear Programs. ISAIM 2006
- [c42]
- 2005
- [c41]
- [c40]Raphen Becker, Victor R. Lesser, Shlomo Zilberstein: Analyzing Myopic Approaches for Multi-Agent Communication. IAT 2005: 550-557
- [c39]Daniel S. Bernstein, Eric A. Hansen, Shlomo Zilberstein: Bounded Policy Iteration for Decentralized POMDPs. IJCAI 2005: 1287-1292
- [c38]Martin Allen, Claudia V. Goldman, Shlomo Zilberstein: Language Learning in Multi-Agent Systems. IJCAI 2005: 1649-1650
- [c37]Natalia N. Beliaeva, Shlomo Zilberstein: Generating Admissible Heuristics by Abstraction for Search in Stochastic Domains. SARA 2005: 14-29
- [c36]Daniel Szer, François Charpillet, Shlomo Zilberstein: MAA*: A Heuristic Search Algorithm for Solving Decentralized POMDPs. UAI 2005: 576-590
- 2004
- [j22]Shlomo Zilberstein, Jana Koehler, Sven Koenig: The Fourteenth International Conference on Automated Planning and Scheduling (ICAPS-04). AI Magazine 25(4): 101-104 (2004)
- [j21]Claudia V. Goldman, Shlomo Zilberstein: Decentralized Control of Cooperative Systems: Categorization and Complexity Analysis. J. Artif. Intell. Res. (JAIR) 22: 143-174 (2004)
- [j20]Raphen Becker, Shlomo Zilberstein, Victor R. Lesser, Claudia V. Goldman: Solving Transition Independent Decentralized Markov Decision Processes. J. Artif. Intell. Res. (JAIR) 22: 423-455 (2004)
- [j19]Andrew Arnt, Shlomo Zilberstein, James Allan, Abdel-Illah Mouaddib: Dynamic Composition of Information Retrieval Techniques. J. Intell. Inf. Syst. 23(1): 67-97 (2004)
- [c35]Eric A. Hansen, Daniel S. Bernstein, Shlomo Zilberstein: Dynamic Programming for Partially Observable Stochastic Games. AAAI 2004: 709-715
- [c34]Raphen Becker, Shlomo Zilberstein, Victor R. Lesser: Decentralized Markov Decision Processes with Event-Driven Interactions. AAMAS 2004: 302-309
- [c33]Claudia V. Goldman, Martin Allen, Shlomo Zilberstein: Decentralized Language Learning through Acting. AAMAS 2004: 1006-1013
- [c32]Martin Allen, Shlomo Zilberstein: Automated Conversion and Simplification of Plan Representations. AAMAS 2004: 1272-1273
- [c31]Andrew Arnt, Shlomo Zilberstein: Attribute Measurement Policies for Time and Cost Sensitive Classification. ICDM 2004: 323-326
- [c30]Maurício Marengoni, Allen R. Hanson, Shlomo Zilberstein, Edward M. Riseman: Cost and Information-Driven Algorithm Selection for Vision Systems. ICIAR (1) 2004: 519-529
- [c29]Jianbin Tan, George S. Avrunin, Lori A. Clarke, Shlomo Zilberstein, Stefan Leue: Heuristic-guided counterexample search in FLAVERS. SIGSOFT FSE 2004: 201-210
- [c28]
- [e1]Shlomo Zilberstein, Jana Koehler, Sven Koenig (Eds.): Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling (ICAPS 2004), June 3-7 2004, Whistler, British Columbia, Canada. AAAI 2004, ISBN 1-57735-200-9
- 2003
- [j18]Shlomo Zilberstein, François Charpillet, Philippe Chassaing: Optimal Sequencing of Contract Algorithms. Ann. Math. Artif. Intell. 39(1-2): 1-18 (2003)
- [j17]Maurício Marengoni, Allen R. Hanson, Shlomo Zilberstein, Edward M. Riseman: Decision Making and Uncertainty Management in a 3D Reconstruction System. IEEE Trans. Pattern Anal. Mach. Intell. 25(7): 852-858 (2003)
- [c27]Raphen Becker, Shlomo Zilberstein, Victor R. Lesser, Claudia V. Goldman: Transition-independent decentralized markov decision processes. AAMAS 2003: 41-48
- [c26]Claudia V. Goldman, Shlomo Zilberstein: Optimizing information exchange in cooperative multi-agent systems. AAMAS 2003: 137-144
- [c25]Daniel S. Bernstein, Lev Finkelstein, Shlomo Zilberstein: Contract Algorithms and Robots on Rays: Unifying Two Scheduling Problems. IJCAI 2003: 1211-1217
- [c24]Max Horstmann, Shlomo Zilberstein: Automated Generation of Understandable Contingency Plans. IJCAI 2003: 1518-1519
- [c23]Daniel S. Bernstein, Zhengzhu Feng, Brian Neil Levine, Shlomo Zilberstein: Adaptive Peer Selection. IPTPS 2003: 237-246
- [c22]Zhengzhu Feng, Eric A. Hansen, Shlomo Zilberstein: Symbolic Generalization for On-line Planning. UAI 2003: 209-216
- [c21]Andrew Arnt, Shlomo Zilberstein: Learning to Perform Moderation in Online Forums. Web Intelligence 2003: 637-641
- 2002
- [j16]Daniel S. Bernstein, Robert Givan, Neil Immerman, Shlomo Zilberstein: The Complexity of Decentralized Control of Markov Decision Processes. Math. Oper. Res. 27(4): 819-840 (2002)
- [c20]Daniel S. Bernstein, Theodore J. Perkins, Shlomo Zilberstein, Lev Finkelstein: Scheduling Contract Algorithms on Multiple Processors. AAAI/IAAI 2002: 702-706
- 2001
- [j15]Eric Horvitz, Shlomo Zilberstein: Computational tradeoffs under bounded resources. Artif. Intell. 126(1-2): 1-4 (2001)
- [j14]Eric A. Hansen, Shlomo Zilberstein: Monitoring and control of anytime algorithms: A dynamic programming approach. Artif. Intell. 126(1-2): 139-157 (2001)
- [j13]Eric A. Hansen, Shlomo Zilberstein: LAO*: A heuristic search algorithm that finds solutions with loops. Artif. Intell. 129(1-2): 35-62 (2001)
- [j12]
- [c19]Ping Xuan, Victor R. Lesser, Shlomo Zilberstein: Communication decisions in multi-agent cooperation: model and experiments. Agents 2001: 616-623
- [c18]Shlomo Zilberstein, Richard Washington, Daniel S. Bernstein, Abdel-Illah Mouaddib: Decision-Theoretic Control of Planetary Rovers. Advances in Plan-Based Control of Robotic Agents 2001: 270-289
- [c17]Stéphane Cardon, Abdel-Illah Mouaddib, Shlomo Zilberstein, Richard Washington: Adaptive Control of Acyclic Progressive Processing Task Structures. IJCAI 2001: 701-706
- 2000
- [j11]David J. Musliner, Barney Pell, Wolff Dobson, Kai Goebel, Gautam Biswas, Sheila A. McIlraith, Giuseppina C. Gini, Sven Koenig, Shlomo Zilberstein, Weixiong Zhang: Reports on the AAAI Spring Symposia (March 1999). AI Magazine 21(2): 79-84 (2000)
- [j10]Shlomo Zilberstein, Abdel-Illah Mouaddib: Optimal scheduling of progressive processing tasks. Int. J. Approx. Reasoning 25(3): 169-186 (2000)
- [j9]Joshua Grass, Shlomo Zilberstein: A Value-Driven System for Autonomous Information Gathering. J. Intell. Inf. Syst. 14(1): 5-27 (2000)
- [c16]Ping Xuan, Victor R. Lesser, Shlomo Zilberstein: Communication in Multi-Agent Markov Decision Processes. ICMAS 2000: 467-468
- [c15]Shlomo Zilberstein, Abdel-Illah Mouaddib, Andrew Arnt: Dynamic Scheduling of Progressive Processing Plans. PuK 2000
- [c14]Daniel S. Bernstein, Shlomo Zilberstein, Neil Immerman: The Complexity of Decentralized Control of Markov Decision Processes. UAI 2000: 32-37
1990 – 1999
- 1999
- [c13]Maurício Marengoni, Allen R. Hanson, Shlomo Zilberstein, Edward M. Riseman: Control in a 3D Reconstruction System using Selective Perception. ICCV 1999: 1229-1236
- [c12]Shlomo Zilberstein, François Charpillet, Philippe Chassaing: Real-Time Problem-Solving with Contract Algorithms. IJCAI 1999: 1008-1015
- [c11]Shlomo Zilberstein, Abdel-Illah Mouaddib: Reactive Control of Dynamic Progressive Processing. IJCAI 1999: 1268-1273
- 1998
- [c10]Eric A. Hansen, Shlomo Zilberstein: Heuristic Search in Cyclic AND/OR Graphs. AAAI/IAAI 1998: 412-418
- [c9]Abdel-Illah Mouaddib, Shlomo Zilberstein: Optimal Scheduling of Dynamic Progressive Processing. ECAI 1998: 499-503
- 1997
- [c8]Abdel-Illah Mouaddib, Shlomo Zilberstein: Handling Duration Uncertainty in Meta-Level Control of Progressive Processing. IJCAI 1997: 1201-1207
- 1996
- [j8]Shlomo Zilberstein, Stuart J. Russell: Optimal Composition of Real-Time Systems. Artif. Intell. 82(1-2): 181-213 (1996)
- [j7]Shlomo Zilberstein: Using Anytime Algorithms in Intelligent Systems. AI Magazine 17(3): 73-83 (1996)
- [j6]Shlomo Zilberstein: Resource-bounded sensing and planning in autonomous systems. Auton. Robots 3(1): 31-48 (1996)
- [j5]Shlomo Zilberstein: Resource-Bounded Reasoning in Intelligent Systems. ACM Comput. Surv. 28(4es): 15 (1996)
- [j4]Joshua Grass, Shlomo Zilberstein: Anytime Algorithm Development Tools. SIGART Bulletin 7(2): 20-27 (1996)
- [j3]Eric A. Hansen, Shlomo Zilberstein: Monitoring Anytime Algorithms. SIGART Bulletin 7(2): 28-33 (1996)
- [c7]Eric A. Hansen, Shlomo Zilberstein: Monitoring the Progress of Anytime Problem-Solving. AAAI/IAAI, Vol. 2 1996: 1229-1234
- [c6]Eric A. Hansen, Andrew G. Barto, Shlomo Zilberstein: Reinforcement Learning for Mixed Open-loop and Closed-loop Control. NIPS 1996: 1026-1032
- 1995
- [j2]Shlomo Zilberstein: Operational Rationality through Compilation of Anytime Algorithms. AI Magazine 16(2): 79-80 (1995)
- [j1]
- [c5]
- [c4]
- 1994
- [c3]Shlomo Zilberstein: Meta-Level Control of Approximate Reasoning: A Decision Theoretic Approach. ISMIS 1994: 114-123
- 1993
- [c2]Shlomo Zilberstein, Stuart J. Russell: Anytime Sensing Planning and Action: A Practical Model for Robot Control. IJCAI 1993: 1402-1407
- 1991
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-02-02 19:51 CET by the dblp team