Skip to search formSkip to main contentSkip to account menu

Stack (abstract data type)

Known as: Stack (programming), Pushing and popping, Push and pop 
In computer science, a stack is an abstract data type that serves as a collection of elements, with two principal operations: push, which adds an… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
AMD Am29000Abstract data typeArray data structureAssociation list

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2012
Review
2012
Spatial and temporal evolution of injected CO2 at the Sleipner Field, North Sea
Time-lapse, three-dimensional (3D) seismic surveys have imaged an accumulation of injected CO$_{2}$ adjacent to the Sleipner… 
Highly Cited
2012
Highly Cited
2012
Optimizing analytic data flows for multiple execution engines
Next generation business intelligence involves data flows that span different execution engines, contain complex functionality… 
Highly Cited
2012
Highly Cited
2012
Swarm testing
Swarm testing is a novel and inexpensive way to improve the diversity of test cases generated during random testing. Increased… 
Highly Cited
2004
Highly Cited
2004
Formalizing sensitivity in static analysis for intrusion detection
A key function of a host-based intrusion detection system is to monitor program execution. Models constructed using static… 
Highly Cited
1986
Highly Cited
1986
On Knowledge Base Management Systems
This position statement examines briefly the purpose, nature and impact of Knowledge Base Management Systems and outlines a… 
Highly Cited
1980
Highly Cited
1980
Complexity Results for Classes of Quantificational Formulas
  • H. R. Lewis
  • Journal of computer and system sciences (Print)
  • 1980
  • Corpus ID: 35359770
Highly Cited
1974
Highly Cited
1974
Attributed Translations
Highly Cited
1973
Highly Cited
1973
Decision procedures for families of deterministic pushdown automata
The existence and complexity of decision procedures for families of deterministic pushdown automata are investigated, with… 
Highly Cited
1971
Highly Cited
1971
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
A class of machines called auxiliary pushdown machines is introduced. Several types of pushdown automata, including stack… 
Highly Cited
1966
Highly Cited
1966
Turing Machines with Restricted Memory Access
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)