Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
129 | Michael Levin |
An Introduction To DIAM Levels Of Abstraction In Accessing Information. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Annual Conference (1) ![In: Proceedings 1978 ACM Annual Conference, Washington, DC, USA, December 4-6, 1978, Volume I, pp. 357-369, 1978, ACM, 978-0-89791-000-2. The full citation details ...](Pics/full.jpeg) |
1978 |
DBLP DOI BibTeX RDF |
DIAM, Relational DIAM, Database, Data model, Information management, Relational model, Data independence |
106 | L. S. Schneider |
A Relational View of the Data Independent Accessing Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the 1976 ACM SIGMOD International Conference on Management of Data, Washington, DC, USA, June 2-4, 1976., pp. 75-90, 1976, ACM, 978-1-4503-4729-7. The full citation details ...](Pics/full.jpeg) |
1976 |
DBLP DOI BibTeX RDF |
|
71 | Mikel Larrea, Antonio Fernández 0001, Sergio Arévalo |
Optimal implementation of the weakest failure detector for solving consensus (brief announcement). ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, July 16-19, 2000, Portland, Oregon, USA., pp. 334, 2000, ACM, 1-58113-183-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
64 | Michael Stratmann, Thomas Worsch |
Leader election in d-dimensional CA in time diam log(diam). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Future Gener. Comput. Syst. ![In: Future Gener. Comput. Syst. 18(7), pp. 939-950, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
53 | Amos Korman, David Peleg |
Dynamic routing schemes for graphs with low local density. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 4(4), pp. 41:1-41:18, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
distributed algorithms, dynamic networks, Routing schemes |
53 | Achour Mostéfaoui, Michel Raynal |
k-set agreement with limited accuracy failure detectors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, July 16-19, 2000, Portland, Oregon, USA., pp. 143-152, 2000, ACM, 1-58113-183-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
51 | Amadou Diadié Ba, Gane Samb Lo, Diam Ba |
Divergence Measures Estimation and Its Asymptotic Normality Theory Using Wavelets Empirical Processes I. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Stat. Theory Appl. ![In: J. Stat. Theory Appl. 17(1), pp. 158-171, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
50 | M. Levin |
Introduction to the DIAM Theory of Algebraic Access Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the 1981 ACM SIGMOD International Conference on Management of Data, Ann Arbor, Michigan, USA, April 29 - May 1, 1981, pp. 40-48, 1981, ACM Press, 978-0-89791-040-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
50 | Morton M. Astrahan, Sakti P. Ghosh |
A Search Path Selection Algorithm for the Data Independent Accessing Model (DIAM). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Workshop, Vol. 1 ![In: Proceedings of 1974 ACM-SIGMOD Workshop on Data Description, Access and Control, Ann Arbor, Michigan, USA, May 1-3, 1974, 2 Volumes, pp. 367-388, 1974, ACM, 978-1-4503-7415-6. The full citation details ...](Pics/full.jpeg) |
1974 |
DBLP DOI BibTeX RDF |
|
35 | Paolo Romano 0002, Luís E. T. Rodrigues, Nuno Carvalho |
The Weak Mutual Exclusion problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 23rd IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2009, Rome, Italy, May 23-29, 2009, pp. 1-12, 2009, IEEE. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
35 | Joseph S. B. Mitchell |
A PTAS for TSP with neighborhoods among fat regions in the plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007, pp. 11-18, 2007, SIAM, 978-0-898716-24-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
35 | Philippe Balbiani, Alexandru Baltag, Hans P. van Ditmarsch, Andreas Herzig, Tomohiro Hoshi, Tiago de Lima |
What can we achieve by arbitrary announcements?: A dynamic take on Fitch's knowability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TARK ![In: Proceedings of the 11th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2007), Brussels, Belgium, June 25-27, 2007, pp. 42-51, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
35 | Jing Huang 0007, Dong Ye 0002 |
Sharp Bounds for the Oriented Diameters of Interval Graphs and 2-Connected Proper Interval Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Computational Science (3) ![In: Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27 - 30, 2007, Proceedings, Part III, pp. 353-361, 2007, Springer, 978-3-540-72587-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
oriented diameter, proper interval graph, orientation, Diameter, interval graph |
35 | Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yuval Rabani |
On earthmover distance, metric labeling, and 0-extension. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 547-556, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
35 | Michael Elkin |
Computing almost shortest paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 1(2), pp. 283-323, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
almost shortest paths, Graph algorithms, spanners |
35 | Subbarayan Venkatesan, Maulin Patel, Neeraj Mittal |
A Distributed Algorithm for Path Restoration in Circuit Switched Communication Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SRDS ![In: 24th IEEE Symposium on Reliable Distributed Systems (SRDS 2005),26-28 October 2005, Orlando, FL, USA, pp. 226-236, 2005, IEEE Computer Society, 0-7695-2463-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
35 | Steffen Börm, Lars Grasedyck |
Low-Rank Approximation of Integral Operators by Interpolation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computing ![In: Computing 72(3-4), pp. 325-332, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
35 | Partha Dutta, Rachid Guerraoui |
The inherent price of indulgence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, PODC 2002, Monterey, California, USA, July 21-24, 2002, pp. 88-97, 2002, ACM, 1-58113-485-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
35 | Michael Elkin |
Computing almost shortest paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, PODC 2001, Newport, Rhode Island, USA, August 26-29, 2001, pp. 53-62, 2001, ACM, 1-58113-383-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
35 | Garry L. Johns, Tai-Chi Lee |
S-Distance in Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Great Lakes Computer Science Conference ![In: Computing in the 90's, The First Great Lakes Computer Science Conference, Kalamazzo, Michigan, USA, October 18-20, 1989, Proceedings, pp. 29-33, 1989, Springer, 3-540-97628-0. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
35 | L. S. Schneider, C. R. Spath |
Quantitative Data Description. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the 1975 ACM SIGMOD International Conference on Management of Data, San Jose, California, USA, May 14-16, 1975., pp. 167-185, 1975, ACM, 978-1-4503-7328-9. The full citation details ...](Pics/full.jpeg) |
1975 |
DBLP DOI BibTeX RDF |
data base design requirements, data base simulation, data description, entity set model, data dictionaries |
32 | Xinxin Fan, Qi Chai, Lei Xu 0012, Dong Guo |
DIAM-IoT: A Decentralized Identity and Access Management Framework for Internet of Things. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BSCI ![In: BSCI '20: Proceedings of the 2nd ACM International Symposium on Blockchain and Secure Critical Infrastructure, co-located with AsiaCCS 2020, Taipei, Taiwan, October 6, 2020, pp. 186-191, 2020, ACM, 978-1-4503-7610-5. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
32 | Yurong Luo, Jin Cao, Maode Ma, Hui Li 0006, Ben Niu 0001, Fenghua Li |
DIAM: Diversified Identity Authentication Mechanism for 5G Multi-Service System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICNC ![In: International Conference on Computing, Networking and Communications, ICNC 2019, Honolulu, HI, USA, February 18-21, 2019, pp. 418-424, 2019, IEEE, 978-1-5386-9223-3. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
32 | Jinyong Lee, Jongwon Lee, Jongeun Lee, Yunheung Paek |
Improving performance of loops on DIAM-based VLIW architectures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LCTES ![In: SIGPLAN/SIGBED Conference on Languages, Compilers and Tools for Embedded Systems 2014, LCTES '14, Edinburgh, United Kingdom - June 12 - 13, 2014, pp. 135-144, 2014, ACM, 978-1-4503-2877-7. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
32 | Amaury Belin, Yannick Prié |
DIAM: towards a model for describing appropriation processes through the evolution of digital artifacts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Conference on Designing Interactive Systems ![In: Designing Interactive Systems Conference 2012, DIS '12, Newcastle Upon Tyne, United Kingdom, June 11-15, 2012, pp. 645-654, 2012, ACM, 978-1-4503-1210-3. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
32 | Blanca Cases |
From Synonymy to Self-Modifying Automata: Q-Diam Language. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Developments in Language Theory ![In: Developments in Language Theory II, At the Crossroads of Mathematics, Computer Science and Biology, Magdeburg, Germany, 17-21 July 1995, pp. 454-459, 1995, World Scientific, Singapore. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP BibTeX RDF |
|
32 | Michael E. Senko |
DIAM II and Levels of Abstraction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Conference on Data: Abstraction, Definition and Structure ![In: Proceedings of the SIGPLAN 1976 Conference on Data: Abstraction, Definition and Structure, Salt Lake City, Utah, USA, March 22-24, 1976, pp. 121-140, 1976, ACM, 978-1-4503-7898-7. The full citation details ...](Pics/full.jpeg) |
1976 |
DBLP DOI BibTeX RDF |
|
32 | Michael E. Senko |
DIAM as a Detailed Example of the ANSI SPARC Architecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IFIP Working Conference on Modelling in Data Base Management Systems ![In: Modelling in Data Base Management Systems, Proceeding of the IFIP Working Conference on Modelling in Data Base Management Systems, Freudenstadt, Germany, January 5-8, 1976, pp. 73-94, 1976, North-Holland, 0-7204-0459-2. The full citation details ...](Pics/full.jpeg) |
1976 |
DBLP BibTeX RDF |
|
32 | Michael E. Senko, Edward B. Altman |
DIAM II and Levels of Abstraction - The Physical Device Level: A General Model for Access Methods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLDB ![In: Systems for Large Data Bases, September 8-10, 1976, Brussels, Belgium., pp. 79-94, 1976, North Holland & IFIP, 0-7204-0546-7. The full citation details ...](Pics/full.jpeg) |
1976 |
DBLP BibTeX RDF |
|
32 | Michael E. Senko |
Data Description Language in the Concept of a Multilevel Structured Description: DIAM II with FORAL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IFIP TC-2 Special Working Conference on Data Base Description ![In: Data Base Description, Proceeding of the IFIP TC-2 Special Working Conference on Data Base Description, Wepion, Belgium, January 13-17, 1975., pp. 239-258, 1975, North-Holland, 0-7204-2833-5. The full citation details ...](Pics/full.jpeg) |
1975 |
DBLP BibTeX RDF |
|
32 | Michael E. Senko |
Specification of Stored Data Structures and Desired Output Results in DIAM II with FORAL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLDB ![In: Proceedings of the International Conference on Very Large Data Bases, September 22-24, 1975, Framingham, Massachusetts, USA., pp. 557-571, 1975, ACM. The full citation details ...](Pics/full.jpeg) |
1975 |
DBLP DOI BibTeX RDF |
|
31 | Juan A. Garay, Shay Kutten, David Peleg |
A Sub-Linear Time Distributed Algorithm for Minimum-Weight Spanning Trees (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 659-668, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
distributed minimum-weight spanning tree algorithm, sublinear time distributed algorithm, minimum-weight spanning trees, global network problems, n-vertex network, Diam, edge elimination techniques, time complexity, graph decomposition |
18 | Sunil Arya, Theocharis Malamatos, David M. Mount |
The Effect of Corners on the Complexity of Approximate Range Searching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 41(3), pp. 398-443, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Computational complexity, Approximation algorithms, Range searching, Idempotence |
18 | Sunil Arya, Guilherme Dias da Fonseca, David M. Mount |
Tradeoffs in Approximate Range Searching Made Simpler. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIBGRAPI ![In: SIBGRAPI 2008, Proceedings of the XXI Brazilian Symposium on Computer Graphics and Image Processing, Campo Grande, Brazil, 12-15 October 2008, pp. 237-244, 2008, IEEE Computer Society, 978-0-7695-3358-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Xingde Jia |
Wide Diameter of Cayley Digraphs of Finite Cyclic Groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 9th International Symposium on Parallel Architectures, Algorithms, and Networks, ISPAN 2008, 7-9 May 2008, Sydney, NSW, Australia, pp. 146-150, 2008, IEEE Computer Society, 978-0-7695-3125-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Cayley digraphs, communication networks, wide diameter, geometric representation |
18 | Micha Streppel, Ke Yi 0001 |
Approximate Range Searching in External Memory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007, Proceedings, pp. 536-548, 2007, Springer, 978-3-540-77118-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Janna Burman, Shay Kutten |
Time Optimal Asynchronous Self-stabilizing Spanning Tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings, pp. 92-107, 2007, Springer, 978-3-540-75141-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Wesley Pegden |
Distance Sequences In Locally Infinite Vertex-Transitive Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 26(5), pp. 577-585, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C12 |
18 | Boris Aronov, Alon Efrat, Vladlen Koltun, Micha Sharir |
On the Union of kappa-Round Objects in Three and Four Dimensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 36(4), pp. 511-526, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Sunil Arya, Theocharis Malamatos, David M. Mount |
The effect of corners on the complexity of approximate range searching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 22nd ACM Symposium on Computational Geometry, Sedona, Arizona, USA, June 5-7, 2006, pp. 11-20, 2006, ACM, 1-59593-340-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
approximation algorithms, range searching, idempotence |
18 | Sunil Arya, Theocharis Malamatos, David M. Mount |
On the importance of idempotence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 564-573, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
approximation algorithms, range searching, idempotence |
18 | Shai Dekel, Dany Leviatan |
Whitney Estimates for Convex Domains with Applications to Multivariate Piecewise Polynomial Approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Found. Comput. Math. ![In: Found. Comput. Math. 4(4), pp. 345-368, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Piecewise polynomial approximation, Whitney estimates, Johns theorem, Nonlinear approximation |
18 | Boris Aronov, Alon Efrat, Vladlen Koltun, Micha Sharir |
On the union of kapa-round objects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 383-390, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
union of objects, combinatorial complexity, fat objects |
18 | Richard Desper, Olivier Gascuel |
Fast and Accurate Phylogeny Reconstruction Algorithms Based on the Minimum-Evolution Principle. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WABI ![In: Algorithms in Bioinformatics, Second International Workshop, WABI 2002, Rome, Italy, September 17-21, 2002, Proceedings, pp. 357-374, 2002, Springer, 3-540-44211-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
18 | Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler |
On the Power of BFS to Determine a Graphs Diameter. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2002: Theoretical Informatics, 5th Latin American Symposium, Cancun, Mexico, April 3-6, 2002, Proceedings, pp. 209-223, 2002, Springer, 3-540-43400-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
18 | Tandy J. Warnow, Bernard M. E. Moret, Katherine St. John |
Absolute convergence: true trees from short sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, USA., pp. 186-195, 2001, ACM/SIAM, 0-89871-490-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP BibTeX RDF |
|
18 | Christof Krick, Harald Räcke, Matthias Westermann |
Approximation algorithms for data management in networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2001, Heraklion, Crete Island, Greece, July 4-6, 2001, pp. 237-246, 2001, ACM, 1-58113-409-6. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
18 | Evans J. Adams |
Workload models for DBMS performance evaluation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Conference on Computer Science ![In: Proceedings of the 13th ACM Annual Conference on Computer Science, New Orleans, Louisiana, USA, 1985, pp. 185-195, 1985, ACM, 0-89791-150-4. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|