Search results for "disjointness"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
108	Christian Meilicke, Johanna Völker, Heiner Stuckenschmidt	Learning Disjointness for Debugging Mappings between Lightweight Ontologies.	EKAW	2008	DBLP DOI BibTeX RDF
105	Susan Hohenberger, Stephen A. Weis	Honest-Verifier Private Disjointness Testing Without Random Oracles.	Privacy Enhancing Technologies	2006	DBLP DOI BibTeX RDF	private disjointness testing, private intersection cardinality, subgroup decision assumption, private data mining, anonymous login
93	Johanna Völker, Denny Vrandecic, York Sure, Andreas Hotho	Learning Disjointness.	ESWC	2007	DBLP DOI BibTeX RDF
91	Troy Lee, Adi Shraibman	Disjointness Is Hard in the Multi-party Number-on-the-Forehead Model.	CCC	2008	DBLP DOI BibTeX RDF	multiparty communication complexity, disjointness, lower bounds
76	Hartmut Klauck	A strong direct product theorem for disjointness.	STOC	2010	DBLP DOI BibTeX RDF	communication-space tradeoffs, disjointness problem, lower bounds, communication complexity, complexity theory, direct product theorems
76	Qingsong Ye, Huaxiong Wang, Josef Pieprzyk, Xian-Mo Zhang	Efficient Disjointness Tests for Private Datasets.	ACISP	2008	DBLP DOI BibTeX RDF	Private Set Disjointness, Private Matching, Secure Multi-Party Computation
50	G. Sathya Narayanan, T. Aishwarya, Anugrah Agrawal, Arpita Patra, Ashish Choudhary, C. Pandu Rangan	Multi Party Distributed Private Matching, Set Disjointness and Cardinality of Set Intersection with Information Theoretic Security.	CANS	2009	DBLP DOI BibTeX RDF	Privacy preserving Set operations, Multiparty Computation
50	Jörn Anemüller	Maximization of Component Disjointness: A Criterion for Blind Source Separation.	ICA	2007	DBLP DOI BibTeX RDF
50	Paul Beame, Toniann Pitassi, Nathan Segerlind, Avi Wigderson	A Strong Direct Product Theorem for Corruption and the Multiparty Communication Complexity of Disjointness.	Comput. Complex.	2006	DBLP DOI BibTeX RDF	06D15, 68Q17, 68Q15, 06E30, Subject classification. 68Q10
50	Peter Høyer, Ronald de Wolf	Improved Quantum Communication Complexity Bounds for Disjointness and Equality.	STACS	2002	DBLP DOI BibTeX RDF
42	Reuven Peleg	זרות יחסית, זרות חלשה וערבוב חלש (Relative disjointness, weak disjointness and weakly mixing.).		1971	RDF
36	Troy Lee, Adi Shraibman	Disjointness is Hard in the Multiparty Number-on-the-Forehead Model.	Comput. Complex.	2009	DBLP DOI BibTeX RDF	68Q17, Subject classification
36	Kuo-Hua Wang, Jia-Hung Chen	K-disjointness paradigm with application to symmetry detection for incompletely specified functions.	ASP-DAC	2005	DBLP DOI BibTeX RDF
36	Paul Beame, Toniann Pitassi, Nathan Segerlind, Avi Wigderson	A Direct Sum Theorem for Corruption and the Multiparty NOF Communication Complexity of Set Disjointness.	CCC	2005	DBLP DOI BibTeX RDF
36	Xuefei Li, Laurie G. Cuthbert	Node-disjointness-based multipath routing for mobile ad hoc networks.	PE-WASUN	2004	DBLP DOI BibTeX RDF	ad hoc networks, multipath routing, low overhead, node-disjoint
36	Rahul Jain 0001, Jaikumar Radhakrishnan, Pranab Sen	A Lower Bound for the Bounded Round Quantum Communication Complexity of Set Disjointness.	FOCS	2003	DBLP DOI BibTeX RDF
36	Amit Chakrabarti, Subhash Khot, Xiaodong Sun	Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness.	CCC	2003	DBLP DOI BibTeX RDF
36	David G. Clarke, Sophia Drossopoulou	Ownership, encapsulation and the disjointness of type and effect.	OOPSLA	2002	DBLP DOI BibTeX RDF	aliasing, encapsulation, ownership types, type-and-effects systems
36	Hartmut Klauck, Ashwin Nayak 0001, Amnon Ta-Shma, David Zuckerman	Interaction in quantum communication and the complexity of set disjointness.	STOC	2001	DBLP DOI BibTeX RDF
36	Charles Elkan	A Decision Procedure for Conjunctive Query Disjointness.	PODS	1989	DBLP DOI BibTeX RDF
29	Emanuele Viola, Avi Wigderson	One-Way Multi-Party Communication Lower Bound for Pointer Jumping with Applications.	FOCS	2007	DBLP DOI BibTeX RDF
29	Alessandro Artale, Diego Calvanese, Roman Kontchakov, Vladislav Ryzhikov, Michael Zakharyaschev	Reasoning over Extended ER Models.	ER	2007	DBLP DOI BibTeX RDF
29	Jie Bao 0001, Doina Caragea, Vasant G. Honavar	On the Semantics of Linking and Importing in Modular Ontologies.	ISWC	2006	DBLP DOI BibTeX RDF
29	Aggelos Kiayias, Antonina Mitrofanova	Syntax-Driven Private Evaluation of Quantified Membership Queries.	ACNS	2006	DBLP DOI BibTeX RDF
29	Mineo Kaneko	Minimal Set of Essential Resource Disjoint Pairs for Exploring Feasible 3D Schedules.	APCCAS	2006	DBLP DOI BibTeX RDF
29	Paul Beame, Toniann Pitassi, Nathan Segerlind	Lower Bounds for Lovász-Schrijver Systems and Beyond Follow from Multiparty Communication Complexity.	ICALP	2005	DBLP DOI BibTeX RDF
29	Andreas Bley	On the complexity of vertex-disjoint length-restricted path problems.	Comput. Complex.	2003	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000). 68Q25, 90C27, 05C38, 05C40
29	Thomas G. Kurtz, Udi Manber	A Probabilistic Distributed Algorithm for Set Intersection and Its Analysis (Preliminary Version).	ICALP	1985	DBLP DOI BibTeX RDF
26	Christian Sommer 0001, Elad Verbin, Wei Yu 0007	Distance Oracles for Sparse Graphs.	FOCS	2009	DBLP DOI BibTeX RDF	distance oracle, lopsided set disjointness, data structures, lower bounds, cell-probe model
26	Giuseppe Di Battista, Maurizio Lenzerini	Deductive Entity-Relationship Modeling.	IEEE Trans. Knowl. Data Eng.	1993	DBLP DOI BibTeX RDF	deductive entity relationship modelling, IS-A, disjointness relations, mandatory participation, formal basis, computational complexity, semantics, conceptual modeling, deductive databases, first-order logic, inference mechanisms, assertions, classes, entity-relationship modelling, interdependencies, polynomial time complexity, inference algorithm
26	Meng Chang Chen, Lawrence McNamee	On the Data Model and Access Method of Summary Data Management.	IEEE Trans. Knowl. Data Eng.	1989	DBLP DOI BibTeX RDF	summary data management, trinary tuple, statistical function, metaknowledge, average-income, female engineer, derivability problem, disjointness constraint, SD tree, summary data search, computational complexity, data structures, experience, database management systems, data model, access method, insertion, category, deletion, summary, multidimensional access method
26	Andrew Chi-Chih Yao	Lower Bounds for Algebraic Computation Trees with Integer Inputs	FOCS	1989	DBLP DOI BibTeX RDF	integer inputs, topological lower bound, algebraic computation tree model, integral-constrained form, element distinctness, set disjointness, integer max gap, Milnor-Thom techniques, lower bounds, upper bounds, convex hull, Betti numbers, algebraic varieties, algebraic computation trees
21	János Pach, Gábor Tardos, Géza Tóth 0001	Disjointness graphs of short polygonal chains.	J. Comb. Theory, Ser. B	2024	DBLP DOI BibTeX RDF
21	Jesús Leaños, Christophe Ndjatchi, Luis Manuel Ríos-Castro	Disjointness graphs of segments in R2 are almost all hamiltonian.	Discret. Appl. Math.	2024	DBLP DOI BibTeX RDF
21	Bart Bogaerts 0001, Maxime Jakubowski, Jan Van den Bussche	Expressiveness of SHACL Features and Extensions for Full Equality and Disjointness Tests.	Log. Methods Comput. Sci.	2024	DBLP DOI BibTeX RDF
21	Paolo Maffezioli, Achille C. Varzi	Intuitionistic Mereology II: Overlap and Disjointness.	J. Philos. Log.	2023	DBLP DOI BibTeX RDF
21	Shachar Lovett, Jiapeng Zhang	Streaming Lower Bounds and Asymmetric Set-Disjointness.	Electron. Colloquium Comput. Complex.	2023	DBLP BibTeX RDF
21	Guangxu Yang, Jiapeng Zhang	Lifting Theorems Meet Information Complexity: Known and New Lower Bounds of Set-disjointness.	CoRR	2023	DBLP DOI BibTeX RDF
21	Allen Ibiapina, Ana Silva 0001	Snapshot disjointness in temporal graphs.	CoRR	2023	DBLP DOI BibTeX RDF
21	Shachar Lovett, Jiapeng Zhang	Streaming Lower Bounds and Asymmetric Set-Disjointness.	CoRR	2023	DBLP DOI BibTeX RDF
21	Shachar Lovett, Jiapeng Zhang	Streaming Lower Bounds and Asymmetric Set-Disjointness.	FOCS	2023	DBLP DOI BibTeX RDF
21	Allen Ibiapina, Ana Silva 0001	Snapshot Disjointness in Temporal Graphs.	SAND	2023	DBLP DOI BibTeX RDF
21	Alcides Lopes, Joel Luis Carbonera, Mara Abel	Disjointness axioms between top-level ontology concepts as a heuristic for word similarity evaluation.	ICTAI	2023	DBLP DOI BibTeX RDF
21	Jesús Leaños, Christophe Ndjatchi, Luis Manuel Ríos-Castro	On the connectivity of the disjointness graph of segments of point sets in general position in the plane.	Discret. Math. Theor. Comput. Sci.	2022	DBLP DOI BibTeX RDF
21	Anup Bhattacharya, Sourav Chakraborty 0001, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar	Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond.	Comput. Complex.	2022	DBLP DOI BibTeX RDF
21	Bart Bogaerts 0001, Maxime Jakubowski, Jan Van den Bussche	Expressiveness of SHACL Features and Extensions for Full Equality and Disjointness Tests.	CoRR	2022	DBLP DOI BibTeX RDF
21	Frédéric Magniez, Ashwin Nayak 0001	Quantum Distributed Complexity of Set Disjointness on a Line.	ACM Trans. Comput. Theory	2022	DBLP DOI BibTeX RDF
21	János Pach, Gábor Tardos, Géza Tóth 0001	Disjointness Graphs of Short Polygonal Chains.	SoCG	2022	DBLP DOI BibTeX RDF
21	Ori Rottenstreich	Survivability via Path Disjointness for HyperX.	APOCS	2022	DBLP DOI BibTeX RDF
21	Giuseppe Rizzo 0001, Claudia d'Amato, Nicola Fanizzi	An unsupervised approach to disjointness learning based on terminological cluster trees.	Semantic Web	2021	DBLP DOI BibTeX RDF
21	János Pach, Gábor Tardos, Géza Tóth 0001	Disjointness graphs of segments in the space.	Comb. Probab. Comput.	2021	DBLP DOI BibTeX RDF
21	Aurora Espinoza-Valdez, Jesús Leaños, Christophe Ndjatchi, Luis Manuel Ríos-Castro	An Upper Bound Asymptotically Tight for the Connectivity of the Disjointness Graph of Segments in the Plane.	Symmetry	2021	DBLP DOI BibTeX RDF
21	Akshay Kamath, Eric Price 0001, David P. Woodruff	A Simple Proof of a New Set Disjointness with Applications to Data Streams.	CoRR	2021	DBLP BibTeX RDF
21	Pavel Chuprikov, Vitalii Demianiuk, Sergey Gorinsky	PREDICAT: Efficient Packet Classification via Prefix Disjointness.	ICCCN	2021	DBLP DOI BibTeX RDF
21	Heba Aamer, Jan Van den Bussche	Input-Output Disjointness for Forward Expressions in the Logic of Information Flows.	ICDT	2021	DBLP DOI BibTeX RDF
21	Nachum Dershowitz, Rotem Oshman, Tal Roth	The communication complexity of multiparty set disjointness under product distributions.	STOC	2021	DBLP DOI BibTeX RDF
21	Akshay Kamath, Eric Price 0001, David P. Woodruff	A Simple Proof of a New Set Disjointness with Applications to Data Streams.	CCC	2021	DBLP DOI BibTeX RDF
21	János Pach, István Tomon	On the chromatic number of disjointness graphs of curves.	J. Comb. Theory, Ser. B	2020	DBLP DOI BibTeX RDF
21	Ruy Fabila Monroy, Carlos Hidalgo-Toscano, Jesús Leaños, Mario Lomelí-Haro	The Chromatic Number of the Disjointness Graph of the Double Chain.	Discret. Math. Theor. Comput. Sci.	2020	DBLP DOI BibTeX RDF
21	Anup Bhattacharya, Sourav Chakraborty 0001, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar	Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond.	Electron. Colloquium Comput. Complex.	2020	DBLP BibTeX RDF
21	Frédéric Magniez, Ashwin Nayak 0001	Quantum Distributed Complexity of Set Disjointness on a Line.	CoRR	2020	DBLP BibTeX RDF
21	Anup Bhattacharya, Sourav Chakraborty 0001, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar	Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond.	CoRR	2020	DBLP BibTeX RDF
21	Vladimir V. Podolskii, Alexander A. Sherstov	Inner Product and Set Disjointness: Beyond Logarithmically Many Parties.	ACM Trans. Comput. Theory	2020	DBLP DOI BibTeX RDF
21	Rita Girão-Silva, Boro Nedic, Matthias Gunkel, Teresa Gomes	Shared Risk Link Group disjointness and geodiverse routing: A trade-off between benefit and practical effort.	Networks	2020	DBLP DOI BibTeX RDF
21	Thu Huong Nguyen, Andrea G. B. Tettamanzi	Grammatical Evolution to Mine OWL Disjointness Axioms Involving Complex Concept Expressions.	CEC	2020	DBLP DOI BibTeX RDF
21	Tsvi Kopelowitz, Virginia Vassilevska Williams	Towards Optimal Set-Disjointness and Set-Intersection Data Structures.	ICALP	2020	DBLP DOI BibTeX RDF
21	Frédéric Magniez, Ashwin Nayak 0001	Quantum Distributed Complexity of Set Disjointness on a Line.	ICALP	2020	DBLP DOI BibTeX RDF
21	Thu Huong Nguyen, Andrea G. B. Tettamanzi	Using Grammar-Based Genetic Programming for Mining Disjointness Axioms Involving Complex Class Expressions.	ICCS	2020	DBLP DOI BibTeX RDF
21	Anup Bhattacharya, Sourav Chakraborty 0001, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar	Disjointness Through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond.	APPROX-RANDOM	2020	DBLP DOI BibTeX RDF
21	Thu Huong Nguyen, Andrea G. B. Tettamanzi	A Multi-Objective Evolutionary Approach to Class Disjointness Axiom Discovery.	WI/IAT	2020	DBLP DOI BibTeX RDF
21	Mark Braverman, Gillat Kol, Shay Moran, Raghuvansh R. Saxena	Convex Set Disjointness, Distributed Learning of Halfspaces, and LP Feasibility.	CoRR	2019	DBLP BibTeX RDF
21	Isaac Goldstein, Moshe Lewenstein, Ely Porat	On the Hardness of Set Disjointness and Set Intersection with Bounded Universe.	CoRR	2019	DBLP BibTeX RDF
21	Isaac Goldstein, Moshe Lewenstein, Ely Porat	On the Hardness of Set Disjointness and Set Intersection with Bounded Universe.	ISAAC	2019	DBLP DOI BibTeX RDF
21	János Pach, István Tomon	On the Chromatic Number of Disjointness Graphs of Curves.	SoCG	2019	DBLP DOI BibTeX RDF
21	Justine Reynaud, Yannick Toussaint, Amedeo Napoli	Redescription Mining for Learning Definitions and Disjointness Axioms in Linked Open Data.	ICCS	2019	DBLP DOI BibTeX RDF
21	János Pach, István Tomon	Coloring Hasse Diagrams and Disjointness Graphs of Curves.	GD	2019	DBLP DOI BibTeX RDF
21	Thu Huong Nguyen, Andrea G. B. Tettamanzi	An Evolutionary Approach to Class Disjointness Axiom Discovery.	WI	2019	DBLP DOI BibTeX RDF
21	Thu Huong Nguyen, Andrea G. B. Tettamanzi	Learning Class Disjointness Axioms Using Grammatical Evolution.	EuroGP	2019	DBLP DOI BibTeX RDF
21	Mert Saglam	Settling the complexity of the k-disjointness and the k-Hamming distance problems.		2019	RDF
21	Akanksha Agrawal 0001, Daniel Lokshtanov, Diptapriyo Majumdar, Amer E. Mouawad, Saket Saurabh 0001	Kernelization of Cycle Packing with Relaxed Disjointness Constraints.	SIAM J. Discret. Math.	2018	DBLP DOI BibTeX RDF
21	Ruy Fabila Monroy, Jakob Jonsson, Pavel Valtr 0001, David R. Wood	The exact chromatic number of the convex segment disjointness graph.	CoRR	2018	DBLP BibTeX RDF
21	Torsten Mütze, Bartosz Walczak, Veit Wiechert	Realization of shift graphs as disjointness graphs of 1-intersecting curves in the plane.	CoRR	2018	DBLP BibTeX RDF
21	Mark Braverman, Ankit Garg, Young Kun-Ko, Jieming Mao, Dave Touchette	Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness.	SIAM J. Comput.	2018	DBLP DOI BibTeX RDF
21	Boro Nedic, Matthias Gunkel, Teresa Gomes, Rita Girão-Silva	SRLG-disjointness and geodiverse routing - a practical network study and operational conclusions.	RNDM	2018	DBLP DOI BibTeX RDF
21	Atsushi Hiruma, Kohei Yatabe, Yasuhiro Oikawa	Separating Stereo Audio Mixture Having No Phase Difference by Convex Clustering and Disjointness Map.	IWAENC	2018	DBLP DOI BibTeX RDF
21	Mahipal Jadeja, Rahul Muthu, V. Sunitha	Set Labelling Vertices To Ensure Adjacency Coincides With Disjointness.	Electron. Notes Discret. Math.	2017	DBLP DOI BibTeX RDF
21	Vladimir V. Podolskii, Alexander A. Sherstov	Inner Product and Set Disjointness: Beyond Logarithmically Many Parties.	Electron. Colloquium Comput. Complex.	2017	DBLP BibTeX RDF
21	Vladimir V. Podolskii, Alexander A. Sherstov	Inner Product and Set Disjointness: Beyond Logarithmically Many Parties.	CoRR	2017	DBLP BibTeX RDF
21	Mark Braverman, Rotem Oshman	A Rounds vs. Communication Tradeoff for Multi-Party Set Disjointness.	FOCS	2017	DBLP DOI BibTeX RDF
21	János Pach, Gábor Tardos, Géza Tóth 0001	Disjointness Graphs of Segments.	SoCG	2017	DBLP DOI BibTeX RDF
21	Hartmut Klauck	The Complexity of Quantum Disjointness.	MFCS	2017	DBLP DOI BibTeX RDF
21	Giuseppe Rizzo 0001, Claudia d'Amato, Nicola Fanizzi, Floriana Esposito	Terminological Cluster Trees for Disjointness Axiom Discovery.	ESWC (1)	2017	DBLP DOI BibTeX RDF
21	François Scharffe	Class Disjointness Constraints as Specific Objective Functions in Neural Network Classifiers.	SemDeep@IWCS	2017	DBLP BibTeX RDF
21	Andrei Asinowski, Alon Regev	Triangulations with Few Ears: Symmetry Classes and Disjointness.	Integers	2016	DBLP BibTeX RDF
21	Mika Göös, Thomas Watson 0001	Communication Complexity of Set-Disjointness for All Probabilities.	Theory Comput.	2016	DBLP DOI BibTeX RDF
21	Gábor Braun, Sebastian Pokutta	Common Information and Unique Disjointness.	Algorithmica	2016	DBLP DOI BibTeX RDF
21	Alexander A. Sherstov	The Multiparty Communication Complexity of Set Disjointness.	SIAM J. Comput.	2016	DBLP DOI BibTeX RDF
21	Akanksha Agrawal 0001, Daniel Lokshtanov, Diptapriyo Majumdar, Amer E. Mouawad, Saket Saurabh 0001	Kernelization of Cycle Packing with Relaxed Disjointness Constraints.	ICALP	2016	DBLP DOI BibTeX RDF
21	Albin Ahmeti, Diego Calvanese, Axel Polleres, Vadim Savenkov	Handling Inconsistencies Due to Class Disjointness in SPARQL Updates.	ESWC	2016	DBLP DOI BibTeX RDF
21	Omri Weinstein, David P. Woodruff	The Simultaneous Communication of Disjointness with Applications to Data Streams.	Electron. Colloquium Comput. Complex.	2015	DBLP BibTeX RDF