Oscar H. Ibarra

From MaRDI portal
Person:243823

Available identifiers

zbMath Open ibarra.oscar-hWikidataQ22005497 ScholiaQ22005497MaRDI QIDQ243823

List of research outcomes

PublicationDate of PublicationType
On some open problems concerning the complexity of cellular arrays2024-01-29Paper
On the complexity of commutativity analysis2024-01-29Paper
Unboundedness problems for machines with reversal-bounded counters2023-11-24Paper
On the complexity of decision problems for some classes of machines and applications2023-09-27Paper
Generalizations of Checking Stack Automata: Characterizations and Hierarchies2023-08-15Paper
Space Complexity of Stack Automata Models2023-08-15Paper
New characterizations of exponential, elementary, and non-elementary time-bounded Turing machines2023-05-19Paper
Space Complexity of Stack Automata Models2022-10-13Paper
On the complexity of decision problems for counter machines with applications to coding theory2022-08-11Paper
On finite-index indexed grammars and their restrictions2021-07-21Paper
Semilinearity of Families of Languages2021-04-19Paper
Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity2021-03-09Paper
https://portal.mardi4nfdi.de/entity/Q51465212021-01-26Paper
State grammars with stores2020-06-30Paper
Input-Position-Restricted Models of Language Acceptors2020-05-28Paper
New results concerning synchronized finite automata2019-12-04Paper
On families of full trios containing counter machine languages2019-11-13Paper
State grammars with stores2019-11-07Paper
On decidability and closure properties of language classes with respect to bio-operations2019-07-10Paper
On the overlap assembly of strings and languages2019-07-10Paper
Insertion operations on deterministic reversal-bounded counter machines2019-06-25Paper
On counting functions and slenderness of languages2019-06-18Paper
On store languages and applications2019-05-29Paper
New decidability results concerning two-way counter machines and applications2019-03-29Paper
Generalizations of checking stack automata: characterizations and hierarchies2018-11-22Paper
On counting functions of languages2018-11-22Paper
Semilinearity of families of languages2018-11-07Paper
Grammatical characterizations of NPDAs and VPDAs with counters2018-09-27Paper
On store languages of language acceptors2018-09-24Paper
[https://portal.mardi4nfdi.de/wiki/Publication:5376337 On the Density of Languages Accepted by Turing Machines and Other Machine Models]2018-09-17Paper
Parallel recognition and parsing on the hypercube2018-09-14Paper
Variations of checking stack automata: obtaining unexpected decidability properties2018-06-18Paper
Accepting runs in a two-way finite automaton2018-05-30Paper
On the Density of Context-Free and Counter Languages2018-05-15Paper
On the complexity and decidability of some problems involving shuffle2018-03-21Paper
Visibly Pushdown Automata and Transducers with Counters2017-11-09Paper
Variations of checking stack automata: obtaining unexpected decidability properties2017-10-13Paper
Information rate of some classes of non-regular languages: an automata-theoretic approach2017-09-28Paper
Deletion operations on deterministic families of automata2017-09-28Paper
Lossiness of communication channels modeled by transducers12017-07-21Paper
On finite-index indexed grammars and their restrictions2017-06-01Paper
Further remarks on DNA overlap assembly2017-03-16Paper
https://portal.mardi4nfdi.de/entity/Q55070642016-12-16Paper
Quantifying communication in synchronized languages2016-11-24Paper
On Bounded Semilinear Languages, Counter Machines, and Finite-Index ET0L2016-11-09Paper
On Families of Full Trios Containing Counter Machine Languages2016-08-30Paper
https://portal.mardi4nfdi.de/entity/Q57404222016-07-26Paper
Semilinear Sets and Counter Machines: a Brief Survey2016-05-11Paper
Insertion operations on deterministic reversal-bounded counter machines2016-04-08Paper
The effect of end-markers on counter machines and commutativity2016-04-01Paper
On the Ambiguity and Finite-Valuedness Problems in Acceptors and Transducers2016-02-17Paper
Execution information rate for some classes of automata2015-12-28Paper
On bounded languages and reversal-bounded automata2015-12-28Paper
On the Density of Context-Free and Counter Languages2015-11-10Paper
Quantifying Communication in Synchronized Languages2015-10-29Paper
Deletion operations on deterministic families of automata2015-09-30Paper
On the complexity and decidability of some problems involving shuffle2015-08-07Paper
ON REACHABILITY AND SAFETY IN INFINITE-STATE SYSTEMS2015-04-30Paper
SOME DECISION QUESTIONS CONCERNING THE TIME COMPLEXITY OF LANGUAGE ACCEPTORS2015-04-23Paper
Sampling a Two-Way Finite Automaton2015-04-14Paper
Lossiness of Communication Channels Modeled by Transducers2015-02-25Paper
Information Rate of Some Classes of Non-regular Languages: An Automata-Theoretic Approach2014-10-14Paper
On Decidability and Closure Properties of Language Classes with Respect to Bio-operations2014-10-08Paper
On the Ambiguity, Finite-Valuedness, and Lossiness Problems in Acceptors and Transducers2014-09-26Paper
Automata with Reversal-Bounded Counters: A Survey2014-08-07Paper
Automata-based symbolic string analysis for vulnerability detection2014-06-30Paper
On the Parikh Membership Problem for FAs, PDAs, and CMs2014-03-31Paper
An NP-complete number-theoretic problem2014-03-14Paper
HOW TO SYNCHRONIZE THE HEADS OF A MULTITAPE AUTOMATON2014-03-10Paper
Similarity in languages and programs2014-01-10Paper
On the open problem of Ginsburg concerning semilinear sets and related problems2014-01-10Paper
Some Decision Problems Concerning NPDAs, Palindromes, and Dyck Languages2013-08-07Paper
Some Decision Questions Concerning the Time Complexity of Language Acceptors2013-06-28Paper
CHARACTERIZATIONS OF BOUNDED SEMILINEAR LANGUAGES BY ONE-WAY AND TWO-WAY DETERMINISTIC MACHINES2013-06-06Paper
On the Boundedness Property of Semilinear Sets2013-05-28Paper
Execution Information Rate for Some Classes of Automata2013-03-18Paper
On Bounded Languages and Reversal-Bounded Automata2013-03-18Paper
One-reversal counter machines and multihead automata: revisited2012-10-11Paper
How to Synchronize the Heads of a Multitape Automaton2012-09-20Paper
On synchronized multi-tape and multi-head automata2012-08-13Paper
https://portal.mardi4nfdi.de/entity/Q28933052012-06-20Paper
Multitape NFA: Weak Synchronization of the Input Heads2012-06-15Paper
Weak Synchronization and Synchronizability of Multitape Pushdown Automata and Turing Machines2012-06-08Paper
On the containment and equivalence problems for two-way transducers2012-05-30Paper
On sets of numbers accepted by P/T systems composed by join2012-04-03Paper
RELATIONAL STRING VERIFICATION USING MULTI-TRACK AUTOMATA2012-03-13Paper
On Two-Way Transducers2011-07-29Paper
On the Containment and Equivalence Problems for GSMs, Transducers, and Linear CFGs2011-07-29Paper
On Synchronized Multitape and Multihead Automata2011-07-29Paper
ON STRONG REVERSIBILITY IN P SYSTEMS AND RELATED PROBLEMS2011-02-23Paper
One-Reversal Counter Machines and Multihead Automata: Revisited2011-02-15Paper
Relational String Verification Using Multi-track Automata2011-02-11Paper
On the universe, disjointness, and containment problems for simple machines2010-10-22Paper
Bond computing systems: a biologically inspired and high-level dynamics model for pervasive computing2010-09-16Paper
On spiking neural P systems2010-09-16Paper
On Stateless Multicounter Machines2010-07-28Paper
Computer Aided Verification2010-04-20Paper
On decision problems for parameterized machines2010-03-09Paper
On stateless multihead automata: hierarchies and the emptiness problem2010-02-05Paper
CHARACTERIZING REGULAR LANGUAGES BY SPIKING NEURAL P SYSTEMS2010-01-29Paper
A Look Back at Some Early Results in Membrane Computing2010-01-26Paper
Sequentiality Induced by Spike Number in SNP Systems2009-11-10Paper
Characterizations of some classes of spiking neural P systems2009-11-04Paper
Sequential SNP systems based on min/max spike number2009-08-07Paper
Hierarchies and Characterizations of Stateless Multicounter Machines2009-07-23Paper
On Stateless Multihead Finite Automata and Multihead Pushdown Automata2009-07-07Paper
Asynchronous spiking neural P systems2009-06-04Paper
Membrane Computing2009-05-15Paper
Counting Time in Computing with Cells2009-04-02Paper
On Bounded Symport/Antiport P Systems2009-04-02Paper
Symbolic String Verification: Combining String Analysis and Size Analysis2009-03-31Paper
Bond Computing Systems: A Biologically Inspired and High-Level Dynamics Model for Pervasive Computing2009-02-17Paper
Minimum-cost delegation in service composition2009-01-08Paper
DISCRETE NONDETERMINISTIC MODELING OF THE FAS PATHWAY2008-12-01Paper
ON STATELESS AUTOMATA AND P SYSTEMS2008-12-01Paper
Simulating FAS-induced apoptosis by using P systems2008-11-10Paper
Computing with cells: membrane systems – some complexity issues2008-10-28Paper
ON COUNTER MACHINES, REACHABILITY PROBLEMS, AND DIOPHANTINE EQUATIONS2008-09-25Paper
https://portal.mardi4nfdi.de/entity/Q35051222008-06-18Paper
https://portal.mardi4nfdi.de/entity/Q35051272008-06-18Paper
On spiking neural P systems and partially blind counter machines2008-05-20Paper
On Stateless Multihead Automata: Hierarchies and the Emptiness Problem2008-04-15Paper
Asynchronous Spiking Neural P Systems: Decidability and Undecidability2008-04-04Paper
Spiking Neural P Systems: Some Characterizations2008-02-26Paper
Mathematical Foundations of Computer Science 20032007-12-07Paper
On Spiking Neural P Systems and Partially Blind Counter Machines2007-11-29Paper
Characterizations of Some Restricted Spiking Neural P Systems2007-09-03Paper
On the computational complexity of P automata2007-04-19Paper
Normal forms for spiking neural P systems2007-03-27Paper
On symport/antiport P systems with a small number of objects2007-03-23Paper
Deterministic catalytic systems are not universal2007-01-09Paper
https://portal.mardi4nfdi.de/entity/Q34099842006-11-21Paper
Implementation and Application of Automata2006-11-13Paper
Membrane Computing2006-11-13Paper
Membrane Computing2006-11-13Paper
Mathematical Foundations of Computer Science 20052006-10-20Paper
DNA Computing2006-10-19Paper
Characterizations of context-sensitive languages and other language classes in terms of symport/antiport P systems2006-09-14Paper
Unconventional Computation2006-07-07Paper
On partially blind multihead finite automata.2006-05-18Paper
On the solvability of a class of Diophantine equations and applications2006-03-24Paper
Computing and Combinatorics2006-01-11Paper
Automata, Languages and Programming2006-01-10Paper
Developments in Language Theory2005-12-22Paper
Algorithms and Computation2005-12-22Paper
On determinism versus nondeterminism in P systems2005-12-05Paper
ON ONE-MEMBRANE P SYSTEMS OPERATING IN SEQUENTIAL MODE2005-11-14Paper
On composition and lookahead delegation of \(e\)-services modeled by automata2005-09-22Paper
Implementation and Application of Automata2005-08-17Paper
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science2005-08-12Paper
ON VARIOUS NOTIONS OF PARALLELISM IN P SYSTEMS2005-08-03Paper
VERIFICATION IN QUEUE-CONNECTED MULTICOUNTER MACHINES2005-06-22Paper
THE EXISTENCE OF ω-CHAINS FOR TRANSITIVE MIXED LINEAR RELATIONS AND ITS APPLICATIONS2005-06-22Paper
INSTANCE-SPECIFIC SOLUTIONS FOR ACCELERATING THE CKY PARSING OF LARGE CONTEXT-FREE GRAMMARS2005-06-22Paper
On membrane hierarchy in P systems2005-06-01Paper
https://portal.mardi4nfdi.de/entity/Q46733992005-04-29Paper
On two-way nondeterministic finite automata with one reversal-bounded counter2005-02-22Paper
On two-way FA with monotonic counters and quadratic Diophantine equations2004-10-27Paper
Catalytic P systems, semilinear sets, and vector addition systems2004-10-27Paper
https://portal.mardi4nfdi.de/entity/Q48198842004-10-05Paper
On the computational complexity of membrane systems2004-08-10Paper
https://portal.mardi4nfdi.de/entity/Q44740932004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44742132004-08-04Paper
Past pushdown timed automata and safety verification.2004-03-14Paper
Closure and decidability properties of some language classes with respect to ciliate bio-operations.2004-03-14Paper
https://portal.mardi4nfdi.de/entity/Q44492112004-02-08Paper
https://portal.mardi4nfdi.de/entity/Q44259462003-09-14Paper
Verification in loosely synchronous queue-connected discrete timed automata.2003-08-17Paper
Generalized discrete timed automata: Decidable approximations for safety verification.2003-08-17Paper
https://portal.mardi4nfdi.de/entity/Q44125702003-07-15Paper
https://portal.mardi4nfdi.de/entity/Q44121262003-07-13Paper
Eliminating the storage tape in reachability constructions.2003-05-25Paper
Some decision problems concerning semilinearity and commutation.2003-05-14Paper
https://portal.mardi4nfdi.de/entity/Q47821012003-05-12Paper
Counter machines and verification problems.2003-01-21Paper
Augmenting the discrete timed automaton with other data structures.2003-01-21Paper
https://portal.mardi4nfdi.de/entity/Q45366022002-11-28Paper
https://portal.mardi4nfdi.de/entity/Q47787592002-11-19Paper
https://portal.mardi4nfdi.de/entity/Q47787692002-11-19Paper
https://portal.mardi4nfdi.de/entity/Q45532422002-11-04Paper
https://portal.mardi4nfdi.de/entity/Q45409642002-07-28Paper
https://portal.mardi4nfdi.de/entity/Q45409652002-07-28Paper
https://portal.mardi4nfdi.de/entity/Q45363782002-06-25Paper
https://portal.mardi4nfdi.de/entity/Q45350492002-06-12Paper
https://portal.mardi4nfdi.de/entity/Q43313072002-05-15Paper
https://portal.mardi4nfdi.de/entity/Q27540742001-11-11Paper
https://portal.mardi4nfdi.de/entity/Q45257372001-01-24Paper
Image compression for fast wavelet-based subregion retrieval2000-08-21Paper
https://portal.mardi4nfdi.de/entity/Q49411502000-02-29Paper
A technique for proving decidability of containment and equivalence of linear constraint queries1999-11-23Paper
https://portal.mardi4nfdi.de/entity/Q42665371999-10-03Paper
https://portal.mardi4nfdi.de/entity/Q42603771999-09-19Paper
Adaptive partitioning and scheduling for enhancing WWW application performance1998-11-05Paper
On the parallel complexity of loops1998-07-22Paper
On the Complexity of Commutativity Analysis1997-09-15Paper
New Decidability Results Concerning Two-Way Counter Machines1996-01-02Paper
On communication-bounded synchronized alternating finite automata1995-08-17Paper
Fast parallel algorithms for solving triangular systems of linear equations on the hypercube1995-01-02Paper
https://portal.mardi4nfdi.de/entity/Q42815371994-11-13Paper
Synchronized finite automata and 2DFA reductions1994-10-19Paper
Some Efficient Algorithms for Permutation Graphs1994-05-05Paper
ON THE EQUIVALENCE OF TWO-WAY PUSHDOWN AUTOMATA AND COUNTER MACHINES OVER BOUNDED LANGUAGES1994-04-27Paper
Some results concerning 2-D on-line tessellation acceptors and 2-D alternating finite automata1994-04-05Paper
Quadtree building algorithms on an \(SIMD\) hypercube1994-01-09Paper
A note on simple programs with two variables1993-05-24Paper
https://portal.mardi4nfdi.de/entity/Q40352431993-05-18Paper
On Efficient Parallel Algorithms for Solving Set Recurrence Equations1993-05-16Paper
https://portal.mardi4nfdi.de/entity/Q40289041993-03-28Paper
A hierarchy result for 2-dimensional TM's operating in small space1992-09-27Paper
On space-bounded synchronized alternating Turing machines1992-09-27Paper
A characterization of exponential-time languages by alternating context- free grammars1992-09-27Paper
Parallel parsing on a one-way linear array of finite-state machines1992-06-28Paper
Iterative algorithms for the planar convex hull problem on mesh-connected arrays1992-06-28Paper
Learning regular languages from counterexamples1992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q47133701992-06-25Paper
Some classes of languages in \(NC^ 1\)1991-01-01Paper
The Power of Alternating One-Reversal Counters and Stacks1991-01-01Paper
An efficient all-parses systolic algorithm for general context-free parsing1990-01-01Paper
Systolic algorithms for some scheduling and graph problems1990-01-01Paper
Optimal simulation of tree arrays by linear arrays1989-01-01Paper
Efficient simulations of simple models of parallel computation by time- bounded ATMs and space-bounded TMs1989-01-01Paper
On iterative and cellular tree arrays1989-01-01Paper
Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33552421989-01-01Paper
Erratum to: Some observations concerning alternating Turing machines using small space1988-01-01Paper
Two-dimensional iterative arrays: Characterizations and applications1988-01-01Paper
Relating the power of cellular arrays to their closure properties1988-01-01Paper
Some subclasses of context-free languages in \(NC^ 1\)1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37952301988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38117061988-01-01Paper
Sublogarithmic-space turing machines, nonuniform space complexity, and closure properties1988-01-01Paper
Some observations concerning alternating Turing machines using small space1987-01-01Paper
On Efficient Simulations of Systolic Arrays by Random-Access Machines1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37699691987-01-01Paper
Parallel Parsing on a One-Way Array of Finite-State Machines1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37860021987-01-01Paper
On One-Way Cellular Arrays1987-01-01Paper
On pebble automata1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30263501986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37427541986-01-01Paper
Iterative tree arrays with logarithmic depth†1986-01-01Paper
On efficient recognition of transductions and relations1985-01-01Paper
Fast parallel language recognition by cellular automata1985-01-01Paper
Sequential Machine Characterizations of Trellis and Cellular Automata and Applications1985-01-01Paper
The equivalence problem and correctness formulas for a simple class of programs1985-01-01Paper
On simple programs with primitive conditional statements1985-01-01Paper
Some characterizations of multihead finite automata1985-01-01Paper
On space and time efficient TM simulations of some restricted classes of PDA's1985-01-01Paper
Some independence results in complexity theory†1985-01-01Paper
Characterizations and computational complexity of systolic trellis automata1984-01-01Paper
A characterization of systolic binary tree automata and applications1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32175821984-01-01Paper
A note on the complexity of program evaluation1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36852301984-01-01Paper
On some decision questions concerning pushdown machines1983-01-01Paper
Simple programming languages and restricted classes of Turing machines1983-01-01Paper
On the zero-inequivalence problem for loop programs1983-01-01Paper
On the finite-valuedness problem for sequential machines1983-01-01Paper
On the control power of integer division1983-01-01Paper
On the Space and Time Complexity of Functions Computable by Simple Programs1983-01-01Paper
Some Time-Space Tradeoff Results Concerning Single-Tape and Offline TM’<scp>s</scp>1983-01-01Paper
On the Simplification and Equivalence Problems for Straight-Line Programs1983-01-01Paper
Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs1983-01-01Paper
A note on finite-valued and finitely ambiguous transducers1983-01-01Paper
Some simplified undecidable and NP-hard problems for simple programs1982-01-01Paper
On some decision problems for RAM programs1982-01-01Paper
On the complexity of simple arithmetic expressions1982-01-01Paper
2DST mappings of languages and related problems1982-01-01Paper
The Complexity of the Equivalence Problem for Simple Loop-Free Programs1982-01-01Paper
Straight-Line Programs with One Input Variable1982-01-01Paper
A generalization of the fast LUP matrix decomposition algorithm and applications1982-01-01Paper
(Semi)alternating stack automata1982-01-01Paper
Two-Way Counter Machines and Diophantine Equations1982-01-01Paper
The complexity of the equivalence problem for two characterizations of Presburger sets1981-01-01Paper
The complexity of decision problems for finite-turn multicounter machines1981-01-01Paper
Probabilistic algorithms and straight-line programs for some rank decision problems1981-01-01Paper
Deterministic and probabilistic algorithms for maximum bipartite matching via fast matrix multiplication1981-01-01Paper
On the decidability of equivalence for deterministic pushdown transducers1981-01-01Paper
The Complexity of the Equivalence Problem for Simple Programs1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39120201981-01-01Paper
Characterizations of Presburger Functions1981-01-01Paper
On restricted one-counter machines1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39408451981-01-01Paper
Path Systems: Constructions, Solutions and Applications1980-01-01Paper
Simple counter machines and number-theoretic problems1979-01-01Paper
On the space complexity of recursive algorithms1979-01-01Paper
Some decision problems concerning sequential transducers and checking automata1979-01-01Paper
An NP-Complete Number-Theoretic Problem1979-01-01Paper
Restricted one-counter machines with undecidable universe problems1979-01-01Paper
On two-way sequential transductions of full semi-AFL's1978-01-01Paper
Reversal-Bounded Multicounter Machines and Their Decision Problems1978-01-01Paper
The Unsolvability of the Equivalence Problem for $\varepsilon $-Free NGSM’s with Unary Input (Output) Alphabet and Applications1978-01-01Paper
Approximation Algorithms for Certain Scheduling Problems1978-01-01Paper
Bounds for LPT Schedules on Uniform Processors1977-01-01Paper
Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors1977-01-01Paper
A useful device for showing the solvability of some decision problems1976-01-01Paper
Finite automata with multiplication1976-01-01Paper
On Two—Processor Scheduling of One— or Two—Unit Time Tasks with Precedence Constraints1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41403941976-01-01Paper
On 3-head versus 2-head finite automata1975-01-01Paper
Hierarchies of Turing machines with restricted tape alphabet size1975-01-01Paper
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems1975-01-01Paper
Polynomially Complete Fault Detection Problems1975-01-01Paper
A note on semilinear sets and bounded-reversal multihead pushdown automata1974-01-01Paper
Some results concerning automata on two-dimensional tapes1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56860241974-01-01Paper
A Hierarchy Theorem for Polynomial-Space Recognition1974-01-01Paper
Controlled pushdown automata1973-01-01Paper
On two-way multihead automata1973-01-01Paper
A Note Concerning Nondeterministic Tape Complexities1972-01-01Paper
Characterizations of transductions defined by abstract families of transducers1971-01-01Paper
Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata1971-01-01Paper
Simple matrix languages1970-01-01Paper
Tape-bounded Turing acceptors and principal AFLs1970-01-01Paper
Multi-tape and multi-head pushdown automata1968-01-01Paper
Ferromagnetic Wire Memory1967-01-01Paper
Two-way pushdown automata1967-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Oscar H. Ibarra

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:243823&oldid=10553883"
Powered by MediaWiki