Search results for "red-black"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
101	Helen Cameron, Derick Wood	How Costly Can Red-Black Trees Be?	ICCI	1991	DBLP DOI BibTeX RDF
96	Joaquim Gabarró, Xavier Messeguer, Daniel Riu	Concurrent Rebalancing on HyperRed-Black Trees.	SCCC	1997	DBLP DOI BibTeX RDF	concurrent rebalancing, HyperRed-Black trees, consecutive red nodes, Chromatic trees, red nodes, concurrent deletions algorithm, concurrent insertions, direct updating, red cluster, trees (mathematics), deletions
94	Paul T. Darga, Chandrasekhar Boyapati	Efficient software model checking of data structure properties.	OOPSLA	2006	DBLP DOI BibTeX RDF	program analysis, software model checking
76	Yuqing He, Huan He, Hongying Yang	Method of Face Recognition Based on Red-Black Wavelet Transform and PCA.	ICIC (1)	2008	DBLP DOI BibTeX RDF	Red-black wavelet transform, Improved histogram equalization, Face recognition, PCA
63	Jumat Sulaiman, Mohamed Othman, Mohammad Khatim Hasan	Red-Black Half-Sweep Iterative Method Using Triangle Finite Element Approximation for 2D Poisson Equations.	International Conference on Computational Science (1)	2007	DBLP DOI BibTeX RDF	Half-sweep Iteration, Red-Black Ordering, Galerkin Scheme, Triangle Element
63	Jumat Sulaiman, Mohamed Othman, Mohammad Khatim Hasan	Red-Black EDG SOR Iterative Method Using Triangle Element Approximation for 2D Poisson Equations.	ICCSA (3)	2007	DBLP DOI BibTeX RDF	Explicit Decoupled Group, Red-Black Ordering, Galerkin Scheme, Triangle Element
63	Willem Visser, Corina S. Pasareanu, Radek Pelánek	Test input generation for red-black trees using abstraction.	ASE	2005	DBLP DOI BibTeX RDF	testing object oriented programs, model checking, abstraction, coverage, red-black trees
61	Sabine Hanke	The Performance of Concurrent Red-Black Tree Algorithms.	WAE	1999	DBLP BibTeX RDF
56	Christian Icking, Rolf Klein, Thomas Ottmann	Priority Search Trees in Secondary Memory (Extended Abstract).	WG	1987	DBLP DOI BibTeX RDF	priority search tree, B-tree, search trees, red-black tree, secondary memory
48	Willem Visser, Corina S. Pasareanu, Sarfraz Khurshid	Test input generation with java PathFinder.	ISSTA	2004	DBLP DOI BibTeX RDF	testing object-oriented programs, model checking, coverage, symbolic execution, red-black trees
47	Takeshi Iwashita, Masaaki Shimasaki	Block Red-Black Ordering Method for Parallel Processing of ICCG Solver.	ISHPC	2002	DBLP DOI BibTeX RDF
43	Norma Alias, Roziha Darwis, Noriza Satam, Mohamed Othman	Parallelization of Temperature Distribution Simulations for Semiconductor and Polymer Composite Material on Distributed Memory Architecture.	PaCT	2009	DBLP DOI BibTeX RDF	Red-Black Gauss Seidel (RBGS), Parallel Performance evaluations, Parallel Virtual Machine (PVM)
43	Chris Okasaki	Alternatives to two classic data structures.	SIGCSE	2005	DBLP DOI BibTeX RDF	leftist heaps, maxiphobic heaps, red-black trees
41	Seyfeddine Zouana, Djamel Eddine Zegour	Red Green Black Trees: Extension to Red Black Trees.	J. Comput.	2018	DBLP DOI BibTeX RDF
40	Dibyendu Das 0001, Madhavi Valluri, Michael Wong, Chris Cambly	Speeding up STL Set/Map Usage in C++ Applications.	SIPEW	2008	DBLP DOI BibTeX RDF
40	Dan Wallin, Henrik Löf, Erik Hagersten, Sverker Holmgren	Multigrid and Gauss-Seidel smoothers revisited: parallelization on chip multiprocessors.	ICS	2006	DBLP DOI BibTeX RDF	Gauss-Seidel, temporal blocking, CMP, OpenMP, relaxation, orderings, multigrid, Poisson equation, cache blocking
40	Peter Habermehl, Radu Iosif, Tomás Vojnar	Automata-Based Verification of Programs with Tree Updates.	TACAS	2006	DBLP DOI BibTeX RDF
34	Sarat C. Maruvada, Karthik Krishnamoorthy, Subodh Annojvala, Florin Balasa	Placement with symmetry constraints for analog layout using red-black trees.	ISCAS (5)	2003	DBLP DOI BibTeX RDF
34	Sabine Hanke, Eljas Soisalon-Soininen	Group Updates for Red-Black Trees.	CIAC	2000	DBLP DOI BibTeX RDF
34	Sabine Hanke, Thomas Ottmann, Eljas Soisalon-Soininen	Relaxed Balanced Red-Black Trees.	CIAC	1997	DBLP DOI BibTeX RDF
32	Daxin Zhu, Yingjie Wu, Lei Wang 0010, Xiaodong Wang 0003	A note on the largest number of red nodes in red-black trees.	J. Discrete Algorithms	2017	DBLP DOI BibTeX RDF
32	Yingjie Wu, Daxin Zhu, Lei Wang 0010, Xiaodong Wang 0003	A note on the largest number of red nodes in red-black trees.	CoRR	2014	DBLP BibTeX RDF
29	Kennedy E. Ehimwenma, Junfeng Wang, Ze Zheng, Hongyu Zhou	A symbolic-arithmetic for teaching double-black node removal in red-black trees.	CoRR	2023	DBLP DOI BibTeX RDF
29	Mohsen Ghaffari 0001, Behnoosh Hariri, Shervin Shirmohammadi	A delaunay triangulation architecture supporting churn and user mobility in MMVEs.	NOSSDAV	2009	DBLP DOI BibTeX RDF	MMVE, red-black, voroni diagram, mobility, peer to peer, delaunay triangulation, churn
29	Adam Berry, Peter Vamplew 0001	An efficient approach to unbounded bi-objective archives -: introducing the mak_tree algorithm.	GECCO	2006	DBLP DOI BibTeX RDF	bi-objective, dual-objective, data structures, archives, multiobjective, red-black trees, multi-criteria, balanced trees
29	Sartaj Sahni, Kun Suk Kim	An O(log n) Dynamic Router-Table Design.	IEEE Trans. Computers	2004	DBLP DOI BibTeX RDF	Packet routing, longest matching prefix, red-black trees
29	Ben Pfaff	Performance analysis of BSTs in system software.	SIGMETRICS	2004	DBLP DOI BibTeX RDF	threaded tree, binary search tree, AVL tree, red-black tree, BST, splay tree
29	Sartaj Sahni, Kun Suk Kim	O(log n) dynamic packet routing.	ISCC	2002	DBLP DOI BibTeX RDF	Packet routing, longest matching prefix, red-black trees
27	Bernhard Haeupler, Siddhartha Sen 0001, Robert Endre Tarjan	Rank-Balanced Trees.	WADS	2009	DBLP DOI BibTeX RDF
27	Xiaojia Xiang, Jiwu Shu, Wei Xue, Weimin Zheng	Design and Implementation of an Efficient Multi-version File System.	IEEE NAS	2007	DBLP DOI BibTeX RDF
27	Zohar Manna, Henny B. Sipma, Ting Zhang 0001	Verifying Balanced Trees.	LFCS	2007	DBLP DOI BibTeX RDF
27	Thomas Ottmann, Derick Wood	How to Update a Balanced Binary Tree with a Constant Number of Rotations.	SWAT	1990	DBLP DOI BibTeX RDF
21	Sergey Bereg	Certifying and constructing minimally rigid graphs in the plane.	SCG	2005	DBLP DOI BibTeX RDF	Henneberg construction, rigidity theory, computational geometry, tree decomposition, pseudo-triangulation
21	Rose Rani John, E. Grace Mary Kanaga, Jeno Lovesum, S. G. Sandeep	An Enhanced Approximation Algorithm Using Red Black Tree and HashMap for Virtual Machine Placement Problem.	SN Comput. Sci.	2024	DBLP DOI BibTeX RDF
21	Yuan Xu, Siu-Long Lei, Hai-Wei Sun	An efficient red-black skewed extrapolation cascadic multigrid method for two-dimensional Poisson equation.	Comput. Appl. Math.	2024	DBLP DOI BibTeX RDF
21	Pengfei Guo, Yingjian Yan, Zhongyi Zhao, Lichao Zhang, Chunsheng Zhu, Zibin Dai	R/B-SecArch: A strong isolated SoC architecture based on red/black concept for secure and efficient cryptographic services.	Microelectron. J.	2023	DBLP DOI BibTeX RDF
21	Runming Li, Harrison Grodin, Robert Harper 0001	A Verified Cost Analysis of Joinable Red-Black Trees.	CoRR	2023	DBLP DOI BibTeX RDF
21	Cameron Moy	Faster, Simpler Red-Black Trees.	TFP	2023	DBLP DOI BibTeX RDF
21	Longxia Huang, Xi Peng, Mengmeng Yang	Secure and dynamic public audit scheme based on blockchain and red-black tree.	ICPADS	2023	DBLP DOI BibTeX RDF
21	Sergey Bereg, Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni, Binhai Zhu	Red-Black Spanners for Mixed-Charging Vehicular Networks.	COCOON (1)	2023	DBLP DOI BibTeX RDF
21	Azali Saudi, A'qilah Ahmad Dahalan	An Efficient Red-Black Skewed Modified Accelerated Arithmetic Mean Iterative Method for Solving Two-Dimensional Poisson Equation.	Symmetry	2022	DBLP DOI BibTeX RDF
21	Thiago Henrique Barbosa de Carvalho Tavares, Bruno Pérez Ferreira, Eduardo Mazoni Andrade Marçal Mendes	Fuzzy time series model based on red-black trees for stock index forecasting.	Appl. Soft Comput.	2022	DBLP DOI BibTeX RDF
21	Lynda Bounif, Djamel Eddine Zegour	A revisited representation of the red-black tree.	Int. J. Comput. Aided Eng. Technol.	2022	DBLP DOI BibTeX RDF
21	Gerhard Schellhorn, Stefan Bodenmüller, Martin Bitterlich, Wolfgang Reif	Separating Separation Logic - Modular Verification of Red-Black Trees.	VSTTE	2022	DBLP DOI BibTeX RDF
21	Yung-Feng Lu, Hung-Ming Chen, Chang-Wei Chen, Hsueh-Wen Tseng, Chin-Fu Kuo	Red-black tree I/O management of solid state disk with elastic striping design.	RACS	2022	DBLP DOI BibTeX RDF
21	Zhenpeng Liu, Yi Liu, Xianwei Yang, Xiaofei Li	Integrity Auditing for Multi-Copy in Cloud Storage Based on Red-Black Tree.	IEEE Access	2021	DBLP DOI BibTeX RDF
21	Akemi Shioya, Yusaku Yamamoto	Block red-black MILU(0) preconditioner with relaxation on GPU.	Parallel Comput.	2021	DBLP DOI BibTeX RDF
21	Alberto Boffi	An efficient way to manage blocks of data with Wise Red-Black Trees.	CoRR	2021	DBLP BibTeX RDF
21	Behnam Bozorgmehr, Pete Willemsen 0001, Jeremy A. Gibbs, Rob Stoll, Jae-Jin Kim, Eric R. Pardyjak	Utilizing dynamic parallelism in CUDA to accelerate a 3D red-black successive over relaxation wind-field solver.	Environ. Model. Softw.	2021	DBLP DOI BibTeX RDF
21	Mehdi Salehi, Jeremy Clark, Mohammad Mannan	Red-Black Coins: Dai Without Liquidations.	Financial Cryptography Workshops	2021	DBLP DOI BibTeX RDF
21	Lukas Armborst, Marieke Huisman	Permission-Based Verification of Red-Black Trees and Their Merging.	FormaliSE@ICSE	2021	DBLP DOI BibTeX RDF
21	Daniel Fiser, Daniel Gnad 0001, Michael Katz 0001, Jörg Hoffmann 0001	Custom-Design of FDR Encodings: The Case of Red-Black Planning.	IJCAI	2021	DBLP DOI BibTeX RDF
21	Ruitian Li, Liang Gong, Ming-hai Xu	A heterogeneous parallel Red-Black SOR technique and the numerical study on SIMPLE.	J. Supercomput.	2020	DBLP DOI BibTeX RDF
21	Kamaledin Ghiasi-Shirazi, Taraneh Ghandi, Ali Taghizadeh, Ali Rahimi-Baigi	A Pedagogically Sound yet Efficient Deletion algorithm for Red-Black Trees: The Parity-Seeking Delete Algorithm.	CoRR	2020	DBLP BibTeX RDF
21	Thorsten Schütt, Florian Schintke, Jan Skrzypczak	Transactions on Red-black and AVL trees in NVRAM.	CoRR	2020	DBLP BibTeX RDF
21	Bibin Johnson, Sachin Thomas, J. Sheeba Rani	A High-Performance Dense Optical Flow Architecture Based on Red-Black SOR Solver.	J. Signal Process. Syst.	2020	DBLP DOI BibTeX RDF
21	Ricardo Peña	An Assertional Proof of Red-Black Trees Using Dafny.	J. Autom. Reason.	2020	DBLP DOI BibTeX RDF
21	Amr Elmasry, Mostafa Kahla, Fady Ahdy, Mahmoud Hashem	Red-black trees with constant update time.	Acta Informatica	2019	DBLP DOI BibTeX RDF
21	Seyfeddine Zouana, Djamel Eddine Zegour	Partitioned Binary Search Trees: A Generalization of Red Black Trees.	Computación y Sistemas	2019	DBLP DOI BibTeX RDF
21	Lynda Bounif, Djamel Eddine Zegour	Toward a Unique Representation for AVL and Red-Black Trees.	Computación y Sistemas	2019	DBLP DOI BibTeX RDF
21	Sergio Sainz-Palacios	Flat combined Red Black Trees.	CoRR	2019	DBLP BibTeX RDF
21	William R. Arellano, Paul A. Silva, Maria F. Molina, Saulo Ronquillo, Francisco Ortega-Zamorano	Red-Black Tree Based NeuroEvolution of Augmenting Topologies.	IWANN (2)	2019	DBLP DOI BibTeX RDF
21	Chun Wai Liew, Huy Nguyen	Using an Intelligent Tutoring System to Teach Red Black Trees.	SIGCSE	2019	DBLP DOI BibTeX RDF
21	Michael Katz 0001	Red-Black Heuristics for Planning Tasks with Conditional Effects.	AAAI	2019	DBLP DOI BibTeX RDF
21	Amr Elmasry, Mostafa Kahla, Fady Ahdy, Mahmoud Hashem	Red-Black Trees with Constant Update Time.	CoRR	2018	DBLP BibTeX RDF
21	Pontus Pall, Oskar Nylén, Marco Fratarcangeli	Fast Quadrangular Mass-Spring Systems using Red-Black Ordering.	VRIPHYS	2018	DBLP DOI BibTeX RDF
21	Maximilian Fickert, Daniel Gnad 0001, Jörg Hoffmann 0001	Unchaining the Power of Partial Delete Relaxation, Part II: Finding Plans with Red-Black State Space Search.	IJCAI	2018	DBLP DOI BibTeX RDF
21	Jaber J. Hasbestan, Inanc Senocak	A short note on the use of the red-black tree in Cartesian adaptive mesh refinement algorithms.	J. Comput. Phys.	2017	DBLP DOI BibTeX RDF
21	Claire Dross, Yannick Moy	Auto-Active Proof of Red-Black Trees in SPARK.	NFM	2017	DBLP DOI BibTeX RDF
21	Patrick Speicher, Marcel Steinmetz, Daniel Gnad 0001, Jörg Hoffmann 0001, Alfonso Gerevini	Beyond Red-Black Planning: Limited-Memory State Variables.	ICAPS	2017	DBLP BibTeX RDF
21	Dimitris Siakavaras, Konstantinos Nikas, Georgios I. Goumas, Nectarios Koziris	Massively Concurrent Red-Black Trees with Hardware Transactional Memory.	PDP	2016	DBLP DOI BibTeX RDF
21	Daniel Gnad 0001, Marcel Steinmetz, Mathäus Jany, Jörg Hoffmann 0001, Ivan Serina, Alfonso Gerevini	Partial Delete Relaxation, Unchained: On Intractable Red-Black Planning and Its Applications.	SOCS	2016	DBLP DOI BibTeX RDF
21	Ren-Song Ko	Atomic Red-Black Distributed Gauss-Seidel Routing Algorithm for Wireless Sensor Networks.	NaNA	2016	DBLP DOI BibTeX RDF
21	Carmel Domshlak, Jörg Hoffmann 0001, Michael Katz 0001	Red-black planning: A new systematic approach to partial delete relaxation.	Artif. Intell.	2015	DBLP DOI BibTeX RDF
21	Marcos Dias de Assunção	Enhanced Red-Black-Tree Data Structure for Facilitating the Scheduling of Reservations.	CoRR	2015	DBLP BibTeX RDF
21	Chun W. Liew, Franceska Xhakaj	Teaching a Complex Process: Insertion in Red Black Trees.	AIED	2015	DBLP DOI BibTeX RDF
21	Franceska Xhakaj, Chun W. Liew	A New Approach To Teaching Red Black Tree.	ITiCSE	2015	DBLP DOI BibTeX RDF
21	Daniel Gnad 0001, Jörg Hoffmann 0001	Red-Black Planning: A New Tractability Analysis and Heuristic Function.	SOCS	2015	DBLP DOI BibTeX RDF
21	Mike Holenderski, Reinder J. Bril, Johan J. Lukkien	Red-black trees with relative node keys.	Inf. Process. Lett.	2014	DBLP DOI BibTeX RDF
21	Philip W. Howard, Jonathan Walpole	Relativistic red-black trees.	Concurr. Comput. Pract. Exp.	2014	DBLP DOI BibTeX RDF
21	Yongxiang Liu, Xuejun Xu	A Robin-type Domain Decomposition Method with Red-Black Partition.	SIAM J. Numer. Anal.	2014	DBLP DOI BibTeX RDF
21	Qingjie Liu, Yunhong Wang, Zhaoxiang Zhang 0001, Lining Liu	Pan-sharpening based on weighted red black wavelets.	IET Image Process.	2014	DBLP DOI BibTeX RDF
21	M. Alexandre Carbon, Yves Lhuillier, Henri-Pierre Charles	Hardware Acceleration of Red-Black Tree Management and Application to Just-In-Time Compilation.	J. Signal Process. Syst.	2014	DBLP DOI BibTeX RDF
21	Kimball Germane, Matthew Might	Deletion: The curse of the red-black tree.	J. Funct. Program.	2014	DBLP DOI BibTeX RDF
21	Otakar Trunda, Roman Barták	Determining a Proper Initial Configuration of Red-Black Planning by Machine Learning.	MetaSel@ECAI	2014	DBLP BibTeX RDF
21	Elias Konstantinidis, Yiannis Cotronis	Graphics processing unit acceleration of the red/black SOR method.	Concurr. Comput. Pract. Exp.	2013	DBLP DOI BibTeX RDF
21	Juan Besa, Yadran Eterovic	A concurrent red-black tree.	J. Parallel Distributed Comput.	2013	DBLP DOI BibTeX RDF
21	Ipsita Dutta, Rajib Banerjee, Sipra Das Bit	Energy efficient audio compression scheme based on red black wavelet lifting for wireless multimedia sensor network.	ICACCI	2013	DBLP DOI BibTeX RDF
21	Aravind Natarajan, Lee Savoie, Neeraj Mittal	Concurrent Wait-Free Red Black Trees.	SSS	2013	DBLP DOI BibTeX RDF
21	Dmitry Timofeev	Semi-implicit Red/Black Solver for Incompressible Navier-Stokes Equations on GPGPU.	HPCC/EUC	2013	DBLP DOI BibTeX RDF
21	Mahmoud El Maghrbay, Reda A. Ammar, Sanguthevar Rajasekaran	Fast GPU algorithms for implementing the red-black Gauss-Seidel method for Solving Partial Differential Equations.	ISCC	2013	DBLP DOI BibTeX RDF
21	Michael Katz 0001, Jörg Hoffmann 0001, Carmel Domshlak	Red-Black Relaxed Plan Heuristics.	AAAI	2013	DBLP DOI BibTeX RDF
21	Saurav Pandit, Jonathan Koch, Yang Yang 0008, Brian Uzzi, Nitesh V. Chawla	Red Black Network: Temporal and Topological Analysis of Two Intertwined Social Networks.	MILCOM	2013	DBLP DOI BibTeX RDF
21	Michael Katz 0001, Jörg Hoffmann 0001	Red-Black Relaxed Plan Heuristics Reloaded.	SOCS	2013	DBLP DOI BibTeX RDF
21	Italo Epicoco, Silvia Mocavero, Giovanni Aloisio	The performance model for a parallel SOR algorithm using the red-black scheme.	Int. J. High Perform. Syst. Archit.	2012	DBLP DOI BibTeX RDF
21	Prosenjit Bose, Karim Douïeb, Pat Morin	Skip lift: A probabilistic alternative to red-black trees.	J. Discrete Algorithms	2012	DBLP DOI BibTeX RDF
21	Qingjie Liu, Yunhong Wang, Zhaoxiang Zhang 0001, Lining Liu	Pan-sharpening using weighted red-black wavelet.	ICPR	2012	DBLP BibTeX RDF
21	Aravind Natarajan, Lee Savoie, Neeraj Mittal	Brief Announcement: Concurrent Wait-Free Red-Black Trees.	DISC	2012	DBLP DOI BibTeX RDF
21	Masatoshi Kawai, Takeshi Iwashita, Hiroshi Nakashima, Osni Marques	Parallel Smoother Based on Block Red-Black Ordering for Multigrid Poisson Solver.	VECPAR	2012	DBLP DOI BibTeX RDF
21	Svetlana Strbac-Savic, Milo Tomasevic	Comparative performance evaluation of the AVL and red-black trees.	BCI	2012	DBLP DOI BibTeX RDF