default search action
Stefan D. Bruda
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j11]Omer Nguena Timo, Tianqi Xiao, Florent Avellaneda, Yasir Malik, Stefan D. Bruda:
Evaluating trustworthiness of decision tree learning algorithms based on equivalence checking. AI Ethics 4(1): 37-46 (2024) - 2020
- [i2]Tianqi Xiao, Omer Nguena Timo, Florent Avellaneda, Yasir Malik, Stefan D. Bruda:
An Approach to Evaluating Learning Algorithms for Decision Trees. CoRR abs/2010.13665 (2020)
2010 – 2019
- 2019
- [i1]Stefan D. Bruda, Sunita Singh, A. F. M. Nokib Uddin, Zhiyu Zhang, Rui Zuo:
A Constructive Equivalence between Computation Tree Logic and Failure Trace Testing. CoRR abs/1901.10925 (2019) - 2016
- [j10]Stefan D. Bruda, Mary Sarah Ruth Wilkin:
Limitations of Coverability Trees for Context-Free Parallel Communicating Grammar Systems and Why these Grammar Systems are not Linear Space. Parallel Process. Lett. 26(3): 1650012:1-1650012:14 (2016) - [c25]Erick Leon, Stefan D. Bruda:
Counter-Measures against Stack Buffer Overflows in GNU/Linux Operating Systems. ANT/SEIT 2016: 1301-1306 - 2014
- [c24]Benjamin Teissier, Stefan D. Bruda:
Toward Preventing Stack Overflow Using Kernel Properties. ICSOFT EA 2014: 369-376 - 2013
- [c23]Yasir Malik, Stefan D. Bruda, Bessam Abdulrazak, Usman Tariq
:
Reliable communication protocol for inter-vehicular network. ICDIM 2013: 170-174 - [c22]Stefan D. Bruda, Mary Sarah Ruth Wilkin:
Not Seeing the Parse Trees from the Parse Forest of a Context-Free Parallel Communicating Grammar System. ISPDC 2013: 169-176 - 2012
- [c21]Farzad Salehi, Stefan D. Bruda, Yasir Malik, Bessam Abdulrazak:
A Distributed Architecture for Remote Service Discovery in Pervasive Computing. ICSOFT 2012: 399-408 - [c20]Stefan D. Bruda, Farzad Salehi, Yasir Malik, Bessam Abdulrazak:
A Peer-to-Peer Architecture for Remote Service Discovery. ANT/MobiWIS 2012: 976-983 - 2011
- [c19]Stefan D. Bruda, Tawhid Bin Waez:
Unrestricted and Disjoint Operations over Multi-stack Visibly Pushdown Languages. ICSOFT (2) 2011: 156-161 - [c18]Stefan D. Bruda:
Sublinear Space Real-Time Turing Machines Cannot Count. ITNG 2011: 976-978 - 2010
- [j9]Stefan D. Bruda, Yuanqiao Zhang:
Collapsing the Hierarchy of Parallel Computational Models. Int. J. Found. Comput. Sci. 21(3): 441-457 (2010) - [j8]Jianguo Chen, Stefan D. Bruda:
An Efficient Feedback-based Trust Model for Pervasive Computing. J. Digit. Content Technol. its Appl. 4(7): 215-225 (2010) - [c17]Stefan D. Bruda, Zhiyu Zhang:
Model Checking is Refinement - From Computation Tree Logic to Failure Trace Testing. ICSOFT (2) 2010: 173-178
2000 – 2009
- 2009
- [j7]Stefan D. Bruda, Yuanqiao Zhang:
Relations Between Several Parallel Computational Models. Scalable Comput. Pract. Exp. 10(2) (2009) - 2008
- [c16]Jianguo Chen, Hangxia Zhou, Stefan D. Bruda:
Combining Model Checking and Testing for Software Analysis. CSSE (2) 2008: 206-209 - [c15]Stefan D. Bruda, Yuanqiao Zhang:
Why shared memory matters to VLSI design: The BSR is as powerful as reconfiguration. IPDPS 2008: 1-8 - [c14]Stefan D. Bruda, Yuanqiao Zhang:
The Shared Memory Hierarchy: The PRAM is as Powerful as the BSR. ISPDC 2008: 179-185 - 2006
- [c13]Stefan D. Bruda, Petter Haggholm, Scott Stoddard:
Distributed, Real-Time Programming on Commodity POSIX Systems: A Preliminary Report. ISPDC 2006: 74-81 - 2004
- [c12]Stefan D. Bruda:
Preorder Relations. Model-Based Testing of Reactive Systems 2004: 117-149 - 2003
- [j6]Stefan D. Bruda, Selim G. Akl:
On limits on the computational power of data-accumulating algorithms. Inf. Process. Lett. 86(4): 221-227 (2003) - 2002
- [c11]Stefan D. Bruda, Selim G. Akl:
The Characterization of Parallel Real-Time Optimization Problems. HPCS 2002: 77-83 - [c10]Stefan D. Bruda, Selim G. Akl:
On the Relation between Parallel Real-time Computations and Logarithmic Space. IASTED PDCS 2002: 102-107 - 2001
- [j5]Stefan D. Bruda, Selim G. Akl:
A Case Study in Real-Time Parallel Computation: Correcting Algorithms. J. Parallel Distributed Comput. 61(5): 688-708 (2001) - [j4]Stefan D. Bruda, Selim G. Akl:
On the Necessity of Formal Models for Real-Time Parallel Computations. Parallel Process. Lett. 11(2/3): 353-361 (2001) - [j3]Selim G. Akl, Stefan D. Bruda:
Improving A Solution's Quality Through Parallel Processing. J. Supercomput. 19(2): 221-233 (2001) - [c9]Stefan D. Bruda, Selim G. Akl:
Real-Time Computation: A Formal Definition and its Applications. IPDPS 2001: 137 - [c8]Stefan D. Bruda, Selim G. Akl:
Parallel Real-Time Complexity A Strong Infinite Hierarchy. SIROCCO 2001: 45-60 - [c7]Stefan D. Bruda, Selim G. Akl:
Pursuit and evasion on a ring: An infinite hierarchy for parallel real--time systems. SPAA 2001: 312-313 - 2000
- [j2]Stefan D. Bruda, Selim G. Akl:
The Characterization of Data-Accumulating Algorithms. Theory Comput. Syst. 33(1): 85-96 (2000) - [c6]Stefan D. Bruda, Selim G. Akl:
Towards a meaningful formal definition of real-time computations. CATA 2000: 274-279 - [c5]Selim G. Akl, Stefan D. Bruda:
Parallel Real-Time Numerical Computation: Beyond Speedup III. ITCC 2000: 428-435 - [c4]Selim G. Akl, Stefan D. Bruda:
Parallel Real-Time Cryptography: Beyond Speedup II. PDPTA 2000 - [c3]Stefan D. Bruda, Selim G. Akl:
On the Necessity of Formal Models for Real-Time Parallel Computations. PDPTA 2000
1990 – 1999
- 1999
- [j1]Selim G. Akl, Stefan D. Bruda:
Parallel Real-Time Optimization: Beyond Speedup. Parallel Process. Lett. 9(4): 499-509 (1999) - [c2]Stefan D. Bruda, Selim G. Akl:
The Characterization of Data-Accumulating Algorithms. IPPS/SPDP 1999: 2-6 - 1997
- [c1]Stefan D. Bruda:
On the Computational Complexity of Context-Free Parallel Communicating Grammar Systems. New Trends in Formal Languages 1997: 256-266
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-29 20:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: