Stefan D. Bruda - Citegraph

Author Info

Name	Affiliation	Papers
STEFAN D. BRUDA	Department of Computer Science, Bishop’s University, Lennoxville, Quebec J1M 1Z7, Canada	28
Collaborators	Citations	PageRank
19	62	12.18
Referers	Referees	References
57	255	186

Search Limit

100255

Publications (28 rows)

Collaborators (19 rows)

Referers (57 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
A Constructive Equivalence between Computation Tree Logic and Failure Trace Testing.	0	0.34	2019
Limitations of Coverability Trees for Context-Free Parallel Communicating Grammar Systems and Why these Grammar Systems are not Linear Space.	0	0.34	2016
Counter-Measures Against Stack Buffer Overflows In Gnu/Linux Operating Systems.	1	0.41	2016
Toward preventing stack overflow using kernel properties	1	0.51	2014
Reliable communication protocol for inter-vehicular network	1	0.36	2013
Not Seeing the Parse Trees from the Parse Forest of a Context-Free Parallel Communicating Grammar System.	0	0.34	2013
A Distributed Architecture for Remote Service Discovery in Pervasive Computing.	0	0.34	2012
A Peer-to-Peer Architecture for Remote Service Discovery.	2	0.39	2012
Sublinear Space Real-Time Turing Machines Cannot Count	1	0.63	2011
An Efficient Feedback-based Trust Model for Pervasive Computing	0	0.34	2010
Collapsing The Hierarchy Of Parallel Computational Models	0	0.34	2010
Model Checking Is Refinement From Computation Tree Logic To Failure Trace Testing	0	0.34	2010
Relations Between Several Parallel Computational Models	1	0.37	2009
Combining Model Checking and Testing for Software Analysis	6	0.46	2008
The Shared Memory Hierarchy: The PRAM is as Powerful as the BSR	0	0.34	2008
Distributed, Real-Time Programming on Commodity POSIX Systems: A Preliminary Report	0	0.34	2006
Preorder Relations	1	0.36	2004
On limits on the computational power of data-accumulating algorithms	2	0.40	2003
On the Relation between Parallel Real-time Computations and Logarithmic Space	3	0.45	2002
The Characterization of Parallel Real-Time Optimization Problems	1	0.41	2002
Improving A Solution's Quality Through Parallel Processing	10	0.67	2001
Pursuit and evasion on a ring: An infinite hierarchy for parallel real—time systems	4	0.47	2001
Parallel Real-Time Complexity A Strong Infinite Hierarchy	1	0.37	2001
A case study in real-time parallel computation: correcting algorithms	9	0.75	2001
Parallel Real-Time Numerical Computation: Beyond Speedup III	5	0.49	2000
The Characterization of Data-Accumulating Algorithms	7	0.69	2000
Parallel Real-Time Optimization: Beyond Speedup	6	0.59	1999
On the Computational Complexity of Context-Free Parallel Communicating Grammar Systems	0	0.34	1997