Wojciech Fraczak

According to our database1, Wojciech Fraczak
  • authored at least 27 papers between 1995 and 2014.
  • has a "Dijkstra number"2 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2014
Corrections to "Finding dominators via disjoint set union" [J. Discrete Algorithms 23 (2013) 2-20].
J. Discrete Algorithms, 2014

2013
Finding dominators via disjoint set union.
J. Discrete Algorithms, 2013

Finding Dominators via Disjoint Set Union.
CoRR, 2013

2012
Disjoint Set Forest Digraph Representation for an Efficient Dominator Tree Construction.
Proceedings of the Combinatorial Algorithms, 23rd International Workshop, 2012

2008
Computing the throughput of Concatenation State Machines.
J. Discrete Algorithms, 2008

Matching Integer Intervals by Minimal Sets of Binary Words with don't cares.
Proceedings of the Combinatorial Pattern Matching, 19th Annual Symposium, 2008

2007
Equivalence of simple functions.
Theor. Comput. Sci., 2007

Reducing Simple Grammars: Exponential against Highly-Polynomial Time in Practice.
Int. J. Found. Comput. Sci., 2007

Efficient Computation of Throughput Values of Context-Free Languages.
Proceedings of the Implementation and Application of Automata, 2007

2006
Prime normal form and equivalence of simple grammars.
Theor. Comput. Sci., 2006

Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice.
Proceedings of the Implementation and Application of Automata, 2006

Two Level State Machine Architecture for Content Inspection Engines.
Proceedings of the INFOCOM 2006. 25th IEEE International Conference on Computer Communications, 2006

A Criterion for Speed Evaluation of Content Inspection Engines.
Proceedings of the Fifth International Conference on Networking and the International Conference on Systems (ICN / ICONS / MCL 2006), 2006

Equivalence of Functions Represented by Simple Context-Free Grammars with Output.
Proceedings of the Developments in Language Theory, 10th International Conference, 2006

2005
Transducers with Set Output.
Journal of Automata, Languages and Combinatorics, 2005

Prime Normal Form and Equivalence of Simple Grammars.
Proceedings of the Implementation and Application of Automata, 2005

2004
A characterization of s-languages.
Inf. Process. Lett., 2004

Concatenation State Machines and Simple Functions.
Proceedings of the Implementation and Application of Automata, 2004

2003
Linear-Time Prime Decomposition Of Regular Prefix Codes.
Int. J. Found. Comput. Sci., 2003

2002
Prime Decompositions of Regular Prefix Codes.
Proceedings of the Implementation and Application of Automata, 2002

Transducers with Set Output.
Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

2001
Dynamic Task Communication for Concurrent Processing in Distributed Systems.
Concurrent Engineering: R&A, 2001

1998
A Non-SOS Operational Semantics for a Process Algebra.
Inf. Process. Lett., 1998

M-Nets: An Algebra of High-Level Petri Nets, with an Application to the Semantics of Concurrent Programming Languages.
Acta Inf., 1998

1997
Improved Implementations via a New Structural Equivalence on Labelled Nets.
Proceedings of the Application and Theory of Petri Nets 1997, 1997

1995
Multi-Action Process Algebra.
Proceedings of the Algorithms, 1995

A Class of Composable High Level Petri Nets with an Application to the Semantics of B(PN)2.
Proceedings of the Application and Theory of Petri Nets 1995, 1995


  Loading...