2023W

• Bachelor Thesis for Computer Science and Business Informatics / 182.698 / PR
• Computer Engineering Project / 191.006 / PR
• Doctorand's seminar / 182.070 / SE
• Orientation Bachelor with Honors of Informatics and Business Informatics / 180.767 / SE
• Problems in Distributed Computing / 182.703 / VU
• Project in Computer Science 1 / 191.008 / PR
• Project in Computer Science 2 / 191.009 / PR
• Research Seminar LogiCS / 184.767 / SE
• Scientific Project Computer Engineering / 191.007 / PR
• Scientific Research and Writing / 193.052 / SE
• Seminar Computer Engineering / 182.757 / SE
• Seminar for Master Students in Computer Engineering / 180.778 / SE

2024S

• Research Seminar LogiCS / 184.767 / SE

 

• Digital Modeling of Asynchronous Integrated Circuits
  2019 – 2024 / Austrian Science Fund (FWF)
  Publications: 135842 / 139754 / 15702 / 18019 / 18634
• Trustworthy IoT for CPS
  2017 – 2020 / Austrian Research Promotion Agency (FFG)
  Publication: 137649
• Gracefully Degrading Agreement in Directed Dynamic Networks
  2016 – 2020 / Austrian Science Fund (FWF)
  Publication: 18019
• Self-stabilizing Byzantine Fault-Tolerant Distributed Algorithms for Integrated Circiuts
  2013 – 2018 / Austrian Science Fund (FWF)
  Publication: 485
• Partially Synchronous Distributed Real-Time Systems
  2008 – 2012 / Austrian Science Fund (FWF)
• Fault Models for Engineering
  2008 – 2010 / Austrian Research Promotion Agency (FFG)
• Transient Fault Tolerance
  2006 – 2010 / Austrian Research Promotion Agency (FFG)
• Fault-tolerant Distributed Algorithms in Sparse Ad Hoc Wireless Networks
  2005 – 2009 / Austrian Science Fund (FWF)
• Asynchronous Distributed Algorithms in the Theta-Model
  2004 – 2008 / Austrian Science Fund (FWF)
  Publication: 53493
• Automated proof based System and Software Engineering for Real-Time Applications
  2004 – 2008 / European Commission
• Seamless Campus - Distance Labs
  2004 – 2007 / Austrian Research Promotion Agency (FFG)
  Publications: 51634 / 51656
• Distributed Computing in the Presence of Bounded Asynchrony
  2004 – 2007 / Austrian Research Promotion Agency (FFG)

2022

• An Accurate Hybrid Delay Model for Multi-Input Gates / Ferdowsi, A., Schmid, U., & Salzmann, J. (2022). An Accurate Hybrid Delay Model for Multi-Input Gates. https://doi.org/10.34726/2942
  Download: PDF (1.62 MB)
  Project: DMAC (2019–2024)
• Towards a Topological Semantics for Epistemic Reasoning in Byzantine Fault-Tolerant Distributed Systems / Randrianomentsoa, R. F., Rincon Galeana, H., & Schmid, U. (2022, October 24). Towards a Topological Semantics for Epistemic Reasoning in Byzantine Fault-Tolerant Distributed Systems [Conference Presentation]. Workshop on Connections between Epistemic Logic and Topology (CELT’22), University of Amsterdam, Netherlands (the). http://hdl.handle.net/20.500.12708/153197
• A Simple Hybrid Model for Accurate Delay Modeling of a Multi-Input Gate / Ferdowsi, A., Maier, J., Öhlinger, D., & Schmid, U. (2022). A Simple Hybrid Model for Accurate Delay Modeling of a Multi-Input Gate. In 2022 Design, Automation & Test in Europe Conference & Exhibition (DATE) (pp. 1461–1466). https://doi.org/10.23919/DATE54114.2022.9774547
  Project: DMAC (2019–2024)
• Continuous Tasks and the Asynchronous Computability Theorem / Galeana, H. R., Rajsbaum, S., & Schmid, U. (2022). Continuous Tasks and the Asynchronous Computability Theorem. In M. Braverman (Ed.), 13th Innovations in Theoretical Computer Science Conference (ITCS’22) (pp. 73:1-73:27). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ITCS.2022.73

2021

• A Composable Glitch-Aware Delay Model / Maier, J., Öhlinger, D., Schmid, U., Függer, M., & Nowak, T. (2021). A Composable Glitch-Aware Delay Model. In GLSVLSI ’21: Proceedings of the 2021 Great Lakes Symposium on VLSI (pp. 147–154). Association for Computing Machinery. https://doi.org/10.1145/3453688.3461519
  Downloads: MP4 (85.5 MB) / PDF (1.28 MB)
  Projects: ADynNet (2016–2020) / DMAC (2019–2024)
• Optimal strategies for selecting coordinators / Zeiner, M., Schmid, U., & Chatterjee, K. (2021). Optimal strategies for selecting coordinators. Discrete Applied Mathematics, 289, 392–415. https://doi.org/10.1016/j.dam.2020.10.022
• Honors at TU Wien / Schmid, U. (2021). Honors at TU Wien. International Conference on Talent Development and Honors Education (World of Talent 2021), Groningen, The Netherlands, International. http://hdl.handle.net/20.500.12708/87249
• Fire! / Fruzsa, K., Kuznets, R., & Schmid, U. (2021). Fire! In Electronic Proceedings in Theoretical Computer Science (pp. 139–153). Electronic Proceedings in Theoretical Computer Science. https://doi.org/10.4204/eptcs.335.13
• Valency-Based Consensus Under Message Adversaries Without Limit-Closure / Winkler, K., Schmid, U., & Nowak, T. (2021). Valency-Based Consensus Under Message Adversaries Without Limit-Closure. In Fundamentals of Computation Theory (pp. 457–474). Springer. https://doi.org/10.1007/978-3-030-86593-1_32
• Round-Oblivious Stabilizing Consensus in Dynamic Networks / Schwarz, M., & Schmid, U. (2021). Round-Oblivious Stabilizing Consensus in Dynamic Networks. In Lecture Notes in Computer Science (pp. 154–172). Springer. https://doi.org/10.1007/978-3-030-91081-5_11

2020

• The involution tool for accurate digital timing and power analysis / Öhlinger, D., Maier, J., Függer, M., & Schmid, U. (2020). The involution tool for accurate digital timing and power analysis. Integration, 76, 87–98. https://doi.org/10.1016/j.vlsi.2020.09.007
  Download: PDF (994 KB)
  Project: DMAC (2019–2024)
• Upper and Lower Bounds for the Synchronizer Performance in Systems with Probabilistic Message Loss / Zeiner, M., & Schmid, U. (2020). Upper and Lower Bounds for the Synchronizer Performance in Systems with Probabilistic Message Loss. Methodology and Computing in Applied Probability, 23(3), 1023–1056. https://doi.org/10.1007/s11009-020-09792-z
• A Faithful Binary Circuit Model / Függer, M., Najvirt, R., Nowak, T., & Schmid, U. (2020). A Faithful Binary Circuit Model. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 39(10), 2784–2797. https://doi.org/10.1109/tcad.2019.2937748
• Precedence-Aware Automated Competitive Analysis of Real-Time Scheduling / Pavlogiannis, A., Schaumberger, N., Schmid, U., & Chatterjee, K. (2020). Precedence-Aware Automated Competitive Analysis of Real-Time Scheduling. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 39(11), 3981–3992. https://doi.org/10.1109/tcad.2020.3012803
• The Persistence of False Memory: Brain in a Vat despite Perfect Clocks / Schlögl, T., Schmid, U., & Kuznets, R. (2020). The Persistence of False Memory: Brain in a Vat despite Perfect Clocks. In Lecture Notes in Computer Science. PRIMA 2020, Japan, Non-EU. Springer Nature Switzerland AG. https://doi.org/10.1007/978-3-030-69322-0

2019

• A Characterization of Consensus Solvability for Closed Message Adversaries / Winkler, K., Schmid, U., & Moses, Y. (2019). A Characterization of Consensus Solvability for Closed Message Adversaries. In P. Felber, R. Friedman, S. Gilbert, & A. Miller (Eds.), 23rd International Conference on Principles of Distributed Systems (pp. 17:1-17:16). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2019.17
• Transistor-Level Analysis of Dynamic Delay Models / Maier, J., Függer, M., Nowak, T., & Schmid, U. (2019). Transistor-Level Analysis of Dynamic Delay Models. In 2019 25th IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC). IEEE. https://doi.org/10.1109/ASYNC.2019.00019
  Download: PDF (457 KB)
• The Involution Tool for Accurate Digital Timing and Power Analysis / Öhlinger, D., Maier, J., Függer, M., & Schmid, U. (2019). The Involution Tool for Accurate Digital Timing and Power Analysis. In 2019 29th International Symposium on Power and Timing Modeling, Optimization and Simulation (PATMOS). https://doi.org/10.1109/PATMOS.2019.8862165
  Download: PDF (301 KB)
• Consensus in rooted dynamic networks with short-lived stability / Winkler, K., Schwarz, M., & Schmid, U. (2019). Consensus in rooted dynamic networks with short-lived stability. Distributed Computing, 32(5), 443–458. https://doi.org/10.1007/s00446-019-00348-0
• On Linear-Time Data Dissemination in Dynamic Rooted Trees / Zeiner, M., Schwarz, M., & Schmid, U. (2019). On Linear-Time Data Dissemination in Dynamic Rooted Trees. Discrete Applied Mathematics, 255, 307–319. https://doi.org/10.1016/j.dam.2018.08.015
• An Overview of Recent Results for Consensus in Directed Dynamic Networks / Winkler, K., & Schmid, U. (2019). An Overview of Recent Results for Consensus in Directed Dynamic Networks. Bulletin of the EATCS, 128, 30. http://hdl.handle.net/20.500.12708/143248
• Design and Implementation of the Bachelor with Honors Program at TU Wien / Schmid, U. (2019). Design and Implementation of the Bachelor with Honors Program at TU Wien. Journal of the European Honors Council, 3(2). https://doi.org/10.31378/jehc.3.2
• Digital Modeling of Asynchronous Integrated Circuits / Schmid, U. (2019). Digital Modeling of Asynchronous Integrated Circuits. 2nd Workshop on Hardware Design and Theory (https://sites.google.com/view/motimedina/hdt-2019, colocated with DISC 2019), Budapest, EU. http://hdl.handle.net/20.500.12708/86974
• Byzantine Causal Cone / Kuznets, R., Prosperi, L., Schmid, U., & Fruzsa, K. (2019). Byzantine Causal Cone. Workshop on Formal Reasoning in Distributed Algorithms (FRiDA), Wien, Austria. http://hdl.handle.net/20.500.12708/86905
• Topological Characterization of Consensus under General Message Adversaries / Nowak, T., Schmid, U., & Winkler, K. (2019). Topological Characterization of Consensus under General Message Adversaries. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing. 38th ACM Symposium on Principles of Distributed Computing (PODC’19), Toronto, Canada, Non-EU. ACM. https://doi.org/10.1145/3293611.3331624
• Causality and Epistemic Reasoning in Byzantine Multi-Agent Systems / Kuznets, R., Prosperi, L., Schmid, U., & Fruzsa, K. (2019). Causality and Epistemic Reasoning in Byzantine Multi-Agent Systems. In L. Moss (Ed.), Electronic Proceedings in Theoretical Computer Science (pp. 293–312). Electronic Proceedings in Theoretical Computer Science. https://doi.org/10.4204/eptcs.297.19
• A Topological View of Partitioning Arguments: Reducing k-Set Agreement to Consensus / Rincon Galeana, H., Winkler, K., Schmid, U., & Rajsbaum, S. (2019). A Topological View of Partitioning Arguments: Reducing k-Set Agreement to Consensus. In Lecture Notes in Computer Science (pp. 307–322). Lecture Notes in Computer Science / Springer. https://doi.org/10.1007/978-3-030-34992-9_25
• Epistemic Reasoning with Byzantine-Faulty Agents / Kuznets, R., Prosperi, L., Schmid, U., & Fruzsa, K. (2019). Epistemic Reasoning with Byzantine-Faulty Agents. In A. Herzig & A. Popescu (Eds.), Frontiers of Combining Systems (pp. 259–276). Springer. https://doi.org/10.1007/978-3-030-29007-8_15
• 2019 Principles of Distributed Computing Doctoral Dissertation Award / Jayanti, P., Lynch, N. A., Patt-Shamir, B., & Schmid, U. (2019). 2019 Principles of Distributed Computing Doctoral Dissertation Award. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing. ACM. https://doi.org/10.1145/3293611.3341565
• A Topological View of Partitioning Arguments: Reducing k-Set Agreement to Consensus / Rincon Galeana, H., Winkler, K., Schmid, U., & Rajsbaum, S. (2019). A Topological View of Partitioning Arguments: Reducing k-Set Agreement to Consensus (TUW-281149). http://hdl.handle.net/20.500.12708/39728
• Knowledge in Byzantine Message-Passing Systems I: Framework and the Causal Cone / Prosperi, L., Kuznets, R., Schmid, U., Fruzsa, K., & Gréaux, L. (2019). Knowledge in Byzantine Message-Passing Systems I: Framework and the Causal Cone (TUW-260549). http://hdl.handle.net/20.500.12708/39204

2018

• A Faithful Binary Circuit Model with Adversarial Noise / Függer, M., Maier, J., Najvirt, R., Nowak, T., & Schmid, U. (2018). A Faithful Binary Circuit Model with Adversarial Noise. In 2018 Design, Automation & Test in Europe Conference & Exhibition (DATE). IEEE. https://doi.org/10.23919/DATE.2018.8342219
  Download: PDF (1.11 MB)
• Automated Competitive Analysis of Real-time Scheduling with Graph Games / Chatterjee, K., Pavlogiannis, A., Kößler, A., & Schmid, U. (2018). Automated Competitive Analysis of Real-time Scheduling with Graph Games. Real-Time Systems, 54(1), 166–207. https://doi.org/10.1007/s11241-017-9293-4
• Gracefully degrading consensus and k-set agreement in directed dynamic networks / Biely, M., Robinson, P., Schmid, U., Schwarz, M., & Winkler, K. (2018). Gracefully degrading consensus and k-set agreement in directed dynamic networks. Theoretical Computer Science, 726, 41–77. https://doi.org/10.1016/j.tcs.2018.02.019
• What do Byzantine agents know? / Gréaux, L., Kuznets, R., Prosperi, L., & Schmid, U. (2018). What do Byzantine agents know? First joint workshop by the Mathematics and the Philosophy Research Institutes of UNAM, Mexiko-Stadt, Mexiko, Non-EU. http://hdl.handle.net/20.500.12708/86037
• 32nd International Symposium on Distributed Computing / Schmid, U., & Widder, J. (Eds.). (2018). 32nd International Symposium on Distributed Computing. Dagstuhl Publishing LIPICS. https://doi.org/10.4230/LIPIcs.DISC.2018.0
• Verifying nonlinear analog and mixed-signal circuits with inputs / Fan, C., Meng, Y., Maier, J., Bartocci, E., Mitra, S., & Schmid, U. (2018). Verifying nonlinear analog and mixed-signal circuits with inputs. In IFAC-PapersOnLine (pp. 241–246). IFAC-PapersOnLine. https://doi.org/10.1016/j.ifacol.2018.08.041
• On linear-time data dissemination in dynamic trees / Zeiner, M., Schwarz, M., & Schmid, U. (2018). On linear-time data dissemination in dynamic trees. In CSASC 2018 - Book of Abstracts (p. 113). http://hdl.handle.net/20.500.12708/57537
• On Knowledge and Communication Complexity in Distributed Systems / Pfleger, D., & Schmid, U. (2018). On Knowledge and Communication Complexity in Distributed Systems. In Structural Information and Communication Complexity (pp. 312–330). Springer International Publishing. https://doi.org/10.1007/978-3-030-01325-7_27
• On the Strongest Message Adversary for Consensus in Directed Dynamic Networks / Schmid, U., Schwarz, M., & Winkler, K. (2018). On the Strongest Message Adversary for Consensus in Directed Dynamic Networks. In Structural Information and Communication Complexity (pp. 102–120). Springer International Publishing. https://doi.org/10.1007/978-3-030-01325-7_13
• Self-Stabilizing High-Speed Communication in Multi-Synchronous GALS Architectures / Perner, M., & Schmid, U. (2018). Self-Stabilizing High-Speed Communication in Multi-Synchronous GALS Architectures. In 2018 IEEE 24th International Symposium on On-Line Testing And Robust System Design (IOLTS). 24th IEEE International Symposium on On-Line Testing And Robust System Design (IOLTS’18), Platja D’Aro, Spain, EU. https://doi.org/10.1109/iolts.2018.8474221
• 2018 Edsger W. Dijkstra Prize in Distributed Computing / Afek, Y., Keidar, I., Patt-Shamir, B., Rajsbaum, S., Schmid, U., & Taubenfeld, G. (2018). 2018 Edsger W. Dijkstra Prize in Distributed Computing. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing. ACM Press. https://doi.org/10.1145/3212734.3232540
• On Knowledge and Communication Complexity in Distributed Systems / Pfleger, D., & Schmid, U. (2018). On Knowledge and Communication Complexity in Distributed Systems (TUW-269752). http://hdl.handle.net/20.500.12708/39457
• On the Strongest Message Adversary for Consensus in Directed Dynamic Networks / Schwarz, M., & Schmid, U. (2018). On the Strongest Message Adversary for Consensus in Directed Dynamic Networks (TUW-269285). http://hdl.handle.net/20.500.12708/39450
• Self-Stabilizing High-Speed Communication in Multi-Synchronous GALS Architectures / Perner, M., & Schmid, U. (2018). Self-Stabilizing High-Speed Communication in Multi-Synchronous GALS Architectures (TUW-268547). http://hdl.handle.net/20.500.12708/39426
• FWF-Proposal DMAC: Digital Modeling of Asynchronous Integrated Circuits / Schmid, U. (2018). FWF-Proposal DMAC: Digital Modeling of Asynchronous Integrated Circuits (TUW-278607). http://hdl.handle.net/20.500.12708/39717

2017

• A versatile architecture for long-term monitoring of single-event transient durations / Savulimedu Veeravalli, V., Steininger, A., & Schmid, U. (2017). A versatile architecture for long-term monitoring of single-event transient durations. Microprocessors and Microsystems, 53, 130–144. https://doi.org/10.1016/j.micpro.2017.07.007
• On Linear-Time Data Dissemination in Dynamic Rooted Trees / Zeiner, M., Schmid, U., & Schwarz, M. (2017). On Linear-Time Data Dissemination in Dynamic Rooted Trees. In 19th ÖMG Congress and Annual DMV Meetig Program and Books of Abstracts (p. 87). http://hdl.handle.net/20.500.12708/57124

2016

• Unfaithful Glitch Propagation in Existing Binary Circuit Models / Függer, M., Nowak, T., & Schmid, U. (2016). Unfaithful Glitch Propagation in Existing Binary Circuit Models. IEEE Transactions on Computers, 65(3), 964–978. https://doi.org/10.1109/tc.2015.2435791
• HEX: Scaling Honeycombs is Easier than Scaling Clock Trees / Dolev, D., Függer, M., Lenzen, C., Perner, M., & Schmid, U. (2016). HEX: Scaling Honeycombs is Easier than Scaling Clock Trees. Journal of Computer and System Sciences, 82(5), 929–956. https://doi.org/10.1016/j.jcss.2016.03.001
• Easy Impossibility Proofs for k-Set Agreement / Schmid, U. (2016). Easy Impossibility Proofs for k-Set Agreement. Dagstuhl Seminar #16282 Topological Methods in Distributed Computing, Wadern, Germany. https://doi.org/10.4230/DagRep.6.7.31
• Reconciling Fault-Tolerance and Robustness ? / Schmid, U. (2016). Reconciling Fault-Tolerance and Robustness ? Workshop on Design and Analysis of Robust Systems @ CPS-Week 2016, Hofburg Vienna, Austria, Austria. http://hdl.handle.net/20.500.12708/86399
• Broadcasting in Random Trees / Zeiner, M., Schwarz, M., Winkler, K., & Schmid, U. (2016). Broadcasting in Random Trees. ALEA in Europe - Young Researchers Workshop, TU Wien, Austria. http://hdl.handle.net/20.500.12708/86332
• A Framework for Connectivity Monitoring in Wireless Sensor Networks / Pfleger, D., & Schmid, U. (2016). A Framework for Connectivity Monitoring in Wireless Sensor Networks. In Proceedings 10th International Conference on Sensor Technlogies and Applications (SENSORCOMM’16) (pp. 40–48). IARIA XPS Press. http://hdl.handle.net/20.500.12708/56746
• Fast consensus under eventually stabilizing message adversaries / Schwarz, M., Winkler, K., & Schmid, U. (2016). Fast consensus under eventually stabilizing message adversaries. In Proceedings of the 17th International Conference on Distributed Computing and Networking. 17th International Conference on Distributed Computing and Networking, Singapore, Non-EU. ACM. https://doi.org/10.1145/2833312.2833323
• Gracefully Degrading Consensus and k-Set Agreement in Directed Dynamic Networks / Biely, M., Robinson, P., Schmid, U., Schwarz, M., & Winkler, K. (2016). Gracefully Degrading Consensus and k-Set Agreement in Directed Dynamic Networks (TUW-258404). http://hdl.handle.net/20.500.12708/39151
• FWF-Proposal SPRG: Structural Properties of Random Graphs / Zeiner, M., Schmid, U., Schilcher, U., & Bettstetter, C. (2016). FWF-Proposal SPRG: Structural Properties of Random Graphs. http://hdl.handle.net/20.500.12708/39096

2015

• Building reliable systems-on-chip in nanoscale technologies / Steininger, A., Zimmermann, H., Jantsch, A., Hofbauer, M., Schmid, U., Schweiger, K., & Savulimedu Veeravalli, V. (2015). Building reliable systems-on-chip in nanoscale technologies. Elektrotechnik Und Informationstechnik, 132(6), 301–306. https://doi.org/10.1007/s00502-015-0319-0
• The effect of forgetting on the performance of a synchronizer / Függer, M., Kößler, A., Nowak, T., Schmid, U., & Zeiner, M. (2015). The effect of forgetting on the performance of a synchronizer. Performance Evaluation, 93, 1–16. https://doi.org/10.1016/j.peva.2015.08.002
• Fault-tolerant Distributed Systems in Hardware / Dolev, D., Függer, M., Lenzen, C., Schmid, U., & Steininger, A. (2015). Fault-tolerant Distributed Systems in Hardware. Bulletin of the EATCS, 2(116), 43. http://hdl.handle.net/20.500.12708/151760
• Optimal Strategies for Repeated Leader Election / Zeiner, M., Függer, M., Nowak, T., & Schmid, U. (2015). Optimal Strategies for Repeated Leader Election. Joint Austrian-Hungarian Mathematical Conference 2015, Györ, EU. http://hdl.handle.net/20.500.12708/86086
• Experimental Validation of a Faithful Binary Circuit Model / Najvirt, R., Függer, M., Nowak, T., Schmid, U., Hofbauer, M., & Schweiger, K. (2015). Experimental Validation of a Faithful Binary Circuit Model. In Proceedings of the 25th edition on Great Lakes Symposium on VLSI. Great Lakes Symposium on VLSI (GLSVLSI’15), Pittsburgh, Pennsylvania, USA, Non-EU. https://doi.org/10.1145/2742060.2742081
• Towards binary circuit models that faithfully capture physical solvability / Függer, M., Najvirt, R., Nowak, T., & Schmid, U. (2015). Towards binary circuit models that faithfully capture physical solvability. In Proceedings of the 2015 Design, Automation & Test in Europe Conference & Exhibition (DATE’15) (pp. 1455–1460). http://hdl.handle.net/20.500.12708/56310
• Gracefully Degrading Consensus and k-Set Agreement in Directed Dynamic Networks / Biely, M., Robinson, P., Schmid, U., Schwarz, M., & Winkler, K. (2015). Gracefully Degrading Consensus and k-Set Agreement in Directed Dynamic Networks. In Lecture Notes in Computer Science. The international Conference on NETworked sYStems, Agadir, Marokko, Non-EU. Springer LNCS. https://doi.org/10.1007/978-3-319-26850-7
• A Framework for Connectivity Monitoring in Wireless Sensor Networks / Pfleger, D., & Schmid, U. (2015). A Framework for Connectivity Monitoring in Wireless Sensor Networks (TUW-241107). http://hdl.handle.net/20.500.12708/38487
• Fast Consensus under Eventually Stabilizing Message Adversaries / Schwarz, M., Winkler, K., & Schmid, U. (2015). Fast Consensus under Eventually Stabilizing Message Adversaries (TUW-240061). http://hdl.handle.net/20.500.12708/38462

2014

• Rigorously modeling self-stabilizing fault-tolerant circuits: An ultra-robust clocking scheme for systems-on-chip / Dolev, D., Függer, M., Posch, M., Schmid, U., Steininger, A., & Lenzen, C. (2014). Rigorously modeling self-stabilizing fault-tolerant circuits: An ultra-robust clocking scheme for systems-on-chip. Journal of Computer and System Sciences, 80(4), 860–900. https://doi.org/10.1016/j.jcss.2014.01.001
• The Generalized Loneliness Detector and Weak System Models for k-Set Agreement / Biely, M., Robinson, P., & Schmid, U. (2014). The Generalized Loneliness Detector and Weak System Models for k-Set Agreement. IEEE Transactions on Parallel and Distributed Systems, 25(4), 1078–1088. https://doi.org/10.1109/tpds.2013.77
• Reconciling fault-tolerant distributed algorithms and real-time computing / Moser, H., & Schmid, U. (2014). Reconciling fault-tolerant distributed algorithms and real-time computing. Distributed Computing, 27(3), 203–230. https://doi.org/10.1007/s00446-013-0204-1
• Fault-tolerant Algorithms for Tick-generation in Asynchronous Logic: Robust Pulse Generation / Dolev, D., Függer, M., Schmid, U., & Lenzen, C. (2014). Fault-tolerant Algorithms for Tick-generation in Asynchronous Logic: Robust Pulse Generation. Journal of the ACM, 61(5), 1–74. https://doi.org/10.1145/2560561
• Brief announcement / Schwarz, M., Winkler, K., Schmid, U., Biely, M., & Robinson, P. (2014). Brief announcement. In Proceedings of the 2014 ACM symposium on Principles of distributed computing - PODC ’14. 33th ACM SIGACTSIGOPS Symposium on Principles of Distributed Computing (PODC), Paris, France, EU. ACM. https://doi.org/10.1145/2611462.2611506
• A Framework for Automated Competitive Analysis of On-line Scheduling of Firm-Deadline Tasks / Pavlogiannis, A., Chatterjee, K., Schmid, U., & Kößler, A. (2014). A Framework for Automated Competitive Analysis of On-line Scheduling of Firm-Deadline Tasks. In 2014 IEEE Real-Time Systems Symposium. 35th IEEE Real-Time Systems Symposium, Rome, EU. https://doi.org/10.1109/rtss.2014.9
• Measuring SET pulsewidths in logic gates using digital infrastructure / Veeravalli, V. S., Steininger, A., & Schmid, U. (2014). Measuring SET pulsewidths in logic gates using digital infrastructure. In Fifteenth International Symposium on Quality Electronic Design. 15th International Symposium & Exhibit on Quality Electronic Design, Santa Clara, USA, Non-EU. https://doi.org/10.1109/isqed.2014.6783331
• FWF-Proposal ADynNet: Gracefully Degrading Agreement in Directed Dynamic Networks / Schmid, U. (2014). FWF-Proposal ADynNet: Gracefully Degrading Agreement in Directed Dynamic Networks (TUW-235381). http://hdl.handle.net/20.500.12708/38308
• Final Report FWF FATAL-Project (P21694) / Schmid, U. (2014). Final Report FWF FATAL-Project (P21694) (TUW-235380). http://hdl.handle.net/20.500.12708/38307
• Tutorial on Parameterized Model Checking of Fault-Tolerant Distributed Algorithms / Gmeiner, A., Konnov, I., Schmid, U., Veith, H., & Widder, J. (2014). Tutorial on Parameterized Model Checking of Fault-Tolerant Distributed Algorithms. In Lecture Notes in Computer Science (pp. 122–171). Springer. https://doi.org/10.1007/978-3-319-07317-0_4

2013

• Supply Voltage Dependent On-Chip Single-Event Transient Pulse Shape Measurements in 90-nm Bulk CMOS Under Alpha Irradiation / Hofbauer, M., Schweiger, K., Zimmermann, H., Giesen, U., Langner, F., Schmid, U., & Steininger, A. (2013). Supply Voltage Dependent On-Chip Single-Event Transient Pulse Shape Measurements in 90-nm Bulk CMOS Under Alpha Irradiation. IEEE Transactions on Nuclear Science, 60(4), 2640–2646. http://hdl.handle.net/20.500.12708/156043
• An infrastructure for accurate characterization of single-event transients in digital circuits / Veeravalli, V. S., Polzer, T., Schmid, U., Steininger, A., Hofbauer, M., Schweiger, K., Dietrich, H., Schneider-Hornstein, K., Zimmermann, H., Voss, K.-O., Merk, B., & Hajek, M. (2013). An infrastructure for accurate characterization of single-event transients in digital circuits. Microprocessors and Microsystems, 37, 772–791. http://hdl.handle.net/20.500.12708/156041
• The Effect of Forgetting on the Performance of a Synchronizer / Zeiner, M., Függer, M., Schmid, U., Kößler, A., & Nowak, T. (2013). The Effect of Forgetting on the Performance of a Synchronizer. 18th ÖMG Congress and Annual DMV Meeting, Universität Innsbruck, Austria. http://hdl.handle.net/20.500.12708/85720
• FATAL+HEX: Fault-Tolerant Self-Stabilizing Clock Generation+Distribution / Dolev, D., Függer, M., Hofstätter, M., Lenzen, C., Perner, M., Posch, M., Schmid, U., Sigl, M., & Steininger, A. (2013). FATAL+HEX: Fault-Tolerant Self-Stabilizing Clock Generation+Distribution. Poster Session at the CSAIL Industry Affiliates Program (CSAIL-IAP) Annual Meeting, Cambridge, MA, USA, Non-EU. http://hdl.handle.net/20.500.12708/85710
• Single Event Transient Pulse Shape Measurements by On-chip Sense Amplifiers in a Single Inverter for Intermediate Input States under Alpha Particle Irradiation / Hofbauer, M., Schweiger, K., Gaberl, W., Zimmermann, H., Giesen, U., Langner, F., Schmid, U., & Steininger, A. (2013). Single Event Transient Pulse Shape Measurements by On-chip Sense Amplifiers in a Single Inverter for Intermediate Input States under Alpha Particle Irradiation. IEEE Nuclear and Space Radiation Effects Conference (NSREC), San Francisco, California (USA), Non-EU. http://hdl.handle.net/20.500.12708/85741
• Automated Analysis of Real-Time Scheduling using Graph Games / Chatterjee, K., Kößler, A., & Schmid, U. (2013). Automated Analysis of Real-Time Scheduling using Graph Games. In Proceedings 16th ACM International Conference on Hybrid Systems: Computation and Control (HSCC’13) (pp. 163–172). ACM. http://hdl.handle.net/20.500.12708/55031
• Unfaithful Glitch Propagation in Existing Binary Circuit Models / Függer, M., Nowak, T., & Schmid, U. (2013). Unfaithful Glitch Propagation in Existing Binary Circuit Models. In 2013 IEEE 19th International Symposium on Asynchronous Circuits and Systems. 19th IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC 2013), Santa Monica, CA, Non-EU. https://doi.org/10.1109/async.2013.9
• Efficient Construction of Global Time in SoCs Despite Arbitrary Faults / Lenzen, C., Függer, M., Hofstätter, M., & Schmid, U. (2013). Efficient Construction of Global Time in SoCs Despite Arbitrary Faults. In 2013 Euromicro Conference on Digital System Design. 16th Euromicro Conference on Digital System Design (DSD 2013), Santander, Spain, EU. Digital System Design (DSD), 2013 Euromicro Conference on. https://doi.org/10.1109/dsd.2013.97
• Byzantine Self-Stabilizing Clock Distribution with HEX: Implementation, Simulation, Clock Multiplication / Perner, M., Schmid, U., Lenzen, C., & Sigl, M. (2013). Byzantine Self-Stabilizing Clock Distribution with HEX: Implementation, Simulation, Clock Multiplication. In Proceedings of the 6th IARA International Conference on Dependability (DEPEND’13) (pp. 6–15). IARA. http://hdl.handle.net/20.500.12708/54927
• The Effect of Forgetting on the Performance of a Synchronizer / Függer, M., Kößler, A., Nowak, T., Schmid, U., & Zeiner, M. (2013). The Effect of Forgetting on the Performance of a Synchronizer. In Algorithms for Sensor Systems (pp. 185–200). https://doi.org/10.1007/978-3-642-45346-5_14
• HEX / Dolev, D., Lenzen, C., Függer, M., Schmid, U., & Perner, M. (2013). HEX. In Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures. SPAA ’13, Montreal, Canada, Non-EU. ACM. https://doi.org/10.1145/2486159.2486192
• Brief announcement / John, A., Konnov, I., Schmid, U., Veith, H., & Widder, J. (2013). Brief announcement. In Proceedings of the 2013 ACM symposium on Principles of distributed computing - PODC ’13. ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), Montreal, Kanada, Non-EU. ACM. https://doi.org/10.1145/2484239.2484285
• Parameterized model checking of fault-tolerant distributed algorithms by abstraction / John, A., Konnov, I., Schmid, U., Veith, H., & Widder, J. (2013). Parameterized model checking of fault-tolerant distributed algorithms by abstraction. In FMCAD (pp. 201–209). http://hdl.handle.net/20.500.12708/54827
• Towards Modeling and Model Checking Fault-Tolerant Distributed Algorithms / John, A., Konnov, I., Schmid, U., Veith, H., & Widder, J. (2013). Towards Modeling and Model Checking Fault-Tolerant Distributed Algorithms. In Model Checking Software (pp. 209–226). LNCS, Springer. https://doi.org/10.1007/978-3-642-39176-7_14
• Gracefully Degrading Consensus and k-set Agreement under Dynamic Link Failures / Schwarz, M., Winkler, K., Schmid, U., Biely, M., & Robinson, P. (2013). Gracefully Degrading Consensus and k-set Agreement under Dynamic Link Failures (TUW-220473). http://hdl.handle.net/20.500.12708/37755
• Final Report FWF PSRTS-Project (P20529) / Schmid, U. (2013). Final Report FWF PSRTS-Project (P20529) (TUW-235379). http://hdl.handle.net/20.500.12708/38306

2012

• Pulse Shape Measurements by On-chip Sense Amplifiers of Single Event Transients Propagating Through a 90 nm Bulk CMOS Inverter Chain / Hofbauer, M., Schweiger, K., Dietrich, H., Zimmermann, H., Voss, K.-O., Merk, B., Schmid, U., & Steininger, A. (2012). Pulse Shape Measurements by On-chip Sense Amplifiers of Single Event Transients Propagating Through a 90 nm Bulk CMOS Inverter Chain. IEEE Transactions on Nuclear Science, 59(6), 2778–2784. https://doi.org/10.1109/tns.2012.2223233
• Reconciling fault-tolerant distributed computing and systems-on-chip / Függer, M., & Schmid, U. (2012). Reconciling fault-tolerant distributed computing and systems-on-chip. Distributed Computing, 24(6), 323–355. https://doi.org/10.1007/s00446-011-0151-7
• Single Event Effect Measurements in 90nm CMOS Circuits at the Microbeam Facility for the Project FATAL / Hofbauer, M., Schweiger, K., Dietrich, H., Zimmermann, H., Schmid, U., & Merk, B. (2012). Single Event Effect Measurements in 90nm CMOS Circuits at the Microbeam Facility for the Project FATAL. In GSI Scientific Report 2011 (p. 424). GSI Helmholtzzentrum für Schwerionenforschung GmbH. http://hdl.handle.net/20.500.12708/73103
• Pulse Shape Measurements by On-chip Sense Amplifiers of Single Event Transients Propagating through a 90 nm Bulk CMOS Inverter Chain / Hofbauer, M., Schweiger, K., Dietrich, H., Zimmermann, H., Voss, K. O., Merk, B., Schmid, U., & Steininger, A. (2012). Pulse Shape Measurements by On-chip Sense Amplifiers of Single Event Transients Propagating through a 90 nm Bulk CMOS Inverter Chain. Nuclear and Space Radiation Effects Conference (NSREC), Miami, FL, USA, Non-EU. http://hdl.handle.net/20.500.12708/89963
• Towards Self-stabilizing Byzantine Fault-Tolerant Clock Generation in Systems-on-Chip / Dolev, D., Függer, M., Lenzen, C., & Schmid, U. (2012). Towards Self-stabilizing Byzantine Fault-Tolerant Clock Generation in Systems-on-Chip. NITRD Workshop, Baltimore, USA, Non-EU. http://hdl.handle.net/20.500.12708/85536
• Who is afraid of Model Checking Distributed Algorithms? / John, A., Konnov, I., Schmid, U., Veith, H., & Widder, J. (2012). Who is afraid of Model Checking Distributed Algorithms? PUMA/RISE Seminar, Traunkirchen, Austria. http://hdl.handle.net/20.500.12708/85435
• Parameterized Model Checking of Fault-tolerant Distributed Algorithms / John, A., Konnov, I., Schmid, U., Veith, H., & Widder, J. (2012). Parameterized Model Checking of Fault-tolerant Distributed Algorithms. Dagstuhl Seminar 12461: Games and Decisions for Rigorous Systems Engineering, Dagstuhl, Deutschland, EU. http://hdl.handle.net/20.500.12708/85432
• Counter Attack against Byzantine Generals / John, A., Konnov, I., Schmid, U., Veith, H., & Widder, J. (2012). Counter Attack against Byzantine Generals. Alpine Verification Meeting, IST Austria, Austria. http://hdl.handle.net/20.500.12708/85359
• Supply Voltage Dependent On-chip Single Event Transient Pulse Shape Measurements in 90 nm Bulk CMOS under Alpha Irradiation / Hofbauer, M., Schweiger, K., Zimmermann, H., Giesen, U., Langner, F., Schmid, U., & Steininger, A. (2012). Supply Voltage Dependent On-chip Single Event Transient Pulse Shape Measurements in 90 nm Bulk CMOS under Alpha Irradiation. In Proceedings 21st European Conference on Radiation and its Effects on Components and Systems (RADECS’12). 21st European Conference on Radiation and its Effects on Components and Systems (RADECS’12), Biarritz, FRANCE, EU. http://hdl.handle.net/20.500.12708/54565
• Architecture and Design Analysis of a Digital Single-Event Transient/Upset Measurement Chip / Veeravalli, V. S., Steininger, A., Schmid, U., & Polzer, T. (2012). Architecture and Design Analysis of a Digital Single-Event Transient/Upset Measurement Chip. In Proceedings 15th Euromicro Symposium on Digital System Design: Architectures, Methods and Tools (DSD’12) (pp. 8–17). http://hdl.handle.net/20.500.12708/54564
• Agreement in Directed Dynamic Networks / Biely, M., Robinson, P., & Schmid, U. (2012). Agreement in Directed Dynamic Networks. In Proceedings 19th International Colloquium on Structural Information and Communication Complexity (SIROCCO’12) (pp. 73–84). http://hdl.handle.net/20.500.12708/54563
• Messung der Auswirkungen von ionisierender Strahlung auf 90 nm CMOS Schaltungen / Hofbauer, M., Schweiger, K., Dietrich, H., Zimmermann, H., Schmid, U., & Giesen, U. (2012). Messung der Auswirkungen von ionisierender Strahlung auf 90 nm CMOS Schaltungen. http://hdl.handle.net/20.500.12708/37567

2011

• The Asynchronous Bounded-Cycle Model / Robinson, P., & Schmid, U. (2011). The Asynchronous Bounded-Cycle Model. Theoretical Computer Science, 412(40), 5580–5601. https://doi.org/10.1016/j.tcs.2010.08.001
• Synchronous consensus under hybrid process and link failures / Biely, M., Schmid, U., & Weiss, B. (2011). Synchronous consensus under hybrid process and link failures. Theoretical Computer Science, 412(40), 5602–5630. https://doi.org/10.1016/j.tcs.2010.09.032
• Easy Impossibility Proofs for k-Set Agreement in Message Passing Systems / Biely, M., Robinson, P., & Schmid, U. (2011). Easy Impossibility Proofs for k-Set Agreement in Message Passing Systems. In OPODIS’11 (pp. 299–312). Springer Berlin / Heidelberg. http://hdl.handle.net/20.500.12708/54094
• Brief Announcement: Easy Impossibility Proofs for k-Set Agreement in Message Passing Systems / Biely, M., Robinson, P., & Schmid, U. (2011). Brief Announcement: Easy Impossibility Proofs for k-Set Agreement in Message Passing Systems. In PODC’11 (pp. 227–228). ACM. http://hdl.handle.net/20.500.12708/54097
• Reconciling Fault-Tolerant Distributed Algorithms and Real-Time Computing / Moser, H., & Schmid, U. (2011). Reconciling Fault-Tolerant Distributed Algorithms and Real-Time Computing. In Structural Information and Communication Complexity (pp. 42–53). Springer Berlin / Heidelberg. https://doi.org/10.1007/978-3-642-22212-2_5
• Solving k-Set Agreement with Stable Skeleton Graphs / Biely, M., Robinson, P., & Schmid, U. (2011). Solving k-Set Agreement with Stable Skeleton Graphs. In 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum. International Parallel and Distributed Processing Symposium (IPDPS), Denver, Colorado, Austria. https://doi.org/10.1109/ipdps.2011.301
• Fault-Tolerant Algorithms for Tick-Generation in Asynchronous Logic: Robust Pulse Generation / Dolev, D., Függer, M., Lenzen, C., & Schmid, U. (2011). Fault-Tolerant Algorithms for Tick-Generation in Asynchronous Logic: Robust Pulse Generation. In Lecture Notes in Computer Science (pp. 163–177). Springer Berlin / Heidelberg. https://doi.org/10.1007/978-3-642-24550-3_14

2010

• Topology Control for Fault-Tolerant Communication in Wireless Ad Hoc Networks / Thallner, B., Moser, H., & Schmid, U. (2010). Topology Control for Fault-Tolerant Communication in Wireless Ad Hoc Networks. Wireless Networks, 16(2), 387–404. https://doi.org/10.1007/s11276-008-0139-9
• A New Robust Interference Reduction Scheme for Low Complexity Direct-Sequence Spread-Spectrum Receivers: Performance / Goiser, A., Khattab, S., Fassl, G., & Schmid, U. (2010). A New Robust Interference Reduction Scheme for Low Complexity Direct-Sequence Spread-Spectrum Receivers: Performance. In CTRQ-2010 (p. 7). IEEE Conference Proceedings. http://hdl.handle.net/20.500.12708/71631
• A New Robust Interference Reduction Scheme for Low Complexity Direct-Sequence Spread-Spectrum Receivers: Optimization / Goiser, A. M. J., Khattab, S., Fassl, G., & Schmid, U. (2010). A New Robust Interference Reduction Scheme for Low Complexity Direct-Sequence Spread-Spectrum Receivers: Optimization. In 2010 Third International Conference on Communication Theory, Reliability, and Quality of Service. IEEE-Explore, Austria. IEEE Computer Society. https://doi.org/10.1109/ctrq.2010.51
• Synchrony and Time in Fault-Tolerant Distribiuted Algorithms / Schmid, U. (2010). Synchrony and Time in Fault-Tolerant Distribiuted Algorithms. In Formal Modeling and Analysis of Timed Systems. FORMATS 2010 (Formal Modeling and Analysis of Times Systems), Klosterneuburg, Austria, Austria. Springer. http://hdl.handle.net/20.500.12708/53556
• Real-Time Analysis of Round-based Distributed Algorithms / Kößler, A., Moser, H., & Schmid, U. (2010). Real-Time Analysis of Round-based Distributed Algorithms. In Proceedings of the 1st International Real-Time Scheduling Open Problems Seminar (pp. 9–11). http://hdl.handle.net/20.500.12708/53495
• How to Speed-Up Fault-Tolerant Clock Generation in VLSI Systems-on-Chip via Pipelining / Függer, M., Dielacher, A., & Schmid, U. (2010). How to Speed-Up Fault-Tolerant Clock Generation in VLSI Systems-on-Chip via Pipelining. In 2010 European Dependable Computing Conference. EDCC - 8 (European Dependable Computing Conference), Valencia, Spain, EU. IEEE Computer Society. https://doi.org/10.1109/edcc.2010.35

2009

• Chasing the Weakest System Model for Implementing Ω and Consensus / Hutle, M., Malkhi, D., Schmid, U., & Zhou, L. (2009). Chasing the Weakest System Model for Implementing Ω and Consensus. IEEE Transactions on Dependable and Secure Computing, 6(4), 269–281. https://doi.org/10.1109/tdsc.2008.24
• Impossibility Results and Lower Bounds For Consensus Under Link Failures / Schmid, U., Weiss, B., & Keidar, I. (2009). Impossibility Results and Lower Bounds For Consensus Under Link Failures. SIAM Journal on Computing, 38(5), 1912–1951. https://doi.org/10.1137/s009753970443999x
• The Theta-Model: achieving synchrony without clocks / Widder, J., & Schmid, U. (2009). The Theta-Model: achieving synchrony without clocks. Distributed Computing, 22(1), 29–47. https://doi.org/10.1007/s00446-009-0080-x
• Weak Synchrony Models and Failure Detectors for Message Passing (𝑘-)Set Agreement / Biely, M., Robinson, P., & Schmid, U. (2009). Weak Synchrony Models and Failure Detectors for Message Passing (𝑘-)Set Agreement. In T. Abdelzaher, M. Raynal, & N. Santoro (Eds.), Principles of Distributed Systems: 13th International Conference, OPODIS 2009, Nîmes, France, December 15-18, 2009. Proceedings (pp. 285–299). Springer. https://doi.org/10.1007/978-3-642-10877-8_23
• Brief Announcment: Weak Synchrony Models and Failure Detectors for Message Passing (𝑘-)Set Agreement / Biely, M., Robinson, P., & Schmid, U. (2009). Brief Announcment: Weak Synchrony Models and Failure Detectors for Message Passing (𝑘-)Set Agreement. In I. Keidar (Ed.), Distributed Computing: 23rd International Symposium, DISC 2009, Elche, Spain, September 23-25, 2009, Proceedings (pp. 360–361). Springer. https://doi.org/10.1007/978-3-642-04355-0_38
• Fault Tolerant Distribiuted Algorithms and VLSI - An Appetizer / Charron-Bost, B., Dolev, S., Ebergen, J., & Schmid, U. (2009). Fault Tolerant Distribiuted Algorithms and VLSI - An Appetizer. In Fault-Tolerant Distributed Algorithms on VLSI Chips (p. ?). Leibniz Zentrum Informatik. http://hdl.handle.net/20.500.12708/52874

2008

• The Asynchronous Bounded Cycle Model / Robinson, P., & Schmid, U. (2008). The Asynchronous Bounded Cycle Model. In Lecture Notes in Computer Science. 10 International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2008), Detroit, USA, Non-EU. Lecture Notes in Conputer Science / Springer Verlag. https://doi.org/10.1007/978-3-540-89335-6
• Optimal Deterministic Remote Clock Estimation in Real-Time Systems / Moser, H., & Schmid, U. (2008). Optimal Deterministic Remote Clock Estimation in Real-Time Systems. In Lecture Notes in Computer Science (pp. 363–387). Lecture Notes in Computer Science / Springer Verlag. https://doi.org/10.1007/978-3-540-92221-6_24
• Mapping a Fault-Tolerant Distributed Algorithm to Systems on Chip / Fuchs, G., Függer, M., Schmid, U., & Steininger, A. (2008). Mapping a Fault-Tolerant Distributed Algorithm to Systems on Chip. In 2008 11th EUROMICRO Conference on Digital System Design Architectures, Methods and Tools. 11th EUROMICRO Conference on Digital System Design (DSD 2008), Parma, Italien, EU. IEEE. https://doi.org/10.1109/dsd.2008.65
  Project: DARTS (2005–2010)
• Keynote: Distributed Algorithms and VLSI / Schmid, U. (2008). Keynote: Distributed Algorithms and VLSI. In Lecture Notes in Computer Science (pp. 3–3). Lecture Notes in Conputer Science / Springer Verlag. https://doi.org/10.1007/978-3-540-89335-6_3
• The asynchronous bounded-cycle model / Schmid, U., & Robinson, P. (2008). The asynchronous bounded-cycle model. In Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing - PODC ’08. ACM Symposium on Principles of Distributed Computing, Las Vegas, Nevada, Austria. Association for Computing Machinery (ACM). https://doi.org/10.1145/1400751.1400815

2007

• FIT-IT Projekt DARTS: Dezentrale fehlertolerante Taktgenerierung / Schmid, U., Steininger, A., & Sust, M. (2007). FIT-IT Projekt DARTS: Dezentrale fehlertolerante Taktgenerierung. Elektrotechnik und Informationstechnik : e & i, 124(1–2), 3–8. https://doi.org/10.1007/s00502-006-0409-0
• LTCC: a fascinating technology platform for miniaturized devices / Schmid, U. (2007). LTCC: a fascinating technology platform for miniaturized devices. In T. Becker, C. Cané, & N. S. Barker (Eds.), Smart Sensors, Actuators, and MEMS III (Proceedings Volume). SPIE. https://doi.org/10.1117/12.722793
• Towards a Systematic Design of Fault-Tolerant Asynchronous Circuits / Schmid, U., Steininger, A., & Veith, H. (2007). Towards a Systematic Design of Fault-Tolerant Asynchronous Circuits. In Fachtagung Zuverlässigkeit und Entwurf (pp. 173–174). VDE Verlag. http://hdl.handle.net/20.500.12708/51805
• A Perspective of Fault-Tolerant Clock Synchronization / Schmid, U. (2007). A Perspective of Fault-Tolerant Clock Synchronization. In IEEE Symposium on Precision Clock Synchronization for Measurement, Control and Communication. 2007 IEEE International Symposium on Precision Clock Synchronization for Measurement, Control and Communication, Vienna, Austria. http://hdl.handle.net/20.500.12708/52101
• Booting Clock Synchronization in Partially Synchronous Systems with Hybrid Process and Link Failures / Widder, J., & Schmid, U. (2007). Booting Clock Synchronization in Partially Synchronous Systems with Hybrid Process and Link Failures. In Distributed Computing (pp. 115–140). Springer-Verlag. http://hdl.handle.net/20.500.12708/25412

2006

