Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

50 relations
AMD Am29000Abstract data typeArray data structureAssociation list
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
A Fast Unified Model for Parsing and Sentence Understanding
Tree-structured neural networks exploit valuable syntactic parse information as they interpret the meanings of sentences. However… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 2
Is this relevant?
Highly Cited
2011
Highly Cited
2011
A New Algorithm for Processing Interferometric Data-Stacks: SqueeSAR
Permanent Scatterer SAR Interferometry (PSInSAR) aims to identify coherent radar targets exhibiting high phase stability over the… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Analysis of Recursive Game Graphs Using Data Flow Equations
Given a finite-state abstraction of a sequential program with potentially recursive procedures and input from the environment, we… Expand
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Pushdown Processes: Games and Model Checking
Games given by transition graphs of pushdown processes are considered. It is shown that if there is a winning strategy in such a… Expand
  • figure 1
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Distributed representations, simple recurrent networks, and grammatical structure
AbstractIn this paper three problems for a connectionist account of language are considered1.What is the nature of linguistic… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1987
Highly Cited
1987
Morphological filters-Part II: Their relations to median, order-statistic, and stack filters
This paper extends the theory of median, order-statistic (OS), and stack filters by using mathematical morphology to analyze them… Expand
  • figure 1
  • figure 2
  • figure 4
Is this relevant?
Highly Cited
1978
Highly Cited
1978
Reversal-Bounded Multicounter Machines and Their Decision Problems
Decidable and undecldable properties of various classes of two-way multlcounter machines (deterministic, nondetermmlstlc… Expand
Is this relevant?
Highly Cited
1974
Highly Cited
1974
The complexity of decision problems in automata theory and logic.
Massachusetts Institute of Technology. Dept. of Electrical Engineering. Thesis. 1974. Ph.D. 
  • table 4.2
Is this relevant?
Highly Cited
1968
Highly Cited
1968
Syntax-Directed Transduction
A transduction is a mapping from one set of sequences to another. A syntax-directed transduction is a particular type of… Expand
Is this relevant?
Highly Cited
1967
Highly Cited
1967
Indexed Grammars-An Extension of Context Free Grammars
A new type of grammar, called an indexed grammar, is defined. The language generated by an indexed grammar is called an indexed… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE