Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

Country:

You searched for subject:(theoretical computer science). Showing records 1 – 12 of 12 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


ETH Zürich

1. Förster, Klaus-Tycho. Don’t disturb my Flows: Algorithms for Consistent Network Updates in Software Defined Networks.

Degree: 2016, ETH Zürich

Subjects/Keywords: COMPLEXITY CLASSES (THEORETICAL COMPUTER SCIENCE); NETWORK ARCHITECTURES (COMPUTER SYSTEMS); NETZWERKÜBERWACHUNG + NETZWERKADMINISTRATION (COMPUTERSYSTEME); NETWORK MONITORING (COMPUTER SYSTEMS); KOMPLEXITÄTSKLASSEN (THEORETISCHE INFORMATIK); NETZWERKARCHITEKTUREN (COMPUTERSYSTEME); info:eu-repo/classification/ddc/004; Data processing, computer science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Förster, K. (2016). Don’t disturb my Flows: Algorithms for Consistent Network Updates in Software Defined Networks. (Doctoral Dissertation). ETH Zürich. Retrieved from http://hdl.handle.net/20.500.11850/121315

Chicago Manual of Style (16th Edition):

Förster, Klaus-Tycho. “Don’t disturb my Flows: Algorithms for Consistent Network Updates in Software Defined Networks.” 2016. Doctoral Dissertation, ETH Zürich. Accessed January 18, 2020. http://hdl.handle.net/20.500.11850/121315.

MLA Handbook (7th Edition):

Förster, Klaus-Tycho. “Don’t disturb my Flows: Algorithms for Consistent Network Updates in Software Defined Networks.” 2016. Web. 18 Jan 2020.

Vancouver:

Förster K. Don’t disturb my Flows: Algorithms for Consistent Network Updates in Software Defined Networks. [Internet] [Doctoral dissertation]. ETH Zürich; 2016. [cited 2020 Jan 18]. Available from: http://hdl.handle.net/20.500.11850/121315.

Council of Science Editors:

Förster K. Don’t disturb my Flows: Algorithms for Consistent Network Updates in Software Defined Networks. [Doctoral Dissertation]. ETH Zürich; 2016. Available from: http://hdl.handle.net/20.500.11850/121315


ETH Zürich

2. Královič, Richard. Complexity Classes of Finite Automata.

Degree: 2010, ETH Zürich

Subjects/Keywords: COMPLEXITY CLASSES (THEORETICAL COMPUTER SCIENCE); ENDLICHE AUTOMATEN (THEORIE DER REGELUNGSSYSTEME); ABSTRACT DEVICES + UNIVERSAL MACHINES (THEORETICAL COMPUTER SCIENCE); FINITE AUTOMATA (CONTROL SYSTEMS THEORY); KOMPLEXITÄTSKLASSEN (THEORETISCHE INFORMATIK); ABSTRAKTE MASCHINEN + UNIVERSELLE MASCHINEN (THEORETISCHE INFORMATIK); info:eu-repo/classification/ddc/004; Data processing, computer science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Královič, R. (2010). Complexity Classes of Finite Automata. (Doctoral Dissertation). ETH Zürich. Retrieved from http://hdl.handle.net/20.500.11850/72810

Chicago Manual of Style (16th Edition):

Královič, Richard. “Complexity Classes of Finite Automata.” 2010. Doctoral Dissertation, ETH Zürich. Accessed January 18, 2020. http://hdl.handle.net/20.500.11850/72810.

MLA Handbook (7th Edition):

Královič, Richard. “Complexity Classes of Finite Automata.” 2010. Web. 18 Jan 2020.

Vancouver:

Královič R. Complexity Classes of Finite Automata. [Internet] [Doctoral dissertation]. ETH Zürich; 2010. [cited 2020 Jan 18]. Available from: http://hdl.handle.net/20.500.11850/72810.

Council of Science Editors:

Královič R. Complexity Classes of Finite Automata. [Doctoral Dissertation]. ETH Zürich; 2010. Available from: http://hdl.handle.net/20.500.11850/72810


ETH Zürich

3. Brändle, Markus A. GraphBench: Exploring the Limits of Complexity with Educational Software: Exploring the limits of complexity with educational software.

Degree: 2006, ETH Zürich

Subjects/Keywords: COMPLEXITY CLASSES (THEORETICAL COMPUTER SCIENCE); ELEKTRONISCHES LERNEN + COMPUTERUNTERSTÜTZTES LERNEN (COMPUTERUNTERSTÜTZTER UNTERRICHT); COMPUTER SCIENCE INSTRUCTION (SPECIAL SUBJECTS); E-LEARNING + COMPUTER ASSISTED LEARNING (COMPUTER-AIDED INSTRUCTION); ALGORITHMISCHE KOMPLEXITÄT (MATHEMATIK); ALGORITHMIC COMPLEXITY (MATHEMATICS); INFORMATIKUNTERRICHT (FACHUNTERRICHT); KOMPLEXITÄTSKLASSEN (THEORETISCHE INFORMATIK); info:eu-repo/classification/ddc/004; Data processing, computer science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Brändle, M. A. (2006). GraphBench: Exploring the Limits of Complexity with Educational Software: Exploring the limits of complexity with educational software. (Doctoral Dissertation). ETH Zürich. Retrieved from http://hdl.handle.net/20.500.11850/72808

Chicago Manual of Style (16th Edition):

Brändle, Markus A. “GraphBench: Exploring the Limits of Complexity with Educational Software: Exploring the limits of complexity with educational software.” 2006. Doctoral Dissertation, ETH Zürich. Accessed January 18, 2020. http://hdl.handle.net/20.500.11850/72808.

MLA Handbook (7th Edition):

Brändle, Markus A. “GraphBench: Exploring the Limits of Complexity with Educational Software: Exploring the limits of complexity with educational software.” 2006. Web. 18 Jan 2020.

Vancouver:

Brändle MA. GraphBench: Exploring the Limits of Complexity with Educational Software: Exploring the limits of complexity with educational software. [Internet] [Doctoral dissertation]. ETH Zürich; 2006. [cited 2020 Jan 18]. Available from: http://hdl.handle.net/20.500.11850/72808.

Council of Science Editors:

Brändle MA. GraphBench: Exploring the Limits of Complexity with Educational Software: Exploring the limits of complexity with educational software. [Doctoral Dissertation]. ETH Zürich; 2006. Available from: http://hdl.handle.net/20.500.11850/72808


ETH Zürich

4. Torrisi, Fabio Danilo. Modeling and reach-set computation for analysis and optimal control of discrete hybrid automata.

Degree: 2003, ETH Zürich

Subjects/Keywords: SYSTEMANALYSE + SYSTEMENTWICKLUNG + SYSTEMENTWURF (COMPUTERSYSTEME); HYBRIDCOMPUTER (COMPUTERSYSTEME); ABSTRAKTE MASCHINEN + UNIVERSELLE MASCHINEN (THEORETISCHE INFORMATIK); SYSTEMS ANALYSIS + SYSTEMS DEVELOPMENT + SYSTEMS DESIGN (COMPUTER SYSTEMS); HYBRID COMPUTERS (COMPUTER SYSTEMS); ABSTRACT DEVICES + UNIVERSAL MACHINES (THEORETICAL COMPUTER SCIENCE); info:eu-repo/classification/ddc/004; Data processing, computer science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Torrisi, F. D. (2003). Modeling and reach-set computation for analysis and optimal control of discrete hybrid automata. (Doctoral Dissertation). ETH Zürich. Retrieved from http://hdl.handle.net/20.500.11850/147633

Chicago Manual of Style (16th Edition):

Torrisi, Fabio Danilo. “Modeling and reach-set computation for analysis and optimal control of discrete hybrid automata.” 2003. Doctoral Dissertation, ETH Zürich. Accessed January 18, 2020. http://hdl.handle.net/20.500.11850/147633.

MLA Handbook (7th Edition):

Torrisi, Fabio Danilo. “Modeling and reach-set computation for analysis and optimal control of discrete hybrid automata.” 2003. Web. 18 Jan 2020.

Vancouver:

Torrisi FD. Modeling and reach-set computation for analysis and optimal control of discrete hybrid automata. [Internet] [Doctoral dissertation]. ETH Zürich; 2003. [cited 2020 Jan 18]. Available from: http://hdl.handle.net/20.500.11850/147633.

Council of Science Editors:

Torrisi FD. Modeling and reach-set computation for analysis and optimal control of discrete hybrid automata. [Doctoral Dissertation]. ETH Zürich; 2003. Available from: http://hdl.handle.net/20.500.11850/147633


ETH Zürich

5. Barhum, Kfir. Tradeoffs Between Computational Complexity and Information Content.

Degree: 2015, ETH Zürich

Subjects/Keywords: KOMPLEXITÄTSKLASSEN (THEORETISCHE INFORMATIK); PROGRAMME UND ALGORITHMEN ZUR LÖSUNG SPEZIELLER PROBLEME; DATENKOMMUNIKATION (COMPUTERSYSTEME); KRYPTOGRAPHIE (INFORMATIONSTHEORIE); COMPLEXITY CLASSES (THEORETICAL COMPUTER SCIENCE); PROGRAMS AND ALGORITHMS FOR THE SOLUTION OF SPECIAL PROBLEMS; DATA COMMUNICATIONS (COMPUTER SYSTEMS); CRYPTOGRAPHY (INFORMATION THEORY); info:eu-repo/classification/ddc/004; info:eu-repo/classification/ddc/510; Data processing, computer science; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Barhum, K. (2015). Tradeoffs Between Computational Complexity and Information Content. (Doctoral Dissertation). ETH Zürich. Retrieved from http://hdl.handle.net/20.500.11850/155178

Chicago Manual of Style (16th Edition):

Barhum, Kfir. “Tradeoffs Between Computational Complexity and Information Content.” 2015. Doctoral Dissertation, ETH Zürich. Accessed January 18, 2020. http://hdl.handle.net/20.500.11850/155178.

MLA Handbook (7th Edition):

Barhum, Kfir. “Tradeoffs Between Computational Complexity and Information Content.” 2015. Web. 18 Jan 2020.

Vancouver:

Barhum K. Tradeoffs Between Computational Complexity and Information Content. [Internet] [Doctoral dissertation]. ETH Zürich; 2015. [cited 2020 Jan 18]. Available from: http://hdl.handle.net/20.500.11850/155178.

Council of Science Editors:

Barhum K. Tradeoffs Between Computational Complexity and Information Content. [Doctoral Dissertation]. ETH Zürich; 2015. Available from: http://hdl.handle.net/20.500.11850/155178


ETH Zürich

6. Sprock, Andreas. Analysis of hard problems in reoptimization and online computation.

Degree: 2013, ETH Zürich

Subjects/Keywords: GRAPHENTHEORIE (MATHEMATIK); COMPLEXITY CLASSES (MATHEMATICS); COMPLEXITY CLASSES (THEORETICAL COMPUTER SCIENCE); GRAPH THEORY (MATHEMATICS); MATHEMATICAL PROGRAMMING (OPERATIONS RESEARCH); TREES (GRAPH THEORY); KOMPLEXITÄTSKLASSEN (MATHEMATIK); MATHEMATISCHE OPTIMIERUNG (OPERATIONS RESEARCH); KOMPLEXITÄTSKLASSEN (THEORETISCHE INFORMATIK); BÄUME (GRAPHENTHEORIE); info:eu-repo/classification/ddc/004; info:eu-repo/classification/ddc/510; Data processing, computer science; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Sprock, A. (2013). Analysis of hard problems in reoptimization and online computation. (Doctoral Dissertation). ETH Zürich. Retrieved from http://hdl.handle.net/20.500.11850/65500

Chicago Manual of Style (16th Edition):

Sprock, Andreas. “Analysis of hard problems in reoptimization and online computation.” 2013. Doctoral Dissertation, ETH Zürich. Accessed January 18, 2020. http://hdl.handle.net/20.500.11850/65500.

MLA Handbook (7th Edition):

Sprock, Andreas. “Analysis of hard problems in reoptimization and online computation.” 2013. Web. 18 Jan 2020.

Vancouver:

Sprock A. Analysis of hard problems in reoptimization and online computation. [Internet] [Doctoral dissertation]. ETH Zürich; 2013. [cited 2020 Jan 18]. Available from: http://hdl.handle.net/20.500.11850/65500.

Council of Science Editors:

Sprock A. Analysis of hard problems in reoptimization and online computation. [Doctoral Dissertation]. ETH Zürich; 2013. Available from: http://hdl.handle.net/20.500.11850/65500


