![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Stefan Andrei
Person information
- affiliation: Lamar University, Beaumont, TX, USA
- affiliation (former): National University of Singapore (NUS)
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2000
- [b1]Stefan Andrei:
Bidirectional parsing. University of Hamburg, Germany, 2000, pp. 1-145
Journal Articles
- 2019
- [j19]Stefan Andrei, Albert M. K. Cheng
, Vlad Radulescu:
Processor Bounding for an Efficient Non-preemptive Task Scheduling Algorithm. Math. Comput. Sci. 13(4): 489-515 (2019) - 2018
- [j18]Vlad Radulescu, Stefan Andrei, Albert M. K. Cheng:
Bounding execution resources for the task scheduling problem in cyber-physical systems. SIGBED Rev. 15(4): 20-28 (2018) - 2016
- [j17]Stefan Andrei, Albert M. K. Cheng, Vlad Radulescu, Sharfuddin Alam, Suresh Vadlakonda:
A new scheduling algorithm for non-preemptive independent tasks on a multi-processor platform. SIGBED Rev. 13(2): 24-29 (2016) - 2012
- [j16]Stefan Andrei, Albert M. K. Cheng
, Gheorghe Grigoras, Vlad Radulescu:
An efficient scheduling algorithm for the non-preemptive independent multiprocessor platform. Int. J. Grid Util. Comput. 3(4): 215-223 (2012) - 2009
- [j15]Cristian Masalagiu, Wei-Ngan Chin, Stefan Andrei, Vasile Alaiba:
A rigorous methodology for specification and verification of business processes. Formal Aspects Comput. 21(5): 495-510 (2009) - [j14]Stefan Andrei, Albert Mo Kim Cheng
:
Efficient Verification and Optimization of Real-Time Logic-Specified Systems. IEEE Trans. Computers 58(12): 1640-1653 (2009) - 2006
- [j13]Stefan Andrei, Wei-Ngan Chin, Albert Mo Kim Cheng
, Mihai Lupu:
Automatic Debugging of Real-Time Systems Based on Incremental Satisfiability Counting. IEEE Trans. Computers 55(7): 830-842 (2006) - 2005
- [j12]Mihaela Brut, Stefan Andrei:
Authoring and Retrieving Tool for Multimedia E-Learning Tutorials using XML Techniques. Sci. Ann. Cuza Univ. 15: 153-160 (2005) - 2004
- [j11]Stefan Andrei, Wei-Ngan Chin, Salvador Valerio Cavadini:
Self-embedded context-free grammars with regular counterparts. Acta Informatica 40(5): 349-365 (2004) - [j10]Stefan Andrei:
Counting for Satisfiability by Inverting Resolution. Artif. Intell. Rev. 22(4): 339-366 (2004) - [j9]Stefan Andrei, Wei-Ngan Chin, Gheorghe Grigoras:
Co-determinism and unambiguity of automata accepting finite or infinite words. Sci. Ann. Cuza Univ. 14: 1-11 (2004) - [j8]Stefan Andrei, Wei-Ngan Chin:
Solving a class of higher-order equations over a group structure. J. Symb. Comput. 37(3): 329-341 (2004) - 2003
- [j7]Stefan Andrei, Salvador Valerio Cavadini, Wei-Ngan Chin:
A new algorithm for regularizing one-letter context-free grammars. Theor. Comput. Sci. 306(1-3): 113-122 (2003) - 2002
- [j6]Stefan Andrei, Wei-Ngan Chin, Gheorghe Grigoras:
A Tutorial on a Monadic Approach for Expressions Evaluation. Sci. Ann. Cuza Univ. 12: 1-27 (2002) - 2001
- [j5]Stefan Andrei, Gheorghe Grigoras, Manfred Kudlek, Cristian Masalagiu:
On the Complexity of Propositional Calculus Formulae. Sci. Ann. Cuza Univ. 10: 27-44 (2001) - 2000
- [j4]Stefan Andrei, Manfred Kudlek, Radu Stefan Niculescu:
Some results on the Collatz problem. Acta Informatica 37(2): 145-160 (2000) - 1998
- [j3]Stefan Andrei, Cristian Masalagiu:
About the Collatz Conjecture. Acta Informatica 35(2): 167-179 (1998) - 1996
- [j2]Stefan Andrei, Manfred Kudlek:
Morphological Grammars. Sci. Ann. Cuza Univ. 5: 85-114 (1996) - 1995
- [j1]Stefan Andrei:
Finding keys in particular classes of functional dependencies. Sci. Ann. Cuza Univ. 4: 5-12 (1995)
Conference and Workshop Papers
- 2023
- [c43]Vlad Radulescu
, Albert M. K. Cheng
, Stefan Andrei
:
Work-in-Progress: Flexible bus arbitration in mixed criticality systems. EMSOFT 2023: 11-12 - [c42]Stefan Andrei, Sujing Wang:
An Innovative Way to Teach Computer Programming for Middle and High Schools Students in Summer Camps. FIE 2023: 1-9 - [c41]Sujing Wang, Stefan Andrei:
Comparative Study of Several Educational Robotics to Introduce Engineering and Computing Concepts for Middle School and High School Students. FIE 2023: 1-8 - 2022
- [c40]Callan J. Noak, Sujing Wang, Stefan Andrei, Jennifer L. Tsan:
Introducing Engineering and Programming Concepts to Middle School and High School Students using SparkFun Inventor's Kit, Scratch, and Java. FIE 2022: 1-8 - [c39]Callan J. Noak, Jennifer L. Tsan, Sujing Wang, Stefan Andrei:
Introducing Programming to Middle School Students to Increase Knowledge and Interest in Computer Science. SIGCSE (2) 2022: 1098 - 2021
- [c38]Madison Boudreaux, Sujing Wang, Stefan Andrei, Otilia Urbina, Dorothy A. Sisk:
Integrating Programming and Engineering Concepts using Raspberry Pi and Scratch. FIE 2021: 1-8 - [c37]Sayeda Farzana Aktar, Stefan Andrei, Albert M. K. Cheng:
Work in Progress: Heart Disease Detection Methodology using E-Stethoscope. RTAS 2021: 513-516 - [c36]Vlad Radulescu, Stefan Andrei, Albert M. K. Cheng:
Work-in-Progress Abstract: A New Criterion for Job Switching in Semi-Clairvoyant Systems. RTCSA 2021: 198-200 - [c35]Stefan Andrei, Albert M. K. Cheng, Vlad Radulescu:
Designing a New Soft-Hard Task Model for Scheduling Real-Time Systems on a Multiprocessor Platform. SYNASC 2021: 83-90 - 2020
- [c34]Sujing Wang, Stefan Andrei, Otilia Urbina, Dorothy A. Sisk:
Introducing STEM to 7th Grade Girls using SeaPerch and Scratch. FIE 2020: 1-8 - 2019
- [c33]Sujing Wang, Stefan Andrei, Otilia Urbina, Dorothy A. Sisk:
A Coding/Programming Academy for 6th-Grade Females to Increase Knowledge and Interest in Computer Science. FIE 2019: 1-8 - 2016
- [c32]Vlad Radulescu, Stefan Andrei, Albert M. K. Cheng
:
Resource Bounding for Non-Preemptive Task Scheduling on a Multiprocessor Platform. SYNASC 2016: 157-164 - 2015
- [c31]Stefan Andrei, Albert M. K. Cheng
, Vlad Radulescu:
An Improved Upper-Bound Algorithm for Non-preemptive Task Scheduling. SYNASC 2015: 153-159 - 2014
- [c30]Stefan Andrei, Albert M. K. Cheng
, Vlad Radulescu:
An efficient scheduling algorithm of non-preemptive independent tasks for biomedical systems. NEWCAS 2014: 424-427 - [c29]Vlad Radulescu, Stefan Andrei, Albert M. K. Cheng
:
A Heuristic-Based Approach for Reducing the Power Consumption of Real-Time Embedded Systems. SYNASC 2014: 172-179 - 2012
- [c28]Stefan Andrei, Albert M. K. Cheng
, Vlad Radulescu, Timothy H. McNicholl:
Toward an Optimal Power-Aware Scheduling Technique. SYNASC 2012: 135-142 - 2011
- [c27]S. Kami Makki, Stefan Andrei, Yanwen Guan, Mattie Sue Judd:
Performance Evaluation of Query Trimming Strategies in Semantic Caching Environment. ICEIS (1) 2011: 169-176 - [c26]Stefan Andrei, Albert M. K. Cheng
, Vlad Radulescu:
Estimating the Number of Processors towards an Efficient Non-preemptive Scheduling Algorithm. SYNASC 2011: 93-100 - 2010
- [c25]Stefan Andrei, Albert Mo Kim Cheng
, Martin C. Rinard, Lawrence Osborne:
Optimal Scheduling of Urgent Preemptive Tasks. RTCSA 2010: 377-386 - [c24]Stefan Andrei, Albert M. K. Cheng
, Gheorghe Grigoras, Vlad Radulescu:
An Efficient Scheduling Algorithm for the Multiprocessor Platform. SYNASC 2010: 245-252 - 2009
- [c23]Stefan Andrei:
Parallel Parsing-Based Reverse Engineering. CSIE (7) 2009: 503-507 - [c22]S. Kami Makki, Stefan Andrei:
Utilizing semantic caching in ubiquitous environment. IWCMC 2009: 1213-1217 - [c21]Stefan Andrei, Gheorghe Grigoras, Martin C. Rinard, Roland H. C. Yap:
A Hierarchy of Tractable Subclasses for SAT and Counting SAT Problems. SYNASC 2009: 61-68 - 2008
- [c20]Stefan Andrei, Peggy Doerschuk:
SAT-based Weighted Planning. ARCS 2008: 70-75 - [c19]Stefan Andrei:
Termination Analysis by Program Inversion. SYNASC 2008: 277-280 - [c18]Stefan Andrei, Albert Mo Kim Cheng
:
Optimizing Automotive Cyber-Physical System Specifications with Multi-Event Dependencies. SYNASC 2008: 475-479 - 2007
- [c17]Stefan Andrei, Albert M. K. Cheng
:
Verifying Linear Real-Time Logic Specifications. RTSS 2007: 333-342 - [c16]Stefan Andrei, Gabriel Manolache, Roland H. C. Yap, Victor Felea:
Approximate Satisfiability Counting. SYNASC 2007: 196-202 - [c15]Nilam Chand, Bindiya Mansharamani, Rafael Romero, Will Beazley, Stefan Andrei:
PEARLS: An Integrated Environment for Task Scheduling. SYNASC 2007: 467-473 - [c14]Stefan Andrei, Samarjit Chakraborty
:
Path-Constrained Relaxed Schedulability Analysis. SYNASC 2007: 474-482 - 2006
- [c13]Yongxin Zhu, Weng-Fai Wong
, Stefan Andrei:
Co-optimization of Performance and Power in a Superscalar Processor Design. EUC Workshops 2006: 868-878 - [c12]Beatrice Luca, Stefan Andrei, Hugh Anderson, Siau-Cheng Khoo:
Program transformation by solving recurrences. PEPM 2006: 121-129 - [c11]Stefan Andrei, Albert Mo Kim Cheng:
Optimization of Real-Time Systems Timing Specifications. RTCSA 2006: 68-76 - [c10]Stefan Andrei, Albert Mo Kim Cheng
:
Faster Verification of RTL-Specified Systems via Decomposition and Constraint Extension. RTSS 2006: 67-76 - [c9]Stefan Andrei, Wei-Ngan Chin, Martin C. Rinard:
Incremental Deterministic Planning. SYNASC 2006: 93-102 - 2005
- [c8]Hugh Anderson, Siau-Cheng Khoo, Stefan Andrei, Beatrice Luca:
Calculating Polynomial Runtime Properties. APLAS 2005: 230-246 - [c7]Yongxin Zhu, Weng-Fai Wong
, Stefan Andrei:
An integrated performance and power model for superscalar processor designs. ASP-DAC 2005: 948-951 - [c6]Stefan Andrei, Albert Mo Kim Cheng, Wei-Ngan Chin, Mihai Lupu:
Systematic Debugging of Real-Time Systems based on Incremental Satisfiability Counting. IEEE Real-Time and Embedded Technology and Applications Symposium 2005: 519-528 - [c5]Stefan Andrei, Wei-Ngan Chin, Albert Mo Kim Cheng
, Yongxin Zhu:
Runtime-Coordinated Scalable Incremental Checksum Testing of Combinational Circuits. RTCSA 2005: 357-360 - 2004
- [c4]Stefan Andrei, Wei-Ngan Chin:
Incremental Satisfiability Counting for Real-Time Systems. IEEE Real-Time and Embedded Technology and Applications Symposium 2004: 482-489 - 2001
- [c3]Stefan Andrei:
Bidirectional Ascendant Parsing for Natural Language Processing. IWPT 2001 - 1999
- [c2]Stefan Andrei, Manfred Kudlek:
Bidirectional parsing for linear languages. Developments in Language Theory 1999: 257-269 - [c1]Stefan Andrei:
Weak Equivalence in Propositional Calculus. ESSLLI Student Papers 1999: 79-90
Coauthor Index
aka: Albert M. K. Cheng
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-24 22:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint