default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHendrik Jan Hoogeboom
Person information
- affiliation: Leiden Institute of Advanced Computer Science, Netherlands
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j59]Daniela Genova, Hendrik Jan Hoogeboom, Jetty Kleijn:
Functional equivalence and a cover relation for reaction systems. Theor. Comput. Sci. 1004: 114633 (2024)- 2022
- [i14]Jérôme Durand-Lose, Hendrik Jan Hoogeboom, Natasa Jonoska:
Deterministic Non-cooperative Binding in Two-Dimensional Tile Assembly Systems Must Have Ultimately Periodic Paths. CoRR abs/2202.05165 (2022) - 2021
- [j58]Joost Engelfriet, Hendrik Jan Hoogeboom, Bart Samwel:
XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles. Theor. Comput. Sci. 850: 40-97 (2021) - [j57]Daniela Genova
, Hendrik Jan Hoogeboom, Jetty Kleijn:
Comparing reactions in reaction systems. Theor. Comput. Sci. 881: 83-96 (2021) - 2020
- [j56]Robert Brijder, Hendrik Jan Hoogeboom:
Counterexamples to a conjecture of Las Vergnas. Eur. J. Comb. 89: 103141 (2020) - [j55]Daniela Genova, Hendrik Jan Hoogeboom, Natasa Jonoska:
Companions and an Essential Motion of a Reaction System. Fundam. Informaticae 175(1-4): 187-199 (2020) - [j54]Daniela Genova, Hendrik Jan Hoogeboom, Zornitza Genova Prodanoff:
Extracting reaction systems from function behavior. J. Membr. Comput. 2(3): 194-206 (2020)
2010 – 2019
- 2019
- [i13]Jérôme Durand-Lose, Hendrik Jan Hoogeboom, Natasa Jonoska:
Deterministic 2-Dimensional Temperature-1 Tile Assembly Systems Cannot Compute. CoRR abs/1901.08575 (2019) - 2018
- [i12]Joost Engelfriet, Hendrik Jan Hoogeboom, Bart Samwel:
XML Navigation and Transformation by Tree-Walking Automata and Transducers with Visible and Invisible Pebbles. CoRR abs/1809.05730 (2018) - 2017
- [j53]Daniela Genova, Hendrik Jan Hoogeboom:
Enforcing Regular Languages. Fundam. Informaticae 154(1-4): 131-144 (2017) - [j52]Daniela Genova, Hendrik Jan Hoogeboom, Natasa Jonoska:
A graph isomorphism condition and equivalence of reaction systems. Theor. Comput. Sci. 701: 109-119 (2017) - [c32]Daniela Genova, Hendrik Jan Hoogeboom:
Finite Language Forbidding-Enforcing Systems. CiE 2017: 258-269 - 2016
- [i11]Hendrik Jan Hoogeboom, Walter A. Kosters, Jan N. van Rijn, Jonathan K. Vis:
Acyclic Constraint Logic and Games. CoRR abs/1604.05487 (2016) - 2014
- [j51]Robert Brijder, Hendrik Jan Hoogeboom:
Interlace polynomials for multimatroids and delta-matroids. Eur. J. Comb. 40: 142-167 (2014) - [j50]Hendrik Jan Hoogeboom, Walter A. Kosters, Jan N. van Rijn, Jonathan K. Vis:
Acyclic Constraint Logic and Games. J. Int. Comput. Games Assoc. 37(1): 3-16 (2014) - [c31]Robert Brijder, Hendrik Jan Hoogeboom:
Graph Polynomials Motivated by Gene Rearrangements in Ciliates. CiE 2014: 63-72 - [p3]Robert Brijder, Hendrik Jan Hoogeboom:
The Algebra of Gene Assembly in Ciliates. Discrete and Topological Models in Molecular Biology 2014: 289-307 - 2013
- [j49]Lorenzo Traldi, Robert Brijder, Hendrik Jan Hoogeboom:
The Adjacency Matroid of a Graph. Electron. J. Comb. 20(3): 27 (2013) - [j48]Rudy van Vliet, Hendrik Jan Hoogeboom:
Making DNA Expressions Minimal. Fundam. Informaticae 123(2): 199-226 (2013) - [j47]Rudy van Vliet, Hendrik Jan Hoogeboom:
A Minimal Normal Form for DNA Expressions. Fundam. Informaticae 123(2): 227-243 (2013) - [j46]Robert Brijder, Hendrik Jan Hoogeboom:
Nullity and Loop Complementation for Delta-Matroids. SIAM J. Discret. Math. 27(1): 492-506 (2013) - 2012
- [j45]Robert Brijder, Hendrik Jan Hoogeboom:
Binary Symmetric Matrix Inversion Through Local Complementation. Fundam. Informaticae 116(1-4): 15-23 (2012) - [j44]Linqiang Pan, Jun Wang, Hendrik Jan Hoogeboom:
Spiking Neural P Systems with Astrocytes. Neural Comput. 24(3): 805-825 (2012) - [j43]Giorgio Ausiello, Hendrik Jan Hoogeboom, Juhani Karhumäki, Ion Petre, Arto Salomaa:
Preface. Theor. Comput. Sci. 429: 1-20 (2012) - [j42]Robert Brijder, Tero Harju, Hendrik Jan Hoogeboom:
Pivots, determinants, and perfect matchings of graphs. Theor. Comput. Sci. 454: 64-71 (2012) - 2011
- [j41]Robert Brijder, Hendrik Jan Hoogeboom:
The group structure of pivot and loop complementation on graphs and set systems. Eur. J. Comb. 32(8): 1353-1367 (2011) - [j40]Linqiang Pan, Jun Wang, Hendrik Jan Hoogeboom:
Limited Asynchronous Spiking Neural P Systems. Fundam. Informaticae 110(1-4): 271-293 (2011) - [j39]Pierluigi Frisco, Hendrik Jan Hoogeboom:
P Systems and Topology: Some Suggestions for Research. Int. J. Found. Comput. Sci. 22(1): 179-190 (2011) - [j38]Francesco Bernardini, Robert Brijder, Matteo Cavaliere, Giuditta Franco, Hendrik Jan Hoogeboom, Grzegorz Rozenberg:
On aggregation in multiset-based self-assembly of graphs. Nat. Comput. 10(1): 17-38 (2011) - [c30]Linqiang Pan, Jun Wang, Hendrik Jan Hoogeboom:
Asynchronous Extended Spiking Neural P Systems with Astrocytes. Int. Conf. on Membrane Computing 2011: 243-256 - 2010
- [j37]Robert Brijder, Hendrik Jan Hoogeboom:
Maximal pivots on graphs with an application to gene assembly. Discret. Appl. Math. 158(18): 1977-1985 (2010) - [j36]Jun Wang, Hendrik Jan Hoogeboom, Linqiang Pan, Gheorghe Paun, Mario J. Pérez-Jiménez:
Spiking Neural P Systems with Weights. Neural Comput. 22(10): 2615-2646 (2010) - [j35]Robert Brijder, Hendrik Jan Hoogeboom:
Combining overlap and containment for gene assembly in ciliates. Theor. Comput. Sci. 411(6): 897-905 (2010) - [c29]Jun Wang, Hendrik Jan Hoogeboom, Linqiang Pan:
Spiking Neural P Systems with Neuron Division. Int. Conf. on Membrane Computing 2010: 361-376 - [c28]Robert Brijder, Hendrik Jan Hoogeboom:
Pivot and Loop Complementation on Graphs and Set Systems. TAMC 2010: 151-162
2000 – 2009
- 2009
- [j34]Robert Brijder, Hendrik Jan Hoogeboom, Grzegorz Rozenberg:
Reduction Graphs from Overlap Graphs for Gene Assembly in Ciliates. Int. J. Found. Comput. Sci. 20(2): 271-291 (2009) - [j33]Robert Brijder, Hendrik Jan Hoogeboom:
Perfectly quilted rectangular snake tilings. Theor. Comput. Sci. 410(16): 1486-1494 (2009) - [c27]Robert Brijder, Hendrik Jan Hoogeboom:
Reality-and-Desire in Ciliates. Algorithmic Bioprocesses 2009: 99-115 - [c26]Hendrik Jan Hoogeboom:
Automata Walking over Trees and Graphs. NCMA 2009: 11-14 - [i10]Robert Brijder, Hendrik Jan Hoogeboom:
Maximal Pivots on Graphs with an Application to Gene Assembly. CoRR abs/0909.3789 (2009) - [i9]Robert Brijder, Hendrik Jan Hoogeboom:
The Group Structure of Pivot and Loop Complementation on Graphs and Set Systems. CoRR abs/0909.4004 (2009) - [i8]Robert Brijder, Hendrik Jan Hoogeboom:
Nullity Invariance for Pivot and the Interlace Polynomial. CoRR abs/0912.0878 (2009) - 2008
- [j32]Robert Brijder, Hendrik Jan Hoogeboom:
The fibers and range of reduction graphs in ciliates. Acta Informatica 45(5): 383-402 (2008) - [j31]Robert Brijder, Hendrik Jan Hoogeboom, Michael Muskulus:
Strategies of loop recombination in ciliates. Discret. Appl. Math. 156(10): 1736-1753 (2008) - [j30]Hendrik Jan Hoogeboom, Walter A. Kosters, Jeroen F. J. Laros:
Selection of DNA Markers. IEEE Trans. Syst. Man Cybern. Part C 38(1): 26-32 (2008) - [c25]Robert Brijder, Hendrik Jan Hoogeboom:
Extending the Overlap Graph for Gene Assembly in Ciliates. LATA 2008: 137-148 - 2007
- [j29]Joost Engelfriet, Hendrik Jan Hoogeboom:
Finitary Compositions of Two-way Finite-State Transductions. Fundam. Informaticae 80(1-3): 111-123 (2007) - [j28]Yan Gao, Hendrik Jan Hoogeboom:
P Systems with Single passenger Carriers. Int. J. Found. Comput. Sci. 18(6): 1227-1235 (2007) - [j27]Joost Engelfriet, Hendrik Jan Hoogeboom:
Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure. Log. Methods Comput. Sci. 3(2) (2007) - [c24]Robert Brijder, Hendrik Jan Hoogeboom:
Characterizing Reduction Graphs for Gene Assembly in Ciliates. Developments in Language Theory 2007: 120-131 - [c23]Robert Brijder, Hendrik Jan Hoogeboom, Grzegorz Rozenberg:
From Micro to Macro: How the Overlap Graph Determines the Reduction Graph in Ciliates. FCT 2007: 149-160 - [c22]André H. Deutz, Rudy van Vliet, Hendrik Jan Hoogeboom:
High Spies (or How to Win a Programming Contest). FUN 2007: 93-107 - [c21]Joost Engelfriet, Hendrik Jan Hoogeboom, Bart Samwel:
XML transformation by tree-walking transducers with invisible pebbles. PODS 2007: 63-72 - [i7]Robert Brijder, Hendrik Jan Hoogeboom:
Extending the Overlap Graph for Gene Assembly in Ciliates. CoRR abs/0712.3380 (2007) - [i6]Robert Brijder, Hendrik Jan Hoogeboom:
The Fibers and Range of Reduction Graphs in Ciliates. CoRR abs/cs/0702041 (2007) - [i5]Robert Brijder, Hendrik Jan Hoogeboom, Grzegorz Rozenberg:
How Overlap Determines the Macronuclear Genes in Ciliates. CoRR abs/cs/0702171 (2007) - [i4]Joost Engelfriet, Hendrik Jan Hoogeboom:
Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure. CoRR abs/cs/0703079 (2007) - 2006
- [j26]Rudy van Vliet, Hendrik Jan Hoogeboom, Grzegorz Rozenberg:
The Construction of Minimal DNA Expressions. Nat. Comput. 5(2): 127-149 (2006) - [j25]Robert Brijder, Hendrik Jan Hoogeboom, Grzegorz Rozenberg:
Reducibility of gene patterns in ciliates using the breakpoint graph. Theor. Comput. Sci. 356(1-2): 26-45 (2006) - [c20]Robert Brijder, Hendrik Jan Hoogeboom, Michael Muskulus:
Applicability of Loop Recombination in Ciliates Using the Breakpoint Graph. CompLife 2006: 97-106 - [c19]Matteo Cavaliere, Pierluigi Frisco, Hendrik Jan Hoogeboom:
Computing by Only Observing. Developments in Language Theory 2006: 304-314 - [c18]Joost Engelfriet, Hendrik Jan Hoogeboom:
Nested Pebbles and Transitive Closure. STACS 2006: 477-488 - [e1]Hendrik Jan Hoogeboom, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa:
Membrane Computing, 7th International Workshop, WMC 2006, Leiden, The Netherlands, July 17-21, 2006, Revised, Selected, and Invited Papers. Lecture Notes in Computer Science 4361, Springer 2006, ISBN 3-540-69088-3 [contents] - [i3]Robert Brijder, Hendrik Jan Hoogeboom, Grzegorz Rozenberg:
Reducibility of Gene Patterns in Ciliates using the Breakpoint Graph. CoRR abs/cs/0601122 (2006) - [i2]Robert Brijder, Hendrik Jan Hoogeboom, Michael Muskulus:
Strategies of Loop Recombination in Ciliates. CoRR abs/cs/0601135 (2006) - 2005
- [j24]Vesa Halava, Tero Harju, Hendrik Jan Hoogeboom, Michel Latteux:
Equality sets for recursively enumerable languages. RAIRO Theor. Informatics Appl. 39(4): 661-675 (2005) - [c17]Robert Brijder, Hendrik Jan Hoogeboom, Grzegorz Rozenberg:
The Breakpoint Graph in Ciliates. CompLife 2005: 128-139 - 2004
- [j23]Pierluigi Frisco, Hendrik Jan Hoogeboom:
P systems with symport/antiport simulating counter automata. Acta Informatica 41(2-3): 145-170 (2004) - [j22]Ron Breukelaar, Erik D. Demaine, Susan Hohenberger, Hendrik Jan Hoogeboom, Walter A. Kosters, David Liben-Nowell:
Tetris is hard, even to approximate. Int. J. Comput. Geom. Appl. 14(1-2): 41-68 (2004) - [j21]Hendrik Jan Hoogeboom, Walter A. Kosters:
How to Construct Tetris Configurations. Int. J. Intell. Games Simul. 3(2): 97-105 (2004) - [j20]Hendrik Jan Hoogeboom, Walter A. Kosters:
Tetris and decidability. Inf. Process. Lett. 89(6): 267-272 (2004) - [j19]Vesa Halava, Tero Harju, Hendrik Jan Hoogeboom, Michel Latteux:
Valence Languages Generated by Equality Sets. J. Autom. Lang. Comb. 9(4): 399-406 (2004) - [c16]Rudy van Vliet, Hendrik Jan Hoogeboom, Grzegorz Rozenberg:
Combinatorial Aspects of Minimal DNA Expressions. DNA 2004: 375-388 - 2003
- [c15]Vesa Halava, Tero Harju, Hendrik Jan Hoogeboom, Michel Latteux:
Languages Defined by Generalized Equality Sets. FCT 2003: 355-363 - 2002
- [j18]Pierluigi Frisco, Hendrik Jan Hoogeboom, Paul Sant:
A Direct Construction of a Universal P System. Fundam. Informaticae 49(1-3): 103-122 (2002) - [c14]Hendrik Jan Hoogeboom, Nike van Vugt:
Upper Bounds for Restricted Splicing. Formal and Natural Computing 2002: 361-375 - [c13]Hendrik Jan Hoogeboom:
Carriers and Counters: P Systems with Carriers vs. (Blind) Counter Automata. Developments in Language Theory 2002: 140-151 - [c12]Pierluigi Frisco, Hendrik Jan Hoogeboom:
Simulating Counter Automata by P Systems with Symport/Antiport. WMC-CdeA 2002: 288-301 - 2001
- [j17]Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg, Nike van Vugt:
Sequences of languages in forbidding-enforcing families. Soft Comput. 5(2): 121-125 (2001) - [j16]Joost Engelfriet, Hendrik Jan Hoogeboom:
MSO definable string transductions and two-way finite-state transducers. ACM Trans. Comput. Log. 2(2): 216-254 (2001) - [c11]Ray Dassen, Hendrik Jan Hoogeboom, Nike van Vugt:
A characterization of non-iterated splicing with regular rules. Where Mathematics, Computer Science, Linguistics and Biology Meet 2001: 319-327 - [c10]Hendrik Jan Hoogeboom:
Context-Free Valence Grammars - Revisited. Developments in Language Theory 2001: 293-303 - 2000
- [j15]Hendrik Jan Hoogeboom, Nike van Vugt:
Fair sticker languages. Acta Informatica 37(3): 213-225 (2000)
1990 – 1999
- 1999
- [j14]Joost Engelfriet, Hendrik Jan Hoogeboom, Jan-Pascal van Best:
Trips on Trees. Acta Cybern. 14(1): 51-64 (1999) - [c9]Joost Engelfriet, Hendrik Jan Hoogeboom:
Tree-Walking Pebble Automata. Jewels are Forever 1999: 72-83 - [c8]Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg, Nike van Vugt:
Forbidding and enforcing. DNA Based Computers 1999: 195-206 - [c7]Joost Engelfriet, Hendrik Jan Hoogeboom:
Two-Way Finite State Transducers and Monadic Second-Order Logic. ICALP 1999: 311-320 - [i1]Joost Engelfriet, Hendrik Jan Hoogeboom:
MSO definable string transductions and two-way finite state transducers. CoRR cs.LO/9906007 (1999) - 1997
- [j13]Hendrik Jan Hoogeboom, Paulien ten Pas:
Monadic Second-Order Definable Text Languages. Theory Comput. Syst. 30(4): 335-354 (1997) - [j12]Hendrik Jan Hoogeboom, Anca Muscholl:
The Code Problem for Traces - Improving the Boundaries. Theor. Comput. Sci. 172(1-2): 309-321 (1997) - 1996
- [j11]Hendrik Jan Hoogeboom, Paulien ten Pas:
Text Languages in an Algebraic Framework. Fundam. Informaticae 25(3): 353-380 (1996) - 1995
- [p2]Hendrik Jan Hoogeboom, Grzegorz Rozenberg:
Dependence Graphs. The Book of Traces 1995: 43-67 - 1994
- [j10]Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg:
Combinatorial Properties of Dependence Graphs. Inf. Comput. 114(2): 315-328 (1994) - [c6]Tero Harju, Hendrik Jan Hoogeboom, H. C. M. Kleijn:
Identities and Transductions. Results and Trends in Theoretical Computer Science 1994: 140-144 - [c5]Hendrik Jan Hoogeboom, Paulien ten Pas:
MSO Definable Text Languages. MFCS 1994: 413-422 - 1993
- [j9]Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg:
On the Structure of Recognizable Languages of Dependence Graphs. RAIRO Theor. Informatics Appl. 27(1): 7-22 (1993) - [j8]Joost Engelfriet, Hendrik Jan Hoogeboom:
X-Automata on omega-Words. Theor. Comput. Sci. 110(1): 1-51 (1993) - [c4]Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Paulien ten Pas, Grzegorz Rozenberg:
An Introduction to Context-free Text Grammars. Developments in Language Theory 1993: 357-369 - 1991
- [j7]Hendrik Jan Hoogeboom, Grzegorz Rozenberg:
Diamond properties of elementary net systems. Fundam. Informaticae 14(3): 287-300 (1991)
1980 – 1989
- 1989
- [j6]IJsbrand Jan Aalbersberg, Hendrik Jan Hoogeboom:
Characterizations of the Decidability of Some Problems for Regular Trace Languages. Math. Syst. Theory 22(1): 1-19 (1989) - [c3]Joost Engelfriet, Hendrik Jan Hoogeboom:
Automata with Storage on Infinite Words. ICALP 1989: 289-303 - 1988
- [j5]Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg:
Recording the Use of Memory in Right-Boundary Grammars and Push-Down Automata. Acta Informatica 25(2): 203-231 (1988) - [j4]Joost Engelfriet, Hendrik Jan Hoogeboom:
Prefix and Equality Languages of Rational Functions are Co-Context-Free. Inf. Process. Lett. 28(2): 77-79 (1988) - 1987
- [c2]IJsbrand Jan Aalbersberg, Hendrik Jan Hoogeboom:
Decision Problems for Regular Trace Languages. ICALP 1987: 250-259 - 1986
- [j3]Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg:
Coordinated Pair Systems; Part I: Dyck Works and Classical Pumping. RAIRO Theor. Informatics Appl. 20(4): 405-424 (1986) - [j2]Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg:
Coordinated Pair Systems; Part II: Sparse Structure of Dyck Words and Ogden's Lemma. RAIRO Theor. Informatics Appl. 20(4): 425-439 (1986) - [j1]Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg:
On the Active and Full Use of Memory in Right-Boundary Grammars and Push-Down Automata. Theor. Comput. Sci. 48(3): 201-228 (1986) - [p1]Hendrik Jan Hoogeboom, Grzegorz Rozenberg:
Infinitary Languages: Basic Theory an Applications to Concurrent Systems. Current Trends in Concurrency 1986: 266-342 - 1985
- [c1]Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg:
On coordinated rewriting. FCT 1985: 100-111
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:15 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