ETH Zürich

7. Krautz, Christoph. On principles of cortical computation.

Degree: 2012, ETH Zürich

Subjects/Keywords: NEURAL NETWORKS + NEUROMORPHIC SYSTEMS (NEUROLOGY); NEURONALE NETZWERKE + NEUROMORPHE SYSTEME (NEUROLOGIE); NEURAL NETWORKS + CONNECTIONISM (ARTIFICIAL INTELLIGENCE); ABSTRACT DEVICES + UNIVERSAL MACHINES (THEORETICAL COMPUTER SCIENCE); NEURONALE NETZWERKE + KONNEKTIONISMUS (KÜNSTLICHE INTELLIGENZ); ABSTRAKTE MASCHINEN + UNIVERSELLE MASCHINEN (THEORETISCHE INFORMATIK); info:eu-repo/classification/ddc/004; Data processing, computer science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Krautz, C. (2012). On principles of cortical computation. (Doctoral Dissertation). ETH Zürich. Retrieved from http://hdl.handle.net/20.500.11850/53138

Chicago Manual of Style (16th Edition):

Krautz, Christoph. “On principles of cortical computation.” 2012. Doctoral Dissertation, ETH Zürich. Accessed January 18, 2020. http://hdl.handle.net/20.500.11850/53138.

MLA Handbook (7th Edition):

Krautz, Christoph. “On principles of cortical computation.” 2012. Web. 18 Jan 2020.

Vancouver:

Krautz C. On principles of cortical computation. [Internet] [Doctoral dissertation]. ETH Zürich; 2012. [cited 2020 Jan 18]. Available from: http://hdl.handle.net/20.500.11850/53138.

Council of Science Editors:

Krautz C. On principles of cortical computation. [Doctoral Dissertation]. ETH Zürich; 2012. Available from: http://hdl.handle.net/20.500.11850/53138


ETH Zürich

8. Weber, Birgitta. Algorithms and Complexity for some Machine Scheduling and Prefetching Problems.

Degree: 2005, ETH Zürich

Subjects/Keywords: COMPLEXITY CLASSES (THEORETICAL COMPUTER SCIENCE); SCHEDULING (OPERATING SYSTEMS); SCHEDULING (BETRIEBSSYSTEME); PROGRAMS AND ALGORITHMS FOR THE SOLUTION OF SPECIAL PROBLEMS; KOMPLEXITÄTSKLASSEN (THEORETISCHE INFORMATIK); PROGRAMME UND ALGORITHMEN ZUR LÖSUNG SPEZIELLER PROBLEME; info:eu-repo/classification/ddc/004; Data processing, computer science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Weber, B. (2005). Algorithms and Complexity for some Machine Scheduling and Prefetching Problems. (Doctoral Dissertation). ETH Zürich. Retrieved from http://hdl.handle.net/20.500.11850/72720

Chicago Manual of Style (16th Edition):

Weber, Birgitta. “Algorithms and Complexity for some Machine Scheduling and Prefetching Problems.” 2005. Doctoral Dissertation, ETH Zürich. Accessed January 18, 2020. http://hdl.handle.net/20.500.11850/72720.

MLA Handbook (7th Edition):

Weber, Birgitta. “Algorithms and Complexity for some Machine Scheduling and Prefetching Problems.” 2005. Web. 18 Jan 2020.

Vancouver:

Weber B. Algorithms and Complexity for some Machine Scheduling and Prefetching Problems. [Internet] [Doctoral dissertation]. ETH Zürich; 2005. [cited 2020 Jan 18]. Available from: http://hdl.handle.net/20.500.11850/72720.

Council of Science Editors:

Weber B. Algorithms and Complexity for some Machine Scheduling and Prefetching Problems. [Doctoral Dissertation]. ETH Zürich; 2005. Available from: http://hdl.handle.net/20.500.11850/72720


ETH Zürich

9. Zych, Anna. Reoptimization of NP-hard Problems.

Degree: 2012, ETH Zürich

