Stacks versus deques

DOI10.1007/3-540-44679-6_24MaRDI QIDQ4551361zbMATH OpenFDO

Authors Holger Petersen

Publication date 5 September 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2108/21080218

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• scientific article; zbMATH DE number 3988713
• The Power of the Queue
• On the power of several queues
• Deque languages, automata and planar graphs
• Tape versus queue and stacks: The lower bounds

Cited in

(6)

• Deque languages, automata and planar graphs
• Deque automata, languages, and planar graph representations
• Stack sorting with increasing and decreasing stacks
• scientific article; zbMATH DE number 1543035 (Why is no real title available?)
• Data Structures and their Planar Graph Layouts
• Stack and queue number of 2-trees

This page was built for publication: Stacks versus deques

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4551361)