• Wissenschaftliche Forschung - Quo vadis? / Schmid, U. (2006). Wissenschaftliche Forschung - Quo vadis? IKT in Österreich 2006, Wien, Austria. http://hdl.handle.net/20.500.12708/84587
• Construction of a Fault-Tolerant Wireless Communication Topology Using Distributed Agreement / Moser, H., & Schmid, U. (2006). Construction of a Fault-Tolerant Wireless Communication Topology Using Distributed Agreement. In Junior Scientiest Conferenve 2006 (pp. 47–48). http://hdl.handle.net/20.500.12708/51662
• Optimal clock synchronization revisited: Upper and lower bounds in real-time systems / Moser, H., & Schmid, U. (2006). Optimal clock synchronization revisited: Upper and lower bounds in real-time systems. In Principles of Distributed Systems (pp. 94–109). http://hdl.handle.net/20.500.12708/51661
• Brief Announcement: Chasing the Weakest System Model for Implementing Omega and Consensus / Hutle, M., Malkhi, D., Schmid, U., & Zhou, L. (2006). Brief Announcement: Chasing the Weakest System Model for Implementing Omega and Consensus. In Stabilization, Safety, and Security of Distributed Systems. 8th International Symposium on Stabilization, Safety, and Security of Distributed Systems, Dallas, Non-EU. http://hdl.handle.net/20.500.12708/51635
• Efficient Position-based Communication in Wireless Ad-hoc Networks / Stratil, H., & Schmid, U. (2006). Efficient Position-based Communication in Wireless Ad-hoc Networks. In Junior Scientist Conference 2006 (pp. 75–76). http://hdl.handle.net/20.500.12708/51571
• Fault-Tolerant Algorithms on SoCs - A case study / Steininger, A., Függer, M., Schmid, U., & Fuchs, G. (2006). Fault-Tolerant Algorithms on SoCs - A case study. In Supplement Proceedings of the 2006 International Conference on Dependable Systems and Networks (DSN) (pp. 190–191). http://hdl.handle.net/20.500.12708/51508
  Project: DARTS (2005–2010)
• Fault-Tolerant Distributed Clock Generation in VLSI Systems-on-Chip / Függer, M., Schmid, U., Fuchs, G., & Kempf, G. (2006). Fault-Tolerant Distributed Clock Generation in VLSI Systems-on-Chip. In EDCC-6 (pp. 87–96). http://hdl.handle.net/20.500.12708/51507
  Project: DARTS (2005–2010)
• Threshold Modules -- Die Schlüsselelemente zur Verteilten Generierung eines Fehlertoleranten Taktes / Fuchs, G., Grahsl, J., Schmid, U., Steininger, A., & Kempf, G. (2006). Threshold Modules -- Die Schlüsselelemente zur Verteilten Generierung eines Fehlertoleranten Taktes. In Austrochip Mikroelektroniktagung (pp. 149–156). http://hdl.handle.net/20.500.12708/51506
  Project: DARTS (2005–2010)

2005

• Dependable Embedded Systems Research at TU Vienna / Kopetz, H., Obermaisser, R., & Schmid, U. (2005). Dependable Embedded Systems Research at TU Vienna. Elektrotechnik Und Informationstechnik : E & i, 122(1), 33–37. https://doi.org/10.1007/BF03054020
• On the Possibility of Consensus in Asynchronous Systems with Finite Average Response Times / Fetzer, C., Süßkraut, M., & Schmid, U. (2005). On the Possibility of Consensus in Asynchronous Systems with Finite Average Response Times. In On the Possibility of Consensus in Asynchronous Systems with Finite Average Response Times (pp. 271–280). IEEE Computer Society. http://hdl.handle.net/20.500.12708/51169
• Proof-Based Systems Engineering in ASSERT / Le Lann, G., & Schmid, U. (2005). Proof-Based Systems Engineering in ASSERT. In Proof-Based Systems Engineering in ASSERT. Data Systems in Aerospace, Edinburgh, EU. http://hdl.handle.net/20.500.12708/51168
• Proof-Based System Engineering Using a Virtual System Model / Biely, M., Le Lann, G., & Schmid, U. (2005). Proof-Based System Engineering Using a Virtual System Model. In Service Availability (pp. 164–179). http://hdl.handle.net/20.500.12708/51125
• Failure Detection with Booting in Partially Synchronous Systems / Widder, J., Le Lann, G., & Schmid, U. (2005). Failure Detection with Booting in Partially Synchronous Systems. In Dependable Computing Conference - EDCC5 (pp. 20–37). http://hdl.handle.net/20.500.12708/51123
• Antrag UNI-Infrastruktur III, Embedded Systems Research Cluster / Schmid, U., Kopetz, H., Puschner, P., Mayerhofer, L., Steininger, A., Grünbacher, H., Kastner, W., & Krall, A. (2005). Antrag UNI-Infrastruktur III, Embedded Systems Research Cluster. http://hdl.handle.net/20.500.12708/33035

2004

• The Theta-Model / Schmid, U. (2004). The Theta-Model. Diskussionskreis Fehlertoleranz, Berlin, Austria. http://hdl.handle.net/20.500.12708/84386
• On the Possibility of Consensus in Asynchronous Systems with Finite Average Response Times / Fetzer, C., & Schmid, U. (2004). On the Possibility of Consensus in Asynchronous Systems with Finite Average Response Times. http://hdl.handle.net/20.500.12708/33010
• Distributed Construction of Sparse Fault-Tolerant Overlay Networks / Thallner, B., & Schmid, U. (2004). Distributed Construction of Sparse Fault-Tolerant Overlay Networks. http://hdl.handle.net/20.500.12708/33011
• DARTS - Distributed Algorithms for Robust Tick Synchronization / Fuchs, G., Schmid, U., & Steininger, A. (2004). DARTS - Distributed Algorithms for Robust Tick Synchronization. http://hdl.handle.net/20.500.12708/32990
• Dezentrale Fehlertolerante Taktgenerierung in VLSI Chips / Schmid, U., & Steininger, A. (2004). Dezentrale Fehlertolerante Taktgenerierung in VLSI Chips. http://hdl.handle.net/20.500.12708/32988
• Final Report START-Project Y41 / Schmid, U. (2004). Final Report START-Project Y41. http://hdl.handle.net/20.500.12708/32980
• Ein Verfahren für das verteilte Generieren eines fehlertoleranten adaptiven Taktes in Hardware / Fuchs, G., Schmid, U., & Steininger, A. (2004). Ein Verfahren für das verteilte Generieren eines fehlertoleranten adaptiven Taktes in Hardware. http://hdl.handle.net/20.500.12708/32979
  Project: DARTS (2005–2010)
• Fault-Tolerant Distributed Algorithms in Sparse Ad Hoc Wireless Networks / Schmid, U., & Weiss, B. (2004). Fault-Tolerant Distributed Algorithms in Sparse Ad Hoc Wireless Networks. http://hdl.handle.net/20.500.12708/32977
• Failure Model Coverage under Transient Link Failures / Schmid, U. (2004). Failure Model Coverage under Transient Link Failures. http://hdl.handle.net/20.500.12708/32975
• Synchronous Byzantine Agreement under Hybrid Process and Link Failures / Schmid, U., & Weiss, B. (2004). Synchronous Byzantine Agreement under Hybrid Process and Link Failures. http://hdl.handle.net/20.500.12708/32974

2003

• Perfect failure detection with booting in partially synchronous systems / Widder, J., Le Lann, G., & Schmid, U. (2003). Perfect failure detection with booting in partially synchronous systems. http://hdl.handle.net/20.500.12708/32910
• Booting clock synchronization in partially synchronous systems with hybrid node and link failures. / Widder, J., & Schmid, U. (2003). Booting clock synchronization in partially synchronous systems with hybrid node and link failures. http://hdl.handle.net/20.500.12708/32911
• Impossibility results and lower bounds for consensus under link failures. / Schmid, U., & Weiss, B. (2003). Impossibility results and lower bounds for consensus under link failures. http://hdl.handle.net/20.500.12708/32908
• Fault tolerant communication topologies for wireless ad hoc networks / Thallner, B., & Schmid, U. (2003). Fault tolerant communication topologies for wireless ad hoc networks. http://hdl.handle.net/20.500.12708/32909
• How to maximize computing systems coverage / Le Lann, G., & Schmid, U. (2003). How to maximize computing systems coverage. http://hdl.handle.net/20.500.12708/32905
• How to implement a timer-free perfect failure detector in partially synchronous systems. / Le Lann, G., & Schmid, U. (2003). How to implement a timer-free perfect failure detector in partially synchronous systems. http://hdl.handle.net/20.500.12708/32906
• Projektbericht Technische Informatik: Seamless Campus / Vilanek, J., Schmid, U., Kastner, W., Weiss, B., Puschner, P., Elmenreich, W., Deinhart, H., & Meyer, W. (2003). Projektbericht Technische Informatik: Seamless Campus. http://hdl.handle.net/20.500.12708/32898

2002

• Randomized asynchronous consensus with imperfect communications / Schmid, U., & Fetzer, C. (2002). Randomized asynchronous consensus with imperfect communications. http://hdl.handle.net/20.500.12708/32907

2001

• Applied Research: A Scientist's Perspective / Schmid, U. (2001). Applied Research: A Scientist’s Perspective. Annual Reviews in Control, 25, 183–190. http://hdl.handle.net/20.500.12708/174812
• How to reconcile fault-tolerant interval intersection with the Lipschitz condition / Schmid, U., & Schossmaier, K. (2001). How to reconcile fault-tolerant interval intersection with the Lipschitz condition. Distributed Computing, 14(2), 101–111. http://hdl.handle.net/20.500.12708/174811
• Versuch über die wahre Art, das Clavier zu spielen / Schmid, U. (2001). Versuch über die wahre Art, das Clavier zu spielen. Berufungsvortrag, Vienna, Austria, Austria. http://hdl.handle.net/20.500.12708/84189
• Consensus with written messages under link faults / Weiss, B., & Schmid, U. (2001). Consensus with written messages under link faults. In Proc. 20th Symposium on Reliable Distributed Systems (SRDS’01) (pp. 194–197). http://hdl.handle.net/20.500.12708/50920
• Message-efficient consensus in presence of hybrid node and link faults / Biely, M., & Schmid, U. (2001). Message-efficient consensus in presence of hybrid node and link faults. http://hdl.handle.net/20.500.12708/32915

2000

• Orthogonal accuracy clock synchronization / Schmid, U. (2000). Orthogonal accuracy clock synchronization. Chicago Journal of Theoretical Computer Science, 3, 3–77. http://hdl.handle.net/20.500.12708/174813
• High-Accuracy Time Services and Fault-Tolerant Clock Synchronization / Schmid, U. (2000). High-Accuracy Time Services and Fault-Tolerant Clock Synchronization. In Workshop on “Time and Dependability” (pp. 39–57). http://hdl.handle.net/20.500.12708/50924
• A network interface for highly accurate clock synchronization / Horauer, M., Kerö, N., & Schmid, U. (2000). A network interface for highly accurate clock synchronization. In Proc. AUSTROCHIP’00 (pp. 93–101). http://hdl.handle.net/20.500.12708/50923
• Applied Research: A Scientist's Perspective / Schmid, U. (2000). Applied Research: A Scientist’s Perspective. In Proc. of the joint 25th IFAC/IFIP Workshop on Real-Time Programming (WRTP’00) and Workshop on Algorithms and Architectures for Real-Time Control (AARTC’00) (pp. 5–12). http://hdl.handle.net/20.500.12708/50922
• How to distribute GPS-time over COTS-based LANs / Schmid, U., Horauer, M., & Kerö, N. (2000). How to distribute GPS-time over COTS-based LANs. In Proc. of the 31st IEEE Precise Time and Time Interval Systems and Application Meeting (PTTI’99) (pp. 545–560). http://hdl.handle.net/20.500.12708/50921
• Beispielsammlung zur Laborübung Prozeßautomatisierung (TR 183/1-106-b) / Kastner, W., Weiss, B., & Schmid, U. (2000). Beispielsammlung zur Laborübung Prozeßautomatisierung (TR 183/1-106-b). http://hdl.handle.net/20.500.12708/32879
• Skriptum zur Laborübung "Prozeßautomatisierung" / Schmid, U., Kastner, W., Burgstaller, B., & Kral, C. (2000). Skriptum zur Laborübung “Prozeßautomatisierung.” http://hdl.handle.net/20.500.12708/32876

1999

• A unified approach for simulation and experimental evaluation of fault-tolerant distributed systems / Schmid, U., Weiss, B., Gridling, G., & Schossmaier, K. (1999). A unified approach for simulation and experimental evaluation of fault-tolerant distributed systems. In Proc. of the IASTED International Conference on Applied Modelling and Simulation (AMS’99) (pp. 43–48). http://hdl.handle.net/20.500.12708/50927
• Experimental evaluation of high-accuracy time distribution in a COTS-based Ethernet LAN / Schmid, U., & Nachtnebel, H. (1999). Experimental evaluation of high-accuracy time distribution in a COTS-based Ethernet LAN. In Proc. 24th IFAC/IFIP Workshop on Real-Time Programming (WRTP’99) (pp. 59–68). http://hdl.handle.net/20.500.12708/50926
• The SimUTC fault-tolerant distributed systems simulation toolkit / Weiss, B., Gridling, G., Schmid, U., & Schossmaier, K. (1999). The SimUTC fault-tolerant distributed systems simulation toolkit. In Proc. 7th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOT’99) (pp. 68–75). http://hdl.handle.net/20.500.12708/50925

1998

• Rapid Prototyping mit programmierbarer Logik anhand eines Fallbeispiels / Nachtnebel, H., Kerö, N., Cadek, G., Mandl, T., & Schmid, U. (1998). Rapid Prototyping mit programmierbarer Logik anhand eines Fallbeispiels. In Tagungsband der TMÖ-Fachtagung Austrochip´98 (pp. 99–104). http://hdl.handle.net/20.500.12708/68313
• NTI: A Network Time Interface M-Module for High-Accuracy Clock Synchronization / Horauer, M., Schmid, U., & Schossmaier, K. (1998). NTI: A Network Time Interface M-Module for High-Accuracy Clock Synchronization. In Proc. 6th International Workshop on Parallel and Distributed Real-Time Systems (WPDRTS’98) (pp. 1067–1076). http://hdl.handle.net/20.500.12708/50930
• Internet-Based Real-Time Computing / Schmid, U. (1998). Internet-Based Real-Time Computing. In Proc. 22nd Annual International Computer Software & Applications Conference (COMPSAC’98) (pp. 338–342). http://hdl.handle.net/20.500.12708/50928

1997

• Specification and Implementation of the Universal Time Coordinated Synchronization Unit (UTCSU) / Schossmaier, K., Schmid, U., Horauer, M., & Loy, D. (1997). Specification and Implementation of the Universal Time Coordinated Synchronization Unit (UTCSU). Real-Time Systems, 12(3), 51–84. https://doi.org/10.1023/A:1007953214631
• Interval-Based Clock Synchronization / Schmid, U., & Schossmaier, K. (1997). Interval-Based Clock Synchronization. Real-Time Systems, 12(2), 173–228. http://hdl.handle.net/20.500.12708/174814
• Specification and Implementation of the Universal Time Coordinated Synchronization Unit (UTCSU) / Schossmaier, K., Schmid, U., Horauer, M., & Loy, D. (1997). Specification and Implementation of the Universal Time Coordinated Synchronization Unit (UTCSU). Real-Time Systems, 12, 295–327. http://hdl.handle.net/20.500.12708/174324
• Challenges in Interval-based Clock Synchronization / Schmid, U. (1997). Challenges in Interval-based Clock Synchronization. Dagstuhl-Seminar 9728 on “Average Case Analysis of Algorithms,” Schloß Dagstuhl, Germany, Austria. http://hdl.handle.net/20.500.12708/84187
• Long-Term Evaluation of GPS Timing Receiver Failures / Höchtl, D., & Schmid, U. (1997). Long-Term Evaluation of GPS Timing Receiver Failures. In Proc. of the 29th IEEE PTTI Systems and Application Meeting (PTTI’97) (pp. 165–180). http://hdl.handle.net/20.500.12708/50929
• NTI: A Network Time Interface M-Module for High-Accuracy Clock Synchronization / Horauer, M., Schmid, U., & Schossmaier, K. (1997). NTI: A Network Time Interface M-Module for High-Accuracy Clock Synchronization. http://hdl.handle.net/20.500.12708/30997

1996

• NTI Functional and Architectural Specification / Horauer, M., Loy, D., & Schmid, U. (1996). NTI Functional and Architectural Specification. http://hdl.handle.net/20.500.12708/30996
• DOBOS: A Distributed Object-Based Operating System for Soft Real-Time Systems / Schmid, U., & Kastner, W. (1996). DOBOS: A Distributed Object-Based Operating System for Soft Real-Time Systems. In Echtzeitsysteme und objektorientierter Entwurf (pp. 3–13). Vieweg-Verlag. http://hdl.handle.net/20.500.12708/25331

1995

• Random Trees in Queueing Systems with Deadlines / Schmid, U. (1995). Random Trees in Queueing Systems with Deadlines. Theoretical Computer Science, 144(1–2), 277–314. http://hdl.handle.net/20.500.12708/174817
• SSCMP: The Sequenced Synchronized Clock Message Protocol / Schmid, U., & Pusterhofer, A. (1995). SSCMP: The Sequenced Synchronized Clock Message Protocol. Computer Networks and ISDN Systems, 27, 1615–1632. http://hdl.handle.net/20.500.12708/174816
• Synchronized Universal Time Coordinated for Distributed Real-Time Systems / Schmid, U. (1995). Synchronized Universal Time Coordinated for Distributed Real-Time Systems. Control Engineering Practice, 3(6), 877–884. http://hdl.handle.net/20.500.12708/174815
• On non-preemptive LCFS Scheduling with Deadlines / Schmid, U., & Blieberger, J. (1995). On non-preemptive LCFS Scheduling with Deadlines. Journal of Algorithms, 18(1), 124–158. https://doi.org/10.1006/jagm.1995.1004
• "Echtzeit"-Systeme / Schmid, U. (1995). “Echtzeit”-Systeme. Habilitationskolloquium, Wien, Austria. http://hdl.handle.net/20.500.12708/84194
• Untersuchung des Zeitverhaltens Verteilter Echtzeitsysteme / Halang, W. A., Koller, F.-J., Schmid, U., & Witte, M. (1995). Untersuchung des Zeitverhaltens Verteilter Echtzeitsysteme. In Proc. Echtzeit’95 (pp. 101–107). http://hdl.handle.net/20.500.12708/50931
• Process Control Education for Computer Science: From Fiction Back to Facts / Schmid, U., Kastner, W., & Haberstroh, H. (1995). Process Control Education for Computer Science: From Fiction Back to Facts. In Proceedings TEMPUS JEP 07759 MODIFY Workshop on Automation and Control Engineering in Higher Education (pp. 135–147). http://hdl.handle.net/20.500.12708/50919
• Project proposal SSCMP: Sequenced Synchronized Clock Multicast Protocol / Schmid, U., Loy, D., & Kastner, W. (1995). Project proposal SSCMP: Sequenced Synchronized Clock Multicast Protocol. http://hdl.handle.net/20.500.12708/32892

1994

• Monitoring Distributed Real-Time Systems / Schmid, U. (1994). Monitoring Distributed Real-Time Systems. Real-Time Systems, 7, 33–56. http://hdl.handle.net/20.500.12708/174818
• The Role of Standards in Real-Time Computing / Schmid, U. (1994). The Role of Standards in Real-Time Computing. In Proc. NATO ASI on Real-Time Computing (pp. 638–639). http://hdl.handle.net/20.500.12708/50934
• Monitoring of Distributed Real-Time Systems / Schmid, U. (1994). Monitoring of Distributed Real-Time Systems. In Proc. NATO ASI on Real-Time Computing (pp. 582–583). http://hdl.handle.net/20.500.12708/50933
• Synchronized UTC for Distributed Real-Time Systems / Schmid, U. (1994). Synchronized UTC for Distributed Real-Time Systems. In Proc. IFAC Workshop on Real-Time Programming (WRTP’94) (pp. 101–107). http://hdl.handle.net/20.500.12708/50932
• DOBOS: Ein Distributed Object-based Operating System für Soft Real-Time Systems / Schmid, U., & Kastner, W. (1994). DOBOS: Ein Distributed Object-based Operating System für Soft Real-Time Systems. In Proceedings Echtzeit’94 (pp. 130–137). http://hdl.handle.net/20.500.12708/50918

1993

