We stand with Ukraine

We stand with Ukraine

Marion Oswald

Orcid: 0000-0003-1853-0002

Affiliations:

TU Wien, Vienna, Autria

According to our database¹, Marion Oswald authored at least 56 papers between 2002 and 2023.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2023

Evaluating (semi)-autonomous systems in policing and national security: a new framework based on the concept of 'intelligence': A new matrix framework of evaluation and grading, based on lessons from existing processes designed to define and assess 'intelligence'.

[BibT_eX]

[DOI]

,

,

Proceedings of the First International Symposium on Trustworthy Autonomous Systems, 2023

Exploring Police Perspectives on Algorithmic Transparency: A Qualitative Analysis of Police Interviews in the UK.

[BibT_eX]

[DOI]

,

Carolyn Ashurst

,

,

Ellen P. Goodmann

,

Pamela Ugwudike

,

Proceedings of the 3rd ACM Conference on Equity and Access in Algorithms, 2023

2022

Variants of derivation modes for which purely catalytic P systems are computationally complete.

[BibT_eX]

[DOI]

,

,

,

Theor. Comput. Sci., 2022

A three-pillar approach to achieving trustworthy and accountable use of AI and emerging technology in policing in England and Wales: Lessons from the West Midlands data ethics model.

[BibT_eX]

[DOI]

Eur. J. Law Technol., 2022

2021

Relations between Control Mechanisms for Sequential Grammars.

[BibT_eX]

[DOI]

,

,

,

Fundam. Informaticae, 2021

2020

Editorial.

[BibT_eX]

[DOI]

Kimberley Barker

,

Eur. J. Law Technol., 2020

Can an algorithmic system be a 'friend' to a police officer's discretion?: ACM FAT 2020 translation tutorial.

[BibT_eX]

[DOI]

,

Proceedings of the FAT* '20: Conference on Fairness, 2020

2018

Extended spiking neural P systems with white hole rules and their red-green variants.

[BibT_eX]

[DOI]

,

,

,

,

Nat. Comput., 2018

Chocolate P Automata.

[BibT_eX]

[DOI]

,

,

,

,

Proceedings of the Enjoying Natural Computing, 2018

2015

Catalytic and Purely Catalytic P Systems and P Automata: Control Mechanisms for Obtaining Computational Completeness.

[BibT_eX]

[DOI]

,

,

Fundam. Informaticae, 2015

2014

Array Grammars and Automata on Cayley Grids.

[BibT_eX]

[DOI]

,

J. Autom. Lang. Comb., 2014

Algebraic Representation of Regular Array Languages on Cayley Graphs.

[BibT_eX]

,

Proceedings of the Discrete Mathematics and Computer Science. In Memoriam Alexandru Mateescu (1952-2005)., 2014

2013

Something Bad Might Happen: Lawyers, anonymization and risk.

[BibT_eX]

[DOI]

XRDS, 2013

One-dimensional Array Grammars and P Systems with Array Insertion and Deletion Rules.

[BibT_eX]

[DOI]

,

,

,

K. G. Subramanian

Proceedings of the Proceedings Machines, Computations and Universality 2013, 2013

Catalytic and purely catalytic P automata: control mechanisms for obtaining computational completeness.

[BibT_eX]

,

Proceedings of the Fifth Workshop on Non-Classical Models for Automata and Applications - NCMA 2013, Umeå, Sweden, August 13, 2013

2012

Sequential P Systems with Regular Control.

[BibT_eX]

[DOI]

,

,

Hilbert Heikenwälder

,

,

,

Proceedings of the Membrane Computing, 2012

2011

Pc Grammar Systems with Clusters of Components.

[BibT_eX]

[DOI]

Erzsébet Csuhaj-Varjú

,

,

Int. J. Found. Comput. Sci., 2011

A General Framework for Regulated Rewriting Based on the Applicability of Rules.

[BibT_eX]

[DOI]

,

,

Proceedings of the Computation, 2011

2009

Partial Halting and Minimal Parallelism Based on Arbitrary Rule Partitions.

[BibT_eX]

[DOI]

,

,

,

Fundam. Informaticae, 2009

Membrane computing and brain modelling.

[BibT_eX]

[DOI]

Artif. Life Robotics, 2009

2008

Cd Grammar Systems with Regular Start Conditions.

[BibT_eX]

[DOI]

,

Int. J. Found. Comput. Sci., 2008

Extended Spiking Neural P Systems with Decaying Spikes and/or Total Spiking.

[BibT_eX]

[DOI]

,

,

Int. J. Found. Comput. Sci., 2008

Regular omega-Languages Defined by Finite Extended Spiking Neural P Systems.

[BibT_eX]

[DOI]

,

Fundam. Informaticae, 2008

2007

Multiset random context grammars, checkers, and transducers.

[BibT_eX]

[DOI]

Matteo Cavaliere

,

,

,

Theor. Comput. Sci., 2007

Refining the Nonterminal Complexity of Graph-Controlled, Programmed, and Matrix Grammars.

[BibT_eX]

[DOI]

,

,

,

Klaus Reinhardt

J. Autom. Lang. Comb., 2007

Partial Halting in P Systems.

[BibT_eX]

[DOI]

,

Int. J. Found. Comput. Sci., 2007

Modelling Grammar Systems by Tissue P Systems Working in the Sequential Mode.

[BibT_eX]

[DOI]

,

Fundam. Informaticae, 2007

Independent agents in a globalized world modelled by tissue P systems.

[BibT_eX]

[DOI]

Artif. Life Robotics, 2007

Partial Halting in P Systems Using Membrane Rules with Permitting Contexts.

[BibT_eX]

[DOI]

,

,

,

Proceedings of the Machines, Computations, and Universality, 5th International Conference, 2007

2006

Cell/symbol complexity of tissue P systems with symport/antiport rules.

[BibT_eX]

[DOI]

,

,

Int. J. Found. Comput. Sci., 2006

P colonies and prescribed teams.

[BibT_eX]

[DOI]

,

Int. J. Comput. Math., 2006

(Tissue) P Systems with Unit Rules and Energy Assigned to Membranes.

[BibT_eX]

[DOI]

,

,

Alberto Leporati

,

,

Claudio Zandron

Fundam. Informaticae, 2006

Tissue P Systems and (Mem)Brane Systems with Mate and Drip Operations Working on Strings.

[BibT_eX]

[DOI]

,

Proceedings of the First Workshop on Membrane Computing and Biologically Inspired Process Calculi, 2006

Extended Spiking Neural P Systems.

[BibT_eX]

[DOI]

,

,

,

Marija Slavkovik

Proceedings of the Membrane Computing, 7th International Workshop, 2006

A Small Universal Antiport P System with Forbidden Context.

[BibT_eX]

,

Proceedings of the 8th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2006, Las Cruces, New Mexico, USA, June 21, 2006

2005

Computationally universal P systems without priorities: two catalysts are sufficient.

[BibT_eX]

[DOI]

,

,

,

Theor. Comput. Sci., 2005

Optimal results for the computational completeness of gemmating (tissue) P systems.

[BibT_eX]

[DOI]

,

,

Int. J. Found. Comput. Sci., 2005

Modelling artificial life by attributed eco-array grammars.

[BibT_eX]

[DOI]

,

,

Artif. Life Robotics, 2005

P Colonies Working in the Maximally Parallel and in the Sequential Mode.

[BibT_eX]

[DOI]

,

Proceedings of the Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2005), 2005

Symbol/Membrane Complexity of P Systems with Symport/Antiport Rules.

[BibT_eX]

[DOI]

,

,

Proceedings of the Membrane Computing, 6th International Workshop, 2005

Tissue P Systems with Antiport Rules and Small Numbers of Symbols and Cells.

[BibT_eX]

[DOI]

,

,

Proceedings of the Developments in Language Theory, 9th International Conference, 2005

Refining the Nonterminal Complexity of Graph-controlled Grammars.

[BibT_eX]

,

,

,

Klaus Reinhardt

Proceedings of the 7th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2005, Como, Italy, June 30, 2005

2004

P Systems with Local Graph Productions.

[BibT_eX]

[DOI]

,

New Gener. Comput., 2004

P Systems with Conditional Communication Rules Assigned to Membranes.

[BibT_eX]

[DOI]

,

J. Autom. Lang. Comb., 2004

P Automata with membrane channels.

[BibT_eX]

[DOI]

,

Artif. Life Robotics, 2004

Implementation of Catalytic P Systems.

[BibT_eX]

[DOI]

,

,

,

Proceedings of the Implementation and Application of Automata, 2004

P Systems Generating Trees.

[BibT_eX]

[DOI]

,

,

Proceedings of the Membrane Computing, 5th International Workshop, 2004

Sequential P Systems with Unit Rules and Energy Assigned to Membranes.

[BibT_eX]

[DOI]

,

Alberto Leporati

,

,

Claudio Zandron

Proceedings of the Machines, Computations, and Universality, 4th International Conference, 2004

Gemmating P Systems are Computationally Complete with Four Membranes.

[BibT_eX]

,

,

Proceedings of the 6th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2004, London, Ontario, Canada, July 26, 2004

Splicing Test Tube Systems and Their Relation to Splicing Membrane Systems.

[BibT_eX]

[DOI]

Franziska Freund

,

,

Proceedings of the Aspects of Molecular Computing, 2004

2003

omega-P Automata with Communication Rules.

[BibT_eX]

[DOI]

,

,

Proceedings of the Membrane Computing, International Workshop, 2003

P Systems with Cutting/Recombination Rules Assigned to Membranes.

[BibT_eX]

[DOI]

Franziska Freund

,

,

,

Maurice Margenstern

,

,

Proceedings of the Membrane Computing, International Workshop, 2003

Reducing the Number of Catalysts Needed in Computationally Universal P Systems without Priorities.

[BibT_eX]

,

,

Proceedings of the 5th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2003, Budapest, Hungary, July 12, 2003

2002

GP Systems with Forbidding Context.

[BibT_eX]

[DOI]

,

Fundam. Informaticae, 2002

A Short Note on Analysing P Systems with Antiport Rules.

[BibT_eX]

,

Bull. EATCS, 2002

P Systems with Activated/Prohibited Membrane Channels.

[BibT_eX]

[DOI]

,

Proceedings of the Membrane Computing, International Workshop, 2002

Loading...