Subjects/Keywords: COMPLEXITY CLASSES (THEORETICAL COMPUTER SCIENCE); COMPLEXITY CLASSES (MATHEMATICS); PROGRAMS AND ALGORITHMS FOR THE SOLUTION OF SPECIAL PROBLEMS; KOMPLEXITÄTSKLASSEN (MATHEMATIK); KOMPLEXITÄTSKLASSEN (THEORETISCHE INFORMATIK); PROGRAMME UND ALGORITHMEN ZUR LÖSUNG SPEZIELLER PROBLEME; info:eu-repo/classification/ddc/004; Data processing, computer science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Zych, A. (2012). Reoptimization of NP-hard Problems. (Doctoral Dissertation). ETH Zürich. Retrieved from http://hdl.handle.net/20.500.11850/72820

Chicago Manual of Style (16th Edition):

Zych, Anna. “Reoptimization of NP-hard Problems.” 2012. Doctoral Dissertation, ETH Zürich. Accessed January 18, 2020. http://hdl.handle.net/20.500.11850/72820.

MLA Handbook (7th Edition):

Zych, Anna. “Reoptimization of NP-hard Problems.” 2012. Web. 18 Jan 2020.

Vancouver:

Zych A. Reoptimization of NP-hard Problems. [Internet] [Doctoral dissertation]. ETH Zürich; 2012. [cited 2020 Jan 18]. Available from: http://hdl.handle.net/20.500.11850/72820.

Council of Science Editors:

Zych A. Reoptimization of NP-hard Problems. [Doctoral Dissertation]. ETH Zürich; 2012. Available from: http://hdl.handle.net/20.500.11850/72820


ETH Zürich

10. Lincke, Thomas Robert. Exploring the computational limits of large exhaustive search problems.

Degree: 2002, ETH Zürich

Subjects/Keywords: KOMPLEXITÄTSKLASSEN (THEORETISCHE INFORMATIK); PROGRAMME UND ALGORITHMEN ZUR LÖSUNG SPEZIELLER PROBLEME; PROBLEMLÖSEN + PLANEN + SUCHEN (KÜNSTLICHE INTELLIGENZ); COMPLEXITY CLASSES (THEORETICAL COMPUTER SCIENCE); PROGRAMS AND ALGORITHMS FOR THE SOLUTION OF SPECIAL PROBLEMS; PROBLEM SOLVING + PLAN GENERATION + SEARCH (ARTIFICIAL INTELLIGENCE); info:eu-repo/classification/ddc/004; Data processing, computer science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lincke, T. R. (2002). Exploring the computational limits of large exhaustive search problems. (Doctoral Dissertation). ETH Zürich. Retrieved from http://hdl.handle.net/20.500.11850/146939

Chicago Manual of Style (16th Edition):

Lincke, Thomas Robert. “Exploring the computational limits of large exhaustive search problems.” 2002. Doctoral Dissertation, ETH Zürich. Accessed January 18, 2020. http://hdl.handle.net/20.500.11850/146939.

MLA Handbook (7th Edition):

Lincke, Thomas Robert. “Exploring the computational limits of large exhaustive search problems.” 2002. Web. 18 Jan 2020.

Vancouver:

Lincke TR. Exploring the computational limits of large exhaustive search problems. [Internet] [Doctoral dissertation]. ETH Zürich; 2002. [cited 2020 Jan 18]. Available from: http://hdl.handle.net/20.500.11850/146939.

Council of Science Editors:

Lincke TR. Exploring the computational limits of large exhaustive search problems. [Doctoral Dissertation]. ETH Zürich; 2002. Available from: http://hdl.handle.net/20.500.11850/146939


ETH Zürich

11. Goussevskaia, Olga. Computational Complexity and Scheduling Algorithms for Wireless Networks.

Degree: 2009, ETH Zürich

Subjects/Keywords: COMPLEXITY CLASSES (THEORETICAL COMPUTER SCIENCE); MOBILFUNKNETZE + DRAHTLOSE NACHRICHTENNETZE (NACHRICHTENTECHNIK); SCHEDULING (OPERATING SYSTEMS); SCHEDULING (BETRIEBSSYSTEME); PROGRAMS AND ALGORITHMS FOR THE SOLUTION OF SPECIAL PROBLEMS; MOBILE RADIO NETWORKS + WIRELESS COMMUNICATIONS NETWORKS (TELECOMMUNICATIONS); KOMPLEXITÄTSKLASSEN (THEORETISCHE INFORMATIK); PROGRAMME UND ALGORITHMEN ZUR LÖSUNG SPEZIELLER PROBLEME; info:eu-repo/classification/ddc/004; info:eu-repo/classification/ddc/621.3; Data processing, computer science; Electric engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Goussevskaia, O. (2009). Computational Complexity and Scheduling Algorithms for Wireless Networks. (Doctoral Dissertation). ETH Zürich. Retrieved from http://hdl.handle.net/20.500.11850/20855