• The Analysis of the Expected Successful Operation Time of Slotted ALOHA / Drmota, M., & Schmid, U. (1993). The Analysis of the Expected Successful Operation Time of Slotted ALOHA. IEEE Transactions on Information Theory, 39(5), 1567–1577. https://doi.org/10.1109/18.259641
• On Random-Trees Arising in the Analysis of Scheduling Algorithms for Real-Time Systems / Schmid, U. (1993). On Random-Trees Arising in the Analysis of Scheduling Algorithms for Real-Time Systems. Dagstuhl-Seminar 9328 on “Average Case Analysis of Algorithms,” Schloß Dagstuhl, Germany, Austria. http://hdl.handle.net/20.500.12708/84196
• Process Control Education for Computer Science: Facts and Fiction / Schmid, U., Haberstroh, H., & Stöckler, S. (1993). Process Control Education for Computer Science: Facts and Fiction. In Proceedings SEFI/TEMPUS JEP 2011 - IMPACT Workshop on Computer Science Topics for Control Engineering Education (pp. 13–22). http://hdl.handle.net/20.500.12708/50944
• DOBOS - Konzept eines distributed object-based operating systems / Schmid, U., & Kastner, W. (1993). DOBOS - Konzept eines distributed object-based operating systems. http://hdl.handle.net/20.500.12708/32891

1992

• On a Tree Collision Resolution Algorithm in Presence of Capture / Schmid, U. (1992). On a Tree Collision Resolution Algorithm in Presence of Capture. RAIRO Informatique Theorique et Applications / Theoretical Informatics and Applications, 26(2), 163–197. http://hdl.handle.net/20.500.12708/174820
• Preemptive LCFS Scheduling in Hard Real-Time Applications / Blieberger, J., & Schmid, U. (1992). Preemptive LCFS Scheduling in Hard Real-Time Applications. Performance Evaluation, 15(3), 203–215. https://doi.org/10.1016/0166-5316(92)90035-f
• Some Investigations on FCFS Scheduling in Hard Real-Time Applications / Schmid, U., & Blieberger, J. (1992). Some Investigations on FCFS Scheduling in Hard Real-Time Applications. Journal of Computer and System Sciences, 45(3), 493–512. https://doi.org/10.1016/0022-0000(92)90036-i
• FCFS Scheduling in a Hard Real-Time Environment under Rush-Hour Conditions / Blieberger, J., & Schmid, U. (1992). FCFS Scheduling in a Hard Real-Time Environment under Rush-Hour Conditions. BIT Numerical Mathematics, 32(3), 370–383. https://doi.org/10.1007/bf02074875
• The Average CRI-Length of a Tree Collision Resolution Algorithm in Presence of Multiplicity-Dependent Capture Effects / Schmid, U. (1992). The Average CRI-Length of a Tree Collision Resolution Algorithm in Presence of Multiplicity-Dependent Capture Effects. In Proceedings 19th International Colloquium on Automata, Languages, and Programming (ICALP’92) (pp. 223–234). Springer-Verlag, LNCS. http://hdl.handle.net/20.500.12708/50935

1991

• Qualifying Dynamic Task Scheduling in Hard Real-Time Systems: A Novel Approach / Blieberger, J., & Schmid, U. (1991). Qualifying Dynamic Task Scheduling in Hard Real-Time Systems: A Novel Approach. http://hdl.handle.net/20.500.12708/32871

 

2022

• Beta-CIDM: A faithful and composable delay model with adversarial noise / Öhlinger, D. (2022). Beta-CIDM: A faithful and composable delay model with adversarial noise [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2022.87144
  Download: PDF (1.81 MB)

2021

• IoT implementation and evaluation of distributed consensus algorithms / Echtinger-Sieghart, C. (2021). IoT implementation and evaluation of distributed consensus algorithms [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2021.85743
  Download: PDF (2.56 MB)
• On the strongest message adversary for directed dynamic networks / Felber, S. (2021). On the strongest message adversary for directed dynamic networks [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2022.87145
  Download: PDF (996 KB)
• Proper abstractions for digital electronic circuits: A physically guided approach / Maier, J. (2021). Proper abstractions for digital electronic circuits: A physically guided approach [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2022.102506
  Download: PDF (13 MB)

2020

• An Extension framework for epistemic reasoning in Byzantine distributed systems / Schlögl, T. (2020). An Extension framework for epistemic reasoning in Byzantine distributed systems [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2020.69444
  Download: PDF (1.5 MB)
• Automatic competitive analysis of real-time scheduling algorithms for firm-deadline tasks with non-preemptible sections and precedence constraints / Schaumberger, N. (2020). Automatic competitive analysis of real-time scheduling algorithms for firm-deadline tasks with non-preemptible sections and precedence constraints [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2020.70863
  Download: PDF (871 KB)

2019

• Fault-tolerant clock distribution in grid-like networks / Perner, M. (2019). Fault-tolerant clock distribution in grid-like networks [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2019.72064
  Download: PDF (9.22 MB)

2018

• Knowledge and communication complexity in distributed systems / Pfleger, D. (2018). Knowledge and communication complexity in distributed systems [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2018.40116
  Download: PDF (993 KB)
• Agreement algorithms in directed dynamic networks / Schwarz, M. (2018). Agreement algorithms in directed dynamic networks [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2018.57089
  Download: PDF (1.29 MB)

2017

• Temporal-epistemic logic in Byzantine message-passing contexts / Fimml, P. (2017). Temporal-epistemic logic in Byzantine message-passing contexts [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2017.38943
  Download: PDF (858 KB)

2014

• Real-time performance analysis of synchronous distributed systems / Kößler, A. (2014). Real-time performance analysis of synchronous distributed systems [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2014.22342
  Download: PDF (3.45 MB)

2013

• Solving the labeling problem : a Byzantine fault-tolerant self-stabilizing FPGA prototype based on the FATAL+ protocol / Hofstätter, M. (2013). Solving the labeling problem : a Byzantine fault-tolerant self-stabilizing FPGA prototype based on the FATAL+ protocol [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2013.21760
  Download: PDF (1.62 MB)
• Easy impossibility proofs for k-set agreement / Winkler, K. (2013). Easy impossibility proofs for k-set agreement [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2013.22720
  Download: PDF (623 KB)
• Self-stabilizing Byzantine fault-tolerant clock distribution in grids / Perner, M. (2013). Self-stabilizing Byzantine fault-tolerant clock distribution in grids [Diploma Thesis]. reposiTUm. https://doi.org/10.34726/hss.2013.21901
  Download: PDF (842 KB)
• Analoge Q-Control zur Güteverstärkung von piezoelektrischen MEMS Resonatoren / Hofbauer, F. (2013). Analoge Q-Control zur Güteverstärkung von piezoelektrischen MEMS Resonatoren [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/159679
• Solving k-Set agreement in dynamic networks / Schwarz, M. (2013). Solving k-Set agreement in dynamic networks [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2013.21843
  Download: PDF (675 KB)

2012

• Selbststabilisierende byzantinisch fehlertolerante Takterzeugung in FPGAs / Posch, M. (2012). Selbststabilisierende byzantinisch fehlertolerante Takterzeugung in FPGAs [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/160584
• Implementation of a distributed computation framework / Pavlovic, M. (2012). Implementation of a distributed computation framework [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/159720

2010

• Weak system models for fault-tolerant distributed agreement problems / Robinson, P. (2010). Weak system models for fault-tolerant distributed agreement problems [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-42017
  Download: PDF (956 KB)
• Analysis of on-chip fault-tolerant distributed algorithms / Függer, M. (2010). Analysis of on-chip fault-tolerant distributed algorithms [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-39917
  Download: PDF (1.45 MB)
• Topology in Distributed Computing / Nowak, T. (2010). Topology in Distributed Computing [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-30814
  Download: PDF (492 KB)

2009

• A model for distributed computing in real-time systems / Moser, H. (2009). A model for distributed computing in real-time systems [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-29073
  Download: PDF (856 KB)
• Dynamic aspects of modelling distributed computations / Biely, M. (2009). Dynamic aspects of modelling distributed computations [Dissertation, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/184232

2007

• Simulation and performance evaluation of a topology control algorithm in NS2 / Walter, C. (2007). Simulation and performance evaluation of a topology control algorithm in NS2 [Master Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-14919
  Download: PDF (3.5 MB)

2006

• Advantages and limitations of position-based communication in wireless ad-hoc networks / Stratil, H. (2006). Advantages and limitations of position-based communication in wireless ad-hoc networks [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-14382
  Download: PDF (703 KB)
• Fault-tolerant distributed clock generation in VLSI systems-on-chip / Függer, M. (2006). Fault-tolerant distributed clock generation in VLSI systems-on-chip [Master Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-28679
  Download: PDF (462 KB)

2005

• Topology control for fault-tolerant communication in wireless ad hoc networks / Thallner, B. (2005). Topology control for fault-tolerant communication in wireless ad hoc networks [Dissertation, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/180401
• Failure detection in sparse networks / Hutle, M. (2005). Failure detection in sparse networks [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-21522
  Download: PDF (580 KB)
• Distributed construction of a fault-tolerant wireless communication topology for networked embedded systems oder "Implementing the Thallner-algorithm" / Moser, H. (2005). Distributed construction of a fault-tolerant wireless communication topology for networked embedded systems oder “Implementing the Thallner-algorithm” [Diploma Thesis]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-12392
  Download: PDF (461 KB)

2004

• Experimentelle Verifikation von Synchronitätsannahmen für Computernetzwerke / Albeseder, D. (2004). Experimentelle Verifikation von Synchronitätsannahmen für Computernetzwerke [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/181067
• Distributed computing in the presence of bounded asynchrony / Widder, J. (2004). Distributed computing in the presence of bounded asynchrony [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-13246
  Download: PDF (715 KB)

2002

• Byzantine agreement under the perception-based fault model / Biely, M. (2002). Byzantine agreement under the perception-based fault model [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-77933
  Download: PDF (356 KB)
• Switching on : how processes initialize for consistent broadcast / Widder, J. (2002). Switching on : how processes initialize for consistent broadcast [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-77756
  Download: PDF (212 KB)
• Topology management and routing in wireless networks : an overview / Stratil, H. (2002). Topology management and routing in wireless networks : an overview [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/186446
• Comparison of protocol frameworks / Rahimi Movaghar, S. (2002). Comparison of protocol frameworks [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/181787
• Authenticated consensus / Weiss, B. (2002). Authenticated consensus [Dissertation, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/179189

 

• Synchronized Universal Time Coordinated for Distributed Real-Time Systems
  1997 / START-Programm / Austria
• Kardinal Innitzer Förderungspreis
  1995 / Kardinal-Innitzer-Preis / Austria

Soon, this page will include additional information such as reference projects, activities as journal reviewer and editor, memberships in councils and committees, and other research activities.

Until then, please visit Ulrich Schmid’s research profile in TISS .