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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1959-2018
05010019592018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
In this thesis, we introduce a new quantum Turing machine (QTM) model that supports general quantum operators, together with its… (More)
  • table 2.1
  • table 2.2
  • table 2.3
  • table 2.4
  • figure 2.1
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Much recent research has been devoted to learning algorithms for deep architectures such as Deep Belief Networks and stacks of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Regular model checking is a generic technique for verification of infinite-state and/or parametrised systems which uses finite… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We propose the class of visibly pushdown languages as embeddings of context-free languages that is rich enough to model program… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Model checking of linear temporal logic (LTL) speci cations with respect to pushdown systems has been shown to be a useful tool… (More)
  • figure 1
Is this relevant?
Highly Cited
1997
Highly Cited
1997
We apply the symbolic analysis principle to pushdown systems We represent possibly in nite sets of con gurations of such systems… (More)
Is this relevant?
Highly Cited
1997
Highly Cited
1997
methods and native methods are considered to be type safe if they do not override a final method. methodIsTypeSafe(Class, Method… (More)
  • table 2.1
  • table 2.2
  • table 2.3
  • table 4.1
  • table 4.2
Is this relevant?
Highly Cited
1990
Highly Cited
1990
We consider a pushdown automaton as a word-rewriting system with labelled rules applied only in a prefix way. The notion of… (More)
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1978
Highly Cited
1978
Decidable and undecldable properties of various classes of two-way multlcounter machines (deterministic, nondetermmlstlc… (More)
Is this relevant?
Highly Cited
1974
Highly Cited
1974
Addison-Wesley Pub. Co., 1974, , 470 pages. With this text, you gain an understanding of the fundamental concepts of algorithms… (More)
Is this relevant?