Search results for "conflict-free"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
67	V. S. Lakshmanan 0001	Split-Freedom and MVD-Intersection: A New Characterization of Multivalued Dependencies Having Conflict-Free Covers.	ICDT	1986	DBLP DOI BibTeX RDF
67	Amotz Bar-Noy, Panagiotis Cheilaris, Shakhar Smorodinsky	Conflict-free coloring for intervals: from offline to online.	SPAA	2006	DBLP DOI BibTeX RDF	online algorithms, coloring, cellular networks, frequency assignment, conflict free
63	Hsu-Chun Yen	Priority Conflict-Free Petri Nets.	Acta Informatica	1998	DBLP DOI BibTeX RDF
63	Hirofumi Katsuno	An Extension of Conflict-Free Multivalued Dependency Sets.	ACM Trans. Database Syst.	1984	DBLP DOI BibTeX RDF
62	Philip J. Bernhard, Daniel J. Rosenkrantz	Using the Dual Path Property of Omega Networks to Obtain Conflict-Free Message Routing.	IEEE Trans. Parallel Distributed Syst.	1991	DBLP DOI BibTeX RDF	source processors, disjoint network routes, bidirectional network links, bidirectionalnetwork switches, dual path, conflict-free message routing, communication conflicts, destination processors, circuit switchingmode, conflict-free message transmission, message switching, algorithm, parallel algorithms, omega networks, multiprocessorinterconnection networks, message patterns
58	Amotz Bar-Noy, Panagiotis Cheilaris, Shakhar Smorodinsky	Deterministic conflict-free coloring for intervals: From offline to online.	ACM Trans. Algorithms	2008	DBLP DOI BibTeX RDF	Online algorithms, coloring, cellular networks, frequency assignment, conflict free
58	Hans Vandierendonck, Koenraad De Bosschere	XOR-Based Hash Functions.	IEEE Trans. Computers	2005	DBLP DOI BibTeX RDF	XOR-based hash function, conflict-free mapping, column space, skewed-associative cache, interbank dispersion, null space
55	Khaled M. Elbassioni, Nabil H. Mustafa	Conflict-Free Colorings of Rectangles Ranges.	STACS	2006	DBLP DOI BibTeX RDF
50	Deepak Ajwani, Khaled M. Elbassioni, Sathish Govindarajan, Saurabh Ray	Conflict-free coloring for rectangle ranges using O(n.382) colors.	SPAA	2007	DBLP DOI BibTeX RDF	axis-parallel rectangles, conflict-free coloring, frequency assignment in wireless networks, monotone sequences, dominating sets
50	Mateo Valero, Tomás Lang, Eduard Ayguadé	Conflict-free access of vectors with power-of-two strides.	ICS	1992	DBLP DOI BibTeX RDF	multi-module memories, out-of-order access, power-of-two strides, vector processors, conflict-free access, storage schemes
48	Peng-Jun Wan, Xiang-Yang Li 0001, Ophir Frieder	OVSF-CDMA Code Assignment in Wireless Ad Hoc Networks.	Algorithmica	2007	DBLP DOI BibTeX RDF	OVSF-CDMA, Proximation algorithms, Wireless ad hoc networks, Code assignment
48	Peng-Jun Wan, Xiang-Yang Li 0001, Ophir Frieder	OVSF-CDMA code assignment in wireless ad hoc networks.	DIALM-POMC	2004	DBLP DOI BibTeX RDF	OVSF-CDMA, approximation algorithms, graph theory, system design, code assignment
47	Sariel Har-Peled, Shakhar Smorodinsky	Conflict-Free Coloring of Points and Simple Regions in the Plane.	Discret. Comput. Geom.	2005	DBLP DOI BibTeX RDF
47	Hsu-Chun Yen, Bow-Yaw Wang, Ming-Sheng Yang	A Unified Approach for Reasoning about Conflict-Free Petri Nets.	Application and Theory of Petri Nets	1993	DBLP DOI BibTeX RDF
47	Rodney R. Howell, Louis E. Rosier	On Questions of Fairness and Temporal Logic for Conflict- Free Petri Nets.	European Workshop on Applications and Theory of Petri Nets	1987	DBLP DOI BibTeX RDF
44	Vincenzo Auletta, Amelia De Vivo, Vittorio Scarano	Multiple Templates Access of Trees in Parallel Memory Systems.	IPPS	1997	DBLP DOI BibTeX RDF	multiple template access, node mapping algorithms, subtree templates, root-to-leaf path templates, preprocessing phase, data structure, time complexity, tree data structures, load, complete binary trees, conflict-free access, parallel access, memory modules, parallel memory systems
44	Sajal K. Das 0001, Irene Finocchi, Rossella Petreschi	Star-Coloring of Graphs for Conflict-Free Access to Parallel Memory Systems.	IPDPS	2004	DBLP DOI BibTeX RDF
42	Ke Chen 0006, Haim Kaplan, Micha Sharir	Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles.	ACM Trans. Algorithms	2009	DBLP DOI BibTeX RDF	Conflict free coloring, online algorithms, coloring
42	Gopal Pandurangan, GaHyun Park	Analysis of Randomized Protocols for Conflict-Free Distributed Access.	Algorithmica	2007	DBLP DOI BibTeX RDF	Randomized distributed protocols, Conflict-free access
41	Ling-Ling Yan, M. Tamer Özsu	Conflict Tolerant Queries in AURORA.	CoopIS	1999	DBLP DOI BibTeX RDF
40	Dario Colazzo, Giorgio Ghelli, Carlo Sartiani	Efficient asymmetric inclusion between regular expression types.	ICDT	2009	DBLP DOI BibTeX RDF	language inclusion, XML, regular expressions
40	Edward Sciore	Real-World MVD's.	SIGMOD Conference	1981	DBLP DOI BibTeX RDF
38	Hua-Wen Tsai, Tzung-Shi Chen	Minimal Time and Conflict-Free Schedule for Convergecast in Wireless Sensor Networks.	ICC	2008	DBLP DOI BibTeX RDF
38	David T. Harper III, Darel A. Linebarger	A Dynamic Storage Scheme for Conflict-Free Vector Access.	ISCA	1989	DBLP DOI BibTeX RDF
36	Weijia Shang, Matthew T. O'Keefe, José A. B. Fortes	On Loop Transformations for Generalized Cycle Shrinking.	IEEE Trans. Parallel Distributed Syst.	1994	DBLP DOI BibTeX RDF	generalized cycle shrinking, nested loop structures, selective cycle shrinking, conflict-free mappings, scheduling, parallelism, program compilers, loop transformations, linear scheduling
36	Montse Peiron, Mateo Valero, Eduard Ayguadé	Synchronized access to streams in SIMD vector multiprocessors.	International Conference on Supercomputing	1994	DBLP DOI BibTeX RDF	SIMD vector multiprocessors, multi-module memories, vectors with constant stride, interconnection networks, conflict-free access
36	Kichul Kim, Viktor K. Prasanna	Latin Squares for Parallel Array Access.	IEEE Trans. Parallel Distributed Syst.	1993	DBLP DOI BibTeX RDF	parallel array access, perfect latin squares, skewing functions, self-routing Benes networks, shared memory systems, storage management, multiprocessorinterconnection networks, conflict free access, skewing scheme, parallel memory system
36	Svetlana P. Kartashev, Steven I. Kartashev	Conflict-free memory allocation for associative data files.	AFIPS National Computer Conference	1983	DBLP DOI BibTeX RDF
34	Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky	Weakening the online adversary just enough to get optimal conflict-free colorings for intervals.	SPAA	2007	DBLP DOI BibTeX RDF	online algorithms, coloring, cellular networks, frequency assignment, conflict free
34	Noga Alon, Shakhar Smorodinsky	Conflict-free colorings of shallow discs.	SCG	2006	DBLP DOI BibTeX RDF	conflict-free coloring, wireless, combinatorics, frequency-assignment
34	André Seznec, Roger Espasa	Conflict-Free Accesses to Strided Vectors on a Banked Cache.	IEEE Trans. Computers	2005	DBLP DOI BibTeX RDF	Vector microprocessor, strided vectors, conflict free access, L2 caches
34	Mateo Valero, Tomás Lang, Montse Peiron, Eduard Ayguadé	Conflict-Free Access for Streams in Multimodule Memories.	IEEE Trans. Computers	1995	DBLP DOI BibTeX RDF	decoupled access, multimodule memories, out-of-order access, streams with constant strides, vector processors, Conflict-free access, storage schemes
34	David T. Harper III, Darel A. Linebarger	Conflict-Free Vector Access Using a Dynamic Storage Scheme.	IEEE Trans. Computers	1991	DBLP DOI BibTeX RDF	conflict free vector access, dynamic storage, constant stride, row rotation, performance evaluation, parallel architectures, memory, storage management, accessing patterns
34	Vincenzo Auletta, Sajal K. Das 0001, Amelia De Vivo, Maria Cristina Pinotti, Vittorio Scarano	Optimal Tree Access by Elementary and Composite Templates in Parallel Memory Systems.	IEEE Trans. Parallel Distributed Syst.	2002	DBLP DOI BibTeX RDF	complete trees, composite templates, elementary templates, mapping scheme, conflict-free access, parallel memory system
32	Tadayuki Sakakibara, Katsuyoshi Kitai, Tadaaki Isobe, Shigeko Yazawa, Teruo Tanaka, Yasuhiro Inagami, Yoshiko Tamaki	Scalable Parallel Memory Architecture with a Skew Scheme.	International Conference on Supercomputing	1993	DBLP DOI BibTeX RDF	ILLIAC IV
30	Jirí Jaros, Vaclav Dvorak	Evolutionary-based conflict-free scheduling of collective communications on spidergon NoCs.	GECCO	2010	DBLP DOI BibTeX RDF	fat topologies, spidergon, collective communications, wormhole switching, evolutionary design, communication scheduling
30	Joseph Wun-Tat Chan, Francis Y. L. Chin, Xiangyu Hong, Hing-Fung Ting	Dynamic Offline Conflict-Free Coloring for Unit Disks.	WAOA	2008	DBLP DOI BibTeX RDF
30	Azzedine Boukerche, Raed Al-Shaikh	Towards Building a Fault Tolerant and Conflict-Free Distributed File System for Mobile Clients.	AINA (2)	2006	DBLP DOI BibTeX RDF
30	Amos Fiat, Meital Levy, Jirí Matousek 0001, Elchanan Mossel, János Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner 0001, Emo Welzl	Online conflict-free coloring for intervals.	SODA	2005	DBLP BibTeX RDF
30	Sariel Har-Peled, Shakhar Smorodinsky	On conflict-free coloring of points and simple regions in the plane.	SCG	2003	DBLP DOI BibTeX RDF	coloring, cellular network, frequency assignment
30	Zurab Khasidashvili, John R. W. Glauert	Relating Conflict-Free Stable Transition and Event Models (Extended Abstract).	MFCS	1997	DBLP DOI BibTeX RDF
30	Sibsankar Haldar, P. S. Subramanian	Space-optimum Conflict-free Construction of 1-Writer 1-Reader Multivalued Atomic Variable.	WDAG	1994	DBLP DOI BibTeX RDF
30	Chang-Biau Yang, Richard C. T. Lee, Wen-Tsuen Chen	Conflict-Free Sorting Algorithms Under Single-Channel and Multi-Channel Broadcast Communication Models.	ICCI	1991	DBLP DOI BibTeX RDF
30	Tae Won Cho, Sam S. Pyo, J. Robert Heath	PARALLEX: a parallel approach to switchbox routing.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1994	DBLP DOI BibTeX RDF
28	Michal Debski, Jakub Przybylo	Conflict-free chromatic number versus conflict-free chromatic index.	J. Graph Theory	2022	DBLP DOI BibTeX RDF
28	Ke Chen 0006	How to play a coloring game against a color-blind adversary.	SCG	2006	DBLP DOI BibTeX RDF	conflict-free coloring, online algorithm
28	Gennady Veselovsky, Dobri Atanassov Batovski	A Study of the Permutation Capability of a Binary Hypercube under Deterministic Dimension-order Routing.	PDP	2003	DBLP DOI BibTeX RDF	binary hypercube, conflict-free routing, permutation capability, dimension-order routing
28	Wai Yin Mok	A Comparative Study of Various Nested Normal Forms.	IEEE Trans. Knowl. Data Eng.	2002	DBLP DOI BibTeX RDF	nested relation schemes, nested database schemes, nested databases, nested normal forms, conflict-free sets of MVDs, acyclic database schemes, nested database design, design flexibility, algorithms, object-relational databases, nested relations, data redundancy, object-relational database management systems, SQL:1999
28	Sartaj Sahni, Kun Suk Kim, Haibin Lu	Data Structures For One-Dimensional Packet Classification Using Most-Specific-Rule Matching.	ISPAN	2002	DBLP DOI BibTeX RDF	router tables, most-specific-range matching, conflict-free ranges, static and dynamic rule tables, Packet classification, packet routing, longest-prefix matching
28	Bülent Abali, Füsun Özgüner, Abdulla Bataineh	Balanced Parallel Sort on Hypercube Multiprocessors.	IEEE Trans. Parallel Distributed Syst.	1993	DBLP DOI BibTeX RDF	parallel selection algorithm, conflict-free routing, 16-node hypercube, hypercubenetworks, parallel algorithms, computational complexity, hypercube, sorting, parallel sort, hypercube multiprocessors
28	Kevin Donovan	Performance of Shared Memory in a Parallel Computer.	IEEE Trans. Parallel Distributed Syst.	1991	DBLP DOI BibTeX RDF	memory queues, performance evaluation, parallel computer, parallel architectures, shared memory, hashing, file organisation, queue length, conflict-free
28	David T. Harper III	Block, Multistride Vector, and FFT Accesses in Parallel Memory Systems.	IEEE Trans. Parallel Distributed Syst.	1991	DBLP DOI BibTeX RDF	dynamic storage schemes, parallel memory performance, vectoraccesses, block accesses, constant-geometry FFT accesses, linear addresstransformations, XOR schemes, analytical results, bufferingeffects, pipelined memory systems, memory bank cycle time, fastFourier transforms, fast Fourier transform, memory architecture, quantitative analysis, conflict-free access
28	Rong-Lei Sun	Conflict-Free Incremental Learning.	ICIC (2)	2009	DBLP DOI BibTeX RDF	Incremental induction, Machine learning, Artificial intelligence, Boolean algebra
28	Chi-Lan Chang, Yun-Peng Chiu, Chin-Laung Lei	Automatic Generation of Conflict-Free IPsec Policies.	FORTE	2005	DBLP DOI BibTeX RDF
28	Ayoub Insa Corréa, André Langevin, Louis-Martin Rousseau	Dispatching and Conflict-Free Routing of Automated Guided Vehicles: A Hybrid Approach Combining Constraint Programming and Mixed Integer Programming.	CPAIOR	2004	DBLP DOI BibTeX RDF	material handling systems, routing, constraint programming, hybrid model, Automated guided vehicles
24	Mikko Alutoin, Pertti Raatikainen	Diagonal Tuple Space Search in Two Dimensions.	NETWORKING	2004	DBLP DOI BibTeX RDF
24	Li-Yan Yuan, Z. Meral Özsoyoglu	Logical Design of Relational Database Systems.	PODS	1987	DBLP DOI BibTeX RDF
24	Dor Atzmon, Ariel Felner, Jiaoyang Li 0001, Shahaf S. Shperberg, Nathan R. Sturtevant, Sven Koenig	Conflict-tolerant and conflict-free multi-agent meeting.	Artif. Intell.	2023	DBLP DOI BibTeX RDF
24	Yuchen Pan, Guanchu Wang, Yubo Zhang, Jingyin Tang, Chen Gong 0001, Zhengyuan Xu	Graph-based conflict-free MAC protocol and conflict analysis for a two-layer ultraviolet communication network.	J. Opt. Commun. Netw.	2023	DBLP DOI BibTeX RDF
24	Tanja Ertl, Margarita Grinko, Konstantin Aal	Human-Wildlife Conflict Mitigation on the Ground: Present and Future Scenarios of Conflict-free Environments!?	NatureHCI@CHItaly	2021	DBLP BibTeX RDF
24	Zheng Zhang 0015, Qing Guo, Peijiang Yuan	Conflict-free route planning of automated guided vehicles based on conflict classification.	SMC	2017	DBLP DOI BibTeX RDF
24	Ofer Arieli	Conflict-free and conflict-tolerant semantics for constrained argumentation frameworks.	J. Appl. Log.	2015	DBLP DOI BibTeX RDF
22	Panagiotis Cheilaris, Shakhar Smorodinsky, Marek Sulovský	The potential to improve the choice: list conflict-free coloring for geometric hypergraphs.	SCG	2011	DBLP DOI BibTeX RDF
22	Adriaan ter Mors, Cees Witteveen	Plan Repair in Conflict-Free Routing.	IEA/AIE	2009	DBLP DOI BibTeX RDF
22	Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky	Online Conflict-Free Colorings for Hypergraphs.	ICALP	2007	DBLP DOI BibTeX RDF
22	Bin Zhang 0007, Ehab Al-Shaer, Radha Jagadeesan, James Riely, Corin Pitcher	Specifications of a high-level conflict-free firewall policy language for multi-domain networks.	SACMAT	2007	DBLP DOI BibTeX RDF	firewall, policy language, conflicts free
22	Sudath Indrasinghe, Rubem Pereira, John Haggerty	Conflict Free Address Allocation Mechanism for Mobile Ad Hoc Networks.	AINA Workshops (1)	2007	DBLP DOI BibTeX RDF
22	Octav Chipara, Chenyang Lu 0001, John A. Stankovic	Dynamic Conflict-free Query Scheduling for Wireless Sensor Networks.	ICNP	2006	DBLP DOI BibTeX RDF
22	Rolf H. Möhring, Ekkehard Köhler, Ewgenij Gawrilow, Björn Stenzel	Conflict-free Real-time AGV Routing.	OR	2004	DBLP DOI BibTeX RDF
22	Chung Keung Poon, Andy Kwok	Space Optimal Packet Classification for 2-d Conflict-free Filters.	ISPAN	2004	DBLP DOI BibTeX RDF
22	Jarmo Takala, Tuomas Järvinen, Harri Sorokin	Conflict-free parallel memory access scheme for FFT processors.	ISCAS (4)	2003	DBLP DOI BibTeX RDF
22	Zurab Khasidashvili, John R. W. Glauert	Stable Computational Semantics of Conflict-Free Rewrite Systems (Partial Orders with Duplication).	RTA	2003	DBLP DOI BibTeX RDF
22	Mogens Nielsen, P. S. Thiagarajan	Regular Event Structures and Finite Petri Nets: The Conflict-Free Case.	ICATPN	2002	DBLP DOI BibTeX RDF
22	Guy Even, Zvi Lotker, Dana Ron, Shakhar Smorodinsky	Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks.	FOCS	2002	DBLP DOI BibTeX RDF
22	Alan A. Bertossi, Maria Cristina Pinotti	Mappings for Conflict-Free Access of Paths in Elementary Data Structures.	COCOON	2000	DBLP DOI BibTeX RDF
22	Khaled A. Aly	Conflict-Free Channel Assignment for an Optical Cluster-Based Shuffle Network Configuration.	SIGCOMM	1994	DBLP DOI BibTeX RDF
22	Hong Cai, Ralph H. J. M. Otten	Conflict-free channel definition in building-block layout.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1989	DBLP DOI BibTeX RDF
22	Rodney R. Howell, Louis E. Rosier	Completeness Rules for Reachability, Containment, and Equivalence, with Respect to Conflict-Free Vector Replacement Systems.	ICALP	1987	DBLP DOI BibTeX RDF
20	Marceau Coupechoux, Bruno Baynat, Christian Bonnet, Vinod Kumar	CROMA - An Enhanced Slotted MAC Protocol for MANETs.	Mob. Networks Appl.	2005	DBLP DOI BibTeX RDF	conflict-free protocol, dynamic slot allocation, scheduling, mobile ad hoc networks, MAC, TDMA
20	Jarno K. Tanskanen, Reiner Creutzburg, Jarkko Niittylahti	On Design of Parallel Memory Access Schemes for Video Coding.	J. VLSI Signal Process.	2005	DBLP DOI BibTeX RDF	parallel memory access, SIMD memory architecture, video coding, MPEG-4, H.263, subword parallelism, conflict-free access, storage scheme, skewing scheme, data alignment
20	Jong Won Park	Multiaccess Memory System for Attached SIMD Computer.	IEEE Trans. Computers	2004	DBLP DOI BibTeX RDF	prime memory system, multiaccess memory system, conflict-free memory system, routing circuit, SIMD computer, address calculation
20	Pen-Yuang Chang, Jong-Chuang Tsay	An Approach to Designing Modular Extensible Linear Arrays for Regular Algorithms.	IEEE Trans. Computers	1998	DBLP DOI BibTeX RDF	conflict-free mapping, modular extensible, optimal spacetime mapping, regular algorithm, unimodular matrix, VLSI, systolic array, data dependency, linear array, Algorithm transformation
20	Ashoke Deb	Multiskewing-A Novel Technique for Optimal Parallel Memory Access.	IEEE Trans. Parallel Distributed Syst.	1996	DBLP DOI BibTeX RDF	pipelined/vector processors, linear schemes, memory bank conflict, memory bandwidth, periodic, matrix computation, conflict-free access, Interleaved memory, skewing schemes
20	Myung K. Yang, Chita R. Das	Evaluation of a Parallel Branch-and-Bound Algorithm on a Class of Multiprocessors.	IEEE Trans. Parallel Distributed Syst.	1994	DBLP DOI BibTeX RDF	parallel branch-and-bound algorithm, MIN-based multiprocessorsystems, serial best-first search, conflict-free mapping scheme, performance evaluation, parallel algorithms, multiprocessor interconnection networks, multiprocessing systems, probabilistic model, communication overheads, computation overheads
20	Philip J. Bernhard	Bounds on the Performance of Message Routing Heuristics.	IEEE Trans. Computers	1993	DBLP DOI BibTeX RDF	message routing heuristics, communication conflicts, minimum round partitioning problem, performance evaluation, performance, computational complexity, heuristics, lower bounds, message passing, multiprocessor interconnection networks, upper bounds, network routing, omega network, message patterns, conflict-free
20	Nobuo Funabiki, Yoshiyasu Takefuji, Kuo Chun Lee	Comparisons of Seven Neural Network Models on Traffic Control Problems in Multistage Interconnection Networks.	IEEE Trans. Computers	1993	DBLP DOI BibTeX RDF	traffic control problems, decay term, conflict-free switching configurations, hysteresis McCullock-Pitts neuron model, parallel algorithms, heuristics, multiprocessor interconnection networks, neural nets, multistage interconnection networks, simulation results, neural network models, neuron models
20	Tzong-An Su, Gultekin Özsoyoglu	Controlling FD and MVD Inferences in Multilevel Relational Database Systems.	IEEE Trans. Knowl. Data Eng.	1991	DBLP DOI BibTeX RDF	FD inferences, attribute classification, MVD inferences, multilevel relational database, record classification, FD-compromises, minimum information loss, MVD-compromises, conflict-free MVDs, computational complexity, relational databases, database theory, inference mechanisms, functional dependencies, NP-complete problem, exact algorithm, necessary and sufficient conditions, multivalued dependencies
20	Israel Cidon, Moshe Sidi	Distributed Assignment Algorithms for Multihop Packet Radio Networks.	IEEE Trans. Computers	1989	DBLP DOI BibTeX RDF	multihop packet radio networks, distributed dynamic channel assignment, conflict-free transmissions, control segment, transmission segment, packet switching, time-division multiple access, radio networks
20	Harry A. G. Wijshoff, Jan van Leeuwen	On Linear Skewing Schemes and d-Ordered Vectors.	IEEE Trans. Computers	1987	DBLP DOI BibTeX RDF	d-ordered vectors, linear skewing schemes, SIMD machines, Conflict-free access, parallel memories, two-dimensional arrays
20	Duncan H. Lawrie, Chandra R. Vora	The Prime Memory System for Array Access.	IEEE Trans. Computers	1982	DBLP DOI BibTeX RDF	SIMD computer memory, Array access, Burroughs Scientific Processor (BSP) conflict-free array memory, memory system, parallel computer system
19	Reza Mahjourian, Feng Chen 0011, Ravi Tiwari, My T. Thai, Hongqiang Zhai, Yuguang Fang	An approximation algorithm for conflict-aware broadcast scheduling in wireless ad hoc networks.	MobiHoc	2008	DBLP DOI BibTeX RDF	conflict-aware, approximation algorithm, wireless networks, broadcast scheduling
19	Quanbao Sun, Liquan Xiao, Minxuan Zhang	Look-Ahead Adaptive Routing on k -Ary n -Trees.	APPT	2007	DBLP DOI BibTeX RDF
19	Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew	Conflict-Free Coloring on Claw-Free Graphs and Interval Graphs.	MFCS	2022	DBLP DOI BibTeX RDF
19	Matthieu Nicolas	Ré-identification sans coordination dans les types de données répliquées sans conflits (CRDTs). (Coordination-free re-identification in Conflict-free Replicated Data Types (CRDTs)).		2022	RDF
19	Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew	Conflict-free coloring on open neighborhoods of claw-free graphs.	CoRR	2021	DBLP BibTeX RDF
19	Abdelmadjid Bouabdallah, Hicham Lakhlef, Michel Raynal, François Taïani	Providing Collision-Free and Conflict-Free Communication in General Synchronous Broadcast/Receive Networks.	AINA	2017	DBLP DOI BibTeX RDF
16	Adriaan ter Mors, Jeroen van Belle, Cees Witteveen	Context-aware multi-stage routing.	AAMAS (1)	2009	DBLP BibTeX RDF	multi-stage routing, agents
16	Yi-Sheng Su, Szu-Lin Su, Jung-Shian Li	Topology-Independent Link Activation Scheduling Schemes for Mobile CDMA Ad Hoc Networks.	IEEE Trans. Mob. Comput.	2008	DBLP DOI BibTeX RDF	Medium access control (MAC) protocols, Topology-independent scheduling, Link activation scheduling, Group divisible (GD) designs, Quality-of-service (QoS), Ad hoc networks, Code-division multiple-access (CDMA)
16	Stijn B. J. Van Dam, Max Mulder, M. M. van Paassen	Ecological Interface Design of a Tactical Airborne Separation Assistance Tool.	IEEE Trans. Syst. Man Cybern. Part A	2008	DBLP DOI BibTeX RDF
16	Yalin Evren Sagduyu, Anthony Ephremides	On Joint MAC and Network Coding in Wireless Ad Hoc Networks.	IEEE Trans. Inf. Theory	2007	DBLP DOI BibTeX RDF