Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
computation trees
Description:
Computation trees are tree-structured representations of computational processes, used in algorithms, logic, and the analysis of iterative procedures.
Related topics:
Logic, programming, and type systems (17%),
Complexity and Algorithms in Graphs (11%),
Formal Methods in Verification (9%),
semigroups and automata theory (9%)
Wikidata ID:
wiki/Q5157275
OpenAlex ID:
keywords/computation-trees
Characterizing correctness properties of parallel programs using fixpoints
1980
·
E. Allen Emerson
, Edmund M. Clarke
·
Lecture notes in computer science
·
454
The temporal logic of branching time
1983
·
Mordechai Ben-Ari
, Amir Pnueli
, et al.
·
Acta Informatica
·
403
Model checking for a probabilistic branching time logic with fairness
1998
·
Christel Baier
, Marta Kwiatkowska
·
Distributed Computing
·
239
Loopy belief propagation and Gibbs measures
2002
·
Sekhar Tatikonda
, Michael I. Jordan
·
Uncertainty in Artificial Intelligence
·
218
On the topology of algorithms, I
1987
·
Steve Smale
·
Journal of Complexity
·
154
PDF
Weak Bisimulation for Probabilistic Systems
2000
·
Anna Philippou
, Insup Lee
, et al.
·
Lecture notes in computer science
·
135
Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs
1995
·
Sanjiv Kapoor
, H. Ramesh
·
SIAM Journal on Computing
·
131
GFT: Graph Foundation Model with Transferable Tree Vocabulary
2024
·
Zehong Wang
, Zheyuan Zhang
, et al.
·
neural information processing systems
·
127
PDF
Algebraic Complexity Theory
1990
·
Volker STRASSEN
·
Elsevier eBooks
·
97
Safety for branching time semantics
1991
·
A. Bouajjani
, J. C. Fernandez
, et al.
·
Lecture notes in computer science
·
95
Pseudocodewords of Tanner Graphs
2007
·
Christine A. Kelley
, Deepak Sridhara
·
IEEE Transactions on Information Theory
·
91
PDF
A proof rule for fair termination of guarded commands
1985
·
Orna Grumberg
, Nissim Francez
, et al.
·
Information and Control
·
82
Optimal parallel generation of a computation tree form
1985
·
Ilan Bar-on
, Uzi Vishkin
·
ACM Transactions on Programming Languages and Systems
·
81
PDF
A Generic Operational Metatheory for Algebraic Effects
2010
·
Patricia Johann
, Alex Simpson
, et al.
·
ACM/IEEE Symposium on Logic in Computer Science (LICS)
·
72
PDF
On counting and approximation
2005
·
Johannes Köbler
, Uwe Schöning
, et al.
·
Springer eBooks
·
70
Verification of fair transition systems
1996
·
Orna Kupferman
, Moshe Y. Vardi
·
Lecture notes in computer science
·
69
PDF
Tree Mover's Distance: Bridging Graph Metrics and Stability of Graph Neural Networks
2022
·
Ching-Yao Chuang
, Stefanie Jegelka
·
neural information processing systems
·
57
PDF
Improved FPTAS for Multi-spin Systems
2013
·
Pinyan Lu
, Yitong Yin
·
Lecture notes in computer science
·
56
Correlation decay and deterministic FPTAS for counting colorings of a graph
2012
·
David Gamarnik
, Dmitriy Katz
·
Journal of Discrete Algorithms
·
56
PDF
On counting and approximation
1989
·
Johannes Köbler
, Uwe Schöning
, et al.
·
Acta Informatica
·
55
A declarative debugger of incorrect answers for constraint functional-logic programs
2005
·
Rafael Caballero
·
53
Shallow Effect Handlers
2018
·
Daniel Hillerström
, Sam Lindley
·
Lecture notes in computer science
·
52
A Time-Space Tradeoff for Element Distinctness
1987
·
A. Borodin
, F. Fich
, et al.
·
SIAM Journal on Computing
·
49
Immunity, Relativizations, and Nondeterminism
1984
·
Uwe Schöning
, Ronald V. Book
·
SIAM Journal on Computing
·
49
Correlation decay and deterministic FPTAS for counting list-colorings of a graph
·
David Gamarnik
, Dmitriy Katz
·
46
Show more works
View as search
Works count:
280
Citation count:
4,802
Year
Topic
Type