Chicago Manual of Style (16th Edition):

Goussevskaia, Olga. “Computational Complexity and Scheduling Algorithms for Wireless Networks.” 2009. Doctoral Dissertation, ETH Zürich. Accessed January 18, 2020. http://hdl.handle.net/20.500.11850/20855.

MLA Handbook (7th Edition):

Goussevskaia, Olga. “Computational Complexity and Scheduling Algorithms for Wireless Networks.” 2009. Web. 18 Jan 2020.

Vancouver:

Goussevskaia O. Computational Complexity and Scheduling Algorithms for Wireless Networks. [Internet] [Doctoral dissertation]. ETH Zürich; 2009. [cited 2020 Jan 18]. Available from: http://hdl.handle.net/20.500.11850/20855.

Council of Science Editors:

Goussevskaia O. Computational Complexity and Scheduling Algorithms for Wireless Networks. [Doctoral Dissertation]. ETH Zürich; 2009. Available from: http://hdl.handle.net/20.500.11850/20855


ETH Zürich

12. Meyer, Jan. Textile pressure sensor: design, error modeling and evaluation.

Degree: 2008, ETH Zürich

Subjects/Keywords: WEARABLE COMPUTERS (COMPUTERSYSTEME); KAPAZITIVE SENSOREN (ELEKTROTECHNIK); DRUCKMESSUNG + MANOMETER + MESSDOSEN + BAROMETER (MECHANIK); TECHNISCHE TEXTILIEN (TEXTILINDUSTRIE); NUMERISCHE SIMULATION UND MATHEMATISCHE MODELLRECHNUNG; WIDERSTAND + TRÄGHEIT + HYSTERESE (THEORETISCHE PHYSIK); SITZEN + SITZSTELLUNG (ANATOMIE UND PHYSIOLOGIE); MUSKELARBEIT (PHYSIOLOGIE); WEARABLE COMPUTERS (COMPUTER SYSTEMS); CAPACITIVE SENSORS (ELECTRICAL ENGINEERING); PRESSURE MEASUREMENT + BAROMETERS + MANOMETERS (MECHANICS); TECHNICAL TEXTILES (TEXTILE INDUSTRY); NUMERICAL SIMULATION AND MATHEMATICAL MODELING; RESISTANCE + INERTIA + HYSTERESIS (THEORETICAL PHYSICS); SITTING + SITTING POSITION (ANATOMY AND PHYSIOLOGY); MUSCULAR WORK (PHYSIOLOGY); info:eu-repo/classification/ddc/621.3; info:eu-repo/classification/ddc/004; Electric engineering; Data processing, computer science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Meyer, J. (2008). Textile pressure sensor: design, error modeling and evaluation. (Doctoral Dissertation). ETH Zürich. Retrieved from http://hdl.handle.net/20.500.11850/150869

Chicago Manual of Style (16th Edition):

Meyer, Jan. “Textile pressure sensor: design, error modeling and evaluation.” 2008. Doctoral Dissertation, ETH Zürich. Accessed January 18, 2020. http://hdl.handle.net/20.500.11850/150869.

MLA Handbook (7th Edition):

Meyer, Jan. “Textile pressure sensor: design, error modeling and evaluation.” 2008. Web. 18 Jan 2020.

Vancouver:

Meyer J. Textile pressure sensor: design, error modeling and evaluation. [Internet] [Doctoral dissertation]. ETH Zürich; 2008. [cited 2020 Jan 18]. Available from: http://hdl.handle.net/20.500.11850/150869.

Council of Science Editors:

Meyer J. Textile pressure sensor: design, error modeling and evaluation. [Doctoral Dissertation]. ETH Zürich; 2008. Available from: http://hdl.handle.net/20.500.11850/150869

.