Search results for "deque"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
141	David Chase, Yossi Lev	Dynamic circular work-stealing deque.	SPAA	2005	DBLP DOI BibTeX RDF	deque, load balancing, lock-free, work stealing
89	Daouda Traoré, Jean-Louis Roch, Nicolas Maillard, Thierry Gautier, Julien Bernard 0001	Deque-Free Work-Optimal Parallel STL Algorithms.	Euro-Par	2008	DBLP DOI BibTeX RDF
81	Ole Agesen, David Detlefs, Christine H. Flood, Alexander T. Garthwaite, Paul Alan Martin, Mark Moir, Nir Shavit, Guy L. Steele Jr.	DCAS-Based Concurrent Deques.	Theory Comput. Syst.	2002	DBLP DOI BibTeX RDF
81	Holger Petersen 0001	Stacks versus Deques.	COCOON	2001	DBLP DOI BibTeX RDF
81	Ole Agesen, David Detlefs, Christine H. Flood, Alex Garthwaite, Paul Alan Martin, Nir Shavit, Guy L. Steele Jr.	DCAS-based concurrent deques.	SPAA	2000	DBLP DOI BibTeX RDF
68	Seth Pettie	Splay trees, Davenport-Schinzel sequences, and the deque conjecture.	SODA	2008	DBLP BibTeX RDF
61	Rajamani Sundar	Twists, Turns, Cascades, Deque Conjecture, and Scanning Theorem	FOCS	1989	DBLP DOI BibTeX RDF	turns, deque conjecture, scanning theorem, inverse Ackerman bound, binary tree, cascades, splay tree
61	Maurice Herlihy, Victor Luchangco, Mark Moir	Obstruction-Free Synchronization: Double-Ended Queues as an Example.	ICDCS	2003	DBLP DOI BibTeX RDF
61	David Detlefs, Christine H. Flood, Alex Garthwaite, Paul Alan Martin, Nir Shavit, Guy L. Steele Jr.	Even Better DCAS-Based Concurrent Deques.	DISC	2000	DBLP DOI BibTeX RDF
51	Michel Déqué	Global Environment Modelling - Introduction.	Euro-Par	1999	DBLP DOI BibTeX RDF
48	Danny Hendler, Yossi Lev, Mark Moir, Nir Shavit	A dynamic-sized nonblocking work stealing deque.	Distributed Comput.	2006	DBLP DOI BibTeX RDF	Load balancing, Data structures, Concurrent programming, Lock-free, Work stealing
40	Håkan Sundell, Philippas Tsigas	Lock-Free and Practical Doubly Linked List-Based Deques Using Single-Word Compare-and-Swap.	OPODIS	2004	DBLP DOI BibTeX RDF
40	Maged M. Michael	CAS-Based Lock-Free Algorithm for Shared Deques.	Euro-Par	2003	DBLP DOI BibTeX RDF
40	Jyrki Katajainen, Bjarke Buur Mortensen	Experiences with the Design and Implementation of Space-Efficient Deques.	WAE	2001	DBLP DOI BibTeX RDF
28	Jaemin Choi	Formal Verification of Chase-Lev Deque in Concurrent Separation Logic.	CoRR	2023	DBLP DOI BibTeX RDF
28	Michael A. Bekos, Michael Kaufmann 0001, Maria Eleni Pavlidi, Xenia Rieger	On the Deque and Rique Numbers of Complete and Complete Bipartite Graphs.	CoRR	2023	DBLP DOI BibTeX RDF
28	Shalom M. Asbell, Eric Ruppert	A Wait-Free Deque With Polylogarithmic Step Complexity.	OPODIS	2023	DBLP DOI BibTeX RDF
28	Stefano Crespi-Reghizzi, Pierluigi San Pietro	Deque automata, languages, and planar graph representations.	Theor. Comput. Sci.	2020	DBLP DOI BibTeX RDF
28	Suha Orhun Mutluergil, Serdar Tasiran	A mechanized refinement proof of the Chase-Lev deque using a proof system.	Computing	2019	DBLP DOI BibTeX RDF
28	Stefano Crespi-Reghizzi, Pierluigi San Pietro	Deque Languages, Automata and Planar Graphs (text not included).	ICTCS	2019	DBLP BibTeX RDF
28	Stefano Crespi-Reghizzi, Pierluigi San Pietro	Deque languages, automata and planar graphs.	CoRR	2018	DBLP BibTeX RDF
28	Stefano Crespi-Reghizzi, Pierluigi San Pietro	Deque Languages, Automata and Planar Graphs.	DLT	2018	DBLP DOI BibTeX RDF
28	Jianbo Ye	A Faster Drop-in Implementation for Leaf-wise Exact Greedy Induction of Decision Tree Using Pre-sorted Deque.	CoRR	2017	DBLP BibTeX RDF
28	Suha Orhun Mutluergil, Serdar Tasiran	A Mechanized Refinement Proof of the Chase-Lev Deque Using a Proof System.	NETYS	2016	DBLP DOI BibTeX RDF
28	Carlos Ramisch, Alexis Nasr, André Valli, José Deulofeu	DeQue: A Lexicon of Complex Prepositions and Conjunctions in French.	LREC	2016	DBLP BibTeX RDF
28	Parinya Chalermsook, Mayank Goswami 0001, László Kozma 0002, Kurt Mehlhorn, Thatchaphol Saranurak	Greedy Is an Almost Optimal Deque.	CoRR	2015	DBLP BibTeX RDF
28	Parinya Chalermsook, Mayank Goswami 0001, László Kozma 0002, Kurt Mehlhorn, Thatchaphol Saranurak	Greedy Is an Almost Optimal Deque.	WADS	2015	DBLP DOI BibTeX RDF
28	Tom van Dijk, Jaco C. van de Pol	Lace: Non-blocking Split Deque for Work-Stealing.	Euro-Par Workshops (2)	2014	DBLP DOI BibTeX RDF
28	Christopher Auer, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer	Characterizing Planarity by the Splittable Deque.	GD	2013	DBLP DOI BibTeX RDF
28	Daniel Denton	Methods of computing deque sortable permutations given complete and incomplete information	CoRR	2012	DBLP BibTeX RDF
28	Weiguang Kong	Unlimited Numeric Class Based on Deque.	CSISE (2)	2011	DBLP DOI BibTeX RDF
28	Christopher Auer, Andreas Gleißner	Characterizations of Deque and Queue Graphs.	WG	2011	DBLP DOI BibTeX RDF
28	Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Andreas Gleißner	Plane Drawings of Queue and Deque Graphs.	GD	2010	DBLP DOI BibTeX RDF
28	Seth Pettie	Splay Trees, Davenport-Schinzel Sequences, and the Deque Conjecture	CoRR	2007	DBLP BibTeX RDF
28	Denis Shestakov, Sourav S. Bhowmick, Ee-Peng Lim	DEQUE: querying the deep web.	Data Knowl. Eng.	2005	DBLP DOI BibTeX RDF
28	Amr Elmasry	On the sequential access theorem and deque conjecture for splay trees.	Theor. Comput. Sci.	2004	DBLP DOI BibTeX RDF
28	S. C. Chang, M. W. Du	Diamond Deque: A Simple Data Structure for Priority Deques.	Inf. Process. Lett.	1993	DBLP DOI BibTeX RDF
28	Rajamani Sundar	On the Deque conjecture for the splay algorithm.	Comb.	1992	DBLP DOI BibTeX RDF
28	Alessandra Cherubini, Claudio Citrini, Stefano Crespi-Reghizzi, Dino Mandrioli	Breath and Depth Grammars and Deque Automata.	Int. J. Found. Comput. Sci.	1990	DBLP DOI BibTeX RDF
28	Franz-Josef Brandenburg	A Note on: 'Deque Automata and a Subfamily of Context-Sensitive Languages which Contains All Semilinear Bounded Languages'.	Theor. Comput. Sci.	1987	DBLP DOI BibTeX RDF
28	Kathleen Ayers	Deque Automata and a Subfamily of Context-Sensitive Languages which Contains all Semilinear Bounded Languages.	Theor. Comput. Sci.	1985	DBLP DOI BibTeX RDF
28	Rainer Kemp	The Reduction of Binary Trees by Means of an Input-Restricted Deque.	RAIRO Theor. Informatics Appl.	1983	DBLP DOI BibTeX RDF
20	Nils Anders Danielsson	Lightweight semiformal time complexity analysis for purely functional data structures.	POPL	2008	DBLP DOI BibTeX RDF	amortised time complexity, purely functional data structures, dependent types, lazy evaluation
20	Danny Hendler, Yossi Lev, Nir Shavit	Dynamic Memory ABP Work-Stealing.	DISC	2004	DBLP DOI BibTeX RDF
20	Danny Hendler, Nir Shavit	Non-blocking steal-half work queues.	PODC	2002	DBLP DOI BibTeX RDF
20	Matteo Frigo, Charles E. Leiserson, Keith H. Randall	The Implementation of the Cilk-5 Multithreaded Language.	PLDI	1998	DBLP DOI BibTeX RDF	parallel computing, C, programming language, multithreading, runtime system, critical path, work
20	Haim Kaplan, Chris Okasaki, Robert Endre Tarjan	Simple Confluently Persistent Catenable Lists (Extended Abstract).	SWAT	1998	DBLP DOI BibTeX RDF
20	Jingsen Chen	Merging and Splitting Priority Queues and Deques in Parallel.	ISTCS	1992	DBLP DOI BibTeX RDF