The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for Diam with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1974-2000 (16) 2001-2006 (17) 2007-2020 (15)
Publication types (Num. hits)
article(9) inproceedings(39)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 32 occurrences of 26 keywords

Results
Found 49 publication records. Showing 48 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
129Michael Levin An Introduction To DIAM Levels Of Abstraction In Accessing Information. Search on Bibsonomy ACM Annual Conference (1) The full citation details ... 1978 DBLP  DOI  BibTeX  RDF DIAM, Relational DIAM, Database, Data model, Information management, Relational model, Data independence
106L. S. Schneider A Relational View of the Data Independent Accessing Model. Search on Bibsonomy SIGMOD Conference The full citation details ... 1976 DBLP  DOI  BibTeX  RDF
71Mikel Larrea, Antonio Fernández 0001, Sergio Arévalo Optimal implementation of the weakest failure detector for solving consensus (brief announcement). Search on Bibsonomy PODC The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
64Michael Stratmann, Thomas Worsch Leader election in d-dimensional CA in time diam log(diam). Search on Bibsonomy Future Gener. Comput. Syst. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
53Amos Korman, David Peleg Dynamic routing schemes for graphs with low local density. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2008 DBLP  DOI  BibTeX  RDF distributed algorithms, dynamic networks, Routing schemes
53Achour Mostéfaoui, Michel Raynal k-set agreement with limited accuracy failure detectors. Search on Bibsonomy PODC The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
51Amadou Diadié Ba, Gane Samb Lo, Diam Ba Divergence Measures Estimation and Its Asymptotic Normality Theory Using Wavelets Empirical Processes I. Search on Bibsonomy J. Stat. Theory Appl. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
50M. Levin Introduction to the DIAM Theory of Algebraic Access Graph. Search on Bibsonomy SIGMOD Conference The full citation details ... 1981 DBLP  DOI  BibTeX  RDF
50Morton M. Astrahan, Sakti P. Ghosh A Search Path Selection Algorithm for the Data Independent Accessing Model (DIAM). Search on Bibsonomy SIGMOD Workshop, Vol. 1 The full citation details ... 1974 DBLP  DOI  BibTeX  RDF
35Paolo Romano 0002, Luís E. T. Rodrigues, Nuno Carvalho The Weak Mutual Exclusion problem. Search on Bibsonomy IPDPS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
35Joseph S. B. Mitchell A PTAS for TSP with neighborhoods among fat regions in the plane. Search on Bibsonomy SODA The full citation details ... 2007 DBLP  BibTeX  RDF
35Philippe 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 TARK The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
35Jing Huang 0007, Dong Ye 0002 Sharp Bounds for the Oriented Diameters of Interval Graphs and 2-Connected Proper Interval Graphs. Search on Bibsonomy International Conference on Computational Science (3) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF oriented diameter, proper interval graph, orientation, Diameter, interval graph
35Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yuval Rabani On earthmover distance, metric labeling, and 0-extension. Search on Bibsonomy STOC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
35Michael Elkin Computing almost shortest paths. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2005 DBLP  DOI  BibTeX  RDF almost shortest paths, Graph algorithms, spanners
35Subbarayan Venkatesan, Maulin Patel, Neeraj Mittal A Distributed Algorithm for Path Restoration in Circuit Switched Communication Networks. Search on Bibsonomy SRDS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
35Steffen Börm, Lars Grasedyck Low-Rank Approximation of Integral Operators by Interpolation. Search on Bibsonomy Computing The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
35Partha Dutta, Rachid Guerraoui The inherent price of indulgence. Search on Bibsonomy PODC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
35Michael Elkin Computing almost shortest paths. Search on Bibsonomy PODC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
35Garry L. Johns, Tai-Chi Lee S-Distance in Trees. Search on Bibsonomy Great Lakes Computer Science Conference The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
35L. S. Schneider, C. R. Spath Quantitative Data Description. Search on Bibsonomy SIGMOD Conference The full citation details ... 1975 DBLP  DOI  BibTeX  RDF data base design requirements, data base simulation, data description, entity set model, data dictionaries
32Xinxin Fan, Qi Chai, Lei Xu 0012, Dong Guo DIAM-IoT: A Decentralized Identity and Access Management Framework for Internet of Things. Search on Bibsonomy BSCI The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
32Yurong 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 ICNC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
32Jinyong Lee, Jongwon Lee, Jongeun Lee, Yunheung Paek Improving performance of loops on DIAM-based VLIW architectures. Search on Bibsonomy LCTES The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
32Amaury Belin, Yannick Prié DIAM: towards a model for describing appropriation processes through the evolution of digital artifacts. Search on Bibsonomy Conference on Designing Interactive Systems The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
32Blanca Cases From Synonymy to Self-Modifying Automata: Q-Diam Language. Search on Bibsonomy Developments in Language Theory The full citation details ... 1995 DBLP  BibTeX  RDF
32Michael E. Senko DIAM II and Levels of Abstraction. Search on Bibsonomy Conference on Data: Abstraction, Definition and Structure The full citation details ... 1976 DBLP  DOI  BibTeX  RDF
32Michael E. Senko DIAM as a Detailed Example of the ANSI SPARC Architecture. Search on Bibsonomy IFIP Working Conference on Modelling in Data Base Management Systems The full citation details ... 1976 DBLP  BibTeX  RDF
32Michael E. Senko, Edward B. Altman DIAM II and Levels of Abstraction - The Physical Device Level: A General Model for Access Methods. Search on Bibsonomy VLDB The full citation details ... 1976 DBLP  BibTeX  RDF
32Michael E. Senko Data Description Language in the Concept of a Multilevel Structured Description: DIAM II with FORAL. Search on Bibsonomy IFIP TC-2 Special Working Conference on Data Base Description The full citation details ... 1975 DBLP  BibTeX  RDF
32Michael E. Senko Specification of Stored Data Structures and Desired Output Results in DIAM II with FORAL. Search on Bibsonomy VLDB The full citation details ... 1975 DBLP  DOI  BibTeX  RDF
31Juan A. Garay, Shay Kutten, David Peleg A Sub-Linear Time Distributed Algorithm for Minimum-Weight Spanning Trees (Extended Abstract) Search on Bibsonomy FOCS The full citation details ... 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
18Sunil Arya, Theocharis Malamatos, David M. Mount The Effect of Corners on the Complexity of Approximate Range Searching. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Computational complexity, Approximation algorithms, Range searching, Idempotence
18Sunil Arya, Guilherme Dias da Fonseca, David M. Mount Tradeoffs in Approximate Range Searching Made Simpler. Search on Bibsonomy SIBGRAPI The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
18Xingde Jia Wide Diameter of Cayley Digraphs of Finite Cyclic Groups. Search on Bibsonomy ISPAN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Cayley digraphs, communication networks, wide diameter, geometric representation
18Micha Streppel, Ke Yi 0001 Approximate Range Searching in External Memory. Search on Bibsonomy ISAAC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
18Janna Burman, Shay Kutten Time Optimal Asynchronous Self-stabilizing Spanning Tree. Search on Bibsonomy DISC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
18Wesley Pegden Distance Sequences In Locally Infinite Vertex-Transitive Digraphs. Search on Bibsonomy Comb. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 05C12
18Boris Aronov, Alon Efrat, Vladlen Koltun, Micha Sharir On the Union of kappa-Round Objects in Three and Four Dimensions. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
18Sunil Arya, Theocharis Malamatos, David M. Mount The effect of corners on the complexity of approximate range searching. Search on Bibsonomy SCG The full citation details ... 2006 DBLP  DOI  BibTeX  RDF approximation algorithms, range searching, idempotence
18Sunil Arya, Theocharis Malamatos, David M. Mount On the importance of idempotence. Search on Bibsonomy STOC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF approximation algorithms, range searching, idempotence
18Shai Dekel, Dany Leviatan Whitney Estimates for Convex Domains with Applications to Multivariate Piecewise Polynomial Approximation. Search on Bibsonomy Found. Comput. Math. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Piecewise polynomial approximation, Whitney estimates, Johns theorem, Nonlinear approximation
18Boris Aronov, Alon Efrat, Vladlen Koltun, Micha Sharir On the union of kapa-round objects. Search on Bibsonomy SCG The full citation details ... 2004 DBLP  DOI  BibTeX  RDF union of objects, combinatorial complexity, fat objects
18Richard Desper, Olivier Gascuel Fast and Accurate Phylogeny Reconstruction Algorithms Based on the Minimum-Evolution Principle. Search on Bibsonomy WABI The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
18Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler On the Power of BFS to Determine a Graphs Diameter. Search on Bibsonomy LATIN The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
18Tandy J. Warnow, Bernard M. E. Moret, Katherine St. John Absolute convergence: true trees from short sequences. Search on Bibsonomy SODA The full citation details ... 2001 DBLP  BibTeX  RDF
18Christof Krick, Harald Räcke, Matthias Westermann Approximation algorithms for data management in networks. Search on Bibsonomy SPAA The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
18Evans J. Adams Workload models for DBMS performance evaluation. Search on Bibsonomy ACM Conference on Computer Science The full citation details ... 1985 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #48 of 48 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license