Search results for "DIAM"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
129	Michael Levin	An Introduction To DIAM Levels Of Abstraction In Accessing Information.	ACM Annual Conference (1)	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.	SIGMOD Conference	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).	PODC	2000	DBLP DOI BibTeX RDF
64	Michael Stratmann, Thomas Worsch	Leader election in d-dimensional CA in time diam log(diam).	Future Gener. Comput. Syst.	2002	DBLP DOI BibTeX RDF
53	Amos Korman, David Peleg	Dynamic routing schemes for graphs with low local density.	ACM Trans. Algorithms	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.	PODC	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.	J. Stat. Theory Appl.	2018	DBLP DOI BibTeX RDF
50	M. Levin	Introduction to the DIAM Theory of Algebraic Access Graph.	SIGMOD Conference	1981	DBLP DOI BibTeX RDF
50	Morton M. Astrahan, Sakti P. Ghosh	A Search Path Selection Algorithm for the Data Independent Accessing Model (DIAM).	SIGMOD Workshop, Vol. 1	1974	DBLP DOI BibTeX RDF
35	Paolo Romano 0002, Luís E. T. Rodrigues, Nuno Carvalho	The Weak Mutual Exclusion problem.	IPDPS	2009	DBLP DOI BibTeX RDF
35	Joseph S. B. Mitchell	A PTAS for TSP with neighborhoods among fat regions in the plane.	SODA	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.	TARK	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.	International Conference on Computational Science (3)	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.	STOC	2006	DBLP DOI BibTeX RDF
35	Michael Elkin	Computing almost shortest paths.	ACM Trans. Algorithms	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.	SRDS	2005	DBLP DOI BibTeX RDF
35	Steffen Börm, Lars Grasedyck	Low-Rank Approximation of Integral Operators by Interpolation.	Computing	2004	DBLP DOI BibTeX RDF
35	Partha Dutta, Rachid Guerraoui	The inherent price of indulgence.	PODC	2002	DBLP DOI BibTeX RDF
35	Michael Elkin	Computing almost shortest paths.	PODC	2001	DBLP DOI BibTeX RDF
35	Garry L. Johns, Tai-Chi Lee	S-Distance in Trees.	Great Lakes Computer Science Conference	1989	DBLP DOI BibTeX RDF
35	L. S. Schneider, C. R. Spath	Quantitative Data Description.	SIGMOD Conference	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.	BSCI	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.	ICNC	2019	DBLP DOI BibTeX RDF
32	Jinyong Lee, Jongwon Lee, Jongeun Lee, Yunheung Paek	Improving performance of loops on DIAM-based VLIW architectures.	LCTES	2014	DBLP DOI BibTeX RDF
32	Amaury Belin, Yannick Prié	DIAM: towards a model for describing appropriation processes through the evolution of digital artifacts.	Conference on Designing Interactive Systems	2012	DBLP DOI BibTeX RDF
32	Blanca Cases	From Synonymy to Self-Modifying Automata: Q-Diam Language.	Developments in Language Theory	1995	DBLP BibTeX RDF
32	Michael E. Senko	DIAM II and Levels of Abstraction.	Conference on Data: Abstraction, Definition and Structure	1976	DBLP DOI BibTeX RDF
32	Michael E. Senko	DIAM as a Detailed Example of the ANSI SPARC Architecture.	IFIP Working Conference on Modelling in Data Base Management Systems	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.	VLDB	1976	DBLP BibTeX RDF
32	Michael E. Senko	Data Description Language in the Concept of a Multilevel Structured Description: DIAM II with FORAL.	IFIP TC-2 Special Working Conference on Data Base Description	1975	DBLP BibTeX RDF
32	Michael E. Senko	Specification of Stored Data Structures and Desired Output Results in DIAM II with FORAL.	VLDB	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)	FOCS	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.	Discret. Comput. Geom.	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.	SIBGRAPI	2008	DBLP DOI BibTeX RDF
18	Xingde Jia	Wide Diameter of Cayley Digraphs of Finite Cyclic Groups.	ISPAN	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.	ISAAC	2007	DBLP DOI BibTeX RDF
18	Janna Burman, Shay Kutten	Time Optimal Asynchronous Self-stabilizing Spanning Tree.	DISC	2007	DBLP DOI BibTeX RDF
18	Wesley Pegden	Distance Sequences In Locally Infinite Vertex-Transitive Digraphs.	Comb.	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.	Discret. Comput. Geom.	2006	DBLP DOI BibTeX RDF
18	Sunil Arya, Theocharis Malamatos, David M. Mount	The effect of corners on the complexity of approximate range searching.	SCG	2006	DBLP DOI BibTeX RDF	approximation algorithms, range searching, idempotence
18	Sunil Arya, Theocharis Malamatos, David M. Mount	On the importance of idempotence.	STOC	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.	Found. Comput. Math.	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.	SCG	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.	WABI	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.	LATIN	2002	DBLP DOI BibTeX RDF
18	Tandy J. Warnow, Bernard M. E. Moret, Katherine St. John	Absolute convergence: true trees from short sequences.	SODA	2001	DBLP BibTeX RDF
18	Christof Krick, Harald Räcke, Matthias Westermann	Approximation algorithms for data management in networks.	SPAA	2001	DBLP DOI BibTeX RDF
18	Evans J. Adams	Workload models for DBMS performance evaluation.	ACM Conference on Computer Science	1985	DBLP DOI BibTeX RDF